diff --git a/dist/0.js b/dist/0.js new file mode 100644 index 0000000..718e858 --- /dev/null +++ b/dist/0.js @@ -0,0 +1,6872 @@ +(window["webpackJsonp"] = window["webpackJsonp"] || []).push([[0],{ + +/***/ "../node_modules/geotiff/node_modules/pako/dist/pako.esm.mjs": +/*!*******************************************************************!*\ + !*** ../node_modules/geotiff/node_modules/pako/dist/pako.esm.mjs ***! + \*******************************************************************/ +/*! exports provided: Deflate, Inflate, constants, default, deflate, deflateRaw, gzip, inflate, inflateRaw, ungzip */ +/***/ (function(__webpack_module__, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Deflate", function() { return Deflate_1; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Inflate", function() { return Inflate_1; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "constants", function() { return constants_1; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return pako; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "deflate", function() { return deflate_1; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "deflateRaw", function() { return deflateRaw_1; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "gzip", function() { return gzip_1; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "inflate", function() { return inflate_1; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "inflateRaw", function() { return inflateRaw_1; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ungzip", function() { return ungzip_1; }); + +/*! pako 2.0.4 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +/* eslint-disable space-unary-ops */ + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + + +//const Z_FILTERED = 1; +//const Z_HUFFMAN_ONLY = 2; +//const Z_RLE = 3; +const Z_FIXED$1 = 4; +//const Z_DEFAULT_STRATEGY = 0; + +/* Possible values of the data_type field (though see inflate()) */ +const Z_BINARY = 0; +const Z_TEXT = 1; +//const Z_ASCII = 1; // = Z_TEXT +const Z_UNKNOWN$1 = 2; + +/*============================================================================*/ + + +function zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } } + +// From zutil.h + +const STORED_BLOCK = 0; +const STATIC_TREES = 1; +const DYN_TREES = 2; +/* The three kinds of block type */ + +const MIN_MATCH$1 = 3; +const MAX_MATCH$1 = 258; +/* The minimum and maximum match lengths */ + +// From deflate.h +/* =========================================================================== + * Internal compression state. + */ + +const LENGTH_CODES$1 = 29; +/* number of length codes, not counting the special END_BLOCK code */ + +const LITERALS$1 = 256; +/* number of literal bytes 0..255 */ + +const L_CODES$1 = LITERALS$1 + 1 + LENGTH_CODES$1; +/* number of Literal or Length codes, including the END_BLOCK code */ + +const D_CODES$1 = 30; +/* number of distance codes */ + +const BL_CODES$1 = 19; +/* number of codes used to transfer the bit lengths */ + +const HEAP_SIZE$1 = 2 * L_CODES$1 + 1; +/* maximum heap size */ + +const MAX_BITS$1 = 15; +/* All codes must not exceed MAX_BITS bits */ + +const Buf_size = 16; +/* size of bit buffer in bi_buf */ + + +/* =========================================================================== + * Constants + */ + +const MAX_BL_BITS = 7; +/* Bit length codes must not exceed MAX_BL_BITS bits */ + +const END_BLOCK = 256; +/* end of block literal code */ + +const REP_3_6 = 16; +/* repeat previous bit length 3-6 times (2 bits of repeat count) */ + +const REPZ_3_10 = 17; +/* repeat a zero length 3-10 times (3 bits of repeat count) */ + +const REPZ_11_138 = 18; +/* repeat a zero length 11-138 times (7 bits of repeat count) */ + +/* eslint-disable comma-spacing,array-bracket-spacing */ +const extra_lbits = /* extra bits for each length code */ + 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]); + +const extra_dbits = /* extra bits for each distance code */ + 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]); + +const extra_blbits = /* extra bits for each bit length code */ + new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]); + +const bl_order = + new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]); +/* eslint-enable comma-spacing,array-bracket-spacing */ + +/* The lengths of the bit length codes are sent in order of decreasing + * probability, to avoid transmitting the lengths for unused bit length codes. + */ + +/* =========================================================================== + * Local data. These are initialized only once. + */ + +// We pre-fill arrays with 0 to avoid uninitialized gaps + +const DIST_CODE_LEN = 512; /* see definition of array dist_code below */ + +// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1 +const static_ltree = new Array((L_CODES$1 + 2) * 2); +zero$1(static_ltree); +/* The static literal tree. Since the bit lengths are imposed, there is no + * need for the L_CODES extra codes used during heap construction. However + * The codes 286 and 287 are needed to build a canonical tree (see _tr_init + * below). + */ + +const static_dtree = new Array(D_CODES$1 * 2); +zero$1(static_dtree); +/* The static distance tree. (Actually a trivial tree since all codes use + * 5 bits.) + */ + +const _dist_code = new Array(DIST_CODE_LEN); +zero$1(_dist_code); +/* Distance codes. The first 256 values correspond to the distances + * 3 .. 258, the last 256 values correspond to the top 8 bits of + * the 15 bit distances. + */ + +const _length_code = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1); +zero$1(_length_code); +/* length code for each normalized match length (0 == MIN_MATCH) */ + +const base_length = new Array(LENGTH_CODES$1); +zero$1(base_length); +/* First normalized length for each code (0 = MIN_MATCH) */ + +const base_dist = new Array(D_CODES$1); +zero$1(base_dist); +/* First normalized distance for each code (0 = distance of 1) */ + + +function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) { + + this.static_tree = static_tree; /* static tree or NULL */ + this.extra_bits = extra_bits; /* extra bits for each code or NULL */ + this.extra_base = extra_base; /* base index for extra_bits */ + this.elems = elems; /* max number of elements in the tree */ + this.max_length = max_length; /* max bit length for the codes */ + + // show if `static_tree` has data or dummy - needed for monomorphic objects + this.has_stree = static_tree && static_tree.length; +} + + +let static_l_desc; +let static_d_desc; +let static_bl_desc; + + +function TreeDesc(dyn_tree, stat_desc) { + this.dyn_tree = dyn_tree; /* the dynamic tree */ + this.max_code = 0; /* largest code with non zero frequency */ + this.stat_desc = stat_desc; /* the corresponding static tree */ +} + + + +const d_code = (dist) => { + + return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)]; +}; + + +/* =========================================================================== + * Output a short LSB first on the stream. + * IN assertion: there is enough room in pendingBuf. + */ +const put_short = (s, w) => { +// put_byte(s, (uch)((w) & 0xff)); +// put_byte(s, (uch)((ush)(w) >> 8)); + s.pending_buf[s.pending++] = (w) & 0xff; + s.pending_buf[s.pending++] = (w >>> 8) & 0xff; +}; + + +/* =========================================================================== + * Send a value on a given number of bits. + * IN assertion: length <= 16 and value fits in length bits. + */ +const send_bits = (s, value, length) => { + + if (s.bi_valid > (Buf_size - length)) { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + put_short(s, s.bi_buf); + s.bi_buf = value >> (Buf_size - s.bi_valid); + s.bi_valid += length - Buf_size; + } else { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + s.bi_valid += length; + } +}; + + +const send_code = (s, c, tree) => { + + send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/); +}; + + +/* =========================================================================== + * Reverse the first len bits of a code, using straightforward code (a faster + * method would use a table) + * IN assertion: 1 <= len <= 15 + */ +const bi_reverse = (code, len) => { + + let res = 0; + do { + res |= code & 1; + code >>>= 1; + res <<= 1; + } while (--len > 0); + return res >>> 1; +}; + + +/* =========================================================================== + * Flush the bit buffer, keeping at most 7 bits in it. + */ +const bi_flush = (s) => { + + if (s.bi_valid === 16) { + put_short(s, s.bi_buf); + s.bi_buf = 0; + s.bi_valid = 0; + + } else if (s.bi_valid >= 8) { + s.pending_buf[s.pending++] = s.bi_buf & 0xff; + s.bi_buf >>= 8; + s.bi_valid -= 8; + } +}; + + +/* =========================================================================== + * Compute the optimal bit lengths for a tree and update the total bit length + * for the current block. + * IN assertion: the fields freq and dad are set, heap[heap_max] and + * above are the tree nodes sorted by increasing frequency. + * OUT assertions: the field len is set to the optimal bit length, the + * array bl_count contains the frequencies for each bit length. + * The length opt_len is updated; static_len is also updated if stree is + * not null. + */ +const gen_bitlen = (s, desc) => +// deflate_state *s; +// tree_desc *desc; /* the tree descriptor */ +{ + const tree = desc.dyn_tree; + const max_code = desc.max_code; + const stree = desc.stat_desc.static_tree; + const has_stree = desc.stat_desc.has_stree; + const extra = desc.stat_desc.extra_bits; + const base = desc.stat_desc.extra_base; + const max_length = desc.stat_desc.max_length; + let h; /* heap index */ + let n, m; /* iterate over the tree elements */ + let bits; /* bit length */ + let xbits; /* extra bits */ + let f; /* frequency */ + let overflow = 0; /* number of elements with bit length too large */ + + for (bits = 0; bits <= MAX_BITS$1; bits++) { + s.bl_count[bits] = 0; + } + + /* In a first pass, compute the optimal bit lengths (which may + * overflow in the case of the bit length tree). + */ + tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */ + + for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) { + n = s.heap[h]; + bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1; + if (bits > max_length) { + bits = max_length; + overflow++; + } + tree[n * 2 + 1]/*.Len*/ = bits; + /* We overwrite tree[n].Dad which is no longer needed */ + + if (n > max_code) { continue; } /* not a leaf node */ + + s.bl_count[bits]++; + xbits = 0; + if (n >= base) { + xbits = extra[n - base]; + } + f = tree[n * 2]/*.Freq*/; + s.opt_len += f * (bits + xbits); + if (has_stree) { + s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits); + } + } + if (overflow === 0) { return; } + + // Trace((stderr,"\nbit length overflow\n")); + /* This happens for example on obj2 and pic of the Calgary corpus */ + + /* Find the first bit length which could increase: */ + do { + bits = max_length - 1; + while (s.bl_count[bits] === 0) { bits--; } + s.bl_count[bits]--; /* move one leaf down the tree */ + s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */ + s.bl_count[max_length]--; + /* The brother of the overflow item also moves one step up, + * but this does not affect bl_count[max_length] + */ + overflow -= 2; + } while (overflow > 0); + + /* Now recompute all bit lengths, scanning in increasing frequency. + * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all + * lengths instead of fixing only the wrong ones. This idea is taken + * from 'ar' written by Haruhiko Okumura.) + */ + for (bits = max_length; bits !== 0; bits--) { + n = s.bl_count[bits]; + while (n !== 0) { + m = s.heap[--h]; + if (m > max_code) { continue; } + if (tree[m * 2 + 1]/*.Len*/ !== bits) { + // Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); + s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/; + tree[m * 2 + 1]/*.Len*/ = bits; + } + n--; + } + } +}; + + +/* =========================================================================== + * Generate the codes for a given tree and bit counts (which need not be + * optimal). + * IN assertion: the array bl_count contains the bit length statistics for + * the given tree and the field len is set for all tree elements. + * OUT assertion: the field code is set for all tree elements of non + * zero code length. + */ +const gen_codes = (tree, max_code, bl_count) => +// ct_data *tree; /* the tree to decorate */ +// int max_code; /* largest code with non zero frequency */ +// ushf *bl_count; /* number of codes at each bit length */ +{ + const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */ + let code = 0; /* running code value */ + let bits; /* bit index */ + let n; /* code index */ + + /* The distribution counts are first used to generate the code values + * without bit reversal. + */ + for (bits = 1; bits <= MAX_BITS$1; bits++) { + next_code[bits] = code = (code + bl_count[bits - 1]) << 1; + } + /* Check that the bit counts in bl_count are consistent. The last code + * must be all ones. + */ + //Assert (code + bl_count[MAX_BITS]-1 == (1< { + + let n; /* iterates over tree elements */ + let bits; /* bit counter */ + let length; /* length value */ + let code; /* code value */ + let dist; /* distance index */ + const bl_count = new Array(MAX_BITS$1 + 1); + /* number of codes at each bit length for an optimal tree */ + + // do check in _tr_init() + //if (static_init_done) return; + + /* For some embedded targets, global variables are not initialized: */ +/*#ifdef NO_INIT_GLOBAL_POINTERS + static_l_desc.static_tree = static_ltree; + static_l_desc.extra_bits = extra_lbits; + static_d_desc.static_tree = static_dtree; + static_d_desc.extra_bits = extra_dbits; + static_bl_desc.extra_bits = extra_blbits; +#endif*/ + + /* Initialize the mapping length (0..255) -> length code (0..28) */ + length = 0; + for (code = 0; code < LENGTH_CODES$1 - 1; code++) { + base_length[code] = length; + for (n = 0; n < (1 << extra_lbits[code]); n++) { + _length_code[length++] = code; + } + } + //Assert (length == 256, "tr_static_init: length != 256"); + /* Note that the length 255 (match length 258) can be represented + * in two different ways: code 284 + 5 bits or code 285, so we + * overwrite length_code[255] to use the best encoding: + */ + _length_code[length - 1] = code; + + /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ + dist = 0; + for (code = 0; code < 16; code++) { + base_dist[code] = dist; + for (n = 0; n < (1 << extra_dbits[code]); n++) { + _dist_code[dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: dist != 256"); + dist >>= 7; /* from now on, all distances are divided by 128 */ + for (; code < D_CODES$1; code++) { + base_dist[code] = dist << 7; + for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) { + _dist_code[256 + dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: 256+dist != 512"); + + /* Construct the codes of the static literal tree */ + for (bits = 0; bits <= MAX_BITS$1; bits++) { + bl_count[bits] = 0; + } + + n = 0; + while (n <= 143) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + while (n <= 255) { + static_ltree[n * 2 + 1]/*.Len*/ = 9; + n++; + bl_count[9]++; + } + while (n <= 279) { + static_ltree[n * 2 + 1]/*.Len*/ = 7; + n++; + bl_count[7]++; + } + while (n <= 287) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + /* Codes 286 and 287 do not exist, but we must include them in the + * tree construction to get a canonical Huffman tree (longest code + * all ones) + */ + gen_codes(static_ltree, L_CODES$1 + 1, bl_count); + + /* The static distance tree is trivial: */ + for (n = 0; n < D_CODES$1; n++) { + static_dtree[n * 2 + 1]/*.Len*/ = 5; + static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5); + } + + // Now data ready and we can init static trees + static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1); + static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES$1, MAX_BITS$1); + static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES$1, MAX_BL_BITS); + + //static_init_done = true; +}; + + +/* =========================================================================== + * Initialize a new block. + */ +const init_block = (s) => { + + let n; /* iterates over tree elements */ + + /* Initialize the trees. */ + for (n = 0; n < L_CODES$1; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < D_CODES$1; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; } + + s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1; + s.opt_len = s.static_len = 0; + s.last_lit = s.matches = 0; +}; + + +/* =========================================================================== + * Flush the bit buffer and align the output on a byte boundary + */ +const bi_windup = (s) => +{ + if (s.bi_valid > 8) { + put_short(s, s.bi_buf); + } else if (s.bi_valid > 0) { + //put_byte(s, (Byte)s->bi_buf); + s.pending_buf[s.pending++] = s.bi_buf; + } + s.bi_buf = 0; + s.bi_valid = 0; +}; + +/* =========================================================================== + * Copy a stored block, storing first the length and its + * one's complement if requested. + */ +const copy_block = (s, buf, len, header) => +//DeflateState *s; +//charf *buf; /* the input data */ +//unsigned len; /* its length */ +//int header; /* true if block header must be written */ +{ + bi_windup(s); /* align on byte boundary */ + + if (header) { + put_short(s, len); + put_short(s, ~len); + } +// while (len--) { +// put_byte(s, *buf++); +// } + s.pending_buf.set(s.window.subarray(buf, buf + len), s.pending); + s.pending += len; +}; + +/* =========================================================================== + * Compares to subtrees, using the tree depth as tie breaker when + * the subtrees have equal frequency. This minimizes the worst case length. + */ +const smaller = (tree, n, m, depth) => { + + const _n2 = n * 2; + const _m2 = m * 2; + return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ || + (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m])); +}; + +/* =========================================================================== + * Restore the heap property by moving down the tree starting at node k, + * exchanging a node with the smallest of its two sons if necessary, stopping + * when the heap property is re-established (each father smaller than its + * two sons). + */ +const pqdownheap = (s, tree, k) => +// deflate_state *s; +// ct_data *tree; /* the tree to restore */ +// int k; /* node to move down */ +{ + const v = s.heap[k]; + let j = k << 1; /* left son of k */ + while (j <= s.heap_len) { + /* Set j to the smallest of the two sons: */ + if (j < s.heap_len && + smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) { + j++; + } + /* Exit if v is smaller than both sons */ + if (smaller(tree, v, s.heap[j], s.depth)) { break; } + + /* Exchange v with the smallest son */ + s.heap[k] = s.heap[j]; + k = j; + + /* And continue down the tree, setting j to the left son of k */ + j <<= 1; + } + s.heap[k] = v; +}; + + +// inlined manually +// const SMALLEST = 1; + +/* =========================================================================== + * Send the block data compressed using the given Huffman trees + */ +const compress_block = (s, ltree, dtree) => +// deflate_state *s; +// const ct_data *ltree; /* literal tree */ +// const ct_data *dtree; /* distance tree */ +{ + let dist; /* distance of matched string */ + let lc; /* match length or unmatched char (if dist == 0) */ + let lx = 0; /* running index in l_buf */ + let code; /* the code to send */ + let extra; /* number of extra bits to send */ + + if (s.last_lit !== 0) { + do { + dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]); + lc = s.pending_buf[s.l_buf + lx]; + lx++; + + if (dist === 0) { + send_code(s, lc, ltree); /* send a literal byte */ + //Tracecv(isgraph(lc), (stderr," '%c' ", lc)); + } else { + /* Here, lc is the match length - MIN_MATCH */ + code = _length_code[lc]; + send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */ + extra = extra_lbits[code]; + if (extra !== 0) { + lc -= base_length[code]; + send_bits(s, lc, extra); /* send the extra length bits */ + } + dist--; /* dist is now the match distance - 1 */ + code = d_code(dist); + //Assert (code < D_CODES, "bad d_code"); + + send_code(s, code, dtree); /* send the distance code */ + extra = extra_dbits[code]; + if (extra !== 0) { + dist -= base_dist[code]; + send_bits(s, dist, extra); /* send the extra distance bits */ + } + } /* literal or match pair ? */ + + /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */ + //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx, + // "pendingBuf overflow"); + + } while (lx < s.last_lit); + } + + send_code(s, END_BLOCK, ltree); +}; + + +/* =========================================================================== + * Construct one Huffman tree and assigns the code bit strings and lengths. + * Update the total bit length for the current block. + * IN assertion: the field freq is set for all tree elements. + * OUT assertions: the fields len and code are set to the optimal bit length + * and corresponding code. The length opt_len is updated; static_len is + * also updated if stree is not null. The field max_code is set. + */ +const build_tree = (s, desc) => +// deflate_state *s; +// tree_desc *desc; /* the tree descriptor */ +{ + const tree = desc.dyn_tree; + const stree = desc.stat_desc.static_tree; + const has_stree = desc.stat_desc.has_stree; + const elems = desc.stat_desc.elems; + let n, m; /* iterate over heap elements */ + let max_code = -1; /* largest code with non zero frequency */ + let node; /* new node being created */ + + /* Construct the initial heap, with least frequent element in + * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. + * heap[0] is not used. + */ + s.heap_len = 0; + s.heap_max = HEAP_SIZE$1; + + for (n = 0; n < elems; n++) { + if (tree[n * 2]/*.Freq*/ !== 0) { + s.heap[++s.heap_len] = max_code = n; + s.depth[n] = 0; + + } else { + tree[n * 2 + 1]/*.Len*/ = 0; + } + } + + /* The pkzip format requires that at least one distance code exists, + * and that at least one bit should be sent even if there is only one + * possible code. So to avoid special checks later on we force at least + * two codes of non zero frequency. + */ + while (s.heap_len < 2) { + node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0); + tree[node * 2]/*.Freq*/ = 1; + s.depth[node] = 0; + s.opt_len--; + + if (has_stree) { + s.static_len -= stree[node * 2 + 1]/*.Len*/; + } + /* node is 0 or 1 so it does not have extra bits */ + } + desc.max_code = max_code; + + /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, + * establish sub-heaps of increasing lengths: + */ + for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); } + + /* Construct the Huffman tree by repeatedly combining the least two + * frequent nodes. + */ + node = elems; /* next internal node of the tree */ + do { + //pqremove(s, tree, n); /* n = node of least frequency */ + /*** pqremove ***/ + n = s.heap[1/*SMALLEST*/]; + s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--]; + pqdownheap(s, tree, 1/*SMALLEST*/); + /***/ + + m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */ + + s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */ + s.heap[--s.heap_max] = m; + + /* Create a new node father of n and m */ + tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/; + s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1; + tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node; + + /* and insert the new node in the heap */ + s.heap[1/*SMALLEST*/] = node++; + pqdownheap(s, tree, 1/*SMALLEST*/); + + } while (s.heap_len >= 2); + + s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/]; + + /* At this point, the fields freq and dad are set. We can now + * generate the bit lengths. + */ + gen_bitlen(s, desc); + + /* The field len is now set, we can generate the bit codes */ + gen_codes(tree, max_code, s.bl_count); +}; + + +/* =========================================================================== + * Scan a literal or distance tree to determine the frequencies of the codes + * in the bit length tree. + */ +const scan_tree = (s, tree, max_code) => +// deflate_state *s; +// ct_data *tree; /* the tree to be scanned */ +// int max_code; /* and its largest code of non zero frequency */ +{ + let n; /* iterates over all tree elements */ + let prevlen = -1; /* last emitted length */ + let curlen; /* length of current code */ + + let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + let count = 0; /* repeat count of the current code */ + let max_count = 7; /* max repeat count */ + let min_count = 4; /* min repeat count */ + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */ + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + s.bl_tree[curlen * 2]/*.Freq*/ += count; + + } else if (curlen !== 0) { + + if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; } + s.bl_tree[REP_3_6 * 2]/*.Freq*/++; + + } else if (count <= 10) { + s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++; + + } else { + s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++; + } + + count = 0; + prevlen = curlen; + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } +}; + + +/* =========================================================================== + * Send a literal or distance tree in compressed form, using the codes in + * bl_tree. + */ +const send_tree = (s, tree, max_code) => +// deflate_state *s; +// ct_data *tree; /* the tree to be scanned */ +// int max_code; /* and its largest code of non zero frequency */ +{ + let n; /* iterates over all tree elements */ + let prevlen = -1; /* last emitted length */ + let curlen; /* length of current code */ + + let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + let count = 0; /* repeat count of the current code */ + let max_count = 7; /* max repeat count */ + let min_count = 4; /* min repeat count */ + + /* tree[max_code+1].Len = -1; */ /* guard already set */ + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + do { send_code(s, curlen, s.bl_tree); } while (--count !== 0); + + } else if (curlen !== 0) { + if (curlen !== prevlen) { + send_code(s, curlen, s.bl_tree); + count--; + } + //Assert(count >= 3 && count <= 6, " 3_6?"); + send_code(s, REP_3_6, s.bl_tree); + send_bits(s, count - 3, 2); + + } else if (count <= 10) { + send_code(s, REPZ_3_10, s.bl_tree); + send_bits(s, count - 3, 3); + + } else { + send_code(s, REPZ_11_138, s.bl_tree); + send_bits(s, count - 11, 7); + } + + count = 0; + prevlen = curlen; + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } +}; + + +/* =========================================================================== + * Construct the Huffman tree for the bit lengths and return the index in + * bl_order of the last bit length code to send. + */ +const build_bl_tree = (s) => { + + let max_blindex; /* index of last bit length code of non zero freq */ + + /* Determine the bit length frequencies for literal and distance trees */ + scan_tree(s, s.dyn_ltree, s.l_desc.max_code); + scan_tree(s, s.dyn_dtree, s.d_desc.max_code); + + /* Build the bit length tree: */ + build_tree(s, s.bl_desc); + /* opt_len now includes the length of the tree representations, except + * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. + */ + + /* Determine the number of bit length codes to send. The pkzip format + * requires that at least 4 bit length codes be sent. (appnote.txt says + * 3 but the actual value used is 4.) + */ + for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) { + if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) { + break; + } + } + /* Update opt_len to include the bit length tree and counts */ + s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; + //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", + // s->opt_len, s->static_len)); + + return max_blindex; +}; + + +/* =========================================================================== + * Send the header for a block using dynamic Huffman trees: the counts, the + * lengths of the bit length codes, the literal tree and the distance tree. + * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. + */ +const send_all_trees = (s, lcodes, dcodes, blcodes) => +// deflate_state *s; +// int lcodes, dcodes, blcodes; /* number of codes for each tree */ +{ + let rank; /* index in bl_order */ + + //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); + //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, + // "too many codes"); + //Tracev((stderr, "\nbl counts: ")); + send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */ + send_bits(s, dcodes - 1, 5); + send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */ + for (rank = 0; rank < blcodes; rank++) { + //Tracev((stderr, "\nbl code %2d ", bl_order[rank])); + send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3); + } + //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */ + //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */ + //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); +}; + + +/* =========================================================================== + * Check if the data type is TEXT or BINARY, using the following algorithm: + * - TEXT if the two conditions below are satisfied: + * a) There are no non-portable control characters belonging to the + * "black list" (0..6, 14..25, 28..31). + * b) There is at least one printable character belonging to the + * "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). + * - BINARY otherwise. + * - The following partially-portable control characters form a + * "gray list" that is ignored in this detection algorithm: + * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). + * IN assertion: the fields Freq of dyn_ltree are set. + */ +const detect_data_type = (s) => { + /* black_mask is the bit mask of black-listed bytes + * set bits 0..6, 14..25, and 28..31 + * 0xf3ffc07f = binary 11110011111111111100000001111111 + */ + let black_mask = 0xf3ffc07f; + let n; + + /* Check for non-textual ("black-listed") bytes. */ + for (n = 0; n <= 31; n++, black_mask >>>= 1) { + if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) { + return Z_BINARY; + } + } + + /* Check for textual ("white-listed") bytes. */ + if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 || + s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + for (n = 32; n < LITERALS$1; n++) { + if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + } + + /* There are no "black-listed" or "white-listed" bytes: + * this stream either is empty or has tolerated ("gray-listed") bytes only. + */ + return Z_BINARY; +}; + + +let static_init_done = false; + +/* =========================================================================== + * Initialize the tree data structures for a new zlib stream. + */ +const _tr_init$1 = (s) => +{ + + if (!static_init_done) { + tr_static_init(); + static_init_done = true; + } + + s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc); + s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc); + s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc); + + s.bi_buf = 0; + s.bi_valid = 0; + + /* Initialize the first block of the first file: */ + init_block(s); +}; + + +/* =========================================================================== + * Send a stored block + */ +const _tr_stored_block$1 = (s, buf, stored_len, last) => +//DeflateState *s; +//charf *buf; /* input block */ +//ulg stored_len; /* length of input block */ +//int last; /* one if this is the last block for a file */ +{ + send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */ + copy_block(s, buf, stored_len, true); /* with header */ +}; + + +/* =========================================================================== + * Send one empty static block to give enough lookahead for inflate. + * This takes 10 bits, of which 7 may remain in the bit buffer. + */ +const _tr_align$1 = (s) => { + send_bits(s, STATIC_TREES << 1, 3); + send_code(s, END_BLOCK, static_ltree); + bi_flush(s); +}; + + +/* =========================================================================== + * Determine the best encoding for the current block: dynamic trees, static + * trees or store, and output the encoded block to the zip file. + */ +const _tr_flush_block$1 = (s, buf, stored_len, last) => +//DeflateState *s; +//charf *buf; /* input block, or NULL if too old */ +//ulg stored_len; /* length of input block */ +//int last; /* one if this is the last block for a file */ +{ + let opt_lenb, static_lenb; /* opt_len and static_len in bytes */ + let max_blindex = 0; /* index of last bit length code of non zero freq */ + + /* Build the Huffman trees unless a stored block is forced */ + if (s.level > 0) { + + /* Check if the file is binary or text */ + if (s.strm.data_type === Z_UNKNOWN$1) { + s.strm.data_type = detect_data_type(s); + } + + /* Construct the literal and distance trees */ + build_tree(s, s.l_desc); + // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + + build_tree(s, s.d_desc); + // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + /* At this point, opt_len and static_len are the total bit lengths of + * the compressed block data, excluding the tree representations. + */ + + /* Build the bit length tree for the above two trees, and get the index + * in bl_order of the last bit length code to send. + */ + max_blindex = build_bl_tree(s); + + /* Determine the best encoding. Compute the block lengths in bytes. */ + opt_lenb = (s.opt_len + 3 + 7) >>> 3; + static_lenb = (s.static_len + 3 + 7) >>> 3; + + // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", + // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, + // s->last_lit)); + + if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; } + + } else { + // Assert(buf != (char*)0, "lost buf"); + opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ + } + + if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) { + /* 4: two words for the lengths */ + + /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. + * Otherwise we can't have processed more than WSIZE input bytes since + * the last block flush, because compression would have been + * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to + * transform a block into a stored block. + */ + _tr_stored_block$1(s, buf, stored_len, last); + + } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) { + + send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3); + compress_block(s, static_ltree, static_dtree); + + } else { + send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3); + send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1); + compress_block(s, s.dyn_ltree, s.dyn_dtree); + } + // Assert (s->compressed_len == s->bits_sent, "bad compressed size"); + /* The above check is made mod 2^32, for files larger than 512 MB + * and uLong implemented on 32 bits. + */ + init_block(s); + + if (last) { + bi_windup(s); + } + // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, + // s->compressed_len-7*last)); +}; + +/* =========================================================================== + * Save the match info and tally the frequency counts. Return true if + * the current block must be flushed. + */ +const _tr_tally$1 = (s, dist, lc) => +// deflate_state *s; +// unsigned dist; /* distance of matched string */ +// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ +{ + //let out_length, in_length, dcode; + + s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff; + s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff; + + s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff; + s.last_lit++; + + if (dist === 0) { + /* lc is the unmatched char */ + s.dyn_ltree[lc * 2]/*.Freq*/++; + } else { + s.matches++; + /* Here, lc is the match length - MIN_MATCH */ + dist--; /* dist = match distance - 1 */ + //Assert((ush)dist < (ush)MAX_DIST(s) && + // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && + // (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); + + s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++; + s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++; + } + +// (!) This block is disabled in zlib defaults, +// don't enable it for binary compatibility + +//#ifdef TRUNCATE_BLOCK +// /* Try to guess if it is profitable to stop the current block here */ +// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) { +// /* Compute an upper bound for the compressed length */ +// out_length = s.last_lit*8; +// in_length = s.strstart - s.block_start; +// +// for (dcode = 0; dcode < D_CODES; dcode++) { +// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]); +// } +// out_length >>>= 3; +// //Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ", +// // s->last_lit, in_length, out_length, +// // 100L - out_length*100L/in_length)); +// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) { +// return true; +// } +// } +//#endif + + return (s.last_lit === s.lit_bufsize - 1); + /* We avoid equality with lit_bufsize because of wraparound at 64K + * on 16 bit machines and because stored blocks are restricted to + * 64K-1 bytes. + */ +}; + +var _tr_init_1 = _tr_init$1; +var _tr_stored_block_1 = _tr_stored_block$1; +var _tr_flush_block_1 = _tr_flush_block$1; +var _tr_tally_1 = _tr_tally$1; +var _tr_align_1 = _tr_align$1; + +var trees = { + _tr_init: _tr_init_1, + _tr_stored_block: _tr_stored_block_1, + _tr_flush_block: _tr_flush_block_1, + _tr_tally: _tr_tally_1, + _tr_align: _tr_align_1 +}; + +// Note: adler32 takes 12% for level 0 and 2% for level 6. +// It isn't worth it to make additional optimizations as in original. +// Small size is preferable. + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +const adler32 = (adler, buf, len, pos) => { + let s1 = (adler & 0xffff) |0, + s2 = ((adler >>> 16) & 0xffff) |0, + n = 0; + + while (len !== 0) { + // Set limit ~ twice less than 5552, to keep + // s2 in 31-bits, because we force signed ints. + // in other case %= will fail. + n = len > 2000 ? 2000 : len; + len -= n; + + do { + s1 = (s1 + buf[pos++]) |0; + s2 = (s2 + s1) |0; + } while (--n); + + s1 %= 65521; + s2 %= 65521; + } + + return (s1 | (s2 << 16)) |0; +}; + + +var adler32_1 = adler32; + +// Note: we can't get significant speed boost here. +// So write code to minimize size - no pregenerated tables +// and array tools dependencies. + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +// Use ordinary array, since untyped makes no boost here +const makeTable = () => { + let c, table = []; + + for (var n = 0; n < 256; n++) { + c = n; + for (var k = 0; k < 8; k++) { + c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); + } + table[n] = c; + } + + return table; +}; + +// Create table on load. Just 255 signed longs. Not a problem. +const crcTable = new Uint32Array(makeTable()); + + +const crc32 = (crc, buf, len, pos) => { + const t = crcTable; + const end = pos + len; + + crc ^= -1; + + for (let i = pos; i < end; i++) { + crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; +}; + + +var crc32_1 = crc32; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +var messages = { + 2: 'need dictionary', /* Z_NEED_DICT 2 */ + 1: 'stream end', /* Z_STREAM_END 1 */ + 0: '', /* Z_OK 0 */ + '-1': 'file error', /* Z_ERRNO (-1) */ + '-2': 'stream error', /* Z_STREAM_ERROR (-2) */ + '-3': 'data error', /* Z_DATA_ERROR (-3) */ + '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */ + '-5': 'buffer error', /* Z_BUF_ERROR (-5) */ + '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +var constants$2 = { + + /* Allowed flush values; see deflate() and inflate() below for details */ + Z_NO_FLUSH: 0, + Z_PARTIAL_FLUSH: 1, + Z_SYNC_FLUSH: 2, + Z_FULL_FLUSH: 3, + Z_FINISH: 4, + Z_BLOCK: 5, + Z_TREES: 6, + + /* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ + Z_OK: 0, + Z_STREAM_END: 1, + Z_NEED_DICT: 2, + Z_ERRNO: -1, + Z_STREAM_ERROR: -2, + Z_DATA_ERROR: -3, + Z_MEM_ERROR: -4, + Z_BUF_ERROR: -5, + //Z_VERSION_ERROR: -6, + + /* compression levels */ + Z_NO_COMPRESSION: 0, + Z_BEST_SPEED: 1, + Z_BEST_COMPRESSION: 9, + Z_DEFAULT_COMPRESSION: -1, + + + Z_FILTERED: 1, + Z_HUFFMAN_ONLY: 2, + Z_RLE: 3, + Z_FIXED: 4, + Z_DEFAULT_STRATEGY: 0, + + /* Possible values of the data_type field (though see inflate()) */ + Z_BINARY: 0, + Z_TEXT: 1, + //Z_ASCII: 1, // = Z_TEXT (deprecated) + Z_UNKNOWN: 2, + + /* The deflate compression method */ + Z_DEFLATED: 8 + //Z_NULL: null // Use -1 or null inline, depending on var type +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +const { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees; + + + + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + 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, + 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, + Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1, + Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1, + Z_UNKNOWN, + Z_DEFLATED: Z_DEFLATED$2 +} = constants$2; + +/*============================================================================*/ + + +const MAX_MEM_LEVEL = 9; +/* Maximum value for memLevel in deflateInit2 */ +const MAX_WBITS$1 = 15; +/* 32K LZ77 window */ +const DEF_MEM_LEVEL = 8; + + +const LENGTH_CODES = 29; +/* number of length codes, not counting the special END_BLOCK code */ +const LITERALS = 256; +/* number of literal bytes 0..255 */ +const L_CODES = LITERALS + 1 + LENGTH_CODES; +/* number of Literal or Length codes, including the END_BLOCK code */ +const D_CODES = 30; +/* number of distance codes */ +const BL_CODES = 19; +/* number of codes used to transfer the bit lengths */ +const HEAP_SIZE = 2 * L_CODES + 1; +/* maximum heap size */ +const MAX_BITS = 15; +/* All codes must not exceed MAX_BITS bits */ + +const MIN_MATCH = 3; +const MAX_MATCH = 258; +const MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1); + +const PRESET_DICT = 0x20; + +const INIT_STATE = 42; +const EXTRA_STATE = 69; +const NAME_STATE = 73; +const COMMENT_STATE = 91; +const HCRC_STATE = 103; +const BUSY_STATE = 113; +const FINISH_STATE = 666; + +const BS_NEED_MORE = 1; /* block not completed, need more input or more output */ +const BS_BLOCK_DONE = 2; /* block flush performed */ +const BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */ +const BS_FINISH_DONE = 4; /* finish done, accept no more input or output */ + +const OS_CODE = 0x03; // Unix :) . Don't detect, use this default. + +const err = (strm, errorCode) => { + strm.msg = messages[errorCode]; + return errorCode; +}; + +const rank = (f) => { + return ((f) << 1) - ((f) > 4 ? 9 : 0); +}; + +const zero = (buf) => { + let len = buf.length; while (--len >= 0) { buf[len] = 0; } +}; + + +/* eslint-disable new-cap */ +let HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask; +// This hash causes less collisions, https://github.com/nodeca/pako/issues/135 +// But breaks binary compatibility +//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask; +let HASH = HASH_ZLIB; + +/* ========================================================================= + * Flush as much pending output as possible. All deflate() output goes + * through this function so some applications may wish to modify it + * to avoid allocating a large strm->output buffer and copying into it. + * (See also read_buf()). + */ +const flush_pending = (strm) => { + const s = strm.state; + + //_tr_flush_bits(s); + let len = s.pending; + if (len > strm.avail_out) { + len = strm.avail_out; + } + if (len === 0) { return; } + + strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out); + strm.next_out += len; + s.pending_out += len; + strm.total_out += len; + strm.avail_out -= len; + s.pending -= len; + if (s.pending === 0) { + s.pending_out = 0; + } +}; + + +const flush_block_only = (s, last) => { + _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last); + s.block_start = s.strstart; + flush_pending(s.strm); +}; + + +const put_byte = (s, b) => { + s.pending_buf[s.pending++] = b; +}; + + +/* ========================================================================= + * Put a short in the pending buffer. The 16-bit value is put in MSB order. + * IN assertion: the stream state is correct and there is enough room in + * pending_buf. + */ +const putShortMSB = (s, b) => { + + // put_byte(s, (Byte)(b >> 8)); +// put_byte(s, (Byte)(b & 0xff)); + s.pending_buf[s.pending++] = (b >>> 8) & 0xff; + s.pending_buf[s.pending++] = b & 0xff; +}; + + +/* =========================================================================== + * Read a new buffer from the current input stream, update the adler32 + * and total number of bytes read. All deflate() input goes through + * this function so some applications may wish to modify it to avoid + * allocating a large strm->input buffer and copying from it. + * (See also flush_pending()). + */ +const read_buf = (strm, buf, start, size) => { + + let len = strm.avail_in; + + if (len > size) { len = size; } + if (len === 0) { return 0; } + + strm.avail_in -= len; + + // zmemcpy(buf, strm->next_in, len); + buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start); + if (strm.state.wrap === 1) { + strm.adler = adler32_1(strm.adler, buf, len, start); + } + + else if (strm.state.wrap === 2) { + strm.adler = crc32_1(strm.adler, buf, len, start); + } + + strm.next_in += len; + strm.total_in += len; + + return len; +}; + + +/* =========================================================================== + * Set match_start to the longest match starting at the given string and + * return its length. Matches shorter or equal to prev_length are discarded, + * in which case the result is equal to prev_length and match_start is + * garbage. + * IN assertions: cur_match is the head of the hash chain for the current + * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 + * OUT assertion: the match length is not greater than s->lookahead. + */ +const longest_match = (s, cur_match) => { + + let chain_length = s.max_chain_length; /* max hash chain length */ + let scan = s.strstart; /* current string */ + let match; /* matched string */ + let len; /* length of current match */ + let best_len = s.prev_length; /* best match length so far */ + let nice_match = s.nice_match; /* stop if match long enough */ + const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ? + s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/; + + const _win = s.window; // shortcut + + const wmask = s.w_mask; + const prev = s.prev; + + /* Stop when cur_match becomes <= limit. To simplify the code, + * we prevent matches with the string of window index 0. + */ + + const strend = s.strstart + MAX_MATCH; + let scan_end1 = _win[scan + best_len - 1]; + let scan_end = _win[scan + best_len]; + + /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. + * It is easy to get rid of this optimization if necessary. + */ + // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); + + /* Do not waste too much time if we already have a good match: */ + if (s.prev_length >= s.good_match) { + chain_length >>= 2; + } + /* Do not look for matches beyond the end of the input. This is necessary + * to make deflate deterministic. + */ + if (nice_match > s.lookahead) { nice_match = s.lookahead; } + + // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); + + do { + // Assert(cur_match < s->strstart, "no future"); + match = cur_match; + + /* Skip to next match if the match length cannot increase + * or if the match length is less than 2. Note that the checks below + * for insufficient lookahead only occur occasionally for performance + * reasons. Therefore uninitialized memory will be accessed, and + * conditional jumps will be made that depend on those values. + * However the length of the match is limited to the lookahead, so + * the output of deflate is not affected by the uninitialized values. + */ + + if (_win[match + best_len] !== scan_end || + _win[match + best_len - 1] !== scan_end1 || + _win[match] !== _win[scan] || + _win[++match] !== _win[scan + 1]) { + continue; + } + + /* The check at best_len-1 can be removed because it will be made + * again later. (This heuristic is not always a win.) + * It is not necessary to compare scan[2] and match[2] since they + * are always equal when the other bytes match, given that + * the hash keys are equal and that HASH_BITS >= 8. + */ + scan += 2; + match++; + // Assert(*scan == *match, "match[2]?"); + + /* We check for insufficient lookahead only every 8th comparison; + * the 256th check will be made at strstart+258. + */ + do { + /*jshint noempty:false*/ + } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + scan < strend); + + // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); + + len = MAX_MATCH - (strend - scan); + scan = strend - MAX_MATCH; + + if (len > best_len) { + s.match_start = cur_match; + best_len = len; + if (len >= nice_match) { + break; + } + scan_end1 = _win[scan + best_len - 1]; + scan_end = _win[scan + best_len]; + } + } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0); + + if (best_len <= s.lookahead) { + return best_len; + } + return s.lookahead; +}; + + +/* =========================================================================== + * Fill the window when the lookahead becomes insufficient. + * Updates strstart and lookahead. + * + * IN assertion: lookahead < MIN_LOOKAHEAD + * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD + * At least one byte has been read, or avail_in == 0; reads are + * performed for at least two bytes (required for the zip translate_eol + * option -- not supported here). + */ +const fill_window = (s) => { + + const _w_size = s.w_size; + let p, n, m, more, str; + + //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); + + do { + more = s.window_size - s.lookahead - s.strstart; + + // JS ints have 32 bit, block below not needed + /* Deal with !@#$% 64K limit: */ + //if (sizeof(int) <= 2) { + // if (more == 0 && s->strstart == 0 && s->lookahead == 0) { + // more = wsize; + // + // } else if (more == (unsigned)(-1)) { + // /* Very unlikely, but possible on 16 bit machine if + // * strstart == 0 && lookahead == 1 (input done a byte at time) + // */ + // more--; + // } + //} + + + /* If the window is almost full and there is insufficient lookahead, + * move the upper half to the lower one to make room in the upper half. + */ + if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) { + + s.window.set(s.window.subarray(_w_size, _w_size + _w_size), 0); + s.match_start -= _w_size; + s.strstart -= _w_size; + /* we now have strstart >= MAX_DIST */ + s.block_start -= _w_size; + + /* Slide the hash table (could be avoided with 32 bit values + at the expense of memory usage). We slide even when level == 0 + to keep the hash table consistent if we switch back to level > 0 + later. (Using level 0 permanently is not an optimal usage of + zlib, so we don't care about this pathological case.) + */ + + n = s.hash_size; + p = n; + + do { + m = s.head[--p]; + s.head[p] = (m >= _w_size ? m - _w_size : 0); + } while (--n); + + n = _w_size; + p = n; + + do { + m = s.prev[--p]; + s.prev[p] = (m >= _w_size ? m - _w_size : 0); + /* If n is not on any hash chain, prev[n] is garbage but + * its value will never be used. + */ + } while (--n); + + more += _w_size; + } + if (s.strm.avail_in === 0) { + break; + } + + /* If there was no sliding: + * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && + * more == window_size - lookahead - strstart + * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) + * => more >= window_size - 2*WSIZE + 2 + * In the BIG_MEM or MMAP case (not yet supported), + * window_size == input_size + MIN_LOOKAHEAD && + * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. + * Otherwise, window_size == 2*WSIZE so more >= 2. + * If there was sliding, more >= WSIZE. So in all cases, more >= 2. + */ + //Assert(more >= 2, "more < 2"); + n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more); + s.lookahead += n; + + /* Initialize the hash value now that we have some input: */ + if (s.lookahead + s.insert >= MIN_MATCH) { + str = s.strstart - s.insert; + s.ins_h = s.window[str]; + + /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + 1]); +//#if MIN_MATCH != 3 +// Call update_hash() MIN_MATCH-3 more times +//#endif + while (s.insert) { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + + s.prev[str & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = str; + str++; + s.insert--; + if (s.lookahead + s.insert < MIN_MATCH) { + break; + } + } + } + /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, + * but this is not important since only literal bytes will be emitted. + */ + + } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0); + + /* If the WIN_INIT bytes after the end of the current data have never been + * written, then zero those bytes in order to avoid memory check reports of + * the use of uninitialized (or uninitialised as Julian writes) bytes by + * the longest match routines. Update the high water mark for the next + * time through here. WIN_INIT is set to MAX_MATCH since the longest match + * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead. + */ +// if (s.high_water < s.window_size) { +// const curr = s.strstart + s.lookahead; +// let init = 0; +// +// if (s.high_water < curr) { +// /* Previous high water mark below current data -- zero WIN_INIT +// * bytes or up to end of window, whichever is less. +// */ +// init = s.window_size - curr; +// if (init > WIN_INIT) +// init = WIN_INIT; +// zmemzero(s->window + curr, (unsigned)init); +// s->high_water = curr + init; +// } +// else if (s->high_water < (ulg)curr + WIN_INIT) { +// /* High water mark at or above current data, but below current data +// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up +// * to end of window, whichever is less. +// */ +// init = (ulg)curr + WIN_INIT - s->high_water; +// if (init > s->window_size - s->high_water) +// init = s->window_size - s->high_water; +// zmemzero(s->window + s->high_water, (unsigned)init); +// s->high_water += init; +// } +// } +// +// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, +// "not enough room for search"); +}; + +/* =========================================================================== + * Copy without compression as much as possible from the input stream, return + * the current block state. + * This function does not insert new strings in the dictionary since + * uncompressible data is probably not useful. This function is used + * only for the level=0 compression option. + * NOTE: this function should be optimized to avoid extra copying from + * window to pending_buf. + */ +const deflate_stored = (s, flush) => { + + /* Stored blocks are limited to 0xffff bytes, pending_buf is limited + * to pending_buf_size, and each stored block has a 5 byte header: + */ + let max_block_size = 0xffff; + + if (max_block_size > s.pending_buf_size - 5) { + max_block_size = s.pending_buf_size - 5; + } + + /* Copy as much as possible from input to output: */ + for (;;) { + /* Fill the window as much as possible: */ + if (s.lookahead <= 1) { + + //Assert(s->strstart < s->w_size+MAX_DIST(s) || + // s->block_start >= (long)s->w_size, "slide too late"); +// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) || +// s.block_start >= s.w_size)) { +// throw new Error("slide too late"); +// } + + fill_window(s); + if (s.lookahead === 0 && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + + if (s.lookahead === 0) { + break; + } + /* flush the current block */ + } + //Assert(s->block_start >= 0L, "block gone"); +// if (s.block_start < 0) throw new Error("block gone"); + + s.strstart += s.lookahead; + s.lookahead = 0; + + /* Emit a stored block if pending_buf will be full: */ + const max_start = s.block_start + max_block_size; + + if (s.strstart === 0 || s.strstart >= max_start) { + /* strstart == 0 is possible when wraparound on 16-bit machine */ + s.lookahead = s.strstart - max_start; + s.strstart = max_start; + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + + + } + /* Flush if we may have to slide, otherwise block_start may become + * negative and the data will be gone: + */ + if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + + s.insert = 0; + + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + + if (s.strstart > s.block_start) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_NEED_MORE; +}; + +/* =========================================================================== + * Compress as much as possible from the input stream, return the current + * block state. + * This function does not perform lazy evaluation of matches and inserts + * new strings in the dictionary only for unmatched strings or for short + * matches. It is used only for the fast compression options. + */ +const deflate_fast = (s, flush) => { + + let hash_head; /* head of the hash chain */ + let bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; /* flush the current block */ + } + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + * At this point we have always match_length < MIN_MATCH + */ + if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + } + if (s.match_length >= MIN_MATCH) { + // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only + + /*** _tr_tally_dist(s, s.strstart - s.match_start, + s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + + /* Insert new strings in the hash table only if the match length + * is not too large. This saves time but degrades compression. + */ + if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) { + s.match_length--; /* string at strstart already in table */ + do { + s.strstart++; + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + /* strstart never exceeds WSIZE-MAX_MATCH, so there are + * always MIN_MATCH bytes ahead. + */ + } while (--s.match_length !== 0); + s.strstart++; + } else + { + s.strstart += s.match_length; + s.match_length = 0; + s.ins_h = s.window[s.strstart]; + /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]); + +//#if MIN_MATCH != 3 +// Call UPDATE_HASH() MIN_MATCH-3 more times +//#endif + /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not + * matter since it will be recomputed at next deflate call. + */ + } + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s.window[s.strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1); + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.last_lit) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +}; + +/* =========================================================================== + * Same as above, but achieves better compression. We use a lazy + * evaluation for matches: a match is finally adopted only if there is + * no better match at the next window position. + */ +const deflate_slow = (s, flush) => { + + let hash_head; /* head of hash chain */ + let bflush; /* set if current block must be flushed */ + + let max_insert; + + /* Process the input block. */ + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + */ + s.prev_length = s.match_length; + s.prev_match = s.match_start; + s.match_length = MIN_MATCH - 1; + + if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match && + s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + + if (s.match_length <= 5 && + (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) { + + /* If prev_match is also MIN_MATCH, match_start is garbage + * but we will ignore the current match anyway. + */ + s.match_length = MIN_MATCH - 1; + } + } + /* If there was a match at the previous step and the current + * match is not better, output the previous match: + */ + if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) { + max_insert = s.strstart + s.lookahead - MIN_MATCH; + /* Do not insert strings in hash table beyond this. */ + + //check_match(s, s.strstart-1, s.prev_match, s.prev_length); + + /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match, + s.prev_length - MIN_MATCH, bflush);***/ + bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH); + /* Insert in hash table all strings up to the end of the match. + * strstart-1 and strstart are already inserted. If there is not + * enough lookahead, the last two strings are not inserted in + * the hash table. + */ + s.lookahead -= s.prev_length - 1; + s.prev_length -= 2; + do { + if (++s.strstart <= max_insert) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + } while (--s.prev_length !== 0); + s.match_available = 0; + s.match_length = MIN_MATCH - 1; + s.strstart++; + + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + } else if (s.match_available) { + /* If there was no match at the previous position, output a + * single literal. If there was a match but the current match + * is longer, truncate the previous match to a single literal. + */ + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + + if (bflush) { + /*** FLUSH_BLOCK_ONLY(s, 0) ***/ + flush_block_only(s, false); + /***/ + } + s.strstart++; + s.lookahead--; + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + } else { + /* There is no previous match to compare with, wait for + * the next step to decide. + */ + s.match_available = 1; + s.strstart++; + s.lookahead--; + } + } + //Assert (flush != Z_NO_FLUSH, "no flush?"); + if (s.match_available) { + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + + s.match_available = 0; + } + s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.last_lit) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; +}; + + +/* =========================================================================== + * For Z_RLE, simply look for runs of bytes, generate matches only of distance + * one. Do not maintain a hash table. (It will be regenerated if this run of + * deflate switches away from Z_RLE.) + */ +const deflate_rle = (s, flush) => { + + let bflush; /* set if current block must be flushed */ + let prev; /* byte at distance one to match */ + let scan, strend; /* scan goes up to strend for length of run */ + + const _win = s.window; + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the longest run, plus one for the unrolled loop. + */ + if (s.lookahead <= MAX_MATCH) { + fill_window(s); + if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* See how many times the previous byte repeats */ + s.match_length = 0; + if (s.lookahead >= MIN_MATCH && s.strstart > 0) { + scan = s.strstart - 1; + prev = _win[scan]; + if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) { + strend = s.strstart + MAX_MATCH; + do { + /*jshint noempty:false*/ + } while (prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + scan < strend); + s.match_length = MAX_MATCH - (strend - scan); + if (s.match_length > s.lookahead) { + s.match_length = s.lookahead; + } + } + //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); + } + + /* Emit match if have run of MIN_MATCH or longer, else emit literal */ + if (s.match_length >= MIN_MATCH) { + //check_match(s, s.strstart, s.strstart - 1, s.match_length); + + /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + s.strstart += s.match_length; + s.match_length = 0; + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.last_lit) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +}; + +/* =========================================================================== + * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table. + * (It will be regenerated if this run of deflate switches away from Huffman.) + */ +const deflate_huff = (s, flush) => { + + let bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we have a literal to write. */ + if (s.lookahead === 0) { + fill_window(s); + if (s.lookahead === 0) { + if (flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + break; /* flush the current block */ + } + } + + /* Output a literal byte */ + s.match_length = 0; + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.last_lit) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +}; + +/* Values for max_lazy_match, good_match and max_chain_length, depending on + * the desired pack level (0..9). The values given below have been tuned to + * exclude worst case performance for pathological files. Better values may be + * found for specific files. + */ +function Config(good_length, max_lazy, nice_length, max_chain, func) { + + this.good_length = good_length; + this.max_lazy = max_lazy; + this.nice_length = nice_length; + this.max_chain = max_chain; + this.func = func; +} + +const configuration_table = [ + /* good lazy nice chain */ + new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */ + new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */ + new Config(4, 5, 16, 8, deflate_fast), /* 2 */ + new Config(4, 6, 32, 32, deflate_fast), /* 3 */ + + new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */ + new Config(8, 16, 32, 32, deflate_slow), /* 5 */ + new Config(8, 16, 128, 128, deflate_slow), /* 6 */ + new Config(8, 32, 128, 256, deflate_slow), /* 7 */ + new Config(32, 128, 258, 1024, deflate_slow), /* 8 */ + new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */ +]; + + +/* =========================================================================== + * Initialize the "longest match" routines for a new zlib stream + */ +const lm_init = (s) => { + + s.window_size = 2 * s.w_size; + + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + + /* Set the default configuration parameters: + */ + s.max_lazy_match = configuration_table[s.level].max_lazy; + s.good_match = configuration_table[s.level].good_length; + s.nice_match = configuration_table[s.level].nice_length; + s.max_chain_length = configuration_table[s.level].max_chain; + + s.strstart = 0; + s.block_start = 0; + s.lookahead = 0; + s.insert = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + s.ins_h = 0; +}; + + +function DeflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.status = 0; /* as the name implies */ + this.pending_buf = null; /* output still pending */ + this.pending_buf_size = 0; /* size of pending_buf */ + this.pending_out = 0; /* next pending byte to output to the stream */ + this.pending = 0; /* nb of bytes in the pending buffer */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ + this.gzhead = null; /* gzip header information to write */ + this.gzindex = 0; /* where in extra, name, or comment */ + this.method = Z_DEFLATED$2; /* can only be DEFLATED */ + this.last_flush = -1; /* value of flush param for previous deflate call */ + + this.w_size = 0; /* LZ77 window size (32K by default) */ + this.w_bits = 0; /* log2(w_size) (8..16) */ + this.w_mask = 0; /* w_size - 1 */ + + this.window = null; + /* Sliding window. Input bytes are read into the second half of the window, + * and move to the first half later to keep a dictionary of at least wSize + * bytes. With this organization, matches are limited to a distance of + * wSize-MAX_MATCH bytes, but this ensures that IO is always + * performed with a length multiple of the block size. + */ + + this.window_size = 0; + /* Actual size of window: 2*wSize, except when the user input buffer + * is directly used as sliding window. + */ + + this.prev = null; + /* Link to older string with same hash index. To limit the size of this + * array to 64K, this link is maintained only for the last 32K strings. + * An index in this array is thus a window index modulo 32K. + */ + + this.head = null; /* Heads of the hash chains or NIL. */ + + this.ins_h = 0; /* hash index of string to be inserted */ + this.hash_size = 0; /* number of elements in hash table */ + this.hash_bits = 0; /* log2(hash_size) */ + this.hash_mask = 0; /* hash_size-1 */ + + this.hash_shift = 0; + /* Number of bits by which ins_h must be shifted at each input + * step. It must be such that after MIN_MATCH steps, the oldest + * byte no longer takes part in the hash key, that is: + * hash_shift * MIN_MATCH >= hash_bits + */ + + this.block_start = 0; + /* Window position at the beginning of the current output block. Gets + * negative when the window is moved backwards. + */ + + this.match_length = 0; /* length of best match */ + this.prev_match = 0; /* previous match */ + this.match_available = 0; /* set if previous match exists */ + this.strstart = 0; /* start of string to insert */ + this.match_start = 0; /* start of matching string */ + this.lookahead = 0; /* number of valid bytes ahead in window */ + + this.prev_length = 0; + /* Length of the best match at previous step. Matches not greater than this + * are discarded. This is used in the lazy match evaluation. + */ + + this.max_chain_length = 0; + /* To speed up deflation, hash chains are never searched beyond this + * length. A higher limit improves compression ratio but degrades the + * speed. + */ + + this.max_lazy_match = 0; + /* Attempt to find a better match only when the current match is strictly + * smaller than this value. This mechanism is used only for compression + * levels >= 4. + */ + // That's alias to max_lazy_match, don't use directly + //this.max_insert_length = 0; + /* Insert new strings in the hash table only if the match length is not + * greater than this length. This saves time but degrades compression. + * max_insert_length is used only for compression levels <= 3. + */ + + this.level = 0; /* compression level (1..9) */ + this.strategy = 0; /* favor or force Huffman coding*/ + + this.good_match = 0; + /* Use a faster search when the previous match is longer than this */ + + this.nice_match = 0; /* Stop searching when current match exceeds this */ + + /* used by trees.c: */ + + /* Didn't use ct_data typedef below to suppress compiler warning */ + + // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ + // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ + // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ + + // Use flat array of DOUBLE size, with interleaved fata, + // because JS does not support effective + this.dyn_ltree = new Uint16Array(HEAP_SIZE * 2); + this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2); + this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2); + zero(this.dyn_ltree); + zero(this.dyn_dtree); + zero(this.bl_tree); + + this.l_desc = null; /* desc. for literal tree */ + this.d_desc = null; /* desc. for distance tree */ + this.bl_desc = null; /* desc. for bit length tree */ + + //ush bl_count[MAX_BITS+1]; + this.bl_count = new Uint16Array(MAX_BITS + 1); + /* number of codes at each bit length for an optimal tree */ + + //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ + this.heap = new Uint16Array(2 * L_CODES + 1); /* heap used to build the Huffman trees */ + zero(this.heap); + + this.heap_len = 0; /* number of elements in the heap */ + this.heap_max = 0; /* element of largest frequency */ + /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. + * The same heap array is used to build all trees. + */ + + this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1]; + zero(this.depth); + /* Depth of each subtree used as tie breaker for trees of equal frequency + */ + + this.l_buf = 0; /* buffer index for literals or lengths */ + + this.lit_bufsize = 0; + /* Size of match buffer for literals/lengths. There are 4 reasons for + * limiting lit_bufsize to 64K: + * - frequencies can be kept in 16 bit counters + * - if compression is not successful for the first block, all input + * data is still in the window so we can still emit a stored block even + * when input comes from standard input. (This can also be done for + * all blocks if lit_bufsize is not greater than 32K.) + * - if compression is not successful for a file smaller than 64K, we can + * even emit a stored file instead of a stored block (saving 5 bytes). + * This is applicable only for zip (not gzip or zlib). + * - creating new Huffman trees less frequently may not provide fast + * adaptation to changes in the input data statistics. (Take for + * example a binary file with poorly compressible code followed by + * a highly compressible string table.) Smaller buffer sizes give + * fast adaptation but have of course the overhead of transmitting + * trees more frequently. + * - I can't count above 4 + */ + + this.last_lit = 0; /* running index in l_buf */ + + this.d_buf = 0; + /* Buffer index for distances. To simplify the code, d_buf and l_buf have + * the same number of elements. To use different lengths, an extra flag + * array would be necessary. + */ + + this.opt_len = 0; /* bit length of current block with optimal trees */ + this.static_len = 0; /* bit length of current block with static trees */ + this.matches = 0; /* number of string matches in current block */ + this.insert = 0; /* bytes at end of window left to insert */ + + + this.bi_buf = 0; + /* Output buffer. bits are inserted starting at the bottom (least + * significant bits). + */ + this.bi_valid = 0; + /* Number of valid bits in bi_buf. All bits above the last valid bit + * are always zero. + */ + + // Used for window memory init. We safely ignore it for JS. That makes + // sense only for pointers and memory check tools. + //this.high_water = 0; + /* High water mark offset in window for initialized bytes -- bytes above + * this are set to zero in order to avoid memory check warnings when + * longest match routines access bytes past the input. This is then + * updated to the new high water mark. + */ +} + + +const deflateResetKeep = (strm) => { + + if (!strm || !strm.state) { + return err(strm, Z_STREAM_ERROR$2); + } + + strm.total_in = strm.total_out = 0; + strm.data_type = Z_UNKNOWN; + + const s = strm.state; + s.pending = 0; + s.pending_out = 0; + + if (s.wrap < 0) { + s.wrap = -s.wrap; + /* was made negative by deflate(..., Z_FINISH); */ + } + s.status = (s.wrap ? INIT_STATE : BUSY_STATE); + strm.adler = (s.wrap === 2) ? + 0 // crc32(0, Z_NULL, 0) + : + 1; // adler32(0, Z_NULL, 0) + s.last_flush = Z_NO_FLUSH$2; + _tr_init(s); + return Z_OK$3; +}; + + +const deflateReset = (strm) => { + + const ret = deflateResetKeep(strm); + if (ret === Z_OK$3) { + lm_init(strm.state); + } + return ret; +}; + + +const deflateSetHeader = (strm, head) => { + + if (!strm || !strm.state) { return Z_STREAM_ERROR$2; } + if (strm.state.wrap !== 2) { return Z_STREAM_ERROR$2; } + strm.state.gzhead = head; + return Z_OK$3; +}; + + +const deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => { + + if (!strm) { // === Z_NULL + return Z_STREAM_ERROR$2; + } + let wrap = 1; + + if (level === Z_DEFAULT_COMPRESSION$1) { + level = 6; + } + + if (windowBits < 0) { /* suppress zlib wrapper */ + wrap = 0; + windowBits = -windowBits; + } + + else if (windowBits > 15) { + wrap = 2; /* write gzip wrapper instead */ + windowBits -= 16; + } + + + if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 || + windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || + strategy < 0 || strategy > Z_FIXED) { + return err(strm, Z_STREAM_ERROR$2); + } + + + if (windowBits === 8) { + windowBits = 9; + } + /* until 256-byte window bug fixed */ + + const s = new DeflateState(); + + strm.state = s; + s.strm = strm; + + s.wrap = wrap; + s.gzhead = null; + s.w_bits = windowBits; + s.w_size = 1 << s.w_bits; + s.w_mask = s.w_size - 1; + + s.hash_bits = memLevel + 7; + s.hash_size = 1 << s.hash_bits; + s.hash_mask = s.hash_size - 1; + s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH); + + s.window = new Uint8Array(s.w_size * 2); + s.head = new Uint16Array(s.hash_size); + s.prev = new Uint16Array(s.w_size); + + // Don't need mem init magic for JS. + //s.high_water = 0; /* nothing written to s->window yet */ + + s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ + + s.pending_buf_size = s.lit_bufsize * 4; + + //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2); + //s->pending_buf = (uchf *) overlay; + s.pending_buf = new Uint8Array(s.pending_buf_size); + + // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`) + //s->d_buf = overlay + s->lit_bufsize/sizeof(ush); + s.d_buf = 1 * s.lit_bufsize; + + //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; + s.l_buf = (1 + 2) * s.lit_bufsize; + + s.level = level; + s.strategy = strategy; + s.method = method; + + return deflateReset(strm); +}; + +const deflateInit = (strm, level) => { + + return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1); +}; + + +const deflate$2 = (strm, flush) => { + + let beg, val; // for gzip header write only + + if (!strm || !strm.state || + flush > Z_BLOCK$1 || flush < 0) { + return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2; + } + + const s = strm.state; + + if (!strm.output || + (!strm.input && strm.avail_in !== 0) || + (s.status === FINISH_STATE && flush !== Z_FINISH$3)) { + return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2); + } + + s.strm = strm; /* just in case */ + const old_flush = s.last_flush; + s.last_flush = flush; + + /* Write the header */ + if (s.status === INIT_STATE) { + + if (s.wrap === 2) { // GZIP header + strm.adler = 0; //crc32(0L, Z_NULL, 0); + put_byte(s, 31); + put_byte(s, 139); + put_byte(s, 8); + if (!s.gzhead) { // s->gzhead == Z_NULL + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, OS_CODE); + s.status = BUSY_STATE; + } + else { + put_byte(s, (s.gzhead.text ? 1 : 0) + + (s.gzhead.hcrc ? 2 : 0) + + (!s.gzhead.extra ? 0 : 4) + + (!s.gzhead.name ? 0 : 8) + + (!s.gzhead.comment ? 0 : 16) + ); + put_byte(s, s.gzhead.time & 0xff); + put_byte(s, (s.gzhead.time >> 8) & 0xff); + put_byte(s, (s.gzhead.time >> 16) & 0xff); + put_byte(s, (s.gzhead.time >> 24) & 0xff); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, s.gzhead.os & 0xff); + if (s.gzhead.extra && s.gzhead.extra.length) { + put_byte(s, s.gzhead.extra.length & 0xff); + put_byte(s, (s.gzhead.extra.length >> 8) & 0xff); + } + if (s.gzhead.hcrc) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0); + } + s.gzindex = 0; + s.status = EXTRA_STATE; + } + } + else // DEFLATE header + { + let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8; + let level_flags = -1; + + if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) { + level_flags = 0; + } else if (s.level < 6) { + level_flags = 1; + } else if (s.level === 6) { + level_flags = 2; + } else { + level_flags = 3; + } + header |= (level_flags << 6); + if (s.strstart !== 0) { header |= PRESET_DICT; } + header += 31 - (header % 31); + + s.status = BUSY_STATE; + putShortMSB(s, header); + + /* Save the adler32 of the preset dictionary: */ + if (s.strstart !== 0) { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + strm.adler = 1; // adler32(0L, Z_NULL, 0); + } + } + +//#ifdef GZIP + if (s.status === EXTRA_STATE) { + if (s.gzhead.extra/* != Z_NULL*/) { + beg = s.pending; /* start of bytes to update crc */ + + while (s.gzindex < (s.gzhead.extra.length & 0xffff)) { + if (s.pending === s.pending_buf_size) { + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + flush_pending(strm); + beg = s.pending; + if (s.pending === s.pending_buf_size) { + break; + } + } + put_byte(s, s.gzhead.extra[s.gzindex] & 0xff); + s.gzindex++; + } + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + if (s.gzindex === s.gzhead.extra.length) { + s.gzindex = 0; + s.status = NAME_STATE; + } + } + else { + s.status = NAME_STATE; + } + } + if (s.status === NAME_STATE) { + if (s.gzhead.name/* != Z_NULL*/) { + beg = s.pending; /* start of bytes to update crc */ + //int val; + + do { + if (s.pending === s.pending_buf_size) { + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + flush_pending(strm); + beg = s.pending; + if (s.pending === s.pending_buf_size) { + val = 1; + break; + } + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.name.length) { + val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + if (val === 0) { + s.gzindex = 0; + s.status = COMMENT_STATE; + } + } + else { + s.status = COMMENT_STATE; + } + } + if (s.status === COMMENT_STATE) { + if (s.gzhead.comment/* != Z_NULL*/) { + beg = s.pending; /* start of bytes to update crc */ + //int val; + + do { + if (s.pending === s.pending_buf_size) { + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + flush_pending(strm); + beg = s.pending; + if (s.pending === s.pending_buf_size) { + val = 1; + break; + } + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.comment.length) { + val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + if (val === 0) { + s.status = HCRC_STATE; + } + } + else { + s.status = HCRC_STATE; + } + } + if (s.status === HCRC_STATE) { + if (s.gzhead.hcrc) { + if (s.pending + 2 > s.pending_buf_size) { + flush_pending(strm); + } + if (s.pending + 2 <= s.pending_buf_size) { + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + strm.adler = 0; //crc32(0L, Z_NULL, 0); + s.status = BUSY_STATE; + } + } + else { + s.status = BUSY_STATE; + } + } +//#endif + + /* Flush as much pending output as possible */ + if (s.pending !== 0) { + flush_pending(strm); + if (strm.avail_out === 0) { + /* Since avail_out is 0, deflate will be called again with + * more output space, but possibly with both pending and + * avail_in equal to zero. There won't be anything to do, + * but this is not an error situation so make sure we + * return OK instead of BUF_ERROR at next call of deflate: + */ + s.last_flush = -1; + return Z_OK$3; + } + + /* Make sure there is something to do and avoid duplicate consecutive + * flushes. For repeated and useless calls with Z_FINISH, we keep + * returning Z_STREAM_END instead of Z_BUF_ERROR. + */ + } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && + flush !== Z_FINISH$3) { + return err(strm, Z_BUF_ERROR$1); + } + + /* User must not provide more input after the first FINISH: */ + if (s.status === FINISH_STATE && strm.avail_in !== 0) { + return err(strm, Z_BUF_ERROR$1); + } + + /* Start a new block or continue the current one. + */ + if (strm.avail_in !== 0 || s.lookahead !== 0 || + (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) { + let bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) : + (s.strategy === Z_RLE ? deflate_rle(s, flush) : + configuration_table[s.level].func(s, flush)); + + if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) { + s.status = FINISH_STATE; + } + if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) { + if (strm.avail_out === 0) { + s.last_flush = -1; + /* avoid BUF_ERROR next call, see above */ + } + return Z_OK$3; + /* If flush != Z_NO_FLUSH && avail_out == 0, the next call + * of deflate should use the same flush parameter to make sure + * that the flush is complete. So we don't have to output an + * empty block here, this will be done at next call. This also + * ensures that for a very small output buffer, we emit at most + * one empty block. + */ + } + if (bstate === BS_BLOCK_DONE) { + if (flush === Z_PARTIAL_FLUSH) { + _tr_align(s); + } + else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */ + + _tr_stored_block(s, 0, 0, false); + /* For a full flush, this empty block will be recognized + * as a special marker by inflate_sync(). + */ + if (flush === Z_FULL_FLUSH$1) { + /*** CLEAR_HASH(s); ***/ /* forget history */ + zero(s.head); // Fill with NIL (= 0); + + if (s.lookahead === 0) { + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + } + } + flush_pending(strm); + if (strm.avail_out === 0) { + s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */ + return Z_OK$3; + } + } + } + //Assert(strm->avail_out > 0, "bug2"); + //if (strm.avail_out <= 0) { throw new Error("bug2");} + + if (flush !== Z_FINISH$3) { return Z_OK$3; } + if (s.wrap <= 0) { return Z_STREAM_END$3; } + + /* Write the trailer */ + if (s.wrap === 2) { + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + put_byte(s, (strm.adler >> 16) & 0xff); + put_byte(s, (strm.adler >> 24) & 0xff); + put_byte(s, strm.total_in & 0xff); + put_byte(s, (strm.total_in >> 8) & 0xff); + put_byte(s, (strm.total_in >> 16) & 0xff); + put_byte(s, (strm.total_in >> 24) & 0xff); + } + else + { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + + flush_pending(strm); + /* If avail_out is zero, the application will call deflate again + * to flush the rest. + */ + if (s.wrap > 0) { s.wrap = -s.wrap; } + /* write the trailer only once! */ + return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3; +}; + + +const deflateEnd = (strm) => { + + if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) { + return Z_STREAM_ERROR$2; + } + + const status = strm.state.status; + if (status !== INIT_STATE && + status !== EXTRA_STATE && + status !== NAME_STATE && + status !== COMMENT_STATE && + status !== HCRC_STATE && + status !== BUSY_STATE && + status !== FINISH_STATE + ) { + return err(strm, Z_STREAM_ERROR$2); + } + + strm.state = null; + + return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3; +}; + + +/* ========================================================================= + * Initializes the compression dictionary from the given byte + * sequence without producing any compressed output. + */ +const deflateSetDictionary = (strm, dictionary) => { + + let dictLength = dictionary.length; + + if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) { + return Z_STREAM_ERROR$2; + } + + const s = strm.state; + const wrap = s.wrap; + + if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) { + return Z_STREAM_ERROR$2; + } + + /* when using zlib wrappers, compute Adler-32 for provided dictionary */ + if (wrap === 1) { + /* adler32(strm->adler, dictionary, dictLength); */ + strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0); + } + + s.wrap = 0; /* avoid computing Adler-32 in read_buf */ + + /* if dictionary would fill window, just replace the history */ + if (dictLength >= s.w_size) { + if (wrap === 0) { /* already empty otherwise */ + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + /* use the tail */ + // dictionary = dictionary.slice(dictLength - s.w_size); + let tmpDict = new Uint8Array(s.w_size); + tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0); + dictionary = tmpDict; + dictLength = s.w_size; + } + /* insert dictionary into window and hash */ + const avail = strm.avail_in; + const next = strm.next_in; + const input = strm.input; + strm.avail_in = dictLength; + strm.next_in = 0; + strm.input = dictionary; + fill_window(s); + while (s.lookahead >= MIN_MATCH) { + let str = s.strstart; + let n = s.lookahead - (MIN_MATCH - 1); + do { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + + s.prev[str & s.w_mask] = s.head[s.ins_h]; + + s.head[s.ins_h] = str; + str++; + } while (--n); + s.strstart = str; + s.lookahead = MIN_MATCH - 1; + fill_window(s); + } + s.strstart += s.lookahead; + s.block_start = s.strstart; + s.insert = s.lookahead; + s.lookahead = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + strm.next_in = next; + strm.input = input; + strm.avail_in = avail; + s.wrap = wrap; + return Z_OK$3; +}; + + +var deflateInit_1 = deflateInit; +var deflateInit2_1 = deflateInit2; +var deflateReset_1 = deflateReset; +var deflateResetKeep_1 = deflateResetKeep; +var deflateSetHeader_1 = deflateSetHeader; +var deflate_2$1 = deflate$2; +var deflateEnd_1 = deflateEnd; +var deflateSetDictionary_1 = deflateSetDictionary; +var deflateInfo = 'pako deflate (from Nodeca project)'; + +/* Not implemented +module.exports.deflateBound = deflateBound; +module.exports.deflateCopy = deflateCopy; +module.exports.deflateParams = deflateParams; +module.exports.deflatePending = deflatePending; +module.exports.deflatePrime = deflatePrime; +module.exports.deflateTune = deflateTune; +*/ + +var deflate_1$2 = { + deflateInit: deflateInit_1, + deflateInit2: deflateInit2_1, + deflateReset: deflateReset_1, + deflateResetKeep: deflateResetKeep_1, + deflateSetHeader: deflateSetHeader_1, + deflate: deflate_2$1, + deflateEnd: deflateEnd_1, + deflateSetDictionary: deflateSetDictionary_1, + deflateInfo: deflateInfo +}; + +const _has = (obj, key) => { + return Object.prototype.hasOwnProperty.call(obj, key); +}; + +var assign = function (obj /*from1, from2, from3, ...*/) { + const sources = Array.prototype.slice.call(arguments, 1); + while (sources.length) { + const source = sources.shift(); + if (!source) { continue; } + + if (typeof source !== 'object') { + throw new TypeError(source + 'must be non-object'); + } + + for (const p in source) { + if (_has(source, p)) { + obj[p] = source[p]; + } + } + } + + return obj; +}; + + +// Join array of chunks to single array. +var flattenChunks = (chunks) => { + // calculate data length + let len = 0; + + for (let i = 0, l = chunks.length; i < l; i++) { + len += chunks[i].length; + } + + // join chunks + const result = new Uint8Array(len); + + for (let i = 0, pos = 0, l = chunks.length; i < l; i++) { + let chunk = chunks[i]; + result.set(chunk, pos); + pos += chunk.length; + } + + return result; +}; + +var common = { + assign: assign, + flattenChunks: flattenChunks +}; + +// String encode/decode helpers + + +// Quick check if we can use fast array to bin string conversion +// +// - apply(Array) can fail on Android 2.2 +// - apply(Uint8Array) can fail on iOS 5.1 Safari +// +let STR_APPLY_UIA_OK = true; + +try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; } + + +// Table with utf8 lengths (calculated by first byte of sequence) +// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, +// because max possible codepoint is 0x10ffff +const _utf8len = new Uint8Array(256); +for (let q = 0; q < 256; q++) { + _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1); +} +_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start + + +// convert string to array (typed, when possible) +var string2buf = (str) => { + if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) { + return new TextEncoder().encode(str); + } + + let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + buf = new Uint8Array(buf_len); + + // convert + for (i = 0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | (c >>> 6); + buf[i++] = 0x80 | (c & 0x3f); + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | (c >>> 12); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } else { + /* four bytes */ + buf[i++] = 0xf0 | (c >>> 18); + buf[i++] = 0x80 | (c >>> 12 & 0x3f); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } + } + + return buf; +}; + +// Helper +const buf2binstring = (buf, len) => { + // On Chrome, the arguments in a function call that are allowed is `65534`. + // If the length of the buffer is smaller than that, we can use this optimization, + // otherwise we will take a slower path. + if (len < 65534) { + if (buf.subarray && STR_APPLY_UIA_OK) { + return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len)); + } + } + + let result = ''; + for (let i = 0; i < len; i++) { + result += String.fromCharCode(buf[i]); + } + return result; +}; + + +// convert array to string +var buf2string = (buf, max) => { + const len = max || buf.length; + + if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) { + return new TextDecoder().decode(buf.subarray(0, max)); + } + + let i, out; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + const utf16buf = new Array(len * 2); + + for (out = 0, i = 0; i < len;) { + let c = buf[i++]; + // quick process ascii + if (c < 0x80) { utf16buf[out++] = c; continue; } + + let c_len = _utf8len[c]; + // skip 5 & 6 byte codes + if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = (c << 6) | (buf[i++] & 0x3f); + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } + + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff); + utf16buf[out++] = 0xdc00 | (c & 0x3ff); + } + } + + return buf2binstring(utf16buf, out); +}; + + +// Calculate max possible position in utf8 buffer, +// that will not break sequence. If that's not possible +// - (very small limits) return max size as is. +// +// buf[] - utf8 bytes array +// max - length limit (mandatory); +var utf8border = (buf, max) => { + + max = max || buf.length; + if (max > buf.length) { max = buf.length; } + + // go back from last position, until start of sequence found + let pos = max - 1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } + + // Very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { return max; } + + // If we came to start of buffer - that means buffer is too small, + // return max too. + if (pos === 0) { return max; } + + return (pos + _utf8len[buf[pos]] > max) ? pos : max; +}; + +var strings = { + string2buf: string2buf, + buf2string: buf2string, + utf8border: utf8border +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +function ZStream() { + /* next input byte */ + this.input = null; // JS specific, because we have no pointers + this.next_in = 0; + /* number of bytes available at input */ + this.avail_in = 0; + /* total number of input bytes read so far */ + this.total_in = 0; + /* next output byte should be put there */ + this.output = null; // JS specific, because we have no pointers + this.next_out = 0; + /* remaining free space at output */ + this.avail_out = 0; + /* total number of bytes output so far */ + this.total_out = 0; + /* last error message, NULL if no error */ + this.msg = ''/*Z_NULL*/; + /* not visible by applications */ + this.state = null; + /* best guess about the data type: binary or text */ + this.data_type = 2/*Z_UNKNOWN*/; + /* adler32 value of the uncompressed data */ + this.adler = 0; +} + +var zstream = ZStream; + +const toString$1 = Object.prototype.toString; + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2, + Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2, + Z_DEFAULT_COMPRESSION, + Z_DEFAULT_STRATEGY, + Z_DEFLATED: Z_DEFLATED$1 +} = constants$2; + +/* ===========================================================================*/ + + +/** + * class Deflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[deflate]], + * [[deflateRaw]] and [[gzip]]. + **/ + +/* internal + * Deflate.chunks -> Array + * + * Chunks of output data, if [[Deflate#onData]] not overridden. + **/ + +/** + * Deflate.result -> Uint8Array + * + * Compressed result, generated by default [[Deflate#onData]] + * and [[Deflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Deflate#push]] with `Z_FINISH` / `true` param). + **/ + +/** + * Deflate.err -> Number + * + * Error code after deflate finished. 0 (Z_OK) on success. + * You will not need it in real life, because deflate errors + * are possible only on wrong options or bad `onData` / `onEnd` + * custom handlers. + **/ + +/** + * Deflate.msg -> String + * + * Error message, if [[Deflate.err]] != 0 + **/ + + +/** + * new Deflate(options) + * - options (Object): zlib deflate options. + * + * Creates new deflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `level` + * - `windowBits` + * - `memLevel` + * - `strategy` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw deflate + * - `gzip` (Boolean) - create gzip wrapper + * - `header` (Object) - custom header for gzip + * - `text` (Boolean) - true if compressed data believed to be text + * - `time` (Number) - modification time, unix timestamp + * - `os` (Number) - operation system code + * - `extra` (Array) - array of bytes with extra data (max 65536) + * - `name` (String) - file name (binary string) + * - `comment` (String) - comment (binary string) + * - `hcrc` (Boolean) - true if header crc should be added + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const deflate = new pako.Deflate({ level: 3}); + * + * deflate.push(chunk1, false); + * deflate.push(chunk2, true); // true -> last chunk + * + * if (deflate.err) { throw new Error(deflate.err); } + * + * console.log(deflate.result); + * ``` + **/ +function Deflate$1(options) { + this.options = common.assign({ + level: Z_DEFAULT_COMPRESSION, + method: Z_DEFLATED$1, + chunkSize: 16384, + windowBits: 15, + memLevel: 8, + strategy: Z_DEFAULT_STRATEGY + }, options || {}); + + let opt = this.options; + + if (opt.raw && (opt.windowBits > 0)) { + opt.windowBits = -opt.windowBits; + } + + else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) { + opt.windowBits += 16; + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + + let status = deflate_1$2.deflateInit2( + this.strm, + opt.level, + opt.method, + opt.windowBits, + opt.memLevel, + opt.strategy + ); + + if (status !== Z_OK$2) { + throw new Error(messages[status]); + } + + if (opt.header) { + deflate_1$2.deflateSetHeader(this.strm, opt.header); + } + + if (opt.dictionary) { + let dict; + // Convert data if needed + if (typeof opt.dictionary === 'string') { + // If we need to compress text, change encoding to utf8. + dict = strings.string2buf(opt.dictionary); + } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') { + dict = new Uint8Array(opt.dictionary); + } else { + dict = opt.dictionary; + } + + status = deflate_1$2.deflateSetDictionary(this.strm, dict); + + if (status !== Z_OK$2) { + throw new Error(messages[status]); + } + + this._dict_set = true; + } +} + +/** + * Deflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be + * converted to utf8 byte sequence. + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes. + * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH. + * + * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with + * new compressed chunks. Returns `true` on success. The last data block must + * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending + * buffers and call [[Deflate#onEnd]]. + * + * On fail call [[Deflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ +Deflate$1.prototype.push = function (data, flush_mode) { + const strm = this.strm; + const chunkSize = this.options.chunkSize; + let status, _flush_mode; + + if (this.ended) { return false; } + + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode; + else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1; + + // Convert data if needed + if (typeof data === 'string') { + // If we need to compress text, change encoding to utf8. + strm.input = strings.string2buf(data); + } else if (toString$1.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + // Make sure avail_out > 6 to avoid repeating markers + if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + + status = deflate_1$2.deflate(strm, _flush_mode); + + // Ended => flush and finish + if (status === Z_STREAM_END$2) { + if (strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + } + status = deflate_1$2.deflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return status === Z_OK$2; + } + + // Flush if out buffer full + if (strm.avail_out === 0) { + this.onData(strm.output); + continue; + } + + // Flush if requested and has data + if (_flush_mode > 0 && strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + + if (strm.avail_in === 0) break; + } + + return true; +}; + + +/** + * Deflate#onData(chunk) -> Void + * - chunk (Uint8Array): output data. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ +Deflate$1.prototype.onData = function (chunk) { + this.chunks.push(chunk); +}; + + +/** + * Deflate#onEnd(status) -> Void + * - status (Number): deflate status. 0 (Z_OK) on success, + * other if not. + * + * Called once after you tell deflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ +Deflate$1.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK$2) { + this.result = common.flattenChunks(this.chunks); + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; +}; + + +/** + * deflate(data[, options]) -> Uint8Array + * - data (Uint8Array|String): input data to compress. + * - options (Object): zlib deflate options. + * + * Compress `data` with deflate algorithm and `options`. + * + * Supported options are: + * + * - level + * - windowBits + * - memLevel + * - strategy + * - dictionary + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]); + * + * console.log(pako.deflate(data)); + * ``` + **/ +function deflate$1(input, options) { + const deflator = new Deflate$1(options); + + deflator.push(input, true); + + // That will never happens, if you don't cheat with options :) + if (deflator.err) { throw deflator.msg || messages[deflator.err]; } + + return deflator.result; +} + + +/** + * deflateRaw(data[, options]) -> Uint8Array + * - data (Uint8Array|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ +function deflateRaw$1(input, options) { + options = options || {}; + options.raw = true; + return deflate$1(input, options); +} + + +/** + * gzip(data[, options]) -> Uint8Array + * - data (Uint8Array|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but create gzip wrapper instead of + * deflate one. + **/ +function gzip$1(input, options) { + options = options || {}; + options.gzip = true; + return deflate$1(input, options); +} + + +var Deflate_1$1 = Deflate$1; +var deflate_2 = deflate$1; +var deflateRaw_1$1 = deflateRaw$1; +var gzip_1$1 = gzip$1; +var constants$1 = constants$2; + +var deflate_1$1 = { + Deflate: Deflate_1$1, + deflate: deflate_2, + deflateRaw: deflateRaw_1$1, + gzip: gzip_1$1, + constants: constants$1 +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +// See state defs from inflate.js +const BAD$1 = 30; /* got a data error -- remain here until reset */ +const TYPE$1 = 12; /* i: waiting for type bits, including last-flag bit */ + +/* + Decode literal, length, and distance codes and write out the resulting + literal and match bytes until either not enough input or output is + available, an end-of-block is encountered, or a data error is encountered. + When large enough input and output buffers are supplied to inflate(), for + example, a 16K input buffer and a 64K output buffer, more than 95% of the + inflate execution time is spent in this routine. + + Entry assumptions: + + state.mode === LEN + strm.avail_in >= 6 + strm.avail_out >= 258 + start >= strm.avail_out + state.bits < 8 + + On return, state.mode is one of: + + LEN -- ran out of enough output space or enough available input + TYPE -- reached end of block code, inflate() to interpret next block + BAD -- error in block data + + Notes: + + - The maximum input bits used by a length/distance pair is 15 bits for the + length code, 5 bits for the length extra, 15 bits for the distance code, + and 13 bits for the distance extra. This totals 48 bits, or six bytes. + Therefore if strm.avail_in >= 6, then there is enough input to avoid + checking for available input while decoding. + + - The maximum bytes that a single length/distance pair can output is 258 + bytes, which is the maximum length that can be coded. inflate_fast() + requires strm.avail_out >= 258 for each loop to avoid checking for + output space. + */ +var inffast = function inflate_fast(strm, start) { + let _in; /* local strm.input */ + let last; /* have enough input while in < last */ + let _out; /* local strm.output */ + let beg; /* inflate()'s initial strm.output */ + let end; /* while out < end, enough space available */ +//#ifdef INFLATE_STRICT + let dmax; /* maximum distance from zlib header */ +//#endif + let wsize; /* window size or zero if not using window */ + let whave; /* valid bytes in the window */ + let wnext; /* window write index */ + // Use `s_window` instead `window`, avoid conflict with instrumentation tools + let s_window; /* allocated sliding window, if wsize != 0 */ + let hold; /* local strm.hold */ + let bits; /* local strm.bits */ + let lcode; /* local strm.lencode */ + let dcode; /* local strm.distcode */ + let lmask; /* mask for first level of length codes */ + let dmask; /* mask for first level of distance codes */ + let here; /* retrieved table entry */ + let op; /* code bits, operation, extra bits, or */ + /* window position, window bytes to copy */ + let len; /* match length, unused bytes */ + let dist; /* match distance */ + let from; /* where to copy match from */ + let from_source; + + + let input, output; // JS specific, because we have no pointers + + /* copy state to local variables */ + const state = strm.state; + //here = state.here; + _in = strm.next_in; + input = strm.input; + last = _in + (strm.avail_in - 5); + _out = strm.next_out; + output = strm.output; + beg = _out - (start - strm.avail_out); + end = _out + (strm.avail_out - 257); +//#ifdef INFLATE_STRICT + dmax = state.dmax; +//#endif + wsize = state.wsize; + whave = state.whave; + wnext = state.wnext; + s_window = state.window; + hold = state.hold; + bits = state.bits; + lcode = state.lencode; + dcode = state.distcode; + lmask = (1 << state.lenbits) - 1; + dmask = (1 << state.distbits) - 1; + + + /* decode literals and length/distances until end-of-block or not enough + input data or output space */ + + top: + do { + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + + here = lcode[hold & lmask]; + + dolen: + for (;;) { // Goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + if (op === 0) { /* literal */ + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + output[_out++] = here & 0xffff/*here.val*/; + } + else if (op & 16) { /* length base */ + len = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (op) { + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + len += hold & ((1 << op) - 1); + hold >>>= op; + bits -= op; + } + //Tracevv((stderr, "inflate: length %u\n", len)); + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + here = dcode[hold & dmask]; + + dodist: + for (;;) { // goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + + if (op & 16) { /* distance base */ + dist = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + } + dist += hold & ((1 << op) - 1); +//#ifdef INFLATE_STRICT + if (dist > dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } +//#endif + hold >>>= op; + bits -= op; + //Tracevv((stderr, "inflate: distance %u\n", dist)); + op = _out - beg; /* max distance in output */ + if (dist > op) { /* see if copy from window */ + op = dist - op; /* distance back in window */ + if (op > whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } + +// (!) This block is disabled in zlib defaults, +// don't enable it for binary compatibility +//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR +// if (len <= op - whave) { +// do { +// output[_out++] = 0; +// } while (--len); +// continue top; +// } +// len -= op - whave; +// do { +// output[_out++] = 0; +// } while (--op > whave); +// if (op === 0) { +// from = _out - dist; +// do { +// output[_out++] = output[from++]; +// } while (--len); +// continue top; +// } +//#endif + } + from = 0; // window index + from_source = s_window; + if (wnext === 0) { /* very common case */ + from += wsize - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + else if (wnext < op) { /* wrap around window */ + from += wsize + wnext - op; + op -= wnext; + if (op < len) { /* some from end of window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = 0; + if (wnext < len) { /* some from start of window */ + op = wnext; + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + } + else { /* contiguous in window */ + from += wnext - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + while (len > 2) { + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + len -= 3; + } + if (len) { + output[_out++] = from_source[from++]; + if (len > 1) { + output[_out++] = from_source[from++]; + } + } + } + else { + from = _out - dist; /* copy direct from output */ + do { /* minimum length is three */ + output[_out++] = output[from++]; + output[_out++] = output[from++]; + output[_out++] = output[from++]; + len -= 3; + } while (len > 2); + if (len) { + output[_out++] = output[from++]; + if (len > 1) { + output[_out++] = output[from++]; + } + } + } + } + else if ((op & 64) === 0) { /* 2nd level distance code */ + here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dodist; + } + else { + strm.msg = 'invalid distance code'; + state.mode = BAD$1; + break top; + } + + break; // need to emulate goto via "continue" + } + } + else if ((op & 64) === 0) { /* 2nd level length code */ + here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dolen; + } + else if (op & 32) { /* end-of-block */ + //Tracevv((stderr, "inflate: end of block\n")); + state.mode = TYPE$1; + break top; + } + else { + strm.msg = 'invalid literal/length code'; + state.mode = BAD$1; + break top; + } + + break; // need to emulate goto via "continue" + } + } while (_in < last && _out < end); + + /* return unused bytes (on entry, bits < 8, so in won't go too far back) */ + len = bits >> 3; + _in -= len; + bits -= len << 3; + hold &= (1 << bits) - 1; + + /* update state and return */ + strm.next_in = _in; + strm.next_out = _out; + strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last)); + strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end)); + state.hold = hold; + state.bits = bits; + return; +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +const MAXBITS = 15; +const ENOUGH_LENS$1 = 852; +const ENOUGH_DISTS$1 = 592; +//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + +const CODES$1 = 0; +const LENS$1 = 1; +const DISTS$1 = 2; + +const lbase = new Uint16Array([ /* Length codes 257..285 base */ + 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, + 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 +]); + +const lext = new Uint8Array([ /* Length codes 257..285 extra */ + 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, + 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78 +]); + +const dbase = new Uint16Array([ /* Distance codes 0..29 base */ + 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, + 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, + 8193, 12289, 16385, 24577, 0, 0 +]); + +const dext = new Uint8Array([ /* Distance codes 0..29 extra */ + 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, + 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, + 28, 28, 29, 29, 64, 64 +]); + +const inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) => +{ + const bits = opts.bits; + //here = opts.here; /* table entry for duplication */ + + let len = 0; /* a code's length in bits */ + let sym = 0; /* index of code symbols */ + let min = 0, max = 0; /* minimum and maximum code lengths */ + let root = 0; /* number of index bits for root table */ + let curr = 0; /* number of index bits for current table */ + let drop = 0; /* code bits to drop for sub-table */ + let left = 0; /* number of prefix codes available */ + let used = 0; /* code entries in table used */ + let huff = 0; /* Huffman code */ + let incr; /* for incrementing code, index */ + let fill; /* index for replicating entries */ + let low; /* low bits for current root entry */ + let mask; /* mask for low root bits */ + let next; /* next available space in table */ + let base = null; /* base value table to use */ + let base_index = 0; +// let shoextra; /* extra bits table to use */ + let end; /* use base and extra for symbol > end */ + const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */ + const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */ + let extra = null; + let extra_index = 0; + + let here_bits, here_op, here_val; + + /* + Process a set of code lengths to create a canonical Huffman code. The + code lengths are lens[0..codes-1]. Each length corresponds to the + symbols 0..codes-1. The Huffman code is generated by first sorting the + symbols by length from short to long, and retaining the symbol order + for codes with equal lengths. Then the code starts with all zero bits + for the first code of the shortest length, and the codes are integer + increments for the same length, and zeros are appended as the length + increases. For the deflate format, these bits are stored backwards + from their more natural integer increment ordering, and so when the + decoding tables are built in the large loop below, the integer codes + are incremented backwards. + + This routine assumes, but does not check, that all of the entries in + lens[] are in the range 0..MAXBITS. The caller must assure this. + 1..MAXBITS is interpreted as that code length. zero means that that + symbol does not occur in this code. + + The codes are sorted by computing a count of codes for each length, + creating from that a table of starting indices for each length in the + sorted table, and then entering the symbols in order in the sorted + table. The sorted table is work[], with that space being provided by + the caller. + + The length counts are used for other purposes as well, i.e. finding + the minimum and maximum length codes, determining if there are any + codes at all, checking for a valid set of lengths, and looking ahead + at length counts to determine sub-table sizes when building the + decoding tables. + */ + + /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ + for (len = 0; len <= MAXBITS; len++) { + count[len] = 0; + } + for (sym = 0; sym < codes; sym++) { + count[lens[lens_index + sym]]++; + } + + /* bound code lengths, force root to be within code lengths */ + root = bits; + for (max = MAXBITS; max >= 1; max--) { + if (count[max] !== 0) { break; } + } + if (root > max) { + root = max; + } + if (max === 0) { /* no symbols to code at all */ + //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */ + //table.bits[opts.table_index] = 1; //here.bits = (var char)1; + //table.val[opts.table_index++] = 0; //here.val = (var short)0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + + //table.op[opts.table_index] = 64; + //table.bits[opts.table_index] = 1; + //table.val[opts.table_index++] = 0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + opts.bits = 1; + return 0; /* no symbols, but wait for decoding to report error */ + } + for (min = 1; min < max; min++) { + if (count[min] !== 0) { break; } + } + if (root < min) { + root = min; + } + + /* check for an over-subscribed or incomplete set of lengths */ + left = 1; + for (len = 1; len <= MAXBITS; len++) { + left <<= 1; + left -= count[len]; + if (left < 0) { + return -1; + } /* over-subscribed */ + } + if (left > 0 && (type === CODES$1 || max !== 1)) { + return -1; /* incomplete set */ + } + + /* generate offsets into symbol table for each length for sorting */ + offs[1] = 0; + for (len = 1; len < MAXBITS; len++) { + offs[len + 1] = offs[len] + count[len]; + } + + /* sort symbols by length, by symbol order within each length */ + for (sym = 0; sym < codes; sym++) { + if (lens[lens_index + sym] !== 0) { + work[offs[lens[lens_index + sym]]++] = sym; + } + } + + /* + Create and fill in decoding tables. In this loop, the table being + filled is at next and has curr index bits. The code being used is huff + with length len. That code is converted to an index by dropping drop + bits off of the bottom. For codes where len is less than drop + curr, + those top drop + curr - len bits are incremented through all values to + fill the table with replicated entries. + + root is the number of index bits for the root table. When len exceeds + root, sub-tables are created pointed to by the root entry with an index + of the low root bits of huff. This is saved in low to check for when a + new sub-table should be started. drop is zero when the root table is + being filled, and drop is root when sub-tables are being filled. + + When a new sub-table is needed, it is necessary to look ahead in the + code lengths to determine what size sub-table is needed. The length + counts are used for this, and so count[] is decremented as codes are + entered in the tables. + + used keeps track of how many table entries have been allocated from the + provided *table space. It is checked for LENS and DIST tables against + the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in + the initial root table size constants. See the comments in inftrees.h + for more information. + + sym increments through all symbols, and the loop terminates when + all codes of length max, i.e. all codes, have been processed. This + routine permits incomplete codes, so another loop after this one fills + in the rest of the decoding tables with invalid code markers. + */ + + /* set up for code type */ + // poor man optimization - use if-else instead of switch, + // to avoid deopts in old v8 + if (type === CODES$1) { + base = extra = work; /* dummy value--not used */ + end = 19; + + } else if (type === LENS$1) { + base = lbase; + base_index -= 257; + extra = lext; + extra_index -= 257; + end = 256; + + } else { /* DISTS */ + base = dbase; + extra = dext; + end = -1; + } + + /* initialize opts for loop */ + huff = 0; /* starting code */ + sym = 0; /* starting code symbol */ + len = min; /* starting code length */ + next = table_index; /* current table to fill in */ + curr = root; /* current table index bits */ + drop = 0; /* current bits to drop from code for index */ + low = -1; /* trigger new sub-table when len > root */ + used = 1 << root; /* use root table entries */ + mask = used - 1; /* mask for comparing low */ + + /* check available table space */ + if ((type === LENS$1 && used > ENOUGH_LENS$1) || + (type === DISTS$1 && used > ENOUGH_DISTS$1)) { + return 1; + } + + /* process all codes and make table entries */ + for (;;) { + /* create table entry */ + here_bits = len - drop; + if (work[sym] < end) { + here_op = 0; + here_val = work[sym]; + } + else if (work[sym] > end) { + here_op = extra[extra_index + work[sym]]; + here_val = base[base_index + work[sym]]; + } + else { + here_op = 32 + 64; /* end of block */ + here_val = 0; + } + + /* replicate for those indices with low len bits equal to huff */ + incr = 1 << (len - drop); + fill = 1 << curr; + min = fill; /* save offset to next table */ + do { + fill -= incr; + table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0; + } while (fill !== 0); + + /* backwards increment the len-bit code huff */ + incr = 1 << (len - 1); + while (huff & incr) { + incr >>= 1; + } + if (incr !== 0) { + huff &= incr - 1; + huff += incr; + } else { + huff = 0; + } + + /* go to next symbol, update count, len */ + sym++; + if (--count[len] === 0) { + if (len === max) { break; } + len = lens[lens_index + work[sym]]; + } + + /* create new sub-table if needed */ + if (len > root && (huff & mask) !== low) { + /* if first time, transition to sub-tables */ + if (drop === 0) { + drop = root; + } + + /* increment past last table */ + next += min; /* here min is 1 << curr */ + + /* determine length of next table */ + curr = len - drop; + left = 1 << curr; + while (curr + drop < max) { + left -= count[curr + drop]; + if (left <= 0) { break; } + curr++; + left <<= 1; + } + + /* check for enough space */ + used += 1 << curr; + if ((type === LENS$1 && used > ENOUGH_LENS$1) || + (type === DISTS$1 && used > ENOUGH_DISTS$1)) { + return 1; + } + + /* point entry in root table to sub-table */ + low = huff & mask; + /*table.op[low] = curr; + table.bits[low] = root; + table.val[low] = next - opts.table_index;*/ + table[low] = (root << 24) | (curr << 16) | (next - table_index) |0; + } + } + + /* fill in remaining table entry if code is incomplete (guaranteed to have + at most one remaining entry, since if the code is incomplete, the + maximum code length that was allowed to get this far is one bit) */ + if (huff !== 0) { + //table.op[next + huff] = 64; /* invalid code marker */ + //table.bits[next + huff] = len - drop; + //table.val[next + huff] = 0; + table[next + huff] = ((len - drop) << 24) | (64 << 16) |0; + } + + /* set return parameters */ + //opts.table_index += used; + opts.bits = root; + return 0; +}; + + +var inftrees = inflate_table; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + + + + + + +const CODES = 0; +const LENS = 1; +const DISTS = 2; + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES, + 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, + Z_DEFLATED +} = constants$2; + + +/* STATES ====================================================================*/ +/* ===========================================================================*/ + + +const HEAD = 1; /* i: waiting for magic header */ +const FLAGS = 2; /* i: waiting for method and flags (gzip) */ +const TIME = 3; /* i: waiting for modification time (gzip) */ +const OS = 4; /* i: waiting for extra flags and operating system (gzip) */ +const EXLEN = 5; /* i: waiting for extra length (gzip) */ +const EXTRA = 6; /* i: waiting for extra bytes (gzip) */ +const NAME = 7; /* i: waiting for end of file name (gzip) */ +const COMMENT = 8; /* i: waiting for end of comment (gzip) */ +const HCRC = 9; /* i: waiting for header crc (gzip) */ +const DICTID = 10; /* i: waiting for dictionary check value */ +const DICT = 11; /* waiting for inflateSetDictionary() call */ +const TYPE = 12; /* i: waiting for type bits, including last-flag bit */ +const TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */ +const STORED = 14; /* i: waiting for stored size (length and complement) */ +const COPY_ = 15; /* i/o: same as COPY below, but only first time in */ +const COPY = 16; /* i/o: waiting for input or output to copy stored block */ +const TABLE = 17; /* i: waiting for dynamic block table lengths */ +const LENLENS = 18; /* i: waiting for code length code lengths */ +const CODELENS = 19; /* i: waiting for length/lit and distance code lengths */ +const LEN_ = 20; /* i: same as LEN below, but only first time in */ +const LEN = 21; /* i: waiting for length/lit/eob code */ +const LENEXT = 22; /* i: waiting for length extra bits */ +const DIST = 23; /* i: waiting for distance code */ +const DISTEXT = 24; /* i: waiting for distance extra bits */ +const MATCH = 25; /* o: waiting for output space to copy string */ +const LIT = 26; /* o: waiting for output space to write literal */ +const CHECK = 27; /* i: waiting for 32-bit check value */ +const LENGTH = 28; /* i: waiting for 32-bit length (gzip) */ +const DONE = 29; /* finished check, done -- remain here until reset */ +const BAD = 30; /* got a data error -- remain here until reset */ +const MEM = 31; /* got an inflate() memory error -- remain here until reset */ +const SYNC = 32; /* looking for synchronization bytes to restart inflate() */ + +/* ===========================================================================*/ + + + +const ENOUGH_LENS = 852; +const ENOUGH_DISTS = 592; +//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + +const MAX_WBITS = 15; +/* 32K LZ77 window */ +const DEF_WBITS = MAX_WBITS; + + +const zswap32 = (q) => { + + return (((q >>> 24) & 0xff) + + ((q >>> 8) & 0xff00) + + ((q & 0xff00) << 8) + + ((q & 0xff) << 24)); +}; + + +function InflateState() { + this.mode = 0; /* current inflate mode */ + this.last = false; /* true if processing last block */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ + this.havedict = false; /* true if dictionary provided */ + this.flags = 0; /* gzip header method and flags (0 if zlib) */ + this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */ + this.check = 0; /* protected copy of check value */ + this.total = 0; /* protected copy of output count */ + // TODO: may be {} + this.head = null; /* where to save gzip header information */ + + /* sliding window */ + this.wbits = 0; /* log base 2 of requested window size */ + this.wsize = 0; /* window size or zero if not using window */ + this.whave = 0; /* valid bytes in the window */ + this.wnext = 0; /* window write index */ + this.window = null; /* allocated sliding window, if needed */ + + /* bit accumulator */ + this.hold = 0; /* input bit accumulator */ + this.bits = 0; /* number of bits in "in" */ + + /* for string and stored block copying */ + this.length = 0; /* literal or length of data to copy */ + this.offset = 0; /* distance back to copy string from */ + + /* for table and code decoding */ + this.extra = 0; /* extra bits needed */ + + /* fixed and dynamic code tables */ + this.lencode = null; /* starting table for length/literal codes */ + this.distcode = null; /* starting table for distance codes */ + this.lenbits = 0; /* index bits for lencode */ + this.distbits = 0; /* index bits for distcode */ + + /* dynamic table building */ + this.ncode = 0; /* number of code length code lengths */ + this.nlen = 0; /* number of length code lengths */ + this.ndist = 0; /* number of distance code lengths */ + this.have = 0; /* number of code lengths in lens[] */ + this.next = null; /* next available space in codes[] */ + + this.lens = new Uint16Array(320); /* temporary storage for code lengths */ + this.work = new Uint16Array(288); /* work area for code table building */ + + /* + because we don't have pointers in js, we use lencode and distcode directly + as buffers so we don't need codes + */ + //this.codes = new Int32Array(ENOUGH); /* space for code tables */ + this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */ + this.distdyn = null; /* dynamic table for distance codes (JS specific) */ + this.sane = 0; /* if false, allow invalid distance too far */ + this.back = 0; /* bits back of last unprocessed length/lit */ + this.was = 0; /* initial length of match */ +} + + +const inflateResetKeep = (strm) => { + + if (!strm || !strm.state) { return Z_STREAM_ERROR$1; } + const state = strm.state; + strm.total_in = strm.total_out = state.total = 0; + strm.msg = ''; /*Z_NULL*/ + if (state.wrap) { /* to support ill-conceived Java test suite */ + strm.adler = state.wrap & 1; + } + state.mode = HEAD; + state.last = 0; + state.havedict = 0; + state.dmax = 32768; + state.head = null/*Z_NULL*/; + state.hold = 0; + state.bits = 0; + //state.lencode = state.distcode = state.next = state.codes; + state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS); + state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS); + + state.sane = 1; + state.back = -1; + //Tracev((stderr, "inflate: reset\n")); + return Z_OK$1; +}; + + +const inflateReset = (strm) => { + + if (!strm || !strm.state) { return Z_STREAM_ERROR$1; } + const state = strm.state; + state.wsize = 0; + state.whave = 0; + state.wnext = 0; + return inflateResetKeep(strm); + +}; + + +const inflateReset2 = (strm, windowBits) => { + let wrap; + + /* get the state */ + if (!strm || !strm.state) { return Z_STREAM_ERROR$1; } + const state = strm.state; + + /* extract wrap request from windowBits parameter */ + if (windowBits < 0) { + wrap = 0; + windowBits = -windowBits; + } + else { + wrap = (windowBits >> 4) + 1; + if (windowBits < 48) { + windowBits &= 15; + } + } + + /* set number of window bits, free window if different */ + if (windowBits && (windowBits < 8 || windowBits > 15)) { + return Z_STREAM_ERROR$1; + } + if (state.window !== null && state.wbits !== windowBits) { + state.window = null; + } + + /* update state and reset the rest of it */ + state.wrap = wrap; + state.wbits = windowBits; + return inflateReset(strm); +}; + + +const inflateInit2 = (strm, windowBits) => { + + if (!strm) { return Z_STREAM_ERROR$1; } + //strm.msg = Z_NULL; /* in case we return an error */ + + const state = new InflateState(); + + //if (state === Z_NULL) return Z_MEM_ERROR; + //Tracev((stderr, "inflate: allocated\n")); + strm.state = state; + state.window = null/*Z_NULL*/; + const ret = inflateReset2(strm, windowBits); + if (ret !== Z_OK$1) { + strm.state = null/*Z_NULL*/; + } + return ret; +}; + + +const inflateInit = (strm) => { + + return inflateInit2(strm, DEF_WBITS); +}; + + +/* + Return state with length and distance decoding tables and index sizes set to + fixed code decoding. Normally this returns fixed tables from inffixed.h. + If BUILDFIXED is defined, then instead this routine builds the tables the + first time it's called, and returns those tables the first time and + thereafter. This reduces the size of the code by about 2K bytes, in + exchange for a little execution time. However, BUILDFIXED should not be + used for threaded applications, since the rewriting of the tables and virgin + may not be thread-safe. + */ +let virgin = true; + +let lenfix, distfix; // We have no pointers in JS, so keep tables separate + + +const fixedtables = (state) => { + + /* build fixed huffman tables if first call (may not be thread safe) */ + if (virgin) { + lenfix = new Int32Array(512); + distfix = new Int32Array(32); + + /* literal/length table */ + let sym = 0; + while (sym < 144) { state.lens[sym++] = 8; } + while (sym < 256) { state.lens[sym++] = 9; } + while (sym < 280) { state.lens[sym++] = 7; } + while (sym < 288) { state.lens[sym++] = 8; } + + inftrees(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 }); + + /* distance table */ + sym = 0; + while (sym < 32) { state.lens[sym++] = 5; } + + inftrees(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 }); + + /* do this just once */ + virgin = false; + } + + state.lencode = lenfix; + state.lenbits = 9; + state.distcode = distfix; + state.distbits = 5; +}; + + +/* + Update the window with the last wsize (normally 32K) bytes written before + returning. If window does not exist yet, create it. This is only called + when a window is already in use, or when output has been written during this + inflate call, but the end of the deflate stream has not been reached yet. + It is also called to create a window for dictionary data when a dictionary + is loaded. + + Providing output buffers larger than 32K to inflate() should provide a speed + advantage, since only the last 32K of output is copied to the sliding window + upon return from inflate(), and since all distances after the first 32K of + output will fall in the output data, making match copies simpler and faster. + The advantage may be dependent on the size of the processor's data caches. + */ +const updatewindow = (strm, src, end, copy) => { + + let dist; + const state = strm.state; + + /* if it hasn't been done already, allocate space for the window */ + if (state.window === null) { + state.wsize = 1 << state.wbits; + state.wnext = 0; + state.whave = 0; + + state.window = new Uint8Array(state.wsize); + } + + /* copy state->wsize or less output bytes into the circular window */ + if (copy >= state.wsize) { + state.window.set(src.subarray(end - state.wsize, end), 0); + state.wnext = 0; + state.whave = state.wsize; + } + else { + dist = state.wsize - state.wnext; + if (dist > copy) { + dist = copy; + } + //zmemcpy(state->window + state->wnext, end - copy, dist); + state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext); + copy -= dist; + if (copy) { + //zmemcpy(state->window, end - copy, copy); + state.window.set(src.subarray(end - copy, end), 0); + state.wnext = copy; + state.whave = state.wsize; + } + else { + state.wnext += dist; + if (state.wnext === state.wsize) { state.wnext = 0; } + if (state.whave < state.wsize) { state.whave += dist; } + } + } + return 0; +}; + + +const inflate$2 = (strm, flush) => { + + let state; + let input, output; // input/output buffers + let next; /* next input INDEX */ + let put; /* next output INDEX */ + let have, left; /* available input and output */ + let hold; /* bit buffer */ + let bits; /* bits in bit buffer */ + let _in, _out; /* save starting available input and output */ + let copy; /* number of stored or match bytes to copy */ + let from; /* where to copy match bytes from */ + let from_source; + let here = 0; /* current decoding table entry */ + let here_bits, here_op, here_val; // paked "here" denormalized (JS specific) + //let last; /* parent table entry */ + let last_bits, last_op, last_val; // paked "last" denormalized (JS specific) + let len; /* length to copy for repeats, bits to drop */ + let ret; /* return code */ + const hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */ + let opts; + + let n; // temporary variable for NEED_BITS + + const order = /* permutation of code lengths */ + new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]); + + + if (!strm || !strm.state || !strm.output || + (!strm.input && strm.avail_in !== 0)) { + return Z_STREAM_ERROR$1; + } + + state = strm.state; + if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */ + + + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + _in = have; + _out = left; + ret = Z_OK$1; + + inf_leave: // goto emulation + for (;;) { + switch (state.mode) { + case HEAD: + if (state.wrap === 0) { + state.mode = TYPEDO; + break; + } + //=== NEEDBITS(16); + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */ + state.check = 0/*crc32(0L, Z_NULL, 0)*/; + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = FLAGS; + break; + } + state.flags = 0; /* expect zlib header */ + if (state.head) { + state.head.done = false; + } + if (!(state.wrap & 1) || /* check if zlib header allowed */ + (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) { + strm.msg = 'incorrect header check'; + state.mode = BAD; + break; + } + if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + len = (hold & 0x0f)/*BITS(4)*/ + 8; + if (state.wbits === 0) { + state.wbits = len; + } + else if (len > state.wbits) { + strm.msg = 'invalid window size'; + state.mode = BAD; + break; + } + + // !!! pako patch. Force use `options.windowBits` if passed. + // Required to always use max window size by default. + state.dmax = 1 << state.wbits; + //state.dmax = 1 << len; + + //Tracev((stderr, "inflate: zlib header ok\n")); + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = hold & 0x200 ? DICTID : TYPE; + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + break; + case FLAGS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.flags = hold; + if ((state.flags & 0xff) !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + if (state.flags & 0xe000) { + strm.msg = 'unknown header flags set'; + state.mode = BAD; + break; + } + if (state.head) { + state.head.text = ((hold >> 8) & 1); + } + if (state.flags & 0x0200) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = TIME; + /* falls through */ + case TIME: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.time = hold; + } + if (state.flags & 0x0200) { + //=== CRC4(state.check, hold) + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + hbuf[2] = (hold >>> 16) & 0xff; + hbuf[3] = (hold >>> 24) & 0xff; + state.check = crc32_1(state.check, hbuf, 4, 0); + //=== + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = OS; + /* falls through */ + case OS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.xflags = (hold & 0xff); + state.head.os = (hold >> 8); + } + if (state.flags & 0x0200) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = EXLEN; + /* falls through */ + case EXLEN: + if (state.flags & 0x0400) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length = hold; + if (state.head) { + state.head.extra_len = hold; + } + if (state.flags & 0x0200) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + else if (state.head) { + state.head.extra = null/*Z_NULL*/; + } + state.mode = EXTRA; + /* falls through */ + case EXTRA: + if (state.flags & 0x0400) { + copy = state.length; + if (copy > have) { copy = have; } + if (copy) { + if (state.head) { + len = state.head.extra_len - state.length; + if (!state.head.extra) { + // Use untyped array for more convenient processing later + state.head.extra = new Uint8Array(state.head.extra_len); + } + state.head.extra.set( + input.subarray( + next, + // extra field is limited to 65536 bytes + // - no need for additional size check + next + copy + ), + /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/ + len + ); + //zmemcpy(state.head.extra + len, next, + // len + copy > state.head.extra_max ? + // state.head.extra_max - len : copy); + } + if (state.flags & 0x0200) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + state.length -= copy; + } + if (state.length) { break inf_leave; } + } + state.length = 0; + state.mode = NAME; + /* falls through */ + case NAME: + if (state.flags & 0x0800) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + // TODO: 2 or 1 bytes? + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.name_max*/)) { + state.head.name += String.fromCharCode(len); + } + } while (len && copy < have); + + if (state.flags & 0x0200) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.name = null; + } + state.length = 0; + state.mode = COMMENT; + /* falls through */ + case COMMENT: + if (state.flags & 0x1000) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.comm_max*/)) { + state.head.comment += String.fromCharCode(len); + } + } while (len && copy < have); + if (state.flags & 0x0200) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.comment = null; + } + state.mode = HCRC; + /* falls through */ + case HCRC: + if (state.flags & 0x0200) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (hold !== (state.check & 0xffff)) { + strm.msg = 'header crc mismatch'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + if (state.head) { + state.head.hcrc = ((state.flags >> 9) & 1); + state.head.done = true; + } + strm.adler = state.check = 0; + state.mode = TYPE; + break; + case DICTID: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + strm.adler = state.check = zswap32(hold); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = DICT; + /* falls through */ + case DICT: + if (state.havedict === 0) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + return Z_NEED_DICT$1; + } + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = TYPE; + /* falls through */ + case TYPE: + if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; } + /* falls through */ + case TYPEDO: + if (state.last) { + //--- BYTEBITS() ---// + hold >>>= bits & 7; + bits -= bits & 7; + //---// + state.mode = CHECK; + break; + } + //=== NEEDBITS(3); */ + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.last = (hold & 0x01)/*BITS(1)*/; + //--- DROPBITS(1) ---// + hold >>>= 1; + bits -= 1; + //---// + + switch ((hold & 0x03)/*BITS(2)*/) { + case 0: /* stored block */ + //Tracev((stderr, "inflate: stored block%s\n", + // state.last ? " (last)" : "")); + state.mode = STORED; + break; + case 1: /* fixed block */ + fixedtables(state); + //Tracev((stderr, "inflate: fixed codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = LEN_; /* decode codes */ + if (flush === Z_TREES) { + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break inf_leave; + } + break; + case 2: /* dynamic block */ + //Tracev((stderr, "inflate: dynamic codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = TABLE; + break; + case 3: + strm.msg = 'invalid block type'; + state.mode = BAD; + } + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break; + case STORED: + //--- BYTEBITS() ---// /* go to byte boundary */ + hold >>>= bits & 7; + bits -= bits & 7; + //---// + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) { + strm.msg = 'invalid stored block lengths'; + state.mode = BAD; + break; + } + state.length = hold & 0xffff; + //Tracev((stderr, "inflate: stored length %u\n", + // state.length)); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = COPY_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case COPY_: + state.mode = COPY; + /* falls through */ + case COPY: + copy = state.length; + if (copy) { + if (copy > have) { copy = have; } + if (copy > left) { copy = left; } + if (copy === 0) { break inf_leave; } + //--- zmemcpy(put, next, copy); --- + output.set(input.subarray(next, next + copy), put); + //---// + have -= copy; + next += copy; + left -= copy; + put += copy; + state.length -= copy; + break; + } + //Tracev((stderr, "inflate: stored end\n")); + state.mode = TYPE; + break; + case TABLE: + //=== NEEDBITS(14); */ + while (bits < 14) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4; + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// +//#ifndef PKZIP_BUG_WORKAROUND + if (state.nlen > 286 || state.ndist > 30) { + strm.msg = 'too many length or distance symbols'; + state.mode = BAD; + break; + } +//#endif + //Tracev((stderr, "inflate: table sizes ok\n")); + state.have = 0; + state.mode = LENLENS; + /* falls through */ + case LENLENS: + while (state.have < state.ncode) { + //=== NEEDBITS(3); + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.lens[order[state.have++]] = (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + while (state.have < 19) { + state.lens[order[state.have++]] = 0; + } + // We have separate tables & no pointers. 2 commented lines below not needed. + //state.next = state.codes; + //state.lencode = state.next; + // Switch to use dynamic table + state.lencode = state.lendyn; + state.lenbits = 7; + + opts = { bits: state.lenbits }; + ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts); + state.lenbits = opts.bits; + + if (ret) { + strm.msg = 'invalid code lengths set'; + state.mode = BAD; + break; + } + //Tracev((stderr, "inflate: code lengths ok\n")); + state.have = 0; + state.mode = CODELENS; + /* falls through */ + case CODELENS: + while (state.have < state.nlen + state.ndist) { + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_val < 16) { + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.lens[state.have++] = here_val; + } + else { + if (here_val === 16) { + //=== NEEDBITS(here.bits + 2); + n = here_bits + 2; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + if (state.have === 0) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + len = state.lens[state.have - 1]; + copy = 3 + (hold & 0x03);//BITS(2); + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + } + else if (here_val === 17) { + //=== NEEDBITS(here.bits + 3); + n = here_bits + 3; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 3 + (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + else { + //=== NEEDBITS(here.bits + 7); + n = here_bits + 7; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 11 + (hold & 0x7f);//BITS(7); + //--- DROPBITS(7) ---// + hold >>>= 7; + bits -= 7; + //---// + } + if (state.have + copy > state.nlen + state.ndist) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + while (copy--) { + state.lens[state.have++] = len; + } + } + } + + /* handle error breaks in while */ + if (state.mode === BAD) { break; } + + /* check for end-of-block code (better have one) */ + if (state.lens[256] === 0) { + strm.msg = 'invalid code -- missing end-of-block'; + state.mode = BAD; + break; + } + + /* build code tables -- note: do not change the lenbits or distbits + values here (9 and 6) without reading the comments in inftrees.h + concerning the ENOUGH constants, which depend on those values */ + state.lenbits = 9; + + opts = { bits: state.lenbits }; + ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.lenbits = opts.bits; + // state.lencode = state.next; + + if (ret) { + strm.msg = 'invalid literal/lengths set'; + state.mode = BAD; + break; + } + + state.distbits = 6; + //state.distcode.copy(state.codes); + // Switch to use dynamic table + state.distcode = state.distdyn; + opts = { bits: state.distbits }; + ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.distbits = opts.bits; + // state.distcode = state.next; + + if (ret) { + strm.msg = 'invalid distances set'; + state.mode = BAD; + break; + } + //Tracev((stderr, 'inflate: codes ok\n')); + state.mode = LEN_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case LEN_: + state.mode = LEN; + /* falls through */ + case LEN: + if (have >= 6 && left >= 258) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + inffast(strm, _out); + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + if (state.mode === TYPE) { + state.back = -1; + } + break; + } + state.back = 0; + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if (here_bits <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_op && (here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.lencode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + state.length = here_val; + if (here_op === 0) { + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + state.mode = LIT; + break; + } + if (here_op & 32) { + //Tracevv((stderr, "inflate: end of block\n")); + state.back = -1; + state.mode = TYPE; + break; + } + if (here_op & 64) { + strm.msg = 'invalid literal/length code'; + state.mode = BAD; + break; + } + state.extra = here_op & 15; + state.mode = LENEXT; + /* falls through */ + case LENEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //Tracevv((stderr, "inflate: length %u\n", state.length)); + state.was = state.length; + state.mode = DIST; + /* falls through */ + case DIST: + for (;;) { + here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if ((here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.distcode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + if (here_op & 64) { + strm.msg = 'invalid distance code'; + state.mode = BAD; + break; + } + state.offset = here_val; + state.extra = (here_op) & 15; + state.mode = DISTEXT; + /* falls through */ + case DISTEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } +//#ifdef INFLATE_STRICT + if (state.offset > state.dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } +//#endif + //Tracevv((stderr, "inflate: distance %u\n", state.offset)); + state.mode = MATCH; + /* falls through */ + case MATCH: + if (left === 0) { break inf_leave; } + copy = _out - left; + if (state.offset > copy) { /* copy from window */ + copy = state.offset - copy; + if (copy > state.whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } +// (!) This block is disabled in zlib defaults, +// don't enable it for binary compatibility +//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR +// Trace((stderr, "inflate.c too far\n")); +// copy -= state.whave; +// if (copy > state.length) { copy = state.length; } +// if (copy > left) { copy = left; } +// left -= copy; +// state.length -= copy; +// do { +// output[put++] = 0; +// } while (--copy); +// if (state.length === 0) { state.mode = LEN; } +// break; +//#endif + } + if (copy > state.wnext) { + copy -= state.wnext; + from = state.wsize - copy; + } + else { + from = state.wnext - copy; + } + if (copy > state.length) { copy = state.length; } + from_source = state.window; + } + else { /* copy from output */ + from_source = output; + from = put - state.offset; + copy = state.length; + } + if (copy > left) { copy = left; } + left -= copy; + state.length -= copy; + do { + output[put++] = from_source[from++]; + } while (--copy); + if (state.length === 0) { state.mode = LEN; } + break; + case LIT: + if (left === 0) { break inf_leave; } + output[put++] = state.length; + left--; + state.mode = LEN; + break; + case CHECK: + if (state.wrap) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + // Use '|' instead of '+' to make sure that result is signed + hold |= input[next++] << bits; + bits += 8; + } + //===// + _out -= left; + strm.total_out += _out; + state.total += _out; + if (_out) { + strm.adler = state.check = + /*UPDATE(state.check, put - _out, _out);*/ + (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out)); + + } + _out = left; + // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too + if ((state.flags ? hold : zswap32(hold)) !== state.check) { + strm.msg = 'incorrect data check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: check matches trailer\n")); + } + state.mode = LENGTH; + /* falls through */ + case LENGTH: + if (state.wrap && state.flags) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (hold !== (state.total & 0xffffffff)) { + strm.msg = 'incorrect length check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: length matches trailer\n")); + } + state.mode = DONE; + /* falls through */ + case DONE: + ret = Z_STREAM_END$1; + break inf_leave; + case BAD: + ret = Z_DATA_ERROR$1; + break inf_leave; + case MEM: + return Z_MEM_ERROR$1; + case SYNC: + /* falls through */ + default: + return Z_STREAM_ERROR$1; + } + } + + // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave" + + /* + Return from inflate(), updating the total counts and the check value. + If there was no progress during the inflate() call, return a buffer + error. Call updatewindow() to create and/or update the window state. + Note: a memory error from inflate() is non-recoverable. + */ + + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + + if (state.wsize || (_out !== strm.avail_out && state.mode < BAD && + (state.mode < CHECK || flush !== Z_FINISH$1))) { + if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ; + } + _in -= strm.avail_in; + _out -= strm.avail_out; + strm.total_in += _in; + strm.total_out += _out; + state.total += _out; + if (state.wrap && _out) { + strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/ + (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out)); + } + strm.data_type = state.bits + (state.last ? 64 : 0) + + (state.mode === TYPE ? 128 : 0) + + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0); + if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) { + ret = Z_BUF_ERROR; + } + return ret; +}; + + +const inflateEnd = (strm) => { + + if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) { + return Z_STREAM_ERROR$1; + } + + let state = strm.state; + if (state.window) { + state.window = null; + } + strm.state = null; + return Z_OK$1; +}; + + +const inflateGetHeader = (strm, head) => { + + /* check state */ + if (!strm || !strm.state) { return Z_STREAM_ERROR$1; } + const state = strm.state; + if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; } + + /* save header structure */ + state.head = head; + head.done = false; + return Z_OK$1; +}; + + +const inflateSetDictionary = (strm, dictionary) => { + const dictLength = dictionary.length; + + let state; + let dictid; + let ret; + + /* check state */ + if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR$1; } + state = strm.state; + + if (state.wrap !== 0 && state.mode !== DICT) { + return Z_STREAM_ERROR$1; + } + + /* check for correct dictionary identifier */ + if (state.mode === DICT) { + dictid = 1; /* adler32(0, null, 0)*/ + /* dictid = adler32(dictid, dictionary, dictLength); */ + dictid = adler32_1(dictid, dictionary, dictLength, 0); + if (dictid !== state.check) { + return Z_DATA_ERROR$1; + } + } + /* copy dictionary to window using updatewindow(), which will amend the + existing dictionary if appropriate */ + ret = updatewindow(strm, dictionary, dictLength, dictLength); + if (ret) { + state.mode = MEM; + return Z_MEM_ERROR$1; + } + state.havedict = 1; + // Tracev((stderr, "inflate: dictionary set\n")); + return Z_OK$1; +}; + + +var inflateReset_1 = inflateReset; +var inflateReset2_1 = inflateReset2; +var inflateResetKeep_1 = inflateResetKeep; +var inflateInit_1 = inflateInit; +var inflateInit2_1 = inflateInit2; +var inflate_2$1 = inflate$2; +var inflateEnd_1 = inflateEnd; +var inflateGetHeader_1 = inflateGetHeader; +var inflateSetDictionary_1 = inflateSetDictionary; +var inflateInfo = 'pako inflate (from Nodeca project)'; + +/* Not implemented +module.exports.inflateCopy = inflateCopy; +module.exports.inflateGetDictionary = inflateGetDictionary; +module.exports.inflateMark = inflateMark; +module.exports.inflatePrime = inflatePrime; +module.exports.inflateSync = inflateSync; +module.exports.inflateSyncPoint = inflateSyncPoint; +module.exports.inflateUndermine = inflateUndermine; +*/ + +var inflate_1$2 = { + inflateReset: inflateReset_1, + inflateReset2: inflateReset2_1, + inflateResetKeep: inflateResetKeep_1, + inflateInit: inflateInit_1, + inflateInit2: inflateInit2_1, + inflate: inflate_2$1, + inflateEnd: inflateEnd_1, + inflateGetHeader: inflateGetHeader_1, + inflateSetDictionary: inflateSetDictionary_1, + inflateInfo: inflateInfo +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +function GZheader() { + /* true if compressed data believed to be text */ + this.text = 0; + /* modification time */ + this.time = 0; + /* extra flags (not used when writing a gzip file) */ + this.xflags = 0; + /* operating system */ + this.os = 0; + /* pointer to extra field or Z_NULL if none */ + this.extra = null; + /* extra field length (valid if extra != Z_NULL) */ + this.extra_len = 0; // Actually, we don't need it in JS, + // but leave for few code modifications + + // + // Setup limits is not necessary because in js we should not preallocate memory + // for inflate use constant limit in 65536 bytes + // + + /* space at extra (only when reading header) */ + // this.extra_max = 0; + /* pointer to zero-terminated file name or Z_NULL */ + this.name = ''; + /* space at name (only when reading header) */ + // this.name_max = 0; + /* pointer to zero-terminated comment or Z_NULL */ + this.comment = ''; + /* space at comment (only when reading header) */ + // this.comm_max = 0; + /* true if there was or will be a header crc */ + this.hcrc = 0; + /* true when done reading gzip header (not used when writing a gzip file) */ + this.done = false; +} + +var gzheader = GZheader; + +const toString = Object.prototype.toString; + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + Z_NO_FLUSH, Z_FINISH, + Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR +} = constants$2; + +/* ===========================================================================*/ + + +/** + * class Inflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[inflate]] + * and [[inflateRaw]]. + **/ + +/* internal + * inflate.chunks -> Array + * + * Chunks of output data, if [[Inflate#onData]] not overridden. + **/ + +/** + * Inflate.result -> Uint8Array|String + * + * Uncompressed result, generated by default [[Inflate#onData]] + * and [[Inflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Inflate#push]] with `Z_FINISH` / `true` param). + **/ + +/** + * Inflate.err -> Number + * + * Error code after inflate finished. 0 (Z_OK) on success. + * Should be checked if broken data possible. + **/ + +/** + * Inflate.msg -> String + * + * Error message, if [[Inflate.err]] != 0 + **/ + + +/** + * new Inflate(options) + * - options (Object): zlib inflate options. + * + * Creates new inflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `windowBits` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw inflate + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * By default, when no options set, autodetect deflate/gzip data format via + * wrapper header. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const inflate = new pako.Inflate({ level: 3}); + * + * inflate.push(chunk1, false); + * inflate.push(chunk2, true); // true -> last chunk + * + * if (inflate.err) { throw new Error(inflate.err); } + * + * console.log(inflate.result); + * ``` + **/ +function Inflate$1(options) { + this.options = common.assign({ + chunkSize: 1024 * 64, + windowBits: 15, + to: '' + }, options || {}); + + const opt = this.options; + + // Force window size for `raw` data, if not set directly, + // because we have no header for autodetect. + if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) { + opt.windowBits = -opt.windowBits; + if (opt.windowBits === 0) { opt.windowBits = -15; } + } + + // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate + if ((opt.windowBits >= 0) && (opt.windowBits < 16) && + !(options && options.windowBits)) { + opt.windowBits += 32; + } + + // Gzip header has no info about windows size, we can do autodetect only + // for deflate. So, if window size not set, force it to max when gzip possible + if ((opt.windowBits > 15) && (opt.windowBits < 48)) { + // bit 3 (16) -> gzipped data + // bit 4 (32) -> autodetect gzip/deflate + if ((opt.windowBits & 15) === 0) { + opt.windowBits |= 15; + } + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + + let status = inflate_1$2.inflateInit2( + this.strm, + opt.windowBits + ); + + if (status !== Z_OK) { + throw new Error(messages[status]); + } + + this.header = new gzheader(); + + inflate_1$2.inflateGetHeader(this.strm, this.header); + + // Setup dictionary + if (opt.dictionary) { + // Convert data if needed + if (typeof opt.dictionary === 'string') { + opt.dictionary = strings.string2buf(opt.dictionary); + } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') { + opt.dictionary = new Uint8Array(opt.dictionary); + } + if (opt.raw) { //In raw mode we need to set the dictionary early + status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary); + if (status !== Z_OK) { + throw new Error(messages[status]); + } + } + } +} + +/** + * Inflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer): input data + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE + * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH, + * `true` means Z_FINISH. + * + * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with + * new output chunks. Returns `true` on success. If end of stream detected, + * [[Inflate#onEnd]] will be called. + * + * `flush_mode` is not needed for normal operation, because end of stream + * detected automatically. You may try to use it for advanced things, but + * this functionality was not tested. + * + * On fail call [[Inflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ +Inflate$1.prototype.push = function (data, flush_mode) { + const strm = this.strm; + const chunkSize = this.options.chunkSize; + const dictionary = this.options.dictionary; + let status, _flush_mode, last_avail_out; + + if (this.ended) return false; + + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode; + else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH; + + // Convert data if needed + if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + status = inflate_1$2.inflate(strm, _flush_mode); + + if (status === Z_NEED_DICT && dictionary) { + status = inflate_1$2.inflateSetDictionary(strm, dictionary); + + if (status === Z_OK) { + status = inflate_1$2.inflate(strm, _flush_mode); + } else if (status === Z_DATA_ERROR) { + // Replace code with more verbose + status = Z_NEED_DICT; + } + } + + // Skip snyc markers if more data follows and not raw mode + while (strm.avail_in > 0 && + status === Z_STREAM_END && + strm.state.wrap > 0 && + data[strm.next_in] !== 0) + { + inflate_1$2.inflateReset(strm); + status = inflate_1$2.inflate(strm, _flush_mode); + } + + switch (status) { + case Z_STREAM_ERROR: + case Z_DATA_ERROR: + case Z_NEED_DICT: + case Z_MEM_ERROR: + this.onEnd(status); + this.ended = true; + return false; + } + + // Remember real `avail_out` value, because we may patch out buffer content + // to align utf8 strings boundaries. + last_avail_out = strm.avail_out; + + if (strm.next_out) { + if (strm.avail_out === 0 || status === Z_STREAM_END) { + + if (this.options.to === 'string') { + + let next_out_utf8 = strings.utf8border(strm.output, strm.next_out); + + let tail = strm.next_out - next_out_utf8; + let utf8str = strings.buf2string(strm.output, next_out_utf8); + + // move tail & realign counters + strm.next_out = tail; + strm.avail_out = chunkSize - tail; + if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0); + + this.onData(utf8str); + + } else { + this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out)); + } + } + } + + // Must repeat iteration if out buffer is full + if (status === Z_OK && last_avail_out === 0) continue; + + // Finalize if end of stream reached. + if (status === Z_STREAM_END) { + status = inflate_1$2.inflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return true; + } + + if (strm.avail_in === 0) break; + } + + return true; +}; + + +/** + * Inflate#onData(chunk) -> Void + * - chunk (Uint8Array|String): output data. When string output requested, + * each chunk will be string. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ +Inflate$1.prototype.onData = function (chunk) { + this.chunks.push(chunk); +}; + + +/** + * Inflate#onEnd(status) -> Void + * - status (Number): inflate status. 0 (Z_OK) on success, + * other if not. + * + * Called either after you tell inflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ +Inflate$1.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK) { + if (this.options.to === 'string') { + this.result = this.chunks.join(''); + } else { + this.result = common.flattenChunks(this.chunks); + } + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; +}; + + +/** + * inflate(data[, options]) -> Uint8Array|String + * - data (Uint8Array): input data to decompress. + * - options (Object): zlib inflate options. + * + * Decompress `data` with inflate/ungzip and `options`. Autodetect + * format via wrapper header by default. That's why we don't provide + * separate `ungzip` method. + * + * Supported options are: + * + * - windowBits + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * + * ##### Example: + * + * ```javascript + * const pako = require('pako'); + * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9])); + * let output; + * + * try { + * output = pako.inflate(input); + * } catch (err) { + * console.log(err); + * } + * ``` + **/ +function inflate$1(input, options) { + const inflator = new Inflate$1(options); + + inflator.push(input); + + // That will never happens, if you don't cheat with options :) + if (inflator.err) throw inflator.msg || messages[inflator.err]; + + return inflator.result; +} + + +/** + * inflateRaw(data[, options]) -> Uint8Array|String + * - data (Uint8Array): input data to decompress. + * - options (Object): zlib inflate options. + * + * The same as [[inflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ +function inflateRaw$1(input, options) { + options = options || {}; + options.raw = true; + return inflate$1(input, options); +} + + +/** + * ungzip(data[, options]) -> Uint8Array|String + * - data (Uint8Array): input data to decompress. + * - options (Object): zlib inflate options. + * + * Just shortcut to [[inflate]], because it autodetects format + * by header.content. Done for convenience. + **/ + + +var Inflate_1$1 = Inflate$1; +var inflate_2 = inflate$1; +var inflateRaw_1$1 = inflateRaw$1; +var ungzip$1 = inflate$1; +var constants = constants$2; + +var inflate_1$1 = { + Inflate: Inflate_1$1, + inflate: inflate_2, + inflateRaw: inflateRaw_1$1, + ungzip: ungzip$1, + constants: constants +}; + +const { Deflate, deflate, deflateRaw, gzip } = deflate_1$1; + +const { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1; + + + +var Deflate_1 = Deflate; +var deflate_1 = deflate; +var deflateRaw_1 = deflateRaw; +var gzip_1 = gzip; +var Inflate_1 = Inflate; +var inflate_1 = inflate; +var inflateRaw_1 = inflateRaw; +var ungzip_1 = ungzip; +var constants_1 = constants$2; + +var pako = { + Deflate: Deflate_1, + deflate: deflate_1, + deflateRaw: deflateRaw_1, + gzip: gzip_1, + Inflate: Inflate_1, + inflate: inflate_1, + inflateRaw: inflateRaw_1, + ungzip: ungzip_1, + constants: constants_1 +}; + + + + +/***/ }), + +/***/ "../node_modules/geotiff/src/compression/basedecoder.js": +/*!**************************************************************!*\ + !*** ../node_modules/geotiff/src/compression/basedecoder.js ***! + \**************************************************************/ +/*! exports provided: default */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return BaseDecoder; }); +/* harmony import */ var _predictor__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../predictor */ "../node_modules/geotiff/src/predictor.js"); + + +class BaseDecoder { + async decode(fileDirectory, buffer) { + const decoded = await this.decodeBlock(buffer); + const predictor = fileDirectory.Predictor || 1; + if (predictor !== 1) { + const isTiled = !fileDirectory.StripOffsets; + const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth; + const tileHeight = isTiled ? fileDirectory.TileLength : ( + fileDirectory.RowsPerStrip || fileDirectory.ImageLength + ); + return Object(_predictor__WEBPACK_IMPORTED_MODULE_0__["applyPredictor"])( + decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample, + fileDirectory.PlanarConfiguration, + ); + } + return decoded; + } +} + + +/***/ }), + +/***/ "../node_modules/geotiff/src/predictor.js": +/*!************************************************!*\ + !*** ../node_modules/geotiff/src/predictor.js ***! + \************************************************/ +/*! exports provided: applyPredictor */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "applyPredictor", function() { return applyPredictor; }); +function decodeRowAcc(row, stride) { + let length = row.length - stride; + let offset = 0; + do { + for (let i = stride; i > 0; i--) { + row[offset + stride] += row[offset]; + offset++; + } + + length -= stride; + } while (length > 0); +} + +function decodeRowFloatingPoint(row, stride, bytesPerSample) { + let index = 0; + let count = row.length; + const wc = count / bytesPerSample; + + while (count > stride) { + for (let i = stride; i > 0; --i) { + row[index + stride] += row[index]; + ++index; + } + count -= stride; + } + + const copy = row.slice(); + for (let i = 0; i < wc; ++i) { + for (let b = 0; b < bytesPerSample; ++b) { + row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i]; + } + } +} + +function applyPredictor(block, predictor, width, height, bitsPerSample, + planarConfiguration) { + if (!predictor || predictor === 1) { + return block; + } + + for (let i = 0; i < bitsPerSample.length; ++i) { + if (bitsPerSample[i] % 8 !== 0) { + throw new Error('When decoding with predictor, only multiple of 8 bits are supported.'); + } + if (bitsPerSample[i] !== bitsPerSample[0]) { + throw new Error('When decoding with predictor, all samples must have the same size.'); + } + } + + const bytesPerSample = bitsPerSample[0] / 8; + const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length; + + for (let i = 0; i < height; ++i) { + // Last strip will be truncated if height % stripHeight != 0 + if (i * stride * width * bytesPerSample >= block.byteLength) { + break; + } + let row; + if (predictor === 2) { // horizontal prediction + switch (bitsPerSample[0]) { + case 8: + row = new Uint8Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample, + ); + break; + case 16: + row = new Uint16Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2, + ); + break; + case 32: + row = new Uint32Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4, + ); + break; + default: + throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`); + } + decodeRowAcc(row, stride, bytesPerSample); + } else if (predictor === 3) { // horizontal floating point + row = new Uint8Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample, + ); + decodeRowFloatingPoint(row, stride, bytesPerSample); + } + } + return block; +} + + +/***/ }) + +}]); +//# sourceMappingURL=0.js.map \ No newline at end of file diff --git a/dist/0.js.map b/dist/0.js.map new file mode 100644 index 0000000..c2d4914 --- /dev/null +++ b/dist/0.js.map @@ -0,0 +1 @@ +{"version":3,"sources":["webpack:///../node_modules/geotiff/node_modules/pako/dist/pako.esm.mjs","webpack:///../node_modules/geotiff/src/compression/basedecoder.js","webpack:///../node_modules/geotiff/src/predictor.js"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,gCAAgC;AAChC;;AAEA;;;AAGA,sBAAsB,sBAAsB,qBAAqB,cAAc,EAAE;;AAEjF;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA,0BAA0B;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;;AAEA,kCAAkC;AAClC,iCAAiC;AACjC,iCAAiC;AACjC,4BAA4B;AAC5B,iCAAiC;;AAEjC;AACA;AACA;;;AAGA;AACA;AACA;;;AAGA;AACA,2BAA2B;AAC3B,oBAAoB;AACpB,6BAA6B;AAC7B;;;;AAIA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,GAAG;AACH;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR,WAAW;AACX,WAAW;AACX,YAAY;AACZ,QAAQ;AACR,mBAAmB;;AAEnB,gBAAgB,oBAAoB;AACpC;AACA;;AAEA;AACA;AACA;AACA,+CAA+C;;AAE/C,0BAA0B,iBAAiB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,uBAAuB,UAAU,EAAE;;AAEnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,QAAQ;;AAE/B;AACA;;AAEA;AACA;AACA;AACA,oCAAoC,QAAQ;AAC5C,uBAAuB;AACvB,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA,yBAAyB,YAAY;AACrC;AACA;AACA;AACA,yBAAyB,UAAU;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB,mBAAmB;AACnB,qBAAqB;AACrB;AACA,8CAA8C;AAC9C,eAAe;AACf,WAAW;AACX,QAAQ;;AAER;AACA;AACA;AACA,gBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,aAAa,gBAAgB;AAC7B;AACA,oBAAoB,UAAU;AAC9B;AACA;;AAEA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA,QAAQ;AACR,WAAW;AACX,aAAa;AACb,WAAW;AACX,WAAW;AACX;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,gBAAgB,2BAA2B;AAC3C;AACA,eAAe,8BAA8B;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,gBAAgB,WAAW;AAC3B;AACA,eAAe,8BAA8B;AAC7C;AACA;AACA;AACA;AACA,aAAa;AACb,QAAQ,kBAAkB;AAC1B;AACA,eAAe,oCAAoC;AACnD;AACA;AACA;AACA;;AAEA;AACA,gBAAgB,oBAAoB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,aAAa,eAAe;AAC5B;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA,QAAQ;;AAER;AACA,aAAa,eAAe,QAAQ,iCAAiC;AACrE,aAAa,eAAe,QAAQ,iCAAiC;AACrE,aAAa,gBAAgB,OAAO,+BAA+B;;AAEnE;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB,eAAe;AACf,kBAAkB;AAClB;AACA,eAAe;;AAEf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB,YAAY;AACZ;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C,OAAO;;AAEtD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B,2BAA2B;AAC3B;AACA,WAAW;AACX,SAAS;AACT,aAAa;AACb,WAAW;AACX,YAAY;;AAEZ;AACA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC;AAChC;AACA,OAAO;AACP;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA,kCAAkC;AAClC;AACA,eAAe;AACf;AACA;;AAEA,kCAAkC;AAClC;AACA;AACA;AACA,oCAAoC;AACpC;AACA,OAAO;;AAEP;AACA;AACA;;AAEA,KAAK;AACL;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,oBAAoB;AACpB,WAAW;;AAEX;AACA;AACA;AACA;AACA;AACA;;AAEA,aAAa,WAAW;AACxB;AACA;AACA;;AAEA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,uCAAuC,QAAQ,OAAO,wBAAwB;;AAE9E;AACA;AACA;AACA,eAAe;AACf;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;;AAEA,8BAA8B;;AAE9B,6BAA6B;AAC7B;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,GAAG;;AAEH;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB,mBAAmB;AACnB;AACA,QAAQ;AACR,mBAAmB;AACnB,aAAa;;AAEb,wCAAwC;;AAExC,gBAAgB;AAChB,oBAAoB;AACpB,oBAAoB;;AAEpB;AACA;AACA;AACA;AACA,gDAAgD;;AAEhD,aAAa,eAAe;AAC5B;AACA;;AAEA;AACA;;AAEA,KAAK;AACL;;AAEA,KAAK;;AAEL,+BAA+B,kCAAkC;AACjE;;AAEA,KAAK;AACL;;AAEA,KAAK;AACL;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA,KAAK;AACL;AACA;;AAEA,KAAK;AACL;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB,mBAAmB;AACnB;AACA,QAAQ;AACR,mBAAmB;AACnB,aAAa;;AAEb,wCAAwC;;AAExC,gBAAgB;AAChB,oBAAoB;AACpB,oBAAoB;;AAEpB,+BAA+B;AAC/B;AACA;AACA;AACA;;AAEA,aAAa,eAAe;AAC5B;AACA;;AAEA;AACA;;AAEA,KAAK;AACL,UAAU,iCAAiC,EAAE;;AAE7C,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,KAAK;AACL;AACA;;AAEA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,KAAK;AACL;AACA;;AAEA,KAAK;AACL;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB;;AAElB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oCAAoC,kBAAkB;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC;AAClC;AACA,WAAW;;AAEX;AACA;AACA;AACA;AACA,gCAAgC;AAChC;AACA,gCAAgC;AAChC,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;;AAEA,wCAAwC;AACxC;;AAEA,wCAAwC;AACxC;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,IAAI,MAAM,GAAG,MAAM,GAAG;AAChD;AACA;AACA;AACA,SAAS,IAAI,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,IAAI;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,aAAa,SAAS;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc,gBAAgB;AAC9B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,iBAAiB;AACjB,WAAW;AACX;AACA,wDAAwD;AACxD,uCAAuC;AACvC;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,iBAAiB;AACjB,WAAW;AACX;AACA,4BAA4B;AAC5B,sBAAsB;;AAEtB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kCAAkC,wBAAwB;;AAE1D,GAAG;AACH;AACA,4CAA4C;AAC5C;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,GAAG;;AAEH;AACA;;AAEA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB,kBAAkB;AAClB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,WAAW;AACX;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,iBAAiB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;;AAGA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iBAAiB,SAAS;AAC1B;AACA,mBAAmB,OAAO;AAC1B;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;;AAEA;;AAEA,mBAAmB,SAAS;AAC5B;AACA;;AAEA,sBAAsB;AACtB;;;AAGA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA,OAAO,oEAAoE;;;;;AAK3E;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;;;AAGA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,4BAA4B;AAC5B,4BAA4B;AAC5B,4BAA4B;AAC5B,4BAA4B;;AAE5B,qBAAqB;;AAErB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,uBAAuB,qBAAqB,cAAc;AAC1D;;;AAGA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,kBAAkB,QAAQ;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,mBAAmB,YAAY;AAC/B,kBAAkB,UAAU;;AAE5B;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wCAAwC;AACxC,wBAAwB;AACxB,YAAY;AACZ,UAAU;AACV,+BAA+B;AAC/B,gCAAgC;AAChC;AACA;;AAEA,wBAAwB;;AAExB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,0BAA0B;;AAE3D;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD;AACxD;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,OAAO;;AAEP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,sDAAsD;AACtD;AACA;AACA;AACA;AACA;AACA,kEAAkE;AAClE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB;AAChB,aAAa;;AAEb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mEAAmE;;AAEnE;AACA,yDAAyD;AACzD;;AAEA;;AAEA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA,uDAAuD;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,OAAO;AACP;AACA;AACA;AACA;AACA,2DAA2D;AAC3D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,0DAA0D;AAC1D;;AAEA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB;AAChB,aAAa;;AAEb;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,OAAO,EAAE;AACvC;;AAEA;AACA;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,wDAAwD;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uDAAuD;AACvD;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;;AAEA;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;;AAEA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,4DAA4D;AAC5D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0DAA0D;AAC1D;;AAEA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;;AAEA,aAAa;AACb,WAAW;AACX,mBAAmB;;AAEnB;;AAEA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,OAAO,EAAE;AACvC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,oEAAoE;AACpE;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,0DAA0D;AAC1D;;AAEA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,aAAa;;AAEb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA,wDAAwD;AACxD;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;;AAEA,qBAAqB;AACrB,eAAe;;AAEf;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA,mBAAmB;AACnB,kBAAkB;AAClB,0BAA0B;AAC1B,4BAA4B;AAC5B,uBAAuB;AACvB,mBAAmB;AACnB,gBAAgB;AAChB,qBAAqB;AACrB,mBAAmB;AACnB,6BAA6B;AAC7B,uBAAuB;;AAEvB,kBAAkB;AAClB,kBAAkB;AAClB,kBAAkB;;AAElB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,mBAAmB;;AAEnB,iBAAiB;AACjB,qBAAqB;AACrB,qBAAqB;AACrB,qBAAqB;;AAErB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,wBAAwB;AACxB,sBAAsB;AACtB,2BAA2B;AAC3B,oBAAoB;AACpB,uBAAuB;AACvB,qBAAqB;;AAErB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,iBAAiB;AACjB,oBAAoB;;AAEpB;AACA;;AAEA,sBAAsB;;AAEtB;;AAEA;;AAEA,2CAA2C;AAC3C,6CAA6C;AAC7C,4CAA4C;;AAE5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;;AAEvB;AACA;AACA;;AAEA,0BAA0B;AAC1B,+CAA+C;AAC/C;;AAEA,oBAAoB;AACpB,oBAAoB;AACpB;AACA;AACA;;AAEA,gDAAgD;AAChD;AACA;AACA;;AAEA,iBAAiB;;AAEjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB;;AAEpB;AACA;AACA;AACA;AACA;;AAEA,mBAAmB;AACnB,sBAAsB;AACtB,mBAAmB;AACnB,kBAAkB;;;AAGlB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA,6BAA6B,yBAAyB;AACtD,8BAA8B,yBAAyB;AACvD;AACA;AACA;;;AAGA;;AAEA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;;AAEA,uBAAuB;AACvB;AACA;AACA;;AAEA;AACA,aAAa;AACb;AACA;;;AAGA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,qBAAqB;;AAErB,sCAAsC;;AAEtC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;;AAGA;;AAEA,eAAe;;AAEf;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB;AAChB;AACA;;AAEA;AACA;;AAEA,uBAAuB;AACvB,qBAAqB;AACrB;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA;AACA;AACA,6BAA6B,uBAAuB;AACpD;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;;AAEA;AACA;AACA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC;;AAErC;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B,uBAAuB;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA,8BAA8B;;AAE9B,6BAA6B,eAAe;AAC5C,oBAAoB,uBAAuB;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,mBAAmB,kBAAkB;AACrC;AACA;AACA;;;AAGA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oDAAoD;AACpD;AACA;;AAEA,aAAa;;AAEb;AACA;AACA,qBAAqB;AACrB,yBAAyB;AACzB,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gEAAgE;AAChE;;AAEA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB,UAAU;;AAE5B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA,oCAAoC,OAAO;AAC3C;AACA;;AAEA;AACA;;AAEA,6CAA6C,OAAO;AACpD;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;;AAGA;AACA;AACA;AACA;AACA;AACA;;AAEA,KAAK,oDAAoD,EAAE,aAAa,0BAA0B;;;AAGlG;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB;AACA;AACA,kCAAkC;;;AAGlC;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,iBAAiB,iBAAiB;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,wBAAwB,aAAa;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;;AAGA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA,sBAAsB,SAAS;AAC/B;AACA;AACA,mBAAmB,qBAAqB,UAAU;;AAElD;AACA;AACA,oBAAoB,0BAA0B,gBAAgB,UAAU;;AAExE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oBAAoB,0BAA0B,UAAU;;AAExD;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yBAAyB,kBAAkB;;AAE3C;AACA;AACA,kDAAkD,OAAO;;AAEzD;AACA;AACA,gBAAgB,YAAY;;AAE5B;AACA;AACA,kBAAkB,YAAY;;AAE9B;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,UAAU;AAC/C;AACA;AACA,8BAA8B;AAC9B;AACA,qBAAqB,8BAA8B;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG,eAAe;;AAElB;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB;AAClB,mBAAmB;AACnB,sBAAsB;AACtB,mBAAmB;;AAEnB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA,mBAAmB,cAAc;;AAEjC;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;;AAEA;AACA;;AAEA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,qBAAqB,8CAA8C;;AAEnE;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB;AACjB,kBAAkB;;AAElB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV,WAAW;AACX,WAAW;AACX,UAAU;AACV,UAAU;AACV;AACA,WAAW;AACX;AACA,YAAY;AACZ,YAAY;AACZ,YAAY;AACZ;AACA,eAAe;AACf,WAAW;AACX,WAAW;AACX,YAAY;AACZ,YAAY;AACZ,YAAY;AACZ,YAAY;AACZ,WAAW;AACX,SAAS;AACT;AACA,UAAU;AACV,WAAW;AACX,WAAW;AACX;;;AAGA,oBAAoB;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,WAAW,GAAG;AACd;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe,GAAG;AAClB;AACA;AACA;AACA;;AAEA,wBAAwB;AACxB;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B,4BAA4B;AAC5B,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA,uBAAuB;AACvB;AACA,gCAAgC;AAChC;AACA,+BAA+B;AAC/B;AACA;AACA;AACA,mBAAmB;AACnB,qCAAqC;AACrC;AACA;AACA;AACA,oCAAoC;AACpC;AACA;AACA,+BAA+B;AAC/B;AACA;AACA;AACA,mBAAmB;AACnB;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA,qBAAqB;AACrB,uCAAuC;AACvC;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA,+BAA+B;AAC/B;AACA;AACA;AACA,mBAAmB;AACnB,qCAAqC;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC;AACjC,kBAAkB;AAClB;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB;AAChB;AACA;AACA,iCAAiC;AACjC;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,YAAY;AACZ;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,yBAAyB;;AAEzB,cAAc;AACd,cAAc;AACd,uBAAuB;AACvB,eAAe;AACf,eAAe;AACf,eAAe;AACf,eAAe;AACf,eAAe;AACf,eAAe;AACf,WAAW;AACX,WAAW;AACX,UAAU;AACV,WAAW;AACX,WAAW;AACX,kBAAkB;AAClB;AACA,iBAAiB;AACjB,UAAU;AACV,6CAA6C,eAAe;AAC5D,4CAA4C,eAAe;AAC3D;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe,gBAAgB;AAC/B;AACA;AACA,eAAe,aAAa;AAC5B;AACA;;AAEA;AACA;AACA,qBAAqB,UAAU;AAC/B,2BAA2B,OAAO;AAClC;AACA;AACA;AACA;AACA,kBAAkB;AAClB,sCAAsC,2BAA2B;AACjE,uCAAuC;AACvC,wCAAwC;AACxC;;;AAGA;AACA;AACA;AACA;;AAEA;AACA,aAAa;AACb;AACA,eAAe,WAAW;AAC1B,2BAA2B,OAAO;AAClC;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe,gBAAgB;AAC/B;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,cAAc;AACd;;AAEA;AACA;AACA,eAAe,eAAe;AAC9B;AACA;;AAEA;AACA,eAAe,aAAa;AAC5B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;;AAEA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA,GAAG,OAAO;AACV;AACA;AACA;AACA;;AAEA;AACA,WAAW;AACX,UAAU;AACV,YAAY;AACZ,qBAAqB;AACrB,cAAc;AACd,WAAW;AACX,WAAW;AACX,mBAAmB;AACnB,kBAAkB;;AAElB;AACA;AACA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;;AAEA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA,wBAAwB,OAAO;AAC/B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB;;AAElB;AACA;AACA;AACA;AACA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,+CAA+C;AAC/C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,iCAAiC;AACjC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;;;;;;AAOA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,CAAC;;;AAGD;AACA;;;AAGA,kBAAkB;AAClB,mBAAmB;AACnB,kBAAkB;AAClB,gBAAgB;AAChB,mBAAmB;AACnB,mBAAmB;AACnB,kBAAkB;AAClB,qBAAqB;AACrB,kBAAkB;AAClB,qBAAqB;AACrB,mBAAmB;AACnB,uBAAuB;AACvB,yBAAyB;AACzB,yBAAyB;AACzB,wBAAwB;AACxB,uBAAuB;AACvB,wBAAwB;AACxB,0BAA0B;AAC1B,2BAA2B;AAC3B,2BAA2B;AAC3B,0BAA0B;AAC1B,6BAA6B;AAC7B,2BAA2B;AAC3B,8BAA8B;AAC9B,4BAA4B;AAC5B,0BAA0B;AAC1B,oBAAoB;AACpB,qBAAqB;AACrB,mBAAmB;AACnB,kBAAkB;AAClB,kBAAkB;AAClB,mBAAmB;;AAEnB;;;;AAIA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;AACA,gBAAgB;AAChB,oBAAoB;AACpB,gBAAgB;AAChB,wBAAwB;AACxB,iBAAiB;AACjB,gBAAgB;AAChB,iBAAiB;AACjB,iBAAiB;AACjB;AACA,mBAAmB;;AAEnB;AACA,iBAAiB;AACjB,iBAAiB;AACjB,iBAAiB;AACjB,iBAAiB;AACjB,qBAAqB;;AAErB;AACA,gBAAgB;AAChB,gBAAgB;;AAEhB;AACA,kBAAkB;AAClB,kBAAkB;;AAElB;AACA,iBAAiB;;AAEjB;AACA,sBAAsB;AACtB,uBAAuB;AACvB,mBAAmB;AACnB,oBAAoB;;AAEpB;AACA,iBAAiB;AACjB,gBAAgB;AAChB,iBAAiB;AACjB,gBAAgB;AAChB,mBAAmB;;AAEnB,mCAAmC;AACnC,mCAAmC;;AAEnC;AACA;AACA;AACA;AACA,wCAAwC;AACxC,qBAAqB;AACrB,sBAAsB;AACtB,gBAAgB;AAChB,gBAAgB;AAChB,eAAe;AACf;;;AAGA;;AAEA,6BAA6B,yBAAyB;AACtD;AACA;AACA,gBAAgB;AAChB,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA,6BAA6B,yBAAyB;AACtD;AACA;AACA;AACA;AACA;;AAEA;;;AAGA;AACA;;AAEA;AACA,6BAA6B,yBAAyB;AACtD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA,cAAc,yBAAyB;AACvC,sBAAsB;;AAEtB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB;;;AAGpB;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,uBAAuB,uBAAuB;AAC9C,uBAAuB,uBAAuB;AAC9C,uBAAuB,uBAAuB;AAC9C,uBAAuB,uBAAuB;;AAE9C,kEAAkE,UAAU;;AAE5E;AACA;AACA,sBAAsB,uBAAuB;;AAE7C,kEAAkE,UAAU;;AAE5E;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wCAAwC,iBAAiB;AACzD,sCAAsC,qBAAqB;AAC3D;AACA;AACA;AACA;;;AAGA;;AAEA;AACA,oBAAoB;AACpB,WAAW;AACX,UAAU;AACV,iBAAiB;AACjB,WAAW;AACX,WAAW;AACX,gBAAgB;AAChB,WAAW;AACX,WAAW;AACX;AACA,eAAe;AACf,mCAAmC;AACnC,aAAa;AACb,mCAAmC;AACnC,UAAU;AACV,UAAU;AACV,iCAAiC;AACjC;;AAEA,QAAQ;;AAER;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA,4BAA4B,qBAAqB,EAAE;;;AAGnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA,kDAAkD;AAClD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA,6BAA6B,iBAAiB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,aAAa;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,iBAAiB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;;AAEX;AACA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA,6BAA6B,iBAAiB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,iBAAiB;AACtE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,iBAAiB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,aAAa;AACzC,4BAA4B,aAAa;AACzC,2BAA2B,iBAAiB;AAC5C,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,iBAAiB;AAC9C;AACA;AACA;AACA;AACA;AACA,0DAA0D;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,oEAAoE;AACpE;AACA;AACA;;AAEA,sCAAsC,OAAO;AAC7C;AACA,6BAA6B,iBAAiB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,iBAAiB;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAuC;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,iBAAiB;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAuC;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,iBAAiB;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wCAAwC;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iCAAiC,OAAO;;AAExC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,iBAAiB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf,kEAAkE;AAClE;AACA;AACA;;AAEA,kCAAkC,OAAO;AACzC;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;;AAEA,kDAAkD,OAAO;AACzD;AACA,6BAA6B,iBAAiB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,iBAAiB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf,oEAAoE;AACpE;AACA;AACA;;AAEA,oCAAoC,OAAO;AAC3C;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;;AAEA,kDAAkD,OAAO;AACzD;AACA,6BAA6B,iBAAiB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,iBAAiB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,iBAAiB;AAC1C;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC,qBAAqB;AAC3D,8BAA8B,aAAa;AAC3C;AACA;AACA;AACA;AACA,aAAa;AACb,qCAAqC,kBAAkB;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,qBAAqB;AACzD;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA,0BAA0B,aAAa;AACvC;AACA;AACA;AACA;AACA,SAAS;AACT,iCAAiC,kBAAkB;AACnD;AACA;AACA,yBAAyB,iBAAiB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,iBAAiB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD;AACxD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,iBAAiB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iFAAiF;AACjF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA;AACA,6BAA6B,yBAAyB;AACtD;AACA,+BAA+B,yBAAyB;;AAExD;AACA;AACA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,6DAA6D,yBAAyB;AACtF;;AAEA;AACA;AACA;;AAEA;AACA;AACA,eAAe;AACf,wDAAwD;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,CAAC;;AAED;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,UAAU;AAC/C;AACA;AACA,8BAA8B;AAC9B;AACA,qBAAqB,8BAA8B;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG,eAAe;;AAElB;;AAEA;AACA;AACA;AACA;AACA,+BAA+B,sBAAsB;AACrD;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB;AAClB,mBAAmB;AACnB,sBAAsB;AACtB,mBAAmB;;AAEnB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;;AAEA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,OAAO,qCAAqC;;AAE5C,OAAO,uCAAuC;;;;AAI9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEyO;;;;;;;;;;;;;ACnjNzO;AAAA;AAAA;AAA8C;;AAE/B;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,iEAAc;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACnBA;AAAA;AAAA;AACA;AACA;AACA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;;AAEA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,QAAQ;AACzB,mBAAmB,oBAAoB;AACvC;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;;AAEA,iBAAiB,0BAA0B;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,iBAAiB,YAAY;AAC7B;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0DAA0D,iBAAiB;AAC3E;AACA;AACA,KAAK,4BAA4B;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"0.js","sourcesContent":["\n/*! pako 2.0.4 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 = i*2, Len = i*2+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 // Trace((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 // Trace((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 next_code[bits] = code = (code + bl_count[bits - 1]) << 1;\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< {\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.last_lit = 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 * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nconst copy_block = (s, buf, len, header) =>\n//DeflateState *s;\n//charf *buf; /* the input data */\n//unsigned len; /* its length */\n//int header; /* true if block header must be written */\n{\n bi_windup(s); /* align on byte boundary */\n\n if (header) {\n put_short(s, len);\n put_short(s, ~len);\n }\n// while (len--) {\n// put_byte(s, *buf++);\n// }\n s.pending_buf.set(s.window.subarray(buf, buf + len), s.pending);\n s.pending += len;\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 lx = 0; /* running index in l_buf */\n let code; /* the code to send */\n let extra; /* number of extra bits to send */\n\n if (s.last_lit !== 0) {\n do {\n dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);\n lc = s.pending_buf[s.l_buf + lx];\n lx++;\n\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 d_buf+l_buf is ok: */\n //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n // \"pendingBuf overflow\");\n\n } while (lx < s.last_lit);\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[2*n] and heap[2*n+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 * \"black list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"white 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 /* black_mask is the bit mask of black-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n */\n let black_mask = 0xf3ffc07f;\n let n;\n\n /* Check for non-textual (\"black-listed\") bytes. */\n for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"white-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 \"black-listed\" or \"white-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 copy_block(s, buf, stored_len, true); /* with header */\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 output the encoded block to the zip file.\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->last_lit));\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-7*last));\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 //let out_length, in_length, dcode;\n\n s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;\n s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n s.last_lit++;\n\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// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n// /* Try to guess if it is profitable to stop the current block here */\n// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n// /* Compute an upper bound for the compressed length */\n// out_length = s.last_lit*8;\n// in_length = s.strstart - s.block_start;\n//\n// for (dcode = 0; dcode < D_CODES; dcode++) {\n// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n// }\n// out_length >>>= 3;\n// //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n// // s->last_lit, in_length, out_length,\n// // 100L - out_length*100L/in_length));\n// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n// return true;\n// }\n// }\n//#endif\n\n return (s.last_lit === s.lit_bufsize - 1);\n /* We avoid equality with lit_bufsize because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\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;\nconst EXTRA_STATE = 69;\nconst NAME_STATE = 73;\nconst COMMENT_STATE = 91;\nconst HCRC_STATE = 103;\nconst BUSY_STATE = 113;\nconst FINISH_STATE = 666;\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) << 1) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\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 * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (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 p, n, m, 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), 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\n /* Slide the hash table (could be avoided with 32 bit values\n at the expense of memory usage). We slide even when level == 0\n to keep the hash table consistent if we switch back to level > 0\n later. (Using level 0 permanently is not an optimal usage of\n zlib, so we don't care about this pathological case.)\n */\n\n n = s.hash_size;\n p = n;\n\n do {\n m = s.head[--p];\n s.head[p] = (m >= _w_size ? m - _w_size : 0);\n } while (--n);\n\n n = _w_size;\n p = n;\n\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= _w_size ? m - _w_size : 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\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 - 2*WSIZE + 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 == 2*WSIZE 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 * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nconst deflate_stored = (s, flush) => {\n\n /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n * to pending_buf_size, and each stored block has a 5 byte header:\n */\n let max_block_size = 0xffff;\n\n if (max_block_size > s.pending_buf_size - 5) {\n max_block_size = s.pending_buf_size - 5;\n }\n\n /* Copy as much as possible from input to output: */\n for (;;) {\n /* Fill the window as much as possible: */\n if (s.lookahead <= 1) {\n\n //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n // s->block_start >= (long)s->w_size, \"slide too late\");\n// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n// s.block_start >= s.w_size)) {\n// throw new Error(\"slide too late\");\n// }\n\n fill_window(s);\n if (s.lookahead === 0 && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n\n if (s.lookahead === 0) {\n break;\n }\n /* flush the current block */\n }\n //Assert(s->block_start >= 0L, \"block gone\");\n// if (s.block_start < 0) throw new Error(\"block gone\");\n\n s.strstart += s.lookahead;\n s.lookahead = 0;\n\n /* Emit a stored block if pending_buf will be full: */\n const max_start = s.block_start + max_block_size;\n\n if (s.strstart === 0 || s.strstart >= max_start) {\n /* strstart == 0 is possible when wraparound on 16-bit machine */\n s.lookahead = s.strstart - max_start;\n s.strstart = max_start;\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 }\n /* Flush if we may have to slide, otherwise block_start may become\n * negative and the data will be gone:\n */\n if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\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\n s.insert = 0;\n\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\n if (s.strstart > s.block_start) {\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_NEED_MORE;\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.last_lit) {\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.last_lit) {\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.last_lit) {\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.last_lit) {\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: 2*wSize, 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[2*D_CODES+1]; /* distance tree */\n // struct ct_data_s bl_tree[2*BL_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[2*L_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[2*n] and heap[2*n+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[2*L_CODES+1];\n zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.l_buf = 0; /* buffer index for literals or 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.last_lit = 0; /* running index in l_buf */\n\n this.d_buf = 0;\n /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n * the same number of elements. To use different lengths, an extra flag\n * array would be necessary.\n */\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\nconst deflateResetKeep = (strm) => {\n\n if (!strm || !strm.state) {\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 = (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 = Z_NO_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 (!strm || !strm.state) { return Z_STREAM_ERROR$2; }\n if (strm.state.wrap !== 2) { return Z_STREAM_ERROR$2; }\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) {\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\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 s.pending_buf_size = s.lit_bufsize * 4;\n\n //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n //s->pending_buf = (uchf *) overlay;\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->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n s.d_buf = 1 * s.lit_bufsize;\n\n //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n s.l_buf = (1 + 2) * s.lit_bufsize;\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\nconst deflate$2 = (strm, flush) => {\n\n let beg, val; // for gzip header write only\n\n if (!strm || !strm.state ||\n 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.input && strm.avail_in !== 0) ||\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 s.strm = strm; /* just in case */\n const old_flush = s.last_flush;\n s.last_flush = flush;\n\n /* Write the header */\n if (s.status === INIT_STATE) {\n\n if (s.wrap === 2) { // 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 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 else // DEFLATE header\n {\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 s.status = BUSY_STATE;\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 }\n }\n\n//#ifdef GZIP\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n\n while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n break;\n }\n }\n put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n s.gzindex++;\n }\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (s.gzindex === s.gzhead.extra.length) {\n s.gzindex = 0;\n s.status = NAME_STATE;\n }\n }\n else {\n s.status = NAME_STATE;\n }\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\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\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.gzindex = 0;\n s.status = COMMENT_STATE;\n }\n }\n else {\n s.status = COMMENT_STATE;\n }\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\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\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.status = HCRC_STATE;\n }\n }\n else {\n s.status = HCRC_STATE;\n }\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 }\n if (s.pending + 2 <= s.pending_buf_size) {\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 s.status = BUSY_STATE;\n }\n }\n else {\n s.status = BUSY_STATE;\n }\n }\n//#endif\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 /* 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.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 //Assert(strm->avail_out > 0, \"bug2\");\n //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\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 (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR$2;\n }\n\n const status = strm.state.status;\n if (status !== INIT_STATE &&\n status !== EXTRA_STATE &&\n status !== NAME_STATE &&\n status !== COMMENT_STATE &&\n status !== HCRC_STATE &&\n status !== BUSY_STATE &&\n status !== FINISH_STATE\n ) {\n return err(strm, Z_STREAM_ERROR$2);\n }\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 (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\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.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|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|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|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 = 30; /* got a data error -- remain here until reset */\nconst TYPE$1 = 12; /* 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 base_index = 0;\n// let shoextra; /* extra bits table to use */\n let end; /* use base and extra for symbol > end */\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 let extra_index = 0;\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 end = 19;\n\n } else if (type === LENS$1) {\n base = lbase;\n base_index -= 257;\n extra = lext;\n extra_index -= 257;\n end = 256;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n end = -1;\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] < end) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] > end) {\n here_op = extra[extra_index + work[sym]];\n here_val = base[base_index + work[sym]];\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 = 1; /* i: waiting for magic header */\nconst FLAGS = 2; /* i: waiting for method and flags (gzip) */\nconst TIME = 3; /* i: waiting for modification time (gzip) */\nconst OS = 4; /* i: waiting for extra flags and operating system (gzip) */\nconst EXLEN = 5; /* i: waiting for extra length (gzip) */\nconst EXTRA = 6; /* i: waiting for extra bytes (gzip) */\nconst NAME = 7; /* i: waiting for end of file name (gzip) */\nconst COMMENT = 8; /* i: waiting for end of comment (gzip) */\nconst HCRC = 9; /* i: waiting for header crc (gzip) */\nconst DICTID = 10; /* i: waiting for dictionary check value */\nconst DICT = 11; /* waiting for inflateSetDictionary() call */\nconst TYPE = 12; /* i: waiting for type bits, including last-flag bit */\nconst TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */\nconst STORED = 14; /* i: waiting for stored size (length and complement) */\nconst COPY_ = 15; /* i/o: same as COPY below, but only first time in */\nconst COPY = 16; /* i/o: waiting for input or output to copy stored block */\nconst TABLE = 17; /* i: waiting for dynamic block table lengths */\nconst LENLENS = 18; /* i: waiting for code length code lengths */\nconst CODELENS = 19; /* i: waiting for length/lit and distance code lengths */\nconst LEN_ = 20; /* i: same as LEN below, but only first time in */\nconst LEN = 21; /* i: waiting for length/lit/eob code */\nconst LENEXT = 22; /* i: waiting for length extra bits */\nconst DIST = 23; /* i: waiting for distance code */\nconst DISTEXT = 24; /* i: waiting for distance extra bits */\nconst MATCH = 25; /* o: waiting for output space to copy string */\nconst LIT = 26; /* o: waiting for output space to write literal */\nconst CHECK = 27; /* i: waiting for 32-bit check value */\nconst LENGTH = 28; /* i: waiting for 32-bit length (gzip) */\nconst DONE = 29; /* finished check, done -- remain here until reset */\nconst BAD = 30; /* got a data error -- remain here until reset */\nconst MEM = 31; /* got an inflate() memory error -- remain here until reset */\nconst SYNC = 32; /* 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.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 this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib) */\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 inflateResetKeep = (strm) => {\n\n if (!strm || !strm.state) { 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.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 (!strm || !strm.state) { 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 (!strm || !strm.state) { 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) + 1;\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.window = null/*Z_NULL*/;\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 (!strm || !strm.state || !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 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 state.flags = 0; /* expect zlib header */\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 else if (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 //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) {\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) {\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) {\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) {\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) {\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) {\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) {\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 (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 (_out) {\n strm.adler = state.check =\n /*UPDATE(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.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 (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 && _out) {\n strm.adler = state.check = /*UPDATE(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 (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\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 (!strm || !strm.state) { 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 (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { 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.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;\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): 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): 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): 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","import { applyPredictor } from '../predictor';\n\nexport default class BaseDecoder {\n async decode(fileDirectory, buffer) {\n const decoded = await this.decodeBlock(buffer);\n const predictor = fileDirectory.Predictor || 1;\n if (predictor !== 1) {\n const isTiled = !fileDirectory.StripOffsets;\n const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth;\n const tileHeight = isTiled ? fileDirectory.TileLength : (\n fileDirectory.RowsPerStrip || fileDirectory.ImageLength\n );\n return applyPredictor(\n decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample,\n fileDirectory.PlanarConfiguration,\n );\n }\n return decoded;\n }\n}\n","function decodeRowAcc(row, stride) {\n let length = row.length - stride;\n let offset = 0;\n do {\n for (let i = stride; i > 0; i--) {\n row[offset + stride] += row[offset];\n offset++;\n }\n\n length -= stride;\n } while (length > 0);\n}\n\nfunction decodeRowFloatingPoint(row, stride, bytesPerSample) {\n let index = 0;\n let count = row.length;\n const wc = count / bytesPerSample;\n\n while (count > stride) {\n for (let i = stride; i > 0; --i) {\n row[index + stride] += row[index];\n ++index;\n }\n count -= stride;\n }\n\n const copy = row.slice();\n for (let i = 0; i < wc; ++i) {\n for (let b = 0; b < bytesPerSample; ++b) {\n row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i];\n }\n }\n}\n\nexport function applyPredictor(block, predictor, width, height, bitsPerSample,\n planarConfiguration) {\n if (!predictor || predictor === 1) {\n return block;\n }\n\n for (let i = 0; i < bitsPerSample.length; ++i) {\n if (bitsPerSample[i] % 8 !== 0) {\n throw new Error('When decoding with predictor, only multiple of 8 bits are supported.');\n }\n if (bitsPerSample[i] !== bitsPerSample[0]) {\n throw new Error('When decoding with predictor, all samples must have the same size.');\n }\n }\n\n const bytesPerSample = bitsPerSample[0] / 8;\n const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length;\n\n for (let i = 0; i < height; ++i) {\n // Last strip will be truncated if height % stripHeight != 0\n if (i * stride * width * bytesPerSample >= block.byteLength) {\n break;\n }\n let row;\n if (predictor === 2) { // horizontal prediction\n switch (bitsPerSample[0]) {\n case 8:\n row = new Uint8Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\n );\n break;\n case 16:\n row = new Uint16Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2,\n );\n break;\n case 32:\n row = new Uint32Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4,\n );\n break;\n default:\n throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`);\n }\n decodeRowAcc(row, stride, bytesPerSample);\n } else if (predictor === 3) { // horizontal floating point\n row = new Uint8Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\n );\n decodeRowFloatingPoint(row, stride, bytesPerSample);\n }\n }\n return block;\n}\n"],"sourceRoot":""} \ No newline at end of file diff --git a/dist/1.js b/dist/1.js new file mode 100644 index 0000000..ea7800d --- /dev/null +++ b/dist/1.js @@ -0,0 +1,1053 @@ +(window["webpackJsonp"] = window["webpackJsonp"] || []).push([[1],{ + +/***/ "../node_modules/geotiff/src/compression/basedecoder.js": +/*!**************************************************************!*\ + !*** ../node_modules/geotiff/src/compression/basedecoder.js ***! + \**************************************************************/ +/*! exports provided: default */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return BaseDecoder; }); +/* harmony import */ var _predictor__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../predictor */ "../node_modules/geotiff/src/predictor.js"); + + +class BaseDecoder { + async decode(fileDirectory, buffer) { + const decoded = await this.decodeBlock(buffer); + const predictor = fileDirectory.Predictor || 1; + if (predictor !== 1) { + const isTiled = !fileDirectory.StripOffsets; + const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth; + const tileHeight = isTiled ? fileDirectory.TileLength : ( + fileDirectory.RowsPerStrip || fileDirectory.ImageLength + ); + return Object(_predictor__WEBPACK_IMPORTED_MODULE_0__["applyPredictor"])( + decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample, + fileDirectory.PlanarConfiguration, + ); + } + return decoded; + } +} + + +/***/ }), + +/***/ "../node_modules/geotiff/src/compression/jpeg.js": +/*!*******************************************************!*\ + !*** ../node_modules/geotiff/src/compression/jpeg.js ***! + \*******************************************************/ +/*! exports provided: default */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return JpegDecoder; }); +/* harmony import */ var _basedecoder__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./basedecoder */ "../node_modules/geotiff/src/compression/basedecoder.js"); + + +/* -*- tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- / +/* vim: set shiftwidth=2 tabstop=2 autoindent cindent expandtab: */ +/* + Copyright 2011 notmasteryet + Licensed under the Apache License, Version 2.0 (the "License"); + you may not use this file except in compliance with the License. + You may obtain a copy of the License at + http://www.apache.org/licenses/LICENSE-2.0 + Unless required by applicable law or agreed to in writing, software + distributed under the License is distributed on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + See the License for the specific language governing permissions and + limitations under the License. +*/ + +// - The JPEG specification can be found in the ITU CCITT Recommendation T.81 +// (www.w3.org/Graphics/JPEG/itu-t81.pdf) +// - The JFIF specification can be found in the JPEG File Interchange Format +// (www.w3.org/Graphics/JPEG/jfif3.pdf) +// - The Adobe Application-Specific JPEG markers in the Supporting the DCT Filters +// in PostScript Level 2, Technical Note #5116 +// (partners.adobe.com/public/developer/en/ps/sdk/5116.DCT_Filter.pdf) + +const dctZigZag = new Int32Array([ + 0, + 1, 8, + 16, 9, 2, + 3, 10, 17, 24, + 32, 25, 18, 11, 4, + 5, 12, 19, 26, 33, 40, + 48, 41, 34, 27, 20, 13, 6, + 7, 14, 21, 28, 35, 42, 49, 56, + 57, 50, 43, 36, 29, 22, 15, + 23, 30, 37, 44, 51, 58, + 59, 52, 45, 38, 31, + 39, 46, 53, 60, + 61, 54, 47, + 55, 62, + 63, +]); + +const dctCos1 = 4017; // cos(pi/16) +const dctSin1 = 799; // sin(pi/16) +const dctCos3 = 3406; // cos(3*pi/16) +const dctSin3 = 2276; // sin(3*pi/16) +const dctCos6 = 1567; // cos(6*pi/16) +const dctSin6 = 3784; // sin(6*pi/16) +const dctSqrt2 = 5793; // sqrt(2) +const dctSqrt1d2 = 2896;// sqrt(2) / 2 + +function buildHuffmanTable(codeLengths, values) { + let k = 0; + const code = []; + let length = 16; + while (length > 0 && !codeLengths[length - 1]) { + --length; + } + code.push({ children: [], index: 0 }); + + let p = code[0]; + let q; + for (let i = 0; i < length; i++) { + for (let j = 0; j < codeLengths[i]; j++) { + p = code.pop(); + p.children[p.index] = values[k]; + while (p.index > 0) { + p = code.pop(); + } + p.index++; + code.push(p); + while (code.length <= i) { + code.push(q = { children: [], index: 0 }); + p.children[p.index] = q.children; + p = q; + } + k++; + } + if (i + 1 < length) { + // p here points to last code + code.push(q = { children: [], index: 0 }); + p.children[p.index] = q.children; + p = q; + } + } + return code[0].children; +} + +function decodeScan(data, initialOffset, + frame, components, resetInterval, + spectralStart, spectralEnd, + successivePrev, successive) { + const { mcusPerLine, progressive } = frame; + + const startOffset = initialOffset; + let offset = initialOffset; + let bitsData = 0; + let bitsCount = 0; + function readBit() { + if (bitsCount > 0) { + bitsCount--; + return (bitsData >> bitsCount) & 1; + } + bitsData = data[offset++]; + if (bitsData === 0xFF) { + const nextByte = data[offset++]; + if (nextByte) { + throw new Error(`unexpected marker: ${((bitsData << 8) | nextByte).toString(16)}`); + } + // unstuff 0 + } + bitsCount = 7; + return bitsData >>> 7; + } + function decodeHuffman(tree) { + let node = tree; + let bit; + while ((bit = readBit()) !== null) { // eslint-disable-line no-cond-assign + node = node[bit]; + if (typeof node === 'number') { + return node; + } + if (typeof node !== 'object') { + throw new Error('invalid huffman sequence'); + } + } + return null; + } + function receive(initialLength) { + let length = initialLength; + let n = 0; + while (length > 0) { + const bit = readBit(); + if (bit === null) { + return undefined; + } + n = (n << 1) | bit; + --length; + } + return n; + } + function receiveAndExtend(length) { + const n = receive(length); + if (n >= 1 << (length - 1)) { + return n; + } + return n + (-1 << length) + 1; + } + function decodeBaseline(component, zz) { + const t = decodeHuffman(component.huffmanTableDC); + const diff = t === 0 ? 0 : receiveAndExtend(t); + component.pred += diff; + zz[0] = component.pred; + let k = 1; + while (k < 64) { + const rs = decodeHuffman(component.huffmanTableAC); + const s = rs & 15; + const r = rs >> 4; + if (s === 0) { + if (r < 15) { + break; + } + k += 16; + } else { + k += r; + const z = dctZigZag[k]; + zz[z] = receiveAndExtend(s); + k++; + } + } + } + function decodeDCFirst(component, zz) { + const t = decodeHuffman(component.huffmanTableDC); + const diff = t === 0 ? 0 : (receiveAndExtend(t) << successive); + component.pred += diff; + zz[0] = component.pred; + } + function decodeDCSuccessive(component, zz) { + zz[0] |= readBit() << successive; + } + let eobrun = 0; + function decodeACFirst(component, zz) { + if (eobrun > 0) { + eobrun--; + return; + } + let k = spectralStart; + const e = spectralEnd; + while (k <= e) { + const rs = decodeHuffman(component.huffmanTableAC); + const s = rs & 15; + const r = rs >> 4; + if (s === 0) { + if (r < 15) { + eobrun = receive(r) + (1 << r) - 1; + break; + } + k += 16; + } else { + k += r; + const z = dctZigZag[k]; + zz[z] = receiveAndExtend(s) * (1 << successive); + k++; + } + } + } + let successiveACState = 0; + let successiveACNextValue; + function decodeACSuccessive(component, zz) { + let k = spectralStart; + const e = spectralEnd; + let r = 0; + while (k <= e) { + const z = dctZigZag[k]; + const direction = zz[z] < 0 ? -1 : 1; + switch (successiveACState) { + case 0: { // initial state + const rs = decodeHuffman(component.huffmanTableAC); + const s = rs & 15; + r = rs >> 4; + if (s === 0) { + if (r < 15) { + eobrun = receive(r) + (1 << r); + successiveACState = 4; + } else { + r = 16; + successiveACState = 1; + } + } else { + if (s !== 1) { + throw new Error('invalid ACn encoding'); + } + successiveACNextValue = receiveAndExtend(s); + successiveACState = r ? 2 : 3; + } + continue; // eslint-disable-line no-continue + } + case 1: // skipping r zero items + case 2: + if (zz[z]) { + zz[z] += (readBit() << successive) * direction; + } else { + r--; + if (r === 0) { + successiveACState = successiveACState === 2 ? 3 : 0; + } + } + break; + case 3: // set value for a zero item + if (zz[z]) { + zz[z] += (readBit() << successive) * direction; + } else { + zz[z] = successiveACNextValue << successive; + successiveACState = 0; + } + break; + case 4: // eob + if (zz[z]) { + zz[z] += (readBit() << successive) * direction; + } + break; + default: + break; + } + k++; + } + if (successiveACState === 4) { + eobrun--; + if (eobrun === 0) { + successiveACState = 0; + } + } + } + function decodeMcu(component, decodeFunction, mcu, row, col) { + const mcuRow = (mcu / mcusPerLine) | 0; + const mcuCol = mcu % mcusPerLine; + const blockRow = (mcuRow * component.v) + row; + const blockCol = (mcuCol * component.h) + col; + decodeFunction(component, component.blocks[blockRow][blockCol]); + } + function decodeBlock(component, decodeFunction, mcu) { + const blockRow = (mcu / component.blocksPerLine) | 0; + const blockCol = mcu % component.blocksPerLine; + decodeFunction(component, component.blocks[blockRow][blockCol]); + } + + const componentsLength = components.length; + let component; + let i; + let j; + let k; + let n; + let decodeFn; + if (progressive) { + if (spectralStart === 0) { + decodeFn = successivePrev === 0 ? decodeDCFirst : decodeDCSuccessive; + } else { + decodeFn = successivePrev === 0 ? decodeACFirst : decodeACSuccessive; + } + } else { + decodeFn = decodeBaseline; + } + + let mcu = 0; + let marker; + let mcuExpected; + if (componentsLength === 1) { + mcuExpected = components[0].blocksPerLine * components[0].blocksPerColumn; + } else { + mcuExpected = mcusPerLine * frame.mcusPerColumn; + } + + const usedResetInterval = resetInterval || mcuExpected; + + while (mcu < mcuExpected) { + // reset interval stuff + for (i = 0; i < componentsLength; i++) { + components[i].pred = 0; + } + eobrun = 0; + + if (componentsLength === 1) { + component = components[0]; + for (n = 0; n < usedResetInterval; n++) { + decodeBlock(component, decodeFn, mcu); + mcu++; + } + } else { + for (n = 0; n < usedResetInterval; n++) { + for (i = 0; i < componentsLength; i++) { + component = components[i]; + const { h, v } = component; + for (j = 0; j < v; j++) { + for (k = 0; k < h; k++) { + decodeMcu(component, decodeFn, mcu, j, k); + } + } + } + mcu++; + + // If we've reached our expected MCU's, stop decoding + if (mcu === mcuExpected) { + break; + } + } + } + + // find marker + bitsCount = 0; + marker = (data[offset] << 8) | data[offset + 1]; + if (marker < 0xFF00) { + throw new Error('marker was not found'); + } + + if (marker >= 0xFFD0 && marker <= 0xFFD7) { // RSTx + offset += 2; + } else { + break; + } + } + + return offset - startOffset; +} + +function buildComponentData(frame, component) { + const lines = []; + const { blocksPerLine, blocksPerColumn } = component; + const samplesPerLine = blocksPerLine << 3; + const R = new Int32Array(64); + const r = new Uint8Array(64); + + // A port of poppler's IDCT method which in turn is taken from: + // Christoph Loeffler, Adriaan Ligtenberg, George S. Moschytz, + // "Practical Fast 1-D DCT Algorithms with 11 Multiplications", + // IEEE Intl. Conf. on Acoustics, Speech & Signal Processing, 1989, + // 988-991. + function quantizeAndInverse(zz, dataOut, dataIn) { + const qt = component.quantizationTable; + let v0; + let v1; + let v2; + let v3; + let v4; + let v5; + let v6; + let v7; + let t; + const p = dataIn; + let i; + + // dequant + for (i = 0; i < 64; i++) { + p[i] = zz[i] * qt[i]; + } + + // inverse DCT on rows + for (i = 0; i < 8; ++i) { + const row = 8 * i; + + // check for all-zero AC coefficients + if (p[1 + row] === 0 && p[2 + row] === 0 && p[3 + row] === 0 + && p[4 + row] === 0 && p[5 + row] === 0 && p[6 + row] === 0 + && p[7 + row] === 0) { + t = ((dctSqrt2 * p[0 + row]) + 512) >> 10; + p[0 + row] = t; + p[1 + row] = t; + p[2 + row] = t; + p[3 + row] = t; + p[4 + row] = t; + p[5 + row] = t; + p[6 + row] = t; + p[7 + row] = t; + continue; // eslint-disable-line no-continue + } + + // stage 4 + v0 = ((dctSqrt2 * p[0 + row]) + 128) >> 8; + v1 = ((dctSqrt2 * p[4 + row]) + 128) >> 8; + v2 = p[2 + row]; + v3 = p[6 + row]; + v4 = ((dctSqrt1d2 * (p[1 + row] - p[7 + row])) + 128) >> 8; + v7 = ((dctSqrt1d2 * (p[1 + row] + p[7 + row])) + 128) >> 8; + v5 = p[3 + row] << 4; + v6 = p[5 + row] << 4; + + // stage 3 + t = (v0 - v1 + 1) >> 1; + v0 = (v0 + v1 + 1) >> 1; + v1 = t; + t = ((v2 * dctSin6) + (v3 * dctCos6) + 128) >> 8; + v2 = ((v2 * dctCos6) - (v3 * dctSin6) + 128) >> 8; + v3 = t; + t = (v4 - v6 + 1) >> 1; + v4 = (v4 + v6 + 1) >> 1; + v6 = t; + t = (v7 + v5 + 1) >> 1; + v5 = (v7 - v5 + 1) >> 1; + v7 = t; + + // stage 2 + t = (v0 - v3 + 1) >> 1; + v0 = (v0 + v3 + 1) >> 1; + v3 = t; + t = (v1 - v2 + 1) >> 1; + v1 = (v1 + v2 + 1) >> 1; + v2 = t; + t = ((v4 * dctSin3) + (v7 * dctCos3) + 2048) >> 12; + v4 = ((v4 * dctCos3) - (v7 * dctSin3) + 2048) >> 12; + v7 = t; + t = ((v5 * dctSin1) + (v6 * dctCos1) + 2048) >> 12; + v5 = ((v5 * dctCos1) - (v6 * dctSin1) + 2048) >> 12; + v6 = t; + + // stage 1 + p[0 + row] = v0 + v7; + p[7 + row] = v0 - v7; + p[1 + row] = v1 + v6; + p[6 + row] = v1 - v6; + p[2 + row] = v2 + v5; + p[5 + row] = v2 - v5; + p[3 + row] = v3 + v4; + p[4 + row] = v3 - v4; + } + + // inverse DCT on columns + for (i = 0; i < 8; ++i) { + const col = i; + + // check for all-zero AC coefficients + if (p[(1 * 8) + col] === 0 && p[(2 * 8) + col] === 0 && p[(3 * 8) + col] === 0 + && p[(4 * 8) + col] === 0 && p[(5 * 8) + col] === 0 && p[(6 * 8) + col] === 0 + && p[(7 * 8) + col] === 0) { + t = ((dctSqrt2 * dataIn[i + 0]) + 8192) >> 14; + p[(0 * 8) + col] = t; + p[(1 * 8) + col] = t; + p[(2 * 8) + col] = t; + p[(3 * 8) + col] = t; + p[(4 * 8) + col] = t; + p[(5 * 8) + col] = t; + p[(6 * 8) + col] = t; + p[(7 * 8) + col] = t; + continue; // eslint-disable-line no-continue + } + + // stage 4 + v0 = ((dctSqrt2 * p[(0 * 8) + col]) + 2048) >> 12; + v1 = ((dctSqrt2 * p[(4 * 8) + col]) + 2048) >> 12; + v2 = p[(2 * 8) + col]; + v3 = p[(6 * 8) + col]; + v4 = ((dctSqrt1d2 * (p[(1 * 8) + col] - p[(7 * 8) + col])) + 2048) >> 12; + v7 = ((dctSqrt1d2 * (p[(1 * 8) + col] + p[(7 * 8) + col])) + 2048) >> 12; + v5 = p[(3 * 8) + col]; + v6 = p[(5 * 8) + col]; + + // stage 3 + t = (v0 - v1 + 1) >> 1; + v0 = (v0 + v1 + 1) >> 1; + v1 = t; + t = ((v2 * dctSin6) + (v3 * dctCos6) + 2048) >> 12; + v2 = ((v2 * dctCos6) - (v3 * dctSin6) + 2048) >> 12; + v3 = t; + t = (v4 - v6 + 1) >> 1; + v4 = (v4 + v6 + 1) >> 1; + v6 = t; + t = (v7 + v5 + 1) >> 1; + v5 = (v7 - v5 + 1) >> 1; + v7 = t; + + // stage 2 + t = (v0 - v3 + 1) >> 1; + v0 = (v0 + v3 + 1) >> 1; + v3 = t; + t = (v1 - v2 + 1) >> 1; + v1 = (v1 + v2 + 1) >> 1; + v2 = t; + t = ((v4 * dctSin3) + (v7 * dctCos3) + 2048) >> 12; + v4 = ((v4 * dctCos3) - (v7 * dctSin3) + 2048) >> 12; + v7 = t; + t = ((v5 * dctSin1) + (v6 * dctCos1) + 2048) >> 12; + v5 = ((v5 * dctCos1) - (v6 * dctSin1) + 2048) >> 12; + v6 = t; + + // stage 1 + p[(0 * 8) + col] = v0 + v7; + p[(7 * 8) + col] = v0 - v7; + p[(1 * 8) + col] = v1 + v6; + p[(6 * 8) + col] = v1 - v6; + p[(2 * 8) + col] = v2 + v5; + p[(5 * 8) + col] = v2 - v5; + p[(3 * 8) + col] = v3 + v4; + p[(4 * 8) + col] = v3 - v4; + } + + // convert to 8-bit integers + for (i = 0; i < 64; ++i) { + const sample = 128 + ((p[i] + 8) >> 4); + if (sample < 0) { + dataOut[i] = 0; + } else if (sample > 0XFF) { + dataOut[i] = 0xFF; + } else { + dataOut[i] = sample; + } + } + } + + for (let blockRow = 0; blockRow < blocksPerColumn; blockRow++) { + const scanLine = blockRow << 3; + for (let i = 0; i < 8; i++) { + lines.push(new Uint8Array(samplesPerLine)); + } + for (let blockCol = 0; blockCol < blocksPerLine; blockCol++) { + quantizeAndInverse(component.blocks[blockRow][blockCol], r, R); + + let offset = 0; + const sample = blockCol << 3; + for (let j = 0; j < 8; j++) { + const line = lines[scanLine + j]; + for (let i = 0; i < 8; i++) { + line[sample + i] = r[offset++]; + } + } + } + } + return lines; +} + +class JpegStreamReader { + constructor() { + this.jfif = null; + this.adobe = null; + + this.quantizationTables = []; + this.huffmanTablesAC = []; + this.huffmanTablesDC = []; + this.resetFrames(); + } + + resetFrames() { + this.frames = []; + } + + parse(data) { + let offset = 0; + // const { length } = data; + function readUint16() { + const value = (data[offset] << 8) | data[offset + 1]; + offset += 2; + return value; + } + function readDataBlock() { + const length = readUint16(); + const array = data.subarray(offset, offset + length - 2); + offset += array.length; + return array; + } + function prepareComponents(frame) { + let maxH = 0; + let maxV = 0; + let component; + let componentId; + for (componentId in frame.components) { + if (frame.components.hasOwnProperty(componentId)) { + component = frame.components[componentId]; + if (maxH < component.h) { + maxH = component.h; + } + if (maxV < component.v) { + maxV = component.v; + } + } + } + const mcusPerLine = Math.ceil(frame.samplesPerLine / 8 / maxH); + const mcusPerColumn = Math.ceil(frame.scanLines / 8 / maxV); + for (componentId in frame.components) { + if (frame.components.hasOwnProperty(componentId)) { + component = frame.components[componentId]; + const blocksPerLine = Math.ceil(Math.ceil(frame.samplesPerLine / 8) * component.h / maxH); + const blocksPerColumn = Math.ceil(Math.ceil(frame.scanLines / 8) * component.v / maxV); + const blocksPerLineForMcu = mcusPerLine * component.h; + const blocksPerColumnForMcu = mcusPerColumn * component.v; + const blocks = []; + for (let i = 0; i < blocksPerColumnForMcu; i++) { + const row = []; + for (let j = 0; j < blocksPerLineForMcu; j++) { + row.push(new Int32Array(64)); + } + blocks.push(row); + } + component.blocksPerLine = blocksPerLine; + component.blocksPerColumn = blocksPerColumn; + component.blocks = blocks; + } + } + frame.maxH = maxH; + frame.maxV = maxV; + frame.mcusPerLine = mcusPerLine; + frame.mcusPerColumn = mcusPerColumn; + } + + let fileMarker = readUint16(); + if (fileMarker !== 0xFFD8) { // SOI (Start of Image) + throw new Error('SOI not found'); + } + + fileMarker = readUint16(); + while (fileMarker !== 0xFFD9) { // EOI (End of image) + switch (fileMarker) { + case 0xFF00: break; + case 0xFFE0: // APP0 (Application Specific) + case 0xFFE1: // APP1 + case 0xFFE2: // APP2 + case 0xFFE3: // APP3 + case 0xFFE4: // APP4 + case 0xFFE5: // APP5 + case 0xFFE6: // APP6 + case 0xFFE7: // APP7 + case 0xFFE8: // APP8 + case 0xFFE9: // APP9 + case 0xFFEA: // APP10 + case 0xFFEB: // APP11 + case 0xFFEC: // APP12 + case 0xFFED: // APP13 + case 0xFFEE: // APP14 + case 0xFFEF: // APP15 + case 0xFFFE: { // COM (Comment) + const appData = readDataBlock(); + + if (fileMarker === 0xFFE0) { + if (appData[0] === 0x4A && appData[1] === 0x46 && appData[2] === 0x49 + && appData[3] === 0x46 && appData[4] === 0) { // 'JFIF\x00' + this.jfif = { + version: { major: appData[5], minor: appData[6] }, + densityUnits: appData[7], + xDensity: (appData[8] << 8) | appData[9], + yDensity: (appData[10] << 8) | appData[11], + thumbWidth: appData[12], + thumbHeight: appData[13], + thumbData: appData.subarray(14, 14 + (3 * appData[12] * appData[13])), + }; + } + } + // TODO APP1 - Exif + if (fileMarker === 0xFFEE) { + if (appData[0] === 0x41 && appData[1] === 0x64 && appData[2] === 0x6F + && appData[3] === 0x62 && appData[4] === 0x65 && appData[5] === 0) { // 'Adobe\x00' + this.adobe = { + version: appData[6], + flags0: (appData[7] << 8) | appData[8], + flags1: (appData[9] << 8) | appData[10], + transformCode: appData[11], + }; + } + } + break; + } + + case 0xFFDB: { // DQT (Define Quantization Tables) + const quantizationTablesLength = readUint16(); + const quantizationTablesEnd = quantizationTablesLength + offset - 2; + while (offset < quantizationTablesEnd) { + const quantizationTableSpec = data[offset++]; + const tableData = new Int32Array(64); + if ((quantizationTableSpec >> 4) === 0) { // 8 bit values + for (let j = 0; j < 64; j++) { + const z = dctZigZag[j]; + tableData[z] = data[offset++]; + } + } else if ((quantizationTableSpec >> 4) === 1) { // 16 bit + for (let j = 0; j < 64; j++) { + const z = dctZigZag[j]; + tableData[z] = readUint16(); + } + } else { + throw new Error('DQT: invalid table spec'); + } + this.quantizationTables[quantizationTableSpec & 15] = tableData; + } + break; + } + + case 0xFFC0: // SOF0 (Start of Frame, Baseline DCT) + case 0xFFC1: // SOF1 (Start of Frame, Extended DCT) + case 0xFFC2: { // SOF2 (Start of Frame, Progressive DCT) + readUint16(); // skip data length + const frame = { + extended: (fileMarker === 0xFFC1), + progressive: (fileMarker === 0xFFC2), + precision: data[offset++], + scanLines: readUint16(), + samplesPerLine: readUint16(), + components: {}, + componentsOrder: [], + }; + + const componentsCount = data[offset++]; + let componentId; + // let maxH = 0; + // let maxV = 0; + for (let i = 0; i < componentsCount; i++) { + componentId = data[offset]; + const h = data[offset + 1] >> 4; + const v = data[offset + 1] & 15; + const qId = data[offset + 2]; + frame.componentsOrder.push(componentId); + frame.components[componentId] = { + h, + v, + quantizationIdx: qId, + }; + offset += 3; + } + prepareComponents(frame); + this.frames.push(frame); + break; + } + + case 0xFFC4: { // DHT (Define Huffman Tables) + const huffmanLength = readUint16(); + for (let i = 2; i < huffmanLength;) { + const huffmanTableSpec = data[offset++]; + const codeLengths = new Uint8Array(16); + let codeLengthSum = 0; + for (let j = 0; j < 16; j++, offset++) { + codeLengths[j] = data[offset]; + codeLengthSum += codeLengths[j]; + } + const huffmanValues = new Uint8Array(codeLengthSum); + for (let j = 0; j < codeLengthSum; j++, offset++) { + huffmanValues[j] = data[offset]; + } + i += 17 + codeLengthSum; + + if ((huffmanTableSpec >> 4) === 0) { + this.huffmanTablesDC[huffmanTableSpec & 15] = buildHuffmanTable( + codeLengths, huffmanValues, + ); + } else { + this.huffmanTablesAC[huffmanTableSpec & 15] = buildHuffmanTable( + codeLengths, huffmanValues, + ); + } + } + break; + } + + case 0xFFDD: // DRI (Define Restart Interval) + readUint16(); // skip data length + this.resetInterval = readUint16(); + break; + + case 0xFFDA: { // SOS (Start of Scan) + readUint16(); // skip length + const selectorsCount = data[offset++]; + const components = []; + const frame = this.frames[0]; + for (let i = 0; i < selectorsCount; i++) { + const component = frame.components[data[offset++]]; + const tableSpec = data[offset++]; + component.huffmanTableDC = this.huffmanTablesDC[tableSpec >> 4]; + component.huffmanTableAC = this.huffmanTablesAC[tableSpec & 15]; + components.push(component); + } + const spectralStart = data[offset++]; + const spectralEnd = data[offset++]; + const successiveApproximation = data[offset++]; + const processed = decodeScan(data, offset, + frame, components, this.resetInterval, + spectralStart, spectralEnd, + successiveApproximation >> 4, successiveApproximation & 15); + offset += processed; + break; + } + + case 0xFFFF: // Fill bytes + if (data[offset] !== 0xFF) { // Avoid skipping a valid marker. + offset--; + } + break; + + default: + if (data[offset - 3] === 0xFF + && data[offset - 2] >= 0xC0 && data[offset - 2] <= 0xFE) { + // could be incorrect encoding -- last 0xFF byte of the previous + // block was eaten by the encoder + offset -= 3; + break; + } + throw new Error(`unknown JPEG marker ${fileMarker.toString(16)}`); + } + fileMarker = readUint16(); + } + } + + getResult() { + const { frames } = this; + if (this.frames.length === 0) { + throw new Error('no frames were decoded'); + } else if (this.frames.length > 1) { + console.warn('more than one frame is not supported'); + } + + // set each frame's components quantization table + for (let i = 0; i < this.frames.length; i++) { + const cp = this.frames[i].components; + for (const j of Object.keys(cp)) { + cp[j].quantizationTable = this.quantizationTables[cp[j].quantizationIdx]; + delete cp[j].quantizationIdx; + } + } + + const frame = frames[0]; + const { components, componentsOrder } = frame; + const outComponents = []; + const width = frame.samplesPerLine; + const height = frame.scanLines; + + for (let i = 0; i < componentsOrder.length; i++) { + const component = components[componentsOrder[i]]; + outComponents.push({ + lines: buildComponentData(frame, component), + scaleX: component.h / frame.maxH, + scaleY: component.v / frame.maxV, + }); + } + + const out = new Uint8Array(width * height * outComponents.length); + let oi = 0; + for (let y = 0; y < height; ++y) { + for (let x = 0; x < width; ++x) { + for (let i = 0; i < outComponents.length; ++i) { + const component = outComponents[i]; + out[oi] = component.lines[0 | y * component.scaleY][0 | x * component.scaleX]; + ++oi; + } + } + } + return out; + } +} + +class JpegDecoder extends _basedecoder__WEBPACK_IMPORTED_MODULE_0__["default"] { + constructor(fileDirectory) { + super(); + this.reader = new JpegStreamReader(); + if (fileDirectory.JPEGTables) { + this.reader.parse(fileDirectory.JPEGTables); + } + } + + decodeBlock(buffer) { + this.reader.resetFrames(); + this.reader.parse(new Uint8Array(buffer)); + return this.reader.getResult().buffer; + } +} + + +/***/ }), + +/***/ "../node_modules/geotiff/src/predictor.js": +/*!************************************************!*\ + !*** ../node_modules/geotiff/src/predictor.js ***! + \************************************************/ +/*! exports provided: applyPredictor */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "applyPredictor", function() { return applyPredictor; }); +function decodeRowAcc(row, stride) { + let length = row.length - stride; + let offset = 0; + do { + for (let i = stride; i > 0; i--) { + row[offset + stride] += row[offset]; + offset++; + } + + length -= stride; + } while (length > 0); +} + +function decodeRowFloatingPoint(row, stride, bytesPerSample) { + let index = 0; + let count = row.length; + const wc = count / bytesPerSample; + + while (count > stride) { + for (let i = stride; i > 0; --i) { + row[index + stride] += row[index]; + ++index; + } + count -= stride; + } + + const copy = row.slice(); + for (let i = 0; i < wc; ++i) { + for (let b = 0; b < bytesPerSample; ++b) { + row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i]; + } + } +} + +function applyPredictor(block, predictor, width, height, bitsPerSample, + planarConfiguration) { + if (!predictor || predictor === 1) { + return block; + } + + for (let i = 0; i < bitsPerSample.length; ++i) { + if (bitsPerSample[i] % 8 !== 0) { + throw new Error('When decoding with predictor, only multiple of 8 bits are supported.'); + } + if (bitsPerSample[i] !== bitsPerSample[0]) { + throw new Error('When decoding with predictor, all samples must have the same size.'); + } + } + + const bytesPerSample = bitsPerSample[0] / 8; + const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length; + + for (let i = 0; i < height; ++i) { + // Last strip will be truncated if height % stripHeight != 0 + if (i * stride * width * bytesPerSample >= block.byteLength) { + break; + } + let row; + if (predictor === 2) { // horizontal prediction + switch (bitsPerSample[0]) { + case 8: + row = new Uint8Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample, + ); + break; + case 16: + row = new Uint16Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2, + ); + break; + case 32: + row = new Uint32Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4, + ); + break; + default: + throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`); + } + decodeRowAcc(row, stride, bytesPerSample); + } else if (predictor === 3) { // horizontal floating point + row = new Uint8Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample, + ); + decodeRowFloatingPoint(row, stride, bytesPerSample); + } + } + return block; +} + + +/***/ }) + +}]); +//# sourceMappingURL=1.js.map \ No newline at end of file diff --git a/dist/1.js.map b/dist/1.js.map new file mode 100644 index 0000000..fe3e58f --- /dev/null +++ b/dist/1.js.map @@ -0,0 +1 @@ +{"version":3,"sources":["webpack:///../node_modules/geotiff/src/compression/basedecoder.js","webpack:///../node_modules/geotiff/src/compression/jpeg.js","webpack:///../node_modules/geotiff/src/predictor.js"],"names":[],"mappings":";;;;;;;;;;AAAA;AAAA;AAAA;AAA8C;;AAE/B;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,iEAAc;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACnBA;AAAA;AAAA;AAAwC;;AAExC,oBAAoB,uBAAuB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,qBAAqB;AACrB,oBAAoB;AACpB,qBAAqB;AACrB,qBAAqB;AACrB,qBAAqB;AACrB,qBAAqB;AACrB,sBAAsB;AACtB,wBAAwB;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,yBAAyB;;AAEtC;AACA;AACA,iBAAiB,YAAY;AAC7B,mBAAmB,oBAAoB;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,yBAAyB;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,yBAAyB;AAC9C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS,2BAA2B;;AAEpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA8C,0CAA0C;AACxF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wCAAwC;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;;AAEA;AACA;AACA,eAAe,sBAAsB;AACrC;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,uBAAuB;AACxC;AACA;AACA;AACA,KAAK;AACL,iBAAiB,uBAAuB;AACxC,mBAAmB,sBAAsB;AACzC;AACA,iBAAiB,OAAO;AACxB,qBAAqB,OAAO;AAC5B,uBAAuB,OAAO;AAC9B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,+CAA+C;AAC/C;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,SAAS,iCAAiC;AAC1C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe,QAAQ;AACvB;AACA;;AAEA;AACA,eAAe,OAAO;AACtB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe,OAAO;AACtB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe,QAAQ;AACvB;AACA;AACA;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA,wBAAwB,4BAA4B;AACpD;AACA,mBAAmB,OAAO;AAC1B;AACA;AACA,0BAA0B,0BAA0B;AACpD;;AAEA;AACA;AACA,qBAAqB,OAAO;AAC5B;AACA,uBAAuB,OAAO;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,cAAc,SAAS;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,2BAA2B;AACpD;AACA,2BAA2B,yBAAyB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC;AAChC;AACA;;AAEA;AACA,mCAAmC;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;;AAEA;AACA;AACA,2DAA2D;AAC3D;AACA,0BAA0B,uCAAuC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kFAAkF;AAClF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA,qDAAqD;AACrD,6BAA6B,QAAQ;AACrC;AACA;AACA;AACA,aAAa,+CAA+C;AAC5D,6BAA6B,QAAQ;AACrC;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,sBAAsB;AACtB,uBAAuB;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA,yBAAyB,qBAAqB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB;AACtB;AACA,yBAAyB,mBAAmB;AAC5C;AACA;AACA;AACA,2BAA2B,QAAQ;AACnC;AACA;AACA;AACA;AACA,2BAA2B,mBAAmB;AAC9C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uBAAuB;AACvB;AACA;;AAEA,sBAAsB;AACtB,uBAAuB;AACvB;AACA;AACA;AACA,yBAAyB,oBAAoB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,sCAAsC;AACtC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iDAAiD,wBAAwB;AACzE;AACA;AACA;AACA;;AAEA;AACA,WAAW,SAAS;AACpB;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA,mBAAmB,wBAAwB;AAC3C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW,8BAA8B;AACzC;AACA;AACA;;AAEA,mBAAmB,4BAA4B;AAC/C;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA,mBAAmB,YAAY;AAC/B,qBAAqB,WAAW;AAChC,uBAAuB,0BAA0B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe,0BAA0B,oDAAW;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACh4BA;AAAA;AAAA;AACA;AACA;AACA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;;AAEA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,QAAQ;AACzB,mBAAmB,oBAAoB;AACvC;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;;AAEA,iBAAiB,0BAA0B;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,iBAAiB,YAAY;AAC7B;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0DAA0D,iBAAiB;AAC3E;AACA;AACA,KAAK,4BAA4B;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"1.js","sourcesContent":["import { applyPredictor } from '../predictor';\n\nexport default class BaseDecoder {\n async decode(fileDirectory, buffer) {\n const decoded = await this.decodeBlock(buffer);\n const predictor = fileDirectory.Predictor || 1;\n if (predictor !== 1) {\n const isTiled = !fileDirectory.StripOffsets;\n const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth;\n const tileHeight = isTiled ? fileDirectory.TileLength : (\n fileDirectory.RowsPerStrip || fileDirectory.ImageLength\n );\n return applyPredictor(\n decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample,\n fileDirectory.PlanarConfiguration,\n );\n }\n return decoded;\n }\n}\n","import BaseDecoder from './basedecoder';\n\n/* -*- tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- /\n/* vim: set shiftwidth=2 tabstop=2 autoindent cindent expandtab: */\n/*\n Copyright 2011 notmasteryet\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n http://www.apache.org/licenses/LICENSE-2.0\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*/\n\n// - The JPEG specification can be found in the ITU CCITT Recommendation T.81\n// (www.w3.org/Graphics/JPEG/itu-t81.pdf)\n// - The JFIF specification can be found in the JPEG File Interchange Format\n// (www.w3.org/Graphics/JPEG/jfif3.pdf)\n// - The Adobe Application-Specific JPEG markers in the Supporting the DCT Filters\n// in PostScript Level 2, Technical Note #5116\n// (partners.adobe.com/public/developer/en/ps/sdk/5116.DCT_Filter.pdf)\n\nconst dctZigZag = new Int32Array([\n 0,\n 1, 8,\n 16, 9, 2,\n 3, 10, 17, 24,\n 32, 25, 18, 11, 4,\n 5, 12, 19, 26, 33, 40,\n 48, 41, 34, 27, 20, 13, 6,\n 7, 14, 21, 28, 35, 42, 49, 56,\n 57, 50, 43, 36, 29, 22, 15,\n 23, 30, 37, 44, 51, 58,\n 59, 52, 45, 38, 31,\n 39, 46, 53, 60,\n 61, 54, 47,\n 55, 62,\n 63,\n]);\n\nconst dctCos1 = 4017; // cos(pi/16)\nconst dctSin1 = 799; // sin(pi/16)\nconst dctCos3 = 3406; // cos(3*pi/16)\nconst dctSin3 = 2276; // sin(3*pi/16)\nconst dctCos6 = 1567; // cos(6*pi/16)\nconst dctSin6 = 3784; // sin(6*pi/16)\nconst dctSqrt2 = 5793; // sqrt(2)\nconst dctSqrt1d2 = 2896;// sqrt(2) / 2\n\nfunction buildHuffmanTable(codeLengths, values) {\n let k = 0;\n const code = [];\n let length = 16;\n while (length > 0 && !codeLengths[length - 1]) {\n --length;\n }\n code.push({ children: [], index: 0 });\n\n let p = code[0];\n let q;\n for (let i = 0; i < length; i++) {\n for (let j = 0; j < codeLengths[i]; j++) {\n p = code.pop();\n p.children[p.index] = values[k];\n while (p.index > 0) {\n p = code.pop();\n }\n p.index++;\n code.push(p);\n while (code.length <= i) {\n code.push(q = { children: [], index: 0 });\n p.children[p.index] = q.children;\n p = q;\n }\n k++;\n }\n if (i + 1 < length) {\n // p here points to last code\n code.push(q = { children: [], index: 0 });\n p.children[p.index] = q.children;\n p = q;\n }\n }\n return code[0].children;\n}\n\nfunction decodeScan(data, initialOffset,\n frame, components, resetInterval,\n spectralStart, spectralEnd,\n successivePrev, successive) {\n const { mcusPerLine, progressive } = frame;\n\n const startOffset = initialOffset;\n let offset = initialOffset;\n let bitsData = 0;\n let bitsCount = 0;\n function readBit() {\n if (bitsCount > 0) {\n bitsCount--;\n return (bitsData >> bitsCount) & 1;\n }\n bitsData = data[offset++];\n if (bitsData === 0xFF) {\n const nextByte = data[offset++];\n if (nextByte) {\n throw new Error(`unexpected marker: ${((bitsData << 8) | nextByte).toString(16)}`);\n }\n // unstuff 0\n }\n bitsCount = 7;\n return bitsData >>> 7;\n }\n function decodeHuffman(tree) {\n let node = tree;\n let bit;\n while ((bit = readBit()) !== null) { // eslint-disable-line no-cond-assign\n node = node[bit];\n if (typeof node === 'number') {\n return node;\n }\n if (typeof node !== 'object') {\n throw new Error('invalid huffman sequence');\n }\n }\n return null;\n }\n function receive(initialLength) {\n let length = initialLength;\n let n = 0;\n while (length > 0) {\n const bit = readBit();\n if (bit === null) {\n return undefined;\n }\n n = (n << 1) | bit;\n --length;\n }\n return n;\n }\n function receiveAndExtend(length) {\n const n = receive(length);\n if (n >= 1 << (length - 1)) {\n return n;\n }\n return n + (-1 << length) + 1;\n }\n function decodeBaseline(component, zz) {\n const t = decodeHuffman(component.huffmanTableDC);\n const diff = t === 0 ? 0 : receiveAndExtend(t);\n component.pred += diff;\n zz[0] = component.pred;\n let k = 1;\n while (k < 64) {\n const rs = decodeHuffman(component.huffmanTableAC);\n const s = rs & 15;\n const r = rs >> 4;\n if (s === 0) {\n if (r < 15) {\n break;\n }\n k += 16;\n } else {\n k += r;\n const z = dctZigZag[k];\n zz[z] = receiveAndExtend(s);\n k++;\n }\n }\n }\n function decodeDCFirst(component, zz) {\n const t = decodeHuffman(component.huffmanTableDC);\n const diff = t === 0 ? 0 : (receiveAndExtend(t) << successive);\n component.pred += diff;\n zz[0] = component.pred;\n }\n function decodeDCSuccessive(component, zz) {\n zz[0] |= readBit() << successive;\n }\n let eobrun = 0;\n function decodeACFirst(component, zz) {\n if (eobrun > 0) {\n eobrun--;\n return;\n }\n let k = spectralStart;\n const e = spectralEnd;\n while (k <= e) {\n const rs = decodeHuffman(component.huffmanTableAC);\n const s = rs & 15;\n const r = rs >> 4;\n if (s === 0) {\n if (r < 15) {\n eobrun = receive(r) + (1 << r) - 1;\n break;\n }\n k += 16;\n } else {\n k += r;\n const z = dctZigZag[k];\n zz[z] = receiveAndExtend(s) * (1 << successive);\n k++;\n }\n }\n }\n let successiveACState = 0;\n let successiveACNextValue;\n function decodeACSuccessive(component, zz) {\n let k = spectralStart;\n const e = spectralEnd;\n let r = 0;\n while (k <= e) {\n const z = dctZigZag[k];\n const direction = zz[z] < 0 ? -1 : 1;\n switch (successiveACState) {\n case 0: { // initial state\n const rs = decodeHuffman(component.huffmanTableAC);\n const s = rs & 15;\n r = rs >> 4;\n if (s === 0) {\n if (r < 15) {\n eobrun = receive(r) + (1 << r);\n successiveACState = 4;\n } else {\n r = 16;\n successiveACState = 1;\n }\n } else {\n if (s !== 1) {\n throw new Error('invalid ACn encoding');\n }\n successiveACNextValue = receiveAndExtend(s);\n successiveACState = r ? 2 : 3;\n }\n continue; // eslint-disable-line no-continue\n }\n case 1: // skipping r zero items\n case 2:\n if (zz[z]) {\n zz[z] += (readBit() << successive) * direction;\n } else {\n r--;\n if (r === 0) {\n successiveACState = successiveACState === 2 ? 3 : 0;\n }\n }\n break;\n case 3: // set value for a zero item\n if (zz[z]) {\n zz[z] += (readBit() << successive) * direction;\n } else {\n zz[z] = successiveACNextValue << successive;\n successiveACState = 0;\n }\n break;\n case 4: // eob\n if (zz[z]) {\n zz[z] += (readBit() << successive) * direction;\n }\n break;\n default:\n break;\n }\n k++;\n }\n if (successiveACState === 4) {\n eobrun--;\n if (eobrun === 0) {\n successiveACState = 0;\n }\n }\n }\n function decodeMcu(component, decodeFunction, mcu, row, col) {\n const mcuRow = (mcu / mcusPerLine) | 0;\n const mcuCol = mcu % mcusPerLine;\n const blockRow = (mcuRow * component.v) + row;\n const blockCol = (mcuCol * component.h) + col;\n decodeFunction(component, component.blocks[blockRow][blockCol]);\n }\n function decodeBlock(component, decodeFunction, mcu) {\n const blockRow = (mcu / component.blocksPerLine) | 0;\n const blockCol = mcu % component.blocksPerLine;\n decodeFunction(component, component.blocks[blockRow][blockCol]);\n }\n\n const componentsLength = components.length;\n let component;\n let i;\n let j;\n let k;\n let n;\n let decodeFn;\n if (progressive) {\n if (spectralStart === 0) {\n decodeFn = successivePrev === 0 ? decodeDCFirst : decodeDCSuccessive;\n } else {\n decodeFn = successivePrev === 0 ? decodeACFirst : decodeACSuccessive;\n }\n } else {\n decodeFn = decodeBaseline;\n }\n\n let mcu = 0;\n let marker;\n let mcuExpected;\n if (componentsLength === 1) {\n mcuExpected = components[0].blocksPerLine * components[0].blocksPerColumn;\n } else {\n mcuExpected = mcusPerLine * frame.mcusPerColumn;\n }\n\n const usedResetInterval = resetInterval || mcuExpected;\n\n while (mcu < mcuExpected) {\n // reset interval stuff\n for (i = 0; i < componentsLength; i++) {\n components[i].pred = 0;\n }\n eobrun = 0;\n\n if (componentsLength === 1) {\n component = components[0];\n for (n = 0; n < usedResetInterval; n++) {\n decodeBlock(component, decodeFn, mcu);\n mcu++;\n }\n } else {\n for (n = 0; n < usedResetInterval; n++) {\n for (i = 0; i < componentsLength; i++) {\n component = components[i];\n const { h, v } = component;\n for (j = 0; j < v; j++) {\n for (k = 0; k < h; k++) {\n decodeMcu(component, decodeFn, mcu, j, k);\n }\n }\n }\n mcu++;\n\n // If we've reached our expected MCU's, stop decoding\n if (mcu === mcuExpected) {\n break;\n }\n }\n }\n\n // find marker\n bitsCount = 0;\n marker = (data[offset] << 8) | data[offset + 1];\n if (marker < 0xFF00) {\n throw new Error('marker was not found');\n }\n\n if (marker >= 0xFFD0 && marker <= 0xFFD7) { // RSTx\n offset += 2;\n } else {\n break;\n }\n }\n\n return offset - startOffset;\n}\n\nfunction buildComponentData(frame, component) {\n const lines = [];\n const { blocksPerLine, blocksPerColumn } = component;\n const samplesPerLine = blocksPerLine << 3;\n const R = new Int32Array(64);\n const r = new Uint8Array(64);\n\n // A port of poppler's IDCT method which in turn is taken from:\n // Christoph Loeffler, Adriaan Ligtenberg, George S. Moschytz,\n // \"Practical Fast 1-D DCT Algorithms with 11 Multiplications\",\n // IEEE Intl. Conf. on Acoustics, Speech & Signal Processing, 1989,\n // 988-991.\n function quantizeAndInverse(zz, dataOut, dataIn) {\n const qt = component.quantizationTable;\n let v0;\n let v1;\n let v2;\n let v3;\n let v4;\n let v5;\n let v6;\n let v7;\n let t;\n const p = dataIn;\n let i;\n\n // dequant\n for (i = 0; i < 64; i++) {\n p[i] = zz[i] * qt[i];\n }\n\n // inverse DCT on rows\n for (i = 0; i < 8; ++i) {\n const row = 8 * i;\n\n // check for all-zero AC coefficients\n if (p[1 + row] === 0 && p[2 + row] === 0 && p[3 + row] === 0\n && p[4 + row] === 0 && p[5 + row] === 0 && p[6 + row] === 0\n && p[7 + row] === 0) {\n t = ((dctSqrt2 * p[0 + row]) + 512) >> 10;\n p[0 + row] = t;\n p[1 + row] = t;\n p[2 + row] = t;\n p[3 + row] = t;\n p[4 + row] = t;\n p[5 + row] = t;\n p[6 + row] = t;\n p[7 + row] = t;\n continue; // eslint-disable-line no-continue\n }\n\n // stage 4\n v0 = ((dctSqrt2 * p[0 + row]) + 128) >> 8;\n v1 = ((dctSqrt2 * p[4 + row]) + 128) >> 8;\n v2 = p[2 + row];\n v3 = p[6 + row];\n v4 = ((dctSqrt1d2 * (p[1 + row] - p[7 + row])) + 128) >> 8;\n v7 = ((dctSqrt1d2 * (p[1 + row] + p[7 + row])) + 128) >> 8;\n v5 = p[3 + row] << 4;\n v6 = p[5 + row] << 4;\n\n // stage 3\n t = (v0 - v1 + 1) >> 1;\n v0 = (v0 + v1 + 1) >> 1;\n v1 = t;\n t = ((v2 * dctSin6) + (v3 * dctCos6) + 128) >> 8;\n v2 = ((v2 * dctCos6) - (v3 * dctSin6) + 128) >> 8;\n v3 = t;\n t = (v4 - v6 + 1) >> 1;\n v4 = (v4 + v6 + 1) >> 1;\n v6 = t;\n t = (v7 + v5 + 1) >> 1;\n v5 = (v7 - v5 + 1) >> 1;\n v7 = t;\n\n // stage 2\n t = (v0 - v3 + 1) >> 1;\n v0 = (v0 + v3 + 1) >> 1;\n v3 = t;\n t = (v1 - v2 + 1) >> 1;\n v1 = (v1 + v2 + 1) >> 1;\n v2 = t;\n t = ((v4 * dctSin3) + (v7 * dctCos3) + 2048) >> 12;\n v4 = ((v4 * dctCos3) - (v7 * dctSin3) + 2048) >> 12;\n v7 = t;\n t = ((v5 * dctSin1) + (v6 * dctCos1) + 2048) >> 12;\n v5 = ((v5 * dctCos1) - (v6 * dctSin1) + 2048) >> 12;\n v6 = t;\n\n // stage 1\n p[0 + row] = v0 + v7;\n p[7 + row] = v0 - v7;\n p[1 + row] = v1 + v6;\n p[6 + row] = v1 - v6;\n p[2 + row] = v2 + v5;\n p[5 + row] = v2 - v5;\n p[3 + row] = v3 + v4;\n p[4 + row] = v3 - v4;\n }\n\n // inverse DCT on columns\n for (i = 0; i < 8; ++i) {\n const col = i;\n\n // check for all-zero AC coefficients\n if (p[(1 * 8) + col] === 0 && p[(2 * 8) + col] === 0 && p[(3 * 8) + col] === 0\n && p[(4 * 8) + col] === 0 && p[(5 * 8) + col] === 0 && p[(6 * 8) + col] === 0\n && p[(7 * 8) + col] === 0) {\n t = ((dctSqrt2 * dataIn[i + 0]) + 8192) >> 14;\n p[(0 * 8) + col] = t;\n p[(1 * 8) + col] = t;\n p[(2 * 8) + col] = t;\n p[(3 * 8) + col] = t;\n p[(4 * 8) + col] = t;\n p[(5 * 8) + col] = t;\n p[(6 * 8) + col] = t;\n p[(7 * 8) + col] = t;\n continue; // eslint-disable-line no-continue\n }\n\n // stage 4\n v0 = ((dctSqrt2 * p[(0 * 8) + col]) + 2048) >> 12;\n v1 = ((dctSqrt2 * p[(4 * 8) + col]) + 2048) >> 12;\n v2 = p[(2 * 8) + col];\n v3 = p[(6 * 8) + col];\n v4 = ((dctSqrt1d2 * (p[(1 * 8) + col] - p[(7 * 8) + col])) + 2048) >> 12;\n v7 = ((dctSqrt1d2 * (p[(1 * 8) + col] + p[(7 * 8) + col])) + 2048) >> 12;\n v5 = p[(3 * 8) + col];\n v6 = p[(5 * 8) + col];\n\n // stage 3\n t = (v0 - v1 + 1) >> 1;\n v0 = (v0 + v1 + 1) >> 1;\n v1 = t;\n t = ((v2 * dctSin6) + (v3 * dctCos6) + 2048) >> 12;\n v2 = ((v2 * dctCos6) - (v3 * dctSin6) + 2048) >> 12;\n v3 = t;\n t = (v4 - v6 + 1) >> 1;\n v4 = (v4 + v6 + 1) >> 1;\n v6 = t;\n t = (v7 + v5 + 1) >> 1;\n v5 = (v7 - v5 + 1) >> 1;\n v7 = t;\n\n // stage 2\n t = (v0 - v3 + 1) >> 1;\n v0 = (v0 + v3 + 1) >> 1;\n v3 = t;\n t = (v1 - v2 + 1) >> 1;\n v1 = (v1 + v2 + 1) >> 1;\n v2 = t;\n t = ((v4 * dctSin3) + (v7 * dctCos3) + 2048) >> 12;\n v4 = ((v4 * dctCos3) - (v7 * dctSin3) + 2048) >> 12;\n v7 = t;\n t = ((v5 * dctSin1) + (v6 * dctCos1) + 2048) >> 12;\n v5 = ((v5 * dctCos1) - (v6 * dctSin1) + 2048) >> 12;\n v6 = t;\n\n // stage 1\n p[(0 * 8) + col] = v0 + v7;\n p[(7 * 8) + col] = v0 - v7;\n p[(1 * 8) + col] = v1 + v6;\n p[(6 * 8) + col] = v1 - v6;\n p[(2 * 8) + col] = v2 + v5;\n p[(5 * 8) + col] = v2 - v5;\n p[(3 * 8) + col] = v3 + v4;\n p[(4 * 8) + col] = v3 - v4;\n }\n\n // convert to 8-bit integers\n for (i = 0; i < 64; ++i) {\n const sample = 128 + ((p[i] + 8) >> 4);\n if (sample < 0) {\n dataOut[i] = 0;\n } else if (sample > 0XFF) {\n dataOut[i] = 0xFF;\n } else {\n dataOut[i] = sample;\n }\n }\n }\n\n for (let blockRow = 0; blockRow < blocksPerColumn; blockRow++) {\n const scanLine = blockRow << 3;\n for (let i = 0; i < 8; i++) {\n lines.push(new Uint8Array(samplesPerLine));\n }\n for (let blockCol = 0; blockCol < blocksPerLine; blockCol++) {\n quantizeAndInverse(component.blocks[blockRow][blockCol], r, R);\n\n let offset = 0;\n const sample = blockCol << 3;\n for (let j = 0; j < 8; j++) {\n const line = lines[scanLine + j];\n for (let i = 0; i < 8; i++) {\n line[sample + i] = r[offset++];\n }\n }\n }\n }\n return lines;\n}\n\nclass JpegStreamReader {\n constructor() {\n this.jfif = null;\n this.adobe = null;\n\n this.quantizationTables = [];\n this.huffmanTablesAC = [];\n this.huffmanTablesDC = [];\n this.resetFrames();\n }\n\n resetFrames() {\n this.frames = [];\n }\n\n parse(data) {\n let offset = 0;\n // const { length } = data;\n function readUint16() {\n const value = (data[offset] << 8) | data[offset + 1];\n offset += 2;\n return value;\n }\n function readDataBlock() {\n const length = readUint16();\n const array = data.subarray(offset, offset + length - 2);\n offset += array.length;\n return array;\n }\n function prepareComponents(frame) {\n let maxH = 0;\n let maxV = 0;\n let component;\n let componentId;\n for (componentId in frame.components) {\n if (frame.components.hasOwnProperty(componentId)) {\n component = frame.components[componentId];\n if (maxH < component.h) {\n maxH = component.h;\n }\n if (maxV < component.v) {\n maxV = component.v;\n }\n }\n }\n const mcusPerLine = Math.ceil(frame.samplesPerLine / 8 / maxH);\n const mcusPerColumn = Math.ceil(frame.scanLines / 8 / maxV);\n for (componentId in frame.components) {\n if (frame.components.hasOwnProperty(componentId)) {\n component = frame.components[componentId];\n const blocksPerLine = Math.ceil(Math.ceil(frame.samplesPerLine / 8) * component.h / maxH);\n const blocksPerColumn = Math.ceil(Math.ceil(frame.scanLines / 8) * component.v / maxV);\n const blocksPerLineForMcu = mcusPerLine * component.h;\n const blocksPerColumnForMcu = mcusPerColumn * component.v;\n const blocks = [];\n for (let i = 0; i < blocksPerColumnForMcu; i++) {\n const row = [];\n for (let j = 0; j < blocksPerLineForMcu; j++) {\n row.push(new Int32Array(64));\n }\n blocks.push(row);\n }\n component.blocksPerLine = blocksPerLine;\n component.blocksPerColumn = blocksPerColumn;\n component.blocks = blocks;\n }\n }\n frame.maxH = maxH;\n frame.maxV = maxV;\n frame.mcusPerLine = mcusPerLine;\n frame.mcusPerColumn = mcusPerColumn;\n }\n\n let fileMarker = readUint16();\n if (fileMarker !== 0xFFD8) { // SOI (Start of Image)\n throw new Error('SOI not found');\n }\n\n fileMarker = readUint16();\n while (fileMarker !== 0xFFD9) { // EOI (End of image)\n switch (fileMarker) {\n case 0xFF00: break;\n case 0xFFE0: // APP0 (Application Specific)\n case 0xFFE1: // APP1\n case 0xFFE2: // APP2\n case 0xFFE3: // APP3\n case 0xFFE4: // APP4\n case 0xFFE5: // APP5\n case 0xFFE6: // APP6\n case 0xFFE7: // APP7\n case 0xFFE8: // APP8\n case 0xFFE9: // APP9\n case 0xFFEA: // APP10\n case 0xFFEB: // APP11\n case 0xFFEC: // APP12\n case 0xFFED: // APP13\n case 0xFFEE: // APP14\n case 0xFFEF: // APP15\n case 0xFFFE: { // COM (Comment)\n const appData = readDataBlock();\n\n if (fileMarker === 0xFFE0) {\n if (appData[0] === 0x4A && appData[1] === 0x46 && appData[2] === 0x49\n && appData[3] === 0x46 && appData[4] === 0) { // 'JFIF\\x00'\n this.jfif = {\n version: { major: appData[5], minor: appData[6] },\n densityUnits: appData[7],\n xDensity: (appData[8] << 8) | appData[9],\n yDensity: (appData[10] << 8) | appData[11],\n thumbWidth: appData[12],\n thumbHeight: appData[13],\n thumbData: appData.subarray(14, 14 + (3 * appData[12] * appData[13])),\n };\n }\n }\n // TODO APP1 - Exif\n if (fileMarker === 0xFFEE) {\n if (appData[0] === 0x41 && appData[1] === 0x64 && appData[2] === 0x6F\n && appData[3] === 0x62 && appData[4] === 0x65 && appData[5] === 0) { // 'Adobe\\x00'\n this.adobe = {\n version: appData[6],\n flags0: (appData[7] << 8) | appData[8],\n flags1: (appData[9] << 8) | appData[10],\n transformCode: appData[11],\n };\n }\n }\n break;\n }\n\n case 0xFFDB: { // DQT (Define Quantization Tables)\n const quantizationTablesLength = readUint16();\n const quantizationTablesEnd = quantizationTablesLength + offset - 2;\n while (offset < quantizationTablesEnd) {\n const quantizationTableSpec = data[offset++];\n const tableData = new Int32Array(64);\n if ((quantizationTableSpec >> 4) === 0) { // 8 bit values\n for (let j = 0; j < 64; j++) {\n const z = dctZigZag[j];\n tableData[z] = data[offset++];\n }\n } else if ((quantizationTableSpec >> 4) === 1) { // 16 bit\n for (let j = 0; j < 64; j++) {\n const z = dctZigZag[j];\n tableData[z] = readUint16();\n }\n } else {\n throw new Error('DQT: invalid table spec');\n }\n this.quantizationTables[quantizationTableSpec & 15] = tableData;\n }\n break;\n }\n\n case 0xFFC0: // SOF0 (Start of Frame, Baseline DCT)\n case 0xFFC1: // SOF1 (Start of Frame, Extended DCT)\n case 0xFFC2: { // SOF2 (Start of Frame, Progressive DCT)\n readUint16(); // skip data length\n const frame = {\n extended: (fileMarker === 0xFFC1),\n progressive: (fileMarker === 0xFFC2),\n precision: data[offset++],\n scanLines: readUint16(),\n samplesPerLine: readUint16(),\n components: {},\n componentsOrder: [],\n };\n\n const componentsCount = data[offset++];\n let componentId;\n // let maxH = 0;\n // let maxV = 0;\n for (let i = 0; i < componentsCount; i++) {\n componentId = data[offset];\n const h = data[offset + 1] >> 4;\n const v = data[offset + 1] & 15;\n const qId = data[offset + 2];\n frame.componentsOrder.push(componentId);\n frame.components[componentId] = {\n h,\n v,\n quantizationIdx: qId,\n };\n offset += 3;\n }\n prepareComponents(frame);\n this.frames.push(frame);\n break;\n }\n\n case 0xFFC4: { // DHT (Define Huffman Tables)\n const huffmanLength = readUint16();\n for (let i = 2; i < huffmanLength;) {\n const huffmanTableSpec = data[offset++];\n const codeLengths = new Uint8Array(16);\n let codeLengthSum = 0;\n for (let j = 0; j < 16; j++, offset++) {\n codeLengths[j] = data[offset];\n codeLengthSum += codeLengths[j];\n }\n const huffmanValues = new Uint8Array(codeLengthSum);\n for (let j = 0; j < codeLengthSum; j++, offset++) {\n huffmanValues[j] = data[offset];\n }\n i += 17 + codeLengthSum;\n\n if ((huffmanTableSpec >> 4) === 0) {\n this.huffmanTablesDC[huffmanTableSpec & 15] = buildHuffmanTable(\n codeLengths, huffmanValues,\n );\n } else {\n this.huffmanTablesAC[huffmanTableSpec & 15] = buildHuffmanTable(\n codeLengths, huffmanValues,\n );\n }\n }\n break;\n }\n\n case 0xFFDD: // DRI (Define Restart Interval)\n readUint16(); // skip data length\n this.resetInterval = readUint16();\n break;\n\n case 0xFFDA: { // SOS (Start of Scan)\n readUint16(); // skip length\n const selectorsCount = data[offset++];\n const components = [];\n const frame = this.frames[0];\n for (let i = 0; i < selectorsCount; i++) {\n const component = frame.components[data[offset++]];\n const tableSpec = data[offset++];\n component.huffmanTableDC = this.huffmanTablesDC[tableSpec >> 4];\n component.huffmanTableAC = this.huffmanTablesAC[tableSpec & 15];\n components.push(component);\n }\n const spectralStart = data[offset++];\n const spectralEnd = data[offset++];\n const successiveApproximation = data[offset++];\n const processed = decodeScan(data, offset,\n frame, components, this.resetInterval,\n spectralStart, spectralEnd,\n successiveApproximation >> 4, successiveApproximation & 15);\n offset += processed;\n break;\n }\n\n case 0xFFFF: // Fill bytes\n if (data[offset] !== 0xFF) { // Avoid skipping a valid marker.\n offset--;\n }\n break;\n\n default:\n if (data[offset - 3] === 0xFF\n && data[offset - 2] >= 0xC0 && data[offset - 2] <= 0xFE) {\n // could be incorrect encoding -- last 0xFF byte of the previous\n // block was eaten by the encoder\n offset -= 3;\n break;\n }\n throw new Error(`unknown JPEG marker ${fileMarker.toString(16)}`);\n }\n fileMarker = readUint16();\n }\n }\n\n getResult() {\n const { frames } = this;\n if (this.frames.length === 0) {\n throw new Error('no frames were decoded');\n } else if (this.frames.length > 1) {\n console.warn('more than one frame is not supported');\n }\n\n // set each frame's components quantization table\n for (let i = 0; i < this.frames.length; i++) {\n const cp = this.frames[i].components;\n for (const j of Object.keys(cp)) {\n cp[j].quantizationTable = this.quantizationTables[cp[j].quantizationIdx];\n delete cp[j].quantizationIdx;\n }\n }\n\n const frame = frames[0];\n const { components, componentsOrder } = frame;\n const outComponents = [];\n const width = frame.samplesPerLine;\n const height = frame.scanLines;\n\n for (let i = 0; i < componentsOrder.length; i++) {\n const component = components[componentsOrder[i]];\n outComponents.push({\n lines: buildComponentData(frame, component),\n scaleX: component.h / frame.maxH,\n scaleY: component.v / frame.maxV,\n });\n }\n\n const out = new Uint8Array(width * height * outComponents.length);\n let oi = 0;\n for (let y = 0; y < height; ++y) {\n for (let x = 0; x < width; ++x) {\n for (let i = 0; i < outComponents.length; ++i) {\n const component = outComponents[i];\n out[oi] = component.lines[0 | y * component.scaleY][0 | x * component.scaleX];\n ++oi;\n }\n }\n }\n return out;\n }\n}\n\nexport default class JpegDecoder extends BaseDecoder {\n constructor(fileDirectory) {\n super();\n this.reader = new JpegStreamReader();\n if (fileDirectory.JPEGTables) {\n this.reader.parse(fileDirectory.JPEGTables);\n }\n }\n\n decodeBlock(buffer) {\n this.reader.resetFrames();\n this.reader.parse(new Uint8Array(buffer));\n return this.reader.getResult().buffer;\n }\n}\n","function decodeRowAcc(row, stride) {\n let length = row.length - stride;\n let offset = 0;\n do {\n for (let i = stride; i > 0; i--) {\n row[offset + stride] += row[offset];\n offset++;\n }\n\n length -= stride;\n } while (length > 0);\n}\n\nfunction decodeRowFloatingPoint(row, stride, bytesPerSample) {\n let index = 0;\n let count = row.length;\n const wc = count / bytesPerSample;\n\n while (count > stride) {\n for (let i = stride; i > 0; --i) {\n row[index + stride] += row[index];\n ++index;\n }\n count -= stride;\n }\n\n const copy = row.slice();\n for (let i = 0; i < wc; ++i) {\n for (let b = 0; b < bytesPerSample; ++b) {\n row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i];\n }\n }\n}\n\nexport function applyPredictor(block, predictor, width, height, bitsPerSample,\n planarConfiguration) {\n if (!predictor || predictor === 1) {\n return block;\n }\n\n for (let i = 0; i < bitsPerSample.length; ++i) {\n if (bitsPerSample[i] % 8 !== 0) {\n throw new Error('When decoding with predictor, only multiple of 8 bits are supported.');\n }\n if (bitsPerSample[i] !== bitsPerSample[0]) {\n throw new Error('When decoding with predictor, all samples must have the same size.');\n }\n }\n\n const bytesPerSample = bitsPerSample[0] / 8;\n const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length;\n\n for (let i = 0; i < height; ++i) {\n // Last strip will be truncated if height % stripHeight != 0\n if (i * stride * width * bytesPerSample >= block.byteLength) {\n break;\n }\n let row;\n if (predictor === 2) { // horizontal prediction\n switch (bitsPerSample[0]) {\n case 8:\n row = new Uint8Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\n );\n break;\n case 16:\n row = new Uint16Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2,\n );\n break;\n case 32:\n row = new Uint32Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4,\n );\n break;\n default:\n throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`);\n }\n decodeRowAcc(row, stride, bytesPerSample);\n } else if (predictor === 3) { // horizontal floating point\n row = new Uint8Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\n );\n decodeRowFloatingPoint(row, stride, bytesPerSample);\n }\n }\n return block;\n}\n"],"sourceRoot":""} \ No newline at end of file diff --git a/dist/2.js b/dist/2.js new file mode 100644 index 0000000..acecd68 --- /dev/null +++ b/dist/2.js @@ -0,0 +1,287 @@ +(window["webpackJsonp"] = window["webpackJsonp"] || []).push([[2],{ + +/***/ "../node_modules/geotiff/src/compression/basedecoder.js": +/*!**************************************************************!*\ + !*** ../node_modules/geotiff/src/compression/basedecoder.js ***! + \**************************************************************/ +/*! exports provided: default */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return BaseDecoder; }); +/* harmony import */ var _predictor__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../predictor */ "../node_modules/geotiff/src/predictor.js"); + + +class BaseDecoder { + async decode(fileDirectory, buffer) { + const decoded = await this.decodeBlock(buffer); + const predictor = fileDirectory.Predictor || 1; + if (predictor !== 1) { + const isTiled = !fileDirectory.StripOffsets; + const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth; + const tileHeight = isTiled ? fileDirectory.TileLength : ( + fileDirectory.RowsPerStrip || fileDirectory.ImageLength + ); + return Object(_predictor__WEBPACK_IMPORTED_MODULE_0__["applyPredictor"])( + decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample, + fileDirectory.PlanarConfiguration, + ); + } + return decoded; + } +} + + +/***/ }), + +/***/ "../node_modules/geotiff/src/compression/lzw.js": +/*!******************************************************!*\ + !*** ../node_modules/geotiff/src/compression/lzw.js ***! + \******************************************************/ +/*! exports provided: default */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return LZWDecoder; }); +/* harmony import */ var _basedecoder__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./basedecoder */ "../node_modules/geotiff/src/compression/basedecoder.js"); + + +const MIN_BITS = 9; +const CLEAR_CODE = 256; // clear code +const EOI_CODE = 257; // end of information +const MAX_BYTELENGTH = 12; + +function getByte(array, position, length) { + const d = position % 8; + const a = Math.floor(position / 8); + const de = 8 - d; + const ef = (position + length) - ((a + 1) * 8); + let fg = (8 * (a + 2)) - (position + length); + const dg = ((a + 2) * 8) - position; + fg = Math.max(0, fg); + if (a >= array.length) { + console.warn('ran off the end of the buffer before finding EOI_CODE (end on input code)'); + return EOI_CODE; + } + let chunk1 = array[a] & ((2 ** (8 - d)) - 1); + chunk1 <<= (length - de); + let chunks = chunk1; + if (a + 1 < array.length) { + let chunk2 = array[a + 1] >>> fg; + chunk2 <<= Math.max(0, (length - dg)); + chunks += chunk2; + } + if (ef > 8 && a + 2 < array.length) { + const hi = ((a + 3) * 8) - (position + length); + const chunk3 = array[a + 2] >>> hi; + chunks += chunk3; + } + return chunks; +} + +function appendReversed(dest, source) { + for (let i = source.length - 1; i >= 0; i--) { + dest.push(source[i]); + } + return dest; +} + +function decompress(input) { + const dictionaryIndex = new Uint16Array(4093); + const dictionaryChar = new Uint8Array(4093); + for (let i = 0; i <= 257; i++) { + dictionaryIndex[i] = 4096; + dictionaryChar[i] = i; + } + let dictionaryLength = 258; + let byteLength = MIN_BITS; + let position = 0; + + function initDictionary() { + dictionaryLength = 258; + byteLength = MIN_BITS; + } + function getNext(array) { + const byte = getByte(array, position, byteLength); + position += byteLength; + return byte; + } + function addToDictionary(i, c) { + dictionaryChar[dictionaryLength] = c; + dictionaryIndex[dictionaryLength] = i; + dictionaryLength++; + return dictionaryLength - 1; + } + function getDictionaryReversed(n) { + const rev = []; + for (let i = n; i !== 4096; i = dictionaryIndex[i]) { + rev.push(dictionaryChar[i]); + } + return rev; + } + + const result = []; + initDictionary(); + const array = new Uint8Array(input); + let code = getNext(array); + let oldCode; + while (code !== EOI_CODE) { + if (code === CLEAR_CODE) { + initDictionary(); + code = getNext(array); + while (code === CLEAR_CODE) { + code = getNext(array); + } + + if (code === EOI_CODE) { + break; + } else if (code > CLEAR_CODE) { + throw new Error(`corrupted code at scanline ${code}`); + } else { + const val = getDictionaryReversed(code); + appendReversed(result, val); + oldCode = code; + } + } else if (code < dictionaryLength) { + const val = getDictionaryReversed(code); + appendReversed(result, val); + addToDictionary(oldCode, val[val.length - 1]); + oldCode = code; + } else { + const oldVal = getDictionaryReversed(oldCode); + if (!oldVal) { + throw new Error(`Bogus entry. Not in dictionary, ${oldCode} / ${dictionaryLength}, position: ${position}`); + } + appendReversed(result, oldVal); + result.push(oldVal[oldVal.length - 1]); + addToDictionary(oldCode, oldVal[oldVal.length - 1]); + oldCode = code; + } + + if (dictionaryLength + 1 >= (2 ** byteLength)) { + if (byteLength === MAX_BYTELENGTH) { + oldCode = undefined; + } else { + byteLength++; + } + } + code = getNext(array); + } + return new Uint8Array(result); +} + +class LZWDecoder extends _basedecoder__WEBPACK_IMPORTED_MODULE_0__["default"] { + decodeBlock(buffer) { + return decompress(buffer, false).buffer; + } +} + + +/***/ }), + +/***/ "../node_modules/geotiff/src/predictor.js": +/*!************************************************!*\ + !*** ../node_modules/geotiff/src/predictor.js ***! + \************************************************/ +/*! exports provided: applyPredictor */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "applyPredictor", function() { return applyPredictor; }); +function decodeRowAcc(row, stride) { + let length = row.length - stride; + let offset = 0; + do { + for (let i = stride; i > 0; i--) { + row[offset + stride] += row[offset]; + offset++; + } + + length -= stride; + } while (length > 0); +} + +function decodeRowFloatingPoint(row, stride, bytesPerSample) { + let index = 0; + let count = row.length; + const wc = count / bytesPerSample; + + while (count > stride) { + for (let i = stride; i > 0; --i) { + row[index + stride] += row[index]; + ++index; + } + count -= stride; + } + + const copy = row.slice(); + for (let i = 0; i < wc; ++i) { + for (let b = 0; b < bytesPerSample; ++b) { + row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i]; + } + } +} + +function applyPredictor(block, predictor, width, height, bitsPerSample, + planarConfiguration) { + if (!predictor || predictor === 1) { + return block; + } + + for (let i = 0; i < bitsPerSample.length; ++i) { + if (bitsPerSample[i] % 8 !== 0) { + throw new Error('When decoding with predictor, only multiple of 8 bits are supported.'); + } + if (bitsPerSample[i] !== bitsPerSample[0]) { + throw new Error('When decoding with predictor, all samples must have the same size.'); + } + } + + const bytesPerSample = bitsPerSample[0] / 8; + const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length; + + for (let i = 0; i < height; ++i) { + // Last strip will be truncated if height % stripHeight != 0 + if (i * stride * width * bytesPerSample >= block.byteLength) { + break; + } + let row; + if (predictor === 2) { // horizontal prediction + switch (bitsPerSample[0]) { + case 8: + row = new Uint8Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample, + ); + break; + case 16: + row = new Uint16Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2, + ); + break; + case 32: + row = new Uint32Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4, + ); + break; + default: + throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`); + } + decodeRowAcc(row, stride, bytesPerSample); + } else if (predictor === 3) { // horizontal floating point + row = new Uint8Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample, + ); + decodeRowFloatingPoint(row, stride, bytesPerSample); + } + } + return block; +} + + +/***/ }) + +}]); +//# sourceMappingURL=2.js.map \ No newline at end of file diff --git a/dist/2.js.map b/dist/2.js.map new file mode 100644 index 0000000..0fe5754 --- /dev/null +++ b/dist/2.js.map @@ -0,0 +1 @@ +{"version":3,"sources":["webpack:///../node_modules/geotiff/src/compression/basedecoder.js","webpack:///../node_modules/geotiff/src/compression/lzw.js","webpack:///../node_modules/geotiff/src/predictor.js"],"names":[],"mappings":";;;;;;;;;;AAAA;AAAA;AAAA;AAA8C;;AAE/B;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,iEAAc;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACnBA;AAAA;AAAA;AAAwC;;AAExC;AACA,uBAAuB;AACvB,qBAAqB;AACrB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iCAAiC,QAAQ;AACzC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,iBAAiB,UAAU;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,YAAY;AAC/B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP,sDAAsD,KAAK;AAC3D,OAAO;AACP;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,2DAA2D,QAAQ,KAAK,iBAAiB,cAAc,SAAS;AAChH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe,yBAAyB,oDAAW;AACnD;AACA;AACA;AACA;;;;;;;;;;;;;AClIA;AAAA;AAAA;AACA;AACA;AACA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;;AAEA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,QAAQ;AACzB,mBAAmB,oBAAoB;AACvC;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;;AAEA,iBAAiB,0BAA0B;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,iBAAiB,YAAY;AAC7B;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0DAA0D,iBAAiB;AAC3E;AACA;AACA,KAAK,4BAA4B;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"2.js","sourcesContent":["import { applyPredictor } from '../predictor';\n\nexport default class BaseDecoder {\n async decode(fileDirectory, buffer) {\n const decoded = await this.decodeBlock(buffer);\n const predictor = fileDirectory.Predictor || 1;\n if (predictor !== 1) {\n const isTiled = !fileDirectory.StripOffsets;\n const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth;\n const tileHeight = isTiled ? fileDirectory.TileLength : (\n fileDirectory.RowsPerStrip || fileDirectory.ImageLength\n );\n return applyPredictor(\n decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample,\n fileDirectory.PlanarConfiguration,\n );\n }\n return decoded;\n }\n}\n","import BaseDecoder from './basedecoder';\n\nconst MIN_BITS = 9;\nconst CLEAR_CODE = 256; // clear code\nconst EOI_CODE = 257; // end of information\nconst MAX_BYTELENGTH = 12;\n\nfunction getByte(array, position, length) {\n const d = position % 8;\n const a = Math.floor(position / 8);\n const de = 8 - d;\n const ef = (position + length) - ((a + 1) * 8);\n let fg = (8 * (a + 2)) - (position + length);\n const dg = ((a + 2) * 8) - position;\n fg = Math.max(0, fg);\n if (a >= array.length) {\n console.warn('ran off the end of the buffer before finding EOI_CODE (end on input code)');\n return EOI_CODE;\n }\n let chunk1 = array[a] & ((2 ** (8 - d)) - 1);\n chunk1 <<= (length - de);\n let chunks = chunk1;\n if (a + 1 < array.length) {\n let chunk2 = array[a + 1] >>> fg;\n chunk2 <<= Math.max(0, (length - dg));\n chunks += chunk2;\n }\n if (ef > 8 && a + 2 < array.length) {\n const hi = ((a + 3) * 8) - (position + length);\n const chunk3 = array[a + 2] >>> hi;\n chunks += chunk3;\n }\n return chunks;\n}\n\nfunction appendReversed(dest, source) {\n for (let i = source.length - 1; i >= 0; i--) {\n dest.push(source[i]);\n }\n return dest;\n}\n\nfunction decompress(input) {\n const dictionaryIndex = new Uint16Array(4093);\n const dictionaryChar = new Uint8Array(4093);\n for (let i = 0; i <= 257; i++) {\n dictionaryIndex[i] = 4096;\n dictionaryChar[i] = i;\n }\n let dictionaryLength = 258;\n let byteLength = MIN_BITS;\n let position = 0;\n\n function initDictionary() {\n dictionaryLength = 258;\n byteLength = MIN_BITS;\n }\n function getNext(array) {\n const byte = getByte(array, position, byteLength);\n position += byteLength;\n return byte;\n }\n function addToDictionary(i, c) {\n dictionaryChar[dictionaryLength] = c;\n dictionaryIndex[dictionaryLength] = i;\n dictionaryLength++;\n return dictionaryLength - 1;\n }\n function getDictionaryReversed(n) {\n const rev = [];\n for (let i = n; i !== 4096; i = dictionaryIndex[i]) {\n rev.push(dictionaryChar[i]);\n }\n return rev;\n }\n\n const result = [];\n initDictionary();\n const array = new Uint8Array(input);\n let code = getNext(array);\n let oldCode;\n while (code !== EOI_CODE) {\n if (code === CLEAR_CODE) {\n initDictionary();\n code = getNext(array);\n while (code === CLEAR_CODE) {\n code = getNext(array);\n }\n\n if (code === EOI_CODE) {\n break;\n } else if (code > CLEAR_CODE) {\n throw new Error(`corrupted code at scanline ${code}`);\n } else {\n const val = getDictionaryReversed(code);\n appendReversed(result, val);\n oldCode = code;\n }\n } else if (code < dictionaryLength) {\n const val = getDictionaryReversed(code);\n appendReversed(result, val);\n addToDictionary(oldCode, val[val.length - 1]);\n oldCode = code;\n } else {\n const oldVal = getDictionaryReversed(oldCode);\n if (!oldVal) {\n throw new Error(`Bogus entry. Not in dictionary, ${oldCode} / ${dictionaryLength}, position: ${position}`);\n }\n appendReversed(result, oldVal);\n result.push(oldVal[oldVal.length - 1]);\n addToDictionary(oldCode, oldVal[oldVal.length - 1]);\n oldCode = code;\n }\n\n if (dictionaryLength + 1 >= (2 ** byteLength)) {\n if (byteLength === MAX_BYTELENGTH) {\n oldCode = undefined;\n } else {\n byteLength++;\n }\n }\n code = getNext(array);\n }\n return new Uint8Array(result);\n}\n\nexport default class LZWDecoder extends BaseDecoder {\n decodeBlock(buffer) {\n return decompress(buffer, false).buffer;\n }\n}\n","function decodeRowAcc(row, stride) {\n let length = row.length - stride;\n let offset = 0;\n do {\n for (let i = stride; i > 0; i--) {\n row[offset + stride] += row[offset];\n offset++;\n }\n\n length -= stride;\n } while (length > 0);\n}\n\nfunction decodeRowFloatingPoint(row, stride, bytesPerSample) {\n let index = 0;\n let count = row.length;\n const wc = count / bytesPerSample;\n\n while (count > stride) {\n for (let i = stride; i > 0; --i) {\n row[index + stride] += row[index];\n ++index;\n }\n count -= stride;\n }\n\n const copy = row.slice();\n for (let i = 0; i < wc; ++i) {\n for (let b = 0; b < bytesPerSample; ++b) {\n row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i];\n }\n }\n}\n\nexport function applyPredictor(block, predictor, width, height, bitsPerSample,\n planarConfiguration) {\n if (!predictor || predictor === 1) {\n return block;\n }\n\n for (let i = 0; i < bitsPerSample.length; ++i) {\n if (bitsPerSample[i] % 8 !== 0) {\n throw new Error('When decoding with predictor, only multiple of 8 bits are supported.');\n }\n if (bitsPerSample[i] !== bitsPerSample[0]) {\n throw new Error('When decoding with predictor, all samples must have the same size.');\n }\n }\n\n const bytesPerSample = bitsPerSample[0] / 8;\n const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length;\n\n for (let i = 0; i < height; ++i) {\n // Last strip will be truncated if height % stripHeight != 0\n if (i * stride * width * bytesPerSample >= block.byteLength) {\n break;\n }\n let row;\n if (predictor === 2) { // horizontal prediction\n switch (bitsPerSample[0]) {\n case 8:\n row = new Uint8Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\n );\n break;\n case 16:\n row = new Uint16Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2,\n );\n break;\n case 32:\n row = new Uint32Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4,\n );\n break;\n default:\n throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`);\n }\n decodeRowAcc(row, stride, bytesPerSample);\n } else if (predictor === 3) { // horizontal floating point\n row = new Uint8Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\n );\n decodeRowFloatingPoint(row, stride, bytesPerSample);\n }\n }\n return block;\n}\n"],"sourceRoot":""} \ No newline at end of file diff --git a/dist/3.js b/dist/3.js new file mode 100644 index 0000000..fdbc055 --- /dev/null +++ b/dist/3.js @@ -0,0 +1,182 @@ +(window["webpackJsonp"] = window["webpackJsonp"] || []).push([[3],{ + +/***/ "../node_modules/geotiff/src/compression/basedecoder.js": +/*!**************************************************************!*\ + !*** ../node_modules/geotiff/src/compression/basedecoder.js ***! + \**************************************************************/ +/*! exports provided: default */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return BaseDecoder; }); +/* harmony import */ var _predictor__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../predictor */ "../node_modules/geotiff/src/predictor.js"); + + +class BaseDecoder { + async decode(fileDirectory, buffer) { + const decoded = await this.decodeBlock(buffer); + const predictor = fileDirectory.Predictor || 1; + if (predictor !== 1) { + const isTiled = !fileDirectory.StripOffsets; + const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth; + const tileHeight = isTiled ? fileDirectory.TileLength : ( + fileDirectory.RowsPerStrip || fileDirectory.ImageLength + ); + return Object(_predictor__WEBPACK_IMPORTED_MODULE_0__["applyPredictor"])( + decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample, + fileDirectory.PlanarConfiguration, + ); + } + return decoded; + } +} + + +/***/ }), + +/***/ "../node_modules/geotiff/src/compression/packbits.js": +/*!***********************************************************!*\ + !*** ../node_modules/geotiff/src/compression/packbits.js ***! + \***********************************************************/ +/*! exports provided: default */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return PackbitsDecoder; }); +/* harmony import */ var _basedecoder__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./basedecoder */ "../node_modules/geotiff/src/compression/basedecoder.js"); + + +class PackbitsDecoder extends _basedecoder__WEBPACK_IMPORTED_MODULE_0__["default"] { + decodeBlock(buffer) { + const dataView = new DataView(buffer); + const out = []; + + for (let i = 0; i < buffer.byteLength; ++i) { + let header = dataView.getInt8(i); + if (header < 0) { + const next = dataView.getUint8(i + 1); + header = -header; + for (let j = 0; j <= header; ++j) { + out.push(next); + } + i += 1; + } else { + for (let j = 0; j <= header; ++j) { + out.push(dataView.getUint8(i + j + 1)); + } + i += header + 1; + } + } + return new Uint8Array(out).buffer; + } +} + + +/***/ }), + +/***/ "../node_modules/geotiff/src/predictor.js": +/*!************************************************!*\ + !*** ../node_modules/geotiff/src/predictor.js ***! + \************************************************/ +/*! exports provided: applyPredictor */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "applyPredictor", function() { return applyPredictor; }); +function decodeRowAcc(row, stride) { + let length = row.length - stride; + let offset = 0; + do { + for (let i = stride; i > 0; i--) { + row[offset + stride] += row[offset]; + offset++; + } + + length -= stride; + } while (length > 0); +} + +function decodeRowFloatingPoint(row, stride, bytesPerSample) { + let index = 0; + let count = row.length; + const wc = count / bytesPerSample; + + while (count > stride) { + for (let i = stride; i > 0; --i) { + row[index + stride] += row[index]; + ++index; + } + count -= stride; + } + + const copy = row.slice(); + for (let i = 0; i < wc; ++i) { + for (let b = 0; b < bytesPerSample; ++b) { + row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i]; + } + } +} + +function applyPredictor(block, predictor, width, height, bitsPerSample, + planarConfiguration) { + if (!predictor || predictor === 1) { + return block; + } + + for (let i = 0; i < bitsPerSample.length; ++i) { + if (bitsPerSample[i] % 8 !== 0) { + throw new Error('When decoding with predictor, only multiple of 8 bits are supported.'); + } + if (bitsPerSample[i] !== bitsPerSample[0]) { + throw new Error('When decoding with predictor, all samples must have the same size.'); + } + } + + const bytesPerSample = bitsPerSample[0] / 8; + const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length; + + for (let i = 0; i < height; ++i) { + // Last strip will be truncated if height % stripHeight != 0 + if (i * stride * width * bytesPerSample >= block.byteLength) { + break; + } + let row; + if (predictor === 2) { // horizontal prediction + switch (bitsPerSample[0]) { + case 8: + row = new Uint8Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample, + ); + break; + case 16: + row = new Uint16Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2, + ); + break; + case 32: + row = new Uint32Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4, + ); + break; + default: + throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`); + } + decodeRowAcc(row, stride, bytesPerSample); + } else if (predictor === 3) { // horizontal floating point + row = new Uint8Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample, + ); + decodeRowFloatingPoint(row, stride, bytesPerSample); + } + } + return block; +} + + +/***/ }) + +}]); +//# sourceMappingURL=3.js.map \ No newline at end of file diff --git a/dist/3.js.map b/dist/3.js.map new file mode 100644 index 0000000..00b2a44 --- /dev/null +++ b/dist/3.js.map @@ -0,0 +1 @@ +{"version":3,"sources":["webpack:///../node_modules/geotiff/src/compression/basedecoder.js","webpack:///../node_modules/geotiff/src/compression/packbits.js","webpack:///../node_modules/geotiff/src/predictor.js"],"names":[],"mappings":";;;;;;;;;;AAAA;AAAA;AAAA;AAA8C;;AAE/B;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,iEAAc;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACnBA;AAAA;AAAA;AAAwC;;AAEzB,8BAA8B,oDAAW;AACxD;AACA;AACA;;AAEA,mBAAmB,uBAAuB;AAC1C;AACA;AACA;AACA;AACA,uBAAuB,aAAa;AACpC;AACA;AACA;AACA,OAAO;AACP,uBAAuB,aAAa;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACzBA;AAAA;AAAA;AACA;AACA;AACA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;;AAEA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,QAAQ;AACzB,mBAAmB,oBAAoB;AACvC;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;;AAEA,iBAAiB,0BAA0B;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,iBAAiB,YAAY;AAC7B;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0DAA0D,iBAAiB;AAC3E;AACA;AACA,KAAK,4BAA4B;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"3.js","sourcesContent":["import { applyPredictor } from '../predictor';\n\nexport default class BaseDecoder {\n async decode(fileDirectory, buffer) {\n const decoded = await this.decodeBlock(buffer);\n const predictor = fileDirectory.Predictor || 1;\n if (predictor !== 1) {\n const isTiled = !fileDirectory.StripOffsets;\n const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth;\n const tileHeight = isTiled ? fileDirectory.TileLength : (\n fileDirectory.RowsPerStrip || fileDirectory.ImageLength\n );\n return applyPredictor(\n decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample,\n fileDirectory.PlanarConfiguration,\n );\n }\n return decoded;\n }\n}\n","import BaseDecoder from './basedecoder';\n\nexport default class PackbitsDecoder extends BaseDecoder {\n decodeBlock(buffer) {\n const dataView = new DataView(buffer);\n const out = [];\n\n for (let i = 0; i < buffer.byteLength; ++i) {\n let header = dataView.getInt8(i);\n if (header < 0) {\n const next = dataView.getUint8(i + 1);\n header = -header;\n for (let j = 0; j <= header; ++j) {\n out.push(next);\n }\n i += 1;\n } else {\n for (let j = 0; j <= header; ++j) {\n out.push(dataView.getUint8(i + j + 1));\n }\n i += header + 1;\n }\n }\n return new Uint8Array(out).buffer;\n }\n}\n","function decodeRowAcc(row, stride) {\n let length = row.length - stride;\n let offset = 0;\n do {\n for (let i = stride; i > 0; i--) {\n row[offset + stride] += row[offset];\n offset++;\n }\n\n length -= stride;\n } while (length > 0);\n}\n\nfunction decodeRowFloatingPoint(row, stride, bytesPerSample) {\n let index = 0;\n let count = row.length;\n const wc = count / bytesPerSample;\n\n while (count > stride) {\n for (let i = stride; i > 0; --i) {\n row[index + stride] += row[index];\n ++index;\n }\n count -= stride;\n }\n\n const copy = row.slice();\n for (let i = 0; i < wc; ++i) {\n for (let b = 0; b < bytesPerSample; ++b) {\n row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i];\n }\n }\n}\n\nexport function applyPredictor(block, predictor, width, height, bitsPerSample,\n planarConfiguration) {\n if (!predictor || predictor === 1) {\n return block;\n }\n\n for (let i = 0; i < bitsPerSample.length; ++i) {\n if (bitsPerSample[i] % 8 !== 0) {\n throw new Error('When decoding with predictor, only multiple of 8 bits are supported.');\n }\n if (bitsPerSample[i] !== bitsPerSample[0]) {\n throw new Error('When decoding with predictor, all samples must have the same size.');\n }\n }\n\n const bytesPerSample = bitsPerSample[0] / 8;\n const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length;\n\n for (let i = 0; i < height; ++i) {\n // Last strip will be truncated if height % stripHeight != 0\n if (i * stride * width * bytesPerSample >= block.byteLength) {\n break;\n }\n let row;\n if (predictor === 2) { // horizontal prediction\n switch (bitsPerSample[0]) {\n case 8:\n row = new Uint8Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\n );\n break;\n case 16:\n row = new Uint16Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2,\n );\n break;\n case 32:\n row = new Uint32Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4,\n );\n break;\n default:\n throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`);\n }\n decodeRowAcc(row, stride, bytesPerSample);\n } else if (predictor === 3) { // horizontal floating point\n row = new Uint8Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\n );\n decodeRowFloatingPoint(row, stride, bytesPerSample);\n }\n }\n return block;\n}\n"],"sourceRoot":""} \ No newline at end of file diff --git a/dist/4.js b/dist/4.js new file mode 100644 index 0000000..80d330a --- /dev/null +++ b/dist/4.js @@ -0,0 +1,163 @@ +(window["webpackJsonp"] = window["webpackJsonp"] || []).push([[4],{ + +/***/ "../node_modules/geotiff/src/compression/basedecoder.js": +/*!**************************************************************!*\ + !*** ../node_modules/geotiff/src/compression/basedecoder.js ***! + \**************************************************************/ +/*! exports provided: default */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return BaseDecoder; }); +/* harmony import */ var _predictor__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../predictor */ "../node_modules/geotiff/src/predictor.js"); + + +class BaseDecoder { + async decode(fileDirectory, buffer) { + const decoded = await this.decodeBlock(buffer); + const predictor = fileDirectory.Predictor || 1; + if (predictor !== 1) { + const isTiled = !fileDirectory.StripOffsets; + const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth; + const tileHeight = isTiled ? fileDirectory.TileLength : ( + fileDirectory.RowsPerStrip || fileDirectory.ImageLength + ); + return Object(_predictor__WEBPACK_IMPORTED_MODULE_0__["applyPredictor"])( + decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample, + fileDirectory.PlanarConfiguration, + ); + } + return decoded; + } +} + + +/***/ }), + +/***/ "../node_modules/geotiff/src/compression/raw.js": +/*!******************************************************!*\ + !*** ../node_modules/geotiff/src/compression/raw.js ***! + \******************************************************/ +/*! exports provided: default */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return RawDecoder; }); +/* harmony import */ var _basedecoder__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./basedecoder */ "../node_modules/geotiff/src/compression/basedecoder.js"); + + +class RawDecoder extends _basedecoder__WEBPACK_IMPORTED_MODULE_0__["default"] { + decodeBlock(buffer) { + return buffer; + } +} + + +/***/ }), + +/***/ "../node_modules/geotiff/src/predictor.js": +/*!************************************************!*\ + !*** ../node_modules/geotiff/src/predictor.js ***! + \************************************************/ +/*! exports provided: applyPredictor */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "applyPredictor", function() { return applyPredictor; }); +function decodeRowAcc(row, stride) { + let length = row.length - stride; + let offset = 0; + do { + for (let i = stride; i > 0; i--) { + row[offset + stride] += row[offset]; + offset++; + } + + length -= stride; + } while (length > 0); +} + +function decodeRowFloatingPoint(row, stride, bytesPerSample) { + let index = 0; + let count = row.length; + const wc = count / bytesPerSample; + + while (count > stride) { + for (let i = stride; i > 0; --i) { + row[index + stride] += row[index]; + ++index; + } + count -= stride; + } + + const copy = row.slice(); + for (let i = 0; i < wc; ++i) { + for (let b = 0; b < bytesPerSample; ++b) { + row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i]; + } + } +} + +function applyPredictor(block, predictor, width, height, bitsPerSample, + planarConfiguration) { + if (!predictor || predictor === 1) { + return block; + } + + for (let i = 0; i < bitsPerSample.length; ++i) { + if (bitsPerSample[i] % 8 !== 0) { + throw new Error('When decoding with predictor, only multiple of 8 bits are supported.'); + } + if (bitsPerSample[i] !== bitsPerSample[0]) { + throw new Error('When decoding with predictor, all samples must have the same size.'); + } + } + + const bytesPerSample = bitsPerSample[0] / 8; + const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length; + + for (let i = 0; i < height; ++i) { + // Last strip will be truncated if height % stripHeight != 0 + if (i * stride * width * bytesPerSample >= block.byteLength) { + break; + } + let row; + if (predictor === 2) { // horizontal prediction + switch (bitsPerSample[0]) { + case 8: + row = new Uint8Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample, + ); + break; + case 16: + row = new Uint16Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2, + ); + break; + case 32: + row = new Uint32Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4, + ); + break; + default: + throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`); + } + decodeRowAcc(row, stride, bytesPerSample); + } else if (predictor === 3) { // horizontal floating point + row = new Uint8Array( + block, i * stride * width * bytesPerSample, stride * width * bytesPerSample, + ); + decodeRowFloatingPoint(row, stride, bytesPerSample); + } + } + return block; +} + + +/***/ }) + +}]); +//# sourceMappingURL=4.js.map \ No newline at end of file diff --git a/dist/4.js.map b/dist/4.js.map new file mode 100644 index 0000000..d55de49 --- /dev/null +++ b/dist/4.js.map @@ -0,0 +1 @@ +{"version":3,"sources":["webpack:///../node_modules/geotiff/src/compression/basedecoder.js","webpack:///../node_modules/geotiff/src/compression/raw.js","webpack:///../node_modules/geotiff/src/predictor.js"],"names":[],"mappings":";;;;;;;;;;AAAA;AAAA;AAAA;AAA8C;;AAE/B;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,iEAAc;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACnBA;AAAA;AAAA;AAAwC;;AAEzB,yBAAyB,oDAAW;AACnD;AACA;AACA;AACA;;;;;;;;;;;;;ACNA;AAAA;AAAA;AACA;AACA;AACA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;;AAEA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,QAAQ;AACzB,mBAAmB,oBAAoB;AACvC;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;;AAEA,iBAAiB,0BAA0B;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,iBAAiB,YAAY;AAC7B;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0DAA0D,iBAAiB;AAC3E;AACA;AACA,KAAK,4BAA4B;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"4.js","sourcesContent":["import { applyPredictor } from '../predictor';\n\nexport default class BaseDecoder {\n async decode(fileDirectory, buffer) {\n const decoded = await this.decodeBlock(buffer);\n const predictor = fileDirectory.Predictor || 1;\n if (predictor !== 1) {\n const isTiled = !fileDirectory.StripOffsets;\n const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth;\n const tileHeight = isTiled ? fileDirectory.TileLength : (\n fileDirectory.RowsPerStrip || fileDirectory.ImageLength\n );\n return applyPredictor(\n decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample,\n fileDirectory.PlanarConfiguration,\n );\n }\n return decoded;\n }\n}\n","import BaseDecoder from './basedecoder';\n\nexport default class RawDecoder extends BaseDecoder {\n decodeBlock(buffer) {\n return buffer;\n }\n}\n","function decodeRowAcc(row, stride) {\n let length = row.length - stride;\n let offset = 0;\n do {\n for (let i = stride; i > 0; i--) {\n row[offset + stride] += row[offset];\n offset++;\n }\n\n length -= stride;\n } while (length > 0);\n}\n\nfunction decodeRowFloatingPoint(row, stride, bytesPerSample) {\n let index = 0;\n let count = row.length;\n const wc = count / bytesPerSample;\n\n while (count > stride) {\n for (let i = stride; i > 0; --i) {\n row[index + stride] += row[index];\n ++index;\n }\n count -= stride;\n }\n\n const copy = row.slice();\n for (let i = 0; i < wc; ++i) {\n for (let b = 0; b < bytesPerSample; ++b) {\n row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i];\n }\n }\n}\n\nexport function applyPredictor(block, predictor, width, height, bitsPerSample,\n planarConfiguration) {\n if (!predictor || predictor === 1) {\n return block;\n }\n\n for (let i = 0; i < bitsPerSample.length; ++i) {\n if (bitsPerSample[i] % 8 !== 0) {\n throw new Error('When decoding with predictor, only multiple of 8 bits are supported.');\n }\n if (bitsPerSample[i] !== bitsPerSample[0]) {\n throw new Error('When decoding with predictor, all samples must have the same size.');\n }\n }\n\n const bytesPerSample = bitsPerSample[0] / 8;\n const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length;\n\n for (let i = 0; i < height; ++i) {\n // Last strip will be truncated if height % stripHeight != 0\n if (i * stride * width * bytesPerSample >= block.byteLength) {\n break;\n }\n let row;\n if (predictor === 2) { // horizontal prediction\n switch (bitsPerSample[0]) {\n case 8:\n row = new Uint8Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\n );\n break;\n case 16:\n row = new Uint16Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2,\n );\n break;\n case 32:\n row = new Uint32Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4,\n );\n break;\n default:\n throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`);\n }\n decodeRowAcc(row, stride, bytesPerSample);\n } else if (predictor === 3) { // horizontal floating point\n row = new Uint8Array(\n block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\n );\n decodeRowFloatingPoint(row, stride, bytesPerSample);\n }\n }\n return block;\n}\n"],"sourceRoot":""} \ No newline at end of file diff --git a/dist/5.js b/dist/5.js new file mode 100644 index 0000000..8c63c28 --- /dev/null +++ b/dist/5.js @@ -0,0 +1,2382 @@ +(window["webpackJsonp"] = window["webpackJsonp"] || []).push([[5],{ + +/***/ "../node_modules/geotiff/src/compression/lerc.js": +/*!*******************************************************!*\ + !*** ../node_modules/geotiff/src/compression/lerc.js ***! + \*******************************************************/ +/*! exports provided: default */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return LercDecoder; }); +/* harmony import */ var pako__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! pako */ "../node_modules/geotiff/node_modules/pako/dist/pako.esm.mjs"); +/* harmony import */ var lerc__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lerc */ "../node_modules/lerc/LercDecode.js"); +/* harmony import */ var lerc__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(lerc__WEBPACK_IMPORTED_MODULE_1__); +/* harmony import */ var _basedecoder__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./basedecoder */ "../node_modules/geotiff/src/compression/basedecoder.js"); +/* harmony import */ var _globals__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../globals */ "../node_modules/geotiff/src/globals.js"); + + + + + +class LercDecoder extends _basedecoder__WEBPACK_IMPORTED_MODULE_2__["default"] { + constructor(fileDirectory) { + super(); + + this.planarConfiguration = typeof fileDirectory.PlanarConfiguration !== 'undefined' ? fileDirectory.PlanarConfiguration : 1; + this.samplesPerPixel = typeof fileDirectory.SamplesPerPixel !== 'undefined' ? fileDirectory.SamplesPerPixel : 1; + + this.addCompression = fileDirectory.LercParameters[_globals__WEBPACK_IMPORTED_MODULE_3__["LercParameters"].AddCompression]; + } + + decodeBlock(buffer) { + switch (this.addCompression) { + case _globals__WEBPACK_IMPORTED_MODULE_3__["LercAddCompression"].None: + break; + case _globals__WEBPACK_IMPORTED_MODULE_3__["LercAddCompression"].Deflate: + buffer = Object(pako__WEBPACK_IMPORTED_MODULE_0__["inflate"])(new Uint8Array(buffer)).buffer; // eslint-disable-line no-param-reassign, prefer-destructuring + break; + default: + throw new Error(`Unsupported LERC additional compression method identifier: ${this.addCompression}`); + } + + const lercResult = lerc__WEBPACK_IMPORTED_MODULE_1___default.a.decode(buffer, { returnPixelInterleavedDims: this.planarConfiguration === 1 }); + const lercData = lercResult.pixels[0]; + return lercData.buffer; + } +} + + +/***/ }), + +/***/ "../node_modules/lerc/LercDecode.js": +/*!******************************************!*\ + !*** ../node_modules/lerc/LercDecode.js ***! + \******************************************/ +/*! no static exports found */ +/***/ (function(module, exports, __webpack_require__) { + +var __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;/* jshint forin: false, bitwise: false */ +/* +Copyright 2015-2021 Esri + +Licensed under the Apache License, Version 2.0 (the "License"); +you may not use this file except in compliance with the License. +You may obtain a copy of the License at + +http://www.apache.org/licenses/LICENSE-2.0 + +Unless required by applicable law or agreed to in writing, software +distributed under the License is distributed on an "AS IS" BASIS, +WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +See the License for the specific language governing permissions and +limitations under the License. + +A copy of the license and additional notices are located with the +source distribution at: + +http://github.com/Esri/lerc/ + +Contributors: Johannes Schmid, (LERC v1) + Chayanika Khatua, (LERC v1) + Wenxue Ju (LERC v1, v2.x) +*/ + +/* Copyright 2015-2021 Esri. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 @preserve */ + +/** + * a module for decoding LERC blobs + * @module Lerc + */ +(function() { + //this decoder supports all lerc versions, each version has its own class (LercDecode and Lerc2Decode). + //the exported module handles format variation autoamtically. + + //the original LercDecode for Version 1 + var LercDecode = (function() { + + // Note: currently, this module only has an implementation for decoding LERC data, not encoding. The name of + // the class was chosen to be future proof. + + var CntZImage = {}; + + CntZImage.defaultNoDataValue = -3.4027999387901484e+38; // smallest Float32 value + + /** + * Decode a LERC byte stream and return an object containing the pixel data and some required and optional + * information about it, such as the image's width and height. + * + * @param {ArrayBuffer} input The LERC input byte stream + * @param {object} [options] Decoding options, containing any of the following properties: + * @config {number} [inputOffset = 0] + * Skip the first inputOffset bytes of the input byte stream. A valid LERC file is expected at that position. + * @config {Uint8Array} [encodedMask = null] + * If specified, the decoder will not read mask information from the input and use the specified encoded + * mask data instead. Mask header/data must not be present in the LERC byte stream in this case. + * @config {number} [noDataValue = LercCode.defaultNoDataValue] + * Pixel value to use for masked pixels. + * @config {ArrayBufferView|Array} [pixelType = Float32Array] + * The desired type of the pixelData array in the return value. Note that it is the caller's responsibility to + * provide an appropriate noDataValue if the default pixelType is overridden. + * @config {boolean} [returnMask = false] + * If true, the return value will contain a maskData property of type Uint8Array which has one element per + * pixel, the value of which is 1 or 0 depending on whether that pixel's data is present or masked. If the + * input LERC data does not contain a mask, maskData will not be returned. + * @config {boolean} [returnEncodedMask = false] + * If true, the return value will contain a encodedMaskData property, which can be passed into encode() as + * encodedMask. + * @config {boolean} [returnFileInfo = false] + * If true, the return value will have a fileInfo property that contains metadata obtained from the + * LERC headers and the decoding process. + * @config {boolean} [computeUsedBitDepths = false] + * If true, the fileInfo property in the return value will contain the set of all block bit depths + * encountered during decoding. Will only have an effect if returnFileInfo option is true. + * @returns {{width, height, pixelData, minValue, maxValue, noDataValue, maskData, encodedMaskData, fileInfo}} + */ + CntZImage.decode = function(input, options) { + options = options || {}; + + var skipMask = options.encodedMaskData || (options.encodedMaskData === null); + var parsedData = parse(input, options.inputOffset || 0, skipMask); + + var noDataValue = (options.noDataValue !== null) ? options.noDataValue : CntZImage.defaultNoDataValue; + + var uncompressedData = uncompressPixelValues(parsedData, options.pixelType || Float32Array, + options.encodedMaskData, noDataValue, options.returnMask); + + var result = { + width: parsedData.width, + height: parsedData.height, + pixelData: uncompressedData.resultPixels, + minValue: uncompressedData.minValue, + maxValue: parsedData.pixels.maxValue, + noDataValue: noDataValue + }; + + if (uncompressedData.resultMask) { + result.maskData = uncompressedData.resultMask; + } + + if (options.returnEncodedMask && parsedData.mask) { + result.encodedMaskData = parsedData.mask.bitset ? parsedData.mask.bitset : null; + } + + if (options.returnFileInfo) { + result.fileInfo = formatFileInfo(parsedData); + if (options.computeUsedBitDepths) { + result.fileInfo.bitDepths = computeUsedBitDepths(parsedData); + } + } + + return result; + }; + + var uncompressPixelValues = function(data, TypedArrayClass, maskBitset, noDataValue, storeDecodedMask) { + var blockIdx = 0; + var numX = data.pixels.numBlocksX; + var numY = data.pixels.numBlocksY; + var blockWidth = Math.floor(data.width / numX); + var blockHeight = Math.floor(data.height / numY); + var scale = 2 * data.maxZError; + var minValue = Number.MAX_VALUE, currentValue; + maskBitset = maskBitset || ((data.mask) ? data.mask.bitset : null); + + var resultPixels, resultMask; + resultPixels = new TypedArrayClass(data.width * data.height); + if (storeDecodedMask && maskBitset) { + resultMask = new Uint8Array(data.width * data.height); + } + var blockDataBuffer = new Float32Array(blockWidth * blockHeight); + + var xx, yy; + for (var y = 0; y <= numY; y++) { + var thisBlockHeight = (y !== numY) ? blockHeight : (data.height % numY); + if (thisBlockHeight === 0) { + continue; + } + for (var x = 0; x <= numX; x++) { + var thisBlockWidth = (x !== numX) ? blockWidth : (data.width % numX); + if (thisBlockWidth === 0) { + continue; + } + + var outPtr = y * data.width * blockHeight + x * blockWidth; + var outStride = data.width - thisBlockWidth; + + var block = data.pixels.blocks[blockIdx]; + + var blockData, blockPtr, constValue; + if (block.encoding < 2) { + // block is either uncompressed or bit-stuffed (encodings 0 and 1) + if (block.encoding === 0) { + // block is uncompressed + blockData = block.rawData; + } else { + // block is bit-stuffed + unstuff(block.stuffedData, block.bitsPerPixel, block.numValidPixels, block.offset, scale, blockDataBuffer, data.pixels.maxValue); + blockData = blockDataBuffer; + } + blockPtr = 0; + } + else if (block.encoding === 2) { + // block is all 0 + constValue = 0; + } + else { + // block has constant value (encoding === 3) + constValue = block.offset; + } + + var maskByte; + if (maskBitset) { + for (yy = 0; yy < thisBlockHeight; yy++) { + if (outPtr & 7) { + // + maskByte = maskBitset[outPtr >> 3]; + maskByte <<= outPtr & 7; + } + for (xx = 0; xx < thisBlockWidth; xx++) { + if (!(outPtr & 7)) { + // read next byte from mask + maskByte = maskBitset[outPtr >> 3]; + } + if (maskByte & 128) { + // pixel data present + if (resultMask) { + resultMask[outPtr] = 1; + } + currentValue = (block.encoding < 2) ? blockData[blockPtr++] : constValue; + minValue = minValue > currentValue ? currentValue : minValue; + resultPixels[outPtr++] = currentValue; + } else { + // pixel data not present + if (resultMask) { + resultMask[outPtr] = 0; + } + resultPixels[outPtr++] = noDataValue; + } + maskByte <<= 1; + } + outPtr += outStride; + } + } else { + // mask not present, simply copy block over + if (block.encoding < 2) { + // duplicating this code block for performance reasons + // blockData case: + for (yy = 0; yy < thisBlockHeight; yy++) { + for (xx = 0; xx < thisBlockWidth; xx++) { + currentValue = blockData[blockPtr++]; + minValue = minValue > currentValue ? currentValue : minValue; + resultPixels[outPtr++] = currentValue; + } + outPtr += outStride; + } + } + else { + // constValue case: + minValue = minValue > constValue ? constValue : minValue; + for (yy = 0; yy < thisBlockHeight; yy++) { + for (xx = 0; xx < thisBlockWidth; xx++) { + resultPixels[outPtr++] = constValue; + } + outPtr += outStride; + } + } + } + if ((block.encoding === 1) && (blockPtr !== block.numValidPixels)) { + throw "Block and Mask do not match"; + } + blockIdx++; + } + } + + return { + resultPixels: resultPixels, + resultMask: resultMask, + minValue: minValue + }; + }; + + var formatFileInfo = function(data) { + return { + "fileIdentifierString": data.fileIdentifierString, + "fileVersion": data.fileVersion, + "imageType": data.imageType, + "height": data.height, + "width": data.width, + "maxZError": data.maxZError, + "eofOffset": data.eofOffset, + "mask": data.mask ? { + "numBlocksX": data.mask.numBlocksX, + "numBlocksY": data.mask.numBlocksY, + "numBytes": data.mask.numBytes, + "maxValue": data.mask.maxValue + } : null, + "pixels": { + "numBlocksX": data.pixels.numBlocksX, + "numBlocksY": data.pixels.numBlocksY, + "numBytes": data.pixels.numBytes, + "maxValue": data.pixels.maxValue, + "noDataValue": data.noDataValue + } + }; + }; + + var computeUsedBitDepths = function(data) { + var numBlocks = data.pixels.numBlocksX * data.pixels.numBlocksY; + var bitDepths = {}; + for (var i = 0; i < numBlocks; i++) { + var block = data.pixels.blocks[i]; + if (block.encoding === 0) { + bitDepths.float32 = true; + } else if (block.encoding === 1) { + bitDepths[block.bitsPerPixel] = true; + } else { + bitDepths[0] = true; + } + } + + return Object.keys(bitDepths); + }; + + var parse = function(input, fp, skipMask) { + var data = {}; + + // File header + var fileIdView = new Uint8Array(input, fp, 10); + data.fileIdentifierString = String.fromCharCode.apply(null, fileIdView); + if (data.fileIdentifierString.trim() !== "CntZImage") { + throw "Unexpected file identifier string: " + data.fileIdentifierString; + } + fp += 10; + var view = new DataView(input, fp, 24); + data.fileVersion = view.getInt32(0, true); + data.imageType = view.getInt32(4, true); + data.height = view.getUint32(8, true); + data.width = view.getUint32(12, true); + data.maxZError = view.getFloat64(16, true); + fp += 24; + + // Mask Header + if (!skipMask) { + view = new DataView(input, fp, 16); + data.mask = {}; + data.mask.numBlocksY = view.getUint32(0, true); + data.mask.numBlocksX = view.getUint32(4, true); + data.mask.numBytes = view.getUint32(8, true); + data.mask.maxValue = view.getFloat32(12, true); + fp += 16; + + // Mask Data + if (data.mask.numBytes > 0) { + var bitset = new Uint8Array(Math.ceil(data.width * data.height / 8)); + view = new DataView(input, fp, data.mask.numBytes); + var cnt = view.getInt16(0, true); + var ip = 2, op = 0; + do { + if (cnt > 0) { + while (cnt--) { bitset[op++] = view.getUint8(ip++); } + } else { + var val = view.getUint8(ip++); + cnt = -cnt; + while (cnt--) { bitset[op++] = val; } + } + cnt = view.getInt16(ip, true); + ip += 2; + } while (ip < data.mask.numBytes); + if ((cnt !== -32768) || (op < bitset.length)) { + throw "Unexpected end of mask RLE encoding"; + } + data.mask.bitset = bitset; + fp += data.mask.numBytes; + } + else if ((data.mask.numBytes | data.mask.numBlocksY | data.mask.maxValue) === 0) { // Special case, all nodata + data.mask.bitset = new Uint8Array(Math.ceil(data.width * data.height / 8)); + } + } + + // Pixel Header + view = new DataView(input, fp, 16); + data.pixels = {}; + data.pixels.numBlocksY = view.getUint32(0, true); + data.pixels.numBlocksX = view.getUint32(4, true); + data.pixels.numBytes = view.getUint32(8, true); + data.pixels.maxValue = view.getFloat32(12, true); + fp += 16; + + var numBlocksX = data.pixels.numBlocksX; + var numBlocksY = data.pixels.numBlocksY; + // the number of blocks specified in the header does not take into account the blocks at the end of + // each row/column with a special width/height that make the image complete in case the width is not + // evenly divisible by the number of blocks. + var actualNumBlocksX = numBlocksX + ((data.width % numBlocksX) > 0 ? 1 : 0); + var actualNumBlocksY = numBlocksY + ((data.height % numBlocksY) > 0 ? 1 : 0); + data.pixels.blocks = new Array(actualNumBlocksX * actualNumBlocksY); + var blockI = 0; + for (var blockY = 0; blockY < actualNumBlocksY; blockY++) { + for (var blockX = 0; blockX < actualNumBlocksX; blockX++) { + + // Block + var size = 0; + var bytesLeft = input.byteLength - fp; + view = new DataView(input, fp, Math.min(10, bytesLeft)); + var block = {}; + data.pixels.blocks[blockI++] = block; + var headerByte = view.getUint8(0); size++; + block.encoding = headerByte & 63; + if (block.encoding > 3) { + throw "Invalid block encoding (" + block.encoding + ")"; + } + if (block.encoding === 2) { + fp++; + continue; + } + if ((headerByte !== 0) && (headerByte !== 2)) { + headerByte >>= 6; + block.offsetType = headerByte; + if (headerByte === 2) { + block.offset = view.getInt8(1); size++; + } else if (headerByte === 1) { + block.offset = view.getInt16(1, true); size += 2; + } else if (headerByte === 0) { + block.offset = view.getFloat32(1, true); size += 4; + } else { + throw "Invalid block offset type"; + } + + if (block.encoding === 1) { + headerByte = view.getUint8(size); size++; + block.bitsPerPixel = headerByte & 63; + headerByte >>= 6; + block.numValidPixelsType = headerByte; + if (headerByte === 2) { + block.numValidPixels = view.getUint8(size); size++; + } else if (headerByte === 1) { + block.numValidPixels = view.getUint16(size, true); size += 2; + } else if (headerByte === 0) { + block.numValidPixels = view.getUint32(size, true); size += 4; + } else { + throw "Invalid valid pixel count type"; + } + } + } + fp += size; + + if (block.encoding === 3) { + continue; + } + + var arrayBuf, store8; + if (block.encoding === 0) { + var numPixels = (data.pixels.numBytes - 1) / 4; + if (numPixels !== Math.floor(numPixels)) { + throw "uncompressed block has invalid length"; + } + arrayBuf = new ArrayBuffer(numPixels * 4); + store8 = new Uint8Array(arrayBuf); + store8.set(new Uint8Array(input, fp, numPixels * 4)); + var rawData = new Float32Array(arrayBuf); + block.rawData = rawData; + fp += numPixels * 4; + } else if (block.encoding === 1) { + var dataBytes = Math.ceil(block.numValidPixels * block.bitsPerPixel / 8); + var dataWords = Math.ceil(dataBytes / 4); + arrayBuf = new ArrayBuffer(dataWords * 4); + store8 = new Uint8Array(arrayBuf); + store8.set(new Uint8Array(input, fp, dataBytes)); + block.stuffedData = new Uint32Array(arrayBuf); + fp += dataBytes; + } + } + } + data.eofOffset = fp; + return data; + }; + + var unstuff = function(src, bitsPerPixel, numPixels, offset, scale, dest, maxValue) { + var bitMask = (1 << bitsPerPixel) - 1; + var i = 0, o; + var bitsLeft = 0; + var n, buffer; + var nmax = Math.ceil((maxValue - offset) / scale); + // get rid of trailing bytes that are already part of next block + var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8); + src[src.length - 1] <<= 8 * numInvalidTailBytes; + + for (o = 0; o < numPixels; o++) { + if (bitsLeft === 0) { + buffer = src[i++]; + bitsLeft = 32; + } + if (bitsLeft >= bitsPerPixel) { + n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask; + bitsLeft -= bitsPerPixel; + } else { + var missingBits = (bitsPerPixel - bitsLeft); + n = ((buffer & bitMask) << missingBits) & bitMask; + buffer = src[i++]; + bitsLeft = 32 - missingBits; + n += (buffer >>> bitsLeft); + } + //pixel values may exceed max due to quantization + dest[o] = n < nmax ? offset + n * scale : maxValue; + } + return dest; + }; + + return CntZImage; + })(); + + //version 2. Supports 2.1, 2.2, 2.3 + var Lerc2Decode = (function() { + "use strict"; + // Note: currently, this module only has an implementation for decoding LERC data, not encoding. The name of + // the class was chosen to be future proof, following LercDecode. + + /***************************************** + * private static class bitsutffer used by Lerc2Decode + *******************************************/ + var BitStuffer = { + //methods ending with 2 are for the new byte order used by Lerc2.3 and above. + //originalUnstuff is used to unpack Huffman code table. code is duplicated to unstuffx for performance reasons. + unstuff: function(src, dest, bitsPerPixel, numPixels, lutArr, offset, scale, maxValue) { + var bitMask = (1 << bitsPerPixel) - 1; + var i = 0, o; + var bitsLeft = 0; + var n, buffer, missingBits, nmax; + + // get rid of trailing bytes that are already part of next block + var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8); + src[src.length - 1] <<= 8 * numInvalidTailBytes; + if (lutArr) { + for (o = 0; o < numPixels; o++) { + if (bitsLeft === 0) { + buffer = src[i++]; + bitsLeft = 32; + } + if (bitsLeft >= bitsPerPixel) { + n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask; + bitsLeft -= bitsPerPixel; + } + else { + missingBits = (bitsPerPixel - bitsLeft); + n = ((buffer & bitMask) << missingBits) & bitMask; + buffer = src[i++]; + bitsLeft = 32 - missingBits; + n += (buffer >>> bitsLeft); + } + dest[o] = lutArr[n];//offset + lutArr[n] * scale; + } + } + else { + nmax = Math.ceil((maxValue - offset) / scale); + for (o = 0; o < numPixels; o++) { + if (bitsLeft === 0) { + buffer = src[i++]; + bitsLeft = 32; + } + if (bitsLeft >= bitsPerPixel) { + n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask; + bitsLeft -= bitsPerPixel; + } + else { + missingBits = (bitsPerPixel - bitsLeft); + n = ((buffer & bitMask) << missingBits) & bitMask; + buffer = src[i++]; + bitsLeft = 32 - missingBits; + n += (buffer >>> bitsLeft); + } + //pixel values may exceed max due to quantization + dest[o] = n < nmax ? offset + n * scale : maxValue; + } + } + }, + + unstuffLUT: function(src, bitsPerPixel, numPixels, offset, scale, maxValue) { + var bitMask = (1 << bitsPerPixel) - 1; + var i = 0, o = 0, missingBits = 0, bitsLeft = 0, n = 0; + var buffer; + var dest = []; + + // get rid of trailing bytes that are already part of next block + var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8); + src[src.length - 1] <<= 8 * numInvalidTailBytes; + + var nmax = Math.ceil((maxValue - offset) / scale); + for (o = 0; o < numPixels; o++) { + if (bitsLeft === 0) { + buffer = src[i++]; + bitsLeft = 32; + } + if (bitsLeft >= bitsPerPixel) { + n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask; + bitsLeft -= bitsPerPixel; + } else { + missingBits = (bitsPerPixel - bitsLeft); + n = ((buffer & bitMask) << missingBits) & bitMask; + buffer = src[i++]; + bitsLeft = 32 - missingBits; + n += (buffer >>> bitsLeft); + } + //dest.push(n); + dest[o] = n < nmax ? offset + n * scale : maxValue; + } + dest.unshift(offset);//1st one + return dest; + }, + + unstuff2: function(src, dest, bitsPerPixel, numPixels, lutArr, offset, scale, maxValue) { + var bitMask = (1 << bitsPerPixel) - 1; + var i = 0, o; + var bitsLeft = 0, bitPos = 0; + var n, buffer, missingBits; + if (lutArr) { + for (o = 0; o < numPixels; o++) { + if (bitsLeft === 0) { + buffer = src[i++]; + bitsLeft = 32; + bitPos = 0; + } + if (bitsLeft >= bitsPerPixel) { + n = ((buffer >>> bitPos) & bitMask); + bitsLeft -= bitsPerPixel; + bitPos += bitsPerPixel; + } else { + missingBits = (bitsPerPixel - bitsLeft); + n = (buffer >>> bitPos) & bitMask; + buffer = src[i++]; + bitsLeft = 32 - missingBits; + n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits); + bitPos = missingBits; + } + dest[o] = lutArr[n]; + } + } + else { + var nmax = Math.ceil((maxValue - offset) / scale); + for (o = 0; o < numPixels; o++) { + if (bitsLeft === 0) { + buffer = src[i++]; + bitsLeft = 32; + bitPos = 0; + } + if (bitsLeft >= bitsPerPixel) { + //no unsigned left shift + n = ((buffer >>> bitPos) & bitMask); + bitsLeft -= bitsPerPixel; + bitPos += bitsPerPixel; + } else { + missingBits = (bitsPerPixel - bitsLeft); + n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask; + buffer = src[i++]; + bitsLeft = 32 - missingBits; + n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits); + bitPos = missingBits; + } + //pixel values may exceed max due to quantization + dest[o] = n < nmax ? offset + n * scale : maxValue; + } + } + return dest; + }, + + unstuffLUT2: function(src, bitsPerPixel, numPixels, offset, scale, maxValue) { + var bitMask = (1 << bitsPerPixel) - 1; + var i = 0, o = 0, missingBits = 0, bitsLeft = 0, n = 0, bitPos = 0; + var buffer; + var dest = []; + var nmax = Math.ceil((maxValue - offset) / scale); + for (o = 0; o < numPixels; o++) { + if (bitsLeft === 0) { + buffer = src[i++]; + bitsLeft = 32; + bitPos = 0; + } + if (bitsLeft >= bitsPerPixel) { + //no unsigned left shift + n = ((buffer >>> bitPos) & bitMask); + bitsLeft -= bitsPerPixel; + bitPos += bitsPerPixel; + } else { + missingBits = (bitsPerPixel - bitsLeft); + n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask; + buffer = src[i++]; + bitsLeft = 32 - missingBits; + n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits); + bitPos = missingBits; + } + //dest.push(n); + dest[o] = n < nmax ? offset + n * scale : maxValue; + } + dest.unshift(offset); + return dest; + }, + + originalUnstuff: function(src, dest, bitsPerPixel, numPixels) { + var bitMask = (1 << bitsPerPixel) - 1; + var i = 0, o; + var bitsLeft = 0; + var n, buffer, missingBits; + + // get rid of trailing bytes that are already part of next block + var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8); + src[src.length - 1] <<= 8 * numInvalidTailBytes; + + for (o = 0; o < numPixels; o++) { + if (bitsLeft === 0) { + buffer = src[i++]; + bitsLeft = 32; + } + if (bitsLeft >= bitsPerPixel) { + n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask; + bitsLeft -= bitsPerPixel; + } + else { + missingBits = (bitsPerPixel - bitsLeft); + n = ((buffer & bitMask) << missingBits) & bitMask; + buffer = src[i++]; + bitsLeft = 32 - missingBits; + n += (buffer >>> bitsLeft); + } + dest[o] = n; + } + return dest; + }, + + originalUnstuff2: function(src, dest, bitsPerPixel, numPixels) { + var bitMask = (1 << bitsPerPixel) - 1; + var i = 0, o; + var bitsLeft = 0, bitPos = 0; + var n, buffer, missingBits; + //micro-optimizations + for (o = 0; o < numPixels; o++) { + if (bitsLeft === 0) { + buffer = src[i++]; + bitsLeft = 32; + bitPos = 0; + } + if (bitsLeft >= bitsPerPixel) { + //no unsigned left shift + n = ((buffer >>> bitPos) & bitMask); + bitsLeft -= bitsPerPixel; + bitPos += bitsPerPixel; + } else { + missingBits = (bitsPerPixel - bitsLeft); + n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask; + buffer = src[i++]; + bitsLeft = 32 - missingBits; + n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits); + bitPos = missingBits; + } + dest[o] = n; + } + return dest; + } + }; + + /***************************************** + *private static class used by Lerc2Decode + ******************************************/ + var Lerc2Helpers = { + HUFFMAN_LUT_BITS_MAX: 12, //use 2^12 lut, treat it like constant + computeChecksumFletcher32: function(input) { + + var sum1 = 0xffff, sum2 = 0xffff; + var len = input.length; + var words = Math.floor(len / 2); + var i = 0; + while (words) { + var tlen = (words >= 359) ? 359 : words; + words -= tlen; + do { + sum1 += (input[i++] << 8); + sum2 += sum1 += input[i++]; + } while (--tlen); + + sum1 = (sum1 & 0xffff) + (sum1 >>> 16); + sum2 = (sum2 & 0xffff) + (sum2 >>> 16); + } + + // add the straggler byte if it exists + if (len & 1) { + sum2 += sum1 += (input[i] << 8); + } + // second reduction step to reduce sums to 16 bits + sum1 = (sum1 & 0xffff) + (sum1 >>> 16); + sum2 = (sum2 & 0xffff) + (sum2 >>> 16); + + return (sum2 << 16 | sum1) >>> 0; + }, + + readHeaderInfo: function(input, data) { + var ptr = data.ptr; + var fileIdView = new Uint8Array(input, ptr, 6); + var headerInfo = {}; + headerInfo.fileIdentifierString = String.fromCharCode.apply(null, fileIdView); + if (headerInfo.fileIdentifierString.lastIndexOf("Lerc2", 0) !== 0) { + throw "Unexpected file identifier string (expect Lerc2 ): " + headerInfo.fileIdentifierString; + } + ptr += 6; + var view = new DataView(input, ptr, 8); + var fileVersion = view.getInt32(0, true); + headerInfo.fileVersion = fileVersion; + ptr += 4; + if (fileVersion >= 3) { + headerInfo.checksum = view.getUint32(4, true); //nrows + ptr += 4; + } + + //keys start from here + view = new DataView(input, ptr, 12); + headerInfo.height = view.getUint32(0, true); //nrows + headerInfo.width = view.getUint32(4, true); //ncols + ptr += 8; + if (fileVersion >= 4) { + headerInfo.numDims = view.getUint32(8, true); + ptr += 4; + } + else { + headerInfo.numDims = 1; + } + + view = new DataView(input, ptr, 40); + headerInfo.numValidPixel = view.getUint32(0, true); + headerInfo.microBlockSize = view.getInt32(4, true); + headerInfo.blobSize = view.getInt32(8, true); + headerInfo.imageType = view.getInt32(12, true); + + headerInfo.maxZError = view.getFloat64(16, true); + headerInfo.zMin = view.getFloat64(24, true); + headerInfo.zMax = view.getFloat64(32, true); + ptr += 40; + data.headerInfo = headerInfo; + data.ptr = ptr; + + var checksum, keyLength; + if (fileVersion >= 3) { + keyLength = fileVersion >= 4 ? 52 : 48; + checksum = this.computeChecksumFletcher32(new Uint8Array(input, ptr - keyLength, headerInfo.blobSize - 14)); + if (checksum !== headerInfo.checksum) { + throw "Checksum failed."; + } + } + return true; + }, + + checkMinMaxRanges: function(input, data) { + var headerInfo = data.headerInfo; + var OutPixelTypeArray = this.getDataTypeArray(headerInfo.imageType); + var rangeBytes = headerInfo.numDims * this.getDataTypeSize(headerInfo.imageType); + var minValues = this.readSubArray(input, data.ptr, OutPixelTypeArray, rangeBytes); + var maxValues = this.readSubArray(input, data.ptr + rangeBytes, OutPixelTypeArray, rangeBytes); + data.ptr += (2 * rangeBytes); + var i, equal = true; + for (i = 0; i < headerInfo.numDims; i++) { + if (minValues[i] !== maxValues[i]) { + equal = false; + break; + } + } + headerInfo.minValues = minValues; + headerInfo.maxValues = maxValues; + return equal; + }, + + readSubArray: function(input, ptr, OutPixelTypeArray, numBytes) { + var rawData; + if (OutPixelTypeArray === Uint8Array) { + rawData = new Uint8Array(input, ptr, numBytes); + } + else { + var arrayBuf = new ArrayBuffer(numBytes); + var store8 = new Uint8Array(arrayBuf); + store8.set(new Uint8Array(input, ptr, numBytes)); + rawData = new OutPixelTypeArray(arrayBuf); + } + return rawData; + }, + + readMask: function(input, data) { + var ptr = data.ptr; + var headerInfo = data.headerInfo; + var numPixels = headerInfo.width * headerInfo.height; + var numValidPixel = headerInfo.numValidPixel; + + var view = new DataView(input, ptr, 4); + var mask = {}; + mask.numBytes = view.getUint32(0, true); + ptr += 4; + + // Mask Data + if ((0 === numValidPixel || numPixels === numValidPixel) && 0 !== mask.numBytes) { + throw ("invalid mask"); + } + var bitset, resultMask; + if (numValidPixel === 0) { + bitset = new Uint8Array(Math.ceil(numPixels / 8)); + mask.bitset = bitset; + resultMask = new Uint8Array(numPixels); + data.pixels.resultMask = resultMask; + ptr += mask.numBytes; + }// ????? else if (data.mask.numBytes > 0 && data.mask.numBytes< data.numValidPixel) { + else if (mask.numBytes > 0) { + bitset = new Uint8Array(Math.ceil(numPixels / 8)); + view = new DataView(input, ptr, mask.numBytes); + var cnt = view.getInt16(0, true); + var ip = 2, op = 0, val = 0; + do { + if (cnt > 0) { + while (cnt--) { bitset[op++] = view.getUint8(ip++); } + } else { + val = view.getUint8(ip++); + cnt = -cnt; + while (cnt--) { bitset[op++] = val; } + } + cnt = view.getInt16(ip, true); + ip += 2; + } while (ip < mask.numBytes); + if ((cnt !== -32768) || (op < bitset.length)) { + throw "Unexpected end of mask RLE encoding"; + } + + resultMask = new Uint8Array(numPixels); + var mb = 0, k = 0; + + for (k = 0; k < numPixels; k++) { + if (k & 7) { + mb = bitset[k >> 3]; + mb <<= k & 7; + } + else { + mb = bitset[k >> 3]; + } + if (mb & 128) { + resultMask[k] = 1; + } + } + data.pixels.resultMask = resultMask; + + mask.bitset = bitset; + ptr += mask.numBytes; + } + data.ptr = ptr; + data.mask = mask; + return true; + }, + + readDataOneSweep: function(input, data, OutPixelTypeArray, useBSQForOutputDim) { + var ptr = data.ptr; + var headerInfo = data.headerInfo; + var numDims = headerInfo.numDims; + var numPixels = headerInfo.width * headerInfo.height; + var imageType = headerInfo.imageType; + var numBytes = headerInfo.numValidPixel * Lerc2Helpers.getDataTypeSize(imageType) * numDims; + //data.pixels.numBytes = numBytes; + var rawData; + var mask = data.pixels.resultMask; + if (OutPixelTypeArray === Uint8Array) { + rawData = new Uint8Array(input, ptr, numBytes); + } + else { + var arrayBuf = new ArrayBuffer(numBytes); + var store8 = new Uint8Array(arrayBuf); + store8.set(new Uint8Array(input, ptr, numBytes)); + rawData = new OutPixelTypeArray(arrayBuf); + } + if (rawData.length === numPixels * numDims) { + if (useBSQForOutputDim) { + data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(rawData, numPixels, numDims, OutPixelTypeArray, true); + } + else { + data.pixels.resultPixels = rawData; + } + } + else //mask + { + data.pixels.resultPixels = new OutPixelTypeArray(numPixels * numDims); + var z = 0, k = 0, i = 0, nStart = 0; + if (numDims > 1) { + if (useBSQForOutputDim) { + for (k = 0; k < numPixels; k++) { + if (mask[k]) { + nStart = k; + for (i = 0; i < numDims; i++, nStart+=numPixels) { + data.pixels.resultPixels[nStart] = rawData[z++]; + } + } + } + } + else { + for (k = 0; k < numPixels; k++) { + if (mask[k]) { + nStart = k * numDims; + for (i = 0; i < numDims; i++) { + data.pixels.resultPixels[nStart + i] = rawData[z++]; + } + } + } + } + } + else { + for (k = 0; k < numPixels; k++) { + if (mask[k]) { + data.pixels.resultPixels[k] = rawData[z++]; + } + } + } + } + ptr += numBytes; + data.ptr = ptr; //return data; + return true; + }, + + readHuffmanTree: function(input, data) { + var BITS_MAX = this.HUFFMAN_LUT_BITS_MAX; //8 is slow for the large test image + //var size_max = 1 << BITS_MAX; + /* ************************ + * reading code table + *************************/ + var view = new DataView(input, data.ptr, 16); + data.ptr += 16; + var version = view.getInt32(0, true); + if (version < 2) { + throw "unsupported Huffman version"; + } + var size = view.getInt32(4, true); + var i0 = view.getInt32(8, true); + var i1 = view.getInt32(12, true); + if (i0 >= i1) { + return false; + } + var blockDataBuffer = new Uint32Array(i1 - i0); + Lerc2Helpers.decodeBits(input, data, blockDataBuffer); + var codeTable = []; //size + var i, j, k, len; + + for (i = i0; i < i1; i++) { + j = i - (i < size ? 0 : size);//wrap around + codeTable[j] = { first: blockDataBuffer[i - i0], second: null }; + } + + var dataBytes = input.byteLength - data.ptr; + var dataWords = Math.ceil(dataBytes / 4); + var arrayBuf = new ArrayBuffer(dataWords * 4); + var store8 = new Uint8Array(arrayBuf); + store8.set(new Uint8Array(input, data.ptr, dataBytes)); + var stuffedData = new Uint32Array(arrayBuf); //must start from x*4 + var bitPos = 0, word, srcPtr = 0; + word = stuffedData[0]; + for (i = i0; i < i1; i++) { + j = i - (i < size ? 0 : size);//wrap around + len = codeTable[j].first; + if (len > 0) { + codeTable[j].second = (word << bitPos) >>> (32 - len); + + if (32 - bitPos >= len) { + bitPos += len; + if (bitPos === 32) { + bitPos = 0; + srcPtr++; + word = stuffedData[srcPtr]; + } + } + else { + bitPos += len - 32; + srcPtr++; + word = stuffedData[srcPtr]; + codeTable[j].second |= word >>> (32 - bitPos); + } + } + } + + //finished reading code table + + /* ************************ + * building lut + *************************/ + var numBitsLUT = 0, numBitsLUTQick = 0; + var tree = new TreeNode(); + for (i = 0; i < codeTable.length; i++) { + if (codeTable[i] !== undefined) { + numBitsLUT = Math.max(numBitsLUT, codeTable[i].first); + } + } + if (numBitsLUT >= BITS_MAX) { + numBitsLUTQick = BITS_MAX; + } + else { + numBitsLUTQick = numBitsLUT; + } + // for debugging purpose + // if (numBitsLUT >= 30) { + // console.log("WARning, large NUM LUT BITS IS " + numBitsLUT); + // } + var decodeLut = [], entry, code, numEntries, jj, currentBit, node; + for (i = i0; i < i1; i++) { + j = i - (i < size ? 0 : size);//wrap around + len = codeTable[j].first; + if (len > 0) { + entry = [len, j]; + if (len <= numBitsLUTQick) { + code = codeTable[j].second << (numBitsLUTQick - len); + numEntries = 1 << (numBitsLUTQick - len); + for (k = 0; k < numEntries; k++) { + decodeLut[code | k] = entry; + } + } + else { + //build tree + code = codeTable[j].second; + node = tree; + for (jj = len - 1; jj >= 0; jj--) { + currentBit = code >>> jj & 1; //no left shift as length could be 30,31 + if (currentBit) { + if (!node.right) { + node.right = new TreeNode(); + } + node = node.right; + } + else { + if (!node.left) { + node.left = new TreeNode(); + } + node = node.left; + } + if (jj === 0 && !node.val) { + node.val = entry[1]; + } + } + } + } + } + return { + decodeLut: decodeLut, + numBitsLUTQick: numBitsLUTQick, + numBitsLUT: numBitsLUT, + tree: tree, + stuffedData: stuffedData, + srcPtr: srcPtr, + bitPos: bitPos + }; + }, + + readHuffman: function(input, data, OutPixelTypeArray, useBSQForOutputDim) { + var headerInfo = data.headerInfo; + var numDims = headerInfo.numDims; + var height = data.headerInfo.height; + var width = data.headerInfo.width; + var numPixels = width * height; + //var size_max = 1 << BITS_MAX; + /* ************************ + * reading huffman structure info + *************************/ + var huffmanInfo = this.readHuffmanTree(input, data); + var decodeLut = huffmanInfo.decodeLut; + var tree = huffmanInfo.tree; + //stuffedData includes huffman headers + var stuffedData = huffmanInfo.stuffedData; + var srcPtr = huffmanInfo.srcPtr; + var bitPos = huffmanInfo.bitPos; + var numBitsLUTQick = huffmanInfo.numBitsLUTQick; + var numBitsLUT = huffmanInfo.numBitsLUT; + var offset = data.headerInfo.imageType === 0 ? 128 : 0; + /************************* + * decode + ***************************/ + var node, val, delta, mask = data.pixels.resultMask, valTmp, valTmpQuick, currentBit; + var i, j, k, ii; + var prevVal = 0; + if (bitPos > 0) { + srcPtr++; + bitPos = 0; + } + var word = stuffedData[srcPtr]; + var deltaEncode = data.encodeMode === 1; + var resultPixelsAllDim = new OutPixelTypeArray(numPixels * numDims); + var resultPixels = resultPixelsAllDim; + var iDim; + // TODO: reevaluate the need to keep inlined decoding code as IE support is phasing out + if (numDims < 2 || deltaEncode) { + for (iDim = 0; iDim < numDims; iDim++) { + if (numDims > 1) { + //get the mem block of current dimension + resultPixels = new OutPixelTypeArray(resultPixelsAllDim.buffer, numPixels * iDim, numPixels); + prevVal = 0; + } + if (data.headerInfo.numValidPixel === width * height) { //all valid + for (k = 0, i = 0; i < height; i++) { + for (j = 0; j < width; j++, k++) { + val = 0; + valTmp = (word << bitPos) >>> (32 - numBitsLUTQick); + valTmpQuick = valTmp;// >>> deltaBits; + if (32 - bitPos < numBitsLUTQick) { + valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick)); + valTmpQuick = valTmp;// >>> deltaBits; + } + if (decodeLut[valTmpQuick]) // if there, move the correct number of bits and done + { + val = decodeLut[valTmpQuick][1]; + bitPos += decodeLut[valTmpQuick][0]; + } + else { + valTmp = (word << bitPos) >>> (32 - numBitsLUT); + valTmpQuick = valTmp;// >>> deltaBits; + if (32 - bitPos < numBitsLUT) { + valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT)); + valTmpQuick = valTmp;// >>> deltaBits; + } + node = tree; + for (ii = 0; ii < numBitsLUT; ii++) { + currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1; + node = currentBit ? node.right : node.left; + if (!(node.left || node.right)) { + val = node.val; + bitPos = bitPos + ii + 1; + break; + } + } + } + + if (bitPos >= 32) { + bitPos -= 32; + srcPtr++; + word = stuffedData[srcPtr]; + } + + delta = val - offset; + if (deltaEncode) { + if (j > 0) { + delta += prevVal; // use overflow + } + else if (i > 0) { + delta += resultPixels[k - width]; + } + else { + delta += prevVal; + } + delta &= 0xFF; //overflow + resultPixels[k] = delta;//overflow + prevVal = delta; + } + else { + resultPixels[k] = delta; + } + } + } + } + else { //not all valid, use mask + for (k = 0, i = 0; i < height; i++) { + for (j = 0; j < width; j++, k++) { + if (mask[k]) { + val = 0; + valTmp = (word << bitPos) >>> (32 - numBitsLUTQick); + valTmpQuick = valTmp;// >>> deltaBits; + if (32 - bitPos < numBitsLUTQick) { + valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick)); + valTmpQuick = valTmp;// >>> deltaBits; + } + if (decodeLut[valTmpQuick]) // if there, move the correct number of bits and done + { + val = decodeLut[valTmpQuick][1]; + bitPos += decodeLut[valTmpQuick][0]; + } + else { + valTmp = (word << bitPos) >>> (32 - numBitsLUT); + valTmpQuick = valTmp;// >>> deltaBits; + if (32 - bitPos < numBitsLUT) { + valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT)); + valTmpQuick = valTmp;// >>> deltaBits; + } + node = tree; + for (ii = 0; ii < numBitsLUT; ii++) { + currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1; + node = currentBit ? node.right : node.left; + if (!(node.left || node.right)) { + val = node.val; + bitPos = bitPos + ii + 1; + break; + } + } + } + + if (bitPos >= 32) { + bitPos -= 32; + srcPtr++; + word = stuffedData[srcPtr]; + } + + delta = val - offset; + if (deltaEncode) { + if (j > 0 && mask[k - 1]) { + delta += prevVal; // use overflow + } + else if (i > 0 && mask[k - width]) { + delta += resultPixels[k - width]; + } + else { + delta += prevVal; + } + + delta &= 0xFF; //overflow + resultPixels[k] = delta;//overflow + prevVal = delta; + } + else { + resultPixels[k] = delta; + } + } + } + } + } + } + } + else { + for (k = 0, i = 0; i < height; i++) { + for (j = 0; j < width; j++) { + k = i * width + j; + if (!mask || mask[k]) { + for (iDim = 0; iDim < numDims; iDim++, k+=numPixels) { + val = 0; + valTmp = (word << bitPos) >>> (32 - numBitsLUTQick); + valTmpQuick = valTmp; + if (32 - bitPos < numBitsLUTQick) { + valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick)); + valTmpQuick = valTmp; + } + if (decodeLut[valTmpQuick]) + { + val = decodeLut[valTmpQuick][1]; + bitPos += decodeLut[valTmpQuick][0]; + } + else { + valTmp = (word << bitPos) >>> (32 - numBitsLUT); + valTmpQuick = valTmp; + if (32 - bitPos < numBitsLUT) { + valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT)); + valTmpQuick = valTmp; + } + node = tree; + for (ii = 0; ii < numBitsLUT; ii++) { + currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1; + node = currentBit ? node.right : node.left; + if (!(node.left || node.right)) { + val = node.val; + bitPos = bitPos + ii + 1; + break; + } + } + } + + if (bitPos >= 32) { + bitPos -= 32; + srcPtr++; + word = stuffedData[srcPtr]; + } + + delta = val - offset; + resultPixels[k] = delta; + } + } + } + } + } + data.ptr = data.ptr + (srcPtr + 1) * 4 + (bitPos > 0 ? 4 : 0); + data.pixels.resultPixels = resultPixelsAllDim; + //swap for BIP layout + if (numDims > 1 && !useBSQForOutputDim) { + data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(resultPixelsAllDim, numPixels, numDims, OutPixelTypeArray); + } + }, + + decodeBits: function(input, data, blockDataBuffer, offset, iDim) { + { + //bitstuff encoding is 3 + var headerInfo = data.headerInfo; + var fileVersion = headerInfo.fileVersion; + //var block = {}; + var blockPtr = 0; + var viewByteLength = ((input.byteLength - data.ptr) >= 5) ? 5 : (input.byteLength - data.ptr); + var view = new DataView(input, data.ptr, viewByteLength); + var headerByte = view.getUint8(0); + blockPtr++; + var bits67 = headerByte >> 6; + var n = (bits67 === 0) ? 4 : 3 - bits67; + var doLut = (headerByte & 32) > 0 ? true : false;//5th bit + var numBits = headerByte & 31; + var numElements = 0; + if (n === 1) { + numElements = view.getUint8(blockPtr); blockPtr++; + } else if (n === 2) { + numElements = view.getUint16(blockPtr, true); blockPtr += 2; + } else if (n === 4) { + numElements = view.getUint32(blockPtr, true); blockPtr += 4; + } else { + throw "Invalid valid pixel count type"; + } + //fix: huffman codes are bit stuffed, but not bound by data's max value, so need to use originalUnstuff + //offset = offset || 0; + var scale = 2 * headerInfo.maxZError; + var stuffedData, arrayBuf, store8, dataBytes, dataWords; + var lutArr, lutData, lutBytes, lutBitsPerElement, bitsPerPixel; + var zMax = headerInfo.numDims > 1 ? headerInfo.maxValues[iDim] : headerInfo.zMax; + if (doLut) { + data.counter.lut++; + lutBytes = view.getUint8(blockPtr); + lutBitsPerElement = numBits; + blockPtr++; + dataBytes = Math.ceil((lutBytes - 1) * numBits / 8); + dataWords = Math.ceil(dataBytes / 4); + arrayBuf = new ArrayBuffer(dataWords * 4); + store8 = new Uint8Array(arrayBuf); + + data.ptr += blockPtr; + store8.set(new Uint8Array(input, data.ptr, dataBytes)); + + lutData = new Uint32Array(arrayBuf); + data.ptr += dataBytes; + + bitsPerPixel = 0; + while ((lutBytes - 1) >>> bitsPerPixel) { + bitsPerPixel++; + } + dataBytes = Math.ceil(numElements * bitsPerPixel / 8); + dataWords = Math.ceil(dataBytes / 4); + arrayBuf = new ArrayBuffer(dataWords * 4); + store8 = new Uint8Array(arrayBuf); + store8.set(new Uint8Array(input, data.ptr, dataBytes)); + stuffedData = new Uint32Array(arrayBuf); + data.ptr += dataBytes; + if (fileVersion >= 3) { + lutArr = BitStuffer.unstuffLUT2(lutData, numBits, lutBytes - 1, offset, scale, zMax); + } + else { + lutArr = BitStuffer.unstuffLUT(lutData, numBits, lutBytes - 1, offset, scale, zMax); + } + //lutArr.unshift(0); + if (fileVersion >= 3) { + //BitStuffer.unstuff2(block, blockDataBuffer, headerInfo.zMax); + BitStuffer.unstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements, lutArr); + } + else { + BitStuffer.unstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements, lutArr); + } + } + else { + //console.debug("bitstuffer"); + data.counter.bitstuffer++; + bitsPerPixel = numBits; + data.ptr += blockPtr; + if (bitsPerPixel > 0) { + dataBytes = Math.ceil(numElements * bitsPerPixel / 8); + dataWords = Math.ceil(dataBytes / 4); + arrayBuf = new ArrayBuffer(dataWords * 4); + store8 = new Uint8Array(arrayBuf); + store8.set(new Uint8Array(input, data.ptr, dataBytes)); + stuffedData = new Uint32Array(arrayBuf); + data.ptr += dataBytes; + if (fileVersion >= 3) { + if (offset == null) { + BitStuffer.originalUnstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements); + } + else { + BitStuffer.unstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements, false, offset, scale, zMax); + } + } + else { + if (offset == null) { + BitStuffer.originalUnstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements); + } + else { + BitStuffer.unstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements, false, offset, scale, zMax); + } + } + } + } + } + + }, + + readTiles: function(input, data, OutPixelTypeArray, useBSQForOutputDim) { + var headerInfo = data.headerInfo; + var width = headerInfo.width; + var height = headerInfo.height; + var numPixels = width * height; + var microBlockSize = headerInfo.microBlockSize; + var imageType = headerInfo.imageType; + var dataTypeSize = Lerc2Helpers.getDataTypeSize(imageType); + var numBlocksX = Math.ceil(width / microBlockSize); + var numBlocksY = Math.ceil(height / microBlockSize); + data.pixels.numBlocksY = numBlocksY; + data.pixels.numBlocksX = numBlocksX; + data.pixels.ptr = 0; + var row = 0, col = 0, blockY = 0, blockX = 0, thisBlockHeight = 0, thisBlockWidth = 0, bytesLeft = 0, headerByte = 0, bits67 = 0, testCode = 0, outPtr = 0, outStride = 0, numBytes = 0, bytesleft = 0, z = 0, blockPtr = 0; + var view, block, arrayBuf, store8, rawData; + var blockEncoding; + var blockDataBuffer = new OutPixelTypeArray(microBlockSize * microBlockSize); + var lastBlockHeight = (height % microBlockSize) || microBlockSize; + var lastBlockWidth = (width % microBlockSize) || microBlockSize; + var offsetType, offset; + var numDims = headerInfo.numDims, iDim; + var mask = data.pixels.resultMask; + var resultPixels = data.pixels.resultPixels; + var fileVersion = headerInfo.fileVersion; + var fileVersionCheckNum = fileVersion >= 5 ? 14 : 15; + var isDiffEncoding; + var zMax = headerInfo.zMax; + //var resultPixelsAllDim = resultPixels; + var resultPixelsPrevDim; + for (blockY = 0; blockY < numBlocksY; blockY++) { + thisBlockHeight = (blockY !== numBlocksY - 1) ? microBlockSize : lastBlockHeight; + for (blockX = 0; blockX < numBlocksX; blockX++) { + //console.debug("y" + blockY + " x" + blockX); + thisBlockWidth = (blockX !== numBlocksX - 1) ? microBlockSize : lastBlockWidth; + + outPtr = blockY * width * microBlockSize + blockX * microBlockSize; + outStride = width - thisBlockWidth; + + for (iDim = 0; iDim < numDims; iDim++) { + if (numDims > 1) { + resultPixelsPrevDim = resultPixels; + outPtr = blockY * width * microBlockSize + blockX * microBlockSize; + resultPixels = new OutPixelTypeArray(data.pixels.resultPixels.buffer, numPixels * iDim * dataTypeSize, numPixels); + zMax = headerInfo.maxValues[iDim]; + } else { + resultPixelsPrevDim = null; + } + bytesLeft = input.byteLength - data.ptr; + view = new DataView(input, data.ptr, Math.min(10, bytesLeft)); + block = {}; + blockPtr = 0; + headerByte = view.getUint8(0); + blockPtr++; + isDiffEncoding = headerInfo.fileVersion >= 5 ? headerByte & 4 : 0; + bits67 = (headerByte >> 6) & 0xFF; + testCode = (headerByte >> 2) & fileVersionCheckNum; // use bits 2345 for integrity check + if (testCode !== (((blockX * microBlockSize) >> 3) & fileVersionCheckNum)) { + throw "integrity issue"; + } + + if (isDiffEncoding && iDim === 0) { + throw "integrity issue"; + } + + blockEncoding = headerByte & 3; + if (blockEncoding > 3) { + data.ptr += blockPtr; + throw "Invalid block encoding (" + blockEncoding + ")"; + } + else if (blockEncoding === 2) { //constant 0 + if (isDiffEncoding) { + if (mask) { + for (row = 0; row < thisBlockHeight; row++) { + for (col = 0; col < thisBlockWidth; col++) { + if (mask[outPtr]) { + resultPixels[outPtr] = resultPixelsPrevDim[outPtr]; + } + outPtr++; + } + } + } + else { + for (row = 0; row < thisBlockHeight; row++) { + for (col = 0; col < thisBlockWidth; col++) { + resultPixels[outPtr] = resultPixelsPrevDim[outPtr]; + outPtr++; + } + } + } + } + data.counter.constant++; + data.ptr += blockPtr; + continue; + } + else if (blockEncoding === 0) { //uncompressed + if (isDiffEncoding) { + // doesn't make sense, should not happen + throw "integrity issue"; + } + data.counter.uncompressed++; + data.ptr += blockPtr; + numBytes = thisBlockHeight * thisBlockWidth * dataTypeSize; + bytesleft = input.byteLength - data.ptr; + numBytes = numBytes < bytesleft ? numBytes : bytesleft; + //bit alignment + arrayBuf = new ArrayBuffer((numBytes % dataTypeSize) === 0 ? numBytes : (numBytes + dataTypeSize - numBytes % dataTypeSize)); + store8 = new Uint8Array(arrayBuf); + store8.set(new Uint8Array(input, data.ptr, numBytes)); + rawData = new OutPixelTypeArray(arrayBuf); + z = 0; + if (mask) { + for (row = 0; row < thisBlockHeight; row++) { + for (col = 0; col < thisBlockWidth; col++) { + if (mask[outPtr]) { + resultPixels[outPtr] = rawData[z++]; + } + outPtr++; + } + outPtr += outStride; + } + } + else {//all valid + for (row = 0; row < thisBlockHeight; row++) { + for (col = 0; col < thisBlockWidth; col++) { + resultPixels[outPtr++] = rawData[z++]; + } + outPtr += outStride; + } + } + data.ptr += z * dataTypeSize; + } + else { //1 or 3 + offsetType = Lerc2Helpers.getDataTypeUsed((isDiffEncoding && imageType < 6) ? 4 : imageType, bits67); + offset = Lerc2Helpers.getOnePixel(block, blockPtr, offsetType, view); + blockPtr += Lerc2Helpers.getDataTypeSize(offsetType); + if (blockEncoding === 3) //constant offset value + { + data.ptr += blockPtr; + data.counter.constantoffset++; + //you can delete the following resultMask case in favor of performance because val is constant and users use nodata mask, otherwise nodatavalue post processing handles it too. + //while the above statement is true, we're not doing it as we want to keep invalid pixel value at 0 rather than arbitrary values + if (mask) { + for (row = 0; row < thisBlockHeight; row++) { + for (col = 0; col < thisBlockWidth; col++) { + if (mask[outPtr]) { + resultPixels[outPtr] = isDiffEncoding ? Math.min(zMax, resultPixelsPrevDim[outPtr] + offset) : offset; + } + outPtr++; + } + outPtr += outStride; + } + } + else { + for (row = 0; row < thisBlockHeight; row++) { + for (col = 0; col < thisBlockWidth; col++) { + resultPixels[outPtr] = isDiffEncoding ? Math.min(zMax, resultPixelsPrevDim[outPtr] + offset) : offset; + outPtr++; + } + outPtr += outStride; + } + } + } + else { //bitstuff encoding is 3 + data.ptr += blockPtr; + //heavy lifting + Lerc2Helpers.decodeBits(input, data, blockDataBuffer, offset, iDim); + blockPtr = 0; + // duplicate code to favor performance, diff encoding is for multidimension only + if (isDiffEncoding) { + if (mask) { + for (row = 0; row < thisBlockHeight; row++) { + for (col = 0; col < thisBlockWidth; col++) { + if (mask[outPtr]) { + resultPixels[outPtr] = blockDataBuffer[blockPtr++] + resultPixelsPrevDim[outPtr]; + } + outPtr++; + } + outPtr += outStride; + } + } + else { + for (row = 0; row < thisBlockHeight; row++) { + for (col = 0; col < thisBlockWidth; col++) { + resultPixels[outPtr] = blockDataBuffer[blockPtr++] + resultPixelsPrevDim[outPtr]; + outPtr++; + } + outPtr += outStride; + } + } + } + else if (mask) { + for (row = 0; row < thisBlockHeight; row++) { + for (col = 0; col < thisBlockWidth; col++) { + if (mask[outPtr]) { + resultPixels[outPtr] = blockDataBuffer[blockPtr++]; + } + outPtr++; + } + outPtr += outStride; + } + } + else { + for (row = 0; row < thisBlockHeight; row++) { + for (col = 0; col < thisBlockWidth; col++) { + resultPixels[outPtr++] = blockDataBuffer[blockPtr++]; + } + outPtr += outStride; + } + } + } + } + } + } + } + //swap for BIP: it's always easier for clients to handle BSQ so we keep existing logic and introduce a swap here to minimze changes + if (numDims > 1 && !useBSQForOutputDim) { + data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(data.pixels.resultPixels, numPixels, numDims, OutPixelTypeArray); + } + }, + + /***************** + * private methods (helper methods) + *****************/ + + formatFileInfo: function(data) { + return { + "fileIdentifierString": data.headerInfo.fileIdentifierString, + "fileVersion": data.headerInfo.fileVersion, + "imageType": data.headerInfo.imageType, + "height": data.headerInfo.height, + "width": data.headerInfo.width, + "numValidPixel": data.headerInfo.numValidPixel, + "microBlockSize": data.headerInfo.microBlockSize, + "blobSize": data.headerInfo.blobSize, + "maxZError": data.headerInfo.maxZError, + "pixelType": Lerc2Helpers.getPixelType(data.headerInfo.imageType), + "eofOffset": data.eofOffset, + "mask": data.mask ? { + "numBytes": data.mask.numBytes + } : null, + "pixels": { + "numBlocksX": data.pixels.numBlocksX, + "numBlocksY": data.pixels.numBlocksY, + //"numBytes": data.pixels.numBytes, + "maxValue": data.headerInfo.zMax, + "minValue": data.headerInfo.zMin, + "noDataValue": data.noDataValue + } + }; + }, + + constructConstantSurface: function(data, useBSQForOutputDim) { + var val = data.headerInfo.zMax; + var valMin = data.headerInfo.zMin; + var maxValues = data.headerInfo.maxValues; + var numDims = data.headerInfo.numDims; + var numPixels = data.headerInfo.height * data.headerInfo.width; + var i = 0, k = 0, nStart = 0; + var mask = data.pixels.resultMask; + var resultPixels = data.pixels.resultPixels; + if (mask) { + if (numDims > 1) { + if (useBSQForOutputDim) { + for (i = 0; i < numDims; i++) { + nStart = i * numPixels; + val = maxValues[i]; + for (k = 0; k < numPixels; k++) { + if (mask[k]) { + resultPixels[nStart + k] = val; + } + } + } + } + else { + for (k = 0; k < numPixels; k++) { + if (mask[k]) { + nStart = k * numDims; + for (i = 0; i < numDims; i++) { + resultPixels[nStart + numDims] = maxValues[i]; + } + } + } + } + } + else { + for (k = 0; k < numPixels; k++) { + if (mask[k]) { + resultPixels[k] = val; + } + } + } + } + else { + if (numDims > 1 && valMin !== val) { + if (useBSQForOutputDim) { + for (i = 0; i < numDims; i++) { + nStart = i * numPixels; + val = maxValues[i]; + for (k = 0; k < numPixels; k++) { + resultPixels[nStart + k] = val; + } + } + } + else { + for (k = 0; k < numPixels; k++) { + nStart = k * numDims; + for (i = 0; i < numDims; i++) { + resultPixels[nStart + i] = maxValues[i]; + } + } + } + } + else { + for (k = 0; k < numPixels * numDims; k++) { + resultPixels[k] = val; + } + } + } + return; + }, + + getDataTypeArray: function(t) { + var tp; + switch (t) { + case 0: //char + tp = Int8Array; + break; + case 1: //byte + tp = Uint8Array; + break; + case 2: //short + tp = Int16Array; + break; + case 3: //ushort + tp = Uint16Array; + break; + case 4: + tp = Int32Array; + break; + case 5: + tp = Uint32Array; + break; + case 6: + tp = Float32Array; + break; + case 7: + tp = Float64Array; + break; + default: + tp = Float32Array; + } + return tp; + }, + + getPixelType: function(t) { + var tp; + switch (t) { + case 0: //char + tp = "S8"; + break; + case 1: //byte + tp = "U8"; + break; + case 2: //short + tp = "S16"; + break; + case 3: //ushort + tp = "U16"; + break; + case 4: + tp = "S32"; + break; + case 5: + tp = "U32"; + break; + case 6: + tp = "F32"; + break; + case 7: + tp = "F64"; + break; + default: + tp = "F32"; + } + return tp; + }, + + isValidPixelValue: function(t, val) { + if (val == null) { + return false; + } + var isValid; + switch (t) { + case 0: //char + isValid = val >= -128 && val <= 127; + break; + case 1: //byte (unsigned char) + isValid = val >= 0 && val <= 255; + break; + case 2: //short + isValid = val >= -32768 && val <= 32767; + break; + case 3: //ushort + isValid = val >= 0 && val <= 65536; + break; + case 4: //int 32 + isValid = val >= -2147483648 && val <= 2147483647; + break; + case 5: //uinit 32 + isValid = val >= 0 && val <= 4294967296; + break; + case 6: + isValid = val >= -3.4027999387901484e+38 && val <= 3.4027999387901484e+38; + break; + case 7: + isValid = val >= -1.7976931348623157e+308 && val <= 1.7976931348623157e+308; + break; + default: + isValid = false; + } + return isValid; + }, + + getDataTypeSize: function(t) { + var s = 0; + switch (t) { + case 0: //ubyte + case 1: //byte + s = 1; + break; + case 2: //short + case 3: //ushort + s = 2; + break; + case 4: + case 5: + case 6: + s = 4; + break; + case 7: + s = 8; + break; + default: + s = t; + } + return s; + }, + + getDataTypeUsed: function(dt, tc) { + var t = dt; + switch (dt) { + case 2: //short + case 4: //long + t = dt - tc; + break; + case 3: //ushort + case 5: //ulong + t = dt - 2 * tc; + break; + case 6: //float + if (0 === tc) { + t = dt; + } + else if (1 === tc) { + t = 2; + } + else { + t = 1;//byte + } + break; + case 7: //double + if (0 === tc) { + t = dt; + } + else { + t = dt - 2 * tc + 1; + } + break; + default: + t = dt; + break; + } + return t; + }, + + getOnePixel: function(block, blockPtr, offsetType, view) { + var temp = 0; + switch (offsetType) { + case 0: //char + temp = view.getInt8(blockPtr); + break; + case 1: //byte + temp = view.getUint8(blockPtr); + break; + case 2: + temp = view.getInt16(blockPtr, true); + break; + case 3: + temp = view.getUint16(blockPtr, true); + break; + case 4: + temp = view.getInt32(blockPtr, true); + break; + case 5: + temp = view.getUInt32(blockPtr, true); + break; + case 6: + temp = view.getFloat32(blockPtr, true); + break; + case 7: + temp = view.getFloat64(blockPtr, true); + break; + default: + throw ("the decoder does not understand this pixel type"); + } + return temp; + }, + + swapDimensionOrder: function(pixels, numPixels, numDims, OutPixelTypeArray, inputIsBIP) { + var i = 0, j = 0, iDim = 0, temp = 0, swap = pixels; + if (numDims > 1) { + swap = new OutPixelTypeArray(numPixels * numDims); + if (inputIsBIP) { + for (i=0; i 5) { + throw "unsupported lerc version 2." + fileVersion; + } + + // Mask Header + Lerc2Helpers.readMask(input, data); + if (headerInfo.numValidPixel !== headerInfo.width * headerInfo.height && !data.pixels.resultMask) { + data.pixels.resultMask = options.maskData; + } + + var numPixels = headerInfo.width * headerInfo.height; + data.pixels.resultPixels = new OutPixelTypeArray(numPixels * headerInfo.numDims); + + data.counter = { + onesweep: 0, + uncompressed: 0, + lut: 0, + bitstuffer: 0, + constant: 0, + constantoffset: 0 + }; + var useBSQForOutputDim = !options.returnPixelInterleavedDims; + if (headerInfo.numValidPixel !== 0) { + //not tested + if (headerInfo.zMax === headerInfo.zMin) //constant surface + { + Lerc2Helpers.constructConstantSurface(data, useBSQForOutputDim); + } + else if (fileVersion >= 4 && Lerc2Helpers.checkMinMaxRanges(input, data)) { + Lerc2Helpers.constructConstantSurface(data, useBSQForOutputDim); + } + else { + var view = new DataView(input, data.ptr, 2); + var bReadDataOneSweep = view.getUint8(0); + data.ptr++; + if (bReadDataOneSweep) { + //console.debug("OneSweep"); + Lerc2Helpers.readDataOneSweep(input, data, OutPixelTypeArray, useBSQForOutputDim); + } + else { + //lerc2.1: //bitstuffing + lut + //lerc2.2: //bitstuffing + lut + huffman + //lerc2.3: new bitstuffer + if (fileVersion > 1 && headerInfo.imageType <= 1 && Math.abs(headerInfo.maxZError - 0.5) < 0.00001) { + //this is 2.x plus 8 bit (unsigned and signed) data, possiblity of Huffman + var flagHuffman = view.getUint8(1); + data.ptr++; + data.encodeMode = flagHuffman; + if (flagHuffman > 2 || (fileVersion < 4 && flagHuffman > 1)) { + throw "Invalid Huffman flag " + flagHuffman; + } + if (flagHuffman) {//1 - delta Huffman, 2 - Huffman + //console.log("Huffman"); + Lerc2Helpers.readHuffman(input, data, OutPixelTypeArray, useBSQForOutputDim); + } + else { + //console.log("Tiles"); + Lerc2Helpers.readTiles(input, data, OutPixelTypeArray, useBSQForOutputDim); + } + } + else { //lerc2.x non-8 bit data + //console.log("Tiles"); + Lerc2Helpers.readTiles(input, data, OutPixelTypeArray, useBSQForOutputDim); + } + } + } + } + + data.eofOffset = data.ptr; + var diff; + if (options.inputOffset) { + diff = data.headerInfo.blobSize + options.inputOffset - data.ptr; + if (Math.abs(diff) >= 1) { + //console.debug("incorrect eof: dataptr " + data.ptr + " offset " + options.inputOffset + " blobsize " + data.headerInfo.blobSize + " diff: " + diff); + data.eofOffset = options.inputOffset + data.headerInfo.blobSize; + } + } + else { + diff = data.headerInfo.blobSize - data.ptr; + if (Math.abs(diff) >= 1) { + //console.debug("incorrect first band eof: dataptr " + data.ptr + " blobsize " + data.headerInfo.blobSize + " diff: " + diff); + data.eofOffset = data.headerInfo.blobSize; + } + } + + var result = { + width: headerInfo.width, + height: headerInfo.height, + pixelData: data.pixels.resultPixels, + minValue: headerInfo.zMin, + maxValue: headerInfo.zMax, + validPixelCount: headerInfo.numValidPixel, + dimCount: headerInfo.numDims, + dimStats: { + minValues: headerInfo.minValues, + maxValues: headerInfo.maxValues + }, + maskData: data.pixels.resultMask + //noDataValue: noDataValue + }; + + //we should remove this if there's no existing client + //optional noDataValue processing, it's user's responsiblity + if (data.pixels.resultMask && Lerc2Helpers.isValidPixelValue(headerInfo.imageType, noDataValue)) { + var mask = data.pixels.resultMask; + for (i = 0; i < numPixels; i++) { + if (!mask[i]) { + result.pixelData[i] = noDataValue; + } + } + result.noDataValue = noDataValue; + } + data.noDataValue = noDataValue; + if (options.returnFileInfo) { + result.fileInfo = Lerc2Helpers.formatFileInfo(data); + } + return result; + }, + + getBandCount: function(/*byte array*/ input) { + var count = 0; + var i = 0; + var temp = {}; + temp.ptr = 0; + temp.pixels = {}; + while (i < input.byteLength - 58) { + Lerc2Helpers.readHeaderInfo(input, temp); + i += temp.headerInfo.blobSize; + count++; + temp.ptr = i; + } + return count; + } + }; + + return Lerc2Decode; + })(); + + var isPlatformLittleEndian = (function() { + var a = new ArrayBuffer(4); + var b = new Uint8Array(a); + var c = new Uint32Array(a); + c[0] = 1; + return b[0] === 1; + })(); + + var Lerc = { + /************wrapper**********************************************/ + /** + * A wrapper for decoding both LERC1 and LERC2 byte streams capable of handling multiband pixel blocks for various pixel types. + * + * @alias module:Lerc + * @param {ArrayBuffer} input The LERC input byte stream + * @param {object} [options] The decoding options below are optional. + * @param {number} [options.inputOffset] The number of bytes to skip in the input byte stream. A valid Lerc file is expected at that position. + * @param {string} [options.pixelType] (LERC1 only) Default value is F32. Valid pixel types for input are U8/S8/S16/U16/S32/U32/F32. + * @param {number} [options.noDataValue] (LERC1 only). It is recommended to use the returned mask instead of setting this value. + * @param {boolean} [options.returnPixelInterleavedDims] (nDim LERC2 only) If true, returned dimensions are pixel-interleaved, a.k.a [p1_dim0, p1_dim1, p1_dimn, p2_dim0...], default is [p1_dim0, p2_dim0, ..., p1_dim1, p2_dim1...] + * @returns {{width, height, pixels, pixelType, mask, statistics}} + * @property {number} width Width of decoded image. + * @property {number} height Height of decoded image. + * @property {array} pixels [band1, band2, …] Each band is a typed array of width*height. + * @property {string} pixelType The type of pixels represented in the output. + * @property {mask} mask Typed array with a size of width*height, or null if all pixels are valid. + * @property {array} statistics [statistics_band1, statistics_band2, …] Each element is a statistics object representing min and max values + **/ + decode: function(encodedData, options) { + if (!isPlatformLittleEndian) { + throw "Big endian system is not supported."; + } + options = options || {}; + var inputOffset = options.inputOffset || 0; + var fileIdView = new Uint8Array(encodedData, inputOffset, 10); + var fileIdentifierString = String.fromCharCode.apply(null, fileIdView); + var lerc, majorVersion; + if (fileIdentifierString.trim() === "CntZImage") { + lerc = LercDecode; + majorVersion = 1; + } + else if (fileIdentifierString.substring(0, 5) === "Lerc2") { + lerc = Lerc2Decode; + majorVersion = 2; + } + else { + throw "Unexpected file identifier string: " + fileIdentifierString; + } + + var iPlane = 0, eof = encodedData.byteLength - 10, encodedMaskData, bandMasks = [], bandMask, maskData; + var decodedPixelBlock = { + width: 0, + height: 0, + pixels: [], + pixelType: options.pixelType, + mask: null, + statistics: [] + }; + var uniqueBandMaskCount = 0; + + while (inputOffset < eof) { + var result = lerc.decode(encodedData, { + inputOffset: inputOffset,//for both lerc1 and lerc2 + encodedMaskData: encodedMaskData,//lerc1 only + maskData: maskData,//lerc2 only + returnMask: iPlane === 0 ? true : false,//lerc1 only + returnEncodedMask: iPlane === 0 ? true : false,//lerc1 only + returnFileInfo: true,//for both lerc1 and lerc2 + returnPixelInterleavedDims: options.returnPixelInterleavedDims,//for ndim lerc2 only + pixelType: options.pixelType || null,//lerc1 only + noDataValue: options.noDataValue || null//lerc1 only + }); + + inputOffset = result.fileInfo.eofOffset; + maskData = result.maskData;//lerc2 + if (iPlane === 0) { + encodedMaskData = result.encodedMaskData;//lerc1 + decodedPixelBlock.width = result.width; + decodedPixelBlock.height = result.height; + decodedPixelBlock.dimCount = result.dimCount || 1; + //decodedPixelBlock.dimStats = decodedPixelBlock.dimStats; + decodedPixelBlock.pixelType = result.pixelType || result.fileInfo.pixelType; + decodedPixelBlock.mask = maskData; + } + if (majorVersion > 1) { + if (maskData) { + bandMasks.push(maskData); + } + if (result.fileInfo.mask && result.fileInfo.mask.numBytes > 0) { + uniqueBandMaskCount++; + } + } + + iPlane++; + decodedPixelBlock.pixels.push(result.pixelData); + decodedPixelBlock.statistics.push({ + minValue: result.minValue, + maxValue: result.maxValue, + noDataValue: result.noDataValue, + dimStats: result.dimStats + }); + } + var i, j, numPixels; + if (majorVersion > 1 && uniqueBandMaskCount > 1) { + numPixels = decodedPixelBlock.width * decodedPixelBlock.height; + decodedPixelBlock.bandMasks = bandMasks; + maskData = new Uint8Array(numPixels); + maskData.set(bandMasks[0]); + for (i = 1; i < bandMasks.length; i++) { + bandMask = bandMasks[i]; + for (j = 0; j < numPixels; j++) { + maskData[j] = maskData[j] & bandMask[j]; + } + } + decodedPixelBlock.maskData = maskData; + } + + return decodedPixelBlock; + } + }; + + if (true) {/* jshint ignore:line */ + //amd loaders such as dojo and requireJS + //http://wiki.commonjs.org/wiki/Modules/AsynchronousDefinition + !(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_RESULT__ = (function() { return Lerc; }).apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__), + __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));/* jshint ignore:line */ + } + else {} + +})(); + + +/***/ }) + +}]); +//# sourceMappingURL=5.js.map \ No newline at end of file diff --git a/dist/5.js.map b/dist/5.js.map new file mode 100644 index 0000000..a006fea --- /dev/null +++ b/dist/5.js.map @@ -0,0 +1 @@ +{"version":3,"sources":["webpack:///../node_modules/geotiff/src/compression/lerc.js","webpack:///../node_modules/lerc/LercDecode.js"],"names":[],"mappings":";;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA+B;AACP;AACgB;AACwB;;AAEjD,0BAA0B,oDAAW;AACpD;AACA;;AAEA;AACA;;AAEA,uDAAuD,uDAAc;AACrE;;AAEA;AACA;AACA,WAAW,2DAAkB;AAC7B;AACA,WAAW,2DAAkB;AAC7B,iBAAiB,oDAAO,gCAAgC;AACxD;AACA;AACA,sFAAsF,oBAAoB;AAC1G;;AAEA,uBAAuB,2CAAI,iBAAiB,6DAA6D;AACzG;AACA;AACA;AACA;;;;;;;;;;;;AC9BA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA,4FAA4F;;AAE5F;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA,2DAA2D;;AAE3D;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB;AACA,gBAAgB,WAAW;AAC3B;AACA;AACA,gBAAgB,OAAO;AACvB;AACA,gBAAgB,sBAAsB;AACtC;AACA;AACA,gBAAgB,QAAQ;AACxB;AACA;AACA;AACA,gBAAgB,QAAQ;AACxB;AACA;AACA,gBAAgB,QAAQ;AACxB;AACA;AACA,gBAAgB,QAAQ;AACxB;AACA;AACA,kBAAkB;AAClB;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qBAAqB,WAAW;AAChC;AACA;AACA;AACA;AACA,uBAAuB,WAAW;AAClC;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,wBAAwB,sBAAsB;AAC9C;AACA;AACA;AACA;AACA;AACA,0BAA0B,qBAAqB;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA,0BAA0B,sBAAsB;AAChD,4BAA4B,qBAAqB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,sBAAsB;AAChD,4BAA4B,qBAAqB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,oCAAoC;AACjE,aAAa;AACb;AACA;AACA,6BAA6B,oBAAoB;AACjD;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA,0FAA0F;AAC1F;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,2BAA2B;AACrD,4BAA4B,2BAA2B;;AAEvD;AACA;AACA;AACA;AACA;AACA;AACA,4CAA4C;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C;AAC7C,aAAa;AACb,oDAAoD;AACpD,aAAa;AACb,sDAAsD;AACtD,aAAa;AACb;AACA;;AAEA;AACA,+CAA+C;AAC/C;AACA;AACA;AACA;AACA,2DAA2D;AAC3D,eAAe;AACf,kEAAkE;AAClE,eAAe;AACf,kEAAkE;AAClE,eAAe;AACf;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,iBAAiB,eAAe;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC;AAChC;AACA;AACA;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,mBAAmB,eAAe;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,gDAAgD;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,eAAe;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,mBAAmB,eAAe;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,eAAe;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;;AAEX;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD;AACxD;AACA;;AAEA;AACA;AACA,oDAAoD;AACpD,mDAAmD;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,wBAAwB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,oCAAoC;AACjE,aAAa;AACb;AACA;AACA,6BAA6B,oBAAoB;AACjD;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;;AAEA;AACA;;AAEA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,eAAe;AACxC;AACA;AACA,6BAA6B,aAAa;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,eAAe;AACxC;AACA;AACA,6BAA6B,aAAa;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,eAAe;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB;AACA,OAAO;;AAEP;AACA,iDAAiD;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;;AAEA,oBAAoB,QAAQ;AAC5B,wCAAwC;AACxC,0BAA0B;AAC1B;;AAEA;AACA;AACA;AACA;AACA;AACA,oDAAoD;AACpD;AACA;AACA,oBAAoB,QAAQ;AAC5B,wCAAwC;AACxC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,mBAAmB,sBAAsB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,QAAQ;AAC5B,wCAAwC;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,gBAAgB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,SAAS;AACzC,6CAA6C;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,gBAAgB;AACxC;AACA;AACA;AACA;AACA;AACA,mEAAmE;AACnE,gCAAgC,YAAY;AAC5C,2BAA2B,WAAW;AACtC;AACA;AACA,uCAAuC;AACvC;AACA;AACA,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yCAAyC;AACzC;AACA;AACA,2CAA2C;AAC3C;AACA;AACA,gCAAgC,iBAAiB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,uCAAuC;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC;AAClC,4CAA4C;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB,gCAAgC,YAAY;AAC5C,2BAA2B,WAAW;AACtC;AACA;AACA;AACA,yCAAyC;AACzC;AACA;AACA,2CAA2C;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2CAA2C;AAC3C;AACA;AACA,6CAA6C;AAC7C;AACA;AACA,kCAAkC,iBAAiB;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,oCAAoC;AACpC,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,YAAY;AACxC,uBAAuB,WAAW;AAClC;AACA;AACA,8BAA8B,gBAAgB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,iBAAiB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2DAA2D;AAC3D;AACA;AACA;AACA,kDAAkD;AAClD,WAAW;AACX,yDAAyD;AACzD,WAAW;AACX,yDAAyD;AACzD,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,qBAAqB;AAC7C;AACA,0BAA0B,qBAAqB;AAC/C;AACA;;AAEA;AACA;;AAEA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iEAAiE;AACjE;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,6CAA6C;AAC7C;AACA;AACA,iCAAiC,uBAAuB;AACxD,mCAAmC,sBAAsB;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,uBAAuB;AACxD,mCAAmC,sBAAsB;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,uBAAuB;AACtD,iCAAiC,sBAAsB;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB,+BAA+B,uBAAuB;AACtD,iCAAiC,sBAAsB;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,uBAAuB;AACxD,mCAAmC,sBAAsB;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,uBAAuB;AACxD,mCAAmC,sBAAsB;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,uBAAuB;AAC1D,qCAAqC,sBAAsB;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,uBAAuB;AAC1D,qCAAqC,sBAAsB;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,uBAAuB;AACxD,mCAAmC,sBAAsB;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,uBAAuB;AACxD,mCAAmC,sBAAsB;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,aAAa;AACtC;AACA;AACA,2BAA2B,eAAe;AAC1C;AACA;AACA;AACA;AACA,e;AACA;AACA;AACA,yBAAyB,eAAe;AACxC;AACA;AACA,6BAA6B,aAAa;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,eAAe;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,aAAa;AACtC;AACA;AACA,2BAA2B,eAAe;AAC1C;AACA;AACA;AACA;AACA;AACA,yBAAyB,eAAe;AACxC;AACA,2BAA2B,aAAa;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,yBAAyB;AAChD;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA,qBAAqB,aAAa;AAClC;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA,a;AACA;AACA;AACA,qBAAqB,aAAa;AAClC;AACA,0BAA0B,gBAAgB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,iBAAiB,YAAY;AAC7B,iBAAiB,OAAO;AACxB,iBAAiB,OAAO;AACxB,iBAAiB,QAAQ;AACzB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,kBAAkB;AAClB,oBAAoB,OAAO;AAC3B,oBAAoB,OAAO;AAC3B,oBAAoB,MAAM;AAC1B,oBAAoB,OAAO;AAC3B,oBAAoB,KAAK;AACzB,oBAAoB,MAAM;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA,mCAAmC;AACnC;AACA,mDAAmD;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,sBAAsB;AACzC;AACA,qBAAqB,eAAe;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,MAAM,IAA0C,GAAG;AACnD;AACA;AACA,IAAI,iCAAO,EAAE,mCAAE,YAAY,aAAa,EAAE;AAAA,oGAAC,CAAC;AAC5C;AACA,OAAO,EAQJ;;AAEH,CAAC","file":"5.js","sourcesContent":["import { inflate } from 'pako';\nimport Lerc from 'lerc';\nimport BaseDecoder from './basedecoder';\nimport { LercParameters, LercAddCompression } from '../globals';\n\nexport default class LercDecoder extends BaseDecoder {\n constructor(fileDirectory) {\n super();\n\n this.planarConfiguration = typeof fileDirectory.PlanarConfiguration !== 'undefined' ? fileDirectory.PlanarConfiguration : 1;\n this.samplesPerPixel = typeof fileDirectory.SamplesPerPixel !== 'undefined' ? fileDirectory.SamplesPerPixel : 1;\n\n this.addCompression = fileDirectory.LercParameters[LercParameters.AddCompression];\n }\n\n decodeBlock(buffer) {\n switch (this.addCompression) {\n case LercAddCompression.None:\n break;\n case LercAddCompression.Deflate:\n buffer = inflate(new Uint8Array(buffer)).buffer; // eslint-disable-line no-param-reassign, prefer-destructuring\n break;\n default:\n throw new Error(`Unsupported LERC additional compression method identifier: ${this.addCompression}`);\n }\n\n const lercResult = Lerc.decode(buffer, { returnPixelInterleavedDims: this.planarConfiguration === 1 });\n const lercData = lercResult.pixels[0];\n return lercData.buffer;\n }\n}\n","/* jshint forin: false, bitwise: false */\n/*\nCopyright 2015-2021 Esri\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\nhttp://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\nA copy of the license and additional notices are located with the\nsource distribution at:\n\nhttp://github.com/Esri/lerc/\n\nContributors: Johannes Schmid, (LERC v1)\n Chayanika Khatua, (LERC v1)\n Wenxue Ju (LERC v1, v2.x)\n*/\n\n/* Copyright 2015-2021 Esri. Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 @preserve */\n\n/**\n * a module for decoding LERC blobs\n * @module Lerc\n */\n(function() {\n //this decoder supports all lerc versions, each version has its own class (LercDecode and Lerc2Decode). \n //the exported module handles format variation autoamtically.\n\n //the original LercDecode for Version 1\n var LercDecode = (function() {\n\n // Note: currently, this module only has an implementation for decoding LERC data, not encoding. The name of\n // the class was chosen to be future proof.\n\n var CntZImage = {};\n\n CntZImage.defaultNoDataValue = -3.4027999387901484e+38; // smallest Float32 value\n\n /**\n * Decode a LERC byte stream and return an object containing the pixel data and some required and optional\n * information about it, such as the image's width and height.\n *\n * @param {ArrayBuffer} input The LERC input byte stream\n * @param {object} [options] Decoding options, containing any of the following properties:\n * @config {number} [inputOffset = 0]\n * Skip the first inputOffset bytes of the input byte stream. A valid LERC file is expected at that position.\n * @config {Uint8Array} [encodedMask = null]\n * If specified, the decoder will not read mask information from the input and use the specified encoded\n * mask data instead. Mask header/data must not be present in the LERC byte stream in this case.\n * @config {number} [noDataValue = LercCode.defaultNoDataValue]\n * Pixel value to use for masked pixels.\n * @config {ArrayBufferView|Array} [pixelType = Float32Array]\n * The desired type of the pixelData array in the return value. Note that it is the caller's responsibility to\n * provide an appropriate noDataValue if the default pixelType is overridden.\n * @config {boolean} [returnMask = false]\n * If true, the return value will contain a maskData property of type Uint8Array which has one element per\n * pixel, the value of which is 1 or 0 depending on whether that pixel's data is present or masked. If the\n * input LERC data does not contain a mask, maskData will not be returned.\n * @config {boolean} [returnEncodedMask = false]\n * If true, the return value will contain a encodedMaskData property, which can be passed into encode() as\n * encodedMask.\n * @config {boolean} [returnFileInfo = false]\n * If true, the return value will have a fileInfo property that contains metadata obtained from the\n * LERC headers and the decoding process.\n * @config {boolean} [computeUsedBitDepths = false]\n * If true, the fileInfo property in the return value will contain the set of all block bit depths\n * encountered during decoding. Will only have an effect if returnFileInfo option is true.\n * @returns {{width, height, pixelData, minValue, maxValue, noDataValue, maskData, encodedMaskData, fileInfo}}\n */\n CntZImage.decode = function(input, options) {\n options = options || {};\n\n var skipMask = options.encodedMaskData || (options.encodedMaskData === null);\n var parsedData = parse(input, options.inputOffset || 0, skipMask);\n\n var noDataValue = (options.noDataValue !== null) ? options.noDataValue : CntZImage.defaultNoDataValue;\n\n var uncompressedData = uncompressPixelValues(parsedData, options.pixelType || Float32Array,\n options.encodedMaskData, noDataValue, options.returnMask);\n\n var result = {\n width: parsedData.width,\n height: parsedData.height,\n pixelData: uncompressedData.resultPixels,\n minValue: uncompressedData.minValue,\n maxValue: parsedData.pixels.maxValue,\n noDataValue: noDataValue\n };\n\n if (uncompressedData.resultMask) {\n result.maskData = uncompressedData.resultMask;\n }\n\n if (options.returnEncodedMask && parsedData.mask) {\n result.encodedMaskData = parsedData.mask.bitset ? parsedData.mask.bitset : null;\n }\n\n if (options.returnFileInfo) {\n result.fileInfo = formatFileInfo(parsedData);\n if (options.computeUsedBitDepths) {\n result.fileInfo.bitDepths = computeUsedBitDepths(parsedData);\n }\n }\n\n return result;\n };\n\n var uncompressPixelValues = function(data, TypedArrayClass, maskBitset, noDataValue, storeDecodedMask) {\n var blockIdx = 0;\n var numX = data.pixels.numBlocksX;\n var numY = data.pixels.numBlocksY;\n var blockWidth = Math.floor(data.width / numX);\n var blockHeight = Math.floor(data.height / numY);\n var scale = 2 * data.maxZError;\n var minValue = Number.MAX_VALUE, currentValue;\n maskBitset = maskBitset || ((data.mask) ? data.mask.bitset : null);\n\n var resultPixels, resultMask;\n resultPixels = new TypedArrayClass(data.width * data.height);\n if (storeDecodedMask && maskBitset) {\n resultMask = new Uint8Array(data.width * data.height);\n }\n var blockDataBuffer = new Float32Array(blockWidth * blockHeight);\n\n var xx, yy;\n for (var y = 0; y <= numY; y++) {\n var thisBlockHeight = (y !== numY) ? blockHeight : (data.height % numY);\n if (thisBlockHeight === 0) {\n continue;\n }\n for (var x = 0; x <= numX; x++) {\n var thisBlockWidth = (x !== numX) ? blockWidth : (data.width % numX);\n if (thisBlockWidth === 0) {\n continue;\n }\n\n var outPtr = y * data.width * blockHeight + x * blockWidth;\n var outStride = data.width - thisBlockWidth;\n\n var block = data.pixels.blocks[blockIdx];\n\n var blockData, blockPtr, constValue;\n if (block.encoding < 2) {\n // block is either uncompressed or bit-stuffed (encodings 0 and 1)\n if (block.encoding === 0) {\n // block is uncompressed\n blockData = block.rawData;\n } else {\n // block is bit-stuffed\n unstuff(block.stuffedData, block.bitsPerPixel, block.numValidPixels, block.offset, scale, blockDataBuffer, data.pixels.maxValue);\n blockData = blockDataBuffer;\n }\n blockPtr = 0;\n }\n else if (block.encoding === 2) {\n // block is all 0\n constValue = 0;\n }\n else {\n // block has constant value (encoding === 3)\n constValue = block.offset;\n }\n\n var maskByte;\n if (maskBitset) {\n for (yy = 0; yy < thisBlockHeight; yy++) {\n if (outPtr & 7) {\n //\n maskByte = maskBitset[outPtr >> 3];\n maskByte <<= outPtr & 7;\n }\n for (xx = 0; xx < thisBlockWidth; xx++) {\n if (!(outPtr & 7)) {\n // read next byte from mask\n maskByte = maskBitset[outPtr >> 3];\n }\n if (maskByte & 128) {\n // pixel data present\n if (resultMask) {\n resultMask[outPtr] = 1;\n }\n currentValue = (block.encoding < 2) ? blockData[blockPtr++] : constValue;\n minValue = minValue > currentValue ? currentValue : minValue;\n resultPixels[outPtr++] = currentValue;\n } else {\n // pixel data not present\n if (resultMask) {\n resultMask[outPtr] = 0;\n }\n resultPixels[outPtr++] = noDataValue;\n }\n maskByte <<= 1;\n }\n outPtr += outStride;\n }\n } else {\n // mask not present, simply copy block over\n if (block.encoding < 2) {\n // duplicating this code block for performance reasons\n // blockData case:\n for (yy = 0; yy < thisBlockHeight; yy++) {\n for (xx = 0; xx < thisBlockWidth; xx++) {\n currentValue = blockData[blockPtr++];\n minValue = minValue > currentValue ? currentValue : minValue;\n resultPixels[outPtr++] = currentValue;\n }\n outPtr += outStride;\n }\n }\n else {\n // constValue case:\n minValue = minValue > constValue ? constValue : minValue;\n for (yy = 0; yy < thisBlockHeight; yy++) {\n for (xx = 0; xx < thisBlockWidth; xx++) {\n resultPixels[outPtr++] = constValue;\n }\n outPtr += outStride;\n }\n }\n }\n if ((block.encoding === 1) && (blockPtr !== block.numValidPixels)) {\n throw \"Block and Mask do not match\";\n }\n blockIdx++;\n }\n }\n\n return {\n resultPixels: resultPixels,\n resultMask: resultMask,\n minValue: minValue\n };\n };\n\n var formatFileInfo = function(data) {\n return {\n \"fileIdentifierString\": data.fileIdentifierString,\n \"fileVersion\": data.fileVersion,\n \"imageType\": data.imageType,\n \"height\": data.height,\n \"width\": data.width,\n \"maxZError\": data.maxZError,\n \"eofOffset\": data.eofOffset,\n \"mask\": data.mask ? {\n \"numBlocksX\": data.mask.numBlocksX,\n \"numBlocksY\": data.mask.numBlocksY,\n \"numBytes\": data.mask.numBytes,\n \"maxValue\": data.mask.maxValue\n } : null,\n \"pixels\": {\n \"numBlocksX\": data.pixels.numBlocksX,\n \"numBlocksY\": data.pixels.numBlocksY,\n \"numBytes\": data.pixels.numBytes,\n \"maxValue\": data.pixels.maxValue,\n \"noDataValue\": data.noDataValue\n }\n };\n };\n\n var computeUsedBitDepths = function(data) {\n var numBlocks = data.pixels.numBlocksX * data.pixels.numBlocksY;\n var bitDepths = {};\n for (var i = 0; i < numBlocks; i++) {\n var block = data.pixels.blocks[i];\n if (block.encoding === 0) {\n bitDepths.float32 = true;\n } else if (block.encoding === 1) {\n bitDepths[block.bitsPerPixel] = true;\n } else {\n bitDepths[0] = true;\n }\n }\n\n return Object.keys(bitDepths);\n };\n\n var parse = function(input, fp, skipMask) {\n var data = {};\n\n // File header\n var fileIdView = new Uint8Array(input, fp, 10);\n data.fileIdentifierString = String.fromCharCode.apply(null, fileIdView);\n if (data.fileIdentifierString.trim() !== \"CntZImage\") {\n throw \"Unexpected file identifier string: \" + data.fileIdentifierString;\n }\n fp += 10;\n var view = new DataView(input, fp, 24);\n data.fileVersion = view.getInt32(0, true);\n data.imageType = view.getInt32(4, true);\n data.height = view.getUint32(8, true);\n data.width = view.getUint32(12, true);\n data.maxZError = view.getFloat64(16, true);\n fp += 24;\n\n // Mask Header\n if (!skipMask) {\n view = new DataView(input, fp, 16);\n data.mask = {};\n data.mask.numBlocksY = view.getUint32(0, true);\n data.mask.numBlocksX = view.getUint32(4, true);\n data.mask.numBytes = view.getUint32(8, true);\n data.mask.maxValue = view.getFloat32(12, true);\n fp += 16;\n\n // Mask Data\n if (data.mask.numBytes > 0) {\n var bitset = new Uint8Array(Math.ceil(data.width * data.height / 8));\n view = new DataView(input, fp, data.mask.numBytes);\n var cnt = view.getInt16(0, true);\n var ip = 2, op = 0;\n do {\n if (cnt > 0) {\n while (cnt--) { bitset[op++] = view.getUint8(ip++); }\n } else {\n var val = view.getUint8(ip++);\n cnt = -cnt;\n while (cnt--) { bitset[op++] = val; }\n }\n cnt = view.getInt16(ip, true);\n ip += 2;\n } while (ip < data.mask.numBytes);\n if ((cnt !== -32768) || (op < bitset.length)) {\n throw \"Unexpected end of mask RLE encoding\";\n }\n data.mask.bitset = bitset;\n fp += data.mask.numBytes;\n }\n else if ((data.mask.numBytes | data.mask.numBlocksY | data.mask.maxValue) === 0) { // Special case, all nodata\n data.mask.bitset = new Uint8Array(Math.ceil(data.width * data.height / 8));\n }\n }\n\n // Pixel Header\n view = new DataView(input, fp, 16);\n data.pixels = {};\n data.pixels.numBlocksY = view.getUint32(0, true);\n data.pixels.numBlocksX = view.getUint32(4, true);\n data.pixels.numBytes = view.getUint32(8, true);\n data.pixels.maxValue = view.getFloat32(12, true);\n fp += 16;\n\n var numBlocksX = data.pixels.numBlocksX;\n var numBlocksY = data.pixels.numBlocksY;\n // the number of blocks specified in the header does not take into account the blocks at the end of\n // each row/column with a special width/height that make the image complete in case the width is not\n // evenly divisible by the number of blocks.\n var actualNumBlocksX = numBlocksX + ((data.width % numBlocksX) > 0 ? 1 : 0);\n var actualNumBlocksY = numBlocksY + ((data.height % numBlocksY) > 0 ? 1 : 0);\n data.pixels.blocks = new Array(actualNumBlocksX * actualNumBlocksY);\n var blockI = 0;\n for (var blockY = 0; blockY < actualNumBlocksY; blockY++) {\n for (var blockX = 0; blockX < actualNumBlocksX; blockX++) {\n\n // Block\n var size = 0;\n var bytesLeft = input.byteLength - fp;\n view = new DataView(input, fp, Math.min(10, bytesLeft));\n var block = {};\n data.pixels.blocks[blockI++] = block;\n var headerByte = view.getUint8(0); size++;\n block.encoding = headerByte & 63;\n if (block.encoding > 3) {\n throw \"Invalid block encoding (\" + block.encoding + \")\";\n }\n if (block.encoding === 2) {\n fp++;\n continue;\n }\n if ((headerByte !== 0) && (headerByte !== 2)) {\n headerByte >>= 6;\n block.offsetType = headerByte;\n if (headerByte === 2) {\n block.offset = view.getInt8(1); size++;\n } else if (headerByte === 1) {\n block.offset = view.getInt16(1, true); size += 2;\n } else if (headerByte === 0) {\n block.offset = view.getFloat32(1, true); size += 4;\n } else {\n throw \"Invalid block offset type\";\n }\n\n if (block.encoding === 1) {\n headerByte = view.getUint8(size); size++;\n block.bitsPerPixel = headerByte & 63;\n headerByte >>= 6;\n block.numValidPixelsType = headerByte;\n if (headerByte === 2) {\n block.numValidPixels = view.getUint8(size); size++;\n } else if (headerByte === 1) {\n block.numValidPixels = view.getUint16(size, true); size += 2;\n } else if (headerByte === 0) {\n block.numValidPixels = view.getUint32(size, true); size += 4;\n } else {\n throw \"Invalid valid pixel count type\";\n }\n }\n }\n fp += size;\n\n if (block.encoding === 3) {\n continue;\n }\n\n var arrayBuf, store8;\n if (block.encoding === 0) {\n var numPixels = (data.pixels.numBytes - 1) / 4;\n if (numPixels !== Math.floor(numPixels)) {\n throw \"uncompressed block has invalid length\";\n }\n arrayBuf = new ArrayBuffer(numPixels * 4);\n store8 = new Uint8Array(arrayBuf);\n store8.set(new Uint8Array(input, fp, numPixels * 4));\n var rawData = new Float32Array(arrayBuf);\n block.rawData = rawData;\n fp += numPixels * 4;\n } else if (block.encoding === 1) {\n var dataBytes = Math.ceil(block.numValidPixels * block.bitsPerPixel / 8);\n var dataWords = Math.ceil(dataBytes / 4);\n arrayBuf = new ArrayBuffer(dataWords * 4);\n store8 = new Uint8Array(arrayBuf);\n store8.set(new Uint8Array(input, fp, dataBytes));\n block.stuffedData = new Uint32Array(arrayBuf);\n fp += dataBytes;\n }\n }\n }\n data.eofOffset = fp;\n return data;\n };\n\n var unstuff = function(src, bitsPerPixel, numPixels, offset, scale, dest, maxValue) {\n var bitMask = (1 << bitsPerPixel) - 1;\n var i = 0, o;\n var bitsLeft = 0;\n var n, buffer;\n var nmax = Math.ceil((maxValue - offset) / scale);\n // get rid of trailing bytes that are already part of next block\n var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);\n src[src.length - 1] <<= 8 * numInvalidTailBytes;\n\n for (o = 0; o < numPixels; o++) {\n if (bitsLeft === 0) {\n buffer = src[i++];\n bitsLeft = 32;\n }\n if (bitsLeft >= bitsPerPixel) {\n n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;\n bitsLeft -= bitsPerPixel;\n } else {\n var missingBits = (bitsPerPixel - bitsLeft);\n n = ((buffer & bitMask) << missingBits) & bitMask;\n buffer = src[i++];\n bitsLeft = 32 - missingBits;\n n += (buffer >>> bitsLeft);\n }\n //pixel values may exceed max due to quantization\n dest[o] = n < nmax ? offset + n * scale : maxValue;\n }\n return dest;\n };\n\n return CntZImage;\n })();\n\n //version 2. Supports 2.1, 2.2, 2.3\n var Lerc2Decode = (function() {\n \"use strict\";\n // Note: currently, this module only has an implementation for decoding LERC data, not encoding. The name of\n // the class was chosen to be future proof, following LercDecode.\n\n /*****************************************\n * private static class bitsutffer used by Lerc2Decode\n *******************************************/\n var BitStuffer = {\n //methods ending with 2 are for the new byte order used by Lerc2.3 and above.\n //originalUnstuff is used to unpack Huffman code table. code is duplicated to unstuffx for performance reasons.\n unstuff: function(src, dest, bitsPerPixel, numPixels, lutArr, offset, scale, maxValue) {\n var bitMask = (1 << bitsPerPixel) - 1;\n var i = 0, o;\n var bitsLeft = 0;\n var n, buffer, missingBits, nmax;\n\n // get rid of trailing bytes that are already part of next block\n var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);\n src[src.length - 1] <<= 8 * numInvalidTailBytes;\n if (lutArr) {\n for (o = 0; o < numPixels; o++) {\n if (bitsLeft === 0) {\n buffer = src[i++];\n bitsLeft = 32;\n }\n if (bitsLeft >= bitsPerPixel) {\n n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;\n bitsLeft -= bitsPerPixel;\n }\n else {\n missingBits = (bitsPerPixel - bitsLeft);\n n = ((buffer & bitMask) << missingBits) & bitMask;\n buffer = src[i++];\n bitsLeft = 32 - missingBits;\n n += (buffer >>> bitsLeft);\n }\n dest[o] = lutArr[n];//offset + lutArr[n] * scale;\n }\n }\n else {\n nmax = Math.ceil((maxValue - offset) / scale);\n for (o = 0; o < numPixels; o++) {\n if (bitsLeft === 0) {\n buffer = src[i++];\n bitsLeft = 32;\n }\n if (bitsLeft >= bitsPerPixel) {\n n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;\n bitsLeft -= bitsPerPixel;\n }\n else {\n missingBits = (bitsPerPixel - bitsLeft);\n n = ((buffer & bitMask) << missingBits) & bitMask;\n buffer = src[i++];\n bitsLeft = 32 - missingBits;\n n += (buffer >>> bitsLeft);\n }\n //pixel values may exceed max due to quantization\n dest[o] = n < nmax ? offset + n * scale : maxValue;\n }\n }\n },\n\n unstuffLUT: function(src, bitsPerPixel, numPixels, offset, scale, maxValue) {\n var bitMask = (1 << bitsPerPixel) - 1;\n var i = 0, o = 0, missingBits = 0, bitsLeft = 0, n = 0;\n var buffer;\n var dest = [];\n\n // get rid of trailing bytes that are already part of next block\n var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);\n src[src.length - 1] <<= 8 * numInvalidTailBytes;\n\n var nmax = Math.ceil((maxValue - offset) / scale);\n for (o = 0; o < numPixels; o++) {\n if (bitsLeft === 0) {\n buffer = src[i++];\n bitsLeft = 32;\n }\n if (bitsLeft >= bitsPerPixel) {\n n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;\n bitsLeft -= bitsPerPixel;\n } else {\n missingBits = (bitsPerPixel - bitsLeft);\n n = ((buffer & bitMask) << missingBits) & bitMask;\n buffer = src[i++];\n bitsLeft = 32 - missingBits;\n n += (buffer >>> bitsLeft);\n }\n //dest.push(n);\n dest[o] = n < nmax ? offset + n * scale : maxValue;\n }\n dest.unshift(offset);//1st one\n return dest;\n },\n\n unstuff2: function(src, dest, bitsPerPixel, numPixels, lutArr, offset, scale, maxValue) {\n var bitMask = (1 << bitsPerPixel) - 1;\n var i = 0, o;\n var bitsLeft = 0, bitPos = 0;\n var n, buffer, missingBits;\n if (lutArr) {\n for (o = 0; o < numPixels; o++) {\n if (bitsLeft === 0) {\n buffer = src[i++];\n bitsLeft = 32;\n bitPos = 0;\n }\n if (bitsLeft >= bitsPerPixel) {\n n = ((buffer >>> bitPos) & bitMask);\n bitsLeft -= bitsPerPixel;\n bitPos += bitsPerPixel;\n } else {\n missingBits = (bitsPerPixel - bitsLeft);\n n = (buffer >>> bitPos) & bitMask;\n buffer = src[i++];\n bitsLeft = 32 - missingBits;\n n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);\n bitPos = missingBits;\n }\n dest[o] = lutArr[n];\n }\n }\n else {\n var nmax = Math.ceil((maxValue - offset) / scale);\n for (o = 0; o < numPixels; o++) {\n if (bitsLeft === 0) {\n buffer = src[i++];\n bitsLeft = 32;\n bitPos = 0;\n }\n if (bitsLeft >= bitsPerPixel) {\n //no unsigned left shift\n n = ((buffer >>> bitPos) & bitMask);\n bitsLeft -= bitsPerPixel;\n bitPos += bitsPerPixel;\n } else {\n missingBits = (bitsPerPixel - bitsLeft);\n n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask;\n buffer = src[i++];\n bitsLeft = 32 - missingBits;\n n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);\n bitPos = missingBits;\n }\n //pixel values may exceed max due to quantization\n dest[o] = n < nmax ? offset + n * scale : maxValue;\n }\n }\n return dest;\n },\n\n unstuffLUT2: function(src, bitsPerPixel, numPixels, offset, scale, maxValue) {\n var bitMask = (1 << bitsPerPixel) - 1;\n var i = 0, o = 0, missingBits = 0, bitsLeft = 0, n = 0, bitPos = 0;\n var buffer;\n var dest = [];\n var nmax = Math.ceil((maxValue - offset) / scale);\n for (o = 0; o < numPixels; o++) {\n if (bitsLeft === 0) {\n buffer = src[i++];\n bitsLeft = 32;\n bitPos = 0;\n }\n if (bitsLeft >= bitsPerPixel) {\n //no unsigned left shift\n n = ((buffer >>> bitPos) & bitMask);\n bitsLeft -= bitsPerPixel;\n bitPos += bitsPerPixel;\n } else {\n missingBits = (bitsPerPixel - bitsLeft);\n n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask;\n buffer = src[i++];\n bitsLeft = 32 - missingBits;\n n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);\n bitPos = missingBits;\n }\n //dest.push(n);\n dest[o] = n < nmax ? offset + n * scale : maxValue;\n }\n dest.unshift(offset);\n return dest;\n },\n\n originalUnstuff: function(src, dest, bitsPerPixel, numPixels) {\n var bitMask = (1 << bitsPerPixel) - 1;\n var i = 0, o;\n var bitsLeft = 0;\n var n, buffer, missingBits;\n\n // get rid of trailing bytes that are already part of next block\n var numInvalidTailBytes = src.length * 4 - Math.ceil(bitsPerPixel * numPixels / 8);\n src[src.length - 1] <<= 8 * numInvalidTailBytes;\n\n for (o = 0; o < numPixels; o++) {\n if (bitsLeft === 0) {\n buffer = src[i++];\n bitsLeft = 32;\n }\n if (bitsLeft >= bitsPerPixel) {\n n = (buffer >>> (bitsLeft - bitsPerPixel)) & bitMask;\n bitsLeft -= bitsPerPixel;\n }\n else {\n missingBits = (bitsPerPixel - bitsLeft);\n n = ((buffer & bitMask) << missingBits) & bitMask;\n buffer = src[i++];\n bitsLeft = 32 - missingBits;\n n += (buffer >>> bitsLeft);\n }\n dest[o] = n;\n }\n return dest;\n },\n\n originalUnstuff2: function(src, dest, bitsPerPixel, numPixels) {\n var bitMask = (1 << bitsPerPixel) - 1;\n var i = 0, o;\n var bitsLeft = 0, bitPos = 0;\n var n, buffer, missingBits;\n //micro-optimizations\n for (o = 0; o < numPixels; o++) {\n if (bitsLeft === 0) {\n buffer = src[i++];\n bitsLeft = 32;\n bitPos = 0;\n }\n if (bitsLeft >= bitsPerPixel) {\n //no unsigned left shift\n n = ((buffer >>> bitPos) & bitMask);\n bitsLeft -= bitsPerPixel;\n bitPos += bitsPerPixel;\n } else {\n missingBits = (bitsPerPixel - bitsLeft);\n n = (buffer >>> bitPos) & bitMask;//((buffer & bitMask) << missingBits) & bitMask;\n buffer = src[i++];\n bitsLeft = 32 - missingBits;\n n |= (buffer & ((1 << missingBits) - 1)) << (bitsPerPixel - missingBits);\n bitPos = missingBits;\n }\n dest[o] = n;\n }\n return dest;\n }\n };\n\n /*****************************************\n *private static class used by Lerc2Decode\n ******************************************/\n var Lerc2Helpers = {\n HUFFMAN_LUT_BITS_MAX: 12, //use 2^12 lut, treat it like constant\n computeChecksumFletcher32: function(input) {\n\n var sum1 = 0xffff, sum2 = 0xffff;\n var len = input.length;\n var words = Math.floor(len / 2);\n var i = 0;\n while (words) {\n var tlen = (words >= 359) ? 359 : words;\n words -= tlen;\n do {\n sum1 += (input[i++] << 8);\n sum2 += sum1 += input[i++];\n } while (--tlen);\n\n sum1 = (sum1 & 0xffff) + (sum1 >>> 16);\n sum2 = (sum2 & 0xffff) + (sum2 >>> 16);\n }\n\n // add the straggler byte if it exists\n if (len & 1) {\n sum2 += sum1 += (input[i] << 8);\n }\n // second reduction step to reduce sums to 16 bits\n sum1 = (sum1 & 0xffff) + (sum1 >>> 16);\n sum2 = (sum2 & 0xffff) + (sum2 >>> 16);\n\n return (sum2 << 16 | sum1) >>> 0;\n },\n\n readHeaderInfo: function(input, data) {\n var ptr = data.ptr;\n var fileIdView = new Uint8Array(input, ptr, 6);\n var headerInfo = {};\n headerInfo.fileIdentifierString = String.fromCharCode.apply(null, fileIdView);\n if (headerInfo.fileIdentifierString.lastIndexOf(\"Lerc2\", 0) !== 0) {\n throw \"Unexpected file identifier string (expect Lerc2 ): \" + headerInfo.fileIdentifierString;\n }\n ptr += 6;\n var view = new DataView(input, ptr, 8);\n var fileVersion = view.getInt32(0, true);\n headerInfo.fileVersion = fileVersion;\n ptr += 4;\n if (fileVersion >= 3) {\n headerInfo.checksum = view.getUint32(4, true); //nrows\n ptr += 4;\n }\n\n //keys start from here\n view = new DataView(input, ptr, 12);\n headerInfo.height = view.getUint32(0, true); //nrows\n headerInfo.width = view.getUint32(4, true); //ncols\n ptr += 8;\n if (fileVersion >= 4) {\n headerInfo.numDims = view.getUint32(8, true);\n ptr += 4;\n }\n else {\n headerInfo.numDims = 1;\n }\n\n view = new DataView(input, ptr, 40);\n headerInfo.numValidPixel = view.getUint32(0, true);\n headerInfo.microBlockSize = view.getInt32(4, true);\n headerInfo.blobSize = view.getInt32(8, true);\n headerInfo.imageType = view.getInt32(12, true);\n\n headerInfo.maxZError = view.getFloat64(16, true);\n headerInfo.zMin = view.getFloat64(24, true);\n headerInfo.zMax = view.getFloat64(32, true);\n ptr += 40;\n data.headerInfo = headerInfo;\n data.ptr = ptr;\n\n var checksum, keyLength;\n if (fileVersion >= 3) {\n keyLength = fileVersion >= 4 ? 52 : 48;\n checksum = this.computeChecksumFletcher32(new Uint8Array(input, ptr - keyLength, headerInfo.blobSize - 14));\n if (checksum !== headerInfo.checksum) {\n throw \"Checksum failed.\";\n }\n }\n return true;\n },\n\n checkMinMaxRanges: function(input, data) {\n var headerInfo = data.headerInfo;\n var OutPixelTypeArray = this.getDataTypeArray(headerInfo.imageType);\n var rangeBytes = headerInfo.numDims * this.getDataTypeSize(headerInfo.imageType);\n var minValues = this.readSubArray(input, data.ptr, OutPixelTypeArray, rangeBytes);\n var maxValues = this.readSubArray(input, data.ptr + rangeBytes, OutPixelTypeArray, rangeBytes);\n data.ptr += (2 * rangeBytes);\n var i, equal = true;\n for (i = 0; i < headerInfo.numDims; i++) {\n if (minValues[i] !== maxValues[i]) {\n equal = false;\n break;\n }\n }\n headerInfo.minValues = minValues;\n headerInfo.maxValues = maxValues;\n return equal;\n },\n\n readSubArray: function(input, ptr, OutPixelTypeArray, numBytes) {\n var rawData;\n if (OutPixelTypeArray === Uint8Array) {\n rawData = new Uint8Array(input, ptr, numBytes);\n }\n else {\n var arrayBuf = new ArrayBuffer(numBytes);\n var store8 = new Uint8Array(arrayBuf);\n store8.set(new Uint8Array(input, ptr, numBytes));\n rawData = new OutPixelTypeArray(arrayBuf);\n }\n return rawData;\n },\n\n readMask: function(input, data) {\n var ptr = data.ptr;\n var headerInfo = data.headerInfo;\n var numPixels = headerInfo.width * headerInfo.height;\n var numValidPixel = headerInfo.numValidPixel;\n\n var view = new DataView(input, ptr, 4);\n var mask = {};\n mask.numBytes = view.getUint32(0, true);\n ptr += 4;\n\n // Mask Data\n if ((0 === numValidPixel || numPixels === numValidPixel) && 0 !== mask.numBytes) {\n throw (\"invalid mask\");\n }\n var bitset, resultMask;\n if (numValidPixel === 0) {\n bitset = new Uint8Array(Math.ceil(numPixels / 8));\n mask.bitset = bitset;\n resultMask = new Uint8Array(numPixels);\n data.pixels.resultMask = resultMask;\n ptr += mask.numBytes;\n }// ????? else if (data.mask.numBytes > 0 && data.mask.numBytes< data.numValidPixel) {\n else if (mask.numBytes > 0) {\n bitset = new Uint8Array(Math.ceil(numPixels / 8));\n view = new DataView(input, ptr, mask.numBytes);\n var cnt = view.getInt16(0, true);\n var ip = 2, op = 0, val = 0;\n do {\n if (cnt > 0) {\n while (cnt--) { bitset[op++] = view.getUint8(ip++); }\n } else {\n val = view.getUint8(ip++);\n cnt = -cnt;\n while (cnt--) { bitset[op++] = val; }\n }\n cnt = view.getInt16(ip, true);\n ip += 2;\n } while (ip < mask.numBytes);\n if ((cnt !== -32768) || (op < bitset.length)) {\n throw \"Unexpected end of mask RLE encoding\";\n }\n\n resultMask = new Uint8Array(numPixels);\n var mb = 0, k = 0;\n\n for (k = 0; k < numPixels; k++) {\n if (k & 7) {\n mb = bitset[k >> 3];\n mb <<= k & 7;\n }\n else {\n mb = bitset[k >> 3];\n }\n if (mb & 128) {\n resultMask[k] = 1;\n }\n }\n data.pixels.resultMask = resultMask;\n\n mask.bitset = bitset;\n ptr += mask.numBytes;\n }\n data.ptr = ptr;\n data.mask = mask;\n return true;\n },\n\n readDataOneSweep: function(input, data, OutPixelTypeArray, useBSQForOutputDim) {\n var ptr = data.ptr;\n var headerInfo = data.headerInfo;\n var numDims = headerInfo.numDims;\n var numPixels = headerInfo.width * headerInfo.height;\n var imageType = headerInfo.imageType;\n var numBytes = headerInfo.numValidPixel * Lerc2Helpers.getDataTypeSize(imageType) * numDims;\n //data.pixels.numBytes = numBytes;\n var rawData;\n var mask = data.pixels.resultMask;\n if (OutPixelTypeArray === Uint8Array) {\n rawData = new Uint8Array(input, ptr, numBytes);\n }\n else {\n var arrayBuf = new ArrayBuffer(numBytes);\n var store8 = new Uint8Array(arrayBuf);\n store8.set(new Uint8Array(input, ptr, numBytes));\n rawData = new OutPixelTypeArray(arrayBuf);\n }\n if (rawData.length === numPixels * numDims) {\n if (useBSQForOutputDim) {\n data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(rawData, numPixels, numDims, OutPixelTypeArray, true);\n }\n else {\n data.pixels.resultPixels = rawData;\n }\n }\n else //mask\n {\n data.pixels.resultPixels = new OutPixelTypeArray(numPixels * numDims);\n var z = 0, k = 0, i = 0, nStart = 0;\n if (numDims > 1) {\n if (useBSQForOutputDim) {\n for (k = 0; k < numPixels; k++) {\n if (mask[k]) {\n nStart = k;\n for (i = 0; i < numDims; i++, nStart+=numPixels) {\n data.pixels.resultPixels[nStart] = rawData[z++];\n }\n }\n }\n }\n else {\n for (k = 0; k < numPixels; k++) {\n if (mask[k]) {\n nStart = k * numDims;\n for (i = 0; i < numDims; i++) {\n data.pixels.resultPixels[nStart + i] = rawData[z++];\n }\n }\n }\n }\n }\n else {\n for (k = 0; k < numPixels; k++) {\n if (mask[k]) {\n data.pixels.resultPixels[k] = rawData[z++];\n }\n }\n }\n }\n ptr += numBytes;\n data.ptr = ptr; //return data;\n return true;\n },\n\n readHuffmanTree: function(input, data) {\n var BITS_MAX = this.HUFFMAN_LUT_BITS_MAX; //8 is slow for the large test image\n //var size_max = 1 << BITS_MAX;\n /* ************************\n * reading code table\n *************************/\n var view = new DataView(input, data.ptr, 16);\n data.ptr += 16;\n var version = view.getInt32(0, true);\n if (version < 2) {\n throw \"unsupported Huffman version\";\n }\n var size = view.getInt32(4, true);\n var i0 = view.getInt32(8, true);\n var i1 = view.getInt32(12, true);\n if (i0 >= i1) {\n return false;\n }\n var blockDataBuffer = new Uint32Array(i1 - i0);\n Lerc2Helpers.decodeBits(input, data, blockDataBuffer);\n var codeTable = []; //size\n var i, j, k, len;\n\n for (i = i0; i < i1; i++) {\n j = i - (i < size ? 0 : size);//wrap around\n codeTable[j] = { first: blockDataBuffer[i - i0], second: null };\n }\n\n var dataBytes = input.byteLength - data.ptr;\n var dataWords = Math.ceil(dataBytes / 4);\n var arrayBuf = new ArrayBuffer(dataWords * 4);\n var store8 = new Uint8Array(arrayBuf);\n store8.set(new Uint8Array(input, data.ptr, dataBytes));\n var stuffedData = new Uint32Array(arrayBuf); //must start from x*4\n var bitPos = 0, word, srcPtr = 0;\n word = stuffedData[0];\n for (i = i0; i < i1; i++) {\n j = i - (i < size ? 0 : size);//wrap around\n len = codeTable[j].first;\n if (len > 0) {\n codeTable[j].second = (word << bitPos) >>> (32 - len);\n\n if (32 - bitPos >= len) {\n bitPos += len;\n if (bitPos === 32) {\n bitPos = 0;\n srcPtr++;\n word = stuffedData[srcPtr];\n }\n }\n else {\n bitPos += len - 32;\n srcPtr++;\n word = stuffedData[srcPtr];\n codeTable[j].second |= word >>> (32 - bitPos);\n }\n }\n }\n\n //finished reading code table\n\n /* ************************\n * building lut\n *************************/\n var numBitsLUT = 0, numBitsLUTQick = 0;\n var tree = new TreeNode();\n for (i = 0; i < codeTable.length; i++) {\n if (codeTable[i] !== undefined) {\n numBitsLUT = Math.max(numBitsLUT, codeTable[i].first);\n }\n }\n if (numBitsLUT >= BITS_MAX) {\n numBitsLUTQick = BITS_MAX;\n }\n else {\n numBitsLUTQick = numBitsLUT;\n }\n // for debugging purpose\n // if (numBitsLUT >= 30) {\n // console.log(\"WARning, large NUM LUT BITS IS \" + numBitsLUT);\n // }\n var decodeLut = [], entry, code, numEntries, jj, currentBit, node;\n for (i = i0; i < i1; i++) {\n j = i - (i < size ? 0 : size);//wrap around\n len = codeTable[j].first;\n if (len > 0) {\n entry = [len, j];\n if (len <= numBitsLUTQick) {\n code = codeTable[j].second << (numBitsLUTQick - len);\n numEntries = 1 << (numBitsLUTQick - len);\n for (k = 0; k < numEntries; k++) {\n decodeLut[code | k] = entry;\n }\n }\n else {\n //build tree\n code = codeTable[j].second;\n node = tree;\n for (jj = len - 1; jj >= 0; jj--) {\n currentBit = code >>> jj & 1; //no left shift as length could be 30,31\n if (currentBit) {\n if (!node.right) {\n node.right = new TreeNode();\n }\n node = node.right;\n }\n else {\n if (!node.left) {\n node.left = new TreeNode();\n }\n node = node.left;\n }\n if (jj === 0 && !node.val) {\n node.val = entry[1];\n }\n }\n }\n }\n }\n return {\n decodeLut: decodeLut,\n numBitsLUTQick: numBitsLUTQick,\n numBitsLUT: numBitsLUT,\n tree: tree,\n stuffedData: stuffedData,\n srcPtr: srcPtr,\n bitPos: bitPos\n };\n },\n\n readHuffman: function(input, data, OutPixelTypeArray, useBSQForOutputDim) {\n var headerInfo = data.headerInfo;\n var numDims = headerInfo.numDims;\n var height = data.headerInfo.height;\n var width = data.headerInfo.width;\n var numPixels = width * height;\n //var size_max = 1 << BITS_MAX;\n /* ************************\n * reading huffman structure info\n *************************/\n var huffmanInfo = this.readHuffmanTree(input, data);\n var decodeLut = huffmanInfo.decodeLut;\n var tree = huffmanInfo.tree;\n //stuffedData includes huffman headers\n var stuffedData = huffmanInfo.stuffedData;\n var srcPtr = huffmanInfo.srcPtr;\n var bitPos = huffmanInfo.bitPos;\n var numBitsLUTQick = huffmanInfo.numBitsLUTQick;\n var numBitsLUT = huffmanInfo.numBitsLUT;\n var offset = data.headerInfo.imageType === 0 ? 128 : 0;\n /*************************\n * decode\n ***************************/\n var node, val, delta, mask = data.pixels.resultMask, valTmp, valTmpQuick, currentBit;\n var i, j, k, ii;\n var prevVal = 0;\n if (bitPos > 0) {\n srcPtr++;\n bitPos = 0;\n }\n var word = stuffedData[srcPtr];\n var deltaEncode = data.encodeMode === 1;\n var resultPixelsAllDim = new OutPixelTypeArray(numPixels * numDims);\n var resultPixels = resultPixelsAllDim;\n var iDim;\n // TODO: reevaluate the need to keep inlined decoding code as IE support is phasing out\n if (numDims < 2 || deltaEncode) {\n for (iDim = 0; iDim < numDims; iDim++) {\n if (numDims > 1) {\n //get the mem block of current dimension\n resultPixels = new OutPixelTypeArray(resultPixelsAllDim.buffer, numPixels * iDim, numPixels);\n prevVal = 0;\n }\n if (data.headerInfo.numValidPixel === width * height) { //all valid\n for (k = 0, i = 0; i < height; i++) {\n for (j = 0; j < width; j++, k++) {\n val = 0;\n valTmp = (word << bitPos) >>> (32 - numBitsLUTQick);\n valTmpQuick = valTmp;// >>> deltaBits;\n if (32 - bitPos < numBitsLUTQick) {\n valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick));\n valTmpQuick = valTmp;// >>> deltaBits;\n }\n if (decodeLut[valTmpQuick]) // if there, move the correct number of bits and done\n {\n val = decodeLut[valTmpQuick][1];\n bitPos += decodeLut[valTmpQuick][0];\n }\n else {\n valTmp = (word << bitPos) >>> (32 - numBitsLUT);\n valTmpQuick = valTmp;// >>> deltaBits;\n if (32 - bitPos < numBitsLUT) {\n valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT));\n valTmpQuick = valTmp;// >>> deltaBits;\n }\n node = tree;\n for (ii = 0; ii < numBitsLUT; ii++) {\n currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1;\n node = currentBit ? node.right : node.left;\n if (!(node.left || node.right)) {\n val = node.val;\n bitPos = bitPos + ii + 1;\n break;\n }\n }\n }\n \n if (bitPos >= 32) {\n bitPos -= 32;\n srcPtr++;\n word = stuffedData[srcPtr];\n }\n \n delta = val - offset;\n if (deltaEncode) {\n if (j > 0) {\n delta += prevVal; // use overflow\n }\n else if (i > 0) {\n delta += resultPixels[k - width];\n }\n else {\n delta += prevVal;\n }\n delta &= 0xFF; //overflow\n resultPixels[k] = delta;//overflow\n prevVal = delta;\n }\n else {\n resultPixels[k] = delta;\n }\n }\n }\n }\n else { //not all valid, use mask\n for (k = 0, i = 0; i < height; i++) {\n for (j = 0; j < width; j++, k++) {\n if (mask[k]) {\n val = 0;\n valTmp = (word << bitPos) >>> (32 - numBitsLUTQick);\n valTmpQuick = valTmp;// >>> deltaBits;\n if (32 - bitPos < numBitsLUTQick) {\n valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick));\n valTmpQuick = valTmp;// >>> deltaBits;\n }\n if (decodeLut[valTmpQuick]) // if there, move the correct number of bits and done\n {\n val = decodeLut[valTmpQuick][1];\n bitPos += decodeLut[valTmpQuick][0];\n }\n else {\n valTmp = (word << bitPos) >>> (32 - numBitsLUT);\n valTmpQuick = valTmp;// >>> deltaBits;\n if (32 - bitPos < numBitsLUT) {\n valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT));\n valTmpQuick = valTmp;// >>> deltaBits;\n }\n node = tree;\n for (ii = 0; ii < numBitsLUT; ii++) {\n currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1;\n node = currentBit ? node.right : node.left;\n if (!(node.left || node.right)) {\n val = node.val;\n bitPos = bitPos + ii + 1;\n break;\n }\n }\n }\n \n if (bitPos >= 32) {\n bitPos -= 32;\n srcPtr++;\n word = stuffedData[srcPtr];\n }\n \n delta = val - offset;\n if (deltaEncode) {\n if (j > 0 && mask[k - 1]) {\n delta += prevVal; // use overflow\n }\n else if (i > 0 && mask[k - width]) {\n delta += resultPixels[k - width];\n }\n else {\n delta += prevVal;\n }\n \n delta &= 0xFF; //overflow\n resultPixels[k] = delta;//overflow\n prevVal = delta;\n }\n else {\n resultPixels[k] = delta;\n }\n }\n }\n }\n }\n }\n }\n else {\n for (k = 0, i = 0; i < height; i++) {\n for (j = 0; j < width; j++) {\n k = i * width + j;\n if (!mask || mask[k]) {\n for (iDim = 0; iDim < numDims; iDim++, k+=numPixels) {\n val = 0;\n valTmp = (word << bitPos) >>> (32 - numBitsLUTQick);\n valTmpQuick = valTmp;\n if (32 - bitPos < numBitsLUTQick) {\n valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUTQick));\n valTmpQuick = valTmp;\n }\n if (decodeLut[valTmpQuick])\n {\n val = decodeLut[valTmpQuick][1];\n bitPos += decodeLut[valTmpQuick][0];\n }\n else {\n valTmp = (word << bitPos) >>> (32 - numBitsLUT);\n valTmpQuick = valTmp;\n if (32 - bitPos < numBitsLUT) {\n valTmp |= ((stuffedData[srcPtr + 1]) >>> (64 - bitPos - numBitsLUT));\n valTmpQuick = valTmp;\n }\n node = tree;\n for (ii = 0; ii < numBitsLUT; ii++) {\n currentBit = valTmp >>> (numBitsLUT - ii - 1) & 1;\n node = currentBit ? node.right : node.left;\n if (!(node.left || node.right)) {\n val = node.val;\n bitPos = bitPos + ii + 1;\n break;\n }\n }\n }\n\n if (bitPos >= 32) {\n bitPos -= 32;\n srcPtr++;\n word = stuffedData[srcPtr];\n }\n\n delta = val - offset;\n resultPixels[k] = delta;\n }\n }\n }\n }\n }\n data.ptr = data.ptr + (srcPtr + 1) * 4 + (bitPos > 0 ? 4 : 0);\n data.pixels.resultPixels = resultPixelsAllDim;\n //swap for BIP layout\n if (numDims > 1 && !useBSQForOutputDim) {\n data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(resultPixelsAllDim, numPixels, numDims, OutPixelTypeArray);\n }\n },\n\n decodeBits: function(input, data, blockDataBuffer, offset, iDim) {\n {\n //bitstuff encoding is 3\n var headerInfo = data.headerInfo;\n var fileVersion = headerInfo.fileVersion;\n //var block = {};\n var blockPtr = 0;\n var viewByteLength = ((input.byteLength - data.ptr) >= 5) ? 5 : (input.byteLength - data.ptr);\n var view = new DataView(input, data.ptr, viewByteLength);\n var headerByte = view.getUint8(0);\n blockPtr++;\n var bits67 = headerByte >> 6;\n var n = (bits67 === 0) ? 4 : 3 - bits67;\n var doLut = (headerByte & 32) > 0 ? true : false;//5th bit\n var numBits = headerByte & 31;\n var numElements = 0;\n if (n === 1) {\n numElements = view.getUint8(blockPtr); blockPtr++;\n } else if (n === 2) {\n numElements = view.getUint16(blockPtr, true); blockPtr += 2;\n } else if (n === 4) {\n numElements = view.getUint32(blockPtr, true); blockPtr += 4;\n } else {\n throw \"Invalid valid pixel count type\";\n }\n //fix: huffman codes are bit stuffed, but not bound by data's max value, so need to use originalUnstuff\n //offset = offset || 0;\n var scale = 2 * headerInfo.maxZError;\n var stuffedData, arrayBuf, store8, dataBytes, dataWords;\n var lutArr, lutData, lutBytes, lutBitsPerElement, bitsPerPixel;\n var zMax = headerInfo.numDims > 1 ? headerInfo.maxValues[iDim] : headerInfo.zMax;\n if (doLut) {\n data.counter.lut++;\n lutBytes = view.getUint8(blockPtr);\n lutBitsPerElement = numBits;\n blockPtr++;\n dataBytes = Math.ceil((lutBytes - 1) * numBits / 8);\n dataWords = Math.ceil(dataBytes / 4);\n arrayBuf = new ArrayBuffer(dataWords * 4);\n store8 = new Uint8Array(arrayBuf);\n\n data.ptr += blockPtr;\n store8.set(new Uint8Array(input, data.ptr, dataBytes));\n\n lutData = new Uint32Array(arrayBuf);\n data.ptr += dataBytes;\n\n bitsPerPixel = 0;\n while ((lutBytes - 1) >>> bitsPerPixel) {\n bitsPerPixel++;\n }\n dataBytes = Math.ceil(numElements * bitsPerPixel / 8);\n dataWords = Math.ceil(dataBytes / 4);\n arrayBuf = new ArrayBuffer(dataWords * 4);\n store8 = new Uint8Array(arrayBuf);\n store8.set(new Uint8Array(input, data.ptr, dataBytes));\n stuffedData = new Uint32Array(arrayBuf);\n data.ptr += dataBytes;\n if (fileVersion >= 3) {\n lutArr = BitStuffer.unstuffLUT2(lutData, numBits, lutBytes - 1, offset, scale, zMax);\n }\n else {\n lutArr = BitStuffer.unstuffLUT(lutData, numBits, lutBytes - 1, offset, scale, zMax);\n }\n //lutArr.unshift(0);\n if (fileVersion >= 3) {\n //BitStuffer.unstuff2(block, blockDataBuffer, headerInfo.zMax);\n BitStuffer.unstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements, lutArr);\n }\n else {\n BitStuffer.unstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements, lutArr);\n }\n }\n else {\n //console.debug(\"bitstuffer\");\n data.counter.bitstuffer++;\n bitsPerPixel = numBits;\n data.ptr += blockPtr;\n if (bitsPerPixel > 0) {\n dataBytes = Math.ceil(numElements * bitsPerPixel / 8);\n dataWords = Math.ceil(dataBytes / 4);\n arrayBuf = new ArrayBuffer(dataWords * 4);\n store8 = new Uint8Array(arrayBuf);\n store8.set(new Uint8Array(input, data.ptr, dataBytes));\n stuffedData = new Uint32Array(arrayBuf);\n data.ptr += dataBytes;\n if (fileVersion >= 3) {\n if (offset == null) {\n BitStuffer.originalUnstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements);\n }\n else {\n BitStuffer.unstuff2(stuffedData, blockDataBuffer, bitsPerPixel, numElements, false, offset, scale, zMax);\n }\n }\n else {\n if (offset == null) {\n BitStuffer.originalUnstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements);\n }\n else {\n BitStuffer.unstuff(stuffedData, blockDataBuffer, bitsPerPixel, numElements, false, offset, scale, zMax);\n }\n }\n }\n }\n }\n\n },\n\n readTiles: function(input, data, OutPixelTypeArray, useBSQForOutputDim) {\n var headerInfo = data.headerInfo;\n var width = headerInfo.width;\n var height = headerInfo.height;\n var numPixels = width * height;\n var microBlockSize = headerInfo.microBlockSize;\n var imageType = headerInfo.imageType;\n var dataTypeSize = Lerc2Helpers.getDataTypeSize(imageType);\n var numBlocksX = Math.ceil(width / microBlockSize);\n var numBlocksY = Math.ceil(height / microBlockSize);\n data.pixels.numBlocksY = numBlocksY;\n data.pixels.numBlocksX = numBlocksX;\n data.pixels.ptr = 0;\n var row = 0, col = 0, blockY = 0, blockX = 0, thisBlockHeight = 0, thisBlockWidth = 0, bytesLeft = 0, headerByte = 0, bits67 = 0, testCode = 0, outPtr = 0, outStride = 0, numBytes = 0, bytesleft = 0, z = 0, blockPtr = 0;\n var view, block, arrayBuf, store8, rawData;\n var blockEncoding;\n var blockDataBuffer = new OutPixelTypeArray(microBlockSize * microBlockSize);\n var lastBlockHeight = (height % microBlockSize) || microBlockSize;\n var lastBlockWidth = (width % microBlockSize) || microBlockSize;\n var offsetType, offset;\n var numDims = headerInfo.numDims, iDim;\n var mask = data.pixels.resultMask;\n var resultPixels = data.pixels.resultPixels;\n var fileVersion = headerInfo.fileVersion;\n var fileVersionCheckNum = fileVersion >= 5 ? 14 : 15;\n var isDiffEncoding;\n var zMax = headerInfo.zMax;\n //var resultPixelsAllDim = resultPixels;\n var resultPixelsPrevDim;\n for (blockY = 0; blockY < numBlocksY; blockY++) {\n thisBlockHeight = (blockY !== numBlocksY - 1) ? microBlockSize : lastBlockHeight;\n for (blockX = 0; blockX < numBlocksX; blockX++) {\n //console.debug(\"y\" + blockY + \" x\" + blockX);\n thisBlockWidth = (blockX !== numBlocksX - 1) ? microBlockSize : lastBlockWidth;\n\n outPtr = blockY * width * microBlockSize + blockX * microBlockSize;\n outStride = width - thisBlockWidth;\n\n for (iDim = 0; iDim < numDims; iDim++) {\n if (numDims > 1) {\n resultPixelsPrevDim = resultPixels;\n outPtr = blockY * width * microBlockSize + blockX * microBlockSize;\n resultPixels = new OutPixelTypeArray(data.pixels.resultPixels.buffer, numPixels * iDim * dataTypeSize, numPixels);\n zMax = headerInfo.maxValues[iDim];\n } else {\n resultPixelsPrevDim = null;\n }\n bytesLeft = input.byteLength - data.ptr;\n view = new DataView(input, data.ptr, Math.min(10, bytesLeft));\n block = {};\n blockPtr = 0;\n headerByte = view.getUint8(0);\n blockPtr++;\n isDiffEncoding = headerInfo.fileVersion >= 5 ? headerByte & 4 : 0;\n bits67 = (headerByte >> 6) & 0xFF;\n testCode = (headerByte >> 2) & fileVersionCheckNum; // use bits 2345 for integrity check\n if (testCode !== (((blockX * microBlockSize) >> 3) & fileVersionCheckNum)) {\n throw \"integrity issue\";\n }\n\n if (isDiffEncoding && iDim === 0) {\n throw \"integrity issue\";\n }\n\n blockEncoding = headerByte & 3;\n if (blockEncoding > 3) {\n data.ptr += blockPtr;\n throw \"Invalid block encoding (\" + blockEncoding + \")\";\n }\n else if (blockEncoding === 2) { //constant 0\n if (isDiffEncoding) {\n if (mask) {\n for (row = 0; row < thisBlockHeight; row++) {\n for (col = 0; col < thisBlockWidth; col++) {\n if (mask[outPtr]) {\n resultPixels[outPtr] = resultPixelsPrevDim[outPtr];\n }\n outPtr++;\n }\n }\n }\n else {\n for (row = 0; row < thisBlockHeight; row++) {\n for (col = 0; col < thisBlockWidth; col++) {\n resultPixels[outPtr] = resultPixelsPrevDim[outPtr];\n outPtr++;\n }\n }\n }\n }\n data.counter.constant++;\n data.ptr += blockPtr;\n continue;\n }\n else if (blockEncoding === 0) { //uncompressed\n if (isDiffEncoding) {\n // doesn't make sense, should not happen\n throw \"integrity issue\";\n }\n data.counter.uncompressed++;\n data.ptr += blockPtr;\n numBytes = thisBlockHeight * thisBlockWidth * dataTypeSize;\n bytesleft = input.byteLength - data.ptr;\n numBytes = numBytes < bytesleft ? numBytes : bytesleft;\n //bit alignment\n arrayBuf = new ArrayBuffer((numBytes % dataTypeSize) === 0 ? numBytes : (numBytes + dataTypeSize - numBytes % dataTypeSize));\n store8 = new Uint8Array(arrayBuf);\n store8.set(new Uint8Array(input, data.ptr, numBytes));\n rawData = new OutPixelTypeArray(arrayBuf);\n z = 0;\n if (mask) {\n for (row = 0; row < thisBlockHeight; row++) {\n for (col = 0; col < thisBlockWidth; col++) {\n if (mask[outPtr]) {\n resultPixels[outPtr] = rawData[z++];\n }\n outPtr++;\n }\n outPtr += outStride;\n }\n }\n else {//all valid\n for (row = 0; row < thisBlockHeight; row++) {\n for (col = 0; col < thisBlockWidth; col++) {\n resultPixels[outPtr++] = rawData[z++];\n }\n outPtr += outStride;\n }\n }\n data.ptr += z * dataTypeSize;\n }\n else { //1 or 3\n offsetType = Lerc2Helpers.getDataTypeUsed((isDiffEncoding && imageType < 6) ? 4 : imageType, bits67);\n offset = Lerc2Helpers.getOnePixel(block, blockPtr, offsetType, view);\n blockPtr += Lerc2Helpers.getDataTypeSize(offsetType);\n if (blockEncoding === 3) //constant offset value\n {\n data.ptr += blockPtr;\n data.counter.constantoffset++;\n //you can delete the following resultMask case in favor of performance because val is constant and users use nodata mask, otherwise nodatavalue post processing handles it too.\n //while the above statement is true, we're not doing it as we want to keep invalid pixel value at 0 rather than arbitrary values\n if (mask) {\n for (row = 0; row < thisBlockHeight; row++) {\n for (col = 0; col < thisBlockWidth; col++) {\n if (mask[outPtr]) {\n resultPixels[outPtr] = isDiffEncoding ? Math.min(zMax, resultPixelsPrevDim[outPtr] + offset) : offset;\n }\n outPtr++;\n }\n outPtr += outStride;\n }\n }\n else {\n for (row = 0; row < thisBlockHeight; row++) {\n for (col = 0; col < thisBlockWidth; col++) {\n resultPixels[outPtr] = isDiffEncoding ? Math.min(zMax, resultPixelsPrevDim[outPtr] + offset) : offset;\n outPtr++;\n }\n outPtr += outStride;\n }\n }\n }\n else { //bitstuff encoding is 3\n data.ptr += blockPtr;\n //heavy lifting\n Lerc2Helpers.decodeBits(input, data, blockDataBuffer, offset, iDim);\n blockPtr = 0;\n // duplicate code to favor performance, diff encoding is for multidimension only\n if (isDiffEncoding) {\n if (mask) {\n for (row = 0; row < thisBlockHeight; row++) {\n for (col = 0; col < thisBlockWidth; col++) {\n if (mask[outPtr]) {\n resultPixels[outPtr] = blockDataBuffer[blockPtr++] + resultPixelsPrevDim[outPtr];\n }\n outPtr++;\n }\n outPtr += outStride;\n }\n }\n else {\n for (row = 0; row < thisBlockHeight; row++) {\n for (col = 0; col < thisBlockWidth; col++) {\n resultPixels[outPtr] = blockDataBuffer[blockPtr++] + resultPixelsPrevDim[outPtr];\n outPtr++;\n }\n outPtr += outStride;\n }\n }\n }\n else if (mask) {\n for (row = 0; row < thisBlockHeight; row++) {\n for (col = 0; col < thisBlockWidth; col++) {\n if (mask[outPtr]) {\n resultPixels[outPtr] = blockDataBuffer[blockPtr++];\n }\n outPtr++;\n }\n outPtr += outStride;\n }\n }\n else {\n for (row = 0; row < thisBlockHeight; row++) {\n for (col = 0; col < thisBlockWidth; col++) {\n resultPixels[outPtr++] = blockDataBuffer[blockPtr++];\n }\n outPtr += outStride;\n }\n }\n }\n }\n }\n }\n }\n //swap for BIP: it's always easier for clients to handle BSQ so we keep existing logic and introduce a swap here to minimze changes\n if (numDims > 1 && !useBSQForOutputDim) {\n data.pixels.resultPixels = Lerc2Helpers.swapDimensionOrder(data.pixels.resultPixels, numPixels, numDims, OutPixelTypeArray);\n }\n },\n\n /*****************\n * private methods (helper methods)\n *****************/\n\n formatFileInfo: function(data) {\n return {\n \"fileIdentifierString\": data.headerInfo.fileIdentifierString,\n \"fileVersion\": data.headerInfo.fileVersion,\n \"imageType\": data.headerInfo.imageType,\n \"height\": data.headerInfo.height,\n \"width\": data.headerInfo.width,\n \"numValidPixel\": data.headerInfo.numValidPixel,\n \"microBlockSize\": data.headerInfo.microBlockSize,\n \"blobSize\": data.headerInfo.blobSize,\n \"maxZError\": data.headerInfo.maxZError,\n \"pixelType\": Lerc2Helpers.getPixelType(data.headerInfo.imageType),\n \"eofOffset\": data.eofOffset,\n \"mask\": data.mask ? {\n \"numBytes\": data.mask.numBytes\n } : null,\n \"pixels\": {\n \"numBlocksX\": data.pixels.numBlocksX,\n \"numBlocksY\": data.pixels.numBlocksY,\n //\"numBytes\": data.pixels.numBytes,\n \"maxValue\": data.headerInfo.zMax,\n \"minValue\": data.headerInfo.zMin,\n \"noDataValue\": data.noDataValue\n }\n };\n },\n\n constructConstantSurface: function(data, useBSQForOutputDim) {\n var val = data.headerInfo.zMax;\n var valMin = data.headerInfo.zMin;\n var maxValues = data.headerInfo.maxValues;\n var numDims = data.headerInfo.numDims;\n var numPixels = data.headerInfo.height * data.headerInfo.width;\n var i = 0, k = 0, nStart = 0;\n var mask = data.pixels.resultMask;\n var resultPixels = data.pixels.resultPixels;\n if (mask) {\n if (numDims > 1) {\n if (useBSQForOutputDim) {\n for (i = 0; i < numDims; i++) {\n nStart = i * numPixels;\n val = maxValues[i];\n for (k = 0; k < numPixels; k++) {\n if (mask[k]) {\n resultPixels[nStart + k] = val;\n }\n }\n } \n }\n else {\n for (k = 0; k < numPixels; k++) {\n if (mask[k]) {\n nStart = k * numDims;\n for (i = 0; i < numDims; i++) {\n resultPixels[nStart + numDims] = maxValues[i];\n }\n }\n }\n }\n }\n else {\n for (k = 0; k < numPixels; k++) {\n if (mask[k]) {\n resultPixels[k] = val;\n }\n }\n }\n }\n else {\n if (numDims > 1 && valMin !== val) {\n if (useBSQForOutputDim) {\n for (i = 0; i < numDims; i++) {\n nStart = i * numPixels;\n val = maxValues[i];\n for (k = 0; k < numPixels; k++) {\n resultPixels[nStart + k] = val;\n }\n }\n }\n else {\n for (k = 0; k < numPixels; k++) {\n nStart = k * numDims;\n for (i = 0; i < numDims; i++) {\n resultPixels[nStart + i] = maxValues[i];\n }\n }\n }\n }\n else {\n for (k = 0; k < numPixels * numDims; k++) {\n resultPixels[k] = val;\n }\n }\n }\n return;\n },\n\n getDataTypeArray: function(t) {\n var tp;\n switch (t) {\n case 0: //char\n tp = Int8Array;\n break;\n case 1: //byte\n tp = Uint8Array;\n break;\n case 2: //short\n tp = Int16Array;\n break;\n case 3: //ushort\n tp = Uint16Array;\n break;\n case 4:\n tp = Int32Array;\n break;\n case 5:\n tp = Uint32Array;\n break;\n case 6:\n tp = Float32Array;\n break;\n case 7:\n tp = Float64Array;\n break;\n default:\n tp = Float32Array;\n }\n return tp;\n },\n\n getPixelType: function(t) {\n var tp;\n switch (t) {\n case 0: //char\n tp = \"S8\";\n break;\n case 1: //byte\n tp = \"U8\";\n break;\n case 2: //short\n tp = \"S16\";\n break;\n case 3: //ushort\n tp = \"U16\";\n break;\n case 4:\n tp = \"S32\";\n break;\n case 5:\n tp = \"U32\";\n break;\n case 6:\n tp = \"F32\";\n break;\n case 7:\n tp = \"F64\";\n break;\n default:\n tp = \"F32\";\n }\n return tp;\n },\n\n isValidPixelValue: function(t, val) {\n if (val == null) {\n return false;\n }\n var isValid;\n switch (t) {\n case 0: //char\n isValid = val >= -128 && val <= 127;\n break;\n case 1: //byte (unsigned char)\n isValid = val >= 0 && val <= 255;\n break;\n case 2: //short\n isValid = val >= -32768 && val <= 32767;\n break;\n case 3: //ushort\n isValid = val >= 0 && val <= 65536;\n break;\n case 4: //int 32\n isValid = val >= -2147483648 && val <= 2147483647;\n break;\n case 5: //uinit 32\n isValid = val >= 0 && val <= 4294967296;\n break;\n case 6:\n isValid = val >= -3.4027999387901484e+38 && val <= 3.4027999387901484e+38;\n break;\n case 7:\n isValid = val >= -1.7976931348623157e+308 && val <= 1.7976931348623157e+308;\n break;\n default:\n isValid = false;\n }\n return isValid;\n },\n\n getDataTypeSize: function(t) {\n var s = 0;\n switch (t) {\n case 0: //ubyte\n case 1: //byte\n s = 1;\n break;\n case 2: //short\n case 3: //ushort\n s = 2;\n break;\n case 4:\n case 5:\n case 6:\n s = 4;\n break;\n case 7:\n s = 8;\n break;\n default:\n s = t;\n }\n return s;\n },\n\n getDataTypeUsed: function(dt, tc) {\n var t = dt;\n switch (dt) {\n case 2: //short\n case 4: //long\n t = dt - tc;\n break;\n case 3: //ushort\n case 5: //ulong\n t = dt - 2 * tc;\n break;\n case 6: //float\n if (0 === tc) {\n t = dt;\n }\n else if (1 === tc) {\n t = 2;\n }\n else {\n t = 1;//byte\n }\n break;\n case 7: //double\n if (0 === tc) {\n t = dt;\n }\n else {\n t = dt - 2 * tc + 1;\n }\n break;\n default:\n t = dt;\n break;\n }\n return t;\n },\n\n getOnePixel: function(block, blockPtr, offsetType, view) {\n var temp = 0;\n switch (offsetType) {\n case 0: //char\n temp = view.getInt8(blockPtr);\n break;\n case 1: //byte\n temp = view.getUint8(blockPtr);\n break;\n case 2:\n temp = view.getInt16(blockPtr, true);\n break;\n case 3:\n temp = view.getUint16(blockPtr, true);\n break;\n case 4:\n temp = view.getInt32(blockPtr, true);\n break;\n case 5:\n temp = view.getUInt32(blockPtr, true);\n break;\n case 6:\n temp = view.getFloat32(blockPtr, true);\n break;\n case 7:\n temp = view.getFloat64(blockPtr, true);\n break;\n default:\n throw (\"the decoder does not understand this pixel type\");\n }\n return temp;\n },\n\n swapDimensionOrder: function(pixels, numPixels, numDims, OutPixelTypeArray, inputIsBIP) {\n var i = 0, j = 0, iDim = 0, temp = 0, swap = pixels;\n if (numDims > 1) {\n swap = new OutPixelTypeArray(numPixels * numDims);\n if (inputIsBIP) {\n for (i=0; i 5) {\n throw \"unsupported lerc version 2.\" + fileVersion;\n }\n\n // Mask Header\n Lerc2Helpers.readMask(input, data);\n if (headerInfo.numValidPixel !== headerInfo.width * headerInfo.height && !data.pixels.resultMask) {\n data.pixels.resultMask = options.maskData;\n }\n\n var numPixels = headerInfo.width * headerInfo.height;\n data.pixels.resultPixels = new OutPixelTypeArray(numPixels * headerInfo.numDims);\n\n data.counter = {\n onesweep: 0,\n uncompressed: 0,\n lut: 0,\n bitstuffer: 0,\n constant: 0,\n constantoffset: 0\n };\n var useBSQForOutputDim = !options.returnPixelInterleavedDims;\n if (headerInfo.numValidPixel !== 0) {\n //not tested\n if (headerInfo.zMax === headerInfo.zMin) //constant surface\n {\n Lerc2Helpers.constructConstantSurface(data, useBSQForOutputDim);\n }\n else if (fileVersion >= 4 && Lerc2Helpers.checkMinMaxRanges(input, data)) {\n Lerc2Helpers.constructConstantSurface(data, useBSQForOutputDim);\n }\n else {\n var view = new DataView(input, data.ptr, 2);\n var bReadDataOneSweep = view.getUint8(0);\n data.ptr++;\n if (bReadDataOneSweep) {\n //console.debug(\"OneSweep\");\n Lerc2Helpers.readDataOneSweep(input, data, OutPixelTypeArray, useBSQForOutputDim);\n }\n else {\n //lerc2.1: //bitstuffing + lut\n //lerc2.2: //bitstuffing + lut + huffman\n //lerc2.3: new bitstuffer\n if (fileVersion > 1 && headerInfo.imageType <= 1 && Math.abs(headerInfo.maxZError - 0.5) < 0.00001) {\n //this is 2.x plus 8 bit (unsigned and signed) data, possiblity of Huffman\n var flagHuffman = view.getUint8(1);\n data.ptr++;\n data.encodeMode = flagHuffman;\n if (flagHuffman > 2 || (fileVersion < 4 && flagHuffman > 1)) {\n throw \"Invalid Huffman flag \" + flagHuffman;\n }\n if (flagHuffman) {//1 - delta Huffman, 2 - Huffman\n //console.log(\"Huffman\");\n Lerc2Helpers.readHuffman(input, data, OutPixelTypeArray, useBSQForOutputDim);\n }\n else {\n //console.log(\"Tiles\");\n Lerc2Helpers.readTiles(input, data, OutPixelTypeArray, useBSQForOutputDim);\n }\n }\n else { //lerc2.x non-8 bit data\n //console.log(\"Tiles\");\n Lerc2Helpers.readTiles(input, data, OutPixelTypeArray, useBSQForOutputDim);\n }\n }\n }\n }\n\n data.eofOffset = data.ptr;\n var diff;\n if (options.inputOffset) {\n diff = data.headerInfo.blobSize + options.inputOffset - data.ptr;\n if (Math.abs(diff) >= 1) {\n //console.debug(\"incorrect eof: dataptr \" + data.ptr + \" offset \" + options.inputOffset + \" blobsize \" + data.headerInfo.blobSize + \" diff: \" + diff);\n data.eofOffset = options.inputOffset + data.headerInfo.blobSize;\n }\n }\n else {\n diff = data.headerInfo.blobSize - data.ptr;\n if (Math.abs(diff) >= 1) {\n //console.debug(\"incorrect first band eof: dataptr \" + data.ptr + \" blobsize \" + data.headerInfo.blobSize + \" diff: \" + diff);\n data.eofOffset = data.headerInfo.blobSize;\n }\n }\n\n var result = {\n width: headerInfo.width,\n height: headerInfo.height,\n pixelData: data.pixels.resultPixels,\n minValue: headerInfo.zMin,\n maxValue: headerInfo.zMax,\n validPixelCount: headerInfo.numValidPixel,\n dimCount: headerInfo.numDims,\n dimStats: {\n minValues: headerInfo.minValues,\n maxValues: headerInfo.maxValues\n },\n maskData: data.pixels.resultMask\n //noDataValue: noDataValue\n };\n\n //we should remove this if there's no existing client\n //optional noDataValue processing, it's user's responsiblity\n if (data.pixels.resultMask && Lerc2Helpers.isValidPixelValue(headerInfo.imageType, noDataValue)) {\n var mask = data.pixels.resultMask;\n for (i = 0; i < numPixels; i++) {\n if (!mask[i]) {\n result.pixelData[i] = noDataValue;\n }\n }\n result.noDataValue = noDataValue;\n }\n data.noDataValue = noDataValue;\n if (options.returnFileInfo) {\n result.fileInfo = Lerc2Helpers.formatFileInfo(data);\n }\n return result;\n },\n\n getBandCount: function(/*byte array*/ input) {\n var count = 0;\n var i = 0;\n var temp = {};\n temp.ptr = 0;\n temp.pixels = {};\n while (i < input.byteLength - 58) {\n Lerc2Helpers.readHeaderInfo(input, temp);\n i += temp.headerInfo.blobSize;\n count++;\n temp.ptr = i;\n }\n return count;\n }\n };\n\n return Lerc2Decode;\n })();\n\n var isPlatformLittleEndian = (function() {\n var a = new ArrayBuffer(4);\n var b = new Uint8Array(a);\n var c = new Uint32Array(a);\n c[0] = 1;\n return b[0] === 1;\n })();\n\n var Lerc = {\n /************wrapper**********************************************/\n /**\n * A wrapper for decoding both LERC1 and LERC2 byte streams capable of handling multiband pixel blocks for various pixel types.\n *\n * @alias module:Lerc\n * @param {ArrayBuffer} input The LERC input byte stream\n * @param {object} [options] The decoding options below are optional.\n * @param {number} [options.inputOffset] The number of bytes to skip in the input byte stream. A valid Lerc file is expected at that position.\n * @param {string} [options.pixelType] (LERC1 only) Default value is F32. Valid pixel types for input are U8/S8/S16/U16/S32/U32/F32.\n * @param {number} [options.noDataValue] (LERC1 only). It is recommended to use the returned mask instead of setting this value.\n * @param {boolean} [options.returnPixelInterleavedDims] (nDim LERC2 only) If true, returned dimensions are pixel-interleaved, a.k.a [p1_dim0, p1_dim1, p1_dimn, p2_dim0...], default is [p1_dim0, p2_dim0, ..., p1_dim1, p2_dim1...]\n * @returns {{width, height, pixels, pixelType, mask, statistics}}\n * @property {number} width Width of decoded image.\n * @property {number} height Height of decoded image.\n * @property {array} pixels [band1, band2, …] Each band is a typed array of width*height.\n * @property {string} pixelType The type of pixels represented in the output.\n * @property {mask} mask Typed array with a size of width*height, or null if all pixels are valid.\n * @property {array} statistics [statistics_band1, statistics_band2, …] Each element is a statistics object representing min and max values\n **/\n decode: function(encodedData, options) {\n if (!isPlatformLittleEndian) {\n throw \"Big endian system is not supported.\";\n }\n options = options || {};\n var inputOffset = options.inputOffset || 0;\n var fileIdView = new Uint8Array(encodedData, inputOffset, 10);\n var fileIdentifierString = String.fromCharCode.apply(null, fileIdView);\n var lerc, majorVersion;\n if (fileIdentifierString.trim() === \"CntZImage\") {\n lerc = LercDecode;\n majorVersion = 1;\n }\n else if (fileIdentifierString.substring(0, 5) === \"Lerc2\") {\n lerc = Lerc2Decode;\n majorVersion = 2;\n }\n else {\n throw \"Unexpected file identifier string: \" + fileIdentifierString;\n }\n\n var iPlane = 0, eof = encodedData.byteLength - 10, encodedMaskData, bandMasks = [], bandMask, maskData;\n var decodedPixelBlock = {\n width: 0,\n height: 0,\n pixels: [],\n pixelType: options.pixelType,\n mask: null,\n statistics: []\n };\n var uniqueBandMaskCount = 0;\n\n while (inputOffset < eof) {\n var result = lerc.decode(encodedData, {\n inputOffset: inputOffset,//for both lerc1 and lerc2\n encodedMaskData: encodedMaskData,//lerc1 only\n maskData: maskData,//lerc2 only\n returnMask: iPlane === 0 ? true : false,//lerc1 only\n returnEncodedMask: iPlane === 0 ? true : false,//lerc1 only\n returnFileInfo: true,//for both lerc1 and lerc2\n returnPixelInterleavedDims: options.returnPixelInterleavedDims,//for ndim lerc2 only\n pixelType: options.pixelType || null,//lerc1 only\n noDataValue: options.noDataValue || null//lerc1 only\n });\n\n inputOffset = result.fileInfo.eofOffset;\n maskData = result.maskData;//lerc2\n if (iPlane === 0) {\n encodedMaskData = result.encodedMaskData;//lerc1\n decodedPixelBlock.width = result.width;\n decodedPixelBlock.height = result.height;\n decodedPixelBlock.dimCount = result.dimCount || 1;\n //decodedPixelBlock.dimStats = decodedPixelBlock.dimStats;\n decodedPixelBlock.pixelType = result.pixelType || result.fileInfo.pixelType;\n decodedPixelBlock.mask = maskData;\n }\n if (majorVersion > 1) {\n if (maskData) {\n bandMasks.push(maskData);\n }\n if (result.fileInfo.mask && result.fileInfo.mask.numBytes > 0) {\n uniqueBandMaskCount++;\n }\n }\n\n iPlane++;\n decodedPixelBlock.pixels.push(result.pixelData);\n decodedPixelBlock.statistics.push({\n minValue: result.minValue,\n maxValue: result.maxValue,\n noDataValue: result.noDataValue,\n dimStats: result.dimStats\n });\n }\n var i, j, numPixels;\n if (majorVersion > 1 && uniqueBandMaskCount > 1) {\n numPixels = decodedPixelBlock.width * decodedPixelBlock.height;\n decodedPixelBlock.bandMasks = bandMasks;\n maskData = new Uint8Array(numPixels);\n maskData.set(bandMasks[0]);\n for (i = 1; i < bandMasks.length; i++) {\n bandMask = bandMasks[i];\n for (j = 0; j < numPixels; j++) {\n maskData[j] = maskData[j] & bandMask[j];\n }\n }\n decodedPixelBlock.maskData = maskData;\n }\n\n return decodedPixelBlock;\n }\n };\n\n if (typeof define === \"function\" && define.amd) {/* jshint ignore:line */\n //amd loaders such as dojo and requireJS\n //http://wiki.commonjs.org/wiki/Modules/AsynchronousDefinition\n define([], function() { return Lerc; });/* jshint ignore:line */\n }\n else if (typeof module !== \"undefined\" && module.exports) {/* jshint ignore:line */\n //commonJS module 1.0/1.1/1.1.1 systems, such as nodeJS\n //http://wiki.commonjs.org/wiki/Modules\n module.exports = Lerc;/* jshint ignore:line */\n }\n else {\n //assign to this, most likely window\n this.Lerc = Lerc;\n }\n\n})();\n"],"sourceRoot":""} \ No newline at end of file diff --git a/dist/6.js b/dist/6.js new file mode 100644 index 0000000..4249859 --- /dev/null +++ b/dist/6.js @@ -0,0 +1,28 @@ +(window["webpackJsonp"] = window["webpackJsonp"] || []).push([[6],{ + +/***/ "../node_modules/geotiff/src/compression/deflate.js": +/*!**********************************************************!*\ + !*** ../node_modules/geotiff/src/compression/deflate.js ***! + \**********************************************************/ +/*! exports provided: default */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "default", function() { return DeflateDecoder; }); +/* harmony import */ var pako__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! pako */ "../node_modules/geotiff/node_modules/pako/dist/pako.esm.mjs"); +/* harmony import */ var _basedecoder__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./basedecoder */ "../node_modules/geotiff/src/compression/basedecoder.js"); + + + +class DeflateDecoder extends _basedecoder__WEBPACK_IMPORTED_MODULE_1__["default"] { + decodeBlock(buffer) { + return Object(pako__WEBPACK_IMPORTED_MODULE_0__["inflate"])(new Uint8Array(buffer)).buffer; + } +} + + +/***/ }) + +}]); +//# sourceMappingURL=6.js.map \ No newline at end of file diff --git a/dist/6.js.map b/dist/6.js.map new file mode 100644 index 0000000..74c24a4 --- /dev/null +++ b/dist/6.js.map @@ -0,0 +1 @@ +{"version":3,"sources":["webpack:///../node_modules/geotiff/src/compression/deflate.js"],"names":[],"mappings":";;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAA+B;AACS;;AAEzB,6BAA6B,oDAAW;AACvD;AACA,WAAW,oDAAO;AAClB;AACA","file":"6.js","sourcesContent":["import { inflate } from 'pako';\nimport BaseDecoder from './basedecoder';\n\nexport default class DeflateDecoder extends BaseDecoder {\n decodeBlock(buffer) {\n return inflate(new Uint8Array(buffer)).buffer;\n }\n}\n"],"sourceRoot":""} \ No newline at end of file diff --git a/dist/MANIFEST.txt b/dist/MANIFEST.txt index ebb2e13..45fb12e 100644 --- a/dist/MANIFEST.txt +++ b/dist/MANIFEST.txt @@ -9,9 +9,23 @@ Hash: SHA512 "signedByOrgName": "Andrew Rodgers", "plugin": "aceiot-svg-panel", "version": "0.0.11", - "time": 1642733051226, + "time": 1644542738893, "keyId": "7e4d0c6a708866e7", "files": { + "0.js": "4e810e183fc39b25c86b3933f9853e4175a0942c15430a93358aaf638abeb747", + "0.js.map": "fc5d4d02203ec01a076f6071f19d90fd9399a2b8606da7aedc179ec820f6c835", + "1.js": "8beed562e5d7c5ddfe33a7f40ddd6595f44a56ea0386a5b3ffab17dc485c1320", + "1.js.map": "9897f3ee1ce4118e9b36716b2486db1e22454e9701dcbddd5ed7f6759fe70977", + "2.js": "95aad9fb22360d15125b805c14559cb44dddcca45bb84186493938d14cdc0d1b", + "2.js.map": "601834f6c29c2e8b391dee172038335cdfcdd39831a45aa2a4606c4611625e55", + "3.js": "d37034f01e671155f590ddd4e8cfd4446c2cb13b8046b0e3a2e41fee3c2f60ce", + "3.js.map": "65ad9382bdb57515476a12b023ac03dff980d5e8440e8001a9fe0b7264bacbb2", + "4.js": "5c1e209ead8926a9fccc93b3311433daa1c1f0c7a416a43e6e89af1405b901cb", + "4.js.map": "867b55ddb17770407ef3ef51f0f3585419ecd53db9647c11b5d4fbb5d54f16bd", + "5.js": "eae5e8b8b54f65dccf830b77f5f5171e6d14126b14b33aeffe1f6f9b127634ed", + "5.js.map": "793fd64d94ca7123b6dfc4909cdb14c695daf2be9128f1c5ecc89e6f3793094c", + "6.js": "787c633a3dc17b22a6b2b617a48ba576f6c1d3bab94ecf3ad7b0f8bad047ff6d", + "6.js.map": "fcbdaf769ac11846438c704d7b6b2a1fefa2fa8bc62ad4cbc9a7e4fe60bd9ba1", "CHANGELOG.md": "34f2eed7e9fa2a166c09530069d7413a710d2abb3fc275838b5adfb9a7971133", "img/ace-svg-react.png": "6d2343f8f5471f27a17d811743aba3cd221fae2350a585cdccdae7689619dc15", "img/ace_svg_icon.png": "585222feea75c122615b5b379a643ff0a5e85f58f77daf5e6c5da7bdc7170e06", @@ -20,11 +34,12 @@ Hash: SHA512 "img/logo-small-background.svg": "eed57cceea2ed7f9b1aaadd3d02d13db67766062e71e1885d0fd83ba8325ec59", "img/logo-type.svg": "4cca7b5a6c8bdd300d0ffad4a2fc4d0f044e2ac0df60144cb6f2cf540b2534a9", "img/logo.svg": "cda1e6830638a820850a6f09331d3a4b19c6284530b9eb9d194acab7b5dd728a", + "index.html": "2fa2c4168c5bb7b8502989f437e4a1a71e663702b0ec9c01530215c8c026dcaf", "LICENSE": "36b5840417f9f6e52f5ce683209c10784163dd5bedac9bbf8490881ad68bfdaf", - "module.js": "146c60e82bb3b5584844ec9237a947d6effcdb4ce687dec6a297476f5ee46139", + "module.js": "e939560b750849812a613d39b63d17ef26d075503c6191beefe0717d08831d4c", "module.js.LICENSE.txt": "0d8f66cd4afb566cb5b7e1540c68f43b939d3eba12ace290f18abc4f4cb53ed0", - "module.js.map": "ea3c0a0ce4c0c43b5eb147f4d05d08b7e74dec9164245639c83498d28603feab", - "plugin.json": "9d7391696f5d8658edf6cbe222c39f70dd849b0f78c4627d2eb9cd242eabd464", + "module.js.map": "f6356174a91ed4a2e6b3c2c66308a9a21dd91ad81701bf3a777fa0b750c6b438", + "plugin.json": "5894ca192637793a58da411f0f17a0a046fe0d79ec1f81fb13e18e5c159a04c1", "README.md": "fe73ef111862564b45e0d988494e3abe59cca747edb40733992db06bf707dc2d" } } @@ -32,9 +47,9 @@ Hash: SHA512 Version: OpenPGP.js v4.10.1 Comment: https://openpgpjs.org -wqAEARMKAAYFAmHqHfsACgkQfk0ManCIZuf+bAII10T5rjNLEkMnKzgbIQvB -5mZWfGlw7WldQCuu1i/PocsdD7slETXJtJOj2IP2T++BNDu5POtxXeyUEQ1J -xPlAnXwCAQHFTd7aX+E301V1xxyh6fDxuPTGeWi7zdH3oIw68yEkBOcSz9aS -/hFHsrycpPbb/d5WSb/+mjGk3TtLQXtB4/hH -=KpL+ +wqEEARMKAAYFAmIFuxMACgkQfk0ManCIZudJ4wIIp40niU1f55iSvN84s9vE +4++4dG+G7SaoLCx1pfGAIyFo+LODU4iXjAWv6w3yZxWcb9+bm5sgIwFOT+iz +G+z736sCCQEzPYkFDph/es3d4TVwKMXgyfFxX08vRE2skOOBz+i7lp8ZQy7T +NNNkC5ViA1zsMhbCpEi3XyBnFaiYBWHN3dEXew== +=edZv -----END PGP SIGNATURE----- diff --git a/dist/index.html b/dist/index.html new file mode 100644 index 0000000..211bee4 --- /dev/null +++ b/dist/index.html @@ -0,0 +1,9 @@ + + + + + Webpack App + + + + \ No newline at end of file diff --git a/dist/module.js b/dist/module.js index 8b8128b..ae8a200 100644 --- a/dist/module.js +++ b/dist/module.js @@ -1,3 +1,3 @@ /*! For license information please see module.js.LICENSE.txt */ -define(["react","@grafana/ui","emotion","@grafana/runtime","@grafana/data"],(function(t,e,n,i,r){return function(t){var e={};function n(i){if(e[i])return e[i].exports;var r=e[i]={i:i,l:!1,exports:{}};return t[i].call(r.exports,r,r.exports,n),r.l=!0,r.exports}return n.m=t,n.c=e,n.d=function(t,e,i){n.o(t,e)||Object.defineProperty(t,e,{enumerable:!0,get:i})},n.r=function(t){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})},n.t=function(t,e){if(1&e&&(t=n(t)),8&e)return t;if(4&e&&"object"==typeof t&&t&&t.__esModule)return t;var i=Object.create(null);if(n.r(i),Object.defineProperty(i,"default",{enumerable:!0,value:t}),2&e&&"string"!=typeof t)for(var r in t)n.d(i,r,function(e){return t[e]}.bind(null,r));return i},n.n=function(t){var e=t&&t.__esModule?function(){return t.default}:function(){return t};return n.d(e,"a",e),e},n.o=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},n.p="/",n(n.s=8)}([function(e,n){e.exports=t},function(t,e,n){t.exports=n(6)()},function(t,n){t.exports=e},function(t,e){t.exports=n},function(t,e){t.exports=i},function(t,e){t.exports=r},function(t,e,n){"use strict";var i=n(7);function r(){}function s(){}s.resetWarningCache=r,t.exports=function(){function t(t,e,n,r,s,o){if(o!==i){var a=new Error("Calling PropTypes validators directly is not supported by the `prop-types` package. Use PropTypes.checkPropTypes() to call them. Read more at http://fb.me/use-check-prop-types");throw a.name="Invariant Violation",a}}function e(){return t}t.isRequired=t;var n={array:t,bool:t,func:t,number:t,object:t,string:t,symbol:t,any:t,arrayOf:e,element:t,elementType:t,instanceOf:e,node:t,objectOf:e,oneOf:e,oneOfType:e,shape:e,exact:e,checkPropTypes:s,resetWarningCache:r};return n.PropTypes=n,n}},function(t,e,n){"use strict";t.exports="SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED"},function(t,e,n){"use strict";n.r(e);var i=n(5),r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(t,e)};function s(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Class extends value "+String(e)+" is not a constructor or null");function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}var o=function(){return(o=Object.assign||function(t){for(var e,n=1,i=arguments.length;n0)&&!(i=s.next()).done;)o.push(i.value)}catch(t){r={error:t}}finally{try{i&&!i.done&&(n=s.return)&&n.call(s)}finally{if(r)throw r.error}}return o}function l(t,e,n){if(n||2===arguments.length)for(var i,r=0,s=e.length;r=0;i--)for(n in e)t[i].prototype[n]=e[n]}function F(t){return function(...e){const n=e[e.length-1];return!n||n.constructor!==Object||n instanceof Array?t.apply(this,e):t.apply(this,e.slice(0,-1)).attr(n)}}p("Dom",{siblings:function(){return this.parent().children()},position:function(){return this.parent().index(this)},next:function(){return this.siblings()[this.position()+1]},prev:function(){return this.siblings()[this.position()-1]},forward:function(){const t=this.position();return this.parent().add(this.remove(),t+1),this},backward:function(){const t=this.position();return this.parent().add(this.remove(),t?t-1:0),this},front:function(){return this.parent().add(this.remove()),this},back:function(){return this.parent().add(this.remove(),0),this},before:function(t){(t=N(t)).remove();const e=this.position();return this.parent().add(t,e),this},after:function(t){(t=N(t)).remove();const e=this.position();return this.parent().add(t,e+1),this},insertBefore:function(t){return(t=N(t)).before(this),this},insertAfter:function(t){return(t=N(t)).after(this),this}});const U=/^([+-]?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?)([a-z%]*)$/i,Q=/^#?([a-f\d]{2})([a-f\d]{2})([a-f\d]{2})$/i,X=/rgb\((\d+),(\d+),(\d+)\)/,G=/(#[a-z_][a-z0-9\-_]*)/i,W=/\)\s*,?\s*/,q=/\s/g,K=/^#[a-f0-9]{3}$|^#[a-f0-9]{6}$/i,Z=/^rgb\(/,J=/^(\s+)?$/,$=/^[+-]?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,tt=/\.(jpg|jpeg|png|gif|svg)(\?[^=]+.*)?/i,et=/[\s,]+/,nt=/[MLHVCSQTAZ]/i;function it(t){const e=Math.round(t),n=Math.max(0,Math.min(255,e)).toString(16);return 1===n.length?"0"+n:n}function rt(t,e){for(let n=e.length;n--;)if(null==t[e[n]])return!1;return!0}function st(t,e,n){return n<0&&(n+=1),n>1&&(n-=1),n<1/6?t+6*(e-t)*n:n<.5?e:n<2/3?t+(e-t)*(2/3-n)*6:t}p("Dom",{classes:function(){const t=this.attr("class");return null==t?[]:t.trim().split(et)},hasClass:function(t){return-1!==this.classes().indexOf(t)},addClass:function(t){if(!this.hasClass(t)){const e=this.classes();e.push(t),this.attr("class",e.join(" "))}return this},removeClass:function(t){return this.hasClass(t)&&this.attr("class",this.classes().filter((function(e){return e!==t})).join(" ")),this},toggleClass:function(t){return this.hasClass(t)?this.removeClass(t):this.addClass(t)}}),p("Dom",{css:function(t,e){const n={};if(0===arguments.length)return this.node.style.cssText.split(/\s*;\s*/).filter((function(t){return!!t.length})).forEach((function(t){const e=t.split(/\s*:\s*/);n[e[0]]=e[1]})),n;if(arguments.length<2){if(Array.isArray(t)){for(const e of t){const t=w(e);n[t]=this.node.style[t]}return n}if("string"==typeof t)return this.node.style[w(t)];if("object"==typeof t)for(const e in t)this.node.style[w(e)]=null==t[e]||J.test(t[e])?"":t[e]}return 2===arguments.length&&(this.node.style[w(t)]=null==e||J.test(e)?"":e),this},show:function(){return this.css("display","")},hide:function(){return this.css("display","none")},visible:function(){return"none"!==this.css("display")}}),p("Dom",{data:function(t,e,n){if(null==t)return this.data(g(C(this.node.attributes,t=>0===t.nodeName.indexOf("data-")),t=>t.nodeName.slice(5)));if(t instanceof Array){const e={};for(const n of t)e[n]=this.data(n);return e}if("object"==typeof t)for(e in t)this.data(e,t[e]);else if(arguments.length<2)try{return JSON.parse(this.attr("data-"+t))}catch(e){return this.attr("data-"+t)}else this.attr("data-"+t,null===e?null:!0===n||"string"==typeof e||"number"==typeof e?e:JSON.stringify(e));return this}}),p("Dom",{remember:function(t,e){if("object"==typeof arguments[0])for(const e in t)this.remember(e,t[e]);else{if(1===arguments.length)return this.memory()[t];this.memory()[t]=e}return this},forget:function(){if(0===arguments.length)this._memory={};else for(let t=arguments.length-1;t>=0;t--)delete this.memory()[arguments[t]];return this},memory:function(){return this._memory=this._memory||{}}});class ot{constructor(...t){this.init(...t)}static isColor(t){return t&&(t instanceof ot||this.isRgb(t)||this.test(t))}static isRgb(t){return t&&"number"==typeof t.r&&"number"==typeof t.g&&"number"==typeof t.b}static random(t="vibrant",e,n){const{random:i,round:r,sin:s,PI:o}=Math;if("vibrant"===t){const t=24*i()+57,e=38*i()+45,n=360*i();return new ot(t,e,n,"lch")}if("sine"===t){const t=r(80*s(2*o*(e=null==e?i():e)/.5+.01)+150),n=r(50*s(2*o*e/.5+4.6)+200),a=r(100*s(2*o*e/.5+2.3)+150);return new ot(t,n,a)}if("pastel"===t){const t=8*i()+86,e=17*i()+9,n=360*i();return new ot(t,e,n,"lch")}if("dark"===t){const t=10+10*i(),e=50*i()+86,n=360*i();return new ot(t,e,n,"lch")}if("rgb"===t){const t=255*i(),e=255*i(),n=255*i();return new ot(t,e,n)}if("lab"===t){const t=100*i(),e=256*i()-128,n=256*i()-128;return new ot(t,e,n,"lab")}if("grey"===t){const t=255*i();return new ot(t,t,t)}throw new Error("Unsupported random color mode")}static test(t){return"string"==typeof t&&(K.test(t)||Z.test(t))}cmyk(){const{_a:t,_b:e,_c:n}=this.rgb(),[i,r,s]=[t,e,n].map(t=>t/255),o=Math.min(1-i,1-r,1-s);if(1===o)return new ot(0,0,0,1,"cmyk");return new ot((1-i-o)/(1-o),(1-r-o)/(1-o),(1-s-o)/(1-o),o,"cmyk")}hsl(){const{_a:t,_b:e,_c:n}=this.rgb(),[i,r,s]=[t,e,n].map(t=>t/255),o=Math.max(i,r,s),a=Math.min(i,r,s),l=(o+a)/2,h=o===a,u=o-a;return new ot(360*(h?0:o===i?((r-s)/u+(r.5?u/(2-o-a):u/(o+a)),100*l,"hsl")}init(t=0,e=0,n=0,i=0,r="rgb"){if(t=t||0,this.space)for(const t in this.space)delete this[this.space[t]];if("number"==typeof t)r="string"==typeof i?i:r,i="string"==typeof i?0:i,Object.assign(this,{_a:t,_b:e,_c:n,_d:i,space:r});else if(t instanceof Array)this.space=e||("string"==typeof t[3]?t[3]:t[4])||"rgb",Object.assign(this,{_a:t[0],_b:t[1],_c:t[2],_d:t[3]||0});else if(t instanceof Object){const n=function(t,e){const n=rt(t,"rgb")?{_a:t.r,_b:t.g,_c:t.b,_d:0,space:"rgb"}:rt(t,"xyz")?{_a:t.x,_b:t.y,_c:t.z,_d:0,space:"xyz"}:rt(t,"hsl")?{_a:t.h,_b:t.s,_c:t.l,_d:0,space:"hsl"}:rt(t,"lab")?{_a:t.l,_b:t.a,_c:t.b,_d:0,space:"lab"}:rt(t,"lch")?{_a:t.l,_b:t.c,_c:t.h,_d:0,space:"lch"}:rt(t,"cmyk")?{_a:t.c,_b:t.m,_c:t.y,_d:t.k,space:"cmyk"}:{_a:0,_b:0,_c:0,space:"rgb"};return n.space=e||n.space,n}(t,e);Object.assign(this,n)}else if("string"==typeof t)if(Z.test(t)){const e=t.replace(q,""),[n,i,r]=X.exec(e).slice(1,4).map(t=>parseInt(t));Object.assign(this,{_a:n,_b:i,_c:r,_d:0,space:"rgb"})}else{if(!K.test(t))throw Error("Unsupported string format, can't construct Color");{const e=t=>parseInt(t,16),[,n,i,r]=Q.exec(function(t){return 4===t.length?["#",t.substring(1,2),t.substring(1,2),t.substring(2,3),t.substring(2,3),t.substring(3,4),t.substring(3,4)].join(""):t}(t)).map(e);Object.assign(this,{_a:n,_b:i,_c:r,_d:0,space:"rgb"})}}const{_a:s,_b:o,_c:a,_d:l}=this,h="rgb"===this.space?{r:s,g:o,b:a}:"xyz"===this.space?{x:s,y:o,z:a}:"hsl"===this.space?{h:s,s:o,l:a}:"lab"===this.space?{l:s,a:o,b:a}:"lch"===this.space?{l:s,c:o,h:a}:"cmyk"===this.space?{c:s,m:o,y:a,k:l}:{};Object.assign(this,h)}lab(){const{x:t,y:e,z:n}=this.xyz();return new ot(116*e-16,500*(t-e),200*(e-n),"lab")}lch(){const{l:t,a:e,b:n}=this.lab(),i=Math.sqrt(e**2+n**2);let r=180*Math.atan2(n,e)/Math.PI;r<0&&(r*=-1,r=360-r);return new ot(t,i,r,"lch")}rgb(){if("rgb"===this.space)return this;if("lab"===(t=this.space)||"xyz"===t||"lch"===t){let{x:t,y:e,z:n}=this;if("lab"===this.space||"lch"===this.space){let{l:i,a:r,b:s}=this;if("lch"===this.space){const{c:t,h:e}=this,n=Math.PI/180;r=t*Math.cos(n*e),s=t*Math.sin(n*e)}const o=(i+16)/116,a=r/500+o,l=o-s/200,h=16/116,u=.008856,c=7.787;t=.95047*(a**3>u?a**3:(a-h)/c),e=1*(o**3>u?o**3:(o-h)/c),n=1.08883*(l**3>u?l**3:(l-h)/c)}const i=3.2406*t+-1.5372*e+-.4986*n,r=-.9689*t+1.8758*e+.0415*n,s=.0557*t+-.204*e+1.057*n,o=Math.pow,a=.0031308,l=i>a?1.055*o(i,1/2.4)-.055:12.92*i,h=r>a?1.055*o(r,1/2.4)-.055:12.92*r,u=s>a?1.055*o(s,1/2.4)-.055:12.92*s;return new ot(255*l,255*h,255*u)}if("hsl"===this.space){let{h:t,s:e,l:n}=this;if(t/=360,e/=100,n/=100,0===e){n*=255;return new ot(n,n,n)}const i=n<.5?n*(1+e):n+e-n*e,r=2*n-i,s=255*st(r,i,t+1/3),o=255*st(r,i,t),a=255*st(r,i,t-1/3);return new ot(s,o,a)}if("cmyk"===this.space){const{c:t,m:e,y:n,k:i}=this,r=255*(1-Math.min(1,t*(1-i)+i)),s=255*(1-Math.min(1,e*(1-i)+i)),o=255*(1-Math.min(1,n*(1-i)+i));return new ot(r,s,o)}return this;var t}toArray(){const{_a:t,_b:e,_c:n,_d:i,space:r}=this;return[t,e,n,i,r]}toHex(){const[t,e,n]=this._clamped().map(it);return`#${t}${e}${n}`}toRgb(){const[t,e,n]=this._clamped();return`rgb(${t},${e},${n})`}toString(){return this.toHex()}xyz(){const{_a:t,_b:e,_c:n}=this.rgb(),[i,r,s]=[t,e,n].map(t=>t/255),o=i>.04045?Math.pow((i+.055)/1.055,2.4):i/12.92,a=r>.04045?Math.pow((r+.055)/1.055,2.4):r/12.92,l=s>.04045?Math.pow((s+.055)/1.055,2.4):s/12.92,h=(.4124*o+.3576*a+.1805*l)/.95047,u=(.2126*o+.7152*a+.0722*l)/1,c=(.0193*o+.1192*a+.9505*l)/1.08883,d=h>.008856?Math.pow(h,1/3):7.787*h+16/116,A=u>.008856?Math.pow(u,1/3):7.787*u+16/116,p=c>.008856?Math.pow(c,1/3):7.787*c+16/116;return new ot(d,A,p,"xyz")}_clamped(){const{_a:t,_b:e,_c:n}=this.rgb(),{max:i,min:r,round:s}=Math;return[t,e,n].map(t=>i(0,r(s(t),255)))}}class at{constructor(...t){this.init(...t)}clone(){return new at(this)}init(t,e){const n=0,i=0,r=Array.isArray(t)?{x:t[0],y:t[1]}:"object"==typeof t?{x:t.x,y:t.y}:{x:t,y:e};return this.x=null==r.x?n:r.x,this.y=null==r.y?i:r.y,this}toArray(){return[this.x,this.y]}transform(t){return this.clone().transformO(t)}transformO(t){ht.isMatrixLike(t)||(t=new ht(t));const{x:e,y:n}=this;return this.x=t.a*e+t.c*n+t.e,this.y=t.b*e+t.d*n+t.f,this}}function lt(t,e,n){return Math.abs(e-t)<(n||1e-6)}class ht{constructor(...t){this.init(...t)}static formatTransforms(t){const e="both"===t.flip||!0===t.flip,n=t.flip&&(e||"x"===t.flip)?-1:1,i=t.flip&&(e||"y"===t.flip)?-1:1,r=t.skew&&t.skew.length?t.skew[0]:isFinite(t.skew)?t.skew:isFinite(t.skewX)?t.skewX:0,s=t.skew&&t.skew.length?t.skew[1]:isFinite(t.skew)?t.skew:isFinite(t.skewY)?t.skewY:0,o=t.scale&&t.scale.length?t.scale[0]*n:isFinite(t.scale)?t.scale*n:isFinite(t.scaleX)?t.scaleX*n:n,a=t.scale&&t.scale.length?t.scale[1]*i:isFinite(t.scale)?t.scale*i:isFinite(t.scaleY)?t.scaleY*i:i,l=t.shear||0,h=t.rotate||t.theta||0,u=new at(t.origin||t.around||t.ox||t.originX,t.oy||t.originY),c=u.x,d=u.y,A=new at(t.position||t.px||t.positionX||NaN,t.py||t.positionY||NaN),p=A.x,f=A.y,m=new at(t.translate||t.tx||t.translateX,t.ty||t.translateY),g=m.x,C=m.y,y=new at(t.relative||t.rx||t.relativeX,t.ry||t.relativeY);return{scaleX:o,scaleY:a,skewX:r,skewY:s,shear:l,theta:h,rx:y.x,ry:y.y,tx:g,ty:C,ox:c,oy:d,px:p,py:f}}static fromArray(t){return{a:t[0],b:t[1],c:t[2],d:t[3],e:t[4],f:t[5]}}static isMatrixLike(t){return null!=t.a||null!=t.b||null!=t.c||null!=t.d||null!=t.e||null!=t.f}static matrixMultiply(t,e,n){const i=t.a*e.a+t.c*e.b,r=t.b*e.a+t.d*e.b,s=t.a*e.c+t.c*e.d,o=t.b*e.c+t.d*e.d,a=t.e+t.a*e.e+t.c*e.f,l=t.f+t.b*e.e+t.d*e.f;return n.a=i,n.b=r,n.c=s,n.d=o,n.e=a,n.f=l,n}around(t,e,n){return this.clone().aroundO(t,e,n)}aroundO(t,e,n){const i=t||0,r=e||0;return this.translateO(-i,-r).lmultiplyO(n).translateO(i,r)}clone(){return new ht(this)}decompose(t=0,e=0){const n=this.a,i=this.b,r=this.c,s=this.d,o=this.e,a=this.f,l=n*s-i*r,h=l>0?1:-1,u=h*Math.sqrt(n*n+i*i),c=Math.atan2(h*i,h*n),d=180/Math.PI*c,A=Math.cos(c),p=Math.sin(c),f=(n*r+i*s)/l,m=r*u/(f*n-i)||s*u/(f*i+n);return{scaleX:u,scaleY:m,shear:f,rotate:d,translateX:o-t+t*A*u+e*(f*A*u-p*m),translateY:a-e+t*p*u+e*(f*p*u+A*m),originX:t,originY:e,a:this.a,b:this.b,c:this.c,d:this.d,e:this.e,f:this.f}}equals(t){if(t===this)return!0;const e=new ht(t);return lt(this.a,e.a)&<(this.b,e.b)&<(this.c,e.c)&<(this.d,e.d)&<(this.e,e.e)&<(this.f,e.f)}flip(t,e){return this.clone().flipO(t,e)}flipO(t,e){return"x"===t?this.scaleO(-1,1,e,0):"y"===t?this.scaleO(1,-1,0,e):this.scaleO(-1,-1,t,e||t)}init(t){const e=ht.fromArray([1,0,0,1,0,0]);return t=t instanceof Pt?t.matrixify():"string"==typeof t?ht.fromArray(t.split(et).map(parseFloat)):Array.isArray(t)?ht.fromArray(t):"object"==typeof t&&ht.isMatrixLike(t)?t:"object"==typeof t?(new ht).transform(t):6===arguments.length?ht.fromArray([].slice.call(arguments)):e,this.a=null!=t.a?t.a:e.a,this.b=null!=t.b?t.b:e.b,this.c=null!=t.c?t.c:e.c,this.d=null!=t.d?t.d:e.d,this.e=null!=t.e?t.e:e.e,this.f=null!=t.f?t.f:e.f,this}inverse(){return this.clone().inverseO()}inverseO(){const t=this.a,e=this.b,n=this.c,i=this.d,r=this.e,s=this.f,o=t*i-e*n;if(!o)throw new Error("Cannot invert "+this);const a=i/o,l=-e/o,h=-n/o,u=t/o,c=-(a*r+h*s),d=-(l*r+u*s);return this.a=a,this.b=l,this.c=h,this.d=u,this.e=c,this.f=d,this}lmultiply(t){return this.clone().lmultiplyO(t)}lmultiplyO(t){const e=t instanceof ht?t:new ht(t);return ht.matrixMultiply(e,this,this)}multiply(t){return this.clone().multiplyO(t)}multiplyO(t){const e=t instanceof ht?t:new ht(t);return ht.matrixMultiply(this,e,this)}rotate(t,e,n){return this.clone().rotateO(t,e,n)}rotateO(t,e=0,n=0){t=y(t);const i=Math.cos(t),r=Math.sin(t),{a:s,b:o,c:a,d:l,e:h,f:u}=this;return this.a=s*i-o*r,this.b=o*i+s*r,this.c=a*i-l*r,this.d=l*i+a*r,this.e=h*i-u*r+n*r-e*i+e,this.f=u*i+h*r-e*r-n*i+n,this}scale(t,e,n,i){return this.clone().scaleO(...arguments)}scaleO(t,e=t,n=0,i=0){3===arguments.length&&(i=n,n=e,e=t);const{a:r,b:s,c:o,d:a,e:l,f:h}=this;return this.a=r*t,this.b=s*e,this.c=o*t,this.d=a*e,this.e=l*t-n*t+n,this.f=h*e-i*e+i,this}shear(t,e,n){return this.clone().shearO(t,e,n)}shearO(t,e=0,n=0){const{a:i,b:r,c:s,d:o,e:a,f:l}=this;return this.a=i+r*t,this.c=s+o*t,this.e=a+l*t-n*t,this}skew(t,e,n,i){return this.clone().skewO(...arguments)}skewO(t,e=t,n=0,i=0){3===arguments.length&&(i=n,n=e,e=t),t=y(t),e=y(e);const r=Math.tan(t),s=Math.tan(e),{a:o,b:a,c:l,d:h,e:u,f:c}=this;return this.a=o+a*r,this.b=a+o*s,this.c=l+h*r,this.d=h+l*s,this.e=u+c*r-i*r,this.f=c+u*s-n*s,this}skewX(t,e,n){return this.skew(t,0,e,n)}skewY(t,e,n){return this.skew(0,t,e,n)}toArray(){return[this.a,this.b,this.c,this.d,this.e,this.f]}toString(){return"matrix("+this.a+","+this.b+","+this.c+","+this.d+","+this.e+","+this.f+")"}transform(t){if(ht.isMatrixLike(t)){return new ht(t).multiplyO(this)}const e=ht.formatTransforms(t),{x:n,y:i}=new at(e.ox,e.oy).transform(this),r=(new ht).translateO(e.rx,e.ry).lmultiplyO(this).translateO(-n,-i).scaleO(e.scaleX,e.scaleY).skewO(e.skewX,e.skewY).shearO(e.shear).rotateO(e.theta).translateO(n,i);if(isFinite(e.px)||isFinite(e.py)){const t=new at(n,i).transform(r),s=isFinite(e.px)?e.px-t.x:0,o=isFinite(e.py)?e.py-t.y:0;r.translateO(s,o)}return r.translateO(e.tx,e.ty),r}translate(t,e){return this.clone().translateO(t,e)}translateO(t,e){return this.e+=t||0,this.f+=e||0,this}valueOf(){return{a:this.a,b:this.b,c:this.c,d:this.d,e:this.e,f:this.f}}}function ut(){if(!ut.nodes){const t=N().size(2,0);t.node.style.cssText=["opacity: 0","position: absolute","left: -100%","top: -100%","overflow: hidden"].join(";"),t.attr("focusable","false"),t.attr("aria-hidden","true");const e=t.path().node;ut.nodes={svg:t,path:e}}if(!ut.nodes.svg.node.parentNode){const t=_.document.body||_.document.documentElement;ut.nodes.svg.addTo(t)}return ut.nodes}function ct(t){return!(t.width||t.height||t.x||t.y)}I(ht,"Matrix");class dt{constructor(...t){this.init(...t)}addOffset(){return this.x+=_.window.pageXOffset,this.y+=_.window.pageYOffset,new dt(this)}init(t){return t="string"==typeof t?t.split(et).map(parseFloat):Array.isArray(t)?t:"object"==typeof t?[null!=t.left?t.left:t.x,null!=t.top?t.top:t.y,t.width,t.height]:4===arguments.length?[].slice.call(arguments):[0,0,0,0],this.x=t[0]||0,this.y=t[1]||0,this.width=this.w=t[2]||0,this.height=this.h=t[3]||0,this.x2=this.x+this.w,this.y2=this.y+this.h,this.cx=this.x+this.w/2,this.cy=this.y+this.h/2,this}isNulled(){return ct(this)}merge(t){const e=Math.min(this.x,t.x),n=Math.min(this.y,t.y),i=Math.max(this.x+this.width,t.x+t.width)-e,r=Math.max(this.y+this.height,t.y+t.height)-n;return new dt(e,n,i,r)}toArray(){return[this.x,this.y,this.width,this.height]}toString(){return this.x+" "+this.y+" "+this.width+" "+this.height}transform(t){t instanceof ht||(t=new ht(t));let e=1/0,n=-1/0,i=1/0,r=-1/0;return[new at(this.x,this.y),new at(this.x2,this.y),new at(this.x,this.y2),new at(this.x2,this.y2)].forEach((function(s){s=s.transform(t),e=Math.min(e,s.x),n=Math.max(n,s.x),i=Math.min(i,s.y),r=Math.max(r,s.y)})),new dt(e,i,n-e,r-i)}}function At(t,e,n){let i;try{if(i=e(t.node),ct(i)&&((r=t.node)!==_.document&&!(_.document.documentElement.contains||function(t){for(;t.parentNode;)t=t.parentNode;return t===_.document}).call(_.document.documentElement,r)))throw new Error("Element not in the dom")}catch(e){i=n(t)}var r;return i}p({viewbox:{viewbox(t,e,n,i){return null==t?new dt(this.attr("viewBox")):this.attr("viewBox",new dt(t,e,n,i))},zoom(t,e){let{width:n,height:i}=this.attr(["width","height"]);if((n||i)&&"string"!=typeof n&&"string"!=typeof i||(n=this.node.clientWidth,i=this.node.clientHeight),!n||!i)throw new Error("Impossible to get absolute width and height. Please provide an absolute width and height attribute on the zooming element");const r=this.viewbox(),s=n/r.width,o=i/r.height,a=Math.min(s,o);if(null==t)return a;let l=a/t;l===1/0&&(l=Number.MAX_SAFE_INTEGER/100),e=e||new at(n/2/s+r.x,i/2/o+r.y);const h=new dt(r).transform(new ht({scale:l,origin:e}));return this.viewbox(h)}}}),I(dt,"Box");class pt extends Array{constructor(t=[],...e){if(super(t,...e),"number"==typeof t)return this;this.length=0,this.push(...t)}}Y([pt],{each(t,...e){return"function"==typeof t?this.map((e,n,i)=>t.call(e,e,n,i)):this.map(n=>n[t](...e))},toArray(){return Array.prototype.concat.apply([],this)}});const ft=["toArray","constructor","each"];function mt(t,e){return new pt(g((e||_.document).querySelectorAll(t),(function(t){return L(t)})))}pt.extend=function(t){t=t.reduce((t,e)=>(ft.includes(e)||"_"===e[0]||(t[e]=function(...t){return this.each(e,...t)}),t),{}),Y([pt],t)};let gt=0;const Ct={};function yt(t){let e=t.getEventHolder();return e===_.window&&(e=Ct),e.events||(e.events={}),e.events}function wt(t){return t.getEventTarget()}function vt(t,e,n,i,r){const s=n.bind(i||t),o=N(t),a=yt(o),l=wt(o);e=Array.isArray(e)?e:e.split(et),n._svgjsListenerId||(n._svgjsListenerId=++gt),e.forEach((function(t){const e=t.split(".")[0],i=t.split(".")[1]||"*";a[e]=a[e]||{},a[e][i]=a[e][i]||{},a[e][i][n._svgjsListenerId]=s,l.addEventListener(e,s,r||!1)}))}function xt(t,e,n,i){const r=N(t),s=yt(r),o=wt(r);("function"!=typeof n||(n=n._svgjsListenerId))&&(e=Array.isArray(e)?e:(e||"").split(et)).forEach((function(t){const e=t&&t.split(".")[0],a=t&&t.split(".")[1];let l,h;if(n)s[e]&&s[e][a||"*"]&&(o.removeEventListener(e,s[e][a||"*"][n],i||!1),delete s[e][a||"*"][n]);else if(e&&a){if(s[e]&&s[e][a]){for(h in s[e][a])xt(o,[e,a].join("."),h);delete s[e][a]}}else if(a)for(t in s)for(l in s[t])a===l&&xt(o,[t,a].join("."));else if(e){if(s[e]){for(l in s[e])xt(o,[e,l].join("."));delete s[e]}}else{for(t in s)xt(o,t);!function(t){let e=t.getEventHolder();e===_.window&&(e=Ct),e.events&&(e.events={})}(r)}}))}class bt extends P{addEventListener(){}dispatch(t,e,n){return function(t,e,n,i){const r=wt(t);return e instanceof _.window.Event||(e=new _.window.CustomEvent(e,{detail:n,cancelable:!0,...i})),r.dispatchEvent(e),e}(this,t,e,n)}dispatchEvent(t){const e=this.getEventHolder().events;if(!e)return!0;const n=e[t.type];for(const e in n)for(const i in n[e])n[e][i](t);return!t.defaultPrevented}fire(t,e,n){return this.dispatch(t,e,n),this}getEventHolder(){return this}getEventTarget(){return this}off(t,e){return xt(this,t,e),this}on(t,e,n,i){return vt(this,t,e,n,i),this}removeEventListener(){}}function Mt(){}I(bt,"EventTarget");const Ot={duration:400,ease:">",delay:0},Et={"fill-opacity":1,"stroke-opacity":1,"stroke-width":0,"stroke-linejoin":"miter","stroke-linecap":"butt",fill:"#000000",stroke:"#000000",opacity:1,x:0,y:0,cx:0,cy:0,width:0,height:0,r:0,rx:0,ry:0,offset:0,"stop-opacity":1,"stop-color":"#000000","text-anchor":"start"};class Dt extends Array{constructor(...t){super(...t),this.init(...t)}clone(){return new this.constructor(this)}init(t){return"number"==typeof t||(this.length=0,this.push(...this.parse(t))),this}parse(t=[]){return t instanceof Array?t:t.trim().split(et).map(parseFloat)}toArray(){return Array.prototype.concat.apply([],this)}toSet(){return new Set(this)}toString(){return this.join(" ")}valueOf(){const t=[];return t.push(...this),t}}class kt{constructor(...t){this.init(...t)}convert(t){return new kt(this.value,t)}divide(t){return t=new kt(t),new kt(this/t,this.unit||t.unit)}init(t,e){return e=Array.isArray(t)?t[1]:e,t=Array.isArray(t)?t[0]:t,this.value=0,this.unit=e||"","number"==typeof t?this.value=isNaN(t)?0:isFinite(t)?t:t<0?-34e37:34e37:"string"==typeof t?(e=t.match(U))&&(this.value=parseFloat(e[1]),"%"===e[5]?this.value/=100:"s"===e[5]&&(this.value*=1e3),this.unit=e[5]):t instanceof kt&&(this.value=t.valueOf(),this.unit=t.unit),this}minus(t){return t=new kt(t),new kt(this-t,this.unit||t.unit)}plus(t){return t=new kt(t),new kt(this+t,this.unit||t.unit)}times(t){return t=new kt(t),new kt(this*t,this.unit||t.unit)}toArray(){return[this.value,this.unit]}toJSON(){return this.toString()}toString(){return("%"===this.unit?~~(1e8*this.value)/1e6:"s"===this.unit?this.value/1e3:this.value)+this.unit}valueOf(){return this.value}}const zt=[];class _t extends bt{constructor(t,e){super(),this.node=t,this.type=t.nodeName,e&&t!==e&&this.attr(e)}add(t,e){return(t=N(t)).removeNamespace&&this.node instanceof _.window.SVGElement&&t.removeNamespace(),null==e?this.node.appendChild(t.node):t.node!==this.node.childNodes[e]&&this.node.insertBefore(t.node,this.node.childNodes[e]),this}addTo(t,e){return N(t).put(this,e)}children(){return new pt(g(this.node.children,(function(t){return L(t)})))}clear(){for(;this.node.hasChildNodes();)this.node.removeChild(this.node.lastChild);return this}clone(t=!0){return this.writeDataToDom(),new this.constructor(function t(e){for(let n=e.children.length-1;n>=0;n--)t(e.children[n]);return e.id?(e.id=R(e.nodeName),e):e}(this.node.cloneNode(t)))}each(t,e){const n=this.children();let i,r;for(i=0,r=n.length;i=0}html(t,e){return this.xml(t,e,E)}id(t){return void 0!==t||this.node.id||(this.node.id=R(this.type)),this.attr("id",t)}index(t){return[].slice.call(this.node.childNodes).indexOf(t.node)}last(){return L(this.node.lastChild)}matches(t){const e=this.node,n=e.matches||e.matchesSelector||e.msMatchesSelector||e.mozMatchesSelector||e.webkitMatchesSelector||e.oMatchesSelector||null;return n&&n.call(e,t)}parent(t){let e=this;if(!e.node.parentNode)return null;if(e=L(e.node.parentNode),!t)return e;do{if("string"==typeof t?e.matches(t):e instanceof t)return e}while(e=L(e.node.parentNode));return e}put(t,e){return t=N(t),this.add(t,e),t}putIn(t,e){return N(t).add(this,e)}remove(){return this.parent()&&this.parent().removeElement(this),this}removeElement(t){return this.node.removeChild(t.node),this}replace(t){return t=N(t),this.node.parentNode&&this.node.parentNode.replaceChild(t.node,this.node),t}round(t=2,e=null){const n=10**t,i=this.attr(e);for(const t in i)"number"==typeof i[t]&&(i[t]=Math.round(i[t]*n)/n);return this.attr(i),this}svg(t,e){return this.xml(t,e,O)}toString(){return this.id()}words(t){return this.node.textContent=t,this}wrap(t){const e=this.parent();if(!e)return this.addTo(t);const n=e.index(this);return e.put(t,n).put(this)}writeDataToDom(){return this.each((function(){this.writeDataToDom()})),this}xml(t,e,n){if("boolean"==typeof t&&(n=e,e=t,t=null),null==t||"function"==typeof t){e=null==e||e,this.writeDataToDom();let n=this;if(null!=t){if(n=L(n.node.cloneNode(!0)),e){const e=t(n);if(n=e||n,!1===e)return""}n.each((function(){const e=t(this),n=e||this;!1===e?this.remove():e&&this!==n&&this.replace(n)}),!0)}return e?n.node.outerHTML:n.node.innerHTML}e=null!=e&&e;const i=S("wrapper",n),r=_.document.createDocumentFragment();i.innerHTML=t;for(let t=i.children.length;t--;)r.appendChild(i.firstElementChild);const s=this.parent();return e?this.replace(r)&&s:this.add(r)}}Y(_t,{attr:function(t,e,n){if(null==t){t={},e=this.node.attributes;for(const n of e)t[n.nodeName]=$.test(n.nodeValue)?parseFloat(n.nodeValue):n.nodeValue;return t}if(t instanceof Array)return t.reduce((t,e)=>(t[e]=this.attr(e),t),{});if("object"==typeof t&&t.constructor===Object)for(e in t)this.attr(e,t[e]);else if(null===e)this.node.removeAttribute(t);else{if(null==e)return null==(e=this.node.getAttribute(t))?Et[t]:$.test(e)?parseFloat(e):e;"number"==typeof(e=zt.reduce((e,n)=>n(t,e,this),e))?e=new kt(e):ot.isColor(e)?e=new ot(e):e.constructor===Array&&(e=new Dt(e)),"leading"===t?this.leading&&this.leading(e):"string"==typeof n?this.node.setAttributeNS(n,t,e.toString()):this.node.setAttribute(t,e.toString()),!this.rebuild||"font-size"!==t&&"x"!==t||this.rebuild()}return this},find:function(t){return mt(t,this.node)},findOne:function(t){return L(this.node.querySelector(t))}}),I(_t,"Dom");class Pt extends _t{constructor(t,e){super(t,e),this.dom={},this.node.instance=this,t.hasAttribute("svgjs:data")&&this.setData(JSON.parse(t.getAttribute("svgjs:data"))||{})}center(t,e){return this.cx(t).cy(e)}cx(t){return null==t?this.x()+this.width()/2:this.x(t-this.width()/2)}cy(t){return null==t?this.y()+this.height()/2:this.y(t-this.height()/2)}defs(){const t=this.root();return t&&t.defs()}dmove(t,e){return this.dx(t).dy(e)}dx(t=0){return this.x(new kt(t).plus(this.x()))}dy(t=0){return this.y(new kt(t).plus(this.y()))}getEventHolder(){return this}height(t){return this.attr("height",t)}move(t,e){return this.x(t).y(e)}parents(t=this.root()){t=N(t);const e=new pt;let n=this;for(;(n=n.parent())&&n.node!==_.document&&"#document-fragment"!==n.nodeName&&(e.push(n),n.node!==t.node););return e}reference(t){if(!(t=this.attr(t)))return null;const e=(t+"").match(G);return e?N(e[1]):null}root(){const t=this.parent(j[T]);return t&&t.root()}setData(t){return this.dom=t,this}size(t,e){const n=b(this,t,e);return this.width(new kt(n.width)).height(new kt(n.height))}width(t){return this.attr("width",t)}writeDataToDom(){return this.node.removeAttribute("svgjs:data"),Object.keys(this.dom).length&&this.node.setAttribute("svgjs:data",JSON.stringify(this.dom)),super.writeDataToDom()}x(t){return this.attr("x",t)}y(t){return this.attr("y",t)}}Y(Pt,{bbox:function(){const t=At(this,t=>t.getBBox(),t=>{try{const e=t.clone().addTo(ut().svg).show(),n=e.node.getBBox();return e.remove(),n}catch(e){throw new Error(`Getting bbox of element "${t.node.nodeName}" is not possible: ${e.toString()}`)}});return new dt(t)},rbox:function(t){const e=At(this,t=>t.getBoundingClientRect(),t=>{throw new Error(`Getting rbox of element "${t.node.nodeName}" is not possible`)}),n=new dt(e);return t?n.transform(t.screenCTM().inverseO()):n.addOffset()},inside:function(t,e){const n=this.bbox();return t>n.x&&e>n.y&&t=0;n--)null!=e[jt[t][n]]&&this.attr(jt.prefix(t,jt[t][n]),e[jt[t][n]]);return this},p(["Element","Runner"],e)})),p(["Element","Runner"],{matrix:function(t,e,n,i,r,s){return null==t?new ht(this):this.attr("transform",new ht(t,e,n,i,r,s))},rotate:function(t,e,n){return this.transform({rotate:t,ox:e,oy:n},!0)},skew:function(t,e,n,i){return 1===arguments.length||3===arguments.length?this.transform({skew:t,ox:e,oy:n},!0):this.transform({skew:[t,e],ox:n,oy:i},!0)},shear:function(t,e,n){return this.transform({shear:t,ox:e,oy:n},!0)},scale:function(t,e,n,i){return 1===arguments.length||3===arguments.length?this.transform({scale:t,ox:e,oy:n},!0):this.transform({scale:[t,e],ox:n,oy:i},!0)},translate:function(t,e){return this.transform({translate:[t,e]},!0)},relative:function(t,e){return this.transform({relative:[t,e]},!0)},flip:function(t="both",e="center"){return-1==="xybothtrue".indexOf(t)&&(e=t,t="both"),this.transform({flip:t,origin:e},!0)},opacity:function(t){return this.attr("opacity",t)}}),p("radius",{radius:function(t,e=t){return"radialGradient"===(this._element||this).type?this.attr("r",new kt(t)):this.rx(t).ry(e)}}),p("Path",{length:function(){return this.node.getTotalLength()},pointAt:function(t){return new at(this.node.getPointAtLength(t))}}),p(["Element","Runner"],{font:function(t,e){if("object"==typeof t){for(e in t)this.font(e,t[e]);return this}return"leading"===t?this.leading(e):"anchor"===t?this.attr("text-anchor",e):"size"===t||"family"===t||"weight"===t||"stretch"===t||"variant"===t||"style"===t?this.attr("font-"+t,e):this.attr(t,e)}});p("Element",["click","dblclick","mousedown","mouseup","mouseover","mouseout","mousemove","mouseenter","mouseleave","touchstart","touchmove","touchleave","touchend","touchcancel"].reduce((function(t,e){return t[e]=function(t){return null===t?this.off(e):this.on(e,t),this},t}),{})),p("Element",{untransform:function(){return this.attr("transform",null)},matrixify:function(){return(this.attr("transform")||"").split(W).slice(0,-1).map((function(t){const e=t.trim().split("(");return[e[0],e[1].split(et).map((function(t){return parseFloat(t)}))]})).reverse().reduce((function(t,e){return"matrix"===e[0]?t.lmultiply(ht.fromArray(e[1])):t[e[0]].apply(t,e[1])}),new ht)},toParent:function(t,e){if(this===t)return this;const n=this.screenCTM(),i=t.screenCTM().inverse();return this.addTo(t,e).untransform().transform(i.multiply(n)),this},toRoot:function(t){return this.toParent(this.root(),t)},transform:function(t,e){if(null==t||"string"==typeof t){const e=new ht(this).decompose();return null==t?e:e[t]}ht.isMatrixLike(t)||(t={...t,origin:M(t,this)});const n=new ht(!0===e?this:e||!1).transform(t);return this.attr("transform",n)}});class Tt extends Pt{flatten(t=this,e){return this.each((function(){if(this instanceof Tt)return this.flatten().ungroup()})),this}ungroup(t=this.parent(),e=t.index(this)){return e=-1===e?t.children().length:e,this.each((function(n,i){return i[i.length-n-1].toParent(t,e)})),this.remove()}}I(Tt,"Container");class St extends Tt{constructor(t,e=t){super(B("defs",t),e)}flatten(){return this}ungroup(){return this}}I(St,"Defs");class Nt extends Pt{}function Bt(t){return this.attr("rx",t)}function Lt(t){return this.attr("ry",t)}function Ht(t){return null==t?this.cx()-this.rx():this.cx(t+this.rx())}function It(t){return null==t?this.cy()-this.ry():this.cy(t+this.ry())}function Vt(t){return this.attr("cx",t)}function Rt(t){return this.attr("cy",t)}function Yt(t){return null==t?2*this.rx():this.rx(new kt(t).divide(2))}function Ft(t){return null==t?2*this.ry():this.ry(new kt(t).divide(2))}I(Nt,"Shape");var Ut={__proto__:null,rx:Bt,ry:Lt,x:Ht,y:It,cx:Vt,cy:Rt,width:Yt,height:Ft};class Qt extends Nt{constructor(t,e=t){super(B("ellipse",t),e)}size(t,e){const n=b(this,t,e);return this.rx(new kt(n.width).divide(2)).ry(new kt(n.height).divide(2))}}Y(Qt,Ut),p("Container",{ellipse:F((function(t=0,e=t){return this.put(new Qt).size(t,e).move(0,0)}))}),I(Qt,"Ellipse");class Xt extends _t{constructor(t=_.document.createDocumentFragment()){super(t)}xml(t,e,n){if("boolean"==typeof t&&(n=e,e=t,t=null),null==t||"function"==typeof t){const t=new _t(S("wrapper",n));return t.add(this.node.cloneNode(!0)),t.xml(!1,n)}return super.xml(t,!1,n)}}function Gt(t,e){return"radialGradient"===(this._element||this).type?this.attr({fx:new kt(t),fy:new kt(e)}):this.attr({x1:new kt(t),y1:new kt(e)})}function Wt(t,e){return"radialGradient"===(this._element||this).type?this.attr({cx:new kt(t),cy:new kt(e)}):this.attr({x2:new kt(t),y2:new kt(e)})}I(Xt,"Fragment");var qt,Kt={__proto__:null,from:Gt,to:Wt};class Zt extends Tt{constructor(t,e){super(B(t+"Gradient","string"==typeof t?null:t),e)}attr(t,e,n){return"transform"===t&&(t="gradientTransform"),super.attr(t,e,n)}bbox(){return new dt}targets(){return mt('svg [fill*="'+this.id()+'"]')}toString(){return this.url()}update(t){return this.clear(),"function"==typeof t&&t.call(this,this),this}url(){return'url("#'+this.id()+'")'}}Y(Zt,Kt),p({Container:{gradient(...t){return this.defs().gradient(...t)}},Defs:{gradient:F((function(t,e){return this.put(new Zt(t)).update(e)}))}}),I(Zt,"Gradient");class Jt extends Tt{constructor(t,e=t){super(B("pattern",t),e)}attr(t,e,n){return"transform"===t&&(t="patternTransform"),super.attr(t,e,n)}bbox(){return new dt}targets(){return mt('svg [fill*="'+this.id()+'"]')}toString(){return this.url()}update(t){return this.clear(),"function"==typeof t&&t.call(this,this),this}url(){return'url("#'+this.id()+'")'}}p({Container:{pattern(...t){return this.defs().pattern(...t)}},Defs:{pattern:F((function(t,e,n){return this.put(new Jt).update(n).attr({x:0,y:0,width:t,height:e,patternUnits:"userSpaceOnUse"})}))}}),I(Jt,"Pattern");class $t extends Nt{constructor(t,e=t){super(B("image",t),e)}load(t,e){if(!t)return this;const n=new _.window.Image;return vt(n,"load",(function(t){const i=this.parent(Jt);0===this.width()&&0===this.height()&&this.size(n.width,n.height),i instanceof Jt&&0===i.width()&&0===i.height()&&i.size(this.width(),this.height()),"function"==typeof e&&e.call(this,t)}),this),vt(n,"load error",(function(){xt(n)})),this.attr("href",n.src=t,k)}}qt=function(t,e,n){return"fill"!==t&&"stroke"!==t||tt.test(e)&&(e=n.root().defs().image(e)),e instanceof $t&&(e=n.root().defs().pattern(0,0,t=>{t.add(e)})),e},zt.push(qt),p({Container:{image:F((function(t,e){return this.put(new $t).size(0,0).load(t,e)}))}}),I($t,"Image");class te extends Dt{bbox(){let t=-1/0,e=-1/0,n=1/0,i=1/0;return this.forEach((function(r){t=Math.max(r[0],t),e=Math.max(r[1],e),n=Math.min(r[0],n),i=Math.min(r[1],i)})),new dt(n,i,t-n,e-i)}move(t,e){const n=this.bbox();if(t-=n.x,e-=n.y,!isNaN(t)&&!isNaN(e))for(let n=this.length-1;n>=0;n--)this[n]=[this[n][0]+t,this[n][1]+e];return this}parse(t=[0,0]){const e=[];(t=t instanceof Array?Array.prototype.concat.apply([],t):t.trim().split(et).map(parseFloat)).length%2!=0&&t.pop();for(let n=0,i=t.length;n=0;n--)i.width&&(this[n][0]=(this[n][0]-i.x)*t/i.width+i.x),i.height&&(this[n][1]=(this[n][1]-i.y)*e/i.height+i.y);return this}toLine(){return{x1:this[0][0],y1:this[0][1],x2:this[1][0],y2:this[1][1]}}toString(){const t=[];for(let e=0,n=this.length;e":function(t){return-Math.cos(t*Math.PI)/2+.5},">":function(t){return Math.sin(t*Math.PI/2)},"<":function(t){return 1-Math.cos(t*Math.PI/2)},bezier:function(t,e,n,i){return function(r){return r<0?t>0?e/t*r:n>0?i/n*r:0:r>1?n<1?(1-i)/(1-n)*r+(i-n)/(1-n):t<1?(1-e)/(1-t)*r+(e-t)/(1-t):1:3*r*(1-r)**2*e+3*r**2*(1-r)*i+r**3}},steps:function(t,e="end"){e=e.split("-").reverse()[0];let n=t;return"none"===e?--n:"both"===e&&++n,(i,r=!1)=>{let s=Math.floor(i*t);const o=i*s%1==0;return"start"!==e&&"both"!==e||++s,r&&o&&--s,i>=0&&s<0&&(s=0),i<=1&&s>n&&(s=n),s/n}}};class oe{done(){return!1}}class ae extends oe{constructor(t=Ot.ease){super(),this.ease=se[t]||t}step(t,e,n){return"number"!=typeof t?n<1?t:e:t+(e-t)*this.ease(n)}}class le extends oe{constructor(t){super(),this.stepper=t}done(t){return t.done}step(t,e,n,i){return this.stepper(t,e,n,i)}}function he(){const t=(this._duration||500)/1e3,e=this._overshoot||0,n=Math.PI,i=Math.log(e/100+1e-10),r=-i/Math.sqrt(n*n+i*i),s=3.9/(r*t);this.d=2*r*s,this.k=s*s}Y(class extends le{constructor(t=500,e=0){super(),this.duration(t).overshoot(e)}step(t,e,n,i){if("string"==typeof t)return t;if(i.done=n===1/0,n===1/0)return e;if(0===n)return t;n>100&&(n=16),n/=1e3;const r=i.velocity||0,s=-this.d*r-this.k*(t-e),o=t+r*n+s*n*n/2;return i.velocity=r+s*n,i.done=Math.abs(e-o)+Math.abs(r)<.002,i.done?e:o}},{duration:re("_duration",he),overshoot:re("_overshoot",he)});Y(class extends le{constructor(t=.1,e=.01,n=0,i=1e3){super(),this.p(t).i(e).d(n).windup(i)}step(t,e,n,i){if("string"==typeof t)return t;if(i.done=n===1/0,n===1/0)return e;if(0===n)return t;const r=e-t;let s=(i.integral||0)+r*n;const o=(r-(i.error||0))/n,a=this._windup;return!1!==a&&(s=Math.max(-a,Math.min(s,a))),i.error=r,i.integral=s,i.done=Math.abs(r)<.001,i.done?e:t+(this.P*r+this.I*s+this.D*o)}},{windup:re("_windup"),p:re("P"),i:re("I"),d:re("D")});const ue={M:2,L:2,H:1,V:1,C:6,S:4,Q:4,T:2,A:7,Z:0},ce={M:function(t,e,n){return e.x=n.x=t[0],e.y=n.y=t[1],["M",e.x,e.y]},L:function(t,e){return e.x=t[0],e.y=t[1],["L",t[0],t[1]]},H:function(t,e){return e.x=t[0],["H",t[0]]},V:function(t,e){return e.y=t[0],["V",t[0]]},C:function(t,e){return e.x=t[4],e.y=t[5],["C",t[0],t[1],t[2],t[3],t[4],t[5]]},S:function(t,e){return e.x=t[2],e.y=t[3],["S",t[0],t[1],t[2],t[3]]},Q:function(t,e){return e.x=t[2],e.y=t[3],["Q",t[0],t[1],t[2],t[3]]},T:function(t,e){return e.x=t[0],e.y=t[1],["T",t[0],t[1]]},Z:function(t,e,n){return e.x=n.x,e.y=n.y,["Z"]},A:function(t,e){return e.x=t[5],e.y=t[6],["A",t[0],t[1],t[2],t[3],t[4],t[5],t[6]]}},de="mlhvqtcsaz".split("");for(let t=0,e=de.length;t=0;i--)n=this[i][0],"M"===n||"L"===n||"T"===n?(this[i][1]+=t,this[i][2]+=e):"H"===n?this[i][1]+=t:"V"===n?this[i][1]+=e:"C"===n||"S"===n||"Q"===n?(this[i][1]+=t,this[i][2]+=e,this[i][3]+=t,this[i][4]+=e,"C"===n&&(this[i][5]+=t,this[i][6]+=e)):"A"===n&&(this[i][6]+=t,this[i][7]+=e);return this}parse(t="M0 0"){return Array.isArray(t)&&(t=Array.prototype.concat.apply([],t).toString()),function(t,e=!0){let n=0,i="";const r={segment:[],inNumber:!1,number:"",lastToken:"",inSegment:!1,segments:[],pointSeen:!1,hasExponent:!1,absolute:e,p0:new at,p:new at};for(;r.lastToken=i,i=t.charAt(n++);)if(r.inSegment||!pe(r,i))if("."!==i)if(isNaN(parseInt(i)))if(" "!==i&&","!==i)if("-"!==i)if("E"!==i.toUpperCase()){if(nt.test(i)){if(r.inNumber)fe(r,!1);else{if(!Ae(r))throw new Error("parser Error");me(r)}--n}}else r.number+=i,r.hasExponent=!0;else{if(r.inNumber&&!Ce(r)){fe(r,!1),--n;continue}r.number+=i,r.inNumber=!0}else r.inNumber&&fe(r,!1);else{if("0"===r.number||ge(r)){r.inNumber=!0,r.number=i,fe(r,!0);continue}r.inNumber=!0,r.number+=i}else{if(r.pointSeen||r.hasExponent){fe(r,!1),--n;continue}r.inNumber=!0,r.pointSeen=!0,r.number+=i}return r.inNumber&&fe(r,!1),r.inSegment&&Ae(r)&&me(r),r.segments}(t)}size(t,e){const n=this.bbox();let i,r;for(n.width=0===n.width?1:n.width,n.height=0===n.height?1:n.height,i=this.length-1;i>=0;i--)r=this[i][0],"M"===r||"L"===r||"T"===r?(this[i][1]=(this[i][1]-n.x)*t/n.width+n.x,this[i][2]=(this[i][2]-n.y)*e/n.height+n.y):"H"===r?this[i][1]=(this[i][1]-n.x)*t/n.width+n.x:"V"===r?this[i][1]=(this[i][1]-n.y)*e/n.height+n.y:"C"===r||"S"===r||"Q"===r?(this[i][1]=(this[i][1]-n.x)*t/n.width+n.x,this[i][2]=(this[i][2]-n.y)*e/n.height+n.y,this[i][3]=(this[i][3]-n.x)*t/n.width+n.x,this[i][4]=(this[i][4]-n.y)*e/n.height+n.y,"C"===r&&(this[i][5]=(this[i][5]-n.x)*t/n.width+n.x,this[i][6]=(this[i][6]-n.y)*e/n.height+n.y)):"A"===r&&(this[i][1]=this[i][1]*t/n.width,this[i][2]=this[i][2]*e/n.height,this[i][6]=(this[i][6]-n.x)*t/n.width+n.x,this[i][7]=(this[i][7]-n.y)*e/n.height+n.y);return this}toString(){return function(t){let e="";for(let n=0,i=t.length;n{const e=typeof t;return"number"===e?kt:"string"===e?ot.isColor(t)?ot:et.test(t)?nt.test(t)?ye:Dt:U.test(t)?kt:xe:Ee.indexOf(t.constructor)>-1?t.constructor:Array.isArray(t)?Dt:"object"===e?Oe:xe};class ve{constructor(t){this._stepper=t||new ae("-"),this._from=null,this._to=null,this._type=null,this._context=null,this._morphObj=null}at(t){const e=this;return this._morphObj.fromArray(this._from.map((function(n,i){return e._stepper.step(n,e._to[i],t,e._context[i],e._context)})))}done(){return this._context.map(this._stepper.done).reduce((function(t,e){return t&&e}),!0)}from(t){return null==t?this._from:(this._from=this._set(t),this)}stepper(t){return null==t?this._stepper:(this._stepper=t,this)}to(t){return null==t?this._to:(this._to=this._set(t),this)}type(t){return null==t?this._type:(this._type=t,this)}_set(t){this._type||this.type(we(t));let e=new this._type(t);return this._type===ot&&(e=this._to?e[this._to[4]]():this._from?e[this._from[4]]():e),this._type===Oe&&(e=this._to?e.align(this._to):this._from?e.align(this._from):e),e=e.toArray(),this._morphObj=this._morphObj||new this._type,this._context=this._context||Array.apply(null,Array(e.length)).map(Object).map((function(t){return t.done=!0,t})),e}}class xe{constructor(...t){this.init(...t)}init(t){return t=Array.isArray(t)?t[0]:t,this.value=t,this}toArray(){return[this.value]}valueOf(){return this.value}}class be{constructor(...t){this.init(...t)}init(t){return Array.isArray(t)&&(t={scaleX:t[0],scaleY:t[1],shear:t[2],rotate:t[3],translateX:t[4],translateY:t[5],originX:t[6],originY:t[7]}),Object.assign(this,be.defaults,t),this}toArray(){const t=this;return[t.scaleX,t.scaleY,t.shear,t.rotate,t.translateX,t.translateY,t.originX,t.originY]}}be.defaults={scaleX:1,scaleY:1,shear:0,rotate:0,translateX:0,translateY:0,originX:0,originY:0};const Me=(t,e)=>t[0]e[0]?1:0;class Oe{constructor(...t){this.init(...t)}align(t){for(let e=0,n=this.values.length;et.concat(e),[]),this}toArray(){return this.values}valueOf(){const t={},e=this.values;for(;e.length;){const n=e.shift(),i=e.shift(),r=e.shift(),s=e.splice(0,r);t[n]=new i(s).valueOf()}return t}}const Ee=[xe,be,Oe];class De extends Nt{constructor(t,e=t){super(B("path",t),e)}array(){return this._array||(this._array=new ye(this.attr("d")))}clear(){return delete this._array,this}height(t){return null==t?this.bbox().height:this.size(this.bbox().width,t)}move(t,e){return this.attr("d",this.array().move(t,e))}plot(t){return null==t?this.array():this.clear().attr("d","string"==typeof t?t:this._array=new ye(t))}size(t,e){const n=b(this,t,e);return this.attr("d",this.array().size(n.width,n.height))}width(t){return null==t?this.bbox().width:this.size(t,this.bbox().height)}x(t){return null==t?this.bbox().x:this.move(t,this.bbox().y)}y(t){return null==t?this.bbox().y:this.move(this.bbox().x,t)}}De.prototype.MorphArray=ye,p({Container:{path:F((function(t){return this.put(new De).plot(t||new ye)}))}}),I(De,"Path");var ke={__proto__:null,array:function(){return this._array||(this._array=new te(this.attr("points")))},clear:function(){return delete this._array,this},move:function(t,e){return this.attr("points",this.array().move(t,e))},plot:function(t){return null==t?this.array():this.clear().attr("points","string"==typeof t?t:this._array=new te(t))},size:function(t,e){const n=b(this,t,e);return this.attr("points",this.array().size(n.width,n.height))}};class ze extends Nt{constructor(t,e=t){super(B("polygon",t),e)}}p({Container:{polygon:F((function(t){return this.put(new ze).plot(t||new te)}))}}),Y(ze,ee),Y(ze,ke),I(ze,"Polygon");class _e extends Nt{constructor(t,e=t){super(B("polyline",t),e)}}p({Container:{polyline:F((function(t){return this.put(new _e).plot(t||new te)}))}}),Y(_e,ee),Y(_e,ke),I(_e,"Polyline");class Pe extends Nt{constructor(t,e=t){super(B("rect",t),e)}}Y(Pe,{rx:Bt,ry:Lt}),p({Container:{rect:F((function(t,e){return this.put(new Pe).size(t,e)}))}}),I(Pe,"Rect");class je{constructor(){this._first=null,this._last=null}first(){return this._first&&this._first.value}last(){return this._last&&this._last.value}push(t){const e=void 0!==t.next?t:{value:t,next:null,prev:null};return this._last?(e.prev=this._last,this._last.next=e,this._last=e):(this._last=e,this._first=e),e}remove(t){t.prev&&(t.prev.next=t.next),t.next&&(t.next.prev=t.prev),t===this._last&&(this._last=t.prev),t===this._first&&(this._first=t.next),t.prev=null,t.next=null}shift(){const t=this._first;return t?(this._first=t.next,this._first&&(this._first.prev=null),this._last=this._first?this._last:null,t.value):null}}const Te={nextDraw:null,frames:new je,timeouts:new je,immediates:new je,timer:()=>_.window.performance||_.window.Date,transforms:[],frame(t){const e=Te.frames.push({run:t});return null===Te.nextDraw&&(Te.nextDraw=_.window.requestAnimationFrame(Te._draw)),e},timeout(t,e){e=e||0;const n=Te.timer().now()+e,i=Te.timeouts.push({run:t,time:n});return null===Te.nextDraw&&(Te.nextDraw=_.window.requestAnimationFrame(Te._draw)),i},immediate(t){const e=Te.immediates.push(t);return null===Te.nextDraw&&(Te.nextDraw=_.window.requestAnimationFrame(Te._draw)),e},cancelFrame(t){null!=t&&Te.frames.remove(t)},clearTimeout(t){null!=t&&Te.timeouts.remove(t)},cancelImmediate(t){null!=t&&Te.immediates.remove(t)},_draw(t){let e=null;const n=Te.timeouts.last();for(;(e=Te.timeouts.shift())&&(t>=e.time?e.run():Te.timeouts.push(e),e!==n););let i=null;const r=Te.frames.last();for(;i!==r&&(i=Te.frames.shift());)i.run(t);let s=null;for(;s=Te.immediates.shift();)s();Te.nextDraw=Te.timeouts.first()||Te.frames.first()?_.window.requestAnimationFrame(Te._draw):null}},Se=function(t){const e=t.start,n=t.runner.duration();return{start:e,duration:n,end:e+n,runner:t.runner}},Ne=function(){const t=_.window;return(t.performance||t.Date).now()};class Be extends bt{constructor(t=Ne){super(),this._timeSource=t,this._startTime=0,this._speed=1,this._persist=0,this._nextFrame=null,this._paused=!0,this._runners=[],this._runnerIds=[],this._lastRunnerId=-1,this._time=0,this._lastSourceTime=0,this._lastStepTime=0,this._step=this._stepFn.bind(this,!1),this._stepImmediate=this._stepFn.bind(this,!0)}active(){return!!this._nextFrame}finish(){return this.time(this.getEndTimeOfTimeline()+1),this.pause()}getEndTime(){const t=this.getLastRunnerInfo(),e=t?t.runner.duration():0;return(t?t.start:this._time)+e}getEndTimeOfTimeline(){const t=this._runners.map(t=>t.start+t.runner.duration());return Math.max(0,...t)}getLastRunnerInfo(){return this.getRunnerInfoById(this._lastRunnerId)}getRunnerInfoById(t){return this._runners[this._runnerIds.indexOf(t)]||null}pause(){return this._paused=!0,this._continue()}persist(t){return null==t?this._persist:(this._persist=t,this)}play(){return this._paused=!1,this.updateTime()._continue()}reverse(t){const e=this.speed();if(null==t)return this.speed(-e);const n=Math.abs(e);return this.speed(t?-n:n)}schedule(t,e,n){if(null==t)return this._runners.map(Se);let i=0;const r=this.getEndTime();if(e=e||0,null==n||"last"===n||"after"===n)i=r;else if("absolute"===n||"start"===n)i=e,e=0;else if("now"===n)i=this._time;else if("relative"===n){const n=this.getRunnerInfoById(t.id);n&&(i=n.start+e,e=0)}else{if("with-last"!==n)throw new Error('Invalid value for the "when" parameter');{const t=this.getLastRunnerInfo();i=t?t.start:this._time}}t.unschedule(),t.timeline(this);const s=t.persist(),o={persist:null===s?this._persist:s,start:i+e,runner:t};return this._lastRunnerId=t.id,this._runners.push(o),this._runners.sort((t,e)=>t.start-e.start),this._runnerIds=this._runners.map(t=>t.runner.id),this.updateTime()._continue(),this}seek(t){return this.time(this._time+t)}source(t){return null==t?this._timeSource:(this._timeSource=t,this)}speed(t){return null==t?this._speed:(this._speed=t,this)}stop(){return this.time(0),this.pause()}time(t){return null==t?this._time:(this._time=t,this._continue(!0))}unschedule(t){const e=this._runnerIds.indexOf(t.id);return e<0||(this._runners.splice(e,1),this._runnerIds.splice(e,1),t.timeline(null)),this}updateTime(){return this.active()||(this._lastSourceTime=this._timeSource()),this}_continue(t=!1){return Te.cancelFrame(this._nextFrame),this._nextFrame=null,t?this._stepImmediate():(this._paused||(this._nextFrame=Te.frame(this._step)),this)}_stepFn(t=!1){const e=this._timeSource();let n=e-this._lastSourceTime;t&&(n=0);const i=this._speed*n+(this._time-this._lastStepTime);this._lastSourceTime=e,t||(this._time+=i,this._time=this._time<0?0:this._time),this._lastStepTime=this._time,this.fire("time",this._time);for(let t=this._runners.length;t--;){const e=this._runners[t],n=e.runner;this._time-e.start<=0&&n.reset()}let r=!1;for(let t=0,e=this._runners.length;t0?this._continue():(this.pause(),this.fire("finished")),this}}p({Element:{timeline:function(t){return null==t?(this._timeline=this._timeline||new Be,this._timeline):(this._timeline=t,this)}}});class Le extends bt{constructor(t){super(),this.id=Le.id++,t="function"==typeof(t=null==t?Ot.duration:t)?new le(t):t,this._element=null,this._timeline=null,this.done=!1,this._queue=[],this._duration="number"==typeof t&&t,this._isDeclarative=t instanceof le,this._stepper=this._isDeclarative?t:new ae,this._history={},this.enabled=!0,this._time=0,this._lastTime=0,this._reseted=!0,this.transforms=new ht,this.transformId=1,this._haveReversed=!1,this._reverse=!1,this._loopsDone=0,this._swing=!1,this._wait=0,this._times=1,this._frameId=null,this._persist=!!this._isDeclarative||null}static sanitise(t,e,n){let i=1,r=!1,s=0;return e=e||Ot.delay,n=n||"last","object"!=typeof(t=t||Ot.duration)||t instanceof oe||(e=t.delay||e,n=t.when||n,r=t.swing||r,i=t.times||i,s=t.wait||s,t=t.duration||Ot.duration),{duration:t,delay:e,swing:r,times:i,wait:s,when:n}}active(t){return null==t?this.enabled:(this.enabled=t,this)}addTransform(t,e){return this.transforms.lmultiplyO(t),this}after(t){return this.on("finished",t)}animate(t,e,n){const i=Le.sanitise(t,e,n),r=new Le(i.duration);return this._timeline&&r.timeline(this._timeline),this._element&&r.element(this._element),r.loop(i).schedule(i.delay,i.when)}clearTransform(){return this.transforms=new ht,this}clearTransformsFromQueue(){this.done&&this._timeline&&this._timeline._runnerIds.includes(this.id)||(this._queue=this._queue.filter(t=>!t.isTransform))}delay(t){return this.animate(0,t)}duration(){return this._times*(this._wait+this._duration)-this._wait}during(t){return this.queue(null,t)}ease(t){return this._stepper=new ae(t),this}element(t){return null==t?this._element:(this._element=t,t._prepareRunner(),this)}finish(){return this.step(1/0)}loop(t,e,n){return"object"==typeof t&&(e=t.swing,n=t.wait,t=t.times),this._times=t||1/0,this._swing=e||!1,this._wait=n||0,!0===this._times&&(this._times=1/0),this}loops(t){const e=this._duration+this._wait;if(null==t){const t=Math.floor(this._time/e),n=(this._time-t*e)/this._duration;return Math.min(t+n,this._times)}const n=t%1,i=e*Math.floor(t)+this._duration*n;return this.time(i)}persist(t){return null==t?this._persist:(this._persist=t,this)}position(t){const e=this._time,n=this._duration,i=this._wait,r=this._times,s=this._swing,o=this._reverse;let a;if(null==t){const t=function(t){const e=s*Math.floor(t%(2*(i+n))/(i+n)),r=e&&!o||!e&&o,a=Math.pow(-1,r)*(t%(i+n))/n+r;return Math.max(Math.min(a,1),0)},l=r*(i+n)-i;return a=e<=0?Math.round(t(1e-5)):e=0;this._lastPosition=e;const i=this.duration(),r=this._lastTime<=0&&this._time>0,s=this._lastTime=i;this._lastTime=this._time,r&&this.fire("start",this);const o=this._isDeclarative;this.done=!o&&!s&&this._time>=i,this._reseted=!1;let a=!1;return(n||o)&&(this._initialise(n),this.transforms=new ht,a=this._run(o?t:e),this.fire("step",this)),this.done=this.done||a&&o,s&&this.fire("finished",this),this}time(t){if(null==t)return this._time;const e=t-this._time;return this.step(e),this}timeline(t){return void 0===t?this._timeline:(this._timeline=t,this)}unschedule(){const t=this.timeline();return t&&t.unschedule(this),this}_initialise(t){if(t||this._isDeclarative)for(let e=0,n=this._queue.length;et.lmultiplyO(e),Ve=t=>t.transforms;function Re(){const t=this._transformationRunners.runners.map(Ve).reduce(Ie,new ht);this.transform(t),this._transformationRunners.merge(),1===this._transformationRunners.length()&&(this._frameId=null)}class Ye{constructor(){this.runners=[],this.ids=[]}add(t){if(this.runners.includes(t))return;const e=t.id+1;return this.runners.push(t),this.ids.push(e),this}clearBefore(t){const e=this.ids.indexOf(t+1)||1;return this.ids.splice(0,e,0),this.runners.splice(0,e,new He).forEach(t=>t.clearTransformsFromQueue()),this}edit(t,e){const n=this.ids.indexOf(t+1);return this.ids.splice(n,1,t+1),this.runners.splice(n,1,e),this}getByID(t){return this.runners[this.ids.indexOf(t+1)]}length(){return this.ids.length}merge(){let t=null;for(let e=0;ee.id<=t.id).map(Ve).reduce(Ie,new ht)},_addRunner(t){this._transformationRunners.add(t),Te.cancelImmediate(this._frameId),this._frameId=Te.immediate(Re.bind(this))},_prepareRunner(){null==this._frameId&&(this._transformationRunners=(new Ye).add(new He(new ht(this))))}}});Y(Le,{attr(t,e){return this.styleAttr("attr",t,e)},css(t,e){return this.styleAttr("css",t,e)},styleAttr(t,e,n){if("string"==typeof e)return this.styleAttr(t,{[e]:n});let i=e;if(this._tryRetarget(t,i))return this;let r=new ve(this._stepper).to(i),s=Object.keys(i);return this.queue((function(){r=r.from(this.element()[t](s))}),(function(e){return this.element()[t](r.at(e).valueOf()),r.done()}),(function(e){const n=Object.keys(e),o=(a=s,n.filter(t=>!a.includes(t)));var a;if(o.length){const e=this.element()[t](o),n=new Oe(r.from()).valueOf();Object.assign(n,e),r.from(n)}const l=new Oe(r.to()).valueOf();Object.assign(l,e),r.to(l),s=n,i=e})),this._rememberMorpher(t,r),this},zoom(t,e){if(this._tryRetarget("zoom",t,e))return this;let n=new ve(this._stepper).to(new kt(t));return this.queue((function(){n=n.from(this.element().zoom())}),(function(t){return this.element().zoom(n.at(t),e),n.done()}),(function(t,i){e=i,n.to(t)})),this._rememberMorpher("zoom",n),this},transform(t,e,n){if(e=t.relative||e,this._isDeclarative&&!e&&this._tryRetarget("transform",t))return this;const i=ht.isMatrixLike(t);n=null!=t.affine?t.affine:null!=n?n:!i;const r=new ve(this._stepper).type(n?be:ht);let s,o,a,l,h;return this.queue((function(){o=o||this.element(),s=s||M(t,o),h=new ht(e?void 0:o),o._addRunner(this),e||o._clearTransformRunnersBefore(this)}),(function(u){e||this.clearTransform();const{x:c,y:d}=new at(s).transform(o._currentTransform(this));let A=new ht({...t,origin:[c,d]}),p=this._isDeclarative&&a?a:h;if(n){A=A.decompose(c,d),p=p.decompose(c,d);const t=A.rotate,e=p.rotate,n=[t-360,t,t+360],i=n.map(t=>Math.abs(t-e)),r=Math.min(...i),s=i.indexOf(r);A.rotate=n[s]}e&&(i||(A.rotate=t.rotate||0),this._isDeclarative&&l&&(p.rotate=l)),r.from(p),r.to(A);const f=r.at(u);return l=f.rotate,a=new ht(f),this.addTransform(a),o._addRunner(this),r.done()}),(function(e){(e.origin||"center").toString()!==(t.origin||"center").toString()&&(s=M(e,o)),t={...e,origin:s}}),!0),this._isDeclarative&&this._rememberMorpher("transform",r),this},x(t,e){return this._queueNumber("x",t)},y(t){return this._queueNumber("y",t)},dx(t=0){return this._queueNumberDelta("x",t)},dy(t=0){return this._queueNumberDelta("y",t)},dmove(t,e){return this.dx(t).dy(e)},_queueNumberDelta(t,e){if(e=new kt(e),this._tryRetarget(t,e))return this;const n=new ve(this._stepper).to(e);let i=null;return this.queue((function(){i=this.element()[t](),n.from(i),n.to(i+e)}),(function(e){return this.element()[t](n.at(e)),n.done()}),(function(t){n.to(i+new kt(t))})),this._rememberMorpher(t,n),this},_queueObject(t,e){if(this._tryRetarget(t,e))return this;const n=new ve(this._stepper).to(e);return this.queue((function(){n.from(this.element()[t]())}),(function(e){return this.element()[t](n.at(e)),n.done()})),this._rememberMorpher(t,n),this},_queueNumber(t,e){return this._queueObject(t,new kt(e))},cx(t){return this._queueNumber("cx",t)},cy(t){return this._queueNumber("cy",t)},move(t,e){return this.x(t).y(e)},center(t,e){return this.cx(t).cy(e)},size(t,e){let n;return t&&e||(n=this._element.bbox()),t||(t=n.width/n.height*e),e||(e=n.height/n.width*t),this.width(t).height(e)},width(t){return this._queueNumber("width",t)},height(t){return this._queueNumber("height",t)},plot(t,e,n,i){if(4===arguments.length)return this.plot([t,e,n,i]);if(this._tryRetarget("plot",t))return this;const r=new ve(this._stepper).type(this._element.MorphArray).to(t);return this.queue((function(){r.from(this._element.array())}),(function(t){return this._element.plot(r.at(t)),r.done()})),this._rememberMorpher("plot",r),this},leading(t){return this._queueNumber("leading",t)},viewbox(t,e,n,i){return this._queueObject("viewbox",new dt(t,e,n,i))},update(t){return"object"!=typeof t?this.update({offset:arguments[0],color:arguments[1],opacity:arguments[2]}):(null!=t.opacity&&this.attr("stop-opacity",t.opacity),null!=t.color&&this.attr("stop-color",t.color),null!=t.offset&&this.attr("offset",t.offset),this)}}),Y(Le,{rx:Bt,ry:Lt,from:Gt,to:Wt}),I(Le,"Runner");class Fe extends Tt{constructor(t,e=t){super(B("svg",t),e),this.namespace()}defs(){return this.isRoot()?L(this.node.querySelector("defs"))||this.put(new St):this.root().defs()}isRoot(){return!this.node.parentNode||!(this.node.parentNode instanceof _.window.SVGElement)&&"#document-fragment"!==this.node.parentNode.nodeName}namespace(){return this.isRoot()?this.attr({xmlns:O,version:"1.1"}).attr("xmlns:xlink",k,D).attr("xmlns:svgjs",z,D):this.root().namespace()}removeNamespace(){return this.attr({xmlns:null,version:null}).attr("xmlns:xlink",null,D).attr("xmlns:svgjs",null,D)}root(){return this.isRoot()?this:super.root()}}p({Container:{nested:F((function(){return this.put(new Fe)}))}}),I(Fe,"Svg",!0);class Ue extends Tt{constructor(t,e=t){super(B("symbol",t),e)}}p({Container:{symbol:F((function(){return this.put(new Ue)}))}}),I(Ue,"Symbol");var Qe={__proto__:null,plain:function(t){return!1===this._build&&this.clear(),this.node.appendChild(_.document.createTextNode(t)),this},length:function(){return this.node.getComputedTextLength()},x:function(t,e=this.bbox()){return null==t?e.x:this.attr("x",this.attr("x")+t-e.x)},y:function(t,e=this.bbox()){return null==t?e.y:this.attr("y",this.attr("y")+t-e.y)},move:function(t,e,n=this.bbox()){return this.x(t,n).y(e,n)},cx:function(t,e=this.bbox()){return null==t?e.cx:this.attr("x",this.attr("x")+t-e.cx)},cy:function(t,e=this.bbox()){return null==t?e.cy:this.attr("y",this.attr("y")+t-e.cy)},center:function(t,e,n=this.bbox()){return this.cx(t,n).cy(e,n)},ax:function(t){return this.attr("x",t)},ay:function(t){return this.attr("y",t)},amove:function(t,e){return this.ax(t).ay(e)},build:function(t){return this._build=!!t,this}};class Xe extends Nt{constructor(t,e=t){super(B("text",t),e),this.dom.leading=new kt(1.3),this._rebuild=!0,this._build=!1}leading(t){return null==t?this.dom.leading:(this.dom.leading=new kt(t),this.rebuild())}rebuild(t){if("boolean"==typeof t&&(this._rebuild=t),this._rebuild){const t=this;let e=0;const n=this.dom.leading;this.each((function(i){const r=_.window.getComputedStyle(this.node).getPropertyValue("font-size"),s=n*new kt(r);this.dom.newLined&&(this.attr("x",t.attr("x")),"\n"===this.text()?e+=s:(this.attr("dy",i?s+e:0),e=0))})),this.fire("rebuild")}return this}setData(t){return this.dom=t,this.dom.leading=new kt(t.leading||1.3),this}text(t){if(void 0===t){const e=this.node.childNodes;let n=0;t="";for(let i=0,r=e.length;i{let r;try{r=n.bbox()}catch(t){return}const s=new ht(n),o=s.translate(t,e).transform(s.inverse()),a=new at(r.x,r.y).transform(o);n.move(a.x,a.y)}),this},dx:function(t){return this.dmove(t,0)},dy:function(t){return this.dmove(0,t)},height:function(t,e=this.bbox()){return null==t?e.height:this.size(e.width,t,e)},move:function(t=0,e=0,n=this.bbox()){const i=t-n.x,r=e-n.y;return this.dmove(i,r)},size:function(t,e,n=this.bbox()){const i=b(this,t,e,n),r=i.width/n.width,s=i.height/n.height;return this.children().forEach((t,e)=>{const i=new at(n).transform(new ht(t).inverse());t.scale(r,s,i.x,i.y)}),this},width:function(t,e=this.bbox()){return null==t?e.width:this.size(t,e.height,e)},x:function(t,e=this.bbox()){return null==t?e.x:this.move(t,e.y,e)},y:function(t,e=this.bbox()){return null==t?e.y:this.move(e.x,t,e)}};class Je extends Tt{constructor(t,e=t){super(B("g",t),e)}}Y(Je,Ze),p({Container:{group:F((function(){return this.put(new Je)}))}}),I(Je,"G");class $e extends Tt{constructor(t,e=t){super(B("a",t),e)}target(t){return this.attr("target",t)}to(t){return this.attr("href",t,k)}}Y($e,Ze),p({Container:{link:F((function(t){return this.put(new $e).to(t)}))},Element:{unlink(){const t=this.linker();if(!t)return this;const e=t.parent();if(!e)return this.remove();const n=e.index(t);return e.add(this,n),t.remove(),this},linkTo(t){let e=this.linker();return e||(e=new $e,this.wrap(e)),"function"==typeof t?t.call(e,e):e.to(t),this},linker(){const t=this.parent();return t&&"a"===t.node.nodeName.toLowerCase()?t:null}}}),I($e,"A");class tn extends Tt{constructor(t,e=t){super(B("mask",t),e)}remove(){return this.targets().forEach((function(t){t.unmask()})),super.remove()}targets(){return mt('svg [mask*="'+this.id()+'"]')}}p({Container:{mask:F((function(){return this.defs().put(new tn)}))},Element:{masker(){return this.reference("mask")},maskWith(t){const e=t instanceof tn?t:this.parent().mask().add(t);return this.attr("mask",'url("#'+e.id()+'")')},unmask(){return this.attr("mask",null)}}}),I(tn,"Mask");class en extends Pt{constructor(t,e=t){super(B("stop",t),e)}update(t){return("number"==typeof t||t instanceof kt)&&(t={offset:arguments[0],color:arguments[1],opacity:arguments[2]}),null!=t.opacity&&this.attr("stop-opacity",t.opacity),null!=t.color&&this.attr("stop-color",t.color),null!=t.offset&&this.attr("offset",new kt(t.offset)),this}}p({Gradient:{stop:function(t,e,n){return this.put(new en).update(t,e,n)}}}),I(en,"Stop");class nn extends Pt{constructor(t,e=t){super(B("style",t),e)}addText(t=""){return this.node.textContent+=t,this}font(t,e,n={}){return this.rule("@font-face",{fontFamily:t,src:e,...n})}rule(t,e){return this.addText(function(t,e){if(!t)return"";if(!e)return t;let n=t+"{";for(const t in e)n+=v(t)+":"+e[t]+";";return n+="}",n}(t,e))}}p("Dom",{style(t,e){return this.put(new nn).rule(t,e)},fontface(t,e,n){return this.put(new nn).font(t,e,n)}}),I(nn,"Style");class rn extends Xe{constructor(t,e=t){super(B("textPath",t),e)}array(){const t=this.track();return t?t.array():null}plot(t){const e=this.track();let n=null;return e&&(n=e.plot(t)),null==t?n:this}track(){return this.reference("href")}}p({Container:{textPath:F((function(t,e){return t instanceof Xe||(t=this.text(t)),t.path(e)}))},Text:{path:F((function(t,e=!0){const n=new rn;let i;if(t instanceof De||(t=this.defs().path(t)),n.attr("href","#"+t,k),e)for(;i=this.node.firstChild;)n.node.appendChild(i);return this.put(n)})),textPath(){return this.findOne("textPath")}},Path:{text:F((function(t){return t instanceof Xe||(t=(new Xe).addTo(this.parent()).text(t)),t.path(this)})),targets(){return mt("svg textPath").filter(t=>(t.attr("href")||"").includes(this.id()))}}}),rn.prototype.MorphArray=ye,I(rn,"TextPath");class sn extends Nt{constructor(t,e=t){super(B("use",t),e)}use(t,e){return this.attr("href",(e||"")+"#"+t,k)}}p({Container:{use:F((function(t,e){return this.put(new sn).use(t,e)}))}}),I(sn,"Use");const on=N;Y([Fe,Ue,$t,Jt,ie],f("viewbox")),Y([ne,_e,ze,De],f("marker")),Y(Xe,f("Text")),Y(De,f("Path")),Y(St,f("Defs")),Y([Xe,Ge],f("Tspan")),Y([Pe,Qt,Zt,Le],f("radius")),Y(bt,f("EventTarget")),Y(_t,f("Dom")),Y(Pt,f("Element")),Y(Nt,f("Shape")),Y([Tt,Xt],f("Container")),Y(Zt,f("Gradient")),Y(Le,f("Runner")),pt.extend([...new Set(A)]),function(t=[]){Ee.push(...[].concat(t))}([kt,ot,dt,ht,Dt,te,ye]),Y(Ee,{to(t){return(new ve).type(this.constructor).from(this.valueOf()).to(t)},fromArray(t){return this.init(t),this}});var an=n(3);Y(Pt,{openOnClick:function(t){return window.open(t)},animateContRotate:function(t){return this.animate(t).ease("-").rotate(360).loop()},showOn:function(t){t?this.show():this.hide()},animateOn:function(t,e,n){e?0===this.timeline()._runners.length?n(this.animate(t)):this.timeline().play():this.timeline().stop()},stopAnimation:function(){this.timeline().stop()},getParentNode:function(){return this.node.parentNode},getTopNode:function(){for(var t=this.node;;){if(!t.parentNode||t.className.includes("svg-object"))return t;t=t.parentNode}}}),Y(_t,{updateXHTMLFontText:function(t){for(var e=this.node,n=0;"xhtml:font"!==e.localName;){if(!(e.firstElementChild&&n<10))return;e=e.firstElementChild,n++}e.innerHTML=t}});var ln,hn,un,cn=function(t){function e(e){var n=t.call(this,e)||this;return n.generateComponentStyles=function(){return{wrapper:Object(an.css)(ln||(ln=h(["\n position: relative;\n "],["\n position: relative;\n "]))),svg:Object(an.css)(hn||(hn=h(["\n position: absolute;\n top: 0;\n left: 0;\n "],["\n position: absolute;\n top: 0;\n left: 0;\n "]))),textBox:Object(an.css)(un||(un=h(["\n position: absolute;\n bottom: 0;\n left: 0;\n padding: 10px;\n "],["\n position: absolute;\n bottom: 0;\n left: 0;\n padding: 10px;\n "])))}},n.state={addAllIDs:!1,svgNode:null,svgSource:null,svgMappings:[],mappedElements:null,initFunctionSource:"",initFunction:null,eventFunctionSource:"",eventFunction:null,initialized:!1,context:{}},n}return s(e,t),e.prototype.initializeMappings=function(t){var e=this.props.options.svgMappings,n=o({},this.state.mappedElements);n={};for(var i=0;i20)return;e=e.parentNode}for(var r=0;rt.length)&&(e=t.length);for(var n=0,i=new Array(e);n=t.length?t.apply(this,r):function(){for(var t=arguments.length,i=new Array(t),s=0;s1&&void 0!==arguments[1]?arguments[1]:{};Mn.initial(t),Mn.handler(e);var n={current:t},i=wn(Dn)(n,e),r=wn(En)(n),s=wn(Mn.changes)(t),o=wn(On)(n);function a(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:function(t){return t};return Mn.selector(t),t(n.current)}function l(t){yn(i,r,s,o)(t)}return[a,l]}},zn={paths:{vs:"https://cdn.jsdelivr.net/npm/monaco-editor@0.25.2/min/vs"}};var _n=function(t){return{}.toString.call(t).includes("Object")};var Pn=function(t){return function e(){for(var n=this,i=arguments.length,r=new Array(i),s=0;s=t.length?t.apply(this,r):function(){for(var t=arguments.length,i=new Array(t),s=0;s{i.current=!1}:t,e)};function si(){}function oi(t,e,n,i){return function(t,e){return t.editor.getModel(ai(t,e))}(t,i)||function(t,e,n,i){return t.editor.createModel(e,n,i&&ai(t,i))}(t,e,n,i)}function ai(t,e){return t.Uri.parse(e)}function li({original:t,modified:e,language:n,originalLanguage:i,modifiedLanguage:r,originalModelPath:s,modifiedModelPath:o,keepCurrentOriginalModel:a,keepCurrentModifiedModel:l,theme:h,loading:d,options:A,height:p,width:f,className:m,wrapperClassName:g,beforeMount:C,onMount:y}){const[w,v]=Object(u.useState)(!1),[x,b]=Object(u.useState)(!0),M=Object(u.useRef)(null),O=Object(u.useRef)(null),E=Object(u.useRef)(null),D=Object(u.useRef)(y),k=Object(u.useRef)(C);ii(()=>{const t=Wn.init();return t.then(t=>(O.current=t)&&b(!1)).catch(t=>"cancelation"!==(null==t?void 0:t.type)&&void 0),()=>M.current?function(){const t=M.current.getModel();var e,n;a||null===(e=t.original)||void 0===e||e.dispose();l||null===(n=t.modified)||void 0===n||n.dispose();M.current.dispose()}():t.cancel()}),ri(()=>{const t=M.current.getModifiedEditor();t.getOption(O.current.editor.EditorOption.readOnly)?t.setValue(e):e!==t.getValue()&&(t.executeEdits("",[{range:t.getModel().getFullModelRange(),text:e,forceMoveMarkers:!0}]),t.pushUndoStop())},[e],w),ri(()=>{M.current.getModel().original.setValue(t)},[t],w),ri(()=>{const{original:t,modified:e}=M.current.getModel();O.current.editor.setModelLanguage(t,i||n),O.current.editor.setModelLanguage(e,r||n)},[n,i,r],w),ri(()=>{O.current.editor.setTheme(h)},[h],w),ri(()=>{M.current.updateOptions(A)},[A],w);const z=Object(u.useCallback)(()=>{k.current(O.current);const a=O.current.editor.createModel(t,i||n,s&&O.current.Uri.parse(s)),l=O.current.editor.createModel(e,r||n,o&&O.current.Uri.parse(o));M.current.setModel({original:a,modified:l})},[n,e,r,t,i,s,o]),_=Object(u.useCallback)(()=>{M.current=O.current.editor.createDiffEditor(E.current,{automaticLayout:!0,...A}),z(),O.current.editor.setTheme(h),v(!0)},[A,h,z]);return Object(u.useEffect)(()=>{w&&D.current(M.current,O.current)},[w]),Object(u.useEffect)(()=>{!x&&!w&&_()},[x,w,_]),c.a.createElement(ni,{width:f,height:p,isEditorReady:w,loading:d,_ref:E,className:m,wrapperClassName:g})}li.propTypes={original:Kn.a.string,modified:Kn.a.string,language:Kn.a.string,originalLanguage:Kn.a.string,modifiedLanguage:Kn.a.string,originalModelPath:Kn.a.string,modifiedModelPath:Kn.a.string,keepCurrentOriginalModel:Kn.a.bool,keepCurrentModifiedModel:Kn.a.bool,theme:Kn.a.string,loading:Kn.a.oneOfType([Kn.a.element,Kn.a.string]),options:Kn.a.object,width:Kn.a.oneOfType([Kn.a.number,Kn.a.string]),height:Kn.a.oneOfType([Kn.a.number,Kn.a.string]),className:Kn.a.string,wrapperClassName:Kn.a.string,beforeMount:Kn.a.func,onMount:Kn.a.func},li.defaultProps={theme:"light",loading:"Loading...",options:{},keepCurrentOriginalModel:!1,keepCurrentModifiedModel:!1,width:"100%",height:"100%",beforeMount:si,onMount:si};var hi=function(t){const e=Object(u.useRef)();return Object(u.useEffect)(()=>{e.current=t},[t]),e.current};const ui=new Map;function ci({defaultValue:t,defaultLanguage:e,defaultPath:n,value:i,language:r,path:s,theme:o,line:a,loading:l,options:h,overrideServices:d,saveViewState:A,keepCurrentModel:p,width:f,height:m,className:g,wrapperClassName:C,beforeMount:y,onMount:w,onChange:v,onValidate:x}){const[b,M]=Object(u.useState)(!1),[O,E]=Object(u.useState)(!0),D=Object(u.useRef)(null),k=Object(u.useRef)(null),z=Object(u.useRef)(null),_=Object(u.useRef)(w),P=Object(u.useRef)(y),j=Object(u.useRef)(null),T=Object(u.useRef)(i),S=hi(s);ii(()=>{const t=Wn.init();return t.then(t=>(D.current=t)&&E(!1)).catch(t=>"cancelation"!==(null==t?void 0:t.type)&&void 0),()=>k.current?function(){var t,e;null===(t=j.current)||void 0===t||t.dispose(),p?A&&ui.set(s,k.current.saveViewState()):null===(e=k.current.getModel())||void 0===e||e.dispose();k.current.dispose()}():t.cancel()}),ri(()=>{const n=oi(D.current,t||i,e||r,s);n!==k.current.getModel()&&(A&&ui.set(S,k.current.saveViewState()),k.current.setModel(n),A&&k.current.restoreViewState(ui.get(s)))},[s],b),ri(()=>{k.current.updateOptions(h)},[h],b),ri(()=>{k.current.getOption(D.current.editor.EditorOption.readOnly)?k.current.setValue(i):i!==k.current.getValue()&&(k.current.executeEdits("",[{range:k.current.getModel().getFullModelRange(),text:i,forceMoveMarkers:!0}]),k.current.pushUndoStop())},[i],b),ri(()=>{D.current.editor.setModelLanguage(k.current.getModel(),r)},[r],b),ri(()=>{void 0!==a&&k.current.revealLine(a)},[a],b),ri(()=>{D.current.editor.setTheme(o)},[o],b);const N=Object(u.useCallback)(()=>{P.current(D.current);const a=s||n,l=oi(D.current,i||t,e||r,a);k.current=D.current.editor.create(z.current,{model:l,automaticLayout:!0,...h},d),A&&k.current.restoreViewState(ui.get(a)),D.current.editor.setTheme(o),M(!0)},[t,e,n,i,r,s,h,d,A,o]);return Object(u.useEffect)(()=>{b&&_.current(k.current,D.current)},[b]),Object(u.useEffect)(()=>{!O&&!b&&N()},[O,b,N]),T.current=i,Object(u.useEffect)(()=>{var t,e;b&&v&&(null===(t=j.current)||void 0===t||t.dispose(),j.current=null===(e=k.current)||void 0===e?void 0:e.onDidChangeModelContent(t=>{const e=k.current.getValue();T.current!==e&&v(e,t)}))},[b,v]),Object(u.useEffect)(()=>{if(b){const t=D.current.editor.onDidChangeMarkers(t=>{var e;const n=null===(e=k.current.getModel())||void 0===e?void 0:e.uri;if(n){if(t.find(t=>t.path===n.path)){const t=D.current.editor.getModelMarkers({resource:n});null==x||x(t)}}});return()=>{null==t||t.dispose()}}},[b,x]),c.a.createElement(ni,{width:f,height:m,isEditorReady:b,loading:l,_ref:z,className:g,wrapperClassName:C})}ci.propTypes={defaultValue:Kn.a.string,defaultPath:Kn.a.string,defaultLanguage:Kn.a.string,value:Kn.a.string,language:Kn.a.string,path:Kn.a.string,theme:Kn.a.string,line:Kn.a.number,loading:Kn.a.oneOfType([Kn.a.element,Kn.a.string]),options:Kn.a.object,overrideServices:Kn.a.object,saveViewState:Kn.a.bool,keepCurrentModel:Kn.a.bool,width:Kn.a.oneOfType([Kn.a.number,Kn.a.string]),height:Kn.a.oneOfType([Kn.a.number,Kn.a.string]),className:Kn.a.string,wrapperClassName:Kn.a.string,beforeMount:Kn.a.func,onMount:Kn.a.func,onChange:Kn.a.func,onValidate:Kn.a.func},ci.defaultProps={theme:"light",loading:"Loading...",options:{},overrideServices:{},saveViewState:!0,keepCurrentModel:!1,width:"100%",height:"100%",beforeMount:si,onMount:si,onValidate:si};var di,Ai,pi,fi,mi=ci,gi=Object(u.memo)(mi),Ci=n(4),yi={svgNode:'\n\n \n \n \n image/svg+xml\n \n \n \n \n \n \n \n .cls-1{fill:#2a2e3c;}.cls-2{fill:#c1d301;}.cls-3{fill:#f6511d;}.cls-4{fill:#fff;}.cls-5{fill:#595e71;}\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n>\n ',initSource:"options.animateLogo = (svgmap, data) => {\n let buffer = data.series[0].fields[1].values.buffer;\n let valueCount = buffer.length\n let chartData = [];\n for (let i=0; i {\n return Math.min(acc, val);\n });\n let maxData = 1.05 * chartData.reduce((acc, val) => {\n return Math.max(acc, val);\n });\n let spread = maxData - minData;\n let iconHeight = svgmap.iconbg.height();\n let iconY = svgmap.iconbg.y();\n [svgmap.barOne, svgmap.barTwo, svgmap.barThree, svgmap.barFour].forEach((elem) => {\n elem.animate(1000).ease('<>').move(elem.x(), ((iconHeight * (chartData[0] / maxData)) - elem.height())).loop(0, true);\n });\n }\n ",eventSource:"// example of calling a function defined in the init script\noptions.animateLogo(svgmap, data);\n// Here we're going to initialized some variables just to make things less verbose\n// This is the raw buffer from the values field of the DataFrame\nlet buffer = data.series[0].fields[1].values.buffer;\n// here we collect the most recent value from the Data Frame\nlet lastValue = buffer[buffer.length -1]\n// We need to collect the center of the fan as a static value here, otherwise it will cause a feedback loop in the animation.\n// The rotate animation will use the center of the bounding box by default, but of irregular shaped items, like these fan blades\n// the center is not the center axis of rotation\nconst fanX = svgmap.fanBlades.cx();\nconst fanY = svgmap.fanBlades.cy();\n// Here we're defining a state condition to use later in our pipe animation\nlet leakCond = lastValue > 10 && lastValue < 45;\n\n// Here we're simply making the visibility of the alert icon on top of tbe bell dependent on the last value being greater than 50\nsvgmap.alarmIcon.showOn(lastValue > 50);\n// Now we use the same logic to apply an animation to the sound waves around the bell\nsvgmap.alarmRings.animateOn(1500, (lastValue > 50), (elem) => {\n // this callback is passed the resulting SVG.js runner object which you then chain your animation actions on.\n // Here, we're simply scaling the dark sound wave lines by 10%, with bidirectional easing and looping with swing\n elem.ease('<>').transform({scale: 1.1, relative: true}).loop(0, true);\n})\n// Here we animate the fan, using the static variables we create earlier to get closer to the center of the blades\n// if the item we were rotating was centered in the bounding box, we could just call rotate(360) with no axis specificied\nsvgmap.fanBlades.animateOn(1000, (lastValue > 40), (elem) => {\n elem.ease('-').rotate(360, fanX - 1, fanY +3).loop();\n});\n// these simply hide the elements of the lamp when below the threshold\nsvgmap.lampLens.showOn(lastValue>10);\nsvgmap.lampRays.showOn(lastValue>10);\n// Here we hide the water drop when leakCond is false\nsvgmap.waterDrop.showOn(leakCond)\n// and here we animate the water drop when leakCond is true\nsvgmap.waterDrop.animateOn(2000 - lastValue *20, leakCond, (elem) => {\n // we're using single direction easing to give a gravity affect, and scaling the drop down as it falls off the screen\n elem.ease('<').transform({translateY: 1000, scale: 0.00001}).loop();\n})\n",svgMappings:[{mappedName:"barTwo",svgId:"rect4526"},{mappedName:"barThree",svgId:"rect4528"},{mappedName:"barFour",svgId:"rect4530"},{mappedName:"iconbg",svgId:"rect4522"},{mappedName:"spline",svgId:"path4538"},{mappedName:"barOne",svgId:"rect4524"},{mappedName:"fanBlades",svgId:"g1550"},{mappedName:"alarmIcon",svgId:"g1721"},{mappedName:"lampLens",svgId:"g1942"},{mappedName:"lampRays",svgId:"g1917"},{mappedName:"waterDrop",svgId:"g1995"},{mappedName:"alarmRings",svgId:"g1891"}]},wi=n(2),vi=function(t){function e(){var e=null!==t&&t.apply(this,arguments)||this;return e.onSourceChange=function(){void 0!==e.editorInstance&&e.props.onChange(e.editorInstance.getValue())},e.onEditorDidMount=function(t){e.editorInstance=t},e}return s(e,t),e.prototype.updateDimensions=function(){void 0!==this.editorInstance&&this.editorInstance.layout()},e.prototype.render=function(){var t=this.props.value;return this.editorInstance&&this.editorInstance.layout(),c.a.createElement("div",{onBlur:this.onSourceChange},c.a.createElement(gi,{height:"33vh",language:this.props.language,theme:this.props.theme,value:t,onMount:this.onEditorDidMount}))},e}(c.a.PureComponent),xi=function(t){function e(e){var n=t.call(this,e)||this;return n.state=o({},e.value),n}return s(e,t),e.prototype.render=function(){var t=this,e=this.props,n=e.value,i=e.index,r=e.onChangeItem,s=e.onAdd,a=e.onDelete;return c.a.createElement(wi.HorizontalGroup,null,c.a.createElement(wi.Label,null,"SVG ID"),c.a.createElement(wi.Input,{type:"text",name:"svgId",defaultValue:n.svgId,css:Ci.config.theme,onBlur:function(e){var s=e.currentTarget.value;t.setState({svgId:s}),r&&i&&r(o(o({},n),{svgId:s}),i)}}),c.a.createElement(wi.Label,null,"Mapped Name"),c.a.createElement(wi.Input,{type:"text",name:"mappedName",defaultValue:n.mappedName,css:Ci.config.theme,onBlur:function(e){var s=e.currentTarget.value;t.setState({mappedName:s}),r&&i&&r(o(o({},n),{mappedName:s}),i)}}),n.svgId&&a&&void 0!==i&&c.a.createElement(wi.Tooltip,{content:"Delete this mapping",theme:"info"},c.a.createElement(wi.Button,{variant:"destructive",icon:"trash-alt",size:"sm",onClick:function(){a(i)}},"Remove")),!n.svgId&&s&&c.a.createElement(wi.Tooltip,{content:"Add a new SVG Element ID to svgmap property mapping manually",theme:"info"},c.a.createElement(wi.Button,{variant:"secondary",size:"sm",icon:"plus-circle",onClick:function(){s(t.state)}},"Add")))},e}(c.a.PureComponent),bi=function(t){function e(){var e=null!==t&&t.apply(this,arguments)||this;return e.onChangeItem=function(t,n){var i=l([],a(e.props.value));i[n]=t,e.props.onChange(i)},e.onAdd=function(t){if(""!==t.svgId){var n=l(l([],a(e.props.value)),[t]);e.props.onChange(n)}},e.onDelete=function(t){var n=l([],a(e.props.value));n.splice(t,1),e.props.onChange(n)},e}return s(e,t),e.prototype.render=function(){var t=this,e=Mi(Ci.config.theme),n=this.props.value;return c.a.createElement(wi.VerticalGroup,null,c.a.createElement(wi.HorizontalGroup,null,c.a.createElement(wi.Tooltip,{content:"Clear all SVG Element ID to svgmap property mappings",theme:"info"},c.a.createElement(wi.Button,{variant:"destructive",icon:"trash-alt",size:"sm",onClick:function(){t.props.onChange([])}},"Clear All")),c.a.createElement(xi,{value:{svgId:"",mappedName:""},styles:e,onAdd:this.onAdd})),n.map((function(n,i){return c.a.createElement(xi,{key:n.svgId,value:n,index:i,onChangeItem:t.onChangeItem,onDelete:t.onDelete,styles:e})})))},e}(c.a.PureComponent),Mi=function(t){return{colorPicker:Object(an.css)(di||(di=h(["\n padding: 0 ",";\n "],["\n padding: 0 ",";\n "])),t.spacing.sm),inputPrefix:Object(an.css)(Ai||(Ai=h(["\n display: flex;\n align-items: center;\n "],["\n display: flex;\n align-items: center;\n "]))),trashIcon:Object(an.css)(pi||(pi=h(["\n color: ",";\n cursor: pointer;\n //\n &:hover {\n color: ",";\n }\n "],["\n color: ",";\n cursor: pointer;\n //\n &:hover {\n color: ",";\n }\n "])),t.colors.textWeak,t.colors.text),addIcon:Object(an.css)(fi||(fi=h(["\n color: ",";\n cursor: pointer;\n //\n &:hover {\n color: ",";\n }\n "],["\n color: ",";\n cursor: pointer;\n //\n &:hover {\n color: ",";\n }\n "])),t.colors.textWeak,t.colors.text)}};n.d(e,"plugin",(function(){return Oi}));var Oi=new i.PanelPlugin(cn).useFieldConfig().setPanelOptions((function(t){return t.addBooleanSwitch({category:["SVG Document"],path:"svgAutoComplete",name:"Enable SVG AutoComplete",description:"Enable editor autocompletion, optional as it can be buggy on large documents"}).addCustomEditor({category:["SVG Document"],path:"svgSource",name:"SVG Document",description:"Editor for SVG Document, while small tweaks can be made here, we recommend using a dedicated\n Graphical SVG Editor and simply pasting the resulting XML here",id:"svgSource",defaultValue:yi.svgNode,editor:function(t){var e=Ci.config.theme.name;return c.a.createElement(vi,{language:"xml",theme:"Grafana Light"===e?"vs-light":"vs-dark",value:t.value,onChange:t.onChange})}}).addBooleanSwitch({category:["User JS Render"],path:"eventAutoComplete",name:"Enable Render JS AutoComplete",description:"Enable editor autocompletion, optional as it can be buggy on large documents",defaultValue:!0}).addCustomEditor({category:["User JS Render"],path:"eventSource",name:"User JS Render Code",description:"The User JS Render code is executed whenever new data is available, the root svg document is available as 'svgnode',\n and elements you've mapped using the SVG Mapping tools below are available as properties on the 'svgmap' object.\n The Grafana DataFrame is provided as 'data' and the 'options' object can be used to pass values and references between\n the Render context and the Init context",id:"eventSource",defaultValue:yi.eventSource,editor:function(t){var e=Ci.config.theme.name;return c.a.createElement(vi,{language:"javascript",theme:"Grafana Light"===e?"vs-light":"vs-dark",value:t.value,onChange:t.onChange})}}).addBooleanSwitch({category:["User JS Init"],path:"initAutoComplete",name:"Enable Init JS AutoComplete",description:"Enable editor autocompletion, optional as it can be buggy on large documents",defaultValue:!0}).addCustomEditor({category:["User JS Init"],path:"initSource",name:"User JS Init Code",description:"The User JS Init code is executed once when the panel loads, you can use this to define helper functions that\n you later reference in the User JS Render code section. The sections have identical execution contexts, and any\n JS objects you want to reference between them will need to be attached to the options object as properties",id:"initSource",defaultValue:yi.initSource,editor:function(t){var e=Ci.config.theme.name;return c.a.createElement(vi,{language:"javascript",theme:"Grafana Light"===e?"vs-light":"vs-dark",value:t.value,onChange:t.onChange})}}).addBooleanSwitch({category:["SVG Mapping"],path:"addAllIDs",name:"Add all SVG Element IDs",description:"Parse the SVG Document for Elements with IDs assigned and automatically add them to the mapping list",defaultValue:!1}).addBooleanSwitch({category:["SVG Mapping"],path:"captureMappings",name:"Enable SVG Mapping on Click",description:"When activated, clicking an element in the panel will attempt to map the clicked element or its nearest parent element with an ID assigned",defaultValue:!1}).addCustomEditor({category:["SVG Mapping"],id:"svgMappings",path:"svgMappings",name:"SVG Mappings",description:'The SVG ID should match an element in the SVG document with an existing ID tag, the element will be attached to the "svgmap" object in the user code execution contexts as a property using the Mapped Name provided below',defaultValue:yi.svgMappings,editor:bi})}))}])})); +define(["react","@grafana/ui","emotion","@grafana/runtime","@grafana/data"],(function(t,e,n,i,r){return function(t){var e={};function n(i){if(e[i])return e[i].exports;var r=e[i]={i:i,l:!1,exports:{}};return t[i].call(r.exports,r,r.exports,n),r.l=!0,r.exports}return n.m=t,n.c=e,n.d=function(t,e,i){n.o(t,e)||Object.defineProperty(t,e,{enumerable:!0,get:i})},n.r=function(t){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})},n.t=function(t,e){if(1&e&&(t=n(t)),8&e)return t;if(4&e&&"object"==typeof t&&t&&t.__esModule)return t;var i=Object.create(null);if(n.r(i),Object.defineProperty(i,"default",{enumerable:!0,value:t}),2&e&&"string"!=typeof t)for(var r in t)n.d(i,r,function(e){return t[e]}.bind(null,r));return i},n.n=function(t){var e=t&&t.__esModule?function(){return t.default}:function(){return t};return n.d(e,"a",e),e},n.o=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},n.p="/",n(n.s=22)}([function(e,n){e.exports=t},function(t,e,n){t.exports=n(20)()},function(t,n){t.exports=e},function(t,e){t.exports=n},function(t,e){t.exports=i},function(t,e){t.exports=r},,,,,,,,,,,,,,,function(t,e,n){"use strict";var i=n(21);function r(){}function o(){}o.resetWarningCache=r,t.exports=function(){function t(t,e,n,r,o,s){if(s!==i){var a=new Error("Calling PropTypes validators directly is not supported by the `prop-types` package. Use PropTypes.checkPropTypes() to call them. Read more at http://fb.me/use-check-prop-types");throw a.name="Invariant Violation",a}}function e(){return t}t.isRequired=t;var n={array:t,bool:t,func:t,number:t,object:t,string:t,symbol:t,any:t,arrayOf:e,element:t,elementType:t,instanceOf:e,node:t,objectOf:e,oneOf:e,oneOfType:e,shape:e,exact:e,checkPropTypes:o,resetWarningCache:r};return n.PropTypes=n,n}},function(t,e,n){"use strict";t.exports="SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED"},function(t,e,n){"use strict";n.r(e);var i=n(5),r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(t,e)};function o(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Class extends value "+String(e)+" is not a constructor or null");function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}var s=function(){return(s=Object.assign||function(t){for(var e,n=1,i=arguments.length;n0)&&!(i=o.next()).done;)s.push(i.value)}catch(t){r={error:t}}finally{try{i&&!i.done&&(n=o.return)&&n.call(o)}finally{if(r)throw r.error}}return s}function l(t,e,n){if(n||2===arguments.length)for(var i,r=0,o=e.length;r=0;i--)for(n in e)t[i].prototype[n]=e[n]}function H(t){return function(...e){const n=e[e.length-1];return!n||n.constructor!==Object||n instanceof Array?t.apply(this,e):t.apply(this,e.slice(0,-1)).attr(n)}}f("Dom",{siblings:function(){return this.parent().children()},position:function(){return this.parent().index(this)},next:function(){return this.siblings()[this.position()+1]},prev:function(){return this.siblings()[this.position()-1]},forward:function(){const t=this.position();return this.parent().add(this.remove(),t+1),this},backward:function(){const t=this.position();return this.parent().add(this.remove(),t?t-1:0),this},front:function(){return this.parent().add(this.remove()),this},back:function(){return this.parent().add(this.remove(),0),this},before:function(t){(t=L(t)).remove();const e=this.position();return this.parent().add(t,e),this},after:function(t){(t=L(t)).remove();const e=this.position();return this.parent().add(t,e+1),this},insertBefore:function(t){return(t=L(t)).before(this),this},insertAfter:function(t){return(t=L(t)).after(this),this}});const U=/^([+-]?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?)([a-z%]*)$/i,X=/^#?([a-f\d]{2})([a-f\d]{2})([a-f\d]{2})$/i,Y=/rgb\((\d+),(\d+),(\d+)\)/,K=/(#[a-z_][a-z0-9\-_]*)/i,Z=/\)\s*,?\s*/,W=/\s/g,q=/^#[a-f0-9]{3}$|^#[a-f0-9]{6}$/i,Q=/^rgb\(/,J=/^(\s+)?$/,$=/^[+-]?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,tt=/\.(jpg|jpeg|png|gif|svg)(\?[^=]+.*)?/i,et=/[\s,]+/,nt=/[MLHVCSQTAZ]/i;function it(t){const e=Math.round(t),n=Math.max(0,Math.min(255,e)).toString(16);return 1===n.length?"0"+n:n}function rt(t,e){for(let n=e.length;n--;)if(null==t[e[n]])return!1;return!0}function ot(t,e,n){return n<0&&(n+=1),n>1&&(n-=1),n<1/6?t+6*(e-t)*n:n<.5?e:n<2/3?t+(e-t)*(2/3-n)*6:t}f("Dom",{classes:function(){const t=this.attr("class");return null==t?[]:t.trim().split(et)},hasClass:function(t){return-1!==this.classes().indexOf(t)},addClass:function(t){if(!this.hasClass(t)){const e=this.classes();e.push(t),this.attr("class",e.join(" "))}return this},removeClass:function(t){return this.hasClass(t)&&this.attr("class",this.classes().filter((function(e){return e!==t})).join(" ")),this},toggleClass:function(t){return this.hasClass(t)?this.removeClass(t):this.addClass(t)}}),f("Dom",{css:function(t,e){const n={};if(0===arguments.length)return this.node.style.cssText.split(/\s*;\s*/).filter((function(t){return!!t.length})).forEach((function(t){const e=t.split(/\s*:\s*/);n[e[0]]=e[1]})),n;if(arguments.length<2){if(Array.isArray(t)){for(const e of t){const t=_(e);n[t]=this.node.style[t]}return n}if("string"==typeof t)return this.node.style[_(t)];if("object"==typeof t)for(const e in t)this.node.style[_(e)]=null==t[e]||J.test(t[e])?"":t[e]}return 2===arguments.length&&(this.node.style[_(t)]=null==e||J.test(e)?"":e),this},show:function(){return this.css("display","")},hide:function(){return this.css("display","none")},visible:function(){return"none"!==this.css("display")}}),f("Dom",{data:function(t,e,n){if(null==t)return this.data(m(v(this.node.attributes,t=>0===t.nodeName.indexOf("data-")),t=>t.nodeName.slice(5)));if(t instanceof Array){const e={};for(const n of t)e[n]=this.data(n);return e}if("object"==typeof t)for(e in t)this.data(e,t[e]);else if(arguments.length<2)try{return JSON.parse(this.attr("data-"+t))}catch(e){return this.attr("data-"+t)}else this.attr("data-"+t,null===e?null:!0===n||"string"==typeof e||"number"==typeof e?e:JSON.stringify(e));return this}}),f("Dom",{remember:function(t,e){if("object"==typeof arguments[0])for(const e in t)this.remember(e,t[e]);else{if(1===arguments.length)return this.memory()[t];this.memory()[t]=e}return this},forget:function(){if(0===arguments.length)this._memory={};else for(let t=arguments.length-1;t>=0;t--)delete this.memory()[arguments[t]];return this},memory:function(){return this._memory=this._memory||{}}});class st{constructor(...t){this.init(...t)}static isColor(t){return t&&(t instanceof st||this.isRgb(t)||this.test(t))}static isRgb(t){return t&&"number"==typeof t.r&&"number"==typeof t.g&&"number"==typeof t.b}static random(t="vibrant",e,n){const{random:i,round:r,sin:o,PI:s}=Math;if("vibrant"===t){const t=24*i()+57,e=38*i()+45,n=360*i();return new st(t,e,n,"lch")}if("sine"===t){const t=r(80*o(2*s*(e=null==e?i():e)/.5+.01)+150),n=r(50*o(2*s*e/.5+4.6)+200),a=r(100*o(2*s*e/.5+2.3)+150);return new st(t,n,a)}if("pastel"===t){const t=8*i()+86,e=17*i()+9,n=360*i();return new st(t,e,n,"lch")}if("dark"===t){const t=10+10*i(),e=50*i()+86,n=360*i();return new st(t,e,n,"lch")}if("rgb"===t){const t=255*i(),e=255*i(),n=255*i();return new st(t,e,n)}if("lab"===t){const t=100*i(),e=256*i()-128,n=256*i()-128;return new st(t,e,n,"lab")}if("grey"===t){const t=255*i();return new st(t,t,t)}throw new Error("Unsupported random color mode")}static test(t){return"string"==typeof t&&(q.test(t)||Q.test(t))}cmyk(){const{_a:t,_b:e,_c:n}=this.rgb(),[i,r,o]=[t,e,n].map(t=>t/255),s=Math.min(1-i,1-r,1-o);if(1===s)return new st(0,0,0,1,"cmyk");return new st((1-i-s)/(1-s),(1-r-s)/(1-s),(1-o-s)/(1-s),s,"cmyk")}hsl(){const{_a:t,_b:e,_c:n}=this.rgb(),[i,r,o]=[t,e,n].map(t=>t/255),s=Math.max(i,r,o),a=Math.min(i,r,o),l=(s+a)/2,u=s===a,h=s-a;return new st(360*(u?0:s===i?((r-o)/h+(r.5?h/(2-s-a):h/(s+a)),100*l,"hsl")}init(t=0,e=0,n=0,i=0,r="rgb"){if(t=t||0,this.space)for(const t in this.space)delete this[this.space[t]];if("number"==typeof t)r="string"==typeof i?i:r,i="string"==typeof i?0:i,Object.assign(this,{_a:t,_b:e,_c:n,_d:i,space:r});else if(t instanceof Array)this.space=e||("string"==typeof t[3]?t[3]:t[4])||"rgb",Object.assign(this,{_a:t[0],_b:t[1],_c:t[2],_d:t[3]||0});else if(t instanceof Object){const n=function(t,e){const n=rt(t,"rgb")?{_a:t.r,_b:t.g,_c:t.b,_d:0,space:"rgb"}:rt(t,"xyz")?{_a:t.x,_b:t.y,_c:t.z,_d:0,space:"xyz"}:rt(t,"hsl")?{_a:t.h,_b:t.s,_c:t.l,_d:0,space:"hsl"}:rt(t,"lab")?{_a:t.l,_b:t.a,_c:t.b,_d:0,space:"lab"}:rt(t,"lch")?{_a:t.l,_b:t.c,_c:t.h,_d:0,space:"lch"}:rt(t,"cmyk")?{_a:t.c,_b:t.m,_c:t.y,_d:t.k,space:"cmyk"}:{_a:0,_b:0,_c:0,space:"rgb"};return n.space=e||n.space,n}(t,e);Object.assign(this,n)}else if("string"==typeof t)if(Q.test(t)){const e=t.replace(W,""),[n,i,r]=Y.exec(e).slice(1,4).map(t=>parseInt(t));Object.assign(this,{_a:n,_b:i,_c:r,_d:0,space:"rgb"})}else{if(!q.test(t))throw Error("Unsupported string format, can't construct Color");{const e=t=>parseInt(t,16),[,n,i,r]=X.exec(function(t){return 4===t.length?["#",t.substring(1,2),t.substring(1,2),t.substring(2,3),t.substring(2,3),t.substring(3,4),t.substring(3,4)].join(""):t}(t)).map(e);Object.assign(this,{_a:n,_b:i,_c:r,_d:0,space:"rgb"})}}const{_a:o,_b:s,_c:a,_d:l}=this,u="rgb"===this.space?{r:o,g:s,b:a}:"xyz"===this.space?{x:o,y:s,z:a}:"hsl"===this.space?{h:o,s:s,l:a}:"lab"===this.space?{l:o,a:s,b:a}:"lch"===this.space?{l:o,c:s,h:a}:"cmyk"===this.space?{c:o,m:s,y:a,k:l}:{};Object.assign(this,u)}lab(){const{x:t,y:e,z:n}=this.xyz();return new st(116*e-16,500*(t-e),200*(e-n),"lab")}lch(){const{l:t,a:e,b:n}=this.lab(),i=Math.sqrt(e**2+n**2);let r=180*Math.atan2(n,e)/Math.PI;r<0&&(r*=-1,r=360-r);return new st(t,i,r,"lch")}rgb(){if("rgb"===this.space)return this;if("lab"===(t=this.space)||"xyz"===t||"lch"===t){let{x:t,y:e,z:n}=this;if("lab"===this.space||"lch"===this.space){let{l:i,a:r,b:o}=this;if("lch"===this.space){const{c:t,h:e}=this,n=Math.PI/180;r=t*Math.cos(n*e),o=t*Math.sin(n*e)}const s=(i+16)/116,a=r/500+s,l=s-o/200,u=16/116,h=.008856,c=7.787;t=.95047*(a**3>h?a**3:(a-u)/c),e=1*(s**3>h?s**3:(s-u)/c),n=1.08883*(l**3>h?l**3:(l-u)/c)}const i=3.2406*t+-1.5372*e+-.4986*n,r=-.9689*t+1.8758*e+.0415*n,o=.0557*t+-.204*e+1.057*n,s=Math.pow,a=.0031308,l=i>a?1.055*s(i,1/2.4)-.055:12.92*i,u=r>a?1.055*s(r,1/2.4)-.055:12.92*r,h=o>a?1.055*s(o,1/2.4)-.055:12.92*o;return new st(255*l,255*u,255*h)}if("hsl"===this.space){let{h:t,s:e,l:n}=this;if(t/=360,e/=100,n/=100,0===e){n*=255;return new st(n,n,n)}const i=n<.5?n*(1+e):n+e-n*e,r=2*n-i,o=255*ot(r,i,t+1/3),s=255*ot(r,i,t),a=255*ot(r,i,t-1/3);return new st(o,s,a)}if("cmyk"===this.space){const{c:t,m:e,y:n,k:i}=this,r=255*(1-Math.min(1,t*(1-i)+i)),o=255*(1-Math.min(1,e*(1-i)+i)),s=255*(1-Math.min(1,n*(1-i)+i));return new st(r,o,s)}return this;var t}toArray(){const{_a:t,_b:e,_c:n,_d:i,space:r}=this;return[t,e,n,i,r]}toHex(){const[t,e,n]=this._clamped().map(it);return`#${t}${e}${n}`}toRgb(){const[t,e,n]=this._clamped();return`rgb(${t},${e},${n})`}toString(){return this.toHex()}xyz(){const{_a:t,_b:e,_c:n}=this.rgb(),[i,r,o]=[t,e,n].map(t=>t/255),s=i>.04045?Math.pow((i+.055)/1.055,2.4):i/12.92,a=r>.04045?Math.pow((r+.055)/1.055,2.4):r/12.92,l=o>.04045?Math.pow((o+.055)/1.055,2.4):o/12.92,u=(.4124*s+.3576*a+.1805*l)/.95047,h=(.2126*s+.7152*a+.0722*l)/1,c=(.0193*s+.1192*a+.9505*l)/1.08883,p=u>.008856?Math.pow(u,1/3):7.787*u+16/116,d=h>.008856?Math.pow(h,1/3):7.787*h+16/116,f=c>.008856?Math.pow(c,1/3):7.787*c+16/116;return new st(p,d,f,"xyz")}_clamped(){const{_a:t,_b:e,_c:n}=this.rgb(),{max:i,min:r,round:o}=Math;return[t,e,n].map(t=>i(0,r(o(t),255)))}}class at{constructor(...t){this.init(...t)}clone(){return new at(this)}init(t,e){const n=0,i=0,r=Array.isArray(t)?{x:t[0],y:t[1]}:"object"==typeof t?{x:t.x,y:t.y}:{x:t,y:e};return this.x=null==r.x?n:r.x,this.y=null==r.y?i:r.y,this}toArray(){return[this.x,this.y]}transform(t){return this.clone().transformO(t)}transformO(t){ut.isMatrixLike(t)||(t=new ut(t));const{x:e,y:n}=this;return this.x=t.a*e+t.c*n+t.e,this.y=t.b*e+t.d*n+t.f,this}}function lt(t,e,n){return Math.abs(e-t)<(n||1e-6)}class ut{constructor(...t){this.init(...t)}static formatTransforms(t){const e="both"===t.flip||!0===t.flip,n=t.flip&&(e||"x"===t.flip)?-1:1,i=t.flip&&(e||"y"===t.flip)?-1:1,r=t.skew&&t.skew.length?t.skew[0]:isFinite(t.skew)?t.skew:isFinite(t.skewX)?t.skewX:0,o=t.skew&&t.skew.length?t.skew[1]:isFinite(t.skew)?t.skew:isFinite(t.skewY)?t.skewY:0,s=t.scale&&t.scale.length?t.scale[0]*n:isFinite(t.scale)?t.scale*n:isFinite(t.scaleX)?t.scaleX*n:n,a=t.scale&&t.scale.length?t.scale[1]*i:isFinite(t.scale)?t.scale*i:isFinite(t.scaleY)?t.scaleY*i:i,l=t.shear||0,u=t.rotate||t.theta||0,h=new at(t.origin||t.around||t.ox||t.originX,t.oy||t.originY),c=h.x,p=h.y,d=new at(t.position||t.px||t.positionX||NaN,t.py||t.positionY||NaN),f=d.x,g=d.y,y=new at(t.translate||t.tx||t.translateX,t.ty||t.translateY),m=y.x,v=y.y,A=new at(t.relative||t.rx||t.relativeX,t.ry||t.relativeY);return{scaleX:s,scaleY:a,skewX:r,skewY:o,shear:l,theta:u,rx:A.x,ry:A.y,tx:m,ty:v,ox:c,oy:p,px:f,py:g}}static fromArray(t){return{a:t[0],b:t[1],c:t[2],d:t[3],e:t[4],f:t[5]}}static isMatrixLike(t){return null!=t.a||null!=t.b||null!=t.c||null!=t.d||null!=t.e||null!=t.f}static matrixMultiply(t,e,n){const i=t.a*e.a+t.c*e.b,r=t.b*e.a+t.d*e.b,o=t.a*e.c+t.c*e.d,s=t.b*e.c+t.d*e.d,a=t.e+t.a*e.e+t.c*e.f,l=t.f+t.b*e.e+t.d*e.f;return n.a=i,n.b=r,n.c=o,n.d=s,n.e=a,n.f=l,n}around(t,e,n){return this.clone().aroundO(t,e,n)}aroundO(t,e,n){const i=t||0,r=e||0;return this.translateO(-i,-r).lmultiplyO(n).translateO(i,r)}clone(){return new ut(this)}decompose(t=0,e=0){const n=this.a,i=this.b,r=this.c,o=this.d,s=this.e,a=this.f,l=n*o-i*r,u=l>0?1:-1,h=u*Math.sqrt(n*n+i*i),c=Math.atan2(u*i,u*n),p=180/Math.PI*c,d=Math.cos(c),f=Math.sin(c),g=(n*r+i*o)/l,y=r*h/(g*n-i)||o*h/(g*i+n);return{scaleX:h,scaleY:y,shear:g,rotate:p,translateX:s-t+t*d*h+e*(g*d*h-f*y),translateY:a-e+t*f*h+e*(g*f*h+d*y),originX:t,originY:e,a:this.a,b:this.b,c:this.c,d:this.d,e:this.e,f:this.f}}equals(t){if(t===this)return!0;const e=new ut(t);return lt(this.a,e.a)&<(this.b,e.b)&<(this.c,e.c)&<(this.d,e.d)&<(this.e,e.e)&<(this.f,e.f)}flip(t,e){return this.clone().flipO(t,e)}flipO(t,e){return"x"===t?this.scaleO(-1,1,e,0):"y"===t?this.scaleO(1,-1,0,e):this.scaleO(-1,-1,t,e||t)}init(t){const e=ut.fromArray([1,0,0,1,0,0]);return t=t instanceof Rt?t.matrixify():"string"==typeof t?ut.fromArray(t.split(et).map(parseFloat)):Array.isArray(t)?ut.fromArray(t):"object"==typeof t&&ut.isMatrixLike(t)?t:"object"==typeof t?(new ut).transform(t):6===arguments.length?ut.fromArray([].slice.call(arguments)):e,this.a=null!=t.a?t.a:e.a,this.b=null!=t.b?t.b:e.b,this.c=null!=t.c?t.c:e.c,this.d=null!=t.d?t.d:e.d,this.e=null!=t.e?t.e:e.e,this.f=null!=t.f?t.f:e.f,this}inverse(){return this.clone().inverseO()}inverseO(){const t=this.a,e=this.b,n=this.c,i=this.d,r=this.e,o=this.f,s=t*i-e*n;if(!s)throw new Error("Cannot invert "+this);const a=i/s,l=-e/s,u=-n/s,h=t/s,c=-(a*r+u*o),p=-(l*r+h*o);return this.a=a,this.b=l,this.c=u,this.d=h,this.e=c,this.f=p,this}lmultiply(t){return this.clone().lmultiplyO(t)}lmultiplyO(t){const e=t instanceof ut?t:new ut(t);return ut.matrixMultiply(e,this,this)}multiply(t){return this.clone().multiplyO(t)}multiplyO(t){const e=t instanceof ut?t:new ut(t);return ut.matrixMultiply(this,e,this)}rotate(t,e,n){return this.clone().rotateO(t,e,n)}rotateO(t,e=0,n=0){t=A(t);const i=Math.cos(t),r=Math.sin(t),{a:o,b:s,c:a,d:l,e:u,f:h}=this;return this.a=o*i-s*r,this.b=s*i+o*r,this.c=a*i-l*r,this.d=l*i+a*r,this.e=u*i-h*r+n*r-e*i+e,this.f=h*i+u*r-e*r-n*i+n,this}scale(t,e,n,i){return this.clone().scaleO(...arguments)}scaleO(t,e=t,n=0,i=0){3===arguments.length&&(i=n,n=e,e=t);const{a:r,b:o,c:s,d:a,e:l,f:u}=this;return this.a=r*t,this.b=o*e,this.c=s*t,this.d=a*e,this.e=l*t-n*t+n,this.f=u*e-i*e+i,this}shear(t,e,n){return this.clone().shearO(t,e,n)}shearO(t,e=0,n=0){const{a:i,b:r,c:o,d:s,e:a,f:l}=this;return this.a=i+r*t,this.c=o+s*t,this.e=a+l*t-n*t,this}skew(t,e,n,i){return this.clone().skewO(...arguments)}skewO(t,e=t,n=0,i=0){3===arguments.length&&(i=n,n=e,e=t),t=A(t),e=A(e);const r=Math.tan(t),o=Math.tan(e),{a:s,b:a,c:l,d:u,e:h,f:c}=this;return this.a=s+a*r,this.b=a+s*o,this.c=l+u*r,this.d=u+l*o,this.e=h+c*r-i*r,this.f=c+h*o-n*o,this}skewX(t,e,n){return this.skew(t,0,e,n)}skewY(t,e,n){return this.skew(0,t,e,n)}toArray(){return[this.a,this.b,this.c,this.d,this.e,this.f]}toString(){return"matrix("+this.a+","+this.b+","+this.c+","+this.d+","+this.e+","+this.f+")"}transform(t){if(ut.isMatrixLike(t)){return new ut(t).multiplyO(this)}const e=ut.formatTransforms(t),{x:n,y:i}=new at(e.ox,e.oy).transform(this),r=(new ut).translateO(e.rx,e.ry).lmultiplyO(this).translateO(-n,-i).scaleO(e.scaleX,e.scaleY).skewO(e.skewX,e.skewY).shearO(e.shear).rotateO(e.theta).translateO(n,i);if(isFinite(e.px)||isFinite(e.py)){const t=new at(n,i).transform(r),o=isFinite(e.px)?e.px-t.x:0,s=isFinite(e.py)?e.py-t.y:0;r.translateO(o,s)}return r.translateO(e.tx,e.ty),r}translate(t,e){return this.clone().translateO(t,e)}translateO(t,e){return this.e+=t||0,this.f+=e||0,this}valueOf(){return{a:this.a,b:this.b,c:this.c,d:this.d,e:this.e,f:this.f}}}function ht(){if(!ht.nodes){const t=L().size(2,0);t.node.style.cssText=["opacity: 0","position: absolute","left: -100%","top: -100%","overflow: hidden"].join(";"),t.attr("focusable","false"),t.attr("aria-hidden","true");const e=t.path().node;ht.nodes={svg:t,path:e}}if(!ht.nodes.svg.node.parentNode){const t=S.document.body||S.document.documentElement;ht.nodes.svg.addTo(t)}return ht.nodes}function ct(t){return!(t.width||t.height||t.x||t.y)}N(ut,"Matrix");class pt{constructor(...t){this.init(...t)}addOffset(){return this.x+=S.window.pageXOffset,this.y+=S.window.pageYOffset,new pt(this)}init(t){return t="string"==typeof t?t.split(et).map(parseFloat):Array.isArray(t)?t:"object"==typeof t?[null!=t.left?t.left:t.x,null!=t.top?t.top:t.y,t.width,t.height]:4===arguments.length?[].slice.call(arguments):[0,0,0,0],this.x=t[0]||0,this.y=t[1]||0,this.width=this.w=t[2]||0,this.height=this.h=t[3]||0,this.x2=this.x+this.w,this.y2=this.y+this.h,this.cx=this.x+this.w/2,this.cy=this.y+this.h/2,this}isNulled(){return ct(this)}merge(t){const e=Math.min(this.x,t.x),n=Math.min(this.y,t.y),i=Math.max(this.x+this.width,t.x+t.width)-e,r=Math.max(this.y+this.height,t.y+t.height)-n;return new pt(e,n,i,r)}toArray(){return[this.x,this.y,this.width,this.height]}toString(){return this.x+" "+this.y+" "+this.width+" "+this.height}transform(t){t instanceof ut||(t=new ut(t));let e=1/0,n=-1/0,i=1/0,r=-1/0;return[new at(this.x,this.y),new at(this.x2,this.y),new at(this.x,this.y2),new at(this.x2,this.y2)].forEach((function(o){o=o.transform(t),e=Math.min(e,o.x),n=Math.max(n,o.x),i=Math.min(i,o.y),r=Math.max(r,o.y)})),new pt(e,i,n-e,r-i)}}function dt(t,e,n){let i;try{if(i=e(t.node),ct(i)&&((r=t.node)!==S.document&&!(S.document.documentElement.contains||function(t){for(;t.parentNode;)t=t.parentNode;return t===S.document}).call(S.document.documentElement,r)))throw new Error("Element not in the dom")}catch(e){i=n(t)}var r;return i}f({viewbox:{viewbox(t,e,n,i){return null==t?new pt(this.attr("viewBox")):this.attr("viewBox",new pt(t,e,n,i))},zoom(t,e){let{width:n,height:i}=this.attr(["width","height"]);if((n||i)&&"string"!=typeof n&&"string"!=typeof i||(n=this.node.clientWidth,i=this.node.clientHeight),!n||!i)throw new Error("Impossible to get absolute width and height. Please provide an absolute width and height attribute on the zooming element");const r=this.viewbox(),o=n/r.width,s=i/r.height,a=Math.min(o,s);if(null==t)return a;let l=a/t;l===1/0&&(l=Number.MAX_SAFE_INTEGER/100),e=e||new at(n/2/o+r.x,i/2/s+r.y);const u=new pt(r).transform(new ut({scale:l,origin:e}));return this.viewbox(u)}}}),N(pt,"Box");class ft extends Array{constructor(t=[],...e){if(super(t,...e),"number"==typeof t)return this;this.length=0,this.push(...t)}}V([ft],{each(t,...e){return"function"==typeof t?this.map((e,n,i)=>t.call(e,e,n,i)):this.map(n=>n[t](...e))},toArray(){return Array.prototype.concat.apply([],this)}});const gt=["toArray","constructor","each"];function yt(t,e){return new ft(m((e||S.document).querySelectorAll(t),(function(t){return k(t)})))}ft.extend=function(t){t=t.reduce((t,e)=>(gt.includes(e)||"_"===e[0]||(t[e]=function(...t){return this.each(e,...t)}),t),{}),V([ft],t)};let mt=0;const vt={};function At(t){let e=t.getEventHolder();return e===S.window&&(e=vt),e.events||(e.events={}),e.events}function _t(t){return t.getEventTarget()}function Ct(t,e,n,i,r){const o=n.bind(i||t),s=L(t),a=At(s),l=_t(s);e=Array.isArray(e)?e:e.split(et),n._svgjsListenerId||(n._svgjsListenerId=++mt),e.forEach((function(t){const e=t.split(".")[0],i=t.split(".")[1]||"*";a[e]=a[e]||{},a[e][i]=a[e][i]||{},a[e][i][n._svgjsListenerId]=o,l.addEventListener(e,o,r||!1)}))}function wt(t,e,n,i){const r=L(t),o=At(r),s=_t(r);("function"!=typeof n||(n=n._svgjsListenerId))&&(e=Array.isArray(e)?e:(e||"").split(et)).forEach((function(t){const e=t&&t.split(".")[0],a=t&&t.split(".")[1];let l,u;if(n)o[e]&&o[e][a||"*"]&&(s.removeEventListener(e,o[e][a||"*"][n],i||!1),delete o[e][a||"*"][n]);else if(e&&a){if(o[e]&&o[e][a]){for(u in o[e][a])wt(s,[e,a].join("."),u);delete o[e][a]}}else if(a)for(t in o)for(l in o[t])a===l&&wt(s,[t,a].join("."));else if(e){if(o[e]){for(l in o[e])wt(s,[e,l].join("."));delete o[e]}}else{for(t in o)wt(s,t);!function(t){let e=t.getEventHolder();e===S.window&&(e=vt),e.events&&(e.events={})}(r)}}))}class xt extends R{addEventListener(){}dispatch(t,e,n){return function(t,e,n,i){const r=_t(t);return e instanceof S.window.Event||(e=new S.window.CustomEvent(e,{detail:n,cancelable:!0,...i})),r.dispatchEvent(e),e}(this,t,e,n)}dispatchEvent(t){const e=this.getEventHolder().events;if(!e)return!0;const n=e[t.type];for(const e in n)for(const i in n[e])n[e][i](t);return!t.defaultPrevented}fire(t,e,n){return this.dispatch(t,e,n),this}getEventHolder(){return this}getEventTarget(){return this}off(t,e){return wt(this,t,e),this}on(t,e,n,i){return Ct(this,t,e,n,i),this}removeEventListener(){}}function bt(){}N(xt,"EventTarget");const Et={duration:400,ease:">",delay:0},Mt={"fill-opacity":1,"stroke-opacity":1,"stroke-width":0,"stroke-linejoin":"miter","stroke-linecap":"butt",fill:"#000000",stroke:"#000000",opacity:1,x:0,y:0,cx:0,cy:0,width:0,height:0,r:0,rx:0,ry:0,offset:0,"stop-opacity":1,"stop-color":"#000000","text-anchor":"start"};class Ot extends Array{constructor(...t){super(...t),this.init(...t)}clone(){return new this.constructor(this)}init(t){return"number"==typeof t||(this.length=0,this.push(...this.parse(t))),this}parse(t=[]){return t instanceof Array?t:t.trim().split(et).map(parseFloat)}toArray(){return Array.prototype.concat.apply([],this)}toSet(){return new Set(this)}toString(){return this.join(" ")}valueOf(){const t=[];return t.push(...this),t}}class Tt{constructor(...t){this.init(...t)}convert(t){return new Tt(this.value,t)}divide(t){return t=new Tt(t),new Tt(this/t,this.unit||t.unit)}init(t,e){return e=Array.isArray(t)?t[1]:e,t=Array.isArray(t)?t[0]:t,this.value=0,this.unit=e||"","number"==typeof t?this.value=isNaN(t)?0:isFinite(t)?t:t<0?-34e37:34e37:"string"==typeof t?(e=t.match(U))&&(this.value=parseFloat(e[1]),"%"===e[5]?this.value/=100:"s"===e[5]&&(this.value*=1e3),this.unit=e[5]):t instanceof Tt&&(this.value=t.valueOf(),this.unit=t.unit),this}minus(t){return t=new Tt(t),new Tt(this-t,this.unit||t.unit)}plus(t){return t=new Tt(t),new Tt(this+t,this.unit||t.unit)}times(t){return t=new Tt(t),new Tt(this*t,this.unit||t.unit)}toArray(){return[this.value,this.unit]}toJSON(){return this.toString()}toString(){return("%"===this.unit?~~(1e8*this.value)/1e6:"s"===this.unit?this.value/1e3:this.value)+this.unit}valueOf(){return this.value}}const Pt=[];class St extends xt{constructor(t,e){super(),this.node=t,this.type=t.nodeName,e&&t!==e&&this.attr(e)}add(t,e){return(t=L(t)).removeNamespace&&this.node instanceof S.window.SVGElement&&t.removeNamespace(),null==e?this.node.appendChild(t.node):t.node!==this.node.childNodes[e]&&this.node.insertBefore(t.node,this.node.childNodes[e]),this}addTo(t,e){return L(t).put(this,e)}children(){return new ft(m(this.node.children,(function(t){return k(t)})))}clear(){for(;this.node.hasChildNodes();)this.node.removeChild(this.node.lastChild);return this}clone(t=!0){return this.writeDataToDom(),new this.constructor(function t(e){for(let n=e.children.length-1;n>=0;n--)t(e.children[n]);return e.id?(e.id=G(e.nodeName),e):e}(this.node.cloneNode(t)))}each(t,e){const n=this.children();let i,r;for(i=0,r=n.length;i=0}html(t,e){return this.xml(t,e,M)}id(t){return void 0!==t||this.node.id||(this.node.id=G(this.type)),this.attr("id",t)}index(t){return[].slice.call(this.node.childNodes).indexOf(t.node)}last(){return k(this.node.lastChild)}matches(t){const e=this.node,n=e.matches||e.matchesSelector||e.msMatchesSelector||e.mozMatchesSelector||e.webkitMatchesSelector||e.oMatchesSelector||null;return n&&n.call(e,t)}parent(t){let e=this;if(!e.node.parentNode)return null;if(e=k(e.node.parentNode),!t)return e;do{if("string"==typeof t?e.matches(t):e instanceof t)return e}while(e=k(e.node.parentNode));return e}put(t,e){return t=L(t),this.add(t,e),t}putIn(t,e){return L(t).add(this,e)}remove(){return this.parent()&&this.parent().removeElement(this),this}removeElement(t){return this.node.removeChild(t.node),this}replace(t){return t=L(t),this.node.parentNode&&this.node.parentNode.replaceChild(t.node,this.node),t}round(t=2,e=null){const n=10**t,i=this.attr(e);for(const t in i)"number"==typeof i[t]&&(i[t]=Math.round(i[t]*n)/n);return this.attr(i),this}svg(t,e){return this.xml(t,e,E)}toString(){return this.id()}words(t){return this.node.textContent=t,this}wrap(t){const e=this.parent();if(!e)return this.addTo(t);const n=e.index(this);return e.put(t,n).put(this)}writeDataToDom(){return this.each((function(){this.writeDataToDom()})),this}xml(t,e,n){if("boolean"==typeof t&&(n=e,e=t,t=null),null==t||"function"==typeof t){e=null==e||e,this.writeDataToDom();let n=this;if(null!=t){if(n=k(n.node.cloneNode(!0)),e){const e=t(n);if(n=e||n,!1===e)return""}n.each((function(){const e=t(this),n=e||this;!1===e?this.remove():e&&this!==n&&this.replace(n)}),!0)}return e?n.node.outerHTML:n.node.innerHTML}e=null!=e&&e;const i=D("wrapper",n),r=S.document.createDocumentFragment();i.innerHTML=t;for(let t=i.children.length;t--;)r.appendChild(i.firstElementChild);const o=this.parent();return e?this.replace(r)&&o:this.add(r)}}V(St,{attr:function(t,e,n){if(null==t){t={},e=this.node.attributes;for(const n of e)t[n.nodeName]=$.test(n.nodeValue)?parseFloat(n.nodeValue):n.nodeValue;return t}if(t instanceof Array)return t.reduce((t,e)=>(t[e]=this.attr(e),t),{});if("object"==typeof t&&t.constructor===Object)for(e in t)this.attr(e,t[e]);else if(null===e)this.node.removeAttribute(t);else{if(null==e)return null==(e=this.node.getAttribute(t))?Mt[t]:$.test(e)?parseFloat(e):e;"number"==typeof(e=Pt.reduce((e,n)=>n(t,e,this),e))?e=new Tt(e):st.isColor(e)?e=new st(e):e.constructor===Array&&(e=new Ot(e)),"leading"===t?this.leading&&this.leading(e):"string"==typeof n?this.node.setAttributeNS(n,t,e.toString()):this.node.setAttribute(t,e.toString()),!this.rebuild||"font-size"!==t&&"x"!==t||this.rebuild()}return this},find:function(t){return yt(t,this.node)},findOne:function(t){return k(this.node.querySelector(t))}}),N(St,"Dom");class Rt extends St{constructor(t,e){super(t,e),this.dom={},this.node.instance=this,t.hasAttribute("svgjs:data")&&this.setData(JSON.parse(t.getAttribute("svgjs:data"))||{})}center(t,e){return this.cx(t).cy(e)}cx(t){return null==t?this.x()+this.width()/2:this.x(t-this.width()/2)}cy(t){return null==t?this.y()+this.height()/2:this.y(t-this.height()/2)}defs(){const t=this.root();return t&&t.defs()}dmove(t,e){return this.dx(t).dy(e)}dx(t=0){return this.x(new Tt(t).plus(this.x()))}dy(t=0){return this.y(new Tt(t).plus(this.y()))}getEventHolder(){return this}height(t){return this.attr("height",t)}move(t,e){return this.x(t).y(e)}parents(t=this.root()){t=L(t);const e=new ft;let n=this;for(;(n=n.parent())&&n.node!==S.document&&"#document-fragment"!==n.nodeName&&(e.push(n),n.node!==t.node););return e}reference(t){if(!(t=this.attr(t)))return null;const e=(t+"").match(K);return e?L(e[1]):null}root(){const t=this.parent(j[z]);return t&&t.root()}setData(t){return this.dom=t,this}size(t,e){const n=x(this,t,e);return this.width(new Tt(n.width)).height(new Tt(n.height))}width(t){return this.attr("width",t)}writeDataToDom(){return this.node.removeAttribute("svgjs:data"),Object.keys(this.dom).length&&this.node.setAttribute("svgjs:data",JSON.stringify(this.dom)),super.writeDataToDom()}x(t){return this.attr("x",t)}y(t){return this.attr("y",t)}}V(Rt,{bbox:function(){const t=dt(this,t=>t.getBBox(),t=>{try{const e=t.clone().addTo(ht().svg).show(),n=e.node.getBBox();return e.remove(),n}catch(e){throw new Error(`Getting bbox of element "${t.node.nodeName}" is not possible: ${e.toString()}`)}});return new pt(t)},rbox:function(t){const e=dt(this,t=>t.getBoundingClientRect(),t=>{throw new Error(`Getting rbox of element "${t.node.nodeName}" is not possible`)}),n=new pt(e);return t?n.transform(t.screenCTM().inverseO()):n.addOffset()},inside:function(t,e){const n=this.bbox();return t>n.x&&e>n.y&&t=0;n--)null!=e[jt[t][n]]&&this.attr(jt.prefix(t,jt[t][n]),e[jt[t][n]]);return this},f(["Element","Runner"],e)})),f(["Element","Runner"],{matrix:function(t,e,n,i,r,o){return null==t?new ut(this):this.attr("transform",new ut(t,e,n,i,r,o))},rotate:function(t,e,n){return this.transform({rotate:t,ox:e,oy:n},!0)},skew:function(t,e,n,i){return 1===arguments.length||3===arguments.length?this.transform({skew:t,ox:e,oy:n},!0):this.transform({skew:[t,e],ox:n,oy:i},!0)},shear:function(t,e,n){return this.transform({shear:t,ox:e,oy:n},!0)},scale:function(t,e,n,i){return 1===arguments.length||3===arguments.length?this.transform({scale:t,ox:e,oy:n},!0):this.transform({scale:[t,e],ox:n,oy:i},!0)},translate:function(t,e){return this.transform({translate:[t,e]},!0)},relative:function(t,e){return this.transform({relative:[t,e]},!0)},flip:function(t="both",e="center"){return-1==="xybothtrue".indexOf(t)&&(e=t,t="both"),this.transform({flip:t,origin:e},!0)},opacity:function(t){return this.attr("opacity",t)}}),f("radius",{radius:function(t,e=t){return"radialGradient"===(this._element||this).type?this.attr("r",new Tt(t)):this.rx(t).ry(e)}}),f("Path",{length:function(){return this.node.getTotalLength()},pointAt:function(t){return new at(this.node.getPointAtLength(t))}}),f(["Element","Runner"],{font:function(t,e){if("object"==typeof t){for(e in t)this.font(e,t[e]);return this}return"leading"===t?this.leading(e):"anchor"===t?this.attr("text-anchor",e):"size"===t||"family"===t||"weight"===t||"stretch"===t||"variant"===t||"style"===t?this.attr("font-"+t,e):this.attr(t,e)}});f("Element",["click","dblclick","mousedown","mouseup","mouseover","mouseout","mousemove","mouseenter","mouseleave","touchstart","touchmove","touchleave","touchend","touchcancel"].reduce((function(t,e){return t[e]=function(t){return null===t?this.off(e):this.on(e,t),this},t}),{})),f("Element",{untransform:function(){return this.attr("transform",null)},matrixify:function(){return(this.attr("transform")||"").split(Z).slice(0,-1).map((function(t){const e=t.trim().split("(");return[e[0],e[1].split(et).map((function(t){return parseFloat(t)}))]})).reverse().reduce((function(t,e){return"matrix"===e[0]?t.lmultiply(ut.fromArray(e[1])):t[e[0]].apply(t,e[1])}),new ut)},toParent:function(t,e){if(this===t)return this;const n=this.screenCTM(),i=t.screenCTM().inverse();return this.addTo(t,e).untransform().transform(i.multiply(n)),this},toRoot:function(t){return this.toParent(this.root(),t)},transform:function(t,e){if(null==t||"string"==typeof t){const e=new ut(this).decompose();return null==t?e:e[t]}ut.isMatrixLike(t)||(t={...t,origin:b(t,this)});const n=new ut(!0===e?this:e||!1).transform(t);return this.attr("transform",n)}});class zt extends Rt{flatten(t=this,e){return this.each((function(){if(this instanceof zt)return this.flatten().ungroup()})),this}ungroup(t=this.parent(),e=t.index(this)){return e=-1===e?t.children().length:e,this.each((function(n,i){return i[i.length-n-1].toParent(t,e)})),this.remove()}}N(zt,"Container");class Dt extends zt{constructor(t,e=t){super(I("defs",t),e)}flatten(){return this}ungroup(){return this}}N(Dt,"Defs");class Lt extends Rt{}function It(t){return this.attr("rx",t)}function kt(t){return this.attr("ry",t)}function Ft(t){return null==t?this.cx()-this.rx():this.cx(t+this.rx())}function Nt(t){return null==t?this.cy()-this.ry():this.cy(t+this.ry())}function Bt(t){return this.attr("cx",t)}function Gt(t){return this.attr("cy",t)}function Vt(t){return null==t?2*this.rx():this.rx(new Tt(t).divide(2))}function Ht(t){return null==t?2*this.ry():this.ry(new Tt(t).divide(2))}N(Lt,"Shape");var Ut={__proto__:null,rx:It,ry:kt,x:Ft,y:Nt,cx:Bt,cy:Gt,width:Vt,height:Ht};class Xt extends Lt{constructor(t,e=t){super(I("ellipse",t),e)}size(t,e){const n=x(this,t,e);return this.rx(new Tt(n.width).divide(2)).ry(new Tt(n.height).divide(2))}}V(Xt,Ut),f("Container",{ellipse:H((function(t=0,e=t){return this.put(new Xt).size(t,e).move(0,0)}))}),N(Xt,"Ellipse");class Yt extends St{constructor(t=S.document.createDocumentFragment()){super(t)}xml(t,e,n){if("boolean"==typeof t&&(n=e,e=t,t=null),null==t||"function"==typeof t){const t=new St(D("wrapper",n));return t.add(this.node.cloneNode(!0)),t.xml(!1,n)}return super.xml(t,!1,n)}}function Kt(t,e){return"radialGradient"===(this._element||this).type?this.attr({fx:new Tt(t),fy:new Tt(e)}):this.attr({x1:new Tt(t),y1:new Tt(e)})}function Zt(t,e){return"radialGradient"===(this._element||this).type?this.attr({cx:new Tt(t),cy:new Tt(e)}):this.attr({x2:new Tt(t),y2:new Tt(e)})}N(Yt,"Fragment");var Wt,qt={__proto__:null,from:Kt,to:Zt};class Qt extends zt{constructor(t,e){super(I(t+"Gradient","string"==typeof t?null:t),e)}attr(t,e,n){return"transform"===t&&(t="gradientTransform"),super.attr(t,e,n)}bbox(){return new pt}targets(){return yt('svg [fill*="'+this.id()+'"]')}toString(){return this.url()}update(t){return this.clear(),"function"==typeof t&&t.call(this,this),this}url(){return'url("#'+this.id()+'")'}}V(Qt,qt),f({Container:{gradient(...t){return this.defs().gradient(...t)}},Defs:{gradient:H((function(t,e){return this.put(new Qt(t)).update(e)}))}}),N(Qt,"Gradient");class Jt extends zt{constructor(t,e=t){super(I("pattern",t),e)}attr(t,e,n){return"transform"===t&&(t="patternTransform"),super.attr(t,e,n)}bbox(){return new pt}targets(){return yt('svg [fill*="'+this.id()+'"]')}toString(){return this.url()}update(t){return this.clear(),"function"==typeof t&&t.call(this,this),this}url(){return'url("#'+this.id()+'")'}}f({Container:{pattern(...t){return this.defs().pattern(...t)}},Defs:{pattern:H((function(t,e,n){return this.put(new Jt).update(n).attr({x:0,y:0,width:t,height:e,patternUnits:"userSpaceOnUse"})}))}}),N(Jt,"Pattern");class $t extends Lt{constructor(t,e=t){super(I("image",t),e)}load(t,e){if(!t)return this;const n=new S.window.Image;return Ct(n,"load",(function(t){const i=this.parent(Jt);0===this.width()&&0===this.height()&&this.size(n.width,n.height),i instanceof Jt&&0===i.width()&&0===i.height()&&i.size(this.width(),this.height()),"function"==typeof e&&e.call(this,t)}),this),Ct(n,"load error",(function(){wt(n)})),this.attr("href",n.src=t,T)}}Wt=function(t,e,n){return"fill"!==t&&"stroke"!==t||tt.test(e)&&(e=n.root().defs().image(e)),e instanceof $t&&(e=n.root().defs().pattern(0,0,t=>{t.add(e)})),e},Pt.push(Wt),f({Container:{image:H((function(t,e){return this.put(new $t).size(0,0).load(t,e)}))}}),N($t,"Image");class te extends Ot{bbox(){let t=-1/0,e=-1/0,n=1/0,i=1/0;return this.forEach((function(r){t=Math.max(r[0],t),e=Math.max(r[1],e),n=Math.min(r[0],n),i=Math.min(r[1],i)})),new pt(n,i,t-n,e-i)}move(t,e){const n=this.bbox();if(t-=n.x,e-=n.y,!isNaN(t)&&!isNaN(e))for(let n=this.length-1;n>=0;n--)this[n]=[this[n][0]+t,this[n][1]+e];return this}parse(t=[0,0]){const e=[];(t=t instanceof Array?Array.prototype.concat.apply([],t):t.trim().split(et).map(parseFloat)).length%2!=0&&t.pop();for(let n=0,i=t.length;n=0;n--)i.width&&(this[n][0]=(this[n][0]-i.x)*t/i.width+i.x),i.height&&(this[n][1]=(this[n][1]-i.y)*e/i.height+i.y);return this}toLine(){return{x1:this[0][0],y1:this[0][1],x2:this[1][0],y2:this[1][1]}}toString(){const t=[];for(let e=0,n=this.length;e":function(t){return-Math.cos(t*Math.PI)/2+.5},">":function(t){return Math.sin(t*Math.PI/2)},"<":function(t){return 1-Math.cos(t*Math.PI/2)},bezier:function(t,e,n,i){return function(r){return r<0?t>0?e/t*r:n>0?i/n*r:0:r>1?n<1?(1-i)/(1-n)*r+(i-n)/(1-n):t<1?(1-e)/(1-t)*r+(e-t)/(1-t):1:3*r*(1-r)**2*e+3*r**2*(1-r)*i+r**3}},steps:function(t,e="end"){e=e.split("-").reverse()[0];let n=t;return"none"===e?--n:"both"===e&&++n,(i,r=!1)=>{let o=Math.floor(i*t);const s=i*o%1==0;return"start"!==e&&"both"!==e||++o,r&&s&&--o,i>=0&&o<0&&(o=0),i<=1&&o>n&&(o=n),o/n}}};class se{done(){return!1}}class ae extends se{constructor(t=Et.ease){super(),this.ease=oe[t]||t}step(t,e,n){return"number"!=typeof t?n<1?t:e:t+(e-t)*this.ease(n)}}class le extends se{constructor(t){super(),this.stepper=t}done(t){return t.done}step(t,e,n,i){return this.stepper(t,e,n,i)}}function ue(){const t=(this._duration||500)/1e3,e=this._overshoot||0,n=Math.PI,i=Math.log(e/100+1e-10),r=-i/Math.sqrt(n*n+i*i),o=3.9/(r*t);this.d=2*r*o,this.k=o*o}V(class extends le{constructor(t=500,e=0){super(),this.duration(t).overshoot(e)}step(t,e,n,i){if("string"==typeof t)return t;if(i.done=n===1/0,n===1/0)return e;if(0===n)return t;n>100&&(n=16),n/=1e3;const r=i.velocity||0,o=-this.d*r-this.k*(t-e),s=t+r*n+o*n*n/2;return i.velocity=r+o*n,i.done=Math.abs(e-s)+Math.abs(r)<.002,i.done?e:s}},{duration:re("_duration",ue),overshoot:re("_overshoot",ue)});V(class extends le{constructor(t=.1,e=.01,n=0,i=1e3){super(),this.p(t).i(e).d(n).windup(i)}step(t,e,n,i){if("string"==typeof t)return t;if(i.done=n===1/0,n===1/0)return e;if(0===n)return t;const r=e-t;let o=(i.integral||0)+r*n;const s=(r-(i.error||0))/n,a=this._windup;return!1!==a&&(o=Math.max(-a,Math.min(o,a))),i.error=r,i.integral=o,i.done=Math.abs(r)<.001,i.done?e:t+(this.P*r+this.I*o+this.D*s)}},{windup:re("_windup"),p:re("P"),i:re("I"),d:re("D")});const he={M:2,L:2,H:1,V:1,C:6,S:4,Q:4,T:2,A:7,Z:0},ce={M:function(t,e,n){return e.x=n.x=t[0],e.y=n.y=t[1],["M",e.x,e.y]},L:function(t,e){return e.x=t[0],e.y=t[1],["L",t[0],t[1]]},H:function(t,e){return e.x=t[0],["H",t[0]]},V:function(t,e){return e.y=t[0],["V",t[0]]},C:function(t,e){return e.x=t[4],e.y=t[5],["C",t[0],t[1],t[2],t[3],t[4],t[5]]},S:function(t,e){return e.x=t[2],e.y=t[3],["S",t[0],t[1],t[2],t[3]]},Q:function(t,e){return e.x=t[2],e.y=t[3],["Q",t[0],t[1],t[2],t[3]]},T:function(t,e){return e.x=t[0],e.y=t[1],["T",t[0],t[1]]},Z:function(t,e,n){return e.x=n.x,e.y=n.y,["Z"]},A:function(t,e){return e.x=t[5],e.y=t[6],["A",t[0],t[1],t[2],t[3],t[4],t[5],t[6]]}},pe="mlhvqtcsaz".split("");for(let t=0,e=pe.length;t=0;i--)n=this[i][0],"M"===n||"L"===n||"T"===n?(this[i][1]+=t,this[i][2]+=e):"H"===n?this[i][1]+=t:"V"===n?this[i][1]+=e:"C"===n||"S"===n||"Q"===n?(this[i][1]+=t,this[i][2]+=e,this[i][3]+=t,this[i][4]+=e,"C"===n&&(this[i][5]+=t,this[i][6]+=e)):"A"===n&&(this[i][6]+=t,this[i][7]+=e);return this}parse(t="M0 0"){return Array.isArray(t)&&(t=Array.prototype.concat.apply([],t).toString()),function(t,e=!0){let n=0,i="";const r={segment:[],inNumber:!1,number:"",lastToken:"",inSegment:!1,segments:[],pointSeen:!1,hasExponent:!1,absolute:e,p0:new at,p:new at};for(;r.lastToken=i,i=t.charAt(n++);)if(r.inSegment||!fe(r,i))if("."!==i)if(isNaN(parseInt(i)))if(" "!==i&&","!==i)if("-"!==i)if("E"!==i.toUpperCase()){if(nt.test(i)){if(r.inNumber)ge(r,!1);else{if(!de(r))throw new Error("parser Error");ye(r)}--n}}else r.number+=i,r.hasExponent=!0;else{if(r.inNumber&&!ve(r)){ge(r,!1),--n;continue}r.number+=i,r.inNumber=!0}else r.inNumber&&ge(r,!1);else{if("0"===r.number||me(r)){r.inNumber=!0,r.number=i,ge(r,!0);continue}r.inNumber=!0,r.number+=i}else{if(r.pointSeen||r.hasExponent){ge(r,!1),--n;continue}r.inNumber=!0,r.pointSeen=!0,r.number+=i}return r.inNumber&&ge(r,!1),r.inSegment&&de(r)&&ye(r),r.segments}(t)}size(t,e){const n=this.bbox();let i,r;for(n.width=0===n.width?1:n.width,n.height=0===n.height?1:n.height,i=this.length-1;i>=0;i--)r=this[i][0],"M"===r||"L"===r||"T"===r?(this[i][1]=(this[i][1]-n.x)*t/n.width+n.x,this[i][2]=(this[i][2]-n.y)*e/n.height+n.y):"H"===r?this[i][1]=(this[i][1]-n.x)*t/n.width+n.x:"V"===r?this[i][1]=(this[i][1]-n.y)*e/n.height+n.y:"C"===r||"S"===r||"Q"===r?(this[i][1]=(this[i][1]-n.x)*t/n.width+n.x,this[i][2]=(this[i][2]-n.y)*e/n.height+n.y,this[i][3]=(this[i][3]-n.x)*t/n.width+n.x,this[i][4]=(this[i][4]-n.y)*e/n.height+n.y,"C"===r&&(this[i][5]=(this[i][5]-n.x)*t/n.width+n.x,this[i][6]=(this[i][6]-n.y)*e/n.height+n.y)):"A"===r&&(this[i][1]=this[i][1]*t/n.width,this[i][2]=this[i][2]*e/n.height,this[i][6]=(this[i][6]-n.x)*t/n.width+n.x,this[i][7]=(this[i][7]-n.y)*e/n.height+n.y);return this}toString(){return function(t){let e="";for(let n=0,i=t.length;n{const e=typeof t;return"number"===e?Tt:"string"===e?st.isColor(t)?st:et.test(t)?nt.test(t)?Ae:Ot:U.test(t)?Tt:we:Me.indexOf(t.constructor)>-1?t.constructor:Array.isArray(t)?Ot:"object"===e?Ee:we};class Ce{constructor(t){this._stepper=t||new ae("-"),this._from=null,this._to=null,this._type=null,this._context=null,this._morphObj=null}at(t){const e=this;return this._morphObj.fromArray(this._from.map((function(n,i){return e._stepper.step(n,e._to[i],t,e._context[i],e._context)})))}done(){return this._context.map(this._stepper.done).reduce((function(t,e){return t&&e}),!0)}from(t){return null==t?this._from:(this._from=this._set(t),this)}stepper(t){return null==t?this._stepper:(this._stepper=t,this)}to(t){return null==t?this._to:(this._to=this._set(t),this)}type(t){return null==t?this._type:(this._type=t,this)}_set(t){this._type||this.type(_e(t));let e=new this._type(t);return this._type===st&&(e=this._to?e[this._to[4]]():this._from?e[this._from[4]]():e),this._type===Ee&&(e=this._to?e.align(this._to):this._from?e.align(this._from):e),e=e.toArray(),this._morphObj=this._morphObj||new this._type,this._context=this._context||Array.apply(null,Array(e.length)).map(Object).map((function(t){return t.done=!0,t})),e}}class we{constructor(...t){this.init(...t)}init(t){return t=Array.isArray(t)?t[0]:t,this.value=t,this}toArray(){return[this.value]}valueOf(){return this.value}}class xe{constructor(...t){this.init(...t)}init(t){return Array.isArray(t)&&(t={scaleX:t[0],scaleY:t[1],shear:t[2],rotate:t[3],translateX:t[4],translateY:t[5],originX:t[6],originY:t[7]}),Object.assign(this,xe.defaults,t),this}toArray(){const t=this;return[t.scaleX,t.scaleY,t.shear,t.rotate,t.translateX,t.translateY,t.originX,t.originY]}}xe.defaults={scaleX:1,scaleY:1,shear:0,rotate:0,translateX:0,translateY:0,originX:0,originY:0};const be=(t,e)=>t[0]e[0]?1:0;class Ee{constructor(...t){this.init(...t)}align(t){for(let e=0,n=this.values.length;et.concat(e),[]),this}toArray(){return this.values}valueOf(){const t={},e=this.values;for(;e.length;){const n=e.shift(),i=e.shift(),r=e.shift(),o=e.splice(0,r);t[n]=new i(o).valueOf()}return t}}const Me=[we,xe,Ee];class Oe extends Lt{constructor(t,e=t){super(I("path",t),e)}array(){return this._array||(this._array=new Ae(this.attr("d")))}clear(){return delete this._array,this}height(t){return null==t?this.bbox().height:this.size(this.bbox().width,t)}move(t,e){return this.attr("d",this.array().move(t,e))}plot(t){return null==t?this.array():this.clear().attr("d","string"==typeof t?t:this._array=new Ae(t))}size(t,e){const n=x(this,t,e);return this.attr("d",this.array().size(n.width,n.height))}width(t){return null==t?this.bbox().width:this.size(t,this.bbox().height)}x(t){return null==t?this.bbox().x:this.move(t,this.bbox().y)}y(t){return null==t?this.bbox().y:this.move(this.bbox().x,t)}}Oe.prototype.MorphArray=Ae,f({Container:{path:H((function(t){return this.put(new Oe).plot(t||new Ae)}))}}),N(Oe,"Path");var Te={__proto__:null,array:function(){return this._array||(this._array=new te(this.attr("points")))},clear:function(){return delete this._array,this},move:function(t,e){return this.attr("points",this.array().move(t,e))},plot:function(t){return null==t?this.array():this.clear().attr("points","string"==typeof t?t:this._array=new te(t))},size:function(t,e){const n=x(this,t,e);return this.attr("points",this.array().size(n.width,n.height))}};class Pe extends Lt{constructor(t,e=t){super(I("polygon",t),e)}}f({Container:{polygon:H((function(t){return this.put(new Pe).plot(t||new te)}))}}),V(Pe,ee),V(Pe,Te),N(Pe,"Polygon");class Se extends Lt{constructor(t,e=t){super(I("polyline",t),e)}}f({Container:{polyline:H((function(t){return this.put(new Se).plot(t||new te)}))}}),V(Se,ee),V(Se,Te),N(Se,"Polyline");class Re extends Lt{constructor(t,e=t){super(I("rect",t),e)}}V(Re,{rx:It,ry:kt}),f({Container:{rect:H((function(t,e){return this.put(new Re).size(t,e)}))}}),N(Re,"Rect");class je{constructor(){this._first=null,this._last=null}first(){return this._first&&this._first.value}last(){return this._last&&this._last.value}push(t){const e=void 0!==t.next?t:{value:t,next:null,prev:null};return this._last?(e.prev=this._last,this._last.next=e,this._last=e):(this._last=e,this._first=e),e}remove(t){t.prev&&(t.prev.next=t.next),t.next&&(t.next.prev=t.prev),t===this._last&&(this._last=t.prev),t===this._first&&(this._first=t.next),t.prev=null,t.next=null}shift(){const t=this._first;return t?(this._first=t.next,this._first&&(this._first.prev=null),this._last=this._first?this._last:null,t.value):null}}const ze={nextDraw:null,frames:new je,timeouts:new je,immediates:new je,timer:()=>S.window.performance||S.window.Date,transforms:[],frame(t){const e=ze.frames.push({run:t});return null===ze.nextDraw&&(ze.nextDraw=S.window.requestAnimationFrame(ze._draw)),e},timeout(t,e){e=e||0;const n=ze.timer().now()+e,i=ze.timeouts.push({run:t,time:n});return null===ze.nextDraw&&(ze.nextDraw=S.window.requestAnimationFrame(ze._draw)),i},immediate(t){const e=ze.immediates.push(t);return null===ze.nextDraw&&(ze.nextDraw=S.window.requestAnimationFrame(ze._draw)),e},cancelFrame(t){null!=t&&ze.frames.remove(t)},clearTimeout(t){null!=t&&ze.timeouts.remove(t)},cancelImmediate(t){null!=t&&ze.immediates.remove(t)},_draw(t){let e=null;const n=ze.timeouts.last();for(;(e=ze.timeouts.shift())&&(t>=e.time?e.run():ze.timeouts.push(e),e!==n););let i=null;const r=ze.frames.last();for(;i!==r&&(i=ze.frames.shift());)i.run(t);let o=null;for(;o=ze.immediates.shift();)o();ze.nextDraw=ze.timeouts.first()||ze.frames.first()?S.window.requestAnimationFrame(ze._draw):null}},De=function(t){const e=t.start,n=t.runner.duration();return{start:e,duration:n,end:e+n,runner:t.runner}},Le=function(){const t=S.window;return(t.performance||t.Date).now()};class Ie extends xt{constructor(t=Le){super(),this._timeSource=t,this._startTime=0,this._speed=1,this._persist=0,this._nextFrame=null,this._paused=!0,this._runners=[],this._runnerIds=[],this._lastRunnerId=-1,this._time=0,this._lastSourceTime=0,this._lastStepTime=0,this._step=this._stepFn.bind(this,!1),this._stepImmediate=this._stepFn.bind(this,!0)}active(){return!!this._nextFrame}finish(){return this.time(this.getEndTimeOfTimeline()+1),this.pause()}getEndTime(){const t=this.getLastRunnerInfo(),e=t?t.runner.duration():0;return(t?t.start:this._time)+e}getEndTimeOfTimeline(){const t=this._runners.map(t=>t.start+t.runner.duration());return Math.max(0,...t)}getLastRunnerInfo(){return this.getRunnerInfoById(this._lastRunnerId)}getRunnerInfoById(t){return this._runners[this._runnerIds.indexOf(t)]||null}pause(){return this._paused=!0,this._continue()}persist(t){return null==t?this._persist:(this._persist=t,this)}play(){return this._paused=!1,this.updateTime()._continue()}reverse(t){const e=this.speed();if(null==t)return this.speed(-e);const n=Math.abs(e);return this.speed(t?-n:n)}schedule(t,e,n){if(null==t)return this._runners.map(De);let i=0;const r=this.getEndTime();if(e=e||0,null==n||"last"===n||"after"===n)i=r;else if("absolute"===n||"start"===n)i=e,e=0;else if("now"===n)i=this._time;else if("relative"===n){const n=this.getRunnerInfoById(t.id);n&&(i=n.start+e,e=0)}else{if("with-last"!==n)throw new Error('Invalid value for the "when" parameter');{const t=this.getLastRunnerInfo();i=t?t.start:this._time}}t.unschedule(),t.timeline(this);const o=t.persist(),s={persist:null===o?this._persist:o,start:i+e,runner:t};return this._lastRunnerId=t.id,this._runners.push(s),this._runners.sort((t,e)=>t.start-e.start),this._runnerIds=this._runners.map(t=>t.runner.id),this.updateTime()._continue(),this}seek(t){return this.time(this._time+t)}source(t){return null==t?this._timeSource:(this._timeSource=t,this)}speed(t){return null==t?this._speed:(this._speed=t,this)}stop(){return this.time(0),this.pause()}time(t){return null==t?this._time:(this._time=t,this._continue(!0))}unschedule(t){const e=this._runnerIds.indexOf(t.id);return e<0||(this._runners.splice(e,1),this._runnerIds.splice(e,1),t.timeline(null)),this}updateTime(){return this.active()||(this._lastSourceTime=this._timeSource()),this}_continue(t=!1){return ze.cancelFrame(this._nextFrame),this._nextFrame=null,t?this._stepImmediate():(this._paused||(this._nextFrame=ze.frame(this._step)),this)}_stepFn(t=!1){const e=this._timeSource();let n=e-this._lastSourceTime;t&&(n=0);const i=this._speed*n+(this._time-this._lastStepTime);this._lastSourceTime=e,t||(this._time+=i,this._time=this._time<0?0:this._time),this._lastStepTime=this._time,this.fire("time",this._time);for(let t=this._runners.length;t--;){const e=this._runners[t],n=e.runner;this._time-e.start<=0&&n.reset()}let r=!1;for(let t=0,e=this._runners.length;t0?this._continue():(this.pause(),this.fire("finished")),this}}f({Element:{timeline:function(t){return null==t?(this._timeline=this._timeline||new Ie,this._timeline):(this._timeline=t,this)}}});class ke extends xt{constructor(t){super(),this.id=ke.id++,t="function"==typeof(t=null==t?Et.duration:t)?new le(t):t,this._element=null,this._timeline=null,this.done=!1,this._queue=[],this._duration="number"==typeof t&&t,this._isDeclarative=t instanceof le,this._stepper=this._isDeclarative?t:new ae,this._history={},this.enabled=!0,this._time=0,this._lastTime=0,this._reseted=!0,this.transforms=new ut,this.transformId=1,this._haveReversed=!1,this._reverse=!1,this._loopsDone=0,this._swing=!1,this._wait=0,this._times=1,this._frameId=null,this._persist=!!this._isDeclarative||null}static sanitise(t,e,n){let i=1,r=!1,o=0;return e=e||Et.delay,n=n||"last","object"!=typeof(t=t||Et.duration)||t instanceof se||(e=t.delay||e,n=t.when||n,r=t.swing||r,i=t.times||i,o=t.wait||o,t=t.duration||Et.duration),{duration:t,delay:e,swing:r,times:i,wait:o,when:n}}active(t){return null==t?this.enabled:(this.enabled=t,this)}addTransform(t,e){return this.transforms.lmultiplyO(t),this}after(t){return this.on("finished",t)}animate(t,e,n){const i=ke.sanitise(t,e,n),r=new ke(i.duration);return this._timeline&&r.timeline(this._timeline),this._element&&r.element(this._element),r.loop(i).schedule(i.delay,i.when)}clearTransform(){return this.transforms=new ut,this}clearTransformsFromQueue(){this.done&&this._timeline&&this._timeline._runnerIds.includes(this.id)||(this._queue=this._queue.filter(t=>!t.isTransform))}delay(t){return this.animate(0,t)}duration(){return this._times*(this._wait+this._duration)-this._wait}during(t){return this.queue(null,t)}ease(t){return this._stepper=new ae(t),this}element(t){return null==t?this._element:(this._element=t,t._prepareRunner(),this)}finish(){return this.step(1/0)}loop(t,e,n){return"object"==typeof t&&(e=t.swing,n=t.wait,t=t.times),this._times=t||1/0,this._swing=e||!1,this._wait=n||0,!0===this._times&&(this._times=1/0),this}loops(t){const e=this._duration+this._wait;if(null==t){const t=Math.floor(this._time/e),n=(this._time-t*e)/this._duration;return Math.min(t+n,this._times)}const n=t%1,i=e*Math.floor(t)+this._duration*n;return this.time(i)}persist(t){return null==t?this._persist:(this._persist=t,this)}position(t){const e=this._time,n=this._duration,i=this._wait,r=this._times,o=this._swing,s=this._reverse;let a;if(null==t){const t=function(t){const e=o*Math.floor(t%(2*(i+n))/(i+n)),r=e&&!s||!e&&s,a=Math.pow(-1,r)*(t%(i+n))/n+r;return Math.max(Math.min(a,1),0)},l=r*(i+n)-i;return a=e<=0?Math.round(t(1e-5)):e=0;this._lastPosition=e;const i=this.duration(),r=this._lastTime<=0&&this._time>0,o=this._lastTime=i;this._lastTime=this._time,r&&this.fire("start",this);const s=this._isDeclarative;this.done=!s&&!o&&this._time>=i,this._reseted=!1;let a=!1;return(n||s)&&(this._initialise(n),this.transforms=new ut,a=this._run(s?t:e),this.fire("step",this)),this.done=this.done||a&&s,o&&this.fire("finished",this),this}time(t){if(null==t)return this._time;const e=t-this._time;return this.step(e),this}timeline(t){return void 0===t?this._timeline:(this._timeline=t,this)}unschedule(){const t=this.timeline();return t&&t.unschedule(this),this}_initialise(t){if(t||this._isDeclarative)for(let e=0,n=this._queue.length;et.lmultiplyO(e),Be=t=>t.transforms;function Ge(){const t=this._transformationRunners.runners.map(Be).reduce(Ne,new ut);this.transform(t),this._transformationRunners.merge(),1===this._transformationRunners.length()&&(this._frameId=null)}class Ve{constructor(){this.runners=[],this.ids=[]}add(t){if(this.runners.includes(t))return;const e=t.id+1;return this.runners.push(t),this.ids.push(e),this}clearBefore(t){const e=this.ids.indexOf(t+1)||1;return this.ids.splice(0,e,0),this.runners.splice(0,e,new Fe).forEach(t=>t.clearTransformsFromQueue()),this}edit(t,e){const n=this.ids.indexOf(t+1);return this.ids.splice(n,1,t+1),this.runners.splice(n,1,e),this}getByID(t){return this.runners[this.ids.indexOf(t+1)]}length(){return this.ids.length}merge(){let t=null;for(let e=0;ee.id<=t.id).map(Be).reduce(Ne,new ut)},_addRunner(t){this._transformationRunners.add(t),ze.cancelImmediate(this._frameId),this._frameId=ze.immediate(Ge.bind(this))},_prepareRunner(){null==this._frameId&&(this._transformationRunners=(new Ve).add(new Fe(new ut(this))))}}});V(ke,{attr(t,e){return this.styleAttr("attr",t,e)},css(t,e){return this.styleAttr("css",t,e)},styleAttr(t,e,n){if("string"==typeof e)return this.styleAttr(t,{[e]:n});let i=e;if(this._tryRetarget(t,i))return this;let r=new Ce(this._stepper).to(i),o=Object.keys(i);return this.queue((function(){r=r.from(this.element()[t](o))}),(function(e){return this.element()[t](r.at(e).valueOf()),r.done()}),(function(e){const n=Object.keys(e),s=(a=o,n.filter(t=>!a.includes(t)));var a;if(s.length){const e=this.element()[t](s),n=new Ee(r.from()).valueOf();Object.assign(n,e),r.from(n)}const l=new Ee(r.to()).valueOf();Object.assign(l,e),r.to(l),o=n,i=e})),this._rememberMorpher(t,r),this},zoom(t,e){if(this._tryRetarget("zoom",t,e))return this;let n=new Ce(this._stepper).to(new Tt(t));return this.queue((function(){n=n.from(this.element().zoom())}),(function(t){return this.element().zoom(n.at(t),e),n.done()}),(function(t,i){e=i,n.to(t)})),this._rememberMorpher("zoom",n),this},transform(t,e,n){if(e=t.relative||e,this._isDeclarative&&!e&&this._tryRetarget("transform",t))return this;const i=ut.isMatrixLike(t);n=null!=t.affine?t.affine:null!=n?n:!i;const r=new Ce(this._stepper).type(n?xe:ut);let o,s,a,l,u;return this.queue((function(){s=s||this.element(),o=o||b(t,s),u=new ut(e?void 0:s),s._addRunner(this),e||s._clearTransformRunnersBefore(this)}),(function(h){e||this.clearTransform();const{x:c,y:p}=new at(o).transform(s._currentTransform(this));let d=new ut({...t,origin:[c,p]}),f=this._isDeclarative&&a?a:u;if(n){d=d.decompose(c,p),f=f.decompose(c,p);const t=d.rotate,e=f.rotate,n=[t-360,t,t+360],i=n.map(t=>Math.abs(t-e)),r=Math.min(...i),o=i.indexOf(r);d.rotate=n[o]}e&&(i||(d.rotate=t.rotate||0),this._isDeclarative&&l&&(f.rotate=l)),r.from(f),r.to(d);const g=r.at(h);return l=g.rotate,a=new ut(g),this.addTransform(a),s._addRunner(this),r.done()}),(function(e){(e.origin||"center").toString()!==(t.origin||"center").toString()&&(o=b(e,s)),t={...e,origin:o}}),!0),this._isDeclarative&&this._rememberMorpher("transform",r),this},x(t,e){return this._queueNumber("x",t)},y(t){return this._queueNumber("y",t)},dx(t=0){return this._queueNumberDelta("x",t)},dy(t=0){return this._queueNumberDelta("y",t)},dmove(t,e){return this.dx(t).dy(e)},_queueNumberDelta(t,e){if(e=new Tt(e),this._tryRetarget(t,e))return this;const n=new Ce(this._stepper).to(e);let i=null;return this.queue((function(){i=this.element()[t](),n.from(i),n.to(i+e)}),(function(e){return this.element()[t](n.at(e)),n.done()}),(function(t){n.to(i+new Tt(t))})),this._rememberMorpher(t,n),this},_queueObject(t,e){if(this._tryRetarget(t,e))return this;const n=new Ce(this._stepper).to(e);return this.queue((function(){n.from(this.element()[t]())}),(function(e){return this.element()[t](n.at(e)),n.done()})),this._rememberMorpher(t,n),this},_queueNumber(t,e){return this._queueObject(t,new Tt(e))},cx(t){return this._queueNumber("cx",t)},cy(t){return this._queueNumber("cy",t)},move(t,e){return this.x(t).y(e)},center(t,e){return this.cx(t).cy(e)},size(t,e){let n;return t&&e||(n=this._element.bbox()),t||(t=n.width/n.height*e),e||(e=n.height/n.width*t),this.width(t).height(e)},width(t){return this._queueNumber("width",t)},height(t){return this._queueNumber("height",t)},plot(t,e,n,i){if(4===arguments.length)return this.plot([t,e,n,i]);if(this._tryRetarget("plot",t))return this;const r=new Ce(this._stepper).type(this._element.MorphArray).to(t);return this.queue((function(){r.from(this._element.array())}),(function(t){return this._element.plot(r.at(t)),r.done()})),this._rememberMorpher("plot",r),this},leading(t){return this._queueNumber("leading",t)},viewbox(t,e,n,i){return this._queueObject("viewbox",new pt(t,e,n,i))},update(t){return"object"!=typeof t?this.update({offset:arguments[0],color:arguments[1],opacity:arguments[2]}):(null!=t.opacity&&this.attr("stop-opacity",t.opacity),null!=t.color&&this.attr("stop-color",t.color),null!=t.offset&&this.attr("offset",t.offset),this)}}),V(ke,{rx:It,ry:kt,from:Kt,to:Zt}),N(ke,"Runner");class He extends zt{constructor(t,e=t){super(I("svg",t),e),this.namespace()}defs(){return this.isRoot()?k(this.node.querySelector("defs"))||this.put(new Dt):this.root().defs()}isRoot(){return!this.node.parentNode||!(this.node.parentNode instanceof S.window.SVGElement)&&"#document-fragment"!==this.node.parentNode.nodeName}namespace(){return this.isRoot()?this.attr({xmlns:E,version:"1.1"}).attr("xmlns:xlink",T,O).attr("xmlns:svgjs",P,O):this.root().namespace()}removeNamespace(){return this.attr({xmlns:null,version:null}).attr("xmlns:xlink",null,O).attr("xmlns:svgjs",null,O)}root(){return this.isRoot()?this:super.root()}}f({Container:{nested:H((function(){return this.put(new He)}))}}),N(He,"Svg",!0);class Ue extends zt{constructor(t,e=t){super(I("symbol",t),e)}}f({Container:{symbol:H((function(){return this.put(new Ue)}))}}),N(Ue,"Symbol");var Xe={__proto__:null,plain:function(t){return!1===this._build&&this.clear(),this.node.appendChild(S.document.createTextNode(t)),this},length:function(){return this.node.getComputedTextLength()},x:function(t,e=this.bbox()){return null==t?e.x:this.attr("x",this.attr("x")+t-e.x)},y:function(t,e=this.bbox()){return null==t?e.y:this.attr("y",this.attr("y")+t-e.y)},move:function(t,e,n=this.bbox()){return this.x(t,n).y(e,n)},cx:function(t,e=this.bbox()){return null==t?e.cx:this.attr("x",this.attr("x")+t-e.cx)},cy:function(t,e=this.bbox()){return null==t?e.cy:this.attr("y",this.attr("y")+t-e.cy)},center:function(t,e,n=this.bbox()){return this.cx(t,n).cy(e,n)},ax:function(t){return this.attr("x",t)},ay:function(t){return this.attr("y",t)},amove:function(t,e){return this.ax(t).ay(e)},build:function(t){return this._build=!!t,this}};class Ye extends Lt{constructor(t,e=t){super(I("text",t),e),this.dom.leading=new Tt(1.3),this._rebuild=!0,this._build=!1}leading(t){return null==t?this.dom.leading:(this.dom.leading=new Tt(t),this.rebuild())}rebuild(t){if("boolean"==typeof t&&(this._rebuild=t),this._rebuild){const t=this;let e=0;const n=this.dom.leading;this.each((function(i){const r=S.window.getComputedStyle(this.node).getPropertyValue("font-size"),o=n*new Tt(r);this.dom.newLined&&(this.attr("x",t.attr("x")),"\n"===this.text()?e+=o:(this.attr("dy",i?o+e:0),e=0))})),this.fire("rebuild")}return this}setData(t){return this.dom=t,this.dom.leading=new Tt(t.leading||1.3),this}text(t){if(void 0===t){const e=this.node.childNodes;let n=0;t="";for(let i=0,r=e.length;i{let r;try{r=n.bbox()}catch(t){return}const o=new ut(n),s=o.translate(t,e).transform(o.inverse()),a=new at(r.x,r.y).transform(s);n.move(a.x,a.y)}),this},dx:function(t){return this.dmove(t,0)},dy:function(t){return this.dmove(0,t)},height:function(t,e=this.bbox()){return null==t?e.height:this.size(e.width,t,e)},move:function(t=0,e=0,n=this.bbox()){const i=t-n.x,r=e-n.y;return this.dmove(i,r)},size:function(t,e,n=this.bbox()){const i=x(this,t,e,n),r=i.width/n.width,o=i.height/n.height;return this.children().forEach((t,e)=>{const i=new at(n).transform(new ut(t).inverse());t.scale(r,o,i.x,i.y)}),this},width:function(t,e=this.bbox()){return null==t?e.width:this.size(t,e.height,e)},x:function(t,e=this.bbox()){return null==t?e.x:this.move(t,e.y,e)},y:function(t,e=this.bbox()){return null==t?e.y:this.move(e.x,t,e)}};class Je extends zt{constructor(t,e=t){super(I("g",t),e)}}V(Je,Qe),f({Container:{group:H((function(){return this.put(new Je)}))}}),N(Je,"G");class $e extends zt{constructor(t,e=t){super(I("a",t),e)}target(t){return this.attr("target",t)}to(t){return this.attr("href",t,T)}}V($e,Qe),f({Container:{link:H((function(t){return this.put(new $e).to(t)}))},Element:{unlink(){const t=this.linker();if(!t)return this;const e=t.parent();if(!e)return this.remove();const n=e.index(t);return e.add(this,n),t.remove(),this},linkTo(t){let e=this.linker();return e||(e=new $e,this.wrap(e)),"function"==typeof t?t.call(e,e):e.to(t),this},linker(){const t=this.parent();return t&&"a"===t.node.nodeName.toLowerCase()?t:null}}}),N($e,"A");class tn extends zt{constructor(t,e=t){super(I("mask",t),e)}remove(){return this.targets().forEach((function(t){t.unmask()})),super.remove()}targets(){return yt('svg [mask*="'+this.id()+'"]')}}f({Container:{mask:H((function(){return this.defs().put(new tn)}))},Element:{masker(){return this.reference("mask")},maskWith(t){const e=t instanceof tn?t:this.parent().mask().add(t);return this.attr("mask",'url("#'+e.id()+'")')},unmask(){return this.attr("mask",null)}}}),N(tn,"Mask");class en extends Rt{constructor(t,e=t){super(I("stop",t),e)}update(t){return("number"==typeof t||t instanceof Tt)&&(t={offset:arguments[0],color:arguments[1],opacity:arguments[2]}),null!=t.opacity&&this.attr("stop-opacity",t.opacity),null!=t.color&&this.attr("stop-color",t.color),null!=t.offset&&this.attr("offset",new Tt(t.offset)),this}}f({Gradient:{stop:function(t,e,n){return this.put(new en).update(t,e,n)}}}),N(en,"Stop");class nn extends Rt{constructor(t,e=t){super(I("style",t),e)}addText(t=""){return this.node.textContent+=t,this}font(t,e,n={}){return this.rule("@font-face",{fontFamily:t,src:e,...n})}rule(t,e){return this.addText(function(t,e){if(!t)return"";if(!e)return t;let n=t+"{";for(const t in e)n+=C(t)+":"+e[t]+";";return n+="}",n}(t,e))}}f("Dom",{style(t,e){return this.put(new nn).rule(t,e)},fontface(t,e,n){return this.put(new nn).font(t,e,n)}}),N(nn,"Style");class rn extends Ye{constructor(t,e=t){super(I("textPath",t),e)}array(){const t=this.track();return t?t.array():null}plot(t){const e=this.track();let n=null;return e&&(n=e.plot(t)),null==t?n:this}track(){return this.reference("href")}}f({Container:{textPath:H((function(t,e){return t instanceof Ye||(t=this.text(t)),t.path(e)}))},Text:{path:H((function(t,e=!0){const n=new rn;let i;if(t instanceof Oe||(t=this.defs().path(t)),n.attr("href","#"+t,T),e)for(;i=this.node.firstChild;)n.node.appendChild(i);return this.put(n)})),textPath(){return this.findOne("textPath")}},Path:{text:H((function(t){return t instanceof Ye||(t=(new Ye).addTo(this.parent()).text(t)),t.path(this)})),targets(){return yt("svg textPath").filter(t=>(t.attr("href")||"").includes(this.id()))}}}),rn.prototype.MorphArray=Ae,N(rn,"TextPath");class on extends Lt{constructor(t,e=t){super(I("use",t),e)}use(t,e){return this.attr("href",(e||"")+"#"+t,T)}}f({Container:{use:H((function(t,e){return this.put(new on).use(t,e)}))}}),N(on,"Use");const sn=L;V([He,Ue,$t,Jt,ie],g("viewbox")),V([ne,Se,Pe,Oe],g("marker")),V(Ye,g("Text")),V(Oe,g("Path")),V(Dt,g("Defs")),V([Ye,Ke],g("Tspan")),V([Re,Xt,Qt,ke],g("radius")),V(xt,g("EventTarget")),V(St,g("Dom")),V(Rt,g("Element")),V(Lt,g("Shape")),V([zt,Yt],g("Container")),V(Qt,g("Gradient")),V(ke,g("Runner")),ft.extend([...new Set(d)]),function(t=[]){Me.push(...[].concat(t))}([Tt,st,pt,ut,Ot,te,Ae]),V(Me,{to(t){return(new Ce).type(this.constructor).from(this.valueOf()).to(t)},fromArray(t){return this.init(t),this}});var an=n(3),ln=function(){function t(){this.disposed=!1}return t.prototype.dispose=function(){this.disposed||(this.disposed=!0,this.disposeInternal())},t.prototype.disposeInternal=function(){},t}();function un(t,e){return t>e?1:t0){for(r=1;r0?r-1:r:t[r-1]-er&&(l|=Vn),ao&&(l|=Gn),l===Nn&&(l=Bn),l}function qn(){return[1/0,1/0,-1/0,-1/0]}function Qn(t,e,n,i,r){return r?(r[0]=t,r[1]=e,r[2]=n,r[3]=i,r):[t,e,n,i]}function Jn(t){return Qn(1/0,1/0,-1/0,-1/0,t)}function $n(t,e){return t[0]==e[0]&&t[2]==e[2]&&t[1]==e[1]&&t[3]==e[3]}function ti(t,e){e[0]t[2]&&(t[2]=e[0]),e[1]t[3]&&(t[3]=e[1])}function ei(t,e,n,i,r){for(;ne[0]?i[0]=t[0]:i[0]=e[0],t[1]>e[1]?i[1]=t[1]:i[1]=e[1],t[2]=e[0]&&t[1]<=e[3]&&t[3]>=e[1]}function yi(t){return t[2]1)for(var o=t[2]-t[0],s=t[3]-t[1],a=0;a1?(n=r,i=o):l>0&&(n+=s*l,i+=a*l)}return wi(t,e,n,i)}function wi(t,e,n,i){var r=n-t,o=i-e;return r*r+o*o}function xi(t){return t*Math.PI/180}function bi(t,e){var n=t%e;return n*e<0?n+e:n}function Ei(t,e,n){return t+n*(e-t)}var Mi=/^#([a-f0-9]{3}|[a-f0-9]{4}(?:[a-f0-9]{2}){0,2})$/i,Oi=/^([a-z]*)$|^hsla?\(.*\)$/i;function Ti(t){return"string"==typeof t?t:function(t){var e=t[0];e!=(0|e)&&(e=e+.5|0);var n=t[1];n!=(0|n)&&(n=n+.5|0);var i=t[2];i!=(0|i)&&(i=i+.5|0);var r=void 0===t[3]?1:t[3];return"rgba("+e+","+n+","+i+","+r+")"}(t)}function Pi(t){var e=document.createElement("div");if(e.style.color=t,""!==e.style.color){document.body.appendChild(e);var n=getComputedStyle(e).color;return document.body.removeChild(e),n}return""}var Si,Ri;Si={},Ri=0;function ji(t){return t[0]=vi(t[0]+.5|0,0,255),t[1]=vi(t[1]+.5|0,0,255),t[2]=vi(t[2]+.5|0,0,255),t[3]=vi(t[3],0,1),t}var zi=function(){function t(){this.cache_={},this.cacheSize_=0,this.maxCacheSize_=32}return t.prototype.clear=function(){this.cache_={},this.cacheSize_=0},t.prototype.canExpireCache=function(){return this.cacheSize_>this.maxCacheSize_},t.prototype.expire=function(){if(this.canExpireCache()){var t=0;for(var e in this.cache_){var n=this.cache_[e];0!=(3&t++)||n.hasListener()||(delete this.cache_[e],--this.cacheSize_)}}},t.prototype.get=function(t,e,n){var i=Di(t,e,n);return i in this.cache_?this.cache_[i]:null},t.prototype.set=function(t,e,n,i){var r=Di(t,e,n);this.cache_[r]=i,++this.cacheSize_},t.prototype.setSize=function(t){this.maxCacheSize_=t,this.expire()},t}();function Di(t,e,n){return e+":"+t+":"+(n?Ti(n):"null")}var Li=new zi;var Ii=function(){function t(t){this.propagationStopped,this.defaultPrevented,this.type=t,this.target=null}return t.prototype.preventDefault=function(){this.defaultPrevented=!0},t.prototype.stopPropagation=function(){this.propagationStopped=!0},t}(),ki="propertychange",Fi="function"==typeof Object.assign?Object.assign:function(t,e){if(null==t)throw new TypeError("Cannot convert undefined or null to object");for(var n=Object(t),i=1,r=arguments.length;i0)},e.prototype.removeEventListener=function(t,e){var n=this.listeners_&&this.listeners_[t];if(n){var i=n.indexOf(e);-1!==i&&(this.pendingRemovals_&&t in this.pendingRemovals_?(n[i]=gn,++this.pendingRemovals_[t]):(n.splice(i,1),0===n.length&&delete this.listeners_[t]))}},e}(ln),Ui="change",Xi="error",Yi="contextmenu",Ki="click",Zi="dblclick",Wi="keydown",qi="keypress",Qi="load",Ji="resize",$i="touchmove",tr="wheel";function er(t,e,n,i,r){if(i&&i!==t&&(n=n.bind(i)),r){var o=n;n=function(){t.removeEventListener(e,n),o.apply(this,arguments)}}var s={target:t,type:e,listener:n};return t.addEventListener(e,n),s}function nr(t,e,n,i){return er(t,e,n,i,!0)}function ir(t){t&&t.target&&(t.target.removeEventListener(t.type,t.listener),Ni(t))}var rr=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),or=function(t){function e(){var e=t.call(this)||this;return e.on=e.onInternal,e.once=e.onceInternal,e.un=e.unInternal,e.revision_=0,e}return rr(e,t),e.prototype.changed=function(){++this.revision_,this.dispatchEvent(Ui)},e.prototype.getRevision=function(){return this.revision_},e.prototype.onInternal=function(t,e){if(Array.isArray(t)){for(var n=t.length,i=new Array(n),r=0;r=t.maxResolution)return!1;var i=e.zoom;return i>t.minZoom&&i<=t.maxZoom}var Sr=function(t){function e(e){var n=this,i=Fi({},e);delete i.source,(n=t.call(this,i)||this).on,n.once,n.un,n.mapPrecomposeKey_=null,n.mapRenderKey_=null,n.sourceChangeKey_=null,n.renderer_=null,e.render&&(n.render=e.render),e.map&&n.setMap(e.map),n.addChangeListener(vr,n.handleSourcePropertyChange_);var r=e.source?e.source:null;return n.setSource(r),n}return Tr(e,t),e.prototype.getLayersArray=function(t){var e=t||[];return e.push(this),e},e.prototype.getLayerStatesArray=function(t){var e=t||[];return e.push(this.getLayerState()),e},e.prototype.getSource=function(){return this.get(vr)||null},e.prototype.getSourceState=function(){var t=this.getSource();return t?t.getState():Mr},e.prototype.handleSourceChange_=function(){this.changed()},e.prototype.handleSourcePropertyChange_=function(){this.sourceChangeKey_&&(ir(this.sourceChangeKey_),this.sourceChangeKey_=null);var t=this.getSource();t&&(this.sourceChangeKey_=er(t,Ui,this.handleSourceChange_,this)),this.changed()},e.prototype.getFeatures=function(t){return this.renderer_?this.renderer_.getFeatures(t):new Promise((function(t){return t([])}))},e.prototype.render=function(t,e){var n=this.getRenderer();if(n.prepareFrame(t))return n.renderFrame(t,e)},e.prototype.setMap=function(t){this.mapPrecomposeKey_&&(ir(this.mapPrecomposeKey_),this.mapPrecomposeKey_=null),t||this.changed(),this.mapRenderKey_&&(ir(this.mapRenderKey_),this.mapRenderKey_=null),t&&(this.mapPrecomposeKey_=er(t,xr,(function(t){var e=t.frameState.layerStatesArray,n=this.getLayerState(!1);Pn(!e.some((function(t){return t.layer===n.layer})),67),e.push(n)}),this),this.mapRenderKey_=er(this,Ui,t.render,t),this.changed())},e.prototype.setSource=function(t){this.set(vr,t)},e.prototype.getRenderer=function(){return this.renderer_||(this.renderer_=this.createRenderer()),this.renderer_},e.prototype.hasRenderer=function(){return!!this.renderer_},e.prototype.createRenderer=function(){return null},e.prototype.disposeInternal=function(){this.renderer_&&(this.renderer_.dispose(),delete this.renderer_),this.setSource(null),t.prototype.disposeInternal.call(this)},e}(_r);function Rr(t,e){for(var n=!0,i=t.length-1;i>=0;--i)if(t[i]!=e[i]){n=!1;break}return n}function jr(t,e){var n=Math.cos(e),i=Math.sin(e),r=t[0]*n-t[1]*i,o=t[1]*n+t[0]*i;return t[0]=r,t[1]=o,t}function zr(t,e,n){var i=e.getExtent(),r=0;if(e.canWrapX()&&(t[0]i[2])){var o=n||fi(i);r=Math.floor((t[0]-i[0])/o)}return r}var Dr=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}();function Lr(t,e){Li.expire()}var Ir=function(t){function e(e){var n=t.call(this)||this;return n.map_=e,n}return Dr(e,t),e.prototype.dispatchRenderEvent=function(t,e){yn()},e.prototype.calculateMatrices2D=function(t){var e=t.viewState,n=t.coordinateToPixelTransform,i=t.pixelToCoordinateTransform;jn(n,t.size[0]/2,t.size[1]/2,1/e.resolution,-1/e.resolution,-e.rotation,-e.center[0],-e.center[1]),zn(i,n)},e.prototype.forEachFeatureAtCoordinate=function(t,e,n,i,r,o,s,a){var l,u=e.viewState;function h(t,e,n,i){return r.call(o,e,t?n:null,i)}var c=u.projection,p=function(t,e){if(e.canWrapX()){var n=fi(e.getExtent()),i=zr(t,e,n);i&&(t[0]-=i*n)}return t}(t.slice(),c),d=[[0,0]];if(c.canWrapX()&&i){var f=fi(c.getExtent());d.push([-f,0],[f,0])}for(var g=e.layerStatesArray,y=g.length,m=[],v=[],A=0;A=0;--_){var C=g[_],w=C.layer;if(w.hasRenderer()&&Pr(C,u)&&s.call(a,w)){var x=w.getRenderer(),b=w.getSource();if(x&&b){var E=b.getWrapX()?p:t,M=h.bind(null,C.managed);v[0]=E[0]+d[A][0],v[1]=E[1]+d[A][1],l=x.forEachFeatureAtCoordinate(v,e,n,M,m)}if(l)return l}}if(0!==m.length){var O=1/m.length;return m.forEach((function(t,e){return t.distanceSq+=e*O})),m.sort((function(t,e){return t.distanceSq-e.distanceSq})),m.some((function(t){return l=t.callback(t.feature,t.layer,t.geometry)})),l}},e.prototype.forEachLayerAtPixel=function(t,e,n,i,r){return yn()},e.prototype.hasFeatureAtCoordinate=function(t,e,n,i,r,o){return void 0!==this.forEachFeatureAtCoordinate(t,e,n,i,dn,this,r,o)},e.prototype.getMap=function(){return this.map_},e.prototype.renderFrame=function(t){yn()},e.prototype.scheduleExpireIconCache=function(t){Li.canExpireCache()&&t.postRenderFunctions.push(Lr)},e}(ln),kr=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),Fr=function(t){function e(e,n,i,r){var o=t.call(this,e)||this;return o.inversePixelTransform=n,o.frameState=i,o.context=r,o}return kr(e,t),e}(Ii),Nr=new RegExp(["^\\s*(?=(?:(?:[-a-z]+\\s*){0,2}(italic|oblique))?)","(?=(?:(?:[-a-z]+\\s*){0,2}(small-caps))?)","(?=(?:(?:[-a-z]+\\s*){0,2}(bold(?:er)?|lighter|[1-9]00 ))?)","(?:(?:normal|\\1|\\2|\\3)\\s*){0,3}((?:xx?-)?","(?:small|large)|medium|smaller|larger|[\\.\\d]+(?:\\%|in|[cem]m|ex|p[ctx]))","(?:\\s*\\/\\s*(normal|[\\.\\d]+(?:\\%|in|[cem]m|ex|p[ctx])?))","?\\s*([-,\\\"\\'\\sa-z]+?)\\s*$"].join(""),"i"),Br=["style","variant","weight","size","lineHeight","family"],Gr=function(t){var e=t.match(Nr);if(!e)return null;for(var n={lineHeight:"normal",size:"1.2em",style:"normal",weight:"normal",variant:"normal"},i=0,r=Br.length;i=0;--o)i[o].renderDeclutter(t);!function(t,e){for(var n=t.childNodes,i=0;;++i){var r=n[i],o=e[i];if(!r&&!o)break;r!==o&&(r?o?t.insertBefore(o,r):(t.removeChild(r),--i):t.appendChild(o))}}(this.element_,this.children_),this.dispatchRenderEvent(br,t),this.renderedVisible_||(this.element_.style.display="",this.renderedVisible_=!0),this.scheduleExpireIconCache(t)}else this.renderedVisible_&&(this.element_.style.display="none",this.renderedVisible_=!1)},e.prototype.forEachLayerAtPixel=function(t,e,n,i,r){for(var o=e.viewState,s=e.layerStatesArray,a=s.length-1;a>=0;--a){var l=s[a],u=l.layer;if(u.hasRenderer()&&Pr(l,o)&&r(u)){var h=u.getRenderer().getDataAtPixel(t,e,n);if(h){var c=i(u,h);if(c)return c}}}},e}(Ir),to="add",eo="remove",no=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),io="length",ro=function(t){function e(e,n,i){var r=t.call(this,e)||this;return r.element=n,r.index=i,r}return no(e,t),e}(Ii),oo=function(t){function e(e,n){var i=t.call(this)||this;i.on,i.once,i.un;var r=n||{};if(i.unique_=!!r.unique,i.array_=e||[],i.unique_)for(var o=0,s=i.array_.length;o0;)this.pop()},e.prototype.extend=function(t){for(var e=0,n=t.length;ethis.moveTolerance_||Math.abs(t.clientY-this.down_.clientY)>this.moveTolerance_},e.prototype.disposeInternal=function(){this.relayedListenerKey_&&(ir(this.relayedListenerKey_),this.relayedListenerKey_=null),this.element_.removeEventListener($i,this.boundHandleTouchMove_),this.pointerdownListenerKey_&&(ir(this.pointerdownListenerKey_),this.pointerdownListenerKey_=null),this.dragListenerKeys_.forEach(ir),this.dragListenerKeys_.length=0,this.element_=null,t.prototype.disposeInternal.call(this)},e}(Hi),Ao="postrender",_o="movestart",Co="moveend",wo="layergroup",xo="size",bo="target",Eo="view",Mo=function(){function t(t,e){this.priorityFunction_=t,this.keyFunction_=e,this.elements_=[],this.priorities_=[],this.queuedElements_={}}return t.prototype.clear=function(){this.elements_.length=0,this.priorities_.length=0,Ni(this.queuedElements_)},t.prototype.dequeue=function(){var t=this.elements_,e=this.priorities_,n=t[0];1==t.length?(t.length=0,e.length=0):(t[0]=t.pop(),e[0]=e.pop(),this.siftUp_(0));var i=this.keyFunction_(n);return delete this.queuedElements_[i],n},t.prototype.enqueue=function(t){Pn(!(this.keyFunction_(t)in this.queuedElements_),31);var e=this.priorityFunction_(t);return e!=1/0&&(this.elements_.push(t),this.priorities_.push(e),this.queuedElements_[this.keyFunction_(t)]=!0,this.siftDown_(0,this.elements_.length-1),!0)},t.prototype.getCount=function(){return this.elements_.length},t.prototype.getLeftChildIndex_=function(t){return 2*t+1},t.prototype.getRightChildIndex_=function(t){return 2*t+2},t.prototype.getParentIndex_=function(t){return t-1>>1},t.prototype.heapify_=function(){var t;for(t=(this.elements_.length>>1)-1;t>=0;t--)this.siftUp_(t)},t.prototype.isEmpty=function(){return 0===this.elements_.length},t.prototype.isKeyQueued=function(t){return t in this.queuedElements_},t.prototype.isQueued=function(t){return this.isKeyQueued(this.keyFunction_(t))},t.prototype.siftUp_=function(t){for(var e=this.elements_,n=this.priorities_,i=e.length,r=e[t],o=n[t],s=t;t>1;){var a=this.getLeftChildIndex_(t),l=this.getRightChildIndex_(t),u=lt;){var s=this.getParentIndex_(e);if(!(i[s]>o))break;n[e]=n[s],i[e]=i[s],e=s}n[e]=r,i[e]=o},t.prototype.reprioritize=function(){var t,e,n,i=this.priorityFunction_,r=this.elements_,o=this.priorities_,s=0,a=r.length;for(e=0;e0;)i=(n=this.dequeue()[0]).getKey(),n.getState()!==Oo||i in this.tilesLoadingKeys_||(this.tilesLoadingKeys_[i]=!0,++this.tilesLoading_,++r,n.load())},e}(Mo);var Do="Point",Lo="LinearRing",Io="Polygon",ko="Circle",Fo={RADIANS:"radians",DEGREES:"degrees",FEET:"ft",METERS:"m",PIXELS:"pixels",TILE_PIXELS:"tile-pixels",USFEET:"us-ft"};var No={};No[Fo.RADIANS]=6370997/(2*Math.PI),No[Fo.DEGREES]=2*Math.PI*6370997/360,No[Fo.FEET]=.3048,No[Fo.METERS]=1,No[Fo.USFEET]=1200/3937;var Bo=Fo,Go=0,Vo=1,Ho="center",Uo="resolution",Xo="rotation",Yo=function(){function t(t){this.code_=t.code,this.units_=t.units,this.extent_=void 0!==t.extent?t.extent:null,this.worldExtent_=void 0!==t.worldExtent?t.worldExtent:null,this.axisOrientation_=void 0!==t.axisOrientation?t.axisOrientation:"enu",this.global_=void 0!==t.global&&t.global,this.canWrapX_=!(!this.global_||!this.extent_),this.getPointResolutionFunc_=t.getPointResolution,this.defaultTileGrid_=null,this.metersPerUnit_=t.metersPerUnit}return t.prototype.canWrapX=function(){return this.canWrapX_},t.prototype.getCode=function(){return this.code_},t.prototype.getExtent=function(){return this.extent_},t.prototype.getUnits=function(){return this.units_},t.prototype.getMetersPerUnit=function(){return this.metersPerUnit_||No[this.units_]},t.prototype.getWorldExtent=function(){return this.worldExtent_},t.prototype.getAxisOrientation=function(){return this.axisOrientation_},t.prototype.isGlobal=function(){return this.global_},t.prototype.setGlobal=function(t){this.global_=t,this.canWrapX_=!(!t||!this.extent_)},t.prototype.getDefaultTileGrid=function(){return this.defaultTileGrid_},t.prototype.setDefaultTileGrid=function(t){this.defaultTileGrid_=t},t.prototype.setExtent=function(t){this.extent_=t,this.canWrapX_=!(!this.global_||!t)},t.prototype.setWorldExtent=function(t){this.worldExtent_=t},t.prototype.setGetPointResolution=function(t){this.getPointResolutionFunc_=t},t.prototype.getPointResolutionFunc=function(){return this.getPointResolutionFunc_},t}(),Ko=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),Zo=6378137*Math.PI,Wo=[-Zo,-Zo,Zo,Zo],qo=[-180,-85,180,85],Qo=6378137*Math.log(Math.tan(Math.PI/2)),Jo=function(t){function e(e){return t.call(this,{code:e,units:Bo.METERS,extent:Wo,global:!0,worldExtent:qo,getPointResolution:function(t,e){return t/Ai(e[1]/6378137)}})||this}return Ko(e,t),e}(Yo),$o=[new Jo("EPSG:3857"),new Jo("EPSG:102100"),new Jo("EPSG:102113"),new Jo("EPSG:900913"),new Jo("http://www.opengis.net/def/crs/EPSG/0/3857"),new Jo("http://www.opengis.net/gml/srs/epsg.xml#3857")];function ts(t,e,n){var i=t.length,r=n>1?n:2,o=e;void 0===o&&(o=r>2?t.slice():new Array(i));for(var s=0;sQo?a=Qo:a<-Qo&&(a=-Qo),o[s+1]=a}return o}function es(t,e,n){var i=t.length,r=n>1?n:2,o=e;void 0===o&&(o=r>2?t.slice():new Array(i));for(var s=0;sd&&(d=p=(d+p)/2),f>g&&(g=f=(g+f)/2);var y=vi(i[0],p,d),m=vi(i[1],f,g),v=30*r;return s&&n&&(y+=-v*Math.log(1+Math.max(0,p-i[0])/v)+v*Math.log(1+Math.max(0,i[0]-d)/v),m+=-v*Math.log(1+Math.max(0,f-i[1])/v)+v*Math.log(1+Math.max(0,i[1]-g)/v)),[y,m]}}}function Rs(t){return t}function js(t,e,n,i){var r=fi(e)/n[0],o=hi(e)/n[1];return i?Math.min(t,Math.max(r,o)):Math.min(t,Math.min(r,o))}function zs(t,e,n){var i=Math.min(t,e);return i*=Math.log(1+50*Math.max(0,t/e-1))/50+1,n&&(i=Math.max(i,n),i/=Math.log(1+50*Math.max(0,n/t-1))/50+1),vi(i,n/2,2*e)}function Ds(t,e,n,i,r){return function(o,s,a,l){if(void 0!==o){var u=i?js(t,i,a,r):t;return(void 0===n||n)&&l?zs(o,u,e):vi(o,e,u)}}}function Ls(t){return void 0!==t?0:void 0}function Is(t){return void 0!==t?t:void 0}function ks(t){return Math.pow(t,3)}function Fs(t){return 1-ks(1-t)}function Ns(t){return 3*t*t-2*t*t*t}function Bs(t){return t}ys($o),ys(ss),xs=$o,bs=ts,Es=es,ss.forEach((function(t){xs.forEach((function(e){us(t,e,bs),us(e,t,Es)}))}));var Gs="XY",Vs="XYZ",Hs="XYM",Us="XYZM";function Xs(t,e,n,i,r,o){for(var s=o||[],a=0,l=e;l1)a=n;else{if(p>0){for(var d=0;dr&&(r=u),o=a,s=l}return r}function ta(t,e,n,i,r){for(var o=0,s=n.length;o0;){for(var c=u.pop(),p=u.pop(),d=0,f=t[p],g=t[p+1],y=t[c],m=t[c+1],v=p+i;vd&&(h=v,d=A)}d>r&&(l[(h-e)/i]=1,p+i0&&g>d)&&(f<0&&y0&&y>f)?(a=c,l=p):(o[s++]=a,o[s++]=l,u=a,h=l,a=c,l=p)}}return o[s++]=a,o[s++]=l,s}function la(t,e,n,i,r,o,s,a){for(var l=0,u=n.length;lo&&(u-a)*(o-l)-(r-a)*(h-l)>0&&s++:h<=o&&(u-a)*(o-l)-(r-a)*(h-l)<0&&s--,a=u,l=h}return 0!==s}function Aa(t,e,n,i,r,o){if(0===n.length)return!1;if(!va(t,e,n[0],i,r,o))return!1;for(var s=1,a=n.length;s_&&Aa(t,e,n,i,u=(h+c)/2,f)&&(A=u,_=C),h=c}return isNaN(A)&&(A=r[o]),s?(s.push(A,f,_),s):[A,f,_]}function Ca(t,e,n,i,r){var o,s,a=ei([1/0,1/0,-1/0,-1/0],t,e,n,i);return!!gi(r,a)&&(s=a,(o=r)[0]<=s[0]&&s[2]<=o[2]&&o[1]<=s[1]&&s[3]<=o[3]||(a[0]>=r[0]&&a[2]<=r[2]||(a[1]>=r[1]&&a[3]<=r[3]||function(t,e,n,i,r){var o;for(e+=i;e=s&&g<=l),i||!(o&Vn)||r&Vn||(i=(y=d-(p-l)*f)>=a&&y<=u),i||!(o&Hn)||r&Hn||(i=(g=p-(d-a)/f)>=s&&g<=l),i||!(o&Un)||r&Un||(i=(y=d-(p-s)*f)>=a&&y<=u)}return i}(r,t,e)})))))}function wa(t,e,n,i,r){if(!function(t,e,n,i,r){return!!Ca(t,e,n,i,r)||(!!va(t,e,n,i,r[0],r[1])||(!!va(t,e,n,i,r[0],r[3])||(!!va(t,e,n,i,r[2],r[1])||!!va(t,e,n,i,r[2],r[3]))))}(t,e,n[0],i,r))return!1;if(1===n.length)return!0;for(var o=1,s=n.length;o0}function Ea(t,e,n,i,r){for(var o=void 0!==r&&r,s=0,a=n.length;sh&&p1&&"function"==typeof arguments[n-1]&&(e=arguments[n-1],--n);for(var i=0;i0},e.prototype.getInteracting=function(){return this.hints_[Vo]>0},e.prototype.cancelAnimations=function(){var t;this.setHint(Go,-this.hints_[Go]);for(var e=0,n=this.animations_.length;e=0;--n){for(var i=this.animations_[n],r=!0,o=0,s=i.length;o0?l/a.duration:1;u>=1?(a.complete=!0,u=1):r=!1;var h=a.easing(u);if(a.sourceCenter){var c=a.sourceCenter[0],p=a.sourceCenter[1],d=a.targetCenter[0],f=a.targetCenter[1];this.nextCenter_=a.targetCenter;var g=c+h*(d-c),y=p+h*(f-p);this.targetCenter_=[g,y]}if(a.sourceResolution&&a.targetResolution){var m=1===h?a.targetResolution:a.sourceResolution+h*(a.targetResolution-a.sourceResolution);if(a.anchor){var v=this.getViewportSize_(this.getRotation()),A=this.constraints_.resolution(m,0,v,!0);this.targetCenter_=this.calculateCenterZoom(A,a.anchor)}this.nextResolution_=a.targetResolution,this.targetResolution_=m,this.applyTargetState_(!0)}if(void 0!==a.sourceRotation&&void 0!==a.targetRotation){var _=1===h?bi(a.targetRotation+Math.PI,2*Math.PI)-Math.PI:a.sourceRotation+h*(a.targetRotation-a.sourceRotation);if(a.anchor){var C=this.constraints_.rotation(_,!0);this.targetCenter_=this.calculateCenterRotate(C,a.anchor)}this.nextRotation_=a.targetRotation,this.targetRotation_=_}if(this.applyTargetState_(!0),e=!0,!a.complete)break}}if(r){this.animations_[n]=null,this.setHint(Go,-1),this.nextCenter_=null,this.nextResolution_=NaN,this.nextRotation_=NaN;var w=i[0].callback;w&&ja(w,!0)}}this.animations_=this.animations_.filter(Boolean),e&&void 0===this.updateAnimationKey_&&(this.updateAnimationKey_=requestAnimationFrame(this.updateAnimations_.bind(this)))}},e.prototype.calculateCenterRotate=function(t,e){var n,i,r,o=this.getCenterInternal();return void 0!==o&&(jr(n=[o[0]-e[0],o[1]-e[1]],t-this.getRotation()),r=e,(i=n)[0]+=+r[0],i[1]+=+r[1]),n},e.prototype.calculateCenterZoom=function(t,e){var n,i=this.getCenterInternal(),r=this.getResolution();void 0!==i&&void 0!==r&&(n=[e[0]-t*(e[0]-i[0])/r,e[1]-t*(e[1]-i[1])/r]);return n},e.prototype.getViewportSize_=function(t){var e=this.viewportSize_;if(t){var n=e[0],i=e[1];return[Math.abs(n*Math.cos(t))+Math.abs(i*Math.sin(t)),Math.abs(n*Math.sin(t))+Math.abs(i*Math.cos(t))]}return e},e.prototype.setViewportSize=function(t){this.viewportSize_=Array.isArray(t)?t.slice():[100,100],this.getAnimating()||this.resolveConstraints(0)},e.prototype.getCenter=function(){var t=this.getCenterInternal();return t?Os(t,this.getProjection()):t},e.prototype.getCenterInternal=function(){return this.get(Ho)},e.prototype.getConstraints=function(){return this.constraints_},e.prototype.getConstrainResolution=function(){return this.options_.constrainResolution},e.prototype.getHints=function(t){return void 0!==t?(t[0]=this.hints_[0],t[1]=this.hints_[1],t):this.hints_.slice()},e.prototype.calculateExtent=function(t){return function(t,e){return Ms?ws(t,e,Ms):t}(this.calculateExtentInternal(t),this.getProjection())},e.prototype.calculateExtentInternal=function(t){var e=t||this.getViewportSizeMinusPadding_(),n=this.getCenterInternal();Pn(n,1);var i=this.getResolution();Pn(void 0!==i,2);var r=this.getRotation();return Pn(void 0!==r,3),ui(n,i,r,e)},e.prototype.getMaxResolution=function(){return this.maxResolution_},e.prototype.getMinResolution=function(){return this.minResolution_},e.prototype.getMaxZoom=function(){return this.getZoomForResolution(this.minResolution_)},e.prototype.setMaxZoom=function(t){this.applyOptions_(this.getUpdatedOptions_({maxZoom:t}))},e.prototype.getMinZoom=function(){return this.getZoomForResolution(this.maxResolution_)},e.prototype.setMinZoom=function(t){this.applyOptions_(this.getUpdatedOptions_({minZoom:t}))},e.prototype.setConstrainResolution=function(t){this.applyOptions_(this.getUpdatedOptions_({constrainResolution:t}))},e.prototype.getProjection=function(){return this.projection_},e.prototype.getResolution=function(){return this.get(Uo)},e.prototype.getResolutions=function(){return this.resolutions_},e.prototype.getResolutionForExtent=function(t,e){return this.getResolutionForExtentInternal(Ps(t,this.getProjection()),e)},e.prototype.getResolutionForExtentInternal=function(t,e){var n=e||this.getViewportSizeMinusPadding_(),i=fi(t)/n[0],r=hi(t)/n[1];return Math.max(i,r)},e.prototype.getResolutionForValueFunction=function(t){var e=t||2,n=this.getConstrainedResolution(this.maxResolution_),i=this.minResolution_,r=Math.log(n/i)/Math.log(e);return function(t){return n/Math.pow(e,t*r)}},e.prototype.getRotation=function(){return this.get(Xo)},e.prototype.getValueForResolutionFunction=function(t){var e=Math.log(t||2),n=this.getConstrainedResolution(this.maxResolution_),i=this.minResolution_,r=Math.log(n/i)/e;return function(t){return Math.log(n/t)/e/r}},e.prototype.getViewportSizeMinusPadding_=function(t){var e=this.getViewportSize_(t),n=this.padding_;return n&&(e=[e[0]-n[1]-n[3],e[1]-n[0]-n[2]]),e},e.prototype.getState=function(){var t=this.getProjection(),e=this.getResolution(),n=this.getRotation(),i=this.getCenterInternal(),r=this.padding_;if(r){var o=this.getViewportSizeMinusPadding_();i=Da(i,this.getViewportSize_(),[o[0]/2+r[3],o[1]/2+r[0]],e,n)}return{center:i.slice(0),projection:void 0!==t?t:null,resolution:e,nextCenter:this.nextCenter_,nextResolution:this.nextResolution_,nextRotation:this.nextRotation_,rotation:n,zoom:this.getZoom()}},e.prototype.getZoom=function(){var t,e=this.getResolution();return void 0!==e&&(t=this.getZoomForResolution(e)),t},e.prototype.getZoomForResolution=function(t){var e,n,i=this.minZoom_||0;if(this.resolutions_){var r=hn(this.resolutions_,t,1);i=r,e=this.resolutions_[r],n=r==this.resolutions_.length-1?2:e/this.resolutions_[r+1]}else e=this.maxResolution_,n=this.zoomFactor_;return i+Math.log(e/t)/Math.log(n)},e.prototype.getResolutionForZoom=function(t){if(this.resolutions_){if(this.resolutions_.length<=1)return 0;var e=vi(Math.floor(t),0,this.resolutions_.length-2),n=this.resolutions_[e]/this.resolutions_[e+1];return this.resolutions_[e]/Math.pow(n,vi(t-e,0,1))}return this.maxResolution_/Math.pow(this.zoomFactor_,t-this.minZoom_)},e.prototype.fit=function(t,e){var n;if(Pn(Array.isArray(t)||"function"==typeof t.getSimplifiedGeometry,24),Array.isArray(t))Pn(!yi(t),25),n=Sa(i=Ps(t,this.getProjection()));else if(t.getType()===ko){var i;(n=Sa(i=Ps(t.getExtent(),this.getProjection()))).rotate(this.getRotation(),ai(i))}else{var r=Ms;n=r?t.clone().transform(r,this.getProjection()):t}this.fitInternal(n,e)},e.prototype.rotatedExtentForGeometry=function(t){for(var e=this.getRotation(),n=Math.cos(e),i=Math.sin(-e),r=t.getFlatCoordinates(),o=t.getStride(),s=1/0,a=1/0,l=-1/0,u=-1/0,h=0,c=r.length;h0&&t[1]>0}function ka(t,e){return Array.isArray(t)?t:(void 0===e?e=[t,t]:(e[0]=t,e[1]=t),e)}var Fa=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}();var Na=function(t){function e(e){var n=t.call(this)||this;n.on,n.once,n.un;var i=function(t){var e=null;void 0!==t.keyboardEventTarget&&(e="string"==typeof t.keyboardEventTarget?document.getElementById(t.keyboardEventTarget):t.keyboardEventTarget);var n,i,r,o={},s=t.layers&&"function"==typeof t.layers.getLayers?t.layers:new lo({layers:t.layers});o[wo]=s,o[bo]=t.target,o[Eo]=t.view instanceof La?t.view:new La,void 0!==t.controls&&(Array.isArray(t.controls)?n=new oo(t.controls.slice()):(Pn("function"==typeof t.controls.getArray,47),n=t.controls));void 0!==t.interactions&&(Array.isArray(t.interactions)?i=new oo(t.interactions.slice()):(Pn("function"==typeof t.interactions.getArray,48),i=t.interactions));void 0!==t.overlays?Array.isArray(t.overlays)?r=new oo(t.overlays.slice()):(Pn("function"==typeof t.overlays.getArray,49),r=t.overlays):r=new oo;return{controls:n,interactions:i,keyboardEventTarget:e,overlays:r,values:o}}(e);n.boundHandleBrowserEvent_=n.handleBrowserEvent.bind(n),n.maxTilesLoading_=void 0!==e.maxTilesLoading?e.maxTilesLoading:16,n.pixelRatio_=void 0!==e.pixelRatio?e.pixelRatio:xn,n.postRenderTimeoutHandle_,n.animationDelayKey_,n.animationDelay_=function(){this.animationDelayKey_=void 0,this.renderFrame_(Date.now())}.bind(n),n.coordinateToPixelTransform_=[1,0,0,1,0,0],n.pixelToCoordinateTransform_=[1,0,0,1,0,0],n.frameIndex_=0,n.frameState_=null,n.previousExtent_=null,n.viewPropertyListenerKey_=null,n.viewChangeListenerKey_=null,n.layerGroupPropertyListenerKeys_=null,n.viewport_=document.createElement("div"),n.viewport_.className="ol-viewport"+("ontouchstart"in window?" ol-touch":""),n.viewport_.style.position="relative",n.viewport_.style.overflow="hidden",n.viewport_.style.width="100%",n.viewport_.style.height="100%",n.overlayContainer_=document.createElement("div"),n.overlayContainer_.style.position="absolute",n.overlayContainer_.style.zIndex="0",n.overlayContainer_.style.width="100%",n.overlayContainer_.style.height="100%",n.overlayContainer_.style.pointerEvents="none",n.overlayContainer_.className="ol-overlaycontainer",n.viewport_.appendChild(n.overlayContainer_),n.overlayContainerStopEvent_=document.createElement("div"),n.overlayContainerStopEvent_.style.position="absolute",n.overlayContainerStopEvent_.style.zIndex="0",n.overlayContainerStopEvent_.style.width="100%",n.overlayContainerStopEvent_.style.height="100%",n.overlayContainerStopEvent_.style.pointerEvents="none",n.overlayContainerStopEvent_.className="ol-overlaycontainer-stopevent",n.viewport_.appendChild(n.overlayContainerStopEvent_),n.mapBrowserEventHandler_=null,n.moveTolerance_=e.moveTolerance,n.keyboardEventTarget_=i.keyboardEventTarget,n.keyHandlerKeys_=null,n.controls=i.controls||new oo,n.interactions=i.interactions||new oo,n.overlays_=i.overlays,n.overlayIdIndex_={},n.renderer_=null,n.handleResize_,n.postRenderFunctions_=[],n.tileQueue_=new zo(n.getTilePriority.bind(n),n.handleTileChange_.bind(n)),n.addChangeListener(wo,n.handleLayerGroupChanged_),n.addChangeListener(Eo,n.handleViewChanged_),n.addChangeListener(xo,n.handleSizeChanged_),n.addChangeListener(bo,n.handleTargetChanged_),n.setProperties(i.values);var r=n;return!e.view||e.view instanceof La||e.view.then((function(t){r.setView(new La(t))})),n.controls.addEventListener(to,function(t){t.element.setMap(this)}.bind(n)),n.controls.addEventListener(eo,function(t){t.element.setMap(null)}.bind(n)),n.interactions.addEventListener(to,function(t){t.element.setMap(this)}.bind(n)),n.interactions.addEventListener(eo,function(t){t.element.setMap(null)}.bind(n)),n.overlays_.addEventListener(to,function(t){this.addOverlayInternal_(t.element)}.bind(n)),n.overlays_.addEventListener(eo,function(t){var e=t.element.getId();void 0!==e&&delete this.overlayIdIndex_[e.toString()],t.element.setMap(null)}.bind(n)),n.controls.forEach(function(t){t.setMap(this)}.bind(n)),n.interactions.forEach(function(t){t.setMap(this)}.bind(n)),n.overlays_.forEach(n.addOverlayInternal_.bind(n)),n}return Fa(e,t),e.prototype.createRenderer=function(){throw new Error("Use a map type that has a createRenderer method")},e.prototype.addControl=function(t){this.getControls().push(t)},e.prototype.addInteraction=function(t){this.getInteractions().push(t)},e.prototype.addLayer=function(t){this.getLayerGroup().getLayers().push(t)},e.prototype.addOverlay=function(t){this.getOverlays().push(t)},e.prototype.addOverlayInternal_=function(t){var e=t.getId();void 0!==e&&(this.overlayIdIndex_[e.toString()]=t),t.setMap(this)},e.prototype.disposeInternal=function(){this.setTarget(null),t.prototype.disposeInternal.call(this)},e.prototype.forEachFeatureAtPixel=function(t,e,n){if(this.frameState_){var i=this.getCoordinateFromPixelInternal(t),r=void 0!==(n=void 0!==n?n:{}).hitTolerance?n.hitTolerance:0,o=void 0!==n.layerFilter?n.layerFilter:dn,s=!1!==n.checkWrapped;return this.renderer_.forEachFeatureAtCoordinate(i,this.frameState_,r,s,e,null,o,null)}},e.prototype.getFeaturesAtPixel=function(t,e){var n=[];return this.forEachFeatureAtPixel(t,(function(t){n.push(t)}),e),n},e.prototype.forEachLayerAtPixel=function(t,e,n){if(this.frameState_){var i=n||{},r=void 0!==i.hitTolerance?i.hitTolerance:0,o=i.layerFilter||dn;return this.renderer_.forEachLayerAtPixel(t,this.frameState_,r,e,o)}},e.prototype.hasFeatureAtPixel=function(t,e){if(!this.frameState_)return!1;var n=this.getCoordinateFromPixelInternal(t),i=void 0!==(e=void 0!==e?e:{}).layerFilter?e.layerFilter:dn,r=void 0!==e.hitTolerance?e.hitTolerance:0,o=!1!==e.checkWrapped;return this.renderer_.hasFeatureAtCoordinate(n,this.frameState_,r,o,i,null)},e.prototype.getEventCoordinate=function(t){return this.getCoordinateFromPixel(this.getEventPixel(t))},e.prototype.getEventCoordinateInternal=function(t){return this.getCoordinateFromPixelInternal(this.getEventPixel(t))},e.prototype.getEventPixel=function(t){var e=this.viewport_.getBoundingClientRect(),n="changedTouches"in t?t.changedTouches[0]:t;return[n.clientX-e.left,n.clientY-e.top]},e.prototype.getTarget=function(){return this.get(bo)},e.prototype.getTargetElement=function(){var t=this.getTarget();return void 0!==t?"string"==typeof t?document.getElementById(t):t:null},e.prototype.getCoordinateFromPixel=function(t){return Os(this.getCoordinateFromPixelInternal(t),this.getView().getProjection())},e.prototype.getCoordinateFromPixelInternal=function(t){var e=this.frameState_;return e?Rn(e.pixelToCoordinateTransform,t.slice()):null},e.prototype.getControls=function(){return this.controls},e.prototype.getOverlays=function(){return this.overlays_},e.prototype.getOverlayById=function(t){var e=this.overlayIdIndex_[t.toString()];return void 0!==e?e:null},e.prototype.getInteractions=function(){return this.interactions},e.prototype.getLayerGroup=function(){return this.get(wo)},e.prototype.setLayers=function(t){var e=this.getLayerGroup();if(t instanceof oo)e.setLayers(t);else{var n=e.getLayers();n.clear(),n.extend(t)}},e.prototype.getLayers=function(){return this.getLayerGroup().getLayers()},e.prototype.getLoading=function(){for(var t=this.getLayerGroup().getLayerStatesArray(),e=0,n=t.length;e=0;a--){var l=s[a];if(l.getMap()===this&&l.getActive()&&this.getTargetElement())if(!l.handleEvent(t)||t.propagationStopped)break}}},e.prototype.handlePostRender=function(){var t=this.frameState_,e=this.tileQueue_;if(!e.isEmpty()){var n=this.maxTilesLoading_,i=n;if(t){var r=t.viewHints;if(r[Go]||r[Vo]){var o=Date.now()-t.time>8;n=o?0:8,i=o?0:2}}e.getTilesLoading()0;if(this.renderedVisible_!=n&&(this.element.style.display=n?"":"none",this.renderedVisible_=n),!pn(e,this.renderedAttributions_)){!function(t){for(;t.lastChild;)t.removeChild(t.lastChild)}(this.ulElement_);for(var i=0,r=e.length;i0&&e%(2*Math.PI)!=0?t.animate({rotation:0,duration:this.duration_,easing:Fs}):t.setRotation(0))}},e.prototype.render=function(t){var e=t.frameState;if(e){var n=e.viewState.rotation;if(n!=this.rotation_){var i="rotate("+n+"rad)";if(this.autoHide_){var r=this.element.classList.contains("ol-hidden");r||0!==n?r&&0!==n&&this.element.classList.remove("ol-hidden"):this.element.classList.add("ol-hidden")}this.label_.style.transform=i}this.rotation_=n}},e}(Ga),Ya=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),Ka=function(t){function e(e){var n=this,i=e||{};n=t.call(this,{element:document.createElement("div"),target:i.target})||this;var r=void 0!==i.className?i.className:"ol-zoom",o=void 0!==i.delta?i.delta:1,s=void 0!==i.zoomInClassName?i.zoomInClassName:r+"-in",a=void 0!==i.zoomOutClassName?i.zoomOutClassName:r+"-out",l=void 0!==i.zoomInLabel?i.zoomInLabel:"+",u=void 0!==i.zoomOutLabel?i.zoomOutLabel:"–",h=void 0!==i.zoomInTipLabel?i.zoomInTipLabel:"Zoom in",c=void 0!==i.zoomOutTipLabel?i.zoomOutTipLabel:"Zoom out",p=document.createElement("button");p.className=s,p.setAttribute("type","button"),p.title=h,p.appendChild("string"==typeof l?document.createTextNode(l):l),p.addEventListener(Ki,n.handleClick_.bind(n,o),!1);var d=document.createElement("button");d.className=a,d.setAttribute("type","button"),d.title=c,d.appendChild("string"==typeof u?document.createTextNode(u):u),d.addEventListener(Ki,n.handleClick_.bind(n,-o),!1);var f=r+" ol-unselectable ol-control",g=n.element;return g.className=f,g.appendChild(p),g.appendChild(d),n.duration_=void 0!==i.duration?i.duration:250,n}return Ya(e,t),e.prototype.handleClick_=function(t,e){e.preventDefault(),this.zoomByDelta_(t)},e.prototype.zoomByDelta_=function(t){var e=this.getMap().getView();if(e){var n=e.getZoom();if(void 0!==n){var i=e.getConstrainedZoom(n+t);this.duration_>0?(e.getAnimating()&&e.cancelAnimations(),e.animate({zoom:i,duration:this.duration_,easing:Fs})):e.setZoom(i)}}},e}(Ga);var Za="active",Wa=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}();function qa(t,e,n,i){var r=t.getZoom();if(void 0!==r){var o=t.getConstrainedZoom(r+e),s=t.getResolutionForZoom(o);t.getAnimating()&&t.cancelAnimations(),t.animate({resolution:s,anchor:n,duration:void 0!==i?i:250,easing:Fs})}}var Qa=function(t){function e(e){var n=t.call(this)||this;return n.on,n.once,n.un,e&&e.handleEvent&&(n.handleEvent=e.handleEvent),n.map_=null,n.setActive(!0),n}return Wa(e,t),e.prototype.getActive=function(){return this.get(Za)},e.prototype.getMap=function(){return this.map_},e.prototype.handleEvent=function(t){return!0},e.prototype.setActive=function(t){this.set(Za,t)},e.prototype.setMap=function(t){this.map_=t},e}(ur),Ja=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),$a=function(t){function e(e){var n=t.call(this)||this,i=e||{};return n.delta_=i.delta?i.delta:1,n.duration_=void 0!==i.duration?i.duration:250,n}return Ja(e,t),e.prototype.handleEvent=function(t){var e=!1;if(t.type==fo.DBLCLICK){var n=t.originalEvent,i=t.map,r=t.coordinate,o=n.shiftKey?-this.delta_:this.delta_;qa(i.getView(),o,r,this.duration_),n.preventDefault(),e=!0}return!e},e}(Qa),tl=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}();function el(t){for(var e=t.length,n=0,i=0,r=0;r0}}else if(t.type==fo.POINTERDOWN){var i=this.handleDownEvent(t);this.handlingDownUpSequence=i,e=this.stopDown(i)}else t.type==fo.POINTERMOVE&&this.handleMoveEvent(t);return!e},e.prototype.handleMoveEvent=function(t){},e.prototype.handleUpEvent=function(t){return!1},e.prototype.stopDown=function(t){return t},e.prototype.updateTrackedPointers_=function(t){if(function(t){var e=t.type;return e===fo.POINTERDOWN||e===fo.POINTERDRAG||e===fo.POINTERUP}(t)){var e=t.originalEvent,n=e.pointerId.toString();t.type==fo.POINTERUP?delete this.trackedPointers_[n]:(t.type==fo.POINTERDOWN||n in this.trackedPointers_)&&(this.trackedPointers_[n]=e),this.targetPointers=Bi(this.trackedPointers_)}},e}(Qa);function il(t){var e=arguments;return function(t){for(var n=!0,i=0,r=e.length;i0&&this.condition_(t)){var e=t.map.getView();return this.lastCentroid=null,e.getAnimating()&&e.cancelAnimations(),this.kinetic_&&this.kinetic_.begin(),this.noKinetic_=this.targetPointers.length>1,!0}return!1},e}(nl),gl=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),yl=function(t){function e(e){var n=this,i=e||{};return(n=t.call(this,{stopDown:fn})||this).condition_=i.condition?i.condition:rl,n.lastAngle_=void 0,n.duration_=void 0!==i.duration?i.duration:250,n}return gl(e,t),e.prototype.handleDragEvent=function(t){if(cl(t)){var e=t.map,n=e.getView();if(n.getConstraints().rotation!==Ls){var i=e.getSize(),r=t.pixel,o=Math.atan2(i[1]/2-r[1],r[0]-i[0]/2);if(void 0!==this.lastAngle_){var s=o-this.lastAngle_;n.adjustRotationInternal(-s)}this.lastAngle_=o}}},e.prototype.handleUpEvent=function(t){return!cl(t)||(t.map.getView().endInteraction(this.duration_),!1)},e.prototype.handleDownEvent=function(t){return!!cl(t)&&(!(!al(t)||!this.condition_(t))&&(t.map.getView().beginInteraction(),this.lastAngle_=void 0,!0))},e}(nl),ml=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),vl=function(t){function e(e){var n=t.call(this)||this;return n.geometry_=null,n.element_=document.createElement("div"),n.element_.style.position="absolute",n.element_.style.pointerEvents="auto",n.element_.className="ol-box "+e,n.map_=null,n.startPixel_=null,n.endPixel_=null,n}return ml(e,t),e.prototype.disposeInternal=function(){this.setMap(null)},e.prototype.render_=function(){var t=this.startPixel_,e=this.endPixel_,n=this.element_.style;n.left=Math.min(t[0],e[0])+"px",n.top=Math.min(t[1],e[1])+"px",n.width=Math.abs(e[0]-t[0])+"px",n.height=Math.abs(e[1]-t[1])+"px"},e.prototype.setMap=function(t){if(this.map_){this.map_.getOverlayContainer().removeChild(this.element_);var e=this.element_.style;e.left="inherit",e.top="inherit",e.width="inherit",e.height="inherit"}this.map_=t,this.map_&&this.map_.getOverlayContainer().appendChild(this.element_)},e.prototype.setPixels=function(t,e){this.startPixel_=t,this.endPixel_=e,this.createOrUpdateGeometry(),this.render_()},e.prototype.createOrUpdateGeometry=function(){var t=this.startPixel_,e=this.endPixel_,n=[t,[t[0],e[1]],e,[e[0],t[1]]].map(this.map_.getCoordinateFromPixelInternal,this.map_);n[4]=n[0].slice(),this.geometry_?this.geometry_.setCoordinates([n]):this.geometry_=new Pa([n])},e.prototype.getGeometry=function(){return this.geometry_},e}(ln),Al=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),_l="boxstart",Cl="boxdrag",wl="boxend",xl="boxcancel",bl=function(t){function e(e,n,i){var r=t.call(this,e)||this;return r.coordinate=n,r.mapBrowserEvent=i,r}return Al(e,t),e}(Ii),El=function(t){function e(e){var n=t.call(this)||this;n.on,n.once,n.un;var i=e||{};return n.box_=new vl(i.className||"ol-dragbox"),n.minArea_=void 0!==i.minArea?i.minArea:64,i.onBoxEnd&&(n.onBoxEnd=i.onBoxEnd),n.startPixel_=null,n.condition_=i.condition?i.condition:al,n.boxEndCondition_=i.boxEndCondition?i.boxEndCondition:n.defaultBoxEndCondition,n}return Al(e,t),e.prototype.defaultBoxEndCondition=function(t,e,n){var i=n[0]-e[0],r=n[1]-e[1];return i*i+r*r>=this.minArea_},e.prototype.getGeometry=function(){return this.box_.getGeometry()},e.prototype.handleDragEvent=function(t){this.box_.setPixels(this.startPixel_,t.pixel),this.dispatchEvent(new bl(Cl,t.coordinate,t))},e.prototype.handleUpEvent=function(t){this.box_.setMap(null);var e=this.boxEndCondition_(t,this.startPixel_,t.pixel);return e&&this.onBoxEnd(t),this.dispatchEvent(new bl(e?wl:xl,t.coordinate,t)),!1},e.prototype.handleDownEvent=function(t){return!!this.condition_(t)&&(this.startPixel_=t.pixel,this.box_.setMap(t.map),this.box_.setPixels(this.startPixel_,this.startPixel_),this.dispatchEvent(new bl(_l,t.coordinate,t)),!0)},e.prototype.onBoxEnd=function(t){},e}(nl),Ml=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),Ol=function(t){function e(e){var n=this,i=e||{},r=i.condition?i.condition:ul;return(n=t.call(this,{condition:r,className:i.className||"ol-dragzoom",minArea:i.minArea})||this).duration_=void 0!==i.duration?i.duration:200,n.out_=void 0!==i.out&&i.out,n}return Ml(e,t),e.prototype.onBoxEnd=function(t){var e=this.getMap().getView(),n=this.getGeometry();if(this.out_){var i=e.rotatedExtentForGeometry(n),r=e.getResolutionForExtentInternal(i),o=e.getResolution()/r;(n=n.clone()).scale(o*o)}e.fitInternal(n,{duration:this.duration_,easing:Fs})},e}(El),Tl=37,Pl=38,Sl=39,Rl=40,jl=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),zl=function(t){function e(e){var n=t.call(this)||this,i=e||{};return n.defaultCondition_=function(t){return ll(t)&&hl(t)},n.condition_=void 0!==i.condition?i.condition:n.defaultCondition_,n.duration_=void 0!==i.duration?i.duration:100,n.pixelDelta_=void 0!==i.pixelDelta?i.pixelDelta:128,n}return jl(e,t),e.prototype.handleEvent=function(t){var e=!1;if(t.type==Wi){var n=t.originalEvent,i=n.keyCode;if(this.condition_(t)&&(i==Rl||i==Tl||i==Sl||i==Pl)){var r=t.map.getView(),o=r.getResolution()*this.pixelDelta_,s=0,a=0;i==Rl?a=-o:i==Tl?s=-o:i==Sl?s=o:a=o;var l=[s,a];jr(l,r.getRotation()),function(t,e,n){var i=t.getCenterInternal();if(i){var r=[i[0]+e[0],i[1]+e[1]];t.animateInternal({duration:void 0!==n?n:250,easing:Bs,center:t.getConstrainedCenter(r)})}}(r,l,this.duration_),n.preventDefault(),e=!0}}return!e},e}(Qa),Dl=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),Ll=function(t){function e(e){var n=t.call(this)||this,i=e||{};return n.condition_=i.condition?i.condition:hl,n.delta_=i.delta?i.delta:1,n.duration_=void 0!==i.duration?i.duration:100,n}return Dl(e,t),e.prototype.handleEvent=function(t){var e=!1;if(t.type==Wi||t.type==qi){var n=t.originalEvent,i=n.charCode;if(this.condition_(t)&&(i=="+".charCodeAt(0)||i=="-".charCodeAt(0))){var r=t.map,o=i=="+".charCodeAt(0)?this.delta_:-this.delta_;qa(r.getView(),o,void 0,this.duration_),n.preventDefault(),e=!0}}return!e},e}(Qa),Il=function(){function t(t,e,n){this.decay_=t,this.minVelocity_=e,this.delay_=n,this.points_=[],this.angle_=0,this.initialVelocity_=0}return t.prototype.begin=function(){this.points_.length=0,this.angle_=0,this.initialVelocity_=0},t.prototype.update=function(t,e){this.points_.push(t,e,Date.now())},t.prototype.end=function(){if(this.points_.length<6)return!1;var t=Date.now()-this.delay_,e=this.points_.length-3;if(this.points_[e+2]0&&this.points_[n+2]>t;)n-=3;var i=this.points_[e+2]-this.points_[n+2];if(i<1e3/60)return!1;var r=this.points_[e]-this.points_[n],o=this.points_[e+1]-this.points_[n+1];return this.angle_=Math.atan2(o,r),this.initialVelocity_=Math.sqrt(r*r+o*o)/i,this.initialVelocity_>this.minVelocity_},t.prototype.getDistance=function(){return(this.minVelocity_-this.initialVelocity_)/this.decay_},t.prototype.getAngle=function(){return this.angle_},t}(),kl=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),Fl="trackpad",Nl="wheel",Bl=function(t){function e(e){var n=this,i=e||{};(n=t.call(this,i)||this).totalDelta_=0,n.lastDelta_=0,n.maxDelta_=void 0!==i.maxDelta?i.maxDelta:1,n.duration_=void 0!==i.duration?i.duration:250,n.timeout_=void 0!==i.timeout?i.timeout:80,n.useAnchor_=void 0===i.useAnchor||i.useAnchor,n.constrainResolution_=void 0!==i.constrainResolution&&i.constrainResolution;var r=i.condition?i.condition:sl;return n.condition_=i.onFocusOnly?il(ol,r):r,n.lastAnchor_=null,n.startTime_=void 0,n.timeoutId_,n.mode_=void 0,n.trackpadEventGap_=400,n.trackpadTimeoutId_,n.deltaPerZoom_=300,n}return kl(e,t),e.prototype.endInteraction_=function(){this.trackpadTimeoutId_=void 0,this.getMap().getView().endInteraction(void 0,this.lastDelta_?this.lastDelta_>0?1:-1:0,this.lastAnchor_)},e.prototype.handleEvent=function(t){if(!this.condition_(t))return!0;if(t.type!==tr)return!0;var e,n=t.map,i=t.originalEvent;if(i.preventDefault(),this.useAnchor_&&(this.lastAnchor_=t.coordinate),t.type==tr&&(e=i.deltaY,_n&&i.deltaMode===WheelEvent.DOM_DELTA_PIXEL&&(e/=xn),i.deltaMode===WheelEvent.DOM_DELTA_LINE&&(e*=40)),0===e)return!1;this.lastDelta_=e;var r=Date.now();void 0===this.startTime_&&(this.startTime_=r),(!this.mode_||r-this.startTime_>this.trackpadEventGap_)&&(this.mode_=Math.abs(e)<4?Fl:Nl);var o=n.getView();if(this.mode_===Fl&&!o.getConstrainResolution()&&!this.constrainResolution_)return this.trackpadTimeoutId_?clearTimeout(this.trackpadTimeoutId_):(o.getAnimating()&&o.cancelAnimations(),o.beginInteraction()),this.trackpadTimeoutId_=setTimeout(this.endInteraction_.bind(this),this.timeout_),o.adjustZoom(-e/this.deltaPerZoom_,this.lastAnchor_),this.startTime_=r,!1;this.totalDelta_+=e;var s=Math.max(this.timeout_-(r-this.startTime_),0);return clearTimeout(this.timeoutId_),this.timeoutId_=setTimeout(this.handleWheelZoom_.bind(this,n),s),!1},e.prototype.handleWheelZoom_=function(t){var e=t.getView();e.getAnimating()&&e.cancelAnimations();var n=-vi(this.totalDelta_,-this.maxDelta_*this.deltaPerZoom_,this.maxDelta_*this.deltaPerZoom_)/this.deltaPerZoom_;(e.getConstrainResolution()||this.constrainResolution_)&&(n=n?n>0?1:-1:0),qa(e,n,this.lastAnchor_,this.duration_),this.mode_=void 0,this.totalDelta_=0,this.lastAnchor_=null,this.startTime_=void 0,this.timeoutId_=void 0},e.prototype.setMouseAnchor=function(t){this.useAnchor_=t,t||(this.lastAnchor_=null)},e}(Qa),Gl=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),Vl=function(t){function e(e){var n=this,i=e||{},r=i;return r.stopDown||(r.stopDown=fn),(n=t.call(this,r)||this).anchor_=null,n.lastAngle_=void 0,n.rotating_=!1,n.rotationDelta_=0,n.threshold_=void 0!==i.threshold?i.threshold:.3,n.duration_=void 0!==i.duration?i.duration:250,n}return Gl(e,t),e.prototype.handleDragEvent=function(t){var e=0,n=this.targetPointers[0],i=this.targetPointers[1],r=Math.atan2(i.clientY-n.clientY,i.clientX-n.clientX);if(void 0!==this.lastAngle_){var o=r-this.lastAngle_;this.rotationDelta_+=o,!this.rotating_&&Math.abs(this.rotationDelta_)>this.threshold_&&(this.rotating_=!0),e=o}this.lastAngle_=r;var s=t.map,a=s.getView();if(a.getConstraints().rotation!==Ls){var l=s.getViewport().getBoundingClientRect(),u=el(this.targetPointers);u[0]-=l.left,u[1]-=l.top,this.anchor_=s.getCoordinateFromPixelInternal(u),this.rotating_&&(s.render(),a.adjustRotationInternal(e,this.anchor_))}},e.prototype.handleUpEvent=function(t){return!(this.targetPointers.length<2)||(t.map.getView().endInteraction(this.duration_),!1)},e.prototype.handleDownEvent=function(t){if(this.targetPointers.length>=2){var e=t.map;return this.anchor_=null,this.lastAngle_=void 0,this.rotating_=!1,this.rotationDelta_=0,this.handlingDownUpSequence||e.getView().beginInteraction(),!0}return!1},e}(nl),Hl=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),Ul=function(t){function e(e){var n=this,i=e||{},r=i;return r.stopDown||(r.stopDown=fn),(n=t.call(this,r)||this).anchor_=null,n.duration_=void 0!==i.duration?i.duration:400,n.lastDistance_=void 0,n.lastScaleDelta_=1,n}return Hl(e,t),e.prototype.handleDragEvent=function(t){var e=1,n=this.targetPointers[0],i=this.targetPointers[1],r=n.clientX-i.clientX,o=n.clientY-i.clientY,s=Math.sqrt(r*r+o*o);void 0!==this.lastDistance_&&(e=this.lastDistance_/s),this.lastDistance_=s;var a=t.map,l=a.getView();1!=e&&(this.lastScaleDelta_=e);var u=a.getViewport().getBoundingClientRect(),h=el(this.targetPointers);h[0]-=u.left,h[1]-=u.top,this.anchor_=a.getCoordinateFromPixelInternal(h),a.render(),l.adjustResolutionInternal(e,this.anchor_)},e.prototype.handleUpEvent=function(t){if(this.targetPointers.length<2){var e=t.map.getView(),n=this.lastScaleDelta_>1?1:-1;return e.endInteraction(this.duration_,n),!1}return!0},e.prototype.handleDownEvent=function(t){if(this.targetPointers.length>=2){var e=t.map;return this.anchor_=null,this.lastDistance_=void 0,this.lastScaleDelta_=1,this.handlingDownUpSequence||e.getView().beginInteraction(),!0}return!1},e}(nl);var Xl=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),Yl=function(t){function e(e){return(e=Fi({},e)).controls||(e.controls=function(t){var e=t||{},n=new oo;return(void 0===e.zoom||e.zoom)&&n.push(new Ka(e.zoomOptions)),(void 0===e.rotate||e.rotate)&&n.push(new Xa(e.rotateOptions)),(void 0===e.attribution||e.attribution)&&n.push(new Ha(e.attributionOptions)),n}()),e.interactions||(e.interactions=function(t){var e=t||{},n=new oo,i=new Il(-.005,.05,100);return(void 0===e.altShiftDragRotate||e.altShiftDragRotate)&&n.push(new yl),(void 0===e.doubleClickZoom||e.doubleClickZoom)&&n.push(new $a({delta:e.zoomDelta,duration:e.zoomDuration})),(void 0===e.dragPan||e.dragPan)&&n.push(new fl({onFocusOnly:e.onFocusOnly,kinetic:i})),(void 0===e.pinchRotate||e.pinchRotate)&&n.push(new Vl),(void 0===e.pinchZoom||e.pinchZoom)&&n.push(new Ul({duration:e.zoomDuration})),(void 0===e.keyboard||e.keyboard)&&(n.push(new zl),n.push(new Ll({delta:e.zoomDelta,duration:e.zoomDuration}))),(void 0===e.mouseWheelZoom||e.mouseWheelZoom)&&n.push(new Bl({onFocusOnly:e.onFocusOnly,duration:e.zoomDuration})),(void 0===e.shiftDragZoom||e.shiftDragZoom)&&n.push(new Ol({duration:e.zoomDuration})),n}({onFocusOnly:!0})),t.call(this,e)||this}return Xl(e,t),e.prototype.createRenderer=function(){return new $r(this)},e}(Na),Kl="preload",Zl="useInterimTilesOnError",Wl=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),ql=function(t){function e(e){var n=this,i=e||{},r=Fi({},i);return delete r.preload,delete r.useInterimTilesOnError,(n=t.call(this,r)||this).on,n.once,n.un,n.setPreload(void 0!==i.preload?i.preload:0),n.setUseInterimTilesOnError(void 0===i.useInterimTilesOnError||i.useInterimTilesOnError),n}return Wl(e,t),e.prototype.getPreload=function(){return this.get(Kl)},e.prototype.setPreload=function(t){this.set(Kl,t)},e.prototype.getUseInterimTilesOnError=function(){return this.get(Zl)},e.prototype.setUseInterimTilesOnError=function(t){this.set(Zl,t)},e}(Sr),Ql=0,Jl=1,$l=2,tu=3,eu=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),nu=function(t){function e(e){var n=t.call(this)||this;return n.boundHandleImageChange_=n.handleImageChange_.bind(n),n.layer_=e,n.declutterExecutorGroup=null,n}return eu(e,t),e.prototype.getFeatures=function(t){return yn()},e.prototype.prepareFrame=function(t){return yn()},e.prototype.renderFrame=function(t,e){return yn()},e.prototype.loadedTileCallback=function(t,e,n){t[e]||(t[e]={}),t[e][n.tileCoord.toString()]=n},e.prototype.createLoadedTileFinder=function(t,e,n){return function(i,r){var o=this.loadedTileCallback.bind(this,n,i);return t.forEachLoadedTile(e,i,r,o)}.bind(this)},e.prototype.forEachFeatureAtCoordinate=function(t,e,n,i,r){},e.prototype.getDataAtPixel=function(t,e,n){return null},e.prototype.getLayer=function(){return this.layer_},e.prototype.handleFontsChanged=function(){},e.prototype.handleImageChange_=function(t){t.target.getState()===$l&&this.renderIfReadyAndVisible()},e.prototype.loadImage=function(t){var e=t.getState();return e!=$l&&e!=tu&&t.addEventListener(Ui,this.boundHandleImageChange_),e==Ql&&(t.load(),e=t.getState()),e==$l},e.prototype.renderIfReadyAndVisible=function(){var t=this.getLayer();t.getVisible()&&t.getSourceState()==Or&&t.changed()},e}(sr),iu=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),ru=function(t){function e(e){var n=t.call(this,e)||this;return n.container=null,n.renderedResolution,n.tempTransform=[1,0,0,1,0,0],n.pixelTransform=[1,0,0,1,0,0],n.inversePixelTransform=[1,0,0,1,0,0],n.context=null,n.containerReused=!1,n}return iu(e,t),e.prototype.useContainer=function(t,e,n){var i,r,o=this.getLayer().getClassName();t&&t.style.opacity===Vr(n)&&t.className===o&&((a=t.firstElementChild)instanceof HTMLCanvasElement&&(r=a.getContext("2d")));if(r&&r.canvas.style.transform===e?(this.container=t,this.context=r,this.containerReused=!0):this.containerReused&&(this.container=null,this.context=null,this.containerReused=!1),!this.container){(i=document.createElement("div")).className=o;var s=i.style;s.position="absolute",s.width="100%",s.height="100%";var a=(r=Hr()).canvas;i.appendChild(a),(s=a.style).position="absolute",s.left="0",s.transformOrigin="top left",this.container=i,this.context=r}},e.prototype.clipUnrotated=function(t,e,n){var i=pi(n),r=di(n),o=si(n),s=oi(n);Rn(e.coordinateToPixelTransform,i),Rn(e.coordinateToPixelTransform,r),Rn(e.coordinateToPixelTransform,o),Rn(e.coordinateToPixelTransform,s);var a=this.inversePixelTransform;Rn(a,i),Rn(a,r),Rn(a,o),Rn(a,s),t.save(),t.beginPath(),t.moveTo(Math.round(i[0]),Math.round(i[1])),t.lineTo(Math.round(r[0]),Math.round(r[1])),t.lineTo(Math.round(o[0]),Math.round(o[1])),t.lineTo(Math.round(s[0]),Math.round(s[1])),t.clip()},e.prototype.dispatchRenderEvent_=function(t,e,n){var i=this.getLayer();if(i.hasListener(t)){var r=new Fr(t,this.inversePixelTransform,n,e);i.dispatchEvent(r)}},e.prototype.preRender=function(t,e){this.dispatchRenderEvent_(Cr,t,e)},e.prototype.postRender=function(t,e){this.dispatchRenderEvent_(wr,t,e)},e.prototype.getRenderTransform=function(t,e,n,i,r,o,s){var a=r/2,l=o/2,u=i/e,h=-u,c=-t[0]+s,p=-t[1];return jn(this.tempTransform,a,l,u,h,-n,c,p)},e.prototype.getDataAtPixel=function(t,e,n){var i,r=Rn(this.inversePixelTransform,t.slice()),o=this.context,s=this.getLayer().getExtent();if(s&&!Kn(s,Rn(e.pixelToCoordinateTransform,t.slice())))return null;try{var a=Math.round(r[0]),l=Math.round(r[1]),u=document.createElement("canvas"),h=u.getContext("2d");u.width=1,u.height=1,h.clearRect(0,0,1,1),h.drawImage(o.canvas,a,l,1,1,0,0,1,1),i=h.getImageData(0,0,1,1).data}catch(t){return"SecurityError"===t.name?new Uint8Array:i}return 0===i[3]?null:i},e}(nu),ou=function(){function t(t,e,n,i){this.minX=t,this.maxX=e,this.minY=n,this.maxY=i}return t.prototype.contains=function(t){return this.containsXY(t[1],t[2])},t.prototype.containsTileRange=function(t){return this.minX<=t.minX&&t.maxX<=this.maxX&&this.minY<=t.minY&&t.maxY<=this.maxY},t.prototype.containsXY=function(t,e){return this.minX<=t&&t<=this.maxX&&this.minY<=e&&e<=this.maxY},t.prototype.equals=function(t){return this.minX==t.minX&&this.minY==t.minY&&this.maxX==t.maxX&&this.maxY==t.maxY},t.prototype.extend=function(t){t.minXthis.maxX&&(this.maxX=t.maxX),t.minYthis.maxY&&(this.maxY=t.maxY)},t.prototype.getHeight=function(){return this.maxY-this.minY+1},t.prototype.getSize=function(){return[this.getWidth(),this.getHeight()]},t.prototype.getWidth=function(){return this.maxX-this.minX+1},t.prototype.intersects=function(t){return this.minX<=t.maxX&&this.maxX>=t.minX&&this.minY<=t.maxY&&this.maxY>=t.minY},t}();function su(t,e,n,i,r){return void 0!==r?(r.minX=t,r.maxX=e,r.minY=n,r.maxY=i,r):new ou(t,e,n,i)}var au=ou,lu=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),uu=function(t){function e(e){var n=t.call(this,e)||this;return n.extentChanged=!0,n.renderedExtent_=null,n.renderedPixelRatio,n.renderedProjection=null,n.renderedRevision,n.renderedTiles=[],n.newTiles_=!1,n.tmpExtent=[1/0,1/0,-1/0,-1/0],n.tmpTileRange_=new au(0,0,0,0),n}return lu(e,t),e.prototype.isDrawableTile=function(t){var e=this.getLayer(),n=t.getState(),i=e.getUseInterimTilesOnError();return n==Po||n==Ro||n==So&&!i},e.prototype.getTile=function(t,e,n,i){var r=i.pixelRatio,o=i.viewState.projection,s=this.getLayer(),a=s.getSource().getTile(t,e,n,r,o);return a.getState()==So&&(s.getUseInterimTilesOnError()?s.getPreload()>0&&(this.newTiles_=!0):a.setState(Po)),this.isDrawableTile(a)||(a=a.getInterimTile()),a},e.prototype.loadedTileCallback=function(e,n,i){return!!this.isDrawableTile(i)&&t.prototype.loadedTileCallback.call(this,e,n,i)},e.prototype.prepareFrame=function(t){return!!this.getLayer().getSource()},e.prototype.renderFrame=function(t,e){var n=t.layerStatesArray[t.layerIndex],i=t.viewState,r=i.projection,o=i.resolution,s=i.center,a=i.rotation,l=t.pixelRatio,u=this.getLayer(),h=u.getSource(),c=h.getRevision(),p=h.getTileGridForProjection(r),d=p.getZForResolution(o,h.zDirection),f=p.getResolution(d),g=t.extent,y=n.extent&&Ps(n.extent,r);y&&(g=ci(g,Ps(n.extent,r)));var m=h.getTilePixelRatio(l),v=Math.round(t.size[0]*m),A=Math.round(t.size[1]*m);if(a){var _=Math.round(Math.sqrt(v*v+A*A));v=_,A=_}var C=f*v/2/m,w=f*A/2/m,x=[s[0]-C,s[1]-w,s[0]+C,s[1]+w],b=p.getTileRangeForExtentAndZ(g,d),E={};E[d]={};var M=this.createLoadedTileFinder(h,r,E),O=this.tmpExtent,T=this.tmpTileRange_;this.newTiles_=!1;for(var P=b.minX;P<=b.maxX;++P)for(var S=b.minY;S<=b.maxY;++S){var R=this.getTile(d,P,S,t);if(this.isDrawableTile(R)){var j=vn(this);if(R.getState()==Po){E[d][R.tileCoord.toString()]=R;var z=R.inTransition(j);this.newTiles_||!z&&-1!==this.renderedTiles.indexOf(R)||(this.newTiles_=!0)}if(1===R.getAlpha(j,t.time))continue}var D=p.getTileCoordChildTileRange(R.tileCoord,T,O),L=!1;D&&(L=M(d+1,D)),L||p.forEachTileCoordParentTileRange(R.tileCoord,M,T,O)}var I=f/o;jn(this.pixelTransform,t.size[0]/2,t.size[1]/2,1/m,1/m,a,-v/2,-A/2);var k=Dn(this.pixelTransform);this.useContainer(e,k,n.opacity);var F=this.context,N=F.canvas;zn(this.inversePixelTransform,this.pixelTransform),jn(this.tempTransform,v/2,A/2,I,I,0,-v/2,-A/2),N.width!=v||N.height!=A?(N.width=v,N.height=A):this.containerReused||F.clearRect(0,0,v,A),y&&this.clipUnrotated(F,t,y),Fi(F,h.getContextOptions()),this.preRender(F,t),this.renderedTiles.length=0;var B,G,V,H=Object.keys(E).map(Number);H.sort(un),1!==n.opacity||this.containerReused&&!h.getOpaque(t.viewState.projection)?(B=[],G=[]):H=H.reverse();for(var U=H.length-1;U>=0;--U){var X=H[U],Y=h.getTilePixelSize(X,l,r),K=p.getResolution(X)/f,Z=Y[0]*K*I,W=Y[1]*K*I,q=p.getTileCoordForCoordAndZ(pi(x),X),Q=p.getTileCoordExtent(q),J=Rn(this.tempTransform,[m*(Q[0]-x[0])/f,m*(x[3]-Q[3])/f]),$=m*h.getGutterForProjection(r),tt=E[X];for(var et in tt){var nt=(R=tt[et]).tileCoord,it=q[1]-nt[1],rt=Math.round(J[0]-(it-1)*Z),ot=q[2]-nt[2],st=Math.round(J[1]-(ot-1)*W),at=rt-(P=Math.round(J[0]-it*Z)),lt=st-(S=Math.round(J[1]-ot*W)),ut=d===X;if(!(z=ut&&1!==R.getAlpha(vn(this),t.time)))if(B){F.save(),V=[P,S,P+at,S,P+at,S+lt,P,S+lt];for(var ht=0,ct=B.length;htt)throw new Error("Tile load sequence violation");this.state=t,this.changed()},e.prototype.load=function(){yn()},e.prototype.getAlpha=function(t,e){if(!this.transition_)return 1;var n=this.transitionStarts_[t];if(n){if(-1===n)return 1}else n=e,this.transitionStarts_[t]=n;var i=e-n+1e3/60;return i>=this.transition_?1:ks(i/this.transition_)},e.prototype.inTransition=function(t){return!!this.transition_&&-1!==this.transitionStarts_[t]},e.prototype.endTransition=function(t){this.transition_&&(this.transitionStarts_[t]=-1)},e}(Hi),gu=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),yu=function(t){function e(e,n,i,r){var o=t.call(this)||this;return o.extent=e,o.pixelRatio_=i,o.resolution=n,o.state=r,o}return gu(e,t),e.prototype.changed=function(){this.dispatchEvent(Ui)},e.prototype.getExtent=function(){return this.extent},e.prototype.getImage=function(){return yn()},e.prototype.getPixelRatio=function(){return this.pixelRatio_},e.prototype.getResolution=function(){return this.resolution},e.prototype.getState=function(){return this.state},e.prototype.load=function(){yn()},e}(Hi),mu=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}();function vu(t,e,n){var i=t;if(i.src&&En){var r=i.decode(),o=!0;return r.then((function(){o&&e()})).catch((function(t){o&&("EncodingError"===t.name&&"Invalid image type."===t.message?e():n())})),function(){o=!1}}var s=[nr(i,Qi,e),nr(i,Xi,n)];return function(){s.forEach(ir)}}!function(t){function e(e,n,i,r,o,s){var a=t.call(this,e,n,i,Ql)||this;return a.src_=r,a.image_=new Image,null!==o&&(a.image_.crossOrigin=o),a.unlisten_=null,a.state=Ql,a.imageLoadFunction_=s,a}mu(e,t),e.prototype.getImage=function(){return this.image_},e.prototype.handleImageError_=function(){this.state=tu,this.unlistenImage_(),this.changed()},e.prototype.handleImageLoad_=function(){void 0===this.resolution&&(this.resolution=hi(this.extent)/this.image_.height),this.state=$l,this.unlistenImage_(),this.changed()},e.prototype.load=function(){this.state!=Ql&&this.state!=tu||(this.state=Jl,this.changed(),this.imageLoadFunction_(this,this.src_),this.unlisten_=vu(this.image_,this.handleImageLoad_.bind(this),this.handleImageError_.bind(this)))},e.prototype.setImage=function(t){this.image_=t,this.resolution=hi(this.extent)/this.image_.height},e.prototype.unlistenImage_=function(){this.unlisten_&&(this.unlisten_(),this.unlisten_=null)}}(yu);var Au=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}();var _u,Cu=function(t){function e(e,n,i,r,o,s){var a=t.call(this,e,n,s)||this;return a.crossOrigin_=r,a.src_=i,a.key=i,a.image_=new Image,null!==r&&(a.image_.crossOrigin=r),a.unlisten_=null,a.tileLoadFunction_=o,a}return Au(e,t),e.prototype.getImage=function(){return this.image_},e.prototype.setImage=function(t){this.image_=t,this.state=Po,this.unlistenImage_(),this.changed()},e.prototype.handleImageError_=function(){var t;this.state=So,this.unlistenImage_(),this.image_=((t=Hr(1,1)).fillStyle="rgba(0,0,0,0)",t.fillRect(0,0,1,1),t.canvas),this.changed()},e.prototype.handleImageLoad_=function(){var t=this.image_;t.naturalWidth&&t.naturalHeight?this.state=Po:this.state=Ro,this.unlistenImage_(),this.changed()},e.prototype.load=function(){this.state==So&&(this.state=Oo,this.image_=new Image,null!==this.crossOrigin_&&(this.image_.crossOrigin=this.crossOrigin_)),this.state==Oo&&(this.state=To,this.changed(),this.tileLoadFunction_(this,this.src_),this.unlisten_=vu(this.image_,this.handleImageLoad_.bind(this),this.handleImageError_.bind(this)))},e.prototype.unlistenImage_=function(){this.unlisten_&&(this.unlisten_(),this.unlisten_=null)},e}(fu),wu=function(){function t(t,e,n,i,r,o){this.sourceProj_=t,this.targetProj_=e;var s={},a=_s(this.targetProj_,this.sourceProj_);this.transformInv_=function(t){var e=t[0]+"/"+t[1];return s[e]||(s[e]=a(t)),s[e]},this.maxSourceExtent_=i,this.errorThresholdSquared_=r*r,this.triangles_=[],this.wrapsXInSource_=!1,this.canWrapXInSource_=this.sourceProj_.canWrapX()&&!!i&&!!this.sourceProj_.getExtent()&&fi(i)==fi(this.sourceProj_.getExtent()),this.sourceWorldWidth_=this.sourceProj_.getExtent()?fi(this.sourceProj_.getExtent()):null,this.targetWorldWidth_=this.targetProj_.getExtent()?fi(this.targetProj_.getExtent()):null;var l=pi(n),u=di(n),h=si(n),c=oi(n),p=this.transformInv_(l),d=this.transformInv_(u),f=this.transformInv_(h),g=this.transformInv_(c),y=10+(o?Math.max(0,Math.ceil(_i(ri(n)/(o*o*256*256)))):0);if(this.addQuad_(l,u,h,c,p,d,f,g,y),this.wrapsXInSource_){var m=1/0;this.triangles_.forEach((function(t,e,n){m=Math.min(m,t.source[0][0],t.source[1][0],t.source[2][0])})),this.triangles_.forEach(function(t){if(Math.max(t.source[0][0],t.source[1][0],t.source[2][0])-m>this.sourceWorldWidth_/2){var e=[[t.source[0][0],t.source[0][1]],[t.source[1][0],t.source[1][1]],[t.source[2][0],t.source[2][1]]];e[0][0]-m>this.sourceWorldWidth_/2&&(e[0][0]-=this.sourceWorldWidth_),e[1][0]-m>this.sourceWorldWidth_/2&&(e[1][0]-=this.sourceWorldWidth_),e[2][0]-m>this.sourceWorldWidth_/2&&(e[2][0]-=this.sourceWorldWidth_);var n=Math.min(e[0][0],e[1][0],e[2][0]);Math.max(e[0][0],e[1][0],e[2][0])-n.5&&h<1,d=!1;if(l>0){if(this.targetProj_.isGlobal()&&this.targetWorldWidth_)d=fi(Xn([t,e,n,i]))/this.targetWorldWidth_>.25||d;!p&&this.sourceProj_.isGlobal()&&h&&(d=h>.25||d)}if(!(!d&&this.maxSourceExtent_&&isFinite(u[0])&&isFinite(u[1])&&isFinite(u[2])&&isFinite(u[3]))||gi(u,this.maxSourceExtent_)){var f=0;if(!(d||isFinite(r[0])&&isFinite(r[1])&&isFinite(o[0])&&isFinite(o[1])&&isFinite(s[0])&&isFinite(s[1])&&isFinite(a[0])&&isFinite(a[1])))if(l>0)d=!0;else if(1!=(f=(isFinite(r[0])&&isFinite(r[1])?0:8)+(isFinite(o[0])&&isFinite(o[1])?0:4)+(isFinite(s[0])&&isFinite(s[1])?0:2)+(isFinite(a[0])&&isFinite(a[1])?0:1))&&2!=f&&4!=f&&8!=f)return;if(l>0){if(!d){var g=[(t[0]+n[0])/2,(t[1]+n[1])/2],y=this.transformInv_(g),m=void 0;if(p)m=(bi(r[0],c)+bi(s[0],c))/2-bi(y[0],c);else m=(r[0]+s[0])/2-y[0];var v=(r[1]+s[1])/2-y[1];d=m*m+v*v>this.errorThresholdSquared_}if(d){if(Math.abs(t[0]-n[0])<=Math.abs(t[1]-n[1])){var A=[(e[0]+n[0])/2,(e[1]+n[1])/2],_=this.transformInv_(A),C=[(i[0]+t[0])/2,(i[1]+t[1])/2],w=this.transformInv_(C);this.addQuad_(t,e,A,C,r,o,_,w,l-1),this.addQuad_(C,A,n,i,w,_,s,a,l-1)}else{var x=[(t[0]+e[0])/2,(t[1]+e[1])/2],b=this.transformInv_(x),E=[(n[0]+i[0])/2,(n[1]+i[1])/2],M=this.transformInv_(E);this.addQuad_(t,x,E,i,r,b,M,a,l-1),this.addQuad_(x,e,n,E,b,o,s,M,l-1)}return}}if(p){if(!this.canWrapXInSource_)return;this.wrapsXInSource_=!0}0==(11&f)&&this.addTriangle_(t,n,i,r,s,a),0==(14&f)&&this.addTriangle_(t,n,e,r,s,o),f&&(0==(13&f)&&this.addTriangle_(e,i,t,o,a,r),0==(7&f)&&this.addTriangle_(e,i,n,o,a,s))}},t.prototype.calculateSourceExtent=function(){var t=[1/0,1/0,-1/0,-1/0];return this.triangles_.forEach((function(e,n,i){var r=e.source;ti(t,r[0]),ti(t,r[1]),ti(t,r[2])})),t},t.prototype.getTriangles=function(){return this.triangles_},t}(),xu={imageSmoothingEnabled:!1,msImageSmoothingEnabled:!1};function bu(t,e,n,i,r){t.beginPath(),t.moveTo(0,0),t.lineTo(e,n),t.lineTo(i,r),t.closePath(),t.save(),t.clip(),t.fillRect(0,0,Math.max(e,i)+1,Math.max(n,r)),t.restore()}function Eu(t,e){return Math.abs(t[4*e]-210)>2||Math.abs(t[4*e+3]-191.25)>2}function Mu(t,e,n,i){var r=Cs(n,e,t),o=gs(e,i,n),s=e.getMetersPerUnit();void 0!==s&&(o*=s);var a=t.getMetersPerUnit();void 0!==a&&(o/=a);var l=t.getExtent();if(!l||Kn(l,r)){var u=gs(t,o,r)/o;isFinite(u)&&u>0&&(o/=u)}return o}function Ou(t,e,n,i,r,o,s,a,l,u,h,c){var p=Hr(Math.round(n*t),Math.round(n*e));if(Fi(p,c),0===l.length)return p.canvas;function d(t){return Math.round(t*n)/n}p.scale(n,n),p.globalCompositeOperation="lighter";var f=[1/0,1/0,-1/0,-1/0];l.forEach((function(t,e,n){var i,r;i=f,(r=t.extent)[0]i[2]&&(i[2]=r[2]),r[1]i[3]&&(i[3]=r[3])}));var g=fi(f),y=hi(f),m=Hr(Math.round(n*g/i),Math.round(n*y/i));Fi(m,c);var v=n/i;l.forEach((function(t,e,n){var i=t.extent[0]-f[0],r=-(t.extent[3]-f[3]),o=fi(t.extent),s=hi(t.extent);t.image.width>0&&t.image.height>0&&m.drawImage(t.image,u,u,t.image.width-2*u,t.image.height-2*u,i*v,r*v,o*v,s*v)}));var A=pi(s);return a.getTriangles().forEach((function(t,e,r){var s=t.source,a=t.target,l=s[0][0],u=s[0][1],h=s[1][0],g=s[1][1],y=s[2][0],v=s[2][1],_=d((a[0][0]-A[0])/o),C=d(-(a[0][1]-A[1])/o),w=d((a[1][0]-A[0])/o),x=d(-(a[1][1]-A[1])/o),b=d((a[2][0]-A[0])/o),E=d(-(a[2][1]-A[1])/o),M=l,O=u;l=0,u=0;var T=function(t){for(var e=t.length,n=0;nr&&(r=s,i=o)}if(0===r)return null;var a=t[i];t[i]=t[n],t[n]=a;for(var l=n+1;l=0;p--){c[p]=t[p][e]/t[p][p];for(var d=p-1;d>=0;d--)t[d][e]-=t[d][p]*c[p]}return c}([[h-=M,g-=O,0,0,w-_],[y-=M,v-=O,0,0,b-_],[0,0,h,g,x-C],[0,0,y,v,E-C]]);if(T){if(p.save(),p.beginPath(),function(){if(void 0===_u){var t=document.createElement("canvas").getContext("2d");t.globalCompositeOperation="lighter",t.fillStyle="rgba(210, 0, 0, 0.75)",bu(t,4,5,4,0),bu(t,4,5,0,5);var e=t.getImageData(0,0,3,3).data;_u=Eu(e,0)||Eu(e,4)||Eu(e,8)}return _u}()||c===xu){p.moveTo(w,x);for(var P=_-w,S=C-x,R=0;R<4;R++)p.lineTo(w+d((R+1)*P/4),x+d(R*S/3)),3!=R&&p.lineTo(w+d((R+1)*P/4),x+d((R+1)*S/3));p.lineTo(b,E)}else p.moveTo(w,x),p.lineTo(_,C),p.lineTo(b,E);p.clip(),p.transform(T[0],T[2],T[1],T[3],_,C),p.translate(f[0]-M,f[3]-O),p.scale(i/n,-i/n),p.drawImage(m.canvas,0,0),p.restore()}})),h&&(p.save(),p.globalCompositeOperation="source-over",p.strokeStyle="black",p.lineWidth=1,a.getTriangles().forEach((function(t,e,n){var i=t.target,r=(i[0][0]-A[0])/o,s=-(i[0][1]-A[1])/o,a=(i[1][0]-A[0])/o,l=-(i[1][1]-A[1])/o,u=(i[2][0]-A[0])/o,h=-(i[2][1]-A[1])/o;p.beginPath(),p.moveTo(a,l),p.lineTo(r,s),p.lineTo(u,h),p.closePath(),p.stroke()})),p.restore()),p.canvas}var Tu=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),Pu=function(t){function e(e,n,i,r,o,s,a,l,u,h,c,p){var d=t.call(this,o,Oo)||this;d.renderEdges_=void 0!==c&&c,d.contextOptions_=p,d.pixelRatio_=a,d.gutter_=l,d.canvas_=null,d.sourceTileGrid_=n,d.targetTileGrid_=r,d.wrappedTileCoord_=s||o,d.sourceTiles_=[],d.sourcesListenerKeys_=null,d.sourceZ_=0;var f=r.getTileCoordExtent(d.wrappedTileCoord_),g=d.targetTileGrid_.getExtent(),y=d.sourceTileGrid_.getExtent(),m=g?ci(f,g):f;if(0===ri(m))return d.state=Ro,d;var v=e.getExtent();v&&(y=y?ci(y,v):v);var A=r.getResolution(d.wrappedTileCoord_[0]),_=function(t,e,n,i){var r=ai(n),o=Mu(t,e,r,i);return(!isFinite(o)||o<=0)&&ii(n,(function(n){return o=Mu(t,e,n,i),isFinite(o)&&o>0})),o}(e,i,m,A);if(!isFinite(_)||_<=0)return d.state=Ro,d;var C=void 0!==h?h:.5;if(d.triangulation_=new wu(e,i,m,y,_*C,A),0===d.triangulation_.getTriangles().length)return d.state=Ro,d;d.sourceZ_=n.getZForResolution(_);var w=d.triangulation_.calculateSourceExtent();if(y&&(e.canWrapX()?(w[1]=vi(w[1],y[1],y[3]),w[3]=vi(w[3],y[1],y[3])):w=ci(w,y)),ri(w)){for(var x=n.getTileRangeForExtentAndZ(w,d.sourceZ_),b=x.minX;b<=x.maxX;b++)for(var E=x.minY;E<=x.maxY;E++){var M=u(d.sourceZ_,b,E,a);M&&d.sourceTiles_.push(M)}0===d.sourceTiles_.length&&(d.state=Ro)}else d.state=Ro;return d}return Tu(e,t),e.prototype.getImage=function(){return this.canvas_},e.prototype.reproject_=function(){var t=[];if(this.sourceTiles_.forEach(function(e,n,i){e&&e.getState()==Po&&t.push({extent:this.sourceTileGrid_.getTileCoordExtent(e.tileCoord),image:e.getImage()})}.bind(this)),this.sourceTiles_.length=0,0===t.length)this.state=So;else{var e=this.wrappedTileCoord_[0],n=this.targetTileGrid_.getTileSize(e),i="number"==typeof n?n:n[0],r="number"==typeof n?n:n[1],o=this.targetTileGrid_.getResolution(e),s=this.sourceTileGrid_.getResolution(this.sourceZ_),a=this.targetTileGrid_.getTileCoordExtent(this.wrappedTileCoord_);this.canvas_=Ou(i,r,this.pixelRatio_,s,this.sourceTileGrid_.getExtent(),o,a,this.triangulation_,t,this.gutter_,this.renderEdges_,this.contextOptions_),this.state=Po}this.changed()},e.prototype.load=function(){if(this.state==Oo){this.state=To,this.changed();var t=0;this.sourcesListenerKeys_=[],this.sourceTiles_.forEach(function(e,n,i){var r=e.getState();if(r==Oo||r==To){t++;var o=er(e,Ui,(function(n){var i=e.getState();i!=Po&&i!=So&&i!=Ro||(ir(o),0===--t&&(this.unlistenSources_(),this.reproject_()))}),this);this.sourcesListenerKeys_.push(o)}}.bind(this)),0===t?setTimeout(this.reproject_.bind(this),0):this.sourceTiles_.forEach((function(t,e,n){t.getState()==Oo&&t.load()}))}},e.prototype.unlistenSources_=function(){this.sourcesListenerKeys_.forEach(ir),this.sourcesListenerKeys_=null},e}(fu),Su=function(){function t(t){this.highWaterMark=void 0!==t?t:2048,this.count_=0,this.entries_={},this.oldest_=null,this.newest_=null}return t.prototype.canExpireCache=function(){return this.highWaterMark>0&&this.getCount()>this.highWaterMark},t.prototype.clear=function(){this.count_=0,this.entries_={},this.oldest_=null,this.newest_=null},t.prototype.containsKey=function(t){return this.entries_.hasOwnProperty(t)},t.prototype.forEach=function(t){for(var e=this.oldest_;e;)t(e.value_,e.key_,this),e=e.newer},t.prototype.get=function(t,e){var n=this.entries_[t];return Pn(void 0!==n,15),n===this.newest_||(n===this.oldest_?(this.oldest_=this.oldest_.newer,this.oldest_.older=null):(n.newer.older=n.older,n.older.newer=n.newer),n.newer=null,n.older=this.newest_,this.newest_.newer=n,this.newest_=n),n.value_},t.prototype.remove=function(t){var e=this.entries_[t];return Pn(void 0!==e,15),e===this.newest_?(this.newest_=e.older,this.newest_&&(this.newest_.newer=null)):e===this.oldest_?(this.oldest_=e.newer,this.oldest_&&(this.oldest_.older=null)):(e.newer.older=e.older,e.older.newer=e.newer),delete this.entries_[t],--this.count_,e.value_},t.prototype.getCount=function(){return this.count_},t.prototype.getKeys=function(){var t,e=new Array(this.count_),n=0;for(t=this.newest_;t;t=t.older)e[n++]=t.key_;return e},t.prototype.getValues=function(){var t,e=new Array(this.count_),n=0;for(t=this.newest_;t;t=t.older)e[n++]=t.value_;return e},t.prototype.peekLast=function(){return this.oldest_.value_},t.prototype.peekLastKey=function(){return this.oldest_.key_},t.prototype.peekFirstKey=function(){return this.newest_.key_},t.prototype.pop=function(){var t=this.oldest_;return delete this.entries_[t.key_],t.newer&&(t.newer.older=null),this.oldest_=t.newer,this.oldest_||(this.newest_=null),--this.count_,t.value_},t.prototype.replace=function(t,e){this.get(t),this.entries_[t].value_=e},t.prototype.set=function(t,e){Pn(!(t in this.entries_),16);var n={key_:t,newer:null,older:this.newest_,value_:e};this.newest_?this.newest_.newer=n:this.oldest_=n,this.newest_=n,this.entries_[t]=n,++this.count_},t.prototype.setSize=function(t){this.highWaterMark=t},t}();function Ru(t,e,n,i){return void 0!==i?(i[0]=t,i[1]=e,i[2]=n,i):[t,e,n]}function ju(t,e,n){return t+"/"+e+"/"+n}function zu(t){return ju(t[0],t[1],t[2])}var Du=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}(),Lu=function(t){function e(){return null!==t&&t.apply(this,arguments)||this}return Du(e,t),e.prototype.expireCache=function(t){for(;this.canExpireCache();){if(this.peekLast().getKey()in t)break;this.pop().release()}},e.prototype.pruneExceptNewestZ=function(){if(0!==this.getCount()){var t=function(t){return t.split("/").map(Number)}(this.peekFirstKey())[0];this.forEach(function(e){e.tileCoord[0]!==t&&(this.remove(zu(e.tileCoord)),e.release())}.bind(this))}},e}(Su),Iu="tileloadstart",ku="tileloadend",Fu="tileloaderror",Nu=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&(t[n]=e[n])})(e,n)};return function(e,n){if("function"!=typeof n&&null!==n)throw new TypeError("Class extends value "+String(n)+" is not a constructor or null");function i(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(i.prototype=n.prototype,new i)}}();function Bu(t){return t?Array.isArray(t)?function(e){return t}:"function"==typeof t?t:function(e){return[t]}:null}var Gu=function(t){function e(e){var n=t.call(this)||this;n.projection=fs(e.projection),n.attributions_=Bu(e.attributions),n.attributionsCollapsible_=void 0===e.attributionsCollapsible||e.attributionsCollapsible,n.loading=!1,n.state_=void 0!==e.state?e.state:Or,n.wrapX_=void 0!==e.wrapX&&e.wrapX,n.viewResolver=null,n.viewRejector=null;var i=n;return n.viewPromise_=new Promise((function(t,e){i.viewResolver=t,i.viewRejector=e})),n}return Nu(e,t),e.prototype.getAttributions=function(){return this.attributions_},e.prototype.getAttributionsCollapsible=function(){return this.attributionsCollapsible_},e.prototype.getProjection=function(){return this.projection},e.prototype.getResolutions=function(){return yn()},e.prototype.getView=function(){return this.viewPromise_},e.prototype.getState=function(){return this.state_},e.prototype.getWrapX=function(){return this.wrapX_},e.prototype.getContextOptions=function(){},e.prototype.refresh=function(){this.changed()},e.prototype.setAttributions=function(t){this.attributions_=Bu(t),this.changed()},e.prototype.setState=function(t){this.state_=t,this.changed()},e}(ur),Vu=[0,0,0],Hu=function(){function t(t){var e,n,i,r;if(this.minZoom=void 0!==t.minZoom?t.minZoom:0,this.resolutions_=t.resolutions,Pn((e=this.resolutions_,n=!0,i=function(t,e){return e-t}||un,e.every((function(t,r){if(0===r)return!0;var o=i(e[r-1],t);return!(o>0||n&&0===o)}))),17),!t.origins)for(var o=0,s=this.resolutions_.length-1;o=this.minZoom;){if(e(a,2===this.zoomFactor_?su(r=Math.floor(r/2),r,o=Math.floor(o/2),o,n):this.getTileRangeForExtentAndZ(s,a,n)))return!0;--a}return!1},t.prototype.getExtent=function(){return this.extent_},t.prototype.getMaxZoom=function(){return this.maxZoom},t.prototype.getMinZoom=function(){return this.minZoom},t.prototype.getOrigin=function(t){return this.origin_?this.origin_:this.origins_[t]},t.prototype.getResolution=function(t){return this.resolutions_[t]},t.prototype.getResolutions=function(){return this.resolutions_},t.prototype.getTileCoordChildTileRange=function(t,e,n){if(t[0]this.maxZoom||e0?i:Math.max(s/a[0],o/a[1]),u=r+1,h=new Array(u),c=0;cn||n>e.getMaxZoom())return!1;var o=e.getFullTileRange(n);return!o||o.containsXY(i,r)}(t,i)?t:null},e.prototype.clear=function(){this.tileCache.clear()},e.prototype.refresh=function(){this.clear(),t.prototype.refresh.call(this)},e.prototype.updateCacheSize=function(t,e){var n=this.getTileCacheForProjection(e);t>n.highWaterMark&&(n.highWaterMark=t)},e.prototype.useTile=function(t,e,n,i){},e}(Gu),Wu=function(t){function e(e,n){var i=t.call(this,e)||this;return i.tile=n,i}return Ku(e,t),e}(Ii),qu=Zu;function Qu(t,e){var n=/\{z\}/g,i=/\{x\}/g,r=/\{y\}/g,o=/\{-y\}/g;return function(s,a,l){return s?t.replace(n,s[0].toString()).replace(i,s[1].toString()).replace(r,s[2].toString()).replace(o,(function(){var t=s[0],n=e.getFullTileRange(t);return Pn(n,55),(n.getHeight()-s[2]-1).toString()})):void 0}}function Ju(t,e){for(var n=t.length,i=new Array(n),r=0;rOpenStreetMap contributors.'];var r=void 0!==i.crossOrigin?i.crossOrigin:"anonymous",o=void 0!==i.url?i.url:"https://{a-c}.tile.openstreetmap.org/{z}/{x}/{y}.png";return t.call(this,{attributions:n,attributionsCollapsible:!1,cacheSize:i.cacheSize,crossOrigin:r,imageSmoothing:i.imageSmoothing,maxZoom:void 0!==i.maxZoom?i.maxZoom:19,opaque:void 0===i.opaque||i.opaque,reprojectionErrorThreshold:i.reprojectionErrorThreshold,tileLoadFunction:i.tileLoadFunction,transition:i.transition,url:o,wrapX:i.wrapX,zDirection:i.zDirection})||this}return sh(e,t),e}(oh);const lh="0123456789bcdefghjkmnpqrstuvwxyz";class uh{static encode(t,e,n){if(void 0===n){for(let n=1;n<=12;n++){const i=uh.encode(t,e,n),r=uh.decode(i);if(r.lat==t&&r.lon==e)return i}n=12}if(t=Number(t),e=Number(e),n=Number(n),isNaN(t)||isNaN(e)||isNaN(n))throw new Error("Invalid geohash");let i=0,r=0,o=!0,s="",a=-90,l=90,u=-180,h=180;for(;s.length=t?(i=2*i+1,u=t):(i*=2,h=t)}else{const e=(a+l)/2;t>=e?(i=2*i+1,a=e):(i*=2,l=e)}o=!o,5==++r&&(s+=lh.charAt(i),r=0,i=0)}return s}static decode(t){const e=uh.bounds(t),n=e.sw.lat,i=e.sw.lon,r=e.ne.lat,o=e.ne.lon;let s=(n+r)/2,a=(i+o)/2;return s=s.toFixed(Math.floor(2-Math.log(r-n)/Math.LN10)),a=a.toFixed(Math.floor(2-Math.log(o-i)/Math.LN10)),{lat:Number(s),lon:Number(a)}}static bounds(t){if(0==t.length)throw new Error("Invalid geohash");t=t.toLowerCase();let e=!0,n=-90,i=90,r=-180,o=180;for(let s=0;s=0;t--){const s=l>>t&1;if(e){const t=(r+o)/2;1==s?r=t:o=t}else{const t=(n+i)/2;1==s?n=t:i=t}e=!e}}return{sw:{lat:n,lon:r},ne:{lat:i,lon:o}}}static adjacent(t,e){if(t=t.toLowerCase(),e=e.toLowerCase(),0==t.length)throw new Error("Invalid geohash");if(-1=="nsew".indexOf(e))throw new Error("Invalid direction");const n=t.slice(-1);let i=t.slice(0,-1);const r=t.length%2;return-1!={n:["prxz","bcfguvyz"],s:["028b","0145hjnp"],e:["bcfguvyz","prxz"],w:["0145hjnp","028b"]}[e][r].indexOf(n)&&""!=i&&(i=uh.adjacent(i,e)),i+lh.charAt({n:["p0r21436x8zb9dcf5h7kjnmqesgutwvy","bc01fg45238967deuvhjyznpkmstqrwx"],s:["14365h7k9dcfesgujnmqp0r2twvyx8zb","238967debc01fg45kmstqrwxuvhjyznp"],e:["bc01fg45238967deuvhjyznpkmstqrwx","p0r21436x8zb9dcf5h7kjnmqesgutwvy"],w:["238967debc01fg45kmstqrwxuvhjyznp","14365h7k9dcfesgujnmqp0r2twvyx8zb"]}[e][r].indexOf(n))}static neighbours(t){return{n:uh.adjacent(t,"n"),ne:uh.adjacent(uh.adjacent(t,"n"),"e"),e:uh.adjacent(t,"e"),se:uh.adjacent(uh.adjacent(t,"s"),"e"),s:uh.adjacent(t,"s"),sw:uh.adjacent(uh.adjacent(t,"s"),"w"),w:uh.adjacent(t,"w"),nw:uh.adjacent(uh.adjacent(t,"n"),"w")}}}var hh=uh;V(Rt,{openOnClick:function(t){return window.open(t)},animateContRotate:function(t){return this.animate(t).ease("-").rotate(360).loop()},showOn:function(t){t?this.show():this.hide()},animateOn:function(t,e,n){e?0===this.timeline()._runners.length?n(this.animate(t)):this.timeline().play():this.timeline().stop()},stopAnimation:function(){this.timeline().stop()},getParentNode:function(){return this.node.parentNode},getTopNode:function(){for(var t=this.node;;){if(!t.parentNode||t.className.includes("svg-object"))return t;t=t.parentNode}}}),V(St,{updateXHTMLFontText:function(t){for(var e=this.node,n=0;"xhtml:font"!==e.localName;){if(!(e.firstElementChild&&n<10))return;e=e.firstElementChild,n++}e.innerHTML=t}});var ch,ph,dh,fh=function(t){function e(e){var n=t.call(this,e)||this;return n.generateComponentStyles=function(){return{wrapper:Object(an.css)(ch||(ch=u(["\n position: relative;\n "],["\n position: relative;\n "]))),svg:Object(an.css)(ph||(ph=u(["\n position: absolute;\n top: 0;\n left: 0;\n "],["\n position: absolute;\n top: 0;\n left: 0;\n "]))),textBox:Object(an.css)(dh||(dh=u(["\n position: absolute;\n bottom: 0;\n left: 0;\n padding: 10px;\n "],["\n position: absolute;\n bottom: 0;\n left: 0;\n padding: 10px;\n "])))}},n.state={addAllIDs:!1,geomap:new Yl({controls:[],layers:[new pu({source:new ah({url:"https://{a-c}.basemaps.cartocdn.com/dark_all/{z}/{x}/{y}.png"})})],view:new La({center:[0,0],showFullExtent:!0,zoom:1})}),svgNode:null,svgSource:null,svgMappings:[],mappedElements:null,initFunctionSource:"",initFunction:null,eventFunctionSource:"",eventFunction:null,initialized:!1,context:{},coords:n.getCoords(),svgContainerRefs:n.getCoords().map((function(){return Object(h.createRef)()})),svgElement:null},n.mapRef=Object(h.createRef)(),n.svgElement=null,n}return o(e,t),e.prototype.getCoords=function(){var t=this,e=[];return this.props.data.series.forEach((function(n){n.fields.forEach((function(n){if(n.name===t.props.options.geohashField)for(var i=0;i20)return;e=e.parentNode}for(var r=0;rt.length)&&(e=t.length);for(var n=0,i=new Array(e);n=t.length?t.apply(this,r):function(){for(var t=arguments.length,i=new Array(t),o=0;o1&&void 0!==arguments[1]?arguments[1]:{};Oh.initial(t),Oh.handler(e);var n={current:t},i=xh(Sh)(n,e),r=xh(Ph)(n),o=xh(Oh.changes)(t),s=xh(Th)(n);function a(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:function(t){return t};return Oh.selector(t),t(n.current)}function l(t){wh(i,r,o,s)(t)}return[a,l]}},jh={paths:{vs:"https://cdn.jsdelivr.net/npm/monaco-editor@0.25.2/min/vs"}};var zh=function(t){return{}.toString.call(t).includes("Object")};var Dh=function(t){return function e(){for(var n=this,i=arguments.length,r=new Array(i),o=0;o=t.length?t.apply(this,r):function(){for(var t=arguments.length,i=new Array(t),o=0;o{i.current=!1}:t,e)};function lc(){}function uc(t,e,n,i){return function(t,e){return t.editor.getModel(hc(t,e))}(t,i)||function(t,e,n,i){return t.editor.createModel(e,n,i&&hc(t,i))}(t,e,n,i)}function hc(t,e){return t.Uri.parse(e)}function cc({original:t,modified:e,language:n,originalLanguage:i,modifiedLanguage:r,originalModelPath:o,modifiedModelPath:s,keepCurrentOriginalModel:a,keepCurrentModifiedModel:l,theme:u,loading:p,options:d,height:f,width:g,className:y,wrapperClassName:m,beforeMount:v,onMount:A}){const[_,C]=Object(h.useState)(!1),[w,x]=Object(h.useState)(!0),b=Object(h.useRef)(null),E=Object(h.useRef)(null),M=Object(h.useRef)(null),O=Object(h.useRef)(A),T=Object(h.useRef)(v);sc(()=>{const t=Qh.init();return t.then(t=>(E.current=t)&&x(!1)).catch(t=>"cancelation"!==(null==t?void 0:t.type)&&void 0),()=>b.current?function(){const t=b.current.getModel();var e,n;a||null===(e=t.original)||void 0===e||e.dispose();l||null===(n=t.modified)||void 0===n||n.dispose();b.current.dispose()}():t.cancel()}),ac(()=>{const t=b.current.getModifiedEditor();t.getOption(E.current.editor.EditorOption.readOnly)?t.setValue(e):e!==t.getValue()&&(t.executeEdits("",[{range:t.getModel().getFullModelRange(),text:e,forceMoveMarkers:!0}]),t.pushUndoStop())},[e],_),ac(()=>{b.current.getModel().original.setValue(t)},[t],_),ac(()=>{const{original:t,modified:e}=b.current.getModel();E.current.editor.setModelLanguage(t,i||n),E.current.editor.setModelLanguage(e,r||n)},[n,i,r],_),ac(()=>{E.current.editor.setTheme(u)},[u],_),ac(()=>{b.current.updateOptions(d)},[d],_);const P=Object(h.useCallback)(()=>{T.current(E.current);const a=E.current.editor.createModel(t,i||n,o&&E.current.Uri.parse(o)),l=E.current.editor.createModel(e,r||n,s&&E.current.Uri.parse(s));b.current.setModel({original:a,modified:l})},[n,e,r,t,i,o,s]),S=Object(h.useCallback)(()=>{b.current=E.current.editor.createDiffEditor(M.current,{automaticLayout:!0,...d}),P(),E.current.editor.setTheme(u),C(!0)},[d,u,P]);return Object(h.useEffect)(()=>{_&&O.current(b.current,E.current)},[_]),Object(h.useEffect)(()=>{!w&&!_&&S()},[w,_,S]),c.a.createElement(oc,{width:g,height:f,isEditorReady:_,loading:p,_ref:M,className:y,wrapperClassName:m})}cc.propTypes={original:$h.a.string,modified:$h.a.string,language:$h.a.string,originalLanguage:$h.a.string,modifiedLanguage:$h.a.string,originalModelPath:$h.a.string,modifiedModelPath:$h.a.string,keepCurrentOriginalModel:$h.a.bool,keepCurrentModifiedModel:$h.a.bool,theme:$h.a.string,loading:$h.a.oneOfType([$h.a.element,$h.a.string]),options:$h.a.object,width:$h.a.oneOfType([$h.a.number,$h.a.string]),height:$h.a.oneOfType([$h.a.number,$h.a.string]),className:$h.a.string,wrapperClassName:$h.a.string,beforeMount:$h.a.func,onMount:$h.a.func},cc.defaultProps={theme:"light",loading:"Loading...",options:{},keepCurrentOriginalModel:!1,keepCurrentModifiedModel:!1,width:"100%",height:"100%",beforeMount:lc,onMount:lc};var pc=function(t){const e=Object(h.useRef)();return Object(h.useEffect)(()=>{e.current=t},[t]),e.current};const dc=new Map;function fc({defaultValue:t,defaultLanguage:e,defaultPath:n,value:i,language:r,path:o,theme:s,line:a,loading:l,options:u,overrideServices:p,saveViewState:d,keepCurrentModel:f,width:g,height:y,className:m,wrapperClassName:v,beforeMount:A,onMount:_,onChange:C,onValidate:w}){const[x,b]=Object(h.useState)(!1),[E,M]=Object(h.useState)(!0),O=Object(h.useRef)(null),T=Object(h.useRef)(null),P=Object(h.useRef)(null),S=Object(h.useRef)(_),R=Object(h.useRef)(A),j=Object(h.useRef)(null),z=Object(h.useRef)(i),D=pc(o);sc(()=>{const t=Qh.init();return t.then(t=>(O.current=t)&&M(!1)).catch(t=>"cancelation"!==(null==t?void 0:t.type)&&void 0),()=>T.current?function(){var t,e;null===(t=j.current)||void 0===t||t.dispose(),f?d&&dc.set(o,T.current.saveViewState()):null===(e=T.current.getModel())||void 0===e||e.dispose();T.current.dispose()}():t.cancel()}),ac(()=>{const n=uc(O.current,t||i,e||r,o);n!==T.current.getModel()&&(d&&dc.set(D,T.current.saveViewState()),T.current.setModel(n),d&&T.current.restoreViewState(dc.get(o)))},[o],x),ac(()=>{T.current.updateOptions(u)},[u],x),ac(()=>{T.current.getOption(O.current.editor.EditorOption.readOnly)?T.current.setValue(i):i!==T.current.getValue()&&(T.current.executeEdits("",[{range:T.current.getModel().getFullModelRange(),text:i,forceMoveMarkers:!0}]),T.current.pushUndoStop())},[i],x),ac(()=>{O.current.editor.setModelLanguage(T.current.getModel(),r)},[r],x),ac(()=>{void 0!==a&&T.current.revealLine(a)},[a],x),ac(()=>{O.current.editor.setTheme(s)},[s],x);const L=Object(h.useCallback)(()=>{R.current(O.current);const a=o||n,l=uc(O.current,i||t,e||r,a);T.current=O.current.editor.create(P.current,{model:l,automaticLayout:!0,...u},p),d&&T.current.restoreViewState(dc.get(a)),O.current.editor.setTheme(s),b(!0)},[t,e,n,i,r,o,u,p,d,s]);return Object(h.useEffect)(()=>{x&&S.current(T.current,O.current)},[x]),Object(h.useEffect)(()=>{!E&&!x&&L()},[E,x,L]),z.current=i,Object(h.useEffect)(()=>{var t,e;x&&C&&(null===(t=j.current)||void 0===t||t.dispose(),j.current=null===(e=T.current)||void 0===e?void 0:e.onDidChangeModelContent(t=>{const e=T.current.getValue();z.current!==e&&C(e,t)}))},[x,C]),Object(h.useEffect)(()=>{if(x){const t=O.current.editor.onDidChangeMarkers(t=>{var e;const n=null===(e=T.current.getModel())||void 0===e?void 0:e.uri;if(n){if(t.find(t=>t.path===n.path)){const t=O.current.editor.getModelMarkers({resource:n});null==w||w(t)}}});return()=>{null==t||t.dispose()}}},[x,w]),c.a.createElement(oc,{width:g,height:y,isEditorReady:x,loading:l,_ref:P,className:m,wrapperClassName:v})}fc.propTypes={defaultValue:$h.a.string,defaultPath:$h.a.string,defaultLanguage:$h.a.string,value:$h.a.string,language:$h.a.string,path:$h.a.string,theme:$h.a.string,line:$h.a.number,loading:$h.a.oneOfType([$h.a.element,$h.a.string]),options:$h.a.object,overrideServices:$h.a.object,saveViewState:$h.a.bool,keepCurrentModel:$h.a.bool,width:$h.a.oneOfType([$h.a.number,$h.a.string]),height:$h.a.oneOfType([$h.a.number,$h.a.string]),className:$h.a.string,wrapperClassName:$h.a.string,beforeMount:$h.a.func,onMount:$h.a.func,onChange:$h.a.func,onValidate:$h.a.func},fc.defaultProps={theme:"light",loading:"Loading...",options:{},overrideServices:{},saveViewState:!0,keepCurrentModel:!1,width:"100%",height:"100%",beforeMount:lc,onMount:lc,onValidate:lc};var gc,yc,mc,vc,Ac=fc,_c=Object(h.memo)(Ac),Cc=n(4),wc={svgNode:'\n\n \n \n \n image/svg+xml\n \n \n \n \n \n \n \n .cls-1{fill:#2a2e3c;}.cls-2{fill:#c1d301;}.cls-3{fill:#f6511d;}.cls-4{fill:#fff;}.cls-5{fill:#595e71;}\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n>\n ',initSource:"options.animateLogo = (svgmap, data) => {\n let buffer = data.series[0].fields[1].values.buffer;\n let valueCount = buffer.length\n let chartData = [];\n for (let i=0; i {\n return Math.min(acc, val);\n });\n let maxData = 1.05 * chartData.reduce((acc, val) => {\n return Math.max(acc, val);\n });\n let spread = maxData - minData;\n let iconHeight = svgmap.iconbg.height();\n let iconY = svgmap.iconbg.y();\n [svgmap.barOne, svgmap.barTwo, svgmap.barThree, svgmap.barFour].forEach((elem) => {\n elem.animate(1000).ease('<>').move(elem.x(), ((iconHeight * (chartData[0] / maxData)) - elem.height())).loop(0, true);\n });\n }\n ",eventSource:"// example of calling a function defined in the init script\noptions.animateLogo(svgmap, data);\n// Here we're going to initialized some variables just to make things less verbose\n// This is the raw buffer from the values field of the DataFrame\nlet buffer = data.series[0].fields[1].values.buffer;\n// here we collect the most recent value from the Data Frame\nlet lastValue = buffer[buffer.length -1]\n// We need to collect the center of the fan as a static value here, otherwise it will cause a feedback loop in the animation.\n// The rotate animation will use the center of the bounding box by default, but of irregular shaped items, like these fan blades\n// the center is not the center axis of rotation\nconst fanX = svgmap.fanBlades.cx();\nconst fanY = svgmap.fanBlades.cy();\n// Here we're defining a state condition to use later in our pipe animation\nlet leakCond = lastValue > 10 && lastValue < 45;\n\n// Here we're simply making the visibility of the alert icon on top of tbe bell dependent on the last value being greater than 50\nsvgmap.alarmIcon.showOn(lastValue > 50);\n// Now we use the same logic to apply an animation to the sound waves around the bell\nsvgmap.alarmRings.animateOn(1500, (lastValue > 50), (elem) => {\n // this callback is passed the resulting SVG.js runner object which you then chain your animation actions on.\n // Here, we're simply scaling the dark sound wave lines by 10%, with bidirectional easing and looping with swing\n elem.ease('<>').transform({scale: 1.1, relative: true}).loop(0, true);\n})\n// Here we animate the fan, using the static variables we create earlier to get closer to the center of the blades\n// if the item we were rotating was centered in the bounding box, we could just call rotate(360) with no axis specificied\nsvgmap.fanBlades.animateOn(1000, (lastValue > 40), (elem) => {\n elem.ease('-').rotate(360, fanX - 1, fanY +3).loop();\n});\n// these simply hide the elements of the lamp when below the threshold\nsvgmap.lampLens.showOn(lastValue>10);\nsvgmap.lampRays.showOn(lastValue>10);\n// Here we hide the water drop when leakCond is false\nsvgmap.waterDrop.showOn(leakCond)\n// and here we animate the water drop when leakCond is true\nsvgmap.waterDrop.animateOn(2000 - lastValue *20, leakCond, (elem) => {\n // we're using single direction easing to give a gravity affect, and scaling the drop down as it falls off the screen\n elem.ease('<').transform({translateY: 1000, scale: 0.00001}).loop();\n})\n",svgMappings:[{mappedName:"barTwo",svgId:"rect4526"},{mappedName:"barThree",svgId:"rect4528"},{mappedName:"barFour",svgId:"rect4530"},{mappedName:"iconbg",svgId:"rect4522"},{mappedName:"spline",svgId:"path4538"},{mappedName:"barOne",svgId:"rect4524"},{mappedName:"fanBlades",svgId:"g1550"},{mappedName:"alarmIcon",svgId:"g1721"},{mappedName:"lampLens",svgId:"g1942"},{mappedName:"lampRays",svgId:"g1917"},{mappedName:"waterDrop",svgId:"g1995"},{mappedName:"alarmRings",svgId:"g1891"}]},xc=n(2),bc=function(t){function e(){var e=null!==t&&t.apply(this,arguments)||this;return e.onSourceChange=function(){void 0!==e.editorInstance&&e.props.onChange(e.editorInstance.getValue())},e.onEditorDidMount=function(t){e.editorInstance=t},e}return o(e,t),e.prototype.updateDimensions=function(){void 0!==this.editorInstance&&this.editorInstance.layout()},e.prototype.render=function(){var t=this.props.value;return this.editorInstance&&this.editorInstance.layout(),c.a.createElement("div",{onBlur:this.onSourceChange},c.a.createElement(_c,{height:"33vh",language:this.props.language,theme:this.props.theme,value:t,onMount:this.onEditorDidMount}))},e}(c.a.PureComponent),Ec=function(t){function e(e){var n=t.call(this,e)||this;return n.state=s({},e.value),n}return o(e,t),e.prototype.render=function(){var t=this,e=this.props,n=e.value,i=e.index,r=e.onChangeItem,o=e.onAdd,a=e.onDelete;return c.a.createElement(xc.HorizontalGroup,null,c.a.createElement(xc.Label,null,"SVG ID"),c.a.createElement(xc.Input,{type:"text",name:"svgId",defaultValue:n.svgId,css:Cc.config.theme,onBlur:function(e){var o=e.currentTarget.value;t.setState({svgId:o}),r&&i&&r(s(s({},n),{svgId:o}),i)}}),c.a.createElement(xc.Label,null,"Mapped Name"),c.a.createElement(xc.Input,{type:"text",name:"mappedName",defaultValue:n.mappedName,css:Cc.config.theme,onBlur:function(e){var o=e.currentTarget.value;t.setState({mappedName:o}),r&&i&&r(s(s({},n),{mappedName:o}),i)}}),n.svgId&&a&&void 0!==i&&c.a.createElement(xc.Tooltip,{content:"Delete this mapping",theme:"info"},c.a.createElement(xc.Button,{variant:"destructive",icon:"trash-alt",size:"sm",onClick:function(){a(i)}},"Remove")),!n.svgId&&o&&c.a.createElement(xc.Tooltip,{content:"Add a new SVG Element ID to svgmap property mapping manually",theme:"info"},c.a.createElement(xc.Button,{variant:"secondary",size:"sm",icon:"plus-circle",onClick:function(){o(t.state)}},"Add")))},e}(c.a.PureComponent),Mc=function(t){function e(){var e=null!==t&&t.apply(this,arguments)||this;return e.onChangeItem=function(t,n){var i=l([],a(e.props.value));i[n]=t,e.props.onChange(i)},e.onAdd=function(t){if(""!==t.svgId){var n=l(l([],a(e.props.value)),[t]);e.props.onChange(n)}},e.onDelete=function(t){var n=l([],a(e.props.value));n.splice(t,1),e.props.onChange(n)},e}return o(e,t),e.prototype.render=function(){var t=this,e=Oc(Cc.config.theme),n=this.props.value;return c.a.createElement(xc.VerticalGroup,null,c.a.createElement(xc.HorizontalGroup,null,c.a.createElement(xc.Tooltip,{content:"Clear all SVG Element ID to svgmap property mappings",theme:"info"},c.a.createElement(xc.Button,{variant:"destructive",icon:"trash-alt",size:"sm",onClick:function(){t.props.onChange([])}},"Clear All")),c.a.createElement(Ec,{value:{svgId:"",mappedName:""},styles:e,onAdd:this.onAdd})),n.map((function(n,i){return c.a.createElement(Ec,{key:n.svgId,value:n,index:i,onChangeItem:t.onChangeItem,onDelete:t.onDelete,styles:e})})))},e}(c.a.PureComponent),Oc=function(t){return{colorPicker:Object(an.css)(gc||(gc=u(["\n padding: 0 ",";\n "],["\n padding: 0 ",";\n "])),t.spacing.sm),inputPrefix:Object(an.css)(yc||(yc=u(["\n display: flex;\n align-items: center;\n "],["\n display: flex;\n align-items: center;\n "]))),trashIcon:Object(an.css)(mc||(mc=u(["\n color: ",";\n cursor: pointer;\n //\n &:hover {\n color: ",";\n }\n "],["\n color: ",";\n cursor: pointer;\n //\n &:hover {\n color: ",";\n }\n "])),t.colors.textWeak,t.colors.text),addIcon:Object(an.css)(vc||(vc=u(["\n color: ",";\n cursor: pointer;\n //\n &:hover {\n color: ",";\n }\n "],["\n color: ",";\n cursor: pointer;\n //\n &:hover {\n color: ",";\n }\n "])),t.colors.textWeak,t.colors.text)}};n.d(e,"plugin",(function(){return Tc}));var Tc=new i.PanelPlugin(fh).useFieldConfig().setPanelOptions((function(t){return t.addBooleanSwitch({category:["SVG Document"],path:"svgAutoComplete",name:"Enable SVG AutoComplete",description:"Enable editor autocompletion, optional as it can be buggy on large documents"}).addCustomEditor({category:["SVG Document"],path:"svgSource",name:"SVG Document",description:"Editor for SVG Document, while small tweaks can be made here, we recommend using a dedicated\n Graphical SVG Editor and simply pasting the resulting XML here",id:"svgSource",defaultValue:wc.svgNode,editor:function(t){var e=Cc.config.theme.name;return c.a.createElement(bc,{language:"xml",theme:"Grafana Light"===e?"vs-light":"vs-dark",value:t.value,onChange:t.onChange})}}).addBooleanSwitch({category:["User JS Render"],path:"eventAutoComplete",name:"Enable Render JS AutoComplete",description:"Enable editor autocompletion, optional as it can be buggy on large documents",defaultValue:!0}).addCustomEditor({category:["User JS Render"],path:"eventSource",name:"User JS Render Code",description:"The User JS Render code is executed whenever new data is available, the root svg document is available as 'svgnode',\n and elements you've mapped using the SVG Mapping tools below are available as properties on the 'svgmap' object.\n The Grafana DataFrame is provided as 'data' and the 'options' object can be used to pass values and references between\n the Render context and the Init context",id:"eventSource",defaultValue:wc.eventSource,editor:function(t){var e=Cc.config.theme.name;return c.a.createElement(bc,{language:"javascript",theme:"Grafana Light"===e?"vs-light":"vs-dark",value:t.value,onChange:t.onChange})}}).addBooleanSwitch({category:["User JS Init"],path:"initAutoComplete",name:"Enable Init JS AutoComplete",description:"Enable editor autocompletion, optional as it can be buggy on large documents",defaultValue:!0}).addCustomEditor({category:["User JS Init"],path:"initSource",name:"User JS Init Code",description:"The User JS Init code is executed once when the panel loads, you can use this to define helper functions that\n you later reference in the User JS Render code section. The sections have identical execution contexts, and any\n JS objects you want to reference between them will need to be attached to the options object as properties",id:"initSource",defaultValue:wc.initSource,editor:function(t){var e=Cc.config.theme.name;return c.a.createElement(bc,{language:"javascript",theme:"Grafana Light"===e?"vs-light":"vs-dark",value:t.value,onChange:t.onChange})}}).addBooleanSwitch({category:["SVG Mapping"],path:"addAllIDs",name:"Add all SVG Element IDs",description:"Parse the SVG Document for Elements with IDs assigned and automatically add them to the mapping list",defaultValue:!1}).addBooleanSwitch({category:["SVG Mapping"],path:"captureMappings",name:"Enable SVG Mapping on Click",description:"When activated, clicking an element in the panel will attempt to map the clicked element or its nearest parent element with an ID assigned",defaultValue:!1}).addCustomEditor({category:["SVG Mapping"],id:"svgMappings",path:"svgMappings",name:"SVG Mappings",description:'The SVG ID should match an element in the SVG document with an existing ID tag, the element will be attached to the "svgmap" object in the user code execution contexts as a property using the Mapped Name provided below',defaultValue:wc.svgMappings,editor:Mc}).addBooleanSwitch({category:["Geomap"],path:"enableGeomap",name:"Enable Geomap"}).addFieldNamePicker({category:["Geomap"],path:"geohashField",name:"Geohash Field",showIf:function(t){return t.enableGeomap}})}))}])})); //# sourceMappingURL=module.js.map \ No newline at end of file diff --git a/dist/module.js.map b/dist/module.js.map index ac48293..d4bf147 100644 --- a/dist/module.js.map +++ b/dist/module.js.map @@ -1 +1 @@ -{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///external \"react\"","webpack:///../node_modules/prop-types/index.js","webpack:///external \"@grafana/ui\"","webpack:///external \"emotion\"","webpack:///external \"@grafana/runtime\"","webpack:///external \"@grafana/data\"","webpack:///../node_modules/prop-types/factoryWithThrowingShims.js","webpack:///../node_modules/prop-types/lib/ReactPropTypesSecret.js","webpack:///../node_modules/tslib/tslib.es6.js","webpack:///../node_modules/@svgdotjs/svg.js/dist/svg.esm.js","webpack:///./ACESVGjsPanel.tsx","webpack:///../node_modules/@monaco-editor/loader/lib/es/_virtual/_rollupPluginBabelHelpers.js","webpack:///../node_modules/state-local/lib/es/state-local.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/config/index.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/utils/isObject.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/validators/index.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/utils/curry.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/utils/compose.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/utils/deepMerge.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/utils/makeCancelable.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/loader/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/Loading/Loading.js","webpack:///../node_modules/@monaco-editor/react/lib/es/MonacoContainer/styles.js","webpack:///../node_modules/@monaco-editor/react/lib/es/MonacoContainer/MonacoContainer.js","webpack:///../node_modules/@monaco-editor/react/lib/es/MonacoContainer/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/hooks/useMount/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/hooks/useUpdate/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/utils/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/DiffEditor/DiffEditor.js","webpack:///../node_modules/@monaco-editor/react/lib/es/hooks/usePrevious/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/Editor/Editor.js","webpack:///../node_modules/@monaco-editor/react/lib/es/Editor/index.js","webpack:///./examples.ts","webpack:///./options.tsx","webpack:///./module.ts"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","__WEBPACK_EXTERNAL_MODULE__0__","__WEBPACK_EXTERNAL_MODULE__2__","__WEBPACK_EXTERNAL_MODULE__3__","__WEBPACK_EXTERNAL_MODULE__4__","__WEBPACK_EXTERNAL_MODULE__5__","ReactPropTypesSecret","emptyFunction","emptyFunctionWithReset","resetWarningCache","shim","props","propName","componentName","location","propFullName","secret","err","Error","getShim","isRequired","ReactPropTypes","array","bool","func","number","string","symbol","any","arrayOf","element","elementType","instanceOf","node","objectOf","oneOf","oneOfType","shape","exact","checkPropTypes","PropTypes","extendStatics","b","setPrototypeOf","__proto__","Array","__extends","TypeError","String","__","this","constructor","__assign","assign","arguments","length","apply","__read","iterator","e","ar","next","done","push","error","__spreadArray","to","from","pack","slice","concat","__makeTemplateObject","cooked","raw","methods$1","names","registerMethods","isArray","_name","addMethodNames","getOwnPropertyNames","getMethodsFor","_names","map","block","il","result","filter","radians","Math","PI","camelCase","toLowerCase","replace","g","toUpperCase","unCamelCase","capitalize","charAt","proportionalSize","width","height","box","bbox","getOrigin","origin","ox","originX","oy","originY","x","y","condX","condY","includes","svg","html","xmlns","xlink","svgjs","globals","window","document","Base","root","createElementNS","makeInstance","isHTML","adopter","querySelector","wrapper","createElement","innerHTML","firstChild","removeChild","nodeOrNew","Node","adopt","instance","nodeName","Fragment","className","register","asRoot","did","eid","extend","methods","wrapWithAttrCheck","fn","args","attr","siblings","parent","children","position","index","prev","forward","add","remove","backward","front","back","before","after","insertBefore","insertAfter","numberAndUnit","hex","rgb","reference","transforms","whitespace","isHex","isRgb","isBlank","isNumber","isImage","delimiter","isPathLetter","componentHex","component","integer","round","max","min","toString","is","space","hueToRgb","q","classes","trim","split","hasClass","indexOf","addClass","join","removeClass","toggleClass","css","style","val","ret","cssText","el","forEach","cased","test","show","hide","visible","data","a","v","attributes","JSON","parse","stringify","remember","k","memory","forget","_memory","Color","inputs","init","color","u","random","sin","pi","h","grey","_a","_b","_c","isGrey","delta","_d","values","params","z","getParameters","noWhitespace","exec","parseInt","hexParse","substring","sixDigitHex","components","xyz","lab","sqrt","atan2","dToR","cos","yL","xL","zL","ct","mx","nm","rU","gU","bU","pow","bd","_clamped","rV","gV","bV","toHex","r255","g255","b255","rL","gL","bL","xU","yU","zU","Point","base","source","clone","transformO","Matrix","isMatrixLike","f","closeEnough","threshold","abs","flipBoth","flip","flipX","flipY","skewX","skew","isFinite","skewY","scaleX","scale","scaleY","shear","theta","rotate","around","px","positionX","NaN","py","positionY","translate","tx","translateX","ty","translateY","relative","rx","relativeX","ry","relativeY","cx","cy","matrix","aroundO","dx","dy","translateO","lmultiplyO","determinant","ccw","sx","thetaRad","st","lam","sy","other","comp","axis","flipO","scaleO","fromArray","Element","matrixify","parseFloat","transform","inverseO","det","na","nb","nc","nd","ne","nf","matrixMultiply","multiplyO","rotateO","shearO","lx","skewO","tan","ly","formatTransforms","transformer","parser","nodes","size","path","parentNode","body","documentElement","addTo","isNulledBox","Box","pageXOffset","pageYOffset","left","top","w","x2","y2","xMin","Infinity","xMax","yMin","yMax","getBox","getBBoxFn","retry","contains","viewbox","level","point","clientWidth","clientHeight","zoomX","zoomY","zoom","zoomAmount","Number","MAX_SAFE_INTEGER","List","arr","super","fnOrMethodName","reserved","baseFind","query","querySelectorAll","reduce","obj","attrs","each","listenerId","windowEvents","getEvents","getEventHolder","events","getEventTarget","on","listener","binding","options","bag","_svgjsListenerId","event","ev","addEventListener","off","namespace","removeEventListener","clearEvents","EventTarget","Event","CustomEvent","detail","cancelable","dispatchEvent","dispatch","type","j","defaultPrevented","noop","timeline","duration","ease","delay","fill","stroke","opacity","offset","SVGArray","Set","SVGNumber","unit","isNaN","match","valueOf","hooks","Dom","removeNamespace","SVGElement","appendChild","childNodes","put","hasChildNodes","lastChild","deep","writeDataToDom","assignNewId","id","cloneNode","htmlOrFn","outerHTML","xml","selector","matcher","matches","matchesSelector","msMatchesSelector","mozMatchesSelector","webkitMatchesSelector","oMatchesSelector","removeElement","replaceChild","precision","factor","svgOrFn","outerSVG","text","textContent","xmlOrFn","outerXML","current","_this","well","fragment","createDocumentFragment","len","firstElementChild","nodeValue","last","curr","removeAttribute","getAttribute","_val","hook","isColor","leading","setAttributeNS","setAttribute","rebuild","find","findOne","dom","hasAttribute","setData","defs","plus","until","parents","keys","getBBox","rbox","getBoundingClientRect","screenCTM","addOffset","inside","inverse","ctm","getCTM","isRoot","rect","getScreenCTM","sugar","prefix","extension","mat","angle","direction","radius","_element","getTotalLength","pointAt","getPointAtLength","font","untransform","str","kv","reverse","lmultiply","toParent","pCtm","multiply","toRoot","decomposed","decompose","Container","flatten","ungroup","Defs","Shape","x$3","y$3","cx$1","cy$1","width$2","divide","height$2","circled","Ellipse","ellipse","move","fx","fy","x1","y1","gradiented","Gradient","url","clear","gradient","update","Pattern","pattern","patternUnits","Image","callback","img","src","image","load","PointArray","maxX","maxY","minX","minY","points","pop","pointed","MorphArray","Line","toLine","line","plot","Marker","orient","makeSetterGetter","marker","ref","easing","pos","bezier","steps","stepPosition","jumps","beforeFlag","step","floor","jumping","Stepper","Ease","Controller","stepper","target","dt","recalculate","_duration","overshoot","_overshoot","os","log","zeta","wn","velocity","acceleration","newPosition","windup","integral","_windup","P","I","D","segmentParameters","M","L","H","V","C","S","Q","T","A","Z","pathHandlers","p0","mlhvqtcsaz","jl","segmentComplete","segment","startNewSegment","token","inNumber","finalizeNumber","pathLetter","lastCommand","small","isSmall","inSegment","pointSeen","hasExponent","finalizeSegment","absolute","command","makeAbsolut","segments","isArcFlag","isArc","isExponential","lastToken","PathArray","toAbsolute","pathParser","arrayToString","getClassForType","NonMorphable","morphableTypes","ObjectBag","Morphable","_stepper","_from","_to","_type","_context","_morphObj","_set","align","toArray","TransformBag","defaults","sortByKey","splice","objOrArr","entries","Type","sort","shift","num","Path","_array","poly","Polygon","polygon","Polyline","polyline","Rect","Queue","_first","_last","item","Animator","nextDraw","frames","timeouts","immediates","timer","performance","Date","run","requestAnimationFrame","_draw","time","now","nextTimeout","lastTimeout","nextFrame","lastFrame","nextImmediate","first","makeSchedule","runnerInfo","start","runner","end","defaultSource","Timeline","timeSource","_timeSource","_startTime","_speed","_persist","_nextFrame","_paused","_runners","_runnerIds","_lastRunnerId","_time","_lastSourceTime","_lastStepTime","_step","_stepFn","_stepImmediate","getEndTimeOfTimeline","pause","lastRunnerInfo","getLastRunnerInfo","lastDuration","endTimes","getRunnerInfoById","_continue","dtOrForever","updateTime","yes","currentSpeed","speed","positive","when","absoluteStartTime","endTime","getEndTime","unschedule","persist","info","active","immediateStep","cancelFrame","frame","dtSource","dtTime","fire","reset","runnersLeft","dtToStart","_timeline","Runner","_queue","_isDeclarative","_history","enabled","_lastTime","_reseted","transformId","_haveReversed","_reverse","_loopsDone","_swing","_wait","_times","_frameId","times","swing","wait","sanitise","loop","schedule","isTransform","animate","queue","_prepareRunner","loopDuration","loopsDone","partial","swinging","backwards","uncliped","loops","swingForward","initFn","runFn","retargetFn","initialiser","retarget","initialised","finished","running","_lastPosition","justStarted","justFinished","declarative","converged","_initialise","_run","needsIt","method","morpher","caller","play","positionOrDt","allfinished","extra","FakeRunner","getRunnerTransform","mergeTransforms","netTransform","_transformationRunners","runners","merge","RunnerArray","ids","deleteCnt","clearTransformsFromQueue","newRunner","lastRunner","mergeWith","edit","by","currentRunner","clearBefore","cancelImmediate","immediate","styleAttr","nameOrAttrs","_tryRetarget","at","newToAttrs","newKeys","differences","addedFromAttrs","oldFromAttrs","oldToAttrs","_rememberMorpher","newLevel","newPoint","affine","isMatrix","currentAngle","startTransform","undefined","_addRunner","_clearTransformRunnersBefore","clearTransform","_currentTransform","rTarget","rCurrent","possibilities","distances","shortest","affineParameters","addTransform","newTransforms","_queueNumber","_queueNumberDelta","newTo","_queueObject","Svg","version","nested","textable","plain","_build","createTextNode","getComputedTextLength","center","ax","ay","amove","build","Text","_rebuild","self","blankLineOffset","fontSize","getComputedStyle","getPropertyValue","newLined","firstLine","nodeType","newLine","Tspan","tspan","Circle","circle","ClipPath","targets","unclip","clip","clipper","ForeignObject","foreignObject","containerGeometry","dmove","child","G","group","link","linker","wrap","Mask","unmask","mask","masker","Stop","stop","Style","rule","fontFamily","addText","cssRule","TextPath","track","pathArray","textPath","importNodes","Use","file","use","SVG","registerMorphableType","openOnClick","open","animateContRotate","showOn","animateOn","animation","stopAnimation","getParentNode","getTopNode","currentNode","updateXHTMLFontText","newText","currentElement","localName","generateComponentStyles","textBox","state","addAllIDs","svgNode","svgSource","svgMappings","mappedElements","initFunctionSource","initFunction","eventFunctionSource","eventFunction","initialized","context","initializeMappings","currentElements","mappedName","svgId","setState","mapAllIDs","nodeFilterID","acceptNode","NodeFilter","FILTER_ACCEPT","FILTER_REJECT","svgWalker","createTreeWalker","SHOW_ALL","mapping","nextNode","onOptionsChange","forceUpdate","mappingClickHandler","clicked","loopCount","renderSVG","initSource","Function","replaceVariables","eventSource","render","styles","onClick","captureMappings","_defineProperty","configurable","writable","ownKeys","enumerableOnly","getOwnPropertySymbols","symbols","sym","getOwnPropertyDescriptor","_objectSpread2","getOwnPropertyDescriptors","defineProperties","_arrayLikeToArray","arr2","compose","_len","fns","_key","reduceRight","curry","curried","_len2","_key2","_len3","nextArgs","_key3","isObject","isFunction","errorHandler","errorMessages","initialIsRequired","initialType","initialContent","handlerType","handlersType","selectorType","changeType","changeField","validators","changes","initial","some","field","handler","_handler","extractChanges","causedChanges","updateState","didStateUpdate","_handler$field","didUpdate","validate","getChanges","getState","paths","vs","configIsRequired","configType","deprecation","config","urls","monacoBase","CANCELATION_MESSAGE","msg","promise","hasCanceled_","wrappedPromise","Promise","resolve","reject","then","cancel","_state$create","isInitialized","monaco","_state$create2","_arrayWithHoles","_arr","_n","_e","_s","_i","_iterableToArrayLimit","minLen","_unsupportedIterableToArray","_nonIterableRest","injectScripts","script","getMonacoLoaderScript","configureLoader","_ref2","loaderScript","onload","onerror","_ref3","require","storeMonacoInstance","wrapperPromise","_ref","editor","__getMonacoInstance","_ref4","loadingStyles","display","justifyContent","alignItems","content","textAlign","fullWidth","MonacoContainer","isEditorReady","loading","wrapperClassName","propTypes","effect","deps","applyChanges","isInitialMount","getOrCreateModel","language","getModel","crateModelUri","createModel","Uri","DiffEditor","original","modified","originalLanguage","modifiedLanguage","originalModelPath","modifiedModelPath","keepCurrentOriginalModel","keepCurrentModifiedModel","theme","beforeMount","onMount","setIsEditorReady","isMonacoMounting","setIsMonacoMounting","editorRef","monacoRef","containerRef","onMountRef","beforeMountRef","catch","console","models","_models$original","_models$modified","dispose","disposeEditor","modifiedEditor","getModifiedEditor","getOption","EditorOption","readOnly","setValue","getValue","executeEdits","range","getFullModelRange","forceMoveMarkers","pushUndoStop","setModelLanguage","setTheme","updateOptions","setModels","originalModel","modifiedModel","setModel","createEditor","createDiffEditor","automaticLayout","defaultProps","viewStates","Map","Editor","defaultValue","defaultLanguage","defaultPath","overrideServices","saveViewState","keepCurrentModel","onChange","onValidate","subscriptionRef","valueRef","previousPath","_subscriptionRef$curr2","_editorRef$current$ge2","set","model","restoreViewState","revealLine","autoCreatedModelPath","defaultModel","_subscriptionRef$curr","_editorRef$current","onDidChangeModelContent","editorValue","changeMarkersListener","onDidChangeMarkers","uris","_editorRef$current$ge","editorUri","uri","markers","getModelMarkers","resource","props_defaults","onSourceChange","editorInstance","onEditorDidMount","updateDimensions","layout","onBlur","PureComponent","onChangeItem","onAdd","onDelete","currentTarget","variant","icon","updatedMapping","newMappings","newMapping","currentMapping","colorPicker","spacing","sm","inputPrefix","trashIcon","colors","textWeak","addIcon","useFieldConfig","setPanelOptions","builder","addBooleanSwitch","category","description","addCustomEditor","grafanaTheme"],"mappings":";oHACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QA0Df,OArDAF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,oBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,IAIjBlC,EAAoBA,EAAoBmC,EAAI,G,gBClFrDhC,EAAOD,QAAUkC,G,gBCiBfjC,EAAOD,QAAU,EAAQ,EAAR,I,cCjBnBC,EAAOD,QAAUmC,G,cCAjBlC,EAAOD,QAAUoC,G,cCAjBnC,EAAOD,QAAUqC,G,cCAjBpC,EAAOD,QAAUsC,G,6BCSjB,IAAIC,EAAuB,EAAQ,GAEnC,SAASC,KACT,SAASC,KACTA,EAAuBC,kBAAoBF,EAE3CvC,EAAOD,QAAU,WACf,SAAS2C,EAAKC,EAAOC,EAAUC,EAAeC,EAAUC,EAAcC,GACpE,GAAIA,IAAWV,EAAf,CAIA,IAAIW,EAAM,IAAIC,MACZ,mLAKF,MADAD,EAAIzC,KAAO,sBACLyC,GAGR,SAASE,IACP,OAAOT,EAFTA,EAAKU,WAAaV,EAMlB,IAAIW,EAAiB,CACnBC,MAAOZ,EACPa,KAAMb,EACNc,KAAMd,EACNe,OAAQf,EACRf,OAAQe,EACRgB,OAAQhB,EACRiB,OAAQjB,EAERkB,IAAKlB,EACLmB,QAASV,EACTW,QAASpB,EACTqB,YAAarB,EACbsB,WAAYb,EACZc,KAAMvB,EACNwB,SAAUf,EACVgB,MAAOhB,EACPiB,UAAWjB,EACXkB,MAAOlB,EACPmB,MAAOnB,EAEPoB,eAAgB/B,EAChBC,kBAAmBF,GAKrB,OAFAc,EAAemB,UAAYnB,EAEpBA,I,6BCnDTrD,EAAOD,QAFoB,gD,+CCOvB0E,EAAgB,SAASlE,EAAGmE,GAI5B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAGrB,SAASI,EAAUvE,EAAGmE,GACzB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,GAG5E,IAAIG,EAAW,WAQlB,OAPAA,EAAWzE,OAAO0E,QAAU,SAAkBlE,GAC1C,IAAK,IAAIa,EAAG/B,EAAI,EAAGyB,EAAI4D,UAAUC,OAAQtF,EAAIyB,EAAGzB,IAE5C,IAAK,IAAI8B,KADTC,EAAIsD,UAAUrF,GACOU,OAAOkB,UAAUC,eAAe1B,KAAK4B,EAAGD,KAAIZ,EAAEY,GAAKC,EAAED,IAE9E,OAAOZ,IAEKqE,MAAMN,KAAMI,YAoEH3E,OAAOY,OAwB7B,SAASkE,EAAO/E,EAAGgB,GACtB,IAAIrB,EAAsB,mBAAXW,QAAyBN,EAAEM,OAAO0E,UACjD,IAAKrF,EAAG,OAAOK,EACf,IAAmBK,EAAY4E,EAA3B1F,EAAII,EAAED,KAAKM,GAAOkF,EAAK,GAC3B,IACI,WAAc,IAANlE,GAAgBA,KAAM,MAAQX,EAAId,EAAE4F,QAAQC,MAAMF,EAAGG,KAAKhF,EAAEG,OAExE,MAAO8E,GAASL,EAAI,CAAEK,MAAOA,GAC7B,QACI,IACQjF,IAAMA,EAAE+E,OAASzF,EAAIJ,EAAU,SAAII,EAAED,KAAKH,GAElD,QAAU,GAAI0F,EAAG,MAAMA,EAAEK,OAE7B,OAAOJ,EAmBJ,SAASK,EAAcC,EAAIC,EAAMC,GACpC,GAAIA,GAA6B,IAArBd,UAAUC,OAAc,IAAK,IAA4BK,EAAxB3F,EAAI,EAAGC,EAAIiG,EAAKZ,OAAYtF,EAAIC,EAAGD,KACxE2F,GAAQ3F,KAAKkG,IACRP,IAAIA,EAAKf,MAAMhD,UAAUwE,MAAMjG,KAAK+F,EAAM,EAAGlG,IAClD2F,EAAG3F,GAAKkG,EAAKlG,IAGrB,OAAOiG,EAAGI,OAAOV,GAAMf,MAAMhD,UAAUwE,MAAMjG,KAAK+F,IAiC/C,SAASI,EAAqBC,EAAQC,GAEzC,OADI9F,OAAOC,eAAkBD,OAAOC,eAAe4F,EAAQ,MAAO,CAAEtF,MAAOuF,IAAiBD,EAAOC,IAAMA,EAClGD,EAGc7F,OAAOY,O,oBCvMhC,MAAMmF,EAAY,GACZC,EAAQ,GACd,SAASC,EAAgBpG,EAAMH,GAC7B,GAAIwE,MAAMgC,QAAQrG,GAChB,IAAK,MAAMsG,KAAStG,EAClBoG,EAAgBE,EAAOzG,QAM3B,GAAoB,iBAATG,EAQXuG,EAAepG,OAAOqG,oBAAoB3G,IAC1CqG,EAAUlG,GAAQG,OAAO0E,OAAOqB,EAAUlG,IAAS,GAAIH,QARrD,IAAK,MAAMyG,KAAStG,EAClBoG,EAAgBE,EAAOtG,EAAKsG,IASlC,SAASG,EAAczG,GACrB,OAAOkG,EAAUlG,IAAS,GAK5B,SAASuG,EAAeG,GACtBP,EAAMZ,QAAQmB,GAIhB,SAASC,EAAI7D,EAAO8D,GAClB,IAAInH,EACJ,MAAMoH,EAAK/D,EAAMiC,OACX+B,EAAS,GAEf,IAAKrH,EAAI,EAAGA,EAAIoH,EAAIpH,IAClBqH,EAAOvB,KAAKqB,EAAM9D,EAAMrD,KAG1B,OAAOqH,EAGT,SAASC,EAAOjE,EAAO8D,GACrB,IAAInH,EACJ,MAAMoH,EAAK/D,EAAMiC,OACX+B,EAAS,GAEf,IAAKrH,EAAI,EAAGA,EAAIoH,EAAIpH,IACdmH,EAAM9D,EAAMrD,KACdqH,EAAOvB,KAAKzC,EAAMrD,IAItB,OAAOqH,EAGT,SAASE,EAAQjH,GACf,OAAOA,EAAI,IAAMkH,KAAKC,GAAK,IAO7B,SAASC,EAAU3F,GACjB,OAAOA,EAAE4F,cAAcC,QAAQ,SAAS,SAAUxH,EAAGyH,GACnD,OAAOA,EAAEC,iBAIb,SAASC,EAAYhG,GACnB,OAAOA,EAAE6F,QAAQ,YAAY,SAAUxH,EAAGyH,GACxC,MAAO,IAAMA,EAAEF,iBAInB,SAASK,EAAWjG,GAClB,OAAOA,EAAEkG,OAAO,GAAGH,cAAgB/F,EAAEqE,MAAM,GAG7C,SAAS8B,EAAiBrE,EAASsE,EAAOC,EAAQC,GAWhD,OAVa,MAATF,GAA2B,MAAVC,IACnBC,EAAMA,GAAOxE,EAAQyE,OAER,MAATH,EACFA,EAAQE,EAAIF,MAAQE,EAAID,OAASA,EACd,MAAVA,IACTA,EAASC,EAAID,OAASC,EAAIF,MAAQA,IAI/B,CACLA,MAAOA,EACPC,OAAQA,GASZ,SAASG,EAAU9H,EAAGoD,GACpB,MAAM2E,EAAS/H,EAAE+H,OAEjB,IAAIC,EAAa,MAARhI,EAAEgI,GAAahI,EAAEgI,GAAkB,MAAbhI,EAAEiI,QAAkBjI,EAAEiI,QAAU,SAC3DC,EAAa,MAARlI,EAAEkI,GAAalI,EAAEkI,GAAkB,MAAblI,EAAEmI,QAAkBnI,EAAEmI,QAAU,SAEjD,MAAVJ,KACDC,EAAIE,GAAM/D,MAAMgC,QAAQ4B,GAAUA,EAA2B,iBAAXA,EAAsB,CAACA,EAAOK,EAAGL,EAAOM,GAAK,CAACN,EAAQA,IAI3G,MAAMO,EAAsB,iBAAPN,EACfO,EAAsB,iBAAPL,EAErB,GAAII,GAASC,EAAO,CAClB,MAAM,OACJZ,EAAM,MACND,EAAK,EACLU,EAAC,EACDC,GACEjF,EAAQyE,OAERS,IACFN,EAAKA,EAAGQ,SAAS,QAAUJ,EAAIJ,EAAGQ,SAAS,SAAWJ,EAAIV,EAAQU,EAAIV,EAAQ,GAG5Ea,IACFL,EAAKA,EAAGM,SAAS,OAASH,EAAIH,EAAGM,SAAS,UAAYH,EAAIV,EAASU,EAAIV,EAAS,GAKpF,MAAO,CAACK,EAAIE,GAiBd,MAAMO,EAAM,6BACNC,EAAO,+BACPC,EAAQ,gCACRC,EAAQ,+BACRC,EAAQ,yBAWd,MAAMC,EAAU,CACdC,OAA0B,oBAAXA,OAAyB,KAAOA,OAC/CC,SAA8B,oBAAbA,SAA2B,KAAOA,UAyBrD,MAAMC,GAUN,MAAM,EAAW,GACXC,EAAO,sBAEb,SAASrI,EAAOf,EAAMc,EAAK6H,GAEzB,OAAOK,EAAQE,SAASG,gBAAgBvI,EAAId,GAE9C,SAASsJ,EAAahG,EAASiG,GAAS,GACtC,GAAIjG,aAAmB6F,EAAM,OAAO7F,EAEpC,GAAuB,iBAAZA,EACT,OAAOkG,EAAQlG,GAGjB,GAAe,MAAXA,EACF,OAAO,IAAI,EAAS8F,GAGtB,GAAuB,iBAAZ9F,GAA8C,MAAtBA,EAAQoE,OAAO,GAChD,OAAO8B,EAAQR,EAAQE,SAASO,cAAcnG,IAIhD,MAAMoG,EAAUH,EAASP,EAAQE,SAASS,cAAc,OAAS5I,EAAO,OAOxE,OANA2I,EAAQE,UAAYtG,EAGpBA,EAAUkG,EAAQE,EAAQG,YAE1BH,EAAQI,YAAYJ,EAAQG,YACrBvG,EAET,SAASyG,EAAU/J,EAAMyD,GACvB,OAAOA,aAAgBuF,EAAQC,OAAOe,KAAOvG,EAAO1C,EAAOf,GAG7D,SAASiK,EAAMxG,GAEb,IAAKA,EAAM,OAAO,KAElB,GAAIA,EAAKyG,oBAAoBf,EAAM,OAAO1F,EAAKyG,SAE/C,GAAsB,uBAAlBzG,EAAK0G,SACP,OAAO,IAAI,EAASC,SAAS3G,GAI/B,IAAI4G,EAAY5C,EAAWhE,EAAK0G,UAAY,OAQ5C,MANkB,mBAAdE,GAAgD,mBAAdA,EACpCA,EAAY,WACF,EAASA,KACnBA,EAAY,OAGP,IAAI,EAASA,GAAW5G,GAEjC,IAAI+F,EAAUS,EAId,SAASK,EAAShH,EAAStD,EAAOsD,EAAQtD,KAAMuK,GAAS,GAIvD,OAHA,EAASvK,GAAQsD,EACbiH,IAAQ,EAASnB,GAAQ9F,GAC7BiD,EAAepG,OAAOqG,oBAAoBlD,EAAQjC,YAC3CiC,EAMT,IAAIkH,EAAM,IAEV,SAASC,EAAIzK,GACX,MAAO,QAAUyH,EAAWzH,GAAQwK,IAiBtC,SAASE,EAAO/K,EAASgL,GACvB,IAAI3J,EAAKvB,EAGT,IAAKA,GAFLE,EAAU0E,MAAMgC,QAAQ1G,GAAWA,EAAU,CAACA,IAE7BoF,OAAS,EAAGtF,GAAK,EAAGA,IACnC,IAAKuB,KAAO2J,EACVhL,EAAQF,GAAG4B,UAAUL,GAAO2J,EAAQ3J,GAI1C,SAAS4J,EAAkBC,GACzB,OAAO,YAAaC,GAClB,MAAM5K,EAAI4K,EAAKA,EAAK/F,OAAS,GAE7B,OAAI7E,GAAKA,EAAEyE,cAAgBxE,QAAYD,aAAamE,MAG3CwG,EAAG7F,MAAMN,KAAMoG,GAFfD,EAAG7F,MAAMN,KAAMoG,EAAKjF,MAAM,GAAI,IAAIkF,KAAK7K,IA6EpDkG,EAAgB,MAAO,CACrB4E,SAvEF,WACE,OAAOtG,KAAKuG,SAASC,YAuErBC,SApEF,WACE,OAAOzG,KAAKuG,SAASG,MAAM1G,OAoE3BW,KAjEF,WACE,OAAOX,KAAKsG,WAAWtG,KAAKyG,WAAa,IAiEzCE,KA9DF,WACE,OAAO3G,KAAKsG,WAAWtG,KAAKyG,WAAa,IA8DzCG,QA3DF,WACE,MAAM7L,EAAIiF,KAAKyG,WAIf,OAHUzG,KAAKuG,SAEbM,IAAI7G,KAAK8G,SAAU/L,EAAI,GAClBiF,MAuDP+G,SApDF,WACE,MAAMhM,EAAIiF,KAAKyG,WAGf,OAFUzG,KAAKuG,SACbM,IAAI7G,KAAK8G,SAAU/L,EAAIA,EAAI,EAAI,GAC1BiF,MAiDPgH,MA9CF,WAIE,OAHUhH,KAAKuG,SAEbM,IAAI7G,KAAK8G,UACJ9G,MA2CPiH,KAxCF,WAIE,OAHUjH,KAAKuG,SAEbM,IAAI7G,KAAK8G,SAAU,GACd9G,MAqCPkH,OAlCF,SAAgBtI,IACdA,EAAUgG,EAAahG,IACfkI,SACR,MAAM/L,EAAIiF,KAAKyG,WAEf,OADAzG,KAAKuG,SAASM,IAAIjI,EAAS7D,GACpBiF,MA8BPmH,MA3BF,SAAevI,IACbA,EAAUgG,EAAahG,IACfkI,SACR,MAAM/L,EAAIiF,KAAKyG,WAEf,OADAzG,KAAKuG,SAASM,IAAIjI,EAAS7D,EAAI,GACxBiF,MAuBPoH,aArBF,SAAsBxI,GAGpB,OAFAA,EAAUgG,EAAahG,IACfsI,OAAOlH,MACRA,MAmBPqH,YAjBF,SAAqBzI,GAGnB,OAFAA,EAAUgG,EAAahG,IACfuI,MAAMnH,MACPA,QAkBT,MAAMsH,EAAgB,qDAEhBC,EAAM,4CAENC,EAAM,2BAENC,EAAY,yBAEZC,EAAa,aAEbC,EAAa,MAEbC,EAAQ,iCAERC,EAAQ,SAERC,EAAU,WAEVC,EAAW,0CAEXC,GAAU,wCAEVC,GAAY,SAEZC,GAAe,gBAwMrB,SAASC,GAAaC,GACpB,MAAMC,EAAU9F,KAAK+F,MAAMF,GAErBb,EADUhF,KAAKgG,IAAI,EAAGhG,KAAKiG,IAAI,IAAKH,IACtBI,SAAS,IAC7B,OAAsB,IAAflB,EAAIlH,OAAe,IAAMkH,EAAMA,EAGxC,SAASmB,GAAGjM,EAAQkM,GAClB,IAAK,IAAI5N,EAAI4N,EAAMtI,OAAQtF,KACzB,GAAwB,MAApB0B,EAAOkM,EAAM5N,IACf,OAAO,EAIX,OAAO,EA0DT,SAAS6N,GAAS/L,EAAGgM,EAAG5M,GAGtB,OAFIA,EAAI,IAAGA,GAAK,GACZA,EAAI,IAAGA,GAAK,GACZA,EAAI,EAAI,EAAUY,EAAc,GAATgM,EAAIhM,GAASZ,EACpCA,EAAI,GAAc4M,EAClB5M,EAAI,EAAI,EAAUY,GAAKgM,EAAIhM,IAAM,EAAI,EAAIZ,GAAK,EAC3CY,EAnOT6E,EAAgB,MAAO,CACrBoH,QAjCF,WACE,MAAMzC,EAAOrG,KAAKqG,KAAK,SACvB,OAAe,MAARA,EAAe,GAAKA,EAAK0C,OAAOC,MAAMf,KAgC7CgB,SA7BF,SAAkB3N,GAChB,OAAyC,IAAlC0E,KAAK8I,UAAUI,QAAQ5N,IA6B9B6N,SA1BF,SAAkB7N,GAChB,IAAK0E,KAAKiJ,SAAS3N,GAAO,CACxB,MAAM8C,EAAQ4B,KAAK8I,UACnB1K,EAAMyC,KAAKvF,GACX0E,KAAKqG,KAAK,QAASjI,EAAMgL,KAAK,MAGhC,OAAOpJ,MAoBPqJ,YAjBF,SAAqB/N,GAOnB,OANI0E,KAAKiJ,SAAS3N,IAChB0E,KAAKqG,KAAK,QAASrG,KAAK8I,UAAUzG,QAAO,SAAUjH,GACjD,OAAOA,IAAME,KACZ8N,KAAK,MAGHpJ,MAWPsJ,YARF,SAAqBhO,GACnB,OAAO0E,KAAKiJ,SAAS3N,GAAQ0E,KAAKqJ,YAAY/N,GAAQ0E,KAAKmJ,SAAS7N,MAoEtEoG,EAAgB,MAAO,CACrB6H,IA3DF,SAAaC,EAAOC,GAClB,MAAMC,EAAM,GAEZ,GAAyB,IAArBtJ,UAAUC,OAQZ,OANAL,KAAKjB,KAAKyK,MAAMG,QAAQX,MAAM,WAAW3G,QAAO,SAAUuH,GACxD,QAASA,EAAGvJ,UACXwJ,SAAQ,SAAUD,GACnB,MAAM3N,EAAI2N,EAAGZ,MAAM,WACnBU,EAAIzN,EAAE,IAAMA,EAAE,MAETyN,EAGT,GAAItJ,UAAUC,OAAS,EAAG,CAExB,GAAIV,MAAMgC,QAAQ6H,GAAQ,CACxB,IAAK,MAAMlO,KAAQkO,EAAO,CACxB,MAAMM,EAAQrH,EAAUnH,GACxBoO,EAAII,GAAS9J,KAAKjB,KAAKyK,MAAMM,GAG/B,OAAOJ,EAIT,GAAqB,iBAAVF,EACT,OAAOxJ,KAAKjB,KAAKyK,MAAM/G,EAAU+G,IAInC,GAAqB,iBAAVA,EACT,IAAK,MAAMlO,KAAQkO,EAEjBxJ,KAAKjB,KAAKyK,MAAM/G,EAAUnH,IAAwB,MAAfkO,EAAMlO,IAAiBwM,EAAQiC,KAAKP,EAAMlO,IAAS,GAAKkO,EAAMlO,GAUvG,OAJyB,IAArB8E,UAAUC,SACZL,KAAKjB,KAAKyK,MAAM/G,EAAU+G,IAAiB,MAAPC,GAAe3B,EAAQiC,KAAKN,GAAO,GAAKA,GAGvEzJ,MAgBPgK,KAbF,WACE,OAAOhK,KAAKuJ,IAAI,UAAW,KAa3BU,KAVF,WACE,OAAOjK,KAAKuJ,IAAI,UAAW,SAU3BW,QAPF,WACE,MAA+B,SAAxBlK,KAAKuJ,IAAI,cAqClB7H,EAAgB,MAAO,CACrByI,KA7BF,SAAcC,EAAGC,EAAGxO,GAClB,GAAS,MAALuO,EAEF,OAAOpK,KAAKmK,KAAKlI,EAAII,EAAOrC,KAAKjB,KAAKuL,WAAYV,GAAuC,IAAjCA,EAAGnE,SAASyD,QAAQ,UAAiBU,GAAMA,EAAGnE,SAAStE,MAAM,KAChH,GAAIiJ,aAAazK,MAAO,CAC7B,MAAMwK,EAAO,GAEb,IAAK,MAAM7N,KAAO8N,EAChBD,EAAK7N,GAAO0D,KAAKmK,KAAK7N,GAGxB,OAAO6N,EACF,GAAiB,iBAANC,EAChB,IAAKC,KAAKD,EACRpK,KAAKmK,KAAKE,EAAGD,EAAEC,SAEZ,GAAIjK,UAAUC,OAAS,EAC5B,IACE,OAAOkK,KAAKC,MAAMxK,KAAKqG,KAAK,QAAU+D,IACtC,MAAO3J,GACP,OAAOT,KAAKqG,KAAK,QAAU+D,QAG7BpK,KAAKqG,KAAK,QAAU+D,EAAS,OAANC,EAAa,MAAa,IAANxO,GAA2B,iBAANwO,GAA+B,iBAANA,EAAiBA,EAAIE,KAAKE,UAAUJ,IAG/H,OAAOrK,QAwCT0B,EAAgB,MAAO,CACrBgJ,SAnCF,SAAkBC,EAAGN,GAEnB,GAA4B,iBAAjBjK,UAAU,GACnB,IAAK,MAAM9D,KAAOqO,EAChB3K,KAAK0K,SAASpO,EAAKqO,EAAErO,QAElB,IAAyB,IAArB8D,UAAUC,OAEnB,OAAOL,KAAK4K,SAASD,GAGrB3K,KAAK4K,SAASD,GAAKN,EAGrB,OAAOrK,MAsBP6K,OAnBF,WACE,GAAyB,IAArBzK,UAAUC,OACZL,KAAK8K,QAAU,QAEf,IAAK,IAAI/P,EAAIqF,UAAUC,OAAS,EAAGtF,GAAK,EAAGA,WAClCiF,KAAK4K,SAASxK,UAAUrF,IAInC,OAAOiF,MAWP4K,OANF,WACE,OAAO5K,KAAK8K,QAAU9K,KAAK8K,SAAW,MA6FxC,MAAMC,GACJ,eAAeC,GACbhL,KAAKiL,QAAQD,GAIf,eAAeE,GACb,OAAOA,IAAUA,aAAiBH,IAAS/K,KAAK6H,MAAMqD,IAAUlL,KAAK+J,KAAKmB,IAI5E,aAAaA,GACX,OAAOA,GAA4B,iBAAZA,EAAMrP,GAAqC,iBAAZqP,EAAMtI,GAAqC,iBAAZsI,EAAM1L,EAO7F,cAActD,EAAO,UAAWD,EAAGkP,GAEjC,MAAM,OACJC,EAAM,MACN9C,EAAK,IACL+C,EACA7I,GAAI8I,GACF/I,KAEJ,GAAa,YAATrG,EAAoB,CACtB,MAAMlB,EAAI,GAAYoQ,IAAW,GAC3BhQ,EAAI,GAAYgQ,IAAW,GAC3BG,EAAI,IAAMH,IAEhB,OADc,IAAIL,GAAM/P,EAAGI,EAAGmQ,EAAG,OAE5B,GAAa,SAATrP,EAAiB,CAE1B,MAAML,EAAIyM,EAAM,GAAK+C,EAAI,EAAIC,GAD7BrP,EAAS,MAALA,EAAYmP,IAAWnP,GACW,GAAM,KAAQ,KAC9C2G,EAAI0F,EAAM,GAAK+C,EAAI,EAAIC,EAAKrP,EAAI,GAAM,KAAO,KAC7CuD,EAAI8I,EAAM,IAAM+C,EAAI,EAAIC,EAAKrP,EAAI,GAAM,KAAO,KAEpD,OADc,IAAI8O,GAAMlP,EAAG+G,EAAGpD,GAEzB,GAAa,WAATtD,EAAmB,CAC5B,MAAMlB,EAAI,EAAYoQ,IAAW,GAC3BhQ,EAAI,GAAWgQ,IAAW,EAC1BG,EAAI,IAAMH,IAEhB,OADc,IAAIL,GAAM/P,EAAGI,EAAGmQ,EAAG,OAE5B,GAAa,SAATrP,EAAiB,CAC1B,MAAMlB,EAAI,GAAK,GAAKoQ,IACdhQ,EAAI,GAAagQ,IAAW,GAC5BG,EAAI,IAAMH,IAEhB,OADc,IAAIL,GAAM/P,EAAGI,EAAGmQ,EAAG,OAE5B,GAAa,QAATrP,EAAgB,CACzB,MAAML,EAAI,IAAMuP,IACVxI,EAAI,IAAMwI,IACV5L,EAAI,IAAM4L,IAEhB,OADc,IAAIL,GAAMlP,EAAG+G,EAAGpD,GAEzB,GAAa,QAATtD,EAAgB,CACzB,MAAMlB,EAAI,IAAMoQ,IACVhB,EAAI,IAAMgB,IAAW,IACrB5L,EAAI,IAAM4L,IAAW,IAE3B,OADc,IAAIL,GAAM/P,EAAGoP,EAAG5K,EAAG,OAE5B,GAAa,SAATtD,EAAiB,CAC1B,MAAMsP,EAAO,IAAMJ,IAEnB,OADc,IAAIL,GAAMS,EAAMA,EAAMA,GAGpC,MAAM,IAAIxN,MAAM,iCAKpB,YAAYkN,GACV,MAAwB,iBAAVA,IAAuBtD,EAAMmC,KAAKmB,IAAUrD,EAAMkC,KAAKmB,IAGvE,OAEE,MAAM,GACJO,EAAE,GACFC,EAAE,GACFC,GACE3L,KAAKwH,OACF3L,EAAG+G,EAAGpD,GAAK,CAACiM,EAAIC,EAAIC,GAAI1J,IAAIoI,GAAKA,EAAI,KAEtCM,EAAIpI,KAAKiG,IAAI,EAAI3M,EAAG,EAAI+G,EAAG,EAAIpD,GAErC,GAAU,IAANmL,EAEF,OAAO,IAAII,GAAM,EAAG,EAAG,EAAG,EAAG,QAQ/B,OADc,IAAIA,IAJP,EAAIlP,EAAI8O,IAAM,EAAIA,IAClB,EAAI/H,EAAI+H,IAAM,EAAIA,IAClB,EAAInL,EAAImL,IAAM,EAAIA,GAEIA,EAAG,QAItC,MAEE,MAAM,GACJc,EAAE,GACFC,EAAE,GACFC,GACE3L,KAAKwH,OACF3L,EAAG+G,EAAGpD,GAAK,CAACiM,EAAIC,EAAIC,GAAI1J,IAAIoI,GAAKA,EAAI,KAEtC9B,EAAMhG,KAAKgG,IAAI1M,EAAG+G,EAAGpD,GACrBgJ,EAAMjG,KAAKiG,IAAI3M,EAAG+G,EAAGpD,GACrBxE,GAAKuN,EAAMC,GAAO,EAElBoD,EAASrD,IAAQC,EAEjBqD,EAAQtD,EAAMC,EAKpB,OADc,IAAIuC,GAAM,KAFda,EAAS,EAAIrD,IAAQ1M,IAAM+G,EAAIpD,GAAKqM,GAASjJ,EAAIpD,EAAI,EAAI,IAAM,EAAI+I,IAAQ3F,IAAMpD,EAAI3D,GAAKgQ,EAAQ,GAAK,EAAItD,IAAQ/I,IAAM3D,EAAI+G,GAAKiJ,EAAQ,GAAK,EAAI,GAE5H,KAHvBD,EAAS,EAAI5Q,EAAI,GAAM6Q,GAAS,EAAItD,EAAMC,GAAOqD,GAAStD,EAAMC,IAGhC,IAAMxN,EAAG,OAIrD,KAAKoP,EAAI,EAAG5K,EAAI,EAAGpE,EAAI,EAAGC,EAAI,EAAGsN,EAAQ,OAIvC,GAFAyB,EAAKA,GAAI,EAELpK,KAAK2I,MACP,IAAK,MAAMP,KAAapI,KAAK2I,aACpB3I,KAAKA,KAAK2I,MAAMP,IAI3B,GAAiB,iBAANgC,EAETzB,EAAqB,iBAANtN,EAAiBA,EAAIsN,EACpCtN,EAAiB,iBAANA,EAAiB,EAAIA,EAEhCI,OAAO0E,OAAOH,KAAM,CAClByL,GAAIrB,EACJsB,GAAIlM,EACJmM,GAAIvQ,EACJ0Q,GAAIzQ,EACJsN,eAEG,GAAIyB,aAAazK,MACtBK,KAAK2I,MAAQnJ,IAAsB,iBAAT4K,EAAE,GAAkBA,EAAE,GAAKA,EAAE,KAAO,MAC9D3O,OAAO0E,OAAOH,KAAM,CAClByL,GAAIrB,EAAE,GACNsB,GAAItB,EAAE,GACNuB,GAAIvB,EAAE,GACN0B,GAAI1B,EAAE,IAAM,SAET,GAAIA,aAAa3O,OAAQ,CAE9B,MAAMsQ,EA9NZ,SAAuB3B,EAAG5K,GACxB,MAAMwM,EAAStD,GAAG0B,EAAG,OAAS,CAC5BqB,GAAIrB,EAAEvO,EACN6P,GAAItB,EAAExH,EACN+I,GAAIvB,EAAE5K,EACNsM,GAAI,EACJnD,MAAO,OACLD,GAAG0B,EAAG,OAAS,CACjBqB,GAAIrB,EAAExG,EACN8H,GAAItB,EAAEvG,EACN8H,GAAIvB,EAAE6B,EACNH,GAAI,EACJnD,MAAO,OACLD,GAAG0B,EAAG,OAAS,CACjBqB,GAAIrB,EAAEmB,EACNG,GAAItB,EAAEtN,EACN6O,GAAIvB,EAAEpP,EACN8Q,GAAI,EACJnD,MAAO,OACLD,GAAG0B,EAAG,OAAS,CACjBqB,GAAIrB,EAAEpP,EACN0Q,GAAItB,EAAEA,EACNuB,GAAIvB,EAAE5K,EACNsM,GAAI,EACJnD,MAAO,OACLD,GAAG0B,EAAG,OAAS,CACjBqB,GAAIrB,EAAEpP,EACN0Q,GAAItB,EAAEhP,EACNuQ,GAAIvB,EAAEmB,EACNO,GAAI,EACJnD,MAAO,OACLD,GAAG0B,EAAG,QAAU,CAClBqB,GAAIrB,EAAEhP,EACNsQ,GAAItB,EAAEjP,EACNwQ,GAAIvB,EAAEvG,EACNiI,GAAI1B,EAAEO,EACNhC,MAAO,QACL,CACF8C,GAAI,EACJC,GAAI,EACJC,GAAI,EACJhD,MAAO,OAGT,OADAqD,EAAOrD,MAAQnJ,GAAKwM,EAAOrD,MACpBqD,EAkLYE,CAAc9B,EAAG5K,GAChC/D,OAAO0E,OAAOH,KAAM+L,QACf,GAAiB,iBAAN3B,EAChB,GAAIvC,EAAMkC,KAAKK,GAAI,CACjB,MAAM+B,EAAe/B,EAAEzH,QAAQgF,EAAY,KACpC8D,EAAIC,EAAIC,GAAMnE,EAAI4E,KAAKD,GAAchL,MAAM,EAAG,GAAGc,IAAIoI,GAAKgC,SAAShC,IAC1E5O,OAAO0E,OAAOH,KAAM,CAClByL,KACAC,KACAC,KACAG,GAAI,EACJnD,MAAO,YAEJ,KAAIf,EAAMmC,KAAKK,GAWf,MAAMpM,MAAM,oDAXO,CACxB,MAAMsO,EAAWjC,GAAKgC,SAAShC,EAAG,KAE3B,CAAEoB,EAAIC,EAAIC,GAAMpE,EAAI6E,KAnQnC,SAAqB7E,GACnB,OAAsB,IAAfA,EAAIlH,OAAe,CAAC,IAAKkH,EAAIgF,UAAU,EAAG,GAAIhF,EAAIgF,UAAU,EAAG,GAAIhF,EAAIgF,UAAU,EAAG,GAAIhF,EAAIgF,UAAU,EAAG,GAAIhF,EAAIgF,UAAU,EAAG,GAAIhF,EAAIgF,UAAU,EAAG,IAAInD,KAAK,IAAM7B,EAkQnIiF,CAAYpC,IAAInI,IAAIqK,GACpD7Q,OAAO0E,OAAOH,KAAM,CAClByL,KACAC,KACAC,KACAG,GAAI,EACJnD,MAAO,SAMb,MAAM,GACJ8C,EAAE,GACFC,EAAE,GACFC,EAAE,GACFG,GACE9L,KACEyM,EAA4B,QAAfzM,KAAK2I,MAAkB,CACxC9M,EAAG4P,EACH7I,EAAG8I,EACHlM,EAAGmM,GACc,QAAf3L,KAAK2I,MAAkB,CACzB/E,EAAG6H,EACH5H,EAAG6H,EACHO,EAAGN,GACc,QAAf3L,KAAK2I,MAAkB,CACzB4C,EAAGE,EACH3O,EAAG4O,EACH1Q,EAAG2Q,GACc,QAAf3L,KAAK2I,MAAkB,CACzB3N,EAAGyQ,EACHrB,EAAGsB,EACHlM,EAAGmM,GACc,QAAf3L,KAAK2I,MAAkB,CACzB3N,EAAGyQ,EACHrQ,EAAGsQ,EACHH,EAAGI,GACc,SAAf3L,KAAK2I,MAAmB,CAC1BvN,EAAGqQ,EACHtQ,EAAGuQ,EACH7H,EAAG8H,EACHhB,EAAGmB,GACD,GACJrQ,OAAO0E,OAAOH,KAAMyM,GAGtB,MAEE,MAAM,EACJ7I,EAAC,EACDC,EAAC,EACDoI,GACEjM,KAAK0M,MAOT,OADc,IAAI3B,GAJR,IAAMlH,EAAI,GACV,KAAOD,EAAIC,GACX,KAAOA,EAAIoI,GAEY,OAInC,MAEE,MAAM,EACJjR,EAAC,EACDoP,EAAC,EACD5K,GACEQ,KAAK2M,MAEHvR,EAAImH,KAAKqK,KAAKxC,GAAK,EAAI5K,GAAK,GAClC,IAAI+L,EAAI,IAAMhJ,KAAKsK,MAAMrN,EAAG4K,GAAK7H,KAAKC,GAElC+I,EAAI,IACNA,IAAM,EACNA,EAAI,IAAMA,GAKZ,OADc,IAAIR,GAAM/P,EAAGI,EAAGmQ,EAAG,OAQnC,MACE,GAAmB,QAAfvL,KAAK2I,MACP,OAAO3I,KACF,GAzRK,SADE2I,EA0RM3I,KAAK2I,QAzRM,QAAVA,GAA6B,QAAVA,EAyRP,CAE/B,IAAI,EACF/E,EAAC,EACDC,EAAC,EACDoI,GACEjM,KAEJ,GAAmB,QAAfA,KAAK2I,OAAkC,QAAf3I,KAAK2I,MAAiB,CAEhD,IAAI,EACF3N,EAAC,EACDoP,EAAC,EACD5K,GACEQ,KAEJ,GAAmB,QAAfA,KAAK2I,MAAiB,CACxB,MAAM,EACJvN,EAAC,EACDmQ,GACEvL,KACE8M,EAAOvK,KAAKC,GAAK,IACvB4H,EAAIhP,EAAImH,KAAKwK,IAAID,EAAOvB,GACxB/L,EAAIpE,EAAImH,KAAK8I,IAAIyB,EAAOvB,GAI1B,MAAMyB,GAAMhS,EAAI,IAAM,IAChBiS,EAAK7C,EAAI,IAAM4C,EACfE,EAAKF,EAAKxN,EAAI,IAEd2N,EAAK,GAAK,IACVC,EAAK,QACLC,EAAK,MACXzJ,EAAI,QAAWqJ,GAAM,EAAIG,EAAKH,GAAM,GAAKA,EAAKE,GAAME,GACpDxJ,EAAI,GAAWmJ,GAAM,EAAII,EAAKJ,GAAM,GAAKA,EAAKG,GAAME,GACpDpB,EAAI,SAAWiB,GAAM,EAAIE,EAAKF,GAAM,GAAKA,EAAKC,GAAME,GAItD,MAAMC,EAAS,OAAJ1J,GAAkB,OAALC,GAAmB,MAALoI,EAChCsB,GAAU,MAAL3J,EAAkB,OAAJC,EAAiB,MAAJoI,EAChCuB,EAAS,MAAJ5J,GAAkB,KAALC,EAAkB,MAAJoI,EAEhCwB,EAAMlL,KAAKkL,IACXC,EAAK,SACL7R,EAAIyR,EAAKI,EAAK,MAAQD,EAAIH,EAAI,EAAI,KAAO,KAAQ,MAAQA,EACzD1K,EAAI2K,EAAKG,EAAK,MAAQD,EAAIF,EAAI,EAAI,KAAO,KAAQ,MAAQA,EACzD/N,EAAIgO,EAAKE,EAAK,MAAQD,EAAID,EAAI,EAAI,KAAO,KAAQ,MAAQA,EAG/D,OADc,IAAIzC,GAAM,IAAMlP,EAAG,IAAM+G,EAAG,IAAMpD,GAE3C,GAAmB,QAAfQ,KAAK2I,MAAiB,CAG/B,IAAI,EACF4C,EAAC,EACDzO,EAAC,EACD9B,GACEgF,KAKJ,GAJAuL,GAAK,IACLzO,GAAK,IACL9B,GAAK,IAEK,IAAN8B,EAAS,CACX9B,GAAK,IAEL,OADc,IAAI+P,GAAM/P,EAAGA,EAAGA,GAKhC,MAAM6N,EAAI7N,EAAI,GAAMA,GAAK,EAAI8B,GAAK9B,EAAI8B,EAAI9B,EAAI8B,EACxCD,EAAI,EAAI7B,EAAI6N,EAEZhN,EAAI,IAAM+M,GAAS/L,EAAGgM,EAAG0C,EAAI,EAAI,GACjC3I,EAAI,IAAMgG,GAAS/L,EAAGgM,EAAG0C,GACzB/L,EAAI,IAAMoJ,GAAS/L,EAAGgM,EAAG0C,EAAI,EAAI,GAGvC,OADc,IAAIR,GAAMlP,EAAG+G,EAAGpD,GAEzB,GAAmB,SAAfQ,KAAK2I,MAAkB,CAGhC,MAAM,EACJvN,EAAC,EACDD,EAAC,EACD0I,EAAC,EACD8G,GACE3K,KAEEnE,EAAI,KAAO,EAAI0G,KAAKiG,IAAI,EAAGpN,GAAK,EAAIuP,GAAKA,IACzC/H,EAAI,KAAO,EAAIL,KAAKiG,IAAI,EAAGrN,GAAK,EAAIwP,GAAKA,IACzCnL,EAAI,KAAO,EAAI+C,KAAKiG,IAAI,EAAG3E,GAAK,EAAI8G,GAAKA,IAG/C,OADc,IAAII,GAAMlP,EAAG+G,EAAGpD,GAG9B,OAAOQ,KA3Xb,IAAkB2I,EA+XhB,UACE,MAAM,GACJ8C,EAAE,GACFC,EAAE,GACFC,EAAE,GACFG,EAAE,MACFnD,GACE3I,KACJ,MAAO,CAACyL,EAAIC,EAAIC,EAAIG,EAAInD,GAG1B,QACE,MAAO9M,EAAG+G,EAAGpD,GAAKQ,KAAK2N,WAAW1L,IAAIkG,IAEtC,MAAO,IAAItM,IAAI+G,IAAIpD,IAGrB,QACE,MAAOoO,EAAIC,EAAIC,GAAM9N,KAAK2N,WAG1B,MADe,OAAOC,KAAMC,KAAMC,KAIpC,WACE,OAAO9N,KAAK+N,QAGd,MAEE,MACEtC,GAAIuC,EACJtC,GAAIuC,EACJtC,GAAIuC,GACFlO,KAAKwH,OACF3L,EAAG+G,EAAGpD,GAAK,CAACwO,EAAMC,EAAMC,GAAMjM,IAAIoI,GAAKA,EAAI,KAE5C8D,EAAKtS,EAAI,OAAU0G,KAAKkL,KAAK5R,EAAI,MAAS,MAAO,KAAOA,EAAI,MAC5DuS,EAAKxL,EAAI,OAAUL,KAAKkL,KAAK7K,EAAI,MAAS,MAAO,KAAOA,EAAI,MAC5DyL,EAAK7O,EAAI,OAAU+C,KAAKkL,KAAKjO,EAAI,MAAS,MAAO,KAAOA,EAAI,MAE5D8O,GAAW,MAALH,EAAmB,MAALC,EAAmB,MAALC,GAAe,OACjDE,GAAW,MAALJ,EAAmB,MAALC,EAAmB,MAALC,GAAe,EACjDG,GAAW,MAALL,EAAmB,MAALC,EAAmB,MAALC,GAAe,QAEjDzK,EAAI0K,EAAK,QAAW/L,KAAKkL,IAAIa,EAAI,EAAI,GAAK,MAAQA,EAAK,GAAK,IAC5DzK,EAAI0K,EAAK,QAAWhM,KAAKkL,IAAIc,EAAI,EAAI,GAAK,MAAQA,EAAK,GAAK,IAC5DtC,EAAIuC,EAAK,QAAWjM,KAAKkL,IAAIe,EAAI,EAAI,GAAK,MAAQA,EAAK,GAAK,IAGlE,OADc,IAAIzD,GAAMnH,EAAGC,EAAGoI,EAAG,OAQnC,WACE,MAAM,GACJR,EAAE,GACFC,EAAE,GACFC,GACE3L,KAAKwH,OACH,IACJe,EAAG,IACHC,EAAG,MACHF,GACE/F,KAIJ,MAAO,CAACkJ,EAAIC,EAAIC,GAAI1J,IAFLoI,GAAK9B,EAAI,EAAGC,EAAIF,EAAM+B,GAAI,QAW7C,MAAMoE,GAEJ,eAAerI,GACbpG,KAAKiL,QAAQ7E,GAIf,QACE,OAAO,IAAIqI,GAAMzO,MAGnB,KAAK4D,EAAGC,GACN,MAAM6K,EACD,EADCA,EAED,EAGCC,EAAShP,MAAMgC,QAAQiC,GAAK,CAChCA,EAAGA,EAAE,GACLC,EAAGD,EAAE,IACU,iBAANA,EAAiB,CAC1BA,EAAGA,EAAEA,EACLC,EAAGD,EAAEC,GACH,CACFD,EAAGA,EACHC,EAAGA,GAKL,OAFA7D,KAAK4D,EAAgB,MAAZ+K,EAAO/K,EAAY8K,EAASC,EAAO/K,EAC5C5D,KAAK6D,EAAgB,MAAZ8K,EAAO9K,EAAY6K,EAASC,EAAO9K,EACrC7D,KAGT,UACE,MAAO,CAACA,KAAK4D,EAAG5D,KAAK6D,GAGvB,UAAU1I,GACR,OAAO6E,KAAK4O,QAAQC,WAAW1T,GAIjC,WAAWA,GACJ2T,GAAOC,aAAa5T,KACvBA,EAAI,IAAI2T,GAAO3T,IAGjB,MAAM,EACJyI,EAAC,EACDC,GACE7D,KAIJ,OAFAA,KAAK4D,EAAIzI,EAAEiP,EAAIxG,EAAIzI,EAAEC,EAAIyI,EAAI1I,EAAEsF,EAC/BT,KAAK6D,EAAI1I,EAAEqE,EAAIoE,EAAIzI,EAAEE,EAAIwI,EAAI1I,EAAE6T,EACxBhP,MAQX,SAASiP,GAAY7E,EAAG5K,EAAG0P,GACzB,OAAO3M,KAAK4M,IAAI3P,EAAI4K,IAAM8E,GAAa,MAGzC,MAAMJ,GACJ,eAAe1I,GACbpG,KAAKiL,QAAQ7E,GAGf,wBAAwB5K,GAEtB,MAAM4T,EAAsB,SAAX5T,EAAE6T,OAA8B,IAAX7T,EAAE6T,KAClCC,EAAQ9T,EAAE6T,OAASD,GAAuB,MAAX5T,EAAE6T,OAAiB,EAAI,EACtDE,EAAQ/T,EAAE6T,OAASD,GAAuB,MAAX5T,EAAE6T,OAAiB,EAAI,EACtDG,EAAQhU,EAAEiU,MAAQjU,EAAEiU,KAAKpP,OAAS7E,EAAEiU,KAAK,GAAKC,SAASlU,EAAEiU,MAAQjU,EAAEiU,KAAOC,SAASlU,EAAEgU,OAAShU,EAAEgU,MAAQ,EACxGG,EAAQnU,EAAEiU,MAAQjU,EAAEiU,KAAKpP,OAAS7E,EAAEiU,KAAK,GAAKC,SAASlU,EAAEiU,MAAQjU,EAAEiU,KAAOC,SAASlU,EAAEmU,OAASnU,EAAEmU,MAAQ,EACxGC,EAASpU,EAAEqU,OAASrU,EAAEqU,MAAMxP,OAAS7E,EAAEqU,MAAM,GAAKP,EAAQI,SAASlU,EAAEqU,OAASrU,EAAEqU,MAAQP,EAAQI,SAASlU,EAAEoU,QAAUpU,EAAEoU,OAASN,EAAQA,EACxIQ,EAAStU,EAAEqU,OAASrU,EAAEqU,MAAMxP,OAAS7E,EAAEqU,MAAM,GAAKN,EAAQG,SAASlU,EAAEqU,OAASrU,EAAEqU,MAAQN,EAAQG,SAASlU,EAAEsU,QAAUtU,EAAEsU,OAASP,EAAQA,EACxIQ,EAAQvU,EAAEuU,OAAS,EACnBC,EAAQxU,EAAEyU,QAAUzU,EAAEwU,OAAS,EAC/BzM,EAAS,IAAIkL,GAAMjT,EAAE+H,QAAU/H,EAAE0U,QAAU1U,EAAEgI,IAAMhI,EAAEiI,QAASjI,EAAEkI,IAAMlI,EAAEmI,SACxEH,EAAKD,EAAOK,EACZF,EAAKH,EAAOM,EAEZ4C,EAAW,IAAIgI,GAAMjT,EAAEiL,UAAYjL,EAAE2U,IAAM3U,EAAE4U,WAAaC,IAAK7U,EAAE8U,IAAM9U,EAAE+U,WAAaF,KACtFF,EAAK1J,EAAS7C,EACd0M,EAAK7J,EAAS5C,EACd2M,EAAY,IAAI/B,GAAMjT,EAAEgV,WAAahV,EAAEiV,IAAMjV,EAAEkV,WAAYlV,EAAEmV,IAAMnV,EAAEoV,YACrEH,EAAKD,EAAU5M,EACf+M,EAAKH,EAAU3M,EACfgN,EAAW,IAAIpC,GAAMjT,EAAEqV,UAAYrV,EAAEsV,IAAMtV,EAAEuV,UAAWvV,EAAEwV,IAAMxV,EAAEyV,WAIxE,MAAO,CACLrB,SACAE,SACAN,QACAG,QACAI,QACAC,QACAc,GAVSD,EAASjN,EAWlBoN,GAVSH,EAAShN,EAWlB4M,KACAE,KACAnN,KACAE,KACAyM,KACAG,MAIJ,iBAAiBlG,GACf,MAAO,CACLA,EAAGA,EAAE,GACL5K,EAAG4K,EAAE,GACLhP,EAAGgP,EAAE,GACL/O,EAAG+O,EAAE,GACL3J,EAAG2J,EAAE,GACL4E,EAAG5E,EAAE,IAIT,oBAAoB5O,GAClB,OAAc,MAAPA,EAAE4O,GAAoB,MAAP5O,EAAEgE,GAAoB,MAAPhE,EAAEJ,GAAoB,MAAPI,EAAEH,GAAoB,MAAPG,EAAEiF,GAAoB,MAAPjF,EAAEwT,EAItF,sBAAsBhU,EAAGa,EAAGL,GAE1B,MAAM4O,EAAIpP,EAAEoP,EAAIvO,EAAEuO,EAAIpP,EAAEI,EAAIS,EAAE2D,EACxBA,EAAIxE,EAAEwE,EAAI3D,EAAEuO,EAAIpP,EAAEK,EAAIQ,EAAE2D,EACxBpE,EAAIJ,EAAEoP,EAAIvO,EAAET,EAAIJ,EAAEI,EAAIS,EAAER,EACxBA,EAAIL,EAAEwE,EAAI3D,EAAET,EAAIJ,EAAEK,EAAIQ,EAAER,EACxBoF,EAAIzF,EAAEyF,EAAIzF,EAAEoP,EAAIvO,EAAE4E,EAAIzF,EAAEI,EAAIS,EAAEmT,EAC9BA,EAAIhU,EAAEgU,EAAIhU,EAAEwE,EAAI3D,EAAE4E,EAAIzF,EAAEK,EAAIQ,EAAEmT,EAQpC,OANAxT,EAAE4O,EAAIA,EACN5O,EAAEgE,EAAIA,EACNhE,EAAEJ,EAAIA,EACNI,EAAEH,EAAIA,EACNG,EAAEiF,EAAIA,EACNjF,EAAEwT,EAAIA,EACCxT,EAGT,OAAO0V,EAAIC,EAAIC,GACb,OAAOpR,KAAK4O,QAAQyC,QAAQH,EAAIC,EAAIC,GAItC,QAAQF,EAAIC,EAAIC,GACd,MAAME,EAAKJ,GAAM,EACXK,EAAKJ,GAAM,EACjB,OAAOnR,KAAKwR,YAAYF,GAAKC,GAAIE,WAAWL,GAAQI,WAAWF,EAAIC,GAIrE,QACE,OAAO,IAAIzC,GAAO9O,MAIpB,UAAUkR,EAAK,EAAGC,EAAK,GAErB,MAAM/G,EAAIpK,KAAKoK,EACT5K,EAAIQ,KAAKR,EACTpE,EAAI4E,KAAK5E,EACTC,EAAI2E,KAAK3E,EACToF,EAAIT,KAAKS,EACTuO,EAAIhP,KAAKgP,EAET0C,EAActH,EAAI/O,EAAImE,EAAIpE,EAC1BuW,EAAMD,EAAc,EAAI,GAAK,EAG7BE,EAAKD,EAAMpP,KAAKqK,KAAKxC,EAAIA,EAAI5K,EAAIA,GACjCqS,EAAWtP,KAAKsK,MAAM8E,EAAMnS,EAAGmS,EAAMvH,GACrC4F,EAAQ,IAAMzN,KAAKC,GAAKqP,EACxB1E,EAAK5K,KAAKwK,IAAI8E,GACdC,EAAKvP,KAAK8I,IAAIwG,GAGdE,GAAO3H,EAAIhP,EAAIoE,EAAInE,GAAKqW,EACxBM,EAAK5W,EAAIwW,GAAMG,EAAM3H,EAAI5K,IAAMnE,EAAIuW,GAAMG,EAAMvS,EAAI4K,GAKzD,MAAO,CAELwF,OAAQgC,EACR9B,OAAQkC,EACRjC,MAAOgC,EACP9B,OAAQD,EACRU,WATSjQ,EAAIyQ,EAAKA,EAAK/D,EAAKyE,EAAKT,GAAMY,EAAM5E,EAAKyE,EAAKE,EAAKE,GAU5DpB,WATS5B,EAAImC,EAAKD,EAAKY,EAAKF,EAAKT,GAAMY,EAAMD,EAAKF,EAAKzE,EAAK6E,GAU5DvO,QAASyN,EACTvN,QAASwN,EAET/G,EAAGpK,KAAKoK,EACR5K,EAAGQ,KAAKR,EACRpE,EAAG4E,KAAK5E,EACRC,EAAG2E,KAAK3E,EACRoF,EAAGT,KAAKS,EACRuO,EAAGhP,KAAKgP,GAKZ,OAAOiD,GACL,GAAIA,IAAUjS,KAAM,OAAO,EAC3B,MAAMkS,EAAO,IAAIpD,GAAOmD,GACxB,OAAOhD,GAAYjP,KAAKoK,EAAG8H,EAAK9H,IAAM6E,GAAYjP,KAAKR,EAAG0S,EAAK1S,IAAMyP,GAAYjP,KAAK5E,EAAG8W,EAAK9W,IAAM6T,GAAYjP,KAAK3E,EAAG6W,EAAK7W,IAAM4T,GAAYjP,KAAKS,EAAGyR,EAAKzR,IAAMwO,GAAYjP,KAAKgP,EAAGkD,EAAKlD,GAI7L,KAAKmD,EAAMjC,GACT,OAAOlQ,KAAK4O,QAAQwD,MAAMD,EAAMjC,GAGlC,MAAMiC,EAAMjC,GACV,MAAgB,MAATiC,EAAenS,KAAKqS,QAAQ,EAAG,EAAGnC,EAAQ,GAAc,MAATiC,EAAenS,KAAKqS,OAAO,GAAI,EAAG,EAAGnC,GAAUlQ,KAAKqS,QAAQ,GAAI,EAAGF,EAAMjC,GAAUiC,GAI3I,KAAKxD,GACH,MAAMD,EAAOI,GAAOwD,UAAU,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,IAU9C,OARA3D,EAASA,aAAkB4D,GAAU5D,EAAO6D,YAAgC,iBAAX7D,EAAsBG,GAAOwD,UAAU3D,EAAO3F,MAAMf,IAAWhG,IAAIwQ,aAAe9S,MAAMgC,QAAQgN,GAAUG,GAAOwD,UAAU3D,GAA4B,iBAAXA,GAAuBG,GAAOC,aAAaJ,GAAUA,EAA2B,iBAAXA,GAAsB,IAAIG,IAAS4D,UAAU/D,GAA+B,IAArBvO,UAAUC,OAAeyO,GAAOwD,UAAU,GAAGnR,MAAMjG,KAAKkF,YAAcsO,EAE/Y1O,KAAKoK,EAAgB,MAAZuE,EAAOvE,EAAYuE,EAAOvE,EAAIsE,EAAKtE,EAC5CpK,KAAKR,EAAgB,MAAZmP,EAAOnP,EAAYmP,EAAOnP,EAAIkP,EAAKlP,EAC5CQ,KAAK5E,EAAgB,MAAZuT,EAAOvT,EAAYuT,EAAOvT,EAAIsT,EAAKtT,EAC5C4E,KAAK3E,EAAgB,MAAZsT,EAAOtT,EAAYsT,EAAOtT,EAAIqT,EAAKrT,EAC5C2E,KAAKS,EAAgB,MAAZkO,EAAOlO,EAAYkO,EAAOlO,EAAIiO,EAAKjO,EAC5CT,KAAKgP,EAAgB,MAAZL,EAAOK,EAAYL,EAAOK,EAAIN,EAAKM,EACrChP,KAGT,UACE,OAAOA,KAAK4O,QAAQ+D,WAItB,WAEE,MAAMvI,EAAIpK,KAAKoK,EACT5K,EAAIQ,KAAKR,EACTpE,EAAI4E,KAAK5E,EACTC,EAAI2E,KAAK3E,EACToF,EAAIT,KAAKS,EACTuO,EAAIhP,KAAKgP,EAET4D,EAAMxI,EAAI/O,EAAImE,EAAIpE,EACxB,IAAKwX,EAAK,MAAM,IAAI5U,MAAM,iBAAmBgC,MAE7C,MAAM6S,EAAKxX,EAAIuX,EACTE,GAAMtT,EAAIoT,EACVG,GAAM3X,EAAIwX,EACVI,EAAK5I,EAAIwI,EAETK,IAAOJ,EAAKpS,EAAIsS,EAAK/D,GACrBkE,IAAOJ,EAAKrS,EAAIuS,EAAKhE,GAQ3B,OANAhP,KAAKoK,EAAIyI,EACT7S,KAAKR,EAAIsT,EACT9S,KAAK5E,EAAI2X,EACT/S,KAAK3E,EAAI2X,EACThT,KAAKS,EAAIwS,EACTjT,KAAKgP,EAAIkE,EACFlT,KAGT,UAAUoR,GACR,OAAOpR,KAAK4O,QAAQ6C,WAAWL,GAGjC,WAAWA,GACT,MACMpW,EAAIoW,aAAkBtC,GAASsC,EAAS,IAAItC,GAAOsC,GACzD,OAAOtC,GAAOqE,eAAenY,EAFnBgF,KAEyBA,MAIrC,SAASoR,GACP,OAAOpR,KAAK4O,QAAQwE,UAAUhC,GAGhC,UAAUA,GAER,MACMvV,EAAIuV,aAAkBtC,GAASsC,EAAS,IAAItC,GAAOsC,GACzD,OAAOtC,GAAOqE,eAFJnT,KAEsBnE,EAAGmE,MAIrC,OAAOnE,EAAGqV,EAAIC,GACZ,OAAOnR,KAAK4O,QAAQyE,QAAQxX,EAAGqV,EAAIC,GAGrC,QAAQtV,EAAGqV,EAAK,EAAGC,EAAK,GAEtBtV,EAAIyG,EAAQzG,GACZ,MAAMkR,EAAMxK,KAAKwK,IAAIlR,GACfwP,EAAM9I,KAAK8I,IAAIxP,IACf,EACJuO,EAAC,EACD5K,EAAC,EACDpE,EAAC,EACDC,EAAC,EACDoF,EAAC,EACDuO,GACEhP,KAOJ,OANAA,KAAKoK,EAAIA,EAAI2C,EAAMvN,EAAI6L,EACvBrL,KAAKR,EAAIA,EAAIuN,EAAM3C,EAAIiB,EACvBrL,KAAK5E,EAAIA,EAAI2R,EAAM1R,EAAIgQ,EACvBrL,KAAK3E,EAAIA,EAAI0R,EAAM3R,EAAIiQ,EACvBrL,KAAKS,EAAIA,EAAIsM,EAAMiC,EAAI3D,EAAM8F,EAAK9F,EAAM6F,EAAKnE,EAAMmE,EACnDlR,KAAKgP,EAAIA,EAAIjC,EAAMtM,EAAI4K,EAAM6F,EAAK7F,EAAM8F,EAAKpE,EAAMoE,EAC5CnR,KAIT,MAAM4D,EAAGC,EAAGqN,EAAIC,GACd,OAAOnR,KAAK4O,QAAQyD,UAAUjS,WAGhC,OAAOwD,EAAGC,EAAID,EAAGsN,EAAK,EAAGC,EAAK,GAEH,IAArB/Q,UAAUC,SACZ8Q,EAAKD,EACLA,EAAKrN,EACLA,EAAID,GAGN,MAAM,EACJwG,EAAC,EACD5K,EAAC,EACDpE,EAAC,EACDC,EAAC,EACDoF,EAAC,EACDuO,GACEhP,KAOJ,OANAA,KAAKoK,EAAIA,EAAIxG,EACb5D,KAAKR,EAAIA,EAAIqE,EACb7D,KAAK5E,EAAIA,EAAIwI,EACb5D,KAAK3E,EAAIA,EAAIwI,EACb7D,KAAKS,EAAIA,EAAImD,EAAIsN,EAAKtN,EAAIsN,EAC1BlR,KAAKgP,EAAIA,EAAInL,EAAIsN,EAAKtN,EAAIsN,EACnBnR,KAIT,MAAMoK,EAAG8G,EAAIC,GACX,OAAOnR,KAAK4O,QAAQ0E,OAAOlJ,EAAG8G,EAAIC,GAGpC,OAAOoC,EAAIrC,EAAK,EAAGC,EAAK,GACtB,MAAM,EACJ/G,EAAC,EACD5K,EAAC,EACDpE,EAAC,EACDC,EAAC,EACDoF,EAAC,EACDuO,GACEhP,KAIJ,OAHAA,KAAKoK,EAAIA,EAAI5K,EAAI+T,EACjBvT,KAAK5E,EAAIA,EAAIC,EAAIkY,EACjBvT,KAAKS,EAAIA,EAAIuO,EAAIuE,EAAKpC,EAAKoC,EACpBvT,KAIT,KAAK4D,EAAGC,EAAGqN,EAAIC,GACb,OAAOnR,KAAK4O,QAAQ4E,SAASpT,WAG/B,MAAMwD,EAAGC,EAAID,EAAGsN,EAAK,EAAGC,EAAK,GAEF,IAArB/Q,UAAUC,SACZ8Q,EAAKD,EACLA,EAAKrN,EACLA,EAAID,GAINA,EAAItB,EAAQsB,GACZC,EAAIvB,EAAQuB,GACZ,MAAM0P,EAAKhR,KAAKkR,IAAI7P,GACd8P,EAAKnR,KAAKkR,IAAI5P,IACd,EACJuG,EAAC,EACD5K,EAAC,EACDpE,EAAC,EACDC,EAAC,EACDoF,EAAC,EACDuO,GACEhP,KAOJ,OANAA,KAAKoK,EAAIA,EAAI5K,EAAI+T,EACjBvT,KAAKR,EAAIA,EAAI4K,EAAIsJ,EACjB1T,KAAK5E,EAAIA,EAAIC,EAAIkY,EACjBvT,KAAK3E,EAAIA,EAAID,EAAIsY,EACjB1T,KAAKS,EAAIA,EAAIuO,EAAIuE,EAAKpC,EAAKoC,EAC3BvT,KAAKgP,EAAIA,EAAIvO,EAAIiT,EAAKxC,EAAKwC,EACpB1T,KAIT,MAAM4D,EAAGsN,EAAIC,GACX,OAAOnR,KAAKyP,KAAK7L,EAAG,EAAGsN,EAAIC,GAI7B,MAAMtN,EAAGqN,EAAIC,GACX,OAAOnR,KAAKyP,KAAK,EAAG5L,EAAGqN,EAAIC,GAG7B,UACE,MAAO,CAACnR,KAAKoK,EAAGpK,KAAKR,EAAGQ,KAAK5E,EAAG4E,KAAK3E,EAAG2E,KAAKS,EAAGT,KAAKgP,GAIvD,WACE,MAAO,UAAYhP,KAAKoK,EAAI,IAAMpK,KAAKR,EAAI,IAAMQ,KAAK5E,EAAI,IAAM4E,KAAK3E,EAAI,IAAM2E,KAAKS,EAAI,IAAMT,KAAKgP,EAAI,IAIzG,UAAUxT,GAER,GAAIsT,GAAOC,aAAavT,GAAI,CAE1B,OADe,IAAIsT,GAAOtT,GACZ4X,UAAUpT,MAI1B,MAAM/D,EAAI6S,GAAO6E,iBAAiBnY,IAGhCoI,EAAGJ,EACHK,EAAGH,GACD,IAAI+K,GAAMxS,EAAEuH,GAAIvH,EAAEyH,IAAIgP,UAJV1S,MAMV4T,GAAc,IAAI9E,IAAS0C,WAAWvV,EAAE6U,GAAI7U,EAAE+U,IAAIS,WANxCzR,MAM4DwR,YAAYhO,GAAKE,GAAI2O,OAAOpW,EAAE2T,OAAQ3T,EAAE6T,QAAQ0D,MAAMvX,EAAEuT,MAAOvT,EAAE0T,OAAO2D,OAAOrX,EAAE8T,OAAOsD,QAAQpX,EAAE+T,OAAOwB,WAAWhO,EAAIE,GAEpM,GAAIgM,SAASzT,EAAEkU,KAAOT,SAASzT,EAAEqU,IAAK,CACpC,MAAM/M,EAAS,IAAIkL,GAAMjL,EAAIE,GAAIgP,UAAUkB,GAGrCtC,EAAK5B,SAASzT,EAAEkU,IAAMlU,EAAEkU,GAAK5M,EAAOK,EAAI,EACxC2N,EAAK7B,SAASzT,EAAEqU,IAAMrU,EAAEqU,GAAK/M,EAAOM,EAAI,EAC9C+P,EAAYpC,WAAWF,EAAIC,GAK7B,OADAqC,EAAYpC,WAAWvV,EAAEwU,GAAIxU,EAAE0U,IACxBiD,EAIT,UAAUhQ,EAAGC,GACX,OAAO7D,KAAK4O,QAAQ4C,WAAW5N,EAAGC,GAGpC,WAAWD,EAAGC,GAGZ,OAFA7D,KAAKS,GAAKmD,GAAK,EACf5D,KAAKgP,GAAKnL,GAAK,EACR7D,KAGT,UACE,MAAO,CACLoK,EAAGpK,KAAKoK,EACR5K,EAAGQ,KAAKR,EACRpE,EAAG4E,KAAK5E,EACRC,EAAG2E,KAAK3E,EACRoF,EAAGT,KAAKS,EACRuO,EAAGhP,KAAKgP,IAwBd,SAAS6E,KAEP,IAAKA,GAAOC,MAAO,CACjB,MAAM7P,EAAMW,IAAemP,KAAK,EAAG,GACnC9P,EAAIlF,KAAKyK,MAAMG,QAAU,CAAC,aAAc,qBAAsB,cAAe,aAAc,oBAAoBP,KAAK,KACpHnF,EAAIoC,KAAK,YAAa,SACtBpC,EAAIoC,KAAK,cAAe,QACxB,MAAM2N,EAAO/P,EAAI+P,OAAOjV,KACxB8U,GAAOC,MAAQ,CACb7P,MACA+P,QAIJ,IAAKH,GAAOC,MAAM7P,IAAIlF,KAAKkV,WAAY,CACrC,MAAMzU,EAAI8E,EAAQE,SAAS0P,MAAQ5P,EAAQE,SAAS2P,gBACpDN,GAAOC,MAAM7P,IAAImQ,MAAM5U,GAGzB,OAAOqU,GAAOC,MAGhB,SAASO,GAAYjR,GACnB,QAAQA,EAAIF,OAAUE,EAAID,QAAWC,EAAIQ,GAAMR,EAAIS,GAzBrD+B,EAASkJ,GAAQ,UAqCjB,MAAMwF,GACJ,eAAelO,GACbpG,KAAKiL,QAAQ7E,GAGf,YAIE,OAFApG,KAAK4D,GAAKU,EAAQC,OAAOgQ,YACzBvU,KAAK6D,GAAKS,EAAQC,OAAOiQ,YAClB,IAAIF,GAAItU,MAGjB,KAAK2O,GAYH,OAVAA,EAA2B,iBAAXA,EAAsBA,EAAO3F,MAAMf,IAAWhG,IAAIwQ,YAAc9S,MAAMgC,QAAQgN,GAAUA,EAA2B,iBAAXA,EAAsB,CAAgB,MAAfA,EAAO8F,KAAe9F,EAAO8F,KAAO9F,EAAO/K,EAAiB,MAAd+K,EAAO+F,IAAc/F,EAAO+F,IAAM/F,EAAO9K,EAAG8K,EAAOzL,MAAOyL,EAAOxL,QAA+B,IAArB/C,UAAUC,OAAe,GAAGc,MAAMjG,KAAKkF,WADlS,CAAC,EAAG,EAAG,EAAG,GAEvBJ,KAAK4D,EAAI+K,EAAO,IAAM,EACtB3O,KAAK6D,EAAI8K,EAAO,IAAM,EACtB3O,KAAKkD,MAAQlD,KAAK2U,EAAIhG,EAAO,IAAM,EACnC3O,KAAKmD,OAASnD,KAAKuL,EAAIoD,EAAO,IAAM,EAEpC3O,KAAK4U,GAAK5U,KAAK4D,EAAI5D,KAAK2U,EACxB3U,KAAK6U,GAAK7U,KAAK6D,EAAI7D,KAAKuL,EACxBvL,KAAKkR,GAAKlR,KAAK4D,EAAI5D,KAAK2U,EAAI,EAC5B3U,KAAKmR,GAAKnR,KAAK6D,EAAI7D,KAAKuL,EAAI,EACrBvL,KAGT,WACE,OAAOqU,GAAYrU,MAIrB,MAAMoD,GACJ,MAAMQ,EAAIrB,KAAKiG,IAAIxI,KAAK4D,EAAGR,EAAIQ,GACzBC,EAAItB,KAAKiG,IAAIxI,KAAK6D,EAAGT,EAAIS,GACzBX,EAAQX,KAAKgG,IAAIvI,KAAK4D,EAAI5D,KAAKkD,MAAOE,EAAIQ,EAAIR,EAAIF,OAASU,EAC3DT,EAASZ,KAAKgG,IAAIvI,KAAK6D,EAAI7D,KAAKmD,OAAQC,EAAIS,EAAIT,EAAID,QAAUU,EACpE,OAAO,IAAIyQ,GAAI1Q,EAAGC,EAAGX,EAAOC,GAG9B,UACE,MAAO,CAACnD,KAAK4D,EAAG5D,KAAK6D,EAAG7D,KAAKkD,MAAOlD,KAAKmD,QAG3C,WACE,OAAOnD,KAAK4D,EAAI,IAAM5D,KAAK6D,EAAI,IAAM7D,KAAKkD,MAAQ,IAAMlD,KAAKmD,OAG/D,UAAUhI,GACFA,aAAa2T,KACjB3T,EAAI,IAAI2T,GAAO3T,IAGjB,IAAI2Z,EAAOC,IACPC,GAAQD,IACRE,EAAOF,IACPG,GAAQH,IASZ,MARY,CAAC,IAAItG,GAAMzO,KAAK4D,EAAG5D,KAAK6D,GAAI,IAAI4K,GAAMzO,KAAK4U,GAAI5U,KAAK6D,GAAI,IAAI4K,GAAMzO,KAAK4D,EAAG5D,KAAK6U,IAAK,IAAIpG,GAAMzO,KAAK4U,GAAI5U,KAAK6U,KACpHhL,SAAQ,SAAUhN,GACpBA,EAAIA,EAAE6V,UAAUvX,GAChB2Z,EAAOvS,KAAKiG,IAAIsM,EAAMjY,EAAE+G,GACxBoR,EAAOzS,KAAKgG,IAAIyM,EAAMnY,EAAE+G,GACxBqR,EAAO1S,KAAKiG,IAAIyM,EAAMpY,EAAEgH,GACxBqR,EAAO3S,KAAKgG,IAAI2M,EAAMrY,EAAEgH,MAEnB,IAAIyQ,GAAIQ,EAAMG,EAAMD,EAAOF,EAAMI,EAAOD,IAKnD,SAASE,GAAOvL,EAAIwL,EAAWC,GAC7B,IAAIjS,EAEJ,IAKE,GAHAA,EAAMgS,EAAUxL,EAAG7K,MAGfsV,GAAYjR,MAxFCrE,EAwFoB6K,EAAG7K,QAvF1BuF,EAAQE,YAAaF,EAAQE,SAAS2P,gBAAgBmB,UAAY,SAAUvW,GAE1F,KAAOA,EAAKkV,YACVlV,EAAOA,EAAKkV,WAGd,OAAOlV,IAASuF,EAAQE,WACvBtJ,KAAKoJ,EAAQE,SAAS2P,gBAAiBpV,IAiFtC,MAAM,IAAIf,MAAM,0BAElB,MAAOyC,GAEP2C,EAAMiS,EAAMzL,GA7FhB,IAAqB7K,EAgGnB,OAAOqE,EAkDT1B,EAAgB,CACd6T,QAAS,CACP,QAAQ3R,EAAGC,EAAGX,EAAOC,GAEnB,OAAS,MAALS,EAAkB,IAAI0Q,GAAItU,KAAKqG,KAAK,YAEjCrG,KAAKqG,KAAK,UAAW,IAAIiO,GAAI1Q,EAAGC,EAAGX,EAAOC,KAGnD,KAAKqS,EAAOC,GAQV,IAAI,MACFvS,EAAK,OACLC,GACEnD,KAAKqG,KAAK,CAAC,QAAS,WASxB,IANKnD,GAAUC,IAA2B,iBAAVD,GAAwC,iBAAXC,IAC3DD,EAAQlD,KAAKjB,KAAK2W,YAClBvS,EAASnD,KAAKjB,KAAK4W,eAIhBzS,IAAUC,EACb,MAAM,IAAInF,MAAM,6HAGlB,MAAMqM,EAAIrK,KAAKuV,UACTK,EAAQ1S,EAAQmH,EAAEnH,MAClB2S,EAAQ1S,EAASkH,EAAElH,OACnB2S,EAAOvT,KAAKiG,IAAIoN,EAAOC,GAE7B,GAAa,MAATL,EACF,OAAOM,EAGT,IAAIC,EAAaD,EAAON,EAGpBO,IAAehB,MAAUgB,EAAaC,OAAOC,iBAAmB,KACpER,EAAQA,GAAS,IAAIhH,GAAMvL,EAAQ,EAAI0S,EAAQvL,EAAEzG,EAAGT,EAAS,EAAI0S,EAAQxL,EAAExG,GAC3E,MAAMT,EAAM,IAAIkR,GAAIjK,GAAGqI,UAAU,IAAI5D,GAAO,CAC1Ce,MAAOkG,EACPxS,OAAQkS,KAEV,OAAOzV,KAAKuV,QAAQnS,OAK1BwC,EAAS0O,GAAK,OAEd,MAAM4B,WAAavW,MACjB,YAAYwW,EAAM,MAAO/P,GAEvB,GADAgQ,MAAMD,KAAQ/P,GACK,iBAAR+P,EAAkB,OAAOnW,KACpCA,KAAKK,OAAS,EACdL,KAAKa,QAAQsV,IAIjBnQ,EAAO,CAACkQ,IAAO,CACb,KAAKG,KAAmBjQ,GACtB,MAA8B,mBAAnBiQ,EACFrW,KAAKiC,IAAI,CAAC2H,EAAI7O,EAAGob,IACfE,EAAenb,KAAK0O,EAAIA,EAAI7O,EAAGob,IAGjCnW,KAAKiC,IAAI2H,GACPA,EAAGyM,MAAmBjQ,KAKnC,UACE,OAAOzG,MAAMhD,UAAUyE,OAAOd,MAAM,GAAIN,SAI5C,MAAMsW,GAAW,CAAC,UAAW,cAAe,QAkB5C,SAASC,GAASC,EAAOjQ,GACvB,OAAO,IAAI2P,GAAKjU,GAAKsE,GAAUjC,EAAQE,UAAUiS,iBAAiBD,IAAQ,SAAUzX,GAClF,OAAOwG,EAAMxG,OAlBjBmX,GAAKlQ,OAAS,SAAUC,GACtBA,EAAUA,EAAQyQ,OAAO,CAACC,EAAKrb,KAEzBgb,GAAStS,SAAS1I,IAEN,MAAZA,EAAK,KAETqb,EAAIrb,GAAQ,YAAasb,GACvB,OAAO5W,KAAK6W,KAAKvb,KAASsb,KALQD,GASnC,IACH3Q,EAAO,CAACkQ,IAAOjQ,IAgBjB,IAAI6Q,GAAa,EACjB,MAAMC,GAAe,GACrB,SAASC,GAAUxR,GACjB,IAAIhJ,EAAIgJ,EAASyR,iBAIjB,OAFIza,IAAM8H,EAAQC,SAAQ/H,EAAIua,IACzBva,EAAE0a,SAAQ1a,EAAE0a,OAAS,IACnB1a,EAAE0a,OAEX,SAASC,GAAe3R,GACtB,OAAOA,EAAS2R,iBAQlB,SAASC,GAAGrY,EAAMmY,EAAQG,EAAUC,EAASC,GAC3C,MAAMvc,EAAIqc,EAAS9a,KAAK+a,GAAWvY,GAC7ByG,EAAWZ,EAAa7F,GACxByY,EAAMR,GAAUxR,GAChBhJ,EAAI2a,GAAe3R,GAEzB0R,EAASvX,MAAMgC,QAAQuV,GAAUA,EAASA,EAAOlO,MAAMf,IAElDoP,EAASI,mBACZJ,EAASI,mBAAqBX,IAGhCI,EAAOrN,SAAQ,SAAU6N,GACvB,MAAMC,EAAKD,EAAM1O,MAAM,KAAK,GACtB5M,EAAKsb,EAAM1O,MAAM,KAAK,IAAM,IAElCwO,EAAIG,GAAMH,EAAIG,IAAO,GACrBH,EAAIG,GAAIvb,GAAMob,EAAIG,GAAIvb,IAAO,GAE7Bob,EAAIG,GAAIvb,GAAIib,EAASI,kBAAoBzc,EAEzCwB,EAAEob,iBAAiBD,EAAI3c,EAAGuc,IAAW,MAIzC,SAASM,GAAI9Y,EAAMmY,EAAQG,EAAUE,GACnC,MAAM/R,EAAWZ,EAAa7F,GACxByY,EAAMR,GAAUxR,GAChBhJ,EAAI2a,GAAe3R,IAED,mBAAb6R,IACTA,EAAWA,EAASI,qBAKtBP,EAASvX,MAAMgC,QAAQuV,GAAUA,GAAUA,GAAU,IAAIlO,MAAMf,KACxD4B,SAAQ,SAAU6N,GACvB,MAAMC,EAAKD,GAASA,EAAM1O,MAAM,KAAK,GAC/B5M,EAAKsb,GAASA,EAAM1O,MAAM,KAAK,GACrC,IAAI8O,EAAW9c,EAEf,GAAIqc,EAEEG,EAAIG,IAAOH,EAAIG,GAAIvb,GAAM,OAE3BI,EAAEub,oBAAoBJ,EAAIH,EAAIG,GAAIvb,GAAM,KAAKib,GAAWE,IAAW,UAC5DC,EAAIG,GAAIvb,GAAM,KAAKib,SAEvB,GAAIM,GAAMvb,GAEf,GAAIob,EAAIG,IAAOH,EAAIG,GAAIvb,GAAK,CAC1B,IAAKpB,KAAKwc,EAAIG,GAAIvb,GAChByb,GAAIrb,EAAG,CAACmb,EAAIvb,GAAIgN,KAAK,KAAMpO,UAGtBwc,EAAIG,GAAIvb,SAEZ,GAAIA,EAET,IAAKsb,KAASF,EACZ,IAAKM,KAAaN,EAAIE,GAChBtb,IAAO0b,GACTD,GAAIrb,EAAG,CAACkb,EAAOtb,GAAIgN,KAAK,WAIzB,GAAIuO,GAET,GAAIH,EAAIG,GAAK,CACX,IAAKG,KAAaN,EAAIG,GACpBE,GAAIrb,EAAG,CAACmb,EAAIG,GAAW1O,KAAK,aAGvBoO,EAAIG,QAER,CAEL,IAAKD,KAASF,EACZK,GAAIrb,EAAGkb,IArFf,SAAqBlS,GACnB,IAAIhJ,EAAIgJ,EAASyR,iBACbza,IAAM8H,EAAQC,SAAQ/H,EAAIua,IAC1Bva,EAAE0a,SAAQ1a,EAAE0a,OAAS,IAqFrBc,CAAYxS,OAqBlB,MAAMyS,WAAoBxT,EACxB,oBAEA,SAASiT,EAAOvN,EAAMoN,GACpB,OArBJ,SAAkBxY,EAAM2Y,EAAOvN,EAAMoN,GACnC,MAAM/a,EAAI2a,GAAepY,GAazB,OAXI2Y,aAAiBpT,EAAQC,OAAO2T,QAGlCR,EAAQ,IAAIpT,EAAQC,OAAO4T,YAAYT,EAAO,CAC5CU,OAAQjO,EACRkO,YAAY,KACTd,KALL/a,EAAE8b,cAAcZ,GAUXA,EAOEa,CAASvY,KAAM0X,EAAOvN,EAAMoN,GAGrC,cAAcG,GACZ,MAAMF,EAAMxX,KAAKiX,iBAAiBC,OAClC,IAAKM,EAAK,OAAO,EACjB,MAAMN,EAASM,EAAIE,EAAMc,MAEzB,IAAK,MAAMzd,KAAKmc,EACd,IAAK,MAAMuB,KAAKvB,EAAOnc,GACrBmc,EAAOnc,GAAG0d,GAAGf,GAIjB,OAAQA,EAAMgB,iBAIhB,KAAKhB,EAAOvN,EAAMoN,GAEhB,OADAvX,KAAKuY,SAASb,EAAOvN,EAAMoN,GACpBvX,KAGT,iBACE,OAAOA,KAGT,iBACE,OAAOA,KAIT,IAAI0X,EAAOL,GAET,OADAQ,GAAI7X,KAAM0X,EAAOL,GACVrX,KAIT,GAAG0X,EAAOL,EAAUC,EAASC,GAE3B,OADAH,GAAGpX,KAAM0X,EAAOL,EAAUC,EAASC,GAC5BvX,KAGT,wBAKF,SAAS2Y,MAFT/S,EAASqS,GAAa,eAItB,MAAMW,GAAW,CACfC,SAAU,IACVC,KAAM,IACNC,MAAO,GAGHnC,GAAQ,CAEZ,eAAgB,EAChB,iBAAkB,EAClB,eAAgB,EAChB,kBAAmB,QACnB,iBAAkB,OAClBoC,KAAM,UACNC,OAAQ,UACRC,QAAS,EAETtV,EAAG,EACHC,EAAG,EACHqN,GAAI,EACJC,GAAI,EAEJjO,MAAO,EACPC,OAAQ,EAERtH,EAAG,EACHiV,GAAI,EACJE,GAAI,EAEJmI,OAAQ,EACR,eAAgB,EAChB,aAAc,UAEd,cAAe,SAUjB,MAAMC,WAAiBzZ,MACrB,eAAeyG,GACbgQ,SAAShQ,GACTpG,KAAKiL,QAAQ7E,GAGf,QACE,OAAO,IAAIpG,KAAKC,YAAYD,MAG9B,KAAKmW,GAEH,MAAmB,iBAARA,IACXnW,KAAKK,OAAS,EACdL,KAAKa,QAAQb,KAAKwK,MAAM2L,KAFYnW,KAOtC,MAAM5B,EAAQ,IAEZ,OAAIA,aAAiBuB,MAAcvB,EAC5BA,EAAM2K,OAAOC,MAAMf,IAAWhG,IAAIwQ,YAG3C,UACE,OAAO9S,MAAMhD,UAAUyE,OAAOd,MAAM,GAAIN,MAG1C,QACE,OAAO,IAAIqZ,IAAIrZ,MAGjB,WACE,OAAOA,KAAKoJ,KAAK,KAInB,UACE,MAAMM,EAAM,GAEZ,OADAA,EAAI7I,QAAQb,MACL0J,GAKX,MAAM4P,GAEJ,eAAelT,GACbpG,KAAKiL,QAAQ7E,GAGf,QAAQmT,GACN,OAAO,IAAID,GAAUtZ,KAAKhE,MAAOud,GAInC,OAAOhb,GAEL,OADAA,EAAS,IAAI+a,GAAU/a,GAChB,IAAI+a,GAAUtZ,KAAOzB,EAAQyB,KAAKuZ,MAAQhb,EAAOgb,MAG1D,KAAKvd,EAAOud,GAiCV,OAhCAA,EAAO5Z,MAAMgC,QAAQ3F,GAASA,EAAM,GAAKud,EACzCvd,EAAQ2D,MAAMgC,QAAQ3F,GAASA,EAAM,GAAKA,EAE1CgE,KAAKhE,MAAQ,EACbgE,KAAKuZ,KAAOA,GAAQ,GAEC,iBAAVvd,EAETgE,KAAKhE,MAAQwd,MAAMxd,GAAS,EAAK0T,SAAS1T,GAA2CA,EAAlCA,EAAQ,GAAK,MAAU,MAChD,iBAAVA,GAChBud,EAAOvd,EAAMyd,MAAMnS,MAIjBtH,KAAKhE,MAAQyW,WAAW8G,EAAK,IAEb,MAAZA,EAAK,GACPvZ,KAAKhE,OAAS,IACO,MAAZud,EAAK,KACdvZ,KAAKhE,OAAS,KAIhBgE,KAAKuZ,KAAOA,EAAK,IAGfvd,aAAiBsd,KACnBtZ,KAAKhE,MAAQA,EAAM0d,UACnB1Z,KAAKuZ,KAAOvd,EAAMud,MAIfvZ,KAIT,MAAMzB,GAEJ,OADAA,EAAS,IAAI+a,GAAU/a,GAChB,IAAI+a,GAAUtZ,KAAOzB,EAAQyB,KAAKuZ,MAAQhb,EAAOgb,MAI1D,KAAKhb,GAEH,OADAA,EAAS,IAAI+a,GAAU/a,GAChB,IAAI+a,GAAUtZ,KAAOzB,EAAQyB,KAAKuZ,MAAQhb,EAAOgb,MAI1D,MAAMhb,GAEJ,OADAA,EAAS,IAAI+a,GAAU/a,GAChB,IAAI+a,GAAUtZ,KAAOzB,EAAQyB,KAAKuZ,MAAQhb,EAAOgb,MAG1D,UACE,MAAO,CAACvZ,KAAKhE,MAAOgE,KAAKuZ,MAG3B,SACE,OAAOvZ,KAAKyI,WAGd,WACE,OAAsB,MAAdzI,KAAKuZ,QAA+B,IAAbvZ,KAAKhE,OAAe,IAAoB,MAAdgE,KAAKuZ,KAAevZ,KAAKhE,MAAQ,IAAMgE,KAAKhE,OAASgE,KAAKuZ,KAGrH,UACE,OAAOvZ,KAAKhE,OAKhB,MAAM2d,GAAQ,GAqEd,MAAMC,WAAY3B,GAChB,YAAYlZ,EAAM6X,GAChBR,QACApW,KAAKjB,KAAOA,EACZiB,KAAKwY,KAAOzZ,EAAK0G,SAEbmR,GAAS7X,IAAS6X,GACpB5W,KAAKqG,KAAKuQ,GAKd,IAAIhY,EAAS7D,GAaX,OAZA6D,EAAUgG,EAAahG,IAEXib,iBAAmB7Z,KAAKjB,gBAAgBuF,EAAQC,OAAOuV,YACjElb,EAAQib,kBAGD,MAAL9e,EACFiF,KAAKjB,KAAKgb,YAAYnb,EAAQG,MACrBH,EAAQG,OAASiB,KAAKjB,KAAKib,WAAWjf,IAC/CiF,KAAKjB,KAAKqI,aAAaxI,EAAQG,KAAMiB,KAAKjB,KAAKib,WAAWjf,IAGrDiF,KAIT,MAAMuG,EAAQxL,GACZ,OAAO6J,EAAa2B,GAAQ0T,IAAIja,KAAMjF,GAIxC,WACE,OAAO,IAAImb,GAAKjU,EAAIjC,KAAKjB,KAAKyH,UAAU,SAAUzH,GAChD,OAAOwG,EAAMxG,OAKjB,QAEE,KAAOiB,KAAKjB,KAAKmb,iBACfla,KAAKjB,KAAKqG,YAAYpF,KAAKjB,KAAKob,WAGlC,OAAOna,KAIT,MAAMoa,GAAO,GAIX,OAFApa,KAAKqa,iBAEE,IAAIra,KAAKC,YA3lEpB,SAASqa,EAAYvb,GAEnB,IAAK,IAAIhE,EAAIgE,EAAKyH,SAASnG,OAAS,EAAGtF,GAAK,EAAGA,IAC7Cuf,EAAYvb,EAAKyH,SAASzL,IAG5B,OAAIgE,EAAKwb,IACPxb,EAAKwb,GAAKxU,EAAIhH,EAAK0G,UACZ1G,GAGFA,EAglEuBub,CAAYta,KAAKjB,KAAKyb,UAAUJ,KAI9D,KAAKlY,EAAOkY,GACV,MAAM5T,EAAWxG,KAAKwG,WACtB,IAAIzL,EAAGoH,EAEP,IAAKpH,EAAI,EAAGoH,EAAKqE,EAASnG,OAAQtF,EAAIoH,EAAIpH,IACxCmH,EAAM5B,MAAMkG,EAASzL,GAAI,CAACA,EAAGyL,IAEzB4T,GACF5T,EAASzL,GAAG8b,KAAK3U,EAAOkY,GAI5B,OAAOpa,KAGT,QAAQyF,EAAUmR,GAChB,OAAO5W,KAAKia,IAAI,IAAIL,GAAIvd,EAAOoJ,GAAWmR,IAI5C,QACE,OAAOrR,EAAMvF,KAAKjB,KAAKoG,YAIzB,IAAIpK,GACF,OAAOwK,EAAMvF,KAAKjB,KAAKib,WAAWjf,IAGpC,iBACE,OAAOiF,KAAKjB,KAGd,iBACE,OAAOiB,KAAKjB,KAId,IAAIH,GACF,OAAOoB,KAAK0G,MAAM9H,IAAY,EAGhC,KAAK6b,EAAUC,GACb,OAAO1a,KAAK2a,IAAIF,EAAUC,EAAWxW,GAIvC,GAAGqW,GAOD,YALkB,IAAPA,GAAuBva,KAAKjB,KAAKwb,KAC1Cva,KAAKjB,KAAKwb,GAAKxU,EAAI/F,KAAKwY,OAInBxY,KAAKqG,KAAK,KAAMkU,GAIzB,MAAM3b,GACJ,MAAO,GAAGuC,MAAMjG,KAAK8E,KAAKjB,KAAKib,YAAY9Q,QAAQtK,EAAQG,MAI7D,OACE,OAAOwG,EAAMvF,KAAKjB,KAAKob,WAIzB,QAAQS,GACN,MAAMhR,EAAK5J,KAAKjB,KACV8b,EAAUjR,EAAGkR,SAAWlR,EAAGmR,iBAAmBnR,EAAGoR,mBAAqBpR,EAAGqR,oBAAsBrR,EAAGsR,uBAAyBtR,EAAGuR,kBAAoB,KACxJ,OAAON,GAAWA,EAAQ3f,KAAK0O,EAAIgR,GAIrC,OAAOpC,GACL,IAAIjS,EAASvG,KAEb,IAAKuG,EAAOxH,KAAKkV,WAAY,OAAO,KAGpC,GADA1N,EAAShB,EAAMgB,EAAOxH,KAAKkV,aACtBuE,EAAM,OAAOjS,EAElB,GACE,GAAoB,iBAATiS,EAAoBjS,EAAOuU,QAAQtC,GAAQjS,aAAkBiS,EAAM,OAAOjS,QAC9EA,EAAShB,EAAMgB,EAAOxH,KAAKkV,aAEpC,OAAO1N,EAIT,IAAI3H,EAAS7D,GAGX,OAFA6D,EAAUgG,EAAahG,GACvBoB,KAAK6G,IAAIjI,EAAS7D,GACX6D,EAIT,MAAM2H,EAAQxL,GACZ,OAAO6J,EAAa2B,GAAQM,IAAI7G,KAAMjF,GAIxC,SAKE,OAJIiF,KAAKuG,UACPvG,KAAKuG,SAAS6U,cAAcpb,MAGvBA,KAIT,cAAcpB,GAEZ,OADAoB,KAAKjB,KAAKqG,YAAYxG,EAAQG,MACvBiB,KAIT,QAAQpB,GAON,OANAA,EAAUgG,EAAahG,GAEnBoB,KAAKjB,KAAKkV,YACZjU,KAAKjB,KAAKkV,WAAWoH,aAAazc,EAAQG,KAAMiB,KAAKjB,MAGhDH,EAGT,MAAM0c,EAAY,EAAGrZ,EAAM,MACzB,MAAMsZ,EAAS,IAAMD,EACf1E,EAAQ5W,KAAKqG,KAAKpE,GAExB,IAAK,MAAMlH,KAAK6b,EACU,iBAAbA,EAAM7b,KACf6b,EAAM7b,GAAKwH,KAAK+F,MAAMsO,EAAM7b,GAAKwgB,GAAUA,GAK/C,OADAvb,KAAKqG,KAAKuQ,GACH5W,KAIT,IAAIwb,EAASC,GACX,OAAOzb,KAAK2a,IAAIa,EAASC,EAAUxX,GAIrC,WACE,OAAOjE,KAAKua,KAGd,MAAMmB,GAGJ,OADA1b,KAAKjB,KAAK4c,YAAcD,EACjB1b,KAGT,KAAKjB,GACH,MAAMwH,EAASvG,KAAKuG,SAEpB,IAAKA,EACH,OAAOvG,KAAKoU,MAAMrV,GAGpB,MAAM0H,EAAWF,EAAOG,MAAM1G,MAC9B,OAAOuG,EAAO0T,IAAIlb,EAAM0H,GAAUwT,IAAIja,MAIxC,iBAKE,OAHAA,KAAK6W,MAAK,WACR7W,KAAKqa,oBAEAra,KAIT,IAAI4b,EAASC,EAAUzf,GAQrB,GAPuB,kBAAZwf,IACTxf,EAAKyf,EACLA,EAAWD,EACXA,EAAU,MAIG,MAAXA,GAAsC,mBAAZA,EAAwB,CAEpDC,EAAuB,MAAZA,GAA0BA,EAErC7b,KAAKqa,iBACL,IAAIyB,EAAU9b,KAEd,GAAe,MAAX4b,EAAiB,CAGnB,GAFAE,EAAUvW,EAAMuW,EAAQ/c,KAAKyb,WAAU,IAEnCqB,EAAU,CACZ,MAAMzZ,EAASwZ,EAAQE,GAGvB,GAFAA,EAAU1Z,GAAU0Z,GAEL,IAAX1Z,EAAkB,MAAO,GAI/B0Z,EAAQjF,MAAK,WACX,MAAMzU,EAASwZ,EAAQ5b,MAEjB+b,EAAQ3Z,GAAUpC,MAGT,IAAXoC,EACFpC,KAAK8G,SACI1E,GAAUpC,OAAS+b,GAC5B/b,KAAK2C,QAAQoZ,MAEd,GAIL,OAAOF,EAAWC,EAAQ/c,KAAK2b,UAAYoB,EAAQ/c,KAAKmG,UAK1D2W,EAAuB,MAAZA,GAA2BA,EAEtC,MAAMG,EAAO3f,EAAO,UAAWD,GACzB6f,EAAW3X,EAAQE,SAAS0X,yBAElCF,EAAK9W,UAAY0W,EAEjB,IAAK,IAAIO,EAAMH,EAAKxV,SAASnG,OAAQ8b,KACnCF,EAASlC,YAAYiC,EAAKI,mBAG5B,MAAM7V,EAASvG,KAAKuG,SAEpB,OAAOsV,EAAW7b,KAAK2C,QAAQsZ,IAAa1V,EAASvG,KAAK6G,IAAIoV,IAIlEjW,EAAO4T,GAAK,CACVvT,KA9WF,SAAcA,EAAMoD,EAAKrN,GAEvB,GAAY,MAARiK,EAAc,CAEhBA,EAAO,GACPoD,EAAMzJ,KAAKjB,KAAKuL,WAEhB,IAAK,MAAMvL,KAAQ0K,EACjBpD,EAAKtH,EAAK0G,UAAYsC,EAASgC,KAAKhL,EAAKsd,WAAa5J,WAAW1T,EAAKsd,WAAatd,EAAKsd,UAG1F,OAAOhW,EACF,GAAIA,aAAgB1G,MAEzB,OAAO0G,EAAKqQ,OAAO,CAAC4F,EAAMC,KACxBD,EAAKC,GAAQvc,KAAKqG,KAAKkW,GAChBD,GACN,IACE,GAAoB,iBAATjW,GAAqBA,EAAKpG,cAAgBxE,OAE1D,IAAKgO,KAAOpD,EAAMrG,KAAKqG,KAAKoD,EAAKpD,EAAKoD,SACjC,GAAY,OAARA,EAETzJ,KAAKjB,KAAKyd,gBAAgBnW,OACrB,IAAW,MAAPoD,EAGT,OAAc,OADdA,EAAMzJ,KAAKjB,KAAK0d,aAAapW,IACRuQ,GAAMvQ,GAAQ0B,EAASgC,KAAKN,GAAOgJ,WAAWhJ,GAAOA,EAOvD,iBAJnBA,EAAMkQ,GAAMjD,OAAO,CAACgG,EAAMC,IACjBA,EAAKtW,EAAMqW,EAAM1c,MACvByJ,IAGDA,EAAM,IAAI6P,GAAU7P,GACXsB,GAAM6R,QAAQnT,GAEvBA,EAAM,IAAIsB,GAAMtB,GACPA,EAAIxJ,cAAgBN,QAE7B8J,EAAM,IAAI2P,GAAS3P,IAIR,YAATpD,EAEErG,KAAK6c,SACP7c,KAAK6c,QAAQpT,GAID,iBAAPrN,EAAkB4D,KAAKjB,KAAK+d,eAAe1gB,EAAIiK,EAAMoD,EAAIhB,YAAczI,KAAKjB,KAAKge,aAAa1W,EAAMoD,EAAIhB,aAI7GzI,KAAKgd,SAAqB,cAAT3W,GAAiC,MAATA,GAC3CrG,KAAKgd,UAIT,OAAOhd,MAkTPid,KA3tBF,SAAczG,GACZ,OAAOD,GAASC,EAAOxW,KAAKjB,OA2tB5Bme,QAztBF,SAAiB1G,GACf,OAAOjR,EAAMvF,KAAKjB,KAAKgG,cAAcyR,OA0tBvC5Q,EAASgU,GAAK,OAEd,MAAMrH,WAAgBqH,GACpB,YAAY7a,EAAM6X,GAChBR,MAAMrX,EAAM6X,GAEZ5W,KAAKmd,IAAM,GAEXnd,KAAKjB,KAAKyG,SAAWxF,KAEjBjB,EAAKqe,aAAa,eAEpBpd,KAAKqd,QAAQ9S,KAAKC,MAAMzL,EAAK0d,aAAa,gBAAkB,IAKhE,OAAO7Y,EAAGC,GACR,OAAO7D,KAAKkR,GAAGtN,GAAGuN,GAAGtN,GAIvB,GAAGD,GACD,OAAY,MAALA,EAAY5D,KAAK4D,IAAM5D,KAAKkD,QAAU,EAAIlD,KAAK4D,EAAEA,EAAI5D,KAAKkD,QAAU,GAI7E,GAAGW,GACD,OAAY,MAALA,EAAY7D,KAAK6D,IAAM7D,KAAKmD,SAAW,EAAInD,KAAK6D,EAAEA,EAAI7D,KAAKmD,SAAW,GAI/E,OACE,MAAMuB,EAAO1E,KAAK0E,OAClB,OAAOA,GAAQA,EAAK4Y,OAItB,MAAM1Z,EAAGC,GACP,OAAO7D,KAAKsR,GAAG1N,GAAG2N,GAAG1N,GAIvB,GAAGD,EAAI,GACL,OAAO5D,KAAK4D,EAAE,IAAI0V,GAAU1V,GAAG2Z,KAAKvd,KAAK4D,MAI3C,GAAGC,EAAI,GACL,OAAO7D,KAAK6D,EAAE,IAAIyV,GAAUzV,GAAG0Z,KAAKvd,KAAK6D,MAG3C,iBACE,OAAO7D,KAIT,OAAOmD,GACL,OAAOnD,KAAKqG,KAAK,SAAUlD,GAI7B,KAAKS,EAAGC,GACN,OAAO7D,KAAK4D,EAAEA,GAAGC,EAAEA,GAIrB,QAAQ2Z,EAAQxd,KAAK0E,QACnB8Y,EAAQ5Y,EAAa4Y,GACrB,MAAMC,EAAU,IAAIvH,GACpB,IAAI3P,EAASvG,KAEb,MAAQuG,EAASA,EAAOA,WAAaA,EAAOxH,OAASuF,EAAQE,UAAgC,uBAApB+B,EAAOd,WAC9EgY,EAAQ5c,KAAK0F,GAETA,EAAOxH,OAASye,EAAMze,QAK5B,OAAO0e,EAIT,UAAUpX,GAER,KADAA,EAAOrG,KAAKqG,KAAKA,IACN,OAAO,KAClB,MAAMlL,GAAKkL,EAAO,IAAIoT,MAAMhS,GAC5B,OAAOtM,EAAIyJ,EAAazJ,EAAE,IAAM,KAIlC,OACE,MAAM0B,EAAImD,KAAKuG,OA57EV,EA47E0B7B,IAC/B,OAAO7H,GAAKA,EAAE6H,OAIhB,QAAQlJ,GAEN,OADAwE,KAAKmd,IAAM3hB,EACJwE,KAIT,KAAKkD,EAAOC,GACV,MAAMtG,EAAIoG,EAAiBjD,KAAMkD,EAAOC,GACxC,OAAOnD,KAAKkD,MAAM,IAAIoW,GAAUzc,EAAEqG,QAAQC,OAAO,IAAImW,GAAUzc,EAAEsG,SAInE,MAAMD,GACJ,OAAOlD,KAAKqG,KAAK,QAASnD,GAI5B,iBAQE,OANAlD,KAAKjB,KAAKyd,gBAAgB,cAEtB/gB,OAAOiiB,KAAK1d,KAAKmd,KAAK9c,QACxBL,KAAKjB,KAAKge,aAAa,aAAcxS,KAAKE,UAAUzK,KAAKmd,MAGpD/G,MAAMiE,iBAIf,EAAEzW,GACA,OAAO5D,KAAKqG,KAAK,IAAKzC,GAIxB,EAAEC,GACA,OAAO7D,KAAKqG,KAAK,IAAKxC,IAI1BmC,EAAOuM,GAAS,CACdlP,KApgCF,WAEE,MAgBMD,EAAM+R,GAAOnV,KAhBHjB,GAAQA,EAAK4e,UAIf/T,IACZ,IACE,MAAMgF,EAAQhF,EAAGgF,QAAQwF,MAAMP,KAAS5P,KAAK+F,OACvC5G,EAAMwL,EAAM7P,KAAK4e,UAEvB,OADA/O,EAAM9H,SACC1D,EACP,MAAO3C,GAEP,MAAM,IAAIzC,MAAM,4BAA4B4L,EAAG7K,KAAK0G,8BAA8BhF,EAAEgI,iBAMxF,OADa,IAAI6L,GAAIlR,IAk/BrBwa,KA/+BF,SAAchU,GACZ,MAQMxG,EAAM+R,GAAOnV,KARHjB,GAAQA,EAAK8e,wBAEfjU,IAGZ,MAAM,IAAI5L,MAAM,4BAA4B4L,EAAG7K,KAAK0G,+BAIhDmY,EAAO,IAAItJ,GAAIlR,GAErB,OAAIwG,EACKgU,EAAKlL,UAAU9I,EAAGkU,YAAYnL,YAKhCiL,EAAKG,aA89BZC,OA39BF,SAAgBpa,EAAGC,GACjB,MAAMT,EAAMpD,KAAKqD,OACjB,OAAOO,EAAIR,EAAIQ,GAAKC,EAAIT,EAAIS,GAAKD,EAAIR,EAAIQ,EAAIR,EAAIF,OAASW,EAAIT,EAAIS,EAAIT,EAAID,QA09B1EsS,MAhkDF,SAAe7R,EAAGC,GAChB,OAAO,IAAI4K,GAAM7K,EAAGC,GAAG6O,UAAU1S,KAAK8d,YAAYG,YAgkDlDC,IAvpCF,WACE,OAAO,IAAIpP,GAAO9O,KAAKjB,KAAKof,WAupC5BL,UArpCF,WAKE,GAA2B,mBAAhB9d,KAAKoe,SAA0Bpe,KAAKoe,SAAU,CACvD,MAAMC,EAAOre,KAAKqe,KAAK,EAAG,GACpBljB,EAAIkjB,EAAKtf,KAAKuf,eAEpB,OADAD,EAAKvX,SACE,IAAIgI,GAAO3T,GAGpB,OAAO,IAAI2T,GAAO9O,KAAKjB,KAAKuf,mBA2oC9B1Y,EAAS2M,GAAS,WAElB,MAAMgM,GAAQ,CACZtF,OAAQ,CAAC,QAAS,QAAS,UAAW,UAAW,WAAY,aAAc,YAAa,cACxFD,KAAM,CAAC,QAAS,UAAW,QAC3BwF,OAAQ,SAAUviB,EAAGmO,GACnB,MAAa,UAANA,EAAgBnO,EAAIA,EAAI,IAAMmO,IAIzC,CAAC,OAAQ,UAAUP,SAAQ,SAAU1O,GACnC,MAAMsjB,EAAY,GAClB,IAAI1jB,EAEJ0jB,EAAUtjB,GAAK,SAAUK,GACvB,QAAiB,IAANA,EACT,OAAOwE,KAAKqG,KAAKlL,GAGnB,GAAiB,iBAANK,GAAkBA,aAAauP,IAASA,GAAMlD,MAAMrM,IAAMA,aAAa+W,GAChFvS,KAAKqG,KAAKlL,EAAGK,QAGb,IAAKT,EAAIwjB,GAAMpjB,GAAGkF,OAAS,EAAGtF,GAAK,EAAGA,IACd,MAAlBS,EAAE+iB,GAAMpjB,GAAGJ,KACbiF,KAAKqG,KAAKkY,GAAMC,OAAOrjB,EAAGojB,GAAMpjB,GAAGJ,IAAKS,EAAE+iB,GAAMpjB,GAAGJ,KAKzD,OAAOiF,MAGT0B,EAAgB,CAAC,UAAW,UAAW+c,MAEzC/c,EAAgB,CAAC,UAAW,UAAW,CAErC0P,OAAQ,SAAUsN,EAAKlf,EAAGpE,EAAGC,EAAGoF,EAAGuO,GAEjC,OAAW,MAAP0P,EACK,IAAI5P,GAAO9O,MAIbA,KAAKqG,KAAK,YAAa,IAAIyI,GAAO4P,EAAKlf,EAAGpE,EAAGC,EAAGoF,EAAGuO,KAG5DiB,OAAQ,SAAU0O,EAAOzN,EAAIC,GAC3B,OAAOnR,KAAK0S,UAAU,CACpBzC,OAAQ0O,EACRnb,GAAI0N,EACJxN,GAAIyN,IACH,IAGL1B,KAAM,SAAU7L,EAAGC,EAAGqN,EAAIC,GACxB,OAA4B,IAArB/Q,UAAUC,QAAqC,IAArBD,UAAUC,OAAeL,KAAK0S,UAAU,CACvEjD,KAAM7L,EACNJ,GAAIK,EACJH,GAAIwN,IACH,GAAQlR,KAAK0S,UAAU,CACxBjD,KAAM,CAAC7L,EAAGC,GACVL,GAAI0N,EACJxN,GAAIyN,IACH,IAELpB,MAAO,SAAUgC,EAAKb,EAAIC,GACxB,OAAOnR,KAAK0S,UAAU,CACpB3C,MAAOgC,EACPvO,GAAI0N,EACJxN,GAAIyN,IACH,IAGLtB,MAAO,SAAUjM,EAAGC,EAAGqN,EAAIC,GACzB,OAA4B,IAArB/Q,UAAUC,QAAqC,IAArBD,UAAUC,OAAeL,KAAK0S,UAAU,CACvE7C,MAAOjM,EACPJ,GAAIK,EACJH,GAAIwN,IACH,GAAQlR,KAAK0S,UAAU,CACxB7C,MAAO,CAACjM,EAAGC,GACXL,GAAI0N,EACJxN,GAAIyN,IACH,IAGLX,UAAW,SAAU5M,EAAGC,GACtB,OAAO7D,KAAK0S,UAAU,CACpBlC,UAAW,CAAC5M,EAAGC,KACd,IAGLgN,SAAU,SAAUjN,EAAGC,GACrB,OAAO7D,KAAK0S,UAAU,CACpB7B,SAAU,CAACjN,EAAGC,KACb,IAGLwL,KAAM,SAAUuP,EAAY,OAAQrb,EAAS,UAM3C,OALyC,IAArC,aAAa2F,QAAQ0V,KACvBrb,EAASqb,EACTA,EAAY,QAGP5e,KAAK0S,UAAU,CACpBrD,KAAMuP,EACNrb,OAAQA,IACP,IAGL2V,QAAS,SAAUld,GACjB,OAAOgE,KAAKqG,KAAK,UAAWrK,MAGhC0F,EAAgB,SAAU,CAExBmd,OAAQ,SAAUjb,EAAGC,EAAID,GAEvB,MAAgB,oBADF5D,KAAK8e,UAAY9e,MAAMwY,KACFxY,KAAKqG,KAAK,IAAK,IAAIiT,GAAU1V,IAAM5D,KAAK8Q,GAAGlN,GAAGoN,GAAGnN,MAGxFnC,EAAgB,OAAQ,CAEtBrB,OAAQ,WACN,OAAOL,KAAKjB,KAAKggB,kBAGnBC,QAAS,SAAU3e,GACjB,OAAO,IAAIoO,GAAMzO,KAAKjB,KAAKkgB,iBAAiB5e,OAGhDqB,EAAgB,CAAC,UAAW,UAAW,CAErCwd,KAAM,SAAU9U,EAAGC,GACjB,GAAiB,iBAAND,EAAgB,CACzB,IAAKC,KAAKD,EAAGpK,KAAKkf,KAAK7U,EAAGD,EAAEC,IAE5B,OAAOrK,KAGT,MAAa,YAANoK,EAAkBpK,KAAK6c,QAAQxS,GAAW,WAAND,EAAiBpK,KAAKqG,KAAK,cAAegE,GAAW,SAAND,GAAsB,WAANA,GAAwB,WAANA,GAAwB,YAANA,GAAyB,YAANA,GAAyB,UAANA,EAAgBpK,KAAKqG,KAAK,QAAU+D,EAAGC,GAAKrK,KAAKqG,KAAK+D,EAAGC,MAmBjP3I,EAAgB,UAfA,CAAC,QAAS,WAAY,YAAa,UAAW,YAAa,WAAY,YAAa,aAAc,aAAc,aAAc,YAAa,aAAc,WAAY,eAAegV,QAAO,SAAU4F,EAAM5E,GAazN,OADA4E,EAAK5E,GAVM,SAAU1I,GAOnB,OANU,OAANA,EACFhP,KAAK6X,IAAIH,GAET1X,KAAKoX,GAAGM,EAAO1I,GAGVhP,MAIFsc,IACN,KAyDH5a,EAAgB,UAAW,CACzByd,YAvDF,WACE,OAAOnf,KAAKqG,KAAK,YAAa,OAuD9BmM,UApDF,WAgBE,OAfgBxS,KAAKqG,KAAK,cAAgB,IAC1C2C,MAAMtB,GAAYvG,MAAM,GAAI,GAAGc,KAAI,SAAUmd,GAE3C,MAAMC,EAAKD,EAAIrW,OAAOC,MAAM,KAC5B,MAAO,CAACqW,EAAG,GAAIA,EAAG,GAAGrW,MAAMf,IAAWhG,KAAI,SAAUmd,GAClD,OAAO3M,WAAW2M,UAEnBE,UACF5I,QAAO,SAAUtF,EAAQsB,GACxB,MAAqB,WAAjBA,EAAU,GACLtB,EAAOmO,UAAUzQ,GAAOwD,UAAUI,EAAU,KAG9CtB,EAAOsB,EAAU,IAAIpS,MAAM8Q,EAAQsB,EAAU,MACnD,IAAI5D,KAsCP0Q,SAlCF,SAAkBjZ,EAAQxL,GACxB,GAAIiF,OAASuG,EAAQ,OAAOvG,KAC5B,MAAMke,EAAMle,KAAK8d,YACX2B,EAAOlZ,EAAOuX,YAAYG,UAEhC,OADAje,KAAKoU,MAAM7N,EAAQxL,GAAGokB,cAAczM,UAAU+M,EAAKC,SAASxB,IACrDle,MA8BP2f,OA3BF,SAAgB5kB,GACd,OAAOiF,KAAKwf,SAASxf,KAAK0E,OAAQ3J,IA2BlC2X,UAxBF,SAAmBlX,EAAGqV,GAEpB,GAAS,MAALrV,GAA0B,iBAANA,EAAgB,CACtC,MAAMokB,EAAa,IAAI9Q,GAAO9O,MAAM6f,YACpC,OAAY,MAALrkB,EAAYokB,EAAaA,EAAWpkB,GAGxCsT,GAAOC,aAAavT,KAEvBA,EAAI,IAAKA,EACP+H,OAAQD,EAAU9H,EAAGwE,QAKzB,MACMoC,EAAS,IAAI0M,IADgB,IAAb+B,EAAoB7Q,KAAO6Q,IAAY,GACpB6B,UAAUlX,GACnD,OAAOwE,KAAKqG,KAAK,YAAajE,MAUhC,MAAM0d,WAAkBvN,GACtB,QAAQhM,EAASvG,KAAM0G,GAMrB,OALA1G,KAAK6W,MAAK,WACR,GAAI7W,gBAAgB8f,GAClB,OAAO9f,KAAK+f,UAAUC,aAGnBhgB,KAGT,QAAQuG,EAASvG,KAAKuG,SAAUG,EAAQH,EAAOG,MAAM1G,OAOnD,OALA0G,GAAmB,IAAXA,EAAeH,EAAOC,WAAWnG,OAASqG,EAClD1G,KAAK6W,MAAK,SAAU9b,EAAGyL,GAErB,OAAOA,EAASA,EAASnG,OAAStF,EAAI,GAAGykB,SAASjZ,EAAQG,MAErD1G,KAAK8G,UAIhBlB,EAASka,GAAW,aAEpB,MAAMG,WAAaH,GACjB,YAAY/gB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,OAAQtG,GAAO6X,GAGjC,UACE,OAAO5W,KAGT,UACE,OAAOA,MAIX4F,EAASqa,GAAM,QAEf,MAAMC,WAAc3N,IAGpB,SAASzB,GAAGA,GACV,OAAO9Q,KAAKqG,KAAK,KAAMyK,GAGzB,SAASE,GAAGA,GACV,OAAOhR,KAAKqG,KAAK,KAAM2K,GAGzB,SAASmP,GAAIvc,GACX,OAAY,MAALA,EAAY5D,KAAKkR,KAAOlR,KAAK8Q,KAAO9Q,KAAKkR,GAAGtN,EAAI5D,KAAK8Q,MAG9D,SAASsP,GAAIvc,GACX,OAAY,MAALA,EAAY7D,KAAKmR,KAAOnR,KAAKgR,KAAOhR,KAAKmR,GAAGtN,EAAI7D,KAAKgR,MAG9D,SAASqP,GAAKzc,GACZ,OAAO5D,KAAKqG,KAAK,KAAMzC,GAGzB,SAAS0c,GAAKzc,GACZ,OAAO7D,KAAKqG,KAAK,KAAMxC,GAGzB,SAAS0c,GAAQrd,GACf,OAAgB,MAATA,EAA4B,EAAZlD,KAAK8Q,KAAW9Q,KAAK8Q,GAAG,IAAIwI,GAAUpW,GAAOsd,OAAO,IAG7E,SAASC,GAAStd,GAChB,OAAiB,MAAVA,EAA6B,EAAZnD,KAAKgR,KAAWhR,KAAKgR,GAAG,IAAIsI,GAAUnW,GAAQqd,OAAO,IA/B/E5a,EAASsa,GAAO,SAkChB,IAAIQ,GAAU,CACZhhB,UAAW,KACXoR,GAAIA,GACJE,GAAIA,GACJpN,EAAGuc,GACHtc,EAAGuc,GACHlP,GAAImP,GACJlP,GAAImP,GACJpd,MAAOqd,GACPpd,OAAQsd,IAGV,MAAME,WAAgBT,GACpB,YAAYnhB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,UAAWtG,GAAO6X,GAGpC,KAAK1T,EAAOC,GACV,MAAMtG,EAAIoG,EAAiBjD,KAAMkD,EAAOC,GACxC,OAAOnD,KAAK8Q,GAAG,IAAIwI,GAAUzc,EAAEqG,OAAOsd,OAAO,IAAIxP,GAAG,IAAIsI,GAAUzc,EAAEsG,QAAQqd,OAAO,KAIvFxa,EAAO2a,GAASD,IAChBhf,EAAgB,YAAa,CAE3Bkf,QAAS1a,GAAkB,SAAUhD,EAAQ,EAAGC,EAASD,GACvD,OAAOlD,KAAKia,IAAI,IAAI0G,IAAW5M,KAAK7Q,EAAOC,GAAQ0d,KAAK,EAAG,QAG/Djb,EAAS+a,GAAS,WAElB,MAAMjb,WAAiBkU,GACrB,YAAY7a,EAAOuF,EAAQE,SAAS0X,0BAClC9F,MAAMrX,GAIR,IAAI6c,EAASC,EAAUzf,GASrB,GARuB,kBAAZwf,IACTxf,EAAKyf,EACLA,EAAWD,EACXA,EAAU,MAKG,MAAXA,GAAsC,mBAAZA,EAAwB,CACpD,MAAM5W,EAAU,IAAI4U,GAAIvd,EAAO,UAAWD,IAE1C,OADA4I,EAAQ6B,IAAI7G,KAAKjB,KAAKyb,WAAU,IACzBxV,EAAQ2V,KAAI,EAAOve,GAI5B,OAAOga,MAAMuE,IAAIiB,GAAS,EAAOxf,IAOrC,SAAS6E,GAAK2C,EAAGC,GACf,MAAwC,oBAAhC7D,KAAK8e,UAAY9e,MAAMwY,KAA4BxY,KAAKqG,KAAK,CACnEya,GAAI,IAAIxH,GAAU1V,GAClBmd,GAAI,IAAIzH,GAAUzV,KACf7D,KAAKqG,KAAK,CACb2a,GAAI,IAAI1H,GAAU1V,GAClBqd,GAAI,IAAI3H,GAAUzV,KAGtB,SAAS7C,GAAG4C,EAAGC,GACb,MAAwC,oBAAhC7D,KAAK8e,UAAY9e,MAAMwY,KAA4BxY,KAAKqG,KAAK,CACnE6K,GAAI,IAAIoI,GAAU1V,GAClBuN,GAAI,IAAImI,GAAUzV,KACf7D,KAAKqG,KAAK,CACbuO,GAAI,IAAI0E,GAAU1V,GAClBiR,GAAI,IAAIyE,GAAUzV,KAjBtB+B,EAASF,GAAU,YAqBnB,IAh4B0BS,GAg4BtB+a,GAAa,CACfxhB,UAAW,KACXuB,KAAMA,GACND,GAAIA,IAGN,MAAMmgB,WAAiBrB,GACrB,YAAYtH,EAAM5B,GAChBR,MAAM/Q,EAAUmT,EAAO,WAA4B,iBAATA,EAAoB,KAAOA,GAAO5B,GAI9E,KAAKxM,EAAG5K,EAAGpE,GAET,MADU,cAANgP,IAAmBA,EAAI,qBACpBgM,MAAM/P,KAAK+D,EAAG5K,EAAGpE,GAG1B,OACE,OAAO,IAAIkZ,GAGb,UACE,OAAOiC,GAAS,eAAiBvW,KAAKua,KAAO,MAI/C,WACE,OAAOva,KAAKohB,MAId,OAAOlf,GAQL,OANAlC,KAAKqhB,QAEgB,mBAAVnf,GACTA,EAAMhH,KAAK8E,KAAMA,MAGZA,KAIT,MACE,MAAO,SAAWA,KAAKua,KAAO,MAIlCvU,EAAOmb,GAAUD,IACjBxf,EAAgB,CACdoe,UAAW,CAET,YAAY1Z,GACV,OAAOpG,KAAKsd,OAAOgE,YAAYlb,KAKnC6Z,KAAM,CACJqB,SAAUpb,GAAkB,SAAUsS,EAAMtW,GAC1C,OAAOlC,KAAKia,IAAI,IAAIkH,GAAS3I,IAAO+I,OAAOrf,SAIjD0D,EAASub,GAAU,YAEnB,MAAMK,WAAgB1B,GAEpB,YAAY/gB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,UAAWtG,GAAO6X,GAIpC,KAAKxM,EAAG5K,EAAGpE,GAET,MADU,cAANgP,IAAmBA,EAAI,oBACpBgM,MAAM/P,KAAK+D,EAAG5K,EAAGpE,GAG1B,OACE,OAAO,IAAIkZ,GAGb,UACE,OAAOiC,GAAS,eAAiBvW,KAAKua,KAAO,MAI/C,WACE,OAAOva,KAAKohB,MAId,OAAOlf,GAQL,OANAlC,KAAKqhB,QAEgB,mBAAVnf,GACTA,EAAMhH,KAAK8E,KAAMA,MAGZA,KAIT,MACE,MAAO,SAAWA,KAAKua,KAAO,MAIlC7Y,EAAgB,CACdoe,UAAW,CAET,WAAW1Z,GACT,OAAOpG,KAAKsd,OAAOmE,WAAWrb,KAIlC6Z,KAAM,CACJwB,QAASvb,GAAkB,SAAUhD,EAAOC,EAAQjB,GAClD,OAAOlC,KAAKia,IAAI,IAAIuH,IAAWD,OAAOrf,GAAOmE,KAAK,CAChDzC,EAAG,EACHC,EAAG,EACHX,MAAOA,EACPC,OAAQA,EACRue,aAAc,yBAKtB9b,EAAS4b,GAAS,WAElB,MAAMG,WAAczB,GAClB,YAAYnhB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,QAAStG,GAAO6X,GAIlC,KAAKwK,EAAKQ,GACR,IAAKR,EAAK,OAAOphB,KACjB,MAAM6hB,EAAM,IAAIvd,EAAQC,OAAOod,MAuB/B,OAtBAvK,GAAGyK,EAAK,QAAQ,SAAUphB,GACxB,MAAM5D,EAAImD,KAAKuG,OAAOib,IAED,IAAjBxhB,KAAKkD,SAAmC,IAAlBlD,KAAKmD,UAC7BnD,KAAK+T,KAAK8N,EAAI3e,MAAO2e,EAAI1e,QAGvBtG,aAAa2kB,IAEG,IAAd3kB,EAAEqG,SAAgC,IAAfrG,EAAEsG,UACvBtG,EAAEkX,KAAK/T,KAAKkD,QAASlD,KAAKmD,UAIN,mBAAbye,GACTA,EAAS1mB,KAAK8E,KAAMS,KAErBT,MACHoX,GAAGyK,EAAK,cAAc,WAEpBhK,GAAIgK,MAEC7hB,KAAKqG,KAAK,OAAQwb,EAAIC,IAAMV,EAAKhd,IAliClB+B,GAsiCT,SAAUE,EAAMoD,EAAKsS,GAcpC,MAZa,SAAT1V,GAA4B,WAATA,GACjB2B,GAAQ+B,KAAKN,KACfA,EAAMsS,EAAMrX,OAAO4Y,OAAOyE,MAAMtY,IAIhCA,aAAekY,KACjBlY,EAAMsS,EAAMrX,OAAO4Y,OAAOmE,QAAQ,EAAG,EAAGA,IACtCA,EAAQ5a,IAAI4C,MAITA,GAnjCPkQ,GAAM9Y,KAAKsF,IAqjCbzE,EAAgB,CACdoe,UAAW,CAETiC,MAAO7b,GAAkB,SAAUyI,EAAQiT,GACzC,OAAO5hB,KAAKia,IAAI,IAAI0H,IAAS5N,KAAK,EAAG,GAAGiO,KAAKrT,EAAQiT,SAI3Dhc,EAAS+b,GAAO,SAEhB,MAAMM,WAAmB7I,GAEvB,OACE,IAAI8I,GAAQnN,IACRoN,GAAQpN,IACRqN,EAAOrN,IACPsN,EAAOtN,IAOX,OANA/U,KAAK6J,SAAQ,SAAUD,GACrBsY,EAAO3f,KAAKgG,IAAIqB,EAAG,GAAIsY,GACvBC,EAAO5f,KAAKgG,IAAIqB,EAAG,GAAIuY,GACvBC,EAAO7f,KAAKiG,IAAIoB,EAAG,GAAIwY,GACvBC,EAAO9f,KAAKiG,IAAIoB,EAAG,GAAIyY,MAElB,IAAI/N,GAAI8N,EAAMC,EAAMH,EAAOE,EAAMD,EAAOE,GAIjD,KAAKze,EAAGC,GACN,MAAMT,EAAMpD,KAAKqD,OAKjB,GAHAO,GAAKR,EAAIQ,EACTC,GAAKT,EAAIS,GAEJ2V,MAAM5V,KAAO4V,MAAM3V,GACtB,IAAK,IAAI9I,EAAIiF,KAAKK,OAAS,EAAGtF,GAAK,EAAGA,IACpCiF,KAAKjF,GAAK,CAACiF,KAAKjF,GAAG,GAAK6I,EAAG5D,KAAKjF,GAAG,GAAK8I,GAI5C,OAAO7D,KAIT,MAAM5B,EAAQ,CAAC,EAAG,IAChB,MAAMkkB,EAAS,IAGblkB,EADEA,aAAiBuB,MACXA,MAAMhD,UAAUyE,OAAOd,MAAM,GAAIlC,GAIjCA,EAAM2K,OAAOC,MAAMf,IAAWhG,IAAIwQ,aAKlCpS,OAAS,GAAM,GAAGjC,EAAMmkB,MAElC,IAAK,IAAIxnB,EAAI,EAAGohB,EAAM/d,EAAMiC,OAAQtF,EAAIohB,EAAKphB,GAAQ,EACnDunB,EAAOzhB,KAAK,CAACzC,EAAMrD,GAAIqD,EAAMrD,EAAI,KAGnC,OAAOunB,EAIT,KAAKpf,EAAOC,GACV,IAAIpI,EACJ,MAAMqI,EAAMpD,KAAKqD,OAEjB,IAAKtI,EAAIiF,KAAKK,OAAS,EAAGtF,GAAK,EAAGA,IAC5BqI,EAAIF,QAAOlD,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,GACvER,EAAID,SAAQnD,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,GAGhF,OAAO7D,KAIT,SACE,MAAO,CACLghB,GAAIhhB,KAAK,GAAG,GACZihB,GAAIjhB,KAAK,GAAG,GACZ4U,GAAI5U,KAAK,GAAG,GACZ6U,GAAI7U,KAAK,GAAG,IAKhB,WACE,MAAM5B,EAAQ,GAEd,IAAK,IAAIrD,EAAI,EAAGoH,EAAKnC,KAAKK,OAAQtF,EAAIoH,EAAIpH,IACxCqD,EAAMyC,KAAKb,KAAKjF,GAAGqO,KAAK,MAG1B,OAAOhL,EAAMgL,KAAK,KAGpB,UAAUjO,GACR,OAAO6E,KAAK4O,QAAQC,WAAW1T,GAIjC,WAAWA,GACJ2T,GAAOC,aAAa5T,KACvBA,EAAI,IAAI2T,GAAO3T,IAGjB,IAAK,IAAIJ,EAAIiF,KAAKK,OAAQtF,KAAM,CAE9B,MAAO6I,EAAGC,GAAK7D,KAAKjF,GACpBiF,KAAKjF,GAAG,GAAKI,EAAEiP,EAAIxG,EAAIzI,EAAEC,EAAIyI,EAAI1I,EAAEsF,EACnCT,KAAKjF,GAAG,GAAKI,EAAEqE,EAAIoE,EAAIzI,EAAEE,EAAIwI,EAAI1I,EAAE6T,EAGrC,OAAOhP,MAyBX,IAAIwiB,GAAU,CACZ9iB,UAAW,KACX+iB,WAtBiBR,GAuBjBre,EArBF,SAAaA,GACX,OAAY,MAALA,EAAY5D,KAAKqD,OAAOO,EAAI5D,KAAK6gB,KAAKjd,EAAG5D,KAAKqD,OAAOQ,IAqB5DA,EAlBF,SAAaA,GACX,OAAY,MAALA,EAAY7D,KAAKqD,OAAOQ,EAAI7D,KAAK6gB,KAAK7gB,KAAKqD,OAAOO,EAAGC,IAkB5DX,MAfF,SAAiBA,GACf,MAAM1D,EAAIQ,KAAKqD,OACf,OAAgB,MAATH,EAAgB1D,EAAE0D,MAAQlD,KAAK+T,KAAK7Q,EAAO1D,EAAE2D,SAcpDA,OAXF,SAAkBA,GAChB,MAAM3D,EAAIQ,KAAKqD,OACf,OAAiB,MAAVF,EAAiB3D,EAAE2D,OAASnD,KAAK+T,KAAKvU,EAAE0D,MAAOC,KAYxD,MAAMuf,WAAaxC,GAEjB,YAAYnhB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,OAAQtG,GAAO6X,GAIjC,QACE,OAAO,IAAIqL,GAAW,CAAC,CAACjiB,KAAKqG,KAAK,MAAOrG,KAAKqG,KAAK,OAAQ,CAACrG,KAAKqG,KAAK,MAAOrG,KAAKqG,KAAK,SAIzF,KAAKzC,EAAGC,GACN,OAAO7D,KAAKqG,KAAKrG,KAAK5B,QAAQyiB,KAAKjd,EAAGC,GAAG8e,UAI3C,KAAK3B,EAAIC,EAAIrM,EAAIC,GACf,OAAU,MAANmM,EACKhhB,KAAK5B,SAEZ4iB,OADuB,IAAPC,EACX,CACHD,KACAC,KACArM,KACAC,MAGG,IAAIoN,GAAWjB,GAAI2B,SAGnB3iB,KAAKqG,KAAK2a,IAInB,KAAK9d,EAAOC,GACV,MAAMtG,EAAIoG,EAAiBjD,KAAMkD,EAAOC,GACxC,OAAOnD,KAAKqG,KAAKrG,KAAK5B,QAAQ2V,KAAKlX,EAAEqG,MAAOrG,EAAEsG,QAAQwf,WAI1D3c,EAAO0c,GAAMF,IACb9gB,EAAgB,CACdoe,UAAW,CAET8C,KAAM1c,GAAkB,YAAaE,GAGnC,OAAOsc,GAAK/lB,UAAUkmB,KAAKviB,MAAMN,KAAKia,IAAI,IAAIyI,IAAoB,MAAXtc,EAAK,GAAaA,EAAO,CAAC,EAAG,EAAG,EAAG,UAIhGR,EAAS8c,GAAM,QAEf,MAAMI,WAAehD,GAEnB,YAAY/gB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,SAAUtG,GAAO6X,GAInC,OAAOzT,GACL,OAAOnD,KAAKqG,KAAK,eAAgBlD,GAGnC,OAAO4f,GACL,OAAO/iB,KAAKqG,KAAK,SAAU0c,GAI7B,IAAInf,EAAGC,GACL,OAAO7D,KAAKqG,KAAK,OAAQzC,GAAGyC,KAAK,OAAQxC,GAI3C,WACE,MAAO,QAAU7D,KAAKua,KAAO,IAI/B,OAAOrY,GAQL,OANAlC,KAAKqhB,QAEgB,mBAAVnf,GACTA,EAAMhH,KAAK8E,KAAMA,MAGZA,KAIT,MAAMkD,GACJ,OAAOlD,KAAKqG,KAAK,cAAenD,IAyCpC,SAAS8f,GAAiBrY,EAAGqE,GAC3B,OAAO,SAAU3E,GACf,OAAS,MAALA,EAAkBrK,KAAK2K,IAC3B3K,KAAK2K,GAAKN,EACN2E,GAAGA,EAAE9T,KAAK8E,MACPA,OA1CX0B,EAAgB,CACdoe,UAAW,CACT,UAAU1Z,GAER,OAAOpG,KAAKsd,OAAO2F,UAAU7c,KAIjC6Z,KAAM,CAEJgD,OAAQ/c,GAAkB,SAAUhD,EAAOC,EAAQjB,GAEjD,OAAOlC,KAAKia,IAAI,IAAI6I,IAAU/O,KAAK7Q,EAAOC,GAAQ+f,IAAIhgB,EAAQ,EAAGC,EAAS,GAAGoS,QAAQ,EAAG,EAAGrS,EAAOC,GAAQkD,KAAK,SAAU,QAAQkb,OAAOrf,OAG5I+gB,OAAQ,CAEN,OAAOA,EAAQ/f,EAAOC,EAAQjB,GAC5B,IAAImE,EAAO,CAAC,UAMZ,MAJe,QAAX4c,GAAkB5c,EAAKxF,KAAKoiB,GAChC5c,EAAOA,EAAK+C,KAAK,KAEjB6Z,EAAS7iB,UAAU,aAAc0iB,GAAS1iB,UAAU,GAAKJ,KAAKsd,OAAO2F,OAAO/f,EAAOC,EAAQjB,GACpFlC,KAAKqG,KAAKA,EAAM4c,OAK7Brd,EAASkd,GAAQ,UAiBjB,MAAMK,GAAS,CACb,IAAK,SAAUC,GACb,OAAOA,GAET,KAAM,SAAUA,GACd,OAAQ7gB,KAAKwK,IAAIqW,EAAM7gB,KAAKC,IAAM,EAAI,IAExC,IAAK,SAAU4gB,GACb,OAAO7gB,KAAK8I,IAAI+X,EAAM7gB,KAAKC,GAAK,IAElC,IAAK,SAAU4gB,GACb,OAAsC,EAA9B7gB,KAAKwK,IAAIqW,EAAM7gB,KAAKC,GAAK,IAEnC6gB,OAAQ,SAAUrC,EAAIC,EAAIrM,EAAIC,GAE5B,OAAO,SAAU5Y,GACf,OAAIA,EAAI,EACF+kB,EAAK,EACAC,EAAKD,EAAK/kB,EACR2Y,EAAK,EACPC,EAAKD,EAAK3Y,EAEV,EAEAA,EAAI,EACT2Y,EAAK,GACC,EAAIC,IAAO,EAAID,GAAM3Y,GAAK4Y,EAAKD,IAAO,EAAIA,GACzCoM,EAAK,GACN,EAAIC,IAAO,EAAID,GAAM/kB,GAAKglB,EAAKD,IAAO,EAAIA,GAE3C,EAGF,EAAI/kB,GAAK,EAAIA,IAAM,EAAIglB,EAAK,EAAIhlB,GAAK,GAAK,EAAIA,GAAK4Y,EAAK5Y,GAAK,IAK1EqnB,MAAO,SAAUA,EAAOC,EAAe,OAErCA,EAAeA,EAAava,MAAM,KAAKsW,UAAU,GACjD,IAAIkE,EAAQF,EASZ,MAPqB,SAAjBC,IACAC,EACwB,SAAjBD,KACPC,EAIG,CAACvnB,EAAGwnB,GAAa,KAEtB,IAAIC,EAAOnhB,KAAKohB,MAAM1nB,EAAIqnB,GAC1B,MAAMM,EAAU3nB,EAAIynB,EAAO,GAAM,EAkBjC,MAhBqB,UAAjBH,GAA6C,SAAjBA,KAC5BG,EAGAD,GAAcG,KACdF,EAGAznB,GAAK,GAAKynB,EAAO,IACnBA,EAAO,GAGLznB,GAAK,GAAKynB,EAAOF,IACnBE,EAAOF,GAGFE,EAAOF,KAIpB,MAAMK,GACJ,OACE,OAAO,GASX,MAAMC,WAAaD,GACjB,YAAY1d,EAAKyS,GAASE,MACxB1C,QACApW,KAAK8Y,KAAOqK,GAAOhd,IAAOA,EAG5B,KAAKlF,EAAMD,EAAIoiB,GACb,MAAoB,iBAATniB,EACFmiB,EAAM,EAAIniB,EAAOD,EAGnBC,GAAQD,EAAKC,GAAQjB,KAAK8Y,KAAKsK,IAS1C,MAAMW,WAAmBF,GACvB,YAAY1d,GACViQ,QACApW,KAAKgkB,QAAU7d,EAGjB,KAAK/K,GACH,OAAOA,EAAEwF,KAGX,KAAKkb,EAASmI,EAAQC,EAAI9oB,GACxB,OAAO4E,KAAKgkB,QAAQlI,EAASmI,EAAQC,EAAI9oB,IAK7C,SAAS+oB,KAEP,MAAMtL,GAAY7Y,KAAKokB,WAAa,KAAO,IACrCC,EAAYrkB,KAAKskB,YAAc,EAG/BhZ,EAAK/I,KAAKC,GACV+hB,EAAKhiB,KAAKiiB,IAAIH,EAAY,IAFpB,OAGNI,GAAQF,EAAKhiB,KAAKqK,KAAKtB,EAAKA,EAAKiZ,EAAKA,GACtCG,EAAK,KAAOD,EAAO5L,GAEzB7Y,KAAK3E,EAAI,EAAIopB,EAAOC,EACpB1kB,KAAK2K,EAAI+Z,EAAKA,EA6BhB1e,EA1BA,cAAqB+d,GACnB,YAAYlL,EAAW,IAAKwL,EAAY,GACtCjO,QACApW,KAAK6Y,SAASA,GAAUwL,UAAUA,GAGpC,KAAKvI,EAASmI,EAAQC,EAAI9oB,GACxB,GAAuB,iBAAZ0gB,EAAsB,OAAOA,EAExC,GADA1gB,EAAEwF,KAAOsjB,IAAOnP,IACZmP,IAAOnP,IAAU,OAAOkP,EAC5B,GAAW,IAAPC,EAAU,OAAOpI,EACjBoI,EAAK,MAAKA,EAAK,IACnBA,GAAM,IAEN,MAAMS,EAAWvpB,EAAEupB,UAAY,EAEzBC,GAAgB5kB,KAAK3E,EAAIspB,EAAW3kB,KAAK2K,GAAKmR,EAAUmI,GACxDY,EAAc/I,EAAU6I,EAAWT,EAAKU,EAAeV,EAAKA,EAAK,EAKvE,OAHA9oB,EAAEupB,SAAWA,EAAWC,EAAeV,EAEvC9oB,EAAEwF,KAAO2B,KAAK4M,IAAI8U,EAASY,GAAetiB,KAAK4M,IAAIwV,GAAY,KACxDvpB,EAAEwF,KAAOqjB,EAASY,IAId,CACbhM,SAAUmK,GAAiB,YAAamB,IACxCE,UAAWrB,GAAiB,aAAcmB,MA6B5Cne,EA3BA,cAAkB+d,GAChB,YAAYlnB,EAAI,GAAK9B,EAAI,IAAMM,EAAI,EAAGypB,EAAS,KAC7C1O,QACApW,KAAKnD,EAAEA,GAAG9B,EAAEA,GAAGM,EAAEA,GAAGypB,OAAOA,GAG7B,KAAKhJ,EAASmI,EAAQC,EAAI9oB,GACxB,GAAuB,iBAAZ0gB,EAAsB,OAAOA,EAExC,GADA1gB,EAAEwF,KAAOsjB,IAAOnP,IACZmP,IAAOnP,IAAU,OAAOkP,EAC5B,GAAW,IAAPC,EAAU,OAAOpI,EACrB,MAAMjf,EAAIonB,EAASnI,EACnB,IAAI/gB,GAAKK,EAAE2pB,UAAY,GAAKloB,EAAIqnB,EAChC,MAAM7oB,GAAKwB,GAAKzB,EAAE0F,OAAS,IAAMojB,EAC3BY,EAAS9kB,KAAKglB,QASpB,OAPe,IAAXF,IACF/pB,EAAIwH,KAAKgG,KAAKuc,EAAQviB,KAAKiG,IAAIzN,EAAG+pB,KAGpC1pB,EAAE0F,MAAQjE,EACVzB,EAAE2pB,SAAWhqB,EACbK,EAAEwF,KAAO2B,KAAK4M,IAAItS,GAAK,KAChBzB,EAAEwF,KAAOqjB,EAASnI,GAAW9b,KAAKilB,EAAIpoB,EAAImD,KAAKklB,EAAInqB,EAAIiF,KAAKmlB,EAAI9pB,KAI/D,CACVypB,OAAQ9B,GAAiB,WACzBnmB,EAAGmmB,GAAiB,KACpBjoB,EAAGioB,GAAiB,KACpB3nB,EAAG2nB,GAAiB,OAGtB,MAAMoC,GAAoB,CACxBC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,GAECC,GAAe,CACnBV,EAAG,SAAUjqB,EAAGyB,EAAGmpB,GAGjB,OAFAnpB,EAAE+G,EAAIoiB,EAAGpiB,EAAIxI,EAAE,GACfyB,EAAEgH,EAAImiB,EAAGniB,EAAIzI,EAAE,GACR,CAAC,IAAKyB,EAAE+G,EAAG/G,EAAEgH,IAEtByhB,EAAG,SAAUlqB,EAAGyB,GAGd,OAFAA,EAAE+G,EAAIxI,EAAE,GACRyB,EAAEgH,EAAIzI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,KAEvBmqB,EAAG,SAAUnqB,EAAGyB,GAEd,OADAA,EAAE+G,EAAIxI,EAAE,GACD,CAAC,IAAKA,EAAE,KAEjBoqB,EAAG,SAAUpqB,EAAGyB,GAEd,OADAA,EAAEgH,EAAIzI,EAAE,GACD,CAAC,IAAKA,EAAE,KAEjBqqB,EAAG,SAAUrqB,EAAGyB,GAGd,OAFAA,EAAE+G,EAAIxI,EAAE,GACRyB,EAAEgH,EAAIzI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,KAE/CsqB,EAAG,SAAUtqB,EAAGyB,GAGd,OAFAA,EAAE+G,EAAIxI,EAAE,GACRyB,EAAEgH,EAAIzI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,KAEnCuqB,EAAG,SAAUvqB,EAAGyB,GAGd,OAFAA,EAAE+G,EAAIxI,EAAE,GACRyB,EAAEgH,EAAIzI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,KAEnCwqB,EAAG,SAAUxqB,EAAGyB,GAGd,OAFAA,EAAE+G,EAAIxI,EAAE,GACRyB,EAAEgH,EAAIzI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,KAEvB0qB,EAAG,SAAU1qB,EAAGyB,EAAGmpB,GAGjB,OAFAnpB,EAAE+G,EAAIoiB,EAAGpiB,EACT/G,EAAEgH,EAAImiB,EAAGniB,EACF,CAAC,MAEVgiB,EAAG,SAAUzqB,EAAGyB,GAGd,OAFAA,EAAE+G,EAAIxI,EAAE,GACRyB,EAAEgH,EAAIzI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,MAGjD6qB,GAAa,aAAajd,MAAM,IAEtC,IAAK,IAAIjO,EAAI,EAAGoH,EAAK8jB,GAAW5lB,OAAQtF,EAAIoH,IAAMpH,EAChDgrB,GAAaE,GAAWlrB,IAAM,SAAUA,GACtC,OAAO,SAAUK,EAAGyB,EAAGmpB,GACrB,GAAU,MAANjrB,EAAWK,EAAE,GAAKA,EAAE,GAAKyB,EAAE+G,OAAO,GAAU,MAAN7I,EAAWK,EAAE,GAAKA,EAAE,GAAKyB,EAAEgH,OAAO,GAAU,MAAN9I,EAC9EK,EAAE,GAAKA,EAAE,GAAKyB,EAAE+G,EAChBxI,EAAE,GAAKA,EAAE,GAAKyB,EAAEgH,OAEhB,IAAK,IAAI4U,EAAI,EAAGyN,EAAK9qB,EAAEiF,OAAQoY,EAAIyN,IAAMzN,EACvCrd,EAAEqd,GAAKrd,EAAEqd,IAAMA,EAAI,EAAI5b,EAAEgH,EAAIhH,EAAE+G,GAGnC,OAAOmiB,GAAahrB,GAAGK,EAAGyB,EAAGmpB,IAVH,CAY5BC,GAAWlrB,GAAG8H,eAQlB,SAASsjB,GAAgBtS,GACvB,OAAOA,EAAOuS,QAAQ/lB,QAAUwT,EAAOuS,QAAQ/lB,OAAS,IAAM+kB,GAAkBvR,EAAOuS,QAAQ,GAAGvjB,eAGpG,SAASwjB,GAAgBxS,EAAQyS,GAC/BzS,EAAO0S,UAAYC,GAAe3S,GAAQ,GAC1C,MAAM4S,EAAave,GAAa6B,KAAKuc,GAErC,GAAIG,EACF5S,EAAOuS,QAAU,CAACE,OACb,CACL,MAAMI,EAAc7S,EAAO6S,YACrBC,EAAQD,EAAYhkB,cACpBkkB,EAAUF,IAAgBC,EAChC9S,EAAOuS,QAAU,CAAW,MAAVO,EAAgBC,EAAU,IAAM,IAAMF,GAK1D,OAFA7S,EAAOgT,WAAY,EACnBhT,EAAO6S,YAAc7S,EAAOuS,QAAQ,GAC7BK,EAGT,SAASD,GAAe3S,EAAQ0S,GAC9B,IAAK1S,EAAO0S,SAAU,MAAM,IAAIvoB,MAAM,gBACtC6V,EAAOtV,QAAUsV,EAAOuS,QAAQvlB,KAAK4R,WAAWoB,EAAOtV,SACvDsV,EAAO0S,SAAWA,EAClB1S,EAAOtV,OAAS,GAChBsV,EAAOiT,WAAY,EACnBjT,EAAOkT,aAAc,EAEjBZ,GAAgBtS,IAClBmT,GAAgBnT,GAIpB,SAASmT,GAAgBnT,GACvBA,EAAOgT,WAAY,EAEfhT,EAAOoT,WACTpT,EAAOuS,QA5CX,SAAqBvS,GACnB,MAAMqT,EAAUrT,EAAOuS,QAAQ,GAC/B,OAAOL,GAAamB,GAASrT,EAAOuS,QAAQjlB,MAAM,GAAI0S,EAAOhX,EAAGgX,EAAOmS,IA0CpDmB,CAAYtT,IAG/BA,EAAOuT,SAASvmB,KAAKgT,EAAOuS,SAG9B,SAASiB,GAAUxT,GACjB,IAAKA,EAAOuS,QAAQ/lB,OAAQ,OAAO,EACnC,MAAMinB,EAA4C,MAApCzT,EAAOuS,QAAQ,GAAGvjB,cAC1BxC,EAASwT,EAAOuS,QAAQ/lB,OAC9B,OAAOinB,IAAqB,IAAXjnB,GAA2B,IAAXA,GAGnC,SAASknB,GAAc1T,GACrB,MAA0C,MAAnCA,EAAO2T,UAAU3kB,cA6I1B,MAAM4kB,WAAkBrO,GAEtB,OAEE,OADAvF,KAASG,KAAK+I,aAAa,IAAK/c,KAAKyI,YAC9B,IAAI6L,GAAIT,GAAOC,MAAME,KAAK2J,WAInC,KAAK/Z,EAAGC,GAEN,MAAMT,EAAMpD,KAAKqD,OAKjB,GAHAO,GAAKR,EAAIQ,EACTC,GAAKT,EAAIS,GAEJ2V,MAAM5V,KAAO4V,MAAM3V,GAEtB,IAAK,IAAI7I,EAAGD,EAAIiF,KAAKK,OAAS,EAAGtF,GAAK,EAAGA,IACvCC,EAAIgF,KAAKjF,GAAG,GAEF,MAANC,GAAmB,MAANA,GAAmB,MAANA,GAC5BgF,KAAKjF,GAAG,IAAM6I,EACd5D,KAAKjF,GAAG,IAAM8I,GACC,MAAN7I,EACTgF,KAAKjF,GAAG,IAAM6I,EACC,MAAN5I,EACTgF,KAAKjF,GAAG,IAAM8I,EACC,MAAN7I,GAAmB,MAANA,GAAmB,MAANA,GACnCgF,KAAKjF,GAAG,IAAM6I,EACd5D,KAAKjF,GAAG,IAAM8I,EACd7D,KAAKjF,GAAG,IAAM6I,EACd5D,KAAKjF,GAAG,IAAM8I,EAEJ,MAAN7I,IACFgF,KAAKjF,GAAG,IAAM6I,EACd5D,KAAKjF,GAAG,IAAM8I,IAED,MAAN7I,IACTgF,KAAKjF,GAAG,IAAM6I,EACd5D,KAAKjF,GAAG,IAAM8I,GAKpB,OAAO7D,KAIT,MAAM3E,EAAI,QAKR,OAJIsE,MAAMgC,QAAQtG,KAChBA,EAAIsE,MAAMhD,UAAUyE,OAAOd,MAAM,GAAIjF,GAAGoN,YA5L9C,SAAoBpN,EAAGqsB,GAAa,GAClC,IAAIhhB,EAAQ,EACR4f,EAAQ,GACZ,MAAMzS,EAAS,CACbuS,QAAS,GACTG,UAAU,EACVhoB,OAAQ,GACRipB,UAAW,GACXX,WAAW,EACXO,SAAU,GACVN,WAAW,EACXC,aAAa,EACbE,SAAUS,EACV1B,GAAI,IAAIvX,GACR5R,EAAG,IAAI4R,IAGT,KAAOoF,EAAO2T,UAAYlB,EAAOA,EAAQjrB,EAAE2H,OAAO0D,MAChD,GAAKmN,EAAOgT,YACNR,GAAgBxS,EAAQyS,GAK9B,GAAc,MAAVA,EAaJ,GAAK9M,MAAMnN,SAASia,IAapB,GAAc,MAAVA,GAA2B,MAAVA,EAQrB,GAAc,MAAVA,EAYJ,GAA4B,MAAxBA,EAAMzjB,eAMV,GAAIqF,GAAa6B,KAAKuc,GAAQ,CAC5B,GAAIzS,EAAO0S,SACTC,GAAe3S,GAAQ,OAClB,KAAKsS,GAAgBtS,GAC1B,MAAM,IAAI7V,MAAM,gBAEhBgpB,GAAgBnT,KAGhBnN,QAdFmN,EAAOtV,QAAU+nB,EACjBzS,EAAOkT,aAAc,MAdvB,CACE,GAAIlT,EAAO0S,WAAagB,GAAc1T,GAAS,CAC7C2S,GAAe3S,GAAQ,KACrBnN,EACF,SAGFmN,EAAOtV,QAAU+nB,EACjBzS,EAAO0S,UAAW,OAfd1S,EAAO0S,UACTC,GAAe3S,GAAQ,OAf3B,CACE,GAAsB,MAAlBA,EAAOtV,QAAkB8oB,GAAUxT,GAAS,CAC9CA,EAAO0S,UAAW,EAClB1S,EAAOtV,OAAS+nB,EAChBE,GAAe3S,GAAQ,GACvB,SAGFA,EAAO0S,UAAW,EAClB1S,EAAOtV,QAAU+nB,MAtBnB,CACE,GAAIzS,EAAOiT,WAAajT,EAAOkT,YAAa,CAC1CP,GAAe3S,GAAQ,KACrBnN,EACF,SAGFmN,EAAO0S,UAAW,EAClB1S,EAAOiT,WAAY,EACnBjT,EAAOtV,QAAU+nB,EAgErB,OARIzS,EAAO0S,UACTC,GAAe3S,GAAQ,GAGrBA,EAAOgT,WAAaV,GAAgBtS,IACtCmT,GAAgBnT,GAGXA,EAAOuT,SA8FLO,CAAWtsB,GAIpB,KAAK6H,EAAOC,GAEV,MAAMC,EAAMpD,KAAKqD,OACjB,IAAItI,EAAGC,EAMP,IAHAoI,EAAIF,MAAsB,IAAdE,EAAIF,MAAc,EAAIE,EAAIF,MACtCE,EAAID,OAAwB,IAAfC,EAAID,OAAe,EAAIC,EAAID,OAEnCpI,EAAIiF,KAAKK,OAAS,EAAGtF,GAAK,EAAGA,IAChCC,EAAIgF,KAAKjF,GAAG,GAEF,MAANC,GAAmB,MAANA,GAAmB,MAANA,GAC5BgF,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC5D5D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,GAC/C,MAAN7I,EACTgF,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC7C,MAAN5I,EACTgF,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,EAC/C,MAAN7I,GAAmB,MAANA,GAAmB,MAANA,GACnCgF,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC5D5D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,EAC9D7D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC5D5D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,EAEpD,MAAN7I,IACFgF,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC5D5D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,IAEjD,MAAN7I,IAETgF,KAAKjF,GAAG,GAAKiF,KAAKjF,GAAG,GAAKmI,EAAQE,EAAIF,MACtClD,KAAKjF,GAAG,GAAKiF,KAAKjF,GAAG,GAAKoI,EAASC,EAAID,OAEvCnD,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC5D5D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKqI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,GAIlE,OAAO7D,KAIT,WACE,OA3IJ,SAAuBoK,GACrB,IAAItN,EAAI,GAER,IAAK,IAAI/B,EAAI,EAAGoH,EAAKiI,EAAE/J,OAAQtF,EAAIoH,EAAIpH,IACrC+B,GAAKsN,EAAErP,GAAG,GAEK,MAAXqP,EAAErP,GAAG,KACP+B,GAAKsN,EAAErP,GAAG,GAEK,MAAXqP,EAAErP,GAAG,KACP+B,GAAK,IACLA,GAAKsN,EAAErP,GAAG,GAEK,MAAXqP,EAAErP,GAAG,KACP+B,GAAK,IACLA,GAAKsN,EAAErP,GAAG,GACV+B,GAAK,IACLA,GAAKsN,EAAErP,GAAG,GAEK,MAAXqP,EAAErP,GAAG,KACP+B,GAAK,IACLA,GAAKsN,EAAErP,GAAG,GACV+B,GAAK,IACLA,GAAKsN,EAAErP,GAAG,GAEK,MAAXqP,EAAErP,GAAG,KACP+B,GAAK,IACLA,GAAKsN,EAAErP,GAAG,QAQtB,OAAO+B,EAAI,IAwGF8qB,CAAc5nB,OAKzB,MAAM6nB,GAAkB7rB,IACtB,MAAMwc,SAAcxc,EAEpB,MAAa,WAATwc,EACKc,GACW,WAATd,EACLzN,GAAM6R,QAAQ5gB,GACT+O,GACE9C,GAAU8B,KAAK/N,GACjBkM,GAAa6B,KAAK/N,GAASyrB,GAAYrO,GACrC9R,EAAcyC,KAAK/N,GACrBsd,GAEAwO,GAEAC,GAAe7e,QAAQlN,EAAMiE,cAAgB,EAC/CjE,EAAMiE,YACJN,MAAMgC,QAAQ3F,GAChBod,GACW,WAATZ,EACFwP,GAEAF,IAIX,MAAMG,GACJ,YAAYjE,GACVhkB,KAAKkoB,SAAWlE,GAAW,IAAIF,GAAK,KACpC9jB,KAAKmoB,MAAQ,KACbnoB,KAAKooB,IAAM,KACXpoB,KAAKqoB,MAAQ,KACbroB,KAAKsoB,SAAW,KAChBtoB,KAAKuoB,UAAY,KAGnB,GAAGnF,GACD,MAAMrH,EAAQ/b,KAEd,OAAOA,KAAKuoB,UAAUjW,UAAUtS,KAAKmoB,MAAMlmB,KAAI,SAAUlH,EAAG2L,GAC1D,OAAOqV,EAAMmM,SAASxE,KAAK3oB,EAAGghB,EAAMqM,IAAI1hB,GAAQ0c,EAAKrH,EAAMuM,SAAS5hB,GAAQqV,EAAMuM,cAItF,OAKE,OAJiBtoB,KAAKsoB,SAASrmB,IAAIjC,KAAKkoB,SAAStnB,MAAM8V,QAAO,SAAU4F,EAAMC,GAC5E,OAAOD,GAAQC,KACd,GAKL,KAAK9S,GACH,OAAW,MAAPA,EACKzJ,KAAKmoB,OAGdnoB,KAAKmoB,MAAQnoB,KAAKwoB,KAAK/e,GAChBzJ,MAGT,QAAQgkB,GACN,OAAe,MAAXA,EAAwBhkB,KAAKkoB,UACjCloB,KAAKkoB,SAAWlE,EACThkB,MAGT,GAAGyJ,GACD,OAAW,MAAPA,EACKzJ,KAAKooB,KAGdpoB,KAAKooB,IAAMpoB,KAAKwoB,KAAK/e,GACdzJ,MAGT,KAAKwY,GAEH,OAAY,MAARA,EACKxY,KAAKqoB,OAIdroB,KAAKqoB,MAAQ7P,EACNxY,MAGT,KAAKhE,GACEgE,KAAKqoB,OACRroB,KAAKwY,KAAKqP,GAAgB7rB,IAG5B,IAAIoG,EAAS,IAAIpC,KAAKqoB,MAAMrsB,GAgB5B,OAdIgE,KAAKqoB,QAAUtd,KACjB3I,EAASpC,KAAKooB,IAAMhmB,EAAOpC,KAAKooB,IAAI,MAAQpoB,KAAKmoB,MAAQ/lB,EAAOpC,KAAKmoB,MAAM,MAAQ/lB,GAGjFpC,KAAKqoB,QAAUL,KACjB5lB,EAASpC,KAAKooB,IAAMhmB,EAAOqmB,MAAMzoB,KAAKooB,KAAOpoB,KAAKmoB,MAAQ/lB,EAAOqmB,MAAMzoB,KAAKmoB,OAAS/lB,GAGvFA,EAASA,EAAOsmB,UAChB1oB,KAAKuoB,UAAYvoB,KAAKuoB,WAAa,IAAIvoB,KAAKqoB,MAC5CroB,KAAKsoB,SAAWtoB,KAAKsoB,UAAY3oB,MAAMW,MAAM,KAAMX,MAAMyC,EAAO/B,SAAS4B,IAAIxG,QAAQwG,KAAI,SAAUzG,GAEjG,OADAA,EAAEoF,MAAO,EACFpF,KAEF4G,GAIX,MAAM0lB,GACJ,eAAe1hB,GACbpG,KAAKiL,QAAQ7E,GAGf,KAAKqD,GAGH,OAFAA,EAAM9J,MAAMgC,QAAQ8H,GAAOA,EAAI,GAAKA,EACpCzJ,KAAKhE,MAAQyN,EACNzJ,KAGT,UACE,MAAO,CAACA,KAAKhE,OAGf,UACE,OAAOgE,KAAKhE,OAIhB,MAAM2sB,GACJ,eAAeviB,GACbpG,KAAKiL,QAAQ7E,GAGf,KAAKuQ,GAeH,OAdIhX,MAAMgC,QAAQgV,KAChBA,EAAM,CACJ/G,OAAQ+G,EAAI,GACZ7G,OAAQ6G,EAAI,GACZ5G,MAAO4G,EAAI,GACX1G,OAAQ0G,EAAI,GACZjG,WAAYiG,EAAI,GAChB/F,WAAY+F,EAAI,GAChBlT,QAASkT,EAAI,GACbhT,QAASgT,EAAI,KAIjBlb,OAAO0E,OAAOH,KAAM2oB,GAAaC,SAAUjS,GACpC3W,KAGT,UACE,MAAMqK,EAAIrK,KACV,MAAO,CAACqK,EAAEuF,OAAQvF,EAAEyF,OAAQzF,EAAE0F,MAAO1F,EAAE4F,OAAQ5F,EAAEqG,WAAYrG,EAAEuG,WAAYvG,EAAE5G,QAAS4G,EAAE1G,UAI5FglB,GAAaC,SAAW,CACtBhZ,OAAQ,EACRE,OAAQ,EACRC,MAAO,EACPE,OAAQ,EACRS,WAAY,EACZE,WAAY,EACZnN,QAAS,EACTE,QAAS,GAGX,MAAMklB,GAAY,CAACze,EAAG5K,IACb4K,EAAE,GAAK5K,EAAE,IAAM,EAAI4K,EAAE,GAAK5K,EAAE,GAAK,EAAI,EAG9C,MAAMwoB,GACJ,eAAe5hB,GACbpG,KAAKiL,QAAQ7E,GAGf,MAAM6L,GACJ,IAAK,IAAIlX,EAAI,EAAGoH,EAAKnC,KAAK+L,OAAO1L,OAAQtF,EAAIoH,IAAMpH,EACjD,GAAIiF,KAAK+L,OAAOhR,KAAOgQ,GAAO,CAC5B,MAAMpC,EAAQsJ,EAAMlX,EAAI,GAClBmQ,EAAQ,IAAIH,GAAM/K,KAAK+L,OAAO+c,OAAO/tB,EAAI,EAAG,IAAI4N,KAAS+f,UAC/D1oB,KAAK+L,OAAO+c,OAAO/tB,EAAI,EAAG,KAAMmQ,GAIpC,OAAOlL,KAGT,KAAK+oB,GAGH,GAFA/oB,KAAK+L,OAAS,GAEVpM,MAAMgC,QAAQonB,GAEhB,YADA/oB,KAAK+L,OAASgd,EAAS5nB,SAIzB4nB,EAAWA,GAAY,GACvB,MAAMC,EAAU,GAEhB,IAAK,MAAMjuB,KAAKguB,EAAU,CACxB,MAAME,EAAOpB,GAAgBkB,EAAShuB,IAChC0O,EAAM,IAAIwf,EAAKF,EAAShuB,IAAI2tB,UAClCM,EAAQnoB,KAAK,CAAC9F,EAAGkuB,EAAMxf,EAAIpJ,UAAWoJ,IAKxC,OAFAuf,EAAQE,KAAKL,IACb7oB,KAAK+L,OAASid,EAAQtS,OAAO,CAAC4F,EAAMC,IAASD,EAAKlb,OAAOmb,GAAO,IACzDvc,KAGT,UACE,OAAOA,KAAK+L,OAGd,UACE,MAAM4K,EAAM,GACNR,EAAMnW,KAAK+L,OAEjB,KAAOoK,EAAI9V,QAAQ,CACjB,MAAM/D,EAAM6Z,EAAIgT,QACVF,EAAO9S,EAAIgT,QACXC,EAAMjT,EAAIgT,QACVpd,EAASoK,EAAI2S,OAAO,EAAGM,GAC7BzS,EAAIra,GAAO,IAAI2sB,EAAKld,GAAQ2N,UAG9B,OAAO/C,GAIX,MAAMoR,GAAiB,CAACD,GAAca,GAAcX,IAkBpD,MAAMqB,WAAanJ,GAEjB,YAAYnhB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,OAAQtG,GAAO6X,GAIjC,QACE,OAAO5W,KAAKspB,SAAWtpB,KAAKspB,OAAS,IAAI7B,GAAUznB,KAAKqG,KAAK,OAI/D,QAEE,cADOrG,KAAKspB,OACLtpB,KAIT,OAAOmD,GACL,OAAiB,MAAVA,EAAiBnD,KAAKqD,OAAOF,OAASnD,KAAK+T,KAAK/T,KAAKqD,OAAOH,MAAOC,GAI5E,KAAKS,EAAGC,GACN,OAAO7D,KAAKqG,KAAK,IAAKrG,KAAK5B,QAAQyiB,KAAKjd,EAAGC,IAI7C,KAAKxI,GACH,OAAY,MAALA,EAAY2E,KAAK5B,QAAU4B,KAAKqhB,QAAQhb,KAAK,IAAkB,iBAANhL,EAAiBA,EAAI2E,KAAKspB,OAAS,IAAI7B,GAAUpsB,IAInH,KAAK6H,EAAOC,GACV,MAAMtG,EAAIoG,EAAiBjD,KAAMkD,EAAOC,GACxC,OAAOnD,KAAKqG,KAAK,IAAKrG,KAAK5B,QAAQ2V,KAAKlX,EAAEqG,MAAOrG,EAAEsG,SAIrD,MAAMD,GACJ,OAAgB,MAATA,EAAgBlD,KAAKqD,OAAOH,MAAQlD,KAAK+T,KAAK7Q,EAAOlD,KAAKqD,OAAOF,QAI1E,EAAES,GACA,OAAY,MAALA,EAAY5D,KAAKqD,OAAOO,EAAI5D,KAAK6gB,KAAKjd,EAAG5D,KAAKqD,OAAOQ,GAI9D,EAAEA,GACA,OAAY,MAALA,EAAY7D,KAAKqD,OAAOQ,EAAI7D,KAAK6gB,KAAK7gB,KAAKqD,OAAOO,EAAGC,IAKhEwlB,GAAK1sB,UAAU8lB,WAAagF,GAE5B/lB,EAAgB,CACdoe,UAAW,CAET9L,KAAM9N,GAAkB,SAAU7K,GAEhC,OAAO2E,KAAKia,IAAI,IAAIoP,IAAQxG,KAAKxnB,GAAK,IAAIosB,UAIhD7hB,EAASyjB,GAAM,QAwBf,IAAIE,GAAO,CACT7pB,UAAW,KACXtB,MAxBF,WACE,OAAO4B,KAAKspB,SAAWtpB,KAAKspB,OAAS,IAAIrH,GAAWjiB,KAAKqG,KAAK,aAwB9Dgb,MArBF,WAEE,cADOrhB,KAAKspB,OACLtpB,MAoBP6gB,KAjBF,SAAgBjd,EAAGC,GACjB,OAAO7D,KAAKqG,KAAK,SAAUrG,KAAK5B,QAAQyiB,KAAKjd,EAAGC,KAiBhDgf,KAdF,SAAchmB,GACZ,OAAY,MAALA,EAAYmD,KAAK5B,QAAU4B,KAAKqhB,QAAQhb,KAAK,SAAuB,iBAANxJ,EAAiBA,EAAImD,KAAKspB,OAAS,IAAIrH,GAAWplB,KAcvHkX,KAXF,SAAgB7Q,EAAOC,GACrB,MAAMtG,EAAIoG,EAAiBjD,KAAMkD,EAAOC,GACxC,OAAOnD,KAAKqG,KAAK,SAAUrG,KAAK5B,QAAQ2V,KAAKlX,EAAEqG,MAAOrG,EAAEsG,WAY1D,MAAMqmB,WAAgBtJ,GAEpB,YAAYnhB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,UAAWtG,GAAO6X,IAItClV,EAAgB,CACdoe,UAAW,CAET2J,QAASvjB,GAAkB,SAAUrJ,GAEnC,OAAOmD,KAAKia,IAAI,IAAIuP,IAAW3G,KAAKhmB,GAAK,IAAIolB,UAInDjc,EAAOwjB,GAAShH,IAChBxc,EAAOwjB,GAASD,IAChB3jB,EAAS4jB,GAAS,WAElB,MAAME,WAAiBxJ,GAErB,YAAYnhB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,WAAYtG,GAAO6X,IAIvClV,EAAgB,CACdoe,UAAW,CAET6J,SAAUzjB,GAAkB,SAAUrJ,GAEpC,OAAOmD,KAAKia,IAAI,IAAIyP,IAAY7G,KAAKhmB,GAAK,IAAIolB,UAIpDjc,EAAO0jB,GAAUlH,IACjBxc,EAAO0jB,GAAUH,IACjB3jB,EAAS8jB,GAAU,YAEnB,MAAME,WAAa1J,GAEjB,YAAYnhB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,OAAQtG,GAAO6X,IAInC5Q,EAAO4jB,GAAM,CACX9Y,MACAE,QAEFtP,EAAgB,CACdoe,UAAW,CAETzB,KAAMnY,GAAkB,SAAUhD,EAAOC,GACvC,OAAOnD,KAAKia,IAAI,IAAI2P,IAAQ7V,KAAK7Q,EAAOC,SAI9CyC,EAASgkB,GAAM,QAEf,MAAMC,GACJ,cACE7pB,KAAK8pB,OAAS,KACd9pB,KAAK+pB,MAAQ,KAIf,QACE,OAAO/pB,KAAK8pB,QAAU9pB,KAAK8pB,OAAO9tB,MAIpC,OACE,OAAOgE,KAAK+pB,OAAS/pB,KAAK+pB,MAAM/tB,MAGlC,KAAKA,GAEH,MAAMguB,OAA6B,IAAfhuB,EAAM2E,KAAuB3E,EAAQ,CACvDA,MAAOA,EACP2E,KAAM,KACNgG,KAAM,MAaR,OAVI3G,KAAK+pB,OACPC,EAAKrjB,KAAO3G,KAAK+pB,MACjB/pB,KAAK+pB,MAAMppB,KAAOqpB,EAClBhqB,KAAK+pB,MAAQC,IAEbhqB,KAAK+pB,MAAQC,EACbhqB,KAAK8pB,OAASE,GAITA,EAIT,OAAOA,GAEDA,EAAKrjB,OAAMqjB,EAAKrjB,KAAKhG,KAAOqpB,EAAKrpB,MACjCqpB,EAAKrpB,OAAMqpB,EAAKrpB,KAAKgG,KAAOqjB,EAAKrjB,MACjCqjB,IAAShqB,KAAK+pB,QAAO/pB,KAAK+pB,MAAQC,EAAKrjB,MACvCqjB,IAAShqB,KAAK8pB,SAAQ9pB,KAAK8pB,OAASE,EAAKrpB,MAE7CqpB,EAAKrjB,KAAO,KACZqjB,EAAKrpB,KAAO,KAGd,QAEE,MAAMmG,EAAS9G,KAAK8pB,OACpB,OAAKhjB,GAEL9G,KAAK8pB,OAAShjB,EAAOnG,KACjBX,KAAK8pB,SAAQ9pB,KAAK8pB,OAAOnjB,KAAO,MACpC3G,KAAK+pB,MAAQ/pB,KAAK8pB,OAAS9pB,KAAK+pB,MAAQ,KACjCjjB,EAAO9K,OALM,MAUxB,MAAMiuB,GAAW,CACfC,SAAU,KACVC,OAAQ,IAAIN,GACZO,SAAU,IAAIP,GACdQ,WAAY,IAAIR,GAChBS,MAAO,IAAMhmB,EAAQC,OAAOgmB,aAAejmB,EAAQC,OAAOimB,KAC1D9iB,WAAY,GAEZ,MAAMvB,GAEJ,MAAMpH,EAAOkrB,GAASE,OAAOtpB,KAAK,CAChC4pB,IAAKtkB,IAQP,OAL0B,OAAtB8jB,GAASC,WACXD,GAASC,SAAW5lB,EAAQC,OAAOmmB,sBAAsBT,GAASU,QAI7D5rB,GAGT,QAAQoH,EAAI4S,GACVA,EAAQA,GAAS,EAEjB,MAAM6R,EAAOX,GAASK,QAAQO,MAAQ9R,EAEhCha,EAAOkrB,GAASG,SAASvpB,KAAK,CAClC4pB,IAAKtkB,EACLykB,KAAMA,IAOR,OAJ0B,OAAtBX,GAASC,WACXD,GAASC,SAAW5lB,EAAQC,OAAOmmB,sBAAsBT,GAASU,QAG7D5rB,GAGT,UAAUoH,GAER,MAAMpH,EAAOkrB,GAASI,WAAWxpB,KAAKsF,GAMtC,OAJ0B,OAAtB8jB,GAASC,WACXD,GAASC,SAAW5lB,EAAQC,OAAOmmB,sBAAsBT,GAASU,QAG7D5rB,GAGT,YAAYA,GACF,MAARA,GAAgBkrB,GAASE,OAAOrjB,OAAO/H,IAGzC,aAAaA,GACH,MAARA,GAAgBkrB,GAASG,SAAStjB,OAAO/H,IAG3C,gBAAgBA,GACN,MAARA,GAAgBkrB,GAASI,WAAWvjB,OAAO/H,IAG7C,MAAM8rB,GAGJ,IAAIC,EAAc,KAClB,MAAMC,EAAcd,GAASG,SAAS9N,OAEtC,MAAOwO,EAAcb,GAASG,SAASjB,WAEjC0B,GAAOC,EAAYF,KACrBE,EAAYL,MAEZR,GAASG,SAASvpB,KAAKiqB,GAIrBA,IAAgBC,KAItB,IAAIC,EAAY,KAChB,MAAMC,EAAYhB,GAASE,OAAO7N,OAElC,KAAO0O,IAAcC,IAAcD,EAAYf,GAASE,OAAOhB,UAC7D6B,EAAUP,IAAII,GAGhB,IAAIK,EAAgB,KAEpB,KAAOA,EAAgBjB,GAASI,WAAWlB,SACzC+B,IAIFjB,GAASC,SAAWD,GAASG,SAASe,SAAWlB,GAASE,OAAOgB,QAAU7mB,EAAQC,OAAOmmB,sBAAsBT,GAASU,OAAS,OAKhIS,GAAe,SAAUC,GAC7B,MAAMC,EAAQD,EAAWC,MACnBzS,EAAWwS,EAAWE,OAAO1S,WAEnC,MAAO,CACLyS,MAAOA,EACPzS,SAAUA,EACV2S,IAJUF,EAAQzS,EAKlB0S,OAAQF,EAAWE,SAIjBE,GAAgB,WACpB,MAAM9W,EAAIrQ,EAAQC,OAClB,OAAQoQ,EAAE4V,aAAe5V,EAAE6V,MAAMK,OAGnC,MAAMa,WAAiBzT,GAErB,YAAY0T,EAAaF,IACvBrV,QACApW,KAAK4rB,YAAcD,EAEnB3rB,KAAK6rB,WAAa,EAClB7rB,KAAK8rB,OAAS,EAEd9rB,KAAK+rB,SAAW,EAEhB/rB,KAAKgsB,WAAa,KAClBhsB,KAAKisB,SAAU,EACfjsB,KAAKksB,SAAW,GAChBlsB,KAAKmsB,WAAa,GAClBnsB,KAAKosB,eAAiB,EACtBpsB,KAAKqsB,MAAQ,EACbrsB,KAAKssB,gBAAkB,EACvBtsB,KAAKusB,cAAgB,EAErBvsB,KAAKwsB,MAAQxsB,KAAKysB,QAAQlwB,KAAKyD,MAAM,GACrCA,KAAK0sB,eAAiB1sB,KAAKysB,QAAQlwB,KAAKyD,MAAM,GAGhD,SACE,QAASA,KAAKgsB,WAGhB,SAGE,OADAhsB,KAAK4qB,KAAK5qB,KAAK2sB,uBAAyB,GACjC3sB,KAAK4sB,QAId,aACE,MAAMC,EAAiB7sB,KAAK8sB,oBACtBC,EAAeF,EAAiBA,EAAetB,OAAO1S,WAAa,EAEzE,OADsBgU,EAAiBA,EAAevB,MAAQtrB,KAAKqsB,OAC5CU,EAGzB,uBACE,MAAMC,EAAWhtB,KAAKksB,SAASjqB,IAAIlH,GAAKA,EAAEuwB,MAAQvwB,EAAEwwB,OAAO1S,YAE3D,OAAOtW,KAAKgG,IAAI,KAAMykB,GAGxB,oBACE,OAAOhtB,KAAKitB,kBAAkBjtB,KAAKosB,eAGrC,kBAAkB7R,GAChB,OAAOva,KAAKksB,SAASlsB,KAAKmsB,WAAWjjB,QAAQqR,KAAQ,KAGvD,QAEE,OADAva,KAAKisB,SAAU,EACRjsB,KAAKktB,YAGd,QAAQC,GACN,OAAmB,MAAfA,EAA4BntB,KAAK+rB,UACrC/rB,KAAK+rB,SAAWoB,EACTntB,MAGT,OAGE,OADAA,KAAKisB,SAAU,EACRjsB,KAAKotB,aAAaF,YAG3B,QAAQG,GACN,MAAMC,EAAettB,KAAKutB,QAC1B,GAAW,MAAPF,EAAa,OAAOrtB,KAAKutB,OAAOD,GACpC,MAAME,EAAWjrB,KAAK4M,IAAIme,GAC1B,OAAOttB,KAAKutB,MAAMF,GAAOG,EAAWA,GAItC,SAASjC,EAAQxS,EAAO0U,GACtB,GAAc,MAAVlC,EACF,OAAOvrB,KAAKksB,SAASjqB,IAAImpB,IAM3B,IAAIsC,EAAoB,EACxB,MAAMC,EAAU3tB,KAAK4tB,aAGrB,GAFA7U,EAAQA,GAAS,EAEL,MAAR0U,GAAyB,SAATA,GAA4B,UAATA,EAErCC,EAAoBC,OACf,GAAa,aAATF,GAAgC,UAATA,EAChCC,EAAoB3U,EACpBA,EAAQ,OACH,GAAa,QAAT0U,EACTC,EAAoB1tB,KAAKqsB,WACpB,GAAa,aAAToB,EAAqB,CAC9B,MAAMpC,EAAarrB,KAAKitB,kBAAkB1B,EAAOhR,IAE7C8Q,IACFqC,EAAoBrC,EAAWC,MAAQvS,EACvCA,EAAQ,OAEL,IAAa,cAAT0U,EAKT,MAAM,IAAIzvB,MAAM,0CALe,CAC/B,MAAM6uB,EAAiB7sB,KAAK8sB,oBAE5BY,EADsBb,EAAiBA,EAAevB,MAAQtrB,KAAKqsB,OAOrEd,EAAOsC,aACPtC,EAAO3S,SAAS5Y,MAChB,MAAM8tB,EAAUvC,EAAOuC,UACjBzC,EAAa,CACjByC,QAAqB,OAAZA,EAAmB9tB,KAAK+rB,SAAW+B,EAC5CxC,MAAOoC,EAAoB3U,EAC3BwS,UAYF,OAVAvrB,KAAKosB,cAAgBb,EAAOhR,GAE5Bva,KAAKksB,SAASrrB,KAAKwqB,GAEnBrrB,KAAKksB,SAAShD,KAAK,CAAC9e,EAAG5K,IAAM4K,EAAEkhB,MAAQ9rB,EAAE8rB,OAEzCtrB,KAAKmsB,WAAansB,KAAKksB,SAASjqB,IAAI8rB,GAAQA,EAAKxC,OAAOhR,IAExDva,KAAKotB,aAAaF,YAEXltB,KAGT,KAAKkkB,GACH,OAAOlkB,KAAK4qB,KAAK5qB,KAAKqsB,MAAQnI,GAGhC,OAAO/d,GACL,OAAU,MAANA,EAAmBnG,KAAK4rB,aAC5B5rB,KAAK4rB,YAAczlB,EACZnG,MAGT,MAAMutB,GACJ,OAAa,MAATA,EAAsBvtB,KAAK8rB,QAC/B9rB,KAAK8rB,OAASyB,EACPvtB,MAGT,OAGE,OADAA,KAAK4qB,KAAK,GACH5qB,KAAK4sB,QAGd,KAAKhC,GACH,OAAY,MAARA,EAAqB5qB,KAAKqsB,OAC9BrsB,KAAKqsB,MAAQzB,EACN5qB,KAAKktB,WAAU,IAIxB,WAAW3B,GACT,MAAM7kB,EAAQ1G,KAAKmsB,WAAWjjB,QAAQqiB,EAAOhR,IAE7C,OAAI7T,EAAQ,IAEZ1G,KAAKksB,SAASpD,OAAOpiB,EAAO,GAE5B1G,KAAKmsB,WAAWrD,OAAOpiB,EAAO,GAE9B6kB,EAAO3S,SAAS,OANM5Y,KAWxB,aAKE,OAJKA,KAAKguB,WACRhuB,KAAKssB,gBAAkBtsB,KAAK4rB,eAGvB5rB,KAIT,UAAUiuB,GAAgB,GAGxB,OAFAhE,GAASiE,YAAYluB,KAAKgsB,YAC1BhsB,KAAKgsB,WAAa,KACdiC,EAAsBjuB,KAAK0sB,kBAC3B1sB,KAAKisB,UACTjsB,KAAKgsB,WAAa/B,GAASkE,MAAMnuB,KAAKwsB,QADbxsB,MAK3B,QAAQiuB,GAAgB,GAEtB,MAAMrD,EAAO5qB,KAAK4rB,cAElB,IAAIwC,EAAWxD,EAAO5qB,KAAKssB,gBACvB2B,IAAeG,EAAW,GAC9B,MAAMC,EAASruB,KAAK8rB,OAASsC,GAAYpuB,KAAKqsB,MAAQrsB,KAAKusB,eAC3DvsB,KAAKssB,gBAAkB1B,EAGlBqD,IAEHjuB,KAAKqsB,OAASgC,EACdruB,KAAKqsB,MAAQrsB,KAAKqsB,MAAQ,EAAI,EAAIrsB,KAAKqsB,OAGzCrsB,KAAKusB,cAAgBvsB,KAAKqsB,MAC1BrsB,KAAKsuB,KAAK,OAAQtuB,KAAKqsB,OAWvB,IAAK,IAAI1hB,EAAI3K,KAAKksB,SAAS7rB,OAAQsK,KAAM,CAEvC,MAAM0gB,EAAarrB,KAAKksB,SAASvhB,GAC3B4gB,EAASF,EAAWE,OAGRvrB,KAAKqsB,MAAQhB,EAAWC,OAGzB,GACfC,EAAOgD,QAKX,IAAIC,GAAc,EAElB,IAAK,IAAIzzB,EAAI,EAAGohB,EAAMnc,KAAKksB,SAAS7rB,OAAQtF,EAAIohB,EAAKphB,IAAK,CAExD,MAAMswB,EAAarrB,KAAKksB,SAASnxB,GAC3BwwB,EAASF,EAAWE,OAC1B,IAAIrH,EAAKmK,EAGT,MAAMI,EAAYzuB,KAAKqsB,MAAQhB,EAAWC,MAE1C,GAAImD,GAAa,EAAG,CAClBD,GAAc,EACd,SAMF,GALWC,EAAYvK,IAErBA,EAAKuK,IAGFlD,EAAOyC,SAAU,SAKtB,GAFiBzC,EAAO7H,KAAKQ,GAAItjB,MAI1B,IAA2B,IAAvByqB,EAAWyC,QAAkB,CAEtBvC,EAAO1S,WAAa0S,EAAOX,OAAS5qB,KAAKqsB,MAE3ChB,EAAWyC,QAAU9tB,KAAKqsB,QAEtCd,EAAOsC,eACL9yB,IACAohB,SATJqS,GAAc,EAuBlB,OAPIA,KAAiBxuB,KAAK8rB,OAAS,GAAoB,IAAf9rB,KAAKqsB,QAAgBrsB,KAAKmsB,WAAW9rB,QAAUL,KAAK8rB,OAAS,GAAK9rB,KAAKqsB,MAAQ,EACrHrsB,KAAKktB,aAELltB,KAAK4sB,QACL5sB,KAAKsuB,KAAK,aAGLtuB,MAIX0B,EAAgB,CACd6Q,QAAS,CACPqG,SAAU,SAAUA,GAClB,OAAgB,MAAZA,GACF5Y,KAAK0uB,UAAY1uB,KAAK0uB,WAAa,IAAIhD,GAChC1rB,KAAK0uB,YAEZ1uB,KAAK0uB,UAAY9V,EACV5Y,UAMf,MAAM2uB,WAAe1W,GACnB,YAAYV,GACVnB,QAEApW,KAAKua,GAAKoU,GAAOpU,KAIjBhD,EAA6B,mBAF7BA,EAAqB,MAAXA,EAAkBqB,GAASC,SAAWtB,GAEN,IAAIwM,GAAWxM,GAAWA,EAEpEvX,KAAK8e,SAAW,KAChB9e,KAAK0uB,UAAY,KACjB1uB,KAAKY,MAAO,EACZZ,KAAK4uB,OAAS,GAEd5uB,KAAKokB,UAA+B,iBAAZ7M,GAAwBA,EAChDvX,KAAK6uB,eAAiBtX,aAAmBwM,GACzC/jB,KAAKkoB,SAAWloB,KAAK6uB,eAAiBtX,EAAU,IAAIuM,GAEpD9jB,KAAK8uB,SAAW,GAEhB9uB,KAAK+uB,SAAU,EACf/uB,KAAKqsB,MAAQ,EACbrsB,KAAKgvB,UAAY,EAEjBhvB,KAAKivB,UAAW,EAEhBjvB,KAAK0H,WAAa,IAAIoH,GACtB9O,KAAKkvB,YAAc,EAEnBlvB,KAAKmvB,eAAgB,EACrBnvB,KAAKovB,UAAW,EAChBpvB,KAAKqvB,WAAa,EAClBrvB,KAAKsvB,QAAS,EACdtvB,KAAKuvB,MAAQ,EACbvvB,KAAKwvB,OAAS,EACdxvB,KAAKyvB,SAAW,KAEhBzvB,KAAK+rB,WAAW/rB,KAAK6uB,gBAAwB,KAG/C,gBAAgBhW,EAAUE,EAAO0U,GAE/B,IAAIiC,EAAQ,EACRC,GAAQ,EACRC,EAAO,EAcX,OAZA7W,EAAQA,GAASH,GAASG,MAC1B0U,EAAOA,GAAQ,OAES,iBAJxB5U,EAAWA,GAAYD,GAASC,WAIMA,aAAoBgL,KACxD9K,EAAQF,EAASE,OAASA,EAC1B0U,EAAO5U,EAAS4U,MAAQA,EACxBkC,EAAQ9W,EAAS8W,OAASA,EAC1BD,EAAQ7W,EAAS6W,OAASA,EAC1BE,EAAO/W,EAAS+W,MAAQA,EACxB/W,EAAWA,EAASA,UAAYD,GAASC,UAGpC,CACLA,SAAUA,EACVE,MAAOA,EACP4W,MAAOA,EACPD,MAAOA,EACPE,KAAMA,EACNnC,KAAMA,GAIV,OAAOsB,GACL,OAAe,MAAXA,EAAwB/uB,KAAK+uB,SACjC/uB,KAAK+uB,QAAUA,EACR/uB,MAST,aAAa0S,EAAWhM,GAEtB,OADA1G,KAAK0H,WAAW+J,WAAWiB,GACpB1S,KAGT,MAAMmG,GACJ,OAAOnG,KAAKoX,GAAG,WAAYjR,GAG7B,QAAQ0S,EAAUE,EAAO0U,GACvB,MAAMjyB,EAAImzB,GAAOkB,SAAShX,EAAUE,EAAO0U,GACrClC,EAAS,IAAIoD,GAAOnzB,EAAEqd,UAG5B,OAFI7Y,KAAK0uB,WAAWnD,EAAO3S,SAAS5Y,KAAK0uB,WACrC1uB,KAAK8e,UAAUyM,EAAO3sB,QAAQoB,KAAK8e,UAChCyM,EAAOuE,KAAKt0B,GAAGu0B,SAASv0B,EAAEud,MAAOvd,EAAEiyB,MAG5C,iBAEE,OADAztB,KAAK0H,WAAa,IAAIoH,GACf9O,KAIT,2BACOA,KAAKY,MAASZ,KAAK0uB,WAAc1uB,KAAK0uB,UAAUvC,WAAWnoB,SAAShE,KAAKua,MAC5Eva,KAAK4uB,OAAS5uB,KAAK4uB,OAAOvsB,OAAO2nB,IACvBA,EAAKgG,cAKnB,MAAMjX,GACJ,OAAO/Y,KAAKiwB,QAAQ,EAAGlX,GAGzB,WACE,OAAO/Y,KAAKwvB,QAAUxvB,KAAKuvB,MAAQvvB,KAAKokB,WAAapkB,KAAKuvB,MAG5D,OAAOppB,GACL,OAAOnG,KAAKkwB,MAAM,KAAM/pB,GAG1B,KAAKA,GAEH,OADAnG,KAAKkoB,SAAW,IAAIpE,GAAK3d,GAClBnG,KAUT,QAAQpB,GACN,OAAe,MAAXA,EAAwBoB,KAAK8e,UACjC9e,KAAK8e,SAAWlgB,EAEhBA,EAAQuxB,iBAEDnwB,MAGT,SACE,OAAOA,KAAK0jB,KAAK3O,KAGnB,KAAK2a,EAAOC,EAAOC,GAiBjB,MAfqB,iBAAVF,IACTC,EAAQD,EAAMC,MACdC,EAAOF,EAAME,KACbF,EAAQA,EAAMA,OAIhB1vB,KAAKwvB,OAASE,GAAS3a,IACvB/U,KAAKsvB,OAASK,IAAS,EACvB3vB,KAAKuvB,MAAQK,GAAQ,GAED,IAAhB5vB,KAAKwvB,SACPxvB,KAAKwvB,OAASza,KAGT/U,KAGT,MAAMnD,GACJ,MAAMuzB,EAAepwB,KAAKokB,UAAYpkB,KAAKuvB,MAE3C,GAAS,MAAL1yB,EAAW,CACb,MAAMwzB,EAAY9tB,KAAKohB,MAAM3jB,KAAKqsB,MAAQ+D,GAEpC3pB,GADezG,KAAKqsB,MAAQgE,EAAYD,GACdpwB,KAAKokB,UACrC,OAAO7hB,KAAKiG,IAAI6nB,EAAY5pB,EAAUzG,KAAKwvB,QAG7C,MACMc,EAAUzzB,EAAI,EACd+tB,EAAOwF,EAFC7tB,KAAKohB,MAAM9mB,GAEWmD,KAAKokB,UAAYkM,EACrD,OAAOtwB,KAAK4qB,KAAKA,GAGnB,QAAQuC,GACN,OAAmB,MAAfA,EAA4BntB,KAAK+rB,UACrC/rB,KAAK+rB,SAAWoB,EACTntB,MAGT,SAASnD,GAEP,MAAM+G,EAAI5D,KAAKqsB,MACThxB,EAAI2E,KAAKokB,UACTzP,EAAI3U,KAAKuvB,MACTtzB,EAAI+D,KAAKwvB,OACT1yB,EAAIkD,KAAKsvB,OACTzzB,EAAImE,KAAKovB,SACf,IAAI3oB,EAEJ,GAAS,MAAL5J,EAAW,CAQb,MAAMmS,EAAI,SAAUpL,GAClB,MAAM2sB,EAAWzzB,EAAIyF,KAAKohB,MAAM/f,GAAK,GAAK+Q,EAAItZ,KAAOsZ,EAAItZ,IACnDm1B,EAAYD,IAAa10B,IAAM00B,GAAY10B,EAC3C40B,EAAWluB,KAAKkL,KAAK,EAAG+iB,IAAc5sB,GAAK+Q,EAAItZ,IAAMA,EAAIm1B,EAE/D,OADgBjuB,KAAKgG,IAAIhG,KAAKiG,IAAIioB,EAAU,GAAI,IAK5C9C,EAAU1xB,GAAK0Y,EAAItZ,GAAKsZ,EAE9B,OADAlO,EAAW7C,GAAK,EAAIrB,KAAK+F,MAAM0G,EAAE,OAASpL,EAAI+pB,EAAU3e,EAAEpL,GAAKrB,KAAK+F,MAAM0G,EAAE2e,EAAU,OAC/ElnB,EAIT,MAAM4pB,EAAY9tB,KAAKohB,MAAM3jB,KAAK0wB,SAC5BC,EAAe7zB,GAAKuzB,EAAY,GAAM,EAG5C,OADA5pB,EAAW4pB,GADMM,IAAiB90B,GAAKA,GAAK80B,EACT9zB,EAAI,EAAIA,GACpCmD,KAAK0wB,MAAMjqB,GAGpB,SAAS5J,GACP,OAAS,MAALA,EACK0F,KAAKiG,IAAI,EAAGxI,KAAKqsB,MAAQrsB,KAAK6Y,YAGhC7Y,KAAK4qB,KAAK/tB,EAAImD,KAAK6Y,YAS5B,MAAM+X,EAAQC,EAAOC,EAAYd,GAC/BhwB,KAAK4uB,OAAO/tB,KAAK,CACfkwB,YAAaH,GAAUjY,GACvB4S,OAAQsF,GAASlY,GACjBqY,SAAUF,EACVd,YAAaA,EACbiB,aAAa,EACbC,UAAU,IAKZ,OAFiBlxB,KAAK4Y,YACV5Y,KAAK4Y,WAAWsU,YACrBltB,KAGT,QACE,OAAIA,KAAKivB,WACTjvB,KAAK4qB,KAAK,GACV5qB,KAAKivB,UAAW,GAFUjvB,KAM5B,QAAQsf,GAEN,OADAtf,KAAKovB,SAAsB,MAAX9P,GAAmBtf,KAAKovB,SAAW9P,EAC5Ctf,KAGT,SAAS4Y,EAAUG,EAAO0U,GASxB,GAPM7U,aAAoB8S,KACxB+B,EAAO1U,EACPA,EAAQH,EACRA,EAAW5Y,KAAK4Y,aAIbA,EACH,MAAM5a,MAAM,+CAKd,OADA4a,EAASmX,SAAS/vB,KAAM+Y,EAAO0U,GACxBztB,KAGT,KAAKkkB,GAEH,IAAKlkB,KAAK+uB,QAAS,OAAO/uB,KAE1BkkB,EAAW,MAANA,EAAa,GAAKA,EACvBlkB,KAAKqsB,OAASnI,EACd,MAAMzd,EAAWzG,KAAKyG,WAEhB0qB,EAAUnxB,KAAKoxB,gBAAkB3qB,GAAYzG,KAAKqsB,OAAS,EACjErsB,KAAKoxB,cAAgB3qB,EAErB,MAAMoS,EAAW7Y,KAAK6Y,WAChBwY,EAAcrxB,KAAKgvB,WAAa,GAAKhvB,KAAKqsB,MAAQ,EAClDiF,EAAetxB,KAAKgvB,UAAYnW,GAAY7Y,KAAKqsB,OAASxT,EAChE7Y,KAAKgvB,UAAYhvB,KAAKqsB,MAElBgF,GACFrxB,KAAKsuB,KAAK,QAAStuB,MAMrB,MAAMuxB,EAAcvxB,KAAK6uB,eACzB7uB,KAAKY,MAAQ2wB,IAAgBD,GAAgBtxB,KAAKqsB,OAASxT,EAE3D7Y,KAAKivB,UAAW,EAChB,IAAIuC,GAAY,EAmBhB,OAjBIL,GAAWI,KACbvxB,KAAKyxB,YAAYN,GAGjBnxB,KAAK0H,WAAa,IAAIoH,GACtB0iB,EAAYxxB,KAAK0xB,KAAKH,EAAcrN,EAAKzd,GACzCzG,KAAKsuB,KAAK,OAAQtuB,OAKpBA,KAAKY,KAAOZ,KAAKY,MAAQ4wB,GAAaD,EAElCD,GACFtxB,KAAKsuB,KAAK,WAAYtuB,MAGjBA,KAST,KAAK4qB,GACH,GAAY,MAARA,EACF,OAAO5qB,KAAKqsB,MAGd,MAAMnI,EAAK0G,EAAO5qB,KAAKqsB,MAEvB,OADArsB,KAAK0jB,KAAKQ,GACHlkB,KAGT,SAAS4Y,GAEP,YAAwB,IAAbA,EAAiC5Y,KAAK0uB,WACjD1uB,KAAK0uB,UAAY9V,EACV5Y,MAGT,aACE,MAAM4Y,EAAW5Y,KAAK4Y,WAEtB,OADAA,GAAYA,EAASiV,WAAW7tB,MACzBA,KAIT,YAAYmxB,GAEV,GAAKA,GAAYnxB,KAAK6uB,eAEtB,IAAK,IAAI9zB,EAAI,EAAGohB,EAAMnc,KAAK4uB,OAAOvuB,OAAQtF,EAAIohB,IAAOphB,EAAG,CAEtD,MAAM+gB,EAAU9b,KAAK4uB,OAAO7zB,GAEtB42B,EAAU3xB,KAAK6uB,iBAAmB/S,EAAQmV,aAAeE,EAC/DA,GAAWrV,EAAQoV,SAEfS,GAAWR,IACbrV,EAAQiV,YAAY71B,KAAK8E,MACzB8b,EAAQmV,aAAc,IAM5B,iBAAiBW,EAAQC,GAWvB,GAVA7xB,KAAK8uB,SAAS8C,GAAU,CACtBC,QAASA,EACTC,OAAQ9xB,KAAK4uB,OAAO5uB,KAAK4uB,OAAOvuB,OAAS,IAQvCL,KAAK6uB,eAAgB,CACvB,MAAMjW,EAAW5Y,KAAK4Y,WACtBA,GAAYA,EAASmZ,QAMzB,KAAKC,GAEH,IAAIC,GAAc,EAElB,IAAK,IAAIl3B,EAAI,EAAGohB,EAAMnc,KAAK4uB,OAAOvuB,OAAQtF,EAAIohB,IAAOphB,EAAG,CAEtD,MAAM+gB,EAAU9b,KAAK4uB,OAAO7zB,GAGtBy2B,EAAY1V,EAAQyP,OAAOrwB,KAAK8E,KAAMgyB,GAC5ClW,EAAQoV,SAAWpV,EAAQoV,WAA0B,IAAdM,EACvCS,EAAcA,GAAenW,EAAQoV,SAIvC,OAAOe,EAIT,aAAaL,EAAQ3N,EAAQiO,GAC3B,GAAIlyB,KAAK8uB,SAAS8C,GAAS,CAEzB,IAAK5xB,KAAK8uB,SAAS8C,GAAQE,OAAOb,YAAa,CAC7C,MAAMvqB,EAAQ1G,KAAK4uB,OAAO1lB,QAAQlJ,KAAK8uB,SAAS8C,GAAQE,QAIxD,OAFA9xB,KAAK4uB,OAAO9F,OAAOpiB,EAAO,IAEnB,EAKL1G,KAAK8uB,SAAS8C,GAAQE,OAAOd,SAC/BhxB,KAAK8uB,SAAS8C,GAAQE,OAAOd,SAAS91B,KAAK8E,KAAMikB,EAAQiO,GAGzDlyB,KAAK8uB,SAAS8C,GAAQC,QAAQ7wB,GAAGijB,GAGnCjkB,KAAK8uB,SAAS8C,GAAQE,OAAOZ,UAAW,EACxC,MAAMtY,EAAW5Y,KAAK4Y,WAEtB,OADAA,GAAYA,EAASmZ,QACd,EAGT,OAAO,GAIXpD,GAAOpU,GAAK,EACZ,MAAM4X,GACJ,YAAYzqB,EAAa,IAAIoH,GAAUyL,GAAK,EAAI3Z,GAAO,GACrDZ,KAAK0H,WAAaA,EAClB1H,KAAKua,GAAKA,EACVva,KAAKY,KAAOA,EAGd,6BAGFoF,EAAO,CAAC2oB,GAAQwD,IAAa,CAC3B,UAAU5G,GACR,OAAO,IAAI4G,GAAW5G,EAAO7jB,WAAW6X,UAAUvf,KAAK0H,YAAa6jB,EAAOhR,OAK/E,MAAMgF,GAAY,CAACjD,EAAMC,IAASD,EAAK7K,WAAW8K,GAE5C6V,GAAqB7G,GAAUA,EAAO7jB,WAE5C,SAAS2qB,KAEP,MACMC,EADUtyB,KAAKuyB,uBAAuBC,QACfvwB,IAAImwB,IAAoB1b,OAAO6I,GAAW,IAAIzQ,IAC3E9O,KAAK0S,UAAU4f,GAEftyB,KAAKuyB,uBAAuBE,QAEiB,IAAzCzyB,KAAKuyB,uBAAuBlyB,WAC9BL,KAAKyvB,SAAW,MAIpB,MAAMiD,GACJ,cACE1yB,KAAKwyB,QAAU,GACfxyB,KAAK2yB,IAAM,GAGb,IAAIpH,GACF,GAAIvrB,KAAKwyB,QAAQxuB,SAASunB,GAAS,OACnC,MAAMhR,EAAKgR,EAAOhR,GAAK,EAGvB,OAFAva,KAAKwyB,QAAQ3xB,KAAK0qB,GAClBvrB,KAAK2yB,IAAI9xB,KAAK0Z,GACPva,KAGT,YAAYua,GACV,MAAMqY,EAAY5yB,KAAK2yB,IAAIzpB,QAAQqR,EAAK,IAAM,EAG9C,OAFAva,KAAK2yB,IAAI7J,OAAO,EAAG8J,EAAW,GAC9B5yB,KAAKwyB,QAAQ1J,OAAO,EAAG8J,EAAW,IAAIT,IAActoB,QAAQhO,GAAKA,EAAEg3B,4BAC5D7yB,KAGT,KAAKua,EAAIuY,GACP,MAAMpsB,EAAQ1G,KAAK2yB,IAAIzpB,QAAQqR,EAAK,GAGpC,OAFAva,KAAK2yB,IAAI7J,OAAOpiB,EAAO,EAAG6T,EAAK,GAC/Bva,KAAKwyB,QAAQ1J,OAAOpiB,EAAO,EAAGosB,GACvB9yB,KAGT,QAAQua,GACN,OAAOva,KAAKwyB,QAAQxyB,KAAK2yB,IAAIzpB,QAAQqR,EAAK,IAG5C,SACE,OAAOva,KAAK2yB,IAAItyB,OAGlB,QACE,IAAI0yB,EAAa,KAEjB,IAAK,IAAIh4B,EAAI,EAAGA,EAAIiF,KAAKwyB,QAAQnyB,SAAUtF,EAAG,CAC5C,MAAMwwB,EAASvrB,KAAKwyB,QAAQz3B,GAI5B,GAHkBg4B,GAAcxH,EAAO3qB,MAAQmyB,EAAWnyB,QACrD2qB,EAAOmD,YAAcnD,EAAOmD,UAAUvC,WAAWnoB,SAASunB,EAAOhR,QAAUwY,EAAWrE,YAAcqE,EAAWrE,UAAUvC,WAAWnoB,SAAS+uB,EAAWxY,KAE9I,CAEbva,KAAK8G,OAAOykB,EAAOhR,IACnB,MAAMuY,EAAYvH,EAAOyH,UAAUD,GACnC/yB,KAAKizB,KAAKF,EAAWxY,GAAIuY,GACzBC,EAAaD,IACX/3B,OAEFg4B,EAAaxH,EAIjB,OAAOvrB,KAGT,OAAOua,GACL,MAAM7T,EAAQ1G,KAAK2yB,IAAIzpB,QAAQqR,EAAK,GAGpC,OAFAva,KAAK2yB,IAAI7J,OAAOpiB,EAAO,GACvB1G,KAAKwyB,QAAQ1J,OAAOpiB,EAAO,GACpB1G,MAIX0B,EAAgB,CACd6Q,QAAS,CACP,QAAQsG,EAAUE,EAAO0U,GACvB,MAAMjyB,EAAImzB,GAAOkB,SAAShX,EAAUE,EAAO0U,GACrC7U,EAAW5Y,KAAK4Y,WACtB,OAAO,IAAI+V,GAAOnzB,EAAEqd,UAAUiX,KAAKt0B,GAAGoD,QAAQoB,MAAM4Y,SAASA,EAASmZ,QAAQhC,SAASv0B,EAAEud,MAAOvd,EAAEiyB,OAGpG,MAAMyF,EAAIzF,GACR,OAAOztB,KAAKiwB,QAAQ,EAAGiD,EAAIzF,IAO7B,6BAA6B0F,GAC3BnzB,KAAKuyB,uBAAuBa,YAAYD,EAAc5Y,KAGxD,kBAAkBuB,GAChB,OAAO9b,KAAKuyB,uBAAuBC,QAGlCnwB,OAAOkpB,GAAUA,EAAOhR,IAAMuB,EAAQvB,IAAItY,IAAImwB,IAAoB1b,OAAO6I,GAAW,IAAIzQ,KAG3F,WAAWyc,GACTvrB,KAAKuyB,uBAAuB1rB,IAAI0kB,GAKhCtB,GAASoJ,gBAAgBrzB,KAAKyvB,UAC9BzvB,KAAKyvB,SAAWxF,GAASqJ,UAAUjB,GAAgB91B,KAAKyD,QAG1D,iBACuB,MAAjBA,KAAKyvB,WACPzvB,KAAKuyB,wBAAyB,IAAIG,IAAc7rB,IAAI,IAAIsrB,GAAW,IAAIrjB,GAAO9O,aAStFgG,EAAO2oB,GAAQ,CACb,KAAKvkB,EAAGC,GACN,OAAOrK,KAAKuzB,UAAU,OAAQnpB,EAAGC,IAInC,IAAIvN,EAAGuN,GACL,OAAOrK,KAAKuzB,UAAU,MAAOz2B,EAAGuN,IAGlC,UAAUmO,EAAMgb,EAAa/pB,GAC3B,GAA2B,iBAAhB+pB,EACT,OAAOxzB,KAAKuzB,UAAU/a,EAAM,CAC1B,CAACgb,GAAc/pB,IAInB,IAAImN,EAAQ4c,EACZ,GAAIxzB,KAAKyzB,aAAajb,EAAM5B,GAAQ,OAAO5W,KAC3C,IAAI6xB,EAAU,IAAI5J,GAAUjoB,KAAKkoB,UAAUlnB,GAAG4V,GAC1C8G,EAAOjiB,OAAOiiB,KAAK9G,GAkCvB,OAjCA5W,KAAKkwB,OAAM,WACT2B,EAAUA,EAAQ5wB,KAAKjB,KAAKpB,UAAU4Z,GAAMkF,OAC3C,SAAU0F,GAEX,OADApjB,KAAKpB,UAAU4Z,GAAMqZ,EAAQ6B,GAAGtQ,GAAK1J,WAC9BmY,EAAQjxB,UACd,SAAU+yB,GAEX,MAAMC,EAAUn4B,OAAOiiB,KAAKiW,GACtBE,GA/BWr0B,EA+BuBke,EAATkW,EA/BNvxB,OAAOuB,IAAMpE,EAAEwE,SAASJ,KAApC,IAAIpE,EAiCjB,GAAIq0B,EAAYxzB,OAAQ,CAEtB,MAAMyzB,EAAiB9zB,KAAKpB,UAAU4Z,GAAMqb,GAEtCE,EAAe,IAAI/L,GAAU6J,EAAQ5wB,QAAQyY,UAEnDje,OAAO0E,OAAO4zB,EAAcD,GAC5BjC,EAAQ5wB,KAAK8yB,GAIf,MAAMC,EAAa,IAAIhM,GAAU6J,EAAQ7wB,MAAM0Y,UAE/Cje,OAAO0E,OAAO6zB,EAAYL,GAE1B9B,EAAQ7wB,GAAGgzB,GAEXtW,EAAOkW,EACPhd,EAAQ+c,KAGV3zB,KAAKi0B,iBAAiBzb,EAAMqZ,GAErB7xB,MAGT,KAAKwV,EAAOC,GACV,GAAIzV,KAAKyzB,aAAa,OAAQje,EAAOC,GAAQ,OAAOzV,KACpD,IAAI6xB,EAAU,IAAI5J,GAAUjoB,KAAKkoB,UAAUlnB,GAAG,IAAIsY,GAAU9D,IAa5D,OAZAxV,KAAKkwB,OAAM,WACT2B,EAAUA,EAAQ5wB,KAAKjB,KAAKpB,UAAUkX,WACrC,SAAUsN,GAEX,OADApjB,KAAKpB,UAAUkX,KAAK+b,EAAQ6B,GAAGtQ,GAAM3N,GAC9Boc,EAAQjxB,UACd,SAAUszB,EAAUC,GACrB1e,EAAQ0e,EACRtC,EAAQ7wB,GAAGkzB,MAGbl0B,KAAKi0B,iBAAiB,OAAQpC,GAEvB7xB,MAkBT,UAAU0H,EAAYmJ,EAAUujB,GAI9B,GAFAvjB,EAAWnJ,EAAWmJ,UAAYA,EAE9B7Q,KAAK6uB,iBAAmBhe,GAAY7Q,KAAKyzB,aAAa,YAAa/rB,GACrE,OAAO1H,KAIT,MAAMq0B,EAAWvlB,GAAOC,aAAarH,GACrC0sB,EAA8B,MAArB1sB,EAAW0sB,OAAiB1sB,EAAW0sB,OAAmB,MAAVA,EAAiBA,GAAUC,EAEpF,MAAMxC,EAAU,IAAI5J,GAAUjoB,KAAKkoB,UAAU1P,KAAK4b,EAASzL,GAAe7Z,IAC1E,IAAIvL,EACA3E,EACAkd,EACAwY,EACAC,EAiFJ,OAFAv0B,KAAKkwB,OA7EL,WAEEtxB,EAAUA,GAAWoB,KAAKpB,UAC1B2E,EAASA,GAAUD,EAAUoE,EAAY9I,GACzC21B,EAAiB,IAAIzlB,GAAO+B,OAAW2jB,EAAY51B,GAEnDA,EAAQ61B,WAAWz0B,MAGd6Q,GACHjS,EAAQ81B,6BAA6B10B,SAIzC,SAAaojB,GAGNvS,GAAU7Q,KAAK20B,iBACpB,MAAM,EACJ/wB,EAAC,EACDC,GACE,IAAI4K,GAAMlL,GAAQmP,UAAU9T,EAAQg2B,kBAAkB50B,OAC1D,IAAIikB,EAAS,IAAInV,GAAO,IAAKpH,EAC3BnE,OAAQ,CAACK,EAAGC,KAEVynB,EAAQtrB,KAAK6uB,gBAAkB/S,EAAUA,EAAUyY,EAEvD,GAAIH,EAAQ,CACVnQ,EAASA,EAAOpE,UAAUjc,EAAGC,GAC7BynB,EAAQA,EAAMzL,UAAUjc,EAAGC,GAE3B,MAAMgxB,EAAU5Q,EAAOhU,OACjB6kB,EAAWxJ,EAAMrb,OAEjB8kB,EAAgB,CAACF,EAAU,IAAKA,EAASA,EAAU,KACnDG,EAAYD,EAAc9yB,IAAImI,GAAK7H,KAAK4M,IAAI/E,EAAI0qB,IAChDG,EAAW1yB,KAAKiG,OAAOwsB,GACvBtuB,EAAQsuB,EAAU9rB,QAAQ+rB,GAChChR,EAAOhU,OAAS8kB,EAAcruB,GAG5BmK,IAGGwjB,IACHpQ,EAAOhU,OAASvI,EAAWuI,QAAU,GAGnCjQ,KAAK6uB,gBAAkByF,IACzBhJ,EAAMrb,OAASqkB,IAInBzC,EAAQ5wB,KAAKqqB,GACbuG,EAAQ7wB,GAAGijB,GACX,MAAMiR,EAAmBrD,EAAQ6B,GAAGtQ,GAOpC,OANAkR,EAAeY,EAAiBjlB,OAChC6L,EAAU,IAAIhN,GAAOomB,GACrBl1B,KAAKm1B,aAAarZ,GAElBld,EAAQ61B,WAAWz0B,MAEZ6xB,EAAQjxB,UAGjB,SAAkBw0B,IAEXA,EAAc7xB,QAAU,UAAUkF,cAAgBf,EAAWnE,QAAU,UAAUkF,aACpFlF,EAASD,EAAU8xB,EAAex2B,IAIpC8I,EAAa,IAAK0tB,EAChB7xB,aAI6B,GACjCvD,KAAK6uB,gBAAkB7uB,KAAKi0B,iBAAiB,YAAapC,GACnD7xB,MAIT,EAAE4D,EAAGiN,GACH,OAAO7Q,KAAKq1B,aAAa,IAAKzxB,IAIhC,EAAEC,GACA,OAAO7D,KAAKq1B,aAAa,IAAKxxB,IAGhC,GAAGD,EAAI,GACL,OAAO5D,KAAKs1B,kBAAkB,IAAK1xB,IAGrC,GAAGC,EAAI,GACL,OAAO7D,KAAKs1B,kBAAkB,IAAKzxB,IAGrC,MAAMD,EAAGC,GACP,OAAO7D,KAAKsR,GAAG1N,GAAG2N,GAAG1N,IAGvB,kBAAkB+tB,EAAQ5wB,GAGxB,GAFAA,EAAK,IAAIsY,GAAUtY,GAEfhB,KAAKyzB,aAAa7B,EAAQ5wB,GAAK,OAAOhB,KAE1C,MAAM6xB,EAAU,IAAI5J,GAAUjoB,KAAKkoB,UAAUlnB,GAAGA,GAChD,IAAIC,EAAO,KAcX,OAbAjB,KAAKkwB,OAAM,WACTjvB,EAAOjB,KAAKpB,UAAUgzB,KACtBC,EAAQ5wB,KAAKA,GACb4wB,EAAQ7wB,GAAGC,EAAOD,MACjB,SAAUoiB,GAEX,OADApjB,KAAKpB,UAAUgzB,GAAQC,EAAQ6B,GAAGtQ,IAC3ByO,EAAQjxB,UACd,SAAU20B,GACX1D,EAAQ7wB,GAAGC,EAAO,IAAIqY,GAAUic,OAGlCv1B,KAAKi0B,iBAAiBrC,EAAQC,GAEvB7xB,MAGT,aAAa4xB,EAAQ5wB,GAEnB,GAAIhB,KAAKyzB,aAAa7B,EAAQ5wB,GAAK,OAAOhB,KAE1C,MAAM6xB,EAAU,IAAI5J,GAAUjoB,KAAKkoB,UAAUlnB,GAAGA,GAUhD,OATAhB,KAAKkwB,OAAM,WACT2B,EAAQ5wB,KAAKjB,KAAKpB,UAAUgzB,SAC3B,SAAUxO,GAEX,OADApjB,KAAKpB,UAAUgzB,GAAQC,EAAQ6B,GAAGtQ,IAC3ByO,EAAQjxB,UAGjBZ,KAAKi0B,iBAAiBrC,EAAQC,GAEvB7xB,MAGT,aAAa4xB,EAAQ51B,GACnB,OAAOgE,KAAKw1B,aAAa5D,EAAQ,IAAItY,GAAUtd,KAIjD,GAAG4H,GACD,OAAO5D,KAAKq1B,aAAa,KAAMzxB,IAIjC,GAAGC,GACD,OAAO7D,KAAKq1B,aAAa,KAAMxxB,IAIjC,KAAKD,EAAGC,GACN,OAAO7D,KAAK4D,EAAEA,GAAGC,EAAEA,IAIrB,OAAOD,EAAGC,GACR,OAAO7D,KAAKkR,GAAGtN,GAAGuN,GAAGtN,IAIvB,KAAKX,EAAOC,GAEV,IAAIC,EAcJ,OAZKF,GAAUC,IACbC,EAAMpD,KAAK8e,SAASzb,QAGjBH,IACHA,EAAQE,EAAIF,MAAQE,EAAID,OAASA,GAG9BA,IACHA,EAASC,EAAID,OAASC,EAAIF,MAAQA,GAG7BlD,KAAKkD,MAAMA,GAAOC,OAAOA,IAIlC,MAAMD,GACJ,OAAOlD,KAAKq1B,aAAa,QAASnyB,IAIpC,OAAOC,GACL,OAAOnD,KAAKq1B,aAAa,SAAUlyB,IAIrC,KAAKiH,EAAG5K,EAAGpE,EAAGC,GAEZ,GAAyB,IAArB+E,UAAUC,OACZ,OAAOL,KAAK6iB,KAAK,CAACzY,EAAG5K,EAAGpE,EAAGC,IAG7B,GAAI2E,KAAKyzB,aAAa,OAAQrpB,GAAI,OAAOpK,KACzC,MAAM6xB,EAAU,IAAI5J,GAAUjoB,KAAKkoB,UAAU1P,KAAKxY,KAAK8e,SAAS2D,YAAYzhB,GAAGoJ,GAW/E,OAVApK,KAAKkwB,OAAM,WACT2B,EAAQ5wB,KAAKjB,KAAK8e,SAAS1gB,YAC1B,SAAUglB,GAGX,OAFApjB,KAAK8e,SAAS+D,KAAKgP,EAAQ6B,GAAGtQ,IAEvByO,EAAQjxB,UAGjBZ,KAAKi0B,iBAAiB,OAAQpC,GAEvB7xB,MAIT,QAAQhE,GACN,OAAOgE,KAAKq1B,aAAa,UAAWr5B,IAItC,QAAQ4H,EAAGC,EAAGX,EAAOC,GACnB,OAAOnD,KAAKw1B,aAAa,UAAW,IAAIlhB,GAAI1Q,EAAGC,EAAGX,EAAOC,KAG3D,OAAO3H,GACL,MAAiB,iBAANA,EACFwE,KAAKuhB,OAAO,CACjBpI,OAAQ/Y,UAAU,GAClB8K,MAAO9K,UAAU,GACjB8Y,QAAS9Y,UAAU,MAIN,MAAb5E,EAAE0d,SAAiBlZ,KAAKqG,KAAK,eAAgB7K,EAAE0d,SACpC,MAAX1d,EAAE0P,OAAelL,KAAKqG,KAAK,aAAc7K,EAAE0P,OAC/B,MAAZ1P,EAAE2d,QAAgBnZ,KAAKqG,KAAK,SAAU7K,EAAE2d,QACrCnZ,SAIXgG,EAAO2oB,GAAQ,CACb7d,MACAE,MACA/P,QACAD,QAEF4E,EAAS+oB,GAAQ,UAEjB,MAAM8G,WAAY3V,GAChB,YAAY/gB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,MAAOtG,GAAO6X,GAC9B5W,KAAK8X,YAIP,OACE,OAAK9X,KAAKoe,SACH7Y,EAAMvF,KAAKjB,KAAKgG,cAAc,UAAY/E,KAAKia,IAAI,IAAIgG,IADnCjgB,KAAK0E,OAAO4Y,OAIzC,SACE,OAAQtd,KAAKjB,KAAKkV,cAAgBjU,KAAKjB,KAAKkV,sBAAsB3P,EAAQC,OAAOuV,aAAiD,uBAAlC9Z,KAAKjB,KAAKkV,WAAWxO,SAIvH,YACE,OAAKzF,KAAKoe,SACHpe,KAAKqG,KAAK,CACflC,MAAOF,EACPyxB,QAAS,QACRrvB,KAAK,cAAejC,EAAOD,GAAOkC,KAAK,cAAehC,EAAOF,GAJrCnE,KAAK0E,OAAOoT,YAOzC,kBACE,OAAO9X,KAAKqG,KAAK,CACflC,MAAO,KACPuxB,QAAS,OACRrvB,KAAK,cAAe,KAAMlC,GAAOkC,KAAK,cAAe,KAAMlC,GAKhE,OACE,OAAInE,KAAKoe,SAAiBpe,KACnBoW,MAAM1R,QAIjBhD,EAAgB,CACdoe,UAAW,CAET6V,OAAQzvB,GAAkB,WACxB,OAAOlG,KAAKia,IAAI,IAAIwb,UAI1B7vB,EAAS6vB,GAAK,OAAO,GAErB,MAAM,WAAe3V,GAEnB,YAAY/gB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,SAAUtG,GAAO6X,IAIrClV,EAAgB,CACdoe,UAAW,CACTrhB,OAAQyH,GAAkB,WACxB,OAAOlG,KAAKia,IAAI,IAAI,UAI1BrU,EAAS,GAAQ,UAuEjB,IAAIgwB,GAAW,CACbl2B,UAAW,KACXm2B,MAvEF,SAAena,GAQb,OANoB,IAAhB1b,KAAK81B,QACP91B,KAAKqhB,QAIPrhB,KAAKjB,KAAKgb,YAAYzV,EAAQE,SAASuxB,eAAera,IAC/C1b,MAgEPK,OA7DF,WACE,OAAOL,KAAKjB,KAAKi3B,yBA6DjBpyB,EAxDF,SAAaA,EAAGR,EAAMpD,KAAKqD,QACzB,OAAS,MAALO,EACKR,EAAIQ,EAGN5D,KAAKqG,KAAK,IAAKrG,KAAKqG,KAAK,KAAOzC,EAAIR,EAAIQ,IAoD/CC,EAjDF,SAAaA,EAAGT,EAAMpD,KAAKqD,QACzB,OAAS,MAALQ,EACKT,EAAIS,EAGN7D,KAAKqG,KAAK,IAAKrG,KAAKqG,KAAK,KAAOxC,EAAIT,EAAIS,IA6C/Cgd,KA3CF,SAAgBjd,EAAGC,EAAGT,EAAMpD,KAAKqD,QAC/B,OAAOrD,KAAK4D,EAAEA,EAAGR,GAAKS,EAAEA,EAAGT,IA2C3B8N,GAxCF,SAAYtN,EAAGR,EAAMpD,KAAKqD,QACxB,OAAS,MAALO,EACKR,EAAI8N,GAGNlR,KAAKqG,KAAK,IAAKrG,KAAKqG,KAAK,KAAOzC,EAAIR,EAAI8N,KAoC/CC,GAjCF,SAAYtN,EAAGT,EAAMpD,KAAKqD,QACxB,OAAS,MAALQ,EACKT,EAAI+N,GAGNnR,KAAKqG,KAAK,IAAKrG,KAAKqG,KAAK,KAAOxC,EAAIT,EAAI+N,KA6B/C8kB,OA3BF,SAAgBryB,EAAGC,EAAGT,EAAMpD,KAAKqD,QAC/B,OAAOrD,KAAKkR,GAAGtN,EAAGR,GAAK+N,GAAGtN,EAAGT,IA2B7B8yB,GAzBF,SAAYtyB,GACV,OAAO5D,KAAKqG,KAAK,IAAKzC,IAyBtBuyB,GAvBF,SAAYtyB,GACV,OAAO7D,KAAKqG,KAAK,IAAKxC,IAuBtBuyB,MArBF,SAAexyB,EAAGC,GAChB,OAAO7D,KAAKk2B,GAAGtyB,GAAGuyB,GAAGtyB,IAqBrBwyB,MAlBF,SAAeA,GAEb,OADAr2B,KAAK81B,SAAWO,EACTr2B,OAmBT,MAAMs2B,WAAapW,GAEjB,YAAYnhB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,OAAQtG,GAAO6X,GAC/B5W,KAAKmd,IAAIN,QAAU,IAAIvD,GAAU,KAEjCtZ,KAAKu2B,UAAW,EAEhBv2B,KAAK81B,QAAS,EAIhB,QAAQ95B,GAEN,OAAa,MAATA,EACKgE,KAAKmd,IAAIN,SAIlB7c,KAAKmd,IAAIN,QAAU,IAAIvD,GAAUtd,GAC1BgE,KAAKgd,WAId,QAAQA,GAON,GALuB,kBAAZA,IACThd,KAAKu2B,SAAWvZ,GAIdhd,KAAKu2B,SAAU,CACjB,MAAMC,EAAOx2B,KACb,IAAIy2B,EAAkB,EACtB,MAAM5Z,EAAU7c,KAAKmd,IAAIN,QACzB7c,KAAK6W,MAAK,SAAU9b,GAClB,MAAM27B,EAAWpyB,EAAQC,OAAOoyB,iBAAiB32B,KAAKjB,MAAM63B,iBAAiB,aACvErlB,EAAKsL,EAAU,IAAIvD,GAAUod,GAE/B12B,KAAKmd,IAAI0Z,WACX72B,KAAKqG,KAAK,IAAKmwB,EAAKnwB,KAAK,MAEL,OAAhBrG,KAAK0b,OACP+a,GAAmBllB,GAEnBvR,KAAKqG,KAAK,KAAMtL,EAAIwW,EAAKklB,EAAkB,GAC3CA,EAAkB,OAIxBz2B,KAAKsuB,KAAK,WAGZ,OAAOtuB,KAIT,QAAQxE,GAGN,OAFAwE,KAAKmd,IAAM3hB,EACXwE,KAAKmd,IAAIN,QAAU,IAAIvD,GAAU9d,EAAEqhB,SAAW,KACvC7c,KAIT,KAAK0b,GAEH,QAAa8Y,IAAT9Y,EAAoB,CACtB,MAAMlV,EAAWxG,KAAKjB,KAAKib,WAC3B,IAAI8c,EAAY,EAChBpb,EAAO,GAEP,IAAK,IAAI3gB,EAAI,EAAGohB,EAAM3V,EAASnG,OAAQtF,EAAIohB,IAAOphB,EAEnB,aAAzByL,EAASzL,GAAG0K,UAMZ1K,IAAM+7B,GAAsC,IAAzBtwB,EAASzL,GAAGg8B,WAAsD,IAApCxxB,EAAMiB,EAASzL,IAAIoiB,IAAI0Z,WAC1Enb,GAAQ,MAIVA,GAAQlV,EAASzL,GAAG4gB,aAVR,IAAN5gB,IAAS+7B,EAAY,GAa7B,OAAOpb,EAMT,GAFA1b,KAAKqhB,QAAQgV,OAAM,GAEC,mBAAT3a,EAETA,EAAKxgB,KAAK8E,KAAMA,WAKhB,IAAK,IAAIyY,EAAI,EAAGyN,GAFhBxK,GAAQA,EAAO,IAAI1S,MAAM,OAEC3I,OAAQoY,EAAIyN,EAAIzN,IACxCzY,KAAKg3B,QAAQtb,EAAKjD,IAKtB,OAAOzY,KAAKq2B,OAAM,GAAOrZ,WAI7BhX,EAAOswB,GAAMV,IACbl0B,EAAgB,CACdoe,UAAW,CAETpE,KAAMxV,GAAkB,SAAUwV,EAAO,IACvC,OAAO1b,KAAKia,IAAI,IAAIqc,IAAQ5a,KAAKA,MAGnCma,MAAO3vB,GAAkB,SAAUwV,EAAO,IACxC,OAAO1b,KAAKia,IAAI,IAAIqc,IAAQT,MAAMna,SAIxC9V,EAAS0wB,GAAM,QAEf,MAAMW,WAAc/W,GAElB,YAAYnhB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,QAAStG,GAAO6X,GAChC5W,KAAK81B,QAAS,EAIhB,GAAGxkB,GACD,OAAOtR,KAAKqG,KAAK,KAAMiL,GAIzB,GAAGC,GACD,OAAOvR,KAAKqG,KAAK,KAAMkL,GAIzB,UAEEvR,KAAKmd,IAAI0Z,UAAW,EAEpB,MAAMnb,EAAO1b,KAAKuG,SAElB,KAAMmV,aAAgB4a,IACpB,OAAOt2B,KAGT,MAAMjF,EAAI2gB,EAAKhV,MAAM1G,MACf02B,EAAWpyB,EAAQC,OAAOoyB,iBAAiB32B,KAAKjB,MAAM63B,iBAAiB,aACvErlB,EAAKmK,EAAKyB,IAAIN,QAAU,IAAIvD,GAAUod,GAE5C,OAAO12B,KAAKuR,GAAGxW,EAAIwW,EAAK,GAAGlL,KAAK,IAAKqV,EAAK9X,KAI5C,KAAK8X,GACH,OAAY,MAARA,EAAqB1b,KAAKjB,KAAK4c,aAAe3b,KAAKmd,IAAI0Z,SAAW,KAAO,KAEzD,mBAATnb,GACT1b,KAAKqhB,QAAQgV,OAAM,GACnB3a,EAAKxgB,KAAK8E,KAAMA,MAChBA,KAAKq2B,OAAM,IAEXr2B,KAAK61B,MAAMna,GAGN1b,OAIXgG,EAAOixB,GAAOrB,IACdl0B,EAAgB,CACdu1B,MAAO,CACLC,MAAOhxB,GAAkB,SAAUwV,EAAO,IACxC,MAAMwb,EAAQ,IAAID,GAOlB,OALKj3B,KAAK81B,QACR91B,KAAKqhB,QAIArhB,KAAKia,IAAIid,GAAOxb,KAAKA,OAGhC4a,KAAM,CACJU,QAAS,SAAUtb,EAAO,IACxB,OAAO1b,KAAKk3B,MAAMxb,GAAMsb,cAI9BpxB,EAASqxB,GAAO,SAEhB,MAAME,WAAejX,GACnB,YAAYnhB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,SAAUtG,GAAO6X,GAGnC,OAAO/a,GACL,OAAOmE,KAAKqG,KAAK,IAAKxK,GAIxB,GAAGiV,GACD,OAAO9Q,KAAKqG,KAAK,IAAKyK,GAIxB,GAAGE,GACD,OAAOhR,KAAK8Q,GAAGE,GAGjB,KAAK+C,GACH,OAAO/T,KAAK6e,OAAO,IAAIvF,GAAUvF,GAAMyM,OAAO,KAIlDxa,EAAOmxB,GAAQ,CACbvzB,EAAGuc,GACHtc,EAAGuc,GACHlP,GAAImP,GACJlP,GAAImP,GACJpd,MAAOqd,GACPpd,OAAQsd,KAEV/e,EAAgB,CACdoe,UAAW,CAETsX,OAAQlxB,GAAkB,SAAU6N,EAAO,GACzC,OAAO/T,KAAKia,IAAI,IAAIkd,IAAUpjB,KAAKA,GAAM8M,KAAK,EAAG,SAIvDjb,EAASuxB,GAAQ,UAEjB,MAAME,WAAiBvX,GACrB,YAAY/gB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,WAAYtG,GAAO6X,GAIrC,SAME,OAJA5W,KAAKs3B,UAAUztB,SAAQ,SAAUD,GAC/BA,EAAG2tB,YAGEnhB,MAAMtP,SAGf,UACE,OAAOyP,GAAS,oBAAsBvW,KAAKua,KAAO,OAItD7Y,EAAgB,CACdoe,UAAW,CAET0X,KAAMtxB,GAAkB,WACtB,OAAOlG,KAAKsd,OAAOrD,IAAI,IAAIod,QAG/B9kB,QAAS,CAEP,UACE,OAAOvS,KAAKyH,UAAU,cAGxB,SAAS7I,GAEP,MAAM64B,EAAU74B,aAAmBy4B,GAAWz4B,EAAUoB,KAAKuG,SAASixB,OAAO3wB,IAAIjI,GAEjF,OAAOoB,KAAKqG,KAAK,YAAa,SAAWoxB,EAAQld,KAAO,OAI1D,SACE,OAAOva,KAAKqG,KAAK,YAAa,UAKpCT,EAASyxB,GAAU,YAEnB,MAAMK,WAAsBnlB,GAC1B,YAAYxT,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,gBAAiBtG,GAAO6X,IAI5ClV,EAAgB,CACdoe,UAAW,CACT6X,cAAezxB,GAAkB,SAAUhD,EAAOC,GAChD,OAAOnD,KAAKia,IAAI,IAAIyd,IAAiB3jB,KAAK7Q,EAAOC,SAIvDyC,EAAS8xB,GAAe,iBAgExB,IAAIE,GAAoB,CACtBl4B,UAAW,KACXm4B,MAhEF,SAAevmB,EAAIC,GAsBjB,OArBAvR,KAAKwG,WAAWqD,QAAQ,CAACiuB,EAAO/8B,KAC9B,IAAIsI,EAGJ,IAEEA,EAAOy0B,EAAMz0B,OACb,MAAO5C,GACP,OAIF,MAAMtF,EAAI,IAAI2T,GAAOgpB,GAGf1mB,EAASjW,EAAEqV,UAAUc,EAAIC,GAAImB,UAAUvX,EAAE8iB,WAEzCphB,EAAI,IAAI4R,GAAMpL,EAAKO,EAAGP,EAAKQ,GAAG6O,UAAUtB,GAE9C0mB,EAAMjX,KAAKhkB,EAAE+G,EAAG/G,EAAEgH,KAEb7D,MA2CPsR,GAzCF,SAAYA,GACV,OAAOtR,KAAK63B,MAAMvmB,EAAI,IAyCtBC,GAvCF,SAAYA,GACV,OAAOvR,KAAK63B,MAAM,EAAGtmB,IAuCrBpO,OArCF,SAAgBA,EAAQC,EAAMpD,KAAKqD,QACjC,OAAc,MAAVF,EAAuBC,EAAID,OACxBnD,KAAK+T,KAAK3Q,EAAIF,MAAOC,EAAQC,IAoCpCyd,KAlCF,SAAcjd,EAAI,EAAGC,EAAI,EAAGT,EAAMpD,KAAKqD,QACrC,MAAMiO,EAAK1N,EAAIR,EAAIQ,EACb2N,EAAK1N,EAAIT,EAAIS,EACnB,OAAO7D,KAAK63B,MAAMvmB,EAAIC,IAgCtBwC,KA9BF,SAAc7Q,EAAOC,EAAQC,EAAMpD,KAAKqD,QACtC,MAAMxG,EAAIoG,EAAiBjD,KAAMkD,EAAOC,EAAQC,GAC1CwM,EAAS/S,EAAEqG,MAAQE,EAAIF,MACvB4M,EAASjT,EAAEsG,OAASC,EAAID,OAK9B,OAJAnD,KAAKwG,WAAWqD,QAAQ,CAACiuB,EAAO/8B,KAC9B,MAAMS,EAAI,IAAIiT,GAAMrL,GAAKsP,UAAU,IAAI5D,GAAOgpB,GAAO7Z,WACrD6Z,EAAMjoB,MAAMD,EAAQE,EAAQtU,EAAEoI,EAAGpI,EAAEqI,KAE9B7D,MAuBPkD,MArBF,SAAeA,EAAOE,EAAMpD,KAAKqD,QAC/B,OAAa,MAATH,EAAsBE,EAAIF,MACvBlD,KAAK+T,KAAK7Q,EAAOE,EAAID,OAAQC,IAoBpCQ,EAlBF,SAAWA,EAAGR,EAAMpD,KAAKqD,QACvB,OAAS,MAALO,EAAkBR,EAAIQ,EACnB5D,KAAK6gB,KAAKjd,EAAGR,EAAIS,EAAGT,IAiB3BS,EAfF,SAAWA,EAAGT,EAAMpD,KAAKqD,QACvB,OAAS,MAALQ,EAAkBT,EAAIS,EACnB7D,KAAK6gB,KAAKzd,EAAIQ,EAAGC,EAAGT,KAgB7B,MAAM20B,WAAUjY,GACd,YAAY/gB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,IAAKtG,GAAO6X,IAIhC5Q,EAAO+xB,GAAGH,IACVl2B,EAAgB,CACdoe,UAAW,CAETkY,MAAO9xB,GAAkB,WACvB,OAAOlG,KAAKia,IAAI,IAAI8d,UAI1BnyB,EAASmyB,GAAG,KAEZ,MAAMlS,WAAU/F,GACd,YAAY/gB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,IAAKtG,GAAO6X,GAI9B,OAAOqN,GACL,OAAOjkB,KAAKqG,KAAK,SAAU4d,GAI7B,GAAG7C,GACD,OAAOphB,KAAKqG,KAAK,OAAQ+a,EAAKhd,IAIlC4B,EAAO6f,GAAG+R,IACVl2B,EAAgB,CACdoe,UAAW,CAETmY,KAAM/xB,GAAkB,SAAUkb,GAChC,OAAOphB,KAAKia,IAAI,IAAI4L,IAAK7kB,GAAGogB,OAGhC7O,QAAS,CACP,SACE,MAAM0lB,EAAOj4B,KAAKk4B,SAClB,IAAKD,EAAM,OAAOj4B,KAClB,MAAMuG,EAAS0xB,EAAK1xB,SAEpB,IAAKA,EACH,OAAOvG,KAAK8G,SAGd,MAAMJ,EAAQH,EAAOG,MAAMuxB,GAG3B,OAFA1xB,EAAOM,IAAI7G,KAAM0G,GACjBuxB,EAAKnxB,SACE9G,MAGT,OAAOohB,GAEL,IAAI6W,EAAOj4B,KAAKk4B,SAahB,OAXKD,IACHA,EAAO,IAAIpS,GACX7lB,KAAKm4B,KAAKF,IAGO,mBAAR7W,EACTA,EAAIlmB,KAAK+8B,EAAMA,GAEfA,EAAKj3B,GAAGogB,GAGHphB,MAGT,SACE,MAAMi4B,EAAOj4B,KAAKuG,SAElB,OAAI0xB,GAA6C,MAArCA,EAAKl5B,KAAK0G,SAAS/C,cACtBu1B,EAGF,SAKbryB,EAASigB,GAAG,KAEZ,MAAMuS,WAAatY,GAEjB,YAAY/gB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,OAAQtG,GAAO6X,GAIjC,SAME,OAJA5W,KAAKs3B,UAAUztB,SAAQ,SAAUD,GAC/BA,EAAGyuB,YAGEjiB,MAAMtP,SAGf,UACE,OAAOyP,GAAS,eAAiBvW,KAAKua,KAAO,OAIjD7Y,EAAgB,CACdoe,UAAW,CACTwY,KAAMpyB,GAAkB,WACtB,OAAOlG,KAAKsd,OAAOrD,IAAI,IAAIme,QAG/B7lB,QAAS,CAEP,SACE,OAAOvS,KAAKyH,UAAU,SAGxB,SAAS7I,GAEP,MAAM25B,EAAS35B,aAAmBw5B,GAAOx5B,EAAUoB,KAAKuG,SAAS+xB,OAAOzxB,IAAIjI,GAE5E,OAAOoB,KAAKqG,KAAK,OAAQ,SAAWkyB,EAAOhe,KAAO,OAIpD,SACE,OAAOva,KAAKqG,KAAK,OAAQ,UAK/BT,EAASwyB,GAAM,QAEf,MAAMI,WAAajmB,GACjB,YAAYxT,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,OAAQtG,GAAO6X,GAIjC,OAAOpb,GAaL,OAZiB,iBAANA,GAAkBA,aAAa8d,MACxC9d,EAAI,CACF2d,OAAQ/Y,UAAU,GAClB8K,MAAO9K,UAAU,GACjB8Y,QAAS9Y,UAAU,KAKN,MAAb5E,EAAE0d,SAAiBlZ,KAAKqG,KAAK,eAAgB7K,EAAE0d,SACpC,MAAX1d,EAAE0P,OAAelL,KAAKqG,KAAK,aAAc7K,EAAE0P,OAC/B,MAAZ1P,EAAE2d,QAAgBnZ,KAAKqG,KAAK,SAAU,IAAIiT,GAAU9d,EAAE2d,SACnDnZ,MAIX0B,EAAgB,CACdyf,SAAU,CAERsX,KAAM,SAAUtf,EAAQjO,EAAOgO,GAC7B,OAAOlZ,KAAKia,IAAI,IAAIue,IAAQjX,OAAOpI,EAAQjO,EAAOgO,OAIxDtT,EAAS4yB,GAAM,QAef,MAAME,WAAcnmB,GAClB,YAAYxT,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,QAAStG,GAAO6X,GAGlC,QAAQjC,EAAI,IAEV,OADA3U,KAAKjB,KAAK4c,aAAehH,EAClB3U,KAGT,KAAK1E,EAAMwmB,EAAK9V,EAAS,IACvB,OAAOhM,KAAK24B,KAAK,aAAc,CAC7BC,WAAYt9B,EACZwmB,IAAKA,KACF9V,IAIP,KAAK4O,EAAUjE,GACb,OAAO3W,KAAK64B,QAhChB,SAAiBje,EAAU+d,GACzB,IAAK/d,EAAU,MAAO,GACtB,IAAK+d,EAAM,OAAO/d,EAClB,IAAIlR,EAAMkR,EAAW,IAErB,IAAK,MAAM7f,KAAK49B,EACdjvB,GAAO5G,EAAY/H,GAAK,IAAM49B,EAAK59B,GAAK,IAI1C,OADA2O,GAAO,IACAA,EAsBeovB,CAAQle,EAAUjE,KAI1CjV,EAAgB,MAAO,CACrB,MAAMkZ,EAAUjE,GACd,OAAO3W,KAAKia,IAAI,IAAIye,IAASC,KAAK/d,EAAUjE,IAG9C,SAASrb,EAAMwmB,EAAK9V,GAClB,OAAOhM,KAAKia,IAAI,IAAIye,IAASxZ,KAAK5jB,EAAMwmB,EAAK9V,MAIjDpG,EAAS8yB,GAAO,SAEhB,MAAMK,WAAiBzC,GAErB,YAAYv3B,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,WAAYtG,GAAO6X,GAIrC,QACE,MAAMoiB,EAAQh5B,KAAKg5B,QACnB,OAAOA,EAAQA,EAAM56B,QAAU,KAIjC,KAAK/C,GACH,MAAM29B,EAAQh5B,KAAKg5B,QACnB,IAAIC,EAAY,KAMhB,OAJID,IACFC,EAAYD,EAAMnW,KAAKxnB,IAGb,MAALA,EAAY49B,EAAYj5B,KAIjC,QACE,OAAOA,KAAKyH,UAAU,SAI1B/F,EAAgB,CACdoe,UAAW,CACToZ,SAAUhzB,GAAkB,SAAUwV,EAAM1H,GAM1C,OAJM0H,aAAgB4a,KACpB5a,EAAO1b,KAAK0b,KAAKA,IAGZA,EAAK1H,KAAKA,OAGrBsiB,KAAM,CAEJtiB,KAAM9N,GAAkB,SAAU8yB,EAAOG,GAAc,GACrD,MAAMD,EAAW,IAAIH,GAUrB,IAAIh6B,EAEJ,GAVMi6B,aAAiB3P,KAErB2P,EAAQh5B,KAAKsd,OAAOtJ,KAAKglB,IAI3BE,EAAS7yB,KAAK,OAAQ,IAAM2yB,EAAO50B,GAI/B+0B,EACF,KAAOp6B,EAAOiB,KAAKjB,KAAKoG,YACtB+zB,EAASn6B,KAAKgb,YAAYhb,GAK9B,OAAOiB,KAAKia,IAAIif,MAIlB,WACE,OAAOl5B,KAAKkd,QAAQ,cAIxBmM,KAAM,CAEJ3N,KAAMxV,GAAkB,SAAUwV,GAOhC,OALMA,aAAgB4a,KACpB5a,GAAO,IAAI4a,IAAOliB,MAAMpU,KAAKuG,UAAUmV,KAAKA,IAIvCA,EAAK1H,KAAKhU,SAGnB,UACE,OAAOuW,GAAS,gBAAgBlU,OAAOtD,IAC7BA,EAAKsH,KAAK,SAAW,IAAIrC,SAAShE,KAAKua,WAOvDwe,GAASp8B,UAAU8lB,WAAagF,GAChC7hB,EAASmzB,GAAU,YAEnB,MAAMK,WAAYlZ,GAChB,YAAYnhB,EAAM6X,EAAQ7X,GACxBqX,MAAM/Q,EAAU,MAAOtG,GAAO6X,GAIhC,IAAIhY,EAASy6B,GAEX,OAAOr5B,KAAKqG,KAAK,QAASgzB,GAAQ,IAAM,IAAMz6B,EAASwF,IAI3D1C,EAAgB,CACdoe,UAAW,CAETwZ,IAAKpzB,GAAkB,SAAUtH,EAASy6B,GACxC,OAAOr5B,KAAKia,IAAI,IAAImf,IAAOE,IAAI16B,EAASy6B,SAI9CzzB,EAASwzB,GAAK,OAGd,MAAMG,GAAM30B,EACZoB,EAAO,CAACyvB,GAAK,GAAQ9T,GAAOH,GAASsB,IAAS/gB,EAAc,YAC5DiE,EAAO,CAAC0c,GAAMgH,GAAUF,GAASH,IAAOtnB,EAAc,WACtDiE,EAAOswB,GAAMv0B,EAAc,SAC3BiE,EAAOqjB,GAAMtnB,EAAc,SAC3BiE,EAAOia,GAAMle,EAAc,SAC3BiE,EAAO,CAACswB,GAAMW,IAAQl1B,EAAc,UACpCiE,EAAO,CAAC4jB,GAAMjJ,GAASQ,GAAUwN,IAAS5sB,EAAc,WACxDiE,EAAOiS,GAAalW,EAAc,gBAClCiE,EAAO4T,GAAK7X,EAAc,QAC1BiE,EAAOuM,GAASxQ,EAAc,YAC9BiE,EAAOka,GAAOne,EAAc,UAC5BiE,EAAO,CAAC8Z,GAAWpa,IAAW3D,EAAc,cAC5CiE,EAAOmb,GAAUpf,EAAc,aAC/BiE,EAAO2oB,GAAQ5sB,EAAc,WAC7BmU,GAAKlQ,OAt0NI,IAAI,IAAIqT,IAAI5X,KAk3IrB,SAA+B+W,EAAO,IACpCuP,GAAelnB,QAAQ,GAAGO,OAAOoX,IAo9EnCghB,CAAsB,CAAClgB,GAAWvO,GAAOuJ,GAAKxF,GAAQsK,GAAU6I,GAAYwF,KAj9E1EzhB,EAAO+hB,GAAgB,CACrB,GAAGte,GACD,OAAO,IAAIwe,IAAYzP,KAAKxY,KAAKC,aAAagB,KAAKjB,KAAK0Z,WAAW1Y,GAAGyI,IAGxE,UAAU0M,GAER,OADAnW,KAAKiL,KAAKkL,GACHnW,Q,YCj4Ib,EAAU,GAAY,CACpBy5B,YAAa,SAA4BrY,GACvC,OAAO7c,OAAOm1B,KAAKtY,IAErBuY,kBAAmB,SAA4BpM,GAC7C,OACEvtB,KAAKiwB,QAAQ1C,GAEVzU,KAAK,KAEL7I,OAAO,KACP6f,QAGP8J,OAAQ,SAA4BxiB,GAC9BA,EACFpX,KAAKgK,OAELhK,KAAKiK,QAGT4vB,UAAW,SAA4BtM,EAAenW,EAAa0iB,GAC7D1iB,EAEsC,IAApCpX,KAAK4Y,WAAWsT,SAAS7rB,OAC3By5B,EAAU95B,KAAKiwB,QAAQ1C,IAEvBvtB,KAAK4Y,WAAWmZ,OAGlB/xB,KAAK4Y,WAAW6f,QAGpBsB,cAAe,WACb/5B,KAAK4Y,WAAW6f,QAElBuB,cAAe,WACb,OAAOh6B,KAAKjB,KAAKkV,YAEnBgmB,WAAY,WAEV,IADA,IAAIC,EAAuBl6B,KAAKjB,OACnB,CACX,IAAIm7B,EAAYjmB,YAAeimB,EAAYv0B,UAAU3B,SAAS,cAG5D,OAAOk2B,EAFPA,EAAcA,EAAYjmB,eAOlC,EAAU,GAAQ,CAChBkmB,oBAAqB,SAAwBC,GAG3C,IAFA,IAAIC,EAA8Cr6B,KAAKjB,KACnDhE,EAAI,EAC4B,eAA7Bs/B,EAAeC,WAA4B,CAChD,KAAID,EAAeje,mBAAqBrhB,EAAI,IAI1C,OAHAs/B,EAAiBA,EAAeje,kBAChCrhB,IAKJs/B,EAAen1B,UAAYk1B,KAK/B,I,SAAA,eACE,WAAY38B,GAAZ,MACE,YAAMA,IAAM,K,OAqLN,EAAA88B,wBAA0B,WAChC,MAAO,CACLv1B,QAAS,eAAG,iGAGZf,IAAK,eAAG,uKAKRu2B,QAAS,eAAG,+NA9Ld,EAAKC,MAAQ,CACXC,WAAW,EACXC,QAAS,KACTC,UAAW,KACXC,YAAa,GACbC,eAAgB,KAChBC,mBAAoB,GACpBC,aAAc,KACdC,oBAAqB,GACrBC,cAAe,KACfC,aAAa,EACbC,QAAS,I,EA2Lf,OAzMiC,OAkB/B,YAAAC,mBAAA,SAAmBV,GACjB,IAAME,EAAc76B,KAAKvC,MAAM8Z,QAAQsjB,YACnCS,EAAe,KAAwBt7B,KAAKy6B,MAAMK,gBACtDQ,EAAkB,GAClB,IAAK,IAAIvgC,EAAI,EAAGA,EAAI8/B,EAAYx6B,OAAQtF,IACJ,KAA9B8/B,EAAY9/B,GAAGwgC,aACjBD,EAAgBt7B,KAAKvC,MAAM8Z,QAAQsjB,YAAY9/B,GAAGwgC,YAAcZ,EAAQzd,QACtE,IAAIld,KAAKvC,MAAM8Z,QAAQsjB,YAAY9/B,GAAGygC,QAI5Cx7B,KAAKy7B,SAAS,CAAEX,eAAgBQ,KAGlC,YAAAI,UAAA,SAAUf,GAcR,IAbA,IAAIE,EAAW,OAAuB76B,KAAKvC,MAAM8Z,QAAQsjB,cACrDc,EAA2B,CAC7BC,WAAY,SAAC78B,GACX,OAAIA,EAAKwb,IACS,KAAZxb,EAAKwb,GACAshB,WAAWC,cAGfD,WAAWE,gBAGlBC,EAAYx3B,SAASy3B,iBAAiBtB,EAAQ57B,KAAM88B,WAAWK,SAAUP,GACzEzB,EAA8B8B,EAAU9B,YACrCA,GACDA,GAAeA,EAAY3f,IAC4E,IAArGsgB,EAAYx4B,QAAO,SAAC85B,GAAY,QAACjC,GAAciC,EAAQX,QAAUtB,EAAY3f,MAAala,QAC5Fw6B,EAAYh6B,KAAK,CAAE26B,MAAOtB,EAAY3f,GAAIghB,WAAY,KAG1DrB,EAAc8B,EAAUI,WAE1Bp8B,KAAKy7B,SAAS,CAAEZ,YAAa,EAAF,KAAMA,IAAcM,aAAa,IAC5Dn7B,KAAKvC,MAAM8Z,QAAQsjB,YAAW,OAAOA,IACrC76B,KAAKvC,MAAM4+B,gBAAgBr8B,KAAKvC,MAAM8Z,SACtCvX,KAAKs8B,eAGP,YAAAC,oBAAA,SAAoB7kB,GAClB,GAAIA,EAAMuM,OAAQ,CAChB,IAAIuY,EAAU9kB,EAAMuM,OAChBwY,EAAY,EACZ5B,EAAW,OAAuB76B,KAAKvC,MAAM8Z,QAAQsjB,cACzD,GAAI2B,EAAQjiB,GAAI,CACd,KAAsB,KAAfiiB,EAAQjiB,IAAW,CAExB,KADAkiB,EACgB,GACd,OAEFD,EAAUA,EAAQvoB,WAEpB,IAAK,IAAIlZ,EAAI,EAAGA,EAAI8/B,EAAYx6B,OAAQtF,IACtC,GAAI8/B,EAAY9/B,GAAGygC,QAAUgB,EAAQjiB,GACnC,OAGJsgB,EAAYh6B,KAAK,CAAE26B,MAAOgB,EAAQjiB,GAAIghB,WAAY,KAClDv7B,KAAKy7B,SAAS,CAAEZ,YAAa,EAAF,KAAMA,IAAcM,aAAa,IAC5Dn7B,KAAKvC,MAAM8Z,QAAQsjB,YAAW,OAAOA,IACrC76B,KAAKvC,MAAM4+B,gBAAgBr8B,KAAKvC,MAAM8Z,SACtCvX,KAAKs8B,iBAKX,YAAAI,UAAA,SAAU99B,GACR,GAAIA,EAAS,CAWX,GATEoB,KAAKvC,MAAM8Z,QAAQolB,aAAe38B,KAAKy6B,MAAMM,oBAC7C/6B,KAAKy6B,MAAMC,YAAc16B,KAAKvC,MAAM8Z,QAAQmjB,WAE5C16B,KAAKy7B,SAAS,CACZV,mBAAoB/6B,KAAKvC,MAAM8Z,QAAQolB,WACvCjC,UAAW16B,KAAKvC,MAAM8Z,QAAQmjB,UAC9BS,aAAa,KAGZn7B,KAAKy6B,MAAMU,YAAa,CAE3B,IAAIR,EAAUpB,GAAI36B,GAClB+7B,EAAQtZ,QACRsZ,EAAQ12B,IAAIjE,KAAKvC,MAAM8Z,QAAQqjB,WAC/BD,EAAQ5mB,KAAK/T,KAAKvC,MAAMyF,MAAOlD,KAAKvC,MAAM0F,QACtCnD,KAAKvC,MAAM8Z,QAAQmjB,WACrB16B,KAAK07B,UAAUf,GAEjB36B,KAAKq7B,mBAAmBV,GACxB36B,KAAKy7B,SAAS,CAAEd,QAASA,IAEzB,IACE,IAAMK,EAAe4B,SACnB,OACA,UACA,UACA,SACA,UACA58B,KAAKvC,MAAMo/B,iBAAiB78B,KAAKvC,MAAM8Z,QAAQolB,aAEjD38B,KAAKy7B,SAAS,CAAET,aAAY,IACxBh7B,KAAKy6B,MAAMK,gBAAkBE,IAC/BA,EAAah7B,KAAKvC,MAAM0M,KAAMnK,KAAKvC,MAAM8Z,QAASvX,KAAKy6B,MAAME,QAAS36B,KAAKy6B,MAAMK,gBACjF96B,KAAKy7B,SAAS,CAAEN,aAAa,KAE/B,MAAO16B,GACPT,KAAKy7B,SAAS,CAAEN,aAAa,KAKjC,IACE,IAAID,EAAgBl7B,KAAKy6B,MAAMS,cAC/B,GAAIl7B,KAAKvC,MAAM8Z,QAAQulB,cAAgB98B,KAAKy6B,MAAMQ,oBAAqB,CACrE,IAAIA,EAAsBj7B,KAAKvC,MAAM8Z,QAAQulB,YAC7C5B,EAAgB0B,SACd,OACA,UACA,UACA,SACA,UACA58B,KAAKvC,MAAMo/B,iBAAiB5B,IAE9Bj7B,KAAKy7B,SAAS,CAAER,oBAAqBA,EAAqBC,cAAeA,EAAeC,aAAa,IAEnGn7B,KAAKy6B,MAAMK,gBAAkBI,GAC/BA,EACEl7B,KAAKvC,MAAM0M,KACXnK,KAAKvC,MAAM8Z,QACXvX,KAAKy6B,MAAME,QACX36B,KAAKy6B,MAAMK,eACX96B,KAAKo7B,SAGT,MAAO36B,IAIT,OAAOT,KAAKy6B,MAAME,QAAU36B,KAAKy6B,MAAME,QAAQ12B,MAAQ,KAEvD,OAAO,MAIX,YAAA84B,OAAA,sBACQC,EAASh9B,KAAKu6B,0BACpB,OACE,yBACE50B,UAAWq3B,EAAOh4B,QAClBi4B,QAASj9B,KAAKvC,MAAM8Z,QAAQ2lB,gBAAkBl9B,KAAKu8B,oBAAoBhgC,KAAKyD,WAAQw0B,GAEpF,yBACEhrB,MAAO,CACLtG,MAAUlD,KAAKvC,MAAMyF,MAAK,KAC1BC,OAAWnD,KAAKvC,MAAM0F,OAAM,MAE9BwC,UAAW,aACXud,IAAK,SAAC,GAAQ,SAAKwZ,UAAL,QAwBxB,EAzMA,CAAiC,iBCnGjC,SAASS,GAAgBxmB,EAAKra,EAAKN,GAYjC,OAXIM,KAAOqa,EACTlb,OAAOC,eAAeib,EAAKra,EAAK,CAC9BN,MAAOA,EACPL,YAAY,EACZyhC,cAAc,EACdC,UAAU,IAGZ1mB,EAAIra,GAAON,EAGN2a,EAGT,SAAS2mB,GAAQ7gC,EAAQ8gC,GACvB,IAAI7f,EAAOjiB,OAAOiiB,KAAKjhB,GAEvB,GAAIhB,OAAO+hC,sBAAuB,CAChC,IAAIC,EAAUhiC,OAAO+hC,sBAAsB/gC,GACvC8gC,IAAgBE,EAAUA,EAAQp7B,QAAO,SAAUq7B,GACrD,OAAOjiC,OAAOkiC,yBAAyBlhC,EAAQihC,GAAK/hC,eAEtD+hB,EAAK7c,KAAKP,MAAMod,EAAM+f,GAGxB,OAAO/f,EAGT,SAASkgB,GAAe3Z,GACtB,IAAK,IAAIlpB,EAAI,EAAGA,EAAIqF,UAAUC,OAAQtF,IAAK,CACzC,IAAI4T,EAAyB,MAAhBvO,UAAUrF,GAAaqF,UAAUrF,GAAK,GAE/CA,EAAI,EACNuiC,GAAQ7hC,OAAOkT,IAAS,GAAM9E,SAAQ,SAAUvN,GAC9C6gC,GAAgBlZ,EAAQ3nB,EAAKqS,EAAOrS,OAE7Bb,OAAOoiC,0BAChBpiC,OAAOqiC,iBAAiB7Z,EAAQxoB,OAAOoiC,0BAA0BlvB,IAEjE2uB,GAAQ7hC,OAAOkT,IAAS9E,SAAQ,SAAUvN,GACxCb,OAAOC,eAAeuoB,EAAQ3nB,EAAKb,OAAOkiC,yBAAyBhvB,EAAQrS,OAKjF,OAAO2nB,EA+CT,SAAS8Z,GAAkB5nB,EAAKgG,IACnB,MAAPA,GAAeA,EAAMhG,EAAI9V,UAAQ8b,EAAMhG,EAAI9V,QAE/C,IAAK,IAAItF,EAAI,EAAGijC,EAAO,IAAIr+B,MAAMwc,GAAMphB,EAAIohB,EAAKphB,IAAKijC,EAAKjjC,GAAKob,EAAIpb,GAEnE,OAAOijC,EClGT,SAAS,GAAgBrnB,EAAKra,EAAKN,GAYjC,OAXIM,KAAOqa,EACTlb,OAAOC,eAAeib,EAAKra,EAAK,CAC9BN,MAAOA,EACPL,YAAY,EACZyhC,cAAc,EACdC,UAAU,IAGZ1mB,EAAIra,GAAON,EAGN2a,EAGT,SAAS,GAAQla,EAAQ8gC,GACvB,IAAI7f,EAAOjiB,OAAOiiB,KAAKjhB,GAEvB,GAAIhB,OAAO+hC,sBAAuB,CAChC,IAAIC,EAAUhiC,OAAO+hC,sBAAsB/gC,GACvC8gC,IAAgBE,EAAUA,EAAQp7B,QAAO,SAAUq7B,GACrD,OAAOjiC,OAAOkiC,yBAAyBlhC,EAAQihC,GAAK/hC,eAEtD+hB,EAAK7c,KAAKP,MAAMod,EAAM+f,GAGxB,OAAO/f,EAGT,SAAS,GAAeuG,GACtB,IAAK,IAAIlpB,EAAI,EAAGA,EAAIqF,UAAUC,OAAQtF,IAAK,CACzC,IAAI4T,EAAyB,MAAhBvO,UAAUrF,GAAaqF,UAAUrF,GAAK,GAE/CA,EAAI,EACN,GAAQU,OAAOkT,IAAS,GAAM9E,SAAQ,SAAUvN,GAC9C,GAAgB2nB,EAAQ3nB,EAAKqS,EAAOrS,OAE7Bb,OAAOoiC,0BAChBpiC,OAAOqiC,iBAAiB7Z,EAAQxoB,OAAOoiC,0BAA0BlvB,IAEjE,GAAQlT,OAAOkT,IAAS9E,SAAQ,SAAUvN,GACxCb,OAAOC,eAAeuoB,EAAQ3nB,EAAKb,OAAOkiC,yBAAyBhvB,EAAQrS,OAKjF,OAAO2nB,EAGT,SAASga,KACP,IAAK,IAAIC,EAAO99B,UAAUC,OAAQ89B,EAAM,IAAIx+B,MAAMu+B,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC9ED,EAAIC,GAAQh+B,UAAUg+B,GAGxB,OAAO,SAAUx6B,GACf,OAAOu6B,EAAIE,aAAY,SAAUx6B,EAAGmL,GAClC,OAAOA,EAAEnL,KACRD,IAIP,SAAS06B,GAAMn4B,GACb,OAAO,SAASo4B,IAGd,IAFA,IAAIxiB,EAAQ/b,KAEHw+B,EAAQp+B,UAAUC,OAAQ+F,EAAO,IAAIzG,MAAM6+B,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACpFr4B,EAAKq4B,GAASr+B,UAAUq+B,GAG1B,OAAOr4B,EAAK/F,QAAU8F,EAAG9F,OAAS8F,EAAG7F,MAAMN,KAAMoG,GAAQ,WACvD,IAAK,IAAIs4B,EAAQt+B,UAAUC,OAAQs+B,EAAW,IAAIh/B,MAAM++B,GAAQE,EAAQ,EAAGA,EAAQF,EAAOE,IACxFD,EAASC,GAASx+B,UAAUw+B,GAG9B,OAAOL,EAAQj+B,MAAMyb,EAAO,GAAG3a,OAAOgF,EAAMu4B,MAKlD,SAASE,GAAS7iC,GAChB,MAAO,GAAGyM,SAASvN,KAAKc,GAAOgI,SAAS,UAO1C,SAAS86B,GAAW9iC,GAClB,MAAwB,mBAAVA,EAoChB,IAWI+iC,GAAeT,IAfnB,SAAoBU,EAAexmB,GACjC,MAAM,IAAIxa,MAAMghC,EAAcxmB,IAASwmB,EAAuB,WAc7CV,CAXC,CAClBW,kBAAmB,4BACnBC,YAAa,oCACbC,eAAgB,6CAChBC,YAAa,4CACbC,aAAc,qCACdC,aAAc,gCACdC,WAAY,gDACZC,YAAa,iGACb,QAAW,sDAGTC,GAAa,CACfC,QA1CF,SAAyBC,EAASD,GAKhC,OAJKb,GAASa,IAAUX,GAAa,cACjCtjC,OAAOiiB,KAAKgiB,GAASE,MAAK,SAAUC,GACtC,OAPoBpjC,EAOGkjC,EAPKjjC,EAOImjC,GAN3BpkC,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,GADtD,IAAwBD,EAAQC,MAQ1BqiC,GAAa,eACVW,GAsCP9kB,SAnCF,SAA0BA,GACnBkkB,GAAWlkB,IAAWmkB,GAAa,iBAmCxCe,QAhCF,SAAyBA,GACjBhB,GAAWgB,IAAYjB,GAASiB,IAAWf,GAAa,eAC1DF,GAASiB,IAAYrkC,OAAOsQ,OAAO+zB,GAASF,MAAK,SAAUG,GAC7D,OAAQjB,GAAWiB,OACjBhB,GAAa,iBA6BjBY,QA1BF,SAAyBA,GA/BzB,IAAiBhpB,EAgCVgpB,GAASZ,GAAa,qBACtBF,GAASc,IAAUZ,GAAa,eAjCtBpoB,EAkCHgpB,EAjCJlkC,OAAOiiB,KAAK/G,GAAKtW,QAiCH0+B,GAAa,oBAqDrC,SAASiB,GAAevF,EAAOwF,GAC7B,OAAOnB,GAAWmB,GAAiBA,EAAcxF,EAAM3e,SAAWmkB,EAGpE,SAASC,GAAYzF,EAAOiF,GAE1B,OADAjF,EAAM3e,QAAU,GAAe,GAAe,GAAI2e,EAAM3e,SAAU4jB,GAC3DA,EAGT,SAASS,GAAe1F,EAAOqF,EAASJ,GAMtC,OALAZ,GAAWgB,GAAWA,EAAQrF,EAAM3e,SAAWrgB,OAAOiiB,KAAKgiB,GAAS71B,SAAQ,SAAUg2B,GACpF,IAAIO,EAEJ,OAA6C,QAArCA,EAAiBN,EAAQD,UAAuC,IAAnBO,OAA4B,EAASA,EAAellC,KAAK4kC,EAASrF,EAAM3e,QAAQ+jB,OAEhIH,EAGT,IAIe,GAJH,CACVrjC,OA9CF,SAAgBsjC,GACd,IAAIG,EAAU1/B,UAAUC,OAAS,QAAsBm0B,IAAjBp0B,UAAU,GAAmBA,UAAU,GAAK,GAClFq/B,GAAWE,QAAQA,GACnBF,GAAWK,QAAQA,GACnB,IAAIrF,EAAQ,CACV3e,QAAS6jB,GAEPU,EAAY/B,GAAM6B,GAAN7B,CAAsB7D,EAAOqF,GACzCve,EAAS+c,GAAM4B,GAAN5B,CAAmB7D,GAC5B6F,EAAWhC,GAAMmB,GAAWC,QAAjBpB,CAA0BqB,GACrCY,EAAajC,GAAM0B,GAAN1B,CAAsB7D,GAEvC,SAAS+F,IACP,IAAI5lB,EAAWxa,UAAUC,OAAS,QAAsBm0B,IAAjBp0B,UAAU,GAAmBA,UAAU,GAAK,SAAUq6B,GAC3F,OAAOA,GAGT,OADAgF,GAAW7kB,SAASA,GACbA,EAAS6f,EAAM3e,SAGxB,SAAS2f,EAASwE,GAChBhC,GAAQoC,EAAW9e,EAAQ+e,EAAUC,EAArCtC,CAAiDgC,GAGnD,MAAO,CAACO,EAAU/E,KCjKL,GANF,CACXgF,MAAO,CACLC,GAAI,6DCEO,OAJf,SAAkB1kC,GAChB,MAAO,GAAGyM,SAASvN,KAAKc,GAAOgI,SAAS,WCoC1C,IAMI,GC3CJ,SAAemC,GACb,OAAO,SAASo4B,IAGd,IAFA,IAAIxiB,EAAQ/b,KAEHk+B,EAAO99B,UAAUC,OAAQ+F,EAAO,IAAIzG,MAAMu+B,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC/Eh4B,EAAKg4B,GAAQh+B,UAAUg+B,GAGzB,OAAOh4B,EAAK/F,QAAU8F,EAAG9F,OAAS8F,EAAG7F,MAAMN,KAAMoG,GAAQ,WACvD,IAAK,IAAIo4B,EAAQp+B,UAAUC,OAAQs+B,EAAW,IAAIh/B,MAAM6+B,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACxFE,EAASF,GAASr+B,UAAUq+B,GAG9B,OAAOF,EAAQj+B,MAAMyb,EAAO,GAAG3a,OAAOgF,EAAMu4B,MD8B/B,EAVnB,SAAoBK,EAAexmB,GACjC,MAAM,IAAIxa,MAAMghC,EAAcxmB,IAASwmB,EAAuB,WAS7C,CANC,CAClB2B,iBAAkB,uCAClBC,WAAY,+CACZ,QAAW,8DACXC,YAAa,kTAOA,GAJE,CACfC,OApCF,SAAwBA,GAItB,OAHKA,GAAQ,GAAa,oBACrB,GAASA,IAAS,GAAa,cAEhCA,EAAOC,KAEF,CACLN,MAAO,CACLC,GAAII,EAAOC,KAAKC,aAKfF,IEVM,GAZD,WACZ,IAAK,IAAI5C,EAAO99B,UAAUC,OAAQ89B,EAAM,IAAIx+B,MAAMu+B,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC9ED,EAAIC,GAAQh+B,UAAUg+B,GAGxB,OAAO,SAAUx6B,GACf,OAAOu6B,EAAIE,aAAY,SAAUx6B,EAAGmL,GAClC,OAAOA,EAAEnL,KACRD,KCKQ,OAXf,SAAS6uB,EAAMxO,EAAQtV,GAQrB,OAPAlT,OAAOiiB,KAAK/O,GAAQ9E,SAAQ,SAAUvN,GAChCqS,EAAOrS,aAAgBb,QACrBwoB,EAAO3nB,IACTb,OAAO0E,OAAOwO,EAAOrS,GAAMm2B,EAAMxO,EAAO3nB,GAAMqS,EAAOrS,QAIpDshC,GAAeA,GAAe,GAAI3Z,GAAStV,ICThDsyB,GAAsB,CACxBzoB,KAAM,cACN0oB,IAAK,kCAgBQ,IR8BS/qB,GAAKpb,GQ9Bd,GAbf,SAAwBomC,GACtB,IAAIC,GAAe,EACfC,EAAiB,IAAIC,SAAQ,SAAUC,EAASC,GAClDL,EAAQM,MAAK,SAAUh4B,GACrB,OAAO23B,EAAeI,EAAOP,IAAuBM,EAAQ93B,MAE9D03B,EAAe,MAAEK,MAEnB,OAAOH,EAAeK,OAAS,WAC7B,OAAON,GAAe,GACrBC,GCNDM,GAAgB,GAAMtlC,OAAO,CAC/BykC,OAAQ,GACRc,eAAe,EACfL,QAAS,KACTC,OAAQ,KACRK,OAAQ,OAENC,ITgCyB/mC,GShCsB,EToCnD,SAAyBob,GACvB,GAAIxW,MAAMgC,QAAQwU,GAAM,OAAOA,EAJxB4rB,CADe5rB,GShCYwrB,KTwCpC,SAA+BxrB,EAAKpb,GAClC,GAAsB,oBAAXe,QAA4BA,OAAO0E,YAAY/E,OAAO0a,GAAjE,CACA,IAAI6rB,EAAO,GACPC,GAAK,EACLn2B,GAAK,EACLo2B,OAAK1N,EAET,IACE,IAAK,IAAiC2N,EAA7BC,EAAKjsB,EAAIra,OAAO0E,cAAmByhC,GAAME,EAAKC,EAAGzhC,QAAQC,QAChEohC,EAAKnhC,KAAKshC,EAAGnmC,QAETjB,GAAKinC,EAAK3hC,SAAWtF,GAH8CknC,GAAK,IAK9E,MAAOlkC,GACP+N,GAAK,EACLo2B,EAAKnkC,EACL,QACA,IACOkkC,GAAsB,MAAhBG,EAAW,QAAWA,EAAW,SAC5C,QACA,GAAIt2B,EAAI,MAAMo2B,GAIlB,OAAOF,GA/BwBK,CAAsBlsB,GAAKpb,KAkC5D,SAAqCS,EAAG8mC,GACtC,GAAK9mC,EAAL,CACA,GAAiB,iBAANA,EAAgB,OAAOuiC,GAAkBviC,EAAG8mC,GACvD,IAAI9lC,EAAIf,OAAOkB,UAAU8L,SAASvN,KAAKM,GAAG2F,MAAM,GAAI,GAEpD,MADU,WAAN3E,GAAkBhB,EAAEyE,cAAazD,EAAIhB,EAAEyE,YAAY3E,MAC7C,QAANkB,GAAqB,QAANA,EAAoBmD,MAAMsB,KAAKzF,GACxC,cAANgB,GAAqB,2CAA2CuN,KAAKvN,GAAWuhC,GAAkBviC,EAAG8mC,QAAzG,GAxCgEC,CAA4BpsB,GAAKpb,KAmDnG,WACE,MAAM,IAAI8E,UAAU,6IApDmF2iC,IShCrGhC,GAAWsB,GAAe,GAC1BrG,GAAWqG,GAAe,GAiD9B,SAASW,GAAcC,GACrB,OAAOl+B,SAAS0P,KAAK6F,YAAY2oB,GAmBnC,SAASC,GAAsBC,GAC7B,IAXoB9gB,EAChB4gB,EAUAjI,EAAQ+F,IAAS,SAAUqC,GAG7B,MAAO,CACL/B,OAHW+B,EAAM/B,OAIjBU,OAHWqB,EAAMrB,WAMjBsB,GAnBgBhhB,EAmBY,GAAG1gB,OAAOq5B,EAAMqG,OAAOL,MAAMC,GAAI,cAlB7DgC,EAASl+B,SAASS,cAAc,UAC7B6c,IAAQ4gB,EAAO5gB,IAAMA,GAAM4gB,GAwBlC,OALAI,EAAaC,OAAS,WACpB,OAAOH,KAGTE,EAAaE,QAAUvI,EAAM+G,OACtBsB,EAOT,SAASF,KACP,IAAInI,EAAQ+F,IAAS,SAAUyC,GAI7B,MAAO,CACLnC,OAJWmC,EAAMnC,OAKjBS,QAJY0B,EAAM1B,QAKlBC,OAJWyB,EAAMzB,WAOjB0B,EAAU3+B,OAAO2+B,QAErBA,EAAQpC,OAAOrG,EAAMqG,QAErBoC,EAAQ,CAAC,0BAA0B,SAAUrB,GAC3CsB,GAAoBtB,GACpBpH,EAAM8G,QAAQM,MACb,SAAU/gC,GACX25B,EAAM+G,OAAO1gC,MAQjB,SAASqiC,GAAoBtB,GACtBrB,KAAWqB,QACdpG,GAAS,CACPoG,OAAQA,IAkBd,IAAIuB,GAAiB,IAAI9B,SAAQ,SAAUC,EAASC,GAClD,OAAO/F,GAAS,CACd8F,QAASA,EACTC,OAAQA,OASG,GANF,CACXV,OA5IF,SAAgBA,GACdrF,IAAS,SAAUhB,GACjB,MAAO,CACLqG,OAAQ,GAAMrG,EAAMqG,OAAQ,GAAWA,OAAOA,SA0IlD71B,KAhIF,WAQE,IAPYu1B,IAAS,SAAU6C,GAE7B,MAAO,CACLzB,cAFkByB,EAAKzB,kBAMhBA,cAAe,CACxB,GAAIr9B,OAAOs9B,QAAUt9B,OAAOs9B,OAAOyB,OAEjC,OADAH,GAAoB5+B,OAAOs9B,QACpB,GAAeP,QAAQC,QAAQh9B,OAAOs9B,SAG/C,GAAQY,GAAeE,GAAvB,CAA8CC,IAC9CnH,GAAS,CACPmG,eAAe,IAInB,OAAO,GAAewB,KA6GtBG,oBAhBF,WACE,OAAO/C,IAAS,SAAUgD,GAExB,OADaA,EAAM3B,Y,mBCxJvB,MAAM4B,GAAgB,CACpBC,QAAS,OACTvgC,OAAQ,OACRD,MAAO,OACPygC,eAAgB,SAChBC,WAAY,UAWC,OARf,UAAiB,QACfC,IAEA,OAAoB,IAAM5+B,cAAc,MAAO,CAC7CuE,MAAOi6B,IACNI,ICDU,OAdA,CACb7+B,QAAS,CACP0+B,QAAS,OACTj9B,SAAU,WACVq9B,UAAW,WAEbC,UAAW,CACT7gC,MAAO,QAET+G,KAAM,CACJy5B,QAAS,SCHb,SAASM,IAAgB,MACvB9gC,EAAK,OACLC,EAAM,cACN8gC,EAAa,QACbC,EAAO,KACPb,EAAI,UACJ19B,EAAS,iBACTw+B,IAEA,OAAoB,IAAMl/B,cAAc,UAAW,CACjDuE,MAAO,IAAK,GAAOxE,QACjB9B,QACAC,UAEFwC,UAAWw+B,IACTF,GAA8B,IAAMh/B,cAAc,GAAS,CAC7D4+B,QAASK,IACM,IAAMj/B,cAAc,MAAO,CAC1Cie,IAAKmgB,EACL75B,MAAO,IAAK,GAAOu6B,cACZE,GAAiB,GAAOh6B,MAE/BtE,UAAWA,KAIfq+B,GAAgBI,UAAY,CAC1BlhC,MAAO,KAAUhE,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SAASN,WACjEiF,OAAQ,KAAUjE,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SAASN,WAClEgmC,QAAS,KAAUhlC,UAAU,CAAC,KAAUN,QAAS,KAAUJ,SAASN,WACpE+lC,cAAe,KAAU5lC,KAAKH,WAC9ByH,UAAW,KAAUnH,OACrB2lC,iBAAkB,KAAU3lC,QAGf,UCrCA,GAFoB,eAAK,ICGzB,OAJf,SAAkB6lC,GAChB,oBAAUA,EAAQ,KCML,OAPf,SAAmBA,EAAQC,EAAMC,GAAe,GAC9C,MAAMC,EAAiB,kBAAO,GAC9B,oBAAUA,EAAe1oB,UAAYyoB,EAAe,KAClDC,EAAe1oB,SAAU,GACvBuoB,EAAQC,ICNd,SAAS,MAET,SAASG,GAAiB5C,EAAQ7lC,EAAO0oC,EAAU1wB,GACjD,OAGF,SAAkB6tB,EAAQ7tB,GACxB,OAAO6tB,EAAOyB,OAAOqB,SAASC,GAAc/C,EAAQ7tB,IAJ7C2wB,CAAS9C,EAAQ7tB,IAO1B,SAAqB6tB,EAAQ7lC,EAAO0oC,EAAU1wB,GAC5C,OAAO6tB,EAAOyB,OAAOuB,YAAY7oC,EAAO0oC,EAAU1wB,GAAQ4wB,GAAc/C,EAAQ7tB,IAR/C6wB,CAAYhD,EAAQ7lC,EAAO0oC,EAAU1wB,GAWxE,SAAS4wB,GAAc/C,EAAQ7tB,GAC7B,OAAO6tB,EAAOiD,IAAIt6B,MAAMwJ,GCP1B,SAAS+wB,IAAW,SAClBC,EAAQ,SACRC,EAAQ,SACRP,EAAQ,iBACRQ,EAAgB,iBAChBC,EAAgB,kBAGhBC,EAAiB,kBACjBC,EAAiB,yBACjBC,EAAwB,yBACxBC,EAAwB,MACxBC,EAAK,QACLtB,EAAO,QACP3sB,EAAO,OAGPpU,EAAM,MACND,EAAK,UACLyC,EAAS,iBACTw+B,EAAgB,YAGhBsB,EAAW,QACXC,IAEA,MAAOzB,EAAe0B,GAAoB,oBAAS,IAC5CC,EAAkBC,GAAuB,oBAAS,GACnDC,EAAY,iBAAO,MACnBC,EAAY,iBAAO,MACnBC,EAAe,iBAAO,MACtBC,EAAa,iBAAOP,GACpBQ,EAAiB,iBAAOT,GAC9B,GAAS,KACP,MAAMptB,EAAa,GAAOpN,OAE1B,OADAoN,EAAWopB,KAAKI,IAAWkE,EAAUjqB,QAAU+lB,IAAWgE,GAAoB,IAAQM,MAAMrlC,GAAwE,iBAA9DA,aAAqC,EAASA,EAAM0X,YAA2B4tB,GAC9K,IAAMN,EAAUhqB,QA8DzB,WACE,MAAMuqB,EAASP,EAAUhqB,QAAQ6oB,WAG/B,IAAI2B,EAMAC,EAPDjB,GAGsC,QAAxCgB,EAAmBD,EAAOrB,gBAA2C,IAArBsB,GAAuCA,EAAiBE,UAGtGjB,GAGsC,QAAxCgB,EAAmBF,EAAOpB,gBAA2C,IAArBsB,GAAuCA,EAAiBC,UAG3GV,EAAUhqB,QAAQ0qB,UA7EeC,GAAkBpuB,EAAWqpB,WAEhE,GAAU,KACR,MAAMgF,EAAiBZ,EAAUhqB,QAAQ6qB,oBAErCD,EAAeE,UAAUb,EAAUjqB,QAAQwnB,OAAOuD,aAAaC,UACjEJ,EAAeK,SAAS9B,GAEpBA,IAAayB,EAAeM,aAC9BN,EAAeO,aAAa,GAAI,CAAC,CAC/BC,MAAOR,EAAe/B,WAAWwC,oBACjCzrB,KAAMupB,EACNmC,kBAAkB,KAEpBV,EAAeW,iBAGlB,CAACpC,GAAWhB,GACf,GAAU,KACR6B,EAAUhqB,QAAQ6oB,WAAWK,SAAS+B,SAAS/B,IAC9C,CAACA,GAAWf,GACf,GAAU,KACR,MAAM,SACJe,EAAQ,SACRC,GACEa,EAAUhqB,QAAQ6oB,WACtBoB,EAAUjqB,QAAQwnB,OAAOgE,iBAAiBtC,EAAUE,GAAoBR,GACxEqB,EAAUjqB,QAAQwnB,OAAOgE,iBAAiBrC,EAAUE,GAAoBT,IACvE,CAACA,EAAUQ,EAAkBC,GAAmBlB,GACnD,GAAU,KACR8B,EAAUjqB,QAAQwnB,OAAOiE,SAAS/B,IACjC,CAACA,GAAQvB,GACZ,GAAU,KACR6B,EAAUhqB,QAAQ0rB,cAAcjwB,IAC/B,CAACA,GAAU0sB,GACd,MAAMwD,EAAY,sBAAY,KAC5BvB,EAAepqB,QAAQiqB,EAAUjqB,SACjC,MAAM4rB,EAAgB3B,EAAUjqB,QAAQwnB,OAAOuB,YAAYG,EAAUE,GAAoBR,EAAUU,GAAqBW,EAAUjqB,QAAQgpB,IAAIt6B,MAAM46B,IAC9IuC,EAAgB5B,EAAUjqB,QAAQwnB,OAAOuB,YAAYI,EAAUE,GAAoBT,EAAUW,GAAqBU,EAAUjqB,QAAQgpB,IAAIt6B,MAAM66B,IACpJS,EAAUhqB,QAAQ8rB,SAAS,CACzB5C,SAAU0C,EACVzC,SAAU0C,KAEX,CAACjD,EAAUO,EAAUE,EAAkBH,EAAUE,EAAkBE,EAAmBC,IACnFwC,EAAe,sBAAY,KAC/B/B,EAAUhqB,QAAUiqB,EAAUjqB,QAAQwnB,OAAOwE,iBAAiB9B,EAAalqB,QAAS,CAClFisB,iBAAiB,KACdxwB,IAELkwB,IACA1B,EAAUjqB,QAAQwnB,OAAOiE,SAAS/B,GAClCG,GAAiB,IAChB,CAACpuB,EAASiuB,EAAOiC,IA4BpB,OA3BA,oBAAU,KACJxD,GACFgC,EAAWnqB,QAAQgqB,EAAUhqB,QAASiqB,EAAUjqB,UAEjD,CAACmoB,IACJ,oBAAU,MACP2B,IAAqB3B,GAAiB4D,KACtC,CAACjC,EAAkB3B,EAAe4D,IAoBjB,IAAM5iC,cAAc,GAAiB,CACvD/B,MAAOA,EACPC,OAAQA,EACR8gC,cAAeA,EACfC,QAASA,EACTb,KAAM2C,EACNrgC,UAAWA,EACXw+B,iBAAkBA,IAItBY,GAAWX,UAAY,CACrBY,SAAU,KAAUxmC,OACpBymC,SAAU,KAAUzmC,OACpBkmC,SAAU,KAAUlmC,OACpB0mC,iBAAkB,KAAU1mC,OAC5B2mC,iBAAkB,KAAU3mC,OAG5B4mC,kBAAmB,KAAU5mC,OAC7B6mC,kBAAmB,KAAU7mC,OAC7B8mC,yBAA0B,KAAUjnC,KACpCknC,yBAA0B,KAAUlnC,KACpCmnC,MAAO,KAAUhnC,OACjB0lC,QAAS,KAAUhlC,UAAU,CAAC,KAAUN,QAAS,KAAUJ,SAC3D+Y,QAAS,KAAU9a,OAGnByG,MAAO,KAAUhE,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SACxD2E,OAAQ,KAAUjE,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SACzDmH,UAAW,KAAUnH,OACrB2lC,iBAAkB,KAAU3lC,OAG5BinC,YAAa,KAAUnnC,KACvBonC,QAAS,KAAUpnC,MAErBymC,GAAWiD,aAAe,CACxBxC,MAAO,QACPtB,QAAS,aACT3sB,QAAS,GACT+tB,0BAA0B,EAC1BC,0BAA0B,EAG1BriC,MAAO,OACPC,OAAQ,OAGRsiC,YAAa,GACbC,QAAS,ICpKI,OARf,SAAqB1pC,GACnB,MAAMknB,EAAM,mBAIZ,OAHA,oBAAU,KACRA,EAAIpH,QAAU9f,GACb,CAACA,IACGknB,EAAIpH,SCEb,MAAMmsB,GAAa,IAAIC,IAEvB,SAASC,IAAO,aACdC,EAAY,gBACZC,EAAe,YACfC,EAAW,MACXtsC,EAAK,SACL0oC,EAAQ,KACR1wB,EAAI,MAGJwxB,EAAK,KACL5iB,EAAI,QACJshB,EAAO,QACP3sB,EAAO,iBACPgxB,EAAgB,cAChBC,EAAa,iBACbC,EAAgB,MAGhBvlC,EAAK,OACLC,EAAM,UACNwC,EAAS,iBACTw+B,EAAgB,YAGhBsB,EAAW,QACXC,EAAO,SACPgD,EAAQ,WACRC,IAEA,MAAO1E,EAAe0B,GAAoB,oBAAS,IAC5CC,EAAkBC,GAAuB,oBAAS,GACnDE,EAAY,iBAAO,MACnBD,EAAY,iBAAO,MACnBE,EAAe,iBAAO,MACtBC,EAAa,iBAAOP,GACpBQ,EAAiB,iBAAOT,GACxBmD,EAAkB,iBAAO,MACzBC,EAAW,iBAAO7sC,GAClB8sC,EAAe,GAAY90B,GACjC,GAAS,KACP,MAAMqE,EAAa,GAAOpN,OAE1B,OADAoN,EAAWopB,KAAKI,IAAWkE,EAAUjqB,QAAU+lB,IAAWgE,GAAoB,IAAQM,MAAMrlC,GAAwE,iBAA9DA,aAAqC,EAASA,EAAM0X,YAA2B4tB,GAC9K,IAAMN,EAAUhqB,QAuGzB,WACE,IAAIitB,EAOEC,EALiD,QAAtDD,EAAyBH,EAAgB9sB,eAAgD,IAA3BitB,GAA6CA,EAAuBvC,UAE/HiC,EACFD,GAAiBP,GAAWgB,IAAIj1B,EAAM8xB,EAAUhqB,QAAQ0sB,iBAII,QAA3DQ,EAAyBlD,EAAUhqB,QAAQ6oB,kBAAmD,IAA3BqE,GAA6CA,EAAuBxC,UAG1IV,EAAUhqB,QAAQ0qB,UApHeC,GAAkBpuB,EAAWqpB,WAEhE,GAAU,KACR,MAAMwH,EAAQzE,GAAiBsB,EAAUjqB,QAASssB,GAAgBpsC,EAAOqsC,GAAmB3D,EAAU1wB,GAElGk1B,IAAUpD,EAAUhqB,QAAQ6oB,aAC9B6D,GAAiBP,GAAWgB,IAAIH,EAAchD,EAAUhqB,QAAQ0sB,iBAChE1C,EAAUhqB,QAAQ8rB,SAASsB,GAC3BV,GAAiB1C,EAAUhqB,QAAQqtB,iBAAiBlB,GAAWrsC,IAAIoY,MAEpE,CAACA,GAAOiwB,GACX,GAAU,KACR6B,EAAUhqB,QAAQ0rB,cAAcjwB,IAC/B,CAACA,GAAU0sB,GACd,GAAU,KACJ6B,EAAUhqB,QAAQ8qB,UAAUb,EAAUjqB,QAAQwnB,OAAOuD,aAAaC,UACpEhB,EAAUhqB,QAAQirB,SAAS/qC,GAEvBA,IAAU8pC,EAAUhqB,QAAQkrB,aAC9BlB,EAAUhqB,QAAQmrB,aAAa,GAAI,CAAC,CAClCC,MAAOpB,EAAUhqB,QAAQ6oB,WAAWwC,oBACpCzrB,KAAM1f,EACNorC,kBAAkB,KAEpBtB,EAAUhqB,QAAQurB,iBAGrB,CAACrrC,GAAQioC,GACZ,GAAU,KACR8B,EAAUjqB,QAAQwnB,OAAOgE,iBAAiBxB,EAAUhqB,QAAQ6oB,WAAYD,IACvE,CAACA,GAAWT,GACf,GAAU,UHjEOzP,IGmEE5R,GACfkjB,EAAUhqB,QAAQstB,WAAWxmB,IAE9B,CAACA,GAAOqhB,GACX,GAAU,KACR8B,EAAUjqB,QAAQwnB,OAAOiE,SAAS/B,IACjC,CAACA,GAAQvB,GACZ,MAAM4D,EAAe,sBAAY,KAC/B3B,EAAepqB,QAAQiqB,EAAUjqB,SACjC,MAAMutB,EAAuBr1B,GAAQs0B,EAC/BgB,EAAe7E,GAAiBsB,EAAUjqB,QAAS9f,GAASosC,EAAcC,GAAmB3D,EAAU2E,GAC7GvD,EAAUhqB,QAAUiqB,EAAUjqB,QAAQwnB,OAAOjnC,OAAO2pC,EAAalqB,QAAS,CACxEotB,MAAOI,EACPvB,iBAAiB,KACdxwB,GACFgxB,GACHC,GAAiB1C,EAAUhqB,QAAQqtB,iBAAiBlB,GAAWrsC,IAAIytC,IACnEtD,EAAUjqB,QAAQwnB,OAAOiE,SAAS/B,GAClCG,GAAiB,IAChB,CAACyC,EAAcC,EAAiBC,EAAatsC,EAAO0oC,EAAU1wB,EAAMuD,EAASgxB,EAAkBC,EAAehD,IAmEjH,OAlEA,oBAAU,KACJvB,GACFgC,EAAWnqB,QAAQgqB,EAAUhqB,QAASiqB,EAAUjqB,UAEjD,CAACmoB,IACJ,oBAAU,MACP2B,IAAqB3B,GAAiB4D,KACtC,CAACjC,EAAkB3B,EAAe4D,IAGrCgB,EAAS/sB,QAAU9f,EACnB,oBAAU,KAEN,IAAIutC,EAAuBC,EADzBvF,GAAiByE,IAGmC,QAArDa,EAAwBX,EAAgB9sB,eAA+C,IAA1BytB,GAA4CA,EAAsB/C,UAChIoC,EAAgB9sB,QAAuD,QAA5C0tB,EAAqB1D,EAAUhqB,eAA4C,IAAvB0tB,OAAgC,EAASA,EAAmBC,wBAAwB/xB,IACjK,MAAMgyB,EAAc5D,EAAUhqB,QAAQkrB,WAElC6B,EAAS/sB,UAAY4tB,GACvBhB,EAASgB,EAAahyB,OAI3B,CAACusB,EAAeyE,IAEnB,oBAAU,KACR,GAAIzE,EAAe,CACjB,MAAM0F,EAAwB5D,EAAUjqB,QAAQwnB,OAAOsG,mBAAmBC,IACxE,IAAIC,EAEJ,MAAMC,EAAuE,QAA1DD,EAAwBhE,EAAUhqB,QAAQ6oB,kBAAkD,IAA1BmF,OAAmC,EAASA,EAAsBE,IAEvJ,GAAID,EAAW,CAGb,GAFsCF,EAAK5sB,KAAK+sB,GAAOA,EAAIh2B,OAAS+1B,EAAU/1B,MAE3C,CACjC,MAAMi2B,EAAUlE,EAAUjqB,QAAQwnB,OAAO4G,gBAAgB,CACvDC,SAAUJ,IAEZpB,SAAwDA,EAAWsB,OAIzE,MAAO,KACLN,SAA8EA,EAAsBnD,aAGvG,CAACvC,EAAe0E,IAkBC,IAAM1jC,cAAc,GAAiB,CACvD/B,MAAOA,EACPC,OAAQA,EACR8gC,cAAeA,EACfC,QAASA,EACTb,KAAM2C,EACNrgC,UAAWA,EACXw+B,iBAAkBA,IAItBgE,GAAO/D,UAAY,CACjBgE,aAAc,KAAU5pC,OACxB8pC,YAAa,KAAU9pC,OACvB6pC,gBAAiB,KAAU7pC,OAC3BxC,MAAO,KAAUwC,OACjBkmC,SAAU,KAAUlmC,OACpBwV,KAAM,KAAUxV,OAGhBgnC,MAAO,KAAUhnC,OACjBokB,KAAM,KAAUrkB,OAChB2lC,QAAS,KAAUhlC,UAAU,CAAC,KAAUN,QAAS,KAAUJ,SAC3D+Y,QAAS,KAAU9a,OACnB8rC,iBAAkB,KAAU9rC,OAC5B+rC,cAAe,KAAUnqC,KACzBoqC,iBAAkB,KAAUpqC,KAG5B6E,MAAO,KAAUhE,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SACxD2E,OAAQ,KAAUjE,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SACzDmH,UAAW,KAAUnH,OACrB2lC,iBAAkB,KAAU3lC,OAG5BinC,YAAa,KAAUnnC,KACvBonC,QAAS,KAAUpnC,KACnBoqC,SAAU,KAAUpqC,KACpBqqC,WAAY,KAAUrqC,MAExB6pC,GAAOH,aAAe,CACpBxC,MAAO,QACPtB,QAAS,aACT3sB,QAAS,GACTgxB,iBAAkB,GAClBC,eAAe,EACfC,kBAAkB,EAGlBvlC,MAAO,OACPC,OAAQ,OAGRsiC,YAAa,GACbC,QAAS,GACTiD,WAAY,IAGC,I,YAAA,MCjOA,GAFU,eAAK,I,QCDjByB,GAAiC,CAC5CzP,QAAS,2/oGAyuBTgC,WAAY,m0BAqBZG,YAAa,i8EAuCbjC,YAAa,CACX,CACEU,WAAY,SACZC,MAAO,YAET,CACED,WAAY,WACZC,MAAO,YAET,CACED,WAAY,UACZC,MAAO,YAET,CACED,WAAY,SACZC,MAAO,YAET,CACED,WAAY,SACZC,MAAO,YAET,CACED,WAAY,SACZC,MAAO,YAET,CACED,WAAY,YACZC,MAAO,SAET,CACED,WAAY,YACZC,MAAO,SAET,CACED,WAAY,WACZC,MAAO,SAET,CACED,WAAY,WACZC,MAAO,SAET,CACED,WAAY,YACZC,MAAO,SAET,CACED,WAAY,aACZC,MAAO,W,QCr0Bb,0E,OAGE,EAAA6O,eAAiB,gBACoB,IAAxB,EAAKC,gBACd,EAAK7sC,MAAMirC,SAAS,EAAK4B,eAAetD,aAG5C,EAAAuD,iBAAmB,SAACjH,GAClB,EAAKgH,eAAiBhH,G,EAwB1B,OAjC2B,OAWzB,YAAAkH,iBAAA,gBACqC,IAAxBxqC,KAAKsqC,gBACdtqC,KAAKsqC,eAAeG,UAGxB,YAAA1N,OAAA,WACE,IAAMpuB,EAAS3O,KAAKvC,MAAMzB,MAI1B,OAHIgE,KAAKsqC,gBACPtqC,KAAKsqC,eAAeG,SAGpB,yBAAKC,OAAQ1qC,KAAKqqC,gBAChB,kBAAC,GAAM,CACLlnC,OAAQ,OACRuhC,SAAU1kC,KAAKvC,MAAMinC,SACrBc,MAAOxlC,KAAKvC,MAAM+nC,MAClBxpC,MAAO2S,EACP+2B,QAAS1lC,KAAKuqC,qBAKxB,EAjCA,CAA2B,IAAMI,eA4CjC,eACE,WAAYltC,GAAZ,MACE,YAAMA,IAAM,K,OACZ,EAAKg9B,MAAK,KAAQh9B,EAAMzB,O,EA6D5B,OAhEyB,OAKvB,YAAA+gC,OAAA,sBACQ,EAAkD/8B,KAAKvC,MAArDzB,EAAK,QAAE0K,EAAK,QAAEkkC,EAAY,eAAEC,EAAK,QAAEC,EAAQ,WACnD,OACE,kBAAC,mBAAe,KACd,kBAAC,SAAK,eACN,kBAAC,SAAK,CACJtyB,KAAK,OACLld,KAAK,QACL8sC,aAAcpsC,EAAMw/B,MACpBjyB,IAAK,UAAOi8B,MACZkF,OAAQ,SAACjqC,GACP,IAAM+6B,EAAQ/6B,EAAEsqC,cAAc/uC,MAC9B,EAAKy/B,SAAS,CAAED,MAAOA,IACvBoP,GAAgBlkC,GAASkkC,EAAa,EAAD,KAAM5uC,GAAK,CAAEw/B,MAAOA,IAAS90B,MAGtE,kBAAC,SAAK,oBACN,kBAAC,SAAK,CACJ8R,KAAK,OACLld,KAAK,aACL8sC,aAAcpsC,EAAMu/B,WACpBhyB,IAAK,UAAOi8B,MACZkF,OAAQ,SAACjqC,GACP,IAAM86B,EAAa96B,EAAEsqC,cAAc/uC,MACnC,EAAKy/B,SAAS,CAAEF,WAAYA,IAC5BqP,GAAgBlkC,GAASkkC,EAAa,EAAD,KAAM5uC,GAAK,CAAEu/B,WAAYA,IAAc70B,MAG/E1K,EAAMw/B,OAASsP,QAAsBtW,IAAV9tB,GAC1B,kBAAC,WAAO,CAACm9B,QAAQ,sBAAsB2B,MAAO,QAC5C,kBAAC,UAAM,CACLwF,QAAQ,cACRC,KAAK,YACLl3B,KAAK,KACLkpB,QAAS,WACP6N,EAASpkC,KACV,YAML1K,EAAMw/B,OAASqP,GACf,kBAAC,WAAO,CAAChH,QAAQ,+DAA+D2B,MAAO,QACrF,kBAAC,UAAM,CACLwF,QAAQ,YACRj3B,KAAK,KACLk3B,KAAK,cACLhO,QAAS,WACP4N,EAAM,EAAKpQ,SACZ,UASf,EAhEA,CAAyB,IAAMkQ,eAkE/B,0E,OACE,EAAAC,aAAe,SAACM,EAA8BxkC,GAC5C,IAAIykC,EAAc,EAAH,KAAO,EAAK1tC,MAAMzB,QACjCmvC,EAAYzkC,GAASwkC,EACrB,EAAKztC,MAAMirC,SAASyC,IAEtB,EAAAN,MAAQ,SAACO,GACP,GAAyB,KAArBA,EAAW5P,MAAc,CAC3B,IAAI2P,EAAc,EAAH,OAAO,EAAK1tC,MAAMzB,QAAK,CAAEovC,IACxC,EAAK3tC,MAAMirC,SAASyC,KAGxB,EAAAL,SAAW,SAACpkC,GACV,IAAIykC,EAAc,EAAH,KAAO,EAAK1tC,MAAMzB,QACjCmvC,EAAYriB,OAAOpiB,EAAO,GAC1B,EAAKjJ,MAAMirC,SAASyC,I,EAqCxB,OApD0B,OAiBxB,YAAApO,OAAA,sBACQC,EAAS,GAAwB,UAAOwI,OACxC3K,EAAc76B,KAAKvC,MAAMzB,MAC/B,OACE,kBAAC,iBAAa,KACZ,kBAAC,mBAAe,KACd,kBAAC,WAAO,CAAC6nC,QAAQ,uDAAuD2B,MAAM,QAC5E,kBAAC,UAAM,CACLwF,QAAQ,cACRC,KAAK,YACLl3B,KAAK,KACLkpB,QAAS,WACP,EAAKx/B,MAAMirC,SAAS,MACrB,cAKL,kBAAC,GAAU,CAAC1sC,MAAO,CAAEw/B,MAAO,GAAID,WAAY,IAAMyB,OAAQA,EAAQ6N,MAAO7qC,KAAK6qC,SAE/EhQ,EAAY54B,KAAI,SAACopC,EAA8B3kC,GAC9C,OACE,kBAAC,GAAU,CACTpK,IAAK+uC,EAAe7P,MACpBx/B,MAAOqvC,EACP3kC,MAAOA,EACPkkC,aAAc,EAAKA,aACnBE,SAAU,EAAKA,SACf9N,OAAQA,SAOtB,EApDA,CAA0B,IAAM2N,eAuK1B,GAA0B,SAACnF,GAC/B,MAAO,CACL8F,YAAa,eAAG,mEACe,aAAhB9F,EAAM+F,QAAQC,IAE7BC,YAAa,eAAG,uIAIhBC,UAAW,eAAG,4IACkB,wEAIF,sBAJnBlG,EAAMmG,OAAOC,SAIXpG,EAAMmG,OAAOjwB,MAG1BmwB,QAAS,eAAG,4IACoB,wEAIF,sBAJnBrG,EAAMmG,OAAOC,SAIXpG,EAAMmG,OAAOjwB,QC7T9B,wCAKO,IAAM,GAAS,IAAI,cAA2B,IAAaowB,iBAAiBC,iBDiLrD,SAACC,GAC7B,OAAOA,EACJC,iBAAiB,CAChBC,SAAU,CAAC,gBACXl4B,KAAM,kBACN1Y,KAAM,0BACN6wC,YAAa,iFAEdC,gBAAgB,CACfF,SAAU,CAAC,gBACXl4B,KAAM,YACN1Y,KAAM,eACN6wC,YAAa,uKAEb5xB,GAAI,YACJ6tB,aAAcgC,GAAezP,QAC7B2I,OAAQ,SAAgB7lC,GACtB,IAAM4uC,EAAe,UAAO7G,MAAMlqC,KAClC,OACE,kBAAC,GAAY,CACXopC,SAAS,MACTc,MAAwB,kBAAjB6G,EAAmC,WAAa,UACvDrwC,MAAOyB,EAAMzB,MACb0sC,SAAUjrC,EAAMirC,cAKvBuD,iBAAiB,CAChBC,SAAU,CAAC,kBACXl4B,KAAM,oBACN1Y,KAAM,gCACN6wC,YAAa,+EACb/D,cAAc,IAEfgE,gBAAgB,CACfF,SAAU,CAAC,kBACXl4B,KAAM,cACN1Y,KAAM,sBACN6wC,YAAa,kaAIb5xB,GAAI,cACJ6tB,aAAcgC,GAAetN,YAC7BwG,OAAQ,SAAgB7lC,GACtB,IAAM4uC,EAAe,UAAO7G,MAAMlqC,KAClC,OACE,kBAAC,GAAY,CACXopC,SAAS,aACTc,MAAwB,kBAAjB6G,EAAmC,WAAa,UACvDrwC,MAAOyB,EAAMzB,MACb0sC,SAAUjrC,EAAMirC,cAKvBuD,iBAAiB,CAChBC,SAAU,CAAC,gBACXl4B,KAAM,mBACN1Y,KAAM,8BACN6wC,YAAa,+EACb/D,cAAc,IAEfgE,gBAAgB,CACfF,SAAU,CAAC,gBACXl4B,KAAM,aACN1Y,KAAM,oBACN6wC,YAAa,6VAGb5xB,GAAI,aACJ6tB,aAAcgC,GAAezN,WAC7B2G,OAAQ,SAAgB7lC,GACtB,IAAM4uC,EAAe,UAAO7G,MAAMlqC,KAClC,OACE,kBAAC,GAAY,CACXopC,SAAS,aACTc,MAAwB,kBAAjB6G,EAAmC,WAAa,UACvDrwC,MAAOyB,EAAMzB,MACb0sC,SAAUjrC,EAAMirC,cAKvBuD,iBAAiB,CAChBC,SAAU,CAAC,eACXl4B,KAAM,YACN1Y,KAAM,0BACN6wC,YACE,uGACF/D,cAAc,IAEf6D,iBAAiB,CAChBC,SAAU,CAAC,eACXl4B,KAAM,kBACN1Y,KAAM,8BACN6wC,YACE,6IACF/D,cAAc,IAEfgE,gBAAgB,CACfF,SAAU,CAAC,eACX3xB,GAAI,cACJvG,KAAM,cACN1Y,KAAM,eACN6wC,YACE,6NACF/D,aAAcgC,GAAevP,YAC7ByI,OAAQ","file":"module.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"/\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 8);\n","module.exports = __WEBPACK_EXTERNAL_MODULE__0__;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nif (process.env.NODE_ENV !== 'production') {\n var ReactIs = require('react-is');\n\n // By explicitly using `prop-types` you are opting into new development behavior.\n // http://fb.me/prop-types-in-prod\n var throwOnDirectAccess = true;\n module.exports = require('./factoryWithTypeCheckers')(ReactIs.isElement, throwOnDirectAccess);\n} else {\n // By explicitly using `prop-types` you are opting into new production behavior.\n // http://fb.me/prop-types-in-prod\n module.exports = require('./factoryWithThrowingShims')();\n}\n","module.exports = __WEBPACK_EXTERNAL_MODULE__2__;","module.exports = __WEBPACK_EXTERNAL_MODULE__3__;","module.exports = __WEBPACK_EXTERNAL_MODULE__4__;","module.exports = __WEBPACK_EXTERNAL_MODULE__5__;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = require('./lib/ReactPropTypesSecret');\n\nfunction emptyFunction() {}\nfunction emptyFunctionWithReset() {}\nemptyFunctionWithReset.resetWarningCache = emptyFunction;\n\nmodule.exports = function() {\n function shim(props, propName, componentName, location, propFullName, secret) {\n if (secret === ReactPropTypesSecret) {\n // It is still safe when called from React.\n return;\n }\n var err = new Error(\n 'Calling PropTypes validators directly is not supported by the `prop-types` package. ' +\n 'Use PropTypes.checkPropTypes() to call them. ' +\n 'Read more at http://fb.me/use-check-prop-types'\n );\n err.name = 'Invariant Violation';\n throw err;\n };\n shim.isRequired = shim;\n function getShim() {\n return shim;\n };\n // Important!\n // Keep this list in sync with production version in `./factoryWithTypeCheckers.js`.\n var ReactPropTypes = {\n array: shim,\n bool: shim,\n func: shim,\n number: shim,\n object: shim,\n string: shim,\n symbol: shim,\n\n any: shim,\n arrayOf: getShim,\n element: shim,\n elementType: shim,\n instanceOf: getShim,\n node: shim,\n objectOf: getShim,\n oneOf: getShim,\n oneOfType: getShim,\n shape: getShim,\n exact: getShim,\n\n checkPropTypes: emptyFunctionWithReset,\n resetWarningCache: emptyFunction\n };\n\n ReactPropTypes.PropTypes = ReactPropTypes;\n\n return ReactPropTypes;\n};\n","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';\n\nmodule.exports = ReactPropTypesSecret;\n","/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n extendStatics = Object.setPrototypeOf ||\r\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n if (typeof b !== \"function\" && b !== null)\r\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n extendStatics(d, b);\r\n function __() { this.constructor = d; }\r\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n __assign = Object.assign || function __assign(t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n }\r\n return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n var t = {};\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n t[p] = s[p];\r\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n t[p[i]] = s[p[i]];\r\n }\r\n return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n return new (P || (P = Promise))(function (resolve, reject) {\r\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (_) try {\r\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\r\n}) : (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n if (m) return m.call(o);\r\n if (o && typeof o.length === \"number\") return {\r\n next: function () {\r\n if (o && i >= o.length) o = void 0;\r\n return { value: o && o[i++], done: !o };\r\n }\r\n };\r\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n if (!m) return o;\r\n var i = m.call(o), r, ar = [], e;\r\n try {\r\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n }\r\n catch (error) { e = { error: error }; }\r\n finally {\r\n try {\r\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n }\r\n finally { if (e) throw e.error; }\r\n }\r\n return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n for (var ar = [], i = 0; i < arguments.length; i++)\r\n ar = ar.concat(__read(arguments[i]));\r\n return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n r[k] = a[j];\r\n return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n if (ar || !(i in from)) {\r\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n ar[i] = from[i];\r\n }\r\n }\r\n return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n function fulfill(value) { resume(\"next\", value); }\r\n function reject(value) { resume(\"throw\", value); }\r\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n var i, p;\r\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var m = o[Symbol.asyncIterator], i;\r\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n if (mod && mod.__esModule) return mod;\r\n var result = {};\r\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n __setModuleDefault(result, mod);\r\n return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n","/*!\n* @svgdotjs/svg.js - A lightweight library for manipulating and animating SVG.\n* @version 3.1.1\n* https://svgjs.dev/\n*\n* @copyright Wout Fierens \n* @license MIT\n*\n* BUILT: Fri Jun 25 2021 15:37:54 GMT+0200 (Mitteleuropäische Sommerzeit)\n*/;\nconst methods$1 = {};\nconst names = [];\nfunction registerMethods(name, m) {\n if (Array.isArray(name)) {\n for (const _name of name) {\n registerMethods(_name, m);\n }\n\n return;\n }\n\n if (typeof name === 'object') {\n for (const _name in name) {\n registerMethods(_name, name[_name]);\n }\n\n return;\n }\n\n addMethodNames(Object.getOwnPropertyNames(m));\n methods$1[name] = Object.assign(methods$1[name] || {}, m);\n}\nfunction getMethodsFor(name) {\n return methods$1[name] || {};\n}\nfunction getMethodNames() {\n return [...new Set(names)];\n}\nfunction addMethodNames(_names) {\n names.push(..._names);\n}\n\n// Map function\nfunction map(array, block) {\n let i;\n const il = array.length;\n const result = [];\n\n for (i = 0; i < il; i++) {\n result.push(block(array[i]));\n }\n\n return result;\n} // Filter function\n\nfunction filter(array, block) {\n let i;\n const il = array.length;\n const result = [];\n\n for (i = 0; i < il; i++) {\n if (block(array[i])) {\n result.push(array[i]);\n }\n }\n\n return result;\n} // Degrees to radians\n\nfunction radians(d) {\n return d % 360 * Math.PI / 180;\n} // Radians to degrees\n\nfunction degrees(r) {\n return r * 180 / Math.PI % 360;\n} // Convert dash-separated-string to camelCase\n\nfunction camelCase(s) {\n return s.toLowerCase().replace(/-(.)/g, function (m, g) {\n return g.toUpperCase();\n });\n} // Convert camel cased string to dash separated\n\nfunction unCamelCase(s) {\n return s.replace(/([A-Z])/g, function (m, g) {\n return '-' + g.toLowerCase();\n });\n} // Capitalize first letter of a string\n\nfunction capitalize(s) {\n return s.charAt(0).toUpperCase() + s.slice(1);\n} // Calculate proportional width and height values when necessary\n\nfunction proportionalSize(element, width, height, box) {\n if (width == null || height == null) {\n box = box || element.bbox();\n\n if (width == null) {\n width = box.width / box.height * height;\n } else if (height == null) {\n height = box.height / box.width * width;\n }\n }\n\n return {\n width: width,\n height: height\n };\n}\n/**\r\n * This function adds support for string origins.\r\n * It searches for an origin in o.origin o.ox and o.originX.\r\n * This way, origin: {x: 'center', y: 50} can be passed as well as ox: 'center', oy: 50\r\n**/\n\nfunction getOrigin(o, element) {\n const origin = o.origin; // First check if origin is in ox or originX\n\n let ox = o.ox != null ? o.ox : o.originX != null ? o.originX : 'center';\n let oy = o.oy != null ? o.oy : o.originY != null ? o.originY : 'center'; // Then check if origin was used and overwrite in that case\n\n if (origin != null) {\n [ox, oy] = Array.isArray(origin) ? origin : typeof origin === 'object' ? [origin.x, origin.y] : [origin, origin];\n } // Make sure to only call bbox when actually needed\n\n\n const condX = typeof ox === 'string';\n const condY = typeof oy === 'string';\n\n if (condX || condY) {\n const {\n height,\n width,\n x,\n y\n } = element.bbox(); // And only overwrite if string was passed for this specific axis\n\n if (condX) {\n ox = ox.includes('left') ? x : ox.includes('right') ? x + width : x + width / 2;\n }\n\n if (condY) {\n oy = oy.includes('top') ? y : oy.includes('bottom') ? y + height : y + height / 2;\n }\n } // Return the origin as it is if it wasn't a string\n\n\n return [ox, oy];\n}\n\nvar utils = {\n __proto__: null,\n map: map,\n filter: filter,\n radians: radians,\n degrees: degrees,\n camelCase: camelCase,\n unCamelCase: unCamelCase,\n capitalize: capitalize,\n proportionalSize: proportionalSize,\n getOrigin: getOrigin\n};\n\n// Default namespaces\nconst svg = 'http://www.w3.org/2000/svg';\nconst html = 'http://www.w3.org/1999/xhtml';\nconst xmlns = 'http://www.w3.org/2000/xmlns/';\nconst xlink = 'http://www.w3.org/1999/xlink';\nconst svgjs = 'http://svgjs.dev/svgjs';\n\nvar namespaces = {\n __proto__: null,\n svg: svg,\n html: html,\n xmlns: xmlns,\n xlink: xlink,\n svgjs: svgjs\n};\n\nconst globals = {\n window: typeof window === 'undefined' ? null : window,\n document: typeof document === 'undefined' ? null : document\n};\nfunction registerWindow(win = null, doc = null) {\n globals.window = win;\n globals.document = doc;\n}\nconst save = {};\nfunction saveWindow() {\n save.window = globals.window;\n save.document = globals.document;\n}\nfunction restoreWindow() {\n globals.window = save.window;\n globals.document = save.document;\n}\nfunction withWindow(win, fn) {\n saveWindow();\n registerWindow(win, win.document);\n fn(win, win.document);\n restoreWindow();\n}\nfunction getWindow() {\n return globals.window;\n}\n\nclass Base {// constructor (node/*, {extensions = []} */) {\n // // this.tags = []\n // //\n // // for (let extension of extensions) {\n // // extension.setup.call(this, node)\n // // this.tags.push(extension.name)\n // // }\n // }\n}\n\nconst elements = {};\nconst root = '___SYMBOL___ROOT___'; // Method for element creation\n\nfunction create(name, ns = svg) {\n // create element\n return globals.document.createElementNS(ns, name);\n}\nfunction makeInstance(element, isHTML = false) {\n if (element instanceof Base) return element;\n\n if (typeof element === 'object') {\n return adopter(element);\n }\n\n if (element == null) {\n return new elements[root]();\n }\n\n if (typeof element === 'string' && element.charAt(0) !== '<') {\n return adopter(globals.document.querySelector(element));\n } // Make sure, that HTML elements are created with the correct namespace\n\n\n const wrapper = isHTML ? globals.document.createElement('div') : create('svg');\n wrapper.innerHTML = element; // We can use firstChild here because we know,\n // that the first char is < and thus an element\n\n element = adopter(wrapper.firstChild); // make sure, that element doesnt have its wrapper attached\n\n wrapper.removeChild(wrapper.firstChild);\n return element;\n}\nfunction nodeOrNew(name, node) {\n return node instanceof globals.window.Node ? node : create(name);\n} // Adopt existing svg elements\n\nfunction adopt(node) {\n // check for presence of node\n if (!node) return null; // make sure a node isn't already adopted\n\n if (node.instance instanceof Base) return node.instance;\n\n if (node.nodeName === '#document-fragment') {\n return new elements.Fragment(node);\n } // initialize variables\n\n\n let className = capitalize(node.nodeName || 'Dom'); // Make sure that gradients are adopted correctly\n\n if (className === 'LinearGradient' || className === 'RadialGradient') {\n className = 'Gradient'; // Fallback to Dom if element is not known\n } else if (!elements[className]) {\n className = 'Dom';\n }\n\n return new elements[className](node);\n}\nlet adopter = adopt;\nfunction mockAdopt(mock = adopt) {\n adopter = mock;\n}\nfunction register(element, name = element.name, asRoot = false) {\n elements[name] = element;\n if (asRoot) elements[root] = element;\n addMethodNames(Object.getOwnPropertyNames(element.prototype));\n return element;\n}\nfunction getClass(name) {\n return elements[name];\n} // Element id sequence\n\nlet did = 1000; // Get next named element id\n\nfunction eid(name) {\n return 'Svgjs' + capitalize(name) + did++;\n} // Deep new id assignment\n\nfunction assignNewId(node) {\n // do the same for SVG child nodes as well\n for (let i = node.children.length - 1; i >= 0; i--) {\n assignNewId(node.children[i]);\n }\n\n if (node.id) {\n node.id = eid(node.nodeName);\n return node;\n }\n\n return node;\n} // Method for extending objects\n\nfunction extend(modules, methods) {\n let key, i;\n modules = Array.isArray(modules) ? modules : [modules];\n\n for (i = modules.length - 1; i >= 0; i--) {\n for (key in methods) {\n modules[i].prototype[key] = methods[key];\n }\n }\n}\nfunction wrapWithAttrCheck(fn) {\n return function (...args) {\n const o = args[args.length - 1];\n\n if (o && o.constructor === Object && !(o instanceof Array)) {\n return fn.apply(this, args.slice(0, -1)).attr(o);\n } else {\n return fn.apply(this, args);\n }\n };\n}\n\nfunction siblings() {\n return this.parent().children();\n} // Get the current position siblings\n\nfunction position() {\n return this.parent().index(this);\n} // Get the next element (will return null if there is none)\n\nfunction next() {\n return this.siblings()[this.position() + 1];\n} // Get the next element (will return null if there is none)\n\nfunction prev() {\n return this.siblings()[this.position() - 1];\n} // Send given element one step forward\n\nfunction forward() {\n const i = this.position();\n const p = this.parent(); // move node one step forward\n\n p.add(this.remove(), i + 1);\n return this;\n} // Send given element one step backward\n\nfunction backward() {\n const i = this.position();\n const p = this.parent();\n p.add(this.remove(), i ? i - 1 : 0);\n return this;\n} // Send given element all the way to the front\n\nfunction front() {\n const p = this.parent(); // Move node forward\n\n p.add(this.remove());\n return this;\n} // Send given element all the way to the back\n\nfunction back() {\n const p = this.parent(); // Move node back\n\n p.add(this.remove(), 0);\n return this;\n} // Inserts a given element before the targeted element\n\nfunction before(element) {\n element = makeInstance(element);\n element.remove();\n const i = this.position();\n this.parent().add(element, i);\n return this;\n} // Inserts a given element after the targeted element\n\nfunction after(element) {\n element = makeInstance(element);\n element.remove();\n const i = this.position();\n this.parent().add(element, i + 1);\n return this;\n}\nfunction insertBefore(element) {\n element = makeInstance(element);\n element.before(this);\n return this;\n}\nfunction insertAfter(element) {\n element = makeInstance(element);\n element.after(this);\n return this;\n}\nregisterMethods('Dom', {\n siblings,\n position,\n next,\n prev,\n forward,\n backward,\n front,\n back,\n before,\n after,\n insertBefore,\n insertAfter\n});\n\n// Parse unit value\nconst numberAndUnit = /^([+-]?(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?)([a-z%]*)$/i; // Parse hex value\n\nconst hex = /^#?([a-f\\d]{2})([a-f\\d]{2})([a-f\\d]{2})$/i; // Parse rgb value\n\nconst rgb = /rgb\\((\\d+),(\\d+),(\\d+)\\)/; // Parse reference id\n\nconst reference = /(#[a-z_][a-z0-9\\-_]*)/i; // splits a transformation chain\n\nconst transforms = /\\)\\s*,?\\s*/; // Whitespace\n\nconst whitespace = /\\s/g; // Test hex value\n\nconst isHex = /^#[a-f0-9]{3}$|^#[a-f0-9]{6}$/i; // Test rgb value\n\nconst isRgb = /^rgb\\(/; // Test for blank string\n\nconst isBlank = /^(\\s+)?$/; // Test for numeric string\n\nconst isNumber = /^[+-]?(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i; // Test for image url\n\nconst isImage = /\\.(jpg|jpeg|png|gif|svg)(\\?[^=]+.*)?/i; // split at whitespace and comma\n\nconst delimiter = /[\\s,]+/; // Test for path letter\n\nconst isPathLetter = /[MLHVCSQTAZ]/i;\n\nvar regex = {\n __proto__: null,\n numberAndUnit: numberAndUnit,\n hex: hex,\n rgb: rgb,\n reference: reference,\n transforms: transforms,\n whitespace: whitespace,\n isHex: isHex,\n isRgb: isRgb,\n isBlank: isBlank,\n isNumber: isNumber,\n isImage: isImage,\n delimiter: delimiter,\n isPathLetter: isPathLetter\n};\n\nfunction classes() {\n const attr = this.attr('class');\n return attr == null ? [] : attr.trim().split(delimiter);\n} // Return true if class exists on the node, false otherwise\n\nfunction hasClass(name) {\n return this.classes().indexOf(name) !== -1;\n} // Add class to the node\n\nfunction addClass(name) {\n if (!this.hasClass(name)) {\n const array = this.classes();\n array.push(name);\n this.attr('class', array.join(' '));\n }\n\n return this;\n} // Remove class from the node\n\nfunction removeClass(name) {\n if (this.hasClass(name)) {\n this.attr('class', this.classes().filter(function (c) {\n return c !== name;\n }).join(' '));\n }\n\n return this;\n} // Toggle the presence of a class on the node\n\nfunction toggleClass(name) {\n return this.hasClass(name) ? this.removeClass(name) : this.addClass(name);\n}\nregisterMethods('Dom', {\n classes,\n hasClass,\n addClass,\n removeClass,\n toggleClass\n});\n\nfunction css(style, val) {\n const ret = {};\n\n if (arguments.length === 0) {\n // get full style as object\n this.node.style.cssText.split(/\\s*;\\s*/).filter(function (el) {\n return !!el.length;\n }).forEach(function (el) {\n const t = el.split(/\\s*:\\s*/);\n ret[t[0]] = t[1];\n });\n return ret;\n }\n\n if (arguments.length < 2) {\n // get style properties as array\n if (Array.isArray(style)) {\n for (const name of style) {\n const cased = camelCase(name);\n ret[cased] = this.node.style[cased];\n }\n\n return ret;\n } // get style for property\n\n\n if (typeof style === 'string') {\n return this.node.style[camelCase(style)];\n } // set styles in object\n\n\n if (typeof style === 'object') {\n for (const name in style) {\n // set empty string if null/undefined/'' was given\n this.node.style[camelCase(name)] = style[name] == null || isBlank.test(style[name]) ? '' : style[name];\n }\n }\n } // set style for property\n\n\n if (arguments.length === 2) {\n this.node.style[camelCase(style)] = val == null || isBlank.test(val) ? '' : val;\n }\n\n return this;\n} // Show element\n\nfunction show() {\n return this.css('display', '');\n} // Hide element\n\nfunction hide() {\n return this.css('display', 'none');\n} // Is element visible?\n\nfunction visible() {\n return this.css('display') !== 'none';\n}\nregisterMethods('Dom', {\n css,\n show,\n hide,\n visible\n});\n\nfunction data(a, v, r) {\n if (a == null) {\n // get an object of attributes\n return this.data(map(filter(this.node.attributes, el => el.nodeName.indexOf('data-') === 0), el => el.nodeName.slice(5)));\n } else if (a instanceof Array) {\n const data = {};\n\n for (const key of a) {\n data[key] = this.data(key);\n }\n\n return data;\n } else if (typeof a === 'object') {\n for (v in a) {\n this.data(v, a[v]);\n }\n } else if (arguments.length < 2) {\n try {\n return JSON.parse(this.attr('data-' + a));\n } catch (e) {\n return this.attr('data-' + a);\n }\n } else {\n this.attr('data-' + a, v === null ? null : r === true || typeof v === 'string' || typeof v === 'number' ? v : JSON.stringify(v));\n }\n\n return this;\n}\nregisterMethods('Dom', {\n data\n});\n\nfunction remember(k, v) {\n // remember every item in an object individually\n if (typeof arguments[0] === 'object') {\n for (const key in k) {\n this.remember(key, k[key]);\n }\n } else if (arguments.length === 1) {\n // retrieve memory\n return this.memory()[k];\n } else {\n // store memory\n this.memory()[k] = v;\n }\n\n return this;\n} // Erase a given memory\n\nfunction forget() {\n if (arguments.length === 0) {\n this._memory = {};\n } else {\n for (let i = arguments.length - 1; i >= 0; i--) {\n delete this.memory()[arguments[i]];\n }\n }\n\n return this;\n} // This triggers creation of a new hidden class which is not performant\n// However, this function is not rarely used so it will not happen frequently\n// Return local memory object\n\nfunction memory() {\n return this._memory = this._memory || {};\n}\nregisterMethods('Dom', {\n remember,\n forget,\n memory\n});\n\nfunction sixDigitHex(hex) {\n return hex.length === 4 ? ['#', hex.substring(1, 2), hex.substring(1, 2), hex.substring(2, 3), hex.substring(2, 3), hex.substring(3, 4), hex.substring(3, 4)].join('') : hex;\n}\n\nfunction componentHex(component) {\n const integer = Math.round(component);\n const bounded = Math.max(0, Math.min(255, integer));\n const hex = bounded.toString(16);\n return hex.length === 1 ? '0' + hex : hex;\n}\n\nfunction is(object, space) {\n for (let i = space.length; i--;) {\n if (object[space[i]] == null) {\n return false;\n }\n }\n\n return true;\n}\n\nfunction getParameters(a, b) {\n const params = is(a, 'rgb') ? {\n _a: a.r,\n _b: a.g,\n _c: a.b,\n _d: 0,\n space: 'rgb'\n } : is(a, 'xyz') ? {\n _a: a.x,\n _b: a.y,\n _c: a.z,\n _d: 0,\n space: 'xyz'\n } : is(a, 'hsl') ? {\n _a: a.h,\n _b: a.s,\n _c: a.l,\n _d: 0,\n space: 'hsl'\n } : is(a, 'lab') ? {\n _a: a.l,\n _b: a.a,\n _c: a.b,\n _d: 0,\n space: 'lab'\n } : is(a, 'lch') ? {\n _a: a.l,\n _b: a.c,\n _c: a.h,\n _d: 0,\n space: 'lch'\n } : is(a, 'cmyk') ? {\n _a: a.c,\n _b: a.m,\n _c: a.y,\n _d: a.k,\n space: 'cmyk'\n } : {\n _a: 0,\n _b: 0,\n _c: 0,\n space: 'rgb'\n };\n params.space = b || params.space;\n return params;\n}\n\nfunction cieSpace(space) {\n if (space === 'lab' || space === 'xyz' || space === 'lch') {\n return true;\n } else {\n return false;\n }\n}\n\nfunction hueToRgb(p, q, t) {\n if (t < 0) t += 1;\n if (t > 1) t -= 1;\n if (t < 1 / 6) return p + (q - p) * 6 * t;\n if (t < 1 / 2) return q;\n if (t < 2 / 3) return p + (q - p) * (2 / 3 - t) * 6;\n return p;\n}\n\nclass Color {\n constructor(...inputs) {\n this.init(...inputs);\n } // Test if given value is a color\n\n\n static isColor(color) {\n return color && (color instanceof Color || this.isRgb(color) || this.test(color));\n } // Test if given value is an rgb object\n\n\n static isRgb(color) {\n return color && typeof color.r === 'number' && typeof color.g === 'number' && typeof color.b === 'number';\n }\n /*\r\n Generating random colors\r\n */\n\n\n static random(mode = 'vibrant', t, u) {\n // Get the math modules\n const {\n random,\n round,\n sin,\n PI: pi\n } = Math; // Run the correct generator\n\n if (mode === 'vibrant') {\n const l = (81 - 57) * random() + 57;\n const c = (83 - 45) * random() + 45;\n const h = 360 * random();\n const color = new Color(l, c, h, 'lch');\n return color;\n } else if (mode === 'sine') {\n t = t == null ? random() : t;\n const r = round(80 * sin(2 * pi * t / 0.5 + 0.01) + 150);\n const g = round(50 * sin(2 * pi * t / 0.5 + 4.6) + 200);\n const b = round(100 * sin(2 * pi * t / 0.5 + 2.3) + 150);\n const color = new Color(r, g, b);\n return color;\n } else if (mode === 'pastel') {\n const l = (94 - 86) * random() + 86;\n const c = (26 - 9) * random() + 9;\n const h = 360 * random();\n const color = new Color(l, c, h, 'lch');\n return color;\n } else if (mode === 'dark') {\n const l = 10 + 10 * random();\n const c = (125 - 75) * random() + 86;\n const h = 360 * random();\n const color = new Color(l, c, h, 'lch');\n return color;\n } else if (mode === 'rgb') {\n const r = 255 * random();\n const g = 255 * random();\n const b = 255 * random();\n const color = new Color(r, g, b);\n return color;\n } else if (mode === 'lab') {\n const l = 100 * random();\n const a = 256 * random() - 128;\n const b = 256 * random() - 128;\n const color = new Color(l, a, b, 'lab');\n return color;\n } else if (mode === 'grey') {\n const grey = 255 * random();\n const color = new Color(grey, grey, grey);\n return color;\n } else {\n throw new Error('Unsupported random color mode');\n }\n } // Test if given value is a color string\n\n\n static test(color) {\n return typeof color === 'string' && (isHex.test(color) || isRgb.test(color));\n }\n\n cmyk() {\n // Get the rgb values for the current color\n const {\n _a,\n _b,\n _c\n } = this.rgb();\n const [r, g, b] = [_a, _b, _c].map(v => v / 255); // Get the cmyk values in an unbounded format\n\n const k = Math.min(1 - r, 1 - g, 1 - b);\n\n if (k === 1) {\n // Catch the black case\n return new Color(0, 0, 0, 1, 'cmyk');\n }\n\n const c = (1 - r - k) / (1 - k);\n const m = (1 - g - k) / (1 - k);\n const y = (1 - b - k) / (1 - k); // Construct the new color\n\n const color = new Color(c, m, y, k, 'cmyk');\n return color;\n }\n\n hsl() {\n // Get the rgb values\n const {\n _a,\n _b,\n _c\n } = this.rgb();\n const [r, g, b] = [_a, _b, _c].map(v => v / 255); // Find the maximum and minimum values to get the lightness\n\n const max = Math.max(r, g, b);\n const min = Math.min(r, g, b);\n const l = (max + min) / 2; // If the r, g, v values are identical then we are grey\n\n const isGrey = max === min; // Calculate the hue and saturation\n\n const delta = max - min;\n const s = isGrey ? 0 : l > 0.5 ? delta / (2 - max - min) : delta / (max + min);\n const h = isGrey ? 0 : max === r ? ((g - b) / delta + (g < b ? 6 : 0)) / 6 : max === g ? ((b - r) / delta + 2) / 6 : max === b ? ((r - g) / delta + 4) / 6 : 0; // Construct and return the new color\n\n const color = new Color(360 * h, 100 * s, 100 * l, 'hsl');\n return color;\n }\n\n init(a = 0, b = 0, c = 0, d = 0, space = 'rgb') {\n // This catches the case when a falsy value is passed like ''\n a = !a ? 0 : a; // Reset all values in case the init function is rerun with new color space\n\n if (this.space) {\n for (const component in this.space) {\n delete this[this.space[component]];\n }\n }\n\n if (typeof a === 'number') {\n // Allow for the case that we don't need d...\n space = typeof d === 'string' ? d : space;\n d = typeof d === 'string' ? 0 : d; // Assign the values straight to the color\n\n Object.assign(this, {\n _a: a,\n _b: b,\n _c: c,\n _d: d,\n space\n }); // If the user gave us an array, make the color from it\n } else if (a instanceof Array) {\n this.space = b || (typeof a[3] === 'string' ? a[3] : a[4]) || 'rgb';\n Object.assign(this, {\n _a: a[0],\n _b: a[1],\n _c: a[2],\n _d: a[3] || 0\n });\n } else if (a instanceof Object) {\n // Set the object up and assign its values directly\n const values = getParameters(a, b);\n Object.assign(this, values);\n } else if (typeof a === 'string') {\n if (isRgb.test(a)) {\n const noWhitespace = a.replace(whitespace, '');\n const [_a, _b, _c] = rgb.exec(noWhitespace).slice(1, 4).map(v => parseInt(v));\n Object.assign(this, {\n _a,\n _b,\n _c,\n _d: 0,\n space: 'rgb'\n });\n } else if (isHex.test(a)) {\n const hexParse = v => parseInt(v, 16);\n\n const [, _a, _b, _c] = hex.exec(sixDigitHex(a)).map(hexParse);\n Object.assign(this, {\n _a,\n _b,\n _c,\n _d: 0,\n space: 'rgb'\n });\n } else throw Error('Unsupported string format, can\\'t construct Color');\n } // Now add the components as a convenience\n\n\n const {\n _a,\n _b,\n _c,\n _d\n } = this;\n const components = this.space === 'rgb' ? {\n r: _a,\n g: _b,\n b: _c\n } : this.space === 'xyz' ? {\n x: _a,\n y: _b,\n z: _c\n } : this.space === 'hsl' ? {\n h: _a,\n s: _b,\n l: _c\n } : this.space === 'lab' ? {\n l: _a,\n a: _b,\n b: _c\n } : this.space === 'lch' ? {\n l: _a,\n c: _b,\n h: _c\n } : this.space === 'cmyk' ? {\n c: _a,\n m: _b,\n y: _c,\n k: _d\n } : {};\n Object.assign(this, components);\n }\n\n lab() {\n // Get the xyz color\n const {\n x,\n y,\n z\n } = this.xyz(); // Get the lab components\n\n const l = 116 * y - 16;\n const a = 500 * (x - y);\n const b = 200 * (y - z); // Construct and return a new color\n\n const color = new Color(l, a, b, 'lab');\n return color;\n }\n\n lch() {\n // Get the lab color directly\n const {\n l,\n a,\n b\n } = this.lab(); // Get the chromaticity and the hue using polar coordinates\n\n const c = Math.sqrt(a ** 2 + b ** 2);\n let h = 180 * Math.atan2(b, a) / Math.PI;\n\n if (h < 0) {\n h *= -1;\n h = 360 - h;\n } // Make a new color and return it\n\n\n const color = new Color(l, c, h, 'lch');\n return color;\n }\n /*\r\n Conversion Methods\r\n */\n\n\n rgb() {\n if (this.space === 'rgb') {\n return this;\n } else if (cieSpace(this.space)) {\n // Convert to the xyz color space\n let {\n x,\n y,\n z\n } = this;\n\n if (this.space === 'lab' || this.space === 'lch') {\n // Get the values in the lab space\n let {\n l,\n a,\n b\n } = this;\n\n if (this.space === 'lch') {\n const {\n c,\n h\n } = this;\n const dToR = Math.PI / 180;\n a = c * Math.cos(dToR * h);\n b = c * Math.sin(dToR * h);\n } // Undo the nonlinear function\n\n\n const yL = (l + 16) / 116;\n const xL = a / 500 + yL;\n const zL = yL - b / 200; // Get the xyz values\n\n const ct = 16 / 116;\n const mx = 0.008856;\n const nm = 7.787;\n x = 0.95047 * (xL ** 3 > mx ? xL ** 3 : (xL - ct) / nm);\n y = 1.00000 * (yL ** 3 > mx ? yL ** 3 : (yL - ct) / nm);\n z = 1.08883 * (zL ** 3 > mx ? zL ** 3 : (zL - ct) / nm);\n } // Convert xyz to unbounded rgb values\n\n\n const rU = x * 3.2406 + y * -1.5372 + z * -0.4986;\n const gU = x * -0.9689 + y * 1.8758 + z * 0.0415;\n const bU = x * 0.0557 + y * -0.2040 + z * 1.0570; // Convert the values to true rgb values\n\n const pow = Math.pow;\n const bd = 0.0031308;\n const r = rU > bd ? 1.055 * pow(rU, 1 / 2.4) - 0.055 : 12.92 * rU;\n const g = gU > bd ? 1.055 * pow(gU, 1 / 2.4) - 0.055 : 12.92 * gU;\n const b = bU > bd ? 1.055 * pow(bU, 1 / 2.4) - 0.055 : 12.92 * bU; // Make and return the color\n\n const color = new Color(255 * r, 255 * g, 255 * b);\n return color;\n } else if (this.space === 'hsl') {\n // https://bgrins.github.io/TinyColor/docs/tinycolor.html\n // Get the current hsl values\n let {\n h,\n s,\n l\n } = this;\n h /= 360;\n s /= 100;\n l /= 100; // If we are grey, then just make the color directly\n\n if (s === 0) {\n l *= 255;\n const color = new Color(l, l, l);\n return color;\n } // TODO I have no idea what this does :D If you figure it out, tell me!\n\n\n const q = l < 0.5 ? l * (1 + s) : l + s - l * s;\n const p = 2 * l - q; // Get the rgb values\n\n const r = 255 * hueToRgb(p, q, h + 1 / 3);\n const g = 255 * hueToRgb(p, q, h);\n const b = 255 * hueToRgb(p, q, h - 1 / 3); // Make a new color\n\n const color = new Color(r, g, b);\n return color;\n } else if (this.space === 'cmyk') {\n // https://gist.github.com/felipesabino/5066336\n // Get the normalised cmyk values\n const {\n c,\n m,\n y,\n k\n } = this; // Get the rgb values\n\n const r = 255 * (1 - Math.min(1, c * (1 - k) + k));\n const g = 255 * (1 - Math.min(1, m * (1 - k) + k));\n const b = 255 * (1 - Math.min(1, y * (1 - k) + k)); // Form the color and return it\n\n const color = new Color(r, g, b);\n return color;\n } else {\n return this;\n }\n }\n\n toArray() {\n const {\n _a,\n _b,\n _c,\n _d,\n space\n } = this;\n return [_a, _b, _c, _d, space];\n }\n\n toHex() {\n const [r, g, b] = this._clamped().map(componentHex);\n\n return `#${r}${g}${b}`;\n }\n\n toRgb() {\n const [rV, gV, bV] = this._clamped();\n\n const string = `rgb(${rV},${gV},${bV})`;\n return string;\n }\n\n toString() {\n return this.toHex();\n }\n\n xyz() {\n // Normalise the red, green and blue values\n const {\n _a: r255,\n _b: g255,\n _c: b255\n } = this.rgb();\n const [r, g, b] = [r255, g255, b255].map(v => v / 255); // Convert to the lab rgb space\n\n const rL = r > 0.04045 ? Math.pow((r + 0.055) / 1.055, 2.4) : r / 12.92;\n const gL = g > 0.04045 ? Math.pow((g + 0.055) / 1.055, 2.4) : g / 12.92;\n const bL = b > 0.04045 ? Math.pow((b + 0.055) / 1.055, 2.4) : b / 12.92; // Convert to the xyz color space without bounding the values\n\n const xU = (rL * 0.4124 + gL * 0.3576 + bL * 0.1805) / 0.95047;\n const yU = (rL * 0.2126 + gL * 0.7152 + bL * 0.0722) / 1.00000;\n const zU = (rL * 0.0193 + gL * 0.1192 + bL * 0.9505) / 1.08883; // Get the proper xyz values by applying the bounding\n\n const x = xU > 0.008856 ? Math.pow(xU, 1 / 3) : 7.787 * xU + 16 / 116;\n const y = yU > 0.008856 ? Math.pow(yU, 1 / 3) : 7.787 * yU + 16 / 116;\n const z = zU > 0.008856 ? Math.pow(zU, 1 / 3) : 7.787 * zU + 16 / 116; // Make and return the color\n\n const color = new Color(x, y, z, 'xyz');\n return color;\n }\n /*\r\n Input and Output methods\r\n */\n\n\n _clamped() {\n const {\n _a,\n _b,\n _c\n } = this.rgb();\n const {\n max,\n min,\n round\n } = Math;\n\n const format = v => max(0, min(round(v), 255));\n\n return [_a, _b, _c].map(format);\n }\n /*\r\n Constructing colors\r\n */\n\n\n}\n\nclass Point {\n // Initialize\n constructor(...args) {\n this.init(...args);\n } // Clone point\n\n\n clone() {\n return new Point(this);\n }\n\n init(x, y) {\n const base = {\n x: 0,\n y: 0\n }; // ensure source as object\n\n const source = Array.isArray(x) ? {\n x: x[0],\n y: x[1]\n } : typeof x === 'object' ? {\n x: x.x,\n y: x.y\n } : {\n x: x,\n y: y\n }; // merge source\n\n this.x = source.x == null ? base.x : source.x;\n this.y = source.y == null ? base.y : source.y;\n return this;\n }\n\n toArray() {\n return [this.x, this.y];\n }\n\n transform(m) {\n return this.clone().transformO(m);\n } // Transform point with matrix\n\n\n transformO(m) {\n if (!Matrix.isMatrixLike(m)) {\n m = new Matrix(m);\n }\n\n const {\n x,\n y\n } = this; // Perform the matrix multiplication\n\n this.x = m.a * x + m.c * y + m.e;\n this.y = m.b * x + m.d * y + m.f;\n return this;\n }\n\n}\nfunction point(x, y) {\n return new Point(x, y).transform(this.screenCTM().inverse());\n}\n\nfunction closeEnough(a, b, threshold) {\n return Math.abs(b - a) < (threshold || 1e-6);\n}\n\nclass Matrix {\n constructor(...args) {\n this.init(...args);\n }\n\n static formatTransforms(o) {\n // Get all of the parameters required to form the matrix\n const flipBoth = o.flip === 'both' || o.flip === true;\n const flipX = o.flip && (flipBoth || o.flip === 'x') ? -1 : 1;\n const flipY = o.flip && (flipBoth || o.flip === 'y') ? -1 : 1;\n const skewX = o.skew && o.skew.length ? o.skew[0] : isFinite(o.skew) ? o.skew : isFinite(o.skewX) ? o.skewX : 0;\n const skewY = o.skew && o.skew.length ? o.skew[1] : isFinite(o.skew) ? o.skew : isFinite(o.skewY) ? o.skewY : 0;\n const scaleX = o.scale && o.scale.length ? o.scale[0] * flipX : isFinite(o.scale) ? o.scale * flipX : isFinite(o.scaleX) ? o.scaleX * flipX : flipX;\n const scaleY = o.scale && o.scale.length ? o.scale[1] * flipY : isFinite(o.scale) ? o.scale * flipY : isFinite(o.scaleY) ? o.scaleY * flipY : flipY;\n const shear = o.shear || 0;\n const theta = o.rotate || o.theta || 0;\n const origin = new Point(o.origin || o.around || o.ox || o.originX, o.oy || o.originY);\n const ox = origin.x;\n const oy = origin.y; // We need Point to be invalid if nothing was passed because we cannot default to 0 here. Thats why NaN\n\n const position = new Point(o.position || o.px || o.positionX || NaN, o.py || o.positionY || NaN);\n const px = position.x;\n const py = position.y;\n const translate = new Point(o.translate || o.tx || o.translateX, o.ty || o.translateY);\n const tx = translate.x;\n const ty = translate.y;\n const relative = new Point(o.relative || o.rx || o.relativeX, o.ry || o.relativeY);\n const rx = relative.x;\n const ry = relative.y; // Populate all of the values\n\n return {\n scaleX,\n scaleY,\n skewX,\n skewY,\n shear,\n theta,\n rx,\n ry,\n tx,\n ty,\n ox,\n oy,\n px,\n py\n };\n }\n\n static fromArray(a) {\n return {\n a: a[0],\n b: a[1],\n c: a[2],\n d: a[3],\n e: a[4],\n f: a[5]\n };\n }\n\n static isMatrixLike(o) {\n return o.a != null || o.b != null || o.c != null || o.d != null || o.e != null || o.f != null;\n } // left matrix, right matrix, target matrix which is overwritten\n\n\n static matrixMultiply(l, r, o) {\n // Work out the product directly\n const a = l.a * r.a + l.c * r.b;\n const b = l.b * r.a + l.d * r.b;\n const c = l.a * r.c + l.c * r.d;\n const d = l.b * r.c + l.d * r.d;\n const e = l.e + l.a * r.e + l.c * r.f;\n const f = l.f + l.b * r.e + l.d * r.f; // make sure to use local variables because l/r and o could be the same\n\n o.a = a;\n o.b = b;\n o.c = c;\n o.d = d;\n o.e = e;\n o.f = f;\n return o;\n }\n\n around(cx, cy, matrix) {\n return this.clone().aroundO(cx, cy, matrix);\n } // Transform around a center point\n\n\n aroundO(cx, cy, matrix) {\n const dx = cx || 0;\n const dy = cy || 0;\n return this.translateO(-dx, -dy).lmultiplyO(matrix).translateO(dx, dy);\n } // Clones this matrix\n\n\n clone() {\n return new Matrix(this);\n } // Decomposes this matrix into its affine parameters\n\n\n decompose(cx = 0, cy = 0) {\n // Get the parameters from the matrix\n const a = this.a;\n const b = this.b;\n const c = this.c;\n const d = this.d;\n const e = this.e;\n const f = this.f; // Figure out if the winding direction is clockwise or counterclockwise\n\n const determinant = a * d - b * c;\n const ccw = determinant > 0 ? 1 : -1; // Since we only shear in x, we can use the x basis to get the x scale\n // and the rotation of the resulting matrix\n\n const sx = ccw * Math.sqrt(a * a + b * b);\n const thetaRad = Math.atan2(ccw * b, ccw * a);\n const theta = 180 / Math.PI * thetaRad;\n const ct = Math.cos(thetaRad);\n const st = Math.sin(thetaRad); // We can then solve the y basis vector simultaneously to get the other\n // two affine parameters directly from these parameters\n\n const lam = (a * c + b * d) / determinant;\n const sy = c * sx / (lam * a - b) || d * sx / (lam * b + a); // Use the translations\n\n const tx = e - cx + cx * ct * sx + cy * (lam * ct * sx - st * sy);\n const ty = f - cy + cx * st * sx + cy * (lam * st * sx + ct * sy); // Construct the decomposition and return it\n\n return {\n // Return the affine parameters\n scaleX: sx,\n scaleY: sy,\n shear: lam,\n rotate: theta,\n translateX: tx,\n translateY: ty,\n originX: cx,\n originY: cy,\n // Return the matrix parameters\n a: this.a,\n b: this.b,\n c: this.c,\n d: this.d,\n e: this.e,\n f: this.f\n };\n } // Check if two matrices are equal\n\n\n equals(other) {\n if (other === this) return true;\n const comp = new Matrix(other);\n return closeEnough(this.a, comp.a) && closeEnough(this.b, comp.b) && closeEnough(this.c, comp.c) && closeEnough(this.d, comp.d) && closeEnough(this.e, comp.e) && closeEnough(this.f, comp.f);\n } // Flip matrix on x or y, at a given offset\n\n\n flip(axis, around) {\n return this.clone().flipO(axis, around);\n }\n\n flipO(axis, around) {\n return axis === 'x' ? this.scaleO(-1, 1, around, 0) : axis === 'y' ? this.scaleO(1, -1, 0, around) : this.scaleO(-1, -1, axis, around || axis); // Define an x, y flip point\n } // Initialize\n\n\n init(source) {\n const base = Matrix.fromArray([1, 0, 0, 1, 0, 0]); // ensure source as object\n\n source = source instanceof Element ? source.matrixify() : typeof source === 'string' ? Matrix.fromArray(source.split(delimiter).map(parseFloat)) : Array.isArray(source) ? Matrix.fromArray(source) : typeof source === 'object' && Matrix.isMatrixLike(source) ? source : typeof source === 'object' ? new Matrix().transform(source) : arguments.length === 6 ? Matrix.fromArray([].slice.call(arguments)) : base; // Merge the source matrix with the base matrix\n\n this.a = source.a != null ? source.a : base.a;\n this.b = source.b != null ? source.b : base.b;\n this.c = source.c != null ? source.c : base.c;\n this.d = source.d != null ? source.d : base.d;\n this.e = source.e != null ? source.e : base.e;\n this.f = source.f != null ? source.f : base.f;\n return this;\n }\n\n inverse() {\n return this.clone().inverseO();\n } // Inverses matrix\n\n\n inverseO() {\n // Get the current parameters out of the matrix\n const a = this.a;\n const b = this.b;\n const c = this.c;\n const d = this.d;\n const e = this.e;\n const f = this.f; // Invert the 2x2 matrix in the top left\n\n const det = a * d - b * c;\n if (!det) throw new Error('Cannot invert ' + this); // Calculate the top 2x2 matrix\n\n const na = d / det;\n const nb = -b / det;\n const nc = -c / det;\n const nd = a / det; // Apply the inverted matrix to the top right\n\n const ne = -(na * e + nc * f);\n const nf = -(nb * e + nd * f); // Construct the inverted matrix\n\n this.a = na;\n this.b = nb;\n this.c = nc;\n this.d = nd;\n this.e = ne;\n this.f = nf;\n return this;\n }\n\n lmultiply(matrix) {\n return this.clone().lmultiplyO(matrix);\n }\n\n lmultiplyO(matrix) {\n const r = this;\n const l = matrix instanceof Matrix ? matrix : new Matrix(matrix);\n return Matrix.matrixMultiply(l, r, this);\n } // Left multiplies by the given matrix\n\n\n multiply(matrix) {\n return this.clone().multiplyO(matrix);\n }\n\n multiplyO(matrix) {\n // Get the matrices\n const l = this;\n const r = matrix instanceof Matrix ? matrix : new Matrix(matrix);\n return Matrix.matrixMultiply(l, r, this);\n } // Rotate matrix\n\n\n rotate(r, cx, cy) {\n return this.clone().rotateO(r, cx, cy);\n }\n\n rotateO(r, cx = 0, cy = 0) {\n // Convert degrees to radians\n r = radians(r);\n const cos = Math.cos(r);\n const sin = Math.sin(r);\n const {\n a,\n b,\n c,\n d,\n e,\n f\n } = this;\n this.a = a * cos - b * sin;\n this.b = b * cos + a * sin;\n this.c = c * cos - d * sin;\n this.d = d * cos + c * sin;\n this.e = e * cos - f * sin + cy * sin - cx * cos + cx;\n this.f = f * cos + e * sin - cx * sin - cy * cos + cy;\n return this;\n } // Scale matrix\n\n\n scale(x, y, cx, cy) {\n return this.clone().scaleO(...arguments);\n }\n\n scaleO(x, y = x, cx = 0, cy = 0) {\n // Support uniform scaling\n if (arguments.length === 3) {\n cy = cx;\n cx = y;\n y = x;\n }\n\n const {\n a,\n b,\n c,\n d,\n e,\n f\n } = this;\n this.a = a * x;\n this.b = b * y;\n this.c = c * x;\n this.d = d * y;\n this.e = e * x - cx * x + cx;\n this.f = f * y - cy * y + cy;\n return this;\n } // Shear matrix\n\n\n shear(a, cx, cy) {\n return this.clone().shearO(a, cx, cy);\n }\n\n shearO(lx, cx = 0, cy = 0) {\n const {\n a,\n b,\n c,\n d,\n e,\n f\n } = this;\n this.a = a + b * lx;\n this.c = c + d * lx;\n this.e = e + f * lx - cy * lx;\n return this;\n } // Skew Matrix\n\n\n skew(x, y, cx, cy) {\n return this.clone().skewO(...arguments);\n }\n\n skewO(x, y = x, cx = 0, cy = 0) {\n // support uniformal skew\n if (arguments.length === 3) {\n cy = cx;\n cx = y;\n y = x;\n } // Convert degrees to radians\n\n\n x = radians(x);\n y = radians(y);\n const lx = Math.tan(x);\n const ly = Math.tan(y);\n const {\n a,\n b,\n c,\n d,\n e,\n f\n } = this;\n this.a = a + b * lx;\n this.b = b + a * ly;\n this.c = c + d * lx;\n this.d = d + c * ly;\n this.e = e + f * lx - cy * lx;\n this.f = f + e * ly - cx * ly;\n return this;\n } // SkewX\n\n\n skewX(x, cx, cy) {\n return this.skew(x, 0, cx, cy);\n } // SkewY\n\n\n skewY(y, cx, cy) {\n return this.skew(0, y, cx, cy);\n }\n\n toArray() {\n return [this.a, this.b, this.c, this.d, this.e, this.f];\n } // Convert matrix to string\n\n\n toString() {\n return 'matrix(' + this.a + ',' + this.b + ',' + this.c + ',' + this.d + ',' + this.e + ',' + this.f + ')';\n } // Transform a matrix into another matrix by manipulating the space\n\n\n transform(o) {\n // Check if o is a matrix and then left multiply it directly\n if (Matrix.isMatrixLike(o)) {\n const matrix = new Matrix(o);\n return matrix.multiplyO(this);\n } // Get the proposed transformations and the current transformations\n\n\n const t = Matrix.formatTransforms(o);\n const current = this;\n const {\n x: ox,\n y: oy\n } = new Point(t.ox, t.oy).transform(current); // Construct the resulting matrix\n\n const transformer = new Matrix().translateO(t.rx, t.ry).lmultiplyO(current).translateO(-ox, -oy).scaleO(t.scaleX, t.scaleY).skewO(t.skewX, t.skewY).shearO(t.shear).rotateO(t.theta).translateO(ox, oy); // If we want the origin at a particular place, we force it there\n\n if (isFinite(t.px) || isFinite(t.py)) {\n const origin = new Point(ox, oy).transform(transformer); // TODO: Replace t.px with isFinite(t.px)\n // Doesnt work because t.px is also 0 if it wasnt passed\n\n const dx = isFinite(t.px) ? t.px - origin.x : 0;\n const dy = isFinite(t.py) ? t.py - origin.y : 0;\n transformer.translateO(dx, dy);\n } // Translate now after positioning\n\n\n transformer.translateO(t.tx, t.ty);\n return transformer;\n } // Translate matrix\n\n\n translate(x, y) {\n return this.clone().translateO(x, y);\n }\n\n translateO(x, y) {\n this.e += x || 0;\n this.f += y || 0;\n return this;\n }\n\n valueOf() {\n return {\n a: this.a,\n b: this.b,\n c: this.c,\n d: this.d,\n e: this.e,\n f: this.f\n };\n }\n\n}\nfunction ctm() {\n return new Matrix(this.node.getCTM());\n}\nfunction screenCTM() {\n /* https://bugzilla.mozilla.org/show_bug.cgi?id=1344537\r\n This is needed because FF does not return the transformation matrix\r\n for the inner coordinate system when getScreenCTM() is called on nested svgs.\r\n However all other Browsers do that */\n if (typeof this.isRoot === 'function' && !this.isRoot()) {\n const rect = this.rect(1, 1);\n const m = rect.node.getScreenCTM();\n rect.remove();\n return new Matrix(m);\n }\n\n return new Matrix(this.node.getScreenCTM());\n}\nregister(Matrix, 'Matrix');\n\nfunction parser() {\n // Reuse cached element if possible\n if (!parser.nodes) {\n const svg = makeInstance().size(2, 0);\n svg.node.style.cssText = ['opacity: 0', 'position: absolute', 'left: -100%', 'top: -100%', 'overflow: hidden'].join(';');\n svg.attr('focusable', 'false');\n svg.attr('aria-hidden', 'true');\n const path = svg.path().node;\n parser.nodes = {\n svg,\n path\n };\n }\n\n if (!parser.nodes.svg.node.parentNode) {\n const b = globals.document.body || globals.document.documentElement;\n parser.nodes.svg.addTo(b);\n }\n\n return parser.nodes;\n}\n\nfunction isNulledBox(box) {\n return !box.width && !box.height && !box.x && !box.y;\n}\nfunction domContains(node) {\n return node === globals.document || (globals.document.documentElement.contains || function (node) {\n // This is IE - it does not support contains() for top-level SVGs\n while (node.parentNode) {\n node = node.parentNode;\n }\n\n return node === globals.document;\n }).call(globals.document.documentElement, node);\n}\nclass Box {\n constructor(...args) {\n this.init(...args);\n }\n\n addOffset() {\n // offset by window scroll position, because getBoundingClientRect changes when window is scrolled\n this.x += globals.window.pageXOffset;\n this.y += globals.window.pageYOffset;\n return new Box(this);\n }\n\n init(source) {\n const base = [0, 0, 0, 0];\n source = typeof source === 'string' ? source.split(delimiter).map(parseFloat) : Array.isArray(source) ? source : typeof source === 'object' ? [source.left != null ? source.left : source.x, source.top != null ? source.top : source.y, source.width, source.height] : arguments.length === 4 ? [].slice.call(arguments) : base;\n this.x = source[0] || 0;\n this.y = source[1] || 0;\n this.width = this.w = source[2] || 0;\n this.height = this.h = source[3] || 0; // Add more bounding box properties\n\n this.x2 = this.x + this.w;\n this.y2 = this.y + this.h;\n this.cx = this.x + this.w / 2;\n this.cy = this.y + this.h / 2;\n return this;\n }\n\n isNulled() {\n return isNulledBox(this);\n } // Merge rect box with another, return a new instance\n\n\n merge(box) {\n const x = Math.min(this.x, box.x);\n const y = Math.min(this.y, box.y);\n const width = Math.max(this.x + this.width, box.x + box.width) - x;\n const height = Math.max(this.y + this.height, box.y + box.height) - y;\n return new Box(x, y, width, height);\n }\n\n toArray() {\n return [this.x, this.y, this.width, this.height];\n }\n\n toString() {\n return this.x + ' ' + this.y + ' ' + this.width + ' ' + this.height;\n }\n\n transform(m) {\n if (!(m instanceof Matrix)) {\n m = new Matrix(m);\n }\n\n let xMin = Infinity;\n let xMax = -Infinity;\n let yMin = Infinity;\n let yMax = -Infinity;\n const pts = [new Point(this.x, this.y), new Point(this.x2, this.y), new Point(this.x, this.y2), new Point(this.x2, this.y2)];\n pts.forEach(function (p) {\n p = p.transform(m);\n xMin = Math.min(xMin, p.x);\n xMax = Math.max(xMax, p.x);\n yMin = Math.min(yMin, p.y);\n yMax = Math.max(yMax, p.y);\n });\n return new Box(xMin, yMin, xMax - xMin, yMax - yMin);\n }\n\n}\n\nfunction getBox(el, getBBoxFn, retry) {\n let box;\n\n try {\n // Try to get the box with the provided function\n box = getBBoxFn(el.node); // If the box is worthless and not even in the dom, retry\n // by throwing an error here...\n\n if (isNulledBox(box) && !domContains(el.node)) {\n throw new Error('Element not in the dom');\n }\n } catch (e) {\n // ... and calling the retry handler here\n box = retry(el);\n }\n\n return box;\n}\n\nfunction bbox() {\n // Function to get bbox is getBBox()\n const getBBox = node => node.getBBox(); // Take all measures so that a stupid browser renders the element\n // so we can get the bbox from it when we try again\n\n\n const retry = el => {\n try {\n const clone = el.clone().addTo(parser().svg).show();\n const box = clone.node.getBBox();\n clone.remove();\n return box;\n } catch (e) {\n // We give up...\n throw new Error(`Getting bbox of element \"${el.node.nodeName}\" is not possible: ${e.toString()}`);\n }\n };\n\n const box = getBox(this, getBBox, retry);\n const bbox = new Box(box);\n return bbox;\n}\nfunction rbox(el) {\n const getRBox = node => node.getBoundingClientRect();\n\n const retry = el => {\n // There is no point in trying tricks here because if we insert the element into the dom ourselves\n // it obviously will be at the wrong position\n throw new Error(`Getting rbox of element \"${el.node.nodeName}\" is not possible`);\n };\n\n const box = getBox(this, getRBox, retry);\n const rbox = new Box(box); // If an element was passed, we want the bbox in the coordinate system of that element\n\n if (el) {\n return rbox.transform(el.screenCTM().inverseO());\n } // Else we want it in absolute screen coordinates\n // Therefore we need to add the scrollOffset\n\n\n return rbox.addOffset();\n} // Checks whether the given point is inside the bounding box\n\nfunction inside(x, y) {\n const box = this.bbox();\n return x > box.x && y > box.y && x < box.x + box.width && y < box.y + box.height;\n}\nregisterMethods({\n viewbox: {\n viewbox(x, y, width, height) {\n // act as getter\n if (x == null) return new Box(this.attr('viewBox')); // act as setter\n\n return this.attr('viewBox', new Box(x, y, width, height));\n },\n\n zoom(level, point) {\n // Its best to rely on the attributes here and here is why:\n // clientXYZ: Doesn't work on non-root svgs because they dont have a CSSBox (silly!)\n // getBoundingClientRect: Doesn't work because Chrome just ignores width and height of nested svgs completely\n // that means, their clientRect is always as big as the content.\n // Furthermore this size is incorrect if the element is further transformed by its parents\n // computedStyle: Only returns meaningful values if css was used with px. We dont go this route here!\n // getBBox: returns the bounding box of its content - that doesnt help!\n let {\n width,\n height\n } = this.attr(['width', 'height']); // Width and height is a string when a number with a unit is present which we can't use\n // So we try clientXYZ\n\n if (!width && !height || typeof width === 'string' || typeof height === 'string') {\n width = this.node.clientWidth;\n height = this.node.clientHeight;\n } // Giving up...\n\n\n if (!width || !height) {\n throw new Error('Impossible to get absolute width and height. Please provide an absolute width and height attribute on the zooming element');\n }\n\n const v = this.viewbox();\n const zoomX = width / v.width;\n const zoomY = height / v.height;\n const zoom = Math.min(zoomX, zoomY);\n\n if (level == null) {\n return zoom;\n }\n\n let zoomAmount = zoom / level; // Set the zoomAmount to the highest value which is safe to process and recover from\n // The * 100 is a bit of wiggle room for the matrix transformation\n\n if (zoomAmount === Infinity) zoomAmount = Number.MAX_SAFE_INTEGER / 100;\n point = point || new Point(width / 2 / zoomX + v.x, height / 2 / zoomY + v.y);\n const box = new Box(v).transform(new Matrix({\n scale: zoomAmount,\n origin: point\n }));\n return this.viewbox(box);\n }\n\n }\n});\nregister(Box, 'Box');\n\nclass List extends Array {\n constructor(arr = [], ...args) {\n super(arr, ...args);\n if (typeof arr === 'number') return this;\n this.length = 0;\n this.push(...arr);\n }\n\n}\nextend([List], {\n each(fnOrMethodName, ...args) {\n if (typeof fnOrMethodName === 'function') {\n return this.map((el, i, arr) => {\n return fnOrMethodName.call(el, el, i, arr);\n });\n } else {\n return this.map(el => {\n return el[fnOrMethodName](...args);\n });\n }\n },\n\n toArray() {\n return Array.prototype.concat.apply([], this);\n }\n\n});\nconst reserved = ['toArray', 'constructor', 'each'];\n\nList.extend = function (methods) {\n methods = methods.reduce((obj, name) => {\n // Don't overwrite own methods\n if (reserved.includes(name)) return obj; // Don't add private methods\n\n if (name[0] === '_') return obj; // Relay every call to each()\n\n obj[name] = function (...attrs) {\n return this.each(name, ...attrs);\n };\n\n return obj;\n }, {});\n extend([List], methods);\n};\n\nfunction baseFind(query, parent) {\n return new List(map((parent || globals.document).querySelectorAll(query), function (node) {\n return adopt(node);\n }));\n} // Scoped find method\n\nfunction find(query) {\n return baseFind(query, this.node);\n}\nfunction findOne(query) {\n return adopt(this.node.querySelector(query));\n}\n\nlet listenerId = 0;\nconst windowEvents = {};\nfunction getEvents(instance) {\n let n = instance.getEventHolder(); // We dont want to save events in global space\n\n if (n === globals.window) n = windowEvents;\n if (!n.events) n.events = {};\n return n.events;\n}\nfunction getEventTarget(instance) {\n return instance.getEventTarget();\n}\nfunction clearEvents(instance) {\n let n = instance.getEventHolder();\n if (n === globals.window) n = windowEvents;\n if (n.events) n.events = {};\n} // Add event binder in the SVG namespace\n\nfunction on(node, events, listener, binding, options) {\n const l = listener.bind(binding || node);\n const instance = makeInstance(node);\n const bag = getEvents(instance);\n const n = getEventTarget(instance); // events can be an array of events or a string of events\n\n events = Array.isArray(events) ? events : events.split(delimiter); // add id to listener\n\n if (!listener._svgjsListenerId) {\n listener._svgjsListenerId = ++listenerId;\n }\n\n events.forEach(function (event) {\n const ev = event.split('.')[0];\n const ns = event.split('.')[1] || '*'; // ensure valid object\n\n bag[ev] = bag[ev] || {};\n bag[ev][ns] = bag[ev][ns] || {}; // reference listener\n\n bag[ev][ns][listener._svgjsListenerId] = l; // add listener\n\n n.addEventListener(ev, l, options || false);\n });\n} // Add event unbinder in the SVG namespace\n\nfunction off(node, events, listener, options) {\n const instance = makeInstance(node);\n const bag = getEvents(instance);\n const n = getEventTarget(instance); // listener can be a function or a number\n\n if (typeof listener === 'function') {\n listener = listener._svgjsListenerId;\n if (!listener) return;\n } // events can be an array of events or a string or undefined\n\n\n events = Array.isArray(events) ? events : (events || '').split(delimiter);\n events.forEach(function (event) {\n const ev = event && event.split('.')[0];\n const ns = event && event.split('.')[1];\n let namespace, l;\n\n if (listener) {\n // remove listener reference\n if (bag[ev] && bag[ev][ns || '*']) {\n // removeListener\n n.removeEventListener(ev, bag[ev][ns || '*'][listener], options || false);\n delete bag[ev][ns || '*'][listener];\n }\n } else if (ev && ns) {\n // remove all listeners for a namespaced event\n if (bag[ev] && bag[ev][ns]) {\n for (l in bag[ev][ns]) {\n off(n, [ev, ns].join('.'), l);\n }\n\n delete bag[ev][ns];\n }\n } else if (ns) {\n // remove all listeners for a specific namespace\n for (event in bag) {\n for (namespace in bag[event]) {\n if (ns === namespace) {\n off(n, [event, ns].join('.'));\n }\n }\n }\n } else if (ev) {\n // remove all listeners for the event\n if (bag[ev]) {\n for (namespace in bag[ev]) {\n off(n, [ev, namespace].join('.'));\n }\n\n delete bag[ev];\n }\n } else {\n // remove all listeners on a given node\n for (event in bag) {\n off(n, event);\n }\n\n clearEvents(instance);\n }\n });\n}\nfunction dispatch(node, event, data, options) {\n const n = getEventTarget(node); // Dispatch event\n\n if (event instanceof globals.window.Event) {\n n.dispatchEvent(event);\n } else {\n event = new globals.window.CustomEvent(event, {\n detail: data,\n cancelable: true,\n ...options\n });\n n.dispatchEvent(event);\n }\n\n return event;\n}\n\nclass EventTarget extends Base {\n addEventListener() {}\n\n dispatch(event, data, options) {\n return dispatch(this, event, data, options);\n }\n\n dispatchEvent(event) {\n const bag = this.getEventHolder().events;\n if (!bag) return true;\n const events = bag[event.type];\n\n for (const i in events) {\n for (const j in events[i]) {\n events[i][j](event);\n }\n }\n\n return !event.defaultPrevented;\n } // Fire given event\n\n\n fire(event, data, options) {\n this.dispatch(event, data, options);\n return this;\n }\n\n getEventHolder() {\n return this;\n }\n\n getEventTarget() {\n return this;\n } // Unbind event from listener\n\n\n off(event, listener) {\n off(this, event, listener);\n return this;\n } // Bind given event to listener\n\n\n on(event, listener, binding, options) {\n on(this, event, listener, binding, options);\n return this;\n }\n\n removeEventListener() {}\n\n}\nregister(EventTarget, 'EventTarget');\n\nfunction noop() {} // Default animation values\n\nconst timeline = {\n duration: 400,\n ease: '>',\n delay: 0\n}; // Default attribute values\n\nconst attrs = {\n // fill and stroke\n 'fill-opacity': 1,\n 'stroke-opacity': 1,\n 'stroke-width': 0,\n 'stroke-linejoin': 'miter',\n 'stroke-linecap': 'butt',\n fill: '#000000',\n stroke: '#000000',\n opacity: 1,\n // position\n x: 0,\n y: 0,\n cx: 0,\n cy: 0,\n // size\n width: 0,\n height: 0,\n // radius\n r: 0,\n rx: 0,\n ry: 0,\n // gradient\n offset: 0,\n 'stop-opacity': 1,\n 'stop-color': '#000000',\n // text\n 'text-anchor': 'start'\n};\n\nvar defaults = {\n __proto__: null,\n noop: noop,\n timeline: timeline,\n attrs: attrs\n};\n\nclass SVGArray extends Array {\n constructor(...args) {\n super(...args);\n this.init(...args);\n }\n\n clone() {\n return new this.constructor(this);\n }\n\n init(arr) {\n // This catches the case, that native map tries to create an array with new Array(1)\n if (typeof arr === 'number') return this;\n this.length = 0;\n this.push(...this.parse(arr));\n return this;\n } // Parse whitespace separated string\n\n\n parse(array = []) {\n // If already is an array, no need to parse it\n if (array instanceof Array) return array;\n return array.trim().split(delimiter).map(parseFloat);\n }\n\n toArray() {\n return Array.prototype.concat.apply([], this);\n }\n\n toSet() {\n return new Set(this);\n }\n\n toString() {\n return this.join(' ');\n } // Flattens the array if needed\n\n\n valueOf() {\n const ret = [];\n ret.push(...this);\n return ret;\n }\n\n}\n\nclass SVGNumber {\n // Initialize\n constructor(...args) {\n this.init(...args);\n }\n\n convert(unit) {\n return new SVGNumber(this.value, unit);\n } // Divide number\n\n\n divide(number) {\n number = new SVGNumber(number);\n return new SVGNumber(this / number, this.unit || number.unit);\n }\n\n init(value, unit) {\n unit = Array.isArray(value) ? value[1] : unit;\n value = Array.isArray(value) ? value[0] : value; // initialize defaults\n\n this.value = 0;\n this.unit = unit || ''; // parse value\n\n if (typeof value === 'number') {\n // ensure a valid numeric value\n this.value = isNaN(value) ? 0 : !isFinite(value) ? value < 0 ? -3.4e+38 : +3.4e+38 : value;\n } else if (typeof value === 'string') {\n unit = value.match(numberAndUnit);\n\n if (unit) {\n // make value numeric\n this.value = parseFloat(unit[1]); // normalize\n\n if (unit[5] === '%') {\n this.value /= 100;\n } else if (unit[5] === 's') {\n this.value *= 1000;\n } // store unit\n\n\n this.unit = unit[5];\n }\n } else {\n if (value instanceof SVGNumber) {\n this.value = value.valueOf();\n this.unit = value.unit;\n }\n }\n\n return this;\n } // Subtract number\n\n\n minus(number) {\n number = new SVGNumber(number);\n return new SVGNumber(this - number, this.unit || number.unit);\n } // Add number\n\n\n plus(number) {\n number = new SVGNumber(number);\n return new SVGNumber(this + number, this.unit || number.unit);\n } // Multiply number\n\n\n times(number) {\n number = new SVGNumber(number);\n return new SVGNumber(this * number, this.unit || number.unit);\n }\n\n toArray() {\n return [this.value, this.unit];\n }\n\n toJSON() {\n return this.toString();\n }\n\n toString() {\n return (this.unit === '%' ? ~~(this.value * 1e8) / 1e6 : this.unit === 's' ? this.value / 1e3 : this.value) + this.unit;\n }\n\n valueOf() {\n return this.value;\n }\n\n}\n\nconst hooks = [];\nfunction registerAttrHook(fn) {\n hooks.push(fn);\n} // Set svg element attribute\n\nfunction attr(attr, val, ns) {\n // act as full getter\n if (attr == null) {\n // get an object of attributes\n attr = {};\n val = this.node.attributes;\n\n for (const node of val) {\n attr[node.nodeName] = isNumber.test(node.nodeValue) ? parseFloat(node.nodeValue) : node.nodeValue;\n }\n\n return attr;\n } else if (attr instanceof Array) {\n // loop through array and get all values\n return attr.reduce((last, curr) => {\n last[curr] = this.attr(curr);\n return last;\n }, {});\n } else if (typeof attr === 'object' && attr.constructor === Object) {\n // apply every attribute individually if an object is passed\n for (val in attr) this.attr(val, attr[val]);\n } else if (val === null) {\n // remove value\n this.node.removeAttribute(attr);\n } else if (val == null) {\n // act as a getter if the first and only argument is not an object\n val = this.node.getAttribute(attr);\n return val == null ? attrs[attr] : isNumber.test(val) ? parseFloat(val) : val;\n } else {\n // Loop through hooks and execute them to convert value\n val = hooks.reduce((_val, hook) => {\n return hook(attr, _val, this);\n }, val); // ensure correct numeric values (also accepts NaN and Infinity)\n\n if (typeof val === 'number') {\n val = new SVGNumber(val);\n } else if (Color.isColor(val)) {\n // ensure full hex color\n val = new Color(val);\n } else if (val.constructor === Array) {\n // Check for plain arrays and parse array values\n val = new SVGArray(val);\n } // if the passed attribute is leading...\n\n\n if (attr === 'leading') {\n // ... call the leading method instead\n if (this.leading) {\n this.leading(val);\n }\n } else {\n // set given attribute on node\n typeof ns === 'string' ? this.node.setAttributeNS(ns, attr, val.toString()) : this.node.setAttribute(attr, val.toString());\n } // rebuild if required\n\n\n if (this.rebuild && (attr === 'font-size' || attr === 'x')) {\n this.rebuild();\n }\n }\n\n return this;\n}\n\nclass Dom extends EventTarget {\n constructor(node, attrs) {\n super();\n this.node = node;\n this.type = node.nodeName;\n\n if (attrs && node !== attrs) {\n this.attr(attrs);\n }\n } // Add given element at a position\n\n\n add(element, i) {\n element = makeInstance(element); // If non-root svg nodes are added we have to remove their namespaces\n\n if (element.removeNamespace && this.node instanceof globals.window.SVGElement) {\n element.removeNamespace();\n }\n\n if (i == null) {\n this.node.appendChild(element.node);\n } else if (element.node !== this.node.childNodes[i]) {\n this.node.insertBefore(element.node, this.node.childNodes[i]);\n }\n\n return this;\n } // Add element to given container and return self\n\n\n addTo(parent, i) {\n return makeInstance(parent).put(this, i);\n } // Returns all child elements\n\n\n children() {\n return new List(map(this.node.children, function (node) {\n return adopt(node);\n }));\n } // Remove all elements in this container\n\n\n clear() {\n // remove children\n while (this.node.hasChildNodes()) {\n this.node.removeChild(this.node.lastChild);\n }\n\n return this;\n } // Clone element\n\n\n clone(deep = true) {\n // write dom data to the dom so the clone can pickup the data\n this.writeDataToDom(); // clone element and assign new id\n\n return new this.constructor(assignNewId(this.node.cloneNode(deep)));\n } // Iterates over all children and invokes a given block\n\n\n each(block, deep) {\n const children = this.children();\n let i, il;\n\n for (i = 0, il = children.length; i < il; i++) {\n block.apply(children[i], [i, children]);\n\n if (deep) {\n children[i].each(block, deep);\n }\n }\n\n return this;\n }\n\n element(nodeName, attrs) {\n return this.put(new Dom(create(nodeName), attrs));\n } // Get first child\n\n\n first() {\n return adopt(this.node.firstChild);\n } // Get a element at the given index\n\n\n get(i) {\n return adopt(this.node.childNodes[i]);\n }\n\n getEventHolder() {\n return this.node;\n }\n\n getEventTarget() {\n return this.node;\n } // Checks if the given element is a child\n\n\n has(element) {\n return this.index(element) >= 0;\n }\n\n html(htmlOrFn, outerHTML) {\n return this.xml(htmlOrFn, outerHTML, html);\n } // Get / set id\n\n\n id(id) {\n // generate new id if no id set\n if (typeof id === 'undefined' && !this.node.id) {\n this.node.id = eid(this.type);\n } // don't set directly with this.node.id to make `null` work correctly\n\n\n return this.attr('id', id);\n } // Gets index of given element\n\n\n index(element) {\n return [].slice.call(this.node.childNodes).indexOf(element.node);\n } // Get the last child\n\n\n last() {\n return adopt(this.node.lastChild);\n } // matches the element vs a css selector\n\n\n matches(selector) {\n const el = this.node;\n const matcher = el.matches || el.matchesSelector || el.msMatchesSelector || el.mozMatchesSelector || el.webkitMatchesSelector || el.oMatchesSelector || null;\n return matcher && matcher.call(el, selector);\n } // Returns the parent element instance\n\n\n parent(type) {\n let parent = this; // check for parent\n\n if (!parent.node.parentNode) return null; // get parent element\n\n parent = adopt(parent.node.parentNode);\n if (!type) return parent; // loop trough ancestors if type is given\n\n do {\n if (typeof type === 'string' ? parent.matches(type) : parent instanceof type) return parent;\n } while (parent = adopt(parent.node.parentNode));\n\n return parent;\n } // Basically does the same as `add()` but returns the added element instead\n\n\n put(element, i) {\n element = makeInstance(element);\n this.add(element, i);\n return element;\n } // Add element to given container and return container\n\n\n putIn(parent, i) {\n return makeInstance(parent).add(this, i);\n } // Remove element\n\n\n remove() {\n if (this.parent()) {\n this.parent().removeElement(this);\n }\n\n return this;\n } // Remove a given child\n\n\n removeElement(element) {\n this.node.removeChild(element.node);\n return this;\n } // Replace this with element\n\n\n replace(element) {\n element = makeInstance(element);\n\n if (this.node.parentNode) {\n this.node.parentNode.replaceChild(element.node, this.node);\n }\n\n return element;\n }\n\n round(precision = 2, map = null) {\n const factor = 10 ** precision;\n const attrs = this.attr(map);\n\n for (const i in attrs) {\n if (typeof attrs[i] === 'number') {\n attrs[i] = Math.round(attrs[i] * factor) / factor;\n }\n }\n\n this.attr(attrs);\n return this;\n } // Import / Export raw svg\n\n\n svg(svgOrFn, outerSVG) {\n return this.xml(svgOrFn, outerSVG, svg);\n } // Return id on string conversion\n\n\n toString() {\n return this.id();\n }\n\n words(text) {\n // This is faster than removing all children and adding a new one\n this.node.textContent = text;\n return this;\n }\n\n wrap(node) {\n const parent = this.parent();\n\n if (!parent) {\n return this.addTo(node);\n }\n\n const position = parent.index(this);\n return parent.put(node, position).put(this);\n } // write svgjs data to the dom\n\n\n writeDataToDom() {\n // dump variables recursively\n this.each(function () {\n this.writeDataToDom();\n });\n return this;\n } // Import / Export raw svg\n\n\n xml(xmlOrFn, outerXML, ns) {\n if (typeof xmlOrFn === 'boolean') {\n ns = outerXML;\n outerXML = xmlOrFn;\n xmlOrFn = null;\n } // act as getter if no svg string is given\n\n\n if (xmlOrFn == null || typeof xmlOrFn === 'function') {\n // The default for exports is, that the outerNode is included\n outerXML = outerXML == null ? true : outerXML; // write svgjs data to the dom\n\n this.writeDataToDom();\n let current = this; // An export modifier was passed\n\n if (xmlOrFn != null) {\n current = adopt(current.node.cloneNode(true)); // If the user wants outerHTML we need to process this node, too\n\n if (outerXML) {\n const result = xmlOrFn(current);\n current = result || current; // The user does not want this node? Well, then he gets nothing\n\n if (result === false) return '';\n } // Deep loop through all children and apply modifier\n\n\n current.each(function () {\n const result = xmlOrFn(this);\n\n const _this = result || this; // If modifier returns false, discard node\n\n\n if (result === false) {\n this.remove(); // If modifier returns new node, use it\n } else if (result && this !== _this) {\n this.replace(_this);\n }\n }, true);\n } // Return outer or inner content\n\n\n return outerXML ? current.node.outerHTML : current.node.innerHTML;\n } // Act as setter if we got a string\n // The default for import is, that the current node is not replaced\n\n\n outerXML = outerXML == null ? false : outerXML; // Create temporary holder\n\n const well = create('wrapper', ns);\n const fragment = globals.document.createDocumentFragment(); // Dump raw svg\n\n well.innerHTML = xmlOrFn; // Transplant nodes into the fragment\n\n for (let len = well.children.length; len--;) {\n fragment.appendChild(well.firstElementChild);\n }\n\n const parent = this.parent(); // Add the whole fragment at once\n\n return outerXML ? this.replace(fragment) && parent : this.add(fragment);\n }\n\n}\nextend(Dom, {\n attr,\n find,\n findOne\n});\nregister(Dom, 'Dom');\n\nclass Element extends Dom {\n constructor(node, attrs) {\n super(node, attrs); // initialize data object\n\n this.dom = {}; // create circular reference\n\n this.node.instance = this;\n\n if (node.hasAttribute('svgjs:data')) {\n // pull svgjs data from the dom (getAttributeNS doesn't work in html5)\n this.setData(JSON.parse(node.getAttribute('svgjs:data')) || {});\n }\n } // Move element by its center\n\n\n center(x, y) {\n return this.cx(x).cy(y);\n } // Move by center over x-axis\n\n\n cx(x) {\n return x == null ? this.x() + this.width() / 2 : this.x(x - this.width() / 2);\n } // Move by center over y-axis\n\n\n cy(y) {\n return y == null ? this.y() + this.height() / 2 : this.y(y - this.height() / 2);\n } // Get defs\n\n\n defs() {\n const root = this.root();\n return root && root.defs();\n } // Relative move over x and y axes\n\n\n dmove(x, y) {\n return this.dx(x).dy(y);\n } // Relative move over x axis\n\n\n dx(x = 0) {\n return this.x(new SVGNumber(x).plus(this.x()));\n } // Relative move over y axis\n\n\n dy(y = 0) {\n return this.y(new SVGNumber(y).plus(this.y()));\n }\n\n getEventHolder() {\n return this;\n } // Set height of element\n\n\n height(height) {\n return this.attr('height', height);\n } // Move element to given x and y values\n\n\n move(x, y) {\n return this.x(x).y(y);\n } // return array of all ancestors of given type up to the root svg\n\n\n parents(until = this.root()) {\n until = makeInstance(until);\n const parents = new List();\n let parent = this;\n\n while ((parent = parent.parent()) && parent.node !== globals.document && parent.nodeName !== '#document-fragment') {\n parents.push(parent);\n\n if (parent.node === until.node) {\n break;\n }\n }\n\n return parents;\n } // Get referenced element form attribute value\n\n\n reference(attr) {\n attr = this.attr(attr);\n if (!attr) return null;\n const m = (attr + '').match(reference);\n return m ? makeInstance(m[1]) : null;\n } // Get parent document\n\n\n root() {\n const p = this.parent(getClass(root));\n return p && p.root();\n } // set given data to the elements data property\n\n\n setData(o) {\n this.dom = o;\n return this;\n } // Set element size to given width and height\n\n\n size(width, height) {\n const p = proportionalSize(this, width, height);\n return this.width(new SVGNumber(p.width)).height(new SVGNumber(p.height));\n } // Set width of element\n\n\n width(width) {\n return this.attr('width', width);\n } // write svgjs data to the dom\n\n\n writeDataToDom() {\n // remove previously set data\n this.node.removeAttribute('svgjs:data');\n\n if (Object.keys(this.dom).length) {\n this.node.setAttribute('svgjs:data', JSON.stringify(this.dom)); // see #428\n }\n\n return super.writeDataToDom();\n } // Move over x-axis\n\n\n x(x) {\n return this.attr('x', x);\n } // Move over y-axis\n\n\n y(y) {\n return this.attr('y', y);\n }\n\n}\nextend(Element, {\n bbox,\n rbox,\n inside,\n point,\n ctm,\n screenCTM\n});\nregister(Element, 'Element');\n\nconst sugar = {\n stroke: ['color', 'width', 'opacity', 'linecap', 'linejoin', 'miterlimit', 'dasharray', 'dashoffset'],\n fill: ['color', 'opacity', 'rule'],\n prefix: function (t, a) {\n return a === 'color' ? t : t + '-' + a;\n }\n} // Add sugar for fill and stroke\n;\n['fill', 'stroke'].forEach(function (m) {\n const extension = {};\n let i;\n\n extension[m] = function (o) {\n if (typeof o === 'undefined') {\n return this.attr(m);\n }\n\n if (typeof o === 'string' || o instanceof Color || Color.isRgb(o) || o instanceof Element) {\n this.attr(m, o);\n } else {\n // set all attributes from sugar.fill and sugar.stroke list\n for (i = sugar[m].length - 1; i >= 0; i--) {\n if (o[sugar[m][i]] != null) {\n this.attr(sugar.prefix(m, sugar[m][i]), o[sugar[m][i]]);\n }\n }\n }\n\n return this;\n };\n\n registerMethods(['Element', 'Runner'], extension);\n});\nregisterMethods(['Element', 'Runner'], {\n // Let the user set the matrix directly\n matrix: function (mat, b, c, d, e, f) {\n // Act as a getter\n if (mat == null) {\n return new Matrix(this);\n } // Act as a setter, the user can pass a matrix or a set of numbers\n\n\n return this.attr('transform', new Matrix(mat, b, c, d, e, f));\n },\n // Map rotation to transform\n rotate: function (angle, cx, cy) {\n return this.transform({\n rotate: angle,\n ox: cx,\n oy: cy\n }, true);\n },\n // Map skew to transform\n skew: function (x, y, cx, cy) {\n return arguments.length === 1 || arguments.length === 3 ? this.transform({\n skew: x,\n ox: y,\n oy: cx\n }, true) : this.transform({\n skew: [x, y],\n ox: cx,\n oy: cy\n }, true);\n },\n shear: function (lam, cx, cy) {\n return this.transform({\n shear: lam,\n ox: cx,\n oy: cy\n }, true);\n },\n // Map scale to transform\n scale: function (x, y, cx, cy) {\n return arguments.length === 1 || arguments.length === 3 ? this.transform({\n scale: x,\n ox: y,\n oy: cx\n }, true) : this.transform({\n scale: [x, y],\n ox: cx,\n oy: cy\n }, true);\n },\n // Map translate to transform\n translate: function (x, y) {\n return this.transform({\n translate: [x, y]\n }, true);\n },\n // Map relative translations to transform\n relative: function (x, y) {\n return this.transform({\n relative: [x, y]\n }, true);\n },\n // Map flip to transform\n flip: function (direction = 'both', origin = 'center') {\n if ('xybothtrue'.indexOf(direction) === -1) {\n origin = direction;\n direction = 'both';\n }\n\n return this.transform({\n flip: direction,\n origin: origin\n }, true);\n },\n // Opacity\n opacity: function (value) {\n return this.attr('opacity', value);\n }\n});\nregisterMethods('radius', {\n // Add x and y radius\n radius: function (x, y = x) {\n const type = (this._element || this).type;\n return type === 'radialGradient' ? this.attr('r', new SVGNumber(x)) : this.rx(x).ry(y);\n }\n});\nregisterMethods('Path', {\n // Get path length\n length: function () {\n return this.node.getTotalLength();\n },\n // Get point at length\n pointAt: function (length) {\n return new Point(this.node.getPointAtLength(length));\n }\n});\nregisterMethods(['Element', 'Runner'], {\n // Set font\n font: function (a, v) {\n if (typeof a === 'object') {\n for (v in a) this.font(v, a[v]);\n\n return this;\n }\n\n return a === 'leading' ? this.leading(v) : a === 'anchor' ? this.attr('text-anchor', v) : a === 'size' || a === 'family' || a === 'weight' || a === 'stretch' || a === 'variant' || a === 'style' ? this.attr('font-' + a, v) : this.attr(a, v);\n }\n}); // Add events to elements\n\nconst methods = ['click', 'dblclick', 'mousedown', 'mouseup', 'mouseover', 'mouseout', 'mousemove', 'mouseenter', 'mouseleave', 'touchstart', 'touchmove', 'touchleave', 'touchend', 'touchcancel'].reduce(function (last, event) {\n // add event to Element\n const fn = function (f) {\n if (f === null) {\n this.off(event);\n } else {\n this.on(event, f);\n }\n\n return this;\n };\n\n last[event] = fn;\n return last;\n}, {});\nregisterMethods('Element', methods);\n\nfunction untransform() {\n return this.attr('transform', null);\n} // merge the whole transformation chain into one matrix and returns it\n\nfunction matrixify() {\n const matrix = (this.attr('transform') || ''). // split transformations\n split(transforms).slice(0, -1).map(function (str) {\n // generate key => value pairs\n const kv = str.trim().split('(');\n return [kv[0], kv[1].split(delimiter).map(function (str) {\n return parseFloat(str);\n })];\n }).reverse() // merge every transformation into one matrix\n .reduce(function (matrix, transform) {\n if (transform[0] === 'matrix') {\n return matrix.lmultiply(Matrix.fromArray(transform[1]));\n }\n\n return matrix[transform[0]].apply(matrix, transform[1]);\n }, new Matrix());\n return matrix;\n} // add an element to another parent without changing the visual representation on the screen\n\nfunction toParent(parent, i) {\n if (this === parent) return this;\n const ctm = this.screenCTM();\n const pCtm = parent.screenCTM().inverse();\n this.addTo(parent, i).untransform().transform(pCtm.multiply(ctm));\n return this;\n} // same as above with parent equals root-svg\n\nfunction toRoot(i) {\n return this.toParent(this.root(), i);\n} // Add transformations\n\nfunction transform(o, relative) {\n // Act as a getter if no object was passed\n if (o == null || typeof o === 'string') {\n const decomposed = new Matrix(this).decompose();\n return o == null ? decomposed : decomposed[o];\n }\n\n if (!Matrix.isMatrixLike(o)) {\n // Set the origin according to the defined transform\n o = { ...o,\n origin: getOrigin(o, this)\n };\n } // The user can pass a boolean, an Element or an Matrix or nothing\n\n\n const cleanRelative = relative === true ? this : relative || false;\n const result = new Matrix(cleanRelative).transform(o);\n return this.attr('transform', result);\n}\nregisterMethods('Element', {\n untransform,\n matrixify,\n toParent,\n toRoot,\n transform\n});\n\nclass Container extends Element {\n flatten(parent = this, index) {\n this.each(function () {\n if (this instanceof Container) {\n return this.flatten().ungroup();\n }\n });\n return this;\n }\n\n ungroup(parent = this.parent(), index = parent.index(this)) {\n // when parent != this, we want append all elements to the end\n index = index === -1 ? parent.children().length : index;\n this.each(function (i, children) {\n // reverse each\n return children[children.length - i - 1].toParent(parent, index);\n });\n return this.remove();\n }\n\n}\nregister(Container, 'Container');\n\nclass Defs extends Container {\n constructor(node, attrs = node) {\n super(nodeOrNew('defs', node), attrs);\n }\n\n flatten() {\n return this;\n }\n\n ungroup() {\n return this;\n }\n\n}\nregister(Defs, 'Defs');\n\nclass Shape extends Element {}\nregister(Shape, 'Shape');\n\nfunction rx(rx) {\n return this.attr('rx', rx);\n} // Radius y value\n\nfunction ry(ry) {\n return this.attr('ry', ry);\n} // Move over x-axis\n\nfunction x$3(x) {\n return x == null ? this.cx() - this.rx() : this.cx(x + this.rx());\n} // Move over y-axis\n\nfunction y$3(y) {\n return y == null ? this.cy() - this.ry() : this.cy(y + this.ry());\n} // Move by center over x-axis\n\nfunction cx$1(x) {\n return this.attr('cx', x);\n} // Move by center over y-axis\n\nfunction cy$1(y) {\n return this.attr('cy', y);\n} // Set width of element\n\nfunction width$2(width) {\n return width == null ? this.rx() * 2 : this.rx(new SVGNumber(width).divide(2));\n} // Set height of element\n\nfunction height$2(height) {\n return height == null ? this.ry() * 2 : this.ry(new SVGNumber(height).divide(2));\n}\n\nvar circled = {\n __proto__: null,\n rx: rx,\n ry: ry,\n x: x$3,\n y: y$3,\n cx: cx$1,\n cy: cy$1,\n width: width$2,\n height: height$2\n};\n\nclass Ellipse extends Shape {\n constructor(node, attrs = node) {\n super(nodeOrNew('ellipse', node), attrs);\n }\n\n size(width, height) {\n const p = proportionalSize(this, width, height);\n return this.rx(new SVGNumber(p.width).divide(2)).ry(new SVGNumber(p.height).divide(2));\n }\n\n}\nextend(Ellipse, circled);\nregisterMethods('Container', {\n // Create an ellipse\n ellipse: wrapWithAttrCheck(function (width = 0, height = width) {\n return this.put(new Ellipse()).size(width, height).move(0, 0);\n })\n});\nregister(Ellipse, 'Ellipse');\n\nclass Fragment extends Dom {\n constructor(node = globals.document.createDocumentFragment()) {\n super(node);\n } // Import / Export raw xml\n\n\n xml(xmlOrFn, outerXML, ns) {\n if (typeof xmlOrFn === 'boolean') {\n ns = outerXML;\n outerXML = xmlOrFn;\n xmlOrFn = null;\n } // because this is a fragment we have to put all elements into a wrapper first\n // before we can get the innerXML from it\n\n\n if (xmlOrFn == null || typeof xmlOrFn === 'function') {\n const wrapper = new Dom(create('wrapper', ns));\n wrapper.add(this.node.cloneNode(true));\n return wrapper.xml(false, ns);\n } // Act as setter if we got a string\n\n\n return super.xml(xmlOrFn, false, ns);\n }\n\n}\n\nregister(Fragment, 'Fragment');\n\nfunction from(x, y) {\n return (this._element || this).type === 'radialGradient' ? this.attr({\n fx: new SVGNumber(x),\n fy: new SVGNumber(y)\n }) : this.attr({\n x1: new SVGNumber(x),\n y1: new SVGNumber(y)\n });\n}\nfunction to(x, y) {\n return (this._element || this).type === 'radialGradient' ? this.attr({\n cx: new SVGNumber(x),\n cy: new SVGNumber(y)\n }) : this.attr({\n x2: new SVGNumber(x),\n y2: new SVGNumber(y)\n });\n}\n\nvar gradiented = {\n __proto__: null,\n from: from,\n to: to\n};\n\nclass Gradient extends Container {\n constructor(type, attrs) {\n super(nodeOrNew(type + 'Gradient', typeof type === 'string' ? null : type), attrs);\n } // custom attr to handle transform\n\n\n attr(a, b, c) {\n if (a === 'transform') a = 'gradientTransform';\n return super.attr(a, b, c);\n }\n\n bbox() {\n return new Box();\n }\n\n targets() {\n return baseFind('svg [fill*=\"' + this.id() + '\"]');\n } // Alias string conversion to fill\n\n\n toString() {\n return this.url();\n } // Update gradient\n\n\n update(block) {\n // remove all stops\n this.clear(); // invoke passed block\n\n if (typeof block === 'function') {\n block.call(this, this);\n }\n\n return this;\n } // Return the fill id\n\n\n url() {\n return 'url(\"#' + this.id() + '\")';\n }\n\n}\nextend(Gradient, gradiented);\nregisterMethods({\n Container: {\n // Create gradient element in defs\n gradient(...args) {\n return this.defs().gradient(...args);\n }\n\n },\n // define gradient\n Defs: {\n gradient: wrapWithAttrCheck(function (type, block) {\n return this.put(new Gradient(type)).update(block);\n })\n }\n});\nregister(Gradient, 'Gradient');\n\nclass Pattern extends Container {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('pattern', node), attrs);\n } // custom attr to handle transform\n\n\n attr(a, b, c) {\n if (a === 'transform') a = 'patternTransform';\n return super.attr(a, b, c);\n }\n\n bbox() {\n return new Box();\n }\n\n targets() {\n return baseFind('svg [fill*=\"' + this.id() + '\"]');\n } // Alias string conversion to fill\n\n\n toString() {\n return this.url();\n } // Update pattern by rebuilding\n\n\n update(block) {\n // remove content\n this.clear(); // invoke passed block\n\n if (typeof block === 'function') {\n block.call(this, this);\n }\n\n return this;\n } // Return the fill id\n\n\n url() {\n return 'url(\"#' + this.id() + '\")';\n }\n\n}\nregisterMethods({\n Container: {\n // Create pattern element in defs\n pattern(...args) {\n return this.defs().pattern(...args);\n }\n\n },\n Defs: {\n pattern: wrapWithAttrCheck(function (width, height, block) {\n return this.put(new Pattern()).update(block).attr({\n x: 0,\n y: 0,\n width: width,\n height: height,\n patternUnits: 'userSpaceOnUse'\n });\n })\n }\n});\nregister(Pattern, 'Pattern');\n\nclass Image extends Shape {\n constructor(node, attrs = node) {\n super(nodeOrNew('image', node), attrs);\n } // (re)load image\n\n\n load(url, callback) {\n if (!url) return this;\n const img = new globals.window.Image();\n on(img, 'load', function (e) {\n const p = this.parent(Pattern); // ensure image size\n\n if (this.width() === 0 && this.height() === 0) {\n this.size(img.width, img.height);\n }\n\n if (p instanceof Pattern) {\n // ensure pattern size if not set\n if (p.width() === 0 && p.height() === 0) {\n p.size(this.width(), this.height());\n }\n }\n\n if (typeof callback === 'function') {\n callback.call(this, e);\n }\n }, this);\n on(img, 'load error', function () {\n // dont forget to unbind memory leaking events\n off(img);\n });\n return this.attr('href', img.src = url, xlink);\n }\n\n}\nregisterAttrHook(function (attr, val, _this) {\n // convert image fill and stroke to patterns\n if (attr === 'fill' || attr === 'stroke') {\n if (isImage.test(val)) {\n val = _this.root().defs().image(val);\n }\n }\n\n if (val instanceof Image) {\n val = _this.root().defs().pattern(0, 0, pattern => {\n pattern.add(val);\n });\n }\n\n return val;\n});\nregisterMethods({\n Container: {\n // create image element, load image and set its size\n image: wrapWithAttrCheck(function (source, callback) {\n return this.put(new Image()).size(0, 0).load(source, callback);\n })\n }\n});\nregister(Image, 'Image');\n\nclass PointArray extends SVGArray {\n // Get bounding box of points\n bbox() {\n let maxX = -Infinity;\n let maxY = -Infinity;\n let minX = Infinity;\n let minY = Infinity;\n this.forEach(function (el) {\n maxX = Math.max(el[0], maxX);\n maxY = Math.max(el[1], maxY);\n minX = Math.min(el[0], minX);\n minY = Math.min(el[1], minY);\n });\n return new Box(minX, minY, maxX - minX, maxY - minY);\n } // Move point string\n\n\n move(x, y) {\n const box = this.bbox(); // get relative offset\n\n x -= box.x;\n y -= box.y; // move every point\n\n if (!isNaN(x) && !isNaN(y)) {\n for (let i = this.length - 1; i >= 0; i--) {\n this[i] = [this[i][0] + x, this[i][1] + y];\n }\n }\n\n return this;\n } // Parse point string and flat array\n\n\n parse(array = [0, 0]) {\n const points = []; // if it is an array, we flatten it and therefore clone it to 1 depths\n\n if (array instanceof Array) {\n array = Array.prototype.concat.apply([], array);\n } else {\n // Else, it is considered as a string\n // parse points\n array = array.trim().split(delimiter).map(parseFloat);\n } // validate points - https://svgwg.org/svg2-draft/shapes.html#DataTypePoints\n // Odd number of coordinates is an error. In such cases, drop the last odd coordinate.\n\n\n if (array.length % 2 !== 0) array.pop(); // wrap points in two-tuples\n\n for (let i = 0, len = array.length; i < len; i = i + 2) {\n points.push([array[i], array[i + 1]]);\n }\n\n return points;\n } // Resize poly string\n\n\n size(width, height) {\n let i;\n const box = this.bbox(); // recalculate position of all points according to new size\n\n for (i = this.length - 1; i >= 0; i--) {\n if (box.width) this[i][0] = (this[i][0] - box.x) * width / box.width + box.x;\n if (box.height) this[i][1] = (this[i][1] - box.y) * height / box.height + box.y;\n }\n\n return this;\n } // Convert array to line object\n\n\n toLine() {\n return {\n x1: this[0][0],\n y1: this[0][1],\n x2: this[1][0],\n y2: this[1][1]\n };\n } // Convert array to string\n\n\n toString() {\n const array = []; // convert to a poly point string\n\n for (let i = 0, il = this.length; i < il; i++) {\n array.push(this[i].join(','));\n }\n\n return array.join(' ');\n }\n\n transform(m) {\n return this.clone().transformO(m);\n } // transform points with matrix (similar to Point.transform)\n\n\n transformO(m) {\n if (!Matrix.isMatrixLike(m)) {\n m = new Matrix(m);\n }\n\n for (let i = this.length; i--;) {\n // Perform the matrix multiplication\n const [x, y] = this[i];\n this[i][0] = m.a * x + m.c * y + m.e;\n this[i][1] = m.b * x + m.d * y + m.f;\n }\n\n return this;\n }\n\n}\n\nconst MorphArray = PointArray; // Move by left top corner over x-axis\n\nfunction x$2(x) {\n return x == null ? this.bbox().x : this.move(x, this.bbox().y);\n} // Move by left top corner over y-axis\n\nfunction y$2(y) {\n return y == null ? this.bbox().y : this.move(this.bbox().x, y);\n} // Set width of element\n\nfunction width$1(width) {\n const b = this.bbox();\n return width == null ? b.width : this.size(width, b.height);\n} // Set height of element\n\nfunction height$1(height) {\n const b = this.bbox();\n return height == null ? b.height : this.size(b.width, height);\n}\n\nvar pointed = {\n __proto__: null,\n MorphArray: MorphArray,\n x: x$2,\n y: y$2,\n width: width$1,\n height: height$1\n};\n\nclass Line extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('line', node), attrs);\n } // Get array\n\n\n array() {\n return new PointArray([[this.attr('x1'), this.attr('y1')], [this.attr('x2'), this.attr('y2')]]);\n } // Move by left top corner\n\n\n move(x, y) {\n return this.attr(this.array().move(x, y).toLine());\n } // Overwrite native plot() method\n\n\n plot(x1, y1, x2, y2) {\n if (x1 == null) {\n return this.array();\n } else if (typeof y1 !== 'undefined') {\n x1 = {\n x1,\n y1,\n x2,\n y2\n };\n } else {\n x1 = new PointArray(x1).toLine();\n }\n\n return this.attr(x1);\n } // Set element size to given width and height\n\n\n size(width, height) {\n const p = proportionalSize(this, width, height);\n return this.attr(this.array().size(p.width, p.height).toLine());\n }\n\n}\nextend(Line, pointed);\nregisterMethods({\n Container: {\n // Create a line element\n line: wrapWithAttrCheck(function (...args) {\n // make sure plot is called as a setter\n // x1 is not necessarily a number, it can also be an array, a string and a PointArray\n return Line.prototype.plot.apply(this.put(new Line()), args[0] != null ? args : [0, 0, 0, 0]);\n })\n }\n});\nregister(Line, 'Line');\n\nclass Marker extends Container {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('marker', node), attrs);\n } // Set height of element\n\n\n height(height) {\n return this.attr('markerHeight', height);\n }\n\n orient(orient) {\n return this.attr('orient', orient);\n } // Set marker refX and refY\n\n\n ref(x, y) {\n return this.attr('refX', x).attr('refY', y);\n } // Return the fill id\n\n\n toString() {\n return 'url(#' + this.id() + ')';\n } // Update marker\n\n\n update(block) {\n // remove all content\n this.clear(); // invoke passed block\n\n if (typeof block === 'function') {\n block.call(this, this);\n }\n\n return this;\n } // Set width of element\n\n\n width(width) {\n return this.attr('markerWidth', width);\n }\n\n}\nregisterMethods({\n Container: {\n marker(...args) {\n // Create marker element in defs\n return this.defs().marker(...args);\n }\n\n },\n Defs: {\n // Create marker\n marker: wrapWithAttrCheck(function (width, height, block) {\n // Set default viewbox to match the width and height, set ref to cx and cy and set orient to auto\n return this.put(new Marker()).size(width, height).ref(width / 2, height / 2).viewbox(0, 0, width, height).attr('orient', 'auto').update(block);\n })\n },\n marker: {\n // Create and attach markers\n marker(marker, width, height, block) {\n let attr = ['marker']; // Build attribute name\n\n if (marker !== 'all') attr.push(marker);\n attr = attr.join('-'); // Set marker attribute\n\n marker = arguments[1] instanceof Marker ? arguments[1] : this.defs().marker(width, height, block);\n return this.attr(attr, marker);\n }\n\n }\n});\nregister(Marker, 'Marker');\n\n/***\r\nBase Class\r\n==========\r\nThe base stepper class that will be\r\n***/\n\nfunction makeSetterGetter(k, f) {\n return function (v) {\n if (v == null) return this[k];\n this[k] = v;\n if (f) f.call(this);\n return this;\n };\n}\n\nconst easing = {\n '-': function (pos) {\n return pos;\n },\n '<>': function (pos) {\n return -Math.cos(pos * Math.PI) / 2 + 0.5;\n },\n '>': function (pos) {\n return Math.sin(pos * Math.PI / 2);\n },\n '<': function (pos) {\n return -Math.cos(pos * Math.PI / 2) + 1;\n },\n bezier: function (x1, y1, x2, y2) {\n // see https://www.w3.org/TR/css-easing-1/#cubic-bezier-algo\n return function (t) {\n if (t < 0) {\n if (x1 > 0) {\n return y1 / x1 * t;\n } else if (x2 > 0) {\n return y2 / x2 * t;\n } else {\n return 0;\n }\n } else if (t > 1) {\n if (x2 < 1) {\n return (1 - y2) / (1 - x2) * t + (y2 - x2) / (1 - x2);\n } else if (x1 < 1) {\n return (1 - y1) / (1 - x1) * t + (y1 - x1) / (1 - x1);\n } else {\n return 1;\n }\n } else {\n return 3 * t * (1 - t) ** 2 * y1 + 3 * t ** 2 * (1 - t) * y2 + t ** 3;\n }\n };\n },\n // see https://www.w3.org/TR/css-easing-1/#step-timing-function-algo\n steps: function (steps, stepPosition = 'end') {\n // deal with \"jump-\" prefix\n stepPosition = stepPosition.split('-').reverse()[0];\n let jumps = steps;\n\n if (stepPosition === 'none') {\n --jumps;\n } else if (stepPosition === 'both') {\n ++jumps;\n } // The beforeFlag is essentially useless\n\n\n return (t, beforeFlag = false) => {\n // Step is called currentStep in referenced url\n let step = Math.floor(t * steps);\n const jumping = t * step % 1 === 0;\n\n if (stepPosition === 'start' || stepPosition === 'both') {\n ++step;\n }\n\n if (beforeFlag && jumping) {\n --step;\n }\n\n if (t >= 0 && step < 0) {\n step = 0;\n }\n\n if (t <= 1 && step > jumps) {\n step = jumps;\n }\n\n return step / jumps;\n };\n }\n};\nclass Stepper {\n done() {\n return false;\n }\n\n}\n/***\r\nEasing Functions\r\n================\r\n***/\n\nclass Ease extends Stepper {\n constructor(fn = timeline.ease) {\n super();\n this.ease = easing[fn] || fn;\n }\n\n step(from, to, pos) {\n if (typeof from !== 'number') {\n return pos < 1 ? from : to;\n }\n\n return from + (to - from) * this.ease(pos);\n }\n\n}\n/***\r\nController Types\r\n================\r\n***/\n\nclass Controller extends Stepper {\n constructor(fn) {\n super();\n this.stepper = fn;\n }\n\n done(c) {\n return c.done;\n }\n\n step(current, target, dt, c) {\n return this.stepper(current, target, dt, c);\n }\n\n}\n\nfunction recalculate() {\n // Apply the default parameters\n const duration = (this._duration || 500) / 1000;\n const overshoot = this._overshoot || 0; // Calculate the PID natural response\n\n const eps = 1e-10;\n const pi = Math.PI;\n const os = Math.log(overshoot / 100 + eps);\n const zeta = -os / Math.sqrt(pi * pi + os * os);\n const wn = 3.9 / (zeta * duration); // Calculate the Spring values\n\n this.d = 2 * zeta * wn;\n this.k = wn * wn;\n}\n\nclass Spring extends Controller {\n constructor(duration = 500, overshoot = 0) {\n super();\n this.duration(duration).overshoot(overshoot);\n }\n\n step(current, target, dt, c) {\n if (typeof current === 'string') return current;\n c.done = dt === Infinity;\n if (dt === Infinity) return target;\n if (dt === 0) return current;\n if (dt > 100) dt = 16;\n dt /= 1000; // Get the previous velocity\n\n const velocity = c.velocity || 0; // Apply the control to get the new position and store it\n\n const acceleration = -this.d * velocity - this.k * (current - target);\n const newPosition = current + velocity * dt + acceleration * dt * dt / 2; // Store the velocity\n\n c.velocity = velocity + acceleration * dt; // Figure out if we have converged, and if so, pass the value\n\n c.done = Math.abs(target - newPosition) + Math.abs(velocity) < 0.002;\n return c.done ? target : newPosition;\n }\n\n}\nextend(Spring, {\n duration: makeSetterGetter('_duration', recalculate),\n overshoot: makeSetterGetter('_overshoot', recalculate)\n});\nclass PID extends Controller {\n constructor(p = 0.1, i = 0.01, d = 0, windup = 1000) {\n super();\n this.p(p).i(i).d(d).windup(windup);\n }\n\n step(current, target, dt, c) {\n if (typeof current === 'string') return current;\n c.done = dt === Infinity;\n if (dt === Infinity) return target;\n if (dt === 0) return current;\n const p = target - current;\n let i = (c.integral || 0) + p * dt;\n const d = (p - (c.error || 0)) / dt;\n const windup = this._windup; // antiwindup\n\n if (windup !== false) {\n i = Math.max(-windup, Math.min(i, windup));\n }\n\n c.error = p;\n c.integral = i;\n c.done = Math.abs(p) < 0.001;\n return c.done ? target : current + (this.P * p + this.I * i + this.D * d);\n }\n\n}\nextend(PID, {\n windup: makeSetterGetter('_windup'),\n p: makeSetterGetter('P'),\n i: makeSetterGetter('I'),\n d: makeSetterGetter('D')\n});\n\nconst segmentParameters = {\n M: 2,\n L: 2,\n H: 1,\n V: 1,\n C: 6,\n S: 4,\n Q: 4,\n T: 2,\n A: 7,\n Z: 0\n};\nconst pathHandlers = {\n M: function (c, p, p0) {\n p.x = p0.x = c[0];\n p.y = p0.y = c[1];\n return ['M', p.x, p.y];\n },\n L: function (c, p) {\n p.x = c[0];\n p.y = c[1];\n return ['L', c[0], c[1]];\n },\n H: function (c, p) {\n p.x = c[0];\n return ['H', c[0]];\n },\n V: function (c, p) {\n p.y = c[0];\n return ['V', c[0]];\n },\n C: function (c, p) {\n p.x = c[4];\n p.y = c[5];\n return ['C', c[0], c[1], c[2], c[3], c[4], c[5]];\n },\n S: function (c, p) {\n p.x = c[2];\n p.y = c[3];\n return ['S', c[0], c[1], c[2], c[3]];\n },\n Q: function (c, p) {\n p.x = c[2];\n p.y = c[3];\n return ['Q', c[0], c[1], c[2], c[3]];\n },\n T: function (c, p) {\n p.x = c[0];\n p.y = c[1];\n return ['T', c[0], c[1]];\n },\n Z: function (c, p, p0) {\n p.x = p0.x;\n p.y = p0.y;\n return ['Z'];\n },\n A: function (c, p) {\n p.x = c[5];\n p.y = c[6];\n return ['A', c[0], c[1], c[2], c[3], c[4], c[5], c[6]];\n }\n};\nconst mlhvqtcsaz = 'mlhvqtcsaz'.split('');\n\nfor (let i = 0, il = mlhvqtcsaz.length; i < il; ++i) {\n pathHandlers[mlhvqtcsaz[i]] = function (i) {\n return function (c, p, p0) {\n if (i === 'H') c[0] = c[0] + p.x;else if (i === 'V') c[0] = c[0] + p.y;else if (i === 'A') {\n c[5] = c[5] + p.x;\n c[6] = c[6] + p.y;\n } else {\n for (let j = 0, jl = c.length; j < jl; ++j) {\n c[j] = c[j] + (j % 2 ? p.y : p.x);\n }\n }\n return pathHandlers[i](c, p, p0);\n };\n }(mlhvqtcsaz[i].toUpperCase());\n}\n\nfunction makeAbsolut(parser) {\n const command = parser.segment[0];\n return pathHandlers[command](parser.segment.slice(1), parser.p, parser.p0);\n}\n\nfunction segmentComplete(parser) {\n return parser.segment.length && parser.segment.length - 1 === segmentParameters[parser.segment[0].toUpperCase()];\n}\n\nfunction startNewSegment(parser, token) {\n parser.inNumber && finalizeNumber(parser, false);\n const pathLetter = isPathLetter.test(token);\n\n if (pathLetter) {\n parser.segment = [token];\n } else {\n const lastCommand = parser.lastCommand;\n const small = lastCommand.toLowerCase();\n const isSmall = lastCommand === small;\n parser.segment = [small === 'm' ? isSmall ? 'l' : 'L' : lastCommand];\n }\n\n parser.inSegment = true;\n parser.lastCommand = parser.segment[0];\n return pathLetter;\n}\n\nfunction finalizeNumber(parser, inNumber) {\n if (!parser.inNumber) throw new Error('Parser Error');\n parser.number && parser.segment.push(parseFloat(parser.number));\n parser.inNumber = inNumber;\n parser.number = '';\n parser.pointSeen = false;\n parser.hasExponent = false;\n\n if (segmentComplete(parser)) {\n finalizeSegment(parser);\n }\n}\n\nfunction finalizeSegment(parser) {\n parser.inSegment = false;\n\n if (parser.absolute) {\n parser.segment = makeAbsolut(parser);\n }\n\n parser.segments.push(parser.segment);\n}\n\nfunction isArcFlag(parser) {\n if (!parser.segment.length) return false;\n const isArc = parser.segment[0].toUpperCase() === 'A';\n const length = parser.segment.length;\n return isArc && (length === 4 || length === 5);\n}\n\nfunction isExponential(parser) {\n return parser.lastToken.toUpperCase() === 'E';\n}\n\nfunction pathParser(d, toAbsolute = true) {\n let index = 0;\n let token = '';\n const parser = {\n segment: [],\n inNumber: false,\n number: '',\n lastToken: '',\n inSegment: false,\n segments: [],\n pointSeen: false,\n hasExponent: false,\n absolute: toAbsolute,\n p0: new Point(),\n p: new Point()\n };\n\n while (parser.lastToken = token, token = d.charAt(index++)) {\n if (!parser.inSegment) {\n if (startNewSegment(parser, token)) {\n continue;\n }\n }\n\n if (token === '.') {\n if (parser.pointSeen || parser.hasExponent) {\n finalizeNumber(parser, false);\n --index;\n continue;\n }\n\n parser.inNumber = true;\n parser.pointSeen = true;\n parser.number += token;\n continue;\n }\n\n if (!isNaN(parseInt(token))) {\n if (parser.number === '0' || isArcFlag(parser)) {\n parser.inNumber = true;\n parser.number = token;\n finalizeNumber(parser, true);\n continue;\n }\n\n parser.inNumber = true;\n parser.number += token;\n continue;\n }\n\n if (token === ' ' || token === ',') {\n if (parser.inNumber) {\n finalizeNumber(parser, false);\n }\n\n continue;\n }\n\n if (token === '-') {\n if (parser.inNumber && !isExponential(parser)) {\n finalizeNumber(parser, false);\n --index;\n continue;\n }\n\n parser.number += token;\n parser.inNumber = true;\n continue;\n }\n\n if (token.toUpperCase() === 'E') {\n parser.number += token;\n parser.hasExponent = true;\n continue;\n }\n\n if (isPathLetter.test(token)) {\n if (parser.inNumber) {\n finalizeNumber(parser, false);\n } else if (!segmentComplete(parser)) {\n throw new Error('parser Error');\n } else {\n finalizeSegment(parser);\n }\n\n --index;\n }\n }\n\n if (parser.inNumber) {\n finalizeNumber(parser, false);\n }\n\n if (parser.inSegment && segmentComplete(parser)) {\n finalizeSegment(parser);\n }\n\n return parser.segments;\n}\n\nfunction arrayToString(a) {\n let s = '';\n\n for (let i = 0, il = a.length; i < il; i++) {\n s += a[i][0];\n\n if (a[i][1] != null) {\n s += a[i][1];\n\n if (a[i][2] != null) {\n s += ' ';\n s += a[i][2];\n\n if (a[i][3] != null) {\n s += ' ';\n s += a[i][3];\n s += ' ';\n s += a[i][4];\n\n if (a[i][5] != null) {\n s += ' ';\n s += a[i][5];\n s += ' ';\n s += a[i][6];\n\n if (a[i][7] != null) {\n s += ' ';\n s += a[i][7];\n }\n }\n }\n }\n }\n }\n\n return s + ' ';\n}\n\nclass PathArray extends SVGArray {\n // Get bounding box of path\n bbox() {\n parser().path.setAttribute('d', this.toString());\n return new Box(parser.nodes.path.getBBox());\n } // Move path string\n\n\n move(x, y) {\n // get bounding box of current situation\n const box = this.bbox(); // get relative offset\n\n x -= box.x;\n y -= box.y;\n\n if (!isNaN(x) && !isNaN(y)) {\n // move every point\n for (let l, i = this.length - 1; i >= 0; i--) {\n l = this[i][0];\n\n if (l === 'M' || l === 'L' || l === 'T') {\n this[i][1] += x;\n this[i][2] += y;\n } else if (l === 'H') {\n this[i][1] += x;\n } else if (l === 'V') {\n this[i][1] += y;\n } else if (l === 'C' || l === 'S' || l === 'Q') {\n this[i][1] += x;\n this[i][2] += y;\n this[i][3] += x;\n this[i][4] += y;\n\n if (l === 'C') {\n this[i][5] += x;\n this[i][6] += y;\n }\n } else if (l === 'A') {\n this[i][6] += x;\n this[i][7] += y;\n }\n }\n }\n\n return this;\n } // Absolutize and parse path to array\n\n\n parse(d = 'M0 0') {\n if (Array.isArray(d)) {\n d = Array.prototype.concat.apply([], d).toString();\n }\n\n return pathParser(d);\n } // Resize path string\n\n\n size(width, height) {\n // get bounding box of current situation\n const box = this.bbox();\n let i, l; // If the box width or height is 0 then we ignore\n // transformations on the respective axis\n\n box.width = box.width === 0 ? 1 : box.width;\n box.height = box.height === 0 ? 1 : box.height; // recalculate position of all points according to new size\n\n for (i = this.length - 1; i >= 0; i--) {\n l = this[i][0];\n\n if (l === 'M' || l === 'L' || l === 'T') {\n this[i][1] = (this[i][1] - box.x) * width / box.width + box.x;\n this[i][2] = (this[i][2] - box.y) * height / box.height + box.y;\n } else if (l === 'H') {\n this[i][1] = (this[i][1] - box.x) * width / box.width + box.x;\n } else if (l === 'V') {\n this[i][1] = (this[i][1] - box.y) * height / box.height + box.y;\n } else if (l === 'C' || l === 'S' || l === 'Q') {\n this[i][1] = (this[i][1] - box.x) * width / box.width + box.x;\n this[i][2] = (this[i][2] - box.y) * height / box.height + box.y;\n this[i][3] = (this[i][3] - box.x) * width / box.width + box.x;\n this[i][4] = (this[i][4] - box.y) * height / box.height + box.y;\n\n if (l === 'C') {\n this[i][5] = (this[i][5] - box.x) * width / box.width + box.x;\n this[i][6] = (this[i][6] - box.y) * height / box.height + box.y;\n }\n } else if (l === 'A') {\n // resize radii\n this[i][1] = this[i][1] * width / box.width;\n this[i][2] = this[i][2] * height / box.height; // move position values\n\n this[i][6] = (this[i][6] - box.x) * width / box.width + box.x;\n this[i][7] = (this[i][7] - box.y) * height / box.height + box.y;\n }\n }\n\n return this;\n } // Convert array to string\n\n\n toString() {\n return arrayToString(this);\n }\n\n}\n\nconst getClassForType = value => {\n const type = typeof value;\n\n if (type === 'number') {\n return SVGNumber;\n } else if (type === 'string') {\n if (Color.isColor(value)) {\n return Color;\n } else if (delimiter.test(value)) {\n return isPathLetter.test(value) ? PathArray : SVGArray;\n } else if (numberAndUnit.test(value)) {\n return SVGNumber;\n } else {\n return NonMorphable;\n }\n } else if (morphableTypes.indexOf(value.constructor) > -1) {\n return value.constructor;\n } else if (Array.isArray(value)) {\n return SVGArray;\n } else if (type === 'object') {\n return ObjectBag;\n } else {\n return NonMorphable;\n }\n};\n\nclass Morphable {\n constructor(stepper) {\n this._stepper = stepper || new Ease('-');\n this._from = null;\n this._to = null;\n this._type = null;\n this._context = null;\n this._morphObj = null;\n }\n\n at(pos) {\n const _this = this;\n\n return this._morphObj.fromArray(this._from.map(function (i, index) {\n return _this._stepper.step(i, _this._to[index], pos, _this._context[index], _this._context);\n }));\n }\n\n done() {\n const complete = this._context.map(this._stepper.done).reduce(function (last, curr) {\n return last && curr;\n }, true);\n\n return complete;\n }\n\n from(val) {\n if (val == null) {\n return this._from;\n }\n\n this._from = this._set(val);\n return this;\n }\n\n stepper(stepper) {\n if (stepper == null) return this._stepper;\n this._stepper = stepper;\n return this;\n }\n\n to(val) {\n if (val == null) {\n return this._to;\n }\n\n this._to = this._set(val);\n return this;\n }\n\n type(type) {\n // getter\n if (type == null) {\n return this._type;\n } // setter\n\n\n this._type = type;\n return this;\n }\n\n _set(value) {\n if (!this._type) {\n this.type(getClassForType(value));\n }\n\n let result = new this._type(value);\n\n if (this._type === Color) {\n result = this._to ? result[this._to[4]]() : this._from ? result[this._from[4]]() : result;\n }\n\n if (this._type === ObjectBag) {\n result = this._to ? result.align(this._to) : this._from ? result.align(this._from) : result;\n }\n\n result = result.toArray();\n this._morphObj = this._morphObj || new this._type();\n this._context = this._context || Array.apply(null, Array(result.length)).map(Object).map(function (o) {\n o.done = true;\n return o;\n });\n return result;\n }\n\n}\nclass NonMorphable {\n constructor(...args) {\n this.init(...args);\n }\n\n init(val) {\n val = Array.isArray(val) ? val[0] : val;\n this.value = val;\n return this;\n }\n\n toArray() {\n return [this.value];\n }\n\n valueOf() {\n return this.value;\n }\n\n}\nclass TransformBag {\n constructor(...args) {\n this.init(...args);\n }\n\n init(obj) {\n if (Array.isArray(obj)) {\n obj = {\n scaleX: obj[0],\n scaleY: obj[1],\n shear: obj[2],\n rotate: obj[3],\n translateX: obj[4],\n translateY: obj[5],\n originX: obj[6],\n originY: obj[7]\n };\n }\n\n Object.assign(this, TransformBag.defaults, obj);\n return this;\n }\n\n toArray() {\n const v = this;\n return [v.scaleX, v.scaleY, v.shear, v.rotate, v.translateX, v.translateY, v.originX, v.originY];\n }\n\n}\nTransformBag.defaults = {\n scaleX: 1,\n scaleY: 1,\n shear: 0,\n rotate: 0,\n translateX: 0,\n translateY: 0,\n originX: 0,\n originY: 0\n};\n\nconst sortByKey = (a, b) => {\n return a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : 0;\n};\n\nclass ObjectBag {\n constructor(...args) {\n this.init(...args);\n }\n\n align(other) {\n for (let i = 0, il = this.values.length; i < il; ++i) {\n if (this.values[i] === Color) {\n const space = other[i + 6];\n const color = new Color(this.values.splice(i + 2, 5))[space]().toArray();\n this.values.splice(i + 2, 0, ...color);\n }\n }\n\n return this;\n }\n\n init(objOrArr) {\n this.values = [];\n\n if (Array.isArray(objOrArr)) {\n this.values = objOrArr.slice();\n return;\n }\n\n objOrArr = objOrArr || {};\n const entries = [];\n\n for (const i in objOrArr) {\n const Type = getClassForType(objOrArr[i]);\n const val = new Type(objOrArr[i]).toArray();\n entries.push([i, Type, val.length, ...val]);\n }\n\n entries.sort(sortByKey);\n this.values = entries.reduce((last, curr) => last.concat(curr), []);\n return this;\n }\n\n toArray() {\n return this.values;\n }\n\n valueOf() {\n const obj = {};\n const arr = this.values; // for (var i = 0, len = arr.length; i < len; i += 2) {\n\n while (arr.length) {\n const key = arr.shift();\n const Type = arr.shift();\n const num = arr.shift();\n const values = arr.splice(0, num);\n obj[key] = new Type(values).valueOf();\n }\n\n return obj;\n }\n\n}\nconst morphableTypes = [NonMorphable, TransformBag, ObjectBag];\nfunction registerMorphableType(type = []) {\n morphableTypes.push(...[].concat(type));\n}\nfunction makeMorphable() {\n extend(morphableTypes, {\n to(val) {\n return new Morphable().type(this.constructor).from(this.valueOf()).to(val);\n },\n\n fromArray(arr) {\n this.init(arr);\n return this;\n }\n\n });\n}\n\nclass Path extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('path', node), attrs);\n } // Get array\n\n\n array() {\n return this._array || (this._array = new PathArray(this.attr('d')));\n } // Clear array cache\n\n\n clear() {\n delete this._array;\n return this;\n } // Set height of element\n\n\n height(height) {\n return height == null ? this.bbox().height : this.size(this.bbox().width, height);\n } // Move by left top corner\n\n\n move(x, y) {\n return this.attr('d', this.array().move(x, y));\n } // Plot new path\n\n\n plot(d) {\n return d == null ? this.array() : this.clear().attr('d', typeof d === 'string' ? d : this._array = new PathArray(d));\n } // Set element size to given width and height\n\n\n size(width, height) {\n const p = proportionalSize(this, width, height);\n return this.attr('d', this.array().size(p.width, p.height));\n } // Set width of element\n\n\n width(width) {\n return width == null ? this.bbox().width : this.size(width, this.bbox().height);\n } // Move by left top corner over x-axis\n\n\n x(x) {\n return x == null ? this.bbox().x : this.move(x, this.bbox().y);\n } // Move by left top corner over y-axis\n\n\n y(y) {\n return y == null ? this.bbox().y : this.move(this.bbox().x, y);\n }\n\n} // Define morphable array\n\nPath.prototype.MorphArray = PathArray; // Add parent method\n\nregisterMethods({\n Container: {\n // Create a wrapped path element\n path: wrapWithAttrCheck(function (d) {\n // make sure plot is called as a setter\n return this.put(new Path()).plot(d || new PathArray());\n })\n }\n});\nregister(Path, 'Path');\n\nfunction array() {\n return this._array || (this._array = new PointArray(this.attr('points')));\n} // Clear array cache\n\nfunction clear() {\n delete this._array;\n return this;\n} // Move by left top corner\n\nfunction move$2(x, y) {\n return this.attr('points', this.array().move(x, y));\n} // Plot new path\n\nfunction plot(p) {\n return p == null ? this.array() : this.clear().attr('points', typeof p === 'string' ? p : this._array = new PointArray(p));\n} // Set element size to given width and height\n\nfunction size$1(width, height) {\n const p = proportionalSize(this, width, height);\n return this.attr('points', this.array().size(p.width, p.height));\n}\n\nvar poly = {\n __proto__: null,\n array: array,\n clear: clear,\n move: move$2,\n plot: plot,\n size: size$1\n};\n\nclass Polygon extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('polygon', node), attrs);\n }\n\n}\nregisterMethods({\n Container: {\n // Create a wrapped polygon element\n polygon: wrapWithAttrCheck(function (p) {\n // make sure plot is called as a setter\n return this.put(new Polygon()).plot(p || new PointArray());\n })\n }\n});\nextend(Polygon, pointed);\nextend(Polygon, poly);\nregister(Polygon, 'Polygon');\n\nclass Polyline extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('polyline', node), attrs);\n }\n\n}\nregisterMethods({\n Container: {\n // Create a wrapped polygon element\n polyline: wrapWithAttrCheck(function (p) {\n // make sure plot is called as a setter\n return this.put(new Polyline()).plot(p || new PointArray());\n })\n }\n});\nextend(Polyline, pointed);\nextend(Polyline, poly);\nregister(Polyline, 'Polyline');\n\nclass Rect extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('rect', node), attrs);\n }\n\n}\nextend(Rect, {\n rx,\n ry\n});\nregisterMethods({\n Container: {\n // Create a rect element\n rect: wrapWithAttrCheck(function (width, height) {\n return this.put(new Rect()).size(width, height);\n })\n }\n});\nregister(Rect, 'Rect');\n\nclass Queue {\n constructor() {\n this._first = null;\n this._last = null;\n } // Shows us the first item in the list\n\n\n first() {\n return this._first && this._first.value;\n } // Shows us the last item in the list\n\n\n last() {\n return this._last && this._last.value;\n }\n\n push(value) {\n // An item stores an id and the provided value\n const item = typeof value.next !== 'undefined' ? value : {\n value: value,\n next: null,\n prev: null\n }; // Deal with the queue being empty or populated\n\n if (this._last) {\n item.prev = this._last;\n this._last.next = item;\n this._last = item;\n } else {\n this._last = item;\n this._first = item;\n } // Return the current item\n\n\n return item;\n } // Removes the item that was returned from the push\n\n\n remove(item) {\n // Relink the previous item\n if (item.prev) item.prev.next = item.next;\n if (item.next) item.next.prev = item.prev;\n if (item === this._last) this._last = item.prev;\n if (item === this._first) this._first = item.next; // Invalidate item\n\n item.prev = null;\n item.next = null;\n }\n\n shift() {\n // Check if we have a value\n const remove = this._first;\n if (!remove) return null; // If we do, remove it and relink things\n\n this._first = remove.next;\n if (this._first) this._first.prev = null;\n this._last = this._first ? this._last : null;\n return remove.value;\n }\n\n}\n\nconst Animator = {\n nextDraw: null,\n frames: new Queue(),\n timeouts: new Queue(),\n immediates: new Queue(),\n timer: () => globals.window.performance || globals.window.Date,\n transforms: [],\n\n frame(fn) {\n // Store the node\n const node = Animator.frames.push({\n run: fn\n }); // Request an animation frame if we don't have one\n\n if (Animator.nextDraw === null) {\n Animator.nextDraw = globals.window.requestAnimationFrame(Animator._draw);\n } // Return the node so we can remove it easily\n\n\n return node;\n },\n\n timeout(fn, delay) {\n delay = delay || 0; // Work out when the event should fire\n\n const time = Animator.timer().now() + delay; // Add the timeout to the end of the queue\n\n const node = Animator.timeouts.push({\n run: fn,\n time: time\n }); // Request another animation frame if we need one\n\n if (Animator.nextDraw === null) {\n Animator.nextDraw = globals.window.requestAnimationFrame(Animator._draw);\n }\n\n return node;\n },\n\n immediate(fn) {\n // Add the immediate fn to the end of the queue\n const node = Animator.immediates.push(fn); // Request another animation frame if we need one\n\n if (Animator.nextDraw === null) {\n Animator.nextDraw = globals.window.requestAnimationFrame(Animator._draw);\n }\n\n return node;\n },\n\n cancelFrame(node) {\n node != null && Animator.frames.remove(node);\n },\n\n clearTimeout(node) {\n node != null && Animator.timeouts.remove(node);\n },\n\n cancelImmediate(node) {\n node != null && Animator.immediates.remove(node);\n },\n\n _draw(now) {\n // Run all the timeouts we can run, if they are not ready yet, add them\n // to the end of the queue immediately! (bad timeouts!!! [sarcasm])\n let nextTimeout = null;\n const lastTimeout = Animator.timeouts.last();\n\n while (nextTimeout = Animator.timeouts.shift()) {\n // Run the timeout if its time, or push it to the end\n if (now >= nextTimeout.time) {\n nextTimeout.run();\n } else {\n Animator.timeouts.push(nextTimeout);\n } // If we hit the last item, we should stop shifting out more items\n\n\n if (nextTimeout === lastTimeout) break;\n } // Run all of the animation frames\n\n\n let nextFrame = null;\n const lastFrame = Animator.frames.last();\n\n while (nextFrame !== lastFrame && (nextFrame = Animator.frames.shift())) {\n nextFrame.run(now);\n }\n\n let nextImmediate = null;\n\n while (nextImmediate = Animator.immediates.shift()) {\n nextImmediate();\n } // If we have remaining timeouts or frames, draw until we don't anymore\n\n\n Animator.nextDraw = Animator.timeouts.first() || Animator.frames.first() ? globals.window.requestAnimationFrame(Animator._draw) : null;\n }\n\n};\n\nconst makeSchedule = function (runnerInfo) {\n const start = runnerInfo.start;\n const duration = runnerInfo.runner.duration();\n const end = start + duration;\n return {\n start: start,\n duration: duration,\n end: end,\n runner: runnerInfo.runner\n };\n};\n\nconst defaultSource = function () {\n const w = globals.window;\n return (w.performance || w.Date).now();\n};\n\nclass Timeline extends EventTarget {\n // Construct a new timeline on the given element\n constructor(timeSource = defaultSource) {\n super();\n this._timeSource = timeSource; // Store the timing variables\n\n this._startTime = 0;\n this._speed = 1.0; // Determines how long a runner is hold in memory. Can be a dt or true/false\n\n this._persist = 0; // Keep track of the running animations and their starting parameters\n\n this._nextFrame = null;\n this._paused = true;\n this._runners = [];\n this._runnerIds = [];\n this._lastRunnerId = -1;\n this._time = 0;\n this._lastSourceTime = 0;\n this._lastStepTime = 0; // Make sure that step is always called in class context\n\n this._step = this._stepFn.bind(this, false);\n this._stepImmediate = this._stepFn.bind(this, true);\n }\n\n active() {\n return !!this._nextFrame;\n }\n\n finish() {\n // Go to end and pause\n this.time(this.getEndTimeOfTimeline() + 1);\n return this.pause();\n } // Calculates the end of the timeline\n\n\n getEndTime() {\n const lastRunnerInfo = this.getLastRunnerInfo();\n const lastDuration = lastRunnerInfo ? lastRunnerInfo.runner.duration() : 0;\n const lastStartTime = lastRunnerInfo ? lastRunnerInfo.start : this._time;\n return lastStartTime + lastDuration;\n }\n\n getEndTimeOfTimeline() {\n const endTimes = this._runners.map(i => i.start + i.runner.duration());\n\n return Math.max(0, ...endTimes);\n }\n\n getLastRunnerInfo() {\n return this.getRunnerInfoById(this._lastRunnerId);\n }\n\n getRunnerInfoById(id) {\n return this._runners[this._runnerIds.indexOf(id)] || null;\n }\n\n pause() {\n this._paused = true;\n return this._continue();\n }\n\n persist(dtOrForever) {\n if (dtOrForever == null) return this._persist;\n this._persist = dtOrForever;\n return this;\n }\n\n play() {\n // Now make sure we are not paused and continue the animation\n this._paused = false;\n return this.updateTime()._continue();\n }\n\n reverse(yes) {\n const currentSpeed = this.speed();\n if (yes == null) return this.speed(-currentSpeed);\n const positive = Math.abs(currentSpeed);\n return this.speed(yes ? -positive : positive);\n } // schedules a runner on the timeline\n\n\n schedule(runner, delay, when) {\n if (runner == null) {\n return this._runners.map(makeSchedule);\n } // The start time for the next animation can either be given explicitly,\n // derived from the current timeline time or it can be relative to the\n // last start time to chain animations directly\n\n\n let absoluteStartTime = 0;\n const endTime = this.getEndTime();\n delay = delay || 0; // Work out when to start the animation\n\n if (when == null || when === 'last' || when === 'after') {\n // Take the last time and increment\n absoluteStartTime = endTime;\n } else if (when === 'absolute' || when === 'start') {\n absoluteStartTime = delay;\n delay = 0;\n } else if (when === 'now') {\n absoluteStartTime = this._time;\n } else if (when === 'relative') {\n const runnerInfo = this.getRunnerInfoById(runner.id);\n\n if (runnerInfo) {\n absoluteStartTime = runnerInfo.start + delay;\n delay = 0;\n }\n } else if (when === 'with-last') {\n const lastRunnerInfo = this.getLastRunnerInfo();\n const lastStartTime = lastRunnerInfo ? lastRunnerInfo.start : this._time;\n absoluteStartTime = lastStartTime;\n } else {\n throw new Error('Invalid value for the \"when\" parameter');\n } // Manage runner\n\n\n runner.unschedule();\n runner.timeline(this);\n const persist = runner.persist();\n const runnerInfo = {\n persist: persist === null ? this._persist : persist,\n start: absoluteStartTime + delay,\n runner\n };\n this._lastRunnerId = runner.id;\n\n this._runners.push(runnerInfo);\n\n this._runners.sort((a, b) => a.start - b.start);\n\n this._runnerIds = this._runners.map(info => info.runner.id);\n\n this.updateTime()._continue();\n\n return this;\n }\n\n seek(dt) {\n return this.time(this._time + dt);\n }\n\n source(fn) {\n if (fn == null) return this._timeSource;\n this._timeSource = fn;\n return this;\n }\n\n speed(speed) {\n if (speed == null) return this._speed;\n this._speed = speed;\n return this;\n }\n\n stop() {\n // Go to start and pause\n this.time(0);\n return this.pause();\n }\n\n time(time) {\n if (time == null) return this._time;\n this._time = time;\n return this._continue(true);\n } // Remove the runner from this timeline\n\n\n unschedule(runner) {\n const index = this._runnerIds.indexOf(runner.id);\n\n if (index < 0) return this;\n\n this._runners.splice(index, 1);\n\n this._runnerIds.splice(index, 1);\n\n runner.timeline(null);\n return this;\n } // Makes sure, that after pausing the time doesn't jump\n\n\n updateTime() {\n if (!this.active()) {\n this._lastSourceTime = this._timeSource();\n }\n\n return this;\n } // Checks if we are running and continues the animation\n\n\n _continue(immediateStep = false) {\n Animator.cancelFrame(this._nextFrame);\n this._nextFrame = null;\n if (immediateStep) return this._stepImmediate();\n if (this._paused) return this;\n this._nextFrame = Animator.frame(this._step);\n return this;\n }\n\n _stepFn(immediateStep = false) {\n // Get the time delta from the last time and update the time\n const time = this._timeSource();\n\n let dtSource = time - this._lastSourceTime;\n if (immediateStep) dtSource = 0;\n const dtTime = this._speed * dtSource + (this._time - this._lastStepTime);\n this._lastSourceTime = time; // Only update the time if we use the timeSource.\n // Otherwise use the current time\n\n if (!immediateStep) {\n // Update the time\n this._time += dtTime;\n this._time = this._time < 0 ? 0 : this._time;\n }\n\n this._lastStepTime = this._time;\n this.fire('time', this._time); // This is for the case that the timeline was seeked so that the time\n // is now before the startTime of the runner. Thats why we need to set\n // the runner to position 0\n // FIXME:\n // However, reseting in insertion order leads to bugs. Considering the case,\n // where 2 runners change the same attribute but in different times,\n // reseting both of them will lead to the case where the later defined\n // runner always wins the reset even if the other runner started earlier\n // and therefore should win the attribute battle\n // this can be solved by reseting them backwards\n\n for (let k = this._runners.length; k--;) {\n // Get and run the current runner and ignore it if its inactive\n const runnerInfo = this._runners[k];\n const runner = runnerInfo.runner; // Make sure that we give the actual difference\n // between runner start time and now\n\n const dtToStart = this._time - runnerInfo.start; // Dont run runner if not started yet\n // and try to reset it\n\n if (dtToStart <= 0) {\n runner.reset();\n }\n } // Run all of the runners directly\n\n\n let runnersLeft = false;\n\n for (let i = 0, len = this._runners.length; i < len; i++) {\n // Get and run the current runner and ignore it if its inactive\n const runnerInfo = this._runners[i];\n const runner = runnerInfo.runner;\n let dt = dtTime; // Make sure that we give the actual difference\n // between runner start time and now\n\n const dtToStart = this._time - runnerInfo.start; // Dont run runner if not started yet\n\n if (dtToStart <= 0) {\n runnersLeft = true;\n continue;\n } else if (dtToStart < dt) {\n // Adjust dt to make sure that animation is on point\n dt = dtToStart;\n }\n\n if (!runner.active()) continue; // If this runner is still going, signal that we need another animation\n // frame, otherwise, remove the completed runner\n\n const finished = runner.step(dt).done;\n\n if (!finished) {\n runnersLeft = true; // continue\n } else if (runnerInfo.persist !== true) {\n // runner is finished. And runner might get removed\n const endTime = runner.duration() - runner.time() + this._time;\n\n if (endTime + runnerInfo.persist < this._time) {\n // Delete runner and correct index\n runner.unschedule();\n --i;\n --len;\n }\n }\n } // Basically: we continue when there are runners right from us in time\n // when -->, and when runners are left from us when <--\n\n\n if (runnersLeft && !(this._speed < 0 && this._time === 0) || this._runnerIds.length && this._speed < 0 && this._time > 0) {\n this._continue();\n } else {\n this.pause();\n this.fire('finished');\n }\n\n return this;\n }\n\n}\nregisterMethods({\n Element: {\n timeline: function (timeline) {\n if (timeline == null) {\n this._timeline = this._timeline || new Timeline();\n return this._timeline;\n } else {\n this._timeline = timeline;\n return this;\n }\n }\n }\n});\n\nclass Runner extends EventTarget {\n constructor(options) {\n super(); // Store a unique id on the runner, so that we can identify it later\n\n this.id = Runner.id++; // Ensure a default value\n\n options = options == null ? timeline.duration : options; // Ensure that we get a controller\n\n options = typeof options === 'function' ? new Controller(options) : options; // Declare all of the variables\n\n this._element = null;\n this._timeline = null;\n this.done = false;\n this._queue = []; // Work out the stepper and the duration\n\n this._duration = typeof options === 'number' && options;\n this._isDeclarative = options instanceof Controller;\n this._stepper = this._isDeclarative ? options : new Ease(); // We copy the current values from the timeline because they can change\n\n this._history = {}; // Store the state of the runner\n\n this.enabled = true;\n this._time = 0;\n this._lastTime = 0; // At creation, the runner is in reseted state\n\n this._reseted = true; // Save transforms applied to this runner\n\n this.transforms = new Matrix();\n this.transformId = 1; // Looping variables\n\n this._haveReversed = false;\n this._reverse = false;\n this._loopsDone = 0;\n this._swing = false;\n this._wait = 0;\n this._times = 1;\n this._frameId = null; // Stores how long a runner is stored after beeing done\n\n this._persist = this._isDeclarative ? true : null;\n }\n\n static sanitise(duration, delay, when) {\n // Initialise the default parameters\n let times = 1;\n let swing = false;\n let wait = 0;\n duration = duration || timeline.duration;\n delay = delay || timeline.delay;\n when = when || 'last'; // If we have an object, unpack the values\n\n if (typeof duration === 'object' && !(duration instanceof Stepper)) {\n delay = duration.delay || delay;\n when = duration.when || when;\n swing = duration.swing || swing;\n times = duration.times || times;\n wait = duration.wait || wait;\n duration = duration.duration || timeline.duration;\n }\n\n return {\n duration: duration,\n delay: delay,\n swing: swing,\n times: times,\n wait: wait,\n when: when\n };\n }\n\n active(enabled) {\n if (enabled == null) return this.enabled;\n this.enabled = enabled;\n return this;\n }\n /*\r\n Private Methods\r\n ===============\r\n Methods that shouldn't be used externally\r\n */\n\n\n addTransform(transform, index) {\n this.transforms.lmultiplyO(transform);\n return this;\n }\n\n after(fn) {\n return this.on('finished', fn);\n }\n\n animate(duration, delay, when) {\n const o = Runner.sanitise(duration, delay, when);\n const runner = new Runner(o.duration);\n if (this._timeline) runner.timeline(this._timeline);\n if (this._element) runner.element(this._element);\n return runner.loop(o).schedule(o.delay, o.when);\n }\n\n clearTransform() {\n this.transforms = new Matrix();\n return this;\n } // TODO: Keep track of all transformations so that deletion is faster\n\n\n clearTransformsFromQueue() {\n if (!this.done || !this._timeline || !this._timeline._runnerIds.includes(this.id)) {\n this._queue = this._queue.filter(item => {\n return !item.isTransform;\n });\n }\n }\n\n delay(delay) {\n return this.animate(0, delay);\n }\n\n duration() {\n return this._times * (this._wait + this._duration) - this._wait;\n }\n\n during(fn) {\n return this.queue(null, fn);\n }\n\n ease(fn) {\n this._stepper = new Ease(fn);\n return this;\n }\n /*\r\n Runner Definitions\r\n ==================\r\n These methods help us define the runtime behaviour of the Runner or they\r\n help us make new runners from the current runner\r\n */\n\n\n element(element) {\n if (element == null) return this._element;\n this._element = element;\n\n element._prepareRunner();\n\n return this;\n }\n\n finish() {\n return this.step(Infinity);\n }\n\n loop(times, swing, wait) {\n // Deal with the user passing in an object\n if (typeof times === 'object') {\n swing = times.swing;\n wait = times.wait;\n times = times.times;\n } // Sanitise the values and store them\n\n\n this._times = times || Infinity;\n this._swing = swing || false;\n this._wait = wait || 0; // Allow true to be passed\n\n if (this._times === true) {\n this._times = Infinity;\n }\n\n return this;\n }\n\n loops(p) {\n const loopDuration = this._duration + this._wait;\n\n if (p == null) {\n const loopsDone = Math.floor(this._time / loopDuration);\n const relativeTime = this._time - loopsDone * loopDuration;\n const position = relativeTime / this._duration;\n return Math.min(loopsDone + position, this._times);\n }\n\n const whole = Math.floor(p);\n const partial = p % 1;\n const time = loopDuration * whole + this._duration * partial;\n return this.time(time);\n }\n\n persist(dtOrForever) {\n if (dtOrForever == null) return this._persist;\n this._persist = dtOrForever;\n return this;\n }\n\n position(p) {\n // Get all of the variables we need\n const x = this._time;\n const d = this._duration;\n const w = this._wait;\n const t = this._times;\n const s = this._swing;\n const r = this._reverse;\n let position;\n\n if (p == null) {\n /*\r\n This function converts a time to a position in the range [0, 1]\r\n The full explanation can be found in this desmos demonstration\r\n https://www.desmos.com/calculator/u4fbavgche\r\n The logic is slightly simplified here because we can use booleans\r\n */\n // Figure out the value without thinking about the start or end time\n const f = function (x) {\n const swinging = s * Math.floor(x % (2 * (w + d)) / (w + d));\n const backwards = swinging && !r || !swinging && r;\n const uncliped = Math.pow(-1, backwards) * (x % (w + d)) / d + backwards;\n const clipped = Math.max(Math.min(uncliped, 1), 0);\n return clipped;\n }; // Figure out the value by incorporating the start time\n\n\n const endTime = t * (w + d) - w;\n position = x <= 0 ? Math.round(f(1e-5)) : x < endTime ? f(x) : Math.round(f(endTime - 1e-5));\n return position;\n } // Work out the loops done and add the position to the loops done\n\n\n const loopsDone = Math.floor(this.loops());\n const swingForward = s && loopsDone % 2 === 0;\n const forwards = swingForward && !r || r && swingForward;\n position = loopsDone + (forwards ? p : 1 - p);\n return this.loops(position);\n }\n\n progress(p) {\n if (p == null) {\n return Math.min(1, this._time / this.duration());\n }\n\n return this.time(p * this.duration());\n }\n /*\r\n Basic Functionality\r\n ===================\r\n These methods allow us to attach basic functions to the runner directly\r\n */\n\n\n queue(initFn, runFn, retargetFn, isTransform) {\n this._queue.push({\n initialiser: initFn || noop,\n runner: runFn || noop,\n retarget: retargetFn,\n isTransform: isTransform,\n initialised: false,\n finished: false\n });\n\n const timeline = this.timeline();\n timeline && this.timeline()._continue();\n return this;\n }\n\n reset() {\n if (this._reseted) return this;\n this.time(0);\n this._reseted = true;\n return this;\n }\n\n reverse(reverse) {\n this._reverse = reverse == null ? !this._reverse : reverse;\n return this;\n }\n\n schedule(timeline, delay, when) {\n // The user doesn't need to pass a timeline if we already have one\n if (!(timeline instanceof Timeline)) {\n when = delay;\n delay = timeline;\n timeline = this.timeline();\n } // If there is no timeline, yell at the user...\n\n\n if (!timeline) {\n throw Error('Runner cannot be scheduled without timeline');\n } // Schedule the runner on the timeline provided\n\n\n timeline.schedule(this, delay, when);\n return this;\n }\n\n step(dt) {\n // If we are inactive, this stepper just gets skipped\n if (!this.enabled) return this; // Update the time and get the new position\n\n dt = dt == null ? 16 : dt;\n this._time += dt;\n const position = this.position(); // Figure out if we need to run the stepper in this frame\n\n const running = this._lastPosition !== position && this._time >= 0;\n this._lastPosition = position; // Figure out if we just started\n\n const duration = this.duration();\n const justStarted = this._lastTime <= 0 && this._time > 0;\n const justFinished = this._lastTime < duration && this._time >= duration;\n this._lastTime = this._time;\n\n if (justStarted) {\n this.fire('start', this);\n } // Work out if the runner is finished set the done flag here so animations\n // know, that they are running in the last step (this is good for\n // transformations which can be merged)\n\n\n const declarative = this._isDeclarative;\n this.done = !declarative && !justFinished && this._time >= duration; // Runner is running. So its not in reseted state anymore\n\n this._reseted = false;\n let converged = false; // Call initialise and the run function\n\n if (running || declarative) {\n this._initialise(running); // clear the transforms on this runner so they dont get added again and again\n\n\n this.transforms = new Matrix();\n converged = this._run(declarative ? dt : position);\n this.fire('step', this);\n } // correct the done flag here\n // declaritive animations itself know when they converged\n\n\n this.done = this.done || converged && declarative;\n\n if (justFinished) {\n this.fire('finished', this);\n }\n\n return this;\n }\n /*\r\n Runner animation methods\r\n ========================\r\n Control how the animation plays\r\n */\n\n\n time(time) {\n if (time == null) {\n return this._time;\n }\n\n const dt = time - this._time;\n this.step(dt);\n return this;\n }\n\n timeline(timeline) {\n // check explicitly for undefined so we can set the timeline to null\n if (typeof timeline === 'undefined') return this._timeline;\n this._timeline = timeline;\n return this;\n }\n\n unschedule() {\n const timeline = this.timeline();\n timeline && timeline.unschedule(this);\n return this;\n } // Run each initialise function in the runner if required\n\n\n _initialise(running) {\n // If we aren't running, we shouldn't initialise when not declarative\n if (!running && !this._isDeclarative) return; // Loop through all of the initialisers\n\n for (let i = 0, len = this._queue.length; i < len; ++i) {\n // Get the current initialiser\n const current = this._queue[i]; // Determine whether we need to initialise\n\n const needsIt = this._isDeclarative || !current.initialised && running;\n running = !current.finished; // Call the initialiser if we need to\n\n if (needsIt && running) {\n current.initialiser.call(this);\n current.initialised = true;\n }\n }\n } // Save a morpher to the morpher list so that we can retarget it later\n\n\n _rememberMorpher(method, morpher) {\n this._history[method] = {\n morpher: morpher,\n caller: this._queue[this._queue.length - 1]\n }; // We have to resume the timeline in case a controller\n // is already done without being ever run\n // This can happen when e.g. this is done:\n // anim = el.animate(new SVG.Spring)\n // and later\n // anim.move(...)\n\n if (this._isDeclarative) {\n const timeline = this.timeline();\n timeline && timeline.play();\n }\n } // Try to set the target for a morpher if the morpher exists, otherwise\n // Run each run function for the position or dt given\n\n\n _run(positionOrDt) {\n // Run all of the _queue directly\n let allfinished = true;\n\n for (let i = 0, len = this._queue.length; i < len; ++i) {\n // Get the current function to run\n const current = this._queue[i]; // Run the function if its not finished, we keep track of the finished\n // flag for the sake of declarative _queue\n\n const converged = current.runner.call(this, positionOrDt);\n current.finished = current.finished || converged === true;\n allfinished = allfinished && current.finished;\n } // We report when all of the constructors are finished\n\n\n return allfinished;\n } // do nothing and return false\n\n\n _tryRetarget(method, target, extra) {\n if (this._history[method]) {\n // if the last method wasnt even initialised, throw it away\n if (!this._history[method].caller.initialised) {\n const index = this._queue.indexOf(this._history[method].caller);\n\n this._queue.splice(index, 1);\n\n return false;\n } // for the case of transformations, we use the special retarget function\n // which has access to the outer scope\n\n\n if (this._history[method].caller.retarget) {\n this._history[method].caller.retarget.call(this, target, extra); // for everything else a simple morpher change is sufficient\n\n } else {\n this._history[method].morpher.to(target);\n }\n\n this._history[method].caller.finished = false;\n const timeline = this.timeline();\n timeline && timeline.play();\n return true;\n }\n\n return false;\n }\n\n}\nRunner.id = 0;\nclass FakeRunner {\n constructor(transforms = new Matrix(), id = -1, done = true) {\n this.transforms = transforms;\n this.id = id;\n this.done = done;\n }\n\n clearTransformsFromQueue() {}\n\n}\nextend([Runner, FakeRunner], {\n mergeWith(runner) {\n return new FakeRunner(runner.transforms.lmultiply(this.transforms), runner.id);\n }\n\n}); // FakeRunner.emptyRunner = new FakeRunner()\n\nconst lmultiply = (last, curr) => last.lmultiplyO(curr);\n\nconst getRunnerTransform = runner => runner.transforms;\n\nfunction mergeTransforms() {\n // Find the matrix to apply to the element and apply it\n const runners = this._transformationRunners.runners;\n const netTransform = runners.map(getRunnerTransform).reduce(lmultiply, new Matrix());\n this.transform(netTransform);\n\n this._transformationRunners.merge();\n\n if (this._transformationRunners.length() === 1) {\n this._frameId = null;\n }\n}\n\nclass RunnerArray {\n constructor() {\n this.runners = [];\n this.ids = [];\n }\n\n add(runner) {\n if (this.runners.includes(runner)) return;\n const id = runner.id + 1;\n this.runners.push(runner);\n this.ids.push(id);\n return this;\n }\n\n clearBefore(id) {\n const deleteCnt = this.ids.indexOf(id + 1) || 1;\n this.ids.splice(0, deleteCnt, 0);\n this.runners.splice(0, deleteCnt, new FakeRunner()).forEach(r => r.clearTransformsFromQueue());\n return this;\n }\n\n edit(id, newRunner) {\n const index = this.ids.indexOf(id + 1);\n this.ids.splice(index, 1, id + 1);\n this.runners.splice(index, 1, newRunner);\n return this;\n }\n\n getByID(id) {\n return this.runners[this.ids.indexOf(id + 1)];\n }\n\n length() {\n return this.ids.length;\n }\n\n merge() {\n let lastRunner = null;\n\n for (let i = 0; i < this.runners.length; ++i) {\n const runner = this.runners[i];\n const condition = lastRunner && runner.done && lastRunner.done // don't merge runner when persisted on timeline\n && (!runner._timeline || !runner._timeline._runnerIds.includes(runner.id)) && (!lastRunner._timeline || !lastRunner._timeline._runnerIds.includes(lastRunner.id));\n\n if (condition) {\n // the +1 happens in the function\n this.remove(runner.id);\n const newRunner = runner.mergeWith(lastRunner);\n this.edit(lastRunner.id, newRunner);\n lastRunner = newRunner;\n --i;\n } else {\n lastRunner = runner;\n }\n }\n\n return this;\n }\n\n remove(id) {\n const index = this.ids.indexOf(id + 1);\n this.ids.splice(index, 1);\n this.runners.splice(index, 1);\n return this;\n }\n\n}\nregisterMethods({\n Element: {\n animate(duration, delay, when) {\n const o = Runner.sanitise(duration, delay, when);\n const timeline = this.timeline();\n return new Runner(o.duration).loop(o).element(this).timeline(timeline.play()).schedule(o.delay, o.when);\n },\n\n delay(by, when) {\n return this.animate(0, by, when);\n },\n\n // this function searches for all runners on the element and deletes the ones\n // which run before the current one. This is because absolute transformations\n // overwfrite anything anyway so there is no need to waste time computing\n // other runners\n _clearTransformRunnersBefore(currentRunner) {\n this._transformationRunners.clearBefore(currentRunner.id);\n },\n\n _currentTransform(current) {\n return this._transformationRunners.runners // we need the equal sign here to make sure, that also transformations\n // on the same runner which execute before the current transformation are\n // taken into account\n .filter(runner => runner.id <= current.id).map(getRunnerTransform).reduce(lmultiply, new Matrix());\n },\n\n _addRunner(runner) {\n this._transformationRunners.add(runner); // Make sure that the runner merge is executed at the very end of\n // all Animator functions. Thats why we use immediate here to execute\n // the merge right after all frames are run\n\n\n Animator.cancelImmediate(this._frameId);\n this._frameId = Animator.immediate(mergeTransforms.bind(this));\n },\n\n _prepareRunner() {\n if (this._frameId == null) {\n this._transformationRunners = new RunnerArray().add(new FakeRunner(new Matrix(this)));\n }\n }\n\n }\n}); // Will output the elements from array A that are not in the array B\n\nconst difference = (a, b) => a.filter(x => !b.includes(x));\n\nextend(Runner, {\n attr(a, v) {\n return this.styleAttr('attr', a, v);\n },\n\n // Add animatable styles\n css(s, v) {\n return this.styleAttr('css', s, v);\n },\n\n styleAttr(type, nameOrAttrs, val) {\n if (typeof nameOrAttrs === 'string') {\n return this.styleAttr(type, {\n [nameOrAttrs]: val\n });\n }\n\n let attrs = nameOrAttrs;\n if (this._tryRetarget(type, attrs)) return this;\n let morpher = new Morphable(this._stepper).to(attrs);\n let keys = Object.keys(attrs);\n this.queue(function () {\n morpher = morpher.from(this.element()[type](keys));\n }, function (pos) {\n this.element()[type](morpher.at(pos).valueOf());\n return morpher.done();\n }, function (newToAttrs) {\n // Check if any new keys were added\n const newKeys = Object.keys(newToAttrs);\n const differences = difference(newKeys, keys); // If their are new keys, initialize them and add them to morpher\n\n if (differences.length) {\n // Get the values\n const addedFromAttrs = this.element()[type](differences); // Get the already initialized values\n\n const oldFromAttrs = new ObjectBag(morpher.from()).valueOf(); // Merge old and new\n\n Object.assign(oldFromAttrs, addedFromAttrs);\n morpher.from(oldFromAttrs);\n } // Get the object from the morpher\n\n\n const oldToAttrs = new ObjectBag(morpher.to()).valueOf(); // Merge in new attributes\n\n Object.assign(oldToAttrs, newToAttrs); // Change morpher target\n\n morpher.to(oldToAttrs); // Make sure that we save the work we did so we don't need it to do again\n\n keys = newKeys;\n attrs = newToAttrs;\n });\n\n this._rememberMorpher(type, morpher);\n\n return this;\n },\n\n zoom(level, point) {\n if (this._tryRetarget('zoom', level, point)) return this;\n let morpher = new Morphable(this._stepper).to(new SVGNumber(level));\n this.queue(function () {\n morpher = morpher.from(this.element().zoom());\n }, function (pos) {\n this.element().zoom(morpher.at(pos), point);\n return morpher.done();\n }, function (newLevel, newPoint) {\n point = newPoint;\n morpher.to(newLevel);\n });\n\n this._rememberMorpher('zoom', morpher);\n\n return this;\n },\n\n /**\r\n ** absolute transformations\r\n **/\n //\n // M v -----|-----(D M v = F v)------|-----> T v\n //\n // 1. define the final state (T) and decompose it (once)\n // t = [tx, ty, the, lam, sy, sx]\n // 2. on every frame: pull the current state of all previous transforms\n // (M - m can change)\n // and then write this as m = [tx0, ty0, the0, lam0, sy0, sx0]\n // 3. Find the interpolated matrix F(pos) = m + pos * (t - m)\n // - Note F(0) = M\n // - Note F(1) = T\n // 4. Now you get the delta matrix as a result: D = F * inv(M)\n transform(transforms, relative, affine) {\n // If we have a declarative function, we should retarget it if possible\n relative = transforms.relative || relative;\n\n if (this._isDeclarative && !relative && this._tryRetarget('transform', transforms)) {\n return this;\n } // Parse the parameters\n\n\n const isMatrix = Matrix.isMatrixLike(transforms);\n affine = transforms.affine != null ? transforms.affine : affine != null ? affine : !isMatrix; // Create a morepher and set its type\n\n const morpher = new Morphable(this._stepper).type(affine ? TransformBag : Matrix);\n let origin;\n let element;\n let current;\n let currentAngle;\n let startTransform;\n\n function setup() {\n // make sure element and origin is defined\n element = element || this.element();\n origin = origin || getOrigin(transforms, element);\n startTransform = new Matrix(relative ? undefined : element); // add the runner to the element so it can merge transformations\n\n element._addRunner(this); // Deactivate all transforms that have run so far if we are absolute\n\n\n if (!relative) {\n element._clearTransformRunnersBefore(this);\n }\n }\n\n function run(pos) {\n // clear all other transforms before this in case something is saved\n // on this runner. We are absolute. We dont need these!\n if (!relative) this.clearTransform();\n const {\n x,\n y\n } = new Point(origin).transform(element._currentTransform(this));\n let target = new Matrix({ ...transforms,\n origin: [x, y]\n });\n let start = this._isDeclarative && current ? current : startTransform;\n\n if (affine) {\n target = target.decompose(x, y);\n start = start.decompose(x, y); // Get the current and target angle as it was set\n\n const rTarget = target.rotate;\n const rCurrent = start.rotate; // Figure out the shortest path to rotate directly\n\n const possibilities = [rTarget - 360, rTarget, rTarget + 360];\n const distances = possibilities.map(a => Math.abs(a - rCurrent));\n const shortest = Math.min(...distances);\n const index = distances.indexOf(shortest);\n target.rotate = possibilities[index];\n }\n\n if (relative) {\n // we have to be careful here not to overwrite the rotation\n // with the rotate method of Matrix\n if (!isMatrix) {\n target.rotate = transforms.rotate || 0;\n }\n\n if (this._isDeclarative && currentAngle) {\n start.rotate = currentAngle;\n }\n }\n\n morpher.from(start);\n morpher.to(target);\n const affineParameters = morpher.at(pos);\n currentAngle = affineParameters.rotate;\n current = new Matrix(affineParameters);\n this.addTransform(current);\n\n element._addRunner(this);\n\n return morpher.done();\n }\n\n function retarget(newTransforms) {\n // only get a new origin if it changed since the last call\n if ((newTransforms.origin || 'center').toString() !== (transforms.origin || 'center').toString()) {\n origin = getOrigin(newTransforms, element);\n } // overwrite the old transformations with the new ones\n\n\n transforms = { ...newTransforms,\n origin\n };\n }\n\n this.queue(setup, run, retarget, true);\n this._isDeclarative && this._rememberMorpher('transform', morpher);\n return this;\n },\n\n // Animatable x-axis\n x(x, relative) {\n return this._queueNumber('x', x);\n },\n\n // Animatable y-axis\n y(y) {\n return this._queueNumber('y', y);\n },\n\n dx(x = 0) {\n return this._queueNumberDelta('x', x);\n },\n\n dy(y = 0) {\n return this._queueNumberDelta('y', y);\n },\n\n dmove(x, y) {\n return this.dx(x).dy(y);\n },\n\n _queueNumberDelta(method, to) {\n to = new SVGNumber(to); // Try to change the target if we have this method already registerd\n\n if (this._tryRetarget(method, to)) return this; // Make a morpher and queue the animation\n\n const morpher = new Morphable(this._stepper).to(to);\n let from = null;\n this.queue(function () {\n from = this.element()[method]();\n morpher.from(from);\n morpher.to(from + to);\n }, function (pos) {\n this.element()[method](morpher.at(pos));\n return morpher.done();\n }, function (newTo) {\n morpher.to(from + new SVGNumber(newTo));\n }); // Register the morpher so that if it is changed again, we can retarget it\n\n this._rememberMorpher(method, morpher);\n\n return this;\n },\n\n _queueObject(method, to) {\n // Try to change the target if we have this method already registerd\n if (this._tryRetarget(method, to)) return this; // Make a morpher and queue the animation\n\n const morpher = new Morphable(this._stepper).to(to);\n this.queue(function () {\n morpher.from(this.element()[method]());\n }, function (pos) {\n this.element()[method](morpher.at(pos));\n return morpher.done();\n }); // Register the morpher so that if it is changed again, we can retarget it\n\n this._rememberMorpher(method, morpher);\n\n return this;\n },\n\n _queueNumber(method, value) {\n return this._queueObject(method, new SVGNumber(value));\n },\n\n // Animatable center x-axis\n cx(x) {\n return this._queueNumber('cx', x);\n },\n\n // Animatable center y-axis\n cy(y) {\n return this._queueNumber('cy', y);\n },\n\n // Add animatable move\n move(x, y) {\n return this.x(x).y(y);\n },\n\n // Add animatable center\n center(x, y) {\n return this.cx(x).cy(y);\n },\n\n // Add animatable size\n size(width, height) {\n // animate bbox based size for all other elements\n let box;\n\n if (!width || !height) {\n box = this._element.bbox();\n }\n\n if (!width) {\n width = box.width / box.height * height;\n }\n\n if (!height) {\n height = box.height / box.width * width;\n }\n\n return this.width(width).height(height);\n },\n\n // Add animatable width\n width(width) {\n return this._queueNumber('width', width);\n },\n\n // Add animatable height\n height(height) {\n return this._queueNumber('height', height);\n },\n\n // Add animatable plot\n plot(a, b, c, d) {\n // Lines can be plotted with 4 arguments\n if (arguments.length === 4) {\n return this.plot([a, b, c, d]);\n }\n\n if (this._tryRetarget('plot', a)) return this;\n const morpher = new Morphable(this._stepper).type(this._element.MorphArray).to(a);\n this.queue(function () {\n morpher.from(this._element.array());\n }, function (pos) {\n this._element.plot(morpher.at(pos));\n\n return morpher.done();\n });\n\n this._rememberMorpher('plot', morpher);\n\n return this;\n },\n\n // Add leading method\n leading(value) {\n return this._queueNumber('leading', value);\n },\n\n // Add animatable viewbox\n viewbox(x, y, width, height) {\n return this._queueObject('viewbox', new Box(x, y, width, height));\n },\n\n update(o) {\n if (typeof o !== 'object') {\n return this.update({\n offset: arguments[0],\n color: arguments[1],\n opacity: arguments[2]\n });\n }\n\n if (o.opacity != null) this.attr('stop-opacity', o.opacity);\n if (o.color != null) this.attr('stop-color', o.color);\n if (o.offset != null) this.attr('offset', o.offset);\n return this;\n }\n\n});\nextend(Runner, {\n rx,\n ry,\n from,\n to\n});\nregister(Runner, 'Runner');\n\nclass Svg extends Container {\n constructor(node, attrs = node) {\n super(nodeOrNew('svg', node), attrs);\n this.namespace();\n } // Creates and returns defs element\n\n\n defs() {\n if (!this.isRoot()) return this.root().defs();\n return adopt(this.node.querySelector('defs')) || this.put(new Defs());\n }\n\n isRoot() {\n return !this.node.parentNode || !(this.node.parentNode instanceof globals.window.SVGElement) && this.node.parentNode.nodeName !== '#document-fragment';\n } // Add namespaces\n\n\n namespace() {\n if (!this.isRoot()) return this.root().namespace();\n return this.attr({\n xmlns: svg,\n version: '1.1'\n }).attr('xmlns:xlink', xlink, xmlns).attr('xmlns:svgjs', svgjs, xmlns);\n }\n\n removeNamespace() {\n return this.attr({\n xmlns: null,\n version: null\n }).attr('xmlns:xlink', null, xmlns).attr('xmlns:svgjs', null, xmlns);\n } // Check if this is a root svg\n // If not, call root() from this element\n\n\n root() {\n if (this.isRoot()) return this;\n return super.root();\n }\n\n}\nregisterMethods({\n Container: {\n // Create nested svg document\n nested: wrapWithAttrCheck(function () {\n return this.put(new Svg());\n })\n }\n});\nregister(Svg, 'Svg', true);\n\nclass Symbol extends Container {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('symbol', node), attrs);\n }\n\n}\nregisterMethods({\n Container: {\n symbol: wrapWithAttrCheck(function () {\n return this.put(new Symbol());\n })\n }\n});\nregister(Symbol, 'Symbol');\n\nfunction plain(text) {\n // clear if build mode is disabled\n if (this._build === false) {\n this.clear();\n } // create text node\n\n\n this.node.appendChild(globals.document.createTextNode(text));\n return this;\n} // Get length of text element\n\nfunction length() {\n return this.node.getComputedTextLength();\n} // Move over x-axis\n// Text is moved by its bounding box\n// text-anchor does NOT matter\n\nfunction x$1(x, box = this.bbox()) {\n if (x == null) {\n return box.x;\n }\n\n return this.attr('x', this.attr('x') + x - box.x);\n} // Move over y-axis\n\nfunction y$1(y, box = this.bbox()) {\n if (y == null) {\n return box.y;\n }\n\n return this.attr('y', this.attr('y') + y - box.y);\n}\nfunction move$1(x, y, box = this.bbox()) {\n return this.x(x, box).y(y, box);\n} // Move center over x-axis\n\nfunction cx(x, box = this.bbox()) {\n if (x == null) {\n return box.cx;\n }\n\n return this.attr('x', this.attr('x') + x - box.cx);\n} // Move center over y-axis\n\nfunction cy(y, box = this.bbox()) {\n if (y == null) {\n return box.cy;\n }\n\n return this.attr('y', this.attr('y') + y - box.cy);\n}\nfunction center(x, y, box = this.bbox()) {\n return this.cx(x, box).cy(y, box);\n}\nfunction ax(x) {\n return this.attr('x', x);\n}\nfunction ay(y) {\n return this.attr('y', y);\n}\nfunction amove(x, y) {\n return this.ax(x).ay(y);\n} // Enable / disable build mode\n\nfunction build(build) {\n this._build = !!build;\n return this;\n}\n\nvar textable = {\n __proto__: null,\n plain: plain,\n length: length,\n x: x$1,\n y: y$1,\n move: move$1,\n cx: cx,\n cy: cy,\n center: center,\n ax: ax,\n ay: ay,\n amove: amove,\n build: build\n};\n\nclass Text extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('text', node), attrs);\n this.dom.leading = new SVGNumber(1.3); // store leading value for rebuilding\n\n this._rebuild = true; // enable automatic updating of dy values\n\n this._build = false; // disable build mode for adding multiple lines\n } // Set / get leading\n\n\n leading(value) {\n // act as getter\n if (value == null) {\n return this.dom.leading;\n } // act as setter\n\n\n this.dom.leading = new SVGNumber(value);\n return this.rebuild();\n } // Rebuild appearance type\n\n\n rebuild(rebuild) {\n // store new rebuild flag if given\n if (typeof rebuild === 'boolean') {\n this._rebuild = rebuild;\n } // define position of all lines\n\n\n if (this._rebuild) {\n const self = this;\n let blankLineOffset = 0;\n const leading = this.dom.leading;\n this.each(function (i) {\n const fontSize = globals.window.getComputedStyle(this.node).getPropertyValue('font-size');\n const dy = leading * new SVGNumber(fontSize);\n\n if (this.dom.newLined) {\n this.attr('x', self.attr('x'));\n\n if (this.text() === '\\n') {\n blankLineOffset += dy;\n } else {\n this.attr('dy', i ? dy + blankLineOffset : 0);\n blankLineOffset = 0;\n }\n }\n });\n this.fire('rebuild');\n }\n\n return this;\n } // overwrite method from parent to set data properly\n\n\n setData(o) {\n this.dom = o;\n this.dom.leading = new SVGNumber(o.leading || 1.3);\n return this;\n } // Set the text content\n\n\n text(text) {\n // act as getter\n if (text === undefined) {\n const children = this.node.childNodes;\n let firstLine = 0;\n text = '';\n\n for (let i = 0, len = children.length; i < len; ++i) {\n // skip textPaths - they are no lines\n if (children[i].nodeName === 'textPath') {\n if (i === 0) firstLine = 1;\n continue;\n } // add newline if its not the first child and newLined is set to true\n\n\n if (i !== firstLine && children[i].nodeType !== 3 && adopt(children[i]).dom.newLined === true) {\n text += '\\n';\n } // add content of this node\n\n\n text += children[i].textContent;\n }\n\n return text;\n } // remove existing content\n\n\n this.clear().build(true);\n\n if (typeof text === 'function') {\n // call block\n text.call(this, this);\n } else {\n // store text and make sure text is not blank\n text = (text + '').split('\\n'); // build new lines\n\n for (let j = 0, jl = text.length; j < jl; j++) {\n this.newLine(text[j]);\n }\n } // disable build mode and rebuild lines\n\n\n return this.build(false).rebuild();\n }\n\n}\nextend(Text, textable);\nregisterMethods({\n Container: {\n // Create text element\n text: wrapWithAttrCheck(function (text = '') {\n return this.put(new Text()).text(text);\n }),\n // Create plain text element\n plain: wrapWithAttrCheck(function (text = '') {\n return this.put(new Text()).plain(text);\n })\n }\n});\nregister(Text, 'Text');\n\nclass Tspan extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('tspan', node), attrs);\n this._build = false; // disable build mode for adding multiple lines\n } // Shortcut dx\n\n\n dx(dx) {\n return this.attr('dx', dx);\n } // Shortcut dy\n\n\n dy(dy) {\n return this.attr('dy', dy);\n } // Create new line\n\n\n newLine() {\n // mark new line\n this.dom.newLined = true; // fetch parent\n\n const text = this.parent(); // early return in case we are not in a text element\n\n if (!(text instanceof Text)) {\n return this;\n }\n\n const i = text.index(this);\n const fontSize = globals.window.getComputedStyle(this.node).getPropertyValue('font-size');\n const dy = text.dom.leading * new SVGNumber(fontSize); // apply new position\n\n return this.dy(i ? dy : 0).attr('x', text.x());\n } // Set text content\n\n\n text(text) {\n if (text == null) return this.node.textContent + (this.dom.newLined ? '\\n' : '');\n\n if (typeof text === 'function') {\n this.clear().build(true);\n text.call(this, this);\n this.build(false);\n } else {\n this.plain(text);\n }\n\n return this;\n }\n\n}\nextend(Tspan, textable);\nregisterMethods({\n Tspan: {\n tspan: wrapWithAttrCheck(function (text = '') {\n const tspan = new Tspan(); // clear if build mode is disabled\n\n if (!this._build) {\n this.clear();\n } // add new tspan\n\n\n return this.put(tspan).text(text);\n })\n },\n Text: {\n newLine: function (text = '') {\n return this.tspan(text).newLine();\n }\n }\n});\nregister(Tspan, 'Tspan');\n\nclass Circle extends Shape {\n constructor(node, attrs = node) {\n super(nodeOrNew('circle', node), attrs);\n }\n\n radius(r) {\n return this.attr('r', r);\n } // Radius x value\n\n\n rx(rx) {\n return this.attr('r', rx);\n } // Alias radius x value\n\n\n ry(ry) {\n return this.rx(ry);\n }\n\n size(size) {\n return this.radius(new SVGNumber(size).divide(2));\n }\n\n}\nextend(Circle, {\n x: x$3,\n y: y$3,\n cx: cx$1,\n cy: cy$1,\n width: width$2,\n height: height$2\n});\nregisterMethods({\n Container: {\n // Create circle element\n circle: wrapWithAttrCheck(function (size = 0) {\n return this.put(new Circle()).size(size).move(0, 0);\n })\n }\n});\nregister(Circle, 'Circle');\n\nclass ClipPath extends Container {\n constructor(node, attrs = node) {\n super(nodeOrNew('clipPath', node), attrs);\n } // Unclip all clipped elements and remove itself\n\n\n remove() {\n // unclip all targets\n this.targets().forEach(function (el) {\n el.unclip();\n }); // remove clipPath from parent\n\n return super.remove();\n }\n\n targets() {\n return baseFind('svg [clip-path*=\"' + this.id() + '\"]');\n }\n\n}\nregisterMethods({\n Container: {\n // Create clipping element\n clip: wrapWithAttrCheck(function () {\n return this.defs().put(new ClipPath());\n })\n },\n Element: {\n // Distribute clipPath to svg element\n clipper() {\n return this.reference('clip-path');\n },\n\n clipWith(element) {\n // use given clip or create a new one\n const clipper = element instanceof ClipPath ? element : this.parent().clip().add(element); // apply mask\n\n return this.attr('clip-path', 'url(\"#' + clipper.id() + '\")');\n },\n\n // Unclip element\n unclip() {\n return this.attr('clip-path', null);\n }\n\n }\n});\nregister(ClipPath, 'ClipPath');\n\nclass ForeignObject extends Element {\n constructor(node, attrs = node) {\n super(nodeOrNew('foreignObject', node), attrs);\n }\n\n}\nregisterMethods({\n Container: {\n foreignObject: wrapWithAttrCheck(function (width, height) {\n return this.put(new ForeignObject()).size(width, height);\n })\n }\n});\nregister(ForeignObject, 'ForeignObject');\n\nfunction dmove(dx, dy) {\n this.children().forEach((child, i) => {\n let bbox; // We have to wrap this for elements that dont have a bbox\n // e.g. title and other descriptive elements\n\n try {\n // Get the childs bbox\n bbox = child.bbox();\n } catch (e) {\n return;\n } // Get childs matrix\n\n\n const m = new Matrix(child); // Translate childs matrix by amount and\n // transform it back into parents space\n\n const matrix = m.translate(dx, dy).transform(m.inverse()); // Calculate new x and y from old box\n\n const p = new Point(bbox.x, bbox.y).transform(matrix); // Move element\n\n child.move(p.x, p.y);\n });\n return this;\n}\nfunction dx(dx) {\n return this.dmove(dx, 0);\n}\nfunction dy(dy) {\n return this.dmove(0, dy);\n}\nfunction height(height, box = this.bbox()) {\n if (height == null) return box.height;\n return this.size(box.width, height, box);\n}\nfunction move(x = 0, y = 0, box = this.bbox()) {\n const dx = x - box.x;\n const dy = y - box.y;\n return this.dmove(dx, dy);\n}\nfunction size(width, height, box = this.bbox()) {\n const p = proportionalSize(this, width, height, box);\n const scaleX = p.width / box.width;\n const scaleY = p.height / box.height;\n this.children().forEach((child, i) => {\n const o = new Point(box).transform(new Matrix(child).inverse());\n child.scale(scaleX, scaleY, o.x, o.y);\n });\n return this;\n}\nfunction width(width, box = this.bbox()) {\n if (width == null) return box.width;\n return this.size(width, box.height, box);\n}\nfunction x(x, box = this.bbox()) {\n if (x == null) return box.x;\n return this.move(x, box.y, box);\n}\nfunction y(y, box = this.bbox()) {\n if (y == null) return box.y;\n return this.move(box.x, y, box);\n}\n\nvar containerGeometry = {\n __proto__: null,\n dmove: dmove,\n dx: dx,\n dy: dy,\n height: height,\n move: move,\n size: size,\n width: width,\n x: x,\n y: y\n};\n\nclass G extends Container {\n constructor(node, attrs = node) {\n super(nodeOrNew('g', node), attrs);\n }\n\n}\nextend(G, containerGeometry);\nregisterMethods({\n Container: {\n // Create a group element\n group: wrapWithAttrCheck(function () {\n return this.put(new G());\n })\n }\n});\nregister(G, 'G');\n\nclass A extends Container {\n constructor(node, attrs = node) {\n super(nodeOrNew('a', node), attrs);\n } // Link target attribute\n\n\n target(target) {\n return this.attr('target', target);\n } // Link url\n\n\n to(url) {\n return this.attr('href', url, xlink);\n }\n\n}\nextend(A, containerGeometry);\nregisterMethods({\n Container: {\n // Create a hyperlink element\n link: wrapWithAttrCheck(function (url) {\n return this.put(new A()).to(url);\n })\n },\n Element: {\n unlink() {\n const link = this.linker();\n if (!link) return this;\n const parent = link.parent();\n\n if (!parent) {\n return this.remove();\n }\n\n const index = parent.index(link);\n parent.add(this, index);\n link.remove();\n return this;\n },\n\n linkTo(url) {\n // reuse old link if possible\n let link = this.linker();\n\n if (!link) {\n link = new A();\n this.wrap(link);\n }\n\n if (typeof url === 'function') {\n url.call(link, link);\n } else {\n link.to(url);\n }\n\n return this;\n },\n\n linker() {\n const link = this.parent();\n\n if (link && link.node.nodeName.toLowerCase() === 'a') {\n return link;\n }\n\n return null;\n }\n\n }\n});\nregister(A, 'A');\n\nclass Mask extends Container {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('mask', node), attrs);\n } // Unmask all masked elements and remove itself\n\n\n remove() {\n // unmask all targets\n this.targets().forEach(function (el) {\n el.unmask();\n }); // remove mask from parent\n\n return super.remove();\n }\n\n targets() {\n return baseFind('svg [mask*=\"' + this.id() + '\"]');\n }\n\n}\nregisterMethods({\n Container: {\n mask: wrapWithAttrCheck(function () {\n return this.defs().put(new Mask());\n })\n },\n Element: {\n // Distribute mask to svg element\n masker() {\n return this.reference('mask');\n },\n\n maskWith(element) {\n // use given mask or create a new one\n const masker = element instanceof Mask ? element : this.parent().mask().add(element); // apply mask\n\n return this.attr('mask', 'url(\"#' + masker.id() + '\")');\n },\n\n // Unmask element\n unmask() {\n return this.attr('mask', null);\n }\n\n }\n});\nregister(Mask, 'Mask');\n\nclass Stop extends Element {\n constructor(node, attrs = node) {\n super(nodeOrNew('stop', node), attrs);\n } // add color stops\n\n\n update(o) {\n if (typeof o === 'number' || o instanceof SVGNumber) {\n o = {\n offset: arguments[0],\n color: arguments[1],\n opacity: arguments[2]\n };\n } // set attributes\n\n\n if (o.opacity != null) this.attr('stop-opacity', o.opacity);\n if (o.color != null) this.attr('stop-color', o.color);\n if (o.offset != null) this.attr('offset', new SVGNumber(o.offset));\n return this;\n }\n\n}\nregisterMethods({\n Gradient: {\n // Add a color stop\n stop: function (offset, color, opacity) {\n return this.put(new Stop()).update(offset, color, opacity);\n }\n }\n});\nregister(Stop, 'Stop');\n\nfunction cssRule(selector, rule) {\n if (!selector) return '';\n if (!rule) return selector;\n let ret = selector + '{';\n\n for (const i in rule) {\n ret += unCamelCase(i) + ':' + rule[i] + ';';\n }\n\n ret += '}';\n return ret;\n}\n\nclass Style extends Element {\n constructor(node, attrs = node) {\n super(nodeOrNew('style', node), attrs);\n }\n\n addText(w = '') {\n this.node.textContent += w;\n return this;\n }\n\n font(name, src, params = {}) {\n return this.rule('@font-face', {\n fontFamily: name,\n src: src,\n ...params\n });\n }\n\n rule(selector, obj) {\n return this.addText(cssRule(selector, obj));\n }\n\n}\nregisterMethods('Dom', {\n style(selector, obj) {\n return this.put(new Style()).rule(selector, obj);\n },\n\n fontface(name, src, params) {\n return this.put(new Style()).font(name, src, params);\n }\n\n});\nregister(Style, 'Style');\n\nclass TextPath extends Text {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('textPath', node), attrs);\n } // return the array of the path track element\n\n\n array() {\n const track = this.track();\n return track ? track.array() : null;\n } // Plot path if any\n\n\n plot(d) {\n const track = this.track();\n let pathArray = null;\n\n if (track) {\n pathArray = track.plot(d);\n }\n\n return d == null ? pathArray : this;\n } // Get the path element\n\n\n track() {\n return this.reference('href');\n }\n\n}\nregisterMethods({\n Container: {\n textPath: wrapWithAttrCheck(function (text, path) {\n // Convert text to instance if needed\n if (!(text instanceof Text)) {\n text = this.text(text);\n }\n\n return text.path(path);\n })\n },\n Text: {\n // Create path for text to run on\n path: wrapWithAttrCheck(function (track, importNodes = true) {\n const textPath = new TextPath(); // if track is a path, reuse it\n\n if (!(track instanceof Path)) {\n // create path element\n track = this.defs().path(track);\n } // link textPath to path and add content\n\n\n textPath.attr('href', '#' + track, xlink); // Transplant all nodes from text to textPath\n\n let node;\n\n if (importNodes) {\n while (node = this.node.firstChild) {\n textPath.node.appendChild(node);\n }\n } // add textPath element as child node and return textPath\n\n\n return this.put(textPath);\n }),\n\n // Get the textPath children\n textPath() {\n return this.findOne('textPath');\n }\n\n },\n Path: {\n // creates a textPath from this path\n text: wrapWithAttrCheck(function (text) {\n // Convert text to instance if needed\n if (!(text instanceof Text)) {\n text = new Text().addTo(this.parent()).text(text);\n } // Create textPath from text and path and return\n\n\n return text.path(this);\n }),\n\n targets() {\n return baseFind('svg textPath').filter(node => {\n return (node.attr('href') || '').includes(this.id());\n }); // Does not work in IE11. Use when IE support is dropped\n // return baseFind('svg textPath[*|href*=\"' + this.id() + '\"]')\n }\n\n }\n});\nTextPath.prototype.MorphArray = PathArray;\nregister(TextPath, 'TextPath');\n\nclass Use extends Shape {\n constructor(node, attrs = node) {\n super(nodeOrNew('use', node), attrs);\n } // Use element as a reference\n\n\n use(element, file) {\n // Set lined element\n return this.attr('href', (file || '') + '#' + element, xlink);\n }\n\n}\nregisterMethods({\n Container: {\n // Create a use element\n use: wrapWithAttrCheck(function (element, file) {\n return this.put(new Use()).use(element, file);\n })\n }\n});\nregister(Use, 'Use');\n\n/* Optional Modules */\nconst SVG = makeInstance;\nextend([Svg, Symbol, Image, Pattern, Marker], getMethodsFor('viewbox'));\nextend([Line, Polyline, Polygon, Path], getMethodsFor('marker'));\nextend(Text, getMethodsFor('Text'));\nextend(Path, getMethodsFor('Path'));\nextend(Defs, getMethodsFor('Defs'));\nextend([Text, Tspan], getMethodsFor('Tspan'));\nextend([Rect, Ellipse, Gradient, Runner], getMethodsFor('radius'));\nextend(EventTarget, getMethodsFor('EventTarget'));\nextend(Dom, getMethodsFor('Dom'));\nextend(Element, getMethodsFor('Element'));\nextend(Shape, getMethodsFor('Shape'));\nextend([Container, Fragment], getMethodsFor('Container'));\nextend(Gradient, getMethodsFor('Gradient'));\nextend(Runner, getMethodsFor('Runner'));\nList.extend(getMethodNames());\nregisterMorphableType([SVGNumber, Color, Box, Matrix, SVGArray, PointArray, PathArray]);\nmakeMorphable();\n\nexport { A, Animator, SVGArray as Array, Box, Circle, ClipPath, Color, Container, Controller, Defs, Dom, Ease, Element, Ellipse, EventTarget, ForeignObject, Fragment, G, Gradient, Image, Line, List, Marker, Mask, Matrix, Morphable, NonMorphable, SVGNumber as Number, ObjectBag, PID, Path, PathArray, Pattern, Point, PointArray, Polygon, Polyline, Queue, Rect, Runner, SVG, Shape, Spring, Stop, Style, Svg, Symbol, Text, TextPath, Timeline, TransformBag, Tspan, Use, adopt, assignNewId, clearEvents, create, defaults, dispatch, easing, eid, extend, baseFind as find, getClass, getEventTarget, getEvents, getWindow, makeInstance, makeMorphable, mockAdopt, namespaces, nodeOrNew, off, on, parser, regex, register, registerMorphableType, registerWindow, restoreWindow, root, saveWindow, utils, windowEvents, withWindow, wrapWithAttrCheck };\n//# sourceMappingURL=svg.esm.js.map\n","import React, { PureComponent } from 'react';\nimport { PanelProps } from '@grafana/data';\nimport { ACESVGOptions, SVGIDMapping } from 'types';\nimport { Dom as SVGDom, Element as SVGElement, extend as SVGExtend, Runner as SVGRunner, SVG } from '@svgdotjs/svg.js';\nimport { css } from 'emotion';\n\n// import { css } from '@emotion/react'\n\ninterface MappedElements {\n [key: string]: SVGElement | SVGDom;\n}\n\ninterface Props extends PanelProps {}\n\ninterface PanelState {\n addAllIDs: boolean;\n svgNode: SVGElement | SVGDom | null;\n svgSource: string | null;\n mappedElements: MappedElements | null;\n svgMappings: SVGIDMapping[];\n initFunctionSource: string;\n initFunction: Function | null;\n eventFunctionSource: string;\n eventFunction: Function | null;\n initialized: boolean;\n context: any;\n}\n\ninterface TextMappedElement extends SVGElement {\n textElement: Element;\n}\n\nSVGExtend(SVGElement, {\n openOnClick: function (this: SVGElement, url: string) {\n return window.open(url);\n },\n animateContRotate: function (this: SVGElement, speed: number) {\n return (\n this.animate(speed)\n //@ts-ignore\n .ease('-')\n //@ts-ignore\n .rotate(360)\n .loop()\n );\n },\n showOn: function (this: SVGElement, on: boolean) {\n if (on) {\n this.show();\n } else {\n this.hide();\n }\n },\n animateOn: function (this: SVGElement, speed: number, on: boolean, animation: Function) {\n if (on) {\n //@ts-ignore\n if (this.timeline()._runners.length === 0) {\n animation(this.animate(speed));\n } else {\n this.timeline().play();\n }\n } else {\n this.timeline().stop();\n }\n },\n stopAnimation: function (this: SVGRunner) {\n this.timeline().stop();\n },\n getParentNode: function (this: SVGElement) {\n return this.node.parentNode;\n },\n getTopNode: function (this: SVGElement) {\n let currentNode: Element = this.node as Element;\n while (true) {\n if (currentNode.parentNode && !currentNode.className.includes('svg-object')) {\n currentNode = currentNode.parentNode as Element;\n } else {\n return currentNode;\n }\n }\n },\n});\nSVGExtend(SVGDom, {\n updateXHTMLFontText: function (this: SVGDom, newText: string) {\n let currentElement: Element | TextMappedElement = this.node;\n let i = 0;\n while (currentElement.localName !== 'xhtml:font') {\n if (currentElement.firstElementChild && i < 10) {\n currentElement = currentElement.firstElementChild;\n i++;\n } else {\n return;\n }\n }\n currentElement.innerHTML = newText;\n },\n});\n\n// export class SimplePanel extends PureComponent = ({ options, data, width, height }) => {\nexport class ACESVGPanel extends PureComponent {\n constructor(props: any) {\n super(props);\n this.state = {\n addAllIDs: false,\n svgNode: null,\n svgSource: null,\n svgMappings: [],\n mappedElements: null,\n initFunctionSource: '',\n initFunction: null,\n eventFunctionSource: '',\n eventFunction: null,\n initialized: false,\n context: {},\n };\n }\n\n initializeMappings(svgNode: SVGElement | SVGDom) {\n const svgMappings = this.props.options.svgMappings;\n let currentElements: MappedElements = { ...this.state.mappedElements };\n currentElements = {};\n for (let i = 0; i < svgMappings.length; i++) {\n if (svgMappings[i].mappedName !== '') {\n currentElements[this.props.options.svgMappings[i].mappedName] = svgNode.findOne(\n `#${this.props.options.svgMappings[i].svgId}`\n );\n }\n }\n this.setState({ mappedElements: currentElements });\n }\n\n mapAllIDs(svgNode: SVGDom) {\n let svgMappings: SVGIDMapping[] = [...this.props.options.svgMappings];\n let nodeFilterID: NodeFilter = {\n acceptNode: (node: Element) => {\n if (node.id) {\n if (node.id !== '') {\n return NodeFilter.FILTER_ACCEPT;\n }\n }\n return NodeFilter.FILTER_REJECT;\n },\n };\n let svgWalker = document.createTreeWalker(svgNode.node, NodeFilter.SHOW_ALL, nodeFilterID);\n let currentNode: Element | null = svgWalker.currentNode as Element;\n while (currentNode) {\n if (currentNode && currentNode.id) {\n if (svgMappings.filter((mapping) => (currentNode ? mapping.svgId === currentNode.id : false)).length === 0) {\n svgMappings.push({ svgId: currentNode.id, mappedName: '' });\n }\n }\n currentNode = svgWalker.nextNode() as Element;\n }\n this.setState({ svgMappings: [...svgMappings], initialized: false });\n this.props.options.svgMappings = [...svgMappings];\n this.props.onOptionsChange(this.props.options);\n this.forceUpdate();\n }\n\n mappingClickHandler(event: React.MouseEvent) {\n if (event.target) {\n let clicked = event.target as Element;\n let loopCount = 0;\n let svgMappings: SVGIDMapping[] = [...this.props.options.svgMappings];\n if (clicked.id) {\n while (clicked.id === '') {\n loopCount++;\n if (loopCount > 20) {\n return;\n }\n clicked = clicked.parentNode as Element;\n }\n for (let i = 0; i < svgMappings.length; i++) {\n if (svgMappings[i].svgId === clicked.id) {\n return;\n }\n }\n svgMappings.push({ svgId: clicked.id, mappedName: '' });\n this.setState({ svgMappings: [...svgMappings], initialized: false });\n this.props.options.svgMappings = [...svgMappings];\n this.props.onOptionsChange(this.props.options);\n this.forceUpdate();\n }\n }\n }\n\n renderSVG(element: SVGSVGElement | SVGDom | null) {\n if (element) {\n if (\n this.props.options.initSource !== this.state.initFunctionSource ||\n this.state.addAllIDs !== this.props.options.addAllIDs\n ) {\n this.setState({\n initFunctionSource: this.props.options.initSource,\n addAllIDs: this.props.options.addAllIDs,\n initialized: false,\n });\n }\n if (!this.state.initialized) {\n console.log('initializing');\n let svgNode = SVG(element);\n svgNode.clear();\n svgNode.svg(this.props.options.svgSource);\n svgNode.size(this.props.width, this.props.height);\n if (this.props.options.addAllIDs) {\n this.mapAllIDs(svgNode);\n }\n this.initializeMappings(svgNode);\n this.setState({ svgNode: svgNode });\n\n try {\n const initFunction = Function(\n 'data',\n 'options',\n 'svgnode',\n 'svgmap',\n 'context',\n this.props.replaceVariables(this.props.options.initSource)\n );\n this.setState({ initFunction });\n if (this.state.mappedElements && initFunction) {\n initFunction(this.props.data, this.props.options, this.state.svgNode, this.state.mappedElements);\n this.setState({ initialized: true });\n }\n } catch (e) {\n this.setState({ initialized: true });\n console.log(`User init code failed: ${e}`);\n }\n }\n\n try {\n let eventFunction = this.state.eventFunction;\n if (this.props.options.eventSource !== this.state.eventFunctionSource) {\n let eventFunctionSource = this.props.options.eventSource;\n eventFunction = Function(\n 'data',\n 'options',\n 'svgnode',\n 'svgmap',\n 'context',\n this.props.replaceVariables(eventFunctionSource)\n );\n this.setState({ eventFunctionSource: eventFunctionSource, eventFunction: eventFunction, initialized: false });\n }\n if (this.state.mappedElements && eventFunction) {\n eventFunction(\n this.props.data,\n this.props.options,\n this.state.svgNode,\n this.state.mappedElements,\n this.context\n );\n }\n } catch (e) {\n console.log(`User event code failed: ${e}`);\n }\n\n return this.state.svgNode ? this.state.svgNode.svg() : null;\n } else {\n return null;\n }\n }\n\n render() {\n const styles = this.generateComponentStyles();\n return (\n \n this.renderSVG(ref)}\n >\n \n );\n }\n\n private generateComponentStyles = () => {\n return {\n wrapper: css`\n position: relative;\n `,\n svg: css`\n position: absolute;\n top: 0;\n left: 0;\n `,\n textBox: css`\n position: absolute;\n bottom: 0;\n left: 0;\n padding: 10px;\n `,\n };\n };\n}\n","function _defineProperty(obj, key, value) {\n if (key in obj) {\n Object.defineProperty(obj, key, {\n value: value,\n enumerable: true,\n configurable: true,\n writable: true\n });\n } else {\n obj[key] = value;\n }\n\n return obj;\n}\n\nfunction ownKeys(object, enumerableOnly) {\n var keys = Object.keys(object);\n\n if (Object.getOwnPropertySymbols) {\n var symbols = Object.getOwnPropertySymbols(object);\n if (enumerableOnly) symbols = symbols.filter(function (sym) {\n return Object.getOwnPropertyDescriptor(object, sym).enumerable;\n });\n keys.push.apply(keys, symbols);\n }\n\n return keys;\n}\n\nfunction _objectSpread2(target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i] != null ? arguments[i] : {};\n\n if (i % 2) {\n ownKeys(Object(source), true).forEach(function (key) {\n _defineProperty(target, key, source[key]);\n });\n } else if (Object.getOwnPropertyDescriptors) {\n Object.defineProperties(target, Object.getOwnPropertyDescriptors(source));\n } else {\n ownKeys(Object(source)).forEach(function (key) {\n Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));\n });\n }\n }\n\n return target;\n}\n\nfunction _slicedToArray(arr, i) {\n return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest();\n}\n\nfunction _arrayWithHoles(arr) {\n if (Array.isArray(arr)) return arr;\n}\n\nfunction _iterableToArrayLimit(arr, i) {\n if (typeof Symbol === \"undefined\" || !(Symbol.iterator in Object(arr))) return;\n var _arr = [];\n var _n = true;\n var _d = false;\n var _e = undefined;\n\n try {\n for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) {\n _arr.push(_s.value);\n\n if (i && _arr.length === i) break;\n }\n } catch (err) {\n _d = true;\n _e = err;\n } finally {\n try {\n if (!_n && _i[\"return\"] != null) _i[\"return\"]();\n } finally {\n if (_d) throw _e;\n }\n }\n\n return _arr;\n}\n\nfunction _unsupportedIterableToArray(o, minLen) {\n if (!o) return;\n if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n var n = Object.prototype.toString.call(o).slice(8, -1);\n if (n === \"Object\" && o.constructor) n = o.constructor.name;\n if (n === \"Map\" || n === \"Set\") return Array.from(o);\n if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\n\nfunction _arrayLikeToArray(arr, len) {\n if (len == null || len > arr.length) len = arr.length;\n\n for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];\n\n return arr2;\n}\n\nfunction _nonIterableRest() {\n throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nexport { _arrayLikeToArray as arrayLikeToArray, _arrayWithHoles as arrayWithHoles, _defineProperty as defineProperty, _iterableToArrayLimit as iterableToArrayLimit, _nonIterableRest as nonIterableRest, _objectSpread2 as objectSpread2, _slicedToArray as slicedToArray, _unsupportedIterableToArray as unsupportedIterableToArray };\n","function _defineProperty(obj, key, value) {\n if (key in obj) {\n Object.defineProperty(obj, key, {\n value: value,\n enumerable: true,\n configurable: true,\n writable: true\n });\n } else {\n obj[key] = value;\n }\n\n return obj;\n}\n\nfunction ownKeys(object, enumerableOnly) {\n var keys = Object.keys(object);\n\n if (Object.getOwnPropertySymbols) {\n var symbols = Object.getOwnPropertySymbols(object);\n if (enumerableOnly) symbols = symbols.filter(function (sym) {\n return Object.getOwnPropertyDescriptor(object, sym).enumerable;\n });\n keys.push.apply(keys, symbols);\n }\n\n return keys;\n}\n\nfunction _objectSpread2(target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i] != null ? arguments[i] : {};\n\n if (i % 2) {\n ownKeys(Object(source), true).forEach(function (key) {\n _defineProperty(target, key, source[key]);\n });\n } else if (Object.getOwnPropertyDescriptors) {\n Object.defineProperties(target, Object.getOwnPropertyDescriptors(source));\n } else {\n ownKeys(Object(source)).forEach(function (key) {\n Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));\n });\n }\n }\n\n return target;\n}\n\nfunction compose() {\n for (var _len = arguments.length, fns = new Array(_len), _key = 0; _key < _len; _key++) {\n fns[_key] = arguments[_key];\n }\n\n return function (x) {\n return fns.reduceRight(function (y, f) {\n return f(y);\n }, x);\n };\n}\n\nfunction curry(fn) {\n return function curried() {\n var _this = this;\n\n for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n args[_key2] = arguments[_key2];\n }\n\n return args.length >= fn.length ? fn.apply(this, args) : function () {\n for (var _len3 = arguments.length, nextArgs = new Array(_len3), _key3 = 0; _key3 < _len3; _key3++) {\n nextArgs[_key3] = arguments[_key3];\n }\n\n return curried.apply(_this, [].concat(args, nextArgs));\n };\n };\n}\n\nfunction isObject(value) {\n return {}.toString.call(value).includes('Object');\n}\n\nfunction isEmpty(obj) {\n return !Object.keys(obj).length;\n}\n\nfunction isFunction(value) {\n return typeof value === 'function';\n}\n\nfunction hasOwnProperty(object, property) {\n return Object.prototype.hasOwnProperty.call(object, property);\n}\n\nfunction validateChanges(initial, changes) {\n if (!isObject(changes)) errorHandler('changeType');\n if (Object.keys(changes).some(function (field) {\n return !hasOwnProperty(initial, field);\n })) errorHandler('changeField');\n return changes;\n}\n\nfunction validateSelector(selector) {\n if (!isFunction(selector)) errorHandler('selectorType');\n}\n\nfunction validateHandler(handler) {\n if (!(isFunction(handler) || isObject(handler))) errorHandler('handlerType');\n if (isObject(handler) && Object.values(handler).some(function (_handler) {\n return !isFunction(_handler);\n })) errorHandler('handlersType');\n}\n\nfunction validateInitial(initial) {\n if (!initial) errorHandler('initialIsRequired');\n if (!isObject(initial)) errorHandler('initialType');\n if (isEmpty(initial)) errorHandler('initialContent');\n}\n\nfunction throwError(errorMessages, type) {\n throw new Error(errorMessages[type] || errorMessages[\"default\"]);\n}\n\nvar errorMessages = {\n initialIsRequired: 'initial state is required',\n initialType: 'initial state should be an object',\n initialContent: 'initial state shouldn\\'t be an empty object',\n handlerType: 'handler should be an object or a function',\n handlersType: 'all handlers should be a functions',\n selectorType: 'selector should be a function',\n changeType: 'provided value of changes should be an object',\n changeField: 'it seams you want to change a field in the state which is not specified in the \"initial\" state',\n \"default\": 'an unknown error accured in `state-local` package'\n};\nvar errorHandler = curry(throwError)(errorMessages);\nvar validators = {\n changes: validateChanges,\n selector: validateSelector,\n handler: validateHandler,\n initial: validateInitial\n};\n\nfunction create(initial) {\n var handler = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n validators.initial(initial);\n validators.handler(handler);\n var state = {\n current: initial\n };\n var didUpdate = curry(didStateUpdate)(state, handler);\n var update = curry(updateState)(state);\n var validate = curry(validators.changes)(initial);\n var getChanges = curry(extractChanges)(state);\n\n function getState() {\n var selector = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : function (state) {\n return state;\n };\n validators.selector(selector);\n return selector(state.current);\n }\n\n function setState(causedChanges) {\n compose(didUpdate, update, validate, getChanges)(causedChanges);\n }\n\n return [getState, setState];\n}\n\nfunction extractChanges(state, causedChanges) {\n return isFunction(causedChanges) ? causedChanges(state.current) : causedChanges;\n}\n\nfunction updateState(state, changes) {\n state.current = _objectSpread2(_objectSpread2({}, state.current), changes);\n return changes;\n}\n\nfunction didStateUpdate(state, handler, changes) {\n isFunction(handler) ? handler(state.current) : Object.keys(changes).forEach(function (field) {\n var _handler$field;\n\n return (_handler$field = handler[field]) === null || _handler$field === void 0 ? void 0 : _handler$field.call(handler, state.current[field]);\n });\n return changes;\n}\n\nvar index = {\n create: create\n};\n\nexport default index;\n","var config = {\n paths: {\n vs: 'https://cdn.jsdelivr.net/npm/monaco-editor@0.25.2/min/vs'\n }\n};\n\nexport default config;\n","function isObject(value) {\n return {}.toString.call(value).includes('Object');\n}\n\nexport default isObject;\n","import curry from '../utils/curry.js';\nimport isObject from '../utils/isObject.js';\n\n/**\n * validates the configuration object and informs about deprecation\n * @param {Object} config - the configuration object \n * @return {Object} config - the validated configuration object\n */\n\nfunction validateConfig(config) {\n if (!config) errorHandler('configIsRequired');\n if (!isObject(config)) errorHandler('configType');\n\n if (config.urls) {\n informAboutDeprecation();\n return {\n paths: {\n vs: config.urls.monacoBase\n }\n };\n }\n\n return config;\n}\n/**\n * logs deprecation message\n */\n\n\nfunction informAboutDeprecation() {\n console.warn(errorMessages.deprecation);\n}\n\nfunction throwError(errorMessages, type) {\n throw new Error(errorMessages[type] || errorMessages[\"default\"]);\n}\n\nvar errorMessages = {\n configIsRequired: 'the configuration object is required',\n configType: 'the configuration object should be an object',\n \"default\": 'an unknown error accured in `@monaco-editor/loader` package',\n deprecation: \"Deprecation warning!\\n You are using deprecated way of configuration.\\n\\n Instead of using\\n monaco.config({ urls: { monacoBase: '...' } })\\n use\\n monaco.config({ paths: { vs: '...' } })\\n\\n For more please check the link https://github.com/suren-atoyan/monaco-loader#config\\n \"\n};\nvar errorHandler = curry(throwError)(errorMessages);\nvar validators = {\n config: validateConfig\n};\n\nexport default validators;\nexport { errorHandler, errorMessages };\n","function curry(fn) {\n return function curried() {\n var _this = this;\n\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n return args.length >= fn.length ? fn.apply(this, args) : function () {\n for (var _len2 = arguments.length, nextArgs = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n nextArgs[_key2] = arguments[_key2];\n }\n\n return curried.apply(_this, [].concat(args, nextArgs));\n };\n };\n}\n\nexport default curry;\n","var compose = function compose() {\n for (var _len = arguments.length, fns = new Array(_len), _key = 0; _key < _len; _key++) {\n fns[_key] = arguments[_key];\n }\n\n return function (x) {\n return fns.reduceRight(function (y, f) {\n return f(y);\n }, x);\n };\n};\n\nexport default compose;\n","import { objectSpread2 as _objectSpread2 } from '../_virtual/_rollupPluginBabelHelpers.js';\n\nfunction merge(target, source) {\n Object.keys(source).forEach(function (key) {\n if (source[key] instanceof Object) {\n if (target[key]) {\n Object.assign(source[key], merge(target[key], source[key]));\n }\n }\n });\n return _objectSpread2(_objectSpread2({}, target), source);\n}\n\nexport default merge;\n","// The source (has been changed) is https://github.com/facebook/react/issues/5465#issuecomment-157888325\nvar CANCELATION_MESSAGE = {\n type: 'cancelation',\n msg: 'operation is manually canceled'\n};\n\nfunction makeCancelable(promise) {\n var hasCanceled_ = false;\n var wrappedPromise = new Promise(function (resolve, reject) {\n promise.then(function (val) {\n return hasCanceled_ ? reject(CANCELATION_MESSAGE) : resolve(val);\n });\n promise[\"catch\"](reject);\n });\n return wrappedPromise.cancel = function () {\n return hasCanceled_ = true;\n }, wrappedPromise;\n}\n\nexport default makeCancelable;\nexport { CANCELATION_MESSAGE };\n","import { slicedToArray as _slicedToArray } from '../_virtual/_rollupPluginBabelHelpers.js';\nimport state from 'state-local';\nimport config$1 from '../config/index.js';\nimport validators from '../validators/index.js';\nimport compose from '../utils/compose.js';\nimport merge from '../utils/deepMerge.js';\nimport makeCancelable from '../utils/makeCancelable.js';\n\n/** the local state of the module */\n\nvar _state$create = state.create({\n config: config$1,\n isInitialized: false,\n resolve: null,\n reject: null,\n monaco: null\n}),\n _state$create2 = _slicedToArray(_state$create, 2),\n getState = _state$create2[0],\n setState = _state$create2[1];\n/**\n * set the loader configuration\n * @param {Object} config - the configuration object\n */\n\n\nfunction config(config) {\n setState(function (state) {\n return {\n config: merge(state.config, validators.config(config))\n };\n });\n}\n/**\n * handles the initialization of the monaco-editor\n * @return {Promise} - returns an instance of monaco (with a cancelable promise)\n */\n\n\nfunction init() {\n var state = getState(function (_ref) {\n var isInitialized = _ref.isInitialized;\n return {\n isInitialized: isInitialized\n };\n });\n\n if (!state.isInitialized) {\n if (window.monaco && window.monaco.editor) {\n storeMonacoInstance(window.monaco);\n return makeCancelable(Promise.resolve(window.monaco));\n }\n\n compose(injectScripts, getMonacoLoaderScript)(configureLoader);\n setState({\n isInitialized: true\n });\n }\n\n return makeCancelable(wrapperPromise);\n}\n/**\n * injects provided scripts into the document.body\n * @param {Object} script - an HTML script element\n * @return {Object} - the injected HTML script element\n */\n\n\nfunction injectScripts(script) {\n return document.body.appendChild(script);\n}\n/**\n * creates an HTML script element with/without provided src\n * @param {string} [src] - the source path of the script\n * @return {Object} - the created HTML script element\n */\n\n\nfunction createScript(src) {\n var script = document.createElement('script');\n return src && (script.src = src), script;\n}\n/**\n * creates an HTML script element with the monaco loader src\n * @return {Object} - the created HTML script element\n */\n\n\nfunction getMonacoLoaderScript(configureLoader) {\n var state = getState(function (_ref2) {\n var config = _ref2.config,\n reject = _ref2.reject;\n return {\n config: config,\n reject: reject\n };\n });\n var loaderScript = createScript(\"\".concat(state.config.paths.vs, \"/loader.js\"));\n\n loaderScript.onload = function () {\n return configureLoader();\n };\n\n loaderScript.onerror = state.reject;\n return loaderScript;\n}\n/**\n * configures the monaco loader\n */\n\n\nfunction configureLoader() {\n var state = getState(function (_ref3) {\n var config = _ref3.config,\n resolve = _ref3.resolve,\n reject = _ref3.reject;\n return {\n config: config,\n resolve: resolve,\n reject: reject\n };\n });\n var require = window.require;\n\n require.config(state.config);\n\n require(['vs/editor/editor.main'], function (monaco) {\n storeMonacoInstance(monaco);\n state.resolve(monaco);\n }, function (error) {\n state.reject(error);\n });\n}\n/**\n * store monaco instance in local state\n */\n\n\nfunction storeMonacoInstance(monaco) {\n if (!getState().monaco) {\n setState({\n monaco: monaco\n });\n }\n}\n/**\n * internal helper function\n * extracts stored monaco instance\n * @return {Object|null} - the monaco instance\n */\n\n\nfunction __getMonacoInstance() {\n return getState(function (_ref4) {\n var monaco = _ref4.monaco;\n return monaco;\n });\n}\n\nvar wrapperPromise = new Promise(function (resolve, reject) {\n return setState({\n resolve: resolve,\n reject: reject\n });\n});\nvar loader = {\n config: config,\n init: init,\n __getMonacoInstance: __getMonacoInstance\n};\n\nexport default loader;\n","import React from 'react';\n\nconst loadingStyles = {\n display: 'flex',\n height: '100%',\n width: '100%',\n justifyContent: 'center',\n alignItems: 'center'\n};\n\nfunction Loading({\n content\n}) {\n return /*#__PURE__*/React.createElement(\"div\", {\n style: loadingStyles\n }, content);\n}\n\nexport default Loading;\n","const styles = {\n wrapper: {\n display: 'flex',\n position: 'relative',\n textAlign: 'initial'\n },\n fullWidth: {\n width: '100%'\n },\n hide: {\n display: 'none'\n }\n};\n\nexport default styles;\n","import React from 'react';\nimport PropTypes from 'prop-types';\nimport Loading from '../Loading/Loading.js';\nimport styles from './styles.js';\n\n// one of the reasons why we use a separate prop for passing ref instead of using forwardref\n\nfunction MonacoContainer({\n width,\n height,\n isEditorReady,\n loading,\n _ref,\n className,\n wrapperClassName\n}) {\n return /*#__PURE__*/React.createElement(\"section\", {\n style: { ...styles.wrapper,\n width,\n height\n },\n className: wrapperClassName\n }, !isEditorReady && /*#__PURE__*/React.createElement(Loading, {\n content: loading\n }), /*#__PURE__*/React.createElement(\"div\", {\n ref: _ref,\n style: { ...styles.fullWidth,\n ...(!isEditorReady && styles.hide)\n },\n className: className\n }));\n}\n\nMonacoContainer.propTypes = {\n width: PropTypes.oneOfType([PropTypes.number, PropTypes.string]).isRequired,\n height: PropTypes.oneOfType([PropTypes.number, PropTypes.string]).isRequired,\n loading: PropTypes.oneOfType([PropTypes.element, PropTypes.string]).isRequired,\n isEditorReady: PropTypes.bool.isRequired,\n className: PropTypes.string,\n wrapperClassName: PropTypes.string\n};\n\nexport default MonacoContainer;\n","import { memo } from 'react';\nimport MonacoContainer$1 from './MonacoContainer.js';\n\nvar MonacoContainer = /*#__PURE__*/memo(MonacoContainer$1);\n\nexport default MonacoContainer;\n","import { useEffect } from 'react';\n\nfunction useMount(effect) {\n useEffect(effect, []);\n}\n\nexport default useMount;\n","import { useRef, useEffect } from 'react';\n\nfunction useUpdate(effect, deps, applyChanges = true) {\n const isInitialMount = useRef(true);\n useEffect(isInitialMount.current || !applyChanges ? () => {\n isInitialMount.current = false;\n } : effect, deps);\n}\n\nexport default useUpdate;\n","function noop() {}\n\nfunction getOrCreateModel(monaco, value, language, path) {\n return getModel(monaco, path) || createModel(monaco, value, language, path);\n}\n\nfunction getModel(monaco, path) {\n return monaco.editor.getModel(crateModelUri(monaco, path));\n}\n\nfunction createModel(monaco, value, language, path) {\n return monaco.editor.createModel(value, language, path && crateModelUri(monaco, path));\n}\n\nfunction crateModelUri(monaco, path) {\n return monaco.Uri.parse(path);\n}\n\nfunction isUndefined(input) {\n return input === undefined;\n}\n\nexport { getOrCreateModel, isUndefined, noop };\n","import loader from '@monaco-editor/loader';\nimport React, { useState, useRef, useCallback, useEffect } from 'react';\nimport PropTypes from 'prop-types';\nimport MonacoContainer from '../MonacoContainer/index.js';\nimport useMount from '../hooks/useMount/index.js';\nimport useUpdate from '../hooks/useUpdate/index.js';\nimport { noop } from '../utils/index.js';\n\nfunction DiffEditor({\n original,\n modified,\n language,\n originalLanguage,\n modifiedLanguage,\n\n /* === */\n originalModelPath,\n modifiedModelPath,\n keepCurrentOriginalModel,\n keepCurrentModifiedModel,\n theme,\n loading,\n options,\n\n /* === */\n height,\n width,\n className,\n wrapperClassName,\n\n /* === */\n beforeMount,\n onMount\n}) {\n const [isEditorReady, setIsEditorReady] = useState(false);\n const [isMonacoMounting, setIsMonacoMounting] = useState(true);\n const editorRef = useRef(null);\n const monacoRef = useRef(null);\n const containerRef = useRef(null);\n const onMountRef = useRef(onMount);\n const beforeMountRef = useRef(beforeMount);\n useMount(() => {\n const cancelable = loader.init();\n cancelable.then(monaco => (monacoRef.current = monaco) && setIsMonacoMounting(false)).catch(error => (error === null || error === void 0 ? void 0 : error.type) !== 'cancelation' && console.error('Monaco initialization: error:', error));\n return () => editorRef.current ? disposeEditor() : cancelable.cancel();\n });\n useUpdate(() => {\n const modifiedEditor = editorRef.current.getModifiedEditor();\n\n if (modifiedEditor.getOption(monacoRef.current.editor.EditorOption.readOnly)) {\n modifiedEditor.setValue(modified);\n } else {\n if (modified !== modifiedEditor.getValue()) {\n modifiedEditor.executeEdits('', [{\n range: modifiedEditor.getModel().getFullModelRange(),\n text: modified,\n forceMoveMarkers: true\n }]);\n modifiedEditor.pushUndoStop();\n }\n }\n }, [modified], isEditorReady);\n useUpdate(() => {\n editorRef.current.getModel().original.setValue(original);\n }, [original], isEditorReady);\n useUpdate(() => {\n const {\n original,\n modified\n } = editorRef.current.getModel();\n monacoRef.current.editor.setModelLanguage(original, originalLanguage || language);\n monacoRef.current.editor.setModelLanguage(modified, modifiedLanguage || language);\n }, [language, originalLanguage, modifiedLanguage], isEditorReady);\n useUpdate(() => {\n monacoRef.current.editor.setTheme(theme);\n }, [theme], isEditorReady);\n useUpdate(() => {\n editorRef.current.updateOptions(options);\n }, [options], isEditorReady);\n const setModels = useCallback(() => {\n beforeMountRef.current(monacoRef.current);\n const originalModel = monacoRef.current.editor.createModel(original, originalLanguage || language, originalModelPath && monacoRef.current.Uri.parse(originalModelPath));\n const modifiedModel = monacoRef.current.editor.createModel(modified, modifiedLanguage || language, modifiedModelPath && monacoRef.current.Uri.parse(modifiedModelPath));\n editorRef.current.setModel({\n original: originalModel,\n modified: modifiedModel\n });\n }, [language, modified, modifiedLanguage, original, originalLanguage, originalModelPath, modifiedModelPath]);\n const createEditor = useCallback(() => {\n editorRef.current = monacoRef.current.editor.createDiffEditor(containerRef.current, {\n automaticLayout: true,\n ...options\n });\n setModels();\n monacoRef.current.editor.setTheme(theme);\n setIsEditorReady(true);\n }, [options, theme, setModels]);\n useEffect(() => {\n if (isEditorReady) {\n onMountRef.current(editorRef.current, monacoRef.current);\n }\n }, [isEditorReady]);\n useEffect(() => {\n !isMonacoMounting && !isEditorReady && createEditor();\n }, [isMonacoMounting, isEditorReady, createEditor]);\n\n function disposeEditor() {\n const models = editorRef.current.getModel();\n\n if (!keepCurrentOriginalModel) {\n var _models$original;\n\n (_models$original = models.original) === null || _models$original === void 0 ? void 0 : _models$original.dispose();\n }\n\n if (!keepCurrentModifiedModel) {\n var _models$modified;\n\n (_models$modified = models.modified) === null || _models$modified === void 0 ? void 0 : _models$modified.dispose();\n }\n\n editorRef.current.dispose();\n }\n\n return /*#__PURE__*/React.createElement(MonacoContainer, {\n width: width,\n height: height,\n isEditorReady: isEditorReady,\n loading: loading,\n _ref: containerRef,\n className: className,\n wrapperClassName: wrapperClassName\n });\n}\n\nDiffEditor.propTypes = {\n original: PropTypes.string,\n modified: PropTypes.string,\n language: PropTypes.string,\n originalLanguage: PropTypes.string,\n modifiedLanguage: PropTypes.string,\n\n /* === */\n originalModelPath: PropTypes.string,\n modifiedModelPath: PropTypes.string,\n keepCurrentOriginalModel: PropTypes.bool,\n keepCurrentModifiedModel: PropTypes.bool,\n theme: PropTypes.string,\n loading: PropTypes.oneOfType([PropTypes.element, PropTypes.string]),\n options: PropTypes.object,\n\n /* === */\n width: PropTypes.oneOfType([PropTypes.number, PropTypes.string]),\n height: PropTypes.oneOfType([PropTypes.number, PropTypes.string]),\n className: PropTypes.string,\n wrapperClassName: PropTypes.string,\n\n /* === */\n beforeMount: PropTypes.func,\n onMount: PropTypes.func\n};\nDiffEditor.defaultProps = {\n theme: 'light',\n loading: 'Loading...',\n options: {},\n keepCurrentOriginalModel: false,\n keepCurrentModifiedModel: false,\n\n /* === */\n width: '100%',\n height: '100%',\n\n /* === */\n beforeMount: noop,\n onMount: noop\n};\n\nexport default DiffEditor;\n","import { useRef, useEffect } from 'react';\n\nfunction usePrevious(value) {\n const ref = useRef();\n useEffect(() => {\n ref.current = value;\n }, [value]);\n return ref.current;\n}\n\nexport default usePrevious;\n","import loader from '@monaco-editor/loader';\nimport React, { useState, useRef, useCallback, useEffect } from 'react';\nimport PropTypes from 'prop-types';\nimport MonacoContainer from '../MonacoContainer/index.js';\nimport useMount from '../hooks/useMount/index.js';\nimport useUpdate from '../hooks/useUpdate/index.js';\nimport { getOrCreateModel, noop, isUndefined } from '../utils/index.js';\nimport usePrevious from '../hooks/usePrevious/index.js';\n\nconst viewStates = new Map();\n\nfunction Editor({\n defaultValue,\n defaultLanguage,\n defaultPath,\n value,\n language,\n path,\n\n /* === */\n theme,\n line,\n loading,\n options,\n overrideServices,\n saveViewState,\n keepCurrentModel,\n\n /* === */\n width,\n height,\n className,\n wrapperClassName,\n\n /* === */\n beforeMount,\n onMount,\n onChange,\n onValidate\n}) {\n const [isEditorReady, setIsEditorReady] = useState(false);\n const [isMonacoMounting, setIsMonacoMounting] = useState(true);\n const monacoRef = useRef(null);\n const editorRef = useRef(null);\n const containerRef = useRef(null);\n const onMountRef = useRef(onMount);\n const beforeMountRef = useRef(beforeMount);\n const subscriptionRef = useRef(null);\n const valueRef = useRef(value);\n const previousPath = usePrevious(path);\n useMount(() => {\n const cancelable = loader.init();\n cancelable.then(monaco => (monacoRef.current = monaco) && setIsMonacoMounting(false)).catch(error => (error === null || error === void 0 ? void 0 : error.type) !== 'cancelation' && console.error('Monaco initialization: error:', error));\n return () => editorRef.current ? disposeEditor() : cancelable.cancel();\n });\n useUpdate(() => {\n const model = getOrCreateModel(monacoRef.current, defaultValue || value, defaultLanguage || language, path);\n\n if (model !== editorRef.current.getModel()) {\n saveViewState && viewStates.set(previousPath, editorRef.current.saveViewState());\n editorRef.current.setModel(model);\n saveViewState && editorRef.current.restoreViewState(viewStates.get(path));\n }\n }, [path], isEditorReady);\n useUpdate(() => {\n editorRef.current.updateOptions(options);\n }, [options], isEditorReady);\n useUpdate(() => {\n if (editorRef.current.getOption(monacoRef.current.editor.EditorOption.readOnly)) {\n editorRef.current.setValue(value);\n } else {\n if (value !== editorRef.current.getValue()) {\n editorRef.current.executeEdits('', [{\n range: editorRef.current.getModel().getFullModelRange(),\n text: value,\n forceMoveMarkers: true\n }]);\n editorRef.current.pushUndoStop();\n }\n }\n }, [value], isEditorReady);\n useUpdate(() => {\n monacoRef.current.editor.setModelLanguage(editorRef.current.getModel(), language);\n }, [language], isEditorReady);\n useUpdate(() => {\n // reason for undefined check: https://github.com/suren-atoyan/monaco-react/pull/188\n if (!isUndefined(line)) {\n editorRef.current.revealLine(line);\n }\n }, [line], isEditorReady);\n useUpdate(() => {\n monacoRef.current.editor.setTheme(theme);\n }, [theme], isEditorReady);\n const createEditor = useCallback(() => {\n beforeMountRef.current(monacoRef.current);\n const autoCreatedModelPath = path || defaultPath;\n const defaultModel = getOrCreateModel(monacoRef.current, value || defaultValue, defaultLanguage || language, autoCreatedModelPath);\n editorRef.current = monacoRef.current.editor.create(containerRef.current, {\n model: defaultModel,\n automaticLayout: true,\n ...options\n }, overrideServices);\n saveViewState && editorRef.current.restoreViewState(viewStates.get(autoCreatedModelPath));\n monacoRef.current.editor.setTheme(theme);\n setIsEditorReady(true);\n }, [defaultValue, defaultLanguage, defaultPath, value, language, path, options, overrideServices, saveViewState, theme]);\n useEffect(() => {\n if (isEditorReady) {\n onMountRef.current(editorRef.current, monacoRef.current);\n }\n }, [isEditorReady]);\n useEffect(() => {\n !isMonacoMounting && !isEditorReady && createEditor();\n }, [isMonacoMounting, isEditorReady, createEditor]); // subscription\n // to avoid unnecessary updates (attach - dispose listener) in subscription\n\n valueRef.current = value;\n useEffect(() => {\n if (isEditorReady && onChange) {\n var _subscriptionRef$curr, _editorRef$current;\n\n (_subscriptionRef$curr = subscriptionRef.current) === null || _subscriptionRef$curr === void 0 ? void 0 : _subscriptionRef$curr.dispose();\n subscriptionRef.current = (_editorRef$current = editorRef.current) === null || _editorRef$current === void 0 ? void 0 : _editorRef$current.onDidChangeModelContent(event => {\n const editorValue = editorRef.current.getValue();\n\n if (valueRef.current !== editorValue) {\n onChange(editorValue, event);\n }\n });\n }\n }, [isEditorReady, onChange]); // onValidate\n\n useEffect(() => {\n if (isEditorReady) {\n const changeMarkersListener = monacoRef.current.editor.onDidChangeMarkers(uris => {\n var _editorRef$current$ge;\n\n const editorUri = (_editorRef$current$ge = editorRef.current.getModel()) === null || _editorRef$current$ge === void 0 ? void 0 : _editorRef$current$ge.uri;\n\n if (editorUri) {\n const currentEditorHasMarkerChanges = uris.find(uri => uri.path === editorUri.path);\n\n if (currentEditorHasMarkerChanges) {\n const markers = monacoRef.current.editor.getModelMarkers({\n resource: editorUri\n });\n onValidate === null || onValidate === void 0 ? void 0 : onValidate(markers);\n }\n }\n });\n return () => {\n changeMarkersListener === null || changeMarkersListener === void 0 ? void 0 : changeMarkersListener.dispose();\n };\n }\n }, [isEditorReady, onValidate]);\n\n function disposeEditor() {\n var _subscriptionRef$curr2;\n\n (_subscriptionRef$curr2 = subscriptionRef.current) === null || _subscriptionRef$curr2 === void 0 ? void 0 : _subscriptionRef$curr2.dispose();\n\n if (keepCurrentModel) {\n saveViewState && viewStates.set(path, editorRef.current.saveViewState());\n } else {\n var _editorRef$current$ge2;\n\n (_editorRef$current$ge2 = editorRef.current.getModel()) === null || _editorRef$current$ge2 === void 0 ? void 0 : _editorRef$current$ge2.dispose();\n }\n\n editorRef.current.dispose();\n }\n\n return /*#__PURE__*/React.createElement(MonacoContainer, {\n width: width,\n height: height,\n isEditorReady: isEditorReady,\n loading: loading,\n _ref: containerRef,\n className: className,\n wrapperClassName: wrapperClassName\n });\n}\n\nEditor.propTypes = {\n defaultValue: PropTypes.string,\n defaultPath: PropTypes.string,\n defaultLanguage: PropTypes.string,\n value: PropTypes.string,\n language: PropTypes.string,\n path: PropTypes.string,\n\n /* === */\n theme: PropTypes.string,\n line: PropTypes.number,\n loading: PropTypes.oneOfType([PropTypes.element, PropTypes.string]),\n options: PropTypes.object,\n overrideServices: PropTypes.object,\n saveViewState: PropTypes.bool,\n keepCurrentModel: PropTypes.bool,\n\n /* === */\n width: PropTypes.oneOfType([PropTypes.number, PropTypes.string]),\n height: PropTypes.oneOfType([PropTypes.number, PropTypes.string]),\n className: PropTypes.string,\n wrapperClassName: PropTypes.string,\n\n /* === */\n beforeMount: PropTypes.func,\n onMount: PropTypes.func,\n onChange: PropTypes.func,\n onValidate: PropTypes.func\n};\nEditor.defaultProps = {\n theme: 'light',\n loading: 'Loading...',\n options: {},\n overrideServices: {},\n saveViewState: true,\n keepCurrentModel: false,\n\n /* === */\n width: '100%',\n height: '100%',\n\n /* === */\n beforeMount: noop,\n onMount: noop,\n onValidate: noop\n};\n\nexport default Editor;\n","import { memo } from 'react';\nimport Editor from './Editor.js';\n\nvar index = /*#__PURE__*/memo(Editor);\n\nexport default index;\n","import { ACESVGDefaults } from './types';\n\nexport const props_defaults: ACESVGDefaults = {\n svgNode: `\n\n \n \n \n image/svg+xml\n \n \n \n \n \n \n \n .cls-1{fill:#2a2e3c;}.cls-2{fill:#c1d301;}.cls-3{fill:#f6511d;}.cls-4{fill:#fff;}.cls-5{fill:#595e71;}\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n>\n `,\n initSource: `options.animateLogo = (svgmap, data) => {\n let buffer = data.series[0].fields[1].values.buffer;\n let valueCount = buffer.length\n let chartData = [];\n for (let i=0; i {\n return Math.min(acc, val);\n });\n let maxData = 1.05 * chartData.reduce((acc, val) => {\n return Math.max(acc, val);\n });\n let spread = maxData - minData;\n let iconHeight = svgmap.iconbg.height();\n let iconY = svgmap.iconbg.y();\n [svgmap.barOne, svgmap.barTwo, svgmap.barThree, svgmap.barFour].forEach((elem) => {\n elem.animate(1000).ease('<>').move(elem.x(), ((iconHeight * (chartData[0] / maxData)) - elem.height())).loop(0, true);\n });\n }\n `,\n eventSource: `// example of calling a function defined in the init script\noptions.animateLogo(svgmap, data);\n// Here we're going to initialized some variables just to make things less verbose\n// This is the raw buffer from the values field of the DataFrame\nlet buffer = data.series[0].fields[1].values.buffer;\n// here we collect the most recent value from the Data Frame\nlet lastValue = buffer[buffer.length -1]\n// We need to collect the center of the fan as a static value here, otherwise it will cause a feedback loop in the animation.\n// The rotate animation will use the center of the bounding box by default, but of irregular shaped items, like these fan blades\n// the center is not the center axis of rotation\nconst fanX = svgmap.fanBlades.cx();\nconst fanY = svgmap.fanBlades.cy();\n// Here we're defining a state condition to use later in our pipe animation\nlet leakCond = lastValue > 10 && lastValue < 45;\n\n// Here we're simply making the visibility of the alert icon on top of tbe bell dependent on the last value being greater than 50\nsvgmap.alarmIcon.showOn(lastValue > 50);\n// Now we use the same logic to apply an animation to the sound waves around the bell\nsvgmap.alarmRings.animateOn(1500, (lastValue > 50), (elem) => {\n // this callback is passed the resulting SVG.js runner object which you then chain your animation actions on.\n // Here, we're simply scaling the dark sound wave lines by 10%, with bidirectional easing and looping with swing\n elem.ease('<>').transform({scale: 1.1, relative: true}).loop(0, true);\n})\n// Here we animate the fan, using the static variables we create earlier to get closer to the center of the blades\n// if the item we were rotating was centered in the bounding box, we could just call rotate(360) with no axis specificied\nsvgmap.fanBlades.animateOn(1000, (lastValue > 40), (elem) => {\n elem.ease('-').rotate(360, fanX - 1, fanY +3).loop();\n});\n// these simply hide the elements of the lamp when below the threshold\nsvgmap.lampLens.showOn(lastValue>10);\nsvgmap.lampRays.showOn(lastValue>10);\n// Here we hide the water drop when leakCond is false\nsvgmap.waterDrop.showOn(leakCond)\n// and here we animate the water drop when leakCond is true\nsvgmap.waterDrop.animateOn(2000 - lastValue *20, leakCond, (elem) => {\n // we're using single direction easing to give a gravity affect, and scaling the drop down as it falls off the screen\n elem.ease('<').transform({translateY: 1000, scale: 0.00001}).loop();\n})\n`,\n svgMappings: [\n {\n mappedName: 'barTwo',\n svgId: 'rect4526',\n },\n {\n mappedName: 'barThree',\n svgId: 'rect4528',\n },\n {\n mappedName: 'barFour',\n svgId: 'rect4530',\n },\n {\n mappedName: 'iconbg',\n svgId: 'rect4522',\n },\n {\n mappedName: 'spline',\n svgId: 'path4538',\n },\n {\n mappedName: 'barOne',\n svgId: 'rect4524',\n },\n {\n mappedName: 'fanBlades',\n svgId: 'g1550',\n },\n {\n mappedName: 'alarmIcon',\n svgId: 'g1721',\n },\n {\n mappedName: 'lampLens',\n svgId: 'g1942',\n },\n {\n mappedName: 'lampRays',\n svgId: 'g1917',\n },\n {\n mappedName: 'waterDrop',\n svgId: 'g1995',\n },\n {\n mappedName: 'alarmRings',\n svgId: 'g1891',\n },\n ],\n};\n","import React from 'react';\nimport { GrafanaTheme, PanelOptionsEditorBuilder, PanelOptionsEditorProps } from '@grafana/data';\nimport Editor from '@monaco-editor/react';\nimport * as monaco from 'monaco-editor/esm/vs/editor/editor.api';\n\nimport { css } from 'emotion';\nimport { config } from '@grafana/runtime';\nimport { ACESVGOptions, SVGIDMapping } from './types';\nimport { props_defaults } from 'examples';\n// import { Input, stylesFactory, Icon, HorizontalGroup, Label, VerticalGroup, useTheme } from '@grafana/ui';\nimport { Button, HorizontalGroup, Input, Label, Tooltip, VerticalGroup } from '@grafana/ui';\n\ninterface MonacoEditorProps {\n value: string;\n theme: string;\n language: string;\n onChange: (value?: string | undefined) => void;\n}\nclass MonacoEditor extends React.PureComponent {\n editorInstance: monaco.editor.IStandaloneCodeEditor | undefined;\n\n onSourceChange = () => {\n if (typeof this.editorInstance !== 'undefined') {\n this.props.onChange(this.editorInstance.getValue());\n }\n };\n onEditorDidMount = (editor: monaco.editor.IStandaloneCodeEditor) => {\n this.editorInstance = editor;\n };\n updateDimensions() {\n if (typeof this.editorInstance !== 'undefined') {\n this.editorInstance.layout();\n }\n }\n render() {\n const source = this.props.value;\n if (this.editorInstance) {\n this.editorInstance.layout();\n }\n return (\n
\n \n
\n );\n }\n}\n\ninterface SVGIDMappingProps {\n value: SVGIDMapping;\n index?: number;\n styles?: any;\n onChangeItem?: (a: SVGIDMapping, b: number) => void | undefined;\n onAdd?: (a: SVGIDMapping) => void;\n onDelete?: (a: number) => void;\n}\n\nclass SvgMapping extends React.PureComponent {\n constructor(props: SVGIDMappingProps) {\n super(props);\n this.state = { ...props.value };\n }\n render() {\n const { value, index, onChangeItem, onAdd, onDelete } = this.props;\n return (\n \n \n {\n const svgId = e.currentTarget.value;\n this.setState({ svgId: svgId });\n onChangeItem && index && onChangeItem({ ...value, svgId: svgId }, index);\n }}\n />\n \n {\n const mappedName = e.currentTarget.value;\n this.setState({ mappedName: mappedName });\n onChangeItem && index && onChangeItem({ ...value, mappedName: mappedName }, index);\n }}\n />\n {value.svgId && onDelete && index !== undefined && (\n \n {\n onDelete(index);\n }}\n >\n Remove\n \n \n )}\n {!value.svgId && onAdd && (\n \n {\n onAdd(this.state as SVGIDMapping);\n }}\n >\n Add\n \n \n )}\n \n );\n }\n}\n\nclass SvgMappings extends React.PureComponent> {\n onChangeItem = (updatedMapping: SVGIDMapping, index: number) => {\n let newMappings = [...this.props.value];\n newMappings[index] = updatedMapping;\n this.props.onChange(newMappings);\n };\n onAdd = (newMapping: SVGIDMapping) => {\n if (newMapping.svgId !== '') {\n let newMappings = [...this.props.value, newMapping];\n this.props.onChange(newMappings);\n }\n };\n onDelete = (index: number) => {\n let newMappings = [...this.props.value];\n newMappings.splice(index, 1);\n this.props.onChange(newMappings);\n };\n render() {\n const styles = generateComponentStyles(config.theme);\n const svgMappings = this.props.value;\n return (\n \n \n \n {\n this.props.onChange([]);\n }}\n >\n Clear All\n \n \n \n \n {svgMappings.map((currentMapping: SVGIDMapping, index: number) => {\n return (\n \n );\n })}\n \n );\n }\n}\n\nexport const optionsBuilder = (builder: PanelOptionsEditorBuilder) => {\n return builder\n .addBooleanSwitch({\n category: ['SVG Document'],\n path: 'svgAutoComplete',\n name: 'Enable SVG AutoComplete',\n description: 'Enable editor autocompletion, optional as it can be buggy on large documents',\n })\n .addCustomEditor({\n category: ['SVG Document'],\n path: 'svgSource',\n name: 'SVG Document',\n description: `Editor for SVG Document, while small tweaks can be made here, we recommend using a dedicated\n Graphical SVG Editor and simply pasting the resulting XML here`,\n id: 'svgSource',\n defaultValue: props_defaults.svgNode,\n editor: function editor(props) {\n const grafanaTheme = config.theme.name;\n return (\n \n );\n },\n })\n .addBooleanSwitch({\n category: ['User JS Render'],\n path: 'eventAutoComplete',\n name: 'Enable Render JS AutoComplete',\n description: 'Enable editor autocompletion, optional as it can be buggy on large documents',\n defaultValue: true,\n })\n .addCustomEditor({\n category: ['User JS Render'],\n path: 'eventSource',\n name: 'User JS Render Code',\n description: `The User JS Render code is executed whenever new data is available, the root svg document is available as 'svgnode',\n and elements you've mapped using the SVG Mapping tools below are available as properties on the 'svgmap' object.\n The Grafana DataFrame is provided as 'data' and the 'options' object can be used to pass values and references between\n the Render context and the Init context`,\n id: 'eventSource',\n defaultValue: props_defaults.eventSource,\n editor: function editor(props) {\n const grafanaTheme = config.theme.name;\n return (\n \n );\n },\n })\n .addBooleanSwitch({\n category: ['User JS Init'],\n path: 'initAutoComplete',\n name: 'Enable Init JS AutoComplete',\n description: 'Enable editor autocompletion, optional as it can be buggy on large documents',\n defaultValue: true,\n })\n .addCustomEditor({\n category: ['User JS Init'],\n path: 'initSource',\n name: 'User JS Init Code',\n description: `The User JS Init code is executed once when the panel loads, you can use this to define helper functions that\n you later reference in the User JS Render code section. The sections have identical execution contexts, and any\n JS objects you want to reference between them will need to be attached to the options object as properties`,\n id: 'initSource',\n defaultValue: props_defaults.initSource,\n editor: function editor(props) {\n const grafanaTheme = config.theme.name;\n return (\n \n );\n },\n })\n .addBooleanSwitch({\n category: ['SVG Mapping'],\n path: 'addAllIDs',\n name: 'Add all SVG Element IDs',\n description:\n 'Parse the SVG Document for Elements with IDs assigned and automatically add them to the mapping list',\n defaultValue: false,\n })\n .addBooleanSwitch({\n category: ['SVG Mapping'],\n path: 'captureMappings',\n name: 'Enable SVG Mapping on Click',\n description:\n 'When activated, clicking an element in the panel will attempt to map the clicked element or its nearest parent element with an ID assigned',\n defaultValue: false,\n })\n .addCustomEditor({\n category: ['SVG Mapping'],\n id: 'svgMappings',\n path: 'svgMappings',\n name: 'SVG Mappings',\n description:\n 'The SVG ID should match an element in the SVG document with an existing ID tag, the element will be attached to the \"svgmap\" object in the user code execution contexts as a property using the Mapped Name provided below',\n defaultValue: props_defaults.svgMappings,\n editor: SvgMappings,\n });\n};\n\nconst generateComponentStyles = (theme: GrafanaTheme) => {\n return {\n colorPicker: css`\n padding: 0 ${theme.spacing.sm};\n `,\n inputPrefix: css`\n display: flex;\n align-items: center;\n `,\n trashIcon: css`\n color: ${theme.colors.textWeak};\n cursor: pointer;\n //\n &:hover {\n color: ${theme.colors.text};\n }\n `,\n addIcon: css`\n color: ${theme.colors.textWeak};\n cursor: pointer;\n //\n &:hover {\n color: ${theme.colors.text};\n }\n `,\n };\n};\n//\n","import { PanelPlugin } from '@grafana/data';\nimport { ACESVGOptions } from './types';\nimport { ACESVGPanel } from './ACESVGjsPanel';\nimport { optionsBuilder } from './options';\n\nexport const plugin = new PanelPlugin(ACESVGPanel).useFieldConfig().setPanelOptions(optionsBuilder);\n"],"sourceRoot":""} \ No newline at end of file +{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///external \"react\"","webpack:///../node_modules/prop-types/index.js","webpack:///external \"@grafana/ui\"","webpack:///external \"emotion\"","webpack:///external \"@grafana/runtime\"","webpack:///external \"@grafana/data\"","webpack:///../node_modules/prop-types/factoryWithThrowingShims.js","webpack:///../node_modules/prop-types/lib/ReactPropTypesSecret.js","webpack:///../node_modules/tslib/tslib.es6.js","webpack:///../node_modules/@svgdotjs/svg.js/dist/svg.esm.js","webpack:///../node_modules/ol/Disposable.js","webpack:///../node_modules/ol/array.js","webpack:///../node_modules/ol/functions.js","webpack:///../node_modules/ol/util.js","webpack:///../node_modules/ol/has.js","webpack:///../node_modules/ol/AssertionError.js","webpack:///../node_modules/ol/asserts.js","webpack:///../node_modules/ol/transform.js","webpack:///../node_modules/ol/extent/Corner.js","webpack:///../node_modules/ol/extent/Relationship.js","webpack:///../node_modules/ol/extent.js","webpack:///../node_modules/ol/math.js","webpack:///../node_modules/ol/color.js","webpack:///../node_modules/ol/style/IconImageCache.js","webpack:///../node_modules/ol/events/Event.js","webpack:///../node_modules/ol/ObjectEventType.js","webpack:///../node_modules/ol/obj.js","webpack:///../node_modules/ol/events/Target.js","webpack:///../node_modules/ol/events/EventType.js","webpack:///../node_modules/ol/events.js","webpack:///../node_modules/ol/Observable.js","webpack:///../node_modules/ol/Object.js","webpack:///../node_modules/ol/layer/Property.js","webpack:///../node_modules/ol/layer/Base.js","webpack:///../node_modules/ol/render/EventType.js","webpack:///../node_modules/ol/source/State.js","webpack:///../node_modules/ol/layer/Layer.js","webpack:///../node_modules/ol/coordinate.js","webpack:///../node_modules/ol/renderer/Map.js","webpack:///../node_modules/ol/render/Event.js","webpack:///../node_modules/ol/css.js","webpack:///../node_modules/ol/dom.js","webpack:///../node_modules/ol/render/canvas.js","webpack:///../node_modules/ol/renderer/Composite.js","webpack:///../node_modules/ol/CollectionEventType.js","webpack:///../node_modules/ol/Collection.js","webpack:///../node_modules/ol/layer/Group.js","webpack:///../node_modules/ol/MapEvent.js","webpack:///../node_modules/ol/MapBrowserEvent.js","webpack:///../node_modules/ol/MapBrowserEventType.js","webpack:///../node_modules/ol/pointer/EventType.js","webpack:///../node_modules/ol/MapBrowserEventHandler.js","webpack:///../node_modules/ol/MapEventType.js","webpack:///../node_modules/ol/MapProperty.js","webpack:///../node_modules/ol/structs/PriorityQueue.js","webpack:///../node_modules/ol/TileState.js","webpack:///../node_modules/ol/TileQueue.js","webpack:///../node_modules/ol/geom/GeometryType.js","webpack:///../node_modules/ol/proj/Units.js","webpack:///../node_modules/ol/ViewHint.js","webpack:///../node_modules/ol/ViewProperty.js","webpack:///../node_modules/ol/proj/Projection.js","webpack:///../node_modules/ol/proj/epsg3857.js","webpack:///../node_modules/ol/proj/epsg4326.js","webpack:///../node_modules/ol/proj/projections.js","webpack:///../node_modules/ol/proj/transforms.js","webpack:///../node_modules/ol/sphere.js","webpack:///../node_modules/ol/proj.js","webpack:///../node_modules/ol/centerconstraint.js","webpack:///../node_modules/ol/resolutionconstraint.js","webpack:///../node_modules/ol/rotationconstraint.js","webpack:///../node_modules/ol/easing.js","webpack:///../node_modules/ol/geom/GeometryLayout.js","webpack:///../node_modules/ol/geom/flat/transform.js","webpack:///../node_modules/ol/geom/Geometry.js","webpack:///../node_modules/ol/geom/SimpleGeometry.js","webpack:///../node_modules/ol/geom/flat/closest.js","webpack:///../node_modules/ol/geom/flat/deflate.js","webpack:///../node_modules/ol/geom/flat/simplify.js","webpack:///../node_modules/ol/geom/flat/inflate.js","webpack:///../node_modules/ol/geom/flat/area.js","webpack:///../node_modules/ol/geom/LinearRing.js","webpack:///../node_modules/ol/geom/Point.js","webpack:///../node_modules/ol/geom/flat/contains.js","webpack:///../node_modules/ol/geom/flat/interiorpoint.js","webpack:///../node_modules/ol/geom/flat/intersectsextent.js","webpack:///../node_modules/ol/geom/flat/segments.js","webpack:///../node_modules/ol/geom/flat/reverse.js","webpack:///../node_modules/ol/geom/flat/orient.js","webpack:///../node_modules/ol/geom/Polygon.js","webpack:///../node_modules/ol/View.js","webpack:///../node_modules/ol/tilegrid/common.js","webpack:///../node_modules/ol/size.js","webpack:///../node_modules/ol/PluggableMap.js","webpack:///../node_modules/ol/control/Control.js","webpack:///../node_modules/ol/control/Attribution.js","webpack:///../node_modules/ol/control/Rotate.js","webpack:///../node_modules/ol/control/Zoom.js","webpack:///../node_modules/ol/interaction/Property.js","webpack:///../node_modules/ol/interaction/Interaction.js","webpack:///../node_modules/ol/interaction/DoubleClickZoom.js","webpack:///../node_modules/ol/interaction/Pointer.js","webpack:///../node_modules/ol/events/condition.js","webpack:///../node_modules/ol/interaction/DragPan.js","webpack:///../node_modules/ol/interaction/DragRotate.js","webpack:///../node_modules/ol/render/Box.js","webpack:///../node_modules/ol/interaction/DragBox.js","webpack:///../node_modules/ol/interaction/DragZoom.js","webpack:///../node_modules/ol/events/KeyCode.js","webpack:///../node_modules/ol/interaction/KeyboardPan.js","webpack:///../node_modules/ol/interaction/KeyboardZoom.js","webpack:///../node_modules/ol/Kinetic.js","webpack:///../node_modules/ol/interaction/MouseWheelZoom.js","webpack:///../node_modules/ol/interaction/PinchRotate.js","webpack:///../node_modules/ol/interaction/PinchZoom.js","webpack:///../node_modules/ol/Map.js","webpack:///../node_modules/ol/control.js","webpack:///../node_modules/ol/interaction.js","webpack:///../node_modules/ol/layer/TileProperty.js","webpack:///../node_modules/ol/layer/BaseTile.js","webpack:///../node_modules/ol/ImageState.js","webpack:///../node_modules/ol/renderer/Layer.js","webpack:///../node_modules/ol/renderer/canvas/Layer.js","webpack:///../node_modules/ol/TileRange.js","webpack:///../node_modules/ol/renderer/canvas/TileLayer.js","webpack:///../node_modules/ol/layer/Tile.js","webpack:///../node_modules/ol/Tile.js","webpack:///../node_modules/ol/ImageBase.js","webpack:///../node_modules/ol/Image.js","webpack:///../node_modules/ol/ImageTile.js","webpack:///../node_modules/ol/reproj.js","webpack:///../node_modules/ol/reproj/Triangulation.js","webpack:///../node_modules/ol/source/common.js","webpack:///../node_modules/ol/reproj/Tile.js","webpack:///../node_modules/ol/reproj/common.js","webpack:///../node_modules/ol/structs/LRUCache.js","webpack:///../node_modules/ol/tilecoord.js","webpack:///../node_modules/ol/TileCache.js","webpack:///../node_modules/ol/source/TileEventType.js","webpack:///../node_modules/ol/source/Source.js","webpack:///../node_modules/ol/tilegrid/TileGrid.js","webpack:///../node_modules/ol/tilegrid.js","webpack:///../node_modules/ol/source/Tile.js","webpack:///../node_modules/ol/tileurlfunction.js","webpack:///../node_modules/ol/source/UrlTile.js","webpack:///../node_modules/ol/source/TileImage.js","webpack:///../node_modules/ol/source/XYZ.js","webpack:///../node_modules/ol/source/OSM.js","webpack:///../node_modules/latlon-geohash/latlon-geohash.js","webpack:///./ACESVGjsPanel.tsx","webpack:///../node_modules/@monaco-editor/loader/lib/es/_virtual/_rollupPluginBabelHelpers.js","webpack:///../node_modules/state-local/lib/es/state-local.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/config/index.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/utils/isObject.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/validators/index.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/utils/curry.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/utils/compose.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/utils/deepMerge.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/utils/makeCancelable.js","webpack:///../node_modules/@monaco-editor/loader/lib/es/loader/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/Loading/Loading.js","webpack:///../node_modules/@monaco-editor/react/lib/es/MonacoContainer/styles.js","webpack:///../node_modules/@monaco-editor/react/lib/es/MonacoContainer/MonacoContainer.js","webpack:///../node_modules/@monaco-editor/react/lib/es/MonacoContainer/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/hooks/useMount/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/hooks/useUpdate/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/utils/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/DiffEditor/DiffEditor.js","webpack:///../node_modules/@monaco-editor/react/lib/es/hooks/usePrevious/index.js","webpack:///../node_modules/@monaco-editor/react/lib/es/Editor/Editor.js","webpack:///../node_modules/@monaco-editor/react/lib/es/Editor/index.js","webpack:///./examples.ts","webpack:///./options.tsx","webpack:///./module.ts"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","__WEBPACK_EXTERNAL_MODULE__0__","__WEBPACK_EXTERNAL_MODULE__2__","__WEBPACK_EXTERNAL_MODULE__3__","__WEBPACK_EXTERNAL_MODULE__4__","__WEBPACK_EXTERNAL_MODULE__5__","ReactPropTypesSecret","emptyFunction","emptyFunctionWithReset","resetWarningCache","shim","props","propName","componentName","location","propFullName","secret","err","Error","getShim","isRequired","ReactPropTypes","array","bool","func","number","string","symbol","any","arrayOf","element","elementType","instanceOf","node","objectOf","oneOf","oneOfType","shape","exact","checkPropTypes","PropTypes","extendStatics","b","setPrototypeOf","__proto__","Array","__extends","TypeError","String","__","this","constructor","__assign","assign","arguments","length","apply","__read","iterator","e","ar","next","done","push","error","__spreadArray","to","from","pack","slice","concat","__makeTemplateObject","cooked","raw","methods$1","names","registerMethods","isArray","_name","addMethodNames","getOwnPropertyNames","getMethodsFor","_names","block","il","result","filter","radians","Math","PI","camelCase","toLowerCase","replace","g","toUpperCase","unCamelCase","capitalize","charAt","proportionalSize","width","height","box","bbox","getOrigin","origin","ox","originX","oy","originY","x","y","condX","condY","includes","svg","html","xmlns","xlink","svgjs","globals","window","document","Base","root","createElementNS","makeInstance","isHTML","adopter","querySelector","wrapper","createElement","innerHTML","firstChild","removeChild","nodeOrNew","Node","adopt","instance","nodeName","Fragment","className","register","asRoot","did","eid","extend","methods","wrapWithAttrCheck","fn","args","attr","siblings","parent","children","position","index","prev","forward","add","remove","backward","front","back","before","after","insertBefore","insertAfter","numberAndUnit","hex","rgb","reference","transforms","whitespace","isHex","isRgb","isBlank","isNumber","isImage","delimiter","isPathLetter","componentHex","component","integer","round","max","min","toString","is","space","hueToRgb","q","classes","trim","split","hasClass","indexOf","addClass","join","removeClass","toggleClass","css","style","val","ret","cssText","el","forEach","cased","test","show","hide","visible","data","a","v","attributes","JSON","parse","stringify","remember","k","memory","forget","_memory","Color","inputs","init","color","u","random","sin","pi","h","grey","_a","_b","_c","map","isGrey","delta","_d","values","params","z","getParameters","noWhitespace","exec","parseInt","hexParse","substring","sixDigitHex","components","xyz","lab","sqrt","atan2","dToR","cos","yL","xL","zL","ct","mx","nm","rU","gU","bU","pow","bd","_clamped","rV","gV","bV","toHex","r255","g255","b255","rL","gL","bL","xU","yU","zU","base","source","clone","transformO","Matrix","isMatrixLike","f","closeEnough","threshold","abs","flipBoth","flip","flipX","flipY","skewX","skew","isFinite","skewY","scaleX","scale","scaleY","shear","theta","rotate","around","px","positionX","NaN","py","positionY","translate","tx","translateX","ty","translateY","relative","rx","relativeX","ry","relativeY","cx","cy","matrix","aroundO","dx","dy","translateO","lmultiplyO","determinant","ccw","sx","thetaRad","st","lam","sy","other","comp","axis","flipO","scaleO","fromArray","Element","matrixify","parseFloat","transform","inverseO","det","na","nb","nc","nd","ne","nf","matrixMultiply","multiplyO","rotateO","shearO","lx","skewO","tan","ly","formatTransforms","transformer","parser","nodes","size","path","parentNode","body","documentElement","addTo","isNulledBox","Box","pageXOffset","pageYOffset","left","top","w","x2","y2","xMin","Infinity","xMax","yMin","yMax","getBox","getBBoxFn","retry","contains","viewbox","level","point","clientWidth","clientHeight","zoomX","zoomY","zoom","zoomAmount","Number","MAX_SAFE_INTEGER","List","arr","super","fnOrMethodName","reserved","baseFind","query","querySelectorAll","reduce","obj","attrs","each","listenerId","windowEvents","getEvents","getEventHolder","events","getEventTarget","on","listener","binding","options","bag","_svgjsListenerId","event","ev","addEventListener","off","namespace","removeEventListener","clearEvents","EventTarget","Event","CustomEvent","detail","cancelable","dispatchEvent","dispatch","type","j","defaultPrevented","noop","timeline","duration","ease","delay","fill","stroke","opacity","offset","SVGArray","Set","SVGNumber","unit","isNaN","match","valueOf","hooks","Dom","removeNamespace","SVGElement","appendChild","childNodes","put","hasChildNodes","lastChild","deep","writeDataToDom","assignNewId","id","cloneNode","htmlOrFn","outerHTML","xml","selector","matcher","matches","matchesSelector","msMatchesSelector","mozMatchesSelector","webkitMatchesSelector","oMatchesSelector","removeElement","replaceChild","precision","factor","svgOrFn","outerSVG","text","textContent","xmlOrFn","outerXML","current","_this","well","fragment","createDocumentFragment","len","firstElementChild","nodeValue","last","curr","removeAttribute","getAttribute","_val","hook","isColor","leading","setAttributeNS","setAttribute","rebuild","find","findOne","dom","hasAttribute","setData","defs","plus","until","parents","keys","getBBox","rbox","getBoundingClientRect","screenCTM","addOffset","inside","inverse","ctm","getCTM","isRoot","rect","getScreenCTM","sugar","prefix","extension","mat","angle","direction","radius","_element","getTotalLength","pointAt","getPointAtLength","font","untransform","str","kv","reverse","lmultiply","toParent","pCtm","multiply","toRoot","decomposed","decompose","Container","flatten","ungroup","Defs","Shape","x$3","y$3","cx$1","cy$1","width$2","divide","height$2","circled","Ellipse","ellipse","move","fx","fy","x1","y1","gradiented","Gradient","url","clear","gradient","update","Pattern","pattern","patternUnits","callback","img","Image","src","image","load","PointArray","maxX","maxY","minX","minY","points","pop","pointed","MorphArray","Line","toLine","line","plot","Marker","orient","makeSetterGetter","marker","ref","easing","pos","bezier","steps","stepPosition","jumps","beforeFlag","step","floor","jumping","Stepper","Ease","Controller","stepper","target","dt","recalculate","_duration","overshoot","_overshoot","os","log","zeta","wn","velocity","acceleration","newPosition","windup","integral","_windup","P","I","D","segmentParameters","M","L","H","V","C","S","Q","T","A","Z","pathHandlers","p0","mlhvqtcsaz","jl","segmentComplete","segment","startNewSegment","token","inNumber","finalizeNumber","pathLetter","lastCommand","small","isSmall","inSegment","pointSeen","hasExponent","finalizeSegment","absolute","command","makeAbsolut","segments","isArcFlag","isArc","isExponential","lastToken","PathArray","toAbsolute","pathParser","arrayToString","getClassForType","NonMorphable","morphableTypes","ObjectBag","Morphable","_stepper","_from","_to","_type","_context","_morphObj","_set","align","toArray","TransformBag","defaults","sortByKey","splice","objOrArr","entries","Type","sort","shift","num","Path","_array","poly","polygon","Polyline","polyline","Rect","Queue","_first","_last","item","Animator","nextDraw","frames","timeouts","immediates","timer","performance","Date","run","requestAnimationFrame","_draw","time","now","nextTimeout","lastTimeout","nextFrame","lastFrame","nextImmediate","first","makeSchedule","runnerInfo","start","runner","end","defaultSource","Timeline","timeSource","_timeSource","_startTime","_speed","_persist","_nextFrame","_paused","_runners","_runnerIds","_lastRunnerId","_time","_lastSourceTime","_lastStepTime","_step","_stepFn","_stepImmediate","getEndTimeOfTimeline","pause","lastRunnerInfo","getLastRunnerInfo","lastDuration","endTimes","getRunnerInfoById","_continue","dtOrForever","updateTime","yes","currentSpeed","speed","positive","when","absoluteStartTime","endTime","getEndTime","unschedule","persist","info","active","immediateStep","cancelFrame","frame","dtSource","dtTime","fire","reset","runnersLeft","dtToStart","_timeline","Runner","_queue","_isDeclarative","_history","enabled","_lastTime","_reseted","transformId","_haveReversed","_reverse","_loopsDone","_swing","_wait","_times","_frameId","times","swing","wait","sanitise","loop","schedule","isTransform","animate","queue","_prepareRunner","loopDuration","loopsDone","partial","swinging","backwards","uncliped","loops","swingForward","initFn","runFn","retargetFn","initialiser","retarget","initialised","finished","running","_lastPosition","justStarted","justFinished","declarative","converged","_initialise","_run","needsIt","method","morpher","caller","play","positionOrDt","allfinished","extra","FakeRunner","getRunnerTransform","mergeTransforms","netTransform","_transformationRunners","runners","merge","RunnerArray","ids","deleteCnt","clearTransformsFromQueue","newRunner","lastRunner","mergeWith","edit","by","currentRunner","clearBefore","cancelImmediate","immediate","styleAttr","nameOrAttrs","_tryRetarget","at","newToAttrs","newKeys","differences","addedFromAttrs","oldFromAttrs","oldToAttrs","_rememberMorpher","newLevel","newPoint","affine","isMatrix","currentAngle","startTransform","undefined","_addRunner","_clearTransformRunnersBefore","clearTransform","_currentTransform","rTarget","rCurrent","possibilities","distances","shortest","affineParameters","addTransform","newTransforms","_queueNumber","_queueNumberDelta","newTo","_queueObject","Svg","version","nested","textable","plain","_build","createTextNode","getComputedTextLength","center","ax","ay","amove","build","Text","_rebuild","self","blankLineOffset","fontSize","getComputedStyle","getPropertyValue","newLined","firstLine","nodeType","newLine","Tspan","tspan","Circle","circle","ClipPath","targets","unclip","clip","clipper","ForeignObject","foreignObject","containerGeometry","dmove","child","G","group","link","linker","wrap","Mask","unmask","mask","masker","Stop","stop","Style","rule","fontFamily","addText","cssRule","TextPath","track","pathArray","textPath","importNodes","Use","file","use","SVG","registerMorphableType","Disposable","disposed","dispose","disposeInternal","numberSafeCompareFunction","linearFindNearest","equals","arr1","arr2","len1","TRUE","FALSE","VOID","uidCounter_","getUid","ol_uid","ua","navigator","userAgent","FIREFOX","WEBKIT","MAC","DEVICE_PIXEL_RATIO","devicePixelRatio","WORKER_OFFSCREEN_CANVAS","WorkerGlobalScope","OffscreenCanvas","IMAGE_DECODE","decode","PASSIVE_EVENT_LISTENERS","passive","_super","AssertionError","code","message","assert","assertion","errorCode","transformStringDiv","coordinate","compose","dx1","dy1","dx2","dy2","makeInverse","transformString","boundingExtent","coordinates","extent","createEmpty","ii","extendCoordinate","closestSquaredDistanceXY","containsCoordinate","containsXY","coordinateRelationship","relationship","Relationship","createOrUpdate","opt_extent","createOrUpdateEmpty","extent1","extent2","extendFlatCoordinates","flatCoordinates","stride","extendXY","forEachCorner","getBottomLeft","getBottomRight","getTopRight","getTopLeft","getArea","area","isEmpty","getWidth","getHeight","getCenter","getCorner","corner","Corner","getForViewAndSize","resolution","rotation","cosRotation","sinRotation","xCos","xSin","yCos","ySin","x0","x3","y0","y3","getIntersection","intersection","applyTransform","transformFn","opt_stops","xs","ys","_boundingExtentXYs","clamp","cosh","exp","log2","LOG2E","squaredSegmentDistance","toRadians","angleInDegrees","modulo","lerp","HEX_COLOR_RE_","NAMED_COLOR_RE_","asString","fromNamed","cache","cacheSize","normalize","IconImageCache","cache_","cacheSize_","maxCacheSize_","canExpireCache","expire","iconImage","hasListener","crossOrigin","getKey","set","setSize","maxCacheSize","shared","BaseEvent","propagationStopped","preventDefault","stopPropagation","var_sources","output","getValues","Target","opt_target","eventTarget_","pendingRemovals_","dispatching_","listeners_","listeners","listenersForType","evt","propagate","dispatching","pendingRemovals","handleEvent","pr","getListeners","opt_type","listen","opt_this","opt_once","originalListener_1","eventsKey","listenOnce","unlistenByKey","Observable","once","un","revision_","changed","EventType","getRevision","onInternal","onceInternal","ol_key","unInternal","unByKey","ObjectEvent","oldValue","BaseObject","opt_values","values_","setProperties","getKeys","getProperties","hasProperties","notify","eventType","ObjectEventType","addChangeListener","removeChangeListener","opt_silent","applyProperties","unset","BaseLayer","properties","zIndex","maxResolution","minResolution","minZoom","maxZoom","className_","state_","getClassName","getLayerState","opt_managed","state","layer","managed","getZIndex","getOpacity","sourceState","getSourceState","getVisible","getExtent","getMaxResolution","getMinResolution","getMinZoom","getMaxZoom","getLayersArray","opt_array","getLayerStatesArray","opt_states","setExtent","setMaxResolution","setMinResolution","setMaxZoom","setMinZoom","setOpacity","setVisible","setZIndex","zindex","inView","layerState","viewState","Layer","baseOptions","mapPrecomposeKey_","mapRenderKey_","sourceChangeKey_","renderer_","render","setMap","handleSourcePropertyChange_","setSource","states","getSource","getState","handleSourceChange_","getFeatures","pixel","Promise","resolve","frameState","layerRenderer","getRenderer","prepareFrame","renderFrame","layerStatesArray","some","arrayLayerState","createRenderer","hasRenderer","coordinate1","coordinate2","cosAngle","sinAngle","getWorldsAway","projection","opt_sourceExtentWidth","projectionExtent","worldsAway","canWrapX","sourceExtentWidth","expireIconCache","MapRenderer","map_","dispatchRenderEvent","calculateMatrices2D","coordinateToPixelTransform","pixelToCoordinateTransform","forEachFeatureAtCoordinate","hitTolerance","checkWrapped","thisArg","layerFilter","thisArg2","feature","geometry","translatedCoordinate","worldWidth","offsets","layerStates","numLayers","tmpCoord","getWrapX","callback_1","order","distanceSq","forEachLayerAtPixel","hasFeatureAtCoordinate","getMap","scheduleExpireIconCache","postRenderFunctions","RenderEvent","opt_inversePixelTransform","opt_frameState","opt_context","inversePixelTransform","context","fontRegEx","RegExp","fontRegExMatchIndex","getFontParameters","fontSpec","lineHeight","weight","variant","families","family","cssOpacity","createCanvasContext2D","opt_width","opt_height","opt_canvasPool","opt_Context2DSettings","canvas","all","getContext","replaceNode","newNode","oldNode","removeNode","checkedFonts","measureFont","measureContext","textHeights","interval","referenceWidth","referenceFonts","isAvailable","fontStyle","fontWeight","available","referenceFont","measureTextWidth","check","fonts","clearInterval","measureText","Composite","CompositeMapRenderer","fontChangeListenerKey_","redrawText","element_","CLASS_UNSELECTABLE","container","getViewport","children_","renderedVisible_","event_1","declutterLayers","previousElement","layerIndex","renderDeclutter","oldChildren","oldChild","newChild","replaceChildren","display","getDataAtPixel","CollectionEvent","opt_element","opt_index","Collection","opt_options","unique_","unique","array_","assertUnique_","updateLength_","getLength","getArray","insertAt","elem","CollectionEventType","removeAt","setAt","opt_except","LayerGroup","layers","layersListenerKeys_","listenerKeys_","handleLayersChanged_","setLayers","handleLayerChange_","getLayers","handleLayersAdd_","handleLayersRemove_","layersArray","collectionEvent","ownLayerState","defaultZIndex","MapEvent","MapBrowserEvent","originalEvent","opt_dragging","pixel_","coordinate_","dragging","getEventPixel","configurable","getCoordinateFromPixel","SINGLECLICK","CLICK","DBLCLICK","POINTERDRAG","POINTERMOVE","POINTERDOWN","POINTERUP","POINTEROVER","POINTEROUT","POINTERENTER","POINTERLEAVE","POINTERCANCEL","MapBrowserEventHandler","moveTolerance","clickTimeoutId_","emulateClicks_","dragging_","dragListenerKeys_","moveTolerance_","down_","activePointers_","trackedTouches_","pointerdownListenerKey_","handlePointerDown_","originalPointerMoveEvent_","relayedListenerKey_","relayEvent_","boundHandleTouchMove_","handleTouchMove_","emulateClick_","pointerEvent","newEvent","MapBrowserEventType","clearTimeout","setTimeout","updateActivePointers_","pointerId","handlePointerUp_","isMouseActionButton_","button","doc","getOwnerDocument","handlePointerMove_","getRootNode","isMoving_","clientX","clientY","PriorityQueue","priorityFunction","keyFunction","priorityFunction_","keyFunction_","elements_","priorities_","queuedElements_","dequeue","elements","priorities","siftUp_","elementKey","enqueue","priority","siftDown_","getCount","getLeftChildIndex_","getRightChildIndex_","getParentIndex_","heapify_","isKeyQueued","isQueued","count","startIndex","lIndex","rIndex","smallerChildIndex","parentIndex","reprioritize","TileQueue","tilePriorityFunction","tileChangeCallback","boundHandleTileChange_","handleTileChange","tileChangeCallback_","tilesLoading_","tilesLoadingKeys_","added","getTilesLoading","tile","TileState","tileKey","loadMoreTiles","maxTotalLoading","maxNewLoads","newLoads","Units","RADIANS","DEGREES","FEET","METERS","PIXELS","TILE_PIXELS","USFEET","METERS_PER_UNIT","Projection","code_","units_","extent_","worldExtent_","worldExtent","axisOrientation_","axisOrientation","global_","global","canWrapX_","getPointResolutionFunc_","getPointResolution","defaultTileGrid_","metersPerUnit_","metersPerUnit","getCode","getUnits","getMetersPerUnit","getWorldExtent","getAxisOrientation","isGlobal","setGlobal","getDefaultTileGrid","setDefaultTileGrid","tileGrid","setWorldExtent","setGetPointResolution","getPointResolutionFunc","HALF_SIZE","EXTENT","WORLD_EXTENT","MAX_SAFE_Y","EPSG3857Projection","units","PROJECTIONS","fromEPSG4326","input","opt_output","opt_dimension","dimension","toEPSG4326","atan","EPSG4326Projection","opt_axisOrientation","destination","sourceCode","destinationCode","getDistance","c1","c2","opt_radius","lat1","lat2","deltaLatBy2","deltaLonBy2","cloneTransform","identityTransform","addProjection","projectionLike","opt_units","pointResolution","toEPSG4326_1","getTransformFromProjections","vertices","addEquivalentProjections","projections","addProjections","createProjection","defaultCode","equivalent","projection1","projection2","equalUnits","sourceProjection","destinationProjection","transformFunc","getTransform","transformExtent","projections2","forwardTransform","inverseTransform","toUserCoordinate","fromUserCoordinate","destProjection","fromUserExtent","createExtent","onlyCenter","smooth","opt_isMoving","opt_centerShift","viewWidth","viewHeight","shiftX","shiftY","ratio","none","getViewportClampedResolution","maxExtent","viewportSize","showFullExtent","xResolution","yResolution","getSmoothClampedResolution","createMinMaxResolution","opt_smooth","opt_maxExtent","opt_showFullExtent","cappedMaxRes","disable","easeIn","easeOut","inAndOut","linear","transform2D","opt_dest","dest","tmpTransform","Geometry","extentRevision_","simplifiedGeometryMaxMinSquaredTolerance","simplifiedGeometryRevision","simplifyTransformedInternal","lastResult","lastArgs","lastThis","called","nextArgs","memoizeOne","revision","squaredTolerance","opt_transform","getSimplifiedGeometry","simplifyTransformed","closestPointXY","closestPoint","minSquaredDistance","coord","getClosestPoint","opt_closestPoint","intersectsCoordinate","computeExtent","returnOrUpdate","anchor","opt_sy","opt_anchor","simplify","tolerance","getType","intersectsExtent","deltaX","deltaY","sourceProj","inCoordinates","outCoordinates","pixelExtent","projectedExtent","getStrideForLayout","layout","GeometryLayout","SimpleGeometry","getCoordinates","getFirstCoordinate","getFlatCoordinates","getLastCoordinate","getLayout","simplifiedGeometry","getSimplifiedGeometryInternal","getStride","setFlatCoordinates","setCoordinates","opt_layout","setLayout","nesting","getLayoutForStride","anchorX","anchorY","assignClosest","offset1","offset2","maxSquaredDelta","squaredDelta","arrayMaxSquaredDelta","ends","assignClosestPoint","maxDelta","isRing","opt_tmpPoint","squaredDistance","tmpPoint","assignClosestArrayPoint","deflateCoordinates","deflateCoordinatesArray","coordinatess","opt_ends","jj","douglasPeucker","simplifiedFlatCoordinates","simplifiedOffset","markers","stack","maxSquaredDistance","squaredDistance_1","snap","quantize","quantizeArray","simplifiedEnds","inflateCoordinates","opt_coordinates","inflateCoordinatesArray","opt_coordinatess","twiceArea","LinearRing","maxDelta_","maxDeltaRevision_","GeometryType","Point","deflateCoordinate","linearRingContainsExtent","linearRingContainsXY","linearRingsContainsXY","getInteriorPointOfArray","flatCenters","flatCentersOffset","intersections","rr","pointX","maxSegmentLength","segmentLength","intersectsLineString","coordinatesExtent","point1","point2","intersects","startRel","endRel","startX","startY","endX","endY","slope","intersectsSegment","intersectsLinearRingArray","intersectsLinearRing","tmp","linearRingIsClockwise","edge","linearRingsAreOriented","opt_right","right","isClockwise","orientLinearRings","Polygon","ends_","flatInteriorPointRevision_","flatInteriorPoint_","orientedRevision_","orientedFlatCoordinates_","appendLinearRing","linearRing","getOrientedFlatCoordinates","getEnds","getFlatInteriorPoint","flatCenter","getInteriorPoint","getLinearRingCount","getLinearRing","getLinearRings","linearRings","fromExtent","animationCallback","returnValue","isNoopAnimation","animation","sourceCenter","targetCenter","sourceResolution","targetResolution","sourceRotation","targetRotation","calculateCenterOn","rotX","rotY","View","hints_","animations_","updateAnimationKey_","projection_","viewportSize_","targetCenter_","targetResolution_","targetRotation_","nextCenter_","nextResolution_","nextRotation_","cancelAnchor_","applyOptions_","resolutionConstraintInfo","resolutionConstraint","zoomFactor","multiWorld","smoothResolutionConstraint","projExtent","constrainOnlyCenter","resolutions","constrainResolution","capped","createSnapToResolutions","defaultMaxResolution","defaultMinResolution","defaultMaxZoom","power","opt_minResolution","minZoomLevel","ceil","cappedZoomLevel","zoomLevel","createSnapToPower","constraint","createResolutionConstraint","maxResolution_","minResolution_","zoomFactor_","resolutions_","padding_","padding","minZoom_","centerConstraint","smoothExtentConstraint","createCenterConstraint","rotationConstraint","enableRotation","constrainRotation","opt_tolerance","createRotationConstraint","constraints_","setRotation","setCenterInternal","setResolution","setZoom","options_","oldPadding","newPadding","getResolution","offsetX","offsetY","getUpdatedOptions_","newOptions","getZoom","getCenterInternal","getRotation","var_args","isDef","getAnimating","resolveConstraints","getProjection","animateInternal","animationCount","series","complete","getResolutionForZoom","setHint","ViewHint","updateAnimations_","getInteracting","cancelAnimations","cancelAnimationFrame","more","seriesComplete","elapsed","fraction","progress","getViewportSize_","constrainedResolution","calculateCenterZoom","applyTargetState_","constrainedRotation","calculateCenterRotate","Boolean","currentCenter","currentResolution","opt_rotation","setViewportSize","opt_size","ViewProperty","getConstraints","getConstrainResolution","getHints","opt_hints","calculateExtent","toUserExtent","calculateExtentInternal","getViewportSizeMinusPadding_","getZoomForResolution","setConstrainResolution","getResolutions","getResolutionForExtent","getResolutionForExtentInternal","getResolutionForValueFunction","opt_power","getConstrainedResolution","getValueForResolutionFunction","logPower","reducedSize","nextCenter","nextResolution","nextRotation","nearest","baseLevel","fit","geometryOrExtent","userProjection","fitInternal","rotatedExtentForGeometry","coords","minRotX","minRotY","maxRotX","maxRotY","rotatedExtent","centerRot","centerX","centerY","getConstrainedCenter","centerOn","centerOnInternal","calculateCenterShift","centerShift","shiftedCenter","adjustCenter","deltaCoordinates","setCenter","adjustCenterInternal","adjustResolution","adjustResolutionInternal","isMoving","newResolution","adjustZoom","adjustRotation","adjustRotationInternal","newRotation","hint","opt_doNotCancelAnims","opt_forceMoving","newCenter","opt_duration","opt_resolutionDirection","beginInteraction","endInteraction","endInteractionInternal","opt_targetResolution","getConstrainedZoom","targetZoom","opt_direction","targetRes","hasArea","toSize","PluggableMap","optionsInternal","keyboardEventTarget","getElementById","controls","interactions","overlays","layerGroup","MapProperty","view","createOptionsInternal","boundHandleBrowserEvent_","handleBrowserEvent","maxTilesLoading_","maxTilesLoading","pixelRatio_","pixelRatio","postRenderTimeoutHandle_","animationDelayKey_","animationDelay_","renderFrame_","coordinateToPixelTransform_","pixelToCoordinateTransform_","frameIndex_","frameState_","previousExtent_","viewPropertyListenerKey_","viewChangeListenerKey_","layerGroupPropertyListenerKeys_","viewport_","overflow","overlayContainer_","pointerEvents","overlayContainerStopEvent_","mapBrowserEventHandler_","keyboardEventTarget_","keyHandlerKeys_","overlays_","overlayIdIndex_","handleResize_","postRenderFunctions_","tileQueue_","getTilePriority","handleTileChange_","handleLayerGroupChanged_","handleViewChanged_","handleSizeChanged_","handleTargetChanged_","then","viewOptions","setView","addOverlayInternal_","getId","control","interaction","addControl","getControls","addInteraction","getInteractions","addLayer","getLayerGroup","addOverlay","overlay","getOverlays","setTarget","forEachFeatureAtPixel","getCoordinateFromPixelInternal","getFeaturesAtPixel","features","hasFeatureAtPixel","getEventCoordinate","getEventCoordinateInternal","viewportPosition","eventPosition","changedTouches","getTarget","getTargetElement","getView","getOverlayById","collection","getLoading","loading","getPixelFromCoordinate","viewCoordinate","getPixelFromCoordinateInternal","getSize","getOverlayContainer","getOverlayContainerStopEvent","targetElement","ownerDocument","tileSourceKey","tileCenter","tileResolution","wantedTiles","browserEvent","mapBrowserEvent","handleMapBrowserEvent","rootNode","interactionsArray","getActive","handlePostRender","tileQueue","hints","viewHints","lowOnFrameBudget","updateSize","handleViewPropertyChanged_","updateViewportSize_","isRendered","renderSync","handleFontsChanged","removeControl","removeInteraction","removeLayer","removeOverlay","previousFrameState","declutterTree","usedTiles","nextExtent","MapEventType","setLayerGroup","computedStyle","offsetWidth","offsetHeight","getClientRects","Control","target_","listenerKeys","mapEvent","Attribution","ulElement_","collapsed_","collapsed","userCollapsed_","overrideCollapsible_","collapsible","collapsible_","tipLabel","expandClassName","collapseLabel","collapseClassName","collapseLabel_","label","label_","activeLabel","toggleButton_","title","handleClick_","cssClasses","renderedAttributions_","collectSourceAttributions_","lookup","visibleAttributions","attributionGetter","getAttributions","attributions","getAttributionsCollapsible","setCollapsible","updateElement_","removeChildren","handleToggle_","classList","toggle","getCollapsible","setCollapsed","getCollapsed","Rotate","compassClassName","callResetNorth_","resetNorth","duration_","autoHide_","autoHide","rotation_","resetNorth_","Zoom","zoomInClassName","zoomOutClassName","zoomInLabel","zoomOutLabel","zoomInTipLabel","zoomOutTipLabel","inElement","outElement","zoomByDelta_","currentZoom","newZoom","zoomByDelta","Interaction","setActive","DoubleClickZoom","delta_","stopEvent","shiftKey","Pointer","PointerInteraction","handleDownEvent","handleDragEvent","handleMoveEvent","handleUpEvent","stopDown","handlingDownUpSequence","trackedPointers_","targetPointers","getPointerCount","updateTrackedPointers_","handledUp","handled","isPointerDraggingEvent","conditions","pass","altShiftKeysOnly","altKey","metaKey","ctrlKey","focusWithTabindex","activeElement","always","mouseActionButton","noModifierKeys","shiftKeyOnly","targetNotEditable","tagName","mouseOnly","pointerType","primaryAction","isPrimary","DragPan","kinetic_","kinetic","lastCentroid","lastPointersCount_","panning_","condition","condition_","onFocusOnly","noKinetic_","centroid","begin","distance","getAngle","centerpx","DragRotate","lastAngle_","RenderBox","geometry_","startPixel_","endPixel_","render_","startPixel","endPixel","setPixels","createOrUpdateGeometry","getGeometry","DragBoxEventType","DragBoxEvent","DragBox","box_","minArea_","minArea","onBoxEnd","boxEndCondition_","boxEndCondition","defaultBoxEndCondition","completeBox","DragZoom","out_","out","KeyboardPan","defaultCondition_","pixelDelta_","pixelDelta","keyEvent","keyCode","KeyCode","mapUnitsDelta","pan","KeyboardZoom","charCode","charCodeAt","Kinetic","decay","minVelocity","decay_","minVelocity_","delay_","points_","angle_","initialVelocity_","lastIndex","firstIndex","Mode","MouseWheelZoom","totalDelta_","lastDelta_","timeout_","timeout","useAnchor_","useAnchor","constrainResolution_","lastAnchor_","startTime_","timeoutId_","mode_","trackpadEventGap_","trackpadTimeoutId_","deltaPerZoom_","endInteraction_","wheelEvent","deltaMode","WheelEvent","DOM_DELTA_PIXEL","DOM_DELTA_LINE","timeLeft","handleWheelZoom_","setMouseAnchor","PinchRotate","pointerOptions","anchor_","rotating_","rotationDelta_","threshold_","rotationDelta","touch0","touch1","PinchZoom","lastDistance_","lastScaleDelta_","scaleDelta","Map","zoomOptions","rotateOptions","attribution","attributionOptions","altShiftDragRotate","doubleClickZoom","zoomDelta","zoomDuration","dragPan","pinchRotate","pinchZoom","keyboard","mouseWheelZoom","shiftDragZoom","BaseTile","BaseTileLayer","preload","useInterimTilesOnError","setPreload","setUseInterimTilesOnError","getPreload","TileProperty","getUseInterimTilesOnError","LayerRenderer","boundHandleImageChange_","handleImageChange_","layer_","declutterExecutorGroup","loadedTileCallback","tiles","tileCoord","createLoadedTileFinder","tileRange","forEachLoadedTile","getLayer","ImageState","renderIfReadyAndVisible","loadImage","imageState","CanvasLayerRenderer","renderedResolution","tempTransform","pixelTransform","containerReused","useContainer","layerClassName","HTMLCanvasElement","transformOrigin","clipUnrotated","topLeft","topRight","bottomRight","bottomLeft","inverted","save","beginPath","moveTo","lineTo","dispatchRenderEvent_","preRender","postRender","getRenderTransform","renderPixel","layerExtent","newCanvas","newContext","clearRect","drawImage","getImageData","Uint8Array","TileRange","containsTileRange","CanvasTileLayerRenderer","tileLayer","extentChanged","renderedExtent_","renderedPixelRatio","renderedProjection","renderedRevision","renderedTiles","newTiles_","tmpExtent","tmpTileRange_","isDrawableTile","tileState","getTile","setState","getInterimTile","viewResolution","viewCenter","tileSource","sourceRevision","getTileGridForProjection","getZForResolution","zDirection","tilePixelRatio","getTilePixelRatio","canvasExtent","getTileRangeForExtentAndZ","tilesToDrawByZ","findLoadedTiles","tmpTileRange","uid","inTransition","getAlpha","childTileRange","getTileCoordChildTileRange","covered","forEachTileCoordParentTileRange","canvasScale","canvasTransform","getContextOptions","clips","clipZs","currentClip","zs","getOpaque","currentZ","currentTilePixelSize","getTilePixelSize","currentScale","dx_1","dy_1","originTileCoord","getTileCoordForCoordAndZ","originTileExtent","getTileCoordExtent","origin_1","tileGutter","getGutterForProjection","tilesToDraw","tileCoordKey","xIndex","nextX","yIndex","nextY","transition","i_1","drawTileImage","restore","unshift","updateUsedTiles","manageTilePyramid","scheduleExpireCache","gutter","getTileImage","alpha","alphaChanged","globalAlpha","endTransition","getImage","postRenderFunction","expireCache","opt_tileCallback","tileCount","getTileCoordCenter","useTile","updateCacheSize","TileLayer","Tile","interimTile","transition_","transitionStarts_","release","refreshInterimChain","getTileCoord","ImageBase","getPixelRatio","listenImage","loadHandler","errorHandler","promise","listening_1","catch","ImageWrapper","imageLoadFunction","src_","image_","unlisten_","imageLoadFunction_","handleImageError_","unlistenImage_","handleImageLoad_","setImage","brokenDiagonalRendering_","ImageTile","tileLoadFunction","crossOrigin_","tileLoadFunction_","ctx","fillStyle","fillRect","naturalWidth","naturalHeight","Triangulation","targetProj","targetExtent","maxSourceExtent","errorThreshold","opt_destinationResolution","sourceProj_","targetProj_","transformInvCache","transformInv","transformInv_","maxSourceExtent_","errorThresholdSquared_","triangles_","wrapsXInSource_","canWrapXInSource_","sourceWorldWidth_","targetWorldWidth_","destinationTopLeft","destinationTopRight","destinationBottomRight","destinationBottomLeft","sourceTopLeft","sourceTopRight","sourceBottomRight","sourceBottomLeft","maxSubdivision","addQuad_","leftBound_1","triangle","newTriangle","addTriangle_","aSrc","bSrc","cSrc","dSrc","sourceQuadExtent","sourceCoverageX","sourceWorldWidth","wrapsX","needsSubdivision","isNotFinite","centerSrc","bc","bcSrc","da","daSrc","ab","abSrc","cd","cdSrc","calculateSourceExtent","getTriangles","IMAGE_SMOOTHING_DISABLED","imageSmoothingEnabled","msImageSmoothingEnabled","drawTestTriangle","u1","v1","u2","v2","closePath","verifyBrokenDiagonalRendering","calculateSourceResolution","targetMetersPerUnit","sourceMetersPerUnit","sourceExtent","compensationFactor","triangulation","sources","opt_renderEdges","opt_contextOptions","pixelRound","globalCompositeOperation","sourceDataExtent","canvasWidthInUnits","canvasHeightInUnits","stitchContext","stitchScale","xPos","yPos","srcWidth","srcHeight","targetTopLeft","u0","v0","sourceNumericalShiftX","sourceNumericalShiftY","affineCoefs","maxRow","maxEl","absValue","coef","solveLinearSystem","isBrokenDiagonalRendering","ud","vd","strokeStyle","lineWidth","ReprojTile","sourceTileGrid","targetTileGrid","wrappedTileCoord","getTileFunction","opt_errorThreshold","renderEdges_","contextOptions_","gutter_","canvas_","sourceTileGrid_","targetTileGrid_","wrappedTileCoord_","sourceTiles_","sourcesListenerKeys_","sourceZ_","maxTargetExtent","limitedTargetExtent","sourceProjExtent","calculateSourceExtentResolution","errorThresholdInPixels","triangulation_","sourceRange","srcX","srcY","reproject_","getTileSize","leftToLoad_1","sourceListenKey_1","unlistenSources_","LRUCache","opt_highWaterMark","highWaterMark","count_","entries_","oldest_","newest_","containsKey","entry","value_","key_","newer","older","peekLast","peekLastKey","peekFirstKey","opt_tileCoord","getKeyZXY","TileCache","pruneExceptNewestZ","fromKey","adaptAttributions","attributionLike","Source","attributions_","attributionsCollapsible_","attributionsCollapsible","wrapX_","wrapX","viewResolver","viewRejector","viewPromise_","reject","refresh","setAttributions","tmpTileCoord","TileGrid","opt_strict","compare","every","currentVal","res","origins","origin_","origins_","tileSizes_","tileSizes","tileSize_","tileSize","fullTileRanges_","tmpSize_","tmpExtent_","sizes","restrictedTileRange","calculateTileRanges_","forEachTileCoord","opt_tileRange","tileCoordExtent","getTileRangeForTileCoordAndZ","tileCoordZ","tileCoordX","tileCoordY","getTileRangeExtent","getTileCoordForXYAndZ_","getTileCoordForCoordAndResolution","getTileCoordForXYAndResolution_","reverseIntersectionPolicy","adjustX","adjustY","xFromOrigin","yFromOrigin","getTileCoordResolution","getFullTileRange","fullTileRanges","getForProjection","opt_maxZoom","opt_tileSize","opt_corner","resolutionsFromExtent","createForExtent","extentFromProjection","createForProjection","opt_maxResolution","half","TileSource","opaque_","opaque","tilePixelRatio_","tileCache","tmpSize","tileOptions","getTileCacheForProjection","loaded","setKey","getTileGrid","getTileCoordForTileUrlFunction","opt_projection","withinExtentAndZ","TileSourceEvent","createFromTemplate","template","zRegEx","xRegEx","yRegEx","dashYRegEx","range","createFromTemplates","templates","tileUrlFunctions","createFromTileUrlFunctions","UrlTile","generateTileUrlFunction_","tileUrlFunction","urls","setUrls","setUrl","tileLoadingKeys_","getTileLoadFunction","getTileUrlFunction","getPrototypeOf","getUrls","TileEventType","setTileLoadFunction","setTileUrlFunction","startCharCode","stopCharCode","fromCharCode","stop_1","expandUrl","defaultTileLoadFunction","imageTile","TileImage","tileClass","tileCacheForProjection","tileGridForProjection","reprojectionErrorThreshold_","reprojectionErrorThreshold","imageSmoothing","renderReprojectionEdges_","usedTileCache","getGutter","thisProj","projKey","createTile_","urlTileCoord","tileUrl","newTile","getTileInternal","setRenderReprojectionEdges","setTileGridForProjection","tilegrid","proj","XYZ","xyzOptions","gridOptions","createXYZ","OSM","base32","Geohash","lat","lon","hash","encode","posn","idx","bit","evenBit","geohash","latMin","latMax","lonMin","lonMax","lonMid","latMid","bounds","sw","toFixed","LN10","chr","bitN","lastCh","adjacent","openOnClick","open","animateContRotate","showOn","animateOn","stopAnimation","getParentNode","getTopNode","currentNode","updateXHTMLFontText","newText","currentElement","localName","generateComponentStyles","textBox","addAllIDs","geomap","svgNode","svgSource","svgMappings","mappedElements","initFunctionSource","initFunction","eventFunctionSource","eventFunction","initialized","getCoords","svgContainerRefs","svgElement","mapRef","converted","fields","field","geohashField","fromLonLat","componentDidMount","svgContainerRef","cssTransform","componentDidUpdate","initializeMappings","currentElements","mappedName","svgId","mapAllIDs","nodeFilterID","acceptNode","NodeFilter","FILTER_ACCEPT","FILTER_REJECT","svgWalker","createTreeWalker","SHOW_ALL","mapping","nextNode","onOptionsChange","forceUpdate","mappingClickHandler","clicked","loopCount","renderSVG","initSource","Function","replaceVariables","eventSource","styles","onClick","captureMappings","visibility","enableGeomap","_defineProperty","writable","ownKeys","enumerableOnly","getOwnPropertySymbols","symbols","sym","getOwnPropertyDescriptor","_objectSpread2","getOwnPropertyDescriptors","defineProperties","_arrayLikeToArray","_len","fns","_key","reduceRight","curry","curried","_len2","_key2","_len3","_key3","isObject","isFunction","errorMessages","initialIsRequired","initialType","initialContent","handlerType","handlersType","selectorType","changeType","changeField","validators","changes","initial","handler","_handler","extractChanges","causedChanges","updateState","didStateUpdate","_handler$field","didUpdate","validate","getChanges","paths","vs","configIsRequired","configType","deprecation","config","monacoBase","CANCELATION_MESSAGE","msg","hasCanceled_","wrappedPromise","cancel","_state$create","isInitialized","monaco","_state$create2","_arrayWithHoles","_arr","_n","_e","_s","_i","_iterableToArrayLimit","minLen","_unsupportedIterableToArray","_nonIterableRest","injectScripts","script","getMonacoLoaderScript","configureLoader","_ref2","loaderScript","onload","onerror","_ref3","require","storeMonacoInstance","wrapperPromise","_ref","editor","__getMonacoInstance","_ref4","loadingStyles","justifyContent","alignItems","content","textAlign","fullWidth","MonacoContainer","isEditorReady","wrapperClassName","propTypes","effect","deps","applyChanges","isInitialMount","getOrCreateModel","language","getModel","crateModelUri","createModel","Uri","DiffEditor","original","modified","originalLanguage","modifiedLanguage","originalModelPath","modifiedModelPath","keepCurrentOriginalModel","keepCurrentModifiedModel","theme","beforeMount","onMount","setIsEditorReady","isMonacoMounting","setIsMonacoMounting","editorRef","monacoRef","containerRef","onMountRef","beforeMountRef","console","models","_models$original","_models$modified","disposeEditor","modifiedEditor","getModifiedEditor","getOption","EditorOption","readOnly","setValue","getValue","executeEdits","getFullModelRange","forceMoveMarkers","pushUndoStop","setModelLanguage","setTheme","updateOptions","setModels","originalModel","modifiedModel","setModel","createEditor","createDiffEditor","automaticLayout","defaultProps","viewStates","Editor","defaultValue","defaultLanguage","defaultPath","overrideServices","saveViewState","keepCurrentModel","onChange","onValidate","subscriptionRef","valueRef","previousPath","_subscriptionRef$curr2","_editorRef$current$ge2","model","restoreViewState","revealLine","autoCreatedModelPath","defaultModel","_subscriptionRef$curr","_editorRef$current","onDidChangeModelContent","editorValue","changeMarkersListener","onDidChangeMarkers","uris","_editorRef$current$ge","editorUri","uri","getModelMarkers","resource","props_defaults","onSourceChange","editorInstance","onEditorDidMount","updateDimensions","onBlur","PureComponent","onChangeItem","onAdd","onDelete","currentTarget","icon","updatedMapping","newMappings","newMapping","currentMapping","colorPicker","spacing","sm","inputPrefix","trashIcon","colors","textWeak","addIcon","useFieldConfig","setPanelOptions","builder","addBooleanSwitch","category","description","addCustomEditor","grafanaTheme","addFieldNamePicker","showIf","opts"],"mappings":";oHACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QA0Df,OArDAF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,oBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,IAIjBlC,EAAoBA,EAAoBmC,EAAI,I,gBClFrDhC,EAAOD,QAAUkC,G,gBCiBfjC,EAAOD,QAAU,EAAQ,GAAR,I,cCjBnBC,EAAOD,QAAUmC,G,cCAjBlC,EAAOD,QAAUoC,G,cCAjBnC,EAAOD,QAAUqC,G,cCAjBpC,EAAOD,QAAUsC,G,2CCSjB,IAAIC,EAAuB,EAAQ,IAEnC,SAASC,KACT,SAASC,KACTA,EAAuBC,kBAAoBF,EAE3CvC,EAAOD,QAAU,WACf,SAAS2C,EAAKC,EAAOC,EAAUC,EAAeC,EAAUC,EAAcC,GACpE,GAAIA,IAAWV,EAAf,CAIA,IAAIW,EAAM,IAAIC,MACZ,mLAKF,MADAD,EAAIzC,KAAO,sBACLyC,GAGR,SAASE,IACP,OAAOT,EAFTA,EAAKU,WAAaV,EAMlB,IAAIW,EAAiB,CACnBC,MAAOZ,EACPa,KAAMb,EACNc,KAAMd,EACNe,OAAQf,EACRf,OAAQe,EACRgB,OAAQhB,EACRiB,OAAQjB,EAERkB,IAAKlB,EACLmB,QAASV,EACTW,QAASpB,EACTqB,YAAarB,EACbsB,WAAYb,EACZc,KAAMvB,EACNwB,SAAUf,EACVgB,MAAOhB,EACPiB,UAAWjB,EACXkB,MAAOlB,EACPmB,MAAOnB,EAEPoB,eAAgB/B,EAChBC,kBAAmBF,GAKrB,OAFAc,EAAemB,UAAYnB,EAEpBA,I,6BCnDTrD,EAAOD,QAFoB,gD,+CCOvB0E,EAAgB,SAASlE,EAAGmE,GAI5B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAGrB,SAASI,EAAUvE,EAAGmE,GACzB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,GAG5E,IAAIG,EAAW,WAQlB,OAPAA,EAAWzE,OAAO0E,QAAU,SAAkBlE,GAC1C,IAAK,IAAIa,EAAG/B,EAAI,EAAGyB,EAAI4D,UAAUC,OAAQtF,EAAIyB,EAAGzB,IAE5C,IAAK,IAAI8B,KADTC,EAAIsD,UAAUrF,GACOU,OAAOkB,UAAUC,eAAe1B,KAAK4B,EAAGD,KAAIZ,EAAEY,GAAKC,EAAED,IAE9E,OAAOZ,IAEKqE,MAAMN,KAAMI,YAoEH3E,OAAOY,OAwB7B,SAASkE,EAAO/E,EAAGgB,GACtB,IAAIrB,EAAsB,mBAAXW,QAAyBN,EAAEM,OAAO0E,UACjD,IAAKrF,EAAG,OAAOK,EACf,IAAmBK,EAAY4E,EAA3B1F,EAAII,EAAED,KAAKM,GAAOkF,EAAK,GAC3B,IACI,WAAc,IAANlE,GAAgBA,KAAM,MAAQX,EAAId,EAAE4F,QAAQC,MAAMF,EAAGG,KAAKhF,EAAEG,OAExE,MAAO8E,GAASL,EAAI,CAAEK,MAAOA,GAC7B,QACI,IACQjF,IAAMA,EAAE+E,OAASzF,EAAIJ,EAAU,SAAII,EAAED,KAAKH,GAElD,QAAU,GAAI0F,EAAG,MAAMA,EAAEK,OAE7B,OAAOJ,EAmBJ,SAASK,EAAcC,EAAIC,EAAMC,GACpC,GAAIA,GAA6B,IAArBd,UAAUC,OAAc,IAAK,IAA4BK,EAAxB3F,EAAI,EAAGC,EAAIiG,EAAKZ,OAAYtF,EAAIC,EAAGD,KACxE2F,GAAQ3F,KAAKkG,IACRP,IAAIA,EAAKf,MAAMhD,UAAUwE,MAAMjG,KAAK+F,EAAM,EAAGlG,IAClD2F,EAAG3F,GAAKkG,EAAKlG,IAGrB,OAAOiG,EAAGI,OAAOV,GAAMf,MAAMhD,UAAUwE,MAAMjG,KAAK+F,IAiC/C,SAASI,EAAqBC,EAAQC,GAEzC,OADI9F,OAAOC,eAAkBD,OAAOC,eAAe4F,EAAQ,MAAO,CAAEtF,MAAOuF,IAAiBD,EAAOC,IAAMA,EAClGD,EAGc7F,OAAOY,O,oBCvMhC,MAAMmF,EAAY,GACZC,EAAQ,GACd,SAASC,EAAgBpG,EAAMH,GAC7B,GAAIwE,MAAMgC,QAAQrG,GAChB,IAAK,MAAMsG,KAAStG,EAClBoG,EAAgBE,EAAOzG,QAM3B,GAAoB,iBAATG,EAQXuG,EAAepG,OAAOqG,oBAAoB3G,IAC1CqG,EAAUlG,GAAQG,OAAO0E,OAAOqB,EAAUlG,IAAS,GAAIH,QARrD,IAAK,MAAMyG,KAAStG,EAClBoG,EAAgBE,EAAOtG,EAAKsG,IASlC,SAASG,EAAczG,GACrB,OAAOkG,EAAUlG,IAAS,GAK5B,SAASuG,EAAeG,GACtBP,EAAMZ,QAAQmB,GAIhB,SAAS,EAAI5D,EAAO6D,GAClB,IAAIlH,EACJ,MAAMmH,EAAK9D,EAAMiC,OACX8B,EAAS,GAEf,IAAKpH,EAAI,EAAGA,EAAImH,EAAInH,IAClBoH,EAAOtB,KAAKoB,EAAM7D,EAAMrD,KAG1B,OAAOoH,EAGT,SAASC,EAAOhE,EAAO6D,GACrB,IAAIlH,EACJ,MAAMmH,EAAK9D,EAAMiC,OACX8B,EAAS,GAEf,IAAKpH,EAAI,EAAGA,EAAImH,EAAInH,IACdkH,EAAM7D,EAAMrD,KACdoH,EAAOtB,KAAKzC,EAAMrD,IAItB,OAAOoH,EAGT,SAASE,EAAQhH,GACf,OAAOA,EAAI,IAAMiH,KAAKC,GAAK,IAO7B,SAASC,EAAU1F,GACjB,OAAOA,EAAE2F,cAAcC,QAAQ,SAAS,SAAUvH,EAAGwH,GACnD,OAAOA,EAAEC,iBAIb,SAASC,EAAY/F,GACnB,OAAOA,EAAE4F,QAAQ,YAAY,SAAUvH,EAAGwH,GACxC,MAAO,IAAMA,EAAEF,iBAInB,SAASK,EAAWhG,GAClB,OAAOA,EAAEiG,OAAO,GAAGH,cAAgB9F,EAAEqE,MAAM,GAG7C,SAAS6B,EAAiBpE,EAASqE,EAAOC,EAAQC,GAWhD,OAVa,MAATF,GAA2B,MAAVC,IACnBC,EAAMA,GAAOvE,EAAQwE,OAER,MAATH,EACFA,EAAQE,EAAIF,MAAQE,EAAID,OAASA,EACd,MAAVA,IACTA,EAASC,EAAID,OAASC,EAAIF,MAAQA,IAI/B,CACLA,MAAOA,EACPC,OAAQA,GASZ,SAASG,EAAU7H,EAAGoD,GACpB,MAAM0E,EAAS9H,EAAE8H,OAEjB,IAAIC,EAAa,MAAR/H,EAAE+H,GAAa/H,EAAE+H,GAAkB,MAAb/H,EAAEgI,QAAkBhI,EAAEgI,QAAU,SAC3DC,EAAa,MAARjI,EAAEiI,GAAajI,EAAEiI,GAAkB,MAAbjI,EAAEkI,QAAkBlI,EAAEkI,QAAU,SAEjD,MAAVJ,KACDC,EAAIE,GAAM9D,MAAMgC,QAAQ2B,GAAUA,EAA2B,iBAAXA,EAAsB,CAACA,EAAOK,EAAGL,EAAOM,GAAK,CAACN,EAAQA,IAI3G,MAAMO,EAAsB,iBAAPN,EACfO,EAAsB,iBAAPL,EAErB,GAAII,GAASC,EAAO,CAClB,MAAM,OACJZ,EAAM,MACND,EAAK,EACLU,EAAC,EACDC,GACEhF,EAAQwE,OAERS,IACFN,EAAKA,EAAGQ,SAAS,QAAUJ,EAAIJ,EAAGQ,SAAS,SAAWJ,EAAIV,EAAQU,EAAIV,EAAQ,GAG5Ea,IACFL,EAAKA,EAAGM,SAAS,OAASH,EAAIH,EAAGM,SAAS,UAAYH,EAAIV,EAASU,EAAIV,EAAS,GAKpF,MAAO,CAACK,EAAIE,GAiBd,MAAMO,EAAM,6BACNC,EAAO,+BACPC,EAAQ,gCACRC,EAAQ,+BACRC,EAAQ,yBAWd,MAAMC,EAAU,CACdC,OAA0B,oBAAXA,OAAyB,KAAOA,OAC/CC,SAA8B,oBAAbA,SAA2B,KAAOA,UAyBrD,MAAMC,GAUN,MAAM,EAAW,GACXC,EAAO,sBAEb,SAASpI,EAAOf,EAAMc,EAAK4H,GAEzB,OAAOK,EAAQE,SAASG,gBAAgBtI,EAAId,GAE9C,SAASqJ,EAAa/F,EAASgG,GAAS,GACtC,GAAIhG,aAAmB4F,EAAM,OAAO5F,EAEpC,GAAuB,iBAAZA,EACT,OAAOiG,EAAQjG,GAGjB,GAAe,MAAXA,EACF,OAAO,IAAI,EAAS6F,GAGtB,GAAuB,iBAAZ7F,GAA8C,MAAtBA,EAAQmE,OAAO,GAChD,OAAO8B,EAAQR,EAAQE,SAASO,cAAclG,IAIhD,MAAMmG,EAAUH,EAASP,EAAQE,SAASS,cAAc,OAAS3I,EAAO,OAOxE,OANA0I,EAAQE,UAAYrG,EAGpBA,EAAUiG,EAAQE,EAAQG,YAE1BH,EAAQI,YAAYJ,EAAQG,YACrBtG,EAET,SAASwG,EAAU9J,EAAMyD,GACvB,OAAOA,aAAgBsF,EAAQC,OAAOe,KAAOtG,EAAO1C,EAAOf,GAG7D,SAASgK,EAAMvG,GAEb,IAAKA,EAAM,OAAO,KAElB,GAAIA,EAAKwG,oBAAoBf,EAAM,OAAOzF,EAAKwG,SAE/C,GAAsB,uBAAlBxG,EAAKyG,SACP,OAAO,IAAI,EAASC,SAAS1G,GAI/B,IAAI2G,EAAY5C,EAAW/D,EAAKyG,UAAY,OAQ5C,MANkB,mBAAdE,GAAgD,mBAAdA,EACpCA,EAAY,WACF,EAASA,KACnBA,EAAY,OAGP,IAAI,EAASA,GAAW3G,GAEjC,IAAI8F,EAAUS,EAId,SAASK,EAAS/G,EAAStD,EAAOsD,EAAQtD,KAAMsK,GAAS,GAIvD,OAHA,EAAStK,GAAQsD,EACbgH,IAAQ,EAASnB,GAAQ7F,GAC7BiD,EAAepG,OAAOqG,oBAAoBlD,EAAQjC,YAC3CiC,EAMT,IAAIiH,EAAM,IAEV,SAASC,EAAIxK,GACX,MAAO,QAAUwH,EAAWxH,GAAQuK,IAiBtC,SAASE,EAAO9K,EAAS+K,GACvB,IAAI1J,EAAKvB,EAGT,IAAKA,GAFLE,EAAU0E,MAAMgC,QAAQ1G,GAAWA,EAAU,CAACA,IAE7BoF,OAAS,EAAGtF,GAAK,EAAGA,IACnC,IAAKuB,KAAO0J,EACV/K,EAAQF,GAAG4B,UAAUL,GAAO0J,EAAQ1J,GAI1C,SAAS2J,EAAkBC,GACzB,OAAO,YAAaC,GAClB,MAAM3K,EAAI2K,EAAKA,EAAK9F,OAAS,GAE7B,OAAI7E,GAAKA,EAAEyE,cAAgBxE,QAAYD,aAAamE,MAG3CuG,EAAG5F,MAAMN,KAAMmG,GAFfD,EAAG5F,MAAMN,KAAMmG,EAAKhF,MAAM,GAAI,IAAIiF,KAAK5K,IA6EpDkG,EAAgB,MAAO,CACrB2E,SAvEF,WACE,OAAOrG,KAAKsG,SAASC,YAuErBC,SApEF,WACE,OAAOxG,KAAKsG,SAASG,MAAMzG,OAoE3BW,KAjEF,WACE,OAAOX,KAAKqG,WAAWrG,KAAKwG,WAAa,IAiEzCE,KA9DF,WACE,OAAO1G,KAAKqG,WAAWrG,KAAKwG,WAAa,IA8DzCG,QA3DF,WACE,MAAM5L,EAAIiF,KAAKwG,WAIf,OAHUxG,KAAKsG,SAEbM,IAAI5G,KAAK6G,SAAU9L,EAAI,GAClBiF,MAuDP8G,SApDF,WACE,MAAM/L,EAAIiF,KAAKwG,WAGf,OAFUxG,KAAKsG,SACbM,IAAI5G,KAAK6G,SAAU9L,EAAIA,EAAI,EAAI,GAC1BiF,MAiDP+G,MA9CF,WAIE,OAHU/G,KAAKsG,SAEbM,IAAI5G,KAAK6G,UACJ7G,MA2CPgH,KAxCF,WAIE,OAHUhH,KAAKsG,SAEbM,IAAI5G,KAAK6G,SAAU,GACd7G,MAqCPiH,OAlCF,SAAgBrI,IACdA,EAAU+F,EAAa/F,IACfiI,SACR,MAAM9L,EAAIiF,KAAKwG,WAEf,OADAxG,KAAKsG,SAASM,IAAIhI,EAAS7D,GACpBiF,MA8BPkH,MA3BF,SAAetI,IACbA,EAAU+F,EAAa/F,IACfiI,SACR,MAAM9L,EAAIiF,KAAKwG,WAEf,OADAxG,KAAKsG,SAASM,IAAIhI,EAAS7D,EAAI,GACxBiF,MAuBPmH,aArBF,SAAsBvI,GAGpB,OAFAA,EAAU+F,EAAa/F,IACfqI,OAAOjH,MACRA,MAmBPoH,YAjBF,SAAqBxI,GAGnB,OAFAA,EAAU+F,EAAa/F,IACfsI,MAAMlH,MACPA,QAkBT,MAAMqH,EAAgB,qDAEhBC,EAAM,4CAENC,EAAM,2BAENC,EAAY,yBAEZC,EAAa,aAEbC,EAAa,MAEbC,EAAQ,iCAERC,EAAQ,SAERC,EAAU,WAEVC,EAAW,0CAEXC,GAAU,wCAEVC,GAAY,SAEZC,GAAe,gBAwMrB,SAASC,GAAaC,GACpB,MAAMC,EAAU9F,KAAK+F,MAAMF,GAErBb,EADUhF,KAAKgG,IAAI,EAAGhG,KAAKiG,IAAI,IAAKH,IACtBI,SAAS,IAC7B,OAAsB,IAAflB,EAAIjH,OAAe,IAAMiH,EAAMA,EAGxC,SAASmB,GAAGhM,EAAQiM,GAClB,IAAK,IAAI3N,EAAI2N,EAAMrI,OAAQtF,KACzB,GAAwB,MAApB0B,EAAOiM,EAAM3N,IACf,OAAO,EAIX,OAAO,EA0DT,SAAS4N,GAAS9L,EAAG+L,EAAG3M,GAGtB,OAFIA,EAAI,IAAGA,GAAK,GACZA,EAAI,IAAGA,GAAK,GACZA,EAAI,EAAI,EAAUY,EAAc,GAAT+L,EAAI/L,GAASZ,EACpCA,EAAI,GAAc2M,EAClB3M,EAAI,EAAI,EAAUY,GAAK+L,EAAI/L,IAAM,EAAI,EAAIZ,GAAK,EAC3CY,EAnOT6E,EAAgB,MAAO,CACrBmH,QAjCF,WACE,MAAMzC,EAAOpG,KAAKoG,KAAK,SACvB,OAAe,MAARA,EAAe,GAAKA,EAAK0C,OAAOC,MAAMf,KAgC7CgB,SA7BF,SAAkB1N,GAChB,OAAyC,IAAlC0E,KAAK6I,UAAUI,QAAQ3N,IA6B9B4N,SA1BF,SAAkB5N,GAChB,IAAK0E,KAAKgJ,SAAS1N,GAAO,CACxB,MAAM8C,EAAQ4B,KAAK6I,UACnBzK,EAAMyC,KAAKvF,GACX0E,KAAKoG,KAAK,QAAShI,EAAM+K,KAAK,MAGhC,OAAOnJ,MAoBPoJ,YAjBF,SAAqB9N,GAOnB,OANI0E,KAAKgJ,SAAS1N,IAChB0E,KAAKoG,KAAK,QAASpG,KAAK6I,UAAUzG,QAAO,SAAUhH,GACjD,OAAOA,IAAME,KACZ6N,KAAK,MAGHnJ,MAWPqJ,YARF,SAAqB/N,GACnB,OAAO0E,KAAKgJ,SAAS1N,GAAQ0E,KAAKoJ,YAAY9N,GAAQ0E,KAAKkJ,SAAS5N,MAoEtEoG,EAAgB,MAAO,CACrB4H,IA3DF,SAAaC,EAAOC,GAClB,MAAMC,EAAM,GAEZ,GAAyB,IAArBrJ,UAAUC,OAQZ,OANAL,KAAKjB,KAAKwK,MAAMG,QAAQX,MAAM,WAAW3G,QAAO,SAAUuH,GACxD,QAASA,EAAGtJ,UACXuJ,SAAQ,SAAUD,GACnB,MAAM1N,EAAI0N,EAAGZ,MAAM,WACnBU,EAAIxN,EAAE,IAAMA,EAAE,MAETwN,EAGT,GAAIrJ,UAAUC,OAAS,EAAG,CAExB,GAAIV,MAAMgC,QAAQ4H,GAAQ,CACxB,IAAK,MAAMjO,KAAQiO,EAAO,CACxB,MAAMM,EAAQrH,EAAUlH,GACxBmO,EAAII,GAAS7J,KAAKjB,KAAKwK,MAAMM,GAG/B,OAAOJ,EAIT,GAAqB,iBAAVF,EACT,OAAOvJ,KAAKjB,KAAKwK,MAAM/G,EAAU+G,IAInC,GAAqB,iBAAVA,EACT,IAAK,MAAMjO,KAAQiO,EAEjBvJ,KAAKjB,KAAKwK,MAAM/G,EAAUlH,IAAwB,MAAfiO,EAAMjO,IAAiBuM,EAAQiC,KAAKP,EAAMjO,IAAS,GAAKiO,EAAMjO,GAUvG,OAJyB,IAArB8E,UAAUC,SACZL,KAAKjB,KAAKwK,MAAM/G,EAAU+G,IAAiB,MAAPC,GAAe3B,EAAQiC,KAAKN,GAAO,GAAKA,GAGvExJ,MAgBP+J,KAbF,WACE,OAAO/J,KAAKsJ,IAAI,UAAW,KAa3BU,KAVF,WACE,OAAOhK,KAAKsJ,IAAI,UAAW,SAU3BW,QAPF,WACE,MAA+B,SAAxBjK,KAAKsJ,IAAI,cAqClB5H,EAAgB,MAAO,CACrBwI,KA7BF,SAAcC,EAAGC,EAAGvO,GAClB,GAAS,MAALsO,EAEF,OAAOnK,KAAKkK,KAAK,EAAI9H,EAAOpC,KAAKjB,KAAKsL,WAAYV,GAAuC,IAAjCA,EAAGnE,SAASyD,QAAQ,UAAiBU,GAAMA,EAAGnE,SAASrE,MAAM,KAChH,GAAIgJ,aAAaxK,MAAO,CAC7B,MAAMuK,EAAO,GAEb,IAAK,MAAM5N,KAAO6N,EAChBD,EAAK5N,GAAO0D,KAAKkK,KAAK5N,GAGxB,OAAO4N,EACF,GAAiB,iBAANC,EAChB,IAAKC,KAAKD,EACRnK,KAAKkK,KAAKE,EAAGD,EAAEC,SAEZ,GAAIhK,UAAUC,OAAS,EAC5B,IACE,OAAOiK,KAAKC,MAAMvK,KAAKoG,KAAK,QAAU+D,IACtC,MAAO1J,GACP,OAAOT,KAAKoG,KAAK,QAAU+D,QAG7BnK,KAAKoG,KAAK,QAAU+D,EAAS,OAANC,EAAa,MAAa,IAANvO,GAA2B,iBAANuO,GAA+B,iBAANA,EAAiBA,EAAIE,KAAKE,UAAUJ,IAG/H,OAAOpK,QAwCT0B,EAAgB,MAAO,CACrB+I,SAnCF,SAAkBC,EAAGN,GAEnB,GAA4B,iBAAjBhK,UAAU,GACnB,IAAK,MAAM9D,KAAOoO,EAChB1K,KAAKyK,SAASnO,EAAKoO,EAAEpO,QAElB,IAAyB,IAArB8D,UAAUC,OAEnB,OAAOL,KAAK2K,SAASD,GAGrB1K,KAAK2K,SAASD,GAAKN,EAGrB,OAAOpK,MAsBP4K,OAnBF,WACE,GAAyB,IAArBxK,UAAUC,OACZL,KAAK6K,QAAU,QAEf,IAAK,IAAI9P,EAAIqF,UAAUC,OAAS,EAAGtF,GAAK,EAAGA,WAClCiF,KAAK2K,SAASvK,UAAUrF,IAInC,OAAOiF,MAWP2K,OANF,WACE,OAAO3K,KAAK6K,QAAU7K,KAAK6K,SAAW,MA6FxC,MAAMC,GACJ,eAAeC,GACb/K,KAAKgL,QAAQD,GAIf,eAAeE,GACb,OAAOA,IAAUA,aAAiBH,IAAS9K,KAAK4H,MAAMqD,IAAUjL,KAAK8J,KAAKmB,IAI5E,aAAaA,GACX,OAAOA,GAA4B,iBAAZA,EAAMpP,GAAqC,iBAAZoP,EAAMtI,GAAqC,iBAAZsI,EAAMzL,EAO7F,cAActD,EAAO,UAAWD,EAAGiP,GAEjC,MAAM,OACJC,EAAM,MACN9C,EAAK,IACL+C,EACA7I,GAAI8I,GACF/I,KAEJ,GAAa,YAATpG,EAAoB,CACtB,MAAMlB,EAAI,GAAYmQ,IAAW,GAC3B/P,EAAI,GAAY+P,IAAW,GAC3BG,EAAI,IAAMH,IAEhB,OADc,IAAIL,GAAM9P,EAAGI,EAAGkQ,EAAG,OAE5B,GAAa,SAATpP,EAAiB,CAE1B,MAAML,EAAIwM,EAAM,GAAK+C,EAAI,EAAIC,GAD7BpP,EAAS,MAALA,EAAYkP,IAAWlP,GACW,GAAM,KAAQ,KAC9C0G,EAAI0F,EAAM,GAAK+C,EAAI,EAAIC,EAAKpP,EAAI,GAAM,KAAO,KAC7CuD,EAAI6I,EAAM,IAAM+C,EAAI,EAAIC,EAAKpP,EAAI,GAAM,KAAO,KAEpD,OADc,IAAI6O,GAAMjP,EAAG8G,EAAGnD,GAEzB,GAAa,WAATtD,EAAmB,CAC5B,MAAMlB,EAAI,EAAYmQ,IAAW,GAC3B/P,EAAI,GAAW+P,IAAW,EAC1BG,EAAI,IAAMH,IAEhB,OADc,IAAIL,GAAM9P,EAAGI,EAAGkQ,EAAG,OAE5B,GAAa,SAATpP,EAAiB,CAC1B,MAAMlB,EAAI,GAAK,GAAKmQ,IACd/P,EAAI,GAAa+P,IAAW,GAC5BG,EAAI,IAAMH,IAEhB,OADc,IAAIL,GAAM9P,EAAGI,EAAGkQ,EAAG,OAE5B,GAAa,QAATpP,EAAgB,CACzB,MAAML,EAAI,IAAMsP,IACVxI,EAAI,IAAMwI,IACV3L,EAAI,IAAM2L,IAEhB,OADc,IAAIL,GAAMjP,EAAG8G,EAAGnD,GAEzB,GAAa,QAATtD,EAAgB,CACzB,MAAMlB,EAAI,IAAMmQ,IACVhB,EAAI,IAAMgB,IAAW,IACrB3L,EAAI,IAAM2L,IAAW,IAE3B,OADc,IAAIL,GAAM9P,EAAGmP,EAAG3K,EAAG,OAE5B,GAAa,SAATtD,EAAiB,CAC1B,MAAMqP,EAAO,IAAMJ,IAEnB,OADc,IAAIL,GAAMS,EAAMA,EAAMA,GAGpC,MAAM,IAAIvN,MAAM,iCAKpB,YAAYiN,GACV,MAAwB,iBAAVA,IAAuBtD,EAAMmC,KAAKmB,IAAUrD,EAAMkC,KAAKmB,IAGvE,OAEE,MAAM,GACJO,EAAE,GACFC,EAAE,GACFC,GACE1L,KAAKuH,OACF1L,EAAG8G,EAAGnD,GAAK,CAACgM,EAAIC,EAAIC,GAAIC,IAAIvB,GAAKA,EAAI,KAEtCM,EAAIpI,KAAKiG,IAAI,EAAI1M,EAAG,EAAI8G,EAAG,EAAInD,GAErC,GAAU,IAANkL,EAEF,OAAO,IAAII,GAAM,EAAG,EAAG,EAAG,EAAG,QAQ/B,OADc,IAAIA,IAJP,EAAIjP,EAAI6O,IAAM,EAAIA,IAClB,EAAI/H,EAAI+H,IAAM,EAAIA,IAClB,EAAIlL,EAAIkL,IAAM,EAAIA,GAEIA,EAAG,QAItC,MAEE,MAAM,GACJc,EAAE,GACFC,EAAE,GACFC,GACE1L,KAAKuH,OACF1L,EAAG8G,EAAGnD,GAAK,CAACgM,EAAIC,EAAIC,GAAIC,IAAIvB,GAAKA,EAAI,KAEtC9B,EAAMhG,KAAKgG,IAAIzM,EAAG8G,EAAGnD,GACrB+I,EAAMjG,KAAKiG,IAAI1M,EAAG8G,EAAGnD,GACrBxE,GAAKsN,EAAMC,GAAO,EAElBqD,EAAStD,IAAQC,EAEjBsD,EAAQvD,EAAMC,EAKpB,OADc,IAAIuC,GAAM,KAFdc,EAAS,EAAItD,IAAQzM,IAAM8G,EAAInD,GAAKqM,GAASlJ,EAAInD,EAAI,EAAI,IAAM,EAAI8I,IAAQ3F,IAAMnD,EAAI3D,GAAKgQ,EAAQ,GAAK,EAAIvD,IAAQ9I,IAAM3D,EAAI8G,GAAKkJ,EAAQ,GAAK,EAAI,GAE5H,KAHvBD,EAAS,EAAI5Q,EAAI,GAAM6Q,GAAS,EAAIvD,EAAMC,GAAOsD,GAASvD,EAAMC,IAGhC,IAAMvN,EAAG,OAIrD,KAAKmP,EAAI,EAAG3K,EAAI,EAAGpE,EAAI,EAAGC,EAAI,EAAGqN,EAAQ,OAIvC,GAFAyB,EAAKA,GAAI,EAELnK,KAAK0I,MACP,IAAK,MAAMP,KAAanI,KAAK0I,aACpB1I,KAAKA,KAAK0I,MAAMP,IAI3B,GAAiB,iBAANgC,EAETzB,EAAqB,iBAANrN,EAAiBA,EAAIqN,EACpCrN,EAAiB,iBAANA,EAAiB,EAAIA,EAEhCI,OAAO0E,OAAOH,KAAM,CAClBwL,GAAIrB,EACJsB,GAAIjM,EACJkM,GAAItQ,EACJ0Q,GAAIzQ,EACJqN,eAEG,GAAIyB,aAAaxK,MACtBK,KAAK0I,MAAQlJ,IAAsB,iBAAT2K,EAAE,GAAkBA,EAAE,GAAKA,EAAE,KAAO,MAC9D1O,OAAO0E,OAAOH,KAAM,CAClBwL,GAAIrB,EAAE,GACNsB,GAAItB,EAAE,GACNuB,GAAIvB,EAAE,GACN2B,GAAI3B,EAAE,IAAM,SAET,GAAIA,aAAa1O,OAAQ,CAE9B,MAAMsQ,EA9NZ,SAAuB5B,EAAG3K,GACxB,MAAMwM,EAASvD,GAAG0B,EAAG,OAAS,CAC5BqB,GAAIrB,EAAEtO,EACN4P,GAAItB,EAAExH,EACN+I,GAAIvB,EAAE3K,EACNsM,GAAI,EACJpD,MAAO,OACLD,GAAG0B,EAAG,OAAS,CACjBqB,GAAIrB,EAAExG,EACN8H,GAAItB,EAAEvG,EACN8H,GAAIvB,EAAE8B,EACNH,GAAI,EACJpD,MAAO,OACLD,GAAG0B,EAAG,OAAS,CACjBqB,GAAIrB,EAAEmB,EACNG,GAAItB,EAAErN,EACN4O,GAAIvB,EAAEnP,EACN8Q,GAAI,EACJpD,MAAO,OACLD,GAAG0B,EAAG,OAAS,CACjBqB,GAAIrB,EAAEnP,EACNyQ,GAAItB,EAAEA,EACNuB,GAAIvB,EAAE3K,EACNsM,GAAI,EACJpD,MAAO,OACLD,GAAG0B,EAAG,OAAS,CACjBqB,GAAIrB,EAAEnP,EACNyQ,GAAItB,EAAE/O,EACNsQ,GAAIvB,EAAEmB,EACNQ,GAAI,EACJpD,MAAO,OACLD,GAAG0B,EAAG,QAAU,CAClBqB,GAAIrB,EAAE/O,EACNqQ,GAAItB,EAAEhP,EACNuQ,GAAIvB,EAAEvG,EACNkI,GAAI3B,EAAEO,EACNhC,MAAO,QACL,CACF8C,GAAI,EACJC,GAAI,EACJC,GAAI,EACJhD,MAAO,OAGT,OADAsD,EAAOtD,MAAQlJ,GAAKwM,EAAOtD,MACpBsD,EAkLYE,CAAc/B,EAAG3K,GAChC/D,OAAO0E,OAAOH,KAAM+L,QACf,GAAiB,iBAAN5B,EAChB,GAAIvC,EAAMkC,KAAKK,GAAI,CACjB,MAAMgC,EAAehC,EAAEzH,QAAQgF,EAAY,KACpC8D,EAAIC,EAAIC,GAAMnE,EAAI6E,KAAKD,GAAchL,MAAM,EAAG,GAAGwK,IAAIvB,GAAKiC,SAASjC,IAC1E3O,OAAO0E,OAAOH,KAAM,CAClBwL,KACAC,KACAC,KACAI,GAAI,EACJpD,MAAO,YAEJ,KAAIf,EAAMmC,KAAKK,GAWf,MAAMnM,MAAM,oDAXO,CACxB,MAAMsO,EAAWlC,GAAKiC,SAASjC,EAAG,KAE3B,CAAEoB,EAAIC,EAAIC,GAAMpE,EAAI8E,KAnQnC,SAAqB9E,GACnB,OAAsB,IAAfA,EAAIjH,OAAe,CAAC,IAAKiH,EAAIiF,UAAU,EAAG,GAAIjF,EAAIiF,UAAU,EAAG,GAAIjF,EAAIiF,UAAU,EAAG,GAAIjF,EAAIiF,UAAU,EAAG,GAAIjF,EAAIiF,UAAU,EAAG,GAAIjF,EAAIiF,UAAU,EAAG,IAAIpD,KAAK,IAAM7B,EAkQnIkF,CAAYrC,IAAIwB,IAAIW,GACpD7Q,OAAO0E,OAAOH,KAAM,CAClBwL,KACAC,KACAC,KACAI,GAAI,EACJpD,MAAO,SAMb,MAAM,GACJ8C,EAAE,GACFC,EAAE,GACFC,EAAE,GACFI,GACE9L,KACEyM,EAA4B,QAAfzM,KAAK0I,MAAkB,CACxC7M,EAAG2P,EACH7I,EAAG8I,EACHjM,EAAGkM,GACc,QAAf1L,KAAK0I,MAAkB,CACzB/E,EAAG6H,EACH5H,EAAG6H,EACHQ,EAAGP,GACc,QAAf1L,KAAK0I,MAAkB,CACzB4C,EAAGE,EACH1O,EAAG2O,EACHzQ,EAAG0Q,GACc,QAAf1L,KAAK0I,MAAkB,CACzB1N,EAAGwQ,EACHrB,EAAGsB,EACHjM,EAAGkM,GACc,QAAf1L,KAAK0I,MAAkB,CACzB1N,EAAGwQ,EACHpQ,EAAGqQ,EACHH,EAAGI,GACc,SAAf1L,KAAK0I,MAAmB,CAC1BtN,EAAGoQ,EACHrQ,EAAGsQ,EACH7H,EAAG8H,EACHhB,EAAGoB,GACD,GACJrQ,OAAO0E,OAAOH,KAAMyM,GAGtB,MAEE,MAAM,EACJ9I,EAAC,EACDC,EAAC,EACDqI,GACEjM,KAAK0M,MAOT,OADc,IAAI5B,GAJR,IAAMlH,EAAI,GACV,KAAOD,EAAIC,GACX,KAAOA,EAAIqI,GAEY,OAInC,MAEE,MAAM,EACJjR,EAAC,EACDmP,EAAC,EACD3K,GACEQ,KAAK2M,MAEHvR,EAAIkH,KAAKsK,KAAKzC,GAAK,EAAI3K,GAAK,GAClC,IAAI8L,EAAI,IAAMhJ,KAAKuK,MAAMrN,EAAG2K,GAAK7H,KAAKC,GAElC+I,EAAI,IACNA,IAAM,EACNA,EAAI,IAAMA,GAKZ,OADc,IAAIR,GAAM9P,EAAGI,EAAGkQ,EAAG,OAQnC,MACE,GAAmB,QAAftL,KAAK0I,MACP,OAAO1I,KACF,GAzRK,SADE0I,EA0RM1I,KAAK0I,QAzRM,QAAVA,GAA6B,QAAVA,EAyRP,CAE/B,IAAI,EACF/E,EAAC,EACDC,EAAC,EACDqI,GACEjM,KAEJ,GAAmB,QAAfA,KAAK0I,OAAkC,QAAf1I,KAAK0I,MAAiB,CAEhD,IAAI,EACF1N,EAAC,EACDmP,EAAC,EACD3K,GACEQ,KAEJ,GAAmB,QAAfA,KAAK0I,MAAiB,CACxB,MAAM,EACJtN,EAAC,EACDkQ,GACEtL,KACE8M,EAAOxK,KAAKC,GAAK,IACvB4H,EAAI/O,EAAIkH,KAAKyK,IAAID,EAAOxB,GACxB9L,EAAIpE,EAAIkH,KAAK8I,IAAI0B,EAAOxB,GAI1B,MAAM0B,GAAMhS,EAAI,IAAM,IAChBiS,EAAK9C,EAAI,IAAM6C,EACfE,EAAKF,EAAKxN,EAAI,IAEd2N,EAAK,GAAK,IACVC,EAAK,QACLC,EAAK,MACX1J,EAAI,QAAWsJ,GAAM,EAAIG,EAAKH,GAAM,GAAKA,EAAKE,GAAME,GACpDzJ,EAAI,GAAWoJ,GAAM,EAAII,EAAKJ,GAAM,GAAKA,EAAKG,GAAME,GACpDpB,EAAI,SAAWiB,GAAM,EAAIE,EAAKF,GAAM,GAAKA,EAAKC,GAAME,GAItD,MAAMC,EAAS,OAAJ3J,GAAkB,OAALC,GAAmB,MAALqI,EAChCsB,GAAU,MAAL5J,EAAkB,OAAJC,EAAiB,MAAJqI,EAChCuB,EAAS,MAAJ7J,GAAkB,KAALC,EAAkB,MAAJqI,EAEhCwB,EAAMnL,KAAKmL,IACXC,EAAK,SACL7R,EAAIyR,EAAKI,EAAK,MAAQD,EAAIH,EAAI,EAAI,KAAO,KAAQ,MAAQA,EACzD3K,EAAI4K,EAAKG,EAAK,MAAQD,EAAIF,EAAI,EAAI,KAAO,KAAQ,MAAQA,EACzD/N,EAAIgO,EAAKE,EAAK,MAAQD,EAAID,EAAI,EAAI,KAAO,KAAQ,MAAQA,EAG/D,OADc,IAAI1C,GAAM,IAAMjP,EAAG,IAAM8G,EAAG,IAAMnD,GAE3C,GAAmB,QAAfQ,KAAK0I,MAAiB,CAG/B,IAAI,EACF4C,EAAC,EACDxO,EAAC,EACD9B,GACEgF,KAKJ,GAJAsL,GAAK,IACLxO,GAAK,IACL9B,GAAK,IAEK,IAAN8B,EAAS,CACX9B,GAAK,IAEL,OADc,IAAI8P,GAAM9P,EAAGA,EAAGA,GAKhC,MAAM4N,EAAI5N,EAAI,GAAMA,GAAK,EAAI8B,GAAK9B,EAAI8B,EAAI9B,EAAI8B,EACxCD,EAAI,EAAI7B,EAAI4N,EAEZ/M,EAAI,IAAM8M,GAAS9L,EAAG+L,EAAG0C,EAAI,EAAI,GACjC3I,EAAI,IAAMgG,GAAS9L,EAAG+L,EAAG0C,GACzB9L,EAAI,IAAMmJ,GAAS9L,EAAG+L,EAAG0C,EAAI,EAAI,GAGvC,OADc,IAAIR,GAAMjP,EAAG8G,EAAGnD,GAEzB,GAAmB,SAAfQ,KAAK0I,MAAkB,CAGhC,MAAM,EACJtN,EAAC,EACDD,EAAC,EACDyI,EAAC,EACD8G,GACE1K,KAEEnE,EAAI,KAAO,EAAIyG,KAAKiG,IAAI,EAAGnN,GAAK,EAAIsP,GAAKA,IACzC/H,EAAI,KAAO,EAAIL,KAAKiG,IAAI,EAAGpN,GAAK,EAAIuP,GAAKA,IACzClL,EAAI,KAAO,EAAI8C,KAAKiG,IAAI,EAAG3E,GAAK,EAAI8G,GAAKA,IAG/C,OADc,IAAII,GAAMjP,EAAG8G,EAAGnD,GAG9B,OAAOQ,KA3Xb,IAAkB0I,EA+XhB,UACE,MAAM,GACJ8C,EAAE,GACFC,EAAE,GACFC,EAAE,GACFI,EAAE,MACFpD,GACE1I,KACJ,MAAO,CAACwL,EAAIC,EAAIC,EAAII,EAAIpD,GAG1B,QACE,MAAO7M,EAAG8G,EAAGnD,GAAKQ,KAAK2N,WAAWhC,IAAIzD,IAEtC,MAAO,IAAIrM,IAAI8G,IAAInD,IAGrB,QACE,MAAOoO,EAAIC,EAAIC,GAAM9N,KAAK2N,WAG1B,MADe,OAAOC,KAAMC,KAAMC,KAIpC,WACE,OAAO9N,KAAK+N,QAGd,MAEE,MACEvC,GAAIwC,EACJvC,GAAIwC,EACJvC,GAAIwC,GACFlO,KAAKuH,OACF1L,EAAG8G,EAAGnD,GAAK,CAACwO,EAAMC,EAAMC,GAAMvC,IAAIvB,GAAKA,EAAI,KAE5C+D,EAAKtS,EAAI,OAAUyG,KAAKmL,KAAK5R,EAAI,MAAS,MAAO,KAAOA,EAAI,MAC5DuS,EAAKzL,EAAI,OAAUL,KAAKmL,KAAK9K,EAAI,MAAS,MAAO,KAAOA,EAAI,MAC5D0L,EAAK7O,EAAI,OAAU8C,KAAKmL,KAAKjO,EAAI,MAAS,MAAO,KAAOA,EAAI,MAE5D8O,GAAW,MAALH,EAAmB,MAALC,EAAmB,MAALC,GAAe,OACjDE,GAAW,MAALJ,EAAmB,MAALC,EAAmB,MAALC,GAAe,EACjDG,GAAW,MAALL,EAAmB,MAALC,EAAmB,MAALC,GAAe,QAEjD1K,EAAI2K,EAAK,QAAWhM,KAAKmL,IAAIa,EAAI,EAAI,GAAK,MAAQA,EAAK,GAAK,IAC5D1K,EAAI2K,EAAK,QAAWjM,KAAKmL,IAAIc,EAAI,EAAI,GAAK,MAAQA,EAAK,GAAK,IAC5DtC,EAAIuC,EAAK,QAAWlM,KAAKmL,IAAIe,EAAI,EAAI,GAAK,MAAQA,EAAK,GAAK,IAGlE,OADc,IAAI1D,GAAMnH,EAAGC,EAAGqI,EAAG,OAQnC,WACE,MAAM,GACJT,EAAE,GACFC,EAAE,GACFC,GACE1L,KAAKuH,OACH,IACJe,EAAG,IACHC,EAAG,MACHF,GACE/F,KAIJ,MAAO,CAACkJ,EAAIC,EAAIC,GAAIC,IAFLvB,GAAK9B,EAAI,EAAGC,EAAIF,EAAM+B,GAAI,QAW7C,MAAM,GAEJ,eAAejE,GACbnG,KAAKgL,QAAQ7E,GAIf,QACE,OAAO,IAAI,GAAMnG,MAGnB,KAAK2D,EAAGC,GACN,MAAM6K,EACD,EADCA,EAED,EAGCC,EAAS/O,MAAMgC,QAAQgC,GAAK,CAChCA,EAAGA,EAAE,GACLC,EAAGD,EAAE,IACU,iBAANA,EAAiB,CAC1BA,EAAGA,EAAEA,EACLC,EAAGD,EAAEC,GACH,CACFD,EAAGA,EACHC,EAAGA,GAKL,OAFA5D,KAAK2D,EAAgB,MAAZ+K,EAAO/K,EAAY8K,EAASC,EAAO/K,EAC5C3D,KAAK4D,EAAgB,MAAZ8K,EAAO9K,EAAY6K,EAASC,EAAO9K,EACrC5D,KAGT,UACE,MAAO,CAACA,KAAK2D,EAAG3D,KAAK4D,GAGvB,UAAUzI,GACR,OAAO6E,KAAK2O,QAAQC,WAAWzT,GAIjC,WAAWA,GACJ0T,GAAOC,aAAa3T,KACvBA,EAAI,IAAI0T,GAAO1T,IAGjB,MAAM,EACJwI,EAAC,EACDC,GACE5D,KAIJ,OAFAA,KAAK2D,EAAIxI,EAAEgP,EAAIxG,EAAIxI,EAAEC,EAAIwI,EAAIzI,EAAEsF,EAC/BT,KAAK4D,EAAIzI,EAAEqE,EAAImE,EAAIxI,EAAEE,EAAIuI,EAAIzI,EAAE4T,EACxB/O,MAQX,SAASgP,GAAY7E,EAAG3K,EAAGyP,GACzB,OAAO3M,KAAK4M,IAAI1P,EAAI2K,IAAM8E,GAAa,MAGzC,MAAMJ,GACJ,eAAe1I,GACbnG,KAAKgL,QAAQ7E,GAGf,wBAAwB3K,GAEtB,MAAM2T,EAAsB,SAAX3T,EAAE4T,OAA8B,IAAX5T,EAAE4T,KAClCC,EAAQ7T,EAAE4T,OAASD,GAAuB,MAAX3T,EAAE4T,OAAiB,EAAI,EACtDE,EAAQ9T,EAAE4T,OAASD,GAAuB,MAAX3T,EAAE4T,OAAiB,EAAI,EACtDG,EAAQ/T,EAAEgU,MAAQhU,EAAEgU,KAAKnP,OAAS7E,EAAEgU,KAAK,GAAKC,SAASjU,EAAEgU,MAAQhU,EAAEgU,KAAOC,SAASjU,EAAE+T,OAAS/T,EAAE+T,MAAQ,EACxGG,EAAQlU,EAAEgU,MAAQhU,EAAEgU,KAAKnP,OAAS7E,EAAEgU,KAAK,GAAKC,SAASjU,EAAEgU,MAAQhU,EAAEgU,KAAOC,SAASjU,EAAEkU,OAASlU,EAAEkU,MAAQ,EACxGC,EAASnU,EAAEoU,OAASpU,EAAEoU,MAAMvP,OAAS7E,EAAEoU,MAAM,GAAKP,EAAQI,SAASjU,EAAEoU,OAASpU,EAAEoU,MAAQP,EAAQI,SAASjU,EAAEmU,QAAUnU,EAAEmU,OAASN,EAAQA,EACxIQ,EAASrU,EAAEoU,OAASpU,EAAEoU,MAAMvP,OAAS7E,EAAEoU,MAAM,GAAKN,EAAQG,SAASjU,EAAEoU,OAASpU,EAAEoU,MAAQN,EAAQG,SAASjU,EAAEqU,QAAUrU,EAAEqU,OAASP,EAAQA,EACxIQ,EAAQtU,EAAEsU,OAAS,EACnBC,EAAQvU,EAAEwU,QAAUxU,EAAEuU,OAAS,EAC/BzM,EAAS,IAAI,GAAM9H,EAAE8H,QAAU9H,EAAEyU,QAAUzU,EAAE+H,IAAM/H,EAAEgI,QAAShI,EAAEiI,IAAMjI,EAAEkI,SACxEH,EAAKD,EAAOK,EACZF,EAAKH,EAAOM,EAEZ4C,EAAW,IAAI,GAAMhL,EAAEgL,UAAYhL,EAAE0U,IAAM1U,EAAE2U,WAAaC,IAAK5U,EAAE6U,IAAM7U,EAAE8U,WAAaF,KACtFF,EAAK1J,EAAS7C,EACd0M,EAAK7J,EAAS5C,EACd2M,EAAY,IAAI,GAAM/U,EAAE+U,WAAa/U,EAAEgV,IAAMhV,EAAEiV,WAAYjV,EAAEkV,IAAMlV,EAAEmV,YACrEH,EAAKD,EAAU5M,EACf+M,EAAKH,EAAU3M,EACfgN,EAAW,IAAI,GAAMpV,EAAEoV,UAAYpV,EAAEqV,IAAMrV,EAAEsV,UAAWtV,EAAEuV,IAAMvV,EAAEwV,WAIxE,MAAO,CACLrB,SACAE,SACAN,QACAG,QACAI,QACAC,QACAc,GAVSD,EAASjN,EAWlBoN,GAVSH,EAAShN,EAWlB4M,KACAE,KACAnN,KACAE,KACAyM,KACAG,MAIJ,iBAAiBlG,GACf,MAAO,CACLA,EAAGA,EAAE,GACL3K,EAAG2K,EAAE,GACL/O,EAAG+O,EAAE,GACL9O,EAAG8O,EAAE,GACL1J,EAAG0J,EAAE,GACL4E,EAAG5E,EAAE,IAIT,oBAAoB3O,GAClB,OAAc,MAAPA,EAAE2O,GAAoB,MAAP3O,EAAEgE,GAAoB,MAAPhE,EAAEJ,GAAoB,MAAPI,EAAEH,GAAoB,MAAPG,EAAEiF,GAAoB,MAAPjF,EAAEuT,EAItF,sBAAsB/T,EAAGa,EAAGL,GAE1B,MAAM2O,EAAInP,EAAEmP,EAAItO,EAAEsO,EAAInP,EAAEI,EAAIS,EAAE2D,EACxBA,EAAIxE,EAAEwE,EAAI3D,EAAEsO,EAAInP,EAAEK,EAAIQ,EAAE2D,EACxBpE,EAAIJ,EAAEmP,EAAItO,EAAET,EAAIJ,EAAEI,EAAIS,EAAER,EACxBA,EAAIL,EAAEwE,EAAI3D,EAAET,EAAIJ,EAAEK,EAAIQ,EAAER,EACxBoF,EAAIzF,EAAEyF,EAAIzF,EAAEmP,EAAItO,EAAE4E,EAAIzF,EAAEI,EAAIS,EAAEkT,EAC9BA,EAAI/T,EAAE+T,EAAI/T,EAAEwE,EAAI3D,EAAE4E,EAAIzF,EAAEK,EAAIQ,EAAEkT,EAQpC,OANAvT,EAAE2O,EAAIA,EACN3O,EAAEgE,EAAIA,EACNhE,EAAEJ,EAAIA,EACNI,EAAEH,EAAIA,EACNG,EAAEiF,EAAIA,EACNjF,EAAEuT,EAAIA,EACCvT,EAGT,OAAOyV,EAAIC,EAAIC,GACb,OAAOnR,KAAK2O,QAAQyC,QAAQH,EAAIC,EAAIC,GAItC,QAAQF,EAAIC,EAAIC,GACd,MAAME,EAAKJ,GAAM,EACXK,EAAKJ,GAAM,EACjB,OAAOlR,KAAKuR,YAAYF,GAAKC,GAAIE,WAAWL,GAAQI,WAAWF,EAAIC,GAIrE,QACE,OAAO,IAAIzC,GAAO7O,MAIpB,UAAUiR,EAAK,EAAGC,EAAK,GAErB,MAAM/G,EAAInK,KAAKmK,EACT3K,EAAIQ,KAAKR,EACTpE,EAAI4E,KAAK5E,EACTC,EAAI2E,KAAK3E,EACToF,EAAIT,KAAKS,EACTsO,EAAI/O,KAAK+O,EAET0C,EAActH,EAAI9O,EAAImE,EAAIpE,EAC1BsW,EAAMD,EAAc,EAAI,GAAK,EAG7BE,EAAKD,EAAMpP,KAAKsK,KAAKzC,EAAIA,EAAI3K,EAAIA,GACjCoS,EAAWtP,KAAKuK,MAAM6E,EAAMlS,EAAGkS,EAAMvH,GACrC4F,EAAQ,IAAMzN,KAAKC,GAAKqP,EACxBzE,EAAK7K,KAAKyK,IAAI6E,GACdC,EAAKvP,KAAK8I,IAAIwG,GAGdE,GAAO3H,EAAI/O,EAAIoE,EAAInE,GAAKoW,EACxBM,EAAK3W,EAAIuW,GAAMG,EAAM3H,EAAI3K,IAAMnE,EAAIsW,GAAMG,EAAMtS,EAAI2K,GAKzD,MAAO,CAELwF,OAAQgC,EACR9B,OAAQkC,EACRjC,MAAOgC,EACP9B,OAAQD,EACRU,WATShQ,EAAIwQ,EAAKA,EAAK9D,EAAKwE,EAAKT,GAAMY,EAAM3E,EAAKwE,EAAKE,EAAKE,GAU5DpB,WATS5B,EAAImC,EAAKD,EAAKY,EAAKF,EAAKT,GAAMY,EAAMD,EAAKF,EAAKxE,EAAK4E,GAU5DvO,QAASyN,EACTvN,QAASwN,EAET/G,EAAGnK,KAAKmK,EACR3K,EAAGQ,KAAKR,EACRpE,EAAG4E,KAAK5E,EACRC,EAAG2E,KAAK3E,EACRoF,EAAGT,KAAKS,EACRsO,EAAG/O,KAAK+O,GAKZ,OAAOiD,GACL,GAAIA,IAAUhS,KAAM,OAAO,EAC3B,MAAMiS,EAAO,IAAIpD,GAAOmD,GACxB,OAAOhD,GAAYhP,KAAKmK,EAAG8H,EAAK9H,IAAM6E,GAAYhP,KAAKR,EAAGyS,EAAKzS,IAAMwP,GAAYhP,KAAK5E,EAAG6W,EAAK7W,IAAM4T,GAAYhP,KAAK3E,EAAG4W,EAAK5W,IAAM2T,GAAYhP,KAAKS,EAAGwR,EAAKxR,IAAMuO,GAAYhP,KAAK+O,EAAGkD,EAAKlD,GAI7L,KAAKmD,EAAMjC,GACT,OAAOjQ,KAAK2O,QAAQwD,MAAMD,EAAMjC,GAGlC,MAAMiC,EAAMjC,GACV,MAAgB,MAATiC,EAAelS,KAAKoS,QAAQ,EAAG,EAAGnC,EAAQ,GAAc,MAATiC,EAAelS,KAAKoS,OAAO,GAAI,EAAG,EAAGnC,GAAUjQ,KAAKoS,QAAQ,GAAI,EAAGF,EAAMjC,GAAUiC,GAI3I,KAAKxD,GACH,MAAMD,EAAOI,GAAOwD,UAAU,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,IAU9C,OARA3D,EAASA,aAAkB4D,GAAU5D,EAAO6D,YAAgC,iBAAX7D,EAAsBG,GAAOwD,UAAU3D,EAAO3F,MAAMf,IAAW2D,IAAI6G,aAAe7S,MAAMgC,QAAQ+M,GAAUG,GAAOwD,UAAU3D,GAA4B,iBAAXA,GAAuBG,GAAOC,aAAaJ,GAAUA,EAA2B,iBAAXA,GAAsB,IAAIG,IAAS4D,UAAU/D,GAA+B,IAArBtO,UAAUC,OAAewO,GAAOwD,UAAU,GAAGlR,MAAMjG,KAAKkF,YAAcqO,EAE/YzO,KAAKmK,EAAgB,MAAZuE,EAAOvE,EAAYuE,EAAOvE,EAAIsE,EAAKtE,EAC5CnK,KAAKR,EAAgB,MAAZkP,EAAOlP,EAAYkP,EAAOlP,EAAIiP,EAAKjP,EAC5CQ,KAAK5E,EAAgB,MAAZsT,EAAOtT,EAAYsT,EAAOtT,EAAIqT,EAAKrT,EAC5C4E,KAAK3E,EAAgB,MAAZqT,EAAOrT,EAAYqT,EAAOrT,EAAIoT,EAAKpT,EAC5C2E,KAAKS,EAAgB,MAAZiO,EAAOjO,EAAYiO,EAAOjO,EAAIgO,EAAKhO,EAC5CT,KAAK+O,EAAgB,MAAZL,EAAOK,EAAYL,EAAOK,EAAIN,EAAKM,EACrC/O,KAGT,UACE,OAAOA,KAAK2O,QAAQ+D,WAItB,WAEE,MAAMvI,EAAInK,KAAKmK,EACT3K,EAAIQ,KAAKR,EACTpE,EAAI4E,KAAK5E,EACTC,EAAI2E,KAAK3E,EACToF,EAAIT,KAAKS,EACTsO,EAAI/O,KAAK+O,EAET4D,EAAMxI,EAAI9O,EAAImE,EAAIpE,EACxB,IAAKuX,EAAK,MAAM,IAAI3U,MAAM,iBAAmBgC,MAE7C,MAAM4S,EAAKvX,EAAIsX,EACTE,GAAMrT,EAAImT,EACVG,GAAM1X,EAAIuX,EACVI,EAAK5I,EAAIwI,EAETK,IAAOJ,EAAKnS,EAAIqS,EAAK/D,GACrBkE,IAAOJ,EAAKpS,EAAIsS,EAAKhE,GAQ3B,OANA/O,KAAKmK,EAAIyI,EACT5S,KAAKR,EAAIqT,EACT7S,KAAK5E,EAAI0X,EACT9S,KAAK3E,EAAI0X,EACT/S,KAAKS,EAAIuS,EACThT,KAAK+O,EAAIkE,EACFjT,KAGT,UAAUmR,GACR,OAAOnR,KAAK2O,QAAQ6C,WAAWL,GAGjC,WAAWA,GACT,MACMnW,EAAImW,aAAkBtC,GAASsC,EAAS,IAAItC,GAAOsC,GACzD,OAAOtC,GAAOqE,eAAelY,EAFnBgF,KAEyBA,MAIrC,SAASmR,GACP,OAAOnR,KAAK2O,QAAQwE,UAAUhC,GAGhC,UAAUA,GAER,MACMtV,EAAIsV,aAAkBtC,GAASsC,EAAS,IAAItC,GAAOsC,GACzD,OAAOtC,GAAOqE,eAFJlT,KAEsBnE,EAAGmE,MAIrC,OAAOnE,EAAGoV,EAAIC,GACZ,OAAOlR,KAAK2O,QAAQyE,QAAQvX,EAAGoV,EAAIC,GAGrC,QAAQrV,EAAGoV,EAAK,EAAGC,EAAK,GAEtBrV,EAAIwG,EAAQxG,GACZ,MAAMkR,EAAMzK,KAAKyK,IAAIlR,GACfuP,EAAM9I,KAAK8I,IAAIvP,IACf,EACJsO,EAAC,EACD3K,EAAC,EACDpE,EAAC,EACDC,EAAC,EACDoF,EAAC,EACDsO,GACE/O,KAOJ,OANAA,KAAKmK,EAAIA,EAAI4C,EAAMvN,EAAI4L,EACvBpL,KAAKR,EAAIA,EAAIuN,EAAM5C,EAAIiB,EACvBpL,KAAK5E,EAAIA,EAAI2R,EAAM1R,EAAI+P,EACvBpL,KAAK3E,EAAIA,EAAI0R,EAAM3R,EAAIgQ,EACvBpL,KAAKS,EAAIA,EAAIsM,EAAMgC,EAAI3D,EAAM8F,EAAK9F,EAAM6F,EAAKlE,EAAMkE,EACnDjR,KAAK+O,EAAIA,EAAIhC,EAAMtM,EAAI2K,EAAM6F,EAAK7F,EAAM8F,EAAKnE,EAAMmE,EAC5ClR,KAIT,MAAM2D,EAAGC,EAAGqN,EAAIC,GACd,OAAOlR,KAAK2O,QAAQyD,UAAUhS,WAGhC,OAAOuD,EAAGC,EAAID,EAAGsN,EAAK,EAAGC,EAAK,GAEH,IAArB9Q,UAAUC,SACZ6Q,EAAKD,EACLA,EAAKrN,EACLA,EAAID,GAGN,MAAM,EACJwG,EAAC,EACD3K,EAAC,EACDpE,EAAC,EACDC,EAAC,EACDoF,EAAC,EACDsO,GACE/O,KAOJ,OANAA,KAAKmK,EAAIA,EAAIxG,EACb3D,KAAKR,EAAIA,EAAIoE,EACb5D,KAAK5E,EAAIA,EAAIuI,EACb3D,KAAK3E,EAAIA,EAAIuI,EACb5D,KAAKS,EAAIA,EAAIkD,EAAIsN,EAAKtN,EAAIsN,EAC1BjR,KAAK+O,EAAIA,EAAInL,EAAIsN,EAAKtN,EAAIsN,EACnBlR,KAIT,MAAMmK,EAAG8G,EAAIC,GACX,OAAOlR,KAAK2O,QAAQ0E,OAAOlJ,EAAG8G,EAAIC,GAGpC,OAAOoC,EAAIrC,EAAK,EAAGC,EAAK,GACtB,MAAM,EACJ/G,EAAC,EACD3K,EAAC,EACDpE,EAAC,EACDC,EAAC,EACDoF,EAAC,EACDsO,GACE/O,KAIJ,OAHAA,KAAKmK,EAAIA,EAAI3K,EAAI8T,EACjBtT,KAAK5E,EAAIA,EAAIC,EAAIiY,EACjBtT,KAAKS,EAAIA,EAAIsO,EAAIuE,EAAKpC,EAAKoC,EACpBtT,KAIT,KAAK2D,EAAGC,EAAGqN,EAAIC,GACb,OAAOlR,KAAK2O,QAAQ4E,SAASnT,WAG/B,MAAMuD,EAAGC,EAAID,EAAGsN,EAAK,EAAGC,EAAK,GAEF,IAArB9Q,UAAUC,SACZ6Q,EAAKD,EACLA,EAAKrN,EACLA,EAAID,GAINA,EAAItB,EAAQsB,GACZC,EAAIvB,EAAQuB,GACZ,MAAM0P,EAAKhR,KAAKkR,IAAI7P,GACd8P,EAAKnR,KAAKkR,IAAI5P,IACd,EACJuG,EAAC,EACD3K,EAAC,EACDpE,EAAC,EACDC,EAAC,EACDoF,EAAC,EACDsO,GACE/O,KAOJ,OANAA,KAAKmK,EAAIA,EAAI3K,EAAI8T,EACjBtT,KAAKR,EAAIA,EAAI2K,EAAIsJ,EACjBzT,KAAK5E,EAAIA,EAAIC,EAAIiY,EACjBtT,KAAK3E,EAAIA,EAAID,EAAIqY,EACjBzT,KAAKS,EAAIA,EAAIsO,EAAIuE,EAAKpC,EAAKoC,EAC3BtT,KAAK+O,EAAIA,EAAItO,EAAIgT,EAAKxC,EAAKwC,EACpBzT,KAIT,MAAM2D,EAAGsN,EAAIC,GACX,OAAOlR,KAAKwP,KAAK7L,EAAG,EAAGsN,EAAIC,GAI7B,MAAMtN,EAAGqN,EAAIC,GACX,OAAOlR,KAAKwP,KAAK,EAAG5L,EAAGqN,EAAIC,GAG7B,UACE,MAAO,CAAClR,KAAKmK,EAAGnK,KAAKR,EAAGQ,KAAK5E,EAAG4E,KAAK3E,EAAG2E,KAAKS,EAAGT,KAAK+O,GAIvD,WACE,MAAO,UAAY/O,KAAKmK,EAAI,IAAMnK,KAAKR,EAAI,IAAMQ,KAAK5E,EAAI,IAAM4E,KAAK3E,EAAI,IAAM2E,KAAKS,EAAI,IAAMT,KAAK+O,EAAI,IAIzG,UAAUvT,GAER,GAAIqT,GAAOC,aAAatT,GAAI,CAE1B,OADe,IAAIqT,GAAOrT,GACZ2X,UAAUnT,MAI1B,MAAM/D,EAAI4S,GAAO6E,iBAAiBlY,IAGhCmI,EAAGJ,EACHK,EAAGH,GACD,IAAI,GAAMxH,EAAEsH,GAAItH,EAAEwH,IAAIgP,UAJVzS,MAMV2T,GAAc,IAAI9E,IAAS0C,WAAWtV,EAAE4U,GAAI5U,EAAE8U,IAAIS,WANxCxR,MAM4DuR,YAAYhO,GAAKE,GAAI2O,OAAOnW,EAAE0T,OAAQ1T,EAAE4T,QAAQ0D,MAAMtX,EAAEsT,MAAOtT,EAAEyT,OAAO2D,OAAOpX,EAAE6T,OAAOsD,QAAQnX,EAAE8T,OAAOwB,WAAWhO,EAAIE,GAEpM,GAAIgM,SAASxT,EAAEiU,KAAOT,SAASxT,EAAEoU,IAAK,CACpC,MAAM/M,EAAS,IAAI,GAAMC,EAAIE,GAAIgP,UAAUkB,GAGrCtC,EAAK5B,SAASxT,EAAEiU,IAAMjU,EAAEiU,GAAK5M,EAAOK,EAAI,EACxC2N,EAAK7B,SAASxT,EAAEoU,IAAMpU,EAAEoU,GAAK/M,EAAOM,EAAI,EAC9C+P,EAAYpC,WAAWF,EAAIC,GAK7B,OADAqC,EAAYpC,WAAWtV,EAAEuU,GAAIvU,EAAEyU,IACxBiD,EAIT,UAAUhQ,EAAGC,GACX,OAAO5D,KAAK2O,QAAQ4C,WAAW5N,EAAGC,GAGpC,WAAWD,EAAGC,GAGZ,OAFA5D,KAAKS,GAAKkD,GAAK,EACf3D,KAAK+O,GAAKnL,GAAK,EACR5D,KAGT,UACE,MAAO,CACLmK,EAAGnK,KAAKmK,EACR3K,EAAGQ,KAAKR,EACRpE,EAAG4E,KAAK5E,EACRC,EAAG2E,KAAK3E,EACRoF,EAAGT,KAAKS,EACRsO,EAAG/O,KAAK+O,IAwBd,SAAS6E,KAEP,IAAKA,GAAOC,MAAO,CACjB,MAAM7P,EAAMW,IAAemP,KAAK,EAAG,GACnC9P,EAAIjF,KAAKwK,MAAMG,QAAU,CAAC,aAAc,qBAAsB,cAAe,aAAc,oBAAoBP,KAAK,KACpHnF,EAAIoC,KAAK,YAAa,SACtBpC,EAAIoC,KAAK,cAAe,QACxB,MAAM2N,EAAO/P,EAAI+P,OAAOhV,KACxB6U,GAAOC,MAAQ,CACb7P,MACA+P,QAIJ,IAAKH,GAAOC,MAAM7P,IAAIjF,KAAKiV,WAAY,CACrC,MAAMxU,EAAI6E,EAAQE,SAAS0P,MAAQ5P,EAAQE,SAAS2P,gBACpDN,GAAOC,MAAM7P,IAAImQ,MAAM3U,GAGzB,OAAOoU,GAAOC,MAGhB,SAASO,GAAYjR,GACnB,QAAQA,EAAIF,OAAUE,EAAID,QAAWC,EAAIQ,GAAMR,EAAIS,GAzBrD+B,EAASkJ,GAAQ,UAqCjB,MAAMwF,GACJ,eAAelO,GACbnG,KAAKgL,QAAQ7E,GAGf,YAIE,OAFAnG,KAAK2D,GAAKU,EAAQC,OAAOgQ,YACzBtU,KAAK4D,GAAKS,EAAQC,OAAOiQ,YAClB,IAAIF,GAAIrU,MAGjB,KAAK0O,GAYH,OAVAA,EAA2B,iBAAXA,EAAsBA,EAAO3F,MAAMf,IAAW2D,IAAI6G,YAAc7S,MAAMgC,QAAQ+M,GAAUA,EAA2B,iBAAXA,EAAsB,CAAgB,MAAfA,EAAO8F,KAAe9F,EAAO8F,KAAO9F,EAAO/K,EAAiB,MAAd+K,EAAO+F,IAAc/F,EAAO+F,IAAM/F,EAAO9K,EAAG8K,EAAOzL,MAAOyL,EAAOxL,QAA+B,IAArB9C,UAAUC,OAAe,GAAGc,MAAMjG,KAAKkF,WADlS,CAAC,EAAG,EAAG,EAAG,GAEvBJ,KAAK2D,EAAI+K,EAAO,IAAM,EACtB1O,KAAK4D,EAAI8K,EAAO,IAAM,EACtB1O,KAAKiD,MAAQjD,KAAK0U,EAAIhG,EAAO,IAAM,EACnC1O,KAAKkD,OAASlD,KAAKsL,EAAIoD,EAAO,IAAM,EAEpC1O,KAAK2U,GAAK3U,KAAK2D,EAAI3D,KAAK0U,EACxB1U,KAAK4U,GAAK5U,KAAK4D,EAAI5D,KAAKsL,EACxBtL,KAAKiR,GAAKjR,KAAK2D,EAAI3D,KAAK0U,EAAI,EAC5B1U,KAAKkR,GAAKlR,KAAK4D,EAAI5D,KAAKsL,EAAI,EACrBtL,KAGT,WACE,OAAOoU,GAAYpU,MAIrB,MAAMmD,GACJ,MAAMQ,EAAIrB,KAAKiG,IAAIvI,KAAK2D,EAAGR,EAAIQ,GACzBC,EAAItB,KAAKiG,IAAIvI,KAAK4D,EAAGT,EAAIS,GACzBX,EAAQX,KAAKgG,IAAItI,KAAK2D,EAAI3D,KAAKiD,MAAOE,EAAIQ,EAAIR,EAAIF,OAASU,EAC3DT,EAASZ,KAAKgG,IAAItI,KAAK4D,EAAI5D,KAAKkD,OAAQC,EAAIS,EAAIT,EAAID,QAAUU,EACpE,OAAO,IAAIyQ,GAAI1Q,EAAGC,EAAGX,EAAOC,GAG9B,UACE,MAAO,CAAClD,KAAK2D,EAAG3D,KAAK4D,EAAG5D,KAAKiD,MAAOjD,KAAKkD,QAG3C,WACE,OAAOlD,KAAK2D,EAAI,IAAM3D,KAAK4D,EAAI,IAAM5D,KAAKiD,MAAQ,IAAMjD,KAAKkD,OAG/D,UAAU/H,GACFA,aAAa0T,KACjB1T,EAAI,IAAI0T,GAAO1T,IAGjB,IAAI0Z,EAAOC,IACPC,GAAQD,IACRE,EAAOF,IACPG,GAAQH,IASZ,MARY,CAAC,IAAI,GAAM9U,KAAK2D,EAAG3D,KAAK4D,GAAI,IAAI,GAAM5D,KAAK2U,GAAI3U,KAAK4D,GAAI,IAAI,GAAM5D,KAAK2D,EAAG3D,KAAK4U,IAAK,IAAI,GAAM5U,KAAK2U,GAAI3U,KAAK4U,KACpHhL,SAAQ,SAAU/M,GACpBA,EAAIA,EAAE4V,UAAUtX,GAChB0Z,EAAOvS,KAAKiG,IAAIsM,EAAMhY,EAAE8G,GACxBoR,EAAOzS,KAAKgG,IAAIyM,EAAMlY,EAAE8G,GACxBqR,EAAO1S,KAAKiG,IAAIyM,EAAMnY,EAAE+G,GACxBqR,EAAO3S,KAAKgG,IAAI2M,EAAMpY,EAAE+G,MAEnB,IAAIyQ,GAAIQ,EAAMG,EAAMD,EAAOF,EAAMI,EAAOD,IAKnD,SAASE,GAAOvL,EAAIwL,EAAWC,GAC7B,IAAIjS,EAEJ,IAKE,GAHAA,EAAMgS,EAAUxL,EAAG5K,MAGfqV,GAAYjR,MAxFCpE,EAwFoB4K,EAAG5K,QAvF1BsF,EAAQE,YAAaF,EAAQE,SAAS2P,gBAAgBmB,UAAY,SAAUtW,GAE1F,KAAOA,EAAKiV,YACVjV,EAAOA,EAAKiV,WAGd,OAAOjV,IAASsF,EAAQE,WACvBrJ,KAAKmJ,EAAQE,SAAS2P,gBAAiBnV,IAiFtC,MAAM,IAAIf,MAAM,0BAElB,MAAOyC,GAEP0C,EAAMiS,EAAMzL,GA7FhB,IAAqB5K,EAgGnB,OAAOoE,EAkDTzB,EAAgB,CACd4T,QAAS,CACP,QAAQ3R,EAAGC,EAAGX,EAAOC,GAEnB,OAAS,MAALS,EAAkB,IAAI0Q,GAAIrU,KAAKoG,KAAK,YAEjCpG,KAAKoG,KAAK,UAAW,IAAIiO,GAAI1Q,EAAGC,EAAGX,EAAOC,KAGnD,KAAKqS,EAAOC,GAQV,IAAI,MACFvS,EAAK,OACLC,GACElD,KAAKoG,KAAK,CAAC,QAAS,WASxB,IANKnD,GAAUC,IAA2B,iBAAVD,GAAwC,iBAAXC,IAC3DD,EAAQjD,KAAKjB,KAAK0W,YAClBvS,EAASlD,KAAKjB,KAAK2W,eAIhBzS,IAAUC,EACb,MAAM,IAAIlF,MAAM,6HAGlB,MAAMoM,EAAIpK,KAAKsV,UACTK,EAAQ1S,EAAQmH,EAAEnH,MAClB2S,EAAQ1S,EAASkH,EAAElH,OACnB2S,EAAOvT,KAAKiG,IAAIoN,EAAOC,GAE7B,GAAa,MAATL,EACF,OAAOM,EAGT,IAAIC,EAAaD,EAAON,EAGpBO,IAAehB,MAAUgB,EAAaC,OAAOC,iBAAmB,KACpER,EAAQA,GAAS,IAAI,GAAMvS,EAAQ,EAAI0S,EAAQvL,EAAEzG,EAAGT,EAAS,EAAI0S,EAAQxL,EAAExG,GAC3E,MAAMT,EAAM,IAAIkR,GAAIjK,GAAGqI,UAAU,IAAI5D,GAAO,CAC1Ce,MAAOkG,EACPxS,OAAQkS,KAEV,OAAOxV,KAAKsV,QAAQnS,OAK1BwC,EAAS0O,GAAK,OAEd,MAAM4B,WAAatW,MACjB,YAAYuW,EAAM,MAAO/P,GAEvB,GADAgQ,MAAMD,KAAQ/P,GACK,iBAAR+P,EAAkB,OAAOlW,KACpCA,KAAKK,OAAS,EACdL,KAAKa,QAAQqV,IAIjBnQ,EAAO,CAACkQ,IAAO,CACb,KAAKG,KAAmBjQ,GACtB,MAA8B,mBAAnBiQ,EACFpW,KAAK2L,IAAI,CAAChC,EAAI5O,EAAGmb,IACfE,EAAelb,KAAKyO,EAAIA,EAAI5O,EAAGmb,IAGjClW,KAAK2L,IAAIhC,GACPA,EAAGyM,MAAmBjQ,KAKnC,UACE,OAAOxG,MAAMhD,UAAUyE,OAAOd,MAAM,GAAIN,SAI5C,MAAMqW,GAAW,CAAC,UAAW,cAAe,QAkB5C,SAASC,GAASC,EAAOjQ,GACvB,OAAO,IAAI2P,GAAK,GAAK3P,GAAUjC,EAAQE,UAAUiS,iBAAiBD,IAAQ,SAAUxX,GAClF,OAAOuG,EAAMvG,OAlBjBkX,GAAKlQ,OAAS,SAAUC,GACtBA,EAAUA,EAAQyQ,OAAO,CAACC,EAAKpb,KAEzB+a,GAAStS,SAASzI,IAEN,MAAZA,EAAK,KAETob,EAAIpb,GAAQ,YAAaqb,GACvB,OAAO3W,KAAK4W,KAAKtb,KAASqb,KALQD,GASnC,IACH3Q,EAAO,CAACkQ,IAAOjQ,IAgBjB,IAAI6Q,GAAa,EACjB,MAAMC,GAAe,GACrB,SAASC,GAAUxR,GACjB,IAAI/I,EAAI+I,EAASyR,iBAIjB,OAFIxa,IAAM6H,EAAQC,SAAQ9H,EAAIsa,IACzBta,EAAEya,SAAQza,EAAEya,OAAS,IACnBza,EAAEya,OAEX,SAASC,GAAe3R,GACtB,OAAOA,EAAS2R,iBAQlB,SAASC,GAAGpY,EAAMkY,EAAQG,EAAUC,EAASC,GAC3C,MAAMtc,EAAIoc,EAAS7a,KAAK8a,GAAWtY,GAC7BwG,EAAWZ,EAAa5F,GACxBwY,EAAMR,GAAUxR,GAChB/I,EAAI0a,GAAe3R,GAEzB0R,EAAStX,MAAMgC,QAAQsV,GAAUA,EAASA,EAAOlO,MAAMf,IAElDoP,EAASI,mBACZJ,EAASI,mBAAqBX,IAGhCI,EAAOrN,SAAQ,SAAU6N,GACvB,MAAMC,EAAKD,EAAM1O,MAAM,KAAK,GACtB3M,EAAKqb,EAAM1O,MAAM,KAAK,IAAM,IAElCwO,EAAIG,GAAMH,EAAIG,IAAO,GACrBH,EAAIG,GAAItb,GAAMmb,EAAIG,GAAItb,IAAO,GAE7Bmb,EAAIG,GAAItb,GAAIgb,EAASI,kBAAoBxc,EAEzCwB,EAAEmb,iBAAiBD,EAAI1c,EAAGsc,IAAW,MAIzC,SAASM,GAAI7Y,EAAMkY,EAAQG,EAAUE,GACnC,MAAM/R,EAAWZ,EAAa5F,GACxBwY,EAAMR,GAAUxR,GAChB/I,EAAI0a,GAAe3R,IAED,mBAAb6R,IACTA,EAAWA,EAASI,qBAKtBP,EAAStX,MAAMgC,QAAQsV,GAAUA,GAAUA,GAAU,IAAIlO,MAAMf,KACxD4B,SAAQ,SAAU6N,GACvB,MAAMC,EAAKD,GAASA,EAAM1O,MAAM,KAAK,GAC/B3M,EAAKqb,GAASA,EAAM1O,MAAM,KAAK,GACrC,IAAI8O,EAAW7c,EAEf,GAAIoc,EAEEG,EAAIG,IAAOH,EAAIG,GAAItb,GAAM,OAE3BI,EAAEsb,oBAAoBJ,EAAIH,EAAIG,GAAItb,GAAM,KAAKgb,GAAWE,IAAW,UAC5DC,EAAIG,GAAItb,GAAM,KAAKgb,SAEvB,GAAIM,GAAMtb,GAEf,GAAImb,EAAIG,IAAOH,EAAIG,GAAItb,GAAK,CAC1B,IAAKpB,KAAKuc,EAAIG,GAAItb,GAChBwb,GAAIpb,EAAG,CAACkb,EAAItb,GAAI+M,KAAK,KAAMnO,UAGtBuc,EAAIG,GAAItb,SAEZ,GAAIA,EAET,IAAKqb,KAASF,EACZ,IAAKM,KAAaN,EAAIE,GAChBrb,IAAOyb,GACTD,GAAIpb,EAAG,CAACib,EAAOrb,GAAI+M,KAAK,WAIzB,GAAIuO,GAET,GAAIH,EAAIG,GAAK,CACX,IAAKG,KAAaN,EAAIG,GACpBE,GAAIpb,EAAG,CAACkb,EAAIG,GAAW1O,KAAK,aAGvBoO,EAAIG,QAER,CAEL,IAAKD,KAASF,EACZK,GAAIpb,EAAGib,IArFf,SAAqBlS,GACnB,IAAI/I,EAAI+I,EAASyR,iBACbxa,IAAM6H,EAAQC,SAAQ9H,EAAIsa,IAC1Bta,EAAEya,SAAQza,EAAEya,OAAS,IAqFrBc,CAAYxS,OAqBlB,MAAMyS,WAAoBxT,EACxB,oBAEA,SAASiT,EAAOvN,EAAMoN,GACpB,OArBJ,SAAkBvY,EAAM0Y,EAAOvN,EAAMoN,GACnC,MAAM9a,EAAI0a,GAAenY,GAazB,OAXI0Y,aAAiBpT,EAAQC,OAAO2T,QAGlCR,EAAQ,IAAIpT,EAAQC,OAAO4T,YAAYT,EAAO,CAC5CU,OAAQjO,EACRkO,YAAY,KACTd,KALL9a,EAAE6b,cAAcZ,GAUXA,EAOEa,CAAStY,KAAMyX,EAAOvN,EAAMoN,GAGrC,cAAcG,GACZ,MAAMF,EAAMvX,KAAKgX,iBAAiBC,OAClC,IAAKM,EAAK,OAAO,EACjB,MAAMN,EAASM,EAAIE,EAAMc,MAEzB,IAAK,MAAMxd,KAAKkc,EACd,IAAK,MAAMuB,KAAKvB,EAAOlc,GACrBkc,EAAOlc,GAAGyd,GAAGf,GAIjB,OAAQA,EAAMgB,iBAIhB,KAAKhB,EAAOvN,EAAMoN,GAEhB,OADAtX,KAAKsY,SAASb,EAAOvN,EAAMoN,GACpBtX,KAGT,iBACE,OAAOA,KAGT,iBACE,OAAOA,KAIT,IAAIyX,EAAOL,GAET,OADAQ,GAAI5X,KAAMyX,EAAOL,GACVpX,KAIT,GAAGyX,EAAOL,EAAUC,EAASC,GAE3B,OADAH,GAAGnX,KAAMyX,EAAOL,EAAUC,EAASC,GAC5BtX,KAGT,wBAKF,SAAS0Y,MAFT/S,EAASqS,GAAa,eAItB,MAAMW,GAAW,CACfC,SAAU,IACVC,KAAM,IACNC,MAAO,GAGHnC,GAAQ,CAEZ,eAAgB,EAChB,iBAAkB,EAClB,eAAgB,EAChB,kBAAmB,QACnB,iBAAkB,OAClBoC,KAAM,UACNC,OAAQ,UACRC,QAAS,EAETtV,EAAG,EACHC,EAAG,EACHqN,GAAI,EACJC,GAAI,EAEJjO,MAAO,EACPC,OAAQ,EAERrH,EAAG,EACHgV,GAAI,EACJE,GAAI,EAEJmI,OAAQ,EACR,eAAgB,EAChB,aAAc,UAEd,cAAe,SAUjB,MAAMC,WAAiBxZ,MACrB,eAAewG,GACbgQ,SAAShQ,GACTnG,KAAKgL,QAAQ7E,GAGf,QACE,OAAO,IAAInG,KAAKC,YAAYD,MAG9B,KAAKkW,GAEH,MAAmB,iBAARA,IACXlW,KAAKK,OAAS,EACdL,KAAKa,QAAQb,KAAKuK,MAAM2L,KAFYlW,KAOtC,MAAM5B,EAAQ,IAEZ,OAAIA,aAAiBuB,MAAcvB,EAC5BA,EAAM0K,OAAOC,MAAMf,IAAW2D,IAAI6G,YAG3C,UACE,OAAO7S,MAAMhD,UAAUyE,OAAOd,MAAM,GAAIN,MAG1C,QACE,OAAO,IAAIoZ,IAAIpZ,MAGjB,WACE,OAAOA,KAAKmJ,KAAK,KAInB,UACE,MAAMM,EAAM,GAEZ,OADAA,EAAI5I,QAAQb,MACLyJ,GAKX,MAAM4P,GAEJ,eAAelT,GACbnG,KAAKgL,QAAQ7E,GAGf,QAAQmT,GACN,OAAO,IAAID,GAAUrZ,KAAKhE,MAAOsd,GAInC,OAAO/a,GAEL,OADAA,EAAS,IAAI8a,GAAU9a,GAChB,IAAI8a,GAAUrZ,KAAOzB,EAAQyB,KAAKsZ,MAAQ/a,EAAO+a,MAG1D,KAAKtd,EAAOsd,GAiCV,OAhCAA,EAAO3Z,MAAMgC,QAAQ3F,GAASA,EAAM,GAAKsd,EACzCtd,EAAQ2D,MAAMgC,QAAQ3F,GAASA,EAAM,GAAKA,EAE1CgE,KAAKhE,MAAQ,EACbgE,KAAKsZ,KAAOA,GAAQ,GAEC,iBAAVtd,EAETgE,KAAKhE,MAAQud,MAAMvd,GAAS,EAAKyT,SAASzT,GAA2CA,EAAlCA,EAAQ,GAAK,MAAU,MAChD,iBAAVA,GAChBsd,EAAOtd,EAAMwd,MAAMnS,MAIjBrH,KAAKhE,MAAQwW,WAAW8G,EAAK,IAEb,MAAZA,EAAK,GACPtZ,KAAKhE,OAAS,IACO,MAAZsd,EAAK,KACdtZ,KAAKhE,OAAS,KAIhBgE,KAAKsZ,KAAOA,EAAK,IAGftd,aAAiBqd,KACnBrZ,KAAKhE,MAAQA,EAAMyd,UACnBzZ,KAAKsZ,KAAOtd,EAAMsd,MAIftZ,KAIT,MAAMzB,GAEJ,OADAA,EAAS,IAAI8a,GAAU9a,GAChB,IAAI8a,GAAUrZ,KAAOzB,EAAQyB,KAAKsZ,MAAQ/a,EAAO+a,MAI1D,KAAK/a,GAEH,OADAA,EAAS,IAAI8a,GAAU9a,GAChB,IAAI8a,GAAUrZ,KAAOzB,EAAQyB,KAAKsZ,MAAQ/a,EAAO+a,MAI1D,MAAM/a,GAEJ,OADAA,EAAS,IAAI8a,GAAU9a,GAChB,IAAI8a,GAAUrZ,KAAOzB,EAAQyB,KAAKsZ,MAAQ/a,EAAO+a,MAG1D,UACE,MAAO,CAACtZ,KAAKhE,MAAOgE,KAAKsZ,MAG3B,SACE,OAAOtZ,KAAKwI,WAGd,WACE,OAAsB,MAAdxI,KAAKsZ,QAA+B,IAAbtZ,KAAKhE,OAAe,IAAoB,MAAdgE,KAAKsZ,KAAetZ,KAAKhE,MAAQ,IAAMgE,KAAKhE,OAASgE,KAAKsZ,KAGrH,UACE,OAAOtZ,KAAKhE,OAKhB,MAAM0d,GAAQ,GAqEd,MAAMC,WAAY3B,GAChB,YAAYjZ,EAAM4X,GAChBR,QACAnW,KAAKjB,KAAOA,EACZiB,KAAKuY,KAAOxZ,EAAKyG,SAEbmR,GAAS5X,IAAS4X,GACpB3W,KAAKoG,KAAKuQ,GAKd,IAAI/X,EAAS7D,GAaX,OAZA6D,EAAU+F,EAAa/F,IAEXgb,iBAAmB5Z,KAAKjB,gBAAgBsF,EAAQC,OAAOuV,YACjEjb,EAAQgb,kBAGD,MAAL7e,EACFiF,KAAKjB,KAAK+a,YAAYlb,EAAQG,MACrBH,EAAQG,OAASiB,KAAKjB,KAAKgb,WAAWhf,IAC/CiF,KAAKjB,KAAKoI,aAAavI,EAAQG,KAAMiB,KAAKjB,KAAKgb,WAAWhf,IAGrDiF,KAIT,MAAMsG,EAAQvL,GACZ,OAAO4J,EAAa2B,GAAQ0T,IAAIha,KAAMjF,GAIxC,WACE,OAAO,IAAIkb,GAAK,EAAIjW,KAAKjB,KAAKwH,UAAU,SAAUxH,GAChD,OAAOuG,EAAMvG,OAKjB,QAEE,KAAOiB,KAAKjB,KAAKkb,iBACfja,KAAKjB,KAAKoG,YAAYnF,KAAKjB,KAAKmb,WAGlC,OAAOla,KAIT,MAAMma,GAAO,GAIX,OAFAna,KAAKoa,iBAEE,IAAIpa,KAAKC,YA3lEpB,SAASoa,EAAYtb,GAEnB,IAAK,IAAIhE,EAAIgE,EAAKwH,SAASlG,OAAS,EAAGtF,GAAK,EAAGA,IAC7Csf,EAAYtb,EAAKwH,SAASxL,IAG5B,OAAIgE,EAAKub,IACPvb,EAAKub,GAAKxU,EAAI/G,EAAKyG,UACZzG,GAGFA,EAglEuBsb,CAAYra,KAAKjB,KAAKwb,UAAUJ,KAI9D,KAAKlY,EAAOkY,GACV,MAAM5T,EAAWvG,KAAKuG,WACtB,IAAIxL,EAAGmH,EAEP,IAAKnH,EAAI,EAAGmH,EAAKqE,EAASlG,OAAQtF,EAAImH,EAAInH,IACxCkH,EAAM3B,MAAMiG,EAASxL,GAAI,CAACA,EAAGwL,IAEzB4T,GACF5T,EAASxL,GAAG6b,KAAK3U,EAAOkY,GAI5B,OAAOna,KAGT,QAAQwF,EAAUmR,GAChB,OAAO3W,KAAKga,IAAI,IAAIL,GAAItd,EAAOmJ,GAAWmR,IAI5C,QACE,OAAOrR,EAAMtF,KAAKjB,KAAKmG,YAIzB,IAAInK,GACF,OAAOuK,EAAMtF,KAAKjB,KAAKgb,WAAWhf,IAGpC,iBACE,OAAOiF,KAAKjB,KAGd,iBACE,OAAOiB,KAAKjB,KAId,IAAIH,GACF,OAAOoB,KAAKyG,MAAM7H,IAAY,EAGhC,KAAK4b,EAAUC,GACb,OAAOza,KAAK0a,IAAIF,EAAUC,EAAWxW,GAIvC,GAAGqW,GAOD,YALkB,IAAPA,GAAuBta,KAAKjB,KAAKub,KAC1Cta,KAAKjB,KAAKub,GAAKxU,EAAI9F,KAAKuY,OAInBvY,KAAKoG,KAAK,KAAMkU,GAIzB,MAAM1b,GACJ,MAAO,GAAGuC,MAAMjG,KAAK8E,KAAKjB,KAAKgb,YAAY9Q,QAAQrK,EAAQG,MAI7D,OACE,OAAOuG,EAAMtF,KAAKjB,KAAKmb,WAIzB,QAAQS,GACN,MAAMhR,EAAK3J,KAAKjB,KACV6b,EAAUjR,EAAGkR,SAAWlR,EAAGmR,iBAAmBnR,EAAGoR,mBAAqBpR,EAAGqR,oBAAsBrR,EAAGsR,uBAAyBtR,EAAGuR,kBAAoB,KACxJ,OAAON,GAAWA,EAAQ1f,KAAKyO,EAAIgR,GAIrC,OAAOpC,GACL,IAAIjS,EAAStG,KAEb,IAAKsG,EAAOvH,KAAKiV,WAAY,OAAO,KAGpC,GADA1N,EAAShB,EAAMgB,EAAOvH,KAAKiV,aACtBuE,EAAM,OAAOjS,EAElB,GACE,GAAoB,iBAATiS,EAAoBjS,EAAOuU,QAAQtC,GAAQjS,aAAkBiS,EAAM,OAAOjS,QAC9EA,EAAShB,EAAMgB,EAAOvH,KAAKiV,aAEpC,OAAO1N,EAIT,IAAI1H,EAAS7D,GAGX,OAFA6D,EAAU+F,EAAa/F,GACvBoB,KAAK4G,IAAIhI,EAAS7D,GACX6D,EAIT,MAAM0H,EAAQvL,GACZ,OAAO4J,EAAa2B,GAAQM,IAAI5G,KAAMjF,GAIxC,SAKE,OAJIiF,KAAKsG,UACPtG,KAAKsG,SAAS6U,cAAcnb,MAGvBA,KAIT,cAAcpB,GAEZ,OADAoB,KAAKjB,KAAKoG,YAAYvG,EAAQG,MACvBiB,KAIT,QAAQpB,GAON,OANAA,EAAU+F,EAAa/F,GAEnBoB,KAAKjB,KAAKiV,YACZhU,KAAKjB,KAAKiV,WAAWoH,aAAaxc,EAAQG,KAAMiB,KAAKjB,MAGhDH,EAGT,MAAMyc,EAAY,EAAG1P,EAAM,MACzB,MAAM2P,EAAS,IAAMD,EACf1E,EAAQ3W,KAAKoG,KAAKuF,GAExB,IAAK,MAAM5Q,KAAK4b,EACU,iBAAbA,EAAM5b,KACf4b,EAAM5b,GAAKuH,KAAK+F,MAAMsO,EAAM5b,GAAKugB,GAAUA,GAK/C,OADAtb,KAAKoG,KAAKuQ,GACH3W,KAIT,IAAIub,EAASC,GACX,OAAOxb,KAAK0a,IAAIa,EAASC,EAAUxX,GAIrC,WACE,OAAOhE,KAAKsa,KAGd,MAAMmB,GAGJ,OADAzb,KAAKjB,KAAK2c,YAAcD,EACjBzb,KAGT,KAAKjB,GACH,MAAMuH,EAAStG,KAAKsG,SAEpB,IAAKA,EACH,OAAOtG,KAAKmU,MAAMpV,GAGpB,MAAMyH,EAAWF,EAAOG,MAAMzG,MAC9B,OAAOsG,EAAO0T,IAAIjb,EAAMyH,GAAUwT,IAAIha,MAIxC,iBAKE,OAHAA,KAAK4W,MAAK,WACR5W,KAAKoa,oBAEApa,KAIT,IAAI2b,EAASC,EAAUxf,GAQrB,GAPuB,kBAAZuf,IACTvf,EAAKwf,EACLA,EAAWD,EACXA,EAAU,MAIG,MAAXA,GAAsC,mBAAZA,EAAwB,CAEpDC,EAAuB,MAAZA,GAA0BA,EAErC5b,KAAKoa,iBACL,IAAIyB,EAAU7b,KAEd,GAAe,MAAX2b,EAAiB,CAGnB,GAFAE,EAAUvW,EAAMuW,EAAQ9c,KAAKwb,WAAU,IAEnCqB,EAAU,CACZ,MAAMzZ,EAASwZ,EAAQE,GAGvB,GAFAA,EAAU1Z,GAAU0Z,GAEL,IAAX1Z,EAAkB,MAAO,GAI/B0Z,EAAQjF,MAAK,WACX,MAAMzU,EAASwZ,EAAQ3b,MAEjB8b,EAAQ3Z,GAAUnC,MAGT,IAAXmC,EACFnC,KAAK6G,SACI1E,GAAUnC,OAAS8b,GAC5B9b,KAAK0C,QAAQoZ,MAEd,GAIL,OAAOF,EAAWC,EAAQ9c,KAAK0b,UAAYoB,EAAQ9c,KAAKkG,UAK1D2W,EAAuB,MAAZA,GAA2BA,EAEtC,MAAMG,EAAO1f,EAAO,UAAWD,GACzB4f,EAAW3X,EAAQE,SAAS0X,yBAElCF,EAAK9W,UAAY0W,EAEjB,IAAK,IAAIO,EAAMH,EAAKxV,SAASlG,OAAQ6b,KACnCF,EAASlC,YAAYiC,EAAKI,mBAG5B,MAAM7V,EAAStG,KAAKsG,SAEpB,OAAOsV,EAAW5b,KAAK0C,QAAQsZ,IAAa1V,EAAStG,KAAK4G,IAAIoV,IAIlEjW,EAAO4T,GAAK,CACVvT,KA9WF,SAAcA,EAAMoD,EAAKpN,GAEvB,GAAY,MAARgK,EAAc,CAEhBA,EAAO,GACPoD,EAAMxJ,KAAKjB,KAAKsL,WAEhB,IAAK,MAAMtL,KAAQyK,EACjBpD,EAAKrH,EAAKyG,UAAYsC,EAASgC,KAAK/K,EAAKqd,WAAa5J,WAAWzT,EAAKqd,WAAard,EAAKqd,UAG1F,OAAOhW,EACF,GAAIA,aAAgBzG,MAEzB,OAAOyG,EAAKqQ,OAAO,CAAC4F,EAAMC,KACxBD,EAAKC,GAAQtc,KAAKoG,KAAKkW,GAChBD,GACN,IACE,GAAoB,iBAATjW,GAAqBA,EAAKnG,cAAgBxE,OAE1D,IAAK+N,KAAOpD,EAAMpG,KAAKoG,KAAKoD,EAAKpD,EAAKoD,SACjC,GAAY,OAARA,EAETxJ,KAAKjB,KAAKwd,gBAAgBnW,OACrB,IAAW,MAAPoD,EAGT,OAAc,OADdA,EAAMxJ,KAAKjB,KAAKyd,aAAapW,IACRuQ,GAAMvQ,GAAQ0B,EAASgC,KAAKN,GAAOgJ,WAAWhJ,GAAOA,EAOvD,iBAJnBA,EAAMkQ,GAAMjD,OAAO,CAACgG,EAAMC,IACjBA,EAAKtW,EAAMqW,EAAMzc,MACvBwJ,IAGDA,EAAM,IAAI6P,GAAU7P,GACXsB,GAAM6R,QAAQnT,GAEvBA,EAAM,IAAIsB,GAAMtB,GACPA,EAAIvJ,cAAgBN,QAE7B6J,EAAM,IAAI2P,GAAS3P,IAIR,YAATpD,EAEEpG,KAAK4c,SACP5c,KAAK4c,QAAQpT,GAID,iBAAPpN,EAAkB4D,KAAKjB,KAAK8d,eAAezgB,EAAIgK,EAAMoD,EAAIhB,YAAcxI,KAAKjB,KAAK+d,aAAa1W,EAAMoD,EAAIhB,aAI7GxI,KAAK+c,SAAqB,cAAT3W,GAAiC,MAATA,GAC3CpG,KAAK+c,UAIT,OAAO/c,MAkTPgd,KA3tBF,SAAczG,GACZ,OAAOD,GAASC,EAAOvW,KAAKjB,OA2tB5Bke,QAztBF,SAAiB1G,GACf,OAAOjR,EAAMtF,KAAKjB,KAAK+F,cAAcyR,OA0tBvC5Q,EAASgU,GAAK,OAEd,MAAMrH,WAAgBqH,GACpB,YAAY5a,EAAM4X,GAChBR,MAAMpX,EAAM4X,GAEZ3W,KAAKkd,IAAM,GAEXld,KAAKjB,KAAKwG,SAAWvF,KAEjBjB,EAAKoe,aAAa,eAEpBnd,KAAKod,QAAQ9S,KAAKC,MAAMxL,EAAKyd,aAAa,gBAAkB,IAKhE,OAAO7Y,EAAGC,GACR,OAAO5D,KAAKiR,GAAGtN,GAAGuN,GAAGtN,GAIvB,GAAGD,GACD,OAAY,MAALA,EAAY3D,KAAK2D,IAAM3D,KAAKiD,QAAU,EAAIjD,KAAK2D,EAAEA,EAAI3D,KAAKiD,QAAU,GAI7E,GAAGW,GACD,OAAY,MAALA,EAAY5D,KAAK4D,IAAM5D,KAAKkD,SAAW,EAAIlD,KAAK4D,EAAEA,EAAI5D,KAAKkD,SAAW,GAI/E,OACE,MAAMuB,EAAOzE,KAAKyE,OAClB,OAAOA,GAAQA,EAAK4Y,OAItB,MAAM1Z,EAAGC,GACP,OAAO5D,KAAKqR,GAAG1N,GAAG2N,GAAG1N,GAIvB,GAAGD,EAAI,GACL,OAAO3D,KAAK2D,EAAE,IAAI0V,GAAU1V,GAAG2Z,KAAKtd,KAAK2D,MAI3C,GAAGC,EAAI,GACL,OAAO5D,KAAK4D,EAAE,IAAIyV,GAAUzV,GAAG0Z,KAAKtd,KAAK4D,MAG3C,iBACE,OAAO5D,KAIT,OAAOkD,GACL,OAAOlD,KAAKoG,KAAK,SAAUlD,GAI7B,KAAKS,EAAGC,GACN,OAAO5D,KAAK2D,EAAEA,GAAGC,EAAEA,GAIrB,QAAQ2Z,EAAQvd,KAAKyE,QACnB8Y,EAAQ5Y,EAAa4Y,GACrB,MAAMC,EAAU,IAAIvH,GACpB,IAAI3P,EAAStG,KAEb,MAAQsG,EAASA,EAAOA,WAAaA,EAAOvH,OAASsF,EAAQE,UAAgC,uBAApB+B,EAAOd,WAC9EgY,EAAQ3c,KAAKyF,GAETA,EAAOvH,OAASwe,EAAMxe,QAK5B,OAAOye,EAIT,UAAUpX,GAER,KADAA,EAAOpG,KAAKoG,KAAKA,IACN,OAAO,KAClB,MAAMjL,GAAKiL,EAAO,IAAIoT,MAAMhS,GAC5B,OAAOrM,EAAIwJ,EAAaxJ,EAAE,IAAM,KAIlC,OACE,MAAM0B,EAAImD,KAAKsG,OA57EV,EA47E0B7B,IAC/B,OAAO5H,GAAKA,EAAE4H,OAIhB,QAAQjJ,GAEN,OADAwE,KAAKkd,IAAM1hB,EACJwE,KAIT,KAAKiD,EAAOC,GACV,MAAMrG,EAAImG,EAAiBhD,KAAMiD,EAAOC,GACxC,OAAOlD,KAAKiD,MAAM,IAAIoW,GAAUxc,EAAEoG,QAAQC,OAAO,IAAImW,GAAUxc,EAAEqG,SAInE,MAAMD,GACJ,OAAOjD,KAAKoG,KAAK,QAASnD,GAI5B,iBAQE,OANAjD,KAAKjB,KAAKwd,gBAAgB,cAEtB9gB,OAAOgiB,KAAKzd,KAAKkd,KAAK7c,QACxBL,KAAKjB,KAAK+d,aAAa,aAAcxS,KAAKE,UAAUxK,KAAKkd,MAGpD/G,MAAMiE,iBAIf,EAAEzW,GACA,OAAO3D,KAAKoG,KAAK,IAAKzC,GAIxB,EAAEC,GACA,OAAO5D,KAAKoG,KAAK,IAAKxC,IAI1BmC,EAAOuM,GAAS,CACdlP,KApgCF,WAEE,MAgBMD,EAAM+R,GAAOlV,KAhBHjB,GAAQA,EAAK2e,UAIf/T,IACZ,IACE,MAAMgF,EAAQhF,EAAGgF,QAAQwF,MAAMP,KAAS5P,KAAK+F,OACvC5G,EAAMwL,EAAM5P,KAAK2e,UAEvB,OADA/O,EAAM9H,SACC1D,EACP,MAAO1C,GAEP,MAAM,IAAIzC,MAAM,4BAA4B2L,EAAG5K,KAAKyG,8BAA8B/E,EAAE+H,iBAMxF,OADa,IAAI6L,GAAIlR,IAk/BrBwa,KA/+BF,SAAchU,GACZ,MAQMxG,EAAM+R,GAAOlV,KARHjB,GAAQA,EAAK6e,wBAEfjU,IAGZ,MAAM,IAAI3L,MAAM,4BAA4B2L,EAAG5K,KAAKyG,+BAIhDmY,EAAO,IAAItJ,GAAIlR,GAErB,OAAIwG,EACKgU,EAAKlL,UAAU9I,EAAGkU,YAAYnL,YAKhCiL,EAAKG,aA89BZC,OA39BF,SAAgBpa,EAAGC,GACjB,MAAMT,EAAMnD,KAAKoD,OACjB,OAAOO,EAAIR,EAAIQ,GAAKC,EAAIT,EAAIS,GAAKD,EAAIR,EAAIQ,EAAIR,EAAIF,OAASW,EAAIT,EAAIS,EAAIT,EAAID,QA09B1EsS,MAhkDF,SAAe7R,EAAGC,GAChB,OAAO,IAAI,GAAMD,EAAGC,GAAG6O,UAAUzS,KAAK6d,YAAYG,YAgkDlDC,IAvpCF,WACE,OAAO,IAAIpP,GAAO7O,KAAKjB,KAAKmf,WAupC5BL,UArpCF,WAKE,GAA2B,mBAAhB7d,KAAKme,SAA0Bne,KAAKme,SAAU,CACvD,MAAMC,EAAOpe,KAAKoe,KAAK,EAAG,GACpBjjB,EAAIijB,EAAKrf,KAAKsf,eAEpB,OADAD,EAAKvX,SACE,IAAIgI,GAAO1T,GAGpB,OAAO,IAAI0T,GAAO7O,KAAKjB,KAAKsf,mBA2oC9B1Y,EAAS2M,GAAS,WAElB,MAAMgM,GAAQ,CACZtF,OAAQ,CAAC,QAAS,QAAS,UAAW,UAAW,WAAY,aAAc,YAAa,cACxFD,KAAM,CAAC,QAAS,UAAW,QAC3BwF,OAAQ,SAAUtiB,EAAGkO,GACnB,MAAa,UAANA,EAAgBlO,EAAIA,EAAI,IAAMkO,IAIzC,CAAC,OAAQ,UAAUP,SAAQ,SAAUzO,GACnC,MAAMqjB,EAAY,GAClB,IAAIzjB,EAEJyjB,EAAUrjB,GAAK,SAAUK,GACvB,QAAiB,IAANA,EACT,OAAOwE,KAAKoG,KAAKjL,GAGnB,GAAiB,iBAANK,GAAkBA,aAAasP,IAASA,GAAMlD,MAAMpM,IAAMA,aAAa8W,GAChFtS,KAAKoG,KAAKjL,EAAGK,QAGb,IAAKT,EAAIujB,GAAMnjB,GAAGkF,OAAS,EAAGtF,GAAK,EAAGA,IACd,MAAlBS,EAAE8iB,GAAMnjB,GAAGJ,KACbiF,KAAKoG,KAAKkY,GAAMC,OAAOpjB,EAAGmjB,GAAMnjB,GAAGJ,IAAKS,EAAE8iB,GAAMnjB,GAAGJ,KAKzD,OAAOiF,MAGT0B,EAAgB,CAAC,UAAW,UAAW8c,MAEzC9c,EAAgB,CAAC,UAAW,UAAW,CAErCyP,OAAQ,SAAUsN,EAAKjf,EAAGpE,EAAGC,EAAGoF,EAAGsO,GAEjC,OAAW,MAAP0P,EACK,IAAI5P,GAAO7O,MAIbA,KAAKoG,KAAK,YAAa,IAAIyI,GAAO4P,EAAKjf,EAAGpE,EAAGC,EAAGoF,EAAGsO,KAG5DiB,OAAQ,SAAU0O,EAAOzN,EAAIC,GAC3B,OAAOlR,KAAKyS,UAAU,CACpBzC,OAAQ0O,EACRnb,GAAI0N,EACJxN,GAAIyN,IACH,IAGL1B,KAAM,SAAU7L,EAAGC,EAAGqN,EAAIC,GACxB,OAA4B,IAArB9Q,UAAUC,QAAqC,IAArBD,UAAUC,OAAeL,KAAKyS,UAAU,CACvEjD,KAAM7L,EACNJ,GAAIK,EACJH,GAAIwN,IACH,GAAQjR,KAAKyS,UAAU,CACxBjD,KAAM,CAAC7L,EAAGC,GACVL,GAAI0N,EACJxN,GAAIyN,IACH,IAELpB,MAAO,SAAUgC,EAAKb,EAAIC,GACxB,OAAOlR,KAAKyS,UAAU,CACpB3C,MAAOgC,EACPvO,GAAI0N,EACJxN,GAAIyN,IACH,IAGLtB,MAAO,SAAUjM,EAAGC,EAAGqN,EAAIC,GACzB,OAA4B,IAArB9Q,UAAUC,QAAqC,IAArBD,UAAUC,OAAeL,KAAKyS,UAAU,CACvE7C,MAAOjM,EACPJ,GAAIK,EACJH,GAAIwN,IACH,GAAQjR,KAAKyS,UAAU,CACxB7C,MAAO,CAACjM,EAAGC,GACXL,GAAI0N,EACJxN,GAAIyN,IACH,IAGLX,UAAW,SAAU5M,EAAGC,GACtB,OAAO5D,KAAKyS,UAAU,CACpBlC,UAAW,CAAC5M,EAAGC,KACd,IAGLgN,SAAU,SAAUjN,EAAGC,GACrB,OAAO5D,KAAKyS,UAAU,CACpB7B,SAAU,CAACjN,EAAGC,KACb,IAGLwL,KAAM,SAAUuP,EAAY,OAAQrb,EAAS,UAM3C,OALyC,IAArC,aAAa2F,QAAQ0V,KACvBrb,EAASqb,EACTA,EAAY,QAGP3e,KAAKyS,UAAU,CACpBrD,KAAMuP,EACNrb,OAAQA,IACP,IAGL2V,QAAS,SAAUjd,GACjB,OAAOgE,KAAKoG,KAAK,UAAWpK,MAGhC0F,EAAgB,SAAU,CAExBkd,OAAQ,SAAUjb,EAAGC,EAAID,GAEvB,MAAgB,oBADF3D,KAAK6e,UAAY7e,MAAMuY,KACFvY,KAAKoG,KAAK,IAAK,IAAIiT,GAAU1V,IAAM3D,KAAK6Q,GAAGlN,GAAGoN,GAAGnN,MAGxFlC,EAAgB,OAAQ,CAEtBrB,OAAQ,WACN,OAAOL,KAAKjB,KAAK+f,kBAGnBC,QAAS,SAAU1e,GACjB,OAAO,IAAI,GAAML,KAAKjB,KAAKigB,iBAAiB3e,OAGhDqB,EAAgB,CAAC,UAAW,UAAW,CAErCud,KAAM,SAAU9U,EAAGC,GACjB,GAAiB,iBAAND,EAAgB,CACzB,IAAKC,KAAKD,EAAGnK,KAAKif,KAAK7U,EAAGD,EAAEC,IAE5B,OAAOpK,KAGT,MAAa,YAANmK,EAAkBnK,KAAK4c,QAAQxS,GAAW,WAAND,EAAiBnK,KAAKoG,KAAK,cAAegE,GAAW,SAAND,GAAsB,WAANA,GAAwB,WAANA,GAAwB,YAANA,GAAyB,YAANA,GAAyB,UAANA,EAAgBnK,KAAKoG,KAAK,QAAU+D,EAAGC,GAAKpK,KAAKoG,KAAK+D,EAAGC,MAmBjP1I,EAAgB,UAfA,CAAC,QAAS,WAAY,YAAa,UAAW,YAAa,WAAY,YAAa,aAAc,aAAc,aAAc,YAAa,aAAc,WAAY,eAAe+U,QAAO,SAAU4F,EAAM5E,GAazN,OADA4E,EAAK5E,GAVM,SAAU1I,GAOnB,OANU,OAANA,EACF/O,KAAK4X,IAAIH,GAETzX,KAAKmX,GAAGM,EAAO1I,GAGV/O,MAIFqc,IACN,KAyDH3a,EAAgB,UAAW,CACzBwd,YAvDF,WACE,OAAOlf,KAAKoG,KAAK,YAAa,OAuD9BmM,UApDF,WAgBE,OAfgBvS,KAAKoG,KAAK,cAAgB,IAC1C2C,MAAMtB,GAAYtG,MAAM,GAAI,GAAGwK,KAAI,SAAUwT,GAE3C,MAAMC,EAAKD,EAAIrW,OAAOC,MAAM,KAC5B,MAAO,CAACqW,EAAG,GAAIA,EAAG,GAAGrW,MAAMf,IAAW2D,KAAI,SAAUwT,GAClD,OAAO3M,WAAW2M,UAEnBE,UACF5I,QAAO,SAAUtF,EAAQsB,GACxB,MAAqB,WAAjBA,EAAU,GACLtB,EAAOmO,UAAUzQ,GAAOwD,UAAUI,EAAU,KAG9CtB,EAAOsB,EAAU,IAAInS,MAAM6Q,EAAQsB,EAAU,MACnD,IAAI5D,KAsCP0Q,SAlCF,SAAkBjZ,EAAQvL,GACxB,GAAIiF,OAASsG,EAAQ,OAAOtG,KAC5B,MAAMie,EAAMje,KAAK6d,YACX2B,EAAOlZ,EAAOuX,YAAYG,UAEhC,OADAhe,KAAKmU,MAAM7N,EAAQvL,GAAGmkB,cAAczM,UAAU+M,EAAKC,SAASxB,IACrDje,MA8BP0f,OA3BF,SAAgB3kB,GACd,OAAOiF,KAAKuf,SAASvf,KAAKyE,OAAQ1J,IA2BlC0X,UAxBF,SAAmBjX,EAAGoV,GAEpB,GAAS,MAALpV,GAA0B,iBAANA,EAAgB,CACtC,MAAMmkB,EAAa,IAAI9Q,GAAO7O,MAAM4f,YACpC,OAAY,MAALpkB,EAAYmkB,EAAaA,EAAWnkB,GAGxCqT,GAAOC,aAAatT,KAEvBA,EAAI,IAAKA,EACP8H,OAAQD,EAAU7H,EAAGwE,QAKzB,MACMmC,EAAS,IAAI0M,IADgB,IAAb+B,EAAoB5Q,KAAO4Q,IAAY,GACpB6B,UAAUjX,GACnD,OAAOwE,KAAKoG,KAAK,YAAajE,MAUhC,MAAM0d,WAAkBvN,GACtB,QAAQhM,EAAStG,KAAMyG,GAMrB,OALAzG,KAAK4W,MAAK,WACR,GAAI5W,gBAAgB6f,GAClB,OAAO7f,KAAK8f,UAAUC,aAGnB/f,KAGT,QAAQsG,EAAStG,KAAKsG,SAAUG,EAAQH,EAAOG,MAAMzG,OAOnD,OALAyG,GAAmB,IAAXA,EAAeH,EAAOC,WAAWlG,OAASoG,EAClDzG,KAAK4W,MAAK,SAAU7b,EAAGwL,GAErB,OAAOA,EAASA,EAASlG,OAAStF,EAAI,GAAGwkB,SAASjZ,EAAQG,MAErDzG,KAAK6G,UAIhBlB,EAASka,GAAW,aAEpB,MAAMG,WAAaH,GACjB,YAAY9gB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,OAAQrG,GAAO4X,GAGjC,UACE,OAAO3W,KAGT,UACE,OAAOA,MAIX2F,EAASqa,GAAM,QAEf,MAAMC,WAAc3N,IAGpB,SAASzB,GAAGA,GACV,OAAO7Q,KAAKoG,KAAK,KAAMyK,GAGzB,SAASE,GAAGA,GACV,OAAO/Q,KAAKoG,KAAK,KAAM2K,GAGzB,SAASmP,GAAIvc,GACX,OAAY,MAALA,EAAY3D,KAAKiR,KAAOjR,KAAK6Q,KAAO7Q,KAAKiR,GAAGtN,EAAI3D,KAAK6Q,MAG9D,SAASsP,GAAIvc,GACX,OAAY,MAALA,EAAY5D,KAAKkR,KAAOlR,KAAK+Q,KAAO/Q,KAAKkR,GAAGtN,EAAI5D,KAAK+Q,MAG9D,SAASqP,GAAKzc,GACZ,OAAO3D,KAAKoG,KAAK,KAAMzC,GAGzB,SAAS0c,GAAKzc,GACZ,OAAO5D,KAAKoG,KAAK,KAAMxC,GAGzB,SAAS0c,GAAQrd,GACf,OAAgB,MAATA,EAA4B,EAAZjD,KAAK6Q,KAAW7Q,KAAK6Q,GAAG,IAAIwI,GAAUpW,GAAOsd,OAAO,IAG7E,SAASC,GAAStd,GAChB,OAAiB,MAAVA,EAA6B,EAAZlD,KAAK+Q,KAAW/Q,KAAK+Q,GAAG,IAAIsI,GAAUnW,GAAQqd,OAAO,IA/B/E5a,EAASsa,GAAO,SAkChB,IAAIQ,GAAU,CACZ/gB,UAAW,KACXmR,GAAIA,GACJE,GAAIA,GACJpN,EAAGuc,GACHtc,EAAGuc,GACHlP,GAAImP,GACJlP,GAAImP,GACJpd,MAAOqd,GACPpd,OAAQsd,IAGV,MAAME,WAAgBT,GACpB,YAAYlhB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,UAAWrG,GAAO4X,GAGpC,KAAK1T,EAAOC,GACV,MAAMrG,EAAImG,EAAiBhD,KAAMiD,EAAOC,GACxC,OAAOlD,KAAK6Q,GAAG,IAAIwI,GAAUxc,EAAEoG,OAAOsd,OAAO,IAAIxP,GAAG,IAAIsI,GAAUxc,EAAEqG,QAAQqd,OAAO,KAIvFxa,EAAO2a,GAASD,IAChB/e,EAAgB,YAAa,CAE3Bif,QAAS1a,GAAkB,SAAUhD,EAAQ,EAAGC,EAASD,GACvD,OAAOjD,KAAKga,IAAI,IAAI0G,IAAW5M,KAAK7Q,EAAOC,GAAQ0d,KAAK,EAAG,QAG/Djb,EAAS+a,GAAS,WAElB,MAAMjb,WAAiBkU,GACrB,YAAY5a,EAAOsF,EAAQE,SAAS0X,0BAClC9F,MAAMpX,GAIR,IAAI4c,EAASC,EAAUxf,GASrB,GARuB,kBAAZuf,IACTvf,EAAKwf,EACLA,EAAWD,EACXA,EAAU,MAKG,MAAXA,GAAsC,mBAAZA,EAAwB,CACpD,MAAM5W,EAAU,IAAI4U,GAAItd,EAAO,UAAWD,IAE1C,OADA2I,EAAQ6B,IAAI5G,KAAKjB,KAAKwb,WAAU,IACzBxV,EAAQ2V,KAAI,EAAOte,GAI5B,OAAO+Z,MAAMuE,IAAIiB,GAAS,EAAOvf,IAOrC,SAAS6E,GAAK0C,EAAGC,GACf,MAAwC,oBAAhC5D,KAAK6e,UAAY7e,MAAMuY,KAA4BvY,KAAKoG,KAAK,CACnEya,GAAI,IAAIxH,GAAU1V,GAClBmd,GAAI,IAAIzH,GAAUzV,KACf5D,KAAKoG,KAAK,CACb2a,GAAI,IAAI1H,GAAU1V,GAClBqd,GAAI,IAAI3H,GAAUzV,KAGtB,SAAS5C,GAAG2C,EAAGC,GACb,MAAwC,oBAAhC5D,KAAK6e,UAAY7e,MAAMuY,KAA4BvY,KAAKoG,KAAK,CACnE6K,GAAI,IAAIoI,GAAU1V,GAClBuN,GAAI,IAAImI,GAAUzV,KACf5D,KAAKoG,KAAK,CACbuO,GAAI,IAAI0E,GAAU1V,GAClBiR,GAAI,IAAIyE,GAAUzV,KAjBtB+B,EAASF,GAAU,YAqBnB,IAh4B0BS,GAg4BtB+a,GAAa,CACfvhB,UAAW,KACXuB,KAAMA,GACND,GAAIA,IAGN,MAAMkgB,WAAiBrB,GACrB,YAAYtH,EAAM5B,GAChBR,MAAM/Q,EAAUmT,EAAO,WAA4B,iBAATA,EAAoB,KAAOA,GAAO5B,GAI9E,KAAKxM,EAAG3K,EAAGpE,GAET,MADU,cAAN+O,IAAmBA,EAAI,qBACpBgM,MAAM/P,KAAK+D,EAAG3K,EAAGpE,GAG1B,OACE,OAAO,IAAIiZ,GAGb,UACE,OAAOiC,GAAS,eAAiBtW,KAAKsa,KAAO,MAI/C,WACE,OAAOta,KAAKmhB,MAId,OAAOlf,GAQL,OANAjC,KAAKohB,QAEgB,mBAAVnf,GACTA,EAAM/G,KAAK8E,KAAMA,MAGZA,KAIT,MACE,MAAO,SAAWA,KAAKsa,KAAO,MAIlCvU,EAAOmb,GAAUD,IACjBvf,EAAgB,CACdme,UAAW,CAET,YAAY1Z,GACV,OAAOnG,KAAKqd,OAAOgE,YAAYlb,KAKnC6Z,KAAM,CACJqB,SAAUpb,GAAkB,SAAUsS,EAAMtW,GAC1C,OAAOjC,KAAKga,IAAI,IAAIkH,GAAS3I,IAAO+I,OAAOrf,SAIjD0D,EAASub,GAAU,YAEnB,MAAMK,WAAgB1B,GAEpB,YAAY9gB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,UAAWrG,GAAO4X,GAIpC,KAAKxM,EAAG3K,EAAGpE,GAET,MADU,cAAN+O,IAAmBA,EAAI,oBACpBgM,MAAM/P,KAAK+D,EAAG3K,EAAGpE,GAG1B,OACE,OAAO,IAAIiZ,GAGb,UACE,OAAOiC,GAAS,eAAiBtW,KAAKsa,KAAO,MAI/C,WACE,OAAOta,KAAKmhB,MAId,OAAOlf,GAQL,OANAjC,KAAKohB,QAEgB,mBAAVnf,GACTA,EAAM/G,KAAK8E,KAAMA,MAGZA,KAIT,MACE,MAAO,SAAWA,KAAKsa,KAAO,MAIlC5Y,EAAgB,CACdme,UAAW,CAET,WAAW1Z,GACT,OAAOnG,KAAKqd,OAAOmE,WAAWrb,KAIlC6Z,KAAM,CACJwB,QAASvb,GAAkB,SAAUhD,EAAOC,EAAQjB,GAClD,OAAOjC,KAAKga,IAAI,IAAIuH,IAAWD,OAAOrf,GAAOmE,KAAK,CAChDzC,EAAG,EACHC,EAAG,EACHX,MAAOA,EACPC,OAAQA,EACRue,aAAc,yBAKtB9b,EAAS4b,GAAS,WAElB,MAAM,WAActB,GAClB,YAAYlhB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,QAASrG,GAAO4X,GAIlC,KAAKwK,EAAKO,GACR,IAAKP,EAAK,OAAOnhB,KACjB,MAAM2hB,EAAM,IAAItd,EAAQC,OAAOsd,MAuB/B,OAtBAzK,GAAGwK,EAAK,QAAQ,SAAUlhB,GACxB,MAAM5D,EAAImD,KAAKsG,OAAOib,IAED,IAAjBvhB,KAAKiD,SAAmC,IAAlBjD,KAAKkD,UAC7BlD,KAAK8T,KAAK6N,EAAI1e,MAAO0e,EAAIze,QAGvBrG,aAAa0kB,IAEG,IAAd1kB,EAAEoG,SAAgC,IAAfpG,EAAEqG,UACvBrG,EAAEiX,KAAK9T,KAAKiD,QAASjD,KAAKkD,UAIN,mBAAbwe,GACTA,EAASxmB,KAAK8E,KAAMS,KAErBT,MACHmX,GAAGwK,EAAK,cAAc,WAEpB/J,GAAI+J,MAEC3hB,KAAKoG,KAAK,OAAQub,EAAIE,IAAMV,EAAKhd,IAliClB+B,GAsiCT,SAAUE,EAAMoD,EAAKsS,GAcpC,MAZa,SAAT1V,GAA4B,WAATA,GACjB2B,GAAQ+B,KAAKN,KACfA,EAAMsS,EAAMrX,OAAO4Y,OAAOyE,MAAMtY,IAIhCA,aAAe,KACjBA,EAAMsS,EAAMrX,OAAO4Y,OAAOmE,QAAQ,EAAG,EAAGA,IACtCA,EAAQ5a,IAAI4C,MAITA,GAnjCPkQ,GAAM7Y,KAAKqF,IAqjCbxE,EAAgB,CACdme,UAAW,CAETiC,MAAO7b,GAAkB,SAAUyI,EAAQgT,GACzC,OAAO1hB,KAAKga,IAAI,IAAI,IAASlG,KAAK,EAAG,GAAGiO,KAAKrT,EAAQgT,SAI3D/b,EAAS,GAAO,SAEhB,MAAMqc,WAAmB7I,GAEvB,OACE,IAAI8I,GAAQnN,IACRoN,GAAQpN,IACRqN,EAAOrN,IACPsN,EAAOtN,IAOX,OANA9U,KAAK4J,SAAQ,SAAUD,GACrBsY,EAAO3f,KAAKgG,IAAIqB,EAAG,GAAIsY,GACvBC,EAAO5f,KAAKgG,IAAIqB,EAAG,GAAIuY,GACvBC,EAAO7f,KAAKiG,IAAIoB,EAAG,GAAIwY,GACvBC,EAAO9f,KAAKiG,IAAIoB,EAAG,GAAIyY,MAElB,IAAI/N,GAAI8N,EAAMC,EAAMH,EAAOE,EAAMD,EAAOE,GAIjD,KAAKze,EAAGC,GACN,MAAMT,EAAMnD,KAAKoD,OAKjB,GAHAO,GAAKR,EAAIQ,EACTC,GAAKT,EAAIS,GAEJ2V,MAAM5V,KAAO4V,MAAM3V,GACtB,IAAK,IAAI7I,EAAIiF,KAAKK,OAAS,EAAGtF,GAAK,EAAGA,IACpCiF,KAAKjF,GAAK,CAACiF,KAAKjF,GAAG,GAAK4I,EAAG3D,KAAKjF,GAAG,GAAK6I,GAI5C,OAAO5D,KAIT,MAAM5B,EAAQ,CAAC,EAAG,IAChB,MAAMikB,EAAS,IAGbjkB,EADEA,aAAiBuB,MACXA,MAAMhD,UAAUyE,OAAOd,MAAM,GAAIlC,GAIjCA,EAAM0K,OAAOC,MAAMf,IAAW2D,IAAI6G,aAKlCnS,OAAS,GAAM,GAAGjC,EAAMkkB,MAElC,IAAK,IAAIvnB,EAAI,EAAGmhB,EAAM9d,EAAMiC,OAAQtF,EAAImhB,EAAKnhB,GAAQ,EACnDsnB,EAAOxhB,KAAK,CAACzC,EAAMrD,GAAIqD,EAAMrD,EAAI,KAGnC,OAAOsnB,EAIT,KAAKpf,EAAOC,GACV,IAAInI,EACJ,MAAMoI,EAAMnD,KAAKoD,OAEjB,IAAKrI,EAAIiF,KAAKK,OAAS,EAAGtF,GAAK,EAAGA,IAC5BoI,EAAIF,QAAOjD,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,GACvER,EAAID,SAAQlD,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,GAGhF,OAAO5D,KAIT,SACE,MAAO,CACL+gB,GAAI/gB,KAAK,GAAG,GACZghB,GAAIhhB,KAAK,GAAG,GACZ2U,GAAI3U,KAAK,GAAG,GACZ4U,GAAI5U,KAAK,GAAG,IAKhB,WACE,MAAM5B,EAAQ,GAEd,IAAK,IAAIrD,EAAI,EAAGmH,EAAKlC,KAAKK,OAAQtF,EAAImH,EAAInH,IACxCqD,EAAMyC,KAAKb,KAAKjF,GAAGoO,KAAK,MAG1B,OAAO/K,EAAM+K,KAAK,KAGpB,UAAUhO,GACR,OAAO6E,KAAK2O,QAAQC,WAAWzT,GAIjC,WAAWA,GACJ0T,GAAOC,aAAa3T,KACvBA,EAAI,IAAI0T,GAAO1T,IAGjB,IAAK,IAAIJ,EAAIiF,KAAKK,OAAQtF,KAAM,CAE9B,MAAO4I,EAAGC,GAAK5D,KAAKjF,GACpBiF,KAAKjF,GAAG,GAAKI,EAAEgP,EAAIxG,EAAIxI,EAAEC,EAAIwI,EAAIzI,EAAEsF,EACnCT,KAAKjF,GAAG,GAAKI,EAAEqE,EAAImE,EAAIxI,EAAEE,EAAIuI,EAAIzI,EAAE4T,EAGrC,OAAO/O,MAyBX,IAAIuiB,GAAU,CACZ7iB,UAAW,KACX8iB,WAtBiBR,GAuBjBre,EArBF,SAAaA,GACX,OAAY,MAALA,EAAY3D,KAAKoD,OAAOO,EAAI3D,KAAK4gB,KAAKjd,EAAG3D,KAAKoD,OAAOQ,IAqB5DA,EAlBF,SAAaA,GACX,OAAY,MAALA,EAAY5D,KAAKoD,OAAOQ,EAAI5D,KAAK4gB,KAAK5gB,KAAKoD,OAAOO,EAAGC,IAkB5DX,MAfF,SAAiBA,GACf,MAAMzD,EAAIQ,KAAKoD,OACf,OAAgB,MAATH,EAAgBzD,EAAEyD,MAAQjD,KAAK8T,KAAK7Q,EAAOzD,EAAE0D,SAcpDA,OAXF,SAAkBA,GAChB,MAAM1D,EAAIQ,KAAKoD,OACf,OAAiB,MAAVF,EAAiB1D,EAAE0D,OAASlD,KAAK8T,KAAKtU,EAAEyD,MAAOC,KAYxD,MAAMuf,WAAaxC,GAEjB,YAAYlhB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,OAAQrG,GAAO4X,GAIjC,QACE,OAAO,IAAIqL,GAAW,CAAC,CAAChiB,KAAKoG,KAAK,MAAOpG,KAAKoG,KAAK,OAAQ,CAACpG,KAAKoG,KAAK,MAAOpG,KAAKoG,KAAK,SAIzF,KAAKzC,EAAGC,GACN,OAAO5D,KAAKoG,KAAKpG,KAAK5B,QAAQwiB,KAAKjd,EAAGC,GAAG8e,UAI3C,KAAK3B,EAAIC,EAAIrM,EAAIC,GACf,OAAU,MAANmM,EACK/gB,KAAK5B,SAEZ2iB,OADuB,IAAPC,EACX,CACHD,KACAC,KACArM,KACAC,MAGG,IAAIoN,GAAWjB,GAAI2B,SAGnB1iB,KAAKoG,KAAK2a,IAInB,KAAK9d,EAAOC,GACV,MAAMrG,EAAImG,EAAiBhD,KAAMiD,EAAOC,GACxC,OAAOlD,KAAKoG,KAAKpG,KAAK5B,QAAQ0V,KAAKjX,EAAEoG,MAAOpG,EAAEqG,QAAQwf,WAI1D3c,EAAO0c,GAAMF,IACb7gB,EAAgB,CACdme,UAAW,CAET8C,KAAM1c,GAAkB,YAAaE,GAGnC,OAAOsc,GAAK9lB,UAAUimB,KAAKtiB,MAAMN,KAAKga,IAAI,IAAIyI,IAAoB,MAAXtc,EAAK,GAAaA,EAAO,CAAC,EAAG,EAAG,EAAG,UAIhGR,EAAS8c,GAAM,QAEf,MAAMI,WAAehD,GAEnB,YAAY9gB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,SAAUrG,GAAO4X,GAInC,OAAOzT,GACL,OAAOlD,KAAKoG,KAAK,eAAgBlD,GAGnC,OAAO4f,GACL,OAAO9iB,KAAKoG,KAAK,SAAU0c,GAI7B,IAAInf,EAAGC,GACL,OAAO5D,KAAKoG,KAAK,OAAQzC,GAAGyC,KAAK,OAAQxC,GAI3C,WACE,MAAO,QAAU5D,KAAKsa,KAAO,IAI/B,OAAOrY,GAQL,OANAjC,KAAKohB,QAEgB,mBAAVnf,GACTA,EAAM/G,KAAK8E,KAAMA,MAGZA,KAIT,MAAMiD,GACJ,OAAOjD,KAAKoG,KAAK,cAAenD,IAyCpC,SAAS8f,GAAiBrY,EAAGqE,GAC3B,OAAO,SAAU3E,GACf,OAAS,MAALA,EAAkBpK,KAAK0K,IAC3B1K,KAAK0K,GAAKN,EACN2E,GAAGA,EAAE7T,KAAK8E,MACPA,OA1CX0B,EAAgB,CACdme,UAAW,CACT,UAAU1Z,GAER,OAAOnG,KAAKqd,OAAO2F,UAAU7c,KAIjC6Z,KAAM,CAEJgD,OAAQ/c,GAAkB,SAAUhD,EAAOC,EAAQjB,GAEjD,OAAOjC,KAAKga,IAAI,IAAI6I,IAAU/O,KAAK7Q,EAAOC,GAAQ+f,IAAIhgB,EAAQ,EAAGC,EAAS,GAAGoS,QAAQ,EAAG,EAAGrS,EAAOC,GAAQkD,KAAK,SAAU,QAAQkb,OAAOrf,OAG5I+gB,OAAQ,CAEN,OAAOA,EAAQ/f,EAAOC,EAAQjB,GAC5B,IAAImE,EAAO,CAAC,UAMZ,MAJe,QAAX4c,GAAkB5c,EAAKvF,KAAKmiB,GAChC5c,EAAOA,EAAK+C,KAAK,KAEjB6Z,EAAS5iB,UAAU,aAAcyiB,GAASziB,UAAU,GAAKJ,KAAKqd,OAAO2F,OAAO/f,EAAOC,EAAQjB,GACpFjC,KAAKoG,KAAKA,EAAM4c,OAK7Brd,EAASkd,GAAQ,UAiBjB,MAAMK,GAAS,CACb,IAAK,SAAUC,GACb,OAAOA,GAET,KAAM,SAAUA,GACd,OAAQ7gB,KAAKyK,IAAIoW,EAAM7gB,KAAKC,IAAM,EAAI,IAExC,IAAK,SAAU4gB,GACb,OAAO7gB,KAAK8I,IAAI+X,EAAM7gB,KAAKC,GAAK,IAElC,IAAK,SAAU4gB,GACb,OAAsC,EAA9B7gB,KAAKyK,IAAIoW,EAAM7gB,KAAKC,GAAK,IAEnC6gB,OAAQ,SAAUrC,EAAIC,EAAIrM,EAAIC,GAE5B,OAAO,SAAU3Y,GACf,OAAIA,EAAI,EACF8kB,EAAK,EACAC,EAAKD,EAAK9kB,EACR0Y,EAAK,EACPC,EAAKD,EAAK1Y,EAEV,EAEAA,EAAI,EACT0Y,EAAK,GACC,EAAIC,IAAO,EAAID,GAAM1Y,GAAK2Y,EAAKD,IAAO,EAAIA,GACzCoM,EAAK,GACN,EAAIC,IAAO,EAAID,GAAM9kB,GAAK+kB,EAAKD,IAAO,EAAIA,GAE3C,EAGF,EAAI9kB,GAAK,EAAIA,IAAM,EAAI+kB,EAAK,EAAI/kB,GAAK,GAAK,EAAIA,GAAK2Y,EAAK3Y,GAAK,IAK1EonB,MAAO,SAAUA,EAAOC,EAAe,OAErCA,EAAeA,EAAava,MAAM,KAAKsW,UAAU,GACjD,IAAIkE,EAAQF,EASZ,MAPqB,SAAjBC,IACAC,EACwB,SAAjBD,KACPC,EAIG,CAACtnB,EAAGunB,GAAa,KAEtB,IAAIC,EAAOnhB,KAAKohB,MAAMznB,EAAIonB,GAC1B,MAAMM,EAAU1nB,EAAIwnB,EAAO,GAAM,EAkBjC,MAhBqB,UAAjBH,GAA6C,SAAjBA,KAC5BG,EAGAD,GAAcG,KACdF,EAGAxnB,GAAK,GAAKwnB,EAAO,IACnBA,EAAO,GAGLxnB,GAAK,GAAKwnB,EAAOF,IACnBE,EAAOF,GAGFE,EAAOF,KAIpB,MAAMK,GACJ,OACE,OAAO,GASX,MAAMC,WAAaD,GACjB,YAAY1d,EAAKyS,GAASE,MACxB1C,QACAnW,KAAK6Y,KAAOqK,GAAOhd,IAAOA,EAG5B,KAAKjF,EAAMD,EAAImiB,GACb,MAAoB,iBAATliB,EACFkiB,EAAM,EAAIliB,EAAOD,EAGnBC,GAAQD,EAAKC,GAAQjB,KAAK6Y,KAAKsK,IAS1C,MAAMW,WAAmBF,GACvB,YAAY1d,GACViQ,QACAnW,KAAK+jB,QAAU7d,EAGjB,KAAK9K,GACH,OAAOA,EAAEwF,KAGX,KAAKib,EAASmI,EAAQC,EAAI7oB,GACxB,OAAO4E,KAAK+jB,QAAQlI,EAASmI,EAAQC,EAAI7oB,IAK7C,SAAS8oB,KAEP,MAAMtL,GAAY5Y,KAAKmkB,WAAa,KAAO,IACrCC,EAAYpkB,KAAKqkB,YAAc,EAG/BhZ,EAAK/I,KAAKC,GACV+hB,EAAKhiB,KAAKiiB,IAAIH,EAAY,IAFpB,OAGNI,GAAQF,EAAKhiB,KAAKsK,KAAKvB,EAAKA,EAAKiZ,EAAKA,GACtCG,EAAK,KAAOD,EAAO5L,GAEzB5Y,KAAK3E,EAAI,EAAImpB,EAAOC,EACpBzkB,KAAK0K,EAAI+Z,EAAKA,EA6BhB1e,EA1BA,cAAqB+d,GACnB,YAAYlL,EAAW,IAAKwL,EAAY,GACtCjO,QACAnW,KAAK4Y,SAASA,GAAUwL,UAAUA,GAGpC,KAAKvI,EAASmI,EAAQC,EAAI7oB,GACxB,GAAuB,iBAAZygB,EAAsB,OAAOA,EAExC,GADAzgB,EAAEwF,KAAOqjB,IAAOnP,IACZmP,IAAOnP,IAAU,OAAOkP,EAC5B,GAAW,IAAPC,EAAU,OAAOpI,EACjBoI,EAAK,MAAKA,EAAK,IACnBA,GAAM,IAEN,MAAMS,EAAWtpB,EAAEspB,UAAY,EAEzBC,GAAgB3kB,KAAK3E,EAAIqpB,EAAW1kB,KAAK0K,GAAKmR,EAAUmI,GACxDY,EAAc/I,EAAU6I,EAAWT,EAAKU,EAAeV,EAAKA,EAAK,EAKvE,OAHA7oB,EAAEspB,SAAWA,EAAWC,EAAeV,EAEvC7oB,EAAEwF,KAAO0B,KAAK4M,IAAI8U,EAASY,GAAetiB,KAAK4M,IAAIwV,GAAY,KACxDtpB,EAAEwF,KAAOojB,EAASY,IAId,CACbhM,SAAUmK,GAAiB,YAAamB,IACxCE,UAAWrB,GAAiB,aAAcmB,MA6B5Cne,EA3BA,cAAkB+d,GAChB,YAAYjnB,EAAI,GAAK9B,EAAI,IAAMM,EAAI,EAAGwpB,EAAS,KAC7C1O,QACAnW,KAAKnD,EAAEA,GAAG9B,EAAEA,GAAGM,EAAEA,GAAGwpB,OAAOA,GAG7B,KAAKhJ,EAASmI,EAAQC,EAAI7oB,GACxB,GAAuB,iBAAZygB,EAAsB,OAAOA,EAExC,GADAzgB,EAAEwF,KAAOqjB,IAAOnP,IACZmP,IAAOnP,IAAU,OAAOkP,EAC5B,GAAW,IAAPC,EAAU,OAAOpI,EACrB,MAAMhf,EAAImnB,EAASnI,EACnB,IAAI9gB,GAAKK,EAAE0pB,UAAY,GAAKjoB,EAAIonB,EAChC,MAAM5oB,GAAKwB,GAAKzB,EAAE0F,OAAS,IAAMmjB,EAC3BY,EAAS7kB,KAAK+kB,QASpB,OAPe,IAAXF,IACF9pB,EAAIuH,KAAKgG,KAAKuc,EAAQviB,KAAKiG,IAAIxN,EAAG8pB,KAGpCzpB,EAAE0F,MAAQjE,EACVzB,EAAE0pB,SAAW/pB,EACbK,EAAEwF,KAAO0B,KAAK4M,IAAIrS,GAAK,KAChBzB,EAAEwF,KAAOojB,EAASnI,GAAW7b,KAAKglB,EAAInoB,EAAImD,KAAKilB,EAAIlqB,EAAIiF,KAAKklB,EAAI7pB,KAI/D,CACVwpB,OAAQ9B,GAAiB,WACzBlmB,EAAGkmB,GAAiB,KACpBhoB,EAAGgoB,GAAiB,KACpB1nB,EAAG0nB,GAAiB,OAGtB,MAAMoC,GAAoB,CACxBC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,EACHC,EAAG,GAECC,GAAe,CACnBV,EAAG,SAAUhqB,EAAGyB,EAAGkpB,GAGjB,OAFAlpB,EAAE8G,EAAIoiB,EAAGpiB,EAAIvI,EAAE,GACfyB,EAAE+G,EAAImiB,EAAGniB,EAAIxI,EAAE,GACR,CAAC,IAAKyB,EAAE8G,EAAG9G,EAAE+G,IAEtByhB,EAAG,SAAUjqB,EAAGyB,GAGd,OAFAA,EAAE8G,EAAIvI,EAAE,GACRyB,EAAE+G,EAAIxI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,KAEvBkqB,EAAG,SAAUlqB,EAAGyB,GAEd,OADAA,EAAE8G,EAAIvI,EAAE,GACD,CAAC,IAAKA,EAAE,KAEjBmqB,EAAG,SAAUnqB,EAAGyB,GAEd,OADAA,EAAE+G,EAAIxI,EAAE,GACD,CAAC,IAAKA,EAAE,KAEjBoqB,EAAG,SAAUpqB,EAAGyB,GAGd,OAFAA,EAAE8G,EAAIvI,EAAE,GACRyB,EAAE+G,EAAIxI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,KAE/CqqB,EAAG,SAAUrqB,EAAGyB,GAGd,OAFAA,EAAE8G,EAAIvI,EAAE,GACRyB,EAAE+G,EAAIxI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,KAEnCsqB,EAAG,SAAUtqB,EAAGyB,GAGd,OAFAA,EAAE8G,EAAIvI,EAAE,GACRyB,EAAE+G,EAAIxI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,KAEnCuqB,EAAG,SAAUvqB,EAAGyB,GAGd,OAFAA,EAAE8G,EAAIvI,EAAE,GACRyB,EAAE+G,EAAIxI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,KAEvByqB,EAAG,SAAUzqB,EAAGyB,EAAGkpB,GAGjB,OAFAlpB,EAAE8G,EAAIoiB,EAAGpiB,EACT9G,EAAE+G,EAAImiB,EAAGniB,EACF,CAAC,MAEVgiB,EAAG,SAAUxqB,EAAGyB,GAGd,OAFAA,EAAE8G,EAAIvI,EAAE,GACRyB,EAAE+G,EAAIxI,EAAE,GACD,CAAC,IAAKA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,MAGjD4qB,GAAa,aAAajd,MAAM,IAEtC,IAAK,IAAIhO,EAAI,EAAGmH,EAAK8jB,GAAW3lB,OAAQtF,EAAImH,IAAMnH,EAChD+qB,GAAaE,GAAWjrB,IAAM,SAAUA,GACtC,OAAO,SAAUK,EAAGyB,EAAGkpB,GACrB,GAAU,MAANhrB,EAAWK,EAAE,GAAKA,EAAE,GAAKyB,EAAE8G,OAAO,GAAU,MAAN5I,EAAWK,EAAE,GAAKA,EAAE,GAAKyB,EAAE+G,OAAO,GAAU,MAAN7I,EAC9EK,EAAE,GAAKA,EAAE,GAAKyB,EAAE8G,EAChBvI,EAAE,GAAKA,EAAE,GAAKyB,EAAE+G,OAEhB,IAAK,IAAI4U,EAAI,EAAGyN,EAAK7qB,EAAEiF,OAAQmY,EAAIyN,IAAMzN,EACvCpd,EAAEod,GAAKpd,EAAEod,IAAMA,EAAI,EAAI3b,EAAE+G,EAAI/G,EAAE8G,GAGnC,OAAOmiB,GAAa/qB,GAAGK,EAAGyB,EAAGkpB,IAVH,CAY5BC,GAAWjrB,GAAG6H,eAQlB,SAASsjB,GAAgBtS,GACvB,OAAOA,EAAOuS,QAAQ9lB,QAAUuT,EAAOuS,QAAQ9lB,OAAS,IAAM8kB,GAAkBvR,EAAOuS,QAAQ,GAAGvjB,eAGpG,SAASwjB,GAAgBxS,EAAQyS,GAC/BzS,EAAO0S,UAAYC,GAAe3S,GAAQ,GAC1C,MAAM4S,EAAave,GAAa6B,KAAKuc,GAErC,GAAIG,EACF5S,EAAOuS,QAAU,CAACE,OACb,CACL,MAAMI,EAAc7S,EAAO6S,YACrBC,EAAQD,EAAYhkB,cACpBkkB,EAAUF,IAAgBC,EAChC9S,EAAOuS,QAAU,CAAW,MAAVO,EAAgBC,EAAU,IAAM,IAAMF,GAK1D,OAFA7S,EAAOgT,WAAY,EACnBhT,EAAO6S,YAAc7S,EAAOuS,QAAQ,GAC7BK,EAGT,SAASD,GAAe3S,EAAQ0S,GAC9B,IAAK1S,EAAO0S,SAAU,MAAM,IAAItoB,MAAM,gBACtC4V,EAAOrV,QAAUqV,EAAOuS,QAAQtlB,KAAK2R,WAAWoB,EAAOrV,SACvDqV,EAAO0S,SAAWA,EAClB1S,EAAOrV,OAAS,GAChBqV,EAAOiT,WAAY,EACnBjT,EAAOkT,aAAc,EAEjBZ,GAAgBtS,IAClBmT,GAAgBnT,GAIpB,SAASmT,GAAgBnT,GACvBA,EAAOgT,WAAY,EAEfhT,EAAOoT,WACTpT,EAAOuS,QA5CX,SAAqBvS,GACnB,MAAMqT,EAAUrT,EAAOuS,QAAQ,GAC/B,OAAOL,GAAamB,GAASrT,EAAOuS,QAAQhlB,MAAM,GAAIyS,EAAO/W,EAAG+W,EAAOmS,IA0CpDmB,CAAYtT,IAG/BA,EAAOuT,SAAStmB,KAAK+S,EAAOuS,SAG9B,SAASiB,GAAUxT,GACjB,IAAKA,EAAOuS,QAAQ9lB,OAAQ,OAAO,EACnC,MAAMgnB,EAA4C,MAApCzT,EAAOuS,QAAQ,GAAGvjB,cAC1BvC,EAASuT,EAAOuS,QAAQ9lB,OAC9B,OAAOgnB,IAAqB,IAAXhnB,GAA2B,IAAXA,GAGnC,SAASinB,GAAc1T,GACrB,MAA0C,MAAnCA,EAAO2T,UAAU3kB,cA6I1B,MAAM4kB,WAAkBrO,GAEtB,OAEE,OADAvF,KAASG,KAAK+I,aAAa,IAAK9c,KAAKwI,YAC9B,IAAI6L,GAAIT,GAAOC,MAAME,KAAK2J,WAInC,KAAK/Z,EAAGC,GAEN,MAAMT,EAAMnD,KAAKoD,OAKjB,GAHAO,GAAKR,EAAIQ,EACTC,GAAKT,EAAIS,GAEJ2V,MAAM5V,KAAO4V,MAAM3V,GAEtB,IAAK,IAAI5I,EAAGD,EAAIiF,KAAKK,OAAS,EAAGtF,GAAK,EAAGA,IACvCC,EAAIgF,KAAKjF,GAAG,GAEF,MAANC,GAAmB,MAANA,GAAmB,MAANA,GAC5BgF,KAAKjF,GAAG,IAAM4I,EACd3D,KAAKjF,GAAG,IAAM6I,GACC,MAAN5I,EACTgF,KAAKjF,GAAG,IAAM4I,EACC,MAAN3I,EACTgF,KAAKjF,GAAG,IAAM6I,EACC,MAAN5I,GAAmB,MAANA,GAAmB,MAANA,GACnCgF,KAAKjF,GAAG,IAAM4I,EACd3D,KAAKjF,GAAG,IAAM6I,EACd5D,KAAKjF,GAAG,IAAM4I,EACd3D,KAAKjF,GAAG,IAAM6I,EAEJ,MAAN5I,IACFgF,KAAKjF,GAAG,IAAM4I,EACd3D,KAAKjF,GAAG,IAAM6I,IAED,MAAN5I,IACTgF,KAAKjF,GAAG,IAAM4I,EACd3D,KAAKjF,GAAG,IAAM6I,GAKpB,OAAO5D,KAIT,MAAM3E,EAAI,QAKR,OAJIsE,MAAMgC,QAAQtG,KAChBA,EAAIsE,MAAMhD,UAAUyE,OAAOd,MAAM,GAAIjF,GAAGmN,YA5L9C,SAAoBnN,EAAGosB,GAAa,GAClC,IAAIhhB,EAAQ,EACR4f,EAAQ,GACZ,MAAMzS,EAAS,CACbuS,QAAS,GACTG,UAAU,EACV/nB,OAAQ,GACRgpB,UAAW,GACXX,WAAW,EACXO,SAAU,GACVN,WAAW,EACXC,aAAa,EACbE,SAAUS,EACV1B,GAAI,IAAI,GACRlpB,EAAG,IAAI,IAGT,KAAO+W,EAAO2T,UAAYlB,EAAOA,EAAQhrB,EAAE0H,OAAO0D,MAChD,GAAKmN,EAAOgT,YACNR,GAAgBxS,EAAQyS,GAK9B,GAAc,MAAVA,EAaJ,GAAK9M,MAAMlN,SAASga,IAapB,GAAc,MAAVA,GAA2B,MAAVA,EAQrB,GAAc,MAAVA,EAYJ,GAA4B,MAAxBA,EAAMzjB,eAMV,GAAIqF,GAAa6B,KAAKuc,GAAQ,CAC5B,GAAIzS,EAAO0S,SACTC,GAAe3S,GAAQ,OAClB,KAAKsS,GAAgBtS,GAC1B,MAAM,IAAI5V,MAAM,gBAEhB+oB,GAAgBnT,KAGhBnN,QAdFmN,EAAOrV,QAAU8nB,EACjBzS,EAAOkT,aAAc,MAdvB,CACE,GAAIlT,EAAO0S,WAAagB,GAAc1T,GAAS,CAC7C2S,GAAe3S,GAAQ,KACrBnN,EACF,SAGFmN,EAAOrV,QAAU8nB,EACjBzS,EAAO0S,UAAW,OAfd1S,EAAO0S,UACTC,GAAe3S,GAAQ,OAf3B,CACE,GAAsB,MAAlBA,EAAOrV,QAAkB6oB,GAAUxT,GAAS,CAC9CA,EAAO0S,UAAW,EAClB1S,EAAOrV,OAAS8nB,EAChBE,GAAe3S,GAAQ,GACvB,SAGFA,EAAO0S,UAAW,EAClB1S,EAAOrV,QAAU8nB,MAtBnB,CACE,GAAIzS,EAAOiT,WAAajT,EAAOkT,YAAa,CAC1CP,GAAe3S,GAAQ,KACrBnN,EACF,SAGFmN,EAAO0S,UAAW,EAClB1S,EAAOiT,WAAY,EACnBjT,EAAOrV,QAAU8nB,EAgErB,OARIzS,EAAO0S,UACTC,GAAe3S,GAAQ,GAGrBA,EAAOgT,WAAaV,GAAgBtS,IACtCmT,GAAgBnT,GAGXA,EAAOuT,SA8FLO,CAAWrsB,GAIpB,KAAK4H,EAAOC,GAEV,MAAMC,EAAMnD,KAAKoD,OACjB,IAAIrI,EAAGC,EAMP,IAHAmI,EAAIF,MAAsB,IAAdE,EAAIF,MAAc,EAAIE,EAAIF,MACtCE,EAAID,OAAwB,IAAfC,EAAID,OAAe,EAAIC,EAAID,OAEnCnI,EAAIiF,KAAKK,OAAS,EAAGtF,GAAK,EAAGA,IAChCC,EAAIgF,KAAKjF,GAAG,GAEF,MAANC,GAAmB,MAANA,GAAmB,MAANA,GAC5BgF,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC5D3D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,GAC/C,MAAN5I,EACTgF,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC7C,MAAN3I,EACTgF,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,EAC/C,MAAN5I,GAAmB,MAANA,GAAmB,MAANA,GACnCgF,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC5D3D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,EAC9D5D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC5D3D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,EAEpD,MAAN5I,IACFgF,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC5D3D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,IAEjD,MAAN5I,IAETgF,KAAKjF,GAAG,GAAKiF,KAAKjF,GAAG,GAAKkI,EAAQE,EAAIF,MACtCjD,KAAKjF,GAAG,GAAKiF,KAAKjF,GAAG,GAAKmI,EAASC,EAAID,OAEvClD,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIQ,GAAKV,EAAQE,EAAIF,MAAQE,EAAIQ,EAC5D3D,KAAKjF,GAAG,IAAMiF,KAAKjF,GAAG,GAAKoI,EAAIS,GAAKV,EAASC,EAAID,OAASC,EAAIS,GAIlE,OAAO5D,KAIT,WACE,OA3IJ,SAAuBmK,GACrB,IAAIrN,EAAI,GAER,IAAK,IAAI/B,EAAI,EAAGmH,EAAKiI,EAAE9J,OAAQtF,EAAImH,EAAInH,IACrC+B,GAAKqN,EAAEpP,GAAG,GAEK,MAAXoP,EAAEpP,GAAG,KACP+B,GAAKqN,EAAEpP,GAAG,GAEK,MAAXoP,EAAEpP,GAAG,KACP+B,GAAK,IACLA,GAAKqN,EAAEpP,GAAG,GAEK,MAAXoP,EAAEpP,GAAG,KACP+B,GAAK,IACLA,GAAKqN,EAAEpP,GAAG,GACV+B,GAAK,IACLA,GAAKqN,EAAEpP,GAAG,GAEK,MAAXoP,EAAEpP,GAAG,KACP+B,GAAK,IACLA,GAAKqN,EAAEpP,GAAG,GACV+B,GAAK,IACLA,GAAKqN,EAAEpP,GAAG,GAEK,MAAXoP,EAAEpP,GAAG,KACP+B,GAAK,IACLA,GAAKqN,EAAEpP,GAAG,QAQtB,OAAO+B,EAAI,IAwGF6qB,CAAc3nB,OAKzB,MAAM4nB,GAAkB5rB,IACtB,MAAMuc,SAAcvc,EAEpB,MAAa,WAATuc,EACKc,GACW,WAATd,EACLzN,GAAM6R,QAAQ3gB,GACT8O,GACE9C,GAAU8B,KAAK9N,GACjBiM,GAAa6B,KAAK9N,GAASwrB,GAAYrO,GACrC9R,EAAcyC,KAAK9N,GACrBqd,GAEAwO,GAEAC,GAAe7e,QAAQjN,EAAMiE,cAAgB,EAC/CjE,EAAMiE,YACJN,MAAMgC,QAAQ3F,GAChBmd,GACW,WAATZ,EACFwP,GAEAF,IAIX,MAAMG,GACJ,YAAYjE,GACV/jB,KAAKioB,SAAWlE,GAAW,IAAIF,GAAK,KACpC7jB,KAAKkoB,MAAQ,KACbloB,KAAKmoB,IAAM,KACXnoB,KAAKooB,MAAQ,KACbpoB,KAAKqoB,SAAW,KAChBroB,KAAKsoB,UAAY,KAGnB,GAAGnF,GACD,MAAMrH,EAAQ9b,KAEd,OAAOA,KAAKsoB,UAAUjW,UAAUrS,KAAKkoB,MAAMvc,KAAI,SAAU5Q,EAAG0L,GAC1D,OAAOqV,EAAMmM,SAASxE,KAAK1oB,EAAG+gB,EAAMqM,IAAI1hB,GAAQ0c,EAAKrH,EAAMuM,SAAS5hB,GAAQqV,EAAMuM,cAItF,OAKE,OAJiBroB,KAAKqoB,SAAS1c,IAAI3L,KAAKioB,SAASrnB,MAAM6V,QAAO,SAAU4F,EAAMC,GAC5E,OAAOD,GAAQC,KACd,GAKL,KAAK9S,GACH,OAAW,MAAPA,EACKxJ,KAAKkoB,OAGdloB,KAAKkoB,MAAQloB,KAAKuoB,KAAK/e,GAChBxJ,MAGT,QAAQ+jB,GACN,OAAe,MAAXA,EAAwB/jB,KAAKioB,UACjCjoB,KAAKioB,SAAWlE,EACT/jB,MAGT,GAAGwJ,GACD,OAAW,MAAPA,EACKxJ,KAAKmoB,KAGdnoB,KAAKmoB,IAAMnoB,KAAKuoB,KAAK/e,GACdxJ,MAGT,KAAKuY,GAEH,OAAY,MAARA,EACKvY,KAAKooB,OAIdpoB,KAAKooB,MAAQ7P,EACNvY,MAGT,KAAKhE,GACEgE,KAAKooB,OACRpoB,KAAKuY,KAAKqP,GAAgB5rB,IAG5B,IAAImG,EAAS,IAAInC,KAAKooB,MAAMpsB,GAgB5B,OAdIgE,KAAKooB,QAAUtd,KACjB3I,EAASnC,KAAKmoB,IAAMhmB,EAAOnC,KAAKmoB,IAAI,MAAQnoB,KAAKkoB,MAAQ/lB,EAAOnC,KAAKkoB,MAAM,MAAQ/lB,GAGjFnC,KAAKooB,QAAUL,KACjB5lB,EAASnC,KAAKmoB,IAAMhmB,EAAOqmB,MAAMxoB,KAAKmoB,KAAOnoB,KAAKkoB,MAAQ/lB,EAAOqmB,MAAMxoB,KAAKkoB,OAAS/lB,GAGvFA,EAASA,EAAOsmB,UAChBzoB,KAAKsoB,UAAYtoB,KAAKsoB,WAAa,IAAItoB,KAAKooB,MAC5CpoB,KAAKqoB,SAAWroB,KAAKqoB,UAAY1oB,MAAMW,MAAM,KAAMX,MAAMwC,EAAO9B,SAASsL,IAAIlQ,QAAQkQ,KAAI,SAAUnQ,GAEjG,OADAA,EAAEoF,MAAO,EACFpF,KAEF2G,GAIX,MAAM0lB,GACJ,eAAe1hB,GACbnG,KAAKgL,QAAQ7E,GAGf,KAAKqD,GAGH,OAFAA,EAAM7J,MAAMgC,QAAQ6H,GAAOA,EAAI,GAAKA,EACpCxJ,KAAKhE,MAAQwN,EACNxJ,KAGT,UACE,MAAO,CAACA,KAAKhE,OAGf,UACE,OAAOgE,KAAKhE,OAIhB,MAAM0sB,GACJ,eAAeviB,GACbnG,KAAKgL,QAAQ7E,GAGf,KAAKuQ,GAeH,OAdI/W,MAAMgC,QAAQ+U,KAChBA,EAAM,CACJ/G,OAAQ+G,EAAI,GACZ7G,OAAQ6G,EAAI,GACZ5G,MAAO4G,EAAI,GACX1G,OAAQ0G,EAAI,GACZjG,WAAYiG,EAAI,GAChB/F,WAAY+F,EAAI,GAChBlT,QAASkT,EAAI,GACbhT,QAASgT,EAAI,KAIjBjb,OAAO0E,OAAOH,KAAM0oB,GAAaC,SAAUjS,GACpC1W,KAGT,UACE,MAAMoK,EAAIpK,KACV,MAAO,CAACoK,EAAEuF,OAAQvF,EAAEyF,OAAQzF,EAAE0F,MAAO1F,EAAE4F,OAAQ5F,EAAEqG,WAAYrG,EAAEuG,WAAYvG,EAAE5G,QAAS4G,EAAE1G,UAI5FglB,GAAaC,SAAW,CACtBhZ,OAAQ,EACRE,OAAQ,EACRC,MAAO,EACPE,OAAQ,EACRS,WAAY,EACZE,WAAY,EACZnN,QAAS,EACTE,QAAS,GAGX,MAAMklB,GAAY,CAACze,EAAG3K,IACb2K,EAAE,GAAK3K,EAAE,IAAM,EAAI2K,EAAE,GAAK3K,EAAE,GAAK,EAAI,EAG9C,MAAMuoB,GACJ,eAAe5hB,GACbnG,KAAKgL,QAAQ7E,GAGf,MAAM6L,GACJ,IAAK,IAAIjX,EAAI,EAAGmH,EAAKlC,KAAK+L,OAAO1L,OAAQtF,EAAImH,IAAMnH,EACjD,GAAIiF,KAAK+L,OAAOhR,KAAO+P,GAAO,CAC5B,MAAMpC,EAAQsJ,EAAMjX,EAAI,GAClBkQ,EAAQ,IAAIH,GAAM9K,KAAK+L,OAAO8c,OAAO9tB,EAAI,EAAG,IAAI2N,KAAS+f,UAC/DzoB,KAAK+L,OAAO8c,OAAO9tB,EAAI,EAAG,KAAMkQ,GAIpC,OAAOjL,KAGT,KAAK8oB,GAGH,GAFA9oB,KAAK+L,OAAS,GAEVpM,MAAMgC,QAAQmnB,GAEhB,YADA9oB,KAAK+L,OAAS+c,EAAS3nB,SAIzB2nB,EAAWA,GAAY,GACvB,MAAMC,EAAU,GAEhB,IAAK,MAAMhuB,KAAK+tB,EAAU,CACxB,MAAME,EAAOpB,GAAgBkB,EAAS/tB,IAChCyO,EAAM,IAAIwf,EAAKF,EAAS/tB,IAAI0tB,UAClCM,EAAQloB,KAAK,CAAC9F,EAAGiuB,EAAMxf,EAAInJ,UAAWmJ,IAKxC,OAFAuf,EAAQE,KAAKL,IACb5oB,KAAK+L,OAASgd,EAAQtS,OAAO,CAAC4F,EAAMC,IAASD,EAAKjb,OAAOkb,GAAO,IACzDtc,KAGT,UACE,OAAOA,KAAK+L,OAGd,UACE,MAAM2K,EAAM,GACNR,EAAMlW,KAAK+L,OAEjB,KAAOmK,EAAI7V,QAAQ,CACjB,MAAM/D,EAAM4Z,EAAIgT,QACVF,EAAO9S,EAAIgT,QACXC,EAAMjT,EAAIgT,QACVnd,EAASmK,EAAI2S,OAAO,EAAGM,GAC7BzS,EAAIpa,GAAO,IAAI0sB,EAAKjd,GAAQ0N,UAG9B,OAAO/C,GAIX,MAAMoR,GAAiB,CAACD,GAAca,GAAcX,IAkBpD,MAAMqB,WAAanJ,GAEjB,YAAYlhB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,OAAQrG,GAAO4X,GAIjC,QACE,OAAO3W,KAAKqpB,SAAWrpB,KAAKqpB,OAAS,IAAI7B,GAAUxnB,KAAKoG,KAAK,OAI/D,QAEE,cADOpG,KAAKqpB,OACLrpB,KAIT,OAAOkD,GACL,OAAiB,MAAVA,EAAiBlD,KAAKoD,OAAOF,OAASlD,KAAK8T,KAAK9T,KAAKoD,OAAOH,MAAOC,GAI5E,KAAKS,EAAGC,GACN,OAAO5D,KAAKoG,KAAK,IAAKpG,KAAK5B,QAAQwiB,KAAKjd,EAAGC,IAI7C,KAAKvI,GACH,OAAY,MAALA,EAAY2E,KAAK5B,QAAU4B,KAAKohB,QAAQhb,KAAK,IAAkB,iBAAN/K,EAAiBA,EAAI2E,KAAKqpB,OAAS,IAAI7B,GAAUnsB,IAInH,KAAK4H,EAAOC,GACV,MAAMrG,EAAImG,EAAiBhD,KAAMiD,EAAOC,GACxC,OAAOlD,KAAKoG,KAAK,IAAKpG,KAAK5B,QAAQ0V,KAAKjX,EAAEoG,MAAOpG,EAAEqG,SAIrD,MAAMD,GACJ,OAAgB,MAATA,EAAgBjD,KAAKoD,OAAOH,MAAQjD,KAAK8T,KAAK7Q,EAAOjD,KAAKoD,OAAOF,QAI1E,EAAES,GACA,OAAY,MAALA,EAAY3D,KAAKoD,OAAOO,EAAI3D,KAAK4gB,KAAKjd,EAAG3D,KAAKoD,OAAOQ,GAI9D,EAAEA,GACA,OAAY,MAALA,EAAY5D,KAAKoD,OAAOQ,EAAI5D,KAAK4gB,KAAK5gB,KAAKoD,OAAOO,EAAGC,IAKhEwlB,GAAKzsB,UAAU6lB,WAAagF,GAE5B9lB,EAAgB,CACdme,UAAW,CAET9L,KAAM9N,GAAkB,SAAU5K,GAEhC,OAAO2E,KAAKga,IAAI,IAAIoP,IAAQxG,KAAKvnB,GAAK,IAAImsB,UAIhD7hB,EAASyjB,GAAM,QAwBf,IAAIE,GAAO,CACT5pB,UAAW,KACXtB,MAxBF,WACE,OAAO4B,KAAKqpB,SAAWrpB,KAAKqpB,OAAS,IAAIrH,GAAWhiB,KAAKoG,KAAK,aAwB9Dgb,MArBF,WAEE,cADOphB,KAAKqpB,OACLrpB,MAoBP4gB,KAjBF,SAAgBjd,EAAGC,GACjB,OAAO5D,KAAKoG,KAAK,SAAUpG,KAAK5B,QAAQwiB,KAAKjd,EAAGC,KAiBhDgf,KAdF,SAAc/lB,GACZ,OAAY,MAALA,EAAYmD,KAAK5B,QAAU4B,KAAKohB,QAAQhb,KAAK,SAAuB,iBAANvJ,EAAiBA,EAAImD,KAAKqpB,OAAS,IAAIrH,GAAWnlB,KAcvHiX,KAXF,SAAgB7Q,EAAOC,GACrB,MAAMrG,EAAImG,EAAiBhD,KAAMiD,EAAOC,GACxC,OAAOlD,KAAKoG,KAAK,SAAUpG,KAAK5B,QAAQ0V,KAAKjX,EAAEoG,MAAOpG,EAAEqG,WAY1D,MAAM,WAAgB+c,GAEpB,YAAYlhB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,UAAWrG,GAAO4X,IAItCjV,EAAgB,CACdme,UAAW,CAET0J,QAAStjB,GAAkB,SAAUpJ,GAEnC,OAAOmD,KAAKga,IAAI,IAAI,IAAW4I,KAAK/lB,GAAK,IAAImlB,UAInDjc,EAAO,GAASwc,IAChBxc,EAAO,GAASujB,IAChB3jB,EAAS,GAAS,WAElB,MAAM6jB,WAAiBvJ,GAErB,YAAYlhB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,WAAYrG,GAAO4X,IAIvCjV,EAAgB,CACdme,UAAW,CAET4J,SAAUxjB,GAAkB,SAAUpJ,GAEpC,OAAOmD,KAAKga,IAAI,IAAIwP,IAAY5G,KAAK/lB,GAAK,IAAImlB,UAIpDjc,EAAOyjB,GAAUjH,IACjBxc,EAAOyjB,GAAUF,IACjB3jB,EAAS6jB,GAAU,YAEnB,MAAME,WAAazJ,GAEjB,YAAYlhB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,OAAQrG,GAAO4X,IAInC5Q,EAAO2jB,GAAM,CACX7Y,MACAE,QAEFrP,EAAgB,CACdme,UAAW,CAETzB,KAAMnY,GAAkB,SAAUhD,EAAOC,GACvC,OAAOlD,KAAKga,IAAI,IAAI0P,IAAQ5V,KAAK7Q,EAAOC,SAI9CyC,EAAS+jB,GAAM,QAEf,MAAMC,GACJ,cACE3pB,KAAK4pB,OAAS,KACd5pB,KAAK6pB,MAAQ,KAIf,QACE,OAAO7pB,KAAK4pB,QAAU5pB,KAAK4pB,OAAO5tB,MAIpC,OACE,OAAOgE,KAAK6pB,OAAS7pB,KAAK6pB,MAAM7tB,MAGlC,KAAKA,GAEH,MAAM8tB,OAA6B,IAAf9tB,EAAM2E,KAAuB3E,EAAQ,CACvDA,MAAOA,EACP2E,KAAM,KACN+F,KAAM,MAaR,OAVI1G,KAAK6pB,OACPC,EAAKpjB,KAAO1G,KAAK6pB,MACjB7pB,KAAK6pB,MAAMlpB,KAAOmpB,EAClB9pB,KAAK6pB,MAAQC,IAEb9pB,KAAK6pB,MAAQC,EACb9pB,KAAK4pB,OAASE,GAITA,EAIT,OAAOA,GAEDA,EAAKpjB,OAAMojB,EAAKpjB,KAAK/F,KAAOmpB,EAAKnpB,MACjCmpB,EAAKnpB,OAAMmpB,EAAKnpB,KAAK+F,KAAOojB,EAAKpjB,MACjCojB,IAAS9pB,KAAK6pB,QAAO7pB,KAAK6pB,MAAQC,EAAKpjB,MACvCojB,IAAS9pB,KAAK4pB,SAAQ5pB,KAAK4pB,OAASE,EAAKnpB,MAE7CmpB,EAAKpjB,KAAO,KACZojB,EAAKnpB,KAAO,KAGd,QAEE,MAAMkG,EAAS7G,KAAK4pB,OACpB,OAAK/iB,GAEL7G,KAAK4pB,OAAS/iB,EAAOlG,KACjBX,KAAK4pB,SAAQ5pB,KAAK4pB,OAAOljB,KAAO,MACpC1G,KAAK6pB,MAAQ7pB,KAAK4pB,OAAS5pB,KAAK6pB,MAAQ,KACjChjB,EAAO7K,OALM,MAUxB,MAAM+tB,GAAW,CACfC,SAAU,KACVC,OAAQ,IAAIN,GACZO,SAAU,IAAIP,GACdQ,WAAY,IAAIR,GAChBS,MAAO,IAAM/lB,EAAQC,OAAO+lB,aAAehmB,EAAQC,OAAOgmB,KAC1D7iB,WAAY,GAEZ,MAAMvB,GAEJ,MAAMnH,EAAOgrB,GAASE,OAAOppB,KAAK,CAChC0pB,IAAKrkB,IAQP,OAL0B,OAAtB6jB,GAASC,WACXD,GAASC,SAAW3lB,EAAQC,OAAOkmB,sBAAsBT,GAASU,QAI7D1rB,GAGT,QAAQmH,EAAI4S,GACVA,EAAQA,GAAS,EAEjB,MAAM4R,EAAOX,GAASK,QAAQO,MAAQ7R,EAEhC/Z,EAAOgrB,GAASG,SAASrpB,KAAK,CAClC0pB,IAAKrkB,EACLwkB,KAAMA,IAOR,OAJ0B,OAAtBX,GAASC,WACXD,GAASC,SAAW3lB,EAAQC,OAAOkmB,sBAAsBT,GAASU,QAG7D1rB,GAGT,UAAUmH,GAER,MAAMnH,EAAOgrB,GAASI,WAAWtpB,KAAKqF,GAMtC,OAJ0B,OAAtB6jB,GAASC,WACXD,GAASC,SAAW3lB,EAAQC,OAAOkmB,sBAAsBT,GAASU,QAG7D1rB,GAGT,YAAYA,GACF,MAARA,GAAgBgrB,GAASE,OAAOpjB,OAAO9H,IAGzC,aAAaA,GACH,MAARA,GAAgBgrB,GAASG,SAASrjB,OAAO9H,IAG3C,gBAAgBA,GACN,MAARA,GAAgBgrB,GAASI,WAAWtjB,OAAO9H,IAG7C,MAAM4rB,GAGJ,IAAIC,EAAc,KAClB,MAAMC,EAAcd,GAASG,SAAS7N,OAEtC,MAAOuO,EAAcb,GAASG,SAAShB,WAEjCyB,GAAOC,EAAYF,KACrBE,EAAYL,MAEZR,GAASG,SAASrpB,KAAK+pB,GAIrBA,IAAgBC,KAItB,IAAIC,EAAY,KAChB,MAAMC,EAAYhB,GAASE,OAAO5N,OAElC,KAAOyO,IAAcC,IAAcD,EAAYf,GAASE,OAAOf,UAC7D4B,EAAUP,IAAII,GAGhB,IAAIK,EAAgB,KAEpB,KAAOA,EAAgBjB,GAASI,WAAWjB,SACzC8B,IAIFjB,GAASC,SAAWD,GAASG,SAASe,SAAWlB,GAASE,OAAOgB,QAAU5mB,EAAQC,OAAOkmB,sBAAsBT,GAASU,OAAS,OAKhIS,GAAe,SAAUC,GAC7B,MAAMC,EAAQD,EAAWC,MACnBxS,EAAWuS,EAAWE,OAAOzS,WAEnC,MAAO,CACLwS,MAAOA,EACPxS,SAAUA,EACV0S,IAJUF,EAAQxS,EAKlByS,OAAQF,EAAWE,SAIjBE,GAAgB,WACpB,MAAM7W,EAAIrQ,EAAQC,OAClB,OAAQoQ,EAAE2V,aAAe3V,EAAE4V,MAAMK,OAGnC,MAAMa,WAAiBxT,GAErB,YAAYyT,EAAaF,IACvBpV,QACAnW,KAAK0rB,YAAcD,EAEnBzrB,KAAK2rB,WAAa,EAClB3rB,KAAK4rB,OAAS,EAEd5rB,KAAK6rB,SAAW,EAEhB7rB,KAAK8rB,WAAa,KAClB9rB,KAAK+rB,SAAU,EACf/rB,KAAKgsB,SAAW,GAChBhsB,KAAKisB,WAAa,GAClBjsB,KAAKksB,eAAiB,EACtBlsB,KAAKmsB,MAAQ,EACbnsB,KAAKosB,gBAAkB,EACvBpsB,KAAKqsB,cAAgB,EAErBrsB,KAAKssB,MAAQtsB,KAAKusB,QAAQhwB,KAAKyD,MAAM,GACrCA,KAAKwsB,eAAiBxsB,KAAKusB,QAAQhwB,KAAKyD,MAAM,GAGhD,SACE,QAASA,KAAK8rB,WAGhB,SAGE,OADA9rB,KAAK0qB,KAAK1qB,KAAKysB,uBAAyB,GACjCzsB,KAAK0sB,QAId,aACE,MAAMC,EAAiB3sB,KAAK4sB,oBACtBC,EAAeF,EAAiBA,EAAetB,OAAOzS,WAAa,EAEzE,OADsB+T,EAAiBA,EAAevB,MAAQprB,KAAKmsB,OAC5CU,EAGzB,uBACE,MAAMC,EAAW9sB,KAAKgsB,SAASrgB,IAAI5Q,GAAKA,EAAEqwB,MAAQrwB,EAAEswB,OAAOzS,YAE3D,OAAOtW,KAAKgG,IAAI,KAAMwkB,GAGxB,oBACE,OAAO9sB,KAAK+sB,kBAAkB/sB,KAAKksB,eAGrC,kBAAkB5R,GAChB,OAAOta,KAAKgsB,SAAShsB,KAAKisB,WAAWhjB,QAAQqR,KAAQ,KAGvD,QAEE,OADAta,KAAK+rB,SAAU,EACR/rB,KAAKgtB,YAGd,QAAQC,GACN,OAAmB,MAAfA,EAA4BjtB,KAAK6rB,UACrC7rB,KAAK6rB,SAAWoB,EACTjtB,MAGT,OAGE,OADAA,KAAK+rB,SAAU,EACR/rB,KAAKktB,aAAaF,YAG3B,QAAQG,GACN,MAAMC,EAAeptB,KAAKqtB,QAC1B,GAAW,MAAPF,EAAa,OAAOntB,KAAKqtB,OAAOD,GACpC,MAAME,EAAWhrB,KAAK4M,IAAIke,GAC1B,OAAOptB,KAAKqtB,MAAMF,GAAOG,EAAWA,GAItC,SAASjC,EAAQvS,EAAOyU,GACtB,GAAc,MAAVlC,EACF,OAAOrrB,KAAKgsB,SAASrgB,IAAIuf,IAM3B,IAAIsC,EAAoB,EACxB,MAAMC,EAAUztB,KAAK0tB,aAGrB,GAFA5U,EAAQA,GAAS,EAEL,MAARyU,GAAyB,SAATA,GAA4B,UAATA,EAErCC,EAAoBC,OACf,GAAa,aAATF,GAAgC,UAATA,EAChCC,EAAoB1U,EACpBA,EAAQ,OACH,GAAa,QAATyU,EACTC,EAAoBxtB,KAAKmsB,WACpB,GAAa,aAAToB,EAAqB,CAC9B,MAAMpC,EAAanrB,KAAK+sB,kBAAkB1B,EAAO/Q,IAE7C6Q,IACFqC,EAAoBrC,EAAWC,MAAQtS,EACvCA,EAAQ,OAEL,IAAa,cAATyU,EAKT,MAAM,IAAIvvB,MAAM,0CALe,CAC/B,MAAM2uB,EAAiB3sB,KAAK4sB,oBAE5BY,EADsBb,EAAiBA,EAAevB,MAAQprB,KAAKmsB,OAOrEd,EAAOsC,aACPtC,EAAO1S,SAAS3Y,MAChB,MAAM4tB,EAAUvC,EAAOuC,UACjBzC,EAAa,CACjByC,QAAqB,OAAZA,EAAmB5tB,KAAK6rB,SAAW+B,EAC5CxC,MAAOoC,EAAoB1U,EAC3BuS,UAYF,OAVArrB,KAAKksB,cAAgBb,EAAO/Q,GAE5Bta,KAAKgsB,SAASnrB,KAAKsqB,GAEnBnrB,KAAKgsB,SAAS/C,KAAK,CAAC9e,EAAG3K,IAAM2K,EAAEihB,MAAQ5rB,EAAE4rB,OAEzCprB,KAAKisB,WAAajsB,KAAKgsB,SAASrgB,IAAIkiB,GAAQA,EAAKxC,OAAO/Q,IAExDta,KAAKktB,aAAaF,YAEXhtB,KAGT,KAAKikB,GACH,OAAOjkB,KAAK0qB,KAAK1qB,KAAKmsB,MAAQlI,GAGhC,OAAO/d,GACL,OAAU,MAANA,EAAmBlG,KAAK0rB,aAC5B1rB,KAAK0rB,YAAcxlB,EACZlG,MAGT,MAAMqtB,GACJ,OAAa,MAATA,EAAsBrtB,KAAK4rB,QAC/B5rB,KAAK4rB,OAASyB,EACPrtB,MAGT,OAGE,OADAA,KAAK0qB,KAAK,GACH1qB,KAAK0sB,QAGd,KAAKhC,GACH,OAAY,MAARA,EAAqB1qB,KAAKmsB,OAC9BnsB,KAAKmsB,MAAQzB,EACN1qB,KAAKgtB,WAAU,IAIxB,WAAW3B,GACT,MAAM5kB,EAAQzG,KAAKisB,WAAWhjB,QAAQoiB,EAAO/Q,IAE7C,OAAI7T,EAAQ,IAEZzG,KAAKgsB,SAASnD,OAAOpiB,EAAO,GAE5BzG,KAAKisB,WAAWpD,OAAOpiB,EAAO,GAE9B4kB,EAAO1S,SAAS,OANM3Y,KAWxB,aAKE,OAJKA,KAAK8tB,WACR9tB,KAAKosB,gBAAkBpsB,KAAK0rB,eAGvB1rB,KAIT,UAAU+tB,GAAgB,GAGxB,OAFAhE,GAASiE,YAAYhuB,KAAK8rB,YAC1B9rB,KAAK8rB,WAAa,KACdiC,EAAsB/tB,KAAKwsB,kBAC3BxsB,KAAK+rB,UACT/rB,KAAK8rB,WAAa/B,GAASkE,MAAMjuB,KAAKssB,QADbtsB,MAK3B,QAAQ+tB,GAAgB,GAEtB,MAAMrD,EAAO1qB,KAAK0rB,cAElB,IAAIwC,EAAWxD,EAAO1qB,KAAKosB,gBACvB2B,IAAeG,EAAW,GAC9B,MAAMC,EAASnuB,KAAK4rB,OAASsC,GAAYluB,KAAKmsB,MAAQnsB,KAAKqsB,eAC3DrsB,KAAKosB,gBAAkB1B,EAGlBqD,IAEH/tB,KAAKmsB,OAASgC,EACdnuB,KAAKmsB,MAAQnsB,KAAKmsB,MAAQ,EAAI,EAAInsB,KAAKmsB,OAGzCnsB,KAAKqsB,cAAgBrsB,KAAKmsB,MAC1BnsB,KAAKouB,KAAK,OAAQpuB,KAAKmsB,OAWvB,IAAK,IAAIzhB,EAAI1K,KAAKgsB,SAAS3rB,OAAQqK,KAAM,CAEvC,MAAMygB,EAAanrB,KAAKgsB,SAASthB,GAC3B2gB,EAASF,EAAWE,OAGRrrB,KAAKmsB,MAAQhB,EAAWC,OAGzB,GACfC,EAAOgD,QAKX,IAAIC,GAAc,EAElB,IAAK,IAAIvzB,EAAI,EAAGmhB,EAAMlc,KAAKgsB,SAAS3rB,OAAQtF,EAAImhB,EAAKnhB,IAAK,CAExD,MAAMowB,EAAanrB,KAAKgsB,SAASjxB,GAC3BswB,EAASF,EAAWE,OAC1B,IAAIpH,EAAKkK,EAGT,MAAMI,EAAYvuB,KAAKmsB,MAAQhB,EAAWC,MAE1C,GAAImD,GAAa,EAAG,CAClBD,GAAc,EACd,SAMF,GALWC,EAAYtK,IAErBA,EAAKsK,IAGFlD,EAAOyC,SAAU,SAKtB,GAFiBzC,EAAO5H,KAAKQ,GAAIrjB,MAI1B,IAA2B,IAAvBuqB,EAAWyC,QAAkB,CAEtBvC,EAAOzS,WAAayS,EAAOX,OAAS1qB,KAAKmsB,MAE3ChB,EAAWyC,QAAU5tB,KAAKmsB,QAEtCd,EAAOsC,eACL5yB,IACAmhB,SATJoS,GAAc,EAuBlB,OAPIA,KAAiBtuB,KAAK4rB,OAAS,GAAoB,IAAf5rB,KAAKmsB,QAAgBnsB,KAAKisB,WAAW5rB,QAAUL,KAAK4rB,OAAS,GAAK5rB,KAAKmsB,MAAQ,EACrHnsB,KAAKgtB,aAELhtB,KAAK0sB,QACL1sB,KAAKouB,KAAK,aAGLpuB,MAIX0B,EAAgB,CACd4Q,QAAS,CACPqG,SAAU,SAAUA,GAClB,OAAgB,MAAZA,GACF3Y,KAAKwuB,UAAYxuB,KAAKwuB,WAAa,IAAIhD,GAChCxrB,KAAKwuB,YAEZxuB,KAAKwuB,UAAY7V,EACV3Y,UAMf,MAAMyuB,WAAezW,GACnB,YAAYV,GACVnB,QAEAnW,KAAKsa,GAAKmU,GAAOnU,KAIjBhD,EAA6B,mBAF7BA,EAAqB,MAAXA,EAAkBqB,GAASC,SAAWtB,GAEN,IAAIwM,GAAWxM,GAAWA,EAEpEtX,KAAK6e,SAAW,KAChB7e,KAAKwuB,UAAY,KACjBxuB,KAAKY,MAAO,EACZZ,KAAK0uB,OAAS,GAEd1uB,KAAKmkB,UAA+B,iBAAZ7M,GAAwBA,EAChDtX,KAAK2uB,eAAiBrX,aAAmBwM,GACzC9jB,KAAKioB,SAAWjoB,KAAK2uB,eAAiBrX,EAAU,IAAIuM,GAEpD7jB,KAAK4uB,SAAW,GAEhB5uB,KAAK6uB,SAAU,EACf7uB,KAAKmsB,MAAQ,EACbnsB,KAAK8uB,UAAY,EAEjB9uB,KAAK+uB,UAAW,EAEhB/uB,KAAKyH,WAAa,IAAIoH,GACtB7O,KAAKgvB,YAAc,EAEnBhvB,KAAKivB,eAAgB,EACrBjvB,KAAKkvB,UAAW,EAChBlvB,KAAKmvB,WAAa,EAClBnvB,KAAKovB,QAAS,EACdpvB,KAAKqvB,MAAQ,EACbrvB,KAAKsvB,OAAS,EACdtvB,KAAKuvB,SAAW,KAEhBvvB,KAAK6rB,WAAW7rB,KAAK2uB,gBAAwB,KAG/C,gBAAgB/V,EAAUE,EAAOyU,GAE/B,IAAIiC,EAAQ,EACRC,GAAQ,EACRC,EAAO,EAcX,OAZA5W,EAAQA,GAASH,GAASG,MAC1ByU,EAAOA,GAAQ,OAES,iBAJxB3U,EAAWA,GAAYD,GAASC,WAIMA,aAAoBgL,KACxD9K,EAAQF,EAASE,OAASA,EAC1ByU,EAAO3U,EAAS2U,MAAQA,EACxBkC,EAAQ7W,EAAS6W,OAASA,EAC1BD,EAAQ5W,EAAS4W,OAASA,EAC1BE,EAAO9W,EAAS8W,MAAQA,EACxB9W,EAAWA,EAASA,UAAYD,GAASC,UAGpC,CACLA,SAAUA,EACVE,MAAOA,EACP2W,MAAOA,EACPD,MAAOA,EACPE,KAAMA,EACNnC,KAAMA,GAIV,OAAOsB,GACL,OAAe,MAAXA,EAAwB7uB,KAAK6uB,SACjC7uB,KAAK6uB,QAAUA,EACR7uB,MAST,aAAayS,EAAWhM,GAEtB,OADAzG,KAAKyH,WAAW+J,WAAWiB,GACpBzS,KAGT,MAAMkG,GACJ,OAAOlG,KAAKmX,GAAG,WAAYjR,GAG7B,QAAQ0S,EAAUE,EAAOyU,GACvB,MAAM/xB,EAAIizB,GAAOkB,SAAS/W,EAAUE,EAAOyU,GACrClC,EAAS,IAAIoD,GAAOjzB,EAAEod,UAG5B,OAFI5Y,KAAKwuB,WAAWnD,EAAO1S,SAAS3Y,KAAKwuB,WACrCxuB,KAAK6e,UAAUwM,EAAOzsB,QAAQoB,KAAK6e,UAChCwM,EAAOuE,KAAKp0B,GAAGq0B,SAASr0B,EAAEsd,MAAOtd,EAAE+xB,MAG5C,iBAEE,OADAvtB,KAAKyH,WAAa,IAAIoH,GACf7O,KAIT,2BACOA,KAAKY,MAASZ,KAAKwuB,WAAcxuB,KAAKwuB,UAAUvC,WAAWloB,SAAS/D,KAAKsa,MAC5Eta,KAAK0uB,OAAS1uB,KAAK0uB,OAAOtsB,OAAO0nB,IACvBA,EAAKgG,cAKnB,MAAMhX,GACJ,OAAO9Y,KAAK+vB,QAAQ,EAAGjX,GAGzB,WACE,OAAO9Y,KAAKsvB,QAAUtvB,KAAKqvB,MAAQrvB,KAAKmkB,WAAankB,KAAKqvB,MAG5D,OAAOnpB,GACL,OAAOlG,KAAKgwB,MAAM,KAAM9pB,GAG1B,KAAKA,GAEH,OADAlG,KAAKioB,SAAW,IAAIpE,GAAK3d,GAClBlG,KAUT,QAAQpB,GACN,OAAe,MAAXA,EAAwBoB,KAAK6e,UACjC7e,KAAK6e,SAAWjgB,EAEhBA,EAAQqxB,iBAEDjwB,MAGT,SACE,OAAOA,KAAKyjB,KAAK3O,KAGnB,KAAK0a,EAAOC,EAAOC,GAiBjB,MAfqB,iBAAVF,IACTC,EAAQD,EAAMC,MACdC,EAAOF,EAAME,KACbF,EAAQA,EAAMA,OAIhBxvB,KAAKsvB,OAASE,GAAS1a,IACvB9U,KAAKovB,OAASK,IAAS,EACvBzvB,KAAKqvB,MAAQK,GAAQ,GAED,IAAhB1vB,KAAKsvB,SACPtvB,KAAKsvB,OAASxa,KAGT9U,KAGT,MAAMnD,GACJ,MAAMqzB,EAAelwB,KAAKmkB,UAAYnkB,KAAKqvB,MAE3C,GAAS,MAALxyB,EAAW,CACb,MAAMszB,EAAY7tB,KAAKohB,MAAM1jB,KAAKmsB,MAAQ+D,GAEpC1pB,GADexG,KAAKmsB,MAAQgE,EAAYD,GACdlwB,KAAKmkB,UACrC,OAAO7hB,KAAKiG,IAAI4nB,EAAY3pB,EAAUxG,KAAKsvB,QAG7C,MACMc,EAAUvzB,EAAI,EACd6tB,EAAOwF,EAFC5tB,KAAKohB,MAAM7mB,GAEWmD,KAAKmkB,UAAYiM,EACrD,OAAOpwB,KAAK0qB,KAAKA,GAGnB,QAAQuC,GACN,OAAmB,MAAfA,EAA4BjtB,KAAK6rB,UACrC7rB,KAAK6rB,SAAWoB,EACTjtB,MAGT,SAASnD,GAEP,MAAM8G,EAAI3D,KAAKmsB,MACT9wB,EAAI2E,KAAKmkB,UACTzP,EAAI1U,KAAKqvB,MACTpzB,EAAI+D,KAAKsvB,OACTxyB,EAAIkD,KAAKovB,OACTvzB,EAAImE,KAAKkvB,SACf,IAAI1oB,EAEJ,GAAS,MAAL3J,EAAW,CAQb,MAAMkS,EAAI,SAAUpL,GAClB,MAAM0sB,EAAWvzB,EAAIwF,KAAKohB,MAAM/f,GAAK,GAAK+Q,EAAIrZ,KAAOqZ,EAAIrZ,IACnDi1B,EAAYD,IAAax0B,IAAMw0B,GAAYx0B,EAC3C00B,EAAWjuB,KAAKmL,KAAK,EAAG6iB,IAAc3sB,GAAK+Q,EAAIrZ,IAAMA,EAAIi1B,EAE/D,OADgBhuB,KAAKgG,IAAIhG,KAAKiG,IAAIgoB,EAAU,GAAI,IAK5C9C,EAAUxxB,GAAKyY,EAAIrZ,GAAKqZ,EAE9B,OADAlO,EAAW7C,GAAK,EAAIrB,KAAK+F,MAAM0G,EAAE,OAASpL,EAAI8pB,EAAU1e,EAAEpL,GAAKrB,KAAK+F,MAAM0G,EAAE0e,EAAU,OAC/EjnB,EAIT,MAAM2pB,EAAY7tB,KAAKohB,MAAM1jB,KAAKwwB,SAC5BC,EAAe3zB,GAAKqzB,EAAY,GAAM,EAG5C,OADA3pB,EAAW2pB,GADMM,IAAiB50B,GAAKA,GAAK40B,EACT5zB,EAAI,EAAIA,GACpCmD,KAAKwwB,MAAMhqB,GAGpB,SAAS3J,GACP,OAAS,MAALA,EACKyF,KAAKiG,IAAI,EAAGvI,KAAKmsB,MAAQnsB,KAAK4Y,YAGhC5Y,KAAK0qB,KAAK7tB,EAAImD,KAAK4Y,YAS5B,MAAM8X,EAAQC,EAAOC,EAAYd,GAC/B9vB,KAAK0uB,OAAO7tB,KAAK,CACfgwB,YAAaH,GAAUhY,GACvB2S,OAAQsF,GAASjY,GACjBoY,SAAUF,EACVd,YAAaA,EACbiB,aAAa,EACbC,UAAU,IAKZ,OAFiBhxB,KAAK2Y,YACV3Y,KAAK2Y,WAAWqU,YACrBhtB,KAGT,QACE,OAAIA,KAAK+uB,WACT/uB,KAAK0qB,KAAK,GACV1qB,KAAK+uB,UAAW,GAFU/uB,KAM5B,QAAQqf,GAEN,OADArf,KAAKkvB,SAAsB,MAAX7P,GAAmBrf,KAAKkvB,SAAW7P,EAC5Crf,KAGT,SAAS2Y,EAAUG,EAAOyU,GASxB,GAPM5U,aAAoB6S,KACxB+B,EAAOzU,EACPA,EAAQH,EACRA,EAAW3Y,KAAK2Y,aAIbA,EACH,MAAM3a,MAAM,+CAKd,OADA2a,EAASkX,SAAS7vB,KAAM8Y,EAAOyU,GACxBvtB,KAGT,KAAKikB,GAEH,IAAKjkB,KAAK6uB,QAAS,OAAO7uB,KAE1BikB,EAAW,MAANA,EAAa,GAAKA,EACvBjkB,KAAKmsB,OAASlI,EACd,MAAMzd,EAAWxG,KAAKwG,WAEhByqB,EAAUjxB,KAAKkxB,gBAAkB1qB,GAAYxG,KAAKmsB,OAAS,EACjEnsB,KAAKkxB,cAAgB1qB,EAErB,MAAMoS,EAAW5Y,KAAK4Y,WAChBuY,EAAcnxB,KAAK8uB,WAAa,GAAK9uB,KAAKmsB,MAAQ,EAClDiF,EAAepxB,KAAK8uB,UAAYlW,GAAY5Y,KAAKmsB,OAASvT,EAChE5Y,KAAK8uB,UAAY9uB,KAAKmsB,MAElBgF,GACFnxB,KAAKouB,KAAK,QAASpuB,MAMrB,MAAMqxB,EAAcrxB,KAAK2uB,eACzB3uB,KAAKY,MAAQywB,IAAgBD,GAAgBpxB,KAAKmsB,OAASvT,EAE3D5Y,KAAK+uB,UAAW,EAChB,IAAIuC,GAAY,EAmBhB,OAjBIL,GAAWI,KACbrxB,KAAKuxB,YAAYN,GAGjBjxB,KAAKyH,WAAa,IAAIoH,GACtByiB,EAAYtxB,KAAKwxB,KAAKH,EAAcpN,EAAKzd,GACzCxG,KAAKouB,KAAK,OAAQpuB,OAKpBA,KAAKY,KAAOZ,KAAKY,MAAQ0wB,GAAaD,EAElCD,GACFpxB,KAAKouB,KAAK,WAAYpuB,MAGjBA,KAST,KAAK0qB,GACH,GAAY,MAARA,EACF,OAAO1qB,KAAKmsB,MAGd,MAAMlI,EAAKyG,EAAO1qB,KAAKmsB,MAEvB,OADAnsB,KAAKyjB,KAAKQ,GACHjkB,KAGT,SAAS2Y,GAEP,YAAwB,IAAbA,EAAiC3Y,KAAKwuB,WACjDxuB,KAAKwuB,UAAY7V,EACV3Y,MAGT,aACE,MAAM2Y,EAAW3Y,KAAK2Y,WAEtB,OADAA,GAAYA,EAASgV,WAAW3tB,MACzBA,KAIT,YAAYixB,GAEV,GAAKA,GAAYjxB,KAAK2uB,eAEtB,IAAK,IAAI5zB,EAAI,EAAGmhB,EAAMlc,KAAK0uB,OAAOruB,OAAQtF,EAAImhB,IAAOnhB,EAAG,CAEtD,MAAM8gB,EAAU7b,KAAK0uB,OAAO3zB,GAEtB02B,EAAUzxB,KAAK2uB,iBAAmB9S,EAAQkV,aAAeE,EAC/DA,GAAWpV,EAAQmV,SAEfS,GAAWR,IACbpV,EAAQgV,YAAY31B,KAAK8E,MACzB6b,EAAQkV,aAAc,IAM5B,iBAAiBW,EAAQC,GAWvB,GAVA3xB,KAAK4uB,SAAS8C,GAAU,CACtBC,QAASA,EACTC,OAAQ5xB,KAAK0uB,OAAO1uB,KAAK0uB,OAAOruB,OAAS,IAQvCL,KAAK2uB,eAAgB,CACvB,MAAMhW,EAAW3Y,KAAK2Y,WACtBA,GAAYA,EAASkZ,QAMzB,KAAKC,GAEH,IAAIC,GAAc,EAElB,IAAK,IAAIh3B,EAAI,EAAGmhB,EAAMlc,KAAK0uB,OAAOruB,OAAQtF,EAAImhB,IAAOnhB,EAAG,CAEtD,MAAM8gB,EAAU7b,KAAK0uB,OAAO3zB,GAGtBu2B,EAAYzV,EAAQwP,OAAOnwB,KAAK8E,KAAM8xB,GAC5CjW,EAAQmV,SAAWnV,EAAQmV,WAA0B,IAAdM,EACvCS,EAAcA,GAAelW,EAAQmV,SAIvC,OAAOe,EAIT,aAAaL,EAAQ1N,EAAQgO,GAC3B,GAAIhyB,KAAK4uB,SAAS8C,GAAS,CAEzB,IAAK1xB,KAAK4uB,SAAS8C,GAAQE,OAAOb,YAAa,CAC7C,MAAMtqB,EAAQzG,KAAK0uB,OAAOzlB,QAAQjJ,KAAK4uB,SAAS8C,GAAQE,QAIxD,OAFA5xB,KAAK0uB,OAAO7F,OAAOpiB,EAAO,IAEnB,EAKLzG,KAAK4uB,SAAS8C,GAAQE,OAAOd,SAC/B9wB,KAAK4uB,SAAS8C,GAAQE,OAAOd,SAAS51B,KAAK8E,KAAMgkB,EAAQgO,GAGzDhyB,KAAK4uB,SAAS8C,GAAQC,QAAQ3wB,GAAGgjB,GAGnChkB,KAAK4uB,SAAS8C,GAAQE,OAAOZ,UAAW,EACxC,MAAMrY,EAAW3Y,KAAK2Y,WAEtB,OADAA,GAAYA,EAASkZ,QACd,EAGT,OAAO,GAIXpD,GAAOnU,GAAK,EACZ,MAAM2X,GACJ,YAAYxqB,EAAa,IAAIoH,GAAUyL,GAAK,EAAI1Z,GAAO,GACrDZ,KAAKyH,WAAaA,EAClBzH,KAAKsa,GAAKA,EACVta,KAAKY,KAAOA,EAGd,6BAGFmF,EAAO,CAAC0oB,GAAQwD,IAAa,CAC3B,UAAU5G,GACR,OAAO,IAAI4G,GAAW5G,EAAO5jB,WAAW6X,UAAUtf,KAAKyH,YAAa4jB,EAAO/Q,OAK/E,MAAMgF,GAAY,CAACjD,EAAMC,IAASD,EAAK7K,WAAW8K,GAE5C4V,GAAqB7G,GAAUA,EAAO5jB,WAE5C,SAAS0qB,KAEP,MACMC,EADUpyB,KAAKqyB,uBAAuBC,QACf3mB,IAAIumB,IAAoBzb,OAAO6I,GAAW,IAAIzQ,IAC3E7O,KAAKyS,UAAU2f,GAEfpyB,KAAKqyB,uBAAuBE,QAEiB,IAAzCvyB,KAAKqyB,uBAAuBhyB,WAC9BL,KAAKuvB,SAAW,MAIpB,MAAMiD,GACJ,cACExyB,KAAKsyB,QAAU,GACftyB,KAAKyyB,IAAM,GAGb,IAAIpH,GACF,GAAIrrB,KAAKsyB,QAAQvuB,SAASsnB,GAAS,OACnC,MAAM/Q,EAAK+Q,EAAO/Q,GAAK,EAGvB,OAFAta,KAAKsyB,QAAQzxB,KAAKwqB,GAClBrrB,KAAKyyB,IAAI5xB,KAAKyZ,GACPta,KAGT,YAAYsa,GACV,MAAMoY,EAAY1yB,KAAKyyB,IAAIxpB,QAAQqR,EAAK,IAAM,EAG9C,OAFAta,KAAKyyB,IAAI5J,OAAO,EAAG6J,EAAW,GAC9B1yB,KAAKsyB,QAAQzJ,OAAO,EAAG6J,EAAW,IAAIT,IAAcroB,QAAQ/N,GAAKA,EAAE82B,4BAC5D3yB,KAGT,KAAKsa,EAAIsY,GACP,MAAMnsB,EAAQzG,KAAKyyB,IAAIxpB,QAAQqR,EAAK,GAGpC,OAFAta,KAAKyyB,IAAI5J,OAAOpiB,EAAO,EAAG6T,EAAK,GAC/Bta,KAAKsyB,QAAQzJ,OAAOpiB,EAAO,EAAGmsB,GACvB5yB,KAGT,QAAQsa,GACN,OAAOta,KAAKsyB,QAAQtyB,KAAKyyB,IAAIxpB,QAAQqR,EAAK,IAG5C,SACE,OAAOta,KAAKyyB,IAAIpyB,OAGlB,QACE,IAAIwyB,EAAa,KAEjB,IAAK,IAAI93B,EAAI,EAAGA,EAAIiF,KAAKsyB,QAAQjyB,SAAUtF,EAAG,CAC5C,MAAMswB,EAASrrB,KAAKsyB,QAAQv3B,GAI5B,GAHkB83B,GAAcxH,EAAOzqB,MAAQiyB,EAAWjyB,QACrDyqB,EAAOmD,YAAcnD,EAAOmD,UAAUvC,WAAWloB,SAASsnB,EAAO/Q,QAAUuY,EAAWrE,YAAcqE,EAAWrE,UAAUvC,WAAWloB,SAAS8uB,EAAWvY,KAE9I,CAEbta,KAAK6G,OAAOwkB,EAAO/Q,IACnB,MAAMsY,EAAYvH,EAAOyH,UAAUD,GACnC7yB,KAAK+yB,KAAKF,EAAWvY,GAAIsY,GACzBC,EAAaD,IACX73B,OAEF83B,EAAaxH,EAIjB,OAAOrrB,KAGT,OAAOsa,GACL,MAAM7T,EAAQzG,KAAKyyB,IAAIxpB,QAAQqR,EAAK,GAGpC,OAFAta,KAAKyyB,IAAI5J,OAAOpiB,EAAO,GACvBzG,KAAKsyB,QAAQzJ,OAAOpiB,EAAO,GACpBzG,MAIX0B,EAAgB,CACd4Q,QAAS,CACP,QAAQsG,EAAUE,EAAOyU,GACvB,MAAM/xB,EAAIizB,GAAOkB,SAAS/W,EAAUE,EAAOyU,GACrC5U,EAAW3Y,KAAK2Y,WACtB,OAAO,IAAI8V,GAAOjzB,EAAEod,UAAUgX,KAAKp0B,GAAGoD,QAAQoB,MAAM2Y,SAASA,EAASkZ,QAAQhC,SAASr0B,EAAEsd,MAAOtd,EAAE+xB,OAGpG,MAAMyF,EAAIzF,GACR,OAAOvtB,KAAK+vB,QAAQ,EAAGiD,EAAIzF,IAO7B,6BAA6B0F,GAC3BjzB,KAAKqyB,uBAAuBa,YAAYD,EAAc3Y,KAGxD,kBAAkBuB,GAChB,OAAO7b,KAAKqyB,uBAAuBC,QAGlClwB,OAAOipB,GAAUA,EAAO/Q,IAAMuB,EAAQvB,IAAI3O,IAAIumB,IAAoBzb,OAAO6I,GAAW,IAAIzQ,KAG3F,WAAWwc,GACTrrB,KAAKqyB,uBAAuBzrB,IAAIykB,GAKhCtB,GAASoJ,gBAAgBnzB,KAAKuvB,UAC9BvvB,KAAKuvB,SAAWxF,GAASqJ,UAAUjB,GAAgB51B,KAAKyD,QAG1D,iBACuB,MAAjBA,KAAKuvB,WACPvvB,KAAKqyB,wBAAyB,IAAIG,IAAc5rB,IAAI,IAAIqrB,GAAW,IAAIpjB,GAAO7O,aAStF+F,EAAO0oB,GAAQ,CACb,KAAKtkB,EAAGC,GACN,OAAOpK,KAAKqzB,UAAU,OAAQlpB,EAAGC,IAInC,IAAItN,EAAGsN,GACL,OAAOpK,KAAKqzB,UAAU,MAAOv2B,EAAGsN,IAGlC,UAAUmO,EAAM+a,EAAa9pB,GAC3B,GAA2B,iBAAhB8pB,EACT,OAAOtzB,KAAKqzB,UAAU9a,EAAM,CAC1B,CAAC+a,GAAc9pB,IAInB,IAAImN,EAAQ2c,EACZ,GAAItzB,KAAKuzB,aAAahb,EAAM5B,GAAQ,OAAO3W,KAC3C,IAAI2xB,EAAU,IAAI3J,GAAUhoB,KAAKioB,UAAUjnB,GAAG2V,GAC1C8G,EAAOhiB,OAAOgiB,KAAK9G,GAkCvB,OAjCA3W,KAAKgwB,OAAM,WACT2B,EAAUA,EAAQ1wB,KAAKjB,KAAKpB,UAAU2Z,GAAMkF,OAC3C,SAAU0F,GAEX,OADAnjB,KAAKpB,UAAU2Z,GAAMoZ,EAAQ6B,GAAGrQ,GAAK1J,WAC9BkY,EAAQ/wB,UACd,SAAU6yB,GAEX,MAAMC,EAAUj4B,OAAOgiB,KAAKgW,GACtBE,GA/BWn0B,EA+BuBie,EAATiW,EA/BNtxB,OAAOuB,IAAMnE,EAAEuE,SAASJ,KAApC,IAAInE,EAiCjB,GAAIm0B,EAAYtzB,OAAQ,CAEtB,MAAMuzB,EAAiB5zB,KAAKpB,UAAU2Z,GAAMob,GAEtCE,EAAe,IAAI9L,GAAU4J,EAAQ1wB,QAAQwY,UAEnDhe,OAAO0E,OAAO0zB,EAAcD,GAC5BjC,EAAQ1wB,KAAK4yB,GAIf,MAAMC,EAAa,IAAI/L,GAAU4J,EAAQ3wB,MAAMyY,UAE/Che,OAAO0E,OAAO2zB,EAAYL,GAE1B9B,EAAQ3wB,GAAG8yB,GAEXrW,EAAOiW,EACP/c,EAAQ8c,KAGVzzB,KAAK+zB,iBAAiBxb,EAAMoZ,GAErB3xB,MAGT,KAAKuV,EAAOC,GACV,GAAIxV,KAAKuzB,aAAa,OAAQhe,EAAOC,GAAQ,OAAOxV,KACpD,IAAI2xB,EAAU,IAAI3J,GAAUhoB,KAAKioB,UAAUjnB,GAAG,IAAIqY,GAAU9D,IAa5D,OAZAvV,KAAKgwB,OAAM,WACT2B,EAAUA,EAAQ1wB,KAAKjB,KAAKpB,UAAUiX,WACrC,SAAUsN,GAEX,OADAnjB,KAAKpB,UAAUiX,KAAK8b,EAAQ6B,GAAGrQ,GAAM3N,GAC9Bmc,EAAQ/wB,UACd,SAAUozB,EAAUC,GACrBze,EAAQye,EACRtC,EAAQ3wB,GAAGgzB,MAGbh0B,KAAK+zB,iBAAiB,OAAQpC,GAEvB3xB,MAkBT,UAAUyH,EAAYmJ,EAAUsjB,GAI9B,GAFAtjB,EAAWnJ,EAAWmJ,UAAYA,EAE9B5Q,KAAK2uB,iBAAmB/d,GAAY5Q,KAAKuzB,aAAa,YAAa9rB,GACrE,OAAOzH,KAIT,MAAMm0B,EAAWtlB,GAAOC,aAAarH,GACrCysB,EAA8B,MAArBzsB,EAAWysB,OAAiBzsB,EAAWysB,OAAmB,MAAVA,EAAiBA,GAAUC,EAEpF,MAAMxC,EAAU,IAAI3J,GAAUhoB,KAAKioB,UAAU1P,KAAK2b,EAASxL,GAAe7Z,IAC1E,IAAIvL,EACA1E,EACAid,EACAuY,EACAC,EAiFJ,OAFAr0B,KAAKgwB,OA7EL,WAEEpxB,EAAUA,GAAWoB,KAAKpB,UAC1B0E,EAASA,GAAUD,EAAUoE,EAAY7I,GACzCy1B,EAAiB,IAAIxlB,GAAO+B,OAAW0jB,EAAY11B,GAEnDA,EAAQ21B,WAAWv0B,MAGd4Q,GACHhS,EAAQ41B,6BAA6Bx0B,SAIzC,SAAamjB,GAGNvS,GAAU5Q,KAAKy0B,iBACpB,MAAM,EACJ9wB,EAAC,EACDC,GACE,IAAI,GAAMN,GAAQmP,UAAU7T,EAAQ81B,kBAAkB10B,OAC1D,IAAIgkB,EAAS,IAAInV,GAAO,IAAKpH,EAC3BnE,OAAQ,CAACK,EAAGC,KAEVwnB,EAAQprB,KAAK2uB,gBAAkB9S,EAAUA,EAAUwY,EAEvD,GAAIH,EAAQ,CACVlQ,EAASA,EAAOpE,UAAUjc,EAAGC,GAC7BwnB,EAAQA,EAAMxL,UAAUjc,EAAGC,GAE3B,MAAM+wB,EAAU3Q,EAAOhU,OACjB4kB,EAAWxJ,EAAMpb,OAEjB6kB,EAAgB,CAACF,EAAU,IAAKA,EAASA,EAAU,KACnDG,EAAYD,EAAclpB,IAAIxB,GAAK7H,KAAK4M,IAAI/E,EAAIyqB,IAChDG,EAAWzyB,KAAKiG,OAAOusB,GACvBruB,EAAQquB,EAAU7rB,QAAQ8rB,GAChC/Q,EAAOhU,OAAS6kB,EAAcpuB,GAG5BmK,IAGGujB,IACHnQ,EAAOhU,OAASvI,EAAWuI,QAAU,GAGnChQ,KAAK2uB,gBAAkByF,IACzBhJ,EAAMpb,OAASokB,IAInBzC,EAAQ1wB,KAAKmqB,GACbuG,EAAQ3wB,GAAGgjB,GACX,MAAMgR,EAAmBrD,EAAQ6B,GAAGrQ,GAOpC,OANAiR,EAAeY,EAAiBhlB,OAChC6L,EAAU,IAAIhN,GAAOmmB,GACrBh1B,KAAKi1B,aAAapZ,GAElBjd,EAAQ21B,WAAWv0B,MAEZ2xB,EAAQ/wB,UAGjB,SAAkBs0B,IAEXA,EAAc5xB,QAAU,UAAUkF,cAAgBf,EAAWnE,QAAU,UAAUkF,aACpFlF,EAASD,EAAU6xB,EAAet2B,IAIpC6I,EAAa,IAAKytB,EAChB5xB,aAI6B,GACjCtD,KAAK2uB,gBAAkB3uB,KAAK+zB,iBAAiB,YAAapC,GACnD3xB,MAIT,EAAE2D,EAAGiN,GACH,OAAO5Q,KAAKm1B,aAAa,IAAKxxB,IAIhC,EAAEC,GACA,OAAO5D,KAAKm1B,aAAa,IAAKvxB,IAGhC,GAAGD,EAAI,GACL,OAAO3D,KAAKo1B,kBAAkB,IAAKzxB,IAGrC,GAAGC,EAAI,GACL,OAAO5D,KAAKo1B,kBAAkB,IAAKxxB,IAGrC,MAAMD,EAAGC,GACP,OAAO5D,KAAKqR,GAAG1N,GAAG2N,GAAG1N,IAGvB,kBAAkB8tB,EAAQ1wB,GAGxB,GAFAA,EAAK,IAAIqY,GAAUrY,GAEfhB,KAAKuzB,aAAa7B,EAAQ1wB,GAAK,OAAOhB,KAE1C,MAAM2xB,EAAU,IAAI3J,GAAUhoB,KAAKioB,UAAUjnB,GAAGA,GAChD,IAAIC,EAAO,KAcX,OAbAjB,KAAKgwB,OAAM,WACT/uB,EAAOjB,KAAKpB,UAAU8yB,KACtBC,EAAQ1wB,KAAKA,GACb0wB,EAAQ3wB,GAAGC,EAAOD,MACjB,SAAUmiB,GAEX,OADAnjB,KAAKpB,UAAU8yB,GAAQC,EAAQ6B,GAAGrQ,IAC3BwO,EAAQ/wB,UACd,SAAUy0B,GACX1D,EAAQ3wB,GAAGC,EAAO,IAAIoY,GAAUgc,OAGlCr1B,KAAK+zB,iBAAiBrC,EAAQC,GAEvB3xB,MAGT,aAAa0xB,EAAQ1wB,GAEnB,GAAIhB,KAAKuzB,aAAa7B,EAAQ1wB,GAAK,OAAOhB,KAE1C,MAAM2xB,EAAU,IAAI3J,GAAUhoB,KAAKioB,UAAUjnB,GAAGA,GAUhD,OATAhB,KAAKgwB,OAAM,WACT2B,EAAQ1wB,KAAKjB,KAAKpB,UAAU8yB,SAC3B,SAAUvO,GAEX,OADAnjB,KAAKpB,UAAU8yB,GAAQC,EAAQ6B,GAAGrQ,IAC3BwO,EAAQ/wB,UAGjBZ,KAAK+zB,iBAAiBrC,EAAQC,GAEvB3xB,MAGT,aAAa0xB,EAAQ11B,GACnB,OAAOgE,KAAKs1B,aAAa5D,EAAQ,IAAIrY,GAAUrd,KAIjD,GAAG2H,GACD,OAAO3D,KAAKm1B,aAAa,KAAMxxB,IAIjC,GAAGC,GACD,OAAO5D,KAAKm1B,aAAa,KAAMvxB,IAIjC,KAAKD,EAAGC,GACN,OAAO5D,KAAK2D,EAAEA,GAAGC,EAAEA,IAIrB,OAAOD,EAAGC,GACR,OAAO5D,KAAKiR,GAAGtN,GAAGuN,GAAGtN,IAIvB,KAAKX,EAAOC,GAEV,IAAIC,EAcJ,OAZKF,GAAUC,IACbC,EAAMnD,KAAK6e,SAASzb,QAGjBH,IACHA,EAAQE,EAAIF,MAAQE,EAAID,OAASA,GAG9BA,IACHA,EAASC,EAAID,OAASC,EAAIF,MAAQA,GAG7BjD,KAAKiD,MAAMA,GAAOC,OAAOA,IAIlC,MAAMD,GACJ,OAAOjD,KAAKm1B,aAAa,QAASlyB,IAIpC,OAAOC,GACL,OAAOlD,KAAKm1B,aAAa,SAAUjyB,IAIrC,KAAKiH,EAAG3K,EAAGpE,EAAGC,GAEZ,GAAyB,IAArB+E,UAAUC,OACZ,OAAOL,KAAK4iB,KAAK,CAACzY,EAAG3K,EAAGpE,EAAGC,IAG7B,GAAI2E,KAAKuzB,aAAa,OAAQppB,GAAI,OAAOnK,KACzC,MAAM2xB,EAAU,IAAI3J,GAAUhoB,KAAKioB,UAAU1P,KAAKvY,KAAK6e,SAAS2D,YAAYxhB,GAAGmJ,GAW/E,OAVAnK,KAAKgwB,OAAM,WACT2B,EAAQ1wB,KAAKjB,KAAK6e,SAASzgB,YAC1B,SAAU+kB,GAGX,OAFAnjB,KAAK6e,SAAS+D,KAAK+O,EAAQ6B,GAAGrQ,IAEvBwO,EAAQ/wB,UAGjBZ,KAAK+zB,iBAAiB,OAAQpC,GAEvB3xB,MAIT,QAAQhE,GACN,OAAOgE,KAAKm1B,aAAa,UAAWn5B,IAItC,QAAQ2H,EAAGC,EAAGX,EAAOC,GACnB,OAAOlD,KAAKs1B,aAAa,UAAW,IAAIjhB,GAAI1Q,EAAGC,EAAGX,EAAOC,KAG3D,OAAO1H,GACL,MAAiB,iBAANA,EACFwE,KAAKshB,OAAO,CACjBpI,OAAQ9Y,UAAU,GAClB6K,MAAO7K,UAAU,GACjB6Y,QAAS7Y,UAAU,MAIN,MAAb5E,EAAEyd,SAAiBjZ,KAAKoG,KAAK,eAAgB5K,EAAEyd,SACpC,MAAXzd,EAAEyP,OAAejL,KAAKoG,KAAK,aAAc5K,EAAEyP,OAC/B,MAAZzP,EAAE0d,QAAgBlZ,KAAKoG,KAAK,SAAU5K,EAAE0d,QACrClZ,SAIX+F,EAAO0oB,GAAQ,CACb5d,MACAE,MACA9P,QACAD,QAEF2E,EAAS8oB,GAAQ,UAEjB,MAAM8G,WAAY1V,GAChB,YAAY9gB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,MAAOrG,GAAO4X,GAC9B3W,KAAK6X,YAIP,OACE,OAAK7X,KAAKme,SACH7Y,EAAMtF,KAAKjB,KAAK+F,cAAc,UAAY9E,KAAKga,IAAI,IAAIgG,IADnChgB,KAAKyE,OAAO4Y,OAIzC,SACE,OAAQrd,KAAKjB,KAAKiV,cAAgBhU,KAAKjB,KAAKiV,sBAAsB3P,EAAQC,OAAOuV,aAAiD,uBAAlC7Z,KAAKjB,KAAKiV,WAAWxO,SAIvH,YACE,OAAKxF,KAAKme,SACHne,KAAKoG,KAAK,CACflC,MAAOF,EACPwxB,QAAS,QACRpvB,KAAK,cAAejC,EAAOD,GAAOkC,KAAK,cAAehC,EAAOF,GAJrClE,KAAKyE,OAAOoT,YAOzC,kBACE,OAAO7X,KAAKoG,KAAK,CACflC,MAAO,KACPsxB,QAAS,OACRpvB,KAAK,cAAe,KAAMlC,GAAOkC,KAAK,cAAe,KAAMlC,GAKhE,OACE,OAAIlE,KAAKme,SAAiBne,KACnBmW,MAAM1R,QAIjB/C,EAAgB,CACdme,UAAW,CAET4V,OAAQxvB,GAAkB,WACxB,OAAOjG,KAAKga,IAAI,IAAIub,UAI1B5vB,EAAS4vB,GAAK,OAAO,GAErB,MAAM,WAAe1V,GAEnB,YAAY9gB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,SAAUrG,GAAO4X,IAIrCjV,EAAgB,CACdme,UAAW,CACTphB,OAAQwH,GAAkB,WACxB,OAAOjG,KAAKga,IAAI,IAAI,UAI1BrU,EAAS,GAAQ,UAuEjB,IAAI+vB,GAAW,CACbh2B,UAAW,KACXi2B,MAvEF,SAAela,GAQb,OANoB,IAAhBzb,KAAK41B,QACP51B,KAAKohB,QAIPphB,KAAKjB,KAAK+a,YAAYzV,EAAQE,SAASsxB,eAAepa,IAC/Czb,MAgEPK,OA7DF,WACE,OAAOL,KAAKjB,KAAK+2B,yBA6DjBnyB,EAxDF,SAAaA,EAAGR,EAAMnD,KAAKoD,QACzB,OAAS,MAALO,EACKR,EAAIQ,EAGN3D,KAAKoG,KAAK,IAAKpG,KAAKoG,KAAK,KAAOzC,EAAIR,EAAIQ,IAoD/CC,EAjDF,SAAaA,EAAGT,EAAMnD,KAAKoD,QACzB,OAAS,MAALQ,EACKT,EAAIS,EAGN5D,KAAKoG,KAAK,IAAKpG,KAAKoG,KAAK,KAAOxC,EAAIT,EAAIS,IA6C/Cgd,KA3CF,SAAgBjd,EAAGC,EAAGT,EAAMnD,KAAKoD,QAC/B,OAAOpD,KAAK2D,EAAEA,EAAGR,GAAKS,EAAEA,EAAGT,IA2C3B8N,GAxCF,SAAYtN,EAAGR,EAAMnD,KAAKoD,QACxB,OAAS,MAALO,EACKR,EAAI8N,GAGNjR,KAAKoG,KAAK,IAAKpG,KAAKoG,KAAK,KAAOzC,EAAIR,EAAI8N,KAoC/CC,GAjCF,SAAYtN,EAAGT,EAAMnD,KAAKoD,QACxB,OAAS,MAALQ,EACKT,EAAI+N,GAGNlR,KAAKoG,KAAK,IAAKpG,KAAKoG,KAAK,KAAOxC,EAAIT,EAAI+N,KA6B/C6kB,OA3BF,SAAgBpyB,EAAGC,EAAGT,EAAMnD,KAAKoD,QAC/B,OAAOpD,KAAKiR,GAAGtN,EAAGR,GAAK+N,GAAGtN,EAAGT,IA2B7B6yB,GAzBF,SAAYryB,GACV,OAAO3D,KAAKoG,KAAK,IAAKzC,IAyBtBsyB,GAvBF,SAAYryB,GACV,OAAO5D,KAAKoG,KAAK,IAAKxC,IAuBtBsyB,MArBF,SAAevyB,EAAGC,GAChB,OAAO5D,KAAKg2B,GAAGryB,GAAGsyB,GAAGryB,IAqBrBuyB,MAlBF,SAAeA,GAEb,OADAn2B,KAAK41B,SAAWO,EACTn2B,OAmBT,MAAMo2B,WAAanW,GAEjB,YAAYlhB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,OAAQrG,GAAO4X,GAC/B3W,KAAKkd,IAAIN,QAAU,IAAIvD,GAAU,KAEjCrZ,KAAKq2B,UAAW,EAEhBr2B,KAAK41B,QAAS,EAIhB,QAAQ55B,GAEN,OAAa,MAATA,EACKgE,KAAKkd,IAAIN,SAIlB5c,KAAKkd,IAAIN,QAAU,IAAIvD,GAAUrd,GAC1BgE,KAAK+c,WAId,QAAQA,GAON,GALuB,kBAAZA,IACT/c,KAAKq2B,SAAWtZ,GAId/c,KAAKq2B,SAAU,CACjB,MAAMC,EAAOt2B,KACb,IAAIu2B,EAAkB,EACtB,MAAM3Z,EAAU5c,KAAKkd,IAAIN,QACzB5c,KAAK4W,MAAK,SAAU7b,GAClB,MAAMy7B,EAAWnyB,EAAQC,OAAOmyB,iBAAiBz2B,KAAKjB,MAAM23B,iBAAiB,aACvEplB,EAAKsL,EAAU,IAAIvD,GAAUmd,GAE/Bx2B,KAAKkd,IAAIyZ,WACX32B,KAAKoG,KAAK,IAAKkwB,EAAKlwB,KAAK,MAEL,OAAhBpG,KAAKyb,OACP8a,GAAmBjlB,GAEnBtR,KAAKoG,KAAK,KAAMrL,EAAIuW,EAAKilB,EAAkB,GAC3CA,EAAkB,OAIxBv2B,KAAKouB,KAAK,WAGZ,OAAOpuB,KAIT,QAAQxE,GAGN,OAFAwE,KAAKkd,IAAM1hB,EACXwE,KAAKkd,IAAIN,QAAU,IAAIvD,GAAU7d,EAAEohB,SAAW,KACvC5c,KAIT,KAAKyb,GAEH,QAAa6Y,IAAT7Y,EAAoB,CACtB,MAAMlV,EAAWvG,KAAKjB,KAAKgb,WAC3B,IAAI6c,EAAY,EAChBnb,EAAO,GAEP,IAAK,IAAI1gB,EAAI,EAAGmhB,EAAM3V,EAASlG,OAAQtF,EAAImhB,IAAOnhB,EAEnB,aAAzBwL,EAASxL,GAAGyK,UAMZzK,IAAM67B,GAAsC,IAAzBrwB,EAASxL,GAAG87B,WAAsD,IAApCvxB,EAAMiB,EAASxL,IAAImiB,IAAIyZ,WAC1Elb,GAAQ,MAIVA,GAAQlV,EAASxL,GAAG2gB,aAVR,IAAN3gB,IAAS67B,EAAY,GAa7B,OAAOnb,EAMT,GAFAzb,KAAKohB,QAAQ+U,OAAM,GAEC,mBAAT1a,EAETA,EAAKvgB,KAAK8E,KAAMA,WAKhB,IAAK,IAAIwY,EAAI,EAAGyN,GAFhBxK,GAAQA,EAAO,IAAI1S,MAAM,OAEC1I,OAAQmY,EAAIyN,EAAIzN,IACxCxY,KAAK82B,QAAQrb,EAAKjD,IAKtB,OAAOxY,KAAKm2B,OAAM,GAAOpZ,WAI7BhX,EAAOqwB,GAAMV,IACbh0B,EAAgB,CACdme,UAAW,CAETpE,KAAMxV,GAAkB,SAAUwV,EAAO,IACvC,OAAOzb,KAAKga,IAAI,IAAIoc,IAAQ3a,KAAKA,MAGnCka,MAAO1vB,GAAkB,SAAUwV,EAAO,IACxC,OAAOzb,KAAKga,IAAI,IAAIoc,IAAQT,MAAMla,SAIxC9V,EAASywB,GAAM,QAEf,MAAMW,WAAc9W,GAElB,YAAYlhB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,QAASrG,GAAO4X,GAChC3W,KAAK41B,QAAS,EAIhB,GAAGvkB,GACD,OAAOrR,KAAKoG,KAAK,KAAMiL,GAIzB,GAAGC,GACD,OAAOtR,KAAKoG,KAAK,KAAMkL,GAIzB,UAEEtR,KAAKkd,IAAIyZ,UAAW,EAEpB,MAAMlb,EAAOzb,KAAKsG,SAElB,KAAMmV,aAAgB2a,IACpB,OAAOp2B,KAGT,MAAMjF,EAAI0gB,EAAKhV,MAAMzG,MACfw2B,EAAWnyB,EAAQC,OAAOmyB,iBAAiBz2B,KAAKjB,MAAM23B,iBAAiB,aACvEplB,EAAKmK,EAAKyB,IAAIN,QAAU,IAAIvD,GAAUmd,GAE5C,OAAOx2B,KAAKsR,GAAGvW,EAAIuW,EAAK,GAAGlL,KAAK,IAAKqV,EAAK9X,KAI5C,KAAK8X,GACH,OAAY,MAARA,EAAqBzb,KAAKjB,KAAK2c,aAAe1b,KAAKkd,IAAIyZ,SAAW,KAAO,KAEzD,mBAATlb,GACTzb,KAAKohB,QAAQ+U,OAAM,GACnB1a,EAAKvgB,KAAK8E,KAAMA,MAChBA,KAAKm2B,OAAM,IAEXn2B,KAAK21B,MAAMla,GAGNzb,OAIX+F,EAAOgxB,GAAOrB,IACdh0B,EAAgB,CACdq1B,MAAO,CACLC,MAAO/wB,GAAkB,SAAUwV,EAAO,IACxC,MAAMub,EAAQ,IAAID,GAOlB,OALK/2B,KAAK41B,QACR51B,KAAKohB,QAIAphB,KAAKga,IAAIgd,GAAOvb,KAAKA,OAGhC2a,KAAM,CACJU,QAAS,SAAUrb,EAAO,IACxB,OAAOzb,KAAKg3B,MAAMvb,GAAMqb,cAI9BnxB,EAASoxB,GAAO,SAEhB,MAAME,WAAehX,GACnB,YAAYlhB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,SAAUrG,GAAO4X,GAGnC,OAAO9a,GACL,OAAOmE,KAAKoG,KAAK,IAAKvK,GAIxB,GAAGgV,GACD,OAAO7Q,KAAKoG,KAAK,IAAKyK,GAIxB,GAAGE,GACD,OAAO/Q,KAAK6Q,GAAGE,GAGjB,KAAK+C,GACH,OAAO9T,KAAK4e,OAAO,IAAIvF,GAAUvF,GAAMyM,OAAO,KAIlDxa,EAAOkxB,GAAQ,CACbtzB,EAAGuc,GACHtc,EAAGuc,GACHlP,GAAImP,GACJlP,GAAImP,GACJpd,MAAOqd,GACPpd,OAAQsd,KAEV9e,EAAgB,CACdme,UAAW,CAETqX,OAAQjxB,GAAkB,SAAU6N,EAAO,GACzC,OAAO9T,KAAKga,IAAI,IAAIid,IAAUnjB,KAAKA,GAAM8M,KAAK,EAAG,SAIvDjb,EAASsxB,GAAQ,UAEjB,MAAME,WAAiBtX,GACrB,YAAY9gB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,WAAYrG,GAAO4X,GAIrC,SAME,OAJA3W,KAAKo3B,UAAUxtB,SAAQ,SAAUD,GAC/BA,EAAG0tB,YAGElhB,MAAMtP,SAGf,UACE,OAAOyP,GAAS,oBAAsBtW,KAAKsa,KAAO,OAItD5Y,EAAgB,CACdme,UAAW,CAETyX,KAAMrxB,GAAkB,WACtB,OAAOjG,KAAKqd,OAAOrD,IAAI,IAAImd,QAG/B7kB,QAAS,CAEP,UACE,OAAOtS,KAAKwH,UAAU,cAGxB,SAAS5I,GAEP,MAAM24B,EAAU34B,aAAmBu4B,GAAWv4B,EAAUoB,KAAKsG,SAASgxB,OAAO1wB,IAAIhI,GAEjF,OAAOoB,KAAKoG,KAAK,YAAa,SAAWmxB,EAAQjd,KAAO,OAI1D,SACE,OAAOta,KAAKoG,KAAK,YAAa,UAKpCT,EAASwxB,GAAU,YAEnB,MAAMK,WAAsBllB,GAC1B,YAAYvT,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,gBAAiBrG,GAAO4X,IAI5CjV,EAAgB,CACdme,UAAW,CACT4X,cAAexxB,GAAkB,SAAUhD,EAAOC,GAChD,OAAOlD,KAAKga,IAAI,IAAIwd,IAAiB1jB,KAAK7Q,EAAOC,SAIvDyC,EAAS6xB,GAAe,iBAgExB,IAAIE,GAAoB,CACtBh4B,UAAW,KACXi4B,MAhEF,SAAetmB,EAAIC,GAsBjB,OArBAtR,KAAKuG,WAAWqD,QAAQ,CAACguB,EAAO78B,KAC9B,IAAIqI,EAGJ,IAEEA,EAAOw0B,EAAMx0B,OACb,MAAO3C,GACP,OAIF,MAAMtF,EAAI,IAAI0T,GAAO+oB,GAGfzmB,EAAShW,EAAEoV,UAAUc,EAAIC,GAAImB,UAAUtX,EAAE6iB,WAEzCnhB,EAAI,IAAI,GAAMuG,EAAKO,EAAGP,EAAKQ,GAAG6O,UAAUtB,GAE9CymB,EAAMhX,KAAK/jB,EAAE8G,EAAG9G,EAAE+G,KAEb5D,MA2CPqR,GAzCF,SAAYA,GACV,OAAOrR,KAAK23B,MAAMtmB,EAAI,IAyCtBC,GAvCF,SAAYA,GACV,OAAOtR,KAAK23B,MAAM,EAAGrmB,IAuCrBpO,OArCF,SAAgBA,EAAQC,EAAMnD,KAAKoD,QACjC,OAAc,MAAVF,EAAuBC,EAAID,OACxBlD,KAAK8T,KAAK3Q,EAAIF,MAAOC,EAAQC,IAoCpCyd,KAlCF,SAAcjd,EAAI,EAAGC,EAAI,EAAGT,EAAMnD,KAAKoD,QACrC,MAAMiO,EAAK1N,EAAIR,EAAIQ,EACb2N,EAAK1N,EAAIT,EAAIS,EACnB,OAAO5D,KAAK23B,MAAMtmB,EAAIC,IAgCtBwC,KA9BF,SAAc7Q,EAAOC,EAAQC,EAAMnD,KAAKoD,QACtC,MAAMvG,EAAImG,EAAiBhD,KAAMiD,EAAOC,EAAQC,GAC1CwM,EAAS9S,EAAEoG,MAAQE,EAAIF,MACvB4M,EAAShT,EAAEqG,OAASC,EAAID,OAK9B,OAJAlD,KAAKuG,WAAWqD,QAAQ,CAACguB,EAAO78B,KAC9B,MAAMS,EAAI,IAAI,GAAM2H,GAAKsP,UAAU,IAAI5D,GAAO+oB,GAAO5Z,WACrD4Z,EAAMhoB,MAAMD,EAAQE,EAAQrU,EAAEmI,EAAGnI,EAAEoI,KAE9B5D,MAuBPiD,MArBF,SAAeA,EAAOE,EAAMnD,KAAKoD,QAC/B,OAAa,MAATH,EAAsBE,EAAIF,MACvBjD,KAAK8T,KAAK7Q,EAAOE,EAAID,OAAQC,IAoBpCQ,EAlBF,SAAWA,EAAGR,EAAMnD,KAAKoD,QACvB,OAAS,MAALO,EAAkBR,EAAIQ,EACnB3D,KAAK4gB,KAAKjd,EAAGR,EAAIS,EAAGT,IAiB3BS,EAfF,SAAWA,EAAGT,EAAMnD,KAAKoD,QACvB,OAAS,MAALQ,EAAkBT,EAAIS,EACnB5D,KAAK4gB,KAAKzd,EAAIQ,EAAGC,EAAGT,KAgB7B,MAAM00B,WAAUhY,GACd,YAAY9gB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,IAAKrG,GAAO4X,IAIhC5Q,EAAO8xB,GAAGH,IACVh2B,EAAgB,CACdme,UAAW,CAETiY,MAAO7xB,GAAkB,WACvB,OAAOjG,KAAKga,IAAI,IAAI6d,UAI1BlyB,EAASkyB,GAAG,KAEZ,MAAMjS,WAAU/F,GACd,YAAY9gB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,IAAKrG,GAAO4X,GAI9B,OAAOqN,GACL,OAAOhkB,KAAKoG,KAAK,SAAU4d,GAI7B,GAAG7C,GACD,OAAOnhB,KAAKoG,KAAK,OAAQ+a,EAAKhd,IAIlC4B,EAAO6f,GAAG8R,IACVh2B,EAAgB,CACdme,UAAW,CAETkY,KAAM9xB,GAAkB,SAAUkb,GAChC,OAAOnhB,KAAKga,IAAI,IAAI4L,IAAK5kB,GAAGmgB,OAGhC7O,QAAS,CACP,SACE,MAAMylB,EAAO/3B,KAAKg4B,SAClB,IAAKD,EAAM,OAAO/3B,KAClB,MAAMsG,EAASyxB,EAAKzxB,SAEpB,IAAKA,EACH,OAAOtG,KAAK6G,SAGd,MAAMJ,EAAQH,EAAOG,MAAMsxB,GAG3B,OAFAzxB,EAAOM,IAAI5G,KAAMyG,GACjBsxB,EAAKlxB,SACE7G,MAGT,OAAOmhB,GAEL,IAAI4W,EAAO/3B,KAAKg4B,SAahB,OAXKD,IACHA,EAAO,IAAInS,GACX5lB,KAAKi4B,KAAKF,IAGO,mBAAR5W,EACTA,EAAIjmB,KAAK68B,EAAMA,GAEfA,EAAK/2B,GAAGmgB,GAGHnhB,MAGT,SACE,MAAM+3B,EAAO/3B,KAAKsG,SAElB,OAAIyxB,GAA6C,MAArCA,EAAKh5B,KAAKyG,SAAS/C,cACtBs1B,EAGF,SAKbpyB,EAASigB,GAAG,KAEZ,MAAMsS,WAAarY,GAEjB,YAAY9gB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,OAAQrG,GAAO4X,GAIjC,SAME,OAJA3W,KAAKo3B,UAAUxtB,SAAQ,SAAUD,GAC/BA,EAAGwuB,YAGEhiB,MAAMtP,SAGf,UACE,OAAOyP,GAAS,eAAiBtW,KAAKsa,KAAO,OAIjD5Y,EAAgB,CACdme,UAAW,CACTuY,KAAMnyB,GAAkB,WACtB,OAAOjG,KAAKqd,OAAOrD,IAAI,IAAIke,QAG/B5lB,QAAS,CAEP,SACE,OAAOtS,KAAKwH,UAAU,SAGxB,SAAS5I,GAEP,MAAMy5B,EAASz5B,aAAmBs5B,GAAOt5B,EAAUoB,KAAKsG,SAAS8xB,OAAOxxB,IAAIhI,GAE5E,OAAOoB,KAAKoG,KAAK,OAAQ,SAAWiyB,EAAO/d,KAAO,OAIpD,SACE,OAAOta,KAAKoG,KAAK,OAAQ,UAK/BT,EAASuyB,GAAM,QAEf,MAAMI,WAAahmB,GACjB,YAAYvT,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,OAAQrG,GAAO4X,GAIjC,OAAOnb,GAaL,OAZiB,iBAANA,GAAkBA,aAAa6d,MACxC7d,EAAI,CACF0d,OAAQ9Y,UAAU,GAClB6K,MAAO7K,UAAU,GACjB6Y,QAAS7Y,UAAU,KAKN,MAAb5E,EAAEyd,SAAiBjZ,KAAKoG,KAAK,eAAgB5K,EAAEyd,SACpC,MAAXzd,EAAEyP,OAAejL,KAAKoG,KAAK,aAAc5K,EAAEyP,OAC/B,MAAZzP,EAAE0d,QAAgBlZ,KAAKoG,KAAK,SAAU,IAAIiT,GAAU7d,EAAE0d,SACnDlZ,MAIX0B,EAAgB,CACdwf,SAAU,CAERqX,KAAM,SAAUrf,EAAQjO,EAAOgO,GAC7B,OAAOjZ,KAAKga,IAAI,IAAIse,IAAQhX,OAAOpI,EAAQjO,EAAOgO,OAIxDtT,EAAS2yB,GAAM,QAef,MAAME,WAAclmB,GAClB,YAAYvT,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,QAASrG,GAAO4X,GAGlC,QAAQjC,EAAI,IAEV,OADA1U,KAAKjB,KAAK2c,aAAehH,EAClB1U,KAGT,KAAK1E,EAAMumB,EAAK7V,EAAS,IACvB,OAAOhM,KAAKy4B,KAAK,aAAc,CAC7BC,WAAYp9B,EACZumB,IAAKA,KACF7V,IAIP,KAAK2O,EAAUjE,GACb,OAAO1W,KAAK24B,QAhChB,SAAiBhe,EAAU8d,GACzB,IAAK9d,EAAU,MAAO,GACtB,IAAK8d,EAAM,OAAO9d,EAClB,IAAIlR,EAAMkR,EAAW,IAErB,IAAK,MAAM5f,KAAK09B,EACdhvB,GAAO5G,EAAY9H,GAAK,IAAM09B,EAAK19B,GAAK,IAI1C,OADA0O,GAAO,IACAA,EAsBemvB,CAAQje,EAAUjE,KAI1ChV,EAAgB,MAAO,CACrB,MAAMiZ,EAAUjE,GACd,OAAO1W,KAAKga,IAAI,IAAIwe,IAASC,KAAK9d,EAAUjE,IAG9C,SAASpb,EAAMumB,EAAK7V,GAClB,OAAOhM,KAAKga,IAAI,IAAIwe,IAASvZ,KAAK3jB,EAAMumB,EAAK7V,MAIjDrG,EAAS6yB,GAAO,SAEhB,MAAMK,WAAiBzC,GAErB,YAAYr3B,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,WAAYrG,GAAO4X,GAIrC,QACE,MAAMmiB,EAAQ94B,KAAK84B,QACnB,OAAOA,EAAQA,EAAM16B,QAAU,KAIjC,KAAK/C,GACH,MAAMy9B,EAAQ94B,KAAK84B,QACnB,IAAIC,EAAY,KAMhB,OAJID,IACFC,EAAYD,EAAMlW,KAAKvnB,IAGb,MAALA,EAAY09B,EAAY/4B,KAIjC,QACE,OAAOA,KAAKwH,UAAU,SAI1B9F,EAAgB,CACdme,UAAW,CACTmZ,SAAU/yB,GAAkB,SAAUwV,EAAM1H,GAM1C,OAJM0H,aAAgB2a,KACpB3a,EAAOzb,KAAKyb,KAAKA,IAGZA,EAAK1H,KAAKA,OAGrBqiB,KAAM,CAEJriB,KAAM9N,GAAkB,SAAU6yB,EAAOG,GAAc,GACrD,MAAMD,EAAW,IAAIH,GAUrB,IAAI95B,EAEJ,GAVM+5B,aAAiB1P,KAErB0P,EAAQ94B,KAAKqd,OAAOtJ,KAAK+kB,IAI3BE,EAAS5yB,KAAK,OAAQ,IAAM0yB,EAAO30B,GAI/B80B,EACF,KAAOl6B,EAAOiB,KAAKjB,KAAKmG,YACtB8zB,EAASj6B,KAAK+a,YAAY/a,GAK9B,OAAOiB,KAAKga,IAAIgf,MAIlB,WACE,OAAOh5B,KAAKid,QAAQ,cAIxBmM,KAAM,CAEJ3N,KAAMxV,GAAkB,SAAUwV,GAOhC,OALMA,aAAgB2a,KACpB3a,GAAO,IAAI2a,IAAOjiB,MAAMnU,KAAKsG,UAAUmV,KAAKA,IAIvCA,EAAK1H,KAAK/T,SAGnB,UACE,OAAOsW,GAAS,gBAAgBlU,OAAOrD,IAC7BA,EAAKqH,KAAK,SAAW,IAAIrC,SAAS/D,KAAKsa,WAOvDue,GAASl8B,UAAU6lB,WAAagF,GAChC7hB,EAASkzB,GAAU,YAEnB,MAAMK,WAAYjZ,GAChB,YAAYlhB,EAAM4X,EAAQ5X,GACxBoX,MAAM/Q,EAAU,MAAOrG,GAAO4X,GAIhC,IAAI/X,EAASu6B,GAEX,OAAOn5B,KAAKoG,KAAK,QAAS+yB,GAAQ,IAAM,IAAMv6B,EAASuF,IAI3DzC,EAAgB,CACdme,UAAW,CAETuZ,IAAKnzB,GAAkB,SAAUrH,EAASu6B,GACxC,OAAOn5B,KAAKga,IAAI,IAAIkf,IAAOE,IAAIx6B,EAASu6B,SAI9CxzB,EAASuzB,GAAK,OAGd,MAAMG,GAAM10B,EACZoB,EAAO,CAACwvB,GAAK,GAAQ,GAAOhU,GAASsB,IAAS9gB,EAAc,YAC5DgE,EAAO,CAAC0c,GAAM+G,GAAU,GAASJ,IAAOrnB,EAAc,WACtDgE,EAAOqwB,GAAMr0B,EAAc,SAC3BgE,EAAOqjB,GAAMrnB,EAAc,SAC3BgE,EAAOia,GAAMje,EAAc,SAC3BgE,EAAO,CAACqwB,GAAMW,IAAQh1B,EAAc,UACpCgE,EAAO,CAAC2jB,GAAMhJ,GAASQ,GAAUuN,IAAS1sB,EAAc,WACxDgE,EAAOiS,GAAajW,EAAc,gBAClCgE,EAAO4T,GAAK5X,EAAc,QAC1BgE,EAAOuM,GAASvQ,EAAc,YAC9BgE,EAAOka,GAAOle,EAAc,UAC5BgE,EAAO,CAAC8Z,GAAWpa,IAAW1D,EAAc,cAC5CgE,EAAOmb,GAAUnf,EAAc,aAC/BgE,EAAO0oB,GAAQ1sB,EAAc,WAC7BkU,GAAKlQ,OAt0NI,IAAI,IAAIqT,IAAI3X,KAk3IrB,SAA+B8W,EAAO,IACpCuP,GAAejnB,QAAQ,GAAGO,OAAOmX,IAo9EnC+gB,CAAsB,CAACjgB,GAAWvO,GAAOuJ,GAAKxF,GAAQsK,GAAU6I,GAAYwF,KAj9E1EzhB,EAAO+hB,GAAgB,CACrB,GAAGte,GACD,OAAO,IAAIwe,IAAYzP,KAAKvY,KAAKC,aAAagB,KAAKjB,KAAKyZ,WAAWzY,GAAGwI,IAGxE,UAAU0M,GAER,OADAlW,KAAKgL,KAAKkL,GACHlW,Q,YCj4IE,GAzBiB,WAC5B,SAASu5B,IAMLv5B,KAAKw5B,UAAW,EAgBpB,OAXAD,EAAW58B,UAAU88B,QAAU,WACtBz5B,KAAKw5B,WACNx5B,KAAKw5B,UAAW,EAChBx5B,KAAK05B,oBAObH,EAAW58B,UAAU+8B,gBAAkB,aAChCH,EAvBoB,GCoCxB,SAASI,GAA0BxvB,EAAG3K,GACzC,OAAO2K,EAAI3K,EAAI,EAAI2K,EAAI3K,GAAK,EAAI,EAiC7B,SAASo6B,GAAkB1jB,EAAK8N,EAAQrF,GAC3C,IAAIniB,EAAI0Z,EAAI7V,OACZ,GAAI6V,EAAI,IAAM8N,EACV,OAAO,EAEN,GAAIA,GAAU9N,EAAI1Z,EAAI,GACvB,OAAOA,EAAI,EAGX,IAAIzB,OAAI,EACR,GAAI4jB,EAAY,GACZ,IAAK5jB,EAAI,EAAGA,EAAIyB,IAAKzB,EACjB,GAAImb,EAAInb,GAAKipB,EACT,OAAOjpB,EAAI,OAIlB,GAAI4jB,EAAY,GACjB,IAAK5jB,EAAI,EAAGA,EAAIyB,IAAKzB,EACjB,GAAImb,EAAInb,IAAMipB,EACV,OAAOjpB,OAKf,IAAKA,EAAI,EAAGA,EAAIyB,IAAKzB,EAAG,CACpB,GAAImb,EAAInb,IAAMipB,EACV,OAAOjpB,EAEN,GAAImb,EAAInb,GAAKipB,EACd,MAAyB,mBAAdrF,EACHA,EAAUqF,EAAQ9N,EAAInb,EAAI,GAAImb,EAAInb,IAAM,EACjCA,EAAI,EAGJA,EAGNmb,EAAInb,EAAI,GAAKipB,EAASA,EAAS9N,EAAInb,GACjCA,EAAI,EAGJA,EAKvB,OAAOyB,EAAI,EAsBZ,SAAS,GAAO0Z,EAAKhM,GAGxB,IAFA,IAAIsU,EAAY7e,MAAMgC,QAAQuI,GAAQA,EAAO,CAACA,GAC1C7J,EAASme,EAAUne,OACdtF,EAAI,EAAGA,EAAIsF,EAAQtF,IACxBmb,EAAIA,EAAI7V,QAAUme,EAAUzjB,GAuC7B,SAAS8+B,GAAOC,EAAMC,GACzB,IAAIC,EAAOF,EAAKz5B,OAChB,GAAI25B,IAASD,EAAK15B,OACd,OAAO,EAEX,IAAK,IAAItF,EAAI,EAAGA,EAAIi/B,EAAMj/B,IACtB,GAAI++B,EAAK/+B,KAAOg/B,EAAKh/B,GACjB,OAAO,EAGf,OAAO,EC/LJ,SAASk/B,KACZ,OAAO,EAMJ,SAASC,KACZ,OAAO,EAOJ,SAASC,MCjBT,SAAS,KACZ,OAAyB,WACrB,MAAM,IAAIn8B,MAAM,kCADI,GAS5B,IAAIo8B,GAAc,EAUX,SAASC,GAAO3jB,GACnB,OAAOA,EAAI4jB,SAAW5jB,EAAI4jB,OAASx6B,SAASs6B,KAMzC,IC9BHG,GAA0B,oBAAdC,gBAA4D,IAAxBA,UAAUC,UACxDD,UAAUC,UAAUh4B,cACpB,GAKKi4B,IAAqC,IAA3BH,GAAGtxB,QAAQ,WAUrB0xB,KALmC,IAA1BJ,GAAGtxB,QAAQ,WAAoBsxB,GAAGtxB,QAAQ,UAKhB,IAA1BsxB,GAAGtxB,QAAQ,YAA2C,GAAvBsxB,GAAGtxB,QAAQ,SAKnD2xB,IAAmC,IAA7BL,GAAGtxB,QAAQ,aAQjB4xB,GAAiD,oBAArBC,iBAAmCA,iBAAmB,EAMlFC,GAAuD,oBAAtBC,mBACb,oBAApBC,iBACP3E,gBAAgB0E,kBAKTE,GAAgC,oBAAVtZ,OAAyBA,MAAMjlB,UAAUw+B,OAI/DC,GAA0B,WACjC,IAAIC,GAAU,EACd,IACI,IAAI/jB,EAAU7b,OAAOC,eAAe,GAAI,UAAW,CAC/CE,IAAK,WACDy/B,GAAU,KAGlB/2B,OAAOqT,iBAAiB,IAAK,KAAML,GACnChT,OAAOwT,oBAAoB,IAAK,KAAMR,GAE1C,MAAOxW,IAGP,OAAOu6B,EAd0B,GClDjC,GAAwC,WACxC,IAAI97B,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAyD7B,GAjCqB,SAAUu7B,GAK1C,SAASC,EAAeC,GACpB,IAAI1f,EAAQ9b,KAERy7B,EAAU,oDAD8B,IFE/B,QEF6C1yB,MAAM,KAAK,IAGjE,gBACAyyB,EACA,gBAiBJ,OAhBA1f,EAAQwf,EAAOpgC,KAAK8E,KAAMy7B,IAAYz7B,MAShCw7B,KAAOA,EAIb1f,EAAMxgB,KAAO,iBAEbwgB,EAAM2f,QAAUA,EACT3f,EAEX,OA9BA,GAAUyf,EAAgBD,GA8BnBC,EA/BwB,CAgCjCv9B,OChDK,SAAS09B,GAAOC,EAAWC,GAC9B,IAAKD,EACD,MAAM,IAAI,GAAeC,GCgBjC,IA6NIC,GA7NO,IAAIl8B,MAAM,GAwFd,SAASW,GAAMmS,EAAWqpB,GAC7B,IAAIn4B,EAAIm4B,EAAW,GACfl4B,EAAIk4B,EAAW,GAGnB,OAFAA,EAAW,GAAKrpB,EAAU,GAAK9O,EAAI8O,EAAU,GAAK7O,EAAI6O,EAAU,GAChEqpB,EAAW,GAAKrpB,EAAU,GAAK9O,EAAI8O,EAAU,GAAK7O,EAAI6O,EAAU,GACzDqpB,EAwDJ,SAASC,GAAQtpB,EAAWupB,EAAKC,EAAKtqB,EAAII,EAAI2M,EAAOwd,EAAKC,GAC7D,IAAI/wB,EAAM9I,KAAK8I,IAAIsT,GACf3R,EAAMzK,KAAKyK,IAAI2R,GAOnB,OANAjM,EAAU,GAAKd,EAAK5E,EACpB0F,EAAU,GAAKV,EAAK3G,EACpBqH,EAAU,IAAMd,EAAKvG,EACrBqH,EAAU,GAAKV,EAAKhF,EACpB0F,EAAU,GAAKypB,EAAMvqB,EAAK5E,EAAMovB,EAAMxqB,EAAKvG,EAAM4wB,EACjDvpB,EAAU,GAAKypB,EAAMnqB,EAAK3G,EAAM+wB,EAAMpqB,EAAKhF,EAAMkvB,EAC1CxpB,EAkCJ,SAAS2pB,GAAYpY,EAAQtV,GAChC,IAqBwB+P,EArBpB9L,GAqBoB8L,EArBF/P,GAsBX,GAAK+P,EAAI,GAAKA,EAAI,GAAKA,EAAI,GArBtCid,GAAe,IAAR/oB,EAAW,IAClB,IAAIxI,EAAIuE,EAAO,GACXlP,EAAIkP,EAAO,GACXtT,EAAIsT,EAAO,GACXrT,EAAIqT,EAAO,GACXjO,EAAIiO,EAAO,GACXK,EAAIL,EAAO,GAOf,OANAsV,EAAO,GAAK3oB,EAAIsX,EAChBqR,EAAO,IAAMxkB,EAAImT,EACjBqR,EAAO,IAAM5oB,EAAIuX,EACjBqR,EAAO,GAAK7Z,EAAIwI,EAChBqR,EAAO,IAAM5oB,EAAI2T,EAAI1T,EAAIoF,GAAKkS,EAC9BqR,EAAO,KAAO7Z,EAAI4E,EAAIvP,EAAIiB,GAAKkS,EACxBqR,EAqBJ,SAAS,GAASvF,GACrB,IAAI4d,EAAkB,UAAY5d,EAAItV,KAAK,MAAQ,IACnD,GAAI4xB,GACA,OAAOsB,EAEX,IAAIt9B,EAAO88B,KAAuBA,GAAqBt3B,SAASS,cAAc,QAE9E,OADAjG,EAAKwK,MAAMkJ,UAAY4pB,EAChBt9B,EAAKwK,MAAMkJ,UC9PP,OACE,cADF,GAEG,eAFH,GAGD,WAHC,GAIA,YCJA,GACF,EADE,GAEG,EAFH,GAGJ,EAHI,GAIJ,EAJI,GAKJ,EALI,GAML,GCKH,SAAS6pB,GAAeC,GAE3B,IADA,IAAIC,EAASC,KACJ1hC,EAAI,EAAG2hC,EAAKH,EAAYl8B,OAAQtF,EAAI2hC,IAAM3hC,EAC/C4hC,GAAiBH,EAAQD,EAAYxhC,IAEzC,OAAOyhC,EAkEJ,SAASI,GAAyBJ,EAAQ74B,EAAGC,GAChD,IAAIyN,EAAIC,EAmBR,OAjBID,EADA1N,EAAI64B,EAAO,GACNA,EAAO,GAAK74B,EAEZ64B,EAAO,GAAK74B,EACZA,EAAI64B,EAAO,GAGX,GAWGnrB,GARRC,EADA1N,EAAI44B,EAAO,GACNA,EAAO,GAAK54B,EAEZ44B,EAAO,GAAK54B,EACZA,EAAI44B,EAAO,GAGX,GAEalrB,EAUnB,SAASurB,GAAmBL,EAAQV,GACvC,OAAOgB,GAAWN,EAAQV,EAAW,GAAIA,EAAW,IA6BjD,SAASgB,GAAWN,EAAQ74B,EAAGC,GAClC,OAAO44B,EAAO,IAAM74B,GAAKA,GAAK64B,EAAO,IAAMA,EAAO,IAAM54B,GAAKA,GAAK44B,EAAO,GAStE,SAASO,GAAuBP,EAAQV,GAC3C,IAAI3Z,EAAOqa,EAAO,GACdpa,EAAOoa,EAAO,GACdva,EAAOua,EAAO,GACdta,EAAOsa,EAAO,GACd74B,EAAIm4B,EAAW,GACfl4B,EAAIk4B,EAAW,GACfkB,EAAeC,GAgBnB,OAfIt5B,EAAIwe,EACJ6a,GAA8BC,GAEzBt5B,EAAIse,IACT+a,GAA8BC,IAE9Br5B,EAAIwe,EACJ4a,GAA8BC,GAEzBr5B,EAAIse,IACT8a,GAA8BC,IAE9BD,IAAiBC,KACjBD,EAAeC,IAEZD,EAOJ,SAASP,KACZ,MAAO,CAAC3nB,IAAUA,KAAWA,KAAWA,KAWrC,SAASooB,GAAe/a,EAAMC,EAAMH,EAAMC,EAAMib,GACnD,OAAIA,GACAA,EAAW,GAAKhb,EAChBgb,EAAW,GAAK/a,EAChB+a,EAAW,GAAKlb,EAChBkb,EAAW,GAAKjb,EACTib,GAGA,CAAChb,EAAMC,EAAMH,EAAMC,GAQ3B,SAASkb,GAAoBD,GAChC,OAAOD,GAAepoB,IAAUA,KAAWA,KAAWA,IAAUqoB,GAiD7D,SAAS,GAAOE,EAASC,GAC5B,OAAQD,EAAQ,IAAMC,EAAQ,IAC1BD,EAAQ,IAAMC,EAAQ,IACtBD,EAAQ,IAAMC,EAAQ,IACtBD,EAAQ,IAAMC,EAAQ,GAyCvB,SAASX,GAAiBH,EAAQV,GACjCA,EAAW,GAAKU,EAAO,KACvBA,EAAO,GAAKV,EAAW,IAEvBA,EAAW,GAAKU,EAAO,KACvBA,EAAO,GAAKV,EAAW,IAEvBA,EAAW,GAAKU,EAAO,KACvBA,EAAO,GAAKV,EAAW,IAEvBA,EAAW,GAAKU,EAAO,KACvBA,EAAO,GAAKV,EAAW,IAsBxB,SAASyB,GAAsBf,EAAQgB,EAAiBtkB,EAAQoS,EAAKmS,GACxE,KAAOvkB,EAASoS,EAAKpS,GAAUukB,EAC3BC,GAASlB,EAAQgB,EAAgBtkB,GAASskB,EAAgBtkB,EAAS,IAEvE,OAAOsjB,EAkBJ,SAASkB,GAASlB,EAAQ74B,EAAGC,GAChC44B,EAAO,GAAKl6B,KAAKiG,IAAIi0B,EAAO,GAAI74B,GAChC64B,EAAO,GAAKl6B,KAAKiG,IAAIi0B,EAAO,GAAI54B,GAChC44B,EAAO,GAAKl6B,KAAKgG,IAAIk0B,EAAO,GAAI74B,GAChC64B,EAAO,GAAKl6B,KAAKgG,IAAIk0B,EAAO,GAAI54B,GAW7B,SAAS+5B,GAAcnB,EAAQ9a,GAClC,IAAIlY,EAEJ,OADAA,EAAMkY,EAASkc,GAAcpB,OAI7BhzB,EAAMkY,EAASmc,GAAerB,OAI9BhzB,EAAMkY,EAASoc,GAAYtB,KANhBhzB,GAUXA,EAAMkY,EAASqc,GAAWvB,OAInB,EAQJ,SAASwB,GAAQxB,GACpB,IAAIyB,EAAO,EAIX,OAHKC,GAAQ1B,KACTyB,EAAOE,GAAS3B,GAAU4B,GAAU5B,IAEjCyB,EAQJ,SAASL,GAAcpB,GAC1B,MAAO,CAACA,EAAO,GAAIA,EAAO,IAQvB,SAASqB,GAAerB,GAC3B,MAAO,CAACA,EAAO,GAAIA,EAAO,IAQvB,SAAS6B,GAAU7B,GACtB,MAAO,EAAEA,EAAO,GAAKA,EAAO,IAAM,GAAIA,EAAO,GAAKA,EAAO,IAAM,GAQ5D,SAAS8B,GAAU9B,EAAQ+B,GAC9B,IAAIzC,EAgBJ,OAfIyC,IAAWC,GACX1C,EAAa8B,GAAcpB,GAEtB+B,IAAWC,GAChB1C,EAAa+B,GAAerB,GAEvB+B,IAAWC,GAChB1C,EAAaiC,GAAWvB,GAEnB+B,IAAWC,GAChB1C,EAAagC,GAAYtB,GAGzBd,IAAO,EAAO,IAEXI,EAsBJ,SAAS2C,GAAkB1I,EAAQ2I,EAAYC,EAAU7qB,EAAMqpB,GAClE,IAAI9rB,EAAMqtB,EAAa5qB,EAAK,GAAM,EAC9BxC,EAAMotB,EAAa5qB,EAAK,GAAM,EAC9B8qB,EAAct8B,KAAKyK,IAAI4xB,GACvBE,EAAcv8B,KAAK8I,IAAIuzB,GACvBG,EAAOztB,EAAKutB,EACZG,EAAO1tB,EAAKwtB,EACZG,EAAO1tB,EAAKstB,EACZK,EAAO3tB,EAAKutB,EACZl7B,EAAIoyB,EAAO,GACXnyB,EAAImyB,EAAO,GACXmJ,EAAKv7B,EAAIm7B,EAAOG,EAChBle,EAAKpd,EAAIm7B,EAAOG,EAChBtqB,EAAKhR,EAAIm7B,EAAOG,EAChBE,EAAKx7B,EAAIm7B,EAAOG,EAChBG,EAAKx7B,EAAIm7B,EAAOC,EAChBhe,EAAKpd,EAAIm7B,EAAOC,EAChBpqB,EAAKhR,EAAIm7B,EAAOC,EAChBK,EAAKz7B,EAAIm7B,EAAOC,EACpB,OAAO9B,GAAe56B,KAAKiG,IAAI22B,EAAIne,EAAIpM,EAAIwqB,GAAK78B,KAAKiG,IAAI62B,EAAIpe,EAAIpM,EAAIyqB,GAAK/8B,KAAKgG,IAAI42B,EAAIne,EAAIpM,EAAIwqB,GAAK78B,KAAKgG,IAAI82B,EAAIpe,EAAIpM,EAAIyqB,GAAKlC,GAQ3H,SAASiB,GAAU5B,GACtB,OAAOA,EAAO,GAAKA,EAAO,GAmBvB,SAAS8C,GAAgBjC,EAASC,EAASH,GAC9C,IAAIoC,EAAepC,GA1VZ,CAACroB,IAAUA,KAAU,KAAW,KAwXvC,OA7BI,GAAWuoB,EAASC,IAChBD,EAAQ,GAAKC,EAAQ,GACrBiC,EAAa,GAAKlC,EAAQ,GAG1BkC,EAAa,GAAKjC,EAAQ,GAE1BD,EAAQ,GAAKC,EAAQ,GACrBiC,EAAa,GAAKlC,EAAQ,GAG1BkC,EAAa,GAAKjC,EAAQ,GAE1BD,EAAQ,GAAKC,EAAQ,GACrBiC,EAAa,GAAKlC,EAAQ,GAG1BkC,EAAa,GAAKjC,EAAQ,GAE1BD,EAAQ,GAAKC,EAAQ,GACrBiC,EAAa,GAAKlC,EAAQ,GAG1BkC,EAAa,GAAKjC,EAAQ,IAI9BF,GAAoBmC,GAEjBA,EAwBJ,SAASxB,GAAWvB,GACvB,MAAO,CAACA,EAAO,GAAIA,EAAO,IAQvB,SAASsB,GAAYtB,GACxB,MAAO,CAACA,EAAO,GAAIA,EAAO,IAQvB,SAAS2B,GAAS3B,GACrB,OAAOA,EAAO,GAAKA,EAAO,GASvB,SAAS,GAAWa,EAASC,GAChC,OAAQD,EAAQ,IAAMC,EAAQ,IAC1BD,EAAQ,IAAMC,EAAQ,IACtBD,EAAQ,IAAMC,EAAQ,IACtBD,EAAQ,IAAMC,EAAQ,GAQvB,SAASY,GAAQ1B,GACpB,OAAOA,EAAO,GAAKA,EAAO,IAAMA,EAAO,GAAKA,EAAO,GAkGhD,SAASgD,GAAehD,EAAQiD,EAAatC,EAAYuC,GAC5D,IAAInD,EAAc,GAClB,GAAImD,EAAY,EAGZ,IAFA,IAAIz8B,EAAQu5B,EAAO,GAAKA,EAAO,GAC3Bt5B,EAASs5B,EAAO,GAAKA,EAAO,GACvBzhC,EAAI,EAAGA,EAAI2kC,IAAa3kC,EAC7BwhC,EAAY17B,KAAK27B,EAAO,GAAMv5B,EAAQlI,EAAK2kC,EAAWlD,EAAO,GAAIA,EAAO,GAAIA,EAAO,GAAMt5B,EAASnI,EAAK2kC,EAAWlD,EAAO,GAAMv5B,EAAQlI,EAAK2kC,EAAWlD,EAAO,GAAIA,EAAO,GAAIA,EAAO,GAAMt5B,EAASnI,EAAK2kC,QAI5MnD,EAAc,CACVC,EAAO,GACPA,EAAO,GACPA,EAAO,GACPA,EAAO,GACPA,EAAO,GACPA,EAAO,GACPA,EAAO,GACPA,EAAO,IAGfiD,EAAYlD,EAAaA,EAAa,GAGtC,IAFA,IAAIoD,EAAK,GACLC,EAAK,GACO5kC,GAAPD,EAAI,EAAOwhC,EAAYl8B,QAAQtF,EAAIC,EAAGD,GAAK,EAChD4kC,EAAG9+B,KAAK07B,EAAYxhC,IACpB6kC,EAAG/+B,KAAK07B,EAAYxhC,EAAI,IAE5B,OArtBJ,SAA4B4kC,EAAIC,EAAIzC,GAKhC,OAAOD,GAJI56B,KAAKiG,IAAIjI,MAAM,KAAMq/B,GACrBr9B,KAAKiG,IAAIjI,MAAM,KAAMs/B,GACrBt9B,KAAKgG,IAAIhI,MAAM,KAAMq/B,GACrBr9B,KAAKgG,IAAIhI,MAAM,KAAMs/B,GACczC,GAgtBvC0C,CAAmBF,EAAIC,EAAIzC,GC1uB/B,SAAS2C,GAAM9jC,EAAOuM,EAAKD,GAC9B,OAAOhG,KAAKiG,IAAIjG,KAAKgG,IAAItM,EAAOuM,GAAMD,GAWnC,IAAIy3B,GAIH,SAAUz9B,KAEHA,KAAKy9B,KAIL,SAAUp8B,GACb,IAAIC,EAAwB,KAAOo8B,IAAIr8B,GACvC,OAAQC,EAAI,EAAIA,GAAK,GActBq8B,GAIH,SAAU39B,KAEHA,KAAK29B,KAIL,SAAUt8B,GACb,OAAOrB,KAAKiiB,IAAI5gB,GAAKrB,KAAK49B,OAgB/B,SAASC,GAAuBx8B,EAAGC,EAAGmd,EAAIC,EAAIrM,EAAIC,GACrD,IAAIvD,EAAKsD,EAAKoM,EACVzP,EAAKsD,EAAKoM,EACd,GAAW,IAAP3P,GAAmB,IAAPC,EAAU,CACtB,IAAIrV,IAAM0H,EAAIod,GAAM1P,GAAMzN,EAAIod,GAAM1P,IAAOD,EAAKA,EAAKC,EAAKA,GACtDrV,EAAI,GACJ8kB,EAAKpM,EACLqM,EAAKpM,GAEA3Y,EAAI,IACT8kB,GAAM1P,EAAKpV,EACX+kB,GAAM1P,EAAKrV,GAGnB,OAAO,GAAgB0H,EAAGC,EAAGmd,EAAIC,GAU9B,SAAS,GAAgBD,EAAIC,EAAIrM,EAAIC,GACxC,IAAIvD,EAAKsD,EAAKoM,EACVzP,EAAKsD,EAAKoM,EACd,OAAO3P,EAAKA,EAAKC,EAAKA,EAmEnB,SAAS8uB,GAAUC,GACtB,OAAQA,EAAiB/9B,KAAKC,GAAM,IASjC,SAAS+9B,GAAOn2B,EAAG3K,GACtB,IAAI3D,EAAIsO,EAAI3K,EACZ,OAAO3D,EAAI2D,EAAI,EAAI3D,EAAI2D,EAAI3D,EAUxB,SAAS0kC,GAAKp2B,EAAG3K,EAAGmE,GACvB,OAAOwG,EAAIxG,GAAKnE,EAAI2K,GC9KxB,IAAIq2B,GAAgB,oDAOhBC,GAAkB,4BAOf,SAASC,GAASz1B,GACrB,MAAqB,iBAAVA,EACAA,EAgKR,SAAkBA,GACrB,IAAIpP,EAAIoP,EAAM,GACVpP,IAAU,EAAJA,KACNA,EAAKA,EAAI,GAAO,GAEpB,IAAI8G,EAAIsI,EAAM,GACVtI,IAAU,EAAJA,KACNA,EAAKA,EAAI,GAAO,GAEpB,IAAInD,EAAIyL,EAAM,GACVzL,IAAU,EAAJA,KACNA,EAAKA,EAAI,GAAO,GAEpB,IAAI2K,OAAiBmqB,IAAbrpB,EAAM,GAAmB,EAAIA,EAAM,GAC3C,MAAO,QAAUpP,EAAI,IAAM8G,EAAI,IAAMnD,EAAI,IAAM2K,EAAI,IA3KxC,CAASc,GAQxB,SAAS01B,GAAU11B,GACf,IAAItB,EAAKpF,SAASS,cAAc,OAEhC,GADA2E,EAAGJ,MAAM0B,MAAQA,EACM,KAAnBtB,EAAGJ,MAAM0B,MAAc,CACvB1G,SAAS0P,KAAK6F,YAAYnQ,GAC1B,IAAIpC,EAAMkvB,iBAAiB9sB,GAAIsB,MAE/B,OADA1G,SAAS0P,KAAK9O,YAAYwE,GACnBpC,EAGP,MAAO,GAOR,IAYCq5B,GAIAC,GAJAD,GAAQ,GAIRC,GAAY,EAyGb,SAASC,GAAU71B,GAKtB,OAJAA,EAAM,GAAK60B,GAAO70B,EAAM,GAAK,GAAO,EAAG,EAAG,KAC1CA,EAAM,GAAK60B,GAAO70B,EAAM,GAAK,GAAO,EAAG,EAAG,KAC1CA,EAAM,GAAK60B,GAAO70B,EAAM,GAAK,GAAO,EAAG,EAAG,KAC1CA,EAAM,GAAK60B,GAAM70B,EAAM,GAAI,EAAG,GACvBA,ECrLX,IAAI81B,GAAgC,WAChC,SAASA,IAKL/gC,KAAKghC,OAAS,GAKdhhC,KAAKihC,WAAa,EAKlBjhC,KAAKkhC,cAAgB,GA8DzB,OAzDAH,EAAepkC,UAAUykB,MAAQ,WAC7BphB,KAAKghC,OAAS,GACdhhC,KAAKihC,WAAa,GAKtBF,EAAepkC,UAAUwkC,eAAiB,WACtC,OAAOnhC,KAAKihC,WAAajhC,KAAKkhC,eAKlCH,EAAepkC,UAAUykC,OAAS,WAC9B,GAAIphC,KAAKmhC,iBAAkB,CACvB,IAAIpmC,EAAI,EACR,IAAK,IAAIuB,KAAO0D,KAAKghC,OAAQ,CACzB,IAAIK,EAAYrhC,KAAKghC,OAAO1kC,GACV,IAAP,EAANvB,MAAmBsmC,EAAUC,uBACvBthC,KAAKghC,OAAO1kC,KACjB0D,KAAKihC,eAWvBF,EAAepkC,UAAUf,IAAM,SAAUimB,EAAK0f,EAAat2B,GACvD,IAAI3O,EAAMklC,GAAO3f,EAAK0f,EAAat2B,GACnC,OAAO3O,KAAO0D,KAAKghC,OAAShhC,KAAKghC,OAAO1kC,GAAO,MAQnDykC,EAAepkC,UAAU8kC,IAAM,SAAU5f,EAAK0f,EAAat2B,EAAOo2B,GAC9D,IAAI/kC,EAAMklC,GAAO3f,EAAK0f,EAAat2B,GACnCjL,KAAKghC,OAAO1kC,GAAO+kC,IACjBrhC,KAAKihC,YASXF,EAAepkC,UAAU+kC,QAAU,SAAUC,GACzC3hC,KAAKkhC,cAAgBS,EACrB3hC,KAAKohC,UAEFL,EA9EwB,GAsFnC,SAASS,GAAO3f,EAAK0f,EAAat2B,GAE9B,OAAOs2B,EAAc,IAAM1f,EAAM,KADf5W,EAAQy1B,GAASz1B,GAAS,QAGjC,IAMJ22B,GAAS,IAAIb,GCpCT,OAvDgB,WAI3B,SAASc,EAAUtpB,GAIfvY,KAAK8hC,mBAIL9hC,KAAKyY,iBAMLzY,KAAKuY,KAAOA,EAMZvY,KAAKgkB,OAAS,KAiBlB,OAVA6d,EAAUllC,UAAUolC,eAAiB,WACjC/hC,KAAKyY,kBAAmB,GAM5BopB,EAAUllC,UAAUqlC,gBAAkB,WAClChiC,KAAK8hC,oBAAqB,GAEvBD,EAzCmB,GCPf,GAMK,iBCAT,GAAkC,mBAAlBpmC,OAAO0E,OAC5B1E,OAAO0E,OACP,SAAU6jB,EAAQie,GAChB,GAAIje,QACA,MAAM,IAAInkB,UAAU,8CAGxB,IADA,IAAIqiC,EAASzmC,OAAOuoB,GACXjpB,EAAI,EAAG2hC,EAAKt8B,UAAUC,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAChD,IAAI2T,EAAStO,UAAUrF,GACvB,GAAI2T,QACA,IAAK,IAAIpS,KAAOoS,EACRA,EAAO9R,eAAeN,KACtB4lC,EAAO5lC,GAAOoS,EAAOpS,IAKrC,OAAO4lC,GAMR,SAAS,GAAMzlC,GAClB,IAAK,IAAIC,KAAYD,SACVA,EAAOC,GAWf,IAAIylC,GAAqC,mBAAlB1mC,OAAOsQ,OAC/BtQ,OAAOsQ,OACP,SAAUtP,GACR,IAAIsP,EAAS,GACb,IAAK,IAAIrP,KAAYD,EACjBsP,EAAOlL,KAAKpE,EAAOC,IAEvB,OAAOqP,GAOR,SAAS,GAAQtP,GACpB,IAAIC,EACJ,IAAKA,KAAYD,EACb,OAAO,EAEX,OAAQC,ECnEZ,IAAI,GAAwC,WACxC,IAAI6C,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA4L7B,GApJa,SAAUu7B,GAKlC,SAAS8G,EAAOC,GACZ,IAAIvmB,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAqBjC,OAhBA8b,EAAMwmB,aAAeD,EAKrBvmB,EAAMymB,iBAAmB,KAKzBzmB,EAAM0mB,aAAe,KAKrB1mB,EAAM2mB,WAAa,KACZ3mB,EAuHX,OAjJA,GAAUsmB,EAAQ9G,GAgClB8G,EAAOzlC,UAAUgb,iBAAmB,SAAUY,EAAMnB,GAChD,GAAKmB,GAASnB,EAAd,CAGA,IAAIsrB,EAAY1iC,KAAKyiC,aAAeziC,KAAKyiC,WAAa,IAClDE,EAAmBD,EAAUnqB,KAAUmqB,EAAUnqB,GAAQ,KACjB,IAAxCoqB,EAAiB15B,QAAQmO,IACzBurB,EAAiB9hC,KAAKuW,KAa9BgrB,EAAOzlC,UAAU0b,cAAgB,SAAUZ,GAEvC,IAAImrB,EAAuB,iBAAVnrB,EAAqB,IAAIQ,GAAMR,GAASA,EACrDc,EAAOqqB,EAAIrqB,KACVqqB,EAAI5e,SACL4e,EAAI5e,OAAShkB,KAAKsiC,cAAgBtiC,MAEtC,IACI6iC,EADAH,EAAY1iC,KAAKyiC,YAAcziC,KAAKyiC,WAAWlqB,GAEnD,GAAImqB,EAAW,CACX,IAAII,EAAc9iC,KAAKwiC,eAAiBxiC,KAAKwiC,aAAe,IACxDO,EAAkB/iC,KAAKuiC,mBAAqBviC,KAAKuiC,iBAAmB,IAClEhqB,KAAQuqB,IACVA,EAAYvqB,GAAQ,EACpBwqB,EAAgBxqB,GAAQ,KAE1BuqB,EAAYvqB,GACd,IAAK,IAAIxd,EAAI,EAAG2hC,EAAKgG,EAAUriC,OAAQtF,EAAI2hC,IAAM3hC,EAO7C,IAAkB,KALd8nC,EADA,gBAAiBH,EAAU3nC,GACuC2nC,EAAU3nC,GAAIioC,YAAYJ,GAGxBF,EAAU3nC,GAAIG,KAAK8E,KAAM4iC,KAEtEA,EAAId,mBAAoB,CAC/Ce,GAAY,EACZ,MAIR,KADEC,EAAYvqB,GACY,IAAtBuqB,EAAYvqB,GAAa,CACzB,IAAI0qB,EAAKF,EAAgBxqB,GAEzB,WADOwqB,EAAgBxqB,GAChB0qB,KACHjjC,KAAK8X,oBAAoBS,EAAM4hB,WAE5B2I,EAAYvqB,GAEvB,OAAOsqB,IAMfT,EAAOzlC,UAAU+8B,gBAAkB,WAC/B15B,KAAKyiC,YAAc,GAAMziC,KAAKyiC,aASlCL,EAAOzlC,UAAUumC,aAAe,SAAU3qB,GACtC,OAAQvY,KAAKyiC,YAAcziC,KAAKyiC,WAAWlqB,SAAU+b,GAOzD8N,EAAOzlC,UAAU2kC,YAAc,SAAU6B,GACrC,QAAKnjC,KAAKyiC,aAGHU,EACDA,KAAYnjC,KAAKyiC,WACjBhnC,OAAOgiB,KAAKzd,KAAKyiC,YAAYpiC,OAAS,IAMhD+hC,EAAOzlC,UAAUmb,oBAAsB,SAAUS,EAAMnB,GACnD,IAAIsrB,EAAY1iC,KAAKyiC,YAAcziC,KAAKyiC,WAAWlqB,GACnD,GAAImqB,EAAW,CACX,IAAIj8B,EAAQi8B,EAAUz5B,QAAQmO,IACf,IAAX3Q,IACIzG,KAAKuiC,kBAAoBhqB,KAAQvY,KAAKuiC,kBAEtCG,EAAUj8B,GAAS0zB,KACjBn6B,KAAKuiC,iBAAiBhqB,KAGxBmqB,EAAU7Z,OAAOpiB,EAAO,GACC,IAArBi8B,EAAUriC,eACHL,KAAKyiC,WAAWlqB,OAMpC6pB,EAlJgB,CAmJzB,ICpLa,GAMH,SANG,GAYJ,QAZI,GAeE,cAfF,GAgBJ,QAhBI,GAiBD,WAjBC,GAsBF,UAtBE,GAuBD,WAvBC,GAwBL,OAxBK,GAyBH,SAzBG,GA0BA,YA1BA,GA2BJ,QCOJ,SAASgB,GAAOpf,EAAQzL,EAAMnB,EAAUisB,EAAUC,GAIrD,GAHID,GAAYA,IAAarf,IACzB5M,EAAWA,EAAS7a,KAAK8mC,IAEzBC,EAAU,CACV,IAAIC,EAAqBnsB,EACzBA,EAAW,WACP4M,EAAOlM,oBAAoBS,EAAMnB,GACjCmsB,EAAmBjjC,MAAMN,KAAMI,YAGvC,IAAIojC,EAAY,CACZxf,OAAQA,EACRzL,KAAMA,EACNnB,SAAUA,GAGd,OADA4M,EAAOrM,iBAAiBY,EAAMnB,GACvBosB,EAsBJ,SAASC,GAAWzf,EAAQzL,EAAMnB,EAAUisB,GAC/C,OAAOD,GAAOpf,EAAQzL,EAAMnB,EAAUisB,GAAU,GAW7C,SAASK,GAAcpnC,GACtBA,GAAOA,EAAI0nB,SACX1nB,EAAI0nB,OAAOlM,oBAAoBxb,EAAIic,KAAMjc,EAAI8a,UAC7C,GAAM9a,IC/Fd,IAAI,GAAwC,WACxC,IAAIiD,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAkDxC,GAA4B,SAAUu7B,GAEtC,SAASqI,IACL,IAAI7nB,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAWjC,OAVA8b,EAAM3E,GACkE2E,EAAgB,WACxFA,EAAM8nB,KACkE9nB,EAAkB,aAC1FA,EAAM+nB,GAAiD/nB,EAAgB,WAKvEA,EAAMgoB,UAAY,EACXhoB,EA+EX,OA5FA,GAAU6nB,EAAYrI,GAmBtBqI,EAAWhnC,UAAUonC,QAAU,aACzB/jC,KAAK8jC,UACP9jC,KAAKqY,cAAc2rB,KAQvBL,EAAWhnC,UAAUsnC,YAAc,WAC/B,OAAOjkC,KAAK8jC,WAQhBH,EAAWhnC,UAAUunC,WAAa,SAAU3rB,EAAMnB,GAC9C,GAAIzX,MAAMgC,QAAQ4W,GAAO,CAGrB,IAFA,IAAI2D,EAAM3D,EAAKlY,OACXod,EAAO,IAAI9d,MAAMuc,GACZnhB,EAAI,EAAGA,EAAImhB,IAAOnhB,EACvB0iB,EAAK1iB,GAAKqoC,GAAOpjC,KAAMuY,EAAKxd,GAAIqc,GAEpC,OAAOqG,EAGP,OAAO2lB,GAAOpjC,KAA4B,EAAQoX,IAS1DusB,EAAWhnC,UAAUwnC,aAAe,SAAU5rB,EAAMnB,GAChD,IAAI9a,EACJ,GAAIqD,MAAMgC,QAAQ4W,GAAO,CACrB,IAAI2D,EAAM3D,EAAKlY,OACf/D,EAAM,IAAIqD,MAAMuc,GAChB,IAAK,IAAInhB,EAAI,EAAGA,EAAImhB,IAAOnhB,EACvBuB,EAAIvB,GAAK0oC,GAAWzjC,KAAMuY,EAAKxd,GAAIqc,QAIvC9a,EAAMmnC,GAAWzjC,KAA4B,EAAQoX,GAGzD,OADsB,EAAWgtB,OAAS9nC,EACnCA,GAQXqnC,EAAWhnC,UAAU0nC,WAAa,SAAU9rB,EAAMnB,GAC9C,IAAI9a,EAA4B,EAAW8nC,OAC3C,GAAI9nC,GAkDL,SAAiBA,GACpB,GAAIqD,MAAMgC,QAAQrF,GACd,IAAK,IAAIvB,EAAI,EAAG2hC,EAAKpgC,EAAI+D,OAAQtF,EAAI2hC,IAAM3hC,EACvC2oC,GAAcpnC,EAAIvB,SAItB2oC,GAA6D,GAxDzDY,CAAQhoC,QAEP,GAAIqD,MAAMgC,QAAQ4W,GACnB,IAAK,IAAIxd,EAAI,EAAG2hC,EAAKnkB,EAAKlY,OAAQtF,EAAI2hC,IAAM3hC,EACxCiF,KAAK8X,oBAAoBS,EAAKxd,GAAIqc,QAItCpX,KAAK8X,oBAAoBS,EAAMnB,IAGhCusB,EA7FoB,CA8F7B,IAWF,GAAWhnC,UAAUwa,GAWrB,GAAWxa,UAAUinC,KAQrB,GAAWjnC,UAAUknC,GAiBN,UC/LX,GAAwC,WACxC,IAAItkC,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA2BxCwkC,GAA6B,SAAUjJ,GAOvC,SAASiJ,EAAYhsB,EAAMjc,EAAKkoC,GAC5B,IAAI1oB,EAAQwf,EAAOpgC,KAAK8E,KAAMuY,IAASvY,KAcvC,OARA8b,EAAMxf,IAAMA,EAOZwf,EAAM0oB,SAAWA,EACV1oB,EAEX,OAvBA,GAAUyoB,EAAajJ,GAuBhBiJ,EAxBqB,CAyB9BtsB,IAgNa,GA7JiB,SAAUqjB,GAKtC,SAASmJ,EAAWC,GAChB,IAAI5oB,EAAQwf,EAAOpgC,KAAK8E,OAASA,KA0BjC,OAtBA8b,EAAM3E,GAIN2E,EAAM8nB,KAIN9nB,EAAM+nB,GAKNxJ,GAAOve,GAKPA,EAAM6oB,QAAU,UACGrQ,IAAfoQ,GACA5oB,EAAM8oB,cAAcF,GAEjB5oB,EA2HX,OA1JA,GAAU2oB,EAAYnJ,GAuCtBmJ,EAAW9nC,UAAUf,IAAM,SAAUU,GACjC,IAAIN,EAIJ,OAHIgE,KAAK2kC,SAAW3kC,KAAK2kC,QAAQ/nC,eAAeN,KAC5CN,EAAQgE,KAAK2kC,QAAQroC,IAElBN,GAOXyoC,EAAW9nC,UAAUkoC,QAAU,WAC3B,OAAQ7kC,KAAK2kC,SAAWlpC,OAAOgiB,KAAKzd,KAAK2kC,UAAa,IAO1DF,EAAW9nC,UAAUmoC,cAAgB,WACjC,OAAQ9kC,KAAK2kC,SAAW,GAAO,GAAI3kC,KAAK2kC,UAAa,IAKzDF,EAAW9nC,UAAUooC,cAAgB,WACjC,QAAS/kC,KAAK2kC,SAMlBF,EAAW9nC,UAAUqoC,OAAS,SAAU1oC,EAAKkoC,GACzC,IAAIS,EACJA,EAAY,UAAY3oC,EACxB0D,KAAKqY,cAAc,IAAIksB,GAAYU,EAAW3oC,EAAKkoC,IACnDS,EAAYC,GACZllC,KAAKqY,cAAc,IAAIksB,GAAYU,EAAW3oC,EAAKkoC,KAMvDC,EAAW9nC,UAAUwoC,kBAAoB,SAAU7oC,EAAK8a,GACpDpX,KAAK2X,iBAAiB,UAAYrb,EAAK8a,IAM3CqtB,EAAW9nC,UAAUyoC,qBAAuB,SAAU9oC,EAAK8a,GACvDpX,KAAK8X,oBAAoB,UAAYxb,EAAK8a,IAS9CqtB,EAAW9nC,UAAU8kC,IAAM,SAAUnlC,EAAKN,EAAOqpC,GAC7C,IAAIt5B,EAAS/L,KAAK2kC,UAAY3kC,KAAK2kC,QAAU,IAC7C,GAAIU,EACAt5B,EAAOzP,GAAON,MAEb,CACD,IAAIwoC,EAAWz4B,EAAOzP,GACtByP,EAAOzP,GAAON,EACVwoC,IAAaxoC,GACbgE,KAAKglC,OAAO1oC,EAAKkoC,KAW7BC,EAAW9nC,UAAUioC,cAAgB,SAAU74B,EAAQs5B,GACnD,IAAK,IAAI/oC,KAAOyP,EACZ/L,KAAKyhC,IAAInlC,EAAKyP,EAAOzP,GAAM+oC,IAQnCZ,EAAW9nC,UAAU2oC,gBAAkB,SAAU52B,GACxCA,EAAOi2B,SAGZ,GAAO3kC,KAAK2kC,UAAY3kC,KAAK2kC,QAAU,IAAKj2B,EAAOi2B,UAQvDF,EAAW9nC,UAAU4oC,MAAQ,SAAUjpC,EAAK+oC,GACxC,GAAIrlC,KAAK2kC,SAAWroC,KAAO0D,KAAK2kC,QAAS,CACrC,IAAIH,EAAWxkC,KAAK2kC,QAAQroC,UACrB0D,KAAK2kC,QAAQroC,GAChB,GAAQ0D,KAAK2kC,WACb3kC,KAAK2kC,QAAU,MAEdU,GACDrlC,KAAKglC,OAAO1oC,EAAKkoC,KAItBC,EA3JoB,CA4J7B,IC7Pa,GACF,UADE,GAEF,UAFE,GAGH,SAHG,GAIF,SAJE,GAKK,gBALL,GAMK,gBANL,GAOD,UAPC,GAQD,UARC,GASH,SCfR,GAAwC,WACxC,IAAIllC,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAwV7B,GAvRgB,SAAUu7B,GAKrC,SAASkK,EAAUluB,GACf,IAAIwE,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAIjC8b,EAAM3E,GAIN2E,EAAM8nB,KAIN9nB,EAAM+nB,GAIN,IAAI4B,EAAa,GAAO,GAAInuB,GAgC5B,MA/BkC,iBAAvBA,EAAQmuB,oBACRA,EAAWA,WAClB,GAAOA,EAAYnuB,EAAQmuB,aAE/BA,EAAW,SACanR,IAApBhd,EAAQ2B,QAAwB3B,EAAQ2B,QAAU,EACtDyiB,GAAoD,iBAAtC+J,EAAW,IAAqC,IAC9DA,EAAW,SACanR,IAApBhd,EAAQrN,SAAwBqN,EAAQrN,QAC5Cw7B,EAAW,IAAyBnuB,EAAQouB,OAC5CD,EAAW,SACmBnR,IAA1Bhd,EAAQquB,cAA8BruB,EAAQquB,cAAgB7wB,IAClE2wB,EAAW,SACmBnR,IAA1Bhd,EAAQsuB,cAA8BtuB,EAAQsuB,cAAgB,EAClEH,EAAW,SACanR,IAApBhd,EAAQuuB,QAAwBvuB,EAAQuuB,SAAW/wB,IACvD2wB,EAAW,SACanR,IAApBhd,EAAQwuB,QAAwBxuB,EAAQwuB,QAAUhxB,IAKtDgH,EAAMiqB,gBACuBzR,IAAzBmR,EAAW//B,UAA0B4R,EAAQ5R,UAAY,kBACtD+/B,EAAW//B,UAClBoW,EAAM8oB,cAAca,GAKpB3pB,EAAMkqB,OAAS,KACRlqB,EA+NX,OApRA,GAAU0pB,EAAWlK,GA0DrBkK,EAAU7oC,UAAUspC,aAAe,WAC/B,OAAOjmC,KAAK+lC,YAShBP,EAAU7oC,UAAUupC,cAAgB,SAAUC,GAE1C,IAAIC,EAAQpmC,KAAKgmC,QACI,CACbK,MAAOrmC,KACPsmC,aAAyBhS,IAAhB6R,GAAmCA,GAEhDT,EAAS1lC,KAAKumC,YAWlB,OAVAH,EAAMntB,QAAU6mB,GAAMx9B,KAAK+F,MAA0B,IAApBrI,KAAKwmC,cAAsB,IAAK,EAAG,GACpEJ,EAAMK,YAAczmC,KAAK0mC,iBACzBN,EAAMn8B,QAAUjK,KAAK2mC,aACrBP,EAAM5J,OAASx8B,KAAK4mC,YACpBR,EAAMV,YAAoBpR,IAAXoR,GAAyBU,EAAME,QAAqBZ,EAAX5wB,IACxDsxB,EAAMT,cAAgB3lC,KAAK6mC,mBAC3BT,EAAMR,cAAgBtjC,KAAKgG,IAAItI,KAAK8mC,mBAAoB,GACxDV,EAAMP,QAAU7lC,KAAK+mC,aACrBX,EAAMN,QAAU9lC,KAAKgnC,aACrBhnC,KAAKgmC,OAASI,EACPA,GAQXZ,EAAU7oC,UAAUsqC,eAAiB,SAAUC,GAC3C,OAAO,MAQX1B,EAAU7oC,UAAUwqC,oBAAsB,SAAUC,GAChD,OAAO,MASX5B,EAAU7oC,UAAUiqC,UAAY,WAC5B,OAA+D5mC,KAAKpE,IAAI,KAQ5E4pC,EAAU7oC,UAAUkqC,iBAAmB,WACnC,OAA8B7mC,KAAKpE,IAAI,KAQ3C4pC,EAAU7oC,UAAUmqC,iBAAmB,WACnC,OAA8B9mC,KAAKpE,IAAI,KAQ3C4pC,EAAU7oC,UAAUoqC,WAAa,WAC7B,OAA8B/mC,KAAKpE,IAAI,KAQ3C4pC,EAAU7oC,UAAUqqC,WAAa,WAC7B,OAA8BhnC,KAAKpE,IAAI,KAQ3C4pC,EAAU7oC,UAAU6pC,WAAa,WAC7B,OAA8BxmC,KAAKpE,IAAI,KAM3C4pC,EAAU7oC,UAAU+pC,eAAiB,WACjC,OAAO,MAQXlB,EAAU7oC,UAAUgqC,WAAa,WAC7B,OAA+B3mC,KAAKpE,IAAI,KAS5C4pC,EAAU7oC,UAAU4pC,UAAY,WAC5B,OAA8BvmC,KAAKpE,IAAI,KAS3C4pC,EAAU7oC,UAAU0qC,UAAY,SAAU7K,GACtCx8B,KAAKyhC,IAAI,GAAsBjF,IAQnCgJ,EAAU7oC,UAAU2qC,iBAAmB,SAAU3B,GAC7C3lC,KAAKyhC,IAAI,GAA8BkE,IAQ3CH,EAAU7oC,UAAU4qC,iBAAmB,SAAU3B,GAC7C5lC,KAAKyhC,IAAI,GAA8BmE,IAU3CJ,EAAU7oC,UAAU6qC,WAAa,SAAU1B,GACvC9lC,KAAKyhC,IAAI,GAAwBqE,IAUrCN,EAAU7oC,UAAU8qC,WAAa,SAAU5B,GACvC7lC,KAAKyhC,IAAI,GAAwBoE,IAQrCL,EAAU7oC,UAAU+qC,WAAa,SAAUzuB,GACvCyiB,GAA0B,iBAAZziB,EAAsB,IACpCjZ,KAAKyhC,IAAI,GAAuBxoB,IAQpCusB,EAAU7oC,UAAUgrC,WAAa,SAAU19B,GACvCjK,KAAKyhC,IAAI,GAAuBx3B,IASpCu7B,EAAU7oC,UAAUirC,UAAY,SAAUC,GACtC7nC,KAAKyhC,IAAI,GAAuBoG,IAKpCrC,EAAU7oC,UAAU+8B,gBAAkB,WAC9B15B,KAAKgmC,SACLhmC,KAAKgmC,OAAOK,MAAQ,KACpBrmC,KAAKgmC,OAAS,MAElB1K,EAAO3+B,UAAU+8B,gBAAgBx+B,KAAK8E,OAEnCwlC,EArRmB,CAsR5B,ICjVa,GAMA,YANA,GAYC,aAZD,GAmBC,aAnBD,GA0BE,cA1BF,GAkCK,iBCjCL,GACA,YADA,GAGJ,QCVP,GAAwC,WACxC,IAAIjmC,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAgVrC,SAAS+nC,GAAOC,EAAYC,GAC/B,IAAKD,EAAW99B,QACZ,OAAO,EAEX,IAAIy0B,EAAasJ,EAAUtJ,WAC3B,GAAIA,EAAaqJ,EAAWnC,eACxBlH,GAAcqJ,EAAWpC,cACzB,OAAO,EAEX,IAAI9vB,EAAOmyB,EAAUnyB,KACrB,OAAOA,EAAOkyB,EAAWlC,SAAWhwB,GAAQkyB,EAAWjC,QAE5C,OAhPY,SAAUxK,GAKjC,SAAS2M,EAAM3wB,GACX,IAAIwE,EAAQ9b,KACRkoC,EAAc,GAAO,GAAI5wB,UACtB4wB,EAAYx5B,QACnBoN,EAAQwf,EAAOpgC,KAAK8E,KAAMkoC,IAAgBloC,MAIpCmX,GAIN2E,EAAM8nB,KAIN9nB,EAAM+nB,GAKN/nB,EAAMqsB,kBAAoB,KAK1BrsB,EAAMssB,cAAgB,KAKtBtsB,EAAMusB,iBAAmB,KAKzBvsB,EAAMwsB,UAAY,KAEdhxB,EAAQixB,SACRzsB,EAAMysB,OAASjxB,EAAQixB,QAEvBjxB,EAAQ3L,KACRmQ,EAAM0sB,OAAOlxB,EAAQ3L,KAEzBmQ,EAAMqpB,kBAAkB,GAAsBrpB,EAAM2sB,6BACpD,IAAI/5B,EAAS4I,EAAQ5I,OACY4I,EAAc,OACzC,KAEN,OADAwE,EAAM4sB,UAAUh6B,GACToN,EAqKX,OA1NA,GAAUmsB,EAAO3M,GA2DjB2M,EAAMtrC,UAAUsqC,eAAiB,SAAUC,GACvC,IAAI9oC,EAAQ8oC,GAAwB,GAEpC,OADA9oC,EAAMyC,KAAKb,MACJ5B,GAMX6pC,EAAMtrC,UAAUwqC,oBAAsB,SAAUC,GAC5C,IAAIuB,EAASvB,GAA0B,GAEvC,OADAuB,EAAO9nC,KAAKb,KAAKkmC,iBACVyC,GAQXV,EAAMtrC,UAAUisC,UAAY,WACxB,OAAkC5oC,KAAKpE,IAAI,KAA0B,MAKzEqsC,EAAMtrC,UAAU+pC,eAAiB,WAC7B,IAAIh4B,EAAS1O,KAAK4oC,YAClB,OAAQl6B,EAAiCA,EAAOm6B,WAA/B,IAKrBZ,EAAMtrC,UAAUmsC,oBAAsB,WAClC9oC,KAAK+jC,WAKTkE,EAAMtrC,UAAU8rC,4BAA8B,WACtCzoC,KAAKqoC,mBACL3E,GAAc1jC,KAAKqoC,kBACnBroC,KAAKqoC,iBAAmB,MAE5B,IAAI35B,EAAS1O,KAAK4oC,YACdl6B,IACA1O,KAAKqoC,iBAAmBjF,GAAO10B,EAAQs1B,GAAkBhkC,KAAK8oC,oBAAqB9oC,OAEvFA,KAAK+jC,WAOTkE,EAAMtrC,UAAUosC,YAAc,SAAUC,GACpC,OAAKhpC,KAAKsoC,UAGHtoC,KAAKsoC,UAAUS,YAAYC,GAFvB,IAAIC,SAAQ,SAAUC,GAAW,OAAOA,EAAQ,QAY/DjB,EAAMtrC,UAAU4rC,OAAS,SAAUY,EAAYnlB,GAC3C,IAAIolB,EAAgBppC,KAAKqpC,cACzB,GAAID,EAAcE,aAAaH,GAC3B,OAAOC,EAAcG,YAAYJ,EAAYnlB,IAerDikB,EAAMtrC,UAAU6rC,OAAS,SAAU78B,GAC3B3L,KAAKmoC,oBACLzE,GAAc1jC,KAAKmoC,mBACnBnoC,KAAKmoC,kBAAoB,MAExBx8B,GACD3L,KAAK+jC,UAEL/jC,KAAKooC,gBACL1E,GAAc1jC,KAAKooC,eACnBpoC,KAAKooC,cAAgB,MAErBz8B,IACA3L,KAAKmoC,kBAAoB/E,GAAOz3B,EAAK,IAA4B,SAAUi3B,GACvE,IAEI4G,EADgD,EACjBL,WAAWK,iBAC1CzB,EAAa/nC,KAAKkmC,eAAc,GAEpCxK,IAAQ8N,EAAiBC,MAAK,SAAUC,GACpC,OAAOA,EAAgBrD,QAAU0B,EAAW1B,SAC5C,IACJmD,EAAiB3oC,KAAKknC,KACvB/nC,MACHA,KAAKooC,cAAgBhF,GAAOpjC,KAAMgkC,GAAkBr4B,EAAI48B,OAAQ58B,GAChE3L,KAAK+jC,YASbkE,EAAMtrC,UAAU+rC,UAAY,SAAUh6B,GAClC1O,KAAKyhC,IAAI,GAAsB/yB,IAMnCu5B,EAAMtrC,UAAU0sC,YAAc,WAI1B,OAHKrpC,KAAKsoC,YACNtoC,KAAKsoC,UAAYtoC,KAAK2pC,kBAEnB3pC,KAAKsoC,WAKhBL,EAAMtrC,UAAUitC,YAAc,WAC1B,QAAS5pC,KAAKsoC,WAOlBL,EAAMtrC,UAAUgtC,eAAiB,WAC7B,OAAO,MAKX1B,EAAMtrC,UAAU+8B,gBAAkB,WAC1B15B,KAAKsoC,YACLtoC,KAAKsoC,UAAU7O,iBACRz5B,KAAKsoC,WAEhBtoC,KAAK0oC,UAAU,MACfpN,EAAO3+B,UAAU+8B,gBAAgBx+B,KAAK8E,OAEnCioC,EA3Ne,CA4NxB,ICxGK,SAAS,GAAO4B,EAAaC,GAEhC,IADA,IAAIjQ,GAAS,EACJ9+B,EAAI8uC,EAAYxpC,OAAS,EAAGtF,GAAK,IAAKA,EAC3C,GAAI8uC,EAAY9uC,IAAM+uC,EAAY/uC,GAAI,CAClC8+B,GAAS,EACT,MAGR,OAAOA,EAoBJ,SAAS,GAAOiC,EAAYpd,GAC/B,IAAIqrB,EAAWznC,KAAKyK,IAAI2R,GACpBsrB,EAAW1nC,KAAK8I,IAAIsT,GACpB/a,EAAIm4B,EAAW,GAAKiO,EAAWjO,EAAW,GAAKkO,EAC/CpmC,EAAIk4B,EAAW,GAAKiO,EAAWjO,EAAW,GAAKkO,EAGnD,OAFAlO,EAAW,GAAKn4B,EAChBm4B,EAAW,GAAKl4B,EACTk4B,EA8IJ,SAASmO,GAAcnO,EAAYoO,EAAYC,GAClD,IAAIC,EAAmBF,EAAWtD,YAC9ByD,EAAa,EACjB,GAAIH,EAAWI,aACVxO,EAAW,GAAKsO,EAAiB,IAAMtO,EAAW,GAAKsO,EAAiB,IAAK,CAC9E,IAAIG,EAAoBJ,GAAyBhM,GAASiM,GAC1DC,EAAa/nC,KAAKohB,OAAOoY,EAAW,GAAKsO,EAAiB,IAAMG,GAEpE,OAAOF,ECzZX,IAAI,GAAwC,WACxC,IAAI9qC,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAiN5C,SAASyqC,GAAgB7+B,EAAKw9B,GAC1B,GAAe/H,SAEJ,OA9KkB,SAAU9F,GAKvC,SAASmP,EAAY9+B,GACjB,IAAImQ,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAMjC,OADA8b,EAAM4uB,KAAO/+B,EACNmQ,EAyJX,OApKA,GAAU2uB,EAAanP,GAkBvBmP,EAAY9tC,UAAUguC,oBAAsB,SAAUpyB,EAAM4wB,GACxD,MAMJsB,EAAY9tC,UAAUiuC,oBAAsB,SAAUzB,GAClD,IAAInB,EAAYmB,EAAWnB,UACvB6C,EAA6B1B,EAAW0B,2BACxCC,EAA6B3B,EAAW2B,2BAC5C/O,GAAiB8O,EAA4B1B,EAAWr1B,KAAK,GAAK,EAAGq1B,EAAWr1B,KAAK,GAAK,EAAG,EAAIk0B,EAAUtJ,YAAa,EAAIsJ,EAAUtJ,YAAasJ,EAAUrJ,UAAWqJ,EAAUjS,OAAO,IAAKiS,EAAUjS,OAAO,IAC/MqG,GAAY0O,EAA4BD,IAiB5CJ,EAAY9tC,UAAUouC,2BAA6B,SAAUjP,EAAYqN,EAAY6B,EAAcC,EAAcvpB,EAAUwpB,EAASC,EAAaC,GAC7I,IAAIjpC,EACA6lC,EAAYmB,EAAWnB,UAQ3B,SAAS+C,EAA2BzE,EAAS+E,EAAShF,EAAOiF,GACzD,OAAO5pB,EAASxmB,KAAKgwC,EAASG,EAAS/E,EAAUD,EAAQ,KAAMiF,GAEnE,IAAIpB,EAAalC,EAAUkC,WACvBqB,ED6RL,SAAezP,EAAYoO,GAC9B,GAAIA,EAAWI,WAAY,CACvB,IAAIkB,EAAarN,GAAS+L,EAAWtD,aACjCyD,EAAaJ,GAAcnO,EAAYoO,EAAYsB,GACnDnB,IACAvO,EAAW,IAAMuO,EAAamB,GAGtC,OAAO1P,ECrSwB,CAAMA,EAAW36B,QAAS+oC,GACjDuB,EAAU,CAAC,CAAC,EAAG,IACnB,GAAIvB,EAAWI,YAAcW,EAAc,CACvC,IACIO,EAAarN,GADM+L,EAAWtD,aAElC6E,EAAQ5qC,KAAK,EAAE2qC,EAAY,GAAI,CAACA,EAAY,IAMhD,IAJA,IAAIE,EAAcvC,EAAWK,iBACzBmC,EAAYD,EAAYrrC,OACxBwa,EAA4C,GAC5C+wB,EAAW,GACN7wC,EAAI,EAAGA,EAAI0wC,EAAQprC,OAAQtF,IAChC,IAAK,IAAIyd,EAAImzB,EAAY,EAAGnzB,GAAK,IAAKA,EAAG,CACrC,IAAIuvB,EAAa2D,EAAYlzB,GACzB6tB,EAAQ0B,EAAW1B,MACvB,GAAIA,EAAMuD,eACN9B,GAAOC,EAAYC,IACnBmD,EAAYjwC,KAAKkwC,EAAU/E,GAAQ,CACnC,IAAI+C,EAAgB/C,EAAMgD,cACtB36B,EAAS23B,EAAMuC,YACnB,GAAIQ,GAAiB16B,EAAQ,CACzB,IAAI6tB,EAAc7tB,EAAOm9B,WACnBN,EACAzP,EACFgQ,EAAaf,EAA2BxuC,KAAK,KAAMwrC,EAAWzB,SAClEsF,EAAS,GAAKrP,EAAY,GAAKkP,EAAQ1wC,GAAG,GAC1C6wC,EAAS,GAAKrP,EAAY,GAAKkP,EAAQ1wC,GAAG,GAC1CoH,EAASinC,EAAc2B,2BAA2Ba,EAAUzC,EAAY6B,EAAcc,EAAYjxB,GAEtG,GAAI1Y,EACA,OAAOA,GAKvB,GAAuB,IAAnB0Y,EAAQxa,OAAZ,CAGA,IAAI0rC,EAAQ,EAAIlxB,EAAQxa,OAMxB,OALAwa,EAAQjR,SAAQ,SAAUzO,EAAGJ,GAAK,OAAQI,EAAE6wC,YAAcjxC,EAAIgxC,KAC9DlxB,EAAQoO,MAAK,SAAU9e,EAAG3K,GAAK,OAAO2K,EAAE6hC,WAAaxsC,EAAEwsC,cACvDnxB,EAAQ4uB,MAAK,SAAUtuC,GACnB,OAAQgH,EAAShH,EAAEumB,SAASvmB,EAAEkwC,QAASlwC,EAAEkrC,MAAOlrC,EAAEmwC,aAE/CnpC,IAgBXsoC,EAAY9tC,UAAUsvC,oBAAsB,SAAUjD,EAAOG,EAAY6B,EAActpB,EAAUypB,GAC7F,OAAO,MAeXV,EAAY9tC,UAAUuvC,uBAAyB,SAAUpQ,EAAYqN,EAAY6B,EAAcC,EAAcE,EAAaD,GAEtH,YAAsB5W,IADLt0B,KAAK+qC,2BAA2BjP,EAAYqN,EAAY6B,EAAcC,EAAchR,GAAMj6B,KAAMmrC,EAAaD,IAMlIT,EAAY9tC,UAAUwvC,OAAS,WAC3B,OAAOnsC,KAAK0qC,MAOhBD,EAAY9tC,UAAU4sC,YAAc,SAAUJ,GAC1C,MAMJsB,EAAY9tC,UAAUyvC,wBAA0B,SAAUjD,GAClD,GAAehI,kBACfgI,EAAWkD,oBAAoBxrC,KAAK2pC,KAGrCC,EArKqB,CAsK9B,ICzME,GAAwC,WACxC,IAAIlrC,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAmD7B,GAnCkB,SAAUu7B,GASvC,SAASgR,EAAY/zB,EAAMg0B,EAA2BC,EAAgBC,GAClE,IAAI3wB,EAAQwf,EAAOpgC,KAAK8E,KAAMuY,IAASvY,KAqBvC,OAdA8b,EAAM4wB,sBAAwBH,EAM9BzwB,EAAMqtB,WAAaqD,EAOnB1wB,EAAM6wB,QAAUF,EACT3wB,EAEX,OAhCA,GAAUwwB,EAAahR,GAgChBgR,EAjCqB,CAkC9Br0B,ICOE20B,GAAY,IAAIC,OAAO,CACvB,qDACA,4CACA,8DACA,gDACA,8EACA,gEACA,mCACF1jC,KAAK,IAAK,KACR2jC,GAAsB,CACtB,QACA,UACA,SACA,OACA,aACA,UAQOC,GAAoB,SAAUC,GACrC,IAAIxzB,EAAQwzB,EAASxzB,MAAMozB,IAC3B,IAAKpzB,EACD,OAAO,KASX,IAPA,IAAIjQ,EAAsC,CACtC0jC,WAAY,SACZn5B,KAAM,QACNvK,MAAO,SACP2jC,OAAQ,SACRC,QAAS,UAEJpyC,EAAI,EAAG2hC,EAAKoQ,GAAoBzsC,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAC1D,IAAIiB,EAAQwd,EAAMze,EAAI,QACRu5B,IAAVt4B,IACAuN,EAAMujC,GAAoB/xC,IAAMiB,GAIxC,OADAuN,EAAM6jC,SAAW7jC,EAAM8jC,OAAOtkC,MAAM,QAC7BQ,GAMJ,SAAS+jC,GAAWr0B,GACvB,OAAmB,IAAZA,EAAgB,GAAKnZ,OAAOwC,KAAK+F,MAAgB,IAAV4Q,GAAiB,KChG5D,SAASs0B,GAAsBC,EAAWC,EAAYC,EAAgBC,GAEzE,IAAIC,EAkBJ,OAjBIF,GAAkBA,EAAertC,OACjCutC,EAASF,EAAexkB,QAEnB6R,GACL6S,EAAS,IAAI3S,gBAAgBuS,GAAa,IAAKC,GAAc,MAG7DG,EAASrpC,SAASS,cAAc,WACzBuE,MAAMskC,IAAM,QAEnBL,IACAI,EAAO3qC,MAAQuqC,GAEfC,IACAG,EAAO1qC,OAASuqC,GAG4BG,EAAOE,WAAW,KAAMH,GAgCrE,SAASI,GAAYC,EAASC,GACjC,IAAI3nC,EAAS2nC,EAAQj6B,WACjB1N,GACAA,EAAO8U,aAAa4yB,EAASC,GAO9B,SAASC,GAAWnvC,GACvB,OAAOA,GAAQA,EAAKiV,WAAajV,EAAKiV,WAAW7O,YAAYpG,GAAQ,KCElE,IA2DIovC,GAAe,IAAI,IASN,IAAI,IACjBzM,QAAU,aAMrB,IAII0M,GAJAC,GAAiB,KAQVC,GAAc,IAKC,WACtB,IAKIC,EAAUC,EAHVC,EAAiB,CAAC,YAAa,SAC/BvyB,EAAMuyB,EAAepuC,OACrBob,EAAO,2BAQX,SAASizB,EAAYC,EAAWC,EAAYlW,GAExC,IADA,IAAImW,GAAY,EACP9zC,EAAI,EAAGA,EAAImhB,IAAOnhB,EAAG,CAC1B,IAAI+zC,EAAgBL,EAAe1zC,GAEnC,GADiBg0C,GAAiBJ,EAAY,IAAMC,EAAlBD,SAA4CG,EAAerzB,GACzFid,GAAcoW,EAAe,CAC7B,IAAI7rC,EAAQ8rC,GAAiBJ,EACzB,IACAC,EAFyBD,SAKzBjW,EACA,IACAoW,EAAerzB,GAGPozB,GAAa5rC,GAASurC,GAG1C,QAAIK,EAKR,SAASG,IAGL,IAFA,IAAIpuC,GAAO,EACPquC,EAAQd,GAAatJ,UAChB9pC,EAAI,EAAG2hC,EAAKuS,EAAM5uC,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAC5C,IAAIkkB,EAAOgwB,EAAMl0C,GACbozC,GAAavyC,IAAIqjB,GAzCf,MA0CEyvB,EAAYpuC,MAAMN,KAAMif,EAAKlW,MAAM,QACnC,GAAMulC,IAEW,UACHha,EACd6Z,GAAa1M,IAAIxiB,EA/CnB,OAkDEkvB,GAAa1M,IAAIxiB,EAAMkvB,GAAavyC,IAAIqjB,GAAQ,GAAG,IAC5C,IAIfre,IACAsuC,cAAcX,QACHja,IA1DG,GAoI1B,SAAS6a,GAAYlwB,EAAMxD,GAQvB,OAPK4yB,IACgBd,GAAsB,EAAG,GAE1CtuB,GAAQmvB,KACRC,GAAepvB,KAAOA,EACRovB,GAAepvB,MAE1BovB,GAAec,YAAY1zB,GAO/B,SAASszB,GAAiB9vB,EAAMxD,GACnC,OAAO0zB,GAAYlwB,EAAMxD,GAAMxY,MC1TnC,IAAI,GAAwC,WACxC,IAAI1D,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAmL7BqvC,GAlJ2B,SAAU9T,GAKhD,SAAS+T,EAAqB1jC,GAC1B,IAAImQ,EAAQwf,EAAOpgC,KAAK8E,KAAM2L,IAAQ3L,KAItC8b,EAAMwzB,uBAAyBlM,GAAO+K,GAAcjJ,GAAgCv5B,EAAI4jC,WAAWhzC,KAAKoP,IAKxGmQ,EAAM0zB,SAAWjrC,SAASS,cAAc,OACxC,IAAIuE,EAAQuS,EAAM0zB,SAASjmC,MAC3BA,EAAM/C,SAAW,WACjB+C,EAAMtG,MAAQ,OACdsG,EAAMrG,OAAS,OACfqG,EAAMm8B,OAAS,IACf5pB,EAAM0zB,SAAS9pC,UAAY+pC,4BAC3B,IAAIC,EAAY/jC,EAAIgkC,cAYpB,OAXAD,EAAUvoC,aAAa2U,EAAM0zB,SAAUE,EAAUxqC,YAAc,MAK/D4W,EAAM8zB,UAAY,GAKlB9zB,EAAM+zB,kBAAmB,EAClB/zB,EA8GX,OA/IA,GAAUuzB,EAAsB/T,GAuChC+T,EAAqB1yC,UAAUguC,oBAAsB,SAAUpyB,EAAM4wB,GACjE,IAAIx9B,EAAM3L,KAAKmsC,SACf,GAAIxgC,EAAI21B,YAAY/oB,GAAO,CACvB,IAAIu3B,EAAU,IAAI,GAAYv3B,OAAM+b,EAAW6U,GAC/Cx9B,EAAI0M,cAAcy3B,KAG1BT,EAAqB1yC,UAAU+8B,gBAAkB,WAC7CgK,GAAc1jC,KAAKsvC,wBACnBtvC,KAAKwvC,SAASx7B,WAAW7O,YAAYnF,KAAKwvC,UAC1ClU,EAAO3+B,UAAU+8B,gBAAgBx+B,KAAK8E,OAM1CqvC,EAAqB1yC,UAAU4sC,YAAc,SAAUJ,GACnD,GAAKA,EAAL,CAOAnpC,KAAK4qC,oBAAoBzB,GACzBnpC,KAAK2qC,oBAAoB,GAA4BxB,GACrD,IAAIK,EAAmBL,EAAWK,iBAAiBvgB,MAAK,SAAU9e,EAAG3K,GACjE,OAAO2K,EAAEu7B,OAASlmC,EAAEkmC,UAEpBsC,EAAYmB,EAAWnB,UAC3BhoC,KAAK4vC,UAAUvvC,OAAS,EAMxB,IAFA,IAAI0vC,EAAkB,GAClBC,EAAkB,KACbj1C,EAAI,EAAG2hC,EAAK8M,EAAiBnpC,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CACvD,IAAIgtC,EAAayB,EAAiBzuC,GAElC,GADAouC,EAAW8G,WAAal1C,EACnB+sC,GAAOC,EAAYC,KACnBD,EAAWtB,aAAe,IACvBsB,EAAWtB,aAAe,IAFlC,CAKA,IAAIJ,EAAQ0B,EAAW1B,MACnBznC,EAAUynC,EAAMkC,OAAOY,EAAY6G,GAClCpxC,IAGDA,IAAYoxC,IACZhwC,KAAK4vC,UAAU/uC,KAAKjC,GACpBoxC,EAAkBpxC,GAElB,iBAAkBynC,GAClB0J,EAAgBlvC,KACwC,KAGhE,IAAS9F,EAAIg1C,EAAgB1vC,OAAS,EAAGtF,GAAK,IAAKA,EAC/Cg1C,EAAgBh1C,GAAGm1C,gBAAgB/G,IFtCxC,SAAyBpqC,EAAMwH,GAElC,IADA,IAAI4pC,EAAcpxC,EAAKgb,WACdhf,EAAI,KAAWA,EAAG,CACvB,IAAIq1C,EAAWD,EAAYp1C,GACvBs1C,EAAW9pC,EAASxL,GAExB,IAAKq1C,IAAaC,EACd,MAGAD,IAAaC,IAIZD,EAKAC,EAMLtxC,EAAKoI,aAAakpC,EAAUD,IALxBrxC,EAAKoG,YAAYirC,KACfr1C,GANFgE,EAAK+a,YAAYu2B,KEyBrBC,CAAgBtwC,KAAKwvC,SAAUxvC,KAAK4vC,WACpC5vC,KAAK2qC,oBAAoB,GAA6BxB,GACjDnpC,KAAK6vC,mBACN7vC,KAAKwvC,SAASjmC,MAAMgnC,QAAU,GAC9BvwC,KAAK6vC,kBAAmB,GAE5B7vC,KAAKosC,wBAAwBjD,QAjDrBnpC,KAAK6vC,mBACL7vC,KAAKwvC,SAASjmC,MAAMgnC,QAAU,OAC9BvwC,KAAK6vC,kBAAmB,IA8DpCR,EAAqB1yC,UAAUsvC,oBAAsB,SAAUjD,EAAOG,EAAY6B,EAActpB,EAAUypB,GAItG,IAHA,IAAInD,EAAYmB,EAAWnB,UACvB0D,EAAcvC,EAAWK,iBAEpBzuC,EADO2wC,EAAYrrC,OACH,EAAGtF,GAAK,IAAKA,EAAG,CACrC,IAAIgtC,EAAa2D,EAAY3wC,GACzBsrC,EAAQ0B,EAAW1B,MACvB,GAAIA,EAAMuD,eACN9B,GAAOC,EAAYC,IACnBmD,EAAY9E,GAAQ,CACpB,IACIn8B,EADgBm8B,EAAMgD,cACDmH,eAAexH,EAAOG,EAAY6B,GAC3D,GAAI9gC,EAAM,CACN,IAAI/H,EAASuf,EAAS2kB,EAAOn8B,GAC7B,GAAI/H,EACA,OAAOA,MAOpBktC,EAhJ8B,CAiJvC,IC5Ka,GAMN,MANM,GAYH,SClBR,GAAwC,WACxC,IAAI9vC,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA0BxC,GACQ,SAOR0wC,GAAiC,SAAUnV,GAO3C,SAASmV,EAAgBl4B,EAAMm4B,EAAaC,GACxC,IAAI70B,EAAQwf,EAAOpgC,KAAK8E,KAAMuY,IAASvY,KAavC,OAPA8b,EAAMld,QAAU8xC,EAMhB50B,EAAMrV,MAAQkqC,EACP70B,EAEX,OAtBA,GAAU20B,EAAiBnV,GAsBpBmV,EAvByB,CAwBlCx4B,IAiPa,GArNiB,SAAUqjB,GAMtC,SAASsV,EAAW1J,EAAW2J,GAC3B,IAAI/0B,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAIjC8b,EAAM3E,GAIN2E,EAAM8nB,KAIN9nB,EAAM+nB,GACN,IAAIvsB,EAAUu5B,GAAe,GAW7B,GANA/0B,EAAMg1B,UAAYx5B,EAAQy5B,OAK1Bj1B,EAAMk1B,OAAS9J,GAAwB,GACnCprB,EAAMg1B,QACN,IAAK,IAAI/1C,EAAI,EAAG2hC,EAAK5gB,EAAMk1B,OAAO3wC,OAAQtF,EAAI2hC,IAAM3hC,EAChD+gB,EAAMm1B,cAAcn1B,EAAMk1B,OAAOj2C,GAAIA,GAI7C,OADA+gB,EAAMo1B,gBACCp1B,EA8KX,OAlNA,GAAU80B,EAAYtV,GA0CtBsV,EAAWj0C,UAAUykB,MAAQ,WACzB,KAAOphB,KAAKmxC,YAAc,GACtBnxC,KAAKsiB,OAUbsuB,EAAWj0C,UAAUoJ,OAAS,SAAUmQ,GACpC,IAAK,IAAInb,EAAI,EAAG2hC,EAAKxmB,EAAI7V,OAAQtF,EAAI2hC,IAAM3hC,EACvCiF,KAAKa,KAAKqV,EAAInb,IAElB,OAAOiF,MASX4wC,EAAWj0C,UAAUiN,QAAU,SAAUmF,GAErC,IADA,IAAI3Q,EAAQ4B,KAAKgxC,OACRj2C,EAAI,EAAG2hC,EAAKt+B,EAAMiC,OAAQtF,EAAI2hC,IAAM3hC,EACzCgU,EAAE3Q,EAAMrD,GAAIA,EAAGqD,IAWvBwyC,EAAWj0C,UAAUy0C,SAAW,WAC5B,OAAOpxC,KAAKgxC,QAQhBJ,EAAWj0C,UAAUmtB,KAAO,SAAUrjB,GAClC,OAAOzG,KAAKgxC,OAAOvqC,IAQvBmqC,EAAWj0C,UAAUw0C,UAAY,WAC7B,OAAOnxC,KAAKpE,IAAI,KAQpBg1C,EAAWj0C,UAAU00C,SAAW,SAAU5qC,EAAO6qC,GACzCtxC,KAAK8wC,SACL9wC,KAAKixC,cAAcK,GAEvBtxC,KAAKgxC,OAAOnoB,OAAOpiB,EAAO,EAAG6qC,GAC7BtxC,KAAKkxC,gBACLlxC,KAAKqY,cAAc,IAAIo4B,GAAgBc,GAAyBD,EAAM7qC,KAQ1EmqC,EAAWj0C,UAAU2lB,IAAM,WACvB,OAAOtiB,KAAKwxC,SAASxxC,KAAKmxC,YAAc,IAQ5CP,EAAWj0C,UAAUkE,KAAO,SAAUywC,GAC9BtxC,KAAK8wC,SACL9wC,KAAKixC,cAAcK,GAEvB,IAAI90C,EAAIwD,KAAKmxC,YAEb,OADAnxC,KAAKqxC,SAAS70C,EAAG80C,GACVtxC,KAAKmxC,aAQhBP,EAAWj0C,UAAUkK,OAAS,SAAUyqC,GAEpC,IADA,IAAIp7B,EAAMlW,KAAKgxC,OACNj2C,EAAI,EAAG2hC,EAAKxmB,EAAI7V,OAAQtF,EAAI2hC,IAAM3hC,EACvC,GAAImb,EAAInb,KAAOu2C,EACX,OAAOtxC,KAAKwxC,SAASz2C,IAYjC61C,EAAWj0C,UAAU60C,SAAW,SAAU/qC,GACtC,IAAIC,EAAO1G,KAAKgxC,OAAOvqC,GAIvB,OAHAzG,KAAKgxC,OAAOnoB,OAAOpiB,EAAO,GAC1BzG,KAAKkxC,gBACLlxC,KAAKqY,cAAc,IAAIo4B,GAAgBc,GAA4B7qC,EAAMD,IAClEC,GAQXkqC,EAAWj0C,UAAU80C,MAAQ,SAAUhrC,EAAO6qC,GAC1C,IAAI90C,EAAIwD,KAAKmxC,YACb,GAAI1qC,EAAQjK,EAAG,CACPwD,KAAK8wC,SACL9wC,KAAKixC,cAAcK,EAAM7qC,GAE7B,IAAIC,EAAO1G,KAAKgxC,OAAOvqC,GACvBzG,KAAKgxC,OAAOvqC,GAAS6qC,EACrBtxC,KAAKqY,cAAc,IAAIo4B,GAAgBc,GAA4B7qC,EAAMD,IACzEzG,KAAKqY,cAAc,IAAIo4B,GAAgBc,GAAyBD,EAAM7qC,QAErE,CACD,IAAK,IAAI+R,EAAIhc,EAAGgc,EAAI/R,IAAS+R,EACzBxY,KAAKqxC,SAAS74B,OAAG8b,GAErBt0B,KAAKqxC,SAAS5qC,EAAO6qC,KAM7BV,EAAWj0C,UAAUu0C,cAAgB,WACjClxC,KAAKyhC,IAAI,GAAiBzhC,KAAKgxC,OAAO3wC,SAO1CuwC,EAAWj0C,UAAUs0C,cAAgB,SAAUK,EAAMI,GACjD,IAAK,IAAI32C,EAAI,EAAG2hC,EAAK18B,KAAKgxC,OAAO3wC,OAAQtF,EAAI2hC,IAAM3hC,EAC/C,GAAIiF,KAAKgxC,OAAOj2C,KAAOu2C,GAAQv2C,IAAM22C,EACjC,MAAM,IAAI,GAAe,KAI9Bd,EAnNoB,CAoN7B,IC1SE,GAAwC,WACxC,IAAIrxC,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA6DxC,GACQ,SAiMG,GAvLiB,SAAUu7B,GAKtC,SAASqW,EAAWd,GAChB,IAAI/0B,EAAQ9b,KACRsX,EAAUu5B,GAAe,GACzB3I,EAAsC,GAAO,GAAI5wB,UAC9C4wB,EAAY0J,OACnB,IAAIA,EAASt6B,EAAQs6B,OAqCrB,OApCA91B,EAAQwf,EAAOpgC,KAAK8E,KAAMkoC,IAAgBloC,MAIpCmX,GAIN2E,EAAM8nB,KAIN9nB,EAAM+nB,GAKN/nB,EAAM+1B,oBAAsB,GAK5B/1B,EAAMg2B,cAAgB,GACtBh2B,EAAMqpB,kBAAkB,GAAiBrpB,EAAMi2B,sBAC3CH,EACIjyC,MAAMgC,QAAQiwC,GACdA,EAAS,IAAI,GAAWA,EAAOzwC,QAAS,CAAE4vC,QAAQ,IAGlDrV,GAAuD,mBAAvB,EAAiB,SAAkB,IAIvEkW,EAAS,IAAI,QAAWtd,EAAW,CAAEyc,QAAQ,IAEjDj1B,EAAMk2B,UAAUJ,GACT91B,EAsIX,OApLA,GAAU61B,EAAYrW,GAmDtBqW,EAAWh1C,UAAUs1C,mBAAqB,WACtCjyC,KAAK+jC,WAKT4N,EAAWh1C,UAAUo1C,qBAAuB,WACxC/xC,KAAK6xC,oBAAoBjoC,QAAQ85B,IACjC1jC,KAAK6xC,oBAAoBxxC,OAAS,EAClC,IAAIuxC,EAAS5xC,KAAKkyC,YAElB,IAAK,IAAI53B,KADTta,KAAK6xC,oBAAoBhxC,KAAKuiC,GAAOwO,EAAQL,GAAyBvxC,KAAKmyC,iBAAkBnyC,MAAOojC,GAAOwO,EAAQL,GAA4BvxC,KAAKoyC,oBAAqBpyC,OAC1JA,KAAK8xC,cAChB9xC,KAAK8xC,cAAcx3B,GAAI1Q,QAAQ85B,IAEnC,GAAM1jC,KAAK8xC,eAEX,IADA,IAAIO,EAAcT,EAAOR,WAChBr2C,EAAI,EAAG2hC,EAAK2V,EAAYhyC,OAAQtF,EAAI2hC,EAAI3hC,IAAK,CAClD,IAAIsrC,EAAQgM,EAAYt3C,GACxBiF,KAAK8xC,cAAczX,GAAOgM,IAAU,CAChCjD,GAAOiD,EAAOnB,GAAgCllC,KAAKiyC,mBAAoBjyC,MACvEojC,GAAOiD,EAAOrC,GAAkBhkC,KAAKiyC,mBAAoBjyC,OAGjEA,KAAK+jC,WAMT4N,EAAWh1C,UAAUw1C,iBAAmB,SAAUG,GAC9C,IAAIjM,EAAoDiM,EAAuB,QAC/EtyC,KAAK8xC,cAAczX,GAAOgM,IAAU,CAChCjD,GAAOiD,EAAOnB,GAAgCllC,KAAKiyC,mBAAoBjyC,MACvEojC,GAAOiD,EAAOrC,GAAkBhkC,KAAKiyC,mBAAoBjyC,OAE7DA,KAAK+jC,WAMT4N,EAAWh1C,UAAUy1C,oBAAsB,SAAUE,GACjD,IACIh2C,EAAM+9B,GAD8CiY,EAAuB,SAE/EtyC,KAAK8xC,cAAcx1C,GAAKsN,QAAQ85B,WACzB1jC,KAAK8xC,cAAcx1C,GAC1B0D,KAAK+jC,WAUT4N,EAAWh1C,UAAUu1C,UAAY,WAC7B,OAAwFlyC,KAAKpE,IAAI,KAUrG+1C,EAAWh1C,UAAUq1C,UAAY,SAAUJ,GACvC5xC,KAAKyhC,IAAI,GAAiBmQ,IAM9BD,EAAWh1C,UAAUsqC,eAAiB,SAAUC,GAC5C,IAAI9oC,OAAsBk2B,IAAd4S,EAA0BA,EAAY,GAIlD,OAHAlnC,KAAKkyC,YAAYtoC,SAAQ,SAAUy8B,GAC/BA,EAAMY,eAAe7oC,MAElBA,GAWXuzC,EAAWh1C,UAAUwqC,oBAAsB,SAAUC,GACjD,IAAIuB,OAAwBrU,IAAf8S,EAA2BA,EAAa,GACjDjkB,EAAMwlB,EAAOtoC,OACjBL,KAAKkyC,YAAYtoC,SAAQ,SAAUy8B,GAC/BA,EAAMc,oBAAoBwB,MAE9B,IAAI4J,EAAgBvyC,KAAKkmC,gBACrBsM,EAAgBD,EAAc7M,OAC7B0B,QAAuC9S,IAAzBie,EAAc7M,SAC7B8M,EAAgB,GAEpB,IAAK,IAAIz3C,EAAIooB,EAAKuZ,EAAKiM,EAAOtoC,OAAQtF,EAAI2hC,EAAI3hC,IAAK,CAC/C,IAAIgtC,EAAaY,EAAO5tC,GACxBgtC,EAAW9uB,SAAWs5B,EAAct5B,QACpC8uB,EAAW99B,QAAU89B,EAAW99B,SAAWsoC,EAActoC,QACzD89B,EAAWpC,cAAgBrjC,KAAKiG,IAAIw/B,EAAWpC,cAAe4M,EAAc5M,eAC5EoC,EAAWnC,cAAgBtjC,KAAKgG,IAAIy/B,EAAWnC,cAAe2M,EAAc3M,eAC5EmC,EAAWlC,QAAUvjC,KAAKgG,IAAIy/B,EAAWlC,QAAS0M,EAAc1M,SAChEkC,EAAWjC,QAAUxjC,KAAKiG,IAAIw/B,EAAWjC,QAASyM,EAAczM,cACnCxR,IAAzBie,EAAc/V,cACYlI,IAAtByT,EAAWvL,OACXuL,EAAWvL,OAAS8C,GAAgByI,EAAWvL,OAAQ+V,EAAc/V,QAGrEuL,EAAWvL,OAAS+V,EAAc/V,aAGhBlI,IAAtByT,EAAWrC,SACXqC,EAAWrC,OAAS8M,GAG5B,OAAO7J,GAKXgJ,EAAWh1C,UAAU+pC,eAAiB,WAClC,OAAO,IAEJiL,EArLoB,CAsL7B,IC9PE,GAAwC,WACxC,IAAIpyC,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAiD7B,GAzBe,SAAUu7B,GAOpC,SAASmX,EAASl6B,EAAM5M,EAAK6gC,GACzB,IAAI1wB,EAAQwf,EAAOpgC,KAAK8E,KAAMuY,IAASvY,KAavC,OAPA8b,EAAMnQ,IAAMA,EAMZmQ,EAAMqtB,gBAAgC7U,IAAnBkY,EAA+BA,EAAiB,KAC5D1wB,EAEX,OAtBA,GAAU22B,EAAUnX,GAsBbmX,EAvBkB,CAwB3Bx6B,IChDE,GAAwC,WACxC,IAAI1Y,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA4H7B,GAnGsB,SAAUu7B,GAS3C,SAASoX,EAAgBn6B,EAAM5M,EAAKgnC,EAAeC,EAAcpG,GAC7D,IAAI1wB,EAAQwf,EAAOpgC,KAAK8E,KAAMuY,EAAM5M,EAAK6gC,IAAmBxsC,KA0B5D,OAnBA8b,EAAM62B,cAAgBA,EAKtB72B,EAAM+2B,OAAS,KAKf/2B,EAAMg3B,YAAc,KAQpBh3B,EAAMi3B,cAA4Bze,IAAjBse,GAA6BA,EACvC92B,EA6DX,OAhGA,GAAU42B,EAAiBpX,GAqC3B7/B,OAAOC,eAAeg3C,EAAgB/1C,UAAW,QAAS,CAMtDf,IAAK,WAID,OAHKoE,KAAK6yC,SACN7yC,KAAK6yC,OAAS7yC,KAAK2L,IAAIqnC,cAAchzC,KAAK2yC,gBAEvC3yC,KAAK6yC,QAEhBpR,IAAK,SAAUuH,GACXhpC,KAAK6yC,OAAS7J,GAElBrtC,YAAY,EACZs3C,cAAc,IAElBx3C,OAAOC,eAAeg3C,EAAgB/1C,UAAW,aAAc,CAO3Df,IAAK,WAID,OAHKoE,KAAK8yC,cACN9yC,KAAK8yC,YAAc9yC,KAAK2L,IAAIunC,uBAAuBlzC,KAAKgpC,QAErDhpC,KAAK8yC,aAEhBrR,IAAK,SAAU3F,GACX97B,KAAK8yC,YAAchX,GAEvBngC,YAAY,EACZs3C,cAAc,IAOlBP,EAAgB/1C,UAAUolC,eAAiB,WACvCzG,EAAO3+B,UAAUolC,eAAe7mC,KAAK8E,MACjC,mBAAoBA,KAAK2yC,eACD3yC,KAAkB,cAAE+hC,kBAQpD2Q,EAAgB/1C,UAAUqlC,gBAAkB,WACxC1G,EAAO3+B,UAAUqlC,gBAAgB9mC,KAAK8E,MAClC,oBAAqBA,KAAK2yC,eACF3yC,KAAkB,cAAEgiC,mBAG7C0Q,EAjGyB,CAkGlC,ICnHa,IAOXS,YAAa,cAMbC,MAAOpP,GAMPqP,SAAUrP,GAMVsP,YAAa,cAObC,YAAa,cACbC,YAAa,cACbC,UAAW,YACXC,YAAa,cACbC,WAAY,aACZC,aAAc,eACdC,aAAc,eACdC,cAAe,iBCxCJ,GACE,cADF,GAEE,cCNb,GAAwC,WACxC,IAAIv0C,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA0S7B,GAnR6B,SAAUu7B,GAMlD,SAASyY,EAAuBpoC,EAAKqoC,GACjC,IAAIl4B,EAAQwf,EAAOpgC,KAAK8E,KAAM2L,IAAQ3L,KAMtC8b,EAAM4uB,KAAO/+B,EAKbmQ,EAAMm4B,gBAKNn4B,EAAMo4B,gBAAiB,EAKvBp4B,EAAMq4B,WAAY,EAKlBr4B,EAAMs4B,kBAAoB,GAK1Bt4B,EAAMu4B,oBAAmC/f,IAAlB0f,EAA8B,EAAIA,EAOzDl4B,EAAMw4B,MAAQ,KACd,IAAI11C,EAAUkd,EAAM4uB,KAAKiF,cAgCzB,OA3BA7zB,EAAMy4B,gBAAkB,EAKxBz4B,EAAM04B,gBAAkB,GACxB14B,EAAM0zB,SAAW5wC,EAKjBkd,EAAM24B,wBAA0BrR,GAAOxkC,EAAS,GAA8Bkd,EAAM44B,mBAAoB54B,GAKxGA,EAAM64B,0BAKN74B,EAAM84B,oBAAsBxR,GAAOxkC,EAAS,GAA8Bkd,EAAM+4B,YAAa/4B,GAI7FA,EAAMg5B,sBAAwBh5B,EAAMi5B,iBAAiBx4C,KAAKuf,GAC1DA,EAAM0zB,SAAS73B,iBAAiBqsB,GAAqBloB,EAAMg5B,wBAAuB1Z,IAA0B,CAAEC,SAAS,IAChHvf,EAmMX,OAhRA,GAAUi4B,EAAwBzY,GAoFlCyY,EAAuBp3C,UAAUq4C,cAAgB,SAAUC,GACvD,IAAIC,EAAW,IAAI,GAAgBC,GAAoB/B,MAAOpzC,KAAK0qC,KAAMuK,GACzEj1C,KAAKqY,cAAc68B,QACU5gB,IAAzBt0B,KAAKi0C,iBAELmB,aAAap1C,KAAKi0C,iBAClBj0C,KAAKi0C,qBAAkB3f,EACvB4gB,EAAW,IAAI,GAAgBC,GAAoB9B,SAAUrzC,KAAK0qC,KAAMuK,GACxEj1C,KAAKqY,cAAc68B,IAInBl1C,KAAKi0C,gBAAkBoB,WAEvB,WACIr1C,KAAKi0C,qBAAkB3f,EACvB,IAAI4gB,EAAW,IAAI,GAAgBC,GAAoBhC,YAAanzC,KAAK0qC,KAAMuK,GAC/Ej1C,KAAKqY,cAAc68B,IACrB34C,KAAKyD,MAAO,MAUtB+zC,EAAuBp3C,UAAU24C,sBAAwB,SAAUL,GAC/D,IAAIx9B,EAAQw9B,EACRx9B,EAAMc,MAAQ48B,GAAoB1B,WAClCh8B,EAAMc,MAAQ48B,GAAoBrB,qBAC3B9zC,KAAKw0C,gBAAgB/8B,EAAM89B,WAE7B99B,EAAMc,MAAQ48B,GAAoB3B,cACvCxzC,KAAKw0C,gBAAgB/8B,EAAM89B,YAAa,GAE5Cv1C,KAAKu0C,gBAAkB94C,OAAOgiB,KAAKzd,KAAKw0C,iBAAiBn0C,QAO7D0zC,EAAuBp3C,UAAU64C,iBAAmB,SAAUP,GAC1Dj1C,KAAKs1C,sBAAsBL,GAC3B,IAAIC,EAAW,IAAI,GAAgBC,GAAoB1B,UAAWzzC,KAAK0qC,KAAMuK,GAC7Ej1C,KAAKqY,cAAc68B,GAOfl1C,KAAKk0C,iBACJgB,EAASz8B,mBACTzY,KAAKm0C,WACNn0C,KAAKy1C,qBAAqBR,IAC1Bj1C,KAAKg1C,cAAch1C,KAAKs0C,OAEC,IAAzBt0C,KAAKu0C,kBACLv0C,KAAKo0C,kBAAkBxqC,QAAQ85B,IAC/B1jC,KAAKo0C,kBAAkB/zC,OAAS,EAChCL,KAAKm0C,WAAY,EACjBn0C,KAAKs0C,MAAQ,OASrBP,EAAuBp3C,UAAU84C,qBAAuB,SAAUR,GAC9D,OAA+B,IAAxBA,EAAaS,QAOxB3B,EAAuBp3C,UAAU+3C,mBAAqB,SAAUO,GAC5Dj1C,KAAKk0C,eAA0C,IAAzBl0C,KAAKu0C,gBAC3Bv0C,KAAKs1C,sBAAsBL,GAC3B,IAAIC,EAAW,IAAI,GAAgBC,GAAoB3B,YAAaxzC,KAAK0qC,KAAMuK,GAI/E,IAAK,IAAIv4C,KAHTsD,KAAKqY,cAAc68B,GAEnBl1C,KAAKs0C,MAAoC,GACpBW,EAAc,CAC/B,IAAIj5C,EAAQi5C,EAAav4C,GACzBsD,KAAKs0C,MAAM53C,GAA6B,mBAAVV,EAAuBm+B,GAAOn+B,EAEhE,GAAsC,IAAlCgE,KAAKo0C,kBAAkB/zC,OAAc,CACrC,IAAIs1C,EAAM31C,KAAK0qC,KAAKkL,mBACpB51C,KAAKo0C,kBAAkBvzC,KAAKuiC,GAAOuS,EAAKR,GAAoB5B,YAAavzC,KAAK61C,mBAAoB71C,MAAOojC,GAAOuS,EAAKR,GAAoB1B,UAAWzzC,KAAKw1C,iBAAkBx1C,MAc3KojC,GAAOpjC,KAAKwvC,SAAU2F,GAAoBrB,cAAe9zC,KAAKw1C,iBAAkBx1C,OAC5EA,KAAKwvC,SAASsG,aAAe91C,KAAKwvC,SAASsG,gBAAkBH,GAC7D31C,KAAKo0C,kBAAkBvzC,KAAKuiC,GAAOpjC,KAAKwvC,SAASsG,cAAeX,GAAoB1B,UAAWzzC,KAAKw1C,iBAAkBx1C,SASlI+zC,EAAuBp3C,UAAUk5C,mBAAqB,SAAUZ,GAI5D,GAAIj1C,KAAK+1C,UAAUd,GAAe,CAC9Bj1C,KAAKm0C,WAAY,EACjB,IAAIe,EAAW,IAAI,GAAgBC,GAAoB7B,YAAatzC,KAAK0qC,KAAMuK,EAAcj1C,KAAKm0C,WAClGn0C,KAAKqY,cAAc68B,KAU3BnB,EAAuBp3C,UAAUk4C,YAAc,SAAUI,GACrDj1C,KAAK20C,0BAA4BM,EACjC,IAAIlC,KAAc/yC,KAAKs0C,QAASt0C,KAAK+1C,UAAUd,IAC/Cj1C,KAAKqY,cAAc,IAAI,GAAgB48B,EAAa18B,KAAMvY,KAAK0qC,KAAMuK,EAAclC,KAUvFgB,EAAuBp3C,UAAUo4C,iBAAmB,SAAUt9B,GAG1D,IAAIk7B,EAAgB3yC,KAAK20C,0BACnBhC,IAAiBA,EAAcl6B,kBACJ,kBAArBhB,EAAMW,aAAiD,IAArBX,EAAMW,YAChDX,EAAMsqB,kBASdgS,EAAuBp3C,UAAUo5C,UAAY,SAAUd,GACnD,OAAQj1C,KAAKm0C,WACT7xC,KAAK4M,IAAI+lC,EAAae,QAAUh2C,KAAKs0C,MAAM0B,SACvCh2C,KAAKq0C,gBACT/xC,KAAK4M,IAAI+lC,EAAagB,QAAUj2C,KAAKs0C,MAAM2B,SAAWj2C,KAAKq0C,gBAKnEN,EAAuBp3C,UAAU+8B,gBAAkB,WAC3C15B,KAAK40C,sBACLlR,GAAc1jC,KAAK40C,qBACnB50C,KAAK40C,oBAAsB,MAE/B50C,KAAKwvC,SAAS13B,oBAAoBksB,GAAqBhkC,KAAK80C,uBACxD90C,KAAKy0C,0BACL/Q,GAAc1jC,KAAKy0C,yBACnBz0C,KAAKy0C,wBAA0B,MAEnCz0C,KAAKo0C,kBAAkBxqC,QAAQ85B,IAC/B1jC,KAAKo0C,kBAAkB/zC,OAAS,EAChCL,KAAKwvC,SAAW,KAChBlU,EAAO3+B,UAAU+8B,gBAAgBx+B,KAAK8E,OAEnC+zC,EAjRgC,CAkRzC,ICtSa,GAMC,aAND,GAYA,YAZA,GAkBF,UClBE,GACC,aADD,GAEL,OAFK,GAGH,SAHG,GAIL,OCoOK,GAzNoB,WAK/B,SAASmC,EAAcC,EAAkBC,GAKrCp2C,KAAKq2C,kBAAoBF,EAKzBn2C,KAAKs2C,aAAeF,EAKpBp2C,KAAKu2C,UAAY,GAKjBv2C,KAAKw2C,YAAc,GAKnBx2C,KAAKy2C,gBAAkB,GAyL3B,OApLAP,EAAcv5C,UAAUykB,MAAQ,WAC5BphB,KAAKu2C,UAAUl2C,OAAS,EACxBL,KAAKw2C,YAAYn2C,OAAS,EAC1B,GAAML,KAAKy2C,kBAMfP,EAAcv5C,UAAU+5C,QAAU,WAC9B,IAAIC,EAAW32C,KAAKu2C,UAChBK,EAAa52C,KAAKw2C,YAClB53C,EAAU+3C,EAAS,GACA,GAAnBA,EAASt2C,QACTs2C,EAASt2C,OAAS,EAClBu2C,EAAWv2C,OAAS,IAGpBs2C,EAAS,GAAKA,EAASr0B,MACvBs0B,EAAW,GAAKA,EAAWt0B,MAC3BtiB,KAAK62C,QAAQ,IAEjB,IAAIC,EAAa92C,KAAKs2C,aAAa13C,GAEnC,cADOoB,KAAKy2C,gBAAgBK,GACrBl4C,GAOXs3C,EAAcv5C,UAAUo6C,QAAU,SAAUn4C,GACxC88B,KAAS17B,KAAKs2C,aAAa13C,KAAYoB,KAAKy2C,iBAAkB,IAC9D,IAAIO,EAAWh3C,KAAKq2C,kBAAkBz3C,GACtC,OAAIo4C,GAlFMliC,MAmFN9U,KAAKu2C,UAAU11C,KAAKjC,GACpBoB,KAAKw2C,YAAY31C,KAAKm2C,GACtBh3C,KAAKy2C,gBAAgBz2C,KAAKs2C,aAAa13C,KAAY,EACnDoB,KAAKi3C,UAAU,EAAGj3C,KAAKu2C,UAAUl2C,OAAS,IACnC,IAOf61C,EAAcv5C,UAAUu6C,SAAW,WAC/B,OAAOl3C,KAAKu2C,UAAUl2C,QAQ1B61C,EAAcv5C,UAAUw6C,mBAAqB,SAAU1wC,GACnD,OAAe,EAARA,EAAY,GAQvByvC,EAAcv5C,UAAUy6C,oBAAsB,SAAU3wC,GACpD,OAAe,EAARA,EAAY,GAQvByvC,EAAcv5C,UAAU06C,gBAAkB,SAAU5wC,GAChD,OAAQA,EAAQ,GAAM,GAM1ByvC,EAAcv5C,UAAU26C,SAAW,WAC/B,IAAIv8C,EACJ,IAAKA,GAAKiF,KAAKu2C,UAAUl2C,QAAU,GAAK,EAAGtF,GAAK,EAAGA,IAC/CiF,KAAK62C,QAAQ97C,IAMrBm7C,EAAcv5C,UAAUuhC,QAAU,WAC9B,OAAiC,IAA1Bl+B,KAAKu2C,UAAUl2C,QAM1B61C,EAAcv5C,UAAU46C,YAAc,SAAUj7C,GAC5C,OAAOA,KAAO0D,KAAKy2C,iBAMvBP,EAAcv5C,UAAU66C,SAAW,SAAU54C,GACzC,OAAOoB,KAAKu3C,YAAYv3C,KAAKs2C,aAAa13C,KAM9Cs3C,EAAcv5C,UAAUk6C,QAAU,SAAUpwC,GAOxC,IANA,IAAIkwC,EAAW32C,KAAKu2C,UAChBK,EAAa52C,KAAKw2C,YAClBiB,EAAQd,EAASt2C,OACjBzB,EAAU+3C,EAASlwC,GACnBuwC,EAAWJ,EAAWnwC,GACtBixC,EAAajxC,EACVA,EAAQgxC,GAAS,GAAG,CACvB,IAAIE,EAAS33C,KAAKm3C,mBAAmB1wC,GACjCmxC,EAAS53C,KAAKo3C,oBAAoB3wC,GAClCoxC,EAAoBD,EAASH,GAASb,EAAWgB,GAAUhB,EAAWe,GACpEC,EACAD,EACNhB,EAASlwC,GAASkwC,EAASkB,GAC3BjB,EAAWnwC,GAASmwC,EAAWiB,GAC/BpxC,EAAQoxC,EAEZlB,EAASlwC,GAAS7H,EAClBg4C,EAAWnwC,GAASuwC,EACpBh3C,KAAKi3C,UAAUS,EAAYjxC,IAO/ByvC,EAAcv5C,UAAUs6C,UAAY,SAAUS,EAAYjxC,GAKtD,IAJA,IAAIkwC,EAAW32C,KAAKu2C,UAChBK,EAAa52C,KAAKw2C,YAClB53C,EAAU+3C,EAASlwC,GACnBuwC,EAAWJ,EAAWnwC,GACnBA,EAAQixC,GAAY,CACvB,IAAII,EAAc93C,KAAKq3C,gBAAgB5wC,GACvC,KAAImwC,EAAWkB,GAAed,GAM1B,MALAL,EAASlwC,GAASkwC,EAASmB,GAC3BlB,EAAWnwC,GAASmwC,EAAWkB,GAC/BrxC,EAAQqxC,EAMhBnB,EAASlwC,GAAS7H,EAClBg4C,EAAWnwC,GAASuwC,GAKxBd,EAAcv5C,UAAUo7C,aAAe,WACnC,IAKIn5C,EAAS7D,EAAGi8C,EALZb,EAAmBn2C,KAAKq2C,kBACxBM,EAAW32C,KAAKu2C,UAChBK,EAAa52C,KAAKw2C,YAClB/vC,EAAQ,EACRjK,EAAIm6C,EAASt2C,OAEjB,IAAKtF,EAAI,EAAGA,EAAIyB,IAAKzB,GAEjBi8C,EAAWb,EADXv3C,EAAU+3C,EAAS57C,MAtNb+Z,WAyNK9U,KAAKy2C,gBAAgBz2C,KAAKs2C,aAAa13C,KAG9Cg4C,EAAWnwC,GAASuwC,EACpBL,EAASlwC,KAAW7H,GAG5B+3C,EAASt2C,OAASoG,EAClBmwC,EAAWv2C,OAASoG,EACpBzG,KAAKs3C,YAEFpB,EAvNuB,GCfnB,GACL,EADK,GAEF,EAFE,GAGH,EAHG,GAQJ,EARI,GASJ,ECfP,GAAwC,WACxC,IAAI32C,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA6H7B,GArGgB,SAAUu7B,GAMrC,SAAS0c,EAAUC,EAAsBC,GACrC,IAAIp8B,EAAQwf,EAAOpgC,KAAK8E,MAKxB,SAAUpB,GACN,OAAOq5C,EAAqB33C,MAAM,KAAM1B,MAM5C,SAAUA,GACN,OAAmDA,EAAQ,GAAI4iC,aAC7DxhC,KAkBN,OAhBA8b,EAAMq8B,uBAAyBr8B,EAAMs8B,iBAAiB77C,KAAKuf,GAK3DA,EAAMu8B,oBAAsBH,EAK5Bp8B,EAAMw8B,cAAgB,EAKtBx8B,EAAMy8B,kBAAoB,GACnBz8B,EA4DX,OAlGA,GAAUk8B,EAAW1c,GA4CrB0c,EAAUr7C,UAAUo6C,QAAU,SAAUn4C,GACpC,IAAI45C,EAAQld,EAAO3+B,UAAUo6C,QAAQ77C,KAAK8E,KAAMpB,GAC5C45C,GACW55C,EAAQ,GACd+Y,iBAAiBqsB,GAAkBhkC,KAAKm4C,wBAEjD,OAAOK,GAKXR,EAAUr7C,UAAU87C,gBAAkB,WAClC,OAAOz4C,KAAKs4C,eAMhBN,EAAUr7C,UAAUy7C,iBAAmB,SAAU3gC,GAC7C,IAAIihC,EAAmDjhC,EAAY,OAC/D2uB,EAAQsS,EAAK7P,WACjB,GAAIzC,IAAUuS,IACVvS,IAAUuS,IACVvS,IAAUuS,GAAiB,CAC3BD,EAAK5gC,oBAAoBksB,GAAkBhkC,KAAKm4C,wBAChD,IAAIS,EAAUF,EAAKlX,SACfoX,KAAW54C,KAAKu4C,2BACTv4C,KAAKu4C,kBAAkBK,KAC5B54C,KAAKs4C,eAEXt4C,KAAKq4C,wBAObL,EAAUr7C,UAAUk8C,cAAgB,SAAUC,EAAiBC,GAG3D,IAFA,IACWL,EAAME,EADbI,EAAW,EAERh5C,KAAKs4C,cAAgBQ,GACxBE,EAAWD,GACX/4C,KAAKk3C,WAAa,GAElB0B,GADAF,EAAmD14C,KAAK02C,UAAU,IACnDlV,SACPkX,EAAK7P,aACC8P,IAAoBC,KAAW54C,KAAKu4C,oBAC9Cv4C,KAAKu4C,kBAAkBK,IAAW,IAChC54C,KAAKs4C,gBACLU,EACFN,EAAK32B,SAIVi2B,EAnGmB,CAoG5B,ICnHa,OACJ,QADI,GAGE,aAHF,GAIF,UAJE,GASH,SCVRiB,GAAQ,CAKRC,QAAS,UAKTC,QAAS,UAKTC,KAAM,KAKNC,OAAQ,IAKRC,OAAQ,SAKRC,YAAa,cAKbC,OAAQ,SA0BL,IAAIC,GAAkB,GAE7BA,GAAgBR,GAAMC,SAAW,SAAW,EAAI52C,KAAKC,IACrDk3C,GAAgBR,GAAME,SAAY,EAAI72C,KAAKC,GAAK,QAAW,IAC3Dk3C,GAAgBR,GAAMG,MAAQ,MAC9BK,GAAgBR,GAAMI,QAAU,EAChCI,GAAgBR,GAAMO,QAAU,KAAO,KACxB,UCtEA,GACA,EADA,GAEE,ECFF,GACH,SADG,GAEC,aAFD,GAGD,WC2OC,GAnMiB,WAI5B,SAASE,EAAWpiC,GAKhBtX,KAAK25C,MAAQriC,EAAQkkB,KAQrBx7B,KAAK45C,OAAsDtiC,EAAa,MAQxEtX,KAAK65C,aAA6BvlB,IAAnBhd,EAAQklB,OAAuBllB,EAAQklB,OAAS,KAQ/Dx8B,KAAK85C,kBACuBxlB,IAAxBhd,EAAQyiC,YAA4BziC,EAAQyiC,YAAc,KAK9D/5C,KAAKg6C,sBAC2B1lB,IAA5Bhd,EAAQ2iC,gBAAgC3iC,EAAQ2iC,gBAAkB,MAKtEj6C,KAAKk6C,aAA6B5lB,IAAnBhd,EAAQ6iC,QAAuB7iC,EAAQ6iC,OAKtDn6C,KAAKo6C,aAAep6C,KAAKk6C,UAAWl6C,KAAK65C,SAKzC75C,KAAKq6C,wBAA0B/iC,EAAQgjC,mBAKvCt6C,KAAKu6C,iBAAmB,KAKxBv6C,KAAKw6C,eAAiBljC,EAAQmjC,cAgIlC,OA3HAf,EAAW/8C,UAAU2tC,SAAW,WAC5B,OAAOtqC,KAAKo6C,WAOhBV,EAAW/8C,UAAU+9C,QAAU,WAC3B,OAAO16C,KAAK25C,OAOhBD,EAAW/8C,UAAUiqC,UAAY,WAC7B,OAAO5mC,KAAK65C,SAOhBH,EAAW/8C,UAAUg+C,SAAW,WAC5B,OAAO36C,KAAK45C,QAShBF,EAAW/8C,UAAUi+C,iBAAmB,WACpC,OAAO56C,KAAKw6C,gBAAkBf,GAAgBz5C,KAAK45C,SAOvDF,EAAW/8C,UAAUk+C,eAAiB,WAClC,OAAO76C,KAAK85C,cAahBJ,EAAW/8C,UAAUm+C,mBAAqB,WACtC,OAAO96C,KAAKg6C,kBAOhBN,EAAW/8C,UAAUo+C,SAAW,WAC5B,OAAO/6C,KAAKk6C,SAOhBR,EAAW/8C,UAAUq+C,UAAY,SAAUb,GACvCn6C,KAAKk6C,QAAUC,EACfn6C,KAAKo6C,aAAeD,IAAUn6C,KAAK65C,UAKvCH,EAAW/8C,UAAUs+C,mBAAqB,WACtC,OAAOj7C,KAAKu6C,kBAKhBb,EAAW/8C,UAAUu+C,mBAAqB,SAAUC,GAChDn7C,KAAKu6C,iBAAmBY,GAO5BzB,EAAW/8C,UAAU0qC,UAAY,SAAU7K,GACvCx8B,KAAK65C,QAAUrd,EACfx8B,KAAKo6C,aAAep6C,KAAKk6C,UAAW1d,IAQxCkd,EAAW/8C,UAAUy+C,eAAiB,SAAUrB,GAC5C/5C,KAAK85C,aAAeC,GAQxBL,EAAW/8C,UAAU0+C,sBAAwB,SAAU/8C,GACnD0B,KAAKq6C,wBAA0B/7C,GAOnCo7C,EAAW/8C,UAAU2+C,uBAAyB,WAC1C,OAAOt7C,KAAKq6C,yBAETX,EAjMoB,GCjD3B,GAAwC,WACxC,IAAIn6C,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAgCjCw7C,GALS,QAKGj5C,KAAKC,GAKjBi5C,GAAS,EAAED,IAAYA,GAAWA,GAAWA,IAK7CE,GAAe,EAAE,KAAM,GAAI,IAAK,IAMhCC,GArBS,QAqBap5C,KAAKiiB,IAAIjiB,KAAKkR,IAAIlR,KAAKC,GAAK,IAKzD,GAAoC,SAAU+4B,GAK9C,SAASqgB,EAAmBngB,GACxB,OAAOF,EAAOpgC,KAAK8E,KAAM,CACrBw7B,KAAMA,EACNogB,MAAO,GAAMvC,OACb7c,OAAQgf,GACRrB,QAAQ,EACRJ,YAAa0B,GACbnB,mBAAoB,SAAU5b,EAAYlpB,GACtC,OAAOkpB,EAAaqB,GAAKvqB,EAAM,GAvC3B,aAyCNxV,KAEV,OAhBA,GAAU27C,EAAoBrgB,GAgBvBqgB,EAjB4B,CAkBrC,IAOSE,GAAc,CACrB,IAAI,GAAmB,aACvB,IAAI,GAAmB,eACvB,IAAI,GAAmB,eACvB,IAAI,GAAmB,eACvB,IAAI,GAAmB,8CACvB,IAAI,GAAmB,iDAUpB,SAASC,GAAaC,EAAOC,EAAYC,GAC5C,IAAI57C,EAAS07C,EAAM17C,OACf67C,EAAYD,EAAgB,EAAIA,EAAgB,EAChD/Z,EAAS8Z,OACE1nB,IAAX4N,IAGIA,EAFAga,EAAY,EAEHH,EAAM56C,QAGN,IAAIxB,MAAMU,IAG3B,IAAK,IAAItF,EAAI,EAAGA,EAAIsF,EAAQtF,GAAKmhD,EAAW,CACxCha,EAAOnnC,GAAMwgD,GAAYQ,EAAMhhD,GAAM,IACrC,IAAI6I,EAlFQ,QAkFKtB,KAAKiiB,IAAIjiB,KAAKkR,IAAKlR,KAAKC,KAAOw5C,EAAMhhD,EAAI,GAAK,IAAO,MAClE6I,EAAI83C,GACJ93C,EAAI83C,GAEC93C,GAAK83C,KACV93C,GAAK83C,IAETxZ,EAAOnnC,EAAI,GAAK6I,EAEpB,OAAOs+B,EAUJ,SAASia,GAAWJ,EAAOC,EAAYC,GAC1C,IAAI57C,EAAS07C,EAAM17C,OACf67C,EAAYD,EAAgB,EAAIA,EAAgB,EAChD/Z,EAAS8Z,OACE1nB,IAAX4N,IAGIA,EAFAga,EAAY,EAEHH,EAAM56C,QAGN,IAAIxB,MAAMU,IAG3B,IAAK,IAAItF,EAAI,EAAGA,EAAIsF,EAAQtF,GAAKmhD,EAC7Bha,EAAOnnC,GAAM,IAAMghD,EAAMhhD,GAAMwgD,GAC/BrZ,EAAOnnC,EAAI,GACN,IAAMuH,KAAK85C,KAAK95C,KAAK09B,IAAI+b,EAAMhhD,EAAI,GArH5B,UAqH6CuH,KAAKC,GAAK,GAEvE,OAAO2/B,EClJX,IAAI,GAAwC,WACxC,IAAI3iC,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAiCjC,GAAS,EAAE,KAAM,GAAI,IAAK,IAK1B,GAZS,QAYUuC,KAAKC,GAAe,IAS9C,GAAoC,SAAU+4B,GAM9C,SAAS+gB,EAAmB7gB,EAAM8gB,GAC9B,OAAOhhB,EAAOpgC,KAAK8E,KAAM,CACrBw7B,KAAMA,EACNogB,MAAO,GAAMzC,QACb3c,OAAQ,GACRyd,gBAAiBqC,EACjBnC,QAAQ,EACRM,cAAe,GACfV,YAAa,MACX/5C,KAEV,OAhBA,GAAUq8C,EAAoB/gB,GAgBvB+gB,EAjB4B,CAkBrC,IAOS,GAAc,CACrB,IAAI,GAAmB,UACvB,IAAI,GAAmB,YAAa,OACpC,IAAI,GAAmB,iCACvB,IAAI,GAAmB,4BACvB,IAAI,GAAmB,+CAAgD,OACvE,IAAI,GAAmB,+CAAgD,OACvE,IAAI,GAAmB,6CAA8C,QCzErE,GAAQ,GCEZ,IAAI,GAAa,GAeV,SAAS,GAAI3tC,EAAQ6tC,EAAa9c,GACrC,IAAI+c,EAAa9tC,EAAOgsC,UACpB+B,EAAkBF,EAAY7B,UAC5B8B,KAAc,KAChB,GAAWA,GAAc,IAE7B,GAAWA,GAAYC,GAAmBhd,ECEvC,SAASid,GAAYC,EAAIC,EAAIC,GAChC,IAAIj+B,EAASi+B,GAXW,UAYpBC,EAAO1c,GAAUuc,EAAG,IACpBI,EAAO3c,GAAUwc,EAAG,IACpBI,GAAeD,EAAOD,GAAQ,EAC9BG,EAAc7c,GAAUwc,EAAG,GAAKD,EAAG,IAAM,EACzCxyC,EAAI7H,KAAK8I,IAAI4xC,GAAe16C,KAAK8I,IAAI4xC,GACrC16C,KAAK8I,IAAI6xC,GACL36C,KAAK8I,IAAI6xC,GACT36C,KAAKyK,IAAI+vC,GACTx6C,KAAKyK,IAAIgwC,GACjB,OAAO,EAAIn+B,EAAStc,KAAKuK,MAAMvK,KAAKsK,KAAKzC,GAAI7H,KAAKsK,KAAK,EAAIzC,IC8CxD,SAAS+yC,GAAenB,EAAOC,EAAYC,GAC9C,IAAI/Z,EACJ,QAAmB5N,IAAf0nB,EAA0B,CAC1B,IAAK,IAAIjhD,EAAI,EAAG2hC,EAAKqf,EAAM17C,OAAQtF,EAAI2hC,IAAM3hC,EACzCihD,EAAWjhD,GAAKghD,EAAMhhD,GAE1BmnC,EAAS8Z,OAGT9Z,EAAS6Z,EAAM56C,QAEnB,OAAO+gC,EAQJ,SAASib,GAAkBpB,EAAOC,EAAYC,GACjD,QAAmB3nB,IAAf0nB,GAA4BD,IAAUC,EAAY,CAClD,IAAK,IAAIjhD,EAAI,EAAG2hC,EAAKqf,EAAM17C,OAAQtF,EAAI2hC,IAAM3hC,EACzCihD,EAAWjhD,GAAKghD,EAAMhhD,GAE1BghD,EAAQC,EAEZ,OAAOD,EASJ,SAASqB,GAAclT,IH/FvB,SAAa1O,EAAM0O,GACtB,GAAM1O,GAAQ0O,EG+Fd,CAAQA,EAAWwQ,UAAWxQ,GAC9B,GAAiBA,EAAYA,EAAYgT,IAiBtC,SAAS,GAAIG,GAChB,MAAiC,iBAAnBA,EH5HN,GADQ7hB,EG8HoB,IH5HhC,GAAMA,EAAK94B,QAAQ,yCAA0C,aAC7D,KG4H4B,GAAoB,KH/HjD,IAAa84B,EGqJb,SAAS8e,GAAmBpQ,EAAYxL,EAAYlpB,EAAO8nC,GAE9D,IAAIC,EACAhiD,GAFJ2uC,EAAa,GAAIA,IAEOoR,yBACxB,GAAI//C,EAAQ,CAER,GADAgiD,EAAkBhiD,EAAOmjC,EAAYlpB,GACjC8nC,GAAaA,IAAcpT,EAAWyQ,YAClCF,EAAgBvQ,EAAW0Q,sBAE3B2C,EACKA,EAAkB9C,EAAiBhB,GAAgB6D,QAI/D,CACD,IAAI1B,EAAQ1R,EAAWyQ,WACvB,GAAKiB,GAAS,GAAMzC,UAAYmE,GAAcA,GAAa,GAAMnE,QAC7DoE,EAAkB7e,MAEjB,CAID,IAqBI+b,EArBA+C,EAAeC,GAA4BvT,EAAY,GAAI,cAC/D,GAAIsT,IAAiBL,IAAqBvB,IAAU,GAAMzC,QAEtDoE,EAAkB7e,EAAawL,EAAW0Q,uBAEzC,CACD,IAAI8C,EAAW,CACXloC,EAAM,GAAKkpB,EAAa,EACxBlpB,EAAM,GACNA,EAAM,GAAKkpB,EAAa,EACxBlpB,EAAM,GACNA,EAAM,GACNA,EAAM,GAAKkpB,EAAa,EACxBlpB,EAAM,GACNA,EAAM,GAAKkpB,EAAa,GAK5B6e,GAFYb,IADZgB,EAAWF,EAAaE,EAAUA,EAAU,IACXv8C,MAAM,EAAG,GAAIu8C,EAASv8C,MAAM,EAAG,IACnDu7C,GAAYgB,EAASv8C,MAAM,EAAG,GAAIu8C,EAASv8C,MAAM,EAAG,KAC5B,OAKnBmzB,KAHlBmmB,EAAgB6C,EACd7D,GAAgB6D,GAChBpT,EAAW0Q,sBAEb2C,GAAmB9C,IAI/B,OAAO8C,EASJ,SAASI,GAAyBC,IAlGlC,SAAwBA,GAC3BA,EAAYh0C,QAAQwzC,IAkGpBS,CAAeD,GACfA,EAAYh0C,SAAQ,SAAU8E,GAC1BkvC,EAAYh0C,SAAQ,SAAU2yC,GACtB7tC,IAAW6tC,GACX,GAAiB7tC,EAAQ6tC,EAAaW,UAsC/C,SAASY,GAAiB5T,EAAY6T,GACzC,OAAK7T,EAG0B,iBAAfA,EACL,GAAIA,GAGsB,EAN1B,GAAI6T,GAuGZ,SAASC,GAAWC,EAAaC,GACpC,GAAID,IAAgBC,EAChB,OAAO,EAEX,IAAIC,EAAaF,EAAYtD,aAAeuD,EAAYvD,WACxD,OAAIsD,EAAYvD,YAAcwD,EAAYxD,WAIlB+C,GAA4BQ,EAAaC,KACpChB,KAJlBiB,EAgBR,SAASV,GAA4BW,EAAkBC,GAC1D,IAEIC,EFzVD,SAAa9B,EAAYC,GAC5B,IAAIhqC,EAIJ,OAHI+pC,KAAc,IAAcC,KAAmB,GAAWD,KAC1D/pC,EAAY,GAAW+pC,GAAYC,IAEhChqC,EEoVa,CAFH2rC,EAAiB1D,UACZ2D,EAAsB3D,WAK5C,OAHK4D,IACDA,EAAgBnB,IAEbmB,EAYJ,SAASC,GAAa7vC,EAAQ6tC,GAGjC,OAAOkB,GAFgB,GAAI/uC,GACC,GAAI6tC,IAiB7B,SAAS,GAAUzgB,EAAYptB,EAAQ6tC,GAE1C,OADoBgC,GAAa7vC,EAAQ6tC,EAClC+B,CAAcxiB,OAAYxH,EAAWwH,EAAWz7B,QAcpD,SAASm+C,GAAgBhiB,EAAQ9tB,EAAQ6tC,EAAa7c,GAEzD,OAAOF,GAAehD,EADF+hB,GAAa7vC,EAAQ6tC,QACIjoB,EAAWoL,GAiB5D,IA5NsD+e,GAAcC,GAAkBC,GA4NlF,GAAiB,KA0Cd,SAASC,GAAiB9iB,EAAYsiB,GACzC,OAAK,GAGE,GAAUtiB,EAAYsiB,EAAkB,IAFpCtiB,EAWR,SAAS+iB,GAAmB/iB,EAAYgjB,GAC3C,OAAK,GAGE,GAAUhjB,EAAY,GAAgBgjB,GAFlChjB,EAwBR,SAASijB,GAAeviB,EAAQsiB,GACnC,OAAK,GAGEN,GAAgBhiB,EAAQ,GAAgBsiB,GAFpCtiB,EC5hBR,SAASwiB,GAAaxiB,EAAQyiB,EAAYC,GAC7C,OAAO,SASGnpB,EAAQ2I,EAAY5qB,EAAMqrC,EAAcC,GAC9C,GAAIrpB,EAAQ,CACR,IAAIspB,EAAYJ,EAAa,EAAInrC,EAAK,GAAK4qB,EACvC4gB,EAAaL,EAAa,EAAInrC,EAAK,GAAK4qB,EACxC6gB,EAASH,EAAkBA,EAAgB,GAAK,EAChDI,EAASJ,EAAkBA,EAAgB,GAAK,EAChDj9B,EAAOqa,EAAO,GAAK6iB,EAAY,EAAIE,EACnCt9B,EAAOua,EAAO,GAAK6iB,EAAY,EAAIE,EACnCn9B,EAAOoa,EAAO,GAAK8iB,EAAa,EAAIE,EACpCt9B,EAAOsa,EAAO,GAAK8iB,EAAa,EAAIE,EAGpCr9B,EAAOF,IAEPA,EADAE,GAAQF,EAAOE,GAAQ,GAGvBC,EAAOF,IAEPA,EADAE,GAAQF,EAAOE,GAAQ,GAG3B,IAAIze,EAAIm8B,GAAM/J,EAAO,GAAI5T,EAAMF,GAC3Bre,EAAIk8B,GAAM/J,EAAO,GAAI3T,EAAMF,GAC3Bu9B,EAAQ,GAAK/gB,EAUjB,OARIygB,GAAgBD,IAChBv7C,IACK87C,EAAQn9C,KAAKiiB,IAAI,EAAIjiB,KAAKgG,IAAI,EAAG6Z,EAAO4T,EAAO,IAAM0pB,GAClDA,EAAQn9C,KAAKiiB,IAAI,EAAIjiB,KAAKgG,IAAI,EAAGytB,EAAO,GAAK9T,GAAQw9B,GAC7D77C,IACK67C,EAAQn9C,KAAKiiB,IAAI,EAAIjiB,KAAKgG,IAAI,EAAG8Z,EAAO2T,EAAO,IAAM0pB,GAClDA,EAAQn9C,KAAKiiB,IAAI,EAAIjiB,KAAKgG,IAAI,EAAGytB,EAAO,GAAK7T,GAAQu9B,IAE1D,CAAC97C,EAAGC,KAWhB,SAAS87C,GAAK3pB,GACjB,OAAOA,EClDX,SAAS4pB,GAA6BjhB,EAAYkhB,EAAWC,EAAcC,GACvE,IAAIC,EAAc5hB,GAASyhB,GAAaC,EAAa,GACjDG,EAAc5hB,GAAUwhB,GAAaC,EAAa,GACtD,OAAIC,EACOx9C,KAAKiG,IAAIm2B,EAAYp8B,KAAKgG,IAAIy3C,EAAaC,IAE/C19C,KAAKiG,IAAIm2B,EAAYp8B,KAAKiG,IAAIw3C,EAAaC,IActD,SAASC,GAA2BvhB,EAAYiH,EAAeC,GAC3D,IAAIzjC,EAASG,KAAKiG,IAAIm2B,EAAYiH,GAYlC,OAVAxjC,GACIG,KAAKiiB,IAAI,EAFD,GAEajiB,KAAKgG,IAAI,EAAGo2B,EAAaiH,EAAgB,IAFtD,GAGJ,EACJC,IACAzjC,EAASG,KAAKgG,IAAInG,EAAQyjC,GAC1BzjC,GACIG,KAAKiiB,IAAI,EAPL,GAOiBjiB,KAAKgG,IAAI,EAAGs9B,EAAgBlH,EAAa,IAP1D,GASA,GAELoB,GAAM39B,EAAQyjC,EAAgB,EAAmB,EAAhBD,GAmGrC,SAASua,GAAuBva,EAAeC,EAAeua,EAAYC,EAAeC,GAC5F,OAAO,SAQG3hB,EAAY/f,EAAW7K,EAAMqrC,GACnC,QAAmB7qB,IAAfoK,EAA0B,CAC1B,IAAI4hB,EAAeF,EACbT,GAA6Bha,EAAeya,EAAetsC,EAAMusC,GACjE1a,EAEN,YAD4BrR,IAAf6rB,GAA2BA,IACxBhB,EAGTc,GAA2BvhB,EAAY4hB,EAAc1a,GAFjD9F,GAAMpB,EAAYkH,EAAe0a,KC3JjD,SAASC,GAAQ5hB,GACpB,YAAiBrK,IAAbqK,EACO,OAGP,EAOD,SAAS,GAAKA,GACjB,YAAiBrK,IAAbqK,EACOA,OAGP,ECnBD,SAAS6hB,GAAOvkD,GACnB,OAAOqG,KAAKmL,IAAIxR,EAAG,GAQhB,SAASwkD,GAAQxkD,GACpB,OAAO,EAAIukD,GAAO,EAAIvkD,GAQnB,SAASykD,GAASzkD,GACrB,OAAO,EAAIA,EAAIA,EAAI,EAAIA,EAAIA,EAAIA,EAQ5B,SAAS0kD,GAAO1kD,GACnB,OAAOA,EJ0lBP0hD,GAAyB,IACzBA,GAAyB,IArYyBc,GAwYJ,GAxYkBC,GAwYI5C,GAxYc6C,GAwYAxC,GAA1D,GAvYXvyC,SAAQ,SAAUq0C,GAC3BQ,GAAa70C,SAAQ,SAAUs0C,GAC3B,GAAiBD,EAAaC,EAAaQ,IAC3C,GAAiBR,EAAaD,EAAaU,UKtPxC,OACP,KADO,GAEN,MAFM,GAGN,MAHM,GAIL,OCDH,SAASiC,GAAYpjB,EAAiBtkB,EAAQoS,EAAKmS,EAAQhrB,EAAWouC,GAGzE,IAFA,IAAIC,EAAOD,GAAsB,GAC7B9lD,EAAI,EACCyd,EAAIU,EAAQV,EAAI8S,EAAK9S,GAAKilB,EAAQ,CACvC,IAAI95B,EAAI65B,EAAgBhlB,GACpB5U,EAAI45B,EAAgBhlB,EAAI,GAC5BsoC,EAAK/lD,KAAO0X,EAAU,GAAK9O,EAAI8O,EAAU,GAAK7O,EAAI6O,EAAU,GAC5DquC,EAAK/lD,KAAO0X,EAAU,GAAK9O,EAAI8O,EAAU,GAAK7O,EAAI6O,EAAU,GAKhE,OAHIouC,GAAYC,EAAKzgD,QAAUtF,IAC3B+lD,EAAKzgD,OAAStF,GAEX+lD,ECxBX,IAAI,GAAwC,WACxC,IAAIvhD,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA6BxCghD,GzDGO,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,GyDkQZ,GAxPe,SAAUzlB,GAEpC,SAAS0lB,IACL,IAAIllC,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAqCjC,OAhCA8b,EAAM+9B,QtD4IH,CAAC/kC,IAAUA,KAAU,KAAW,KsDvInCgH,EAAMmlC,iBAAmB,EAKzBnlC,EAAMolC,yCAA2C,EAKjDplC,EAAMqlC,2BAA6B,EASnCrlC,EAAMslC,4B9DzCP,SAAoBl7C,GACvB,IAEIm7C,EAEAC,EACAC,EALAC,GAAS,EAMb,OAAO,WACH,IAAIC,EAAW9hD,MAAMhD,UAAUwE,MAAMjG,KAAKkF,WAO1C,OANKohD,GAAUxhD,OAASuhD,GAAa,GAAYE,EAAUH,KACvDE,GAAS,EACTD,EAAWvhD,KACXshD,EAAWG,EACXJ,EAAan7C,EAAG5F,MAAMN,KAAMI,YAEzBihD,G8D0B6BK,EAAW,SAAUC,EAAUC,EAAkBC,GACjF,IAAKA,EACD,OAAO7hD,KAAK8hD,sBAAsBF,GAEtC,IAAIjzC,EAAQ3O,KAAK2O,QAEjB,OADAA,EAAM6wB,eAAeqiB,GACdlzC,EAAMmzC,sBAAsBF,MAEhC9lC,EA8MX,OArPA,GAAUklC,EAAU1lB,GAgDpB0lB,EAASrkD,UAAUolD,oBAAsB,SAAUH,EAAkBC,GACjE,OAAO7hD,KAAKohD,4BAA4BphD,KAAKikC,cAAe2d,EAAkBC,IAOlFb,EAASrkD,UAAUgS,MAAQ,WACvB,OAAO,MAUXqyC,EAASrkD,UAAUqlD,eAAiB,SAAUr+C,EAAGC,EAAGq+C,EAAcC,GAC9D,OAAO,MAOXlB,EAASrkD,UAAUmgC,WAAa,SAAUn5B,EAAGC,GACzC,IAAIu+C,EAAQniD,KAAKoiD,gBAAgB,CAACz+C,EAAGC,IACrC,OAAOu+C,EAAM,KAAOx+C,GAAKw+C,EAAM,KAAOv+C,GAU1Co9C,EAASrkD,UAAUylD,gBAAkB,SAAU5sC,EAAO6sC,GAClD,IAAIJ,EAAeI,GAAsC,CAACjyC,IAAKA,KAE/D,OADApQ,KAAKgiD,eAAexsC,EAAM,GAAIA,EAAM,GAAIysC,EAAcntC,KAC/CmtC,GASXjB,EAASrkD,UAAU2lD,qBAAuB,SAAUxmB,GAChD,OAAO97B,KAAK88B,WAAWhB,EAAW,GAAIA,EAAW,KAQrDklB,EAASrkD,UAAU4lD,cAAgB,SAAU/lB,GACzC,OAAO,MAQXwkB,EAASrkD,UAAUiqC,UAAY,SAAUzJ,GACrC,GAAIn9B,KAAKihD,iBAAmBjhD,KAAKikC,cAAe,CAC5C,IAAIzH,EAASx8B,KAAKuiD,cAAcviD,KAAK65C,UACjCtgC,MAAMijB,EAAO,KAAOjjB,MAAMijB,EAAO,MACjCY,GAAoBZ,GAExBx8B,KAAKihD,gBAAkBjhD,KAAKikC,cAEhC,OtDsdD,SAAwBzH,EAAQW,GACnC,OAAIA,GACAA,EAAW,GAAKX,EAAO,GACvBW,EAAW,GAAKX,EAAO,GACvBW,EAAW,GAAKX,EAAO,GACvBW,EAAW,GAAKX,EAAO,GAChBW,GAGAX,EsD/dAgmB,CAAexiD,KAAK65C,QAAS1c,IAUxC6jB,EAASrkD,UAAUqT,OAAS,SAAU0O,EAAO+jC,GACzC,MAYJzB,EAASrkD,UAAUiT,MAAQ,SAAU+B,EAAI+wC,EAAQC,GAC7C,MAWJ3B,EAASrkD,UAAUimD,SAAW,SAAUC,GACpC,OAAO7iD,KAAK8hD,sBAAsBe,EAAYA,IAUlD7B,EAASrkD,UAAUmlD,sBAAwB,SAAUF,GACjD,OAAO,MAOXZ,EAASrkD,UAAUmmD,QAAU,WACzB,OAAO,MAWX9B,EAASrkD,UAAU6iC,eAAiB,SAAUC,GAC1C,MAQJuhB,EAASrkD,UAAUomD,iBAAmB,SAAUvmB,GAC5C,OAAO,MAUXwkB,EAASrkD,UAAU4T,UAAY,SAAUyyC,EAAQC,GAC7C,MAiBJjC,EAASrkD,UAAU8V,UAAY,SAAU/D,EAAQ6tC,GAE7C,IAAI2G,EAAa,GAAcx0C,GAC3B+wB,EAAcyjB,EAAWvI,YAAc,GAAMpB,YAC3C,SAAU4J,EAAeC,EAAgB3lB,GACvC,IAAI4lB,EAAcH,EAAWtc,YACzB0c,EAAkBJ,EAAWrI,iBAC7BjrC,EAAQwuB,GAAUklB,GAAmBllB,GAAUilB,GAGnD,OAFAtnB,GAAiBglB,GAAcuC,EAAgB,GAAIA,EAAgB,GAAI1zC,GAAQA,EAAO,EAAG,EAAG,GAC5FgxC,GAAYuC,EAAe,EAAGA,EAAc9iD,OAAQo9B,EAAQsjB,GAAcqC,GACnE7E,GAAa2E,EAAY3G,EAAzBgC,CAAsC4E,EAAeC,EAAgB3lB,IAE9E8gB,GAAa2E,EAAY3G,GAE/B,OADAv8C,KAAKw/B,eAAeC,GACbz/B,MAEJghD,EAtPkB,CAuP3B,ICjSE,GAAwC,WACxC,IAAIzhD,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA2RrC,SAASwjD,GAAmBC,GAC/B,IAAI/lB,EAUJ,OATI+lB,GAAUC,GACVhmB,EAAS,EAEJ+lB,GAAUC,IAAsBD,GAAUC,GAC/ChmB,EAAS,EAEJ+lB,GAAUC,KACfhmB,EAAS,GAEgB,EAkBlB,OAzRqB,SAAUnC,GAE1C,SAASooB,IACL,IAAI5nC,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAgBjC,OAXA8b,EAAM0nC,OAASC,GAKf3nC,EAAM2hB,OAAS,EAKf3hB,EAAM0hB,gBAAkB,KACjB1hB,EAkNX,OApOA,GAAU4nC,EAAgBpoB,GAyB1BooB,EAAe/mD,UAAU4lD,cAAgB,SAAU/lB,GAC/C,OvD8L0CgB,EuD9LDx9B,KAAKw9B,gBvD8LatkB,EuD9LI,EvD8LIoS,EuD9LDtrB,KAAKw9B,gBAAgBn9B,OvD8Lfo9B,EuD9LuBz9B,KAAKy9B,OvDgMjGF,GADMH,GuD/LmGZ,GvDgM3EgB,EAAiBtkB,EAAQoS,EAAKmS,GAFhE,IAA2CD,EAAiBtkB,EAAQoS,EAAKmS,GuDxL5EimB,EAAe/mD,UAAUgnD,eAAiB,WACtC,OAAO,MAOXD,EAAe/mD,UAAUinD,mBAAqB,WAC1C,OAAO5jD,KAAKw9B,gBAAgBr8B,MAAM,EAAGnB,KAAKy9B,SAK9CimB,EAAe/mD,UAAUknD,mBAAqB,WAC1C,OAAO7jD,KAAKw9B,iBAOhBkmB,EAAe/mD,UAAUmnD,kBAAoB,WACzC,OAAO9jD,KAAKw9B,gBAAgBr8B,MAAMnB,KAAKw9B,gBAAgBn9B,OAASL,KAAKy9B,SAOzEimB,EAAe/mD,UAAUonD,UAAY,WACjC,OAAO/jD,KAAKwjD,QAOhBE,EAAe/mD,UAAUmlD,sBAAwB,SAAUF,GAOvD,GANI5hD,KAAKmhD,6BAA+BnhD,KAAKikC,gBACzCjkC,KAAKkhD,yCAA2C,EAChDlhD,KAAKmhD,2BAA6BnhD,KAAKikC,eAIvC2d,EAAmB,GACgC,IAAlD5hD,KAAKkhD,0CACFU,GAAoB5hD,KAAKkhD,yCAC7B,OAAOlhD,KAEX,IAAIgkD,EAAqBhkD,KAAKikD,8BAA8BrC,GAE5D,OADgCoC,EAAmBH,qBACrBxjD,OAASL,KAAKw9B,gBAAgBn9B,OACjD2jD,GASPhkD,KAAKkhD,yCAA2CU,EACzC5hD,OAQf0jD,EAAe/mD,UAAUsnD,8BAAgC,SAAUrC,GAC/D,OAAO5hD,MAKX0jD,EAAe/mD,UAAUunD,UAAY,WACjC,OAAOlkD,KAAKy9B,QAMhBimB,EAAe/mD,UAAUwnD,mBAAqB,SAAUX,EAAQhmB,GAC5Dx9B,KAAKy9B,OAAS8lB,GAAmBC,GACjCxjD,KAAKwjD,OAASA,EACdxjD,KAAKw9B,gBAAkBA,GAO3BkmB,EAAe/mD,UAAUynD,eAAiB,SAAU7nB,EAAa8nB,GAC7D,MAQJX,EAAe/mD,UAAU2nD,UAAY,SAAUd,EAAQjnB,EAAagoB,GAEhE,IAAI9mB,EACJ,GAAI+lB,EACA/lB,EAAS8lB,GAAmBC,OAE3B,CACD,IAAK,IAAIzoD,EAAI,EAAGA,EAAIwpD,IAAWxpD,EAAG,CAC9B,GAA2B,IAAvBwhC,EAAYl8B,OAGZ,OAFAL,KAAKwjD,OAASC,QACdzjD,KAAKy9B,OAAS,GAIdlB,EAAoCA,EAAY,GAIxDinB,EAiFZ,SAA4B/lB,GACxB,IAAI+lB,EACU,GAAV/lB,EACA+lB,EAASC,GAEM,GAAVhmB,EACL+lB,EAASC,GAEM,GAAVhmB,IACL+lB,EAASC,IAEb,OAA4D,EA5F3Ce,CADT/mB,EAASlB,EAAYl8B,QAGzBL,KAAKwjD,OAASA,EACdxjD,KAAKy9B,OAASA,GAWlBimB,EAAe/mD,UAAU6iC,eAAiB,SAAUC,GAC5Cz/B,KAAKw9B,kBACLiC,EAAYz/B,KAAKw9B,gBAAiBx9B,KAAKw9B,gBAAiBx9B,KAAKy9B,QAC7Dz9B,KAAK+jC,YAUb2f,EAAe/mD,UAAUqT,OAAS,SAAU0O,EAAO+jC,GAC/C,IAAIjlB,EAAkBx9B,KAAK6jD,qBAC3B,GAAIrmB,EAAiB,CACjB,IAAIC,EAASz9B,KAAKkkD,aFnLvB,SAAgB1mB,EAAiBtkB,EAAQoS,EAAKmS,EAAQ/e,EAAO+jC,EAAQ5B,GAOxE,IANA,IAAIC,EAAOD,GAAsB,GAC7B9zC,EAAMzK,KAAKyK,IAAI2R,GACftT,EAAM9I,KAAK8I,IAAIsT,GACf+lC,EAAUhC,EAAO,GACjBiC,EAAUjC,EAAO,GACjB1nD,EAAI,EACCyd,EAAIU,EAAQV,EAAI8S,EAAK9S,GAAKilB,EAAQ,CACvC,IAAIulB,EAASxlB,EAAgBhlB,GAAKisC,EAC9BxB,EAASzlB,EAAgBhlB,EAAI,GAAKksC,EACtC5D,EAAK/lD,KAAO0pD,EAAUzB,EAASj2C,EAAMk2C,EAAS73C,EAC9C01C,EAAK/lD,KAAO2pD,EAAU1B,EAAS53C,EAAM63C,EAASl2C,EAC9C,IAAK,IAAIrC,EAAI8N,EAAI,EAAG9N,EAAI8N,EAAIilB,IAAU/yB,EAClCo2C,EAAK/lD,KAAOyiC,EAAgB9yB,GAGhCm2C,GAAYC,EAAKzgD,QAAUtF,IAC3B+lD,EAAKzgD,OAAStF,GEmKV,CAAOyiC,EAAiB,EAAGA,EAAgBn9B,OAAQo9B,EAAQ/e,EAAO+jC,EAAQjlB,GAC1Ex9B,KAAK+jC,YAYb2f,EAAe/mD,UAAUiT,MAAQ,SAAU+B,EAAI+wC,EAAQC,GACnD,IAAI5wC,EAAK2wC,OACEpuB,IAAPviB,IACAA,EAAKJ,GAET,IAAI8wC,EAASE,EACRF,IACDA,EAASpkB,GAAUr+B,KAAK4mC,cAE5B,IAAIpJ,EAAkBx9B,KAAK6jD,qBAC3B,GAAIrmB,EAAiB,CACjB,IAAIC,EAASz9B,KAAKkkD,aF3KvB,SAAe1mB,EAAiBtkB,EAAQoS,EAAKmS,EAAQ9rB,EAAII,EAAI0wC,EAAQ5B,GAKxE,IAJA,IAAIC,EAAOD,GAAsB,GAC7B4D,EAAUhC,EAAO,GACjBiC,EAAUjC,EAAO,GACjB1nD,EAAI,EACCyd,EAAIU,EAAQV,EAAI8S,EAAK9S,GAAKilB,EAAQ,CACvC,IAAIulB,EAASxlB,EAAgBhlB,GAAKisC,EAC9BxB,EAASzlB,EAAgBhlB,EAAI,GAAKksC,EACtC5D,EAAK/lD,KAAO0pD,EAAU9yC,EAAKqxC,EAC3BlC,EAAK/lD,KAAO2pD,EAAU3yC,EAAKkxC,EAC3B,IAAK,IAAIv4C,EAAI8N,EAAI,EAAG9N,EAAI8N,EAAIilB,IAAU/yB,EAClCo2C,EAAK/lD,KAAOyiC,EAAgB9yB,GAGhCm2C,GAAYC,EAAKzgD,QAAUtF,IAC3B+lD,EAAKzgD,OAAStF,GE6JV,CAAMyiC,EAAiB,EAAGA,EAAgBn9B,OAAQo9B,EAAQ9rB,EAAII,EAAI0wC,EAAQjlB,GAC1Ex9B,KAAK+jC,YAUb2f,EAAe/mD,UAAU4T,UAAY,SAAUyyC,EAAQC,GACnD,IAAIzlB,EAAkBx9B,KAAK6jD,qBAC3B,GAAIrmB,EAAiB,CACjB,IAAIC,EAASz9B,KAAKkkD,aF7JvB,SAAmB1mB,EAAiBtkB,EAAQoS,EAAKmS,EAAQulB,EAAQC,EAAQpC,GAG5E,IAFA,IAAIC,EAAOD,GAAsB,GAC7B9lD,EAAI,EACCyd,EAAIU,EAAQV,EAAI8S,EAAK9S,GAAKilB,EAAQ,CACvCqjB,EAAK/lD,KAAOyiC,EAAgBhlB,GAAKwqC,EACjClC,EAAK/lD,KAAOyiC,EAAgBhlB,EAAI,GAAKyqC,EACrC,IAAK,IAAIv4C,EAAI8N,EAAI,EAAG9N,EAAI8N,EAAIilB,IAAU/yB,EAClCo2C,EAAK/lD,KAAOyiC,EAAgB9yB,GAGhCm2C,GAAYC,EAAKzgD,QAAUtF,IAC3B+lD,EAAKzgD,OAAStF,GEmJV,CAAUyiC,EAAiB,EAAGA,EAAgBn9B,OAAQo9B,EAAQulB,EAAQC,EAAQzlB,GAC9Ex9B,KAAK+jC,YAGN2f,EArOwB,CAsOjC,ICrPF,SAASiB,GAAcnnB,EAAiBonB,EAASC,EAASpnB,EAAQ95B,EAAGC,EAAGq+C,GACpE,IAII/oC,EAJA6H,EAAKyc,EAAgBonB,GACrB5jC,EAAKwc,EAAgBonB,EAAU,GAC/BvzC,EAAKmsB,EAAgBqnB,GAAW9jC,EAChCzP,EAAKksB,EAAgBqnB,EAAU,GAAK7jC,EAExC,GAAW,IAAP3P,GAAmB,IAAPC,EACZ4H,EAAS0rC,MAER,CACD,IAAI3oD,IAAM0H,EAAIod,GAAM1P,GAAMzN,EAAIod,GAAM1P,IAAOD,EAAKA,EAAKC,EAAKA,GAC1D,GAAIrV,EAAI,EACJid,EAAS2rC,MAER,IAAI5oD,EAAI,EAAG,CACZ,IAAK,IAAIlB,EAAI,EAAGA,EAAI0iC,IAAU1iC,EAC1BknD,EAAalnD,GAAKwlC,GAAK/C,EAAgBonB,EAAU7pD,GAAIyiC,EAAgBqnB,EAAU9pD,GAAIkB,GAGvF,YADAgmD,EAAa5hD,OAASo9B,GAItBvkB,EAAS0rC,GAGjB,IAAS7pD,EAAI,EAAGA,EAAI0iC,IAAU1iC,EAC1BknD,EAAalnD,GAAKyiC,EAAgBtkB,EAASne,GAE/CknD,EAAa5hD,OAASo9B,EAYnB,SAASqnB,GAAgBtnB,EAAiBtkB,EAAQoS,EAAKmS,EAAQn1B,GAClE,IAAIyY,EAAKyc,EAAgBtkB,GACrB8H,EAAKwc,EAAgBtkB,EAAS,GAClC,IAAKA,GAAUukB,EAAQvkB,EAASoS,EAAKpS,GAAUukB,EAAQ,CACnD,IAAI9oB,EAAK6oB,EAAgBtkB,GACrBtE,EAAK4oB,EAAgBtkB,EAAS,GAC9B6rC,EAAe,GAAUhkC,EAAIC,EAAIrM,EAAIC,GACrCmwC,EAAez8C,IACfA,EAAMy8C,GAEVhkC,EAAKpM,EACLqM,EAAKpM,EAET,OAAOtM,EAUJ,SAAS08C,GAAqBxnB,EAAiBtkB,EAAQ+rC,EAAMxnB,EAAQn1B,GACxE,IAAK,IAAIvN,EAAI,EAAG2hC,EAAKuoB,EAAK5kD,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAC3C,IAAIuwB,EAAM25B,EAAKlqD,GACfuN,EAAMw8C,GAAgBtnB,EAAiBtkB,EAAQoS,EAAKmS,EAAQn1B,GAC5D4Q,EAASoS,EAEb,OAAOhjB,EAgCJ,SAAS48C,GAAmB1nB,EAAiBtkB,EAAQoS,EAAKmS,EAAQ0nB,EAAUC,EAAQzhD,EAAGC,EAAGq+C,EAAcC,EAAoBmD,GAC/H,GAAInsC,GAAUoS,EACV,OAAO42B,EAEX,IAAInnD,EAAGuqD,EACP,GAAiB,IAAbH,EAAgB,CAGhB,IADAG,EAAkB,GAAU3hD,EAAGC,EAAG45B,EAAgBtkB,GAASskB,EAAgBtkB,EAAS,KAC9DgpC,EAAoB,CACtC,IAAKnnD,EAAI,EAAGA,EAAI0iC,IAAU1iC,EACtBknD,EAAalnD,GAAKyiC,EAAgBtkB,EAASne,GAG/C,OADAknD,EAAa5hD,OAASo9B,EACf6nB,EAGP,OAAOpD,EAKf,IAFA,IAAIqD,EAAWF,GAA8B,CAACj1C,IAAKA,KAC/C3J,EAAQyS,EAASukB,EACdh3B,EAAQ6kB,GAGX,GAFAq5B,GAAcnnB,EAAiB/2B,EAAQg3B,EAAQh3B,EAAOg3B,EAAQ95B,EAAGC,EAAG2hD,IACpED,EAAkB,GAAU3hD,EAAGC,EAAG2hD,EAAS,GAAIA,EAAS,KAClCrD,EAAoB,CAEtC,IADAA,EAAqBoD,EAChBvqD,EAAI,EAAGA,EAAI0iC,IAAU1iC,EACtBknD,EAAalnD,GAAKwqD,EAASxqD,GAE/BknD,EAAa5hD,OAASo9B,EACtBh3B,GAASg3B,OAaTh3B,GACIg3B,EACIn7B,KAAKgG,KAAMhG,KAAKsK,KAAK04C,GAAmBhjD,KAAKsK,KAAKs1C,IAC9CiD,EACA,EAAG,GAGvB,GAAIC,IAEAT,GAAcnnB,EAAiBlS,EAAMmS,EAAQvkB,EAAQukB,EAAQ95B,EAAGC,EAAG2hD,IACnED,EAAkB,GAAU3hD,EAAGC,EAAG2hD,EAAS,GAAIA,EAAS,KAClCrD,GAAoB,CAEtC,IADAA,EAAqBoD,EAChBvqD,EAAI,EAAGA,EAAI0iC,IAAU1iC,EACtBknD,EAAalnD,GAAKwqD,EAASxqD,GAE/BknD,EAAa5hD,OAASo9B,EAG9B,OAAOykB,EAgBJ,SAASsD,GAAwBhoB,EAAiBtkB,EAAQ+rC,EAAMxnB,EAAQ0nB,EAAUC,EAAQzhD,EAAGC,EAAGq+C,EAAcC,EAAoBmD,GAErI,IADA,IAAIE,EAAWF,GAA8B,CAACj1C,IAAKA,KAC1CrV,EAAI,EAAG2hC,EAAKuoB,EAAK5kD,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAC3C,IAAIuwB,EAAM25B,EAAKlqD,GACfmnD,EAAqBgD,GAAmB1nB,EAAiBtkB,EAAQoS,EAAKmS,EAAQ0nB,EAAUC,EAAQzhD,EAAGC,EAAGq+C,EAAcC,EAAoBqD,GACxIrsC,EAASoS,EAEb,OAAO42B,ECnLJ,SAASuD,GAAmBjoB,EAAiBtkB,EAAQqjB,EAAakB,GACrE,IAAK,IAAI1iC,EAAI,EAAG2hC,EAAKH,EAAYl8B,OAAQtF,EAAI2hC,IAAM3hC,EAE/C,IADA,IAAI+gC,EAAaS,EAAYxhC,GACpByd,EAAI,EAAGA,EAAIilB,IAAUjlB,EAC1BglB,EAAgBtkB,KAAY4iB,EAAWtjB,GAG/C,OAAOU,EAUJ,SAASwsC,GAAwBloB,EAAiBtkB,EAAQysC,EAAcloB,EAAQmoB,GAGnF,IAFA,IAAIX,EAAOW,GAAsB,GAC7B7qD,EAAI,EACCyd,EAAI,EAAGqtC,EAAKF,EAAatlD,OAAQmY,EAAIqtC,IAAMrtC,EAAG,CACnD,IAAI8S,EAAMm6B,GAAmBjoB,EAAiBtkB,EAAQysC,EAAantC,GAAIilB,GACvEwnB,EAAKlqD,KAAOuwB,EACZpS,EAASoS,EAGb,OADA25B,EAAK5kD,OAAStF,EACPkqD,ECeJ,SAASa,GAAetoB,EAAiBtkB,EAAQoS,EAAKmS,EAAQmkB,EAAkBmE,EAA2BC,GAC9G,IAAIxpD,GAAK8uB,EAAMpS,GAAUukB,EACzB,GAAIjhC,EAAI,EAAG,CACP,KAAO0c,EAASoS,EAAKpS,GAAUukB,EAC3BsoB,EAA0BC,KAAsBxoB,EAAgBtkB,GAChE6sC,EAA0BC,KACtBxoB,EAAgBtkB,EAAS,GAEjC,OAAO8sC,EAGX,IAAIC,EAAU,IAAItmD,MAAMnD,GACxBypD,EAAQ,GAAK,EACbA,EAAQzpD,EAAI,GAAK,EAIjB,IAFA,IAAI0pD,EAAQ,CAAChtC,EAAQoS,EAAMmS,GACvBh3B,EAAQ,EACLy/C,EAAM7lD,OAAS,GAAG,CAQrB,IAPA,IAAIgc,EAAO6pC,EAAM5jC,MACb2I,EAAQi7B,EAAM5jC,MACd6jC,EAAqB,EACrBplC,EAAKyc,EAAgBvS,GACrBjK,EAAKwc,EAAgBvS,EAAQ,GAC7BtW,EAAK6oB,EAAgBnhB,GACrBzH,EAAK4oB,EAAgBnhB,EAAO,GACvBthB,EAAIkwB,EAAQwS,EAAQ1iC,EAAIshB,EAAMthB,GAAK0iC,EAAQ,CAChD,IAEI2oB,EAAoBjmB,GAFhB3C,EAAgBziC,GAChByiC,EAAgBziC,EAAI,GACyBgmB,EAAIC,EAAIrM,EAAIC,GAC7DwxC,EAAoBD,IACpB1/C,EAAQ1L,EACRorD,EAAqBC,GAGzBD,EAAqBvE,IACrBqE,GAASx/C,EAAQyS,GAAUukB,GAAU,EACjCxS,EAAQwS,EAASh3B,GACjBy/C,EAAMrlD,KAAKoqB,EAAOxkB,GAElBA,EAAQg3B,EAASphB,GACjB6pC,EAAMrlD,KAAK4F,EAAO4V,IAI9B,IAASthB,EAAI,EAAGA,EAAIyB,IAAKzB,EACjBkrD,EAAQlrD,KACRgrD,EAA0BC,KACtBxoB,EAAgBtkB,EAASne,EAAI0iC,GACjCsoB,EAA0BC,KACtBxoB,EAAgBtkB,EAASne,EAAI0iC,EAAS,IAGlD,OAAOuoB,EAgGJ,SAASK,GAAKrqD,EAAO6mD,GACxB,OAAOA,EAAYvgD,KAAK+F,MAAMrM,EAAQ6mD,GAqBnC,SAASyD,GAAS9oB,EAAiBtkB,EAAQoS,EAAKmS,EAAQolB,EAAWkD,EAA2BC,GAEjG,GAAI9sC,GAAUoS,EACV,OAAO06B,EAGX,IAQIrxC,EAAIC,EARJmM,EAAKslC,GAAK7oB,EAAgBtkB,GAAS2pC,GACnC7hC,EAAKqlC,GAAK7oB,EAAgBtkB,EAAS,GAAI2pC,GAC3C3pC,GAAUukB,EAEVsoB,EAA0BC,KAAsBjlC,EAChDglC,EAA0BC,KAAsBhlC,EAIhD,GAII,GAHArM,EAAK0xC,GAAK7oB,EAAgBtkB,GAAS2pC,GACnCjuC,EAAKyxC,GAAK7oB,EAAgBtkB,EAAS,GAAI2pC,IACvC3pC,GAAUukB,IACInS,EAOV,OAFAy6B,EAA0BC,KAAsBrxC,EAChDoxC,EAA0BC,KAAsBpxC,EACzCoxC,QAENrxC,GAAMoM,GAAMnM,GAAMoM,GAC3B,KAAO9H,EAASoS,GAAK,CAEjB,IAAI6T,EAAKknB,GAAK7oB,EAAgBtkB,GAAS2pC,GACnCxjB,EAAKgnB,GAAK7oB,EAAgBtkB,EAAS,GAAI2pC,GAG3C,GAFA3pC,GAAUukB,EAEN0B,GAAMxqB,GAAM0qB,GAAMzqB,EAAtB,CAIA,IAAIonB,EAAMrnB,EAAKoM,EACXkb,EAAMrnB,EAAKoM,EAEXkb,EAAMiD,EAAKpe,EACXob,EAAMkD,EAAKre,EAIXgb,EAAMG,GAAOF,EAAMC,IACjBF,EAAM,GAAKE,EAAMF,GAAQA,GAAOE,GAAQF,EAAM,GAAKE,EAAMF,KACzDC,EAAM,GAAKE,EAAMF,GAAQA,GAAOE,GAAQF,EAAM,GAAKE,EAAMF,IAE3DtnB,EAAKwqB,EACLvqB,EAAKyqB,IAMT0mB,EAA0BC,KAAsBrxC,EAChDoxC,EAA0BC,KAAsBpxC,EAChDmM,EAAKpM,EACLqM,EAAKpM,EACLD,EAAKwqB,EACLvqB,EAAKyqB,IAKT,OAFA0mB,EAA0BC,KAAsBrxC,EAChDoxC,EAA0BC,KAAsBpxC,EACzCoxC,EAcJ,SAASO,GAAc/oB,EAAiBtkB,EAAQ+rC,EAAMxnB,EAAQolB,EAAWkD,EAA2BC,EAAkBQ,GACzH,IAAK,IAAIzrD,EAAI,EAAG2hC,EAAKuoB,EAAK5kD,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAC3C,IAAIuwB,EAAM25B,EAAKlqD,GACfirD,EAAmBM,GAAS9oB,EAAiBtkB,EAAQoS,EAAKmS,EAAQolB,EAAWkD,EAA2BC,GACxGQ,EAAe3lD,KAAKmlD,GACpB9sC,EAASoS,EAEb,OAAO06B,ECxTJ,SAASS,GAAmBjpB,EAAiBtkB,EAAQoS,EAAKmS,EAAQipB,GAGrE,IAFA,IAAInqB,OAAkCjI,IAApBoyB,EAAgCA,EAAkB,GAChE3rD,EAAI,EACCyd,EAAIU,EAAQV,EAAI8S,EAAK9S,GAAKilB,EAC/BlB,EAAYxhC,KAAOyiC,EAAgBr8B,MAAMqX,EAAGA,EAAIilB,GAGpD,OADAlB,EAAYl8B,OAAStF,EACdwhC,EAUJ,SAASoqB,GAAwBnpB,EAAiBtkB,EAAQ+rC,EAAMxnB,EAAQmpB,GAG3E,IAFA,IAAIjB,OAAoCrxB,IAArBsyB,EAAiCA,EAAmB,GACnE7rD,EAAI,EACCyd,EAAI,EAAGqtC,EAAKZ,EAAK5kD,OAAQmY,EAAIqtC,IAAMrtC,EAAG,CAC3C,IAAI8S,EAAM25B,EAAKzsC,GACfmtC,EAAa5qD,KAAO0rD,GAAmBjpB,EAAiBtkB,EAAQoS,EAAKmS,EAAQkoB,EAAa5qD,IAC1Fme,EAASoS,EAGb,OADAq6B,EAAatlD,OAAStF,EACf4qD,EC3BJ,SAAS,GAAWnoB,EAAiBtkB,EAAQoS,EAAKmS,GAIrD,IAHA,IAAIopB,EAAY,EACZ9lC,EAAKyc,EAAgBlS,EAAMmS,GAC3Bzc,EAAKwc,EAAgBlS,EAAMmS,EAAS,GACjCvkB,EAASoS,EAAKpS,GAAUukB,EAAQ,CACnC,IAAI9oB,EAAK6oB,EAAgBtkB,GACrBtE,EAAK4oB,EAAgBtkB,EAAS,GAClC2tC,GAAa7lC,EAAKrM,EAAKoM,EAAKnM,EAC5BmM,EAAKpM,EACLqM,EAAKpM,EAET,OAAOiyC,EAAY,EAShB,SAAS,GAAYrpB,EAAiBtkB,EAAQ+rC,EAAMxnB,GAEvD,IADA,IAAIQ,EAAO,EACFljC,EAAI,EAAG2hC,EAAKuoB,EAAK5kD,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAC3C,IAAIuwB,EAAM25B,EAAKlqD,GACfkjC,GAAQ,GAAWT,EAAiBtkB,EAAQoS,EAAKmS,GACjDvkB,EAASoS,EAEb,OAAO2S,ECrCX,IAAI,GAAwC,WACxC,IAAI1+B,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAmJ7B,GAjHiB,SAAUu7B,GAOtC,SAASwrB,EAAWvqB,EAAa8nB,GAC7B,IAAIvoC,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAmBjC,OAdA8b,EAAMirC,WAAa,EAKnBjrC,EAAMkrC,mBAAqB,OACR1yB,IAAf+vB,GAA6B1kD,MAAMgC,QAAQ46B,EAAY,IAKvDzgB,EAAMsoC,eACsD,EAAeC,GAL3EvoC,EAAMqoC,mBAAmBE,EACI,GAM1BvoC,EAoFX,OA9GA,GAAUgrC,EAAYxrB,GAiCtBwrB,EAAWnqD,UAAUgS,MAAQ,WACzB,OAAO,IAAIm4C,EAAW9mD,KAAKw9B,gBAAgBr8B,QAASnB,KAAKwjD,SAS7DsD,EAAWnqD,UAAUqlD,eAAiB,SAAUr+C,EAAGC,EAAGq+C,EAAcC,GAChE,OAAIA,EAAqBtlB,GAAyB58B,KAAK4mC,YAAajjC,EAAGC,GAC5Ds+C,GAEPliD,KAAKgnD,mBAAqBhnD,KAAKikC,gBAC/BjkC,KAAK+mD,UAAYzkD,KAAKsK,KAAKk4C,GAAgB9kD,KAAKw9B,gBAAiB,EAAGx9B,KAAKw9B,gBAAgBn9B,OAAQL,KAAKy9B,OAAQ,IAC9Gz9B,KAAKgnD,kBAAoBhnD,KAAKikC,eAE3BihB,GAAmBllD,KAAKw9B,gBAAiB,EAAGx9B,KAAKw9B,gBAAgBn9B,OAAQL,KAAKy9B,OAAQz9B,KAAK+mD,WAAW,EAAMpjD,EAAGC,EAAGq+C,EAAcC,KAO3I4E,EAAWnqD,UAAUqhC,QAAU,WAC3B,OAAO,GAAeh+B,KAAKw9B,gBAAiB,EAAGx9B,KAAKw9B,gBAAgBn9B,OAAQL,KAAKy9B,SAOrFqpB,EAAWnqD,UAAUgnD,eAAiB,WAClC,OAAO8C,GAAmBzmD,KAAKw9B,gBAAiB,EAAGx9B,KAAKw9B,gBAAgBn9B,OAAQL,KAAKy9B,SAOzFqpB,EAAWnqD,UAAUsnD,8BAAgC,SAAUrC,GAC3D,IAAImE,EAA4B,GAEhC,OADAA,EAA0B1lD,OAASylD,GAAe9lD,KAAKw9B,gBAAiB,EAAGx9B,KAAKw9B,gBAAgBn9B,OAAQL,KAAKy9B,OAAQmkB,EAAkBmE,EAA2B,GAC3J,IAAIe,EAAWf,EAA2BtC,KAOrDqD,EAAWnqD,UAAUmmD,QAAU,WAC3B,OAAOmE,IAQXH,EAAWnqD,UAAUomD,iBAAmB,SAAUvmB,GAC9C,OAAO,GAQXsqB,EAAWnqD,UAAUynD,eAAiB,SAAU7nB,EAAa8nB,GACzDrkD,KAAKskD,UAAUD,EAAY9nB,EAAa,GACnCv8B,KAAKw9B,kBACNx9B,KAAKw9B,gBAAkB,IAE3Bx9B,KAAKw9B,gBAAgBn9B,OAASolD,GAAmBzlD,KAAKw9B,gBAAiB,EAAGjB,EAAav8B,KAAKy9B,QAC5Fz9B,KAAK+jC,WAEF+iB,EA/GoB,CAgH7B,IClJE,GAAwC,WACxC,IAAIvnD,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAwH7B,GA3FY,SAAUu7B,GAMjC,SAAS4rB,EAAM3qB,EAAa8nB,GACxB,IAAIvoC,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAEjC,OADA8b,EAAMsoC,eAAe7nB,EAAa8nB,GAC3BvoC,EAgFX,OAxFA,GAAUorC,EAAO5rB,GAejB4rB,EAAMvqD,UAAUgS,MAAQ,WACpB,IAAI6G,EAAQ,IAAI0xC,EAAMlnD,KAAKw9B,gBAAgBr8B,QAASnB,KAAKwjD,QAEzD,OADAhuC,EAAM8vB,gBAAgBtlC,MACfwV,GASX0xC,EAAMvqD,UAAUqlD,eAAiB,SAAUr+C,EAAGC,EAAGq+C,EAAcC,GAC3D,IAAI1kB,EAAkBx9B,KAAKw9B,gBACvB8nB,EAAkB,GAAU3hD,EAAGC,EAAG45B,EAAgB,GAAIA,EAAgB,IAC1E,GAAI8nB,EAAkBpD,EAAoB,CAEtC,IADA,IAAIzkB,EAASz9B,KAAKy9B,OACT1iC,EAAI,EAAGA,EAAI0iC,IAAU1iC,EAC1BknD,EAAalnD,GAAKyiC,EAAgBziC,GAGtC,OADAknD,EAAa5hD,OAASo9B,EACf6nB,EAGP,OAAOpD,GAQfgF,EAAMvqD,UAAUgnD,eAAiB,WAC7B,OAAQ3jD,KAAKw9B,gBAAuBx9B,KAAKw9B,gBAAgBr8B,QAA1B,IAOnC+lD,EAAMvqD,UAAU4lD,cAAgB,SAAU/lB,GACtC,O9D4IqCV,E8D5ID97B,KAAKw9B,gB9D4IQL,E8D5ISX,E9D6I1D74B,EAAIm4B,EAAW,GACfl4B,EAAIk4B,EAAW,GACZoB,GAAev5B,EAAGC,EAAGD,EAAGC,EAAGu5B,GAH/B,IAAsCrB,EAAYqB,EACjDx5B,EACAC,G8DvIJsjD,EAAMvqD,UAAUmmD,QAAU,WACtB,OAAOmE,IAQXC,EAAMvqD,UAAUomD,iBAAmB,SAAUvmB,GACzC,OAAOM,GAAWN,EAAQx8B,KAAKw9B,gBAAgB,GAAIx9B,KAAKw9B,gBAAgB,KAO5E0pB,EAAMvqD,UAAUynD,eAAiB,SAAU7nB,EAAa8nB,GACpDrkD,KAAKskD,UAAUD,EAAY9nB,EAAa,GACnCv8B,KAAKw9B,kBACNx9B,KAAKw9B,gBAAkB,IAE3Bx9B,KAAKw9B,gBAAgBn9B,OLzGtB,SAA2Bm9B,EAAiBtkB,EAAQ4iB,EAAY2B,GACnE,IAAK,IAAI1iC,EAAI,EAAG2hC,EAAKZ,EAAWz7B,OAAQtF,EAAI2hC,IAAM3hC,EAC9CyiC,EAAgBtkB,KAAY4iB,EAAW/gC,GAE3C,OAAOme,EKqG2BiuC,CAAkBnnD,KAAKw9B,gBAAiB,EAAGjB,EAAav8B,KAAKy9B,QAC3Fz9B,KAAK+jC,WAEFmjB,EAzFe,CA0FxB,IC3GK,SAASE,GAAyB5pB,EAAiBtkB,EAAQoS,EAAKmS,EAAQjB,GAS3E,OARcmB,GAAcnB,GAK5B,SAAUV,GACN,OAAQurB,GAAqB7pB,EAAiBtkB,EAAQoS,EAAKmS,EAAQ3B,EAAW,GAAIA,EAAW,OAa9F,SAASurB,GAAqB7pB,EAAiBtkB,EAAQoS,EAAKmS,EAAQ95B,EAAGC,GAW1E,IAHA,IAAI6gB,EAAK,EACL1D,EAAKyc,EAAgBlS,EAAMmS,GAC3Bzc,EAAKwc,EAAgBlS,EAAMmS,EAAS,GACjCvkB,EAASoS,EAAKpS,GAAUukB,EAAQ,CACnC,IAAI9oB,EAAK6oB,EAAgBtkB,GACrBtE,EAAK4oB,EAAgBtkB,EAAS,GAC9B8H,GAAMpd,EACFgR,EAAKhR,IAAM+Q,EAAKoM,IAAOnd,EAAIod,IAAOrd,EAAIod,IAAOnM,EAAKoM,GAAM,GACxDyD,IAGC7P,GAAMhR,IAAM+Q,EAAKoM,IAAOnd,EAAIod,IAAOrd,EAAIod,IAAOnM,EAAKoM,GAAM,GAC9DyD,IAEJ1D,EAAKpM,EACLqM,EAAKpM,EAET,OAAc,IAAP6P,EAWJ,SAAS6iC,GAAsB9pB,EAAiBtkB,EAAQ+rC,EAAMxnB,EAAQ95B,EAAGC,GAC5E,GAAoB,IAAhBqhD,EAAK5kD,OACL,OAAO,EAEX,IAAKgnD,GAAqB7pB,EAAiBtkB,EAAQ+rC,EAAK,GAAIxnB,EAAQ95B,EAAGC,GACnE,OAAO,EAEX,IAAK,IAAI7I,EAAI,EAAG2hC,EAAKuoB,EAAK5kD,OAAQtF,EAAI2hC,IAAM3hC,EACxC,GAAIssD,GAAqB7pB,EAAiBynB,EAAKlqD,EAAI,GAAIkqD,EAAKlqD,GAAI0iC,EAAQ95B,EAAGC,GACvE,OAAO,EAGf,OAAO,EC9DJ,SAAS2jD,GAAwB/pB,EAAiBtkB,EAAQ+rC,EAAMxnB,EAAQ+pB,EAAaC,EAAmB5G,GAM3G,IALA,IAAI9lD,EAAG2hC,EAAI/4B,EAAGod,EAAIpM,EAAIqM,EAAIpM,EACtBhR,EAAI4jD,EAAYC,EAAoB,GAEpCC,EAAgB,GAEX7rD,EAAI,EAAG8rD,EAAK1C,EAAK5kD,OAAQxE,EAAI8rD,IAAM9rD,EAAG,CAC3C,IAAIyvB,EAAM25B,EAAKppD,GAGf,IAFAklB,EAAKyc,EAAgBlS,EAAMmS,GAC3Bzc,EAAKwc,EAAgBlS,EAAMmS,EAAS,GAC/B1iC,EAAIme,EAAQne,EAAIuwB,EAAKvwB,GAAK0iC,EAC3B9oB,EAAK6oB,EAAgBziC,GACrB6Z,EAAK4oB,EAAgBziC,EAAI,IACpB6I,GAAKod,GAAMpM,GAAMhR,GAAOod,GAAMpd,GAAKA,GAAKgR,KACzCjR,GAAMC,EAAIod,IAAOpM,EAAKoM,IAAQrM,EAAKoM,GAAMA,EACzC2mC,EAAc7mD,KAAK8C,IAEvBod,EAAKpM,EACLqM,EAAKpM,EAKb,IAAIgzC,EAASx3C,IACTy3C,GAAoB/yC,IAGxB,IAFA4yC,EAAcz+B,KAAK0Q,IACnB5Y,EAAK2mC,EAAc,GACd3sD,EAAI,EAAG2hC,EAAKgrB,EAAcrnD,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAChD4Z,EAAK+yC,EAAc3sD,GACnB,IAAI+sD,EAAgBxlD,KAAK4M,IAAIyF,EAAKoM,GAC9B+mC,EAAgBD,GAEZP,GAAsB9pB,EAAiBtkB,EAAQ+rC,EAAMxnB,EADzD95B,GAAKod,EAAKpM,GAAM,EACoD/Q,KAChEgkD,EAASjkD,EACTkkD,EAAmBC,GAG3B/mC,EAAKpM,EAOT,OALI4E,MAAMquC,KAGNA,EAASJ,EAAYC,IAErB5G,GACAA,EAAShgD,KAAK+mD,EAAQhkD,EAAGikD,GAClBhH,GAGA,CAAC+G,EAAQhkD,EAAGikD,GCrDpB,SAASE,GAAqBvqB,EAAiBtkB,EAAQoS,EAAKmS,EAAQjB,GACvE,IjEuH2Ba,EAASC,EiEvHhC0qB,EAAoBzqB,GjE+KjB,CAACzoB,IAAUA,KAAU,KAAW,KiE/KsB0oB,EAAiBtkB,EAAQoS,EAAKmS,GAC3F,QAAK,GAAWjB,EAAQwrB,KjEsHY1qB,EiEnHT0qB,GjEmHA3qB,EiEnHRb,GjEoHH,IAAMc,EAAQ,IAC1BA,EAAQ,IAAMD,EAAQ,IACtBA,EAAQ,IAAMC,EAAQ,IACtBA,EAAQ,IAAMD,EAAQ,KiEpHtB2qB,EAAkB,IAAMxrB,EAAO,IAAMwrB,EAAkB,IAAMxrB,EAAO,KAGpEwrB,EAAkB,IAAMxrB,EAAO,IAAMwrB,EAAkB,IAAMxrB,EAAO,ICTrE,SAAiBgB,EAAiBtkB,EAAQoS,EAAKmS,EAAQ/b,GAC1D,IAAIjY,EAEJ,IADAyP,GAAUukB,EACHvkB,EAASoS,EAAKpS,GAAUukB,EAE3B,GADAh0B,EAAMiY,EAAS8b,EAAgBr8B,MAAM+X,EAASukB,EAAQvkB,GAASskB,EAAgBr8B,MAAM+X,EAAQA,EAASukB,IAElG,OAAOh0B,EAGf,OAAO,EDGAG,CAAe4zB,EAAiBtkB,EAAQoS,EAAKmS,GAOpD,SAAUwqB,EAAQC,GACd,OjE0nBD,SAA2B1rB,EAAQpR,EAAOE,GAC7C,IAAI68B,GAAa,EACbC,EAAWrrB,GAAuBP,EAAQpR,GAC1Ci9B,EAAStrB,GAAuBP,EAAQlR,GAC5C,GAAI88B,IAAanrB,IACborB,IAAWprB,GACXkrB,GAAa,MAEZ,CACD,IAAIhmC,EAAOqa,EAAO,GACdpa,EAAOoa,EAAO,GACdva,EAAOua,EAAO,GACdta,EAAOsa,EAAO,GACd8rB,EAASl9B,EAAM,GACfm9B,EAASn9B,EAAM,GACfo9B,EAAOl9B,EAAI,GACXm9B,EAAOn9B,EAAI,GACXo9B,GAASD,EAAOF,IAAWC,EAAOF,GAClC3kD,OAAI,EAAQC,OAAI,EACbykD,EAASprB,MAAyBmrB,EAAWnrB,MAGhDkrB,GADAxkD,EAAI6kD,GAAQC,EAAOvmC,GAAQwmC,IACTvmC,GAAQxe,GAAKse,GAE9BkmC,KACEE,EAASprB,KACVmrB,EAAWnrB,KAGbkrB,GADAvkD,EAAI6kD,GAAQD,EAAOvmC,GAAQymC,IACTtmC,GAAQxe,GAAKse,GAE9BimC,KACEE,EAASprB,KACVmrB,EAAWnrB,KAGbkrB,GADAxkD,EAAI6kD,GAAQC,EAAOrmC,GAAQsmC,IACTvmC,GAAQxe,GAAKse,GAE9BkmC,KACEE,EAASprB,KACVmrB,EAAWnrB,KAGbkrB,GADAvkD,EAAI6kD,GAAQD,EAAOrmC,GAAQumC,IACTtmC,GAAQxe,GAAKse,GAGvC,OAAOimC,EiExqBIQ,CAAkBnsB,EAAQyrB,EAAQC,SAsD1C,SAASU,GAA0BprB,EAAiBtkB,EAAQ+rC,EAAMxnB,EAAQjB,GAC7E,IA3BG,SAA8BgB,EAAiBtkB,EAAQoS,EAAKmS,EAAQjB,GACvE,QAAIurB,GAAqBvqB,EAAiBtkB,EAAQoS,EAAKmS,EAAQjB,OAG3D6qB,GAAqB7pB,EAAiBtkB,EAAQoS,EAAKmS,EAAQjB,EAAO,GAAIA,EAAO,QAG7E6qB,GAAqB7pB,EAAiBtkB,EAAQoS,EAAKmS,EAAQjB,EAAO,GAAIA,EAAO,QAG7E6qB,GAAqB7pB,EAAiBtkB,EAAQoS,EAAKmS,EAAQjB,EAAO,GAAIA,EAAO,OAG7E6qB,GAAqB7pB,EAAiBtkB,EAAQoS,EAAKmS,EAAQjB,EAAO,GAAIA,EAAO,OAc5EqsB,CAAqBrrB,EAAiBtkB,EAAQ+rC,EAAK,GAAIxnB,EAAQjB,GAChE,OAAO,EAEX,GAAoB,IAAhByoB,EAAK5kD,OACL,OAAO,EAEX,IAAK,IAAItF,EAAI,EAAG2hC,EAAKuoB,EAAK5kD,OAAQtF,EAAI2hC,IAAM3hC,EACxC,GAAIqsD,GAAyB5pB,EAAiBynB,EAAKlqD,EAAI,GAAIkqD,EAAKlqD,GAAI0iC,EAAQjB,KACnEurB,GAAqBvqB,EAAiBynB,EAAKlqD,EAAI,GAAIkqD,EAAKlqD,GAAI0iC,EAAQjB,GACrE,OAAO,EAInB,OAAO,EE/FJ,SAAS,GAAYgB,EAAiBtkB,EAAQoS,EAAKmS,GACtD,KAAOvkB,EAASoS,EAAMmS,GAAQ,CAC1B,IAAK,IAAI1iC,EAAI,EAAGA,EAAI0iC,IAAU1iC,EAAG,CAC7B,IAAI+tD,EAAMtrB,EAAgBtkB,EAASne,GACnCyiC,EAAgBtkB,EAASne,GAAKyiC,EAAgBlS,EAAMmS,EAAS1iC,GAC7DyiC,EAAgBlS,EAAMmS,EAAS1iC,GAAK+tD,EAExC5vC,GAAUukB,EACVnS,GAAOmS,GCHR,SAASsrB,GAAsBvrB,EAAiBtkB,EAAQoS,EAAKmS,GAMhE,IAHA,IAAIurB,EAAO,EACPjoC,EAAKyc,EAAgBlS,EAAMmS,GAC3Bzc,EAAKwc,EAAgBlS,EAAMmS,EAAS,GACjCvkB,EAASoS,EAAKpS,GAAUukB,EAAQ,CACnC,IAAI9oB,EAAK6oB,EAAgBtkB,GACrBtE,EAAK4oB,EAAgBtkB,EAAS,GAClC8vC,IAASr0C,EAAKoM,IAAOnM,EAAKoM,GAC1BD,EAAKpM,EACLqM,EAAKpM,EAET,OAAgB,IAATo0C,OAAa10B,EAAY00B,EAAO,EAepC,SAASC,GAAuBzrB,EAAiBtkB,EAAQ+rC,EAAMxnB,EAAQyrB,GAE1E,IADA,IAAIC,OAAsB70B,IAAd40B,GAA0BA,EAC7BnuD,EAAI,EAAG2hC,EAAKuoB,EAAK5kD,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAC3C,IAAIuwB,EAAM25B,EAAKlqD,GACXquD,EAAcL,GAAsBvrB,EAAiBtkB,EAAQoS,EAAKmS,GACtE,GAAU,IAAN1iC,GACA,GAAKouD,GAASC,IAAkBD,IAAUC,EACtC,OAAO,OAIX,GAAKD,IAAUC,IAAkBD,GAASC,EACtC,OAAO,EAGflwC,EAASoS,EAEb,OAAO,EAwCJ,SAAS+9B,GAAkB7rB,EAAiBtkB,EAAQ+rC,EAAMxnB,EAAQyrB,GAErE,IADA,IAAIC,OAAsB70B,IAAd40B,GAA0BA,EAC7BnuD,EAAI,EAAG2hC,EAAKuoB,EAAK5kD,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAC3C,IAAIuwB,EAAM25B,EAAKlqD,GACXquD,EAAcL,GAAsBvrB,EAAiBtkB,EAAQoS,EAAKmS,IAClD,IAAN1iC,EACPouD,GAASC,IAAkBD,IAAUC,EACrCD,IAAUC,IAAkBD,GAASC,IAExC,GAAmB5rB,EAAiBtkB,EAAQoS,EAAKmS,GAErDvkB,EAASoS,EAEb,OAAOpS,EChHX,IAAI,GAAwC,WACxC,IAAI3Z,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA0CxC,GAAyB,SAAUu7B,GAanC,SAASguB,EAAQ/sB,EAAa8nB,EAAYuB,GACtC,IAAI9pC,EAAQwf,EAAOpgC,KAAK8E,OAASA,KA6CjC,OAxCA8b,EAAMytC,MAAQ,GAKdztC,EAAM0tC,4BAA8B,EAKpC1tC,EAAM2tC,mBAAqB,KAK3B3tC,EAAMirC,WAAa,EAKnBjrC,EAAMkrC,mBAAqB,EAK3BlrC,EAAM4tC,mBAAqB,EAK3B5tC,EAAM6tC,yBAA2B,UACdr1B,IAAf+vB,GAA4BuB,GAC5B9pC,EAAMqoC,mBAAmBE,EACI,GAC7BvoC,EAAMytC,MAAQ3D,GAGd9pC,EAAMsoC,eAC6D,EAAeC,GAE/EvoC,EAuNX,OAjRA,GAAUwtC,EAAShuB,GAiEnBguB,EAAQ3sD,UAAUitD,iBAAmB,SAAUC,GACtC7pD,KAAKw9B,gBAIN,GAAOx9B,KAAKw9B,gBAAiBqsB,EAAWhG,sBAHxC7jD,KAAKw9B,gBAAkBqsB,EAAWhG,qBAAqB1iD,QAK3DnB,KAAKupD,MAAM1oD,KAAKb,KAAKw9B,gBAAgBn9B,QACrCL,KAAK+jC,WAOTulB,EAAQ3sD,UAAUgS,MAAQ,WACtB,IAAI4a,EAAU,IAAI+/B,EAAQtpD,KAAKw9B,gBAAgBr8B,QAASnB,KAAKwjD,OAAQxjD,KAAKupD,MAAMpoD,SAEhF,OADAooB,EAAQ+b,gBAAgBtlC,MACjBupB,GASX+/B,EAAQ3sD,UAAUqlD,eAAiB,SAAUr+C,EAAGC,EAAGq+C,EAAcC,GAC7D,OAAIA,EAAqBtlB,GAAyB58B,KAAK4mC,YAAajjC,EAAGC,GAC5Ds+C,GAEPliD,KAAKgnD,mBAAqBhnD,KAAKikC,gBAC/BjkC,KAAK+mD,UAAYzkD,KAAKsK,KAAKo4C,GAAqBhlD,KAAKw9B,gBAAiB,EAAGx9B,KAAKupD,MAAOvpD,KAAKy9B,OAAQ,IAClGz9B,KAAKgnD,kBAAoBhnD,KAAKikC,eAE3BuhB,GAAwBxlD,KAAKw9B,gBAAiB,EAAGx9B,KAAKupD,MAAOvpD,KAAKy9B,OAAQz9B,KAAK+mD,WAAW,EAAMpjD,EAAGC,EAAGq+C,EAAcC,KAO/HoH,EAAQ3sD,UAAUmgC,WAAa,SAAUn5B,EAAGC,GACxC,OAAO0jD,GAAsBtnD,KAAK8pD,6BAA8B,EAAG9pD,KAAKupD,MAAOvpD,KAAKy9B,OAAQ95B,EAAGC,IAOnG0lD,EAAQ3sD,UAAUqhC,QAAU,WACxB,OAAO,GAAgBh+B,KAAK8pD,6BAA8B,EAAG9pD,KAAKupD,MAAOvpD,KAAKy9B,SAelF6rB,EAAQ3sD,UAAUgnD,eAAiB,SAAUuF,GACzC,IAAI1rB,EAQJ,YAPkBlJ,IAAd40B,EAEAG,GADA7rB,EAAkBx9B,KAAK8pD,6BAA6B3oD,QACjB,EAAGnB,KAAKupD,MAAOvpD,KAAKy9B,OAAQyrB,GAG/D1rB,EAAkBx9B,KAAKw9B,gBAEpBmpB,GAAwBnpB,EAAiB,EAAGx9B,KAAKupD,MAAOvpD,KAAKy9B,SAKxE6rB,EAAQ3sD,UAAUotD,QAAU,WACxB,OAAO/pD,KAAKupD,OAKhBD,EAAQ3sD,UAAUqtD,qBAAuB,WACrC,GAAIhqD,KAAKwpD,4BAA8BxpD,KAAKikC,cAAe,CACvD,IAAIgmB,EAAa5rB,GAAUr+B,KAAK4mC,aAChC5mC,KAAKypD,mBAAqBlC,GAAwBvnD,KAAK8pD,6BAA8B,EAAG9pD,KAAKupD,MAAOvpD,KAAKy9B,OAAQwsB,EAAY,GAC7HjqD,KAAKwpD,2BAA6BxpD,KAAKikC,cAE3C,OAAOjkC,KAAKypD,oBAQhBH,EAAQ3sD,UAAUutD,iBAAmB,WACjC,OAAO,IAAI,GAAMlqD,KAAKgqD,uBAAwBvG,KASlD6F,EAAQ3sD,UAAUwtD,mBAAqB,WACnC,OAAOnqD,KAAKupD,MAAMlpD,QAYtBipD,EAAQ3sD,UAAUytD,cAAgB,SAAU3jD,GACxC,OAAIA,EAAQ,GAAKzG,KAAKupD,MAAMlpD,QAAUoG,EAC3B,KAEJ,IAAI,GAAWzG,KAAKw9B,gBAAgBr8B,MAAgB,IAAVsF,EAAc,EAAIzG,KAAKupD,MAAM9iD,EAAQ,GAAIzG,KAAKupD,MAAM9iD,IAASzG,KAAKwjD,SAOvH8F,EAAQ3sD,UAAU0tD,eAAiB,WAM/B,IALA,IAAI7G,EAASxjD,KAAKwjD,OACdhmB,EAAkBx9B,KAAKw9B,gBACvBynB,EAAOjlD,KAAKupD,MACZe,EAAc,GACdpxC,EAAS,EACJne,EAAI,EAAG2hC,EAAKuoB,EAAK5kD,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAC3C,IAAIuwB,EAAM25B,EAAKlqD,GACX8uD,EAAa,IAAI,GAAWrsB,EAAgBr8B,MAAM+X,EAAQoS,GAAMk4B,GACpE8G,EAAYzpD,KAAKgpD,GACjB3wC,EAASoS,EAEb,OAAOg/B,GAKXhB,EAAQ3sD,UAAUmtD,2BAA6B,WAC3C,GAAI9pD,KAAK0pD,mBAAqB1pD,KAAKikC,cAAe,CAC9C,IAAIzG,EAAkBx9B,KAAKw9B,gBACvByrB,GAAuBzrB,EAAiB,EAAGx9B,KAAKupD,MAAOvpD,KAAKy9B,QAC5Dz9B,KAAK2pD,yBAA2BnsB,GAGhCx9B,KAAK2pD,yBAA2BnsB,EAAgBr8B,QAChDnB,KAAK2pD,yBAAyBtpD,OAASgpD,GAAkBrpD,KAAK2pD,yBAA0B,EAAG3pD,KAAKupD,MAAOvpD,KAAKy9B,SAEhHz9B,KAAK0pD,kBAAoB1pD,KAAKikC,cAElC,OAAOjkC,KAAK2pD,0BAOhBL,EAAQ3sD,UAAUsnD,8BAAgC,SAAUrC,GACxD,IAAImE,EAA4B,GAC5BS,EAAiB,GAErB,OADAT,EAA0B1lD,OAASkmD,GAAcvmD,KAAKw9B,gBAAiB,EAAGx9B,KAAKupD,MAAOvpD,KAAKy9B,OAAQn7B,KAAKsK,KAAKg1C,GAAmBmE,EAA2B,EAAGS,GACvJ,IAAI8C,EAAQvD,EAA2BtC,GAAmB+C,IAOrE8C,EAAQ3sD,UAAUmmD,QAAU,WACxB,OAAOmE,IAQXqC,EAAQ3sD,UAAUomD,iBAAmB,SAAUvmB,GAC3C,OAAOosB,GAA0B5oD,KAAK8pD,6BAA8B,EAAG9pD,KAAKupD,MAAOvpD,KAAKy9B,OAAQjB,IAQpG8sB,EAAQ3sD,UAAUynD,eAAiB,SAAU7nB,EAAa8nB,GACtDrkD,KAAKskD,UAAUD,EAAY9nB,EAAa,GACnCv8B,KAAKw9B,kBACNx9B,KAAKw9B,gBAAkB,IAE3B,IAAIynB,EAAOS,GAAwB1lD,KAAKw9B,gBAAiB,EAAGjB,EAAav8B,KAAKy9B,OAAQz9B,KAAKupD,OAC3FvpD,KAAKw9B,gBAAgBn9B,OAAyB,IAAhB4kD,EAAK5kD,OAAe,EAAI4kD,EAAKA,EAAK5kD,OAAS,GACzEL,KAAK+jC,WAEFulB,EAlRiB,CAmR1B,IACa,MA+BR,SAASiB,GAAW/tB,GACvB,IAAIra,EAAOqa,EAAO,GACdpa,EAAOoa,EAAO,GACdva,EAAOua,EAAO,GACdta,EAAOsa,EAAO,GACdgB,EAAkB,CAClBrb,EACAC,EACAD,EACAD,EACAD,EACAC,EACAD,EACAG,EACAD,EACAC,GAEJ,OAAO,IAAI,GAAQob,EAAiBimB,GAAmB,CACnDjmB,EAAgBn9B,SC/WxB,IAAI,GAAwC,WACxC,IAAId,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAgmD5C,SAASyqD,GAAkB9oC,EAAU+oC,GACjCpV,YAAW,WACP3zB,EAAS+oC,KACV,GAmJA,SAASC,GAAgBC,GAC5B,QAAIA,EAAUC,cAAgBD,EAAUE,eAC/B,GAAiBF,EAAUC,aAAcD,EAAUE,iBAIxDF,EAAUG,mBAAqBH,EAAUI,kBAGzCJ,EAAUK,iBAAmBL,EAAUM,gBAa/C,SAASC,GAAkBpvB,EAAYhoB,EAAMtN,EAAUk4B,EAAYC,GAE/D,IAAIoL,EAAWznC,KAAKyK,KAAK4xB,GACrBqL,EAAW1nC,KAAK8I,KAAKuzB,GACrBwsB,EAAOrvB,EAAW,GAAKiO,EAAWjO,EAAW,GAAKkO,EAClDohB,EAAOtvB,EAAW,GAAKiO,EAAWjO,EAAW,GAAKkO,EAOtD,MAAO,EANPmhB,IAASr3C,EAAK,GAAK,EAAItN,EAAS,IAAMk4B,GAIjBqL,GAHrBqhB,IAAS5kD,EAAS,GAAKsN,EAAK,GAAK,GAAK4qB,IAEtCsL,GAAYA,GAEEohB,EAAOrhB,EAAWohB,EAAOnhB,GAG5B,OA7/CW,SAAU1O,GAKhC,SAAS+vB,EAAKxa,GACV,IAAI/0B,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAIjC8b,EAAM3E,GAIN2E,EAAM8nB,KAIN9nB,EAAM+nB,GACN,IAAIvsB,EAAU,GAAO,GAAIu5B,GAqEzB,OAhEA/0B,EAAMwvC,OAAS,CAAC,EAAG,GAKnBxvC,EAAMyvC,YAAc,GAKpBzvC,EAAM0vC,oBAMN1vC,EAAM2vC,YAAc3N,GAAiBxmC,EAAQ4yB,WAAY,aAKzDpuB,EAAM4vC,cAAgB,CAAC,IAAK,KAK5B5vC,EAAM6vC,cAAgB,KAKtB7vC,EAAM8vC,kBAKN9vC,EAAM+vC,gBAKN/vC,EAAMgwC,YAAc,KAKpBhwC,EAAMiwC,gBAKNjwC,EAAMkwC,cAKNlwC,EAAMmwC,mBAAgB33B,EAClBhd,EAAQye,SACRze,EAAQye,OAAS8oB,GAAmBvnC,EAAQye,OAAQja,EAAM2vC,cAE1Dn0C,EAAQklB,SACRllB,EAAQklB,OAASuiB,GAAeznC,EAAQklB,OAAQ1gB,EAAM2vC,cAE1D3vC,EAAMowC,cAAc50C,GACbwE,EAquCX,OA5zCA,GAAUuvC,EAAM/vB,GA6FhB+vB,EAAK1uD,UAAUuvD,cAAgB,SAAU50C,GAIrC,IACI60C,EA8vCL,SAAoC70C,GACvC,IAAI80C,EACAzmB,EACAC,EAKAC,OAA8BvR,IAApBhd,EAAQuuB,QAAwBvuB,EAAQuuB,QA37CnC,EA47CfC,OAA8BxR,IAApBhd,EAAQwuB,QAAwBxuB,EAAQwuB,QAHjC,GAIjBumB,OAAoC/3B,IAAvBhd,EAAQ+0C,WAA2B/0C,EAAQ+0C,WAHpC,EAIpBC,OAAoCh4B,IAAvBhd,EAAQg1C,YAA2Bh1C,EAAQg1C,WACxDpN,OAAgD5qB,IAAvChd,EAAQi1C,4BACfj1C,EAAQi1C,2BAEVzM,OAA4CxrB,IAA3Bhd,EAAQwoC,gBAA+BxoC,EAAQwoC,eAChE5V,EAAa4T,GAAiBxmC,EAAQ4yB,WAAY,aAClDsiB,EAAatiB,EAAWtD,YACxB6lB,EAAsBn1C,EAAQm1C,oBAC9BjwB,EAASllB,EAAQklB,OAChB8vB,GAAe9vB,IAAU0N,EAAW6Q,aACrC0R,GAAsB,EACtBjwB,EAASgwB,GAEb,QAA4Bl4B,IAAxBhd,EAAQo1C,YAA2B,CACnC,IAAIA,EAAcp1C,EAAQo1C,YAC1B/mB,EAAgB+mB,EAAY7mB,GAC5BD,OAC6BtR,IAAzBo4B,EAAY5mB,GACN4mB,EAAY5mB,GACZ4mB,EAAYA,EAAYrsD,OAAS,GAEvC+rD,EADA90C,EAAQq1C,oBrBjmDb,SAAiCD,EAAavM,EAAYC,EAAeC,GAC5E,OAAO,SAQG3hB,EAAY/f,EAAW7K,EAAMqrC,GACnC,QAAmB7qB,IAAfoK,EAA0B,CAC1B,IAAIiH,EAAgB+mB,EAAY,GAC5B9mB,EAAgB8mB,EAAYA,EAAYrsD,OAAS,GACjDigD,EAAeF,EACbT,GAA6Bha,EAAeya,EAAetsC,EAAMusC,GACjE1a,EAEN,GAAIwZ,EAEA,YAD4B7qB,IAAf6rB,GAA2BA,EAIjCF,GAA2BvhB,EAAY4hB,EAAc1a,GAFjD9F,GAAMpB,EAAYkH,EAAe0a,GAIhD,IAAIsM,EAAStqD,KAAKiG,IAAI+3C,EAAc5hB,GAChCzyB,EAAI3J,KAAKohB,MAAMkW,GAAkB8yB,EAAaE,EAAQjuC,IAC1D,OAAI+tC,EAAYzgD,GAAKq0C,GAAgBr0C,EAAIygD,EAAYrsD,OAAS,EACnDqsD,EAAYzgD,EAAI,GAEpBygD,EAAYzgD,KqBqkDI4gD,CAAwBH,EAAaxN,GAASuN,GAAuBjwB,EAAQsjB,GAG7EI,GAAuBva,EAAeC,EAAesZ,GAASuN,GAAuBjwB,EAAQsjB,OAGvH,CAED,IAIIgN,GAJQN,EAGNlqD,KAAKgG,IAAI61B,GAASquB,GAAapuB,GAAUouB,IADtC,IAAM/S,GAAgB,GAAMN,SAAYjP,EAAW0Q,oBC5pDrC,ID8pD+Bt4C,KAAKmL,IArCvC,EA17CL,GAg+CXs/C,EAAuBD,EACvBxqD,KAAKmL,IAvCW,EAuCYu/C,SAGV14B,KADtBqR,EAAgBruB,EAAQquB,eAEpBE,EAAU,EAGVF,EAAgBmnB,EAAuBxqD,KAAKmL,IAAI4+C,EAAYxmB,QAI1CvR,KADtBsR,EAAgBtuB,EAAQsuB,iBAIZA,OAFgBtR,IAApBhd,EAAQwuB,aACsBxR,IAA1Bhd,EAAQquB,cACQA,EAAgBrjC,KAAKmL,IAAI4+C,EAAYvmB,GAGrCgnB,EAAuBxqD,KAAKmL,IAAI4+C,EAAYvmB,GAIhDinB,GAIxBjnB,EACID,EACIvjC,KAAKohB,MAAMphB,KAAKiiB,IAAIohB,EAAgBC,GAAiBtjC,KAAKiiB,IAAI8nC,IACtEzmB,EAAgBD,EAAgBrjC,KAAKmL,IAAI4+C,EAAYvmB,EAAUD,GAE3DumB,EADA90C,EAAQq1C,oBrBhmDb,SAA2BM,EAAOtnB,EAAeunB,EAAmB/M,EAAYC,EAAeC,GAClG,OAAO,SAQG3hB,EAAY/f,EAAW7K,EAAMqrC,GACnC,QAAmB7qB,IAAfoK,EAA0B,CAC1B,IAAI4hB,EAAeF,EACbT,GAA6Bha,EAAeya,EAAetsC,EAAMusC,GACjE1a,EACFC,OAAsCtR,IAAtB44B,EAAkCA,EAAoB,EAE1E,GAAI/N,EAEA,YAD4B7qB,IAAf6rB,GAA2BA,EAIjCF,GAA2BvhB,EAAY4hB,EAAc1a,GAFjD9F,GAAMpB,EAAYkH,EAAe0a,GAIhD,IACI6M,EAAe7qD,KAAK8qD,KAAK9qD,KAAKiiB,IAAIohB,EAAgB2a,GAAgBh+C,KAAKiiB,IAAI0oC,GAD/D,MAEZ/zC,GAAUyF,GAAa,GAFX,MAE8B,GAC1CiuC,EAAStqD,KAAKiG,IAAI+3C,EAAc5hB,GAChC2uB,EAAkB/qD,KAAKohB,MAAMphB,KAAKiiB,IAAIohB,EAAgBinB,GAAUtqD,KAAKiiB,IAAI0oC,GAAS/zC,GAClFo0C,EAAYhrD,KAAKgG,IAAI6kD,EAAcE,GAEvC,OAAOvtB,GADa6F,EAAgBrjC,KAAKmL,IAAIw/C,EAAOK,GACxB1nB,EAAe0a,KqBmkDpBiN,CAAkBlB,EAAY1mB,EAAeC,EAAesZ,GAASuN,GAAuBjwB,EAAQsjB,GAGpGI,GAAuBva,EAAeC,EAAesZ,GAASuN,GAAuBjwB,EAAQsjB,GAG5H,MAAO,CACH0N,WAAYpB,EACZzmB,cAAeA,EACfC,cAAeA,EACfC,QAASA,EACTwmB,WAAYA,GAr1CmBoB,CAA2Bn2C,GAK1DtX,KAAK0tD,eAAiBvB,EAAyBxmB,cAK/C3lC,KAAK2tD,eAAiBxB,EAAyBvmB,cAK/C5lC,KAAK4tD,YAAczB,EAAyBE,WAK5CrsD,KAAK6tD,aAAev2C,EAAQo1C,YAK5B1sD,KAAK8tD,SAAWx2C,EAAQy2C,QAKxB/tD,KAAKguD,SAAW7B,EAAyBtmB,QACzC,IAAIooB,EA0sCL,SAAgC32C,GACnC,QAAuBgd,IAAnBhd,EAAQklB,OAAsB,CAC9B,IAAI0iB,OAA4C5qB,IAAnChd,EAAQ42C,wBACf52C,EAAQ42C,uBAEd,OAAOlP,GAAa1nC,EAAQklB,OAAQllB,EAAQm1C,oBAAqBvN,GAErE,IAAIhV,EAAa4T,GAAiBxmC,EAAQ4yB,WAAY,aACtD,IAA2B,IAAvB5yB,EAAQg1C,YAAuBpiB,EAAW6Q,WAAY,CACtD,IAAIve,EAAS0N,EAAWtD,YAAYzlC,QAGpC,OAFAq7B,EAAO,IAAM1nB,IACb0nB,EAAO,GAAK1nB,IACLkqC,GAAaxiB,GAAQ,GAAO,GAEvC,OAAO,GAxtCoB2xB,CAAuB72C,GAC1C80C,EAAuBD,EAAyBqB,WAChDY,EA2zCL,SAAkC92C,GAErC,QADgDgd,IAA3Bhd,EAAQ+2C,gBAA+B/2C,EAAQ+2C,eAChD,CAChB,IAAIC,EAAoBh3C,EAAQg3C,kBAChC,YAA0Bh6B,IAAtBg6B,IAAyD,IAAtBA,GpBnqDvCzL,EAAY0L,GAAiBnuB,GAAU,GACpC,SAMGzB,EAAUwgB,GAChB,OAAIA,EACOxgB,OAEMrK,IAAbqK,EACIr8B,KAAK4M,IAAIyvB,IAAakkB,EACf,EAGAlkB,OAIX,KoBkpD2B,IAAtB2vB,EACE,GAE2B,iBAAtBA,GpBnsDM9xD,EoBosDG8xD,EpBnsDzBv+C,EAAS,EAAIzN,KAAKC,GAAM/F,EACrB,SAMGmiC,EAAUwgB,GAChB,OAAIA,EACOxgB,OAEMrK,IAAbqK,EACAA,EAAWr8B,KAAKohB,MAAMib,EAAW5uB,EAAQ,IAAOA,OAIhD,IoBsrDO,GAIX,OAAOwwC,GpB3sDR,IAAuB/jD,EACtBuT,EAwBD,IAA0Bw+C,EACzB1L,EoBoWyB2L,CAAyBl3C,GAKlDtX,KAAKyuD,aAAe,CAChB14B,OAAQk4B,EACRvvB,WAAY0tB,EACZztB,SAAUyvB,GAEdpuD,KAAK0uD,iBAAiCp6B,IAArBhd,EAAQqnB,SAAyBrnB,EAAQqnB,SAAW,GACrE3+B,KAAK2uD,uBAAqCr6B,IAAnBhd,EAAQye,OAAuBze,EAAQye,OAAS,WAC5CzB,IAAvBhd,EAAQonB,WACR1+B,KAAK4uD,cAAct3C,EAAQonB,iBAELpK,IAAjBhd,EAAQzB,MACb7V,KAAK6uD,QAAQv3C,EAAQzB,MAEzB7V,KAAK4kC,cApDY,IAyDjB5kC,KAAK8uD,SAAWx3C,GAEpB7b,OAAOC,eAAe2vD,EAAK1uD,UAAW,UAAW,CAU7Cf,IAAK,WACD,OAAOoE,KAAK8tD,UAEhBrsB,IAAK,SAAUssB,GACX,IAAIgB,EAAa/uD,KAAK8tD,SACtB9tD,KAAK8tD,SAAWC,EAChB,IAAIh4B,EAAS/1B,KAAKq+B,YAClB,GAAItI,EAAQ,CACR,IAAIi5B,EAAajB,GAAW,CAAC,EAAG,EAAG,EAAG,GACtCgB,EAAaA,GAAc,CAAC,EAAG,EAAG,EAAG,GACrC,IAAIrwB,EAAa1+B,KAAKivD,gBAClBC,EAAWxwB,EAAa,GACvBswB,EAAW,GAAKD,EAAW,GAAKA,EAAW,GAAKC,EAAW,IAC5DG,EAAWzwB,EAAa,GACvBswB,EAAW,GAAKD,EAAW,GAAKA,EAAW,GAAKC,EAAW,IAChEhvD,KAAK2uD,kBAAkB,CAAC54B,EAAO,GAAKm5B,EAASn5B,EAAO,GAAKo5B,MAGjExzD,YAAY,EACZs3C,cAAc,IAUlBoY,EAAK1uD,UAAUyyD,mBAAqB,SAAUC,GAC1C,IAAI/3C,EAAU,GAAO,GAAItX,KAAK8uD,UAY9B,YAV2Bx6B,IAAvBhd,EAAQonB,WACRpnB,EAAQonB,WAAa1+B,KAAKivD,gBAG1B33C,EAAQzB,KAAO7V,KAAKsvD,UAGxBh4C,EAAQye,OAAS/1B,KAAKuvD,oBAEtBj4C,EAAQqnB,SAAW3+B,KAAKwvD,cACjB,GAAO,GAAIl4C,EAAS+3C,IAmC/BhE,EAAK1uD,UAAUozB,QAAU,SAAU0/B,GAC3BzvD,KAAK0vD,UAAY1vD,KAAK2vD,gBACtB3vD,KAAK4vD,mBAAmB,GAG5B,IADA,IAAIzpD,EAAO,IAAIxG,MAAMS,UAAUC,QACtBtF,EAAI,EAAGA,EAAIoL,EAAK9F,SAAUtF,EAAG,CAClC,IAAIuc,EAAUlX,UAAUrF,GACpBuc,EAAQye,UACRze,EAAU,GAAO,GAAIA,IACbye,OAAS8oB,GAAmBvnC,EAAQye,OAAQ/1B,KAAK6vD,kBAEzDv4C,EAAQmrC,UACRnrC,EAAU,GAAO,GAAIA,IACbmrC,OAAS5D,GAAmBvnC,EAAQmrC,OAAQziD,KAAK6vD,kBAE7D1pD,EAAKpL,GAAKuc,EAEdtX,KAAK8vD,gBAAgBxvD,MAAMN,KAAMmG,IAKrCklD,EAAK1uD,UAAUmzD,gBAAkB,SAAUL,GACvC,IACI/tC,EADAquC,EAAiB3vD,UAAUC,OAE3B0vD,EAAiB,GACwB,mBAAlC3vD,UAAU2vD,EAAiB,KAClCruC,EAAWthB,UAAU2vD,EAAiB,KACpCA,GAGN,IADA,IAAIh1D,EAAI,EACDA,EAAIg1D,IAAmB/vD,KAAK0vD,UAAW30D,EAAG,CAE7C,IAAIqrC,EAAQhmC,UAAUrF,GAClBqrC,EAAMrQ,QACN/1B,KAAK2uD,kBAAkBvoB,EAAMrQ,aAEdzB,IAAf8R,EAAMvwB,KACN7V,KAAK6uD,QAAQzoB,EAAMvwB,MAEduwB,EAAM1H,YACX1+B,KAAK4uD,cAAcxoB,EAAM1H,iBAENpK,IAAnB8R,EAAMzH,UACN3+B,KAAK0uD,YAAYtoB,EAAMzH,UAG/B,GAAI5jC,IAAMg1D,EAAV,CAWA,IALA,IAAI3kC,EAAQd,KAAKK,MACboL,EAAS/1B,KAAK2rD,cAAcxqD,QAC5Bu9B,EAAa1+B,KAAK4rD,kBAClBjtB,EAAW3+B,KAAK6rD,gBAChBmE,EAAS,GACNj1D,EAAIg1D,IAAkBh1D,EAAG,CAC5B,IAAIuc,EAA2ClX,UAAUrF,GACrD4vD,EAAY,CACZv/B,MAAOA,EACP6kC,UAAU,EACVxN,OAAQnrC,EAAQmrC,OAChB7pC,cAA+B0b,IAArBhd,EAAQsB,SAAyBtB,EAAQsB,SAAW,IAC9DsK,OAAQ5L,EAAQ4L,QAAUw9B,GAC1Bh/B,SAAUA,GAiBd,GAfIpK,EAAQye,SACR40B,EAAUC,aAAe70B,EACzB40B,EAAUE,aAAevzC,EAAQye,OAAO50B,QACxC40B,EAAS40B,EAAUE,mBAEFv2B,IAAjBhd,EAAQzB,MACR80C,EAAUG,iBAAmBpsB,EAC7BisB,EAAUI,iBAAmB/qD,KAAKkwD,qBAAqB54C,EAAQzB,MAC/D6oB,EAAaisB,EAAUI,kBAElBzzC,EAAQonB,aACbisB,EAAUG,iBAAmBpsB,EAC7BisB,EAAUI,iBAAmBzzC,EAAQonB,WACrCA,EAAaisB,EAAUI,uBAEFz2B,IAArBhd,EAAQqnB,SAAwB,CAChCgsB,EAAUK,eAAiBrsB,EAC3B,IAAI9yB,EAAQy0B,GAAOhpB,EAAQqnB,SAAWA,EAAWr8B,KAAKC,GAAI,EAAID,KAAKC,IAAMD,KAAKC,GAC9EooD,EAAUM,eAAiBtsB,EAAW9yB,EACtC8yB,EAAWgsB,EAAUM,eAGrBP,GAAgBC,GAChBA,EAAUsF,UAAW,EAIrB7kC,GAASu/B,EAAU/xC,SAEvBo3C,EAAOnvD,KAAK8pD,GAEhB3qD,KAAKurD,YAAY1qD,KAAKmvD,GACtBhwD,KAAKmwD,QAAQC,GAAoB,GACjCpwD,KAAKqwD,yBArDG3uC,GACA8oC,GAAkB9oC,GAAU,IA2DxC2pC,EAAK1uD,UAAUgzD,aAAe,WAC1B,OAAO3vD,KAAKsrD,OAAO8E,IAAsB,GAO7C/E,EAAK1uD,UAAU2zD,eAAiB,WAC5B,OAAOtwD,KAAKsrD,OAAO8E,IAAwB,GAM/C/E,EAAK1uD,UAAU4zD,iBAAmB,WAE9B,IAAI9N,EADJziD,KAAKmwD,QAAQC,IAAqBpwD,KAAKsrD,OAAO8E,KAE9C,IAAK,IAAIr1D,EAAI,EAAG2hC,EAAK18B,KAAKurD,YAAYlrD,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CACvD,IAAIi1D,EAAShwD,KAAKurD,YAAYxwD,GAI9B,GAHIi1D,EAAO,GAAGtuC,UACV8oC,GAAkBwF,EAAO,GAAGtuC,UAAU,IAErC+gC,EACD,IAAK,IAAIjqC,EAAI,EAAGqtC,EAAKmK,EAAO3vD,OAAQmY,EAAIqtC,IAAMrtC,EAAG,CAC7C,IAAImyC,EAAYqF,EAAOx3C,GACvB,IAAKmyC,EAAUsF,SAAU,CACrBxN,EAASkI,EAAUlI,OACnB,QAKhBziD,KAAKurD,YAAYlrD,OAAS,EAC1BL,KAAKisD,cAAgBxJ,EACrBziD,KAAK8rD,YAAc,KACnB9rD,KAAK+rD,gBAAkB37C,IACvBpQ,KAAKgsD,cAAgB57C,KAKzBi7C,EAAK1uD,UAAU0zD,kBAAoB,WAK/B,QAJiC/7B,IAA7Bt0B,KAAKwrD,sBACLgF,qBAAqBxwD,KAAKwrD,qBAC1BxrD,KAAKwrD,yBAAsBl3B,GAE1Bt0B,KAAK2vD,eAAV,CAKA,IAFA,IAAIhlC,EAAML,KAAKK,MACX8lC,GAAO,EACF11D,EAAIiF,KAAKurD,YAAYlrD,OAAS,EAAGtF,GAAK,IAAKA,EAAG,CAGnD,IAFA,IAAIi1D,EAAShwD,KAAKurD,YAAYxwD,GAC1B21D,GAAiB,EACZl4C,EAAI,EAAGqtC,EAAKmK,EAAO3vD,OAAQmY,EAAIqtC,IAAMrtC,EAAG,CAC7C,IAAImyC,EAAYqF,EAAOx3C,GACvB,IAAImyC,EAAUsF,SAAd,CAGA,IAAIU,EAAUhmC,EAAMggC,EAAUv/B,MAC1BwlC,EAAWjG,EAAU/xC,SAAW,EAAI+3C,EAAUhG,EAAU/xC,SAAW,EACnEg4C,GAAY,GACZjG,EAAUsF,UAAW,EACrBW,EAAW,GAGXF,GAAiB,EAErB,IAAIG,EAAWlG,EAAUznC,OAAO0tC,GAChC,GAAIjG,EAAUC,aAAc,CACxB,IAAI1rB,EAAKyrB,EAAUC,aAAa,GAC5BxrB,EAAKurB,EAAUC,aAAa,GAC5B7pC,EAAK4pC,EAAUE,aAAa,GAC5B7pC,EAAK2pC,EAAUE,aAAa,GAChC7qD,KAAK8rD,YAAcnB,EAAUE,aAC7B,IAAIlnD,EAAIu7B,EAAK2xB,GAAY9vC,EAAKme,GAC1Bt7B,EAAIw7B,EAAKyxB,GAAY7vC,EAAKoe,GAC9Bp/B,KAAK2rD,cAAgB,CAAChoD,EAAGC,GAE7B,GAAI+mD,EAAUG,kBAAoBH,EAAUI,iBAAkB,CAC1D,IAAIrsB,EAA0B,IAAbmyB,EACXlG,EAAUI,iBACVJ,EAAUG,iBACR+F,GACKlG,EAAUI,iBAAmBJ,EAAUG,kBACpD,GAAIH,EAAUlI,OAAQ,CAClB,IAAI3uC,EAAO9T,KAAK8wD,iBAAiB9wD,KAAKwvD,eAClCuB,EAAwB/wD,KAAKyuD,aAAa/vB,WAAWA,EAAY,EAAG5qB,GAAM,GAC9E9T,KAAK2rD,cAAgB3rD,KAAKgxD,oBAAoBD,EAAuBpG,EAAUlI,QAEnFziD,KAAK+rD,gBAAkBpB,EAAUI,iBACjC/qD,KAAK4rD,kBAAoBltB,EACzB1+B,KAAKixD,mBAAkB,GAE3B,QAAiC38B,IAA7Bq2B,EAAUK,qBACmB12B,IAA7Bq2B,EAAUM,eAA8B,CACxC,IAAItsB,EAAwB,IAAbkyB,EACTvwB,GAAOqqB,EAAUM,eAAiB3oD,KAAKC,GAAI,EAAID,KAAKC,IAClDD,KAAKC,GACPooD,EAAUK,eACR6F,GACKlG,EAAUM,eAAiBN,EAAUK,gBAClD,GAAIL,EAAUlI,OAAQ,CAClB,IAAIyO,EAAsBlxD,KAAKyuD,aAAa9vB,SAASA,GAAU,GAC/D3+B,KAAK2rD,cAAgB3rD,KAAKmxD,sBAAsBD,EAAqBvG,EAAUlI,QAEnFziD,KAAKgsD,cAAgBrB,EAAUM,eAC/BjrD,KAAK6rD,gBAAkBltB,EAI3B,GAFA3+B,KAAKixD,mBAAkB,GACvBR,GAAO,GACF9F,EAAUsF,SACX,OAGR,GAAIS,EAAgB,CAChB1wD,KAAKurD,YAAYxwD,GAAK,KACtBiF,KAAKmwD,QAAQC,IAAqB,GAClCpwD,KAAK8rD,YAAc,KACnB9rD,KAAK+rD,gBAAkB37C,IACvBpQ,KAAKgsD,cAAgB57C,IACrB,IAAIsR,EAAWsuC,EAAO,GAAGtuC,SACrBA,GACA8oC,GAAkB9oC,GAAU,IAKxC1hB,KAAKurD,YAAcvrD,KAAKurD,YAAYnpD,OAAOgvD,SACvCX,QAAqCn8B,IAA7Bt0B,KAAKwrD,sBACbxrD,KAAKwrD,oBAAsBhhC,sBAAsBxqB,KAAKqwD,kBAAkB9zD,KAAKyD,UAQrFqrD,EAAK1uD,UAAUw0D,sBAAwB,SAAUxyB,EAAU8jB,GACvD,IAAI1sB,ErDruBQ+F,EAAYjwB,EqDsuBpBwlD,EAAgBrxD,KAAKuvD,oBAMzB,YALsBj7B,IAAlB+8B,IAEA,GADAt7B,EAAS,CAACs7B,EAAc,GAAK5O,EAAO,GAAI4O,EAAc,GAAK5O,EAAO,IACzC9jB,EAAW3+B,KAAKwvD,erDzuBrB3jD,EqD0uBE42C,GrD1uBd3mB,EqD0uBM/F,GrDzuBX,KAAOlqB,EAAM,GACxBiwB,EAAW,KAAOjwB,EAAM,IqD0uBbkqB,GAOXs1B,EAAK1uD,UAAUq0D,oBAAsB,SAAUtyB,EAAY+jB,GACvD,IAAI1sB,EACAs7B,EAAgBrxD,KAAKuvD,oBACrB+B,EAAoBtxD,KAAKivD,qBACP36B,IAAlB+8B,QAAqD/8B,IAAtBg9B,IAK/Bv7B,EAAS,CAJD0sB,EAAO,GACV/jB,GAAc+jB,EAAO,GAAK4O,EAAc,IAAOC,EAC5C7O,EAAO,GACV/jB,GAAc+jB,EAAO,GAAK4O,EAAc,IAAOC,IAGxD,OAAOv7B,GAQXs1B,EAAK1uD,UAAUm0D,iBAAmB,SAAUS,GACxC,IAAIz9C,EAAO9T,KAAK0rD,cAChB,GAAI6F,EAAc,CACd,IAAI78C,EAAIZ,EAAK,GACTxI,EAAIwI,EAAK,GACb,MAAO,CACHxR,KAAK4M,IAAIwF,EAAIpS,KAAKyK,IAAIwkD,IAClBjvD,KAAK4M,IAAI5D,EAAIhJ,KAAK8I,IAAImmD,IAC1BjvD,KAAK4M,IAAIwF,EAAIpS,KAAK8I,IAAImmD,IAClBjvD,KAAK4M,IAAI5D,EAAIhJ,KAAKyK,IAAIwkD,KAI9B,OAAOz9C,GAUfu3C,EAAK1uD,UAAU60D,gBAAkB,SAAUC,GACvCzxD,KAAK0rD,cAAgB/rD,MAAMgC,QAAQ8vD,GAC7BA,EAAStwD,QACT,CAAC,IAAK,KACPnB,KAAK2vD,gBACN3vD,KAAK4vD,mBAAmB,IAShCvE,EAAK1uD,UAAU0hC,UAAY,WACvB,IAAItI,EAAS/1B,KAAKuvD,oBAClB,OAAKx5B,EAGE6oB,GAAiB7oB,EAAQ/1B,KAAK6vD,iBAF1B95B,GAQfs1B,EAAK1uD,UAAU4yD,kBAAoB,WAC/B,OAAsEvvD,KAAKpE,IAAI81D,KAKnFrG,EAAK1uD,UAAUg1D,eAAiB,WAC5B,OAAO3xD,KAAKyuD,cAKhBpD,EAAK1uD,UAAUi1D,uBAAyB,WACpC,OAAO5xD,KAAK8uD,SAASnC,qBAMzBtB,EAAK1uD,UAAUk1D,SAAW,SAAUC,GAChC,YAAkBx9B,IAAdw9B,GACAA,EAAU,GAAK9xD,KAAKsrD,OAAO,GAC3BwG,EAAU,GAAK9xD,KAAKsrD,OAAO,GACpBwG,GAGA9xD,KAAKsrD,OAAOnqD,SAa3BkqD,EAAK1uD,UAAUo1D,gBAAkB,SAAUN,GAEvC,OvBxWD,SAAsBj1B,EAAQ4hB,GACjC,OAAK,GAGEI,GAAgBhiB,EAAQ4hB,EAAkB,IAFtC5hB,EuBsWAw1B,CADMhyD,KAAKiyD,wBAAwBR,GACdzxD,KAAK6vD,kBAOrCxE,EAAK1uD,UAAUs1D,wBAA0B,SAAUR,GAC/C,IAAI39C,EAAO29C,GAAYzxD,KAAKkyD,+BACxBn8B,EAA+D/1B,KAAKuvD,oBACxE7zB,GAAO3F,EAAQ,GACf,IAAI2I,EAAqC1+B,KAAKivD,gBAC9CvzB,QAAsBpH,IAAfoK,EAA0B,GACjC,IAAIC,EAAmC3+B,KAAKwvD,cAE5C,OADA9zB,QAAoBpH,IAAbqK,EAAwB,GACxBF,GAAkB1I,EAAQ2I,EAAYC,EAAU7qB,IAO3Du3C,EAAK1uD,UAAUkqC,iBAAmB,WAC9B,OAAO7mC,KAAK0tD,gBAOhBrC,EAAK1uD,UAAUmqC,iBAAmB,WAC9B,OAAO9mC,KAAK2tD,gBAOhBtC,EAAK1uD,UAAUqqC,WAAa,WACxB,OAA8BhnC,KAAKmyD,qBAAqBnyD,KAAK2tD,iBAOjEtC,EAAK1uD,UAAU6qC,WAAa,SAAU3xB,GAClC7V,KAAKksD,cAAclsD,KAAKovD,mBAAmB,CAAEtpB,QAASjwB,MAO1Dw1C,EAAK1uD,UAAUoqC,WAAa,WACxB,OAA8B/mC,KAAKmyD,qBAAqBnyD,KAAK0tD,iBAOjErC,EAAK1uD,UAAU8qC,WAAa,SAAU5xB,GAClC7V,KAAKksD,cAAclsD,KAAKovD,mBAAmB,CAAEvpB,QAAShwB,MAO1Dw1C,EAAK1uD,UAAUy1D,uBAAyB,SAAUvjC,GAC9C7uB,KAAKksD,cAAclsD,KAAKovD,mBAAmB,CAAEzC,oBAAqB99B,MAOtEw8B,EAAK1uD,UAAUkzD,cAAgB,WAC3B,OAAO7vD,KAAKyrD,aAQhBJ,EAAK1uD,UAAUsyD,cAAgB,WAC3B,OAAwCjvD,KAAKpE,IAAI81D,KAQrDrG,EAAK1uD,UAAU01D,eAAiB,WAC5B,OAAOryD,KAAK6tD,cAUhBxC,EAAK1uD,UAAU21D,uBAAyB,SAAU91B,EAAQi1B,GACtD,OAAOzxD,KAAKuyD,+BAA+BxT,GAAeviB,EAAQx8B,KAAK6vD,iBAAkB4B,IAS7FpG,EAAK1uD,UAAU41D,+BAAiC,SAAU/1B,EAAQi1B,GAC9D,IAAI39C,EAAO29C,GAAYzxD,KAAKkyD,+BACxBnS,EAAc5hB,GAAS3B,GAAU1oB,EAAK,GACtCksC,EAAc5hB,GAAU5B,GAAU1oB,EAAK,GAC3C,OAAOxR,KAAKgG,IAAIy3C,EAAaC,IAQjCqL,EAAK1uD,UAAU61D,8BAAgC,SAAUC,GACrD,IAAIxF,EAAQwF,GAAa,EACrB9sB,EAAgB3lC,KAAK0yD,yBAAyB1yD,KAAK0tD,gBACnD9nB,EAAgB5lC,KAAK2tD,eACrBrlD,EAAMhG,KAAKiiB,IAAIohB,EAAgBC,GAAiBtjC,KAAKiiB,IAAI0oC,GAC7D,OAAO,SAKGjxD,GAEN,OADiB2pC,EAAgBrjC,KAAKmL,IAAIw/C,EAAOjxD,EAAQsM,KAUjE+iD,EAAK1uD,UAAU6yD,YAAc,WACzB,OAA8BxvD,KAAKpE,IAAI81D,KAQ3CrG,EAAK1uD,UAAUg2D,8BAAgC,SAAUF,GACrD,IAAIG,EAAWtwD,KAAKiiB,IAAIkuC,GAAa,GACjC9sB,EAAgB3lC,KAAK0yD,yBAAyB1yD,KAAK0tD,gBACnD9nB,EAAgB5lC,KAAK2tD,eACrBrlD,EAAMhG,KAAKiiB,IAAIohB,EAAgBC,GAAiBgtB,EACpD,OAAO,SAKGl0B,GAEN,OADYp8B,KAAKiiB,IAAIohB,EAAgBjH,GAAck0B,EAAWtqD,IAUtE+iD,EAAK1uD,UAAUu1D,6BAA+B,SAAUX,GACpD,IAAIz9C,EAAO9T,KAAK8wD,iBAAiBS,GAC7BxD,EAAU/tD,KAAK8tD,SAOnB,OANIC,IACAj6C,EAAO,CACHA,EAAK,GAAKi6C,EAAQ,GAAKA,EAAQ,GAC/Bj6C,EAAK,GAAKi6C,EAAQ,GAAKA,EAAQ,KAGhCj6C,GAKXu3C,EAAK1uD,UAAUksC,SAAW,WACtB,IAAIqB,EAAalqC,KAAK6vD,gBAClBnxB,EAAa1+B,KAAKivD,gBAClBtwB,EAAW3+B,KAAKwvD,cAChBz5B,EAA8D/1B,KAAKuvD,oBACnExB,EAAU/tD,KAAK8tD,SACnB,GAAIC,EAAS,CACT,IAAI8E,EAAc7yD,KAAKkyD,+BACvBn8B,EAASm1B,GAAkBn1B,EAAQ/1B,KAAK8wD,mBAAoB,CAAC+B,EAAY,GAAK,EAAI9E,EAAQ,GAAI8E,EAAY,GAAK,EAAI9E,EAAQ,IAAKrvB,EAAYC,GAEhJ,MAAO,CACH5I,OAAQA,EAAO50B,MAAM,GACrB+oC,gBAA2B5V,IAAf4V,EAA2BA,EAAa,KACpDxL,WAAYA,EACZo0B,WAAY9yD,KAAK8rD,YACjBiH,eAAgB/yD,KAAK+rD,gBACrBiH,aAAchzD,KAAKgsD,cACnBrtB,SAAUA,EACV9oB,KAAM7V,KAAKsvD,YAUnBjE,EAAK1uD,UAAU2yD,QAAU,WACrB,IAAIz5C,EACA6oB,EAAa1+B,KAAKivD,gBAItB,YAHmB36B,IAAfoK,IACA7oB,EAAO7V,KAAKmyD,qBAAqBzzB,IAE9B7oB,GAQXw1C,EAAK1uD,UAAUw1D,qBAAuB,SAAUzzB,GAC5C,IACIp2B,EAAK+jD,EADLnzC,EAASlZ,KAAKguD,UAAY,EAE9B,GAAIhuD,KAAK6tD,aAAc,CACnB,IAAIoF,EAAUr5B,GAAkB55B,KAAK6tD,aAAcnvB,EAAY,GAC/DxlB,EAAS+5C,EACT3qD,EAAMtI,KAAK6tD,aAAaoF,GAEpB5G,EADA4G,GAAWjzD,KAAK6tD,aAAaxtD,OAAS,EACzB,EAGAiI,EAAMtI,KAAK6tD,aAAaoF,EAAU,QAInD3qD,EAAMtI,KAAK0tD,eACXrB,EAAarsD,KAAK4tD,YAEtB,OAAO10C,EAAS5W,KAAKiiB,IAAIjc,EAAMo2B,GAAcp8B,KAAKiiB,IAAI8nC,IAQ1DhB,EAAK1uD,UAAUuzD,qBAAuB,SAAUr6C,GAC5C,GAAI7V,KAAK6tD,aAAc,CACnB,GAAI7tD,KAAK6tD,aAAaxtD,QAAU,EAC5B,OAAO,EAEX,IAAI6yD,EAAYpzB,GAAMx9B,KAAKohB,MAAM7N,GAAO,EAAG7V,KAAK6tD,aAAaxtD,OAAS,GAClEgsD,EAAarsD,KAAK6tD,aAAaqF,GAAalzD,KAAK6tD,aAAaqF,EAAY,GAC9E,OAAQlzD,KAAK6tD,aAAaqF,GACtB5wD,KAAKmL,IAAI4+C,EAAYvsB,GAAMjqB,EAAOq9C,EAAW,EAAG,IAGpD,OAAQlzD,KAAK0tD,eAAiBprD,KAAKmL,IAAIzN,KAAK4tD,YAAa/3C,EAAO7V,KAAKguD,WAa7E3C,EAAK1uD,UAAUw2D,IAAM,SAAUC,EAAkBviB,GAE7C,IAAIvF,EAIJ,GAHA5P,GAAO/7B,MAAMgC,QAAQyxD,IAEb,mBADqB,EAAwC,sBACjD,IAChBzzD,MAAMgC,QAAQyxD,GACd13B,IAAQwC,GAAQk1B,GAAmB,IAEnC9nB,EAAW,GADP9O,EAASuiB,GAAeqU,EAAkBpzD,KAAK6vD,uBAGlD,GAAIuD,EAAiBtQ,YAAcmE,GAAqB,CACzD,IAAIzqB,GACJ8O,EAAW,GADP9O,EAASuiB,GAAeqU,EAAiBxsB,YAAa5mC,KAAK6vD,mBAEtD7/C,OAAOhQ,KAAKwvD,cAAenxB,GAAU7B,QAE7C,CACD,IAAI62B,EvBlsBL,GuBosBK/nB,EADA+nB,EACsED,EACjEzkD,QACA8D,UAAU4gD,EAAgBrzD,KAAK6vD,iBAGzBuD,EAGnBpzD,KAAKszD,YAAYhoB,EAAUuF,IAO/Bwa,EAAK1uD,UAAU42D,yBAA2B,SAAUjoB,GAUhD,IATA,IAAI3M,EAAW3+B,KAAKwvD,cAChBzlB,EAAWznC,KAAKyK,IAAI4xB,GACpBqL,EAAW1nC,KAAK8I,KAAKuzB,GACrB60B,EAASloB,EAASuY,qBAClBpmB,EAAS6N,EAAS4Y,YAClBuP,EAAW3+C,IACX4+C,EAAW5+C,IACX6+C,GAAW7+C,IACX8+C,GAAW9+C,IACN/Z,EAAI,EAAG2hC,EAAK82B,EAAOnzD,OAAQtF,EAAI2hC,EAAI3hC,GAAK0iC,EAAQ,CACrD,IAAI0tB,EAAOqI,EAAOz4D,GAAKgvC,EAAWypB,EAAOz4D,EAAI,GAAKivC,EAC9CohB,EAAOoI,EAAOz4D,GAAKivC,EAAWwpB,EAAOz4D,EAAI,GAAKgvC,EAClD0pB,EAAUnxD,KAAKiG,IAAIkrD,EAAStI,GAC5BuI,EAAUpxD,KAAKiG,IAAImrD,EAAStI,GAC5BuI,EAAUrxD,KAAKgG,IAAIqrD,EAASxI,GAC5ByI,EAAUtxD,KAAKgG,IAAIsrD,EAASxI,GAEhC,MAAO,CAACqI,EAASC,EAASC,EAASC,IAMvCvI,EAAK1uD,UAAU22D,YAAc,SAAUhoB,EAAUuF,GAC7C,IAAIv5B,EAAUu5B,GAAe,GACzB/8B,EAAOwD,EAAQxD,KACdA,IACDA,EAAO9T,KAAKkyD,gCAEhB,IAEItsB,EAFAmoB,OAA8Bz5B,IAApBhd,EAAQy2C,QAAwBz2C,EAAQy2C,QAAU,CAAC,EAAG,EAAG,EAAG,GACtEkF,OAA8B3+B,IAApBhd,EAAQ27C,SAAwB37C,EAAQ27C,QAGlDrtB,OAD0BtR,IAA1Bhd,EAAQsuB,cACQtuB,EAAQsuB,mBAECtR,IAApBhd,EAAQwuB,QACG9lC,KAAKkwD,qBAAqB54C,EAAQwuB,SAGlC,EAEpB,IAAI+tB,EAAgB7zD,KAAKuzD,yBAAyBjoB,GAE9C5M,EAAa1+B,KAAKuyD,+BAA+BsB,EAAe,CAChE//C,EAAK,GAAKi6C,EAAQ,GAAKA,EAAQ,GAC/Bj6C,EAAK,GAAKi6C,EAAQ,GAAKA,EAAQ,KAEnCrvB,EAAanlB,MAAMmlB,GACbkH,EACAtjC,KAAKgG,IAAIo2B,EAAYkH,GAC3BlH,EAAa1+B,KAAK0yD,yBAAyBh0B,EAAYu0B,EAAU,EAAI,GAErE,IAAIt0B,EAAW3+B,KAAKwvD,cAChBxlB,EAAW1nC,KAAK8I,IAAIuzB,GACpBoL,EAAWznC,KAAKyK,IAAI4xB,GACpBm1B,EAAYz1B,GAAUw1B,GAC1BC,EAAU,KAAQ/F,EAAQ,GAAKA,EAAQ,IAAM,EAAKrvB,EAClDo1B,EAAU,KAAQ/F,EAAQ,GAAKA,EAAQ,IAAM,EAAKrvB,EAClD,IAAIq1B,EAAUD,EAAU,GAAK/pB,EAAW+pB,EAAU,GAAK9pB,EACnDgqB,EAAUF,EAAU,GAAK/pB,EAAW+pB,EAAU,GAAK9pB,EACnDjU,EAAS/1B,KAAKi0D,qBAAqB,CAACF,EAASC,GAAUt1B,GACvDhd,EAAWpK,EAAQoK,SAAWpK,EAAQoK,SAAWyY,QAC5B7F,IAArBhd,EAAQsB,SACR5Y,KAAK8vD,gBAAgB,CACjBpxB,WAAYA,EACZ3I,OAAQA,EACRnd,SAAUtB,EAAQsB,SAClBsK,OAAQ5L,EAAQ4L,QACjBxB,IAGH1hB,KAAK4rD,kBAAoBltB,EACzB1+B,KAAK2rD,cAAgB51B,EACrB/1B,KAAKixD,mBAAkB,GAAO,GAC9BzG,GAAkB9oC,GAAU,KAUpC2pC,EAAK1uD,UAAUu3D,SAAW,SAAUp4B,EAAYhoB,EAAMtN,GAClDxG,KAAKm0D,iBAAiBtV,GAAmB/iB,EAAY97B,KAAK6vD,iBAAkB/7C,EAAMtN,IAOtF6kD,EAAK1uD,UAAUw3D,iBAAmB,SAAUr4B,EAAYhoB,EAAMtN,GAC1DxG,KAAK2uD,kBAAkBzD,GAAkBpvB,EAAYhoB,EAAMtN,EAAUxG,KAAKivD,gBAAiBjvD,KAAKwvD,iBAUpGnE,EAAK1uD,UAAUy3D,qBAAuB,SAAUr+B,EAAQ2I,EAAYC,EAAU7qB,GAC1E,IAAIugD,EACAtG,EAAU/tD,KAAK8tD,SACnB,GAAIC,GAAWh4B,EAAQ,CACnB,IAAI88B,EAAc7yD,KAAKkyD,8BAA8BvzB,GACjD21B,EAAgBpJ,GAAkBn1B,EAAQjiB,EAAM,CAAC++C,EAAY,GAAK,EAAI9E,EAAQ,GAAI8E,EAAY,GAAK,EAAI9E,EAAQ,IAAKrvB,EAAYC,GACpI01B,EAAc,CACVt+B,EAAO,GAAKu+B,EAAc,GAC1Bv+B,EAAO,GAAKu+B,EAAc,IAGlC,OAAOD,GAKXhJ,EAAK1uD,UAAU+yD,MAAQ,WACnB,QAAS1vD,KAAKuvD,0BAAgDj7B,IAAzBt0B,KAAKivD,iBAO9C5D,EAAK1uD,UAAU43D,aAAe,SAAUC,GACpC,IAAIz+B,EAAS6oB,GAAiB5+C,KAAK2rD,cAAe3rD,KAAK6vD,iBACvD7vD,KAAKy0D,UAAU,CACX1+B,EAAO,GAAKy+B,EAAiB,GAC7Bz+B,EAAO,GAAKy+B,EAAiB,MAOrCnJ,EAAK1uD,UAAU+3D,qBAAuB,SAAUF,GAC5C,IAAIz+B,EAAS/1B,KAAK2rD,cAClB3rD,KAAK2uD,kBAAkB,CACnB54B,EAAO,GAAKy+B,EAAiB,GAC7Bz+B,EAAO,GAAKy+B,EAAiB,MAUrCnJ,EAAK1uD,UAAUg4D,iBAAmB,SAAUlV,EAAOkD,GAC/C,IAAIF,EAASE,GAAc9D,GAAmB8D,EAAY3iD,KAAK6vD,iBAC/D7vD,KAAK40D,yBAAyBnV,EAAOgD,IAQzC4I,EAAK1uD,UAAUi4D,yBAA2B,SAAUnV,EAAOkD,GACvD,IAAIkS,EAAW70D,KAAK2vD,gBAAkB3vD,KAAKswD,iBACvCx8C,EAAO9T,KAAK8wD,iBAAiB9wD,KAAKwvD,eAClCsF,EAAgB90D,KAAKyuD,aAAa/vB,WAAW1+B,KAAK4rD,kBAAoBnM,EAAO,EAAG3rC,EAAM+gD,GACtFlS,IACA3iD,KAAK2rD,cAAgB3rD,KAAKgxD,oBAAoB8D,EAAenS,IAEjE3iD,KAAK4rD,mBAAqBnM,EAC1Bz/C,KAAKixD,qBAST5F,EAAK1uD,UAAUo4D,WAAa,SAAUlpD,EAAO82C,GACzC3iD,KAAK20D,iBAAiBryD,KAAKmL,IAAIzN,KAAK4tD,aAAc/hD,GAAQ82C,IAS9D0I,EAAK1uD,UAAUq4D,eAAiB,SAAUnpD,EAAO82C,GACzCA,IACAA,EAAa9D,GAAmB8D,EAAY3iD,KAAK6vD,kBAErD7vD,KAAKi1D,uBAAuBppD,EAAO82C,IAMvC0I,EAAK1uD,UAAUs4D,uBAAyB,SAAUppD,EAAO82C,GACrD,IAAIkS,EAAW70D,KAAK2vD,gBAAkB3vD,KAAKswD,iBACvC4E,EAAcl1D,KAAKyuD,aAAa9vB,SAAS3+B,KAAK6rD,gBAAkBhgD,EAAOgpD,GACvElS,IACA3iD,KAAK2rD,cAAgB3rD,KAAKmxD,sBAAsB+D,EAAavS,IAEjE3iD,KAAK6rD,iBAAmBhgD,EACxB7L,KAAKixD,qBAQT5F,EAAK1uD,UAAU83D,UAAY,SAAU1+B,GACjC/1B,KAAK2uD,kBAAkB9P,GAAmB9oB,EAAQ/1B,KAAK6vD,mBAM3DxE,EAAK1uD,UAAUgyD,kBAAoB,SAAU54B,GACzC/1B,KAAK2rD,cAAgB51B,EACrB/1B,KAAKixD,qBAOT5F,EAAK1uD,UAAUwzD,QAAU,SAAUgF,EAAMtpD,GAGrC,OAFA7L,KAAKsrD,OAAO6J,IAAStpD,EACrB7L,KAAK+jC,UACE/jC,KAAKsrD,OAAO6J,IAQvB9J,EAAK1uD,UAAUiyD,cAAgB,SAAUlwB,GACrC1+B,KAAK4rD,kBAAoBltB,EACzB1+B,KAAKixD,qBAQT5F,EAAK1uD,UAAU+xD,YAAc,SAAU/vB,GACnC3+B,KAAK6rD,gBAAkBltB,EACvB3+B,KAAKixD,qBAOT5F,EAAK1uD,UAAUkyD,QAAU,SAAUh5C,GAC/B7V,KAAK4uD,cAAc5uD,KAAKkwD,qBAAqBr6C,KAUjDw1C,EAAK1uD,UAAUs0D,kBAAoB,SAAUmE,EAAsBC,GAC/D,IAAIR,EAAW70D,KAAK2vD,gBAAkB3vD,KAAKswD,kBAAoB+E,EAE3DH,EAAcl1D,KAAKyuD,aAAa9vB,SAAS3+B,KAAK6rD,gBAAiBgJ,GAC/D/gD,EAAO9T,KAAK8wD,iBAAiBoE,GAC7BJ,EAAgB90D,KAAKyuD,aAAa/vB,WAAW1+B,KAAK4rD,kBAAmB,EAAG93C,EAAM+gD,GAC9ES,EAAYt1D,KAAKyuD,aAAa14B,OAAO/1B,KAAK2rD,cAAemJ,EAAehhD,EAAM+gD,EAAU70D,KAAKo0D,qBAAqBp0D,KAAK2rD,cAAemJ,EAAeI,EAAaphD,IAClK9T,KAAKpE,IAAI81D,MAA2BwD,GACpCl1D,KAAKyhC,IAAIiwB,GAAuBwD,GAEhCl1D,KAAKpE,IAAI81D,MAA6BoD,GACtC90D,KAAKyhC,IAAIiwB,GAAyBoD,GAEjC90D,KAAKpE,IAAI81D,KACT,GAAO1xD,KAAKpE,IAAI81D,IAAsB4D,IACvCt1D,KAAKyhC,IAAIiwB,GAAqB4D,GAE9Bt1D,KAAK2vD,iBAAmByF,GACxBp1D,KAAKuwD,mBAETvwD,KAAKisD,mBAAgB33B,GAWzB+2B,EAAK1uD,UAAUizD,mBAAqB,SAAU2F,EAAcC,EAAyB7S,GACjF,IAAI/pC,OAA4B0b,IAAjBihC,EAA6BA,EAAe,IACvD52C,EAAY62C,GAA2B,EACvCN,EAAcl1D,KAAKyuD,aAAa9vB,SAAS3+B,KAAK6rD,iBAC9C/3C,EAAO9T,KAAK8wD,iBAAiBoE,GAC7BJ,EAAgB90D,KAAKyuD,aAAa/vB,WAAW1+B,KAAK4rD,kBAAmBjtC,EAAW7K,GAChFwhD,EAAYt1D,KAAKyuD,aAAa14B,OAAO/1B,KAAK2rD,cAAemJ,EAAehhD,GAAM,EAAO9T,KAAKo0D,qBAAqBp0D,KAAK2rD,cAAemJ,EAAeI,EAAaphD,IACnK,GAAiB,IAAb8E,IAAmB5Y,KAAKisD,cAKxB,OAJAjsD,KAAK4rD,kBAAoBkJ,EACzB90D,KAAK6rD,gBAAkBqJ,EACvBl1D,KAAK2rD,cAAgB2J,OACrBt1D,KAAKixD,oBAGT,IAAIxO,EAASE,IAA4B,IAAb/pC,EAAiB5Y,KAAKisD,mBAAgB33B,GAClEt0B,KAAKisD,mBAAgB33B,EACjBt0B,KAAKivD,kBAAoB6F,GACzB90D,KAAKwvD,gBAAkB0F,GACtBl1D,KAAKuvD,qBACL,GAAOvvD,KAAKuvD,oBAAqB+F,KAC9Bt1D,KAAK2vD,gBACL3vD,KAAKuwD,mBAETvwD,KAAK8vD,gBAAgB,CACjBnxB,SAAUu2B,EACVn/B,OAAQu/B,EACR52B,WAAYo2B,EACZl8C,SAAUA,EACVsK,OAAQu9B,GACRgC,OAAQA,MAUpB4I,EAAK1uD,UAAU84D,iBAAmB,WAC9Bz1D,KAAK4vD,mBAAmB,GACxB5vD,KAAKmwD,QAAQC,GAAsB,IAUvC/E,EAAK1uD,UAAU+4D,eAAiB,SAAUH,EAAcC,EAAyB7S,GAC7E,IAAIF,EAASE,GAAc9D,GAAmB8D,EAAY3iD,KAAK6vD,iBAC/D7vD,KAAK21D,uBAAuBJ,EAAcC,EAAyB/S,IASvE4I,EAAK1uD,UAAUg5D,uBAAyB,SAAUJ,EAAcC,EAAyB7S,GACrF3iD,KAAKmwD,QAAQC,IAAuB,GACpCpwD,KAAK4vD,mBAAmB2F,EAAcC,EAAyB7S,IASnE0I,EAAK1uD,UAAUs3D,qBAAuB,SAAUpJ,EAAc+K,GAC1D,IAAI9hD,EAAO9T,KAAK8wD,iBAAiB9wD,KAAKwvD,eACtC,OAAOxvD,KAAKyuD,aAAa14B,OAAO80B,EAAc+K,GAAwB51D,KAAKivD,gBAAiBn7C,IAWhGu3C,EAAK1uD,UAAUk5D,mBAAqB,SAAUC,EAAYC,GACtD,IAAIC,EAAYh2D,KAAKkwD,qBAAqB4F,GAC1C,OAAO91D,KAAKmyD,qBAAqBnyD,KAAK0yD,yBAAyBsD,EAAWD,KAW9E1K,EAAK1uD,UAAU+1D,yBAA2B,SAAU3H,EAAkBgL,GAClE,IAAIp3C,EAAYo3C,GAAiB,EAC7BjiD,EAAO9T,KAAK8wD,iBAAiB9wD,KAAKwvD,eACtC,OAAOxvD,KAAKyuD,aAAa/vB,WAAWqsB,EAAkBpsC,EAAW7K,IAE9Du3C,EA7zCc,CA8zCvB,IE/jDK,SAAS4K,GAAQniD,GACpB,OAAOA,EAAK,GAAK,GAAKA,EAAK,GAAK,EA0B7B,SAASoiD,GAAOpiD,EAAM29C,GACzB,OAAI9xD,MAAMgC,QAAQmS,GACPA,QAGUwgB,IAAbm9B,EACAA,EAAW,CAAC39C,EAAMA,IAGlB29C,EAAS,GAAK39C,EACd29C,EAAS,GAAK39C,GAEX29C,GCnEf,IAAI,GAAwC,WACxC,IAAIlyD,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA43C7B,OAruCmB,SAAUu7B,GAKxC,SAAS66B,EAAa7+C,GAClB,IAAIwE,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAIjC8b,EAAM3E,GAIN2E,EAAM8nB,KAIN9nB,EAAM+nB,GACN,IAAIuyB,EAipCZ,SAA+B9+C,GAI3B,IAAI++C,EAAsB,UACU/hC,IAAhChd,EAAQ++C,sBACRA,EAC2C,iBAAhC/+C,EAAQ++C,oBACT9xD,SAAS+xD,eAAeh/C,EAAQ++C,qBAChC/+C,EAAQ++C,qBAKtB,IASIE,EAUAC,EAWAC,EA9BA1qD,EAAS,GACT2qD,EAAap/C,EAAQs6B,QACoC,mBAA/Bt6B,EAAc,OAAW,UACtBA,EAAc,OACzC,IAAI,GAAW,CAAEs6B,OAAmCt6B,EAAc,SACxEvL,EAAO4qD,IAA0BD,EACjC3qD,EAAO4qD,IAAsBr/C,EAAQ0M,OACrCjY,EAAO4qD,IACHr/C,EAAQs/C,gBAAgB,GAAOt/C,EAAQs/C,KAAO,IAAI,QAE7BtiC,IAArBhd,EAAQi/C,WACJ52D,MAAMgC,QAAQ2V,EAAQi/C,UACtBA,EAAW,IAAI,GAAWj/C,EAAQi/C,SAASp1D,UAG3Cu6B,GAAiE,mBAAhCpkB,EAAgB,SAAU,SAAkB,IAC7Ei/C,EAAsCj/C,EAAgB,gBAIjCgd,IAAzBhd,EAAQk/C,eACJ72D,MAAMgC,QAAQ2V,EAAQk/C,cACtBA,EAAe,IAAI,GAAWl/C,EAAQk/C,aAAar1D,UAGnDu6B,GACI,mBAD6BpkB,EAAoB,aAAU,SAC/C,IAChBk/C,EAA0Cl/C,EAAoB,oBAI7Cgd,IAArBhd,EAAQm/C,SACJ92D,MAAMgC,QAAQ2V,EAAQm/C,UACtBA,EAAW,IAAI,GAAWn/C,EAAQm/C,SAASt1D,UAG3Cu6B,GAAiE,mBAAhCpkB,EAAgB,SAAU,SAAkB,IAC7Em/C,EAAWn/C,EAAQm/C,UAIvBA,EAAW,IAAI,GAEnB,MAAO,CACHF,SAAUA,EACVC,aAAcA,EACdH,oBAAqBA,EACrBI,SAAUA,EACV1qD,OAAQA,GA/sCc8qD,CAAsBv/C,GAE5CwE,EAAMg7C,yBAA2Bh7C,EAAMi7C,mBAAmBx6D,KAAKuf,GAK/DA,EAAMk7C,sBAC0B1iC,IAA5Bhd,EAAQ2/C,gBAAgC3/C,EAAQ2/C,gBAAkB,GAKtEn7C,EAAMo7C,iBACqB5iC,IAAvBhd,EAAQ6/C,WACF7/C,EAAQ6/C,WACRt8B,GAKV/e,EAAMs7C,yBAKNt7C,EAAMu7C,mBAINv7C,EAAMw7C,gBAA8C,WAChDt3D,KAAKq3D,wBAAqB/iC,EAC1Bt0B,KAAKu3D,aAAajtC,KAAKK,QACzBpuB,KAAKuf,GAKPA,EAAM07C,4B5EhLH,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,G4EqLnB17C,EAAM27C,4B5ErLH,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,G4E0LnB37C,EAAM47C,YAAc,EAKpB57C,EAAM67C,YAAc,KAMpB77C,EAAM87C,gBAAkB,KAKxB97C,EAAM+7C,yBAA2B,KAKjC/7C,EAAMg8C,uBAAyB,KAK/Bh8C,EAAMi8C,gCAAkC,KAKxCj8C,EAAMk8C,UAAYzzD,SAASS,cAAc,OACzC8W,EAAMk8C,UAAUtyD,UACZ,eAAiB,iBAAkBpB,OAAS,YAAc,IAC9DwX,EAAMk8C,UAAUzuD,MAAM/C,SAAW,WACjCsV,EAAMk8C,UAAUzuD,MAAM0uD,SAAW,SACjCn8C,EAAMk8C,UAAUzuD,MAAMtG,MAAQ,OAC9B6Y,EAAMk8C,UAAUzuD,MAAMrG,OAAS,OAK/B4Y,EAAMo8C,kBAAoB3zD,SAASS,cAAc,OACjD8W,EAAMo8C,kBAAkB3uD,MAAM/C,SAAW,WACzCsV,EAAMo8C,kBAAkB3uD,MAAMm8B,OAAS,IACvC5pB,EAAMo8C,kBAAkB3uD,MAAMtG,MAAQ,OACtC6Y,EAAMo8C,kBAAkB3uD,MAAMrG,OAAS,OACvC4Y,EAAMo8C,kBAAkB3uD,MAAM4uD,cAAgB,OAC9Cr8C,EAAMo8C,kBAAkBxyD,UAAY,sBACpCoW,EAAMk8C,UAAUl+C,YAAYgC,EAAMo8C,mBAKlCp8C,EAAMs8C,2BAA6B7zD,SAASS,cAAc,OAC1D8W,EAAMs8C,2BAA2B7uD,MAAM/C,SAAW,WAClDsV,EAAMs8C,2BAA2B7uD,MAAMm8B,OAAS,IAChD5pB,EAAMs8C,2BAA2B7uD,MAAMtG,MAAQ,OAC/C6Y,EAAMs8C,2BAA2B7uD,MAAMrG,OAAS,OAChD4Y,EAAMs8C,2BAA2B7uD,MAAM4uD,cAAgB,OACvDr8C,EAAMs8C,2BAA2B1yD,UAAY,gCAC7CoW,EAAMk8C,UAAUl+C,YAAYgC,EAAMs8C,4BAKlCt8C,EAAMu8C,wBAA0B,KAKhCv8C,EAAMu4B,eAAiB/8B,EAAQ08B,cAK/Bl4B,EAAMw8C,qBAAuBlC,EAAgBC,oBAK7Cv6C,EAAMy8C,gBAAkB,KAKxBz8C,EAAMy6C,SAAWH,EAAgBG,UAAY,IAAI,GAKjDz6C,EAAM06C,aAAeJ,EAAgBI,cAAgB,IAAI,GAKzD16C,EAAM08C,UAAYpC,EAAgBK,SAMlC36C,EAAM28C,gBAAkB,GAKxB38C,EAAMwsB,UAAY,KAKlBxsB,EAAM48C,cAKN58C,EAAM68C,qBAAuB,GAK7B78C,EAAM88C,WAAa,IAAI,GAAU98C,EAAM+8C,gBAAgBt8D,KAAKuf,GAAQA,EAAMg9C,kBAAkBv8D,KAAKuf,IACjGA,EAAMqpB,kBAAkBwxB,GAAwB76C,EAAMi9C,0BACtDj9C,EAAMqpB,kBAAkBwxB,GAAkB76C,EAAMk9C,oBAChDl9C,EAAMqpB,kBAAkBwxB,GAAkB76C,EAAMm9C,oBAChDn9C,EAAMqpB,kBAAkBwxB,GAAoB76C,EAAMo9C,sBAGlDp9C,EAAM8oB,cAAcwxB,EAAgBrqD,QACpC,IAAIJ,EAAMmQ,EAuEV,OAtEIxE,EAAQs/C,MAAUt/C,EAAQs/C,gBAAgB,IAC1Ct/C,EAAQs/C,KAAKuC,MAAK,SAAUC,GACxBztD,EAAI0tD,QAAQ,IAAI,GAAKD,OAG7Bt9C,EAAMy6C,SAAS5+C,iBAAiB45B,GAIhC,SAAU95B,GACNA,EAAM7Y,QAAQ4pC,OAAOxoC,OACvBzD,KAAKuf,IACPA,EAAMy6C,SAAS5+C,iBAAiB45B,GAIhC,SAAU95B,GACNA,EAAM7Y,QAAQ4pC,OAAO,OACvBjsC,KAAKuf,IACPA,EAAM06C,aAAa7+C,iBAAiB45B,GAIpC,SAAU95B,GACNA,EAAM7Y,QAAQ4pC,OAAOxoC,OACvBzD,KAAKuf,IACPA,EAAM06C,aAAa7+C,iBAAiB45B,GAIpC,SAAU95B,GACNA,EAAM7Y,QAAQ4pC,OAAO,OACvBjsC,KAAKuf,IACPA,EAAM08C,UAAU7gD,iBAAiB45B,GAIjC,SAAU95B,GACNzX,KAAKs5D,oBAC0C7hD,EAAa,UAC9Dlb,KAAKuf,IACPA,EAAM08C,UAAU7gD,iBAAiB45B,GAIjC,SAAU95B,GACN,IACI6C,EADyD7C,EAAa,QACzD8hD,aACNjlC,IAAPha,UACOta,KAAKy4D,gBAAgBn+C,EAAG9R,YAEnCiP,EAAM7Y,QAAQ4pC,OAAO,OACvBjsC,KAAKuf,IACPA,EAAMy6C,SAAS3sD,QAKf,SAAU4vD,GACNA,EAAQhxB,OAAOxoC,OACjBzD,KAAKuf,IACPA,EAAM06C,aAAa5sD,QAKnB,SAAU6vD,GACNA,EAAYjxB,OAAOxoC,OACrBzD,KAAKuf,IACPA,EAAM08C,UAAU5uD,QAAQkS,EAAMw9C,oBAAoB/8D,KAAKuf,IAChDA,EAk5BX,OA7pCA,GAAUq6C,EAAc76B,GAiRxB66B,EAAax5D,UAAUgtC,eAAiB,WACpC,MAAM,IAAI3rC,MAAM,oDAOpBm4D,EAAax5D,UAAU+8D,WAAa,SAAUF,GAC1Cx5D,KAAK25D,cAAc94D,KAAK24D,IAW5BrD,EAAax5D,UAAUi9D,eAAiB,SAAUH,GAC9Cz5D,KAAK65D,kBAAkBh5D,KAAK44D,IAShCtD,EAAax5D,UAAUm9D,SAAW,SAAUzzB,GAC3BrmC,KAAK+5D,gBAAgB7nB,YAC3BrxC,KAAKwlC,IAOhB8vB,EAAax5D,UAAUq9D,WAAa,SAAUC,GAC1Cj6D,KAAKk6D,cAAcr5D,KAAKo5D,IAO5B9D,EAAax5D,UAAU28D,oBAAsB,SAAUW,GACnD,IAAI3/C,EAAK2/C,EAAQV,aACNjlC,IAAPha,IACAta,KAAKy4D,gBAAgBn+C,EAAG9R,YAAcyxD,GAE1CA,EAAQzxB,OAAOxoC,OAMnBm2D,EAAax5D,UAAU+8B,gBAAkB,WACrC15B,KAAKm6D,UAAU,MACf7+B,EAAO3+B,UAAU+8B,gBAAgBx+B,KAAK8E,OAoB1Cm2D,EAAax5D,UAAUy9D,sBAAwB,SAAUpxB,EAAOtnB,EAAUmvB,GACtE,GAAK7wC,KAAK23D,YAAV,CAGA,IAAI77B,EAAa97B,KAAKq6D,+BAA+BrxB,GAEjDgC,OAA4C1W,KADhDuc,OAA8Bvc,IAAhBuc,EAA4BA,EAAc,IACzB7F,aAA6B6F,EAAY7F,aAAe,EACnFG,OAA0C7W,IAA5Buc,EAAY1F,YAA4B0F,EAAY1F,YAAclR,GAChFgR,GAA4C,IAA7B4F,EAAY5F,aAC/B,OAAOjrC,KAAKsoC,UAAUyC,2BAA2BjP,EAAY97B,KAAK23D,YAAa3sB,EAAcC,EAAcvpB,EAAU,KAAMypB,EAAa,QAU5IgrB,EAAax5D,UAAU29D,mBAAqB,SAAUtxB,EAAO6H,GACzD,IAAI0pB,EAAW,GAIf,OAHAv6D,KAAKo6D,sBAAsBpxB,GAAO,SAAUqC,GACxCkvB,EAAS15D,KAAKwqC,KACfwF,GACI0pB,GAuBXpE,EAAax5D,UAAUsvC,oBAAsB,SAAUjD,EAAOtnB,EAAUmvB,GACpE,GAAK7wC,KAAK23D,YAAV,CAGA,IAAIrgD,EAAUu5B,GAAe,GACzB7F,OAAwC1W,IAAzBhd,EAAQ0zB,aAA6B1zB,EAAQ0zB,aAAe,EAC3EG,EAAc7zB,EAAQ6zB,aAAelR,GACzC,OAAOj6B,KAAKsoC,UAAU2D,oBAAoBjD,EAAOhpC,KAAK23D,YAAa3sB,EAActpB,EAAUypB,KAU/FgrB,EAAax5D,UAAU69D,kBAAoB,SAAUxxB,EAAO6H,GACxD,IAAK7wC,KAAK23D,YACN,OAAO,EAEX,IAAI77B,EAAa97B,KAAKq6D,+BAA+BrxB,GAEjDmC,OAA0C7W,KAD9Cuc,OAA8Bvc,IAAhBuc,EAA4BA,EAAc,IAC1B1F,YAA4B0F,EAAY1F,YAAclR,GAChF+Q,OAA4C1W,IAA7Buc,EAAY7F,aAA6B6F,EAAY7F,aAAe,EACnFC,GAA4C,IAA7B4F,EAAY5F,aAC/B,OAAOjrC,KAAKsoC,UAAU4D,uBAAuBpQ,EAAY97B,KAAK23D,YAAa3sB,EAAcC,EAAcE,EAAa,OAQxHgrB,EAAax5D,UAAU89D,mBAAqB,SAAUhjD,GAClD,OAAOzX,KAAKkzC,uBAAuBlzC,KAAKgzC,cAAcv7B,KAO1D0+C,EAAax5D,UAAU+9D,2BAA6B,SAAUjjD,GAC1D,OAAOzX,KAAKq6D,+BAA+Br6D,KAAKgzC,cAAcv7B,KAQlE0+C,EAAax5D,UAAUq2C,cAAgB,SAAUv7B,GAC7C,IAAIkjD,EAAmB36D,KAAKg4D,UAAUp6C,wBAClCg9C,EAEJ,mBAAoBnjD,EACY,EAAQojD,eAAe,GACvB,EAChC,MAAO,CACHD,EAAc5kB,QAAU2kB,EAAiBnmD,KACzComD,EAAc3kB,QAAU0kB,EAAiBlmD,MAYjD0hD,EAAax5D,UAAUm+D,UAAY,WAC/B,OAAoD96D,KAAKpE,IAAI+6D,KASjER,EAAax5D,UAAUo+D,iBAAmB,WACtC,IAAI/2C,EAAShkB,KAAK86D,YAClB,YAAexmC,IAAXtQ,EACyB,iBAAXA,EACRzf,SAAS+xD,eAAetyC,GACxBA,EAGC,MAUfmyC,EAAax5D,UAAUu2C,uBAAyB,SAAUlK,GACtD,OAAO4V,GAAiB5+C,KAAKq6D,+BAA+BrxB,GAAQhpC,KAAKg7D,UAAUnL,kBAQvFsG,EAAax5D,UAAU09D,+BAAiC,SAAUrxB,GAC9D,IAAIG,EAAanpC,KAAK23D,YACtB,OAAKxuB,EAIM7oC,GAAe6oC,EAAW2B,2BAA4B9B,EAAM7nC,SAH5D,MAYfg1D,EAAax5D,UAAUg9D,YAAc,WACjC,OAAO35D,KAAKu2D,UAQhBJ,EAAax5D,UAAUu9D,YAAc,WACjC,OAAOl6D,KAAKw4D,WAUhBrC,EAAax5D,UAAUs+D,eAAiB,SAAU3gD,GAC9C,IAAI2/C,EAAUj6D,KAAKy4D,gBAAgBn+C,EAAG9R,YACtC,YAAmB8rB,IAAZ2lC,EAAwBA,EAAU,MAU7C9D,EAAax5D,UAAUk9D,gBAAkB,WACrC,OAAO75D,KAAKw2D,cAQhBL,EAAax5D,UAAUo9D,cAAgB,WACnC,OAAkC/5D,KAAKpE,IAAI+6D,KAO/CR,EAAax5D,UAAUq1C,UAAY,SAAUJ,GACzC,IAAI9Z,EAAQ93B,KAAK+5D,gBACjB,GAAInoB,aAAkB,GAClB9Z,EAAMka,UAAUJ,OADpB,CAIA,IAAIspB,EAAapjC,EAAMoa,YACvBgpB,EAAW95C,QACX85C,EAAWn1D,OAAO6rC,KAOtBukB,EAAax5D,UAAUu1C,UAAY,WAE/B,OADalyC,KAAK+5D,gBAAgB7nB,aAMtCikB,EAAax5D,UAAUw+D,WAAa,WAEhC,IADA,IAAI3xB,EAAmBxpC,KAAK+5D,gBAAgB5yB,sBACnCpsC,EAAI,EAAG2hC,EAAK8M,EAAiBnpC,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CACvD,IACI2T,EADQ86B,EAAiBzuC,GAAGsrC,MACuCuC,YACvE,GAAIl6B,GAAUA,EAAO0sD,QACjB,OAAO,EAGf,OAAO,GASXjF,EAAax5D,UAAU0+D,uBAAyB,SAAUv/B,GACtD,IAAIw/B,EAAiBzc,GAAmB/iB,EAAY97B,KAAKg7D,UAAUnL,iBACnE,OAAO7vD,KAAKu7D,+BAA+BD,IAQ/CnF,EAAax5D,UAAU4+D,+BAAiC,SAAUz/B,GAC9D,IAAIqN,EAAanpC,KAAK23D,YACtB,OAAKxuB,EAIM7oC,GAAe6oC,EAAW0B,2BAA4B/O,EAAW36B,MAAM,EAAG,IAH1E,MAUfg1D,EAAax5D,UAAU0sC,YAAc,WACjC,OAAOrpC,KAAKsoC,WAQhB6tB,EAAax5D,UAAU6+D,QAAU,WAC7B,OAA0Dx7D,KAAKpE,IAAI+6D,KASvER,EAAax5D,UAAUq+D,QAAU,WAC7B,OAA4Bh7D,KAAKpE,IAAI+6D,KAOzCR,EAAax5D,UAAUgzC,YAAc,WACjC,OAAO3vC,KAAKg4D,WAShB7B,EAAax5D,UAAU8+D,oBAAsB,WACzC,OAAOz7D,KAAKk4D,mBAShB/B,EAAax5D,UAAU++D,6BAA+B,WAClD,OAAO17D,KAAKo4D,4BAKhBjC,EAAax5D,UAAUi5C,iBAAmB,WACtC,IAAI+lB,EAAgB37D,KAAK+6D,mBACzB,OAAOY,EAAgBA,EAAcC,cAAgBr3D,UASzD4xD,EAAax5D,UAAUk8D,gBAAkB,SAAUngB,EAAMmjB,EAAeC,EAAYC,GAChF,OrC/sBD,SAAyB5yB,EAAYuP,EAAMmjB,EAAeC,EAAYC,GAGzE,IAAK5yB,KAAgB0yB,KAAiB1yB,EAAW6yB,aAC7C,OFlIUlnD,IEoId,IAAKq0B,EAAW6yB,YAAYH,GAAenjB,EAAKlX,UAC5C,OFrIU1sB,IE6Id,IAAIihB,EAASoT,EAAWnB,UAAUjS,OAC9BitB,EAAS8Y,EAAW,GAAK/lC,EAAO,GAChCktB,EAAS6Y,EAAW,GAAK/lC,EAAO,GACpC,OAAQ,MAAQzzB,KAAKiiB,IAAIw3C,GACrBz5D,KAAKsK,KAAKo2C,EAASA,EAASC,EAASA,GAAU8Y,EqC4rBxClD,CAAgB74D,KAAK23D,YAAajf,EAAMmjB,EAAeC,EAAYC,IAM9E5F,EAAax5D,UAAUo6D,mBAAqB,SAAUkF,EAAc94B,GAChE,IAAI5qB,EAAO4qB,GAAY84B,EAAa1jD,KAChC2jD,EAAkB,IAAI,GAAgB3jD,EAAMvY,KAAMi8D,GACtDj8D,KAAKm8D,sBAAsBD,IAK/B/F,EAAax5D,UAAUw/D,sBAAwB,SAAUD,GACrD,GAAKl8D,KAAK23D,YAAV,CAKA,IAAIhlB,EAA6CupB,EAA6B,cAC1Ej3B,EAAY0N,EAAcp6B,KAC9B,GAAI0sB,IAAc,IACdA,IAAcjB,IACdiB,IAAcjB,GAAmB,CACjC,IAAI2R,EAAM31C,KAAK41C,mBACXwmB,EAAWp8D,KAAKg4D,UAAUliB,YACxB91C,KAAKg4D,UAAUliB,cACfH,EACF3xB,EAA8B2uB,EAAoB,OACtD,GAGA3yC,KAAKo4D,2BAA2B/iD,SAAS2O,MAKnCo4C,IAAazmB,EAAMA,EAAIzhC,gBAAkBkoD,GAAU/mD,SAAS2O,GAC9D,OAIR,GADAk4C,EAAgB/yB,WAAanpC,KAAK23D,aACU,IAAxC33D,KAAKqY,cAAc6jD,GAEnB,IADA,IAAIG,EAAoBr8D,KAAK65D,kBAAkBzoB,WAAWjwC,QACjDpG,EAAIshE,EAAkBh8D,OAAS,EAAGtF,GAAK,EAAGA,IAAK,CACpD,IAAI0+D,EAAc4C,EAAkBthE,GACpC,GAAI0+D,EAAYttB,WAAansC,MACxBy5D,EAAY6C,aACZt8D,KAAK+6D,mBAIV,IADWtB,EAAYz2B,YAAYk5B,IACtBA,EAAgBp6B,mBACzB,SAQhBq0B,EAAax5D,UAAU4/D,iBAAmB,WACtC,IAAIpzB,EAAanpC,KAAK23D,YAUlB6E,EAAYx8D,KAAK44D,WACrB,IAAK4D,EAAUt+B,UAAW,CACtB,IAAI4a,EAAkB94C,KAAKg3D,iBACvBje,EAAcD,EAClB,GAAI3P,EAAY,CACZ,IAAIszB,EAAQtzB,EAAWuzB,UACvB,GAAID,EAAMrM,KAAuBqM,EAAMrM,IAAuB,CAC1D,IAAIuM,EAAmBryC,KAAKK,MAAQwe,EAAWze,KAAO,EACtDouB,EAAkB6jB,EAAmB,EAAI,EACzC5jB,EAAc4jB,EAAmB,EAAI,GAGzCH,EAAU/jB,kBAAoBK,IAC9B0jB,EAAUzkB,eACVykB,EAAU3jB,cAAcC,EAAiBC,KAG7C5P,IACAnpC,KAAKshC,YAAY,KAChB6H,EAAWpZ,SACX/vB,KAAK44D,WAAWngB,mBAChBz4C,KAAKm7D,cACNn7D,KAAKsoC,UAAUqC,oBAAoB,GAAgCxB,GAGvE,IADA,IAAIkD,EAAsBrsC,KAAK24D,qBACtB59D,EAAI,EAAG2hC,EAAK2P,EAAoBhsC,OAAQtF,EAAI2hC,IAAM3hC,EACvDsxC,EAAoBtxC,GAAGiF,KAAMmpC,GAEjCkD,EAAoBhsC,OAAS,GAKjC81D,EAAax5D,UAAUs8D,mBAAqB,WACpCj5D,KAAKg7D,YAAch7D,KAAKg7D,UAAUrL,gBAClC3vD,KAAKg7D,UAAUpL,mBAAmB,GAEtC5vD,KAAKuoC,UAKT4tB,EAAax5D,UAAUu8D,qBAAuB,WAK1C,IAAIyC,EAIJ,GAHI37D,KAAK86D,cACLa,EAAgB37D,KAAK+6D,oBAErB/6D,KAAKq4D,wBAAyB,CAC9B,IAAK,IAAIt9D,EAAI,EAAG2hC,EAAK18B,KAAKu4D,gBAAgBl4D,OAAQtF,EAAI2hC,IAAM3hC,EACxD2oC,GAAc1jC,KAAKu4D,gBAAgBx9D,IAEvCiF,KAAKu4D,gBAAkB,KACvBv4D,KAAKg4D,UAAUlgD,oBAAoBksB,GAAuBhkC,KAAK82D,0BAC/D92D,KAAKg4D,UAAUlgD,oBAAoBksB,GAAiBhkC,KAAK82D,+BAC9BxiC,IAAvBt0B,KAAK04D,gBACL5gD,oBAAoBksB,GAAkBhkC,KAAK04D,eAAe,GAC1D14D,KAAK04D,mBAAgBpkC,GAEzBt0B,KAAKq4D,wBAAwB5+B,UAC7Bz5B,KAAKq4D,wBAA0B,KAC/BnqB,GAAWluC,KAAKg4D,WAEpB,GAAK2D,EAaA,CAMD,IAAK,IAAIr/D,KALTq/D,EAAc7hD,YAAY9Z,KAAKg4D,WAC1Bh4D,KAAKsoC,YACNtoC,KAAKsoC,UAAYtoC,KAAK2pC,kBAE1B3pC,KAAKq4D,wBAA0B,IAAI,GAAuBr4D,KAAMA,KAAKq0C,gBACrDc,GACZn1C,KAAKq4D,wBAAwB1gD,iBAAiBw9B,GAAoB74C,GAAM0D,KAAKm8D,sBAAsB5/D,KAAKyD,OAE5GA,KAAKg4D,UAAUrgD,iBAAiBqsB,GAAuBhkC,KAAK82D,0BAA0B,GACtF92D,KAAKg4D,UAAUrgD,iBAAiBqsB,GAAiBhkC,KAAK82D,2BAA0B17B,IAA0B,CAAEC,SAAS,IACrH,IAAIg7B,EAAuBr2D,KAAKs4D,qBAE1Bt4D,KAAKs4D,qBADLqD,EAEN37D,KAAKu4D,gBAAkB,CACnBn1B,GAAOizB,EAAqBryB,GAAmBhkC,KAAK+2D,mBAAoB/2D,MACxEojC,GAAOizB,EAAqBryB,GAAoBhkC,KAAK+2D,mBAAoB/2D,OAExEA,KAAK04D,gBACN14D,KAAK04D,cAAgB14D,KAAK48D,WAAWrgE,KAAKyD,MAC1CsE,OAAOqT,iBAAiBqsB,GAAkBhkC,KAAK04D,eAAe,SAhC9D14D,KAAKsoC,YACL8M,aAAap1C,KAAKo3D,0BAClBp3D,KAAKo3D,8BAA2B9iC,EAChCt0B,KAAK24D,qBAAqBt4D,OAAS,EACnCL,KAAKsoC,UAAU7O,UACfz5B,KAAKsoC,UAAY,MAEjBtoC,KAAKq3D,qBACL7G,qBAAqBxwD,KAAKq3D,oBAC1Br3D,KAAKq3D,wBAAqB/iC,GA0BlCt0B,KAAK48D,cAOTzG,EAAax5D,UAAUm8D,kBAAoB,WACvC94D,KAAKuoC,UAKT4tB,EAAax5D,UAAUkgE,2BAA6B,WAChD78D,KAAKuoC,UAKT4tB,EAAax5D,UAAUq8D,mBAAqB,WACpCh5D,KAAK63D,2BACLn0B,GAAc1jC,KAAK63D,0BACnB73D,KAAK63D,yBAA2B,MAEhC73D,KAAK83D,yBACLp0B,GAAc1jC,KAAK83D,wBACnB93D,KAAK83D,uBAAyB,MAElC,IAAIlB,EAAO52D,KAAKg7D,UACZpE,IACA52D,KAAK88D,sBACL98D,KAAK63D,yBAA2Bz0B,GAAOwzB,EAAM1xB,GAAgCllC,KAAK68D,2BAA4B78D,MAC9GA,KAAK83D,uBAAyB10B,GAAOwzB,EAAM5yB,GAAkBhkC,KAAK68D,2BAA4B78D,MAC9F42D,EAAKhH,mBAAmB,IAE5B5vD,KAAKuoC,UAKT4tB,EAAax5D,UAAUo8D,yBAA2B,WAC1C/4D,KAAK+3D,kCACL/3D,KAAK+3D,gCAAgCnuD,QAAQ85B,IAC7C1jC,KAAK+3D,gCAAkC,MAE3C,IAAIrB,EAAa12D,KAAK+5D,gBAClBrD,IACA12D,KAAK+3D,gCAAkC,CACnC30B,GAAOszB,EAAYxxB,GAAgCllC,KAAKuoC,OAAQvoC,MAChEojC,GAAOszB,EAAY1yB,GAAkBhkC,KAAKuoC,OAAQvoC,QAG1DA,KAAKuoC,UAKT4tB,EAAax5D,UAAUogE,WAAa,WAChC,QAAS/8D,KAAK23D,aAMlBxB,EAAax5D,UAAUqgE,WAAa,WAC5Bh9D,KAAKq3D,oBACL7G,qBAAqBxwD,KAAKq3D,oBAE9Br3D,KAAKs3D,mBAKTnB,EAAax5D,UAAU4yC,WAAa,WAEhC,IADA,IAAI7D,EAAc1rC,KAAK+5D,gBAAgB5yB,sBAC9BpsC,EAAI,EAAG2hC,EAAKgP,EAAYrrC,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CAClD,IAAIsrC,EAAQqF,EAAY3wC,GAAGsrC,MACvBA,EAAMuD,eACNvD,EAAMgD,cAAc4zB,uBAQhC9G,EAAax5D,UAAU4rC,OAAS,WACxBvoC,KAAKsoC,gBAAyChU,IAA5Bt0B,KAAKq3D,qBACvBr3D,KAAKq3D,mBAAqB7sC,sBAAsBxqB,KAAKs3D,mBAU7DnB,EAAax5D,UAAUugE,cAAgB,SAAU1D,GAC7C,OAAOx5D,KAAK25D,cAAc9yD,OAAO2yD,IASrCrD,EAAax5D,UAAUwgE,kBAAoB,SAAU1D,GACjD,OAAOz5D,KAAK65D,kBAAkBhzD,OAAO4yD,IASzCtD,EAAax5D,UAAUygE,YAAc,SAAU/2B,GAE3C,OADarmC,KAAK+5D,gBAAgB7nB,YACpBrrC,OAAOw/B,IASzB8vB,EAAax5D,UAAU0gE,cAAgB,SAAUpD,GAC7C,OAAOj6D,KAAKk6D,cAAcrzD,OAAOozD,IAMrC9D,EAAax5D,UAAU46D,aAAe,SAAU7sC,GAC5C,IzEtkCc8R,EAAQW,EyEskClBrhB,EAAQ9b,KACR8T,EAAO9T,KAAKw7D,UACZ5E,EAAO52D,KAAKg7D,UACZsC,EAAqBt9D,KAAK23D,YAE1BxuB,EAAa,KACjB,QAAa7U,IAATxgB,GAAsBmiD,GAAQniD,IAAS8iD,GAAQA,EAAKlH,QAAS,CAC7D,IAAIgN,EAAY9F,EAAK/E,SAAS7xD,KAAK23D,YAAc33D,KAAK23D,YAAY+E,eAAYpoC,GAC1E0T,EAAY4uB,EAAK/tB,WAoBrB,GAnBAM,EAAa,CACTpZ,SAAS,EACT8a,2BAA4B7qC,KAAKw3D,4BACjC+F,cAAe,KACf/gC,OAAQiC,GAAkBuJ,EAAUjS,OAAQiS,EAAUtJ,WAAYsJ,EAAUrJ,SAAU7qB,GACtFrN,MAAOzG,KAAK03D,cACZznB,WAAY,EACZzG,iBAAkBxpC,KAAK+5D,gBAAgB5yB,sBACvCgwB,WAAYn3D,KAAKk3D,YACjBpsB,2BAA4B9qC,KAAKy3D,4BACjCprB,oBAAqB,GACrBv4B,KAAMA,EACN0oD,UAAWx8D,KAAK44D,WAChBluC,KAAMA,EACN8yC,UAAW,GACXx1B,UAAWA,EACX00B,UAAWA,EACXV,YAAa,IAEbh0B,EAAU8qB,YAAc9qB,EAAU+qB,eAAgB,CAClD,IAAIp0B,EAAWplB,MAAMyuB,EAAUgrB,cACzBhrB,EAAUrJ,SACVqJ,EAAUgrB,aAChB7pB,EAAWs0B,WAAah/B,GAAkBuJ,EAAU8qB,WAAY9qB,EAAU+qB,eAAgBp0B,EAAU7qB,IAK5G,GAFA9T,KAAK23D,YAAcxuB,EACnBnpC,KAAKsoC,UAAUiB,YAAYJ,GACvBA,EAAY,CAKZ,GAJIA,EAAWpZ,SACX/vB,KAAKuoC,SAET5oC,MAAMhD,UAAUkE,KAAKP,MAAMN,KAAK24D,qBAAsBxvB,EAAWkD,qBAC7DixB,IACiBt9D,KAAK43D,kBAChB15B,GAAQl+B,KAAK43D,mBACV,GAAOzuB,EAAW3M,OAAQx8B,KAAK43D,oBAEpC53D,KAAKqY,cAAc,IAAI,GAASqlD,GAAwB19D,KAAMs9D,IAC9Dt9D,KAAK43D,gBAAkBx6B,GAAoBp9B,KAAK43D,kBAG7C53D,KAAK43D,kBACXzuB,EAAWuzB,UAAUtM,MACrBjnB,EAAWuzB,UAAUtM,MACrB,GAAOjnB,EAAW3M,OAAQx8B,KAAK43D,mBAEhC53D,KAAKqY,cAAc,IAAI,GAASqlD,GAAsB19D,KAAMmpC,IzE9nCtD3M,EyE+nCA2M,EAAW3M,QzE/nCHW,EyE+nCWn9B,KAAK43D,kBzE7nCtCz6B,EAAW,GAAKX,EAAO,GACvBW,EAAW,GAAKX,EAAO,GACvBW,EAAW,GAAKX,EAAO,GACvBW,EAAW,GAAKX,EAAO,IAIhBA,EAAOr7B,SyEynCdnB,KAAKqY,cAAc,IAAI,GAASqlD,GAAyB19D,KAAMmpC,IAC1DnpC,KAAKo3D,2BACNp3D,KAAKo3D,yBAA2B/hB,YAAW,WACvCv5B,EAAMs7C,8BAA2B9iC,EACjCxY,EAAMygD,qBACP,KASXpG,EAAax5D,UAAUghE,cAAgB,SAAUjH,GAC7C12D,KAAKyhC,IAAIk1B,GAAwBD,IAQrCP,EAAax5D,UAAU+kC,QAAU,SAAU5tB,GACvC9T,KAAKyhC,IAAIk1B,GAAkB7iD,IAS/BqiD,EAAax5D,UAAUw9D,UAAY,SAAUn2C,GACzChkB,KAAKyhC,IAAIk1B,GAAoB3yC,IAWjCmyC,EAAax5D,UAAU08D,QAAU,SAAUzC,GACvC,IAAKA,GAAQA,aAAgB,GACzB52D,KAAKyhC,IAAIk1B,GAAkBC,OAD/B,CAIA52D,KAAKyhC,IAAIk1B,GAAkB,IAAI,IAC/B,IAAIhrD,EAAM3L,KACV42D,EAAKuC,MAAK,SAAUC,GAChBztD,EAAI0tD,QAAQ,IAAI,GAAKD,SAQ7BjD,EAAax5D,UAAUigE,WAAa,WAChC,IAAIjB,EAAgB37D,KAAK+6D,mBACrBjnD,OAAOwgB,EACX,GAAIqnC,EAAe,CACf,IAAIiC,EAAgBnnC,iBAAiBklC,GACjC14D,EAAQ04D,EAAckC,YACtBrrD,WAAWorD,EAA+B,iBAC1CprD,WAAWorD,EAA2B,aACtCprD,WAAWorD,EAA4B,cACvCprD,WAAWorD,EAAgC,kBAC3C16D,EAASy4D,EAAcmC,aACvBtrD,WAAWorD,EAA8B,gBACzCprD,WAAWorD,EAA0B,YACrCprD,WAAWorD,EAA6B,eACxCprD,WAAWorD,EAAiC,mBAC3CrkD,MAAMtW,IAAWsW,MAAMrW,KAEnB+yD,GADLniD,EAAO,CAAC7Q,EAAOC,MAERy4D,EAAckC,aACblC,EAAcmC,cACdnC,EAAcoC,iBAAiB19D,QAM/CL,KAAK0hC,QAAQ5tB,GACb9T,KAAK88D,uBAMT3G,EAAax5D,UAAUmgE,oBAAsB,WACzC,IAAIlG,EAAO52D,KAAKg7D,UAChB,GAAIpE,EAAM,CACN,IAAI9iD,OAAOwgB,EACPspC,EAAgBnnC,iBAAiBz2B,KAAKg4D,WACtC4F,EAAc36D,OAAS26D,EAAc16D,SACrC4Q,EAAO,CACHzH,SAASuxD,EAAc36D,MAAO,IAC9BoJ,SAASuxD,EAAc16D,OAAQ,MAGvC0zD,EAAKpF,gBAAgB19C,KAGtBqiD,EA9pCsB,CA+pC/B,ICtzCE,GAAwC,WACxC,IAAI52D,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAgK7B,GAtGc,SAAUu7B,GAKnC,SAAS0iC,EAAQ1mD,GACb,IAAIwE,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAC7BpB,EAAU0Y,EAAQ1Y,QA8BtB,OA7BIA,GAAY0Y,EAAQ0M,QAAWplB,EAAQ2K,MAAM4uD,gBAC7Cv5D,EAAQ2K,MAAM4uD,cAAgB,QAMlCr8C,EAAMld,QAAUA,GAAoB,KAKpCkd,EAAMmiD,QAAU,KAKhBniD,EAAM4uB,KAAO,KAKb5uB,EAAMoiD,aAAe,GACjB5mD,EAAQixB,SACRzsB,EAAMysB,OAASjxB,EAAQixB,QAEvBjxB,EAAQ0M,QACRlI,EAAMq+C,UAAU7iD,EAAQ0M,QAErBlI,EA+DX,OAnGA,GAAUkiD,EAAS1iC,GAyCnB0iC,EAAQrhE,UAAU+8B,gBAAkB,WAChCwU,GAAWluC,KAAKpB,SAChB08B,EAAO3+B,UAAU+8B,gBAAgBx+B,KAAK8E,OAO1Cg+D,EAAQrhE,UAAUwvC,OAAS,WACvB,OAAOnsC,KAAK0qC,MAShBszB,EAAQrhE,UAAU6rC,OAAS,SAAU78B,GAC7B3L,KAAK0qC,MACLwD,GAAWluC,KAAKpB,SAEpB,IAAK,IAAI7D,EAAI,EAAG2hC,EAAK18B,KAAKk+D,aAAa79D,OAAQtF,EAAI2hC,IAAM3hC,EACrD2oC,GAAc1jC,KAAKk+D,aAAanjE,KAEpCiF,KAAKk+D,aAAa79D,OAAS,EAC3BL,KAAK0qC,KAAO/+B,EACR3L,KAAK0qC,SACQ1qC,KAAKi+D,QACZj+D,KAAKi+D,QACLtyD,EAAI+vD,gCACH5hD,YAAY9Z,KAAKpB,SACpBoB,KAAKuoC,SAAWpO,IAChBn6B,KAAKk+D,aAAar9D,KAAKuiC,GAAOz3B,EAAK+xD,GAAyB19D,KAAKuoC,OAAQvoC,OAE7E2L,EAAI48B,WAQZy1B,EAAQrhE,UAAU4rC,OAAS,SAAU41B,KAUrCH,EAAQrhE,UAAUw9D,UAAY,SAAUn2C,GACpChkB,KAAKi+D,QACiB,iBAAXj6C,EAAsBzf,SAAS+xD,eAAetyC,GAAUA,GAEhEg6C,EApGiB,CAqG1B,IC/JE,GAAwC,WACxC,IAAIz+D,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAkV7B,GAvRkB,SAAUu7B,GAKvC,SAAS8iC,EAAYvtB,GACjB,IAAI/0B,EAAQ9b,KACRsX,EAAUu5B,GAA4B,IAC1C/0B,EAAQwf,EAAOpgC,KAAK8E,KAAM,CACtBpB,QAAS2F,SAASS,cAAc,OAChCujC,OAAQjxB,EAAQixB,OAChBvkB,OAAQ1M,EAAQ0M,UACdhkB,MAKAq+D,WAAa95D,SAASS,cAAc,MAK1C8W,EAAMwiD,gBACoBhqC,IAAtBhd,EAAQinD,WAA0BjnD,EAAQinD,UAK9CziD,EAAM0iD,eAAiB1iD,EAAMwiD,WAK7BxiD,EAAM2iD,0BAA+CnqC,IAAxBhd,EAAQonD,YAKrC5iD,EAAM6iD,kBACsBrqC,IAAxBhd,EAAQonD,aAA4BpnD,EAAQonD,YAC3C5iD,EAAM6iD,eACP7iD,EAAMwiD,YAAa,GAEvB,IAAI54D,OAAkC4uB,IAAtBhd,EAAQ5R,UAA0B4R,EAAQ5R,UAAY,iBAClEk5D,OAAgCtqC,IAArBhd,EAAQsnD,SAAyBtnD,EAAQsnD,SAAW,eAC/DC,OAA8CvqC,IAA5Bhd,EAAQunD,gBACxBvnD,EAAQunD,gBACRn5D,EAAY,UACdo5D,OAA0CxqC,IAA1Bhd,EAAQwnD,cAA8BxnD,EAAQwnD,cAAgB,IAC9EC,OAAkDzqC,IAA9Bhd,EAAQynD,kBAC1BznD,EAAQynD,kBACRr5D,EAAY,YACW,iBAAlBo5D,GAKPhjD,EAAMkjD,eAAiBz6D,SAASS,cAAc,QAC9C8W,EAAMkjD,eAAetjD,YAAcojD,EACnChjD,EAAMkjD,eAAet5D,UAAYq5D,GAGjCjjD,EAAMkjD,eAAiBF,EAE3B,IAAIG,OAA0B3qC,IAAlBhd,EAAQ2nD,MAAsB3nD,EAAQ2nD,MAAQ,IACrC,iBAAVA,GAKPnjD,EAAMojD,OAAS36D,SAASS,cAAc,QACtC8W,EAAMojD,OAAOxjD,YAAcujD,EAC3BnjD,EAAMojD,OAAOx5D,UAAYm5D,GAGzB/iD,EAAMojD,OAASD,EAEnB,IAAIE,EAAcrjD,EAAM6iD,eAAiB7iD,EAAMwiD,WAAaxiD,EAAMkjD,eAAiBljD,EAAMojD,OAKzFpjD,EAAMsjD,cAAgB76D,SAASS,cAAc,UAC7C8W,EAAMsjD,cAActiD,aAAa,OAAQ,UACzChB,EAAMsjD,cAActiD,aAAa,gBAAiBhd,QAAQgc,EAAMwiD,aAChExiD,EAAMsjD,cAAcC,MAAQT,EAC5B9iD,EAAMsjD,cAActlD,YAAYqlD,GAChCrjD,EAAMsjD,cAAcznD,iBAAiBqsB,GAAiBloB,EAAMwjD,aAAa/iE,KAAKuf,IAAQ,GACtF,IAAIyjD,EAAa75D,iCAKZoW,EAAMwiD,YAAcxiD,EAAM6iD,aAAe,gBAAwB,KACjE7iD,EAAM6iD,aAAe,GAAK,qBAC3B//D,EAAUkd,EAAMld,QAepB,OAdAA,EAAQ8G,UAAY65D,EACpB3gE,EAAQkb,YAAYgC,EAAMsjD,eAC1BxgE,EAAQkb,YAAYgC,EAAMuiD,YAM1BviD,EAAM0jD,sBAAwB,GAK9B1jD,EAAM+zB,kBAAmB,EAClB/zB,EAuKX,OApRA,GAAUsiD,EAAa9iC,GAqHvB8iC,EAAYzhE,UAAU8iE,2BAA6B,SAAUt2B,GAazD,IARA,IAAIu2B,EAAS,GAKTC,EAAsB,GACtBjB,GAAc,EACdl1B,EAAmBL,EAAWK,iBACzBzuC,EAAI,EAAG2hC,EAAK8M,EAAiBnpC,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CACvD,IAAIgtC,EAAayB,EAAiBzuC,GAClC,GAAK+sC,GAAOC,EAAYoB,EAAWnB,WAAnC,CAGA,IAAIt5B,EAA6Dq5B,EAAgB,MAAEa,YACnF,GAAKl6B,EAAL,CAGA,IAAIkxD,EAAoBlxD,EAAOmxD,kBAC/B,GAAKD,EAAL,CAGA,IAAIE,EAAeF,EAAkBz2B,GACrC,GAAK22B,EAKL,GAFApB,EACIA,IAAuD,IAAxChwD,EAAOqxD,6BACtBpgE,MAAMgC,QAAQm+D,GACd,IAAK,IAAItnD,EAAI,EAAGqtC,EAAKia,EAAaz/D,OAAQmY,EAAIqtC,IAAMrtC,EAC1CsnD,EAAatnD,KAAMknD,IACrBC,EAAoB9+D,KAAKi/D,EAAatnD,IACtCknD,EAAOI,EAAatnD,KAAM,QAK5BsnD,KAAgBJ,IAClBC,EAAoB9+D,KAAKi/D,GACzBJ,EAAOI,IAAgB,MAOnC,OAHK9/D,KAAKy+D,sBACNz+D,KAAKggE,eAAetB,GAEjBiB,GAMXvB,EAAYzhE,UAAUsjE,eAAiB,SAAU92B,GAC7C,GAAKA,EAAL,CAOA,IAAI22B,EAAe9/D,KAAKy/D,2BAA2Bt2B,GAC/Cl/B,EAAU61D,EAAaz/D,OAAS,EAKpC,GAJIL,KAAK6vC,kBAAoB5lC,IACzBjK,KAAKpB,QAAQ2K,MAAMgnC,QAAUtmC,EAAU,GAAK,OAC5CjK,KAAK6vC,iBAAmB5lC,IAExB4vB,GAAOimC,EAAc9/D,KAAKw/D,uBAA9B,EtDtKD,SAAwBzgE,GAC3B,KAAOA,EAAKmb,WACRnb,EAAKoG,YAAYpG,EAAKmb,WsDuKtBgmD,CAAelgE,KAAKq+D,YAEpB,IAAK,IAAItjE,EAAI,EAAG2hC,EAAKojC,EAAaz/D,OAAQtF,EAAI2hC,IAAM3hC,EAAG,CACnD,IAAI6D,EAAU2F,SAASS,cAAc,MACrCpG,EAAQqG,UAAY66D,EAAa/kE,GACjCiF,KAAKq+D,WAAWvkD,YAAYlb,GAEhCoB,KAAKw/D,sBAAwBM,QAtBrB9/D,KAAK6vC,mBACL7vC,KAAKpB,QAAQ2K,MAAMgnC,QAAU,OAC7BvwC,KAAK6vC,kBAAmB,IA0BpCuuB,EAAYzhE,UAAU2iE,aAAe,SAAU7nD,GAC3CA,EAAMsqB,iBACN/hC,KAAKmgE,gBACLngE,KAAKw+D,eAAiBx+D,KAAKs+D,YAK/BF,EAAYzhE,UAAUwjE,cAAgB,WAClCngE,KAAKpB,QAAQwhE,UAAUC,OvDzNF,gBuD0NjBrgE,KAAKs+D,WACLvwB,GAAY/tC,KAAKg/D,eAAgBh/D,KAAKk/D,QAGtCnxB,GAAY/tC,KAAKk/D,OAAQl/D,KAAKg/D,gBAElCh/D,KAAKs+D,YAAct+D,KAAKs+D,WACxBt+D,KAAKo/D,cAActiD,aAAa,gBAAiBhd,QAAQE,KAAKs+D,cAOlEF,EAAYzhE,UAAU2jE,eAAiB,WACnC,OAAOtgE,KAAK2+D,cAOhBP,EAAYzhE,UAAUqjE,eAAiB,SAAUtB,GACzC1+D,KAAK2+D,eAAiBD,IAG1B1+D,KAAK2+D,aAAeD,EACpB1+D,KAAKpB,QAAQwhE,UAAUC,OAAO,oBAC1BrgE,KAAKw+D,gBACLx+D,KAAKmgE,kBAUb/B,EAAYzhE,UAAU4jE,aAAe,SAAUhC,GAC3Cv+D,KAAKw+D,eAAiBD,EACjBv+D,KAAK2+D,cAAgB3+D,KAAKs+D,aAAeC,GAG9Cv+D,KAAKmgE,iBAQT/B,EAAYzhE,UAAU6jE,aAAe,WACjC,OAAOxgE,KAAKs+D,YAOhBF,EAAYzhE,UAAU4rC,OAAS,SAAU41B,GACrCn+D,KAAKigE,eAAe9B,EAASh1B,aAE1Bi1B,EArRqB,CAsR9B,ICjVE,GAAwC,WACxC,IAAI7+D,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAgL7B,GAlIa,SAAUu7B,GAKlC,SAASmlC,EAAO5vB,GACZ,IAAI/0B,EAAQ9b,KACRsX,EAAUu5B,GAA4B,GAC1C/0B,EAAQwf,EAAOpgC,KAAK8E,KAAM,CACtBpB,QAAS2F,SAASS,cAAc,OAChCujC,OAAQjxB,EAAQixB,OAChBvkB,OAAQ1M,EAAQ0M,UACdhkB,KACN,IAAI0F,OAAkC4uB,IAAtBhd,EAAQ5R,UAA0B4R,EAAQ5R,UAAY,YAClEu5D,OAA0B3qC,IAAlBhd,EAAQ2nD,MAAsB3nD,EAAQ2nD,MAAQ,IACtDyB,OAAgDpsC,IAA7Bhd,EAAQopD,iBACzBppD,EAAQopD,iBACR,aAKN5kD,EAAMojD,OAAS,KACM,iBAAVD,GACPnjD,EAAMojD,OAAS36D,SAASS,cAAc,QACtC8W,EAAMojD,OAAOx5D,UAAYg7D,EACzB5kD,EAAMojD,OAAOxjD,YAAcujD,IAG3BnjD,EAAMojD,OAASD,EACfnjD,EAAMojD,OAAOkB,UAAUx5D,IAAI85D,IAE/B,IAAI9B,EAAWtnD,EAAQsnD,SAAWtnD,EAAQsnD,SAAW,iBACjDlpB,EAASnxC,SAASS,cAAc,UACpC0wC,EAAOhwC,UAAYA,EAAY,SAC/BgwC,EAAO54B,aAAa,OAAQ,UAC5B44B,EAAO2pB,MAAQT,EACflpB,EAAO57B,YAAYgC,EAAMojD,QACzBxpB,EAAO/9B,iBAAiBqsB,GAAiBloB,EAAMwjD,aAAa/iE,KAAKuf,IAAQ,GACzE,IAAIyjD,EAAa75D,gCACb9G,EAAUkd,EAAMld,QAsBpB,OArBAA,EAAQ8G,UAAY65D,EACpB3gE,EAAQkb,YAAY47B,GACpB55B,EAAM6kD,gBAAkBrpD,EAAQspD,WAAatpD,EAAQspD,gBAAatsC,EAKlExY,EAAM+kD,eAAiCvsC,IAArBhd,EAAQsB,SAAyBtB,EAAQsB,SAAW,IAKtEkD,EAAMglD,eAAiCxsC,IAArBhd,EAAQypD,UAAyBzpD,EAAQypD,SAK3DjlD,EAAMklD,eAAY1sC,EACdxY,EAAMglD,WACNhlD,EAAMld,QAAQwhE,UAAUx5D,IxDvFV,awDyFXkV,EAkEX,OA/HA,GAAU2kD,EAAQnlC,GAmElBmlC,EAAO9jE,UAAU2iE,aAAe,SAAU7nD,GACtCA,EAAMsqB,sBACuBzN,IAAzBt0B,KAAK2gE,gBACL3gE,KAAK2gE,kBAGL3gE,KAAKihE,eAMbR,EAAO9jE,UAAUskE,YAAc,WAC3B,IACIrK,EADM52D,KAAKmsC,SACA6uB,UACf,GAAKpE,EAAL,CAKA,IAAIj4B,EAAWi4B,EAAKpH,mBACHl7B,IAAbqK,IACI3+B,KAAK6gE,UAAY,GAAKliC,GAAY,EAAIr8B,KAAKC,KAAQ,EACnDq0D,EAAK7mC,QAAQ,CACT4O,SAAU,EACV/lB,SAAU5Y,KAAK6gE,UACf39C,OAAQu9B,KAIZmW,EAAKlI,YAAY,MAS7B+R,EAAO9jE,UAAU4rC,OAAS,SAAU41B,GAChC,IAAIh1B,EAAag1B,EAASh1B,WAC1B,GAAKA,EAAL,CAGA,IAAIxK,EAAWwK,EAAWnB,UAAUrJ,SACpC,GAAIA,GAAY3+B,KAAKghE,UAAW,CAC5B,IAAIvuD,EAAY,UAAYksB,EAAW,OACvC,GAAI3+B,KAAK8gE,UAAW,CAChB,IAAIzrD,EAAWrV,KAAKpB,QAAQwhE,UAAU/qD,SxD/I5B,awDgJLA,GAAyB,IAAbspB,EAGRtpB,GAAyB,IAAbspB,GACjB3+B,KAAKpB,QAAQwhE,UAAUv5D,OxDpJjB,awDiJN7G,KAAKpB,QAAQwhE,UAAUx5D,IxDjJjB,awDuJd5G,KAAKk/D,OAAO31D,MAAMkJ,UAAYA,EAElCzS,KAAKghE,UAAYriC,IAEd8hC,EAhIgB,CAiIzB,IC/KE,GAAwC,WACxC,IAAIlhE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA6I7B,GA/FW,SAAUu7B,GAKhC,SAAS4lC,EAAKrwB,GACV,IAAI/0B,EAAQ9b,KACRsX,EAAUu5B,GAA4B,GAC1C/0B,EAAQwf,EAAOpgC,KAAK8E,KAAM,CACtBpB,QAAS2F,SAASS,cAAc,OAChCgf,OAAQ1M,EAAQ0M,UACdhkB,KACN,IAAI0F,OAAkC4uB,IAAtBhd,EAAQ5R,UAA0B4R,EAAQ5R,UAAY,UAClEmG,OAA0ByoB,IAAlBhd,EAAQzL,MAAsByL,EAAQzL,MAAQ,EACtDs1D,OAA8C7sC,IAA5Bhd,EAAQ6pD,gBACxB7pD,EAAQ6pD,gBACRz7D,EAAY,MACd07D,OAAgD9sC,IAA7Bhd,EAAQ8pD,iBACzB9pD,EAAQ8pD,iBACR17D,EAAY,OACd27D,OAAsC/sC,IAAxBhd,EAAQ+pD,YAA4B/pD,EAAQ+pD,YAAc,IACxEC,OAAwChtC,IAAzBhd,EAAQgqD,aAA6BhqD,EAAQgqD,aAAe,IAC3EC,OAA4CjtC,IAA3Bhd,EAAQiqD,eAA+BjqD,EAAQiqD,eAAiB,UACjFC,OAA8CltC,IAA5Bhd,EAAQkqD,gBACxBlqD,EAAQkqD,gBACR,WACFC,EAAYl9D,SAASS,cAAc,UACvCy8D,EAAU/7D,UAAYy7D,EACtBM,EAAU3kD,aAAa,OAAQ,UAC/B2kD,EAAUpC,MAAQkC,EAClBE,EAAU3nD,YAAmC,iBAAhBunD,EACvB98D,SAASsxB,eAAewrC,GACxBA,GACNI,EAAU9pD,iBAAiBqsB,GAAiBloB,EAAMwjD,aAAa/iE,KAAKuf,EAAOjQ,IAAQ,GACnF,IAAI61D,EAAan9D,SAASS,cAAc,UACxC08D,EAAWh8D,UAAY07D,EACvBM,EAAW5kD,aAAa,OAAQ,UAChC4kD,EAAWrC,MAAQmC,EACnBE,EAAW5nD,YAAoC,iBAAjBwnD,EACxB/8D,SAASsxB,eAAeyrC,GACxBA,GACNI,EAAW/pD,iBAAiBqsB,GAAiBloB,EAAMwjD,aAAa/iE,KAAKuf,GAAQjQ,IAAQ,GACrF,IAAI0zD,EAAa75D,gCACb9G,EAAUkd,EAAMld,QASpB,OARAA,EAAQ8G,UAAY65D,EACpB3gE,EAAQkb,YAAY2nD,GACpB7iE,EAAQkb,YAAY4nD,GAKpB5lD,EAAM+kD,eAAiCvsC,IAArBhd,EAAQsB,SAAyBtB,EAAQsB,SAAW,IAC/DkD,EAyCX,OA5FA,GAAUolD,EAAM5lC,GA0DhB4lC,EAAKvkE,UAAU2iE,aAAe,SAAUzzD,EAAO4L,GAC3CA,EAAMsqB,iBACN/hC,KAAK2hE,aAAa91D,IAMtBq1D,EAAKvkE,UAAUglE,aAAe,SAAU91D,GACpC,IACI+qD,EADM52D,KAAKmsC,SACA6uB,UACf,GAAKpE,EAAL,CAKA,IAAIgL,EAAchL,EAAKtH,UACvB,QAAoBh7B,IAAhBstC,EAA2B,CAC3B,IAAIC,EAAUjL,EAAKf,mBAAmB+L,EAAc/1D,GAChD7L,KAAK6gE,UAAY,GACbjK,EAAKjH,gBACLiH,EAAKrG,mBAETqG,EAAK7mC,QAAQ,CACTla,KAAMgsD,EACNjpD,SAAU5Y,KAAK6gE,UACf39C,OAAQu9B,MAIZmW,EAAK/H,QAAQgT,MAIlBX,EA7Fc,CA8FvB,ICtIa,OACH,SCPR,GAAwC,WACxC,IAAI3hE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAsJrC,SAAS+hE,GAAYlL,EAAM/qD,EAAO82C,EAAY4S,GACjD,IAAIqM,EAAchL,EAAKtH,UACvB,QAAoBh7B,IAAhBstC,EAAJ,CAGA,IAAIC,EAAUjL,EAAKf,mBAAmB+L,EAAc/1D,GAChDipD,EAAgB8B,EAAK1G,qBAAqB2R,GAC1CjL,EAAKjH,gBACLiH,EAAKrG,mBAETqG,EAAK7mC,QAAQ,CACT2O,WAAYo2B,EACZrS,OAAQE,EACR/pC,cAA2B0b,IAAjBihC,EAA6BA,EAAe,IACtDryC,OAAQu9B,MAGD,OAnHkB,SAAUnlB,GAKvC,SAASymC,EAAYlxB,GACjB,IAAI/0B,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAsBjC,OAlBA8b,EAAM3E,GAIN2E,EAAM8nB,KAIN9nB,EAAM+nB,GACFgN,GAAeA,EAAY7N,cAC3BlnB,EAAMknB,YAAc6N,EAAY7N,aAMpClnB,EAAM4uB,KAAO,KACb5uB,EAAMkmD,WAAU,GACTlmD,EA8CX,OAzEA,GAAUimD,EAAazmC,GAmCvBymC,EAAYplE,UAAU2/D,UAAY,WAC9B,OAA+Bt8D,KAAKpE,IAAI,KAO5CmmE,EAAYplE,UAAUwvC,OAAS,WAC3B,OAAOnsC,KAAK0qC,MAQhBq3B,EAAYplE,UAAUqmC,YAAc,SAAUk5B,GAC1C,OAAO,GAQX6F,EAAYplE,UAAUqlE,UAAY,SAAUl0C,GACxC9tB,KAAKyhC,IAAI,GAA4B3T,IAQzCi0C,EAAYplE,UAAU6rC,OAAS,SAAU78B,GACrC3L,KAAK0qC,KAAO/+B,GAETo2D,EA1EqB,CA2E9B,IC/HE,GAAwC,WACxC,IAAIxiE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAwE7B,GA1CsB,SAAUu7B,GAK3C,SAAS2mC,EAAgBpxB,GACrB,IAAI/0B,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAC7BsX,EAAUu5B,GAA4B,GAW1C,OANA/0B,EAAMomD,OAAS5qD,EAAQzL,MAAQyL,EAAQzL,MAAQ,EAK/CiQ,EAAM+kD,eAAiCvsC,IAArBhd,EAAQsB,SAAyBtB,EAAQsB,SAAW,IAC/DkD,EAsBX,OAvCA,GAAUmmD,EAAiB3mC,GAyB3B2mC,EAAgBtlE,UAAUqmC,YAAc,SAAUk5B,GAC9C,IAAIiG,GAAY,EAChB,GAAIjG,EAAgB3jD,MAAQ48B,GAAoB9B,SAAU,CACtD,IAAI4oB,EAA0CC,EAA6B,cACvEvwD,EAAMuwD,EAAgBvwD,IACtB82C,EAASyZ,EAAgBpgC,WACzBjwB,EAAQowD,EAAamG,UAAYpiE,KAAKkiE,OAASliE,KAAKkiE,OAExDJ,GADWn2D,EAAIqvD,UACGnvD,EAAO42C,EAAQziD,KAAK6gE,WACtC5E,EAAal6B,iBACbogC,GAAY,EAEhB,OAAQA,GAELF,EAxCyB,CAyClC,ICvEE,GAAwC,WACxC,IAAI1iE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAqNrC,SAAS,GAASo4D,GAIrB,IAHA,IAAI93D,EAAS83D,EAAc93D,OACvB21C,EAAU,EACVC,EAAU,EACLl7C,EAAI,EAAGA,EAAIsF,EAAQtF,IACxBi7C,GAAWmiB,EAAcp9D,GAAGi7C,QAC5BC,GAAWkiB,EAAcp9D,GAAGk7C,QAEhC,MAAO,CAACD,EAAU31C,EAAQ41C,EAAU51C,GAazB,IAAAgiE,GAhLyB,SAAU/mC,GAK9C,SAASgnC,EAAmBzxB,GACxB,IAAI/0B,EAAQ9b,KACRsX,EAAUu5B,GAA4B,GAiC1C,OAhCA/0B,EAAQwf,EAAOpgC,KAAK8E,KACyC,IAAcA,KACvEsX,EAAQirD,kBACRzmD,EAAMymD,gBAAkBjrD,EAAQirD,iBAEhCjrD,EAAQkrD,kBACR1mD,EAAM0mD,gBAAkBlrD,EAAQkrD,iBAEhClrD,EAAQmrD,kBACR3mD,EAAM2mD,gBAAkBnrD,EAAQmrD,iBAEhCnrD,EAAQorD,gBACR5mD,EAAM4mD,cAAgBprD,EAAQorD,eAE9BprD,EAAQqrD,WACR7mD,EAAM6mD,SAAWrrD,EAAQqrD,UAM7B7mD,EAAM8mD,wBAAyB,EAK/B9mD,EAAM+mD,iBAAmB,GAKzB/mD,EAAMgnD,eAAiB,GAChBhnD,EA6GX,OApJA,GAAUwmD,EAAoBhnC,GA+C9BgnC,EAAmB3lE,UAAUomE,gBAAkB,WAC3C,OAAO/iE,KAAK8iE,eAAeziE,QAQ/BiiE,EAAmB3lE,UAAU4lE,gBAAkB,SAAUrG,GACrD,OAAO,GAOXoG,EAAmB3lE,UAAU6lE,gBAAkB,SAAUtG,KASzDoG,EAAmB3lE,UAAUqmC,YAAc,SAAUk5B,GACjD,IAAKA,EAAgBvpB,cACjB,OAAO,EAEX,IAAIwvB,GAAY,EAEhB,GADAniE,KAAKgjE,uBAAuB9G,GACxBl8D,KAAK4iE,wBACL,GAAI1G,EAAgB3jD,MAAQ48B,GAAoB7B,YAC5CtzC,KAAKwiE,gBAAgBtG,GAErBA,EAAgBvpB,cAAc5Q,sBAE7B,GAAIm6B,EAAgB3jD,MAAQ48B,GAAoB1B,UAAW,CAC5D,IAAIwvB,EAAYjjE,KAAK0iE,cAAcxG,GACnCl8D,KAAK4iE,uBACDK,GAAajjE,KAAK8iE,eAAeziE,OAAS,QAIlD,GAAI67D,EAAgB3jD,MAAQ48B,GAAoB3B,YAAa,CACzD,IAAI0vB,EAAUljE,KAAKuiE,gBAAgBrG,GACnCl8D,KAAK4iE,uBAAyBM,EAC9Bf,EAAYniE,KAAK2iE,SAASO,QAErBhH,EAAgB3jD,MAAQ48B,GAAoB5B,aACjDvzC,KAAKyiE,gBAAgBvG,GAG7B,OAAQiG,GAOZG,EAAmB3lE,UAAU8lE,gBAAkB,SAAUvG,KAOzDoG,EAAmB3lE,UAAU+lE,cAAgB,SAAUxG,GACnD,OAAO,GAQXoG,EAAmB3lE,UAAUgmE,SAAW,SAAUO,GAC9C,OAAOA,GAMXZ,EAAmB3lE,UAAUqmE,uBAAyB,SAAU9G,GAC5D,GAqCR,SAAgCA,GAC5B,IAAI3jD,EAAO2jD,EAAgB3jD,KAC3B,OAAQA,IAAS48B,GAAoB3B,aACjCj7B,IAAS48B,GAAoB7B,aAC7B/6B,IAAS48B,GAAoB1B,UAzCzB0vB,CAAuBjH,GAAkB,CACzC,IAAIpsB,EAAUosB,EAAgBvpB,cAC1Br4B,EAAKw1B,EAAQyF,UAAU/sC,WACvB0zD,EAAgB3jD,MAAQ48B,GAAoB1B,iBACrCzzC,KAAK6iE,iBAAiBvoD,IAExB4hD,EAAgB3jD,MAAQ48B,GAAoB3B,aAG5Cl5B,KAAMta,KAAK6iE,oBAFhB7iE,KAAK6iE,iBAAiBvoD,GAAMw1B,GAMhC9vC,KAAK8iE,eAAiB3gC,GAAUniC,KAAK6iE,oBAGtCP,EArJ4B,CAsJrC,IC9LK,SAAS,GAAI7S,GAChB,IAAI2T,EAAahjE,UAKjB,OAAO,SAAUqX,GAEb,IADA,IAAI4rD,GAAO,EACFtoE,EAAI,EAAG2hC,EAAK0mC,EAAW/iE,OAAQtF,EAAI2hC,IACxC2mC,EAAOA,GAAQD,EAAWroE,GAAG0c,MADiB1c,GAMlD,OAAOsoE,GAWR,IAcIC,GAAmB,SAAUpH,GACpC,IAAIvpB,EAAoEupB,EAA6B,cACrG,OAAQvpB,EAAc4wB,UAChB5wB,EAAc6wB,SAAW7wB,EAAc8wB,UACzC9wB,EAAcyvB,UAmBXsB,GAAoB,SAAUjsD,GACrC,OAAOA,EAAM9L,IAAIovD,mBAAmB59C,aAAa,aAVlC,SAAU1F,GACzB,OAAOA,EAAMuM,OAAO+2C,mBAAmB1lD,SAAS9Q,SAASo/D,eAUnD,CAAMlsD,IAULmsD,GAAS3pC,GAoBT4pC,GAAoB,SAAU3H,GACrC,IAAIvpB,EAA2CupB,EAA6B,cAC5E,OAA+B,GAAxBvpB,EAAc+C,UAAiB/a,IAAUC,IAAO+X,EAAc8wB,UAiD9DK,GAAiB,SAAU5H,GAClC,IAAIvpB,EAAoEupB,EAA6B,cACrG,OAASvpB,EAAc4wB,UACjB5wB,EAAc6wB,SAAW7wB,EAAc8wB,WACxC9wB,EAAcyvB,UAyBZ2B,GAAe,SAAU7H,GAChC,IAAIvpB,EAAoEupB,EAA6B,cACrG,OAASvpB,EAAc4wB,UACjB5wB,EAAc6wB,SAAW7wB,EAAc8wB,UACzC9wB,EAAcyvB,UAUX4B,GAAoB,SAAU9H,GACrC,IACI+H,EADoE/H,EAA6B,cAC3C,OAAE+H,QAC5D,MAAmB,UAAZA,GAAmC,WAAZA,GAAoC,aAAZA,GAS/CC,GAAY,SAAUhI,GAC7B,IAAIjnB,EAAmE,EAAkBtC,cAGzF,OAFAjX,QAAwBpH,IAAjB2gB,EAA4B,IAEA,SAA5BA,EAAakvB,aAqCbC,GAAgB,SAAUlI,GACjC,IAAIjnB,EAAmE,EAAkBtC,cAEzF,OADAjX,QAAwBpH,IAAjB2gB,EAA4B,IAC5BA,EAAaovB,WAAqC,IAAxBpvB,EAAaS,QCtQ9C,GAAwC,WACxC,IAAIn2C,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAyL7B,GApJc,SAAUu7B,GAKnC,SAASgpC,EAAQzzB,GACb,IAAI/0B,EAAQwf,EAAOpgC,KAAK8E,KAAM,CAC1B2iE,SAAUzoC,MACRl6B,KACFsX,EAAUu5B,GAA4B,GAK1C/0B,EAAMyoD,SAAWjtD,EAAQktD,QAIzB1oD,EAAM2oD,aAAe,KAIrB3oD,EAAM4oD,mBAIN5oD,EAAM6oD,UAAW,EACjB,IAAIC,EAAYttD,EAAQstD,UAClBttD,EAAQstD,UACR,GAAId,GAAgBM,IAa1B,OARAtoD,EAAM+oD,WAAavtD,EAAQwtD,YACrB,GAAIpB,GAAmBkB,GACvBA,EAKN9oD,EAAMipD,YAAa,EACZjpD,EAwGX,OAjJA,GAAUwoD,EAAShpC,GA+CnBgpC,EAAQ3nE,UAAU6lE,gBAAkB,SAAUtG,GACrCl8D,KAAK2kE,WACN3kE,KAAK2kE,UAAW,EAChB3kE,KAAKmsC,SAAS6uB,UAAUvF,oBAE5B,IlE4Lc35B,EAAYlsB,EkE5LtBkzD,EAAiB9iE,KAAK8iE,eACtBkC,EAAW,GAAqBlC,GACpC,GAAIA,EAAeziE,QAAUL,KAAK0kE,oBAI9B,GAHI1kE,KAAKukE,UACLvkE,KAAKukE,SAASjjD,OAAO0jD,EAAS,GAAIA,EAAS,IAE3ChlE,KAAKykE,aAAc,CACnB,IAAI54D,EAAQ,CACR7L,KAAKykE,aAAa,GAAKO,EAAS,GAChCA,EAAS,GAAKhlE,KAAKykE,aAAa,IAGhC7N,EADMsF,EAAgBvwD,IACXqvD,UlEgLTl/B,EkE/KUjwB,ElE+KE+D,EkE/KKgnD,EAAK3H,gBlEgLxCnzB,EAAW,IAAMlsB,EACjBksB,EAAW,IAAMlsB,EkEhLL,GAAiB/D,EAAO+qD,EAAKpH,eAC7BoH,EAAKlC,qBAAqB7oD,SAGzB7L,KAAKukE,UAGVvkE,KAAKukE,SAASU,QAElBjlE,KAAKykE,aAAeO,EACpBhlE,KAAK0kE,mBAAqB5B,EAAeziE,OACzC67D,EAAgBvpB,cAAc5Q,kBAOlCuiC,EAAQ3nE,UAAU+lE,cAAgB,SAAUxG,GACxC,IAAIvwD,EAAMuwD,EAAgBvwD,IACtBirD,EAAOjrD,EAAIqvD,UACf,GAAmC,IAA/Bh7D,KAAK8iE,eAAeziE,OAAc,CAClC,IAAKL,KAAK+kE,YAAc/kE,KAAKukE,UAAYvkE,KAAKukE,SAASj5C,MAAO,CAC1D,IAAI45C,EAAWllE,KAAKukE,SAAS7nB,cACzBh+B,EAAQ1e,KAAKukE,SAASY,WACtBpvC,EAAS6gC,EAAKrH,oBACd6V,EAAWz5D,EAAI4vD,+BAA+BxlC,GAC9C+qB,EAAOn1C,EAAI0uD,+BAA+B,CAC1C+K,EAAS,GAAKF,EAAW5iE,KAAKyK,IAAI2R,GAClC0mD,EAAS,GAAKF,EAAW5iE,KAAK8I,IAAIsT,KAEtCk4C,EAAK9G,gBAAgB,CACjB/5B,OAAQ6gC,EAAK3C,qBAAqBnT,GAClCloC,SAAU,IACVsK,OAAQu9B,KAOhB,OAJIzgD,KAAK2kE,WACL3kE,KAAK2kE,UAAW,EAChB/N,EAAKlB,mBAEF,EASP,OANI11D,KAAKukE,UAGLvkE,KAAKukE,SAASU,QAElBjlE,KAAKykE,aAAe,MACb,GAQfH,EAAQ3nE,UAAU4lE,gBAAkB,SAAUrG,GAC1C,GAAIl8D,KAAK8iE,eAAeziE,OAAS,GAAKL,KAAK6kE,WAAW3I,GAAkB,CACpE,IACItF,EADMsF,EAAgBvwD,IACXqvD,UAYf,OAXAh7D,KAAKykE,aAAe,KAEhB7N,EAAKjH,gBACLiH,EAAKrG,mBAELvwD,KAAKukE,UACLvkE,KAAKukE,SAASU,QAIlBjlE,KAAK+kE,WAAa/kE,KAAK8iE,eAAeziE,OAAS,GACxC,EAGP,OAAO,GAGRikE,EAlJiB,CAmJ1BjC,ICxLE,GAAwC,WACxC,IAAI9iE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA6H7B,GAtFiB,SAAUu7B,GAKtC,SAAS+pC,EAAWx0B,GAChB,IAAI/0B,EAAQ9b,KACRsX,EAAUu5B,GAA4B,GAmB1C,OAlBA/0B,EAAQwf,EAAOpgC,KAAK8E,KAAM,CACtB2iE,SAAUzoC,MACRl6B,MAKA6kE,WAAavtD,EAAQstD,UAAYttD,EAAQstD,UAAYtB,GAK3DxnD,EAAMwpD,gBAAahxC,EAKnBxY,EAAM+kD,eAAiCvsC,IAArBhd,EAAQsB,SAAyBtB,EAAQsB,SAAW,IAC/DkD,EA0DX,OAnFA,GAAUupD,EAAY/pC,GA+BtB+pC,EAAW1oE,UAAU6lE,gBAAkB,SAAUtG,GAC7C,GAAKgI,GAAUhI,GAAf,CAGA,IAAIvwD,EAAMuwD,EAAgBvwD,IACtBirD,EAAOjrD,EAAIqvD,UACf,GAAIpE,EAAKjF,iBAAiBhzB,WAAa4hB,GAAvC,CAGA,IAAIzsC,EAAOnI,EAAI6vD,UACXtiD,EAASgjD,EAAgBlzB,MACzBj5B,EAAQzN,KAAKuK,MAAMiH,EAAK,GAAK,EAAIoF,EAAO,GAAIA,EAAO,GAAKpF,EAAK,GAAK,GACtE,QAAwBwgB,IAApBt0B,KAAKslE,WAA0B,CAC/B,IAAIz5D,EAAQkE,EAAQ/P,KAAKslE,WACzB1O,EAAK3B,wBAAwBppD,GAEjC7L,KAAKslE,WAAav1D,KAOtBs1D,EAAW1oE,UAAU+lE,cAAgB,SAAUxG,GAC3C,OAAKgI,GAAUhI,KAGLA,EAAgBvwD,IACXqvD,UACVtF,eAAe11D,KAAK6gE,YAClB,IAOXwE,EAAW1oE,UAAU4lE,gBAAkB,SAAUrG,GAC7C,QAAKgI,GAAUhI,QAGX2H,GAAkB3H,KAClBl8D,KAAK6kE,WAAW3I,MACNA,EAAgBvwD,IACtBqvD,UAAUvF,mBACdz1D,KAAKslE,gBAAahxC,GACX,KAMR+wC,EApFoB,CAqF7BhD,ICzHE,GAAwC,WACxC,IAAI9iE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAkI7B,GAjHgB,SAAUu7B,GAKrC,SAASiqC,EAAU7/D,GACf,IAAIoW,EAAQwf,EAAOpgC,KAAK8E,OAASA,KA6BjC,OAxBA8b,EAAM0pD,UAAY,KAKlB1pD,EAAM0zB,SAAWjrC,SAASS,cAAc,OACxC8W,EAAM0zB,SAASjmC,MAAM/C,SAAW,WAChCsV,EAAM0zB,SAASjmC,MAAM4uD,cAAgB,OACrCr8C,EAAM0zB,SAAS9pC,UAAY,UAAYA,EAKvCoW,EAAM4uB,KAAO,KAKb5uB,EAAM2pD,YAAc,KAKpB3pD,EAAM4pD,UAAY,KACX5pD,EA4EX,OA9GA,GAAUypD,EAAWjqC,GAuCrBiqC,EAAU5oE,UAAU+8B,gBAAkB,WAClC15B,KAAKwoC,OAAO,OAKhB+8B,EAAU5oE,UAAUgpE,QAAU,WAC1B,IAAIC,EAAa5lE,KAAKylE,YAClBI,EAAW7lE,KAAK0lE,UAEhBn8D,EAAQvJ,KAAKwvC,SAASjmC,MAC1BA,EAAMiL,KAAOlS,KAAKiG,IAAIq9D,EAAW,GAAIC,EAAS,IAFrC,KAGTt8D,EAAMkL,IAAMnS,KAAKiG,IAAIq9D,EAAW,GAAIC,EAAS,IAHpC,KAITt8D,EAAMtG,MAAQX,KAAK4M,IAAI22D,EAAS,GAAKD,EAAW,IAJvC,KAKTr8D,EAAMrG,OAASZ,KAAK4M,IAAI22D,EAAS,GAAKD,EAAW,IALxC,MAUbL,EAAU5oE,UAAU6rC,OAAS,SAAU78B,GACnC,GAAI3L,KAAK0qC,KAAM,CACX1qC,KAAK0qC,KAAK+wB,sBAAsBt2D,YAAYnF,KAAKwvC,UACjD,IAAIjmC,EAAQvJ,KAAKwvC,SAASjmC,MAC1BA,EAAMiL,KAAO,UACbjL,EAAMkL,IAAM,UACZlL,EAAMtG,MAAQ,UACdsG,EAAMrG,OAAS,UAEnBlD,KAAK0qC,KAAO/+B,EACR3L,KAAK0qC,MACL1qC,KAAK0qC,KAAK+wB,sBAAsB3hD,YAAY9Z,KAAKwvC,WAOzD+1B,EAAU5oE,UAAUmpE,UAAY,SAAUF,EAAYC,GAClD7lE,KAAKylE,YAAcG,EACnB5lE,KAAK0lE,UAAYG,EACjB7lE,KAAK+lE,yBACL/lE,KAAK2lE,WAKTJ,EAAU5oE,UAAUopE,uBAAyB,WACzC,IAAIH,EAAa5lE,KAAKylE,YAClBI,EAAW7lE,KAAK0lE,UAOhBnpC,EANS,CACTqpC,EACA,CAACA,EAAW,GAAIC,EAAS,IACzBA,EACA,CAACA,EAAS,GAAID,EAAW,KAEJj6D,IAAI3L,KAAK0qC,KAAK2vB,+BAAgCr6D,KAAK0qC,MAE5EnO,EAAY,GAAKA,EAAY,GAAGp7B,QAC3BnB,KAAKwlE,UAINxlE,KAAKwlE,UAAUphB,eAAe,CAAC7nB,IAH/Bv8B,KAAKwlE,UAAY,IAAI,GAAQ,CAACjpC,KAStCgpC,EAAU5oE,UAAUqpE,YAAc,WAC9B,OAAOhmE,KAAKwlE,WAETD,EA/GmB,CAgH5B,ICpIE,GAAwC,WACxC,IAAIhmE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA8CxCkmE,GAMU,WANVA,GAYS,UAZTA,GAkBQ,SAlBRA,GAwBW,YAOXC,GAA8B,SAAU5qC,GAOxC,SAAS4qC,EAAa3tD,EAAMujB,EAAYogC,GACpC,IAAIpgD,EAAQwf,EAAOpgC,KAAK8E,KAAMuY,IAASvY,KAcvC,OAPA8b,EAAMggB,WAAaA,EAMnBhgB,EAAMogD,gBAAkBA,EACjBpgD,EAEX,OAvBA,GAAUoqD,EAAc5qC,GAuBjB4qC,EAxBsB,CAyB/BjuD,IA+Ia,GAxHc,SAAUqjB,GAKnC,SAAS6qC,EAAQt1B,GACb,IAAI/0B,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAIjC8b,EAAM3E,GAIN2E,EAAM8nB,KAIN9nB,EAAM+nB,GACN,IAAIvsB,EAAUu5B,GAA4B,GA+B1C,OA1BA/0B,EAAMsqD,KAAO,IAAI,GAAU9uD,EAAQ5R,WAAa,cAKhDoW,EAAMuqD,cAA+B/xC,IAApBhd,EAAQgvD,QAAwBhvD,EAAQgvD,QAAU,GAC/DhvD,EAAQivD,WACRzqD,EAAMyqD,SAAWjvD,EAAQivD,UAM7BzqD,EAAM2pD,YAAc,KAKpB3pD,EAAM+oD,WAAavtD,EAAQstD,UAAYttD,EAAQstD,UAAYf,GAK3D/nD,EAAM0qD,iBAAmBlvD,EAAQmvD,gBAC3BnvD,EAAQmvD,gBACR3qD,EAAM4qD,uBACL5qD,EAoEX,OArHA,GAAUqqD,EAAS7qC,GA4DnB6qC,EAAQxpE,UAAU+pE,uBAAyB,SAAUxK,EAAiB0J,EAAYC,GAC9E,IAAI5iE,EAAQ4iE,EAAS,GAAKD,EAAW,GACjC1iE,EAAS2iE,EAAS,GAAKD,EAAW,GACtC,OAAO3iE,EAAQA,EAAQC,EAASA,GAAUlD,KAAKqmE,UAOnDF,EAAQxpE,UAAUqpE,YAAc,WAC5B,OAAOhmE,KAAKomE,KAAKJ,eAMrBG,EAAQxpE,UAAU6lE,gBAAkB,SAAUtG,GAC1Cl8D,KAAKomE,KAAKN,UAAU9lE,KAAKylE,YAAavJ,EAAgBlzB,OACtDhpC,KAAKqY,cAAc,IAAI6tD,GAAaD,GAA0B/J,EAAgBpgC,WAAYogC,KAO9FiK,EAAQxpE,UAAU+lE,cAAgB,SAAUxG,GACxCl8D,KAAKomE,KAAK59B,OAAO,MACjB,IAAIm+B,EAAc3mE,KAAKwmE,iBAAiBtK,EAAiBl8D,KAAKylE,YAAavJ,EAAgBlzB,OAK3F,OAJI29B,GACA3mE,KAAKumE,SAASrK,GAElBl8D,KAAKqY,cAAc,IAAI6tD,GAAaS,EAAcV,GAA0BA,GAA4B/J,EAAgBpgC,WAAYogC,KAC7H,GAOXiK,EAAQxpE,UAAU4lE,gBAAkB,SAAUrG,GAC1C,QAAIl8D,KAAK6kE,WAAW3I,KAChBl8D,KAAKylE,YAAcvJ,EAAgBlzB,MACnChpC,KAAKomE,KAAK59B,OAAO0zB,EAAgBvwD,KACjC3L,KAAKomE,KAAKN,UAAU9lE,KAAKylE,YAAazlE,KAAKylE,aAC3CzlE,KAAKqY,cAAc,IAAI6tD,GAAaD,GAA2B/J,EAAgBpgC,WAAYogC,KACpF,IAUfiK,EAAQxpE,UAAU4pE,SAAW,SAAU9uD,KAChC0uD,EAtHiB,CAuH1B9D,ICpPE,GAAwC,WACxC,IAAI9iE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA4F7B,GAhDe,SAAUu7B,GAKpC,SAASsrC,EAAS/1B,GACd,IAAI/0B,EAAQ9b,KACRsX,EAAUu5B,GAA4B,GACtC+zB,EAAYttD,EAAQstD,UAAYttD,EAAQstD,UAAYb,GAgBxD,OAfAjoD,EAAQwf,EAAOpgC,KAAK8E,KAAM,CACtB4kE,UAAWA,EACXl/D,UAAW4R,EAAQ5R,WAAa,cAChC4gE,QAAShvD,EAAQgvD,WACftmE,MAKA6gE,eAAiCvsC,IAArBhd,EAAQsB,SAAyBtB,EAAQsB,SAAW,IAKtEkD,EAAM+qD,UAAuBvyC,IAAhBhd,EAAQwvD,KAAoBxvD,EAAQwvD,IAC1ChrD,EAsBX,OA7CA,GAAU8qD,EAAUtrC,GA6BpBsrC,EAASjqE,UAAU4pE,SAAW,SAAU9uD,GACpC,IACIm/C,EADM52D,KAAKmsC,SAC8C6uB,UACzD1vB,EAAWtrC,KAAKgmE,cACpB,GAAIhmE,KAAK6mE,KAAM,CACX,IAAIhT,EAAgB+C,EAAKrD,yBAAyBjoB,GAC9C5M,EAAak4B,EAAKrE,+BAA+BsB,GACjDv4C,EAASs7C,EAAK3H,gBAAkBvwB,GACpC4M,EAAWA,EAAS38B,SACXiB,MAAM0L,EAASA,GAE5Bs7C,EAAKtD,YAAYhoB,EAAU,CACvB1yB,SAAU5Y,KAAK6gE,UACf39C,OAAQu9B,MAGTmmB,EA9CkB,CA+C3B,ICpFa,GACL,GADK,GAEP,GAFO,GAGJ,GAHI,GAIL,GCXN,GAAwC,WACxC,IAAIrnE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAiI7B,GAlFkB,SAAUu7B,GAKvC,SAASyrC,EAAYl2B,GACjB,IAAI/0B,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAC7BsX,EAAUu5B,GAAe,GA4B7B,OAtBA/0B,EAAMkrD,kBAAoB,SAAU9K,GAChC,OAAQ4H,GAAe5H,IAAoB8H,GAAkB9H,IAMjEpgD,EAAM+oD,gBACoBvwC,IAAtBhd,EAAQstD,UACFttD,EAAQstD,UACR9oD,EAAMkrD,kBAKhBlrD,EAAM+kD,eAAiCvsC,IAArBhd,EAAQsB,SAAyBtB,EAAQsB,SAAW,IAKtEkD,EAAMmrD,iBACqB3yC,IAAvBhd,EAAQ4vD,WAA2B5vD,EAAQ4vD,WAAa,IACrDprD,EA6CX,OA/EA,GAAUirD,EAAazrC,GA4CvByrC,EAAYpqE,UAAUqmC,YAAc,SAAUk5B,GAC1C,IAAIiG,GAAY,EAChB,GAAIjG,EAAgB3jD,MAAQyrB,GAAmB,CAC3C,IAAImjC,EAAyCjL,EAA6B,cACtEkL,EAAUD,EAASC,QACvB,GAAIpnE,KAAK6kE,WAAW3I,KACfkL,GAAWC,IACRD,GAAWC,IACXD,GAAWC,IACXD,GAAWC,IAAa,CAC5B,IACIzQ,EADMsF,EAAgBvwD,IACXqvD,UACXsM,EAAgB1Q,EAAK3H,gBAAkBjvD,KAAKinE,YAC5CjkB,EAAS,EAAGC,EAAS,EACrBmkB,GAAWC,GACXpkB,GAAUqkB,EAELF,GAAWC,GAChBrkB,GAAUskB,EAELF,GAAWC,GAChBrkB,EAASskB,EAGTrkB,EAASqkB,EAEb,IAAIz7D,EAAQ,CAACm3C,EAAQC,GACrB,GAAiBp3C,EAAO+qD,EAAKpH,eVctC,SAAaoH,EAAM/qD,EAAO0pD,GAC7B,IAAIlE,EAAgBuF,EAAKrH,oBACzB,GAAI8B,EAAe,CACf,IAAIt7B,EAAS,CAACs7B,EAAc,GAAKxlD,EAAM,GAAIwlD,EAAc,GAAKxlD,EAAM,IACpE+qD,EAAK9G,gBAAgB,CACjBl3C,cAA2B0b,IAAjBihC,EAA6BA,EAAe,IACtDryC,OAAQy9B,GACR5qB,OAAQ6gC,EAAK3C,qBAAqBl+B,MUpB9BwxC,CAAI3Q,EAAM/qD,EAAO7L,KAAK6gE,WACtBsG,EAASplC,iBACTogC,GAAY,GAGpB,OAAQA,GAEL4E,EAhFqB,CAiF9B,IChIE,GAAwC,WACxC,IAAIxnE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAgG7B,GArDmB,SAAUu7B,GAKxC,SAASksC,EAAa32B,GAClB,IAAI/0B,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAC7BsX,EAAUu5B,GAA4B,GAgB1C,OAXA/0B,EAAM+oD,WAAavtD,EAAQstD,UAAYttD,EAAQstD,UAAYZ,GAK3DloD,EAAMomD,OAAS5qD,EAAQzL,MAAQyL,EAAQzL,MAAQ,EAK/CiQ,EAAM+kD,eAAiCvsC,IAArBhd,EAAQsB,SAAyBtB,EAAQsB,SAAW,IAC/DkD,EA4BX,OAlDA,GAAU0rD,EAAclsC,GAgCxBksC,EAAa7qE,UAAUqmC,YAAc,SAAUk5B,GAC3C,IAAIiG,GAAY,EAChB,GAAIjG,EAAgB3jD,MAAQyrB,IACxBk4B,EAAgB3jD,MAAQyrB,GAAoB,CAC5C,IAAImjC,EAAyCjL,EAA6B,cACtEuL,EAAWN,EAASM,SACxB,GAAIznE,KAAK6kE,WAAW3I,KACfuL,GAAY,IAAIC,WAAW,IAAMD,GAAY,IAAIC,WAAW,IAAK,CAClE,IAAI/7D,EAAMuwD,EAAgBvwD,IACtBE,EAAQ47D,GAAY,IAAIC,WAAW,GAAK1nE,KAAKkiE,QAAUliE,KAAKkiE,OAEhEJ,GADWn2D,EAAIqvD,UACGnvD,OAAOyoB,EAAWt0B,KAAK6gE,WACzCsG,EAASplC,iBACTogC,GAAY,GAGpB,OAAQA,GAELqF,EAnDsB,CAoD/B,ICgBa,GAtGc,WAOzB,SAASG,EAAQC,EAAOC,EAAa/uD,GAKjC9Y,KAAK8nE,OAASF,EAKd5nE,KAAK+nE,aAAeF,EAKpB7nE,KAAKgoE,OAASlvD,EAKd9Y,KAAKioE,QAAU,GAKfjoE,KAAKkoE,OAAS,EAKdloE,KAAKmoE,iBAAmB,EA+D5B,OA1DAR,EAAQhrE,UAAUsoE,MAAQ,WACtBjlE,KAAKioE,QAAQ5nE,OAAS,EACtBL,KAAKkoE,OAAS,EACdloE,KAAKmoE,iBAAmB,GAM5BR,EAAQhrE,UAAU2kB,OAAS,SAAU3d,EAAGC,GACpC5D,KAAKioE,QAAQpnE,KAAK8C,EAAGC,EAAG0mB,KAAKK,QAKjCg9C,EAAQhrE,UAAU2uB,IAAM,WACpB,GAAItrB,KAAKioE,QAAQ5nE,OAAS,EAGtB,OAAO,EAEX,IAAIyY,EAAQwR,KAAKK,MAAQ3qB,KAAKgoE,OAC1BI,EAAYpoE,KAAKioE,QAAQ5nE,OAAS,EACtC,GAAIL,KAAKioE,QAAQG,EAAY,GAAKtvD,EAG9B,OAAO,EAIX,IADA,IAAIuvD,EAAaD,EAAY,EACtBC,EAAa,GAAKroE,KAAKioE,QAAQI,EAAa,GAAKvvD,GACpDuvD,GAAc,EAElB,IAAIzvD,EAAW5Y,KAAKioE,QAAQG,EAAY,GAAKpoE,KAAKioE,QAAQI,EAAa,GAIvE,GAAIzvD,EAAW,IAAO,GAClB,OAAO,EAEX,IAAIvH,EAAKrR,KAAKioE,QAAQG,GAAapoE,KAAKioE,QAAQI,GAC5C/2D,EAAKtR,KAAKioE,QAAQG,EAAY,GAAKpoE,KAAKioE,QAAQI,EAAa,GAGjE,OAFAroE,KAAKkoE,OAAS5lE,KAAKuK,MAAMyE,EAAID,GAC7BrR,KAAKmoE,iBAAmB7lE,KAAKsK,KAAKyE,EAAKA,EAAKC,EAAKA,GAAMsH,EAChD5Y,KAAKmoE,iBAAmBnoE,KAAK+nE,cAKxCJ,EAAQhrE,UAAU+/C,YAAc,WAC5B,OAAQ18C,KAAK+nE,aAAe/nE,KAAKmoE,kBAAoBnoE,KAAK8nE,QAK9DH,EAAQhrE,UAAUwoE,SAAW,WACzB,OAAOnlE,KAAKkoE,QAETP,EApGiB,GCTxB,GAAwC,WACxC,IAAIpoE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA0BjCuoE,GACG,WADHA,GAEA,QAuOI,GA9MqB,SAAUhtC,GAK1C,SAASitC,EAAe13B,GACpB,IAAI/0B,EAAQ9b,KACRsX,EAAUu5B,GAA4B,IAC1C/0B,EAAQwf,EAAOpgC,KAAK8E,KACyC,IAAcA,MAKrEwoE,YAAc,EAKpB1sD,EAAM2sD,WAAa,EAKnB3sD,EAAMirC,eAAiCzyB,IAArBhd,EAAQ6tC,SAAyB7tC,EAAQ6tC,SAAW,EAKtErpC,EAAM+kD,eAAiCvsC,IAArBhd,EAAQsB,SAAyBtB,EAAQsB,SAAW,IAKtEkD,EAAM4sD,cAA+Bp0C,IAApBhd,EAAQqxD,QAAwBrxD,EAAQqxD,QAAU,GAKnE7sD,EAAM8sD,gBACoBt0C,IAAtBhd,EAAQuxD,WAA0BvxD,EAAQuxD,UAK9C/sD,EAAMgtD,0BAC8Bx0C,IAAhChd,EAAQq1C,qBACFr1C,EAAQq1C,oBAElB,IAAIiY,EAAYttD,EAAQstD,UAAYttD,EAAQstD,UAAYhB,GA4CxD,OAvCA9nD,EAAM+oD,WAAavtD,EAAQwtD,YACrB,GAAIpB,GAAmBkB,GACvBA,EAKN9oD,EAAMitD,YAAc,KAKpBjtD,EAAMktD,gBAAa10C,EAKnBxY,EAAMmtD,WAKNntD,EAAMotD,WAAQ50C,EAMdxY,EAAMqtD,kBAAoB,IAI1BrtD,EAAMstD,mBAMNttD,EAAMutD,cAAgB,IACfvtD,EA+GX,OA3MA,GAAUysD,EAAgBjtC,GAiG1BitC,EAAe5rE,UAAU2sE,gBAAkB,WACvCtpE,KAAKopE,wBAAqB90C,EACft0B,KAAKmsC,SAAS6uB,UACpBtF,oBAAephC,EAAWt0B,KAAKyoE,WAAczoE,KAAKyoE,WAAa,EAAI,GAAK,EAAK,EAAGzoE,KAAK+oE,cAQ9FR,EAAe5rE,UAAUqmC,YAAc,SAAUk5B,GAC7C,IAAKl8D,KAAK6kE,WAAW3I,GACjB,OAAO,EAGX,GADWA,EAAgB3jD,OACdyrB,GACT,OAAO,EAEX,IAQIn4B,EARAF,EAAMuwD,EAAgBvwD,IACtB49D,EAAwCrN,EAA6B,cAiBzE,GAhBAqN,EAAWxnC,iBACP/hC,KAAK4oE,aACL5oE,KAAK+oE,YAAc7M,EAAgBpgC,YAKnCogC,EAAgB3jD,MAAQyrB,KACxBn4B,EAAQ09D,EAAWtmB,OACfvoB,IAAW6uC,EAAWC,YAAcC,WAAWC,kBAC/C79D,GAASgvB,IAET0uC,EAAWC,YAAcC,WAAWE,iBACpC99D,GAAS,KAGH,IAAVA,EACA,OAAO,EAGP7L,KAAKyoE,WAAa58D,EAEtB,IAAI8e,EAAML,KAAKK,WACS2J,IAApBt0B,KAAKgpE,aACLhpE,KAAKgpE,WAAar+C,KAEjB3qB,KAAKkpE,OAASv+C,EAAM3qB,KAAKgpE,WAAahpE,KAAKmpE,qBAC5CnpE,KAAKkpE,MAAQ5mE,KAAK4M,IAAIrD,GAAS,EAAIy8D,GAAgBA,IAEvD,IAAI1R,EAAOjrD,EAAIqvD,UACf,GAAIh7D,KAAKkpE,QAAUZ,KACb1R,EAAKhF,2BAA4B5xD,KAAK8oE,qBAaxC,OAZI9oE,KAAKopE,mBACLh0B,aAAap1C,KAAKopE,qBAGdxS,EAAKjH,gBACLiH,EAAKrG,mBAETqG,EAAKnB,oBAETz1D,KAAKopE,mBAAqB/zB,WAAWr1C,KAAKspE,gBAAgB/sE,KAAKyD,MAAOA,KAAK0oE,UAC3E9R,EAAK7B,YAAYlpD,EAAQ7L,KAAKqpE,cAAerpE,KAAK+oE,aAClD/oE,KAAKgpE,WAAar+C,GACX,EAEX3qB,KAAKwoE,aAAe38D,EACpB,IAAI+9D,EAAWtnE,KAAKgG,IAAItI,KAAK0oE,UAAY/9C,EAAM3qB,KAAKgpE,YAAa,GAGjE,OAFA5zB,aAAap1C,KAAKipE,YAClBjpE,KAAKipE,WAAa5zB,WAAWr1C,KAAK6pE,iBAAiBttE,KAAKyD,KAAM2L,GAAMi+D,IAC7D,GAMXrB,EAAe5rE,UAAUktE,iBAAmB,SAAUl+D,GAClD,IAAIirD,EAAOjrD,EAAIqvD,UACXpE,EAAKjH,gBACLiH,EAAKrG,mBAET,IAAI1kD,GAASi0B,GAAM9/B,KAAKwoE,aAAcxoE,KAAK+mD,UAAY/mD,KAAKqpE,cAAerpE,KAAK+mD,UAAY/mD,KAAKqpE,eAAiBrpE,KAAKqpE,eACnHzS,EAAKhF,0BAA4B5xD,KAAK8oE,wBAEtCj9D,EAAQA,EAASA,EAAQ,EAAI,GAAK,EAAK,GAE3Ci2D,GAAYlL,EAAM/qD,EAAO7L,KAAK+oE,YAAa/oE,KAAK6gE,WAChD7gE,KAAKkpE,WAAQ50C,EACbt0B,KAAKwoE,YAAc,EACnBxoE,KAAK+oE,YAAc,KACnB/oE,KAAKgpE,gBAAa10C,EAClBt0B,KAAKipE,gBAAa30C,GAQtBi0C,EAAe5rE,UAAUmtE,eAAiB,SAAUjB,GAChD7oE,KAAK4oE,WAAaC,EACbA,IACD7oE,KAAK+oE,YAAc,OAGpBR,EA5MwB,CA6MjC,IClQE,GAAwC,WACxC,IAAIhpE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA2J7B,GA1HkB,SAAUu7B,GAKvC,SAASyuC,EAAYl5B,GACjB,IAAI/0B,EAAQ9b,KACRsX,EAAUu5B,GAA4B,GACtCm5B,EAA+D,EAmCnE,OAlCKA,EAAerH,WAChBqH,EAAerH,SAAWzoC,KAE9Bpe,EAAQwf,EAAOpgC,KAAK8E,KAAMgqE,IAAmBhqE,MAKvCiqE,QAAU,KAKhBnuD,EAAMwpD,gBAAahxC,EAKnBxY,EAAMouD,WAAY,EAKlBpuD,EAAMquD,eAAiB,EAKvBruD,EAAMsuD,gBAAmC91C,IAAtBhd,EAAQrI,UAA0BqI,EAAQrI,UAAY,GAKzE6M,EAAM+kD,eAAiCvsC,IAArBhd,EAAQsB,SAAyBtB,EAAQsB,SAAW,IAC/DkD,EA6EX,OAvHA,GAAUiuD,EAAazuC,GAgDvByuC,EAAYptE,UAAU6lE,gBAAkB,SAAUtG,GAC9C,IAAImO,EAAgB,EAChBC,EAAStqE,KAAK8iE,eAAe,GAC7ByH,EAASvqE,KAAK8iE,eAAe,GAE7BpkD,EAAQpc,KAAKuK,MAAM09D,EAAOt0B,QAAUq0B,EAAOr0B,QAASs0B,EAAOv0B,QAAUs0B,EAAOt0B,SAChF,QAAwB1hB,IAApBt0B,KAAKslE,WAA0B,CAC/B,IAAIz5D,EAAQ6S,EAAQ1e,KAAKslE,WACzBtlE,KAAKmqE,gBAAkBt+D,GAClB7L,KAAKkqE,WAAa5nE,KAAK4M,IAAIlP,KAAKmqE,gBAAkBnqE,KAAKoqE,aACxDpqE,KAAKkqE,WAAY,GAErBG,EAAgBx+D,EAEpB7L,KAAKslE,WAAa5mD,EAClB,IAAI/S,EAAMuwD,EAAgBvwD,IACtBirD,EAAOjrD,EAAIqvD,UACf,GAAIpE,EAAKjF,iBAAiBhzB,WAAa4hB,GAAvC,CAMA,IAAIoa,EAAmBhvD,EAAIgkC,cAAc/xB,wBACrConD,EAAW,GAAqBhlE,KAAK8iE,gBACzCkC,EAAS,IAAMrK,EAAiBnmD,KAChCwwD,EAAS,IAAMrK,EAAiBlmD,IAChCzU,KAAKiqE,QAAUt+D,EAAI0uD,+BAA+B2K,GAE9ChlE,KAAKkqE,YACLv+D,EAAI48B,SACJquB,EAAK3B,uBAAuBoV,EAAerqE,KAAKiqE,YAQxDF,EAAYptE,UAAU+lE,cAAgB,SAAUxG,GAC5C,QAAIl8D,KAAK8iE,eAAeziE,OAAS,KACnB67D,EAAgBvwD,IACXqvD,UACVtF,eAAe11D,KAAK6gE,YAClB,IAWfkJ,EAAYptE,UAAU4lE,gBAAkB,SAAUrG,GAC9C,GAAIl8D,KAAK8iE,eAAeziE,QAAU,EAAG,CACjC,IAAIsL,EAAMuwD,EAAgBvwD,IAQ1B,OAPA3L,KAAKiqE,QAAU,KACfjqE,KAAKslE,gBAAahxC,EAClBt0B,KAAKkqE,WAAY,EACjBlqE,KAAKmqE,eAAiB,EACjBnqE,KAAK4iE,wBACNj3D,EAAIqvD,UAAUvF,oBAEX,EAGP,OAAO,GAGRsU,EAxHqB,CAyH9B1H,IC1JE,GAAwC,WACxC,IAAI9iE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAuI7B,GAzGgB,SAAUu7B,GAKrC,SAASkvC,EAAU35B,GACf,IAAI/0B,EAAQ9b,KACRsX,EAAUu5B,GAA4B,GACtCm5B,EAA+D,EAyBnE,OAxBKA,EAAerH,WAChBqH,EAAerH,SAAWzoC,KAE9Bpe,EAAQwf,EAAOpgC,KAAK8E,KAAMgqE,IAAmBhqE,MAKvCiqE,QAAU,KAKhBnuD,EAAM+kD,eAAiCvsC,IAArBhd,EAAQsB,SAAyBtB,EAAQsB,SAAW,IAKtEkD,EAAM2uD,mBAAgBn2C,EAKtBxY,EAAM4uD,gBAAkB,EACjB5uD,EAsEX,OAtGA,GAAU0uD,EAAWlvC,GAsCrBkvC,EAAU7tE,UAAU6lE,gBAAkB,SAAUtG,GAC5C,IAAIyO,EAAa,EACbL,EAAStqE,KAAK8iE,eAAe,GAC7ByH,EAASvqE,KAAK8iE,eAAe,GAC7BzxD,EAAKi5D,EAAOt0B,QAAUu0B,EAAOv0B,QAC7B1kC,EAAKg5D,EAAOr0B,QAAUs0B,EAAOt0B,QAE7BivB,EAAW5iE,KAAKsK,KAAKyE,EAAKA,EAAKC,EAAKA,QACbgjB,IAAvBt0B,KAAKyqE,gBACLE,EAAa3qE,KAAKyqE,cAAgBvF,GAEtCllE,KAAKyqE,cAAgBvF,EACrB,IAAIv5D,EAAMuwD,EAAgBvwD,IACtBirD,EAAOjrD,EAAIqvD,UACG,GAAd2P,IACA3qE,KAAK0qE,gBAAkBC,GAG3B,IAAIhQ,EAAmBhvD,EAAIgkC,cAAc/xB,wBACrConD,EAAW,GAAqBhlE,KAAK8iE,gBACzCkC,EAAS,IAAMrK,EAAiBnmD,KAChCwwD,EAAS,IAAMrK,EAAiBlmD,IAChCzU,KAAKiqE,QAAUt+D,EAAI0uD,+BAA+B2K,GAElDr5D,EAAI48B,SACJquB,EAAKhC,yBAAyB+V,EAAY3qE,KAAKiqE,UAOnDO,EAAU7tE,UAAU+lE,cAAgB,SAAUxG,GAC1C,GAAIl8D,KAAK8iE,eAAeziE,OAAS,EAAG,CAChC,IACIu2D,EADMsF,EAAgBvwD,IACXqvD,UACXr8C,EAAY3e,KAAK0qE,gBAAkB,EAAI,GAAK,EAEhD,OADA9T,EAAKlB,eAAe11D,KAAK6gE,UAAWliD,IAC7B,EAGP,OAAO,GAQf6rD,EAAU7tE,UAAU4lE,gBAAkB,SAAUrG,GAC5C,GAAIl8D,KAAK8iE,eAAeziE,QAAU,EAAG,CACjC,IAAIsL,EAAMuwD,EAAgBvwD,IAO1B,OANA3L,KAAKiqE,QAAU,KACfjqE,KAAKyqE,mBAAgBn2C,EACrBt0B,KAAK0qE,gBAAkB,EAClB1qE,KAAK4iE,wBACNj3D,EAAIqvD,UAAUvF,oBAEX,EAGP,OAAO,GAGR+U,EAvGmB,CAwG5BnI,ICtIF,IAAI,GAAwC,WACxC,IAAI9iE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA8F7B,GAxBU,SAAUu7B,GAK/B,SAASsvC,EAAItzD,GAYT,OAVAA,EAAU,GAAO,GAAIA,IACRi/C,WACTj/C,EAAQi/C,SCjCb,SAAkB1lB,GACrB,IAAIv5B,EAAUu5B,GAA4B,GACtC0lB,EAAW,IAAI,GAanB,YAZmCjiC,IAAjBhd,EAAQzB,MAAqByB,EAAQzB,OAEnD0gD,EAAS11D,KAAK,IAAI,GAAKyW,EAAQuzD,oBAEIv2C,IAAnBhd,EAAQtH,QAAuBsH,EAAQtH,SAEvDumD,EAAS11D,KAAK,IAAI,GAAOyW,EAAQwzD,sBAEYx2C,IAAxBhd,EAAQyzD,aAA4BzzD,EAAQyzD,cAEjExU,EAAS11D,KAAK,IAAI,GAAYyW,EAAQ0zD,qBAEnCzU,EDkBoB,IAElBj/C,EAAQk/C,eACTl/C,EAAQk/C,aEFb,SAAkB3lB,GACrB,IAAIv5B,EAAUu5B,GAA4B,GACtC2lB,EAAe,IAAI,GACnBgO,EAAU,IAAI,IAAS,KAAO,IAAM,KAoDxC,YAnDwDlwC,IAA/Bhd,EAAQ2zD,oBAC3B3zD,EAAQ2zD,qBAGVzU,EAAa31D,KAAK,IAAI,UAEwByzB,IAA5Bhd,EAAQ4zD,iBAAgC5zD,EAAQ4zD,kBAElE1U,EAAa31D,KAAK,IAAI,GAAgB,CAClCgL,MAAOyL,EAAQ6zD,UACfvyD,SAAUtB,EAAQ8zD,sBAGQ92C,IAApBhd,EAAQ+zD,SAAwB/zD,EAAQ+zD,UAElD7U,EAAa31D,KAAK,IAAI,GAAQ,CAC1BikE,YAAaxtD,EAAQwtD,YACrBN,QAASA,WAGyBlwC,IAAxBhd,EAAQg0D,aAA4Bh0D,EAAQg0D,cAE1D9U,EAAa31D,KAAK,IAAI,UAEYyzB,IAAtBhd,EAAQi0D,WAA0Bj0D,EAAQi0D,YAEtD/U,EAAa31D,KAAK,IAAI,GAAU,CAC5B+X,SAAUtB,EAAQ8zD,sBAGU92C,IAArBhd,EAAQk0D,UAAyBl0D,EAAQk0D,YAEpDhV,EAAa31D,KAAK,IAAI,IACtB21D,EAAa31D,KAAK,IAAI,GAAa,CAC/BgL,MAAOyL,EAAQ6zD,UACfvyD,SAAUtB,EAAQ8zD,uBAGsB92C,IAA3Bhd,EAAQm0D,gBAA+Bn0D,EAAQm0D,iBAEhEjV,EAAa31D,KAAK,IAAI,GAAe,CACjCikE,YAAaxtD,EAAQwtD,YACrBlsD,SAAUtB,EAAQ8zD,sBAGoB92C,IAA1Bhd,EAAQo0D,eAA8Bp0D,EAAQo0D,gBAE9DlV,EAAa31D,KAAK,IAAI,GAAS,CAC3B+X,SAAUtB,EAAQ8zD,gBAGnB5U,EFrDwB,CAAoB,CACvCsO,aAAa,KAGbxpC,EAAOpgC,KAAK8E,KAAMsX,IAAYtX,KAM1C,OArBA,GAAU4qE,EAAKtvC,GAkBfsvC,EAAIjuE,UAAUgtC,eAAiB,WAC3B,OAAO,IAAIyF,GAAqBpvC,OAE7B4qE,EAtBa,CAuBtB,IGvFa,GACF,UADE,GAEiB,yBCR5B,GAAwC,WACxC,IAAIrrE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA4I7B4rE,GApEoB,SAAUrwC,GAKzC,SAASswC,EAAc/6B,GACnB,IAAI/0B,EAAQ9b,KACRsX,EAAUu5B,GAA4B,GACtC3I,EAAc,GAAO,GAAI5wB,GAoB7B,cAnBO4wB,EAAY2jC,eACZ3jC,EAAY4jC,wBACnBhwD,EAAQwf,EAAOpgC,KAAK8E,KAAMkoC,IAAgBloC,MAIpCmX,GAIN2E,EAAM8nB,KAIN9nB,EAAM+nB,GACN/nB,EAAMiwD,gBAA+Bz3C,IAApBhd,EAAQu0D,QAAwBv0D,EAAQu0D,QAAU,GACnE/vD,EAAMkwD,+BAA6D13C,IAAnChd,EAAQw0D,wBAClCx0D,EAAQw0D,wBAEPhwD,EAsCX,OAjEA,GAAU8vD,EAAetwC,GAmCzBswC,EAAcjvE,UAAUsvE,WAAa,WACjC,OAA8BjsE,KAAKpE,IAAIswE,KAQ3CN,EAAcjvE,UAAUovE,WAAa,SAAUF,GAC3C7rE,KAAKyhC,IAAIyqC,GAAsBL,IAQnCD,EAAcjvE,UAAUwvE,0BAA4B,WAChD,OAA+BnsE,KAAKpE,IAAIswE,KAQ5CN,EAAcjvE,UAAUqvE,0BAA4B,SAAUF,GAC1D9rE,KAAKyhC,IAAIyqC,GAAyCJ,IAE/CF,EAlEuB,CAmEhC,ICrIa,GACL,EADK,GAEF,EAFE,GAGH,EAHG,GAIJ,ECVP,GAAwC,WACxC,IAAIrsE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAyL7B,GA/JoB,SAAUu7B,GAKzC,SAAS8wC,EAAc/lC,GACnB,IAAIvqB,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAYjC,OAVA8b,EAAMuwD,wBAA0BvwD,EAAMwwD,mBAAmB/vE,KAAKuf,GAK9DA,EAAMywD,OAASlmC,EAIfvqB,EAAM0wD,uBAAyB,KACxB1wD,EA2IX,OA5JA,GAAUswD,EAAe9wC,GAyBzB8wC,EAAczvE,UAAUosC,YAAc,SAAUC,GAC5C,OAAO,MAQXojC,EAAczvE,UAAU2sC,aAAe,SAAUH,GAC7C,OAAO,MASXijC,EAAczvE,UAAU4sC,YAAc,SAAUJ,EAAYnlB,GACxD,OAAO,MAQXooD,EAAczvE,UAAU8vE,mBAAqB,SAAUC,EAAO72D,EAAM6iC,GAC3Dg0B,EAAM72D,KACP62D,EAAM72D,GAAQ,IAElB62D,EAAM72D,GAAM6iC,EAAKi0B,UAAUnkE,YAAckwC,GAY7C0zB,EAAczvE,UAAUiwE,uBAAyB,SAAUl+D,EAAQw7B,EAAYwiC,GAC3E,OAOA,SAAU72D,EAAMg3D,GACZ,IAAInrD,EAAW1hB,KAAKysE,mBAAmBlwE,KAAKyD,KAAM0sE,EAAO72D,GACzD,OAAOnH,EAAOo+D,kBAAkB5iC,EAAYr0B,EAAMg3D,EAAWnrD,IAC/DnlB,KAAKyD,OAYXosE,EAAczvE,UAAUouC,2BAA6B,SAAUjP,EAAYqN,EAAY6B,EAActpB,EAAU7G,KAY/GuxD,EAAczvE,UAAU6zC,eAAiB,SAAUxH,EAAOG,EAAY6B,GAClE,OAAO,MAKXohC,EAAczvE,UAAUowE,SAAW,WAC/B,OAAO/sE,KAAKusE,QAMhBH,EAAczvE,UAAUsgE,mBAAqB,aAM7CmP,EAAczvE,UAAU2vE,mBAAqB,SAAU70D,GACOA,EAAY,OAC5DoxB,aAAemkC,IACrBhtE,KAAKitE,2BAUbb,EAAczvE,UAAUuwE,UAAY,SAAUprD,GAC1C,IAAIqrD,EAAarrD,EAAM+mB,WAQvB,OAPIskC,GAAcH,IAAqBG,GAAcH,IACjDlrD,EAAMnK,iBAAiBqsB,GAAkBhkC,KAAKqsE,yBAE9Cc,GAAcH,KACdlrD,EAAMC,OACNorD,EAAarrD,EAAM+mB,YAEhBskC,GAAcH,IAKzBZ,EAAczvE,UAAUswE,wBAA0B,WAC9C,IAAI5mC,EAAQrmC,KAAK+sE,WACb1mC,EAAMM,cAAgBN,EAAMK,kBAAoB,IAChDL,EAAMtC,WAGPqoC,EA7JuB,CA8JhC,ICxLE,GAAwC,WACxC,IAAI7sE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAyP7B,GA3N0B,SAAUu7B,GAK/C,SAAS8xC,EAAoB/mC,GACzB,IAAIvqB,EAAQwf,EAAOpgC,KAAK8E,KAAMqmC,IAAUrmC,KAwCxC,OAnCA8b,EAAM4zB,UAAY,KAKlB5zB,EAAMuxD,mBAONvxD,EAAMwxD,czGrBH,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,GyG4BnBxxD,EAAMyxD,ezG5BH,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,GyGmCnBzxD,EAAM4wB,sBzGnCH,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,GyGuCnB5wB,EAAM6wB,QAAU,KAIhB7wB,EAAM0xD,iBAAkB,EACjB1xD,EA2KX,OAxNA,GAAUsxD,EAAqB9xC,GAqD/B8xC,EAAoBzwE,UAAU8wE,aAAe,SAAUzpD,EAAQvR,EAAWwG,GACtE,IACIy2B,EAAW/C,EADX+gC,EAAiB1tE,KAAK+sE,WAAW9mC,eAEjCjiB,GACAA,EAAOza,MAAM0P,UAAYq0B,GAAWr0B,IACpC+K,EAAOte,YAAcgoE,KACjB9/B,EAAS5pB,EAAO7H,6BACEwxD,oBAClBhhC,EAAUiB,EAAOE,WAAW,QAepC,GAZInB,GAAWA,EAAQiB,OAAOrkC,MAAMkJ,YAAcA,GAE9CzS,KAAK0vC,UAAY1rB,EACjBhkB,KAAK2sC,QAAUA,EACf3sC,KAAKwtE,iBAAkB,GAElBxtE,KAAKwtE,kBAEVxtE,KAAK0vC,UAAY,KACjB1vC,KAAK2sC,QAAU,KACf3sC,KAAKwtE,iBAAkB,IAEtBxtE,KAAK0vC,UAAW,EACjBA,EAAYnrC,SAASS,cAAc,QACzBU,UAAYgoE,EACtB,IAAInkE,EAAQmmC,EAAUnmC,MACtBA,EAAM/C,SAAW,WACjB+C,EAAMtG,MAAQ,OACdsG,EAAMrG,OAAS,OAEf,IAAI0qC,GADJjB,EAAUY,MACWK,OACrB8B,EAAU51B,YAAY8zB,IACtBrkC,EAAQqkC,EAAOrkC,OACT/C,SAAW,WACjB+C,EAAMiL,KAAO,IACbjL,EAAMqkE,gBAAkB,WACxB5tE,KAAK0vC,UAAYA,EACjB1vC,KAAK2sC,QAAUA,IASvBygC,EAAoBzwE,UAAUkxE,cAAgB,SAAUlhC,EAASxD,EAAY3M,GACzE,IAAIsxC,EAAU/vC,GAAWvB,GACrBuxC,EAAWjwC,GAAYtB,GACvBwxC,EAAcnwC,GAAerB,GAC7ByxC,EAAarwC,GAAcpB,GAC/Bl8B,GAAe6oC,EAAW0B,2BAA4BijC,GACtDxtE,GAAe6oC,EAAW0B,2BAA4BkjC,GACtDztE,GAAe6oC,EAAW0B,2BAA4BmjC,GACtD1tE,GAAe6oC,EAAW0B,2BAA4BojC,GACtD,IAAIC,EAAWluE,KAAK0sC,sBACpBpsC,GAAe4tE,EAAUJ,GACzBxtE,GAAe4tE,EAAUH,GACzBztE,GAAe4tE,EAAUF,GACzB1tE,GAAe4tE,EAAUD,GACzBthC,EAAQwhC,OACRxhC,EAAQyhC,YACRzhC,EAAQ0hC,OAAO/rE,KAAK+F,MAAMylE,EAAQ,IAAKxrE,KAAK+F,MAAMylE,EAAQ,KAC1DnhC,EAAQ2hC,OAAOhsE,KAAK+F,MAAM0lE,EAAS,IAAKzrE,KAAK+F,MAAM0lE,EAAS,KAC5DphC,EAAQ2hC,OAAOhsE,KAAK+F,MAAM2lE,EAAY,IAAK1rE,KAAK+F,MAAM2lE,EAAY,KAClErhC,EAAQ2hC,OAAOhsE,KAAK+F,MAAM4lE,EAAW,IAAK3rE,KAAK+F,MAAM4lE,EAAW,KAChEthC,EAAQrV,QAQZ81C,EAAoBzwE,UAAU4xE,qBAAuB,SAAUh2D,EAAMo0B,EAASxD,GAC1E,IAAI9C,EAAQrmC,KAAK+sE,WACjB,GAAI1mC,EAAM/E,YAAY/oB,GAAO,CACzB,IAAIu3B,EAAU,IAAI,GAAYv3B,EAAMvY,KAAK0sC,sBAAuBvD,EAAYwD,GAC5EtG,EAAMhuB,cAAcy3B,KAQ5Bs9B,EAAoBzwE,UAAU6xE,UAAY,SAAU7hC,EAASxD,GACzDnpC,KAAKuuE,qBAAqB,GAA2B5hC,EAASxD,IAOlEikC,EAAoBzwE,UAAU8xE,WAAa,SAAU9hC,EAASxD,GAC1DnpC,KAAKuuE,qBAAqB,GAA4B5hC,EAASxD,IAcnEikC,EAAoBzwE,UAAU+xE,mBAAqB,SAAU34C,EAAQ2I,EAAYC,EAAUw4B,EAAYl0D,EAAOC,EAAQgsD,GAClH,IAAIlzB,EAAM/4B,EAAQ,EACdg5B,EAAM/4B,EAAS,EACfyO,EAAKwlD,EAAaz4B,EAClB3sB,GAAMJ,EACNuqB,GAAOnG,EAAO,GAAKm5B,EACnB/yB,GAAOpG,EAAO,GAClB,OAAOgG,GAAiB/7B,KAAKstE,cAAetxC,EAAKC,EAAKtqB,EAAII,GAAK4sB,EAAUzC,EAAKC,IAUlFixC,EAAoBzwE,UAAU6zC,eAAiB,SAAUxH,EAAOG,EAAY6B,GACxE,IAWI9gC,EAXAykE,EAAcruE,GAAeN,KAAK0sC,sBAAuB1D,EAAM7nC,SAC/DwrC,EAAU3sC,KAAK2sC,QAEfiiC,EADQ5uE,KAAK+sE,WACOnmC,YACxB,GAAIgoC,IAGK/xC,GAAmB+xC,EAFDtuE,GAAe6oC,EAAW2B,2BAA4B9B,EAAM7nC,UAG/E,OAAO,KAIf,IACI,IAAIwC,EAAIrB,KAAK+F,MAAMsmE,EAAY,IAC3B/qE,EAAItB,KAAK+F,MAAMsmE,EAAY,IAC3BE,EAAYtqE,SAASS,cAAc,UACnC8pE,EAAaD,EAAU/gC,WAAW,MACtC+gC,EAAU5rE,MAAQ,EAClB4rE,EAAU3rE,OAAS,EACnB4rE,EAAWC,UAAU,EAAG,EAAG,EAAG,GAC9BD,EAAWE,UAAUriC,EAAQiB,OAAQjqC,EAAGC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC1DsG,EAAO4kE,EAAWG,aAAa,EAAG,EAAG,EAAG,GAAG/kE,KAE/C,MAAOnM,GACH,MAAiB,kBAAbA,EAAIzC,KAEG,IAAI4zE,WAERhlE,EAEX,OAAgB,IAAZA,EAAK,GACE,KAEJA,GAEJkjE,EAzN6B,CA0NtC,ICjPE+B,GAA2B,WAO3B,SAASA,EAAUhtD,EAAMF,EAAMG,EAAMF,GAIjCliB,KAAKmiB,KAAOA,EAIZniB,KAAKiiB,KAAOA,EAIZjiB,KAAKoiB,KAAOA,EAIZpiB,KAAKkiB,KAAOA,EAkFhB,OA5EAitD,EAAUxyE,UAAU0Y,SAAW,SAAUs3D,GACrC,OAAO3sE,KAAK88B,WAAW6vC,EAAU,GAAIA,EAAU,KAMnDwC,EAAUxyE,UAAUyyE,kBAAoB,SAAUvC,GAC9C,OAAQ7sE,KAAKmiB,MAAQ0qD,EAAU1qD,MAC3B0qD,EAAU5qD,MAAQjiB,KAAKiiB,MACvBjiB,KAAKoiB,MAAQyqD,EAAUzqD,MACvByqD,EAAU3qD,MAAQliB,KAAKkiB,MAO/BitD,EAAUxyE,UAAUmgC,WAAa,SAAUn5B,EAAGC,GAC1C,OAAO5D,KAAKmiB,MAAQxe,GAAKA,GAAK3D,KAAKiiB,MAAQjiB,KAAKoiB,MAAQxe,GAAKA,GAAK5D,KAAKkiB,MAM3EitD,EAAUxyE,UAAUk9B,OAAS,SAAUgzC,GACnC,OAAQ7sE,KAAKmiB,MAAQ0qD,EAAU1qD,MAC3BniB,KAAKoiB,MAAQyqD,EAAUzqD,MACvBpiB,KAAKiiB,MAAQ4qD,EAAU5qD,MACvBjiB,KAAKkiB,MAAQ2qD,EAAU3qD,MAK/BitD,EAAUxyE,UAAUoJ,OAAS,SAAU8mE,GAC/BA,EAAU1qD,KAAOniB,KAAKmiB,OACtBniB,KAAKmiB,KAAO0qD,EAAU1qD,MAEtB0qD,EAAU5qD,KAAOjiB,KAAKiiB,OACtBjiB,KAAKiiB,KAAO4qD,EAAU5qD,MAEtB4qD,EAAUzqD,KAAOpiB,KAAKoiB,OACtBpiB,KAAKoiB,KAAOyqD,EAAUzqD,MAEtByqD,EAAU3qD,KAAOliB,KAAKkiB,OACtBliB,KAAKkiB,KAAO2qD,EAAU3qD,OAM9BitD,EAAUxyE,UAAUyhC,UAAY,WAC5B,OAAOp+B,KAAKkiB,KAAOliB,KAAKoiB,KAAO,GAKnC+sD,EAAUxyE,UAAU6+D,QAAU,WAC1B,MAAO,CAACx7D,KAAKm+B,WAAYn+B,KAAKo+B,cAKlC+wC,EAAUxyE,UAAUwhC,SAAW,WAC3B,OAAOn+B,KAAKiiB,KAAOjiB,KAAKmiB,KAAO,GAMnCgtD,EAAUxyE,UAAUwrD,WAAa,SAAU0kB,GACvC,OAAQ7sE,KAAKmiB,MAAQ0qD,EAAU5qD,MAC3BjiB,KAAKiiB,MAAQ4qD,EAAU1qD,MACvBniB,KAAKoiB,MAAQyqD,EAAU3qD,MACvBliB,KAAKkiB,MAAQ2qD,EAAUzqD,MAExB+sD,EAzGmB,GAmHvB,SAAS,GAAehtD,EAAMF,EAAMG,EAAMF,EAAM2qD,GACnD,YAAkBv4C,IAAdu4C,GACAA,EAAU1qD,KAAOA,EACjB0qD,EAAU5qD,KAAOA,EACjB4qD,EAAUzqD,KAAOA,EACjByqD,EAAU3qD,KAAOA,EACV2qD,GAGA,IAAIsC,GAAUhtD,EAAMF,EAAMG,EAAMF,GAGhC,UCtIX,GAAwC,WACxC,IAAI3iB,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAkCxC,GAAyC,SAAUu7B,GAKnD,SAAS+zC,EAAwBC,GAC7B,IAAIxzD,EAAQwf,EAAOpgC,KAAK8E,KAAMsvE,IAActvE,KA8C5C,OAzCA8b,EAAMyzD,eAAgB,EAKtBzzD,EAAM0zD,gBAAkB,KAKxB1zD,EAAM2zD,mBAKN3zD,EAAM4zD,mBAAqB,KAK3B5zD,EAAM6zD,iBAKN7zD,EAAM8zD,cAAgB,GAKtB9zD,EAAM+zD,WAAY,EAKlB/zD,EAAMg0D,UxG8GH,CAACh7D,IAAUA,KAAU,KAAW,KwGzGnCgH,EAAMi0D,cAAgB,IAAI,GAAU,EAAG,EAAG,EAAG,GACtCj0D,EAiaX,OApdA,GAAUuzD,EAAyB/zC,GA0DnC+zC,EAAwB1yE,UAAUqzE,eAAiB,SAAUt3B,GACzD,IAAI42B,EAAYtvE,KAAK+sE,WACjBkD,EAAYv3B,EAAK7P,WACjBijC,EAAyBwD,EAAUnD,4BACvC,OAAQ8D,GAAat3B,IACjBs3B,GAAat3B,IACZs3B,GAAat3B,KAAoBmzB,GAS1CuD,EAAwB1yE,UAAUuzE,QAAU,SAAUjkE,EAAGtI,EAAGC,EAAGulC,GAC3D,IAAIguB,EAAahuB,EAAWguB,WACxBjtB,EAAaf,EAAWnB,UAAUkC,WAClColC,EAAYtvE,KAAK+sE,WAEjBr0B,EADa42B,EAAU1mC,YACLsnC,QAAQjkE,EAAGtI,EAAGC,EAAGuzD,EAAYjtB,GAcnD,OAbIwO,EAAK7P,YAAc8P,KACd22B,EAAUnD,4BAINmD,EAAUrD,aAAe,IAE9BjsE,KAAK6vE,WAAY,GAJjBn3B,EAAKy3B,SAASx3B,KAOjB34C,KAAKgwE,eAAet3B,KACrBA,EAAOA,EAAK03B,kBAET13B,GAQX22B,EAAwB1yE,UAAU8vE,mBAAqB,SAAUC,EAAO72D,EAAM6iC,GAC1E,QAAI14C,KAAKgwE,eAAet3B,IACbpd,EAAO3+B,UAAU8vE,mBAAmBvxE,KAAK8E,KAAM0sE,EAAO72D,EAAM6iC,IAS3E22B,EAAwB1yE,UAAU2sC,aAAe,SAAUH,GACvD,QAASnpC,KAAK+sE,WAAWnkC,aAQ7BymC,EAAwB1yE,UAAU4sC,YAAc,SAAUJ,EAAYnlB,GAClE,IAAI+jB,EAAaoB,EAAWK,iBAAiBL,EAAW8G,YACpDjI,EAAYmB,EAAWnB,UACvBkC,EAAalC,EAAUkC,WACvBmmC,EAAiBroC,EAAUtJ,WAC3B4xC,EAAatoC,EAAUjS,OACvB4I,EAAWqJ,EAAUrJ,SACrBw4B,EAAahuB,EAAWguB,WACxBmY,EAAYtvE,KAAK+sE,WACjBwD,EAAajB,EAAU1mC,YACvB4nC,EAAiBD,EAAWtsC,cAC5BkX,EAAWo1B,EAAWE,yBAAyBvmC,GAC/Cj+B,EAAIkvC,EAASu1B,kBAAkBL,EAAgBE,EAAWI,YAC1D5U,EAAiB5gB,EAAS8T,cAAchjD,GACxCuwB,EAAS2M,EAAW3M,OACpBoyC,EAAc7mC,EAAWvL,QAAUuiB,GAAehX,EAAWvL,OAAQ0N,GACrE0kC,IACApyC,EAAS8C,GAAgB9C,EAAQuiB,GAAehX,EAAWvL,OAAQ0N,KAEvE,IAAI0mC,EAAiBL,EAAWM,kBAAkB1Z,GAE9Cl0D,EAAQX,KAAK+F,MAAM8gC,EAAWr1B,KAAK,GAAK88D,GACxC1tE,EAASZ,KAAK+F,MAAM8gC,EAAWr1B,KAAK,GAAK88D,GAC7C,GAAIjyC,EAAU,CACV,IAAI7qB,EAAOxR,KAAK+F,MAAM/F,KAAKsK,KAAK3J,EAAQA,EAAQC,EAASA,IACzDD,EAAQ6Q,EACR5Q,EAAS4Q,EAEb,IAAIzC,EAAM0qD,EAAiB94D,EAAS,EAAI2tE,EACpCt/D,EAAMyqD,EAAiB74D,EAAU,EAAI0tE,EACrCE,EAAe,CACfR,EAAW,GAAKj/D,EAChBi/D,EAAW,GAAKh/D,EAChBg/D,EAAW,GAAKj/D,EAChBi/D,EAAW,GAAKh/D,GAEhBu7D,EAAY1xB,EAAS41B,0BAA0Bv0C,EAAQvwB,GAIvD+kE,EAAiB,GACrBA,EAAe/kE,GAAK,GACpB,IAAIglE,EAAkBjxE,KAAK4sE,uBAAuB2D,EAAYrmC,EAAY8mC,GACtElB,EAAY9vE,KAAK8vE,UACjBoB,EAAelxE,KAAK+vE,cACxB/vE,KAAK6vE,WAAY,EACjB,IAAK,IAAIlsE,EAAIkpE,EAAU1qD,KAAMxe,GAAKkpE,EAAU5qD,OAAQte,EAChD,IAAK,IAAIC,EAAIipE,EAAUzqD,KAAMxe,GAAKipE,EAAU3qD,OAAQte,EAAG,CACnD,IAAI80C,EAAO14C,KAAKkwE,QAAQjkE,EAAGtI,EAAGC,EAAGulC,GACjC,GAAInpC,KAAKgwE,eAAet3B,GAAO,CAC3B,IAAIy4B,EAAM92C,GAAOr6B,MACjB,GAAI04C,EAAK7P,YAAc8P,GAAkB,CACrCq4B,EAAe/kE,GAAGysC,EAAKi0B,UAAUnkE,YAAckwC,EAC/C,IAAI04B,EAAe14B,EAAK04B,aAAaD,GAChCnxE,KAAK6vE,YACLuB,IAAsD,IAAtCpxE,KAAK4vE,cAAc3mE,QAAQyvC,KAC5C14C,KAAK6vE,WAAY,GAGzB,GAA4C,IAAxCn3B,EAAK24B,SAASF,EAAKhoC,EAAWze,MAE9B,SAGR,IAAI4mD,EAAiBn2B,EAASo2B,2BAA2B74B,EAAKi0B,UAAWuE,EAAcpB,GACnF0B,GAAU,EACVF,IACAE,EAAUP,EAAgBhlE,EAAI,EAAGqlE,IAEhCE,GACDr2B,EAASs2B,gCAAgC/4B,EAAKi0B,UAAWsE,EAAiBC,EAAcpB,GAIpG,IAAI4B,EAAc3V,EAAiBsU,EAEnCt0C,GAAiB/7B,KAAKutE,eAAgBpkC,EAAWr1B,KAAK,GAAK,EAAGq1B,EAAWr1B,KAAK,GAAK,EAAG,EAAI88D,EAAgB,EAAIA,EAAgBjyC,GAAW17B,EAAQ,GAAIC,EAAS,GAC9J,IAAIyuE,EAAkB,GAAkB3xE,KAAKutE,gBAC7CvtE,KAAKytE,aAAazpD,EAAQ2tD,EAAiB5pC,EAAW9uB,SACtD,IAAI0zB,EAAU3sC,KAAK2sC,QACfiB,EAASjB,EAAQiB,OACrBxR,GAAYp8B,KAAK0sC,sBAAuB1sC,KAAKutE,gBAE7CxxC,GAAiB/7B,KAAKstE,cAAerqE,EAAQ,EAAGC,EAAS,EAAGwuE,EAAaA,EAAa,GAAIzuE,EAAQ,GAAIC,EAAS,GAC3G0qC,EAAO3qC,OAASA,GAAS2qC,EAAO1qC,QAAUA,GAC1C0qC,EAAO3qC,MAAQA,EACf2qC,EAAO1qC,OAASA,GAEVlD,KAAKwtE,iBACX7gC,EAAQoiC,UAAU,EAAG,EAAG9rE,EAAOC,GAE/B0rE,GACA5uE,KAAK6tE,cAAclhC,EAASxD,EAAYylC,GAE5C,GAAOjiC,EAAS4jC,EAAWqB,qBAC3B5xE,KAAKwuE,UAAU7hC,EAASxD,GACxBnpC,KAAK4vE,cAAcvvE,OAAS,EAE5B,IAEIwxE,EAAOC,EAAQC,EAFfC,EAAKv2E,OAAOgiB,KAAKuzD,GAAgBrlE,IAAIoK,QACzCi8D,EAAG/oD,KAAK0Q,IAEmB,IAAvBoO,EAAW9uB,SACTjZ,KAAKwtE,kBACH+C,EAAW0B,UAAU9oC,EAAWnB,UAAUkC,aAI9C2nC,EAAQ,GACRC,EAAS,IAJTE,EAAKA,EAAG3yD,UAMZ,IAAK,IAAItkB,EAAIi3E,EAAG3xE,OAAS,EAAGtF,GAAK,IAAKA,EAAG,CACrC,IAAIm3E,EAAWF,EAAGj3E,GACdo3E,EAAuB5B,EAAW6B,iBAAiBF,EAAU/a,EAAYjtB,GAEzEmoC,EADoBl3B,EAAS8T,cAAcijB,GACRnW,EACnCuW,EAAOH,EAAqB,GAAKE,EAAeX,EAChDa,EAAOJ,EAAqB,GAAKE,EAAeX,EAChDc,EAAkBr3B,EAASs3B,yBAAyB10C,GAAW+yC,GAAeoB,GAC9EQ,EAAmBv3B,EAASw3B,mBAAmBH,GAC/CI,EAAWtyE,GAAeN,KAAKstE,cAAe,CAC7CsD,GAAkB8B,EAAiB,GAAK5B,EAAa,IAClD/U,EACH6U,GAAkBE,EAAa,GAAK4B,EAAiB,IAClD3W,IAEJ8W,EAAajC,EAAiBL,EAAWuC,uBAAuB5oC,GAChE6oC,GAAc/B,EAAekB,GACjC,IAAK,IAAIc,MAAgBD,GAAa,CAClC,IACIpG,IADAj0B,EAA4Dq6B,GAAYC,KACvDrG,UAEjBsG,GAAST,EAAgB,GAAK7F,GAAU,GACxCuG,GAAQ5wE,KAAK+F,MAAMuqE,EAAS,IAAMK,GAAS,GAAKX,GAChDa,GAASX,EAAgB,GAAK7F,GAAU,GACxCyG,GAAQ9wE,KAAK+F,MAAMuqE,EAAS,IAAMO,GAAS,GAAKZ,GAGhD79D,GAAIw+D,IAFJvvE,EAAIrB,KAAK+F,MAAMuqE,EAAS,GAAKK,GAASX,IAGtChnE,GAAI8nE,IAFJxvE,EAAItB,KAAK+F,MAAMuqE,EAAS,GAAKO,GAASZ,IAGtCc,GAAapnE,IAAMimE,EAEvB,KADId,EAAeiC,IAA+D,IAAjD36B,EAAK24B,SAASh3C,GAAOr6B,MAAOmpC,EAAWze,OAEpE,GAAImnD,EAAO,CAEPllC,EAAQwhC,OACR4D,EAAc,CAACpuE,EAAGC,EAAGD,EAAI+Q,GAAG9Q,EAAGD,EAAI+Q,GAAG9Q,EAAI0H,GAAG3H,EAAGC,EAAI0H,IACpD,IAAK,IAAIgoE,GAAM,EAAG52C,GAAKm1C,EAAMxxE,OAAQizE,GAAM52C,KAAM42C,GAC7C,GAAIrnE,IAAMimE,GAAYA,EAAWJ,EAAOwB,IAAM,CAC1C,IAAIh8C,GAAOu6C,EAAMyB,IACjB3mC,EAAQyhC,YAERzhC,EAAQ0hC,OAAO0D,EAAY,GAAIA,EAAY,IAC3CplC,EAAQ2hC,OAAOyD,EAAY,GAAIA,EAAY,IAC3CplC,EAAQ2hC,OAAOyD,EAAY,GAAIA,EAAY,IAC3CplC,EAAQ2hC,OAAOyD,EAAY,GAAIA,EAAY,IAE3CplC,EAAQ0hC,OAAO/2C,GAAK,GAAIA,GAAK,IAC7BqV,EAAQ2hC,OAAOh3C,GAAK,GAAIA,GAAK,IAC7BqV,EAAQ2hC,OAAOh3C,GAAK,GAAIA,GAAK,IAC7BqV,EAAQ2hC,OAAOh3C,GAAK,GAAIA,GAAK,IAC7BqV,EAAQrV,OAGhBu6C,EAAMhxE,KAAKkxE,GACXD,EAAOjxE,KAAKqxE,QAGZvlC,EAAQoiC,UAAUprE,EAAGC,EAAG8Q,GAAGpJ,IAGnCtL,KAAKuzE,cAAc76B,EAAMvP,EAAYxlC,EAAGC,EAAG8Q,GAAGpJ,GAAGunE,EAAYQ,IACzDxB,IAAUT,GACVzkC,EAAQ6mC,UACRxzE,KAAK4vE,cAAc6D,QAAQ/6B,IAG3B14C,KAAK4vE,cAAc/uE,KAAK63C,GAE5B14C,KAAK0zE,gBAAgBvqC,EAAWq0B,UAAW+S,EAAY73B,IAG/D14C,KAAK2vE,iBAAmBa,EACxBxwE,KAAKqtE,mBAAqBtR,EAC1B/7D,KAAKuvE,eACAvvE,KAAKwvE,kBAAoB,GAAOxvE,KAAKwvE,gBAAiBsB,GAC3D9wE,KAAKwvE,gBAAkBsB,EACvB9wE,KAAKyvE,mBAAqBtY,EAC1Bn3D,KAAK0vE,mBAAqBxlC,EAC1BlqC,KAAK2zE,kBAAkBxqC,EAAYonC,EAAYp1B,EAAUgc,EAAYjtB,EAAY1N,EAAQvwB,EAAGqjE,EAAUrD,cACtGjsE,KAAK4zE,oBAAoBzqC,EAAYonC,GACrCvwE,KAAKyuE,WAAW9hC,EAASxD,GACrBpB,EAAWvL,QACXmQ,EAAQ6mC,UAER7B,IAAoB/jC,EAAOrkC,MAAMkJ,YACjCm7B,EAAOrkC,MAAMkJ,UAAYk/D,GAE7B,IAAI14D,GAAUq0B,GAAWvF,EAAW9uB,SAChCy2B,GAAY1vC,KAAK0vC,UAIrB,OAHIz2B,KAAYy2B,GAAUnmC,MAAM0P,UAC5By2B,GAAUnmC,MAAM0P,QAAUA,IAEvBjZ,KAAK0vC,WAYhB2/B,EAAwB1yE,UAAU42E,cAAgB,SAAU76B,EAAMvP,EAAYxlC,EAAGC,EAAG8Q,EAAGpJ,EAAGuoE,EAAQR,GAC9F,IAAIvxD,EAAQ9hB,KAAK8zE,aAAap7B,GAC9B,GAAK52B,EAAL,CAGA,IAAIqvD,EAAM92C,GAAOr6B,MACb+zE,EAAQV,EAAa36B,EAAK24B,SAASF,EAAKhoC,EAAWze,MAAQ,EAC3DspD,EAAeD,IAAU/zE,KAAK2sC,QAAQsnC,YACtCD,IACAh0E,KAAK2sC,QAAQwhC,OACbnuE,KAAK2sC,QAAQsnC,YAAcF,GAE/B/zE,KAAK2sC,QAAQqiC,UAAUltD,EAAO+xD,EAAQA,EAAQ/xD,EAAM7e,MAAQ,EAAI4wE,EAAQ/xD,EAAM5e,OAAS,EAAI2wE,EAAQlwE,EAAGC,EAAG8Q,EAAGpJ,GACxG0oE,GACAh0E,KAAK2sC,QAAQ6mC,UAEH,IAAVO,EACA5qC,EAAWpZ,SAAU,EAEhBsjD,GACL36B,EAAKw7B,cAAc/C,KAM3B9B,EAAwB1yE,UAAUw3E,SAAW,WACzC,IAAIxnC,EAAU3sC,KAAK2sC,QACnB,OAAOA,EAAUA,EAAQiB,OAAS,MAQtCyhC,EAAwB1yE,UAAUm3E,aAAe,SAAUp7B,GACvD,OAAOA,EAAKy7B,YAOhB9E,EAAwB1yE,UAAUi3E,oBAAsB,SAAUzqC,EAAYonC,GAC1E,GAAIA,EAAWpvC,iBAAkB,CAM7B,IAAIizC,EAAqB,SAAU7D,EAAY5kE,EAAKw9B,GAChD,IAAI0yB,EAAgBxhC,GAAOk2C,GACvB1U,KAAiB1yB,EAAWq0B,WAC5B+S,EAAW8D,YAAYlrC,EAAWnB,UAAUkC,WAAYf,EAAWq0B,UAAU3B,KAEnFt/D,KAAK,KAAMg0E,GACbpnC,EAAWkD,oBAAoBxrC,KACmC,KAS1EwuE,EAAwB1yE,UAAU+2E,gBAAkB,SAAUlW,EAAW+S,EAAY73B,GAEjF,IAAImjB,EAAgBxhC,GAAOk2C,GACrB1U,KAAiB2B,IACnBA,EAAU3B,GAAiB,IAE/B2B,EAAU3B,GAAenjB,EAAKlX,WAAY,GAoB9C6tC,EAAwB1yE,UAAUg3E,kBAAoB,SAAUxqC,EAAYonC,EAAYp1B,EAAUgc,EAAYjtB,EAAY1N,EAAQ01C,EAAUrG,EAASyI,GACjJ,IAAIzY,EAAgBxhC,GAAOk2C,GACrB1U,KAAiB1yB,EAAW6yB,cAC9B7yB,EAAW6yB,YAAYH,GAAiB,IAE5C,IAIInjB,EAAMm0B,EAAW9Q,EAAgBp4D,EAAGC,EAAGqI,EAJvC+vD,EAAc7yB,EAAW6yB,YAAYH,GACrCW,EAAYrzB,EAAWqzB,UAEvB+X,EAAY,EAEhB,IAAKtoE,EAHSkvC,EAASpU,aAGL96B,GAAKimE,IAAYjmE,EAG/B,IAFA4gE,EAAY1xB,EAAS41B,0BAA0Bv0C,EAAQvwB,EAAG4gE,GAC1D9Q,EAAiB5gB,EAAS8T,cAAchjD,GACnCtI,EAAIkpE,EAAU1qD,KAAMxe,GAAKkpE,EAAU5qD,OAAQte,EAC5C,IAAKC,EAAIipE,EAAUzqD,KAAMxe,GAAKipE,EAAU3qD,OAAQte,EACxCsuE,EAAWjmE,GAAK4/D,KACd0I,GACF77B,EAAO63B,EAAWL,QAAQjkE,EAAGtI,EAAGC,EAAGuzD,EAAYjtB,IACtCrB,YAAc8P,KACnBqjB,EAAYtjB,EAAKlX,WAAY,EACxBg7B,EAAUjlB,YAAYmB,EAAKlX,WAC5Bg7B,EAAUzlB,QAAQ,CACd2B,EACAmjB,EACA1gB,EAASq5B,mBAAmB97B,EAAKi0B,WACjC5Q,UAIaznC,IAArBggD,GACAA,EAAiB57B,IAIrB63B,EAAWkE,QAAQxoE,EAAGtI,EAAGC,EAAGsmC,GAK5CqmC,EAAWmE,gBAAgBH,EAAWrqC,IAEnCmlC,EArdiC,CAsd1C,IAKF,GAAwB1yE,UAAUowE,SACnB,UC9fX,GAAwC,WACxC,IAAIxtE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAkD7B,GAlBgB,SAAUu7B,GAKrC,SAASq5C,EAAU9jC,GACf,OAAOvV,EAAOpgC,KAAK8E,KAAM6wC,IAAgB7wC,KAU7C,OAfA,GAAU20E,EAAWr5C,GAYrBq5C,EAAUh4E,UAAUgtC,eAAiB,WACjC,OAAO,IAAI,GAAwB3pC,OAEhC20E,EAhBmB,CAiB5BhJ,ICjDE,GAAwC,WACxC,IAAIpsE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAyS7B,GApNW,SAAUu7B,GAOhC,SAASs5C,EAAKjI,EAAWvmC,EAAOyK,GAC5B,IAAI/0B,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAC7BsX,EAAUu5B,GAA4B,GAoC1C,OAhCA/0B,EAAM6wD,UAAYA,EAKlB7wD,EAAMsqB,MAAQA,EAOdtqB,EAAM+4D,YAAc,KAOpB/4D,EAAMxf,IAAM,GAKZwf,EAAMg5D,iBACqBxgD,IAAvBhd,EAAQ+7D,WAA2B,IAAM/7D,EAAQ+7D,WAMrDv3D,EAAMi5D,kBAAoB,GACnBj5D,EAqKX,OAjNA,GAAU84D,EAAMt5C,GAiDhBs5C,EAAKj4E,UAAUonC,QAAU,WACrB/jC,KAAKqY,cAAc2rB,KAKvB4wC,EAAKj4E,UAAUq4E,QAAU,aAIzBJ,EAAKj4E,UAAU6kC,OAAS,WACpB,OAAOxhC,KAAK1D,IAAM,IAAM0D,KAAK2sE,WAQjCiI,EAAKj4E,UAAUyzE,eAAiB,WAC5B,IAAKpwE,KAAK60E,YAEN,OAAO70E,KAEX,IAAI04C,EAAO14C,KAAK60E,YAKhB,EAAG,CACC,GAAIn8B,EAAK7P,YAAc8P,GAInB,OADA34C,KAAK80E,YAAc,EACZp8B,EAEXA,EAAOA,EAAKm8B,kBACPn8B,GAET,OAAO14C,MAMX40E,EAAKj4E,UAAUs4E,oBAAsB,WACjC,GAAKj1E,KAAK60E,YAAV,CAGA,IAAIn8B,EAAO14C,KAAK60E,YACZnuE,EAA2B,KAC/B,EAAG,CACC,GAAIgyC,EAAK7P,YAAc8P,GAAkB,CAIrCD,EAAKm8B,YAAc,KACnB,MAEKn8B,EAAK7P,YAAc8P,GAGxBjyC,EAAOgyC,EAEFA,EAAK7P,YAAc8P,GAGxBjyC,EAAKmuE,YAAcn8B,EAAKm8B,YAGxBnuE,EAAOgyC,EAEXA,EAAOhyC,EAAKmuE,kBACPn8B,KAObk8B,EAAKj4E,UAAUu4E,aAAe,WAC1B,OAAOl1E,KAAK2sE,WAKhBiI,EAAKj4E,UAAUksC,SAAW,WACtB,OAAO7oC,KAAKomC,OAUhBwuC,EAAKj4E,UAAUwzE,SAAW,SAAU/pC,GAChC,GAAIpmC,KAAKomC,QAAUuS,IAAmB34C,KAAKomC,MAAQA,EAC/C,MAAM,IAAIpoC,MAAM,gCAEpBgC,KAAKomC,MAAQA,EACbpmC,KAAK+jC,WAST6wC,EAAKj4E,UAAUolB,KAAO,WAClB,MAQJ6yD,EAAKj4E,UAAU00E,SAAW,SAAU/2D,EAAIoQ,GACpC,IAAK1qB,KAAK80E,YACN,OAAO,EAEX,IAAI1pD,EAAQprB,KAAK+0E,kBAAkBz6D,GACnC,GAAK8Q,GAIA,IAAe,IAAXA,EACL,OAAO,OAJPA,EAAQV,EACR1qB,KAAK+0E,kBAAkBz6D,GAAM8Q,EAKjC,IAAIvf,EAAQ6e,EAAOU,EAAQ,IAAO,GAClC,OAAIvf,GAAS7L,KAAK80E,YACP,EAEJt0B,GAAO30C,EAAQ7L,KAAK80E,cAS/BF,EAAKj4E,UAAUy0E,aAAe,SAAU92D,GACpC,QAAKta,KAAK80E,cAG6B,IAAhC90E,KAAK+0E,kBAAkBz6D,IAMlCs6D,EAAKj4E,UAAUu3E,cAAgB,SAAU55D,GACjCta,KAAK80E,cACL90E,KAAK+0E,kBAAkBz6D,IAAO,IAG/Bs6D,EAlNc,CAmNvB,ICxSE,GAAwC,WACxC,IAAIr1E,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAsG7B,GA9EgB,SAAUu7B,GAQrC,SAAS65C,EAAU34C,EAAQkC,EAAYy4B,EAAY/wB,GAC/C,IAAItqB,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAqBjC,OAhBA8b,EAAM0gB,OAASA,EAKf1gB,EAAMo7C,YAAcC,EAKpBr7C,EAAM4iB,WAAaA,EAKnB5iB,EAAMsqB,MAAQA,EACPtqB,EA8CX,OA3EA,GAAUq5D,EAAW75C,GAkCrB65C,EAAUx4E,UAAUonC,QAAU,WAC1B/jC,KAAKqY,cAAc2rB,KAKvBmxC,EAAUx4E,UAAUiqC,UAAY,WAC5B,OAAO5mC,KAAKw8B,QAMhB24C,EAAUx4E,UAAUw3E,SAAW,WAC3B,OAAO,MAKXgB,EAAUx4E,UAAUy4E,cAAgB,WAChC,OAAOp1E,KAAKk3D,aAKhBie,EAAUx4E,UAAUsyD,cAAgB,WAChC,OAA8BjvD,KAAe,YAKjDm1E,EAAUx4E,UAAUksC,SAAW,WAC3B,OAAO7oC,KAAKomC,OAMhB+uC,EAAUx4E,UAAUolB,KAAO,WACvB,MAEGozD,EA5EmB,CA6E5B,ICrGE,GAAwC,WACxC,IAAI51E,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAyJrC,SAASs1E,GAAYvzD,EAAOwzD,EAAaC,GAC5C,IAAI5zD,EAAsC,EAC1C,GAAIA,EAAIE,KAAOqZ,GAAc,CACzB,IAAIs6C,EAAU7zD,EAAIwZ,SACds6C,GAAc,EAuBlB,OAnBAD,EACKrc,MAAK,WACFsc,GACAH,OAGHI,OAAM,SAAU50E,GACb20E,IAGmB,kBAAf30E,EAAMxF,MACY,wBAAlBwF,EAAM26B,QACN65C,IAGAC,QAlBG,WACXE,GAAc,GAuBtB,IAAIvX,EAAe,CACfz6B,GAAW9hB,EAAKqiB,GAAgBsxC,GAChC7xC,GAAW9hB,EAAKqiB,GAAiBuxC,IAErC,OAAO,WACHrX,EAAat0D,QAAQ85B,MAlJK,SAAUpI,GAUxC,SAASq6C,EAAan5C,EAAQkC,EAAYy4B,EAAYt1C,EAAK0f,EAAaq0C,GACpE,IAAI95D,EAAQwf,EAAOpgC,KAAK8E,KAAMw8B,EAAQkC,EAAYy4B,EAAY6V,KAAoBhtE,KA6BlF,OAxBA8b,EAAM+5D,KAAOh0D,EAKb/F,EAAMg6D,OAAS,IAAIl0D,MACC,OAAhB2f,IACAzlB,EAAMg6D,OAAOv0C,YAAcA,GAM/BzlB,EAAMi6D,UAAY,KAKlBj6D,EAAMsqB,MAAQ4mC,GAKdlxD,EAAMk6D,mBAAqBJ,EACpB95D,EAvCX,GAAU65D,EAAcr6C,GA6CxBq6C,EAAah5E,UAAUw3E,SAAW,WAC9B,OAAOn0E,KAAK81E,QAOhBH,EAAah5E,UAAUs5E,kBAAoB,WACvCj2E,KAAKomC,MAAQ4mC,GACbhtE,KAAKk2E,iBACLl2E,KAAK+jC,WAOT4xC,EAAah5E,UAAUw5E,iBAAmB,gBACd7hD,IAApBt0B,KAAK0+B,aACL1+B,KAAK0+B,WAAaN,GAAUp+B,KAAKw8B,QAAUx8B,KAAK81E,OAAO5yE,QAE3DlD,KAAKomC,MAAQ4mC,GACbhtE,KAAKk2E,iBACLl2E,KAAK+jC,WAQT4xC,EAAah5E,UAAUolB,KAAO,WACtB/hB,KAAKomC,OAAS4mC,IAAmBhtE,KAAKomC,OAAS4mC,KAC/ChtE,KAAKomC,MAAQ4mC,GACbhtE,KAAK+jC,UACL/jC,KAAKg2E,mBAAmBh2E,KAAMA,KAAK61E,MACnC71E,KAAK+1E,UAAYV,GAAYr1E,KAAK81E,OAAQ91E,KAAKm2E,iBAAiB55E,KAAKyD,MAAOA,KAAKi2E,kBAAkB15E,KAAKyD,SAMhH21E,EAAah5E,UAAUy5E,SAAW,SAAUt0D,GACxC9hB,KAAK81E,OAASh0D,EACd9hB,KAAK0+B,WAAaN,GAAUp+B,KAAKw8B,QAAUx8B,KAAK81E,OAAO5yE,QAO3DyyE,EAAah5E,UAAUu5E,eAAiB,WAChCl2E,KAAK+1E,YACL/1E,KAAK+1E,YACL/1E,KAAK+1E,UAAY,OArGI,CAyG/B,IA4Ca,IC9LX,GAAwC,WACxC,IAAIx2E,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA0J7B,ICjJXs2E,GDiJW,GApIgB,SAAU/6C,GAUrC,SAASg7C,EAAU3J,EAAWvmC,EAAOvkB,EAAK0f,EAAag1C,EAAkB1lC,GACrE,IAAI/0B,EAAQwf,EAAOpgC,KAAK8E,KAAM2sE,EAAWvmC,EAAOyK,IAAgB7wC,KAgChE,OA3BA8b,EAAM06D,aAAej1C,EAOrBzlB,EAAM+5D,KAAOh0D,EACb/F,EAAMxf,IAAMulB,EAKZ/F,EAAMg6D,OAAS,IAAIl0D,MACC,OAAhB2f,IACAzlB,EAAMg6D,OAAOv0C,YAAcA,GAM/BzlB,EAAMi6D,UAAY,KAKlBj6D,EAAM26D,kBAAoBF,EACnBz6D,EA6EX,OAvHA,GAAUw6D,EAAWh7C,GAiDrBg7C,EAAU35E,UAAUw3E,SAAW,WAC3B,OAAOn0E,KAAK81E,QAMhBQ,EAAU35E,UAAUy5E,SAAW,SAAUx3E,GACrCoB,KAAK81E,OAASl3E,EACdoB,KAAKomC,MAAQuS,GACb34C,KAAKk2E,iBACLl2E,KAAK+jC,WAOTuyC,EAAU35E,UAAUs5E,kBAAoB,WA0D5C,IACQS,EA1DA12E,KAAKomC,MAAQuS,GACb34C,KAAKk2E,iBACLl2E,KAAK81E,SAwDLY,EAAMnpC,GAAsB,EAAG,IAC/BopC,UAAY,gBAChBD,EAAIE,SAAS,EAAG,EAAG,EAAG,GACfF,EAAI9oC,QA1DP5tC,KAAK+jC,WAOTuyC,EAAU35E,UAAUw5E,iBAAmB,WACnC,IAAIr0D,EAAyC9hB,KAAW,OACpD8hB,EAAM+0D,cAAgB/0D,EAAMg1D,cAC5B92E,KAAKomC,MAAQuS,GAGb34C,KAAKomC,MAAQuS,GAEjB34C,KAAKk2E,iBACLl2E,KAAK+jC,WAMTuyC,EAAU35E,UAAUolB,KAAO,WACnB/hB,KAAKomC,OAASuS,KACd34C,KAAKomC,MAAQuS,GACb34C,KAAK81E,OAAS,IAAIl0D,MACQ,OAAtB5hB,KAAKw2E,eACLx2E,KAAK81E,OAAOv0C,YAAcvhC,KAAKw2E,eAGnCx2E,KAAKomC,OAASuS,KACd34C,KAAKomC,MAAQuS,GACb34C,KAAK+jC,UACL/jC,KAAKy2E,kBAAkBz2E,KAAMA,KAAK61E,MAClC71E,KAAK+1E,UAAYV,GAAYr1E,KAAK81E,OAAQ91E,KAAKm2E,iBAAiB55E,KAAKyD,MAAOA,KAAKi2E,kBAAkB15E,KAAKyD,SAQhHs2E,EAAU35E,UAAUu5E,eAAiB,WAC7Bl2E,KAAK+1E,YACL/1E,KAAK+1E,YACL/1E,KAAK+1E,UAAY,OAGlBO,EAxHmB,CAyH5B,IE6Na,GA1UoB,WAS/B,SAASS,EAAc7zB,EAAY8zB,EAAYC,EAAcC,EAAiBC,EAAgBC,GAK1Fp3E,KAAKq3E,YAAcn0B,EAKnBljD,KAAKs3E,YAAcN,EAEnB,IAAIO,EAAoB,GACpBC,EAAej5B,GAAav+C,KAAKs3E,YAAat3E,KAAKq3E,aAMvDr3E,KAAKy3E,cAAgB,SAAUr8E,GAC3B,IAAIkB,EAAMlB,EAAE,GAAK,IAAMA,EAAE,GAIzB,OAHKm8E,EAAkBj7E,KACnBi7E,EAAkBj7E,GAAOk7E,EAAap8E,IAEnCm8E,EAAkBj7E,IAM7B0D,KAAK03E,iBAAmBR,EAKxBl3E,KAAK23E,uBAAyBR,EAAiBA,EAK/Cn3E,KAAK43E,WAAa,GAMlB53E,KAAK63E,iBAAkB,EAKvB73E,KAAK83E,kBACD93E,KAAKq3E,YAAY/sC,cACX4sC,KACAl3E,KAAKq3E,YAAYzwC,aACnBzI,GAAS+4C,IAAoB/4C,GAASn+B,KAAKq3E,YAAYzwC,aAK/D5mC,KAAK+3E,kBAAoB/3E,KAAKq3E,YAAYzwC,YACpCzI,GAASn+B,KAAKq3E,YAAYzwC,aAC1B,KAKN5mC,KAAKg4E,kBAAoBh4E,KAAKs3E,YAAY1wC,YACpCzI,GAASn+B,KAAKs3E,YAAY1wC,aAC1B,KACN,IAAIqxC,EAAqBl6C,GAAWk5C,GAChCiB,EAAsBp6C,GAAYm5C,GAClCkB,EAAyBt6C,GAAeo5C,GACxCmB,EAAwBx6C,GAAcq5C,GACtCoB,EAAgBr4E,KAAKy3E,cAAcQ,GACnCK,EAAiBt4E,KAAKy3E,cAAcS,GACpCK,EAAoBv4E,KAAKy3E,cAAcU,GACvCK,EAAmBx4E,KAAKy3E,cAAcW,GAWtCK,EAhHU,IAiHTrB,EACK90E,KAAKgG,IAAI,EAAGhG,KAAK8qD,KAAKntB,GAAKjC,GAAQi5C,IAChCG,EACGA,EACA,IACA,QACN,GAEV,GADAp3E,KAAK04E,SAAST,EAAoBC,EAAqBC,EAAwBC,EAAuBC,EAAeC,EAAgBC,EAAmBC,EAAkBC,GACtKz4E,KAAK63E,gBAAiB,CACtB,IAAIc,EAAc7jE,IAClB9U,KAAK43E,WAAWhuE,SAAQ,SAAUgvE,EAAU79E,EAAGmb,GAC3CyiE,EAAcr2E,KAAKiG,IAAIowE,EAAaC,EAASlqE,OAAO,GAAG,GAAIkqE,EAASlqE,OAAO,GAAG,GAAIkqE,EAASlqE,OAAO,GAAG,OAIzG1O,KAAK43E,WAAWhuE,QAAQ,SAAUgvE,GAC9B,GAAIt2E,KAAKgG,IAAIswE,EAASlqE,OAAO,GAAG,GAAIkqE,EAASlqE,OAAO,GAAG,GAAIkqE,EAASlqE,OAAO,GAAG,IAC1EiqE,EACA34E,KAAK+3E,kBAAoB,EAAG,CAC5B,IAAIc,EAAc,CACd,CAACD,EAASlqE,OAAO,GAAG,GAAIkqE,EAASlqE,OAAO,GAAG,IAC3C,CAACkqE,EAASlqE,OAAO,GAAG,GAAIkqE,EAASlqE,OAAO,GAAG,IAC3C,CAACkqE,EAASlqE,OAAO,GAAG,GAAIkqE,EAASlqE,OAAO,GAAG,KAE3CmqE,EAAY,GAAG,GAAKF,EAAc34E,KAAK+3E,kBAAoB,IAC3Dc,EAAY,GAAG,IAAM74E,KAAK+3E,mBAE1Bc,EAAY,GAAG,GAAKF,EAAc34E,KAAK+3E,kBAAoB,IAC3Dc,EAAY,GAAG,IAAM74E,KAAK+3E,mBAE1Bc,EAAY,GAAG,GAAKF,EAAc34E,KAAK+3E,kBAAoB,IAC3Dc,EAAY,GAAG,IAAM74E,KAAK+3E,mBAK9B,IAAI51D,EAAO7f,KAAKiG,IAAIswE,EAAY,GAAG,GAAIA,EAAY,GAAG,GAAIA,EAAY,GAAG,IAC9Dv2E,KAAKgG,IAAIuwE,EAAY,GAAG,GAAIA,EAAY,GAAG,GAAIA,EAAY,GAAG,IAC9D12D,EAAOniB,KAAK+3E,kBAAoB,IACvCa,EAASlqE,OAASmqE,KAG5Bt8E,KAAKyD,OAEXu3E,EAAoB,GA0LxB,OA9KAR,EAAcp6E,UAAUm8E,aAAe,SAAU3uE,EAAG3K,EAAGpE,EAAG29E,EAAMC,EAAMC,GAClEj5E,KAAK43E,WAAW/2E,KAAK,CACjB6N,OAAQ,CAACqqE,EAAMC,EAAMC,GACrBj1D,OAAQ,CAAC7Z,EAAG3K,EAAGpE,MAmBvB27E,EAAcp6E,UAAU+7E,SAAW,SAAUvuE,EAAG3K,EAAGpE,EAAGC,EAAG09E,EAAMC,EAAMC,EAAMC,EAAMT,GAC7E,IAAIU,EAAmB78C,GAAe,CAACy8C,EAAMC,EAAMC,EAAMC,IACrDE,EAAkBp5E,KAAK+3E,kBACrB55C,GAASg7C,GAAoBn5E,KAAK+3E,kBAClC,KACFsB,EAA0Cr5E,KAAsB,kBAGhEs5E,EAASt5E,KAAKq3E,YAAY/sC,YAC1B8uC,EAAkB,IAClBA,EAAkB,EAClBG,GAAmB,EACvB,GAAId,EAAiB,EAAG,CACpB,GAAIz4E,KAAKs3E,YAAYv8B,YAAc/6C,KAAKg4E,kBAGpCuB,EADsBp7C,GADC7B,GAAe,CAACnyB,EAAG3K,EAAGpE,EAAGC,KACG2E,KAAKg4E,kBArM/C,KAuMmCuB,GAE3CD,GAAUt5E,KAAKq3E,YAAYt8B,YAAcq+B,IAC1CG,EACIH,EA3MK,KA2MmCG,GAGpD,MAAKA,GAAoBv5E,KAAK03E,kBACtBjoE,SAAS0pE,EAAiB,KAC1B1pE,SAAS0pE,EAAiB,KAC1B1pE,SAAS0pE,EAAiB,KAC1B1pE,SAAS0pE,EAAiB,MACrB,GAAWA,EAAkBn5E,KAAK03E,kBAL/C,CAWA,IAAI8B,EAAc,EAClB,KAAKD,GACI9pE,SAASspE,EAAK,KACdtpE,SAASspE,EAAK,KACdtpE,SAASupE,EAAK,KACdvpE,SAASupE,EAAK,KACdvpE,SAASwpE,EAAK,KACdxpE,SAASwpE,EAAK,KACdxpE,SAASypE,EAAK,KACdzpE,SAASypE,EAAK,KACf,GAAIT,EAAiB,EACjBc,GAAmB,OAUnB,GAAmB,IALnBC,GACM/pE,SAASspE,EAAK,KAAQtpE,SAASspE,EAAK,IAAU,EAAJ,IACtCtpE,SAASupE,EAAK,KAAQvpE,SAASupE,EAAK,IAAU,EAAJ,IAC1CvpE,SAASwpE,EAAK,KAAQxpE,SAASwpE,EAAK,IAAU,EAAJ,IAC1CxpE,SAASypE,EAAK,KAAQzpE,SAASypE,EAAK,IAAU,EAAJ,KAEjC,GAAfM,GACe,GAAfA,GACe,GAAfA,EACA,OAKhB,GAAIf,EAAiB,EAAG,CACpB,IAAKc,EAAkB,CACnB,IAAIxjD,EAAS,EAAE5rB,EAAE,GAAK/O,EAAE,IAAM,GAAI+O,EAAE,GAAK/O,EAAE,IAAM,GAC7Cq+E,EAAYz5E,KAAKy3E,cAAc1hD,GAC/B1kB,OAAK,EACT,GAAIioE,EAIAjoE,GAHuBivB,GAAOy4C,EAAK,GAAIM,GACnC/4C,GAAO24C,EAAK,GAAII,IAChB,EACmB/4C,GAAOm5C,EAAU,GAAIJ,QAG5ChoE,GAAM0nE,EAAK,GAAKE,EAAK,IAAM,EAAIQ,EAAU,GAE7C,IAAInoE,GAAMynE,EAAK,GAAKE,EAAK,IAAM,EAAIQ,EAAU,GAE7CF,EAD4BloE,EAAKA,EAAKC,EAAKA,EACAtR,KAAK23E,uBAEpD,GAAI4B,EAAkB,CAClB,GAAIj3E,KAAK4M,IAAI/E,EAAE,GAAK/O,EAAE,KAAOkH,KAAK4M,IAAI/E,EAAE,GAAK/O,EAAE,IAAK,CAEhD,IAAIs+E,EAAK,EAAEl6E,EAAE,GAAKpE,EAAE,IAAM,GAAIoE,EAAE,GAAKpE,EAAE,IAAM,GACzCu+E,EAAQ35E,KAAKy3E,cAAciC,GAC3BE,EAAK,EAAEv+E,EAAE,GAAK8O,EAAE,IAAM,GAAI9O,EAAE,GAAK8O,EAAE,IAAM,GACzC0vE,EAAQ75E,KAAKy3E,cAAcmC,GAC/B55E,KAAK04E,SAASvuE,EAAG3K,EAAGk6E,EAAIE,EAAIb,EAAMC,EAAMW,EAAOE,EAAOpB,EAAiB,GACvEz4E,KAAK04E,SAASkB,EAAIF,EAAIt+E,EAAGC,EAAGw+E,EAAOF,EAAOV,EAAMC,EAAMT,EAAiB,OAEtE,CAED,IAAIqB,EAAK,EAAE3vE,EAAE,GAAK3K,EAAE,IAAM,GAAI2K,EAAE,GAAK3K,EAAE,IAAM,GACzCu6E,EAAQ/5E,KAAKy3E,cAAcqC,GAC3BE,EAAK,EAAE5+E,EAAE,GAAKC,EAAE,IAAM,GAAID,EAAE,GAAKC,EAAE,IAAM,GACzC4+E,EAAQj6E,KAAKy3E,cAAcuC,GAC/Bh6E,KAAK04E,SAASvuE,EAAG2vE,EAAIE,EAAI3+E,EAAG09E,EAAMgB,EAAOE,EAAOf,EAAMT,EAAiB,GACvEz4E,KAAK04E,SAASoB,EAAIt6E,EAAGpE,EAAG4+E,EAAID,EAAOf,EAAMC,EAAMgB,EAAOxB,EAAiB,GAE3E,QAGR,GAAIa,EAAQ,CACR,IAAKt5E,KAAK83E,kBACN,OAEJ93E,KAAK63E,iBAAkB,EAMA,IAAR,GAAd2B,IACDx5E,KAAK84E,aAAa3uE,EAAG/O,EAAGC,EAAG09E,EAAME,EAAMC,GAEhB,IAAR,GAAdM,IACDx5E,KAAK84E,aAAa3uE,EAAG/O,EAAGoE,EAAGu5E,EAAME,EAAMD,GAEvCQ,IAE2B,IAAR,GAAdA,IACDx5E,KAAK84E,aAAat5E,EAAGnE,EAAG8O,EAAG6uE,EAAME,EAAMH,GAEhB,IAAR,EAAdS,IACDx5E,KAAK84E,aAAat5E,EAAGnE,EAAGD,EAAG49E,EAAME,EAAMD,MASnDlC,EAAcp6E,UAAUu9E,sBAAwB,WAC5C,IAAI19C,E/G7JD,CAAC1nB,IAAUA,KAAU,KAAW,K+GoKnC,OANA9U,KAAK43E,WAAWhuE,SAAQ,SAAUgvE,EAAU79E,EAAGmb,GAC3C,IAAI2L,EAAM+2D,EAASlqE,OACnBiuB,GAAiBH,EAAQ3a,EAAI,IAC7B8a,GAAiBH,EAAQ3a,EAAI,IAC7B8a,GAAiBH,EAAQ3a,EAAI,OAE1B2a,GAKXu6C,EAAcp6E,UAAUw9E,aAAe,WACnC,OAAOn6E,KAAK43E,YAETb,EAxUuB,GCtBvBqD,GAA2B,CAClCC,uBAAuB,EACvBC,yBAAyB,GFM7B,SAASC,GAAiB7D,EAAK8D,EAAIC,EAAIC,EAAIC,GACvCjE,EAAItI,YACJsI,EAAIrI,OAAO,EAAG,GACdqI,EAAIpI,OAAOkM,EAAIC,GACf/D,EAAIpI,OAAOoM,EAAIC,GACfjE,EAAIkE,YACJlE,EAAIvI,OACJuI,EAAIp/C,OACJo/C,EAAIE,SAAS,EAAG,EAAGt0E,KAAKgG,IAAIkyE,EAAIE,GAAM,EAAGp4E,KAAKgG,IAAImyE,EAAIE,IACtDjE,EAAIlD,UAUR,SAASqH,GAA8B3wE,EAAMgP,GAEzC,OAAQ5W,KAAK4M,IAAIhF,EAAc,EAATgP,GAAc,KAAO,GACvC5W,KAAK4M,IAAIhF,EAAc,EAATgP,EAAa,GAAK,QAAc,EAuC/C,SAAS4hE,GAA0B53B,EAAY8zB,EAAYnsB,EAAcE,GAC5E,IAAIH,EAAe,GAAUC,EAAcmsB,EAAY9zB,GAEnD4H,EAAmBxQ,GAAmB08B,EAAYjsB,EAAkBF,GACpEkwB,EAAsB/D,EAAWp8B,wBACTtmB,IAAxBymD,IACAjwB,GAAoBiwB,GAExB,IAAIC,EAAsB93B,EAAWtI,wBACTtmB,IAAxB0mD,IACAlwB,GAAoBkwB,GAKxB,IAAIC,EAAe/3B,EAAWtc,YAC9B,IAAKq0C,GAAgBp+C,GAAmBo+C,EAAcrwB,GAAe,CACjE,IAAIswB,EAAqB5gC,GAAmB4I,EAAY4H,EAAkBF,GACtEE,EACAr7C,SAASyrE,IAAuBA,EAAqB,IACrDpwB,GAAoBowB,GAG5B,OAAOpwB,EA+CJ,SAAS,GAAO7nD,EAAOC,EAAQi0D,EAAYrM,EAAkBmwB,EAAclwB,EAAkBksB,EAAckE,EAAeC,EAASvH,EAAQwH,EAAiBC,GAC/J,IAAI3uC,EAAUY,GAAsBjrC,KAAK+F,MAAM8uD,EAAal0D,GAAQX,KAAK+F,MAAM8uD,EAAaj0D,IAE5F,GADA,GAAOypC,EAAS2uC,GACO,IAAnBF,EAAQ/6E,OACR,OAAOssC,EAAQiB,OAGnB,SAAS2tC,EAAWv/E,GAChB,OAAOsG,KAAK+F,MAAMrM,EAAQm7D,GAAcA,EAF5CxqB,EAAQ/8B,MAAMunD,EAAYA,GAI1BxqB,EAAQ6uC,yBAA2B,UACnC,IAAIC,E9G4BG,CAAC3mE,IAAUA,KAAU,KAAW,K8G3BvCsmE,EAAQxxE,SAAQ,SAAUiY,EAAK9mB,EAAGmb,G9GmI/B,IAAgBmnB,EAASC,EAATD,E8GlIRo+C,G9GkIiBn+C,E8GlICzb,EAAI2a,Q9GmIrB,GAAKa,EAAQ,KACrBA,EAAQ,GAAKC,EAAQ,IAErBA,EAAQ,GAAKD,EAAQ,KACrBA,EAAQ,GAAKC,EAAQ,IAErBA,EAAQ,GAAKD,EAAQ,KACrBA,EAAQ,GAAKC,EAAQ,IAErBA,EAAQ,GAAKD,EAAQ,KACrBA,EAAQ,GAAKC,EAAQ,O8G3IzB,IAAIo+C,EAAqBv9C,GAASs9C,GAC9BE,EAAsBv9C,GAAUq9C,GAChCG,EAAgBruC,GAAsBjrC,KAAK+F,MAAO8uD,EAAaukB,EAAsB5wB,GAAmBxoD,KAAK+F,MAAO8uD,EAAawkB,EAAuB7wB,IAC5J,GAAO8wB,EAAeN,GACtB,IAAIO,EAAc1kB,EAAarM,EAC/BswB,EAAQxxE,SAAQ,SAAUiY,EAAK9mB,EAAGmb,GAC9B,IAAI4lE,EAAOj6D,EAAI2a,OAAO,GAAKi/C,EAAiB,GACxCM,IAASl6D,EAAI2a,OAAO,GAAKi/C,EAAiB,IAC1CO,EAAW79C,GAAStc,EAAI2a,QACxBy/C,EAAY79C,GAAUvc,EAAI2a,QAE1B3a,EAAIC,MAAM7e,MAAQ,GAAK4e,EAAIC,MAAM5e,OAAS,GAC1C04E,EAAc5M,UAAUntD,EAAIC,MAAO+xD,EAAQA,EAAQhyD,EAAIC,MAAM7e,MAAQ,EAAI4wE,EAAQhyD,EAAIC,MAAM5e,OAAS,EAAI2wE,EAAQiI,EAAOD,EAAaE,EAAOF,EAAaG,EAAWH,EAAaI,EAAYJ,MAGpM,IAAIK,EAAgBn+C,GAAWk5C,GA8G/B,OA7GAkE,EAAchB,eAAevwE,SAAQ,SAAUgvE,EAAU79E,EAAGmb,GAqBxD,IAAIxH,EAASkqE,EAASlqE,OAClBsV,EAAS40D,EAAS50D,OAClBkb,EAAKxwB,EAAO,GAAG,GAAI0wB,EAAK1wB,EAAO,GAAG,GAClCqS,EAAKrS,EAAO,GAAG,GAAIsS,EAAKtS,EAAO,GAAG,GAClCiG,EAAKjG,EAAO,GAAG,GAAIkG,EAAKlG,EAAO,GAAG,GAElCytE,EAAKZ,GAAYv3D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,GACpDqxB,EAAKb,IAAav3D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,GACrDyvB,EAAKe,GAAYv3D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,GACpD0vB,EAAKc,IAAav3D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,GACrD2vB,EAAKa,GAAYv3D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,GACpD4vB,EAAKY,IAAav3D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,GAIrDsxB,EAAwBn9C,EACxBo9C,EAAwBl9C,EAC5BF,EAAK,EACLE,EAAK,EAKL,IAMIm9C,E7GxHL,SAA2B99D,GAE9B,IADA,IAAIjiB,EAAIiiB,EAAIpe,OACHtF,EAAI,EAAGA,EAAIyB,EAAGzB,IAAK,CAIxB,IAFA,IAAIyhF,EAASzhF,EACT0hF,EAAQn6E,KAAK4M,IAAIuP,EAAI1jB,GAAGA,IACnBc,EAAId,EAAI,EAAGc,EAAIW,EAAGX,IAAK,CAC5B,IAAI6gF,EAAWp6E,KAAK4M,IAAIuP,EAAI5iB,GAAGd,IAC3B2hF,EAAWD,IACXA,EAAQC,EACRF,EAAS3gF,GAGjB,GAAc,IAAV4gF,EACA,OAAO,KAGX,IAAI3zB,EAAMrqC,EAAI+9D,GACd/9D,EAAI+9D,GAAU/9D,EAAI1jB,GAClB0jB,EAAI1jB,GAAK+tD,EAET,IAAK,IAAItwC,EAAIzd,EAAI,EAAGyd,EAAIhc,EAAGgc,IAEvB,IADA,IAAImkE,GAAQl+D,EAAIjG,GAAGzd,GAAK0jB,EAAI1jB,GAAGA,GACtB2P,EAAI3P,EAAG2P,EAAIlO,EAAI,EAAGkO,IACnB3P,GAAK2P,EACL+T,EAAIjG,GAAG9N,GAAK,EAGZ+T,EAAIjG,GAAG9N,IAAMiyE,EAAOl+D,EAAI1jB,GAAG2P,GAO3C,IADA,IAAI/G,EAAI,IAAIhE,MAAMnD,GACTxB,EAAIwB,EAAI,EAAGxB,GAAK,EAAGA,IAAK,CAC7B2I,EAAE3I,GAAKyjB,EAAIzjB,GAAGwB,GAAKiiB,EAAIzjB,GAAGA,GAC1B,IAAK,IAAIG,EAAIH,EAAI,EAAGG,GAAK,EAAGA,IACxBsjB,EAAItjB,GAAGqB,IAAMiiB,EAAItjB,GAAGH,GAAK2I,EAAE3I,GAGnC,OAAO2I,E6G+Eei5E,CANI,CAClB,CALJ77D,GAAMs7D,EACNr7D,GAAMs7D,EAIO,EAAG,EAAG9B,EAAK2B,GACpB,CAJJxnE,GAAM0nE,EACNznE,GAAM0nE,EAGO,EAAG,EAAG5B,EAAKyB,GACpB,CAAC,EAAG,EAAGp7D,EAAIC,EAAIy5D,EAAK2B,GACpB,CAAC,EAAG,EAAGznE,EAAIC,EAAI+lE,EAAKyB,KAGxB,GAAKG,EAAL,CAKA,GAFA5vC,EAAQwhC,OACRxhC,EAAQyhC,YAvLhB,WACI,QAAiC95C,IAA7B+hD,GAAwC,CACxC,IAAIK,EAAMnyE,SAASS,cAAc,UAAU8oC,WAAW,MACtD4oC,EAAI8E,yBAA2B,UAC/B9E,EAAIC,UAAY,wBAChB4D,GAAiB7D,EAAK,EAAG,EAAG,EAAG,GAC/B6D,GAAiB7D,EAAK,EAAG,EAAG,EAAG,GAC/B,IAAIxsE,EAAOwsE,EAAIzH,aAAa,EAAG,EAAG,EAAG,GAAG/kE,KACxCmsE,GACIwE,GAA8B3wE,EAAM,IAChC2wE,GAA8B3wE,EAAM,IACpC2wE,GAA8B3wE,EAAM,GAEhD,OAAOmsE,GA2KCwG,IACAvB,IAAuBlB,GAA0B,CAEjDztC,EAAQ0hC,OAAOmM,EAAIC,GAKnB,IAHA,IACIqC,EAAKX,EAAK3B,EACVuC,EAAKX,EAAK3B,EACLh3D,EAAO,EAAGA,EAHP,EAGqBA,IAE7BkpB,EAAQ2hC,OAAOkM,EAAKe,GAAa93D,EAAO,GAAKq5D,EALrC,GAKmDrC,EAAKc,EAAY93D,EAAOs5D,EAAM,IAE7E15D,GAARI,GACAkpB,EAAQ2hC,OAAOkM,EAAKe,GAAa93D,EAAO,GAAKq5D,EARzC,GAQuDrC,EAAKc,GAAa93D,EAAO,GAAKs5D,EAAM,IAIvGpwC,EAAQ2hC,OAAOoM,EAAIC,QAGnBhuC,EAAQ0hC,OAAOmM,EAAIC,GACnB9tC,EAAQ2hC,OAAO6N,EAAIC,GACnBzvC,EAAQ2hC,OAAOoM,EAAIC,GAEvBhuC,EAAQrV,OACRqV,EAAQl6B,UAAU8pE,EAAY,GAAIA,EAAY,GAAIA,EAAY,GAAIA,EAAY,GAAIJ,EAAIC,GACtFzvC,EAAQp8B,UAAUkrE,EAAiB,GAAKY,EAAuBZ,EAAiB,GAAKa,GACrF3vC,EAAQ/8B,MAAMk7C,EAAmBqM,GAAarM,EAAmBqM,GACjExqB,EAAQqiC,UAAU4M,EAAchuC,OAAQ,EAAG,GAC3CjB,EAAQ6mC,cAER6H,IACA1uC,EAAQwhC,OACRxhC,EAAQ6uC,yBAA2B,cACnC7uC,EAAQqwC,YAAc,QACtBrwC,EAAQswC,UAAY,EACpB9B,EAAchB,eAAevwE,SAAQ,SAAUgvE,EAAU79E,EAAGmb,GACxD,IAAI8N,EAAS40D,EAAS50D,OAClBm4D,GAAMn4D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,EACzCqxB,IAAOp4D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,EAC1CyvB,GAAMx2D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,EACzC0vB,IAAOz2D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,EAC1C2vB,GAAM12D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,EACzC4vB,IAAO32D,EAAO,GAAG,GAAKk4D,EAAc,IAAMnxB,EAC9Cpe,EAAQyhC,YACRzhC,EAAQ0hC,OAAOmM,EAAIC,GACnB9tC,EAAQ2hC,OAAO6N,EAAIC,GACnBzvC,EAAQ2hC,OAAOoM,EAAIC,GACnBhuC,EAAQiuC,YACRjuC,EAAQ3zB,YAEZ2zB,EAAQ6mC,WAEL7mC,EAAQiB,OGnSnB,IAAI,GAAwC,WACxC,IAAIruC,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA4Q7B,GAxOiB,SAAUu7B,GAiBtC,SAAS4hD,EAAWh6B,EAAYi6B,EAAgBnG,EAAYoG,EAAgBzQ,EAAW0Q,EAAkBlmB,EAAY0c,EAAQyJ,EAAiBC,EAAoBlC,EAAiBC,GAC/K,IAAIx/D,EAAQwf,EAAOpgC,KAAK8E,KAAM2sE,EAAWh0B,KAAmB34C,KAK5D8b,EAAM0hE,kBAAmClpD,IAApB+mD,GAAgCA,EAKrDv/D,EAAM2hE,gBAAkBnC,EAKxBx/D,EAAMo7C,YAAcC,EAKpBr7C,EAAM4hE,QAAU7J,EAKhB/3D,EAAM6hE,QAAU,KAKhB7hE,EAAM8hE,gBAAkBT,EAKxBrhE,EAAM+hE,gBAAkBT,EAKxBthE,EAAMgiE,kBAAoBT,GAAsC1Q,EAKhE7wD,EAAMiiE,aAAe,GAKrBjiE,EAAMkiE,qBAAuB,KAK7BliE,EAAMmiE,SAAW,EACjB,IAAIhH,EAAemG,EAAezK,mBAAmB72D,EAAMgiE,mBACvDI,EAAkBpiE,EAAM+hE,gBAAgBj3C,YACxCswC,EAAkBp7D,EAAM8hE,gBAAgBh3C,YACxCu3C,EAAsBD,EACpB5+C,GAAgB23C,EAAciH,GAC9BjH,EACN,GAAqC,IAAjCj5C,GAAQmgD,GAIR,OADAriE,EAAMsqB,MAAQuS,GACP78B,EAEX,IAAIsiE,EAAmBl7B,EAAWtc,YAC9Bw3C,IAKIlH,EAJCA,EAIiB53C,GAAgB43C,EAAiBkH,GAHjCA,GAM1B,IAAIrzB,EAAmBqyB,EAAenuB,cAAcnzC,EAAMgiE,kBAAkB,IACxEhzB,EHdL,SAAyC5H,EAAY8zB,EAAYC,EAAclsB,GAClF,IAAIF,EAAexsB,GAAU44C,GACzBnsB,EAAmBgwB,GAA0B53B,EAAY8zB,EAAYnsB,EAAcE,GAOvF,QANKt7C,SAASq7C,IAAqBA,GAAoB,IACnDntB,GAAcs5C,GAAc,SAAU14C,GAElC,OADAusB,EAAmBgwB,GAA0B53B,EAAY8zB,EAAYz4C,EAAQwsB,GACtEt7C,SAASq7C,IAAqBA,EAAmB,KAGzDA,EGKoBuzB,CAAgCn7B,EAAY8zB,EAAYmH,EAAqBpzB,GACpG,IAAKt7C,SAASq7C,IAAqBA,GAAoB,EAInD,OADAhvC,EAAMsqB,MAAQuS,GACP78B,EAEX,IAAIwiE,OAAgDhqD,IAAvBipD,EAAmCA,ECnI3C,GDyIrB,GADAzhE,EAAMyiE,eAAiB,IAAI,GAAcr7B,EAAY8zB,EAAYmH,EAAqBjH,EAAiBpsB,EAAmBwzB,EAAwBvzB,GAC/F,IAA/CjvC,EAAMyiE,eAAepE,eAAe95E,OAGpC,OADAyb,EAAMsqB,MAAQuS,GACP78B,EAEXA,EAAMmiE,SAAWd,EAAezM,kBAAkB5lB,GAClD,IAAImwB,EAAen/D,EAAMyiE,eAAerE,wBAUxC,GATIhD,IACIh0B,EAAW5Y,YACX2wC,EAAa,GAAKn7C,GAAMm7C,EAAa,GAAI/D,EAAgB,GAAIA,EAAgB,IAC7E+D,EAAa,GAAKn7C,GAAMm7C,EAAa,GAAI/D,EAAgB,GAAIA,EAAgB,KAG7E+D,EAAe37C,GAAgB27C,EAAc/D,IAGhDl5C,GAAQi9C,GAGR,CAED,IADA,IAAIuD,EAAcrB,EAAepM,0BAA0BkK,EAAcn/D,EAAMmiE,UACtEQ,EAAOD,EAAYr8D,KAAMs8D,GAAQD,EAAYv8D,KAAMw8D,IACxD,IAAK,IAAIC,EAAOF,EAAYp8D,KAAMs8D,GAAQF,EAAYt8D,KAAMw8D,IAAQ,CAChE,IAAIhmC,EAAO4kC,EAAgBxhE,EAAMmiE,SAAUQ,EAAMC,EAAMvnB,GACnDze,GACA58B,EAAMiiE,aAAal9E,KAAK63C,GAIF,IAA9B58B,EAAMiiE,aAAa19E,SACnByb,EAAMsqB,MAAQuS,SAblB78B,EAAMsqB,MAAQuS,GAgBlB,OAAO78B,EAwFX,OArOA,GAAUohE,EAAY5hD,GAmJtB4hD,EAAWvgF,UAAUw3E,SAAW,WAC5B,OAAOn0E,KAAK29E,SAKhBT,EAAWvgF,UAAUgiF,WAAa,WAC9B,IAAIvD,EAAU,GAUd,GATAp7E,KAAK+9E,aAAan0E,QAAQ,SAAU8uC,EAAM39C,EAAGmb,GACrCwiC,GAAQA,EAAK7P,YAAc8P,IAC3ByiC,EAAQv6E,KAAK,CACT27B,OAAQx8B,KAAK49E,gBAAgBjL,mBAAmBj6B,EAAKi0B,WACrD7qD,MAAO42B,EAAKy7B,cAGtB53E,KAAKyD,OACPA,KAAK+9E,aAAa19E,OAAS,EACJ,IAAnB+6E,EAAQ/6E,OACRL,KAAKomC,MAAQuS,OAEZ,CACD,IAAI1sC,EAAIjM,KAAK89E,kBAAkB,GAC3BhqE,EAAO9T,KAAK69E,gBAAgBe,YAAY3yE,GACxChJ,EAAwB,iBAAT6Q,EAAoBA,EAAOA,EAAK,GAC/C5Q,EAAyB,iBAAT4Q,EAAoBA,EAAOA,EAAK,GAChDi3C,EAAmB/qD,KAAK69E,gBAAgB5uB,cAAchjD,GACtD6+C,EAAmB9qD,KAAK49E,gBAAgB3uB,cAAcjvD,KAAKi+E,UAC3DhH,EAAej3E,KAAK69E,gBAAgBlL,mBAAmB3yE,KAAK89E,mBAChE99E,KAAK29E,QAAU,GAAkB16E,EAAOC,EAAQlD,KAAKk3D,YAAapM,EAAkB9qD,KAAK49E,gBAAgBh3C,YAAamkB,EAAkBksB,EAAcj3E,KAAKu+E,eAAgBnD,EAASp7E,KAAK09E,QAAS19E,KAAKw9E,aAAcx9E,KAAKy9E,iBAC1Nz9E,KAAKomC,MAAQuS,GAEjB34C,KAAK+jC,WAKTm5C,EAAWvgF,UAAUolB,KAAO,WACxB,GAAI/hB,KAAKomC,OAASuS,GAAgB,CAC9B34C,KAAKomC,MAAQuS,GACb34C,KAAK+jC,UACL,IAAI86C,EAAe,EACnB7+E,KAAKg+E,qBAAuB,GAC5Bh+E,KAAK+9E,aAAan0E,QAAQ,SAAU8uC,EAAM39C,EAAGmb,GACzC,IAAIkwB,EAAQsS,EAAK7P,WACjB,GAAIzC,GAASuS,IAAkBvS,GAASuS,GAAmB,CACvDkmC,IACA,IAAIC,EAAoB17C,GAAOsV,EAAM1U,IAAkB,SAAUvjC,GAC7D,IAAI2lC,EAAQsS,EAAK7P,WACbzC,GAASuS,IACTvS,GAASuS,IACTvS,GAASuS,KACTjV,GAAco7C,GAEO,MADrBD,IAEI7+E,KAAK++E,mBACL/+E,KAAK2+E,iBAGd3+E,MACHA,KAAKg+E,qBAAqBn9E,KAAKi+E,KAErCviF,KAAKyD,OACc,IAAjB6+E,EACAxpC,WAAWr1C,KAAK2+E,WAAWpiF,KAAKyD,MAAO,GAGvCA,KAAK+9E,aAAan0E,SAAQ,SAAU8uC,EAAM39C,EAAGmb,GAC7BwiC,EAAK7P,YACJ8P,IACTD,EAAK32B,YASzBm7D,EAAWvgF,UAAUoiF,iBAAmB,WACpC/+E,KAAKg+E,qBAAqBp0E,QAAQ85B,IAClC1jC,KAAKg+E,qBAAuB,MAEzBd,EAtOoB,CAuO7B,IErBa,GAlOe,WAI1B,SAAS8B,EAASC,GAMdj/E,KAAKk/E,mBACqB5qD,IAAtB2qD,EAAkCA,EAAoB,KAK1Dj/E,KAAKm/E,OAAS,EAKdn/E,KAAKo/E,SAAW,GAKhBp/E,KAAKq/E,QAAU,KAKfr/E,KAAKs/E,QAAU,KAiMnB,OA5LAN,EAASriF,UAAUwkC,eAAiB,WAChC,OAAOnhC,KAAKk/E,cAAgB,GAAKl/E,KAAKk3C,WAAal3C,KAAKk/E,eAK5DF,EAASriF,UAAUykB,MAAQ,WACvBphB,KAAKm/E,OAAS,EACdn/E,KAAKo/E,SAAW,GAChBp/E,KAAKq/E,QAAU,KACfr/E,KAAKs/E,QAAU,MAMnBN,EAASriF,UAAU4iF,YAAc,SAAUjjF,GACvC,OAAO0D,KAAKo/E,SAASxiF,eAAeN,IAQxC0iF,EAASriF,UAAUiN,QAAU,SAAUmF,GAEnC,IADA,IAAIywE,EAAQx/E,KAAKq/E,QACVG,GACHzwE,EAAEywE,EAAMC,OAAQD,EAAME,KAAM1/E,MAC5Bw/E,EAAQA,EAAMG,OAQtBX,EAASriF,UAAUf,IAAM,SAAUU,EAAKu0C,GACpC,IAAI2uC,EAAQx/E,KAAKo/E,SAAS9iF,GAE1B,OADAo/B,QAAiBpH,IAAVkrD,EAAqB,IACxBA,IAAUx/E,KAAKs/E,UAGVE,IAAUx/E,KAAKq/E,SACpBr/E,KAAKq/E,QAAgCr/E,KAAKq/E,QAAa,MACvDr/E,KAAKq/E,QAAQO,MAAQ,OAGrBJ,EAAMG,MAAMC,MAAQJ,EAAMI,MAC1BJ,EAAMI,MAAMD,MAAQH,EAAMG,OAE9BH,EAAMG,MAAQ,KACdH,EAAMI,MAAQ5/E,KAAKs/E,QACnBt/E,KAAKs/E,QAAQK,MAAQH,EACrBx/E,KAAKs/E,QAAUE,GAbJA,EAAMC,QAqBrBT,EAASriF,UAAUkK,OAAS,SAAUvK,GAClC,IAAIkjF,EAAQx/E,KAAKo/E,SAAS9iF,GAoB1B,OAnBAo/B,QAAiBpH,IAAVkrD,EAAqB,IACxBA,IAAUx/E,KAAKs/E,SACft/E,KAAKs/E,QAAgCE,EAAW,MAC5Cx/E,KAAKs/E,UACLt/E,KAAKs/E,QAAQK,MAAQ,OAGpBH,IAAUx/E,KAAKq/E,SACpBr/E,KAAKq/E,QAAgCG,EAAW,MAC5Cx/E,KAAKq/E,UACLr/E,KAAKq/E,QAAQO,MAAQ,QAIzBJ,EAAMG,MAAMC,MAAQJ,EAAMI,MAC1BJ,EAAMI,MAAMD,MAAQH,EAAMG,cAEvB3/E,KAAKo/E,SAAS9iF,KACnB0D,KAAKm/E,OACAK,EAAMC,QAKjBT,EAASriF,UAAUu6C,SAAW,WAC1B,OAAOl3C,KAAKm/E,QAKhBH,EAASriF,UAAUkoC,QAAU,WACzB,IAEI26C,EAFA/hE,EAAO,IAAI9d,MAAMK,KAAKm/E,QACtBpkF,EAAI,EAER,IAAKykF,EAAQx/E,KAAKs/E,QAASE,EAAOA,EAAQA,EAAMI,MAC5CniE,EAAK1iB,KAAOykF,EAAME,KAEtB,OAAOjiE,GAKXuhE,EAASriF,UAAUwlC,UAAY,WAC3B,IAEIq9C,EAFAzzE,EAAS,IAAIpM,MAAMK,KAAKm/E,QACxBpkF,EAAI,EAER,IAAKykF,EAAQx/E,KAAKs/E,QAASE,EAAOA,EAAQA,EAAMI,MAC5C7zE,EAAOhR,KAAOykF,EAAMC,OAExB,OAAO1zE,GAKXizE,EAASriF,UAAUkjF,SAAW,WAC1B,OAAO7/E,KAAKq/E,QAAQI,QAKxBT,EAASriF,UAAUmjF,YAAc,WAC7B,OAAO9/E,KAAKq/E,QAAQK,MAMxBV,EAASriF,UAAUojF,aAAe,WAC9B,OAAO//E,KAAKs/E,QAAQI,MAKxBV,EAASriF,UAAU2lB,IAAM,WACrB,IAAIk9D,EAAQx/E,KAAKq/E,QAUjB,cATOr/E,KAAKo/E,SAASI,EAAME,MACvBF,EAAMG,QACNH,EAAMG,MAAMC,MAAQ,MAExB5/E,KAAKq/E,QAAgCG,EAAW,MAC3Cx/E,KAAKq/E,UACNr/E,KAAKs/E,QAAU,QAEjBt/E,KAAKm/E,OACAK,EAAMC,QAMjBT,EAASriF,UAAU+F,QAAU,SAAUpG,EAAKN,GACxCgE,KAAKpE,IAAIU,GACT0D,KAAKo/E,SAAS9iF,GAAKmjF,OAASzjF,GAMhCgjF,EAASriF,UAAU8kC,IAAM,SAAUnlC,EAAKN,GACpC0/B,KAASp/B,KAAO0D,KAAKo/E,UAAW,IAChC,IAAII,EAAQ,CACRE,KAAMpjF,EACNqjF,MAAO,KACPC,MAAO5/E,KAAKs/E,QACZG,OAAQzjF,GAEPgE,KAAKs/E,QAINt/E,KAAKs/E,QAAQK,MAAQH,EAHrBx/E,KAAKq/E,QAAUG,EAKnBx/E,KAAKs/E,QAAUE,EACfx/E,KAAKo/E,SAAS9iF,GAAOkjF,IACnBx/E,KAAKm/E,QAOXH,EAASriF,UAAU+kC,QAAU,SAAU5tB,GACnC9T,KAAKk/E,cAAgBprE,GAElBkrE,EAhOkB,GCJtB,SAAS,GAAe/yE,EAAGtI,EAAGC,EAAGo8E,GACpC,YAAsB1rD,IAAlB0rD,GACAA,EAAc,GAAK/zE,EACnB+zE,EAAc,GAAKr8E,EACnBq8E,EAAc,GAAKp8E,EACZo8E,GAGA,CAAC/zE,EAAGtI,EAAGC,GASf,SAASq8E,GAAUh0E,EAAGtI,EAAGC,GAC5B,OAAOqI,EAAI,IAAMtI,EAAI,IAAMC,EAOxB,SAAS,GAAO+oE,GACnB,OAAOsT,GAAUtT,EAAU,GAAIA,EAAU,GAAIA,EAAU,IC1C3D,IAAI,GAAwC,WACxC,IAAIptE,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA0D7B,GAtCgB,SAAUu7B,GAErC,SAAS4kD,IACL,OAAkB,OAAX5kD,GAAmBA,EAAOh7B,MAAMN,KAAMI,YAAcJ,KAiC/D,OAnCA,GAAUkgF,EAAW5kD,GAOrB4kD,EAAUvjF,UAAU03E,YAAc,SAAU7W,GACxC,KAAOx9D,KAAKmhC,kBAAkB,CAE1B,GADWnhC,KAAK6/E,WACPr+C,WAAYg8B,EACjB,MAGAx9D,KAAKsiB,MAAM0yD,YAOvBkL,EAAUvjF,UAAUwjF,mBAAqB,WACrC,GAAwB,IAApBngF,KAAKk3C,WAAT,CAGA,IAEIjrC,EDaL,SAAiB3P,GACpB,OAAOA,EAAIyM,MAAM,KAAK4C,IAAIoK,QCfNqqE,CADNpgF,KAAK+/E,gBAEG,GAClB//E,KAAK4J,QAAQ,SAAU8uC,GACfA,EAAKi0B,UAAU,KAAO1gE,IACtBjM,KAAK6G,OAAO,GAAO6xC,EAAKi0B,YACxBj0B,EAAKs8B,YAEXz4E,KAAKyD,SAEJkgF,EApCmB,CAqC5B,ICnDa,GAMI,gBANJ,GAaE,cAbF,GAmBI,gBCzBf,GAAwC,WACxC,IAAI3gF,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAgN5C,SAASsgF,GAAkBC,GACvB,OAAKA,EAGD3gF,MAAMgC,QAAQ2+E,GACP,SAAUn3C,GACb,OAAOm3C,GAGgB,mBAApBA,EACAA,EAEJ,SAAUn3C,GACb,MAAO,CAACm3C,IAXD,KAcA,OAxKa,SAAUhlD,GAKlC,SAASilD,EAAOjpE,GACZ,IAAIwE,EAAQwf,EAAOpgC,KAAK8E,OAASA,KAKjC8b,EAAMouB,WAAa,GAAc5yB,EAAQ4yB,YAKzCpuB,EAAM0kE,cAAgBH,GAAkB/oE,EAAQwoD,cAKhDhkD,EAAM2kE,8BACkCnsD,IAApChd,EAAQopE,yBACFppE,EAAQopE,wBAOlB5kE,EAAMs/C,SAAU,EAKhBt/C,EAAMkqB,YACgB1R,IAAlBhd,EAAQ8uB,MAAsB9uB,EAAQ8uB,MAAQ,GAKlDtqB,EAAM6kE,YAA2BrsD,IAAlBhd,EAAQspE,OAAsBtpE,EAAQspE,MAKrD9kE,EAAM+kE,aAAe,KAKrB/kE,EAAMglE,aAAe,KACrB,IAAIxqD,EAAOxa,EASX,OAJAA,EAAMilE,aAAe,IAAI93C,SAAQ,SAAUC,EAAS83C,GAChD1qD,EAAKuqD,aAAe33C,EACpB5S,EAAKwqD,aAAeE,KAEjBllE,EAoFX,OAhJA,GAAUykE,EAAQjlD,GAmElBilD,EAAO5jF,UAAUkjE,gBAAkB,WAC/B,OAAO7/D,KAAKwgF,eAMhBD,EAAO5jF,UAAUojE,2BAA6B,WAC1C,OAAO//D,KAAKygF,0BAOhBF,EAAO5jF,UAAUkzD,cAAgB,WAC7B,OAAO7vD,KAAKkqC,YAMhBq2C,EAAO5jF,UAAU01D,eAAiB,WAC9B,OAAO,MAKXkuB,EAAO5jF,UAAUq+D,QAAU,WACvB,OAAOh7D,KAAK+gF,cAOhBR,EAAO5jF,UAAUksC,SAAW,WACxB,OAAO7oC,KAAKgmC,QAKhBu6C,EAAO5jF,UAAUkvC,SAAW,WACxB,OAAO7rC,KAAK2gF,QAKhBJ,EAAO5jF,UAAUi1E,kBAAoB,aAOrC2O,EAAO5jF,UAAUskF,QAAU,WACvBjhF,KAAK+jC,WASTw8C,EAAO5jF,UAAUukF,gBAAkB,SAAUphB,GACzC9/D,KAAKwgF,cAAgBH,GAAkBvgB,GACvC9/D,KAAK+jC,WAMTw8C,EAAO5jF,UAAUwzE,SAAW,SAAU/pC,GAClCpmC,KAAKgmC,OAASI,EACdpmC,KAAK+jC,WAEFw8C,EAjJgB,CAkJzB,IC3LEY,GAAe,CAAC,EAAG,EAAG,GA2hBX,GAtfe,WAI1B,SAASC,EAAS9pE,GjIyLf,IAAkBpB,EAAemrE,EAChCC,EiI3KIj1B,EACJ,GAXArsD,KAAK6lC,aAA8BvR,IAApBhd,EAAQuuB,QAAwBvuB,EAAQuuB,QAAU,EAKjE7lC,KAAK6tD,aAAev2C,EAAQo1C,YAC5BhxB,IjI8KiBxlB,EiI9KDlW,KAAK6tD,ajI8KWwzB,GiI5K7B,EjI6KHC,EiI/KmC,SAAUn3E,EAAG3K,GAC5C,OAAOA,EAAI2K,IjI8KOwvB,GACnBzjB,EAAIqrE,OAAM,SAAUC,EAAY/6E,GACnC,GAAc,IAAVA,EACA,OAAO,EAEX,IAAIg7E,EAAMH,EAAQprE,EAAIzP,EAAQ,GAAI+6E,GAClC,QAASC,EAAM,GAAMJ,GAAsB,IAARI,OiInLzB,KAGLnqE,EAAQoqE,QACT,IAAK,IAAI3mF,EAAI,EAAG2hC,EAAK18B,KAAK6tD,aAAaxtD,OAAS,EAAGtF,EAAI2hC,IAAM3hC,EACzD,GAAKsxD,GAID,GAAIrsD,KAAK6tD,aAAa9yD,GAAKiF,KAAK6tD,aAAa9yD,EAAI,KAAOsxD,EAAY,CAChEA,OAAa/3B,EACb,YALJ+3B,EAAarsD,KAAK6tD,aAAa9yD,GAAKiF,KAAK6tD,aAAa9yD,EAAI,GActEiF,KAAK4tD,YAAcvB,EAKnBrsD,KAAK8lC,QAAU9lC,KAAK6tD,aAAaxtD,OAAS,EAK1CL,KAAK2hF,aAA6BrtD,IAAnBhd,EAAQhU,OAAuBgU,EAAQhU,OAAS,KAK/DtD,KAAK4hF,SAAW,UACQttD,IAApBhd,EAAQoqE,UACR1hF,KAAK4hF,SAAWtqE,EAAQoqE,QACxBhmD,GAAO17B,KAAK4hF,SAASvhF,QAAUL,KAAK6tD,aAAaxtD,OAAQ,KAE7D,IAAIm8B,EAASllB,EAAQklB,YACNlI,IAAXkI,GAAyBx8B,KAAK2hF,SAAY3hF,KAAK4hF,WAC/C5hF,KAAK2hF,QAAU5jD,GAAWvB,IAE9Bd,IAAS17B,KAAK2hF,SAAW3hF,KAAK4hF,UAAc5hF,KAAK2hF,UAAY3hF,KAAK4hF,SAAW,IAK7E5hF,KAAK6hF,WAAa,UACQvtD,IAAtBhd,EAAQwqE,YACR9hF,KAAK6hF,WAAavqE,EAAQwqE,UAC1BpmD,GAAO17B,KAAK6hF,WAAWxhF,QAAUL,KAAK6tD,aAAaxtD,OAAQ,KAM/DL,KAAK+hF,eACoBztD,IAArBhd,EAAQ0qE,SACF1qE,EAAQ0qE,SACPhiF,KAAK6hF,WAEF,KjDxHS,IiDyHvBnmD,IAAS17B,KAAK+hF,WAAa/hF,KAAK6hF,YAC3B7hF,KAAK+hF,YAAc/hF,KAAK6hF,WAAa,IAK1C7hF,KAAK65C,aAAqBvlB,IAAXkI,EAAuBA,EAAS,KAK/Cx8B,KAAKiiF,gBAAkB,KAKvBjiF,KAAKkiF,SAAW,CAAC,EAAG,GAKpBliF,KAAKmiF,WAAa,CAAC,EAAG,EAAG,EAAG,QACN7tD,IAAlBhd,EAAQ8qE,MACRpiF,KAAKiiF,gBAAkB3qE,EAAQ8qE,MAAMz2E,KAAI,SAAUmI,EAAM7H,GACrD,IAAI4gE,EAAY,IAAI,GAAUvqE,KAAKiG,IAAI,EAAGuL,EAAK,IAAKxR,KAAKgG,IAAIwL,EAAK,GAAK,GAAI,GAAIxR,KAAKiG,IAAI,EAAGuL,EAAK,IAAKxR,KAAKgG,IAAIwL,EAAK,GAAK,GAAI,IAC5H,GAAI0oB,EAAQ,CACR,IAAI6lD,EAAsBriF,KAAK+wE,0BAA0Bv0C,EAAQvwB,GACjE4gE,EAAU1qD,KAAO7f,KAAKgG,IAAI+5E,EAAoBlgE,KAAM0qD,EAAU1qD,MAC9D0qD,EAAU5qD,KAAO3f,KAAKiG,IAAI85E,EAAoBpgE,KAAM4qD,EAAU5qD,MAC9D4qD,EAAUzqD,KAAO9f,KAAKgG,IAAI+5E,EAAoBjgE,KAAMyqD,EAAUzqD,MAC9DyqD,EAAU3qD,KAAO5f,KAAKiG,IAAI85E,EAAoBngE,KAAM2qD,EAAU3qD,MAElE,OAAO2qD,IACR7sE,MAEEw8B,GACLx8B,KAAKsiF,qBAAqB9lD,GA+XlC,OApXA4kD,EAASzkF,UAAU4lF,iBAAmB,SAAU/lD,EAAQ3mB,EAAM6L,GAE1D,IADA,IAAImrD,EAAY7sE,KAAK+wE,0BAA0Bv0C,EAAQ3mB,GAC9C9a,EAAI8xE,EAAU1qD,KAAMua,EAAKmwC,EAAU5qD,KAAMlnB,GAAK2hC,IAAM3hC,EACzD,IAAK,IAAIyd,EAAIq0D,EAAUzqD,KAAMyjC,EAAKgnB,EAAU3qD,KAAM1J,GAAKqtC,IAAMrtC,EACzDkJ,EAAS,CAAC7L,EAAM9a,EAAGyd,KAW/B4oE,EAASzkF,UAAU80E,gCAAkC,SAAU9E,EAAWjrD,EAAU8gE,EAAerlD,GAC/F,IAAex5B,EAAGC,EACd6+E,EAAkB,KAClBx2E,EAAI0gE,EAAU,GAAK,EAQvB,IAPyB,IAArB3sE,KAAK4tD,aACLjqD,EAAIgpE,EAAU,GACd/oE,EAAI+oE,EAAU,IAGd8V,EAAkBziF,KAAK2yE,mBAAmBhG,EAAWxvC,GAElDlxB,GAAKjM,KAAK6lC,SAAS,CAStB,GAAInkB,EAASzV,EARY,IAArBjM,KAAK4tD,YAGO,GAFZjqD,EAAIrB,KAAKohB,MAAM/f,EAAI,GAEoBA,EADvCC,EAAItB,KAAKohB,MAAM9f,EAAI,GAC0BA,EAAG4+E,GAGpCxiF,KAAK+wE,0BAA0B0R,EAAiBx2E,EAAGu2E,IAG/D,OAAO,IAETv2E,EAEN,OAAO,GAOXm1E,EAASzkF,UAAUiqC,UAAY,WAC3B,OAAO5mC,KAAK65C,SAOhBunC,EAASzkF,UAAUqqC,WAAa,WAC5B,OAAOhnC,KAAK8lC,SAOhBs7C,EAASzkF,UAAUoqC,WAAa,WAC5B,OAAO/mC,KAAK6lC,SAQhBu7C,EAASzkF,UAAU0G,UAAY,SAAU4I,GACrC,OAAIjM,KAAK2hF,QACE3hF,KAAK2hF,QAGL3hF,KAAK4hF,SAAS31E,IAS7Bm1E,EAASzkF,UAAUsyD,cAAgB,SAAUhjD,GACzC,OAAOjM,KAAK6tD,aAAa5hD,IAO7Bm1E,EAASzkF,UAAU01D,eAAiB,WAChC,OAAOryD,KAAK6tD,cAQhBuzB,EAASzkF,UAAU40E,2BAA6B,SAAU5E,EAAW6V,EAAerlD,GAChF,GAAIwvC,EAAU,GAAK3sE,KAAK8lC,QAAS,CAC7B,GAAyB,IAArB9lC,KAAK4tD,YAAmB,CACxB,IAAIzrC,EAAsB,EAAfwqD,EAAU,GACjBvqD,EAAsB,EAAfuqD,EAAU,GACrB,OAAO,GAAwBxqD,EAAMA,EAAO,EAAGC,EAAMA,EAAO,EAAGogE,GAEnE,IAAIC,EAAkBziF,KAAK2yE,mBAAmBhG,EAAWxvC,GAAcn9B,KAAKmiF,YAC5E,OAAOniF,KAAK+wE,0BAA0B0R,EAAiB9V,EAAU,GAAK,EAAG6V,GAE7E,OAAO,MAQXpB,EAASzkF,UAAU+lF,6BAA+B,SAAU/V,EAAW1gE,EAAGu2E,GACtE,GAAIv2E,EAAIjM,KAAK8lC,SAAW75B,EAAIjM,KAAK6lC,QAC7B,OAAO,KAEX,IAAI88C,EAAahW,EAAU,GACvBiW,EAAajW,EAAU,GACvBkW,EAAalW,EAAU,GAC3B,GAAI1gE,IAAM02E,EACN,OAAO,GAAwBC,EAAYC,EAAYD,EAAYC,EAAYL,GAEnF,GAAIxiF,KAAK4tD,YAAa,CAClB,IAAItyC,EAAShZ,KAAKmL,IAAIzN,KAAK4tD,YAAa3hD,EAAI02E,GACxCxgE,EAAO7f,KAAKohB,MAAMk/D,EAAatnE,GAC/B8G,EAAO9f,KAAKohB,MAAMm/D,EAAavnE,GACnC,OAAIrP,EAAI02E,EACG,GAAwBxgE,EAAMA,EAAMC,EAAMA,EAAMogE,GAIpD,GAAwBrgE,EAFpB7f,KAAKohB,MAAMpI,GAAUsnE,EAAa,IAAM,EAERxgE,EADhC9f,KAAKohB,MAAMpI,GAAUunE,EAAa,IAAM,EACIL,GAE3D,IAAIC,EAAkBziF,KAAK2yE,mBAAmBhG,EAAW3sE,KAAKmiF,YAC9D,OAAOniF,KAAK+wE,0BAA0B0R,EAAiBx2E,EAAGu2E,IAS9DpB,EAASzkF,UAAUmmF,mBAAqB,SAAU72E,EAAG4gE,EAAW1vC,GAC5D,IAAI75B,EAAStD,KAAKqD,UAAU4I,GACxByyB,EAAa1+B,KAAKivD,cAAchjD,GAChC+1E,EAAW9rB,GAAOl2D,KAAK4+E,YAAY3yE,GAAIjM,KAAKkiF,UAC5C//D,EAAO7e,EAAO,GAAKupE,EAAU1qD,KAAO6/D,EAAS,GAAKtjD,EAClDzc,EAAO3e,EAAO,IAAMupE,EAAU5qD,KAAO,GAAK+/D,EAAS,GAAKtjD,EAG5D,OAAOxB,GAAe/a,EAFX7e,EAAO,GAAKupE,EAAUzqD,KAAO4/D,EAAS,GAAKtjD,EAEpBzc,EADvB3e,EAAO,IAAMupE,EAAU3qD,KAAO,GAAK8/D,EAAS,GAAKtjD,EACdvB,IASlDikD,EAASzkF,UAAUo0E,0BAA4B,SAAUv0C,EAAQvwB,EAAGu2E,GAChE,IAAI7V,EAAYwU,GAChBnhF,KAAK+iF,uBAAuBvmD,EAAO,GAAIA,EAAO,GAAIvwB,GAAG,EAAO0gE,GAC5D,IAAIxqD,EAAOwqD,EAAU,GACjBvqD,EAAOuqD,EAAU,GAErB,OADA3sE,KAAK+iF,uBAAuBvmD,EAAO,GAAIA,EAAO,GAAIvwB,GAAG,EAAM0gE,GACpD,GAAwBxqD,EAAMwqD,EAAU,GAAIvqD,EAAMuqD,EAAU,GAAI6V,IAM3EpB,EAASzkF,UAAU63E,mBAAqB,SAAU7H,GAC9C,IAAIrpE,EAAStD,KAAKqD,UAAUspE,EAAU,IAClCjuC,EAAa1+B,KAAKivD,cAAc0d,EAAU,IAC1CqV,EAAW9rB,GAAOl2D,KAAK4+E,YAAYjS,EAAU,IAAK3sE,KAAKkiF,UAC3D,MAAO,CACH5+E,EAAO,IAAMqpE,EAAU,GAAK,IAAOqV,EAAS,GAAKtjD,EACjDp7B,EAAO,IAAMqpE,EAAU,GAAK,IAAOqV,EAAS,GAAKtjD,IAWzD0iD,EAASzkF,UAAUg2E,mBAAqB,SAAUhG,EAAWxvC,GACzD,IAAI75B,EAAStD,KAAKqD,UAAUspE,EAAU,IAClCjuC,EAAa1+B,KAAKivD,cAAc0d,EAAU,IAC1CqV,EAAW9rB,GAAOl2D,KAAK4+E,YAAYjS,EAAU,IAAK3sE,KAAKkiF,UACvD//D,EAAO7e,EAAO,GAAKqpE,EAAU,GAAKqV,EAAS,GAAKtjD,EAChDtc,EAAO9e,EAAO,IAAMqpE,EAAU,GAAK,GAAKqV,EAAS,GAAKtjD,EAG1D,OAAOxB,GAAe/a,EAAMC,EAFjBD,EAAO6/D,EAAS,GAAKtjD,EACrBtc,EAAO4/D,EAAS,GAAKtjD,EACcvB,IAalDikD,EAASzkF,UAAUqmF,kCAAoC,SAAUlnD,EAAY4C,EAAYshD,GACrF,OAAOhgF,KAAKijF,gCAAgCnnD,EAAW,GAAIA,EAAW,GAAI4C,GAAY,EAAOshD,IAejGoB,EAASzkF,UAAUsmF,gCAAkC,SAAUt/E,EAAGC,EAAG86B,EAAYwkD,EAA2BlD,GACxG,IAAI/zE,EAAIjM,KAAK0wE,kBAAkBhyC,GAC3B9uB,EAAQ8uB,EAAa1+B,KAAKivD,cAAchjD,GACxC3I,EAAStD,KAAKqD,UAAU4I,GACxB+1E,EAAW9rB,GAAOl2D,KAAK4+E,YAAY3yE,GAAIjM,KAAKkiF,UAC5CiB,EAAUD,EAA4B,GAAM,EAC5CE,EAAUF,EAA4B,GAAM,EAC5CG,EAAc/gF,KAAKohB,OAAO/f,EAAIL,EAAO,IAAMo7B,EAAaykD,GACxDG,EAAchhF,KAAKohB,OAAOpgB,EAAO,GAAKM,GAAK86B,EAAa0kD,GACxDR,EAAchzE,EAAQyzE,EAAerB,EAAS,GAC9Ca,EAAcjzE,EAAQ0zE,EAAetB,EAAS,GASlD,OARIkB,GACAN,EAAatgF,KAAK8qD,KAAKw1B,GAAc,EACrCC,EAAavgF,KAAK8qD,KAAKy1B,GAAc,IAGrCD,EAAatgF,KAAKohB,MAAMk/D,GACxBC,EAAavgF,KAAKohB,MAAMm/D,IAErB,GAAwB52E,EAAG22E,EAAYC,EAAY7C,IAiB9DoB,EAASzkF,UAAUomF,uBAAyB,SAAUp/E,EAAGC,EAAGqI,EAAGi3E,EAA2BlD,GACtF,IAAI18E,EAAStD,KAAKqD,UAAU4I,GACxByyB,EAAa1+B,KAAKivD,cAAchjD,GAChC+1E,EAAW9rB,GAAOl2D,KAAK4+E,YAAY3yE,GAAIjM,KAAKkiF,UAC5CiB,EAAUD,EAA4B,GAAM,EAC5CE,EAAUF,EAA4B,GAAM,EAC5CG,EAAc/gF,KAAKohB,OAAO/f,EAAIL,EAAO,IAAMo7B,EAAaykD,GACxDG,EAAchhF,KAAKohB,OAAOpgB,EAAO,GAAKM,GAAK86B,EAAa0kD,GACxDR,EAAaS,EAAcrB,EAAS,GACpCa,EAAaS,EAActB,EAAS,GASxC,OARIkB,GACAN,EAAatgF,KAAK8qD,KAAKw1B,GAAc,EACrCC,EAAavgF,KAAK8qD,KAAKy1B,GAAc,IAGrCD,EAAatgF,KAAKohB,MAAMk/D,GACxBC,EAAavgF,KAAKohB,MAAMm/D,IAErB,GAAwB52E,EAAG22E,EAAYC,EAAY7C,IAU9DoB,EAASzkF,UAAU81E,yBAA2B,SAAU32C,EAAY7vB,EAAG+zE,GACnE,OAAOhgF,KAAK+iF,uBAAuBjnD,EAAW,GAAIA,EAAW,GAAI7vB,GAAG,EAAO+zE,IAM/EoB,EAASzkF,UAAU4mF,uBAAyB,SAAU5W,GAClD,OAAO3sE,KAAK6tD,aAAa8e,EAAU,KAUvCyU,EAASzkF,UAAUiiF,YAAc,SAAU3yE,GACvC,OAAIjM,KAAK+hF,UACE/hF,KAAK+hF,UAGL/hF,KAAK6hF,WAAW51E,IAO/Bm1E,EAASzkF,UAAU6mF,iBAAmB,SAAUv3E,GAC5C,OAAKjM,KAAKiiF,gBAMCjiF,KAAKiiF,gBAAgBh2E,GALrBjM,KAAK65C,QACN75C,KAAK+wE,0BAA0B/wE,KAAK65C,QAAS5tC,GAC7C,MAuBdm1E,EAASzkF,UAAU+zE,kBAAoB,SAAUhyC,EAAYq3B,GAEzD,OAAOj2B,GADClG,GAAkB55B,KAAK6tD,aAAcnvB,EAAYq3B,GAAiB,GAC1D/1D,KAAK6lC,QAAS7lC,KAAK8lC,UAMvCs7C,EAASzkF,UAAU2lF,qBAAuB,SAAU9lD,GAGhD,IAFA,IAAIn8B,EAASL,KAAK6tD,aAAaxtD,OAC3BojF,EAAiB,IAAI9jF,MAAMU,GACtB4L,EAAIjM,KAAK6lC,QAAS55B,EAAI5L,IAAU4L,EACrCw3E,EAAex3E,GAAKjM,KAAK+wE,0BAA0Bv0C,EAAQvwB,GAE/DjM,KAAKiiF,gBAAkBwB,GAEpBrC,EApfkB,GCrCtB,SAASsC,GAAiBx5C,GAC7B,IAAIiR,EAAWjR,EAAW+Q,qBAK1B,OAJKE,IACDA,EA0GD,SAA6BjR,EAAYy5C,EAAaC,EAAcC,GAEvE,OA1EG,SAAyBrnD,EAAQmnD,EAAaC,EAAcC,GAC/D,IAAItlD,OAAwBjK,IAAfuvD,EAA2BA,EAAarlD,GACjDkuB,EAAco3B,GAAsBtnD,EAAQmnD,EAAaC,GAC7D,OAAO,IAAI,GAAS,CAChBpnD,OAAQA,EACRl5B,OAAQg7B,GAAU9B,EAAQ+B,GAC1BmuB,YAAaA,EACbs1B,SAAU4B,IAmEPG,CADMC,GAAqB95C,GACHy5C,EAAaC,EAAcC,GA5G3CI,CAAoB/5C,GAC/BA,EAAWgR,mBAAmBC,IAE3BA,EA+EX,SAAS2oC,GAAsBtnD,EAAQmnD,EAAaC,EAAcM,GAU9D,IATA,IAAIp+C,OAA0BxR,IAAhBqvD,EAA4BA,ElD9FhB,GkD+FtBzgF,EAASk7B,GAAU5B,GACnBv5B,EAAQk7B,GAAS3B,GACjBwlD,EAAW9rB,QAAwB5hC,IAAjBsvD,EAA6BA,ElD5FxB,KkD6FvBj+C,EAAgBu+C,EAAoB,EAClCA,EACA5hF,KAAKgG,IAAIrF,EAAQ++E,EAAS,GAAI9+E,EAAS8+E,EAAS,IAClD3hF,EAASylC,EAAU,EACnB4mB,EAAc,IAAI/sD,MAAMU,GACnB4L,EAAI,EAAGA,EAAI5L,IAAU4L,EAC1BygD,EAAYzgD,GAAK05B,EAAgBrjC,KAAKmL,IAAI,EAAGxB,GAEjD,OAAOygD,EAqBJ,SAASs3B,GAAqB95C,GAEjC,IAAI1N,GADJ0N,EAAa,GAAcA,IACHtD,YACxB,IAAKpK,EAAQ,CACT,IAAI2nD,EAAQ,IAAM1qC,GAAgB,GAAMN,SAAYjP,EAAW0Q,mBAC/Dpe,EAASU,IAAgBinD,GAAOA,EAAMA,EAAMA,GAEhD,OAAO3nD,EC7IX,IAAI,GAAwC,WACxC,IAAIj9B,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA2DxC,GAA4B,SAAUu7B,GAKtC,SAAS8oD,EAAW9sE,GAChB,IAAIwE,EAAQwf,EAAOpgC,KAAK8E,KAAM,CAC1B8/D,aAAcxoD,EAAQwoD,aACtB4gB,wBAAyBppE,EAAQopE,wBACjCx2C,WAAY5yB,EAAQ4yB,WACpB9D,MAAO9uB,EAAQ8uB,MACfw6C,MAAOtpE,EAAQspE,SACb5gF,KAIN8b,EAAM3E,GAIN2E,EAAM8nB,KAIN9nB,EAAM+nB,GAKN/nB,EAAMuoE,aAA6B/vD,IAAnBhd,EAAQgtE,QAAuBhtE,EAAQgtE,OAKvDxoE,EAAMyoE,qBACyBjwD,IAA3Bhd,EAAQs5D,eAA+Bt5D,EAAQs5D,eAAiB,EAKpE90D,EAAMq/B,cAAgC7mB,IAArBhd,EAAQ6jC,SAAyB7jC,EAAQ6jC,SAAW,KACrE,IACIA,EAAW7jC,EAAQ6jC,SAgCvB,OA/BIA,GACA+a,GAAO/a,EAASyjC,YAAYzjC,EAASpU,cAH1B,CAAC,IAAK,MASrBjrB,EAAM0oE,UAAY,IAAI,GAAUltE,EAAQupB,WAAa,GAKrD/kB,EAAM2oE,QAAU,CAAC,EAAG,GAKpB3oE,EAAM4jE,KAAOpoE,EAAQhb,KAAO,GAK5Bwf,EAAM4oE,YAAc,CAAErR,WAAY/7D,EAAQ+7D,YAQ1Cv3D,EAAM60D,WAAar5D,EAAQq5D,WAAar5D,EAAQq5D,WAAa,EACtD70D,EAgNX,OAzRA,GAAUsoE,EAAY9oD,GA8EtB8oD,EAAWznF,UAAUwkC,eAAiB,WAClC,OAAOnhC,KAAKwkF,UAAUrjD,kBAM1BijD,EAAWznF,UAAU03E,YAAc,SAAUnqC,EAAYszB,GACrD,IAAIgnB,EAAYxkF,KAAK2kF,0BAA0Bz6C,GAC3Cs6C,GACAA,EAAUnQ,YAAY7W,IAY9B4mB,EAAWznF,UAAUmwE,kBAAoB,SAAU5iC,EAAYj+B,EAAG4gE,EAAWnrD,GACzE,IAAI8iE,EAAYxkF,KAAK2kF,0BAA0Bz6C,GAC/C,IAAKs6C,EACD,OAAO,EAIX,IAFA,IACI9rC,EAAMs6B,EAAc4R,EADpBpT,GAAU,EAEL7tE,EAAIkpE,EAAU1qD,KAAMxe,GAAKkpE,EAAU5qD,OAAQte,EAChD,IAAK,IAAIC,EAAIipE,EAAUzqD,KAAMxe,GAAKipE,EAAU3qD,OAAQte,EAChDovE,EAAeiN,GAAUh0E,EAAGtI,EAAGC,GAC/BghF,GAAS,EACLJ,EAAUjF,YAAYvM,KAEtB4R,GADAlsC,EAAqD8rC,EAAU5oF,IAAIo3E,IACrDnqC,aAAe8P,MAEzBisC,GAA4B,IAAnBljE,EAASg3B,IAGrBksC,IACDpT,GAAU,GAItB,OAAOA,GAMX4S,EAAWznF,UAAUm2E,uBAAyB,SAAU5oC,GACpD,OAAO,GAOXk6C,EAAWznF,UAAU6kC,OAAS,WAC1B,OAAOxhC,KAAK0/E,MAOhB0E,EAAWznF,UAAUkoF,OAAS,SAAUvoF,GAChC0D,KAAK0/E,OAASpjF,IACd0D,KAAK0/E,KAAOpjF,EACZ0D,KAAK+jC,YAObqgD,EAAWznF,UAAUs1E,UAAY,SAAU/nC,GACvC,OAAOlqC,KAAKqkF,SAKhBD,EAAWznF,UAAU01D,eAAiB,WAClC,OAAOryD,KAAKm7C,SAASkX,kBAWzB+xB,EAAWznF,UAAUuzE,QAAU,SAAUjkE,EAAGtI,EAAGC,EAAGuzD,EAAYjtB,GAC1D,OAAO,MAOXk6C,EAAWznF,UAAUmoF,YAAc,WAC/B,OAAO9kF,KAAKm7C,UAMhBipC,EAAWznF,UAAU8zE,yBAA2B,SAAUvmC,GACtD,OAAKlqC,KAAKm7C,SAICn7C,KAAKm7C,SAHL,GAAyBjR,IAWxCk6C,EAAWznF,UAAUgoF,0BAA4B,SAAUz6C,GAGvD,OAFAxO,GAAOsiB,GAAWh+C,KAAK6vD,gBAAiB3lB,GAAa,IAE9ClqC,KAAKwkF,WAShBJ,EAAWznF,UAAUk0E,kBAAoB,SAAU1Z,GAC/C,OAAOn3D,KAAKukF,iBAQhBH,EAAWznF,UAAUy1E,iBAAmB,SAAUnmE,EAAGkrD,EAAYjtB,GAC7D,IlDrPcp2B,EAAM2rC,EAAOgS,EkDqPvBtW,EAAWn7C,KAAKywE,yBAAyBvmC,GACzC0mC,EAAiB5wE,KAAK6wE,kBAAkB1Z,GACxC6qB,EAAW9rB,GAAO/a,EAASyjC,YAAY3yE,GAAIjM,KAAKykF,SACpD,OAAsB,GAAlB7T,EACOoR,GlDzPGluE,EkD4POkuE,ElD5PDviC,EkD4PWmxB,OlD3PlBt8C,KADcm9B,EkD4PoBzxD,KAAKykF,WlD1PpDhzB,EAAW,CAAC,EAAG,IAEnBA,EAAS,GAAM39C,EAAK,GAAK2rC,EAAQ,GAAO,EACxCgS,EAAS,GAAM39C,EAAK,GAAK2rC,EAAQ,GAAO,EACjCgS,IkDkQP2yB,EAAWznF,UAAUooF,+BAAiC,SAAUpY,EAAWqY,GACvE,IAAI96C,OAAgC5V,IAAnB0wD,EAA+BA,EAAiBhlF,KAAK6vD,gBAClE1U,EAAWn7C,KAAKywE,yBAAyBvmC,GAI7C,OAHIlqC,KAAK6rC,YAAc3B,EAAW6Q,aAC9B4xB,EDrRL,SAAexxB,EAAUwxB,EAAWziC,GACvC,IAAIj+B,EAAI0gE,EAAU,GACd52C,EAASolB,EAASq5B,mBAAmB7H,GACrCviC,EAAmB45C,GAAqB95C,GAC5C,GAAKrN,GAAmBuN,EAAkBrU,GAOtC,OAAO42C,EANP,IAAInhC,EAAarN,GAASiM,GACtBC,EAAa/nC,KAAK8qD,MAAMhjB,EAAiB,GAAKrU,EAAO,IAAMyV,GAE/D,OADAzV,EAAO,IAAMyV,EAAanB,EACnB8Q,EAASs3B,yBAAyB18C,EAAQ9pB,GC6QjC,CAAMkvC,EAAUwxB,EAAWziC,INtO5C,SAA0ByiC,EAAWxxB,GACxC,IAAIlvC,EAAI0gE,EAAU,GACdhpE,EAAIgpE,EAAU,GACd/oE,EAAI+oE,EAAU,GAClB,GAAIxxB,EAASpU,aAAe96B,GAAKA,EAAIkvC,EAASnU,aAC1C,OAAO,EAEX,IAAI6lC,EAAY1xB,EAASqoC,iBAAiBv3E,GAC1C,OAAK4gE,GAIMA,EAAU/vC,WAAWn5B,EAAGC,GM4NxBqhF,CAAiBtY,EAAWxxB,GAAYwxB,EAAY,MAM/DyX,EAAWznF,UAAUykB,MAAQ,WACzBphB,KAAKwkF,UAAUpjE,SAEnBgjE,EAAWznF,UAAUskF,QAAU,WAC3BjhF,KAAKohB,QACLka,EAAO3+B,UAAUskF,QAAQ/lF,KAAK8E,OAOlCokF,EAAWznF,UAAU+3E,gBAAkB,SAAUH,EAAWrqC,GACxD,IAAIs6C,EAAYxkF,KAAK2kF,0BAA0Bz6C,GAC3CqqC,EAAYiQ,EAAUtF,gBACtBsF,EAAUtF,cAAgB3K,IAWlC6P,EAAWznF,UAAU83E,QAAU,SAAUxoE,EAAGtI,EAAGC,EAAGsmC,KAC3Ck6C,EA1RoB,CA2R7B,IAMEc,GAAiC,SAAU5pD,GAM3C,SAAS4pD,EAAgB3sE,EAAMmgC,GAC3B,IAAI58B,EAAQwf,EAAOpgC,KAAK8E,KAAMuY,IAASvY,KAOvC,OADA8b,EAAM48B,KAAOA,EACN58B,EAEX,OAfA,GAAUopE,EAAiB5pD,GAepB4pD,EAhByB,CAiBlCjtE,IAEa,MCpWR,SAASktE,GAAmBC,EAAUjqC,GACzC,IAAIkqC,EAAS,SACTC,EAAS,SACTC,EAAS,SACTC,EAAa,UACjB,OAAO,SAOG7Y,EAAWxV,EAAYjtB,GAC7B,OAAKyiC,EAIMyY,EACF1iF,QAAQ2iF,EAAQ1Y,EAAU,GAAGnkE,YAC7B9F,QAAQ4iF,EAAQ3Y,EAAU,GAAGnkE,YAC7B9F,QAAQ6iF,EAAQ5Y,EAAU,GAAGnkE,YAC7B9F,QAAQ8iF,GAAY,WACrB,IAAIv5E,EAAI0gE,EAAU,GACd8Y,EAAQtqC,EAASqoC,iBAAiBv3E,GAGtC,OAFAyvB,GAAO+pD,EAAO,KACNA,EAAMrnD,YAAcuuC,EAAU,GAAK,GAClCnkE,mBAZb,GAsBL,SAASk9E,GAAoBC,EAAWxqC,GAG3C,IAFA,IAAIj/B,EAAMypE,EAAUtlF,OAChBulF,EAAmB,IAAIjmF,MAAMuc,GACxBnhB,EAAI,EAAGA,EAAImhB,IAAOnhB,EACvB6qF,EAAiB7qF,GAAKoqF,GAAmBQ,EAAU5qF,GAAIogD,GAE3D,OAMG,SAAoCyqC,GACvC,GAAgC,IAA5BA,EAAiBvlF,OACjB,OAAOulF,EAAiB,GAE5B,OAAO,SAOGjZ,EAAWxV,EAAYjtB,GAC7B,GAAKyiC,EAGA,CACD,IACIlmE,EAAQ65B,GPRjB,SAAcqsC,GACjB,OAAQA,EAAU,IAAMA,EAAU,IAAMA,EAAU,GOMlC,CAAcA,GACAiZ,EAAiBvlF,QACvC,OAAOulF,EAAiBn/E,GAAOkmE,EAAWxV,EAAYjtB,KAxBvD27C,CAA2BD,GCrDtC,IAAI,GAAwC,WACxC,IAAIrmF,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAsO7B,GArLc,SAAUu7B,GAKnC,SAASwqD,EAAQxuE,GACb,IAAIwE,EAAQwf,EAAOpgC,KAAK8E,KAAM,CAC1B8/D,aAAcxoD,EAAQwoD,aACtBj/B,UAAWvpB,EAAQupB,UACnByjD,OAAQhtE,EAAQgtE,OAChBp6C,WAAY5yB,EAAQ4yB,WACpB9D,MAAO9uB,EAAQ8uB,MACf+U,SAAU7jC,EAAQ6jC,SAClBy1B,eAAgBt5D,EAAQs5D,eACxBgQ,MAAOtpE,EAAQspE,MACfvN,WAAY/7D,EAAQ+7D,WACpB/2E,IAAKgb,EAAQhb,IACbokF,wBAAyBppE,EAAQopE,wBACjC/P,WAAYr5D,EAAQq5D,cAClB3wE,KA+BN,OA1BA8b,EAAMiqE,yBACFjqE,EAAMkqE,kBAAoBF,EAAQnpF,UAAUqpF,gBAKhDlqE,EAAMy6D,iBAAmBj/D,EAAQi/D,iBAC7Bj/D,EAAQ0uE,kBACRlqE,EAAMkqE,gBAAkB1uE,EAAQ0uE,iBAMpClqE,EAAMmqE,KAAO,KACT3uE,EAAQ2uE,KACRnqE,EAAMoqE,QAAQ5uE,EAAQ2uE,MAEjB3uE,EAAQ6J,KACbrF,EAAMqqE,OAAO7uE,EAAQ6J,KAMzBrF,EAAMsqE,iBAAmB,GAClBtqE,EAiIX,OAlLA,GAAUgqE,EAASxqD,GAwDnBwqD,EAAQnpF,UAAU0pF,oBAAsB,WACpC,OAAOrmF,KAAKu2E,kBAOhBuP,EAAQnpF,UAAU2pF,mBAAqB,WACnC,OAAO7qF,OAAO8qF,eAAevmF,MAAMgmF,kBAAoBhmF,KAAKgmF,gBACtDhmF,KAAKgmF,gBAAgBzpF,KAAKyD,MAC1BA,KAAKgmF,iBASfF,EAAQnpF,UAAU6pF,QAAU,WACxB,OAAOxmF,KAAKimF,MAOhBH,EAAQnpF,UAAUy7C,iBAAmB,SAAU3gC,GAC3C,IAGIc,EAHAmgC,EAAoDjhC,EAAY,OAChE05D,EAAM92C,GAAOqe,GACbu3B,EAAYv3B,EAAK7P,WAEjBonC,GAAat3B,IACb34C,KAAKomF,iBAAiBjV,IAAO,EAC7B54D,EAAOkuE,IAEFtV,KAAOnxE,KAAKomF,0BACVpmF,KAAKomF,iBAAiBjV,GAC7B54D,EACI03D,GAAat3B,GACP8tC,GACAxW,GAAat3B,GACT8tC,QACAnyD,GAENA,MAAR/b,GACAvY,KAAKqY,cAAc,IAAI6sE,GAAgB3sE,EAAMmgC,KAQrDotC,EAAQnpF,UAAU+pF,oBAAsB,SAAUnQ,GAC9Cv2E,KAAKwkF,UAAUpjE,QACfphB,KAAKu2E,iBAAmBA,EACxBv2E,KAAK+jC,WAQT+hD,EAAQnpF,UAAUgqF,mBAAqB,SAAUX,EAAiB1pF,GAC9D0D,KAAKgmF,gBAAkBA,EACvBhmF,KAAKwkF,UAAUrE,0BACI,IAAR7jF,EACP0D,KAAK6kF,OAAOvoF,GAGZ0D,KAAK+jC,WAQb+hD,EAAQnpF,UAAUwpF,OAAS,SAAUhlE,GACjC,IAAI8kE,ED9FL,SAAmB9kE,GACtB,IAAI8kE,EAAO,GACPzsE,EAAQ,sBAAsBpN,KAAK+U,GACvC,GAAI3H,EAAO,CAEP,IAAIotE,EAAgBptE,EAAM,GAAGkuD,WAAW,GACpCmf,EAAertE,EAAM,GAAGkuD,WAAW,GACnCD,OAAW,EACf,IAAKA,EAAWmf,EAAenf,GAAYof,IAAgBpf,EACvDwe,EAAKplF,KAAKsgB,EAAIze,QAAQ8W,EAAM,GAAI1Z,OAAOgnF,aAAarf,KAExD,OAAOwe,EAGX,GADAzsE,EAAQ,kBAAkBpN,KAAK+U,GACpB,CAGP,IADA,IAAI4lE,EAAS16E,SAASmN,EAAM,GAAI,IACvBze,EAAIsR,SAASmN,EAAM,GAAI,IAAKze,GAAKgsF,EAAQhsF,IAC9CkrF,EAAKplF,KAAKsgB,EAAIze,QAAQ8W,EAAM,GAAIze,EAAEyN,aAEtC,OAAOy9E,EAGX,OADAA,EAAKplF,KAAKsgB,GACH8kE,ECuEQe,CAAU7lE,GACrBnhB,KAAKimF,KAAOA,EACZjmF,KAAKkmF,QAAQD,IAOjBH,EAAQnpF,UAAUupF,QAAU,SAAUD,GAClCjmF,KAAKimF,KAAOA,EACZ,IAAI3pF,EAAM2pF,EAAK98E,KAAK,MAChBnJ,KAAK+lF,yBACL/lF,KAAK2mF,mBAAmBjB,GAAoBO,EAAMjmF,KAAKm7C,UAAW7+C,GAGlE0D,KAAK6kF,OAAOvoF,IASpBwpF,EAAQnpF,UAAUqpF,gBAAkB,SAAUrZ,EAAWxV,EAAYjtB,KASrE47C,EAAQnpF,UAAU83E,QAAU,SAAUxoE,EAAGtI,EAAGC,GACxC,IAAIovE,EAAeiN,GAAUh0E,EAAGtI,EAAGC,GAC/B5D,KAAKwkF,UAAUjF,YAAYvM,IAC3BhzE,KAAKwkF,UAAU5oF,IAAIo3E,IAGpB8S,EAnLiB,CAoL1B,ICrOE,GAAwC,WACxC,IAAIvmF,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GA0a5C,SAASknF,GAAwBC,EAAWrlE,GACUqlE,EAAU/S,WAAYtyD,IACpEA,EAEO,OA9VgB,SAAUyZ,GAKrC,SAAS6rD,EAAU7vE,GACf,IAAIwE,EAAQwf,EAAOpgC,KAAK8E,KAAM,CAC1B8/D,aAAcxoD,EAAQwoD,aACtBj/B,UAAWvpB,EAAQupB,UACnByjD,OAAQhtE,EAAQgtE,OAChBp6C,WAAY5yB,EAAQ4yB,WACpB9D,MAAO9uB,EAAQ8uB,MACf+U,SAAU7jC,EAAQ6jC,SAClBo7B,iBAAkBj/D,EAAQi/D,iBACpBj/D,EAAQi/D,iBACR0Q,GACNrW,eAAgBt5D,EAAQs5D,eACxBoV,gBAAiB1uE,EAAQ0uE,gBACzB7kE,IAAK7J,EAAQ6J,IACb8kE,KAAM3uE,EAAQ2uE,KACdrF,MAAOtpE,EAAQspE,MACfvN,WAAY/7D,EAAQ+7D,WACpB/2E,IAAKgb,EAAQhb,IACbokF,wBAAyBppE,EAAQopE,wBACjC/P,WAAYr5D,EAAQq5D,cAClB3wE,KAuCN,OAlCA8b,EAAMylB,iBACsBjN,IAAxBhd,EAAQiqB,YAA4BjqB,EAAQiqB,YAAc,KAK9DzlB,EAAMsrE,eACoB9yD,IAAtBhd,EAAQ8vE,UAA0B9vE,EAAQ8vE,UAAY,GAK1DtrE,EAAMurE,uBAAyB,GAK/BvrE,EAAMwrE,sBAAwB,GAK9BxrE,EAAMyrE,4BAA8BjwE,EAAQkwE,2BAK5C1rE,EAAM2hE,iBACyB,IAA3BnmE,EAAQmwE,eAA2BrN,QAA2B9lD,EAKlExY,EAAM4rE,0BAA2B,EAC1B5rE,EAoRX,OAnVA,GAAUqrE,EAAW7rD,GAoErB6rD,EAAUxqF,UAAUwkC,eAAiB,WAIjC,GAAInhC,KAAKwkF,UAAUrjD,iBACf,OAAO,EAGP,IAAK,IAAI7kC,KAAO0D,KAAKqnF,uBACjB,GAAIrnF,KAAKqnF,uBAAuB/qF,GAAK6kC,iBACjC,OAAO,EAInB,OAAO,GAMXgmD,EAAUxqF,UAAU03E,YAAc,SAAUnqC,EAAYszB,GAKpD,IAAImqB,EAAgB3nF,KAAK2kF,0BAA0Bz6C,GAEnD,IAAK,IAAI5vB,KADTta,KAAKwkF,UAAUnQ,YAAYr0E,KAAKwkF,WAAamD,EAAgBnqB,EAAY,IAC1Dx9D,KAAKqnF,uBAAwB,CACxC,IAAI7C,EAAYxkF,KAAKqnF,uBAAuB/sE,GAC5CkqE,EAAUnQ,YAAYmQ,GAAamD,EAAgBnqB,EAAY,MAMvE2pB,EAAUxqF,UAAUi1E,kBAAoB,WACpC,OAAO5xE,KAAKy9E,iBAMhB0J,EAAUxqF,UAAUm2E,uBAAyB,SAAU5oC,GACnD,OACIlqC,KAAK6vD,iBACL3lB,IACC8T,GAAWh+C,KAAK6vD,gBAAiB3lB,GAC3B,EAGAlqC,KAAK4nF,aAMpBT,EAAUxqF,UAAUirF,UAAY,WAC5B,OAAO,GAOXT,EAAUxqF,UAAU6kC,OAAS,WACzB,OAAQlG,EAAO3+B,UAAU6kC,OAAOtmC,KAAK8E,OAChCA,KAAKy9E,gBAAkB,KAAOnzE,KAAKE,UAAUxK,KAAKy9E,iBAAmB,KAM9E0J,EAAUxqF,UAAUs1E,UAAY,SAAU/nC,GACtC,QACIlqC,KAAK6vD,iBACL3lB,IACC8T,GAAWh+C,KAAK6vD,gBAAiB3lB,KAI3B5O,EAAO3+B,UAAUs1E,UAAU/2E,KAAK8E,KAAMkqC,IAOrDi9C,EAAUxqF,UAAU8zE,yBAA2B,SAAUvmC,GAIrD,IAAI29C,EAAW7nF,KAAK6vD,gBACpB,IAAI7vD,KAAKm7C,UAAc0sC,IAAY7pC,GAAW6pC,EAAU39C,GAGnD,CACD,IAAI49C,EAAUztD,GAAO6P,GAKrB,OAJM49C,KAAW9nF,KAAKsnF,wBAClBtnF,KAAKsnF,sBAAsBQ,GACvB,GAAyB59C,IAE1BlqC,KAAKsnF,sBAAsBQ,GARlC,OAAO9nF,KAAKm7C,UAepBgsC,EAAUxqF,UAAUgoF,0BAA4B,SAAUz6C,GAItD,IAAI29C,EAAW7nF,KAAK6vD,gBACpB,IAAKg4B,GAAY7pC,GAAW6pC,EAAU39C,GAClC,OAAOlqC,KAAKwkF,UAGZ,IAAIsD,EAAUztD,GAAO6P,GAIrB,OAHM49C,KAAW9nF,KAAKqnF,yBAClBrnF,KAAKqnF,uBAAuBS,GAAW,IAAI,GAAU9nF,KAAKwkF,UAAUtF,gBAEjEl/E,KAAKqnF,uBAAuBS,IAa3CX,EAAUxqF,UAAUorF,YAAc,SAAU97E,EAAGtI,EAAGC,EAAGuzD,EAAYjtB,EAAY5tC,GACzE,IAAIqwE,EAAY,CAAC1gE,EAAGtI,EAAGC,GACnBokF,EAAehoF,KAAK+kF,+BAA+BpY,EAAWziC,GAC9D+9C,EAAUD,EACRhoF,KAAKgmF,gBAAgBgC,EAAc7wB,EAAYjtB,QAC/C5V,EACFokB,EAAO,IAAI14C,KAAKonF,UAAUza,OAAuBr4C,IAAZ2zD,EAAwBtvC,GAAiBA,QAA6BrkB,IAAZ2zD,EAAwBA,EAAU,GAAIjoF,KAAKuhC,YAAavhC,KAAKu2E,iBAAkBv2E,KAAK0kF,aAGvL,OAFAhsC,EAAKp8C,IAAMA,EACXo8C,EAAK/gC,iBAAiBqsB,GAAkBhkC,KAAKo4C,iBAAiB77C,KAAKyD,OAC5D04C,GAUXyuC,EAAUxqF,UAAUuzE,QAAU,SAAUjkE,EAAGtI,EAAGC,EAAGuzD,EAAYjtB,GACzD,IAAIkU,EAAmBp+C,KAAK6vD,gBAC5B,GACKzR,GACAlU,IACD8T,GAAWI,EAAkBlU,GAG5B,CACD,IAAItJ,EAAQ5gC,KAAK2kF,0BAA0Bz6C,GACvCyiC,EAAY,CAAC1gE,EAAGtI,EAAGC,GACnB80C,OAAO,EACPs6B,EAAe,GAAOrG,GACtB/rC,EAAM2+C,YAAYvM,KAClBt6B,EAAO9X,EAAMhlC,IAAIo3E,IAErB,IAAI12E,EAAM0D,KAAKwhC,SACf,GAAIkX,GAAQA,EAAKp8C,KAAOA,EACpB,OAAOo8C,EAGP,IAAIykC,EAAiBn9E,KAAKywE,yBAAyBryB,GAC/Cg/B,EAAiBp9E,KAAKywE,yBAAyBvmC,GAC/CmzC,EAAmBr9E,KAAK+kF,+BAA+BpY,EAAWziC,GAClEg+C,EAAU,IAAI,GAAW9pC,EAAkB++B,EAAgBjzC,EAAYkzC,EAAgBzQ,EAAW0Q,EAAkBr9E,KAAK6wE,kBAAkB1Z,GAAan3D,KAAK4nF,YAAa,SAAU37E,EAAGtI,EAAGC,EAAGuzD,GAC7L,OAAOn3D,KAAKmoF,gBAAgBl8E,EAAGtI,EAAGC,EAAGuzD,EAAY/Y,IACnD7hD,KAAKyD,MAAOA,KAAKunF,4BAA6BvnF,KAAK0nF,yBAA0B1nF,KAAKy9E,iBAUpF,OATAyK,EAAQ5rF,IAAMA,EACVo8C,GACAwvC,EAAQrT,YAAcn8B,EACtBwvC,EAAQjT,sBACRr0C,EAAMl+B,QAAQswE,EAAckV,IAG5BtnD,EAAMa,IAAIuxC,EAAckV,GAErBA,EA9BX,OAAOloF,KAAKmoF,gBAAgBl8E,EAAGtI,EAAGC,EAAGuzD,EAAY/Y,GAAoBlU,IA2C7Ei9C,EAAUxqF,UAAUwrF,gBAAkB,SAAUl8E,EAAGtI,EAAGC,EAAGuzD,EAAYjtB,GACjE,IAAIwO,EAAO,KACPs6B,EAAeiN,GAAUh0E,EAAGtI,EAAGC,GAC/BtH,EAAM0D,KAAKwhC,SACf,GAAKxhC,KAAKwkF,UAAUjF,YAAYvM,IAM5B,IADAt6B,EAAO14C,KAAKwkF,UAAU5oF,IAAIo3E,IACjB12E,KAAOA,EAAK,CAIjB,IAAIu4E,EAAcn8B,EAClBA,EAAO14C,KAAK+nF,YAAY97E,EAAGtI,EAAGC,EAAGuzD,EAAYjtB,EAAY5tC,GAErDu4E,EAAYhsC,YAAc8P,GAE1BD,EAAKm8B,YAAcA,EAAYA,YAG/Bn8B,EAAKm8B,YAAcA,EAEvBn8B,EAAKu8B,sBACLj1E,KAAKwkF,UAAU9hF,QAAQswE,EAAct6B,SApBzCA,EAAO14C,KAAK+nF,YAAY97E,EAAGtI,EAAGC,EAAGuzD,EAAYjtB,EAAY5tC,GACzD0D,KAAKwkF,UAAU/iD,IAAIuxC,EAAct6B,GAsBrC,OAAOA,GAOXyuC,EAAUxqF,UAAUyrF,2BAA6B,SAAU7/C,GACvD,GACIvoC,KAAK0nF,0BAA4Bn/C,EADrC,CAKA,IAAK,IAAIjuB,KADTta,KAAK0nF,yBAA2Bn/C,EACjBvoC,KAAKqnF,uBAChBrnF,KAAKqnF,uBAAuB/sE,GAAI8G,QAEpCphB,KAAK+jC,YAcTojD,EAAUxqF,UAAU0rF,yBAA2B,SAAUn+C,EAAYo+C,GAE7D,IAAIC,EAAO,GAAcr+C,GACzB,GAAIq+C,EAAM,CACN,IAAIT,EAAUztD,GAAOkuD,GACfT,KAAW9nF,KAAKsnF,wBAClBtnF,KAAKsnF,sBAAsBQ,GAAWQ,KAK/CnB,EApVmB,CAqV5B,IClaE,GAAwC,WACxC,IAAI5nF,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAsH7B,GAzCU,SAAUu7B,GAK/B,SAASktD,EAAI33C,GACT,IACIv5B,EAAUu5B,GAAe,GACzB3G,OAAoC5V,IAAvBhd,EAAQ4yB,WAA2B5yB,EAAQ4yB,WAAa,YACrEiR,OAAgC7mB,IAArBhd,EAAQ6jC,SACjB7jC,EAAQ6jC,SLXf,SAAmBtK,GACtB,IAAI43C,EAAa53C,GAAe,GAC5BrU,EAASisD,EAAWjsD,QAAU,GAAc,aAAaoK,YACzD8hD,EAAc,CACdlsD,OAAQA,EACRqJ,QAAS4iD,EAAW5iD,QACpBm8C,SAAUyG,EAAWzG,SACrBt1B,YAAao3B,GAAsBtnD,EAAQisD,EAAW3iD,QAAS2iD,EAAWzG,SAAUyG,EAAW9iD,gBAEnG,OAAO,IAAI,GAAS+iD,GKGVC,CAAU,CACRnsD,OAAQwnD,GAAqB95C,GAC7BvE,cAAeruB,EAAQquB,cACvBG,QAASxuB,EAAQwuB,QACjBD,QAASvuB,EAAQuuB,QACjBm8C,SAAU1qE,EAAQ0qE,WAqB1B,OAnBQ1mD,EAAOpgC,KAAK8E,KAAM,CACtB8/D,aAAcxoD,EAAQwoD,aACtBj/B,UAAWvpB,EAAQupB,UACnBU,YAAajqB,EAAQiqB,YACrBkmD,eAAgBnwE,EAAQmwE,eACxBnD,OAAQhtE,EAAQgtE,OAChBp6C,WAAYA,EACZs9C,2BAA4BlwE,EAAQkwE,2BACpCrsC,SAAUA,EACVo7B,iBAAkBj/D,EAAQi/D,iBAC1B3F,eAAgBt5D,EAAQs5D,eACxBoV,gBAAiB1uE,EAAQ0uE,gBACzB7kE,IAAK7J,EAAQ6J,IACb8kE,KAAM3uE,EAAQ2uE,KACdrF,WAAyBtsD,IAAlBhd,EAAQspE,OAAsBtpE,EAAQspE,MAC7CvN,WAAY/7D,EAAQ+7D,WACpBqN,wBAAyBppE,EAAQopE,wBACjC/P,WAAYr5D,EAAQq5D,cAClB3wE,KAGV,OAtCA,GAAUwoF,EAAKltD,GAsCRktD,EAvCa,CAwCtB,ICrHE,GAAwC,WACxC,IAAIjpF,EAAgB,SAAUlE,EAAGmE,GAI7B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAO/D,OAAOkB,UAAUC,eAAe1B,KAAKsE,EAAG3C,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MAC3ExB,EAAGmE,IAE5B,OAAO,SAAUnE,EAAGmE,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIK,UAAU,uBAAyBC,OAAON,GAAK,iCAE7D,SAASO,IAAOC,KAAKC,YAAc5E,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMO,EAAGpD,UAAY6C,EAAE7C,UAAW,IAAIoD,IAZ3C,GAgG7B,GAtCU,SAAUu7B,GAK/B,SAASstD,EAAI/3C,GACT,IAEIivB,EADAxoD,EAAUu5B,GAAe,GAGzBivB,OADyBxrC,IAAzBhd,EAAQwoD,aACOxoD,EAAQwoD,aAGR,CAhDF,4GAkDjB,IAAIv+B,OAAsCjN,IAAxBhd,EAAQiqB,YAA4BjqB,EAAQiqB,YAAc,YACxEpgB,OAAsBmT,IAAhBhd,EAAQ6J,IACZ7J,EAAQ6J,IACR,uDAgBN,OAfQma,EAAOpgC,KAAK8E,KAAM,CACtB8/D,aAAcA,EACd4gB,yBAAyB,EACzB7/C,UAAWvpB,EAAQupB,UACnBU,YAAaA,EACbkmD,eAAgBnwE,EAAQmwE,eACxB3hD,aAA6BxR,IAApBhd,EAAQwuB,QAAwBxuB,EAAQwuB,QAAU,GAC3Dw+C,YAA2BhwD,IAAnBhd,EAAQgtE,QAAuBhtE,EAAQgtE,OAC/CkD,2BAA4BlwE,EAAQkwE,2BACpCjR,iBAAkBj/D,EAAQi/D,iBAC1BlD,WAAY/7D,EAAQ+7D,WACpBlyD,IAAKA,EACLy/D,MAAOtpE,EAAQspE,MACfjQ,WAAYr5D,EAAQq5D,cAClB3wE,KAGV,OAnCA,GAAU4oF,EAAKttD,GAmCRstD,EApCa,CAqCtB,IC9FF,MAAMC,GAAS,mCAMf,MAAMC,GAeF,cAAcC,EAAKC,EAAK3tE,GAEpB,QAAwB,IAAbA,EAA0B,CAEjC,IAAK,IAAIxe,EAAE,EAAGA,GAAG,GAAIA,IAAK,CACtB,MAAMosF,EAAOH,GAAQI,OAAOH,EAAKC,EAAKnsF,GAChCssF,EAAOL,GAAQ3tD,OAAO8tD,GAC5B,GAAIE,EAAKJ,KAAKA,GAAOI,EAAKH,KAAKA,EAAK,OAAOC,EAE/C5tE,EAAY,GAOhB,GAJA0tE,EAAMhzE,OAAOgzE,GACbC,EAAMjzE,OAAOizE,GACb3tE,EAAYtF,OAAOsF,GAEf9B,MAAMwvE,IAAQxvE,MAAMyvE,IAAQzvE,MAAM8B,GAAY,MAAM,IAAIrd,MAAM,mBAElE,IAAIorF,EAAM,EACNC,EAAM,EACNC,GAAU,EACVC,EAAU,GAEVC,GAAW,GAAIC,EAAU,GACzBC,GAAU,IAAKC,EAAS,IAE5B,KAAOJ,EAAQlpF,OAASgb,GAAW,CAC/B,GAAIiuE,EAAS,CAET,MAAMM,GAAUF,EAASC,GAAU,EAC/BX,GAAOY,GACPR,EAAU,EAAJA,EAAQ,EACdM,EAASE,IAETR,GAAU,EACVO,EAASC,OAEV,CAEH,MAAMC,GAAUL,EAASC,GAAU,EAC/BV,GAAOc,GACPT,EAAU,EAAJA,EAAQ,EACdI,EAASK,IAETT,GAAU,EACVK,EAASI,GAGjBP,GAAWA,EAEE,KAAPD,IAEFE,GAAWV,GAAO9lF,OAAOqmF,GACzBC,EAAM,EACND,EAAM,GAId,OAAOG,EAeX,cAAcA,GAEV,MAAMO,EAAShB,GAAQgB,OAAOP,GAGxBC,EAASM,EAAOC,GAAGhB,IAAKW,EAASI,EAAOC,GAAGf,IAC3CS,EAASK,EAAO92E,GAAG+1E,IAAKY,EAASG,EAAO92E,GAAGg2E,IAGjD,IAAID,GAAOS,EAASC,GAAQ,EACxBT,GAAOU,EAASC,GAAQ,EAM5B,OAHAZ,EAAMA,EAAIiB,QAAQ1nF,KAAKohB,MAAM,EAAEphB,KAAKiiB,IAAIklE,EAAOD,GAAQlnF,KAAK2nF,OAC5DjB,EAAMA,EAAIgB,QAAQ1nF,KAAKohB,MAAM,EAAEphB,KAAKiiB,IAAIolE,EAAOD,GAAQpnF,KAAK2nF,OAErD,CAAElB,IAAKhzE,OAAOgzE,GAAMC,IAAKjzE,OAAOizE,IAW3C,cAAcO,GACV,GAAsB,GAAlBA,EAAQlpF,OAAa,MAAM,IAAIrC,MAAM,mBAEzCurF,EAAUA,EAAQ9mF,cAElB,IAAI6mF,GAAU,EACVE,GAAW,GAAIC,EAAU,GACzBC,GAAU,IAAKC,EAAS,IAE5B,IAAK,IAAI5uF,EAAE,EAAGA,EAAEwuF,EAAQlpF,OAAQtF,IAAK,CACjC,MAAMmvF,EAAMX,EAAQxmF,OAAOhI,GACrBquF,EAAMP,GAAO5/E,QAAQihF,GAC3B,IAAY,GAARd,EAAW,MAAM,IAAIprF,MAAM,mBAE/B,IAAK,IAAIxB,EAAE,EAAGA,GAAG,EAAGA,IAAK,CACrB,MAAM2tF,EAAOf,GAAO5sF,EAAI,EACxB,GAAI8sF,EAAS,CAET,MAAMM,GAAUF,EAAOC,GAAU,EACrB,GAARQ,EACAT,EAASE,EAETD,EAASC,MAEV,CAEH,MAAMC,GAAUL,EAAOC,GAAU,EACrB,GAARU,EACAX,EAASK,EAETJ,EAASI,EAGjBP,GAAWA,GASnB,MALe,CACXS,GAAI,CAAEhB,IAAKS,EAAQR,IAAKU,GACxB12E,GAAI,CAAE+1E,IAAKU,EAAQT,IAAKW,IAehC,gBAAgBJ,EAAS5qE,GAMrB,GAHA4qE,EAAUA,EAAQ9mF,cAClBkc,EAAYA,EAAUlc,cAEA,GAAlB8mF,EAAQlpF,OAAa,MAAM,IAAIrC,MAAM,mBACzC,IAAkC,GAA9B,OAAOiL,QAAQ0V,GAAkB,MAAM,IAAI3gB,MAAM,qBAErD,MAaMosF,EAASb,EAAQpoF,OAAO,GAC9B,IAAImF,EAASijF,EAAQpoF,MAAM,GAAI,GAE/B,MAAMoX,EAAOgxE,EAAQlpF,OAAS,EAQ9B,OALgD,GAbjC,CACX7D,EAAG,CAAE,OAAY,YACjBM,EAAG,CAAE,OAAY,YACjB2D,EAAG,CAAE,WAAY,QACjBiU,EAAG,CAAE,WAAY,SASViK,GAAWpG,GAAMtP,QAAQmhF,IAA2B,IAAV9jF,IACjDA,EAASwiF,GAAQuB,SAAS/jF,EAAQqY,IAI/BrY,EAASuiF,GAAO9lF,OAxBL,CACdvG,EAAG,CAAE,mCAAoC,oCACzCM,EAAG,CAAE,mCAAoC,oCACzC2D,EAAG,CAAE,mCAAoC,oCACzCiU,EAAG,CAAE,mCAAoC,qCAoBLiK,GAAWpG,GAAMtP,QAAQmhF,IAWrE,kBAAkBb,GACd,MAAO,CACH,EAAMT,GAAQuB,SAASd,EAAS,KAChC,GAAMT,GAAQuB,SAASvB,GAAQuB,SAASd,EAAS,KAAM,KACvD,EAAMT,GAAQuB,SAASd,EAAS,KAChC,GAAMT,GAAQuB,SAASvB,GAAQuB,SAASd,EAAS,KAAM,KACvD,EAAMT,GAAQuB,SAASd,EAAS,KAChC,GAAMT,GAAQuB,SAASvB,GAAQuB,SAASd,EAAS,KAAM,KACvD,EAAMT,GAAQuB,SAASd,EAAS,KAChC,GAAMT,GAAQuB,SAASvB,GAAQuB,SAASd,EAAS,KAAM,OAQpD,UCvMf,EAAU,GAAY,CACpBe,YAAa,SAA4BnpE,GACvC,OAAO7c,OAAOimF,KAAKppE,IAErBqpE,kBAAmB,SAA4Bn9D,GAC7C,OACErtB,KAAK+vB,QAAQ1C,GAEVxU,KAAK,KAEL7I,OAAO,KACP4f,QAGP66D,OAAQ,SAA4BtzE,GAC9BA,EACFnX,KAAK+J,OAEL/J,KAAKgK,QAGT0gF,UAAW,SAA4Br9D,EAAelW,EAAawzC,GAC7DxzC,EAEsC,IAApCnX,KAAK2Y,WAAWqT,SAAS3rB,OAC3BsqD,EAAU3qD,KAAK+vB,QAAQ1C,IAEvBrtB,KAAK2Y,WAAWkZ,OAGlB7xB,KAAK2Y,WAAW4f,QAGpBoyD,cAAe,WACb3qF,KAAK2Y,WAAW4f,QAElBqyD,cAAe,WACb,OAAO5qF,KAAKjB,KAAKiV,YAEnB62E,WAAY,WAEV,IADA,IAAIC,EAAuB9qF,KAAKjB,OACnB,CACX,IAAI+rF,EAAY92E,YAAe82E,EAAYplF,UAAU3B,SAAS,cAG5D,OAAO+mF,EAFPA,EAAcA,EAAY92E,eAOlC,EAAU,GAAQ,CAChB+2E,oBAAqB,SAAwBC,GAG3C,IAFA,IAAIC,EAA8CjrF,KAAKjB,KACnDhE,EAAI,EAC4B,eAA7BkwF,EAAeC,WAA4B,CAChD,KAAID,EAAe9uE,mBAAqBphB,EAAI,IAI1C,OAHAkwF,EAAiBA,EAAe9uE,kBAChCphB,IAKJkwF,EAAehmF,UAAY+lF,KAK/B,I,SAAA,eAGE,WAAYvtF,GAAZ,MACE,YAAMA,IAAM,K,OAqSN,EAAA0tF,wBAA0B,WAChC,MAAO,CACLpmF,QAAS,eAAG,iGAGZf,IAAK,eAAG,uKAKRonF,QAAS,eAAG,+NA9Sd,EAAKhlD,MAAQ,CACXilD,WAAW,EACXC,OAAQ,IAAI,GAAI,CACd/0B,SAAU,GACV3kB,OAAQ,CACN,IAAI,GAAU,CACZljC,OAAQ,IAAI,GAAI,CACdyS,IAAK,oEAIXy1C,KAAM,IAAI,GAAK,CACb7gC,OAAQ,CAAC,EAAG,GACZ+pB,gBAAgB,EAChBjqC,KAAM,MAGV01E,QAAS,KACTC,UAAW,KACXC,YAAa,GACbC,eAAgB,KAChBC,mBAAoB,GACpBC,aAAc,KACdC,oBAAqB,GACrBC,cAAe,KACfC,aAAa,EACbp/C,QAAS,GACT6mB,OAAQ,EAAKw4B,YACbC,iBAAkB,EAAKD,YAAYrgF,KAAI,WAAM,gCAC7CugF,WAAY,MAEd,EAAKC,OAAS,sBACd,EAAKD,WAAa,K,EAsRtB,OA3TiC,OAwC/B,YAAAF,UAAA,sBACQI,EAAwB,GAW9B,OAVApsF,KAAKvC,MAAMyM,KAAK8lD,OAAOpmD,SAAQ,SAAC41E,GAC9BA,EAAM6M,OAAOziF,SAAQ,SAAC0iF,GACpB,GAAIA,EAAMhxF,OAAS,EAAKmC,MAAM6Z,QAAQi1E,aACpC,IAAK,IAAIxxF,EAAI,EAAGA,EAAIuxF,EAAMvgF,OAAO1L,OAAQtF,IAAK,CAC5C,IAAM0mF,EAAM,GAAQtmD,OAAOmxD,EAAMvgF,OAAOnQ,IAAIb,IAC5CqxF,EAAUvrF,KlFgMX,GkFhM2B,CAAC4gF,EAAIuH,IAAKvH,EAAIsH,KlFgMnB,iBAAgCz0D,KAD1B0wD,OkF/LZwH,GlFgMkDxH,EAAiB,cADvF,IAAgCA,QkF1L5BoH,GAGT,YAAAK,kBAAA,sBACE,GAAwB,OAApBzsF,KAAKksF,WAAqB,CAC5B,IAAM,EAAQn2E,OAAO/V,KAAKksF,WAAW3iF,MAAMtG,MAAMP,QAAQ,KAAM,KACzD,EAASqT,OAAO/V,KAAKksF,WAAW3iF,MAAMrG,OAAOR,QAAQ,KAAM,KAC3D,EAAgB,IAAM,EAC5B1C,KAAKomC,MAAMklD,OAAOp5C,YAAYtoC,SAAQ,SAACy8B,GACjCA,aAAiB,KAAc,GACjC,EAAKD,MAAMklD,OAAOluB,YAAY/2B,MAGlCrmC,KAAKomC,MAAM6lD,iBAAiBriF,SAAQ,SAAC8iF,EAAiBpwF,GACpB,OAA5BowF,EAAgB7wE,UAClB6wE,EAAgB7wE,QAAQtS,MAAMqkE,gBAAkB,WAChD,EAAKxnC,MAAMklD,OAAOxxB,SAAS,IAAI,GAAM,CACnCvxB,OAAQ,SAACY,GACP,GAAgC,OAA5BujD,EAAgB7wE,QAAkB,CACpC,IAAMjM,EAAQ,EAAgBu5B,EAAWnB,UAAUtJ,WAC7C3I,EAAS,CAACoT,EAAWnB,UAAUjS,OAAO,GAAK,EAAKqQ,MAAMotB,OAAOl3D,GAAK,GAAI6sC,EAAWnB,UAAUjS,OAAO,GAAK,EAAKqQ,MAAMotB,OAAOl3D,GAAK,IAC9HwX,EAAOq1B,EAAWr1B,KAClB64E,GpIkBc3wD,EoIjBlBloB,EAAK,GAAK,EpIiBamoB,EoIhBvBnoB,EAAK,GAAK,EpIgBkBnC,EoIf5B/B,EpIegCmC,EoIdhCnC,EpIcoC8O,EoIbpCyqB,EAAWnB,UAAUrJ,SpIc5B,GAAS5C,GAzKT,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,GAyKWC,EAAKC,EAAKtqB,EAAII,EAAI2M,GoIbrCqX,EAAO,GAAK,EAAgB,EAAQ,EACrCA,EAAO,GAAK,EAAgB,EAAS,KAGvC,OADA22D,EAAgB7wE,QAAQtS,MAAMkJ,UAAYk6E,EACnCD,EAAgB7wE,QpIQhC,IAA6BmgB,EAAKC,EAAKtqB,EAAII,EAAI2M,EoINxC,OAAOna,SAASS,cAAc,eAMpCsF,KAAKE,UAAUxK,KAAKgsF,eAAiB1hF,KAAKE,UAAUxK,KAAKomC,MAAMotB,SACjExzD,KAAKmwE,SAAS,CACZ3c,OAAQxzD,KAAKgsF,YACbC,iBAAkBjsF,KAAKgsF,YAAYrgF,KAAI,WAAM,mCAKnD,YAAAihF,mBAAA,gBAC+C,IAAlC5sF,KAAKomC,MAAMklD,OAAOxwB,aAAuD,OAAxB96D,KAAKmsF,OAAOtwE,SACtE7b,KAAKomC,MAAMklD,OAAOnxB,UAAUn6D,KAAKmsF,OAAOtwE,UAI5C,YAAAgxE,mBAAA,SAAmBtB,GACjB,IAAME,EAAczrF,KAAKvC,MAAM6Z,QAAQm0E,YACnCqB,EAAe,KAAwB9sF,KAAKomC,MAAMslD,gBACtDoB,EAAkB,GAClB,IAAK,IAAI/xF,EAAI,EAAGA,EAAI0wF,EAAYprF,OAAQtF,IACJ,KAA9B0wF,EAAY1wF,GAAGgyF,aACjBD,EAAgB9sF,KAAKvC,MAAM6Z,QAAQm0E,YAAY1wF,GAAGgyF,YAAcxB,EAAQtuE,QACtE,IAAIjd,KAAKvC,MAAM6Z,QAAQm0E,YAAY1wF,GAAGiyF,QAI5ChtF,KAAKmwE,SAAS,CAAEub,eAAgBoB,KAGlC,YAAAG,UAAA,SAAU1B,GAcR,IAbA,IAAIE,EAAW,OAAuBzrF,KAAKvC,MAAM6Z,QAAQm0E,cACrDyB,EAA2B,CAC7BC,WAAY,SAACpuF,GACX,OAAIA,EAAKub,IACS,KAAZvb,EAAKub,GACA8yE,WAAWC,cAGfD,WAAWE,gBAGlBC,EAAYhpF,SAASipF,iBAAiBjC,EAAQxsF,KAAMquF,WAAWK,SAAUP,GACzEpC,EAA8ByC,EAAUzC,YACrCA,GACDA,GAAeA,EAAYxwE,IAC4E,IAArGmxE,EAAYrpF,QAAO,SAACsrF,GAAY,QAAC5C,GAAc4C,EAAQV,QAAUlC,EAAYxwE,MAAaja,QAC5ForF,EAAY5qF,KAAK,CAAEmsF,MAAOlC,EAAYxwE,GAAIyyE,WAAY,KAG1DjC,EAAcyC,EAAUI,WAE1B3tF,KAAKmwE,SAAS,CAAEsb,YAAa,EAAF,KAAMA,IAAcM,aAAa,IAC5D/rF,KAAKvC,MAAM6Z,QAAQm0E,YAAW,OAAOA,IACrCzrF,KAAKvC,MAAMmwF,gBAAgB5tF,KAAKvC,MAAM6Z,SACtCtX,KAAK6tF,eAGP,YAAAC,oBAAA,SAAoBr2E,GAClB,GAAIA,EAAMuM,OAAQ,CAChB,IAAI+pE,EAAUt2E,EAAMuM,OAChBgqE,EAAY,EACZvC,EAAW,OAAuBzrF,KAAKvC,MAAM6Z,QAAQm0E,cACzD,GAAIsC,EAAQzzE,GAAI,CACd,KAAsB,KAAfyzE,EAAQzzE,IAAW,CAExB,KADA0zE,EACgB,GACd,OAEFD,EAAUA,EAAQ/5E,WAEpB,IAAK,IAAIjZ,EAAI,EAAGA,EAAI0wF,EAAYprF,OAAQtF,IACtC,GAAI0wF,EAAY1wF,GAAGiyF,QAAUe,EAAQzzE,GACnC,OAGJmxE,EAAY5qF,KAAK,CAAEmsF,MAAOe,EAAQzzE,GAAIyyE,WAAY,KAClD/sF,KAAKmwE,SAAS,CAAEsb,YAAa,EAAF,KAAMA,IAAcM,aAAa,IAC5D/rF,KAAKvC,MAAM6Z,QAAQm0E,YAAW,OAAOA,IACrCzrF,KAAKvC,MAAMmwF,gBAAgB5tF,KAAKvC,MAAM6Z,SACtCtX,KAAK6tF,iBAKX,YAAAI,UAAA,SAAUrvF,GACR,GAAIA,EAAS,CAWX,GATEoB,KAAKvC,MAAM6Z,QAAQ42E,aAAeluF,KAAKomC,MAAMulD,oBAC7C3rF,KAAKomC,MAAMilD,YAAcrrF,KAAKvC,MAAM6Z,QAAQ+zE,WAE5CrrF,KAAKmwE,SAAS,CACZwb,mBAAoB3rF,KAAKvC,MAAM6Z,QAAQ42E,WACvC7C,UAAWrrF,KAAKvC,MAAM6Z,QAAQ+zE,UAC9BU,aAAa,KAGZ/rF,KAAKomC,MAAM2lD,YAAa,CAE3B,IAAIR,EAAUlyD,GAAIz6B,GAClB2sF,EAAQnqE,QACRmqE,EAAQvnF,IAAIhE,KAAKvC,MAAM6Z,QAAQk0E,WAC/BD,EAAQz3E,KAAK9T,KAAKvC,MAAMwF,MAAOjD,KAAKvC,MAAMyF,QACtClD,KAAKvC,MAAM6Z,QAAQ+zE,WACrBrrF,KAAKitF,UAAU1B,GAEjBvrF,KAAK6sF,mBAAmBtB,GACxBvrF,KAAKmwE,SAAS,CAAEob,QAASA,IAEzB,IACE,IAAMK,EAAeuC,SACnB,OACA,UACA,UACA,SACA,UACAnuF,KAAKvC,MAAM2wF,iBAAiBpuF,KAAKvC,MAAM6Z,QAAQ42E,aAEjDluF,KAAKmwE,SAAS,CAAEyb,aAAY,IACxB5rF,KAAKomC,MAAMslD,gBAAkBE,IAC/BA,EAAa5rF,KAAKvC,MAAMyM,KAAMlK,KAAKvC,MAAM6Z,QAAStX,KAAKomC,MAAMmlD,QAASvrF,KAAKomC,MAAMslD,gBACjF1rF,KAAKmwE,SAAS,CAAE4b,aAAa,KAE/B,MAAOtrF,GACPT,KAAKmwE,SAAS,CAAE4b,aAAa,KAKjC,IACE,IAAID,EAAgB9rF,KAAKomC,MAAM0lD,cAC/B,GAAI9rF,KAAKvC,MAAM6Z,QAAQ+2E,cAAgBruF,KAAKomC,MAAMylD,oBAAqB,CACrE,IAAIA,EAAsB7rF,KAAKvC,MAAM6Z,QAAQ+2E,YAC7CvC,EAAgBqC,SACd,OACA,UACA,UACA,SACA,UACAnuF,KAAKvC,MAAM2wF,iBAAiBvC,IAE9B7rF,KAAKmwE,SAAS,CAAE0b,oBAAqBA,EAAqBC,cAAeA,EAAeC,aAAa,IAEnG/rF,KAAKomC,MAAMslD,gBAAkBI,GAC/BA,EACE9rF,KAAKvC,MAAMyM,KACXlK,KAAKvC,MAAM6Z,QACXtX,KAAKomC,MAAMmlD,QACXvrF,KAAKomC,MAAMslD,eACX1rF,KAAK2sC,SAGT,MAAOlsC,IAIT,OAAOT,KAAKomC,MAAMmlD,QAAUvrF,KAAKomC,MAAMmlD,QAAQvnF,MAAQ,KAEvD,OAAO,MAIX,YAAAukC,OAAA,sBACQ+lD,EAAStuF,KAAKmrF,0BAEpB,OADAnrF,KAAKiuF,UAAUjuF,KAAKomC,MAAM8lD,YAExB,yBACExmF,UAAW4oF,EAAOvpF,QAClBwpF,QAASvuF,KAAKvC,MAAM6Z,QAAQk3E,gBAAkBxuF,KAAK8tF,oBAAoBvxF,KAAKyD,WAAQs0B,GAEnFt0B,KAAKomC,MAAM6lD,iBAAiBtgF,KAAI,SAAC+gF,GAChC,OAAO,yBAAKzpE,IAAKypE,GACf,yBACEnjF,MAAO,CACLtG,MAAU,EAAKxF,MAAMwF,MAAK,KAC1BC,OAAW,EAAKzF,MAAMyF,OAAM,KAC5BsD,SAAU,WACVk/B,OAAQ,EACRyyB,cAAe,OACfs2B,WAAY,EAAKhxF,MAAM6Z,QAAQo3E,aAAe,UAAY,UAE5DhpF,UAAW,mBAIjB,yBACE6D,MAAO,CACLtG,MAAUjD,KAAKvC,MAAMwF,MAAK,KAC1BC,OAAWlD,KAAKvC,MAAMyF,OAAM,KAC5BsD,SAAU,WACVk/B,OAAQ,EACRyyB,cAAe,OACfs2B,WAAYzuF,KAAKvC,MAAM6Z,QAAQo3E,aAAe,SAAW,WAE3DhpF,UAAW,aACXud,IAAK,SAAC,GAAU,EAAKktD,SAAS,CAAE+b,WAAY,OAE9C,yBAAK3iF,MAAO,CACVklF,WAAYzuF,KAAKvC,MAAM6Z,QAAQo3E,aAAe,UAAY,SAC1DzrF,MAAUjD,KAAKvC,MAAMwF,MAAK,KAC1BC,OAAWlD,KAAKvC,MAAMyF,OAAM,KAC5BsD,SAAU,YACTyc,IAAKjjB,KAAKmsF,WAuBrB,EA3TA,CAAiC,iBC5GjC,SAASwC,GAAgBj4E,EAAKpa,EAAKN,GAYjC,OAXIM,KAAOoa,EACTjb,OAAOC,eAAegb,EAAKpa,EAAK,CAC9BN,MAAOA,EACPL,YAAY,EACZs3C,cAAc,EACd27C,UAAU,IAGZl4E,EAAIpa,GAAON,EAGN0a,EAGT,SAASm4E,GAAQpyF,EAAQqyF,GACvB,IAAIrxE,EAAOhiB,OAAOgiB,KAAKhhB,GAEvB,GAAIhB,OAAOszF,sBAAuB,CAChC,IAAIC,EAAUvzF,OAAOszF,sBAAsBtyF,GACvCqyF,IAAgBE,EAAUA,EAAQ5sF,QAAO,SAAU6sF,GACrD,OAAOxzF,OAAOyzF,yBAAyBzyF,EAAQwyF,GAAKtzF,eAEtD8hB,EAAK5c,KAAKP,MAAMmd,EAAMuxE,GAGxB,OAAOvxE,EAGT,SAAS0xE,GAAenrE,GACtB,IAAK,IAAIjpB,EAAI,EAAGA,EAAIqF,UAAUC,OAAQtF,IAAK,CACzC,IAAI2T,EAAyB,MAAhBtO,UAAUrF,GAAaqF,UAAUrF,GAAK,GAE/CA,EAAI,EACN8zF,GAAQpzF,OAAOiT,IAAS,GAAM9E,SAAQ,SAAUtN,GAC9CqyF,GAAgB3qE,EAAQ1nB,EAAKoS,EAAOpS,OAE7Bb,OAAO2zF,0BAChB3zF,OAAO4zF,iBAAiBrrE,EAAQvoB,OAAO2zF,0BAA0B1gF,IAEjEmgF,GAAQpzF,OAAOiT,IAAS9E,SAAQ,SAAUtN,GACxCb,OAAOC,eAAesoB,EAAQ1nB,EAAKb,OAAOyzF,yBAAyBxgF,EAAQpS,OAKjF,OAAO0nB,EA+CT,SAASsrE,GAAkBp5E,EAAKgG,IACnB,MAAPA,GAAeA,EAAMhG,EAAI7V,UAAQ6b,EAAMhG,EAAI7V,QAE/C,IAAK,IAAItF,EAAI,EAAGg/B,EAAO,IAAIp6B,MAAMuc,GAAMnhB,EAAImhB,EAAKnhB,IAAKg/B,EAAKh/B,GAAKmb,EAAInb,GAEnE,OAAOg/B,EClGT,SAAS,GAAgBrjB,EAAKpa,EAAKN,GAYjC,OAXIM,KAAOoa,EACTjb,OAAOC,eAAegb,EAAKpa,EAAK,CAC9BN,MAAOA,EACPL,YAAY,EACZs3C,cAAc,EACd27C,UAAU,IAGZl4E,EAAIpa,GAAON,EAGN0a,EAGT,SAAS,GAAQja,EAAQqyF,GACvB,IAAIrxE,EAAOhiB,OAAOgiB,KAAKhhB,GAEvB,GAAIhB,OAAOszF,sBAAuB,CAChC,IAAIC,EAAUvzF,OAAOszF,sBAAsBtyF,GACvCqyF,IAAgBE,EAAUA,EAAQ5sF,QAAO,SAAU6sF,GACrD,OAAOxzF,OAAOyzF,yBAAyBzyF,EAAQwyF,GAAKtzF,eAEtD8hB,EAAK5c,KAAKP,MAAMmd,EAAMuxE,GAGxB,OAAOvxE,EAGT,SAAS,GAAeuG,GACtB,IAAK,IAAIjpB,EAAI,EAAGA,EAAIqF,UAAUC,OAAQtF,IAAK,CACzC,IAAI2T,EAAyB,MAAhBtO,UAAUrF,GAAaqF,UAAUrF,GAAK,GAE/CA,EAAI,EACN,GAAQU,OAAOiT,IAAS,GAAM9E,SAAQ,SAAUtN,GAC9C,GAAgB0nB,EAAQ1nB,EAAKoS,EAAOpS,OAE7Bb,OAAO2zF,0BAChB3zF,OAAO4zF,iBAAiBrrE,EAAQvoB,OAAO2zF,0BAA0B1gF,IAEjE,GAAQjT,OAAOiT,IAAS9E,SAAQ,SAAUtN,GACxCb,OAAOC,eAAesoB,EAAQ1nB,EAAKb,OAAOyzF,yBAAyBxgF,EAAQpS,OAKjF,OAAO0nB,EAGT,SAAS,KACP,IAAK,IAAIurE,EAAOnvF,UAAUC,OAAQmvF,EAAM,IAAI7vF,MAAM4vF,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC9ED,EAAIC,GAAQrvF,UAAUqvF,GAGxB,OAAO,SAAU9rF,GACf,OAAO6rF,EAAIE,aAAY,SAAU9rF,EAAGmL,GAClC,OAAOA,EAAEnL,KACRD,IAIP,SAASgsF,GAAMzpF,GACb,OAAO,SAAS0pF,IAGd,IAFA,IAAI9zE,EAAQ9b,KAEH6vF,EAAQzvF,UAAUC,OAAQ8F,EAAO,IAAIxG,MAAMkwF,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACpF3pF,EAAK2pF,GAAS1vF,UAAU0vF,GAG1B,OAAO3pF,EAAK9F,QAAU6F,EAAG7F,OAAS6F,EAAG5F,MAAMN,KAAMmG,GAAQ,WACvD,IAAK,IAAI4pF,EAAQ3vF,UAAUC,OAAQohD,EAAW,IAAI9hD,MAAMowF,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACxFvuC,EAASuuC,GAAS5vF,UAAU4vF,GAG9B,OAAOJ,EAAQtvF,MAAMwb,EAAO,GAAG1a,OAAO+E,EAAMs7C,MAKlD,SAASwuC,GAASj0F,GAChB,MAAO,GAAGwM,SAAStN,KAAKc,GAAO+H,SAAS,UAO1C,SAASmsF,GAAWl0F,GAClB,MAAwB,mBAAVA,EAoChB,IAWI,GAAe2zF,IAfnB,SAAoBQ,EAAe53E,GACjC,MAAM,IAAIva,MAAMmyF,EAAc53E,IAAS43E,EAAuB,WAc7CR,CAXC,CAClBS,kBAAmB,4BACnBC,YAAa,oCACbC,eAAgB,6CAChBC,YAAa,4CACbC,aAAc,qCACdC,aAAc,gCACdC,WAAY,gDACZC,YAAa,iGACb,QAAW,sDAGTC,GAAa,CACfC,QA1CF,SAAyBC,EAASD,GAKhC,OAJKZ,GAASY,IAAU,GAAa,cACjCp1F,OAAOgiB,KAAKozE,GAASpnD,MAAK,SAAU6iD,GACtC,OAPoB7vF,EAOGq0F,EAPKp0F,EAOI4vF,GAN3B7wF,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,GADtD,IAAwBD,EAAQC,MAQ1B,GAAa,eACVm0F,GAsCPl2E,SAnCF,SAA0BA,GACnBu1E,GAAWv1E,IAAW,GAAa,iBAmCxCo2E,QAhCF,SAAyBA,GACjBb,GAAWa,IAAYd,GAASc,IAAW,GAAa,eAC1Dd,GAASc,IAAYt1F,OAAOsQ,OAAOglF,GAAStnD,MAAK,SAAUunD,GAC7D,OAAQd,GAAWc,OACjB,GAAa,iBA6BjBF,QA1BF,SAAyBA,GA/BzB,IAAiBp6E,EAgCVo6E,GAAS,GAAa,qBACtBb,GAASa,IAAU,GAAa,eAjCtBp6E,EAkCHo6E,EAjCJr1F,OAAOgiB,KAAK/G,GAAKrW,QAiCH,GAAa,oBAqDrC,SAAS4wF,GAAe7qD,EAAO8qD,GAC7B,OAAOhB,GAAWgB,GAAiBA,EAAc9qD,EAAMvqB,SAAWq1E,EAGpE,SAASC,GAAY/qD,EAAOyqD,GAE1B,OADAzqD,EAAMvqB,QAAU,GAAe,GAAe,GAAIuqB,EAAMvqB,SAAUg1E,GAC3DA,EAGT,SAASO,GAAehrD,EAAO2qD,EAASF,GAMtC,OALAX,GAAWa,GAAWA,EAAQ3qD,EAAMvqB,SAAWpgB,OAAOgiB,KAAKozE,GAASjnF,SAAQ,SAAU0iF,GACpF,IAAI+E,EAEJ,OAA6C,QAArCA,EAAiBN,EAAQzE,UAAuC,IAAnB+E,OAA4B,EAASA,EAAen2F,KAAK61F,EAAS3qD,EAAMvqB,QAAQywE,OAEhIuE,EAGT,IAIe,GAJH,CACVx0F,OA9CF,SAAgBy0F,GACd,IAAIC,EAAU3wF,UAAUC,OAAS,QAAsBi0B,IAAjBl0B,UAAU,GAAmBA,UAAU,GAAK,GAClFwwF,GAAWE,QAAQA,GACnBF,GAAWG,QAAQA,GACnB,IAAI3qD,EAAQ,CACVvqB,QAASi1E,GAEPQ,EAAY3B,GAAMyB,GAANzB,CAAsBvpD,EAAO2qD,GACzCzvE,EAASquE,GAAMwB,GAANxB,CAAmBvpD,GAC5BmrD,EAAW5B,GAAMiB,GAAWC,QAAjBlB,CAA0BmB,GACrCU,EAAa7B,GAAMsB,GAANtB,CAAsBvpD,GAEvC,SAASyC,IACP,IAAIluB,EAAWva,UAAUC,OAAS,QAAsBi0B,IAAjBl0B,UAAU,GAAmBA,UAAU,GAAK,SAAUgmC,GAC3F,OAAOA,GAGT,OADAwqD,GAAWj2E,SAASA,GACbA,EAASyrB,EAAMvqB,SAGxB,SAASs0D,EAAS+gB,GAChB,GAAQI,EAAWhwE,EAAQiwE,EAAUC,EAArC,CAAiDN,GAGnD,MAAO,CAACroD,EAAUsnC,KCjKL,GANF,CACXshB,MAAO,CACLC,GAAI,6DCEO,OAJf,SAAkB11F,GAChB,MAAO,GAAGwM,SAAStN,KAAKc,GAAO+H,SAAS,WCoC1C,IAMI,GC3CJ,SAAemC,GACb,OAAO,SAAS0pF,IAGd,IAFA,IAAI9zE,EAAQ9b,KAEHuvF,EAAOnvF,UAAUC,OAAQ8F,EAAO,IAAIxG,MAAM4vF,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC/EtpF,EAAKspF,GAAQrvF,UAAUqvF,GAGzB,OAAOtpF,EAAK9F,QAAU6F,EAAG7F,OAAS6F,EAAG5F,MAAMN,KAAMmG,GAAQ,WACvD,IAAK,IAAI0pF,EAAQzvF,UAAUC,OAAQohD,EAAW,IAAI9hD,MAAMkwF,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACxFruC,EAASquC,GAAS1vF,UAAU0vF,GAG9B,OAAOF,EAAQtvF,MAAMwb,EAAO,GAAG1a,OAAO+E,EAAMs7C,MD8B/B,EAVnB,SAAoB0uC,EAAe53E,GACjC,MAAM,IAAIva,MAAMmyF,EAAc53E,IAAS43E,EAAuB,WAS7C,CANC,CAClBwB,iBAAkB,uCAClBC,WAAY,+CACZ,QAAW,8DACXC,YAAa,kTAOA,GAJE,CACfC,OApCF,SAAwBA,GAItB,OAHKA,GAAQ,GAAa,oBACrB,GAASA,IAAS,GAAa,cAEhCA,EAAO7L,KAEF,CACLwL,MAAO,CACLC,GAAII,EAAO7L,KAAK8L,aAKfD,IEVM,GAZD,WACZ,IAAK,IAAIvC,EAAOnvF,UAAUC,OAAQmvF,EAAM,IAAI7vF,MAAM4vF,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC9ED,EAAIC,GAAQrvF,UAAUqvF,GAGxB,OAAO,SAAU9rF,GACf,OAAO6rF,EAAIE,aAAY,SAAU9rF,EAAGmL,GAClC,OAAOA,EAAEnL,KACRD,KCKQ,OAXf,SAAS4uB,EAAMvO,EAAQtV,GAQrB,OAPAjT,OAAOgiB,KAAK/O,GAAQ9E,SAAQ,SAAUtN,GAChCoS,EAAOpS,aAAgBb,QACrBuoB,EAAO1nB,IACTb,OAAO0E,OAAOuO,EAAOpS,GAAMi2B,EAAMvO,EAAO1nB,GAAMoS,EAAOpS,QAIpD6yF,GAAeA,GAAe,GAAInrE,GAAStV,ICThDsjF,GAAsB,CACxBz5E,KAAM,cACN05E,IAAK,kCAgBQ,IR8BS/7E,GAAKnb,GQ9Bd,GAbf,SAAwBy6E,GACtB,IAAI0c,GAAe,EACfC,EAAiB,IAAIlpD,SAAQ,SAAUC,EAAS83C,GAClDxL,EAAQrc,MAAK,SAAU3vD,GACrB,OAAO0oF,EAAelR,EAAOgR,IAAuB9oD,EAAQ1/B,MAE9DgsE,EAAe,MAAEwL,MAEnB,OAAOmR,EAAeC,OAAS,WAC7B,OAAOF,GAAe,GACrBC,GCNDE,GAAgB,GAAMh2F,OAAO,CAC/By1F,OAAQ,GACRQ,eAAe,EACfppD,QAAS,KACT83C,OAAQ,KACRuR,OAAQ,OAENC,ITgCyBz3F,GShCsB,EToCnD,SAAyBmb,GACvB,GAAIvW,MAAMgC,QAAQuU,GAAM,OAAOA,EAJxBu8E,CADev8E,GShCYm8E,KTwCpC,SAA+Bn8E,EAAKnb,GAClC,GAAsB,oBAAXe,QAA4BA,OAAO0E,YAAY/E,OAAOya,GAAjE,CACA,IAAIw8E,EAAO,GACPC,GAAK,EACL7mF,GAAK,EACL8mF,OAAKt+D,EAET,IACE,IAAK,IAAiCu+D,EAA7BC,EAAK58E,EAAIpa,OAAO0E,cAAmBmyF,GAAME,EAAKC,EAAGnyF,QAAQC,QAChE8xF,EAAK7xF,KAAKgyF,EAAG72F,QAETjB,GAAK23F,EAAKryF,SAAWtF,GAH8C43F,GAAK,IAK9E,MAAO50F,GACP+N,GAAK,EACL8mF,EAAK70F,EACL,QACA,IACO40F,GAAsB,MAAhBG,EAAW,QAAWA,EAAW,SAC5C,QACA,GAAIhnF,EAAI,MAAM8mF,GAIlB,OAAOF,GA/BwBK,CAAsB78E,GAAKnb,KAkC5D,SAAqCS,EAAGw3F,GACtC,GAAKx3F,EAAL,CACA,GAAiB,iBAANA,EAAgB,OAAO8zF,GAAkB9zF,EAAGw3F,GACvD,IAAIx2F,EAAIf,OAAOkB,UAAU6L,SAAStN,KAAKM,GAAG2F,MAAM,GAAI,GAEpD,MADU,WAAN3E,GAAkBhB,EAAEyE,cAAazD,EAAIhB,EAAEyE,YAAY3E,MAC7C,QAANkB,GAAqB,QAANA,EAAoBmD,MAAMsB,KAAKzF,GACxC,cAANgB,GAAqB,2CAA2CsN,KAAKtN,GAAW8yF,GAAkB9zF,EAAGw3F,QAAzG,GAxCgEC,CAA4B/8E,GAAKnb,KAmDnG,WACE,MAAM,IAAI8E,UAAU,6IApDmFqzF,IShCrGrqD,GAAW2pD,GAAe,GAC1BriB,GAAWqiB,GAAe,GAiD9B,SAASW,GAAcC,GACrB,OAAO7uF,SAAS0P,KAAK6F,YAAYs5E,GAmBnC,SAASC,GAAsBC,GAC7B,IAXoBzxE,EAChBuxE,EAUAhtD,EAAQyC,IAAS,SAAU0qD,GAG7B,MAAO,CACLzB,OAHWyB,EAAMzB,OAIjB9Q,OAHWuS,EAAMvS,WAMjBwS,GAnBgB3xE,EAmBY,GAAGzgB,OAAOglC,EAAM0rD,OAAOL,MAAMC,GAAI,cAlB7D0B,EAAS7uF,SAASS,cAAc,UAC7B6c,IAAQuxE,EAAOvxE,IAAMA,GAAMuxE,GAwBlC,OALAI,EAAaC,OAAS,WACpB,OAAOH,KAGTE,EAAaE,QAAUttD,EAAM46C,OACtBwS,EAOT,SAASF,KACP,IAAIltD,EAAQyC,IAAS,SAAU8qD,GAI7B,MAAO,CACL7B,OAJW6B,EAAM7B,OAKjB5oD,QAJYyqD,EAAMzqD,QAKlB83C,OAJW2S,EAAM3S,WAOjB4S,EAAUtvF,OAAOsvF,QAErBA,EAAQ9B,OAAO1rD,EAAM0rD,QAErB8B,EAAQ,CAAC,0BAA0B,SAAUrB,GAC3CsB,GAAoBtB,GACpBnsD,EAAM8C,QAAQqpD,MACb,SAAUzxF,GACXslC,EAAM46C,OAAOlgF,MAQjB,SAAS+yF,GAAoBtB,GACtB1pD,KAAW0pD,QACdpiB,GAAS,CACPoiB,OAAQA,IAkBd,IAAIuB,GAAiB,IAAI7qD,SAAQ,SAAUC,EAAS83C,GAClD,OAAO7Q,GAAS,CACdjnC,QAASA,EACT83C,OAAQA,OASG,GANF,CACX8Q,OA5IF,SAAgBA,GACd3hB,IAAS,SAAU/pC,GACjB,MAAO,CACL0rD,OAAQ,GAAM1rD,EAAM0rD,OAAQ,GAAWA,OAAOA,SA0IlD9mF,KAhIF,WAQE,IAPY69B,IAAS,SAAUkrD,GAE7B,MAAO,CACLzB,cAFkByB,EAAKzB,kBAMhBA,cAAe,CACxB,GAAIhuF,OAAOiuF,QAAUjuF,OAAOiuF,OAAOyB,OAEjC,OADAH,GAAoBvvF,OAAOiuF,QACpB,GAAetpD,QAAQC,QAAQ5kC,OAAOiuF,SAG/C,GAAQY,GAAeE,GAAvB,CAA8CC,IAC9CnjB,GAAS,CACPmiB,eAAe,IAInB,OAAO,GAAewB,KA6GtBG,oBAhBF,WACE,OAAOprD,IAAS,SAAUqrD,GAExB,OADaA,EAAM3B,Y,mBCxJvB,MAAM4B,GAAgB,CACpB5jD,QAAS,OACTrtC,OAAQ,OACRD,MAAO,OACPmxF,eAAgB,SAChBC,WAAY,UAWC,OARf,UAAiB,QACfC,IAEA,OAAoB,IAAMtvF,cAAc,MAAO,CAC7CuE,MAAO4qF,IACNG,ICDU,OAdA,CACbvvF,QAAS,CACPwrC,QAAS,OACT/pC,SAAU,WACV+tF,UAAW,WAEbC,UAAW,CACTvxF,MAAO,QAET+G,KAAM,CACJumC,QAAS,SCHb,SAASkkD,IAAgB,MACvBxxF,EAAK,OACLC,EAAM,cACNwxF,EAAa,QACbt5B,EAAO,KACP24B,EAAI,UACJruF,EAAS,iBACTivF,IAEA,OAAoB,IAAM3vF,cAAc,UAAW,CACjDuE,MAAO,IAAK,GAAOxE,QACjB9B,QACAC,UAEFwC,UAAWivF,IACTD,GAA8B,IAAM1vF,cAAc,GAAS,CAC7DsvF,QAASl5B,IACM,IAAMp2D,cAAc,MAAO,CAC1Cie,IAAK8wE,EACLxqF,MAAO,IAAK,GAAOirF,cACZE,GAAiB,GAAO1qF,MAE/BtE,UAAWA,KAIf+uF,GAAgBG,UAAY,CAC1B3xF,MAAO,KAAU/D,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SAASN,WACjEgF,OAAQ,KAAUhE,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SAASN,WAClEk9D,QAAS,KAAUl8D,UAAU,CAAC,KAAUN,QAAS,KAAUJ,SAASN,WACpEw2F,cAAe,KAAUr2F,KAAKH,WAC9BwH,UAAW,KAAUlH,OACrBm2F,iBAAkB,KAAUn2F,QAGf,UCrCA,GAFoB,eAAK,ICGzB,OAJf,SAAkBq2F,GAChB,oBAAUA,EAAQ,KCML,OAPf,SAAmBA,EAAQC,EAAMC,GAAe,GAC9C,MAAMC,EAAiB,kBAAO,GAC9B,oBAAUA,EAAen5E,UAAYk5E,EAAe,KAClDC,EAAen5E,SAAU,GACvBg5E,EAAQC,ICNd,SAAS,MAET,SAASG,GAAiB1C,EAAQv2F,EAAOk5F,EAAUnhF,GACjD,OAGF,SAAkBw+E,EAAQx+E,GACxB,OAAOw+E,EAAOyB,OAAOmB,SAASC,GAAc7C,EAAQx+E,IAJ7CohF,CAAS5C,EAAQx+E,IAO1B,SAAqBw+E,EAAQv2F,EAAOk5F,EAAUnhF,GAC5C,OAAOw+E,EAAOyB,OAAOqB,YAAYr5F,EAAOk5F,EAAUnhF,GAAQqhF,GAAc7C,EAAQx+E,IAR/CshF,CAAY9C,EAAQv2F,EAAOk5F,EAAUnhF,GAWxE,SAASqhF,GAAc7C,EAAQx+E,GAC7B,OAAOw+E,EAAO+C,IAAI/qF,MAAMwJ,GCP1B,SAASwhF,IAAW,SAClBC,EAAQ,SACRC,EAAQ,SACRP,EAAQ,iBACRQ,EAAgB,iBAChBC,EAAgB,kBAGhBC,EAAiB,kBACjBC,EAAiB,yBACjBC,EAAwB,yBACxBC,EAAwB,MACxBC,EAAK,QACL56B,EAAO,QACP9jD,EAAO,OAGPpU,EAAM,MACND,EAAK,UACLyC,EAAS,iBACTivF,EAAgB,YAGhBsB,EAAW,QACXC,IAEA,MAAOxB,EAAeyB,GAAoB,oBAAS,IAC5CC,EAAkBC,GAAuB,oBAAS,GACnDC,EAAY,iBAAO,MACnBC,EAAY,iBAAO,MACnBC,EAAe,iBAAO,MACtBC,EAAa,iBAAOP,GACpBQ,EAAiB,iBAAOT,GAC9B,GAAS,KACP,MAAM79E,EAAa,GAAOpN,OAE1B,OADAoN,EAAW+gD,KAAKo5B,IAAWgE,EAAU16E,QAAU02E,IAAW8D,GAAoB,IAAQ3gB,MAAM50E,GAAwE,iBAA9DA,aAAqC,EAASA,EAAMyX,YAA2Bo+E,GAC9K,IAAML,EAAUz6E,QA8DzB,WACE,MAAM+6E,EAASN,EAAUz6E,QAAQs5E,WAG/B,IAAI0B,EAMAC,EAPDhB,GAGsC,QAAxCe,EAAmBD,EAAOpB,gBAA2C,IAArBqB,GAAuCA,EAAiBp9D,UAGtGs8D,GAGsC,QAAxCe,EAAmBF,EAAOnB,gBAA2C,IAArBqB,GAAuCA,EAAiBr9D,UAG3G68D,EAAUz6E,QAAQ4d,UA7Ees9D,GAAkB3+E,EAAWg6E,WAEhE,GAAU,KACR,MAAM4E,EAAiBV,EAAUz6E,QAAQo7E,oBAErCD,EAAeE,UAAUX,EAAU16E,QAAQm4E,OAAOmD,aAAaC,UACjEJ,EAAeK,SAAS5B,GAEpBA,IAAauB,EAAeM,aAC9BN,EAAeO,aAAa,GAAI,CAAC,CAC/B9R,MAAOuR,EAAe7B,WAAWqC,oBACjC/7E,KAAMg6E,EACNgC,kBAAkB,KAEpBT,EAAeU,iBAGlB,CAACjC,GAAWf,GACf,GAAU,KACR4B,EAAUz6E,QAAQs5E,WAAWK,SAAS6B,SAAS7B,IAC9C,CAACA,GAAWd,GACf,GAAU,KACR,MAAM,SACJc,EAAQ,SACRC,GACEa,EAAUz6E,QAAQs5E,WACtBoB,EAAU16E,QAAQm4E,OAAO2D,iBAAiBnC,EAAUE,GAAoBR,GACxEqB,EAAU16E,QAAQm4E,OAAO2D,iBAAiBlC,EAAUE,GAAoBT,IACvE,CAACA,EAAUQ,EAAkBC,GAAmBjB,GACnD,GAAU,KACR6B,EAAU16E,QAAQm4E,OAAO4D,SAAS5B,IACjC,CAACA,GAAQtB,GACZ,GAAU,KACR4B,EAAUz6E,QAAQg8E,cAAcvgF,IAC/B,CAACA,GAAUo9E,GACd,MAAMoD,EAAY,sBAAY,KAC5BpB,EAAe76E,QAAQ06E,EAAU16E,SACjC,MAAMk8E,EAAgBxB,EAAU16E,QAAQm4E,OAAOqB,YAAYG,EAAUE,GAAoBR,EAAUU,GAAqBW,EAAU16E,QAAQy5E,IAAI/qF,MAAMqrF,IAC9IoC,EAAgBzB,EAAU16E,QAAQm4E,OAAOqB,YAAYI,EAAUE,GAAoBT,EAAUW,GAAqBU,EAAU16E,QAAQy5E,IAAI/qF,MAAMsrF,IACpJS,EAAUz6E,QAAQo8E,SAAS,CACzBzC,SAAUuC,EACVtC,SAAUuC,KAEX,CAAC9C,EAAUO,EAAUE,EAAkBH,EAAUE,EAAkBE,EAAmBC,IACnFqC,EAAe,sBAAY,KAC/B5B,EAAUz6E,QAAU06E,EAAU16E,QAAQm4E,OAAOmE,iBAAiB3B,EAAa36E,QAAS,CAClFu8E,iBAAiB,KACd9gF,IAELwgF,IACAvB,EAAU16E,QAAQm4E,OAAO4D,SAAS5B,GAClCG,GAAiB,IAChB,CAAC7+E,EAAS0+E,EAAO8B,IA4BpB,OA3BA,oBAAU,KACJpD,GACF+B,EAAW56E,QAAQy6E,EAAUz6E,QAAS06E,EAAU16E,UAEjD,CAAC64E,IACJ,oBAAU,MACP0B,IAAqB1B,GAAiBwD,KACtC,CAAC9B,EAAkB1B,EAAewD,IAoBjB,IAAMlzF,cAAc,GAAiB,CACvD/B,MAAOA,EACPC,OAAQA,EACRwxF,cAAeA,EACft5B,QAASA,EACT24B,KAAMyC,EACN9wF,UAAWA,EACXivF,iBAAkBA,IAItBY,GAAWX,UAAY,CACrBY,SAAU,KAAUh3F,OACpBi3F,SAAU,KAAUj3F,OACpB02F,SAAU,KAAU12F,OACpBk3F,iBAAkB,KAAUl3F,OAC5Bm3F,iBAAkB,KAAUn3F,OAG5Bo3F,kBAAmB,KAAUp3F,OAC7Bq3F,kBAAmB,KAAUr3F,OAC7Bs3F,yBAA0B,KAAUz3F,KACpC03F,yBAA0B,KAAU13F,KACpC23F,MAAO,KAAUx3F,OACjB48D,QAAS,KAAUl8D,UAAU,CAAC,KAAUN,QAAS,KAAUJ,SAC3D8Y,QAAS,KAAU7a,OAGnBwG,MAAO,KAAU/D,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SACxD0E,OAAQ,KAAUhE,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SACzDkH,UAAW,KAAUlH,OACrBm2F,iBAAkB,KAAUn2F,OAG5By3F,YAAa,KAAU33F,KACvB43F,QAAS,KAAU53F,MAErBi3F,GAAW8C,aAAe,CACxBrC,MAAO,QACP56B,QAAS,aACT9jD,QAAS,GACTw+E,0BAA0B,EAC1BC,0BAA0B,EAG1B9yF,MAAO,OACPC,OAAQ,OAGR+yF,YAAa,GACbC,QAAS,ICpKI,OARf,SAAqBl6F,GACnB,MAAMinB,EAAM,mBAIZ,OAHA,oBAAU,KACRA,EAAIpH,QAAU7f,GACb,CAACA,IACGinB,EAAIpH,SCEb,MAAMy8E,GAAa,IAAI1tB,IAEvB,SAAS2tB,IAAO,aACdC,EAAY,gBACZC,EAAe,YACfC,EAAW,MACX18F,EAAK,SACLk5F,EAAQ,KACRnhF,EAAI,MAGJiiF,EAAK,KACLrzE,EAAI,QACJy4C,EAAO,QACP9jD,EAAO,iBACPqhF,EAAgB,cAChBC,EAAa,iBACbC,EAAgB,MAGhB51F,EAAK,OACLC,EAAM,UACNwC,EAAS,iBACTivF,EAAgB,YAGhBsB,EAAW,QACXC,EAAO,SACP4C,EAAQ,WACRC,IAEA,MAAOrE,EAAeyB,GAAoB,oBAAS,IAC5CC,EAAkBC,GAAuB,oBAAS,GACnDE,EAAY,iBAAO,MACnBD,EAAY,iBAAO,MACnBE,EAAe,iBAAO,MACtBC,EAAa,iBAAOP,GACpBQ,EAAiB,iBAAOT,GACxB+C,EAAkB,iBAAO,MACzBC,EAAW,iBAAOj9F,GAClBk9F,EAAe,GAAYnlF,GACjC,GAAS,KACP,MAAMqE,EAAa,GAAOpN,OAE1B,OADAoN,EAAW+gD,KAAKo5B,IAAWgE,EAAU16E,QAAU02E,IAAW8D,GAAoB,IAAQ3gB,MAAM50E,GAAwE,iBAA9DA,aAAqC,EAASA,EAAMyX,YAA2Bo+E,GAC9K,IAAML,EAAUz6E,QAuGzB,WACE,IAAIs9E,EAOEC,EALiD,QAAtDD,EAAyBH,EAAgBn9E,eAAgD,IAA3Bs9E,GAA6CA,EAAuB1/D,UAE/Ho/D,EACFD,GAAiBN,GAAW72D,IAAI1tB,EAAMuiF,EAAUz6E,QAAQ+8E,iBAII,QAA3DQ,EAAyB9C,EAAUz6E,QAAQs5E,kBAAmD,IAA3BiE,GAA6CA,EAAuB3/D,UAG1I68D,EAAUz6E,QAAQ4d,UApHes9D,GAAkB3+E,EAAWg6E,WAEhE,GAAU,KACR,MAAMiH,EAAQpE,GAAiBsB,EAAU16E,QAAS28E,GAAgBx8F,EAAOy8F,GAAmBvD,EAAUnhF,GAElGslF,IAAU/C,EAAUz6E,QAAQs5E,aAC9ByD,GAAiBN,GAAW72D,IAAIy3D,EAAc5C,EAAUz6E,QAAQ+8E,iBAChEtC,EAAUz6E,QAAQo8E,SAASoB,GAC3BT,GAAiBtC,EAAUz6E,QAAQy9E,iBAAiBhB,GAAW18F,IAAImY,MAEpE,CAACA,GAAO2gF,GACX,GAAU,KACR4B,EAAUz6E,QAAQg8E,cAAcvgF,IAC/B,CAACA,GAAUo9E,GACd,GAAU,KACJ4B,EAAUz6E,QAAQq7E,UAAUX,EAAU16E,QAAQm4E,OAAOmD,aAAaC,UACpEd,EAAUz6E,QAAQw7E,SAASr7F,GAEvBA,IAAUs6F,EAAUz6E,QAAQy7E,aAC9BhB,EAAUz6E,QAAQ07E,aAAa,GAAI,CAAC,CAClC9R,MAAO6Q,EAAUz6E,QAAQs5E,WAAWqC,oBACpC/7E,KAAMzf,EACNy7F,kBAAkB,KAEpBnB,EAAUz6E,QAAQ67E,iBAGrB,CAAC17F,GAAQ04F,GACZ,GAAU,KACR6B,EAAU16E,QAAQm4E,OAAO2D,iBAAiBrB,EAAUz6E,QAAQs5E,WAAYD,IACvE,CAACA,GAAWR,GACf,GAAU,UHjEOpgE,IGmEE3R,GACf2zE,EAAUz6E,QAAQ09E,WAAW52E,IAE9B,CAACA,GAAO+xE,GACX,GAAU,KACR6B,EAAU16E,QAAQm4E,OAAO4D,SAAS5B,IACjC,CAACA,GAAQtB,GACZ,MAAMwD,EAAe,sBAAY,KAC/BxB,EAAe76E,QAAQ06E,EAAU16E,SACjC,MAAM29E,EAAuBzlF,GAAQ2kF,EAC/Be,EAAexE,GAAiBsB,EAAU16E,QAAS7f,GAASw8F,EAAcC,GAAmBvD,EAAUsE,GAC7GlD,EAAUz6E,QAAU06E,EAAU16E,QAAQm4E,OAAO33F,OAAOm6F,EAAa36E,QAAS,CACxEw9E,MAAOI,EACPrB,iBAAiB,KACd9gF,GACFqhF,GACHC,GAAiBtC,EAAUz6E,QAAQy9E,iBAAiBhB,GAAW18F,IAAI49F,IACnEjD,EAAU16E,QAAQm4E,OAAO4D,SAAS5B,GAClCG,GAAiB,IAChB,CAACqC,EAAcC,EAAiBC,EAAa18F,EAAOk5F,EAAUnhF,EAAMuD,EAASqhF,EAAkBC,EAAe5C,IAmEjH,OAlEA,oBAAU,KACJtB,GACF+B,EAAW56E,QAAQy6E,EAAUz6E,QAAS06E,EAAU16E,UAEjD,CAAC64E,IACJ,oBAAU,MACP0B,IAAqB1B,GAAiBwD,KACtC,CAAC9B,EAAkB1B,EAAewD,IAGrCe,EAASp9E,QAAU7f,EACnB,oBAAU,KAEN,IAAI09F,EAAuBC,EADzBjF,GAAiBoE,IAGmC,QAArDY,EAAwBV,EAAgBn9E,eAA+C,IAA1B69E,GAA4CA,EAAsBjgE,UAChIu/D,EAAgBn9E,QAAuD,QAA5C89E,EAAqBrD,EAAUz6E,eAA4C,IAAvB89E,OAAgC,EAASA,EAAmBC,wBAAwBniF,IACjK,MAAMoiF,EAAcvD,EAAUz6E,QAAQy7E,WAElC2B,EAASp9E,UAAYg+E,GACvBf,EAASe,EAAapiF,OAI3B,CAACi9E,EAAeoE,IAEnB,oBAAU,KACR,GAAIpE,EAAe,CACjB,MAAMoF,EAAwBvD,EAAU16E,QAAQm4E,OAAO+F,mBAAmBC,IACxE,IAAIC,EAEJ,MAAMC,EAAuE,QAA1DD,EAAwB3D,EAAUz6E,QAAQs5E,kBAAkD,IAA1B8E,OAAmC,EAASA,EAAsBE,IAEvJ,GAAID,EAAW,CAGb,GAFsCF,EAAKh9E,KAAKm9E,GAAOA,EAAIpmF,OAASmmF,EAAUnmF,MAE3C,CACjC,MAAMkyC,EAAUswC,EAAU16E,QAAQm4E,OAAOoG,gBAAgB,CACvDC,SAAUH,IAEZnB,SAAwDA,EAAW9yC,OAIzE,MAAO,KACL6zC,SAA8EA,EAAsBrgE,aAGvG,CAACi7D,EAAeqE,IAkBC,IAAM/zF,cAAc,GAAiB,CACvD/B,MAAOA,EACPC,OAAQA,EACRwxF,cAAeA,EACft5B,QAASA,EACT24B,KAAMyC,EACN9wF,UAAWA,EACXivF,iBAAkBA,IAItB4D,GAAO3D,UAAY,CACjB4D,aAAc,KAAUh6F,OACxBk6F,YAAa,KAAUl6F,OACvBi6F,gBAAiB,KAAUj6F,OAC3BxC,MAAO,KAAUwC,OACjB02F,SAAU,KAAU12F,OACpBuV,KAAM,KAAUvV,OAGhBw3F,MAAO,KAAUx3F,OACjBmkB,KAAM,KAAUpkB,OAChB68D,QAAS,KAAUl8D,UAAU,CAAC,KAAUN,QAAS,KAAUJ,SAC3D8Y,QAAS,KAAU7a,OACnBk8F,iBAAkB,KAAUl8F,OAC5Bm8F,cAAe,KAAUv6F,KACzBw6F,iBAAkB,KAAUx6F,KAG5B4E,MAAO,KAAU/D,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SACxD0E,OAAQ,KAAUhE,UAAU,CAAC,KAAUX,OAAQ,KAAUC,SACzDkH,UAAW,KAAUlH,OACrBm2F,iBAAkB,KAAUn2F,OAG5By3F,YAAa,KAAU33F,KACvB43F,QAAS,KAAU53F,KACnBw6F,SAAU,KAAUx6F,KACpBy6F,WAAY,KAAUz6F,MAExBi6F,GAAOF,aAAe,CACpBrC,MAAO,QACP56B,QAAS,aACT9jD,QAAS,GACTqhF,iBAAkB,GAClBC,eAAe,EACfC,kBAAkB,EAGlB51F,MAAO,OACPC,OAAQ,OAGR+yF,YAAa,GACbC,QAAS,GACT6C,WAAY,IAGC,I,YAAA,MCjOA,GAFU,eAAK,I,QCDjBuB,GAAiC,CAC5C/O,QAAS,2/oGAyuBT2C,WAAY,m0BAqBZG,YAAa,i8EAuCb5C,YAAa,CACX,CACEsB,WAAY,SACZC,MAAO,YAET,CACED,WAAY,WACZC,MAAO,YAET,CACED,WAAY,UACZC,MAAO,YAET,CACED,WAAY,SACZC,MAAO,YAET,CACED,WAAY,SACZC,MAAO,YAET,CACED,WAAY,SACZC,MAAO,YAET,CACED,WAAY,YACZC,MAAO,SAET,CACED,WAAY,YACZC,MAAO,SAET,CACED,WAAY,WACZC,MAAO,SAET,CACED,WAAY,WACZC,MAAO,SAET,CACED,WAAY,YACZC,MAAO,SAET,CACED,WAAY,aACZC,MAAO,W,QCr0Bb,0E,OAGE,EAAAuN,eAAiB,gBACoB,IAAxB,EAAKC,gBACd,EAAK/8F,MAAMq7F,SAAS,EAAK0B,eAAelD,aAG5C,EAAAmD,iBAAmB,SAACzG,GAClB,EAAKwG,eAAiBxG,G,EAwB1B,OAjC2B,OAWzB,YAAA0G,iBAAA,gBACqC,IAAxB16F,KAAKw6F,gBACdx6F,KAAKw6F,eAAeh3C,UAGxB,YAAAjb,OAAA,WACE,IAAM75B,EAAS1O,KAAKvC,MAAMzB,MAI1B,OAHIgE,KAAKw6F,gBACPx6F,KAAKw6F,eAAeh3C,SAGpB,yBAAKm3C,OAAQ36F,KAAKu6F,gBAChB,kBAAC,GAAM,CACLr3F,OAAQ,OACRgyF,SAAUl1F,KAAKvC,MAAMy3F,SACrBc,MAAOh2F,KAAKvC,MAAMu4F,MAClBh6F,MAAO0S,EACPwnF,QAASl2F,KAAKy6F,qBAKxB,EAjCA,CAA2B,IAAMG,eA4CjC,eACE,WAAYn9F,GAAZ,MACE,YAAMA,IAAM,K,OACZ,EAAK2oC,MAAK,KAAQ3oC,EAAMzB,O,EA6D5B,OAhEyB,OAKvB,YAAAusC,OAAA,sBACQ,EAAkDvoC,KAAKvC,MAArDzB,EAAK,QAAEyK,EAAK,QAAEo0F,EAAY,eAAEC,EAAK,QAAEC,EAAQ,WACnD,OACE,kBAAC,mBAAe,KACd,kBAAC,SAAK,eACN,kBAAC,SAAK,CACJxiF,KAAK,OACLjd,KAAK,QACLk9F,aAAcx8F,EAAMgxF,MACpB1jF,IAAK,UAAO0sF,MACZ2E,OAAQ,SAACl6F,GACP,IAAMusF,EAAQvsF,EAAEu6F,cAAch/F,MAC9B,EAAKm0E,SAAS,CAAE6c,MAAOA,IACvB6N,GAAgBp0F,GAASo0F,EAAa,EAAD,KAAM7+F,GAAK,CAAEgxF,MAAOA,IAASvmF,MAGtE,kBAAC,SAAK,oBACN,kBAAC,SAAK,CACJ8R,KAAK,OACLjd,KAAK,aACLk9F,aAAcx8F,EAAM+wF,WACpBzjF,IAAK,UAAO0sF,MACZ2E,OAAQ,SAACl6F,GACP,IAAMssF,EAAatsF,EAAEu6F,cAAch/F,MACnC,EAAKm0E,SAAS,CAAE4c,WAAYA,IAC5B8N,GAAgBp0F,GAASo0F,EAAa,EAAD,KAAM7+F,GAAK,CAAE+wF,WAAYA,IAActmF,MAG/EzK,EAAMgxF,OAAS+N,QAAsBzmE,IAAV7tB,GAC1B,kBAAC,WAAO,CAAC6tF,QAAQ,sBAAsB0B,MAAO,QAC5C,kBAAC,UAAM,CACL7oD,QAAQ,cACR8tD,KAAK,YACLnnF,KAAK,KACLy6E,QAAS,WACPwM,EAASt0F,KACV,YAMLzK,EAAMgxF,OAAS8N,GACf,kBAAC,WAAO,CAACxG,QAAQ,+DAA+D0B,MAAO,QACrF,kBAAC,UAAM,CACL7oD,QAAQ,YACRr5B,KAAK,KACLmnF,KAAK,cACL1M,QAAS,WACPuM,EAAM,EAAK10D,SACZ,UASf,EAhEA,CAAyB,IAAMw0D,eAkE/B,0E,OACE,EAAAC,aAAe,SAACK,EAA8Bz0F,GAC5C,IAAI00F,EAAc,EAAH,KAAO,EAAK19F,MAAMzB,QACjCm/F,EAAY10F,GAASy0F,EACrB,EAAKz9F,MAAMq7F,SAASqC,IAEtB,EAAAL,MAAQ,SAACM,GACP,GAAyB,KAArBA,EAAWpO,MAAc,CAC3B,IAAImO,EAAc,EAAH,OAAO,EAAK19F,MAAMzB,QAAK,CAAEo/F,IACxC,EAAK39F,MAAMq7F,SAASqC,KAGxB,EAAAJ,SAAW,SAACt0F,GACV,IAAI00F,EAAc,EAAH,KAAO,EAAK19F,MAAMzB,QACjCm/F,EAAYtyE,OAAOpiB,EAAO,GAC1B,EAAKhJ,MAAMq7F,SAASqC,I,EAqCxB,OApD0B,OAiBxB,YAAA5yD,OAAA,sBACQ+lD,EAAS,GAAwB,UAAO0H,OACxCvK,EAAczrF,KAAKvC,MAAMzB,MAC/B,OACE,kBAAC,iBAAa,KACZ,kBAAC,mBAAe,KACd,kBAAC,WAAO,CAACs4F,QAAQ,uDAAuD0B,MAAM,QAC5E,kBAAC,UAAM,CACL7oD,QAAQ,cACR8tD,KAAK,YACLnnF,KAAK,KACLy6E,QAAS,WACP,EAAK9wF,MAAMq7F,SAAS,MACrB,cAKL,kBAAC,GAAU,CAAC98F,MAAO,CAAEgxF,MAAO,GAAID,WAAY,IAAMuB,OAAQA,EAAQwM,MAAO96F,KAAK86F,SAE/ErP,EAAY9/E,KAAI,SAAC0vF,EAA8B50F,GAC9C,OACE,kBAAC,GAAU,CACTnK,IAAK++F,EAAerO,MACpBhxF,MAAOq/F,EACP50F,MAAOA,EACPo0F,aAAc,EAAKA,aACnBE,SAAU,EAAKA,SACfzM,OAAQA,SAOtB,EApDA,CAA0B,IAAMsM,eAkL1B,GAA0B,SAAC5E,GAC/B,MAAO,CACLsF,YAAa,eAAG,mEACe,aAAhBtF,EAAMuF,QAAQC,IAE7BC,YAAa,eAAG,uIAIhBC,UAAW,eAAG,4IACkB,wEAIF,sBAJnB1F,EAAM2F,OAAOC,SAIX5F,EAAM2F,OAAOlgF,MAG1BogF,QAAS,eAAG,4IACoB,wEAIF,sBAJnB7F,EAAM2F,OAAOC,SAIX5F,EAAM2F,OAAOlgF,QCxU9B,wCAKO,IAAM,GAAS,IAAI,cAA2B,IAAaqgF,iBAAiBC,iBDiLrD,SAACC,GAC7B,OAAOA,EACJC,iBAAiB,CAChBC,SAAU,CAAC,gBACXnoF,KAAM,kBACNzY,KAAM,0BACN6gG,YAAa,iFAEdC,gBAAgB,CACfF,SAAU,CAAC,gBACXnoF,KAAM,YACNzY,KAAM,eACN6gG,YAAa,uKAEb7hF,GAAI,YACJk+E,aAAc8B,GAAe/O,QAC7ByI,OAAQ,SAAgBv2F,GACtB,IAAM4+F,EAAe,UAAOrG,MAAM16F,KAClC,OACE,kBAAC,GAAY,CACX45F,SAAS,MACTc,MAAwB,kBAAjBqG,EAAmC,WAAa,UACvDrgG,MAAOyB,EAAMzB,MACb88F,SAAUr7F,EAAMq7F,cAKvBmD,iBAAiB,CAChBC,SAAU,CAAC,kBACXnoF,KAAM,oBACNzY,KAAM,gCACN6gG,YAAa,+EACb3D,cAAc,IAEf4D,gBAAgB,CACfF,SAAU,CAAC,kBACXnoF,KAAM,cACNzY,KAAM,sBACN6gG,YAAa,kaAIb7hF,GAAI,cACJk+E,aAAc8B,GAAejM,YAC7B2F,OAAQ,SAAgBv2F,GACtB,IAAM4+F,EAAe,UAAOrG,MAAM16F,KAClC,OACE,kBAAC,GAAY,CACX45F,SAAS,aACTc,MAAwB,kBAAjBqG,EAAmC,WAAa,UACvDrgG,MAAOyB,EAAMzB,MACb88F,SAAUr7F,EAAMq7F,cAKvBmD,iBAAiB,CAChBC,SAAU,CAAC,gBACXnoF,KAAM,mBACNzY,KAAM,8BACN6gG,YAAa,+EACb3D,cAAc,IAEf4D,gBAAgB,CACfF,SAAU,CAAC,gBACXnoF,KAAM,aACNzY,KAAM,oBACN6gG,YAAa,6VAGb7hF,GAAI,aACJk+E,aAAc8B,GAAepM,WAC7B8F,OAAQ,SAAgBv2F,GACtB,IAAM4+F,EAAe,UAAOrG,MAAM16F,KAClC,OACE,kBAAC,GAAY,CACX45F,SAAS,aACTc,MAAwB,kBAAjBqG,EAAmC,WAAa,UACvDrgG,MAAOyB,EAAMzB,MACb88F,SAAUr7F,EAAMq7F,cAKvBmD,iBAAiB,CAChBC,SAAU,CAAC,eACXnoF,KAAM,YACNzY,KAAM,0BACN6gG,YACE,uGACF3D,cAAc,IAEfyD,iBAAiB,CAChBC,SAAU,CAAC,eACXnoF,KAAM,kBACNzY,KAAM,8BACN6gG,YACE,6IACF3D,cAAc,IAEf4D,gBAAgB,CACfF,SAAU,CAAC,eACX5hF,GAAI,cACJvG,KAAM,cACNzY,KAAM,eACN6gG,YACE,6NACF3D,aAAc8B,GAAe7O,YAC7BuI,OAAQ,KAETiI,iBAAiB,CAChBC,SAAU,CAAC,UACXnoF,KAAM,eACNzY,KAAM,kBAEPghG,mBAAmB,CAClBJ,SAAU,CAAC,UACXnoF,KAAM,eACNzY,KAAM,gBACNihG,OAAQ,SAACC,GAAS,OAAAA,EAAA","file":"module.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"/\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 22);\n","module.exports = __WEBPACK_EXTERNAL_MODULE__0__;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nif (process.env.NODE_ENV !== 'production') {\n var ReactIs = require('react-is');\n\n // By explicitly using `prop-types` you are opting into new development behavior.\n // http://fb.me/prop-types-in-prod\n var throwOnDirectAccess = true;\n module.exports = require('./factoryWithTypeCheckers')(ReactIs.isElement, throwOnDirectAccess);\n} else {\n // By explicitly using `prop-types` you are opting into new production behavior.\n // http://fb.me/prop-types-in-prod\n module.exports = require('./factoryWithThrowingShims')();\n}\n","module.exports = __WEBPACK_EXTERNAL_MODULE__2__;","module.exports = __WEBPACK_EXTERNAL_MODULE__3__;","module.exports = __WEBPACK_EXTERNAL_MODULE__4__;","module.exports = __WEBPACK_EXTERNAL_MODULE__5__;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = require('./lib/ReactPropTypesSecret');\n\nfunction emptyFunction() {}\nfunction emptyFunctionWithReset() {}\nemptyFunctionWithReset.resetWarningCache = emptyFunction;\n\nmodule.exports = function() {\n function shim(props, propName, componentName, location, propFullName, secret) {\n if (secret === ReactPropTypesSecret) {\n // It is still safe when called from React.\n return;\n }\n var err = new Error(\n 'Calling PropTypes validators directly is not supported by the `prop-types` package. ' +\n 'Use PropTypes.checkPropTypes() to call them. ' +\n 'Read more at http://fb.me/use-check-prop-types'\n );\n err.name = 'Invariant Violation';\n throw err;\n };\n shim.isRequired = shim;\n function getShim() {\n return shim;\n };\n // Important!\n // Keep this list in sync with production version in `./factoryWithTypeCheckers.js`.\n var ReactPropTypes = {\n array: shim,\n bool: shim,\n func: shim,\n number: shim,\n object: shim,\n string: shim,\n symbol: shim,\n\n any: shim,\n arrayOf: getShim,\n element: shim,\n elementType: shim,\n instanceOf: getShim,\n node: shim,\n objectOf: getShim,\n oneOf: getShim,\n oneOfType: getShim,\n shape: getShim,\n exact: getShim,\n\n checkPropTypes: emptyFunctionWithReset,\n resetWarningCache: emptyFunction\n };\n\n ReactPropTypes.PropTypes = ReactPropTypes;\n\n return ReactPropTypes;\n};\n","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';\n\nmodule.exports = ReactPropTypesSecret;\n","/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n extendStatics = Object.setPrototypeOf ||\r\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n if (typeof b !== \"function\" && b !== null)\r\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n extendStatics(d, b);\r\n function __() { this.constructor = d; }\r\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n __assign = Object.assign || function __assign(t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n }\r\n return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n var t = {};\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n t[p] = s[p];\r\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n t[p[i]] = s[p[i]];\r\n }\r\n return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n return new (P || (P = Promise))(function (resolve, reject) {\r\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (_) try {\r\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\r\n}) : (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n if (m) return m.call(o);\r\n if (o && typeof o.length === \"number\") return {\r\n next: function () {\r\n if (o && i >= o.length) o = void 0;\r\n return { value: o && o[i++], done: !o };\r\n }\r\n };\r\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n if (!m) return o;\r\n var i = m.call(o), r, ar = [], e;\r\n try {\r\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n }\r\n catch (error) { e = { error: error }; }\r\n finally {\r\n try {\r\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n }\r\n finally { if (e) throw e.error; }\r\n }\r\n return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n for (var ar = [], i = 0; i < arguments.length; i++)\r\n ar = ar.concat(__read(arguments[i]));\r\n return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n r[k] = a[j];\r\n return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n if (ar || !(i in from)) {\r\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n ar[i] = from[i];\r\n }\r\n }\r\n return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n function fulfill(value) { resume(\"next\", value); }\r\n function reject(value) { resume(\"throw\", value); }\r\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n var i, p;\r\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var m = o[Symbol.asyncIterator], i;\r\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n if (mod && mod.__esModule) return mod;\r\n var result = {};\r\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n __setModuleDefault(result, mod);\r\n return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n","/*!\n* @svgdotjs/svg.js - A lightweight library for manipulating and animating SVG.\n* @version 3.1.1\n* https://svgjs.dev/\n*\n* @copyright Wout Fierens \n* @license MIT\n*\n* BUILT: Fri Jun 25 2021 15:37:54 GMT+0200 (Mitteleuropäische Sommerzeit)\n*/;\nconst methods$1 = {};\nconst names = [];\nfunction registerMethods(name, m) {\n if (Array.isArray(name)) {\n for (const _name of name) {\n registerMethods(_name, m);\n }\n\n return;\n }\n\n if (typeof name === 'object') {\n for (const _name in name) {\n registerMethods(_name, name[_name]);\n }\n\n return;\n }\n\n addMethodNames(Object.getOwnPropertyNames(m));\n methods$1[name] = Object.assign(methods$1[name] || {}, m);\n}\nfunction getMethodsFor(name) {\n return methods$1[name] || {};\n}\nfunction getMethodNames() {\n return [...new Set(names)];\n}\nfunction addMethodNames(_names) {\n names.push(..._names);\n}\n\n// Map function\nfunction map(array, block) {\n let i;\n const il = array.length;\n const result = [];\n\n for (i = 0; i < il; i++) {\n result.push(block(array[i]));\n }\n\n return result;\n} // Filter function\n\nfunction filter(array, block) {\n let i;\n const il = array.length;\n const result = [];\n\n for (i = 0; i < il; i++) {\n if (block(array[i])) {\n result.push(array[i]);\n }\n }\n\n return result;\n} // Degrees to radians\n\nfunction radians(d) {\n return d % 360 * Math.PI / 180;\n} // Radians to degrees\n\nfunction degrees(r) {\n return r * 180 / Math.PI % 360;\n} // Convert dash-separated-string to camelCase\n\nfunction camelCase(s) {\n return s.toLowerCase().replace(/-(.)/g, function (m, g) {\n return g.toUpperCase();\n });\n} // Convert camel cased string to dash separated\n\nfunction unCamelCase(s) {\n return s.replace(/([A-Z])/g, function (m, g) {\n return '-' + g.toLowerCase();\n });\n} // Capitalize first letter of a string\n\nfunction capitalize(s) {\n return s.charAt(0).toUpperCase() + s.slice(1);\n} // Calculate proportional width and height values when necessary\n\nfunction proportionalSize(element, width, height, box) {\n if (width == null || height == null) {\n box = box || element.bbox();\n\n if (width == null) {\n width = box.width / box.height * height;\n } else if (height == null) {\n height = box.height / box.width * width;\n }\n }\n\n return {\n width: width,\n height: height\n };\n}\n/**\r\n * This function adds support for string origins.\r\n * It searches for an origin in o.origin o.ox and o.originX.\r\n * This way, origin: {x: 'center', y: 50} can be passed as well as ox: 'center', oy: 50\r\n**/\n\nfunction getOrigin(o, element) {\n const origin = o.origin; // First check if origin is in ox or originX\n\n let ox = o.ox != null ? o.ox : o.originX != null ? o.originX : 'center';\n let oy = o.oy != null ? o.oy : o.originY != null ? o.originY : 'center'; // Then check if origin was used and overwrite in that case\n\n if (origin != null) {\n [ox, oy] = Array.isArray(origin) ? origin : typeof origin === 'object' ? [origin.x, origin.y] : [origin, origin];\n } // Make sure to only call bbox when actually needed\n\n\n const condX = typeof ox === 'string';\n const condY = typeof oy === 'string';\n\n if (condX || condY) {\n const {\n height,\n width,\n x,\n y\n } = element.bbox(); // And only overwrite if string was passed for this specific axis\n\n if (condX) {\n ox = ox.includes('left') ? x : ox.includes('right') ? x + width : x + width / 2;\n }\n\n if (condY) {\n oy = oy.includes('top') ? y : oy.includes('bottom') ? y + height : y + height / 2;\n }\n } // Return the origin as it is if it wasn't a string\n\n\n return [ox, oy];\n}\n\nvar utils = {\n __proto__: null,\n map: map,\n filter: filter,\n radians: radians,\n degrees: degrees,\n camelCase: camelCase,\n unCamelCase: unCamelCase,\n capitalize: capitalize,\n proportionalSize: proportionalSize,\n getOrigin: getOrigin\n};\n\n// Default namespaces\nconst svg = 'http://www.w3.org/2000/svg';\nconst html = 'http://www.w3.org/1999/xhtml';\nconst xmlns = 'http://www.w3.org/2000/xmlns/';\nconst xlink = 'http://www.w3.org/1999/xlink';\nconst svgjs = 'http://svgjs.dev/svgjs';\n\nvar namespaces = {\n __proto__: null,\n svg: svg,\n html: html,\n xmlns: xmlns,\n xlink: xlink,\n svgjs: svgjs\n};\n\nconst globals = {\n window: typeof window === 'undefined' ? null : window,\n document: typeof document === 'undefined' ? null : document\n};\nfunction registerWindow(win = null, doc = null) {\n globals.window = win;\n globals.document = doc;\n}\nconst save = {};\nfunction saveWindow() {\n save.window = globals.window;\n save.document = globals.document;\n}\nfunction restoreWindow() {\n globals.window = save.window;\n globals.document = save.document;\n}\nfunction withWindow(win, fn) {\n saveWindow();\n registerWindow(win, win.document);\n fn(win, win.document);\n restoreWindow();\n}\nfunction getWindow() {\n return globals.window;\n}\n\nclass Base {// constructor (node/*, {extensions = []} */) {\n // // this.tags = []\n // //\n // // for (let extension of extensions) {\n // // extension.setup.call(this, node)\n // // this.tags.push(extension.name)\n // // }\n // }\n}\n\nconst elements = {};\nconst root = '___SYMBOL___ROOT___'; // Method for element creation\n\nfunction create(name, ns = svg) {\n // create element\n return globals.document.createElementNS(ns, name);\n}\nfunction makeInstance(element, isHTML = false) {\n if (element instanceof Base) return element;\n\n if (typeof element === 'object') {\n return adopter(element);\n }\n\n if (element == null) {\n return new elements[root]();\n }\n\n if (typeof element === 'string' && element.charAt(0) !== '<') {\n return adopter(globals.document.querySelector(element));\n } // Make sure, that HTML elements are created with the correct namespace\n\n\n const wrapper = isHTML ? globals.document.createElement('div') : create('svg');\n wrapper.innerHTML = element; // We can use firstChild here because we know,\n // that the first char is < and thus an element\n\n element = adopter(wrapper.firstChild); // make sure, that element doesnt have its wrapper attached\n\n wrapper.removeChild(wrapper.firstChild);\n return element;\n}\nfunction nodeOrNew(name, node) {\n return node instanceof globals.window.Node ? node : create(name);\n} // Adopt existing svg elements\n\nfunction adopt(node) {\n // check for presence of node\n if (!node) return null; // make sure a node isn't already adopted\n\n if (node.instance instanceof Base) return node.instance;\n\n if (node.nodeName === '#document-fragment') {\n return new elements.Fragment(node);\n } // initialize variables\n\n\n let className = capitalize(node.nodeName || 'Dom'); // Make sure that gradients are adopted correctly\n\n if (className === 'LinearGradient' || className === 'RadialGradient') {\n className = 'Gradient'; // Fallback to Dom if element is not known\n } else if (!elements[className]) {\n className = 'Dom';\n }\n\n return new elements[className](node);\n}\nlet adopter = adopt;\nfunction mockAdopt(mock = adopt) {\n adopter = mock;\n}\nfunction register(element, name = element.name, asRoot = false) {\n elements[name] = element;\n if (asRoot) elements[root] = element;\n addMethodNames(Object.getOwnPropertyNames(element.prototype));\n return element;\n}\nfunction getClass(name) {\n return elements[name];\n} // Element id sequence\n\nlet did = 1000; // Get next named element id\n\nfunction eid(name) {\n return 'Svgjs' + capitalize(name) + did++;\n} // Deep new id assignment\n\nfunction assignNewId(node) {\n // do the same for SVG child nodes as well\n for (let i = node.children.length - 1; i >= 0; i--) {\n assignNewId(node.children[i]);\n }\n\n if (node.id) {\n node.id = eid(node.nodeName);\n return node;\n }\n\n return node;\n} // Method for extending objects\n\nfunction extend(modules, methods) {\n let key, i;\n modules = Array.isArray(modules) ? modules : [modules];\n\n for (i = modules.length - 1; i >= 0; i--) {\n for (key in methods) {\n modules[i].prototype[key] = methods[key];\n }\n }\n}\nfunction wrapWithAttrCheck(fn) {\n return function (...args) {\n const o = args[args.length - 1];\n\n if (o && o.constructor === Object && !(o instanceof Array)) {\n return fn.apply(this, args.slice(0, -1)).attr(o);\n } else {\n return fn.apply(this, args);\n }\n };\n}\n\nfunction siblings() {\n return this.parent().children();\n} // Get the current position siblings\n\nfunction position() {\n return this.parent().index(this);\n} // Get the next element (will return null if there is none)\n\nfunction next() {\n return this.siblings()[this.position() + 1];\n} // Get the next element (will return null if there is none)\n\nfunction prev() {\n return this.siblings()[this.position() - 1];\n} // Send given element one step forward\n\nfunction forward() {\n const i = this.position();\n const p = this.parent(); // move node one step forward\n\n p.add(this.remove(), i + 1);\n return this;\n} // Send given element one step backward\n\nfunction backward() {\n const i = this.position();\n const p = this.parent();\n p.add(this.remove(), i ? i - 1 : 0);\n return this;\n} // Send given element all the way to the front\n\nfunction front() {\n const p = this.parent(); // Move node forward\n\n p.add(this.remove());\n return this;\n} // Send given element all the way to the back\n\nfunction back() {\n const p = this.parent(); // Move node back\n\n p.add(this.remove(), 0);\n return this;\n} // Inserts a given element before the targeted element\n\nfunction before(element) {\n element = makeInstance(element);\n element.remove();\n const i = this.position();\n this.parent().add(element, i);\n return this;\n} // Inserts a given element after the targeted element\n\nfunction after(element) {\n element = makeInstance(element);\n element.remove();\n const i = this.position();\n this.parent().add(element, i + 1);\n return this;\n}\nfunction insertBefore(element) {\n element = makeInstance(element);\n element.before(this);\n return this;\n}\nfunction insertAfter(element) {\n element = makeInstance(element);\n element.after(this);\n return this;\n}\nregisterMethods('Dom', {\n siblings,\n position,\n next,\n prev,\n forward,\n backward,\n front,\n back,\n before,\n after,\n insertBefore,\n insertAfter\n});\n\n// Parse unit value\nconst numberAndUnit = /^([+-]?(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?)([a-z%]*)$/i; // Parse hex value\n\nconst hex = /^#?([a-f\\d]{2})([a-f\\d]{2})([a-f\\d]{2})$/i; // Parse rgb value\n\nconst rgb = /rgb\\((\\d+),(\\d+),(\\d+)\\)/; // Parse reference id\n\nconst reference = /(#[a-z_][a-z0-9\\-_]*)/i; // splits a transformation chain\n\nconst transforms = /\\)\\s*,?\\s*/; // Whitespace\n\nconst whitespace = /\\s/g; // Test hex value\n\nconst isHex = /^#[a-f0-9]{3}$|^#[a-f0-9]{6}$/i; // Test rgb value\n\nconst isRgb = /^rgb\\(/; // Test for blank string\n\nconst isBlank = /^(\\s+)?$/; // Test for numeric string\n\nconst isNumber = /^[+-]?(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i; // Test for image url\n\nconst isImage = /\\.(jpg|jpeg|png|gif|svg)(\\?[^=]+.*)?/i; // split at whitespace and comma\n\nconst delimiter = /[\\s,]+/; // Test for path letter\n\nconst isPathLetter = /[MLHVCSQTAZ]/i;\n\nvar regex = {\n __proto__: null,\n numberAndUnit: numberAndUnit,\n hex: hex,\n rgb: rgb,\n reference: reference,\n transforms: transforms,\n whitespace: whitespace,\n isHex: isHex,\n isRgb: isRgb,\n isBlank: isBlank,\n isNumber: isNumber,\n isImage: isImage,\n delimiter: delimiter,\n isPathLetter: isPathLetter\n};\n\nfunction classes() {\n const attr = this.attr('class');\n return attr == null ? [] : attr.trim().split(delimiter);\n} // Return true if class exists on the node, false otherwise\n\nfunction hasClass(name) {\n return this.classes().indexOf(name) !== -1;\n} // Add class to the node\n\nfunction addClass(name) {\n if (!this.hasClass(name)) {\n const array = this.classes();\n array.push(name);\n this.attr('class', array.join(' '));\n }\n\n return this;\n} // Remove class from the node\n\nfunction removeClass(name) {\n if (this.hasClass(name)) {\n this.attr('class', this.classes().filter(function (c) {\n return c !== name;\n }).join(' '));\n }\n\n return this;\n} // Toggle the presence of a class on the node\n\nfunction toggleClass(name) {\n return this.hasClass(name) ? this.removeClass(name) : this.addClass(name);\n}\nregisterMethods('Dom', {\n classes,\n hasClass,\n addClass,\n removeClass,\n toggleClass\n});\n\nfunction css(style, val) {\n const ret = {};\n\n if (arguments.length === 0) {\n // get full style as object\n this.node.style.cssText.split(/\\s*;\\s*/).filter(function (el) {\n return !!el.length;\n }).forEach(function (el) {\n const t = el.split(/\\s*:\\s*/);\n ret[t[0]] = t[1];\n });\n return ret;\n }\n\n if (arguments.length < 2) {\n // get style properties as array\n if (Array.isArray(style)) {\n for (const name of style) {\n const cased = camelCase(name);\n ret[cased] = this.node.style[cased];\n }\n\n return ret;\n } // get style for property\n\n\n if (typeof style === 'string') {\n return this.node.style[camelCase(style)];\n } // set styles in object\n\n\n if (typeof style === 'object') {\n for (const name in style) {\n // set empty string if null/undefined/'' was given\n this.node.style[camelCase(name)] = style[name] == null || isBlank.test(style[name]) ? '' : style[name];\n }\n }\n } // set style for property\n\n\n if (arguments.length === 2) {\n this.node.style[camelCase(style)] = val == null || isBlank.test(val) ? '' : val;\n }\n\n return this;\n} // Show element\n\nfunction show() {\n return this.css('display', '');\n} // Hide element\n\nfunction hide() {\n return this.css('display', 'none');\n} // Is element visible?\n\nfunction visible() {\n return this.css('display') !== 'none';\n}\nregisterMethods('Dom', {\n css,\n show,\n hide,\n visible\n});\n\nfunction data(a, v, r) {\n if (a == null) {\n // get an object of attributes\n return this.data(map(filter(this.node.attributes, el => el.nodeName.indexOf('data-') === 0), el => el.nodeName.slice(5)));\n } else if (a instanceof Array) {\n const data = {};\n\n for (const key of a) {\n data[key] = this.data(key);\n }\n\n return data;\n } else if (typeof a === 'object') {\n for (v in a) {\n this.data(v, a[v]);\n }\n } else if (arguments.length < 2) {\n try {\n return JSON.parse(this.attr('data-' + a));\n } catch (e) {\n return this.attr('data-' + a);\n }\n } else {\n this.attr('data-' + a, v === null ? null : r === true || typeof v === 'string' || typeof v === 'number' ? v : JSON.stringify(v));\n }\n\n return this;\n}\nregisterMethods('Dom', {\n data\n});\n\nfunction remember(k, v) {\n // remember every item in an object individually\n if (typeof arguments[0] === 'object') {\n for (const key in k) {\n this.remember(key, k[key]);\n }\n } else if (arguments.length === 1) {\n // retrieve memory\n return this.memory()[k];\n } else {\n // store memory\n this.memory()[k] = v;\n }\n\n return this;\n} // Erase a given memory\n\nfunction forget() {\n if (arguments.length === 0) {\n this._memory = {};\n } else {\n for (let i = arguments.length - 1; i >= 0; i--) {\n delete this.memory()[arguments[i]];\n }\n }\n\n return this;\n} // This triggers creation of a new hidden class which is not performant\n// However, this function is not rarely used so it will not happen frequently\n// Return local memory object\n\nfunction memory() {\n return this._memory = this._memory || {};\n}\nregisterMethods('Dom', {\n remember,\n forget,\n memory\n});\n\nfunction sixDigitHex(hex) {\n return hex.length === 4 ? ['#', hex.substring(1, 2), hex.substring(1, 2), hex.substring(2, 3), hex.substring(2, 3), hex.substring(3, 4), hex.substring(3, 4)].join('') : hex;\n}\n\nfunction componentHex(component) {\n const integer = Math.round(component);\n const bounded = Math.max(0, Math.min(255, integer));\n const hex = bounded.toString(16);\n return hex.length === 1 ? '0' + hex : hex;\n}\n\nfunction is(object, space) {\n for (let i = space.length; i--;) {\n if (object[space[i]] == null) {\n return false;\n }\n }\n\n return true;\n}\n\nfunction getParameters(a, b) {\n const params = is(a, 'rgb') ? {\n _a: a.r,\n _b: a.g,\n _c: a.b,\n _d: 0,\n space: 'rgb'\n } : is(a, 'xyz') ? {\n _a: a.x,\n _b: a.y,\n _c: a.z,\n _d: 0,\n space: 'xyz'\n } : is(a, 'hsl') ? {\n _a: a.h,\n _b: a.s,\n _c: a.l,\n _d: 0,\n space: 'hsl'\n } : is(a, 'lab') ? {\n _a: a.l,\n _b: a.a,\n _c: a.b,\n _d: 0,\n space: 'lab'\n } : is(a, 'lch') ? {\n _a: a.l,\n _b: a.c,\n _c: a.h,\n _d: 0,\n space: 'lch'\n } : is(a, 'cmyk') ? {\n _a: a.c,\n _b: a.m,\n _c: a.y,\n _d: a.k,\n space: 'cmyk'\n } : {\n _a: 0,\n _b: 0,\n _c: 0,\n space: 'rgb'\n };\n params.space = b || params.space;\n return params;\n}\n\nfunction cieSpace(space) {\n if (space === 'lab' || space === 'xyz' || space === 'lch') {\n return true;\n } else {\n return false;\n }\n}\n\nfunction hueToRgb(p, q, t) {\n if (t < 0) t += 1;\n if (t > 1) t -= 1;\n if (t < 1 / 6) return p + (q - p) * 6 * t;\n if (t < 1 / 2) return q;\n if (t < 2 / 3) return p + (q - p) * (2 / 3 - t) * 6;\n return p;\n}\n\nclass Color {\n constructor(...inputs) {\n this.init(...inputs);\n } // Test if given value is a color\n\n\n static isColor(color) {\n return color && (color instanceof Color || this.isRgb(color) || this.test(color));\n } // Test if given value is an rgb object\n\n\n static isRgb(color) {\n return color && typeof color.r === 'number' && typeof color.g === 'number' && typeof color.b === 'number';\n }\n /*\r\n Generating random colors\r\n */\n\n\n static random(mode = 'vibrant', t, u) {\n // Get the math modules\n const {\n random,\n round,\n sin,\n PI: pi\n } = Math; // Run the correct generator\n\n if (mode === 'vibrant') {\n const l = (81 - 57) * random() + 57;\n const c = (83 - 45) * random() + 45;\n const h = 360 * random();\n const color = new Color(l, c, h, 'lch');\n return color;\n } else if (mode === 'sine') {\n t = t == null ? random() : t;\n const r = round(80 * sin(2 * pi * t / 0.5 + 0.01) + 150);\n const g = round(50 * sin(2 * pi * t / 0.5 + 4.6) + 200);\n const b = round(100 * sin(2 * pi * t / 0.5 + 2.3) + 150);\n const color = new Color(r, g, b);\n return color;\n } else if (mode === 'pastel') {\n const l = (94 - 86) * random() + 86;\n const c = (26 - 9) * random() + 9;\n const h = 360 * random();\n const color = new Color(l, c, h, 'lch');\n return color;\n } else if (mode === 'dark') {\n const l = 10 + 10 * random();\n const c = (125 - 75) * random() + 86;\n const h = 360 * random();\n const color = new Color(l, c, h, 'lch');\n return color;\n } else if (mode === 'rgb') {\n const r = 255 * random();\n const g = 255 * random();\n const b = 255 * random();\n const color = new Color(r, g, b);\n return color;\n } else if (mode === 'lab') {\n const l = 100 * random();\n const a = 256 * random() - 128;\n const b = 256 * random() - 128;\n const color = new Color(l, a, b, 'lab');\n return color;\n } else if (mode === 'grey') {\n const grey = 255 * random();\n const color = new Color(grey, grey, grey);\n return color;\n } else {\n throw new Error('Unsupported random color mode');\n }\n } // Test if given value is a color string\n\n\n static test(color) {\n return typeof color === 'string' && (isHex.test(color) || isRgb.test(color));\n }\n\n cmyk() {\n // Get the rgb values for the current color\n const {\n _a,\n _b,\n _c\n } = this.rgb();\n const [r, g, b] = [_a, _b, _c].map(v => v / 255); // Get the cmyk values in an unbounded format\n\n const k = Math.min(1 - r, 1 - g, 1 - b);\n\n if (k === 1) {\n // Catch the black case\n return new Color(0, 0, 0, 1, 'cmyk');\n }\n\n const c = (1 - r - k) / (1 - k);\n const m = (1 - g - k) / (1 - k);\n const y = (1 - b - k) / (1 - k); // Construct the new color\n\n const color = new Color(c, m, y, k, 'cmyk');\n return color;\n }\n\n hsl() {\n // Get the rgb values\n const {\n _a,\n _b,\n _c\n } = this.rgb();\n const [r, g, b] = [_a, _b, _c].map(v => v / 255); // Find the maximum and minimum values to get the lightness\n\n const max = Math.max(r, g, b);\n const min = Math.min(r, g, b);\n const l = (max + min) / 2; // If the r, g, v values are identical then we are grey\n\n const isGrey = max === min; // Calculate the hue and saturation\n\n const delta = max - min;\n const s = isGrey ? 0 : l > 0.5 ? delta / (2 - max - min) : delta / (max + min);\n const h = isGrey ? 0 : max === r ? ((g - b) / delta + (g < b ? 6 : 0)) / 6 : max === g ? ((b - r) / delta + 2) / 6 : max === b ? ((r - g) / delta + 4) / 6 : 0; // Construct and return the new color\n\n const color = new Color(360 * h, 100 * s, 100 * l, 'hsl');\n return color;\n }\n\n init(a = 0, b = 0, c = 0, d = 0, space = 'rgb') {\n // This catches the case when a falsy value is passed like ''\n a = !a ? 0 : a; // Reset all values in case the init function is rerun with new color space\n\n if (this.space) {\n for (const component in this.space) {\n delete this[this.space[component]];\n }\n }\n\n if (typeof a === 'number') {\n // Allow for the case that we don't need d...\n space = typeof d === 'string' ? d : space;\n d = typeof d === 'string' ? 0 : d; // Assign the values straight to the color\n\n Object.assign(this, {\n _a: a,\n _b: b,\n _c: c,\n _d: d,\n space\n }); // If the user gave us an array, make the color from it\n } else if (a instanceof Array) {\n this.space = b || (typeof a[3] === 'string' ? a[3] : a[4]) || 'rgb';\n Object.assign(this, {\n _a: a[0],\n _b: a[1],\n _c: a[2],\n _d: a[3] || 0\n });\n } else if (a instanceof Object) {\n // Set the object up and assign its values directly\n const values = getParameters(a, b);\n Object.assign(this, values);\n } else if (typeof a === 'string') {\n if (isRgb.test(a)) {\n const noWhitespace = a.replace(whitespace, '');\n const [_a, _b, _c] = rgb.exec(noWhitespace).slice(1, 4).map(v => parseInt(v));\n Object.assign(this, {\n _a,\n _b,\n _c,\n _d: 0,\n space: 'rgb'\n });\n } else if (isHex.test(a)) {\n const hexParse = v => parseInt(v, 16);\n\n const [, _a, _b, _c] = hex.exec(sixDigitHex(a)).map(hexParse);\n Object.assign(this, {\n _a,\n _b,\n _c,\n _d: 0,\n space: 'rgb'\n });\n } else throw Error('Unsupported string format, can\\'t construct Color');\n } // Now add the components as a convenience\n\n\n const {\n _a,\n _b,\n _c,\n _d\n } = this;\n const components = this.space === 'rgb' ? {\n r: _a,\n g: _b,\n b: _c\n } : this.space === 'xyz' ? {\n x: _a,\n y: _b,\n z: _c\n } : this.space === 'hsl' ? {\n h: _a,\n s: _b,\n l: _c\n } : this.space === 'lab' ? {\n l: _a,\n a: _b,\n b: _c\n } : this.space === 'lch' ? {\n l: _a,\n c: _b,\n h: _c\n } : this.space === 'cmyk' ? {\n c: _a,\n m: _b,\n y: _c,\n k: _d\n } : {};\n Object.assign(this, components);\n }\n\n lab() {\n // Get the xyz color\n const {\n x,\n y,\n z\n } = this.xyz(); // Get the lab components\n\n const l = 116 * y - 16;\n const a = 500 * (x - y);\n const b = 200 * (y - z); // Construct and return a new color\n\n const color = new Color(l, a, b, 'lab');\n return color;\n }\n\n lch() {\n // Get the lab color directly\n const {\n l,\n a,\n b\n } = this.lab(); // Get the chromaticity and the hue using polar coordinates\n\n const c = Math.sqrt(a ** 2 + b ** 2);\n let h = 180 * Math.atan2(b, a) / Math.PI;\n\n if (h < 0) {\n h *= -1;\n h = 360 - h;\n } // Make a new color and return it\n\n\n const color = new Color(l, c, h, 'lch');\n return color;\n }\n /*\r\n Conversion Methods\r\n */\n\n\n rgb() {\n if (this.space === 'rgb') {\n return this;\n } else if (cieSpace(this.space)) {\n // Convert to the xyz color space\n let {\n x,\n y,\n z\n } = this;\n\n if (this.space === 'lab' || this.space === 'lch') {\n // Get the values in the lab space\n let {\n l,\n a,\n b\n } = this;\n\n if (this.space === 'lch') {\n const {\n c,\n h\n } = this;\n const dToR = Math.PI / 180;\n a = c * Math.cos(dToR * h);\n b = c * Math.sin(dToR * h);\n } // Undo the nonlinear function\n\n\n const yL = (l + 16) / 116;\n const xL = a / 500 + yL;\n const zL = yL - b / 200; // Get the xyz values\n\n const ct = 16 / 116;\n const mx = 0.008856;\n const nm = 7.787;\n x = 0.95047 * (xL ** 3 > mx ? xL ** 3 : (xL - ct) / nm);\n y = 1.00000 * (yL ** 3 > mx ? yL ** 3 : (yL - ct) / nm);\n z = 1.08883 * (zL ** 3 > mx ? zL ** 3 : (zL - ct) / nm);\n } // Convert xyz to unbounded rgb values\n\n\n const rU = x * 3.2406 + y * -1.5372 + z * -0.4986;\n const gU = x * -0.9689 + y * 1.8758 + z * 0.0415;\n const bU = x * 0.0557 + y * -0.2040 + z * 1.0570; // Convert the values to true rgb values\n\n const pow = Math.pow;\n const bd = 0.0031308;\n const r = rU > bd ? 1.055 * pow(rU, 1 / 2.4) - 0.055 : 12.92 * rU;\n const g = gU > bd ? 1.055 * pow(gU, 1 / 2.4) - 0.055 : 12.92 * gU;\n const b = bU > bd ? 1.055 * pow(bU, 1 / 2.4) - 0.055 : 12.92 * bU; // Make and return the color\n\n const color = new Color(255 * r, 255 * g, 255 * b);\n return color;\n } else if (this.space === 'hsl') {\n // https://bgrins.github.io/TinyColor/docs/tinycolor.html\n // Get the current hsl values\n let {\n h,\n s,\n l\n } = this;\n h /= 360;\n s /= 100;\n l /= 100; // If we are grey, then just make the color directly\n\n if (s === 0) {\n l *= 255;\n const color = new Color(l, l, l);\n return color;\n } // TODO I have no idea what this does :D If you figure it out, tell me!\n\n\n const q = l < 0.5 ? l * (1 + s) : l + s - l * s;\n const p = 2 * l - q; // Get the rgb values\n\n const r = 255 * hueToRgb(p, q, h + 1 / 3);\n const g = 255 * hueToRgb(p, q, h);\n const b = 255 * hueToRgb(p, q, h - 1 / 3); // Make a new color\n\n const color = new Color(r, g, b);\n return color;\n } else if (this.space === 'cmyk') {\n // https://gist.github.com/felipesabino/5066336\n // Get the normalised cmyk values\n const {\n c,\n m,\n y,\n k\n } = this; // Get the rgb values\n\n const r = 255 * (1 - Math.min(1, c * (1 - k) + k));\n const g = 255 * (1 - Math.min(1, m * (1 - k) + k));\n const b = 255 * (1 - Math.min(1, y * (1 - k) + k)); // Form the color and return it\n\n const color = new Color(r, g, b);\n return color;\n } else {\n return this;\n }\n }\n\n toArray() {\n const {\n _a,\n _b,\n _c,\n _d,\n space\n } = this;\n return [_a, _b, _c, _d, space];\n }\n\n toHex() {\n const [r, g, b] = this._clamped().map(componentHex);\n\n return `#${r}${g}${b}`;\n }\n\n toRgb() {\n const [rV, gV, bV] = this._clamped();\n\n const string = `rgb(${rV},${gV},${bV})`;\n return string;\n }\n\n toString() {\n return this.toHex();\n }\n\n xyz() {\n // Normalise the red, green and blue values\n const {\n _a: r255,\n _b: g255,\n _c: b255\n } = this.rgb();\n const [r, g, b] = [r255, g255, b255].map(v => v / 255); // Convert to the lab rgb space\n\n const rL = r > 0.04045 ? Math.pow((r + 0.055) / 1.055, 2.4) : r / 12.92;\n const gL = g > 0.04045 ? Math.pow((g + 0.055) / 1.055, 2.4) : g / 12.92;\n const bL = b > 0.04045 ? Math.pow((b + 0.055) / 1.055, 2.4) : b / 12.92; // Convert to the xyz color space without bounding the values\n\n const xU = (rL * 0.4124 + gL * 0.3576 + bL * 0.1805) / 0.95047;\n const yU = (rL * 0.2126 + gL * 0.7152 + bL * 0.0722) / 1.00000;\n const zU = (rL * 0.0193 + gL * 0.1192 + bL * 0.9505) / 1.08883; // Get the proper xyz values by applying the bounding\n\n const x = xU > 0.008856 ? Math.pow(xU, 1 / 3) : 7.787 * xU + 16 / 116;\n const y = yU > 0.008856 ? Math.pow(yU, 1 / 3) : 7.787 * yU + 16 / 116;\n const z = zU > 0.008856 ? Math.pow(zU, 1 / 3) : 7.787 * zU + 16 / 116; // Make and return the color\n\n const color = new Color(x, y, z, 'xyz');\n return color;\n }\n /*\r\n Input and Output methods\r\n */\n\n\n _clamped() {\n const {\n _a,\n _b,\n _c\n } = this.rgb();\n const {\n max,\n min,\n round\n } = Math;\n\n const format = v => max(0, min(round(v), 255));\n\n return [_a, _b, _c].map(format);\n }\n /*\r\n Constructing colors\r\n */\n\n\n}\n\nclass Point {\n // Initialize\n constructor(...args) {\n this.init(...args);\n } // Clone point\n\n\n clone() {\n return new Point(this);\n }\n\n init(x, y) {\n const base = {\n x: 0,\n y: 0\n }; // ensure source as object\n\n const source = Array.isArray(x) ? {\n x: x[0],\n y: x[1]\n } : typeof x === 'object' ? {\n x: x.x,\n y: x.y\n } : {\n x: x,\n y: y\n }; // merge source\n\n this.x = source.x == null ? base.x : source.x;\n this.y = source.y == null ? base.y : source.y;\n return this;\n }\n\n toArray() {\n return [this.x, this.y];\n }\n\n transform(m) {\n return this.clone().transformO(m);\n } // Transform point with matrix\n\n\n transformO(m) {\n if (!Matrix.isMatrixLike(m)) {\n m = new Matrix(m);\n }\n\n const {\n x,\n y\n } = this; // Perform the matrix multiplication\n\n this.x = m.a * x + m.c * y + m.e;\n this.y = m.b * x + m.d * y + m.f;\n return this;\n }\n\n}\nfunction point(x, y) {\n return new Point(x, y).transform(this.screenCTM().inverse());\n}\n\nfunction closeEnough(a, b, threshold) {\n return Math.abs(b - a) < (threshold || 1e-6);\n}\n\nclass Matrix {\n constructor(...args) {\n this.init(...args);\n }\n\n static formatTransforms(o) {\n // Get all of the parameters required to form the matrix\n const flipBoth = o.flip === 'both' || o.flip === true;\n const flipX = o.flip && (flipBoth || o.flip === 'x') ? -1 : 1;\n const flipY = o.flip && (flipBoth || o.flip === 'y') ? -1 : 1;\n const skewX = o.skew && o.skew.length ? o.skew[0] : isFinite(o.skew) ? o.skew : isFinite(o.skewX) ? o.skewX : 0;\n const skewY = o.skew && o.skew.length ? o.skew[1] : isFinite(o.skew) ? o.skew : isFinite(o.skewY) ? o.skewY : 0;\n const scaleX = o.scale && o.scale.length ? o.scale[0] * flipX : isFinite(o.scale) ? o.scale * flipX : isFinite(o.scaleX) ? o.scaleX * flipX : flipX;\n const scaleY = o.scale && o.scale.length ? o.scale[1] * flipY : isFinite(o.scale) ? o.scale * flipY : isFinite(o.scaleY) ? o.scaleY * flipY : flipY;\n const shear = o.shear || 0;\n const theta = o.rotate || o.theta || 0;\n const origin = new Point(o.origin || o.around || o.ox || o.originX, o.oy || o.originY);\n const ox = origin.x;\n const oy = origin.y; // We need Point to be invalid if nothing was passed because we cannot default to 0 here. Thats why NaN\n\n const position = new Point(o.position || o.px || o.positionX || NaN, o.py || o.positionY || NaN);\n const px = position.x;\n const py = position.y;\n const translate = new Point(o.translate || o.tx || o.translateX, o.ty || o.translateY);\n const tx = translate.x;\n const ty = translate.y;\n const relative = new Point(o.relative || o.rx || o.relativeX, o.ry || o.relativeY);\n const rx = relative.x;\n const ry = relative.y; // Populate all of the values\n\n return {\n scaleX,\n scaleY,\n skewX,\n skewY,\n shear,\n theta,\n rx,\n ry,\n tx,\n ty,\n ox,\n oy,\n px,\n py\n };\n }\n\n static fromArray(a) {\n return {\n a: a[0],\n b: a[1],\n c: a[2],\n d: a[3],\n e: a[4],\n f: a[5]\n };\n }\n\n static isMatrixLike(o) {\n return o.a != null || o.b != null || o.c != null || o.d != null || o.e != null || o.f != null;\n } // left matrix, right matrix, target matrix which is overwritten\n\n\n static matrixMultiply(l, r, o) {\n // Work out the product directly\n const a = l.a * r.a + l.c * r.b;\n const b = l.b * r.a + l.d * r.b;\n const c = l.a * r.c + l.c * r.d;\n const d = l.b * r.c + l.d * r.d;\n const e = l.e + l.a * r.e + l.c * r.f;\n const f = l.f + l.b * r.e + l.d * r.f; // make sure to use local variables because l/r and o could be the same\n\n o.a = a;\n o.b = b;\n o.c = c;\n o.d = d;\n o.e = e;\n o.f = f;\n return o;\n }\n\n around(cx, cy, matrix) {\n return this.clone().aroundO(cx, cy, matrix);\n } // Transform around a center point\n\n\n aroundO(cx, cy, matrix) {\n const dx = cx || 0;\n const dy = cy || 0;\n return this.translateO(-dx, -dy).lmultiplyO(matrix).translateO(dx, dy);\n } // Clones this matrix\n\n\n clone() {\n return new Matrix(this);\n } // Decomposes this matrix into its affine parameters\n\n\n decompose(cx = 0, cy = 0) {\n // Get the parameters from the matrix\n const a = this.a;\n const b = this.b;\n const c = this.c;\n const d = this.d;\n const e = this.e;\n const f = this.f; // Figure out if the winding direction is clockwise or counterclockwise\n\n const determinant = a * d - b * c;\n const ccw = determinant > 0 ? 1 : -1; // Since we only shear in x, we can use the x basis to get the x scale\n // and the rotation of the resulting matrix\n\n const sx = ccw * Math.sqrt(a * a + b * b);\n const thetaRad = Math.atan2(ccw * b, ccw * a);\n const theta = 180 / Math.PI * thetaRad;\n const ct = Math.cos(thetaRad);\n const st = Math.sin(thetaRad); // We can then solve the y basis vector simultaneously to get the other\n // two affine parameters directly from these parameters\n\n const lam = (a * c + b * d) / determinant;\n const sy = c * sx / (lam * a - b) || d * sx / (lam * b + a); // Use the translations\n\n const tx = e - cx + cx * ct * sx + cy * (lam * ct * sx - st * sy);\n const ty = f - cy + cx * st * sx + cy * (lam * st * sx + ct * sy); // Construct the decomposition and return it\n\n return {\n // Return the affine parameters\n scaleX: sx,\n scaleY: sy,\n shear: lam,\n rotate: theta,\n translateX: tx,\n translateY: ty,\n originX: cx,\n originY: cy,\n // Return the matrix parameters\n a: this.a,\n b: this.b,\n c: this.c,\n d: this.d,\n e: this.e,\n f: this.f\n };\n } // Check if two matrices are equal\n\n\n equals(other) {\n if (other === this) return true;\n const comp = new Matrix(other);\n return closeEnough(this.a, comp.a) && closeEnough(this.b, comp.b) && closeEnough(this.c, comp.c) && closeEnough(this.d, comp.d) && closeEnough(this.e, comp.e) && closeEnough(this.f, comp.f);\n } // Flip matrix on x or y, at a given offset\n\n\n flip(axis, around) {\n return this.clone().flipO(axis, around);\n }\n\n flipO(axis, around) {\n return axis === 'x' ? this.scaleO(-1, 1, around, 0) : axis === 'y' ? this.scaleO(1, -1, 0, around) : this.scaleO(-1, -1, axis, around || axis); // Define an x, y flip point\n } // Initialize\n\n\n init(source) {\n const base = Matrix.fromArray([1, 0, 0, 1, 0, 0]); // ensure source as object\n\n source = source instanceof Element ? source.matrixify() : typeof source === 'string' ? Matrix.fromArray(source.split(delimiter).map(parseFloat)) : Array.isArray(source) ? Matrix.fromArray(source) : typeof source === 'object' && Matrix.isMatrixLike(source) ? source : typeof source === 'object' ? new Matrix().transform(source) : arguments.length === 6 ? Matrix.fromArray([].slice.call(arguments)) : base; // Merge the source matrix with the base matrix\n\n this.a = source.a != null ? source.a : base.a;\n this.b = source.b != null ? source.b : base.b;\n this.c = source.c != null ? source.c : base.c;\n this.d = source.d != null ? source.d : base.d;\n this.e = source.e != null ? source.e : base.e;\n this.f = source.f != null ? source.f : base.f;\n return this;\n }\n\n inverse() {\n return this.clone().inverseO();\n } // Inverses matrix\n\n\n inverseO() {\n // Get the current parameters out of the matrix\n const a = this.a;\n const b = this.b;\n const c = this.c;\n const d = this.d;\n const e = this.e;\n const f = this.f; // Invert the 2x2 matrix in the top left\n\n const det = a * d - b * c;\n if (!det) throw new Error('Cannot invert ' + this); // Calculate the top 2x2 matrix\n\n const na = d / det;\n const nb = -b / det;\n const nc = -c / det;\n const nd = a / det; // Apply the inverted matrix to the top right\n\n const ne = -(na * e + nc * f);\n const nf = -(nb * e + nd * f); // Construct the inverted matrix\n\n this.a = na;\n this.b = nb;\n this.c = nc;\n this.d = nd;\n this.e = ne;\n this.f = nf;\n return this;\n }\n\n lmultiply(matrix) {\n return this.clone().lmultiplyO(matrix);\n }\n\n lmultiplyO(matrix) {\n const r = this;\n const l = matrix instanceof Matrix ? matrix : new Matrix(matrix);\n return Matrix.matrixMultiply(l, r, this);\n } // Left multiplies by the given matrix\n\n\n multiply(matrix) {\n return this.clone().multiplyO(matrix);\n }\n\n multiplyO(matrix) {\n // Get the matrices\n const l = this;\n const r = matrix instanceof Matrix ? matrix : new Matrix(matrix);\n return Matrix.matrixMultiply(l, r, this);\n } // Rotate matrix\n\n\n rotate(r, cx, cy) {\n return this.clone().rotateO(r, cx, cy);\n }\n\n rotateO(r, cx = 0, cy = 0) {\n // Convert degrees to radians\n r = radians(r);\n const cos = Math.cos(r);\n const sin = Math.sin(r);\n const {\n a,\n b,\n c,\n d,\n e,\n f\n } = this;\n this.a = a * cos - b * sin;\n this.b = b * cos + a * sin;\n this.c = c * cos - d * sin;\n this.d = d * cos + c * sin;\n this.e = e * cos - f * sin + cy * sin - cx * cos + cx;\n this.f = f * cos + e * sin - cx * sin - cy * cos + cy;\n return this;\n } // Scale matrix\n\n\n scale(x, y, cx, cy) {\n return this.clone().scaleO(...arguments);\n }\n\n scaleO(x, y = x, cx = 0, cy = 0) {\n // Support uniform scaling\n if (arguments.length === 3) {\n cy = cx;\n cx = y;\n y = x;\n }\n\n const {\n a,\n b,\n c,\n d,\n e,\n f\n } = this;\n this.a = a * x;\n this.b = b * y;\n this.c = c * x;\n this.d = d * y;\n this.e = e * x - cx * x + cx;\n this.f = f * y - cy * y + cy;\n return this;\n } // Shear matrix\n\n\n shear(a, cx, cy) {\n return this.clone().shearO(a, cx, cy);\n }\n\n shearO(lx, cx = 0, cy = 0) {\n const {\n a,\n b,\n c,\n d,\n e,\n f\n } = this;\n this.a = a + b * lx;\n this.c = c + d * lx;\n this.e = e + f * lx - cy * lx;\n return this;\n } // Skew Matrix\n\n\n skew(x, y, cx, cy) {\n return this.clone().skewO(...arguments);\n }\n\n skewO(x, y = x, cx = 0, cy = 0) {\n // support uniformal skew\n if (arguments.length === 3) {\n cy = cx;\n cx = y;\n y = x;\n } // Convert degrees to radians\n\n\n x = radians(x);\n y = radians(y);\n const lx = Math.tan(x);\n const ly = Math.tan(y);\n const {\n a,\n b,\n c,\n d,\n e,\n f\n } = this;\n this.a = a + b * lx;\n this.b = b + a * ly;\n this.c = c + d * lx;\n this.d = d + c * ly;\n this.e = e + f * lx - cy * lx;\n this.f = f + e * ly - cx * ly;\n return this;\n } // SkewX\n\n\n skewX(x, cx, cy) {\n return this.skew(x, 0, cx, cy);\n } // SkewY\n\n\n skewY(y, cx, cy) {\n return this.skew(0, y, cx, cy);\n }\n\n toArray() {\n return [this.a, this.b, this.c, this.d, this.e, this.f];\n } // Convert matrix to string\n\n\n toString() {\n return 'matrix(' + this.a + ',' + this.b + ',' + this.c + ',' + this.d + ',' + this.e + ',' + this.f + ')';\n } // Transform a matrix into another matrix by manipulating the space\n\n\n transform(o) {\n // Check if o is a matrix and then left multiply it directly\n if (Matrix.isMatrixLike(o)) {\n const matrix = new Matrix(o);\n return matrix.multiplyO(this);\n } // Get the proposed transformations and the current transformations\n\n\n const t = Matrix.formatTransforms(o);\n const current = this;\n const {\n x: ox,\n y: oy\n } = new Point(t.ox, t.oy).transform(current); // Construct the resulting matrix\n\n const transformer = new Matrix().translateO(t.rx, t.ry).lmultiplyO(current).translateO(-ox, -oy).scaleO(t.scaleX, t.scaleY).skewO(t.skewX, t.skewY).shearO(t.shear).rotateO(t.theta).translateO(ox, oy); // If we want the origin at a particular place, we force it there\n\n if (isFinite(t.px) || isFinite(t.py)) {\n const origin = new Point(ox, oy).transform(transformer); // TODO: Replace t.px with isFinite(t.px)\n // Doesnt work because t.px is also 0 if it wasnt passed\n\n const dx = isFinite(t.px) ? t.px - origin.x : 0;\n const dy = isFinite(t.py) ? t.py - origin.y : 0;\n transformer.translateO(dx, dy);\n } // Translate now after positioning\n\n\n transformer.translateO(t.tx, t.ty);\n return transformer;\n } // Translate matrix\n\n\n translate(x, y) {\n return this.clone().translateO(x, y);\n }\n\n translateO(x, y) {\n this.e += x || 0;\n this.f += y || 0;\n return this;\n }\n\n valueOf() {\n return {\n a: this.a,\n b: this.b,\n c: this.c,\n d: this.d,\n e: this.e,\n f: this.f\n };\n }\n\n}\nfunction ctm() {\n return new Matrix(this.node.getCTM());\n}\nfunction screenCTM() {\n /* https://bugzilla.mozilla.org/show_bug.cgi?id=1344537\r\n This is needed because FF does not return the transformation matrix\r\n for the inner coordinate system when getScreenCTM() is called on nested svgs.\r\n However all other Browsers do that */\n if (typeof this.isRoot === 'function' && !this.isRoot()) {\n const rect = this.rect(1, 1);\n const m = rect.node.getScreenCTM();\n rect.remove();\n return new Matrix(m);\n }\n\n return new Matrix(this.node.getScreenCTM());\n}\nregister(Matrix, 'Matrix');\n\nfunction parser() {\n // Reuse cached element if possible\n if (!parser.nodes) {\n const svg = makeInstance().size(2, 0);\n svg.node.style.cssText = ['opacity: 0', 'position: absolute', 'left: -100%', 'top: -100%', 'overflow: hidden'].join(';');\n svg.attr('focusable', 'false');\n svg.attr('aria-hidden', 'true');\n const path = svg.path().node;\n parser.nodes = {\n svg,\n path\n };\n }\n\n if (!parser.nodes.svg.node.parentNode) {\n const b = globals.document.body || globals.document.documentElement;\n parser.nodes.svg.addTo(b);\n }\n\n return parser.nodes;\n}\n\nfunction isNulledBox(box) {\n return !box.width && !box.height && !box.x && !box.y;\n}\nfunction domContains(node) {\n return node === globals.document || (globals.document.documentElement.contains || function (node) {\n // This is IE - it does not support contains() for top-level SVGs\n while (node.parentNode) {\n node = node.parentNode;\n }\n\n return node === globals.document;\n }).call(globals.document.documentElement, node);\n}\nclass Box {\n constructor(...args) {\n this.init(...args);\n }\n\n addOffset() {\n // offset by window scroll position, because getBoundingClientRect changes when window is scrolled\n this.x += globals.window.pageXOffset;\n this.y += globals.window.pageYOffset;\n return new Box(this);\n }\n\n init(source) {\n const base = [0, 0, 0, 0];\n source = typeof source === 'string' ? source.split(delimiter).map(parseFloat) : Array.isArray(source) ? source : typeof source === 'object' ? [source.left != null ? source.left : source.x, source.top != null ? source.top : source.y, source.width, source.height] : arguments.length === 4 ? [].slice.call(arguments) : base;\n this.x = source[0] || 0;\n this.y = source[1] || 0;\n this.width = this.w = source[2] || 0;\n this.height = this.h = source[3] || 0; // Add more bounding box properties\n\n this.x2 = this.x + this.w;\n this.y2 = this.y + this.h;\n this.cx = this.x + this.w / 2;\n this.cy = this.y + this.h / 2;\n return this;\n }\n\n isNulled() {\n return isNulledBox(this);\n } // Merge rect box with another, return a new instance\n\n\n merge(box) {\n const x = Math.min(this.x, box.x);\n const y = Math.min(this.y, box.y);\n const width = Math.max(this.x + this.width, box.x + box.width) - x;\n const height = Math.max(this.y + this.height, box.y + box.height) - y;\n return new Box(x, y, width, height);\n }\n\n toArray() {\n return [this.x, this.y, this.width, this.height];\n }\n\n toString() {\n return this.x + ' ' + this.y + ' ' + this.width + ' ' + this.height;\n }\n\n transform(m) {\n if (!(m instanceof Matrix)) {\n m = new Matrix(m);\n }\n\n let xMin = Infinity;\n let xMax = -Infinity;\n let yMin = Infinity;\n let yMax = -Infinity;\n const pts = [new Point(this.x, this.y), new Point(this.x2, this.y), new Point(this.x, this.y2), new Point(this.x2, this.y2)];\n pts.forEach(function (p) {\n p = p.transform(m);\n xMin = Math.min(xMin, p.x);\n xMax = Math.max(xMax, p.x);\n yMin = Math.min(yMin, p.y);\n yMax = Math.max(yMax, p.y);\n });\n return new Box(xMin, yMin, xMax - xMin, yMax - yMin);\n }\n\n}\n\nfunction getBox(el, getBBoxFn, retry) {\n let box;\n\n try {\n // Try to get the box with the provided function\n box = getBBoxFn(el.node); // If the box is worthless and not even in the dom, retry\n // by throwing an error here...\n\n if (isNulledBox(box) && !domContains(el.node)) {\n throw new Error('Element not in the dom');\n }\n } catch (e) {\n // ... and calling the retry handler here\n box = retry(el);\n }\n\n return box;\n}\n\nfunction bbox() {\n // Function to get bbox is getBBox()\n const getBBox = node => node.getBBox(); // Take all measures so that a stupid browser renders the element\n // so we can get the bbox from it when we try again\n\n\n const retry = el => {\n try {\n const clone = el.clone().addTo(parser().svg).show();\n const box = clone.node.getBBox();\n clone.remove();\n return box;\n } catch (e) {\n // We give up...\n throw new Error(`Getting bbox of element \"${el.node.nodeName}\" is not possible: ${e.toString()}`);\n }\n };\n\n const box = getBox(this, getBBox, retry);\n const bbox = new Box(box);\n return bbox;\n}\nfunction rbox(el) {\n const getRBox = node => node.getBoundingClientRect();\n\n const retry = el => {\n // There is no point in trying tricks here because if we insert the element into the dom ourselves\n // it obviously will be at the wrong position\n throw new Error(`Getting rbox of element \"${el.node.nodeName}\" is not possible`);\n };\n\n const box = getBox(this, getRBox, retry);\n const rbox = new Box(box); // If an element was passed, we want the bbox in the coordinate system of that element\n\n if (el) {\n return rbox.transform(el.screenCTM().inverseO());\n } // Else we want it in absolute screen coordinates\n // Therefore we need to add the scrollOffset\n\n\n return rbox.addOffset();\n} // Checks whether the given point is inside the bounding box\n\nfunction inside(x, y) {\n const box = this.bbox();\n return x > box.x && y > box.y && x < box.x + box.width && y < box.y + box.height;\n}\nregisterMethods({\n viewbox: {\n viewbox(x, y, width, height) {\n // act as getter\n if (x == null) return new Box(this.attr('viewBox')); // act as setter\n\n return this.attr('viewBox', new Box(x, y, width, height));\n },\n\n zoom(level, point) {\n // Its best to rely on the attributes here and here is why:\n // clientXYZ: Doesn't work on non-root svgs because they dont have a CSSBox (silly!)\n // getBoundingClientRect: Doesn't work because Chrome just ignores width and height of nested svgs completely\n // that means, their clientRect is always as big as the content.\n // Furthermore this size is incorrect if the element is further transformed by its parents\n // computedStyle: Only returns meaningful values if css was used with px. We dont go this route here!\n // getBBox: returns the bounding box of its content - that doesnt help!\n let {\n width,\n height\n } = this.attr(['width', 'height']); // Width and height is a string when a number with a unit is present which we can't use\n // So we try clientXYZ\n\n if (!width && !height || typeof width === 'string' || typeof height === 'string') {\n width = this.node.clientWidth;\n height = this.node.clientHeight;\n } // Giving up...\n\n\n if (!width || !height) {\n throw new Error('Impossible to get absolute width and height. Please provide an absolute width and height attribute on the zooming element');\n }\n\n const v = this.viewbox();\n const zoomX = width / v.width;\n const zoomY = height / v.height;\n const zoom = Math.min(zoomX, zoomY);\n\n if (level == null) {\n return zoom;\n }\n\n let zoomAmount = zoom / level; // Set the zoomAmount to the highest value which is safe to process and recover from\n // The * 100 is a bit of wiggle room for the matrix transformation\n\n if (zoomAmount === Infinity) zoomAmount = Number.MAX_SAFE_INTEGER / 100;\n point = point || new Point(width / 2 / zoomX + v.x, height / 2 / zoomY + v.y);\n const box = new Box(v).transform(new Matrix({\n scale: zoomAmount,\n origin: point\n }));\n return this.viewbox(box);\n }\n\n }\n});\nregister(Box, 'Box');\n\nclass List extends Array {\n constructor(arr = [], ...args) {\n super(arr, ...args);\n if (typeof arr === 'number') return this;\n this.length = 0;\n this.push(...arr);\n }\n\n}\nextend([List], {\n each(fnOrMethodName, ...args) {\n if (typeof fnOrMethodName === 'function') {\n return this.map((el, i, arr) => {\n return fnOrMethodName.call(el, el, i, arr);\n });\n } else {\n return this.map(el => {\n return el[fnOrMethodName](...args);\n });\n }\n },\n\n toArray() {\n return Array.prototype.concat.apply([], this);\n }\n\n});\nconst reserved = ['toArray', 'constructor', 'each'];\n\nList.extend = function (methods) {\n methods = methods.reduce((obj, name) => {\n // Don't overwrite own methods\n if (reserved.includes(name)) return obj; // Don't add private methods\n\n if (name[0] === '_') return obj; // Relay every call to each()\n\n obj[name] = function (...attrs) {\n return this.each(name, ...attrs);\n };\n\n return obj;\n }, {});\n extend([List], methods);\n};\n\nfunction baseFind(query, parent) {\n return new List(map((parent || globals.document).querySelectorAll(query), function (node) {\n return adopt(node);\n }));\n} // Scoped find method\n\nfunction find(query) {\n return baseFind(query, this.node);\n}\nfunction findOne(query) {\n return adopt(this.node.querySelector(query));\n}\n\nlet listenerId = 0;\nconst windowEvents = {};\nfunction getEvents(instance) {\n let n = instance.getEventHolder(); // We dont want to save events in global space\n\n if (n === globals.window) n = windowEvents;\n if (!n.events) n.events = {};\n return n.events;\n}\nfunction getEventTarget(instance) {\n return instance.getEventTarget();\n}\nfunction clearEvents(instance) {\n let n = instance.getEventHolder();\n if (n === globals.window) n = windowEvents;\n if (n.events) n.events = {};\n} // Add event binder in the SVG namespace\n\nfunction on(node, events, listener, binding, options) {\n const l = listener.bind(binding || node);\n const instance = makeInstance(node);\n const bag = getEvents(instance);\n const n = getEventTarget(instance); // events can be an array of events or a string of events\n\n events = Array.isArray(events) ? events : events.split(delimiter); // add id to listener\n\n if (!listener._svgjsListenerId) {\n listener._svgjsListenerId = ++listenerId;\n }\n\n events.forEach(function (event) {\n const ev = event.split('.')[0];\n const ns = event.split('.')[1] || '*'; // ensure valid object\n\n bag[ev] = bag[ev] || {};\n bag[ev][ns] = bag[ev][ns] || {}; // reference listener\n\n bag[ev][ns][listener._svgjsListenerId] = l; // add listener\n\n n.addEventListener(ev, l, options || false);\n });\n} // Add event unbinder in the SVG namespace\n\nfunction off(node, events, listener, options) {\n const instance = makeInstance(node);\n const bag = getEvents(instance);\n const n = getEventTarget(instance); // listener can be a function or a number\n\n if (typeof listener === 'function') {\n listener = listener._svgjsListenerId;\n if (!listener) return;\n } // events can be an array of events or a string or undefined\n\n\n events = Array.isArray(events) ? events : (events || '').split(delimiter);\n events.forEach(function (event) {\n const ev = event && event.split('.')[0];\n const ns = event && event.split('.')[1];\n let namespace, l;\n\n if (listener) {\n // remove listener reference\n if (bag[ev] && bag[ev][ns || '*']) {\n // removeListener\n n.removeEventListener(ev, bag[ev][ns || '*'][listener], options || false);\n delete bag[ev][ns || '*'][listener];\n }\n } else if (ev && ns) {\n // remove all listeners for a namespaced event\n if (bag[ev] && bag[ev][ns]) {\n for (l in bag[ev][ns]) {\n off(n, [ev, ns].join('.'), l);\n }\n\n delete bag[ev][ns];\n }\n } else if (ns) {\n // remove all listeners for a specific namespace\n for (event in bag) {\n for (namespace in bag[event]) {\n if (ns === namespace) {\n off(n, [event, ns].join('.'));\n }\n }\n }\n } else if (ev) {\n // remove all listeners for the event\n if (bag[ev]) {\n for (namespace in bag[ev]) {\n off(n, [ev, namespace].join('.'));\n }\n\n delete bag[ev];\n }\n } else {\n // remove all listeners on a given node\n for (event in bag) {\n off(n, event);\n }\n\n clearEvents(instance);\n }\n });\n}\nfunction dispatch(node, event, data, options) {\n const n = getEventTarget(node); // Dispatch event\n\n if (event instanceof globals.window.Event) {\n n.dispatchEvent(event);\n } else {\n event = new globals.window.CustomEvent(event, {\n detail: data,\n cancelable: true,\n ...options\n });\n n.dispatchEvent(event);\n }\n\n return event;\n}\n\nclass EventTarget extends Base {\n addEventListener() {}\n\n dispatch(event, data, options) {\n return dispatch(this, event, data, options);\n }\n\n dispatchEvent(event) {\n const bag = this.getEventHolder().events;\n if (!bag) return true;\n const events = bag[event.type];\n\n for (const i in events) {\n for (const j in events[i]) {\n events[i][j](event);\n }\n }\n\n return !event.defaultPrevented;\n } // Fire given event\n\n\n fire(event, data, options) {\n this.dispatch(event, data, options);\n return this;\n }\n\n getEventHolder() {\n return this;\n }\n\n getEventTarget() {\n return this;\n } // Unbind event from listener\n\n\n off(event, listener) {\n off(this, event, listener);\n return this;\n } // Bind given event to listener\n\n\n on(event, listener, binding, options) {\n on(this, event, listener, binding, options);\n return this;\n }\n\n removeEventListener() {}\n\n}\nregister(EventTarget, 'EventTarget');\n\nfunction noop() {} // Default animation values\n\nconst timeline = {\n duration: 400,\n ease: '>',\n delay: 0\n}; // Default attribute values\n\nconst attrs = {\n // fill and stroke\n 'fill-opacity': 1,\n 'stroke-opacity': 1,\n 'stroke-width': 0,\n 'stroke-linejoin': 'miter',\n 'stroke-linecap': 'butt',\n fill: '#000000',\n stroke: '#000000',\n opacity: 1,\n // position\n x: 0,\n y: 0,\n cx: 0,\n cy: 0,\n // size\n width: 0,\n height: 0,\n // radius\n r: 0,\n rx: 0,\n ry: 0,\n // gradient\n offset: 0,\n 'stop-opacity': 1,\n 'stop-color': '#000000',\n // text\n 'text-anchor': 'start'\n};\n\nvar defaults = {\n __proto__: null,\n noop: noop,\n timeline: timeline,\n attrs: attrs\n};\n\nclass SVGArray extends Array {\n constructor(...args) {\n super(...args);\n this.init(...args);\n }\n\n clone() {\n return new this.constructor(this);\n }\n\n init(arr) {\n // This catches the case, that native map tries to create an array with new Array(1)\n if (typeof arr === 'number') return this;\n this.length = 0;\n this.push(...this.parse(arr));\n return this;\n } // Parse whitespace separated string\n\n\n parse(array = []) {\n // If already is an array, no need to parse it\n if (array instanceof Array) return array;\n return array.trim().split(delimiter).map(parseFloat);\n }\n\n toArray() {\n return Array.prototype.concat.apply([], this);\n }\n\n toSet() {\n return new Set(this);\n }\n\n toString() {\n return this.join(' ');\n } // Flattens the array if needed\n\n\n valueOf() {\n const ret = [];\n ret.push(...this);\n return ret;\n }\n\n}\n\nclass SVGNumber {\n // Initialize\n constructor(...args) {\n this.init(...args);\n }\n\n convert(unit) {\n return new SVGNumber(this.value, unit);\n } // Divide number\n\n\n divide(number) {\n number = new SVGNumber(number);\n return new SVGNumber(this / number, this.unit || number.unit);\n }\n\n init(value, unit) {\n unit = Array.isArray(value) ? value[1] : unit;\n value = Array.isArray(value) ? value[0] : value; // initialize defaults\n\n this.value = 0;\n this.unit = unit || ''; // parse value\n\n if (typeof value === 'number') {\n // ensure a valid numeric value\n this.value = isNaN(value) ? 0 : !isFinite(value) ? value < 0 ? -3.4e+38 : +3.4e+38 : value;\n } else if (typeof value === 'string') {\n unit = value.match(numberAndUnit);\n\n if (unit) {\n // make value numeric\n this.value = parseFloat(unit[1]); // normalize\n\n if (unit[5] === '%') {\n this.value /= 100;\n } else if (unit[5] === 's') {\n this.value *= 1000;\n } // store unit\n\n\n this.unit = unit[5];\n }\n } else {\n if (value instanceof SVGNumber) {\n this.value = value.valueOf();\n this.unit = value.unit;\n }\n }\n\n return this;\n } // Subtract number\n\n\n minus(number) {\n number = new SVGNumber(number);\n return new SVGNumber(this - number, this.unit || number.unit);\n } // Add number\n\n\n plus(number) {\n number = new SVGNumber(number);\n return new SVGNumber(this + number, this.unit || number.unit);\n } // Multiply number\n\n\n times(number) {\n number = new SVGNumber(number);\n return new SVGNumber(this * number, this.unit || number.unit);\n }\n\n toArray() {\n return [this.value, this.unit];\n }\n\n toJSON() {\n return this.toString();\n }\n\n toString() {\n return (this.unit === '%' ? ~~(this.value * 1e8) / 1e6 : this.unit === 's' ? this.value / 1e3 : this.value) + this.unit;\n }\n\n valueOf() {\n return this.value;\n }\n\n}\n\nconst hooks = [];\nfunction registerAttrHook(fn) {\n hooks.push(fn);\n} // Set svg element attribute\n\nfunction attr(attr, val, ns) {\n // act as full getter\n if (attr == null) {\n // get an object of attributes\n attr = {};\n val = this.node.attributes;\n\n for (const node of val) {\n attr[node.nodeName] = isNumber.test(node.nodeValue) ? parseFloat(node.nodeValue) : node.nodeValue;\n }\n\n return attr;\n } else if (attr instanceof Array) {\n // loop through array and get all values\n return attr.reduce((last, curr) => {\n last[curr] = this.attr(curr);\n return last;\n }, {});\n } else if (typeof attr === 'object' && attr.constructor === Object) {\n // apply every attribute individually if an object is passed\n for (val in attr) this.attr(val, attr[val]);\n } else if (val === null) {\n // remove value\n this.node.removeAttribute(attr);\n } else if (val == null) {\n // act as a getter if the first and only argument is not an object\n val = this.node.getAttribute(attr);\n return val == null ? attrs[attr] : isNumber.test(val) ? parseFloat(val) : val;\n } else {\n // Loop through hooks and execute them to convert value\n val = hooks.reduce((_val, hook) => {\n return hook(attr, _val, this);\n }, val); // ensure correct numeric values (also accepts NaN and Infinity)\n\n if (typeof val === 'number') {\n val = new SVGNumber(val);\n } else if (Color.isColor(val)) {\n // ensure full hex color\n val = new Color(val);\n } else if (val.constructor === Array) {\n // Check for plain arrays and parse array values\n val = new SVGArray(val);\n } // if the passed attribute is leading...\n\n\n if (attr === 'leading') {\n // ... call the leading method instead\n if (this.leading) {\n this.leading(val);\n }\n } else {\n // set given attribute on node\n typeof ns === 'string' ? this.node.setAttributeNS(ns, attr, val.toString()) : this.node.setAttribute(attr, val.toString());\n } // rebuild if required\n\n\n if (this.rebuild && (attr === 'font-size' || attr === 'x')) {\n this.rebuild();\n }\n }\n\n return this;\n}\n\nclass Dom extends EventTarget {\n constructor(node, attrs) {\n super();\n this.node = node;\n this.type = node.nodeName;\n\n if (attrs && node !== attrs) {\n this.attr(attrs);\n }\n } // Add given element at a position\n\n\n add(element, i) {\n element = makeInstance(element); // If non-root svg nodes are added we have to remove their namespaces\n\n if (element.removeNamespace && this.node instanceof globals.window.SVGElement) {\n element.removeNamespace();\n }\n\n if (i == null) {\n this.node.appendChild(element.node);\n } else if (element.node !== this.node.childNodes[i]) {\n this.node.insertBefore(element.node, this.node.childNodes[i]);\n }\n\n return this;\n } // Add element to given container and return self\n\n\n addTo(parent, i) {\n return makeInstance(parent).put(this, i);\n } // Returns all child elements\n\n\n children() {\n return new List(map(this.node.children, function (node) {\n return adopt(node);\n }));\n } // Remove all elements in this container\n\n\n clear() {\n // remove children\n while (this.node.hasChildNodes()) {\n this.node.removeChild(this.node.lastChild);\n }\n\n return this;\n } // Clone element\n\n\n clone(deep = true) {\n // write dom data to the dom so the clone can pickup the data\n this.writeDataToDom(); // clone element and assign new id\n\n return new this.constructor(assignNewId(this.node.cloneNode(deep)));\n } // Iterates over all children and invokes a given block\n\n\n each(block, deep) {\n const children = this.children();\n let i, il;\n\n for (i = 0, il = children.length; i < il; i++) {\n block.apply(children[i], [i, children]);\n\n if (deep) {\n children[i].each(block, deep);\n }\n }\n\n return this;\n }\n\n element(nodeName, attrs) {\n return this.put(new Dom(create(nodeName), attrs));\n } // Get first child\n\n\n first() {\n return adopt(this.node.firstChild);\n } // Get a element at the given index\n\n\n get(i) {\n return adopt(this.node.childNodes[i]);\n }\n\n getEventHolder() {\n return this.node;\n }\n\n getEventTarget() {\n return this.node;\n } // Checks if the given element is a child\n\n\n has(element) {\n return this.index(element) >= 0;\n }\n\n html(htmlOrFn, outerHTML) {\n return this.xml(htmlOrFn, outerHTML, html);\n } // Get / set id\n\n\n id(id) {\n // generate new id if no id set\n if (typeof id === 'undefined' && !this.node.id) {\n this.node.id = eid(this.type);\n } // don't set directly with this.node.id to make `null` work correctly\n\n\n return this.attr('id', id);\n } // Gets index of given element\n\n\n index(element) {\n return [].slice.call(this.node.childNodes).indexOf(element.node);\n } // Get the last child\n\n\n last() {\n return adopt(this.node.lastChild);\n } // matches the element vs a css selector\n\n\n matches(selector) {\n const el = this.node;\n const matcher = el.matches || el.matchesSelector || el.msMatchesSelector || el.mozMatchesSelector || el.webkitMatchesSelector || el.oMatchesSelector || null;\n return matcher && matcher.call(el, selector);\n } // Returns the parent element instance\n\n\n parent(type) {\n let parent = this; // check for parent\n\n if (!parent.node.parentNode) return null; // get parent element\n\n parent = adopt(parent.node.parentNode);\n if (!type) return parent; // loop trough ancestors if type is given\n\n do {\n if (typeof type === 'string' ? parent.matches(type) : parent instanceof type) return parent;\n } while (parent = adopt(parent.node.parentNode));\n\n return parent;\n } // Basically does the same as `add()` but returns the added element instead\n\n\n put(element, i) {\n element = makeInstance(element);\n this.add(element, i);\n return element;\n } // Add element to given container and return container\n\n\n putIn(parent, i) {\n return makeInstance(parent).add(this, i);\n } // Remove element\n\n\n remove() {\n if (this.parent()) {\n this.parent().removeElement(this);\n }\n\n return this;\n } // Remove a given child\n\n\n removeElement(element) {\n this.node.removeChild(element.node);\n return this;\n } // Replace this with element\n\n\n replace(element) {\n element = makeInstance(element);\n\n if (this.node.parentNode) {\n this.node.parentNode.replaceChild(element.node, this.node);\n }\n\n return element;\n }\n\n round(precision = 2, map = null) {\n const factor = 10 ** precision;\n const attrs = this.attr(map);\n\n for (const i in attrs) {\n if (typeof attrs[i] === 'number') {\n attrs[i] = Math.round(attrs[i] * factor) / factor;\n }\n }\n\n this.attr(attrs);\n return this;\n } // Import / Export raw svg\n\n\n svg(svgOrFn, outerSVG) {\n return this.xml(svgOrFn, outerSVG, svg);\n } // Return id on string conversion\n\n\n toString() {\n return this.id();\n }\n\n words(text) {\n // This is faster than removing all children and adding a new one\n this.node.textContent = text;\n return this;\n }\n\n wrap(node) {\n const parent = this.parent();\n\n if (!parent) {\n return this.addTo(node);\n }\n\n const position = parent.index(this);\n return parent.put(node, position).put(this);\n } // write svgjs data to the dom\n\n\n writeDataToDom() {\n // dump variables recursively\n this.each(function () {\n this.writeDataToDom();\n });\n return this;\n } // Import / Export raw svg\n\n\n xml(xmlOrFn, outerXML, ns) {\n if (typeof xmlOrFn === 'boolean') {\n ns = outerXML;\n outerXML = xmlOrFn;\n xmlOrFn = null;\n } // act as getter if no svg string is given\n\n\n if (xmlOrFn == null || typeof xmlOrFn === 'function') {\n // The default for exports is, that the outerNode is included\n outerXML = outerXML == null ? true : outerXML; // write svgjs data to the dom\n\n this.writeDataToDom();\n let current = this; // An export modifier was passed\n\n if (xmlOrFn != null) {\n current = adopt(current.node.cloneNode(true)); // If the user wants outerHTML we need to process this node, too\n\n if (outerXML) {\n const result = xmlOrFn(current);\n current = result || current; // The user does not want this node? Well, then he gets nothing\n\n if (result === false) return '';\n } // Deep loop through all children and apply modifier\n\n\n current.each(function () {\n const result = xmlOrFn(this);\n\n const _this = result || this; // If modifier returns false, discard node\n\n\n if (result === false) {\n this.remove(); // If modifier returns new node, use it\n } else if (result && this !== _this) {\n this.replace(_this);\n }\n }, true);\n } // Return outer or inner content\n\n\n return outerXML ? current.node.outerHTML : current.node.innerHTML;\n } // Act as setter if we got a string\n // The default for import is, that the current node is not replaced\n\n\n outerXML = outerXML == null ? false : outerXML; // Create temporary holder\n\n const well = create('wrapper', ns);\n const fragment = globals.document.createDocumentFragment(); // Dump raw svg\n\n well.innerHTML = xmlOrFn; // Transplant nodes into the fragment\n\n for (let len = well.children.length; len--;) {\n fragment.appendChild(well.firstElementChild);\n }\n\n const parent = this.parent(); // Add the whole fragment at once\n\n return outerXML ? this.replace(fragment) && parent : this.add(fragment);\n }\n\n}\nextend(Dom, {\n attr,\n find,\n findOne\n});\nregister(Dom, 'Dom');\n\nclass Element extends Dom {\n constructor(node, attrs) {\n super(node, attrs); // initialize data object\n\n this.dom = {}; // create circular reference\n\n this.node.instance = this;\n\n if (node.hasAttribute('svgjs:data')) {\n // pull svgjs data from the dom (getAttributeNS doesn't work in html5)\n this.setData(JSON.parse(node.getAttribute('svgjs:data')) || {});\n }\n } // Move element by its center\n\n\n center(x, y) {\n return this.cx(x).cy(y);\n } // Move by center over x-axis\n\n\n cx(x) {\n return x == null ? this.x() + this.width() / 2 : this.x(x - this.width() / 2);\n } // Move by center over y-axis\n\n\n cy(y) {\n return y == null ? this.y() + this.height() / 2 : this.y(y - this.height() / 2);\n } // Get defs\n\n\n defs() {\n const root = this.root();\n return root && root.defs();\n } // Relative move over x and y axes\n\n\n dmove(x, y) {\n return this.dx(x).dy(y);\n } // Relative move over x axis\n\n\n dx(x = 0) {\n return this.x(new SVGNumber(x).plus(this.x()));\n } // Relative move over y axis\n\n\n dy(y = 0) {\n return this.y(new SVGNumber(y).plus(this.y()));\n }\n\n getEventHolder() {\n return this;\n } // Set height of element\n\n\n height(height) {\n return this.attr('height', height);\n } // Move element to given x and y values\n\n\n move(x, y) {\n return this.x(x).y(y);\n } // return array of all ancestors of given type up to the root svg\n\n\n parents(until = this.root()) {\n until = makeInstance(until);\n const parents = new List();\n let parent = this;\n\n while ((parent = parent.parent()) && parent.node !== globals.document && parent.nodeName !== '#document-fragment') {\n parents.push(parent);\n\n if (parent.node === until.node) {\n break;\n }\n }\n\n return parents;\n } // Get referenced element form attribute value\n\n\n reference(attr) {\n attr = this.attr(attr);\n if (!attr) return null;\n const m = (attr + '').match(reference);\n return m ? makeInstance(m[1]) : null;\n } // Get parent document\n\n\n root() {\n const p = this.parent(getClass(root));\n return p && p.root();\n } // set given data to the elements data property\n\n\n setData(o) {\n this.dom = o;\n return this;\n } // Set element size to given width and height\n\n\n size(width, height) {\n const p = proportionalSize(this, width, height);\n return this.width(new SVGNumber(p.width)).height(new SVGNumber(p.height));\n } // Set width of element\n\n\n width(width) {\n return this.attr('width', width);\n } // write svgjs data to the dom\n\n\n writeDataToDom() {\n // remove previously set data\n this.node.removeAttribute('svgjs:data');\n\n if (Object.keys(this.dom).length) {\n this.node.setAttribute('svgjs:data', JSON.stringify(this.dom)); // see #428\n }\n\n return super.writeDataToDom();\n } // Move over x-axis\n\n\n x(x) {\n return this.attr('x', x);\n } // Move over y-axis\n\n\n y(y) {\n return this.attr('y', y);\n }\n\n}\nextend(Element, {\n bbox,\n rbox,\n inside,\n point,\n ctm,\n screenCTM\n});\nregister(Element, 'Element');\n\nconst sugar = {\n stroke: ['color', 'width', 'opacity', 'linecap', 'linejoin', 'miterlimit', 'dasharray', 'dashoffset'],\n fill: ['color', 'opacity', 'rule'],\n prefix: function (t, a) {\n return a === 'color' ? t : t + '-' + a;\n }\n} // Add sugar for fill and stroke\n;\n['fill', 'stroke'].forEach(function (m) {\n const extension = {};\n let i;\n\n extension[m] = function (o) {\n if (typeof o === 'undefined') {\n return this.attr(m);\n }\n\n if (typeof o === 'string' || o instanceof Color || Color.isRgb(o) || o instanceof Element) {\n this.attr(m, o);\n } else {\n // set all attributes from sugar.fill and sugar.stroke list\n for (i = sugar[m].length - 1; i >= 0; i--) {\n if (o[sugar[m][i]] != null) {\n this.attr(sugar.prefix(m, sugar[m][i]), o[sugar[m][i]]);\n }\n }\n }\n\n return this;\n };\n\n registerMethods(['Element', 'Runner'], extension);\n});\nregisterMethods(['Element', 'Runner'], {\n // Let the user set the matrix directly\n matrix: function (mat, b, c, d, e, f) {\n // Act as a getter\n if (mat == null) {\n return new Matrix(this);\n } // Act as a setter, the user can pass a matrix or a set of numbers\n\n\n return this.attr('transform', new Matrix(mat, b, c, d, e, f));\n },\n // Map rotation to transform\n rotate: function (angle, cx, cy) {\n return this.transform({\n rotate: angle,\n ox: cx,\n oy: cy\n }, true);\n },\n // Map skew to transform\n skew: function (x, y, cx, cy) {\n return arguments.length === 1 || arguments.length === 3 ? this.transform({\n skew: x,\n ox: y,\n oy: cx\n }, true) : this.transform({\n skew: [x, y],\n ox: cx,\n oy: cy\n }, true);\n },\n shear: function (lam, cx, cy) {\n return this.transform({\n shear: lam,\n ox: cx,\n oy: cy\n }, true);\n },\n // Map scale to transform\n scale: function (x, y, cx, cy) {\n return arguments.length === 1 || arguments.length === 3 ? this.transform({\n scale: x,\n ox: y,\n oy: cx\n }, true) : this.transform({\n scale: [x, y],\n ox: cx,\n oy: cy\n }, true);\n },\n // Map translate to transform\n translate: function (x, y) {\n return this.transform({\n translate: [x, y]\n }, true);\n },\n // Map relative translations to transform\n relative: function (x, y) {\n return this.transform({\n relative: [x, y]\n }, true);\n },\n // Map flip to transform\n flip: function (direction = 'both', origin = 'center') {\n if ('xybothtrue'.indexOf(direction) === -1) {\n origin = direction;\n direction = 'both';\n }\n\n return this.transform({\n flip: direction,\n origin: origin\n }, true);\n },\n // Opacity\n opacity: function (value) {\n return this.attr('opacity', value);\n }\n});\nregisterMethods('radius', {\n // Add x and y radius\n radius: function (x, y = x) {\n const type = (this._element || this).type;\n return type === 'radialGradient' ? this.attr('r', new SVGNumber(x)) : this.rx(x).ry(y);\n }\n});\nregisterMethods('Path', {\n // Get path length\n length: function () {\n return this.node.getTotalLength();\n },\n // Get point at length\n pointAt: function (length) {\n return new Point(this.node.getPointAtLength(length));\n }\n});\nregisterMethods(['Element', 'Runner'], {\n // Set font\n font: function (a, v) {\n if (typeof a === 'object') {\n for (v in a) this.font(v, a[v]);\n\n return this;\n }\n\n return a === 'leading' ? this.leading(v) : a === 'anchor' ? this.attr('text-anchor', v) : a === 'size' || a === 'family' || a === 'weight' || a === 'stretch' || a === 'variant' || a === 'style' ? this.attr('font-' + a, v) : this.attr(a, v);\n }\n}); // Add events to elements\n\nconst methods = ['click', 'dblclick', 'mousedown', 'mouseup', 'mouseover', 'mouseout', 'mousemove', 'mouseenter', 'mouseleave', 'touchstart', 'touchmove', 'touchleave', 'touchend', 'touchcancel'].reduce(function (last, event) {\n // add event to Element\n const fn = function (f) {\n if (f === null) {\n this.off(event);\n } else {\n this.on(event, f);\n }\n\n return this;\n };\n\n last[event] = fn;\n return last;\n}, {});\nregisterMethods('Element', methods);\n\nfunction untransform() {\n return this.attr('transform', null);\n} // merge the whole transformation chain into one matrix and returns it\n\nfunction matrixify() {\n const matrix = (this.attr('transform') || ''). // split transformations\n split(transforms).slice(0, -1).map(function (str) {\n // generate key => value pairs\n const kv = str.trim().split('(');\n return [kv[0], kv[1].split(delimiter).map(function (str) {\n return parseFloat(str);\n })];\n }).reverse() // merge every transformation into one matrix\n .reduce(function (matrix, transform) {\n if (transform[0] === 'matrix') {\n return matrix.lmultiply(Matrix.fromArray(transform[1]));\n }\n\n return matrix[transform[0]].apply(matrix, transform[1]);\n }, new Matrix());\n return matrix;\n} // add an element to another parent without changing the visual representation on the screen\n\nfunction toParent(parent, i) {\n if (this === parent) return this;\n const ctm = this.screenCTM();\n const pCtm = parent.screenCTM().inverse();\n this.addTo(parent, i).untransform().transform(pCtm.multiply(ctm));\n return this;\n} // same as above with parent equals root-svg\n\nfunction toRoot(i) {\n return this.toParent(this.root(), i);\n} // Add transformations\n\nfunction transform(o, relative) {\n // Act as a getter if no object was passed\n if (o == null || typeof o === 'string') {\n const decomposed = new Matrix(this).decompose();\n return o == null ? decomposed : decomposed[o];\n }\n\n if (!Matrix.isMatrixLike(o)) {\n // Set the origin according to the defined transform\n o = { ...o,\n origin: getOrigin(o, this)\n };\n } // The user can pass a boolean, an Element or an Matrix or nothing\n\n\n const cleanRelative = relative === true ? this : relative || false;\n const result = new Matrix(cleanRelative).transform(o);\n return this.attr('transform', result);\n}\nregisterMethods('Element', {\n untransform,\n matrixify,\n toParent,\n toRoot,\n transform\n});\n\nclass Container extends Element {\n flatten(parent = this, index) {\n this.each(function () {\n if (this instanceof Container) {\n return this.flatten().ungroup();\n }\n });\n return this;\n }\n\n ungroup(parent = this.parent(), index = parent.index(this)) {\n // when parent != this, we want append all elements to the end\n index = index === -1 ? parent.children().length : index;\n this.each(function (i, children) {\n // reverse each\n return children[children.length - i - 1].toParent(parent, index);\n });\n return this.remove();\n }\n\n}\nregister(Container, 'Container');\n\nclass Defs extends Container {\n constructor(node, attrs = node) {\n super(nodeOrNew('defs', node), attrs);\n }\n\n flatten() {\n return this;\n }\n\n ungroup() {\n return this;\n }\n\n}\nregister(Defs, 'Defs');\n\nclass Shape extends Element {}\nregister(Shape, 'Shape');\n\nfunction rx(rx) {\n return this.attr('rx', rx);\n} // Radius y value\n\nfunction ry(ry) {\n return this.attr('ry', ry);\n} // Move over x-axis\n\nfunction x$3(x) {\n return x == null ? this.cx() - this.rx() : this.cx(x + this.rx());\n} // Move over y-axis\n\nfunction y$3(y) {\n return y == null ? this.cy() - this.ry() : this.cy(y + this.ry());\n} // Move by center over x-axis\n\nfunction cx$1(x) {\n return this.attr('cx', x);\n} // Move by center over y-axis\n\nfunction cy$1(y) {\n return this.attr('cy', y);\n} // Set width of element\n\nfunction width$2(width) {\n return width == null ? this.rx() * 2 : this.rx(new SVGNumber(width).divide(2));\n} // Set height of element\n\nfunction height$2(height) {\n return height == null ? this.ry() * 2 : this.ry(new SVGNumber(height).divide(2));\n}\n\nvar circled = {\n __proto__: null,\n rx: rx,\n ry: ry,\n x: x$3,\n y: y$3,\n cx: cx$1,\n cy: cy$1,\n width: width$2,\n height: height$2\n};\n\nclass Ellipse extends Shape {\n constructor(node, attrs = node) {\n super(nodeOrNew('ellipse', node), attrs);\n }\n\n size(width, height) {\n const p = proportionalSize(this, width, height);\n return this.rx(new SVGNumber(p.width).divide(2)).ry(new SVGNumber(p.height).divide(2));\n }\n\n}\nextend(Ellipse, circled);\nregisterMethods('Container', {\n // Create an ellipse\n ellipse: wrapWithAttrCheck(function (width = 0, height = width) {\n return this.put(new Ellipse()).size(width, height).move(0, 0);\n })\n});\nregister(Ellipse, 'Ellipse');\n\nclass Fragment extends Dom {\n constructor(node = globals.document.createDocumentFragment()) {\n super(node);\n } // Import / Export raw xml\n\n\n xml(xmlOrFn, outerXML, ns) {\n if (typeof xmlOrFn === 'boolean') {\n ns = outerXML;\n outerXML = xmlOrFn;\n xmlOrFn = null;\n } // because this is a fragment we have to put all elements into a wrapper first\n // before we can get the innerXML from it\n\n\n if (xmlOrFn == null || typeof xmlOrFn === 'function') {\n const wrapper = new Dom(create('wrapper', ns));\n wrapper.add(this.node.cloneNode(true));\n return wrapper.xml(false, ns);\n } // Act as setter if we got a string\n\n\n return super.xml(xmlOrFn, false, ns);\n }\n\n}\n\nregister(Fragment, 'Fragment');\n\nfunction from(x, y) {\n return (this._element || this).type === 'radialGradient' ? this.attr({\n fx: new SVGNumber(x),\n fy: new SVGNumber(y)\n }) : this.attr({\n x1: new SVGNumber(x),\n y1: new SVGNumber(y)\n });\n}\nfunction to(x, y) {\n return (this._element || this).type === 'radialGradient' ? this.attr({\n cx: new SVGNumber(x),\n cy: new SVGNumber(y)\n }) : this.attr({\n x2: new SVGNumber(x),\n y2: new SVGNumber(y)\n });\n}\n\nvar gradiented = {\n __proto__: null,\n from: from,\n to: to\n};\n\nclass Gradient extends Container {\n constructor(type, attrs) {\n super(nodeOrNew(type + 'Gradient', typeof type === 'string' ? null : type), attrs);\n } // custom attr to handle transform\n\n\n attr(a, b, c) {\n if (a === 'transform') a = 'gradientTransform';\n return super.attr(a, b, c);\n }\n\n bbox() {\n return new Box();\n }\n\n targets() {\n return baseFind('svg [fill*=\"' + this.id() + '\"]');\n } // Alias string conversion to fill\n\n\n toString() {\n return this.url();\n } // Update gradient\n\n\n update(block) {\n // remove all stops\n this.clear(); // invoke passed block\n\n if (typeof block === 'function') {\n block.call(this, this);\n }\n\n return this;\n } // Return the fill id\n\n\n url() {\n return 'url(\"#' + this.id() + '\")';\n }\n\n}\nextend(Gradient, gradiented);\nregisterMethods({\n Container: {\n // Create gradient element in defs\n gradient(...args) {\n return this.defs().gradient(...args);\n }\n\n },\n // define gradient\n Defs: {\n gradient: wrapWithAttrCheck(function (type, block) {\n return this.put(new Gradient(type)).update(block);\n })\n }\n});\nregister(Gradient, 'Gradient');\n\nclass Pattern extends Container {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('pattern', node), attrs);\n } // custom attr to handle transform\n\n\n attr(a, b, c) {\n if (a === 'transform') a = 'patternTransform';\n return super.attr(a, b, c);\n }\n\n bbox() {\n return new Box();\n }\n\n targets() {\n return baseFind('svg [fill*=\"' + this.id() + '\"]');\n } // Alias string conversion to fill\n\n\n toString() {\n return this.url();\n } // Update pattern by rebuilding\n\n\n update(block) {\n // remove content\n this.clear(); // invoke passed block\n\n if (typeof block === 'function') {\n block.call(this, this);\n }\n\n return this;\n } // Return the fill id\n\n\n url() {\n return 'url(\"#' + this.id() + '\")';\n }\n\n}\nregisterMethods({\n Container: {\n // Create pattern element in defs\n pattern(...args) {\n return this.defs().pattern(...args);\n }\n\n },\n Defs: {\n pattern: wrapWithAttrCheck(function (width, height, block) {\n return this.put(new Pattern()).update(block).attr({\n x: 0,\n y: 0,\n width: width,\n height: height,\n patternUnits: 'userSpaceOnUse'\n });\n })\n }\n});\nregister(Pattern, 'Pattern');\n\nclass Image extends Shape {\n constructor(node, attrs = node) {\n super(nodeOrNew('image', node), attrs);\n } // (re)load image\n\n\n load(url, callback) {\n if (!url) return this;\n const img = new globals.window.Image();\n on(img, 'load', function (e) {\n const p = this.parent(Pattern); // ensure image size\n\n if (this.width() === 0 && this.height() === 0) {\n this.size(img.width, img.height);\n }\n\n if (p instanceof Pattern) {\n // ensure pattern size if not set\n if (p.width() === 0 && p.height() === 0) {\n p.size(this.width(), this.height());\n }\n }\n\n if (typeof callback === 'function') {\n callback.call(this, e);\n }\n }, this);\n on(img, 'load error', function () {\n // dont forget to unbind memory leaking events\n off(img);\n });\n return this.attr('href', img.src = url, xlink);\n }\n\n}\nregisterAttrHook(function (attr, val, _this) {\n // convert image fill and stroke to patterns\n if (attr === 'fill' || attr === 'stroke') {\n if (isImage.test(val)) {\n val = _this.root().defs().image(val);\n }\n }\n\n if (val instanceof Image) {\n val = _this.root().defs().pattern(0, 0, pattern => {\n pattern.add(val);\n });\n }\n\n return val;\n});\nregisterMethods({\n Container: {\n // create image element, load image and set its size\n image: wrapWithAttrCheck(function (source, callback) {\n return this.put(new Image()).size(0, 0).load(source, callback);\n })\n }\n});\nregister(Image, 'Image');\n\nclass PointArray extends SVGArray {\n // Get bounding box of points\n bbox() {\n let maxX = -Infinity;\n let maxY = -Infinity;\n let minX = Infinity;\n let minY = Infinity;\n this.forEach(function (el) {\n maxX = Math.max(el[0], maxX);\n maxY = Math.max(el[1], maxY);\n minX = Math.min(el[0], minX);\n minY = Math.min(el[1], minY);\n });\n return new Box(minX, minY, maxX - minX, maxY - minY);\n } // Move point string\n\n\n move(x, y) {\n const box = this.bbox(); // get relative offset\n\n x -= box.x;\n y -= box.y; // move every point\n\n if (!isNaN(x) && !isNaN(y)) {\n for (let i = this.length - 1; i >= 0; i--) {\n this[i] = [this[i][0] + x, this[i][1] + y];\n }\n }\n\n return this;\n } // Parse point string and flat array\n\n\n parse(array = [0, 0]) {\n const points = []; // if it is an array, we flatten it and therefore clone it to 1 depths\n\n if (array instanceof Array) {\n array = Array.prototype.concat.apply([], array);\n } else {\n // Else, it is considered as a string\n // parse points\n array = array.trim().split(delimiter).map(parseFloat);\n } // validate points - https://svgwg.org/svg2-draft/shapes.html#DataTypePoints\n // Odd number of coordinates is an error. In such cases, drop the last odd coordinate.\n\n\n if (array.length % 2 !== 0) array.pop(); // wrap points in two-tuples\n\n for (let i = 0, len = array.length; i < len; i = i + 2) {\n points.push([array[i], array[i + 1]]);\n }\n\n return points;\n } // Resize poly string\n\n\n size(width, height) {\n let i;\n const box = this.bbox(); // recalculate position of all points according to new size\n\n for (i = this.length - 1; i >= 0; i--) {\n if (box.width) this[i][0] = (this[i][0] - box.x) * width / box.width + box.x;\n if (box.height) this[i][1] = (this[i][1] - box.y) * height / box.height + box.y;\n }\n\n return this;\n } // Convert array to line object\n\n\n toLine() {\n return {\n x1: this[0][0],\n y1: this[0][1],\n x2: this[1][0],\n y2: this[1][1]\n };\n } // Convert array to string\n\n\n toString() {\n const array = []; // convert to a poly point string\n\n for (let i = 0, il = this.length; i < il; i++) {\n array.push(this[i].join(','));\n }\n\n return array.join(' ');\n }\n\n transform(m) {\n return this.clone().transformO(m);\n } // transform points with matrix (similar to Point.transform)\n\n\n transformO(m) {\n if (!Matrix.isMatrixLike(m)) {\n m = new Matrix(m);\n }\n\n for (let i = this.length; i--;) {\n // Perform the matrix multiplication\n const [x, y] = this[i];\n this[i][0] = m.a * x + m.c * y + m.e;\n this[i][1] = m.b * x + m.d * y + m.f;\n }\n\n return this;\n }\n\n}\n\nconst MorphArray = PointArray; // Move by left top corner over x-axis\n\nfunction x$2(x) {\n return x == null ? this.bbox().x : this.move(x, this.bbox().y);\n} // Move by left top corner over y-axis\n\nfunction y$2(y) {\n return y == null ? this.bbox().y : this.move(this.bbox().x, y);\n} // Set width of element\n\nfunction width$1(width) {\n const b = this.bbox();\n return width == null ? b.width : this.size(width, b.height);\n} // Set height of element\n\nfunction height$1(height) {\n const b = this.bbox();\n return height == null ? b.height : this.size(b.width, height);\n}\n\nvar pointed = {\n __proto__: null,\n MorphArray: MorphArray,\n x: x$2,\n y: y$2,\n width: width$1,\n height: height$1\n};\n\nclass Line extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('line', node), attrs);\n } // Get array\n\n\n array() {\n return new PointArray([[this.attr('x1'), this.attr('y1')], [this.attr('x2'), this.attr('y2')]]);\n } // Move by left top corner\n\n\n move(x, y) {\n return this.attr(this.array().move(x, y).toLine());\n } // Overwrite native plot() method\n\n\n plot(x1, y1, x2, y2) {\n if (x1 == null) {\n return this.array();\n } else if (typeof y1 !== 'undefined') {\n x1 = {\n x1,\n y1,\n x2,\n y2\n };\n } else {\n x1 = new PointArray(x1).toLine();\n }\n\n return this.attr(x1);\n } // Set element size to given width and height\n\n\n size(width, height) {\n const p = proportionalSize(this, width, height);\n return this.attr(this.array().size(p.width, p.height).toLine());\n }\n\n}\nextend(Line, pointed);\nregisterMethods({\n Container: {\n // Create a line element\n line: wrapWithAttrCheck(function (...args) {\n // make sure plot is called as a setter\n // x1 is not necessarily a number, it can also be an array, a string and a PointArray\n return Line.prototype.plot.apply(this.put(new Line()), args[0] != null ? args : [0, 0, 0, 0]);\n })\n }\n});\nregister(Line, 'Line');\n\nclass Marker extends Container {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('marker', node), attrs);\n } // Set height of element\n\n\n height(height) {\n return this.attr('markerHeight', height);\n }\n\n orient(orient) {\n return this.attr('orient', orient);\n } // Set marker refX and refY\n\n\n ref(x, y) {\n return this.attr('refX', x).attr('refY', y);\n } // Return the fill id\n\n\n toString() {\n return 'url(#' + this.id() + ')';\n } // Update marker\n\n\n update(block) {\n // remove all content\n this.clear(); // invoke passed block\n\n if (typeof block === 'function') {\n block.call(this, this);\n }\n\n return this;\n } // Set width of element\n\n\n width(width) {\n return this.attr('markerWidth', width);\n }\n\n}\nregisterMethods({\n Container: {\n marker(...args) {\n // Create marker element in defs\n return this.defs().marker(...args);\n }\n\n },\n Defs: {\n // Create marker\n marker: wrapWithAttrCheck(function (width, height, block) {\n // Set default viewbox to match the width and height, set ref to cx and cy and set orient to auto\n return this.put(new Marker()).size(width, height).ref(width / 2, height / 2).viewbox(0, 0, width, height).attr('orient', 'auto').update(block);\n })\n },\n marker: {\n // Create and attach markers\n marker(marker, width, height, block) {\n let attr = ['marker']; // Build attribute name\n\n if (marker !== 'all') attr.push(marker);\n attr = attr.join('-'); // Set marker attribute\n\n marker = arguments[1] instanceof Marker ? arguments[1] : this.defs().marker(width, height, block);\n return this.attr(attr, marker);\n }\n\n }\n});\nregister(Marker, 'Marker');\n\n/***\r\nBase Class\r\n==========\r\nThe base stepper class that will be\r\n***/\n\nfunction makeSetterGetter(k, f) {\n return function (v) {\n if (v == null) return this[k];\n this[k] = v;\n if (f) f.call(this);\n return this;\n };\n}\n\nconst easing = {\n '-': function (pos) {\n return pos;\n },\n '<>': function (pos) {\n return -Math.cos(pos * Math.PI) / 2 + 0.5;\n },\n '>': function (pos) {\n return Math.sin(pos * Math.PI / 2);\n },\n '<': function (pos) {\n return -Math.cos(pos * Math.PI / 2) + 1;\n },\n bezier: function (x1, y1, x2, y2) {\n // see https://www.w3.org/TR/css-easing-1/#cubic-bezier-algo\n return function (t) {\n if (t < 0) {\n if (x1 > 0) {\n return y1 / x1 * t;\n } else if (x2 > 0) {\n return y2 / x2 * t;\n } else {\n return 0;\n }\n } else if (t > 1) {\n if (x2 < 1) {\n return (1 - y2) / (1 - x2) * t + (y2 - x2) / (1 - x2);\n } else if (x1 < 1) {\n return (1 - y1) / (1 - x1) * t + (y1 - x1) / (1 - x1);\n } else {\n return 1;\n }\n } else {\n return 3 * t * (1 - t) ** 2 * y1 + 3 * t ** 2 * (1 - t) * y2 + t ** 3;\n }\n };\n },\n // see https://www.w3.org/TR/css-easing-1/#step-timing-function-algo\n steps: function (steps, stepPosition = 'end') {\n // deal with \"jump-\" prefix\n stepPosition = stepPosition.split('-').reverse()[0];\n let jumps = steps;\n\n if (stepPosition === 'none') {\n --jumps;\n } else if (stepPosition === 'both') {\n ++jumps;\n } // The beforeFlag is essentially useless\n\n\n return (t, beforeFlag = false) => {\n // Step is called currentStep in referenced url\n let step = Math.floor(t * steps);\n const jumping = t * step % 1 === 0;\n\n if (stepPosition === 'start' || stepPosition === 'both') {\n ++step;\n }\n\n if (beforeFlag && jumping) {\n --step;\n }\n\n if (t >= 0 && step < 0) {\n step = 0;\n }\n\n if (t <= 1 && step > jumps) {\n step = jumps;\n }\n\n return step / jumps;\n };\n }\n};\nclass Stepper {\n done() {\n return false;\n }\n\n}\n/***\r\nEasing Functions\r\n================\r\n***/\n\nclass Ease extends Stepper {\n constructor(fn = timeline.ease) {\n super();\n this.ease = easing[fn] || fn;\n }\n\n step(from, to, pos) {\n if (typeof from !== 'number') {\n return pos < 1 ? from : to;\n }\n\n return from + (to - from) * this.ease(pos);\n }\n\n}\n/***\r\nController Types\r\n================\r\n***/\n\nclass Controller extends Stepper {\n constructor(fn) {\n super();\n this.stepper = fn;\n }\n\n done(c) {\n return c.done;\n }\n\n step(current, target, dt, c) {\n return this.stepper(current, target, dt, c);\n }\n\n}\n\nfunction recalculate() {\n // Apply the default parameters\n const duration = (this._duration || 500) / 1000;\n const overshoot = this._overshoot || 0; // Calculate the PID natural response\n\n const eps = 1e-10;\n const pi = Math.PI;\n const os = Math.log(overshoot / 100 + eps);\n const zeta = -os / Math.sqrt(pi * pi + os * os);\n const wn = 3.9 / (zeta * duration); // Calculate the Spring values\n\n this.d = 2 * zeta * wn;\n this.k = wn * wn;\n}\n\nclass Spring extends Controller {\n constructor(duration = 500, overshoot = 0) {\n super();\n this.duration(duration).overshoot(overshoot);\n }\n\n step(current, target, dt, c) {\n if (typeof current === 'string') return current;\n c.done = dt === Infinity;\n if (dt === Infinity) return target;\n if (dt === 0) return current;\n if (dt > 100) dt = 16;\n dt /= 1000; // Get the previous velocity\n\n const velocity = c.velocity || 0; // Apply the control to get the new position and store it\n\n const acceleration = -this.d * velocity - this.k * (current - target);\n const newPosition = current + velocity * dt + acceleration * dt * dt / 2; // Store the velocity\n\n c.velocity = velocity + acceleration * dt; // Figure out if we have converged, and if so, pass the value\n\n c.done = Math.abs(target - newPosition) + Math.abs(velocity) < 0.002;\n return c.done ? target : newPosition;\n }\n\n}\nextend(Spring, {\n duration: makeSetterGetter('_duration', recalculate),\n overshoot: makeSetterGetter('_overshoot', recalculate)\n});\nclass PID extends Controller {\n constructor(p = 0.1, i = 0.01, d = 0, windup = 1000) {\n super();\n this.p(p).i(i).d(d).windup(windup);\n }\n\n step(current, target, dt, c) {\n if (typeof current === 'string') return current;\n c.done = dt === Infinity;\n if (dt === Infinity) return target;\n if (dt === 0) return current;\n const p = target - current;\n let i = (c.integral || 0) + p * dt;\n const d = (p - (c.error || 0)) / dt;\n const windup = this._windup; // antiwindup\n\n if (windup !== false) {\n i = Math.max(-windup, Math.min(i, windup));\n }\n\n c.error = p;\n c.integral = i;\n c.done = Math.abs(p) < 0.001;\n return c.done ? target : current + (this.P * p + this.I * i + this.D * d);\n }\n\n}\nextend(PID, {\n windup: makeSetterGetter('_windup'),\n p: makeSetterGetter('P'),\n i: makeSetterGetter('I'),\n d: makeSetterGetter('D')\n});\n\nconst segmentParameters = {\n M: 2,\n L: 2,\n H: 1,\n V: 1,\n C: 6,\n S: 4,\n Q: 4,\n T: 2,\n A: 7,\n Z: 0\n};\nconst pathHandlers = {\n M: function (c, p, p0) {\n p.x = p0.x = c[0];\n p.y = p0.y = c[1];\n return ['M', p.x, p.y];\n },\n L: function (c, p) {\n p.x = c[0];\n p.y = c[1];\n return ['L', c[0], c[1]];\n },\n H: function (c, p) {\n p.x = c[0];\n return ['H', c[0]];\n },\n V: function (c, p) {\n p.y = c[0];\n return ['V', c[0]];\n },\n C: function (c, p) {\n p.x = c[4];\n p.y = c[5];\n return ['C', c[0], c[1], c[2], c[3], c[4], c[5]];\n },\n S: function (c, p) {\n p.x = c[2];\n p.y = c[3];\n return ['S', c[0], c[1], c[2], c[3]];\n },\n Q: function (c, p) {\n p.x = c[2];\n p.y = c[3];\n return ['Q', c[0], c[1], c[2], c[3]];\n },\n T: function (c, p) {\n p.x = c[0];\n p.y = c[1];\n return ['T', c[0], c[1]];\n },\n Z: function (c, p, p0) {\n p.x = p0.x;\n p.y = p0.y;\n return ['Z'];\n },\n A: function (c, p) {\n p.x = c[5];\n p.y = c[6];\n return ['A', c[0], c[1], c[2], c[3], c[4], c[5], c[6]];\n }\n};\nconst mlhvqtcsaz = 'mlhvqtcsaz'.split('');\n\nfor (let i = 0, il = mlhvqtcsaz.length; i < il; ++i) {\n pathHandlers[mlhvqtcsaz[i]] = function (i) {\n return function (c, p, p0) {\n if (i === 'H') c[0] = c[0] + p.x;else if (i === 'V') c[0] = c[0] + p.y;else if (i === 'A') {\n c[5] = c[5] + p.x;\n c[6] = c[6] + p.y;\n } else {\n for (let j = 0, jl = c.length; j < jl; ++j) {\n c[j] = c[j] + (j % 2 ? p.y : p.x);\n }\n }\n return pathHandlers[i](c, p, p0);\n };\n }(mlhvqtcsaz[i].toUpperCase());\n}\n\nfunction makeAbsolut(parser) {\n const command = parser.segment[0];\n return pathHandlers[command](parser.segment.slice(1), parser.p, parser.p0);\n}\n\nfunction segmentComplete(parser) {\n return parser.segment.length && parser.segment.length - 1 === segmentParameters[parser.segment[0].toUpperCase()];\n}\n\nfunction startNewSegment(parser, token) {\n parser.inNumber && finalizeNumber(parser, false);\n const pathLetter = isPathLetter.test(token);\n\n if (pathLetter) {\n parser.segment = [token];\n } else {\n const lastCommand = parser.lastCommand;\n const small = lastCommand.toLowerCase();\n const isSmall = lastCommand === small;\n parser.segment = [small === 'm' ? isSmall ? 'l' : 'L' : lastCommand];\n }\n\n parser.inSegment = true;\n parser.lastCommand = parser.segment[0];\n return pathLetter;\n}\n\nfunction finalizeNumber(parser, inNumber) {\n if (!parser.inNumber) throw new Error('Parser Error');\n parser.number && parser.segment.push(parseFloat(parser.number));\n parser.inNumber = inNumber;\n parser.number = '';\n parser.pointSeen = false;\n parser.hasExponent = false;\n\n if (segmentComplete(parser)) {\n finalizeSegment(parser);\n }\n}\n\nfunction finalizeSegment(parser) {\n parser.inSegment = false;\n\n if (parser.absolute) {\n parser.segment = makeAbsolut(parser);\n }\n\n parser.segments.push(parser.segment);\n}\n\nfunction isArcFlag(parser) {\n if (!parser.segment.length) return false;\n const isArc = parser.segment[0].toUpperCase() === 'A';\n const length = parser.segment.length;\n return isArc && (length === 4 || length === 5);\n}\n\nfunction isExponential(parser) {\n return parser.lastToken.toUpperCase() === 'E';\n}\n\nfunction pathParser(d, toAbsolute = true) {\n let index = 0;\n let token = '';\n const parser = {\n segment: [],\n inNumber: false,\n number: '',\n lastToken: '',\n inSegment: false,\n segments: [],\n pointSeen: false,\n hasExponent: false,\n absolute: toAbsolute,\n p0: new Point(),\n p: new Point()\n };\n\n while (parser.lastToken = token, token = d.charAt(index++)) {\n if (!parser.inSegment) {\n if (startNewSegment(parser, token)) {\n continue;\n }\n }\n\n if (token === '.') {\n if (parser.pointSeen || parser.hasExponent) {\n finalizeNumber(parser, false);\n --index;\n continue;\n }\n\n parser.inNumber = true;\n parser.pointSeen = true;\n parser.number += token;\n continue;\n }\n\n if (!isNaN(parseInt(token))) {\n if (parser.number === '0' || isArcFlag(parser)) {\n parser.inNumber = true;\n parser.number = token;\n finalizeNumber(parser, true);\n continue;\n }\n\n parser.inNumber = true;\n parser.number += token;\n continue;\n }\n\n if (token === ' ' || token === ',') {\n if (parser.inNumber) {\n finalizeNumber(parser, false);\n }\n\n continue;\n }\n\n if (token === '-') {\n if (parser.inNumber && !isExponential(parser)) {\n finalizeNumber(parser, false);\n --index;\n continue;\n }\n\n parser.number += token;\n parser.inNumber = true;\n continue;\n }\n\n if (token.toUpperCase() === 'E') {\n parser.number += token;\n parser.hasExponent = true;\n continue;\n }\n\n if (isPathLetter.test(token)) {\n if (parser.inNumber) {\n finalizeNumber(parser, false);\n } else if (!segmentComplete(parser)) {\n throw new Error('parser Error');\n } else {\n finalizeSegment(parser);\n }\n\n --index;\n }\n }\n\n if (parser.inNumber) {\n finalizeNumber(parser, false);\n }\n\n if (parser.inSegment && segmentComplete(parser)) {\n finalizeSegment(parser);\n }\n\n return parser.segments;\n}\n\nfunction arrayToString(a) {\n let s = '';\n\n for (let i = 0, il = a.length; i < il; i++) {\n s += a[i][0];\n\n if (a[i][1] != null) {\n s += a[i][1];\n\n if (a[i][2] != null) {\n s += ' ';\n s += a[i][2];\n\n if (a[i][3] != null) {\n s += ' ';\n s += a[i][3];\n s += ' ';\n s += a[i][4];\n\n if (a[i][5] != null) {\n s += ' ';\n s += a[i][5];\n s += ' ';\n s += a[i][6];\n\n if (a[i][7] != null) {\n s += ' ';\n s += a[i][7];\n }\n }\n }\n }\n }\n }\n\n return s + ' ';\n}\n\nclass PathArray extends SVGArray {\n // Get bounding box of path\n bbox() {\n parser().path.setAttribute('d', this.toString());\n return new Box(parser.nodes.path.getBBox());\n } // Move path string\n\n\n move(x, y) {\n // get bounding box of current situation\n const box = this.bbox(); // get relative offset\n\n x -= box.x;\n y -= box.y;\n\n if (!isNaN(x) && !isNaN(y)) {\n // move every point\n for (let l, i = this.length - 1; i >= 0; i--) {\n l = this[i][0];\n\n if (l === 'M' || l === 'L' || l === 'T') {\n this[i][1] += x;\n this[i][2] += y;\n } else if (l === 'H') {\n this[i][1] += x;\n } else if (l === 'V') {\n this[i][1] += y;\n } else if (l === 'C' || l === 'S' || l === 'Q') {\n this[i][1] += x;\n this[i][2] += y;\n this[i][3] += x;\n this[i][4] += y;\n\n if (l === 'C') {\n this[i][5] += x;\n this[i][6] += y;\n }\n } else if (l === 'A') {\n this[i][6] += x;\n this[i][7] += y;\n }\n }\n }\n\n return this;\n } // Absolutize and parse path to array\n\n\n parse(d = 'M0 0') {\n if (Array.isArray(d)) {\n d = Array.prototype.concat.apply([], d).toString();\n }\n\n return pathParser(d);\n } // Resize path string\n\n\n size(width, height) {\n // get bounding box of current situation\n const box = this.bbox();\n let i, l; // If the box width or height is 0 then we ignore\n // transformations on the respective axis\n\n box.width = box.width === 0 ? 1 : box.width;\n box.height = box.height === 0 ? 1 : box.height; // recalculate position of all points according to new size\n\n for (i = this.length - 1; i >= 0; i--) {\n l = this[i][0];\n\n if (l === 'M' || l === 'L' || l === 'T') {\n this[i][1] = (this[i][1] - box.x) * width / box.width + box.x;\n this[i][2] = (this[i][2] - box.y) * height / box.height + box.y;\n } else if (l === 'H') {\n this[i][1] = (this[i][1] - box.x) * width / box.width + box.x;\n } else if (l === 'V') {\n this[i][1] = (this[i][1] - box.y) * height / box.height + box.y;\n } else if (l === 'C' || l === 'S' || l === 'Q') {\n this[i][1] = (this[i][1] - box.x) * width / box.width + box.x;\n this[i][2] = (this[i][2] - box.y) * height / box.height + box.y;\n this[i][3] = (this[i][3] - box.x) * width / box.width + box.x;\n this[i][4] = (this[i][4] - box.y) * height / box.height + box.y;\n\n if (l === 'C') {\n this[i][5] = (this[i][5] - box.x) * width / box.width + box.x;\n this[i][6] = (this[i][6] - box.y) * height / box.height + box.y;\n }\n } else if (l === 'A') {\n // resize radii\n this[i][1] = this[i][1] * width / box.width;\n this[i][2] = this[i][2] * height / box.height; // move position values\n\n this[i][6] = (this[i][6] - box.x) * width / box.width + box.x;\n this[i][7] = (this[i][7] - box.y) * height / box.height + box.y;\n }\n }\n\n return this;\n } // Convert array to string\n\n\n toString() {\n return arrayToString(this);\n }\n\n}\n\nconst getClassForType = value => {\n const type = typeof value;\n\n if (type === 'number') {\n return SVGNumber;\n } else if (type === 'string') {\n if (Color.isColor(value)) {\n return Color;\n } else if (delimiter.test(value)) {\n return isPathLetter.test(value) ? PathArray : SVGArray;\n } else if (numberAndUnit.test(value)) {\n return SVGNumber;\n } else {\n return NonMorphable;\n }\n } else if (morphableTypes.indexOf(value.constructor) > -1) {\n return value.constructor;\n } else if (Array.isArray(value)) {\n return SVGArray;\n } else if (type === 'object') {\n return ObjectBag;\n } else {\n return NonMorphable;\n }\n};\n\nclass Morphable {\n constructor(stepper) {\n this._stepper = stepper || new Ease('-');\n this._from = null;\n this._to = null;\n this._type = null;\n this._context = null;\n this._morphObj = null;\n }\n\n at(pos) {\n const _this = this;\n\n return this._morphObj.fromArray(this._from.map(function (i, index) {\n return _this._stepper.step(i, _this._to[index], pos, _this._context[index], _this._context);\n }));\n }\n\n done() {\n const complete = this._context.map(this._stepper.done).reduce(function (last, curr) {\n return last && curr;\n }, true);\n\n return complete;\n }\n\n from(val) {\n if (val == null) {\n return this._from;\n }\n\n this._from = this._set(val);\n return this;\n }\n\n stepper(stepper) {\n if (stepper == null) return this._stepper;\n this._stepper = stepper;\n return this;\n }\n\n to(val) {\n if (val == null) {\n return this._to;\n }\n\n this._to = this._set(val);\n return this;\n }\n\n type(type) {\n // getter\n if (type == null) {\n return this._type;\n } // setter\n\n\n this._type = type;\n return this;\n }\n\n _set(value) {\n if (!this._type) {\n this.type(getClassForType(value));\n }\n\n let result = new this._type(value);\n\n if (this._type === Color) {\n result = this._to ? result[this._to[4]]() : this._from ? result[this._from[4]]() : result;\n }\n\n if (this._type === ObjectBag) {\n result = this._to ? result.align(this._to) : this._from ? result.align(this._from) : result;\n }\n\n result = result.toArray();\n this._morphObj = this._morphObj || new this._type();\n this._context = this._context || Array.apply(null, Array(result.length)).map(Object).map(function (o) {\n o.done = true;\n return o;\n });\n return result;\n }\n\n}\nclass NonMorphable {\n constructor(...args) {\n this.init(...args);\n }\n\n init(val) {\n val = Array.isArray(val) ? val[0] : val;\n this.value = val;\n return this;\n }\n\n toArray() {\n return [this.value];\n }\n\n valueOf() {\n return this.value;\n }\n\n}\nclass TransformBag {\n constructor(...args) {\n this.init(...args);\n }\n\n init(obj) {\n if (Array.isArray(obj)) {\n obj = {\n scaleX: obj[0],\n scaleY: obj[1],\n shear: obj[2],\n rotate: obj[3],\n translateX: obj[4],\n translateY: obj[5],\n originX: obj[6],\n originY: obj[7]\n };\n }\n\n Object.assign(this, TransformBag.defaults, obj);\n return this;\n }\n\n toArray() {\n const v = this;\n return [v.scaleX, v.scaleY, v.shear, v.rotate, v.translateX, v.translateY, v.originX, v.originY];\n }\n\n}\nTransformBag.defaults = {\n scaleX: 1,\n scaleY: 1,\n shear: 0,\n rotate: 0,\n translateX: 0,\n translateY: 0,\n originX: 0,\n originY: 0\n};\n\nconst sortByKey = (a, b) => {\n return a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : 0;\n};\n\nclass ObjectBag {\n constructor(...args) {\n this.init(...args);\n }\n\n align(other) {\n for (let i = 0, il = this.values.length; i < il; ++i) {\n if (this.values[i] === Color) {\n const space = other[i + 6];\n const color = new Color(this.values.splice(i + 2, 5))[space]().toArray();\n this.values.splice(i + 2, 0, ...color);\n }\n }\n\n return this;\n }\n\n init(objOrArr) {\n this.values = [];\n\n if (Array.isArray(objOrArr)) {\n this.values = objOrArr.slice();\n return;\n }\n\n objOrArr = objOrArr || {};\n const entries = [];\n\n for (const i in objOrArr) {\n const Type = getClassForType(objOrArr[i]);\n const val = new Type(objOrArr[i]).toArray();\n entries.push([i, Type, val.length, ...val]);\n }\n\n entries.sort(sortByKey);\n this.values = entries.reduce((last, curr) => last.concat(curr), []);\n return this;\n }\n\n toArray() {\n return this.values;\n }\n\n valueOf() {\n const obj = {};\n const arr = this.values; // for (var i = 0, len = arr.length; i < len; i += 2) {\n\n while (arr.length) {\n const key = arr.shift();\n const Type = arr.shift();\n const num = arr.shift();\n const values = arr.splice(0, num);\n obj[key] = new Type(values).valueOf();\n }\n\n return obj;\n }\n\n}\nconst morphableTypes = [NonMorphable, TransformBag, ObjectBag];\nfunction registerMorphableType(type = []) {\n morphableTypes.push(...[].concat(type));\n}\nfunction makeMorphable() {\n extend(morphableTypes, {\n to(val) {\n return new Morphable().type(this.constructor).from(this.valueOf()).to(val);\n },\n\n fromArray(arr) {\n this.init(arr);\n return this;\n }\n\n });\n}\n\nclass Path extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('path', node), attrs);\n } // Get array\n\n\n array() {\n return this._array || (this._array = new PathArray(this.attr('d')));\n } // Clear array cache\n\n\n clear() {\n delete this._array;\n return this;\n } // Set height of element\n\n\n height(height) {\n return height == null ? this.bbox().height : this.size(this.bbox().width, height);\n } // Move by left top corner\n\n\n move(x, y) {\n return this.attr('d', this.array().move(x, y));\n } // Plot new path\n\n\n plot(d) {\n return d == null ? this.array() : this.clear().attr('d', typeof d === 'string' ? d : this._array = new PathArray(d));\n } // Set element size to given width and height\n\n\n size(width, height) {\n const p = proportionalSize(this, width, height);\n return this.attr('d', this.array().size(p.width, p.height));\n } // Set width of element\n\n\n width(width) {\n return width == null ? this.bbox().width : this.size(width, this.bbox().height);\n } // Move by left top corner over x-axis\n\n\n x(x) {\n return x == null ? this.bbox().x : this.move(x, this.bbox().y);\n } // Move by left top corner over y-axis\n\n\n y(y) {\n return y == null ? this.bbox().y : this.move(this.bbox().x, y);\n }\n\n} // Define morphable array\n\nPath.prototype.MorphArray = PathArray; // Add parent method\n\nregisterMethods({\n Container: {\n // Create a wrapped path element\n path: wrapWithAttrCheck(function (d) {\n // make sure plot is called as a setter\n return this.put(new Path()).plot(d || new PathArray());\n })\n }\n});\nregister(Path, 'Path');\n\nfunction array() {\n return this._array || (this._array = new PointArray(this.attr('points')));\n} // Clear array cache\n\nfunction clear() {\n delete this._array;\n return this;\n} // Move by left top corner\n\nfunction move$2(x, y) {\n return this.attr('points', this.array().move(x, y));\n} // Plot new path\n\nfunction plot(p) {\n return p == null ? this.array() : this.clear().attr('points', typeof p === 'string' ? p : this._array = new PointArray(p));\n} // Set element size to given width and height\n\nfunction size$1(width, height) {\n const p = proportionalSize(this, width, height);\n return this.attr('points', this.array().size(p.width, p.height));\n}\n\nvar poly = {\n __proto__: null,\n array: array,\n clear: clear,\n move: move$2,\n plot: plot,\n size: size$1\n};\n\nclass Polygon extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('polygon', node), attrs);\n }\n\n}\nregisterMethods({\n Container: {\n // Create a wrapped polygon element\n polygon: wrapWithAttrCheck(function (p) {\n // make sure plot is called as a setter\n return this.put(new Polygon()).plot(p || new PointArray());\n })\n }\n});\nextend(Polygon, pointed);\nextend(Polygon, poly);\nregister(Polygon, 'Polygon');\n\nclass Polyline extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('polyline', node), attrs);\n }\n\n}\nregisterMethods({\n Container: {\n // Create a wrapped polygon element\n polyline: wrapWithAttrCheck(function (p) {\n // make sure plot is called as a setter\n return this.put(new Polyline()).plot(p || new PointArray());\n })\n }\n});\nextend(Polyline, pointed);\nextend(Polyline, poly);\nregister(Polyline, 'Polyline');\n\nclass Rect extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('rect', node), attrs);\n }\n\n}\nextend(Rect, {\n rx,\n ry\n});\nregisterMethods({\n Container: {\n // Create a rect element\n rect: wrapWithAttrCheck(function (width, height) {\n return this.put(new Rect()).size(width, height);\n })\n }\n});\nregister(Rect, 'Rect');\n\nclass Queue {\n constructor() {\n this._first = null;\n this._last = null;\n } // Shows us the first item in the list\n\n\n first() {\n return this._first && this._first.value;\n } // Shows us the last item in the list\n\n\n last() {\n return this._last && this._last.value;\n }\n\n push(value) {\n // An item stores an id and the provided value\n const item = typeof value.next !== 'undefined' ? value : {\n value: value,\n next: null,\n prev: null\n }; // Deal with the queue being empty or populated\n\n if (this._last) {\n item.prev = this._last;\n this._last.next = item;\n this._last = item;\n } else {\n this._last = item;\n this._first = item;\n } // Return the current item\n\n\n return item;\n } // Removes the item that was returned from the push\n\n\n remove(item) {\n // Relink the previous item\n if (item.prev) item.prev.next = item.next;\n if (item.next) item.next.prev = item.prev;\n if (item === this._last) this._last = item.prev;\n if (item === this._first) this._first = item.next; // Invalidate item\n\n item.prev = null;\n item.next = null;\n }\n\n shift() {\n // Check if we have a value\n const remove = this._first;\n if (!remove) return null; // If we do, remove it and relink things\n\n this._first = remove.next;\n if (this._first) this._first.prev = null;\n this._last = this._first ? this._last : null;\n return remove.value;\n }\n\n}\n\nconst Animator = {\n nextDraw: null,\n frames: new Queue(),\n timeouts: new Queue(),\n immediates: new Queue(),\n timer: () => globals.window.performance || globals.window.Date,\n transforms: [],\n\n frame(fn) {\n // Store the node\n const node = Animator.frames.push({\n run: fn\n }); // Request an animation frame if we don't have one\n\n if (Animator.nextDraw === null) {\n Animator.nextDraw = globals.window.requestAnimationFrame(Animator._draw);\n } // Return the node so we can remove it easily\n\n\n return node;\n },\n\n timeout(fn, delay) {\n delay = delay || 0; // Work out when the event should fire\n\n const time = Animator.timer().now() + delay; // Add the timeout to the end of the queue\n\n const node = Animator.timeouts.push({\n run: fn,\n time: time\n }); // Request another animation frame if we need one\n\n if (Animator.nextDraw === null) {\n Animator.nextDraw = globals.window.requestAnimationFrame(Animator._draw);\n }\n\n return node;\n },\n\n immediate(fn) {\n // Add the immediate fn to the end of the queue\n const node = Animator.immediates.push(fn); // Request another animation frame if we need one\n\n if (Animator.nextDraw === null) {\n Animator.nextDraw = globals.window.requestAnimationFrame(Animator._draw);\n }\n\n return node;\n },\n\n cancelFrame(node) {\n node != null && Animator.frames.remove(node);\n },\n\n clearTimeout(node) {\n node != null && Animator.timeouts.remove(node);\n },\n\n cancelImmediate(node) {\n node != null && Animator.immediates.remove(node);\n },\n\n _draw(now) {\n // Run all the timeouts we can run, if they are not ready yet, add them\n // to the end of the queue immediately! (bad timeouts!!! [sarcasm])\n let nextTimeout = null;\n const lastTimeout = Animator.timeouts.last();\n\n while (nextTimeout = Animator.timeouts.shift()) {\n // Run the timeout if its time, or push it to the end\n if (now >= nextTimeout.time) {\n nextTimeout.run();\n } else {\n Animator.timeouts.push(nextTimeout);\n } // If we hit the last item, we should stop shifting out more items\n\n\n if (nextTimeout === lastTimeout) break;\n } // Run all of the animation frames\n\n\n let nextFrame = null;\n const lastFrame = Animator.frames.last();\n\n while (nextFrame !== lastFrame && (nextFrame = Animator.frames.shift())) {\n nextFrame.run(now);\n }\n\n let nextImmediate = null;\n\n while (nextImmediate = Animator.immediates.shift()) {\n nextImmediate();\n } // If we have remaining timeouts or frames, draw until we don't anymore\n\n\n Animator.nextDraw = Animator.timeouts.first() || Animator.frames.first() ? globals.window.requestAnimationFrame(Animator._draw) : null;\n }\n\n};\n\nconst makeSchedule = function (runnerInfo) {\n const start = runnerInfo.start;\n const duration = runnerInfo.runner.duration();\n const end = start + duration;\n return {\n start: start,\n duration: duration,\n end: end,\n runner: runnerInfo.runner\n };\n};\n\nconst defaultSource = function () {\n const w = globals.window;\n return (w.performance || w.Date).now();\n};\n\nclass Timeline extends EventTarget {\n // Construct a new timeline on the given element\n constructor(timeSource = defaultSource) {\n super();\n this._timeSource = timeSource; // Store the timing variables\n\n this._startTime = 0;\n this._speed = 1.0; // Determines how long a runner is hold in memory. Can be a dt or true/false\n\n this._persist = 0; // Keep track of the running animations and their starting parameters\n\n this._nextFrame = null;\n this._paused = true;\n this._runners = [];\n this._runnerIds = [];\n this._lastRunnerId = -1;\n this._time = 0;\n this._lastSourceTime = 0;\n this._lastStepTime = 0; // Make sure that step is always called in class context\n\n this._step = this._stepFn.bind(this, false);\n this._stepImmediate = this._stepFn.bind(this, true);\n }\n\n active() {\n return !!this._nextFrame;\n }\n\n finish() {\n // Go to end and pause\n this.time(this.getEndTimeOfTimeline() + 1);\n return this.pause();\n } // Calculates the end of the timeline\n\n\n getEndTime() {\n const lastRunnerInfo = this.getLastRunnerInfo();\n const lastDuration = lastRunnerInfo ? lastRunnerInfo.runner.duration() : 0;\n const lastStartTime = lastRunnerInfo ? lastRunnerInfo.start : this._time;\n return lastStartTime + lastDuration;\n }\n\n getEndTimeOfTimeline() {\n const endTimes = this._runners.map(i => i.start + i.runner.duration());\n\n return Math.max(0, ...endTimes);\n }\n\n getLastRunnerInfo() {\n return this.getRunnerInfoById(this._lastRunnerId);\n }\n\n getRunnerInfoById(id) {\n return this._runners[this._runnerIds.indexOf(id)] || null;\n }\n\n pause() {\n this._paused = true;\n return this._continue();\n }\n\n persist(dtOrForever) {\n if (dtOrForever == null) return this._persist;\n this._persist = dtOrForever;\n return this;\n }\n\n play() {\n // Now make sure we are not paused and continue the animation\n this._paused = false;\n return this.updateTime()._continue();\n }\n\n reverse(yes) {\n const currentSpeed = this.speed();\n if (yes == null) return this.speed(-currentSpeed);\n const positive = Math.abs(currentSpeed);\n return this.speed(yes ? -positive : positive);\n } // schedules a runner on the timeline\n\n\n schedule(runner, delay, when) {\n if (runner == null) {\n return this._runners.map(makeSchedule);\n } // The start time for the next animation can either be given explicitly,\n // derived from the current timeline time or it can be relative to the\n // last start time to chain animations directly\n\n\n let absoluteStartTime = 0;\n const endTime = this.getEndTime();\n delay = delay || 0; // Work out when to start the animation\n\n if (when == null || when === 'last' || when === 'after') {\n // Take the last time and increment\n absoluteStartTime = endTime;\n } else if (when === 'absolute' || when === 'start') {\n absoluteStartTime = delay;\n delay = 0;\n } else if (when === 'now') {\n absoluteStartTime = this._time;\n } else if (when === 'relative') {\n const runnerInfo = this.getRunnerInfoById(runner.id);\n\n if (runnerInfo) {\n absoluteStartTime = runnerInfo.start + delay;\n delay = 0;\n }\n } else if (when === 'with-last') {\n const lastRunnerInfo = this.getLastRunnerInfo();\n const lastStartTime = lastRunnerInfo ? lastRunnerInfo.start : this._time;\n absoluteStartTime = lastStartTime;\n } else {\n throw new Error('Invalid value for the \"when\" parameter');\n } // Manage runner\n\n\n runner.unschedule();\n runner.timeline(this);\n const persist = runner.persist();\n const runnerInfo = {\n persist: persist === null ? this._persist : persist,\n start: absoluteStartTime + delay,\n runner\n };\n this._lastRunnerId = runner.id;\n\n this._runners.push(runnerInfo);\n\n this._runners.sort((a, b) => a.start - b.start);\n\n this._runnerIds = this._runners.map(info => info.runner.id);\n\n this.updateTime()._continue();\n\n return this;\n }\n\n seek(dt) {\n return this.time(this._time + dt);\n }\n\n source(fn) {\n if (fn == null) return this._timeSource;\n this._timeSource = fn;\n return this;\n }\n\n speed(speed) {\n if (speed == null) return this._speed;\n this._speed = speed;\n return this;\n }\n\n stop() {\n // Go to start and pause\n this.time(0);\n return this.pause();\n }\n\n time(time) {\n if (time == null) return this._time;\n this._time = time;\n return this._continue(true);\n } // Remove the runner from this timeline\n\n\n unschedule(runner) {\n const index = this._runnerIds.indexOf(runner.id);\n\n if (index < 0) return this;\n\n this._runners.splice(index, 1);\n\n this._runnerIds.splice(index, 1);\n\n runner.timeline(null);\n return this;\n } // Makes sure, that after pausing the time doesn't jump\n\n\n updateTime() {\n if (!this.active()) {\n this._lastSourceTime = this._timeSource();\n }\n\n return this;\n } // Checks if we are running and continues the animation\n\n\n _continue(immediateStep = false) {\n Animator.cancelFrame(this._nextFrame);\n this._nextFrame = null;\n if (immediateStep) return this._stepImmediate();\n if (this._paused) return this;\n this._nextFrame = Animator.frame(this._step);\n return this;\n }\n\n _stepFn(immediateStep = false) {\n // Get the time delta from the last time and update the time\n const time = this._timeSource();\n\n let dtSource = time - this._lastSourceTime;\n if (immediateStep) dtSource = 0;\n const dtTime = this._speed * dtSource + (this._time - this._lastStepTime);\n this._lastSourceTime = time; // Only update the time if we use the timeSource.\n // Otherwise use the current time\n\n if (!immediateStep) {\n // Update the time\n this._time += dtTime;\n this._time = this._time < 0 ? 0 : this._time;\n }\n\n this._lastStepTime = this._time;\n this.fire('time', this._time); // This is for the case that the timeline was seeked so that the time\n // is now before the startTime of the runner. Thats why we need to set\n // the runner to position 0\n // FIXME:\n // However, reseting in insertion order leads to bugs. Considering the case,\n // where 2 runners change the same attribute but in different times,\n // reseting both of them will lead to the case where the later defined\n // runner always wins the reset even if the other runner started earlier\n // and therefore should win the attribute battle\n // this can be solved by reseting them backwards\n\n for (let k = this._runners.length; k--;) {\n // Get and run the current runner and ignore it if its inactive\n const runnerInfo = this._runners[k];\n const runner = runnerInfo.runner; // Make sure that we give the actual difference\n // between runner start time and now\n\n const dtToStart = this._time - runnerInfo.start; // Dont run runner if not started yet\n // and try to reset it\n\n if (dtToStart <= 0) {\n runner.reset();\n }\n } // Run all of the runners directly\n\n\n let runnersLeft = false;\n\n for (let i = 0, len = this._runners.length; i < len; i++) {\n // Get and run the current runner and ignore it if its inactive\n const runnerInfo = this._runners[i];\n const runner = runnerInfo.runner;\n let dt = dtTime; // Make sure that we give the actual difference\n // between runner start time and now\n\n const dtToStart = this._time - runnerInfo.start; // Dont run runner if not started yet\n\n if (dtToStart <= 0) {\n runnersLeft = true;\n continue;\n } else if (dtToStart < dt) {\n // Adjust dt to make sure that animation is on point\n dt = dtToStart;\n }\n\n if (!runner.active()) continue; // If this runner is still going, signal that we need another animation\n // frame, otherwise, remove the completed runner\n\n const finished = runner.step(dt).done;\n\n if (!finished) {\n runnersLeft = true; // continue\n } else if (runnerInfo.persist !== true) {\n // runner is finished. And runner might get removed\n const endTime = runner.duration() - runner.time() + this._time;\n\n if (endTime + runnerInfo.persist < this._time) {\n // Delete runner and correct index\n runner.unschedule();\n --i;\n --len;\n }\n }\n } // Basically: we continue when there are runners right from us in time\n // when -->, and when runners are left from us when <--\n\n\n if (runnersLeft && !(this._speed < 0 && this._time === 0) || this._runnerIds.length && this._speed < 0 && this._time > 0) {\n this._continue();\n } else {\n this.pause();\n this.fire('finished');\n }\n\n return this;\n }\n\n}\nregisterMethods({\n Element: {\n timeline: function (timeline) {\n if (timeline == null) {\n this._timeline = this._timeline || new Timeline();\n return this._timeline;\n } else {\n this._timeline = timeline;\n return this;\n }\n }\n }\n});\n\nclass Runner extends EventTarget {\n constructor(options) {\n super(); // Store a unique id on the runner, so that we can identify it later\n\n this.id = Runner.id++; // Ensure a default value\n\n options = options == null ? timeline.duration : options; // Ensure that we get a controller\n\n options = typeof options === 'function' ? new Controller(options) : options; // Declare all of the variables\n\n this._element = null;\n this._timeline = null;\n this.done = false;\n this._queue = []; // Work out the stepper and the duration\n\n this._duration = typeof options === 'number' && options;\n this._isDeclarative = options instanceof Controller;\n this._stepper = this._isDeclarative ? options : new Ease(); // We copy the current values from the timeline because they can change\n\n this._history = {}; // Store the state of the runner\n\n this.enabled = true;\n this._time = 0;\n this._lastTime = 0; // At creation, the runner is in reseted state\n\n this._reseted = true; // Save transforms applied to this runner\n\n this.transforms = new Matrix();\n this.transformId = 1; // Looping variables\n\n this._haveReversed = false;\n this._reverse = false;\n this._loopsDone = 0;\n this._swing = false;\n this._wait = 0;\n this._times = 1;\n this._frameId = null; // Stores how long a runner is stored after beeing done\n\n this._persist = this._isDeclarative ? true : null;\n }\n\n static sanitise(duration, delay, when) {\n // Initialise the default parameters\n let times = 1;\n let swing = false;\n let wait = 0;\n duration = duration || timeline.duration;\n delay = delay || timeline.delay;\n when = when || 'last'; // If we have an object, unpack the values\n\n if (typeof duration === 'object' && !(duration instanceof Stepper)) {\n delay = duration.delay || delay;\n when = duration.when || when;\n swing = duration.swing || swing;\n times = duration.times || times;\n wait = duration.wait || wait;\n duration = duration.duration || timeline.duration;\n }\n\n return {\n duration: duration,\n delay: delay,\n swing: swing,\n times: times,\n wait: wait,\n when: when\n };\n }\n\n active(enabled) {\n if (enabled == null) return this.enabled;\n this.enabled = enabled;\n return this;\n }\n /*\r\n Private Methods\r\n ===============\r\n Methods that shouldn't be used externally\r\n */\n\n\n addTransform(transform, index) {\n this.transforms.lmultiplyO(transform);\n return this;\n }\n\n after(fn) {\n return this.on('finished', fn);\n }\n\n animate(duration, delay, when) {\n const o = Runner.sanitise(duration, delay, when);\n const runner = new Runner(o.duration);\n if (this._timeline) runner.timeline(this._timeline);\n if (this._element) runner.element(this._element);\n return runner.loop(o).schedule(o.delay, o.when);\n }\n\n clearTransform() {\n this.transforms = new Matrix();\n return this;\n } // TODO: Keep track of all transformations so that deletion is faster\n\n\n clearTransformsFromQueue() {\n if (!this.done || !this._timeline || !this._timeline._runnerIds.includes(this.id)) {\n this._queue = this._queue.filter(item => {\n return !item.isTransform;\n });\n }\n }\n\n delay(delay) {\n return this.animate(0, delay);\n }\n\n duration() {\n return this._times * (this._wait + this._duration) - this._wait;\n }\n\n during(fn) {\n return this.queue(null, fn);\n }\n\n ease(fn) {\n this._stepper = new Ease(fn);\n return this;\n }\n /*\r\n Runner Definitions\r\n ==================\r\n These methods help us define the runtime behaviour of the Runner or they\r\n help us make new runners from the current runner\r\n */\n\n\n element(element) {\n if (element == null) return this._element;\n this._element = element;\n\n element._prepareRunner();\n\n return this;\n }\n\n finish() {\n return this.step(Infinity);\n }\n\n loop(times, swing, wait) {\n // Deal with the user passing in an object\n if (typeof times === 'object') {\n swing = times.swing;\n wait = times.wait;\n times = times.times;\n } // Sanitise the values and store them\n\n\n this._times = times || Infinity;\n this._swing = swing || false;\n this._wait = wait || 0; // Allow true to be passed\n\n if (this._times === true) {\n this._times = Infinity;\n }\n\n return this;\n }\n\n loops(p) {\n const loopDuration = this._duration + this._wait;\n\n if (p == null) {\n const loopsDone = Math.floor(this._time / loopDuration);\n const relativeTime = this._time - loopsDone * loopDuration;\n const position = relativeTime / this._duration;\n return Math.min(loopsDone + position, this._times);\n }\n\n const whole = Math.floor(p);\n const partial = p % 1;\n const time = loopDuration * whole + this._duration * partial;\n return this.time(time);\n }\n\n persist(dtOrForever) {\n if (dtOrForever == null) return this._persist;\n this._persist = dtOrForever;\n return this;\n }\n\n position(p) {\n // Get all of the variables we need\n const x = this._time;\n const d = this._duration;\n const w = this._wait;\n const t = this._times;\n const s = this._swing;\n const r = this._reverse;\n let position;\n\n if (p == null) {\n /*\r\n This function converts a time to a position in the range [0, 1]\r\n The full explanation can be found in this desmos demonstration\r\n https://www.desmos.com/calculator/u4fbavgche\r\n The logic is slightly simplified here because we can use booleans\r\n */\n // Figure out the value without thinking about the start or end time\n const f = function (x) {\n const swinging = s * Math.floor(x % (2 * (w + d)) / (w + d));\n const backwards = swinging && !r || !swinging && r;\n const uncliped = Math.pow(-1, backwards) * (x % (w + d)) / d + backwards;\n const clipped = Math.max(Math.min(uncliped, 1), 0);\n return clipped;\n }; // Figure out the value by incorporating the start time\n\n\n const endTime = t * (w + d) - w;\n position = x <= 0 ? Math.round(f(1e-5)) : x < endTime ? f(x) : Math.round(f(endTime - 1e-5));\n return position;\n } // Work out the loops done and add the position to the loops done\n\n\n const loopsDone = Math.floor(this.loops());\n const swingForward = s && loopsDone % 2 === 0;\n const forwards = swingForward && !r || r && swingForward;\n position = loopsDone + (forwards ? p : 1 - p);\n return this.loops(position);\n }\n\n progress(p) {\n if (p == null) {\n return Math.min(1, this._time / this.duration());\n }\n\n return this.time(p * this.duration());\n }\n /*\r\n Basic Functionality\r\n ===================\r\n These methods allow us to attach basic functions to the runner directly\r\n */\n\n\n queue(initFn, runFn, retargetFn, isTransform) {\n this._queue.push({\n initialiser: initFn || noop,\n runner: runFn || noop,\n retarget: retargetFn,\n isTransform: isTransform,\n initialised: false,\n finished: false\n });\n\n const timeline = this.timeline();\n timeline && this.timeline()._continue();\n return this;\n }\n\n reset() {\n if (this._reseted) return this;\n this.time(0);\n this._reseted = true;\n return this;\n }\n\n reverse(reverse) {\n this._reverse = reverse == null ? !this._reverse : reverse;\n return this;\n }\n\n schedule(timeline, delay, when) {\n // The user doesn't need to pass a timeline if we already have one\n if (!(timeline instanceof Timeline)) {\n when = delay;\n delay = timeline;\n timeline = this.timeline();\n } // If there is no timeline, yell at the user...\n\n\n if (!timeline) {\n throw Error('Runner cannot be scheduled without timeline');\n } // Schedule the runner on the timeline provided\n\n\n timeline.schedule(this, delay, when);\n return this;\n }\n\n step(dt) {\n // If we are inactive, this stepper just gets skipped\n if (!this.enabled) return this; // Update the time and get the new position\n\n dt = dt == null ? 16 : dt;\n this._time += dt;\n const position = this.position(); // Figure out if we need to run the stepper in this frame\n\n const running = this._lastPosition !== position && this._time >= 0;\n this._lastPosition = position; // Figure out if we just started\n\n const duration = this.duration();\n const justStarted = this._lastTime <= 0 && this._time > 0;\n const justFinished = this._lastTime < duration && this._time >= duration;\n this._lastTime = this._time;\n\n if (justStarted) {\n this.fire('start', this);\n } // Work out if the runner is finished set the done flag here so animations\n // know, that they are running in the last step (this is good for\n // transformations which can be merged)\n\n\n const declarative = this._isDeclarative;\n this.done = !declarative && !justFinished && this._time >= duration; // Runner is running. So its not in reseted state anymore\n\n this._reseted = false;\n let converged = false; // Call initialise and the run function\n\n if (running || declarative) {\n this._initialise(running); // clear the transforms on this runner so they dont get added again and again\n\n\n this.transforms = new Matrix();\n converged = this._run(declarative ? dt : position);\n this.fire('step', this);\n } // correct the done flag here\n // declaritive animations itself know when they converged\n\n\n this.done = this.done || converged && declarative;\n\n if (justFinished) {\n this.fire('finished', this);\n }\n\n return this;\n }\n /*\r\n Runner animation methods\r\n ========================\r\n Control how the animation plays\r\n */\n\n\n time(time) {\n if (time == null) {\n return this._time;\n }\n\n const dt = time - this._time;\n this.step(dt);\n return this;\n }\n\n timeline(timeline) {\n // check explicitly for undefined so we can set the timeline to null\n if (typeof timeline === 'undefined') return this._timeline;\n this._timeline = timeline;\n return this;\n }\n\n unschedule() {\n const timeline = this.timeline();\n timeline && timeline.unschedule(this);\n return this;\n } // Run each initialise function in the runner if required\n\n\n _initialise(running) {\n // If we aren't running, we shouldn't initialise when not declarative\n if (!running && !this._isDeclarative) return; // Loop through all of the initialisers\n\n for (let i = 0, len = this._queue.length; i < len; ++i) {\n // Get the current initialiser\n const current = this._queue[i]; // Determine whether we need to initialise\n\n const needsIt = this._isDeclarative || !current.initialised && running;\n running = !current.finished; // Call the initialiser if we need to\n\n if (needsIt && running) {\n current.initialiser.call(this);\n current.initialised = true;\n }\n }\n } // Save a morpher to the morpher list so that we can retarget it later\n\n\n _rememberMorpher(method, morpher) {\n this._history[method] = {\n morpher: morpher,\n caller: this._queue[this._queue.length - 1]\n }; // We have to resume the timeline in case a controller\n // is already done without being ever run\n // This can happen when e.g. this is done:\n // anim = el.animate(new SVG.Spring)\n // and later\n // anim.move(...)\n\n if (this._isDeclarative) {\n const timeline = this.timeline();\n timeline && timeline.play();\n }\n } // Try to set the target for a morpher if the morpher exists, otherwise\n // Run each run function for the position or dt given\n\n\n _run(positionOrDt) {\n // Run all of the _queue directly\n let allfinished = true;\n\n for (let i = 0, len = this._queue.length; i < len; ++i) {\n // Get the current function to run\n const current = this._queue[i]; // Run the function if its not finished, we keep track of the finished\n // flag for the sake of declarative _queue\n\n const converged = current.runner.call(this, positionOrDt);\n current.finished = current.finished || converged === true;\n allfinished = allfinished && current.finished;\n } // We report when all of the constructors are finished\n\n\n return allfinished;\n } // do nothing and return false\n\n\n _tryRetarget(method, target, extra) {\n if (this._history[method]) {\n // if the last method wasnt even initialised, throw it away\n if (!this._history[method].caller.initialised) {\n const index = this._queue.indexOf(this._history[method].caller);\n\n this._queue.splice(index, 1);\n\n return false;\n } // for the case of transformations, we use the special retarget function\n // which has access to the outer scope\n\n\n if (this._history[method].caller.retarget) {\n this._history[method].caller.retarget.call(this, target, extra); // for everything else a simple morpher change is sufficient\n\n } else {\n this._history[method].morpher.to(target);\n }\n\n this._history[method].caller.finished = false;\n const timeline = this.timeline();\n timeline && timeline.play();\n return true;\n }\n\n return false;\n }\n\n}\nRunner.id = 0;\nclass FakeRunner {\n constructor(transforms = new Matrix(), id = -1, done = true) {\n this.transforms = transforms;\n this.id = id;\n this.done = done;\n }\n\n clearTransformsFromQueue() {}\n\n}\nextend([Runner, FakeRunner], {\n mergeWith(runner) {\n return new FakeRunner(runner.transforms.lmultiply(this.transforms), runner.id);\n }\n\n}); // FakeRunner.emptyRunner = new FakeRunner()\n\nconst lmultiply = (last, curr) => last.lmultiplyO(curr);\n\nconst getRunnerTransform = runner => runner.transforms;\n\nfunction mergeTransforms() {\n // Find the matrix to apply to the element and apply it\n const runners = this._transformationRunners.runners;\n const netTransform = runners.map(getRunnerTransform).reduce(lmultiply, new Matrix());\n this.transform(netTransform);\n\n this._transformationRunners.merge();\n\n if (this._transformationRunners.length() === 1) {\n this._frameId = null;\n }\n}\n\nclass RunnerArray {\n constructor() {\n this.runners = [];\n this.ids = [];\n }\n\n add(runner) {\n if (this.runners.includes(runner)) return;\n const id = runner.id + 1;\n this.runners.push(runner);\n this.ids.push(id);\n return this;\n }\n\n clearBefore(id) {\n const deleteCnt = this.ids.indexOf(id + 1) || 1;\n this.ids.splice(0, deleteCnt, 0);\n this.runners.splice(0, deleteCnt, new FakeRunner()).forEach(r => r.clearTransformsFromQueue());\n return this;\n }\n\n edit(id, newRunner) {\n const index = this.ids.indexOf(id + 1);\n this.ids.splice(index, 1, id + 1);\n this.runners.splice(index, 1, newRunner);\n return this;\n }\n\n getByID(id) {\n return this.runners[this.ids.indexOf(id + 1)];\n }\n\n length() {\n return this.ids.length;\n }\n\n merge() {\n let lastRunner = null;\n\n for (let i = 0; i < this.runners.length; ++i) {\n const runner = this.runners[i];\n const condition = lastRunner && runner.done && lastRunner.done // don't merge runner when persisted on timeline\n && (!runner._timeline || !runner._timeline._runnerIds.includes(runner.id)) && (!lastRunner._timeline || !lastRunner._timeline._runnerIds.includes(lastRunner.id));\n\n if (condition) {\n // the +1 happens in the function\n this.remove(runner.id);\n const newRunner = runner.mergeWith(lastRunner);\n this.edit(lastRunner.id, newRunner);\n lastRunner = newRunner;\n --i;\n } else {\n lastRunner = runner;\n }\n }\n\n return this;\n }\n\n remove(id) {\n const index = this.ids.indexOf(id + 1);\n this.ids.splice(index, 1);\n this.runners.splice(index, 1);\n return this;\n }\n\n}\nregisterMethods({\n Element: {\n animate(duration, delay, when) {\n const o = Runner.sanitise(duration, delay, when);\n const timeline = this.timeline();\n return new Runner(o.duration).loop(o).element(this).timeline(timeline.play()).schedule(o.delay, o.when);\n },\n\n delay(by, when) {\n return this.animate(0, by, when);\n },\n\n // this function searches for all runners on the element and deletes the ones\n // which run before the current one. This is because absolute transformations\n // overwfrite anything anyway so there is no need to waste time computing\n // other runners\n _clearTransformRunnersBefore(currentRunner) {\n this._transformationRunners.clearBefore(currentRunner.id);\n },\n\n _currentTransform(current) {\n return this._transformationRunners.runners // we need the equal sign here to make sure, that also transformations\n // on the same runner which execute before the current transformation are\n // taken into account\n .filter(runner => runner.id <= current.id).map(getRunnerTransform).reduce(lmultiply, new Matrix());\n },\n\n _addRunner(runner) {\n this._transformationRunners.add(runner); // Make sure that the runner merge is executed at the very end of\n // all Animator functions. Thats why we use immediate here to execute\n // the merge right after all frames are run\n\n\n Animator.cancelImmediate(this._frameId);\n this._frameId = Animator.immediate(mergeTransforms.bind(this));\n },\n\n _prepareRunner() {\n if (this._frameId == null) {\n this._transformationRunners = new RunnerArray().add(new FakeRunner(new Matrix(this)));\n }\n }\n\n }\n}); // Will output the elements from array A that are not in the array B\n\nconst difference = (a, b) => a.filter(x => !b.includes(x));\n\nextend(Runner, {\n attr(a, v) {\n return this.styleAttr('attr', a, v);\n },\n\n // Add animatable styles\n css(s, v) {\n return this.styleAttr('css', s, v);\n },\n\n styleAttr(type, nameOrAttrs, val) {\n if (typeof nameOrAttrs === 'string') {\n return this.styleAttr(type, {\n [nameOrAttrs]: val\n });\n }\n\n let attrs = nameOrAttrs;\n if (this._tryRetarget(type, attrs)) return this;\n let morpher = new Morphable(this._stepper).to(attrs);\n let keys = Object.keys(attrs);\n this.queue(function () {\n morpher = morpher.from(this.element()[type](keys));\n }, function (pos) {\n this.element()[type](morpher.at(pos).valueOf());\n return morpher.done();\n }, function (newToAttrs) {\n // Check if any new keys were added\n const newKeys = Object.keys(newToAttrs);\n const differences = difference(newKeys, keys); // If their are new keys, initialize them and add them to morpher\n\n if (differences.length) {\n // Get the values\n const addedFromAttrs = this.element()[type](differences); // Get the already initialized values\n\n const oldFromAttrs = new ObjectBag(morpher.from()).valueOf(); // Merge old and new\n\n Object.assign(oldFromAttrs, addedFromAttrs);\n morpher.from(oldFromAttrs);\n } // Get the object from the morpher\n\n\n const oldToAttrs = new ObjectBag(morpher.to()).valueOf(); // Merge in new attributes\n\n Object.assign(oldToAttrs, newToAttrs); // Change morpher target\n\n morpher.to(oldToAttrs); // Make sure that we save the work we did so we don't need it to do again\n\n keys = newKeys;\n attrs = newToAttrs;\n });\n\n this._rememberMorpher(type, morpher);\n\n return this;\n },\n\n zoom(level, point) {\n if (this._tryRetarget('zoom', level, point)) return this;\n let morpher = new Morphable(this._stepper).to(new SVGNumber(level));\n this.queue(function () {\n morpher = morpher.from(this.element().zoom());\n }, function (pos) {\n this.element().zoom(morpher.at(pos), point);\n return morpher.done();\n }, function (newLevel, newPoint) {\n point = newPoint;\n morpher.to(newLevel);\n });\n\n this._rememberMorpher('zoom', morpher);\n\n return this;\n },\n\n /**\r\n ** absolute transformations\r\n **/\n //\n // M v -----|-----(D M v = F v)------|-----> T v\n //\n // 1. define the final state (T) and decompose it (once)\n // t = [tx, ty, the, lam, sy, sx]\n // 2. on every frame: pull the current state of all previous transforms\n // (M - m can change)\n // and then write this as m = [tx0, ty0, the0, lam0, sy0, sx0]\n // 3. Find the interpolated matrix F(pos) = m + pos * (t - m)\n // - Note F(0) = M\n // - Note F(1) = T\n // 4. Now you get the delta matrix as a result: D = F * inv(M)\n transform(transforms, relative, affine) {\n // If we have a declarative function, we should retarget it if possible\n relative = transforms.relative || relative;\n\n if (this._isDeclarative && !relative && this._tryRetarget('transform', transforms)) {\n return this;\n } // Parse the parameters\n\n\n const isMatrix = Matrix.isMatrixLike(transforms);\n affine = transforms.affine != null ? transforms.affine : affine != null ? affine : !isMatrix; // Create a morepher and set its type\n\n const morpher = new Morphable(this._stepper).type(affine ? TransformBag : Matrix);\n let origin;\n let element;\n let current;\n let currentAngle;\n let startTransform;\n\n function setup() {\n // make sure element and origin is defined\n element = element || this.element();\n origin = origin || getOrigin(transforms, element);\n startTransform = new Matrix(relative ? undefined : element); // add the runner to the element so it can merge transformations\n\n element._addRunner(this); // Deactivate all transforms that have run so far if we are absolute\n\n\n if (!relative) {\n element._clearTransformRunnersBefore(this);\n }\n }\n\n function run(pos) {\n // clear all other transforms before this in case something is saved\n // on this runner. We are absolute. We dont need these!\n if (!relative) this.clearTransform();\n const {\n x,\n y\n } = new Point(origin).transform(element._currentTransform(this));\n let target = new Matrix({ ...transforms,\n origin: [x, y]\n });\n let start = this._isDeclarative && current ? current : startTransform;\n\n if (affine) {\n target = target.decompose(x, y);\n start = start.decompose(x, y); // Get the current and target angle as it was set\n\n const rTarget = target.rotate;\n const rCurrent = start.rotate; // Figure out the shortest path to rotate directly\n\n const possibilities = [rTarget - 360, rTarget, rTarget + 360];\n const distances = possibilities.map(a => Math.abs(a - rCurrent));\n const shortest = Math.min(...distances);\n const index = distances.indexOf(shortest);\n target.rotate = possibilities[index];\n }\n\n if (relative) {\n // we have to be careful here not to overwrite the rotation\n // with the rotate method of Matrix\n if (!isMatrix) {\n target.rotate = transforms.rotate || 0;\n }\n\n if (this._isDeclarative && currentAngle) {\n start.rotate = currentAngle;\n }\n }\n\n morpher.from(start);\n morpher.to(target);\n const affineParameters = morpher.at(pos);\n currentAngle = affineParameters.rotate;\n current = new Matrix(affineParameters);\n this.addTransform(current);\n\n element._addRunner(this);\n\n return morpher.done();\n }\n\n function retarget(newTransforms) {\n // only get a new origin if it changed since the last call\n if ((newTransforms.origin || 'center').toString() !== (transforms.origin || 'center').toString()) {\n origin = getOrigin(newTransforms, element);\n } // overwrite the old transformations with the new ones\n\n\n transforms = { ...newTransforms,\n origin\n };\n }\n\n this.queue(setup, run, retarget, true);\n this._isDeclarative && this._rememberMorpher('transform', morpher);\n return this;\n },\n\n // Animatable x-axis\n x(x, relative) {\n return this._queueNumber('x', x);\n },\n\n // Animatable y-axis\n y(y) {\n return this._queueNumber('y', y);\n },\n\n dx(x = 0) {\n return this._queueNumberDelta('x', x);\n },\n\n dy(y = 0) {\n return this._queueNumberDelta('y', y);\n },\n\n dmove(x, y) {\n return this.dx(x).dy(y);\n },\n\n _queueNumberDelta(method, to) {\n to = new SVGNumber(to); // Try to change the target if we have this method already registerd\n\n if (this._tryRetarget(method, to)) return this; // Make a morpher and queue the animation\n\n const morpher = new Morphable(this._stepper).to(to);\n let from = null;\n this.queue(function () {\n from = this.element()[method]();\n morpher.from(from);\n morpher.to(from + to);\n }, function (pos) {\n this.element()[method](morpher.at(pos));\n return morpher.done();\n }, function (newTo) {\n morpher.to(from + new SVGNumber(newTo));\n }); // Register the morpher so that if it is changed again, we can retarget it\n\n this._rememberMorpher(method, morpher);\n\n return this;\n },\n\n _queueObject(method, to) {\n // Try to change the target if we have this method already registerd\n if (this._tryRetarget(method, to)) return this; // Make a morpher and queue the animation\n\n const morpher = new Morphable(this._stepper).to(to);\n this.queue(function () {\n morpher.from(this.element()[method]());\n }, function (pos) {\n this.element()[method](morpher.at(pos));\n return morpher.done();\n }); // Register the morpher so that if it is changed again, we can retarget it\n\n this._rememberMorpher(method, morpher);\n\n return this;\n },\n\n _queueNumber(method, value) {\n return this._queueObject(method, new SVGNumber(value));\n },\n\n // Animatable center x-axis\n cx(x) {\n return this._queueNumber('cx', x);\n },\n\n // Animatable center y-axis\n cy(y) {\n return this._queueNumber('cy', y);\n },\n\n // Add animatable move\n move(x, y) {\n return this.x(x).y(y);\n },\n\n // Add animatable center\n center(x, y) {\n return this.cx(x).cy(y);\n },\n\n // Add animatable size\n size(width, height) {\n // animate bbox based size for all other elements\n let box;\n\n if (!width || !height) {\n box = this._element.bbox();\n }\n\n if (!width) {\n width = box.width / box.height * height;\n }\n\n if (!height) {\n height = box.height / box.width * width;\n }\n\n return this.width(width).height(height);\n },\n\n // Add animatable width\n width(width) {\n return this._queueNumber('width', width);\n },\n\n // Add animatable height\n height(height) {\n return this._queueNumber('height', height);\n },\n\n // Add animatable plot\n plot(a, b, c, d) {\n // Lines can be plotted with 4 arguments\n if (arguments.length === 4) {\n return this.plot([a, b, c, d]);\n }\n\n if (this._tryRetarget('plot', a)) return this;\n const morpher = new Morphable(this._stepper).type(this._element.MorphArray).to(a);\n this.queue(function () {\n morpher.from(this._element.array());\n }, function (pos) {\n this._element.plot(morpher.at(pos));\n\n return morpher.done();\n });\n\n this._rememberMorpher('plot', morpher);\n\n return this;\n },\n\n // Add leading method\n leading(value) {\n return this._queueNumber('leading', value);\n },\n\n // Add animatable viewbox\n viewbox(x, y, width, height) {\n return this._queueObject('viewbox', new Box(x, y, width, height));\n },\n\n update(o) {\n if (typeof o !== 'object') {\n return this.update({\n offset: arguments[0],\n color: arguments[1],\n opacity: arguments[2]\n });\n }\n\n if (o.opacity != null) this.attr('stop-opacity', o.opacity);\n if (o.color != null) this.attr('stop-color', o.color);\n if (o.offset != null) this.attr('offset', o.offset);\n return this;\n }\n\n});\nextend(Runner, {\n rx,\n ry,\n from,\n to\n});\nregister(Runner, 'Runner');\n\nclass Svg extends Container {\n constructor(node, attrs = node) {\n super(nodeOrNew('svg', node), attrs);\n this.namespace();\n } // Creates and returns defs element\n\n\n defs() {\n if (!this.isRoot()) return this.root().defs();\n return adopt(this.node.querySelector('defs')) || this.put(new Defs());\n }\n\n isRoot() {\n return !this.node.parentNode || !(this.node.parentNode instanceof globals.window.SVGElement) && this.node.parentNode.nodeName !== '#document-fragment';\n } // Add namespaces\n\n\n namespace() {\n if (!this.isRoot()) return this.root().namespace();\n return this.attr({\n xmlns: svg,\n version: '1.1'\n }).attr('xmlns:xlink', xlink, xmlns).attr('xmlns:svgjs', svgjs, xmlns);\n }\n\n removeNamespace() {\n return this.attr({\n xmlns: null,\n version: null\n }).attr('xmlns:xlink', null, xmlns).attr('xmlns:svgjs', null, xmlns);\n } // Check if this is a root svg\n // If not, call root() from this element\n\n\n root() {\n if (this.isRoot()) return this;\n return super.root();\n }\n\n}\nregisterMethods({\n Container: {\n // Create nested svg document\n nested: wrapWithAttrCheck(function () {\n return this.put(new Svg());\n })\n }\n});\nregister(Svg, 'Svg', true);\n\nclass Symbol extends Container {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('symbol', node), attrs);\n }\n\n}\nregisterMethods({\n Container: {\n symbol: wrapWithAttrCheck(function () {\n return this.put(new Symbol());\n })\n }\n});\nregister(Symbol, 'Symbol');\n\nfunction plain(text) {\n // clear if build mode is disabled\n if (this._build === false) {\n this.clear();\n } // create text node\n\n\n this.node.appendChild(globals.document.createTextNode(text));\n return this;\n} // Get length of text element\n\nfunction length() {\n return this.node.getComputedTextLength();\n} // Move over x-axis\n// Text is moved by its bounding box\n// text-anchor does NOT matter\n\nfunction x$1(x, box = this.bbox()) {\n if (x == null) {\n return box.x;\n }\n\n return this.attr('x', this.attr('x') + x - box.x);\n} // Move over y-axis\n\nfunction y$1(y, box = this.bbox()) {\n if (y == null) {\n return box.y;\n }\n\n return this.attr('y', this.attr('y') + y - box.y);\n}\nfunction move$1(x, y, box = this.bbox()) {\n return this.x(x, box).y(y, box);\n} // Move center over x-axis\n\nfunction cx(x, box = this.bbox()) {\n if (x == null) {\n return box.cx;\n }\n\n return this.attr('x', this.attr('x') + x - box.cx);\n} // Move center over y-axis\n\nfunction cy(y, box = this.bbox()) {\n if (y == null) {\n return box.cy;\n }\n\n return this.attr('y', this.attr('y') + y - box.cy);\n}\nfunction center(x, y, box = this.bbox()) {\n return this.cx(x, box).cy(y, box);\n}\nfunction ax(x) {\n return this.attr('x', x);\n}\nfunction ay(y) {\n return this.attr('y', y);\n}\nfunction amove(x, y) {\n return this.ax(x).ay(y);\n} // Enable / disable build mode\n\nfunction build(build) {\n this._build = !!build;\n return this;\n}\n\nvar textable = {\n __proto__: null,\n plain: plain,\n length: length,\n x: x$1,\n y: y$1,\n move: move$1,\n cx: cx,\n cy: cy,\n center: center,\n ax: ax,\n ay: ay,\n amove: amove,\n build: build\n};\n\nclass Text extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('text', node), attrs);\n this.dom.leading = new SVGNumber(1.3); // store leading value for rebuilding\n\n this._rebuild = true; // enable automatic updating of dy values\n\n this._build = false; // disable build mode for adding multiple lines\n } // Set / get leading\n\n\n leading(value) {\n // act as getter\n if (value == null) {\n return this.dom.leading;\n } // act as setter\n\n\n this.dom.leading = new SVGNumber(value);\n return this.rebuild();\n } // Rebuild appearance type\n\n\n rebuild(rebuild) {\n // store new rebuild flag if given\n if (typeof rebuild === 'boolean') {\n this._rebuild = rebuild;\n } // define position of all lines\n\n\n if (this._rebuild) {\n const self = this;\n let blankLineOffset = 0;\n const leading = this.dom.leading;\n this.each(function (i) {\n const fontSize = globals.window.getComputedStyle(this.node).getPropertyValue('font-size');\n const dy = leading * new SVGNumber(fontSize);\n\n if (this.dom.newLined) {\n this.attr('x', self.attr('x'));\n\n if (this.text() === '\\n') {\n blankLineOffset += dy;\n } else {\n this.attr('dy', i ? dy + blankLineOffset : 0);\n blankLineOffset = 0;\n }\n }\n });\n this.fire('rebuild');\n }\n\n return this;\n } // overwrite method from parent to set data properly\n\n\n setData(o) {\n this.dom = o;\n this.dom.leading = new SVGNumber(o.leading || 1.3);\n return this;\n } // Set the text content\n\n\n text(text) {\n // act as getter\n if (text === undefined) {\n const children = this.node.childNodes;\n let firstLine = 0;\n text = '';\n\n for (let i = 0, len = children.length; i < len; ++i) {\n // skip textPaths - they are no lines\n if (children[i].nodeName === 'textPath') {\n if (i === 0) firstLine = 1;\n continue;\n } // add newline if its not the first child and newLined is set to true\n\n\n if (i !== firstLine && children[i].nodeType !== 3 && adopt(children[i]).dom.newLined === true) {\n text += '\\n';\n } // add content of this node\n\n\n text += children[i].textContent;\n }\n\n return text;\n } // remove existing content\n\n\n this.clear().build(true);\n\n if (typeof text === 'function') {\n // call block\n text.call(this, this);\n } else {\n // store text and make sure text is not blank\n text = (text + '').split('\\n'); // build new lines\n\n for (let j = 0, jl = text.length; j < jl; j++) {\n this.newLine(text[j]);\n }\n } // disable build mode and rebuild lines\n\n\n return this.build(false).rebuild();\n }\n\n}\nextend(Text, textable);\nregisterMethods({\n Container: {\n // Create text element\n text: wrapWithAttrCheck(function (text = '') {\n return this.put(new Text()).text(text);\n }),\n // Create plain text element\n plain: wrapWithAttrCheck(function (text = '') {\n return this.put(new Text()).plain(text);\n })\n }\n});\nregister(Text, 'Text');\n\nclass Tspan extends Shape {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('tspan', node), attrs);\n this._build = false; // disable build mode for adding multiple lines\n } // Shortcut dx\n\n\n dx(dx) {\n return this.attr('dx', dx);\n } // Shortcut dy\n\n\n dy(dy) {\n return this.attr('dy', dy);\n } // Create new line\n\n\n newLine() {\n // mark new line\n this.dom.newLined = true; // fetch parent\n\n const text = this.parent(); // early return in case we are not in a text element\n\n if (!(text instanceof Text)) {\n return this;\n }\n\n const i = text.index(this);\n const fontSize = globals.window.getComputedStyle(this.node).getPropertyValue('font-size');\n const dy = text.dom.leading * new SVGNumber(fontSize); // apply new position\n\n return this.dy(i ? dy : 0).attr('x', text.x());\n } // Set text content\n\n\n text(text) {\n if (text == null) return this.node.textContent + (this.dom.newLined ? '\\n' : '');\n\n if (typeof text === 'function') {\n this.clear().build(true);\n text.call(this, this);\n this.build(false);\n } else {\n this.plain(text);\n }\n\n return this;\n }\n\n}\nextend(Tspan, textable);\nregisterMethods({\n Tspan: {\n tspan: wrapWithAttrCheck(function (text = '') {\n const tspan = new Tspan(); // clear if build mode is disabled\n\n if (!this._build) {\n this.clear();\n } // add new tspan\n\n\n return this.put(tspan).text(text);\n })\n },\n Text: {\n newLine: function (text = '') {\n return this.tspan(text).newLine();\n }\n }\n});\nregister(Tspan, 'Tspan');\n\nclass Circle extends Shape {\n constructor(node, attrs = node) {\n super(nodeOrNew('circle', node), attrs);\n }\n\n radius(r) {\n return this.attr('r', r);\n } // Radius x value\n\n\n rx(rx) {\n return this.attr('r', rx);\n } // Alias radius x value\n\n\n ry(ry) {\n return this.rx(ry);\n }\n\n size(size) {\n return this.radius(new SVGNumber(size).divide(2));\n }\n\n}\nextend(Circle, {\n x: x$3,\n y: y$3,\n cx: cx$1,\n cy: cy$1,\n width: width$2,\n height: height$2\n});\nregisterMethods({\n Container: {\n // Create circle element\n circle: wrapWithAttrCheck(function (size = 0) {\n return this.put(new Circle()).size(size).move(0, 0);\n })\n }\n});\nregister(Circle, 'Circle');\n\nclass ClipPath extends Container {\n constructor(node, attrs = node) {\n super(nodeOrNew('clipPath', node), attrs);\n } // Unclip all clipped elements and remove itself\n\n\n remove() {\n // unclip all targets\n this.targets().forEach(function (el) {\n el.unclip();\n }); // remove clipPath from parent\n\n return super.remove();\n }\n\n targets() {\n return baseFind('svg [clip-path*=\"' + this.id() + '\"]');\n }\n\n}\nregisterMethods({\n Container: {\n // Create clipping element\n clip: wrapWithAttrCheck(function () {\n return this.defs().put(new ClipPath());\n })\n },\n Element: {\n // Distribute clipPath to svg element\n clipper() {\n return this.reference('clip-path');\n },\n\n clipWith(element) {\n // use given clip or create a new one\n const clipper = element instanceof ClipPath ? element : this.parent().clip().add(element); // apply mask\n\n return this.attr('clip-path', 'url(\"#' + clipper.id() + '\")');\n },\n\n // Unclip element\n unclip() {\n return this.attr('clip-path', null);\n }\n\n }\n});\nregister(ClipPath, 'ClipPath');\n\nclass ForeignObject extends Element {\n constructor(node, attrs = node) {\n super(nodeOrNew('foreignObject', node), attrs);\n }\n\n}\nregisterMethods({\n Container: {\n foreignObject: wrapWithAttrCheck(function (width, height) {\n return this.put(new ForeignObject()).size(width, height);\n })\n }\n});\nregister(ForeignObject, 'ForeignObject');\n\nfunction dmove(dx, dy) {\n this.children().forEach((child, i) => {\n let bbox; // We have to wrap this for elements that dont have a bbox\n // e.g. title and other descriptive elements\n\n try {\n // Get the childs bbox\n bbox = child.bbox();\n } catch (e) {\n return;\n } // Get childs matrix\n\n\n const m = new Matrix(child); // Translate childs matrix by amount and\n // transform it back into parents space\n\n const matrix = m.translate(dx, dy).transform(m.inverse()); // Calculate new x and y from old box\n\n const p = new Point(bbox.x, bbox.y).transform(matrix); // Move element\n\n child.move(p.x, p.y);\n });\n return this;\n}\nfunction dx(dx) {\n return this.dmove(dx, 0);\n}\nfunction dy(dy) {\n return this.dmove(0, dy);\n}\nfunction height(height, box = this.bbox()) {\n if (height == null) return box.height;\n return this.size(box.width, height, box);\n}\nfunction move(x = 0, y = 0, box = this.bbox()) {\n const dx = x - box.x;\n const dy = y - box.y;\n return this.dmove(dx, dy);\n}\nfunction size(width, height, box = this.bbox()) {\n const p = proportionalSize(this, width, height, box);\n const scaleX = p.width / box.width;\n const scaleY = p.height / box.height;\n this.children().forEach((child, i) => {\n const o = new Point(box).transform(new Matrix(child).inverse());\n child.scale(scaleX, scaleY, o.x, o.y);\n });\n return this;\n}\nfunction width(width, box = this.bbox()) {\n if (width == null) return box.width;\n return this.size(width, box.height, box);\n}\nfunction x(x, box = this.bbox()) {\n if (x == null) return box.x;\n return this.move(x, box.y, box);\n}\nfunction y(y, box = this.bbox()) {\n if (y == null) return box.y;\n return this.move(box.x, y, box);\n}\n\nvar containerGeometry = {\n __proto__: null,\n dmove: dmove,\n dx: dx,\n dy: dy,\n height: height,\n move: move,\n size: size,\n width: width,\n x: x,\n y: y\n};\n\nclass G extends Container {\n constructor(node, attrs = node) {\n super(nodeOrNew('g', node), attrs);\n }\n\n}\nextend(G, containerGeometry);\nregisterMethods({\n Container: {\n // Create a group element\n group: wrapWithAttrCheck(function () {\n return this.put(new G());\n })\n }\n});\nregister(G, 'G');\n\nclass A extends Container {\n constructor(node, attrs = node) {\n super(nodeOrNew('a', node), attrs);\n } // Link target attribute\n\n\n target(target) {\n return this.attr('target', target);\n } // Link url\n\n\n to(url) {\n return this.attr('href', url, xlink);\n }\n\n}\nextend(A, containerGeometry);\nregisterMethods({\n Container: {\n // Create a hyperlink element\n link: wrapWithAttrCheck(function (url) {\n return this.put(new A()).to(url);\n })\n },\n Element: {\n unlink() {\n const link = this.linker();\n if (!link) return this;\n const parent = link.parent();\n\n if (!parent) {\n return this.remove();\n }\n\n const index = parent.index(link);\n parent.add(this, index);\n link.remove();\n return this;\n },\n\n linkTo(url) {\n // reuse old link if possible\n let link = this.linker();\n\n if (!link) {\n link = new A();\n this.wrap(link);\n }\n\n if (typeof url === 'function') {\n url.call(link, link);\n } else {\n link.to(url);\n }\n\n return this;\n },\n\n linker() {\n const link = this.parent();\n\n if (link && link.node.nodeName.toLowerCase() === 'a') {\n return link;\n }\n\n return null;\n }\n\n }\n});\nregister(A, 'A');\n\nclass Mask extends Container {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('mask', node), attrs);\n } // Unmask all masked elements and remove itself\n\n\n remove() {\n // unmask all targets\n this.targets().forEach(function (el) {\n el.unmask();\n }); // remove mask from parent\n\n return super.remove();\n }\n\n targets() {\n return baseFind('svg [mask*=\"' + this.id() + '\"]');\n }\n\n}\nregisterMethods({\n Container: {\n mask: wrapWithAttrCheck(function () {\n return this.defs().put(new Mask());\n })\n },\n Element: {\n // Distribute mask to svg element\n masker() {\n return this.reference('mask');\n },\n\n maskWith(element) {\n // use given mask or create a new one\n const masker = element instanceof Mask ? element : this.parent().mask().add(element); // apply mask\n\n return this.attr('mask', 'url(\"#' + masker.id() + '\")');\n },\n\n // Unmask element\n unmask() {\n return this.attr('mask', null);\n }\n\n }\n});\nregister(Mask, 'Mask');\n\nclass Stop extends Element {\n constructor(node, attrs = node) {\n super(nodeOrNew('stop', node), attrs);\n } // add color stops\n\n\n update(o) {\n if (typeof o === 'number' || o instanceof SVGNumber) {\n o = {\n offset: arguments[0],\n color: arguments[1],\n opacity: arguments[2]\n };\n } // set attributes\n\n\n if (o.opacity != null) this.attr('stop-opacity', o.opacity);\n if (o.color != null) this.attr('stop-color', o.color);\n if (o.offset != null) this.attr('offset', new SVGNumber(o.offset));\n return this;\n }\n\n}\nregisterMethods({\n Gradient: {\n // Add a color stop\n stop: function (offset, color, opacity) {\n return this.put(new Stop()).update(offset, color, opacity);\n }\n }\n});\nregister(Stop, 'Stop');\n\nfunction cssRule(selector, rule) {\n if (!selector) return '';\n if (!rule) return selector;\n let ret = selector + '{';\n\n for (const i in rule) {\n ret += unCamelCase(i) + ':' + rule[i] + ';';\n }\n\n ret += '}';\n return ret;\n}\n\nclass Style extends Element {\n constructor(node, attrs = node) {\n super(nodeOrNew('style', node), attrs);\n }\n\n addText(w = '') {\n this.node.textContent += w;\n return this;\n }\n\n font(name, src, params = {}) {\n return this.rule('@font-face', {\n fontFamily: name,\n src: src,\n ...params\n });\n }\n\n rule(selector, obj) {\n return this.addText(cssRule(selector, obj));\n }\n\n}\nregisterMethods('Dom', {\n style(selector, obj) {\n return this.put(new Style()).rule(selector, obj);\n },\n\n fontface(name, src, params) {\n return this.put(new Style()).font(name, src, params);\n }\n\n});\nregister(Style, 'Style');\n\nclass TextPath extends Text {\n // Initialize node\n constructor(node, attrs = node) {\n super(nodeOrNew('textPath', node), attrs);\n } // return the array of the path track element\n\n\n array() {\n const track = this.track();\n return track ? track.array() : null;\n } // Plot path if any\n\n\n plot(d) {\n const track = this.track();\n let pathArray = null;\n\n if (track) {\n pathArray = track.plot(d);\n }\n\n return d == null ? pathArray : this;\n } // Get the path element\n\n\n track() {\n return this.reference('href');\n }\n\n}\nregisterMethods({\n Container: {\n textPath: wrapWithAttrCheck(function (text, path) {\n // Convert text to instance if needed\n if (!(text instanceof Text)) {\n text = this.text(text);\n }\n\n return text.path(path);\n })\n },\n Text: {\n // Create path for text to run on\n path: wrapWithAttrCheck(function (track, importNodes = true) {\n const textPath = new TextPath(); // if track is a path, reuse it\n\n if (!(track instanceof Path)) {\n // create path element\n track = this.defs().path(track);\n } // link textPath to path and add content\n\n\n textPath.attr('href', '#' + track, xlink); // Transplant all nodes from text to textPath\n\n let node;\n\n if (importNodes) {\n while (node = this.node.firstChild) {\n textPath.node.appendChild(node);\n }\n } // add textPath element as child node and return textPath\n\n\n return this.put(textPath);\n }),\n\n // Get the textPath children\n textPath() {\n return this.findOne('textPath');\n }\n\n },\n Path: {\n // creates a textPath from this path\n text: wrapWithAttrCheck(function (text) {\n // Convert text to instance if needed\n if (!(text instanceof Text)) {\n text = new Text().addTo(this.parent()).text(text);\n } // Create textPath from text and path and return\n\n\n return text.path(this);\n }),\n\n targets() {\n return baseFind('svg textPath').filter(node => {\n return (node.attr('href') || '').includes(this.id());\n }); // Does not work in IE11. Use when IE support is dropped\n // return baseFind('svg textPath[*|href*=\"' + this.id() + '\"]')\n }\n\n }\n});\nTextPath.prototype.MorphArray = PathArray;\nregister(TextPath, 'TextPath');\n\nclass Use extends Shape {\n constructor(node, attrs = node) {\n super(nodeOrNew('use', node), attrs);\n } // Use element as a reference\n\n\n use(element, file) {\n // Set lined element\n return this.attr('href', (file || '') + '#' + element, xlink);\n }\n\n}\nregisterMethods({\n Container: {\n // Create a use element\n use: wrapWithAttrCheck(function (element, file) {\n return this.put(new Use()).use(element, file);\n })\n }\n});\nregister(Use, 'Use');\n\n/* Optional Modules */\nconst SVG = makeInstance;\nextend([Svg, Symbol, Image, Pattern, Marker], getMethodsFor('viewbox'));\nextend([Line, Polyline, Polygon, Path], getMethodsFor('marker'));\nextend(Text, getMethodsFor('Text'));\nextend(Path, getMethodsFor('Path'));\nextend(Defs, getMethodsFor('Defs'));\nextend([Text, Tspan], getMethodsFor('Tspan'));\nextend([Rect, Ellipse, Gradient, Runner], getMethodsFor('radius'));\nextend(EventTarget, getMethodsFor('EventTarget'));\nextend(Dom, getMethodsFor('Dom'));\nextend(Element, getMethodsFor('Element'));\nextend(Shape, getMethodsFor('Shape'));\nextend([Container, Fragment], getMethodsFor('Container'));\nextend(Gradient, getMethodsFor('Gradient'));\nextend(Runner, getMethodsFor('Runner'));\nList.extend(getMethodNames());\nregisterMorphableType([SVGNumber, Color, Box, Matrix, SVGArray, PointArray, PathArray]);\nmakeMorphable();\n\nexport { A, Animator, SVGArray as Array, Box, Circle, ClipPath, Color, Container, Controller, Defs, Dom, Ease, Element, Ellipse, EventTarget, ForeignObject, Fragment, G, Gradient, Image, Line, List, Marker, Mask, Matrix, Morphable, NonMorphable, SVGNumber as Number, ObjectBag, PID, Path, PathArray, Pattern, Point, PointArray, Polygon, Polyline, Queue, Rect, Runner, SVG, Shape, Spring, Stop, Style, Svg, Symbol, Text, TextPath, Timeline, TransformBag, Tspan, Use, adopt, assignNewId, clearEvents, create, defaults, dispatch, easing, eid, extend, baseFind as find, getClass, getEventTarget, getEvents, getWindow, makeInstance, makeMorphable, mockAdopt, namespaces, nodeOrNew, off, on, parser, regex, register, registerMorphableType, registerWindow, restoreWindow, root, saveWindow, utils, windowEvents, withWindow, wrapWithAttrCheck };\n//# sourceMappingURL=svg.esm.js.map\n","/**\n * @module ol/Disposable\n */\n/**\n * @classdesc\n * Objects that need to clean up after themselves.\n */\nvar Disposable = /** @class */ (function () {\n function Disposable() {\n /**\n * The object has already been disposed.\n * @type {boolean}\n * @protected\n */\n this.disposed = false;\n }\n /**\n * Clean up.\n */\n Disposable.prototype.dispose = function () {\n if (!this.disposed) {\n this.disposed = true;\n this.disposeInternal();\n }\n };\n /**\n * Extension point for disposable objects.\n * @protected\n */\n Disposable.prototype.disposeInternal = function () { };\n return Disposable;\n}());\nexport default Disposable;\n//# sourceMappingURL=Disposable.js.map","/**\n * @module ol/array\n */\n/**\n * Performs a binary search on the provided sorted list and returns the index of the item if found. If it can't be found it'll return -1.\n * https://github.com/darkskyapp/binary-search\n *\n * @param {Array<*>} haystack Items to search through.\n * @param {*} needle The item to look for.\n * @param {Function} [opt_comparator] Comparator function.\n * @return {number} The index of the item if found, -1 if not.\n */\nexport function binarySearch(haystack, needle, opt_comparator) {\n var mid, cmp;\n var comparator = opt_comparator || numberSafeCompareFunction;\n var low = 0;\n var high = haystack.length;\n var found = false;\n while (low < high) {\n /* Note that \"(low + high) >>> 1\" may overflow, and results in a typecast\n * to double (which gives the wrong results). */\n mid = low + ((high - low) >> 1);\n cmp = +comparator(haystack[mid], needle);\n if (cmp < 0.0) {\n /* Too low. */\n low = mid + 1;\n }\n else {\n /* Key found or too high */\n high = mid;\n found = !cmp;\n }\n }\n /* Key not found. */\n return found ? low : ~low;\n}\n/**\n * Compare function for array sort that is safe for numbers.\n * @param {*} a The first object to be compared.\n * @param {*} b The second object to be compared.\n * @return {number} A negative number, zero, or a positive number as the first\n * argument is less than, equal to, or greater than the second.\n */\nexport function numberSafeCompareFunction(a, b) {\n return a > b ? 1 : a < b ? -1 : 0;\n}\n/**\n * Whether the array contains the given object.\n * @param {Array<*>} arr The array to test for the presence of the element.\n * @param {*} obj The object for which to test.\n * @return {boolean} The object is in the array.\n */\nexport function includes(arr, obj) {\n return arr.indexOf(obj) >= 0;\n}\n/**\n * {@link module:ol/tilegrid/TileGrid~TileGrid#getZForResolution} can use a function\n * of this type to determine which nearest resolution to use.\n *\n * This function takes a `{number}` representing a value between two array entries,\n * a `{number}` representing the value of the nearest higher entry and\n * a `{number}` representing the value of the nearest lower entry\n * as arguments and returns a `{number}`. If a negative number or zero is returned\n * the lower value will be used, if a positive number is returned the higher value\n * will be used.\n * @typedef {function(number, number, number): number} NearestDirectionFunction\n * @api\n */\n/**\n * @param {Array} arr Array in descending order.\n * @param {number} target Target.\n * @param {number|NearestDirectionFunction} direction\n * 0 means return the nearest,\n * > 0 means return the largest nearest,\n * < 0 means return the smallest nearest.\n * @return {number} Index.\n */\nexport function linearFindNearest(arr, target, direction) {\n var n = arr.length;\n if (arr[0] <= target) {\n return 0;\n }\n else if (target <= arr[n - 1]) {\n return n - 1;\n }\n else {\n var i = void 0;\n if (direction > 0) {\n for (i = 1; i < n; ++i) {\n if (arr[i] < target) {\n return i - 1;\n }\n }\n }\n else if (direction < 0) {\n for (i = 1; i < n; ++i) {\n if (arr[i] <= target) {\n return i;\n }\n }\n }\n else {\n for (i = 1; i < n; ++i) {\n if (arr[i] == target) {\n return i;\n }\n else if (arr[i] < target) {\n if (typeof direction === 'function') {\n if (direction(target, arr[i - 1], arr[i]) > 0) {\n return i - 1;\n }\n else {\n return i;\n }\n }\n else if (arr[i - 1] - target < target - arr[i]) {\n return i - 1;\n }\n else {\n return i;\n }\n }\n }\n }\n return n - 1;\n }\n}\n/**\n * @param {Array<*>} arr Array.\n * @param {number} begin Begin index.\n * @param {number} end End index.\n */\nexport function reverseSubArray(arr, begin, end) {\n while (begin < end) {\n var tmp = arr[begin];\n arr[begin] = arr[end];\n arr[end] = tmp;\n ++begin;\n --end;\n }\n}\n/**\n * @param {Array} arr The array to modify.\n * @param {!Array|VALUE} data The elements or arrays of elements to add to arr.\n * @template VALUE\n */\nexport function extend(arr, data) {\n var extension = Array.isArray(data) ? data : [data];\n var length = extension.length;\n for (var i = 0; i < length; i++) {\n arr[arr.length] = extension[i];\n }\n}\n/**\n * @param {Array} arr The array to modify.\n * @param {VALUE} obj The element to remove.\n * @template VALUE\n * @return {boolean} If the element was removed.\n */\nexport function remove(arr, obj) {\n var i = arr.indexOf(obj);\n var found = i > -1;\n if (found) {\n arr.splice(i, 1);\n }\n return found;\n}\n/**\n * @param {Array} arr The array to search in.\n * @param {function(VALUE, number, ?) : boolean} func The function to compare.\n * @template VALUE\n * @return {VALUE|null} The element found or null.\n */\nexport function find(arr, func) {\n var length = arr.length >>> 0;\n var value;\n for (var i = 0; i < length; i++) {\n value = arr[i];\n if (func(value, i, arr)) {\n return value;\n }\n }\n return null;\n}\n/**\n * @param {Array|Uint8ClampedArray} arr1 The first array to compare.\n * @param {Array|Uint8ClampedArray} arr2 The second array to compare.\n * @return {boolean} Whether the two arrays are equal.\n */\nexport function equals(arr1, arr2) {\n var len1 = arr1.length;\n if (len1 !== arr2.length) {\n return false;\n }\n for (var i = 0; i < len1; i++) {\n if (arr1[i] !== arr2[i]) {\n return false;\n }\n }\n return true;\n}\n/**\n * Sort the passed array such that the relative order of equal elements is preserved.\n * See https://en.wikipedia.org/wiki/Sorting_algorithm#Stability for details.\n * @param {Array<*>} arr The array to sort (modifies original).\n * @param {!function(*, *): number} compareFnc Comparison function.\n * @api\n */\nexport function stableSort(arr, compareFnc) {\n var length = arr.length;\n var tmp = Array(arr.length);\n var i;\n for (i = 0; i < length; i++) {\n tmp[i] = { index: i, value: arr[i] };\n }\n tmp.sort(function (a, b) {\n return compareFnc(a.value, b.value) || a.index - b.index;\n });\n for (i = 0; i < arr.length; i++) {\n arr[i] = tmp[i].value;\n }\n}\n/**\n * @param {Array<*>} arr The array to search in.\n * @param {Function} func Comparison function.\n * @return {number} Return index.\n */\nexport function findIndex(arr, func) {\n var index;\n var found = !arr.every(function (el, idx) {\n index = idx;\n return !func(el, idx, arr);\n });\n return found ? index : -1;\n}\n/**\n * @param {Array<*>} arr The array to test.\n * @param {Function} [opt_func] Comparison function.\n * @param {boolean} [opt_strict] Strictly sorted (default false).\n * @return {boolean} Return index.\n */\nexport function isSorted(arr, opt_func, opt_strict) {\n var compare = opt_func || numberSafeCompareFunction;\n return arr.every(function (currentVal, index) {\n if (index === 0) {\n return true;\n }\n var res = compare(arr[index - 1], currentVal);\n return !(res > 0 || (opt_strict && res === 0));\n });\n}\n//# sourceMappingURL=array.js.map","/**\n * @module ol/functions\n */\nimport { equals as arrayEquals } from './array.js';\n/**\n * Always returns true.\n * @return {boolean} true.\n */\nexport function TRUE() {\n return true;\n}\n/**\n * Always returns false.\n * @return {boolean} false.\n */\nexport function FALSE() {\n return false;\n}\n/**\n * A reusable function, used e.g. as a default for callbacks.\n *\n * @return {void} Nothing.\n */\nexport function VOID() { }\n/**\n * Wrap a function in another function that remembers the last return. If the\n * returned function is called twice in a row with the same arguments and the same\n * this object, it will return the value from the first call in the second call.\n *\n * @param {function(...any): ReturnType} fn The function to memoize.\n * @return {function(...any): ReturnType} The memoized function.\n * @template ReturnType\n */\nexport function memoizeOne(fn) {\n var called = false;\n /** @type {ReturnType} */\n var lastResult;\n /** @type {Array} */\n var lastArgs;\n var lastThis;\n return function () {\n var nextArgs = Array.prototype.slice.call(arguments);\n if (!called || this !== lastThis || !arrayEquals(nextArgs, lastArgs)) {\n called = true;\n lastThis = this;\n lastArgs = nextArgs;\n lastResult = fn.apply(this, arguments);\n }\n return lastResult;\n };\n}\n//# sourceMappingURL=functions.js.map","/**\n * @module ol/util\n */\n/**\n * @return {?} Any return.\n */\nexport function abstract() {\n return /** @type {?} */ ((function () {\n throw new Error('Unimplemented abstract method.');\n })());\n}\n/**\n * Counter for getUid.\n * @type {number}\n * @private\n */\nvar uidCounter_ = 0;\n/**\n * Gets a unique ID for an object. This mutates the object so that further calls\n * with the same object as a parameter returns the same value. Unique IDs are generated\n * as a strictly increasing sequence. Adapted from goog.getUid.\n *\n * @param {Object} obj The object to get the unique ID for.\n * @return {string} The unique ID for the object.\n * @api\n */\nexport function getUid(obj) {\n return obj.ol_uid || (obj.ol_uid = String(++uidCounter_));\n}\n/**\n * OpenLayers version.\n * @type {string}\n */\nexport var VERSION = '6.9.0';\n//# sourceMappingURL=util.js.map","/**\n * @module ol/has\n */\nvar ua = typeof navigator !== 'undefined' && typeof navigator.userAgent !== 'undefined'\n ? navigator.userAgent.toLowerCase()\n : '';\n/**\n * User agent string says we are dealing with Firefox as browser.\n * @type {boolean}\n */\nexport var FIREFOX = ua.indexOf('firefox') !== -1;\n/**\n * User agent string says we are dealing with Safari as browser.\n * @type {boolean}\n */\nexport var SAFARI = ua.indexOf('safari') !== -1 && ua.indexOf('chrom') == -1;\n/**\n * User agent string says we are dealing with a WebKit engine.\n * @type {boolean}\n */\nexport var WEBKIT = ua.indexOf('webkit') !== -1 && ua.indexOf('edge') == -1;\n/**\n * User agent string says we are dealing with a Mac as platform.\n * @type {boolean}\n */\nexport var MAC = ua.indexOf('macintosh') !== -1;\n/**\n * The ratio between physical pixels and device-independent pixels\n * (dips) on the device (`window.devicePixelRatio`).\n * @const\n * @type {number}\n * @api\n */\nexport var DEVICE_PIXEL_RATIO = typeof devicePixelRatio !== 'undefined' ? devicePixelRatio : 1;\n/**\n * The execution context is a worker with OffscreenCanvas available.\n * @const\n * @type {boolean}\n */\nexport var WORKER_OFFSCREEN_CANVAS = typeof WorkerGlobalScope !== 'undefined' &&\n typeof OffscreenCanvas !== 'undefined' &&\n self instanceof WorkerGlobalScope; //eslint-disable-line\n/**\n * Image.prototype.decode() is supported.\n * @type {boolean}\n */\nexport var IMAGE_DECODE = typeof Image !== 'undefined' && Image.prototype.decode;\n/**\n * @type {boolean}\n */\nexport var PASSIVE_EVENT_LISTENERS = (function () {\n var passive = false;\n try {\n var options = Object.defineProperty({}, 'passive', {\n get: function () {\n passive = true;\n },\n });\n window.addEventListener('_', null, options);\n window.removeEventListener('_', null, options);\n }\n catch (error) {\n // passive not supported\n }\n return passive;\n})();\n//# sourceMappingURL=has.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/AssertionError\n */\nimport { VERSION } from './util.js';\n/**\n * Error object thrown when an assertion failed. This is an ECMA-262 Error,\n * extended with a `code` property.\n * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error.\n */\nvar AssertionError = /** @class */ (function (_super) {\n __extends(AssertionError, _super);\n /**\n * @param {number} code Error code.\n */\n function AssertionError(code) {\n var _this = this;\n var path = VERSION === 'latest' ? VERSION : 'v' + VERSION.split('-')[0];\n var message = 'Assertion failed. See https://openlayers.org/en/' +\n path +\n '/doc/errors/#' +\n code +\n ' for details.';\n _this = _super.call(this, message) || this;\n /**\n * Error code. The meaning of the code can be found on\n * https://openlayers.org/en/latest/doc/errors/ (replace `latest` with\n * the version found in the OpenLayers script's header comment if a version\n * other than the latest is used).\n * @type {number}\n * @api\n */\n _this.code = code;\n /**\n * @type {string}\n */\n _this.name = 'AssertionError';\n // Re-assign message, see https://github.com/Rich-Harris/buble/issues/40\n _this.message = message;\n return _this;\n }\n return AssertionError;\n}(Error));\nexport default AssertionError;\n//# sourceMappingURL=AssertionError.js.map","/**\n * @module ol/asserts\n */\nimport AssertionError from './AssertionError.js';\n/**\n * @param {*} assertion Assertion we expected to be truthy.\n * @param {number} errorCode Error code.\n */\nexport function assert(assertion, errorCode) {\n if (!assertion) {\n throw new AssertionError(errorCode);\n }\n}\n//# sourceMappingURL=asserts.js.map","/**\n * @module ol/transform\n */\nimport { WORKER_OFFSCREEN_CANVAS } from './has.js';\nimport { assert } from './asserts.js';\n/**\n * An array representing an affine 2d transformation for use with\n * {@link module:ol/transform} functions. The array has 6 elements.\n * @typedef {!Array} Transform\n * @api\n */\n/**\n * Collection of affine 2d transformation functions. The functions work on an\n * array of 6 elements. The element order is compatible with the [SVGMatrix\n * interface](https://developer.mozilla.org/en-US/docs/Web/API/SVGMatrix) and is\n * a subset (elements a to f) of a 3×3 matrix:\n * ```\n * [ a c e ]\n * [ b d f ]\n * [ 0 0 1 ]\n * ```\n */\n/**\n * @private\n * @type {Transform}\n */\nvar tmp_ = new Array(6);\n/**\n * Create an identity transform.\n * @return {!Transform} Identity transform.\n */\nexport function create() {\n return [1, 0, 0, 1, 0, 0];\n}\n/**\n * Resets the given transform to an identity transform.\n * @param {!Transform} transform Transform.\n * @return {!Transform} Transform.\n */\nexport function reset(transform) {\n return set(transform, 1, 0, 0, 1, 0, 0);\n}\n/**\n * Multiply the underlying matrices of two transforms and return the result in\n * the first transform.\n * @param {!Transform} transform1 Transform parameters of matrix 1.\n * @param {!Transform} transform2 Transform parameters of matrix 2.\n * @return {!Transform} transform1 multiplied with transform2.\n */\nexport function multiply(transform1, transform2) {\n var a1 = transform1[0];\n var b1 = transform1[1];\n var c1 = transform1[2];\n var d1 = transform1[3];\n var e1 = transform1[4];\n var f1 = transform1[5];\n var a2 = transform2[0];\n var b2 = transform2[1];\n var c2 = transform2[2];\n var d2 = transform2[3];\n var e2 = transform2[4];\n var f2 = transform2[5];\n transform1[0] = a1 * a2 + c1 * b2;\n transform1[1] = b1 * a2 + d1 * b2;\n transform1[2] = a1 * c2 + c1 * d2;\n transform1[3] = b1 * c2 + d1 * d2;\n transform1[4] = a1 * e2 + c1 * f2 + e1;\n transform1[5] = b1 * e2 + d1 * f2 + f1;\n return transform1;\n}\n/**\n * Set the transform components a-f on a given transform.\n * @param {!Transform} transform Transform.\n * @param {number} a The a component of the transform.\n * @param {number} b The b component of the transform.\n * @param {number} c The c component of the transform.\n * @param {number} d The d component of the transform.\n * @param {number} e The e component of the transform.\n * @param {number} f The f component of the transform.\n * @return {!Transform} Matrix with transform applied.\n */\nexport function set(transform, a, b, c, d, e, f) {\n transform[0] = a;\n transform[1] = b;\n transform[2] = c;\n transform[3] = d;\n transform[4] = e;\n transform[5] = f;\n return transform;\n}\n/**\n * Set transform on one matrix from another matrix.\n * @param {!Transform} transform1 Matrix to set transform to.\n * @param {!Transform} transform2 Matrix to set transform from.\n * @return {!Transform} transform1 with transform from transform2 applied.\n */\nexport function setFromArray(transform1, transform2) {\n transform1[0] = transform2[0];\n transform1[1] = transform2[1];\n transform1[2] = transform2[2];\n transform1[3] = transform2[3];\n transform1[4] = transform2[4];\n transform1[5] = transform2[5];\n return transform1;\n}\n/**\n * Transforms the given coordinate with the given transform returning the\n * resulting, transformed coordinate. The coordinate will be modified in-place.\n *\n * @param {Transform} transform The transformation.\n * @param {import(\"./coordinate.js\").Coordinate|import(\"./pixel.js\").Pixel} coordinate The coordinate to transform.\n * @return {import(\"./coordinate.js\").Coordinate|import(\"./pixel.js\").Pixel} return coordinate so that operations can be\n * chained together.\n */\nexport function apply(transform, coordinate) {\n var x = coordinate[0];\n var y = coordinate[1];\n coordinate[0] = transform[0] * x + transform[2] * y + transform[4];\n coordinate[1] = transform[1] * x + transform[3] * y + transform[5];\n return coordinate;\n}\n/**\n * Applies rotation to the given transform.\n * @param {!Transform} transform Transform.\n * @param {number} angle Angle in radians.\n * @return {!Transform} The rotated transform.\n */\nexport function rotate(transform, angle) {\n var cos = Math.cos(angle);\n var sin = Math.sin(angle);\n return multiply(transform, set(tmp_, cos, sin, -sin, cos, 0, 0));\n}\n/**\n * Applies scale to a given transform.\n * @param {!Transform} transform Transform.\n * @param {number} x Scale factor x.\n * @param {number} y Scale factor y.\n * @return {!Transform} The scaled transform.\n */\nexport function scale(transform, x, y) {\n return multiply(transform, set(tmp_, x, 0, 0, y, 0, 0));\n}\n/**\n * Creates a scale transform.\n * @param {!Transform} target Transform to overwrite.\n * @param {number} x Scale factor x.\n * @param {number} y Scale factor y.\n * @return {!Transform} The scale transform.\n */\nexport function makeScale(target, x, y) {\n return set(target, x, 0, 0, y, 0, 0);\n}\n/**\n * Applies translation to the given transform.\n * @param {!Transform} transform Transform.\n * @param {number} dx Translation x.\n * @param {number} dy Translation y.\n * @return {!Transform} The translated transform.\n */\nexport function translate(transform, dx, dy) {\n return multiply(transform, set(tmp_, 1, 0, 0, 1, dx, dy));\n}\n/**\n * Creates a composite transform given an initial translation, scale, rotation, and\n * final translation (in that order only, not commutative).\n * @param {!Transform} transform The transform (will be modified in place).\n * @param {number} dx1 Initial translation x.\n * @param {number} dy1 Initial translation y.\n * @param {number} sx Scale factor x.\n * @param {number} sy Scale factor y.\n * @param {number} angle Rotation (in counter-clockwise radians).\n * @param {number} dx2 Final translation x.\n * @param {number} dy2 Final translation y.\n * @return {!Transform} The composite transform.\n */\nexport function compose(transform, dx1, dy1, sx, sy, angle, dx2, dy2) {\n var sin = Math.sin(angle);\n var cos = Math.cos(angle);\n transform[0] = sx * cos;\n transform[1] = sy * sin;\n transform[2] = -sx * sin;\n transform[3] = sy * cos;\n transform[4] = dx2 * sx * cos - dy2 * sx * sin + dx1;\n transform[5] = dx2 * sy * sin + dy2 * sy * cos + dy1;\n return transform;\n}\n/**\n * Creates a composite transform given an initial translation, scale, rotation, and\n * final translation (in that order only, not commutative). The resulting transform\n * string can be applied as `transform` property of an HTMLElement's style.\n * @param {number} dx1 Initial translation x.\n * @param {number} dy1 Initial translation y.\n * @param {number} sx Scale factor x.\n * @param {number} sy Scale factor y.\n * @param {number} angle Rotation (in counter-clockwise radians).\n * @param {number} dx2 Final translation x.\n * @param {number} dy2 Final translation y.\n * @return {string} The composite css transform.\n * @api\n */\nexport function composeCssTransform(dx1, dy1, sx, sy, angle, dx2, dy2) {\n return toString(compose(create(), dx1, dy1, sx, sy, angle, dx2, dy2));\n}\n/**\n * Invert the given transform.\n * @param {!Transform} source The source transform to invert.\n * @return {!Transform} The inverted (source) transform.\n */\nexport function invert(source) {\n return makeInverse(source, source);\n}\n/**\n * Invert the given transform.\n * @param {!Transform} target Transform to be set as the inverse of\n * the source transform.\n * @param {!Transform} source The source transform to invert.\n * @return {!Transform} The inverted (target) transform.\n */\nexport function makeInverse(target, source) {\n var det = determinant(source);\n assert(det !== 0, 32); // Transformation matrix cannot be inverted\n var a = source[0];\n var b = source[1];\n var c = source[2];\n var d = source[3];\n var e = source[4];\n var f = source[5];\n target[0] = d / det;\n target[1] = -b / det;\n target[2] = -c / det;\n target[3] = a / det;\n target[4] = (c * f - d * e) / det;\n target[5] = -(a * f - b * e) / det;\n return target;\n}\n/**\n * Returns the determinant of the given matrix.\n * @param {!Transform} mat Matrix.\n * @return {number} Determinant.\n */\nexport function determinant(mat) {\n return mat[0] * mat[3] - mat[1] * mat[2];\n}\n/**\n * @type {HTMLElement}\n * @private\n */\nvar transformStringDiv;\n/**\n * A rounded string version of the transform. This can be used\n * for CSS transforms.\n * @param {!Transform} mat Matrix.\n * @return {string} The transform as a string.\n */\nexport function toString(mat) {\n var transformString = 'matrix(' + mat.join(', ') + ')';\n if (WORKER_OFFSCREEN_CANVAS) {\n return transformString;\n }\n var node = transformStringDiv || (transformStringDiv = document.createElement('div'));\n node.style.transform = transformString;\n return node.style.transform;\n}\n//# sourceMappingURL=transform.js.map","/**\n * @module ol/extent/Corner\n */\n/**\n * Extent corner.\n * @enum {string}\n */\nexport default {\n BOTTOM_LEFT: 'bottom-left',\n BOTTOM_RIGHT: 'bottom-right',\n TOP_LEFT: 'top-left',\n TOP_RIGHT: 'top-right',\n};\n//# sourceMappingURL=Corner.js.map","/**\n * @module ol/extent/Relationship\n */\n/**\n * Relationship to an extent.\n * @enum {number}\n */\nexport default {\n UNKNOWN: 0,\n INTERSECTING: 1,\n ABOVE: 2,\n RIGHT: 4,\n BELOW: 8,\n LEFT: 16,\n};\n//# sourceMappingURL=Relationship.js.map","/**\n * @module ol/extent\n */\nimport Corner from './extent/Corner.js';\nimport Relationship from './extent/Relationship.js';\nimport { assert } from './asserts.js';\n/**\n * An array of numbers representing an extent: `[minx, miny, maxx, maxy]`.\n * @typedef {Array} Extent\n * @api\n */\n/**\n * Build an extent that includes all given coordinates.\n *\n * @param {Array} coordinates Coordinates.\n * @return {Extent} Bounding extent.\n * @api\n */\nexport function boundingExtent(coordinates) {\n var extent = createEmpty();\n for (var i = 0, ii = coordinates.length; i < ii; ++i) {\n extendCoordinate(extent, coordinates[i]);\n }\n return extent;\n}\n/**\n * @param {Array} xs Xs.\n * @param {Array} ys Ys.\n * @param {Extent} [opt_extent] Destination extent.\n * @private\n * @return {Extent} Extent.\n */\nfunction _boundingExtentXYs(xs, ys, opt_extent) {\n var minX = Math.min.apply(null, xs);\n var minY = Math.min.apply(null, ys);\n var maxX = Math.max.apply(null, xs);\n var maxY = Math.max.apply(null, ys);\n return createOrUpdate(minX, minY, maxX, maxY, opt_extent);\n}\n/**\n * Return extent increased by the provided value.\n * @param {Extent} extent Extent.\n * @param {number} value The amount by which the extent should be buffered.\n * @param {Extent} [opt_extent] Extent.\n * @return {Extent} Extent.\n * @api\n */\nexport function buffer(extent, value, opt_extent) {\n if (opt_extent) {\n opt_extent[0] = extent[0] - value;\n opt_extent[1] = extent[1] - value;\n opt_extent[2] = extent[2] + value;\n opt_extent[3] = extent[3] + value;\n return opt_extent;\n }\n else {\n return [\n extent[0] - value,\n extent[1] - value,\n extent[2] + value,\n extent[3] + value,\n ];\n }\n}\n/**\n * Creates a clone of an extent.\n *\n * @param {Extent} extent Extent to clone.\n * @param {Extent} [opt_extent] Extent.\n * @return {Extent} The clone.\n */\nexport function clone(extent, opt_extent) {\n if (opt_extent) {\n opt_extent[0] = extent[0];\n opt_extent[1] = extent[1];\n opt_extent[2] = extent[2];\n opt_extent[3] = extent[3];\n return opt_extent;\n }\n else {\n return extent.slice();\n }\n}\n/**\n * @param {Extent} extent Extent.\n * @param {number} x X.\n * @param {number} y Y.\n * @return {number} Closest squared distance.\n */\nexport function closestSquaredDistanceXY(extent, x, y) {\n var dx, dy;\n if (x < extent[0]) {\n dx = extent[0] - x;\n }\n else if (extent[2] < x) {\n dx = x - extent[2];\n }\n else {\n dx = 0;\n }\n if (y < extent[1]) {\n dy = extent[1] - y;\n }\n else if (extent[3] < y) {\n dy = y - extent[3];\n }\n else {\n dy = 0;\n }\n return dx * dx + dy * dy;\n}\n/**\n * Check if the passed coordinate is contained or on the edge of the extent.\n *\n * @param {Extent} extent Extent.\n * @param {import(\"./coordinate.js\").Coordinate} coordinate Coordinate.\n * @return {boolean} The coordinate is contained in the extent.\n * @api\n */\nexport function containsCoordinate(extent, coordinate) {\n return containsXY(extent, coordinate[0], coordinate[1]);\n}\n/**\n * Check if one extent contains another.\n *\n * An extent is deemed contained if it lies completely within the other extent,\n * including if they share one or more edges.\n *\n * @param {Extent} extent1 Extent 1.\n * @param {Extent} extent2 Extent 2.\n * @return {boolean} The second extent is contained by or on the edge of the\n * first.\n * @api\n */\nexport function containsExtent(extent1, extent2) {\n return (extent1[0] <= extent2[0] &&\n extent2[2] <= extent1[2] &&\n extent1[1] <= extent2[1] &&\n extent2[3] <= extent1[3]);\n}\n/**\n * Check if the passed coordinate is contained or on the edge of the extent.\n *\n * @param {Extent} extent Extent.\n * @param {number} x X coordinate.\n * @param {number} y Y coordinate.\n * @return {boolean} The x, y values are contained in the extent.\n * @api\n */\nexport function containsXY(extent, x, y) {\n return extent[0] <= x && x <= extent[2] && extent[1] <= y && y <= extent[3];\n}\n/**\n * Get the relationship between a coordinate and extent.\n * @param {Extent} extent The extent.\n * @param {import(\"./coordinate.js\").Coordinate} coordinate The coordinate.\n * @return {import(\"./extent/Relationship.js\").default} The relationship (bitwise compare with\n * import(\"./extent/Relationship.js\").Relationship).\n */\nexport function coordinateRelationship(extent, coordinate) {\n var minX = extent[0];\n var minY = extent[1];\n var maxX = extent[2];\n var maxY = extent[3];\n var x = coordinate[0];\n var y = coordinate[1];\n var relationship = Relationship.UNKNOWN;\n if (x < minX) {\n relationship = relationship | Relationship.LEFT;\n }\n else if (x > maxX) {\n relationship = relationship | Relationship.RIGHT;\n }\n if (y < minY) {\n relationship = relationship | Relationship.BELOW;\n }\n else if (y > maxY) {\n relationship = relationship | Relationship.ABOVE;\n }\n if (relationship === Relationship.UNKNOWN) {\n relationship = Relationship.INTERSECTING;\n }\n return relationship;\n}\n/**\n * Create an empty extent.\n * @return {Extent} Empty extent.\n * @api\n */\nexport function createEmpty() {\n return [Infinity, Infinity, -Infinity, -Infinity];\n}\n/**\n * Create a new extent or update the provided extent.\n * @param {number} minX Minimum X.\n * @param {number} minY Minimum Y.\n * @param {number} maxX Maximum X.\n * @param {number} maxY Maximum Y.\n * @param {Extent} [opt_extent] Destination extent.\n * @return {Extent} Extent.\n */\nexport function createOrUpdate(minX, minY, maxX, maxY, opt_extent) {\n if (opt_extent) {\n opt_extent[0] = minX;\n opt_extent[1] = minY;\n opt_extent[2] = maxX;\n opt_extent[3] = maxY;\n return opt_extent;\n }\n else {\n return [minX, minY, maxX, maxY];\n }\n}\n/**\n * Create a new empty extent or make the provided one empty.\n * @param {Extent} [opt_extent] Extent.\n * @return {Extent} Extent.\n */\nexport function createOrUpdateEmpty(opt_extent) {\n return createOrUpdate(Infinity, Infinity, -Infinity, -Infinity, opt_extent);\n}\n/**\n * @param {import(\"./coordinate.js\").Coordinate} coordinate Coordinate.\n * @param {Extent} [opt_extent] Extent.\n * @return {Extent} Extent.\n */\nexport function createOrUpdateFromCoordinate(coordinate, opt_extent) {\n var x = coordinate[0];\n var y = coordinate[1];\n return createOrUpdate(x, y, x, y, opt_extent);\n}\n/**\n * @param {Array} coordinates Coordinates.\n * @param {Extent} [opt_extent] Extent.\n * @return {Extent} Extent.\n */\nexport function createOrUpdateFromCoordinates(coordinates, opt_extent) {\n var extent = createOrUpdateEmpty(opt_extent);\n return extendCoordinates(extent, coordinates);\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {Extent} [opt_extent] Extent.\n * @return {Extent} Extent.\n */\nexport function createOrUpdateFromFlatCoordinates(flatCoordinates, offset, end, stride, opt_extent) {\n var extent = createOrUpdateEmpty(opt_extent);\n return extendFlatCoordinates(extent, flatCoordinates, offset, end, stride);\n}\n/**\n * @param {Array>} rings Rings.\n * @param {Extent} [opt_extent] Extent.\n * @return {Extent} Extent.\n */\nexport function createOrUpdateFromRings(rings, opt_extent) {\n var extent = createOrUpdateEmpty(opt_extent);\n return extendRings(extent, rings);\n}\n/**\n * Determine if two extents are equivalent.\n * @param {Extent} extent1 Extent 1.\n * @param {Extent} extent2 Extent 2.\n * @return {boolean} The two extents are equivalent.\n * @api\n */\nexport function equals(extent1, extent2) {\n return (extent1[0] == extent2[0] &&\n extent1[2] == extent2[2] &&\n extent1[1] == extent2[1] &&\n extent1[3] == extent2[3]);\n}\n/**\n * Determine if two extents are approximately equivalent.\n * @param {Extent} extent1 Extent 1.\n * @param {Extent} extent2 Extent 2.\n * @param {number} tolerance Tolerance in extent coordinate units.\n * @return {boolean} The two extents differ by less than the tolerance.\n */\nexport function approximatelyEquals(extent1, extent2, tolerance) {\n return (Math.abs(extent1[0] - extent2[0]) < tolerance &&\n Math.abs(extent1[2] - extent2[2]) < tolerance &&\n Math.abs(extent1[1] - extent2[1]) < tolerance &&\n Math.abs(extent1[3] - extent2[3]) < tolerance);\n}\n/**\n * Modify an extent to include another extent.\n * @param {Extent} extent1 The extent to be modified.\n * @param {Extent} extent2 The extent that will be included in the first.\n * @return {Extent} A reference to the first (extended) extent.\n * @api\n */\nexport function extend(extent1, extent2) {\n if (extent2[0] < extent1[0]) {\n extent1[0] = extent2[0];\n }\n if (extent2[2] > extent1[2]) {\n extent1[2] = extent2[2];\n }\n if (extent2[1] < extent1[1]) {\n extent1[1] = extent2[1];\n }\n if (extent2[3] > extent1[3]) {\n extent1[3] = extent2[3];\n }\n return extent1;\n}\n/**\n * @param {Extent} extent Extent.\n * @param {import(\"./coordinate.js\").Coordinate} coordinate Coordinate.\n */\nexport function extendCoordinate(extent, coordinate) {\n if (coordinate[0] < extent[0]) {\n extent[0] = coordinate[0];\n }\n if (coordinate[0] > extent[2]) {\n extent[2] = coordinate[0];\n }\n if (coordinate[1] < extent[1]) {\n extent[1] = coordinate[1];\n }\n if (coordinate[1] > extent[3]) {\n extent[3] = coordinate[1];\n }\n}\n/**\n * @param {Extent} extent Extent.\n * @param {Array} coordinates Coordinates.\n * @return {Extent} Extent.\n */\nexport function extendCoordinates(extent, coordinates) {\n for (var i = 0, ii = coordinates.length; i < ii; ++i) {\n extendCoordinate(extent, coordinates[i]);\n }\n return extent;\n}\n/**\n * @param {Extent} extent Extent.\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @return {Extent} Extent.\n */\nexport function extendFlatCoordinates(extent, flatCoordinates, offset, end, stride) {\n for (; offset < end; offset += stride) {\n extendXY(extent, flatCoordinates[offset], flatCoordinates[offset + 1]);\n }\n return extent;\n}\n/**\n * @param {Extent} extent Extent.\n * @param {Array>} rings Rings.\n * @return {Extent} Extent.\n */\nexport function extendRings(extent, rings) {\n for (var i = 0, ii = rings.length; i < ii; ++i) {\n extendCoordinates(extent, rings[i]);\n }\n return extent;\n}\n/**\n * @param {Extent} extent Extent.\n * @param {number} x X.\n * @param {number} y Y.\n */\nexport function extendXY(extent, x, y) {\n extent[0] = Math.min(extent[0], x);\n extent[1] = Math.min(extent[1], y);\n extent[2] = Math.max(extent[2], x);\n extent[3] = Math.max(extent[3], y);\n}\n/**\n * This function calls `callback` for each corner of the extent. If the\n * callback returns a truthy value the function returns that value\n * immediately. Otherwise the function returns `false`.\n * @param {Extent} extent Extent.\n * @param {function(import(\"./coordinate.js\").Coordinate): S} callback Callback.\n * @return {S|boolean} Value.\n * @template S\n */\nexport function forEachCorner(extent, callback) {\n var val;\n val = callback(getBottomLeft(extent));\n if (val) {\n return val;\n }\n val = callback(getBottomRight(extent));\n if (val) {\n return val;\n }\n val = callback(getTopRight(extent));\n if (val) {\n return val;\n }\n val = callback(getTopLeft(extent));\n if (val) {\n return val;\n }\n return false;\n}\n/**\n * Get the size of an extent.\n * @param {Extent} extent Extent.\n * @return {number} Area.\n * @api\n */\nexport function getArea(extent) {\n var area = 0;\n if (!isEmpty(extent)) {\n area = getWidth(extent) * getHeight(extent);\n }\n return area;\n}\n/**\n * Get the bottom left coordinate of an extent.\n * @param {Extent} extent Extent.\n * @return {import(\"./coordinate.js\").Coordinate} Bottom left coordinate.\n * @api\n */\nexport function getBottomLeft(extent) {\n return [extent[0], extent[1]];\n}\n/**\n * Get the bottom right coordinate of an extent.\n * @param {Extent} extent Extent.\n * @return {import(\"./coordinate.js\").Coordinate} Bottom right coordinate.\n * @api\n */\nexport function getBottomRight(extent) {\n return [extent[2], extent[1]];\n}\n/**\n * Get the center coordinate of an extent.\n * @param {Extent} extent Extent.\n * @return {import(\"./coordinate.js\").Coordinate} Center.\n * @api\n */\nexport function getCenter(extent) {\n return [(extent[0] + extent[2]) / 2, (extent[1] + extent[3]) / 2];\n}\n/**\n * Get a corner coordinate of an extent.\n * @param {Extent} extent Extent.\n * @param {import(\"./extent/Corner.js\").default} corner Corner.\n * @return {import(\"./coordinate.js\").Coordinate} Corner coordinate.\n */\nexport function getCorner(extent, corner) {\n var coordinate;\n if (corner === Corner.BOTTOM_LEFT) {\n coordinate = getBottomLeft(extent);\n }\n else if (corner === Corner.BOTTOM_RIGHT) {\n coordinate = getBottomRight(extent);\n }\n else if (corner === Corner.TOP_LEFT) {\n coordinate = getTopLeft(extent);\n }\n else if (corner === Corner.TOP_RIGHT) {\n coordinate = getTopRight(extent);\n }\n else {\n assert(false, 13); // Invalid corner\n }\n return coordinate;\n}\n/**\n * @param {Extent} extent1 Extent 1.\n * @param {Extent} extent2 Extent 2.\n * @return {number} Enlarged area.\n */\nexport function getEnlargedArea(extent1, extent2) {\n var minX = Math.min(extent1[0], extent2[0]);\n var minY = Math.min(extent1[1], extent2[1]);\n var maxX = Math.max(extent1[2], extent2[2]);\n var maxY = Math.max(extent1[3], extent2[3]);\n return (maxX - minX) * (maxY - minY);\n}\n/**\n * @param {import(\"./coordinate.js\").Coordinate} center Center.\n * @param {number} resolution Resolution.\n * @param {number} rotation Rotation.\n * @param {import(\"./size.js\").Size} size Size.\n * @param {Extent} [opt_extent] Destination extent.\n * @return {Extent} Extent.\n */\nexport function getForViewAndSize(center, resolution, rotation, size, opt_extent) {\n var dx = (resolution * size[0]) / 2;\n var dy = (resolution * size[1]) / 2;\n var cosRotation = Math.cos(rotation);\n var sinRotation = Math.sin(rotation);\n var xCos = dx * cosRotation;\n var xSin = dx * sinRotation;\n var yCos = dy * cosRotation;\n var ySin = dy * sinRotation;\n var x = center[0];\n var y = center[1];\n var x0 = x - xCos + ySin;\n var x1 = x - xCos - ySin;\n var x2 = x + xCos - ySin;\n var x3 = x + xCos + ySin;\n var y0 = y - xSin - yCos;\n var y1 = y - xSin + yCos;\n var y2 = y + xSin + yCos;\n var y3 = y + xSin - yCos;\n return createOrUpdate(Math.min(x0, x1, x2, x3), Math.min(y0, y1, y2, y3), Math.max(x0, x1, x2, x3), Math.max(y0, y1, y2, y3), opt_extent);\n}\n/**\n * Get the height of an extent.\n * @param {Extent} extent Extent.\n * @return {number} Height.\n * @api\n */\nexport function getHeight(extent) {\n return extent[3] - extent[1];\n}\n/**\n * @param {Extent} extent1 Extent 1.\n * @param {Extent} extent2 Extent 2.\n * @return {number} Intersection area.\n */\nexport function getIntersectionArea(extent1, extent2) {\n var intersection = getIntersection(extent1, extent2);\n return getArea(intersection);\n}\n/**\n * Get the intersection of two extents.\n * @param {Extent} extent1 Extent 1.\n * @param {Extent} extent2 Extent 2.\n * @param {Extent} [opt_extent] Optional extent to populate with intersection.\n * @return {Extent} Intersecting extent.\n * @api\n */\nexport function getIntersection(extent1, extent2, opt_extent) {\n var intersection = opt_extent ? opt_extent : createEmpty();\n if (intersects(extent1, extent2)) {\n if (extent1[0] > extent2[0]) {\n intersection[0] = extent1[0];\n }\n else {\n intersection[0] = extent2[0];\n }\n if (extent1[1] > extent2[1]) {\n intersection[1] = extent1[1];\n }\n else {\n intersection[1] = extent2[1];\n }\n if (extent1[2] < extent2[2]) {\n intersection[2] = extent1[2];\n }\n else {\n intersection[2] = extent2[2];\n }\n if (extent1[3] < extent2[3]) {\n intersection[3] = extent1[3];\n }\n else {\n intersection[3] = extent2[3];\n }\n }\n else {\n createOrUpdateEmpty(intersection);\n }\n return intersection;\n}\n/**\n * @param {Extent} extent Extent.\n * @return {number} Margin.\n */\nexport function getMargin(extent) {\n return getWidth(extent) + getHeight(extent);\n}\n/**\n * Get the size (width, height) of an extent.\n * @param {Extent} extent The extent.\n * @return {import(\"./size.js\").Size} The extent size.\n * @api\n */\nexport function getSize(extent) {\n return [extent[2] - extent[0], extent[3] - extent[1]];\n}\n/**\n * Get the top left coordinate of an extent.\n * @param {Extent} extent Extent.\n * @return {import(\"./coordinate.js\").Coordinate} Top left coordinate.\n * @api\n */\nexport function getTopLeft(extent) {\n return [extent[0], extent[3]];\n}\n/**\n * Get the top right coordinate of an extent.\n * @param {Extent} extent Extent.\n * @return {import(\"./coordinate.js\").Coordinate} Top right coordinate.\n * @api\n */\nexport function getTopRight(extent) {\n return [extent[2], extent[3]];\n}\n/**\n * Get the width of an extent.\n * @param {Extent} extent Extent.\n * @return {number} Width.\n * @api\n */\nexport function getWidth(extent) {\n return extent[2] - extent[0];\n}\n/**\n * Determine if one extent intersects another.\n * @param {Extent} extent1 Extent 1.\n * @param {Extent} extent2 Extent.\n * @return {boolean} The two extents intersect.\n * @api\n */\nexport function intersects(extent1, extent2) {\n return (extent1[0] <= extent2[2] &&\n extent1[2] >= extent2[0] &&\n extent1[1] <= extent2[3] &&\n extent1[3] >= extent2[1]);\n}\n/**\n * Determine if an extent is empty.\n * @param {Extent} extent Extent.\n * @return {boolean} Is empty.\n * @api\n */\nexport function isEmpty(extent) {\n return extent[2] < extent[0] || extent[3] < extent[1];\n}\n/**\n * @param {Extent} extent Extent.\n * @param {Extent} [opt_extent] Extent.\n * @return {Extent} Extent.\n */\nexport function returnOrUpdate(extent, opt_extent) {\n if (opt_extent) {\n opt_extent[0] = extent[0];\n opt_extent[1] = extent[1];\n opt_extent[2] = extent[2];\n opt_extent[3] = extent[3];\n return opt_extent;\n }\n else {\n return extent;\n }\n}\n/**\n * @param {Extent} extent Extent.\n * @param {number} value Value.\n */\nexport function scaleFromCenter(extent, value) {\n var deltaX = ((extent[2] - extent[0]) / 2) * (value - 1);\n var deltaY = ((extent[3] - extent[1]) / 2) * (value - 1);\n extent[0] -= deltaX;\n extent[2] += deltaX;\n extent[1] -= deltaY;\n extent[3] += deltaY;\n}\n/**\n * Determine if the segment between two coordinates intersects (crosses,\n * touches, or is contained by) the provided extent.\n * @param {Extent} extent The extent.\n * @param {import(\"./coordinate.js\").Coordinate} start Segment start coordinate.\n * @param {import(\"./coordinate.js\").Coordinate} end Segment end coordinate.\n * @return {boolean} The segment intersects the extent.\n */\nexport function intersectsSegment(extent, start, end) {\n var intersects = false;\n var startRel = coordinateRelationship(extent, start);\n var endRel = coordinateRelationship(extent, end);\n if (startRel === Relationship.INTERSECTING ||\n endRel === Relationship.INTERSECTING) {\n intersects = true;\n }\n else {\n var minX = extent[0];\n var minY = extent[1];\n var maxX = extent[2];\n var maxY = extent[3];\n var startX = start[0];\n var startY = start[1];\n var endX = end[0];\n var endY = end[1];\n var slope = (endY - startY) / (endX - startX);\n var x = void 0, y = void 0;\n if (!!(endRel & Relationship.ABOVE) && !(startRel & Relationship.ABOVE)) {\n // potentially intersects top\n x = endX - (endY - maxY) / slope;\n intersects = x >= minX && x <= maxX;\n }\n if (!intersects &&\n !!(endRel & Relationship.RIGHT) &&\n !(startRel & Relationship.RIGHT)) {\n // potentially intersects right\n y = endY - (endX - maxX) * slope;\n intersects = y >= minY && y <= maxY;\n }\n if (!intersects &&\n !!(endRel & Relationship.BELOW) &&\n !(startRel & Relationship.BELOW)) {\n // potentially intersects bottom\n x = endX - (endY - minY) / slope;\n intersects = x >= minX && x <= maxX;\n }\n if (!intersects &&\n !!(endRel & Relationship.LEFT) &&\n !(startRel & Relationship.LEFT)) {\n // potentially intersects left\n y = endY - (endX - minX) * slope;\n intersects = y >= minY && y <= maxY;\n }\n }\n return intersects;\n}\n/**\n * Apply a transform function to the extent.\n * @param {Extent} extent Extent.\n * @param {import(\"./proj.js\").TransformFunction} transformFn Transform function.\n * Called with `[minX, minY, maxX, maxY]` extent coordinates.\n * @param {Extent} [opt_extent] Destination extent.\n * @param {number} [opt_stops] Number of stops per side used for the transform.\n * By default only the corners are used.\n * @return {Extent} Extent.\n * @api\n */\nexport function applyTransform(extent, transformFn, opt_extent, opt_stops) {\n var coordinates = [];\n if (opt_stops > 1) {\n var width = extent[2] - extent[0];\n var height = extent[3] - extent[1];\n for (var i = 0; i < opt_stops; ++i) {\n coordinates.push(extent[0] + (width * i) / opt_stops, extent[1], extent[2], extent[1] + (height * i) / opt_stops, extent[2] - (width * i) / opt_stops, extent[3], extent[0], extent[3] - (height * i) / opt_stops);\n }\n }\n else {\n coordinates = [\n extent[0],\n extent[1],\n extent[2],\n extent[1],\n extent[2],\n extent[3],\n extent[0],\n extent[3],\n ];\n }\n transformFn(coordinates, coordinates, 2);\n var xs = [];\n var ys = [];\n for (var i = 0, l = coordinates.length; i < l; i += 2) {\n xs.push(coordinates[i]);\n ys.push(coordinates[i + 1]);\n }\n return _boundingExtentXYs(xs, ys, opt_extent);\n}\n/**\n * Modifies the provided extent in-place to be within the real world\n * extent.\n *\n * @param {Extent} extent Extent.\n * @param {import(\"./proj/Projection.js\").default} projection Projection\n * @return {Extent} The extent within the real world extent.\n */\nexport function wrapX(extent, projection) {\n var projectionExtent = projection.getExtent();\n var center = getCenter(extent);\n if (projection.canWrapX() &&\n (center[0] < projectionExtent[0] || center[0] >= projectionExtent[2])) {\n var worldWidth = getWidth(projectionExtent);\n var worldsAway = Math.floor((center[0] - projectionExtent[0]) / worldWidth);\n var offset = worldsAway * worldWidth;\n extent[0] -= offset;\n extent[2] -= offset;\n }\n return extent;\n}\n//# sourceMappingURL=extent.js.map","/**\n * @module ol/math\n */\n/**\n * Takes a number and clamps it to within the provided bounds.\n * @param {number} value The input number.\n * @param {number} min The minimum value to return.\n * @param {number} max The maximum value to return.\n * @return {number} The input number if it is within bounds, or the nearest\n * number within the bounds.\n */\nexport function clamp(value, min, max) {\n return Math.min(Math.max(value, min), max);\n}\n/**\n * Return the hyperbolic cosine of a given number. The method will use the\n * native `Math.cosh` function if it is available, otherwise the hyperbolic\n * cosine will be calculated via the reference implementation of the Mozilla\n * developer network.\n *\n * @param {number} x X.\n * @return {number} Hyperbolic cosine of x.\n */\nexport var cosh = (function () {\n // Wrapped in a iife, to save the overhead of checking for the native\n // implementation on every invocation.\n var cosh;\n if ('cosh' in Math) {\n // The environment supports the native Math.cosh function, use it…\n cosh = Math.cosh;\n }\n else {\n // … else, use the reference implementation of MDN:\n cosh = function (x) {\n var y = /** @type {Math} */ (Math).exp(x);\n return (y + 1 / y) / 2;\n };\n }\n return cosh;\n})();\n/**\n * Return the base 2 logarithm of a given number. The method will use the\n * native `Math.log2` function if it is available, otherwise the base 2\n * logarithm will be calculated via the reference implementation of the\n * Mozilla developer network.\n *\n * @param {number} x X.\n * @return {number} Base 2 logarithm of x.\n */\nexport var log2 = (function () {\n // Wrapped in a iife, to save the overhead of checking for the native\n // implementation on every invocation.\n var log2;\n if ('log2' in Math) {\n // The environment supports the native Math.log2 function, use it…\n log2 = Math.log2;\n }\n else {\n // … else, use the reference implementation of MDN:\n log2 = function (x) {\n return Math.log(x) * Math.LOG2E;\n };\n }\n return log2;\n})();\n/**\n * Returns the square of the closest distance between the point (x, y) and the\n * line segment (x1, y1) to (x2, y2).\n * @param {number} x X.\n * @param {number} y Y.\n * @param {number} x1 X1.\n * @param {number} y1 Y1.\n * @param {number} x2 X2.\n * @param {number} y2 Y2.\n * @return {number} Squared distance.\n */\nexport function squaredSegmentDistance(x, y, x1, y1, x2, y2) {\n var dx = x2 - x1;\n var dy = y2 - y1;\n if (dx !== 0 || dy !== 0) {\n var t = ((x - x1) * dx + (y - y1) * dy) / (dx * dx + dy * dy);\n if (t > 1) {\n x1 = x2;\n y1 = y2;\n }\n else if (t > 0) {\n x1 += dx * t;\n y1 += dy * t;\n }\n }\n return squaredDistance(x, y, x1, y1);\n}\n/**\n * Returns the square of the distance between the points (x1, y1) and (x2, y2).\n * @param {number} x1 X1.\n * @param {number} y1 Y1.\n * @param {number} x2 X2.\n * @param {number} y2 Y2.\n * @return {number} Squared distance.\n */\nexport function squaredDistance(x1, y1, x2, y2) {\n var dx = x2 - x1;\n var dy = y2 - y1;\n return dx * dx + dy * dy;\n}\n/**\n * Solves system of linear equations using Gaussian elimination method.\n *\n * @param {Array>} mat Augmented matrix (n x n + 1 column)\n * in row-major order.\n * @return {Array} The resulting vector.\n */\nexport function solveLinearSystem(mat) {\n var n = mat.length;\n for (var i = 0; i < n; i++) {\n // Find max in the i-th column (ignoring i - 1 first rows)\n var maxRow = i;\n var maxEl = Math.abs(mat[i][i]);\n for (var r = i + 1; r < n; r++) {\n var absValue = Math.abs(mat[r][i]);\n if (absValue > maxEl) {\n maxEl = absValue;\n maxRow = r;\n }\n }\n if (maxEl === 0) {\n return null; // matrix is singular\n }\n // Swap max row with i-th (current) row\n var tmp = mat[maxRow];\n mat[maxRow] = mat[i];\n mat[i] = tmp;\n // Subtract the i-th row to make all the remaining rows 0 in the i-th column\n for (var j = i + 1; j < n; j++) {\n var coef = -mat[j][i] / mat[i][i];\n for (var k = i; k < n + 1; k++) {\n if (i == k) {\n mat[j][k] = 0;\n }\n else {\n mat[j][k] += coef * mat[i][k];\n }\n }\n }\n }\n // Solve Ax=b for upper triangular matrix A (mat)\n var x = new Array(n);\n for (var l = n - 1; l >= 0; l--) {\n x[l] = mat[l][n] / mat[l][l];\n for (var m = l - 1; m >= 0; m--) {\n mat[m][n] -= mat[m][l] * x[l];\n }\n }\n return x;\n}\n/**\n * Converts radians to to degrees.\n *\n * @param {number} angleInRadians Angle in radians.\n * @return {number} Angle in degrees.\n */\nexport function toDegrees(angleInRadians) {\n return (angleInRadians * 180) / Math.PI;\n}\n/**\n * Converts degrees to radians.\n *\n * @param {number} angleInDegrees Angle in degrees.\n * @return {number} Angle in radians.\n */\nexport function toRadians(angleInDegrees) {\n return (angleInDegrees * Math.PI) / 180;\n}\n/**\n * Returns the modulo of a / b, depending on the sign of b.\n *\n * @param {number} a Dividend.\n * @param {number} b Divisor.\n * @return {number} Modulo.\n */\nexport function modulo(a, b) {\n var r = a % b;\n return r * b < 0 ? r + b : r;\n}\n/**\n * Calculates the linearly interpolated value of x between a and b.\n *\n * @param {number} a Number\n * @param {number} b Number\n * @param {number} x Value to be interpolated.\n * @return {number} Interpolated value.\n */\nexport function lerp(a, b, x) {\n return a + x * (b - a);\n}\n//# sourceMappingURL=math.js.map","/**\n * @module ol/color\n */\nimport { assert } from './asserts.js';\nimport { clamp } from './math.js';\n/**\n * A color represented as a short array [red, green, blue, alpha].\n * red, green, and blue should be integers in the range 0..255 inclusive.\n * alpha should be a float in the range 0..1 inclusive. If no alpha value is\n * given then `1` will be used.\n * @typedef {Array} Color\n * @api\n */\n/**\n * This RegExp matches # followed by 3, 4, 6, or 8 hex digits.\n * @const\n * @type {RegExp}\n * @private\n */\nvar HEX_COLOR_RE_ = /^#([a-f0-9]{3}|[a-f0-9]{4}(?:[a-f0-9]{2}){0,2})$/i;\n/**\n * Regular expression for matching potential named color style strings.\n * @const\n * @type {RegExp}\n * @private\n */\nvar NAMED_COLOR_RE_ = /^([a-z]*)$|^hsla?\\(.*\\)$/i;\n/**\n * Return the color as an rgba string.\n * @param {Color|string} color Color.\n * @return {string} Rgba string.\n * @api\n */\nexport function asString(color) {\n if (typeof color === 'string') {\n return color;\n }\n else {\n return toString(color);\n }\n}\n/**\n * Return named color as an rgba string.\n * @param {string} color Named color.\n * @return {string} Rgb string.\n */\nfunction fromNamed(color) {\n var el = document.createElement('div');\n el.style.color = color;\n if (el.style.color !== '') {\n document.body.appendChild(el);\n var rgb = getComputedStyle(el).color;\n document.body.removeChild(el);\n return rgb;\n }\n else {\n return '';\n }\n}\n/**\n * @param {string} s String.\n * @return {Color} Color.\n */\nexport var fromString = (function () {\n // We maintain a small cache of parsed strings. To provide cheap LRU-like\n // semantics, whenever the cache grows too large we simply delete an\n // arbitrary 25% of the entries.\n /**\n * @const\n * @type {number}\n */\n var MAX_CACHE_SIZE = 1024;\n /**\n * @type {Object}\n */\n var cache = {};\n /**\n * @type {number}\n */\n var cacheSize = 0;\n return (\n /**\n * @param {string} s String.\n * @return {Color} Color.\n */\n function (s) {\n var color;\n if (cache.hasOwnProperty(s)) {\n color = cache[s];\n }\n else {\n if (cacheSize >= MAX_CACHE_SIZE) {\n var i = 0;\n for (var key in cache) {\n if ((i++ & 3) === 0) {\n delete cache[key];\n --cacheSize;\n }\n }\n }\n color = fromStringInternal_(s);\n cache[s] = color;\n ++cacheSize;\n }\n return color;\n });\n})();\n/**\n * Return the color as an array. This function maintains a cache of calculated\n * arrays which means the result should not be modified.\n * @param {Color|string} color Color.\n * @return {Color} Color.\n * @api\n */\nexport function asArray(color) {\n if (Array.isArray(color)) {\n return color;\n }\n else {\n return fromString(color);\n }\n}\n/**\n * @param {string} s String.\n * @private\n * @return {Color} Color.\n */\nfunction fromStringInternal_(s) {\n var r, g, b, a, color;\n if (NAMED_COLOR_RE_.exec(s)) {\n s = fromNamed(s);\n }\n if (HEX_COLOR_RE_.exec(s)) {\n // hex\n var n = s.length - 1; // number of hex digits\n var d = // number of digits per channel\n void 0; // number of digits per channel\n if (n <= 4) {\n d = 1;\n }\n else {\n d = 2;\n }\n var hasAlpha = n === 4 || n === 8;\n r = parseInt(s.substr(1 + 0 * d, d), 16);\n g = parseInt(s.substr(1 + 1 * d, d), 16);\n b = parseInt(s.substr(1 + 2 * d, d), 16);\n if (hasAlpha) {\n a = parseInt(s.substr(1 + 3 * d, d), 16);\n }\n else {\n a = 255;\n }\n if (d == 1) {\n r = (r << 4) + r;\n g = (g << 4) + g;\n b = (b << 4) + b;\n if (hasAlpha) {\n a = (a << 4) + a;\n }\n }\n color = [r, g, b, a / 255];\n }\n else if (s.indexOf('rgba(') == 0) {\n // rgba()\n color = s.slice(5, -1).split(',').map(Number);\n normalize(color);\n }\n else if (s.indexOf('rgb(') == 0) {\n // rgb()\n color = s.slice(4, -1).split(',').map(Number);\n color.push(1);\n normalize(color);\n }\n else {\n assert(false, 14); // Invalid color\n }\n return color;\n}\n/**\n * TODO this function is only used in the test, we probably shouldn't export it\n * @param {Color} color Color.\n * @return {Color} Clamped color.\n */\nexport function normalize(color) {\n color[0] = clamp((color[0] + 0.5) | 0, 0, 255);\n color[1] = clamp((color[1] + 0.5) | 0, 0, 255);\n color[2] = clamp((color[2] + 0.5) | 0, 0, 255);\n color[3] = clamp(color[3], 0, 1);\n return color;\n}\n/**\n * @param {Color} color Color.\n * @return {string} String.\n */\nexport function toString(color) {\n var r = color[0];\n if (r != (r | 0)) {\n r = (r + 0.5) | 0;\n }\n var g = color[1];\n if (g != (g | 0)) {\n g = (g + 0.5) | 0;\n }\n var b = color[2];\n if (b != (b | 0)) {\n b = (b + 0.5) | 0;\n }\n var a = color[3] === undefined ? 1 : color[3];\n return 'rgba(' + r + ',' + g + ',' + b + ',' + a + ')';\n}\n/**\n * @param {string} s String.\n * @return {boolean} Whether the string is actually a valid color\n */\nexport function isStringColor(s) {\n if (NAMED_COLOR_RE_.test(s)) {\n s = fromNamed(s);\n }\n return (HEX_COLOR_RE_.test(s) || s.indexOf('rgba(') === 0 || s.indexOf('rgb(') === 0);\n}\n//# sourceMappingURL=color.js.map","/**\n * @module ol/style/IconImageCache\n */\nimport { asString } from '../color.js';\n/**\n * @classdesc\n * Singleton class. Available through {@link module:ol/style/IconImageCache~shared}.\n */\nvar IconImageCache = /** @class */ (function () {\n function IconImageCache() {\n /**\n * @type {!Object}\n * @private\n */\n this.cache_ = {};\n /**\n * @type {number}\n * @private\n */\n this.cacheSize_ = 0;\n /**\n * @type {number}\n * @private\n */\n this.maxCacheSize_ = 32;\n }\n /**\n * FIXME empty description for jsdoc\n */\n IconImageCache.prototype.clear = function () {\n this.cache_ = {};\n this.cacheSize_ = 0;\n };\n /**\n * @return {boolean} Can expire cache.\n */\n IconImageCache.prototype.canExpireCache = function () {\n return this.cacheSize_ > this.maxCacheSize_;\n };\n /**\n * FIXME empty description for jsdoc\n */\n IconImageCache.prototype.expire = function () {\n if (this.canExpireCache()) {\n var i = 0;\n for (var key in this.cache_) {\n var iconImage = this.cache_[key];\n if ((i++ & 3) === 0 && !iconImage.hasListener()) {\n delete this.cache_[key];\n --this.cacheSize_;\n }\n }\n }\n };\n /**\n * @param {string} src Src.\n * @param {?string} crossOrigin Cross origin.\n * @param {import(\"../color.js\").Color} color Color.\n * @return {import(\"./IconImage.js\").default} Icon image.\n */\n IconImageCache.prototype.get = function (src, crossOrigin, color) {\n var key = getKey(src, crossOrigin, color);\n return key in this.cache_ ? this.cache_[key] : null;\n };\n /**\n * @param {string} src Src.\n * @param {?string} crossOrigin Cross origin.\n * @param {import(\"../color.js\").Color} color Color.\n * @param {import(\"./IconImage.js\").default} iconImage Icon image.\n */\n IconImageCache.prototype.set = function (src, crossOrigin, color, iconImage) {\n var key = getKey(src, crossOrigin, color);\n this.cache_[key] = iconImage;\n ++this.cacheSize_;\n };\n /**\n * Set the cache size of the icon cache. Default is `32`. Change this value when\n * your map uses more than 32 different icon images and you are not caching icon\n * styles on the application level.\n * @param {number} maxCacheSize Cache max size.\n * @api\n */\n IconImageCache.prototype.setSize = function (maxCacheSize) {\n this.maxCacheSize_ = maxCacheSize;\n this.expire();\n };\n return IconImageCache;\n}());\n/**\n * @param {string} src Src.\n * @param {?string} crossOrigin Cross origin.\n * @param {import(\"../color.js\").Color} color Color.\n * @return {string} Cache key.\n */\nfunction getKey(src, crossOrigin, color) {\n var colorString = color ? asString(color) : 'null';\n return crossOrigin + ':' + src + ':' + colorString;\n}\nexport default IconImageCache;\n/**\n * The {@link module:ol/style/IconImageCache~IconImageCache} for\n * {@link module:ol/style/Icon~Icon} images.\n * @api\n */\nexport var shared = new IconImageCache();\n//# sourceMappingURL=IconImageCache.js.map","/**\n * @module ol/events/Event\n */\n/**\n * @classdesc\n * Stripped down implementation of the W3C DOM Level 2 Event interface.\n * See https://www.w3.org/TR/DOM-Level-2-Events/events.html#Events-interface.\n *\n * This implementation only provides `type` and `target` properties, and\n * `stopPropagation` and `preventDefault` methods. It is meant as base class\n * for higher level events defined in the library, and works with\n * {@link module:ol/events/Target~Target}.\n */\nvar BaseEvent = /** @class */ (function () {\n /**\n * @param {string} type Type.\n */\n function BaseEvent(type) {\n /**\n * @type {boolean}\n */\n this.propagationStopped;\n /**\n * @type {boolean}\n */\n this.defaultPrevented;\n /**\n * The event type.\n * @type {string}\n * @api\n */\n this.type = type;\n /**\n * The event target.\n * @type {Object}\n * @api\n */\n this.target = null;\n }\n /**\n * Prevent default. This means that no emulated `click`, `singleclick` or `doubleclick` events\n * will be fired.\n * @api\n */\n BaseEvent.prototype.preventDefault = function () {\n this.defaultPrevented = true;\n };\n /**\n * Stop event propagation.\n * @api\n */\n BaseEvent.prototype.stopPropagation = function () {\n this.propagationStopped = true;\n };\n return BaseEvent;\n}());\n/**\n * @param {Event|import(\"./Event.js\").default} evt Event\n */\nexport function stopPropagation(evt) {\n evt.stopPropagation();\n}\n/**\n * @param {Event|import(\"./Event.js\").default} evt Event\n */\nexport function preventDefault(evt) {\n evt.preventDefault();\n}\nexport default BaseEvent;\n//# sourceMappingURL=Event.js.map","/**\n * @module ol/ObjectEventType\n */\n/**\n * @enum {string}\n */\nexport default {\n /**\n * Triggered when a property is changed.\n * @event module:ol/Object.ObjectEvent#propertychange\n * @api\n */\n PROPERTYCHANGE: 'propertychange',\n};\n/**\n * @typedef {'propertychange'} Types\n */\n//# sourceMappingURL=ObjectEventType.js.map","/**\n * @module ol/obj\n */\n/**\n * Polyfill for Object.assign(). Assigns enumerable and own properties from\n * one or more source objects to a target object.\n * See https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Object/assign.\n *\n * @param {!Object} target The target object.\n * @param {...Object} var_sources The source object(s).\n * @return {!Object} The modified target object.\n */\nexport var assign = typeof Object.assign === 'function'\n ? Object.assign\n : function (target, var_sources) {\n if (target === undefined || target === null) {\n throw new TypeError('Cannot convert undefined or null to object');\n }\n var output = Object(target);\n for (var i = 1, ii = arguments.length; i < ii; ++i) {\n var source = arguments[i];\n if (source !== undefined && source !== null) {\n for (var key in source) {\n if (source.hasOwnProperty(key)) {\n output[key] = source[key];\n }\n }\n }\n }\n return output;\n };\n/**\n * Removes all properties from an object.\n * @param {Object} object The object to clear.\n */\nexport function clear(object) {\n for (var property in object) {\n delete object[property];\n }\n}\n/**\n * Polyfill for Object.values(). Get an array of property values from an object.\n * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/values\n *\n * @param {!Object} object The object from which to get the values.\n * @return {!Array} The property values.\n * @template K,V\n */\nexport var getValues = typeof Object.values === 'function'\n ? Object.values\n : function (object) {\n var values = [];\n for (var property in object) {\n values.push(object[property]);\n }\n return values;\n };\n/**\n * Determine if an object has any properties.\n * @param {Object} object The object to check.\n * @return {boolean} The object is empty.\n */\nexport function isEmpty(object) {\n var property;\n for (property in object) {\n return false;\n }\n return !property;\n}\n//# sourceMappingURL=obj.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/events/Target\n */\nimport Disposable from '../Disposable.js';\nimport Event from './Event.js';\nimport { VOID } from '../functions.js';\nimport { clear } from '../obj.js';\n/**\n * @typedef {EventTarget|Target} EventTargetLike\n */\n/**\n * @classdesc\n * A simplified implementation of the W3C DOM Level 2 EventTarget interface.\n * See https://www.w3.org/TR/2000/REC-DOM-Level-2-Events-20001113/events.html#Events-EventTarget.\n *\n * There are two important simplifications compared to the specification:\n *\n * 1. The handling of `useCapture` in `addEventListener` and\n * `removeEventListener`. There is no real capture model.\n * 2. The handling of `stopPropagation` and `preventDefault` on `dispatchEvent`.\n * There is no event target hierarchy. When a listener calls\n * `stopPropagation` or `preventDefault` on an event object, it means that no\n * more listeners after this one will be called. Same as when the listener\n * returns false.\n */\nvar Target = /** @class */ (function (_super) {\n __extends(Target, _super);\n /**\n * @param {*} [opt_target] Default event target for dispatched events.\n */\n function Target(opt_target) {\n var _this = _super.call(this) || this;\n /**\n * @private\n * @type {*}\n */\n _this.eventTarget_ = opt_target;\n /**\n * @private\n * @type {Object}\n */\n _this.pendingRemovals_ = null;\n /**\n * @private\n * @type {Object}\n */\n _this.dispatching_ = null;\n /**\n * @private\n * @type {Object>}\n */\n _this.listeners_ = null;\n return _this;\n }\n /**\n * @param {string} type Type.\n * @param {import(\"../events.js\").Listener} listener Listener.\n */\n Target.prototype.addEventListener = function (type, listener) {\n if (!type || !listener) {\n return;\n }\n var listeners = this.listeners_ || (this.listeners_ = {});\n var listenersForType = listeners[type] || (listeners[type] = []);\n if (listenersForType.indexOf(listener) === -1) {\n listenersForType.push(listener);\n }\n };\n /**\n * Dispatches an event and calls all listeners listening for events\n * of this type. The event parameter can either be a string or an\n * Object with a `type` property.\n *\n * @param {import(\"./Event.js\").default|string} event Event object.\n * @return {boolean|undefined} `false` if anyone called preventDefault on the\n * event object or if any of the listeners returned false.\n * @api\n */\n Target.prototype.dispatchEvent = function (event) {\n /** @type {import(\"./Event.js\").default|Event} */\n var evt = typeof event === 'string' ? new Event(event) : event;\n var type = evt.type;\n if (!evt.target) {\n evt.target = this.eventTarget_ || this;\n }\n var listeners = this.listeners_ && this.listeners_[type];\n var propagate;\n if (listeners) {\n var dispatching = this.dispatching_ || (this.dispatching_ = {});\n var pendingRemovals = this.pendingRemovals_ || (this.pendingRemovals_ = {});\n if (!(type in dispatching)) {\n dispatching[type] = 0;\n pendingRemovals[type] = 0;\n }\n ++dispatching[type];\n for (var i = 0, ii = listeners.length; i < ii; ++i) {\n if ('handleEvent' in listeners[i]) {\n propagate = /** @type {import(\"../events.js\").ListenerObject} */ (listeners[i]).handleEvent(evt);\n }\n else {\n propagate = /** @type {import(\"../events.js\").ListenerFunction} */ (listeners[i]).call(this, evt);\n }\n if (propagate === false || evt.propagationStopped) {\n propagate = false;\n break;\n }\n }\n --dispatching[type];\n if (dispatching[type] === 0) {\n var pr = pendingRemovals[type];\n delete pendingRemovals[type];\n while (pr--) {\n this.removeEventListener(type, VOID);\n }\n delete dispatching[type];\n }\n return propagate;\n }\n };\n /**\n * Clean up.\n */\n Target.prototype.disposeInternal = function () {\n this.listeners_ && clear(this.listeners_);\n };\n /**\n * Get the listeners for a specified event type. Listeners are returned in the\n * order that they will be called in.\n *\n * @param {string} type Type.\n * @return {Array|undefined} Listeners.\n */\n Target.prototype.getListeners = function (type) {\n return (this.listeners_ && this.listeners_[type]) || undefined;\n };\n /**\n * @param {string} [opt_type] Type. If not provided,\n * `true` will be returned if this event target has any listeners.\n * @return {boolean} Has listeners.\n */\n Target.prototype.hasListener = function (opt_type) {\n if (!this.listeners_) {\n return false;\n }\n return opt_type\n ? opt_type in this.listeners_\n : Object.keys(this.listeners_).length > 0;\n };\n /**\n * @param {string} type Type.\n * @param {import(\"../events.js\").Listener} listener Listener.\n */\n Target.prototype.removeEventListener = function (type, listener) {\n var listeners = this.listeners_ && this.listeners_[type];\n if (listeners) {\n var index = listeners.indexOf(listener);\n if (index !== -1) {\n if (this.pendingRemovals_ && type in this.pendingRemovals_) {\n // make listener a no-op, and remove later in #dispatchEvent()\n listeners[index] = VOID;\n ++this.pendingRemovals_[type];\n }\n else {\n listeners.splice(index, 1);\n if (listeners.length === 0) {\n delete this.listeners_[type];\n }\n }\n }\n }\n };\n return Target;\n}(Disposable));\nexport default Target;\n//# sourceMappingURL=Target.js.map","/**\n * @module ol/events/EventType\n */\n/**\n * @enum {string}\n * @const\n */\nexport default {\n /**\n * Generic change event. Triggered when the revision counter is increased.\n * @event module:ol/events/Event~BaseEvent#change\n * @api\n */\n CHANGE: 'change',\n /**\n * Generic error event. Triggered when an error occurs.\n * @event module:ol/events/Event~BaseEvent#error\n * @api\n */\n ERROR: 'error',\n BLUR: 'blur',\n CLEAR: 'clear',\n CONTEXTMENU: 'contextmenu',\n CLICK: 'click',\n DBLCLICK: 'dblclick',\n DRAGENTER: 'dragenter',\n DRAGOVER: 'dragover',\n DROP: 'drop',\n FOCUS: 'focus',\n KEYDOWN: 'keydown',\n KEYPRESS: 'keypress',\n LOAD: 'load',\n RESIZE: 'resize',\n TOUCHMOVE: 'touchmove',\n WHEEL: 'wheel',\n};\n//# sourceMappingURL=EventType.js.map","/**\n * @module ol/events\n */\nimport { clear } from './obj.js';\n/**\n * Key to use with {@link module:ol/Observable~Observable#unByKey}.\n * @typedef {Object} EventsKey\n * @property {ListenerFunction} listener Listener.\n * @property {import(\"./events/Target.js\").EventTargetLike} target Target.\n * @property {string} type Type.\n * @api\n */\n/**\n * Listener function. This function is called with an event object as argument.\n * When the function returns `false`, event propagation will stop.\n *\n * @typedef {function((Event|import(\"./events/Event.js\").default)): (void|boolean)} ListenerFunction\n * @api\n */\n/**\n * @typedef {Object} ListenerObject\n * @property {ListenerFunction} handleEvent HandleEvent listener function.\n */\n/**\n * @typedef {ListenerFunction|ListenerObject} Listener\n */\n/**\n * Registers an event listener on an event target. Inspired by\n * https://google.github.io/closure-library/api/source/closure/goog/events/events.js.src.html\n *\n * This function efficiently binds a `listener` to a `this` object, and returns\n * a key for use with {@link module:ol/events.unlistenByKey}.\n *\n * @param {import(\"./events/Target.js\").EventTargetLike} target Event target.\n * @param {string} type Event type.\n * @param {ListenerFunction} listener Listener.\n * @param {Object} [opt_this] Object referenced by the `this` keyword in the\n * listener. Default is the `target`.\n * @param {boolean} [opt_once] If true, add the listener as one-off listener.\n * @return {EventsKey} Unique key for the listener.\n */\nexport function listen(target, type, listener, opt_this, opt_once) {\n if (opt_this && opt_this !== target) {\n listener = listener.bind(opt_this);\n }\n if (opt_once) {\n var originalListener_1 = listener;\n listener = function () {\n target.removeEventListener(type, listener);\n originalListener_1.apply(this, arguments);\n };\n }\n var eventsKey = {\n target: target,\n type: type,\n listener: listener,\n };\n target.addEventListener(type, listener);\n return eventsKey;\n}\n/**\n * Registers a one-off event listener on an event target. Inspired by\n * https://google.github.io/closure-library/api/source/closure/goog/events/events.js.src.html\n *\n * This function efficiently binds a `listener` as self-unregistering listener\n * to a `this` object, and returns a key for use with\n * {@link module:ol/events.unlistenByKey} in case the listener needs to be\n * unregistered before it is called.\n *\n * When {@link module:ol/events.listen} is called with the same arguments after this\n * function, the self-unregistering listener will be turned into a permanent\n * listener.\n *\n * @param {import(\"./events/Target.js\").EventTargetLike} target Event target.\n * @param {string} type Event type.\n * @param {ListenerFunction} listener Listener.\n * @param {Object} [opt_this] Object referenced by the `this` keyword in the\n * listener. Default is the `target`.\n * @return {EventsKey} Key for unlistenByKey.\n */\nexport function listenOnce(target, type, listener, opt_this) {\n return listen(target, type, listener, opt_this, true);\n}\n/**\n * Unregisters event listeners on an event target. Inspired by\n * https://google.github.io/closure-library/api/source/closure/goog/events/events.js.src.html\n *\n * The argument passed to this function is the key returned from\n * {@link module:ol/events.listen} or {@link module:ol/events.listenOnce}.\n *\n * @param {EventsKey} key The key.\n */\nexport function unlistenByKey(key) {\n if (key && key.target) {\n key.target.removeEventListener(key.type, key.listener);\n clear(key);\n }\n}\n//# sourceMappingURL=events.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/Observable\n */\nimport EventTarget from './events/Target.js';\nimport EventType from './events/EventType.js';\nimport { listen, listenOnce, unlistenByKey } from './events.js';\n/***\n * @template {string} Type\n * @template {Event|import(\"./events/Event.js\").default} EventClass\n * @template Return\n * @typedef {(type: Type, listener: (event: EventClass) => ?) => Return} OnSignature\n */\n/***\n * @template {string} Type\n * @template Return\n * @typedef {(type: Type[], listener: (event: Event|import(\"./events/Event\").default) => ?) => Return extends void ? void : Return[]} CombinedOnSignature\n */\n/**\n * @typedef {'change'|'error'} EventTypes\n */\n/***\n * @template Return\n * @typedef {OnSignature & CombinedOnSignature} ObservableOnSignature\n */\n/**\n * @classdesc\n * Abstract base class; normally only used for creating subclasses and not\n * instantiated in apps.\n * An event target providing convenient methods for listener registration\n * and unregistration. A generic `change` event is always available through\n * {@link module:ol/Observable~Observable#changed}.\n *\n * @fires import(\"./events/Event.js\").default\n * @api\n */\nvar Observable = /** @class */ (function (_super) {\n __extends(Observable, _super);\n function Observable() {\n var _this = _super.call(this) || this;\n _this.on =\n /** @type {ObservableOnSignature} */ (_this.onInternal);\n _this.once =\n /** @type {ObservableOnSignature} */ (_this.onceInternal);\n _this.un = /** @type {ObservableOnSignature} */ (_this.unInternal);\n /**\n * @private\n * @type {number}\n */\n _this.revision_ = 0;\n return _this;\n }\n /**\n * Increases the revision counter and dispatches a 'change' event.\n * @api\n */\n Observable.prototype.changed = function () {\n ++this.revision_;\n this.dispatchEvent(EventType.CHANGE);\n };\n /**\n * Get the version number for this object. Each time the object is modified,\n * its version number will be incremented.\n * @return {number} Revision.\n * @api\n */\n Observable.prototype.getRevision = function () {\n return this.revision_;\n };\n /**\n * @param {string|Array} type Type.\n * @param {function((Event|import(\"./events/Event\").default)): ?} listener Listener.\n * @return {import(\"./events.js\").EventsKey|Array} Event key.\n * @protected\n */\n Observable.prototype.onInternal = function (type, listener) {\n if (Array.isArray(type)) {\n var len = type.length;\n var keys = new Array(len);\n for (var i = 0; i < len; ++i) {\n keys[i] = listen(this, type[i], listener);\n }\n return keys;\n }\n else {\n return listen(this, /** @type {string} */ (type), listener);\n }\n };\n /**\n * @param {string|Array} type Type.\n * @param {function((Event|import(\"./events/Event\").default)): ?} listener Listener.\n * @return {import(\"./events.js\").EventsKey|Array} Event key.\n * @protected\n */\n Observable.prototype.onceInternal = function (type, listener) {\n var key;\n if (Array.isArray(type)) {\n var len = type.length;\n key = new Array(len);\n for (var i = 0; i < len; ++i) {\n key[i] = listenOnce(this, type[i], listener);\n }\n }\n else {\n key = listenOnce(this, /** @type {string} */ (type), listener);\n }\n /** @type {Object} */ (listener).ol_key = key;\n return key;\n };\n /**\n * Unlisten for a certain type of event.\n * @param {string|Array} type Type.\n * @param {function((Event|import(\"./events/Event\").default)): ?} listener Listener.\n * @protected\n */\n Observable.prototype.unInternal = function (type, listener) {\n var key = /** @type {Object} */ (listener).ol_key;\n if (key) {\n unByKey(key);\n }\n else if (Array.isArray(type)) {\n for (var i = 0, ii = type.length; i < ii; ++i) {\n this.removeEventListener(type[i], listener);\n }\n }\n else {\n this.removeEventListener(type, listener);\n }\n };\n return Observable;\n}(EventTarget));\n/**\n * Listen for a certain type of event.\n * @function\n * @param {string|Array} type The event type or array of event types.\n * @param {function((Event|import(\"./events/Event\").default)): ?} listener The listener function.\n * @return {import(\"./events.js\").EventsKey|Array} Unique key for the listener. If\n * called with an array of event types as the first argument, the return\n * will be an array of keys.\n * @api\n */\nObservable.prototype.on;\n/**\n * Listen once for a certain type of event.\n * @function\n * @param {string|Array} type The event type or array of event types.\n * @param {function((Event|import(\"./events/Event\").default)): ?} listener The listener function.\n * @return {import(\"./events.js\").EventsKey|Array} Unique key for the listener. If\n * called with an array of event types as the first argument, the return\n * will be an array of keys.\n * @api\n */\nObservable.prototype.once;\n/**\n * Unlisten for a certain type of event.\n * @function\n * @param {string|Array} type The event type or array of event types.\n * @param {function((Event|import(\"./events/Event\").default)): ?} listener The listener function.\n * @api\n */\nObservable.prototype.un;\n/**\n * Removes an event listener using the key returned by `on()` or `once()`.\n * @param {import(\"./events.js\").EventsKey|Array} key The key returned by `on()`\n * or `once()` (or an array of keys).\n * @api\n */\nexport function unByKey(key) {\n if (Array.isArray(key)) {\n for (var i = 0, ii = key.length; i < ii; ++i) {\n unlistenByKey(key[i]);\n }\n }\n else {\n unlistenByKey(/** @type {import(\"./events.js\").EventsKey} */ (key));\n }\n}\nexport default Observable;\n//# sourceMappingURL=Observable.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/Object\n */\nimport Event from './events/Event.js';\nimport ObjectEventType from './ObjectEventType.js';\nimport Observable from './Observable.js';\nimport { assign, isEmpty } from './obj.js';\nimport { getUid } from './util.js';\n/**\n * @classdesc\n * Events emitted by {@link module:ol/Object~BaseObject} instances are instances of this type.\n */\nvar ObjectEvent = /** @class */ (function (_super) {\n __extends(ObjectEvent, _super);\n /**\n * @param {string} type The event type.\n * @param {string} key The property name.\n * @param {*} oldValue The old value for `key`.\n */\n function ObjectEvent(type, key, oldValue) {\n var _this = _super.call(this, type) || this;\n /**\n * The name of the property whose value is changing.\n * @type {string}\n * @api\n */\n _this.key = key;\n /**\n * The old value. To get the new value use `e.target.get(e.key)` where\n * `e` is the event object.\n * @type {*}\n * @api\n */\n _this.oldValue = oldValue;\n return _this;\n }\n return ObjectEvent;\n}(Event));\nexport { ObjectEvent };\n/***\n * @template Return\n * @typedef {import(\"./Observable\").OnSignature &\n * import(\"./Observable\").OnSignature &\n * import(\"./Observable\").CombinedOnSignature} ObjectOnSignature\n */\n/**\n * @classdesc\n * Abstract base class; normally only used for creating subclasses and not\n * instantiated in apps.\n * Most non-trivial classes inherit from this.\n *\n * This extends {@link module:ol/Observable} with observable\n * properties, where each property is observable as well as the object as a\n * whole.\n *\n * Classes that inherit from this have pre-defined properties, to which you can\n * add your owns. The pre-defined properties are listed in this documentation as\n * 'Observable Properties', and have their own accessors; for example,\n * {@link module:ol/Map~Map} has a `target` property, accessed with\n * `getTarget()` and changed with `setTarget()`. Not all properties are however\n * settable. There are also general-purpose accessors `get()` and `set()`. For\n * example, `get('target')` is equivalent to `getTarget()`.\n *\n * The `set` accessors trigger a change event, and you can monitor this by\n * registering a listener. For example, {@link module:ol/View~View} has a\n * `center` property, so `view.on('change:center', function(evt) {...});` would\n * call the function whenever the value of the center property changes. Within\n * the function, `evt.target` would be the view, so `evt.target.getCenter()`\n * would return the new center.\n *\n * You can add your own observable properties with\n * `object.set('prop', 'value')`, and retrieve that with `object.get('prop')`.\n * You can listen for changes on that property value with\n * `object.on('change:prop', listener)`. You can get a list of all\n * properties with {@link module:ol/Object~BaseObject#getProperties}.\n *\n * Note that the observable properties are separate from standard JS properties.\n * You can, for example, give your map object a title with\n * `map.title='New title'` and with `map.set('title', 'Another title')`. The\n * first will be a `hasOwnProperty`; the second will appear in\n * `getProperties()`. Only the second is observable.\n *\n * Properties can be deleted by using the unset method. E.g.\n * object.unset('foo').\n *\n * @fires ObjectEvent\n * @api\n */\nvar BaseObject = /** @class */ (function (_super) {\n __extends(BaseObject, _super);\n /**\n * @param {Object} [opt_values] An object with key-value pairs.\n */\n function BaseObject(opt_values) {\n var _this = _super.call(this) || this;\n /***\n * @type {ObjectOnSignature}\n */\n _this.on;\n /***\n * @type {ObjectOnSignature}\n */\n _this.once;\n /***\n * @type {ObjectOnSignature}\n */\n _this.un;\n // Call {@link module:ol/util.getUid} to ensure that the order of objects' ids is\n // the same as the order in which they were created. This also helps to\n // ensure that object properties are always added in the same order, which\n // helps many JavaScript engines generate faster code.\n getUid(_this);\n /**\n * @private\n * @type {Object}\n */\n _this.values_ = null;\n if (opt_values !== undefined) {\n _this.setProperties(opt_values);\n }\n return _this;\n }\n /**\n * Gets a value.\n * @param {string} key Key name.\n * @return {*} Value.\n * @api\n */\n BaseObject.prototype.get = function (key) {\n var value;\n if (this.values_ && this.values_.hasOwnProperty(key)) {\n value = this.values_[key];\n }\n return value;\n };\n /**\n * Get a list of object property names.\n * @return {Array} List of property names.\n * @api\n */\n BaseObject.prototype.getKeys = function () {\n return (this.values_ && Object.keys(this.values_)) || [];\n };\n /**\n * Get an object of all property names and values.\n * @return {Object} Object.\n * @api\n */\n BaseObject.prototype.getProperties = function () {\n return (this.values_ && assign({}, this.values_)) || {};\n };\n /**\n * @return {boolean} The object has properties.\n */\n BaseObject.prototype.hasProperties = function () {\n return !!this.values_;\n };\n /**\n * @param {string} key Key name.\n * @param {*} oldValue Old value.\n */\n BaseObject.prototype.notify = function (key, oldValue) {\n var eventType;\n eventType = \"change:\" + key;\n this.dispatchEvent(new ObjectEvent(eventType, key, oldValue));\n eventType = ObjectEventType.PROPERTYCHANGE;\n this.dispatchEvent(new ObjectEvent(eventType, key, oldValue));\n };\n /**\n * @param {string} key Key name.\n * @param {import(\"./events.js\").Listener} listener Listener.\n */\n BaseObject.prototype.addChangeListener = function (key, listener) {\n this.addEventListener(\"change:\" + key, listener);\n };\n /**\n * @param {string} key Key name.\n * @param {import(\"./events.js\").Listener} listener Listener.\n */\n BaseObject.prototype.removeChangeListener = function (key, listener) {\n this.removeEventListener(\"change:\" + key, listener);\n };\n /**\n * Sets a value.\n * @param {string} key Key name.\n * @param {*} value Value.\n * @param {boolean} [opt_silent] Update without triggering an event.\n * @api\n */\n BaseObject.prototype.set = function (key, value, opt_silent) {\n var values = this.values_ || (this.values_ = {});\n if (opt_silent) {\n values[key] = value;\n }\n else {\n var oldValue = values[key];\n values[key] = value;\n if (oldValue !== value) {\n this.notify(key, oldValue);\n }\n }\n };\n /**\n * Sets a collection of key-value pairs. Note that this changes any existing\n * properties and adds new ones (it does not remove any existing properties).\n * @param {Object} values Values.\n * @param {boolean} [opt_silent] Update without triggering an event.\n * @api\n */\n BaseObject.prototype.setProperties = function (values, opt_silent) {\n for (var key in values) {\n this.set(key, values[key], opt_silent);\n }\n };\n /**\n * Apply any properties from another object without triggering events.\n * @param {BaseObject} source The source object.\n * @protected\n */\n BaseObject.prototype.applyProperties = function (source) {\n if (!source.values_) {\n return;\n }\n assign(this.values_ || (this.values_ = {}), source.values_);\n };\n /**\n * Unsets a property.\n * @param {string} key Key name.\n * @param {boolean} [opt_silent] Unset without triggering an event.\n * @api\n */\n BaseObject.prototype.unset = function (key, opt_silent) {\n if (this.values_ && key in this.values_) {\n var oldValue = this.values_[key];\n delete this.values_[key];\n if (isEmpty(this.values_)) {\n this.values_ = null;\n }\n if (!opt_silent) {\n this.notify(key, oldValue);\n }\n }\n };\n return BaseObject;\n}(Observable));\nexport default BaseObject;\n//# sourceMappingURL=Object.js.map","/**\n * @module ol/layer/Property\n */\n/**\n * @enum {string}\n */\nexport default {\n OPACITY: 'opacity',\n VISIBLE: 'visible',\n EXTENT: 'extent',\n Z_INDEX: 'zIndex',\n MAX_RESOLUTION: 'maxResolution',\n MIN_RESOLUTION: 'minResolution',\n MAX_ZOOM: 'maxZoom',\n MIN_ZOOM: 'minZoom',\n SOURCE: 'source',\n};\n//# sourceMappingURL=Property.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/layer/Base\n */\nimport BaseObject from '../Object.js';\nimport LayerProperty from './Property.js';\nimport { abstract } from '../util.js';\nimport { assert } from '../asserts.js';\nimport { assign } from '../obj.js';\nimport { clamp } from '../math.js';\n/**\n * @typedef {import(\"../ObjectEventType\").Types|'change:extent'|'change:maxResolution'|'change:maxZoom'|\n * 'change:minResolution'|'change:minZoom'|'change:opacity'|'change:visible'|'change:zIndex'} BaseLayerObjectEventTypes\n */\n/***\n * @template Return\n * @typedef {import(\"../Observable\").OnSignature &\n * import(\"../Observable\").OnSignature &\n * import(\"../Observable\").CombinedOnSignature} BaseLayerOnSignature\n */\n/**\n * @typedef {Object} Options\n * @property {string} [className='ol-layer'] A CSS class name to set to the layer element.\n * @property {number} [opacity=1] Opacity (0, 1).\n * @property {boolean} [visible=true] Visibility.\n * @property {import(\"../extent.js\").Extent} [extent] The bounding extent for layer rendering. The layer will not be\n * rendered outside of this extent.\n * @property {number} [zIndex] The z-index for layer rendering. At rendering time, the layers\n * will be ordered, first by Z-index and then by position. When `undefined`, a `zIndex` of 0 is assumed\n * for layers that are added to the map's `layers` collection, or `Infinity` when the layer's `setMap()`\n * method was used.\n * @property {number} [minResolution] The minimum resolution (inclusive) at which this layer will be\n * visible.\n * @property {number} [maxResolution] The maximum resolution (exclusive) below which this layer will\n * be visible.\n * @property {number} [minZoom] The minimum view zoom level (exclusive) above which this layer will be\n * visible.\n * @property {number} [maxZoom] The maximum view zoom level (inclusive) at which this layer will\n * be visible.\n * @property {Object} [properties] Arbitrary observable properties. Can be accessed with `#get()` and `#set()`.\n */\n/**\n * @classdesc\n * Abstract base class; normally only used for creating subclasses and not\n * instantiated in apps.\n * Note that with {@link module:ol/layer/Base} and all its subclasses, any property set in\n * the options is set as a {@link module:ol/Object} property on the layer object, so\n * is observable, and has get/set accessors.\n *\n * @api\n */\nvar BaseLayer = /** @class */ (function (_super) {\n __extends(BaseLayer, _super);\n /**\n * @param {Options} options Layer options.\n */\n function BaseLayer(options) {\n var _this = _super.call(this) || this;\n /***\n * @type {BaseLayerOnSignature}\n */\n _this.on;\n /***\n * @type {BaseLayerOnSignature}\n */\n _this.once;\n /***\n * @type {BaseLayerOnSignature}\n */\n _this.un;\n /**\n * @type {Object}\n */\n var properties = assign({}, options);\n if (typeof options.properties === 'object') {\n delete properties.properties;\n assign(properties, options.properties);\n }\n properties[LayerProperty.OPACITY] =\n options.opacity !== undefined ? options.opacity : 1;\n assert(typeof properties[LayerProperty.OPACITY] === 'number', 64); // Layer opacity must be a number\n properties[LayerProperty.VISIBLE] =\n options.visible !== undefined ? options.visible : true;\n properties[LayerProperty.Z_INDEX] = options.zIndex;\n properties[LayerProperty.MAX_RESOLUTION] =\n options.maxResolution !== undefined ? options.maxResolution : Infinity;\n properties[LayerProperty.MIN_RESOLUTION] =\n options.minResolution !== undefined ? options.minResolution : 0;\n properties[LayerProperty.MIN_ZOOM] =\n options.minZoom !== undefined ? options.minZoom : -Infinity;\n properties[LayerProperty.MAX_ZOOM] =\n options.maxZoom !== undefined ? options.maxZoom : Infinity;\n /**\n * @type {string}\n * @private\n */\n _this.className_ =\n properties.className !== undefined ? options.className : 'ol-layer';\n delete properties.className;\n _this.setProperties(properties);\n /**\n * @type {import(\"./Layer.js\").State}\n * @private\n */\n _this.state_ = null;\n return _this;\n }\n /**\n * @return {string} CSS class name.\n */\n BaseLayer.prototype.getClassName = function () {\n return this.className_;\n };\n /**\n * This method is not meant to be called by layers or layer renderers because the state\n * is incorrect if the layer is included in a layer group.\n *\n * @param {boolean} [opt_managed] Layer is managed.\n * @return {import(\"./Layer.js\").State} Layer state.\n */\n BaseLayer.prototype.getLayerState = function (opt_managed) {\n /** @type {import(\"./Layer.js\").State} */\n var state = this.state_ ||\n /** @type {?} */ ({\n layer: this,\n managed: opt_managed === undefined ? true : opt_managed,\n });\n var zIndex = this.getZIndex();\n state.opacity = clamp(Math.round(this.getOpacity() * 100) / 100, 0, 1);\n state.sourceState = this.getSourceState();\n state.visible = this.getVisible();\n state.extent = this.getExtent();\n state.zIndex = zIndex === undefined && !state.managed ? Infinity : zIndex;\n state.maxResolution = this.getMaxResolution();\n state.minResolution = Math.max(this.getMinResolution(), 0);\n state.minZoom = this.getMinZoom();\n state.maxZoom = this.getMaxZoom();\n this.state_ = state;\n return state;\n };\n /**\n * @abstract\n * @param {Array} [opt_array] Array of layers (to be\n * modified in place).\n * @return {Array} Array of layers.\n */\n BaseLayer.prototype.getLayersArray = function (opt_array) {\n return abstract();\n };\n /**\n * @abstract\n * @param {Array} [opt_states] Optional list of layer\n * states (to be modified in place).\n * @return {Array} List of layer states.\n */\n BaseLayer.prototype.getLayerStatesArray = function (opt_states) {\n return abstract();\n };\n /**\n * Return the {@link module:ol/extent~Extent extent} of the layer or `undefined` if it\n * will be visible regardless of extent.\n * @return {import(\"../extent.js\").Extent|undefined} The layer extent.\n * @observable\n * @api\n */\n BaseLayer.prototype.getExtent = function () {\n return /** @type {import(\"../extent.js\").Extent|undefined} */ (this.get(LayerProperty.EXTENT));\n };\n /**\n * Return the maximum resolution of the layer.\n * @return {number} The maximum resolution of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.getMaxResolution = function () {\n return /** @type {number} */ (this.get(LayerProperty.MAX_RESOLUTION));\n };\n /**\n * Return the minimum resolution of the layer.\n * @return {number} The minimum resolution of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.getMinResolution = function () {\n return /** @type {number} */ (this.get(LayerProperty.MIN_RESOLUTION));\n };\n /**\n * Return the minimum zoom level of the layer.\n * @return {number} The minimum zoom level of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.getMinZoom = function () {\n return /** @type {number} */ (this.get(LayerProperty.MIN_ZOOM));\n };\n /**\n * Return the maximum zoom level of the layer.\n * @return {number} The maximum zoom level of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.getMaxZoom = function () {\n return /** @type {number} */ (this.get(LayerProperty.MAX_ZOOM));\n };\n /**\n * Return the opacity of the layer (between 0 and 1).\n * @return {number} The opacity of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.getOpacity = function () {\n return /** @type {number} */ (this.get(LayerProperty.OPACITY));\n };\n /**\n * @abstract\n * @return {import(\"../source/State.js\").default} Source state.\n */\n BaseLayer.prototype.getSourceState = function () {\n return abstract();\n };\n /**\n * Return the visibility of the layer (`true` or `false`).\n * @return {boolean} The visibility of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.getVisible = function () {\n return /** @type {boolean} */ (this.get(LayerProperty.VISIBLE));\n };\n /**\n * Return the Z-index of the layer, which is used to order layers before\n * rendering. The default Z-index is 0.\n * @return {number} The Z-index of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.getZIndex = function () {\n return /** @type {number} */ (this.get(LayerProperty.Z_INDEX));\n };\n /**\n * Set the extent at which the layer is visible. If `undefined`, the layer\n * will be visible at all extents.\n * @param {import(\"../extent.js\").Extent|undefined} extent The extent of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.setExtent = function (extent) {\n this.set(LayerProperty.EXTENT, extent);\n };\n /**\n * Set the maximum resolution at which the layer is visible.\n * @param {number} maxResolution The maximum resolution of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.setMaxResolution = function (maxResolution) {\n this.set(LayerProperty.MAX_RESOLUTION, maxResolution);\n };\n /**\n * Set the minimum resolution at which the layer is visible.\n * @param {number} minResolution The minimum resolution of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.setMinResolution = function (minResolution) {\n this.set(LayerProperty.MIN_RESOLUTION, minResolution);\n };\n /**\n * Set the maximum zoom (exclusive) at which the layer is visible.\n * Note that the zoom levels for layer visibility are based on the\n * view zoom level, which may be different from a tile source zoom level.\n * @param {number} maxZoom The maximum zoom of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.setMaxZoom = function (maxZoom) {\n this.set(LayerProperty.MAX_ZOOM, maxZoom);\n };\n /**\n * Set the minimum zoom (inclusive) at which the layer is visible.\n * Note that the zoom levels for layer visibility are based on the\n * view zoom level, which may be different from a tile source zoom level.\n * @param {number} minZoom The minimum zoom of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.setMinZoom = function (minZoom) {\n this.set(LayerProperty.MIN_ZOOM, minZoom);\n };\n /**\n * Set the opacity of the layer, allowed values range from 0 to 1.\n * @param {number} opacity The opacity of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.setOpacity = function (opacity) {\n assert(typeof opacity === 'number', 64); // Layer opacity must be a number\n this.set(LayerProperty.OPACITY, opacity);\n };\n /**\n * Set the visibility of the layer (`true` or `false`).\n * @param {boolean} visible The visibility of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.setVisible = function (visible) {\n this.set(LayerProperty.VISIBLE, visible);\n };\n /**\n * Set Z-index of the layer, which is used to order layers before rendering.\n * The default Z-index is 0.\n * @param {number} zindex The z-index of the layer.\n * @observable\n * @api\n */\n BaseLayer.prototype.setZIndex = function (zindex) {\n this.set(LayerProperty.Z_INDEX, zindex);\n };\n /**\n * Clean up.\n */\n BaseLayer.prototype.disposeInternal = function () {\n if (this.state_) {\n this.state_.layer = null;\n this.state_ = null;\n }\n _super.prototype.disposeInternal.call(this);\n };\n return BaseLayer;\n}(BaseObject));\nexport default BaseLayer;\n//# sourceMappingURL=Base.js.map","/**\n * @module ol/render/EventType\n */\n/**\n * @enum {string}\n */\nexport default {\n /**\n * Triggered before a layer is rendered.\n * @event module:ol/render/Event~RenderEvent#prerender\n * @api\n */\n PRERENDER: 'prerender',\n /**\n * Triggered after a layer is rendered.\n * @event module:ol/render/Event~RenderEvent#postrender\n * @api\n */\n POSTRENDER: 'postrender',\n /**\n * Triggered before layers are rendered.\n * The event object will not have a `context` set.\n * @event module:ol/render/Event~RenderEvent#precompose\n * @api\n */\n PRECOMPOSE: 'precompose',\n /**\n * Triggered after all layers are rendered.\n * The event object will not have a `context` set.\n * @event module:ol/render/Event~RenderEvent#postcompose\n * @api\n */\n POSTCOMPOSE: 'postcompose',\n /**\n * Triggered when rendering is complete, i.e. all sources and tiles have\n * finished loading for the current viewport, and all tiles are faded in.\n * The event object will not have a `context` set.\n * @event module:ol/render/Event~RenderEvent#rendercomplete\n * @api\n */\n RENDERCOMPLETE: 'rendercomplete',\n};\n/**\n * @typedef {'postrender'|'precompose'|'postcompose'|'rendercomplete'} MapRenderEventTypes\n */\n/**\n * @typedef {'postrender'|'prerender'} LayerRenderEventTypes\n */\n//# sourceMappingURL=EventType.js.map","/**\n * @module ol/source/State\n */\n/**\n * @enum {string}\n * State of the source, one of 'undefined', 'loading', 'ready' or 'error'.\n */\nexport default {\n UNDEFINED: 'undefined',\n LOADING: 'loading',\n READY: 'ready',\n ERROR: 'error',\n};\n//# sourceMappingURL=State.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/layer/Layer\n */\nimport BaseLayer from './Base.js';\nimport EventType from '../events/EventType.js';\nimport LayerProperty from './Property.js';\nimport RenderEventType from '../render/EventType.js';\nimport SourceState from '../source/State.js';\nimport { assert } from '../asserts.js';\nimport { assign } from '../obj.js';\nimport { listen, unlistenByKey } from '../events.js';\n/**\n * @typedef {function(import(\"../PluggableMap.js\").FrameState):HTMLElement} RenderFunction\n */\n/***\n * @template Return\n * @typedef {import(\"../Observable\").OnSignature &\n * import(\"../Observable\").OnSignature &\n * import(\"../Observable\").OnSignature &\n * import(\"../Observable\").CombinedOnSignature} LayerOnSignature\n */\n/**\n * @template {import(\"../source/Source.js\").default} SourceType\n * @typedef {Object} Options\n * @property {string} [className='ol-layer'] A CSS class name to set to the layer element.\n * @property {number} [opacity=1] Opacity (0, 1).\n * @property {boolean} [visible=true] Visibility.\n * @property {import(\"../extent.js\").Extent} [extent] The bounding extent for layer rendering. The layer will not be\n * rendered outside of this extent.\n * @property {number} [zIndex] The z-index for layer rendering. At rendering time, the layers\n * will be ordered, first by Z-index and then by position. When `undefined`, a `zIndex` of 0 is assumed\n * for layers that are added to the map's `layers` collection, or `Infinity` when the layer's `setMap()`\n * method was used.\n * @property {number} [minResolution] The minimum resolution (inclusive) at which this layer will be\n * visible.\n * @property {number} [maxResolution] The maximum resolution (exclusive) below which this layer will\n * be visible.\n * @property {number} [minZoom] The minimum view zoom level (exclusive) above which this layer will be\n * visible.\n * @property {number} [maxZoom] The maximum view zoom level (inclusive) at which this layer will\n * be visible.\n * @property {SourceType} [source] Source for this layer. If not provided to the constructor,\n * the source can be set by calling {@link module:ol/layer/Layer~Layer#setSource layer.setSource(source)} after\n * construction.\n * @property {import(\"../PluggableMap.js\").default} [map] Map.\n * @property {RenderFunction} [render] Render function. Takes the frame state as input and is expected to return an\n * HTML element. Will overwrite the default rendering for the layer.\n * @property {Object} [properties] Arbitrary observable properties. Can be accessed with `#get()` and `#set()`.\n */\n/**\n * @typedef {Object} State\n * @property {import(\"./Layer.js\").default} layer Layer.\n * @property {number} opacity Opacity, the value is rounded to two digits to appear after the decimal point.\n * @property {import(\"../source/State.js\").default} sourceState SourceState.\n * @property {boolean} visible Visible.\n * @property {boolean} managed Managed.\n * @property {import(\"../extent.js\").Extent} [extent] Extent.\n * @property {number} zIndex ZIndex.\n * @property {number} maxResolution Maximum resolution.\n * @property {number} minResolution Minimum resolution.\n * @property {number} minZoom Minimum zoom.\n * @property {number} maxZoom Maximum zoom.\n */\n/**\n * @classdesc\n * Base class from which all layer types are derived. This should only be instantiated\n * in the case where a custom layer is be added to the map with a custom `render` function.\n * Such a function can be specified in the `options` object, and is expected to return an HTML element.\n *\n * A visual representation of raster or vector map data.\n * Layers group together those properties that pertain to how the data is to be\n * displayed, irrespective of the source of that data.\n *\n * Layers are usually added to a map with {@link import(\"../PluggableMap.js\").default#addLayer map.addLayer()}. Components\n * like {@link module:ol/interaction/Draw~Draw} use unmanaged layers\n * internally. These unmanaged layers are associated with the map using\n * {@link module:ol/layer/Layer~Layer#setMap} instead.\n *\n * A generic `change` event is fired when the state of the source changes.\n *\n * Please note that for performance reasons several layers might get rendered to\n * the same HTML element, which will cause {@link import(\"../PluggableMap.js\").default#forEachLayerAtPixel map.forEachLayerAtPixel()} to\n * give false positives. To avoid this, apply different `className` properties to the\n * layers at creation time.\n *\n * @fires import(\"../render/Event.js\").RenderEvent#prerender\n * @fires import(\"../render/Event.js\").RenderEvent#postrender\n *\n * @template {import(\"../source/Source.js\").default} SourceType\n * @api\n */\nvar Layer = /** @class */ (function (_super) {\n __extends(Layer, _super);\n /**\n * @param {Options} options Layer options.\n */\n function Layer(options) {\n var _this = this;\n var baseOptions = assign({}, options);\n delete baseOptions.source;\n _this = _super.call(this, baseOptions) || this;\n /***\n * @type {LayerOnSignature}\n */\n _this.on;\n /***\n * @type {LayerOnSignature}\n */\n _this.once;\n /***\n * @type {LayerOnSignature}\n */\n _this.un;\n /**\n * @private\n * @type {?import(\"../events.js\").EventsKey}\n */\n _this.mapPrecomposeKey_ = null;\n /**\n * @private\n * @type {?import(\"../events.js\").EventsKey}\n */\n _this.mapRenderKey_ = null;\n /**\n * @private\n * @type {?import(\"../events.js\").EventsKey}\n */\n _this.sourceChangeKey_ = null;\n /**\n * @private\n * @type {import(\"../renderer/Layer.js\").default}\n */\n _this.renderer_ = null;\n // Overwrite default render method with a custom one\n if (options.render) {\n _this.render = options.render;\n }\n if (options.map) {\n _this.setMap(options.map);\n }\n _this.addChangeListener(LayerProperty.SOURCE, _this.handleSourcePropertyChange_);\n var source = options.source\n ? /** @type {SourceType} */ (options.source)\n : null;\n _this.setSource(source);\n return _this;\n }\n /**\n * @param {Array} [opt_array] Array of layers (to be modified in place).\n * @return {Array} Array of layers.\n */\n Layer.prototype.getLayersArray = function (opt_array) {\n var array = opt_array ? opt_array : [];\n array.push(this);\n return array;\n };\n /**\n * @param {Array} [opt_states] Optional list of layer states (to be modified in place).\n * @return {Array} List of layer states.\n */\n Layer.prototype.getLayerStatesArray = function (opt_states) {\n var states = opt_states ? opt_states : [];\n states.push(this.getLayerState());\n return states;\n };\n /**\n * Get the layer source.\n * @return {SourceType} The layer source (or `null` if not yet set).\n * @observable\n * @api\n */\n Layer.prototype.getSource = function () {\n return /** @type {SourceType} */ (this.get(LayerProperty.SOURCE)) || null;\n };\n /**\n * @return {import(\"../source/State.js\").default} Source state.\n */\n Layer.prototype.getSourceState = function () {\n var source = this.getSource();\n return !source ? SourceState.UNDEFINED : source.getState();\n };\n /**\n * @private\n */\n Layer.prototype.handleSourceChange_ = function () {\n this.changed();\n };\n /**\n * @private\n */\n Layer.prototype.handleSourcePropertyChange_ = function () {\n if (this.sourceChangeKey_) {\n unlistenByKey(this.sourceChangeKey_);\n this.sourceChangeKey_ = null;\n }\n var source = this.getSource();\n if (source) {\n this.sourceChangeKey_ = listen(source, EventType.CHANGE, this.handleSourceChange_, this);\n }\n this.changed();\n };\n /**\n * @param {import(\"../pixel\").Pixel} pixel Pixel.\n * @return {Promise>} Promise that resolves with\n * an array of features.\n */\n Layer.prototype.getFeatures = function (pixel) {\n if (!this.renderer_) {\n return new Promise(function (resolve) { return resolve([]); });\n }\n return this.renderer_.getFeatures(pixel);\n };\n /**\n * In charge to manage the rendering of the layer. One layer type is\n * bounded with one layer renderer.\n * @param {?import(\"../PluggableMap.js\").FrameState} frameState Frame state.\n * @param {HTMLElement} target Target which the renderer may (but need not) use\n * for rendering its content.\n * @return {HTMLElement} The rendered element.\n */\n Layer.prototype.render = function (frameState, target) {\n var layerRenderer = this.getRenderer();\n if (layerRenderer.prepareFrame(frameState)) {\n return layerRenderer.renderFrame(frameState, target);\n }\n };\n /**\n * Sets the layer to be rendered on top of other layers on a map. The map will\n * not manage this layer in its layers collection, and the callback in\n * {@link module:ol/Map~Map#forEachLayerAtPixel} will receive `null` as layer. This\n * is useful for temporary layers. To remove an unmanaged layer from the map,\n * use `#setMap(null)`.\n *\n * To add the layer to a map and have it managed by the map, use\n * {@link module:ol/Map~Map#addLayer} instead.\n * @param {import(\"../PluggableMap.js\").default} map Map.\n * @api\n */\n Layer.prototype.setMap = function (map) {\n if (this.mapPrecomposeKey_) {\n unlistenByKey(this.mapPrecomposeKey_);\n this.mapPrecomposeKey_ = null;\n }\n if (!map) {\n this.changed();\n }\n if (this.mapRenderKey_) {\n unlistenByKey(this.mapRenderKey_);\n this.mapRenderKey_ = null;\n }\n if (map) {\n this.mapPrecomposeKey_ = listen(map, RenderEventType.PRECOMPOSE, function (evt) {\n var renderEvent = \n /** @type {import(\"../render/Event.js\").default} */ (evt);\n var layerStatesArray = renderEvent.frameState.layerStatesArray;\n var layerState = this.getLayerState(false);\n // A layer can only be added to the map once. Use either `layer.setMap()` or `map.addLayer()`, not both.\n assert(!layerStatesArray.some(function (arrayLayerState) {\n return arrayLayerState.layer === layerState.layer;\n }), 67);\n layerStatesArray.push(layerState);\n }, this);\n this.mapRenderKey_ = listen(this, EventType.CHANGE, map.render, map);\n this.changed();\n }\n };\n /**\n * Set the layer source.\n * @param {SourceType} source The layer source.\n * @observable\n * @api\n */\n Layer.prototype.setSource = function (source) {\n this.set(LayerProperty.SOURCE, source);\n };\n /**\n * Get the renderer for this layer.\n * @return {import(\"../renderer/Layer.js\").default} The layer renderer.\n */\n Layer.prototype.getRenderer = function () {\n if (!this.renderer_) {\n this.renderer_ = this.createRenderer();\n }\n return this.renderer_;\n };\n /**\n * @return {boolean} The layer has a renderer.\n */\n Layer.prototype.hasRenderer = function () {\n return !!this.renderer_;\n };\n /**\n * Create a renderer for this layer.\n * @return {import(\"../renderer/Layer.js\").default} A layer renderer.\n * @protected\n */\n Layer.prototype.createRenderer = function () {\n return null;\n };\n /**\n * Clean up.\n */\n Layer.prototype.disposeInternal = function () {\n if (this.renderer_) {\n this.renderer_.dispose();\n delete this.renderer_;\n }\n this.setSource(null);\n _super.prototype.disposeInternal.call(this);\n };\n return Layer;\n}(BaseLayer));\n/**\n * Return `true` if the layer is visible and if the provided view state\n * has resolution and zoom levels that are in range of the layer's min/max.\n * @param {State} layerState Layer state.\n * @param {import(\"../View.js\").State} viewState View state.\n * @return {boolean} The layer is visible at the given view state.\n */\nexport function inView(layerState, viewState) {\n if (!layerState.visible) {\n return false;\n }\n var resolution = viewState.resolution;\n if (resolution < layerState.minResolution ||\n resolution >= layerState.maxResolution) {\n return false;\n }\n var zoom = viewState.zoom;\n return zoom > layerState.minZoom && zoom <= layerState.maxZoom;\n}\nexport default Layer;\n//# sourceMappingURL=Layer.js.map","/**\n * @module ol/coordinate\n */\nimport { getWidth } from './extent.js';\nimport { modulo } from './math.js';\nimport { padNumber } from './string.js';\n/**\n * An array of numbers representing an xy coordinate. Example: `[16, 48]`.\n * @typedef {Array} Coordinate\n * @api\n */\n/**\n * A function that takes a {@link module:ol/coordinate~Coordinate} and\n * transforms it into a `{string}`.\n *\n * @typedef {function((Coordinate|undefined)): string} CoordinateFormat\n * @api\n */\n/**\n * Add `delta` to `coordinate`. `coordinate` is modified in place and returned\n * by the function.\n *\n * Example:\n *\n * import {add} from 'ol/coordinate';\n *\n * var coord = [7.85, 47.983333];\n * add(coord, [-2, 4]);\n * // coord is now [5.85, 51.983333]\n *\n * @param {Coordinate} coordinate Coordinate.\n * @param {Coordinate} delta Delta.\n * @return {Coordinate} The input coordinate adjusted by\n * the given delta.\n * @api\n */\nexport function add(coordinate, delta) {\n coordinate[0] += +delta[0];\n coordinate[1] += +delta[1];\n return coordinate;\n}\n/**\n * Calculates the point closest to the passed coordinate on the passed circle.\n *\n * @param {Coordinate} coordinate The coordinate.\n * @param {import(\"./geom/Circle.js\").default} circle The circle.\n * @return {Coordinate} Closest point on the circumference.\n */\nexport function closestOnCircle(coordinate, circle) {\n var r = circle.getRadius();\n var center = circle.getCenter();\n var x0 = center[0];\n var y0 = center[1];\n var x1 = coordinate[0];\n var y1 = coordinate[1];\n var dx = x1 - x0;\n var dy = y1 - y0;\n if (dx === 0 && dy === 0) {\n dx = 1;\n }\n var d = Math.sqrt(dx * dx + dy * dy);\n var x = x0 + (r * dx) / d;\n var y = y0 + (r * dy) / d;\n return [x, y];\n}\n/**\n * Calculates the point closest to the passed coordinate on the passed segment.\n * This is the foot of the perpendicular of the coordinate to the segment when\n * the foot is on the segment, or the closest segment coordinate when the foot\n * is outside the segment.\n *\n * @param {Coordinate} coordinate The coordinate.\n * @param {Array} segment The two coordinates\n * of the segment.\n * @return {Coordinate} The foot of the perpendicular of\n * the coordinate to the segment.\n */\nexport function closestOnSegment(coordinate, segment) {\n var x0 = coordinate[0];\n var y0 = coordinate[1];\n var start = segment[0];\n var end = segment[1];\n var x1 = start[0];\n var y1 = start[1];\n var x2 = end[0];\n var y2 = end[1];\n var dx = x2 - x1;\n var dy = y2 - y1;\n var along = dx === 0 && dy === 0\n ? 0\n : (dx * (x0 - x1) + dy * (y0 - y1)) / (dx * dx + dy * dy || 0);\n var x, y;\n if (along <= 0) {\n x = x1;\n y = y1;\n }\n else if (along >= 1) {\n x = x2;\n y = y2;\n }\n else {\n x = x1 + along * dx;\n y = y1 + along * dy;\n }\n return [x, y];\n}\n/**\n * Returns a {@link module:ol/coordinate~CoordinateFormat} function that can be\n * used to format\n * a {Coordinate} to a string.\n *\n * Example without specifying the fractional digits:\n *\n * import {createStringXY} from 'ol/coordinate';\n *\n * var coord = [7.85, 47.983333];\n * var stringifyFunc = createStringXY();\n * var out = stringifyFunc(coord);\n * // out is now '8, 48'\n *\n * Example with explicitly specifying 2 fractional digits:\n *\n * import {createStringXY} from 'ol/coordinate';\n *\n * var coord = [7.85, 47.983333];\n * var stringifyFunc = createStringXY(2);\n * var out = stringifyFunc(coord);\n * // out is now '7.85, 47.98'\n *\n * @param {number} [opt_fractionDigits] The number of digits to include\n * after the decimal point. Default is `0`.\n * @return {CoordinateFormat} Coordinate format.\n * @api\n */\nexport function createStringXY(opt_fractionDigits) {\n return (\n /**\n * @param {Coordinate} coordinate Coordinate.\n * @return {string} String XY.\n */\n function (coordinate) {\n return toStringXY(coordinate, opt_fractionDigits);\n });\n}\n/**\n * @param {string} hemispheres Hemispheres.\n * @param {number} degrees Degrees.\n * @param {number} [opt_fractionDigits] The number of digits to include\n * after the decimal point. Default is `0`.\n * @return {string} String.\n */\nexport function degreesToStringHDMS(hemispheres, degrees, opt_fractionDigits) {\n var normalizedDegrees = modulo(degrees + 180, 360) - 180;\n var x = Math.abs(3600 * normalizedDegrees);\n var dflPrecision = opt_fractionDigits || 0;\n var precision = Math.pow(10, dflPrecision);\n var deg = Math.floor(x / 3600);\n var min = Math.floor((x - deg * 3600) / 60);\n var sec = x - deg * 3600 - min * 60;\n sec = Math.ceil(sec * precision) / precision;\n if (sec >= 60) {\n sec = 0;\n min += 1;\n }\n if (min >= 60) {\n min = 0;\n deg += 1;\n }\n return (deg +\n '\\u00b0 ' +\n padNumber(min, 2) +\n '\\u2032 ' +\n padNumber(sec, 2, dflPrecision) +\n '\\u2033' +\n (normalizedDegrees == 0\n ? ''\n : ' ' + hemispheres.charAt(normalizedDegrees < 0 ? 1 : 0)));\n}\n/**\n * Transforms the given {@link module:ol/coordinate~Coordinate} to a string\n * using the given string template. The strings `{x}` and `{y}` in the template\n * will be replaced with the first and second coordinate values respectively.\n *\n * Example without specifying the fractional digits:\n *\n * import {format} from 'ol/coordinate';\n *\n * var coord = [7.85, 47.983333];\n * var template = 'Coordinate is ({x}|{y}).';\n * var out = format(coord, template);\n * // out is now 'Coordinate is (8|48).'\n *\n * Example explicitly specifying the fractional digits:\n *\n * import {format} from 'ol/coordinate';\n *\n * var coord = [7.85, 47.983333];\n * var template = 'Coordinate is ({x}|{y}).';\n * var out = format(coord, template, 2);\n * // out is now 'Coordinate is (7.85|47.98).'\n *\n * @param {Coordinate} coordinate Coordinate.\n * @param {string} template A template string with `{x}` and `{y}` placeholders\n * that will be replaced by first and second coordinate values.\n * @param {number} [opt_fractionDigits] The number of digits to include\n * after the decimal point. Default is `0`.\n * @return {string} Formatted coordinate.\n * @api\n */\nexport function format(coordinate, template, opt_fractionDigits) {\n if (coordinate) {\n return template\n .replace('{x}', coordinate[0].toFixed(opt_fractionDigits))\n .replace('{y}', coordinate[1].toFixed(opt_fractionDigits));\n }\n else {\n return '';\n }\n}\n/**\n * @param {Coordinate} coordinate1 First coordinate.\n * @param {Coordinate} coordinate2 Second coordinate.\n * @return {boolean} The two coordinates are equal.\n */\nexport function equals(coordinate1, coordinate2) {\n var equals = true;\n for (var i = coordinate1.length - 1; i >= 0; --i) {\n if (coordinate1[i] != coordinate2[i]) {\n equals = false;\n break;\n }\n }\n return equals;\n}\n/**\n * Rotate `coordinate` by `angle`. `coordinate` is modified in place and\n * returned by the function.\n *\n * Example:\n *\n * import {rotate} from 'ol/coordinate';\n *\n * var coord = [7.85, 47.983333];\n * var rotateRadians = Math.PI / 2; // 90 degrees\n * rotate(coord, rotateRadians);\n * // coord is now [-47.983333, 7.85]\n *\n * @param {Coordinate} coordinate Coordinate.\n * @param {number} angle Angle in radian.\n * @return {Coordinate} Coordinate.\n * @api\n */\nexport function rotate(coordinate, angle) {\n var cosAngle = Math.cos(angle);\n var sinAngle = Math.sin(angle);\n var x = coordinate[0] * cosAngle - coordinate[1] * sinAngle;\n var y = coordinate[1] * cosAngle + coordinate[0] * sinAngle;\n coordinate[0] = x;\n coordinate[1] = y;\n return coordinate;\n}\n/**\n * Scale `coordinate` by `scale`. `coordinate` is modified in place and returned\n * by the function.\n *\n * Example:\n *\n * import {scale as scaleCoordinate} from 'ol/coordinate';\n *\n * var coord = [7.85, 47.983333];\n * var scale = 1.2;\n * scaleCoordinate(coord, scale);\n * // coord is now [9.42, 57.5799996]\n *\n * @param {Coordinate} coordinate Coordinate.\n * @param {number} scale Scale factor.\n * @return {Coordinate} Coordinate.\n */\nexport function scale(coordinate, scale) {\n coordinate[0] *= scale;\n coordinate[1] *= scale;\n return coordinate;\n}\n/**\n * @param {Coordinate} coord1 First coordinate.\n * @param {Coordinate} coord2 Second coordinate.\n * @return {number} Squared distance between coord1 and coord2.\n */\nexport function squaredDistance(coord1, coord2) {\n var dx = coord1[0] - coord2[0];\n var dy = coord1[1] - coord2[1];\n return dx * dx + dy * dy;\n}\n/**\n * @param {Coordinate} coord1 First coordinate.\n * @param {Coordinate} coord2 Second coordinate.\n * @return {number} Distance between coord1 and coord2.\n */\nexport function distance(coord1, coord2) {\n return Math.sqrt(squaredDistance(coord1, coord2));\n}\n/**\n * Calculate the squared distance from a coordinate to a line segment.\n *\n * @param {Coordinate} coordinate Coordinate of the point.\n * @param {Array} segment Line segment (2\n * coordinates).\n * @return {number} Squared distance from the point to the line segment.\n */\nexport function squaredDistanceToSegment(coordinate, segment) {\n return squaredDistance(coordinate, closestOnSegment(coordinate, segment));\n}\n/**\n * Format a geographic coordinate with the hemisphere, degrees, minutes, and\n * seconds.\n *\n * Example without specifying fractional digits:\n *\n * import {toStringHDMS} from 'ol/coordinate';\n *\n * var coord = [7.85, 47.983333];\n * var out = toStringHDMS(coord);\n * // out is now '47° 58′ 60″ N 7° 50′ 60″ E'\n *\n * Example explicitly specifying 1 fractional digit:\n *\n * import {toStringHDMS} from 'ol/coordinate';\n *\n * var coord = [7.85, 47.983333];\n * var out = toStringHDMS(coord, 1);\n * // out is now '47° 58′ 60.0″ N 7° 50′ 60.0″ E'\n *\n * @param {Coordinate} coordinate Coordinate.\n * @param {number} [opt_fractionDigits] The number of digits to include\n * after the decimal point. Default is `0`.\n * @return {string} Hemisphere, degrees, minutes and seconds.\n * @api\n */\nexport function toStringHDMS(coordinate, opt_fractionDigits) {\n if (coordinate) {\n return (degreesToStringHDMS('NS', coordinate[1], opt_fractionDigits) +\n ' ' +\n degreesToStringHDMS('EW', coordinate[0], opt_fractionDigits));\n }\n else {\n return '';\n }\n}\n/**\n * Format a coordinate as a comma delimited string.\n *\n * Example without specifying fractional digits:\n *\n * import {toStringXY} from 'ol/coordinate';\n *\n * var coord = [7.85, 47.983333];\n * var out = toStringXY(coord);\n * // out is now '8, 48'\n *\n * Example explicitly specifying 1 fractional digit:\n *\n * import {toStringXY} from 'ol/coordinate';\n *\n * var coord = [7.85, 47.983333];\n * var out = toStringXY(coord, 1);\n * // out is now '7.8, 48.0'\n *\n * @param {Coordinate} coordinate Coordinate.\n * @param {number} [opt_fractionDigits] The number of digits to include\n * after the decimal point. Default is `0`.\n * @return {string} XY.\n * @api\n */\nexport function toStringXY(coordinate, opt_fractionDigits) {\n return format(coordinate, '{x}, {y}', opt_fractionDigits);\n}\n/**\n * Modifies the provided coordinate in-place to be within the real world\n * extent. The lower projection extent boundary is inclusive, the upper one\n * exclusive.\n *\n * @param {Coordinate} coordinate Coordinate.\n * @param {import(\"./proj/Projection.js\").default} projection Projection.\n * @return {Coordinate} The coordinate within the real world extent.\n */\nexport function wrapX(coordinate, projection) {\n if (projection.canWrapX()) {\n var worldWidth = getWidth(projection.getExtent());\n var worldsAway = getWorldsAway(coordinate, projection, worldWidth);\n if (worldsAway) {\n coordinate[0] -= worldsAway * worldWidth;\n }\n }\n return coordinate;\n}\n/**\n * @param {Coordinate} coordinate Coordinate.\n * @param {import(\"./proj/Projection.js\").default} projection Projection.\n * @param {number} [opt_sourceExtentWidth] Width of the source extent.\n * @return {number} Offset in world widths.\n */\nexport function getWorldsAway(coordinate, projection, opt_sourceExtentWidth) {\n var projectionExtent = projection.getExtent();\n var worldsAway = 0;\n if (projection.canWrapX() &&\n (coordinate[0] < projectionExtent[0] || coordinate[0] > projectionExtent[2])) {\n var sourceExtentWidth = opt_sourceExtentWidth || getWidth(projectionExtent);\n worldsAway = Math.floor((coordinate[0] - projectionExtent[0]) / sourceExtentWidth);\n }\n return worldsAway;\n}\n//# sourceMappingURL=coordinate.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/renderer/Map\n */\nimport Disposable from '../Disposable.js';\nimport { TRUE } from '../functions.js';\nimport { abstract } from '../util.js';\nimport { compose as composeTransform, makeInverse } from '../transform.js';\nimport { getWidth } from '../extent.js';\nimport { shared as iconImageCache } from '../style/IconImageCache.js';\nimport { inView } from '../layer/Layer.js';\nimport { wrapX } from '../coordinate.js';\n/**\n * @typedef HitMatch\n * @property {import(\"../Feature.js\").FeatureLike} feature Feature.\n * @property {import(\"../layer/Layer.js\").default} layer Layer.\n * @property {import(\"../geom/SimpleGeometry.js\").default} geometry Geometry.\n * @property {number} distanceSq Squared distance.\n * @property {import(\"./vector.js\").FeatureCallback} callback Callback.\n * @template T\n */\n/**\n * @abstract\n */\nvar MapRenderer = /** @class */ (function (_super) {\n __extends(MapRenderer, _super);\n /**\n * @param {import(\"../PluggableMap.js\").default} map Map.\n */\n function MapRenderer(map) {\n var _this = _super.call(this) || this;\n /**\n * @private\n * @type {import(\"../PluggableMap.js\").default}\n */\n _this.map_ = map;\n return _this;\n }\n /**\n * @abstract\n * @param {import(\"../render/EventType.js\").default} type Event type.\n * @param {import(\"../PluggableMap.js\").FrameState} frameState Frame state.\n */\n MapRenderer.prototype.dispatchRenderEvent = function (type, frameState) {\n abstract();\n };\n /**\n * @param {import(\"../PluggableMap.js\").FrameState} frameState FrameState.\n * @protected\n */\n MapRenderer.prototype.calculateMatrices2D = function (frameState) {\n var viewState = frameState.viewState;\n var coordinateToPixelTransform = frameState.coordinateToPixelTransform;\n var pixelToCoordinateTransform = frameState.pixelToCoordinateTransform;\n composeTransform(coordinateToPixelTransform, frameState.size[0] / 2, frameState.size[1] / 2, 1 / viewState.resolution, -1 / viewState.resolution, -viewState.rotation, -viewState.center[0], -viewState.center[1]);\n makeInverse(pixelToCoordinateTransform, coordinateToPixelTransform);\n };\n /**\n * @param {import(\"../coordinate.js\").Coordinate} coordinate Coordinate.\n * @param {import(\"../PluggableMap.js\").FrameState} frameState FrameState.\n * @param {number} hitTolerance Hit tolerance in pixels.\n * @param {boolean} checkWrapped Check for wrapped geometries.\n * @param {import(\"./vector.js\").FeatureCallback} callback Feature callback.\n * @param {S} thisArg Value to use as `this` when executing `callback`.\n * @param {function(this: U, import(\"../layer/Layer.js\").default): boolean} layerFilter Layer filter\n * function, only layers which are visible and for which this function\n * returns `true` will be tested for features. By default, all visible\n * layers will be tested.\n * @param {U} thisArg2 Value to use as `this` when executing `layerFilter`.\n * @return {T|undefined} Callback result.\n * @template S,T,U\n */\n MapRenderer.prototype.forEachFeatureAtCoordinate = function (coordinate, frameState, hitTolerance, checkWrapped, callback, thisArg, layerFilter, thisArg2) {\n var result;\n var viewState = frameState.viewState;\n /**\n * @param {boolean} managed Managed layer.\n * @param {import(\"../Feature.js\").FeatureLike} feature Feature.\n * @param {import(\"../layer/Layer.js\").default} layer Layer.\n * @param {import(\"../geom/Geometry.js\").default} geometry Geometry.\n * @return {T|undefined} Callback result.\n */\n function forEachFeatureAtCoordinate(managed, feature, layer, geometry) {\n return callback.call(thisArg, feature, managed ? layer : null, geometry);\n }\n var projection = viewState.projection;\n var translatedCoordinate = wrapX(coordinate.slice(), projection);\n var offsets = [[0, 0]];\n if (projection.canWrapX() && checkWrapped) {\n var projectionExtent = projection.getExtent();\n var worldWidth = getWidth(projectionExtent);\n offsets.push([-worldWidth, 0], [worldWidth, 0]);\n }\n var layerStates = frameState.layerStatesArray;\n var numLayers = layerStates.length;\n var matches = /** @type {Array>} */ ([]);\n var tmpCoord = [];\n for (var i = 0; i < offsets.length; i++) {\n for (var j = numLayers - 1; j >= 0; --j) {\n var layerState = layerStates[j];\n var layer = layerState.layer;\n if (layer.hasRenderer() &&\n inView(layerState, viewState) &&\n layerFilter.call(thisArg2, layer)) {\n var layerRenderer = layer.getRenderer();\n var source = layer.getSource();\n if (layerRenderer && source) {\n var coordinates = source.getWrapX()\n ? translatedCoordinate\n : coordinate;\n var callback_1 = forEachFeatureAtCoordinate.bind(null, layerState.managed);\n tmpCoord[0] = coordinates[0] + offsets[i][0];\n tmpCoord[1] = coordinates[1] + offsets[i][1];\n result = layerRenderer.forEachFeatureAtCoordinate(tmpCoord, frameState, hitTolerance, callback_1, matches);\n }\n if (result) {\n return result;\n }\n }\n }\n }\n if (matches.length === 0) {\n return undefined;\n }\n var order = 1 / matches.length;\n matches.forEach(function (m, i) { return (m.distanceSq += i * order); });\n matches.sort(function (a, b) { return a.distanceSq - b.distanceSq; });\n matches.some(function (m) {\n return (result = m.callback(m.feature, m.layer, m.geometry));\n });\n return result;\n };\n /**\n * @abstract\n * @param {import(\"../pixel.js\").Pixel} pixel Pixel.\n * @param {import(\"../PluggableMap.js\").FrameState} frameState FrameState.\n * @param {number} hitTolerance Hit tolerance in pixels.\n * @param {function(import(\"../layer/Layer.js\").default, (Uint8ClampedArray|Uint8Array)): T} callback Layer\n * callback.\n * @param {function(import(\"../layer/Layer.js\").default): boolean} layerFilter Layer filter\n * function, only layers which are visible and for which this function\n * returns `true` will be tested for features. By default, all visible\n * layers will be tested.\n * @return {T|undefined} Callback result.\n * @template T\n */\n MapRenderer.prototype.forEachLayerAtPixel = function (pixel, frameState, hitTolerance, callback, layerFilter) {\n return abstract();\n };\n /**\n * @param {import(\"../coordinate.js\").Coordinate} coordinate Coordinate.\n * @param {import(\"../PluggableMap.js\").FrameState} frameState FrameState.\n * @param {number} hitTolerance Hit tolerance in pixels.\n * @param {boolean} checkWrapped Check for wrapped geometries.\n * @param {function(this: U, import(\"../layer/Layer.js\").default): boolean} layerFilter Layer filter\n * function, only layers which are visible and for which this function\n * returns `true` will be tested for features. By default, all visible\n * layers will be tested.\n * @param {U} thisArg Value to use as `this` when executing `layerFilter`.\n * @return {boolean} Is there a feature at the given coordinate?\n * @template U\n */\n MapRenderer.prototype.hasFeatureAtCoordinate = function (coordinate, frameState, hitTolerance, checkWrapped, layerFilter, thisArg) {\n var hasFeature = this.forEachFeatureAtCoordinate(coordinate, frameState, hitTolerance, checkWrapped, TRUE, this, layerFilter, thisArg);\n return hasFeature !== undefined;\n };\n /**\n * @return {import(\"../PluggableMap.js\").default} Map.\n */\n MapRenderer.prototype.getMap = function () {\n return this.map_;\n };\n /**\n * Render.\n * @abstract\n * @param {?import(\"../PluggableMap.js\").FrameState} frameState Frame state.\n */\n MapRenderer.prototype.renderFrame = function (frameState) {\n abstract();\n };\n /**\n * @param {import(\"../PluggableMap.js\").FrameState} frameState Frame state.\n * @protected\n */\n MapRenderer.prototype.scheduleExpireIconCache = function (frameState) {\n if (iconImageCache.canExpireCache()) {\n frameState.postRenderFunctions.push(expireIconCache);\n }\n };\n return MapRenderer;\n}(Disposable));\n/**\n * @param {import(\"../PluggableMap.js\").default} map Map.\n * @param {import(\"../PluggableMap.js\").FrameState} frameState Frame state.\n */\nfunction expireIconCache(map, frameState) {\n iconImageCache.expire();\n}\nexport default MapRenderer;\n//# sourceMappingURL=Map.js.map","/**\n * @module ol/render/Event\n */\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nimport Event from '../events/Event.js';\nvar RenderEvent = /** @class */ (function (_super) {\n __extends(RenderEvent, _super);\n /**\n * @param {import(\"./EventType.js\").default} type Type.\n * @param {import(\"../transform.js\").Transform} [opt_inversePixelTransform] Transform for\n * CSS pixels to rendered pixels.\n * @param {import(\"../PluggableMap.js\").FrameState} [opt_frameState] Frame state.\n * @param {?CanvasRenderingContext2D} [opt_context] Context.\n */\n function RenderEvent(type, opt_inversePixelTransform, opt_frameState, opt_context) {\n var _this = _super.call(this, type) || this;\n /**\n * Transform from CSS pixels (relative to the top-left corner of the map viewport)\n * to rendered pixels on this event's `context`. Only available when a Canvas renderer is used, null otherwise.\n * @type {import(\"../transform.js\").Transform|undefined}\n * @api\n */\n _this.inversePixelTransform = opt_inversePixelTransform;\n /**\n * An object representing the current render frame state.\n * @type {import(\"../PluggableMap.js\").FrameState|undefined}\n * @api\n */\n _this.frameState = opt_frameState;\n /**\n * Canvas context. Not available when the event is dispatched by the map. Only available\n * when a Canvas renderer is used, null otherwise.\n * @type {CanvasRenderingContext2D|null|undefined}\n * @api\n */\n _this.context = opt_context;\n return _this;\n }\n return RenderEvent;\n}(Event));\nexport default RenderEvent;\n//# sourceMappingURL=Event.js.map","/**\n * @module ol/css\n */\n/**\n * @typedef {Object} FontParameters\n * @property {string} style Style.\n * @property {string} variant Variant.\n * @property {string} weight Weight.\n * @property {string} size Size.\n * @property {string} lineHeight LineHeight.\n * @property {string} family Family.\n * @property {Array} families Families.\n */\n/**\n * The CSS class for hidden feature.\n *\n * @const\n * @type {string}\n */\nexport var CLASS_HIDDEN = 'ol-hidden';\n/**\n * The CSS class that we'll give the DOM elements to have them selectable.\n *\n * @const\n * @type {string}\n */\nexport var CLASS_SELECTABLE = 'ol-selectable';\n/**\n * The CSS class that we'll give the DOM elements to have them unselectable.\n *\n * @const\n * @type {string}\n */\nexport var CLASS_UNSELECTABLE = 'ol-unselectable';\n/**\n * The CSS class for unsupported feature.\n *\n * @const\n * @type {string}\n */\nexport var CLASS_UNSUPPORTED = 'ol-unsupported';\n/**\n * The CSS class for controls.\n *\n * @const\n * @type {string}\n */\nexport var CLASS_CONTROL = 'ol-control';\n/**\n * The CSS class that we'll give the DOM elements that are collapsed, i.e.\n * to those elements which usually can be expanded.\n *\n * @const\n * @type {string}\n */\nexport var CLASS_COLLAPSED = 'ol-collapsed';\n/**\n * From https://stackoverflow.com/questions/10135697/regex-to-parse-any-css-font\n * @type {RegExp}\n */\nvar fontRegEx = new RegExp([\n '^\\\\s*(?=(?:(?:[-a-z]+\\\\s*){0,2}(italic|oblique))?)',\n '(?=(?:(?:[-a-z]+\\\\s*){0,2}(small-caps))?)',\n '(?=(?:(?:[-a-z]+\\\\s*){0,2}(bold(?:er)?|lighter|[1-9]00 ))?)',\n '(?:(?:normal|\\\\1|\\\\2|\\\\3)\\\\s*){0,3}((?:xx?-)?',\n '(?:small|large)|medium|smaller|larger|[\\\\.\\\\d]+(?:\\\\%|in|[cem]m|ex|p[ctx]))',\n '(?:\\\\s*\\\\/\\\\s*(normal|[\\\\.\\\\d]+(?:\\\\%|in|[cem]m|ex|p[ctx])?))',\n '?\\\\s*([-,\\\\\"\\\\\\'\\\\sa-z]+?)\\\\s*$',\n].join(''), 'i');\nvar fontRegExMatchIndex = [\n 'style',\n 'variant',\n 'weight',\n 'size',\n 'lineHeight',\n 'family',\n];\n/**\n * Get the list of font families from a font spec. Note that this doesn't work\n * for font families that have commas in them.\n * @param {string} fontSpec The CSS font property.\n * @return {FontParameters} The font parameters (or null if the input spec is invalid).\n */\nexport var getFontParameters = function (fontSpec) {\n var match = fontSpec.match(fontRegEx);\n if (!match) {\n return null;\n }\n var style = /** @type {FontParameters} */ ({\n lineHeight: 'normal',\n size: '1.2em',\n style: 'normal',\n weight: 'normal',\n variant: 'normal',\n });\n for (var i = 0, ii = fontRegExMatchIndex.length; i < ii; ++i) {\n var value = match[i + 1];\n if (value !== undefined) {\n style[fontRegExMatchIndex[i]] = value;\n }\n }\n style.families = style.family.split(/,\\s?/);\n return style;\n};\n/**\n * @param {number} opacity Opacity (0..1).\n * @return {string} CSS opacity.\n */\nexport function cssOpacity(opacity) {\n return opacity === 1 ? '' : String(Math.round(opacity * 100) / 100);\n}\n//# sourceMappingURL=css.js.map","import { WORKER_OFFSCREEN_CANVAS } from './has.js';\n/**\n * @module ol/dom\n */\n//FIXME Move this function to the canvas module\n/**\n * Create an html canvas element and returns its 2d context.\n * @param {number} [opt_width] Canvas width.\n * @param {number} [opt_height] Canvas height.\n * @param {Array} [opt_canvasPool] Canvas pool to take existing canvas from.\n * @param {CanvasRenderingContext2DSettings} [opt_Context2DSettings] CanvasRenderingContext2DSettings\n * @return {CanvasRenderingContext2D} The context.\n */\nexport function createCanvasContext2D(opt_width, opt_height, opt_canvasPool, opt_Context2DSettings) {\n /** @type {HTMLCanvasElement|OffscreenCanvas} */\n var canvas;\n if (opt_canvasPool && opt_canvasPool.length) {\n canvas = opt_canvasPool.shift();\n }\n else if (WORKER_OFFSCREEN_CANVAS) {\n canvas = new OffscreenCanvas(opt_width || 300, opt_height || 300);\n }\n else {\n canvas = document.createElement('canvas');\n canvas.style.all = 'unset';\n }\n if (opt_width) {\n canvas.width = opt_width;\n }\n if (opt_height) {\n canvas.height = opt_height;\n }\n //FIXME Allow OffscreenCanvasRenderingContext2D as return type\n return /** @type {CanvasRenderingContext2D} */ (canvas.getContext('2d', opt_Context2DSettings));\n}\n/**\n * Get the current computed width for the given element including margin,\n * padding and border.\n * Equivalent to jQuery's `$(el).outerWidth(true)`.\n * @param {!HTMLElement} element Element.\n * @return {number} The width.\n */\nexport function outerWidth(element) {\n var width = element.offsetWidth;\n var style = getComputedStyle(element);\n width += parseInt(style.marginLeft, 10) + parseInt(style.marginRight, 10);\n return width;\n}\n/**\n * Get the current computed height for the given element including margin,\n * padding and border.\n * Equivalent to jQuery's `$(el).outerHeight(true)`.\n * @param {!HTMLElement} element Element.\n * @return {number} The height.\n */\nexport function outerHeight(element) {\n var height = element.offsetHeight;\n var style = getComputedStyle(element);\n height += parseInt(style.marginTop, 10) + parseInt(style.marginBottom, 10);\n return height;\n}\n/**\n * @param {Node} newNode Node to replace old node\n * @param {Node} oldNode The node to be replaced\n */\nexport function replaceNode(newNode, oldNode) {\n var parent = oldNode.parentNode;\n if (parent) {\n parent.replaceChild(newNode, oldNode);\n }\n}\n/**\n * @param {Node} node The node to remove.\n * @return {Node} The node that was removed or null.\n */\nexport function removeNode(node) {\n return node && node.parentNode ? node.parentNode.removeChild(node) : null;\n}\n/**\n * @param {Node} node The node to remove the children from.\n */\nexport function removeChildren(node) {\n while (node.lastChild) {\n node.removeChild(node.lastChild);\n }\n}\n/**\n * Transform the children of a parent node so they match the\n * provided list of children. This function aims to efficiently\n * remove, add, and reorder child nodes while maintaining a simple\n * implementation (it is not guaranteed to minimize DOM operations).\n * @param {Node} node The parent node whose children need reworking.\n * @param {Array} children The desired children.\n */\nexport function replaceChildren(node, children) {\n var oldChildren = node.childNodes;\n for (var i = 0; true; ++i) {\n var oldChild = oldChildren[i];\n var newChild = children[i];\n // check if our work is done\n if (!oldChild && !newChild) {\n break;\n }\n // check if children match\n if (oldChild === newChild) {\n continue;\n }\n // check if a new child needs to be added\n if (!oldChild) {\n node.appendChild(newChild);\n continue;\n }\n // check if an old child needs to be removed\n if (!newChild) {\n node.removeChild(oldChild);\n --i;\n continue;\n }\n // reorder\n node.insertBefore(newChild, oldChild);\n }\n}\n//# sourceMappingURL=dom.js.map","/**\n * @module ol/render/canvas\n */\nimport BaseObject from '../Object.js';\nimport EventTarget from '../events/Target.js';\nimport { WORKER_OFFSCREEN_CANVAS } from '../has.js';\nimport { clear } from '../obj.js';\nimport { createCanvasContext2D } from '../dom.js';\nimport { getFontParameters } from '../css.js';\n/**\n * @typedef {Object} FillState\n * @property {import(\"../colorlike.js\").ColorLike} fillStyle FillStyle.\n */\n/**\n * @typedef Label\n * @property {number} width Width.\n * @property {number} height Height.\n * @property {Array} contextInstructions ContextInstructions.\n */\n/**\n * @typedef {Object} FillStrokeState\n * @property {import(\"../colorlike.js\").ColorLike} [currentFillStyle] Current FillStyle.\n * @property {import(\"../colorlike.js\").ColorLike} [currentStrokeStyle] Current StrokeStyle.\n * @property {CanvasLineCap} [currentLineCap] Current LineCap.\n * @property {Array} currentLineDash Current LineDash.\n * @property {number} [currentLineDashOffset] Current LineDashOffset.\n * @property {CanvasLineJoin} [currentLineJoin] Current LineJoin.\n * @property {number} [currentLineWidth] Current LineWidth.\n * @property {number} [currentMiterLimit] Current MiterLimit.\n * @property {number} [lastStroke] Last stroke.\n * @property {import(\"../colorlike.js\").ColorLike} [fillStyle] FillStyle.\n * @property {import(\"../colorlike.js\").ColorLike} [strokeStyle] StrokeStyle.\n * @property {CanvasLineCap} [lineCap] LineCap.\n * @property {Array} lineDash LineDash.\n * @property {number} [lineDashOffset] LineDashOffset.\n * @property {CanvasLineJoin} [lineJoin] LineJoin.\n * @property {number} [lineWidth] LineWidth.\n * @property {number} [miterLimit] MiterLimit.\n */\n/**\n * @typedef {Object} StrokeState\n * @property {CanvasLineCap} lineCap LineCap.\n * @property {Array} lineDash LineDash.\n * @property {number} lineDashOffset LineDashOffset.\n * @property {CanvasLineJoin} lineJoin LineJoin.\n * @property {number} lineWidth LineWidth.\n * @property {number} miterLimit MiterLimit.\n * @property {import(\"../colorlike.js\").ColorLike} strokeStyle StrokeStyle.\n */\n/**\n * @typedef {Object} TextState\n * @property {string} font Font.\n * @property {string} [textAlign] TextAlign.\n * @property {string} textBaseline TextBaseline.\n * @property {string} [placement] Placement.\n * @property {number} [maxAngle] MaxAngle.\n * @property {boolean} [overflow] Overflow.\n * @property {import(\"../style/Fill.js\").default} [backgroundFill] BackgroundFill.\n * @property {import(\"../style/Stroke.js\").default} [backgroundStroke] BackgroundStroke.\n * @property {import(\"../size.js\").Size} [scale] Scale.\n * @property {Array} [padding] Padding.\n */\n/**\n * @typedef {Object} SerializableInstructions\n * @property {Array<*>} instructions The rendering instructions.\n * @property {Array<*>} hitDetectionInstructions The rendering hit detection instructions.\n * @property {Array} coordinates The array of all coordinates.\n * @property {!Object} [textStates] The text states (decluttering).\n * @property {!Object} [fillStates] The fill states (decluttering).\n * @property {!Object} [strokeStates] The stroke states (decluttering).\n */\n/**\n * @typedef {Object} DeclutterImageWithText\n */\n/**\n * @const\n * @type {string}\n */\nexport var defaultFont = '10px sans-serif';\n/**\n * @const\n * @type {import(\"../colorlike.js\").ColorLike}\n */\nexport var defaultFillStyle = '#000';\n/**\n * @const\n * @type {CanvasLineCap}\n */\nexport var defaultLineCap = 'round';\n/**\n * @const\n * @type {Array}\n */\nexport var defaultLineDash = [];\n/**\n * @const\n * @type {number}\n */\nexport var defaultLineDashOffset = 0;\n/**\n * @const\n * @type {CanvasLineJoin}\n */\nexport var defaultLineJoin = 'round';\n/**\n * @const\n * @type {number}\n */\nexport var defaultMiterLimit = 10;\n/**\n * @const\n * @type {import(\"../colorlike.js\").ColorLike}\n */\nexport var defaultStrokeStyle = '#000';\n/**\n * @const\n * @type {string}\n */\nexport var defaultTextAlign = 'center';\n/**\n * @const\n * @type {string}\n */\nexport var defaultTextBaseline = 'middle';\n/**\n * @const\n * @type {Array}\n */\nexport var defaultPadding = [0, 0, 0, 0];\n/**\n * @const\n * @type {number}\n */\nexport var defaultLineWidth = 1;\n/**\n * @type {BaseObject}\n */\nexport var checkedFonts = new BaseObject();\n/**\n * The label cache for text rendering. To change the default cache size of 2048\n * entries, use {@link module:ol/structs/LRUCache~LRUCache#setSize cache.setSize()}.\n * Deprecated - there is no label cache any more.\n * @type {?}\n * @api\n * @deprecated\n */\nexport var labelCache = new EventTarget();\nlabelCache.setSize = function () {\n console.warn('labelCache is deprecated.'); //eslint-disable-line\n};\n/**\n * @type {CanvasRenderingContext2D}\n */\nvar measureContext = null;\n/**\n * @type {string}\n */\nvar measureFont;\n/**\n * @type {!Object}\n */\nexport var textHeights = {};\n/**\n * Clears the label cache when a font becomes available.\n * @param {string} fontSpec CSS font spec.\n */\nexport var registerFont = (function () {\n var retries = 100;\n var size = '32px ';\n var referenceFonts = ['monospace', 'serif'];\n var len = referenceFonts.length;\n var text = 'wmytzilWMYTZIL@#/&?$%10\\uF013';\n var interval, referenceWidth;\n /**\n * @param {string} fontStyle Css font-style\n * @param {string} fontWeight Css font-weight\n * @param {*} fontFamily Css font-family\n * @return {boolean} Font with style and weight is available\n */\n function isAvailable(fontStyle, fontWeight, fontFamily) {\n var available = true;\n for (var i = 0; i < len; ++i) {\n var referenceFont = referenceFonts[i];\n referenceWidth = measureTextWidth(fontStyle + ' ' + fontWeight + ' ' + size + referenceFont, text);\n if (fontFamily != referenceFont) {\n var width = measureTextWidth(fontStyle +\n ' ' +\n fontWeight +\n ' ' +\n size +\n fontFamily +\n ',' +\n referenceFont, text);\n // If width and referenceWidth are the same, then the fallback was used\n // instead of the font we wanted, so the font is not available.\n available = available && width != referenceWidth;\n }\n }\n if (available) {\n return true;\n }\n return false;\n }\n function check() {\n var done = true;\n var fonts = checkedFonts.getKeys();\n for (var i = 0, ii = fonts.length; i < ii; ++i) {\n var font = fonts[i];\n if (checkedFonts.get(font) < retries) {\n if (isAvailable.apply(this, font.split('\\n'))) {\n clear(textHeights);\n // Make sure that loaded fonts are picked up by Safari\n measureContext = null;\n measureFont = undefined;\n checkedFonts.set(font, retries);\n }\n else {\n checkedFonts.set(font, checkedFonts.get(font) + 1, true);\n done = false;\n }\n }\n }\n if (done) {\n clearInterval(interval);\n interval = undefined;\n }\n }\n return function (fontSpec) {\n var font = getFontParameters(fontSpec);\n if (!font) {\n return;\n }\n var families = font.families;\n for (var i = 0, ii = families.length; i < ii; ++i) {\n var family = families[i];\n var key = font.style + '\\n' + font.weight + '\\n' + family;\n if (checkedFonts.get(key) === undefined) {\n checkedFonts.set(key, retries, true);\n if (!isAvailable(font.style, font.weight, family)) {\n checkedFonts.set(key, 0, true);\n if (interval === undefined) {\n interval = setInterval(check, 32);\n }\n }\n }\n }\n };\n})();\n/**\n * @param {string} font Font to use for measuring.\n * @return {import(\"../size.js\").Size} Measurement.\n */\nexport var measureTextHeight = (function () {\n /**\n * @type {HTMLDivElement}\n */\n var measureElement;\n return function (fontSpec) {\n var height = textHeights[fontSpec];\n if (height == undefined) {\n if (WORKER_OFFSCREEN_CANVAS) {\n var font = getFontParameters(fontSpec);\n var metrics = measureText(fontSpec, 'Žg');\n var lineHeight = isNaN(Number(font.lineHeight))\n ? 1.2\n : Number(font.lineHeight);\n height =\n lineHeight *\n (metrics.actualBoundingBoxAscent + metrics.actualBoundingBoxDescent);\n }\n else {\n if (!measureElement) {\n measureElement = document.createElement('div');\n measureElement.innerHTML = 'M';\n measureElement.style.minHeight = '0';\n measureElement.style.maxHeight = 'none';\n measureElement.style.height = 'auto';\n measureElement.style.padding = '0';\n measureElement.style.border = 'none';\n measureElement.style.position = 'absolute';\n measureElement.style.display = 'block';\n measureElement.style.left = '-99999px';\n }\n measureElement.style.font = fontSpec;\n document.body.appendChild(measureElement);\n height = measureElement.offsetHeight;\n document.body.removeChild(measureElement);\n }\n textHeights[fontSpec] = height;\n }\n return height;\n };\n})();\n/**\n * @param {string} font Font.\n * @param {string} text Text.\n * @return {TextMetrics} Text metrics.\n */\nfunction measureText(font, text) {\n if (!measureContext) {\n measureContext = createCanvasContext2D(1, 1);\n }\n if (font != measureFont) {\n measureContext.font = font;\n measureFont = measureContext.font;\n }\n return measureContext.measureText(text);\n}\n/**\n * @param {string} font Font.\n * @param {string} text Text.\n * @return {number} Width.\n */\nexport function measureTextWidth(font, text) {\n return measureText(font, text).width;\n}\n/**\n * Measure text width using a cache.\n * @param {string} font The font.\n * @param {string} text The text to measure.\n * @param {Object} cache A lookup of cached widths by text.\n * @return {number} The text width.\n */\nexport function measureAndCacheTextWidth(font, text, cache) {\n if (text in cache) {\n return cache[text];\n }\n var width = measureTextWidth(font, text);\n cache[text] = width;\n return width;\n}\n/**\n * @param {string} font Font to use for measuring.\n * @param {Array} lines Lines to measure.\n * @param {Array} widths Array will be populated with the widths of\n * each line.\n * @return {number} Width of the whole text.\n */\nexport function measureTextWidths(font, lines, widths) {\n var numLines = lines.length;\n var width = 0;\n for (var i = 0; i < numLines; ++i) {\n var currentWidth = measureTextWidth(font, lines[i]);\n width = Math.max(width, currentWidth);\n widths.push(currentWidth);\n }\n return width;\n}\n/**\n * @param {CanvasRenderingContext2D} context Context.\n * @param {number} rotation Rotation.\n * @param {number} offsetX X offset.\n * @param {number} offsetY Y offset.\n */\nexport function rotateAtOffset(context, rotation, offsetX, offsetY) {\n if (rotation !== 0) {\n context.translate(offsetX, offsetY);\n context.rotate(rotation);\n context.translate(-offsetX, -offsetY);\n }\n}\n/**\n * @param {CanvasRenderingContext2D} context Context.\n * @param {import(\"../transform.js\").Transform|null} transform Transform.\n * @param {number} opacity Opacity.\n * @param {Label|HTMLCanvasElement|HTMLImageElement|HTMLVideoElement} labelOrImage Label.\n * @param {number} originX Origin X.\n * @param {number} originY Origin Y.\n * @param {number} w Width.\n * @param {number} h Height.\n * @param {number} x X.\n * @param {number} y Y.\n * @param {import(\"../size.js\").Size} scale Scale.\n */\nexport function drawImageOrLabel(context, transform, opacity, labelOrImage, originX, originY, w, h, x, y, scale) {\n context.save();\n if (opacity !== 1) {\n context.globalAlpha *= opacity;\n }\n if (transform) {\n context.setTransform.apply(context, transform);\n }\n if ( /** @type {*} */(labelOrImage).contextInstructions) {\n // label\n context.translate(x, y);\n context.scale(scale[0], scale[1]);\n executeLabelInstructions(/** @type {Label} */ (labelOrImage), context);\n }\n else if (scale[0] < 0 || scale[1] < 0) {\n // flipped image\n context.translate(x, y);\n context.scale(scale[0], scale[1]);\n context.drawImage(\n /** @type {HTMLCanvasElement|HTMLImageElement|HTMLVideoElement} */ (labelOrImage), originX, originY, w, h, 0, 0, w, h);\n }\n else {\n // if image not flipped translate and scale can be avoided\n context.drawImage(\n /** @type {HTMLCanvasElement|HTMLImageElement|HTMLVideoElement} */ (labelOrImage), originX, originY, w, h, x, y, w * scale[0], h * scale[1]);\n }\n context.restore();\n}\n/**\n * @param {Label} label Label.\n * @param {CanvasRenderingContext2D} context Context.\n */\nfunction executeLabelInstructions(label, context) {\n var contextInstructions = label.contextInstructions;\n for (var i = 0, ii = contextInstructions.length; i < ii; i += 2) {\n if (Array.isArray(contextInstructions[i + 1])) {\n context[contextInstructions[i]].apply(context, contextInstructions[i + 1]);\n }\n else {\n context[contextInstructions[i]] = contextInstructions[i + 1];\n }\n }\n}\n//# sourceMappingURL=canvas.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/renderer/Composite\n */\nimport MapRenderer from './Map.js';\nimport ObjectEventType from '../ObjectEventType.js';\nimport RenderEvent from '../render/Event.js';\nimport RenderEventType from '../render/EventType.js';\nimport SourceState from '../source/State.js';\nimport { CLASS_UNSELECTABLE } from '../css.js';\nimport { checkedFonts } from '../render/canvas.js';\nimport { inView } from '../layer/Layer.js';\nimport { listen, unlistenByKey } from '../events.js';\nimport { replaceChildren } from '../dom.js';\n/**\n * @classdesc\n * Canvas map renderer.\n * @api\n */\nvar CompositeMapRenderer = /** @class */ (function (_super) {\n __extends(CompositeMapRenderer, _super);\n /**\n * @param {import(\"../PluggableMap.js\").default} map Map.\n */\n function CompositeMapRenderer(map) {\n var _this = _super.call(this, map) || this;\n /**\n * @type {import(\"../events.js\").EventsKey}\n */\n _this.fontChangeListenerKey_ = listen(checkedFonts, ObjectEventType.PROPERTYCHANGE, map.redrawText.bind(map));\n /**\n * @private\n * @type {HTMLDivElement}\n */\n _this.element_ = document.createElement('div');\n var style = _this.element_.style;\n style.position = 'absolute';\n style.width = '100%';\n style.height = '100%';\n style.zIndex = '0';\n _this.element_.className = CLASS_UNSELECTABLE + ' ol-layers';\n var container = map.getViewport();\n container.insertBefore(_this.element_, container.firstChild || null);\n /**\n * @private\n * @type {Array}\n */\n _this.children_ = [];\n /**\n * @private\n * @type {boolean}\n */\n _this.renderedVisible_ = true;\n return _this;\n }\n /**\n * @param {import(\"../render/EventType.js\").default} type Event type.\n * @param {import(\"../PluggableMap.js\").FrameState} frameState Frame state.\n */\n CompositeMapRenderer.prototype.dispatchRenderEvent = function (type, frameState) {\n var map = this.getMap();\n if (map.hasListener(type)) {\n var event_1 = new RenderEvent(type, undefined, frameState);\n map.dispatchEvent(event_1);\n }\n };\n CompositeMapRenderer.prototype.disposeInternal = function () {\n unlistenByKey(this.fontChangeListenerKey_);\n this.element_.parentNode.removeChild(this.element_);\n _super.prototype.disposeInternal.call(this);\n };\n /**\n * Render.\n * @param {?import(\"../PluggableMap.js\").FrameState} frameState Frame state.\n */\n CompositeMapRenderer.prototype.renderFrame = function (frameState) {\n if (!frameState) {\n if (this.renderedVisible_) {\n this.element_.style.display = 'none';\n this.renderedVisible_ = false;\n }\n return;\n }\n this.calculateMatrices2D(frameState);\n this.dispatchRenderEvent(RenderEventType.PRECOMPOSE, frameState);\n var layerStatesArray = frameState.layerStatesArray.sort(function (a, b) {\n return a.zIndex - b.zIndex;\n });\n var viewState = frameState.viewState;\n this.children_.length = 0;\n /**\n * @type {Array}\n */\n var declutterLayers = [];\n var previousElement = null;\n for (var i = 0, ii = layerStatesArray.length; i < ii; ++i) {\n var layerState = layerStatesArray[i];\n frameState.layerIndex = i;\n if (!inView(layerState, viewState) ||\n (layerState.sourceState != SourceState.READY &&\n layerState.sourceState != SourceState.UNDEFINED)) {\n continue;\n }\n var layer = layerState.layer;\n var element = layer.render(frameState, previousElement);\n if (!element) {\n continue;\n }\n if (element !== previousElement) {\n this.children_.push(element);\n previousElement = element;\n }\n if ('getDeclutter' in layer) {\n declutterLayers.push(\n /** @type {import(\"../layer/BaseVector.js\").default} */ (layer));\n }\n }\n for (var i = declutterLayers.length - 1; i >= 0; --i) {\n declutterLayers[i].renderDeclutter(frameState);\n }\n replaceChildren(this.element_, this.children_);\n this.dispatchRenderEvent(RenderEventType.POSTCOMPOSE, frameState);\n if (!this.renderedVisible_) {\n this.element_.style.display = '';\n this.renderedVisible_ = true;\n }\n this.scheduleExpireIconCache(frameState);\n };\n /**\n * @param {import(\"../pixel.js\").Pixel} pixel Pixel.\n * @param {import(\"../PluggableMap.js\").FrameState} frameState FrameState.\n * @param {number} hitTolerance Hit tolerance in pixels.\n * @param {function(import(\"../layer/Layer.js\").default, (Uint8ClampedArray|Uint8Array)): T} callback Layer\n * callback.\n * @param {function(import(\"../layer/Layer.js\").default): boolean} layerFilter Layer filter\n * function, only layers which are visible and for which this function\n * returns `true` will be tested for features. By default, all visible\n * layers will be tested.\n * @return {T|undefined} Callback result.\n * @template T\n */\n CompositeMapRenderer.prototype.forEachLayerAtPixel = function (pixel, frameState, hitTolerance, callback, layerFilter) {\n var viewState = frameState.viewState;\n var layerStates = frameState.layerStatesArray;\n var numLayers = layerStates.length;\n for (var i = numLayers - 1; i >= 0; --i) {\n var layerState = layerStates[i];\n var layer = layerState.layer;\n if (layer.hasRenderer() &&\n inView(layerState, viewState) &&\n layerFilter(layer)) {\n var layerRenderer = layer.getRenderer();\n var data = layerRenderer.getDataAtPixel(pixel, frameState, hitTolerance);\n if (data) {\n var result = callback(layer, data);\n if (result) {\n return result;\n }\n }\n }\n }\n return undefined;\n };\n return CompositeMapRenderer;\n}(MapRenderer));\nexport default CompositeMapRenderer;\n//# sourceMappingURL=Composite.js.map","/**\n * @module ol/CollectionEventType\n */\n/**\n * @enum {string}\n */\nexport default {\n /**\n * Triggered when an item is added to the collection.\n * @event module:ol/Collection.CollectionEvent#add\n * @api\n */\n ADD: 'add',\n /**\n * Triggered when an item is removed from the collection.\n * @event module:ol/Collection.CollectionEvent#remove\n * @api\n */\n REMOVE: 'remove',\n};\n//# sourceMappingURL=CollectionEventType.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/Collection\n */\nimport AssertionError from './AssertionError.js';\nimport BaseObject from './Object.js';\nimport CollectionEventType from './CollectionEventType.js';\nimport Event from './events/Event.js';\n/**\n * @enum {string}\n * @private\n */\nvar Property = {\n LENGTH: 'length',\n};\n/**\n * @classdesc\n * Events emitted by {@link module:ol/Collection~Collection} instances are instances of this\n * type.\n */\nvar CollectionEvent = /** @class */ (function (_super) {\n __extends(CollectionEvent, _super);\n /**\n * @param {import(\"./CollectionEventType.js\").default} type Type.\n * @param {*} [opt_element] Element.\n * @param {number} [opt_index] The index of the added or removed element.\n */\n function CollectionEvent(type, opt_element, opt_index) {\n var _this = _super.call(this, type) || this;\n /**\n * The element that is added to or removed from the collection.\n * @type {*}\n * @api\n */\n _this.element = opt_element;\n /**\n * The index of the added or removed element.\n * @type {number}\n * @api\n */\n _this.index = opt_index;\n return _this;\n }\n return CollectionEvent;\n}(Event));\nexport { CollectionEvent };\n/***\n * @template Return\n * @typedef {import(\"./Observable\").OnSignature &\n * import(\"./Observable\").OnSignature &\n * import(\"./Observable\").OnSignature<'add'|'remove', CollectionEvent, Return> &\n * import(\"./Observable\").CombinedOnSignature} CollectionOnSignature\n */\n/**\n * @typedef {Object} Options\n * @property {boolean} [unique=false] Disallow the same item from being added to\n * the collection twice.\n */\n/**\n * @classdesc\n * An expanded version of standard JS Array, adding convenience methods for\n * manipulation. Add and remove changes to the Collection trigger a Collection\n * event. Note that this does not cover changes to the objects _within_ the\n * Collection; they trigger events on the appropriate object, not on the\n * Collection as a whole.\n *\n * @fires CollectionEvent\n *\n * @template T\n * @api\n */\nvar Collection = /** @class */ (function (_super) {\n __extends(Collection, _super);\n /**\n * @param {Array} [opt_array] Array.\n * @param {Options} [opt_options] Collection options.\n */\n function Collection(opt_array, opt_options) {\n var _this = _super.call(this) || this;\n /***\n * @type {CollectionOnSignature}\n */\n _this.on;\n /***\n * @type {CollectionOnSignature}\n */\n _this.once;\n /***\n * @type {CollectionOnSignature}\n */\n _this.un;\n var options = opt_options || {};\n /**\n * @private\n * @type {boolean}\n */\n _this.unique_ = !!options.unique;\n /**\n * @private\n * @type {!Array}\n */\n _this.array_ = opt_array ? opt_array : [];\n if (_this.unique_) {\n for (var i = 0, ii = _this.array_.length; i < ii; ++i) {\n _this.assertUnique_(_this.array_[i], i);\n }\n }\n _this.updateLength_();\n return _this;\n }\n /**\n * Remove all elements from the collection.\n * @api\n */\n Collection.prototype.clear = function () {\n while (this.getLength() > 0) {\n this.pop();\n }\n };\n /**\n * Add elements to the collection. This pushes each item in the provided array\n * to the end of the collection.\n * @param {!Array} arr Array.\n * @return {Collection} This collection.\n * @api\n */\n Collection.prototype.extend = function (arr) {\n for (var i = 0, ii = arr.length; i < ii; ++i) {\n this.push(arr[i]);\n }\n return this;\n };\n /**\n * Iterate over each element, calling the provided callback.\n * @param {function(T, number, Array): *} f The function to call\n * for every element. This function takes 3 arguments (the element, the\n * index and the array). The return value is ignored.\n * @api\n */\n Collection.prototype.forEach = function (f) {\n var array = this.array_;\n for (var i = 0, ii = array.length; i < ii; ++i) {\n f(array[i], i, array);\n }\n };\n /**\n * Get a reference to the underlying Array object. Warning: if the array\n * is mutated, no events will be dispatched by the collection, and the\n * collection's \"length\" property won't be in sync with the actual length\n * of the array.\n * @return {!Array} Array.\n * @api\n */\n Collection.prototype.getArray = function () {\n return this.array_;\n };\n /**\n * Get the element at the provided index.\n * @param {number} index Index.\n * @return {T} Element.\n * @api\n */\n Collection.prototype.item = function (index) {\n return this.array_[index];\n };\n /**\n * Get the length of this collection.\n * @return {number} The length of the array.\n * @observable\n * @api\n */\n Collection.prototype.getLength = function () {\n return this.get(Property.LENGTH);\n };\n /**\n * Insert an element at the provided index.\n * @param {number} index Index.\n * @param {T} elem Element.\n * @api\n */\n Collection.prototype.insertAt = function (index, elem) {\n if (this.unique_) {\n this.assertUnique_(elem);\n }\n this.array_.splice(index, 0, elem);\n this.updateLength_();\n this.dispatchEvent(new CollectionEvent(CollectionEventType.ADD, elem, index));\n };\n /**\n * Remove the last element of the collection and return it.\n * Return `undefined` if the collection is empty.\n * @return {T|undefined} Element.\n * @api\n */\n Collection.prototype.pop = function () {\n return this.removeAt(this.getLength() - 1);\n };\n /**\n * Insert the provided element at the end of the collection.\n * @param {T} elem Element.\n * @return {number} New length of the collection.\n * @api\n */\n Collection.prototype.push = function (elem) {\n if (this.unique_) {\n this.assertUnique_(elem);\n }\n var n = this.getLength();\n this.insertAt(n, elem);\n return this.getLength();\n };\n /**\n * Remove the first occurrence of an element from the collection.\n * @param {T} elem Element.\n * @return {T|undefined} The removed element or undefined if none found.\n * @api\n */\n Collection.prototype.remove = function (elem) {\n var arr = this.array_;\n for (var i = 0, ii = arr.length; i < ii; ++i) {\n if (arr[i] === elem) {\n return this.removeAt(i);\n }\n }\n return undefined;\n };\n /**\n * Remove the element at the provided index and return it.\n * Return `undefined` if the collection does not contain this index.\n * @param {number} index Index.\n * @return {T|undefined} Value.\n * @api\n */\n Collection.prototype.removeAt = function (index) {\n var prev = this.array_[index];\n this.array_.splice(index, 1);\n this.updateLength_();\n this.dispatchEvent(new CollectionEvent(CollectionEventType.REMOVE, prev, index));\n return prev;\n };\n /**\n * Set the element at the provided index.\n * @param {number} index Index.\n * @param {T} elem Element.\n * @api\n */\n Collection.prototype.setAt = function (index, elem) {\n var n = this.getLength();\n if (index < n) {\n if (this.unique_) {\n this.assertUnique_(elem, index);\n }\n var prev = this.array_[index];\n this.array_[index] = elem;\n this.dispatchEvent(new CollectionEvent(CollectionEventType.REMOVE, prev, index));\n this.dispatchEvent(new CollectionEvent(CollectionEventType.ADD, elem, index));\n }\n else {\n for (var j = n; j < index; ++j) {\n this.insertAt(j, undefined);\n }\n this.insertAt(index, elem);\n }\n };\n /**\n * @private\n */\n Collection.prototype.updateLength_ = function () {\n this.set(Property.LENGTH, this.array_.length);\n };\n /**\n * @private\n * @param {T} elem Element.\n * @param {number} [opt_except] Optional index to ignore.\n */\n Collection.prototype.assertUnique_ = function (elem, opt_except) {\n for (var i = 0, ii = this.array_.length; i < ii; ++i) {\n if (this.array_[i] === elem && i !== opt_except) {\n throw new AssertionError(58);\n }\n }\n };\n return Collection;\n}(BaseObject));\nexport default Collection;\n//# sourceMappingURL=Collection.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/layer/Group\n */\nimport BaseLayer from './Base.js';\nimport Collection from '../Collection.js';\nimport CollectionEventType from '../CollectionEventType.js';\nimport EventType from '../events/EventType.js';\nimport ObjectEventType from '../ObjectEventType.js';\nimport SourceState from '../source/State.js';\nimport { assert } from '../asserts.js';\nimport { assign, clear } from '../obj.js';\nimport { getIntersection } from '../extent.js';\nimport { getUid } from '../util.js';\nimport { listen, unlistenByKey } from '../events.js';\n/***\n * @template Return\n * @typedef {import(\"../Observable\").OnSignature &\n * import(\"../Observable\").OnSignature &\n * import(\"../Observable\").CombinedOnSignature} GroupOnSignature\n */\n/**\n * @typedef {Object} Options\n * @property {number} [opacity=1] Opacity (0, 1).\n * @property {boolean} [visible=true] Visibility.\n * @property {import(\"../extent.js\").Extent} [extent] The bounding extent for layer rendering. The layer will not be\n * rendered outside of this extent.\n * @property {number} [zIndex] The z-index for layer rendering. At rendering time, the layers\n * will be ordered, first by Z-index and then by position. When `undefined`, a `zIndex` of 0 is assumed\n * for layers that are added to the map's `layers` collection, or `Infinity` when the layer's `setMap()`\n * method was used.\n * @property {number} [minResolution] The minimum resolution (inclusive) at which this layer will be\n * visible.\n * @property {number} [maxResolution] The maximum resolution (exclusive) below which this layer will\n * be visible.\n * @property {number} [minZoom] The minimum view zoom level (exclusive) above which this layer will be\n * visible.\n * @property {number} [maxZoom] The maximum view zoom level (inclusive) at which this layer will\n * be visible.\n * @property {Array|import(\"../Collection.js\").default} [layers] Child layers.\n * @property {Object} [properties] Arbitrary observable properties. Can be accessed with `#get()` and `#set()`.\n */\n/**\n * @enum {string}\n * @private\n */\nvar Property = {\n LAYERS: 'layers',\n};\n/**\n * @classdesc\n * A {@link module:ol/Collection~Collection} of layers that are handled together.\n *\n * A generic `change` event is triggered when the group/Collection changes.\n *\n * @api\n */\nvar LayerGroup = /** @class */ (function (_super) {\n __extends(LayerGroup, _super);\n /**\n * @param {Options} [opt_options] Layer options.\n */\n function LayerGroup(opt_options) {\n var _this = this;\n var options = opt_options || {};\n var baseOptions = /** @type {Options} */ (assign({}, options));\n delete baseOptions.layers;\n var layers = options.layers;\n _this = _super.call(this, baseOptions) || this;\n /***\n * @type {GroupOnSignature}\n */\n _this.on;\n /***\n * @type {GroupOnSignature}\n */\n _this.once;\n /***\n * @type {GroupOnSignature}\n */\n _this.un;\n /**\n * @private\n * @type {Array}\n */\n _this.layersListenerKeys_ = [];\n /**\n * @private\n * @type {Object>}\n */\n _this.listenerKeys_ = {};\n _this.addChangeListener(Property.LAYERS, _this.handleLayersChanged_);\n if (layers) {\n if (Array.isArray(layers)) {\n layers = new Collection(layers.slice(), { unique: true });\n }\n else {\n assert(typeof ( /** @type {?} */(layers).getArray) === 'function', 43); // Expected `layers` to be an array or a `Collection`\n }\n }\n else {\n layers = new Collection(undefined, { unique: true });\n }\n _this.setLayers(layers);\n return _this;\n }\n /**\n * @private\n */\n LayerGroup.prototype.handleLayerChange_ = function () {\n this.changed();\n };\n /**\n * @private\n */\n LayerGroup.prototype.handleLayersChanged_ = function () {\n this.layersListenerKeys_.forEach(unlistenByKey);\n this.layersListenerKeys_.length = 0;\n var layers = this.getLayers();\n this.layersListenerKeys_.push(listen(layers, CollectionEventType.ADD, this.handleLayersAdd_, this), listen(layers, CollectionEventType.REMOVE, this.handleLayersRemove_, this));\n for (var id in this.listenerKeys_) {\n this.listenerKeys_[id].forEach(unlistenByKey);\n }\n clear(this.listenerKeys_);\n var layersArray = layers.getArray();\n for (var i = 0, ii = layersArray.length; i < ii; i++) {\n var layer = layersArray[i];\n this.listenerKeys_[getUid(layer)] = [\n listen(layer, ObjectEventType.PROPERTYCHANGE, this.handleLayerChange_, this),\n listen(layer, EventType.CHANGE, this.handleLayerChange_, this),\n ];\n }\n this.changed();\n };\n /**\n * @param {import(\"../Collection.js\").CollectionEvent} collectionEvent CollectionEvent.\n * @private\n */\n LayerGroup.prototype.handleLayersAdd_ = function (collectionEvent) {\n var layer = /** @type {import(\"./Base.js\").default} */ (collectionEvent.element);\n this.listenerKeys_[getUid(layer)] = [\n listen(layer, ObjectEventType.PROPERTYCHANGE, this.handleLayerChange_, this),\n listen(layer, EventType.CHANGE, this.handleLayerChange_, this),\n ];\n this.changed();\n };\n /**\n * @param {import(\"../Collection.js\").CollectionEvent} collectionEvent CollectionEvent.\n * @private\n */\n LayerGroup.prototype.handleLayersRemove_ = function (collectionEvent) {\n var layer = /** @type {import(\"./Base.js\").default} */ (collectionEvent.element);\n var key = getUid(layer);\n this.listenerKeys_[key].forEach(unlistenByKey);\n delete this.listenerKeys_[key];\n this.changed();\n };\n /**\n * Returns the {@link module:ol/Collection collection} of {@link module:ol/layer/Layer~Layer layers}\n * in this group.\n * @return {!import(\"../Collection.js\").default} Collection of\n * {@link module:ol/layer/Base layers} that are part of this group.\n * @observable\n * @api\n */\n LayerGroup.prototype.getLayers = function () {\n return /** @type {!import(\"../Collection.js\").default} */ (this.get(Property.LAYERS));\n };\n /**\n * Set the {@link module:ol/Collection collection} of {@link module:ol/layer/Layer~Layer layers}\n * in this group.\n * @param {!import(\"../Collection.js\").default} layers Collection of\n * {@link module:ol/layer/Base layers} that are part of this group.\n * @observable\n * @api\n */\n LayerGroup.prototype.setLayers = function (layers) {\n this.set(Property.LAYERS, layers);\n };\n /**\n * @param {Array} [opt_array] Array of layers (to be modified in place).\n * @return {Array} Array of layers.\n */\n LayerGroup.prototype.getLayersArray = function (opt_array) {\n var array = opt_array !== undefined ? opt_array : [];\n this.getLayers().forEach(function (layer) {\n layer.getLayersArray(array);\n });\n return array;\n };\n /**\n * Get the layer states list and use this groups z-index as the default\n * for all layers in this and nested groups, if it is unset at this point.\n * If opt_states is not provided and this group's z-index is undefined\n * 0 is used a the default z-index.\n * @param {Array} [opt_states] Optional list\n * of layer states (to be modified in place).\n * @return {Array} List of layer states.\n */\n LayerGroup.prototype.getLayerStatesArray = function (opt_states) {\n var states = opt_states !== undefined ? opt_states : [];\n var pos = states.length;\n this.getLayers().forEach(function (layer) {\n layer.getLayerStatesArray(states);\n });\n var ownLayerState = this.getLayerState();\n var defaultZIndex = ownLayerState.zIndex;\n if (!opt_states && ownLayerState.zIndex === undefined) {\n defaultZIndex = 0;\n }\n for (var i = pos, ii = states.length; i < ii; i++) {\n var layerState = states[i];\n layerState.opacity *= ownLayerState.opacity;\n layerState.visible = layerState.visible && ownLayerState.visible;\n layerState.maxResolution = Math.min(layerState.maxResolution, ownLayerState.maxResolution);\n layerState.minResolution = Math.max(layerState.minResolution, ownLayerState.minResolution);\n layerState.minZoom = Math.max(layerState.minZoom, ownLayerState.minZoom);\n layerState.maxZoom = Math.min(layerState.maxZoom, ownLayerState.maxZoom);\n if (ownLayerState.extent !== undefined) {\n if (layerState.extent !== undefined) {\n layerState.extent = getIntersection(layerState.extent, ownLayerState.extent);\n }\n else {\n layerState.extent = ownLayerState.extent;\n }\n }\n if (layerState.zIndex === undefined) {\n layerState.zIndex = defaultZIndex;\n }\n }\n return states;\n };\n /**\n * @return {import(\"../source/State.js\").default} Source state.\n */\n LayerGroup.prototype.getSourceState = function () {\n return SourceState.READY;\n };\n return LayerGroup;\n}(BaseLayer));\nexport default LayerGroup;\n//# sourceMappingURL=Group.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/MapEvent\n */\nimport Event from './events/Event.js';\n/**\n * @classdesc\n * Events emitted as map events are instances of this type.\n * See {@link module:ol/PluggableMap~PluggableMap} for which events trigger a map event.\n */\nvar MapEvent = /** @class */ (function (_super) {\n __extends(MapEvent, _super);\n /**\n * @param {string} type Event type.\n * @param {import(\"./PluggableMap.js\").default} map Map.\n * @param {?import(\"./PluggableMap.js\").FrameState} [opt_frameState] Frame state.\n */\n function MapEvent(type, map, opt_frameState) {\n var _this = _super.call(this, type) || this;\n /**\n * The map where the event occurred.\n * @type {import(\"./PluggableMap.js\").default}\n * @api\n */\n _this.map = map;\n /**\n * The frame state at the time of the event.\n * @type {?import(\"./PluggableMap.js\").FrameState}\n * @api\n */\n _this.frameState = opt_frameState !== undefined ? opt_frameState : null;\n return _this;\n }\n return MapEvent;\n}(Event));\nexport default MapEvent;\n//# sourceMappingURL=MapEvent.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/MapBrowserEvent\n */\nimport MapEvent from './MapEvent.js';\n/**\n * @classdesc\n * Events emitted as map browser events are instances of this type.\n * See {@link module:ol/PluggableMap~PluggableMap} for which events trigger a map browser event.\n * @template {UIEvent} EVENT\n */\nvar MapBrowserEvent = /** @class */ (function (_super) {\n __extends(MapBrowserEvent, _super);\n /**\n * @param {string} type Event type.\n * @param {import(\"./PluggableMap.js\").default} map Map.\n * @param {EVENT} originalEvent Original event.\n * @param {boolean} [opt_dragging] Is the map currently being dragged?\n * @param {?import(\"./PluggableMap.js\").FrameState} [opt_frameState] Frame state.\n */\n function MapBrowserEvent(type, map, originalEvent, opt_dragging, opt_frameState) {\n var _this = _super.call(this, type, map, opt_frameState) || this;\n /**\n * The original browser event.\n * @const\n * @type {EVENT}\n * @api\n */\n _this.originalEvent = originalEvent;\n /**\n * The map pixel relative to the viewport corresponding to the original browser event.\n * @type {?import(\"./pixel.js\").Pixel}\n */\n _this.pixel_ = null;\n /**\n * The coordinate in the user projection corresponding to the original browser event.\n * @type {?import(\"./coordinate.js\").Coordinate}\n */\n _this.coordinate_ = null;\n /**\n * Indicates if the map is currently being dragged. Only set for\n * `POINTERDRAG` and `POINTERMOVE` events. Default is `false`.\n *\n * @type {boolean}\n * @api\n */\n _this.dragging = opt_dragging !== undefined ? opt_dragging : false;\n return _this;\n }\n Object.defineProperty(MapBrowserEvent.prototype, \"pixel\", {\n /**\n * The map pixel relative to the viewport corresponding to the original event.\n * @type {import(\"./pixel.js\").Pixel}\n * @api\n */\n get: function () {\n if (!this.pixel_) {\n this.pixel_ = this.map.getEventPixel(this.originalEvent);\n }\n return this.pixel_;\n },\n set: function (pixel) {\n this.pixel_ = pixel;\n },\n enumerable: false,\n configurable: true\n });\n Object.defineProperty(MapBrowserEvent.prototype, \"coordinate\", {\n /**\n * The coordinate corresponding to the original browser event. This will be in the user\n * projection if one is set. Otherwise it will be in the view projection.\n * @type {import(\"./coordinate.js\").Coordinate}\n * @api\n */\n get: function () {\n if (!this.coordinate_) {\n this.coordinate_ = this.map.getCoordinateFromPixel(this.pixel);\n }\n return this.coordinate_;\n },\n set: function (coordinate) {\n this.coordinate_ = coordinate;\n },\n enumerable: false,\n configurable: true\n });\n /**\n * Prevents the default browser action.\n * See https://developer.mozilla.org/en-US/docs/Web/API/event.preventDefault.\n * @api\n */\n MapBrowserEvent.prototype.preventDefault = function () {\n _super.prototype.preventDefault.call(this);\n if ('preventDefault' in this.originalEvent) {\n /** @type {UIEvent} */ (this.originalEvent).preventDefault();\n }\n };\n /**\n * Prevents further propagation of the current event.\n * See https://developer.mozilla.org/en-US/docs/Web/API/event.stopPropagation.\n * @api\n */\n MapBrowserEvent.prototype.stopPropagation = function () {\n _super.prototype.stopPropagation.call(this);\n if ('stopPropagation' in this.originalEvent) {\n /** @type {UIEvent} */ (this.originalEvent).stopPropagation();\n }\n };\n return MapBrowserEvent;\n}(MapEvent));\nexport default MapBrowserEvent;\n//# sourceMappingURL=MapBrowserEvent.js.map","/**\n * @module ol/MapBrowserEventType\n */\nimport EventType from './events/EventType.js';\n/**\n * Constants for event names.\n * @enum {string}\n */\nexport default {\n /**\n * A true single click with no dragging and no double click. Note that this\n * event is delayed by 250 ms to ensure that it is not a double click.\n * @event module:ol/MapBrowserEvent~MapBrowserEvent#singleclick\n * @api\n */\n SINGLECLICK: 'singleclick',\n /**\n * A click with no dragging. A double click will fire two of this.\n * @event module:ol/MapBrowserEvent~MapBrowserEvent#click\n * @api\n */\n CLICK: EventType.CLICK,\n /**\n * A true double click, with no dragging.\n * @event module:ol/MapBrowserEvent~MapBrowserEvent#dblclick\n * @api\n */\n DBLCLICK: EventType.DBLCLICK,\n /**\n * Triggered when a pointer is dragged.\n * @event module:ol/MapBrowserEvent~MapBrowserEvent#pointerdrag\n * @api\n */\n POINTERDRAG: 'pointerdrag',\n /**\n * Triggered when a pointer is moved. Note that on touch devices this is\n * triggered when the map is panned, so is not the same as mousemove.\n * @event module:ol/MapBrowserEvent~MapBrowserEvent#pointermove\n * @api\n */\n POINTERMOVE: 'pointermove',\n POINTERDOWN: 'pointerdown',\n POINTERUP: 'pointerup',\n POINTEROVER: 'pointerover',\n POINTEROUT: 'pointerout',\n POINTERENTER: 'pointerenter',\n POINTERLEAVE: 'pointerleave',\n POINTERCANCEL: 'pointercancel',\n};\n/***\n * @typedef {'singleclick'|'click'|'dblclick'|'pointerdrag'|'pointermove'} Types\n */\n//# sourceMappingURL=MapBrowserEventType.js.map","/**\n * @module ol/pointer/EventType\n */\n/**\n * Constants for event names.\n * @enum {string}\n */\nexport default {\n POINTERMOVE: 'pointermove',\n POINTERDOWN: 'pointerdown',\n POINTERUP: 'pointerup',\n POINTEROVER: 'pointerover',\n POINTEROUT: 'pointerout',\n POINTERENTER: 'pointerenter',\n POINTERLEAVE: 'pointerleave',\n POINTERCANCEL: 'pointercancel',\n};\n//# sourceMappingURL=EventType.js.map","/**\n * @module ol/MapBrowserEventHandler\n */\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nimport EventType from './events/EventType.js';\nimport MapBrowserEvent from './MapBrowserEvent.js';\nimport MapBrowserEventType from './MapBrowserEventType.js';\nimport PointerEventType from './pointer/EventType.js';\nimport Target from './events/Target.js';\nimport { PASSIVE_EVENT_LISTENERS } from './has.js';\nimport { VOID } from './functions.js';\nimport { listen, unlistenByKey } from './events.js';\nvar MapBrowserEventHandler = /** @class */ (function (_super) {\n __extends(MapBrowserEventHandler, _super);\n /**\n * @param {import(\"./PluggableMap.js\").default} map The map with the viewport to listen to events on.\n * @param {number} [moveTolerance] The minimal distance the pointer must travel to trigger a move.\n */\n function MapBrowserEventHandler(map, moveTolerance) {\n var _this = _super.call(this, map) || this;\n /**\n * This is the element that we will listen to the real events on.\n * @type {import(\"./PluggableMap.js\").default}\n * @private\n */\n _this.map_ = map;\n /**\n * @type {any}\n * @private\n */\n _this.clickTimeoutId_;\n /**\n * Emulate dblclick and singleclick. Will be true when only one pointer is active.\n * @type {boolean}\n */\n _this.emulateClicks_ = false;\n /**\n * @type {boolean}\n * @private\n */\n _this.dragging_ = false;\n /**\n * @type {!Array}\n * @private\n */\n _this.dragListenerKeys_ = [];\n /**\n * @type {number}\n * @private\n */\n _this.moveTolerance_ = moveTolerance === undefined ? 1 : moveTolerance;\n /**\n * The most recent \"down\" type event (or null if none have occurred).\n * Set on pointerdown.\n * @type {PointerEvent}\n * @private\n */\n _this.down_ = null;\n var element = _this.map_.getViewport();\n /**\n * @type {number}\n * @private\n */\n _this.activePointers_ = 0;\n /**\n * @type {!Object}\n * @private\n */\n _this.trackedTouches_ = {};\n _this.element_ = element;\n /**\n * @type {?import(\"./events.js\").EventsKey}\n * @private\n */\n _this.pointerdownListenerKey_ = listen(element, PointerEventType.POINTERDOWN, _this.handlePointerDown_, _this);\n /**\n * @type {PointerEvent}\n * @private\n */\n _this.originalPointerMoveEvent_;\n /**\n * @type {?import(\"./events.js\").EventsKey}\n * @private\n */\n _this.relayedListenerKey_ = listen(element, PointerEventType.POINTERMOVE, _this.relayEvent_, _this);\n /**\n * @private\n */\n _this.boundHandleTouchMove_ = _this.handleTouchMove_.bind(_this);\n _this.element_.addEventListener(EventType.TOUCHMOVE, _this.boundHandleTouchMove_, PASSIVE_EVENT_LISTENERS ? { passive: false } : false);\n return _this;\n }\n /**\n * @param {PointerEvent} pointerEvent Pointer\n * event.\n * @private\n */\n MapBrowserEventHandler.prototype.emulateClick_ = function (pointerEvent) {\n var newEvent = new MapBrowserEvent(MapBrowserEventType.CLICK, this.map_, pointerEvent);\n this.dispatchEvent(newEvent);\n if (this.clickTimeoutId_ !== undefined) {\n // double-click\n clearTimeout(this.clickTimeoutId_);\n this.clickTimeoutId_ = undefined;\n newEvent = new MapBrowserEvent(MapBrowserEventType.DBLCLICK, this.map_, pointerEvent);\n this.dispatchEvent(newEvent);\n }\n else {\n // click\n this.clickTimeoutId_ = setTimeout(\n /** @this {MapBrowserEventHandler} */\n function () {\n this.clickTimeoutId_ = undefined;\n var newEvent = new MapBrowserEvent(MapBrowserEventType.SINGLECLICK, this.map_, pointerEvent);\n this.dispatchEvent(newEvent);\n }.bind(this), 250);\n }\n };\n /**\n * Keeps track on how many pointers are currently active.\n *\n * @param {PointerEvent} pointerEvent Pointer\n * event.\n * @private\n */\n MapBrowserEventHandler.prototype.updateActivePointers_ = function (pointerEvent) {\n var event = pointerEvent;\n if (event.type == MapBrowserEventType.POINTERUP ||\n event.type == MapBrowserEventType.POINTERCANCEL) {\n delete this.trackedTouches_[event.pointerId];\n }\n else if (event.type == MapBrowserEventType.POINTERDOWN) {\n this.trackedTouches_[event.pointerId] = true;\n }\n this.activePointers_ = Object.keys(this.trackedTouches_).length;\n };\n /**\n * @param {PointerEvent} pointerEvent Pointer\n * event.\n * @private\n */\n MapBrowserEventHandler.prototype.handlePointerUp_ = function (pointerEvent) {\n this.updateActivePointers_(pointerEvent);\n var newEvent = new MapBrowserEvent(MapBrowserEventType.POINTERUP, this.map_, pointerEvent);\n this.dispatchEvent(newEvent);\n // We emulate click events on left mouse button click, touch contact, and pen\n // contact. isMouseActionButton returns true in these cases (evt.button is set\n // to 0).\n // See http://www.w3.org/TR/pointerevents/#button-states\n // We only fire click, singleclick, and doubleclick if nobody has called\n // event.preventDefault().\n if (this.emulateClicks_ &&\n !newEvent.defaultPrevented &&\n !this.dragging_ &&\n this.isMouseActionButton_(pointerEvent)) {\n this.emulateClick_(this.down_);\n }\n if (this.activePointers_ === 0) {\n this.dragListenerKeys_.forEach(unlistenByKey);\n this.dragListenerKeys_.length = 0;\n this.dragging_ = false;\n this.down_ = null;\n }\n };\n /**\n * @param {PointerEvent} pointerEvent Pointer\n * event.\n * @return {boolean} If the left mouse button was pressed.\n * @private\n */\n MapBrowserEventHandler.prototype.isMouseActionButton_ = function (pointerEvent) {\n return pointerEvent.button === 0;\n };\n /**\n * @param {PointerEvent} pointerEvent Pointer\n * event.\n * @private\n */\n MapBrowserEventHandler.prototype.handlePointerDown_ = function (pointerEvent) {\n this.emulateClicks_ = this.activePointers_ === 0;\n this.updateActivePointers_(pointerEvent);\n var newEvent = new MapBrowserEvent(MapBrowserEventType.POINTERDOWN, this.map_, pointerEvent);\n this.dispatchEvent(newEvent);\n // Store a copy of the down event\n this.down_ = /** @type {PointerEvent} */ ({});\n for (var property in pointerEvent) {\n var value = pointerEvent[property];\n this.down_[property] = typeof value === 'function' ? VOID : value;\n }\n if (this.dragListenerKeys_.length === 0) {\n var doc = this.map_.getOwnerDocument();\n this.dragListenerKeys_.push(listen(doc, MapBrowserEventType.POINTERMOVE, this.handlePointerMove_, this), listen(doc, MapBrowserEventType.POINTERUP, this.handlePointerUp_, this), \n /* Note that the listener for `pointercancel is set up on\n * `pointerEventHandler_` and not `documentPointerEventHandler_` like\n * the `pointerup` and `pointermove` listeners.\n *\n * The reason for this is the following: `TouchSource.vacuumTouches_()`\n * issues `pointercancel` events, when there was no `touchend` for a\n * `touchstart`. Now, let's say a first `touchstart` is registered on\n * `pointerEventHandler_`. The `documentPointerEventHandler_` is set up.\n * But `documentPointerEventHandler_` doesn't know about the first\n * `touchstart`. If there is no `touchend` for the `touchstart`, we can\n * only receive a `touchcancel` from `pointerEventHandler_`, because it is\n * only registered there.\n */\n listen(this.element_, MapBrowserEventType.POINTERCANCEL, this.handlePointerUp_, this));\n if (this.element_.getRootNode && this.element_.getRootNode() !== doc) {\n this.dragListenerKeys_.push(listen(this.element_.getRootNode(), MapBrowserEventType.POINTERUP, this.handlePointerUp_, this));\n }\n }\n };\n /**\n * @param {PointerEvent} pointerEvent Pointer\n * event.\n * @private\n */\n MapBrowserEventHandler.prototype.handlePointerMove_ = function (pointerEvent) {\n // Between pointerdown and pointerup, pointermove events are triggered.\n // To avoid a 'false' touchmove event to be dispatched, we test if the pointer\n // moved a significant distance.\n if (this.isMoving_(pointerEvent)) {\n this.dragging_ = true;\n var newEvent = new MapBrowserEvent(MapBrowserEventType.POINTERDRAG, this.map_, pointerEvent, this.dragging_);\n this.dispatchEvent(newEvent);\n }\n };\n /**\n * Wrap and relay a pointer event. Note that this requires that the type\n * string for the MapBrowserEvent matches the PointerEvent type.\n * @param {PointerEvent} pointerEvent Pointer\n * event.\n * @private\n */\n MapBrowserEventHandler.prototype.relayEvent_ = function (pointerEvent) {\n this.originalPointerMoveEvent_ = pointerEvent;\n var dragging = !!(this.down_ && this.isMoving_(pointerEvent));\n this.dispatchEvent(new MapBrowserEvent(pointerEvent.type, this.map_, pointerEvent, dragging));\n };\n /**\n * Flexible handling of a `touch-action: none` css equivalent: because calling\n * `preventDefault()` on a `pointermove` event does not stop native page scrolling\n * and zooming, we also listen for `touchmove` and call `preventDefault()` on it\n * when an interaction (currently `DragPan` handles the event.\n * @param {TouchEvent} event Event.\n * @private\n */\n MapBrowserEventHandler.prototype.handleTouchMove_ = function (event) {\n // Due to https://github.com/mpizenberg/elm-pep/issues/2, `this.originalPointerMoveEvent_`\n // may not be initialized yet when we get here on a platform without native pointer events.\n var originalEvent = this.originalPointerMoveEvent_;\n if ((!originalEvent || originalEvent.defaultPrevented) &&\n (typeof event.cancelable !== 'boolean' || event.cancelable === true)) {\n event.preventDefault();\n }\n };\n /**\n * @param {PointerEvent} pointerEvent Pointer\n * event.\n * @return {boolean} Is moving.\n * @private\n */\n MapBrowserEventHandler.prototype.isMoving_ = function (pointerEvent) {\n return (this.dragging_ ||\n Math.abs(pointerEvent.clientX - this.down_.clientX) >\n this.moveTolerance_ ||\n Math.abs(pointerEvent.clientY - this.down_.clientY) > this.moveTolerance_);\n };\n /**\n * Clean up.\n */\n MapBrowserEventHandler.prototype.disposeInternal = function () {\n if (this.relayedListenerKey_) {\n unlistenByKey(this.relayedListenerKey_);\n this.relayedListenerKey_ = null;\n }\n this.element_.removeEventListener(EventType.TOUCHMOVE, this.boundHandleTouchMove_);\n if (this.pointerdownListenerKey_) {\n unlistenByKey(this.pointerdownListenerKey_);\n this.pointerdownListenerKey_ = null;\n }\n this.dragListenerKeys_.forEach(unlistenByKey);\n this.dragListenerKeys_.length = 0;\n this.element_ = null;\n _super.prototype.disposeInternal.call(this);\n };\n return MapBrowserEventHandler;\n}(Target));\nexport default MapBrowserEventHandler;\n//# sourceMappingURL=MapBrowserEventHandler.js.map","/**\n * @module ol/MapEventType\n */\n/**\n * @enum {string}\n */\nexport default {\n /**\n * Triggered after a map frame is rendered.\n * @event module:ol/MapEvent~MapEvent#postrender\n * @api\n */\n POSTRENDER: 'postrender',\n /**\n * Triggered when the map starts moving.\n * @event module:ol/MapEvent~MapEvent#movestart\n * @api\n */\n MOVESTART: 'movestart',\n /**\n * Triggered after the map is moved.\n * @event module:ol/MapEvent~MapEvent#moveend\n * @api\n */\n MOVEEND: 'moveend',\n};\n/***\n * @typedef {'postrender'|'movestart'|'moveend'} Types\n */\n//# sourceMappingURL=MapEventType.js.map","/**\n * @module ol/MapProperty\n */\n/**\n * @enum {string}\n */\nexport default {\n LAYERGROUP: 'layergroup',\n SIZE: 'size',\n TARGET: 'target',\n VIEW: 'view',\n};\n//# sourceMappingURL=MapProperty.js.map","/**\n * @module ol/structs/PriorityQueue\n */\nimport { assert } from '../asserts.js';\nimport { clear } from '../obj.js';\n/**\n * @type {number}\n */\nexport var DROP = Infinity;\n/**\n * @classdesc\n * Priority queue.\n *\n * The implementation is inspired from the Closure Library's Heap class and\n * Python's heapq module.\n *\n * See https://github.com/google/closure-library/blob/master/closure/goog/structs/heap.js\n * and https://hg.python.org/cpython/file/2.7/Lib/heapq.py.\n *\n * @template T\n */\nvar PriorityQueue = /** @class */ (function () {\n /**\n * @param {function(T): number} priorityFunction Priority function.\n * @param {function(T): string} keyFunction Key function.\n */\n function PriorityQueue(priorityFunction, keyFunction) {\n /**\n * @type {function(T): number}\n * @private\n */\n this.priorityFunction_ = priorityFunction;\n /**\n * @type {function(T): string}\n * @private\n */\n this.keyFunction_ = keyFunction;\n /**\n * @type {Array}\n * @private\n */\n this.elements_ = [];\n /**\n * @type {Array}\n * @private\n */\n this.priorities_ = [];\n /**\n * @type {!Object}\n * @private\n */\n this.queuedElements_ = {};\n }\n /**\n * FIXME empty description for jsdoc\n */\n PriorityQueue.prototype.clear = function () {\n this.elements_.length = 0;\n this.priorities_.length = 0;\n clear(this.queuedElements_);\n };\n /**\n * Remove and return the highest-priority element. O(log N).\n * @return {T} Element.\n */\n PriorityQueue.prototype.dequeue = function () {\n var elements = this.elements_;\n var priorities = this.priorities_;\n var element = elements[0];\n if (elements.length == 1) {\n elements.length = 0;\n priorities.length = 0;\n }\n else {\n elements[0] = elements.pop();\n priorities[0] = priorities.pop();\n this.siftUp_(0);\n }\n var elementKey = this.keyFunction_(element);\n delete this.queuedElements_[elementKey];\n return element;\n };\n /**\n * Enqueue an element. O(log N).\n * @param {T} element Element.\n * @return {boolean} The element was added to the queue.\n */\n PriorityQueue.prototype.enqueue = function (element) {\n assert(!(this.keyFunction_(element) in this.queuedElements_), 31); // Tried to enqueue an `element` that was already added to the queue\n var priority = this.priorityFunction_(element);\n if (priority != DROP) {\n this.elements_.push(element);\n this.priorities_.push(priority);\n this.queuedElements_[this.keyFunction_(element)] = true;\n this.siftDown_(0, this.elements_.length - 1);\n return true;\n }\n return false;\n };\n /**\n * @return {number} Count.\n */\n PriorityQueue.prototype.getCount = function () {\n return this.elements_.length;\n };\n /**\n * Gets the index of the left child of the node at the given index.\n * @param {number} index The index of the node to get the left child for.\n * @return {number} The index of the left child.\n * @private\n */\n PriorityQueue.prototype.getLeftChildIndex_ = function (index) {\n return index * 2 + 1;\n };\n /**\n * Gets the index of the right child of the node at the given index.\n * @param {number} index The index of the node to get the right child for.\n * @return {number} The index of the right child.\n * @private\n */\n PriorityQueue.prototype.getRightChildIndex_ = function (index) {\n return index * 2 + 2;\n };\n /**\n * Gets the index of the parent of the node at the given index.\n * @param {number} index The index of the node to get the parent for.\n * @return {number} The index of the parent.\n * @private\n */\n PriorityQueue.prototype.getParentIndex_ = function (index) {\n return (index - 1) >> 1;\n };\n /**\n * Make this a heap. O(N).\n * @private\n */\n PriorityQueue.prototype.heapify_ = function () {\n var i;\n for (i = (this.elements_.length >> 1) - 1; i >= 0; i--) {\n this.siftUp_(i);\n }\n };\n /**\n * @return {boolean} Is empty.\n */\n PriorityQueue.prototype.isEmpty = function () {\n return this.elements_.length === 0;\n };\n /**\n * @param {string} key Key.\n * @return {boolean} Is key queued.\n */\n PriorityQueue.prototype.isKeyQueued = function (key) {\n return key in this.queuedElements_;\n };\n /**\n * @param {T} element Element.\n * @return {boolean} Is queued.\n */\n PriorityQueue.prototype.isQueued = function (element) {\n return this.isKeyQueued(this.keyFunction_(element));\n };\n /**\n * @param {number} index The index of the node to move down.\n * @private\n */\n PriorityQueue.prototype.siftUp_ = function (index) {\n var elements = this.elements_;\n var priorities = this.priorities_;\n var count = elements.length;\n var element = elements[index];\n var priority = priorities[index];\n var startIndex = index;\n while (index < count >> 1) {\n var lIndex = this.getLeftChildIndex_(index);\n var rIndex = this.getRightChildIndex_(index);\n var smallerChildIndex = rIndex < count && priorities[rIndex] < priorities[lIndex]\n ? rIndex\n : lIndex;\n elements[index] = elements[smallerChildIndex];\n priorities[index] = priorities[smallerChildIndex];\n index = smallerChildIndex;\n }\n elements[index] = element;\n priorities[index] = priority;\n this.siftDown_(startIndex, index);\n };\n /**\n * @param {number} startIndex The index of the root.\n * @param {number} index The index of the node to move up.\n * @private\n */\n PriorityQueue.prototype.siftDown_ = function (startIndex, index) {\n var elements = this.elements_;\n var priorities = this.priorities_;\n var element = elements[index];\n var priority = priorities[index];\n while (index > startIndex) {\n var parentIndex = this.getParentIndex_(index);\n if (priorities[parentIndex] > priority) {\n elements[index] = elements[parentIndex];\n priorities[index] = priorities[parentIndex];\n index = parentIndex;\n }\n else {\n break;\n }\n }\n elements[index] = element;\n priorities[index] = priority;\n };\n /**\n * FIXME empty description for jsdoc\n */\n PriorityQueue.prototype.reprioritize = function () {\n var priorityFunction = this.priorityFunction_;\n var elements = this.elements_;\n var priorities = this.priorities_;\n var index = 0;\n var n = elements.length;\n var element, i, priority;\n for (i = 0; i < n; ++i) {\n element = elements[i];\n priority = priorityFunction(element);\n if (priority == DROP) {\n delete this.queuedElements_[this.keyFunction_(element)];\n }\n else {\n priorities[index] = priority;\n elements[index++] = element;\n }\n }\n elements.length = index;\n priorities.length = index;\n this.heapify_();\n };\n return PriorityQueue;\n}());\nexport default PriorityQueue;\n//# sourceMappingURL=PriorityQueue.js.map","/**\n * @module ol/TileState\n */\n/**\n * @enum {number}\n */\nexport default {\n IDLE: 0,\n LOADING: 1,\n LOADED: 2,\n /**\n * Indicates that tile loading failed\n * @type {number}\n */\n ERROR: 3,\n EMPTY: 4,\n};\n//# sourceMappingURL=TileState.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/TileQueue\n */\nimport EventType from './events/EventType.js';\nimport PriorityQueue, { DROP } from './structs/PriorityQueue.js';\nimport TileState from './TileState.js';\n/**\n * @typedef {function(import(\"./Tile.js\").default, string, import(\"./coordinate.js\").Coordinate, number): number} PriorityFunction\n */\nvar TileQueue = /** @class */ (function (_super) {\n __extends(TileQueue, _super);\n /**\n * @param {PriorityFunction} tilePriorityFunction Tile priority function.\n * @param {function(): ?} tileChangeCallback Function called on each tile change event.\n */\n function TileQueue(tilePriorityFunction, tileChangeCallback) {\n var _this = _super.call(this, \n /**\n * @param {Array} element Element.\n * @return {number} Priority.\n */\n function (element) {\n return tilePriorityFunction.apply(null, element);\n }, \n /**\n * @param {Array} element Element.\n * @return {string} Key.\n */\n function (element) {\n return /** @type {import(\"./Tile.js\").default} */ (element[0]).getKey();\n }) || this;\n /** @private */\n _this.boundHandleTileChange_ = _this.handleTileChange.bind(_this);\n /**\n * @private\n * @type {function(): ?}\n */\n _this.tileChangeCallback_ = tileChangeCallback;\n /**\n * @private\n * @type {number}\n */\n _this.tilesLoading_ = 0;\n /**\n * @private\n * @type {!Object}\n */\n _this.tilesLoadingKeys_ = {};\n return _this;\n }\n /**\n * @param {Array} element Element.\n * @return {boolean} The element was added to the queue.\n */\n TileQueue.prototype.enqueue = function (element) {\n var added = _super.prototype.enqueue.call(this, element);\n if (added) {\n var tile = element[0];\n tile.addEventListener(EventType.CHANGE, this.boundHandleTileChange_);\n }\n return added;\n };\n /**\n * @return {number} Number of tiles loading.\n */\n TileQueue.prototype.getTilesLoading = function () {\n return this.tilesLoading_;\n };\n /**\n * @param {import(\"./events/Event.js\").default} event Event.\n * @protected\n */\n TileQueue.prototype.handleTileChange = function (event) {\n var tile = /** @type {import(\"./Tile.js\").default} */ (event.target);\n var state = tile.getState();\n if (state === TileState.LOADED ||\n state === TileState.ERROR ||\n state === TileState.EMPTY) {\n tile.removeEventListener(EventType.CHANGE, this.boundHandleTileChange_);\n var tileKey = tile.getKey();\n if (tileKey in this.tilesLoadingKeys_) {\n delete this.tilesLoadingKeys_[tileKey];\n --this.tilesLoading_;\n }\n this.tileChangeCallback_();\n }\n };\n /**\n * @param {number} maxTotalLoading Maximum number tiles to load simultaneously.\n * @param {number} maxNewLoads Maximum number of new tiles to load.\n */\n TileQueue.prototype.loadMoreTiles = function (maxTotalLoading, maxNewLoads) {\n var newLoads = 0;\n var state, tile, tileKey;\n while (this.tilesLoading_ < maxTotalLoading &&\n newLoads < maxNewLoads &&\n this.getCount() > 0) {\n tile = /** @type {import(\"./Tile.js\").default} */ (this.dequeue()[0]);\n tileKey = tile.getKey();\n state = tile.getState();\n if (state === TileState.IDLE && !(tileKey in this.tilesLoadingKeys_)) {\n this.tilesLoadingKeys_[tileKey] = true;\n ++this.tilesLoading_;\n ++newLoads;\n tile.load();\n }\n }\n };\n return TileQueue;\n}(PriorityQueue));\nexport default TileQueue;\n/**\n * @param {import('./PluggableMap.js').FrameState} frameState Frame state.\n * @param {import(\"./Tile.js\").default} tile Tile.\n * @param {string} tileSourceKey Tile source key.\n * @param {import(\"./coordinate.js\").Coordinate} tileCenter Tile center.\n * @param {number} tileResolution Tile resolution.\n * @return {number} Tile priority.\n */\nexport function getTilePriority(frameState, tile, tileSourceKey, tileCenter, tileResolution) {\n // Filter out tiles at higher zoom levels than the current zoom level, or that\n // are outside the visible extent.\n if (!frameState || !(tileSourceKey in frameState.wantedTiles)) {\n return DROP;\n }\n if (!frameState.wantedTiles[tileSourceKey][tile.getKey()]) {\n return DROP;\n }\n // Prioritize the highest zoom level tiles closest to the focus.\n // Tiles at higher zoom levels are prioritized using Math.log(tileResolution).\n // Within a zoom level, tiles are prioritized by the distance in pixels between\n // the center of the tile and the center of the viewport. The factor of 65536\n // means that the prioritization should behave as desired for tiles up to\n // 65536 * Math.log(2) = 45426 pixels from the focus.\n var center = frameState.viewState.center;\n var deltaX = tileCenter[0] - center[0];\n var deltaY = tileCenter[1] - center[1];\n return (65536 * Math.log(tileResolution) +\n Math.sqrt(deltaX * deltaX + deltaY * deltaY) / tileResolution);\n}\n//# sourceMappingURL=TileQueue.js.map","/**\n * @module ol/geom/GeometryType\n */\n/**\n * The geometry type. One of `'Point'`, `'LineString'`, `'LinearRing'`,\n * `'Polygon'`, `'MultiPoint'`, `'MultiLineString'`, `'MultiPolygon'`,\n * `'GeometryCollection'`, `'Circle'`.\n * @enum {string}\n */\nexport default {\n POINT: 'Point',\n LINE_STRING: 'LineString',\n LINEAR_RING: 'LinearRing',\n POLYGON: 'Polygon',\n MULTI_POINT: 'MultiPoint',\n MULTI_LINE_STRING: 'MultiLineString',\n MULTI_POLYGON: 'MultiPolygon',\n GEOMETRY_COLLECTION: 'GeometryCollection',\n CIRCLE: 'Circle',\n};\n//# sourceMappingURL=GeometryType.js.map","/**\n * @module ol/proj/Units\n */\n/**\n * Projection units: `'degrees'`, `'ft'`, `'m'`, `'pixels'`, `'tile-pixels'` or\n * `'us-ft'`.\n * @enum {string}\n */\nvar Units = {\n /**\n * Radians\n * @api\n */\n RADIANS: 'radians',\n /**\n * Degrees\n * @api\n */\n DEGREES: 'degrees',\n /**\n * Feet\n * @api\n */\n FEET: 'ft',\n /**\n * Meters\n * @api\n */\n METERS: 'm',\n /**\n * Pixels\n * @api\n */\n PIXELS: 'pixels',\n /**\n * Tile Pixels\n * @api\n */\n TILE_PIXELS: 'tile-pixels',\n /**\n * US Feet\n * @api\n */\n USFEET: 'us-ft',\n};\n/**\n * See http://duff.ess.washington.edu/data/raster/drg/docs/geotiff.txt\n * @type {Object}\n */\nvar unitByCode = {\n '9001': Units.METERS,\n '9002': Units.FEET,\n '9003': Units.USFEET,\n '9101': Units.RADIANS,\n '9102': Units.DEGREES,\n};\n/**\n * @param {number} code Unit code.\n * @return {Units} Units.\n */\nexport function fromCode(code) {\n return unitByCode[code];\n}\n/**\n * Meters per unit lookup table.\n * @const\n * @type {Object}\n * @api\n */\nexport var METERS_PER_UNIT = {};\n// use the radius of the Normal sphere\nMETERS_PER_UNIT[Units.RADIANS] = 6370997 / (2 * Math.PI);\nMETERS_PER_UNIT[Units.DEGREES] = (2 * Math.PI * 6370997) / 360;\nMETERS_PER_UNIT[Units.FEET] = 0.3048;\nMETERS_PER_UNIT[Units.METERS] = 1;\nMETERS_PER_UNIT[Units.USFEET] = 1200 / 3937;\nexport default Units;\n//# sourceMappingURL=Units.js.map","/**\n * @module ol/ViewHint\n */\n/**\n * @enum {number}\n */\nexport default {\n ANIMATING: 0,\n INTERACTING: 1,\n};\n//# sourceMappingURL=ViewHint.js.map","/**\n * @module ol/ViewProperty\n */\n/**\n * @enum {string}\n */\nexport default {\n CENTER: 'center',\n RESOLUTION: 'resolution',\n ROTATION: 'rotation',\n};\n//# sourceMappingURL=ViewProperty.js.map","/**\n * @module ol/proj/Projection\n */\nimport { METERS_PER_UNIT } from './Units.js';\n/**\n * @typedef {Object} Options\n * @property {string} code The SRS identifier code, e.g. `EPSG:4326`.\n * @property {import(\"./Units.js\").default|string} [units] Units. Required unless a\n * proj4 projection is defined for `code`.\n * @property {import(\"../extent.js\").Extent} [extent] The validity extent for the SRS.\n * @property {string} [axisOrientation='enu'] The axis orientation as specified in Proj4.\n * @property {boolean} [global=false] Whether the projection is valid for the whole globe.\n * @property {number} [metersPerUnit] The meters per unit for the SRS.\n * If not provided, the `units` are used to get the meters per unit from the {@link module:ol/proj/Units~METERS_PER_UNIT}\n * lookup table.\n * @property {import(\"../extent.js\").Extent} [worldExtent] The world extent for the SRS.\n * @property {function(number, import(\"../coordinate.js\").Coordinate):number} [getPointResolution]\n * Function to determine resolution at a point. The function is called with a\n * `number` view resolution and a {@link module:ol/coordinate~Coordinate Coordinate} as arguments, and returns\n * the `number` resolution in projection units at the passed coordinate. If this is `undefined`,\n * the default {@link module:ol/proj.getPointResolution getPointResolution()} function will be used.\n */\n/**\n * @classdesc\n * Projection definition class. One of these is created for each projection\n * supported in the application and stored in the {@link module:ol/proj} namespace.\n * You can use these in applications, but this is not required, as API params\n * and options use {@link module:ol/proj~ProjectionLike} which means the simple string\n * code will suffice.\n *\n * You can use {@link module:ol/proj.get} to retrieve the object for a particular\n * projection.\n *\n * The library includes definitions for `EPSG:4326` and `EPSG:3857`, together\n * with the following aliases:\n * * `EPSG:4326`: CRS:84, urn:ogc:def:crs:EPSG:6.6:4326,\n * urn:ogc:def:crs:OGC:1.3:CRS84, urn:ogc:def:crs:OGC:2:84,\n * http://www.opengis.net/gml/srs/epsg.xml#4326,\n * urn:x-ogc:def:crs:EPSG:4326\n * * `EPSG:3857`: EPSG:102100, EPSG:102113, EPSG:900913,\n * urn:ogc:def:crs:EPSG:6.18:3:3857,\n * http://www.opengis.net/gml/srs/epsg.xml#3857\n *\n * If you use [proj4js](https://github.com/proj4js/proj4js), aliases can\n * be added using `proj4.defs()`. After all required projection definitions are\n * added, call the {@link module:ol/proj/proj4.register} function.\n *\n * @api\n */\nvar Projection = /** @class */ (function () {\n /**\n * @param {Options} options Projection options.\n */\n function Projection(options) {\n /**\n * @private\n * @type {string}\n */\n this.code_ = options.code;\n /**\n * Units of projected coordinates. When set to `TILE_PIXELS`, a\n * `this.extent_` and `this.worldExtent_` must be configured properly for each\n * tile.\n * @private\n * @type {import(\"./Units.js\").default}\n */\n this.units_ = /** @type {import(\"./Units.js\").default} */ (options.units);\n /**\n * Validity extent of the projection in projected coordinates. For projections\n * with `TILE_PIXELS` units, this is the extent of the tile in\n * tile pixel space.\n * @private\n * @type {import(\"../extent.js\").Extent}\n */\n this.extent_ = options.extent !== undefined ? options.extent : null;\n /**\n * Extent of the world in EPSG:4326. For projections with\n * `TILE_PIXELS` units, this is the extent of the tile in\n * projected coordinate space.\n * @private\n * @type {import(\"../extent.js\").Extent}\n */\n this.worldExtent_ =\n options.worldExtent !== undefined ? options.worldExtent : null;\n /**\n * @private\n * @type {string}\n */\n this.axisOrientation_ =\n options.axisOrientation !== undefined ? options.axisOrientation : 'enu';\n /**\n * @private\n * @type {boolean}\n */\n this.global_ = options.global !== undefined ? options.global : false;\n /**\n * @private\n * @type {boolean}\n */\n this.canWrapX_ = !!(this.global_ && this.extent_);\n /**\n * @private\n * @type {function(number, import(\"../coordinate.js\").Coordinate):number|undefined}\n */\n this.getPointResolutionFunc_ = options.getPointResolution;\n /**\n * @private\n * @type {import(\"../tilegrid/TileGrid.js\").default}\n */\n this.defaultTileGrid_ = null;\n /**\n * @private\n * @type {number|undefined}\n */\n this.metersPerUnit_ = options.metersPerUnit;\n }\n /**\n * @return {boolean} The projection is suitable for wrapping the x-axis\n */\n Projection.prototype.canWrapX = function () {\n return this.canWrapX_;\n };\n /**\n * Get the code for this projection, e.g. 'EPSG:4326'.\n * @return {string} Code.\n * @api\n */\n Projection.prototype.getCode = function () {\n return this.code_;\n };\n /**\n * Get the validity extent for this projection.\n * @return {import(\"../extent.js\").Extent} Extent.\n * @api\n */\n Projection.prototype.getExtent = function () {\n return this.extent_;\n };\n /**\n * Get the units of this projection.\n * @return {import(\"./Units.js\").default} Units.\n * @api\n */\n Projection.prototype.getUnits = function () {\n return this.units_;\n };\n /**\n * Get the amount of meters per unit of this projection. If the projection is\n * not configured with `metersPerUnit` or a units identifier, the return is\n * `undefined`.\n * @return {number|undefined} Meters.\n * @api\n */\n Projection.prototype.getMetersPerUnit = function () {\n return this.metersPerUnit_ || METERS_PER_UNIT[this.units_];\n };\n /**\n * Get the world extent for this projection.\n * @return {import(\"../extent.js\").Extent} Extent.\n * @api\n */\n Projection.prototype.getWorldExtent = function () {\n return this.worldExtent_;\n };\n /**\n * Get the axis orientation of this projection.\n * Example values are:\n * enu - the default easting, northing, elevation.\n * neu - northing, easting, up - useful for \"lat/long\" geographic coordinates,\n * or south orientated transverse mercator.\n * wnu - westing, northing, up - some planetary coordinate systems have\n * \"west positive\" coordinate systems\n * @return {string} Axis orientation.\n * @api\n */\n Projection.prototype.getAxisOrientation = function () {\n return this.axisOrientation_;\n };\n /**\n * Is this projection a global projection which spans the whole world?\n * @return {boolean} Whether the projection is global.\n * @api\n */\n Projection.prototype.isGlobal = function () {\n return this.global_;\n };\n /**\n * Set if the projection is a global projection which spans the whole world\n * @param {boolean} global Whether the projection is global.\n * @api\n */\n Projection.prototype.setGlobal = function (global) {\n this.global_ = global;\n this.canWrapX_ = !!(global && this.extent_);\n };\n /**\n * @return {import(\"../tilegrid/TileGrid.js\").default} The default tile grid.\n */\n Projection.prototype.getDefaultTileGrid = function () {\n return this.defaultTileGrid_;\n };\n /**\n * @param {import(\"../tilegrid/TileGrid.js\").default} tileGrid The default tile grid.\n */\n Projection.prototype.setDefaultTileGrid = function (tileGrid) {\n this.defaultTileGrid_ = tileGrid;\n };\n /**\n * Set the validity extent for this projection.\n * @param {import(\"../extent.js\").Extent} extent Extent.\n * @api\n */\n Projection.prototype.setExtent = function (extent) {\n this.extent_ = extent;\n this.canWrapX_ = !!(this.global_ && extent);\n };\n /**\n * Set the world extent for this projection.\n * @param {import(\"../extent.js\").Extent} worldExtent World extent\n * [minlon, minlat, maxlon, maxlat].\n * @api\n */\n Projection.prototype.setWorldExtent = function (worldExtent) {\n this.worldExtent_ = worldExtent;\n };\n /**\n * Set the getPointResolution function (see {@link module:ol/proj.getPointResolution}\n * for this projection.\n * @param {function(number, import(\"../coordinate.js\").Coordinate):number} func Function\n * @api\n */\n Projection.prototype.setGetPointResolution = function (func) {\n this.getPointResolutionFunc_ = func;\n };\n /**\n * Get the custom point resolution function for this projection (if set).\n * @return {function(number, import(\"../coordinate.js\").Coordinate):number|undefined} The custom point\n * resolution function (if set).\n */\n Projection.prototype.getPointResolutionFunc = function () {\n return this.getPointResolutionFunc_;\n };\n return Projection;\n}());\nexport default Projection;\n//# sourceMappingURL=Projection.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/proj/epsg3857\n */\nimport Projection from './Projection.js';\nimport Units from './Units.js';\nimport { cosh } from '../math.js';\n/**\n * Radius of WGS84 sphere\n *\n * @const\n * @type {number}\n */\nexport var RADIUS = 6378137;\n/**\n * @const\n * @type {number}\n */\nexport var HALF_SIZE = Math.PI * RADIUS;\n/**\n * @const\n * @type {import(\"../extent.js\").Extent}\n */\nexport var EXTENT = [-HALF_SIZE, -HALF_SIZE, HALF_SIZE, HALF_SIZE];\n/**\n * @const\n * @type {import(\"../extent.js\").Extent}\n */\nexport var WORLD_EXTENT = [-180, -85, 180, 85];\n/**\n * Maximum safe value in y direction\n * @const\n * @type {number}\n */\nexport var MAX_SAFE_Y = RADIUS * Math.log(Math.tan(Math.PI / 2));\n/**\n * @classdesc\n * Projection object for web/spherical Mercator (EPSG:3857).\n */\nvar EPSG3857Projection = /** @class */ (function (_super) {\n __extends(EPSG3857Projection, _super);\n /**\n * @param {string} code Code.\n */\n function EPSG3857Projection(code) {\n return _super.call(this, {\n code: code,\n units: Units.METERS,\n extent: EXTENT,\n global: true,\n worldExtent: WORLD_EXTENT,\n getPointResolution: function (resolution, point) {\n return resolution / cosh(point[1] / RADIUS);\n },\n }) || this;\n }\n return EPSG3857Projection;\n}(Projection));\n/**\n * Projections equal to EPSG:3857.\n *\n * @const\n * @type {Array}\n */\nexport var PROJECTIONS = [\n new EPSG3857Projection('EPSG:3857'),\n new EPSG3857Projection('EPSG:102100'),\n new EPSG3857Projection('EPSG:102113'),\n new EPSG3857Projection('EPSG:900913'),\n new EPSG3857Projection('http://www.opengis.net/def/crs/EPSG/0/3857'),\n new EPSG3857Projection('http://www.opengis.net/gml/srs/epsg.xml#3857'),\n];\n/**\n * Transformation from EPSG:4326 to EPSG:3857.\n *\n * @param {Array} input Input array of coordinate values.\n * @param {Array} [opt_output] Output array of coordinate values.\n * @param {number} [opt_dimension] Dimension (default is `2`).\n * @return {Array} Output array of coordinate values.\n */\nexport function fromEPSG4326(input, opt_output, opt_dimension) {\n var length = input.length;\n var dimension = opt_dimension > 1 ? opt_dimension : 2;\n var output = opt_output;\n if (output === undefined) {\n if (dimension > 2) {\n // preserve values beyond second dimension\n output = input.slice();\n }\n else {\n output = new Array(length);\n }\n }\n for (var i = 0; i < length; i += dimension) {\n output[i] = (HALF_SIZE * input[i]) / 180;\n var y = RADIUS * Math.log(Math.tan((Math.PI * (+input[i + 1] + 90)) / 360));\n if (y > MAX_SAFE_Y) {\n y = MAX_SAFE_Y;\n }\n else if (y < -MAX_SAFE_Y) {\n y = -MAX_SAFE_Y;\n }\n output[i + 1] = y;\n }\n return output;\n}\n/**\n * Transformation from EPSG:3857 to EPSG:4326.\n *\n * @param {Array} input Input array of coordinate values.\n * @param {Array} [opt_output] Output array of coordinate values.\n * @param {number} [opt_dimension] Dimension (default is `2`).\n * @return {Array} Output array of coordinate values.\n */\nexport function toEPSG4326(input, opt_output, opt_dimension) {\n var length = input.length;\n var dimension = opt_dimension > 1 ? opt_dimension : 2;\n var output = opt_output;\n if (output === undefined) {\n if (dimension > 2) {\n // preserve values beyond second dimension\n output = input.slice();\n }\n else {\n output = new Array(length);\n }\n }\n for (var i = 0; i < length; i += dimension) {\n output[i] = (180 * input[i]) / HALF_SIZE;\n output[i + 1] =\n (360 * Math.atan(Math.exp(input[i + 1] / RADIUS))) / Math.PI - 90;\n }\n return output;\n}\n//# sourceMappingURL=epsg3857.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/proj/epsg4326\n */\nimport Projection from './Projection.js';\nimport Units from './Units.js';\n/**\n * Semi-major radius of the WGS84 ellipsoid.\n *\n * @const\n * @type {number}\n */\nexport var RADIUS = 6378137;\n/**\n * Extent of the EPSG:4326 projection which is the whole world.\n *\n * @const\n * @type {import(\"../extent.js\").Extent}\n */\nexport var EXTENT = [-180, -90, 180, 90];\n/**\n * @const\n * @type {number}\n */\nexport var METERS_PER_UNIT = (Math.PI * RADIUS) / 180;\n/**\n * @classdesc\n * Projection object for WGS84 geographic coordinates (EPSG:4326).\n *\n * Note that OpenLayers does not strictly comply with the EPSG definition.\n * The EPSG registry defines 4326 as a CRS for Latitude,Longitude (y,x).\n * OpenLayers treats EPSG:4326 as a pseudo-projection, with x,y coordinates.\n */\nvar EPSG4326Projection = /** @class */ (function (_super) {\n __extends(EPSG4326Projection, _super);\n /**\n * @param {string} code Code.\n * @param {string} [opt_axisOrientation] Axis orientation.\n */\n function EPSG4326Projection(code, opt_axisOrientation) {\n return _super.call(this, {\n code: code,\n units: Units.DEGREES,\n extent: EXTENT,\n axisOrientation: opt_axisOrientation,\n global: true,\n metersPerUnit: METERS_PER_UNIT,\n worldExtent: EXTENT,\n }) || this;\n }\n return EPSG4326Projection;\n}(Projection));\n/**\n * Projections equal to EPSG:4326.\n *\n * @const\n * @type {Array}\n */\nexport var PROJECTIONS = [\n new EPSG4326Projection('CRS:84'),\n new EPSG4326Projection('EPSG:4326', 'neu'),\n new EPSG4326Projection('urn:ogc:def:crs:OGC:1.3:CRS84'),\n new EPSG4326Projection('urn:ogc:def:crs:OGC:2:84'),\n new EPSG4326Projection('http://www.opengis.net/def/crs/OGC/1.3/CRS84', 'neu'),\n new EPSG4326Projection('http://www.opengis.net/gml/srs/epsg.xml#4326', 'neu'),\n new EPSG4326Projection('http://www.opengis.net/def/crs/EPSG/0/4326', 'neu'),\n];\n//# sourceMappingURL=epsg4326.js.map","/**\n * @module ol/proj/projections\n */\n/**\n * @type {Object}\n */\nvar cache = {};\n/**\n * Clear the projections cache.\n */\nexport function clear() {\n cache = {};\n}\n/**\n * Get a cached projection by code.\n * @param {string} code The code for the projection.\n * @return {import(\"./Projection.js\").default} The projection (if cached).\n */\nexport function get(code) {\n return (cache[code] ||\n cache[code.replace(/urn:(x-)?ogc:def:crs:EPSG:(.*:)?(\\w+)$/, 'EPSG:$3')] ||\n null);\n}\n/**\n * Add a projection to the cache.\n * @param {string} code The projection code.\n * @param {import(\"./Projection.js\").default} projection The projection to cache.\n */\nexport function add(code, projection) {\n cache[code] = projection;\n}\n//# sourceMappingURL=projections.js.map","/**\n * @module ol/proj/transforms\n */\nimport { isEmpty } from '../obj.js';\n/**\n * @private\n * @type {!Object>}\n */\nvar transforms = {};\n/**\n * Clear the transform cache.\n */\nexport function clear() {\n transforms = {};\n}\n/**\n * Registers a conversion function to convert coordinates from the source\n * projection to the destination projection.\n *\n * @param {import(\"./Projection.js\").default} source Source.\n * @param {import(\"./Projection.js\").default} destination Destination.\n * @param {import(\"../proj.js\").TransformFunction} transformFn Transform.\n */\nexport function add(source, destination, transformFn) {\n var sourceCode = source.getCode();\n var destinationCode = destination.getCode();\n if (!(sourceCode in transforms)) {\n transforms[sourceCode] = {};\n }\n transforms[sourceCode][destinationCode] = transformFn;\n}\n/**\n * Unregisters the conversion function to convert coordinates from the source\n * projection to the destination projection. This method is used to clean up\n * cached transforms during testing.\n *\n * @param {import(\"./Projection.js\").default} source Source projection.\n * @param {import(\"./Projection.js\").default} destination Destination projection.\n * @return {import(\"../proj.js\").TransformFunction} transformFn The unregistered transform.\n */\nexport function remove(source, destination) {\n var sourceCode = source.getCode();\n var destinationCode = destination.getCode();\n var transform = transforms[sourceCode][destinationCode];\n delete transforms[sourceCode][destinationCode];\n if (isEmpty(transforms[sourceCode])) {\n delete transforms[sourceCode];\n }\n return transform;\n}\n/**\n * Get a transform given a source code and a destination code.\n * @param {string} sourceCode The code for the source projection.\n * @param {string} destinationCode The code for the destination projection.\n * @return {import(\"../proj.js\").TransformFunction|undefined} The transform function (if found).\n */\nexport function get(sourceCode, destinationCode) {\n var transform;\n if (sourceCode in transforms && destinationCode in transforms[sourceCode]) {\n transform = transforms[sourceCode][destinationCode];\n }\n return transform;\n}\n//# sourceMappingURL=transforms.js.map","/**\n * @module ol/sphere\n */\nimport GeometryType from './geom/GeometryType.js';\nimport { toDegrees, toRadians } from './math.js';\n/**\n * Object literal with options for the {@link getLength} or {@link getArea}\n * functions.\n * @typedef {Object} SphereMetricOptions\n * @property {import(\"./proj.js\").ProjectionLike} [projection='EPSG:3857']\n * Projection of the geometry. By default, the geometry is assumed to be in\n * Web Mercator.\n * @property {number} [radius=6371008.8] Sphere radius. By default, the\n * [mean Earth radius](https://en.wikipedia.org/wiki/Earth_radius#Mean_radius)\n * for the WGS84 ellipsoid is used.\n */\n/**\n * The mean Earth radius (1/3 * (2a + b)) for the WGS84 ellipsoid.\n * https://en.wikipedia.org/wiki/Earth_radius#Mean_radius\n * @type {number}\n */\nexport var DEFAULT_RADIUS = 6371008.8;\n/**\n * Get the great circle distance (in meters) between two geographic coordinates.\n * @param {Array} c1 Starting coordinate.\n * @param {Array} c2 Ending coordinate.\n * @param {number} [opt_radius] The sphere radius to use. Defaults to the Earth's\n * mean radius using the WGS84 ellipsoid.\n * @return {number} The great circle distance between the points (in meters).\n * @api\n */\nexport function getDistance(c1, c2, opt_radius) {\n var radius = opt_radius || DEFAULT_RADIUS;\n var lat1 = toRadians(c1[1]);\n var lat2 = toRadians(c2[1]);\n var deltaLatBy2 = (lat2 - lat1) / 2;\n var deltaLonBy2 = toRadians(c2[0] - c1[0]) / 2;\n var a = Math.sin(deltaLatBy2) * Math.sin(deltaLatBy2) +\n Math.sin(deltaLonBy2) *\n Math.sin(deltaLonBy2) *\n Math.cos(lat1) *\n Math.cos(lat2);\n return 2 * radius * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n}\n/**\n * Get the cumulative great circle length of linestring coordinates (geographic).\n * @param {Array} coordinates Linestring coordinates.\n * @param {number} radius The sphere radius to use.\n * @return {number} The length (in meters).\n */\nfunction getLengthInternal(coordinates, radius) {\n var length = 0;\n for (var i = 0, ii = coordinates.length; i < ii - 1; ++i) {\n length += getDistance(coordinates[i], coordinates[i + 1], radius);\n }\n return length;\n}\n/**\n * Get the spherical length of a geometry. This length is the sum of the\n * great circle distances between coordinates. For polygons, the length is\n * the sum of all rings. For points, the length is zero. For multi-part\n * geometries, the length is the sum of the length of each part.\n * @param {import(\"./geom/Geometry.js\").default} geometry A geometry.\n * @param {SphereMetricOptions} [opt_options] Options for the\n * length calculation. By default, geometries are assumed to be in 'EPSG:3857'.\n * You can change this by providing a `projection` option.\n * @return {number} The spherical length (in meters).\n * @api\n */\nexport function getLength(geometry, opt_options) {\n var options = opt_options || {};\n var radius = options.radius || DEFAULT_RADIUS;\n var projection = options.projection || 'EPSG:3857';\n var type = geometry.getType();\n if (type !== GeometryType.GEOMETRY_COLLECTION) {\n geometry = geometry.clone().transform(projection, 'EPSG:4326');\n }\n var length = 0;\n var coordinates, coords, i, ii, j, jj;\n switch (type) {\n case GeometryType.POINT:\n case GeometryType.MULTI_POINT: {\n break;\n }\n case GeometryType.LINE_STRING:\n case GeometryType.LINEAR_RING: {\n coordinates = /** @type {import(\"./geom/SimpleGeometry.js\").default} */ (geometry).getCoordinates();\n length = getLengthInternal(coordinates, radius);\n break;\n }\n case GeometryType.MULTI_LINE_STRING:\n case GeometryType.POLYGON: {\n coordinates = /** @type {import(\"./geom/SimpleGeometry.js\").default} */ (geometry).getCoordinates();\n for (i = 0, ii = coordinates.length; i < ii; ++i) {\n length += getLengthInternal(coordinates[i], radius);\n }\n break;\n }\n case GeometryType.MULTI_POLYGON: {\n coordinates = /** @type {import(\"./geom/SimpleGeometry.js\").default} */ (geometry).getCoordinates();\n for (i = 0, ii = coordinates.length; i < ii; ++i) {\n coords = coordinates[i];\n for (j = 0, jj = coords.length; j < jj; ++j) {\n length += getLengthInternal(coords[j], radius);\n }\n }\n break;\n }\n case GeometryType.GEOMETRY_COLLECTION: {\n var geometries = \n /** @type {import(\"./geom/GeometryCollection.js\").default} */ (geometry).getGeometries();\n for (i = 0, ii = geometries.length; i < ii; ++i) {\n length += getLength(geometries[i], opt_options);\n }\n break;\n }\n default: {\n throw new Error('Unsupported geometry type: ' + type);\n }\n }\n return length;\n}\n/**\n * Returns the spherical area for a list of coordinates.\n *\n * [Reference](https://trs.jpl.nasa.gov/handle/2014/40409)\n * Robert. G. Chamberlain and William H. Duquette, \"Some Algorithms for\n * Polygons on a Sphere\", JPL Publication 07-03, Jet Propulsion\n * Laboratory, Pasadena, CA, June 2007\n *\n * @param {Array} coordinates List of coordinates of a linear\n * ring. If the ring is oriented clockwise, the area will be positive,\n * otherwise it will be negative.\n * @param {number} radius The sphere radius.\n * @return {number} Area (in square meters).\n */\nfunction getAreaInternal(coordinates, radius) {\n var area = 0;\n var len = coordinates.length;\n var x1 = coordinates[len - 1][0];\n var y1 = coordinates[len - 1][1];\n for (var i = 0; i < len; i++) {\n var x2 = coordinates[i][0];\n var y2 = coordinates[i][1];\n area +=\n toRadians(x2 - x1) *\n (2 + Math.sin(toRadians(y1)) + Math.sin(toRadians(y2)));\n x1 = x2;\n y1 = y2;\n }\n return (area * radius * radius) / 2.0;\n}\n/**\n * Get the spherical area of a geometry. This is the area (in meters) assuming\n * that polygon edges are segments of great circles on a sphere.\n * @param {import(\"./geom/Geometry.js\").default} geometry A geometry.\n * @param {SphereMetricOptions} [opt_options] Options for the area\n * calculation. By default, geometries are assumed to be in 'EPSG:3857'.\n * You can change this by providing a `projection` option.\n * @return {number} The spherical area (in square meters).\n * @api\n */\nexport function getArea(geometry, opt_options) {\n var options = opt_options || {};\n var radius = options.radius || DEFAULT_RADIUS;\n var projection = options.projection || 'EPSG:3857';\n var type = geometry.getType();\n if (type !== GeometryType.GEOMETRY_COLLECTION) {\n geometry = geometry.clone().transform(projection, 'EPSG:4326');\n }\n var area = 0;\n var coordinates, coords, i, ii, j, jj;\n switch (type) {\n case GeometryType.POINT:\n case GeometryType.MULTI_POINT:\n case GeometryType.LINE_STRING:\n case GeometryType.MULTI_LINE_STRING:\n case GeometryType.LINEAR_RING: {\n break;\n }\n case GeometryType.POLYGON: {\n coordinates = /** @type {import(\"./geom/Polygon.js\").default} */ (geometry).getCoordinates();\n area = Math.abs(getAreaInternal(coordinates[0], radius));\n for (i = 1, ii = coordinates.length; i < ii; ++i) {\n area -= Math.abs(getAreaInternal(coordinates[i], radius));\n }\n break;\n }\n case GeometryType.MULTI_POLYGON: {\n coordinates = /** @type {import(\"./geom/SimpleGeometry.js\").default} */ (geometry).getCoordinates();\n for (i = 0, ii = coordinates.length; i < ii; ++i) {\n coords = coordinates[i];\n area += Math.abs(getAreaInternal(coords[0], radius));\n for (j = 1, jj = coords.length; j < jj; ++j) {\n area -= Math.abs(getAreaInternal(coords[j], radius));\n }\n }\n break;\n }\n case GeometryType.GEOMETRY_COLLECTION: {\n var geometries = \n /** @type {import(\"./geom/GeometryCollection.js\").default} */ (geometry).getGeometries();\n for (i = 0, ii = geometries.length; i < ii; ++i) {\n area += getArea(geometries[i], opt_options);\n }\n break;\n }\n default: {\n throw new Error('Unsupported geometry type: ' + type);\n }\n }\n return area;\n}\n/**\n * Returns the coordinate at the given distance and bearing from `c1`.\n *\n * @param {import(\"./coordinate.js\").Coordinate} c1 The origin point (`[lon, lat]` in degrees).\n * @param {number} distance The great-circle distance between the origin\n * point and the target point.\n * @param {number} bearing The bearing (in radians).\n * @param {number} [opt_radius] The sphere radius to use. Defaults to the Earth's\n * mean radius using the WGS84 ellipsoid.\n * @return {import(\"./coordinate.js\").Coordinate} The target point.\n */\nexport function offset(c1, distance, bearing, opt_radius) {\n var radius = opt_radius || DEFAULT_RADIUS;\n var lat1 = toRadians(c1[1]);\n var lon1 = toRadians(c1[0]);\n var dByR = distance / radius;\n var lat = Math.asin(Math.sin(lat1) * Math.cos(dByR) +\n Math.cos(lat1) * Math.sin(dByR) * Math.cos(bearing));\n var lon = lon1 +\n Math.atan2(Math.sin(bearing) * Math.sin(dByR) * Math.cos(lat1), Math.cos(dByR) - Math.sin(lat1) * Math.sin(lat));\n return [toDegrees(lon), toDegrees(lat)];\n}\n//# sourceMappingURL=sphere.js.map","/**\n * @module ol/proj\n */\n/**\n * The ol/proj module stores:\n * * a list of {@link module:ol/proj/Projection}\n * objects, one for each projection supported by the application\n * * a list of transform functions needed to convert coordinates in one projection\n * into another.\n *\n * The static functions are the methods used to maintain these.\n * Each transform function can handle not only simple coordinate pairs, but also\n * large arrays of coordinates such as vector geometries.\n *\n * When loaded, the library adds projection objects for EPSG:4326 (WGS84\n * geographic coordinates) and EPSG:3857 (Web or Spherical Mercator, as used\n * for example by Bing Maps or OpenStreetMap), together with the relevant\n * transform functions.\n *\n * Additional transforms may be added by using the http://proj4js.org/\n * library (version 2.2 or later). You can use the full build supplied by\n * Proj4js, or create a custom build to support those projections you need; see\n * the Proj4js website for how to do this. You also need the Proj4js definitions\n * for the required projections. These definitions can be obtained from\n * https://epsg.io/, and are a JS function, so can be loaded in a script\n * tag (as in the examples) or pasted into your application.\n *\n * After all required projection definitions are added to proj4's registry (by\n * using `proj4.defs()`), simply call `register(proj4)` from the `ol/proj/proj4`\n * package. Existing transforms are not changed by this function. See\n * examples/wms-image-custom-proj for an example of this.\n *\n * Additional projection definitions can be registered with `proj4.defs()` any\n * time. Just make sure to call `register(proj4)` again; for example, with user-supplied data where you don't\n * know in advance what projections are needed, you can initially load minimal\n * support and then load whichever are requested.\n *\n * Note that Proj4js does not support projection extents. If you want to add\n * one for creating default tile grids, you can add it after the Projection\n * object has been created with `setExtent`, for example,\n * `get('EPSG:1234').setExtent(extent)`.\n *\n * In addition to Proj4js support, any transform functions can be added with\n * {@link module:ol/proj.addCoordinateTransforms}. To use this, you must first create\n * a {@link module:ol/proj/Projection} object for the new projection and add it with\n * {@link module:ol/proj.addProjection}. You can then add the forward and inverse\n * functions with {@link module:ol/proj.addCoordinateTransforms}. See\n * examples/wms-custom-proj for an example of this.\n *\n * Note that if no transforms are needed and you only need to define the\n * projection, just add a {@link module:ol/proj/Projection} with\n * {@link module:ol/proj.addProjection}. See examples/wms-no-proj for an example of\n * this.\n */\nimport Projection from './proj/Projection.js';\nimport Units, { METERS_PER_UNIT } from './proj/Units.js';\nimport { PROJECTIONS as EPSG3857_PROJECTIONS, fromEPSG4326, toEPSG4326, } from './proj/epsg3857.js';\nimport { PROJECTIONS as EPSG4326_PROJECTIONS } from './proj/epsg4326.js';\nimport { add as addProj, clear as clearProj, get as getProj, } from './proj/projections.js';\nimport { add as addTransformFunc, clear as clearTransformFuncs, get as getTransformFunc, } from './proj/transforms.js';\nimport { applyTransform, getWidth } from './extent.js';\nimport { clamp, modulo } from './math.js';\nimport { getDistance } from './sphere.js';\nimport { getWorldsAway } from './coordinate.js';\n/**\n * A projection as {@link module:ol/proj/Projection}, SRS identifier\n * string or undefined.\n * @typedef {Projection|string|undefined} ProjectionLike\n * @api\n */\n/**\n * A transform function accepts an array of input coordinate values, an optional\n * output array, and an optional dimension (default should be 2). The function\n * transforms the input coordinate values, populates the output array, and\n * returns the output array.\n *\n * @typedef {function(Array, Array=, number=): Array} TransformFunction\n * @api\n */\nexport { METERS_PER_UNIT };\nexport { Projection };\n/**\n * @param {Array} input Input coordinate array.\n * @param {Array} [opt_output] Output array of coordinate values.\n * @param {number} [opt_dimension] Dimension.\n * @return {Array} Output coordinate array (new array, same coordinate\n * values).\n */\nexport function cloneTransform(input, opt_output, opt_dimension) {\n var output;\n if (opt_output !== undefined) {\n for (var i = 0, ii = input.length; i < ii; ++i) {\n opt_output[i] = input[i];\n }\n output = opt_output;\n }\n else {\n output = input.slice();\n }\n return output;\n}\n/**\n * @param {Array} input Input coordinate array.\n * @param {Array} [opt_output] Output array of coordinate values.\n * @param {number} [opt_dimension] Dimension.\n * @return {Array} Input coordinate array (same array as input).\n */\nexport function identityTransform(input, opt_output, opt_dimension) {\n if (opt_output !== undefined && input !== opt_output) {\n for (var i = 0, ii = input.length; i < ii; ++i) {\n opt_output[i] = input[i];\n }\n input = opt_output;\n }\n return input;\n}\n/**\n * Add a Projection object to the list of supported projections that can be\n * looked up by their code.\n *\n * @param {Projection} projection Projection instance.\n * @api\n */\nexport function addProjection(projection) {\n addProj(projection.getCode(), projection);\n addTransformFunc(projection, projection, cloneTransform);\n}\n/**\n * @param {Array} projections Projections.\n */\nexport function addProjections(projections) {\n projections.forEach(addProjection);\n}\n/**\n * Fetches a Projection object for the code specified.\n *\n * @param {ProjectionLike} projectionLike Either a code string which is\n * a combination of authority and identifier such as \"EPSG:4326\", or an\n * existing projection object, or undefined.\n * @return {Projection} Projection object, or null if not in list.\n * @api\n */\nexport function get(projectionLike) {\n return typeof projectionLike === 'string'\n ? getProj(/** @type {string} */ (projectionLike))\n : /** @type {Projection} */ (projectionLike) || null;\n}\n/**\n * Get the resolution of the point in degrees or distance units.\n * For projections with degrees as the unit this will simply return the\n * provided resolution. For other projections the point resolution is\n * by default estimated by transforming the 'point' pixel to EPSG:4326,\n * measuring its width and height on the normal sphere,\n * and taking the average of the width and height.\n * A custom function can be provided for a specific projection, either\n * by setting the `getPointResolution` option in the\n * {@link module:ol/proj/Projection~Projection} constructor or by using\n * {@link module:ol/proj/Projection~Projection#setGetPointResolution} to change an existing\n * projection object.\n * @param {ProjectionLike} projection The projection.\n * @param {number} resolution Nominal resolution in projection units.\n * @param {import(\"./coordinate.js\").Coordinate} point Point to find adjusted resolution at.\n * @param {import(\"./proj/Units.js\").default} [opt_units] Units to get the point resolution in.\n * Default is the projection's units.\n * @return {number} Point resolution.\n * @api\n */\nexport function getPointResolution(projection, resolution, point, opt_units) {\n projection = get(projection);\n var pointResolution;\n var getter = projection.getPointResolutionFunc();\n if (getter) {\n pointResolution = getter(resolution, point);\n if (opt_units && opt_units !== projection.getUnits()) {\n var metersPerUnit = projection.getMetersPerUnit();\n if (metersPerUnit) {\n pointResolution =\n (pointResolution * metersPerUnit) / METERS_PER_UNIT[opt_units];\n }\n }\n }\n else {\n var units = projection.getUnits();\n if ((units == Units.DEGREES && !opt_units) || opt_units == Units.DEGREES) {\n pointResolution = resolution;\n }\n else {\n // Estimate point resolution by transforming the center pixel to EPSG:4326,\n // measuring its width and height on the normal sphere, and taking the\n // average of the width and height.\n var toEPSG4326_1 = getTransformFromProjections(projection, get('EPSG:4326'));\n if (toEPSG4326_1 === identityTransform && units !== Units.DEGREES) {\n // no transform is available\n pointResolution = resolution * projection.getMetersPerUnit();\n }\n else {\n var vertices = [\n point[0] - resolution / 2,\n point[1],\n point[0] + resolution / 2,\n point[1],\n point[0],\n point[1] - resolution / 2,\n point[0],\n point[1] + resolution / 2,\n ];\n vertices = toEPSG4326_1(vertices, vertices, 2);\n var width = getDistance(vertices.slice(0, 2), vertices.slice(2, 4));\n var height = getDistance(vertices.slice(4, 6), vertices.slice(6, 8));\n pointResolution = (width + height) / 2;\n }\n var metersPerUnit = opt_units\n ? METERS_PER_UNIT[opt_units]\n : projection.getMetersPerUnit();\n if (metersPerUnit !== undefined) {\n pointResolution /= metersPerUnit;\n }\n }\n }\n return pointResolution;\n}\n/**\n * Registers transformation functions that don't alter coordinates. Those allow\n * to transform between projections with equal meaning.\n *\n * @param {Array} projections Projections.\n * @api\n */\nexport function addEquivalentProjections(projections) {\n addProjections(projections);\n projections.forEach(function (source) {\n projections.forEach(function (destination) {\n if (source !== destination) {\n addTransformFunc(source, destination, cloneTransform);\n }\n });\n });\n}\n/**\n * Registers transformation functions to convert coordinates in any projection\n * in projection1 to any projection in projection2.\n *\n * @param {Array} projections1 Projections with equal\n * meaning.\n * @param {Array} projections2 Projections with equal\n * meaning.\n * @param {TransformFunction} forwardTransform Transformation from any\n * projection in projection1 to any projection in projection2.\n * @param {TransformFunction} inverseTransform Transform from any projection\n * in projection2 to any projection in projection1..\n */\nexport function addEquivalentTransforms(projections1, projections2, forwardTransform, inverseTransform) {\n projections1.forEach(function (projection1) {\n projections2.forEach(function (projection2) {\n addTransformFunc(projection1, projection2, forwardTransform);\n addTransformFunc(projection2, projection1, inverseTransform);\n });\n });\n}\n/**\n * Clear all cached projections and transforms.\n */\nexport function clearAllProjections() {\n clearProj();\n clearTransformFuncs();\n}\n/**\n * @param {Projection|string|undefined} projection Projection.\n * @param {string} defaultCode Default code.\n * @return {Projection} Projection.\n */\nexport function createProjection(projection, defaultCode) {\n if (!projection) {\n return get(defaultCode);\n }\n else if (typeof projection === 'string') {\n return get(projection);\n }\n else {\n return /** @type {Projection} */ (projection);\n }\n}\n/**\n * Creates a {@link module:ol/proj~TransformFunction} from a simple 2D coordinate transform\n * function.\n * @param {function(import(\"./coordinate.js\").Coordinate): import(\"./coordinate.js\").Coordinate} coordTransform Coordinate\n * transform.\n * @return {TransformFunction} Transform function.\n */\nexport function createTransformFromCoordinateTransform(coordTransform) {\n return (\n /**\n * @param {Array} input Input.\n * @param {Array} [opt_output] Output.\n * @param {number} [opt_dimension] Dimension.\n * @return {Array} Output.\n */\n function (input, opt_output, opt_dimension) {\n var length = input.length;\n var dimension = opt_dimension !== undefined ? opt_dimension : 2;\n var output = opt_output !== undefined ? opt_output : new Array(length);\n for (var i = 0; i < length; i += dimension) {\n var point = coordTransform([input[i], input[i + 1]]);\n output[i] = point[0];\n output[i + 1] = point[1];\n for (var j = dimension - 1; j >= 2; --j) {\n output[i + j] = input[i + j];\n }\n }\n return output;\n });\n}\n/**\n * Registers coordinate transform functions to convert coordinates between the\n * source projection and the destination projection.\n * The forward and inverse functions convert coordinate pairs; this function\n * converts these into the functions used internally which also handle\n * extents and coordinate arrays.\n *\n * @param {ProjectionLike} source Source projection.\n * @param {ProjectionLike} destination Destination projection.\n * @param {function(import(\"./coordinate.js\").Coordinate): import(\"./coordinate.js\").Coordinate} forward The forward transform\n * function (that is, from the source projection to the destination\n * projection) that takes a {@link module:ol/coordinate~Coordinate} as argument and returns\n * the transformed {@link module:ol/coordinate~Coordinate}.\n * @param {function(import(\"./coordinate.js\").Coordinate): import(\"./coordinate.js\").Coordinate} inverse The inverse transform\n * function (that is, from the destination projection to the source\n * projection) that takes a {@link module:ol/coordinate~Coordinate} as argument and returns\n * the transformed {@link module:ol/coordinate~Coordinate}.\n * @api\n */\nexport function addCoordinateTransforms(source, destination, forward, inverse) {\n var sourceProj = get(source);\n var destProj = get(destination);\n addTransformFunc(sourceProj, destProj, createTransformFromCoordinateTransform(forward));\n addTransformFunc(destProj, sourceProj, createTransformFromCoordinateTransform(inverse));\n}\n/**\n * Transforms a coordinate from longitude/latitude to a different projection.\n * @param {import(\"./coordinate.js\").Coordinate} coordinate Coordinate as longitude and latitude, i.e.\n * an array with longitude as 1st and latitude as 2nd element.\n * @param {ProjectionLike} [opt_projection] Target projection. The\n * default is Web Mercator, i.e. 'EPSG:3857'.\n * @return {import(\"./coordinate.js\").Coordinate} Coordinate projected to the target projection.\n * @api\n */\nexport function fromLonLat(coordinate, opt_projection) {\n return transform(coordinate, 'EPSG:4326', opt_projection !== undefined ? opt_projection : 'EPSG:3857');\n}\n/**\n * Transforms a coordinate to longitude/latitude.\n * @param {import(\"./coordinate.js\").Coordinate} coordinate Projected coordinate.\n * @param {ProjectionLike} [opt_projection] Projection of the coordinate.\n * The default is Web Mercator, i.e. 'EPSG:3857'.\n * @return {import(\"./coordinate.js\").Coordinate} Coordinate as longitude and latitude, i.e. an array\n * with longitude as 1st and latitude as 2nd element.\n * @api\n */\nexport function toLonLat(coordinate, opt_projection) {\n var lonLat = transform(coordinate, opt_projection !== undefined ? opt_projection : 'EPSG:3857', 'EPSG:4326');\n var lon = lonLat[0];\n if (lon < -180 || lon > 180) {\n lonLat[0] = modulo(lon + 180, 360) - 180;\n }\n return lonLat;\n}\n/**\n * Checks if two projections are the same, that is every coordinate in one\n * projection does represent the same geographic point as the same coordinate in\n * the other projection.\n *\n * @param {Projection} projection1 Projection 1.\n * @param {Projection} projection2 Projection 2.\n * @return {boolean} Equivalent.\n * @api\n */\nexport function equivalent(projection1, projection2) {\n if (projection1 === projection2) {\n return true;\n }\n var equalUnits = projection1.getUnits() === projection2.getUnits();\n if (projection1.getCode() === projection2.getCode()) {\n return equalUnits;\n }\n else {\n var transformFunc = getTransformFromProjections(projection1, projection2);\n return transformFunc === cloneTransform && equalUnits;\n }\n}\n/**\n * Searches in the list of transform functions for the function for converting\n * coordinates from the source projection to the destination projection.\n *\n * @param {Projection} sourceProjection Source Projection object.\n * @param {Projection} destinationProjection Destination Projection\n * object.\n * @return {TransformFunction} Transform function.\n */\nexport function getTransformFromProjections(sourceProjection, destinationProjection) {\n var sourceCode = sourceProjection.getCode();\n var destinationCode = destinationProjection.getCode();\n var transformFunc = getTransformFunc(sourceCode, destinationCode);\n if (!transformFunc) {\n transformFunc = identityTransform;\n }\n return transformFunc;\n}\n/**\n * Given the projection-like objects, searches for a transformation\n * function to convert a coordinates array from the source projection to the\n * destination projection.\n *\n * @param {ProjectionLike} source Source.\n * @param {ProjectionLike} destination Destination.\n * @return {TransformFunction} Transform function.\n * @api\n */\nexport function getTransform(source, destination) {\n var sourceProjection = get(source);\n var destinationProjection = get(destination);\n return getTransformFromProjections(sourceProjection, destinationProjection);\n}\n/**\n * Transforms a coordinate from source projection to destination projection.\n * This returns a new coordinate (and does not modify the original).\n *\n * See {@link module:ol/proj.transformExtent} for extent transformation.\n * See the transform method of {@link module:ol/geom/Geometry~Geometry} and its\n * subclasses for geometry transforms.\n *\n * @param {import(\"./coordinate.js\").Coordinate} coordinate Coordinate.\n * @param {ProjectionLike} source Source projection-like.\n * @param {ProjectionLike} destination Destination projection-like.\n * @return {import(\"./coordinate.js\").Coordinate} Coordinate.\n * @api\n */\nexport function transform(coordinate, source, destination) {\n var transformFunc = getTransform(source, destination);\n return transformFunc(coordinate, undefined, coordinate.length);\n}\n/**\n * Transforms an extent from source projection to destination projection. This\n * returns a new extent (and does not modify the original).\n *\n * @param {import(\"./extent.js\").Extent} extent The extent to transform.\n * @param {ProjectionLike} source Source projection-like.\n * @param {ProjectionLike} destination Destination projection-like.\n * @param {number} [opt_stops] Number of stops per side used for the transform.\n * By default only the corners are used.\n * @return {import(\"./extent.js\").Extent} The transformed extent.\n * @api\n */\nexport function transformExtent(extent, source, destination, opt_stops) {\n var transformFunc = getTransform(source, destination);\n return applyTransform(extent, transformFunc, undefined, opt_stops);\n}\n/**\n * Transforms the given point to the destination projection.\n *\n * @param {import(\"./coordinate.js\").Coordinate} point Point.\n * @param {Projection} sourceProjection Source projection.\n * @param {Projection} destinationProjection Destination projection.\n * @return {import(\"./coordinate.js\").Coordinate} Point.\n */\nexport function transformWithProjections(point, sourceProjection, destinationProjection) {\n var transformFunc = getTransformFromProjections(sourceProjection, destinationProjection);\n return transformFunc(point);\n}\n/**\n * @type {?Projection}\n */\nvar userProjection = null;\n/**\n * Set the projection for coordinates supplied from and returned by API methods.\n * Note that this method is not yet a part of the stable API. Support for user\n * projections is not yet complete and should be considered experimental.\n * @param {ProjectionLike} projection The user projection.\n */\nexport function setUserProjection(projection) {\n userProjection = get(projection);\n}\n/**\n * Clear the user projection if set. Note that this method is not yet a part of\n * the stable API. Support for user projections is not yet complete and should\n * be considered experimental.\n */\nexport function clearUserProjection() {\n userProjection = null;\n}\n/**\n * Get the projection for coordinates supplied from and returned by API methods.\n * Note that this method is not yet a part of the stable API. Support for user\n * projections is not yet complete and should be considered experimental.\n * @return {?Projection} The user projection (or null if not set).\n */\nexport function getUserProjection() {\n return userProjection;\n}\n/**\n * Use geographic coordinates (WGS-84 datum) in API methods. Note that this\n * method is not yet a part of the stable API. Support for user projections is\n * not yet complete and should be considered experimental.\n */\nexport function useGeographic() {\n setUserProjection('EPSG:4326');\n}\n/**\n * Return a coordinate transformed into the user projection. If no user projection\n * is set, the original coordinate is returned.\n * @param {Array} coordinate Input coordinate.\n * @param {ProjectionLike} sourceProjection The input coordinate projection.\n * @return {Array} The input coordinate in the user projection.\n */\nexport function toUserCoordinate(coordinate, sourceProjection) {\n if (!userProjection) {\n return coordinate;\n }\n return transform(coordinate, sourceProjection, userProjection);\n}\n/**\n * Return a coordinate transformed from the user projection. If no user projection\n * is set, the original coordinate is returned.\n * @param {Array} coordinate Input coordinate.\n * @param {ProjectionLike} destProjection The destination projection.\n * @return {Array} The input coordinate transformed.\n */\nexport function fromUserCoordinate(coordinate, destProjection) {\n if (!userProjection) {\n return coordinate;\n }\n return transform(coordinate, userProjection, destProjection);\n}\n/**\n * Return an extent transformed into the user projection. If no user projection\n * is set, the original extent is returned.\n * @param {import(\"./extent.js\").Extent} extent Input extent.\n * @param {ProjectionLike} sourceProjection The input extent projection.\n * @return {import(\"./extent.js\").Extent} The input extent in the user projection.\n */\nexport function toUserExtent(extent, sourceProjection) {\n if (!userProjection) {\n return extent;\n }\n return transformExtent(extent, sourceProjection, userProjection);\n}\n/**\n * Return an extent transformed from the user projection. If no user projection\n * is set, the original extent is returned.\n * @param {import(\"./extent.js\").Extent} extent Input extent.\n * @param {ProjectionLike} destProjection The destination projection.\n * @return {import(\"./extent.js\").Extent} The input extent transformed.\n */\nexport function fromUserExtent(extent, destProjection) {\n if (!userProjection) {\n return extent;\n }\n return transformExtent(extent, userProjection, destProjection);\n}\n/**\n * Return the resolution in user projection units per pixel. If no user projection\n * is set, or source or user projection are missing units, the original resolution\n * is returned.\n * @param {number} resolution Resolution in input projection units per pixel.\n * @param {ProjectionLike} sourceProjection The input projection.\n * @return {number} Resolution in user projection units per pixel.\n */\nexport function toUserResolution(resolution, sourceProjection) {\n if (!userProjection) {\n return resolution;\n }\n var sourceUnits = get(sourceProjection).getUnits();\n var userUnits = userProjection.getUnits();\n return sourceUnits && userUnits\n ? (resolution * METERS_PER_UNIT[sourceUnits]) / METERS_PER_UNIT[userUnits]\n : resolution;\n}\n/**\n * Return the resolution in user projection units per pixel. If no user projection\n * is set, or source or user projection are missing units, the original resolution\n * is returned.\n * @param {number} resolution Resolution in user projection units per pixel.\n * @param {ProjectionLike} destProjection The destination projection.\n * @return {number} Resolution in destination projection units per pixel.\n */\nexport function fromUserResolution(resolution, destProjection) {\n if (!userProjection) {\n return resolution;\n }\n var sourceUnits = get(destProjection).getUnits();\n var userUnits = userProjection.getUnits();\n return sourceUnits && userUnits\n ? (resolution * METERS_PER_UNIT[userUnits]) / METERS_PER_UNIT[sourceUnits]\n : resolution;\n}\n/**\n * Creates a safe coordinate transform function from a coordinate transform function.\n * \"Safe\" means that it can handle wrapping of x-coordinates for global projections,\n * and that coordinates exceeding the source projection validity extent's range will be\n * clamped to the validity range.\n * @param {Projection} sourceProj Source projection.\n * @param {Projection} destProj Destination projection.\n * @param {function(import(\"./coordinate.js\").Coordinate): import(\"./coordinate.js\").Coordinate} transform Transform function (source to destiation).\n * @return {function(import(\"./coordinate.js\").Coordinate): import(\"./coordinate.js\").Coordinate} Safe transform function (source to destiation).\n */\nexport function createSafeCoordinateTransform(sourceProj, destProj, transform) {\n return function (coord) {\n var sourceX = coord[0];\n var sourceY = coord[1];\n var transformed, worldsAway;\n if (sourceProj.canWrapX()) {\n var sourceExtent = sourceProj.getExtent();\n var sourceExtentWidth = getWidth(sourceExtent);\n worldsAway = getWorldsAway(coord, sourceProj, sourceExtentWidth);\n if (worldsAway) {\n // Move x to the real world\n sourceX = sourceX - worldsAway * sourceExtentWidth;\n }\n sourceX = clamp(sourceX, sourceExtent[0], sourceExtent[2]);\n sourceY = clamp(sourceY, sourceExtent[1], sourceExtent[3]);\n transformed = transform([sourceX, sourceY]);\n }\n else {\n transformed = transform(coord);\n }\n if (worldsAway && destProj.canWrapX()) {\n // Move transformed coordinate back to the offset world\n transformed[0] += worldsAway * getWidth(destProj.getExtent());\n }\n return transformed;\n };\n}\n/**\n * Add transforms to and from EPSG:4326 and EPSG:3857. This function is called\n * by when this module is executed and should only need to be called again after\n * `clearAllProjections()` is called (e.g. in tests).\n */\nexport function addCommon() {\n // Add transformations that don't alter coordinates to convert within set of\n // projections with equal meaning.\n addEquivalentProjections(EPSG3857_PROJECTIONS);\n addEquivalentProjections(EPSG4326_PROJECTIONS);\n // Add transformations to convert EPSG:4326 like coordinates to EPSG:3857 like\n // coordinates and back.\n addEquivalentTransforms(EPSG4326_PROJECTIONS, EPSG3857_PROJECTIONS, fromEPSG4326, toEPSG4326);\n}\naddCommon();\n//# sourceMappingURL=proj.js.map","/**\n * @module ol/centerconstraint\n */\nimport { clamp } from './math.js';\n/**\n * @typedef {function((import(\"./coordinate.js\").Coordinate|undefined), number, import(\"./size.js\").Size, boolean=, Array=): (import(\"./coordinate.js\").Coordinate|undefined)} Type\n */\n/**\n * @param {import(\"./extent.js\").Extent} extent Extent.\n * @param {boolean} onlyCenter If true, the constraint will only apply to the view center.\n * @param {boolean} smooth If true, the view will be able to go slightly out of the given extent\n * (only during interaction and animation).\n * @return {Type} The constraint.\n */\nexport function createExtent(extent, onlyCenter, smooth) {\n return (\n /**\n * @param {import(\"./coordinate.js\").Coordinate|undefined} center Center.\n * @param {number} resolution Resolution.\n * @param {import(\"./size.js\").Size} size Viewport size; unused if `onlyCenter` was specified.\n * @param {boolean} [opt_isMoving] True if an interaction or animation is in progress.\n * @param {Array} [opt_centerShift] Shift between map center and viewport center.\n * @return {import(\"./coordinate.js\").Coordinate|undefined} Center.\n */\n function (center, resolution, size, opt_isMoving, opt_centerShift) {\n if (center) {\n var viewWidth = onlyCenter ? 0 : size[0] * resolution;\n var viewHeight = onlyCenter ? 0 : size[1] * resolution;\n var shiftX = opt_centerShift ? opt_centerShift[0] : 0;\n var shiftY = opt_centerShift ? opt_centerShift[1] : 0;\n var minX = extent[0] + viewWidth / 2 + shiftX;\n var maxX = extent[2] - viewWidth / 2 + shiftX;\n var minY = extent[1] + viewHeight / 2 + shiftY;\n var maxY = extent[3] - viewHeight / 2 + shiftY;\n // note: when zooming out of bounds, min and max values for x and y may\n // end up inverted (min > max); this has to be accounted for\n if (minX > maxX) {\n minX = (maxX + minX) / 2;\n maxX = minX;\n }\n if (minY > maxY) {\n minY = (maxY + minY) / 2;\n maxY = minY;\n }\n var x = clamp(center[0], minX, maxX);\n var y = clamp(center[1], minY, maxY);\n var ratio = 30 * resolution;\n // during an interaction, allow some overscroll\n if (opt_isMoving && smooth) {\n x +=\n -ratio * Math.log(1 + Math.max(0, minX - center[0]) / ratio) +\n ratio * Math.log(1 + Math.max(0, center[0] - maxX) / ratio);\n y +=\n -ratio * Math.log(1 + Math.max(0, minY - center[1]) / ratio) +\n ratio * Math.log(1 + Math.max(0, center[1] - maxY) / ratio);\n }\n return [x, y];\n }\n else {\n return undefined;\n }\n });\n}\n/**\n * @param {import(\"./coordinate.js\").Coordinate} [center] Center.\n * @return {import(\"./coordinate.js\").Coordinate|undefined} Center.\n */\nexport function none(center) {\n return center;\n}\n//# sourceMappingURL=centerconstraint.js.map","/**\n * @module ol/resolutionconstraint\n */\nimport { clamp } from './math.js';\nimport { getHeight, getWidth } from './extent.js';\nimport { linearFindNearest } from './array.js';\n/**\n * @typedef {function((number|undefined), number, import(\"./size.js\").Size, boolean=): (number|undefined)} Type\n */\n/**\n * Returns a modified resolution taking into account the viewport size and maximum\n * allowed extent.\n * @param {number} resolution Resolution\n * @param {import(\"./extent.js\").Extent} maxExtent Maximum allowed extent.\n * @param {import(\"./size.js\").Size} viewportSize Viewport size.\n * @param {boolean} showFullExtent Whether to show the full extent.\n * @return {number} Capped resolution.\n */\nfunction getViewportClampedResolution(resolution, maxExtent, viewportSize, showFullExtent) {\n var xResolution = getWidth(maxExtent) / viewportSize[0];\n var yResolution = getHeight(maxExtent) / viewportSize[1];\n if (showFullExtent) {\n return Math.min(resolution, Math.max(xResolution, yResolution));\n }\n return Math.min(resolution, Math.min(xResolution, yResolution));\n}\n/**\n * Returns a modified resolution to be between maxResolution and minResolution while\n * still allowing the value to be slightly out of bounds.\n * Note: the computation is based on the logarithm function (ln):\n * - at 1, ln(x) is 0\n * - above 1, ln(x) keeps increasing but at a much slower pace than x\n * The final result is clamped to prevent getting too far away from bounds.\n * @param {number} resolution Resolution.\n * @param {number} maxResolution Max resolution.\n * @param {number} minResolution Min resolution.\n * @return {number} Smoothed resolution.\n */\nfunction getSmoothClampedResolution(resolution, maxResolution, minResolution) {\n var result = Math.min(resolution, maxResolution);\n var ratio = 50;\n result *=\n Math.log(1 + ratio * Math.max(0, resolution / maxResolution - 1)) / ratio +\n 1;\n if (minResolution) {\n result = Math.max(result, minResolution);\n result /=\n Math.log(1 + ratio * Math.max(0, minResolution / resolution - 1)) /\n ratio +\n 1;\n }\n return clamp(result, minResolution / 2, maxResolution * 2);\n}\n/**\n * @param {Array} resolutions Resolutions.\n * @param {boolean} [opt_smooth] If true, the view will be able to slightly exceed resolution limits. Default: true.\n * @param {import(\"./extent.js\").Extent} [opt_maxExtent] Maximum allowed extent.\n * @param {boolean} [opt_showFullExtent] If true, allows us to show the full extent. Default: false.\n * @return {Type} Zoom function.\n */\nexport function createSnapToResolutions(resolutions, opt_smooth, opt_maxExtent, opt_showFullExtent) {\n return (\n /**\n * @param {number|undefined} resolution Resolution.\n * @param {number} direction Direction.\n * @param {import(\"./size.js\").Size} size Viewport size.\n * @param {boolean} [opt_isMoving] True if an interaction or animation is in progress.\n * @return {number|undefined} Resolution.\n */\n function (resolution, direction, size, opt_isMoving) {\n if (resolution !== undefined) {\n var maxResolution = resolutions[0];\n var minResolution = resolutions[resolutions.length - 1];\n var cappedMaxRes = opt_maxExtent\n ? getViewportClampedResolution(maxResolution, opt_maxExtent, size, opt_showFullExtent)\n : maxResolution;\n // during interacting or animating, allow intermediary values\n if (opt_isMoving) {\n var smooth = opt_smooth !== undefined ? opt_smooth : true;\n if (!smooth) {\n return clamp(resolution, minResolution, cappedMaxRes);\n }\n return getSmoothClampedResolution(resolution, cappedMaxRes, minResolution);\n }\n var capped = Math.min(cappedMaxRes, resolution);\n var z = Math.floor(linearFindNearest(resolutions, capped, direction));\n if (resolutions[z] > cappedMaxRes && z < resolutions.length - 1) {\n return resolutions[z + 1];\n }\n return resolutions[z];\n }\n else {\n return undefined;\n }\n });\n}\n/**\n * @param {number} power Power.\n * @param {number} maxResolution Maximum resolution.\n * @param {number} [opt_minResolution] Minimum resolution.\n * @param {boolean} [opt_smooth] If true, the view will be able to slightly exceed resolution limits. Default: true.\n * @param {import(\"./extent.js\").Extent} [opt_maxExtent] Maximum allowed extent.\n * @param {boolean} [opt_showFullExtent] If true, allows us to show the full extent. Default: false.\n * @return {Type} Zoom function.\n */\nexport function createSnapToPower(power, maxResolution, opt_minResolution, opt_smooth, opt_maxExtent, opt_showFullExtent) {\n return (\n /**\n * @param {number|undefined} resolution Resolution.\n * @param {number} direction Direction.\n * @param {import(\"./size.js\").Size} size Viewport size.\n * @param {boolean} [opt_isMoving] True if an interaction or animation is in progress.\n * @return {number|undefined} Resolution.\n */\n function (resolution, direction, size, opt_isMoving) {\n if (resolution !== undefined) {\n var cappedMaxRes = opt_maxExtent\n ? getViewportClampedResolution(maxResolution, opt_maxExtent, size, opt_showFullExtent)\n : maxResolution;\n var minResolution = opt_minResolution !== undefined ? opt_minResolution : 0;\n // during interacting or animating, allow intermediary values\n if (opt_isMoving) {\n var smooth = opt_smooth !== undefined ? opt_smooth : true;\n if (!smooth) {\n return clamp(resolution, minResolution, cappedMaxRes);\n }\n return getSmoothClampedResolution(resolution, cappedMaxRes, minResolution);\n }\n var tolerance = 1e-9;\n var minZoomLevel = Math.ceil(Math.log(maxResolution / cappedMaxRes) / Math.log(power) - tolerance);\n var offset = -direction * (0.5 - tolerance) + 0.5;\n var capped = Math.min(cappedMaxRes, resolution);\n var cappedZoomLevel = Math.floor(Math.log(maxResolution / capped) / Math.log(power) + offset);\n var zoomLevel = Math.max(minZoomLevel, cappedZoomLevel);\n var newResolution = maxResolution / Math.pow(power, zoomLevel);\n return clamp(newResolution, minResolution, cappedMaxRes);\n }\n else {\n return undefined;\n }\n });\n}\n/**\n * @param {number} maxResolution Max resolution.\n * @param {number} minResolution Min resolution.\n * @param {boolean} [opt_smooth] If true, the view will be able to slightly exceed resolution limits. Default: true.\n * @param {import(\"./extent.js\").Extent} [opt_maxExtent] Maximum allowed extent.\n * @param {boolean} [opt_showFullExtent] If true, allows us to show the full extent. Default: false.\n * @return {Type} Zoom function.\n */\nexport function createMinMaxResolution(maxResolution, minResolution, opt_smooth, opt_maxExtent, opt_showFullExtent) {\n return (\n /**\n * @param {number|undefined} resolution Resolution.\n * @param {number} direction Direction.\n * @param {import(\"./size.js\").Size} size Viewport size.\n * @param {boolean} [opt_isMoving] True if an interaction or animation is in progress.\n * @return {number|undefined} Resolution.\n */\n function (resolution, direction, size, opt_isMoving) {\n if (resolution !== undefined) {\n var cappedMaxRes = opt_maxExtent\n ? getViewportClampedResolution(maxResolution, opt_maxExtent, size, opt_showFullExtent)\n : maxResolution;\n var smooth = opt_smooth !== undefined ? opt_smooth : true;\n if (!smooth || !opt_isMoving) {\n return clamp(resolution, minResolution, cappedMaxRes);\n }\n return getSmoothClampedResolution(resolution, cappedMaxRes, minResolution);\n }\n else {\n return undefined;\n }\n });\n}\n//# sourceMappingURL=resolutionconstraint.js.map","/**\n * @module ol/rotationconstraint\n */\nimport { toRadians } from './math.js';\n/**\n * @typedef {function((number|undefined), boolean=): (number|undefined)} Type\n */\n/**\n * @param {number|undefined} rotation Rotation.\n * @return {number|undefined} Rotation.\n */\nexport function disable(rotation) {\n if (rotation !== undefined) {\n return 0;\n }\n else {\n return undefined;\n }\n}\n/**\n * @param {number|undefined} rotation Rotation.\n * @return {number|undefined} Rotation.\n */\nexport function none(rotation) {\n if (rotation !== undefined) {\n return rotation;\n }\n else {\n return undefined;\n }\n}\n/**\n * @param {number} n N.\n * @return {Type} Rotation constraint.\n */\nexport function createSnapToN(n) {\n var theta = (2 * Math.PI) / n;\n return (\n /**\n * @param {number|undefined} rotation Rotation.\n * @param {boolean} [opt_isMoving] True if an interaction or animation is in progress.\n * @return {number|undefined} Rotation.\n */\n function (rotation, opt_isMoving) {\n if (opt_isMoving) {\n return rotation;\n }\n if (rotation !== undefined) {\n rotation = Math.floor(rotation / theta + 0.5) * theta;\n return rotation;\n }\n else {\n return undefined;\n }\n });\n}\n/**\n * @param {number} [opt_tolerance] Tolerance.\n * @return {Type} Rotation constraint.\n */\nexport function createSnapToZero(opt_tolerance) {\n var tolerance = opt_tolerance || toRadians(5);\n return (\n /**\n * @param {number|undefined} rotation Rotation.\n * @param {boolean} [opt_isMoving] True if an interaction or animation is in progress.\n * @return {number|undefined} Rotation.\n */\n function (rotation, opt_isMoving) {\n if (opt_isMoving) {\n return rotation;\n }\n if (rotation !== undefined) {\n if (Math.abs(rotation) <= tolerance) {\n return 0;\n }\n else {\n return rotation;\n }\n }\n else {\n return undefined;\n }\n });\n}\n//# sourceMappingURL=rotationconstraint.js.map","/**\n * @module ol/easing\n */\n/**\n * Start slow and speed up.\n * @param {number} t Input between 0 and 1.\n * @return {number} Output between 0 and 1.\n * @api\n */\nexport function easeIn(t) {\n return Math.pow(t, 3);\n}\n/**\n * Start fast and slow down.\n * @param {number} t Input between 0 and 1.\n * @return {number} Output between 0 and 1.\n * @api\n */\nexport function easeOut(t) {\n return 1 - easeIn(1 - t);\n}\n/**\n * Start slow, speed up, and then slow down again.\n * @param {number} t Input between 0 and 1.\n * @return {number} Output between 0 and 1.\n * @api\n */\nexport function inAndOut(t) {\n return 3 * t * t - 2 * t * t * t;\n}\n/**\n * Maintain a constant speed over time.\n * @param {number} t Input between 0 and 1.\n * @return {number} Output between 0 and 1.\n * @api\n */\nexport function linear(t) {\n return t;\n}\n/**\n * Start slow, speed up, and at the very end slow down again. This has the\n * same general behavior as {@link module:ol/easing.inAndOut}, but the final\n * slowdown is delayed.\n * @param {number} t Input between 0 and 1.\n * @return {number} Output between 0 and 1.\n * @api\n */\nexport function upAndDown(t) {\n if (t < 0.5) {\n return inAndOut(2 * t);\n }\n else {\n return 1 - inAndOut(2 * (t - 0.5));\n }\n}\n//# sourceMappingURL=easing.js.map","/**\n * @module ol/geom/GeometryLayout\n */\n/**\n * The coordinate layout for geometries, indicating whether a 3rd or 4th z ('Z')\n * or measure ('M') coordinate is available. Supported values are `'XY'`,\n * `'XYZ'`, `'XYM'`, `'XYZM'`.\n * @enum {string}\n */\nexport default {\n XY: 'XY',\n XYZ: 'XYZ',\n XYM: 'XYM',\n XYZM: 'XYZM',\n};\n//# sourceMappingURL=GeometryLayout.js.map","/**\n * @module ol/geom/flat/transform\n */\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {import(\"../../transform.js\").Transform} transform Transform.\n * @param {Array} [opt_dest] Destination.\n * @return {Array} Transformed coordinates.\n */\nexport function transform2D(flatCoordinates, offset, end, stride, transform, opt_dest) {\n var dest = opt_dest ? opt_dest : [];\n var i = 0;\n for (var j = offset; j < end; j += stride) {\n var x = flatCoordinates[j];\n var y = flatCoordinates[j + 1];\n dest[i++] = transform[0] * x + transform[2] * y + transform[4];\n dest[i++] = transform[1] * x + transform[3] * y + transform[5];\n }\n if (opt_dest && dest.length != i) {\n dest.length = i;\n }\n return dest;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {number} angle Angle.\n * @param {Array} anchor Rotation anchor point.\n * @param {Array} [opt_dest] Destination.\n * @return {Array} Transformed coordinates.\n */\nexport function rotate(flatCoordinates, offset, end, stride, angle, anchor, opt_dest) {\n var dest = opt_dest ? opt_dest : [];\n var cos = Math.cos(angle);\n var sin = Math.sin(angle);\n var anchorX = anchor[0];\n var anchorY = anchor[1];\n var i = 0;\n for (var j = offset; j < end; j += stride) {\n var deltaX = flatCoordinates[j] - anchorX;\n var deltaY = flatCoordinates[j + 1] - anchorY;\n dest[i++] = anchorX + deltaX * cos - deltaY * sin;\n dest[i++] = anchorY + deltaX * sin + deltaY * cos;\n for (var k = j + 2; k < j + stride; ++k) {\n dest[i++] = flatCoordinates[k];\n }\n }\n if (opt_dest && dest.length != i) {\n dest.length = i;\n }\n return dest;\n}\n/**\n * Scale the coordinates.\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {number} sx Scale factor in the x-direction.\n * @param {number} sy Scale factor in the y-direction.\n * @param {Array} anchor Scale anchor point.\n * @param {Array} [opt_dest] Destination.\n * @return {Array} Transformed coordinates.\n */\nexport function scale(flatCoordinates, offset, end, stride, sx, sy, anchor, opt_dest) {\n var dest = opt_dest ? opt_dest : [];\n var anchorX = anchor[0];\n var anchorY = anchor[1];\n var i = 0;\n for (var j = offset; j < end; j += stride) {\n var deltaX = flatCoordinates[j] - anchorX;\n var deltaY = flatCoordinates[j + 1] - anchorY;\n dest[i++] = anchorX + sx * deltaX;\n dest[i++] = anchorY + sy * deltaY;\n for (var k = j + 2; k < j + stride; ++k) {\n dest[i++] = flatCoordinates[k];\n }\n }\n if (opt_dest && dest.length != i) {\n dest.length = i;\n }\n return dest;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {number} deltaX Delta X.\n * @param {number} deltaY Delta Y.\n * @param {Array} [opt_dest] Destination.\n * @return {Array} Transformed coordinates.\n */\nexport function translate(flatCoordinates, offset, end, stride, deltaX, deltaY, opt_dest) {\n var dest = opt_dest ? opt_dest : [];\n var i = 0;\n for (var j = offset; j < end; j += stride) {\n dest[i++] = flatCoordinates[j] + deltaX;\n dest[i++] = flatCoordinates[j + 1] + deltaY;\n for (var k = j + 2; k < j + stride; ++k) {\n dest[i++] = flatCoordinates[k];\n }\n }\n if (opt_dest && dest.length != i) {\n dest.length = i;\n }\n return dest;\n}\n//# sourceMappingURL=transform.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/geom/Geometry\n */\nimport BaseObject from '../Object.js';\nimport Units from '../proj/Units.js';\nimport { abstract } from '../util.js';\nimport { compose as composeTransform, create as createTransform, } from '../transform.js';\nimport { createEmpty, createOrUpdateEmpty, getHeight, returnOrUpdate, } from '../extent.js';\nimport { get as getProjection, getTransform } from '../proj.js';\nimport { memoizeOne } from '../functions.js';\nimport { transform2D } from './flat/transform.js';\n/**\n * @type {import(\"../transform.js\").Transform}\n */\nvar tmpTransform = createTransform();\n/**\n * @classdesc\n * Abstract base class; normally only used for creating subclasses and not\n * instantiated in apps.\n * Base class for vector geometries.\n *\n * To get notified of changes to the geometry, register a listener for the\n * generic `change` event on your geometry instance.\n *\n * @abstract\n * @api\n */\nvar Geometry = /** @class */ (function (_super) {\n __extends(Geometry, _super);\n function Geometry() {\n var _this = _super.call(this) || this;\n /**\n * @private\n * @type {import(\"../extent.js\").Extent}\n */\n _this.extent_ = createEmpty();\n /**\n * @private\n * @type {number}\n */\n _this.extentRevision_ = -1;\n /**\n * @protected\n * @type {number}\n */\n _this.simplifiedGeometryMaxMinSquaredTolerance = 0;\n /**\n * @protected\n * @type {number}\n */\n _this.simplifiedGeometryRevision = 0;\n /**\n * Get a transformed and simplified version of the geometry.\n * @abstract\n * @param {number} revision The geometry revision.\n * @param {number} squaredTolerance Squared tolerance.\n * @param {import(\"../proj.js\").TransformFunction} [opt_transform] Optional transform function.\n * @return {Geometry} Simplified geometry.\n */\n _this.simplifyTransformedInternal = memoizeOne(function (revision, squaredTolerance, opt_transform) {\n if (!opt_transform) {\n return this.getSimplifiedGeometry(squaredTolerance);\n }\n var clone = this.clone();\n clone.applyTransform(opt_transform);\n return clone.getSimplifiedGeometry(squaredTolerance);\n });\n return _this;\n }\n /**\n * Get a transformed and simplified version of the geometry.\n * @abstract\n * @param {number} squaredTolerance Squared tolerance.\n * @param {import(\"../proj.js\").TransformFunction} [opt_transform] Optional transform function.\n * @return {Geometry} Simplified geometry.\n */\n Geometry.prototype.simplifyTransformed = function (squaredTolerance, opt_transform) {\n return this.simplifyTransformedInternal(this.getRevision(), squaredTolerance, opt_transform);\n };\n /**\n * Make a complete copy of the geometry.\n * @abstract\n * @return {!Geometry} Clone.\n */\n Geometry.prototype.clone = function () {\n return abstract();\n };\n /**\n * @abstract\n * @param {number} x X.\n * @param {number} y Y.\n * @param {import(\"../coordinate.js\").Coordinate} closestPoint Closest point.\n * @param {number} minSquaredDistance Minimum squared distance.\n * @return {number} Minimum squared distance.\n */\n Geometry.prototype.closestPointXY = function (x, y, closestPoint, minSquaredDistance) {\n return abstract();\n };\n /**\n * @param {number} x X.\n * @param {number} y Y.\n * @return {boolean} Contains (x, y).\n */\n Geometry.prototype.containsXY = function (x, y) {\n var coord = this.getClosestPoint([x, y]);\n return coord[0] === x && coord[1] === y;\n };\n /**\n * Return the closest point of the geometry to the passed point as\n * {@link module:ol/coordinate~Coordinate coordinate}.\n * @param {import(\"../coordinate.js\").Coordinate} point Point.\n * @param {import(\"../coordinate.js\").Coordinate} [opt_closestPoint] Closest point.\n * @return {import(\"../coordinate.js\").Coordinate} Closest point.\n * @api\n */\n Geometry.prototype.getClosestPoint = function (point, opt_closestPoint) {\n var closestPoint = opt_closestPoint ? opt_closestPoint : [NaN, NaN];\n this.closestPointXY(point[0], point[1], closestPoint, Infinity);\n return closestPoint;\n };\n /**\n * Returns true if this geometry includes the specified coordinate. If the\n * coordinate is on the boundary of the geometry, returns false.\n * @param {import(\"../coordinate.js\").Coordinate} coordinate Coordinate.\n * @return {boolean} Contains coordinate.\n * @api\n */\n Geometry.prototype.intersectsCoordinate = function (coordinate) {\n return this.containsXY(coordinate[0], coordinate[1]);\n };\n /**\n * @abstract\n * @param {import(\"../extent.js\").Extent} extent Extent.\n * @protected\n * @return {import(\"../extent.js\").Extent} extent Extent.\n */\n Geometry.prototype.computeExtent = function (extent) {\n return abstract();\n };\n /**\n * Get the extent of the geometry.\n * @param {import(\"../extent.js\").Extent} [opt_extent] Extent.\n * @return {import(\"../extent.js\").Extent} extent Extent.\n * @api\n */\n Geometry.prototype.getExtent = function (opt_extent) {\n if (this.extentRevision_ != this.getRevision()) {\n var extent = this.computeExtent(this.extent_);\n if (isNaN(extent[0]) || isNaN(extent[1])) {\n createOrUpdateEmpty(extent);\n }\n this.extentRevision_ = this.getRevision();\n }\n return returnOrUpdate(this.extent_, opt_extent);\n };\n /**\n * Rotate the geometry around a given coordinate. This modifies the geometry\n * coordinates in place.\n * @abstract\n * @param {number} angle Rotation angle in radians.\n * @param {import(\"../coordinate.js\").Coordinate} anchor The rotation center.\n * @api\n */\n Geometry.prototype.rotate = function (angle, anchor) {\n abstract();\n };\n /**\n * Scale the geometry (with an optional origin). This modifies the geometry\n * coordinates in place.\n * @abstract\n * @param {number} sx The scaling factor in the x-direction.\n * @param {number} [opt_sy] The scaling factor in the y-direction (defaults to sx).\n * @param {import(\"../coordinate.js\").Coordinate} [opt_anchor] The scale origin (defaults to the center\n * of the geometry extent).\n * @api\n */\n Geometry.prototype.scale = function (sx, opt_sy, opt_anchor) {\n abstract();\n };\n /**\n * Create a simplified version of this geometry. For linestrings, this uses\n * the [Douglas Peucker](https://en.wikipedia.org/wiki/Ramer-Douglas-Peucker_algorithm)\n * algorithm. For polygons, a quantization-based\n * simplification is used to preserve topology.\n * @param {number} tolerance The tolerance distance for simplification.\n * @return {Geometry} A new, simplified version of the original geometry.\n * @api\n */\n Geometry.prototype.simplify = function (tolerance) {\n return this.getSimplifiedGeometry(tolerance * tolerance);\n };\n /**\n * Create a simplified version of this geometry using the Douglas Peucker\n * algorithm.\n * See https://en.wikipedia.org/wiki/Ramer-Douglas-Peucker_algorithm.\n * @abstract\n * @param {number} squaredTolerance Squared tolerance.\n * @return {Geometry} Simplified geometry.\n */\n Geometry.prototype.getSimplifiedGeometry = function (squaredTolerance) {\n return abstract();\n };\n /**\n * Get the type of this geometry.\n * @abstract\n * @return {import(\"./GeometryType.js\").default} Geometry type.\n */\n Geometry.prototype.getType = function () {\n return abstract();\n };\n /**\n * Apply a transform function to the coordinates of the geometry.\n * The geometry is modified in place.\n * If you do not want the geometry modified in place, first `clone()` it and\n * then use this function on the clone.\n * @abstract\n * @param {import(\"../proj.js\").TransformFunction} transformFn Transform function.\n * Called with a flat array of geometry coordinates.\n */\n Geometry.prototype.applyTransform = function (transformFn) {\n abstract();\n };\n /**\n * Test if the geometry and the passed extent intersect.\n * @abstract\n * @param {import(\"../extent.js\").Extent} extent Extent.\n * @return {boolean} `true` if the geometry and the extent intersect.\n */\n Geometry.prototype.intersectsExtent = function (extent) {\n return abstract();\n };\n /**\n * Translate the geometry. This modifies the geometry coordinates in place. If\n * instead you want a new geometry, first `clone()` this geometry.\n * @abstract\n * @param {number} deltaX Delta X.\n * @param {number} deltaY Delta Y.\n * @api\n */\n Geometry.prototype.translate = function (deltaX, deltaY) {\n abstract();\n };\n /**\n * Transform each coordinate of the geometry from one coordinate reference\n * system to another. The geometry is modified in place.\n * For example, a line will be transformed to a line and a circle to a circle.\n * If you do not want the geometry modified in place, first `clone()` it and\n * then use this function on the clone.\n *\n * @param {import(\"../proj.js\").ProjectionLike} source The current projection. Can be a\n * string identifier or a {@link module:ol/proj/Projection~Projection} object.\n * @param {import(\"../proj.js\").ProjectionLike} destination The desired projection. Can be a\n * string identifier or a {@link module:ol/proj/Projection~Projection} object.\n * @return {Geometry} This geometry. Note that original geometry is\n * modified in place.\n * @api\n */\n Geometry.prototype.transform = function (source, destination) {\n /** @type {import(\"../proj/Projection.js\").default} */\n var sourceProj = getProjection(source);\n var transformFn = sourceProj.getUnits() == Units.TILE_PIXELS\n ? function (inCoordinates, outCoordinates, stride) {\n var pixelExtent = sourceProj.getExtent();\n var projectedExtent = sourceProj.getWorldExtent();\n var scale = getHeight(projectedExtent) / getHeight(pixelExtent);\n composeTransform(tmpTransform, projectedExtent[0], projectedExtent[3], scale, -scale, 0, 0, 0);\n transform2D(inCoordinates, 0, inCoordinates.length, stride, tmpTransform, outCoordinates);\n return getTransform(sourceProj, destination)(inCoordinates, outCoordinates, stride);\n }\n : getTransform(sourceProj, destination);\n this.applyTransform(transformFn);\n return this;\n };\n return Geometry;\n}(BaseObject));\nexport default Geometry;\n//# sourceMappingURL=Geometry.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/geom/SimpleGeometry\n */\nimport Geometry from './Geometry.js';\nimport GeometryLayout from './GeometryLayout.js';\nimport { abstract } from '../util.js';\nimport { createOrUpdateFromFlatCoordinates, getCenter } from '../extent.js';\nimport { rotate, scale, transform2D, translate } from './flat/transform.js';\n/**\n * @classdesc\n * Abstract base class; only used for creating subclasses; do not instantiate\n * in apps, as cannot be rendered.\n *\n * @abstract\n * @api\n */\nvar SimpleGeometry = /** @class */ (function (_super) {\n __extends(SimpleGeometry, _super);\n function SimpleGeometry() {\n var _this = _super.call(this) || this;\n /**\n * @protected\n * @type {import(\"./GeometryLayout.js\").default}\n */\n _this.layout = GeometryLayout.XY;\n /**\n * @protected\n * @type {number}\n */\n _this.stride = 2;\n /**\n * @protected\n * @type {Array}\n */\n _this.flatCoordinates = null;\n return _this;\n }\n /**\n * @param {import(\"../extent.js\").Extent} extent Extent.\n * @protected\n * @return {import(\"../extent.js\").Extent} extent Extent.\n */\n SimpleGeometry.prototype.computeExtent = function (extent) {\n return createOrUpdateFromFlatCoordinates(this.flatCoordinates, 0, this.flatCoordinates.length, this.stride, extent);\n };\n /**\n * @abstract\n * @return {Array<*>} Coordinates.\n */\n SimpleGeometry.prototype.getCoordinates = function () {\n return abstract();\n };\n /**\n * Return the first coordinate of the geometry.\n * @return {import(\"../coordinate.js\").Coordinate} First coordinate.\n * @api\n */\n SimpleGeometry.prototype.getFirstCoordinate = function () {\n return this.flatCoordinates.slice(0, this.stride);\n };\n /**\n * @return {Array} Flat coordinates.\n */\n SimpleGeometry.prototype.getFlatCoordinates = function () {\n return this.flatCoordinates;\n };\n /**\n * Return the last coordinate of the geometry.\n * @return {import(\"../coordinate.js\").Coordinate} Last point.\n * @api\n */\n SimpleGeometry.prototype.getLastCoordinate = function () {\n return this.flatCoordinates.slice(this.flatCoordinates.length - this.stride);\n };\n /**\n * Return the {@link module:ol/geom/GeometryLayout layout} of the geometry.\n * @return {import(\"./GeometryLayout.js\").default} Layout.\n * @api\n */\n SimpleGeometry.prototype.getLayout = function () {\n return this.layout;\n };\n /**\n * Create a simplified version of this geometry using the Douglas Peucker algorithm.\n * @param {number} squaredTolerance Squared tolerance.\n * @return {SimpleGeometry} Simplified geometry.\n */\n SimpleGeometry.prototype.getSimplifiedGeometry = function (squaredTolerance) {\n if (this.simplifiedGeometryRevision !== this.getRevision()) {\n this.simplifiedGeometryMaxMinSquaredTolerance = 0;\n this.simplifiedGeometryRevision = this.getRevision();\n }\n // If squaredTolerance is negative or if we know that simplification will not\n // have any effect then just return this.\n if (squaredTolerance < 0 ||\n (this.simplifiedGeometryMaxMinSquaredTolerance !== 0 &&\n squaredTolerance <= this.simplifiedGeometryMaxMinSquaredTolerance)) {\n return this;\n }\n var simplifiedGeometry = this.getSimplifiedGeometryInternal(squaredTolerance);\n var simplifiedFlatCoordinates = simplifiedGeometry.getFlatCoordinates();\n if (simplifiedFlatCoordinates.length < this.flatCoordinates.length) {\n return simplifiedGeometry;\n }\n else {\n // Simplification did not actually remove any coordinates. We now know\n // that any calls to getSimplifiedGeometry with a squaredTolerance less\n // than or equal to the current squaredTolerance will also not have any\n // effect. This allows us to short circuit simplification (saving CPU\n // cycles) and prevents the cache of simplified geometries from filling\n // up with useless identical copies of this geometry (saving memory).\n this.simplifiedGeometryMaxMinSquaredTolerance = squaredTolerance;\n return this;\n }\n };\n /**\n * @param {number} squaredTolerance Squared tolerance.\n * @return {SimpleGeometry} Simplified geometry.\n * @protected\n */\n SimpleGeometry.prototype.getSimplifiedGeometryInternal = function (squaredTolerance) {\n return this;\n };\n /**\n * @return {number} Stride.\n */\n SimpleGeometry.prototype.getStride = function () {\n return this.stride;\n };\n /**\n * @param {import(\"./GeometryLayout.js\").default} layout Layout.\n * @param {Array} flatCoordinates Flat coordinates.\n */\n SimpleGeometry.prototype.setFlatCoordinates = function (layout, flatCoordinates) {\n this.stride = getStrideForLayout(layout);\n this.layout = layout;\n this.flatCoordinates = flatCoordinates;\n };\n /**\n * @abstract\n * @param {!Array<*>} coordinates Coordinates.\n * @param {import(\"./GeometryLayout.js\").default} [opt_layout] Layout.\n */\n SimpleGeometry.prototype.setCoordinates = function (coordinates, opt_layout) {\n abstract();\n };\n /**\n * @param {import(\"./GeometryLayout.js\").default|undefined} layout Layout.\n * @param {Array<*>} coordinates Coordinates.\n * @param {number} nesting Nesting.\n * @protected\n */\n SimpleGeometry.prototype.setLayout = function (layout, coordinates, nesting) {\n /** @type {number} */\n var stride;\n if (layout) {\n stride = getStrideForLayout(layout);\n }\n else {\n for (var i = 0; i < nesting; ++i) {\n if (coordinates.length === 0) {\n this.layout = GeometryLayout.XY;\n this.stride = 2;\n return;\n }\n else {\n coordinates = /** @type {Array} */ (coordinates[0]);\n }\n }\n stride = coordinates.length;\n layout = getLayoutForStride(stride);\n }\n this.layout = layout;\n this.stride = stride;\n };\n /**\n * Apply a transform function to the coordinates of the geometry.\n * The geometry is modified in place.\n * If you do not want the geometry modified in place, first `clone()` it and\n * then use this function on the clone.\n * @param {import(\"../proj.js\").TransformFunction} transformFn Transform function.\n * Called with a flat array of geometry coordinates.\n * @api\n */\n SimpleGeometry.prototype.applyTransform = function (transformFn) {\n if (this.flatCoordinates) {\n transformFn(this.flatCoordinates, this.flatCoordinates, this.stride);\n this.changed();\n }\n };\n /**\n * Rotate the geometry around a given coordinate. This modifies the geometry\n * coordinates in place.\n * @param {number} angle Rotation angle in counter-clockwise radians.\n * @param {import(\"../coordinate.js\").Coordinate} anchor The rotation center.\n * @api\n */\n SimpleGeometry.prototype.rotate = function (angle, anchor) {\n var flatCoordinates = this.getFlatCoordinates();\n if (flatCoordinates) {\n var stride = this.getStride();\n rotate(flatCoordinates, 0, flatCoordinates.length, stride, angle, anchor, flatCoordinates);\n this.changed();\n }\n };\n /**\n * Scale the geometry (with an optional origin). This modifies the geometry\n * coordinates in place.\n * @param {number} sx The scaling factor in the x-direction.\n * @param {number} [opt_sy] The scaling factor in the y-direction (defaults to sx).\n * @param {import(\"../coordinate.js\").Coordinate} [opt_anchor] The scale origin (defaults to the center\n * of the geometry extent).\n * @api\n */\n SimpleGeometry.prototype.scale = function (sx, opt_sy, opt_anchor) {\n var sy = opt_sy;\n if (sy === undefined) {\n sy = sx;\n }\n var anchor = opt_anchor;\n if (!anchor) {\n anchor = getCenter(this.getExtent());\n }\n var flatCoordinates = this.getFlatCoordinates();\n if (flatCoordinates) {\n var stride = this.getStride();\n scale(flatCoordinates, 0, flatCoordinates.length, stride, sx, sy, anchor, flatCoordinates);\n this.changed();\n }\n };\n /**\n * Translate the geometry. This modifies the geometry coordinates in place. If\n * instead you want a new geometry, first `clone()` this geometry.\n * @param {number} deltaX Delta X.\n * @param {number} deltaY Delta Y.\n * @api\n */\n SimpleGeometry.prototype.translate = function (deltaX, deltaY) {\n var flatCoordinates = this.getFlatCoordinates();\n if (flatCoordinates) {\n var stride = this.getStride();\n translate(flatCoordinates, 0, flatCoordinates.length, stride, deltaX, deltaY, flatCoordinates);\n this.changed();\n }\n };\n return SimpleGeometry;\n}(Geometry));\n/**\n * @param {number} stride Stride.\n * @return {import(\"./GeometryLayout.js\").default} layout Layout.\n */\nfunction getLayoutForStride(stride) {\n var layout;\n if (stride == 2) {\n layout = GeometryLayout.XY;\n }\n else if (stride == 3) {\n layout = GeometryLayout.XYZ;\n }\n else if (stride == 4) {\n layout = GeometryLayout.XYZM;\n }\n return /** @type {import(\"./GeometryLayout.js\").default} */ (layout);\n}\n/**\n * @param {import(\"./GeometryLayout.js\").default} layout Layout.\n * @return {number} Stride.\n */\nexport function getStrideForLayout(layout) {\n var stride;\n if (layout == GeometryLayout.XY) {\n stride = 2;\n }\n else if (layout == GeometryLayout.XYZ || layout == GeometryLayout.XYM) {\n stride = 3;\n }\n else if (layout == GeometryLayout.XYZM) {\n stride = 4;\n }\n return /** @type {number} */ (stride);\n}\n/**\n * @param {SimpleGeometry} simpleGeometry Simple geometry.\n * @param {import(\"../transform.js\").Transform} transform Transform.\n * @param {Array} [opt_dest] Destination.\n * @return {Array} Transformed flat coordinates.\n */\nexport function transformGeom2D(simpleGeometry, transform, opt_dest) {\n var flatCoordinates = simpleGeometry.getFlatCoordinates();\n if (!flatCoordinates) {\n return null;\n }\n else {\n var stride = simpleGeometry.getStride();\n return transform2D(flatCoordinates, 0, flatCoordinates.length, stride, transform, opt_dest);\n }\n}\nexport default SimpleGeometry;\n//# sourceMappingURL=SimpleGeometry.js.map","/**\n * @module ol/geom/flat/closest\n */\nimport { lerp, squaredDistance as squaredDx } from '../../math.js';\n/**\n * Returns the point on the 2D line segment flatCoordinates[offset1] to\n * flatCoordinates[offset2] that is closest to the point (x, y). Extra\n * dimensions are linearly interpolated.\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset1 Offset 1.\n * @param {number} offset2 Offset 2.\n * @param {number} stride Stride.\n * @param {number} x X.\n * @param {number} y Y.\n * @param {Array} closestPoint Closest point.\n */\nfunction assignClosest(flatCoordinates, offset1, offset2, stride, x, y, closestPoint) {\n var x1 = flatCoordinates[offset1];\n var y1 = flatCoordinates[offset1 + 1];\n var dx = flatCoordinates[offset2] - x1;\n var dy = flatCoordinates[offset2 + 1] - y1;\n var offset;\n if (dx === 0 && dy === 0) {\n offset = offset1;\n }\n else {\n var t = ((x - x1) * dx + (y - y1) * dy) / (dx * dx + dy * dy);\n if (t > 1) {\n offset = offset2;\n }\n else if (t > 0) {\n for (var i = 0; i < stride; ++i) {\n closestPoint[i] = lerp(flatCoordinates[offset1 + i], flatCoordinates[offset2 + i], t);\n }\n closestPoint.length = stride;\n return;\n }\n else {\n offset = offset1;\n }\n }\n for (var i = 0; i < stride; ++i) {\n closestPoint[i] = flatCoordinates[offset + i];\n }\n closestPoint.length = stride;\n}\n/**\n * Return the squared of the largest distance between any pair of consecutive\n * coordinates.\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {number} max Max squared delta.\n * @return {number} Max squared delta.\n */\nexport function maxSquaredDelta(flatCoordinates, offset, end, stride, max) {\n var x1 = flatCoordinates[offset];\n var y1 = flatCoordinates[offset + 1];\n for (offset += stride; offset < end; offset += stride) {\n var x2 = flatCoordinates[offset];\n var y2 = flatCoordinates[offset + 1];\n var squaredDelta = squaredDx(x1, y1, x2, y2);\n if (squaredDelta > max) {\n max = squaredDelta;\n }\n x1 = x2;\n y1 = y2;\n }\n return max;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Ends.\n * @param {number} stride Stride.\n * @param {number} max Max squared delta.\n * @return {number} Max squared delta.\n */\nexport function arrayMaxSquaredDelta(flatCoordinates, offset, ends, stride, max) {\n for (var i = 0, ii = ends.length; i < ii; ++i) {\n var end = ends[i];\n max = maxSquaredDelta(flatCoordinates, offset, end, stride, max);\n offset = end;\n }\n return max;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} endss Endss.\n * @param {number} stride Stride.\n * @param {number} max Max squared delta.\n * @return {number} Max squared delta.\n */\nexport function multiArrayMaxSquaredDelta(flatCoordinates, offset, endss, stride, max) {\n for (var i = 0, ii = endss.length; i < ii; ++i) {\n var ends = endss[i];\n max = arrayMaxSquaredDelta(flatCoordinates, offset, ends, stride, max);\n offset = ends[ends.length - 1];\n }\n return max;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {number} maxDelta Max delta.\n * @param {boolean} isRing Is ring.\n * @param {number} x X.\n * @param {number} y Y.\n * @param {Array} closestPoint Closest point.\n * @param {number} minSquaredDistance Minimum squared distance.\n * @param {Array} [opt_tmpPoint] Temporary point object.\n * @return {number} Minimum squared distance.\n */\nexport function assignClosestPoint(flatCoordinates, offset, end, stride, maxDelta, isRing, x, y, closestPoint, minSquaredDistance, opt_tmpPoint) {\n if (offset == end) {\n return minSquaredDistance;\n }\n var i, squaredDistance;\n if (maxDelta === 0) {\n // All points are identical, so just test the first point.\n squaredDistance = squaredDx(x, y, flatCoordinates[offset], flatCoordinates[offset + 1]);\n if (squaredDistance < minSquaredDistance) {\n for (i = 0; i < stride; ++i) {\n closestPoint[i] = flatCoordinates[offset + i];\n }\n closestPoint.length = stride;\n return squaredDistance;\n }\n else {\n return minSquaredDistance;\n }\n }\n var tmpPoint = opt_tmpPoint ? opt_tmpPoint : [NaN, NaN];\n var index = offset + stride;\n while (index < end) {\n assignClosest(flatCoordinates, index - stride, index, stride, x, y, tmpPoint);\n squaredDistance = squaredDx(x, y, tmpPoint[0], tmpPoint[1]);\n if (squaredDistance < minSquaredDistance) {\n minSquaredDistance = squaredDistance;\n for (i = 0; i < stride; ++i) {\n closestPoint[i] = tmpPoint[i];\n }\n closestPoint.length = stride;\n index += stride;\n }\n else {\n // Skip ahead multiple points, because we know that all the skipped\n // points cannot be any closer than the closest point we have found so\n // far. We know this because we know how close the current point is, how\n // close the closest point we have found so far is, and the maximum\n // distance between consecutive points. For example, if we're currently\n // at distance 10, the best we've found so far is 3, and that the maximum\n // distance between consecutive points is 2, then we'll need to skip at\n // least (10 - 3) / 2 == 3 (rounded down) points to have any chance of\n // finding a closer point. We use Math.max(..., 1) to ensure that we\n // always advance at least one point, to avoid an infinite loop.\n index +=\n stride *\n Math.max(((Math.sqrt(squaredDistance) - Math.sqrt(minSquaredDistance)) /\n maxDelta) |\n 0, 1);\n }\n }\n if (isRing) {\n // Check the closing segment.\n assignClosest(flatCoordinates, end - stride, offset, stride, x, y, tmpPoint);\n squaredDistance = squaredDx(x, y, tmpPoint[0], tmpPoint[1]);\n if (squaredDistance < minSquaredDistance) {\n minSquaredDistance = squaredDistance;\n for (i = 0; i < stride; ++i) {\n closestPoint[i] = tmpPoint[i];\n }\n closestPoint.length = stride;\n }\n }\n return minSquaredDistance;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Ends.\n * @param {number} stride Stride.\n * @param {number} maxDelta Max delta.\n * @param {boolean} isRing Is ring.\n * @param {number} x X.\n * @param {number} y Y.\n * @param {Array} closestPoint Closest point.\n * @param {number} minSquaredDistance Minimum squared distance.\n * @param {Array} [opt_tmpPoint] Temporary point object.\n * @return {number} Minimum squared distance.\n */\nexport function assignClosestArrayPoint(flatCoordinates, offset, ends, stride, maxDelta, isRing, x, y, closestPoint, minSquaredDistance, opt_tmpPoint) {\n var tmpPoint = opt_tmpPoint ? opt_tmpPoint : [NaN, NaN];\n for (var i = 0, ii = ends.length; i < ii; ++i) {\n var end = ends[i];\n minSquaredDistance = assignClosestPoint(flatCoordinates, offset, end, stride, maxDelta, isRing, x, y, closestPoint, minSquaredDistance, tmpPoint);\n offset = end;\n }\n return minSquaredDistance;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} endss Endss.\n * @param {number} stride Stride.\n * @param {number} maxDelta Max delta.\n * @param {boolean} isRing Is ring.\n * @param {number} x X.\n * @param {number} y Y.\n * @param {Array} closestPoint Closest point.\n * @param {number} minSquaredDistance Minimum squared distance.\n * @param {Array} [opt_tmpPoint] Temporary point object.\n * @return {number} Minimum squared distance.\n */\nexport function assignClosestMultiArrayPoint(flatCoordinates, offset, endss, stride, maxDelta, isRing, x, y, closestPoint, minSquaredDistance, opt_tmpPoint) {\n var tmpPoint = opt_tmpPoint ? opt_tmpPoint : [NaN, NaN];\n for (var i = 0, ii = endss.length; i < ii; ++i) {\n var ends = endss[i];\n minSquaredDistance = assignClosestArrayPoint(flatCoordinates, offset, ends, stride, maxDelta, isRing, x, y, closestPoint, minSquaredDistance, tmpPoint);\n offset = ends[ends.length - 1];\n }\n return minSquaredDistance;\n}\n//# sourceMappingURL=closest.js.map","/**\n * @module ol/geom/flat/deflate\n */\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {import(\"../../coordinate.js\").Coordinate} coordinate Coordinate.\n * @param {number} stride Stride.\n * @return {number} offset Offset.\n */\nexport function deflateCoordinate(flatCoordinates, offset, coordinate, stride) {\n for (var i = 0, ii = coordinate.length; i < ii; ++i) {\n flatCoordinates[offset++] = coordinate[i];\n }\n return offset;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} coordinates Coordinates.\n * @param {number} stride Stride.\n * @return {number} offset Offset.\n */\nexport function deflateCoordinates(flatCoordinates, offset, coordinates, stride) {\n for (var i = 0, ii = coordinates.length; i < ii; ++i) {\n var coordinate = coordinates[i];\n for (var j = 0; j < stride; ++j) {\n flatCoordinates[offset++] = coordinate[j];\n }\n }\n return offset;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} coordinatess Coordinatess.\n * @param {number} stride Stride.\n * @param {Array} [opt_ends] Ends.\n * @return {Array} Ends.\n */\nexport function deflateCoordinatesArray(flatCoordinates, offset, coordinatess, stride, opt_ends) {\n var ends = opt_ends ? opt_ends : [];\n var i = 0;\n for (var j = 0, jj = coordinatess.length; j < jj; ++j) {\n var end = deflateCoordinates(flatCoordinates, offset, coordinatess[j], stride);\n ends[i++] = end;\n offset = end;\n }\n ends.length = i;\n return ends;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>>} coordinatesss Coordinatesss.\n * @param {number} stride Stride.\n * @param {Array>} [opt_endss] Endss.\n * @return {Array>} Endss.\n */\nexport function deflateMultiCoordinatesArray(flatCoordinates, offset, coordinatesss, stride, opt_endss) {\n var endss = opt_endss ? opt_endss : [];\n var i = 0;\n for (var j = 0, jj = coordinatesss.length; j < jj; ++j) {\n var ends = deflateCoordinatesArray(flatCoordinates, offset, coordinatesss[j], stride, endss[i]);\n endss[i++] = ends;\n offset = ends[ends.length - 1];\n }\n endss.length = i;\n return endss;\n}\n//# sourceMappingURL=deflate.js.map","/**\n * @module ol/geom/flat/simplify\n */\n// Based on simplify-js https://github.com/mourner/simplify-js\n// Copyright (c) 2012, Vladimir Agafonkin\n// All rights reserved.\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are met:\n//\n// 1. Redistributions of source code must retain the above copyright notice,\n// this list of conditions and the following disclaimer.\n//\n// 2. Redistributions in binary form must reproduce the above copyright\n// notice, this list of conditions and the following disclaimer in the\n// documentation and/or other materials provided with the distribution.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n// POSSIBILITY OF SUCH DAMAGE.\nimport { squaredDistance, squaredSegmentDistance } from '../../math.js';\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {number} squaredTolerance Squared tolerance.\n * @param {boolean} highQuality Highest quality.\n * @param {Array} [opt_simplifiedFlatCoordinates] Simplified flat\n * coordinates.\n * @return {Array} Simplified line string.\n */\nexport function simplifyLineString(flatCoordinates, offset, end, stride, squaredTolerance, highQuality, opt_simplifiedFlatCoordinates) {\n var simplifiedFlatCoordinates = opt_simplifiedFlatCoordinates !== undefined\n ? opt_simplifiedFlatCoordinates\n : [];\n if (!highQuality) {\n end = radialDistance(flatCoordinates, offset, end, stride, squaredTolerance, simplifiedFlatCoordinates, 0);\n flatCoordinates = simplifiedFlatCoordinates;\n offset = 0;\n stride = 2;\n }\n simplifiedFlatCoordinates.length = douglasPeucker(flatCoordinates, offset, end, stride, squaredTolerance, simplifiedFlatCoordinates, 0);\n return simplifiedFlatCoordinates;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {number} squaredTolerance Squared tolerance.\n * @param {Array} simplifiedFlatCoordinates Simplified flat\n * coordinates.\n * @param {number} simplifiedOffset Simplified offset.\n * @return {number} Simplified offset.\n */\nexport function douglasPeucker(flatCoordinates, offset, end, stride, squaredTolerance, simplifiedFlatCoordinates, simplifiedOffset) {\n var n = (end - offset) / stride;\n if (n < 3) {\n for (; offset < end; offset += stride) {\n simplifiedFlatCoordinates[simplifiedOffset++] = flatCoordinates[offset];\n simplifiedFlatCoordinates[simplifiedOffset++] =\n flatCoordinates[offset + 1];\n }\n return simplifiedOffset;\n }\n /** @type {Array} */\n var markers = new Array(n);\n markers[0] = 1;\n markers[n - 1] = 1;\n /** @type {Array} */\n var stack = [offset, end - stride];\n var index = 0;\n while (stack.length > 0) {\n var last = stack.pop();\n var first = stack.pop();\n var maxSquaredDistance = 0;\n var x1 = flatCoordinates[first];\n var y1 = flatCoordinates[first + 1];\n var x2 = flatCoordinates[last];\n var y2 = flatCoordinates[last + 1];\n for (var i = first + stride; i < last; i += stride) {\n var x = flatCoordinates[i];\n var y = flatCoordinates[i + 1];\n var squaredDistance_1 = squaredSegmentDistance(x, y, x1, y1, x2, y2);\n if (squaredDistance_1 > maxSquaredDistance) {\n index = i;\n maxSquaredDistance = squaredDistance_1;\n }\n }\n if (maxSquaredDistance > squaredTolerance) {\n markers[(index - offset) / stride] = 1;\n if (first + stride < index) {\n stack.push(first, index);\n }\n if (index + stride < last) {\n stack.push(index, last);\n }\n }\n }\n for (var i = 0; i < n; ++i) {\n if (markers[i]) {\n simplifiedFlatCoordinates[simplifiedOffset++] =\n flatCoordinates[offset + i * stride];\n simplifiedFlatCoordinates[simplifiedOffset++] =\n flatCoordinates[offset + i * stride + 1];\n }\n }\n return simplifiedOffset;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Ends.\n * @param {number} stride Stride.\n * @param {number} squaredTolerance Squared tolerance.\n * @param {Array} simplifiedFlatCoordinates Simplified flat\n * coordinates.\n * @param {number} simplifiedOffset Simplified offset.\n * @param {Array} simplifiedEnds Simplified ends.\n * @return {number} Simplified offset.\n */\nexport function douglasPeuckerArray(flatCoordinates, offset, ends, stride, squaredTolerance, simplifiedFlatCoordinates, simplifiedOffset, simplifiedEnds) {\n for (var i = 0, ii = ends.length; i < ii; ++i) {\n var end = ends[i];\n simplifiedOffset = douglasPeucker(flatCoordinates, offset, end, stride, squaredTolerance, simplifiedFlatCoordinates, simplifiedOffset);\n simplifiedEnds.push(simplifiedOffset);\n offset = end;\n }\n return simplifiedOffset;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} endss Endss.\n * @param {number} stride Stride.\n * @param {number} squaredTolerance Squared tolerance.\n * @param {Array} simplifiedFlatCoordinates Simplified flat\n * coordinates.\n * @param {number} simplifiedOffset Simplified offset.\n * @param {Array>} simplifiedEndss Simplified endss.\n * @return {number} Simplified offset.\n */\nexport function douglasPeuckerMultiArray(flatCoordinates, offset, endss, stride, squaredTolerance, simplifiedFlatCoordinates, simplifiedOffset, simplifiedEndss) {\n for (var i = 0, ii = endss.length; i < ii; ++i) {\n var ends = endss[i];\n var simplifiedEnds = [];\n simplifiedOffset = douglasPeuckerArray(flatCoordinates, offset, ends, stride, squaredTolerance, simplifiedFlatCoordinates, simplifiedOffset, simplifiedEnds);\n simplifiedEndss.push(simplifiedEnds);\n offset = ends[ends.length - 1];\n }\n return simplifiedOffset;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {number} squaredTolerance Squared tolerance.\n * @param {Array} simplifiedFlatCoordinates Simplified flat\n * coordinates.\n * @param {number} simplifiedOffset Simplified offset.\n * @return {number} Simplified offset.\n */\nexport function radialDistance(flatCoordinates, offset, end, stride, squaredTolerance, simplifiedFlatCoordinates, simplifiedOffset) {\n if (end <= offset + stride) {\n // zero or one point, no simplification possible, so copy and return\n for (; offset < end; offset += stride) {\n simplifiedFlatCoordinates[simplifiedOffset++] = flatCoordinates[offset];\n simplifiedFlatCoordinates[simplifiedOffset++] =\n flatCoordinates[offset + 1];\n }\n return simplifiedOffset;\n }\n var x1 = flatCoordinates[offset];\n var y1 = flatCoordinates[offset + 1];\n // copy first point\n simplifiedFlatCoordinates[simplifiedOffset++] = x1;\n simplifiedFlatCoordinates[simplifiedOffset++] = y1;\n var x2 = x1;\n var y2 = y1;\n for (offset += stride; offset < end; offset += stride) {\n x2 = flatCoordinates[offset];\n y2 = flatCoordinates[offset + 1];\n if (squaredDistance(x1, y1, x2, y2) > squaredTolerance) {\n // copy point at offset\n simplifiedFlatCoordinates[simplifiedOffset++] = x2;\n simplifiedFlatCoordinates[simplifiedOffset++] = y2;\n x1 = x2;\n y1 = y2;\n }\n }\n if (x2 != x1 || y2 != y1) {\n // copy last point\n simplifiedFlatCoordinates[simplifiedOffset++] = x2;\n simplifiedFlatCoordinates[simplifiedOffset++] = y2;\n }\n return simplifiedOffset;\n}\n/**\n * @param {number} value Value.\n * @param {number} tolerance Tolerance.\n * @return {number} Rounded value.\n */\nexport function snap(value, tolerance) {\n return tolerance * Math.round(value / tolerance);\n}\n/**\n * Simplifies a line string using an algorithm designed by Tim Schaub.\n * Coordinates are snapped to the nearest value in a virtual grid and\n * consecutive duplicate coordinates are discarded. This effectively preserves\n * topology as the simplification of any subsection of a line string is\n * independent of the rest of the line string. This means that, for examples,\n * the common edge between two polygons will be simplified to the same line\n * string independently in both polygons. This implementation uses a single\n * pass over the coordinates and eliminates intermediate collinear points.\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {number} tolerance Tolerance.\n * @param {Array} simplifiedFlatCoordinates Simplified flat\n * coordinates.\n * @param {number} simplifiedOffset Simplified offset.\n * @return {number} Simplified offset.\n */\nexport function quantize(flatCoordinates, offset, end, stride, tolerance, simplifiedFlatCoordinates, simplifiedOffset) {\n // do nothing if the line is empty\n if (offset == end) {\n return simplifiedOffset;\n }\n // snap the first coordinate (P1)\n var x1 = snap(flatCoordinates[offset], tolerance);\n var y1 = snap(flatCoordinates[offset + 1], tolerance);\n offset += stride;\n // add the first coordinate to the output\n simplifiedFlatCoordinates[simplifiedOffset++] = x1;\n simplifiedFlatCoordinates[simplifiedOffset++] = y1;\n // find the next coordinate that does not snap to the same value as the first\n // coordinate (P2)\n var x2, y2;\n do {\n x2 = snap(flatCoordinates[offset], tolerance);\n y2 = snap(flatCoordinates[offset + 1], tolerance);\n offset += stride;\n if (offset == end) {\n // all coordinates snap to the same value, the line collapses to a point\n // push the last snapped value anyway to ensure that the output contains\n // at least two points\n // FIXME should we really return at least two points anyway?\n simplifiedFlatCoordinates[simplifiedOffset++] = x2;\n simplifiedFlatCoordinates[simplifiedOffset++] = y2;\n return simplifiedOffset;\n }\n } while (x2 == x1 && y2 == y1);\n while (offset < end) {\n // snap the next coordinate (P3)\n var x3 = snap(flatCoordinates[offset], tolerance);\n var y3 = snap(flatCoordinates[offset + 1], tolerance);\n offset += stride;\n // skip P3 if it is equal to P2\n if (x3 == x2 && y3 == y2) {\n continue;\n }\n // calculate the delta between P1 and P2\n var dx1 = x2 - x1;\n var dy1 = y2 - y1;\n // calculate the delta between P3 and P1\n var dx2 = x3 - x1;\n var dy2 = y3 - y1;\n // if P1, P2, and P3 are colinear and P3 is further from P1 than P2 is from\n // P1 in the same direction then P2 is on the straight line between P1 and\n // P3\n if (dx1 * dy2 == dy1 * dx2 &&\n ((dx1 < 0 && dx2 < dx1) || dx1 == dx2 || (dx1 > 0 && dx2 > dx1)) &&\n ((dy1 < 0 && dy2 < dy1) || dy1 == dy2 || (dy1 > 0 && dy2 > dy1))) {\n // discard P2 and set P2 = P3\n x2 = x3;\n y2 = y3;\n continue;\n }\n // either P1, P2, and P3 are not colinear, or they are colinear but P3 is\n // between P3 and P1 or on the opposite half of the line to P2. add P2,\n // and continue with P1 = P2 and P2 = P3\n simplifiedFlatCoordinates[simplifiedOffset++] = x2;\n simplifiedFlatCoordinates[simplifiedOffset++] = y2;\n x1 = x2;\n y1 = y2;\n x2 = x3;\n y2 = y3;\n }\n // add the last point (P2)\n simplifiedFlatCoordinates[simplifiedOffset++] = x2;\n simplifiedFlatCoordinates[simplifiedOffset++] = y2;\n return simplifiedOffset;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Ends.\n * @param {number} stride Stride.\n * @param {number} tolerance Tolerance.\n * @param {Array} simplifiedFlatCoordinates Simplified flat\n * coordinates.\n * @param {number} simplifiedOffset Simplified offset.\n * @param {Array} simplifiedEnds Simplified ends.\n * @return {number} Simplified offset.\n */\nexport function quantizeArray(flatCoordinates, offset, ends, stride, tolerance, simplifiedFlatCoordinates, simplifiedOffset, simplifiedEnds) {\n for (var i = 0, ii = ends.length; i < ii; ++i) {\n var end = ends[i];\n simplifiedOffset = quantize(flatCoordinates, offset, end, stride, tolerance, simplifiedFlatCoordinates, simplifiedOffset);\n simplifiedEnds.push(simplifiedOffset);\n offset = end;\n }\n return simplifiedOffset;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} endss Endss.\n * @param {number} stride Stride.\n * @param {number} tolerance Tolerance.\n * @param {Array} simplifiedFlatCoordinates Simplified flat\n * coordinates.\n * @param {number} simplifiedOffset Simplified offset.\n * @param {Array>} simplifiedEndss Simplified endss.\n * @return {number} Simplified offset.\n */\nexport function quantizeMultiArray(flatCoordinates, offset, endss, stride, tolerance, simplifiedFlatCoordinates, simplifiedOffset, simplifiedEndss) {\n for (var i = 0, ii = endss.length; i < ii; ++i) {\n var ends = endss[i];\n var simplifiedEnds = [];\n simplifiedOffset = quantizeArray(flatCoordinates, offset, ends, stride, tolerance, simplifiedFlatCoordinates, simplifiedOffset, simplifiedEnds);\n simplifiedEndss.push(simplifiedEnds);\n offset = ends[ends.length - 1];\n }\n return simplifiedOffset;\n}\n//# sourceMappingURL=simplify.js.map","/**\n * @module ol/geom/flat/inflate\n */\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {Array} [opt_coordinates] Coordinates.\n * @return {Array} Coordinates.\n */\nexport function inflateCoordinates(flatCoordinates, offset, end, stride, opt_coordinates) {\n var coordinates = opt_coordinates !== undefined ? opt_coordinates : [];\n var i = 0;\n for (var j = offset; j < end; j += stride) {\n coordinates[i++] = flatCoordinates.slice(j, j + stride);\n }\n coordinates.length = i;\n return coordinates;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Ends.\n * @param {number} stride Stride.\n * @param {Array>} [opt_coordinatess] Coordinatess.\n * @return {Array>} Coordinatess.\n */\nexport function inflateCoordinatesArray(flatCoordinates, offset, ends, stride, opt_coordinatess) {\n var coordinatess = opt_coordinatess !== undefined ? opt_coordinatess : [];\n var i = 0;\n for (var j = 0, jj = ends.length; j < jj; ++j) {\n var end = ends[j];\n coordinatess[i++] = inflateCoordinates(flatCoordinates, offset, end, stride, coordinatess[i]);\n offset = end;\n }\n coordinatess.length = i;\n return coordinatess;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} endss Endss.\n * @param {number} stride Stride.\n * @param {Array>>} [opt_coordinatesss]\n * Coordinatesss.\n * @return {Array>>} Coordinatesss.\n */\nexport function inflateMultiCoordinatesArray(flatCoordinates, offset, endss, stride, opt_coordinatesss) {\n var coordinatesss = opt_coordinatesss !== undefined ? opt_coordinatesss : [];\n var i = 0;\n for (var j = 0, jj = endss.length; j < jj; ++j) {\n var ends = endss[j];\n coordinatesss[i++] = inflateCoordinatesArray(flatCoordinates, offset, ends, stride, coordinatesss[i]);\n offset = ends[ends.length - 1];\n }\n coordinatesss.length = i;\n return coordinatesss;\n}\n//# sourceMappingURL=inflate.js.map","/**\n * @module ol/geom/flat/area\n */\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @return {number} Area.\n */\nexport function linearRing(flatCoordinates, offset, end, stride) {\n var twiceArea = 0;\n var x1 = flatCoordinates[end - stride];\n var y1 = flatCoordinates[end - stride + 1];\n for (; offset < end; offset += stride) {\n var x2 = flatCoordinates[offset];\n var y2 = flatCoordinates[offset + 1];\n twiceArea += y1 * x2 - x1 * y2;\n x1 = x2;\n y1 = y2;\n }\n return twiceArea / 2;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Ends.\n * @param {number} stride Stride.\n * @return {number} Area.\n */\nexport function linearRings(flatCoordinates, offset, ends, stride) {\n var area = 0;\n for (var i = 0, ii = ends.length; i < ii; ++i) {\n var end = ends[i];\n area += linearRing(flatCoordinates, offset, end, stride);\n offset = end;\n }\n return area;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} endss Endss.\n * @param {number} stride Stride.\n * @return {number} Area.\n */\nexport function linearRingss(flatCoordinates, offset, endss, stride) {\n var area = 0;\n for (var i = 0, ii = endss.length; i < ii; ++i) {\n var ends = endss[i];\n area += linearRings(flatCoordinates, offset, ends, stride);\n offset = ends[ends.length - 1];\n }\n return area;\n}\n//# sourceMappingURL=area.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/geom/LinearRing\n */\nimport GeometryLayout from './GeometryLayout.js';\nimport GeometryType from './GeometryType.js';\nimport SimpleGeometry from './SimpleGeometry.js';\nimport { assignClosestPoint, maxSquaredDelta } from './flat/closest.js';\nimport { closestSquaredDistanceXY } from '../extent.js';\nimport { deflateCoordinates } from './flat/deflate.js';\nimport { douglasPeucker } from './flat/simplify.js';\nimport { inflateCoordinates } from './flat/inflate.js';\nimport { linearRing as linearRingArea } from './flat/area.js';\n/**\n * @classdesc\n * Linear ring geometry. Only used as part of polygon; cannot be rendered\n * on its own.\n *\n * @api\n */\nvar LinearRing = /** @class */ (function (_super) {\n __extends(LinearRing, _super);\n /**\n * @param {Array|Array} coordinates Coordinates.\n * For internal use, flat coordinates in combination with `opt_layout` are also accepted.\n * @param {import(\"./GeometryLayout.js\").default} [opt_layout] Layout.\n */\n function LinearRing(coordinates, opt_layout) {\n var _this = _super.call(this) || this;\n /**\n * @private\n * @type {number}\n */\n _this.maxDelta_ = -1;\n /**\n * @private\n * @type {number}\n */\n _this.maxDeltaRevision_ = -1;\n if (opt_layout !== undefined && !Array.isArray(coordinates[0])) {\n _this.setFlatCoordinates(opt_layout, \n /** @type {Array} */ (coordinates));\n }\n else {\n _this.setCoordinates(\n /** @type {Array} */ (coordinates), opt_layout);\n }\n return _this;\n }\n /**\n * Make a complete copy of the geometry.\n * @return {!LinearRing} Clone.\n * @api\n */\n LinearRing.prototype.clone = function () {\n return new LinearRing(this.flatCoordinates.slice(), this.layout);\n };\n /**\n * @param {number} x X.\n * @param {number} y Y.\n * @param {import(\"../coordinate.js\").Coordinate} closestPoint Closest point.\n * @param {number} minSquaredDistance Minimum squared distance.\n * @return {number} Minimum squared distance.\n */\n LinearRing.prototype.closestPointXY = function (x, y, closestPoint, minSquaredDistance) {\n if (minSquaredDistance < closestSquaredDistanceXY(this.getExtent(), x, y)) {\n return minSquaredDistance;\n }\n if (this.maxDeltaRevision_ != this.getRevision()) {\n this.maxDelta_ = Math.sqrt(maxSquaredDelta(this.flatCoordinates, 0, this.flatCoordinates.length, this.stride, 0));\n this.maxDeltaRevision_ = this.getRevision();\n }\n return assignClosestPoint(this.flatCoordinates, 0, this.flatCoordinates.length, this.stride, this.maxDelta_, true, x, y, closestPoint, minSquaredDistance);\n };\n /**\n * Return the area of the linear ring on projected plane.\n * @return {number} Area (on projected plane).\n * @api\n */\n LinearRing.prototype.getArea = function () {\n return linearRingArea(this.flatCoordinates, 0, this.flatCoordinates.length, this.stride);\n };\n /**\n * Return the coordinates of the linear ring.\n * @return {Array} Coordinates.\n * @api\n */\n LinearRing.prototype.getCoordinates = function () {\n return inflateCoordinates(this.flatCoordinates, 0, this.flatCoordinates.length, this.stride);\n };\n /**\n * @param {number} squaredTolerance Squared tolerance.\n * @return {LinearRing} Simplified LinearRing.\n * @protected\n */\n LinearRing.prototype.getSimplifiedGeometryInternal = function (squaredTolerance) {\n var simplifiedFlatCoordinates = [];\n simplifiedFlatCoordinates.length = douglasPeucker(this.flatCoordinates, 0, this.flatCoordinates.length, this.stride, squaredTolerance, simplifiedFlatCoordinates, 0);\n return new LinearRing(simplifiedFlatCoordinates, GeometryLayout.XY);\n };\n /**\n * Get the type of this geometry.\n * @return {import(\"./GeometryType.js\").default} Geometry type.\n * @api\n */\n LinearRing.prototype.getType = function () {\n return GeometryType.LINEAR_RING;\n };\n /**\n * Test if the geometry and the passed extent intersect.\n * @param {import(\"../extent.js\").Extent} extent Extent.\n * @return {boolean} `true` if the geometry and the extent intersect.\n * @api\n */\n LinearRing.prototype.intersectsExtent = function (extent) {\n return false;\n };\n /**\n * Set the coordinates of the linear ring.\n * @param {!Array} coordinates Coordinates.\n * @param {import(\"./GeometryLayout.js\").default} [opt_layout] Layout.\n * @api\n */\n LinearRing.prototype.setCoordinates = function (coordinates, opt_layout) {\n this.setLayout(opt_layout, coordinates, 1);\n if (!this.flatCoordinates) {\n this.flatCoordinates = [];\n }\n this.flatCoordinates.length = deflateCoordinates(this.flatCoordinates, 0, coordinates, this.stride);\n this.changed();\n };\n return LinearRing;\n}(SimpleGeometry));\nexport default LinearRing;\n//# sourceMappingURL=LinearRing.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/geom/Point\n */\nimport GeometryType from './GeometryType.js';\nimport SimpleGeometry from './SimpleGeometry.js';\nimport { containsXY, createOrUpdateFromCoordinate } from '../extent.js';\nimport { deflateCoordinate } from './flat/deflate.js';\nimport { squaredDistance as squaredDx } from '../math.js';\n/**\n * @classdesc\n * Point geometry.\n *\n * @api\n */\nvar Point = /** @class */ (function (_super) {\n __extends(Point, _super);\n /**\n * @param {import(\"../coordinate.js\").Coordinate} coordinates Coordinates.\n * @param {import(\"./GeometryLayout.js\").default} [opt_layout] Layout.\n */\n function Point(coordinates, opt_layout) {\n var _this = _super.call(this) || this;\n _this.setCoordinates(coordinates, opt_layout);\n return _this;\n }\n /**\n * Make a complete copy of the geometry.\n * @return {!Point} Clone.\n * @api\n */\n Point.prototype.clone = function () {\n var point = new Point(this.flatCoordinates.slice(), this.layout);\n point.applyProperties(this);\n return point;\n };\n /**\n * @param {number} x X.\n * @param {number} y Y.\n * @param {import(\"../coordinate.js\").Coordinate} closestPoint Closest point.\n * @param {number} minSquaredDistance Minimum squared distance.\n * @return {number} Minimum squared distance.\n */\n Point.prototype.closestPointXY = function (x, y, closestPoint, minSquaredDistance) {\n var flatCoordinates = this.flatCoordinates;\n var squaredDistance = squaredDx(x, y, flatCoordinates[0], flatCoordinates[1]);\n if (squaredDistance < minSquaredDistance) {\n var stride = this.stride;\n for (var i = 0; i < stride; ++i) {\n closestPoint[i] = flatCoordinates[i];\n }\n closestPoint.length = stride;\n return squaredDistance;\n }\n else {\n return minSquaredDistance;\n }\n };\n /**\n * Return the coordinate of the point.\n * @return {import(\"../coordinate.js\").Coordinate} Coordinates.\n * @api\n */\n Point.prototype.getCoordinates = function () {\n return !this.flatCoordinates ? [] : this.flatCoordinates.slice();\n };\n /**\n * @param {import(\"../extent.js\").Extent} extent Extent.\n * @protected\n * @return {import(\"../extent.js\").Extent} extent Extent.\n */\n Point.prototype.computeExtent = function (extent) {\n return createOrUpdateFromCoordinate(this.flatCoordinates, extent);\n };\n /**\n * Get the type of this geometry.\n * @return {import(\"./GeometryType.js\").default} Geometry type.\n * @api\n */\n Point.prototype.getType = function () {\n return GeometryType.POINT;\n };\n /**\n * Test if the geometry and the passed extent intersect.\n * @param {import(\"../extent.js\").Extent} extent Extent.\n * @return {boolean} `true` if the geometry and the extent intersect.\n * @api\n */\n Point.prototype.intersectsExtent = function (extent) {\n return containsXY(extent, this.flatCoordinates[0], this.flatCoordinates[1]);\n };\n /**\n * @param {!Array<*>} coordinates Coordinates.\n * @param {import(\"./GeometryLayout.js\").default} [opt_layout] Layout.\n * @api\n */\n Point.prototype.setCoordinates = function (coordinates, opt_layout) {\n this.setLayout(opt_layout, coordinates, 0);\n if (!this.flatCoordinates) {\n this.flatCoordinates = [];\n }\n this.flatCoordinates.length = deflateCoordinate(this.flatCoordinates, 0, coordinates, this.stride);\n this.changed();\n };\n return Point;\n}(SimpleGeometry));\nexport default Point;\n//# sourceMappingURL=Point.js.map","/**\n * @module ol/geom/flat/contains\n */\nimport { forEachCorner } from '../../extent.js';\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {import(\"../../extent.js\").Extent} extent Extent.\n * @return {boolean} Contains extent.\n */\nexport function linearRingContainsExtent(flatCoordinates, offset, end, stride, extent) {\n var outside = forEachCorner(extent, \n /**\n * @param {import(\"../../coordinate.js\").Coordinate} coordinate Coordinate.\n * @return {boolean} Contains (x, y).\n */\n function (coordinate) {\n return !linearRingContainsXY(flatCoordinates, offset, end, stride, coordinate[0], coordinate[1]);\n });\n return !outside;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {number} x X.\n * @param {number} y Y.\n * @return {boolean} Contains (x, y).\n */\nexport function linearRingContainsXY(flatCoordinates, offset, end, stride, x, y) {\n // https://geomalgorithms.com/a03-_inclusion.html\n // Copyright 2000 softSurfer, 2012 Dan Sunday\n // This code may be freely used and modified for any purpose\n // providing that this copyright notice is included with it.\n // SoftSurfer makes no warranty for this code, and cannot be held\n // liable for any real or imagined damage resulting from its use.\n // Users of this code must verify correctness for their application.\n var wn = 0;\n var x1 = flatCoordinates[end - stride];\n var y1 = flatCoordinates[end - stride + 1];\n for (; offset < end; offset += stride) {\n var x2 = flatCoordinates[offset];\n var y2 = flatCoordinates[offset + 1];\n if (y1 <= y) {\n if (y2 > y && (x2 - x1) * (y - y1) - (x - x1) * (y2 - y1) > 0) {\n wn++;\n }\n }\n else if (y2 <= y && (x2 - x1) * (y - y1) - (x - x1) * (y2 - y1) < 0) {\n wn--;\n }\n x1 = x2;\n y1 = y2;\n }\n return wn !== 0;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Ends.\n * @param {number} stride Stride.\n * @param {number} x X.\n * @param {number} y Y.\n * @return {boolean} Contains (x, y).\n */\nexport function linearRingsContainsXY(flatCoordinates, offset, ends, stride, x, y) {\n if (ends.length === 0) {\n return false;\n }\n if (!linearRingContainsXY(flatCoordinates, offset, ends[0], stride, x, y)) {\n return false;\n }\n for (var i = 1, ii = ends.length; i < ii; ++i) {\n if (linearRingContainsXY(flatCoordinates, ends[i - 1], ends[i], stride, x, y)) {\n return false;\n }\n }\n return true;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} endss Endss.\n * @param {number} stride Stride.\n * @param {number} x X.\n * @param {number} y Y.\n * @return {boolean} Contains (x, y).\n */\nexport function linearRingssContainsXY(flatCoordinates, offset, endss, stride, x, y) {\n if (endss.length === 0) {\n return false;\n }\n for (var i = 0, ii = endss.length; i < ii; ++i) {\n var ends = endss[i];\n if (linearRingsContainsXY(flatCoordinates, offset, ends, stride, x, y)) {\n return true;\n }\n offset = ends[ends.length - 1];\n }\n return false;\n}\n//# sourceMappingURL=contains.js.map","/**\n * @module ol/geom/flat/interiorpoint\n */\nimport { linearRingsContainsXY } from './contains.js';\nimport { numberSafeCompareFunction } from '../../array.js';\n/**\n * Calculates a point that is likely to lie in the interior of the linear rings.\n * Inspired by JTS's com.vividsolutions.jts.geom.Geometry#getInteriorPoint.\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Ends.\n * @param {number} stride Stride.\n * @param {Array} flatCenters Flat centers.\n * @param {number} flatCentersOffset Flat center offset.\n * @param {Array} [opt_dest] Destination.\n * @return {Array} Destination point as XYM coordinate, where M is the\n * length of the horizontal intersection that the point belongs to.\n */\nexport function getInteriorPointOfArray(flatCoordinates, offset, ends, stride, flatCenters, flatCentersOffset, opt_dest) {\n var i, ii, x, x1, x2, y1, y2;\n var y = flatCenters[flatCentersOffset + 1];\n /** @type {Array} */\n var intersections = [];\n // Calculate intersections with the horizontal line\n for (var r = 0, rr = ends.length; r < rr; ++r) {\n var end = ends[r];\n x1 = flatCoordinates[end - stride];\n y1 = flatCoordinates[end - stride + 1];\n for (i = offset; i < end; i += stride) {\n x2 = flatCoordinates[i];\n y2 = flatCoordinates[i + 1];\n if ((y <= y1 && y2 <= y) || (y1 <= y && y <= y2)) {\n x = ((y - y1) / (y2 - y1)) * (x2 - x1) + x1;\n intersections.push(x);\n }\n x1 = x2;\n y1 = y2;\n }\n }\n // Find the longest segment of the horizontal line that has its center point\n // inside the linear ring.\n var pointX = NaN;\n var maxSegmentLength = -Infinity;\n intersections.sort(numberSafeCompareFunction);\n x1 = intersections[0];\n for (i = 1, ii = intersections.length; i < ii; ++i) {\n x2 = intersections[i];\n var segmentLength = Math.abs(x2 - x1);\n if (segmentLength > maxSegmentLength) {\n x = (x1 + x2) / 2;\n if (linearRingsContainsXY(flatCoordinates, offset, ends, stride, x, y)) {\n pointX = x;\n maxSegmentLength = segmentLength;\n }\n }\n x1 = x2;\n }\n if (isNaN(pointX)) {\n // There is no horizontal line that has its center point inside the linear\n // ring. Use the center of the the linear ring's extent.\n pointX = flatCenters[flatCentersOffset];\n }\n if (opt_dest) {\n opt_dest.push(pointX, y, maxSegmentLength);\n return opt_dest;\n }\n else {\n return [pointX, y, maxSegmentLength];\n }\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} endss Endss.\n * @param {number} stride Stride.\n * @param {Array} flatCenters Flat centers.\n * @return {Array} Interior points as XYM coordinates, where M is the\n * length of the horizontal intersection that the point belongs to.\n */\nexport function getInteriorPointsOfMultiArray(flatCoordinates, offset, endss, stride, flatCenters) {\n var interiorPoints = [];\n for (var i = 0, ii = endss.length; i < ii; ++i) {\n var ends = endss[i];\n interiorPoints = getInteriorPointOfArray(flatCoordinates, offset, ends, stride, flatCenters, 2 * i, interiorPoints);\n offset = ends[ends.length - 1];\n }\n return interiorPoints;\n}\n//# sourceMappingURL=interiorpoint.js.map","/**\n * @module ol/geom/flat/intersectsextent\n */\nimport { containsExtent, createEmpty, extendFlatCoordinates, intersects, intersectsSegment, } from '../../extent.js';\nimport { forEach as forEachSegment } from './segments.js';\nimport { linearRingContainsExtent, linearRingContainsXY } from './contains.js';\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {import(\"../../extent.js\").Extent} extent Extent.\n * @return {boolean} True if the geometry and the extent intersect.\n */\nexport function intersectsLineString(flatCoordinates, offset, end, stride, extent) {\n var coordinatesExtent = extendFlatCoordinates(createEmpty(), flatCoordinates, offset, end, stride);\n if (!intersects(extent, coordinatesExtent)) {\n return false;\n }\n if (containsExtent(extent, coordinatesExtent)) {\n return true;\n }\n if (coordinatesExtent[0] >= extent[0] && coordinatesExtent[2] <= extent[2]) {\n return true;\n }\n if (coordinatesExtent[1] >= extent[1] && coordinatesExtent[3] <= extent[3]) {\n return true;\n }\n return forEachSegment(flatCoordinates, offset, end, stride, \n /**\n * @param {import(\"../../coordinate.js\").Coordinate} point1 Start point.\n * @param {import(\"../../coordinate.js\").Coordinate} point2 End point.\n * @return {boolean} `true` if the segment and the extent intersect,\n * `false` otherwise.\n */\n function (point1, point2) {\n return intersectsSegment(extent, point1, point2);\n });\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Ends.\n * @param {number} stride Stride.\n * @param {import(\"../../extent.js\").Extent} extent Extent.\n * @return {boolean} True if the geometry and the extent intersect.\n */\nexport function intersectsLineStringArray(flatCoordinates, offset, ends, stride, extent) {\n for (var i = 0, ii = ends.length; i < ii; ++i) {\n if (intersectsLineString(flatCoordinates, offset, ends[i], stride, extent)) {\n return true;\n }\n offset = ends[i];\n }\n return false;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {import(\"../../extent.js\").Extent} extent Extent.\n * @return {boolean} True if the geometry and the extent intersect.\n */\nexport function intersectsLinearRing(flatCoordinates, offset, end, stride, extent) {\n if (intersectsLineString(flatCoordinates, offset, end, stride, extent)) {\n return true;\n }\n if (linearRingContainsXY(flatCoordinates, offset, end, stride, extent[0], extent[1])) {\n return true;\n }\n if (linearRingContainsXY(flatCoordinates, offset, end, stride, extent[0], extent[3])) {\n return true;\n }\n if (linearRingContainsXY(flatCoordinates, offset, end, stride, extent[2], extent[1])) {\n return true;\n }\n if (linearRingContainsXY(flatCoordinates, offset, end, stride, extent[2], extent[3])) {\n return true;\n }\n return false;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Ends.\n * @param {number} stride Stride.\n * @param {import(\"../../extent.js\").Extent} extent Extent.\n * @return {boolean} True if the geometry and the extent intersect.\n */\nexport function intersectsLinearRingArray(flatCoordinates, offset, ends, stride, extent) {\n if (!intersectsLinearRing(flatCoordinates, offset, ends[0], stride, extent)) {\n return false;\n }\n if (ends.length === 1) {\n return true;\n }\n for (var i = 1, ii = ends.length; i < ii; ++i) {\n if (linearRingContainsExtent(flatCoordinates, ends[i - 1], ends[i], stride, extent)) {\n if (!intersectsLineString(flatCoordinates, ends[i - 1], ends[i], stride, extent)) {\n return false;\n }\n }\n }\n return true;\n}\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} endss Endss.\n * @param {number} stride Stride.\n * @param {import(\"../../extent.js\").Extent} extent Extent.\n * @return {boolean} True if the geometry and the extent intersect.\n */\nexport function intersectsLinearRingMultiArray(flatCoordinates, offset, endss, stride, extent) {\n for (var i = 0, ii = endss.length; i < ii; ++i) {\n var ends = endss[i];\n if (intersectsLinearRingArray(flatCoordinates, offset, ends, stride, extent)) {\n return true;\n }\n offset = ends[ends.length - 1];\n }\n return false;\n}\n//# sourceMappingURL=intersectsextent.js.map","/**\n * @module ol/geom/flat/segments\n */\n/**\n * This function calls `callback` for each segment of the flat coordinates\n * array. If the callback returns a truthy value the function returns that\n * value immediately. Otherwise the function returns `false`.\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @param {function(import(\"../../coordinate.js\").Coordinate, import(\"../../coordinate.js\").Coordinate): T} callback Function\n * called for each segment.\n * @return {T|boolean} Value.\n * @template T\n */\nexport function forEach(flatCoordinates, offset, end, stride, callback) {\n var ret;\n offset += stride;\n for (; offset < end; offset += stride) {\n ret = callback(flatCoordinates.slice(offset - stride, offset), flatCoordinates.slice(offset, offset + stride));\n if (ret) {\n return ret;\n }\n }\n return false;\n}\n//# sourceMappingURL=segments.js.map","/**\n * @module ol/geom/flat/reverse\n */\n/**\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n */\nexport function coordinates(flatCoordinates, offset, end, stride) {\n while (offset < end - stride) {\n for (var i = 0; i < stride; ++i) {\n var tmp = flatCoordinates[offset + i];\n flatCoordinates[offset + i] = flatCoordinates[end - stride + i];\n flatCoordinates[end - stride + i] = tmp;\n }\n offset += stride;\n end -= stride;\n }\n}\n//# sourceMappingURL=reverse.js.map","/**\n * @module ol/geom/flat/orient\n */\nimport { coordinates as reverseCoordinates } from './reverse.js';\n/**\n * Is the linear ring oriented clockwise in a coordinate system with a bottom-left\n * coordinate origin? For a coordinate system with a top-left coordinate origin,\n * the ring's orientation is clockwise when this function returns false.\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {number} end End.\n * @param {number} stride Stride.\n * @return {boolean} Is clockwise.\n */\nexport function linearRingIsClockwise(flatCoordinates, offset, end, stride) {\n // https://stackoverflow.com/q/1165647/clockwise-method#1165943\n // https://github.com/OSGeo/gdal/blob/master/gdal/ogr/ogrlinearring.cpp\n var edge = 0;\n var x1 = flatCoordinates[end - stride];\n var y1 = flatCoordinates[end - stride + 1];\n for (; offset < end; offset += stride) {\n var x2 = flatCoordinates[offset];\n var y2 = flatCoordinates[offset + 1];\n edge += (x2 - x1) * (y2 + y1);\n x1 = x2;\n y1 = y2;\n }\n return edge === 0 ? undefined : edge > 0;\n}\n/**\n * Determines if linear rings are oriented. By default, left-hand orientation\n * is tested (first ring must be clockwise, remaining rings counter-clockwise).\n * To test for right-hand orientation, use the `opt_right` argument.\n *\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Array of end indexes.\n * @param {number} stride Stride.\n * @param {boolean} [opt_right] Test for right-hand orientation\n * (counter-clockwise exterior ring and clockwise interior rings).\n * @return {boolean} Rings are correctly oriented.\n */\nexport function linearRingsAreOriented(flatCoordinates, offset, ends, stride, opt_right) {\n var right = opt_right !== undefined ? opt_right : false;\n for (var i = 0, ii = ends.length; i < ii; ++i) {\n var end = ends[i];\n var isClockwise = linearRingIsClockwise(flatCoordinates, offset, end, stride);\n if (i === 0) {\n if ((right && isClockwise) || (!right && !isClockwise)) {\n return false;\n }\n }\n else {\n if ((right && !isClockwise) || (!right && isClockwise)) {\n return false;\n }\n }\n offset = end;\n }\n return true;\n}\n/**\n * Determines if linear rings are oriented. By default, left-hand orientation\n * is tested (first ring must be clockwise, remaining rings counter-clockwise).\n * To test for right-hand orientation, use the `opt_right` argument.\n *\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} endss Array of array of end indexes.\n * @param {number} stride Stride.\n * @param {boolean} [opt_right] Test for right-hand orientation\n * (counter-clockwise exterior ring and clockwise interior rings).\n * @return {boolean} Rings are correctly oriented.\n */\nexport function linearRingssAreOriented(flatCoordinates, offset, endss, stride, opt_right) {\n for (var i = 0, ii = endss.length; i < ii; ++i) {\n var ends = endss[i];\n if (!linearRingsAreOriented(flatCoordinates, offset, ends, stride, opt_right)) {\n return false;\n }\n if (ends.length) {\n offset = ends[ends.length - 1];\n }\n }\n return true;\n}\n/**\n * Orient coordinates in a flat array of linear rings. By default, rings\n * are oriented following the left-hand rule (clockwise for exterior and\n * counter-clockwise for interior rings). To orient according to the\n * right-hand rule, use the `opt_right` argument.\n *\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array} ends Ends.\n * @param {number} stride Stride.\n * @param {boolean} [opt_right] Follow the right-hand rule for orientation.\n * @return {number} End.\n */\nexport function orientLinearRings(flatCoordinates, offset, ends, stride, opt_right) {\n var right = opt_right !== undefined ? opt_right : false;\n for (var i = 0, ii = ends.length; i < ii; ++i) {\n var end = ends[i];\n var isClockwise = linearRingIsClockwise(flatCoordinates, offset, end, stride);\n var reverse = i === 0\n ? (right && isClockwise) || (!right && !isClockwise)\n : (right && !isClockwise) || (!right && isClockwise);\n if (reverse) {\n reverseCoordinates(flatCoordinates, offset, end, stride);\n }\n offset = end;\n }\n return offset;\n}\n/**\n * Orient coordinates in a flat array of linear rings. By default, rings\n * are oriented following the left-hand rule (clockwise for exterior and\n * counter-clockwise for interior rings). To orient according to the\n * right-hand rule, use the `opt_right` argument.\n *\n * @param {Array} flatCoordinates Flat coordinates.\n * @param {number} offset Offset.\n * @param {Array>} endss Array of array of end indexes.\n * @param {number} stride Stride.\n * @param {boolean} [opt_right] Follow the right-hand rule for orientation.\n * @return {number} End.\n */\nexport function orientLinearRingsArray(flatCoordinates, offset, endss, stride, opt_right) {\n for (var i = 0, ii = endss.length; i < ii; ++i) {\n offset = orientLinearRings(flatCoordinates, offset, endss[i], stride, opt_right);\n }\n return offset;\n}\n//# sourceMappingURL=orient.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/geom/Polygon\n */\nimport GeometryLayout from './GeometryLayout.js';\nimport GeometryType from './GeometryType.js';\nimport LinearRing from './LinearRing.js';\nimport Point from './Point.js';\nimport SimpleGeometry from './SimpleGeometry.js';\nimport { arrayMaxSquaredDelta, assignClosestArrayPoint } from './flat/closest.js';\nimport { closestSquaredDistanceXY, getCenter } from '../extent.js';\nimport { deflateCoordinatesArray } from './flat/deflate.js';\nimport { extend } from '../array.js';\nimport { getInteriorPointOfArray } from './flat/interiorpoint.js';\nimport { inflateCoordinatesArray } from './flat/inflate.js';\nimport { intersectsLinearRingArray } from './flat/intersectsextent.js';\nimport { linearRingsAreOriented, orientLinearRings } from './flat/orient.js';\nimport { linearRings as linearRingsArea } from './flat/area.js';\nimport { linearRingsContainsXY } from './flat/contains.js';\nimport { modulo } from '../math.js';\nimport { quantizeArray } from './flat/simplify.js';\nimport { offset as sphereOffset } from '../sphere.js';\n/**\n * @classdesc\n * Polygon geometry.\n *\n * @api\n */\nvar Polygon = /** @class */ (function (_super) {\n __extends(Polygon, _super);\n /**\n * @param {!Array>|!Array} coordinates\n * Array of linear rings that define the polygon. The first linear ring of the\n * array defines the outer-boundary or surface of the polygon. Each subsequent\n * linear ring defines a hole in the surface of the polygon. A linear ring is\n * an array of vertices' coordinates where the first coordinate and the last are\n * equivalent. (For internal use, flat coordinates in combination with\n * `opt_layout` and `opt_ends` are also accepted.)\n * @param {import(\"./GeometryLayout.js\").default} [opt_layout] Layout.\n * @param {Array} [opt_ends] Ends (for internal use with flat coordinates).\n */\n function Polygon(coordinates, opt_layout, opt_ends) {\n var _this = _super.call(this) || this;\n /**\n * @type {Array}\n * @private\n */\n _this.ends_ = [];\n /**\n * @private\n * @type {number}\n */\n _this.flatInteriorPointRevision_ = -1;\n /**\n * @private\n * @type {import(\"../coordinate.js\").Coordinate}\n */\n _this.flatInteriorPoint_ = null;\n /**\n * @private\n * @type {number}\n */\n _this.maxDelta_ = -1;\n /**\n * @private\n * @type {number}\n */\n _this.maxDeltaRevision_ = -1;\n /**\n * @private\n * @type {number}\n */\n _this.orientedRevision_ = -1;\n /**\n * @private\n * @type {Array}\n */\n _this.orientedFlatCoordinates_ = null;\n if (opt_layout !== undefined && opt_ends) {\n _this.setFlatCoordinates(opt_layout, \n /** @type {Array} */ (coordinates));\n _this.ends_ = opt_ends;\n }\n else {\n _this.setCoordinates(\n /** @type {Array>} */ (coordinates), opt_layout);\n }\n return _this;\n }\n /**\n * Append the passed linear ring to this polygon.\n * @param {LinearRing} linearRing Linear ring.\n * @api\n */\n Polygon.prototype.appendLinearRing = function (linearRing) {\n if (!this.flatCoordinates) {\n this.flatCoordinates = linearRing.getFlatCoordinates().slice();\n }\n else {\n extend(this.flatCoordinates, linearRing.getFlatCoordinates());\n }\n this.ends_.push(this.flatCoordinates.length);\n this.changed();\n };\n /**\n * Make a complete copy of the geometry.\n * @return {!Polygon} Clone.\n * @api\n */\n Polygon.prototype.clone = function () {\n var polygon = new Polygon(this.flatCoordinates.slice(), this.layout, this.ends_.slice());\n polygon.applyProperties(this);\n return polygon;\n };\n /**\n * @param {number} x X.\n * @param {number} y Y.\n * @param {import(\"../coordinate.js\").Coordinate} closestPoint Closest point.\n * @param {number} minSquaredDistance Minimum squared distance.\n * @return {number} Minimum squared distance.\n */\n Polygon.prototype.closestPointXY = function (x, y, closestPoint, minSquaredDistance) {\n if (minSquaredDistance < closestSquaredDistanceXY(this.getExtent(), x, y)) {\n return minSquaredDistance;\n }\n if (this.maxDeltaRevision_ != this.getRevision()) {\n this.maxDelta_ = Math.sqrt(arrayMaxSquaredDelta(this.flatCoordinates, 0, this.ends_, this.stride, 0));\n this.maxDeltaRevision_ = this.getRevision();\n }\n return assignClosestArrayPoint(this.flatCoordinates, 0, this.ends_, this.stride, this.maxDelta_, true, x, y, closestPoint, minSquaredDistance);\n };\n /**\n * @param {number} x X.\n * @param {number} y Y.\n * @return {boolean} Contains (x, y).\n */\n Polygon.prototype.containsXY = function (x, y) {\n return linearRingsContainsXY(this.getOrientedFlatCoordinates(), 0, this.ends_, this.stride, x, y);\n };\n /**\n * Return the area of the polygon on projected plane.\n * @return {number} Area (on projected plane).\n * @api\n */\n Polygon.prototype.getArea = function () {\n return linearRingsArea(this.getOrientedFlatCoordinates(), 0, this.ends_, this.stride);\n };\n /**\n * Get the coordinate array for this geometry. This array has the structure\n * of a GeoJSON coordinate array for polygons.\n *\n * @param {boolean} [opt_right] Orient coordinates according to the right-hand\n * rule (counter-clockwise for exterior and clockwise for interior rings).\n * If `false`, coordinates will be oriented according to the left-hand rule\n * (clockwise for exterior and counter-clockwise for interior rings).\n * By default, coordinate orientation will depend on how the geometry was\n * constructed.\n * @return {Array>} Coordinates.\n * @api\n */\n Polygon.prototype.getCoordinates = function (opt_right) {\n var flatCoordinates;\n if (opt_right !== undefined) {\n flatCoordinates = this.getOrientedFlatCoordinates().slice();\n orientLinearRings(flatCoordinates, 0, this.ends_, this.stride, opt_right);\n }\n else {\n flatCoordinates = this.flatCoordinates;\n }\n return inflateCoordinatesArray(flatCoordinates, 0, this.ends_, this.stride);\n };\n /**\n * @return {Array} Ends.\n */\n Polygon.prototype.getEnds = function () {\n return this.ends_;\n };\n /**\n * @return {Array} Interior point.\n */\n Polygon.prototype.getFlatInteriorPoint = function () {\n if (this.flatInteriorPointRevision_ != this.getRevision()) {\n var flatCenter = getCenter(this.getExtent());\n this.flatInteriorPoint_ = getInteriorPointOfArray(this.getOrientedFlatCoordinates(), 0, this.ends_, this.stride, flatCenter, 0);\n this.flatInteriorPointRevision_ = this.getRevision();\n }\n return this.flatInteriorPoint_;\n };\n /**\n * Return an interior point of the polygon.\n * @return {Point} Interior point as XYM coordinate, where M is the\n * length of the horizontal intersection that the point belongs to.\n * @api\n */\n Polygon.prototype.getInteriorPoint = function () {\n return new Point(this.getFlatInteriorPoint(), GeometryLayout.XYM);\n };\n /**\n * Return the number of rings of the polygon, this includes the exterior\n * ring and any interior rings.\n *\n * @return {number} Number of rings.\n * @api\n */\n Polygon.prototype.getLinearRingCount = function () {\n return this.ends_.length;\n };\n /**\n * Return the Nth linear ring of the polygon geometry. Return `null` if the\n * given index is out of range.\n * The exterior linear ring is available at index `0` and the interior rings\n * at index `1` and beyond.\n *\n * @param {number} index Index.\n * @return {LinearRing} Linear ring.\n * @api\n */\n Polygon.prototype.getLinearRing = function (index) {\n if (index < 0 || this.ends_.length <= index) {\n return null;\n }\n return new LinearRing(this.flatCoordinates.slice(index === 0 ? 0 : this.ends_[index - 1], this.ends_[index]), this.layout);\n };\n /**\n * Return the linear rings of the polygon.\n * @return {Array} Linear rings.\n * @api\n */\n Polygon.prototype.getLinearRings = function () {\n var layout = this.layout;\n var flatCoordinates = this.flatCoordinates;\n var ends = this.ends_;\n var linearRings = [];\n var offset = 0;\n for (var i = 0, ii = ends.length; i < ii; ++i) {\n var end = ends[i];\n var linearRing = new LinearRing(flatCoordinates.slice(offset, end), layout);\n linearRings.push(linearRing);\n offset = end;\n }\n return linearRings;\n };\n /**\n * @return {Array} Oriented flat coordinates.\n */\n Polygon.prototype.getOrientedFlatCoordinates = function () {\n if (this.orientedRevision_ != this.getRevision()) {\n var flatCoordinates = this.flatCoordinates;\n if (linearRingsAreOriented(flatCoordinates, 0, this.ends_, this.stride)) {\n this.orientedFlatCoordinates_ = flatCoordinates;\n }\n else {\n this.orientedFlatCoordinates_ = flatCoordinates.slice();\n this.orientedFlatCoordinates_.length = orientLinearRings(this.orientedFlatCoordinates_, 0, this.ends_, this.stride);\n }\n this.orientedRevision_ = this.getRevision();\n }\n return this.orientedFlatCoordinates_;\n };\n /**\n * @param {number} squaredTolerance Squared tolerance.\n * @return {Polygon} Simplified Polygon.\n * @protected\n */\n Polygon.prototype.getSimplifiedGeometryInternal = function (squaredTolerance) {\n var simplifiedFlatCoordinates = [];\n var simplifiedEnds = [];\n simplifiedFlatCoordinates.length = quantizeArray(this.flatCoordinates, 0, this.ends_, this.stride, Math.sqrt(squaredTolerance), simplifiedFlatCoordinates, 0, simplifiedEnds);\n return new Polygon(simplifiedFlatCoordinates, GeometryLayout.XY, simplifiedEnds);\n };\n /**\n * Get the type of this geometry.\n * @return {import(\"./GeometryType.js\").default} Geometry type.\n * @api\n */\n Polygon.prototype.getType = function () {\n return GeometryType.POLYGON;\n };\n /**\n * Test if the geometry and the passed extent intersect.\n * @param {import(\"../extent.js\").Extent} extent Extent.\n * @return {boolean} `true` if the geometry and the extent intersect.\n * @api\n */\n Polygon.prototype.intersectsExtent = function (extent) {\n return intersectsLinearRingArray(this.getOrientedFlatCoordinates(), 0, this.ends_, this.stride, extent);\n };\n /**\n * Set the coordinates of the polygon.\n * @param {!Array>} coordinates Coordinates.\n * @param {import(\"./GeometryLayout.js\").default} [opt_layout] Layout.\n * @api\n */\n Polygon.prototype.setCoordinates = function (coordinates, opt_layout) {\n this.setLayout(opt_layout, coordinates, 2);\n if (!this.flatCoordinates) {\n this.flatCoordinates = [];\n }\n var ends = deflateCoordinatesArray(this.flatCoordinates, 0, coordinates, this.stride, this.ends_);\n this.flatCoordinates.length = ends.length === 0 ? 0 : ends[ends.length - 1];\n this.changed();\n };\n return Polygon;\n}(SimpleGeometry));\nexport default Polygon;\n/**\n * Create an approximation of a circle on the surface of a sphere.\n * @param {import(\"../coordinate.js\").Coordinate} center Center (`[lon, lat]` in degrees).\n * @param {number} radius The great-circle distance from the center to\n * the polygon vertices in meters.\n * @param {number} [opt_n] Optional number of vertices for the resulting\n * polygon. Default is `32`.\n * @param {number} [opt_sphereRadius] Optional radius for the sphere (defaults to\n * the Earth's mean radius using the WGS84 ellipsoid).\n * @return {Polygon} The \"circular\" polygon.\n * @api\n */\nexport function circular(center, radius, opt_n, opt_sphereRadius) {\n var n = opt_n ? opt_n : 32;\n /** @type {Array} */\n var flatCoordinates = [];\n for (var i = 0; i < n; ++i) {\n extend(flatCoordinates, sphereOffset(center, radius, (2 * Math.PI * i) / n, opt_sphereRadius));\n }\n flatCoordinates.push(flatCoordinates[0], flatCoordinates[1]);\n return new Polygon(flatCoordinates, GeometryLayout.XY, [\n flatCoordinates.length,\n ]);\n}\n/**\n * Create a polygon from an extent. The layout used is `XY`.\n * @param {import(\"../extent.js\").Extent} extent The extent.\n * @return {Polygon} The polygon.\n * @api\n */\nexport function fromExtent(extent) {\n var minX = extent[0];\n var minY = extent[1];\n var maxX = extent[2];\n var maxY = extent[3];\n var flatCoordinates = [\n minX,\n minY,\n minX,\n maxY,\n maxX,\n maxY,\n maxX,\n minY,\n minX,\n minY,\n ];\n return new Polygon(flatCoordinates, GeometryLayout.XY, [\n flatCoordinates.length,\n ]);\n}\n/**\n * Create a regular polygon from a circle.\n * @param {import(\"./Circle.js\").default} circle Circle geometry.\n * @param {number} [opt_sides] Number of sides of the polygon. Default is 32.\n * @param {number} [opt_angle] Start angle for the first vertex of the polygon in\n * counter-clockwise radians. 0 means East. Default is 0.\n * @return {Polygon} Polygon geometry.\n * @api\n */\nexport function fromCircle(circle, opt_sides, opt_angle) {\n var sides = opt_sides ? opt_sides : 32;\n var stride = circle.getStride();\n var layout = circle.getLayout();\n var center = circle.getCenter();\n var arrayLength = stride * (sides + 1);\n var flatCoordinates = new Array(arrayLength);\n for (var i = 0; i < arrayLength; i += stride) {\n flatCoordinates[i] = 0;\n flatCoordinates[i + 1] = 0;\n for (var j = 2; j < stride; j++) {\n flatCoordinates[i + j] = center[j];\n }\n }\n var ends = [flatCoordinates.length];\n var polygon = new Polygon(flatCoordinates, layout, ends);\n makeRegular(polygon, center, circle.getRadius(), opt_angle);\n return polygon;\n}\n/**\n * Modify the coordinates of a polygon to make it a regular polygon.\n * @param {Polygon} polygon Polygon geometry.\n * @param {import(\"../coordinate.js\").Coordinate} center Center of the regular polygon.\n * @param {number} radius Radius of the regular polygon.\n * @param {number} [opt_angle] Start angle for the first vertex of the polygon in\n * counter-clockwise radians. 0 means East. Default is 0.\n */\nexport function makeRegular(polygon, center, radius, opt_angle) {\n var flatCoordinates = polygon.getFlatCoordinates();\n var stride = polygon.getStride();\n var sides = flatCoordinates.length / stride - 1;\n var startAngle = opt_angle ? opt_angle : 0;\n for (var i = 0; i <= sides; ++i) {\n var offset = i * stride;\n var angle = startAngle + (modulo(i, sides) * 2 * Math.PI) / sides;\n flatCoordinates[offset] = center[0] + radius * Math.cos(angle);\n flatCoordinates[offset + 1] = center[1] + radius * Math.sin(angle);\n }\n polygon.changed();\n}\n//# sourceMappingURL=Polygon.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/View\n */\nimport BaseObject from './Object.js';\nimport GeometryType from './geom/GeometryType.js';\nimport Units from './proj/Units.js';\nimport ViewHint from './ViewHint.js';\nimport ViewProperty from './ViewProperty.js';\nimport { DEFAULT_TILE_SIZE } from './tilegrid/common.js';\nimport { METERS_PER_UNIT, createProjection, fromUserCoordinate, fromUserExtent, getUserProjection, toUserCoordinate, toUserExtent, } from './proj.js';\nimport { VOID } from './functions.js';\nimport { add as addCoordinate, equals as coordinatesEqual, rotate as rotateCoordinate, } from './coordinate.js';\nimport { assert } from './asserts.js';\nimport { assign } from './obj.js';\nimport { none as centerNone, createExtent } from './centerconstraint.js';\nimport { clamp, modulo } from './math.js';\nimport { createMinMaxResolution } from './resolutionconstraint.js';\nimport { createSnapToN, createSnapToZero, disable, none as rotationNone, } from './rotationconstraint.js';\nimport { createSnapToPower, createSnapToResolutions, } from './resolutionconstraint.js';\nimport { easeOut } from './easing.js';\nimport { equals } from './coordinate.js';\nimport { getCenter, getForViewAndSize, getHeight, getWidth, isEmpty, } from './extent.js';\nimport { inAndOut } from './easing.js';\nimport { linearFindNearest } from './array.js';\nimport { fromExtent as polygonFromExtent } from './geom/Polygon.js';\n/**\n * An animation configuration\n *\n * @typedef {Object} Animation\n * @property {import(\"./coordinate.js\").Coordinate} [sourceCenter] Source center.\n * @property {import(\"./coordinate.js\").Coordinate} [targetCenter] Target center.\n * @property {number} [sourceResolution] Source resolution.\n * @property {number} [targetResolution] Target resolution.\n * @property {number} [sourceRotation] Source rotation.\n * @property {number} [targetRotation] Target rotation.\n * @property {import(\"./coordinate.js\").Coordinate} [anchor] Anchor.\n * @property {number} start Start.\n * @property {number} duration Duration.\n * @property {boolean} complete Complete.\n * @property {function(number):number} easing Easing.\n * @property {function(boolean):void} callback Callback.\n */\n/**\n * @typedef {Object} Constraints\n * @property {import(\"./centerconstraint.js\").Type} center Center.\n * @property {import(\"./resolutionconstraint.js\").Type} resolution Resolution.\n * @property {import(\"./rotationconstraint.js\").Type} rotation Rotation.\n */\n/**\n * @typedef {Object} FitOptions\n * @property {import(\"./size.js\").Size} [size] The size in pixels of the box to fit\n * the extent into. Default is the current size of the first map in the DOM that\n * uses this view, or `[100, 100]` if no such map is found.\n * @property {!Array} [padding=[0, 0, 0, 0]] Padding (in pixels) to be\n * cleared inside the view. Values in the array are top, right, bottom and left\n * padding.\n * @property {boolean} [nearest=false] If the view `constrainResolution` option is `true`,\n * get the nearest extent instead of the closest that actually fits the view.\n * @property {number} [minResolution=0] Minimum resolution that we zoom to.\n * @property {number} [maxZoom] Maximum zoom level that we zoom to. If\n * `minResolution` is given, this property is ignored.\n * @property {number} [duration] The duration of the animation in milliseconds.\n * By default, there is no animation to the target extent.\n * @property {function(number):number} [easing] The easing function used during\n * the animation (defaults to {@link module:ol/easing.inAndOut}).\n * The function will be called for each frame with a number representing a\n * fraction of the animation's duration. The function should return a number\n * between 0 and 1 representing the progress toward the destination state.\n * @property {function(boolean):void} [callback] Function called when the view is in\n * its final position. The callback will be called with `true` if the animation\n * series completed on its own or `false` if it was cancelled.\n */\n/**\n * @typedef {Object} ViewOptions\n * @property {import(\"./coordinate.js\").Coordinate} [center] The initial center for\n * the view. If a user projection is not set, the coordinate system for the center is\n * specified with the `projection` option. Layer sources will not be fetched if this\n * is not set, but the center can be set later with {@link #setCenter}.\n * @property {boolean|number} [constrainRotation=true] Rotation constraint.\n * `false` means no constraint. `true` means no constraint, but snap to zero\n * near zero. A number constrains the rotation to that number of values. For\n * example, `4` will constrain the rotation to 0, 90, 180, and 270 degrees.\n * @property {boolean} [enableRotation=true] Enable rotation.\n * If `false`, a rotation constraint that always sets the rotation to zero is\n * used. The `constrainRotation` option has no effect if `enableRotation` is\n * `false`.\n * @property {import(\"./extent.js\").Extent} [extent] The extent that constrains the\n * view, in other words, nothing outside of this extent can be visible on the map.\n * @property {boolean} [constrainOnlyCenter=false] If true, the extent\n * constraint will only apply to the view center and not the whole extent.\n * @property {boolean} [smoothExtentConstraint=true] If true, the extent\n * constraint will be applied smoothly, i.e. allow the view to go slightly outside\n * of the given `extent`.\n * @property {number} [maxResolution] The maximum resolution used to determine\n * the resolution constraint. It is used together with `minResolution` (or\n * `maxZoom`) and `zoomFactor`. If unspecified it is calculated in such a way\n * that the projection's validity extent fits in a 256x256 px tile. If the\n * projection is Spherical Mercator (the default) then `maxResolution` defaults\n * to `40075016.68557849 / 256 = 156543.03392804097`.\n * @property {number} [minResolution] The minimum resolution used to determine\n * the resolution constraint. It is used together with `maxResolution` (or\n * `minZoom`) and `zoomFactor`. If unspecified it is calculated assuming 29\n * zoom levels (with a factor of 2). If the projection is Spherical Mercator\n * (the default) then `minResolution` defaults to\n * `40075016.68557849 / 256 / Math.pow(2, 28) = 0.0005831682455839253`.\n * @property {number} [maxZoom=28] The maximum zoom level used to determine the\n * resolution constraint. It is used together with `minZoom` (or\n * `maxResolution`) and `zoomFactor`. Note that if `minResolution` is also\n * provided, it is given precedence over `maxZoom`.\n * @property {number} [minZoom=0] The minimum zoom level used to determine the\n * resolution constraint. It is used together with `maxZoom` (or\n * `minResolution`) and `zoomFactor`. Note that if `maxResolution` is also\n * provided, it is given precedence over `minZoom`.\n * @property {boolean} [multiWorld=false] If `false` the view is constrained so\n * only one world is visible, and you cannot pan off the edge. If `true` the map\n * may show multiple worlds at low zoom levels. Only used if the `projection` is\n * global. Note that if `extent` is also provided it is given precedence.\n * @property {boolean} [constrainResolution=false] If true, the view will always\n * animate to the closest zoom level after an interaction; false means\n * intermediary zoom levels are allowed.\n * @property {boolean} [smoothResolutionConstraint=true] If true, the resolution\n * min/max values will be applied smoothly, i. e. allow the view to exceed slightly\n * the given resolution or zoom bounds.\n * @property {boolean} [showFullExtent=false] Allow the view to be zoomed out to\n * show the full configured extent. By default, when a view is configured with an\n * extent, users will not be able to zoom out so the viewport exceeds the extent in\n * either dimension. This means the full extent may not be visible if the viewport\n * is taller or wider than the aspect ratio of the configured extent. If\n * showFullExtent is true, the user will be able to zoom out so that the viewport\n * exceeds the height or width of the configured extent, but not both, allowing the\n * full extent to be shown.\n * @property {import(\"./proj.js\").ProjectionLike} [projection='EPSG:3857'] The\n * projection. The default is Spherical Mercator.\n * @property {number} [resolution] The initial resolution for the view. The\n * units are `projection` units per pixel (e.g. meters per pixel). An\n * alternative to setting this is to set `zoom`. Layer sources will not be\n * fetched if neither this nor `zoom` are defined, but they can be set later\n * with {@link #setZoom} or {@link #setResolution}.\n * @property {Array} [resolutions] Resolutions that determine the\n * zoom levels if specified. The index in the array corresponds to the zoom level,\n * therefore the resolution values have to be in descending order. It also constrains\n * the resolution by the minimum and maximum value. If set the `maxResolution`,\n * `minResolution`, `minZoom`, `maxZoom`, and `zoomFactor` options are ignored.\n * @property {number} [rotation=0] The initial rotation for the view in radians\n * (positive rotation clockwise, 0 means North).\n * @property {number} [zoom] Only used if `resolution` is not defined. Zoom\n * level used to calculate the initial resolution for the view.\n * @property {number} [zoomFactor=2] The zoom factor used to compute the\n * corresponding resolution.\n * @property {!Array} [padding=[0, 0, 0, 0]] Padding (in css pixels).\n * If the map viewport is partially covered with other content (overlays) along\n * its edges, this setting allows to shift the center of the viewport away from\n * that content. The order of the values is top, right, bottom, left.\n */\n/**\n * @typedef {Object} AnimationOptions\n * @property {import(\"./coordinate.js\").Coordinate} [center] The center of the view at the end of\n * the animation.\n * @property {number} [zoom] The zoom level of the view at the end of the\n * animation. This takes precedence over `resolution`.\n * @property {number} [resolution] The resolution of the view at the end\n * of the animation. If `zoom` is also provided, this option will be ignored.\n * @property {number} [rotation] The rotation of the view at the end of\n * the animation.\n * @property {import(\"./coordinate.js\").Coordinate} [anchor] Optional anchor to remain fixed\n * during a rotation or resolution animation.\n * @property {number} [duration=1000] The duration of the animation in milliseconds.\n * @property {function(number):number} [easing] The easing function used\n * during the animation (defaults to {@link module:ol/easing.inAndOut}).\n * The function will be called for each frame with a number representing a\n * fraction of the animation's duration. The function should return a number\n * between 0 and 1 representing the progress toward the destination state.\n */\n/**\n * @typedef {Object} State\n * @property {import(\"./coordinate.js\").Coordinate} center Center.\n * @property {import(\"./proj/Projection.js\").default} projection Projection.\n * @property {number} resolution Resolution.\n * @property {import(\"./coordinate.js\").Coordinate} [nextCenter] The next center during an animation series.\n * @property {number} [nextResolution] The next resolution during an animation series.\n * @property {number} [nextRotation] The next rotation during an animation series.\n * @property {number} rotation Rotation.\n * @property {number} zoom Zoom.\n */\n/**\n * Default min zoom level for the map view.\n * @type {number}\n */\nvar DEFAULT_MIN_ZOOM = 0;\n/**\n * @typedef {import(\"./ObjectEventType\").Types|'change:center'|'change:resolution'|'change:rotation'} ViewObjectEventTypes\n */\n/***\n * @template Return\n * @typedef {import(\"./Observable\").OnSignature &\n * import(\"./Observable\").OnSignature &\n * import(\"./Observable\").CombinedOnSignature} ViewOnSignature\n */\n/**\n * @classdesc\n * A View object represents a simple 2D view of the map.\n *\n * This is the object to act upon to change the center, resolution,\n * and rotation of the map.\n *\n * A View has a `projection`. The projection determines the\n * coordinate system of the center, and its units determine the units of the\n * resolution (projection units per pixel). The default projection is\n * Spherical Mercator (EPSG:3857).\n *\n * ### The view states\n *\n * A View is determined by three states: `center`, `resolution`,\n * and `rotation`. Each state has a corresponding getter and setter, e.g.\n * `getCenter` and `setCenter` for the `center` state.\n *\n * The `zoom` state is actually not saved on the view: all computations\n * internally use the `resolution` state. Still, the `setZoom` and `getZoom`\n * methods are available, as well as `getResolutionForZoom` and\n * `getZoomForResolution` to switch from one system to the other.\n *\n * ### The constraints\n *\n * `setCenter`, `setResolution` and `setRotation` can be used to change the\n * states of the view, but any constraint defined in the constructor will\n * be applied along the way.\n *\n * A View object can have a *resolution constraint*, a *rotation constraint*\n * and a *center constraint*.\n *\n * The *resolution constraint* typically restricts min/max values and\n * snaps to specific resolutions. It is determined by the following\n * options: `resolutions`, `maxResolution`, `maxZoom` and `zoomFactor`.\n * If `resolutions` is set, the other three options are ignored. See\n * documentation for each option for more information. By default, the view\n * only has a min/max restriction and allow intermediary zoom levels when\n * pinch-zooming for example.\n *\n * The *rotation constraint* snaps to specific angles. It is determined\n * by the following options: `enableRotation` and `constrainRotation`.\n * By default rotation is allowed and its value is snapped to zero when approaching the\n * horizontal.\n *\n * The *center constraint* is determined by the `extent` option. By\n * default the view center is not constrained at all.\n *\n * ### Changing the view state\n *\n * It is important to note that `setZoom`, `setResolution`, `setCenter` and\n * `setRotation` are subject to the above mentioned constraints. As such, it\n * may sometimes not be possible to know in advance the resulting state of the\n * View. For example, calling `setResolution(10)` does not guarantee that\n * `getResolution()` will return `10`.\n *\n * A consequence of this is that, when applying a delta on the view state, one\n * should use `adjustCenter`, `adjustRotation`, `adjustZoom` and `adjustResolution`\n * rather than the corresponding setters. This will let view do its internal\n * computations. Besides, the `adjust*` methods also take an `opt_anchor`\n * argument which allows specifying an origin for the transformation.\n *\n * ### Interacting with the view\n *\n * View constraints are usually only applied when the view is *at rest*, meaning that\n * no interaction or animation is ongoing. As such, if the user puts the view in a\n * state that is not equivalent to a constrained one (e.g. rotating the view when\n * the snap angle is 0), an animation will be triggered at the interaction end to\n * put back the view to a stable state;\n *\n * @api\n */\nvar View = /** @class */ (function (_super) {\n __extends(View, _super);\n /**\n * @param {ViewOptions} [opt_options] View options.\n */\n function View(opt_options) {\n var _this = _super.call(this) || this;\n /***\n * @type {ViewOnSignature}\n */\n _this.on;\n /***\n * @type {ViewOnSignature}\n */\n _this.once;\n /***\n * @type {ViewOnSignature}\n */\n _this.un;\n var options = assign({}, opt_options);\n /**\n * @private\n * @type {Array}\n */\n _this.hints_ = [0, 0];\n /**\n * @private\n * @type {Array>}\n */\n _this.animations_ = [];\n /**\n * @private\n * @type {number|undefined}\n */\n _this.updateAnimationKey_;\n /**\n * @private\n * @const\n * @type {import(\"./proj/Projection.js\").default}\n */\n _this.projection_ = createProjection(options.projection, 'EPSG:3857');\n /**\n * @private\n * @type {import(\"./size.js\").Size}\n */\n _this.viewportSize_ = [100, 100];\n /**\n * @private\n * @type {import(\"./coordinate.js\").Coordinate|undefined}\n */\n _this.targetCenter_ = null;\n /**\n * @private\n * @type {number|undefined}\n */\n _this.targetResolution_;\n /**\n * @private\n * @type {number|undefined}\n */\n _this.targetRotation_;\n /**\n * @private\n * @type {import(\"./coordinate.js\").Coordinate}\n */\n _this.nextCenter_ = null;\n /**\n * @private\n * @type {number}\n */\n _this.nextResolution_;\n /**\n * @private\n * @type {number}\n */\n _this.nextRotation_;\n /**\n * @private\n * @type {import(\"./coordinate.js\").Coordinate|undefined}\n */\n _this.cancelAnchor_ = undefined;\n if (options.center) {\n options.center = fromUserCoordinate(options.center, _this.projection_);\n }\n if (options.extent) {\n options.extent = fromUserExtent(options.extent, _this.projection_);\n }\n _this.applyOptions_(options);\n return _this;\n }\n /**\n * Set up the view with the given options.\n * @param {ViewOptions} options View options.\n */\n View.prototype.applyOptions_ = function (options) {\n /**\n * @type {Object}\n */\n var properties = {};\n var resolutionConstraintInfo = createResolutionConstraint(options);\n /**\n * @private\n * @type {number}\n */\n this.maxResolution_ = resolutionConstraintInfo.maxResolution;\n /**\n * @private\n * @type {number}\n */\n this.minResolution_ = resolutionConstraintInfo.minResolution;\n /**\n * @private\n * @type {number}\n */\n this.zoomFactor_ = resolutionConstraintInfo.zoomFactor;\n /**\n * @private\n * @type {Array|undefined}\n */\n this.resolutions_ = options.resolutions;\n /**\n * @type {Array|undefined}\n * @private\n */\n this.padding_ = options.padding;\n /**\n * @private\n * @type {number}\n */\n this.minZoom_ = resolutionConstraintInfo.minZoom;\n var centerConstraint = createCenterConstraint(options);\n var resolutionConstraint = resolutionConstraintInfo.constraint;\n var rotationConstraint = createRotationConstraint(options);\n /**\n * @private\n * @type {Constraints}\n */\n this.constraints_ = {\n center: centerConstraint,\n resolution: resolutionConstraint,\n rotation: rotationConstraint,\n };\n this.setRotation(options.rotation !== undefined ? options.rotation : 0);\n this.setCenterInternal(options.center !== undefined ? options.center : null);\n if (options.resolution !== undefined) {\n this.setResolution(options.resolution);\n }\n else if (options.zoom !== undefined) {\n this.setZoom(options.zoom);\n }\n this.setProperties(properties);\n /**\n * @private\n * @type {ViewOptions}\n */\n this.options_ = options;\n };\n Object.defineProperty(View.prototype, \"padding\", {\n /**\n * Padding (in css pixels).\n * If the map viewport is partially covered with other content (overlays) along\n * its edges, this setting allows to shift the center of the viewport away from that\n * content. The order of the values in the array is top, right, bottom, left.\n * The default is no padding, which is equivalent to `[0, 0, 0, 0]`.\n * @type {Array|undefined}\n * @api\n */\n get: function () {\n return this.padding_;\n },\n set: function (padding) {\n var oldPadding = this.padding_;\n this.padding_ = padding;\n var center = this.getCenter();\n if (center) {\n var newPadding = padding || [0, 0, 0, 0];\n oldPadding = oldPadding || [0, 0, 0, 0];\n var resolution = this.getResolution();\n var offsetX = (resolution / 2) *\n (newPadding[3] - oldPadding[3] + oldPadding[1] - newPadding[1]);\n var offsetY = (resolution / 2) *\n (newPadding[0] - oldPadding[0] + oldPadding[2] - newPadding[2]);\n this.setCenterInternal([center[0] + offsetX, center[1] - offsetY]);\n }\n },\n enumerable: false,\n configurable: true\n });\n /**\n * Get an updated version of the view options used to construct the view. The\n * current resolution (or zoom), center, and rotation are applied to any stored\n * options. The provided options can be used to apply new min/max zoom or\n * resolution limits.\n * @param {ViewOptions} newOptions New options to be applied.\n * @return {ViewOptions} New options updated with the current view state.\n */\n View.prototype.getUpdatedOptions_ = function (newOptions) {\n var options = assign({}, this.options_);\n // preserve resolution (or zoom)\n if (options.resolution !== undefined) {\n options.resolution = this.getResolution();\n }\n else {\n options.zoom = this.getZoom();\n }\n // preserve center\n options.center = this.getCenterInternal();\n // preserve rotation\n options.rotation = this.getRotation();\n return assign({}, options, newOptions);\n };\n /**\n * Animate the view. The view's center, zoom (or resolution), and rotation\n * can be animated for smooth transitions between view states. For example,\n * to animate the view to a new zoom level:\n *\n * view.animate({zoom: view.getZoom() + 1});\n *\n * By default, the animation lasts one second and uses in-and-out easing. You\n * can customize this behavior by including `duration` (in milliseconds) and\n * `easing` options (see {@link module:ol/easing}).\n *\n * To chain together multiple animations, call the method with multiple\n * animation objects. For example, to first zoom and then pan:\n *\n * view.animate({zoom: 10}, {center: [0, 0]});\n *\n * If you provide a function as the last argument to the animate method, it\n * will get called at the end of an animation series. The callback will be\n * called with `true` if the animation series completed on its own or `false`\n * if it was cancelled.\n *\n * Animations are cancelled by user interactions (e.g. dragging the map) or by\n * calling `view.setCenter()`, `view.setResolution()`, or `view.setRotation()`\n * (or another method that calls one of these).\n *\n * @param {...(AnimationOptions|function(boolean): void)} var_args Animation\n * options. Multiple animations can be run in series by passing multiple\n * options objects. To run multiple animations in parallel, call the method\n * multiple times. An optional callback can be provided as a final\n * argument. The callback will be called with a boolean indicating whether\n * the animation completed without being cancelled.\n * @api\n */\n View.prototype.animate = function (var_args) {\n if (this.isDef() && !this.getAnimating()) {\n this.resolveConstraints(0);\n }\n var args = new Array(arguments.length);\n for (var i = 0; i < args.length; ++i) {\n var options = arguments[i];\n if (options.center) {\n options = assign({}, options);\n options.center = fromUserCoordinate(options.center, this.getProjection());\n }\n if (options.anchor) {\n options = assign({}, options);\n options.anchor = fromUserCoordinate(options.anchor, this.getProjection());\n }\n args[i] = options;\n }\n this.animateInternal.apply(this, args);\n };\n /**\n * @param {...(AnimationOptions|function(boolean): void)} var_args Animation options.\n */\n View.prototype.animateInternal = function (var_args) {\n var animationCount = arguments.length;\n var callback;\n if (animationCount > 1 &&\n typeof arguments[animationCount - 1] === 'function') {\n callback = arguments[animationCount - 1];\n --animationCount;\n }\n var i = 0;\n for (; i < animationCount && !this.isDef(); ++i) {\n // if view properties are not yet set, shortcut to the final state\n var state = arguments[i];\n if (state.center) {\n this.setCenterInternal(state.center);\n }\n if (state.zoom !== undefined) {\n this.setZoom(state.zoom);\n }\n else if (state.resolution) {\n this.setResolution(state.resolution);\n }\n if (state.rotation !== undefined) {\n this.setRotation(state.rotation);\n }\n }\n if (i === animationCount) {\n if (callback) {\n animationCallback(callback, true);\n }\n return;\n }\n var start = Date.now();\n var center = this.targetCenter_.slice();\n var resolution = this.targetResolution_;\n var rotation = this.targetRotation_;\n var series = [];\n for (; i < animationCount; ++i) {\n var options = /** @type {AnimationOptions} */ (arguments[i]);\n var animation = {\n start: start,\n complete: false,\n anchor: options.anchor,\n duration: options.duration !== undefined ? options.duration : 1000,\n easing: options.easing || inAndOut,\n callback: callback,\n };\n if (options.center) {\n animation.sourceCenter = center;\n animation.targetCenter = options.center.slice();\n center = animation.targetCenter;\n }\n if (options.zoom !== undefined) {\n animation.sourceResolution = resolution;\n animation.targetResolution = this.getResolutionForZoom(options.zoom);\n resolution = animation.targetResolution;\n }\n else if (options.resolution) {\n animation.sourceResolution = resolution;\n animation.targetResolution = options.resolution;\n resolution = animation.targetResolution;\n }\n if (options.rotation !== undefined) {\n animation.sourceRotation = rotation;\n var delta = modulo(options.rotation - rotation + Math.PI, 2 * Math.PI) - Math.PI;\n animation.targetRotation = rotation + delta;\n rotation = animation.targetRotation;\n }\n // check if animation is a no-op\n if (isNoopAnimation(animation)) {\n animation.complete = true;\n // we still push it onto the series for callback handling\n }\n else {\n start += animation.duration;\n }\n series.push(animation);\n }\n this.animations_.push(series);\n this.setHint(ViewHint.ANIMATING, 1);\n this.updateAnimations_();\n };\n /**\n * Determine if the view is being animated.\n * @return {boolean} The view is being animated.\n * @api\n */\n View.prototype.getAnimating = function () {\n return this.hints_[ViewHint.ANIMATING] > 0;\n };\n /**\n * Determine if the user is interacting with the view, such as panning or zooming.\n * @return {boolean} The view is being interacted with.\n * @api\n */\n View.prototype.getInteracting = function () {\n return this.hints_[ViewHint.INTERACTING] > 0;\n };\n /**\n * Cancel any ongoing animations.\n * @api\n */\n View.prototype.cancelAnimations = function () {\n this.setHint(ViewHint.ANIMATING, -this.hints_[ViewHint.ANIMATING]);\n var anchor;\n for (var i = 0, ii = this.animations_.length; i < ii; ++i) {\n var series = this.animations_[i];\n if (series[0].callback) {\n animationCallback(series[0].callback, false);\n }\n if (!anchor) {\n for (var j = 0, jj = series.length; j < jj; ++j) {\n var animation = series[j];\n if (!animation.complete) {\n anchor = animation.anchor;\n break;\n }\n }\n }\n }\n this.animations_.length = 0;\n this.cancelAnchor_ = anchor;\n this.nextCenter_ = null;\n this.nextResolution_ = NaN;\n this.nextRotation_ = NaN;\n };\n /**\n * Update all animations.\n */\n View.prototype.updateAnimations_ = function () {\n if (this.updateAnimationKey_ !== undefined) {\n cancelAnimationFrame(this.updateAnimationKey_);\n this.updateAnimationKey_ = undefined;\n }\n if (!this.getAnimating()) {\n return;\n }\n var now = Date.now();\n var more = false;\n for (var i = this.animations_.length - 1; i >= 0; --i) {\n var series = this.animations_[i];\n var seriesComplete = true;\n for (var j = 0, jj = series.length; j < jj; ++j) {\n var animation = series[j];\n if (animation.complete) {\n continue;\n }\n var elapsed = now - animation.start;\n var fraction = animation.duration > 0 ? elapsed / animation.duration : 1;\n if (fraction >= 1) {\n animation.complete = true;\n fraction = 1;\n }\n else {\n seriesComplete = false;\n }\n var progress = animation.easing(fraction);\n if (animation.sourceCenter) {\n var x0 = animation.sourceCenter[0];\n var y0 = animation.sourceCenter[1];\n var x1 = animation.targetCenter[0];\n var y1 = animation.targetCenter[1];\n this.nextCenter_ = animation.targetCenter;\n var x = x0 + progress * (x1 - x0);\n var y = y0 + progress * (y1 - y0);\n this.targetCenter_ = [x, y];\n }\n if (animation.sourceResolution && animation.targetResolution) {\n var resolution = progress === 1\n ? animation.targetResolution\n : animation.sourceResolution +\n progress *\n (animation.targetResolution - animation.sourceResolution);\n if (animation.anchor) {\n var size = this.getViewportSize_(this.getRotation());\n var constrainedResolution = this.constraints_.resolution(resolution, 0, size, true);\n this.targetCenter_ = this.calculateCenterZoom(constrainedResolution, animation.anchor);\n }\n this.nextResolution_ = animation.targetResolution;\n this.targetResolution_ = resolution;\n this.applyTargetState_(true);\n }\n if (animation.sourceRotation !== undefined &&\n animation.targetRotation !== undefined) {\n var rotation = progress === 1\n ? modulo(animation.targetRotation + Math.PI, 2 * Math.PI) -\n Math.PI\n : animation.sourceRotation +\n progress *\n (animation.targetRotation - animation.sourceRotation);\n if (animation.anchor) {\n var constrainedRotation = this.constraints_.rotation(rotation, true);\n this.targetCenter_ = this.calculateCenterRotate(constrainedRotation, animation.anchor);\n }\n this.nextRotation_ = animation.targetRotation;\n this.targetRotation_ = rotation;\n }\n this.applyTargetState_(true);\n more = true;\n if (!animation.complete) {\n break;\n }\n }\n if (seriesComplete) {\n this.animations_[i] = null;\n this.setHint(ViewHint.ANIMATING, -1);\n this.nextCenter_ = null;\n this.nextResolution_ = NaN;\n this.nextRotation_ = NaN;\n var callback = series[0].callback;\n if (callback) {\n animationCallback(callback, true);\n }\n }\n }\n // prune completed series\n this.animations_ = this.animations_.filter(Boolean);\n if (more && this.updateAnimationKey_ === undefined) {\n this.updateAnimationKey_ = requestAnimationFrame(this.updateAnimations_.bind(this));\n }\n };\n /**\n * @param {number} rotation Target rotation.\n * @param {import(\"./coordinate.js\").Coordinate} anchor Rotation anchor.\n * @return {import(\"./coordinate.js\").Coordinate|undefined} Center for rotation and anchor.\n */\n View.prototype.calculateCenterRotate = function (rotation, anchor) {\n var center;\n var currentCenter = this.getCenterInternal();\n if (currentCenter !== undefined) {\n center = [currentCenter[0] - anchor[0], currentCenter[1] - anchor[1]];\n rotateCoordinate(center, rotation - this.getRotation());\n addCoordinate(center, anchor);\n }\n return center;\n };\n /**\n * @param {number} resolution Target resolution.\n * @param {import(\"./coordinate.js\").Coordinate} anchor Zoom anchor.\n * @return {import(\"./coordinate.js\").Coordinate|undefined} Center for resolution and anchor.\n */\n View.prototype.calculateCenterZoom = function (resolution, anchor) {\n var center;\n var currentCenter = this.getCenterInternal();\n var currentResolution = this.getResolution();\n if (currentCenter !== undefined && currentResolution !== undefined) {\n var x = anchor[0] -\n (resolution * (anchor[0] - currentCenter[0])) / currentResolution;\n var y = anchor[1] -\n (resolution * (anchor[1] - currentCenter[1])) / currentResolution;\n center = [x, y];\n }\n return center;\n };\n /**\n * Returns the current viewport size.\n * @private\n * @param {number} [opt_rotation] Take into account the rotation of the viewport when giving the size\n * @return {import(\"./size.js\").Size} Viewport size or `[100, 100]` when no viewport is found.\n */\n View.prototype.getViewportSize_ = function (opt_rotation) {\n var size = this.viewportSize_;\n if (opt_rotation) {\n var w = size[0];\n var h = size[1];\n return [\n Math.abs(w * Math.cos(opt_rotation)) +\n Math.abs(h * Math.sin(opt_rotation)),\n Math.abs(w * Math.sin(opt_rotation)) +\n Math.abs(h * Math.cos(opt_rotation)),\n ];\n }\n else {\n return size;\n }\n };\n /**\n * Stores the viewport size on the view. The viewport size is not read every time from the DOM\n * to avoid performance hit and layout reflow.\n * This should be done on map size change.\n * Note: the constraints are not resolved during an animation to avoid stopping it\n * @param {import(\"./size.js\").Size} [opt_size] Viewport size; if undefined, [100, 100] is assumed\n */\n View.prototype.setViewportSize = function (opt_size) {\n this.viewportSize_ = Array.isArray(opt_size)\n ? opt_size.slice()\n : [100, 100];\n if (!this.getAnimating()) {\n this.resolveConstraints(0);\n }\n };\n /**\n * Get the view center.\n * @return {import(\"./coordinate.js\").Coordinate|undefined} The center of the view.\n * @observable\n * @api\n */\n View.prototype.getCenter = function () {\n var center = this.getCenterInternal();\n if (!center) {\n return center;\n }\n return toUserCoordinate(center, this.getProjection());\n };\n /**\n * Get the view center without transforming to user projection.\n * @return {import(\"./coordinate.js\").Coordinate|undefined} The center of the view.\n */\n View.prototype.getCenterInternal = function () {\n return /** @type {import(\"./coordinate.js\").Coordinate|undefined} */ (this.get(ViewProperty.CENTER));\n };\n /**\n * @return {Constraints} Constraints.\n */\n View.prototype.getConstraints = function () {\n return this.constraints_;\n };\n /**\n * @return {boolean} Resolution constraint is set\n */\n View.prototype.getConstrainResolution = function () {\n return this.options_.constrainResolution;\n };\n /**\n * @param {Array} [opt_hints] Destination array.\n * @return {Array} Hint.\n */\n View.prototype.getHints = function (opt_hints) {\n if (opt_hints !== undefined) {\n opt_hints[0] = this.hints_[0];\n opt_hints[1] = this.hints_[1];\n return opt_hints;\n }\n else {\n return this.hints_.slice();\n }\n };\n /**\n * Calculate the extent for the current view state and the passed size.\n * The size is the pixel dimensions of the box into which the calculated extent\n * should fit. In most cases you want to get the extent of the entire map,\n * that is `map.getSize()`.\n * @param {import(\"./size.js\").Size} [opt_size] Box pixel size. If not provided, the size\n * of the map that uses this view will be used.\n * @return {import(\"./extent.js\").Extent} Extent.\n * @api\n */\n View.prototype.calculateExtent = function (opt_size) {\n var extent = this.calculateExtentInternal(opt_size);\n return toUserExtent(extent, this.getProjection());\n };\n /**\n * @param {import(\"./size.js\").Size} [opt_size] Box pixel size. If not provided,\n * the map's last known viewport size will be used.\n * @return {import(\"./extent.js\").Extent} Extent.\n */\n View.prototype.calculateExtentInternal = function (opt_size) {\n var size = opt_size || this.getViewportSizeMinusPadding_();\n var center = /** @type {!import(\"./coordinate.js\").Coordinate} */ (this.getCenterInternal());\n assert(center, 1); // The view center is not defined\n var resolution = /** @type {!number} */ (this.getResolution());\n assert(resolution !== undefined, 2); // The view resolution is not defined\n var rotation = /** @type {!number} */ (this.getRotation());\n assert(rotation !== undefined, 3); // The view rotation is not defined\n return getForViewAndSize(center, resolution, rotation, size);\n };\n /**\n * Get the maximum resolution of the view.\n * @return {number} The maximum resolution of the view.\n * @api\n */\n View.prototype.getMaxResolution = function () {\n return this.maxResolution_;\n };\n /**\n * Get the minimum resolution of the view.\n * @return {number} The minimum resolution of the view.\n * @api\n */\n View.prototype.getMinResolution = function () {\n return this.minResolution_;\n };\n /**\n * Get the maximum zoom level for the view.\n * @return {number} The maximum zoom level.\n * @api\n */\n View.prototype.getMaxZoom = function () {\n return /** @type {number} */ (this.getZoomForResolution(this.minResolution_));\n };\n /**\n * Set a new maximum zoom level for the view.\n * @param {number} zoom The maximum zoom level.\n * @api\n */\n View.prototype.setMaxZoom = function (zoom) {\n this.applyOptions_(this.getUpdatedOptions_({ maxZoom: zoom }));\n };\n /**\n * Get the minimum zoom level for the view.\n * @return {number} The minimum zoom level.\n * @api\n */\n View.prototype.getMinZoom = function () {\n return /** @type {number} */ (this.getZoomForResolution(this.maxResolution_));\n };\n /**\n * Set a new minimum zoom level for the view.\n * @param {number} zoom The minimum zoom level.\n * @api\n */\n View.prototype.setMinZoom = function (zoom) {\n this.applyOptions_(this.getUpdatedOptions_({ minZoom: zoom }));\n };\n /**\n * Set whether the view should allow intermediary zoom levels.\n * @param {boolean} enabled Whether the resolution is constrained.\n * @api\n */\n View.prototype.setConstrainResolution = function (enabled) {\n this.applyOptions_(this.getUpdatedOptions_({ constrainResolution: enabled }));\n };\n /**\n * Get the view projection.\n * @return {import(\"./proj/Projection.js\").default} The projection of the view.\n * @api\n */\n View.prototype.getProjection = function () {\n return this.projection_;\n };\n /**\n * Get the view resolution.\n * @return {number|undefined} The resolution of the view.\n * @observable\n * @api\n */\n View.prototype.getResolution = function () {\n return /** @type {number|undefined} */ (this.get(ViewProperty.RESOLUTION));\n };\n /**\n * Get the resolutions for the view. This returns the array of resolutions\n * passed to the constructor of the View, or undefined if none were given.\n * @return {Array|undefined} The resolutions of the view.\n * @api\n */\n View.prototype.getResolutions = function () {\n return this.resolutions_;\n };\n /**\n * Get the resolution for a provided extent (in map units) and size (in pixels).\n * @param {import(\"./extent.js\").Extent} extent Extent.\n * @param {import(\"./size.js\").Size} [opt_size] Box pixel size.\n * @return {number} The resolution at which the provided extent will render at\n * the given size.\n * @api\n */\n View.prototype.getResolutionForExtent = function (extent, opt_size) {\n return this.getResolutionForExtentInternal(fromUserExtent(extent, this.getProjection()), opt_size);\n };\n /**\n * Get the resolution for a provided extent (in map units) and size (in pixels).\n * @param {import(\"./extent.js\").Extent} extent Extent.\n * @param {import(\"./size.js\").Size} [opt_size] Box pixel size.\n * @return {number} The resolution at which the provided extent will render at\n * the given size.\n */\n View.prototype.getResolutionForExtentInternal = function (extent, opt_size) {\n var size = opt_size || this.getViewportSizeMinusPadding_();\n var xResolution = getWidth(extent) / size[0];\n var yResolution = getHeight(extent) / size[1];\n return Math.max(xResolution, yResolution);\n };\n /**\n * Return a function that returns a value between 0 and 1 for a\n * resolution. Exponential scaling is assumed.\n * @param {number} [opt_power] Power.\n * @return {function(number): number} Resolution for value function.\n */\n View.prototype.getResolutionForValueFunction = function (opt_power) {\n var power = opt_power || 2;\n var maxResolution = this.getConstrainedResolution(this.maxResolution_);\n var minResolution = this.minResolution_;\n var max = Math.log(maxResolution / minResolution) / Math.log(power);\n return (\n /**\n * @param {number} value Value.\n * @return {number} Resolution.\n */\n function (value) {\n var resolution = maxResolution / Math.pow(power, value * max);\n return resolution;\n });\n };\n /**\n * Get the view rotation.\n * @return {number} The rotation of the view in radians.\n * @observable\n * @api\n */\n View.prototype.getRotation = function () {\n return /** @type {number} */ (this.get(ViewProperty.ROTATION));\n };\n /**\n * Return a function that returns a resolution for a value between\n * 0 and 1. Exponential scaling is assumed.\n * @param {number} [opt_power] Power.\n * @return {function(number): number} Value for resolution function.\n */\n View.prototype.getValueForResolutionFunction = function (opt_power) {\n var logPower = Math.log(opt_power || 2);\n var maxResolution = this.getConstrainedResolution(this.maxResolution_);\n var minResolution = this.minResolution_;\n var max = Math.log(maxResolution / minResolution) / logPower;\n return (\n /**\n * @param {number} resolution Resolution.\n * @return {number} Value.\n */\n function (resolution) {\n var value = Math.log(maxResolution / resolution) / logPower / max;\n return value;\n });\n };\n /**\n * Returns the size of the viewport minus padding.\n * @private\n * @param {number} [opt_rotation] Take into account the rotation of the viewport when giving the size\n * @return {import(\"./size.js\").Size} Viewport size reduced by the padding.\n */\n View.prototype.getViewportSizeMinusPadding_ = function (opt_rotation) {\n var size = this.getViewportSize_(opt_rotation);\n var padding = this.padding_;\n if (padding) {\n size = [\n size[0] - padding[1] - padding[3],\n size[1] - padding[0] - padding[2],\n ];\n }\n return size;\n };\n /**\n * @return {State} View state.\n */\n View.prototype.getState = function () {\n var projection = this.getProjection();\n var resolution = this.getResolution();\n var rotation = this.getRotation();\n var center = /** @type {import(\"./coordinate.js\").Coordinate} */ (this.getCenterInternal());\n var padding = this.padding_;\n if (padding) {\n var reducedSize = this.getViewportSizeMinusPadding_();\n center = calculateCenterOn(center, this.getViewportSize_(), [reducedSize[0] / 2 + padding[3], reducedSize[1] / 2 + padding[0]], resolution, rotation);\n }\n return {\n center: center.slice(0),\n projection: projection !== undefined ? projection : null,\n resolution: resolution,\n nextCenter: this.nextCenter_,\n nextResolution: this.nextResolution_,\n nextRotation: this.nextRotation_,\n rotation: rotation,\n zoom: this.getZoom(),\n };\n };\n /**\n * Get the current zoom level. This method may return non-integer zoom levels\n * if the view does not constrain the resolution, or if an interaction or\n * animation is underway.\n * @return {number|undefined} Zoom.\n * @api\n */\n View.prototype.getZoom = function () {\n var zoom;\n var resolution = this.getResolution();\n if (resolution !== undefined) {\n zoom = this.getZoomForResolution(resolution);\n }\n return zoom;\n };\n /**\n * Get the zoom level for a resolution.\n * @param {number} resolution The resolution.\n * @return {number|undefined} The zoom level for the provided resolution.\n * @api\n */\n View.prototype.getZoomForResolution = function (resolution) {\n var offset = this.minZoom_ || 0;\n var max, zoomFactor;\n if (this.resolutions_) {\n var nearest = linearFindNearest(this.resolutions_, resolution, 1);\n offset = nearest;\n max = this.resolutions_[nearest];\n if (nearest == this.resolutions_.length - 1) {\n zoomFactor = 2;\n }\n else {\n zoomFactor = max / this.resolutions_[nearest + 1];\n }\n }\n else {\n max = this.maxResolution_;\n zoomFactor = this.zoomFactor_;\n }\n return offset + Math.log(max / resolution) / Math.log(zoomFactor);\n };\n /**\n * Get the resolution for a zoom level.\n * @param {number} zoom Zoom level.\n * @return {number} The view resolution for the provided zoom level.\n * @api\n */\n View.prototype.getResolutionForZoom = function (zoom) {\n if (this.resolutions_) {\n if (this.resolutions_.length <= 1) {\n return 0;\n }\n var baseLevel = clamp(Math.floor(zoom), 0, this.resolutions_.length - 2);\n var zoomFactor = this.resolutions_[baseLevel] / this.resolutions_[baseLevel + 1];\n return (this.resolutions_[baseLevel] /\n Math.pow(zoomFactor, clamp(zoom - baseLevel, 0, 1)));\n }\n else {\n return (this.maxResolution_ / Math.pow(this.zoomFactor_, zoom - this.minZoom_));\n }\n };\n /**\n * Fit the given geometry or extent based on the given map size and border.\n * The size is pixel dimensions of the box to fit the extent into.\n * In most cases you will want to use the map size, that is `map.getSize()`.\n * Takes care of the map angle.\n * @param {import(\"./geom/SimpleGeometry.js\").default|import(\"./extent.js\").Extent} geometryOrExtent The geometry or\n * extent to fit the view to.\n * @param {FitOptions} [opt_options] Options.\n * @api\n */\n View.prototype.fit = function (geometryOrExtent, opt_options) {\n /** @type {import(\"./geom/SimpleGeometry.js\").default} */\n var geometry;\n assert(Array.isArray(geometryOrExtent) ||\n typeof ( /** @type {?} */(geometryOrExtent).getSimplifiedGeometry) ===\n 'function', 24); // Invalid extent or geometry provided as `geometry`\n if (Array.isArray(geometryOrExtent)) {\n assert(!isEmpty(geometryOrExtent), 25); // Cannot fit empty extent provided as `geometry`\n var extent = fromUserExtent(geometryOrExtent, this.getProjection());\n geometry = polygonFromExtent(extent);\n }\n else if (geometryOrExtent.getType() === GeometryType.CIRCLE) {\n var extent = fromUserExtent(geometryOrExtent.getExtent(), this.getProjection());\n geometry = polygonFromExtent(extent);\n geometry.rotate(this.getRotation(), getCenter(extent));\n }\n else {\n var userProjection = getUserProjection();\n if (userProjection) {\n geometry = /** @type {import(\"./geom/SimpleGeometry.js\").default} */ (geometryOrExtent\n .clone()\n .transform(userProjection, this.getProjection()));\n }\n else {\n geometry = geometryOrExtent;\n }\n }\n this.fitInternal(geometry, opt_options);\n };\n /**\n * Calculate rotated extent\n * @param {import(\"./geom/SimpleGeometry.js\").default} geometry The geometry.\n * @return {import(\"./extent\").Extent} The rotated extent for the geometry.\n */\n View.prototype.rotatedExtentForGeometry = function (geometry) {\n var rotation = this.getRotation();\n var cosAngle = Math.cos(rotation);\n var sinAngle = Math.sin(-rotation);\n var coords = geometry.getFlatCoordinates();\n var stride = geometry.getStride();\n var minRotX = +Infinity;\n var minRotY = +Infinity;\n var maxRotX = -Infinity;\n var maxRotY = -Infinity;\n for (var i = 0, ii = coords.length; i < ii; i += stride) {\n var rotX = coords[i] * cosAngle - coords[i + 1] * sinAngle;\n var rotY = coords[i] * sinAngle + coords[i + 1] * cosAngle;\n minRotX = Math.min(minRotX, rotX);\n minRotY = Math.min(minRotY, rotY);\n maxRotX = Math.max(maxRotX, rotX);\n maxRotY = Math.max(maxRotY, rotY);\n }\n return [minRotX, minRotY, maxRotX, maxRotY];\n };\n /**\n * @param {import(\"./geom/SimpleGeometry.js\").default} geometry The geometry.\n * @param {FitOptions} [opt_options] Options.\n */\n View.prototype.fitInternal = function (geometry, opt_options) {\n var options = opt_options || {};\n var size = options.size;\n if (!size) {\n size = this.getViewportSizeMinusPadding_();\n }\n var padding = options.padding !== undefined ? options.padding : [0, 0, 0, 0];\n var nearest = options.nearest !== undefined ? options.nearest : false;\n var minResolution;\n if (options.minResolution !== undefined) {\n minResolution = options.minResolution;\n }\n else if (options.maxZoom !== undefined) {\n minResolution = this.getResolutionForZoom(options.maxZoom);\n }\n else {\n minResolution = 0;\n }\n var rotatedExtent = this.rotatedExtentForGeometry(geometry);\n // calculate resolution\n var resolution = this.getResolutionForExtentInternal(rotatedExtent, [\n size[0] - padding[1] - padding[3],\n size[1] - padding[0] - padding[2],\n ]);\n resolution = isNaN(resolution)\n ? minResolution\n : Math.max(resolution, minResolution);\n resolution = this.getConstrainedResolution(resolution, nearest ? 0 : 1);\n // calculate center\n var rotation = this.getRotation();\n var sinAngle = Math.sin(rotation);\n var cosAngle = Math.cos(rotation);\n var centerRot = getCenter(rotatedExtent);\n centerRot[0] += ((padding[1] - padding[3]) / 2) * resolution;\n centerRot[1] += ((padding[0] - padding[2]) / 2) * resolution;\n var centerX = centerRot[0] * cosAngle - centerRot[1] * sinAngle;\n var centerY = centerRot[1] * cosAngle + centerRot[0] * sinAngle;\n var center = this.getConstrainedCenter([centerX, centerY], resolution);\n var callback = options.callback ? options.callback : VOID;\n if (options.duration !== undefined) {\n this.animateInternal({\n resolution: resolution,\n center: center,\n duration: options.duration,\n easing: options.easing,\n }, callback);\n }\n else {\n this.targetResolution_ = resolution;\n this.targetCenter_ = center;\n this.applyTargetState_(false, true);\n animationCallback(callback, true);\n }\n };\n /**\n * Center on coordinate and view position.\n * @param {import(\"./coordinate.js\").Coordinate} coordinate Coordinate.\n * @param {import(\"./size.js\").Size} size Box pixel size.\n * @param {import(\"./pixel.js\").Pixel} position Position on the view to center on.\n * @api\n */\n View.prototype.centerOn = function (coordinate, size, position) {\n this.centerOnInternal(fromUserCoordinate(coordinate, this.getProjection()), size, position);\n };\n /**\n * @param {import(\"./coordinate.js\").Coordinate} coordinate Coordinate.\n * @param {import(\"./size.js\").Size} size Box pixel size.\n * @param {import(\"./pixel.js\").Pixel} position Position on the view to center on.\n */\n View.prototype.centerOnInternal = function (coordinate, size, position) {\n this.setCenterInternal(calculateCenterOn(coordinate, size, position, this.getResolution(), this.getRotation()));\n };\n /**\n * Calculates the shift between map and viewport center.\n * @param {import(\"./coordinate.js\").Coordinate} center Center.\n * @param {number} resolution Resolution.\n * @param {number} rotation Rotation.\n * @param {import(\"./size.js\").Size} size Size.\n * @return {Array|undefined} Center shift.\n */\n View.prototype.calculateCenterShift = function (center, resolution, rotation, size) {\n var centerShift;\n var padding = this.padding_;\n if (padding && center) {\n var reducedSize = this.getViewportSizeMinusPadding_(-rotation);\n var shiftedCenter = calculateCenterOn(center, size, [reducedSize[0] / 2 + padding[3], reducedSize[1] / 2 + padding[0]], resolution, rotation);\n centerShift = [\n center[0] - shiftedCenter[0],\n center[1] - shiftedCenter[1],\n ];\n }\n return centerShift;\n };\n /**\n * @return {boolean} Is defined.\n */\n View.prototype.isDef = function () {\n return !!this.getCenterInternal() && this.getResolution() !== undefined;\n };\n /**\n * Adds relative coordinates to the center of the view. Any extent constraint will apply.\n * @param {import(\"./coordinate.js\").Coordinate} deltaCoordinates Relative value to add.\n * @api\n */\n View.prototype.adjustCenter = function (deltaCoordinates) {\n var center = toUserCoordinate(this.targetCenter_, this.getProjection());\n this.setCenter([\n center[0] + deltaCoordinates[0],\n center[1] + deltaCoordinates[1],\n ]);\n };\n /**\n * Adds relative coordinates to the center of the view. Any extent constraint will apply.\n * @param {import(\"./coordinate.js\").Coordinate} deltaCoordinates Relative value to add.\n */\n View.prototype.adjustCenterInternal = function (deltaCoordinates) {\n var center = this.targetCenter_;\n this.setCenterInternal([\n center[0] + deltaCoordinates[0],\n center[1] + deltaCoordinates[1],\n ]);\n };\n /**\n * Multiply the view resolution by a ratio, optionally using an anchor. Any resolution\n * constraint will apply.\n * @param {number} ratio The ratio to apply on the view resolution.\n * @param {import(\"./coordinate.js\").Coordinate} [opt_anchor] The origin of the transformation.\n * @api\n */\n View.prototype.adjustResolution = function (ratio, opt_anchor) {\n var anchor = opt_anchor && fromUserCoordinate(opt_anchor, this.getProjection());\n this.adjustResolutionInternal(ratio, anchor);\n };\n /**\n * Multiply the view resolution by a ratio, optionally using an anchor. Any resolution\n * constraint will apply.\n * @param {number} ratio The ratio to apply on the view resolution.\n * @param {import(\"./coordinate.js\").Coordinate} [opt_anchor] The origin of the transformation.\n */\n View.prototype.adjustResolutionInternal = function (ratio, opt_anchor) {\n var isMoving = this.getAnimating() || this.getInteracting();\n var size = this.getViewportSize_(this.getRotation());\n var newResolution = this.constraints_.resolution(this.targetResolution_ * ratio, 0, size, isMoving);\n if (opt_anchor) {\n this.targetCenter_ = this.calculateCenterZoom(newResolution, opt_anchor);\n }\n this.targetResolution_ *= ratio;\n this.applyTargetState_();\n };\n /**\n * Adds a value to the view zoom level, optionally using an anchor. Any resolution\n * constraint will apply.\n * @param {number} delta Relative value to add to the zoom level.\n * @param {import(\"./coordinate.js\").Coordinate} [opt_anchor] The origin of the transformation.\n * @api\n */\n View.prototype.adjustZoom = function (delta, opt_anchor) {\n this.adjustResolution(Math.pow(this.zoomFactor_, -delta), opt_anchor);\n };\n /**\n * Adds a value to the view rotation, optionally using an anchor. Any rotation\n * constraint will apply.\n * @param {number} delta Relative value to add to the zoom rotation, in radians.\n * @param {import(\"./coordinate.js\").Coordinate} [opt_anchor] The rotation center.\n * @api\n */\n View.prototype.adjustRotation = function (delta, opt_anchor) {\n if (opt_anchor) {\n opt_anchor = fromUserCoordinate(opt_anchor, this.getProjection());\n }\n this.adjustRotationInternal(delta, opt_anchor);\n };\n /**\n * @param {number} delta Relative value to add to the zoom rotation, in radians.\n * @param {import(\"./coordinate.js\").Coordinate} [opt_anchor] The rotation center.\n */\n View.prototype.adjustRotationInternal = function (delta, opt_anchor) {\n var isMoving = this.getAnimating() || this.getInteracting();\n var newRotation = this.constraints_.rotation(this.targetRotation_ + delta, isMoving);\n if (opt_anchor) {\n this.targetCenter_ = this.calculateCenterRotate(newRotation, opt_anchor);\n }\n this.targetRotation_ += delta;\n this.applyTargetState_();\n };\n /**\n * Set the center of the current view. Any extent constraint will apply.\n * @param {import(\"./coordinate.js\").Coordinate|undefined} center The center of the view.\n * @observable\n * @api\n */\n View.prototype.setCenter = function (center) {\n this.setCenterInternal(fromUserCoordinate(center, this.getProjection()));\n };\n /**\n * Set the center using the view projection (not the user projection).\n * @param {import(\"./coordinate.js\").Coordinate|undefined} center The center of the view.\n */\n View.prototype.setCenterInternal = function (center) {\n this.targetCenter_ = center;\n this.applyTargetState_();\n };\n /**\n * @param {import(\"./ViewHint.js\").default} hint Hint.\n * @param {number} delta Delta.\n * @return {number} New value.\n */\n View.prototype.setHint = function (hint, delta) {\n this.hints_[hint] += delta;\n this.changed();\n return this.hints_[hint];\n };\n /**\n * Set the resolution for this view. Any resolution constraint will apply.\n * @param {number|undefined} resolution The resolution of the view.\n * @observable\n * @api\n */\n View.prototype.setResolution = function (resolution) {\n this.targetResolution_ = resolution;\n this.applyTargetState_();\n };\n /**\n * Set the rotation for this view. Any rotation constraint will apply.\n * @param {number} rotation The rotation of the view in radians.\n * @observable\n * @api\n */\n View.prototype.setRotation = function (rotation) {\n this.targetRotation_ = rotation;\n this.applyTargetState_();\n };\n /**\n * Zoom to a specific zoom level. Any resolution constrain will apply.\n * @param {number} zoom Zoom level.\n * @api\n */\n View.prototype.setZoom = function (zoom) {\n this.setResolution(this.getResolutionForZoom(zoom));\n };\n /**\n * Recompute rotation/resolution/center based on target values.\n * Note: we have to compute rotation first, then resolution and center considering that\n * parameters can influence one another in case a view extent constraint is present.\n * @param {boolean} [opt_doNotCancelAnims] Do not cancel animations.\n * @param {boolean} [opt_forceMoving] Apply constraints as if the view is moving.\n * @private\n */\n View.prototype.applyTargetState_ = function (opt_doNotCancelAnims, opt_forceMoving) {\n var isMoving = this.getAnimating() || this.getInteracting() || opt_forceMoving;\n // compute rotation\n var newRotation = this.constraints_.rotation(this.targetRotation_, isMoving);\n var size = this.getViewportSize_(newRotation);\n var newResolution = this.constraints_.resolution(this.targetResolution_, 0, size, isMoving);\n var newCenter = this.constraints_.center(this.targetCenter_, newResolution, size, isMoving, this.calculateCenterShift(this.targetCenter_, newResolution, newRotation, size));\n if (this.get(ViewProperty.ROTATION) !== newRotation) {\n this.set(ViewProperty.ROTATION, newRotation);\n }\n if (this.get(ViewProperty.RESOLUTION) !== newResolution) {\n this.set(ViewProperty.RESOLUTION, newResolution);\n }\n if (!this.get(ViewProperty.CENTER) ||\n !equals(this.get(ViewProperty.CENTER), newCenter)) {\n this.set(ViewProperty.CENTER, newCenter);\n }\n if (this.getAnimating() && !opt_doNotCancelAnims) {\n this.cancelAnimations();\n }\n this.cancelAnchor_ = undefined;\n };\n /**\n * If any constraints need to be applied, an animation will be triggered.\n * This is typically done on interaction end.\n * Note: calling this with a duration of 0 will apply the constrained values straight away,\n * without animation.\n * @param {number} [opt_duration] The animation duration in ms.\n * @param {number} [opt_resolutionDirection] Which direction to zoom.\n * @param {import(\"./coordinate.js\").Coordinate} [opt_anchor] The origin of the transformation.\n */\n View.prototype.resolveConstraints = function (opt_duration, opt_resolutionDirection, opt_anchor) {\n var duration = opt_duration !== undefined ? opt_duration : 200;\n var direction = opt_resolutionDirection || 0;\n var newRotation = this.constraints_.rotation(this.targetRotation_);\n var size = this.getViewportSize_(newRotation);\n var newResolution = this.constraints_.resolution(this.targetResolution_, direction, size);\n var newCenter = this.constraints_.center(this.targetCenter_, newResolution, size, false, this.calculateCenterShift(this.targetCenter_, newResolution, newRotation, size));\n if (duration === 0 && !this.cancelAnchor_) {\n this.targetResolution_ = newResolution;\n this.targetRotation_ = newRotation;\n this.targetCenter_ = newCenter;\n this.applyTargetState_();\n return;\n }\n var anchor = opt_anchor || (duration === 0 ? this.cancelAnchor_ : undefined);\n this.cancelAnchor_ = undefined;\n if (this.getResolution() !== newResolution ||\n this.getRotation() !== newRotation ||\n !this.getCenterInternal() ||\n !equals(this.getCenterInternal(), newCenter)) {\n if (this.getAnimating()) {\n this.cancelAnimations();\n }\n this.animateInternal({\n rotation: newRotation,\n center: newCenter,\n resolution: newResolution,\n duration: duration,\n easing: easeOut,\n anchor: anchor,\n });\n }\n };\n /**\n * Notify the View that an interaction has started.\n * The view state will be resolved to a stable one if needed\n * (depending on its constraints).\n * @api\n */\n View.prototype.beginInteraction = function () {\n this.resolveConstraints(0);\n this.setHint(ViewHint.INTERACTING, 1);\n };\n /**\n * Notify the View that an interaction has ended. The view state will be resolved\n * to a stable one if needed (depending on its constraints).\n * @param {number} [opt_duration] Animation duration in ms.\n * @param {number} [opt_resolutionDirection] Which direction to zoom.\n * @param {import(\"./coordinate.js\").Coordinate} [opt_anchor] The origin of the transformation.\n * @api\n */\n View.prototype.endInteraction = function (opt_duration, opt_resolutionDirection, opt_anchor) {\n var anchor = opt_anchor && fromUserCoordinate(opt_anchor, this.getProjection());\n this.endInteractionInternal(opt_duration, opt_resolutionDirection, anchor);\n };\n /**\n * Notify the View that an interaction has ended. The view state will be resolved\n * to a stable one if needed (depending on its constraints).\n * @param {number} [opt_duration] Animation duration in ms.\n * @param {number} [opt_resolutionDirection] Which direction to zoom.\n * @param {import(\"./coordinate.js\").Coordinate} [opt_anchor] The origin of the transformation.\n */\n View.prototype.endInteractionInternal = function (opt_duration, opt_resolutionDirection, opt_anchor) {\n this.setHint(ViewHint.INTERACTING, -1);\n this.resolveConstraints(opt_duration, opt_resolutionDirection, opt_anchor);\n };\n /**\n * Get a valid position for the view center according to the current constraints.\n * @param {import(\"./coordinate.js\").Coordinate|undefined} targetCenter Target center position.\n * @param {number} [opt_targetResolution] Target resolution. If not supplied, the current one will be used.\n * This is useful to guess a valid center position at a different zoom level.\n * @return {import(\"./coordinate.js\").Coordinate|undefined} Valid center position.\n */\n View.prototype.getConstrainedCenter = function (targetCenter, opt_targetResolution) {\n var size = this.getViewportSize_(this.getRotation());\n return this.constraints_.center(targetCenter, opt_targetResolution || this.getResolution(), size);\n };\n /**\n * Get a valid zoom level according to the current view constraints.\n * @param {number|undefined} targetZoom Target zoom.\n * @param {number} [opt_direction=0] Indicate which resolution should be used\n * by a renderer if the view resolution does not match any resolution of the tile source.\n * If 0, the nearest resolution will be used. If 1, the nearest lower resolution\n * will be used. If -1, the nearest higher resolution will be used.\n * @return {number|undefined} Valid zoom level.\n */\n View.prototype.getConstrainedZoom = function (targetZoom, opt_direction) {\n var targetRes = this.getResolutionForZoom(targetZoom);\n return this.getZoomForResolution(this.getConstrainedResolution(targetRes, opt_direction));\n };\n /**\n * Get a valid resolution according to the current view constraints.\n * @param {number|undefined} targetResolution Target resolution.\n * @param {number} [opt_direction=0] Indicate which resolution should be used\n * by a renderer if the view resolution does not match any resolution of the tile source.\n * If 0, the nearest resolution will be used. If 1, the nearest lower resolution\n * will be used. If -1, the nearest higher resolution will be used.\n * @return {number|undefined} Valid resolution.\n */\n View.prototype.getConstrainedResolution = function (targetResolution, opt_direction) {\n var direction = opt_direction || 0;\n var size = this.getViewportSize_(this.getRotation());\n return this.constraints_.resolution(targetResolution, direction, size);\n };\n return View;\n}(BaseObject));\n/**\n * @param {Function} callback Callback.\n * @param {*} returnValue Return value.\n */\nfunction animationCallback(callback, returnValue) {\n setTimeout(function () {\n callback(returnValue);\n }, 0);\n}\n/**\n * @param {ViewOptions} options View options.\n * @return {import(\"./centerconstraint.js\").Type} The constraint.\n */\nexport function createCenterConstraint(options) {\n if (options.extent !== undefined) {\n var smooth = options.smoothExtentConstraint !== undefined\n ? options.smoothExtentConstraint\n : true;\n return createExtent(options.extent, options.constrainOnlyCenter, smooth);\n }\n var projection = createProjection(options.projection, 'EPSG:3857');\n if (options.multiWorld !== true && projection.isGlobal()) {\n var extent = projection.getExtent().slice();\n extent[0] = -Infinity;\n extent[2] = Infinity;\n return createExtent(extent, false, false);\n }\n return centerNone;\n}\n/**\n * @param {ViewOptions} options View options.\n * @return {{constraint: import(\"./resolutionconstraint.js\").Type, maxResolution: number,\n * minResolution: number, minZoom: number, zoomFactor: number}} The constraint.\n */\nexport function createResolutionConstraint(options) {\n var resolutionConstraint;\n var maxResolution;\n var minResolution;\n // TODO: move these to be ol constants\n // see https://github.com/openlayers/openlayers/issues/2076\n var defaultMaxZoom = 28;\n var defaultZoomFactor = 2;\n var minZoom = options.minZoom !== undefined ? options.minZoom : DEFAULT_MIN_ZOOM;\n var maxZoom = options.maxZoom !== undefined ? options.maxZoom : defaultMaxZoom;\n var zoomFactor = options.zoomFactor !== undefined ? options.zoomFactor : defaultZoomFactor;\n var multiWorld = options.multiWorld !== undefined ? options.multiWorld : false;\n var smooth = options.smoothResolutionConstraint !== undefined\n ? options.smoothResolutionConstraint\n : true;\n var showFullExtent = options.showFullExtent !== undefined ? options.showFullExtent : false;\n var projection = createProjection(options.projection, 'EPSG:3857');\n var projExtent = projection.getExtent();\n var constrainOnlyCenter = options.constrainOnlyCenter;\n var extent = options.extent;\n if (!multiWorld && !extent && projection.isGlobal()) {\n constrainOnlyCenter = false;\n extent = projExtent;\n }\n if (options.resolutions !== undefined) {\n var resolutions = options.resolutions;\n maxResolution = resolutions[minZoom];\n minResolution =\n resolutions[maxZoom] !== undefined\n ? resolutions[maxZoom]\n : resolutions[resolutions.length - 1];\n if (options.constrainResolution) {\n resolutionConstraint = createSnapToResolutions(resolutions, smooth, !constrainOnlyCenter && extent, showFullExtent);\n }\n else {\n resolutionConstraint = createMinMaxResolution(maxResolution, minResolution, smooth, !constrainOnlyCenter && extent, showFullExtent);\n }\n }\n else {\n // calculate the default min and max resolution\n var size = !projExtent\n ? // use an extent that can fit the whole world if need be\n (360 * METERS_PER_UNIT[Units.DEGREES]) / projection.getMetersPerUnit()\n : Math.max(getWidth(projExtent), getHeight(projExtent));\n var defaultMaxResolution = size / DEFAULT_TILE_SIZE / Math.pow(defaultZoomFactor, DEFAULT_MIN_ZOOM);\n var defaultMinResolution = defaultMaxResolution /\n Math.pow(defaultZoomFactor, defaultMaxZoom - DEFAULT_MIN_ZOOM);\n // user provided maxResolution takes precedence\n maxResolution = options.maxResolution;\n if (maxResolution !== undefined) {\n minZoom = 0;\n }\n else {\n maxResolution = defaultMaxResolution / Math.pow(zoomFactor, minZoom);\n }\n // user provided minResolution takes precedence\n minResolution = options.minResolution;\n if (minResolution === undefined) {\n if (options.maxZoom !== undefined) {\n if (options.maxResolution !== undefined) {\n minResolution = maxResolution / Math.pow(zoomFactor, maxZoom);\n }\n else {\n minResolution = defaultMaxResolution / Math.pow(zoomFactor, maxZoom);\n }\n }\n else {\n minResolution = defaultMinResolution;\n }\n }\n // given discrete zoom levels, minResolution may be different than provided\n maxZoom =\n minZoom +\n Math.floor(Math.log(maxResolution / minResolution) / Math.log(zoomFactor));\n minResolution = maxResolution / Math.pow(zoomFactor, maxZoom - minZoom);\n if (options.constrainResolution) {\n resolutionConstraint = createSnapToPower(zoomFactor, maxResolution, minResolution, smooth, !constrainOnlyCenter && extent, showFullExtent);\n }\n else {\n resolutionConstraint = createMinMaxResolution(maxResolution, minResolution, smooth, !constrainOnlyCenter && extent, showFullExtent);\n }\n }\n return {\n constraint: resolutionConstraint,\n maxResolution: maxResolution,\n minResolution: minResolution,\n minZoom: minZoom,\n zoomFactor: zoomFactor,\n };\n}\n/**\n * @param {ViewOptions} options View options.\n * @return {import(\"./rotationconstraint.js\").Type} Rotation constraint.\n */\nexport function createRotationConstraint(options) {\n var enableRotation = options.enableRotation !== undefined ? options.enableRotation : true;\n if (enableRotation) {\n var constrainRotation = options.constrainRotation;\n if (constrainRotation === undefined || constrainRotation === true) {\n return createSnapToZero();\n }\n else if (constrainRotation === false) {\n return rotationNone;\n }\n else if (typeof constrainRotation === 'number') {\n return createSnapToN(constrainRotation);\n }\n else {\n return rotationNone;\n }\n }\n else {\n return disable;\n }\n}\n/**\n * Determine if an animation involves no view change.\n * @param {Animation} animation The animation.\n * @return {boolean} The animation involves no view change.\n */\nexport function isNoopAnimation(animation) {\n if (animation.sourceCenter && animation.targetCenter) {\n if (!coordinatesEqual(animation.sourceCenter, animation.targetCenter)) {\n return false;\n }\n }\n if (animation.sourceResolution !== animation.targetResolution) {\n return false;\n }\n if (animation.sourceRotation !== animation.targetRotation) {\n return false;\n }\n return true;\n}\n/**\n * @param {import(\"./coordinate.js\").Coordinate} coordinate Coordinate.\n * @param {import(\"./size.js\").Size} size Box pixel size.\n * @param {import(\"./pixel.js\").Pixel} position Position on the view to center on.\n * @param {number} resolution Resolution.\n * @param {number} rotation Rotation.\n * @return {import(\"./coordinate.js\").Coordinate} Shifted center.\n */\nfunction calculateCenterOn(coordinate, size, position, resolution, rotation) {\n // calculate rotated position\n var cosAngle = Math.cos(-rotation);\n var sinAngle = Math.sin(-rotation);\n var rotX = coordinate[0] * cosAngle - coordinate[1] * sinAngle;\n var rotY = coordinate[1] * cosAngle + coordinate[0] * sinAngle;\n rotX += (size[0] / 2 - position[0]) * resolution;\n rotY += (position[1] - size[1] / 2) * resolution;\n // go back to original angle\n sinAngle = -sinAngle; // go back to original rotation\n var centerX = rotX * cosAngle - rotY * sinAngle;\n var centerY = rotY * cosAngle + rotX * sinAngle;\n return [centerX, centerY];\n}\nexport default View;\n//# sourceMappingURL=View.js.map","/**\n * @module ol/tilegrid/common\n */\n/**\n * Default maximum zoom for default tile grids.\n * @type {number}\n */\nexport var DEFAULT_MAX_ZOOM = 42;\n/**\n * Default tile size.\n * @type {number}\n */\nexport var DEFAULT_TILE_SIZE = 256;\n//# sourceMappingURL=common.js.map","/**\n * @module ol/size\n */\n/**\n * An array of numbers representing a size: `[width, height]`.\n * @typedef {Array} Size\n * @api\n */\n/**\n * Returns a buffered size.\n * @param {Size} size Size.\n * @param {number} num The amount by which to buffer.\n * @param {Size} [opt_size] Optional reusable size array.\n * @return {Size} The buffered size.\n */\nexport function buffer(size, num, opt_size) {\n if (opt_size === undefined) {\n opt_size = [0, 0];\n }\n opt_size[0] = size[0] + 2 * num;\n opt_size[1] = size[1] + 2 * num;\n return opt_size;\n}\n/**\n * Determines if a size has a positive area.\n * @param {Size} size The size to test.\n * @return {boolean} The size has a positive area.\n */\nexport function hasArea(size) {\n return size[0] > 0 && size[1] > 0;\n}\n/**\n * Returns a size scaled by a ratio. The result will be an array of integers.\n * @param {Size} size Size.\n * @param {number} ratio Ratio.\n * @param {Size} [opt_size] Optional reusable size array.\n * @return {Size} The scaled size.\n */\nexport function scale(size, ratio, opt_size) {\n if (opt_size === undefined) {\n opt_size = [0, 0];\n }\n opt_size[0] = (size[0] * ratio + 0.5) | 0;\n opt_size[1] = (size[1] * ratio + 0.5) | 0;\n return opt_size;\n}\n/**\n * Returns an `Size` array for the passed in number (meaning: square) or\n * `Size` array.\n * (meaning: non-square),\n * @param {number|Size} size Width and height.\n * @param {Size} [opt_size] Optional reusable size array.\n * @return {Size} Size.\n * @api\n */\nexport function toSize(size, opt_size) {\n if (Array.isArray(size)) {\n return size;\n }\n else {\n if (opt_size === undefined) {\n opt_size = [size, size];\n }\n else {\n opt_size[0] = size;\n opt_size[1] = size;\n }\n return opt_size;\n }\n}\n//# sourceMappingURL=size.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/PluggableMap\n */\nimport BaseObject from './Object.js';\nimport Collection from './Collection.js';\nimport CollectionEventType from './CollectionEventType.js';\nimport EventType from './events/EventType.js';\nimport LayerGroup from './layer/Group.js';\nimport MapBrowserEvent from './MapBrowserEvent.js';\nimport MapBrowserEventHandler from './MapBrowserEventHandler.js';\nimport MapBrowserEventType from './MapBrowserEventType.js';\nimport MapEvent from './MapEvent.js';\nimport MapEventType from './MapEventType.js';\nimport MapProperty from './MapProperty.js';\nimport ObjectEventType from './ObjectEventType.js';\nimport PointerEventType from './pointer/EventType.js';\nimport RenderEventType from './render/EventType.js';\nimport TileQueue, { getTilePriority } from './TileQueue.js';\nimport View from './View.js';\nimport ViewHint from './ViewHint.js';\nimport { DEVICE_PIXEL_RATIO, PASSIVE_EVENT_LISTENERS } from './has.js';\nimport { TRUE } from './functions.js';\nimport { apply as applyTransform, create as createTransform, } from './transform.js';\nimport { assert } from './asserts.js';\nimport { clone, createOrUpdateEmpty, equals, getForViewAndSize, isEmpty, } from './extent.js';\nimport { fromUserCoordinate, toUserCoordinate } from './proj.js';\nimport { hasArea } from './size.js';\nimport { listen, unlistenByKey } from './events.js';\nimport { removeNode } from './dom.js';\n/**\n * State of the current frame. Only `pixelRatio`, `time` and `viewState` should\n * be used in applications.\n * @typedef {Object} FrameState\n * @property {number} pixelRatio The pixel ratio of the frame.\n * @property {number} time The time when rendering of the frame was requested.\n * @property {import(\"./View.js\").State} viewState The state of the current view.\n * @property {boolean} animate Animate.\n * @property {import(\"./transform.js\").Transform} coordinateToPixelTransform CoordinateToPixelTransform.\n * @property {import(\"rbush\").default} declutterTree DeclutterTree.\n * @property {null|import(\"./extent.js\").Extent} extent Extent.\n * @property {import(\"./extent.js\").Extent} [nextExtent] Next extent during an animation series.\n * @property {number} index Index.\n * @property {Array} layerStatesArray LayerStatesArray.\n * @property {number} layerIndex LayerIndex.\n * @property {import(\"./transform.js\").Transform} pixelToCoordinateTransform PixelToCoordinateTransform.\n * @property {Array} postRenderFunctions PostRenderFunctions.\n * @property {import(\"./size.js\").Size} size Size.\n * @property {TileQueue} tileQueue TileQueue.\n * @property {!Object>} usedTiles UsedTiles.\n * @property {Array} viewHints ViewHints.\n * @property {!Object>} wantedTiles WantedTiles.\n */\n/**\n * @typedef {function(PluggableMap, ?FrameState): any} PostRenderFunction\n */\n/**\n * @typedef {Object} AtPixelOptions\n * @property {undefined|function(import(\"./layer/Layer.js\").default): boolean} [layerFilter] Layer filter\n * function. The filter function will receive one argument, the\n * {@link module:ol/layer/Layer layer-candidate} and it should return a boolean value.\n * Only layers which are visible and for which this function returns `true`\n * will be tested for features. By default, all visible layers will be tested.\n * @property {number} [hitTolerance=0] Hit-detection tolerance in css pixels. Pixels\n * inside the radius around the given position will be checked for features.\n * @property {boolean} [checkWrapped=true] Check-Wrapped Will check for for wrapped geometries inside the range of\n * +/- 1 world width. Works only if a projection is used that can be wrapped.\n */\n/**\n * @typedef {Object} MapOptionsInternal\n * @property {Collection} [controls] Controls.\n * @property {Collection} [interactions] Interactions.\n * @property {HTMLElement|Document} keyboardEventTarget KeyboardEventTarget.\n * @property {Collection} overlays Overlays.\n * @property {Object} values Values.\n */\n/**\n * @typedef {import(\"./ObjectEventType\").Types|'change:layergroup'|'change:size'|'change:target'|'change:view'} MapObjectEventTypes\n */\n/***\n * @template Return\n * @typedef {import(\"./Observable\").OnSignature &\n * import(\"./Observable\").OnSignature &\n * import(\"./Observable\").OnSignature &\n * import(\"./Observable\").OnSignature &\n * import(\"./Observable\").OnSignature &\n * import(\"./Observable\").CombinedOnSignature} PluggableMapOnSignature\n */\n/**\n * Object literal with config options for the map.\n * @typedef {Object} MapOptions\n * @property {Collection|Array} [controls]\n * Controls initially added to the map. If not specified,\n * {@link module:ol/control.defaults} is used.\n * @property {number} [pixelRatio=window.devicePixelRatio] The ratio between\n * physical pixels and device-independent pixels (dips) on the device.\n * @property {Collection|Array} [interactions]\n * Interactions that are initially added to the map. If not specified,\n * {@link module:ol/interaction.defaults} is used.\n * @property {HTMLElement|Document|string} [keyboardEventTarget] The element to\n * listen to keyboard events on. This determines when the `KeyboardPan` and\n * `KeyboardZoom` interactions trigger. For example, if this option is set to\n * `document` the keyboard interactions will always trigger. If this option is\n * not specified, the element the library listens to keyboard events on is the\n * map target (i.e. the user-provided div for the map). If this is not\n * `document`, the target element needs to be focused for key events to be\n * emitted, requiring that the target element has a `tabindex` attribute.\n * @property {Array|Collection|LayerGroup} [layers]\n * Layers. If this is not defined, a map with no layers will be rendered. Note\n * that layers are rendered in the order supplied, so if you want, for example,\n * a vector layer to appear on top of a tile layer, it must come after the tile\n * layer.\n * @property {number} [maxTilesLoading=16] Maximum number tiles to load\n * simultaneously.\n * @property {number} [moveTolerance=1] The minimum distance in pixels the\n * cursor must move to be detected as a map move event instead of a click.\n * Increasing this value can make it easier to click on the map.\n * @property {Collection|Array} [overlays]\n * Overlays initially added to the map. By default, no overlays are added.\n * @property {HTMLElement|string} [target] The container for the map, either the\n * element itself or the `id` of the element. If not specified at construction\n * time, {@link module:ol/Map~Map#setTarget} must be called for the map to be\n * rendered. If passed by element, the container can be in a secondary document.\n * @property {View|Promise} [view] The map's view. No layer sources will be\n * fetched unless this is specified at construction time or through\n * {@link module:ol/Map~Map#setView}.\n */\n/**\n * @fires import(\"./MapBrowserEvent.js\").MapBrowserEvent\n * @fires import(\"./MapEvent.js\").MapEvent\n * @fires import(\"./render/Event.js\").default#precompose\n * @fires import(\"./render/Event.js\").default#postcompose\n * @fires import(\"./render/Event.js\").default#rendercomplete\n * @api\n */\nvar PluggableMap = /** @class */ (function (_super) {\n __extends(PluggableMap, _super);\n /**\n * @param {MapOptions} options Map options.\n */\n function PluggableMap(options) {\n var _this = _super.call(this) || this;\n /***\n * @type {PluggableMapOnSignature}\n */\n _this.on;\n /***\n * @type {PluggableMapOnSignature}\n */\n _this.once;\n /***\n * @type {PluggableMapOnSignature}\n */\n _this.un;\n var optionsInternal = createOptionsInternal(options);\n /** @private */\n _this.boundHandleBrowserEvent_ = _this.handleBrowserEvent.bind(_this);\n /**\n * @type {number}\n * @private\n */\n _this.maxTilesLoading_ =\n options.maxTilesLoading !== undefined ? options.maxTilesLoading : 16;\n /**\n * @private\n * @type {number}\n */\n _this.pixelRatio_ =\n options.pixelRatio !== undefined\n ? options.pixelRatio\n : DEVICE_PIXEL_RATIO;\n /**\n * @private\n * @type {*}\n */\n _this.postRenderTimeoutHandle_;\n /**\n * @private\n * @type {number|undefined}\n */\n _this.animationDelayKey_;\n /**\n * @private\n */\n _this.animationDelay_ = /** @this {PluggableMap} */ function () {\n this.animationDelayKey_ = undefined;\n this.renderFrame_(Date.now());\n }.bind(_this);\n /**\n * @private\n * @type {import(\"./transform.js\").Transform}\n */\n _this.coordinateToPixelTransform_ = createTransform();\n /**\n * @private\n * @type {import(\"./transform.js\").Transform}\n */\n _this.pixelToCoordinateTransform_ = createTransform();\n /**\n * @private\n * @type {number}\n */\n _this.frameIndex_ = 0;\n /**\n * @private\n * @type {?FrameState}\n */\n _this.frameState_ = null;\n /**\n * The extent at the previous 'moveend' event.\n * @private\n * @type {import(\"./extent.js\").Extent}\n */\n _this.previousExtent_ = null;\n /**\n * @private\n * @type {?import(\"./events.js\").EventsKey}\n */\n _this.viewPropertyListenerKey_ = null;\n /**\n * @private\n * @type {?import(\"./events.js\").EventsKey}\n */\n _this.viewChangeListenerKey_ = null;\n /**\n * @private\n * @type {?Array}\n */\n _this.layerGroupPropertyListenerKeys_ = null;\n /**\n * @private\n * @type {!HTMLElement}\n */\n _this.viewport_ = document.createElement('div');\n _this.viewport_.className =\n 'ol-viewport' + ('ontouchstart' in window ? ' ol-touch' : '');\n _this.viewport_.style.position = 'relative';\n _this.viewport_.style.overflow = 'hidden';\n _this.viewport_.style.width = '100%';\n _this.viewport_.style.height = '100%';\n /**\n * @private\n * @type {!HTMLElement}\n */\n _this.overlayContainer_ = document.createElement('div');\n _this.overlayContainer_.style.position = 'absolute';\n _this.overlayContainer_.style.zIndex = '0';\n _this.overlayContainer_.style.width = '100%';\n _this.overlayContainer_.style.height = '100%';\n _this.overlayContainer_.style.pointerEvents = 'none';\n _this.overlayContainer_.className = 'ol-overlaycontainer';\n _this.viewport_.appendChild(_this.overlayContainer_);\n /**\n * @private\n * @type {!HTMLElement}\n */\n _this.overlayContainerStopEvent_ = document.createElement('div');\n _this.overlayContainerStopEvent_.style.position = 'absolute';\n _this.overlayContainerStopEvent_.style.zIndex = '0';\n _this.overlayContainerStopEvent_.style.width = '100%';\n _this.overlayContainerStopEvent_.style.height = '100%';\n _this.overlayContainerStopEvent_.style.pointerEvents = 'none';\n _this.overlayContainerStopEvent_.className = 'ol-overlaycontainer-stopevent';\n _this.viewport_.appendChild(_this.overlayContainerStopEvent_);\n /**\n * @private\n * @type {MapBrowserEventHandler}\n */\n _this.mapBrowserEventHandler_ = null;\n /**\n * @private\n * @type {number}\n */\n _this.moveTolerance_ = options.moveTolerance;\n /**\n * @private\n * @type {HTMLElement|Document}\n */\n _this.keyboardEventTarget_ = optionsInternal.keyboardEventTarget;\n /**\n * @private\n * @type {?Array}\n */\n _this.keyHandlerKeys_ = null;\n /**\n * @type {Collection}\n * @protected\n */\n _this.controls = optionsInternal.controls || new Collection();\n /**\n * @type {Collection}\n * @protected\n */\n _this.interactions = optionsInternal.interactions || new Collection();\n /**\n * @type {Collection}\n * @private\n */\n _this.overlays_ = optionsInternal.overlays;\n /**\n * A lookup of overlays by id.\n * @private\n * @type {Object}\n */\n _this.overlayIdIndex_ = {};\n /**\n * @type {import(\"./renderer/Map.js\").default}\n * @private\n */\n _this.renderer_ = null;\n /**\n * @type {undefined|function(Event): void}\n * @private\n */\n _this.handleResize_;\n /**\n * @private\n * @type {!Array}\n */\n _this.postRenderFunctions_ = [];\n /**\n * @private\n * @type {TileQueue}\n */\n _this.tileQueue_ = new TileQueue(_this.getTilePriority.bind(_this), _this.handleTileChange_.bind(_this));\n _this.addChangeListener(MapProperty.LAYERGROUP, _this.handleLayerGroupChanged_);\n _this.addChangeListener(MapProperty.VIEW, _this.handleViewChanged_);\n _this.addChangeListener(MapProperty.SIZE, _this.handleSizeChanged_);\n _this.addChangeListener(MapProperty.TARGET, _this.handleTargetChanged_);\n // setProperties will trigger the rendering of the map if the map\n // is \"defined\" already.\n _this.setProperties(optionsInternal.values);\n var map = _this;\n if (options.view && !(options.view instanceof View)) {\n options.view.then(function (viewOptions) {\n map.setView(new View(viewOptions));\n });\n }\n _this.controls.addEventListener(CollectionEventType.ADD, \n /**\n * @param {import(\"./Collection.js\").CollectionEvent} event CollectionEvent.\n */\n function (event) {\n event.element.setMap(this);\n }.bind(_this));\n _this.controls.addEventListener(CollectionEventType.REMOVE, \n /**\n * @param {import(\"./Collection.js\").CollectionEvent} event CollectionEvent.\n */\n function (event) {\n event.element.setMap(null);\n }.bind(_this));\n _this.interactions.addEventListener(CollectionEventType.ADD, \n /**\n * @param {import(\"./Collection.js\").CollectionEvent} event CollectionEvent.\n */\n function (event) {\n event.element.setMap(this);\n }.bind(_this));\n _this.interactions.addEventListener(CollectionEventType.REMOVE, \n /**\n * @param {import(\"./Collection.js\").CollectionEvent} event CollectionEvent.\n */\n function (event) {\n event.element.setMap(null);\n }.bind(_this));\n _this.overlays_.addEventListener(CollectionEventType.ADD, \n /**\n * @param {import(\"./Collection.js\").CollectionEvent} event CollectionEvent.\n */\n function (event) {\n this.addOverlayInternal_(\n /** @type {import(\"./Overlay.js\").default} */ (event.element));\n }.bind(_this));\n _this.overlays_.addEventListener(CollectionEventType.REMOVE, \n /**\n * @param {import(\"./Collection.js\").CollectionEvent} event CollectionEvent.\n */\n function (event) {\n var overlay = /** @type {import(\"./Overlay.js\").default} */ (event.element);\n var id = overlay.getId();\n if (id !== undefined) {\n delete this.overlayIdIndex_[id.toString()];\n }\n event.element.setMap(null);\n }.bind(_this));\n _this.controls.forEach(\n /**\n * @param {import(\"./control/Control.js\").default} control Control.\n * @this {PluggableMap}\n */\n function (control) {\n control.setMap(this);\n }.bind(_this));\n _this.interactions.forEach(\n /**\n * @param {import(\"./interaction/Interaction.js\").default} interaction Interaction.\n * @this {PluggableMap}\n */\n function (interaction) {\n interaction.setMap(this);\n }.bind(_this));\n _this.overlays_.forEach(_this.addOverlayInternal_.bind(_this));\n return _this;\n }\n /**\n * @abstract\n * @return {import(\"./renderer/Map.js\").default} The map renderer\n */\n PluggableMap.prototype.createRenderer = function () {\n throw new Error('Use a map type that has a createRenderer method');\n };\n /**\n * Add the given control to the map.\n * @param {import(\"./control/Control.js\").default} control Control.\n * @api\n */\n PluggableMap.prototype.addControl = function (control) {\n this.getControls().push(control);\n };\n /**\n * Add the given interaction to the map. If you want to add an interaction\n * at another point of the collection use `getInteraction()` and the methods\n * available on {@link module:ol/Collection~Collection}. This can be used to\n * stop the event propagation from the handleEvent function. The interactions\n * get to handle the events in the reverse order of this collection.\n * @param {import(\"./interaction/Interaction.js\").default} interaction Interaction to add.\n * @api\n */\n PluggableMap.prototype.addInteraction = function (interaction) {\n this.getInteractions().push(interaction);\n };\n /**\n * Adds the given layer to the top of this map. If you want to add a layer\n * elsewhere in the stack, use `getLayers()` and the methods available on\n * {@link module:ol/Collection~Collection}.\n * @param {import(\"./layer/Base.js\").default} layer Layer.\n * @api\n */\n PluggableMap.prototype.addLayer = function (layer) {\n var layers = this.getLayerGroup().getLayers();\n layers.push(layer);\n };\n /**\n * Add the given overlay to the map.\n * @param {import(\"./Overlay.js\").default} overlay Overlay.\n * @api\n */\n PluggableMap.prototype.addOverlay = function (overlay) {\n this.getOverlays().push(overlay);\n };\n /**\n * This deals with map's overlay collection changes.\n * @param {import(\"./Overlay.js\").default} overlay Overlay.\n * @private\n */\n PluggableMap.prototype.addOverlayInternal_ = function (overlay) {\n var id = overlay.getId();\n if (id !== undefined) {\n this.overlayIdIndex_[id.toString()] = overlay;\n }\n overlay.setMap(this);\n };\n /**\n *\n * Clean up.\n */\n PluggableMap.prototype.disposeInternal = function () {\n this.setTarget(null);\n _super.prototype.disposeInternal.call(this);\n };\n /**\n * Detect features that intersect a pixel on the viewport, and execute a\n * callback with each intersecting feature. Layers included in the detection can\n * be configured through the `layerFilter` option in `opt_options`.\n * @param {import(\"./pixel.js\").Pixel} pixel Pixel.\n * @param {function(import(\"./Feature.js\").FeatureLike, import(\"./layer/Layer.js\").default, import(\"./geom/SimpleGeometry.js\").default): T} callback Feature callback. The callback will be\n * called with two arguments. The first argument is one\n * {@link module:ol/Feature feature} or\n * {@link module:ol/render/Feature render feature} at the pixel, the second is\n * the {@link module:ol/layer/Layer layer} of the feature and will be null for\n * unmanaged layers. To stop detection, callback functions can return a\n * truthy value.\n * @param {AtPixelOptions} [opt_options] Optional options.\n * @return {T|undefined} Callback result, i.e. the return value of last\n * callback execution, or the first truthy callback return value.\n * @template T\n * @api\n */\n PluggableMap.prototype.forEachFeatureAtPixel = function (pixel, callback, opt_options) {\n if (!this.frameState_) {\n return;\n }\n var coordinate = this.getCoordinateFromPixelInternal(pixel);\n opt_options = opt_options !== undefined ? opt_options : {};\n var hitTolerance = opt_options.hitTolerance !== undefined ? opt_options.hitTolerance : 0;\n var layerFilter = opt_options.layerFilter !== undefined ? opt_options.layerFilter : TRUE;\n var checkWrapped = opt_options.checkWrapped !== false;\n return this.renderer_.forEachFeatureAtCoordinate(coordinate, this.frameState_, hitTolerance, checkWrapped, callback, null, layerFilter, null);\n };\n /**\n * Get all features that intersect a pixel on the viewport.\n * @param {import(\"./pixel.js\").Pixel} pixel Pixel.\n * @param {AtPixelOptions} [opt_options] Optional options.\n * @return {Array} The detected features or\n * an empty array if none were found.\n * @api\n */\n PluggableMap.prototype.getFeaturesAtPixel = function (pixel, opt_options) {\n var features = [];\n this.forEachFeatureAtPixel(pixel, function (feature) {\n features.push(feature);\n }, opt_options);\n return features;\n };\n /**\n * Detect layers that have a color value at a pixel on the viewport, and\n * execute a callback with each matching layer. Layers included in the\n * detection can be configured through `opt_layerFilter`.\n *\n * Note: this may give false positives unless the map layers have had different `className`\n * properties assigned to them.\n *\n * @param {import(\"./pixel.js\").Pixel} pixel Pixel.\n * @param {function(this: S, import(\"./layer/Layer.js\").default, (Uint8ClampedArray|Uint8Array)): T} callback\n * Layer callback. This callback will receive two arguments: first is the\n * {@link module:ol/layer/Layer layer}, second argument is an array representing\n * [R, G, B, A] pixel values (0 - 255) and will be `null` for layer types\n * that do not currently support this argument. To stop detection, callback\n * functions can return a truthy value.\n * @param {AtPixelOptions} [opt_options] Configuration options.\n * @return {T|undefined} Callback result, i.e. the return value of last\n * callback execution, or the first truthy callback return value.\n * @template S,T\n * @api\n */\n PluggableMap.prototype.forEachLayerAtPixel = function (pixel, callback, opt_options) {\n if (!this.frameState_) {\n return;\n }\n var options = opt_options || {};\n var hitTolerance = options.hitTolerance !== undefined ? options.hitTolerance : 0;\n var layerFilter = options.layerFilter || TRUE;\n return this.renderer_.forEachLayerAtPixel(pixel, this.frameState_, hitTolerance, callback, layerFilter);\n };\n /**\n * Detect if features intersect a pixel on the viewport. Layers included in the\n * detection can be configured through `opt_layerFilter`.\n * @param {import(\"./pixel.js\").Pixel} pixel Pixel.\n * @param {AtPixelOptions} [opt_options] Optional options.\n * @return {boolean} Is there a feature at the given pixel?\n * @api\n */\n PluggableMap.prototype.hasFeatureAtPixel = function (pixel, opt_options) {\n if (!this.frameState_) {\n return false;\n }\n var coordinate = this.getCoordinateFromPixelInternal(pixel);\n opt_options = opt_options !== undefined ? opt_options : {};\n var layerFilter = opt_options.layerFilter !== undefined ? opt_options.layerFilter : TRUE;\n var hitTolerance = opt_options.hitTolerance !== undefined ? opt_options.hitTolerance : 0;\n var checkWrapped = opt_options.checkWrapped !== false;\n return this.renderer_.hasFeatureAtCoordinate(coordinate, this.frameState_, hitTolerance, checkWrapped, layerFilter, null);\n };\n /**\n * Returns the coordinate in user projection for a browser event.\n * @param {MouseEvent} event Event.\n * @return {import(\"./coordinate.js\").Coordinate} Coordinate.\n * @api\n */\n PluggableMap.prototype.getEventCoordinate = function (event) {\n return this.getCoordinateFromPixel(this.getEventPixel(event));\n };\n /**\n * Returns the coordinate in view projection for a browser event.\n * @param {MouseEvent} event Event.\n * @return {import(\"./coordinate.js\").Coordinate} Coordinate.\n */\n PluggableMap.prototype.getEventCoordinateInternal = function (event) {\n return this.getCoordinateFromPixelInternal(this.getEventPixel(event));\n };\n /**\n * Returns the map pixel position for a browser event relative to the viewport.\n * @param {UIEvent} event Event.\n * @return {import(\"./pixel.js\").Pixel} Pixel.\n * @api\n */\n PluggableMap.prototype.getEventPixel = function (event) {\n var viewportPosition = this.viewport_.getBoundingClientRect();\n var eventPosition = \n //FIXME Are we really calling this with a TouchEvent anywhere?\n 'changedTouches' in event\n ? /** @type {TouchEvent} */ (event).changedTouches[0]\n : /** @type {MouseEvent} */ (event);\n return [\n eventPosition.clientX - viewportPosition.left,\n eventPosition.clientY - viewportPosition.top,\n ];\n };\n /**\n * Get the target in which this map is rendered.\n * Note that this returns what is entered as an option or in setTarget:\n * if that was an element, it returns an element; if a string, it returns that.\n * @return {HTMLElement|string|undefined} The Element or id of the Element that the\n * map is rendered in.\n * @observable\n * @api\n */\n PluggableMap.prototype.getTarget = function () {\n return /** @type {HTMLElement|string|undefined} */ (this.get(MapProperty.TARGET));\n };\n /**\n * Get the DOM element into which this map is rendered. In contrast to\n * `getTarget` this method always return an `Element`, or `null` if the\n * map has no target.\n * @return {HTMLElement} The element that the map is rendered in.\n * @api\n */\n PluggableMap.prototype.getTargetElement = function () {\n var target = this.getTarget();\n if (target !== undefined) {\n return typeof target === 'string'\n ? document.getElementById(target)\n : target;\n }\n else {\n return null;\n }\n };\n /**\n * Get the coordinate for a given pixel. This returns a coordinate in the\n * user projection.\n * @param {import(\"./pixel.js\").Pixel} pixel Pixel position in the map viewport.\n * @return {import(\"./coordinate.js\").Coordinate} The coordinate for the pixel position.\n * @api\n */\n PluggableMap.prototype.getCoordinateFromPixel = function (pixel) {\n return toUserCoordinate(this.getCoordinateFromPixelInternal(pixel), this.getView().getProjection());\n };\n /**\n * Get the coordinate for a given pixel. This returns a coordinate in the\n * map view projection.\n * @param {import(\"./pixel.js\").Pixel} pixel Pixel position in the map viewport.\n * @return {import(\"./coordinate.js\").Coordinate} The coordinate for the pixel position.\n */\n PluggableMap.prototype.getCoordinateFromPixelInternal = function (pixel) {\n var frameState = this.frameState_;\n if (!frameState) {\n return null;\n }\n else {\n return applyTransform(frameState.pixelToCoordinateTransform, pixel.slice());\n }\n };\n /**\n * Get the map controls. Modifying this collection changes the controls\n * associated with the map.\n * @return {Collection} Controls.\n * @api\n */\n PluggableMap.prototype.getControls = function () {\n return this.controls;\n };\n /**\n * Get the map overlays. Modifying this collection changes the overlays\n * associated with the map.\n * @return {Collection} Overlays.\n * @api\n */\n PluggableMap.prototype.getOverlays = function () {\n return this.overlays_;\n };\n /**\n * Get an overlay by its identifier (the value returned by overlay.getId()).\n * Note that the index treats string and numeric identifiers as the same. So\n * `map.getOverlayById(2)` will return an overlay with id `'2'` or `2`.\n * @param {string|number} id Overlay identifier.\n * @return {import(\"./Overlay.js\").default} Overlay.\n * @api\n */\n PluggableMap.prototype.getOverlayById = function (id) {\n var overlay = this.overlayIdIndex_[id.toString()];\n return overlay !== undefined ? overlay : null;\n };\n /**\n * Get the map interactions. Modifying this collection changes the interactions\n * associated with the map.\n *\n * Interactions are used for e.g. pan, zoom and rotate.\n * @return {Collection} Interactions.\n * @api\n */\n PluggableMap.prototype.getInteractions = function () {\n return this.interactions;\n };\n /**\n * Get the layergroup associated with this map.\n * @return {LayerGroup} A layer group containing the layers in this map.\n * @observable\n * @api\n */\n PluggableMap.prototype.getLayerGroup = function () {\n return /** @type {LayerGroup} */ (this.get(MapProperty.LAYERGROUP));\n };\n /**\n * Clear any existing layers and add layers to the map.\n * @param {Array|Collection} layers The layers to be added to the map.\n * @api\n */\n PluggableMap.prototype.setLayers = function (layers) {\n var group = this.getLayerGroup();\n if (layers instanceof Collection) {\n group.setLayers(layers);\n return;\n }\n var collection = group.getLayers();\n collection.clear();\n collection.extend(layers);\n };\n /**\n * Get the collection of layers associated with this map.\n * @return {!Collection} Layers.\n * @api\n */\n PluggableMap.prototype.getLayers = function () {\n var layers = this.getLayerGroup().getLayers();\n return layers;\n };\n /**\n * @return {boolean} Layers have sources that are still loading.\n */\n PluggableMap.prototype.getLoading = function () {\n var layerStatesArray = this.getLayerGroup().getLayerStatesArray();\n for (var i = 0, ii = layerStatesArray.length; i < ii; ++i) {\n var layer = layerStatesArray[i].layer;\n var source = /** @type {import(\"./layer/Layer.js\").default} */ (layer).getSource();\n if (source && source.loading) {\n return true;\n }\n }\n return false;\n };\n /**\n * Get the pixel for a coordinate. This takes a coordinate in the user\n * projection and returns the corresponding pixel.\n * @param {import(\"./coordinate.js\").Coordinate} coordinate A map coordinate.\n * @return {import(\"./pixel.js\").Pixel} A pixel position in the map viewport.\n * @api\n */\n PluggableMap.prototype.getPixelFromCoordinate = function (coordinate) {\n var viewCoordinate = fromUserCoordinate(coordinate, this.getView().getProjection());\n return this.getPixelFromCoordinateInternal(viewCoordinate);\n };\n /**\n * Get the pixel for a coordinate. This takes a coordinate in the map view\n * projection and returns the corresponding pixel.\n * @param {import(\"./coordinate.js\").Coordinate} coordinate A map coordinate.\n * @return {import(\"./pixel.js\").Pixel} A pixel position in the map viewport.\n */\n PluggableMap.prototype.getPixelFromCoordinateInternal = function (coordinate) {\n var frameState = this.frameState_;\n if (!frameState) {\n return null;\n }\n else {\n return applyTransform(frameState.coordinateToPixelTransform, coordinate.slice(0, 2));\n }\n };\n /**\n * Get the map renderer.\n * @return {import(\"./renderer/Map.js\").default} Renderer\n */\n PluggableMap.prototype.getRenderer = function () {\n return this.renderer_;\n };\n /**\n * Get the size of this map.\n * @return {import(\"./size.js\").Size|undefined} The size in pixels of the map in the DOM.\n * @observable\n * @api\n */\n PluggableMap.prototype.getSize = function () {\n return /** @type {import(\"./size.js\").Size|undefined} */ (this.get(MapProperty.SIZE));\n };\n /**\n * Get the view associated with this map. A view manages properties such as\n * center and resolution.\n * @return {View} The view that controls this map.\n * @observable\n * @api\n */\n PluggableMap.prototype.getView = function () {\n return /** @type {View} */ (this.get(MapProperty.VIEW));\n };\n /**\n * Get the element that serves as the map viewport.\n * @return {HTMLElement} Viewport.\n * @api\n */\n PluggableMap.prototype.getViewport = function () {\n return this.viewport_;\n };\n /**\n * Get the element that serves as the container for overlays. Elements added to\n * this container will let mousedown and touchstart events through to the map,\n * so clicks and gestures on an overlay will trigger {@link module:ol/MapBrowserEvent~MapBrowserEvent}\n * events.\n * @return {!HTMLElement} The map's overlay container.\n */\n PluggableMap.prototype.getOverlayContainer = function () {\n return this.overlayContainer_;\n };\n /**\n * Get the element that serves as a container for overlays that don't allow\n * event propagation. Elements added to this container won't let mousedown and\n * touchstart events through to the map, so clicks and gestures on an overlay\n * don't trigger any {@link module:ol/MapBrowserEvent~MapBrowserEvent}.\n * @return {!HTMLElement} The map's overlay container that stops events.\n */\n PluggableMap.prototype.getOverlayContainerStopEvent = function () {\n return this.overlayContainerStopEvent_;\n };\n /**\n * @return {!Document} The document where the map is displayed.\n */\n PluggableMap.prototype.getOwnerDocument = function () {\n var targetElement = this.getTargetElement();\n return targetElement ? targetElement.ownerDocument : document;\n };\n /**\n * @param {import(\"./Tile.js\").default} tile Tile.\n * @param {string} tileSourceKey Tile source key.\n * @param {import(\"./coordinate.js\").Coordinate} tileCenter Tile center.\n * @param {number} tileResolution Tile resolution.\n * @return {number} Tile priority.\n */\n PluggableMap.prototype.getTilePriority = function (tile, tileSourceKey, tileCenter, tileResolution) {\n return getTilePriority(this.frameState_, tile, tileSourceKey, tileCenter, tileResolution);\n };\n /**\n * @param {UIEvent} browserEvent Browser event.\n * @param {string} [opt_type] Type.\n */\n PluggableMap.prototype.handleBrowserEvent = function (browserEvent, opt_type) {\n var type = opt_type || browserEvent.type;\n var mapBrowserEvent = new MapBrowserEvent(type, this, browserEvent);\n this.handleMapBrowserEvent(mapBrowserEvent);\n };\n /**\n * @param {MapBrowserEvent} mapBrowserEvent The event to handle.\n */\n PluggableMap.prototype.handleMapBrowserEvent = function (mapBrowserEvent) {\n if (!this.frameState_) {\n // With no view defined, we cannot translate pixels into geographical\n // coordinates so interactions cannot be used.\n return;\n }\n var originalEvent = /** @type {PointerEvent} */ (mapBrowserEvent.originalEvent);\n var eventType = originalEvent.type;\n if (eventType === PointerEventType.POINTERDOWN ||\n eventType === EventType.WHEEL ||\n eventType === EventType.KEYDOWN) {\n var doc = this.getOwnerDocument();\n var rootNode = this.viewport_.getRootNode\n ? this.viewport_.getRootNode()\n : doc;\n var target = /** @type {Node} */ (originalEvent.target);\n if (\n // Abort if the target is a child of the container for elements whose events are not meant\n // to be handled by map interactions.\n this.overlayContainerStopEvent_.contains(target) ||\n // Abort if the event target is a child of the container that is no longer in the page.\n // It's possible for the target to no longer be in the page if it has been removed in an\n // event listener, this might happen in a Control that recreates it's content based on\n // user interaction either manually or via a render in something like https://reactjs.org/\n !(rootNode === doc ? doc.documentElement : rootNode).contains(target)) {\n return;\n }\n }\n mapBrowserEvent.frameState = this.frameState_;\n if (this.dispatchEvent(mapBrowserEvent) !== false) {\n var interactionsArray = this.getInteractions().getArray().slice();\n for (var i = interactionsArray.length - 1; i >= 0; i--) {\n var interaction = interactionsArray[i];\n if (interaction.getMap() !== this ||\n !interaction.getActive() ||\n !this.getTargetElement()) {\n continue;\n }\n var cont = interaction.handleEvent(mapBrowserEvent);\n if (!cont || mapBrowserEvent.propagationStopped) {\n break;\n }\n }\n }\n };\n /**\n * @protected\n */\n PluggableMap.prototype.handlePostRender = function () {\n var frameState = this.frameState_;\n // Manage the tile queue\n // Image loads are expensive and a limited resource, so try to use them\n // efficiently:\n // * When the view is static we allow a large number of parallel tile loads\n // to complete the frame as quickly as possible.\n // * When animating or interacting, image loads can cause janks, so we reduce\n // the maximum number of loads per frame and limit the number of parallel\n // tile loads to remain reactive to view changes and to reduce the chance of\n // loading tiles that will quickly disappear from view.\n var tileQueue = this.tileQueue_;\n if (!tileQueue.isEmpty()) {\n var maxTotalLoading = this.maxTilesLoading_;\n var maxNewLoads = maxTotalLoading;\n if (frameState) {\n var hints = frameState.viewHints;\n if (hints[ViewHint.ANIMATING] || hints[ViewHint.INTERACTING]) {\n var lowOnFrameBudget = Date.now() - frameState.time > 8;\n maxTotalLoading = lowOnFrameBudget ? 0 : 8;\n maxNewLoads = lowOnFrameBudget ? 0 : 2;\n }\n }\n if (tileQueue.getTilesLoading() < maxTotalLoading) {\n tileQueue.reprioritize(); // FIXME only call if view has changed\n tileQueue.loadMoreTiles(maxTotalLoading, maxNewLoads);\n }\n }\n if (frameState &&\n this.hasListener(RenderEventType.RENDERCOMPLETE) &&\n !frameState.animate &&\n !this.tileQueue_.getTilesLoading() &&\n !this.getLoading()) {\n this.renderer_.dispatchRenderEvent(RenderEventType.RENDERCOMPLETE, frameState);\n }\n var postRenderFunctions = this.postRenderFunctions_;\n for (var i = 0, ii = postRenderFunctions.length; i < ii; ++i) {\n postRenderFunctions[i](this, frameState);\n }\n postRenderFunctions.length = 0;\n };\n /**\n * @private\n */\n PluggableMap.prototype.handleSizeChanged_ = function () {\n if (this.getView() && !this.getView().getAnimating()) {\n this.getView().resolveConstraints(0);\n }\n this.render();\n };\n /**\n * @private\n */\n PluggableMap.prototype.handleTargetChanged_ = function () {\n // target may be undefined, null, a string or an Element.\n // If it's a string we convert it to an Element before proceeding.\n // If it's not now an Element we remove the viewport from the DOM.\n // If it's an Element we append the viewport element to it.\n var targetElement;\n if (this.getTarget()) {\n targetElement = this.getTargetElement();\n }\n if (this.mapBrowserEventHandler_) {\n for (var i = 0, ii = this.keyHandlerKeys_.length; i < ii; ++i) {\n unlistenByKey(this.keyHandlerKeys_[i]);\n }\n this.keyHandlerKeys_ = null;\n this.viewport_.removeEventListener(EventType.CONTEXTMENU, this.boundHandleBrowserEvent_);\n this.viewport_.removeEventListener(EventType.WHEEL, this.boundHandleBrowserEvent_);\n if (this.handleResize_ !== undefined) {\n removeEventListener(EventType.RESIZE, this.handleResize_, false);\n this.handleResize_ = undefined;\n }\n this.mapBrowserEventHandler_.dispose();\n this.mapBrowserEventHandler_ = null;\n removeNode(this.viewport_);\n }\n if (!targetElement) {\n if (this.renderer_) {\n clearTimeout(this.postRenderTimeoutHandle_);\n this.postRenderTimeoutHandle_ = undefined;\n this.postRenderFunctions_.length = 0;\n this.renderer_.dispose();\n this.renderer_ = null;\n }\n if (this.animationDelayKey_) {\n cancelAnimationFrame(this.animationDelayKey_);\n this.animationDelayKey_ = undefined;\n }\n }\n else {\n targetElement.appendChild(this.viewport_);\n if (!this.renderer_) {\n this.renderer_ = this.createRenderer();\n }\n this.mapBrowserEventHandler_ = new MapBrowserEventHandler(this, this.moveTolerance_);\n for (var key in MapBrowserEventType) {\n this.mapBrowserEventHandler_.addEventListener(MapBrowserEventType[key], this.handleMapBrowserEvent.bind(this));\n }\n this.viewport_.addEventListener(EventType.CONTEXTMENU, this.boundHandleBrowserEvent_, false);\n this.viewport_.addEventListener(EventType.WHEEL, this.boundHandleBrowserEvent_, PASSIVE_EVENT_LISTENERS ? { passive: false } : false);\n var keyboardEventTarget = !this.keyboardEventTarget_\n ? targetElement\n : this.keyboardEventTarget_;\n this.keyHandlerKeys_ = [\n listen(keyboardEventTarget, EventType.KEYDOWN, this.handleBrowserEvent, this),\n listen(keyboardEventTarget, EventType.KEYPRESS, this.handleBrowserEvent, this),\n ];\n if (!this.handleResize_) {\n this.handleResize_ = this.updateSize.bind(this);\n window.addEventListener(EventType.RESIZE, this.handleResize_, false);\n }\n }\n this.updateSize();\n // updateSize calls setSize, so no need to call this.render\n // ourselves here.\n };\n /**\n * @private\n */\n PluggableMap.prototype.handleTileChange_ = function () {\n this.render();\n };\n /**\n * @private\n */\n PluggableMap.prototype.handleViewPropertyChanged_ = function () {\n this.render();\n };\n /**\n * @private\n */\n PluggableMap.prototype.handleViewChanged_ = function () {\n if (this.viewPropertyListenerKey_) {\n unlistenByKey(this.viewPropertyListenerKey_);\n this.viewPropertyListenerKey_ = null;\n }\n if (this.viewChangeListenerKey_) {\n unlistenByKey(this.viewChangeListenerKey_);\n this.viewChangeListenerKey_ = null;\n }\n var view = this.getView();\n if (view) {\n this.updateViewportSize_();\n this.viewPropertyListenerKey_ = listen(view, ObjectEventType.PROPERTYCHANGE, this.handleViewPropertyChanged_, this);\n this.viewChangeListenerKey_ = listen(view, EventType.CHANGE, this.handleViewPropertyChanged_, this);\n view.resolveConstraints(0);\n }\n this.render();\n };\n /**\n * @private\n */\n PluggableMap.prototype.handleLayerGroupChanged_ = function () {\n if (this.layerGroupPropertyListenerKeys_) {\n this.layerGroupPropertyListenerKeys_.forEach(unlistenByKey);\n this.layerGroupPropertyListenerKeys_ = null;\n }\n var layerGroup = this.getLayerGroup();\n if (layerGroup) {\n this.layerGroupPropertyListenerKeys_ = [\n listen(layerGroup, ObjectEventType.PROPERTYCHANGE, this.render, this),\n listen(layerGroup, EventType.CHANGE, this.render, this),\n ];\n }\n this.render();\n };\n /**\n * @return {boolean} Is rendered.\n */\n PluggableMap.prototype.isRendered = function () {\n return !!this.frameState_;\n };\n /**\n * Requests an immediate render in a synchronous manner.\n * @api\n */\n PluggableMap.prototype.renderSync = function () {\n if (this.animationDelayKey_) {\n cancelAnimationFrame(this.animationDelayKey_);\n }\n this.animationDelay_();\n };\n /**\n * Redraws all text after new fonts have loaded\n */\n PluggableMap.prototype.redrawText = function () {\n var layerStates = this.getLayerGroup().getLayerStatesArray();\n for (var i = 0, ii = layerStates.length; i < ii; ++i) {\n var layer = layerStates[i].layer;\n if (layer.hasRenderer()) {\n layer.getRenderer().handleFontsChanged();\n }\n }\n };\n /**\n * Request a map rendering (at the next animation frame).\n * @api\n */\n PluggableMap.prototype.render = function () {\n if (this.renderer_ && this.animationDelayKey_ === undefined) {\n this.animationDelayKey_ = requestAnimationFrame(this.animationDelay_);\n }\n };\n /**\n * Remove the given control from the map.\n * @param {import(\"./control/Control.js\").default} control Control.\n * @return {import(\"./control/Control.js\").default|undefined} The removed control (or undefined\n * if the control was not found).\n * @api\n */\n PluggableMap.prototype.removeControl = function (control) {\n return this.getControls().remove(control);\n };\n /**\n * Remove the given interaction from the map.\n * @param {import(\"./interaction/Interaction.js\").default} interaction Interaction to remove.\n * @return {import(\"./interaction/Interaction.js\").default|undefined} The removed interaction (or\n * undefined if the interaction was not found).\n * @api\n */\n PluggableMap.prototype.removeInteraction = function (interaction) {\n return this.getInteractions().remove(interaction);\n };\n /**\n * Removes the given layer from the map.\n * @param {import(\"./layer/Base.js\").default} layer Layer.\n * @return {import(\"./layer/Base.js\").default|undefined} The removed layer (or undefined if the\n * layer was not found).\n * @api\n */\n PluggableMap.prototype.removeLayer = function (layer) {\n var layers = this.getLayerGroup().getLayers();\n return layers.remove(layer);\n };\n /**\n * Remove the given overlay from the map.\n * @param {import(\"./Overlay.js\").default} overlay Overlay.\n * @return {import(\"./Overlay.js\").default|undefined} The removed overlay (or undefined\n * if the overlay was not found).\n * @api\n */\n PluggableMap.prototype.removeOverlay = function (overlay) {\n return this.getOverlays().remove(overlay);\n };\n /**\n * @param {number} time Time.\n * @private\n */\n PluggableMap.prototype.renderFrame_ = function (time) {\n var _this = this;\n var size = this.getSize();\n var view = this.getView();\n var previousFrameState = this.frameState_;\n /** @type {?FrameState} */\n var frameState = null;\n if (size !== undefined && hasArea(size) && view && view.isDef()) {\n var viewHints = view.getHints(this.frameState_ ? this.frameState_.viewHints : undefined);\n var viewState = view.getState();\n frameState = {\n animate: false,\n coordinateToPixelTransform: this.coordinateToPixelTransform_,\n declutterTree: null,\n extent: getForViewAndSize(viewState.center, viewState.resolution, viewState.rotation, size),\n index: this.frameIndex_++,\n layerIndex: 0,\n layerStatesArray: this.getLayerGroup().getLayerStatesArray(),\n pixelRatio: this.pixelRatio_,\n pixelToCoordinateTransform: this.pixelToCoordinateTransform_,\n postRenderFunctions: [],\n size: size,\n tileQueue: this.tileQueue_,\n time: time,\n usedTiles: {},\n viewState: viewState,\n viewHints: viewHints,\n wantedTiles: {},\n };\n if (viewState.nextCenter && viewState.nextResolution) {\n var rotation = isNaN(viewState.nextRotation)\n ? viewState.rotation\n : viewState.nextRotation;\n frameState.nextExtent = getForViewAndSize(viewState.nextCenter, viewState.nextResolution, rotation, size);\n }\n }\n this.frameState_ = frameState;\n this.renderer_.renderFrame(frameState);\n if (frameState) {\n if (frameState.animate) {\n this.render();\n }\n Array.prototype.push.apply(this.postRenderFunctions_, frameState.postRenderFunctions);\n if (previousFrameState) {\n var moveStart = !this.previousExtent_ ||\n (!isEmpty(this.previousExtent_) &&\n !equals(frameState.extent, this.previousExtent_));\n if (moveStart) {\n this.dispatchEvent(new MapEvent(MapEventType.MOVESTART, this, previousFrameState));\n this.previousExtent_ = createOrUpdateEmpty(this.previousExtent_);\n }\n }\n var idle = this.previousExtent_ &&\n !frameState.viewHints[ViewHint.ANIMATING] &&\n !frameState.viewHints[ViewHint.INTERACTING] &&\n !equals(frameState.extent, this.previousExtent_);\n if (idle) {\n this.dispatchEvent(new MapEvent(MapEventType.MOVEEND, this, frameState));\n clone(frameState.extent, this.previousExtent_);\n }\n }\n this.dispatchEvent(new MapEvent(MapEventType.POSTRENDER, this, frameState));\n if (!this.postRenderTimeoutHandle_) {\n this.postRenderTimeoutHandle_ = setTimeout(function () {\n _this.postRenderTimeoutHandle_ = undefined;\n _this.handlePostRender();\n }, 0);\n }\n };\n /**\n * Sets the layergroup of this map.\n * @param {LayerGroup} layerGroup A layer group containing the layers in this map.\n * @observable\n * @api\n */\n PluggableMap.prototype.setLayerGroup = function (layerGroup) {\n this.set(MapProperty.LAYERGROUP, layerGroup);\n };\n /**\n * Set the size of this map.\n * @param {import(\"./size.js\").Size|undefined} size The size in pixels of the map in the DOM.\n * @observable\n * @api\n */\n PluggableMap.prototype.setSize = function (size) {\n this.set(MapProperty.SIZE, size);\n };\n /**\n * Set the target element to render this map into.\n * @param {HTMLElement|string} [target] The Element or id of the Element\n * that the map is rendered in.\n * @observable\n * @api\n */\n PluggableMap.prototype.setTarget = function (target) {\n this.set(MapProperty.TARGET, target);\n };\n /**\n * Set the view for this map.\n * @param {View|Promise} view The view that controls this map.\n * It is also possible to pass a promise that resolves to options for constructing a view. This\n * alternative allows view properties to be resolved by sources or other components that load\n * view-related metadata.\n * @observable\n * @api\n */\n PluggableMap.prototype.setView = function (view) {\n if (!view || view instanceof View) {\n this.set(MapProperty.VIEW, view);\n return;\n }\n this.set(MapProperty.VIEW, new View());\n var map = this;\n view.then(function (viewOptions) {\n map.setView(new View(viewOptions));\n });\n };\n /**\n * Force a recalculation of the map viewport size. This should be called when\n * third-party code changes the size of the map viewport.\n * @api\n */\n PluggableMap.prototype.updateSize = function () {\n var targetElement = this.getTargetElement();\n var size = undefined;\n if (targetElement) {\n var computedStyle = getComputedStyle(targetElement);\n var width = targetElement.offsetWidth -\n parseFloat(computedStyle['borderLeftWidth']) -\n parseFloat(computedStyle['paddingLeft']) -\n parseFloat(computedStyle['paddingRight']) -\n parseFloat(computedStyle['borderRightWidth']);\n var height = targetElement.offsetHeight -\n parseFloat(computedStyle['borderTopWidth']) -\n parseFloat(computedStyle['paddingTop']) -\n parseFloat(computedStyle['paddingBottom']) -\n parseFloat(computedStyle['borderBottomWidth']);\n if (!isNaN(width) && !isNaN(height)) {\n size = [width, height];\n if (!hasArea(size) &&\n !!(targetElement.offsetWidth ||\n targetElement.offsetHeight ||\n targetElement.getClientRects().length)) {\n // eslint-disable-next-line\n console.warn(\"No map visible because the map container's width or height are 0.\");\n }\n }\n }\n this.setSize(size);\n this.updateViewportSize_();\n };\n /**\n * Recomputes the viewport size and save it on the view object (if any)\n * @private\n */\n PluggableMap.prototype.updateViewportSize_ = function () {\n var view = this.getView();\n if (view) {\n var size = undefined;\n var computedStyle = getComputedStyle(this.viewport_);\n if (computedStyle.width && computedStyle.height) {\n size = [\n parseInt(computedStyle.width, 10),\n parseInt(computedStyle.height, 10),\n ];\n }\n view.setViewportSize(size);\n }\n };\n return PluggableMap;\n}(BaseObject));\n/**\n * @param {MapOptions} options Map options.\n * @return {MapOptionsInternal} Internal map options.\n */\nfunction createOptionsInternal(options) {\n /**\n * @type {HTMLElement|Document}\n */\n var keyboardEventTarget = null;\n if (options.keyboardEventTarget !== undefined) {\n keyboardEventTarget =\n typeof options.keyboardEventTarget === 'string'\n ? document.getElementById(options.keyboardEventTarget)\n : options.keyboardEventTarget;\n }\n /**\n * @type {Object}\n */\n var values = {};\n var layerGroup = options.layers &&\n typeof ( /** @type {?} */(options.layers).getLayers) === 'function'\n ? /** @type {LayerGroup} */ (options.layers)\n : new LayerGroup({ layers: /** @type {Collection} */ (options.layers) });\n values[MapProperty.LAYERGROUP] = layerGroup;\n values[MapProperty.TARGET] = options.target;\n values[MapProperty.VIEW] =\n options.view instanceof View ? options.view : new View();\n var controls;\n if (options.controls !== undefined) {\n if (Array.isArray(options.controls)) {\n controls = new Collection(options.controls.slice());\n }\n else {\n assert(typeof ( /** @type {?} */(options.controls).getArray) === 'function', 47); // Expected `controls` to be an array or an `import(\"./Collection.js\").Collection`\n controls = /** @type {Collection} */ (options.controls);\n }\n }\n var interactions;\n if (options.interactions !== undefined) {\n if (Array.isArray(options.interactions)) {\n interactions = new Collection(options.interactions.slice());\n }\n else {\n assert(typeof ( /** @type {?} */(options.interactions).getArray) ===\n 'function', 48); // Expected `interactions` to be an array or an `import(\"./Collection.js\").Collection`\n interactions = /** @type {Collection} */ (options.interactions);\n }\n }\n var overlays;\n if (options.overlays !== undefined) {\n if (Array.isArray(options.overlays)) {\n overlays = new Collection(options.overlays.slice());\n }\n else {\n assert(typeof ( /** @type {?} */(options.overlays).getArray) === 'function', 49); // Expected `overlays` to be an array or an `import(\"./Collection.js\").Collection`\n overlays = options.overlays;\n }\n }\n else {\n overlays = new Collection();\n }\n return {\n controls: controls,\n interactions: interactions,\n keyboardEventTarget: keyboardEventTarget,\n overlays: overlays,\n values: values,\n };\n}\nexport default PluggableMap;\n//# sourceMappingURL=PluggableMap.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/control/Control\n */\nimport BaseObject from '../Object.js';\nimport MapEventType from '../MapEventType.js';\nimport { VOID } from '../functions.js';\nimport { listen, unlistenByKey } from '../events.js';\nimport { removeNode } from '../dom.js';\n/**\n * @typedef {Object} Options\n * @property {HTMLElement} [element] The element is the control's\n * container element. This only needs to be specified if you're developing\n * a custom control.\n * @property {function(import(\"../MapEvent.js\").default):void} [render] Function called when\n * the control should be re-rendered. This is called in a `requestAnimationFrame`\n * callback.\n * @property {HTMLElement|string} [target] Specify a target if you want\n * the control to be rendered outside of the map's viewport.\n */\n/**\n * @classdesc\n * A control is a visible widget with a DOM element in a fixed position on the\n * screen. They can involve user input (buttons), or be informational only;\n * the position is determined using CSS. By default these are placed in the\n * container with CSS class name `ol-overlaycontainer-stopevent`, but can use\n * any outside DOM element.\n *\n * This is the base class for controls. You can use it for simple custom\n * controls by creating the element with listeners, creating an instance:\n * ```js\n * var myControl = new Control({element: myElement});\n * ```\n * and then adding this to the map.\n *\n * The main advantage of having this as a control rather than a simple separate\n * DOM element is that preventing propagation is handled for you. Controls\n * will also be objects in a {@link module:ol/Collection~Collection}, so you can use their methods.\n *\n * You can also extend this base for your own control class. See\n * examples/custom-controls for an example of how to do this.\n *\n * @api\n */\nvar Control = /** @class */ (function (_super) {\n __extends(Control, _super);\n /**\n * @param {Options} options Control options.\n */\n function Control(options) {\n var _this = _super.call(this) || this;\n var element = options.element;\n if (element && !options.target && !element.style.pointerEvents) {\n element.style.pointerEvents = 'auto';\n }\n /**\n * @protected\n * @type {HTMLElement}\n */\n _this.element = element ? element : null;\n /**\n * @private\n * @type {HTMLElement}\n */\n _this.target_ = null;\n /**\n * @private\n * @type {import(\"../PluggableMap.js\").default}\n */\n _this.map_ = null;\n /**\n * @protected\n * @type {!Array}\n */\n _this.listenerKeys = [];\n if (options.render) {\n _this.render = options.render;\n }\n if (options.target) {\n _this.setTarget(options.target);\n }\n return _this;\n }\n /**\n * Clean up.\n */\n Control.prototype.disposeInternal = function () {\n removeNode(this.element);\n _super.prototype.disposeInternal.call(this);\n };\n /**\n * Get the map associated with this control.\n * @return {import(\"../PluggableMap.js\").default|undefined} Map.\n * @api\n */\n Control.prototype.getMap = function () {\n return this.map_;\n };\n /**\n * Remove the control from its current map and attach it to the new map.\n * Subclasses may set up event handlers to get notified about changes to\n * the map here.\n * @param {import(\"../PluggableMap.js\").default} [map] Map.\n * @api\n */\n Control.prototype.setMap = function (map) {\n if (this.map_) {\n removeNode(this.element);\n }\n for (var i = 0, ii = this.listenerKeys.length; i < ii; ++i) {\n unlistenByKey(this.listenerKeys[i]);\n }\n this.listenerKeys.length = 0;\n this.map_ = map;\n if (this.map_) {\n var target = this.target_\n ? this.target_\n : map.getOverlayContainerStopEvent();\n target.appendChild(this.element);\n if (this.render !== VOID) {\n this.listenerKeys.push(listen(map, MapEventType.POSTRENDER, this.render, this));\n }\n map.render();\n }\n };\n /**\n * Renders the control.\n * @param {import(\"../MapEvent.js\").default} mapEvent Map event.\n * @api\n */\n Control.prototype.render = function (mapEvent) { };\n /**\n * This function is used to set a target element for the control. It has no\n * effect if it is called after the control has been added to the map (i.e.\n * after `setMap` is called on the control). If no `target` is set in the\n * options passed to the control constructor and if `setTarget` is not called\n * then the control is added to the map's overlay container.\n * @param {HTMLElement|string} target Target.\n * @api\n */\n Control.prototype.setTarget = function (target) {\n this.target_ =\n typeof target === 'string' ? document.getElementById(target) : target;\n };\n return Control;\n}(BaseObject));\nexport default Control;\n//# sourceMappingURL=Control.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/control/Attribution\n */\nimport Control from './Control.js';\nimport EventType from '../events/EventType.js';\nimport { CLASS_COLLAPSED, CLASS_CONTROL, CLASS_UNSELECTABLE } from '../css.js';\nimport { equals } from '../array.js';\nimport { inView } from '../layer/Layer.js';\nimport { removeChildren, replaceNode } from '../dom.js';\n/**\n * @typedef {Object} Options\n * @property {string} [className='ol-attribution'] CSS class name.\n * @property {HTMLElement|string} [target] Specify a target if you\n * want the control to be rendered outside of the map's\n * viewport.\n * @property {boolean} [collapsible] Specify if attributions can\n * be collapsed. If not specified, sources control this behavior with their\n * `attributionsCollapsible` setting.\n * @property {boolean} [collapsed=true] Specify if attributions should\n * be collapsed at startup.\n * @property {string} [tipLabel='Attributions'] Text label to use for the button tip.\n * @property {string|HTMLElement} [label='i'] Text label to use for the\n * collapsed attributions button.\n * Instead of text, also an element (e.g. a `span` element) can be used.\n * @property {string} [expandClassName=className + '-expand'] CSS class name for the\n * collapsed attributions button.\n * @property {string|HTMLElement} [collapseLabel='›'] Text label to use\n * for the expanded attributions button.\n * Instead of text, also an element (e.g. a `span` element) can be used.\n * @property {string} [collapseClassName=className + '-collapse'] CSS class name for the\n * expanded attributions button.\n * @property {function(import(\"../MapEvent.js\").default):void} [render] Function called when\n * the control should be re-rendered. This is called in a `requestAnimationFrame`\n * callback.\n */\n/**\n * @classdesc\n * Control to show all the attributions associated with the layer sources\n * in the map. This control is one of the default controls included in maps.\n * By default it will show in the bottom right portion of the map, but this can\n * be changed by using a css selector for `.ol-attribution`.\n *\n * @api\n */\nvar Attribution = /** @class */ (function (_super) {\n __extends(Attribution, _super);\n /**\n * @param {Options} [opt_options] Attribution options.\n */\n function Attribution(opt_options) {\n var _this = this;\n var options = opt_options ? opt_options : {};\n _this = _super.call(this, {\n element: document.createElement('div'),\n render: options.render,\n target: options.target,\n }) || this;\n /**\n * @private\n * @type {HTMLElement}\n */\n _this.ulElement_ = document.createElement('ul');\n /**\n * @private\n * @type {boolean}\n */\n _this.collapsed_ =\n options.collapsed !== undefined ? options.collapsed : true;\n /**\n * @private\n * @type {boolean}\n */\n _this.userCollapsed_ = _this.collapsed_;\n /**\n * @private\n * @type {boolean}\n */\n _this.overrideCollapsible_ = options.collapsible !== undefined;\n /**\n * @private\n * @type {boolean}\n */\n _this.collapsible_ =\n options.collapsible !== undefined ? options.collapsible : true;\n if (!_this.collapsible_) {\n _this.collapsed_ = false;\n }\n var className = options.className !== undefined ? options.className : 'ol-attribution';\n var tipLabel = options.tipLabel !== undefined ? options.tipLabel : 'Attributions';\n var expandClassName = options.expandClassName !== undefined\n ? options.expandClassName\n : className + '-expand';\n var collapseLabel = options.collapseLabel !== undefined ? options.collapseLabel : '\\u203A';\n var collapseClassName = options.collapseClassName !== undefined\n ? options.collapseClassName\n : className + '-collpase';\n if (typeof collapseLabel === 'string') {\n /**\n * @private\n * @type {HTMLElement}\n */\n _this.collapseLabel_ = document.createElement('span');\n _this.collapseLabel_.textContent = collapseLabel;\n _this.collapseLabel_.className = collapseClassName;\n }\n else {\n _this.collapseLabel_ = collapseLabel;\n }\n var label = options.label !== undefined ? options.label : 'i';\n if (typeof label === 'string') {\n /**\n * @private\n * @type {HTMLElement}\n */\n _this.label_ = document.createElement('span');\n _this.label_.textContent = label;\n _this.label_.className = expandClassName;\n }\n else {\n _this.label_ = label;\n }\n var activeLabel = _this.collapsible_ && !_this.collapsed_ ? _this.collapseLabel_ : _this.label_;\n /**\n * @private\n * @type {HTMLElement}\n */\n _this.toggleButton_ = document.createElement('button');\n _this.toggleButton_.setAttribute('type', 'button');\n _this.toggleButton_.setAttribute('aria-expanded', String(!_this.collapsed_));\n _this.toggleButton_.title = tipLabel;\n _this.toggleButton_.appendChild(activeLabel);\n _this.toggleButton_.addEventListener(EventType.CLICK, _this.handleClick_.bind(_this), false);\n var cssClasses = className +\n ' ' +\n CLASS_UNSELECTABLE +\n ' ' +\n CLASS_CONTROL +\n (_this.collapsed_ && _this.collapsible_ ? ' ' + CLASS_COLLAPSED : '') +\n (_this.collapsible_ ? '' : ' ol-uncollapsible');\n var element = _this.element;\n element.className = cssClasses;\n element.appendChild(_this.toggleButton_);\n element.appendChild(_this.ulElement_);\n /**\n * A list of currently rendered resolutions.\n * @type {Array}\n * @private\n */\n _this.renderedAttributions_ = [];\n /**\n * @private\n * @type {boolean}\n */\n _this.renderedVisible_ = true;\n return _this;\n }\n /**\n * Collect a list of visible attributions and set the collapsible state.\n * @param {import(\"../PluggableMap.js\").FrameState} frameState Frame state.\n * @return {Array} Attributions.\n * @private\n */\n Attribution.prototype.collectSourceAttributions_ = function (frameState) {\n /**\n * Used to determine if an attribution already exists.\n * @type {!Object}\n */\n var lookup = {};\n /**\n * A list of visible attributions.\n * @type {Array}\n */\n var visibleAttributions = [];\n var collapsible = true;\n var layerStatesArray = frameState.layerStatesArray;\n for (var i = 0, ii = layerStatesArray.length; i < ii; ++i) {\n var layerState = layerStatesArray[i];\n if (!inView(layerState, frameState.viewState)) {\n continue;\n }\n var source = /** @type {import(\"../layer/Layer.js\").default} */ (layerState.layer).getSource();\n if (!source) {\n continue;\n }\n var attributionGetter = source.getAttributions();\n if (!attributionGetter) {\n continue;\n }\n var attributions = attributionGetter(frameState);\n if (!attributions) {\n continue;\n }\n collapsible =\n collapsible && source.getAttributionsCollapsible() !== false;\n if (Array.isArray(attributions)) {\n for (var j = 0, jj = attributions.length; j < jj; ++j) {\n if (!(attributions[j] in lookup)) {\n visibleAttributions.push(attributions[j]);\n lookup[attributions[j]] = true;\n }\n }\n }\n else {\n if (!(attributions in lookup)) {\n visibleAttributions.push(attributions);\n lookup[attributions] = true;\n }\n }\n }\n if (!this.overrideCollapsible_) {\n this.setCollapsible(collapsible);\n }\n return visibleAttributions;\n };\n /**\n * @private\n * @param {?import(\"../PluggableMap.js\").FrameState} frameState Frame state.\n */\n Attribution.prototype.updateElement_ = function (frameState) {\n if (!frameState) {\n if (this.renderedVisible_) {\n this.element.style.display = 'none';\n this.renderedVisible_ = false;\n }\n return;\n }\n var attributions = this.collectSourceAttributions_(frameState);\n var visible = attributions.length > 0;\n if (this.renderedVisible_ != visible) {\n this.element.style.display = visible ? '' : 'none';\n this.renderedVisible_ = visible;\n }\n if (equals(attributions, this.renderedAttributions_)) {\n return;\n }\n removeChildren(this.ulElement_);\n // append the attributions\n for (var i = 0, ii = attributions.length; i < ii; ++i) {\n var element = document.createElement('li');\n element.innerHTML = attributions[i];\n this.ulElement_.appendChild(element);\n }\n this.renderedAttributions_ = attributions;\n };\n /**\n * @param {MouseEvent} event The event to handle\n * @private\n */\n Attribution.prototype.handleClick_ = function (event) {\n event.preventDefault();\n this.handleToggle_();\n this.userCollapsed_ = this.collapsed_;\n };\n /**\n * @private\n */\n Attribution.prototype.handleToggle_ = function () {\n this.element.classList.toggle(CLASS_COLLAPSED);\n if (this.collapsed_) {\n replaceNode(this.collapseLabel_, this.label_);\n }\n else {\n replaceNode(this.label_, this.collapseLabel_);\n }\n this.collapsed_ = !this.collapsed_;\n this.toggleButton_.setAttribute('aria-expanded', String(!this.collapsed_));\n };\n /**\n * Return `true` if the attribution is collapsible, `false` otherwise.\n * @return {boolean} True if the widget is collapsible.\n * @api\n */\n Attribution.prototype.getCollapsible = function () {\n return this.collapsible_;\n };\n /**\n * Set whether the attribution should be collapsible.\n * @param {boolean} collapsible True if the widget is collapsible.\n * @api\n */\n Attribution.prototype.setCollapsible = function (collapsible) {\n if (this.collapsible_ === collapsible) {\n return;\n }\n this.collapsible_ = collapsible;\n this.element.classList.toggle('ol-uncollapsible');\n if (this.userCollapsed_) {\n this.handleToggle_();\n }\n };\n /**\n * Collapse or expand the attribution according to the passed parameter. Will\n * not do anything if the attribution isn't collapsible or if the current\n * collapsed state is already the one requested.\n * @param {boolean} collapsed True if the widget is collapsed.\n * @api\n */\n Attribution.prototype.setCollapsed = function (collapsed) {\n this.userCollapsed_ = collapsed;\n if (!this.collapsible_ || this.collapsed_ === collapsed) {\n return;\n }\n this.handleToggle_();\n };\n /**\n * Return `true` when the attribution is currently collapsed or `false`\n * otherwise.\n * @return {boolean} True if the widget is collapsed.\n * @api\n */\n Attribution.prototype.getCollapsed = function () {\n return this.collapsed_;\n };\n /**\n * Update the attribution element.\n * @param {import(\"../MapEvent.js\").default} mapEvent Map event.\n * @override\n */\n Attribution.prototype.render = function (mapEvent) {\n this.updateElement_(mapEvent.frameState);\n };\n return Attribution;\n}(Control));\nexport default Attribution;\n//# sourceMappingURL=Attribution.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/control/Rotate\n */\nimport Control from './Control.js';\nimport EventType from '../events/EventType.js';\nimport { CLASS_CONTROL, CLASS_HIDDEN, CLASS_UNSELECTABLE } from '../css.js';\nimport { easeOut } from '../easing.js';\n/**\n * @typedef {Object} Options\n * @property {string} [className='ol-rotate'] CSS class name.\n * @property {string|HTMLElement} [label='⇧'] Text label to use for the rotate button.\n * Instead of text, also an element (e.g. a `span` element) can be used.\n * @property {string} [tipLabel='Reset rotation'] Text label to use for the rotate tip.\n * @property {string} [compassClassName='ol-compass'] CSS class name for the compass.\n * @property {number} [duration=250] Animation duration in milliseconds.\n * @property {boolean} [autoHide=true] Hide the control when rotation is 0.\n * @property {function(import(\"../MapEvent.js\").default):void} [render] Function called when the control should\n * be re-rendered. This is called in a `requestAnimationFrame` callback.\n * @property {function():void} [resetNorth] Function called when the control is clicked.\n * This will override the default `resetNorth`.\n * @property {HTMLElement|string} [target] Specify a target if you want the control to be\n * rendered outside of the map's viewport.\n */\n/**\n * @classdesc\n * A button control to reset rotation to 0.\n * To style this control use css selector `.ol-rotate`. A `.ol-hidden` css\n * selector is added to the button when the rotation is 0.\n *\n * @api\n */\nvar Rotate = /** @class */ (function (_super) {\n __extends(Rotate, _super);\n /**\n * @param {Options} [opt_options] Rotate options.\n */\n function Rotate(opt_options) {\n var _this = this;\n var options = opt_options ? opt_options : {};\n _this = _super.call(this, {\n element: document.createElement('div'),\n render: options.render,\n target: options.target,\n }) || this;\n var className = options.className !== undefined ? options.className : 'ol-rotate';\n var label = options.label !== undefined ? options.label : '\\u21E7';\n var compassClassName = options.compassClassName !== undefined\n ? options.compassClassName\n : 'ol-compass';\n /**\n * @type {HTMLElement}\n * @private\n */\n _this.label_ = null;\n if (typeof label === 'string') {\n _this.label_ = document.createElement('span');\n _this.label_.className = compassClassName;\n _this.label_.textContent = label;\n }\n else {\n _this.label_ = label;\n _this.label_.classList.add(compassClassName);\n }\n var tipLabel = options.tipLabel ? options.tipLabel : 'Reset rotation';\n var button = document.createElement('button');\n button.className = className + '-reset';\n button.setAttribute('type', 'button');\n button.title = tipLabel;\n button.appendChild(_this.label_);\n button.addEventListener(EventType.CLICK, _this.handleClick_.bind(_this), false);\n var cssClasses = className + ' ' + CLASS_UNSELECTABLE + ' ' + CLASS_CONTROL;\n var element = _this.element;\n element.className = cssClasses;\n element.appendChild(button);\n _this.callResetNorth_ = options.resetNorth ? options.resetNorth : undefined;\n /**\n * @type {number}\n * @private\n */\n _this.duration_ = options.duration !== undefined ? options.duration : 250;\n /**\n * @type {boolean}\n * @private\n */\n _this.autoHide_ = options.autoHide !== undefined ? options.autoHide : true;\n /**\n * @private\n * @type {number|undefined}\n */\n _this.rotation_ = undefined;\n if (_this.autoHide_) {\n _this.element.classList.add(CLASS_HIDDEN);\n }\n return _this;\n }\n /**\n * @param {MouseEvent} event The event to handle\n * @private\n */\n Rotate.prototype.handleClick_ = function (event) {\n event.preventDefault();\n if (this.callResetNorth_ !== undefined) {\n this.callResetNorth_();\n }\n else {\n this.resetNorth_();\n }\n };\n /**\n * @private\n */\n Rotate.prototype.resetNorth_ = function () {\n var map = this.getMap();\n var view = map.getView();\n if (!view) {\n // the map does not have a view, so we can't act\n // upon it\n return;\n }\n var rotation = view.getRotation();\n if (rotation !== undefined) {\n if (this.duration_ > 0 && rotation % (2 * Math.PI) !== 0) {\n view.animate({\n rotation: 0,\n duration: this.duration_,\n easing: easeOut,\n });\n }\n else {\n view.setRotation(0);\n }\n }\n };\n /**\n * Update the rotate control element.\n * @param {import(\"../MapEvent.js\").default} mapEvent Map event.\n * @override\n */\n Rotate.prototype.render = function (mapEvent) {\n var frameState = mapEvent.frameState;\n if (!frameState) {\n return;\n }\n var rotation = frameState.viewState.rotation;\n if (rotation != this.rotation_) {\n var transform = 'rotate(' + rotation + 'rad)';\n if (this.autoHide_) {\n var contains = this.element.classList.contains(CLASS_HIDDEN);\n if (!contains && rotation === 0) {\n this.element.classList.add(CLASS_HIDDEN);\n }\n else if (contains && rotation !== 0) {\n this.element.classList.remove(CLASS_HIDDEN);\n }\n }\n this.label_.style.transform = transform;\n }\n this.rotation_ = rotation;\n };\n return Rotate;\n}(Control));\nexport default Rotate;\n//# sourceMappingURL=Rotate.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/control/Zoom\n */\nimport Control from './Control.js';\nimport EventType from '../events/EventType.js';\nimport { CLASS_CONTROL, CLASS_UNSELECTABLE } from '../css.js';\nimport { easeOut } from '../easing.js';\n/**\n * @typedef {Object} Options\n * @property {number} [duration=250] Animation duration in milliseconds.\n * @property {string} [className='ol-zoom'] CSS class name.\n * @property {string} [zoomInClassName=className + '-in'] CSS class name for the zoom-in button.\n * @property {string} [zoomOutClassName=className + '-out'] CSS class name for the zoom-out button.\n * @property {string|HTMLElement} [zoomInLabel='+'] Text label to use for the zoom-in\n * button. Instead of text, also an element (e.g. a `span` element) can be used.\n * @property {string|HTMLElement} [zoomOutLabel='–'] Text label to use for the zoom-out button.\n * Instead of text, also an element (e.g. a `span` element) can be used.\n * @property {string} [zoomInTipLabel='Zoom in'] Text label to use for the button tip.\n * @property {string} [zoomOutTipLabel='Zoom out'] Text label to use for the button tip.\n * @property {number} [delta=1] The zoom delta applied on each click.\n * @property {HTMLElement|string} [target] Specify a target if you want the control to be\n * rendered outside of the map's viewport.\n */\n/**\n * @classdesc\n * A control with 2 buttons, one for zoom in and one for zoom out.\n * This control is one of the default controls of a map. To style this control\n * use css selectors `.ol-zoom-in` and `.ol-zoom-out`.\n *\n * @api\n */\nvar Zoom = /** @class */ (function (_super) {\n __extends(Zoom, _super);\n /**\n * @param {Options} [opt_options] Zoom options.\n */\n function Zoom(opt_options) {\n var _this = this;\n var options = opt_options ? opt_options : {};\n _this = _super.call(this, {\n element: document.createElement('div'),\n target: options.target,\n }) || this;\n var className = options.className !== undefined ? options.className : 'ol-zoom';\n var delta = options.delta !== undefined ? options.delta : 1;\n var zoomInClassName = options.zoomInClassName !== undefined\n ? options.zoomInClassName\n : className + '-in';\n var zoomOutClassName = options.zoomOutClassName !== undefined\n ? options.zoomOutClassName\n : className + '-out';\n var zoomInLabel = options.zoomInLabel !== undefined ? options.zoomInLabel : '+';\n var zoomOutLabel = options.zoomOutLabel !== undefined ? options.zoomOutLabel : '\\u2013';\n var zoomInTipLabel = options.zoomInTipLabel !== undefined ? options.zoomInTipLabel : 'Zoom in';\n var zoomOutTipLabel = options.zoomOutTipLabel !== undefined\n ? options.zoomOutTipLabel\n : 'Zoom out';\n var inElement = document.createElement('button');\n inElement.className = zoomInClassName;\n inElement.setAttribute('type', 'button');\n inElement.title = zoomInTipLabel;\n inElement.appendChild(typeof zoomInLabel === 'string'\n ? document.createTextNode(zoomInLabel)\n : zoomInLabel);\n inElement.addEventListener(EventType.CLICK, _this.handleClick_.bind(_this, delta), false);\n var outElement = document.createElement('button');\n outElement.className = zoomOutClassName;\n outElement.setAttribute('type', 'button');\n outElement.title = zoomOutTipLabel;\n outElement.appendChild(typeof zoomOutLabel === 'string'\n ? document.createTextNode(zoomOutLabel)\n : zoomOutLabel);\n outElement.addEventListener(EventType.CLICK, _this.handleClick_.bind(_this, -delta), false);\n var cssClasses = className + ' ' + CLASS_UNSELECTABLE + ' ' + CLASS_CONTROL;\n var element = _this.element;\n element.className = cssClasses;\n element.appendChild(inElement);\n element.appendChild(outElement);\n /**\n * @type {number}\n * @private\n */\n _this.duration_ = options.duration !== undefined ? options.duration : 250;\n return _this;\n }\n /**\n * @param {number} delta Zoom delta.\n * @param {MouseEvent} event The event to handle\n * @private\n */\n Zoom.prototype.handleClick_ = function (delta, event) {\n event.preventDefault();\n this.zoomByDelta_(delta);\n };\n /**\n * @param {number} delta Zoom delta.\n * @private\n */\n Zoom.prototype.zoomByDelta_ = function (delta) {\n var map = this.getMap();\n var view = map.getView();\n if (!view) {\n // the map does not have a view, so we can't act\n // upon it\n return;\n }\n var currentZoom = view.getZoom();\n if (currentZoom !== undefined) {\n var newZoom = view.getConstrainedZoom(currentZoom + delta);\n if (this.duration_ > 0) {\n if (view.getAnimating()) {\n view.cancelAnimations();\n }\n view.animate({\n zoom: newZoom,\n duration: this.duration_,\n easing: easeOut,\n });\n }\n else {\n view.setZoom(newZoom);\n }\n }\n };\n return Zoom;\n}(Control));\nexport default Zoom;\n//# sourceMappingURL=Zoom.js.map","/**\n * @module ol/interaction/Property\n */\n/**\n * @enum {string}\n */\nexport default {\n ACTIVE: 'active',\n};\n//# sourceMappingURL=Property.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/interaction/Interaction\n */\nimport BaseObject from '../Object.js';\nimport InteractionProperty from './Property.js';\nimport { easeOut, linear } from '../easing.js';\n/***\n * @template Return\n * @typedef {import(\"../Observable\").OnSignature &\n * import(\"../Observable\").OnSignature &\n * import(\"../Observable\").CombinedOnSignature} InteractionOnSignature\n */\n/**\n * Object literal with config options for interactions.\n * @typedef {Object} InteractionOptions\n * @property {function(import(\"../MapBrowserEvent.js\").default):boolean} handleEvent\n * Method called by the map to notify the interaction that a browser event was\n * dispatched to the map. If the function returns a falsy value, propagation of\n * the event to other interactions in the map's interactions chain will be\n * prevented (this includes functions with no explicit return). The interactions\n * are traversed in reverse order of the interactions collection of the map.\n */\n/**\n * @classdesc\n * Abstract base class; normally only used for creating subclasses and not\n * instantiated in apps.\n * User actions that change the state of the map. Some are similar to controls,\n * but are not associated with a DOM element.\n * For example, {@link module:ol/interaction/KeyboardZoom~KeyboardZoom} is\n * functionally the same as {@link module:ol/control/Zoom~Zoom}, but triggered\n * by a keyboard event not a button element event.\n * Although interactions do not have a DOM element, some of them do render\n * vectors and so are visible on the screen.\n * @api\n */\nvar Interaction = /** @class */ (function (_super) {\n __extends(Interaction, _super);\n /**\n * @param {InteractionOptions} [opt_options] Options.\n */\n function Interaction(opt_options) {\n var _this = _super.call(this) || this;\n /***\n * @type {InteractionOnSignature}\n */\n _this.on;\n /***\n * @type {InteractionOnSignature}\n */\n _this.once;\n /***\n * @type {InteractionOnSignature}\n */\n _this.un;\n if (opt_options && opt_options.handleEvent) {\n _this.handleEvent = opt_options.handleEvent;\n }\n /**\n * @private\n * @type {import(\"../PluggableMap.js\").default}\n */\n _this.map_ = null;\n _this.setActive(true);\n return _this;\n }\n /**\n * Return whether the interaction is currently active.\n * @return {boolean} `true` if the interaction is active, `false` otherwise.\n * @observable\n * @api\n */\n Interaction.prototype.getActive = function () {\n return /** @type {boolean} */ (this.get(InteractionProperty.ACTIVE));\n };\n /**\n * Get the map associated with this interaction.\n * @return {import(\"../PluggableMap.js\").default} Map.\n * @api\n */\n Interaction.prototype.getMap = function () {\n return this.map_;\n };\n /**\n * Handles the {@link module:ol/MapBrowserEvent map browser event}.\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} `false` to stop event propagation.\n * @api\n */\n Interaction.prototype.handleEvent = function (mapBrowserEvent) {\n return true;\n };\n /**\n * Activate or deactivate the interaction.\n * @param {boolean} active Active.\n * @observable\n * @api\n */\n Interaction.prototype.setActive = function (active) {\n this.set(InteractionProperty.ACTIVE, active);\n };\n /**\n * Remove the interaction from its current map and attach it to the new map.\n * Subclasses may set up event handlers to get notified about changes to\n * the map here.\n * @param {import(\"../PluggableMap.js\").default} map Map.\n */\n Interaction.prototype.setMap = function (map) {\n this.map_ = map;\n };\n return Interaction;\n}(BaseObject));\n/**\n * @param {import(\"../View.js\").default} view View.\n * @param {import(\"../coordinate.js\").Coordinate} delta Delta.\n * @param {number} [opt_duration] Duration.\n */\nexport function pan(view, delta, opt_duration) {\n var currentCenter = view.getCenterInternal();\n if (currentCenter) {\n var center = [currentCenter[0] + delta[0], currentCenter[1] + delta[1]];\n view.animateInternal({\n duration: opt_duration !== undefined ? opt_duration : 250,\n easing: linear,\n center: view.getConstrainedCenter(center),\n });\n }\n}\n/**\n * @param {import(\"../View.js\").default} view View.\n * @param {number} delta Delta from previous zoom level.\n * @param {import(\"../coordinate.js\").Coordinate} [opt_anchor] Anchor coordinate in the user projection.\n * @param {number} [opt_duration] Duration.\n */\nexport function zoomByDelta(view, delta, opt_anchor, opt_duration) {\n var currentZoom = view.getZoom();\n if (currentZoom === undefined) {\n return;\n }\n var newZoom = view.getConstrainedZoom(currentZoom + delta);\n var newResolution = view.getResolutionForZoom(newZoom);\n if (view.getAnimating()) {\n view.cancelAnimations();\n }\n view.animate({\n resolution: newResolution,\n anchor: opt_anchor,\n duration: opt_duration !== undefined ? opt_duration : 250,\n easing: easeOut,\n });\n}\nexport default Interaction;\n//# sourceMappingURL=Interaction.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/interaction/DoubleClickZoom\n */\nimport Interaction, { zoomByDelta } from './Interaction.js';\nimport MapBrowserEventType from '../MapBrowserEventType.js';\n/**\n * @typedef {Object} Options\n * @property {number} [duration=250] Animation duration in milliseconds.\n * @property {number} [delta=1] The zoom delta applied on each double click.\n */\n/**\n * @classdesc\n * Allows the user to zoom by double-clicking on the map.\n * @api\n */\nvar DoubleClickZoom = /** @class */ (function (_super) {\n __extends(DoubleClickZoom, _super);\n /**\n * @param {Options} [opt_options] Options.\n */\n function DoubleClickZoom(opt_options) {\n var _this = _super.call(this) || this;\n var options = opt_options ? opt_options : {};\n /**\n * @private\n * @type {number}\n */\n _this.delta_ = options.delta ? options.delta : 1;\n /**\n * @private\n * @type {number}\n */\n _this.duration_ = options.duration !== undefined ? options.duration : 250;\n return _this;\n }\n /**\n * Handles the {@link module:ol/MapBrowserEvent map browser event} (if it was a\n * doubleclick) and eventually zooms the map.\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} `false` to stop event propagation.\n */\n DoubleClickZoom.prototype.handleEvent = function (mapBrowserEvent) {\n var stopEvent = false;\n if (mapBrowserEvent.type == MapBrowserEventType.DBLCLICK) {\n var browserEvent = /** @type {MouseEvent} */ (mapBrowserEvent.originalEvent);\n var map = mapBrowserEvent.map;\n var anchor = mapBrowserEvent.coordinate;\n var delta = browserEvent.shiftKey ? -this.delta_ : this.delta_;\n var view = map.getView();\n zoomByDelta(view, delta, anchor, this.duration_);\n browserEvent.preventDefault();\n stopEvent = true;\n }\n return !stopEvent;\n };\n return DoubleClickZoom;\n}(Interaction));\nexport default DoubleClickZoom;\n//# sourceMappingURL=DoubleClickZoom.js.map","var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\n/**\n * @module ol/interaction/Pointer\n */\nimport Interaction from './Interaction.js';\nimport MapBrowserEventType from '../MapBrowserEventType.js';\nimport { getValues } from '../obj.js';\n/**\n * @typedef {Object} Options\n * @property {function(import(\"../MapBrowserEvent.js\").default):boolean} [handleDownEvent]\n * Function handling \"down\" events. If the function returns `true` then a drag\n * sequence is started.\n * @property {function(import(\"../MapBrowserEvent.js\").default):void} [handleDragEvent]\n * Function handling \"drag\" events. This function is called on \"move\" events\n * during a drag sequence.\n * @property {function(import(\"../MapBrowserEvent.js\").default):boolean} [handleEvent]\n * Method called by the map to notify the interaction that a browser event was\n * dispatched to the map. The function may return `false` to prevent the\n * propagation of the event to other interactions in the map's interactions\n * chain.\n * @property {function(import(\"../MapBrowserEvent.js\").default):void} [handleMoveEvent]\n * Function handling \"move\" events. This function is called on \"move\" events.\n * This functions is also called during a drag sequence, so during a drag\n * sequence both the `handleDragEvent` function and this function are called.\n * If `handleDownEvent` is defined and it returns true this function will not\n * be called during a drag sequence.\n * @property {function(import(\"../MapBrowserEvent.js\").default):boolean} [handleUpEvent]\n * Function handling \"up\" events. If the function returns `false` then the\n * current drag sequence is stopped.\n * @property {function(boolean):boolean} [stopDown]\n * Should the down event be propagated to other interactions, or should be\n * stopped?\n */\n/**\n * @classdesc\n * Base class that calls user-defined functions on `down`, `move` and `up`\n * events. This class also manages \"drag sequences\".\n *\n * When the `handleDownEvent` user function returns `true` a drag sequence is\n * started. During a drag sequence the `handleDragEvent` user function is\n * called on `move` events. The drag sequence ends when the `handleUpEvent`\n * user function is called and returns `false`.\n * @api\n */\nvar PointerInteraction = /** @class */ (function (_super) {\n __extends(PointerInteraction, _super);\n /**\n * @param {Options} [opt_options] Options.\n */\n function PointerInteraction(opt_options) {\n var _this = this;\n var options = opt_options ? opt_options : {};\n _this = _super.call(this, \n /** @type {import(\"./Interaction.js\").InteractionOptions} */ (options)) || this;\n if (options.handleDownEvent) {\n _this.handleDownEvent = options.handleDownEvent;\n }\n if (options.handleDragEvent) {\n _this.handleDragEvent = options.handleDragEvent;\n }\n if (options.handleMoveEvent) {\n _this.handleMoveEvent = options.handleMoveEvent;\n }\n if (options.handleUpEvent) {\n _this.handleUpEvent = options.handleUpEvent;\n }\n if (options.stopDown) {\n _this.stopDown = options.stopDown;\n }\n /**\n * @type {boolean}\n * @protected\n */\n _this.handlingDownUpSequence = false;\n /**\n * @type {!Object}\n * @private\n */\n _this.trackedPointers_ = {};\n /**\n * @type {Array}\n * @protected\n */\n _this.targetPointers = [];\n return _this;\n }\n /**\n * Returns the current number of pointers involved in the interaction,\n * e.g. `2` when two fingers are used.\n * @return {number} The number of pointers.\n * @api\n */\n PointerInteraction.prototype.getPointerCount = function () {\n return this.targetPointers.length;\n };\n /**\n * Handle pointer down events.\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Event.\n * @return {boolean} If the event was consumed.\n * @protected\n */\n PointerInteraction.prototype.handleDownEvent = function (mapBrowserEvent) {\n return false;\n };\n /**\n * Handle pointer drag events.\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Event.\n * @protected\n */\n PointerInteraction.prototype.handleDragEvent = function (mapBrowserEvent) { };\n /**\n * Handles the {@link module:ol/MapBrowserEvent map browser event} and may call into\n * other functions, if event sequences like e.g. 'drag' or 'down-up' etc. are\n * detected.\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} `false` to stop event propagation.\n * @api\n */\n PointerInteraction.prototype.handleEvent = function (mapBrowserEvent) {\n if (!mapBrowserEvent.originalEvent) {\n return true;\n }\n var stopEvent = false;\n this.updateTrackedPointers_(mapBrowserEvent);\n if (this.handlingDownUpSequence) {\n if (mapBrowserEvent.type == MapBrowserEventType.POINTERDRAG) {\n this.handleDragEvent(mapBrowserEvent);\n // prevent page scrolling during dragging\n mapBrowserEvent.originalEvent.preventDefault();\n }\n else if (mapBrowserEvent.type == MapBrowserEventType.POINTERUP) {\n var handledUp = this.handleUpEvent(mapBrowserEvent);\n this.handlingDownUpSequence =\n handledUp && this.targetPointers.length > 0;\n }\n }\n else {\n if (mapBrowserEvent.type == MapBrowserEventType.POINTERDOWN) {\n var handled = this.handleDownEvent(mapBrowserEvent);\n this.handlingDownUpSequence = handled;\n stopEvent = this.stopDown(handled);\n }\n else if (mapBrowserEvent.type == MapBrowserEventType.POINTERMOVE) {\n this.handleMoveEvent(mapBrowserEvent);\n }\n }\n return !stopEvent;\n };\n /**\n * Handle pointer move events.\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Event.\n * @protected\n */\n PointerInteraction.prototype.handleMoveEvent = function (mapBrowserEvent) { };\n /**\n * Handle pointer up events.\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Event.\n * @return {boolean} If the event was consumed.\n * @protected\n */\n PointerInteraction.prototype.handleUpEvent = function (mapBrowserEvent) {\n return false;\n };\n /**\n * This function is used to determine if \"down\" events should be propagated\n * to other interactions or should be stopped.\n * @param {boolean} handled Was the event handled by the interaction?\n * @return {boolean} Should the `down` event be stopped?\n */\n PointerInteraction.prototype.stopDown = function (handled) {\n return handled;\n };\n /**\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Event.\n * @private\n */\n PointerInteraction.prototype.updateTrackedPointers_ = function (mapBrowserEvent) {\n if (isPointerDraggingEvent(mapBrowserEvent)) {\n var event_1 = mapBrowserEvent.originalEvent;\n var id = event_1.pointerId.toString();\n if (mapBrowserEvent.type == MapBrowserEventType.POINTERUP) {\n delete this.trackedPointers_[id];\n }\n else if (mapBrowserEvent.type == MapBrowserEventType.POINTERDOWN) {\n this.trackedPointers_[id] = event_1;\n }\n else if (id in this.trackedPointers_) {\n // update only when there was a pointerdown event for this pointer\n this.trackedPointers_[id] = event_1;\n }\n this.targetPointers = getValues(this.trackedPointers_);\n }\n };\n return PointerInteraction;\n}(Interaction));\n/**\n * @param {Array} pointerEvents List of events.\n * @return {import(\"../pixel.js\").Pixel} Centroid pixel.\n */\nexport function centroid(pointerEvents) {\n var length = pointerEvents.length;\n var clientX = 0;\n var clientY = 0;\n for (var i = 0; i < length; i++) {\n clientX += pointerEvents[i].clientX;\n clientY += pointerEvents[i].clientY;\n }\n return [clientX / length, clientY / length];\n}\n/**\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Event.\n * @return {boolean} Whether the event is a pointerdown, pointerdrag\n * or pointerup event.\n */\nfunction isPointerDraggingEvent(mapBrowserEvent) {\n var type = mapBrowserEvent.type;\n return (type === MapBrowserEventType.POINTERDOWN ||\n type === MapBrowserEventType.POINTERDRAG ||\n type === MapBrowserEventType.POINTERUP);\n}\nexport default PointerInteraction;\n//# sourceMappingURL=Pointer.js.map","/**\n * @module ol/events/condition\n */\nimport MapBrowserEventType from '../MapBrowserEventType.js';\nimport { FALSE, TRUE } from '../functions.js';\nimport { MAC, WEBKIT } from '../has.js';\nimport { assert } from '../asserts.js';\n/**\n * A function that takes an {@link module:ol/MapBrowserEvent} and returns a\n * `{boolean}`. If the condition is met, true should be returned.\n *\n * @typedef {function(this: ?, import(\"../MapBrowserEvent.js\").default): boolean} Condition\n */\n/**\n * Creates a condition function that passes when all provided conditions pass.\n * @param {...Condition} var_args Conditions to check.\n * @return {Condition} Condition function.\n */\nexport function all(var_args) {\n var conditions = arguments;\n /**\n * @param {import(\"../MapBrowserEvent.js\").default} event Event.\n * @return {boolean} All conditions passed.\n */\n return function (event) {\n var pass = true;\n for (var i = 0, ii = conditions.length; i < ii; ++i) {\n pass = pass && conditions[i](event);\n if (!pass) {\n break;\n }\n }\n return pass;\n };\n}\n/**\n * Return `true` if only the alt-key is pressed, `false` otherwise (e.g. when\n * additionally the shift-key is pressed).\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} True if only the alt key is pressed.\n * @api\n */\nexport var altKeyOnly = function (mapBrowserEvent) {\n var originalEvent = /** @type {KeyboardEvent|MouseEvent|TouchEvent} */ (mapBrowserEvent.originalEvent);\n return (originalEvent.altKey &&\n !(originalEvent.metaKey || originalEvent.ctrlKey) &&\n !originalEvent.shiftKey);\n};\n/**\n * Return `true` if only the alt-key and shift-key is pressed, `false` otherwise\n * (e.g. when additionally the platform-modifier-key is pressed).\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} True if only the alt and shift keys are pressed.\n * @api\n */\nexport var altShiftKeysOnly = function (mapBrowserEvent) {\n var originalEvent = /** @type {KeyboardEvent|MouseEvent|TouchEvent} */ (mapBrowserEvent.originalEvent);\n return (originalEvent.altKey &&\n !(originalEvent.metaKey || originalEvent.ctrlKey) &&\n originalEvent.shiftKey);\n};\n/**\n * Return `true` if the map has the focus. This condition requires a map target\n * element with a `tabindex` attribute, e.g. `
`.\n *\n * @param {import(\"../MapBrowserEvent.js\").default} event Map browser event.\n * @return {boolean} The map has the focus.\n * @api\n */\nexport var focus = function (event) {\n return event.target.getTargetElement().contains(document.activeElement);\n};\n/**\n * Return `true` if the map has the focus or no 'tabindex' attribute set.\n *\n * @param {import(\"../MapBrowserEvent.js\").default} event Map browser event.\n * @return {boolean} The map container has the focus or no 'tabindex' attribute.\n */\nexport var focusWithTabindex = function (event) {\n return event.map.getTargetElement().hasAttribute('tabindex')\n ? focus(event)\n : true;\n};\n/**\n * Return always true.\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} True.\n * @api\n */\nexport var always = TRUE;\n/**\n * Return `true` if the event is a `click` event, `false` otherwise.\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} True if the event is a map `click` event.\n * @api\n */\nexport var click = function (mapBrowserEvent) {\n return mapBrowserEvent.type == MapBrowserEventType.CLICK;\n};\n/**\n * Return `true` if the event has an \"action\"-producing mouse button.\n *\n * By definition, this includes left-click on windows/linux, and left-click\n * without the ctrl key on Macs.\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} The result.\n */\nexport var mouseActionButton = function (mapBrowserEvent) {\n var originalEvent = /** @type {MouseEvent} */ (mapBrowserEvent.originalEvent);\n return originalEvent.button == 0 && !(WEBKIT && MAC && originalEvent.ctrlKey);\n};\n/**\n * Return always false.\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} False.\n * @api\n */\nexport var never = FALSE;\n/**\n * Return `true` if the browser event is a `pointermove` event, `false`\n * otherwise.\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} True if the browser event is a `pointermove` event.\n * @api\n */\nexport var pointerMove = function (mapBrowserEvent) {\n return mapBrowserEvent.type == 'pointermove';\n};\n/**\n * Return `true` if the event is a map `singleclick` event, `false` otherwise.\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} True if the event is a map `singleclick` event.\n * @api\n */\nexport var singleClick = function (mapBrowserEvent) {\n return mapBrowserEvent.type == MapBrowserEventType.SINGLECLICK;\n};\n/**\n * Return `true` if the event is a map `dblclick` event, `false` otherwise.\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} True if the event is a map `dblclick` event.\n * @api\n */\nexport var doubleClick = function (mapBrowserEvent) {\n return mapBrowserEvent.type == MapBrowserEventType.DBLCLICK;\n};\n/**\n * Return `true` if no modifier key (alt-, shift- or platform-modifier-key) is\n * pressed.\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} True only if there no modifier keys are pressed.\n * @api\n */\nexport var noModifierKeys = function (mapBrowserEvent) {\n var originalEvent = /** @type {KeyboardEvent|MouseEvent|TouchEvent} */ (mapBrowserEvent.originalEvent);\n return (!originalEvent.altKey &&\n !(originalEvent.metaKey || originalEvent.ctrlKey) &&\n !originalEvent.shiftKey);\n};\n/**\n * Return `true` if only the platform-modifier-key (the meta-key on Mac,\n * ctrl-key otherwise) is pressed, `false` otherwise (e.g. when additionally\n * the shift-key is pressed).\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} True if only the platform modifier key is pressed.\n * @api\n */\nexport var platformModifierKeyOnly = function (mapBrowserEvent) {\n var originalEvent = /** @type {KeyboardEvent|MouseEvent|TouchEvent} */ (mapBrowserEvent.originalEvent);\n return (!originalEvent.altKey &&\n (MAC ? originalEvent.metaKey : originalEvent.ctrlKey) &&\n !originalEvent.shiftKey);\n};\n/**\n * Return `true` if only the shift-key is pressed, `false` otherwise (e.g. when\n * additionally the alt-key is pressed).\n *\n * @param {import(\"../MapBrowserEvent.js\").default} mapBrowserEvent Map browser event.\n * @return {boolean} True if only the shift key is pressed.\n * @api\n */\nexport var shiftKeyOnly = function (mapBrowserEvent) {\n var originalEvent = /** @type {KeyboardEvent|MouseEvent|TouchEvent} */ (mapBrowserEvent.originalEvent);\n return (!originalEvent.altKey &&\n !(originalEvent.metaKey || originalEvent.ctrlKey) &&\n originalEvent.shiftKey);\n};\n/**\n * Return `true` if the target element is not editable, i.e. not a ``-,\n * `