Bundle changes to test on other platforms.

diff --git a/global.min.js b/global.min.js
index 46867c952f0086893b5b9efb1a46eb5b9954dba3..9d4062c5fb077a61108c140e7631041131c8010e 100644 (file)
--- a/global.min.js
+++ b/global.min.js
@@ -2723,7 +2723,7 @@ layout(std140) uniform WORK {
 
 // Defined separately from uint v[32] below as the original value is required
 // to calculate the second uint32 of the digest for threshold comparison
-#define BLAKE2B_IV32_1 0x6A09E667u
+const uint BLAKE2B_IV32_1 = 0x6A09E667u;
 
 // Both buffers represent 16 uint64s as 32 uint32s
 // because that's what GLSL offers, just like Javascript
@@ -2753,75 +2753,75 @@ uint m[32];
 // These are offsets into the input data buffer for each mixing step.
 // They are multiplied by 2 from the original SIGMA values in
 // the C reference implementation, which refered to uint64s.
-const int SIGMA82[192] = int[192](
-       0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,
-       28,20,8,16,18,30,26,12,2,24,0,4,22,14,10,6,
-       22,16,24,0,10,4,30,26,20,28,6,12,14,2,18,8,
-       14,18,6,2,26,24,22,28,4,12,10,20,8,0,30,16,
-       18,0,10,14,4,8,20,30,28,2,22,24,12,16,6,26,
-       4,24,12,20,0,22,16,6,8,26,14,10,30,28,2,18,
-       24,10,2,30,28,26,8,20,0,14,12,6,18,4,16,22,
-       26,22,14,28,24,2,6,18,10,0,30,8,16,12,4,20,
-       12,30,28,18,22,6,0,16,24,4,26,14,2,8,20,10,
-       20,4,16,8,14,12,2,10,30,22,18,28,6,24,26,0,
-       0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,
-       28,20,8,16,18,30,26,12,2,24,0,4,22,14,10,6
+const uint SIGMA82[192] = uint[192](
+       0u,2u,4u,6u,8u,10u,12u,14u,16u,18u,20u,22u,24u,26u,28u,30u,
+       28u,20u,8u,16u,18u,30u,26u,12u,2u,24u,0u,4u,22u,14u,10u,6u,
+       22u,16u,24u,0u,10u,4u,30u,26u,20u,28u,6u,12u,14u,2u,18u,8u,
+       14u,18u,6u,2u,26u,24u,22u,28u,4u,12u,10u,20u,8u,0u,30u,16u,
+       18u,0u,10u,14u,4u,8u,20u,30u,28u,2u,22u,24u,12u,16u,6u,26u,
+       4u,24u,12u,20u,0u,22u,16u,6u,8u,26u,14u,10u,30u,28u,2u,18u,
+       24u,10u,2u,30u,28u,26u,8u,20u,0u,14u,12u,6u,18u,4u,16u,22u,
+       26u,22u,14u,28u,24u,2u,6u,18u,10u,0u,30u,8u,16u,12u,4u,20u,
+       12u,30u,28u,18u,22u,6u,0u,16u,24u,4u,26u,14u,2u,8u,20u,10u,
+       20u,4u,16u,8u,14u,12u,2u,10u,30u,22u,18u,28u,6u,24u,26u,0u,
+       0u,2u,4u,6u,8u,10u,12u,14u,16u,18u,20u,22u,24u,26u,28u,30u,
+       28u,20u,8u,16u,18u,30u,26u,12u,2u,24u,0u,4u,22u,14u,10u,6u
 );
 
 // 64-bit unsigned addition within the compression buffer
 // Sets v[a,a+1] += b
 // b0 is the low 32 bits of b, b1 represents the high 32 bits
-void add_uint64 (int a, uint b0, uint b1) {
+void add_uint64 (uint a, uint b0, uint b1) {
        uint o0 = v[a] + b0;
-       uint o1 = v[a + 1] + b1;
+       uint o1 = v[a+1u] + b1;
        if (v[a] > 0xFFFFFFFFu - b0) { // did low 32 bits overflow?
                o1++;
        }
        v[a] = o0;
-       v[a + 1] = o1;
+       v[a+1u] = o1;
 }
 
 // G Mixing function
-void B2B_G (int a, int b, int c, int d, int ix, int iy) {
-       add_uint64(a, v[b], v[b+1]);
-       add_uint64(a, m[ix], m[ix + 1]);
+void B2B_G (uint a, uint b, uint c, uint d, uint ix, uint iy) {
+       add_uint64(a, v[b], v[b+1u]);
+       add_uint64(a, m[ix], m[ix+1u]);
 
        // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated to the right by 32 bits
        uint xor0 = v[d] ^ v[a];
-       uint xor1 = v[d + 1] ^ v[a + 1];
+       uint xor1 = v[d+1u] ^ v[a+1u];
        v[d] = xor1;
-       v[d + 1] = xor0;
+       v[d+1u] = xor0;
 
-       add_uint64(c, v[d], v[d+1]);
+       add_uint64(c, v[d], v[d+1u]);
 
        // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 24 bits
        xor0 = v[b] ^ v[c];
-       xor1 = v[b + 1] ^ v[c + 1];
-       v[b] = (xor0 >> 24) ^ (xor1 << 8);
-       v[b + 1] = (xor1 >> 24) ^ (xor0 << 8);
+       xor1 = v[b+1u] ^ v[c+1u];
+       v[b] = (xor0 >> 24u) ^ (xor1 << 8u);
+       v[b+1u] = (xor1 >> 24u) ^ (xor0 << 8u);
 
-       add_uint64(a, v[b], v[b+1]);
-       add_uint64(a, m[iy], m[iy + 1]);
+       add_uint64(a, v[b], v[b+1u]);
+       add_uint64(a, m[iy], m[iy+1u]);
 
        // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated right by 16 bits
        xor0 = v[d] ^ v[a];
-       xor1 = v[d + 1] ^ v[a + 1];
-       v[d] = (xor0 >> 16) ^ (xor1 << 16);
-       v[d + 1] = (xor1 >> 16) ^ (xor0 << 16);
+       xor1 = v[d+1u] ^ v[a+1u];
+       v[d] = (xor0 >> 16u) ^ (xor1 << 16u);
+       v[d+1u] = (xor1 >> 16u) ^ (xor0 << 16u);
 
-       add_uint64(c, v[d], v[d+1]);
+       add_uint64(c, v[d], v[d+1u]);
 
        // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 63 bits
        xor0 = v[b] ^ v[c];
-       xor1 = v[b + 1] ^ v[c + 1];
-       v[b] = (xor1 >> 31) ^ (xor0 << 1);
-       v[b + 1] = (xor0 >> 31) ^ (xor1 << 1);
+       xor1 = v[b+1u] ^ v[c+1u];
+       v[b] = (xor1 >> 31u) ^ (xor0 << 1u);
+       v[b+1u] = (xor0 >> 31u) ^ (xor1 << 1u);
 }
 
 void main() {
        int i;
-       uvec4 u_work0 = work[0];
-       uvec4 u_work1 = work[1];
+       uvec4 u_work0 = work[0u];
+       uvec4 u_work1 = work[1u];
        uint uv_x = uint(uv_pos.x * workload);
        uint uv_y = uint(uv_pos.y * workload);
        uint x_pos = uv_x % 256u;
@@ -2832,36 +2832,36 @@ void main() {
        // First 2 work bytes are the x,y pos within the 256x256 area, the next
        // two bytes are modified from the random generated value, XOR'd with
        // the x,y area index of where this pixel is located
-       m[0] = (x_pos ^ (y_pos << 8) ^ ((u_work0.b ^ x_index) << 16) ^ ((u_work0.a ^ y_index) << 24));
+       m[0u] = (x_pos ^ (y_pos << 8u) ^ ((u_work0.b ^ x_index) << 16u) ^ ((u_work0.a ^ y_index) << 24u));
 
        // Remaining bytes are un-modified from the random generated value
-       m[1] = (u_work1.r ^ (u_work1.g << 8) ^ (u_work1.b << 16) ^ (u_work1.a << 24));
+       m[1u] = (u_work1.r ^ (u_work1.g << 8u) ^ (u_work1.b << 16u) ^ (u_work1.a << 24u));
 
        // Block hash
-       for (i=0;i<8;i++) {
-               m[i+2] = blockhash[i];
+       for (uint i = 0u; i < 8u; i = i + 1u) {
+               m[i+2u] = blockhash[i];
        }
 
        // twelve rounds of mixing
-       for(i=0;i<12;i++) {
-               B2B_G(0, 8, 16, 24, SIGMA82[i * 16 + 0], SIGMA82[i * 16 + 1]);
-               B2B_G(2, 10, 18, 26, SIGMA82[i * 16 + 2], SIGMA82[i * 16 + 3]);
-               B2B_G(4, 12, 20, 28, SIGMA82[i * 16 + 4], SIGMA82[i * 16 + 5]);
-               B2B_G(6, 14, 22, 30, SIGMA82[i * 16 + 6], SIGMA82[i * 16 + 7]);
-               B2B_G(0, 10, 20, 30, SIGMA82[i * 16 + 8], SIGMA82[i * 16 + 9]);
-               B2B_G(2, 12, 22, 24, SIGMA82[i * 16 + 10], SIGMA82[i * 16 + 11]);
-               B2B_G(4, 14, 16, 26, SIGMA82[i * 16 + 12], SIGMA82[i * 16 + 13]);
-               B2B_G(6, 8, 18, 28, SIGMA82[i * 16 + 14], SIGMA82[i * 16 + 15]);
+       for(uint i = 0u; i < 12u; i = i + 1u) {
+               B2B_G(0u, 8u, 16u, 24u, SIGMA82[i * 16u + 0u], SIGMA82[i * 16u + 1u]);
+               B2B_G(2u, 10u, 18u, 26u, SIGMA82[i * 16u + 2u], SIGMA82[i * 16u + 3u]);
+               B2B_G(4u, 12u, 20u, 28u, SIGMA82[i * 16u + 4u], SIGMA82[i * 16u + 5u]);
+               B2B_G(6u, 14u, 22u, 30u, SIGMA82[i * 16u + 6u], SIGMA82[i * 16u + 7u]);
+               B2B_G(0u, 10u, 20u, 30u, SIGMA82[i * 16u + 8u], SIGMA82[i * 16u + 9u]);
+               B2B_G(2u, 12u, 22u, 24u, SIGMA82[i * 16u + 10u], SIGMA82[i * 16u + 11u]);
+               B2B_G(4u, 14u, 16u, 26u, SIGMA82[i * 16u + 12u], SIGMA82[i * 16u + 13u]);
+               B2B_G(6u, 8u, 18u, 28u, SIGMA82[i * 16u + 14u], SIGMA82[i * 16u + 15u]);
        }
 
        // Pixel data is multipled by threshold test result (0 or 1)
        // First 4 bytes insignificant, only calculate digest of second 4 bytes
-       if ((BLAKE2B_IV32_1 ^ v[1] ^ v[17]) > threshold) {
+       if ((BLAKE2B_IV32_1 ^ v[1u] ^ v[17u]) > threshold) {
                fragColor = vec4(
-                       float(x_index + 1u)/255., // +1 to distinguish from 0 (unsuccessful) pixels
-                       float(y_index + 1u)/255., // Same as previous
-                       float(x_pos)/255., // Return the 2 custom bytes used in work value
-                       float(y_pos)/255.  // Second custom byte
+                       float(x_index + 1u)/255.0, // +1 to distinguish from 0 (unsuccessful) pixels
+                       float(y_index + 1u)/255.0, // Same as previous
+                       float(x_pos)/255.0, // Return the 2 custom bytes used in work value
+                       float(y_pos)/255.0  // Second custom byte
                );
        } else {
                discard;
@@ -2997,7 +2997,9 @@ void main() {
         _Pow.#gl.bufferSubData(_Pow.#gl.UNIFORM_BUFFER, 0, uboView);
         _Pow.#gl.bindBuffer(_Pow.#gl.UNIFORM_BUFFER, null);
         const work = new Uint8Array(8);
+        let start;
         const draw = () => {
+          start = performance.now();
           if (_Pow.#gl == null)
             throw new Error("WebGL 2 is required");
           if (_Pow.#query == null)
@@ -3017,14 +3019,18 @@ void main() {
             throw new Error("WebGL 2 is required to check query results");
           if (_Pow.#query == null)
             throw new Error("Query not found");
+          console.log(`checking (${performance.now() - start} ms)`);
           if (_Pow.#gl.getQueryParameter(_Pow.#query, _Pow.#gl.QUERY_RESULT_AVAILABLE)) {
+            console.log(`AVAILABLE (${performance.now() - start} ms)`);
             const anySamplesPassed = _Pow.#gl.getQueryParameter(_Pow.#query, _Pow.#gl.QUERY_RESULT);
             if (anySamplesPassed) {
               readBackResult();
             } else {
+              console.log(`not found (${performance.now() - start} ms)`);
               requestAnimationFrame(draw);
             }
           } else {
+            console.log(`not ready (${performance.now() - start} ms)`);
             requestAnimationFrame(checkQueryResult);
           }
         }
@@ -3034,6 +3040,7 @@ void main() {
           _Pow.#gl.readPixels(0, 0, _Pow.#gl.drawingBufferWidth, _Pow.#gl.drawingBufferHeight, _Pow.#gl.RGBA, _Pow.#gl.UNSIGNED_BYTE, _Pow.#pixels);
           for (let i = 0; i < _Pow.#pixels.length; i += 4) {
             if (_Pow.#pixels[i] !== 0) {
+              console.log(`FOUND (${performance.now() - start} ms)`);
               const hex2 = _Pow.#hexify(work.subarray(4, 8)) + _Pow.#hexify([
                 _Pow.#pixels[i + 2],
                 _Pow.#pixels[i + 3],
@@ -3055,6 +3062,355 @@ void main() {
   }
 });
 
+// dist/lib/workers/powgpu.js
+var PowGpu, powgpu_default;
+var init_powgpu = __esm({
+  "dist/lib/workers/powgpu.js"() {
+    "use strict";
+    init_pool();
+    PowGpu = class _PowGpu extends WorkerInterface {
+      static {
+        _PowGpu.listen();
+      }
+      /**
+      * Calculates proof-of-work as described by the Nano cryptocurrency protocol.
+      *
+      * @param {any[]} data - Array of hashes and minimum thresholds
+      * @returns Promise for proof-of-work attached to original array objects
+      */
+      static async work(data) {
+        return new Promise(async (resolve, reject) => {
+          for (const d of data) {
+            try {
+              d.work = await this.find(d.hash, d.threshold);
+            } catch (err) {
+              reject(err);
+            }
+          }
+          resolve(data);
+        });
+      }
+      /**
+      * Finds a nonce that satisfies the Nano proof-of-work requirements.
+      *
+      * @param {string} hash - Hexadecimal hash of previous block, or public key for new accounts
+      * @param {number} [threshold=0xfffffff8] - Difficulty of proof-of-work calculation
+      */
+      static async find(hash2, threshold = 4294967288) {
+        return new Promise(async (resolve) => {
+          await this.#calculate(hash2, resolve, threshold);
+        });
+      }
+      // WebGPU Compute Shader
+      static #shader = `
+               struct UBO {
+                       blockhash: array<vec4<u32>, 2>,
+                       threshold: u32
+               };
+               @group(0) @binding(0) var<uniform> ubo: UBO;
+
+               struct WORK {
+                       nonce: vec2<u32>,
+                       found: atomic<u32>
+               };
+               @group(0) @binding(1) var<storage, read_write> work: WORK;
+
+               /**
+               * Defined separately from uint v[32] below as the original value is required
+               * to calculate the second uint32 of the digest for threshold comparison
+               */
+               const BLAKE2B_IV32_1: u32 = 0x6A09E667u;
+
+               /**
+               * These are offsets into the input data buffer for each mixing step.
+               * They are multiplied by 2 from the original SIGMA values in
+               * the C reference implementation, which refered to uint64s.
+               */
+               const SIGMA82: array<u32, 192> = array<u32, 192>(
+                       0u,2u,4u,6u,8u,10u,12u,14u,16u,18u,20u,22u,24u,26u,28u,30u,
+                       28u,20u,8u,16u,18u,30u,26u,12u,2u,24u,0u,4u,22u,14u,10u,6u,
+                       22u,16u,24u,0u,10u,4u,30u,26u,20u,28u,6u,12u,14u,2u,18u,8u,
+                       14u,18u,6u,2u,26u,24u,22u,28u,4u,12u,10u,20u,8u,0u,30u,16u,
+                       18u,0u,10u,14u,4u,8u,20u,30u,28u,2u,22u,24u,12u,16u,6u,26u,
+                       4u,24u,12u,20u,0u,22u,16u,6u,8u,26u,14u,10u,30u,28u,2u,18u,
+                       24u,10u,2u,30u,28u,26u,8u,20u,0u,14u,12u,6u,18u,4u,16u,22u,
+                       26u,22u,14u,28u,24u,2u,6u,18u,10u,0u,30u,8u,16u,12u,4u,20u,
+                       12u,30u,28u,18u,22u,6u,0u,16u,24u,4u,26u,14u,2u,8u,20u,10u,
+                       20u,4u,16u,8u,14u,12u,2u,10u,30u,22u,18u,28u,6u,24u,26u,0u,
+                       0u,2u,4u,6u,8u,10u,12u,14u,16u,18u,20u,22u,24u,26u,28u,30u,
+                       28u,20u,8u,16u,18u,30u,26u,12u,2u,24u,0u,4u,22u,14u,10u,6u
+               );
+
+               /**
+               * 64-bit unsigned addition within the compression buffer
+               * Sets v[i,i+1] += b
+               * LSb is the Least-Significant (32) Bits of b
+               * MSb is the Most-Significant (32) Bits of b
+               * If LSb overflows, increment MSb operand
+               */
+               fn add_uint64 (v: ptr<function, array<u32, 32>>, i: u32, LSb: u32, MSb: u32) {
+                       var o0: u32 = (*v)[i] + LSb;
+                       var o1: u32 = (*v)[i+1u] + MSb;
+                       if ((*v)[i] > 0xFFFFFFFFu - LSb) {
+                               o1 = o1 + 1u;
+                       }
+                       (*v)[i] = o0;
+                       (*v)[i+1u] = o1;
+               }
+
+               /**
+               * G Mixing function
+               */
+               fn G (v: ptr<function, array<u32, 32>>, m: ptr<function, array<u32, 16>>, a: u32, b: u32, c: u32, d: u32, ix: u32, iy: u32) {
+                       add_uint64(v, a, (*v)[b], (*v)[b+1u]);
+                       add_uint64(v, a, (*m)[ix], (*m)[ix+1u]);
+
+                       // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated to the right by 32 bits
+                       var xor0: u32 = (*v)[d] ^ (*v)[a];
+                       var xor1: u32 = (*v)[d+1u] ^ (*v)[a+1u];
+                       (*v)[d] = xor1;
+                       (*v)[d+1u] = xor0;
+
+                       add_uint64(v, c, (*v)[d], (*v)[d+1u]);
+
+                       // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 24 bits
+                       xor0 = (*v)[b] ^ (*v)[c];
+                       xor1 = (*v)[b+1u] ^ (*v)[c+1u];
+                       (*v)[b] = (xor0 >> 24u) ^ (xor1 << 8u);
+                       (*v)[b+1u] = (xor1 >> 24u) ^ (xor0 << 8u);
+
+                       add_uint64(v, a, (*v)[b], (*v)[b+1u]);
+                       add_uint64(v, a, (*m)[iy], (*m)[iy+1u]);
+
+                       // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated right by 16 bits
+                       xor0 = (*v)[d] ^ (*v)[a];
+                       xor1 = (*v)[d+1u] ^ (*v)[a+1u];
+                       (*v)[d] = (xor0 >> 16u) ^ (xor1 << 16u);
+                       (*v)[d+1u] = (xor1 >> 16u) ^ (xor0 << 16u);
+
+                       add_uint64(v, c, (*v)[d], (*v)[d+1u]);
+
+                       // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 63 bits
+                       xor0 = (*v)[b] ^ (*v)[c];
+                       xor1 = (*v)[b+1u] ^ (*v)[c+1u];
+                       (*v)[b] = (xor1 >> 31u) ^ (xor0 << 1u);
+                       (*v)[b+1u] = (xor0 >> 31u) ^ (xor1 << 1u);
+               }
+
+               /**
+               * Main compute function
+               *
+               * 8-byte work is split into two 4-byte u32
+               * First 4 bytes will be iterated by shader
+               * Last 4 bytes are defined by index of each thread
+               */
+               @compute @workgroup_size(256)
+               fn main(
+                       @builtin(workgroup_id) workgroup_id: vec3<u32>,
+                       @builtin(local_invocation_id) local_id: vec3<u32>
+               ) {
+                       var id: u32 = ((workgroup_id.x & 0xff) << 24) |
+                                                                               ((workgroup_id.y & 0xff) << 16) |
+                                                                               ((workgroup_id.z & 0xff) << 8) |
+                                                                               (local_id.x & 0xff);
+                       var m: array<u32, 16>;
+                       m[0u] = id;
+                       m[1u] = id;
+                       m[2u] = ubo.blockhash[0u].x;
+                       m[3u] = ubo.blockhash[0u].y;
+                       m[4u] = ubo.blockhash[0u].z;
+                       m[5u] = ubo.blockhash[0u].w;
+                       m[6u] = ubo.blockhash[1u].x;
+                       m[7u] = ubo.blockhash[1u].y;
+                       m[8u] = ubo.blockhash[1u].z;
+                       m[9u] = ubo.blockhash[1u].w;
+
+
+                       /**
+                       * Compression buffer, intialized to 2 instances of the initialization vector
+                       * The following values have been modified from the BLAKE2B_IV:
+                       * OUTLEN is constant 8 bytes
+                       * v[0u] ^= 0x01010000u ^ uint(OUTLEN);
+                       * INLEN is constant 40 bytes: work value (8) + block hash (32)
+                       * v[24u] ^= uint(INLEN);
+                       * It's always the "last" compression at this INLEN
+                       * v[28u] = ~v[28u];
+                       * v[29u] = ~v[29u];
+                       */
+                       var v = array<u32, 32>(
+                               0xF2BDC900u, 0x6A09E667u, 0x84CAA73Bu, 0xBB67AE85u,
+                               0xFE94F82Bu, 0x3C6EF372u, 0x5F1D36F1u, 0xA54FF53Au,
+                               0xADE682D1u, 0x510E527Fu, 0x2B3E6C1Fu, 0x9B05688Cu,
+                               0xFB41BD6Bu, 0x1F83D9ABu, 0x137E2179u, 0x5BE0CD19u,
+                               0xF3BCC908u, 0x6A09E667u, 0x84CAA73Bu, 0xBB67AE85u,
+                               0xFE94F82Bu, 0x3C6EF372u, 0x5F1D36F1u, 0xA54FF53Au,
+                               0xADE682F9u, 0x510E527Fu, 0x2B3E6C1Fu, 0x9B05688Cu,
+                               0x04BE4294u, 0xE07C2654u, 0x137E2179u, 0x5BE0CD19u
+                       );
+
+                       /**
+                       * Iterate and hash until nonce found
+                       */
+                       for (var j: u32 = id; j < id + 1u; j = j + 1u) {
+                               if (atomicLoad(&work.found) != 0u) {
+                                       return;
+                               }
+                               m[0u] = j;
+
+                               // twelve rounds of mixing
+                               for (var i: u32 = 0u; i < 12u; i = i + 1u) {
+                                       G(&v, &m, 0u, 8u, 16u, 24u, SIGMA82[i * 16u + 0u], SIGMA82[i * 16u + 1u]);
+                                       G(&v, &m, 2u, 10u, 18u, 26u, SIGMA82[i * 16u + 2u], SIGMA82[i * 16u + 3u]);
+                                       G(&v, &m, 4u, 12u, 20u, 28u, SIGMA82[i * 16u + 4u], SIGMA82[i * 16u + 5u]);
+                                       G(&v, &m, 6u, 14u, 22u, 30u, SIGMA82[i * 16u + 6u], SIGMA82[i * 16u + 7u]);
+                                       G(&v, &m, 0u, 10u, 20u, 30u, SIGMA82[i * 16u + 8u], SIGMA82[i * 16u + 9u]);
+                                       G(&v, &m, 2u, 12u, 22u, 24u, SIGMA82[i * 16u + 10u], SIGMA82[i * 16u + 11u]);
+                                       G(&v, &m, 4u, 14u, 16u, 26u, SIGMA82[i * 16u + 12u], SIGMA82[i * 16u + 13u]);
+                                       G(&v, &m, 6u, 8u, 18u, 28u, SIGMA82[i * 16u + 14u], SIGMA82[i * 16u + 15u]);
+                               }
+
+                               // Store the result directly into work array
+                               if ((BLAKE2B_IV32_1 ^ v[1u] ^ v[17u]) > ubo.threshold) {
+                                       atomicStore(&work.found, 1u);
+                                       work.nonce.x = id;
+                                       work.nonce.y = j;
+                                       return;
+                               }
+                       }
+
+                       return;
+               }
+       `;
+      // Initialize WebGPU
+      static #device = null;
+      static #gpuBuffer;
+      static #cpuBuffer;
+      static #bindGroupLayout;
+      static #pipeline;
+      static {
+        if (navigator.gpu == null) {
+          throw new Error("WebGPU is not supported in this browser.");
+        }
+        navigator.gpu.requestAdapter().then((adapter) => {
+          if (adapter == null) {
+            throw new Error("WebGPU adapter refused by browser.");
+          }
+          adapter.requestDevice().then((device) => {
+            this.#device = device;
+            this.#gpuBuffer = this.#device.createBuffer({
+              size: 16,
+              usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_DST | GPUBufferUsage.COPY_SRC
+            });
+            this.#cpuBuffer = this.#device.createBuffer({
+              size: 16,
+              usage: GPUBufferUsage.COPY_DST | GPUBufferUsage.MAP_READ
+            });
+            this.#bindGroupLayout = this.#device.createBindGroupLayout({
+              entries: [
+                {
+                  binding: 0,
+                  visibility: GPUShaderStage.COMPUTE,
+                  buffer: {
+                    type: "uniform"
+                  }
+                },
+                {
+                  binding: 1,
+                  visibility: GPUShaderStage.COMPUTE,
+                  buffer: {
+                    type: "storage"
+                  }
+                }
+              ]
+            });
+            this.#pipeline = this.#device.createComputePipeline({
+              layout: this.#device.createPipelineLayout({
+                bindGroupLayouts: [this.#bindGroupLayout]
+              }),
+              compute: {
+                entryPoint: "main",
+                module: this.#device.createShaderModule({
+                  code: this.#shader
+                })
+              }
+            });
+          });
+        }).catch((err) => {
+          throw new Error(err.message);
+        });
+      }
+      static async #calculate(hashHex, callback, threshold) {
+        if (!/^[A-Fa-f0-9]{64}$/.test(hashHex))
+          throw new Error(`Invalid hash ${hashHex}`);
+        if (typeof threshold !== "number")
+          throw new TypeError(`Invalid threshold ${threshold}`);
+        if (_PowGpu.#device == null) {
+          setTimeout(async () => {
+            await this.#calculate(hashHex, callback, threshold);
+          }, 100);
+          return;
+        }
+        const uboView = new DataView(new ArrayBuffer(48));
+        for (let i = 0; i < 64; i += 8) {
+          const uint32 = hashHex.slice(i, i + 8);
+          uboView.setUint32(i / 2, parseInt(uint32, 16));
+        }
+        uboView.setUint32(32, threshold, true);
+        const uboBuffer = _PowGpu.#device.createBuffer({
+          size: uboView.byteLength,
+          usage: GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST
+        });
+        _PowGpu.#device.queue.writeBuffer(uboBuffer, 0, uboView);
+        const bindGroup = _PowGpu.#device.createBindGroup({
+          layout: _PowGpu.#bindGroupLayout,
+          entries: [
+            {
+              binding: 0,
+              resource: {
+                buffer: uboBuffer
+              }
+            },
+            {
+              binding: 1,
+              resource: {
+                buffer: _PowGpu.#gpuBuffer
+              }
+            }
+          ]
+        });
+        const commandEncoder = _PowGpu.#device.createCommandEncoder();
+        const passEncoder = commandEncoder.beginComputePass();
+        passEncoder.setPipeline(_PowGpu.#pipeline);
+        passEncoder.setBindGroup(0, bindGroup);
+        passEncoder.dispatchWorkgroups(256, 256, 256);
+        passEncoder.end();
+        commandEncoder.copyBufferToBuffer(_PowGpu.#gpuBuffer, 0, _PowGpu.#cpuBuffer, 0, 12);
+        _PowGpu.#device.queue.submit([commandEncoder.finish()]);
+        await _PowGpu.#cpuBuffer.mapAsync(GPUMapMode.READ);
+        await _PowGpu.#device.queue.onSubmittedWorkDone();
+        const data = new DataView(_PowGpu.#cpuBuffer.getMappedRange());
+        const nonce = data.getBigUint64(0, true);
+        const found = !!data.getUint32(8);
+        console.log(new Uint32Array(data.buffer));
+        _PowGpu.#cpuBuffer.unmap();
+        console.log(`found: ${found}`);
+        console.log(`nonce: ${nonce}`);
+        if (found) {
+          const hex2 = nonce.toString(16).padStart(16, "0");
+          typeof callback === "function" && callback(hex2);
+          return;
+        } else {
+          console.warn(`PoW ended but 'found' is false for nonce: ${nonce}`);
+        }
+      }
+    };
+    powgpu_default = `
+       const WorkerInterface = ${WorkerInterface}
+       const PowGpu = ${PowGpu}
+`;
+  }
+});
+
 // dist/lib/workers.js
 var init_workers = __esm({
   "dist/lib/workers.js"() {
@@ -3062,6 +3418,7 @@ var init_workers = __esm({
     init_bip44_ckd();
     init_nano_nacl();
     init_powgl();
+    init_powgpu();
   }
 });
 
@@ -9769,7 +10126,7 @@ var init_block = __esm({
     init_pool();
     init_workers();
     Block = class _Block {
-      static #pool = new Pool(powgl_default);
+      static #pool = new Pool(powgpu_default);
       account;
       type = "state";
       constructor(account) {

diff --git a/global.min.js.map b/global.min.js.map
index 4b2080d88b32bf18369cfddf5328f6ced8e4ac18..fd2dc6d0ffbdc468f171264719e5d6255b532d3e 100644 (file)
--- a/global.min.js.map
+++ b/global.min.js.map
@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["lib/blake2b.js", "lib/constants.js", "lib/convert.js", "lib/rpc.js", "lib/entropy.js", "lib/safe.js", "lib/pool.js", "lib/workers/nano-nacl.js", "lib/account.js", "lib/workers/bip44-ckd.js", "lib/workers/powgl.js", "lib/workers.js", "../node_modules/events/events.js", "../node_modules/@ledgerhq/errors/src/helpers.ts", "../node_modules/@ledgerhq/errors/src/index.ts", "../node_modules/@ledgerhq/logs/src/index.ts", "../node_modules/@ledgerhq/hw-transport/src/Transport.ts", "../node_modules/semver/internal/constants.js", "../node_modules/semver/internal/debug.js", "../node_modules/semver/internal/re.js", "../node_modules/semver/internal/parse-options.js", "../node_modules/semver/internal/identifiers.js", "../node_modules/semver/classes/semver.js", "../node_modules/semver/functions/parse.js", "../node_modules/semver/functions/valid.js", "../node_modules/semver/functions/clean.js", "../node_modules/semver/functions/inc.js", "../node_modules/semver/functions/diff.js", "../node_modules/semver/functions/major.js", "../node_modules/semver/functions/minor.js", "../node_modules/semver/functions/patch.js", "../node_modules/semver/functions/prerelease.js", "../node_modules/semver/functions/compare.js", "../node_modules/semver/functions/rcompare.js", "../node_modules/semver/functions/compare-loose.js", "../node_modules/semver/functions/compare-build.js", "../node_modules/semver/functions/sort.js", "../node_modules/semver/functions/rsort.js", "../node_modules/semver/functions/gt.js", "../node_modules/semver/functions/lt.js", "../node_modules/semver/functions/eq.js", "../node_modules/semver/functions/neq.js", "../node_modules/semver/functions/gte.js", "../node_modules/semver/functions/lte.js", "../node_modules/semver/functions/cmp.js", "../node_modules/semver/functions/coerce.js", "../node_modules/semver/internal/lrucache.js", "../node_modules/semver/classes/range.js", "../node_modules/semver/classes/comparator.js", "../node_modules/semver/functions/satisfies.js", "../node_modules/semver/ranges/to-comparators.js", "../node_modules/semver/ranges/max-satisfying.js", "../node_modules/semver/ranges/min-satisfying.js", "../node_modules/semver/ranges/min-version.js", "../node_modules/semver/ranges/valid.js", "../node_modules/semver/ranges/outside.js", "../node_modules/semver/ranges/gtr.js", "../node_modules/semver/ranges/ltr.js", "../node_modules/semver/ranges/intersects.js", "../node_modules/semver/ranges/simplify.js", "../node_modules/semver/ranges/subset.js", "../node_modules/semver/index.js", "../node_modules/@ledgerhq/devices/src/index.ts", "../node_modules/tslib/tslib.es6.mjs", "../node_modules/rxjs/src/internal/util/isFunction.ts", "../node_modules/rxjs/src/internal/util/createErrorClass.ts", "../node_modules/rxjs/src/internal/util/UnsubscriptionError.ts", "../node_modules/rxjs/src/internal/util/arrRemove.ts", "../node_modules/rxjs/src/internal/Subscription.ts", "../node_modules/rxjs/src/internal/config.ts", "../node_modules/rxjs/src/internal/scheduler/timeoutProvider.ts", "../node_modules/rxjs/src/internal/util/reportUnhandledError.ts", "../node_modules/rxjs/src/internal/util/noop.ts", "../node_modules/rxjs/src/internal/NotificationFactories.ts", "../node_modules/rxjs/src/internal/util/errorContext.ts", "../node_modules/rxjs/src/internal/Subscriber.ts", "../node_modules/rxjs/src/internal/symbol/observable.ts", "../node_modules/rxjs/src/internal/util/identity.ts", "../node_modules/rxjs/src/internal/util/pipe.ts", "../node_modules/rxjs/src/internal/Observable.ts", "../node_modules/rxjs/src/internal/util/lift.ts", "../node_modules/rxjs/src/internal/operators/OperatorSubscriber.ts", "../node_modules/rxjs/src/internal/util/ObjectUnsubscribedError.ts", "../node_modules/rxjs/src/internal/Subject.ts", "../node_modules/rxjs/src/internal/scheduler/dateTimestampProvider.ts", "../node_modules/rxjs/src/internal/ReplaySubject.ts", "../node_modules/rxjs/src/internal/observable/empty.ts", "../node_modules/rxjs/src/internal/util/isScheduler.ts", "../node_modules/rxjs/src/internal/util/args.ts", "../node_modules/rxjs/src/internal/util/isArrayLike.ts", "../node_modules/rxjs/src/internal/util/isPromise.ts", "../node_modules/rxjs/src/internal/util/isInteropObservable.ts", "../node_modules/rxjs/src/internal/util/isAsyncIterable.ts", "../node_modules/rxjs/src/internal/util/throwUnobservableError.ts", "../node_modules/rxjs/src/internal/symbol/iterator.ts", "../node_modules/rxjs/src/internal/util/isIterable.ts", "../node_modules/rxjs/src/internal/util/isReadableStreamLike.ts", "../node_modules/rxjs/src/internal/observable/innerFrom.ts", "../node_modules/rxjs/src/internal/util/executeSchedule.ts", "../node_modules/rxjs/src/internal/operators/observeOn.ts", "../node_modules/rxjs/src/internal/operators/subscribeOn.ts", "../node_modules/rxjs/src/internal/scheduled/scheduleObservable.ts", "../node_modules/rxjs/src/internal/scheduled/schedulePromise.ts", "../node_modules/rxjs/src/internal/scheduled/scheduleArray.ts", "../node_modules/rxjs/src/internal/scheduled/scheduleIterable.ts", "../node_modules/rxjs/src/internal/scheduled/scheduleAsyncIterable.ts", "../node_modules/rxjs/src/internal/scheduled/scheduleReadableStreamLike.ts", "../node_modules/rxjs/src/internal/scheduled/scheduled.ts", "../node_modules/rxjs/src/internal/observable/from.ts", "../node_modules/rxjs/src/internal/util/EmptyError.ts", "../node_modules/rxjs/src/internal/firstValueFrom.ts", "../node_modules/rxjs/src/internal/operators/map.ts", "../node_modules/rxjs/src/internal/operators/mergeInternals.ts", "../node_modules/rxjs/src/internal/operators/mergeMap.ts", "../node_modules/rxjs/src/internal/operators/mergeAll.ts", "../node_modules/rxjs/src/internal/observable/defer.ts", "../node_modules/rxjs/src/internal/observable/merge.ts", "../node_modules/rxjs/src/internal/operators/filter.ts", "../node_modules/rxjs/dist/esm5/internal/types.js", "../node_modules/rxjs/src/internal/operators/defaultIfEmpty.ts", "../node_modules/rxjs/src/internal/operators/take.ts", "../node_modules/rxjs/src/internal/operators/ignoreElements.ts", "../node_modules/rxjs/src/internal/operators/throwIfEmpty.ts", "../node_modules/rxjs/src/internal/operators/first.ts", "../node_modules/rxjs/src/internal/operators/share.ts", "../node_modules/rxjs/src/internal/operators/takeUntil.ts", "../node_modules/rxjs/src/internal/operators/tap.ts", "../node_modules/rxjs/src/index.ts", "../node_modules/@ledgerhq/devices/src/ble/sendAPDU.ts", "../node_modules/@ledgerhq/devices/src/ble/receiveAPDU.ts", "../node_modules/rxjs/src/operators/index.ts", "../node_modules/@ledgerhq/hw-transport-web-ble/src/monitorCharacteristic.ts", "../node_modules/@ledgerhq/hw-transport-web-ble/src/TransportWebBLE.ts", "../node_modules/@ledgerhq/devices/src/hid-framing.ts", "../node_modules/@ledgerhq/hw-transport-webusb/src/webusb.ts", "../node_modules/@ledgerhq/hw-transport-webusb/src/TransportWebUSB.ts", "../node_modules/@ledgerhq/hw-transport-webhid/src/TransportWebHID.ts", "lib/ledger.js", "lib/block.js", "lib/tools.js", "main.js", "lib/rolodex.js", "lib/wallet.js", "lib/bip39-wordlist.js", "lib/bip39-mnemonic.js", "global.js"],
-  "sourcesContent": ["// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n/**\n* Implementation derived from blake2b@2.1.4. Copyright 2017 Emil Bay\n* <github@tixz.dk> (https://github.com/emilbayes/blake2b). See LICENSES/ISC.txt\n*\n* Modified to eliminate dependencies, port to TypeScript, and embed in web\n* workers.\n*\n* Original source commit: https://github.com/emilbayes/blake2b/blob/1f63e02e3f226642959506cdaa67c8819ff145cd/index.js\n*/\nexport class Blake2b {\n    static BYTES_MIN = 1;\n    static BYTES_MAX = 64;\n    static KEYBYTES_MIN = 16;\n    static KEYBYTES_MAX = 64;\n    static SALTBYTES = 16;\n    static PERSONALBYTES = 16;\n    // Initialization Vector\n    static BLAKE2B_IV32 = new Uint32Array([\n        0xF3BCC908, 0x6A09E667, 0x84CAA73B, 0xBB67AE85,\n        0xFE94F82B, 0x3C6EF372, 0x5F1D36F1, 0xA54FF53A,\n        0xADE682D1, 0x510E527F, 0x2B3E6C1F, 0x9B05688C,\n        0xFB41BD6B, 0x1F83D9AB, 0x137E2179, 0x5BE0CD19\n    ]);\n    static SIGMA8 = [\n        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n        14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,\n        11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,\n        7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,\n        9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,\n        2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,\n        12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11,\n        13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10,\n        6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5,\n        10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0,\n        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n        14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3\n    ];\n    /**\n    * These are offsets into a uint64 buffer.\n    * Multiply them all by 2 to make them offsets into a uint32 buffer,\n    * because this is Javascript and we don't have uint64s\n    */\n    static SIGMA82 = new Uint8Array(this.SIGMA8.map(x => x * 2));\n    // reusable parameter_block\n    static parameter_block = new Uint8Array([\n        0, 0, 0, 0, //  0: outlen, keylen, fanout, depth\n        0, 0, 0, 0, //  4: leaf length, sequential mode\n        0, 0, 0, 0, //  8: node offset\n        0, 0, 0, 0, // 12: node offset\n        0, 0, 0, 0, // 16: node depth, inner length, rfu\n        0, 0, 0, 0, // 20: rfu\n        0, 0, 0, 0, // 24: rfu\n        0, 0, 0, 0, // 28: rfu\n        0, 0, 0, 0, // 32: salt\n        0, 0, 0, 0, // 36: salt\n        0, 0, 0, 0, // 40: salt\n        0, 0, 0, 0, // 44: salt\n        0, 0, 0, 0, // 48: personal\n        0, 0, 0, 0, // 52: personal\n        0, 0, 0, 0, // 56: personal\n        0, 0, 0, 0 // 60: personal\n    ]);\n    static v = new Uint32Array(32);\n    static m = new Uint32Array(32);\n    /**\n    * 64-bit unsigned addition\n    * Sets v[a,a+1] += v[b,b+1]\n    * v should be a Uint32Array\n    */\n    static ADD64AA(v, a, b) {\n        var o0 = v[a] + v[b];\n        var o1 = v[a + 1] + v[b + 1];\n        if (o0 >= 0x100000000) {\n            o1++;\n        }\n        v[a] = o0;\n        v[a + 1] = o1;\n    }\n    /**\n    * 64-bit unsigned addition\n    * Sets v[a,a+1] += b\n    * b0 is the low 32 bits of b, b1 represents the high 32 bits\n    */\n    static ADD64AC(v, a, b0, b1) {\n        var o0 = v[a] + b0;\n        if (b0 < 0) {\n            o0 += 0x100000000;\n        }\n        var o1 = v[a + 1] + b1;\n        if (o0 >= 0x100000000) {\n            o1++;\n        }\n        v[a] = o0;\n        v[a + 1] = o1;\n    }\n    // Little-endian byte access\n    static B2B_GET32(arr, i) {\n        return (arr[i] ^\n            (arr[i + 1] << 8) ^\n            (arr[i + 2] << 16) ^\n            (arr[i + 3] << 24));\n    }\n    /**\n    * G Mixing function\n    * The ROTRs are inlined for speed\n    */\n    static B2B_G(a, b, c, d, ix, iy) {\n        var x0 = Blake2b.m[ix];\n        var x1 = Blake2b.m[ix + 1];\n        var y0 = Blake2b.m[iy];\n        var y1 = Blake2b.m[iy + 1];\n        Blake2b.ADD64AA(Blake2b.v, a, b); // v[a,a+1] += v[b,b+1] ... in JS we must store a uint64 as two uint32s\n        Blake2b.ADD64AC(Blake2b.v, a, x0, x1); // v[a, a+1] += x ... x0 is the low 32 bits of x, x1 is the high 32 bits\n        // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated to the right by 32 bits\n        var xor0 = Blake2b.v[d] ^ Blake2b.v[a];\n        var xor1 = Blake2b.v[d + 1] ^ Blake2b.v[a + 1];\n        Blake2b.v[d] = xor1;\n        Blake2b.v[d + 1] = xor0;\n        Blake2b.ADD64AA(Blake2b.v, c, d);\n        // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 24 bits\n        xor0 = Blake2b.v[b] ^ Blake2b.v[c];\n        xor1 = Blake2b.v[b + 1] ^ Blake2b.v[c + 1];\n        Blake2b.v[b] = (xor0 >>> 24) ^ (xor1 << 8);\n        Blake2b.v[b + 1] = (xor1 >>> 24) ^ (xor0 << 8);\n        Blake2b.ADD64AA(Blake2b.v, a, b);\n        Blake2b.ADD64AC(Blake2b.v, a, y0, y1);\n        // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated right by 16 bits\n        xor0 = Blake2b.v[d] ^ Blake2b.v[a];\n        xor1 = Blake2b.v[d + 1] ^ Blake2b.v[a + 1];\n        Blake2b.v[d] = (xor0 >>> 16) ^ (xor1 << 16);\n        Blake2b.v[d + 1] = (xor1 >>> 16) ^ (xor0 << 16);\n        Blake2b.ADD64AA(Blake2b.v, c, d);\n        // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 63 bits\n        xor0 = Blake2b.v[b] ^ Blake2b.v[c];\n        xor1 = Blake2b.v[b + 1] ^ Blake2b.v[c + 1];\n        Blake2b.v[b] = (xor1 >>> 31) ^ (xor0 << 1);\n        Blake2b.v[b + 1] = (xor0 >>> 31) ^ (xor1 << 1);\n    }\n    /**\n    * Compression function. 'last' flag indicates last block.\n    * Note we're representing 16 uint64s as 32 uint32s\n    */\n    static blake2bCompress(ctx, last) {\n        let i = 0;\n        // init work variables\n        for (i = 0; i < 16; i++) {\n            Blake2b.v[i] = ctx.h[i];\n            Blake2b.v[i + 16] = Blake2b.BLAKE2B_IV32[i];\n        }\n        // low 64 bits of offset\n        Blake2b.v[24] = Blake2b.v[24] ^ ctx.t;\n        Blake2b.v[25] = Blake2b.v[25] ^ (ctx.t / 0x100000000);\n        // high 64 bits not supported, offset may not be higher than 2**53-1\n        // last block flag set ?\n        if (last) {\n            Blake2b.v[28] = ~Blake2b.v[28];\n            Blake2b.v[29] = ~Blake2b.v[29];\n        }\n        // get little-endian words\n        for (i = 0; i < 32; i++) {\n            Blake2b.m[i] = Blake2b.B2B_GET32(ctx.b, 4 * i);\n        }\n        // twelve rounds of mixing\n        for (i = 0; i < 12; i++) {\n            Blake2b.B2B_G(0, 8, 16, 24, Blake2b.SIGMA82[i * 16 + 0], Blake2b.SIGMA82[i * 16 + 1]);\n            Blake2b.B2B_G(2, 10, 18, 26, Blake2b.SIGMA82[i * 16 + 2], Blake2b.SIGMA82[i * 16 + 3]);\n            Blake2b.B2B_G(4, 12, 20, 28, Blake2b.SIGMA82[i * 16 + 4], Blake2b.SIGMA82[i * 16 + 5]);\n            Blake2b.B2B_G(6, 14, 22, 30, Blake2b.SIGMA82[i * 16 + 6], Blake2b.SIGMA82[i * 16 + 7]);\n            Blake2b.B2B_G(0, 10, 20, 30, Blake2b.SIGMA82[i * 16 + 8], Blake2b.SIGMA82[i * 16 + 9]);\n            Blake2b.B2B_G(2, 12, 22, 24, Blake2b.SIGMA82[i * 16 + 10], Blake2b.SIGMA82[i * 16 + 11]);\n            Blake2b.B2B_G(4, 14, 16, 26, Blake2b.SIGMA82[i * 16 + 12], Blake2b.SIGMA82[i * 16 + 13]);\n            Blake2b.B2B_G(6, 8, 18, 28, Blake2b.SIGMA82[i * 16 + 14], Blake2b.SIGMA82[i * 16 + 15]);\n        }\n        for (i = 0; i < 16; i++) {\n            ctx.h[i] = ctx.h[i] ^ Blake2b.v[i] ^ Blake2b.v[i + 16];\n        }\n    }\n    /**\n    * Updates a BLAKE2b streaming hash\n    * Requires hash context and Uint8Array (byte array)\n    */\n    static blake2bUpdate(ctx, input) {\n        for (var i = 0; i < input.length; i++) {\n            if (ctx.c === 128) { // buffer full ?\n                ctx.t += ctx.c; // add counters\n                Blake2b.blake2bCompress(ctx, false); // compress (not last)\n                ctx.c = 0; // counter to zero\n            }\n            ctx.b[ctx.c++] = input[i];\n        }\n    }\n    /**\n    * Completes a BLAKE2b streaming hash\n    * Returns a Uint8Array containing the message digest\n    */\n    static blake2bFinal(ctx, out) {\n        ctx.t += ctx.c; // mark last block offset\n        while (ctx.c < 128) { // fill up with zeros\n            ctx.b[ctx.c++] = 0;\n        }\n        Blake2b.blake2bCompress(ctx, true); // final block flag = 1\n        for (var i = 0; i < ctx.outlen; i++) {\n            out[i] = ctx.h[i >> 2] >> (8 * (i & 3));\n        }\n        return out;\n    }\n    static hexSlice(buf) {\n        let str = '';\n        for (let i = 0; i < buf.length; i++)\n            str += Blake2b.toHex(buf[i]);\n        return str;\n    }\n    static toHex(n) {\n        if (typeof n !== 'number')\n            throw new TypeError(`expected number to convert to hex; received ${typeof n}`);\n        if (n < 0 || n > 255)\n            throw new RangeError(`expected byte value 0-255; received ${n}`);\n        return n.toString(16).padStart(2, '0');\n    }\n    b;\n    h;\n    t;\n    c;\n    outlen;\n    /**\n    * Creates a BLAKE2b hashing context\n    * Requires an output length between 1 and 64 bytes\n    * Takes an optional Uint8Array key\n    */\n    constructor(outlen, key, salt, personal, noAssert) {\n        if (noAssert !== true) {\n            if (outlen < Blake2b.BYTES_MIN)\n                throw new RangeError(`expected outlen >= ${Blake2b.BYTES_MIN}; actual ${outlen}`);\n            if (outlen > Blake2b.BYTES_MAX)\n                throw new RangeError(`expectd outlen <= ${Blake2b.BYTES_MAX}; actual ${outlen}`);\n            if (key != null) {\n                if (!(key instanceof Uint8Array))\n                    throw new TypeError(`key must be Uint8Array or Buffer`);\n                if (key.length < Blake2b.KEYBYTES_MIN)\n                    throw new RangeError(`expected key >= ${Blake2b.KEYBYTES_MIN}; actual ${key.length}`);\n                if (key.length > Blake2b.KEYBYTES_MAX)\n                    throw new RangeError(`expected key <= ${Blake2b.KEYBYTES_MAX}; actual ${key.length}`);\n            }\n            if (salt != null) {\n                if (!(salt instanceof Uint8Array))\n                    throw new TypeError(`salt must be Uint8Array or Buffer`);\n                if (salt.length !== Blake2b.SALTBYTES)\n                    throw new RangeError(`expected salt ${Blake2b.SALTBYTES} bytes; actual ${salt.length} bytes`);\n            }\n            if (personal != null) {\n                if (!(personal instanceof Uint8Array))\n                    throw new TypeError(`personal must be Uint8Array or Buffer`);\n                if (personal.length !== Blake2b.PERSONALBYTES)\n                    throw new RangeError(`expected personal ${Blake2b.PERSONALBYTES} bytes; actual ${personal.length} bytes`);\n            }\n        }\n        this.b = new Uint8Array(128);\n        this.h = new Uint32Array(16);\n        this.t = 0; // input count\n        this.c = 0; // pointer within buffer\n        this.outlen = outlen; // output length in bytes\n        // zero out parameter_block before usage\n        Blake2b.parameter_block.fill(0);\n        // state, 'param block'\n        Blake2b.parameter_block[0] = outlen;\n        if (key)\n            Blake2b.parameter_block[1] = key.length;\n        Blake2b.parameter_block[2] = 1; // fanout\n        Blake2b.parameter_block[3] = 1; // depth\n        if (salt)\n            Blake2b.parameter_block.set(salt, 32);\n        if (personal)\n            Blake2b.parameter_block.set(personal, 48);\n        // initialize hash state\n        for (var i = 0; i < 16; i++) {\n            this.h[i] = Blake2b.BLAKE2B_IV32[i] ^ Blake2b.B2B_GET32(Blake2b.parameter_block, i * 4);\n        }\n        // key the hash, if applicable\n        if (key) {\n            Blake2b.blake2bUpdate(this, key);\n            // at the end\n            this.c = 128;\n        }\n    }\n    update(input) {\n        if (!(input instanceof Uint8Array))\n            throw new TypeError(`input must be Uint8Array or Buffer`);\n        Blake2b.blake2bUpdate(this, input);\n        return this;\n    }\n    digest(out) {\n        const buf = (!out || out === 'binary' || out === 'hex') ? new Uint8Array(this.outlen) : out;\n        if (!(buf instanceof Uint8Array))\n            throw new TypeError(`out must be \"binary\", \"hex\", Uint8Array, or Buffer`);\n        if (buf.length < this.outlen)\n            throw new RangeError(`out must have at least outlen bytes of space`);\n        Blake2b.blake2bFinal(this, buf);\n        if (out === 'hex')\n            return Blake2b.hexSlice(buf);\n        return buf;\n    }\n}\nexport default Blake2b.toString();\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nexport const ACCOUNT_KEY_LENGTH = 64;\nexport const ADDRESS_GAP = 20;\nexport const ALPHABET = '13456789abcdefghijkmnopqrstuwxyz';\nexport const BIP39_ITERATIONS = 2048;\nexport const BIP44_PURPOSE = 44;\nexport const BIP44_COIN_NANO = 165;\nexport const BURN_ADDRESS = 'nano_1111111111111111111111111111111111111111111111111111hifc8npp';\nexport const HARDENED_OFFSET = 0x80000000;\nexport const NONCE_LENGTH = 24;\nexport const PREAMBLE = '0000000000000000000000000000000000000000000000000000000000000006';\nexport const PREFIX = 'nano_';\nexport const PREFIX_LEGACY = 'xrb_';\nexport const SEED_LENGTH_BIP44 = 128;\nexport const SEED_LENGTH_BLAKE2B = 64;\nexport const SLIP10_ED25519 = 'ed25519 seed';\nexport const THRESHOLD_RECEIVE = 0xfffffe00;\nexport const THRESHOLD_SEND = 0xfffffff8;\nexport const XNO = '\u04FE';\nexport const LEDGER_STATUS_CODES = Object.freeze({\n    0x6700: 'INCORRECT_LENGTH',\n    0x670a: 'NO_APPLICATION_SPECIFIED',\n    0x6807: 'APPLICATION_NOT_INSTALLED',\n    0x6d00: 'APPLICATION_ALREADY_LAUNCHED',\n    0x6982: 'SECURITY_STATUS_NOT_SATISFIED',\n    0x6985: 'CONDITIONS_OF_USE_NOT_SATISFIED',\n    0x6a81: 'INVALID_SIGNATURE',\n    0x6a82: 'CACHE_MISS',\n    0x6b00: 'INCORRECT_PARAMETER',\n    0x6e01: 'TRANSPORT_STATUS_ERROR',\n    0x9000: 'OK'\n});\nexport const UNITS = Object.freeze({\n    RAW: 0,\n    RAI: 24,\n    NYANO: 24,\n    KRAI: 27,\n    PICO: 27,\n    MRAI: 30,\n    NANO: 30,\n    KNANO: 33,\n    MNANO: 36\n});\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { ALPHABET } from \"./constants.js\";\nexport const base32 = {\n    /**\n    * Converts a base32 string to a Uint8Array of bytes.\n    *\n    * @param {string} base32 - String to convert\n    * @returns {Uint8Array} Byte array representation of the input string\n    */\n    toBytes(base32) {\n        const leftover = (base32.length * 5) % 8;\n        const offset = leftover === 0\n            ? 0\n            : 8 - leftover;\n        let bits = 0;\n        let value = 0;\n        let index = 0;\n        let output = new Uint8Array(Math.ceil((base32.length * 5) / 8));\n        for (let i = 0; i < base32.length; i++) {\n            value = (value << 5) | ALPHABET.indexOf(base32[i]);\n            bits += 5;\n            if (bits >= 8) {\n                output[index++] = (value >>> (bits + offset - 8)) & 255;\n                bits -= 8;\n            }\n        }\n        if (bits > 0) {\n            output[index++] = (value << (bits + offset - 8)) & 255;\n        }\n        if (leftover !== 0) {\n            output = output.slice(1);\n        }\n        return output;\n    },\n    /**\n    * Converts a base32 string to a hexadecimal string.\n    *\n    * @param {string} base32 - String to convert\n    * @returns {string} Hexadecimal representation of the input base32\n    */\n    toHex(base32) {\n        return bytes.toHex(this.toBytes(base32));\n    }\n};\nexport const bin = {\n    /**\n    * Convert a binary string to a Uint8Array of bytes.\n    *\n    * @param {string} bin - String to convert\n    * @returns {Uint8Array} Byte array representation of the input string\n    */\n    toBytes(bin) {\n        const bytes = [];\n        while (bin.length > 0) {\n            const bits = bin.substring(0, 8);\n            bytes.push(parseInt(bits, 2));\n            bin = bin.substring(8);\n        }\n        return new Uint8Array(bytes);\n    },\n    /**\n    * Convert a binary string to a hexadecimal string.\n    *\n    * @param {string} bin - String to convert\n    * @returns {string} Hexadecimal string representation of the input binary\n    */\n    toHex(bin) {\n        return parseInt(bin, 2).toString(16);\n    }\n};\nexport const buffer = {\n    /**\n    * Converts an ArrayBuffer to a base32 string.\n    *\n    * @param {ArrayBuffer} buffer - Buffer to convert\n    * @returns {string} Base32 string representation of the input buffer\n    */\n    toBase32(buffer) {\n        return bytes.toBase32(new Uint8Array(buffer));\n    },\n    /**\n    * Converts an ArrayBuffer to a binary string.\n    *\n    * @param {ArrayBuffer} buffer - Buffer to convert\n    * @returns {string} Binary string representation of the input buffer\n    */\n    toBin(buffer) {\n        return bytes.toBin(new Uint8Array(buffer));\n    },\n    /**\n    * Sums an ArrayBuffer to a decimal integer. If the result is larger than\n    * Number.MAX_SAFE_INTEGER, it will be returned as a bigint.\n    *\n    * @param {ArrayBuffer} buffer - Buffer to convert\n    * @returns {bigint|number} Decimal sum of the literal buffer values\n    */\n    toDec(buffer) {\n        return bytes.toDec(new Uint8Array(buffer));\n    },\n    /**\n    * Converts an ArrayBuffer to a hexadecimal string.\n    *\n    * @param {ArrayBuffer} buffer - Buffer to convert\n    * @returns {string} Hexadecimal string representation of the input buffer\n    */\n    toHex(buffer) {\n        return bytes.toHex(new Uint8Array(buffer));\n    },\n    /**\n    * Converts an ArrayBuffer to a UTF-8 text string.\n    *\n    * @param {ArrayBuffer} buffer - Buffer to convert\n    * @returns {string} UTF-8 encoded text string\n    */\n    toUtf8(buffer) {\n        return bytes.toUtf8(new Uint8Array(buffer));\n    }\n};\nexport const bytes = {\n    /**\n    * Converts a Uint8Aarray of bytes to a base32 string.\n    *\n    * @param {Uint8Array} bytes - Byte array to convert\n    * @returns {string} Base32 string representation of the input bytes\n    */\n    toBase32(bytes) {\n        const leftover = (bytes.length * 8) % 5;\n        const offset = leftover === 0\n            ? 0\n            : 5 - leftover;\n        let value = 0;\n        let output = '';\n        let bits = 0;\n        for (let i = 0; i < bytes.length; i++) {\n            value = (value << 8) | bytes[i];\n            bits += 8;\n            while (bits >= 5) {\n                output += ALPHABET[(value >>> (bits + offset - 5)) & 31];\n                bits -= 5;\n            }\n        }\n        if (bits > 0) {\n            output += ALPHABET[(value << (5 - (bits + offset))) & 31];\n        }\n        return output;\n    },\n    /**\n    * Convert a Uint8Array of bytes to a binary string.\n    *\n    * @param {Uint8Array} bytes - Byte array to convert\n    * @returns {string} Binary string representation of the input value\n    */\n    toBin(bytes) {\n        return [...bytes].map(b => b.toString(2).padStart(8, '0')).join('');\n    },\n    /**\n    * Sums an array of bytes to a decimal integer. If the result is larger than\n    * Number.MAX_SAFE_INTEGER, it will be returned as a bigint.\n    *\n    * @param {Uint8Array} bytes - Byte array to convert\n    * @returns {bigint|number} Decimal sum of the literal byte values\n    */\n    toDec(bytes) {\n        const integers = [];\n        bytes.reverse().forEach(b => integers.push(BigInt(b)));\n        let decimal = 0n;\n        for (let i = 0; i < integers.length; i++) {\n            decimal += integers[i] << BigInt(i * 8);\n        }\n        if (decimal > 9007199254740991n) {\n            return decimal;\n        }\n        else {\n            return Number(decimal);\n        }\n    },\n    /**\n    * Converts a Uint8Array of bytes to a hexadecimal string.\n    *\n    * @param {Uint8Array} bytes - Byte array to convert\n    * @returns {string} Hexadecimal string representation of the input bytes\n    */\n    toHex(bytes) {\n        const byteArray = [...bytes].map(byte => byte.toString(16).padStart(2, '0'));\n        return byteArray.join('').toUpperCase();\n    },\n    /**\n    * Converts a Uint8Array of bytes to a UTF-8 text string.\n    *\n    * @param {Uint8Array} bytes - Byte array to convert\n    * @returns {string} UTF-8 encoded text string\n    */\n    toUtf8(bytes) {\n        return new TextDecoder().decode(bytes);\n    }\n};\nexport const dec = {\n    /**\n    * Convert a decimal integer to a binary string.\n    *\n    * @param {bigint|number|string} decimal - Integer to convert\n    * @param {number} [padding=0] - Minimum length of the resulting string which will be padded as necessary with starting zeroes\n    * @returns {string} Binary string representation of the input decimal\n    */\n    toBin(decimal, padding = 0) {\n        if (typeof padding !== 'number') {\n            throw new TypeError('Invalid padding');\n        }\n        try {\n            return BigInt(decimal)\n                .toString(2)\n                .padStart(padding, '0');\n        }\n        catch (err) {\n            throw new RangeError('Invalid decimal integer');\n        }\n    },\n    /**\n    * Convert a decimal integer to a Uint8Array of bytes. Fractional part is truncated.\n    *\n    * @param {bigint|number|string} decimal - Integer to convert\n    * @param {number} [padding=0] - Minimum length of the resulting array which will be padded as necessary with starting 0x00 bytes\n    * @returns {Uint8Array} Byte array representation of the input decimal\n    */\n    toBytes(decimal, padding = 0) {\n        if (typeof padding !== 'number') {\n            throw new TypeError('Invalid padding');\n        }\n        let integer = BigInt(decimal);\n        const bytes = [];\n        while (integer > 0) {\n            const lsb = BigInt.asUintN(8, integer);\n            bytes.push(Number(lsb));\n            integer >>= 8n;\n        }\n        const result = new Uint8Array(Math.max(padding, bytes.length));\n        result.set(bytes);\n        return (result.reverse());\n    },\n    /**\n    * Convert a decimal integer to a hexadecimal string.\n    *\n    * @param {(bigint|number|string)} decimal - Integer to convert\n    * @param {number} [padding=0] - Minimum length of the resulting string which will be padded as necessary with starting zeroes\n    * @returns {string} Hexadecimal string representation of the input decimal\n    */\n    toHex(decimal, padding = 0) {\n        if (typeof padding !== 'number') {\n            throw new TypeError('Invalid padding');\n        }\n        try {\n            return BigInt(decimal)\n                .toString(16)\n                .padStart(padding, '0')\n                .toUpperCase();\n        }\n        catch (err) {\n            throw new RangeError('Invalid decimal integer');\n        }\n    }\n};\nexport const hex = {\n    /**\n    * Convert a hexadecimal string to a binary string.\n    *\n    * @param {string} hex - Hexadecimal number string to convert\n    * @returns {string} Binary string representation of the input value\n    */\n    toBin(hex) {\n        return [...hex].map(c => dec.toBin(parseInt(c, 16), 4)).join('');\n    },\n    /**\n    * Convert a hexadecimal string to a Uint8Array of bytes.\n    *\n    * @param {string} hex - Hexadecimal number string to convert\n    * @param {number} [padding=0] - Minimum length of the resulting array which will be padded as necessary with starting 0x00 bytes\n    * @returns {Uint8Array} Byte array representation of the input value\n    */\n    toBytes(hex, padding = 0) {\n        if (typeof padding !== 'number') {\n            throw new TypeError('Invalid padding when converting hex to bytes');\n        }\n        const hexArray = hex.match(/.{1,2}/g);\n        if (!/^[0-9a-f]+$/i.test(hex) || hexArray == null) {\n            console.warn('Invalid hex string when converting to bytes');\n            return new Uint8Array();\n        }\n        else {\n            const bytes = Uint8Array.from(hexArray.map(byte => parseInt(byte, 16)));\n            const result = new Uint8Array(Math.max(padding, bytes.length));\n            result.set(bytes.reverse());\n            return result.reverse();\n        }\n    }\n};\nexport const utf8 = {\n    /**\n    * Convert a UTF-8 text string to a Uint8Array of bytes.\n    *\n    * @param {string} utf8 - String to convert\n    * @returns {Uint8Array} Byte array representation of the input string\n    */\n    toBytes(utf8) {\n        return new TextEncoder().encode(utf8);\n    },\n    /**\n    * Convert a string to a hexadecimal representation\n    *\n    * @param {string} utf8 - String to convert\n    * @returns {string} Hexadecimal representation of the input string\n    */\n    toHex(utf8) {\n        return bytes.toHex(this.toBytes(utf8));\n    }\n};\nexport default { base32, bin, bytes, dec, hex, utf8 };\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n/**\n* Represents a Nano network node. It primarily consists of a URL which will\n* accept RPC calls, and an optional API key header construction can be passed if\n* required by the node. Once instantiated, the Rpc object can be used to call\n* any action supported by the Nano protocol. The URL protocol must be HTTPS; any\n* other value will be changed automatically.\n*/\nexport class Rpc {\n    #u;\n    #n;\n    constructor(url, apiKeyName) {\n        this.#u = new URL(url);\n        this.#u.protocol = 'https:';\n        this.#n = apiKeyName;\n    }\n    /**\n     *\n     * @param {string} action - Nano protocol RPC call to execute\n     * @param {object} [data] - JSON to send to the node as defined by the action\n     * @returns {Promise<any>} JSON-formatted RPC results from the node\n     */\n    async call(action, data) {\n        var process = process || null;\n        this.#validate(action);\n        const headers = {};\n        headers['Content-Type'] = 'application/json';\n        if (this.#n && process?.env?.LIBNEMO_RPC_API_KEY) {\n            headers[this.#n] = process.env.LIBNEMO_RPC_API_KEY;\n        }\n        data ??= {};\n        data.action = action.toLowerCase();\n        const body = JSON.stringify(data)\n            .replaceAll('/', '\\\\u002f')\n            .replaceAll('<', '\\\\u003c')\n            .replaceAll('>', '\\\\u003d')\n            .replaceAll('\\\\', '\\\\u005c');\n        const req = new Request(this.#u, {\n            method: 'POST',\n            headers,\n            body\n        });\n        try {\n            const res = await fetch(req);\n            return await res.json();\n        }\n        catch (err) {\n            console.error(err);\n            return JSON.stringify(err);\n        }\n    }\n    #validate(action) {\n        if (!action) {\n            throw new ReferenceError('Action is required for RPCs');\n        }\n        if (typeof action !== 'string') {\n            throw new TypeError('RPC action must be a string');\n        }\n        if (!/^[A-Za-z]+(_[A-Za-z]+)*$/.test(action)) {\n            throw new TypeError('RPC action contains invalid characters');\n        }\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { bytes, hex } from './convert.js';\nconst { crypto } = globalThis;\nconst MIN = 16;\nconst MAX = 32;\nconst MOD = 4;\n/**\n* Represents a cryptographically strong source of entropy suitable for use in\n* BIP-39 mnemonic phrase generation and consequently BIP-44 key derivation.\n*\n* The constructor will accept one of several different data types under certain\n* constraints. If the constraints are not met, an error will be thrown. If no\n* value, or the equivalent of no value, is passed to the constructor, then a\n* brand new source of entropy will be generated at the maximum size of 256 bits.\n*/\nexport class Entropy {\n    static #isInternal = false;\n    #bytes;\n    get bits() { return bytes.toBin(this.#bytes); }\n    get buffer() { return this.#bytes.buffer; }\n    get bytes() { return this.#bytes; }\n    get hex() { return bytes.toHex(this.#bytes); }\n    constructor(bytes) {\n        if (!Entropy.#isInternal) {\n            throw new Error(`Entropy cannot be instantiated directly. Use 'await Entropy.create()' instead.`);\n        }\n        Entropy.#isInternal = false;\n        this.#bytes = bytes;\n    }\n    static async create(size) {\n        return new Promise(resolve => {\n            if (size != null) {\n                if (typeof size !== 'number') {\n                    throw new TypeError(`Entropy cannot use ${typeof size} as a size`);\n                }\n                if (size < MIN || size > MAX) {\n                    throw new RangeError(`Entropy must be ${MIN}-${MAX} bytes`);\n                }\n                if (size % MOD !== 0) {\n                    throw new RangeError(`Entropy must be a multiple of ${MOD} bytes`);\n                }\n            }\n            Entropy.#isInternal = true;\n            resolve(new this(crypto.getRandomValues(new Uint8Array(size ?? MAX))));\n        });\n    }\n    static async import(input) {\n        return new Promise((resolve, reject) => {\n            if (typeof input === 'string') {\n                if (input.length < MIN * 2 || input.length > MAX * 2) {\n                    throw new RangeError(`Entropy must be ${MIN * 2}-${MAX * 2} characters`);\n                }\n                if (input.length % MOD * 2 !== 0) {\n                    throw new RangeError(`Entropy must be a multiple of ${MOD * 2} characters`);\n                }\n                if (!/^[0-9a-fA-F]+$/i.test(input)) {\n                    throw new RangeError('Entropy contains invalid hexadecimal characters');\n                }\n                Entropy.#isInternal = true;\n                resolve(new this(hex.toBytes(input)));\n            }\n            if (input instanceof ArrayBuffer) {\n                if (input.byteLength < MIN || input.byteLength > MAX) {\n                    throw new Error(`Entropy must be ${MIN}-${MAX} bytes`);\n                }\n                if (input.byteLength % MOD !== 0) {\n                    throw new RangeError(`Entropy must be a multiple of ${MOD} bytes`);\n                }\n                Entropy.#isInternal = true;\n                resolve(new this(new Uint8Array(input)));\n            }\n            if (input instanceof Uint8Array) {\n                if (input.length < MIN || input.length > MAX) {\n                    throw new Error(`Entropy must be ${MIN}-${MAX} bytes`);\n                }\n                if (input.length % MOD !== 0) {\n                    throw new RangeError(`Entropy must be a multiple of ${MOD} bytes`);\n                }\n                Entropy.#isInternal = true;\n                resolve(new this(input));\n            }\n            reject(new TypeError(`Entropy cannot import ${typeof input}`));\n        });\n    }\n    /**\n    * Randomizes the bytes, rendering the original values generally inaccessible.\n    */\n    destroy() {\n        try {\n            crypto.getRandomValues(this.#bytes);\n            return true;\n        }\n        catch (err) {\n            return false;\n        }\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { buffer, hex, utf8 } from './convert.js';\nimport { Entropy } from './entropy.js';\nconst { subtle } = globalThis.crypto;\nconst ERR_MSG = 'Failed to store item in Safe';\nexport class Safe {\n    #storage;\n    constructor() {\n        this.#storage = globalThis.sessionStorage;\n    }\n    async put(name, passkey, data) {\n        if (this.#storage.getItem(name)) {\n            throw new Error(ERR_MSG);\n        }\n        return this.overwrite(name, passkey, data);\n    }\n    async overwrite(name, passkey, data) {\n        if (this.#isNotValid(name, passkey, data)) {\n            throw new Error(ERR_MSG);\n        }\n        const iv = await Entropy.create();\n        if (typeof passkey === 'string') {\n            try {\n                passkey = await subtle.importKey('raw', utf8.toBytes(passkey), 'PBKDF2', false, ['deriveBits', 'deriveKey']);\n                passkey = await subtle.deriveKey({ name: 'PBKDF2', hash: 'SHA-512', salt: iv.bytes, iterations: 210000 }, passkey, { name: 'AES-GCM', length: 256 }, false, ['encrypt']);\n            }\n            catch (err) {\n                throw new Error(ERR_MSG);\n            }\n        }\n        try {\n            if (typeof data === 'bigint') {\n                data = data.toString();\n            }\n            data = JSON.stringify(data);\n            const encoded = utf8.toBytes(data);\n            const encrypted = await subtle.encrypt({ name: 'AES-GCM', iv: iv.buffer }, passkey, encoded);\n            const record = {\n                encrypted: buffer.toHex(encrypted),\n                iv: iv.hex\n            };\n            await new Promise((resolve, reject) => {\n                try {\n                    this.#storage.setItem(name, JSON.stringify(record));\n                    resolve();\n                }\n                catch (err) {\n                    reject(err);\n                }\n            });\n            passkey = '';\n        }\n        catch (err) {\n            throw new Error(ERR_MSG);\n        }\n        return (this.#storage.getItem(name) != null);\n    }\n    async get(name, passkey) {\n        if (this.#isNotValid(name, passkey)) {\n            return null;\n        }\n        const item = await new Promise(resolve => {\n            resolve(this.#storage.getItem(name));\n        });\n        if (item == null) {\n            return null;\n        }\n        const record = JSON.parse(item);\n        const encrypted = hex.toBytes(record.encrypted);\n        const iv = await Entropy.import(record.iv);\n        try {\n            if (typeof passkey === 'string') {\n                passkey = await subtle.importKey('raw', utf8.toBytes(passkey), 'PBKDF2', false, ['deriveBits', 'deriveKey']);\n                passkey = await subtle.deriveKey({ name: 'PBKDF2', hash: 'SHA-512', salt: iv.bytes, iterations: 210000 }, passkey, { name: 'AES-GCM', length: 256 }, false, ['decrypt']);\n            }\n        }\n        catch (err) {\n            return null;\n        }\n        try {\n            const decrypted = await subtle.decrypt({ name: 'AES-GCM', iv: iv.buffer }, passkey, encrypted);\n            const decoded = buffer.toUtf8(decrypted);\n            const data = JSON.parse(decoded);\n            passkey = '';\n            this.#storage.removeItem(name);\n            return data;\n        }\n        catch (err) {\n            return null;\n        }\n    }\n    #isNotValid(name, passkey, data) {\n        if (typeof name !== 'string' || name === '') {\n            return true;\n        }\n        if (typeof passkey !== 'string' || passkey === '') {\n            if (!(passkey instanceof CryptoKey)) {\n                return true;\n            }\n        }\n        if (typeof data === 'object') {\n            try {\n                JSON.stringify(data);\n            }\n            catch (err) {\n                return true;\n            }\n        }\n        return false;\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n/**\n* Processes an array of tasks using Web Workers.\n*/\nexport class Pool {\n    static #cores = Math.max(1, navigator.hardwareConcurrency - 1);\n    #queue = [];\n    #threads = [];\n    #url;\n    get threadsBusy() {\n        let n = 0;\n        for (const thread of this.#threads) {\n            n += +(thread.job != null);\n        }\n        return n;\n    }\n    get threadsIdle() {\n        let n = 0;\n        for (const thread of this.#threads) {\n            n += +(thread.job == null);\n        }\n        return n;\n    }\n    async assign(data) {\n        if (!(data instanceof ArrayBuffer || Array.isArray(data)))\n            data = [data];\n        return new Promise((resolve, reject) => {\n            const job = {\n                id: performance.now(),\n                results: [],\n                data,\n                resolve,\n                reject\n            };\n            if (this.#queue.length > 0) {\n                this.#queue.push(job);\n            }\n            else {\n                for (const thread of this.#threads)\n                    this.#assign(thread, job);\n            }\n        });\n    }\n    /**\n    *\n    * @param {string} worker - Stringified worker class\n    * @param {number} [count=1] - Integer between 1 and CPU thread count shared among all Pools\n    */\n    constructor(worker, count = 1) {\n        count = Math.min(Pool.#cores, Math.max(1, Math.floor(Math.abs(count))));\n        this.#url = URL.createObjectURL(new Blob([worker], { type: 'text/javascript' }));\n        for (let i = 0; i < count; i++) {\n            const thread = {\n                worker: new Worker(this.#url, { type: 'module' }),\n                job: null\n            };\n            thread.worker.addEventListener('message', message => {\n                let result = JSON.parse(new TextDecoder().decode(message.data) || \"[]\");\n                if (!Array.isArray(result))\n                    result = [result];\n                this.#report(thread, result);\n            });\n            this.#threads.push(thread);\n            Pool.#cores = Math.max(1, Pool.#cores - this.#threads.length);\n        }\n    }\n    #assign(thread, job) {\n        if (job.data instanceof ArrayBuffer) {\n            if (job.data.byteLength > 0) {\n                thread.job = job;\n                thread.worker.postMessage({ buffer: job.data }, [job.data]);\n            }\n        }\n        else {\n            const chunk = 1 + (job.data.length / this.threadsIdle);\n            const next = job.data.slice(0, chunk);\n            job.data = job.data.slice(chunk);\n            if (job.data.length === 0)\n                this.#queue.shift();\n            if (next?.length > 0) {\n                const buffer = new TextEncoder().encode(JSON.stringify(next)).buffer;\n                thread.job = job;\n                thread.worker.postMessage({ buffer }, [buffer]);\n            }\n        }\n    }\n    #isJobDone(jobId) {\n        for (const thread of this.#threads) {\n            if (thread.job?.id === jobId)\n                return false;\n        }\n        return true;\n    }\n    #report(thread, results) {\n        if (thread.job == null) {\n            throw new Error('Thread returned results but had nowhere to report it.');\n        }\n        const job = thread.job;\n        if (this.#queue.length > 0) {\n            this.#assign(thread, this.#queue[0]);\n        }\n        else {\n            thread.job = null;\n        }\n        if (results.length > 0) {\n            job.results.push(...results);\n        }\n        if (this.#isJobDone(job.id)) {\n            job.resolve(job.results);\n        }\n    }\n}\n/**\n* Provides basic worker event messaging to extending classes.\n*\n* In order to be properly bundled in a format that can be used to create an\n* inline Web Worker, the extending classes must export WorkerInterface and\n* themselves as a string:\n*```\n* export default `\n* \tconst WorkerInterface = ${WorkerInterface}\n* \tconst Pow = ${Pow}\n* `\n* ```\n* They must also initialize the event listener by calling their inherited\n* `listen()` function. Finally, they must override the implementation of the\n* `work()` function. See the documentation of those functions for details.\n*/\nexport class WorkerInterface {\n    /**\n    * Processes data through a worker.\n    *\n    * Extending classes must override this template by implementing the same\n    * function signature and providing their own processing call in the try-catch\n    * block.\n    *\n    * @param {any[]} data - Array of data to process\n    * @returns Promise for that data after being processed\n    */\n    static async work(data) {\n        return new Promise(async (resolve, reject) => {\n            for (let d of data) {\n                try {\n                    d = await d;\n                }\n                catch (err) {\n                    reject(err);\n                }\n            }\n            resolve(data);\n        });\n    }\n    /**\n    * Encodes worker results as an ArrayBuffer so it can be transferred back to\n    * the main thread.\n    *\n    * @param {any[]} results - Array of processed data\n    */\n    static report(results) {\n        const buffer = new TextEncoder().encode(JSON.stringify(results)).buffer;\n        //@ts-expect-error\n        postMessage(buffer, [buffer]);\n    }\n    /**\n    * Listens for messages from the main thread.\n    *\n    * Extending classes must call this in a static initialization block:\n    * ```\n    * static {\n    * \tPow.listen()\n    * }\n    * ```\n    */\n    static listen() {\n        addEventListener('message', (message) => {\n            const { name, buffer } = message.data;\n            if (name === 'STOP') {\n                close();\n                const buffer = new ArrayBuffer(0);\n                //@ts-expect-error\n                postMessage(buffer, [buffer]);\n            }\n            else {\n                const data = JSON.parse(new TextDecoder().decode(buffer));\n                this.work(data).then(this.report);\n            }\n        });\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n'use strict';\nimport { Blake2b } from '../blake2b.js';\nimport { WorkerInterface } from '../pool.js';\n// Ported in 2014 by Dmitry Chestnykh and Devi Mandiri.\n// Public domain.\n//\n// Implementation derived from TweetNaCl version 20140427.\n// See for details: http://tweetnacl.cr.yp.to/\n//\n// Modified in 2024 by Chris Duncan to hash secret key to public key using\n// BLAKE2b instead of SHA-512 as specified in the documentation for Nano\n// cryptocurrency.\n// See for details: https://docs.nano.org/integration-guides/the-basics/\n// Original source commit: https://github.com/dchest/tweetnacl-js/blob/71df1d6a1d78236ca3e9f6c788786e21f5a651a6/nacl-fast.js\nexport class NanoNaCl extends WorkerInterface {\n    static {\n        NanoNaCl.listen();\n    }\n    static async work(data) {\n        return new Promise(async (resolve, reject) => {\n            for (let d of data) {\n                try {\n                    d.publicKey = await this.convert(d.privateKey);\n                }\n                catch (err) {\n                    reject(err);\n                }\n            }\n            resolve(data);\n        });\n    }\n    static gf = function (init) {\n        const r = new Float64Array(16);\n        if (init)\n            for (let i = 0; i < init.length; i++)\n                r[i] = init[i];\n        return r;\n    };\n    static gf0 = this.gf();\n    static gf1 = this.gf([1]);\n    static D = this.gf([0x78a3, 0x1359, 0x4dca, 0x75eb, 0xd8ab, 0x4141, 0x0a4d, 0x0070, 0xe898, 0x7779, 0x4079, 0x8cc7, 0xfe73, 0x2b6f, 0x6cee, 0x5203]);\n    static D2 = this.gf([0xf159, 0x26b2, 0x9b94, 0xebd6, 0xb156, 0x8283, 0x149a, 0x00e0, 0xd130, 0xeef3, 0x80f2, 0x198e, 0xfce7, 0x56df, 0xd9dc, 0x2406]);\n    static X = this.gf([0xd51a, 0x8f25, 0x2d60, 0xc956, 0xa7b2, 0x9525, 0xc760, 0x692c, 0xdc5c, 0xfdd6, 0xe231, 0xc0a4, 0x53fe, 0xcd6e, 0x36d3, 0x2169]);\n    static Y = this.gf([0x6658, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666]);\n    static I = this.gf([0xa0b0, 0x4a0e, 0x1b27, 0xc4ee, 0xe478, 0xad2f, 0x1806, 0x2f43, 0xd7a7, 0x3dfb, 0x0099, 0x2b4d, 0xdf0b, 0x4fc1, 0x2480, 0x2b83]);\n    static vn(x, xi, y, yi, n) {\n        let d = 0;\n        for (let i = 0; i < n; i++)\n            d |= x[xi + i] ^ y[yi + i];\n        return (1 & ((d - 1) >>> 8)) - 1;\n    }\n    static crypto_verify_32(x, xi, y, yi) {\n        return this.vn(x, xi, y, yi, 32);\n    }\n    static set25519(r, a) {\n        for (let i = 0; i < 16; i++)\n            r[i] = a[i] | 0;\n    }\n    static car25519(o) {\n        let v, c = 1;\n        for (let i = 0; i < 16; i++) {\n            v = o[i] + c + 65535;\n            c = Math.floor(v / 65536);\n            o[i] = v - c * 65536;\n        }\n        o[0] += c - 1 + 37 * (c - 1);\n    }\n    static sel25519(p, q, b) {\n        let t;\n        const c = ~(b - 1);\n        for (let i = 0; i < 16; i++) {\n            t = c & (p[i] ^ q[i]);\n            p[i] ^= t;\n            q[i] ^= t;\n        }\n    }\n    static pack25519(o, n) {\n        let b;\n        const m = this.gf();\n        const t = this.gf();\n        for (let i = 0; i < 16; i++)\n            t[i] = n[i];\n        this.car25519(t);\n        this.car25519(t);\n        this.car25519(t);\n        for (let j = 0; j < 2; j++) {\n            m[0] = t[0] - 0xffed;\n            for (let i = 1; i < 15; i++) {\n                m[i] = t[i] - 0xffff - ((m[i - 1] >> 16) & 1);\n                m[i - 1] &= 0xffff;\n            }\n            m[15] = t[15] - 0x7fff - ((m[14] >> 16) & 1);\n            b = (m[15] >> 16) & 1;\n            m[14] &= 0xffff;\n            this.sel25519(t, m, 1 - b);\n        }\n        for (let i = 0; i < 16; i++) {\n            o[2 * i] = t[i] & 0xff;\n            o[2 * i + 1] = t[i] >> 8;\n        }\n    }\n    static neq25519(a, b) {\n        const c = new Uint8Array(32);\n        const d = new Uint8Array(32);\n        this.pack25519(c, a);\n        this.pack25519(d, b);\n        return this.crypto_verify_32(c, 0, d, 0);\n    }\n    static par25519(a) {\n        var d = new Uint8Array(32);\n        this.pack25519(d, a);\n        return d[0] & 1;\n    }\n    static unpack25519(o, n) {\n        for (let i = 0; i < 16; i++)\n            o[i] = n[2 * i] + (n[2 * i + 1] << 8);\n        o[15] &= 0x7fff;\n    }\n    static A(o, a, b) {\n        for (let i = 0; i < 16; i++)\n            o[i] = a[i] + b[i];\n    }\n    static Z(o, a, b) {\n        for (let i = 0; i < 16; i++)\n            o[i] = a[i] - b[i];\n    }\n    static M(o, a, b) {\n        let v, c, t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0, t8 = 0, t9 = 0, t10 = 0, t11 = 0, t12 = 0, t13 = 0, t14 = 0, t15 = 0, t16 = 0, t17 = 0, t18 = 0, t19 = 0, t20 = 0, t21 = 0, t22 = 0, t23 = 0, t24 = 0, t25 = 0, t26 = 0, t27 = 0, t28 = 0, t29 = 0, t30 = 0, b0 = b[0], b1 = b[1], b2 = b[2], b3 = b[3], b4 = b[4], b5 = b[5], b6 = b[6], b7 = b[7], b8 = b[8], b9 = b[9], b10 = b[10], b11 = b[11], b12 = b[12], b13 = b[13], b14 = b[14], b15 = b[15];\n        v = a[0];\n        t0 += v * b0;\n        t1 += v * b1;\n        t2 += v * b2;\n        t3 += v * b3;\n        t4 += v * b4;\n        t5 += v * b5;\n        t6 += v * b6;\n        t7 += v * b7;\n        t8 += v * b8;\n        t9 += v * b9;\n        t10 += v * b10;\n        t11 += v * b11;\n        t12 += v * b12;\n        t13 += v * b13;\n        t14 += v * b14;\n        t15 += v * b15;\n        v = a[1];\n        t1 += v * b0;\n        t2 += v * b1;\n        t3 += v * b2;\n        t4 += v * b3;\n        t5 += v * b4;\n        t6 += v * b5;\n        t7 += v * b6;\n        t8 += v * b7;\n        t9 += v * b8;\n        t10 += v * b9;\n        t11 += v * b10;\n        t12 += v * b11;\n        t13 += v * b12;\n        t14 += v * b13;\n        t15 += v * b14;\n        t16 += v * b15;\n        v = a[2];\n        t2 += v * b0;\n        t3 += v * b1;\n        t4 += v * b2;\n        t5 += v * b3;\n        t6 += v * b4;\n        t7 += v * b5;\n        t8 += v * b6;\n        t9 += v * b7;\n        t10 += v * b8;\n        t11 += v * b9;\n        t12 += v * b10;\n        t13 += v * b11;\n        t14 += v * b12;\n        t15 += v * b13;\n        t16 += v * b14;\n        t17 += v * b15;\n        v = a[3];\n        t3 += v * b0;\n        t4 += v * b1;\n        t5 += v * b2;\n        t6 += v * b3;\n        t7 += v * b4;\n        t8 += v * b5;\n        t9 += v * b6;\n        t10 += v * b7;\n        t11 += v * b8;\n        t12 += v * b9;\n        t13 += v * b10;\n        t14 += v * b11;\n        t15 += v * b12;\n        t16 += v * b13;\n        t17 += v * b14;\n        t18 += v * b15;\n        v = a[4];\n        t4 += v * b0;\n        t5 += v * b1;\n        t6 += v * b2;\n        t7 += v * b3;\n        t8 += v * b4;\n        t9 += v * b5;\n        t10 += v * b6;\n        t11 += v * b7;\n        t12 += v * b8;\n        t13 += v * b9;\n        t14 += v * b10;\n        t15 += v * b11;\n        t16 += v * b12;\n        t17 += v * b13;\n        t18 += v * b14;\n        t19 += v * b15;\n        v = a[5];\n        t5 += v * b0;\n        t6 += v * b1;\n        t7 += v * b2;\n        t8 += v * b3;\n        t9 += v * b4;\n        t10 += v * b5;\n        t11 += v * b6;\n        t12 += v * b7;\n        t13 += v * b8;\n        t14 += v * b9;\n        t15 += v * b10;\n        t16 += v * b11;\n        t17 += v * b12;\n        t18 += v * b13;\n        t19 += v * b14;\n        t20 += v * b15;\n        v = a[6];\n        t6 += v * b0;\n        t7 += v * b1;\n        t8 += v * b2;\n        t9 += v * b3;\n        t10 += v * b4;\n        t11 += v * b5;\n        t12 += v * b6;\n        t13 += v * b7;\n        t14 += v * b8;\n        t15 += v * b9;\n        t16 += v * b10;\n        t17 += v * b11;\n        t18 += v * b12;\n        t19 += v * b13;\n        t20 += v * b14;\n        t21 += v * b15;\n        v = a[7];\n        t7 += v * b0;\n        t8 += v * b1;\n        t9 += v * b2;\n        t10 += v * b3;\n        t11 += v * b4;\n        t12 += v * b5;\n        t13 += v * b6;\n        t14 += v * b7;\n        t15 += v * b8;\n        t16 += v * b9;\n        t17 += v * b10;\n        t18 += v * b11;\n        t19 += v * b12;\n        t20 += v * b13;\n        t21 += v * b14;\n        t22 += v * b15;\n        v = a[8];\n        t8 += v * b0;\n        t9 += v * b1;\n        t10 += v * b2;\n        t11 += v * b3;\n        t12 += v * b4;\n        t13 += v * b5;\n        t14 += v * b6;\n        t15 += v * b7;\n        t16 += v * b8;\n        t17 += v * b9;\n        t18 += v * b10;\n        t19 += v * b11;\n        t20 += v * b12;\n        t21 += v * b13;\n        t22 += v * b14;\n        t23 += v * b15;\n        v = a[9];\n        t9 += v * b0;\n        t10 += v * b1;\n        t11 += v * b2;\n        t12 += v * b3;\n        t13 += v * b4;\n        t14 += v * b5;\n        t15 += v * b6;\n        t16 += v * b7;\n        t17 += v * b8;\n        t18 += v * b9;\n        t19 += v * b10;\n        t20 += v * b11;\n        t21 += v * b12;\n        t22 += v * b13;\n        t23 += v * b14;\n        t24 += v * b15;\n        v = a[10];\n        t10 += v * b0;\n        t11 += v * b1;\n        t12 += v * b2;\n        t13 += v * b3;\n        t14 += v * b4;\n        t15 += v * b5;\n        t16 += v * b6;\n        t17 += v * b7;\n        t18 += v * b8;\n        t19 += v * b9;\n        t20 += v * b10;\n        t21 += v * b11;\n        t22 += v * b12;\n        t23 += v * b13;\n        t24 += v * b14;\n        t25 += v * b15;\n        v = a[11];\n        t11 += v * b0;\n        t12 += v * b1;\n        t13 += v * b2;\n        t14 += v * b3;\n        t15 += v * b4;\n        t16 += v * b5;\n        t17 += v * b6;\n        t18 += v * b7;\n        t19 += v * b8;\n        t20 += v * b9;\n        t21 += v * b10;\n        t22 += v * b11;\n        t23 += v * b12;\n        t24 += v * b13;\n        t25 += v * b14;\n        t26 += v * b15;\n        v = a[12];\n        t12 += v * b0;\n        t13 += v * b1;\n        t14 += v * b2;\n        t15 += v * b3;\n        t16 += v * b4;\n        t17 += v * b5;\n        t18 += v * b6;\n        t19 += v * b7;\n        t20 += v * b8;\n        t21 += v * b9;\n        t22 += v * b10;\n        t23 += v * b11;\n        t24 += v * b12;\n        t25 += v * b13;\n        t26 += v * b14;\n        t27 += v * b15;\n        v = a[13];\n        t13 += v * b0;\n        t14 += v * b1;\n        t15 += v * b2;\n        t16 += v * b3;\n        t17 += v * b4;\n        t18 += v * b5;\n        t19 += v * b6;\n        t20 += v * b7;\n        t21 += v * b8;\n        t22 += v * b9;\n        t23 += v * b10;\n        t24 += v * b11;\n        t25 += v * b12;\n        t26 += v * b13;\n        t27 += v * b14;\n        t28 += v * b15;\n        v = a[14];\n        t14 += v * b0;\n        t15 += v * b1;\n        t16 += v * b2;\n        t17 += v * b3;\n        t18 += v * b4;\n        t19 += v * b5;\n        t20 += v * b6;\n        t21 += v * b7;\n        t22 += v * b8;\n        t23 += v * b9;\n        t24 += v * b10;\n        t25 += v * b11;\n        t26 += v * b12;\n        t27 += v * b13;\n        t28 += v * b14;\n        t29 += v * b15;\n        v = a[15];\n        t15 += v * b0;\n        t16 += v * b1;\n        t17 += v * b2;\n        t18 += v * b3;\n        t19 += v * b4;\n        t20 += v * b5;\n        t21 += v * b6;\n        t22 += v * b7;\n        t23 += v * b8;\n        t24 += v * b9;\n        t25 += v * b10;\n        t26 += v * b11;\n        t27 += v * b12;\n        t28 += v * b13;\n        t29 += v * b14;\n        t30 += v * b15;\n        t0 += 38 * t16;\n        t1 += 38 * t17;\n        t2 += 38 * t18;\n        t3 += 38 * t19;\n        t4 += 38 * t20;\n        t5 += 38 * t21;\n        t6 += 38 * t22;\n        t7 += 38 * t23;\n        t8 += 38 * t24;\n        t9 += 38 * t25;\n        t10 += 38 * t26;\n        t11 += 38 * t27;\n        t12 += 38 * t28;\n        t13 += 38 * t29;\n        t14 += 38 * t30;\n        // t15 left as is\n        // first car\n        c = 1;\n        v = t0 + c + 65535;\n        c = Math.floor(v / 65536);\n        t0 = v - c * 65536;\n        v = t1 + c + 65535;\n        c = Math.floor(v / 65536);\n        t1 = v - c * 65536;\n        v = t2 + c + 65535;\n        c = Math.floor(v / 65536);\n        t2 = v - c * 65536;\n        v = t3 + c + 65535;\n        c = Math.floor(v / 65536);\n        t3 = v - c * 65536;\n        v = t4 + c + 65535;\n        c = Math.floor(v / 65536);\n        t4 = v - c * 65536;\n        v = t5 + c + 65535;\n        c = Math.floor(v / 65536);\n        t5 = v - c * 65536;\n        v = t6 + c + 65535;\n        c = Math.floor(v / 65536);\n        t6 = v - c * 65536;\n        v = t7 + c + 65535;\n        c = Math.floor(v / 65536);\n        t7 = v - c * 65536;\n        v = t8 + c + 65535;\n        c = Math.floor(v / 65536);\n        t8 = v - c * 65536;\n        v = t9 + c + 65535;\n        c = Math.floor(v / 65536);\n        t9 = v - c * 65536;\n        v = t10 + c + 65535;\n        c = Math.floor(v / 65536);\n        t10 = v - c * 65536;\n        v = t11 + c + 65535;\n        c = Math.floor(v / 65536);\n        t11 = v - c * 65536;\n        v = t12 + c + 65535;\n        c = Math.floor(v / 65536);\n        t12 = v - c * 65536;\n        v = t13 + c + 65535;\n        c = Math.floor(v / 65536);\n        t13 = v - c * 65536;\n        v = t14 + c + 65535;\n        c = Math.floor(v / 65536);\n        t14 = v - c * 65536;\n        v = t15 + c + 65535;\n        c = Math.floor(v / 65536);\n        t15 = v - c * 65536;\n        t0 += c - 1 + 37 * (c - 1);\n        // second car\n        c = 1;\n        v = t0 + c + 65535;\n        c = Math.floor(v / 65536);\n        t0 = v - c * 65536;\n        v = t1 + c + 65535;\n        c = Math.floor(v / 65536);\n        t1 = v - c * 65536;\n        v = t2 + c + 65535;\n        c = Math.floor(v / 65536);\n        t2 = v - c * 65536;\n        v = t3 + c + 65535;\n        c = Math.floor(v / 65536);\n        t3 = v - c * 65536;\n        v = t4 + c + 65535;\n        c = Math.floor(v / 65536);\n        t4 = v - c * 65536;\n        v = t5 + c + 65535;\n        c = Math.floor(v / 65536);\n        t5 = v - c * 65536;\n        v = t6 + c + 65535;\n        c = Math.floor(v / 65536);\n        t6 = v - c * 65536;\n        v = t7 + c + 65535;\n        c = Math.floor(v / 65536);\n        t7 = v - c * 65536;\n        v = t8 + c + 65535;\n        c = Math.floor(v / 65536);\n        t8 = v - c * 65536;\n        v = t9 + c + 65535;\n        c = Math.floor(v / 65536);\n        t9 = v - c * 65536;\n        v = t10 + c + 65535;\n        c = Math.floor(v / 65536);\n        t10 = v - c * 65536;\n        v = t11 + c + 65535;\n        c = Math.floor(v / 65536);\n        t11 = v - c * 65536;\n        v = t12 + c + 65535;\n        c = Math.floor(v / 65536);\n        t12 = v - c * 65536;\n        v = t13 + c + 65535;\n        c = Math.floor(v / 65536);\n        t13 = v - c * 65536;\n        v = t14 + c + 65535;\n        c = Math.floor(v / 65536);\n        t14 = v - c * 65536;\n        v = t15 + c + 65535;\n        c = Math.floor(v / 65536);\n        t15 = v - c * 65536;\n        t0 += c - 1 + 37 * (c - 1);\n        o[0] = t0;\n        o[1] = t1;\n        o[2] = t2;\n        o[3] = t3;\n        o[4] = t4;\n        o[5] = t5;\n        o[6] = t6;\n        o[7] = t7;\n        o[8] = t8;\n        o[9] = t9;\n        o[10] = t10;\n        o[11] = t11;\n        o[12] = t12;\n        o[13] = t13;\n        o[14] = t14;\n        o[15] = t15;\n    }\n    static S(o, a) {\n        this.M(o, a, a);\n    }\n    static inv25519(o, i) {\n        const c = this.gf();\n        for (let a = 0; a < 16; a++)\n            c[a] = i[a];\n        for (let a = 253; a >= 0; a--) {\n            this.S(c, c);\n            if (a !== 2 && a !== 4)\n                this.M(c, c, i);\n        }\n        for (let a = 0; a < 16; a++)\n            o[a] = c[a];\n    }\n    static pow2523(o, i) {\n        const c = this.gf();\n        for (let a = 0; a < 16; a++)\n            c[a] = i[a];\n        for (let a = 250; a >= 0; a--) {\n            this.S(c, c);\n            if (a !== 1)\n                this.M(c, c, i);\n        }\n        for (let a = 0; a < 16; a++)\n            o[a] = c[a];\n    }\n    // Note: difference from TweetNaCl - BLAKE2b used to hash instead of SHA-512.\n    static crypto_hash(out, m, n) {\n        const input = new Uint8Array(n);\n        for (let i = 0; i < n; ++i)\n            input[i] = m[i];\n        const hash = new Blake2b(64).update(m).digest();\n        for (let i = 0; i < 64; ++i)\n            out[i] = hash[i];\n        return 0;\n    }\n    static add(p, q) {\n        const a = this.gf();\n        const b = this.gf();\n        const c = this.gf();\n        const d = this.gf();\n        const e = this.gf();\n        const f = this.gf();\n        const g = this.gf();\n        const h = this.gf();\n        const t = this.gf();\n        this.Z(a, p[1], p[0]);\n        this.Z(t, q[1], q[0]);\n        this.M(a, a, t);\n        this.A(b, p[0], p[1]);\n        this.A(t, q[0], q[1]);\n        this.M(b, b, t);\n        this.M(c, p[3], q[3]);\n        this.M(c, c, this.D2);\n        this.M(d, p[2], q[2]);\n        this.A(d, d, d);\n        this.Z(e, b, a);\n        this.Z(f, d, c);\n        this.A(g, d, c);\n        this.A(h, b, a);\n        this.M(p[0], e, f);\n        this.M(p[1], h, g);\n        this.M(p[2], g, f);\n        this.M(p[3], e, h);\n    }\n    static cswap(p, q, b) {\n        for (let i = 0; i < 4; i++) {\n            this.sel25519(p[i], q[i], b);\n        }\n    }\n    static pack(r, p) {\n        const tx = this.gf();\n        const ty = this.gf();\n        const zi = this.gf();\n        this.inv25519(zi, p[2]);\n        this.M(tx, p[0], zi);\n        this.M(ty, p[1], zi);\n        this.pack25519(r, ty);\n        r[31] ^= this.par25519(tx) << 7;\n    }\n    static scalarmult(p, q, s) {\n        this.set25519(p[0], this.gf0);\n        this.set25519(p[1], this.gf1);\n        this.set25519(p[2], this.gf1);\n        this.set25519(p[3], this.gf0);\n        for (let i = 255; i >= 0; --i) {\n            const b = (s[(i / 8) | 0] >> (i & 7)) & 1;\n            this.cswap(p, q, b);\n            this.add(q, p);\n            this.add(p, p);\n            this.cswap(p, q, b);\n        }\n    }\n    static scalarbase(p, s) {\n        const q = [this.gf(), this.gf(), this.gf(), this.gf()];\n        this.set25519(q[0], this.X);\n        this.set25519(q[1], this.Y);\n        this.set25519(q[2], this.gf1);\n        this.M(q[3], this.X, this.Y);\n        this.scalarmult(p, q, s);\n    }\n    static L = new Float64Array([\n        0xed, 0xd3, 0xf5, 0x5c, 0x1a, 0x63, 0x12, 0x58,\n        0xd6, 0x9c, 0xf7, 0xa2, 0xde, 0xf9, 0xde, 0x14,\n        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10\n    ]);\n    static modL(r, x) {\n        let carry, i, j, k;\n        for (i = 63; i >= 32; --i) {\n            carry = 0;\n            for (j = i - 32, k = i - 12; j < k; ++j) {\n                x[j] += carry - 16 * x[i] * this.L[j - (i - 32)];\n                carry = Math.floor((x[j] + 128) / 256);\n                x[j] -= carry * 256;\n            }\n            x[j] += carry;\n            x[i] = 0;\n        }\n        carry = 0;\n        for (j = 0; j < 32; j++) {\n            x[j] += carry - (x[31] >> 4) * this.L[j];\n            carry = x[j] >> 8;\n            x[j] &= 255;\n        }\n        for (j = 0; j < 32; j++)\n            x[j] -= carry * this.L[j];\n        for (i = 0; i < 32; i++) {\n            x[i + 1] += x[i] >> 8;\n            r[i] = x[i] & 255;\n        }\n    }\n    static reduce(r) {\n        let x = new Float64Array(64);\n        for (let i = 0; i < 64; i++)\n            x[i] = r[i];\n        for (let i = 0; i < 64; i++)\n            r[i] = 0;\n        this.modL(r, x);\n    }\n    // Note: difference from C - smlen returned, not passed as argument.\n    static crypto_sign(sm, m, n, sk, pk) {\n        const d = new Uint8Array(64);\n        const h = new Uint8Array(64);\n        const r = new Uint8Array(64);\n        const x = new Float64Array(64);\n        const p = [this.gf(), this.gf(), this.gf(), this.gf()];\n        this.crypto_hash(d, sk, 32);\n        d[0] &= 248;\n        d[31] &= 127;\n        d[31] |= 64;\n        const smlen = n + 64;\n        for (let i = 0; i < n; i++)\n            sm[64 + i] = m[i];\n        for (let i = 0; i < 32; i++)\n            sm[32 + i] = d[32 + i];\n        this.crypto_hash(r, sm.subarray(32), n + 32);\n        this.reduce(r);\n        this.scalarbase(p, r);\n        this.pack(sm, p);\n        for (let i = 0; i < 32; i++)\n            sm[i + 32] = pk[i];\n        this.crypto_hash(h, sm, n + 64);\n        this.reduce(h);\n        for (let i = 0; i < 64; i++)\n            x[i] = 0;\n        for (let i = 0; i < 32; i++)\n            x[i] = r[i];\n        for (let i = 0; i < 32; i++) {\n            for (let j = 0; j < 32; j++) {\n                x[i + j] += h[i] * d[j];\n            }\n        }\n        this.modL(sm.subarray(32), x);\n        return smlen;\n    }\n    static unpackneg(r, p) {\n        const t = this.gf();\n        const chk = this.gf();\n        const num = this.gf();\n        const den = this.gf();\n        const den2 = this.gf();\n        const den4 = this.gf();\n        const den6 = this.gf();\n        this.set25519(r[2], this.gf1);\n        this.unpack25519(r[1], p);\n        this.S(num, r[1]);\n        this.M(den, num, this.D);\n        this.Z(num, num, r[2]);\n        this.A(den, r[2], den);\n        this.S(den2, den);\n        this.S(den4, den2);\n        this.M(den6, den4, den2);\n        this.M(t, den6, num);\n        this.M(t, t, den);\n        this.pow2523(t, t);\n        this.M(t, t, num);\n        this.M(t, t, den);\n        this.M(t, t, den);\n        this.M(r[0], t, den);\n        this.S(chk, r[0]);\n        this.M(chk, chk, den);\n        if (this.neq25519(chk, num))\n            this.M(r[0], r[0], this.I);\n        this.S(chk, r[0]);\n        this.M(chk, chk, den);\n        if (this.neq25519(chk, num))\n            return -1;\n        if (this.par25519(r[0]) === (p[31] >> 7))\n            this.Z(r[0], this.gf0, r[0]);\n        this.M(r[3], r[0], r[1]);\n        return 0;\n    }\n    static crypto_sign_open(m, sm, n, pk) {\n        const t = new Uint8Array(32);\n        const h = new Uint8Array(64);\n        const p = [this.gf(), this.gf(), this.gf(), this.gf()];\n        const q = [this.gf(), this.gf(), this.gf(), this.gf()];\n        if (n < 64)\n            return -1;\n        if (this.unpackneg(q, pk))\n            return -1;\n        for (let i = 0; i < n; i++)\n            m[i] = sm[i];\n        for (let i = 0; i < 32; i++)\n            m[i + 32] = pk[i];\n        this.crypto_hash(h, m, n);\n        this.reduce(h);\n        this.scalarmult(p, q, h);\n        this.scalarbase(q, sm.subarray(32));\n        this.add(p, q);\n        this.pack(t, p);\n        n -= 64;\n        if (this.crypto_verify_32(sm, 0, t, 0)) {\n            for (let i = 0; i < n; i++)\n                m[i] = 0;\n            return -1;\n        }\n        for (let i = 0; i < n; i++)\n            m[i] = sm[i + 64];\n        return n;\n    }\n    static crypto_sign_BYTES = 64;\n    static crypto_sign_PUBLICKEYBYTES = 32;\n    static crypto_sign_SECRETKEYBYTES = 32;\n    static crypto_sign_SEEDBYTES = 32;\n    /* High-level API */\n    static checkArrayTypes(...args) {\n        for (let i = 0; i < args.length; i++) {\n            if (!(args[i] instanceof Uint8Array))\n                throw new TypeError(`expected Uint8Array; received ${args[i].constructor?.name ?? typeof args[i]}`);\n        }\n    }\n    static parseHex(hex) {\n        if (hex.length % 2 === 1)\n            hex = `0${hex}`;\n        const arr = hex.match(/.{1,2}/g)?.map(byte => parseInt(byte, 16));\n        return Uint8Array.from(arr ?? []);\n    }\n    static hexify(buf) {\n        let str = '';\n        for (let i = 0; i < buf.length; i++) {\n            if (typeof buf[i] !== 'number')\n                throw new TypeError(`expected number to convert to hex; received ${typeof buf[i]}`);\n            if (buf[i] < 0 || buf[i] > 255)\n                throw new RangeError(`expected byte value 0-255; received ${buf[i]}`);\n            str += buf[i].toString(16).padStart(2, '0');\n        }\n        return str;\n    }\n    static sign(msg, secretKey) {\n        this.checkArrayTypes(msg, secretKey);\n        if (secretKey.length !== this.crypto_sign_SECRETKEYBYTES)\n            throw new Error('bad secret key size');\n        var signedMsg = new Uint8Array(this.crypto_sign_BYTES + msg.length);\n        const publicKey = this.parseHex(this.convert(secretKey));\n        this.crypto_sign(signedMsg, msg, msg.length, secretKey, publicKey);\n        return signedMsg;\n    }\n    static open(signedMsg, publicKey) {\n        this.checkArrayTypes(signedMsg, publicKey);\n        if (publicKey.length !== this.crypto_sign_PUBLICKEYBYTES)\n            throw new Error('bad public key size');\n        const tmp = new Uint8Array(signedMsg.length);\n        var mlen = this.crypto_sign_open(tmp, signedMsg, signedMsg.length, publicKey);\n        if (mlen < 0)\n            return new Uint8Array(0);\n        var m = new Uint8Array(mlen);\n        for (var i = 0; i < m.length; i++)\n            m[i] = tmp[i];\n        return m;\n    }\n    static detached(msg, secretKey) {\n        var signedMsg = this.sign(msg, secretKey);\n        var sig = new Uint8Array(this.crypto_sign_BYTES);\n        for (var i = 0; i < sig.length; i++)\n            sig[i] = signedMsg[i];\n        return this.hexify(sig).toUpperCase();\n    }\n    static verify(msg, sig, publicKey) {\n        this.checkArrayTypes(msg, sig, publicKey);\n        if (sig.length !== this.crypto_sign_BYTES)\n            throw new Error('bad signature size');\n        if (publicKey.length !== this.crypto_sign_PUBLICKEYBYTES)\n            throw new Error('bad public key size');\n        const sm = new Uint8Array(this.crypto_sign_BYTES + msg.length);\n        const m = new Uint8Array(this.crypto_sign_BYTES + msg.length);\n        for (let i = 0; i < this.crypto_sign_BYTES; i++)\n            sm[i] = sig[i];\n        for (let i = 0; i < msg.length; i++)\n            sm[i + this.crypto_sign_BYTES] = msg[i];\n        return (this.crypto_sign_open(m, sm, sm.length, publicKey) >= 0);\n    }\n    static convert(seed) {\n        if (typeof seed === 'string')\n            seed = this.parseHex(seed);\n        this.checkArrayTypes(seed);\n        if (seed.length !== this.crypto_sign_SEEDBYTES)\n            throw new Error('bad seed size');\n        const pk = new Uint8Array(this.crypto_sign_PUBLICKEYBYTES);\n        const p = [this.gf(), this.gf(), this.gf(), this.gf()];\n        const hash = new Blake2b(64).update(seed).digest();\n        hash[0] &= 248;\n        hash[31] &= 127;\n        hash[31] |= 64;\n        this.scalarbase(p, hash);\n        this.pack(pk, p);\n        return this.hexify(pk).toUpperCase();\n    }\n}\nexport default `\r\n\tconst Blake2b = ${Blake2b}\r\n\tconst WorkerInterface = ${WorkerInterface}\r\n\tconst NanoNaCl = ${NanoNaCl}\r\n`;\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Blake2b } from './blake2b.js';\nimport { ACCOUNT_KEY_LENGTH, ALPHABET, PREFIX, PREFIX_LEGACY } from './constants.js';\nimport { base32, bytes, hex } from './convert.js';\nimport { Rpc } from './rpc.js';\nimport { Safe } from './safe.js';\nimport { NanoNaCl } from './workers/nano-nacl.js';\n/**\n* Represents a single Nano address and the associated public key. To include the\n* matching private key, it must be known at the time of object instantiation.\n* The frontier, balance, and representative for the account can also be set or\n* be fetched from the network.\n*/\nexport class Account {\n    static #isInternal = false;\n    #a;\n    #pub;\n    #prv;\n    #i;\n    #f;\n    #b;\n    #r;\n    #rep;\n    #w;\n    #s;\n    get address() { return `${PREFIX}${this.#a}`; }\n    get publicKey() { return this.#pub; }\n    get privateKey() { return this.#prv; }\n    get index() { return this.#i; }\n    get frontier() { return this.#f; }\n    get balance() { return this.#b; }\n    get receivable() { return this.#r; }\n    get representative() { return this.#rep; }\n    get weight() { return this.#w; }\n    set frontier(v) { this.#f = v; }\n    set balance(v) { this.#b = v ? BigInt(v) : undefined; }\n    set receivable(v) { this.#r = v ? BigInt(v) : undefined; }\n    set representative(v) {\n        if (v?.constructor === Account) {\n            this.#rep = v;\n        }\n        else if (typeof v === 'string') {\n            this.#rep = Account.fromAddress(v);\n        }\n        else {\n            throw new TypeError(`Invalid argument for account representative: ${v}`);\n        }\n    }\n    set weight(v) { this.#w = v ? BigInt(v) : undefined; }\n    constructor(address, publicKey, privateKey, index) {\n        if (!Account.#isInternal) {\n            throw new Error(`Account cannot be instantiated directly. Use factory methods instead.`);\n        }\n        if (index !== undefined && typeof index !== 'number') {\n            throw new TypeError(`Invalid index ${index} when creating Account ${address}`);\n        }\n        this.#a = address\n            .replace(PREFIX, '')\n            .replace(PREFIX_LEGACY, '');\n        this.#pub = publicKey;\n        this.#prv = privateKey ?? null;\n        this.#i = index;\n        this.#s = new Safe();\n        Account.#isInternal = false;\n    }\n    /**\n    * Instantiates an Account object from its Nano address.\n    *\n    * @param {string} address - Address of the account\n    * @param {number} [index] - Account number used when deriving the address\n    * @returns {Account} The instantiated Account object\n    */\n    static fromAddress(address, index) {\n        Account.#isInternal = true;\n        Account.validate(address);\n        const publicKey = Account.#addressToKey(address);\n        const account = new this(address, publicKey, undefined, index);\n        return account;\n    }\n    /**\n    * Instantiates an Account object from its public key.\n    *\n    * @param {string} publicKey - Public key of the account\n    * @param {number} [index] - Account number used when deriving the key\n    * @returns {Account} The instantiated Account object\n    */\n    static fromPublicKey(publicKey, index) {\n        Account.#isInternal = true;\n        Account.#validateKey(publicKey);\n        const address = Account.#keyToAddress(publicKey);\n        const account = new this(address, publicKey, undefined, index);\n        return account;\n    }\n    /**\n    * Instantiates an Account object from its private key. The\n    * corresponding public key will automatically be derived and saved.\n    *\n    * @param {string} privateKey - Private key of the account\n    * @param {number} [index] - Account number used when deriving the key\n    * @returns {Account} A new Account object\n    */\n    static fromPrivateKey(privateKey, index) {\n        Account.#isInternal = true;\n        Account.#validateKey(privateKey);\n        const publicKey = NanoNaCl.convert(privateKey);\n        const account = Account.fromPublicKey(publicKey, index);\n        account.#prv = privateKey.toUpperCase();\n        return account;\n    }\n    /**\n    * Instantiates an Account object from its public and private\n    * keys.\n    *\n    * WARNING: The validity of the keys is checked, but they are assumed to have\n    * been precalculated. Whether they are an actual matching pair is NOT checked!\n    * If unsure, use `Account.fromPrivateKey(key)` instead.\n    *\n    * @param {string} publicKey - Public key of the account\n    * @param {string} privateKey - Private key of the account\n    * @param {number} [index] - Account number used when deriving the key\n    * @returns {Account} The instantiated Account object\n    */\n    static fromKeypair(privateKey, publicKey, index) {\n        Account.#isInternal = true;\n        Account.#validateKey(privateKey);\n        const account = Account.fromPublicKey(publicKey, index);\n        account.#prv = privateKey.toUpperCase();\n        return account;\n    }\n    async lock(passkey) {\n        try {\n            if (this.#prv != null) {\n                await this.#s.put(this.#pub, passkey, this.#prv);\n            }\n        }\n        catch (err) {\n            console.error(`Failed to lock account ${this.address}`, err);\n            return false;\n        }\n        this.#prv = null;\n        return true;\n    }\n    async unlock(passkey) {\n        try {\n            this.#prv = await this.#s.get(this.#pub, passkey);\n        }\n        catch (err) {\n            console.error(`Failed to unlock account ${this.address}`, err);\n            return false;\n        }\n        return true;\n    }\n    /**\n    * Validates a Nano address with 'nano' and 'xrb' prefixes\n    * Derived from https://github.com/alecrios/nano-address-validator\n    *\n    * @param {string} address - Nano address to validate\n    * @throws Error if address is undefined, not a string, or an invalid format\n    */\n    static validate(address) {\n        if (address === undefined) {\n            throw new ReferenceError('Address is undefined.');\n        }\n        if (typeof address !== 'string') {\n            throw new TypeError('Address must be a string.');\n        }\n        const pattern = new RegExp(`^(${PREFIX}|${PREFIX_LEGACY})[13]{1}[${ALPHABET}]{59}$`);\n        if (!pattern.test(address)) {\n            throw new RangeError('Invalid address format');\n        }\n        const expectedChecksum = address.slice(-8);\n        const keyBase32 = address.slice(address.indexOf('_') + 1, -8);\n        const keyBuf = base32.toBytes(keyBase32);\n        const actualChecksumBuf = new Blake2b(5).update(keyBuf).digest();\n        actualChecksumBuf.reverse();\n        const actualChecksum = bytes.toBase32(actualChecksumBuf);\n        if (expectedChecksum !== actualChecksum) {\n            throw new Error('Incorrect address checksum');\n        }\n    }\n    /**\n    * Refreshes the account from its current state on the network.\n    *\n    * A successful response sets the balance, frontier, and representative\n    * properties.\n    *\n    * @param {Rpc|string|URL} rpc - RPC node information required to call `account_info`\n    */\n    async refresh(rpc) {\n        if (typeof rpc === 'string' || rpc.constructor === URL) {\n            rpc = new Rpc(rpc);\n        }\n        if (rpc.constructor !== Rpc) {\n            throw new TypeError('RPC must be a valid node');\n        }\n        const data = {\n            \"account\": this.address,\n            \"receivable\": \"true\",\n            \"representative\": \"true\",\n            \"weight\": \"true\"\n        };\n        const { balance, frontier, receivable, representative, weight } = await rpc.call('account_info', data);\n        if (frontier == null) {\n            throw new Error('Account not found');\n        }\n        this.#b = BigInt(balance);\n        this.#f = frontier;\n        this.#r = BigInt(receivable);\n        this.#rep = Account.fromAddress(representative);\n        this.#w = BigInt(weight);\n    }\n    static #addressToKey(v) {\n        const publicKeyBytes = base32.toBytes(v.slice(-60, -8));\n        const checksumBytes = base32.toBytes(v.slice(-8));\n        const rechecksumBytes = new Blake2b(5).update(publicKeyBytes).digest().reverse();\n        if (bytes.toHex(checksumBytes) !== bytes.toHex(rechecksumBytes)) {\n            throw new Error('Checksum mismatch in address');\n        }\n        return bytes.toHex(publicKeyBytes);\n    }\n    static #keyToAddress(publicKey) {\n        const publicKeyBytes = hex.toBytes(publicKey);\n        const checksumBytes = new Blake2b(5).update(publicKeyBytes).digest().reverse();\n        const encodedPublicKey = bytes.toBase32(publicKeyBytes);\n        const encodedChecksum = bytes.toBase32(checksumBytes);\n        return `${PREFIX}${encodedPublicKey}${encodedChecksum}`;\n    }\n    static #validateKey(key) {\n        if (key === undefined) {\n            throw new TypeError(`Key is undefined`);\n        }\n        if (typeof key !== 'string') {\n            throw new TypeError(`Key must be a string`);\n        }\n        if (key.length !== ACCOUNT_KEY_LENGTH) {\n            throw new TypeError(`Key must be ${ACCOUNT_KEY_LENGTH} characters`);\n        }\n        if (!/^[0-9a-fA-F]+$/i.test(key)) {\n            throw new RangeError('Key is not a valid hexadecimal value');\n        }\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { WorkerInterface } from '../pool.js';\nexport class Bip44Ckd extends WorkerInterface {\n    static BIP44_COIN_NANO = 165;\n    static BIP44_PURPOSE = 44;\n    static HARDENED_OFFSET = 0x80000000;\n    static SLIP10_ED25519 = 'ed25519 seed';\n    static {\n        Bip44Ckd.listen();\n    }\n    static async work(data) {\n        for (const d of data) {\n            if (d.coin != null && d.coin !== this.BIP44_PURPOSE) {\n                d.privateKey = await this.ckd(d.seed, d.coin, d.index);\n            }\n            else {\n                d.privateKey = await this.nanoCKD(d.seed, d.index);\n            }\n        }\n        return data;\n    }\n    /**\n    * Derives a private child key following the BIP-32 and BIP-44 derivation path\n    * registered to the Nano block lattice. Only hardened child keys are defined.\n    *\n    * @param {string} seed - Hexadecimal seed derived from mnemonic phrase\n    * @param {number} index - Account number between 0 and 2^31-1\n    * @returns {Promise<string>} Private child key for the account\n    */\n    static async nanoCKD(seed, index) {\n        if (!Number.isSafeInteger(index) || index < 0 || index > 0x7fffffff) {\n            throw new RangeError(`Invalid child key index 0x${index.toString(16)}`);\n        }\n        return await this.ckd(seed, this.BIP44_COIN_NANO, index);\n    }\n    /**\n    * Derives a private child key for a coin by following the specified BIP-32 and\n    * BIP-44 derivation path. Purpose is always 44'. Only hardened child keys are\n    * defined.\n    *\n    * @param {string} seed - Hexadecimal seed derived from mnemonic phrase\n    * @param {number} coin - Number registered to a specific coin in SLIP-044\n    * @param {number} index - Account number between 0 and 2^31-1\n    * @returns {Promise<string>} Private child key for the account\n    */\n    static async ckd(seed, coin, index) {\n        if (seed.length < 32 || seed.length > 128) {\n            throw new RangeError(`Invalid seed length`);\n        }\n        if (!Number.isSafeInteger(index) || index < 0 || index > 0x7fffffff) {\n            throw new RangeError(`Invalid child key index 0x${index.toString(16)}`);\n        }\n        const masterKey = await this.slip10(this.SLIP10_ED25519, seed);\n        const purposeKey = await this.CKDpriv(masterKey, this.BIP44_PURPOSE + this.HARDENED_OFFSET);\n        const coinKey = await this.CKDpriv(purposeKey, coin + this.HARDENED_OFFSET);\n        const accountKey = await this.CKDpriv(coinKey, index + this.HARDENED_OFFSET);\n        const privateKey = new Uint8Array(accountKey.privateKey.buffer);\n        let hex = '';\n        for (let i = 0; i < privateKey.length; i++) {\n            hex += privateKey[i].toString(16).padStart(2, '0');\n        }\n        return hex;\n    }\n    static async slip10(curve, S) {\n        const key = new TextEncoder().encode(curve);\n        const data = new Uint8Array(64);\n        data.set(S.match(/.{1,2}/g).map(byte => parseInt(byte, 16)));\n        const I = await this.hmac(key, data);\n        const IL = new DataView(I.buffer.slice(0, I.length / 2));\n        const IR = new DataView(I.buffer.slice(I.length / 2));\n        return ({ privateKey: IL, chainCode: IR });\n    }\n    static async CKDpriv({ privateKey, chainCode }, index) {\n        const key = new Uint8Array(chainCode.buffer);\n        const data = new Uint8Array(37);\n        data.set([0]);\n        data.set(this.ser256(privateKey), 1);\n        data.set(this.ser32(index), 33);\n        const I = await this.hmac(key, data);\n        const IL = new DataView(I.buffer.slice(0, I.length / 2));\n        const IR = new DataView(I.buffer.slice(I.length / 2));\n        return ({ privateKey: IL, chainCode: IR });\n    }\n    static ser32(integer) {\n        if (typeof integer !== 'number') {\n            throw new TypeError(`Expected a number, received ${typeof integer}`);\n        }\n        if (integer > 0xffffffff) {\n            throw new RangeError(`Expected 32-bit integer, received ${integer.toString(2).length}-bit value: ${integer}`);\n        }\n        const view = new DataView(new ArrayBuffer(4));\n        view.setUint32(0, integer, false);\n        return new Uint8Array(view.buffer);\n    }\n    static ser256(integer) {\n        if (integer.constructor !== DataView) {\n            throw new TypeError(`Expected DataView, received ${typeof integer}`);\n        }\n        if (integer.byteLength > 32) {\n            throw new RangeError(`Expected 32-byte integer, received ${integer.byteLength}-byte value: ${integer}`);\n        }\n        return new Uint8Array(integer.buffer);\n    }\n    static async hmac(key, data) {\n        const { subtle } = globalThis.crypto;\n        const pk = await subtle.importKey('raw', key, { name: 'HMAC', hash: 'SHA-512' }, false, ['sign']);\n        const signature = await subtle.sign('HMAC', pk, data);\n        return new Uint8Array(signature);\n    }\n}\nexport default `\n\tconst WorkerInterface = ${WorkerInterface}\n\tconst Bip44Ckd = ${Bip44Ckd}\n`;\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n// Based on nano-webgl-pow by Ben Green (numtel) <ben@latenightsketches.com>\n// https://github.com/numtel/nano-webgl-pow\nimport { WorkerInterface } from '../pool.js';\nexport class Pow extends WorkerInterface {\n    static {\n        Pow.listen();\n    }\n    /**\n    * Calculates proof-of-work as described by the Nano cryptocurrency protocol.\n    *\n    * @param {any[]} data - Array of hashes and minimum thresholds\n    * @returns Promise for proof-of-work attached to original array objects\n    */\n    static async work(data) {\n        return new Promise(async (resolve, reject) => {\n            for (const d of data) {\n                try {\n                    d.work = await this.find(d.hash, d.threshold);\n                }\n                catch (err) {\n                    reject(err);\n                }\n            }\n            resolve(data);\n        });\n    }\n    /**\n    * Finds a nonce that satisfies the Nano proof-of-work requirements.\n    *\n    * @param {string} hashHex - Hexadecimal hash of previous block, or public key for new accounts\n    * @param {number} [threshold=0xfffffff8] - Difficulty of proof-of-work calculation\n    */\n    static async find(hash, threshold = 0xfffffff8) {\n        return new Promise(resolve => {\n            this.#calculate(hash, resolve, threshold);\n        });\n    }\n    // Vertex Shader\n    static #vsSource = `#version 300 es\n#pragma vscode_glsllint_stage: vert\nprecision highp float;\nlayout (location=0) in vec4 position;\nlayout (location=1) in vec2 uv;\n\nout vec2 uv_pos;\n\nvoid main() {\n\tuv_pos = uv;\n\tgl_Position = position;\n}`;\n    // Fragment shader\n    static #fsSource = `#version 300 es\n#pragma vscode_glsllint_stage: frag\nprecision highp float;\nprecision highp int;\n\nin vec2 uv_pos;\nout vec4 fragColor;\n\n// blockhash - array of precalculated block hash components\n// threshold - 0xfffffff8 for send/change blocks, 0xfffffe00 for all else\n// workload - Defines canvas size\nlayout(std140) uniform UBO {\n\tuint blockhash[8];\n\tuint threshold;\n\tfloat workload;\n};\n\n// Random work values\n// First 2 bytes will be overwritten by texture pixel position\n// Second 2 bytes will be modified if the canvas size is greater than 256x256\n// Last 4 bytes remain as generated externally\nlayout(std140) uniform WORK {\n\tuvec4 work[2];\n};\n\n// Defined separately from uint v[32] below as the original value is required\n// to calculate the second uint32 of the digest for threshold comparison\n#define BLAKE2B_IV32_1 0x6A09E667u\n\n// Both buffers represent 16 uint64s as 32 uint32s\n// because that's what GLSL offers, just like Javascript\n\n// Compression buffer, intialized to 2 instances of the initialization vector\n// The following values have been modified from the BLAKE2B_IV:\n// OUTLEN is constant 8 bytes\n// v[0] ^= 0x01010000u ^ uint(OUTLEN);\n// INLEN is constant 40 bytes: work value (8) + block hash (32)\n// v[24] ^= uint(INLEN);\n// It's always the \"last\" compression at this INLEN\n// v[28] = ~v[28];\n// v[29] = ~v[29];\nuint v[32] = uint[32](\n\t0xF2BDC900u, 0x6A09E667u, 0x84CAA73Bu, 0xBB67AE85u,\n\t0xFE94F82Bu, 0x3C6EF372u, 0x5F1D36F1u, 0xA54FF53Au,\n\t0xADE682D1u, 0x510E527Fu, 0x2B3E6C1Fu, 0x9B05688Cu,\n\t0xFB41BD6Bu, 0x1F83D9ABu, 0x137E2179u, 0x5BE0CD19u,\n\t0xF3BCC908u, 0x6A09E667u, 0x84CAA73Bu, 0xBB67AE85u,\n\t0xFE94F82Bu, 0x3C6EF372u, 0x5F1D36F1u, 0xA54FF53Au,\n\t0xADE682F9u, 0x510E527Fu, 0x2B3E6C1Fu, 0x9B05688Cu,\n\t0x04BE4294u, 0xE07C2654u, 0x137E2179u, 0x5BE0CD19u\n);\n// Input data buffer\nuint m[32];\n\n// These are offsets into the input data buffer for each mixing step.\n// They are multiplied by 2 from the original SIGMA values in\n// the C reference implementation, which refered to uint64s.\nconst int SIGMA82[192] = int[192](\n\t0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,\n\t28,20,8,16,18,30,26,12,2,24,0,4,22,14,10,6,\n\t22,16,24,0,10,4,30,26,20,28,6,12,14,2,18,8,\n\t14,18,6,2,26,24,22,28,4,12,10,20,8,0,30,16,\n\t18,0,10,14,4,8,20,30,28,2,22,24,12,16,6,26,\n\t4,24,12,20,0,22,16,6,8,26,14,10,30,28,2,18,\n\t24,10,2,30,28,26,8,20,0,14,12,6,18,4,16,22,\n\t26,22,14,28,24,2,6,18,10,0,30,8,16,12,4,20,\n\t12,30,28,18,22,6,0,16,24,4,26,14,2,8,20,10,\n\t20,4,16,8,14,12,2,10,30,22,18,28,6,24,26,0,\n\t0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,\n\t28,20,8,16,18,30,26,12,2,24,0,4,22,14,10,6\n);\n\n// 64-bit unsigned addition within the compression buffer\n// Sets v[a,a+1] += b\n// b0 is the low 32 bits of b, b1 represents the high 32 bits\nvoid add_uint64 (int a, uint b0, uint b1) {\n\tuint o0 = v[a] + b0;\n\tuint o1 = v[a + 1] + b1;\n\tif (v[a] > 0xFFFFFFFFu - b0) { // did low 32 bits overflow?\n\t\to1++;\n\t}\n\tv[a] = o0;\n\tv[a + 1] = o1;\n}\n\n// G Mixing function\nvoid B2B_G (int a, int b, int c, int d, int ix, int iy) {\n\tadd_uint64(a, v[b], v[b+1]);\n\tadd_uint64(a, m[ix], m[ix + 1]);\n\n\t// v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated to the right by 32 bits\n\tuint xor0 = v[d] ^ v[a];\n\tuint xor1 = v[d + 1] ^ v[a + 1];\n\tv[d] = xor1;\n\tv[d + 1] = xor0;\n\n\tadd_uint64(c, v[d], v[d+1]);\n\n\t// v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 24 bits\n\txor0 = v[b] ^ v[c];\n\txor1 = v[b + 1] ^ v[c + 1];\n\tv[b] = (xor0 >> 24) ^ (xor1 << 8);\n\tv[b + 1] = (xor1 >> 24) ^ (xor0 << 8);\n\n\tadd_uint64(a, v[b], v[b+1]);\n\tadd_uint64(a, m[iy], m[iy + 1]);\n\n\t// v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated right by 16 bits\n\txor0 = v[d] ^ v[a];\n\txor1 = v[d + 1] ^ v[a + 1];\n\tv[d] = (xor0 >> 16) ^ (xor1 << 16);\n\tv[d + 1] = (xor1 >> 16) ^ (xor0 << 16);\n\n\tadd_uint64(c, v[d], v[d+1]);\n\n\t// v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 63 bits\n\txor0 = v[b] ^ v[c];\n\txor1 = v[b + 1] ^ v[c + 1];\n\tv[b] = (xor1 >> 31) ^ (xor0 << 1);\n\tv[b + 1] = (xor0 >> 31) ^ (xor1 << 1);\n}\n\nvoid main() {\n\tint i;\n\tuvec4 u_work0 = work[0];\n\tuvec4 u_work1 = work[1];\n\tuint uv_x = uint(uv_pos.x * workload);\n\tuint uv_y = uint(uv_pos.y * workload);\n\tuint x_pos = uv_x % 256u;\n\tuint y_pos = uv_y % 256u;\n\tuint x_index = (uv_x - x_pos) / 256u;\n\tuint y_index = (uv_y - y_pos) / 256u;\n\n\t// First 2 work bytes are the x,y pos within the 256x256 area, the next\n\t// two bytes are modified from the random generated value, XOR'd with\n\t// the x,y area index of where this pixel is located\n\tm[0] = (x_pos ^ (y_pos << 8) ^ ((u_work0.b ^ x_index) << 16) ^ ((u_work0.a ^ y_index) << 24));\n\n\t// Remaining bytes are un-modified from the random generated value\n\tm[1] = (u_work1.r ^ (u_work1.g << 8) ^ (u_work1.b << 16) ^ (u_work1.a << 24));\n\n\t// Block hash\n\tfor (i=0;i<8;i++) {\n\t\tm[i+2] = blockhash[i];\n\t}\n\n\t// twelve rounds of mixing\n\tfor(i=0;i<12;i++) {\n\t\tB2B_G(0, 8, 16, 24, SIGMA82[i * 16 + 0], SIGMA82[i * 16 + 1]);\n\t\tB2B_G(2, 10, 18, 26, SIGMA82[i * 16 + 2], SIGMA82[i * 16 + 3]);\n\t\tB2B_G(4, 12, 20, 28, SIGMA82[i * 16 + 4], SIGMA82[i * 16 + 5]);\n\t\tB2B_G(6, 14, 22, 30, SIGMA82[i * 16 + 6], SIGMA82[i * 16 + 7]);\n\t\tB2B_G(0, 10, 20, 30, SIGMA82[i * 16 + 8], SIGMA82[i * 16 + 9]);\n\t\tB2B_G(2, 12, 22, 24, SIGMA82[i * 16 + 10], SIGMA82[i * 16 + 11]);\n\t\tB2B_G(4, 14, 16, 26, SIGMA82[i * 16 + 12], SIGMA82[i * 16 + 13]);\n\t\tB2B_G(6, 8, 18, 28, SIGMA82[i * 16 + 14], SIGMA82[i * 16 + 15]);\n\t}\n\n\t// Pixel data is multipled by threshold test result (0 or 1)\n\t// First 4 bytes insignificant, only calculate digest of second 4 bytes\n\tif ((BLAKE2B_IV32_1 ^ v[1] ^ v[17]) > threshold) {\n\t\tfragColor = vec4(\n\t\t\tfloat(x_index + 1u)/255., // +1 to distinguish from 0 (unsuccessful) pixels\n\t\t\tfloat(y_index + 1u)/255., // Same as previous\n\t\t\tfloat(x_pos)/255., // Return the 2 custom bytes used in work value\n\t\t\tfloat(y_pos)/255.  // Second custom byte\n\t\t);\n\t} else {\n \t\tdiscard;\n\t}\n}`;\n    /** Used to set canvas size. Must be a multiple of 256. */\n    static #WORKLOAD = 256 * Math.max(1, Math.floor(navigator.hardwareConcurrency));\n    static #hexify(arr) {\n        let out = '';\n        for (let i = arr.length - 1; i >= 0; i--) {\n            out += arr[i].toString(16).padStart(2, '0');\n        }\n        return out;\n    }\n    static #gl;\n    static #program;\n    static #vertexShader;\n    static #fragmentShader;\n    static #positionBuffer;\n    static #uvBuffer;\n    static #uboBuffer;\n    static #workBuffer;\n    static #query;\n    static #pixels;\n    // Vertex Positions, 2 triangles\n    static #positions = new Float32Array([\n        -1, -1, 0, -1, 1, 0, 1, 1, 0,\n        1, -1, 0, 1, 1, 0, -1, -1, 0\n    ]);\n    // Texture Positions\n    static #uvPosArray = new Float32Array([\n        1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1\n    ]);\n    // Compile\n    static {\n        this.#gl = new OffscreenCanvas(this.#WORKLOAD, this.#WORKLOAD).getContext('webgl2');\n        if (this.#gl == null)\n            throw new Error('WebGL 2 is required');\n        this.#gl.clearColor(0, 0, 0, 1);\n        this.#program = this.#gl.createProgram();\n        if (this.#program == null)\n            throw new Error('Failed to create shader program');\n        this.#vertexShader = this.#gl.createShader(this.#gl.VERTEX_SHADER);\n        if (this.#vertexShader == null)\n            throw new Error('Failed to create vertex shader');\n        this.#gl.shaderSource(this.#vertexShader, this.#vsSource);\n        this.#gl.compileShader(this.#vertexShader);\n        if (!this.#gl.getShaderParameter(this.#vertexShader, this.#gl.COMPILE_STATUS))\n            throw new Error(this.#gl.getShaderInfoLog(this.#vertexShader) ?? `Failed to compile vertex shader`);\n        this.#fragmentShader = this.#gl.createShader(this.#gl.FRAGMENT_SHADER);\n        if (this.#fragmentShader == null)\n            throw new Error('Failed to create fragment shader');\n        this.#gl.shaderSource(this.#fragmentShader, this.#fsSource);\n        this.#gl.compileShader(this.#fragmentShader);\n        if (!this.#gl.getShaderParameter(this.#fragmentShader, this.#gl.COMPILE_STATUS))\n            throw new Error(this.#gl.getShaderInfoLog(this.#fragmentShader) ?? `Failed to compile fragment shader`);\n        this.#gl.attachShader(this.#program, this.#vertexShader);\n        this.#gl.attachShader(this.#program, this.#fragmentShader);\n        this.#gl.linkProgram(this.#program);\n        if (!this.#gl.getProgramParameter(this.#program, this.#gl.LINK_STATUS))\n            throw new Error(this.#gl.getProgramInfoLog(this.#program) ?? `Failed to link program`);\n        // Construct simple 2D geometry\n        this.#gl.useProgram(this.#program);\n        const triangleArray = this.#gl.createVertexArray();\n        this.#gl.bindVertexArray(triangleArray);\n        this.#positionBuffer = this.#gl.createBuffer();\n        this.#gl.bindBuffer(this.#gl.ARRAY_BUFFER, this.#positionBuffer);\n        this.#gl.bufferData(this.#gl.ARRAY_BUFFER, this.#positions, this.#gl.STATIC_DRAW);\n        this.#gl.vertexAttribPointer(0, 3, this.#gl.FLOAT, false, 0, 0);\n        this.#gl.enableVertexAttribArray(0);\n        this.#uvBuffer = this.#gl.createBuffer();\n        this.#gl.bindBuffer(this.#gl.ARRAY_BUFFER, this.#uvBuffer);\n        this.#gl.bufferData(this.#gl.ARRAY_BUFFER, this.#uvPosArray, this.#gl.STATIC_DRAW);\n        this.#gl.vertexAttribPointer(1, 2, this.#gl.FLOAT, false, 0, 0);\n        this.#gl.enableVertexAttribArray(1);\n        this.#uboBuffer = this.#gl.createBuffer();\n        this.#gl.bindBuffer(this.#gl.UNIFORM_BUFFER, this.#uboBuffer);\n        this.#gl.bufferData(this.#gl.UNIFORM_BUFFER, 144, this.#gl.DYNAMIC_DRAW);\n        this.#gl.bindBuffer(this.#gl.UNIFORM_BUFFER, null);\n        this.#gl.bindBufferBase(this.#gl.UNIFORM_BUFFER, 0, this.#uboBuffer);\n        this.#gl.uniformBlockBinding(this.#program, this.#gl.getUniformBlockIndex(this.#program, 'UBO'), 0);\n        this.#workBuffer = this.#gl.createBuffer();\n        this.#gl.bindBuffer(this.#gl.UNIFORM_BUFFER, this.#workBuffer);\n        this.#gl.bufferData(this.#gl.UNIFORM_BUFFER, 32, this.#gl.STREAM_DRAW);\n        this.#gl.bindBuffer(this.#gl.UNIFORM_BUFFER, null);\n        this.#gl.bindBufferBase(this.#gl.UNIFORM_BUFFER, 1, this.#workBuffer);\n        this.#gl.uniformBlockBinding(this.#program, this.#gl.getUniformBlockIndex(this.#program, 'WORK'), 1);\n        this.#pixels = new Uint8Array(this.#gl.drawingBufferWidth * this.#gl.drawingBufferHeight * 4);\n        this.#query = this.#gl.createQuery();\n    }\n    static #calculate(hashHex, callback, threshold) {\n        if (Pow.#gl == null)\n            throw new Error('WebGL 2 is required');\n        if (!/^[A-F-a-f0-9]{64}$/.test(hashHex))\n            throw new Error(`invalid_hash ${hashHex}`);\n        if (typeof threshold !== 'number')\n            throw new TypeError(`Invalid threshold ${threshold}`);\n        if (this.#gl == null)\n            throw new Error('WebGL 2 is required');\n        // Set up uniform buffer object\n        const uboView = new DataView(new ArrayBuffer(144));\n        for (let i = 0; i < 64; i += 8) {\n            const uint32 = hashHex.slice(i, i + 8);\n            uboView.setUint32(i * 2, parseInt(uint32, 16));\n        }\n        uboView.setUint32(128, threshold, true);\n        uboView.setFloat32(132, Pow.#WORKLOAD - 1, true);\n        Pow.#gl.bindBuffer(Pow.#gl.UNIFORM_BUFFER, Pow.#uboBuffer);\n        Pow.#gl.bufferSubData(Pow.#gl.UNIFORM_BUFFER, 0, uboView);\n        Pow.#gl.bindBuffer(Pow.#gl.UNIFORM_BUFFER, null);\n        // Draw output until success or progressCallback says to stop\n        const work = new Uint8Array(8);\n        const draw = () => {\n            if (Pow.#gl == null)\n                throw new Error('WebGL 2 is required');\n            if (Pow.#query == null)\n                throw new Error('WebGL 2 is required to run queries');\n            Pow.#gl.clear(Pow.#gl.COLOR_BUFFER_BIT);\n            // Upload work buffer\n            crypto.getRandomValues(work);\n            Pow.#gl.bindBuffer(Pow.#gl.UNIFORM_BUFFER, Pow.#workBuffer);\n            Pow.#gl.bufferSubData(Pow.#gl.UNIFORM_BUFFER, 0, Uint32Array.from(work));\n            Pow.#gl.bindBuffer(Pow.#gl.UNIFORM_BUFFER, null);\n            Pow.#gl.beginQuery(Pow.#gl.ANY_SAMPLES_PASSED_CONSERVATIVE, Pow.#query);\n            Pow.#gl.drawArrays(Pow.#gl.TRIANGLES, 0, 6);\n            Pow.#gl.endQuery(Pow.#gl.ANY_SAMPLES_PASSED_CONSERVATIVE);\n            requestAnimationFrame(checkQueryResult);\n        };\n        function checkQueryResult() {\n            if (Pow.#gl == null)\n                throw new Error('WebGL 2 is required to check query results');\n            if (Pow.#query == null)\n                throw new Error('Query not found');\n            if (Pow.#gl.getQueryParameter(Pow.#query, Pow.#gl.QUERY_RESULT_AVAILABLE)) {\n                const anySamplesPassed = Pow.#gl.getQueryParameter(Pow.#query, Pow.#gl.QUERY_RESULT);\n                if (anySamplesPassed) {\n                    // A valid nonce was found\n                    readBackResult();\n                }\n                else {\n                    // No valid nonce found, start the next draw call\n                    requestAnimationFrame(draw);\n                }\n            }\n            else {\n                // Query result not yet available, check again in the next frame\n                requestAnimationFrame(checkQueryResult);\n            }\n        }\n        function readBackResult() {\n            if (Pow.#gl == null)\n                throw new Error('WebGL 2 is required to check read results');\n            Pow.#gl.readPixels(0, 0, Pow.#gl.drawingBufferWidth, Pow.#gl.drawingBufferHeight, Pow.#gl.RGBA, Pow.#gl.UNSIGNED_BYTE, Pow.#pixels);\n            // Check the pixels for any success\n            for (let i = 0; i < Pow.#pixels.length; i += 4) {\n                if (Pow.#pixels[i] !== 0) {\n                    const hex = Pow.#hexify(work.subarray(4, 8)) + Pow.#hexify([\n                        Pow.#pixels[i + 2],\n                        Pow.#pixels[i + 3],\n                        work[2] ^ (Pow.#pixels[i] - 1),\n                        work[3] ^ (Pow.#pixels[i + 1] - 1)\n                    ]);\n                    // Return the work value with the custom bits\n                    typeof callback === 'function' && callback(hex);\n                    return;\n                }\n            }\n        }\n        draw();\n    }\n}\nexport default `\n\tconst WorkerInterface = ${WorkerInterface}\n\tconst Pow = ${Pow}\n`;\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { default as Bip44Ckd } from './workers/bip44-ckd.js';\nimport { default as NanoNaCl } from './workers/nano-nacl.js';\nimport { default as Pow } from './workers/powgl.js';\nexport { Bip44Ckd, NanoNaCl, Pow };\n", "// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n  ? R.apply\n  : function ReflectApply(target, receiver, args) {\n    return Function.prototype.apply.call(target, receiver, args);\n  }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n  ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target)\n      .concat(Object.getOwnPropertySymbols(target));\n  };\n} else {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target);\n  };\n}\n\nfunction ProcessEmitWarning(warning) {\n  if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n  return value !== value;\n}\n\nfunction EventEmitter() {\n  EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n  if (typeof listener !== 'function') {\n    throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n  }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n  enumerable: true,\n  get: function() {\n    return defaultMaxListeners;\n  },\n  set: function(arg) {\n    if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n      throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n    }\n    defaultMaxListeners = arg;\n  }\n});\n\nEventEmitter.init = function() {\n\n  if (this._events === undefined ||\n      this._events === Object.getPrototypeOf(this)._events) {\n    this._events = Object.create(null);\n    this._eventsCount = 0;\n  }\n\n  this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n  if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n    throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n  }\n  this._maxListeners = n;\n  return this;\n};\n\nfunction _getMaxListeners(that) {\n  if (that._maxListeners === undefined)\n    return EventEmitter.defaultMaxListeners;\n  return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n  return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n  var args = [];\n  for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n  var doError = (type === 'error');\n\n  var events = this._events;\n  if (events !== undefined)\n    doError = (doError && events.error === undefined);\n  else if (!doError)\n    return false;\n\n  // If there is no 'error' event listener then throw.\n  if (doError) {\n    var er;\n    if (args.length > 0)\n      er = args[0];\n    if (er instanceof Error) {\n      // Note: The comments on the `throw` lines are intentional, they show\n      // up in Node's output if this results in an unhandled exception.\n      throw er; // Unhandled 'error' event\n    }\n    // At least give some kind of context to the user\n    var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n    err.context = er;\n    throw err; // Unhandled 'error' event\n  }\n\n  var handler = events[type];\n\n  if (handler === undefined)\n    return false;\n\n  if (typeof handler === 'function') {\n    ReflectApply(handler, this, args);\n  } else {\n    var len = handler.length;\n    var listeners = arrayClone(handler, len);\n    for (var i = 0; i < len; ++i)\n      ReflectApply(listeners[i], this, args);\n  }\n\n  return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n  var m;\n  var events;\n  var existing;\n\n  checkListener(listener);\n\n  events = target._events;\n  if (events === undefined) {\n    events = target._events = Object.create(null);\n    target._eventsCount = 0;\n  } else {\n    // To avoid recursion in the case that type === \"newListener\"! Before\n    // adding it to the listeners, first emit \"newListener\".\n    if (events.newListener !== undefined) {\n      target.emit('newListener', type,\n                  listener.listener ? listener.listener : listener);\n\n      // Re-assign `events` because a newListener handler could have caused the\n      // this._events to be assigned to a new object\n      events = target._events;\n    }\n    existing = events[type];\n  }\n\n  if (existing === undefined) {\n    // Optimize the case of one listener. Don't need the extra array object.\n    existing = events[type] = listener;\n    ++target._eventsCount;\n  } else {\n    if (typeof existing === 'function') {\n      // Adding the second element, need to change to array.\n      existing = events[type] =\n        prepend ? [listener, existing] : [existing, listener];\n      // If we've already got an array, just append.\n    } else if (prepend) {\n      existing.unshift(listener);\n    } else {\n      existing.push(listener);\n    }\n\n    // Check for listener leak\n    m = _getMaxListeners(target);\n    if (m > 0 && existing.length > m && !existing.warned) {\n      existing.warned = true;\n      // No error code for this since it is a Warning\n      // eslint-disable-next-line no-restricted-syntax\n      var w = new Error('Possible EventEmitter memory leak detected. ' +\n                          existing.length + ' ' + String(type) + ' listeners ' +\n                          'added. Use emitter.setMaxListeners() to ' +\n                          'increase limit');\n      w.name = 'MaxListenersExceededWarning';\n      w.emitter = target;\n      w.type = type;\n      w.count = existing.length;\n      ProcessEmitWarning(w);\n    }\n  }\n\n  return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n  return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n    function prependListener(type, listener) {\n      return _addListener(this, type, listener, true);\n    };\n\nfunction onceWrapper() {\n  if (!this.fired) {\n    this.target.removeListener(this.type, this.wrapFn);\n    this.fired = true;\n    if (arguments.length === 0)\n      return this.listener.call(this.target);\n    return this.listener.apply(this.target, arguments);\n  }\n}\n\nfunction _onceWrap(target, type, listener) {\n  var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n  var wrapped = onceWrapper.bind(state);\n  wrapped.listener = listener;\n  state.wrapFn = wrapped;\n  return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n  checkListener(listener);\n  this.on(type, _onceWrap(this, type, listener));\n  return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n    function prependOnceListener(type, listener) {\n      checkListener(listener);\n      this.prependListener(type, _onceWrap(this, type, listener));\n      return this;\n    };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n    function removeListener(type, listener) {\n      var list, events, position, i, originalListener;\n\n      checkListener(listener);\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      list = events[type];\n      if (list === undefined)\n        return this;\n\n      if (list === listener || list.listener === listener) {\n        if (--this._eventsCount === 0)\n          this._events = Object.create(null);\n        else {\n          delete events[type];\n          if (events.removeListener)\n            this.emit('removeListener', type, list.listener || listener);\n        }\n      } else if (typeof list !== 'function') {\n        position = -1;\n\n        for (i = list.length - 1; i >= 0; i--) {\n          if (list[i] === listener || list[i].listener === listener) {\n            originalListener = list[i].listener;\n            position = i;\n            break;\n          }\n        }\n\n        if (position < 0)\n          return this;\n\n        if (position === 0)\n          list.shift();\n        else {\n          spliceOne(list, position);\n        }\n\n        if (list.length === 1)\n          events[type] = list[0];\n\n        if (events.removeListener !== undefined)\n          this.emit('removeListener', type, originalListener || listener);\n      }\n\n      return this;\n    };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n    function removeAllListeners(type) {\n      var listeners, events, i;\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      // not listening for removeListener, no need to emit\n      if (events.removeListener === undefined) {\n        if (arguments.length === 0) {\n          this._events = Object.create(null);\n          this._eventsCount = 0;\n        } else if (events[type] !== undefined) {\n          if (--this._eventsCount === 0)\n            this._events = Object.create(null);\n          else\n            delete events[type];\n        }\n        return this;\n      }\n\n      // emit removeListener for all listeners on all events\n      if (arguments.length === 0) {\n        var keys = Object.keys(events);\n        var key;\n        for (i = 0; i < keys.length; ++i) {\n          key = keys[i];\n          if (key === 'removeListener') continue;\n          this.removeAllListeners(key);\n        }\n        this.removeAllListeners('removeListener');\n        this._events = Object.create(null);\n        this._eventsCount = 0;\n        return this;\n      }\n\n      listeners = events[type];\n\n      if (typeof listeners === 'function') {\n        this.removeListener(type, listeners);\n      } else if (listeners !== undefined) {\n        // LIFO order\n        for (i = listeners.length - 1; i >= 0; i--) {\n          this.removeListener(type, listeners[i]);\n        }\n      }\n\n      return this;\n    };\n\nfunction _listeners(target, type, unwrap) {\n  var events = target._events;\n\n  if (events === undefined)\n    return [];\n\n  var evlistener = events[type];\n  if (evlistener === undefined)\n    return [];\n\n  if (typeof evlistener === 'function')\n    return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n  return unwrap ?\n    unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n  return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n  return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n  if (typeof emitter.listenerCount === 'function') {\n    return emitter.listenerCount(type);\n  } else {\n    return listenerCount.call(emitter, type);\n  }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n  var events = this._events;\n\n  if (events !== undefined) {\n    var evlistener = events[type];\n\n    if (typeof evlistener === 'function') {\n      return 1;\n    } else if (evlistener !== undefined) {\n      return evlistener.length;\n    }\n  }\n\n  return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n  return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n  var copy = new Array(n);\n  for (var i = 0; i < n; ++i)\n    copy[i] = arr[i];\n  return copy;\n}\n\nfunction spliceOne(list, index) {\n  for (; index + 1 < list.length; index++)\n    list[index] = list[index + 1];\n  list.pop();\n}\n\nfunction unwrapListeners(arr) {\n  var ret = new Array(arr.length);\n  for (var i = 0; i < ret.length; ++i) {\n    ret[i] = arr[i].listener || arr[i];\n  }\n  return ret;\n}\n\nfunction once(emitter, name) {\n  return new Promise(function (resolve, reject) {\n    function errorListener(err) {\n      emitter.removeListener(name, resolver);\n      reject(err);\n    }\n\n    function resolver() {\n      if (typeof emitter.removeListener === 'function') {\n        emitter.removeListener('error', errorListener);\n      }\n      resolve([].slice.call(arguments));\n    };\n\n    eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n    if (name !== 'error') {\n      addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n    }\n  });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n  if (typeof emitter.on === 'function') {\n    eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n  }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n  if (typeof emitter.on === 'function') {\n    if (flags.once) {\n      emitter.once(name, listener);\n    } else {\n      emitter.on(name, listener);\n    }\n  } else if (typeof emitter.addEventListener === 'function') {\n    // EventTarget does not have `error` event semantics like Node\n    // EventEmitters, we do not listen for `error` events here.\n    emitter.addEventListener(name, function wrapListener(arg) {\n      // IE does not have builtin `{ once: true }` support so we\n      // have to do it manually.\n      if (flags.once) {\n        emitter.removeEventListener(name, wrapListener);\n      }\n      listener(arg);\n    });\n  } else {\n    throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n  }\n}\n", "/* eslint-disable no-continue */\n/* eslint-disable no-unused-vars */\n/* eslint-disable no-param-reassign */\n/* eslint-disable no-prototype-builtins */\n\nconst errorClasses = {};\nconst deserializers = {};\n\nexport const addCustomErrorDeserializer = (name: string, deserializer: (obj: any) => any): void => {\n  deserializers[name] = deserializer;\n};\n\nexport interface LedgerErrorConstructor<F extends { [key: string]: unknown }>\n  extends ErrorConstructor {\n  new (message?: string, fields?: F, options?: any): Error;\n  (message?: string, fields?: F, options?: any): Error;\n  readonly prototype: Error;\n}\n\nexport const createCustomErrorClass = <\n  F extends { [key: string]: unknown },\n  T extends LedgerErrorConstructor<F> = LedgerErrorConstructor<F>,\n>(\n  name: string,\n): T => {\n  class CustomErrorClass extends Error {\n    cause?: Error;\n    constructor(message?: string, fields?: F, options?: any) {\n      // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n      // @ts-ignore\n      super(message || name, options);\n      // Set the prototype explicitly. See https://github.com/Microsoft/TypeScript/wiki/Breaking-Changes#extending-built-ins-like-error-array-and-map-may-no-longer-work\n      Object.setPrototypeOf(this, CustomErrorClass.prototype);\n      this.name = name;\n      if (fields) {\n        for (const k in fields) {\n          // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n          // @ts-ignore\n          this[k] = fields[k];\n        }\n      }\n      if (options && isObject(options) && \"cause\" in options && !(\"cause\" in this)) {\n        // .cause was specified but the superconstructor\n        // did not create an instance property.\n        const cause = options.cause;\n        this.cause = cause;\n        if (\"stack\" in cause) {\n          this.stack = this.stack + \"\\nCAUSE: \" + cause.stack;\n        }\n      }\n    }\n  }\n\n  errorClasses[name] = CustomErrorClass;\n\n  return CustomErrorClass as unknown as T;\n};\n\nfunction isObject(value) {\n  return typeof value === \"object\";\n}\n\n// inspired from https://github.com/programble/errio/blob/master/index.js\nexport const deserializeError = (object: any): Error | undefined => {\n  if (object && typeof object === \"object\") {\n    try {\n      if (typeof object.message === \"string\") {\n        const msg = JSON.parse(object.message);\n        if (msg.message && msg.name) {\n          object = msg;\n        }\n      }\n    } catch (e) {\n      // nothing\n    }\n\n    let error;\n    if (typeof object.name === \"string\") {\n      const { name } = object;\n      const des = deserializers[name];\n      if (des) {\n        error = des(object);\n      } else {\n        let constructor = name === \"Error\" ? Error : errorClasses[name];\n\n        if (!constructor) {\n          console.warn(\"deserializing an unknown class '\" + name + \"'\");\n          constructor = createCustomErrorClass(name);\n        }\n\n        error = Object.create(constructor.prototype);\n        try {\n          for (const prop in object) {\n            if (object.hasOwnProperty(prop)) {\n              error[prop] = object[prop];\n            }\n          }\n        } catch (e) {\n          // sometimes setting a property can fail (e.g. .name)\n        }\n      }\n    } else {\n      if (typeof object.message === \"string\") {\n        error = new Error(object.message);\n      }\n    }\n\n    if (error && !error.stack && Error.captureStackTrace) {\n      Error.captureStackTrace(error, deserializeError);\n    }\n    return error;\n  }\n  return new Error(String(object));\n};\n\n// inspired from https://github.com/sindresorhus/serialize-error/blob/master/index.js\nexport const serializeError = (\n  value: undefined | To | string | (() => unknown),\n): undefined | To | string => {\n  if (!value) return value;\n  if (typeof value === \"object\") {\n    return destroyCircular(value, []);\n  }\n  if (typeof value === \"function\") {\n    return `[Function: ${value.name || \"anonymous\"}]`;\n  }\n  return value;\n};\n\ninterface To {\n  name?: string;\n  message?: string;\n  stack?: string;\n}\n\n// https://www.npmjs.com/package/destroy-circular\nfunction destroyCircular(from: To, seen: Array<To>): To {\n  const to: To = {};\n  seen.push(from);\n  for (const key of Object.keys(from)) {\n    const value = from[key];\n    if (typeof value === \"function\") {\n      continue;\n    }\n    if (!value || typeof value !== \"object\") {\n      to[key] = value;\n      continue;\n    }\n    if (seen.indexOf(from[key]) === -1) {\n      to[key] = destroyCircular(from[key], seen.slice(0));\n      continue;\n    }\n    to[key] = \"[Circular]\";\n  }\n  if (typeof from.name === \"string\") {\n    to.name = from.name;\n  }\n  if (typeof from.message === \"string\") {\n    to.message = from.message;\n  }\n  if (typeof from.stack === \"string\") {\n    to.stack = from.stack;\n  }\n  return to;\n}\n", "import {\n  serializeError,\n  deserializeError,\n  createCustomErrorClass,\n  addCustomErrorDeserializer,\n  LedgerErrorConstructor,\n} from \"./helpers\";\n\nexport { serializeError, deserializeError, createCustomErrorClass, addCustomErrorDeserializer };\n\nexport const AccountNameRequiredError = createCustomErrorClass(\"AccountNameRequired\");\nexport const AccountNotSupported = createCustomErrorClass(\"AccountNotSupported\");\nexport const AccountAwaitingSendPendingOperations = createCustomErrorClass(\n  \"AccountAwaitingSendPendingOperations\",\n);\nexport const AmountRequired = createCustomErrorClass(\"AmountRequired\");\nexport const BluetoothRequired = createCustomErrorClass(\"BluetoothRequired\");\nexport const BtcUnmatchedApp = createCustomErrorClass(\"BtcUnmatchedApp\");\nexport const CantOpenDevice = createCustomErrorClass(\"CantOpenDevice\");\nexport const CashAddrNotSupported = createCustomErrorClass(\"CashAddrNotSupported\");\nexport const ClaimRewardsFeesWarning = createCustomErrorClass(\"ClaimRewardsFeesWarning\");\nexport const CurrencyNotSupported = createCustomErrorClass<\n  { currencyName: string },\n  LedgerErrorConstructor<{ currencyName: string }>\n>(\"CurrencyNotSupported\");\nexport const DeviceAppVerifyNotSupported = createCustomErrorClass(\"DeviceAppVerifyNotSupported\");\nexport const DeviceGenuineSocketEarlyClose = createCustomErrorClass(\n  \"DeviceGenuineSocketEarlyClose\",\n);\nexport const DeviceNotGenuineError = createCustomErrorClass(\"DeviceNotGenuine\");\nexport const DeviceOnDashboardExpected = createCustomErrorClass(\"DeviceOnDashboardExpected\");\nexport const DeviceOnDashboardUnexpected = createCustomErrorClass(\"DeviceOnDashboardUnexpected\");\nexport const DeviceInOSUExpected = createCustomErrorClass(\"DeviceInOSUExpected\");\nexport const DeviceHalted = createCustomErrorClass(\"DeviceHalted\");\nexport const DeviceNameInvalid = createCustomErrorClass(\"DeviceNameInvalid\");\nexport const DeviceSocketFail = createCustomErrorClass(\"DeviceSocketFail\");\nexport const DeviceSocketNoBulkStatus = createCustomErrorClass(\"DeviceSocketNoBulkStatus\");\nexport const DeviceNeedsRestart = createCustomErrorClass(\"DeviceSocketNoBulkStatus\");\nexport const UnresponsiveDeviceError = createCustomErrorClass(\"UnresponsiveDeviceError\");\nexport const DisconnectedDevice = createCustomErrorClass(\"DisconnectedDevice\");\nexport const DisconnectedDeviceDuringOperation = createCustomErrorClass(\n  \"DisconnectedDeviceDuringOperation\",\n);\nexport const DeviceExtractOnboardingStateError = createCustomErrorClass(\n  \"DeviceExtractOnboardingStateError\",\n);\nexport const DeviceOnboardingStatePollingError = createCustomErrorClass(\n  \"DeviceOnboardingStatePollingError\",\n);\nexport const EnpointConfigError = createCustomErrorClass(\"EnpointConfig\");\nexport const EthAppPleaseEnableContractData = createCustomErrorClass(\n  \"EthAppPleaseEnableContractData\",\n);\nexport const FeeEstimationFailed = createCustomErrorClass(\"FeeEstimationFailed\");\nexport const FirmwareNotRecognized = createCustomErrorClass(\"FirmwareNotRecognized\");\nexport const HardResetFail = createCustomErrorClass(\"HardResetFail\");\nexport const InvalidXRPTag = createCustomErrorClass(\"InvalidXRPTag\");\nexport const InvalidAddress = createCustomErrorClass(\"InvalidAddress\");\nexport const InvalidNonce = createCustomErrorClass(\"InvalidNonce\");\nexport const InvalidAddressBecauseDestinationIsAlsoSource = createCustomErrorClass(\n  \"InvalidAddressBecauseDestinationIsAlsoSource\",\n);\nexport const LatestMCUInstalledError = createCustomErrorClass(\"LatestMCUInstalledError\");\nexport const UnknownMCU = createCustomErrorClass(\"UnknownMCU\");\nexport const LedgerAPIError = createCustomErrorClass(\"LedgerAPIError\");\nexport const LedgerAPIErrorWithMessage = createCustomErrorClass(\"LedgerAPIErrorWithMessage\");\nexport const LedgerAPINotAvailable = createCustomErrorClass(\"LedgerAPINotAvailable\");\nexport const ManagerAppAlreadyInstalledError = createCustomErrorClass(\"ManagerAppAlreadyInstalled\");\nexport const ManagerAppRelyOnBTCError = createCustomErrorClass(\"ManagerAppRelyOnBTC\");\nexport const ManagerAppDepInstallRequired = createCustomErrorClass(\"ManagerAppDepInstallRequired\");\nexport const ManagerAppDepUninstallRequired = createCustomErrorClass(\n  \"ManagerAppDepUninstallRequired\",\n);\nexport const ManagerDeviceLockedError = createCustomErrorClass(\"ManagerDeviceLocked\");\nexport const ManagerFirmwareNotEnoughSpaceError = createCustomErrorClass(\n  \"ManagerFirmwareNotEnoughSpace\",\n);\nexport const ManagerNotEnoughSpaceError = createCustomErrorClass(\"ManagerNotEnoughSpace\");\nexport const ManagerUninstallBTCDep = createCustomErrorClass(\"ManagerUninstallBTCDep\");\nexport const NetworkDown = createCustomErrorClass(\"NetworkDown\");\nexport const NetworkError = createCustomErrorClass(\"NetworkError\");\nexport const NoAddressesFound = createCustomErrorClass(\"NoAddressesFound\");\nexport const NotEnoughBalance = createCustomErrorClass(\"NotEnoughBalance\");\nexport const NotEnoughBalanceSwap = createCustomErrorClass(\"NotEnoughBalanceSwap\");\nexport const NotEnoughBalanceToDelegate = createCustomErrorClass(\"NotEnoughBalanceToDelegate\");\nexport const NotEnoughBalanceInParentAccount = createCustomErrorClass(\n  \"NotEnoughBalanceInParentAccount\",\n);\nexport const NotEnoughSpendableBalance = createCustomErrorClass(\"NotEnoughSpendableBalance\");\nexport const NotEnoughBalanceBecauseDestinationNotCreated = createCustomErrorClass(\n  \"NotEnoughBalanceBecauseDestinationNotCreated\",\n);\nexport const NoAccessToCamera = createCustomErrorClass(\"NoAccessToCamera\");\nexport const NotEnoughGas = createCustomErrorClass(\"NotEnoughGas\");\n// Error message specifically for the PTX swap flow\nexport const NotEnoughGasSwap = createCustomErrorClass(\"NotEnoughGasSwap\");\nexport const TronEmptyAccount = createCustomErrorClass(\"TronEmptyAccount\");\nexport const MaybeKeepTronAccountAlive = createCustomErrorClass(\"MaybeKeepTronAccountAlive\");\nexport const NotSupportedLegacyAddress = createCustomErrorClass(\"NotSupportedLegacyAddress\");\nexport const GasLessThanEstimate = createCustomErrorClass(\"GasLessThanEstimate\");\nexport const PriorityFeeTooLow = createCustomErrorClass(\"PriorityFeeTooLow\");\nexport const PriorityFeeTooHigh = createCustomErrorClass(\"PriorityFeeTooHigh\");\nexport const PriorityFeeHigherThanMaxFee = createCustomErrorClass(\"PriorityFeeHigherThanMaxFee\");\nexport const MaxFeeTooLow = createCustomErrorClass(\"MaxFeeTooLow\");\nexport const PasswordsDontMatchError = createCustomErrorClass(\"PasswordsDontMatch\");\nexport const PasswordIncorrectError = createCustomErrorClass(\"PasswordIncorrect\");\nexport const RecommendSubAccountsToEmpty = createCustomErrorClass(\"RecommendSubAccountsToEmpty\");\nexport const RecommendUndelegation = createCustomErrorClass(\"RecommendUndelegation\");\nexport const TimeoutTagged = createCustomErrorClass(\"TimeoutTagged\");\nexport const UnexpectedBootloader = createCustomErrorClass(\"UnexpectedBootloader\");\nexport const MCUNotGenuineToDashboard = createCustomErrorClass(\"MCUNotGenuineToDashboard\");\nexport const RecipientRequired = createCustomErrorClass(\"RecipientRequired\");\nexport const UnavailableTezosOriginatedAccountReceive = createCustomErrorClass(\n  \"UnavailableTezosOriginatedAccountReceive\",\n);\nexport const UnavailableTezosOriginatedAccountSend = createCustomErrorClass(\n  \"UnavailableTezosOriginatedAccountSend\",\n);\nexport const UpdateFetchFileFail = createCustomErrorClass(\"UpdateFetchFileFail\");\nexport const UpdateIncorrectHash = createCustomErrorClass(\"UpdateIncorrectHash\");\nexport const UpdateIncorrectSig = createCustomErrorClass(\"UpdateIncorrectSig\");\nexport const UpdateYourApp = createCustomErrorClass(\"UpdateYourApp\");\nexport const UserRefusedDeviceNameChange = createCustomErrorClass(\"UserRefusedDeviceNameChange\");\nexport const UserRefusedAddress = createCustomErrorClass(\"UserRefusedAddress\");\nexport const UserRefusedFirmwareUpdate = createCustomErrorClass(\"UserRefusedFirmwareUpdate\");\nexport const UserRefusedAllowManager = createCustomErrorClass(\"UserRefusedAllowManager\");\nexport const UserRefusedOnDevice = createCustomErrorClass(\"UserRefusedOnDevice\"); // TODO rename because it's just for transaction refusal\nexport const PinNotSet = createCustomErrorClass(\"PinNotSet\");\nexport const ExpertModeRequired = createCustomErrorClass(\"ExpertModeRequired\");\nexport const TransportOpenUserCancelled = createCustomErrorClass(\"TransportOpenUserCancelled\");\nexport const TransportInterfaceNotAvailable = createCustomErrorClass(\n  \"TransportInterfaceNotAvailable\",\n);\nexport const TransportRaceCondition = createCustomErrorClass(\"TransportRaceCondition\");\nexport const TransportWebUSBGestureRequired = createCustomErrorClass(\n  \"TransportWebUSBGestureRequired\",\n);\nexport const TransactionHasBeenValidatedError = createCustomErrorClass(\n  \"TransactionHasBeenValidatedError\",\n);\nexport const TransportExchangeTimeoutError = createCustomErrorClass(\n  \"TransportExchangeTimeoutError\",\n);\nexport const DeviceShouldStayInApp = createCustomErrorClass(\"DeviceShouldStayInApp\");\nexport const WebsocketConnectionError = createCustomErrorClass(\"WebsocketConnectionError\");\nexport const WebsocketConnectionFailed = createCustomErrorClass(\"WebsocketConnectionFailed\");\nexport const WrongDeviceForAccount = createCustomErrorClass(\"WrongDeviceForAccount\");\nexport const WrongDeviceForAccountPayout = createCustomErrorClass(\"WrongDeviceForAccountPayout\");\nexport const WrongDeviceForAccountRefund = createCustomErrorClass(\"WrongDeviceForAccountRefund\");\nexport const WrongAppForCurrency = createCustomErrorClass(\"WrongAppForCurrency\");\n\nexport const ETHAddressNonEIP = createCustomErrorClass(\"ETHAddressNonEIP\");\nexport const CantScanQRCode = createCustomErrorClass(\"CantScanQRCode\");\nexport const FeeNotLoaded = createCustomErrorClass(\"FeeNotLoaded\");\nexport const FeeNotLoadedSwap = createCustomErrorClass(\"FeeNotLoadedSwap\");\nexport const FeeRequired = createCustomErrorClass(\"FeeRequired\");\nexport const FeeTooHigh = createCustomErrorClass(\"FeeTooHigh\");\nexport const PendingOperation = createCustomErrorClass(\"PendingOperation\");\nexport const SyncError = createCustomErrorClass(\"SyncError\");\nexport const PairingFailed = createCustomErrorClass(\"PairingFailed\");\nexport const PeerRemovedPairing = createCustomErrorClass(\"PeerRemovedPairing\");\nexport const GenuineCheckFailed = createCustomErrorClass(\"GenuineCheckFailed\");\ntype NetworkType = {\n  status: number;\n  url: string | undefined;\n  method: string;\n};\nexport const LedgerAPI4xx = createCustomErrorClass<\n  NetworkType,\n  LedgerErrorConstructor<NetworkType>\n>(\"LedgerAPI4xx\");\nexport const LedgerAPI5xx = createCustomErrorClass<\n  NetworkType,\n  LedgerErrorConstructor<NetworkType>\n>(\"LedgerAPI5xx\");\nexport const FirmwareOrAppUpdateRequired = createCustomErrorClass(\"FirmwareOrAppUpdateRequired\");\n\n// SpeedUp / Cancel EVM tx\nexport const ReplacementTransactionUnderpriced = createCustomErrorClass(\n  \"ReplacementTransactionUnderpriced\",\n);\n\n// Bitcoin family\nexport const OpReturnDataSizeLimit = createCustomErrorClass(\"OpReturnSizeLimit\");\nexport const DustLimit = createCustomErrorClass(\"DustLimit\");\n\n// Language\nexport const LanguageNotFound = createCustomErrorClass(\"LanguageNotFound\");\n\n// db stuff, no need to translate\nexport const NoDBPathGiven = createCustomErrorClass(\"NoDBPathGiven\");\nexport const DBWrongPassword = createCustomErrorClass(\"DBWrongPassword\");\nexport const DBNotReset = createCustomErrorClass(\"DBNotReset\");\n\nexport const SequenceNumberError = createCustomErrorClass(\"SequenceNumberError\");\nexport const DisabledTransactionBroadcastError = createCustomErrorClass(\n  \"DisabledTransactionBroadcastError\",\n);\n\n// Represents the type of all the classes created with createCustomErrorClass\nexport type CustomErrorClassType = ReturnType<typeof createCustomErrorClass>;\n\n/**\n * Type of a Transport error used to represent all equivalent errors coming from all possible implementation of Transport\n */\nexport enum HwTransportErrorType {\n  Unknown = \"Unknown\",\n  LocationServicesDisabled = \"LocationServicesDisabled\",\n  LocationServicesUnauthorized = \"LocationServicesUnauthorized\",\n  BluetoothScanStartFailed = \"BluetoothScanStartFailed\",\n}\n\n/**\n * Represents an error coming from the usage of any Transport implementation.\n *\n * Needed to map a specific implementation error into an error that\n * can be managed by any code unaware of the specific Transport implementation\n * that was used.\n */\nexport class HwTransportError extends Error {\n  type: HwTransportErrorType;\n\n  constructor(type: HwTransportErrorType, message: string) {\n    super(message);\n    this.name = \"HwTransportError\";\n    this.type = type;\n\n    // Needed as long as we target < ES6\n    Object.setPrototypeOf(this, HwTransportError.prototype);\n  }\n}\n\n/**\n * TransportError is used for any generic transport errors.\n * e.g. Error thrown when data received by exchanges are incorrect or if exchanged failed to communicate with the device for various reason.\n */\nexport class TransportError extends Error {\n  id: string;\n  constructor(message: string, id: string) {\n    const name = \"TransportError\";\n    super(message || name);\n    this.name = name;\n    this.message = message;\n    this.stack = new Error(message).stack;\n    this.id = id;\n  }\n}\n\naddCustomErrorDeserializer(\"TransportError\", e => new TransportError(e.message, e.id));\n\nexport const StatusCodes = {\n  ACCESS_CONDITION_NOT_FULFILLED: 0x9804,\n  ALGORITHM_NOT_SUPPORTED: 0x9484,\n  CLA_NOT_SUPPORTED: 0x6e00,\n  CODE_BLOCKED: 0x9840,\n  CODE_NOT_INITIALIZED: 0x9802,\n  COMMAND_INCOMPATIBLE_FILE_STRUCTURE: 0x6981,\n  CONDITIONS_OF_USE_NOT_SATISFIED: 0x6985,\n  CONTRADICTION_INVALIDATION: 0x9810,\n  CONTRADICTION_SECRET_CODE_STATUS: 0x9808,\n  DEVICE_IN_RECOVERY_MODE: 0x662f,\n  CUSTOM_IMAGE_EMPTY: 0x662e,\n  FILE_ALREADY_EXISTS: 0x6a89,\n  FILE_NOT_FOUND: 0x9404,\n  GP_AUTH_FAILED: 0x6300,\n  HALTED: 0x6faa,\n  INCONSISTENT_FILE: 0x9408,\n  INCORRECT_DATA: 0x6a80,\n  INCORRECT_LENGTH: 0x6700,\n  INCORRECT_P1_P2: 0x6b00,\n  INS_NOT_SUPPORTED: 0x6d00,\n  DEVICE_NOT_ONBOARDED: 0x6d07,\n  DEVICE_NOT_ONBOARDED_2: 0x6611,\n  INVALID_KCV: 0x9485,\n  INVALID_OFFSET: 0x9402,\n  LICENSING: 0x6f42,\n  LOCKED_DEVICE: 0x5515,\n  MAX_VALUE_REACHED: 0x9850,\n  MEMORY_PROBLEM: 0x9240,\n  MISSING_CRITICAL_PARAMETER: 0x6800,\n  NO_EF_SELECTED: 0x9400,\n  NOT_ENOUGH_MEMORY_SPACE: 0x6a84,\n  OK: 0x9000,\n  PIN_REMAINING_ATTEMPTS: 0x63c0,\n  REFERENCED_DATA_NOT_FOUND: 0x6a88,\n  SECURITY_STATUS_NOT_SATISFIED: 0x6982,\n  TECHNICAL_PROBLEM: 0x6f00,\n  UNKNOWN_APDU: 0x6d02,\n  USER_REFUSED_ON_DEVICE: 0x5501,\n  NOT_ENOUGH_SPACE: 0x5102,\n  APP_NOT_FOUND_OR_INVALID_CONTEXT: 0x5123,\n  INVALID_APP_NAME_LENGTH: 0x670a,\n  GEN_AES_KEY_FAILED: 0x5419,\n  INTERNAL_CRYPTO_OPERATION_FAILED: 0x541a,\n  INTERNAL_COMPUTE_AES_CMAC_FAILED: 0x541b,\n  ENCRYPT_APP_STORAGE_FAILED: 0x541c,\n  INVALID_BACKUP_STATE: 0x6642,\n  PIN_NOT_SET: 0x5502,\n  INVALID_BACKUP_LENGTH: 0x6733,\n  INVALID_RESTORE_STATE: 0x6643,\n  INVALID_CHUNK_LENGTH: 0x6734,\n  INVALID_BACKUP_HEADER: 0x684a,\n\n  // Not documented:\n  TRUSTCHAIN_WRONG_SEED: 0xb007,\n};\n\nexport function getAltStatusMessage(code: number): string | undefined | null {\n  switch (code) {\n    // improve text of most common errors\n    case 0x6700:\n      return \"Incorrect length\";\n    case 0x6800:\n      return \"Missing critical parameter\";\n    case 0x6982:\n      return \"Security not satisfied (dongle locked or have invalid access rights)\";\n    case 0x6985:\n      return \"Condition of use not satisfied (denied by the user?)\";\n    case 0x6a80:\n      return \"Invalid data received\";\n    case 0x6b00:\n      return \"Invalid parameter received\";\n    case 0x5515:\n      return \"Locked device\";\n  }\n  if (0x6f00 <= code && code <= 0x6fff) {\n    return \"Internal error, please report\";\n  }\n}\n\n/**\n * Error thrown when a device returned a non success status.\n * the error.statusCode is one of the `StatusCodes` exported by this library.\n */\nexport class TransportStatusError extends Error {\n  statusCode: number;\n  statusText: string;\n\n  /**\n   * @param statusCode The error status code coming from a Transport implementation\n   * @param options containing:\n   *  - canBeMappedToChildError: enable the mapping of TransportStatusError to an error extending/inheriting from it\n   *  . Ex: LockedDeviceError. Default to true.\n   */\n  constructor(\n    statusCode: number,\n    { canBeMappedToChildError = true }: { canBeMappedToChildError?: boolean } = {},\n  ) {\n    const statusText =\n      Object.keys(StatusCodes).find(k => StatusCodes[k] === statusCode) || \"UNKNOWN_ERROR\";\n    const smsg = getAltStatusMessage(statusCode) || statusText;\n    const statusCodeStr = statusCode.toString(16);\n    const message = `Ledger device: ${smsg} (0x${statusCodeStr})`;\n\n    super(message);\n    this.name = \"TransportStatusError\";\n\n    this.statusCode = statusCode;\n    this.statusText = statusText;\n\n    Object.setPrototypeOf(this, TransportStatusError.prototype);\n\n    // Maps to a LockedDeviceError\n    if (canBeMappedToChildError && statusCode === StatusCodes.LOCKED_DEVICE) {\n      return new LockedDeviceError(message);\n    }\n  }\n}\n\nexport class LockedDeviceError extends TransportStatusError {\n  constructor(message?: string) {\n    super(StatusCodes.LOCKED_DEVICE, { canBeMappedToChildError: false });\n    if (message) {\n      this.message = message;\n    }\n    this.name = \"LockedDeviceError\";\n    Object.setPrototypeOf(this, LockedDeviceError.prototype);\n  }\n}\n\n// Represents the type of the class TransportStatusError and its children\nexport type TransportStatusErrorClassType = typeof TransportStatusError | typeof LockedDeviceError;\n\naddCustomErrorDeserializer(\"TransportStatusError\", e => new TransportStatusError(e.statusCode));\n", "export type TraceContext = Record<string, unknown>;\nexport type LogData = any;\nexport type LogType = string;\n\n/**\n * A Log object\n */\nexport interface Log {\n  /**\n   * A namespaced identifier of the log (not a level like \"debug\", \"error\" but more like \"apdu\", \"hw\", etc...)\n   */\n  type: LogType;\n  message?: string;\n  /**\n   * Data associated to the log event\n   */\n  data?: LogData;\n  /**\n   * Context data, coming for example from the caller's parent, to enable a simple tracing system\n   */\n  context?: TraceContext;\n  /**\n   * Unique id among all logs\n   */\n  id: string;\n  /*\n   * Date when the log occurred\n   */\n  date: Date;\n}\n\nexport type Unsubscribe = () => void;\nexport type Subscriber = (arg0: Log) => void;\n\nlet id = 0;\nconst subscribers: Subscriber[] = [];\n\n/**\n * Logs something\n *\n * @param type a namespaced identifier of the log (it is not a level like \"debug\", \"error\" but more like \"apdu-in\", \"apdu-out\", etc...)\n * @param message a clear message of the log associated to the type\n */\nexport const log = (type: LogType, message?: string, data?: LogData) => {\n  const obj: Log = {\n    type,\n    id: String(++id),\n    date: new Date(),\n  };\n  if (message) obj.message = message;\n  if (data) obj.data = data;\n  dispatch(obj);\n};\n\n/**\n * A simple tracer function, only expanding the existing log function\n *\n * Its goal is to capture more context than a log function.\n * This is simple for now, but can be improved later.\n *\n * @param context Anything representing the context where the log occurred\n */\nexport const trace = ({\n  type,\n  message,\n  data,\n  context,\n}: {\n  type: LogType;\n  message?: string;\n  data?: LogData;\n  context?: TraceContext;\n}) => {\n  const obj: Log = {\n    type,\n    id: String(++id),\n    date: new Date(),\n  };\n\n  if (message) obj.message = message;\n  if (data) obj.data = data;\n  if (context) obj.context = context;\n\n  dispatch(obj);\n};\n\n/**\n * A simple tracer class, that can be used to avoid repetition when using the `trace` function\n *\n * Its goal is to capture more context than a log function.\n * This is simple for now, but can be improved later.\n *\n * @param type A given type (not level) for the current local tracer (\"hw\", \"withDevice\", etc.)\n * @param context Anything representing the context where the log occurred\n */\nexport class LocalTracer {\n  constructor(\n    private type: LogType,\n    private context?: TraceContext,\n  ) {}\n\n  trace(message: string, data?: TraceContext) {\n    trace({\n      type: this.type,\n      message,\n      data,\n      context: this.context,\n    });\n  }\n\n  getContext(): TraceContext | undefined {\n    return this.context;\n  }\n\n  setContext(context?: TraceContext) {\n    this.context = context;\n  }\n\n  updateContext(contextToAdd: TraceContext) {\n    this.context = { ...this.context, ...contextToAdd };\n  }\n\n  getType(): LogType {\n    return this.type;\n  }\n\n  setType(type: LogType) {\n    this.type = type;\n  }\n\n  /**\n   * Create a new instance of the LocalTracer with an updated `type`\n   *\n   * It does not mutate the calling instance, but returns a new LocalTracer,\n   * following a simple builder pattern.\n   */\n  withType(type: LogType): LocalTracer {\n    return new LocalTracer(type, this.context);\n  }\n\n  /**\n   * Create a new instance of the LocalTracer with a new `context`\n   *\n   * It does not mutate the calling instance, but returns a new LocalTracer,\n   * following a simple builder pattern.\n   *\n   * @param context A TraceContext, that can undefined to reset the context\n   */\n  withContext(context?: TraceContext): LocalTracer {\n    return new LocalTracer(this.type, context);\n  }\n\n  /**\n   * Create a new instance of the LocalTracer with an updated `context`,\n   * on which an additional context is merged with the existing one.\n   *\n   * It does not mutate the calling instance, but returns a new LocalTracer,\n   * following a simple builder pattern.\n   */\n  withUpdatedContext(contextToAdd: TraceContext): LocalTracer {\n    return new LocalTracer(this.type, { ...this.context, ...contextToAdd });\n  }\n}\n\n/**\n * Adds a subscribers to the emitted logs.\n *\n * @param cb that is called for each future log() with the Log object\n * @return a function that can be called to unsubscribe the listener\n */\nexport const listen = (cb: Subscriber): Unsubscribe => {\n  subscribers.push(cb);\n  return () => {\n    const i = subscribers.indexOf(cb);\n\n    if (i !== -1) {\n      // equivalent of subscribers.splice(i, 1) // https://twitter.com/Rich_Harris/status/1125850391155965952\n      subscribers[i] = subscribers[subscribers.length - 1];\n      subscribers.pop();\n    }\n  };\n};\n\nfunction dispatch(log: Log) {\n  for (let i = 0; i < subscribers.length; i++) {\n    try {\n      subscribers[i](log);\n    } catch (e) {\n      console.error(e);\n    }\n  }\n}\n\n// for debug purpose\n\ndeclare global {\n  interface Window {\n    __ledgerLogsListen: any;\n  }\n}\n\nif (typeof window !== \"undefined\") {\n  window.__ledgerLogsListen = listen;\n}\n", "import EventEmitter from \"events\";\nimport type { DeviceModel } from \"@ledgerhq/devices\";\nimport {\n  TransportRaceCondition,\n  TransportError,\n  StatusCodes,\n  getAltStatusMessage,\n  TransportStatusError,\n} from \"@ledgerhq/errors\";\nimport { LocalTracer, TraceContext, LogType } from \"@ledgerhq/logs\";\nexport { TransportError, TransportStatusError, StatusCodes, getAltStatusMessage };\n\nconst DEFAULT_LOG_TYPE = \"transport\";\n\n/**\n */\nexport type Subscription = {\n  unsubscribe: () => void;\n};\n\n/**\n */\nexport type Device = any; // Should be a union type of all possible Device object's shape\n\nexport type DescriptorEventType = \"add\" | \"remove\";\n/**\n * A \"descriptor\" is a parameter that is specific to the implementation, and can be an ID, file path, or URL.\n * type: add or remove event\n * descriptor: a parameter that can be passed to open(descriptor)\n * deviceModel: device info on the model (is it a nano s, nano x, ...)\n * device: transport specific device info\n */\nexport interface DescriptorEvent<Descriptor> {\n  type: DescriptorEventType;\n  descriptor: Descriptor;\n  deviceModel?: DeviceModel | null | undefined;\n  device?: Device;\n}\n\n/**\n * Observer generic type, following the Observer pattern\n */\nexport type Observer<EventType, EventError = unknown> = Readonly<{\n  next: (event: EventType) => unknown;\n  error: (e: EventError) => unknown;\n  complete: () => unknown;\n}>;\n\n/**\n * The Transport class defines a generic interface for communicating with a Ledger hardware wallet.\n * There are different kind of transports based on the technology (channels like U2F, HID, Bluetooth, Webusb) and environment (Node, Web,...).\n * It is an abstract class that needs to be implemented.\n */\nexport default class Transport {\n  exchangeTimeout = 30000;\n  unresponsiveTimeout = 15000;\n  deviceModel: DeviceModel | null | undefined = null;\n  tracer: LocalTracer;\n\n  constructor({ context, logType }: { context?: TraceContext; logType?: LogType } = {}) {\n    this.tracer = new LocalTracer(logType ?? DEFAULT_LOG_TYPE, context);\n  }\n\n  /**\n   * Check if the transport is supported on the current platform/browser.\n   * @returns {Promise<boolean>} A promise that resolves with a boolean indicating support.\n   */\n  static readonly isSupported: () => Promise<boolean>;\n\n  /**\n   * List all available descriptors for the transport.\n   * For a better granularity, checkout `listen()`.\n   *\n   * @returns {Promise<Array<any>>} A promise that resolves with an array of descriptors.\n   * @example\n   * TransportFoo.list().then(descriptors => ...)\n   */\n  static readonly list: () => Promise<Array<any>>;\n\n  /**\n   * Listen for device events for the transport. The method takes an observer of DescriptorEvent and returns a Subscription.\n   * A DescriptorEvent is an object containing a \"descriptor\" and a \"type\" field. The \"type\" field can be \"add\" or \"remove\", and the \"descriptor\" field can be passed to the \"open\" method.\n   * The \"listen\" method will first emit all currently connected devices and then will emit events as they occur, such as when a USB device is plugged in or a Bluetooth device becomes discoverable.\n   * @param {Observer<DescriptorEvent<any>>} observer - An object with \"next\", \"error\", and \"complete\" functions, following the observer pattern.\n   * @returns {Subscription} A Subscription object on which you can call \".unsubscribe()\" to stop listening to descriptors.\n   * @example\n  const sub = TransportFoo.listen({\n  next: e => {\n    if (e.type===\"add\") {\n      sub.unsubscribe();\n      const transport = await TransportFoo.open(e.descriptor);\n      ...\n    }\n  },\n  error: error => {},\n  complete: () => {}\n  })\n   */\n  static readonly listen: (observer: Observer<DescriptorEvent<any>>) => Subscription;\n\n  /**\n   * Attempt to create a Transport instance with a specific descriptor.\n   * @param {any} descriptor - The descriptor to open the transport with.\n   * @param {number} timeout - An optional timeout for the transport connection.\n   * @param {TraceContext} context Optional tracing/log context\n   * @returns {Promise<Transport>} A promise that resolves with a Transport instance.\n   * @example\n  TransportFoo.open(descriptor).then(transport => ...)\n   */\n  static readonly open: (\n    descriptor?: any,\n    timeoutMs?: number,\n    context?: TraceContext,\n  ) => Promise<Transport>;\n\n  /**\n   * Send data to the device using a low level API.\n   * It's recommended to use the \"send\" method for a higher level API.\n   * @param {Buffer} apdu - The data to send.\n   * @param {Object} options - Contains optional options for the exchange function\n   *  - abortTimeoutMs: stop the exchange after a given timeout. Another timeout exists\n   *    to detect unresponsive device (see `unresponsiveTimeout`). This timeout aborts the exchange.\n   * @returns {Promise<Buffer>} A promise that resolves with the response data from the device.\n   */\n  exchange(\n    _apdu: Buffer,\n    { abortTimeoutMs: _abortTimeoutMs }: { abortTimeoutMs?: number } = {},\n  ): Promise<Buffer> {\n    throw new Error(\"exchange not implemented\");\n  }\n\n  /**\n   * Send apdus in batch to the device using a low level API.\n   * The default implementation is to call exchange for each apdu.\n   * @param {Array<Buffer>} apdus - array of apdus to send.\n   * @param {Observer<Buffer>} observer - an observer that will receive the response of each apdu.\n   * @returns {Subscription} A Subscription object on which you can call \".unsubscribe()\" to stop sending apdus.\n   */\n  exchangeBulk(apdus: Buffer[], observer: Observer<Buffer>): Subscription {\n    let unsubscribed = false;\n    const unsubscribe = () => {\n      unsubscribed = true;\n    };\n\n    const main = async () => {\n      if (unsubscribed) return;\n      for (const apdu of apdus) {\n        const r = await this.exchange(apdu);\n        if (unsubscribed) return;\n        const status = r.readUInt16BE(r.length - 2);\n        if (status !== StatusCodes.OK) {\n          throw new TransportStatusError(status);\n        }\n        observer.next(r);\n      }\n    };\n\n    main().then(\n      () => !unsubscribed && observer.complete(),\n      e => !unsubscribed && observer.error(e),\n    );\n\n    return { unsubscribe };\n  }\n\n  /**\n   * Set the \"scramble key\" for the next data exchanges with the device.\n   * Each app can have a different scramble key and it is set internally during instantiation.\n   * @param {string} key - The scramble key to set.\n   * deprecated This method is no longer needed for modern transports and should be migrated away from.\n   * no @ before deprecated as it breaks documentationjs on version 14.0.2\n   * https://github.com/documentationjs/documentation/issues/1596\n   */\n  setScrambleKey(_key: string) {}\n\n  /**\n   * Close the connection with the device.\n   *\n   * Note: for certain transports (hw-transport-node-hid-singleton for ex), once the promise resolved,\n   * the transport instance is actually still cached, and the device is disconnected only after a defined timeout.\n   * But for the consumer of the Transport, this does not matter and it can consider the transport to be closed.\n   *\n   * @returns {Promise<void>} A promise that resolves when the transport is closed.\n   */\n  close(): Promise<void> {\n    return Promise.resolve();\n  }\n\n  _events = new EventEmitter();\n\n  /**\n   * Listen for an event on the transport instance.\n   * Transport implementations may have specific events. Common events include:\n   * \"disconnect\" : triggered when the transport is disconnected.\n   * @param {string} eventName - The name of the event to listen for.\n   * @param {(...args: Array<any>) => any} cb - The callback function to be invoked when the event occurs.\n   */\n  on(eventName: string, cb: (...args: Array<any>) => any): void {\n    this._events.on(eventName, cb);\n  }\n\n  /**\n   * Stop listening to an event on an instance of transport.\n   */\n  off(eventName: string, cb: (...args: Array<any>) => any): void {\n    this._events.removeListener(eventName, cb);\n  }\n\n  emit(event: string, ...args: any): void {\n    this._events.emit(event, ...args);\n  }\n\n  /**\n   * Enable or not logs of the binary exchange\n   */\n  setDebugMode() {\n    console.warn(\n      \"setDebugMode is deprecated. use @ledgerhq/logs instead. No logs are emitted in this anymore.\",\n    );\n  }\n\n  /**\n   * Set a timeout (in milliseconds) for the exchange call. Only some transport might implement it. (e.g. U2F)\n   */\n  setExchangeTimeout(exchangeTimeout: number): void {\n    this.exchangeTimeout = exchangeTimeout;\n  }\n\n  /**\n   * Define the delay before emitting \"unresponsive\" on an exchange that does not respond\n   */\n  setExchangeUnresponsiveTimeout(unresponsiveTimeout: number): void {\n    this.unresponsiveTimeout = unresponsiveTimeout;\n  }\n\n  /**\n   * Send data to the device using the higher level API.\n   *\n   * @param {number} cla - The instruction class for the command.\n   * @param {number} ins - The instruction code for the command.\n   * @param {number} p1 - The first parameter for the instruction.\n   * @param {number} p2 - The second parameter for the instruction.\n   * @param {Buffer} data - The data to be sent. Defaults to an empty buffer.\n   * @param {Array<number>} statusList - A list of acceptable status codes for the response. Defaults to [StatusCodes.OK].\n   * @param {Object} options - Contains optional options for the exchange function\n   *  - abortTimeoutMs: stop the send after a given timeout. Another timeout exists\n   *    to detect unresponsive device (see `unresponsiveTimeout`). This timeout aborts the exchange.\n   * @returns {Promise<Buffer>} A promise that resolves with the response data from the device.\n   */\n  send = async (\n    cla: number,\n    ins: number,\n    p1: number,\n    p2: number,\n    data: Buffer = Buffer.alloc(0),\n    statusList: Array<number> = [StatusCodes.OK],\n    { abortTimeoutMs }: { abortTimeoutMs?: number } = {},\n  ): Promise<Buffer> => {\n    const tracer = this.tracer.withUpdatedContext({ function: \"send\" });\n\n    if (data.length >= 256) {\n      tracer.trace(\"data.length exceeded 256 bytes limit\", { dataLength: data.length });\n      throw new TransportError(\n        \"data.length exceed 256 bytes limit. Got: \" + data.length,\n        \"DataLengthTooBig\",\n      );\n    }\n\n    tracer.trace(\"Starting an exchange\", { abortTimeoutMs });\n    const response = await this.exchange(\n      // The size of the data is added in 1 byte just before `data`\n      Buffer.concat([Buffer.from([cla, ins, p1, p2]), Buffer.from([data.length]), data]),\n      { abortTimeoutMs },\n    );\n    tracer.trace(\"Received response from exchange\");\n    const sw = response.readUInt16BE(response.length - 2);\n\n    if (!statusList.some(s => s === sw)) {\n      throw new TransportStatusError(sw);\n    }\n\n    return response;\n  };\n\n  /**\n   * create() allows to open the first descriptor available or\n   * throw if there is none or if timeout is reached.\n   * This is a light helper, alternative to using listen() and open() (that you may need for any more advanced usecase)\n   * @example\n  TransportFoo.create().then(transport => ...)\n   */\n  static create(openTimeout = 3000, listenTimeout?: number): Promise<Transport> {\n    return new Promise((resolve, reject) => {\n      let found = false;\n      const sub = this.listen({\n        next: e => {\n          found = true;\n          if (sub) sub.unsubscribe();\n          if (listenTimeoutId) clearTimeout(listenTimeoutId);\n          this.open(e.descriptor, openTimeout).then(resolve, reject);\n        },\n        error: e => {\n          if (listenTimeoutId) clearTimeout(listenTimeoutId);\n          reject(e);\n        },\n        complete: () => {\n          if (listenTimeoutId) clearTimeout(listenTimeoutId);\n\n          if (!found) {\n            reject(new TransportError(this.ErrorMessage_NoDeviceFound, \"NoDeviceFound\"));\n          }\n        },\n      });\n      const listenTimeoutId = listenTimeout\n        ? setTimeout(() => {\n            sub.unsubscribe();\n            reject(new TransportError(this.ErrorMessage_ListenTimeout, \"ListenTimeout\"));\n          }, listenTimeout)\n        : null;\n    });\n  }\n\n  // Blocks other exchange to happen concurrently\n  exchangeBusyPromise: Promise<void> | null | undefined;\n\n  /**\n   * Wrapper to make an exchange \"atomic\" (blocking any other exchange)\n   *\n   * It also handles \"unresponsiveness\" by emitting \"unresponsive\" and \"responsive\" events.\n   *\n   * @param f The exchange job, using the transport to run\n   * @returns a Promise resolving with the output of the given job\n   */\n  async exchangeAtomicImpl<Output>(f: () => Promise<Output>): Promise<Output> {\n    const tracer = this.tracer.withUpdatedContext({\n      function: \"exchangeAtomicImpl\",\n      unresponsiveTimeout: this.unresponsiveTimeout,\n    });\n\n    if (this.exchangeBusyPromise) {\n      tracer.trace(\"Atomic exchange is already busy\");\n      throw new TransportRaceCondition(\n        \"An action was already pending on the Ledger device. Please deny or reconnect.\",\n      );\n    }\n\n    // Sets the atomic guard\n    let resolveBusy;\n    const busyPromise: Promise<void> = new Promise(r => {\n      resolveBusy = r;\n    });\n    this.exchangeBusyPromise = busyPromise;\n\n    // The device unresponsiveness handler\n    let unresponsiveReached = false;\n    const timeout = setTimeout(() => {\n      tracer.trace(`Timeout reached, emitting Transport event \"unresponsive\"`, {\n        unresponsiveTimeout: this.unresponsiveTimeout,\n      });\n      unresponsiveReached = true;\n      this.emit(\"unresponsive\");\n    }, this.unresponsiveTimeout);\n\n    try {\n      const res = await f();\n\n      if (unresponsiveReached) {\n        tracer.trace(\"Device was unresponsive, emitting responsive\");\n        this.emit(\"responsive\");\n      }\n\n      return res;\n    } finally {\n      tracer.trace(\"Finalize, clearing busy guard\");\n\n      clearTimeout(timeout);\n      if (resolveBusy) resolveBusy();\n      this.exchangeBusyPromise = null;\n    }\n  }\n\n  decorateAppAPIMethods(self: Record<string, any>, methods: Array<string>, scrambleKey: string) {\n    for (const methodName of methods) {\n      self[methodName] = this.decorateAppAPIMethod(methodName, self[methodName], self, scrambleKey);\n    }\n  }\n\n  _appAPIlock: string | null = null;\n\n  decorateAppAPIMethod<R, A extends any[]>(\n    methodName: string,\n    f: (...args: A) => Promise<R>,\n    ctx: any,\n    scrambleKey: string,\n  ): (...args: A) => Promise<R> {\n    return async (...args) => {\n      const { _appAPIlock } = this;\n\n      if (_appAPIlock) {\n        return Promise.reject(\n          new TransportError(\"Ledger Device is busy (lock \" + _appAPIlock + \")\", \"TransportLocked\"),\n        );\n      }\n\n      try {\n        this._appAPIlock = methodName;\n        this.setScrambleKey(scrambleKey);\n        return await f.apply(ctx, args);\n      } finally {\n        this._appAPIlock = null;\n      }\n    };\n  }\n\n  /**\n   * Sets the context used by the logging/tracing mechanism\n   *\n   * Useful when re-using (cached) the same Transport instance,\n   * but with a new tracing context.\n   *\n   * @param context A TraceContext, that can undefined to reset the context\n   */\n  setTraceContext(context?: TraceContext) {\n    this.tracer = this.tracer.withContext(context);\n  }\n\n  /**\n   * Updates the context used by the logging/tracing mechanism\n   *\n   * The update only overrides the key-value that are already defined in the current context.\n   *\n   * @param contextToAdd A TraceContext that will be added to the current context\n   */\n  updateTraceContext(contextToAdd: TraceContext) {\n    this.tracer.updateContext(contextToAdd);\n  }\n\n  /**\n   * Gets the tracing context of the transport instance\n   */\n  getTraceContext(): TraceContext | undefined {\n    return this.tracer.getContext();\n  }\n\n  static ErrorMessage_ListenTimeout = \"No Ledger device found (timeout)\";\n  static ErrorMessage_NoDeviceFound = \"No Ledger device found\";\n}\n", "// Note: this is the semver.org version of the spec that it implements\n// Not necessarily the package version of this code.\nconst SEMVER_SPEC_VERSION = '2.0.0'\n\nconst MAX_LENGTH = 256\nconst MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||\n/* istanbul ignore next */ 9007199254740991\n\n// Max safe segment length for coercion.\nconst MAX_SAFE_COMPONENT_LENGTH = 16\n\n// Max safe length for a build identifier. The max length minus 6 characters for\n// the shortest version with a build 0.0.0+BUILD.\nconst MAX_SAFE_BUILD_LENGTH = MAX_LENGTH - 6\n\nconst RELEASE_TYPES = [\n  'major',\n  'premajor',\n  'minor',\n  'preminor',\n  'patch',\n  'prepatch',\n  'prerelease',\n]\n\nmodule.exports = {\n  MAX_LENGTH,\n  MAX_SAFE_COMPONENT_LENGTH,\n  MAX_SAFE_BUILD_LENGTH,\n  MAX_SAFE_INTEGER,\n  RELEASE_TYPES,\n  SEMVER_SPEC_VERSION,\n  FLAG_INCLUDE_PRERELEASE: 0b001,\n  FLAG_LOOSE: 0b010,\n}\n", "const debug = (\n  typeof process === 'object' &&\n  process.env &&\n  process.env.NODE_DEBUG &&\n  /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n  : () => {}\n\nmodule.exports = debug\n", "const {\n  MAX_SAFE_COMPONENT_LENGTH,\n  MAX_SAFE_BUILD_LENGTH,\n  MAX_LENGTH,\n} = require('./constants')\nconst debug = require('./debug')\nexports = module.exports = {}\n\n// The actual regexps go on exports.re\nconst re = exports.re = []\nconst safeRe = exports.safeRe = []\nconst src = exports.src = []\nconst t = exports.t = {}\nlet R = 0\n\nconst LETTERDASHNUMBER = '[a-zA-Z0-9-]'\n\n// Replace some greedy regex tokens to prevent regex dos issues. These regex are\n// used internally via the safeRe object since all inputs in this library get\n// normalized first to trim and collapse all extra whitespace. The original\n// regexes are exported for userland consumption and lower level usage. A\n// future breaking change could export the safer regex only with a note that\n// all input should have extra whitespace removed.\nconst safeRegexReplacements = [\n  ['\\\\s', 1],\n  ['\\\\d', MAX_LENGTH],\n  [LETTERDASHNUMBER, MAX_SAFE_BUILD_LENGTH],\n]\n\nconst makeSafeRegex = (value) => {\n  for (const [token, max] of safeRegexReplacements) {\n    value = value\n      .split(`${token}*`).join(`${token}{0,${max}}`)\n      .split(`${token}+`).join(`${token}{1,${max}}`)\n  }\n  return value\n}\n\nconst createToken = (name, value, isGlobal) => {\n  const safe = makeSafeRegex(value)\n  const index = R++\n  debug(name, index, value)\n  t[name] = index\n  src[index] = value\n  re[index] = new RegExp(value, isGlobal ? 'g' : undefined)\n  safeRe[index] = new RegExp(safe, isGlobal ? 'g' : undefined)\n}\n\n// The following Regular Expressions can be used for tokenizing,\n// validating, and parsing SemVer version strings.\n\n// ## Numeric Identifier\n// A single `0`, or a non-zero digit followed by zero or more digits.\n\ncreateToken('NUMERICIDENTIFIER', '0|[1-9]\\\\d*')\ncreateToken('NUMERICIDENTIFIERLOOSE', '\\\\d+')\n\n// ## Non-numeric Identifier\n// Zero or more digits, followed by a letter or hyphen, and then zero or\n// more letters, digits, or hyphens.\n\ncreateToken('NONNUMERICIDENTIFIER', `\\\\d*[a-zA-Z-]${LETTERDASHNUMBER}*`)\n\n// ## Main Version\n// Three dot-separated numeric identifiers.\n\ncreateToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n                   `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n                   `(${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n                        `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n                        `(${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version Identifier\n// A numeric identifier, or a non-numeric identifier.\n\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NUMERICIDENTIFIER]\n}|${src[t.NONNUMERICIDENTIFIER]})`)\n\ncreateToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NUMERICIDENTIFIERLOOSE]\n}|${src[t.NONNUMERICIDENTIFIER]})`)\n\n// ## Pre-release Version\n// Hyphen, followed by one or more dot-separated pre-release version\n// identifiers.\n\ncreateToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIER]})*))`)\n\ncreateToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`)\n\n// ## Build Metadata Identifier\n// Any combination of digits, letters, or hyphens.\n\ncreateToken('BUILDIDENTIFIER', `${LETTERDASHNUMBER}+`)\n\n// ## Build Metadata\n// Plus sign, followed by one or more period-separated build metadata\n// identifiers.\n\ncreateToken('BUILD', `(?:\\\\+(${src[t.BUILDIDENTIFIER]\n}(?:\\\\.${src[t.BUILDIDENTIFIER]})*))`)\n\n// ## Full Version String\n// A main version, followed optionally by a pre-release version and\n// build metadata.\n\n// Note that the only major, minor, patch, and pre-release sections of\n// the version string are capturing groups.  The build metadata is not a\n// capturing group, because it should not ever be used in version\n// comparison.\n\ncreateToken('FULLPLAIN', `v?${src[t.MAINVERSION]\n}${src[t.PRERELEASE]}?${\n  src[t.BUILD]}?`)\n\ncreateToken('FULL', `^${src[t.FULLPLAIN]}$`)\n\n// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.\n// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty\n// common in the npm registry.\ncreateToken('LOOSEPLAIN', `[v=\\\\s]*${src[t.MAINVERSIONLOOSE]\n}${src[t.PRERELEASELOOSE]}?${\n  src[t.BUILD]}?`)\n\ncreateToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`)\n\ncreateToken('GTLT', '((?:<|>)?=?)')\n\n// Something like \"2.*\" or \"1.2.x\".\n// Note that \"x.x\" is a valid xRange identifer, meaning \"any version\"\n// Only the first item is strictly required.\ncreateToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\\\*`)\ncreateToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\\\*`)\n\ncreateToken('XRANGEPLAIN', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:${src[t.PRERELEASE]})?${\n                     src[t.BUILD]}?` +\n                   `)?)?`)\n\ncreateToken('XRANGEPLAINLOOSE', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:${src[t.PRERELEASELOOSE]})?${\n                          src[t.BUILD]}?` +\n                        `)?)?`)\n\ncreateToken('XRANGE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAIN]}$`)\ncreateToken('XRANGELOOSE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Coercion.\n// Extract anything that could conceivably be a part of a valid semver\ncreateToken('COERCEPLAIN', `${'(^|[^\\\\d])' +\n              '(\\\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +\n              `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n              `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?`)\ncreateToken('COERCE', `${src[t.COERCEPLAIN]}(?:$|[^\\\\d])`)\ncreateToken('COERCEFULL', src[t.COERCEPLAIN] +\n              `(?:${src[t.PRERELEASE]})?` +\n              `(?:${src[t.BUILD]})?` +\n              `(?:$|[^\\\\d])`)\ncreateToken('COERCERTL', src[t.COERCE], true)\ncreateToken('COERCERTLFULL', src[t.COERCEFULL], true)\n\n// Tilde ranges.\n// Meaning is \"reasonably at or greater than\"\ncreateToken('LONETILDE', '(?:~>?)')\n\ncreateToken('TILDETRIM', `(\\\\s*)${src[t.LONETILDE]}\\\\s+`, true)\nexports.tildeTrimReplace = '$1~'\n\ncreateToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Caret ranges.\n// Meaning is \"at least and backwards compatible with\"\ncreateToken('LONECARET', '(?:\\\\^)')\n\ncreateToken('CARETTRIM', `(\\\\s*)${src[t.LONECARET]}\\\\s+`, true)\nexports.caretTrimReplace = '$1^'\n\ncreateToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// A simple gt/lt/eq thing, or just \"\" to indicate \"any version\"\ncreateToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\\\s*(${src[t.LOOSEPLAIN]})$|^$`)\ncreateToken('COMPARATOR', `^${src[t.GTLT]}\\\\s*(${src[t.FULLPLAIN]})$|^$`)\n\n// An expression to strip any whitespace between the gtlt and the thing\n// it modifies, so that `> 1.2.3` ==> `>1.2.3`\ncreateToken('COMPARATORTRIM', `(\\\\s*)${src[t.GTLT]\n}\\\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true)\nexports.comparatorTrimReplace = '$1$2$3'\n\n// Something like `1.2.3 - 1.2.4`\n// Note that these all use the loose form, because they'll be\n// checked against either the strict or loose comparator form\n// later.\ncreateToken('HYPHENRANGE', `^\\\\s*(${src[t.XRANGEPLAIN]})` +\n                   `\\\\s+-\\\\s+` +\n                   `(${src[t.XRANGEPLAIN]})` +\n                   `\\\\s*$`)\n\ncreateToken('HYPHENRANGELOOSE', `^\\\\s*(${src[t.XRANGEPLAINLOOSE]})` +\n                        `\\\\s+-\\\\s+` +\n                        `(${src[t.XRANGEPLAINLOOSE]})` +\n                        `\\\\s*$`)\n\n// Star ranges basically just allow anything at all.\ncreateToken('STAR', '(<|>)?=?\\\\s*\\\\*')\n// >=0.0.0 is like a star\ncreateToken('GTE0', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0\\\\s*$')\ncreateToken('GTE0PRE', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0-0\\\\s*$')\n", "// parse out just the options we care about\nconst looseOption = Object.freeze({ loose: true })\nconst emptyOpts = Object.freeze({ })\nconst parseOptions = options => {\n  if (!options) {\n    return emptyOpts\n  }\n\n  if (typeof options !== 'object') {\n    return looseOption\n  }\n\n  return options\n}\nmodule.exports = parseOptions\n", "const numeric = /^[0-9]+$/\nconst compareIdentifiers = (a, b) => {\n  const anum = numeric.test(a)\n  const bnum = numeric.test(b)\n\n  if (anum && bnum) {\n    a = +a\n    b = +b\n  }\n\n  return a === b ? 0\n    : (anum && !bnum) ? -1\n    : (bnum && !anum) ? 1\n    : a < b ? -1\n    : 1\n}\n\nconst rcompareIdentifiers = (a, b) => compareIdentifiers(b, a)\n\nmodule.exports = {\n  compareIdentifiers,\n  rcompareIdentifiers,\n}\n", "const debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n  constructor (version, options) {\n    options = parseOptions(options)\n\n    if (version instanceof SemVer) {\n      if (version.loose === !!options.loose &&\n          version.includePrerelease === !!options.includePrerelease) {\n        return version\n      } else {\n        version = version.version\n      }\n    } else if (typeof version !== 'string') {\n      throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n    }\n\n    if (version.length > MAX_LENGTH) {\n      throw new TypeError(\n        `version is longer than ${MAX_LENGTH} characters`\n      )\n    }\n\n    debug('SemVer', version, options)\n    this.options = options\n    this.loose = !!options.loose\n    // this isn't actually relevant for versions, but keep it so that we\n    // don't run into trouble passing this.options around.\n    this.includePrerelease = !!options.includePrerelease\n\n    const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n    if (!m) {\n      throw new TypeError(`Invalid Version: ${version}`)\n    }\n\n    this.raw = version\n\n    // these are actually numbers\n    this.major = +m[1]\n    this.minor = +m[2]\n    this.patch = +m[3]\n\n    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n      throw new TypeError('Invalid major version')\n    }\n\n    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n      throw new TypeError('Invalid minor version')\n    }\n\n    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n      throw new TypeError('Invalid patch version')\n    }\n\n    // numberify any prerelease numeric ids\n    if (!m[4]) {\n      this.prerelease = []\n    } else {\n      this.prerelease = m[4].split('.').map((id) => {\n        if (/^[0-9]+$/.test(id)) {\n          const num = +id\n          if (num >= 0 && num < MAX_SAFE_INTEGER) {\n            return num\n          }\n        }\n        return id\n      })\n    }\n\n    this.build = m[5] ? m[5].split('.') : []\n    this.format()\n  }\n\n  format () {\n    this.version = `${this.major}.${this.minor}.${this.patch}`\n    if (this.prerelease.length) {\n      this.version += `-${this.prerelease.join('.')}`\n    }\n    return this.version\n  }\n\n  toString () {\n    return this.version\n  }\n\n  compare (other) {\n    debug('SemVer.compare', this.version, this.options, other)\n    if (!(other instanceof SemVer)) {\n      if (typeof other === 'string' && other === this.version) {\n        return 0\n      }\n      other = new SemVer(other, this.options)\n    }\n\n    if (other.version === this.version) {\n      return 0\n    }\n\n    return this.compareMain(other) || this.comparePre(other)\n  }\n\n  compareMain (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    return (\n      compareIdentifiers(this.major, other.major) ||\n      compareIdentifiers(this.minor, other.minor) ||\n      compareIdentifiers(this.patch, other.patch)\n    )\n  }\n\n  comparePre (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    // NOT having a prerelease is > having one\n    if (this.prerelease.length && !other.prerelease.length) {\n      return -1\n    } else if (!this.prerelease.length && other.prerelease.length) {\n      return 1\n    } else if (!this.prerelease.length && !other.prerelease.length) {\n      return 0\n    }\n\n    let i = 0\n    do {\n      const a = this.prerelease[i]\n      const b = other.prerelease[i]\n      debug('prerelease compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  compareBuild (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    let i = 0\n    do {\n      const a = this.build[i]\n      const b = other.build[i]\n      debug('build compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  // preminor will bump the version up to the next minor release, and immediately\n  // down to pre-release. premajor and prepatch work the same way.\n  inc (release, identifier, identifierBase) {\n    switch (release) {\n      case 'premajor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor = 0\n        this.major++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'preminor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'prepatch':\n        // If this is already a prerelease, it will bump to the next version\n        // drop any prereleases that might already exist, since they are not\n        // relevant at this point.\n        this.prerelease.length = 0\n        this.inc('patch', identifier, identifierBase)\n        this.inc('pre', identifier, identifierBase)\n        break\n      // If the input is a non-prerelease version, this acts the same as\n      // prepatch.\n      case 'prerelease':\n        if (this.prerelease.length === 0) {\n          this.inc('patch', identifier, identifierBase)\n        }\n        this.inc('pre', identifier, identifierBase)\n        break\n\n      case 'major':\n        // If this is a pre-major version, bump up to the same major version.\n        // Otherwise increment major.\n        // 1.0.0-5 bumps to 1.0.0\n        // 1.1.0 bumps to 2.0.0\n        if (\n          this.minor !== 0 ||\n          this.patch !== 0 ||\n          this.prerelease.length === 0\n        ) {\n          this.major++\n        }\n        this.minor = 0\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'minor':\n        // If this is a pre-minor version, bump up to the same minor version.\n        // Otherwise increment minor.\n        // 1.2.0-5 bumps to 1.2.0\n        // 1.2.1 bumps to 1.3.0\n        if (this.patch !== 0 || this.prerelease.length === 0) {\n          this.minor++\n        }\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'patch':\n        // If this is not a pre-release version, it will increment the patch.\n        // If it is a pre-release it will bump up to the same patch version.\n        // 1.2.0-5 patches to 1.2.0\n        // 1.2.0 patches to 1.2.1\n        if (this.prerelease.length === 0) {\n          this.patch++\n        }\n        this.prerelease = []\n        break\n      // This probably shouldn't be used publicly.\n      // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n      case 'pre': {\n        const base = Number(identifierBase) ? 1 : 0\n\n        if (!identifier && identifierBase === false) {\n          throw new Error('invalid increment argument: identifier is empty')\n        }\n\n        if (this.prerelease.length === 0) {\n          this.prerelease = [base]\n        } else {\n          let i = this.prerelease.length\n          while (--i >= 0) {\n            if (typeof this.prerelease[i] === 'number') {\n              this.prerelease[i]++\n              i = -2\n            }\n          }\n          if (i === -1) {\n            // didn't increment anything\n            if (identifier === this.prerelease.join('.') && identifierBase === false) {\n              throw new Error('invalid increment argument: identifier already exists')\n            }\n            this.prerelease.push(base)\n          }\n        }\n        if (identifier) {\n          // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n          // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n          let prerelease = [identifier, base]\n          if (identifierBase === false) {\n            prerelease = [identifier]\n          }\n          if (compareIdentifiers(this.prerelease[0], identifier) === 0) {\n            if (isNaN(this.prerelease[1])) {\n              this.prerelease = prerelease\n            }\n          } else {\n            this.prerelease = prerelease\n          }\n        }\n        break\n      }\n      default:\n        throw new Error(`invalid increment argument: ${release}`)\n    }\n    this.raw = this.format()\n    if (this.build.length) {\n      this.raw += `+${this.build.join('.')}`\n    }\n    return this\n  }\n}\n\nmodule.exports = SemVer\n", "const SemVer = require('../classes/semver')\nconst parse = (version, options, throwErrors = false) => {\n  if (version instanceof SemVer) {\n    return version\n  }\n  try {\n    return new SemVer(version, options)\n  } catch (er) {\n    if (!throwErrors) {\n      return null\n    }\n    throw er\n  }\n}\n\nmodule.exports = parse\n", "const parse = require('./parse')\nconst valid = (version, options) => {\n  const v = parse(version, options)\n  return v ? v.version : null\n}\nmodule.exports = valid\n", "const parse = require('./parse')\nconst clean = (version, options) => {\n  const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n  return s ? s.version : null\n}\nmodule.exports = clean\n", "const SemVer = require('../classes/semver')\n\nconst inc = (version, release, options, identifier, identifierBase) => {\n  if (typeof (options) === 'string') {\n    identifierBase = identifier\n    identifier = options\n    options = undefined\n  }\n\n  try {\n    return new SemVer(\n      version instanceof SemVer ? version.version : version,\n      options\n    ).inc(release, identifier, identifierBase).version\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = inc\n", "const parse = require('./parse.js')\n\nconst diff = (version1, version2) => {\n  const v1 = parse(version1, null, true)\n  const v2 = parse(version2, null, true)\n  const comparison = v1.compare(v2)\n\n  if (comparison === 0) {\n    return null\n  }\n\n  const v1Higher = comparison > 0\n  const highVersion = v1Higher ? v1 : v2\n  const lowVersion = v1Higher ? v2 : v1\n  const highHasPre = !!highVersion.prerelease.length\n  const lowHasPre = !!lowVersion.prerelease.length\n\n  if (lowHasPre && !highHasPre) {\n    // Going from prerelease -> no prerelease requires some special casing\n\n    // If the low version has only a major, then it will always be a major\n    // Some examples:\n    // 1.0.0-1 -> 1.0.0\n    // 1.0.0-1 -> 1.1.1\n    // 1.0.0-1 -> 2.0.0\n    if (!lowVersion.patch && !lowVersion.minor) {\n      return 'major'\n    }\n\n    // Otherwise it can be determined by checking the high version\n\n    if (highVersion.patch) {\n      // anything higher than a patch bump would result in the wrong version\n      return 'patch'\n    }\n\n    if (highVersion.minor) {\n      // anything higher than a minor bump would result in the wrong version\n      return 'minor'\n    }\n\n    // bumping major/minor/patch all have same result\n    return 'major'\n  }\n\n  // add the `pre` prefix if we are going to a prerelease version\n  const prefix = highHasPre ? 'pre' : ''\n\n  if (v1.major !== v2.major) {\n    return prefix + 'major'\n  }\n\n  if (v1.minor !== v2.minor) {\n    return prefix + 'minor'\n  }\n\n  if (v1.patch !== v2.patch) {\n    return prefix + 'patch'\n  }\n\n  // high and low are preleases\n  return 'prerelease'\n}\n\nmodule.exports = diff\n", "const SemVer = require('../classes/semver')\nconst major = (a, loose) => new SemVer(a, loose).major\nmodule.exports = major\n", "const SemVer = require('../classes/semver')\nconst minor = (a, loose) => new SemVer(a, loose).minor\nmodule.exports = minor\n", "const SemVer = require('../classes/semver')\nconst patch = (a, loose) => new SemVer(a, loose).patch\nmodule.exports = patch\n", "const parse = require('./parse')\nconst prerelease = (version, options) => {\n  const parsed = parse(version, options)\n  return (parsed && parsed.prerelease.length) ? parsed.prerelease : null\n}\nmodule.exports = prerelease\n", "const SemVer = require('../classes/semver')\nconst compare = (a, b, loose) =>\n  new SemVer(a, loose).compare(new SemVer(b, loose))\n\nmodule.exports = compare\n", "const compare = require('./compare')\nconst rcompare = (a, b, loose) => compare(b, a, loose)\nmodule.exports = rcompare\n", "const compare = require('./compare')\nconst compareLoose = (a, b) => compare(a, b, true)\nmodule.exports = compareLoose\n", "const SemVer = require('../classes/semver')\nconst compareBuild = (a, b, loose) => {\n  const versionA = new SemVer(a, loose)\n  const versionB = new SemVer(b, loose)\n  return versionA.compare(versionB) || versionA.compareBuild(versionB)\n}\nmodule.exports = compareBuild\n", "const compareBuild = require('./compare-build')\nconst sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose))\nmodule.exports = sort\n", "const compareBuild = require('./compare-build')\nconst rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose))\nmodule.exports = rsort\n", "const compare = require('./compare')\nconst gt = (a, b, loose) => compare(a, b, loose) > 0\nmodule.exports = gt\n", "const compare = require('./compare')\nconst lt = (a, b, loose) => compare(a, b, loose) < 0\nmodule.exports = lt\n", "const compare = require('./compare')\nconst eq = (a, b, loose) => compare(a, b, loose) === 0\nmodule.exports = eq\n", "const compare = require('./compare')\nconst neq = (a, b, loose) => compare(a, b, loose) !== 0\nmodule.exports = neq\n", "const compare = require('./compare')\nconst gte = (a, b, loose) => compare(a, b, loose) >= 0\nmodule.exports = gte\n", "const compare = require('./compare')\nconst lte = (a, b, loose) => compare(a, b, loose) <= 0\nmodule.exports = lte\n", "const eq = require('./eq')\nconst neq = require('./neq')\nconst gt = require('./gt')\nconst gte = require('./gte')\nconst lt = require('./lt')\nconst lte = require('./lte')\n\nconst cmp = (a, op, b, loose) => {\n  switch (op) {\n    case '===':\n      if (typeof a === 'object') {\n        a = a.version\n      }\n      if (typeof b === 'object') {\n        b = b.version\n      }\n      return a === b\n\n    case '!==':\n      if (typeof a === 'object') {\n        a = a.version\n      }\n      if (typeof b === 'object') {\n        b = b.version\n      }\n      return a !== b\n\n    case '':\n    case '=':\n    case '==':\n      return eq(a, b, loose)\n\n    case '!=':\n      return neq(a, b, loose)\n\n    case '>':\n      return gt(a, b, loose)\n\n    case '>=':\n      return gte(a, b, loose)\n\n    case '<':\n      return lt(a, b, loose)\n\n    case '<=':\n      return lte(a, b, loose)\n\n    default:\n      throw new TypeError(`Invalid operator: ${op}`)\n  }\n}\nmodule.exports = cmp\n", "const SemVer = require('../classes/semver')\nconst parse = require('./parse')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst coerce = (version, options) => {\n  if (version instanceof SemVer) {\n    return version\n  }\n\n  if (typeof version === 'number') {\n    version = String(version)\n  }\n\n  if (typeof version !== 'string') {\n    return null\n  }\n\n  options = options || {}\n\n  let match = null\n  if (!options.rtl) {\n    match = version.match(options.includePrerelease ? re[t.COERCEFULL] : re[t.COERCE])\n  } else {\n    // Find the right-most coercible string that does not share\n    // a terminus with a more left-ward coercible string.\n    // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'\n    // With includePrerelease option set, '1.2.3.4-rc' wants to coerce '2.3.4-rc', not '2.3.4'\n    //\n    // Walk through the string checking with a /g regexp\n    // Manually set the index so as to pick up overlapping matches.\n    // Stop when we get a match that ends at the string end, since no\n    // coercible string can be more right-ward without the same terminus.\n    const coerceRtlRegex = options.includePrerelease ? re[t.COERCERTLFULL] : re[t.COERCERTL]\n    let next\n    while ((next = coerceRtlRegex.exec(version)) &&\n        (!match || match.index + match[0].length !== version.length)\n    ) {\n      if (!match ||\n            next.index + next[0].length !== match.index + match[0].length) {\n        match = next\n      }\n      coerceRtlRegex.lastIndex = next.index + next[1].length + next[2].length\n    }\n    // leave it in a clean state\n    coerceRtlRegex.lastIndex = -1\n  }\n\n  if (match === null) {\n    return null\n  }\n\n  const major = match[2]\n  const minor = match[3] || '0'\n  const patch = match[4] || '0'\n  const prerelease = options.includePrerelease && match[5] ? `-${match[5]}` : ''\n  const build = options.includePrerelease && match[6] ? `+${match[6]}` : ''\n\n  return parse(`${major}.${minor}.${patch}${prerelease}${build}`, options)\n}\nmodule.exports = coerce\n", "class LRUCache {\n  constructor () {\n    this.max = 1000\n    this.map = new Map()\n  }\n\n  get (key) {\n    const value = this.map.get(key)\n    if (value === undefined) {\n      return undefined\n    } else {\n      // Remove the key from the map and add it to the end\n      this.map.delete(key)\n      this.map.set(key, value)\n      return value\n    }\n  }\n\n  delete (key) {\n    return this.map.delete(key)\n  }\n\n  set (key, value) {\n    const deleted = this.delete(key)\n\n    if (!deleted && value !== undefined) {\n      // If cache is full, delete the least recently used item\n      if (this.map.size >= this.max) {\n        const firstKey = this.map.keys().next().value\n        this.delete(firstKey)\n      }\n\n      this.map.set(key, value)\n    }\n\n    return this\n  }\n}\n\nmodule.exports = LRUCache\n", "const SPACE_CHARACTERS = /\\s+/g\n\n// hoisted class for cyclic dependency\nclass Range {\n  constructor (range, options) {\n    options = parseOptions(options)\n\n    if (range instanceof Range) {\n      if (\n        range.loose === !!options.loose &&\n        range.includePrerelease === !!options.includePrerelease\n      ) {\n        return range\n      } else {\n        return new Range(range.raw, options)\n      }\n    }\n\n    if (range instanceof Comparator) {\n      // just put it in the set and return\n      this.raw = range.value\n      this.set = [[range]]\n      this.formatted = undefined\n      return this\n    }\n\n    this.options = options\n    this.loose = !!options.loose\n    this.includePrerelease = !!options.includePrerelease\n\n    // First reduce all whitespace as much as possible so we do not have to rely\n    // on potentially slow regexes like \\s*. This is then stored and used for\n    // future error messages as well.\n    this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')\n\n    // First, split on ||\n    this.set = this.raw\n      .split('||')\n      // map the range to a 2d array of comparators\n      .map(r => this.parseRange(r.trim()))\n      // throw out any comparator lists that are empty\n      // this generally means that it was not a valid range, which is allowed\n      // in loose mode, but will still throw if the WHOLE range is invalid.\n      .filter(c => c.length)\n\n    if (!this.set.length) {\n      throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n    }\n\n    // if we have any that are not the null set, throw out null sets.\n    if (this.set.length > 1) {\n      // keep the first one, in case they're all null sets\n      const first = this.set[0]\n      this.set = this.set.filter(c => !isNullSet(c[0]))\n      if (this.set.length === 0) {\n        this.set = [first]\n      } else if (this.set.length > 1) {\n        // if we have any that are *, then the range is just *\n        for (const c of this.set) {\n          if (c.length === 1 && isAny(c[0])) {\n            this.set = [c]\n            break\n          }\n        }\n      }\n    }\n\n    this.formatted = undefined\n  }\n\n  get range () {\n    if (this.formatted === undefined) {\n      this.formatted = ''\n      for (let i = 0; i < this.set.length; i++) {\n        if (i > 0) {\n          this.formatted += '||'\n        }\n        const comps = this.set[i]\n        for (let k = 0; k < comps.length; k++) {\n          if (k > 0) {\n            this.formatted += ' '\n          }\n          this.formatted += comps[k].toString().trim()\n        }\n      }\n    }\n    return this.formatted\n  }\n\n  format () {\n    return this.range\n  }\n\n  toString () {\n    return this.range\n  }\n\n  parseRange (range) {\n    // memoize range parsing for performance.\n    // this is a very hot path, and fully deterministic.\n    const memoOpts =\n      (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n      (this.options.loose && FLAG_LOOSE)\n    const memoKey = memoOpts + ':' + range\n    const cached = cache.get(memoKey)\n    if (cached) {\n      return cached\n    }\n\n    const loose = this.options.loose\n    // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n    const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n    range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n    debug('hyphen replace', range)\n\n    // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n    range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n    debug('comparator trim', range)\n\n    // `~ 1.2.3` => `~1.2.3`\n    range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n    debug('tilde trim', range)\n\n    // `^ 1.2.3` => `^1.2.3`\n    range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n    debug('caret trim', range)\n\n    // At this point, the range is completely trimmed and\n    // ready to be split into comparators.\n\n    let rangeList = range\n      .split(' ')\n      .map(comp => parseComparator(comp, this.options))\n      .join(' ')\n      .split(/\\s+/)\n      // >=0.0.0 is equivalent to *\n      .map(comp => replaceGTE0(comp, this.options))\n\n    if (loose) {\n      // in loose mode, throw out any that are not valid comparators\n      rangeList = rangeList.filter(comp => {\n        debug('loose invalid filter', comp, this.options)\n        return !!comp.match(re[t.COMPARATORLOOSE])\n      })\n    }\n    debug('range list', rangeList)\n\n    // if any comparators are the null set, then replace with JUST null set\n    // if more than one comparator, remove any * comparators\n    // also, don't include the same comparator more than once\n    const rangeMap = new Map()\n    const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n    for (const comp of comparators) {\n      if (isNullSet(comp)) {\n        return [comp]\n      }\n      rangeMap.set(comp.value, comp)\n    }\n    if (rangeMap.size > 1 && rangeMap.has('')) {\n      rangeMap.delete('')\n    }\n\n    const result = [...rangeMap.values()]\n    cache.set(memoKey, result)\n    return result\n  }\n\n  intersects (range, options) {\n    if (!(range instanceof Range)) {\n      throw new TypeError('a Range is required')\n    }\n\n    return this.set.some((thisComparators) => {\n      return (\n        isSatisfiable(thisComparators, options) &&\n        range.set.some((rangeComparators) => {\n          return (\n            isSatisfiable(rangeComparators, options) &&\n            thisComparators.every((thisComparator) => {\n              return rangeComparators.every((rangeComparator) => {\n                return thisComparator.intersects(rangeComparator, options)\n              })\n            })\n          )\n        })\n      )\n    })\n  }\n\n  // if ANY of the sets match ALL of its comparators, then pass\n  test (version) {\n    if (!version) {\n      return false\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    for (let i = 0; i < this.set.length; i++) {\n      if (testSet(this.set[i], version, this.options)) {\n        return true\n      }\n    }\n    return false\n  }\n}\n\nmodule.exports = Range\n\nconst LRU = require('../internal/lrucache')\nconst cache = new LRU()\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n  safeRe: re,\n  t,\n  comparatorTrimReplace,\n  tildeTrimReplace,\n  caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n  let result = true\n  const remainingComparators = comparators.slice()\n  let testComparator = remainingComparators.pop()\n\n  while (result && remainingComparators.length) {\n    result = remainingComparators.every((otherComparator) => {\n      return testComparator.intersects(otherComparator, options)\n    })\n\n    testComparator = remainingComparators.pop()\n  }\n\n  return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n  debug('comp', comp, options)\n  comp = replaceCarets(comp, options)\n  debug('caret', comp)\n  comp = replaceTildes(comp, options)\n  debug('tildes', comp)\n  comp = replaceXRanges(comp, options)\n  debug('xrange', comp)\n  comp = replaceStars(comp, options)\n  debug('stars', comp)\n  return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceTilde(c, options))\n    .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n  const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('tilde', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      // ~1.2 == >=1.2.0 <1.3.0-0\n      ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n    } else if (pr) {\n      debug('replaceTilde pr', pr)\n      ret = `>=${M}.${m}.${p}-${pr\n      } <${M}.${+m + 1}.0-0`\n    } else {\n      // ~1.2.3 == >=1.2.3 <1.3.0-0\n      ret = `>=${M}.${m}.${p\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('tilde return', ret)\n    return ret\n  })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceCaret(c, options))\n    .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n  debug('caret', comp, options)\n  const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n  const z = options.includePrerelease ? '-0' : ''\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('caret', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      if (M === '0') {\n        ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n      } else {\n        ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n      }\n    } else if (pr) {\n      debug('replaceCaret pr', pr)\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p}-${pr\n        } <${+M + 1}.0.0-0`\n      }\n    } else {\n      debug('no pr')\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p\n        } <${+M + 1}.0.0-0`\n      }\n    }\n\n    debug('caret return', ret)\n    return ret\n  })\n}\n\nconst replaceXRanges = (comp, options) => {\n  debug('replaceXRanges', comp, options)\n  return comp\n    .split(/\\s+/)\n    .map((c) => replaceXRange(c, options))\n    .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n  comp = comp.trim()\n  const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n    debug('xRange', comp, ret, gtlt, M, m, p, pr)\n    const xM = isX(M)\n    const xm = xM || isX(m)\n    const xp = xm || isX(p)\n    const anyX = xp\n\n    if (gtlt === '=' && anyX) {\n      gtlt = ''\n    }\n\n    // if we're including prereleases in the match, then we need\n    // to fix this to -0, the lowest possible prerelease value\n    pr = options.includePrerelease ? '-0' : ''\n\n    if (xM) {\n      if (gtlt === '>' || gtlt === '<') {\n        // nothing is allowed\n        ret = '<0.0.0-0'\n      } else {\n        // nothing is forbidden\n        ret = '*'\n      }\n    } else if (gtlt && anyX) {\n      // we know patch is an x, because we have any x at all.\n      // replace X with 0\n      if (xm) {\n        m = 0\n      }\n      p = 0\n\n      if (gtlt === '>') {\n        // >1 => >=2.0.0\n        // >1.2 => >=1.3.0\n        gtlt = '>='\n        if (xm) {\n          M = +M + 1\n          m = 0\n          p = 0\n        } else {\n          m = +m + 1\n          p = 0\n        }\n      } else if (gtlt === '<=') {\n        // <=0.7.x is actually <0.8.0, since any 0.7.x should\n        // pass.  Similarly, <=7.x is actually <8.0.0, etc.\n        gtlt = '<'\n        if (xm) {\n          M = +M + 1\n        } else {\n          m = +m + 1\n        }\n      }\n\n      if (gtlt === '<') {\n        pr = '-0'\n      }\n\n      ret = `${gtlt + M}.${m}.${p}${pr}`\n    } else if (xm) {\n      ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n    } else if (xp) {\n      ret = `>=${M}.${m}.0${pr\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('xRange return', ret)\n\n    return ret\n  })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n  debug('replaceStars', comp, options)\n  // Looseness is ignored here.  star is always as loose as it gets!\n  return comp\n    .trim()\n    .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n  debug('replaceGTE0', comp, options)\n  return comp\n    .trim()\n    .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\n// TODO build?\nconst hyphenReplace = incPr => ($0,\n  from, fM, fm, fp, fpr, fb,\n  to, tM, tm, tp, tpr) => {\n  if (isX(fM)) {\n    from = ''\n  } else if (isX(fm)) {\n    from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n  } else if (isX(fp)) {\n    from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n  } else if (fpr) {\n    from = `>=${from}`\n  } else {\n    from = `>=${from}${incPr ? '-0' : ''}`\n  }\n\n  if (isX(tM)) {\n    to = ''\n  } else if (isX(tm)) {\n    to = `<${+tM + 1}.0.0-0`\n  } else if (isX(tp)) {\n    to = `<${tM}.${+tm + 1}.0-0`\n  } else if (tpr) {\n    to = `<=${tM}.${tm}.${tp}-${tpr}`\n  } else if (incPr) {\n    to = `<${tM}.${tm}.${+tp + 1}-0`\n  } else {\n    to = `<=${to}`\n  }\n\n  return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n  for (let i = 0; i < set.length; i++) {\n    if (!set[i].test(version)) {\n      return false\n    }\n  }\n\n  if (version.prerelease.length && !options.includePrerelease) {\n    // Find the set of versions that are allowed to have prereleases\n    // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n    // That should allow `1.2.3-pr.2` to pass.\n    // However, `1.2.4-alpha.notready` should NOT be allowed,\n    // even though it's within the range set by the comparators.\n    for (let i = 0; i < set.length; i++) {\n      debug(set[i].semver)\n      if (set[i].semver === Comparator.ANY) {\n        continue\n      }\n\n      if (set[i].semver.prerelease.length > 0) {\n        const allowed = set[i].semver\n        if (allowed.major === version.major &&\n            allowed.minor === version.minor &&\n            allowed.patch === version.patch) {\n          return true\n        }\n      }\n    }\n\n    // Version has a -pre, but it's not one of the ones we like.\n    return false\n  }\n\n  return true\n}\n", "const ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n  static get ANY () {\n    return ANY\n  }\n\n  constructor (comp, options) {\n    options = parseOptions(options)\n\n    if (comp instanceof Comparator) {\n      if (comp.loose === !!options.loose) {\n        return comp\n      } else {\n        comp = comp.value\n      }\n    }\n\n    comp = comp.trim().split(/\\s+/).join(' ')\n    debug('comparator', comp, options)\n    this.options = options\n    this.loose = !!options.loose\n    this.parse(comp)\n\n    if (this.semver === ANY) {\n      this.value = ''\n    } else {\n      this.value = this.operator + this.semver.version\n    }\n\n    debug('comp', this)\n  }\n\n  parse (comp) {\n    const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n    const m = comp.match(r)\n\n    if (!m) {\n      throw new TypeError(`Invalid comparator: ${comp}`)\n    }\n\n    this.operator = m[1] !== undefined ? m[1] : ''\n    if (this.operator === '=') {\n      this.operator = ''\n    }\n\n    // if it literally is just '>' or '' then allow anything.\n    if (!m[2]) {\n      this.semver = ANY\n    } else {\n      this.semver = new SemVer(m[2], this.options.loose)\n    }\n  }\n\n  toString () {\n    return this.value\n  }\n\n  test (version) {\n    debug('Comparator.test', version, this.options.loose)\n\n    if (this.semver === ANY || version === ANY) {\n      return true\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    return cmp(version, this.operator, this.semver, this.options)\n  }\n\n  intersects (comp, options) {\n    if (!(comp instanceof Comparator)) {\n      throw new TypeError('a Comparator is required')\n    }\n\n    if (this.operator === '') {\n      if (this.value === '') {\n        return true\n      }\n      return new Range(comp.value, options).test(this.value)\n    } else if (comp.operator === '') {\n      if (comp.value === '') {\n        return true\n      }\n      return new Range(this.value, options).test(comp.semver)\n    }\n\n    options = parseOptions(options)\n\n    // Special cases where nothing can possibly be lower\n    if (options.includePrerelease &&\n      (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n      return false\n    }\n    if (!options.includePrerelease &&\n      (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n      return false\n    }\n\n    // Same direction increasing (> or >=)\n    if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n      return true\n    }\n    // Same direction decreasing (< or <=)\n    if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // same SemVer and both sides are inclusive (<= or >=)\n    if (\n      (this.semver.version === comp.semver.version) &&\n      this.operator.includes('=') && comp.operator.includes('=')) {\n      return true\n    }\n    // opposite directions less than\n    if (cmp(this.semver, '<', comp.semver, options) &&\n      this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // opposite directions greater than\n    if (cmp(this.semver, '>', comp.semver, options) &&\n      this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n      return true\n    }\n    return false\n  }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n", "const Range = require('../classes/range')\nconst satisfies = (version, range, options) => {\n  try {\n    range = new Range(range, options)\n  } catch (er) {\n    return false\n  }\n  return range.test(version)\n}\nmodule.exports = satisfies\n", "const Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n  new Range(range, options).set\n    .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n", "const SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\n\nconst maxSatisfying = (versions, range, options) => {\n  let max = null\n  let maxSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!max || maxSV.compare(v) === -1) {\n        // compare(max, v, true)\n        max = v\n        maxSV = new SemVer(max, options)\n      }\n    }\n  })\n  return max\n}\nmodule.exports = maxSatisfying\n", "const SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst minSatisfying = (versions, range, options) => {\n  let min = null\n  let minSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!min || minSV.compare(v) === 1) {\n        // compare(min, v, true)\n        min = v\n        minSV = new SemVer(min, options)\n      }\n    }\n  })\n  return min\n}\nmodule.exports = minSatisfying\n", "const SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst gt = require('../functions/gt')\n\nconst minVersion = (range, loose) => {\n  range = new Range(range, loose)\n\n  let minver = new SemVer('0.0.0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = new SemVer('0.0.0-0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = null\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let setMin = null\n    comparators.forEach((comparator) => {\n      // Clone to avoid manipulating the comparator's semver object.\n      const compver = new SemVer(comparator.semver.version)\n      switch (comparator.operator) {\n        case '>':\n          if (compver.prerelease.length === 0) {\n            compver.patch++\n          } else {\n            compver.prerelease.push(0)\n          }\n          compver.raw = compver.format()\n          /* fallthrough */\n        case '':\n        case '>=':\n          if (!setMin || gt(compver, setMin)) {\n            setMin = compver\n          }\n          break\n        case '<':\n        case '<=':\n          /* Ignore maximum versions */\n          break\n        /* istanbul ignore next */\n        default:\n          throw new Error(`Unexpected operation: ${comparator.operator}`)\n      }\n    })\n    if (setMin && (!minver || gt(minver, setMin))) {\n      minver = setMin\n    }\n  }\n\n  if (minver && range.test(minver)) {\n    return minver\n  }\n\n  return null\n}\nmodule.exports = minVersion\n", "const Range = require('../classes/range')\nconst validRange = (range, options) => {\n  try {\n    // Return '*' instead of '' so that truthiness works.\n    // This will throw if it's invalid anyway\n    return new Range(range, options).range || '*'\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = validRange\n", "const SemVer = require('../classes/semver')\nconst Comparator = require('../classes/comparator')\nconst { ANY } = Comparator\nconst Range = require('../classes/range')\nconst satisfies = require('../functions/satisfies')\nconst gt = require('../functions/gt')\nconst lt = require('../functions/lt')\nconst lte = require('../functions/lte')\nconst gte = require('../functions/gte')\n\nconst outside = (version, range, hilo, options) => {\n  version = new SemVer(version, options)\n  range = new Range(range, options)\n\n  let gtfn, ltefn, ltfn, comp, ecomp\n  switch (hilo) {\n    case '>':\n      gtfn = gt\n      ltefn = lte\n      ltfn = lt\n      comp = '>'\n      ecomp = '>='\n      break\n    case '<':\n      gtfn = lt\n      ltefn = gte\n      ltfn = gt\n      comp = '<'\n      ecomp = '<='\n      break\n    default:\n      throw new TypeError('Must provide a hilo val of \"<\" or \">\"')\n  }\n\n  // If it satisfies the range it is not outside\n  if (satisfies(version, range, options)) {\n    return false\n  }\n\n  // From now on, variable terms are as if we're in \"gtr\" mode.\n  // but note that everything is flipped for the \"ltr\" function.\n\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let high = null\n    let low = null\n\n    comparators.forEach((comparator) => {\n      if (comparator.semver === ANY) {\n        comparator = new Comparator('>=0.0.0')\n      }\n      high = high || comparator\n      low = low || comparator\n      if (gtfn(comparator.semver, high.semver, options)) {\n        high = comparator\n      } else if (ltfn(comparator.semver, low.semver, options)) {\n        low = comparator\n      }\n    })\n\n    // If the edge version comparator has a operator then our version\n    // isn't outside it\n    if (high.operator === comp || high.operator === ecomp) {\n      return false\n    }\n\n    // If the lowest version comparator has an operator and our version\n    // is less than it then it isn't higher than the range\n    if ((!low.operator || low.operator === comp) &&\n        ltefn(version, low.semver)) {\n      return false\n    } else if (low.operator === ecomp && ltfn(version, low.semver)) {\n      return false\n    }\n  }\n  return true\n}\n\nmodule.exports = outside\n", "// Determine if version is greater than all the versions possible in the range.\nconst outside = require('./outside')\nconst gtr = (version, range, options) => outside(version, range, '>', options)\nmodule.exports = gtr\n", "const outside = require('./outside')\n// Determine if version is less than all the versions possible in the range\nconst ltr = (version, range, options) => outside(version, range, '<', options)\nmodule.exports = ltr\n", "const Range = require('../classes/range')\nconst intersects = (r1, r2, options) => {\n  r1 = new Range(r1, options)\n  r2 = new Range(r2, options)\n  return r1.intersects(r2, options)\n}\nmodule.exports = intersects\n", "// given a set of versions and a range, create a \"simplified\" range\n// that includes the same versions that the original range does\n// If the original range is shorter than the simplified one, return that.\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\nmodule.exports = (versions, range, options) => {\n  const set = []\n  let first = null\n  let prev = null\n  const v = versions.sort((a, b) => compare(a, b, options))\n  for (const version of v) {\n    const included = satisfies(version, range, options)\n    if (included) {\n      prev = version\n      if (!first) {\n        first = version\n      }\n    } else {\n      if (prev) {\n        set.push([first, prev])\n      }\n      prev = null\n      first = null\n    }\n  }\n  if (first) {\n    set.push([first, null])\n  }\n\n  const ranges = []\n  for (const [min, max] of set) {\n    if (min === max) {\n      ranges.push(min)\n    } else if (!max && min === v[0]) {\n      ranges.push('*')\n    } else if (!max) {\n      ranges.push(`>=${min}`)\n    } else if (min === v[0]) {\n      ranges.push(`<=${max}`)\n    } else {\n      ranges.push(`${min} - ${max}`)\n    }\n  }\n  const simplified = ranges.join(' || ')\n  const original = typeof range.raw === 'string' ? range.raw : String(range)\n  return simplified.length < original.length ? simplified : range\n}\n", "const Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n//   some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n//   - If C is only the ANY comparator, return true\n//   - Else if in prerelease mode, return false\n//   - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n//   - if in prerelease mode, return true\n//   - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n//   - If GT, and EQ does not satisfy GT, return true (null set)\n//   - If LT, and EQ does not satisfy LT, return true (null set)\n//   - If EQ satisfies every C, return true\n//   - Else return false\n// - If GT\n//   - If GT.semver is lower than any > or >= comp in C, return false\n//   - If GT is >=, and GT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n//   - If LT.semver is greater than any < or <= comp in C, return false\n//   - If LT is <=, and LT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n  if (sub === dom) {\n    return true\n  }\n\n  sub = new Range(sub, options)\n  dom = new Range(dom, options)\n  let sawNonNull = false\n\n  OUTER: for (const simpleSub of sub.set) {\n    for (const simpleDom of dom.set) {\n      const isSub = simpleSubset(simpleSub, simpleDom, options)\n      sawNonNull = sawNonNull || isSub !== null\n      if (isSub) {\n        continue OUTER\n      }\n    }\n    // the null set is a subset of everything, but null simple ranges in\n    // a complex range should be ignored.  so if we saw a non-null range,\n    // then we know this isn't a subset, but if EVERY simple range was null,\n    // then it is a subset.\n    if (sawNonNull) {\n      return false\n    }\n  }\n  return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n  if (sub === dom) {\n    return true\n  }\n\n  if (sub.length === 1 && sub[0].semver === ANY) {\n    if (dom.length === 1 && dom[0].semver === ANY) {\n      return true\n    } else if (options.includePrerelease) {\n      sub = minimumVersionWithPreRelease\n    } else {\n      sub = minimumVersion\n    }\n  }\n\n  if (dom.length === 1 && dom[0].semver === ANY) {\n    if (options.includePrerelease) {\n      return true\n    } else {\n      dom = minimumVersion\n    }\n  }\n\n  const eqSet = new Set()\n  let gt, lt\n  for (const c of sub) {\n    if (c.operator === '>' || c.operator === '>=') {\n      gt = higherGT(gt, c, options)\n    } else if (c.operator === '<' || c.operator === '<=') {\n      lt = lowerLT(lt, c, options)\n    } else {\n      eqSet.add(c.semver)\n    }\n  }\n\n  if (eqSet.size > 1) {\n    return null\n  }\n\n  let gtltComp\n  if (gt && lt) {\n    gtltComp = compare(gt.semver, lt.semver, options)\n    if (gtltComp > 0) {\n      return null\n    } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n      return null\n    }\n  }\n\n  // will iterate one or zero times\n  for (const eq of eqSet) {\n    if (gt && !satisfies(eq, String(gt), options)) {\n      return null\n    }\n\n    if (lt && !satisfies(eq, String(lt), options)) {\n      return null\n    }\n\n    for (const c of dom) {\n      if (!satisfies(eq, String(c), options)) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  let higher, lower\n  let hasDomLT, hasDomGT\n  // if the subset has a prerelease, we need a comparator in the superset\n  // with the same tuple and a prerelease, or it's not a subset\n  let needDomLTPre = lt &&\n    !options.includePrerelease &&\n    lt.semver.prerelease.length ? lt.semver : false\n  let needDomGTPre = gt &&\n    !options.includePrerelease &&\n    gt.semver.prerelease.length ? gt.semver : false\n  // exception: <1.2.3-0 is the same as <1.2.3\n  if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n      lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n    needDomLTPre = false\n  }\n\n  for (const c of dom) {\n    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n    if (gt) {\n      if (needDomGTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomGTPre.major &&\n            c.semver.minor === needDomGTPre.minor &&\n            c.semver.patch === needDomGTPre.patch) {\n          needDomGTPre = false\n        }\n      }\n      if (c.operator === '>' || c.operator === '>=') {\n        higher = higherGT(gt, c, options)\n        if (higher === c && higher !== gt) {\n          return false\n        }\n      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (lt) {\n      if (needDomLTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomLTPre.major &&\n            c.semver.minor === needDomLTPre.minor &&\n            c.semver.patch === needDomLTPre.patch) {\n          needDomLTPre = false\n        }\n      }\n      if (c.operator === '<' || c.operator === '<=') {\n        lower = lowerLT(lt, c, options)\n        if (lower === c && lower !== lt) {\n          return false\n        }\n      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (!c.operator && (lt || gt) && gtltComp !== 0) {\n      return false\n    }\n  }\n\n  // if there was a < or >, and nothing in the dom, then must be false\n  // UNLESS it was limited by another range in the other direction.\n  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n  if (gt && hasDomLT && !lt && gtltComp !== 0) {\n    return false\n  }\n\n  if (lt && hasDomGT && !gt && gtltComp !== 0) {\n    return false\n  }\n\n  // we needed a prerelease range in a specific tuple, but didn't get one\n  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,\n  // because it includes prereleases in the 1.2.3 tuple\n  if (needDomGTPre || needDomLTPre) {\n    return false\n  }\n\n  return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp > 0 ? a\n    : comp < 0 ? b\n    : b.operator === '>' && a.operator === '>=' ? b\n    : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp < 0 ? a\n    : comp > 0 ? b\n    : b.operator === '<' && a.operator === '<=' ? b\n    : a\n}\n\nmodule.exports = subset\n", "// just pre-load all the stuff that index.js lazily exports\nconst internalRe = require('./internal/re')\nconst constants = require('./internal/constants')\nconst SemVer = require('./classes/semver')\nconst identifiers = require('./internal/identifiers')\nconst parse = require('./functions/parse')\nconst valid = require('./functions/valid')\nconst clean = require('./functions/clean')\nconst inc = require('./functions/inc')\nconst diff = require('./functions/diff')\nconst major = require('./functions/major')\nconst minor = require('./functions/minor')\nconst patch = require('./functions/patch')\nconst prerelease = require('./functions/prerelease')\nconst compare = require('./functions/compare')\nconst rcompare = require('./functions/rcompare')\nconst compareLoose = require('./functions/compare-loose')\nconst compareBuild = require('./functions/compare-build')\nconst sort = require('./functions/sort')\nconst rsort = require('./functions/rsort')\nconst gt = require('./functions/gt')\nconst lt = require('./functions/lt')\nconst eq = require('./functions/eq')\nconst neq = require('./functions/neq')\nconst gte = require('./functions/gte')\nconst lte = require('./functions/lte')\nconst cmp = require('./functions/cmp')\nconst coerce = require('./functions/coerce')\nconst Comparator = require('./classes/comparator')\nconst Range = require('./classes/range')\nconst satisfies = require('./functions/satisfies')\nconst toComparators = require('./ranges/to-comparators')\nconst maxSatisfying = require('./ranges/max-satisfying')\nconst minSatisfying = require('./ranges/min-satisfying')\nconst minVersion = require('./ranges/min-version')\nconst validRange = require('./ranges/valid')\nconst outside = require('./ranges/outside')\nconst gtr = require('./ranges/gtr')\nconst ltr = require('./ranges/ltr')\nconst intersects = require('./ranges/intersects')\nconst simplifyRange = require('./ranges/simplify')\nconst subset = require('./ranges/subset')\nmodule.exports = {\n  parse,\n  valid,\n  clean,\n  inc,\n  diff,\n  major,\n  minor,\n  patch,\n  prerelease,\n  compare,\n  rcompare,\n  compareLoose,\n  compareBuild,\n  sort,\n  rsort,\n  gt,\n  lt,\n  eq,\n  neq,\n  gte,\n  lte,\n  cmp,\n  coerce,\n  Comparator,\n  Range,\n  satisfies,\n  toComparators,\n  maxSatisfying,\n  minSatisfying,\n  minVersion,\n  validRange,\n  outside,\n  gtr,\n  ltr,\n  intersects,\n  simplifyRange,\n  subset,\n  SemVer,\n  re: internalRe.re,\n  src: internalRe.src,\n  tokens: internalRe.t,\n  SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,\n  RELEASE_TYPES: constants.RELEASE_TYPES,\n  compareIdentifiers: identifiers.compareIdentifiers,\n  rcompareIdentifiers: identifiers.rcompareIdentifiers,\n}\n", "import semver from \"semver\";\n\n/**\n * The USB product IDs will be defined as MMII, encoding a model (MM) and an interface bitfield (II)\n *\n ** Model\n * Ledger Nano S : 0x10\n * Ledger Blue : 0x00\n * Ledger Nano X : 0x40\n *\n ** Interface support bitfield\n * Generic HID : 0x01\n * Keyboard HID : 0x02\n * U2F : 0x04\n * CCID : 0x08\n * WebUSB : 0x10\n */\nexport const IIGenericHID = 0x01;\nexport const IIKeyboardHID = 0x02;\nexport const IIU2F = 0x04;\nexport const IICCID = 0x08;\nexport const IIWebUSB = 0x10;\n\nexport enum DeviceModelId {\n  /** Ledger Blue */\n  blue = \"blue\",\n  /** Ledger Nano S */\n  nanoS = \"nanoS\",\n  /** Ledger Nano S Plus */\n  nanoSP = \"nanoSP\",\n  /** Ledger Nano X */\n  nanoX = \"nanoX\",\n  /** Ledger Stax */\n  stax = \"stax\",\n  /** Ledger Flex (\"europa\" is the internal name) */\n  europa = \"europa\", // DO NOT CHANGE TO FLEX or handle all migration issues, things will break\n}\n\nconst devices: { [key in DeviceModelId]: DeviceModel } = {\n  [DeviceModelId.blue]: {\n    id: DeviceModelId.blue,\n    productName: \"Ledger\u00A0Blue\",\n    productIdMM: 0x00,\n    legacyUsbProductId: 0x0000,\n    usbOnly: true,\n    memorySize: 480 * 1024,\n    masks: [0x31000000, 0x31010000],\n    getBlockSize: (_firwareVersion: string): number => 4 * 1024,\n  },\n  [DeviceModelId.nanoS]: {\n    id: DeviceModelId.nanoS,\n    productName: \"Ledger\u00A0Nano\u00A0S\",\n    productIdMM: 0x10,\n    legacyUsbProductId: 0x0001,\n    usbOnly: true,\n    memorySize: 320 * 1024,\n    masks: [0x31100000],\n    getBlockSize: (firmwareVersion: string): number =>\n      semver.lt(semver.coerce(firmwareVersion) ?? \"\", \"2.0.0\") ? 4 * 1024 : 2 * 1024,\n  },\n  [DeviceModelId.nanoX]: {\n    id: DeviceModelId.nanoX,\n    productName: \"Ledger\u00A0Nano\u00A0X\",\n    productIdMM: 0x40,\n    legacyUsbProductId: 0x0004,\n    usbOnly: false,\n    memorySize: 2 * 1024 * 1024,\n    masks: [0x33000000],\n    getBlockSize: (_firwareVersion: string): number => 4 * 1024,\n    bluetoothSpec: [\n      {\n        serviceUuid: \"13d63400-2c97-0004-0000-4c6564676572\",\n        notifyUuid: \"13d63400-2c97-0004-0001-4c6564676572\",\n        writeUuid: \"13d63400-2c97-0004-0002-4c6564676572\",\n        writeCmdUuid: \"13d63400-2c97-0004-0003-4c6564676572\",\n      },\n    ],\n  },\n  [DeviceModelId.nanoSP]: {\n    id: DeviceModelId.nanoSP,\n    productName: \"Ledger Nano S Plus\",\n    productIdMM: 0x50,\n    legacyUsbProductId: 0x0005,\n    usbOnly: true,\n    memorySize: 1533 * 1024,\n    masks: [0x33100000],\n    getBlockSize: (_firmwareVersion: string): number => 32,\n  },\n  [DeviceModelId.stax]: {\n    id: DeviceModelId.stax,\n    productName: \"Ledger\u00A0Stax\",\n    productIdMM: 0x60,\n    legacyUsbProductId: 0x0006,\n    usbOnly: false,\n    memorySize: 1533 * 1024,\n    masks: [0x33200000],\n    getBlockSize: (_firmwareVersion: string): number => 32,\n    bluetoothSpec: [\n      {\n        serviceUuid: \"13d63400-2c97-6004-0000-4c6564676572\",\n        notifyUuid: \"13d63400-2c97-6004-0001-4c6564676572\",\n        writeUuid: \"13d63400-2c97-6004-0002-4c6564676572\",\n        writeCmdUuid: \"13d63400-2c97-6004-0003-4c6564676572\",\n      },\n    ],\n  },\n  [DeviceModelId.europa]: {\n    id: DeviceModelId.europa,\n    productName: \"Ledger\u00A0Flex\",\n    productIdMM: 0x70,\n    legacyUsbProductId: 0x0007,\n    usbOnly: false,\n    memorySize: 1533 * 1024,\n    masks: [0x33300000],\n    getBlockSize: (_firmwareVersion: string): number => 32,\n    bluetoothSpec: [\n      {\n        serviceUuid: \"13d63400-2c97-3004-0000-4c6564676572\",\n        notifyUuid: \"13d63400-2c97-3004-0001-4c6564676572\",\n        writeUuid: \"13d63400-2c97-3004-0002-4c6564676572\",\n        writeCmdUuid: \"13d63400-2c97-3004-0003-4c6564676572\",\n      },\n    ],\n  },\n};\n\nconst productMap = {\n  Blue: DeviceModelId.blue,\n  \"Nano S\": DeviceModelId.nanoS,\n  \"Nano S Plus\": DeviceModelId.nanoSP,\n  \"Nano X\": DeviceModelId.nanoX,\n  Stax: DeviceModelId.stax,\n  Europa: DeviceModelId.europa,\n};\n\nconst devicesList: DeviceModel[] = Object.values(devices);\n\n/**\n *\n */\nexport const ledgerUSBVendorId = 0x2c97;\n\n/**\n *\n */\nexport const getDeviceModel = (id: DeviceModelId): DeviceModel => {\n  const info = devices[id];\n  if (!info) throw new Error(\"device '\" + id + \"' does not exist\");\n  return info;\n};\n\n/**\n * Given a `targetId`, return the deviceModel associated to it,\n * based on the first two bytes.\n */\nexport const identifyTargetId = (targetId: number): DeviceModel | null | undefined => {\n  const deviceModel = devicesList.find(({ masks }) =>\n    masks.find(mask => (targetId & 0xffff0000) === mask),\n  );\n\n  return deviceModel;\n};\n\n/**\n * From a given USB product id, return the deviceModel associated to it.\n *\n * The mapping from the product id is only based on the 2 most significant bytes.\n * For example, Stax is defined with a product id of 0x60ii, a product id 0x6011 would be mapped to it.\n */\nexport const identifyUSBProductId = (usbProductId: number): DeviceModel | null | undefined => {\n  const legacy = devicesList.find(d => d.legacyUsbProductId === usbProductId);\n  if (legacy) return legacy;\n  const mm = usbProductId >> 8;\n  const deviceModel = devicesList.find(d => d.productIdMM === mm);\n  return deviceModel;\n};\n\nexport const identifyProductName = (productName: string): DeviceModel | null | undefined => {\n  const deviceModel = devicesList.find(d => d.id === productMap[productName]);\n  return deviceModel;\n};\n\nconst bluetoothServices: string[] = [];\nconst serviceUuidToInfos: Record<string, BluetoothInfos> = {};\n\nfor (const id in devices) {\n  const deviceModel = devices[id];\n  const { bluetoothSpec } = deviceModel;\n  if (bluetoothSpec) {\n    for (let i = 0; i < bluetoothSpec.length; i++) {\n      const spec = bluetoothSpec[i];\n      bluetoothServices.push(spec.serviceUuid);\n      serviceUuidToInfos[spec.serviceUuid] = serviceUuidToInfos[\n        spec.serviceUuid.replace(/-/g, \"\")\n      ] = {\n        deviceModel,\n        ...spec,\n      };\n    }\n  }\n}\n\n/**\n *\n */\nexport const getBluetoothServiceUuids = (): string[] => bluetoothServices;\n\n/**\n *\n */\nexport const getInfosForServiceUuid = (uuid: string): BluetoothInfos | undefined =>\n  serviceUuidToInfos[uuid.toLowerCase()];\n\n/**\n *\n */\nexport interface DeviceModel {\n  id: DeviceModelId;\n  productName: string;\n  productIdMM: number;\n  legacyUsbProductId: number;\n  usbOnly: boolean;\n  memorySize: number;\n  masks: number[];\n  // blockSize: number, // THIS FIELD IS DEPRECATED, use getBlockSize\n  getBlockSize: (firmwareVersion: string) => number;\n  bluetoothSpec?: {\n    serviceUuid: string;\n    writeUuid: string;\n    writeCmdUuid: string;\n    notifyUuid: string;\n  }[];\n}\n\n/**\n *\n */\nexport interface BluetoothInfos {\n  deviceModel: DeviceModel;\n  serviceUuid: string;\n  writeUuid: string;\n  writeCmdUuid: string;\n  notifyUuid: string;\n}\n", "/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol, Iterator */\n\nvar extendStatics = function(d, b) {\n  extendStatics = Object.setPrototypeOf ||\n      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n  return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null)\n      throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() { this.constructor = d; }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n  __assign = Object.assign || function __assign(t) {\n      for (var s, i = 1, n = arguments.length; i < n; i++) {\n          s = arguments[i];\n          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n      }\n      return t;\n  }\n  return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n      t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n              t[p[i]] = s[p[i]];\n      }\n  return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n  else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n  return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n  var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _, done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n      var context = {};\n      for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n      for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n      context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n      var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n      if (kind === \"accessor\") {\n          if (result === void 0) continue;\n          if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n          if (_ = accept(result.get)) descriptor.get = _;\n          if (_ = accept(result.set)) descriptor.set = _;\n          if (_ = accept(result.init)) initializers.unshift(_);\n      }\n      else if (_ = accept(result)) {\n          if (kind === \"field\") initializers.unshift(_);\n          else descriptor[key] = _;\n      }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n  return new (P || (P = Promise))(function (resolve, reject) {\n      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n      function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n      step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\n\nexport function __generator(thisArg, body) {\n  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n  return g.next = verb(0), g[\"throw\"] = verb(1), g[\"return\"] = verb(2), typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n  function verb(n) { return function (v) { return step([n, v]); }; }\n  function step(op) {\n      if (f) throw new TypeError(\"Generator is already executing.\");\n      while (g && (g = 0, op[0] && (_ = 0)), _) try {\n          if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n          if (y = 0, t) op = [op[0] & 2, t.value];\n          switch (op[0]) {\n              case 0: case 1: t = op; break;\n              case 4: _.label++; return { value: op[1], done: false };\n              case 5: _.label++; y = op[1]; op = [0]; continue;\n              case 7: op = _.ops.pop(); _.trys.pop(); continue;\n              default:\n                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                  if (t[2]) _.ops.pop();\n                  _.trys.pop(); continue;\n          }\n          op = body.call(thisArg, _);\n      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n  }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n  }\n  Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n      next: function () {\n          if (o && i >= o.length) o = void 0;\n          return { value: o && o[i++], done: !o };\n      }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o), r, ar = [], e;\n  try {\n      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  }\n  catch (error) { e = { error: error }; }\n  finally {\n      try {\n          if (r && !r.done && (m = i[\"return\"])) m.call(i);\n      }\n      finally { if (e) throw e.error; }\n  }\n  return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++)\n      ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++)\n      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n          r[k] = a[j];\n  return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n      if (ar || !(i in from)) {\n          if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n          ar[i] = from[i];\n      }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []), i, q = [];\n  return i = Object.create((typeof AsyncIterator === \"function\" ? AsyncIterator : Object).prototype), verb(\"next\"), verb(\"throw\"), verb(\"return\", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;\n  function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }\n  function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }\n  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n  function fulfill(value) { resume(\"next\", value); }\n  function reject(value) { resume(\"throw\", value); }\n  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator], i;\n  return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n  function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n  return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n  Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n  o[\"default\"] = v;\n};\n\nvar ownKeys = function(o) {\n  ownKeys = Object.getOwnPropertyNames || function (o) {\n    var ar = [];\n    for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n    return ar;\n  };\n  return ownKeys(o);\n};\n\nexport function __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n  __setModuleDefault(result, mod);\n  return result;\n}\n\nexport function __importDefault(mod) {\n  return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n  return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n  if (value !== null && value !== void 0) {\n    if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n    var dispose, inner;\n    if (async) {\n      if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n      dispose = value[Symbol.asyncDispose];\n    }\n    if (dispose === void 0) {\n      if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n      dispose = value[Symbol.dispose];\n      if (async) inner = dispose;\n    }\n    if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n    if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };\n    env.stack.push({ value: value, dispose: dispose, async: async });\n  }\n  else if (async) {\n    env.stack.push({ async: true });\n  }\n  return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n  var e = new Error(message);\n  return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n  function fail(e) {\n    env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n    env.hasError = true;\n  }\n  var r, s = 0;\n  function next() {\n    while (r = env.stack.pop()) {\n      try {\n        if (!r.async && s === 1) return s = 0, env.stack.push(r), Promise.resolve().then(next);\n        if (r.dispose) {\n          var result = r.dispose.call(r.value);\n          if (r.async) return s |= 2, Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n        }\n        else s |= 1;\n      }\n      catch (e) {\n        fail(e);\n      }\n    }\n    if (s === 1) return env.hasError ? Promise.reject(env.error) : Promise.resolve();\n    if (env.hasError) throw env.error;\n  }\n  return next();\n}\n\nexport function __rewriteRelativeImportExtension(path, preserveJsx) {\n  if (typeof path === \"string\" && /^\\.\\.?\\//.test(path)) {\n      return path.replace(/\\.(tsx)$|((?:\\.d)?)((?:\\.[^./]+?)?)\\.([cm]?)ts$/i, function (m, tsx, d, ext, cm) {\n          return tsx ? preserveJsx ? \".jsx\" : \".js\" : d && (!ext || !cm) ? m : (d + ext + \".\" + cm.toLowerCase() + \"js\");\n      });\n  }\n  return path;\n}\n\nexport default {\n  __extends,\n  __assign,\n  __rest,\n  __decorate,\n  __param,\n  __esDecorate,\n  __runInitializers,\n  __propKey,\n  __setFunctionName,\n  __metadata,\n  __awaiter,\n  __generator,\n  __createBinding,\n  __exportStar,\n  __values,\n  __read,\n  __spread,\n  __spreadArrays,\n  __spreadArray,\n  __await,\n  __asyncGenerator,\n  __asyncDelegator,\n  __asyncValues,\n  __makeTemplateObject,\n  __importStar,\n  __importDefault,\n  __classPrivateFieldGet,\n  __classPrivateFieldSet,\n  __classPrivateFieldIn,\n  __addDisposableResource,\n  __disposeResources,\n  __rewriteRelativeImportExtension,\n};\n", "/**\n * Returns true if the object is a function.\n * @param value The value to check\n */\nexport function isFunction(value: any): value is (...args: any[]) => any {\n  return typeof value === 'function';\n}\n", "/**\n * Used to create Error subclasses until the community moves away from ES5.\n *\n * This is because compiling from TypeScript down to ES5 has issues with subclassing Errors\n * as well as other built-in types: https://github.com/Microsoft/TypeScript/issues/12123\n *\n * @param createImpl A factory function to create the actual constructor implementation. The returned\n * function should be a named function that calls `_super` internally.\n */\nexport function createErrorClass<T>(createImpl: (_super: any) => any): T {\n  const _super = (instance: any) => {\n    Error.call(instance);\n    instance.stack = new Error().stack;\n  };\n\n  const ctorFunc = createImpl(_super);\n  ctorFunc.prototype = Object.create(Error.prototype);\n  ctorFunc.prototype.constructor = ctorFunc;\n  return ctorFunc;\n}\n", "import { createErrorClass } from './createErrorClass';\n\nexport interface UnsubscriptionError extends Error {\n  readonly errors: any[];\n}\n\nexport interface UnsubscriptionErrorCtor {\n  /**\n   * @deprecated Internal implementation detail. Do not construct error instances.\n   * Cannot be tagged as internal: https://github.com/ReactiveX/rxjs/issues/6269\n   */\n  new (errors: any[]): UnsubscriptionError;\n}\n\n/**\n * An error thrown when one or more errors have occurred during the\n * `unsubscribe` of a {@link Subscription}.\n */\nexport const UnsubscriptionError: UnsubscriptionErrorCtor = createErrorClass(\n  (_super) =>\n    function UnsubscriptionErrorImpl(this: any, errors: (Error | string)[]) {\n      _super(this);\n      this.message = errors\n        ? `${errors.length} errors occurred during unsubscription:\n${errors.map((err, i) => `${i + 1}) ${err.toString()}`).join('\\n  ')}`\n        : '';\n      this.name = 'UnsubscriptionError';\n      this.errors = errors;\n    }\n);\n", "/**\n * Removes an item from an array, mutating it.\n * @param arr The array to remove the item from\n * @param item The item to remove\n */\nexport function arrRemove<T>(arr: T[] | undefined | null, item: T) {\n  if (arr) {\n    const index = arr.indexOf(item);\n    0 <= index && arr.splice(index, 1);\n  }\n}\n", "import { isFunction } from './util/isFunction';\nimport { UnsubscriptionError } from './util/UnsubscriptionError';\nimport { SubscriptionLike, TeardownLogic, Unsubscribable } from './types';\nimport { arrRemove } from './util/arrRemove';\n\n/**\n * Represents a disposable resource, such as the execution of an Observable. A\n * Subscription has one important method, `unsubscribe`, that takes no argument\n * and just disposes the resource held by the subscription.\n *\n * Additionally, subscriptions may be grouped together through the `add()`\n * method, which will attach a child Subscription to the current Subscription.\n * When a Subscription is unsubscribed, all its children (and its grandchildren)\n * will be unsubscribed as well.\n *\n * @class Subscription\n */\nexport class Subscription implements SubscriptionLike {\n  /** @nocollapse */\n  public static EMPTY = (() => {\n    const empty = new Subscription();\n    empty.closed = true;\n    return empty;\n  })();\n\n  /**\n   * A flag to indicate whether this Subscription has already been unsubscribed.\n   */\n  public closed = false;\n\n  private _parentage: Subscription[] | Subscription | null = null;\n\n  /**\n   * The list of registered finalizers to execute upon unsubscription. Adding and removing from this\n   * list occurs in the {@link #add} and {@link #remove} methods.\n   */\n  private _finalizers: Exclude<TeardownLogic, void>[] | null = null;\n\n  /**\n   * @param initialTeardown A function executed first as part of the finalization\n   * process that is kicked off when {@link #unsubscribe} is called.\n   */\n  constructor(private initialTeardown?: () => void) {}\n\n  /**\n   * Disposes the resources held by the subscription. May, for instance, cancel\n   * an ongoing Observable execution or cancel any other type of work that\n   * started when the Subscription was created.\n   * @return {void}\n   */\n  unsubscribe(): void {\n    let errors: any[] | undefined;\n\n    if (!this.closed) {\n      this.closed = true;\n\n      // Remove this from it's parents.\n      const { _parentage } = this;\n      if (_parentage) {\n        this._parentage = null;\n        if (Array.isArray(_parentage)) {\n          for (const parent of _parentage) {\n            parent.remove(this);\n          }\n        } else {\n          _parentage.remove(this);\n        }\n      }\n\n      const { initialTeardown: initialFinalizer } = this;\n      if (isFunction(initialFinalizer)) {\n        try {\n          initialFinalizer();\n        } catch (e) {\n          errors = e instanceof UnsubscriptionError ? e.errors : [e];\n        }\n      }\n\n      const { _finalizers } = this;\n      if (_finalizers) {\n        this._finalizers = null;\n        for (const finalizer of _finalizers) {\n          try {\n            execFinalizer(finalizer);\n          } catch (err) {\n            errors = errors ?? [];\n            if (err instanceof UnsubscriptionError) {\n              errors = [...errors, ...err.errors];\n            } else {\n              errors.push(err);\n            }\n          }\n        }\n      }\n\n      if (errors) {\n        throw new UnsubscriptionError(errors);\n      }\n    }\n  }\n\n  /**\n   * Adds a finalizer to this subscription, so that finalization will be unsubscribed/called\n   * when this subscription is unsubscribed. If this subscription is already {@link #closed},\n   * because it has already been unsubscribed, then whatever finalizer is passed to it\n   * will automatically be executed (unless the finalizer itself is also a closed subscription).\n   *\n   * Closed Subscriptions cannot be added as finalizers to any subscription. Adding a closed\n   * subscription to a any subscription will result in no operation. (A noop).\n   *\n   * Adding a subscription to itself, or adding `null` or `undefined` will not perform any\n   * operation at all. (A noop).\n   *\n   * `Subscription` instances that are added to this instance will automatically remove themselves\n   * if they are unsubscribed. Functions and {@link Unsubscribable} objects that you wish to remove\n   * will need to be removed manually with {@link #remove}\n   *\n   * @param teardown The finalization logic to add to this subscription.\n   */\n  add(teardown: TeardownLogic): void {\n    // Only add the finalizer if it's not undefined\n    // and don't add a subscription to itself.\n    if (teardown && teardown !== this) {\n      if (this.closed) {\n        // If this subscription is already closed,\n        // execute whatever finalizer is handed to it automatically.\n        execFinalizer(teardown);\n      } else {\n        if (teardown instanceof Subscription) {\n          // We don't add closed subscriptions, and we don't add the same subscription\n          // twice. Subscription unsubscribe is idempotent.\n          if (teardown.closed || teardown._hasParent(this)) {\n            return;\n          }\n          teardown._addParent(this);\n        }\n        (this._finalizers = this._finalizers ?? []).push(teardown);\n      }\n    }\n  }\n\n  /**\n   * Checks to see if a this subscription already has a particular parent.\n   * This will signal that this subscription has already been added to the parent in question.\n   * @param parent the parent to check for\n   */\n  private _hasParent(parent: Subscription) {\n    const { _parentage } = this;\n    return _parentage === parent || (Array.isArray(_parentage) && _parentage.includes(parent));\n  }\n\n  /**\n   * Adds a parent to this subscription so it can be removed from the parent if it\n   * unsubscribes on it's own.\n   *\n   * NOTE: THIS ASSUMES THAT {@link _hasParent} HAS ALREADY BEEN CHECKED.\n   * @param parent The parent subscription to add\n   */\n  private _addParent(parent: Subscription) {\n    const { _parentage } = this;\n    this._parentage = Array.isArray(_parentage) ? (_parentage.push(parent), _parentage) : _parentage ? [_parentage, parent] : parent;\n  }\n\n  /**\n   * Called on a child when it is removed via {@link #remove}.\n   * @param parent The parent to remove\n   */\n  private _removeParent(parent: Subscription) {\n    const { _parentage } = this;\n    if (_parentage === parent) {\n      this._parentage = null;\n    } else if (Array.isArray(_parentage)) {\n      arrRemove(_parentage, parent);\n    }\n  }\n\n  /**\n   * Removes a finalizer from this subscription that was previously added with the {@link #add} method.\n   *\n   * Note that `Subscription` instances, when unsubscribed, will automatically remove themselves\n   * from every other `Subscription` they have been added to. This means that using the `remove` method\n   * is not a common thing and should be used thoughtfully.\n   *\n   * If you add the same finalizer instance of a function or an unsubscribable object to a `Subscription` instance\n   * more than once, you will need to call `remove` the same number of times to remove all instances.\n   *\n   * All finalizer instances are removed to free up memory upon unsubscription.\n   *\n   * @param teardown The finalizer to remove from this subscription\n   */\n  remove(teardown: Exclude<TeardownLogic, void>): void {\n    const { _finalizers } = this;\n    _finalizers && arrRemove(_finalizers, teardown);\n\n    if (teardown instanceof Subscription) {\n      teardown._removeParent(this);\n    }\n  }\n}\n\nexport const EMPTY_SUBSCRIPTION = Subscription.EMPTY;\n\nexport function isSubscription(value: any): value is Subscription {\n  return (\n    value instanceof Subscription ||\n    (value && 'closed' in value && isFunction(value.remove) && isFunction(value.add) && isFunction(value.unsubscribe))\n  );\n}\n\nfunction execFinalizer(finalizer: Unsubscribable | (() => void)) {\n  if (isFunction(finalizer)) {\n    finalizer();\n  } else {\n    finalizer.unsubscribe();\n  }\n}\n", "import { Subscriber } from './Subscriber';\nimport { ObservableNotification } from './types';\n\n/**\n * The {@link GlobalConfig} object for RxJS. It is used to configure things\n * like how to react on unhandled errors.\n */\nexport const config: GlobalConfig = {\n  onUnhandledError: null,\n  onStoppedNotification: null,\n  Promise: undefined,\n  useDeprecatedSynchronousErrorHandling: false,\n  useDeprecatedNextContext: false,\n};\n\n/**\n * The global configuration object for RxJS, used to configure things\n * like how to react on unhandled errors. Accessible via {@link config}\n * object.\n */\nexport interface GlobalConfig {\n  /**\n   * A registration point for unhandled errors from RxJS. These are errors that\n   * cannot were not handled by consuming code in the usual subscription path. For\n   * example, if you have this configured, and you subscribe to an observable without\n   * providing an error handler, errors from that subscription will end up here. This\n   * will _always_ be called asynchronously on another job in the runtime. This is because\n   * we do not want errors thrown in this user-configured handler to interfere with the\n   * behavior of the library.\n   */\n  onUnhandledError: ((err: any) => void) | null;\n\n  /**\n   * A registration point for notifications that cannot be sent to subscribers because they\n   * have completed, errored or have been explicitly unsubscribed. By default, next, complete\n   * and error notifications sent to stopped subscribers are noops. However, sometimes callers\n   * might want a different behavior. For example, with sources that attempt to report errors\n   * to stopped subscribers, a caller can configure RxJS to throw an unhandled error instead.\n   * This will _always_ be called asynchronously on another job in the runtime. This is because\n   * we do not want errors thrown in this user-configured handler to interfere with the\n   * behavior of the library.\n   */\n  onStoppedNotification: ((notification: ObservableNotification<any>, subscriber: Subscriber<any>) => void) | null;\n\n  /**\n   * The promise constructor used by default for {@link Observable#toPromise toPromise} and {@link Observable#forEach forEach}\n   * methods.\n   *\n   * @deprecated As of version 8, RxJS will no longer support this sort of injection of a\n   * Promise constructor. If you need a Promise implementation other than native promises,\n   * please polyfill/patch Promise as you see appropriate. Will be removed in v8.\n   */\n  Promise?: PromiseConstructorLike;\n\n  /**\n   * If true, turns on synchronous error rethrowing, which is a deprecated behavior\n   * in v6 and higher. This behavior enables bad patterns like wrapping a subscribe\n   * call in a try/catch block. It also enables producer interference, a nasty bug\n   * where a multicast can be broken for all observers by a downstream consumer with\n   * an unhandled error. DO NOT USE THIS FLAG UNLESS IT'S NEEDED TO BUY TIME\n   * FOR MIGRATION REASONS.\n   *\n   * @deprecated As of version 8, RxJS will no longer support synchronous throwing\n   * of unhandled errors. All errors will be thrown on a separate call stack to prevent bad\n   * behaviors described above. Will be removed in v8.\n   */\n  useDeprecatedSynchronousErrorHandling: boolean;\n\n  /**\n   * If true, enables an as-of-yet undocumented feature from v5: The ability to access\n   * `unsubscribe()` via `this` context in `next` functions created in observers passed\n   * to `subscribe`.\n   *\n   * This is being removed because the performance was severely problematic, and it could also cause\n   * issues when types other than POJOs are passed to subscribe as subscribers, as they will likely have\n   * their `this` context overwritten.\n   *\n   * @deprecated As of version 8, RxJS will no longer support altering the\n   * context of next functions provided as part of an observer to Subscribe. Instead,\n   * you will have access to a subscription or a signal or token that will allow you to do things like\n   * unsubscribe and test closed status. Will be removed in v8.\n   */\n  useDeprecatedNextContext: boolean;\n}\n", "import type { TimerHandle } from './timerHandle';\ntype SetTimeoutFunction = (handler: () => void, timeout?: number, ...args: any[]) => TimerHandle;\ntype ClearTimeoutFunction = (handle: TimerHandle) => void;\n\ninterface TimeoutProvider {\n  setTimeout: SetTimeoutFunction;\n  clearTimeout: ClearTimeoutFunction;\n  delegate:\n    | {\n        setTimeout: SetTimeoutFunction;\n        clearTimeout: ClearTimeoutFunction;\n      }\n    | undefined;\n}\n\nexport const timeoutProvider: TimeoutProvider = {\n  // When accessing the delegate, use the variable rather than `this` so that\n  // the functions can be called without being bound to the provider.\n  setTimeout(handler: () => void, timeout?: number, ...args) {\n    const { delegate } = timeoutProvider;\n    if (delegate?.setTimeout) {\n      return delegate.setTimeout(handler, timeout, ...args);\n    }\n    return setTimeout(handler, timeout, ...args);\n  },\n  clearTimeout(handle) {\n    const { delegate } = timeoutProvider;\n    return (delegate?.clearTimeout || clearTimeout)(handle as any);\n  },\n  delegate: undefined,\n};\n", "import { config } from '../config';\nimport { timeoutProvider } from '../scheduler/timeoutProvider';\n\n/**\n * Handles an error on another job either with the user-configured {@link onUnhandledError},\n * or by throwing it on that new job so it can be picked up by `window.onerror`, `process.on('error')`, etc.\n *\n * This should be called whenever there is an error that is out-of-band with the subscription\n * or when an error hits a terminal boundary of the subscription and no error handler was provided.\n *\n * @param err the error to report\n */\nexport function reportUnhandledError(err: any) {\n  timeoutProvider.setTimeout(() => {\n    const { onUnhandledError } = config;\n    if (onUnhandledError) {\n      // Execute the user-configured error handler.\n      onUnhandledError(err);\n    } else {\n      // Throw so it is picked up by the runtime's uncaught error mechanism.\n      throw err;\n    }\n  });\n}\n", "/* tslint:disable:no-empty */\nexport function noop() { }\n", "import { CompleteNotification, NextNotification, ErrorNotification } from './types';\n\n/**\n * A completion object optimized for memory use and created to be the\n * same \"shape\" as other notifications in v8.\n * @internal\n */\nexport const COMPLETE_NOTIFICATION = (() => createNotification('C', undefined, undefined) as CompleteNotification)();\n\n/**\n * Internal use only. Creates an optimized error notification that is the same \"shape\"\n * as other notifications.\n * @internal\n */\nexport function errorNotification(error: any): ErrorNotification {\n  return createNotification('E', undefined, error) as any;\n}\n\n/**\n * Internal use only. Creates an optimized next notification that is the same \"shape\"\n * as other notifications.\n * @internal\n */\nexport function nextNotification<T>(value: T) {\n  return createNotification('N', value, undefined) as NextNotification<T>;\n}\n\n/**\n * Ensures that all notifications created internally have the same \"shape\" in v8.\n *\n * TODO: This is only exported to support a crazy legacy test in `groupBy`.\n * @internal\n */\nexport function createNotification(kind: 'N' | 'E' | 'C', value: any, error: any) {\n  return {\n    kind,\n    value,\n    error,\n  };\n}\n", "import { config } from '../config';\n\nlet context: { errorThrown: boolean; error: any } | null = null;\n\n/**\n * Handles dealing with errors for super-gross mode. Creates a context, in which\n * any synchronously thrown errors will be passed to {@link captureError}. Which\n * will record the error such that it will be rethrown after the call back is complete.\n * TODO: Remove in v8\n * @param cb An immediately executed function.\n */\nexport function errorContext(cb: () => void) {\n  if (config.useDeprecatedSynchronousErrorHandling) {\n    const isRoot = !context;\n    if (isRoot) {\n      context = { errorThrown: false, error: null };\n    }\n    cb();\n    if (isRoot) {\n      const { errorThrown, error } = context!;\n      context = null;\n      if (errorThrown) {\n        throw error;\n      }\n    }\n  } else {\n    // This is the general non-deprecated path for everyone that\n    // isn't crazy enough to use super-gross mode (useDeprecatedSynchronousErrorHandling)\n    cb();\n  }\n}\n\n/**\n * Captures errors only in super-gross mode.\n * @param err the error to capture\n */\nexport function captureError(err: any) {\n  if (config.useDeprecatedSynchronousErrorHandling && context) {\n    context.errorThrown = true;\n    context.error = err;\n  }\n}\n", "import { isFunction } from './util/isFunction';\nimport { Observer, ObservableNotification } from './types';\nimport { isSubscription, Subscription } from './Subscription';\nimport { config } from './config';\nimport { reportUnhandledError } from './util/reportUnhandledError';\nimport { noop } from './util/noop';\nimport { nextNotification, errorNotification, COMPLETE_NOTIFICATION } from './NotificationFactories';\nimport { timeoutProvider } from './scheduler/timeoutProvider';\nimport { captureError } from './util/errorContext';\n\n/**\n * Implements the {@link Observer} interface and extends the\n * {@link Subscription} class. While the {@link Observer} is the public API for\n * consuming the values of an {@link Observable}, all Observers get converted to\n * a Subscriber, in order to provide Subscription-like capabilities such as\n * `unsubscribe`. Subscriber is a common type in RxJS, and crucial for\n * implementing operators, but it is rarely used as a public API.\n *\n * @class Subscriber<T>\n */\nexport class Subscriber<T> extends Subscription implements Observer<T> {\n  /**\n   * A static factory for a Subscriber, given a (potentially partial) definition\n   * of an Observer.\n   * @param next The `next` callback of an Observer.\n   * @param error The `error` callback of an\n   * Observer.\n   * @param complete The `complete` callback of an\n   * Observer.\n   * @return A Subscriber wrapping the (partially defined)\n   * Observer represented by the given arguments.\n   * @nocollapse\n   * @deprecated Do not use. Will be removed in v8. There is no replacement for this\n   * method, and there is no reason to be creating instances of `Subscriber` directly.\n   * If you have a specific use case, please file an issue.\n   */\n  static create<T>(next?: (x?: T) => void, error?: (e?: any) => void, complete?: () => void): Subscriber<T> {\n    return new SafeSubscriber(next, error, complete);\n  }\n\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  protected isStopped: boolean = false;\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  protected destination: Subscriber<any> | Observer<any>; // this `any` is the escape hatch to erase extra type param (e.g. R)\n\n  /**\n   * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n   * There is no reason to directly create an instance of Subscriber. This type is exported for typings reasons.\n   */\n  constructor(destination?: Subscriber<any> | Observer<any>) {\n    super();\n    if (destination) {\n      this.destination = destination;\n      // Automatically chain subscriptions together here.\n      // if destination is a Subscription, then it is a Subscriber.\n      if (isSubscription(destination)) {\n        destination.add(this);\n      }\n    } else {\n      this.destination = EMPTY_OBSERVER;\n    }\n  }\n\n  /**\n   * The {@link Observer} callback to receive notifications of type `next` from\n   * the Observable, with a value. The Observable may call this method 0 or more\n   * times.\n   * @param {T} [value] The `next` value.\n   * @return {void}\n   */\n  next(value?: T): void {\n    if (this.isStopped) {\n      handleStoppedNotification(nextNotification(value), this);\n    } else {\n      this._next(value!);\n    }\n  }\n\n  /**\n   * The {@link Observer} callback to receive notifications of type `error` from\n   * the Observable, with an attached `Error`. Notifies the Observer that\n   * the Observable has experienced an error condition.\n   * @param {any} [err] The `error` exception.\n   * @return {void}\n   */\n  error(err?: any): void {\n    if (this.isStopped) {\n      handleStoppedNotification(errorNotification(err), this);\n    } else {\n      this.isStopped = true;\n      this._error(err);\n    }\n  }\n\n  /**\n   * The {@link Observer} callback to receive a valueless notification of type\n   * `complete` from the Observable. Notifies the Observer that the Observable\n   * has finished sending push-based notifications.\n   * @return {void}\n   */\n  complete(): void {\n    if (this.isStopped) {\n      handleStoppedNotification(COMPLETE_NOTIFICATION, this);\n    } else {\n      this.isStopped = true;\n      this._complete();\n    }\n  }\n\n  unsubscribe(): void {\n    if (!this.closed) {\n      this.isStopped = true;\n      super.unsubscribe();\n      this.destination = null!;\n    }\n  }\n\n  protected _next(value: T): void {\n    this.destination.next(value);\n  }\n\n  protected _error(err: any): void {\n    try {\n      this.destination.error(err);\n    } finally {\n      this.unsubscribe();\n    }\n  }\n\n  protected _complete(): void {\n    try {\n      this.destination.complete();\n    } finally {\n      this.unsubscribe();\n    }\n  }\n}\n\n/**\n * This bind is captured here because we want to be able to have\n * compatibility with monoid libraries that tend to use a method named\n * `bind`. In particular, a library called Monio requires this.\n */\nconst _bind = Function.prototype.bind;\n\nfunction bind<Fn extends (...args: any[]) => any>(fn: Fn, thisArg: any): Fn {\n  return _bind.call(fn, thisArg);\n}\n\n/**\n * Internal optimization only, DO NOT EXPOSE.\n * @internal\n */\nclass ConsumerObserver<T> implements Observer<T> {\n  constructor(private partialObserver: Partial<Observer<T>>) {}\n\n  next(value: T): void {\n    const { partialObserver } = this;\n    if (partialObserver.next) {\n      try {\n        partialObserver.next(value);\n      } catch (error) {\n        handleUnhandledError(error);\n      }\n    }\n  }\n\n  error(err: any): void {\n    const { partialObserver } = this;\n    if (partialObserver.error) {\n      try {\n        partialObserver.error(err);\n      } catch (error) {\n        handleUnhandledError(error);\n      }\n    } else {\n      handleUnhandledError(err);\n    }\n  }\n\n  complete(): void {\n    const { partialObserver } = this;\n    if (partialObserver.complete) {\n      try {\n        partialObserver.complete();\n      } catch (error) {\n        handleUnhandledError(error);\n      }\n    }\n  }\n}\n\nexport class SafeSubscriber<T> extends Subscriber<T> {\n  constructor(\n    observerOrNext?: Partial<Observer<T>> | ((value: T) => void) | null,\n    error?: ((e?: any) => void) | null,\n    complete?: (() => void) | null\n  ) {\n    super();\n\n    let partialObserver: Partial<Observer<T>>;\n    if (isFunction(observerOrNext) || !observerOrNext) {\n      // The first argument is a function, not an observer. The next\n      // two arguments *could* be observers, or they could be empty.\n      partialObserver = {\n        next: (observerOrNext ?? undefined) as (((value: T) => void) | undefined),\n        error: error ?? undefined,\n        complete: complete ?? undefined,\n      };\n    } else {\n      // The first argument is a partial observer.\n      let context: any;\n      if (this && config.useDeprecatedNextContext) {\n        // This is a deprecated path that made `this.unsubscribe()` available in\n        // next handler functions passed to subscribe. This only exists behind a flag\n        // now, as it is *very* slow.\n        context = Object.create(observerOrNext);\n        context.unsubscribe = () => this.unsubscribe();\n        partialObserver = {\n          next: observerOrNext.next && bind(observerOrNext.next, context),\n          error: observerOrNext.error && bind(observerOrNext.error, context),\n          complete: observerOrNext.complete && bind(observerOrNext.complete, context),\n        };\n      } else {\n        // The \"normal\" path. Just use the partial observer directly.\n        partialObserver = observerOrNext;\n      }\n    }\n\n    // Wrap the partial observer to ensure it's a full observer, and\n    // make sure proper error handling is accounted for.\n    this.destination = new ConsumerObserver(partialObserver);\n  }\n}\n\nfunction handleUnhandledError(error: any) {\n  if (config.useDeprecatedSynchronousErrorHandling) {\n    captureError(error);\n  } else {\n    // Ideal path, we report this as an unhandled error,\n    // which is thrown on a new call stack.\n    reportUnhandledError(error);\n  }\n}\n\n/**\n * An error handler used when no error handler was supplied\n * to the SafeSubscriber -- meaning no error handler was supplied\n * do the `subscribe` call on our observable.\n * @param err The error to handle\n */\nfunction defaultErrorHandler(err: any) {\n  throw err;\n}\n\n/**\n * A handler for notifications that cannot be sent to a stopped subscriber.\n * @param notification The notification being sent\n * @param subscriber The stopped subscriber\n */\nfunction handleStoppedNotification(notification: ObservableNotification<any>, subscriber: Subscriber<any>) {\n  const { onStoppedNotification } = config;\n  onStoppedNotification && timeoutProvider.setTimeout(() => onStoppedNotification(notification, subscriber));\n}\n\n/**\n * The observer used as a stub for subscriptions where the user did not\n * pass any arguments to `subscribe`. Comes with the default error handling\n * behavior.\n */\nexport const EMPTY_OBSERVER: Readonly<Observer<any>> & { closed: true } = {\n  closed: true,\n  next: noop,\n  error: defaultErrorHandler,\n  complete: noop,\n};\n", "/**\n * Symbol.observable or a string \"@@observable\". Used for interop\n *\n * @deprecated We will no longer be exporting this symbol in upcoming versions of RxJS.\n * Instead polyfill and use Symbol.observable directly *or* use https://www.npmjs.com/package/symbol-observable\n */\nexport const observable: string | symbol = (() => (typeof Symbol === 'function' && Symbol.observable) || '@@observable')();\n", "/**\n * This function takes one parameter and just returns it. Simply put,\n * this is like `<T>(x: T): T => x`.\n *\n * ## Examples\n *\n * This is useful in some cases when using things like `mergeMap`\n *\n * ```ts\n * import { interval, take, map, range, mergeMap, identity } from 'rxjs';\n *\n * const source$ = interval(1000).pipe(take(5));\n *\n * const result$ = source$.pipe(\n *   map(i => range(i)),\n *   mergeMap(identity) // same as mergeMap(x => x)\n * );\n *\n * result$.subscribe({\n *   next: console.log\n * });\n * ```\n *\n * Or when you want to selectively apply an operator\n *\n * ```ts\n * import { interval, take, identity } from 'rxjs';\n *\n * const shouldLimit = () => Math.random() < 0.5;\n *\n * const source$ = interval(1000);\n *\n * const result$ = source$.pipe(shouldLimit() ? take(5) : identity);\n *\n * result$.subscribe({\n *   next: console.log\n * });\n * ```\n *\n * @param x Any value that is returned by this function\n * @returns The value passed as the first parameter to this function\n */\nexport function identity<T>(x: T): T {\n  return x;\n}\n", "import { identity } from './identity';\nimport { UnaryFunction } from '../types';\n\nexport function pipe(): typeof identity;\nexport function pipe<T, A>(fn1: UnaryFunction<T, A>): UnaryFunction<T, A>;\nexport function pipe<T, A, B>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>): UnaryFunction<T, B>;\nexport function pipe<T, A, B, C>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>, fn3: UnaryFunction<B, C>): UnaryFunction<T, C>;\nexport function pipe<T, A, B, C, D>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>\n): UnaryFunction<T, D>;\nexport function pipe<T, A, B, C, D, E>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>\n): UnaryFunction<T, E>;\nexport function pipe<T, A, B, C, D, E, F>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>,\n  fn6: UnaryFunction<E, F>\n): UnaryFunction<T, F>;\nexport function pipe<T, A, B, C, D, E, F, G>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>,\n  fn6: UnaryFunction<E, F>,\n  fn7: UnaryFunction<F, G>\n): UnaryFunction<T, G>;\nexport function pipe<T, A, B, C, D, E, F, G, H>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>,\n  fn6: UnaryFunction<E, F>,\n  fn7: UnaryFunction<F, G>,\n  fn8: UnaryFunction<G, H>\n): UnaryFunction<T, H>;\nexport function pipe<T, A, B, C, D, E, F, G, H, I>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>,\n  fn6: UnaryFunction<E, F>,\n  fn7: UnaryFunction<F, G>,\n  fn8: UnaryFunction<G, H>,\n  fn9: UnaryFunction<H, I>\n): UnaryFunction<T, I>;\nexport function pipe<T, A, B, C, D, E, F, G, H, I>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>,\n  fn6: UnaryFunction<E, F>,\n  fn7: UnaryFunction<F, G>,\n  fn8: UnaryFunction<G, H>,\n  fn9: UnaryFunction<H, I>,\n  ...fns: UnaryFunction<any, any>[]\n): UnaryFunction<T, unknown>;\n\n/**\n * pipe() can be called on one or more functions, each of which can take one argument (\"UnaryFunction\")\n * and uses it to return a value.\n * It returns a function that takes one argument, passes it to the first UnaryFunction, and then\n * passes the result to the next one, passes that result to the next one, and so on.  \n */\nexport function pipe(...fns: Array<UnaryFunction<any, any>>): UnaryFunction<any, any> {\n  return pipeFromArray(fns);\n}\n\n/** @internal */\nexport function pipeFromArray<T, R>(fns: Array<UnaryFunction<T, R>>): UnaryFunction<T, R> {\n  if (fns.length === 0) {\n    return identity as UnaryFunction<any, any>;\n  }\n\n  if (fns.length === 1) {\n    return fns[0];\n  }\n\n  return function piped(input: T): R {\n    return fns.reduce((prev: any, fn: UnaryFunction<T, R>) => fn(prev), input as any);\n  };\n}\n", "import { Operator } from './Operator';\nimport { SafeSubscriber, Subscriber } from './Subscriber';\nimport { isSubscription, Subscription } from './Subscription';\nimport { TeardownLogic, OperatorFunction, Subscribable, Observer } from './types';\nimport { observable as Symbol_observable } from './symbol/observable';\nimport { pipeFromArray } from './util/pipe';\nimport { config } from './config';\nimport { isFunction } from './util/isFunction';\nimport { errorContext } from './util/errorContext';\n\n/**\n * A representation of any set of values over any amount of time. This is the most basic building block\n * of RxJS.\n *\n * @class Observable<T>\n */\nexport class Observable<T> implements Subscribable<T> {\n  /**\n   * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n   */\n  source: Observable<any> | undefined;\n\n  /**\n   * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n   */\n  operator: Operator<any, T> | undefined;\n\n  /**\n   * @constructor\n   * @param {Function} subscribe the function that is called when the Observable is\n   * initially subscribed to. This function is given a Subscriber, to which new values\n   * can be `next`ed, or an `error` method can be called to raise an error, or\n   * `complete` can be called to notify of a successful completion.\n   */\n  constructor(subscribe?: (this: Observable<T>, subscriber: Subscriber<T>) => TeardownLogic) {\n    if (subscribe) {\n      this._subscribe = subscribe;\n    }\n  }\n\n  // HACK: Since TypeScript inherits static properties too, we have to\n  // fight against TypeScript here so Subject can have a different static create signature\n  /**\n   * Creates a new Observable by calling the Observable constructor\n   * @owner Observable\n   * @method create\n   * @param {Function} subscribe? the subscriber function to be passed to the Observable constructor\n   * @return {Observable} a new observable\n   * @nocollapse\n   * @deprecated Use `new Observable()` instead. Will be removed in v8.\n   */\n  static create: (...args: any[]) => any = <T>(subscribe?: (subscriber: Subscriber<T>) => TeardownLogic) => {\n    return new Observable<T>(subscribe);\n  };\n\n  /**\n   * Creates a new Observable, with this Observable instance as the source, and the passed\n   * operator defined as the new observable's operator.\n   * @method lift\n   * @param operator the operator defining the operation to take on the observable\n   * @return a new observable with the Operator applied\n   * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n   * If you have implemented an operator using `lift`, it is recommended that you create an\n   * operator by simply returning `new Observable()` directly. See \"Creating new operators from\n   * scratch\" section here: https://rxjs.dev/guide/operators\n   */\n  lift<R>(operator?: Operator<T, R>): Observable<R> {\n    const observable = new Observable<R>();\n    observable.source = this;\n    observable.operator = operator;\n    return observable;\n  }\n\n  subscribe(observerOrNext?: Partial<Observer<T>> | ((value: T) => void)): Subscription;\n  /** @deprecated Instead of passing separate callback arguments, use an observer argument. Signatures taking separate callback arguments will be removed in v8. Details: https://rxjs.dev/deprecations/subscribe-arguments */\n  subscribe(next?: ((value: T) => void) | null, error?: ((error: any) => void) | null, complete?: (() => void) | null): Subscription;\n  /**\n   * Invokes an execution of an Observable and registers Observer handlers for notifications it will emit.\n   *\n   * <span class=\"informal\">Use it when you have all these Observables, but still nothing is happening.</span>\n   *\n   * `subscribe` is not a regular operator, but a method that calls Observable's internal `subscribe` function. It\n   * might be for example a function that you passed to Observable's constructor, but most of the time it is\n   * a library implementation, which defines what will be emitted by an Observable, and when it be will emitted. This means\n   * that calling `subscribe` is actually the moment when Observable starts its work, not when it is created, as it is often\n   * the thought.\n   *\n   * Apart from starting the execution of an Observable, this method allows you to listen for values\n   * that an Observable emits, as well as for when it completes or errors. You can achieve this in two\n   * of the following ways.\n   *\n   * The first way is creating an object that implements {@link Observer} interface. It should have methods\n   * defined by that interface, but note that it should be just a regular JavaScript object, which you can create\n   * yourself in any way you want (ES6 class, classic function constructor, object literal etc.). In particular, do\n   * not attempt to use any RxJS implementation details to create Observers - you don't need them. Remember also\n   * that your object does not have to implement all methods. If you find yourself creating a method that doesn't\n   * do anything, you can simply omit it. Note however, if the `error` method is not provided and an error happens,\n   * it will be thrown asynchronously. Errors thrown asynchronously cannot be caught using `try`/`catch`. Instead,\n   * use the {@link onUnhandledError} configuration option or use a runtime handler (like `window.onerror` or\n   * `process.on('error)`) to be notified of unhandled errors. Because of this, it's recommended that you provide\n   * an `error` method to avoid missing thrown errors.\n   *\n   * The second way is to give up on Observer object altogether and simply provide callback functions in place of its methods.\n   * This means you can provide three functions as arguments to `subscribe`, where the first function is equivalent\n   * of a `next` method, the second of an `error` method and the third of a `complete` method. Just as in case of an Observer,\n   * if you do not need to listen for something, you can omit a function by passing `undefined` or `null`,\n   * since `subscribe` recognizes these functions by where they were placed in function call. When it comes\n   * to the `error` function, as with an Observer, if not provided, errors emitted by an Observable will be thrown asynchronously.\n   *\n   * You can, however, subscribe with no parameters at all. This may be the case where you're not interested in terminal events\n   * and you also handled emissions internally by using operators (e.g. using `tap`).\n   *\n   * Whichever style of calling `subscribe` you use, in both cases it returns a Subscription object.\n   * This object allows you to call `unsubscribe` on it, which in turn will stop the work that an Observable does and will clean\n   * up all resources that an Observable used. Note that cancelling a subscription will not call `complete` callback\n   * provided to `subscribe` function, which is reserved for a regular completion signal that comes from an Observable.\n   *\n   * Remember that callbacks provided to `subscribe` are not guaranteed to be called asynchronously.\n   * It is an Observable itself that decides when these functions will be called. For example {@link of}\n   * by default emits all its values synchronously. Always check documentation for how given Observable\n   * will behave when subscribed and if its default behavior can be modified with a `scheduler`.\n   *\n   * #### Examples\n   *\n   * Subscribe with an {@link guide/observer Observer}\n   *\n   * ```ts\n   * import { of } from 'rxjs';\n   *\n   * const sumObserver = {\n   *   sum: 0,\n   *   next(value) {\n   *     console.log('Adding: ' + value);\n   *     this.sum = this.sum + value;\n   *   },\n   *   error() {\n   *     // We actually could just remove this method,\n   *     // since we do not really care about errors right now.\n   *   },\n   *   complete() {\n   *     console.log('Sum equals: ' + this.sum);\n   *   }\n   * };\n   *\n   * of(1, 2, 3) // Synchronously emits 1, 2, 3 and then completes.\n   *   .subscribe(sumObserver);\n   *\n   * // Logs:\n   * // 'Adding: 1'\n   * // 'Adding: 2'\n   * // 'Adding: 3'\n   * // 'Sum equals: 6'\n   * ```\n   *\n   * Subscribe with functions ({@link deprecations/subscribe-arguments deprecated})\n   *\n   * ```ts\n   * import { of } from 'rxjs'\n   *\n   * let sum = 0;\n   *\n   * of(1, 2, 3).subscribe(\n   *   value => {\n   *     console.log('Adding: ' + value);\n   *     sum = sum + value;\n   *   },\n   *   undefined,\n   *   () => console.log('Sum equals: ' + sum)\n   * );\n   *\n   * // Logs:\n   * // 'Adding: 1'\n   * // 'Adding: 2'\n   * // 'Adding: 3'\n   * // 'Sum equals: 6'\n   * ```\n   *\n   * Cancel a subscription\n   *\n   * ```ts\n   * import { interval } from 'rxjs';\n   *\n   * const subscription = interval(1000).subscribe({\n   *   next(num) {\n   *     console.log(num)\n   *   },\n   *   complete() {\n   *     // Will not be called, even when cancelling subscription.\n   *     console.log('completed!');\n   *   }\n   * });\n   *\n   * setTimeout(() => {\n   *   subscription.unsubscribe();\n   *   console.log('unsubscribed!');\n   * }, 2500);\n   *\n   * // Logs:\n   * // 0 after 1s\n   * // 1 after 2s\n   * // 'unsubscribed!' after 2.5s\n   * ```\n   *\n   * @param {Observer|Function} observerOrNext (optional) Either an observer with methods to be called,\n   * or the first of three possible handlers, which is the handler for each value emitted from the subscribed\n   * Observable.\n   * @param {Function} error (optional) A handler for a terminal event resulting from an error. If no error handler is provided,\n   * the error will be thrown asynchronously as unhandled.\n   * @param {Function} complete (optional) A handler for a terminal event resulting from successful completion.\n   * @return {Subscription} a subscription reference to the registered handlers\n   * @method subscribe\n   */\n  subscribe(\n    observerOrNext?: Partial<Observer<T>> | ((value: T) => void) | null,\n    error?: ((error: any) => void) | null,\n    complete?: (() => void) | null\n  ): Subscription {\n    const subscriber = isSubscriber(observerOrNext) ? observerOrNext : new SafeSubscriber(observerOrNext, error, complete);\n\n    errorContext(() => {\n      const { operator, source } = this;\n      subscriber.add(\n        operator\n          ? // We're dealing with a subscription in the\n            // operator chain to one of our lifted operators.\n            operator.call(subscriber, source)\n          : source\n          ? // If `source` has a value, but `operator` does not, something that\n            // had intimate knowledge of our API, like our `Subject`, must have\n            // set it. We're going to just call `_subscribe` directly.\n            this._subscribe(subscriber)\n          : // In all other cases, we're likely wrapping a user-provided initializer\n            // function, so we need to catch errors and handle them appropriately.\n            this._trySubscribe(subscriber)\n      );\n    });\n\n    return subscriber;\n  }\n\n  /** @internal */\n  protected _trySubscribe(sink: Subscriber<T>): TeardownLogic {\n    try {\n      return this._subscribe(sink);\n    } catch (err) {\n      // We don't need to return anything in this case,\n      // because it's just going to try to `add()` to a subscription\n      // above.\n      sink.error(err);\n    }\n  }\n\n  /**\n   * Used as a NON-CANCELLABLE means of subscribing to an observable, for use with\n   * APIs that expect promises, like `async/await`. You cannot unsubscribe from this.\n   *\n   * **WARNING**: Only use this with observables you *know* will complete. If the source\n   * observable does not complete, you will end up with a promise that is hung up, and\n   * potentially all of the state of an async function hanging out in memory. To avoid\n   * this situation, look into adding something like {@link timeout}, {@link take},\n   * {@link takeWhile}, or {@link takeUntil} amongst others.\n   *\n   * #### Example\n   *\n   * ```ts\n   * import { interval, take } from 'rxjs';\n   *\n   * const source$ = interval(1000).pipe(take(4));\n   *\n   * async function getTotal() {\n   *   let total = 0;\n   *\n   *   await source$.forEach(value => {\n   *     total += value;\n   *     console.log('observable -> ' + value);\n   *   });\n   *\n   *   return total;\n   * }\n   *\n   * getTotal().then(\n   *   total => console.log('Total: ' + total)\n   * );\n   *\n   * // Expected:\n   * // 'observable -> 0'\n   * // 'observable -> 1'\n   * // 'observable -> 2'\n   * // 'observable -> 3'\n   * // 'Total: 6'\n   * ```\n   *\n   * @param next a handler for each value emitted by the observable\n   * @return a promise that either resolves on observable completion or\n   *  rejects with the handled error\n   */\n  forEach(next: (value: T) => void): Promise<void>;\n\n  /**\n   * @param next a handler for each value emitted by the observable\n   * @param promiseCtor a constructor function used to instantiate the Promise\n   * @return a promise that either resolves on observable completion or\n   *  rejects with the handled error\n   * @deprecated Passing a Promise constructor will no longer be available\n   * in upcoming versions of RxJS. This is because it adds weight to the library, for very\n   * little benefit. If you need this functionality, it is recommended that you either\n   * polyfill Promise, or you create an adapter to convert the returned native promise\n   * to whatever promise implementation you wanted. Will be removed in v8.\n   */\n  forEach(next: (value: T) => void, promiseCtor: PromiseConstructorLike): Promise<void>;\n\n  forEach(next: (value: T) => void, promiseCtor?: PromiseConstructorLike): Promise<void> {\n    promiseCtor = getPromiseCtor(promiseCtor);\n\n    return new promiseCtor<void>((resolve, reject) => {\n      const subscriber = new SafeSubscriber<T>({\n        next: (value) => {\n          try {\n            next(value);\n          } catch (err) {\n            reject(err);\n            subscriber.unsubscribe();\n          }\n        },\n        error: reject,\n        complete: resolve,\n      });\n      this.subscribe(subscriber);\n    }) as Promise<void>;\n  }\n\n  /** @internal */\n  protected _subscribe(subscriber: Subscriber<any>): TeardownLogic {\n    return this.source?.subscribe(subscriber);\n  }\n\n  /**\n   * An interop point defined by the es7-observable spec https://github.com/zenparsing/es-observable\n   * @method Symbol.observable\n   * @return {Observable} this instance of the observable\n   */\n  [Symbol_observable]() {\n    return this;\n  }\n\n  /* tslint:disable:max-line-length */\n  pipe(): Observable<T>;\n  pipe<A>(op1: OperatorFunction<T, A>): Observable<A>;\n  pipe<A, B>(op1: OperatorFunction<T, A>, op2: OperatorFunction<A, B>): Observable<B>;\n  pipe<A, B, C>(op1: OperatorFunction<T, A>, op2: OperatorFunction<A, B>, op3: OperatorFunction<B, C>): Observable<C>;\n  pipe<A, B, C, D>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>\n  ): Observable<D>;\n  pipe<A, B, C, D, E>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>\n  ): Observable<E>;\n  pipe<A, B, C, D, E, F>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>\n  ): Observable<F>;\n  pipe<A, B, C, D, E, F, G>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>\n  ): Observable<G>;\n  pipe<A, B, C, D, E, F, G, H>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>,\n    op8: OperatorFunction<G, H>\n  ): Observable<H>;\n  pipe<A, B, C, D, E, F, G, H, I>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>,\n    op8: OperatorFunction<G, H>,\n    op9: OperatorFunction<H, I>\n  ): Observable<I>;\n  pipe<A, B, C, D, E, F, G, H, I>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>,\n    op8: OperatorFunction<G, H>,\n    op9: OperatorFunction<H, I>,\n    ...operations: OperatorFunction<any, any>[]\n  ): Observable<unknown>;\n  /* tslint:enable:max-line-length */\n\n  /**\n   * Used to stitch together functional operators into a chain.\n   * @method pipe\n   * @return {Observable} the Observable result of all of the operators having\n   * been called in the order they were passed in.\n   *\n   * ## Example\n   *\n   * ```ts\n   * import { interval, filter, map, scan } from 'rxjs';\n   *\n   * interval(1000)\n   *   .pipe(\n   *     filter(x => x % 2 === 0),\n   *     map(x => x + x),\n   *     scan((acc, x) => acc + x)\n   *   )\n   *   .subscribe(x => console.log(x));\n   * ```\n   */\n  pipe(...operations: OperatorFunction<any, any>[]): Observable<any> {\n    return pipeFromArray(operations)(this);\n  }\n\n  /* tslint:disable:max-line-length */\n  /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n  toPromise(): Promise<T | undefined>;\n  /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n  toPromise(PromiseCtor: typeof Promise): Promise<T | undefined>;\n  /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n  toPromise(PromiseCtor: PromiseConstructorLike): Promise<T | undefined>;\n  /* tslint:enable:max-line-length */\n\n  /**\n   * Subscribe to this Observable and get a Promise resolving on\n   * `complete` with the last emission (if any).\n   *\n   * **WARNING**: Only use this with observables you *know* will complete. If the source\n   * observable does not complete, you will end up with a promise that is hung up, and\n   * potentially all of the state of an async function hanging out in memory. To avoid\n   * this situation, look into adding something like {@link timeout}, {@link take},\n   * {@link takeWhile}, or {@link takeUntil} amongst others.\n   *\n   * @method toPromise\n   * @param [promiseCtor] a constructor function used to instantiate\n   * the Promise\n   * @return A Promise that resolves with the last value emit, or\n   * rejects on an error. If there were no emissions, Promise\n   * resolves with undefined.\n   * @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise\n   */\n  toPromise(promiseCtor?: PromiseConstructorLike): Promise<T | undefined> {\n    promiseCtor = getPromiseCtor(promiseCtor);\n\n    return new promiseCtor((resolve, reject) => {\n      let value: T | undefined;\n      this.subscribe(\n        (x: T) => (value = x),\n        (err: any) => reject(err),\n        () => resolve(value)\n      );\n    }) as Promise<T | undefined>;\n  }\n}\n\n/**\n * Decides between a passed promise constructor from consuming code,\n * A default configured promise constructor, and the native promise\n * constructor and returns it. If nothing can be found, it will throw\n * an error.\n * @param promiseCtor The optional promise constructor to passed by consuming code\n */\nfunction getPromiseCtor(promiseCtor: PromiseConstructorLike | undefined) {\n  return promiseCtor ?? config.Promise ?? Promise;\n}\n\nfunction isObserver<T>(value: any): value is Observer<T> {\n  return value && isFunction(value.next) && isFunction(value.error) && isFunction(value.complete);\n}\n\nfunction isSubscriber<T>(value: any): value is Subscriber<T> {\n  return (value && value instanceof Subscriber) || (isObserver(value) && isSubscription(value));\n}\n", "import { Observable } from '../Observable';\nimport { Subscriber } from '../Subscriber';\nimport { OperatorFunction } from '../types';\nimport { isFunction } from './isFunction';\n\n/**\n * Used to determine if an object is an Observable with a lift function.\n */\nexport function hasLift(source: any): source is { lift: InstanceType<typeof Observable>['lift'] } {\n  return isFunction(source?.lift);\n}\n\n/**\n * Creates an `OperatorFunction`. Used to define operators throughout the library in a concise way.\n * @param init The logic to connect the liftedSource to the subscriber at the moment of subscription.\n */\nexport function operate<T, R>(\n  init: (liftedSource: Observable<T>, subscriber: Subscriber<R>) => (() => void) | void\n): OperatorFunction<T, R> {\n  return (source: Observable<T>) => {\n    if (hasLift(source)) {\n      return source.lift(function (this: Subscriber<R>, liftedSource: Observable<T>) {\n        try {\n          return init(liftedSource, this);\n        } catch (err) {\n          this.error(err);\n        }\n      });\n    }\n    throw new TypeError('Unable to lift unknown Observable type');\n  };\n}\n", "import { Subscriber } from '../Subscriber';\n\n/**\n * Creates an instance of an `OperatorSubscriber`.\n * @param destination The downstream subscriber.\n * @param onNext Handles next values, only called if this subscriber is not stopped or closed. Any\n * error that occurs in this function is caught and sent to the `error` method of this subscriber.\n * @param onError Handles errors from the subscription, any errors that occur in this handler are caught\n * and send to the `destination` error handler.\n * @param onComplete Handles completion notification from the subscription. Any errors that occur in\n * this handler are sent to the `destination` error handler.\n * @param onFinalize Additional teardown logic here. This will only be called on teardown if the\n * subscriber itself is not already closed. This is called after all other teardown logic is executed.\n */\nexport function createOperatorSubscriber<T>(\n  destination: Subscriber<any>,\n  onNext?: (value: T) => void,\n  onComplete?: () => void,\n  onError?: (err: any) => void,\n  onFinalize?: () => void\n): Subscriber<T> {\n  return new OperatorSubscriber(destination, onNext, onComplete, onError, onFinalize);\n}\n\n/**\n * A generic helper for allowing operators to be created with a Subscriber and\n * use closures to capture necessary state from the operator function itself.\n */\nexport class OperatorSubscriber<T> extends Subscriber<T> {\n  /**\n   * Creates an instance of an `OperatorSubscriber`.\n   * @param destination The downstream subscriber.\n   * @param onNext Handles next values, only called if this subscriber is not stopped or closed. Any\n   * error that occurs in this function is caught and sent to the `error` method of this subscriber.\n   * @param onError Handles errors from the subscription, any errors that occur in this handler are caught\n   * and send to the `destination` error handler.\n   * @param onComplete Handles completion notification from the subscription. Any errors that occur in\n   * this handler are sent to the `destination` error handler.\n   * @param onFinalize Additional finalization logic here. This will only be called on finalization if the\n   * subscriber itself is not already closed. This is called after all other finalization logic is executed.\n   * @param shouldUnsubscribe An optional check to see if an unsubscribe call should truly unsubscribe.\n   * NOTE: This currently **ONLY** exists to support the strange behavior of {@link groupBy}, where unsubscription\n   * to the resulting observable does not actually disconnect from the source if there are active subscriptions\n   * to any grouped observable. (DO NOT EXPOSE OR USE EXTERNALLY!!!)\n   */\n  constructor(\n    destination: Subscriber<any>,\n    onNext?: (value: T) => void,\n    onComplete?: () => void,\n    onError?: (err: any) => void,\n    private onFinalize?: () => void,\n    private shouldUnsubscribe?: () => boolean\n  ) {\n    // It's important - for performance reasons - that all of this class's\n    // members are initialized and that they are always initialized in the same\n    // order. This will ensure that all OperatorSubscriber instances have the\n    // same hidden class in V8. This, in turn, will help keep the number of\n    // hidden classes involved in property accesses within the base class as\n    // low as possible. If the number of hidden classes involved exceeds four,\n    // the property accesses will become megamorphic and performance penalties\n    // will be incurred - i.e. inline caches won't be used.\n    //\n    // The reasons for ensuring all instances have the same hidden class are\n    // further discussed in this blog post from Benedikt Meurer:\n    // https://benediktmeurer.de/2018/03/23/impact-of-polymorphism-on-component-based-frameworks-like-react/\n    super(destination);\n    this._next = onNext\n      ? function (this: OperatorSubscriber<T>, value: T) {\n          try {\n            onNext(value);\n          } catch (err) {\n            destination.error(err);\n          }\n        }\n      : super._next;\n    this._error = onError\n      ? function (this: OperatorSubscriber<T>, err: any) {\n          try {\n            onError(err);\n          } catch (err) {\n            // Send any errors that occur down stream.\n            destination.error(err);\n          } finally {\n            // Ensure finalization.\n            this.unsubscribe();\n          }\n        }\n      : super._error;\n    this._complete = onComplete\n      ? function (this: OperatorSubscriber<T>) {\n          try {\n            onComplete();\n          } catch (err) {\n            // Send any errors that occur down stream.\n            destination.error(err);\n          } finally {\n            // Ensure finalization.\n            this.unsubscribe();\n          }\n        }\n      : super._complete;\n  }\n\n  unsubscribe() {\n    if (!this.shouldUnsubscribe || this.shouldUnsubscribe()) {\n      const { closed } = this;\n      super.unsubscribe();\n      // Execute additional teardown if we have any and we didn't already do so.\n      !closed && this.onFinalize?.();\n    }\n  }\n}\n", "import { createErrorClass } from './createErrorClass';\n\nexport interface ObjectUnsubscribedError extends Error {}\n\nexport interface ObjectUnsubscribedErrorCtor {\n  /**\n   * @deprecated Internal implementation detail. Do not construct error instances.\n   * Cannot be tagged as internal: https://github.com/ReactiveX/rxjs/issues/6269\n   */\n  new (): ObjectUnsubscribedError;\n}\n\n/**\n * An error thrown when an action is invalid because the object has been\n * unsubscribed.\n *\n * @see {@link Subject}\n * @see {@link BehaviorSubject}\n *\n * @class ObjectUnsubscribedError\n */\nexport const ObjectUnsubscribedError: ObjectUnsubscribedErrorCtor = createErrorClass(\n  (_super) =>\n    function ObjectUnsubscribedErrorImpl(this: any) {\n      _super(this);\n      this.name = 'ObjectUnsubscribedError';\n      this.message = 'object unsubscribed';\n    }\n);\n", "import { Operator } from './Operator';\nimport { Observable } from './Observable';\nimport { Subscriber } from './Subscriber';\nimport { Subscription, EMPTY_SUBSCRIPTION } from './Subscription';\nimport { Observer, SubscriptionLike, TeardownLogic } from './types';\nimport { ObjectUnsubscribedError } from './util/ObjectUnsubscribedError';\nimport { arrRemove } from './util/arrRemove';\nimport { errorContext } from './util/errorContext';\n\n/**\n * A Subject is a special type of Observable that allows values to be\n * multicasted to many Observers. Subjects are like EventEmitters.\n *\n * Every Subject is an Observable and an Observer. You can subscribe to a\n * Subject, and you can call next to feed values as well as error and complete.\n */\nexport class Subject<T> extends Observable<T> implements SubscriptionLike {\n  closed = false;\n\n  private currentObservers: Observer<T>[] | null = null;\n\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  observers: Observer<T>[] = [];\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  isStopped = false;\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  hasError = false;\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  thrownError: any = null;\n\n  /**\n   * Creates a \"subject\" by basically gluing an observer to an observable.\n   *\n   * @nocollapse\n   * @deprecated Recommended you do not use. Will be removed at some point in the future. Plans for replacement still under discussion.\n   */\n  static create: (...args: any[]) => any = <T>(destination: Observer<T>, source: Observable<T>): AnonymousSubject<T> => {\n    return new AnonymousSubject<T>(destination, source);\n  };\n\n  constructor() {\n    // NOTE: This must be here to obscure Observable's constructor.\n    super();\n  }\n\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  lift<R>(operator: Operator<T, R>): Observable<R> {\n    const subject = new AnonymousSubject(this, this);\n    subject.operator = operator as any;\n    return subject as any;\n  }\n\n  /** @internal */\n  protected _throwIfClosed() {\n    if (this.closed) {\n      throw new ObjectUnsubscribedError();\n    }\n  }\n\n  next(value: T) {\n    errorContext(() => {\n      this._throwIfClosed();\n      if (!this.isStopped) {\n        if (!this.currentObservers) {\n          this.currentObservers = Array.from(this.observers);\n        }\n        for (const observer of this.currentObservers) {\n          observer.next(value);\n        }\n      }\n    });\n  }\n\n  error(err: any) {\n    errorContext(() => {\n      this._throwIfClosed();\n      if (!this.isStopped) {\n        this.hasError = this.isStopped = true;\n        this.thrownError = err;\n        const { observers } = this;\n        while (observers.length) {\n          observers.shift()!.error(err);\n        }\n      }\n    });\n  }\n\n  complete() {\n    errorContext(() => {\n      this._throwIfClosed();\n      if (!this.isStopped) {\n        this.isStopped = true;\n        const { observers } = this;\n        while (observers.length) {\n          observers.shift()!.complete();\n        }\n      }\n    });\n  }\n\n  unsubscribe() {\n    this.isStopped = this.closed = true;\n    this.observers = this.currentObservers = null!;\n  }\n\n  get observed() {\n    return this.observers?.length > 0;\n  }\n\n  /** @internal */\n  protected _trySubscribe(subscriber: Subscriber<T>): TeardownLogic {\n    this._throwIfClosed();\n    return super._trySubscribe(subscriber);\n  }\n\n  /** @internal */\n  protected _subscribe(subscriber: Subscriber<T>): Subscription {\n    this._throwIfClosed();\n    this._checkFinalizedStatuses(subscriber);\n    return this._innerSubscribe(subscriber);\n  }\n\n  /** @internal */\n  protected _innerSubscribe(subscriber: Subscriber<any>) {\n    const { hasError, isStopped, observers } = this;\n    if (hasError || isStopped) {\n      return EMPTY_SUBSCRIPTION;\n    }\n    this.currentObservers = null;\n    observers.push(subscriber);\n    return new Subscription(() => {\n      this.currentObservers = null;\n      arrRemove(observers, subscriber);\n    });\n  }\n\n  /** @internal */\n  protected _checkFinalizedStatuses(subscriber: Subscriber<any>) {\n    const { hasError, thrownError, isStopped } = this;\n    if (hasError) {\n      subscriber.error(thrownError);\n    } else if (isStopped) {\n      subscriber.complete();\n    }\n  }\n\n  /**\n   * Creates a new Observable with this Subject as the source. You can do this\n   * to create custom Observer-side logic of the Subject and conceal it from\n   * code that uses the Observable.\n   * @return {Observable} Observable that the Subject casts to\n   */\n  asObservable(): Observable<T> {\n    const observable: any = new Observable<T>();\n    observable.source = this;\n    return observable;\n  }\n}\n\n/**\n * @class AnonymousSubject<T>\n */\nexport class AnonymousSubject<T> extends Subject<T> {\n  constructor(\n    /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n    public destination?: Observer<T>,\n    source?: Observable<T>\n  ) {\n    super();\n    this.source = source;\n  }\n\n  next(value: T) {\n    this.destination?.next?.(value);\n  }\n\n  error(err: any) {\n    this.destination?.error?.(err);\n  }\n\n  complete() {\n    this.destination?.complete?.();\n  }\n\n  /** @internal */\n  protected _subscribe(subscriber: Subscriber<T>): Subscription {\n    return this.source?.subscribe(subscriber) ?? EMPTY_SUBSCRIPTION;\n  }\n}\n", "import { TimestampProvider } from '../types';\n\ninterface DateTimestampProvider extends TimestampProvider {\n  delegate: TimestampProvider | undefined;\n}\n\nexport const dateTimestampProvider: DateTimestampProvider = {\n  now() {\n    // Use the variable rather than `this` so that the function can be called\n    // without being bound to the provider.\n    return (dateTimestampProvider.delegate || Date).now();\n  },\n  delegate: undefined,\n};\n", "import { Subject } from './Subject';\nimport { TimestampProvider } from './types';\nimport { Subscriber } from './Subscriber';\nimport { Subscription } from './Subscription';\nimport { dateTimestampProvider } from './scheduler/dateTimestampProvider';\n\n/**\n * A variant of {@link Subject} that \"replays\" old values to new subscribers by emitting them when they first subscribe.\n *\n * `ReplaySubject` has an internal buffer that will store a specified number of values that it has observed. Like `Subject`,\n * `ReplaySubject` \"observes\" values by having them passed to its `next` method. When it observes a value, it will store that\n * value for a time determined by the configuration of the `ReplaySubject`, as passed to its constructor.\n *\n * When a new subscriber subscribes to the `ReplaySubject` instance, it will synchronously emit all values in its buffer in\n * a First-In-First-Out (FIFO) manner. The `ReplaySubject` will also complete, if it has observed completion; and it will\n * error if it has observed an error.\n *\n * There are two main configuration items to be concerned with:\n *\n * 1. `bufferSize` - This will determine how many items are stored in the buffer, defaults to infinite.\n * 2. `windowTime` - The amount of time to hold a value in the buffer before removing it from the buffer.\n *\n * Both configurations may exist simultaneously. So if you would like to buffer a maximum of 3 values, as long as the values\n * are less than 2 seconds old, you could do so with a `new ReplaySubject(3, 2000)`.\n *\n * ### Differences with BehaviorSubject\n *\n * `BehaviorSubject` is similar to `new ReplaySubject(1)`, with a couple of exceptions:\n *\n * 1. `BehaviorSubject` comes \"primed\" with a single value upon construction.\n * 2. `ReplaySubject` will replay values, even after observing an error, where `BehaviorSubject` will not.\n *\n * @see {@link Subject}\n * @see {@link BehaviorSubject}\n * @see {@link shareReplay}\n */\nexport class ReplaySubject<T> extends Subject<T> {\n  private _buffer: (T | number)[] = [];\n  private _infiniteTimeWindow = true;\n\n  /**\n   * @param bufferSize The size of the buffer to replay on subscription\n   * @param windowTime The amount of time the buffered items will stay buffered\n   * @param timestampProvider An object with a `now()` method that provides the current timestamp. This is used to\n   * calculate the amount of time something has been buffered.\n   */\n  constructor(\n    private _bufferSize = Infinity,\n    private _windowTime = Infinity,\n    private _timestampProvider: TimestampProvider = dateTimestampProvider\n  ) {\n    super();\n    this._infiniteTimeWindow = _windowTime === Infinity;\n    this._bufferSize = Math.max(1, _bufferSize);\n    this._windowTime = Math.max(1, _windowTime);\n  }\n\n  next(value: T): void {\n    const { isStopped, _buffer, _infiniteTimeWindow, _timestampProvider, _windowTime } = this;\n    if (!isStopped) {\n      _buffer.push(value);\n      !_infiniteTimeWindow && _buffer.push(_timestampProvider.now() + _windowTime);\n    }\n    this._trimBuffer();\n    super.next(value);\n  }\n\n  /** @internal */\n  protected _subscribe(subscriber: Subscriber<T>): Subscription {\n    this._throwIfClosed();\n    this._trimBuffer();\n\n    const subscription = this._innerSubscribe(subscriber);\n\n    const { _infiniteTimeWindow, _buffer } = this;\n    // We use a copy here, so reentrant code does not mutate our array while we're\n    // emitting it to a new subscriber.\n    const copy = _buffer.slice();\n    for (let i = 0; i < copy.length && !subscriber.closed; i += _infiniteTimeWindow ? 1 : 2) {\n      subscriber.next(copy[i] as T);\n    }\n\n    this._checkFinalizedStatuses(subscriber);\n\n    return subscription;\n  }\n\n  private _trimBuffer() {\n    const { _bufferSize, _timestampProvider, _buffer, _infiniteTimeWindow } = this;\n    // If we don't have an infinite buffer size, and we're over the length,\n    // use splice to truncate the old buffer values off. Note that we have to\n    // double the size for instances where we're not using an infinite time window\n    // because we're storing the values and the timestamps in the same array.\n    const adjustedBufferSize = (_infiniteTimeWindow ? 1 : 2) * _bufferSize;\n    _bufferSize < Infinity && adjustedBufferSize < _buffer.length && _buffer.splice(0, _buffer.length - adjustedBufferSize);\n\n    // Now, if we're not in an infinite time window, remove all values where the time is\n    // older than what is allowed.\n    if (!_infiniteTimeWindow) {\n      const now = _timestampProvider.now();\n      let last = 0;\n      // Search the array for the first timestamp that isn't expired and\n      // truncate the buffer up to that point.\n      for (let i = 1; i < _buffer.length && (_buffer[i] as number) <= now; i += 2) {\n        last = i;\n      }\n      last && _buffer.splice(0, last + 1);\n    }\n  }\n}\n", "import { Observable } from '../Observable';\nimport { SchedulerLike } from '../types';\n\n/**\n * A simple Observable that emits no items to the Observer and immediately\n * emits a complete notification.\n *\n * <span class=\"informal\">Just emits 'complete', and nothing else.</span>\n *\n * ![](empty.png)\n *\n * A simple Observable that only emits the complete notification. It can be used\n * for composing with other Observables, such as in a {@link mergeMap}.\n *\n * ## Examples\n *\n * Log complete notification\n *\n * ```ts\n * import { EMPTY } from 'rxjs';\n *\n * EMPTY.subscribe({\n *   next: () => console.log('Next'),\n *   complete: () => console.log('Complete!')\n * });\n *\n * // Outputs\n * // Complete!\n * ```\n *\n * Emit the number 7, then complete\n *\n * ```ts\n * import { EMPTY, startWith } from 'rxjs';\n *\n * const result = EMPTY.pipe(startWith(7));\n * result.subscribe(x => console.log(x));\n *\n * // Outputs\n * // 7\n * ```\n *\n * Map and flatten only odd numbers to the sequence `'a'`, `'b'`, `'c'`\n *\n * ```ts\n * import { interval, mergeMap, of, EMPTY } from 'rxjs';\n *\n * const interval$ = interval(1000);\n * const result = interval$.pipe(\n *   mergeMap(x => x % 2 === 1 ? of('a', 'b', 'c') : EMPTY),\n * );\n * result.subscribe(x => console.log(x));\n *\n * // Results in the following to the console:\n * // x is equal to the count on the interval, e.g. (0, 1, 2, 3, ...)\n * // x will occur every 1000ms\n * // if x % 2 is equal to 1, print a, b, c (each on its own)\n * // if x % 2 is not equal to 1, nothing will be output\n * ```\n *\n * @see {@link Observable}\n * @see {@link NEVER}\n * @see {@link of}\n * @see {@link throwError}\n */\nexport const EMPTY = new Observable<never>((subscriber) => subscriber.complete());\n\n/**\n * @param scheduler A {@link SchedulerLike} to use for scheduling\n * the emission of the complete notification.\n * @deprecated Replaced with the {@link EMPTY} constant or {@link scheduled} (e.g. `scheduled([], scheduler)`). Will be removed in v8.\n */\nexport function empty(scheduler?: SchedulerLike) {\n  return scheduler ? emptyScheduled(scheduler) : EMPTY;\n}\n\nfunction emptyScheduled(scheduler: SchedulerLike) {\n  return new Observable<never>((subscriber) => scheduler.schedule(() => subscriber.complete()));\n}\n", "import { SchedulerLike } from '../types';\nimport { isFunction } from './isFunction';\n\nexport function isScheduler(value: any): value is SchedulerLike {\n  return value && isFunction(value.schedule);\n}\n", "import { SchedulerLike } from '../types';\nimport { isFunction } from './isFunction';\nimport { isScheduler } from './isScheduler';\n\nfunction last<T>(arr: T[]): T | undefined {\n  return arr[arr.length - 1];\n}\n\nexport function popResultSelector(args: any[]): ((...args: unknown[]) => unknown) | undefined {\n  return isFunction(last(args)) ? args.pop() : undefined;\n}\n\nexport function popScheduler(args: any[]): SchedulerLike | undefined {\n  return isScheduler(last(args)) ? args.pop() : undefined;\n}\n\nexport function popNumber(args: any[], defaultValue: number): number {\n  return typeof last(args) === 'number' ? args.pop()! : defaultValue;\n}\n", "export const isArrayLike = (<T>(x: any): x is ArrayLike<T> => x && typeof x.length === 'number' && typeof x !== 'function');", "import { isFunction } from \"./isFunction\";\n\n/**\n * Tests to see if the object is \"thennable\".\n * @param value the object to test\n */\nexport function isPromise(value: any): value is PromiseLike<any> {\n  return isFunction(value?.then);\n}\n", "import { InteropObservable } from '../types';\nimport { observable as Symbol_observable } from '../symbol/observable';\nimport { isFunction } from './isFunction';\n\n/** Identifies an input as being Observable (but not necessary an Rx Observable) */\nexport function isInteropObservable(input: any): input is InteropObservable<any> {\n  return isFunction(input[Symbol_observable]);\n}\n", "import { isFunction } from './isFunction';\n\nexport function isAsyncIterable<T>(obj: any): obj is AsyncIterable<T> {\n  return Symbol.asyncIterator && isFunction(obj?.[Symbol.asyncIterator]);\n}\n", "/**\n * Creates the TypeError to throw if an invalid object is passed to `from` or `scheduled`.\n * @param input The object that was passed.\n */\nexport function createInvalidObservableTypeError(input: any) {\n  // TODO: We should create error codes that can be looked up, so this can be less verbose.\n  return new TypeError(\n    `You provided ${\n      input !== null && typeof input === 'object' ? 'an invalid object' : `'${input}'`\n    } where a stream was expected. You can provide an Observable, Promise, ReadableStream, Array, AsyncIterable, or Iterable.`\n  );\n}\n", "export function getSymbolIterator(): symbol {\n  if (typeof Symbol !== 'function' || !Symbol.iterator) {\n    return '@@iterator' as any;\n  }\n\n  return Symbol.iterator;\n}\n\nexport const iterator = getSymbolIterator();\n", "import { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { isFunction } from './isFunction';\n\n/** Identifies an input as being an Iterable */\nexport function isIterable(input: any): input is Iterable<any> {\n  return isFunction(input?.[Symbol_iterator]);\n}\n", "import { ReadableStreamLike } from '../types';\nimport { isFunction } from './isFunction';\n\nexport async function* readableStreamLikeToAsyncGenerator<T>(readableStream: ReadableStreamLike<T>): AsyncGenerator<T> {\n  const reader = readableStream.getReader();\n  try {\n    while (true) {\n      const { value, done } = await reader.read();\n      if (done) {\n        return;\n      }\n      yield value!;\n    }\n  } finally {\n    reader.releaseLock();\n  }\n}\n\nexport function isReadableStreamLike<T>(obj: any): obj is ReadableStreamLike<T> {\n  // We don't want to use instanceof checks because they would return\n  // false for instances from another Realm, like an <iframe>.\n  return isFunction(obj?.getReader);\n}\n", "import { isArrayLike } from '../util/isArrayLike';\nimport { isPromise } from '../util/isPromise';\nimport { Observable } from '../Observable';\nimport { ObservableInput, ObservedValueOf, ReadableStreamLike } from '../types';\nimport { isInteropObservable } from '../util/isInteropObservable';\nimport { isAsyncIterable } from '../util/isAsyncIterable';\nimport { createInvalidObservableTypeError } from '../util/throwUnobservableError';\nimport { isIterable } from '../util/isIterable';\nimport { isReadableStreamLike, readableStreamLikeToAsyncGenerator } from '../util/isReadableStreamLike';\nimport { Subscriber } from '../Subscriber';\nimport { isFunction } from '../util/isFunction';\nimport { reportUnhandledError } from '../util/reportUnhandledError';\nimport { observable as Symbol_observable } from '../symbol/observable';\n\nexport function innerFrom<O extends ObservableInput<any>>(input: O): Observable<ObservedValueOf<O>>;\nexport function innerFrom<T>(input: ObservableInput<T>): Observable<T> {\n  if (input instanceof Observable) {\n    return input;\n  }\n  if (input != null) {\n    if (isInteropObservable(input)) {\n      return fromInteropObservable(input);\n    }\n    if (isArrayLike(input)) {\n      return fromArrayLike(input);\n    }\n    if (isPromise(input)) {\n      return fromPromise(input);\n    }\n    if (isAsyncIterable(input)) {\n      return fromAsyncIterable(input);\n    }\n    if (isIterable(input)) {\n      return fromIterable(input);\n    }\n    if (isReadableStreamLike(input)) {\n      return fromReadableStreamLike(input);\n    }\n  }\n\n  throw createInvalidObservableTypeError(input);\n}\n\n/**\n * Creates an RxJS Observable from an object that implements `Symbol.observable`.\n * @param obj An object that properly implements `Symbol.observable`.\n */\nexport function fromInteropObservable<T>(obj: any) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    const obs = obj[Symbol_observable]();\n    if (isFunction(obs.subscribe)) {\n      return obs.subscribe(subscriber);\n    }\n    // Should be caught by observable subscribe function error handling.\n    throw new TypeError('Provided object does not correctly implement Symbol.observable');\n  });\n}\n\n/**\n * Synchronously emits the values of an array like and completes.\n * This is exported because there are creation functions and operators that need to\n * make direct use of the same logic, and there's no reason to make them run through\n * `from` conditionals because we *know* they're dealing with an array.\n * @param array The array to emit values from\n */\nexport function fromArrayLike<T>(array: ArrayLike<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    // Loop over the array and emit each value. Note two things here:\n    // 1. We're making sure that the subscriber is not closed on each loop.\n    //    This is so we don't continue looping over a very large array after\n    //    something like a `take`, `takeWhile`, or other synchronous unsubscription\n    //    has already unsubscribed.\n    // 2. In this form, reentrant code can alter that array we're looping over.\n    //    This is a known issue, but considered an edge case. The alternative would\n    //    be to copy the array before executing the loop, but this has\n    //    performance implications.\n    for (let i = 0; i < array.length && !subscriber.closed; i++) {\n      subscriber.next(array[i]);\n    }\n    subscriber.complete();\n  });\n}\n\nexport function fromPromise<T>(promise: PromiseLike<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    promise\n      .then(\n        (value) => {\n          if (!subscriber.closed) {\n            subscriber.next(value);\n            subscriber.complete();\n          }\n        },\n        (err: any) => subscriber.error(err)\n      )\n      .then(null, reportUnhandledError);\n  });\n}\n\nexport function fromIterable<T>(iterable: Iterable<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    for (const value of iterable) {\n      subscriber.next(value);\n      if (subscriber.closed) {\n        return;\n      }\n    }\n    subscriber.complete();\n  });\n}\n\nexport function fromAsyncIterable<T>(asyncIterable: AsyncIterable<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    process(asyncIterable, subscriber).catch((err) => subscriber.error(err));\n  });\n}\n\nexport function fromReadableStreamLike<T>(readableStream: ReadableStreamLike<T>) {\n  return fromAsyncIterable(readableStreamLikeToAsyncGenerator(readableStream));\n}\n\nasync function process<T>(asyncIterable: AsyncIterable<T>, subscriber: Subscriber<T>) {\n  for await (const value of asyncIterable) {\n    subscriber.next(value);\n    // A side-effect may have closed our subscriber,\n    // check before the next iteration.\n    if (subscriber.closed) {\n      return;\n    }\n  }\n  subscriber.complete();\n}\n", "import { Subscription } from '../Subscription';\nimport { SchedulerAction, SchedulerLike } from '../types';\n\nexport function executeSchedule(\n  parentSubscription: Subscription,\n  scheduler: SchedulerLike,\n  work: () => void,\n  delay: number,\n  repeat: true\n): void;\nexport function executeSchedule(\n  parentSubscription: Subscription,\n  scheduler: SchedulerLike,\n  work: () => void,\n  delay?: number,\n  repeat?: false\n): Subscription;\n\nexport function executeSchedule(\n  parentSubscription: Subscription,\n  scheduler: SchedulerLike,\n  work: () => void,\n  delay = 0,\n  repeat = false\n): Subscription | void {\n  const scheduleSubscription = scheduler.schedule(function (this: SchedulerAction<any>) {\n    work();\n    if (repeat) {\n      parentSubscription.add(this.schedule(null, delay));\n    } else {\n      this.unsubscribe();\n    }\n  }, delay);\n\n  parentSubscription.add(scheduleSubscription);\n\n  if (!repeat) {\n    // Because user-land scheduler implementations are unlikely to properly reuse\n    // Actions for repeat scheduling, we can't trust that the returned subscription\n    // will control repeat subscription scenarios. So we're trying to avoid using them\n    // incorrectly within this library.\n    return scheduleSubscription;\n  }\n}\n", "/** @prettier */\nimport { MonoTypeOperatorFunction, SchedulerLike } from '../types';\nimport { executeSchedule } from '../util/executeSchedule';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * Re-emits all notifications from source Observable with specified scheduler.\n *\n * <span class=\"informal\">Ensure a specific scheduler is used, from outside of an Observable.</span>\n *\n * `observeOn` is an operator that accepts a scheduler as a first parameter, which will be used to reschedule\n * notifications emitted by the source Observable. It might be useful, if you do not have control over\n * internal scheduler of a given Observable, but want to control when its values are emitted nevertheless.\n *\n * Returned Observable emits the same notifications (nexted values, complete and error events) as the source Observable,\n * but rescheduled with provided scheduler. Note that this doesn't mean that source Observables internal\n * scheduler will be replaced in any way. Original scheduler still will be used, but when the source Observable emits\n * notification, it will be immediately scheduled again - this time with scheduler passed to `observeOn`.\n * An anti-pattern would be calling `observeOn` on Observable that emits lots of values synchronously, to split\n * that emissions into asynchronous chunks. For this to happen, scheduler would have to be passed into the source\n * Observable directly (usually into the operator that creates it). `observeOn` simply delays notifications a\n * little bit more, to ensure that they are emitted at expected moments.\n *\n * As a matter of fact, `observeOn` accepts second parameter, which specifies in milliseconds with what delay notifications\n * will be emitted. The main difference between {@link delay} operator and `observeOn` is that `observeOn`\n * will delay all notifications - including error notifications - while `delay` will pass through error\n * from source Observable immediately when it is emitted. In general it is highly recommended to use `delay` operator\n * for any kind of delaying of values in the stream, while using `observeOn` to specify which scheduler should be used\n * for notification emissions in general.\n *\n * ## Example\n *\n * Ensure values in subscribe are called just before browser repaint\n *\n * ```ts\n * import { interval, observeOn, animationFrameScheduler } from 'rxjs';\n *\n * const someDiv = document.createElement('div');\n * someDiv.style.cssText = 'width: 200px;background: #09c';\n * document.body.appendChild(someDiv);\n * const intervals = interval(10);      // Intervals are scheduled\n *                                      // with async scheduler by default...\n * intervals.pipe(\n *   observeOn(animationFrameScheduler) // ...but we will observe on animationFrame\n * )                                    // scheduler to ensure smooth animation.\n * .subscribe(val => {\n *   someDiv.style.height = val + 'px';\n * });\n * ```\n *\n * @see {@link delay}\n *\n * @param scheduler Scheduler that will be used to reschedule notifications from source Observable.\n * @param delay Number of milliseconds that states with what delay every notification should be rescheduled.\n * @return A function that returns an Observable that emits the same\n * notifications as the source Observable, but with provided scheduler.\n */\nexport function observeOn<T>(scheduler: SchedulerLike, delay = 0): MonoTypeOperatorFunction<T> {\n  return operate((source, subscriber) => {\n    source.subscribe(\n      createOperatorSubscriber(\n        subscriber,\n        (value) => executeSchedule(subscriber, scheduler, () => subscriber.next(value), delay),\n        () => executeSchedule(subscriber, scheduler, () => subscriber.complete(), delay),\n        (err) => executeSchedule(subscriber, scheduler, () => subscriber.error(err), delay)\n      )\n    );\n  });\n}\n", "import { MonoTypeOperatorFunction, SchedulerLike } from '../types';\nimport { operate } from '../util/lift';\n\n/**\n * Asynchronously subscribes Observers to this Observable on the specified {@link SchedulerLike}.\n *\n * With `subscribeOn` you can decide what type of scheduler a specific Observable will be using when it is subscribed to.\n *\n * Schedulers control the speed and order of emissions to observers from an Observable stream.\n *\n * ![](subscribeOn.png)\n *\n * ## Example\n *\n * Given the following code:\n *\n * ```ts\n * import { of, merge } from 'rxjs';\n *\n * const a = of(1, 2, 3);\n * const b = of(4, 5, 6);\n *\n * merge(a, b).subscribe(console.log);\n *\n * // Outputs\n * // 1\n * // 2\n * // 3\n * // 4\n * // 5\n * // 6\n * ```\n *\n * Both Observable `a` and `b` will emit their values directly and synchronously once they are subscribed to.\n *\n * If we instead use the `subscribeOn` operator declaring that we want to use the {@link asyncScheduler} for values emitted by Observable `a`:\n *\n * ```ts\n * import { of, subscribeOn, asyncScheduler, merge } from 'rxjs';\n *\n * const a = of(1, 2, 3).pipe(subscribeOn(asyncScheduler));\n * const b = of(4, 5, 6);\n *\n * merge(a, b).subscribe(console.log);\n *\n * // Outputs\n * // 4\n * // 5\n * // 6\n * // 1\n * // 2\n * // 3\n * ```\n *\n * The reason for this is that Observable `b` emits its values directly and synchronously like before\n * but the emissions from `a` are scheduled on the event loop because we are now using the {@link asyncScheduler} for that specific Observable.\n *\n * @param scheduler The {@link SchedulerLike} to perform subscription actions on.\n * @param delay A delay to pass to the scheduler to delay subscriptions\n * @return A function that returns an Observable modified so that its\n * subscriptions happen on the specified {@link SchedulerLike}.\n */\nexport function subscribeOn<T>(scheduler: SchedulerLike, delay: number = 0): MonoTypeOperatorFunction<T> {\n  return operate((source, subscriber) => {\n    subscriber.add(scheduler.schedule(() => source.subscribe(subscriber), delay));\n  });\n}\n", "import { innerFrom } from '../observable/innerFrom';\nimport { observeOn } from '../operators/observeOn';\nimport { subscribeOn } from '../operators/subscribeOn';\nimport { InteropObservable, SchedulerLike } from '../types';\n\nexport function scheduleObservable<T>(input: InteropObservable<T>, scheduler: SchedulerLike) {\n  return innerFrom(input).pipe(subscribeOn(scheduler), observeOn(scheduler));\n}\n", "import { innerFrom } from '../observable/innerFrom';\nimport { observeOn } from '../operators/observeOn';\nimport { subscribeOn } from '../operators/subscribeOn';\nimport { SchedulerLike } from '../types';\n\nexport function schedulePromise<T>(input: PromiseLike<T>, scheduler: SchedulerLike) {\n  return innerFrom(input).pipe(subscribeOn(scheduler), observeOn(scheduler));\n}\n", "import { Observable } from '../Observable';\nimport { SchedulerLike } from '../types';\n\nexport function scheduleArray<T>(input: ArrayLike<T>, scheduler: SchedulerLike) {\n  return new Observable<T>((subscriber) => {\n    // The current array index.\n    let i = 0;\n    // Start iterating over the array like on a schedule.\n    return scheduler.schedule(function () {\n      if (i === input.length) {\n        // If we have hit the end of the array like in the\n        // previous job, we can complete.\n        subscriber.complete();\n      } else {\n        // Otherwise let's next the value at the current index,\n        // then increment our index.\n        subscriber.next(input[i++]);\n        // If the last emission didn't cause us to close the subscriber\n        // (via take or some side effect), reschedule the job and we'll\n        // make another pass.\n        if (!subscriber.closed) {\n          this.schedule();\n        }\n      }\n    });\n  });\n}\n", "import { Observable } from '../Observable';\nimport { SchedulerLike } from '../types';\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { isFunction } from '../util/isFunction';\nimport { executeSchedule } from '../util/executeSchedule';\n\n/**\n * Used in {@link scheduled} to create an observable from an Iterable.\n * @param input The iterable to create an observable from\n * @param scheduler The scheduler to use\n */\nexport function scheduleIterable<T>(input: Iterable<T>, scheduler: SchedulerLike) {\n  return new Observable<T>((subscriber) => {\n    let iterator: Iterator<T, T>;\n\n    // Schedule the initial creation of the iterator from\n    // the iterable. This is so the code in the iterable is\n    // not called until the scheduled job fires.\n    executeSchedule(subscriber, scheduler, () => {\n      // Create the iterator.\n      iterator = (input as any)[Symbol_iterator]();\n\n      executeSchedule(\n        subscriber,\n        scheduler,\n        () => {\n          let value: T;\n          let done: boolean | undefined;\n          try {\n            // Pull the value out of the iterator\n            ({ value, done } = iterator.next());\n          } catch (err) {\n            // We got an error while pulling from the iterator\n            subscriber.error(err);\n            return;\n          }\n\n          if (done) {\n            // If it is \"done\" we just complete. This mimics the\n            // behavior of JavaScript's `for..of` consumption of\n            // iterables, which will not emit the value from an iterator\n            // result of `{ done: true: value: 'here' }`.\n            subscriber.complete();\n          } else {\n            // The iterable is not done, emit the value.\n            subscriber.next(value);\n          }\n        },\n        0,\n        true\n      );\n    });\n\n    // During finalization, if we see this iterator has a `return` method,\n    // then we know it is a Generator, and not just an Iterator. So we call\n    // the `return()` function. This will ensure that any `finally { }` blocks\n    // inside of the generator we can hit will be hit properly.\n    return () => isFunction(iterator?.return) && iterator.return();\n  });\n}\n", "import { SchedulerLike } from '../types';\nimport { Observable } from '../Observable';\nimport { executeSchedule } from '../util/executeSchedule';\n\nexport function scheduleAsyncIterable<T>(input: AsyncIterable<T>, scheduler: SchedulerLike) {\n  if (!input) {\n    throw new Error('Iterable cannot be null');\n  }\n  return new Observable<T>((subscriber) => {\n    executeSchedule(subscriber, scheduler, () => {\n      const iterator = input[Symbol.asyncIterator]();\n      executeSchedule(\n        subscriber,\n        scheduler,\n        () => {\n          iterator.next().then((result) => {\n            if (result.done) {\n              // This will remove the subscriptions from\n              // the parent subscription.\n              subscriber.complete();\n            } else {\n              subscriber.next(result.value);\n            }\n          });\n        },\n        0,\n        true\n      );\n    });\n  });\n}\n", "import { SchedulerLike, ReadableStreamLike } from '../types';\nimport { Observable } from '../Observable';\nimport { scheduleAsyncIterable } from './scheduleAsyncIterable';\nimport { readableStreamLikeToAsyncGenerator } from '../util/isReadableStreamLike';\n\nexport function scheduleReadableStreamLike<T>(input: ReadableStreamLike<T>, scheduler: SchedulerLike): Observable<T> {\n  return scheduleAsyncIterable(readableStreamLikeToAsyncGenerator(input), scheduler);\n}\n", "import { scheduleObservable } from './scheduleObservable';\nimport { schedulePromise } from './schedulePromise';\nimport { scheduleArray } from './scheduleArray';\nimport { scheduleIterable } from './scheduleIterable';\nimport { scheduleAsyncIterable } from './scheduleAsyncIterable';\nimport { isInteropObservable } from '../util/isInteropObservable';\nimport { isPromise } from '../util/isPromise';\nimport { isArrayLike } from '../util/isArrayLike';\nimport { isIterable } from '../util/isIterable';\nimport { ObservableInput, SchedulerLike } from '../types';\nimport { Observable } from '../Observable';\nimport { isAsyncIterable } from '../util/isAsyncIterable';\nimport { createInvalidObservableTypeError } from '../util/throwUnobservableError';\nimport { isReadableStreamLike } from '../util/isReadableStreamLike';\nimport { scheduleReadableStreamLike } from './scheduleReadableStreamLike';\n\n/**\n * Converts from a common {@link ObservableInput} type to an observable where subscription and emissions\n * are scheduled on the provided scheduler.\n *\n * @see {@link from}\n * @see {@link of}\n *\n * @param input The observable, array, promise, iterable, etc you would like to schedule\n * @param scheduler The scheduler to use to schedule the subscription and emissions from\n * the returned observable.\n */\nexport function scheduled<T>(input: ObservableInput<T>, scheduler: SchedulerLike): Observable<T> {\n  if (input != null) {\n    if (isInteropObservable(input)) {\n      return scheduleObservable(input, scheduler);\n    }\n    if (isArrayLike(input)) {\n      return scheduleArray(input, scheduler);\n    }\n    if (isPromise(input)) {\n      return schedulePromise(input, scheduler);\n    }\n    if (isAsyncIterable(input)) {\n      return scheduleAsyncIterable(input, scheduler);\n    }\n    if (isIterable(input)) {\n      return scheduleIterable(input, scheduler);\n    }\n    if (isReadableStreamLike(input)) {\n      return scheduleReadableStreamLike(input, scheduler);\n    }\n  }\n  throw createInvalidObservableTypeError(input);\n}\n", "import { Observable } from '../Observable';\nimport { ObservableInput, SchedulerLike, ObservedValueOf } from '../types';\nimport { scheduled } from '../scheduled/scheduled';\nimport { innerFrom } from './innerFrom';\n\nexport function from<O extends ObservableInput<any>>(input: O): Observable<ObservedValueOf<O>>;\n/** @deprecated The `scheduler` parameter will be removed in v8. Use `scheduled`. Details: https://rxjs.dev/deprecations/scheduler-argument */\nexport function from<O extends ObservableInput<any>>(input: O, scheduler: SchedulerLike | undefined): Observable<ObservedValueOf<O>>;\n\n/**\n * Creates an Observable from an Array, an array-like object, a Promise, an iterable object, or an Observable-like object.\n *\n * <span class=\"informal\">Converts almost anything to an Observable.</span>\n *\n * ![](from.png)\n *\n * `from` converts various other objects and data types into Observables. It also converts a Promise, an array-like, or an\n * <a href=\"https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#iterable\" target=\"_blank\">iterable</a>\n * object into an Observable that emits the items in that promise, array, or iterable. A String, in this context, is treated\n * as an array of characters. Observable-like objects (contains a function named with the ES2015 Symbol for Observable) can also be\n * converted through this operator.\n *\n * ## Examples\n *\n * Converts an array to an Observable\n *\n * ```ts\n * import { from } from 'rxjs';\n *\n * const array = [10, 20, 30];\n * const result = from(array);\n *\n * result.subscribe(x => console.log(x));\n *\n * // Logs:\n * // 10\n * // 20\n * // 30\n * ```\n *\n * Convert an infinite iterable (from a generator) to an Observable\n *\n * ```ts\n * import { from, take } from 'rxjs';\n *\n * function* generateDoubles(seed) {\n *    let i = seed;\n *    while (true) {\n *      yield i;\n *      i = 2 * i; // double it\n *    }\n * }\n *\n * const iterator = generateDoubles(3);\n * const result = from(iterator).pipe(take(10));\n *\n * result.subscribe(x => console.log(x));\n *\n * // Logs:\n * // 3\n * // 6\n * // 12\n * // 24\n * // 48\n * // 96\n * // 192\n * // 384\n * // 768\n * // 1536\n * ```\n *\n * With `asyncScheduler`\n *\n * ```ts\n * import { from, asyncScheduler } from 'rxjs';\n *\n * console.log('start');\n *\n * const array = [10, 20, 30];\n * const result = from(array, asyncScheduler);\n *\n * result.subscribe(x => console.log(x));\n *\n * console.log('end');\n *\n * // Logs:\n * // 'start'\n * // 'end'\n * // 10\n * // 20\n * // 30\n * ```\n *\n * @see {@link fromEvent}\n * @see {@link fromEventPattern}\n *\n * @param {ObservableInput<T>} A subscription object, a Promise, an Observable-like,\n * an Array, an iterable, or an array-like object to be converted.\n * @param {SchedulerLike} An optional {@link SchedulerLike} on which to schedule the emission of values.\n * @return {Observable<T>}\n */\nexport function from<T>(input: ObservableInput<T>, scheduler?: SchedulerLike): Observable<T> {\n  return scheduler ? scheduled(input, scheduler) : innerFrom(input);\n}\n", "import { createErrorClass } from './createErrorClass';\n\nexport interface EmptyError extends Error {}\n\nexport interface EmptyErrorCtor {\n  /**\n   * @deprecated Internal implementation detail. Do not construct error instances.\n   * Cannot be tagged as internal: https://github.com/ReactiveX/rxjs/issues/6269\n   */\n  new (): EmptyError;\n}\n\n/**\n * An error thrown when an Observable or a sequence was queried but has no\n * elements.\n *\n * @see {@link first}\n * @see {@link last}\n * @see {@link single}\n * @see {@link firstValueFrom}\n * @see {@link lastValueFrom}\n *\n * @class EmptyError\n */\nexport const EmptyError: EmptyErrorCtor = createErrorClass((_super) => function EmptyErrorImpl(this: any) {\n  _super(this);\n  this.name = 'EmptyError';\n  this.message = 'no elements in sequence';\n});\n", "import { Observable } from './Observable';\nimport { EmptyError } from './util/EmptyError';\nimport { SafeSubscriber } from './Subscriber';\n\nexport interface FirstValueFromConfig<T> {\n  defaultValue: T;\n}\n\nexport function firstValueFrom<T, D>(source: Observable<T>, config: FirstValueFromConfig<D>): Promise<T | D>;\nexport function firstValueFrom<T>(source: Observable<T>): Promise<T>;\n\n/**\n * Converts an observable to a promise by subscribing to the observable,\n * and returning a promise that will resolve as soon as the first value\n * arrives from the observable. The subscription will then be closed.\n *\n * If the observable stream completes before any values were emitted, the\n * returned promise will reject with {@link EmptyError} or will resolve\n * with the default value if a default was specified.\n *\n * If the observable stream emits an error, the returned promise will reject\n * with that error.\n *\n * **WARNING**: Only use this with observables you *know* will emit at least one value,\n * *OR* complete. If the source observable does not emit one value or complete, you will\n * end up with a promise that is hung up, and potentially all of the state of an\n * async function hanging out in memory. To avoid this situation, look into adding\n * something like {@link timeout}, {@link take}, {@link takeWhile}, or {@link takeUntil}\n * amongst others.\n *\n * ## Example\n *\n * Wait for the first value from a stream and emit it from a promise in\n * an async function\n *\n * ```ts\n * import { interval, firstValueFrom } from 'rxjs';\n *\n * async function execute() {\n *   const source$ = interval(2000);\n *   const firstNumber = await firstValueFrom(source$);\n *   console.log(`The first number is ${ firstNumber }`);\n * }\n *\n * execute();\n *\n * // Expected output:\n * // 'The first number is 0'\n * ```\n *\n * @see {@link lastValueFrom}\n *\n * @param source the observable to convert to a promise\n * @param config a configuration object to define the `defaultValue` to use if the source completes without emitting a value\n */\nexport function firstValueFrom<T, D>(source: Observable<T>, config?: FirstValueFromConfig<D>): Promise<T | D> {\n  const hasConfig = typeof config === 'object';\n  return new Promise<T | D>((resolve, reject) => {\n    const subscriber = new SafeSubscriber<T>({\n      next: (value) => {\n        resolve(value);\n        subscriber.unsubscribe();\n      },\n      error: reject,\n      complete: () => {\n        if (hasConfig) {\n          resolve(config!.defaultValue);\n        } else {\n          reject(new EmptyError());\n        }\n      },\n    });\n    source.subscribe(subscriber);\n  });\n}\n", "import { OperatorFunction } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\nexport function map<T, R>(project: (value: T, index: number) => R): OperatorFunction<T, R>;\n/** @deprecated Use a closure instead of a `thisArg`. Signatures accepting a `thisArg` will be removed in v8. */\nexport function map<T, R, A>(project: (this: A, value: T, index: number) => R, thisArg: A): OperatorFunction<T, R>;\n\n/**\n * Applies a given `project` function to each value emitted by the source\n * Observable, and emits the resulting values as an Observable.\n *\n * <span class=\"informal\">Like [Array.prototype.map()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map),\n * it passes each source value through a transformation function to get\n * corresponding output values.</span>\n *\n * ![](map.png)\n *\n * Similar to the well known `Array.prototype.map` function, this operator\n * applies a projection to each value and emits that projection in the output\n * Observable.\n *\n * ## Example\n *\n * Map every click to the `clientX` position of that click\n *\n * ```ts\n * import { fromEvent, map } from 'rxjs';\n *\n * const clicks = fromEvent<PointerEvent>(document, 'click');\n * const positions = clicks.pipe(map(ev => ev.clientX));\n *\n * positions.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link mapTo}\n * @see {@link pluck}\n *\n * @param {function(value: T, index: number): R} project The function to apply\n * to each `value` emitted by the source Observable. The `index` parameter is\n * the number `i` for the i-th emission that has happened since the\n * subscription, starting from the number `0`.\n * @param {any} [thisArg] An optional argument to define what `this` is in the\n * `project` function.\n * @return A function that returns an Observable that emits the values from the\n * source Observable transformed by the given `project` function.\n */\nexport function map<T, R>(project: (value: T, index: number) => R, thisArg?: any): OperatorFunction<T, R> {\n  return operate((source, subscriber) => {\n    // The index of the value from the source. Used with projection.\n    let index = 0;\n    // Subscribe to the source, all errors and completions are sent along\n    // to the consumer.\n    source.subscribe(\n      createOperatorSubscriber(subscriber, (value: T) => {\n        // Call the projection function with the appropriate this context,\n        // and send the resulting value to the consumer.\n        subscriber.next(project.call(thisArg, value, index++));\n      })\n    );\n  });\n}\n", "import { Observable } from '../Observable';\nimport { innerFrom } from '../observable/innerFrom';\nimport { Subscriber } from '../Subscriber';\nimport { ObservableInput, SchedulerLike } from '../types';\nimport { executeSchedule } from '../util/executeSchedule';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * A process embodying the general \"merge\" strategy. This is used in\n * `mergeMap` and `mergeScan` because the logic is otherwise nearly identical.\n * @param source The original source observable\n * @param subscriber The consumer subscriber\n * @param project The projection function to get our inner sources\n * @param concurrent The number of concurrent inner subscriptions\n * @param onBeforeNext Additional logic to apply before nexting to our consumer\n * @param expand If `true` this will perform an \"expand\" strategy, which differs only\n * in that it recurses, and the inner subscription must be schedule-able.\n * @param innerSubScheduler A scheduler to use to schedule inner subscriptions,\n * this is to support the expand strategy, mostly, and should be deprecated\n */\nexport function mergeInternals<T, R>(\n  source: Observable<T>,\n  subscriber: Subscriber<R>,\n  project: (value: T, index: number) => ObservableInput<R>,\n  concurrent: number,\n  onBeforeNext?: (innerValue: R) => void,\n  expand?: boolean,\n  innerSubScheduler?: SchedulerLike,\n  additionalFinalizer?: () => void\n) {\n  // Buffered values, in the event of going over our concurrency limit\n  const buffer: T[] = [];\n  // The number of active inner subscriptions.\n  let active = 0;\n  // An index to pass to our accumulator function\n  let index = 0;\n  // Whether or not the outer source has completed.\n  let isComplete = false;\n\n  /**\n   * Checks to see if we can complete our result or not.\n   */\n  const checkComplete = () => {\n    // If the outer has completed, and nothing is left in the buffer,\n    // and we don't have any active inner subscriptions, then we can\n    // Emit the state and complete.\n    if (isComplete && !buffer.length && !active) {\n      subscriber.complete();\n    }\n  };\n\n  // If we're under our concurrency limit, just start the inner subscription, otherwise buffer and wait.\n  const outerNext = (value: T) => (active < concurrent ? doInnerSub(value) : buffer.push(value));\n\n  const doInnerSub = (value: T) => {\n    // If we're expanding, we need to emit the outer values and the inner values\n    // as the inners will \"become outers\" in a way as they are recursively fed\n    // back to the projection mechanism.\n    expand && subscriber.next(value as any);\n\n    // Increment the number of active subscriptions so we can track it\n    // against our concurrency limit later.\n    active++;\n\n    // A flag used to show that the inner observable completed.\n    // This is checked during finalization to see if we should\n    // move to the next item in the buffer, if there is on.\n    let innerComplete = false;\n\n    // Start our inner subscription.\n    innerFrom(project(value, index++)).subscribe(\n      createOperatorSubscriber(\n        subscriber,\n        (innerValue) => {\n          // `mergeScan` has additional handling here. For example\n          // taking the inner value and updating state.\n          onBeforeNext?.(innerValue);\n\n          if (expand) {\n            // If we're expanding, then just recurse back to our outer\n            // handler. It will emit the value first thing.\n            outerNext(innerValue as any);\n          } else {\n            // Otherwise, emit the inner value.\n            subscriber.next(innerValue);\n          }\n        },\n        () => {\n          // Flag that we have completed, so we know to check the buffer\n          // during finalization.\n          innerComplete = true;\n        },\n        // Errors are passed to the destination.\n        undefined,\n        () => {\n          // During finalization, if the inner completed (it wasn't errored or\n          // cancelled), then we want to try the next item in the buffer if\n          // there is one.\n          if (innerComplete) {\n            // We have to wrap this in a try/catch because it happens during\n            // finalization, possibly asynchronously, and we want to pass\n            // any errors that happen (like in a projection function) to\n            // the outer Subscriber.\n            try {\n              // INNER SOURCE COMPLETE\n              // Decrement the active count to ensure that the next time\n              // we try to call `doInnerSub`, the number is accurate.\n              active--;\n              // If we have more values in the buffer, try to process those\n              // Note that this call will increment `active` ahead of the\n              // next conditional, if there were any more inner subscriptions\n              // to start.\n              while (buffer.length && active < concurrent) {\n                const bufferedValue = buffer.shift()!;\n                // Particularly for `expand`, we need to check to see if a scheduler was provided\n                // for when we want to start our inner subscription. Otherwise, we just start\n                // are next inner subscription.\n                if (innerSubScheduler) {\n                  executeSchedule(subscriber, innerSubScheduler, () => doInnerSub(bufferedValue));\n                } else {\n                  doInnerSub(bufferedValue);\n                }\n              }\n              // Check to see if we can complete, and complete if so.\n              checkComplete();\n            } catch (err) {\n              subscriber.error(err);\n            }\n          }\n        }\n      )\n    );\n  };\n\n  // Subscribe to our source observable.\n  source.subscribe(\n    createOperatorSubscriber(subscriber, outerNext, () => {\n      // Outer completed, make a note of it, and check to see if we can complete everything.\n      isComplete = true;\n      checkComplete();\n    })\n  );\n\n  // Additional finalization (for when the destination is torn down).\n  // Other finalization is added implicitly via subscription above.\n  return () => {\n    additionalFinalizer?.();\n  };\n}\n", "import { ObservableInput, OperatorFunction, ObservedValueOf } from '../types';\nimport { map } from './map';\nimport { innerFrom } from '../observable/innerFrom';\nimport { operate } from '../util/lift';\nimport { mergeInternals } from './mergeInternals';\nimport { isFunction } from '../util/isFunction';\n\n/* tslint:disable:max-line-length */\nexport function mergeMap<T, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  concurrent?: number\n): OperatorFunction<T, ObservedValueOf<O>>;\n/** @deprecated The `resultSelector` parameter will be removed in v8. Use an inner `map` instead. Details: https://rxjs.dev/deprecations/resultSelector */\nexport function mergeMap<T, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  resultSelector: undefined,\n  concurrent?: number\n): OperatorFunction<T, ObservedValueOf<O>>;\n/** @deprecated The `resultSelector` parameter will be removed in v8. Use an inner `map` instead. Details: https://rxjs.dev/deprecations/resultSelector */\nexport function mergeMap<T, R, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  resultSelector: (outerValue: T, innerValue: ObservedValueOf<O>, outerIndex: number, innerIndex: number) => R,\n  concurrent?: number\n): OperatorFunction<T, R>;\n/* tslint:enable:max-line-length */\n\n/**\n * Projects each source value to an Observable which is merged in the output\n * Observable.\n *\n * <span class=\"informal\">Maps each value to an Observable, then flattens all of\n * these inner Observables using {@link mergeAll}.</span>\n *\n * ![](mergeMap.png)\n *\n * Returns an Observable that emits items based on applying a function that you\n * supply to each item emitted by the source Observable, where that function\n * returns an Observable, and then merging those resulting Observables and\n * emitting the results of this merger.\n *\n * ## Example\n *\n * Map and flatten each letter to an Observable ticking every 1 second\n *\n * ```ts\n * import { of, mergeMap, interval, map } from 'rxjs';\n *\n * const letters = of('a', 'b', 'c');\n * const result = letters.pipe(\n *   mergeMap(x => interval(1000).pipe(map(i => x + i)))\n * );\n *\n * result.subscribe(x => console.log(x));\n *\n * // Results in the following:\n * // a0\n * // b0\n * // c0\n * // a1\n * // b1\n * // c1\n * // continues to list a, b, c every second with respective ascending integers\n * ```\n *\n * @see {@link concatMap}\n * @see {@link exhaustMap}\n * @see {@link merge}\n * @see {@link mergeAll}\n * @see {@link mergeMapTo}\n * @see {@link mergeScan}\n * @see {@link switchMap}\n *\n * @param {function(value: T, ?index: number): ObservableInput} project A function\n * that, when applied to an item emitted by the source Observable, returns an\n * Observable.\n * @param {number} [concurrent=Infinity] Maximum number of input\n * Observables being subscribed to concurrently.\n * @return A function that returns an Observable that emits the result of\n * applying the projection function (and the optional deprecated\n * `resultSelector`) to each item emitted by the source Observable and merging\n * the results of the Observables obtained from this transformation.\n */\nexport function mergeMap<T, R, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  resultSelector?: ((outerValue: T, innerValue: ObservedValueOf<O>, outerIndex: number, innerIndex: number) => R) | number,\n  concurrent: number = Infinity\n): OperatorFunction<T, ObservedValueOf<O> | R> {\n  if (isFunction(resultSelector)) {\n    // DEPRECATED PATH\n    return mergeMap((a, i) => map((b: any, ii: number) => resultSelector(a, b, i, ii))(innerFrom(project(a, i))), concurrent);\n  } else if (typeof resultSelector === 'number') {\n    concurrent = resultSelector;\n  }\n\n  return operate((source, subscriber) => mergeInternals(source, subscriber, project, concurrent));\n}\n", "import { mergeMap } from './mergeMap';\nimport { identity } from '../util/identity';\nimport { OperatorFunction, ObservableInput, ObservedValueOf } from '../types';\n\n/**\n * Converts a higher-order Observable into a first-order Observable which\n * concurrently delivers all values that are emitted on the inner Observables.\n *\n * <span class=\"informal\">Flattens an Observable-of-Observables.</span>\n *\n * ![](mergeAll.png)\n *\n * `mergeAll` subscribes to an Observable that emits Observables, also known as\n * a higher-order Observable. Each time it observes one of these emitted inner\n * Observables, it subscribes to that and delivers all the values from the\n * inner Observable on the output Observable. The output Observable only\n * completes once all inner Observables have completed. Any error delivered by\n * a inner Observable will be immediately emitted on the output Observable.\n *\n * ## Examples\n *\n * Spawn a new interval Observable for each click event, and blend their outputs as one Observable\n *\n * ```ts\n * import { fromEvent, map, interval, mergeAll } from 'rxjs';\n *\n * const clicks = fromEvent(document, 'click');\n * const higherOrder = clicks.pipe(map(() => interval(1000)));\n * const firstOrder = higherOrder.pipe(mergeAll());\n *\n * firstOrder.subscribe(x => console.log(x));\n * ```\n *\n * Count from 0 to 9 every second for each click, but only allow 2 concurrent timers\n *\n * ```ts\n * import { fromEvent, map, interval, take, mergeAll } from 'rxjs';\n *\n * const clicks = fromEvent(document, 'click');\n * const higherOrder = clicks.pipe(\n *   map(() => interval(1000).pipe(take(10)))\n * );\n * const firstOrder = higherOrder.pipe(mergeAll(2));\n *\n * firstOrder.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link combineLatestAll}\n * @see {@link concatAll}\n * @see {@link exhaustAll}\n * @see {@link merge}\n * @see {@link mergeMap}\n * @see {@link mergeMapTo}\n * @see {@link mergeScan}\n * @see {@link switchAll}\n * @see {@link switchMap}\n * @see {@link zipAll}\n *\n * @param {number} [concurrent=Infinity] Maximum number of inner\n * Observables being subscribed to concurrently.\n * @return A function that returns an Observable that emits values coming from\n * all the inner Observables emitted by the source Observable.\n */\nexport function mergeAll<O extends ObservableInput<any>>(concurrent: number = Infinity): OperatorFunction<O, ObservedValueOf<O>> {\n  return mergeMap(identity, concurrent);\n}\n", "import { Observable } from '../Observable';\nimport { ObservedValueOf, ObservableInput } from '../types';\nimport { innerFrom } from './innerFrom';\n\n/**\n * Creates an Observable that, on subscribe, calls an Observable factory to\n * make an Observable for each new Observer.\n *\n * <span class=\"informal\">Creates the Observable lazily, that is, only when it\n * is subscribed.\n * </span>\n *\n * ![](defer.png)\n *\n * `defer` allows you to create an Observable only when the Observer\n * subscribes. It waits until an Observer subscribes to it, calls the given\n * factory function to get an Observable -- where a factory function typically\n * generates a new Observable -- and subscribes the Observer to this Observable.\n * In case the factory function returns a falsy value, then EMPTY is used as\n * Observable instead. Last but not least, an exception during the factory\n * function call is transferred to the Observer by calling `error`.\n *\n * ## Example\n *\n * Subscribe to either an Observable of clicks or an Observable of interval, at random\n *\n * ```ts\n * import { defer, fromEvent, interval } from 'rxjs';\n *\n * const clicksOrInterval = defer(() => {\n *   return Math.random() > 0.5\n *     ? fromEvent(document, 'click')\n *     : interval(1000);\n * });\n * clicksOrInterval.subscribe(x => console.log(x));\n *\n * // Results in the following behavior:\n * // If the result of Math.random() is greater than 0.5 it will listen\n * // for clicks anywhere on the \"document\"; when document is clicked it\n * // will log a MouseEvent object to the console. If the result is less\n * // than 0.5 it will emit ascending numbers, one every second(1000ms).\n * ```\n *\n * @see {@link Observable}\n *\n * @param {function(): ObservableInput} observableFactory The Observable\n * factory function to invoke for each Observer that subscribes to the output\n * Observable. May also return a Promise, which will be converted on the fly\n * to an Observable.\n * @return {Observable} An Observable whose Observers' subscriptions trigger\n * an invocation of the given Observable factory function.\n */\nexport function defer<R extends ObservableInput<any>>(observableFactory: () => R): Observable<ObservedValueOf<R>> {\n  return new Observable<ObservedValueOf<R>>((subscriber) => {\n    innerFrom(observableFactory()).subscribe(subscriber);\n  });\n}\n", "import { Observable } from '../Observable';\nimport { ObservableInput, ObservableInputTuple, SchedulerLike } from '../types';\nimport { mergeAll } from '../operators/mergeAll';\nimport { innerFrom } from './innerFrom';\nimport { EMPTY } from './empty';\nimport { popNumber, popScheduler } from '../util/args';\nimport { from } from './from';\n\nexport function merge<A extends readonly unknown[]>(...sources: [...ObservableInputTuple<A>]): Observable<A[number]>;\nexport function merge<A extends readonly unknown[]>(...sourcesAndConcurrency: [...ObservableInputTuple<A>, number?]): Observable<A[number]>;\n/** @deprecated The `scheduler` parameter will be removed in v8. Use `scheduled` and `mergeAll`. Details: https://rxjs.dev/deprecations/scheduler-argument */\nexport function merge<A extends readonly unknown[]>(\n  ...sourcesAndScheduler: [...ObservableInputTuple<A>, SchedulerLike?]\n): Observable<A[number]>;\n/** @deprecated The `scheduler` parameter will be removed in v8. Use `scheduled` and `mergeAll`. Details: https://rxjs.dev/deprecations/scheduler-argument */\nexport function merge<A extends readonly unknown[]>(\n  ...sourcesAndConcurrencyAndScheduler: [...ObservableInputTuple<A>, number?, SchedulerLike?]\n): Observable<A[number]>;\n\n/**\n * Creates an output Observable which concurrently emits all values from every\n * given input Observable.\n *\n * <span class=\"informal\">Flattens multiple Observables together by blending\n * their values into one Observable.</span>\n *\n * ![](merge.png)\n *\n * `merge` subscribes to each given input Observable (as arguments), and simply\n * forwards (without doing any transformation) all the values from all the input\n * Observables to the output Observable. The output Observable only completes\n * once all input Observables have completed. Any error delivered by an input\n * Observable will be immediately emitted on the output Observable.\n *\n * ## Examples\n *\n * Merge together two Observables: 1s interval and clicks\n *\n * ```ts\n * import { merge, fromEvent, interval } from 'rxjs';\n *\n * const clicks = fromEvent(document, 'click');\n * const timer = interval(1000);\n * const clicksOrTimer = merge(clicks, timer);\n * clicksOrTimer.subscribe(x => console.log(x));\n *\n * // Results in the following:\n * // timer will emit ascending values, one every second(1000ms) to console\n * // clicks logs MouseEvents to console every time the \"document\" is clicked\n * // Since the two streams are merged you see these happening\n * // as they occur.\n * ```\n *\n * Merge together 3 Observables, but run only 2 concurrently\n *\n * ```ts\n * import { interval, take, merge } from 'rxjs';\n *\n * const timer1 = interval(1000).pipe(take(10));\n * const timer2 = interval(2000).pipe(take(6));\n * const timer3 = interval(500).pipe(take(10));\n *\n * const concurrent = 2; // the argument\n * const merged = merge(timer1, timer2, timer3, concurrent);\n * merged.subscribe(x => console.log(x));\n *\n * // Results in the following:\n * // - First timer1 and timer2 will run concurrently\n * // - timer1 will emit a value every 1000ms for 10 iterations\n * // - timer2 will emit a value every 2000ms for 6 iterations\n * // - after timer1 hits its max iteration, timer2 will\n * //   continue, and timer3 will start to run concurrently with timer2\n * // - when timer2 hits its max iteration it terminates, and\n * //   timer3 will continue to emit a value every 500ms until it is complete\n * ```\n *\n * @see {@link mergeAll}\n * @see {@link mergeMap}\n * @see {@link mergeMapTo}\n * @see {@link mergeScan}\n *\n * @param {...ObservableInput} observables Input Observables to merge together.\n * @param {number} [concurrent=Infinity] Maximum number of input\n * Observables being subscribed to concurrently.\n * @param {SchedulerLike} [scheduler=null] The {@link SchedulerLike} to use for managing\n * concurrency of input Observables.\n * @return {Observable} an Observable that emits items that are the result of\n * every input Observable.\n */\nexport function merge(...args: (ObservableInput<unknown> | number | SchedulerLike)[]): Observable<unknown> {\n  const scheduler = popScheduler(args);\n  const concurrent = popNumber(args, Infinity);\n  const sources = args as ObservableInput<unknown>[];\n  return !sources.length\n    ? // No source provided\n      EMPTY\n    : sources.length === 1\n    ? // One source? Just return it.\n      innerFrom(sources[0])\n    : // Merge all sources\n      mergeAll(concurrent)(from(sources, scheduler));\n}\n", "import { OperatorFunction, MonoTypeOperatorFunction, TruthyTypesOf } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/** @deprecated Use a closure instead of a `thisArg`. Signatures accepting a `thisArg` will be removed in v8. */\nexport function filter<T, S extends T, A>(predicate: (this: A, value: T, index: number) => value is S, thisArg: A): OperatorFunction<T, S>;\nexport function filter<T, S extends T>(predicate: (value: T, index: number) => value is S): OperatorFunction<T, S>;\nexport function filter<T>(predicate: BooleanConstructor): OperatorFunction<T, TruthyTypesOf<T>>;\n/** @deprecated Use a closure instead of a `thisArg`. Signatures accepting a `thisArg` will be removed in v8. */\nexport function filter<T, A>(predicate: (this: A, value: T, index: number) => boolean, thisArg: A): MonoTypeOperatorFunction<T>;\nexport function filter<T>(predicate: (value: T, index: number) => boolean): MonoTypeOperatorFunction<T>;\n\n/**\n * Filter items emitted by the source Observable by only emitting those that\n * satisfy a specified predicate.\n *\n * <span class=\"informal\">Like\n * [Array.prototype.filter()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/filter),\n * it only emits a value from the source if it passes a criterion function.</span>\n *\n * ![](filter.png)\n *\n * Similar to the well-known `Array.prototype.filter` method, this operator\n * takes values from the source Observable, passes them through a `predicate`\n * function and only emits those values that yielded `true`.\n *\n * ## Example\n *\n * Emit only click events whose target was a DIV element\n *\n * ```ts\n * import { fromEvent, filter } from 'rxjs';\n *\n * const div = document.createElement('div');\n * div.style.cssText = 'width: 200px; height: 200px; background: #09c;';\n * document.body.appendChild(div);\n *\n * const clicks = fromEvent(document, 'click');\n * const clicksOnDivs = clicks.pipe(filter(ev => (<HTMLElement>ev.target).tagName === 'DIV'));\n * clicksOnDivs.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link distinct}\n * @see {@link distinctUntilChanged}\n * @see {@link distinctUntilKeyChanged}\n * @see {@link ignoreElements}\n * @see {@link partition}\n * @see {@link skip}\n *\n * @param predicate A function that\n * evaluates each value emitted by the source Observable. If it returns `true`,\n * the value is emitted, if `false` the value is not passed to the output\n * Observable. The `index` parameter is the number `i` for the i-th source\n * emission that has happened since the subscription, starting from the number\n * `0`.\n * @param thisArg An optional argument to determine the value of `this`\n * in the `predicate` function.\n * @return A function that returns an Observable that emits items from the\n * source Observable that satisfy the specified `predicate`.\n */\nexport function filter<T>(predicate: (value: T, index: number) => boolean, thisArg?: any): MonoTypeOperatorFunction<T> {\n  return operate((source, subscriber) => {\n    // An index passed to our predicate function on each call.\n    let index = 0;\n\n    // Subscribe to the source, all errors and completions are\n    // forwarded to the consumer.\n    source.subscribe(\n      // Call the predicate with the appropriate `this` context,\n      // if the predicate returns `true`, then send the value\n      // to the consumer.\n      createOperatorSubscriber(subscriber, (value) => predicate.call(thisArg, value, index++) && subscriber.next(value))\n    );\n  });\n}\n", "export {};\n//# sourceMappingURL=types.js.map", "import { OperatorFunction } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * Emits a given value if the source Observable completes without emitting any\n * `next` value, otherwise mirrors the source Observable.\n *\n * <span class=\"informal\">If the source Observable turns out to be empty, then\n * this operator will emit a default value.</span>\n *\n * ![](defaultIfEmpty.png)\n *\n * `defaultIfEmpty` emits the values emitted by the source Observable or a\n * specified default value if the source Observable is empty (completes without\n * having emitted any `next` value).\n *\n * ## Example\n *\n * If no clicks happen in 5 seconds, then emit 'no clicks'\n *\n * ```ts\n * import { fromEvent, takeUntil, interval, defaultIfEmpty } from 'rxjs';\n *\n * const clicks = fromEvent(document, 'click');\n * const clicksBeforeFive = clicks.pipe(takeUntil(interval(5000)));\n * const result = clicksBeforeFive.pipe(defaultIfEmpty('no clicks'));\n * result.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link empty}\n * @see {@link last}\n *\n * @param defaultValue The default value used if the source\n * Observable is empty.\n * @return A function that returns an Observable that emits either the\n * specified `defaultValue` if the source Observable emits no items, or the\n * values emitted by the source Observable.\n */\nexport function defaultIfEmpty<T, R>(defaultValue: R): OperatorFunction<T, T | R> {\n  return operate((source, subscriber) => {\n    let hasValue = false;\n    source.subscribe(\n      createOperatorSubscriber(\n        subscriber,\n        (value) => {\n          hasValue = true;\n          subscriber.next(value);\n        },\n        () => {\n          if (!hasValue) {\n            subscriber.next(defaultValue!);\n          }\n          subscriber.complete();\n        }\n      )\n    );\n  });\n}\n", "import { MonoTypeOperatorFunction } from '../types';\nimport { EMPTY } from '../observable/empty';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * Emits only the first `count` values emitted by the source Observable.\n *\n * <span class=\"informal\">Takes the first `count` values from the source, then\n * completes.</span>\n *\n * ![](take.png)\n *\n * `take` returns an Observable that emits only the first `count` values emitted\n * by the source Observable. If the source emits fewer than `count` values then\n * all of its values are emitted. After that, it completes, regardless if the\n * source completes.\n *\n * ## Example\n *\n * Take the first 5 seconds of an infinite 1-second interval Observable\n *\n * ```ts\n * import { interval, take } from 'rxjs';\n *\n * const intervalCount = interval(1000);\n * const takeFive = intervalCount.pipe(take(5));\n * takeFive.subscribe(x => console.log(x));\n *\n * // Logs:\n * // 0\n * // 1\n * // 2\n * // 3\n * // 4\n * ```\n *\n * @see {@link takeLast}\n * @see {@link takeUntil}\n * @see {@link takeWhile}\n * @see {@link skip}\n *\n * @param count The maximum number of `next` values to emit.\n * @return A function that returns an Observable that emits only the first\n * `count` values emitted by the source Observable, or all of the values from\n * the source if the source emits fewer than `count` values.\n */\nexport function take<T>(count: number): MonoTypeOperatorFunction<T> {\n  return count <= 0\n    ? // If we are taking no values, that's empty.\n      () => EMPTY\n    : operate((source, subscriber) => {\n        let seen = 0;\n        source.subscribe(\n          createOperatorSubscriber(subscriber, (value) => {\n            // Increment the number of values we have seen,\n            // then check it against the allowed count to see\n            // if we are still letting values through.\n            if (++seen <= count) {\n              subscriber.next(value);\n              // If we have met or passed our allowed count,\n              // we need to complete. We have to do <= here,\n              // because re-entrant code will increment `seen` twice.\n              if (count <= seen) {\n                subscriber.complete();\n              }\n            }\n          })\n        );\n      });\n}\n", "import { OperatorFunction } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { noop } from '../util/noop';\n\n/**\n * Ignores all items emitted by the source Observable and only passes calls of `complete` or `error`.\n *\n * ![](ignoreElements.png)\n *\n * The `ignoreElements` operator suppresses all items emitted by the source Observable,\n * but allows its termination notification (either `error` or `complete`) to pass through unchanged.\n *\n * If you do not care about the items being emitted by an Observable, but you do want to be notified\n * when it completes or when it terminates with an error, you can apply the `ignoreElements` operator\n * to the Observable, which will ensure that it will never call its observers\u2019 `next` handlers.\n *\n * ## Example\n *\n * Ignore all `next` emissions from the source\n *\n * ```ts\n * import { of, ignoreElements } from 'rxjs';\n *\n * of('you', 'talking', 'to', 'me')\n *   .pipe(ignoreElements())\n *   .subscribe({\n *     next: word => console.log(word),\n *     error: err => console.log('error:', err),\n *     complete: () => console.log('the end'),\n *   });\n *\n * // result:\n * // 'the end'\n * ```\n *\n * @return A function that returns an empty Observable that only calls\n * `complete` or `error`, based on which one is called by the source\n * Observable.\n */\nexport function ignoreElements(): OperatorFunction<unknown, never> {\n  return operate((source, subscriber) => {\n    source.subscribe(createOperatorSubscriber(subscriber, noop));\n  });\n}\n", "import { EmptyError } from '../util/EmptyError';\nimport { MonoTypeOperatorFunction } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * If the source observable completes without emitting a value, it will emit\n * an error. The error will be created at that time by the optional\n * `errorFactory` argument, otherwise, the error will be {@link EmptyError}.\n *\n * ![](throwIfEmpty.png)\n *\n * ## Example\n *\n * Throw an error if the document wasn't clicked within 1 second\n *\n * ```ts\n * import { fromEvent, takeUntil, timer, throwIfEmpty } from 'rxjs';\n *\n * const click$ = fromEvent(document, 'click');\n *\n * click$.pipe(\n *   takeUntil(timer(1000)),\n *   throwIfEmpty(() => new Error('The document was not clicked within 1 second'))\n * )\n * .subscribe({\n *   next() {\n *    console.log('The document was clicked');\n *   },\n *   error(err) {\n *     console.error(err.message);\n *   }\n * });\n * ```\n *\n * @param errorFactory A factory function called to produce the\n * error to be thrown when the source observable completes without emitting a\n * value.\n * @return A function that returns an Observable that throws an error if the\n * source Observable completed without emitting.\n */\nexport function throwIfEmpty<T>(errorFactory: () => any = defaultErrorFactory): MonoTypeOperatorFunction<T> {\n  return operate((source, subscriber) => {\n    let hasValue = false;\n    source.subscribe(\n      createOperatorSubscriber(\n        subscriber,\n        (value) => {\n          hasValue = true;\n          subscriber.next(value);\n        },\n        () => (hasValue ? subscriber.complete() : subscriber.error(errorFactory()))\n      )\n    );\n  });\n}\n\nfunction defaultErrorFactory() {\n  return new EmptyError();\n}\n", "import { Observable } from '../Observable';\nimport { EmptyError } from '../util/EmptyError';\nimport { OperatorFunction, TruthyTypesOf } from '../types';\nimport { filter } from './filter';\nimport { take } from './take';\nimport { defaultIfEmpty } from './defaultIfEmpty';\nimport { throwIfEmpty } from './throwIfEmpty';\nimport { identity } from '../util/identity';\n\nexport function first<T, D = T>(predicate?: null, defaultValue?: D): OperatorFunction<T, T | D>;\nexport function first<T>(predicate: BooleanConstructor): OperatorFunction<T, TruthyTypesOf<T>>;\nexport function first<T, D>(predicate: BooleanConstructor, defaultValue: D): OperatorFunction<T, TruthyTypesOf<T> | D>;\nexport function first<T, S extends T>(\n  predicate: (value: T, index: number, source: Observable<T>) => value is S,\n  defaultValue?: S\n): OperatorFunction<T, S>;\nexport function first<T, S extends T, D>(\n  predicate: (value: T, index: number, source: Observable<T>) => value is S,\n  defaultValue: D\n): OperatorFunction<T, S | D>;\nexport function first<T, D = T>(\n  predicate: (value: T, index: number, source: Observable<T>) => boolean,\n  defaultValue?: D\n): OperatorFunction<T, T | D>;\n\n/**\n * Emits only the first value (or the first value that meets some condition)\n * emitted by the source Observable.\n *\n * <span class=\"informal\">Emits only the first value. Or emits only the first\n * value that passes some test.</span>\n *\n * ![](first.png)\n *\n * If called with no arguments, `first` emits the first value of the source\n * Observable, then completes. If called with a `predicate` function, `first`\n * emits the first value of the source that matches the specified condition. Throws an error if\n * `defaultValue` was not provided and a matching element is not found.\n *\n * ## Examples\n *\n * Emit only the first click that happens on the DOM\n *\n * ```ts\n * import { fromEvent, first } from 'rxjs';\n *\n * const clicks = fromEvent(document, 'click');\n * const result = clicks.pipe(first());\n * result.subscribe(x => console.log(x));\n * ```\n *\n * Emits the first click that happens on a DIV\n *\n * ```ts\n * import { fromEvent, first } from 'rxjs';\n *\n * const div = document.createElement('div');\n * div.style.cssText = 'width: 200px; height: 200px; background: #09c;';\n * document.body.appendChild(div);\n *\n * const clicks = fromEvent(document, 'click');\n * const result = clicks.pipe(first(ev => (<HTMLElement>ev.target).tagName === 'DIV'));\n * result.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link filter}\n * @see {@link find}\n * @see {@link take}\n *\n * @throws {EmptyError} Delivers an EmptyError to the Observer's `error`\n * callback if the Observable completes before any `next` notification was sent.\n * This is how `first()` is different from {@link take}(1) which completes instead.\n *\n * @param {function(value: T, index: number, source: Observable<T>): boolean} [predicate]\n * An optional function called with each item to test for condition matching.\n * @param {D} [defaultValue] The default value emitted in case no valid value\n * was found on the source.\n * @return A function that returns an Observable that emits the first item that\n * matches the condition.\n */\nexport function first<T, D>(\n  predicate?: ((value: T, index: number, source: Observable<T>) => boolean) | null,\n  defaultValue?: D\n): OperatorFunction<T, T | D> {\n  const hasDefaultValue = arguments.length >= 2;\n  return (source: Observable<T>) =>\n    source.pipe(\n      predicate ? filter((v, i) => predicate(v, i, source)) : identity,\n      take(1),\n      hasDefaultValue ? defaultIfEmpty(defaultValue!) : throwIfEmpty(() => new EmptyError())\n    );\n}\n", "import { innerFrom } from '../observable/innerFrom';\nimport { Subject } from '../Subject';\nimport { SafeSubscriber } from '../Subscriber';\nimport { Subscription } from '../Subscription';\nimport { MonoTypeOperatorFunction, SubjectLike, ObservableInput } from '../types';\nimport { operate } from '../util/lift';\n\nexport interface ShareConfig<T> {\n  /**\n   * The factory used to create the subject that will connect the source observable to\n   * multicast consumers.\n   */\n  connector?: () => SubjectLike<T>;\n  /**\n   * If `true`, the resulting observable will reset internal state on error from source and return to a \"cold\" state. This\n   * allows the resulting observable to be \"retried\" in the event of an error.\n   * If `false`, when an error comes from the source it will push the error into the connecting subject, and the subject\n   * will remain the connecting subject, meaning the resulting observable will not go \"cold\" again, and subsequent retries\n   * or resubscriptions will resubscribe to that same subject. In all cases, RxJS subjects will emit the same error again, however\n   * {@link ReplaySubject} will also push its buffered values before pushing the error.\n   * It is also possible to pass a notifier factory returning an `ObservableInput` instead which grants more fine-grained\n   * control over how and when the reset should happen. This allows behaviors like conditional or delayed resets.\n   */\n  resetOnError?: boolean | ((error: any) => ObservableInput<any>);\n  /**\n   * If `true`, the resulting observable will reset internal state on completion from source and return to a \"cold\" state. This\n   * allows the resulting observable to be \"repeated\" after it is done.\n   * If `false`, when the source completes, it will push the completion through the connecting subject, and the subject\n   * will remain the connecting subject, meaning the resulting observable will not go \"cold\" again, and subsequent repeats\n   * or resubscriptions will resubscribe to that same subject.\n   * It is also possible to pass a notifier factory returning an `ObservableInput` instead which grants more fine-grained\n   * control over how and when the reset should happen. This allows behaviors like conditional or delayed resets.\n   */\n  resetOnComplete?: boolean | (() => ObservableInput<any>);\n  /**\n   * If `true`, when the number of subscribers to the resulting observable reaches zero due to those subscribers unsubscribing, the\n   * internal state will be reset and the resulting observable will return to a \"cold\" state. This means that the next\n   * time the resulting observable is subscribed to, a new subject will be created and the source will be subscribed to\n   * again.\n   * If `false`, when the number of subscribers to the resulting observable reaches zero due to unsubscription, the subject\n   * will remain connected to the source, and new subscriptions to the result will be connected through that same subject.\n   * It is also possible to pass a notifier factory returning an `ObservableInput` instead which grants more fine-grained\n   * control over how and when the reset should happen. This allows behaviors like conditional or delayed resets.\n   */\n  resetOnRefCountZero?: boolean | (() => ObservableInput<any>);\n}\n\nexport function share<T>(): MonoTypeOperatorFunction<T>;\n\nexport function share<T>(options: ShareConfig<T>): MonoTypeOperatorFunction<T>;\n\n/**\n * Returns a new Observable that multicasts (shares) the original Observable. As long as there is at least one\n * Subscriber this Observable will be subscribed and emitting data. When all subscribers have unsubscribed it will\n * unsubscribe from the source Observable. Because the Observable is multicasting it makes the stream `hot`.\n * This is an alias for `multicast(() => new Subject()), refCount()`.\n *\n * The subscription to the underlying source Observable can be reset (unsubscribe and resubscribe for new subscribers),\n * if the subscriber count to the shared observable drops to 0, or if the source Observable errors or completes. It is\n * possible to use notifier factories for the resets to allow for behaviors like conditional or delayed resets. Please\n * note that resetting on error or complete of the source Observable does not behave like a transparent retry or restart\n * of the source because the error or complete will be forwarded to all subscribers and their subscription will be\n * closed. Only new subscribers after a reset on error or complete happened will cause a fresh subscription to the\n * source. To achieve transparent retries or restarts pipe the source through appropriate operators before sharing.\n *\n * ![](share.png)\n *\n * ## Example\n *\n * Generate new multicast Observable from the `source` Observable value\n *\n * ```ts\n * import { interval, tap, map, take, share } from 'rxjs';\n *\n * const source = interval(1000).pipe(\n *   tap(x => console.log('Processing: ', x)),\n *   map(x => x * x),\n *   take(6),\n *   share()\n * );\n *\n * source.subscribe(x => console.log('subscription 1: ', x));\n * source.subscribe(x => console.log('subscription 2: ', x));\n *\n * // Logs:\n * // Processing: 0\n * // subscription 1: 0\n * // subscription 2: 0\n * // Processing: 1\n * // subscription 1: 1\n * // subscription 2: 1\n * // Processing: 2\n * // subscription 1: 4\n * // subscription 2: 4\n * // Processing: 3\n * // subscription 1: 9\n * // subscription 2: 9\n * // Processing: 4\n * // subscription 1: 16\n * // subscription 2: 16\n * // Processing: 5\n * // subscription 1: 25\n * // subscription 2: 25\n * ```\n *\n * ## Example with notifier factory: Delayed reset\n *\n * ```ts\n * import { interval, take, share, timer } from 'rxjs';\n *\n * const source = interval(1000).pipe(\n *   take(3),\n *   share({\n *     resetOnRefCountZero: () => timer(1000)\n *   })\n * );\n *\n * const subscriptionOne = source.subscribe(x => console.log('subscription 1: ', x));\n * setTimeout(() => subscriptionOne.unsubscribe(), 1300);\n *\n * setTimeout(() => source.subscribe(x => console.log('subscription 2: ', x)), 1700);\n *\n * setTimeout(() => source.subscribe(x => console.log('subscription 3: ', x)), 5000);\n *\n * // Logs:\n * // subscription 1:  0\n * // (subscription 1 unsubscribes here)\n * // (subscription 2 subscribes here ~400ms later, source was not reset)\n * // subscription 2:  1\n * // subscription 2:  2\n * // (subscription 2 unsubscribes here)\n * // (subscription 3 subscribes here ~2000ms later, source did reset before)\n * // subscription 3:  0\n * // subscription 3:  1\n * // subscription 3:  2\n * ```\n *\n * @see {@link shareReplay}\n *\n * @return A function that returns an Observable that mirrors the source.\n */\nexport function share<T>(options: ShareConfig<T> = {}): MonoTypeOperatorFunction<T> {\n  const { connector = () => new Subject<T>(), resetOnError = true, resetOnComplete = true, resetOnRefCountZero = true } = options;\n  // It's necessary to use a wrapper here, as the _operator_ must be\n  // referentially transparent. Otherwise, it cannot be used in calls to the\n  // static `pipe` function - to create a partial pipeline.\n  //\n  // The _operator function_ - the function returned by the _operator_ - will\n  // not be referentially transparent - as it shares its source - but the\n  // _operator function_ is called when the complete pipeline is composed via a\n  // call to a source observable's `pipe` method - not when the static `pipe`\n  // function is called.\n  return (wrapperSource) => {\n    let connection: SafeSubscriber<T> | undefined;\n    let resetConnection: Subscription | undefined;\n    let subject: SubjectLike<T> | undefined;\n    let refCount = 0;\n    let hasCompleted = false;\n    let hasErrored = false;\n\n    const cancelReset = () => {\n      resetConnection?.unsubscribe();\n      resetConnection = undefined;\n    };\n    // Used to reset the internal state to a \"cold\"\n    // state, as though it had never been subscribed to.\n    const reset = () => {\n      cancelReset();\n      connection = subject = undefined;\n      hasCompleted = hasErrored = false;\n    };\n    const resetAndUnsubscribe = () => {\n      // We need to capture the connection before\n      // we reset (if we need to reset).\n      const conn = connection;\n      reset();\n      conn?.unsubscribe();\n    };\n\n    return operate<T, T>((source, subscriber) => {\n      refCount++;\n      if (!hasErrored && !hasCompleted) {\n        cancelReset();\n      }\n\n      // Create the subject if we don't have one yet. Grab a local reference to\n      // it as well, which avoids non-null assertions when using it and, if we\n      // connect to it now, then error/complete need a reference after it was\n      // reset.\n      const dest = (subject = subject ?? connector());\n\n      // Add the finalization directly to the subscriber - instead of returning it -\n      // so that the handling of the subscriber's unsubscription will be wired\n      // up _before_ the subscription to the source occurs. This is done so that\n      // the assignment to the source connection's `closed` property will be seen\n      // by synchronous firehose sources.\n      subscriber.add(() => {\n        refCount--;\n\n        // If we're resetting on refCount === 0, and it's 0, we only want to do\n        // that on \"unsubscribe\", really. Resetting on error or completion is a different\n        // configuration.\n        if (refCount === 0 && !hasErrored && !hasCompleted) {\n          resetConnection = handleReset(resetAndUnsubscribe, resetOnRefCountZero);\n        }\n      });\n\n      // The following line adds the subscription to the subscriber passed.\n      // Basically, `subscriber === dest.subscribe(subscriber)` is `true`.\n      dest.subscribe(subscriber);\n\n      if (\n        !connection &&\n        // Check this shareReplay is still activate - it can be reset to 0\n        // and be \"unsubscribed\" _before_ it actually subscribes.\n        // If we were to subscribe then, it'd leak and get stuck.\n        refCount > 0\n      ) {\n        // We need to create a subscriber here - rather than pass an observer and\n        // assign the returned subscription to connection - because it's possible\n        // for reentrant subscriptions to the shared observable to occur and in\n        // those situations we want connection to be already-assigned so that we\n        // don't create another connection to the source.\n        connection = new SafeSubscriber({\n          next: (value) => dest.next(value),\n          error: (err) => {\n            hasErrored = true;\n            cancelReset();\n            resetConnection = handleReset(reset, resetOnError, err);\n            dest.error(err);\n          },\n          complete: () => {\n            hasCompleted = true;\n            cancelReset();\n            resetConnection = handleReset(reset, resetOnComplete);\n            dest.complete();\n          },\n        });\n        innerFrom(source).subscribe(connection);\n      }\n    })(wrapperSource);\n  };\n}\n\nfunction handleReset<T extends unknown[] = never[]>(\n  reset: () => void,\n  on: boolean | ((...args: T) => ObservableInput<any>),\n  ...args: T\n): Subscription | undefined {\n  if (on === true) {\n    reset();\n    return;\n  }\n\n  if (on === false) {\n    return;\n  }\n\n  const onSubscriber = new SafeSubscriber({\n    next: () => {\n      onSubscriber.unsubscribe();\n      reset();\n    },\n  });\n\n  return innerFrom(on(...args)).subscribe(onSubscriber);\n}\n", "import { MonoTypeOperatorFunction, ObservableInput } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { innerFrom } from '../observable/innerFrom';\nimport { noop } from '../util/noop';\n\n/**\n * Emits the values emitted by the source Observable until a `notifier`\n * Observable emits a value.\n *\n * <span class=\"informal\">Lets values pass until a second Observable,\n * `notifier`, emits a value. Then, it completes.</span>\n *\n * ![](takeUntil.png)\n *\n * `takeUntil` subscribes and begins mirroring the source Observable. It also\n * monitors a second Observable, `notifier` that you provide. If the `notifier`\n * emits a value, the output Observable stops mirroring the source Observable\n * and completes. If the `notifier` doesn't emit any value and completes\n * then `takeUntil` will pass all values.\n *\n * ## Example\n *\n * Tick every second until the first click happens\n *\n * ```ts\n * import { interval, fromEvent, takeUntil } from 'rxjs';\n *\n * const source = interval(1000);\n * const clicks = fromEvent(document, 'click');\n * const result = source.pipe(takeUntil(clicks));\n * result.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link take}\n * @see {@link takeLast}\n * @see {@link takeWhile}\n * @see {@link skip}\n *\n * @param {Observable} notifier The Observable whose first emitted value will\n * cause the output Observable of `takeUntil` to stop emitting values from the\n * source Observable.\n * @return A function that returns an Observable that emits the values from the\n * source Observable until `notifier` emits its first value.\n */\nexport function takeUntil<T>(notifier: ObservableInput<any>): MonoTypeOperatorFunction<T> {\n  return operate((source, subscriber) => {\n    innerFrom(notifier).subscribe(createOperatorSubscriber(subscriber, () => subscriber.complete(), noop));\n    !subscriber.closed && source.subscribe(subscriber);\n  });\n}\n", "import { MonoTypeOperatorFunction, Observer } from '../types';\nimport { isFunction } from '../util/isFunction';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { identity } from '../util/identity';\n\n/**\n * An extension to the {@link Observer} interface used only by the {@link tap} operator.\n *\n * It provides a useful set of callbacks a user can register to do side-effects in\n * cases other than what the usual {@link Observer} callbacks are\n * ({@link guide/glossary-and-semantics#next next},\n * {@link guide/glossary-and-semantics#error error} and/or\n * {@link guide/glossary-and-semantics#complete complete}).\n *\n * ## Example\n *\n * ```ts\n * import { fromEvent, switchMap, tap, interval, take } from 'rxjs';\n *\n * const source$ = fromEvent(document, 'click');\n * const result$ = source$.pipe(\n *   switchMap((_, i) => i % 2 === 0\n *     ? fromEvent(document, 'mousemove').pipe(\n *         tap({\n *           subscribe: () => console.log('Subscribed to the mouse move events after click #' + i),\n *           unsubscribe: () => console.log('Mouse move events #' + i + ' unsubscribed'),\n *           finalize: () => console.log('Mouse move events #' + i + ' finalized')\n *         })\n *       )\n *     : interval(1_000).pipe(\n *         take(5),\n *         tap({\n *           subscribe: () => console.log('Subscribed to the 1-second interval events after click #' + i),\n *           unsubscribe: () => console.log('1-second interval events #' + i + ' unsubscribed'),\n *           finalize: () => console.log('1-second interval events #' + i + ' finalized')\n *         })\n *       )\n *   )\n * );\n *\n * const subscription = result$.subscribe({\n *   next: console.log\n * });\n *\n * setTimeout(() => {\n *   console.log('Unsubscribe after 60 seconds');\n *   subscription.unsubscribe();\n * }, 60_000);\n * ```\n */\nexport interface TapObserver<T> extends Observer<T> {\n  /**\n   * The callback that `tap` operator invokes at the moment when the source Observable\n   * gets subscribed to.\n   */\n  subscribe: () => void;\n  /**\n   * The callback that `tap` operator invokes when an explicit\n   * {@link guide/glossary-and-semantics#unsubscription unsubscribe} happens. It won't get invoked on\n   * `error` or `complete` events.\n   */\n  unsubscribe: () => void;\n  /**\n   * The callback that `tap` operator invokes when any kind of\n   * {@link guide/glossary-and-semantics#finalization finalization} happens - either when\n   * the source Observable `error`s or `complete`s or when it gets explicitly unsubscribed\n   * by the user. There is no difference in using this callback or the {@link finalize}\n   * operator, but if you're already using `tap` operator, you can use this callback\n   * instead. You'd get the same result in either case.\n   */\n  finalize: () => void;\n}\nexport function tap<T>(observerOrNext?: Partial<TapObserver<T>> | ((value: T) => void)): MonoTypeOperatorFunction<T>;\n/** @deprecated Instead of passing separate callback arguments, use an observer argument. Signatures taking separate callback arguments will be removed in v8. Details: https://rxjs.dev/deprecations/subscribe-arguments */\nexport function tap<T>(\n  next?: ((value: T) => void) | null,\n  error?: ((error: any) => void) | null,\n  complete?: (() => void) | null\n): MonoTypeOperatorFunction<T>;\n\n/**\n * Used to perform side-effects for notifications from the source observable\n *\n * <span class=\"informal\">Used when you want to affect outside state with a notification without altering the notification</span>\n *\n * ![](tap.png)\n *\n * Tap is designed to allow the developer a designated place to perform side effects. While you _could_ perform side-effects\n * inside of a `map` or a `mergeMap`, that would make their mapping functions impure, which isn't always a big deal, but will\n * make it so you can't do things like memoize those functions. The `tap` operator is designed solely for such side-effects to\n * help you remove side-effects from other operations.\n *\n * For any notification, next, error, or complete, `tap` will call the appropriate callback you have provided to it, via a function\n * reference, or a partial observer, then pass that notification down the stream.\n *\n * The observable returned by `tap` is an exact mirror of the source, with one exception: Any error that occurs -- synchronously -- in a handler\n * provided to `tap` will be emitted as an error from the returned observable.\n *\n * > Be careful! You can mutate objects as they pass through the `tap` operator's handlers.\n *\n * The most common use of `tap` is actually for debugging. You can place a `tap(console.log)` anywhere\n * in your observable `pipe`, log out the notifications as they are emitted by the source returned by the previous\n * operation.\n *\n * ## Examples\n *\n * Check a random number before it is handled. Below is an observable that will use a random number between 0 and 1,\n * and emit `'big'` or `'small'` depending on the size of that number. But we wanted to log what the original number\n * was, so we have added a `tap(console.log)`.\n *\n * ```ts\n * import { of, tap, map } from 'rxjs';\n *\n * of(Math.random()).pipe(\n *   tap(console.log),\n *   map(n => n > 0.5 ? 'big' : 'small')\n * ).subscribe(console.log);\n * ```\n *\n * Using `tap` to analyze a value and force an error. Below is an observable where in our system we only\n * want to emit numbers 3 or less we get from another source. We can force our observable to error\n * using `tap`.\n *\n * ```ts\n * import { of, tap } from 'rxjs';\n *\n * const source = of(1, 2, 3, 4, 5);\n *\n * source.pipe(\n *   tap(n => {\n *     if (n > 3) {\n *       throw new TypeError(`Value ${ n } is greater than 3`);\n *     }\n *   })\n * )\n * .subscribe({ next: console.log, error: err => console.log(err.message) });\n * ```\n *\n * We want to know when an observable completes before moving on to the next observable. The system\n * below will emit a random series of `'X'` characters from 3 different observables in sequence. The\n * only way we know when one observable completes and moves to the next one, in this case, is because\n * we have added a `tap` with the side effect of logging to console.\n *\n * ```ts\n * import { of, concatMap, interval, take, map, tap } from 'rxjs';\n *\n * of(1, 2, 3).pipe(\n *   concatMap(n => interval(1000).pipe(\n *     take(Math.round(Math.random() * 10)),\n *     map(() => 'X'),\n *     tap({ complete: () => console.log(`Done with ${ n }`) })\n *   ))\n * )\n * .subscribe(console.log);\n * ```\n *\n * @see {@link finalize}\n * @see {@link TapObserver}\n *\n * @param observerOrNext A next handler or partial observer\n * @param error An error handler\n * @param complete A completion handler\n * @return A function that returns an Observable identical to the source, but\n * runs the specified Observer or callback(s) for each item.\n */\nexport function tap<T>(\n  observerOrNext?: Partial<TapObserver<T>> | ((value: T) => void) | null,\n  error?: ((e: any) => void) | null,\n  complete?: (() => void) | null\n): MonoTypeOperatorFunction<T> {\n  // We have to check to see not only if next is a function,\n  // but if error or complete were passed. This is because someone\n  // could technically call tap like `tap(null, fn)` or `tap(null, null, fn)`.\n  const tapObserver =\n    isFunction(observerOrNext) || error || complete\n      ? // tslint:disable-next-line: no-object-literal-type-assertion\n        ({ next: observerOrNext as Exclude<typeof observerOrNext, Partial<TapObserver<T>>>, error, complete } as Partial<TapObserver<T>>)\n      : observerOrNext;\n\n  return tapObserver\n    ? operate((source, subscriber) => {\n        tapObserver.subscribe?.();\n        let isUnsub = true;\n        source.subscribe(\n          createOperatorSubscriber(\n            subscriber,\n            (value) => {\n              tapObserver.next?.(value);\n              subscriber.next(value);\n            },\n            () => {\n              isUnsub = false;\n              tapObserver.complete?.();\n              subscriber.complete();\n            },\n            (err) => {\n              isUnsub = false;\n              tapObserver.error?.(err);\n              subscriber.error(err);\n            },\n            () => {\n              if (isUnsub) {\n                tapObserver.unsubscribe?.();\n              }\n              tapObserver.finalize?.();\n            }\n          )\n        );\n      })\n    : // Tap was called with no valid tap observer or handler\n      // (e.g. `tap(null, null, null)` or `tap(null)` or `tap()`)\n      // so we're going to just mirror the source.\n      identity;\n}\n", "//////////////////////////////////////////////////////////\n// Here we need to reference our other deep imports\n// so VS code will figure out where they are\n// see conversation here:\n// https://github.com/microsoft/TypeScript/issues/43034\n//////////////////////////////////////////////////////////\n\n// tslint:disable: no-reference\n// It's tempting to add references to all of the deep-import locations, but\n// adding references to those that require DOM types breaks Node projects.\n/// <reference path=\"./operators/index.ts\" />\n/// <reference path=\"./testing/index.ts\" />\n// tslint:enable: no-reference\n\n/* Observable */\nexport { Observable } from './internal/Observable';\nexport { ConnectableObservable } from './internal/observable/ConnectableObservable';\nexport { GroupedObservable } from './internal/operators/groupBy';\nexport { Operator } from './internal/Operator';\nexport { observable } from './internal/symbol/observable';\nexport { animationFrames } from './internal/observable/dom/animationFrames';\n\n/* Subjects */\nexport { Subject } from './internal/Subject';\nexport { BehaviorSubject } from './internal/BehaviorSubject';\nexport { ReplaySubject } from './internal/ReplaySubject';\nexport { AsyncSubject } from './internal/AsyncSubject';\n\n/* Schedulers */\nexport { asap, asapScheduler } from './internal/scheduler/asap';\nexport { async, asyncScheduler } from './internal/scheduler/async';\nexport { queue, queueScheduler } from './internal/scheduler/queue';\nexport { animationFrame, animationFrameScheduler } from './internal/scheduler/animationFrame';\nexport { VirtualTimeScheduler, VirtualAction } from './internal/scheduler/VirtualTimeScheduler';\nexport { Scheduler } from './internal/Scheduler';\n\n/* Subscription */\nexport { Subscription } from './internal/Subscription';\nexport { Subscriber } from './internal/Subscriber';\n\n/* Notification */\nexport { Notification, NotificationKind } from './internal/Notification';\n\n/* Utils */\nexport { pipe } from './internal/util/pipe';\nexport { noop } from './internal/util/noop';\nexport { identity } from './internal/util/identity';\nexport { isObservable } from './internal/util/isObservable';\n\n/* Promise Conversion */\nexport { lastValueFrom } from './internal/lastValueFrom';\nexport { firstValueFrom } from './internal/firstValueFrom';\n\n/* Error types */\nexport { ArgumentOutOfRangeError } from './internal/util/ArgumentOutOfRangeError';\nexport { EmptyError } from './internal/util/EmptyError';\nexport { NotFoundError } from './internal/util/NotFoundError';\nexport { ObjectUnsubscribedError } from './internal/util/ObjectUnsubscribedError';\nexport { SequenceError } from './internal/util/SequenceError';\nexport { TimeoutError } from './internal/operators/timeout';\nexport { UnsubscriptionError } from './internal/util/UnsubscriptionError';\n\n/* Static observable creation exports */\nexport { bindCallback } from './internal/observable/bindCallback';\nexport { bindNodeCallback } from './internal/observable/bindNodeCallback';\nexport { combineLatest } from './internal/observable/combineLatest';\nexport { concat } from './internal/observable/concat';\nexport { connectable } from './internal/observable/connectable';\nexport { defer } from './internal/observable/defer';\nexport { empty } from './internal/observable/empty';\nexport { forkJoin } from './internal/observable/forkJoin';\nexport { from } from './internal/observable/from';\nexport { fromEvent } from './internal/observable/fromEvent';\nexport { fromEventPattern } from './internal/observable/fromEventPattern';\nexport { generate } from './internal/observable/generate';\nexport { iif } from './internal/observable/iif';\nexport { interval } from './internal/observable/interval';\nexport { merge } from './internal/observable/merge';\nexport { never } from './internal/observable/never';\nexport { of } from './internal/observable/of';\nexport { onErrorResumeNext } from './internal/observable/onErrorResumeNext';\nexport { pairs } from './internal/observable/pairs';\nexport { partition } from './internal/observable/partition';\nexport { race } from './internal/observable/race';\nexport { range } from './internal/observable/range';\nexport { throwError } from './internal/observable/throwError';\nexport { timer } from './internal/observable/timer';\nexport { using } from './internal/observable/using';\nexport { zip } from './internal/observable/zip';\nexport { scheduled } from './internal/scheduled/scheduled';\n\n/* Constants */\nexport { EMPTY } from './internal/observable/empty';\nexport { NEVER } from './internal/observable/never';\n\n/* Types */\nexport * from './internal/types';\n\n/* Config */\nexport { config, GlobalConfig } from './internal/config';\n\n/* Operators */\nexport { audit } from './internal/operators/audit';\nexport { auditTime } from './internal/operators/auditTime';\nexport { buffer } from './internal/operators/buffer';\nexport { bufferCount } from './internal/operators/bufferCount';\nexport { bufferTime } from './internal/operators/bufferTime';\nexport { bufferToggle } from './internal/operators/bufferToggle';\nexport { bufferWhen } from './internal/operators/bufferWhen';\nexport { catchError } from './internal/operators/catchError';\nexport { combineAll } from './internal/operators/combineAll';\nexport { combineLatestAll } from './internal/operators/combineLatestAll';\nexport { combineLatestWith } from './internal/operators/combineLatestWith';\nexport { concatAll } from './internal/operators/concatAll';\nexport { concatMap } from './internal/operators/concatMap';\nexport { concatMapTo } from './internal/operators/concatMapTo';\nexport { concatWith } from './internal/operators/concatWith';\nexport { connect, ConnectConfig } from './internal/operators/connect';\nexport { count } from './internal/operators/count';\nexport { debounce } from './internal/operators/debounce';\nexport { debounceTime } from './internal/operators/debounceTime';\nexport { defaultIfEmpty } from './internal/operators/defaultIfEmpty';\nexport { delay } from './internal/operators/delay';\nexport { delayWhen } from './internal/operators/delayWhen';\nexport { dematerialize } from './internal/operators/dematerialize';\nexport { distinct } from './internal/operators/distinct';\nexport { distinctUntilChanged } from './internal/operators/distinctUntilChanged';\nexport { distinctUntilKeyChanged } from './internal/operators/distinctUntilKeyChanged';\nexport { elementAt } from './internal/operators/elementAt';\nexport { endWith } from './internal/operators/endWith';\nexport { every } from './internal/operators/every';\nexport { exhaust } from './internal/operators/exhaust';\nexport { exhaustAll } from './internal/operators/exhaustAll';\nexport { exhaustMap } from './internal/operators/exhaustMap';\nexport { expand } from './internal/operators/expand';\nexport { filter } from './internal/operators/filter';\nexport { finalize } from './internal/operators/finalize';\nexport { find } from './internal/operators/find';\nexport { findIndex } from './internal/operators/findIndex';\nexport { first } from './internal/operators/first';\nexport { groupBy, BasicGroupByOptions, GroupByOptionsWithElement } from './internal/operators/groupBy';\nexport { ignoreElements } from './internal/operators/ignoreElements';\nexport { isEmpty } from './internal/operators/isEmpty';\nexport { last } from './internal/operators/last';\nexport { map } from './internal/operators/map';\nexport { mapTo } from './internal/operators/mapTo';\nexport { materialize } from './internal/operators/materialize';\nexport { max } from './internal/operators/max';\nexport { mergeAll } from './internal/operators/mergeAll';\nexport { flatMap } from './internal/operators/flatMap';\nexport { mergeMap } from './internal/operators/mergeMap';\nexport { mergeMapTo } from './internal/operators/mergeMapTo';\nexport { mergeScan } from './internal/operators/mergeScan';\nexport { mergeWith } from './internal/operators/mergeWith';\nexport { min } from './internal/operators/min';\nexport { multicast } from './internal/operators/multicast';\nexport { observeOn } from './internal/operators/observeOn';\nexport { onErrorResumeNextWith } from './internal/operators/onErrorResumeNextWith';\nexport { pairwise } from './internal/operators/pairwise';\nexport { pluck } from './internal/operators/pluck';\nexport { publish } from './internal/operators/publish';\nexport { publishBehavior } from './internal/operators/publishBehavior';\nexport { publishLast } from './internal/operators/publishLast';\nexport { publishReplay } from './internal/operators/publishReplay';\nexport { raceWith } from './internal/operators/raceWith';\nexport { reduce } from './internal/operators/reduce';\nexport { repeat, RepeatConfig } from './internal/operators/repeat';\nexport { repeatWhen } from './internal/operators/repeatWhen';\nexport { retry, RetryConfig } from './internal/operators/retry';\nexport { retryWhen } from './internal/operators/retryWhen';\nexport { refCount } from './internal/operators/refCount';\nexport { sample } from './internal/operators/sample';\nexport { sampleTime } from './internal/operators/sampleTime';\nexport { scan } from './internal/operators/scan';\nexport { sequenceEqual } from './internal/operators/sequenceEqual';\nexport { share, ShareConfig } from './internal/operators/share';\nexport { shareReplay, ShareReplayConfig } from './internal/operators/shareReplay';\nexport { single } from './internal/operators/single';\nexport { skip } from './internal/operators/skip';\nexport { skipLast } from './internal/operators/skipLast';\nexport { skipUntil } from './internal/operators/skipUntil';\nexport { skipWhile } from './internal/operators/skipWhile';\nexport { startWith } from './internal/operators/startWith';\nexport { subscribeOn } from './internal/operators/subscribeOn';\nexport { switchAll } from './internal/operators/switchAll';\nexport { switchMap } from './internal/operators/switchMap';\nexport { switchMapTo } from './internal/operators/switchMapTo';\nexport { switchScan } from './internal/operators/switchScan';\nexport { take } from './internal/operators/take';\nexport { takeLast } from './internal/operators/takeLast';\nexport { takeUntil } from './internal/operators/takeUntil';\nexport { takeWhile } from './internal/operators/takeWhile';\nexport { tap, TapObserver } from './internal/operators/tap';\nexport { throttle, ThrottleConfig } from './internal/operators/throttle';\nexport { throttleTime } from './internal/operators/throttleTime';\nexport { throwIfEmpty } from './internal/operators/throwIfEmpty';\nexport { timeInterval } from './internal/operators/timeInterval';\nexport { timeout, TimeoutConfig, TimeoutInfo } from './internal/operators/timeout';\nexport { timeoutWith } from './internal/operators/timeoutWith';\nexport { timestamp } from './internal/operators/timestamp';\nexport { toArray } from './internal/operators/toArray';\nexport { window } from './internal/operators/window';\nexport { windowCount } from './internal/operators/windowCount';\nexport { windowTime } from './internal/operators/windowTime';\nexport { windowToggle } from './internal/operators/windowToggle';\nexport { windowWhen } from './internal/operators/windowWhen';\nexport { withLatestFrom } from './internal/operators/withLatestFrom';\nexport { zipAll } from './internal/operators/zipAll';\nexport { zipWith } from './internal/operators/zipWith';\n", "import { Observable } from \"rxjs\";\nimport { TraceContext, trace } from \"@ledgerhq/logs\";\nconst TagId = 0x05;\n\n/**\n * Creates a list of chunked buffer from one buffer\n *\n * If this is using a Node buffer: the chunked buffers reference to the same memory as the original buffer.\n * If this is using a Uint8Array: each part of the original buffer is copied into the chunked buffers\n *\n * @param buffer a Node Buffer, or a Uint8Array\n * @param sizeForIndex A function that takes an index (on the buffer) and returns the size of the chunk at that index\n * @returns a list of chunked buffers\n */\nfunction createChunkedBuffers(\n  buffer: Buffer,\n  sizeForIndex: (arg0: number) => number,\n): Array<Buffer> {\n  const chunks: Buffer[] = [];\n\n  for (let i = 0, size = sizeForIndex(0); i < buffer.length; i += size, size = sizeForIndex(i)) {\n    // If this is a Node buffer: this chunked buffer points to the same memory but with cropped starting and ending indices\n    // `slice` and not `subarray`: this might not be a Node Buffer, but probably only a Uint8Array.\n    chunks.push(buffer.slice(i, i + size));\n  }\n\n  return chunks;\n}\n\n/**\n * Sends an APDU by encoding it into chunks and sending the chunks using the given `write` function\n *\n * @param write The function to send each chunk to the device\n * @param apdu\n * @param mtuSize The negotiated maximum size of the data to be sent in one chunk\n * @param options Optional options containing:\n *   - context An optional context object for log/tracing strategy\n * @returns An observable that will only emit if an error occurred, otherwise it will complete\n */\nexport const sendAPDU = (\n  write: (arg0: Buffer) => Promise<void>,\n  apdu: Buffer,\n  mtuSize: number,\n  { context }: { context?: TraceContext } = {},\n): Observable<Buffer> => {\n  // Prepares the data to be sent in chunks, by adding a header to chunked of the APDU\n  // The first chunk will contain the total length of the APDU, which reduces the size of the data written in the first chunk.\n  // The total length of the APDU is encoded in 2 bytes (so 5 bytes for the header with the tag id and the chunk index).\n  const chunks = createChunkedBuffers(apdu, i => mtuSize - (i === 0 ? 5 : 3)).map((buffer, i) => {\n    const head = Buffer.alloc(i === 0 ? 5 : 3);\n    head.writeUInt8(TagId, 0);\n    // Index of the chunk as the 2 next bytes\n    head.writeUInt16BE(i, 1);\n\n    // The total length of the APDU is written on the first chunk\n    if (i === 0) {\n      head.writeUInt16BE(apdu.length, 3);\n    }\n\n    // No 0-padding is needed\n    return Buffer.concat([head, buffer]);\n  });\n\n  return new Observable(o => {\n    let terminated = false;\n\n    async function main() {\n      for (const chunk of chunks) {\n        if (terminated) return;\n        await write(chunk);\n      }\n    }\n\n    main().then(\n      () => {\n        terminated = true;\n        o.complete();\n      },\n      error => {\n        terminated = true;\n        trace({\n          type: \"ble-error\",\n          message: `sendAPDU failure: ${error}`,\n          data: { error },\n          context,\n        });\n        o.error(error);\n      },\n    );\n\n    const unsubscribe = () => {\n      if (!terminated) {\n        trace({\n          type: \"ble-error\",\n          message: \"sendAPDU interruption\",\n          context,\n        });\n        terminated = true;\n      }\n    };\n\n    return unsubscribe;\n  });\n};\n", "import { TransportError, DisconnectedDevice } from \"@ledgerhq/errors\";\nimport { Observable, ReplaySubject, takeUntil } from \"rxjs\";\nimport { TraceContext, trace } from \"@ledgerhq/logs\";\nconst TagId = 0x05;\n\n/**\n * Parses a raw stream coming from a BLE communication into an APDU response\n *\n * @param rawStream An observable containing the raw stream as emitted buffers\n * @param options Optional options containing:\n *   - context An optional context object for log/tracing strategy\n * @returns An observable containing the APDU response as one emitted buffer\n */\nexport const receiveAPDU = (\n  rawStream: Observable<Buffer | Error>,\n  { context }: { context?: TraceContext } = {},\n): Observable<Buffer> =>\n  new Observable(o => {\n    let notifiedIndex = 0;\n    let notifiedDataLength = 0;\n    let notifiedData = Buffer.alloc(0);\n    const subscriptionCleaner = new ReplaySubject<void>();\n\n    // The raw stream is listened/subscribed to until a full message (that can be made of several frames) is received\n    rawStream.pipe(takeUntil(subscriptionCleaner)).subscribe({\n      complete: () => {\n        o.error(new DisconnectedDevice());\n      },\n      error: error => {\n        trace({\n          type: \"ble-error\",\n          message: `Error in receiveAPDU: ${error}`,\n          data: { error },\n          context,\n        });\n        o.error(error);\n      },\n      next: value => {\n        // Silences emitted errors in next\n        if (value instanceof Error) {\n          trace({\n            type: \"ble-error\",\n            message: `Error emitted to receiveAPDU next: ${value}`,\n            data: { error: value },\n            context,\n          });\n\n          return;\n        }\n\n        const tag = value.readUInt8(0);\n        const chunkIndex = value.readUInt16BE(1);\n        // `slice` and not `subarray`: this is not a Node Buffer, but probably only a Uint8Array.\n        let chunkData = value.slice(3);\n\n        if (tag !== TagId) {\n          o.error(new TransportError(\"Invalid tag \" + tag.toString(16), \"InvalidTag\"));\n          return;\n        }\n\n        // A chunk was probably missed\n        if (notifiedIndex !== chunkIndex) {\n          o.error(\n            new TransportError(\n              `BLE: Invalid sequence number. discontinued chunk. Received ${chunkIndex} but expected ${notifiedIndex}`,\n              \"InvalidSequence\",\n            ),\n          );\n          return;\n        }\n\n        // The total length of the response is located on the next 2 bytes on the 1st chunk\n        if (chunkIndex === 0) {\n          notifiedDataLength = chunkData.readUInt16BE(0);\n          // `slice` and not `subarray`: this is not a Node Buffer, but probably only a Uint8Array.\n          chunkData = chunkData.slice(2);\n        }\n\n        notifiedIndex++;\n        // The cost of creating a new buffer for each received chunk is low because the response is often contained in 1 chunk.\n        // Allocating `notifiedData` buffer with the received total length and mutating it will probably not improve any performance.\n        notifiedData = Buffer.concat([notifiedData, chunkData]);\n\n        if (notifiedData.length > notifiedDataLength) {\n          o.error(\n            new TransportError(\n              `BLE: received too much data. discontinued chunk. Received ${notifiedData.length} but expected ${notifiedDataLength}`,\n              \"BLETooMuchData\",\n            ),\n          );\n          return;\n        }\n\n        if (notifiedData.length === notifiedDataLength) {\n          o.next(notifiedData);\n          o.complete();\n          // Tries to unsubscribe from the raw stream as soon as we complete the parent observer\n          subscriptionCleaner.next();\n        }\n      },\n    });\n\n    return () => {\n      subscriptionCleaner.next();\n    };\n  });\n", "/* Operator exports */\nexport { audit } from '../internal/operators/audit';\nexport { auditTime } from '../internal/operators/auditTime';\nexport { buffer } from '../internal/operators/buffer';\nexport { bufferCount } from '../internal/operators/bufferCount';\nexport { bufferTime } from '../internal/operators/bufferTime';\nexport { bufferToggle } from '../internal/operators/bufferToggle';\nexport { bufferWhen } from '../internal/operators/bufferWhen';\nexport { catchError } from '../internal/operators/catchError';\nexport { combineAll } from '../internal/operators/combineAll';\nexport { combineLatestAll } from '../internal/operators/combineLatestAll';\nexport { combineLatest } from '../internal/operators/combineLatest';\nexport { combineLatestWith } from '../internal/operators/combineLatestWith';\nexport { concat } from '../internal/operators/concat';\nexport { concatAll } from '../internal/operators/concatAll';\nexport { concatMap } from '../internal/operators/concatMap';\nexport { concatMapTo } from '../internal/operators/concatMapTo';\nexport { concatWith } from '../internal/operators/concatWith';\nexport { connect, ConnectConfig } from '../internal/operators/connect';\nexport { count } from '../internal/operators/count';\nexport { debounce } from '../internal/operators/debounce';\nexport { debounceTime } from '../internal/operators/debounceTime';\nexport { defaultIfEmpty } from '../internal/operators/defaultIfEmpty';\nexport { delay } from '../internal/operators/delay';\nexport { delayWhen } from '../internal/operators/delayWhen';\nexport { dematerialize } from '../internal/operators/dematerialize';\nexport { distinct } from '../internal/operators/distinct';\nexport { distinctUntilChanged } from '../internal/operators/distinctUntilChanged';\nexport { distinctUntilKeyChanged } from '../internal/operators/distinctUntilKeyChanged';\nexport { elementAt } from '../internal/operators/elementAt';\nexport { endWith } from '../internal/operators/endWith';\nexport { every } from '../internal/operators/every';\nexport { exhaust } from '../internal/operators/exhaust';\nexport { exhaustAll } from '../internal/operators/exhaustAll';\nexport { exhaustMap } from '../internal/operators/exhaustMap';\nexport { expand } from '../internal/operators/expand';\nexport { filter } from '../internal/operators/filter';\nexport { finalize } from '../internal/operators/finalize';\nexport { find } from '../internal/operators/find';\nexport { findIndex } from '../internal/operators/findIndex';\nexport { first } from '../internal/operators/first';\nexport { groupBy, BasicGroupByOptions, GroupByOptionsWithElement } from '../internal/operators/groupBy';\nexport { ignoreElements } from '../internal/operators/ignoreElements';\nexport { isEmpty } from '../internal/operators/isEmpty';\nexport { last } from '../internal/operators/last';\nexport { map } from '../internal/operators/map';\nexport { mapTo } from '../internal/operators/mapTo';\nexport { materialize } from '../internal/operators/materialize';\nexport { max } from '../internal/operators/max';\nexport { merge } from '../internal/operators/merge';\nexport { mergeAll } from '../internal/operators/mergeAll';\nexport { flatMap } from '../internal/operators/flatMap';\nexport { mergeMap } from '../internal/operators/mergeMap';\nexport { mergeMapTo } from '../internal/operators/mergeMapTo';\nexport { mergeScan } from '../internal/operators/mergeScan';\nexport { mergeWith } from '../internal/operators/mergeWith';\nexport { min } from '../internal/operators/min';\nexport { multicast } from '../internal/operators/multicast';\nexport { observeOn } from '../internal/operators/observeOn';\nexport { onErrorResumeNext } from '../internal/operators/onErrorResumeNextWith';\nexport { pairwise } from '../internal/operators/pairwise';\nexport { partition } from '../internal/operators/partition';\nexport { pluck } from '../internal/operators/pluck';\nexport { publish } from '../internal/operators/publish';\nexport { publishBehavior } from '../internal/operators/publishBehavior';\nexport { publishLast } from '../internal/operators/publishLast';\nexport { publishReplay } from '../internal/operators/publishReplay';\nexport { race } from '../internal/operators/race';\nexport { raceWith } from '../internal/operators/raceWith';\nexport { reduce } from '../internal/operators/reduce';\nexport { repeat, RepeatConfig } from '../internal/operators/repeat';\nexport { repeatWhen } from '../internal/operators/repeatWhen';\nexport { retry, RetryConfig } from '../internal/operators/retry';\nexport { retryWhen } from '../internal/operators/retryWhen';\nexport { refCount } from '../internal/operators/refCount';\nexport { sample } from '../internal/operators/sample';\nexport { sampleTime } from '../internal/operators/sampleTime';\nexport { scan } from '../internal/operators/scan';\nexport { sequenceEqual } from '../internal/operators/sequenceEqual';\nexport { share, ShareConfig } from '../internal/operators/share';\nexport { shareReplay, ShareReplayConfig } from '../internal/operators/shareReplay';\nexport { single } from '../internal/operators/single';\nexport { skip } from '../internal/operators/skip';\nexport { skipLast } from '../internal/operators/skipLast';\nexport { skipUntil } from '../internal/operators/skipUntil';\nexport { skipWhile } from '../internal/operators/skipWhile';\nexport { startWith } from '../internal/operators/startWith';\nexport { subscribeOn } from '../internal/operators/subscribeOn';\nexport { switchAll } from '../internal/operators/switchAll';\nexport { switchMap } from '../internal/operators/switchMap';\nexport { switchMapTo } from '../internal/operators/switchMapTo';\nexport { switchScan } from '../internal/operators/switchScan';\nexport { take } from '../internal/operators/take';\nexport { takeLast } from '../internal/operators/takeLast';\nexport { takeUntil } from '../internal/operators/takeUntil';\nexport { takeWhile } from '../internal/operators/takeWhile';\nexport { tap, TapObserver } from '../internal/operators/tap';\nexport { throttle, ThrottleConfig } from '../internal/operators/throttle';\nexport { throttleTime } from '../internal/operators/throttleTime';\nexport { throwIfEmpty } from '../internal/operators/throwIfEmpty';\nexport { timeInterval } from '../internal/operators/timeInterval';\nexport { timeout, TimeoutConfig, TimeoutInfo } from '../internal/operators/timeout';\nexport { timeoutWith } from '../internal/operators/timeoutWith';\nexport { timestamp } from '../internal/operators/timestamp';\nexport { toArray } from '../internal/operators/toArray';\nexport { window } from '../internal/operators/window';\nexport { windowCount } from '../internal/operators/windowCount';\nexport { windowTime } from '../internal/operators/windowTime';\nexport { windowToggle } from '../internal/operators/windowToggle';\nexport { windowWhen } from '../internal/operators/windowWhen';\nexport { withLatestFrom } from '../internal/operators/withLatestFrom';\nexport { zip } from '../internal/operators/zip';\nexport { zipAll } from '../internal/operators/zipAll';\nexport { zipWith } from '../internal/operators/zipWith';\n", "import { Observable } from \"rxjs\";\nimport type { Characteristic } from \"./types\";\nimport { log } from \"@ledgerhq/logs\";\n\nexport const monitorCharacteristic = (characteristic: Characteristic): Observable<Buffer> =>\n  Observable.create(o => {\n    log(\"ble-verbose\", \"start monitor \" + characteristic.uuid);\n\n    function onCharacteristicValueChanged(event) {\n      const characteristic = event.target;\n\n      if (characteristic.value) {\n        o.next(Buffer.from(characteristic.value.buffer));\n      }\n    }\n\n    characteristic.startNotifications().then(() => {\n      characteristic.addEventListener(\"characteristicvaluechanged\", onCharacteristicValueChanged);\n    });\n    return () => {\n      log(\"ble-verbose\", \"end monitor \" + characteristic.uuid);\n      characteristic.stopNotifications();\n    };\n  });\n", "/* eslint-disable prefer-template */\nimport Transport from \"@ledgerhq/hw-transport\";\nimport { DisconnectedDevice, TransportOpenUserCancelled } from \"@ledgerhq/errors\";\nimport { getBluetoothServiceUuids, getInfosForServiceUuid } from \"@ledgerhq/devices\";\nimport type { DeviceModel } from \"@ledgerhq/devices\";\nimport { sendAPDU } from \"@ledgerhq/devices/ble/sendAPDU\";\nimport { receiveAPDU } from \"@ledgerhq/devices/ble/receiveAPDU\";\nimport { log } from \"@ledgerhq/logs\";\nimport { Observable, Subscription, defer, merge, from, firstValueFrom } from \"rxjs\";\nimport { share, ignoreElements, first, map, tap } from \"rxjs/operators\";\nimport type { Device, Characteristic } from \"./types\";\nimport { monitorCharacteristic } from \"./monitorCharacteristic\";\n\nconst requiresBluetooth = () => {\n  // $FlowFixMe\n  const { bluetooth } = navigator;\n\n  if (typeof bluetooth === \"undefined\") {\n    throw new Error(\"web bluetooth not supported\");\n  }\n\n  return bluetooth;\n};\n\nconst availability = (): Observable<boolean> =>\n  Observable.create(observer => {\n    const bluetooth = requiresBluetooth();\n\n    const onAvailabilityChanged = e => {\n      observer.next(e.value);\n    };\n\n    bluetooth.addEventListener(\"availabilitychanged\", onAvailabilityChanged);\n    let unsubscribed = false;\n    bluetooth.getAvailability().then(available => {\n      if (!unsubscribed) {\n        observer.next(available);\n      }\n    });\n    return () => {\n      unsubscribed = true;\n      bluetooth.removeEventListener(\"availabilitychanged\", onAvailabilityChanged);\n    };\n  });\n\nconst transportsCache = {};\n\nconst requestDeviceParam = () => ({\n  filters: getBluetoothServiceUuids().map(uuid => ({\n    services: [uuid],\n  })),\n});\n\nconst retrieveService = async device => {\n  if (!device.gatt) throw new Error(\"bluetooth gatt not found\");\n  const [service] = await device.gatt.getPrimaryServices();\n  if (!service) throw new Error(\"bluetooth service not found\");\n  const infos = getInfosForServiceUuid(service.uuid);\n  if (!infos) throw new Error(\"bluetooth service infos not found\");\n  return [service, infos];\n};\n\nasync function open(deviceOrId: Device | string, needsReconnect: boolean) {\n  let device;\n\n  if (typeof deviceOrId === \"string\") {\n    if (transportsCache[deviceOrId]) {\n      log(\"ble-verbose\", \"Transport in cache, using that.\");\n      return transportsCache[deviceOrId];\n    }\n\n    const bluetooth = requiresBluetooth();\n    // TODO instead we should \"query\" the device by its ID\n    device = await bluetooth.requestDevice(requestDeviceParam());\n  } else {\n    device = deviceOrId;\n  }\n\n  if (!device.gatt.connected) {\n    log(\"ble-verbose\", \"not connected. connecting...\");\n    await device.gatt.connect();\n  }\n\n  const [service, infos] = await retrieveService(device);\n  const { deviceModel, writeUuid, notifyUuid } = infos;\n  const [writeC, notifyC] = await Promise.all([\n    service.getCharacteristic(writeUuid),\n    service.getCharacteristic(notifyUuid),\n  ]);\n  const notifyObservable = monitorCharacteristic(notifyC).pipe(\n    tap(value => {\n      log(\"ble-frame\", \"<= \" + value.toString(\"hex\"));\n    }),\n    share(),\n  );\n  const notif = notifyObservable.subscribe();\n  const transport = new BluetoothTransport(device, writeC, notifyObservable, deviceModel);\n\n  if (!device.gatt.connected) {\n    throw new DisconnectedDevice();\n  }\n\n  // eslint-disable-next-line require-atomic-updates\n  transportsCache[transport.id] = transport;\n\n  const onDisconnect = e => {\n    console.log(\"onDisconnect!\", e);\n    delete transportsCache[transport.id];\n    transport.notYetDisconnected = false;\n    notif.unsubscribe();\n    device.removeEventListener(\"gattserverdisconnected\", onDisconnect);\n    log(\"ble-verbose\", `BleTransport(${transport.id}) disconnected`);\n    transport.emit(\"disconnect\", e);\n  };\n\n  device.addEventListener(\"gattserverdisconnected\", onDisconnect);\n  const beforeMTUTime = Date.now();\n\n  try {\n    await transport.inferMTU();\n  } finally {\n    const afterMTUTime = Date.now();\n\n    // workaround for #279: we need to open() again if we come the first time here,\n    // to make sure we do a disconnect() after the first pairing time\n    // because of a firmware bug\n    if (afterMTUTime - beforeMTUTime < 1000) {\n      needsReconnect = false; // (optim) there is likely no new pairing done because mtu answer was fast.\n    }\n\n    if (needsReconnect) {\n      await device.gatt.disconnect();\n      // necessary time for the bonding workaround\n      await new Promise(s => setTimeout(s, 4000));\n    }\n  }\n\n  if (needsReconnect) {\n    return open(device, false);\n  }\n\n  return transport;\n}\n/**\n * react-native bluetooth BLE implementation\n * @example\n * import BluetoothTransport from \"@ledgerhq/hw-transport-web-ble\";\n */\n\nexport default class BluetoothTransport extends Transport {\n  static isSupported = (): Promise<boolean> =>\n    Promise.resolve()\n      .then(requiresBluetooth)\n      .then(\n        () => true,\n        () => false,\n      );\n\n  /**\n   * observe event with { available: bool, type: string }\n   * (available is generic, type is specific)\n   * an event is emit once and then each time it changes\n   */\n  static observeAvailability = (observer: any): Subscription => availability().subscribe(observer);\n  static list = (): any => Promise.resolve([]);\n\n  /**\n   * Scan for Ledger Bluetooth devices.\n   * On this web implementation, it only emits ONE device, the one that was selected in the UI (if any).\n   */\n  static listen(observer: any) {\n    log(\"ble-verbose\", \"listen...\");\n    let unsubscribed;\n    const bluetooth = requiresBluetooth();\n    bluetooth.requestDevice(requestDeviceParam()).then(\n      device => {\n        if (!unsubscribed) {\n          observer.next({\n            type: \"add\",\n            descriptor: device,\n          });\n          observer.complete();\n        }\n      },\n      error => {\n        observer.error(new TransportOpenUserCancelled(error.message));\n      },\n    );\n\n    function unsubscribe() {\n      unsubscribed = true;\n    }\n\n    return {\n      unsubscribe,\n    };\n  }\n\n  /**\n   * open a bluetooth device.\n   */\n  static async open(deviceOrId: Device | string) {\n    return open(deviceOrId, true);\n  }\n\n  /**\n   * globally disconnect a bluetooth device by its id.\n   */\n  static disconnect = async (id: any) => {\n    log(\"ble-verbose\", `user disconnect(${id})`);\n    const transport = transportsCache[id];\n\n    if (transport) {\n      transport.device.gatt.disconnect();\n    }\n  };\n  id: string;\n  device: Device;\n  mtuSize = 20;\n  writeCharacteristic: Characteristic;\n  notifyObservable: Observable<Buffer>;\n  notYetDisconnected = true;\n  deviceModel: DeviceModel;\n\n  constructor(\n    device: Device,\n    writeCharacteristic: Characteristic,\n    notifyObservable: Observable<any>,\n    deviceModel: DeviceModel,\n  ) {\n    super();\n    this.id = device.id;\n    this.device = device;\n    this.writeCharacteristic = writeCharacteristic;\n    this.notifyObservable = notifyObservable;\n    this.deviceModel = deviceModel;\n    log(\"ble-verbose\", `BleTransport(${String(this.id)}) new instance`);\n  }\n\n  async inferMTU() {\n    let mtu = 23;\n    await this.exchangeAtomicImpl(async () => {\n      try {\n        mtu =\n          (await firstValueFrom(\n            merge(\n              this.notifyObservable.pipe(\n                first(buffer => buffer.readUInt8(0) === 0x08),\n                map(buffer => buffer.readUInt8(5)),\n              ),\n              defer(() => from(this.write(Buffer.from([0x08, 0, 0, 0, 0])))).pipe(ignoreElements()),\n            ),\n          )) + 3;\n      } catch (e) {\n        log(\"ble-error\", \"inferMTU got \" + String(e));\n        this.device.gatt.disconnect();\n        throw e;\n      }\n    });\n\n    if (mtu > 23) {\n      const mtuSize = mtu - 3;\n      log(\"ble-verbose\", `BleTransport(${String(this.id)}) mtu set to ${String(mtuSize)}`);\n      this.mtuSize = mtuSize;\n    }\n\n    return this.mtuSize;\n  }\n\n  /**\n   * Exchange with the device using APDU protocol.\n   * @param apdu\n   * @returns a promise of apdu response\n   */\n  async exchange(apdu: Buffer): Promise<Buffer> {\n    const b = await this.exchangeAtomicImpl(async () => {\n      try {\n        const msgIn = apdu.toString(\"hex\");\n        log(\"apdu\", `=> ${msgIn}`);\n        const data = await firstValueFrom(\n          merge(this.notifyObservable.pipe(receiveAPDU), sendAPDU(this.write, apdu, this.mtuSize)),\n        );\n        const msgOut = data.toString(\"hex\");\n        log(\"apdu\", `<= ${msgOut}`);\n        return data;\n      } catch (e) {\n        log(\"ble-error\", \"exchange got \" + String(e));\n\n        if (this.notYetDisconnected) {\n          // in such case we will always disconnect because something is bad.\n          this.device.gatt.disconnect();\n        }\n\n        throw e;\n      }\n    });\n\n    return b as Buffer;\n  }\n\n  setScrambleKey() {}\n\n  write = async (buffer: Buffer) => {\n    log(\"ble-frame\", \"=> \" + buffer.toString(\"hex\"));\n    await this.writeCharacteristic.writeValue(buffer);\n  };\n\n  async close() {\n    if (this.exchangeBusyPromise) {\n      await this.exchangeBusyPromise;\n    }\n  }\n}\n", "import { TransportError } from \"@ledgerhq/errors\";\n\n// Represents a response message from the device being reduced from HID USB frames/packets\nexport type ResponseAcc =\n  | {\n      data: Buffer;\n      dataLength: number;\n      // The current frame id/number\n      sequence: number;\n    }\n  | null\n  | undefined;\n\nconst Tag = 0x05;\n\nfunction asUInt16BE(value) {\n  const b = Buffer.alloc(2);\n  b.writeUInt16BE(value, 0);\n  return b;\n}\n\nconst initialAcc = {\n  data: Buffer.alloc(0),\n  dataLength: 0,\n  sequence: 0,\n};\n\n/**\n * Object to handle HID frames (encoding and decoding)\n *\n * @param channel\n * @param packetSize The HID protocol packet size in bytes (usually 64)\n */\nconst createHIDframing = (channel: number, packetSize: number) => {\n  return {\n    /**\n     * Frames/encodes an APDU message into HID USB packets/frames\n     *\n     * @param apdu The APDU message to send, in a Buffer containing [cla, ins, p1, p2, data length, data(if not empty)]\n     * @returns an array of HID USB frames ready to be sent\n     */\n    makeBlocks(apdu: Buffer): Buffer[] {\n      // Encodes the APDU length in 2 bytes before the APDU itself.\n      // The length is measured as the number of bytes.\n      // As the size of the APDU `data` should have been added in 1 byte just before `data`,\n      // the minimum size of an APDU is 5 bytes.\n      let data = Buffer.concat([asUInt16BE(apdu.length), apdu]);\n\n      const blockSize = packetSize - 5;\n      const nbBlocks = Math.ceil(data.length / blockSize);\n\n      // Fills data with 0-padding\n      data = Buffer.concat([data, Buffer.alloc(nbBlocks * blockSize - data.length + 1).fill(0)]);\n\n      const blocks: Buffer[] = [];\n\n      for (let i = 0; i < nbBlocks; i++) {\n        const head = Buffer.alloc(5);\n        head.writeUInt16BE(channel, 0);\n        head.writeUInt8(Tag, 2);\n        head.writeUInt16BE(i, 3);\n\n        // `slice` and not `subarray`: this might not be a Node Buffer, but probably only a Uint8Array\n        const chunk = data.slice(i * blockSize, (i + 1) * blockSize);\n\n        blocks.push(Buffer.concat([head, chunk]));\n      }\n\n      return blocks;\n    },\n\n    /**\n     * Reduces HID USB packets/frames to one response.\n     *\n     * @param acc The value resulting from (accumulating) the previous call of reduceResponse.\n     *   On first call initialized to `initialAcc`. The accumulator enables handling multi-frames messages.\n     * @param chunk Current chunk to reduce into accumulator\n     * @returns An accumulator value updated with the current chunk\n     */\n    reduceResponse(acc: ResponseAcc, chunk: Buffer): ResponseAcc {\n      let { data, dataLength, sequence } = acc || initialAcc;\n\n      if (chunk.readUInt16BE(0) !== channel) {\n        throw new TransportError(\"Invalid channel\", \"InvalidChannel\");\n      }\n\n      if (chunk.readUInt8(2) !== Tag) {\n        throw new TransportError(\"Invalid tag\", \"InvalidTag\");\n      }\n\n      if (chunk.readUInt16BE(3) !== sequence) {\n        throw new TransportError(\"Invalid sequence\", \"InvalidSequence\");\n      }\n\n      // Gets the total length of the response from the 1st frame\n      if (!acc) {\n        dataLength = chunk.readUInt16BE(5);\n      }\n\n      sequence++;\n      // The total length on the 1st frame takes 2 more bytes\n      const chunkData = chunk.slice(acc ? 5 : 7);\n      data = Buffer.concat([data, chunkData]);\n\n      // Removes any 0 padding\n      if (data.length > dataLength) {\n        data = data.slice(0, dataLength);\n      }\n\n      return {\n        data,\n        dataLength,\n        sequence,\n      };\n    },\n\n    /**\n     * Returns the response message that has been reduced from the HID USB frames\n     *\n     * @param acc The accumulator\n     * @returns A Buffer containing the cleaned response message, or null if no response message, or undefined if the\n     *   accumulator is incorrect (message length is not valid)\n     */\n    getReducedResult(acc: ResponseAcc): Buffer | null | undefined {\n      if (acc && acc.dataLength === acc.data.length) {\n        return acc.data;\n      }\n    },\n  };\n};\n\nexport default createHIDframing;\n", "import { ledgerUSBVendorId } from \"@ledgerhq/devices\";\n\nconst ledgerDevices = [\n  {\n    vendorId: ledgerUSBVendorId,\n  },\n];\n\nexport async function requestLedgerDevice(): Promise<USBDevice> {\n  const device = await navigator.usb.requestDevice({\n    filters: ledgerDevices,\n  });\n  return device;\n}\n\nexport async function getLedgerDevices(): Promise<USBDevice[]> {\n  const devices = await navigator.usb.getDevices();\n  return devices.filter(d => d.vendorId === ledgerUSBVendorId);\n}\n\nexport async function getFirstLedgerDevice(): Promise<USBDevice> {\n  const existingDevices = await getLedgerDevices();\n  if (existingDevices.length > 0) return existingDevices[0];\n  return requestLedgerDevice();\n}\n\nexport const isSupported = (): Promise<boolean> =>\n  Promise.resolve(!!navigator && !!navigator.usb && typeof navigator.usb.getDevices === \"function\");\n", "import Transport from \"@ledgerhq/hw-transport\";\nimport type { Observer, DescriptorEvent, Subscription } from \"@ledgerhq/hw-transport\";\nimport hidFraming from \"@ledgerhq/devices/hid-framing\";\nimport { identifyUSBProductId } from \"@ledgerhq/devices\";\nimport type { DeviceModel } from \"@ledgerhq/devices\";\nimport { log } from \"@ledgerhq/logs\";\nimport {\n  TransportOpenUserCancelled,\n  TransportInterfaceNotAvailable,\n  TransportWebUSBGestureRequired,\n  DisconnectedDeviceDuringOperation,\n  DisconnectedDevice,\n} from \"@ledgerhq/errors\";\nimport { getLedgerDevices, getFirstLedgerDevice, requestLedgerDevice, isSupported } from \"./webusb\";\n\nconst configurationValue = 1;\nconst endpointNumber = 3;\n\n/**\n * WebUSB Transport implementation\n * @example\n * import TransportWebUSB from \"@ledgerhq/hw-transport-webusb\";\n * ...\n * TransportWebUSB.create().then(transport => ...)\n */\nexport default class TransportWebUSB extends Transport {\n  device: USBDevice;\n  deviceModel: DeviceModel | null | undefined;\n  channel = Math.floor(Math.random() * 0xffff);\n  packetSize = 64;\n  interfaceNumber: number;\n\n  constructor(device: USBDevice, interfaceNumber: number) {\n    super();\n    this.device = device;\n    this.interfaceNumber = interfaceNumber;\n    this.deviceModel = identifyUSBProductId(device.productId);\n  }\n\n  /**\n   * Check if WebUSB transport is supported.\n   */\n  static isSupported = isSupported;\n\n  /**\n   * List the WebUSB devices that was previously authorized by the user.\n   */\n  static list = getLedgerDevices;\n\n  /**\n   * Actively listen to WebUSB devices and emit ONE device\n   * that was either accepted before, if not it will trigger the native permission UI.\n   *\n   * Important: it must be called in the context of a UI click!\n   */\n  static listen = (observer: Observer<DescriptorEvent<USBDevice>>): Subscription => {\n    let unsubscribed = false;\n    getFirstLedgerDevice().then(\n      device => {\n        if (!unsubscribed) {\n          const deviceModel = identifyUSBProductId(device.productId);\n          observer.next({\n            type: \"add\",\n            descriptor: device,\n            deviceModel,\n          });\n          observer.complete();\n        }\n      },\n      error => {\n        if (window.DOMException && error instanceof window.DOMException && error.code === 18) {\n          observer.error(new TransportWebUSBGestureRequired(error.message));\n        } else {\n          observer.error(new TransportOpenUserCancelled(error.message));\n        }\n      },\n    );\n\n    function unsubscribe() {\n      unsubscribed = true;\n    }\n\n    return {\n      unsubscribe,\n    };\n  };\n\n  /**\n   * Similar to create() except it will always display the device permission (even if some devices are already accepted).\n   */\n  static async request() {\n    const device = await requestLedgerDevice();\n    return TransportWebUSB.open(device);\n  }\n\n  /**\n   * Similar to create() except it will never display the device permission (it returns a Promise<?Transport>, null if it fails to find a device).\n   */\n  static async openConnected() {\n    const devices = await getLedgerDevices();\n    if (devices.length === 0) return null;\n    return TransportWebUSB.open(devices[0]);\n  }\n\n  /**\n   * Create a Ledger transport with a USBDevice\n   */\n  static async open(device: USBDevice) {\n    await device.open();\n\n    if (device.configuration === null) {\n      await device.selectConfiguration(configurationValue);\n    }\n\n    await gracefullyResetDevice(device);\n    const iface = device.configurations[0].interfaces.find(({ alternates }) =>\n      alternates.some(a => a.interfaceClass === 255),\n    );\n\n    if (!iface) {\n      throw new TransportInterfaceNotAvailable(\n        \"No WebUSB interface found for your Ledger device. Please upgrade firmware or contact techsupport.\",\n      );\n    }\n\n    const interfaceNumber = iface.interfaceNumber;\n\n    try {\n      await device.claimInterface(interfaceNumber);\n    } catch (e: any) {\n      await device.close();\n      throw new TransportInterfaceNotAvailable(e.message);\n    }\n\n    const transport = new TransportWebUSB(device, interfaceNumber);\n\n    const onDisconnect = e => {\n      if (device === e.device) {\n        // $FlowFixMe\n        navigator.usb.removeEventListener(\"disconnect\", onDisconnect);\n\n        transport._emitDisconnect(new DisconnectedDevice());\n      }\n    };\n\n    // $FlowFixMe\n    navigator.usb.addEventListener(\"disconnect\", onDisconnect);\n    return transport;\n  }\n\n  _disconnectEmitted = false;\n  _emitDisconnect = (e: Error) => {\n    if (this._disconnectEmitted) return;\n    this._disconnectEmitted = true;\n    this.emit(\"disconnect\", e);\n  };\n\n  /**\n   * Release the transport device\n   */\n  async close(): Promise<void> {\n    await this.exchangeBusyPromise;\n    await this.device.releaseInterface(this.interfaceNumber);\n    await gracefullyResetDevice(this.device);\n    await this.device.close();\n  }\n\n  /**\n   * Exchange with the device using APDU protocol.\n   * @param apdu\n   * @returns a promise of apdu response\n   */\n  async exchange(apdu: Buffer): Promise<Buffer> {\n    const b = await this.exchangeAtomicImpl(async () => {\n      const { channel, packetSize } = this;\n      log(\"apdu\", \"=> \" + apdu.toString(\"hex\"));\n      const framing = hidFraming(channel, packetSize);\n      // Write...\n      const blocks = framing.makeBlocks(apdu);\n\n      for (let i = 0; i < blocks.length; i++) {\n        await this.device.transferOut(endpointNumber, blocks[i]);\n      }\n\n      // Read...\n      let result;\n      let acc;\n\n      while (!(result = framing.getReducedResult(acc))) {\n        const r = await this.device.transferIn(endpointNumber, packetSize);\n        // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        // @ts-ignore\n        const buffer = Buffer.from(r.data.buffer);\n        acc = framing.reduceResponse(acc, buffer);\n      }\n\n      log(\"apdu\", \"<= \" + result.toString(\"hex\"));\n      return result;\n    }).catch(e => {\n      if (e && e.message && e.message.includes(\"disconnected\")) {\n        this._emitDisconnect(e);\n\n        throw new DisconnectedDeviceDuringOperation(e.message);\n      }\n\n      throw e;\n    });\n\n    return b as Buffer;\n  }\n\n  setScrambleKey() {}\n}\n\nasync function gracefullyResetDevice(device: USBDevice) {\n  try {\n    await device.reset();\n  } catch (err) {\n    console.warn(err);\n  }\n}\n", "import Transport from \"@ledgerhq/hw-transport\";\nimport type { Observer, DescriptorEvent, Subscription } from \"@ledgerhq/hw-transport\";\nimport hidFraming from \"@ledgerhq/devices/hid-framing\";\nimport { identifyUSBProductId, ledgerUSBVendorId } from \"@ledgerhq/devices\";\nimport type { DeviceModel } from \"@ledgerhq/devices\";\nimport { log } from \"@ledgerhq/logs\";\nimport {\n  TransportOpenUserCancelled,\n  DisconnectedDeviceDuringOperation,\n  DisconnectedDevice,\n  TransportError,\n} from \"@ledgerhq/errors\";\n\nconst ledgerDevices = [\n  {\n    vendorId: ledgerUSBVendorId,\n  },\n];\n\nconst isSupported = () => Promise.resolve(!!(window.navigator && window.navigator.hid));\n\nconst getHID = (): HID => {\n  // $FlowFixMe\n  const { hid } = navigator;\n  if (!hid) throw new TransportError(\"navigator.hid is not supported\", \"HIDNotSupported\");\n  return hid;\n};\n\nasync function requestLedgerDevices(): Promise<HIDDevice[]> {\n  const device = await getHID().requestDevice({\n    filters: ledgerDevices,\n  });\n  if (Array.isArray(device)) return device;\n  return [device];\n}\n\nasync function getLedgerDevices(): Promise<HIDDevice[]> {\n  const devices = await getHID().getDevices();\n  return devices.filter(d => d.vendorId === ledgerUSBVendorId);\n}\n\nasync function getFirstLedgerDevice(): Promise<HIDDevice> {\n  const existingDevices = await getLedgerDevices();\n  if (existingDevices.length > 0) return existingDevices[0];\n  const devices = await requestLedgerDevices();\n  return devices[0];\n}\n/**\n * WebHID Transport implementation\n * @example\n * import TransportWebHID from \"@ledgerhq/hw-transport-webhid\";\n * ...\n * TransportWebHID.create().then(transport => ...)\n */\n\nexport default class TransportWebHID extends Transport {\n  device: HIDDevice;\n  deviceModel: DeviceModel | null | undefined;\n  channel = Math.floor(Math.random() * 0xffff);\n  packetSize = 64;\n\n  constructor(device: HIDDevice) {\n    super();\n    this.device = device;\n    this.deviceModel =\n      typeof device.productId === \"number\" ? identifyUSBProductId(device.productId) : undefined;\n    device.addEventListener(\"inputreport\", this.onInputReport);\n  }\n\n  inputs: Buffer[] = [];\n  inputCallback: ((arg0: Buffer) => void) | null | undefined;\n  read = (): Promise<Buffer> => {\n    if (this.inputs.length) {\n      return Promise.resolve(this.inputs.shift() as unknown as Buffer);\n    }\n\n    return new Promise(success => {\n      this.inputCallback = success;\n    });\n  };\n  onInputReport = (e: HIDInputReportEvent) => {\n    const buffer = Buffer.from(e.data.buffer);\n\n    if (this.inputCallback) {\n      this.inputCallback(buffer);\n      this.inputCallback = null;\n    } else {\n      this.inputs.push(buffer);\n    }\n  };\n\n  /**\n   * Check if WebUSB transport is supported.\n   */\n  static isSupported = isSupported;\n\n  /**\n   * List the WebUSB devices that was previously authorized by the user.\n   */\n  static list = getLedgerDevices;\n\n  /**\n   * Actively listen to WebUSB devices and emit ONE device\n   * that was either accepted before, if not it will trigger the native permission UI.\n   *\n   * Important: it must be called in the context of a UI click!\n   */\n  static listen = (observer: Observer<DescriptorEvent<HIDDevice>>): Subscription => {\n    let unsubscribed = false;\n    getFirstLedgerDevice().then(\n      device => {\n        if (!device) {\n          observer.error(new TransportOpenUserCancelled(\"Access denied to use Ledger device\"));\n        } else if (!unsubscribed) {\n          const deviceModel =\n            typeof device.productId === \"number\"\n              ? identifyUSBProductId(device.productId)\n              : undefined;\n          observer.next({\n            type: \"add\",\n            descriptor: device,\n            deviceModel,\n          });\n          observer.complete();\n        }\n      },\n      error => {\n        observer.error(new TransportOpenUserCancelled(error.message));\n      },\n    );\n\n    function unsubscribe() {\n      unsubscribed = true;\n    }\n\n    return {\n      unsubscribe,\n    };\n  };\n\n  /**\n   * Similar to create() except it will always display the device permission (even if some devices are already accepted).\n   */\n  static async request() {\n    const [device] = await requestLedgerDevices();\n    return TransportWebHID.open(device);\n  }\n\n  /**\n   * Similar to create() except it will never display the device permission (it returns a Promise<?Transport>, null if it fails to find a device).\n   */\n  static async openConnected() {\n    const devices = await getLedgerDevices();\n    if (devices.length === 0) return null;\n    return TransportWebHID.open(devices[0]);\n  }\n\n  /**\n   * Create a Ledger transport with a HIDDevice\n   */\n  static async open(device: HIDDevice) {\n    await device.open();\n    const transport = new TransportWebHID(device);\n\n    const onDisconnect = e => {\n      if (device === e.device) {\n        getHID().removeEventListener(\"disconnect\", onDisconnect);\n\n        transport._emitDisconnect(new DisconnectedDevice());\n      }\n    };\n\n    getHID().addEventListener(\"disconnect\", onDisconnect);\n    return transport;\n  }\n\n  _disconnectEmitted = false;\n  _emitDisconnect = (e: Error) => {\n    if (this._disconnectEmitted) return;\n    this._disconnectEmitted = true;\n    this.emit(\"disconnect\", e);\n  };\n\n  /**\n   * Release the transport device\n   */\n  async close(): Promise<void> {\n    await this.exchangeBusyPromise;\n    this.device.removeEventListener(\"inputreport\", this.onInputReport);\n    await this.device.close();\n  }\n\n  /**\n   * Exchange with the device using APDU protocol.\n   * @param apdu\n   * @returns a promise of apdu response\n   */\n  exchange = async (apdu: Buffer): Promise<Buffer> => {\n    const b = await this.exchangeAtomicImpl(async () => {\n      const { channel, packetSize } = this;\n      log(\"apdu\", \"=> \" + apdu.toString(\"hex\"));\n      const framing = hidFraming(channel, packetSize);\n      // Write...\n      const blocks = framing.makeBlocks(apdu);\n\n      for (let i = 0; i < blocks.length; i++) {\n        await this.device.sendReport(0, blocks[i]);\n      }\n\n      // Read...\n      let result;\n      let acc;\n\n      while (!(result = framing.getReducedResult(acc))) {\n        const buffer = await this.read();\n        acc = framing.reduceResponse(acc, buffer);\n      }\n\n      log(\"apdu\", \"<= \" + result.toString(\"hex\"));\n      return result;\n    }).catch(e => {\n      if (e && e.message && e.message.includes(\"write\")) {\n        this._emitDisconnect(e);\n\n        throw new DisconnectedDeviceDuringOperation(e.message);\n      }\n\n      throw e;\n    });\n    return b as Buffer;\n  };\n\n  setScrambleKey() {}\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { default as TransportBLE } from '@ledgerhq/hw-transport-web-ble';\nimport { default as TransportUSB } from '@ledgerhq/hw-transport-webusb';\nimport { default as TransportHID } from '@ledgerhq/hw-transport-webhid';\nimport { BIP44_COIN_NANO, BIP44_PURPOSE, HARDENED_OFFSET, LEDGER_STATUS_CODES } from './constants.js';\nimport { bytes, dec, hex, utf8 } from './convert.js';\nimport { Rpc } from './rpc.js';\nimport { ChangeBlock, ReceiveBlock, SendBlock } from './block.js';\nexport class Ledger {\n    static #isInternal = false;\n    #status = 'DISCONNECTED';\n    get status() { return this.#status; }\n    openTimeout = 3000;\n    listenTimeout = 30000;\n    transport = null;\n    DynamicTransport = TransportHID;\n    constructor() {\n        if (!Ledger.#isInternal) {\n            throw new Error('Ledger cannot be instantiated directly. Use Ledger.init()');\n        }\n        Ledger.#isInternal = false;\n    }\n    static async init() {\n        Ledger.#isInternal = true;\n        const self = new this();\n        await self.checkBrowserSupport();\n        await self.listen();\n        return self;\n    }\n    /**\n    * Check which transport protocols are supported by the browser and set the\n    * transport type according to the following priorities: Bluetooth, USB, HID.\n    */\n    async checkBrowserSupport() {\n        console.log('Checking browser Ledger support...');\n        const supports = {\n            ble: await TransportBLE.isSupported(),\n            usb: await TransportUSB.isSupported(),\n            hid: await TransportHID.isSupported()\n        };\n        console.log(`ble: ${supports.ble}; usb: ${supports.usb}; hid: ${supports.hid}`);\n        if (supports.ble) {\n            this.DynamicTransport = TransportBLE;\n        }\n        else if (supports.usb) {\n            this.DynamicTransport = TransportUSB;\n        }\n        else if (supports.hid) {\n            this.DynamicTransport = TransportHID;\n        }\n        else {\n            throw new Error('Unsupported browser');\n        }\n    }\n    async listen() {\n        const { usb } = globalThis.navigator;\n        if (usb) {\n            usb.addEventListener('connect', console.log.bind(console));\n            usb.addEventListener('disconnect', console.log.bind(console));\n        }\n    }\n    async connect() {\n        const { usb } = globalThis.navigator;\n        if (usb) {\n            usb.removeEventListener('disconnect', this.onDisconnectUsb.bind(this));\n            usb.addEventListener('disconnect', this.onDisconnectUsb.bind(this));\n        }\n        const version = await this.version();\n        if (version.status === 'OK') {\n            if (version.name === 'Nano') {\n                const account = await this.account();\n                if (account.status === 'OK') {\n                    this.#status = 'CONNECTED';\n                }\n                else if (account.status === 'SECURITY_STATUS_NOT_SATISFIED') {\n                    this.#status = 'LOCKED';\n                }\n                else {\n                    this.#status = 'DISCONNECTED';\n                }\n            }\n            else if (version.name === 'BOLOS') {\n                const open = await this.open();\n                this.#status = (open.status === 'OK')\n                    ? 'CONNECTED'\n                    : 'DISCONNECTED';\n            }\n            else {\n                this.#status = 'BUSY';\n            }\n        }\n        else {\n            this.#status = 'DISCONNECTED';\n        }\n        return this.status;\n    }\n    async onDisconnectUsb(e) {\n        if (e.device?.manufacturerName === 'Ledger') {\n            const { usb } = globalThis.navigator;\n            usb.removeEventListener('disconnect', this.onDisconnectUsb);\n            this.#status = 'DISCONNECTED';\n        }\n    }\n    /**\n    * Open Nano app by launching user flow.\n    *\n    * https://developers.ledger.com/docs/connectivity/ledgerJS/open-close-info-on-apps#open-application\n    *\n    * This command resets the internal USB connection of the device which can\n    * cause subsequent commands to fail if called too quickly. A one-second delay\n    * is implemented in this method to mitigate the issue.\n    *\n    * https://github.com/LedgerHQ/ledger-live/issues/4964#issuecomment-1878361157\n    *\n    * @returns Status of command\n    */\n    async open() {\n        const name = new TextEncoder().encode('Nano');\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        const response = await transport.send(0xe0, 0xd8, 0x00, 0x00, name)\n            .then(res => bytes.toDec(res))\n            .catch(err => err.statusCode);\n        return new Promise(resolve => setTimeout(resolve, 1000, { status: LEDGER_STATUS_CODES[response] }));\n    }\n    /**\n    * Close the currently running app.\n    *\n    * https://developers.ledger.com/docs/connectivity/ledgerJS/open-close-info-on-apps#quit-application\n    *\n    * This command resets the internal USB connection of the device which can\n    * cause subsequent commands to fail if called too quickly. A one-second delay\n    * is implemented in this method to mitigate the issue.\n    *\n    * https://github.com/LedgerHQ/ledger-live/issues/4964#issuecomment-1878361157\n    *\n    * @returns Status of command\n    */\n    async close() {\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        const response = await transport.send(0xb0, 0xa7, 0x00, 0x00)\n            .then(res => bytes.toDec(res))\n            .catch(err => err.statusCode);\n        return new Promise(resolve => setTimeout(resolve, 1000, { status: LEDGER_STATUS_CODES[response] }));\n    }\n    /**\n    * Get the version of the current process. If a specific app is running, get\n    * the app version. Otherwise, get the Ledger BOLOS version instead.\n    *\n    * https://developers.ledger.com/docs/connectivity/ledgerJS/open-close-info-on-apps#get-information\n    *\n    * @returns Status, process name, and version\n    */\n    async version() {\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        const response = await transport.send(0xb0, 0x01, 0x00, 0x00)\n            .catch(err => dec.toBytes(err.statusCode));\n        await transport.close();\n        if (response.length === 2) {\n            const statusCode = bytes.toDec(response);\n            const status = LEDGER_STATUS_CODES[statusCode] ?? 'UNKNOWN_ERROR';\n            return { status, name: null, version: null };\n        }\n        const nameLength = response[1];\n        const name = response.slice(2, 2 + nameLength).toString();\n        const versionLength = response[2 + nameLength];\n        const version = response.slice(2 + nameLength + 1, 2 + nameLength + 1 + versionLength).toString();\n        const statusCode = bytes.toDec(response.slice(-2));\n        const status = LEDGER_STATUS_CODES[statusCode];\n        return { status, name, version };\n    }\n    /**\n    * Get an account at a specific BIP-44 index.\n    *\n    * @returns Response object containing command status, public key, and address\n    */\n    async account(index = 0, show = false) {\n        if (typeof index !== 'number' || index < 0 || index >= HARDENED_OFFSET) {\n            throw new TypeError('Invalid account index');\n        }\n        const purpose = dec.toBytes(BIP44_PURPOSE + HARDENED_OFFSET, 4);\n        const coin = dec.toBytes(BIP44_COIN_NANO + HARDENED_OFFSET, 4);\n        const account = dec.toBytes(index + HARDENED_OFFSET, 4);\n        const data = new Uint8Array([0x03, ...purpose, ...coin, ...account]);\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        const response = await transport.send(0xa1, 0x02, show ? 0x01 : 0x00, 0x00, data)\n            .catch(err => dec.toBytes(err.statusCode));\n        await transport.close();\n        if (response.length === 2) {\n            const statusCode = bytes.toDec(response);\n            const status = LEDGER_STATUS_CODES[statusCode] ?? 'UNKNOWN_ERROR';\n            return { status, publicKey: null, address: null };\n        }\n        try {\n            const publicKey = bytes.toHex(response.slice(0, 32));\n            const addressLength = response[32];\n            const address = response.slice(33, 33 + addressLength).toString();\n            const statusCode = bytes.toDec(response.slice(33 + addressLength));\n            const status = LEDGER_STATUS_CODES[statusCode];\n            return { status, publicKey, address };\n        }\n        catch (err) {\n            return { status: 'ERROR_PARSING_ACCOUNT', publicKey: null, address: null };\n        }\n    }\n    /**\n    * Cache frontier block in device memory.\n    *\n    * @param {number} index - Account number\n    * @param {any} block - Block data to cache\n    * @returns Status of command\n    */\n    async cacheBlock(index = 0, block) {\n        if (typeof index !== 'number' || index < 0 || index >= HARDENED_OFFSET) {\n            throw new TypeError('Invalid account index');\n        }\n        if (!(block instanceof SendBlock) && !(block instanceof ReceiveBlock) && !(block instanceof ChangeBlock)) {\n            throw new TypeError('Invalid block format');\n        }\n        if (!block.signature) {\n            throw new ReferenceError('Cannot cache unsigned block');\n        }\n        const purpose = dec.toBytes(BIP44_PURPOSE + HARDENED_OFFSET, 4);\n        const coin = dec.toBytes(BIP44_COIN_NANO + HARDENED_OFFSET, 4);\n        const account = dec.toBytes(index + HARDENED_OFFSET, 4);\n        const previous = hex.toBytes(block.previous);\n        const link = hex.toBytes(block.link);\n        const representative = hex.toBytes(block.representative.publicKey);\n        const balance = hex.toBytes(BigInt(block.balance).toString(16), 16);\n        const signature = hex.toBytes(block.signature);\n        const data = new Uint8Array([0x03, ...purpose, ...coin, ...account, ...previous, ...link, ...representative, ...balance, ...signature]);\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        const response = await transport.send(0xa1, 0x03, 0x00, 0x00, data)\n            .then(res => bytes.toDec(res))\n            .catch(err => err.statusCode);\n        await transport.close();\n        return { status: LEDGER_STATUS_CODES[response] };\n    }\n    async sign(index = 0, input) {\n        if (typeof index !== 'number' || index < 0 || index >= HARDENED_OFFSET) {\n            throw new TypeError('Invalid account index');\n        }\n        const purpose = dec.toBytes(BIP44_PURPOSE + HARDENED_OFFSET, 4);\n        const coin = dec.toBytes(BIP44_COIN_NANO + HARDENED_OFFSET, 4);\n        const account = dec.toBytes(index + HARDENED_OFFSET, 4);\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        if (typeof input === 'string') {\n            // input is a nonce\n            const nonce = utf8.toBytes(input);\n            if (nonce.length !== 16) {\n                throw new RangeError('Nonce must be 16-byte string');\n            }\n            const data = new Uint8Array([0x03, ...purpose, ...coin, ...account, ...nonce]);\n            const response = await transport.send(0xa1, 0x05, 0x00, 0x00, data)\n                .catch(err => dec.toBytes(err.statusCode));\n            await transport.close();\n            if (response.length === 2) {\n                const statusCode = bytes.toDec(response);\n                const status = LEDGER_STATUS_CODES[statusCode] ?? 'UNKNOWN_ERROR';\n                return { status, signature: null };\n            }\n            const signature = bytes.toHex(response.slice(0, 64));\n            const statusCode = bytes.toDec(response.slice(-2));\n            const status = LEDGER_STATUS_CODES[statusCode];\n            return { status, signature };\n        }\n        else {\n            // input is a block\n            const previous = hex.toBytes(input.previous);\n            const link = hex.toBytes(input.link);\n            const representative = hex.toBytes(input.representative.publicKey);\n            const balance = hex.toBytes(BigInt(input.balance).toString(16), 16);\n            const data = new Uint8Array([0x03, ...purpose, ...coin, ...account, ...previous, ...link, ...representative, ...balance]);\n            const response = await transport.send(0xa1, 0x04, 0x00, 0x00, data)\n                .catch(err => dec.toBytes(err.statusCode));\n            await transport.close();\n            if (response.length === 2) {\n                const statusCode = bytes.toDec(response);\n                const status = LEDGER_STATUS_CODES[statusCode] ?? 'UNKNOWN_ERROR';\n                return { status, signature: null, hash: null };\n            }\n            const hash = bytes.toHex(response.slice(0, 32));\n            const signature = bytes.toHex(response.slice(32, 96));\n            const statusCode = bytes.toDec(response.slice(-2));\n            const status = LEDGER_STATUS_CODES[statusCode];\n            return { status, signature, hash };\n        }\n    }\n    async updateCache(index, input, node) {\n        if (typeof input === 'string' && node?.constructor === Rpc) {\n            const data = {\n                'json_block': 'true',\n                'hash': input\n            };\n            const res = await node.call('block_info', data);\n            if (!res || res.ok === false) {\n                throw new Error(`Unable to fetch block info`, res);\n            }\n            input = res.contents;\n        }\n        return this.cacheBlock(index, input);\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { BURN_ADDRESS, PREAMBLE, THRESHOLD_RECEIVE, THRESHOLD_SEND } from './constants.js';\nimport { Account } from './account.js';\nimport { Blake2b } from './blake2b.js';\nimport { dec, hex } from './convert.js';\nimport { NanoNaCl } from './workers/nano-nacl.js';\nimport { Pool } from './pool.js';\nimport { Pow } from './workers.js';\n/**\n* Represents a block as defined by the Nano cryptocurrency protocol. The Block\n* class is abstract and cannot be directly instantiated. Every block must be one\n* of three derived classes: SendBlock, ReceiveBlock, ChangeBlock.\n*/\nclass Block {\n    static #pool = new Pool(Pow);\n    account;\n    type = 'state';\n    constructor(account) {\n        if (this.constructor === Block) {\n            throw new Error('Block is an abstract class and cannot be instantiated directly.');\n        }\n        if (account.constructor === Account) {\n            this.account = account;\n        }\n        else if (typeof account === 'string') {\n            this.account = Account.fromAddress(account);\n        }\n        else {\n            throw new TypeError('Invalid account');\n        }\n    }\n    /**\n    * Converts the block to JSON format as expected by the `process` RPC.\n    *\n    * @returns {string} JSON representation of the block\n    */\n    json() {\n        return {\n            \"type\": this.type,\n            \"account\": this.account.address,\n            \"previous\": this.previous,\n            \"representative\": this.representative.address,\n            \"balance\": this.balance.toString(),\n            \"link\": this.link,\n            \"signature\": this.signature ?? '',\n            \"work\": this.work ?? ''\n        };\n    }\n    /**\n    * Hashes the block using Blake2b.\n    *\n    * @returns {Promise<string>} Block data hashed to a byte array\n    */\n    async hash() {\n        const data = [\n            PREAMBLE,\n            this.account.publicKey,\n            this.previous,\n            this.representative.publicKey,\n            dec.toHex(this.balance, 32),\n            this.link\n        ];\n        const hash = new Blake2b(32);\n        data.forEach(str => hash.update(hex.toBytes(str)));\n        return hash.digest('hex').toUpperCase();\n    }\n    /**\n    * Calculates proof-of-work using a pool of WebGL workers.\n    *\n    * A successful response sets the `work` property.\n    */\n    async pow() {\n        const data = {\n            \"hash\": this.previous,\n            \"threshold\": (this instanceof SendBlock || this instanceof ChangeBlock)\n                ? THRESHOLD_SEND\n                : THRESHOLD_RECEIVE\n        };\n        const [{ work }] = await Block.#pool.assign([data]);\n        this.work = work;\n    }\n    async sign(input, block) {\n        if (typeof input === 'number') {\n            const index = input;\n            const { Ledger } = await import('./ledger.js');\n            const ledger = await Ledger.init();\n            await ledger.open();\n            if (block) {\n                try {\n                    await ledger.updateCache(index, block);\n                }\n                catch (err) {\n                    console.warn('Error updating Ledger cache of previous block, attempting signature anyway', err);\n                }\n            }\n            const result = await ledger.sign(index, this);\n            if (result.status !== 'OK') {\n                throw new Error(result.status);\n            }\n            this.signature = result.signature;\n        }\n        else {\n            const key = input ?? this.account.privateKey;\n            if (key == null) {\n                throw new Error('No valid key found to sign block');\n            }\n            const account = await Account.fromPrivateKey(key);\n            try {\n                const signature = NanoNaCl.detached(hex.toBytes(await this.hash()), hex.toBytes(`${account.privateKey}`));\n                this.signature = signature;\n            }\n            catch (err) {\n                throw new Error(`Failed to sign block with key ${key}: ${err}`);\n            }\n        }\n    }\n    /**\n    * Sends the block to a node for processing on the network.\n    *\n    * The block must already be signed (see `sign()` for more information).\n    * The block must also have a `work` value.\n    *\n    * @param {Rpc|string|URL} rpc - RPC node information required to call `process`\n    * @returns {Promise<string>} Hash of the processed block\n    */\n    async process(rpc) {\n        if (!this.signature) {\n            throw new Error('Block is missing signature. Use sign() and try again.');\n        }\n        if (!this.work == null) {\n            throw new Error('Block is missing proof-of-work. Generate PoW and try again.');\n        }\n        const data = {\n            \"subtype\": this.subtype,\n            \"json_block\": \"true\",\n            \"block\": this.json()\n        };\n        const res = await rpc.call('process', data);\n        if (res.hash == null) {\n            throw new Error('Block could not be processed', res);\n        }\n        return res.hash;\n    }\n    /**\n    * Verifies the signature of the block. If a key is not provided, the public\n    * key of the block's account will be used if it exists.\n    *\n    * @param {string} [key] - Hexadecimal-formatted public key to use for verification\n    * @returns {boolean} True if block was signed by the matching private key\n    */\n    async verify(key) {\n        key ??= this.account.publicKey;\n        if (!key) {\n            throw new Error('Provide a key for block signature verification.');\n        }\n        const data = [\n            PREAMBLE,\n            this.account.publicKey,\n            this.previous,\n            this.representative.publicKey,\n            dec.toHex(this.balance, 32),\n            this.link\n        ];\n        const hash = new Blake2b(32);\n        data.forEach(str => hash.update(hex.toBytes(str)));\n        const blockHash = hash.digest('hex').toUpperCase();\n        return NanoNaCl.verify(hex.toBytes(blockHash), hex.toBytes(this.signature ?? ''), hex.toBytes(key));\n    }\n}\n/**\n* Represents a block that sends funds from one address to another as defined by\n* the Nano cryptocurrency protocol.\n*/\nexport class SendBlock extends Block {\n    type = 'state';\n    subtype = 'send';\n    previous;\n    representative;\n    balance;\n    link;\n    signature;\n    work;\n    constructor(sender, balance, recipient, amount, representative, frontier, work) {\n        super(sender);\n        this.previous = frontier;\n        this.representative = Account.fromAddress(representative);\n        this.link = Account.fromAddress(recipient).publicKey;\n        this.work = work ?? '';\n        const bigBalance = BigInt(balance);\n        const bigAmount = BigInt(amount);\n        this.balance = bigBalance - bigAmount;\n        validate(this);\n    }\n}\n/**\n* Represents a block that receives funds sent to one address from another as\n* defined by the Nano cryptocurrency protocol.\n*/\nexport class ReceiveBlock extends Block {\n    type = 'state';\n    subtype = 'receive';\n    previous;\n    representative;\n    balance;\n    link;\n    signature;\n    work;\n    constructor(recipient, balance, origin, amount, representative, frontier, work) {\n        super(recipient);\n        this.previous = frontier ?? Account.fromAddress(recipient).publicKey;\n        this.representative = Account.fromAddress(representative);\n        this.link = origin;\n        this.work = work ?? '';\n        const bigBalance = BigInt(balance);\n        const bigAmount = BigInt(amount);\n        this.balance = bigBalance + bigAmount;\n        validate(this);\n    }\n}\n/**\n* Represents a block that changes the representative account to which the user\n* account delegates their vote weight using the the Open Representative Voting\n* specification as defined by the Nano cryptocurrency protocol.\n*/\nexport class ChangeBlock extends Block {\n    type = 'state';\n    subtype = 'change';\n    previous;\n    representative;\n    balance;\n    link = Account.fromAddress(BURN_ADDRESS).publicKey;\n    signature;\n    work;\n    constructor(account, balance, representative, frontier, work) {\n        super(account);\n        this.previous = frontier;\n        this.representative = Account.fromAddress(representative);\n        this.balance = BigInt(balance);\n        this.work = work ?? '';\n        validate(this);\n    }\n}\n/**\n * Validates block data.\n *\n * @param {Block} block - SendBlock, ReceiveBlock, or ChangeBlock to validate\n */\nfunction validate(block) {\n    if (block.account == null) {\n        throw new Error('Account missing');\n    }\n    if (block.previous == null || block.previous === '') {\n        throw new Error('Frontier missing');\n    }\n    if (block.representative == null) {\n        throw new Error('Representative missing');\n    }\n    if (block.balance == null) {\n        throw new Error('Balance missing');\n    }\n    if (block.balance < 0) {\n        throw new Error('Negative balance');\n    }\n    switch (block.constructor) {\n        case SendBlock: {\n            if (block.link == null || block.link === '') {\n                throw new Error('Recipient missing');\n            }\n            break;\n        }\n        case ReceiveBlock: {\n            if (block.link == null) {\n                throw new Error('Origin send block hash missing');\n            }\n            break;\n        }\n        case ChangeBlock: {\n            if (block.link == null) {\n                throw new Error('Change block link missing');\n            }\n            if (+block.link !== 0) {\n                throw new Error('Invalid change block link');\n            }\n            break;\n        }\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Account } from './account.js';\nimport { Blake2b } from './blake2b.js';\nimport { UNITS } from './constants.js';\nimport { hex } from './convert.js';\nimport { Rpc } from './rpc.js';\nimport { SendBlock } from './block.js';\nimport { NanoNaCl } from './workers/nano-nacl.js';\nfunction hash(data, encoding) {\n    if (!Array.isArray(data))\n        data = [data];\n    const hash = new Blake2b(32);\n    if (encoding === 'hex') {\n        data.forEach(str => hash.update(hex.toBytes(str)));\n    }\n    else {\n        const enc = new TextEncoder();\n        data.forEach(str => hash.update(enc.encode(str)));\n    }\n    return hash.digest('hex').toUpperCase();\n}\n/**\n* Converts a decimal amount of nano from one unit divider to another.\n*\n* @param {bigint|string} amount - Decimal amount to convert\n* @param {string} inputUnit - Current denomination\n* @param {string} outputUnit - Desired denomination\n*/\nexport async function convert(amount, inputUnit, outputUnit) {\n    if (typeof amount === 'bigint') {\n        amount = amount.toString();\n    }\n    if (typeof amount !== 'string' || amount === '' || !/^[0-9]*\\.?[0-9]*$/.test(amount)) {\n        throw new Error('Invalid amount');\n    }\n    let [i = '', f = ''] = amount.toString().split('.');\n    i = i.replace(/^0*/g, '');\n    f = f.replace(/0*$/g, '');\n    inputUnit = inputUnit.toUpperCase();\n    outputUnit = outputUnit.toUpperCase();\n    if (!(inputUnit in UNITS)) {\n        throw new Error(`Unknown denomination ${inputUnit}, expected one of the following: ${Object.keys(UNITS)}`);\n    }\n    if (!(outputUnit in UNITS)) {\n        throw new Error(`Unknown denomination ${outputUnit}, expected one of the following: ${Object.keys(UNITS)}`);\n    }\n    // convert to raw\n    i = `${i}${f.slice(0, UNITS[inputUnit])}`.padEnd(i.length + UNITS[inputUnit], '0');\n    f = f.slice(UNITS[inputUnit]);\n    if (i.length > 39) {\n        throw new Error('Amount exceeds Nano limits');\n    }\n    if (i.length < 1) {\n        throw new Error('Amount must be at least 1 raw');\n    }\n    if (f.length > 0) {\n        throw new Error('Amount contains fractional raw');\n    }\n    // convert to desired denomination\n    if (UNITS[outputUnit] !== 0) {\n        f = i.padStart(40, '0').slice(-UNITS[outputUnit]) + f;\n        i = i.slice(0, -UNITS[outputUnit]);\n    }\n    i = i.replace(/^0*/g, '') ?? '0';\n    f = f.replace(/0*$/g, '');\n    return `${i}${f ? '.' : ''}${f}`;\n}\n/**\n* Signs arbitrary strings with a private key using the Ed25519 signature scheme.\n*\n* @param {string} key - Hexadecimal-formatted private key to use for signing\n* @param {...string} input - Data to be signed\n* @returns {Promise<string>} Hexadecimal-formatted signature\n*/\nexport async function sign(key, ...input) {\n    const account = await Account.fromPrivateKey(key);\n    const data = hash(input);\n    const signature = NanoNaCl.detached(hex.toBytes(data), hex.toBytes(`${account.privateKey}`));\n    return signature;\n}\n/**\n* Collects the funds from a specified range of accounts in a wallet and sends\n* them all to a single recipient address. Hardware wallets are unsupported.\n*\n* @param {Rpc|string|URL} rpc - RPC node information required to refresh accounts, calculate PoW, and process blocks\n* @param {Blake2bWallet|Bip44Wallet|LedgerWallet} wallet - Wallet from which to sweep funds\n* @param {string} recipient - Destination address for all swept funds\n* @param {number} from - Starting account index to sweep\n* @param {number} to - Ending account index to sweep\n* @returns An array of results including both successes and failures\n */\nexport async function sweep(rpc, wallet, recipient, from = 0, to = from) {\n    if (rpc == null || wallet == null || recipient == null) {\n        throw new ReferenceError('Missing required sweep arguments');\n    }\n    if (typeof rpc === 'string' || rpc.constructor === URL) {\n        rpc = new Rpc(rpc);\n    }\n    if (rpc.constructor !== Rpc) {\n        throw new TypeError('RPC must be a valid node');\n    }\n    const blockQueue = [];\n    const results = [];\n    const recipientAccount = Account.fromAddress(recipient);\n    const accounts = await wallet.refresh(rpc, from, to);\n    for (const account of accounts) {\n        if (account.representative?.address && account.frontier) {\n            const block = new SendBlock(account, account.balance?.toString() ?? '0', recipientAccount.address, account.balance?.toString() ?? '0', account.representative.address, account.frontier);\n            const blockRequest = new Promise(async (resolve) => {\n                try {\n                    await block.pow();\n                    await block.sign();\n                    const hash = await block.process(rpc);\n                    results.push({ status: 'success', address: block.account.address, message: hash });\n                }\n                catch (err) {\n                    results.push({ status: 'error', address: block.account.address, message: err.message });\n                }\n                finally {\n                    resolve();\n                }\n            });\n            blockQueue.push(blockRequest);\n        }\n    }\n    await Promise.allSettled(blockQueue);\n    return results;\n}\n/**\n* Verifies the signature of arbitrary strings using a public key.\n*\n* @param {string} key - Hexadecimal-formatted public key to use for verification\n* @param {string} signature - Hexadcimal-formatted signature\n* @param {...string} input - Data to be verified\n* @returns {Promise<boolean>} True if the data was signed by the public key's matching private key\n*/\nexport async function verify(key, signature, ...input) {\n    const data = hash(input);\n    try {\n        return await NanoNaCl.verify(hex.toBytes(data), hex.toBytes(signature), hex.toBytes(key));\n    }\n    catch (err) {\n        console.error(err);\n        return false;\n    }\n}\nexport const Tools = { convert, sign, sweep, verify };\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Account } from './lib/account.js';\nimport { Blake2b } from './lib/blake2b.js';\nimport { SendBlock, ReceiveBlock, ChangeBlock } from './lib/block.js';\nimport { Pow } from './lib/workers/powgl.js';\nimport { Rpc } from './lib/rpc.js';\nimport { Rolodex } from './lib/rolodex.js';\nimport { Safe } from './lib/safe.js';\nimport { Tools } from './lib/tools.js';\nimport { Bip44Wallet, Blake2bWallet, LedgerWallet } from './lib/wallet.js';\nexport { Account, Blake2b, SendBlock, ReceiveBlock, ChangeBlock, Pow, Rpc, Rolodex, Safe, Tools, Bip44Wallet, Blake2bWallet, LedgerWallet };\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Account } from './account.js';\n/**\n* Represents a basic address book of Nano accounts. Multiple addresses can be\n* saved under one nickname.\n*/\nexport class Rolodex {\n    #entries = [];\n    /**\n    * Adds an address to the rolodex under a specific nickname.\n    *\n    * If the name exists, add the address as a new association to that name. If\n    * the account exists under a different name, update the name. If no matches\n    * are found at all, add a completely new entry.\n    *\n    * @param {string} name - Alias for the address\n    * @param {string} address - Nano account address\n    */\n    async add(name, address) {\n        if (name == null || name === '') {\n            throw new Error('Name is required for rolodex entries');\n        }\n        if (typeof name !== 'string') {\n            throw new Error('Name must be a string for rolodex entries');\n        }\n        if (address == null || address === '') {\n            throw new Error('Address is required for rolodex entries');\n        }\n        if (typeof address !== 'string') {\n            throw new Error('Address must be a string for rolodex entries');\n        }\n        name = name\n            .replaceAll('/', '\\\\u002f')\n            .replaceAll('<', '\\\\u003c')\n            .replaceAll('>', '\\\\u003d')\n            .replaceAll('\\\\', '\\\\u005c');\n        const account = Account.fromAddress(address);\n        const nameResult = this.#entries.find(e => e.name === name);\n        const accountResult = this.#entries.find(e => e.account.address === address);\n        if (!accountResult) {\n            this.#entries.push({ name, account });\n        }\n        else if (!nameResult) {\n            accountResult.name = name;\n        }\n    }\n    /**\n    * Gets the name associated with a specific Nano address from the rolodex.\n    *\n    * @param {string} address - Nano account address\n    * @returns {string|null} Name associated with the address, or null if not found\n    */\n    getName(address) {\n        const result = this.#entries.find(e => e.account.address === address);\n        return result?.name ?? null;\n    }\n    /**\n    * Gets all Nano addresses associated with a name from the rolodex.\n    *\n    * @param {string} name - Alias to look up\n    * @returns {string[]} List of Nano addresses associated with the name\n    */\n    getAddresses(name) {\n        const entries = this.#entries.filter(e => e.name === name);\n        return entries.map(a => a.account.address);\n    }\n    /**\n    * Gets all names stored in the rolodex.\n    *\n    * @returns {string[]} List of names stored in the rolodex\n    */\n    getAllNames() {\n        return this.#entries.map(e => e.name);\n    }\n    /**\n    * Verifies whether the public key of any Nano address saved under a specific\n    * name in the rolodex was used to sign a specific set of data.\n    *\n    * @param {string} name - Alias to look up\n    * @param {string} signature - Signature to use for verification\n    * @param {...string} data - Signed data to verify\n    * @returns {Promise<boolean>} True if the signature was used to sign the data, else false\n    */\n    async verify(name, signature, ...data) {\n        const { Tools } = await import('./tools.js');\n        const entries = this.#entries.filter(e => e.name === name);\n        for (const entry of entries) {\n            const key = entry.account.publicKey;\n            const verified = await Tools.verify(key, signature, ...data);\n            if (verified) {\n                return true;\n            }\n        }\n        return false;\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Account } from './account.js';\nimport { Blake2b } from './blake2b.js';\nimport { Bip39Mnemonic } from './bip39-mnemonic.js';\nimport { ADDRESS_GAP, SEED_LENGTH_BIP44, SEED_LENGTH_BLAKE2B } from './constants.js';\nimport { Entropy } from './entropy.js';\nimport { Pool } from './pool.js';\nimport { Rpc } from './rpc.js';\nimport { Safe } from './safe.js';\nimport { Bip44Ckd, NanoNaCl } from './workers.js';\n/**\n* Represents a wallet containing numerous Nano accounts derived from a single\n* source, the form of which can vary based on the type of wallet. The Wallet\n* class itself is abstract and cannot be directly instantiated. Currently, three\n* types of wallets are supported, each as a derived class: Bip44Wallet,\n* Blake2bWallet, LedgerWallet.\n*/\nclass Wallet {\n    #accounts;\n    #id;\n    #locked = true;\n    #mnemonic;\n    #poolNanoNacl;\n    #safe;\n    #seed;\n    get id() { return this.#id.hex; }\n    get isLocked() { return this.#locked; }\n    get isUnlocked() { return !this.#locked; }\n    get mnemonic() {\n        if (this.#mnemonic instanceof Bip39Mnemonic) {\n            return this.#mnemonic.phrase;\n        }\n        return '';\n    }\n    get seed() {\n        if (typeof this.#seed === 'string') {\n            return this.#seed;\n        }\n        return '';\n    }\n    constructor(id, seed, mnemonic) {\n        if (this.constructor === Wallet) {\n            throw new Error('Wallet is an abstract class and cannot be instantiated directly.');\n        }\n        this.#accounts = [];\n        this.#id = id;\n        this.#mnemonic = mnemonic ?? null;\n        this.#poolNanoNacl = new Pool(NanoNaCl);\n        this.#safe = new Safe();\n        this.#seed = seed ?? null;\n    }\n    /**\n    * Retrieves accounts from a wallet using its child key derivation function.\n    * Defaults to the first account at index 0.\n    *\n    * Note: The wallet index of a given requested account might not correlate with\n    * its index in the returned array.\n    *\n    * For example, calling `await wallet.accounts(5)` will return the sixth\n    * account of the wallet in the first array element position at index 0.\n    *\n    * A shorthand way of getting one specific account could be\n    * `const account = (await wallet.accounts(N))[0]` where N is the wallet index\n    * of the desired account.\n    *\n    * @param {number} from - Start index of secret keys. Default: 0\n    * @param {number} to - End index of secret keys. Default: `from`\n    */\n    async accounts(from = 0, to = from) {\n        if (from > to) {\n            const swap = from;\n            from = to;\n            to = swap;\n        }\n        const indexes = [];\n        for (let i = from; i <= to; i++) {\n            if (this.#accounts[i] == null) {\n                indexes.push(i);\n            }\n        }\n        if (indexes.length > 0) {\n            let results = await this.ckd(indexes);\n            const data = [];\n            results.forEach(r => data.push({ privateKey: r.privateKey, index: r.index }));\n            const keypairs = await this.#poolNanoNacl.assign(data);\n            for (const keypair of keypairs) {\n                if (keypair.privateKey == null)\n                    throw new RangeError('Account private key missing');\n                if (keypair.publicKey == null)\n                    throw new RangeError('Account public key missing');\n                if (keypair.index == null)\n                    throw new RangeError('Account keys derived but index missing');\n                const { privateKey, publicKey, index } = keypair;\n                this.#accounts[keypair.index] = Account.fromKeypair(privateKey, publicKey, index);\n            }\n        }\n        return this.#accounts.slice(from, to + 1);\n    }\n    /**\n    * Fetches the lowest-indexed unopened account from a wallet in sequential\n    * order. An account is unopened if it has no frontier block.\n    *\n    * @param {Rpc|string|URL} rpc - RPC node information required to refresh accounts, calculate PoW, and process blocks\n    * @param {number} batchSize - Number of accounts to fetch and check per RPC callout\n    * @param {number} from - Account index from which to start the search\n    * @returns {Promise<Account>} The lowest-indexed unopened account belonging to the wallet\n    */\n    async getNextNewAccount(rpc, batchSize = ADDRESS_GAP, from = 0) {\n        if (!Number.isSafeInteger(batchSize) || batchSize < 1) {\n            throw new RangeError(`Invalid batch size ${batchSize}`);\n        }\n        const accounts = await this.accounts(from, from + batchSize - 1);\n        const addresses = accounts.map(({ address }) => address);\n        const data = {\n            \"accounts\": addresses\n        };\n        const { errors } = await rpc.call('accounts_frontiers', data);\n        for (const key of Object.keys(errors ?? {})) {\n            const value = errors[key];\n            if (value === 'Account not found') {\n                return Account.fromAddress(key);\n            }\n        }\n        return await this.getNextNewAccount(rpc, batchSize, from + batchSize);\n    }\n    /**\n    * Refreshes wallet account balances, frontiers, and representatives from the\n    * current state on the network.\n    *\n    * A successful response will set these properties on each account.\n    *\n    * @param {Rpc|string|URL} rpc - RPC node information required to refresh accounts, calculate PoW, and process blocks\n    * @returns {Promise<Account[]>} Accounts with updated balances, frontiers, and representatives\n    */\n    async refresh(rpc, from = 0, to = from) {\n        if (typeof rpc === 'string' || rpc.constructor === URL) {\n            rpc = new Rpc(rpc);\n        }\n        if (rpc.constructor !== Rpc) {\n            throw new TypeError('RPC must be a valid node');\n        }\n        const accounts = await this.accounts(from, to);\n        for (let i = 0; i < accounts.length; i++) {\n            try {\n                await accounts[i].refresh(rpc);\n            }\n            catch (err) {\n                accounts.splice(i--, 1);\n            }\n        }\n        return accounts;\n    }\n    async lock(passkey) {\n        let success = true;\n        try {\n            const data = {\n                id: this.id,\n                mnemonic: null,\n                seed: null\n            };\n            if (this.#mnemonic instanceof Bip39Mnemonic) {\n                data.mnemonic = this.#mnemonic.phrase;\n            }\n            if (typeof this.#seed === 'string') {\n                data.seed = this.#seed;\n            }\n            success &&= await this.#safe.put(this.id, passkey, data);\n            await Promise.all(this.#accounts.map((a) => a.lock(passkey)));\n            if (!success) {\n                throw null;\n            }\n        }\n        catch (err) {\n            throw new Error('Failed to lock wallet');\n        }\n        this.#locked = true;\n        this.#mnemonic = null;\n        this.#seed = null;\n        return true;\n    }\n    async unlock(passkey) {\n        try {\n            const { id, mnemonic, seed } = await this.#safe.get(this.id, passkey);\n            if (id !== this.id) {\n                throw null;\n            }\n            await Promise.all(this.#accounts.map((a) => a.unlock(passkey)));\n            if (mnemonic != null) {\n                this.#mnemonic = await Bip39Mnemonic.fromPhrase(mnemonic);\n            }\n            if (seed != null) {\n                this.#seed = seed;\n            }\n            this.#locked = false;\n        }\n        catch (err) {\n            throw new Error('Failed to unlock wallet');\n        }\n        return true;\n    }\n}\n/**\n* Hierarchical deterministic (HD) wallet created by using a source of entropy to\n* derive a mnemonic phrase. The mnemonic phrase, in combination with an optional\n* salt, is used to generate a seed. A value can be provided as a parameter for\n* entropy, mnemonic + salt, or seed; if no argument is passed, a new entropy\n* value will be generated using a cryptographically strong pseudorandom number\n* generator.\n*\n* Importantly, the salt is not stored in the instantiated Wallet object. If a\n* salt is used, then losing it means losing the ability to regenerate the seed\n* from the mnemonic.\n*\n* Accounts are derived from the seed. Private keys are derived using a BIP-44\n* derivation path. The public key is derived from the private key using the\n* Ed25519 key algorithm. Account addresses are derived as described in the nano\n* documentation (https://docs.nano.org)\n*\n* A password must be provided when creating or importing the wallet and is used\n* to lock and unlock the wallet. The wallet will be initialized as locked. When\n* the wallet is unlocked, a new password can be specified using the lock()\n* method.\n*/\nexport class Bip44Wallet extends Wallet {\n    static #isInternal = false;\n    static #poolBip44Ckd = new Pool(Bip44Ckd);\n    constructor(id, seed, mnemonic) {\n        if (!Bip44Wallet.#isInternal) {\n            throw new Error(`Bip44Wallet cannot be instantiated directly. Use 'await Bip44Wallet.create()' instead.`);\n        }\n        Bip44Wallet.#isInternal = false;\n        super(id, seed, mnemonic);\n    }\n    static async create(passkey, salt = '') {\n        try {\n            const e = await Entropy.create();\n            return await Bip44Wallet.fromEntropy(passkey, e.hex, salt);\n        }\n        catch (err) {\n            throw new Error(`Error creating new Bip44Wallet: ${err}`);\n        }\n    }\n    static async fromEntropy(passkey, entropy, salt = '') {\n        try {\n            const id = await Entropy.create(16);\n            const e = await Entropy.import(entropy);\n            const m = await Bip39Mnemonic.fromEntropy(e.hex);\n            const s = await m.toBip39Seed(salt);\n            Bip44Wallet.#isInternal = true;\n            const wallet = new this(id, s, m);\n            await wallet.lock(passkey);\n            return wallet;\n        }\n        catch (err) {\n            throw new Error(`Error importing Bip44Wallet from entropy: ${err}`);\n        }\n    }\n    static async fromMnemonic(passkey, mnemonic, salt = '') {\n        try {\n            const id = await Entropy.create(16);\n            const m = await Bip39Mnemonic.fromPhrase(mnemonic);\n            const s = await m.toBip39Seed(salt);\n            Bip44Wallet.#isInternal = true;\n            const wallet = new this(id, s, m);\n            await wallet.lock(passkey);\n            return wallet;\n        }\n        catch (err) {\n            throw new Error(`Error importing Bip44Wallet from mnemonic: ${err}`);\n        }\n    }\n    static async fromSeed(passkey, seed) {\n        if (seed.length !== SEED_LENGTH_BIP44) {\n            throw new Error(`Expected a ${SEED_LENGTH_BIP44}-character seed, but received ${seed.length}-character string.`);\n        }\n        if (!/^[0-9a-fA-F]+$/i.test(seed)) {\n            throw new Error('Seed contains invalid hexadecimal characters.');\n        }\n        const id = await Entropy.create(16);\n        Bip44Wallet.#isInternal = true;\n        const wallet = new this(id, seed);\n        await wallet.lock(passkey);\n        return wallet;\n    }\n    /**\n    * Retrieves an existing HD wallet from session storage using its ID.\n    *\n    * @param {string} id - Generated when the wallet was initially created\n    * @returns {Bip44Wallet} Restored locked Bip44Wallet\n    */\n    static async restore(id) {\n        if (typeof id !== 'string' || id === '') {\n            throw new TypeError('Wallet ID is required to restore');\n        }\n        Bip44Wallet.#isInternal = true;\n        return new this(await Entropy.import(id), '');\n    }\n    /**\n    * Derives BIP-44 Nano account private keys.\n    *\n    * @param {number[]} indexes - Indexes of the accounts\n    * @returns {Promise<Account>}\n    */\n    async ckd(indexes) {\n        const data = [];\n        indexes.forEach(i => data.push({ seed: this.seed, index: i }));\n        const privateKeys = await Bip44Wallet.#poolBip44Ckd.assign(data);\n        return privateKeys;\n    }\n}\n/**\n* BLAKE2b wallet created by deriving a mnemonic phrase from a seed or vice\n* versa. If no value is provided for either, a new BIP-39 seed and mnemonic will\n* be generated using a cryptographically strong pseudorandom number generator.\n*\n* Account private keys are derived on an ad hoc basis using the Blake2b hashing\n* function. Account public key are derived from the private key using the\n* Ed25519 key algorithm. Account addresses are derived from the public key as\n* described in the Nano documentation.\n* https://docs.nano.org/integration-guides/the-basics/\n*\n* A password must be provided when creating or importing the wallet and is used\n* to lock and unlock the wallet. The wallet will be initialized as locked. When\n* the wallet is unlocked, a new password can be specified using the lock()\n* method.\n*/\nexport class Blake2bWallet extends Wallet {\n    static #isInternal = false;\n    constructor(id, seed, mnemonic) {\n        if (!Blake2bWallet.#isInternal) {\n            throw new Error(`Blake2bWallet cannot be instantiated directly. Use 'await Blake2bWallet.create()' instead.`);\n        }\n        Blake2bWallet.#isInternal = false;\n        super(id, seed, mnemonic);\n    }\n    static async create(passkey) {\n        try {\n            const seed = await Entropy.create();\n            return await Blake2bWallet.fromSeed(passkey, seed.hex);\n        }\n        catch (err) {\n            throw new Error(`Error creating new Blake2bWallet: ${err}`);\n        }\n    }\n    static async fromSeed(passkey, seed) {\n        if (seed.length !== SEED_LENGTH_BLAKE2B) {\n            throw new Error(`Expected a ${SEED_LENGTH_BLAKE2B}-character seed, but received ${seed.length}-character string.`);\n        }\n        if (!/^[0-9a-fA-F]+$/i.test(seed)) {\n            throw new Error('Seed contains invalid hexadecimal characters.');\n        }\n        const id = await Entropy.create(16);\n        const s = seed;\n        const m = await Bip39Mnemonic.fromEntropy(seed);\n        Blake2bWallet.#isInternal = true;\n        const wallet = new this(id, s, m);\n        await wallet.lock(passkey);\n        return wallet;\n    }\n    static async fromMnemonic(passkey, mnemonic) {\n        try {\n            const id = await Entropy.create(16);\n            const m = await Bip39Mnemonic.fromPhrase(mnemonic);\n            const s = await m.toBlake2bSeed();\n            Blake2bWallet.#isInternal = true;\n            const wallet = new this(id, s, m);\n            await wallet.lock(passkey);\n            return wallet;\n        }\n        catch (err) {\n            throw new Error(`Error importing Blake2bWallet from mnemonic: ${err}`);\n        }\n    }\n    /**\n    * Retrieves an existing BLAKE2b wallet from session storage using its ID.\n    *\n    * @param {string} id - Generated when the wallet was initially created\n    * @returns {Blake2bWallet} Restored locked Blake2bWallet\n    */\n    static async restore(id) {\n        if (typeof id !== 'string' || id === '') {\n            throw new TypeError('Wallet ID is required to restore');\n        }\n        Blake2bWallet.#isInternal = true;\n        return new this(await Entropy.import(id), '');\n    }\n    /**\n    * Derives BLAKE2b account private keys.\n    *\n    * @param {number[]} indexes - Indexes of the accounts\n    * @returns {Promise<Account>}\n    */\n    async ckd(indexes) {\n        const results = indexes.map(index => {\n            const indexHex = index.toString(16).padStart(8, '0').toUpperCase();\n            const inputHex = `${this.seed}${indexHex}`.padStart(72, '0');\n            const inputArray = (inputHex.match(/.{1,2}/g) ?? []).map(h => parseInt(h, 16));\n            const inputBytes = Uint8Array.from(inputArray);\n            const privateKey = new Blake2b(32).update(inputBytes).digest('hex');\n            return { privateKey, index };\n        });\n        return results;\n    }\n}\n/**\n* Ledger hardware wallet created by communicating with a Ledger device via ADPU\n* calls. This wallet does not feature any seed nor mnemonic phrase as all\n* private keys are held in the secure chip of the device. As such, the user\n* is responsible for using Ledger technology to back up these pieces of data.\n*\n* Usage of this wallet is generally controlled by calling functions of the\n* `ledger` object. For example, the wallet interface should have a button to\n* initiate a device connection by calling `wallet.ledger.connect()`. For more\n* information, refer to the ledger.js service file.\n*/\nexport class LedgerWallet extends Wallet {\n    static #isInternal = false;\n    #ledger;\n    get ledger() { return this.#ledger; }\n    constructor(id, ledger) {\n        if (!LedgerWallet.#isInternal) {\n            throw new Error(`LedgerWallet cannot be instantiated directly. Use 'await LedgerWallet.create()' instead.`);\n        }\n        LedgerWallet.#isInternal = false;\n        super(id);\n        this.#ledger = ledger;\n    }\n    /**\n    * Creates a new Ledger hardware wallet communication layer by dynamically\n    * importing the ledger.js service.\n    *\n    * @returns {LedgerWallet} A wallet containing accounts and a Ledger device communication object\n    */\n    static async create() {\n        const { Ledger } = await import('./ledger.js');\n        const l = await Ledger.init();\n        const id = await Entropy.create(16);\n        LedgerWallet.#isInternal = true;\n        return new this(id, l);\n    }\n    /**\n    * Retrieves an existing Ledger wallet from session storage using its ID.\n    *\n    * @param {string} id - Generated when the wallet was initially created\n    * @returns {LedgerWallet} Restored LedgerWallet\n    */\n    static async restore(id) {\n        if (typeof id !== 'string' || id === '') {\n            throw new TypeError('Wallet ID is required to restore');\n        }\n        const { Ledger } = await import('./ledger.js');\n        const l = await Ledger.init();\n        LedgerWallet.#isInternal = true;\n        return new this(await Entropy.import(id), l);\n    }\n    /**\n    * Gets the public key for an account from the Ledger device.\n    *\n    * @param {number[]} indexes - Indexes of the accounts\n    * @returns {Promise<Account>}\n    */\n    async ckd(indexes) {\n        const results = [];\n        for (const index of indexes) {\n            const { status, publicKey } = await this.ledger.account(index);\n            if (status === 'OK' && publicKey != null) {\n                results.push({ publicKey, index });\n            }\n            else {\n                throw new Error(`Error getting Ledger account: ${status}`);\n            }\n        }\n        return results;\n    }\n    /**\n    * Attempts to close the current process on the Ledger device.\n    *\n    * Overrides the default wallet `lock()` method since as a hardware wallet it\n    * does not need to be encrypted by software.\n    *\n    * @returns True if successfully locked\n    */\n    async lock() {\n        if (this.ledger == null) {\n            return false;\n        }\n        const result = await this.ledger.close();\n        return result === 'OK';\n    }\n    /**\n    * Attempts to connect to the Ledger device.\n    *\n    * Overrides the default wallet `unlock()` method since as a hardware wallet it\n    * does not need to be encrypted by software.\n    *\n    * @returns True if successfully unlocked\n    */\n    async unlock() {\n        if (this.ledger == null) {\n            return false;\n        }\n        const result = await this.ledger.connect();\n        return result === 'OK';\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n/**\n* https://github.com/bitcoin/bips/blob/master/bip-0039/english.txt\n*/\nexport const Bip39Words = Object.freeze([\n    'abandon',\n    'ability',\n    'able',\n    'about',\n    'above',\n    'absent',\n    'absorb',\n    'abstract',\n    'absurd',\n    'abuse',\n    'access',\n    'accident',\n    'account',\n    'accuse',\n    'achieve',\n    'acid',\n    'acoustic',\n    'acquire',\n    'across',\n    'act',\n    'action',\n    'actor',\n    'actress',\n    'actual',\n    'adapt',\n    'add',\n    'addict',\n    'address',\n    'adjust',\n    'admit',\n    'adult',\n    'advance',\n    'advice',\n    'aerobic',\n    'affair',\n    'afford',\n    'afraid',\n    'again',\n    'age',\n    'agent',\n    'agree',\n    'ahead',\n    'aim',\n    'air',\n    'airport',\n    'aisle',\n    'alarm',\n    'album',\n    'alcohol',\n    'alert',\n    'alien',\n    'all',\n    'alley',\n    'allow',\n    'almost',\n    'alone',\n    'alpha',\n    'already',\n    'also',\n    'alter',\n    'always',\n    'amateur',\n    'amazing',\n    'among',\n    'amount',\n    'amused',\n    'analyst',\n    'anchor',\n    'ancient',\n    'anger',\n    'angle',\n    'angry',\n    'animal',\n    'ankle',\n    'announce',\n    'annual',\n    'another',\n    'answer',\n    'antenna',\n    'antique',\n    'anxiety',\n    'any',\n    'apart',\n    'apology',\n    'appear',\n    'apple',\n    'approve',\n    'april',\n    'arch',\n    'arctic',\n    'area',\n    'arena',\n    'argue',\n    'arm',\n    'armed',\n    'armor',\n    'army',\n    'around',\n    'arrange',\n    'arrest',\n    'arrive',\n    'arrow',\n    'art',\n    'artefact',\n    'artist',\n    'artwork',\n    'ask',\n    'aspect',\n    'assault',\n    'asset',\n    'assist',\n    'assume',\n    'asthma',\n    'athlete',\n    'atom',\n    'attack',\n    'attend',\n    'attitude',\n    'attract',\n    'auction',\n    'audit',\n    'august',\n    'aunt',\n    'author',\n    'auto',\n    'autumn',\n    'average',\n    'avocado',\n    'avoid',\n    'awake',\n    'aware',\n    'away',\n    'awesome',\n    'awful',\n    'awkward',\n    'axis',\n    'baby',\n    'bachelor',\n    'bacon',\n    'badge',\n    'bag',\n    'balance',\n    'balcony',\n    'ball',\n    'bamboo',\n    'banana',\n    'banner',\n    'bar',\n    'barely',\n    'bargain',\n    'barrel',\n    'base',\n    'basic',\n    'basket',\n    'battle',\n    'beach',\n    'bean',\n    'beauty',\n    'because',\n    'become',\n    'beef',\n    'before',\n    'begin',\n    'behave',\n    'behind',\n    'believe',\n    'below',\n    'belt',\n    'bench',\n    'benefit',\n    'best',\n    'betray',\n    'better',\n    'between',\n    'beyond',\n    'bicycle',\n    'bid',\n    'bike',\n    'bind',\n    'biology',\n    'bird',\n    'birth',\n    'bitter',\n    'black',\n    'blade',\n    'blame',\n    'blanket',\n    'blast',\n    'bleak',\n    'bless',\n    'blind',\n    'blood',\n    'blossom',\n    'blouse',\n    'blue',\n    'blur',\n    'blush',\n    'board',\n    'boat',\n    'body',\n    'boil',\n    'bomb',\n    'bone',\n    'bonus',\n    'book',\n    'boost',\n    'border',\n    'boring',\n    'borrow',\n    'boss',\n    'bottom',\n    'bounce',\n    'box',\n    'boy',\n    'bracket',\n    'brain',\n    'brand',\n    'brass',\n    'brave',\n    'bread',\n    'breeze',\n    'brick',\n    'bridge',\n    'brief',\n    'bright',\n    'bring',\n    'brisk',\n    'broccoli',\n    'broken',\n    'bronze',\n    'broom',\n    'brother',\n    'brown',\n    'brush',\n    'bubble',\n    'buddy',\n    'budget',\n    'buffalo',\n    'build',\n    'bulb',\n    'bulk',\n    'bullet',\n    'bundle',\n    'bunker',\n    'burden',\n    'burger',\n    'burst',\n    'bus',\n    'business',\n    'busy',\n    'butter',\n    'buyer',\n    'buzz',\n    'cabbage',\n    'cabin',\n    'cable',\n    'cactus',\n    'cage',\n    'cake',\n    'call',\n    'calm',\n    'camera',\n    'camp',\n    'can',\n    'canal',\n    'cancel',\n    'candy',\n    'cannon',\n    'canoe',\n    'canvas',\n    'canyon',\n    'capable',\n    'capital',\n    'captain',\n    'car',\n    'carbon',\n    'card',\n    'cargo',\n    'carpet',\n    'carry',\n    'cart',\n    'case',\n    'cash',\n    'casino',\n    'castle',\n    'casual',\n    'cat',\n    'catalog',\n    'catch',\n    'category',\n    'cattle',\n    'caught',\n    'cause',\n    'caution',\n    'cave',\n    'ceiling',\n    'celery',\n    'cement',\n    'census',\n    'century',\n    'cereal',\n    'certain',\n    'chair',\n    'chalk',\n    'champion',\n    'change',\n    'chaos',\n    'chapter',\n    'charge',\n    'chase',\n    'chat',\n    'cheap',\n    'check',\n    'cheese',\n    'chef',\n    'cherry',\n    'chest',\n    'chicken',\n    'chief',\n    'child',\n    'chimney',\n    'choice',\n    'choose',\n    'chronic',\n    'chuckle',\n    'chunk',\n    'churn',\n    'cigar',\n    'cinnamon',\n    'circle',\n    'citizen',\n    'city',\n    'civil',\n    'claim',\n    'clap',\n    'clarify',\n    'claw',\n    'clay',\n    'clean',\n    'clerk',\n    'clever',\n    'click',\n    'client',\n    'cliff',\n    'climb',\n    'clinic',\n    'clip',\n    'clock',\n    'clog',\n    'close',\n    'cloth',\n    'cloud',\n    'clown',\n    'club',\n    'clump',\n    'cluster',\n    'clutch',\n    'coach',\n    'coast',\n    'coconut',\n    'code',\n    'coffee',\n    'coil',\n    'coin',\n    'collect',\n    'color',\n    'column',\n    'combine',\n    'come',\n    'comfort',\n    'comic',\n    'common',\n    'company',\n    'concert',\n    'conduct',\n    'confirm',\n    'congress',\n    'connect',\n    'consider',\n    'control',\n    'convince',\n    'cook',\n    'cool',\n    'copper',\n    'copy',\n    'coral',\n    'core',\n    'corn',\n    'correct',\n    'cost',\n    'cotton',\n    'couch',\n    'country',\n    'couple',\n    'course',\n    'cousin',\n    'cover',\n    'coyote',\n    'crack',\n    'cradle',\n    'craft',\n    'cram',\n    'crane',\n    'crash',\n    'crater',\n    'crawl',\n    'crazy',\n    'cream',\n    'credit',\n    'creek',\n    'crew',\n    'cricket',\n    'crime',\n    'crisp',\n    'critic',\n    'crop',\n    'cross',\n    'crouch',\n    'crowd',\n    'crucial',\n    'cruel',\n    'cruise',\n    'crumble',\n    'crunch',\n    'crush',\n    'cry',\n    'crystal',\n    'cube',\n    'culture',\n    'cup',\n    'cupboard',\n    'curious',\n    'current',\n    'curtain',\n    'curve',\n    'cushion',\n    'custom',\n    'cute',\n    'cycle',\n    'dad',\n    'damage',\n    'damp',\n    'dance',\n    'danger',\n    'daring',\n    'dash',\n    'daughter',\n    'dawn',\n    'day',\n    'deal',\n    'debate',\n    'debris',\n    'decade',\n    'december',\n    'decide',\n    'decline',\n    'decorate',\n    'decrease',\n    'deer',\n    'defense',\n    'define',\n    'defy',\n    'degree',\n    'delay',\n    'deliver',\n    'demand',\n    'demise',\n    'denial',\n    'dentist',\n    'deny',\n    'depart',\n    'depend',\n    'deposit',\n    'depth',\n    'deputy',\n    'derive',\n    'describe',\n    'desert',\n    'design',\n    'desk',\n    'despair',\n    'destroy',\n    'detail',\n    'detect',\n    'develop',\n    'device',\n    'devote',\n    'diagram',\n    'dial',\n    'diamond',\n    'diary',\n    'dice',\n    'diesel',\n    'diet',\n    'differ',\n    'digital',\n    'dignity',\n    'dilemma',\n    'dinner',\n    'dinosaur',\n    'direct',\n    'dirt',\n    'disagree',\n    'discover',\n    'disease',\n    'dish',\n    'dismiss',\n    'disorder',\n    'display',\n    'distance',\n    'divert',\n    'divide',\n    'divorce',\n    'dizzy',\n    'doctor',\n    'document',\n    'dog',\n    'doll',\n    'dolphin',\n    'domain',\n    'donate',\n    'donkey',\n    'donor',\n    'door',\n    'dose',\n    'double',\n    'dove',\n    'draft',\n    'dragon',\n    'drama',\n    'drastic',\n    'draw',\n    'dream',\n    'dress',\n    'drift',\n    'drill',\n    'drink',\n    'drip',\n    'drive',\n    'drop',\n    'drum',\n    'dry',\n    'duck',\n    'dumb',\n    'dune',\n    'during',\n    'dust',\n    'dutch',\n    'duty',\n    'dwarf',\n    'dynamic',\n    'eager',\n    'eagle',\n    'early',\n    'earn',\n    'earth',\n    'easily',\n    'east',\n    'easy',\n    'echo',\n    'ecology',\n    'economy',\n    'edge',\n    'edit',\n    'educate',\n    'effort',\n    'egg',\n    'eight',\n    'either',\n    'elbow',\n    'elder',\n    'electric',\n    'elegant',\n    'element',\n    'elephant',\n    'elevator',\n    'elite',\n    'else',\n    'embark',\n    'embody',\n    'embrace',\n    'emerge',\n    'emotion',\n    'employ',\n    'empower',\n    'empty',\n    'enable',\n    'enact',\n    'end',\n    'endless',\n    'endorse',\n    'enemy',\n    'energy',\n    'enforce',\n    'engage',\n    'engine',\n    'enhance',\n    'enjoy',\n    'enlist',\n    'enough',\n    'enrich',\n    'enroll',\n    'ensure',\n    'enter',\n    'entire',\n    'entry',\n    'envelope',\n    'episode',\n    'equal',\n    'equip',\n    'era',\n    'erase',\n    'erode',\n    'erosion',\n    'error',\n    'erupt',\n    'escape',\n    'essay',\n    'essence',\n    'estate',\n    'eternal',\n    'ethics',\n    'evidence',\n    'evil',\n    'evoke',\n    'evolve',\n    'exact',\n    'example',\n    'excess',\n    'exchange',\n    'excite',\n    'exclude',\n    'excuse',\n    'execute',\n    'exercise',\n    'exhaust',\n    'exhibit',\n    'exile',\n    'exist',\n    'exit',\n    'exotic',\n    'expand',\n    'expect',\n    'expire',\n    'explain',\n    'expose',\n    'express',\n    'extend',\n    'extra',\n    'eye',\n    'eyebrow',\n    'fabric',\n    'face',\n    'faculty',\n    'fade',\n    'faint',\n    'faith',\n    'fall',\n    'false',\n    'fame',\n    'family',\n    'famous',\n    'fan',\n    'fancy',\n    'fantasy',\n    'farm',\n    'fashion',\n    'fat',\n    'fatal',\n    'father',\n    'fatigue',\n    'fault',\n    'favorite',\n    'feature',\n    'february',\n    'federal',\n    'fee',\n    'feed',\n    'feel',\n    'female',\n    'fence',\n    'festival',\n    'fetch',\n    'fever',\n    'few',\n    'fiber',\n    'fiction',\n    'field',\n    'figure',\n    'file',\n    'film',\n    'filter',\n    'final',\n    'find',\n    'fine',\n    'finger',\n    'finish',\n    'fire',\n    'firm',\n    'first',\n    'fiscal',\n    'fish',\n    'fit',\n    'fitness',\n    'fix',\n    'flag',\n    'flame',\n    'flash',\n    'flat',\n    'flavor',\n    'flee',\n    'flight',\n    'flip',\n    'float',\n    'flock',\n    'floor',\n    'flower',\n    'fluid',\n    'flush',\n    'fly',\n    'foam',\n    'focus',\n    'fog',\n    'foil',\n    'fold',\n    'follow',\n    'food',\n    'foot',\n    'force',\n    'forest',\n    'forget',\n    'fork',\n    'fortune',\n    'forum',\n    'forward',\n    'fossil',\n    'foster',\n    'found',\n    'fox',\n    'fragile',\n    'frame',\n    'frequent',\n    'fresh',\n    'friend',\n    'fringe',\n    'frog',\n    'front',\n    'frost',\n    'frown',\n    'frozen',\n    'fruit',\n    'fuel',\n    'fun',\n    'funny',\n    'furnace',\n    'fury',\n    'future',\n    'gadget',\n    'gain',\n    'galaxy',\n    'gallery',\n    'game',\n    'gap',\n    'garage',\n    'garbage',\n    'garden',\n    'garlic',\n    'garment',\n    'gas',\n    'gasp',\n    'gate',\n    'gather',\n    'gauge',\n    'gaze',\n    'general',\n    'genius',\n    'genre',\n    'gentle',\n    'genuine',\n    'gesture',\n    'ghost',\n    'giant',\n    'gift',\n    'giggle',\n    'ginger',\n    'giraffe',\n    'girl',\n    'give',\n    'glad',\n    'glance',\n    'glare',\n    'glass',\n    'glide',\n    'glimpse',\n    'globe',\n    'gloom',\n    'glory',\n    'glove',\n    'glow',\n    'glue',\n    'goat',\n    'goddess',\n    'gold',\n    'good',\n    'goose',\n    'gorilla',\n    'gospel',\n    'gossip',\n    'govern',\n    'gown',\n    'grab',\n    'grace',\n    'grain',\n    'grant',\n    'grape',\n    'grass',\n    'gravity',\n    'great',\n    'green',\n    'grid',\n    'grief',\n    'grit',\n    'grocery',\n    'group',\n    'grow',\n    'grunt',\n    'guard',\n    'guess',\n    'guide',\n    'guilt',\n    'guitar',\n    'gun',\n    'gym',\n    'habit',\n    'hair',\n    'half',\n    'hammer',\n    'hamster',\n    'hand',\n    'happy',\n    'harbor',\n    'hard',\n    'harsh',\n    'harvest',\n    'hat',\n    'have',\n    'hawk',\n    'hazard',\n    'head',\n    'health',\n    'heart',\n    'heavy',\n    'hedgehog',\n    'height',\n    'hello',\n    'helmet',\n    'help',\n    'hen',\n    'hero',\n    'hidden',\n    'high',\n    'hill',\n    'hint',\n    'hip',\n    'hire',\n    'history',\n    'hobby',\n    'hockey',\n    'hold',\n    'hole',\n    'holiday',\n    'hollow',\n    'home',\n    'honey',\n    'hood',\n    'hope',\n    'horn',\n    'horror',\n    'horse',\n    'hospital',\n    'host',\n    'hotel',\n    'hour',\n    'hover',\n    'hub',\n    'huge',\n    'human',\n    'humble',\n    'humor',\n    'hundred',\n    'hungry',\n    'hunt',\n    'hurdle',\n    'hurry',\n    'hurt',\n    'husband',\n    'hybrid',\n    'ice',\n    'icon',\n    'idea',\n    'identify',\n    'idle',\n    'ignore',\n    'ill',\n    'illegal',\n    'illness',\n    'image',\n    'imitate',\n    'immense',\n    'immune',\n    'impact',\n    'impose',\n    'improve',\n    'impulse',\n    'inch',\n    'include',\n    'income',\n    'increase',\n    'index',\n    'indicate',\n    'indoor',\n    'industry',\n    'infant',\n    'inflict',\n    'inform',\n    'inhale',\n    'inherit',\n    'initial',\n    'inject',\n    'injury',\n    'inmate',\n    'inner',\n    'innocent',\n    'input',\n    'inquiry',\n    'insane',\n    'insect',\n    'inside',\n    'inspire',\n    'install',\n    'intact',\n    'interest',\n    'into',\n    'invest',\n    'invite',\n    'involve',\n    'iron',\n    'island',\n    'isolate',\n    'issue',\n    'item',\n    'ivory',\n    'jacket',\n    'jaguar',\n    'jar',\n    'jazz',\n    'jealous',\n    'jeans',\n    'jelly',\n    'jewel',\n    'job',\n    'join',\n    'joke',\n    'journey',\n    'joy',\n    'judge',\n    'juice',\n    'jump',\n    'jungle',\n    'junior',\n    'junk',\n    'just',\n    'kangaroo',\n    'keen',\n    'keep',\n    'ketchup',\n    'key',\n    'kick',\n    'kid',\n    'kidney',\n    'kind',\n    'kingdom',\n    'kiss',\n    'kit',\n    'kitchen',\n    'kite',\n    'kitten',\n    'kiwi',\n    'knee',\n    'knife',\n    'knock',\n    'know',\n    'lab',\n    'label',\n    'labor',\n    'ladder',\n    'lady',\n    'lake',\n    'lamp',\n    'language',\n    'laptop',\n    'large',\n    'later',\n    'latin',\n    'laugh',\n    'laundry',\n    'lava',\n    'law',\n    'lawn',\n    'lawsuit',\n    'layer',\n    'lazy',\n    'leader',\n    'leaf',\n    'learn',\n    'leave',\n    'lecture',\n    'left',\n    'leg',\n    'legal',\n    'legend',\n    'leisure',\n    'lemon',\n    'lend',\n    'length',\n    'lens',\n    'leopard',\n    'lesson',\n    'letter',\n    'level',\n    'liar',\n    'liberty',\n    'library',\n    'license',\n    'life',\n    'lift',\n    'light',\n    'like',\n    'limb',\n    'limit',\n    'link',\n    'lion',\n    'liquid',\n    'list',\n    'little',\n    'live',\n    'lizard',\n    'load',\n    'loan',\n    'lobster',\n    'local',\n    'lock',\n    'logic',\n    'lonely',\n    'long',\n    'loop',\n    'lottery',\n    'loud',\n    'lounge',\n    'love',\n    'loyal',\n    'lucky',\n    'luggage',\n    'lumber',\n    'lunar',\n    'lunch',\n    'luxury',\n    'lyrics',\n    'machine',\n    'mad',\n    'magic',\n    'magnet',\n    'maid',\n    'mail',\n    'main',\n    'major',\n    'make',\n    'mammal',\n    'man',\n    'manage',\n    'mandate',\n    'mango',\n    'mansion',\n    'manual',\n    'maple',\n    'marble',\n    'march',\n    'margin',\n    'marine',\n    'market',\n    'marriage',\n    'mask',\n    'mass',\n    'master',\n    'match',\n    'material',\n    'math',\n    'matrix',\n    'matter',\n    'maximum',\n    'maze',\n    'meadow',\n    'mean',\n    'measure',\n    'meat',\n    'mechanic',\n    'medal',\n    'media',\n    'melody',\n    'melt',\n    'member',\n    'memory',\n    'mention',\n    'menu',\n    'mercy',\n    'merge',\n    'merit',\n    'merry',\n    'mesh',\n    'message',\n    'metal',\n    'method',\n    'middle',\n    'midnight',\n    'milk',\n    'million',\n    'mimic',\n    'mind',\n    'minimum',\n    'minor',\n    'minute',\n    'miracle',\n    'mirror',\n    'misery',\n    'miss',\n    'mistake',\n    'mix',\n    'mixed',\n    'mixture',\n    'mobile',\n    'model',\n    'modify',\n    'mom',\n    'moment',\n    'monitor',\n    'monkey',\n    'monster',\n    'month',\n    'moon',\n    'moral',\n    'more',\n    'morning',\n    'mosquito',\n    'mother',\n    'motion',\n    'motor',\n    'mountain',\n    'mouse',\n    'move',\n    'movie',\n    'much',\n    'muffin',\n    'mule',\n    'multiply',\n    'muscle',\n    'museum',\n    'mushroom',\n    'music',\n    'must',\n    'mutual',\n    'myself',\n    'mystery',\n    'myth',\n    'naive',\n    'name',\n    'napkin',\n    'narrow',\n    'nasty',\n    'nation',\n    'nature',\n    'near',\n    'neck',\n    'need',\n    'negative',\n    'neglect',\n    'neither',\n    'nephew',\n    'nerve',\n    'nest',\n    'net',\n    'network',\n    'neutral',\n    'never',\n    'news',\n    'next',\n    'nice',\n    'night',\n    'noble',\n    'noise',\n    'nominee',\n    'noodle',\n    'normal',\n    'north',\n    'nose',\n    'notable',\n    'note',\n    'nothing',\n    'notice',\n    'novel',\n    'now',\n    'nuclear',\n    'number',\n    'nurse',\n    'nut',\n    'oak',\n    'obey',\n    'object',\n    'oblige',\n    'obscure',\n    'observe',\n    'obtain',\n    'obvious',\n    'occur',\n    'ocean',\n    'october',\n    'odor',\n    'off',\n    'offer',\n    'office',\n    'often',\n    'oil',\n    'okay',\n    'old',\n    'olive',\n    'olympic',\n    'omit',\n    'once',\n    'one',\n    'onion',\n    'online',\n    'only',\n    'open',\n    'opera',\n    'opinion',\n    'oppose',\n    'option',\n    'orange',\n    'orbit',\n    'orchard',\n    'order',\n    'ordinary',\n    'organ',\n    'orient',\n    'original',\n    'orphan',\n    'ostrich',\n    'other',\n    'outdoor',\n    'outer',\n    'output',\n    'outside',\n    'oval',\n    'oven',\n    'over',\n    'own',\n    'owner',\n    'oxygen',\n    'oyster',\n    'ozone',\n    'pact',\n    'paddle',\n    'page',\n    'pair',\n    'palace',\n    'palm',\n    'panda',\n    'panel',\n    'panic',\n    'panther',\n    'paper',\n    'parade',\n    'parent',\n    'park',\n    'parrot',\n    'party',\n    'pass',\n    'patch',\n    'path',\n    'patient',\n    'patrol',\n    'pattern',\n    'pause',\n    'pave',\n    'payment',\n    'peace',\n    'peanut',\n    'pear',\n    'peasant',\n    'pelican',\n    'pen',\n    'penalty',\n    'pencil',\n    'people',\n    'pepper',\n    'perfect',\n    'permit',\n    'person',\n    'pet',\n    'phone',\n    'photo',\n    'phrase',\n    'physical',\n    'piano',\n    'picnic',\n    'picture',\n    'piece',\n    'pig',\n    'pigeon',\n    'pill',\n    'pilot',\n    'pink',\n    'pioneer',\n    'pipe',\n    'pistol',\n    'pitch',\n    'pizza',\n    'place',\n    'planet',\n    'plastic',\n    'plate',\n    'play',\n    'please',\n    'pledge',\n    'pluck',\n    'plug',\n    'plunge',\n    'poem',\n    'poet',\n    'point',\n    'polar',\n    'pole',\n    'police',\n    'pond',\n    'pony',\n    'pool',\n    'popular',\n    'portion',\n    'position',\n    'possible',\n    'post',\n    'potato',\n    'pottery',\n    'poverty',\n    'powder',\n    'power',\n    'practice',\n    'praise',\n    'predict',\n    'prefer',\n    'prepare',\n    'present',\n    'pretty',\n    'prevent',\n    'price',\n    'pride',\n    'primary',\n    'print',\n    'priority',\n    'prison',\n    'private',\n    'prize',\n    'problem',\n    'process',\n    'produce',\n    'profit',\n    'program',\n    'project',\n    'promote',\n    'proof',\n    'property',\n    'prosper',\n    'protect',\n    'proud',\n    'provide',\n    'public',\n    'pudding',\n    'pull',\n    'pulp',\n    'pulse',\n    'pumpkin',\n    'punch',\n    'pupil',\n    'puppy',\n    'purchase',\n    'purity',\n    'purpose',\n    'purse',\n    'push',\n    'put',\n    'puzzle',\n    'pyramid',\n    'quality',\n    'quantum',\n    'quarter',\n    'question',\n    'quick',\n    'quit',\n    'quiz',\n    'quote',\n    'rabbit',\n    'raccoon',\n    'race',\n    'rack',\n    'radar',\n    'radio',\n    'rail',\n    'rain',\n    'raise',\n    'rally',\n    'ramp',\n    'ranch',\n    'random',\n    'range',\n    'rapid',\n    'rare',\n    'rate',\n    'rather',\n    'raven',\n    'raw',\n    'razor',\n    'ready',\n    'real',\n    'reason',\n    'rebel',\n    'rebuild',\n    'recall',\n    'receive',\n    'recipe',\n    'record',\n    'recycle',\n    'reduce',\n    'reflect',\n    'reform',\n    'refuse',\n    'region',\n    'regret',\n    'regular',\n    'reject',\n    'relax',\n    'release',\n    'relief',\n    'rely',\n    'remain',\n    'remember',\n    'remind',\n    'remove',\n    'render',\n    'renew',\n    'rent',\n    'reopen',\n    'repair',\n    'repeat',\n    'replace',\n    'report',\n    'require',\n    'rescue',\n    'resemble',\n    'resist',\n    'resource',\n    'response',\n    'result',\n    'retire',\n    'retreat',\n    'return',\n    'reunion',\n    'reveal',\n    'review',\n    'reward',\n    'rhythm',\n    'rib',\n    'ribbon',\n    'rice',\n    'rich',\n    'ride',\n    'ridge',\n    'rifle',\n    'right',\n    'rigid',\n    'ring',\n    'riot',\n    'ripple',\n    'risk',\n    'ritual',\n    'rival',\n    'river',\n    'road',\n    'roast',\n    'robot',\n    'robust',\n    'rocket',\n    'romance',\n    'roof',\n    'rookie',\n    'room',\n    'rose',\n    'rotate',\n    'rough',\n    'round',\n    'route',\n    'royal',\n    'rubber',\n    'rude',\n    'rug',\n    'rule',\n    'run',\n    'runway',\n    'rural',\n    'sad',\n    'saddle',\n    'sadness',\n    'safe',\n    'sail',\n    'salad',\n    'salmon',\n    'salon',\n    'salt',\n    'salute',\n    'same',\n    'sample',\n    'sand',\n    'satisfy',\n    'satoshi',\n    'sauce',\n    'sausage',\n    'save',\n    'say',\n    'scale',\n    'scan',\n    'scare',\n    'scatter',\n    'scene',\n    'scheme',\n    'school',\n    'science',\n    'scissors',\n    'scorpion',\n    'scout',\n    'scrap',\n    'screen',\n    'script',\n    'scrub',\n    'sea',\n    'search',\n    'season',\n    'seat',\n    'second',\n    'secret',\n    'section',\n    'security',\n    'seed',\n    'seek',\n    'segment',\n    'select',\n    'sell',\n    'seminar',\n    'senior',\n    'sense',\n    'sentence',\n    'series',\n    'service',\n    'session',\n    'settle',\n    'setup',\n    'seven',\n    'shadow',\n    'shaft',\n    'shallow',\n    'share',\n    'shed',\n    'shell',\n    'sheriff',\n    'shield',\n    'shift',\n    'shine',\n    'ship',\n    'shiver',\n    'shock',\n    'shoe',\n    'shoot',\n    'shop',\n    'short',\n    'shoulder',\n    'shove',\n    'shrimp',\n    'shrug',\n    'shuffle',\n    'shy',\n    'sibling',\n    'sick',\n    'side',\n    'siege',\n    'sight',\n    'sign',\n    'silent',\n    'silk',\n    'silly',\n    'silver',\n    'similar',\n    'simple',\n    'since',\n    'sing',\n    'siren',\n    'sister',\n    'situate',\n    'six',\n    'size',\n    'skate',\n    'sketch',\n    'ski',\n    'skill',\n    'skin',\n    'skirt',\n    'skull',\n    'slab',\n    'slam',\n    'sleep',\n    'slender',\n    'slice',\n    'slide',\n    'slight',\n    'slim',\n    'slogan',\n    'slot',\n    'slow',\n    'slush',\n    'small',\n    'smart',\n    'smile',\n    'smoke',\n    'smooth',\n    'snack',\n    'snake',\n    'snap',\n    'sniff',\n    'snow',\n    'soap',\n    'soccer',\n    'social',\n    'sock',\n    'soda',\n    'soft',\n    'solar',\n    'soldier',\n    'solid',\n    'solution',\n    'solve',\n    'someone',\n    'song',\n    'soon',\n    'sorry',\n    'sort',\n    'soul',\n    'sound',\n    'soup',\n    'source',\n    'south',\n    'space',\n    'spare',\n    'spatial',\n    'spawn',\n    'speak',\n    'special',\n    'speed',\n    'spell',\n    'spend',\n    'sphere',\n    'spice',\n    'spider',\n    'spike',\n    'spin',\n    'spirit',\n    'split',\n    'spoil',\n    'sponsor',\n    'spoon',\n    'sport',\n    'spot',\n    'spray',\n    'spread',\n    'spring',\n    'spy',\n    'square',\n    'squeeze',\n    'squirrel',\n    'stable',\n    'stadium',\n    'staff',\n    'stage',\n    'stairs',\n    'stamp',\n    'stand',\n    'start',\n    'state',\n    'stay',\n    'steak',\n    'steel',\n    'stem',\n    'step',\n    'stereo',\n    'stick',\n    'still',\n    'sting',\n    'stock',\n    'stomach',\n    'stone',\n    'stool',\n    'story',\n    'stove',\n    'strategy',\n    'street',\n    'strike',\n    'strong',\n    'struggle',\n    'student',\n    'stuff',\n    'stumble',\n    'style',\n    'subject',\n    'submit',\n    'subway',\n    'success',\n    'such',\n    'sudden',\n    'suffer',\n    'sugar',\n    'suggest',\n    'suit',\n    'summer',\n    'sun',\n    'sunny',\n    'sunset',\n    'super',\n    'supply',\n    'supreme',\n    'sure',\n    'surface',\n    'surge',\n    'surprise',\n    'surround',\n    'survey',\n    'suspect',\n    'sustain',\n    'swallow',\n    'swamp',\n    'swap',\n    'swarm',\n    'swear',\n    'sweet',\n    'swift',\n    'swim',\n    'swing',\n    'switch',\n    'sword',\n    'symbol',\n    'symptom',\n    'syrup',\n    'system',\n    'table',\n    'tackle',\n    'tag',\n    'tail',\n    'talent',\n    'talk',\n    'tank',\n    'tape',\n    'target',\n    'task',\n    'taste',\n    'tattoo',\n    'taxi',\n    'teach',\n    'team',\n    'tell',\n    'ten',\n    'tenant',\n    'tennis',\n    'tent',\n    'term',\n    'test',\n    'text',\n    'thank',\n    'that',\n    'theme',\n    'then',\n    'theory',\n    'there',\n    'they',\n    'thing',\n    'this',\n    'thought',\n    'three',\n    'thrive',\n    'throw',\n    'thumb',\n    'thunder',\n    'ticket',\n    'tide',\n    'tiger',\n    'tilt',\n    'timber',\n    'time',\n    'tiny',\n    'tip',\n    'tired',\n    'tissue',\n    'title',\n    'toast',\n    'tobacco',\n    'today',\n    'toddler',\n    'toe',\n    'together',\n    'toilet',\n    'token',\n    'tomato',\n    'tomorrow',\n    'tone',\n    'tongue',\n    'tonight',\n    'tool',\n    'tooth',\n    'top',\n    'topic',\n    'topple',\n    'torch',\n    'tornado',\n    'tortoise',\n    'toss',\n    'total',\n    'tourist',\n    'toward',\n    'tower',\n    'town',\n    'toy',\n    'track',\n    'trade',\n    'traffic',\n    'tragic',\n    'train',\n    'transfer',\n    'trap',\n    'trash',\n    'travel',\n    'tray',\n    'treat',\n    'tree',\n    'trend',\n    'trial',\n    'tribe',\n    'trick',\n    'trigger',\n    'trim',\n    'trip',\n    'trophy',\n    'trouble',\n    'truck',\n    'true',\n    'truly',\n    'trumpet',\n    'trust',\n    'truth',\n    'try',\n    'tube',\n    'tuition',\n    'tumble',\n    'tuna',\n    'tunnel',\n    'turkey',\n    'turn',\n    'turtle',\n    'twelve',\n    'twenty',\n    'twice',\n    'twin',\n    'twist',\n    'two',\n    'type',\n    'typical',\n    'ugly',\n    'umbrella',\n    'unable',\n    'unaware',\n    'uncle',\n    'uncover',\n    'under',\n    'undo',\n    'unfair',\n    'unfold',\n    'unhappy',\n    'uniform',\n    'unique',\n    'unit',\n    'universe',\n    'unknown',\n    'unlock',\n    'until',\n    'unusual',\n    'unveil',\n    'update',\n    'upgrade',\n    'uphold',\n    'upon',\n    'upper',\n    'upset',\n    'urban',\n    'urge',\n    'usage',\n    'use',\n    'used',\n    'useful',\n    'useless',\n    'usual',\n    'utility',\n    'vacant',\n    'vacuum',\n    'vague',\n    'valid',\n    'valley',\n    'valve',\n    'van',\n    'vanish',\n    'vapor',\n    'various',\n    'vast',\n    'vault',\n    'vehicle',\n    'velvet',\n    'vendor',\n    'venture',\n    'venue',\n    'verb',\n    'verify',\n    'version',\n    'very',\n    'vessel',\n    'veteran',\n    'viable',\n    'vibrant',\n    'vicious',\n    'victory',\n    'video',\n    'view',\n    'village',\n    'vintage',\n    'violin',\n    'virtual',\n    'virus',\n    'visa',\n    'visit',\n    'visual',\n    'vital',\n    'vivid',\n    'vocal',\n    'voice',\n    'void',\n    'volcano',\n    'volume',\n    'vote',\n    'voyage',\n    'wage',\n    'wagon',\n    'wait',\n    'walk',\n    'wall',\n    'walnut',\n    'want',\n    'warfare',\n    'warm',\n    'warrior',\n    'wash',\n    'wasp',\n    'waste',\n    'water',\n    'wave',\n    'way',\n    'wealth',\n    'weapon',\n    'wear',\n    'weasel',\n    'weather',\n    'web',\n    'wedding',\n    'weekend',\n    'weird',\n    'welcome',\n    'west',\n    'wet',\n    'whale',\n    'what',\n    'wheat',\n    'wheel',\n    'when',\n    'where',\n    'whip',\n    'whisper',\n    'wide',\n    'width',\n    'wife',\n    'wild',\n    'will',\n    'win',\n    'window',\n    'wine',\n    'wing',\n    'wink',\n    'winner',\n    'winter',\n    'wire',\n    'wisdom',\n    'wise',\n    'wish',\n    'witness',\n    'wolf',\n    'woman',\n    'wonder',\n    'wood',\n    'wool',\n    'word',\n    'work',\n    'world',\n    'worry',\n    'worth',\n    'wrap',\n    'wreck',\n    'wrestle',\n    'wrist',\n    'write',\n    'wrong',\n    'yard',\n    'year',\n    'yellow',\n    'you',\n    'young',\n    'youth',\n    'zebra',\n    'zero',\n    'zone',\n    'zoo'\n]);\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Bip39Words } from './bip39-wordlist.js';\nimport { bin, bytes, dec, utf8 } from './convert.js';\nimport { BIP39_ITERATIONS } from './constants.js';\nimport { Entropy } from './entropy.js';\nconst { subtle } = globalThis.crypto;\n/**\n* Represents a mnemonic phrase that identifies a wallet as defined by BIP-39.\n*/\nexport class Bip39Mnemonic {\n    static #isInternal = false;\n    #bip44Seed = '';\n    #blake2bSeed = '';\n    #phrase = '';\n    get phrase() { return this.#phrase.normalize('NFKD'); }\n    constructor() {\n        if (!Bip39Mnemonic.#isInternal) {\n            throw new Error(`Bip39Mnemonic cannot be instantiated directly. Use 'await Bip39Mnemonic.fromPhrase()' or 'await Bip39Mnemonic.fromEntropy() instead.`);\n        }\n        Bip39Mnemonic.#isInternal = false;\n    }\n    /**\n    * Imports and validates an existing mnemonic phrase.\n    *\n    * The phrase must be valid according to the BIP-39 specification. Typically\n    * wallets use the maximum of 24 words.\n    *\n    * @param {string} phrase - String of 12, 15, 18, 21, or 24 words\n    * @returns {string} Mnemonic phrase validated using the BIP-39 wordlist\n    */\n    static async fromPhrase(phrase) {\n        Bip39Mnemonic.#isInternal = true;\n        const self = new this();\n        const isValid = await Bip39Mnemonic.validate(phrase);\n        if (isValid) {\n            self.#phrase = phrase.normalize('NFKD');\n            return self;\n        }\n        else {\n            throw new Error('Invalid mnemonic phrase.');\n        }\n    }\n    /**\n    * Derives a mnemonic phrase from source of entropy or seed.\n    *\n    * The entropy must be between 32-64 characters to stay within the defined\n    * limit of 128-256 bits. Typically wallets use the maximum entropy allowed.\n    *\n    * @param {string} entropy - Hexadecimal string\n    * @returns {string} Mnemonic phrase created using the BIP-39 wordlist\n    */\n    static async fromEntropy(entropy) {\n        const e = await Entropy.import(entropy);\n        const checksum = await this.checksum(e);\n        let concatenation = `${e.bits}${checksum}`;\n        const words = [];\n        while (concatenation.length > 0) {\n            const wordBits = concatenation.substring(0, 11);\n            const wordIndex = parseInt(wordBits, 2);\n            words.push(Bip39Words[wordIndex]);\n            concatenation = concatenation.substring(11);\n        }\n        const sentence = words.join(' ');\n        return Bip39Mnemonic.fromPhrase(sentence);\n    }\n    /**\n     * SHA-256 hash of entropy that is appended to the entropy and subsequently\n     * used to generate the mnemonic phrase.\n     *\n     * @param {Entropy} entropy - Cryptographically strong pseudorandom data of length N bits\n     * @returns {Promise<string>} First N/32 bits of the hash as a hexadecimal string\n     */\n    static async checksum(entropy) {\n        const hashBuffer = await subtle.digest('SHA-256', entropy.bytes);\n        const hashBytes = new Uint8Array(hashBuffer);\n        const hashBits = bytes.toBin(hashBytes);\n        const checksumLength = entropy.bits.length / 32;\n        const checksum = hashBits.substring(0, checksumLength);\n        return checksum;\n    }\n    /**\n    * Validates a mnemonic phrase.\n    *\n    * @param {string} mnemonic - Mnemonic phrase to validate\n    * @returns {boolean} True if the mnemonic phrase is valid\n    */\n    static async validate(mnemonic) {\n        const words = mnemonic.normalize('NFKD').split(' ');\n        if (words.length % 3 !== 0) {\n            return false;\n        }\n        const wordBits = words.map(word => {\n            const wordIndex = Bip39Words.indexOf(word);\n            if (wordIndex === -1) {\n                return false;\n            }\n            return dec.toBin(wordIndex, 11);\n        }).join('');\n        const checksumLength = wordBits.length / 33;\n        const entropyLength = wordBits.length - checksumLength;\n        const entropyBits = wordBits.substring(0, entropyLength);\n        const checksumBits = wordBits.substring(entropyLength);\n        if (entropyBits == null\n            || entropyBits.length < 128\n            || entropyBits.length > 256\n            || entropyBits.length % 32 !== 0) {\n            return false;\n        }\n        const entropy = await Entropy.import(bin.toBytes(entropyBits));\n        const expectedChecksum = await this.checksum(entropy);\n        if (expectedChecksum !== checksumBits) {\n            return false;\n        }\n        return true;\n    }\n    /**\n    * Converts the mnemonic phrase to a BIP-39 seed.\n    *\n    * A passphrase string can be specified. If the passphrase is undefined, null,\n    * or not a string, the empty string (\"\") is used instead.\n    *\n    * @param {string} [passphrase=''] - Used as the PBKDF2 salt. Default: \"\"\n    * @returns {string} Hexadecimal seed\n    */\n    async toBip39Seed(passphrase) {\n        if (this.#blake2bSeed === '') {\n            if (passphrase == null || typeof passphrase !== 'string') {\n                passphrase = '';\n            }\n            passphrase = `mnemonic${passphrase.normalize('NFKD')}`;\n            const derivationAlgorithm = {\n                name: 'PBKDF2',\n                hash: 'SHA-512',\n                salt: utf8.toBytes(passphrase),\n                iterations: BIP39_ITERATIONS\n            };\n            const phraseKey = await subtle.importKey('raw', utf8.toBytes(this.phrase), 'PBKDF2', false, ['deriveBits', 'deriveKey']);\n            const derivedKeyType = {\n                name: 'HMAC',\n                hash: 'SHA-512',\n                length: 512\n            };\n            const isSeedKeyExtractable = true;\n            const seedKeyUsages = ['sign'];\n            const seedKey = await subtle.deriveKey(derivationAlgorithm, phraseKey, derivedKeyType, isSeedKeyExtractable, seedKeyUsages);\n            const seedBuffer = await subtle.exportKey('raw', seedKey);\n            const seedBytes = new Uint8Array(seedBuffer);\n            const seed = bytes.toHex(seedBytes);\n            this.#bip44Seed = seed;\n        }\n        return this.#bip44Seed;\n    }\n    /**\n    * Converts the mnemonic phrase to a BLAKE2b seed.\n    *\n    * @returns {string} Hexadecimal seed\n    */\n    async toBlake2bSeed() {\n        if (this.#blake2bSeed === '') {\n            const wordArray = this.phrase.split(' ');\n            const bits = wordArray.map((w) => {\n                const wordIndex = Bip39Words.indexOf(w);\n                if (wordIndex === -1) {\n                    return false;\n                }\n                return dec.toBin(wordIndex, 11);\n            }).join('');\n            const dividerIndex = Math.floor(bits.length / 33) * 32;\n            const entropyBits = bits.slice(0, dividerIndex);\n            const entropyBytes = entropyBits.match(/(.{1,8})/g)?.map((bin) => parseInt(bin, 2));\n            if (entropyBytes == null) {\n                throw new Error('Invalid mnemonic phrase');\n            }\n            this.#blake2bSeed = bytes.toHex(Uint8Array.from(entropyBytes));\n        }\n        return this.#blake2bSeed;\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport * as main from './main.js';\nglobalThis.libnemo ??= main;\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,IAWa,SAqSN;AAhTP;AAAA;AAAA;AAWO,IAAM,UAAN,MAAM,SAAQ;AAAA,MACjB,OAAO,YAAY;AAAA,MACnB,OAAO,YAAY;AAAA,MACnB,OAAO,eAAe;AAAA,MACtB,OAAO,eAAe;AAAA,MACtB,OAAO,YAAY;AAAA,MACnB,OAAO,gBAAgB;AAAA;AAAA,MAEvB,OAAO,eAAe,IAAI,YAAY;AAAA,QAClC;AAAA,QAAY;AAAA,QAAY;AAAA,QAAY;AAAA,QACpC;AAAA,QAAY;AAAA,QAAY;AAAA,QAAY;AAAA,QACpC;AAAA,QAAY;AAAA,QAAY;AAAA,QAAY;AAAA,QACpC;AAAA,QAAY;AAAA,QAAY;AAAA,QAAY;AAAA,MACxC,CAAC;AAAA,MACD,OAAO,SAAS;AAAA,QACZ;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAClD;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QACnD;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QACnD;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QACnD;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAClD;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QACnD;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAClD;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAClD;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QACnD;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QACnD;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAClD;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,MACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAO,UAAU,IAAI,WAAW,KAAK,OAAO,IAAI,OAAK,IAAI,CAAC,CAAC;AAAA;AAAA,MAE3D,OAAO,kBAAkB,IAAI,WAAW;AAAA,QACpC;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,MACb,CAAC;AAAA,MACD,OAAO,IAAI,IAAI,YAAY,EAAE;AAAA,MAC7B,OAAO,IAAI,IAAI,YAAY,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAM7B,OAAO,QAAQ,GAAG,GAAG,GAAG;AACpB,YAAI,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AACnB,YAAI,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;AAC3B,YAAI,MAAM,YAAa;AACnB;AAAA,QACJ;AACA,UAAE,CAAC,IAAI;AACP,UAAE,IAAI,CAAC,IAAI;AAAA,MACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAO,QAAQ,GAAG,GAAG,IAAI,IAAI;AACzB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,KAAK,GAAG;AACR,gBAAM;AAAA,QACV;AACA,YAAI,KAAK,EAAE,IAAI,CAAC,IAAI;AACpB,YAAI,MAAM,YAAa;AACnB;AAAA,QACJ;AACA,UAAE,CAAC,IAAI;AACP,UAAE,IAAI,CAAC,IAAI;AAAA,MACf;AAAA;AAAA,MAEA,OAAO,UAAU,KAAK,GAAG;AACrB,eAAQ,IAAI,CAAC,IACR,IAAI,IAAI,CAAC,KAAK,IACd,IAAI,IAAI,CAAC,KAAK,KACd,IAAI,IAAI,CAAC,KAAK;AAAA,MACvB;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,OAAO,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI;AAC7B,YAAI,KAAK,SAAQ,EAAE,EAAE;AACrB,YAAI,KAAK,SAAQ,EAAE,KAAK,CAAC;AACzB,YAAI,KAAK,SAAQ,EAAE,EAAE;AACrB,YAAI,KAAK,SAAQ,EAAE,KAAK,CAAC;AACzB,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,CAAC;AAC/B,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,IAAI,EAAE;AAEpC,YAAI,OAAO,SAAQ,EAAE,CAAC,IAAI,SAAQ,EAAE,CAAC;AACrC,YAAI,OAAO,SAAQ,EAAE,IAAI,CAAC,IAAI,SAAQ,EAAE,IAAI,CAAC;AAC7C,iBAAQ,EAAE,CAAC,IAAI;AACf,iBAAQ,EAAE,IAAI,CAAC,IAAI;AACnB,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,CAAC;AAE/B,eAAO,SAAQ,EAAE,CAAC,IAAI,SAAQ,EAAE,CAAC;AACjC,eAAO,SAAQ,EAAE,IAAI,CAAC,IAAI,SAAQ,EAAE,IAAI,CAAC;AACzC,iBAAQ,EAAE,CAAC,IAAK,SAAS,KAAO,QAAQ;AACxC,iBAAQ,EAAE,IAAI,CAAC,IAAK,SAAS,KAAO,QAAQ;AAC5C,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,CAAC;AAC/B,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,IAAI,EAAE;AAEpC,eAAO,SAAQ,EAAE,CAAC,IAAI,SAAQ,EAAE,CAAC;AACjC,eAAO,SAAQ,EAAE,IAAI,CAAC,IAAI,SAAQ,EAAE,IAAI,CAAC;AACzC,iBAAQ,EAAE,CAAC,IAAK,SAAS,KAAO,QAAQ;AACxC,iBAAQ,EAAE,IAAI,CAAC,IAAK,SAAS,KAAO,QAAQ;AAC5C,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,CAAC;AAE/B,eAAO,SAAQ,EAAE,CAAC,IAAI,SAAQ,EAAE,CAAC;AACjC,eAAO,SAAQ,EAAE,IAAI,CAAC,IAAI,SAAQ,EAAE,IAAI,CAAC;AACzC,iBAAQ,EAAE,CAAC,IAAK,SAAS,KAAO,QAAQ;AACxC,iBAAQ,EAAE,IAAI,CAAC,IAAK,SAAS,KAAO,QAAQ;AAAA,MAChD;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,OAAO,gBAAgB,KAAKA,OAAM;AAC9B,YAAI,IAAI;AAER,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,mBAAQ,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;AACtB,mBAAQ,EAAE,IAAI,EAAE,IAAI,SAAQ,aAAa,CAAC;AAAA,QAC9C;AAEA,iBAAQ,EAAE,EAAE,IAAI,SAAQ,EAAE,EAAE,IAAI,IAAI;AACpC,iBAAQ,EAAE,EAAE,IAAI,SAAQ,EAAE,EAAE,IAAK,IAAI,IAAI;AAGzC,YAAIA,OAAM;AACN,mBAAQ,EAAE,EAAE,IAAI,CAAC,SAAQ,EAAE,EAAE;AAC7B,mBAAQ,EAAE,EAAE,IAAI,CAAC,SAAQ,EAAE,EAAE;AAAA,QACjC;AAEA,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,mBAAQ,EAAE,CAAC,IAAI,SAAQ,UAAU,IAAI,GAAG,IAAI,CAAC;AAAA,QACjD;AAEA,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,mBAAQ,MAAM,GAAG,GAAG,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,CAAC,GAAG,SAAQ,QAAQ,IAAI,KAAK,CAAC,CAAC;AACpF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,CAAC,GAAG,SAAQ,QAAQ,IAAI,KAAK,CAAC,CAAC;AACrF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,CAAC,GAAG,SAAQ,QAAQ,IAAI,KAAK,CAAC,CAAC;AACrF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,CAAC,GAAG,SAAQ,QAAQ,IAAI,KAAK,CAAC,CAAC;AACrF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,CAAC,GAAG,SAAQ,QAAQ,IAAI,KAAK,CAAC,CAAC;AACrF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,EAAE,GAAG,SAAQ,QAAQ,IAAI,KAAK,EAAE,CAAC;AACvF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,EAAE,GAAG,SAAQ,QAAQ,IAAI,KAAK,EAAE,CAAC;AACvF,mBAAQ,MAAM,GAAG,GAAG,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,EAAE,GAAG,SAAQ,QAAQ,IAAI,KAAK,EAAE,CAAC;AAAA,QAC1F;AACA,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,cAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,SAAQ,EAAE,CAAC,IAAI,SAAQ,EAAE,IAAI,EAAE;AAAA,QACzD;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,OAAO,cAAc,KAAK,OAAO;AAC7B,iBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,cAAI,IAAI,MAAM,KAAK;AACf,gBAAI,KAAK,IAAI;AACb,qBAAQ,gBAAgB,KAAK,KAAK;AAClC,gBAAI,IAAI;AAAA,UACZ;AACA,cAAI,EAAE,IAAI,GAAG,IAAI,MAAM,CAAC;AAAA,QAC5B;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,OAAO,aAAa,KAAK,KAAK;AAC1B,YAAI,KAAK,IAAI;AACb,eAAO,IAAI,IAAI,KAAK;AAChB,cAAI,EAAE,IAAI,GAAG,IAAI;AAAA,QACrB;AACA,iBAAQ,gBAAgB,KAAK,IAAI;AACjC,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,cAAI,CAAC,IAAI,IAAI,EAAE,KAAK,CAAC,KAAM,KAAK,IAAI;AAAA,QACxC;AACA,eAAO;AAAA,MACX;AAAA,MACA,OAAO,SAAS,KAAK;AACjB,YAAI,MAAM;AACV,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC5B,iBAAO,SAAQ,MAAM,IAAI,CAAC,CAAC;AAC/B,eAAO;AAAA,MACX;AAAA,MACA,OAAO,MAAM,GAAG;AACZ,YAAI,OAAO,MAAM;AACb,gBAAM,IAAI,UAAU,+CAA+C,OAAO,CAAC,EAAE;AACjF,YAAI,IAAI,KAAK,IAAI;AACb,gBAAM,IAAI,WAAW,uCAAuC,CAAC,EAAE;AACnE,eAAO,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAAA,MACzC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,YAAY,QAAQ,KAAK,MAAM,UAAU,UAAU;AAC/C,YAAI,aAAa,MAAM;AACnB,cAAI,SAAS,SAAQ;AACjB,kBAAM,IAAI,WAAW,sBAAsB,SAAQ,SAAS,YAAY,MAAM,EAAE;AACpF,cAAI,SAAS,SAAQ;AACjB,kBAAM,IAAI,WAAW,qBAAqB,SAAQ,SAAS,YAAY,MAAM,EAAE;AACnF,cAAI,OAAO,MAAM;AACb,gBAAI,EAAE,eAAe;AACjB,oBAAM,IAAI,UAAU,kCAAkC;AAC1D,gBAAI,IAAI,SAAS,SAAQ;AACrB,oBAAM,IAAI,WAAW,mBAAmB,SAAQ,YAAY,YAAY,IAAI,MAAM,EAAE;AACxF,gBAAI,IAAI,SAAS,SAAQ;AACrB,oBAAM,IAAI,WAAW,mBAAmB,SAAQ,YAAY,YAAY,IAAI,MAAM,EAAE;AAAA,UAC5F;AACA,cAAI,QAAQ,MAAM;AACd,gBAAI,EAAE,gBAAgB;AAClB,oBAAM,IAAI,UAAU,mCAAmC;AAC3D,gBAAI,KAAK,WAAW,SAAQ;AACxB,oBAAM,IAAI,WAAW,iBAAiB,SAAQ,SAAS,kBAAkB,KAAK,MAAM,QAAQ;AAAA,UACpG;AACA,cAAI,YAAY,MAAM;AAClB,gBAAI,EAAE,oBAAoB;AACtB,oBAAM,IAAI,UAAU,uCAAuC;AAC/D,gBAAI,SAAS,WAAW,SAAQ;AAC5B,oBAAM,IAAI,WAAW,qBAAqB,SAAQ,aAAa,kBAAkB,SAAS,MAAM,QAAQ;AAAA,UAChH;AAAA,QACJ;AACA,aAAK,IAAI,IAAI,WAAW,GAAG;AAC3B,aAAK,IAAI,IAAI,YAAY,EAAE;AAC3B,aAAK,IAAI;AACT,aAAK,IAAI;AACT,aAAK,SAAS;AAEd,iBAAQ,gBAAgB,KAAK,CAAC;AAE9B,iBAAQ,gBAAgB,CAAC,IAAI;AAC7B,YAAI;AACA,mBAAQ,gBAAgB,CAAC,IAAI,IAAI;AACrC,iBAAQ,gBAAgB,CAAC,IAAI;AAC7B,iBAAQ,gBAAgB,CAAC,IAAI;AAC7B,YAAI;AACA,mBAAQ,gBAAgB,IAAI,MAAM,EAAE;AACxC,YAAI;AACA,mBAAQ,gBAAgB,IAAI,UAAU,EAAE;AAE5C,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,eAAK,EAAE,CAAC,IAAI,SAAQ,aAAa,CAAC,IAAI,SAAQ,UAAU,SAAQ,iBAAiB,IAAI,CAAC;AAAA,QAC1F;AAEA,YAAI,KAAK;AACL,mBAAQ,cAAc,MAAM,GAAG;AAE/B,eAAK,IAAI;AAAA,QACb;AAAA,MACJ;AAAA,MACA,OAAO,OAAO;AACV,YAAI,EAAE,iBAAiB;AACnB,gBAAM,IAAI,UAAU,oCAAoC;AAC5D,iBAAQ,cAAc,MAAM,KAAK;AACjC,eAAO;AAAA,MACX;AAAA,MACA,OAAO,KAAK;AACR,cAAM,MAAO,CAAC,OAAO,QAAQ,YAAY,QAAQ,QAAS,IAAI,WAAW,KAAK,MAAM,IAAI;AACxF,YAAI,EAAE,eAAe;AACjB,gBAAM,IAAI,UAAU,oDAAoD;AAC5E,YAAI,IAAI,SAAS,KAAK;AAClB,gBAAM,IAAI,WAAW,8CAA8C;AACvE,iBAAQ,aAAa,MAAM,GAAG;AAC9B,YAAI,QAAQ;AACR,iBAAO,SAAQ,SAAS,GAAG;AAC/B,eAAO;AAAA,MACX;AAAA,IACJ;AACA,IAAO,kBAAQ,QAAQ,SAAS;AAAA;AAAA;;;AChThC,IAEa,oBACA,aACA,UACA,kBACA,eACA,iBACA,cACA,iBAEA,UACA,QACA,eACA,mBACA,qBAEA,mBACA,gBAEA,qBAaA;AAjCb;AAAA;AAAA;AAEO,IAAM,qBAAqB;AAC3B,IAAM,cAAc;AACpB,IAAM,WAAW;AACjB,IAAM,mBAAmB;AACzB,IAAM,gBAAgB;AACtB,IAAM,kBAAkB;AACxB,IAAM,eAAe;AACrB,IAAM,kBAAkB;AAExB,IAAM,WAAW;AACjB,IAAM,SAAS;AACf,IAAM,gBAAgB;AACtB,IAAM,oBAAoB;AAC1B,IAAM,sBAAsB;AAE5B,IAAM,oBAAoB;AAC1B,IAAM,iBAAiB;AAEvB,IAAM,sBAAsB,OAAO,OAAO;AAAA,MAC7C,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,IACZ,CAAC;AACM,IAAM,QAAQ,OAAO,OAAO;AAAA,MAC/B,KAAK;AAAA,MACL,KAAK;AAAA,MACL,OAAO;AAAA,MACP,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,OAAO;AAAA,MACP,OAAO;AAAA,IACX,CAAC;AAAA;AAAA;;;AC3CD,IAGa,QA0CA,KA0BA,QAgDA,OA8EA,KAiEA,KAkCA;AAxSb;AAAA;AAAA;AAEA;AACO,IAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOlB,QAAQC,SAAQ;AACZ,cAAM,WAAYA,QAAO,SAAS,IAAK;AACvC,cAAM,SAAS,aAAa,IACtB,IACA,IAAI;AACV,YAAI,OAAO;AACX,YAAI,QAAQ;AACZ,YAAI,QAAQ;AACZ,YAAI,SAAS,IAAI,WAAW,KAAK,KAAMA,QAAO,SAAS,IAAK,CAAC,CAAC;AAC9D,iBAAS,IAAI,GAAG,IAAIA,QAAO,QAAQ,KAAK;AACpC,kBAAS,SAAS,IAAK,SAAS,QAAQA,QAAO,CAAC,CAAC;AACjD,kBAAQ;AACR,cAAI,QAAQ,GAAG;AACX,mBAAO,OAAO,IAAK,UAAW,OAAO,SAAS,IAAM;AACpD,oBAAQ;AAAA,UACZ;AAAA,QACJ;AACA,YAAI,OAAO,GAAG;AACV,iBAAO,OAAO,IAAK,SAAU,OAAO,SAAS,IAAM;AAAA,QACvD;AACA,YAAI,aAAa,GAAG;AAChB,mBAAS,OAAO,MAAM,CAAC;AAAA,QAC3B;AACA,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,SAAQ;AACV,eAAO,MAAM,MAAM,KAAK,QAAQA,OAAM,CAAC;AAAA,MAC3C;AAAA,IACJ;AACO,IAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOf,QAAQC,MAAK;AACT,cAAMC,SAAQ,CAAC;AACf,eAAOD,KAAI,SAAS,GAAG;AACnB,gBAAM,OAAOA,KAAI,UAAU,GAAG,CAAC;AAC/B,UAAAC,OAAM,KAAK,SAAS,MAAM,CAAC,CAAC;AAC5B,UAAAD,OAAMA,KAAI,UAAU,CAAC;AAAA,QACzB;AACA,eAAO,IAAI,WAAWC,MAAK;AAAA,MAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMD,MAAK;AACP,eAAO,SAASA,MAAK,CAAC,EAAE,SAAS,EAAE;AAAA,MACvC;AAAA,IACJ;AACO,IAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOlB,SAASE,SAAQ;AACb,eAAO,MAAM,SAAS,IAAI,WAAWA,OAAM,CAAC;AAAA,MAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,SAAQ;AACV,eAAO,MAAM,MAAM,IAAI,WAAWA,OAAM,CAAC;AAAA,MAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAMA,SAAQ;AACV,eAAO,MAAM,MAAM,IAAI,WAAWA,OAAM,CAAC;AAAA,MAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,SAAQ;AACV,eAAO,MAAM,MAAM,IAAI,WAAWA,OAAM,CAAC;AAAA,MAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAOA,SAAQ;AACX,eAAO,MAAM,OAAO,IAAI,WAAWA,OAAM,CAAC;AAAA,MAC9C;AAAA,IACJ;AACO,IAAM,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOjB,SAASD,QAAO;AACZ,cAAM,WAAYA,OAAM,SAAS,IAAK;AACtC,cAAM,SAAS,aAAa,IACtB,IACA,IAAI;AACV,YAAI,QAAQ;AACZ,YAAI,SAAS;AACb,YAAI,OAAO;AACX,iBAAS,IAAI,GAAG,IAAIA,OAAM,QAAQ,KAAK;AACnC,kBAAS,SAAS,IAAKA,OAAM,CAAC;AAC9B,kBAAQ;AACR,iBAAO,QAAQ,GAAG;AACd,sBAAU,SAAU,UAAW,OAAO,SAAS,IAAM,EAAE;AACvD,oBAAQ;AAAA,UACZ;AAAA,QACJ;AACA,YAAI,OAAO,GAAG;AACV,oBAAU,SAAU,SAAU,KAAK,OAAO,UAAY,EAAE;AAAA,QAC5D;AACA,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,QAAO;AACT,eAAO,CAAC,GAAGA,MAAK,EAAE,IAAI,OAAK,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE,KAAK,EAAE;AAAA,MACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAMA,QAAO;AACT,cAAM,WAAW,CAAC;AAClB,QAAAA,OAAM,QAAQ,EAAE,QAAQ,OAAK,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC;AACrD,YAAI,UAAU;AACd,iBAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACtC,qBAAW,SAAS,CAAC,KAAK,OAAO,IAAI,CAAC;AAAA,QAC1C;AACA,YAAI,UAAU,mBAAmB;AAC7B,iBAAO;AAAA,QACX,OACK;AACD,iBAAO,OAAO,OAAO;AAAA,QACzB;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,QAAO;AACT,cAAM,YAAY,CAAC,GAAGA,MAAK,EAAE,IAAI,UAAQ,KAAK,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAC3E,eAAO,UAAU,KAAK,EAAE,EAAE,YAAY;AAAA,MAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAOA,QAAO;AACV,eAAO,IAAI,YAAY,EAAE,OAAOA,MAAK;AAAA,MACzC;AAAA,IACJ;AACO,IAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQf,MAAM,SAAS,UAAU,GAAG;AACxB,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,iBAAiB;AAAA,QACzC;AACA,YAAI;AACA,iBAAO,OAAO,OAAO,EAChB,SAAS,CAAC,EACV,SAAS,SAAS,GAAG;AAAA,QAC9B,SACO,KAAK;AACR,gBAAM,IAAI,WAAW,yBAAyB;AAAA,QAClD;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,SAAS,UAAU,GAAG;AAC1B,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,iBAAiB;AAAA,QACzC;AACA,YAAI,UAAU,OAAO,OAAO;AAC5B,cAAMA,SAAQ,CAAC;AACf,eAAO,UAAU,GAAG;AAChB,gBAAM,MAAM,OAAO,QAAQ,GAAG,OAAO;AACrC,UAAAA,OAAM,KAAK,OAAO,GAAG,CAAC;AACtB,sBAAY;AAAA,QAChB;AACA,cAAM,SAAS,IAAI,WAAW,KAAK,IAAI,SAASA,OAAM,MAAM,CAAC;AAC7D,eAAO,IAAIA,MAAK;AAChB,eAAQ,OAAO,QAAQ;AAAA,MAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,SAAS,UAAU,GAAG;AACxB,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,iBAAiB;AAAA,QACzC;AACA,YAAI;AACA,iBAAO,OAAO,OAAO,EAChB,SAAS,EAAE,EACX,SAAS,SAAS,GAAG,EACrB,YAAY;AAAA,QACrB,SACO,KAAK;AACR,gBAAM,IAAI,WAAW,yBAAyB;AAAA,QAClD;AAAA,MACJ;AAAA,IACJ;AACO,IAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOf,MAAME,MAAK;AACP,eAAO,CAAC,GAAGA,IAAG,EAAE,IAAI,OAAK,IAAI,MAAM,SAAS,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE;AAAA,MACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQA,MAAK,UAAU,GAAG;AACtB,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,8CAA8C;AAAA,QACtE;AACA,cAAM,WAAWA,KAAI,MAAM,SAAS;AACpC,YAAI,CAAC,eAAe,KAAKA,IAAG,KAAK,YAAY,MAAM;AAC/C,kBAAQ,KAAK,6CAA6C;AAC1D,iBAAO,IAAI,WAAW;AAAA,QAC1B,OACK;AACD,gBAAMF,SAAQ,WAAW,KAAK,SAAS,IAAI,UAAQ,SAAS,MAAM,EAAE,CAAC,CAAC;AACtE,gBAAM,SAAS,IAAI,WAAW,KAAK,IAAI,SAASA,OAAM,MAAM,CAAC;AAC7D,iBAAO,IAAIA,OAAM,QAAQ,CAAC;AAC1B,iBAAO,OAAO,QAAQ;AAAA,QAC1B;AAAA,MACJ;AAAA,IACJ;AACO,IAAM,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOhB,QAAQG,OAAM;AACV,eAAO,IAAI,YAAY,EAAE,OAAOA,KAAI;AAAA,MACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,OAAM;AACR,eAAO,MAAM,MAAM,KAAK,QAAQA,KAAI,CAAC;AAAA,MACzC;AAAA,IACJ;AAAA;AAAA;;;AC3TA,IASa;AATb;AAAA;AAAA;AASO,IAAM,MAAN,MAAU;AAAA,MACb;AAAA,MACA;AAAA,MACA,YAAY,KAAK,YAAY;AACzB,aAAK,KAAK,IAAI,IAAI,GAAG;AACrB,aAAK,GAAG,WAAW;AACnB,aAAK,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAM,KAAK,QAAQ,MAAM;AACrB,YAAIC,WAAUA,YAAW;AACzB,aAAK,UAAU,MAAM;AACrB,cAAM,UAAU,CAAC;AACjB,gBAAQ,cAAc,IAAI;AAC1B,YAAI,KAAK,MAAMA,UAAS,KAAK,qBAAqB;AAC9C,kBAAQ,KAAK,EAAE,IAAIA,SAAQ,IAAI;AAAA,QACnC;AACA,iBAAS,CAAC;AACV,aAAK,SAAS,OAAO,YAAY;AACjC,cAAM,OAAO,KAAK,UAAU,IAAI,EAC3B,WAAW,KAAK,SAAS,EACzB,WAAW,KAAK,SAAS,EACzB,WAAW,KAAK,SAAS,EACzB,WAAW,MAAM,SAAS;AAC/B,cAAM,MAAM,IAAI,QAAQ,KAAK,IAAI;AAAA,UAC7B,QAAQ;AAAA,UACR;AAAA,UACA;AAAA,QACJ,CAAC;AACD,YAAI;AACA,gBAAM,MAAM,MAAM,MAAM,GAAG;AAC3B,iBAAO,MAAM,IAAI,KAAK;AAAA,QAC1B,SACO,KAAK;AACR,kBAAQ,MAAM,GAAG;AACjB,iBAAO,KAAK,UAAU,GAAG;AAAA,QAC7B;AAAA,MACJ;AAAA,MACA,UAAU,QAAQ;AACd,YAAI,CAAC,QAAQ;AACT,gBAAM,IAAI,eAAe,6BAA6B;AAAA,QAC1D;AACA,YAAI,OAAO,WAAW,UAAU;AAC5B,gBAAM,IAAI,UAAU,6BAA6B;AAAA,QACrD;AACA,YAAI,CAAC,2BAA2B,KAAK,MAAM,GAAG;AAC1C,gBAAM,IAAI,UAAU,wCAAwC;AAAA,QAChE;AAAA,MACJ;AAAA,IACJ;AAAA;AAAA;;;AC/DA,IAGQC,SACF,KACA,KACA,KAUO;AAhBb;AAAA;AAAA;AAEA;AACA,KAAM,EAAE,QAAAA,YAAW;AACnB,IAAM,MAAM;AACZ,IAAM,MAAM;AACZ,IAAM,MAAM;AAUL,IAAM,UAAN,MAAM,SAAQ;AAAA,MACjB,OAAO,cAAc;AAAA,MACrB;AAAA,MACA,IAAI,OAAO;AAAE,eAAO,MAAM,MAAM,KAAK,MAAM;AAAA,MAAG;AAAA,MAC9C,IAAI,SAAS;AAAE,eAAO,KAAK,OAAO;AAAA,MAAQ;AAAA,MAC1C,IAAI,QAAQ;AAAE,eAAO,KAAK;AAAA,MAAQ;AAAA,MAClC,IAAI,MAAM;AAAE,eAAO,MAAM,MAAM,KAAK,MAAM;AAAA,MAAG;AAAA,MAC7C,YAAYC,QAAO;AACf,YAAI,CAAC,SAAQ,aAAa;AACtB,gBAAM,IAAI,MAAM,gFAAgF;AAAA,QACpG;AACA,iBAAQ,cAAc;AACtB,aAAK,SAASA;AAAA,MAClB;AAAA,MACA,aAAa,OAAO,MAAM;AACtB,eAAO,IAAI,QAAQ,aAAW;AAC1B,cAAI,QAAQ,MAAM;AACd,gBAAI,OAAO,SAAS,UAAU;AAC1B,oBAAM,IAAI,UAAU,sBAAsB,OAAO,IAAI,YAAY;AAAA,YACrE;AACA,gBAAI,OAAO,OAAO,OAAO,KAAK;AAC1B,oBAAM,IAAI,WAAW,mBAAmB,GAAG,IAAI,GAAG,QAAQ;AAAA,YAC9D;AACA,gBAAI,OAAO,QAAQ,GAAG;AAClB,oBAAM,IAAI,WAAW,iCAAiC,GAAG,QAAQ;AAAA,YACrE;AAAA,UACJ;AACA,mBAAQ,cAAc;AACtB,kBAAQ,IAAI,KAAKD,QAAO,gBAAgB,IAAI,WAAW,QAAQ,GAAG,CAAC,CAAC,CAAC;AAAA,QACzE,CAAC;AAAA,MACL;AAAA,MACA,aAAa,OAAO,OAAO;AACvB,eAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,cAAI,OAAO,UAAU,UAAU;AAC3B,gBAAI,MAAM,SAAS,MAAM,KAAK,MAAM,SAAS,MAAM,GAAG;AAClD,oBAAM,IAAI,WAAW,mBAAmB,MAAM,CAAC,IAAI,MAAM,CAAC,aAAa;AAAA,YAC3E;AACA,gBAAI,MAAM,SAAS,MAAM,MAAM,GAAG;AAC9B,oBAAM,IAAI,WAAW,iCAAiC,MAAM,CAAC,aAAa;AAAA,YAC9E;AACA,gBAAI,CAAC,kBAAkB,KAAK,KAAK,GAAG;AAChC,oBAAM,IAAI,WAAW,iDAAiD;AAAA,YAC1E;AACA,qBAAQ,cAAc;AACtB,oBAAQ,IAAI,KAAK,IAAI,QAAQ,KAAK,CAAC,CAAC;AAAA,UACxC;AACA,cAAI,iBAAiB,aAAa;AAC9B,gBAAI,MAAM,aAAa,OAAO,MAAM,aAAa,KAAK;AAClD,oBAAM,IAAI,MAAM,mBAAmB,GAAG,IAAI,GAAG,QAAQ;AAAA,YACzD;AACA,gBAAI,MAAM,aAAa,QAAQ,GAAG;AAC9B,oBAAM,IAAI,WAAW,iCAAiC,GAAG,QAAQ;AAAA,YACrE;AACA,qBAAQ,cAAc;AACtB,oBAAQ,IAAI,KAAK,IAAI,WAAW,KAAK,CAAC,CAAC;AAAA,UAC3C;AACA,cAAI,iBAAiB,YAAY;AAC7B,gBAAI,MAAM,SAAS,OAAO,MAAM,SAAS,KAAK;AAC1C,oBAAM,IAAI,MAAM,mBAAmB,GAAG,IAAI,GAAG,QAAQ;AAAA,YACzD;AACA,gBAAI,MAAM,SAAS,QAAQ,GAAG;AAC1B,oBAAM,IAAI,WAAW,iCAAiC,GAAG,QAAQ;AAAA,YACrE;AACA,qBAAQ,cAAc;AACtB,oBAAQ,IAAI,KAAK,KAAK,CAAC;AAAA,UAC3B;AACA,iBAAO,IAAI,UAAU,yBAAyB,OAAO,KAAK,EAAE,CAAC;AAAA,QACjE,CAAC;AAAA,MACL;AAAA;AAAA;AAAA;AAAA,MAIA,UAAU;AACN,YAAI;AACA,UAAAA,QAAO,gBAAgB,KAAK,MAAM;AAClC,iBAAO;AAAA,QACX,SACO,KAAK;AACR,iBAAO;AAAA,QACX;AAAA,MACJ;AAAA,IACJ;AAAA;AAAA;;;ACjGA,IAIQ,QACF,SACO;AANb;AAAA;AAAA;AAEA;AACA;AACA,KAAM,EAAE,WAAW,WAAW;AAC9B,IAAM,UAAU;AACT,IAAM,OAAN,MAAW;AAAA,MACd;AAAA,MACA,cAAc;AACV,aAAK,WAAW,WAAW;AAAA,MAC/B;AAAA,MACA,MAAM,IAAI,MAAM,SAAS,MAAM;AAC3B,YAAI,KAAK,SAAS,QAAQ,IAAI,GAAG;AAC7B,gBAAM,IAAI,MAAM,OAAO;AAAA,QAC3B;AACA,eAAO,KAAK,UAAU,MAAM,SAAS,IAAI;AAAA,MAC7C;AAAA,MACA,MAAM,UAAU,MAAM,SAAS,MAAM;AACjC,YAAI,KAAK,YAAY,MAAM,SAAS,IAAI,GAAG;AACvC,gBAAM,IAAI,MAAM,OAAO;AAAA,QAC3B;AACA,cAAM,KAAK,MAAM,QAAQ,OAAO;AAChC,YAAI,OAAO,YAAY,UAAU;AAC7B,cAAI;AACA,sBAAU,MAAM,OAAO,UAAU,OAAO,KAAK,QAAQ,OAAO,GAAG,UAAU,OAAO,CAAC,cAAc,WAAW,CAAC;AAC3G,sBAAU,MAAM,OAAO,UAAU,EAAE,MAAM,UAAU,MAAM,WAAW,MAAM,GAAG,OAAO,YAAY,KAAO,GAAG,SAAS,EAAE,MAAM,WAAW,QAAQ,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC;AAAA,UAC3K,SACO,KAAK;AACR,kBAAM,IAAI,MAAM,OAAO;AAAA,UAC3B;AAAA,QACJ;AACA,YAAI;AACA,cAAI,OAAO,SAAS,UAAU;AAC1B,mBAAO,KAAK,SAAS;AAAA,UACzB;AACA,iBAAO,KAAK,UAAU,IAAI;AAC1B,gBAAM,UAAU,KAAK,QAAQ,IAAI;AACjC,gBAAM,YAAY,MAAM,OAAO,QAAQ,EAAE,MAAM,WAAW,IAAI,GAAG,OAAO,GAAG,SAAS,OAAO;AAC3F,gBAAM,SAAS;AAAA,YACX,WAAW,OAAO,MAAM,SAAS;AAAA,YACjC,IAAI,GAAG;AAAA,UACX;AACA,gBAAM,IAAI,QAAQ,CAAC,SAAS,WAAW;AACnC,gBAAI;AACA,mBAAK,SAAS,QAAQ,MAAM,KAAK,UAAU,MAAM,CAAC;AAClD,sBAAQ;AAAA,YACZ,SACO,KAAK;AACR,qBAAO,GAAG;AAAA,YACd;AAAA,UACJ,CAAC;AACD,oBAAU;AAAA,QACd,SACO,KAAK;AACR,gBAAM,IAAI,MAAM,OAAO;AAAA,QAC3B;AACA,eAAQ,KAAK,SAAS,QAAQ,IAAI,KAAK;AAAA,MAC3C;AAAA,MACA,MAAM,IAAI,MAAM,SAAS;AACrB,YAAI,KAAK,YAAY,MAAM,OAAO,GAAG;AACjC,iBAAO;AAAA,QACX;AACA,cAAM,OAAO,MAAM,IAAI,QAAQ,aAAW;AACtC,kBAAQ,KAAK,SAAS,QAAQ,IAAI,CAAC;AAAA,QACvC,CAAC;AACD,YAAI,QAAQ,MAAM;AACd,iBAAO;AAAA,QACX;AACA,cAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,cAAM,YAAY,IAAI,QAAQ,OAAO,SAAS;AAC9C,cAAM,KAAK,MAAM,QAAQ,OAAO,OAAO,EAAE;AACzC,YAAI;AACA,cAAI,OAAO,YAAY,UAAU;AAC7B,sBAAU,MAAM,OAAO,UAAU,OAAO,KAAK,QAAQ,OAAO,GAAG,UAAU,OAAO,CAAC,cAAc,WAAW,CAAC;AAC3G,sBAAU,MAAM,OAAO,UAAU,EAAE,MAAM,UAAU,MAAM,WAAW,MAAM,GAAG,OAAO,YAAY,KAAO,GAAG,SAAS,EAAE,MAAM,WAAW,QAAQ,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC;AAAA,UAC3K;AAAA,QACJ,SACO,KAAK;AACR,iBAAO;AAAA,QACX;AACA,YAAI;AACA,gBAAM,YAAY,MAAM,OAAO,QAAQ,EAAE,MAAM,WAAW,IAAI,GAAG,OAAO,GAAG,SAAS,SAAS;AAC7F,gBAAM,UAAU,OAAO,OAAO,SAAS;AACvC,gBAAM,OAAO,KAAK,MAAM,OAAO;AAC/B,oBAAU;AACV,eAAK,SAAS,WAAW,IAAI;AAC7B,iBAAO;AAAA,QACX,SACO,KAAK;AACR,iBAAO;AAAA,QACX;AAAA,MACJ;AAAA,MACA,YAAY,MAAM,SAAS,MAAM;AAC7B,YAAI,OAAO,SAAS,YAAY,SAAS,IAAI;AACzC,iBAAO;AAAA,QACX;AACA,YAAI,OAAO,YAAY,YAAY,YAAY,IAAI;AAC/C,cAAI,EAAE,mBAAmB,YAAY;AACjC,mBAAO;AAAA,UACX;AAAA,QACJ;AACA,YAAI,OAAO,SAAS,UAAU;AAC1B,cAAI;AACA,iBAAK,UAAU,IAAI;AAAA,UACvB,SACO,KAAK;AACR,mBAAO;AAAA,UACX;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AAAA,IACJ;AAAA;AAAA;;;AC/GA,IAKa,MA4HA;AAjIb;AAAA;AAAA;AAKO,IAAM,OAAN,MAAM,MAAK;AAAA,MACd,OAAO,SAAS,KAAK,IAAI,GAAG,UAAU,sBAAsB,CAAC;AAAA,MAC7D,SAAS,CAAC;AAAA,MACV,WAAW,CAAC;AAAA,MACZ;AAAA,MACA,IAAI,cAAc;AACd,YAAI,IAAI;AACR,mBAAW,UAAU,KAAK,UAAU;AAChC,eAAK,EAAE,OAAO,OAAO;AAAA,QACzB;AACA,eAAO;AAAA,MACX;AAAA,MACA,IAAI,cAAc;AACd,YAAI,IAAI;AACR,mBAAW,UAAU,KAAK,UAAU;AAChC,eAAK,EAAE,OAAO,OAAO;AAAA,QACzB;AACA,eAAO;AAAA,MACX;AAAA,MACA,MAAM,OAAO,MAAM;AACf,YAAI,EAAE,gBAAgB,eAAe,MAAM,QAAQ,IAAI;AACnD,iBAAO,CAAC,IAAI;AAChB,eAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,gBAAM,MAAM;AAAA,YACR,IAAI,YAAY,IAAI;AAAA,YACpB,SAAS,CAAC;AAAA,YACV;AAAA,YACA;AAAA,YACA;AAAA,UACJ;AACA,cAAI,KAAK,OAAO,SAAS,GAAG;AACxB,iBAAK,OAAO,KAAK,GAAG;AAAA,UACxB,OACK;AACD,uBAAW,UAAU,KAAK;AACtB,mBAAK,QAAQ,QAAQ,GAAG;AAAA,UAChC;AAAA,QACJ,CAAC;AAAA,MACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,YAAY,QAAQ,QAAQ,GAAG;AAC3B,gBAAQ,KAAK,IAAI,MAAK,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC;AACtE,aAAK,OAAO,IAAI,gBAAgB,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE,MAAM,kBAAkB,CAAC,CAAC;AAC/E,iBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,gBAAM,SAAS;AAAA,YACX,QAAQ,IAAI,OAAO,KAAK,MAAM,EAAE,MAAM,SAAS,CAAC;AAAA,YAChD,KAAK;AAAA,UACT;AACA,iBAAO,OAAO,iBAAiB,WAAW,aAAW;AACjD,gBAAI,SAAS,KAAK,MAAM,IAAI,YAAY,EAAE,OAAO,QAAQ,IAAI,KAAK,IAAI;AACtE,gBAAI,CAAC,MAAM,QAAQ,MAAM;AACrB,uBAAS,CAAC,MAAM;AACpB,iBAAK,QAAQ,QAAQ,MAAM;AAAA,UAC/B,CAAC;AACD,eAAK,SAAS,KAAK,MAAM;AACzB,gBAAK,SAAS,KAAK,IAAI,GAAG,MAAK,SAAS,KAAK,SAAS,MAAM;AAAA,QAChE;AAAA,MACJ;AAAA,MACA,QAAQ,QAAQ,KAAK;AACjB,YAAI,IAAI,gBAAgB,aAAa;AACjC,cAAI,IAAI,KAAK,aAAa,GAAG;AACzB,mBAAO,MAAM;AACb,mBAAO,OAAO,YAAY,EAAE,QAAQ,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC;AAAA,UAC9D;AAAA,QACJ,OACK;AACD,gBAAM,QAAQ,IAAK,IAAI,KAAK,SAAS,KAAK;AAC1C,gBAAM,OAAO,IAAI,KAAK,MAAM,GAAG,KAAK;AACpC,cAAI,OAAO,IAAI,KAAK,MAAM,KAAK;AAC/B,cAAI,IAAI,KAAK,WAAW;AACpB,iBAAK,OAAO,MAAM;AACtB,cAAI,MAAM,SAAS,GAAG;AAClB,kBAAME,UAAS,IAAI,YAAY,EAAE,OAAO,KAAK,UAAU,IAAI,CAAC,EAAE;AAC9D,mBAAO,MAAM;AACb,mBAAO,OAAO,YAAY,EAAE,QAAAA,QAAO,GAAG,CAACA,OAAM,CAAC;AAAA,UAClD;AAAA,QACJ;AAAA,MACJ;AAAA,MACA,WAAW,OAAO;AACd,mBAAW,UAAU,KAAK,UAAU;AAChC,cAAI,OAAO,KAAK,OAAO;AACnB,mBAAO;AAAA,QACf;AACA,eAAO;AAAA,MACX;AAAA,MACA,QAAQ,QAAQ,SAAS;AACrB,YAAI,OAAO,OAAO,MAAM;AACpB,gBAAM,IAAI,MAAM,uDAAuD;AAAA,QAC3E;AACA,cAAM,MAAM,OAAO;AACnB,YAAI,KAAK,OAAO,SAAS,GAAG;AACxB,eAAK,QAAQ,QAAQ,KAAK,OAAO,CAAC,CAAC;AAAA,QACvC,OACK;AACD,iBAAO,MAAM;AAAA,QACjB;AACA,YAAI,QAAQ,SAAS,GAAG;AACpB,cAAI,QAAQ,KAAK,GAAG,OAAO;AAAA,QAC/B;AACA,YAAI,KAAK,WAAW,IAAI,EAAE,GAAG;AACzB,cAAI,QAAQ,IAAI,OAAO;AAAA,QAC3B;AAAA,MACJ;AAAA,IACJ;AAiBO,IAAM,kBAAN,MAAsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWzB,aAAa,KAAK,MAAM;AACpB,eAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC1C,mBAAS,KAAK,MAAM;AAChB,gBAAI;AACA,kBAAI,MAAM;AAAA,YACd,SACO,KAAK;AACR,qBAAO,GAAG;AAAA,YACd;AAAA,UACJ;AACA,kBAAQ,IAAI;AAAA,QAChB,CAAC;AAAA,MACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,OAAO,SAAS;AACnB,cAAMA,UAAS,IAAI,YAAY,EAAE,OAAO,KAAK,UAAU,OAAO,CAAC,EAAE;AAEjE,oBAAYA,SAAQ,CAACA,OAAM,CAAC;AAAA,MAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,OAAO,SAAS;AACZ,yBAAiB,WAAW,CAAC,YAAY;AACrC,gBAAM,EAAE,MAAM,QAAAA,QAAO,IAAI,QAAQ;AACjC,cAAI,SAAS,QAAQ;AACjB,kBAAM;AACN,kBAAMA,UAAS,IAAI,YAAY,CAAC;AAEhC,wBAAYA,SAAQ,CAACA,OAAM,CAAC;AAAA,UAChC,OACK;AACD,kBAAM,OAAO,KAAK,MAAM,IAAI,YAAY,EAAE,OAAOA,OAAM,CAAC;AACxD,iBAAK,KAAK,IAAI,EAAE,KAAK,KAAK,MAAM;AAAA,UACpC;AAAA,QACJ,CAAC;AAAA,MACL;AAAA,IACJ;AAAA;AAAA;;;AC7LA,IAgBa,UAo1BN;AAp2BP;AAAA;AAAA;AAGA;AACA;AAYO,IAAM,WAAN,MAAM,kBAAiB,gBAAgB;AAAA,MAC1C,OAAO;AACH,kBAAS,OAAO;AAAA,MACpB;AAAA,MACA,aAAa,KAAK,MAAM;AACpB,eAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC1C,mBAAS,KAAK,MAAM;AAChB,gBAAI;AACA,gBAAE,YAAY,MAAM,KAAK,QAAQ,EAAE,UAAU;AAAA,YACjD,SACO,KAAK;AACR,qBAAO,GAAG;AAAA,YACd;AAAA,UACJ;AACA,kBAAQ,IAAI;AAAA,QAChB,CAAC;AAAA,MACL;AAAA,MACA,OAAO,KAAK,SAAU,MAAM;AACxB,cAAM,IAAI,IAAI,aAAa,EAAE;AAC7B,YAAI;AACA,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ;AAC7B,cAAE,CAAC,IAAI,KAAK,CAAC;AACrB,eAAO;AAAA,MACX;AAAA,MACA,OAAO,MAAM,KAAK,GAAG;AAAA,MACrB,OAAO,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC;AAAA,MACxB,OAAO,IAAI,KAAK,GAAG,CAAC,OAAQ,MAAQ,OAAQ,OAAQ,OAAQ,OAAQ,MAAQ,KAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,KAAM,CAAC;AAAA,MACnJ,OAAO,KAAK,KAAK,GAAG,CAAC,OAAQ,MAAQ,OAAQ,OAAQ,OAAQ,OAAQ,MAAQ,KAAQ,OAAQ,OAAQ,OAAQ,MAAQ,OAAQ,OAAQ,OAAQ,IAAM,CAAC;AAAA,MACpJ,OAAO,IAAI,KAAK,GAAG,CAAC,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,IAAM,CAAC;AAAA,MACnJ,OAAO,IAAI,KAAK,GAAG,CAAC,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,KAAM,CAAC;AAAA,MACnJ,OAAO,IAAI,KAAK,GAAG,CAAC,OAAQ,OAAQ,MAAQ,OAAQ,OAAQ,OAAQ,MAAQ,OAAQ,OAAQ,OAAQ,KAAQ,OAAQ,OAAQ,OAAQ,MAAQ,KAAM,CAAC;AAAA,MACnJ,OAAO,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG;AACvB,YAAI,IAAI;AACR,iBAAS,IAAI,GAAG,IAAI,GAAG;AACnB,eAAK,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;AAC7B,gBAAQ,IAAM,IAAI,MAAO,KAAM;AAAA,MACnC;AAAA,MACA,OAAO,iBAAiB,GAAG,IAAI,GAAG,IAAI;AAClC,eAAO,KAAK,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE;AAAA,MACnC;AAAA,MACA,OAAO,SAAS,GAAG,GAAG;AAClB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC,IAAI;AAAA,MACtB;AAAA,MACA,OAAO,SAAS,GAAG;AACf,YAAI,GAAG,IAAI;AACX,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,cAAI,EAAE,CAAC,IAAI,IAAI;AACf,cAAI,KAAK,MAAM,IAAI,KAAK;AACxB,YAAE,CAAC,IAAI,IAAI,IAAI;AAAA,QACnB;AACA,UAAE,CAAC,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,MAC9B;AAAA,MACA,OAAO,SAAS,GAAG,GAAG,GAAG;AACrB,YAAI;AACJ,cAAM,IAAI,EAAE,IAAI;AAChB,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,cAAI,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AACnB,YAAE,CAAC,KAAK;AACR,YAAE,CAAC,KAAK;AAAA,QACZ;AAAA,MACJ;AAAA,MACA,OAAO,UAAU,GAAG,GAAG;AACnB,YAAI;AACJ,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AACd,aAAK,SAAS,CAAC;AACf,aAAK,SAAS,CAAC;AACf,aAAK,SAAS,CAAC;AACf,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,YAAE,CAAC,IAAI,EAAE,CAAC,IAAI;AACd,mBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,cAAE,CAAC,IAAI,EAAE,CAAC,IAAI,SAAW,EAAE,IAAI,CAAC,KAAK,KAAM;AAC3C,cAAE,IAAI,CAAC,KAAK;AAAA,UAChB;AACA,YAAE,EAAE,IAAI,EAAE,EAAE,IAAI,SAAW,EAAE,EAAE,KAAK,KAAM;AAC1C,cAAK,EAAE,EAAE,KAAK,KAAM;AACpB,YAAE,EAAE,KAAK;AACT,eAAK,SAAS,GAAG,GAAG,IAAI,CAAC;AAAA,QAC7B;AACA,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,YAAE,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI;AAClB,YAAE,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK;AAAA,QAC3B;AAAA,MACJ;AAAA,MACA,OAAO,SAAS,GAAG,GAAG;AAClB,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,aAAK,UAAU,GAAG,CAAC;AACnB,aAAK,UAAU,GAAG,CAAC;AACnB,eAAO,KAAK,iBAAiB,GAAG,GAAG,GAAG,CAAC;AAAA,MAC3C;AAAA,MACA,OAAO,SAAS,GAAG;AACf,YAAI,IAAI,IAAI,WAAW,EAAE;AACzB,aAAK,UAAU,GAAG,CAAC;AACnB,eAAO,EAAE,CAAC,IAAI;AAAA,MAClB;AAAA,MACA,OAAO,YAAY,GAAG,GAAG;AACrB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,KAAK;AACvC,UAAE,EAAE,KAAK;AAAA,MACb;AAAA,MACA,OAAO,EAAE,GAAG,GAAG,GAAG;AACd,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,MACzB;AAAA,MACA,OAAO,EAAE,GAAG,GAAG,GAAG;AACd,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,MACzB;AAAA,MACA,OAAO,EAAE,GAAG,GAAG,GAAG;AACd,YAAI,GAAG,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE;AAChd,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,eAAO,KAAK;AACZ,eAAO,KAAK;AACZ,eAAO,KAAK;AACZ,eAAO,KAAK;AACZ,eAAO,KAAK;AAGZ,YAAI;AACJ,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,cAAM,IAAI,IAAI,MAAM,IAAI;AAExB,YAAI;AACJ,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,cAAM,IAAI,IAAI,MAAM,IAAI;AACxB,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AAAA,MACZ;AAAA,MACA,OAAO,EAAE,GAAG,GAAG;AACX,aAAK,EAAE,GAAG,GAAG,CAAC;AAAA,MAClB;AAAA,MACA,OAAO,SAAS,GAAG,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AACd,iBAAS,IAAI,KAAK,KAAK,GAAG,KAAK;AAC3B,eAAK,EAAE,GAAG,CAAC;AACX,cAAI,MAAM,KAAK,MAAM;AACjB,iBAAK,EAAE,GAAG,GAAG,CAAC;AAAA,QACtB;AACA,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AAAA,MAClB;AAAA,MACA,OAAO,QAAQ,GAAG,GAAG;AACjB,cAAM,IAAI,KAAK,GAAG;AAClB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AACd,iBAAS,IAAI,KAAK,KAAK,GAAG,KAAK;AAC3B,eAAK,EAAE,GAAG,CAAC;AACX,cAAI,MAAM;AACN,iBAAK,EAAE,GAAG,GAAG,CAAC;AAAA,QACtB;AACA,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AAAA,MAClB;AAAA;AAAA,MAEA,OAAO,YAAY,KAAK,GAAG,GAAG;AAC1B,cAAM,QAAQ,IAAI,WAAW,CAAC;AAC9B,iBAAS,IAAI,GAAG,IAAI,GAAG,EAAE;AACrB,gBAAM,CAAC,IAAI,EAAE,CAAC;AAClB,cAAMC,QAAO,IAAI,QAAQ,EAAE,EAAE,OAAO,CAAC,EAAE,OAAO;AAC9C,iBAAS,IAAI,GAAG,IAAI,IAAI,EAAE;AACtB,cAAI,CAAC,IAAIA,MAAK,CAAC;AACnB,eAAO;AAAA,MACX;AAAA,MACA,OAAO,IAAI,GAAG,GAAG;AACb,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,GAAG,KAAK,EAAE;AACpB,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC;AACjB,aAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC;AACjB,aAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC;AACjB,aAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC;AAAA,MACrB;AAAA,MACA,OAAO,MAAM,GAAG,GAAG,GAAG;AAClB,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,eAAK,SAAS,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC;AAAA,QAC/B;AAAA,MACJ;AAAA,MACA,OAAO,KAAK,GAAG,GAAG;AACd,cAAM,KAAK,KAAK,GAAG;AACnB,cAAM,KAAK,KAAK,GAAG;AACnB,cAAM,KAAK,KAAK,GAAG;AACnB,aAAK,SAAS,IAAI,EAAE,CAAC,CAAC;AACtB,aAAK,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE;AACnB,aAAK,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE;AACnB,aAAK,UAAU,GAAG,EAAE;AACpB,UAAE,EAAE,KAAK,KAAK,SAAS,EAAE,KAAK;AAAA,MAClC;AAAA,MACA,OAAO,WAAW,GAAG,GAAG,GAAG;AACvB,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,iBAAS,IAAI,KAAK,KAAK,GAAG,EAAE,GAAG;AAC3B,gBAAM,IAAK,EAAG,IAAI,IAAK,CAAC,MAAM,IAAI,KAAM;AACxC,eAAK,MAAM,GAAG,GAAG,CAAC;AAClB,eAAK,IAAI,GAAG,CAAC;AACb,eAAK,IAAI,GAAG,CAAC;AACb,eAAK,MAAM,GAAG,GAAG,CAAC;AAAA,QACtB;AAAA,MACJ;AAAA,MACA,OAAO,WAAW,GAAG,GAAG;AACpB,cAAM,IAAI,CAAC,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AACrD,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC;AAC1B,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC;AAC1B,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,aAAK,EAAE,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;AAC3B,aAAK,WAAW,GAAG,GAAG,CAAC;AAAA,MAC3B;AAAA,MACA,OAAO,IAAI,IAAI,aAAa;AAAA,QACxB;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAC1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAC1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAC1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,MAC9C,CAAC;AAAA,MACD,OAAO,KAAK,GAAG,GAAG;AACd,YAAI,OAAO,GAAG,GAAG;AACjB,aAAK,IAAI,IAAI,KAAK,IAAI,EAAE,GAAG;AACvB,kBAAQ;AACR,eAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,EAAE,GAAG;AACrC,cAAE,CAAC,KAAK,QAAQ,KAAK,EAAE,CAAC,IAAI,KAAK,EAAE,KAAK,IAAI,GAAG;AAC/C,oBAAQ,KAAK,OAAO,EAAE,CAAC,IAAI,OAAO,GAAG;AACrC,cAAE,CAAC,KAAK,QAAQ;AAAA,UACpB;AACA,YAAE,CAAC,KAAK;AACR,YAAE,CAAC,IAAI;AAAA,QACX;AACA,gBAAQ;AACR,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,YAAE,CAAC,KAAK,SAAS,EAAE,EAAE,KAAK,KAAK,KAAK,EAAE,CAAC;AACvC,kBAAQ,EAAE,CAAC,KAAK;AAChB,YAAE,CAAC,KAAK;AAAA,QACZ;AACA,aAAK,IAAI,GAAG,IAAI,IAAI;AAChB,YAAE,CAAC,KAAK,QAAQ,KAAK,EAAE,CAAC;AAC5B,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,YAAE,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC,IAAI;AAAA,QAClB;AAAA,MACJ;AAAA,MACA,OAAO,OAAO,GAAG;AACb,YAAI,IAAI,IAAI,aAAa,EAAE;AAC3B,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AACd,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI;AACX,aAAK,KAAK,GAAG,CAAC;AAAA,MAClB;AAAA;AAAA,MAEA,OAAO,YAAY,IAAI,GAAG,GAAG,IAAI,IAAI;AACjC,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,IAAI,aAAa,EAAE;AAC7B,cAAM,IAAI,CAAC,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AACrD,aAAK,YAAY,GAAG,IAAI,EAAE;AAC1B,UAAE,CAAC,KAAK;AACR,UAAE,EAAE,KAAK;AACT,UAAE,EAAE,KAAK;AACT,cAAM,QAAQ,IAAI;AAClB,iBAAS,IAAI,GAAG,IAAI,GAAG;AACnB,aAAG,KAAK,CAAC,IAAI,EAAE,CAAC;AACpB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,aAAG,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;AACzB,aAAK,YAAY,GAAG,GAAG,SAAS,EAAE,GAAG,IAAI,EAAE;AAC3C,aAAK,OAAO,CAAC;AACb,aAAK,WAAW,GAAG,CAAC;AACpB,aAAK,KAAK,IAAI,CAAC;AACf,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,aAAG,IAAI,EAAE,IAAI,GAAG,CAAC;AACrB,aAAK,YAAY,GAAG,IAAI,IAAI,EAAE;AAC9B,aAAK,OAAO,CAAC;AACb,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI;AACX,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AACd,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,mBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,cAAE,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,UAC1B;AAAA,QACJ;AACA,aAAK,KAAK,GAAG,SAAS,EAAE,GAAG,CAAC;AAC5B,eAAO;AAAA,MACX;AAAA,MACA,OAAO,UAAU,GAAG,GAAG;AACnB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,MAAM,KAAK,GAAG;AACpB,cAAM,MAAM,KAAK,GAAG;AACpB,cAAM,MAAM,KAAK,GAAG;AACpB,cAAM,OAAO,KAAK,GAAG;AACrB,cAAM,OAAO,KAAK,GAAG;AACrB,cAAM,OAAO,KAAK,GAAG;AACrB,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,aAAK,YAAY,EAAE,CAAC,GAAG,CAAC;AACxB,aAAK,EAAE,KAAK,EAAE,CAAC,CAAC;AAChB,aAAK,EAAE,KAAK,KAAK,KAAK,CAAC;AACvB,aAAK,EAAE,KAAK,KAAK,EAAE,CAAC,CAAC;AACrB,aAAK,EAAE,KAAK,EAAE,CAAC,GAAG,GAAG;AACrB,aAAK,EAAE,MAAM,GAAG;AAChB,aAAK,EAAE,MAAM,IAAI;AACjB,aAAK,EAAE,MAAM,MAAM,IAAI;AACvB,aAAK,EAAE,GAAG,MAAM,GAAG;AACnB,aAAK,EAAE,GAAG,GAAG,GAAG;AAChB,aAAK,QAAQ,GAAG,CAAC;AACjB,aAAK,EAAE,GAAG,GAAG,GAAG;AAChB,aAAK,EAAE,GAAG,GAAG,GAAG;AAChB,aAAK,EAAE,GAAG,GAAG,GAAG;AAChB,aAAK,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG;AACnB,aAAK,EAAE,KAAK,EAAE,CAAC,CAAC;AAChB,aAAK,EAAE,KAAK,KAAK,GAAG;AACpB,YAAI,KAAK,SAAS,KAAK,GAAG;AACtB,eAAK,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;AAC7B,aAAK,EAAE,KAAK,EAAE,CAAC,CAAC;AAChB,aAAK,EAAE,KAAK,KAAK,GAAG;AACpB,YAAI,KAAK,SAAS,KAAK,GAAG;AACtB,iBAAO;AACX,YAAI,KAAK,SAAS,EAAE,CAAC,CAAC,MAAO,EAAE,EAAE,KAAK;AAClC,eAAK,EAAE,EAAE,CAAC,GAAG,KAAK,KAAK,EAAE,CAAC,CAAC;AAC/B,aAAK,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACvB,eAAO;AAAA,MACX;AAAA,MACA,OAAO,iBAAiB,GAAG,IAAI,GAAG,IAAI;AAClC,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,CAAC,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AACrD,cAAM,IAAI,CAAC,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AACrD,YAAI,IAAI;AACJ,iBAAO;AACX,YAAI,KAAK,UAAU,GAAG,EAAE;AACpB,iBAAO;AACX,iBAAS,IAAI,GAAG,IAAI,GAAG;AACnB,YAAE,CAAC,IAAI,GAAG,CAAC;AACf,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,IAAI,EAAE,IAAI,GAAG,CAAC;AACpB,aAAK,YAAY,GAAG,GAAG,CAAC;AACxB,aAAK,OAAO,CAAC;AACb,aAAK,WAAW,GAAG,GAAG,CAAC;AACvB,aAAK,WAAW,GAAG,GAAG,SAAS,EAAE,CAAC;AAClC,aAAK,IAAI,GAAG,CAAC;AACb,aAAK,KAAK,GAAG,CAAC;AACd,aAAK;AACL,YAAI,KAAK,iBAAiB,IAAI,GAAG,GAAG,CAAC,GAAG;AACpC,mBAAS,IAAI,GAAG,IAAI,GAAG;AACnB,cAAE,CAAC,IAAI;AACX,iBAAO;AAAA,QACX;AACA,iBAAS,IAAI,GAAG,IAAI,GAAG;AACnB,YAAE,CAAC,IAAI,GAAG,IAAI,EAAE;AACpB,eAAO;AAAA,MACX;AAAA,MACA,OAAO,oBAAoB;AAAA,MAC3B,OAAO,6BAA6B;AAAA,MACpC,OAAO,6BAA6B;AAAA,MACpC,OAAO,wBAAwB;AAAA;AAAA,MAE/B,OAAO,mBAAmB,MAAM;AAC5B,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAClC,cAAI,EAAE,KAAK,CAAC,aAAa;AACrB,kBAAM,IAAI,UAAU,iCAAiC,KAAK,CAAC,EAAE,aAAa,QAAQ,OAAO,KAAK,CAAC,CAAC,EAAE;AAAA,QAC1G;AAAA,MACJ;AAAA,MACA,OAAO,SAASC,MAAK;AACjB,YAAIA,KAAI,SAAS,MAAM;AACnB,UAAAA,OAAM,IAAIA,IAAG;AACjB,cAAM,MAAMA,KAAI,MAAM,SAAS,GAAG,IAAI,UAAQ,SAAS,MAAM,EAAE,CAAC;AAChE,eAAO,WAAW,KAAK,OAAO,CAAC,CAAC;AAAA,MACpC;AAAA,MACA,OAAO,OAAO,KAAK;AACf,YAAI,MAAM;AACV,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,cAAI,OAAO,IAAI,CAAC,MAAM;AAClB,kBAAM,IAAI,UAAU,+CAA+C,OAAO,IAAI,CAAC,CAAC,EAAE;AACtF,cAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;AACvB,kBAAM,IAAI,WAAW,uCAAuC,IAAI,CAAC,CAAC,EAAE;AACxE,iBAAO,IAAI,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAAA,QAC9C;AACA,eAAO;AAAA,MACX;AAAA,MACA,OAAO,KAAK,KAAK,WAAW;AACxB,aAAK,gBAAgB,KAAK,SAAS;AACnC,YAAI,UAAU,WAAW,KAAK;AAC1B,gBAAM,IAAI,MAAM,qBAAqB;AACzC,YAAI,YAAY,IAAI,WAAW,KAAK,oBAAoB,IAAI,MAAM;AAClE,cAAM,YAAY,KAAK,SAAS,KAAK,QAAQ,SAAS,CAAC;AACvD,aAAK,YAAY,WAAW,KAAK,IAAI,QAAQ,WAAW,SAAS;AACjE,eAAO;AAAA,MACX;AAAA,MACA,OAAO,KAAK,WAAW,WAAW;AAC9B,aAAK,gBAAgB,WAAW,SAAS;AACzC,YAAI,UAAU,WAAW,KAAK;AAC1B,gBAAM,IAAI,MAAM,qBAAqB;AACzC,cAAM,MAAM,IAAI,WAAW,UAAU,MAAM;AAC3C,YAAI,OAAO,KAAK,iBAAiB,KAAK,WAAW,UAAU,QAAQ,SAAS;AAC5E,YAAI,OAAO;AACP,iBAAO,IAAI,WAAW,CAAC;AAC3B,YAAI,IAAI,IAAI,WAAW,IAAI;AAC3B,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ;AAC1B,YAAE,CAAC,IAAI,IAAI,CAAC;AAChB,eAAO;AAAA,MACX;AAAA,MACA,OAAO,SAAS,KAAK,WAAW;AAC5B,YAAI,YAAY,KAAK,KAAK,KAAK,SAAS;AACxC,YAAI,MAAM,IAAI,WAAW,KAAK,iBAAiB;AAC/C,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC5B,cAAI,CAAC,IAAI,UAAU,CAAC;AACxB,eAAO,KAAK,OAAO,GAAG,EAAE,YAAY;AAAA,MACxC;AAAA,MACA,OAAO,OAAO,KAAK,KAAK,WAAW;AAC/B,aAAK,gBAAgB,KAAK,KAAK,SAAS;AACxC,YAAI,IAAI,WAAW,KAAK;AACpB,gBAAM,IAAI,MAAM,oBAAoB;AACxC,YAAI,UAAU,WAAW,KAAK;AAC1B,gBAAM,IAAI,MAAM,qBAAqB;AACzC,cAAM,KAAK,IAAI,WAAW,KAAK,oBAAoB,IAAI,MAAM;AAC7D,cAAM,IAAI,IAAI,WAAW,KAAK,oBAAoB,IAAI,MAAM;AAC5D,iBAAS,IAAI,GAAG,IAAI,KAAK,mBAAmB;AACxC,aAAG,CAAC,IAAI,IAAI,CAAC;AACjB,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC5B,aAAG,IAAI,KAAK,iBAAiB,IAAI,IAAI,CAAC;AAC1C,eAAQ,KAAK,iBAAiB,GAAG,IAAI,GAAG,QAAQ,SAAS,KAAK;AAAA,MAClE;AAAA,MACA,OAAO,QAAQ,MAAM;AACjB,YAAI,OAAO,SAAS;AAChB,iBAAO,KAAK,SAAS,IAAI;AAC7B,aAAK,gBAAgB,IAAI;AACzB,YAAI,KAAK,WAAW,KAAK;AACrB,gBAAM,IAAI,MAAM,eAAe;AACnC,cAAM,KAAK,IAAI,WAAW,KAAK,0BAA0B;AACzD,cAAM,IAAI,CAAC,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AACrD,cAAMD,QAAO,IAAI,QAAQ,EAAE,EAAE,OAAO,IAAI,EAAE,OAAO;AACjD,QAAAA,MAAK,CAAC,KAAK;AACX,QAAAA,MAAK,EAAE,KAAK;AACZ,QAAAA,MAAK,EAAE,KAAK;AACZ,aAAK,WAAW,GAAGA,KAAI;AACvB,aAAK,KAAK,IAAI,CAAC;AACf,eAAO,KAAK,OAAO,EAAE,EAAE,YAAY;AAAA,MACvC;AAAA,IACJ;AACA,IAAO,oBAAQ;AAAA,mBACI,OAAO;AAAA,2BACC,eAAe;AAAA,oBACtB,QAAQ;AAAA;AAAA;AAAA;;;ACv2B5B,IAca;AAdb;AAAA;AAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AAOO,IAAM,UAAN,MAAM,SAAQ;AAAA,MACjB,OAAO,cAAc;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,IAAI,UAAU;AAAE,eAAO,GAAG,MAAM,GAAG,KAAK,EAAE;AAAA,MAAI;AAAA,MAC9C,IAAI,YAAY;AAAE,eAAO,KAAK;AAAA,MAAM;AAAA,MACpC,IAAI,aAAa;AAAE,eAAO,KAAK;AAAA,MAAM;AAAA,MACrC,IAAI,QAAQ;AAAE,eAAO,KAAK;AAAA,MAAI;AAAA,MAC9B,IAAI,WAAW;AAAE,eAAO,KAAK;AAAA,MAAI;AAAA,MACjC,IAAI,UAAU;AAAE,eAAO,KAAK;AAAA,MAAI;AAAA,MAChC,IAAI,aAAa;AAAE,eAAO,KAAK;AAAA,MAAI;AAAA,MACnC,IAAI,iBAAiB;AAAE,eAAO,KAAK;AAAA,MAAM;AAAA,MACzC,IAAI,SAAS;AAAE,eAAO,KAAK;AAAA,MAAI;AAAA,MAC/B,IAAI,SAAS,GAAG;AAAE,aAAK,KAAK;AAAA,MAAG;AAAA,MAC/B,IAAI,QAAQ,GAAG;AAAE,aAAK,KAAK,IAAI,OAAO,CAAC,IAAI;AAAA,MAAW;AAAA,MACtD,IAAI,WAAW,GAAG;AAAE,aAAK,KAAK,IAAI,OAAO,CAAC,IAAI;AAAA,MAAW;AAAA,MACzD,IAAI,eAAe,GAAG;AAClB,YAAI,GAAG,gBAAgB,UAAS;AAC5B,eAAK,OAAO;AAAA,QAChB,WACS,OAAO,MAAM,UAAU;AAC5B,eAAK,OAAO,SAAQ,YAAY,CAAC;AAAA,QACrC,OACK;AACD,gBAAM,IAAI,UAAU,gDAAgD,CAAC,EAAE;AAAA,QAC3E;AAAA,MACJ;AAAA,MACA,IAAI,OAAO,GAAG;AAAE,aAAK,KAAK,IAAI,OAAO,CAAC,IAAI;AAAA,MAAW;AAAA,MACrD,YAAY,SAAS,WAAW,YAAY,OAAO;AAC/C,YAAI,CAAC,SAAQ,aAAa;AACtB,gBAAM,IAAI,MAAM,uEAAuE;AAAA,QAC3F;AACA,YAAI,UAAU,UAAa,OAAO,UAAU,UAAU;AAClD,gBAAM,IAAI,UAAU,iBAAiB,KAAK,0BAA0B,OAAO,EAAE;AAAA,QACjF;AACA,aAAK,KAAK,QACL,QAAQ,QAAQ,EAAE,EAClB,QAAQ,eAAe,EAAE;AAC9B,aAAK,OAAO;AACZ,aAAK,OAAO,cAAc;AAC1B,aAAK,KAAK;AACV,aAAK,KAAK,IAAI,KAAK;AACnB,iBAAQ,cAAc;AAAA,MAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,OAAO,YAAY,SAAS,OAAO;AAC/B,iBAAQ,cAAc;AACtB,iBAAQ,SAAS,OAAO;AACxB,cAAM,YAAY,SAAQ,cAAc,OAAO;AAC/C,cAAM,UAAU,IAAI,KAAK,SAAS,WAAW,QAAW,KAAK;AAC7D,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,OAAO,cAAc,WAAW,OAAO;AACnC,iBAAQ,cAAc;AACtB,iBAAQ,aAAa,SAAS;AAC9B,cAAM,UAAU,SAAQ,cAAc,SAAS;AAC/C,cAAM,UAAU,IAAI,KAAK,SAAS,WAAW,QAAW,KAAK;AAC7D,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,OAAO,eAAe,YAAY,OAAO;AACrC,iBAAQ,cAAc;AACtB,iBAAQ,aAAa,UAAU;AAC/B,cAAM,YAAY,SAAS,QAAQ,UAAU;AAC7C,cAAM,UAAU,SAAQ,cAAc,WAAW,KAAK;AACtD,gBAAQ,OAAO,WAAW,YAAY;AACtC,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAcA,OAAO,YAAY,YAAY,WAAW,OAAO;AAC7C,iBAAQ,cAAc;AACtB,iBAAQ,aAAa,UAAU;AAC/B,cAAM,UAAU,SAAQ,cAAc,WAAW,KAAK;AACtD,gBAAQ,OAAO,WAAW,YAAY;AACtC,eAAO;AAAA,MACX;AAAA,MACA,MAAM,KAAK,SAAS;AAChB,YAAI;AACA,cAAI,KAAK,QAAQ,MAAM;AACnB,kBAAM,KAAK,GAAG,IAAI,KAAK,MAAM,SAAS,KAAK,IAAI;AAAA,UACnD;AAAA,QACJ,SACO,KAAK;AACR,kBAAQ,MAAM,0BAA0B,KAAK,OAAO,IAAI,GAAG;AAC3D,iBAAO;AAAA,QACX;AACA,aAAK,OAAO;AACZ,eAAO;AAAA,MACX;AAAA,MACA,MAAM,OAAO,SAAS;AAClB,YAAI;AACA,eAAK,OAAO,MAAM,KAAK,GAAG,IAAI,KAAK,MAAM,OAAO;AAAA,QACpD,SACO,KAAK;AACR,kBAAQ,MAAM,4BAA4B,KAAK,OAAO,IAAI,GAAG;AAC7D,iBAAO;AAAA,QACX;AACA,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,OAAO,SAAS,SAAS;AACrB,YAAI,YAAY,QAAW;AACvB,gBAAM,IAAI,eAAe,uBAAuB;AAAA,QACpD;AACA,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,2BAA2B;AAAA,QACnD;AACA,cAAM,UAAU,IAAI,OAAO,KAAK,MAAM,IAAI,aAAa,YAAY,QAAQ,QAAQ;AACnF,YAAI,CAAC,QAAQ,KAAK,OAAO,GAAG;AACxB,gBAAM,IAAI,WAAW,wBAAwB;AAAA,QACjD;AACA,cAAM,mBAAmB,QAAQ,MAAM,EAAE;AACzC,cAAM,YAAY,QAAQ,MAAM,QAAQ,QAAQ,GAAG,IAAI,GAAG,EAAE;AAC5D,cAAM,SAAS,OAAO,QAAQ,SAAS;AACvC,cAAM,oBAAoB,IAAI,QAAQ,CAAC,EAAE,OAAO,MAAM,EAAE,OAAO;AAC/D,0BAAkB,QAAQ;AAC1B,cAAM,iBAAiB,MAAM,SAAS,iBAAiB;AACvD,YAAI,qBAAqB,gBAAgB;AACrC,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAChD;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,MAAM,QAAQ,KAAK;AACf,YAAI,OAAO,QAAQ,YAAY,IAAI,gBAAgB,KAAK;AACpD,gBAAM,IAAI,IAAI,GAAG;AAAA,QACrB;AACA,YAAI,IAAI,gBAAgB,KAAK;AACzB,gBAAM,IAAI,UAAU,0BAA0B;AAAA,QAClD;AACA,cAAM,OAAO;AAAA,UACT,WAAW,KAAK;AAAA,UAChB,cAAc;AAAA,UACd,kBAAkB;AAAA,UAClB,UAAU;AAAA,QACd;AACA,cAAM,EAAE,SAAS,UAAU,YAAY,gBAAgB,OAAO,IAAI,MAAM,IAAI,KAAK,gBAAgB,IAAI;AACrG,YAAI,YAAY,MAAM;AAClB,gBAAM,IAAI,MAAM,mBAAmB;AAAA,QACvC;AACA,aAAK,KAAK,OAAO,OAAO;AACxB,aAAK,KAAK;AACV,aAAK,KAAK,OAAO,UAAU;AAC3B,aAAK,OAAO,SAAQ,YAAY,cAAc;AAC9C,aAAK,KAAK,OAAO,MAAM;AAAA,MAC3B;AAAA,MACA,OAAO,cAAc,GAAG;AACpB,cAAM,iBAAiB,OAAO,QAAQ,EAAE,MAAM,KAAK,EAAE,CAAC;AACtD,cAAM,gBAAgB,OAAO,QAAQ,EAAE,MAAM,EAAE,CAAC;AAChD,cAAM,kBAAkB,IAAI,QAAQ,CAAC,EAAE,OAAO,cAAc,EAAE,OAAO,EAAE,QAAQ;AAC/E,YAAI,MAAM,MAAM,aAAa,MAAM,MAAM,MAAM,eAAe,GAAG;AAC7D,gBAAM,IAAI,MAAM,8BAA8B;AAAA,QAClD;AACA,eAAO,MAAM,MAAM,cAAc;AAAA,MACrC;AAAA,MACA,OAAO,cAAc,WAAW;AAC5B,cAAM,iBAAiB,IAAI,QAAQ,SAAS;AAC5C,cAAM,gBAAgB,IAAI,QAAQ,CAAC,EAAE,OAAO,cAAc,EAAE,OAAO,EAAE,QAAQ;AAC7E,cAAM,mBAAmB,MAAM,SAAS,cAAc;AACtD,cAAM,kBAAkB,MAAM,SAAS,aAAa;AACpD,eAAO,GAAG,MAAM,GAAG,gBAAgB,GAAG,eAAe;AAAA,MACzD;AAAA,MACA,OAAO,aAAa,KAAK;AACrB,YAAI,QAAQ,QAAW;AACnB,gBAAM,IAAI,UAAU,kBAAkB;AAAA,QAC1C;AACA,YAAI,OAAO,QAAQ,UAAU;AACzB,gBAAM,IAAI,UAAU,sBAAsB;AAAA,QAC9C;AACA,YAAI,IAAI,WAAW,oBAAoB;AACnC,gBAAM,IAAI,UAAU,eAAe,kBAAkB,aAAa;AAAA,QACtE;AACA,YAAI,CAAC,kBAAkB,KAAK,GAAG,GAAG;AAC9B,gBAAM,IAAI,WAAW,sCAAsC;AAAA,QAC/D;AAAA,MACJ;AAAA,IACJ;AAAA;AAAA;;;AClPA,IAGa,UA4GN;AA/GP;AAAA;AAAA;AAEA;AACO,IAAM,WAAN,MAAM,kBAAiB,gBAAgB;AAAA,MAC1C,OAAO,kBAAkB;AAAA,MACzB,OAAO,gBAAgB;AAAA,MACvB,OAAO,kBAAkB;AAAA,MACzB,OAAO,iBAAiB;AAAA,MACxB,OAAO;AACH,kBAAS,OAAO;AAAA,MACpB;AAAA,MACA,aAAa,KAAK,MAAM;AACpB,mBAAW,KAAK,MAAM;AAClB,cAAI,EAAE,QAAQ,QAAQ,EAAE,SAAS,KAAK,eAAe;AACjD,cAAE,aAAa,MAAM,KAAK,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK;AAAA,UACzD,OACK;AACD,cAAE,aAAa,MAAM,KAAK,QAAQ,EAAE,MAAM,EAAE,KAAK;AAAA,UACrD;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,aAAa,QAAQ,MAAM,OAAO;AAC9B,YAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,KAAK,QAAQ,YAAY;AACjE,gBAAM,IAAI,WAAW,6BAA6B,MAAM,SAAS,EAAE,CAAC,EAAE;AAAA,QAC1E;AACA,eAAO,MAAM,KAAK,IAAI,MAAM,KAAK,iBAAiB,KAAK;AAAA,MAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,aAAa,IAAI,MAAM,MAAM,OAAO;AAChC,YAAI,KAAK,SAAS,MAAM,KAAK,SAAS,KAAK;AACvC,gBAAM,IAAI,WAAW,qBAAqB;AAAA,QAC9C;AACA,YAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,KAAK,QAAQ,YAAY;AACjE,gBAAM,IAAI,WAAW,6BAA6B,MAAM,SAAS,EAAE,CAAC,EAAE;AAAA,QAC1E;AACA,cAAM,YAAY,MAAM,KAAK,OAAO,KAAK,gBAAgB,IAAI;AAC7D,cAAM,aAAa,MAAM,KAAK,QAAQ,WAAW,KAAK,gBAAgB,KAAK,eAAe;AAC1F,cAAM,UAAU,MAAM,KAAK,QAAQ,YAAY,OAAO,KAAK,eAAe;AAC1E,cAAM,aAAa,MAAM,KAAK,QAAQ,SAAS,QAAQ,KAAK,eAAe;AAC3E,cAAM,aAAa,IAAI,WAAW,WAAW,WAAW,MAAM;AAC9D,YAAIE,OAAM;AACV,iBAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AACxC,UAAAA,QAAO,WAAW,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAAA,QACrD;AACA,eAAOA;AAAA,MACX;AAAA,MACA,aAAa,OAAO,OAAO,GAAG;AAC1B,cAAM,MAAM,IAAI,YAAY,EAAE,OAAO,KAAK;AAC1C,cAAM,OAAO,IAAI,WAAW,EAAE;AAC9B,aAAK,IAAI,EAAE,MAAM,SAAS,EAAE,IAAI,UAAQ,SAAS,MAAM,EAAE,CAAC,CAAC;AAC3D,cAAM,IAAI,MAAM,KAAK,KAAK,KAAK,IAAI;AACnC,cAAM,KAAK,IAAI,SAAS,EAAE,OAAO,MAAM,GAAG,EAAE,SAAS,CAAC,CAAC;AACvD,cAAM,KAAK,IAAI,SAAS,EAAE,OAAO,MAAM,EAAE,SAAS,CAAC,CAAC;AACpD,eAAQ,EAAE,YAAY,IAAI,WAAW,GAAG;AAAA,MAC5C;AAAA,MACA,aAAa,QAAQ,EAAE,YAAY,UAAU,GAAG,OAAO;AACnD,cAAM,MAAM,IAAI,WAAW,UAAU,MAAM;AAC3C,cAAM,OAAO,IAAI,WAAW,EAAE;AAC9B,aAAK,IAAI,CAAC,CAAC,CAAC;AACZ,aAAK,IAAI,KAAK,OAAO,UAAU,GAAG,CAAC;AACnC,aAAK,IAAI,KAAK,MAAM,KAAK,GAAG,EAAE;AAC9B,cAAM,IAAI,MAAM,KAAK,KAAK,KAAK,IAAI;AACnC,cAAM,KAAK,IAAI,SAAS,EAAE,OAAO,MAAM,GAAG,EAAE,SAAS,CAAC,CAAC;AACvD,cAAM,KAAK,IAAI,SAAS,EAAE,OAAO,MAAM,EAAE,SAAS,CAAC,CAAC;AACpD,eAAQ,EAAE,YAAY,IAAI,WAAW,GAAG;AAAA,MAC5C;AAAA,MACA,OAAO,MAAM,SAAS;AAClB,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,+BAA+B,OAAO,OAAO,EAAE;AAAA,QACvE;AACA,YAAI,UAAU,YAAY;AACtB,gBAAM,IAAI,WAAW,qCAAqC,QAAQ,SAAS,CAAC,EAAE,MAAM,eAAe,OAAO,EAAE;AAAA,QAChH;AACA,cAAM,OAAO,IAAI,SAAS,IAAI,YAAY,CAAC,CAAC;AAC5C,aAAK,UAAU,GAAG,SAAS,KAAK;AAChC,eAAO,IAAI,WAAW,KAAK,MAAM;AAAA,MACrC;AAAA,MACA,OAAO,OAAO,SAAS;AACnB,YAAI,QAAQ,gBAAgB,UAAU;AAClC,gBAAM,IAAI,UAAU,+BAA+B,OAAO,OAAO,EAAE;AAAA,QACvE;AACA,YAAI,QAAQ,aAAa,IAAI;AACzB,gBAAM,IAAI,WAAW,sCAAsC,QAAQ,UAAU,gBAAgB,OAAO,EAAE;AAAA,QAC1G;AACA,eAAO,IAAI,WAAW,QAAQ,MAAM;AAAA,MACxC;AAAA,MACA,aAAa,KAAK,KAAK,MAAM;AACzB,cAAM,EAAE,QAAAC,QAAO,IAAI,WAAW;AAC9B,cAAM,KAAK,MAAMA,QAAO,UAAU,OAAO,KAAK,EAAE,MAAM,QAAQ,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC;AAChG,cAAM,YAAY,MAAMA,QAAO,KAAK,QAAQ,IAAI,IAAI;AACpD,eAAO,IAAI,WAAW,SAAS;AAAA,MACnC;AAAA,IACJ;AACA,IAAO,oBAAQ;AAAA,2BACY,eAAe;AAAA,oBACtB,QAAQ;AAAA;AAAA;AAAA;;;ACjH5B,IAKa,KAiYN;AAtYP;AAAA;AAAA;AAIA;AACO,IAAM,MAAN,MAAM,aAAY,gBAAgB;AAAA,MACrC,OAAO;AACH,aAAI,OAAO;AAAA,MACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,aAAa,KAAK,MAAM;AACpB,eAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC1C,qBAAW,KAAK,MAAM;AAClB,gBAAI;AACA,gBAAE,OAAO,MAAM,KAAK,KAAK,EAAE,MAAM,EAAE,SAAS;AAAA,YAChD,SACO,KAAK;AACR,qBAAO,GAAG;AAAA,YACd;AAAA,UACJ;AACA,kBAAQ,IAAI;AAAA,QAChB,CAAC;AAAA,MACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,aAAa,KAAKC,OAAM,YAAY,YAAY;AAC5C,eAAO,IAAI,QAAQ,aAAW;AAC1B,eAAK,WAAWA,OAAM,SAAS,SAAS;AAAA,QAC5C,CAAC;AAAA,MACL;AAAA;AAAA,MAEA,OAAO,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAanB,OAAO,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MA4KnB,OAAO,YAAY,MAAM,KAAK,IAAI,GAAG,KAAK,MAAM,UAAU,mBAAmB,CAAC;AAAA,MAC9E,OAAO,QAAQ,KAAK;AAChB,YAAI,MAAM;AACV,iBAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACtC,iBAAO,IAAI,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAAA,QAC9C;AACA,eAAO;AAAA,MACX;AAAA,MACA,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA;AAAA,MAEP,OAAO,aAAa,IAAI,aAAa;AAAA,QACjC;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAC3B;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,MAC/B,CAAC;AAAA;AAAA,MAED,OAAO,cAAc,IAAI,aAAa;AAAA,QAClC;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,MACrC,CAAC;AAAA,MAED,OAAO;AACH,aAAK,MAAM,IAAI,gBAAgB,KAAK,WAAW,KAAK,SAAS,EAAE,WAAW,QAAQ;AAClF,YAAI,KAAK,OAAO;AACZ,gBAAM,IAAI,MAAM,qBAAqB;AACzC,aAAK,IAAI,WAAW,GAAG,GAAG,GAAG,CAAC;AAC9B,aAAK,WAAW,KAAK,IAAI,cAAc;AACvC,YAAI,KAAK,YAAY;AACjB,gBAAM,IAAI,MAAM,iCAAiC;AACrD,aAAK,gBAAgB,KAAK,IAAI,aAAa,KAAK,IAAI,aAAa;AACjE,YAAI,KAAK,iBAAiB;AACtB,gBAAM,IAAI,MAAM,gCAAgC;AACpD,aAAK,IAAI,aAAa,KAAK,eAAe,KAAK,SAAS;AACxD,aAAK,IAAI,cAAc,KAAK,aAAa;AACzC,YAAI,CAAC,KAAK,IAAI,mBAAmB,KAAK,eAAe,KAAK,IAAI,cAAc;AACxE,gBAAM,IAAI,MAAM,KAAK,IAAI,iBAAiB,KAAK,aAAa,KAAK,iCAAiC;AACtG,aAAK,kBAAkB,KAAK,IAAI,aAAa,KAAK,IAAI,eAAe;AACrE,YAAI,KAAK,mBAAmB;AACxB,gBAAM,IAAI,MAAM,kCAAkC;AACtD,aAAK,IAAI,aAAa,KAAK,iBAAiB,KAAK,SAAS;AAC1D,aAAK,IAAI,cAAc,KAAK,eAAe;AAC3C,YAAI,CAAC,KAAK,IAAI,mBAAmB,KAAK,iBAAiB,KAAK,IAAI,cAAc;AAC1E,gBAAM,IAAI,MAAM,KAAK,IAAI,iBAAiB,KAAK,eAAe,KAAK,mCAAmC;AAC1G,aAAK,IAAI,aAAa,KAAK,UAAU,KAAK,aAAa;AACvD,aAAK,IAAI,aAAa,KAAK,UAAU,KAAK,eAAe;AACzD,aAAK,IAAI,YAAY,KAAK,QAAQ;AAClC,YAAI,CAAC,KAAK,IAAI,oBAAoB,KAAK,UAAU,KAAK,IAAI,WAAW;AACjE,gBAAM,IAAI,MAAM,KAAK,IAAI,kBAAkB,KAAK,QAAQ,KAAK,wBAAwB;AAEzF,aAAK,IAAI,WAAW,KAAK,QAAQ;AACjC,cAAM,gBAAgB,KAAK,IAAI,kBAAkB;AACjD,aAAK,IAAI,gBAAgB,aAAa;AACtC,aAAK,kBAAkB,KAAK,IAAI,aAAa;AAC7C,aAAK,IAAI,WAAW,KAAK,IAAI,cAAc,KAAK,eAAe;AAC/D,aAAK,IAAI,WAAW,KAAK,IAAI,cAAc,KAAK,YAAY,KAAK,IAAI,WAAW;AAChF,aAAK,IAAI,oBAAoB,GAAG,GAAG,KAAK,IAAI,OAAO,OAAO,GAAG,CAAC;AAC9D,aAAK,IAAI,wBAAwB,CAAC;AAClC,aAAK,YAAY,KAAK,IAAI,aAAa;AACvC,aAAK,IAAI,WAAW,KAAK,IAAI,cAAc,KAAK,SAAS;AACzD,aAAK,IAAI,WAAW,KAAK,IAAI,cAAc,KAAK,aAAa,KAAK,IAAI,WAAW;AACjF,aAAK,IAAI,oBAAoB,GAAG,GAAG,KAAK,IAAI,OAAO,OAAO,GAAG,CAAC;AAC9D,aAAK,IAAI,wBAAwB,CAAC;AAClC,aAAK,aAAa,KAAK,IAAI,aAAa;AACxC,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,KAAK,UAAU;AAC5D,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,KAAK,KAAK,IAAI,YAAY;AACvE,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,IAAI;AACjD,aAAK,IAAI,eAAe,KAAK,IAAI,gBAAgB,GAAG,KAAK,UAAU;AACnE,aAAK,IAAI,oBAAoB,KAAK,UAAU,KAAK,IAAI,qBAAqB,KAAK,UAAU,KAAK,GAAG,CAAC;AAClG,aAAK,cAAc,KAAK,IAAI,aAAa;AACzC,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,KAAK,WAAW;AAC7D,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,IAAI,KAAK,IAAI,WAAW;AACrE,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,IAAI;AACjD,aAAK,IAAI,eAAe,KAAK,IAAI,gBAAgB,GAAG,KAAK,WAAW;AACpE,aAAK,IAAI,oBAAoB,KAAK,UAAU,KAAK,IAAI,qBAAqB,KAAK,UAAU,MAAM,GAAG,CAAC;AACnG,aAAK,UAAU,IAAI,WAAW,KAAK,IAAI,qBAAqB,KAAK,IAAI,sBAAsB,CAAC;AAC5F,aAAK,SAAS,KAAK,IAAI,YAAY;AAAA,MACvC;AAAA,MACA,OAAO,WAAW,SAAS,UAAU,WAAW;AAC5C,YAAI,KAAI,OAAO;AACX,gBAAM,IAAI,MAAM,qBAAqB;AACzC,YAAI,CAAC,qBAAqB,KAAK,OAAO;AAClC,gBAAM,IAAI,MAAM,gBAAgB,OAAO,EAAE;AAC7C,YAAI,OAAO,cAAc;AACrB,gBAAM,IAAI,UAAU,qBAAqB,SAAS,EAAE;AACxD,YAAI,KAAK,OAAO;AACZ,gBAAM,IAAI,MAAM,qBAAqB;AAEzC,cAAM,UAAU,IAAI,SAAS,IAAI,YAAY,GAAG,CAAC;AACjD,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;AAC5B,gBAAM,SAAS,QAAQ,MAAM,GAAG,IAAI,CAAC;AACrC,kBAAQ,UAAU,IAAI,GAAG,SAAS,QAAQ,EAAE,CAAC;AAAA,QACjD;AACA,gBAAQ,UAAU,KAAK,WAAW,IAAI;AACtC,gBAAQ,WAAW,KAAK,KAAI,YAAY,GAAG,IAAI;AAC/C,aAAI,IAAI,WAAW,KAAI,IAAI,gBAAgB,KAAI,UAAU;AACzD,aAAI,IAAI,cAAc,KAAI,IAAI,gBAAgB,GAAG,OAAO;AACxD,aAAI,IAAI,WAAW,KAAI,IAAI,gBAAgB,IAAI;AAE/C,cAAM,OAAO,IAAI,WAAW,CAAC;AAC7B,cAAM,OAAO,MAAM;AACf,cAAI,KAAI,OAAO;AACX,kBAAM,IAAI,MAAM,qBAAqB;AACzC,cAAI,KAAI,UAAU;AACd,kBAAM,IAAI,MAAM,oCAAoC;AACxD,eAAI,IAAI,MAAM,KAAI,IAAI,gBAAgB;AAEtC,iBAAO,gBAAgB,IAAI;AAC3B,eAAI,IAAI,WAAW,KAAI,IAAI,gBAAgB,KAAI,WAAW;AAC1D,eAAI,IAAI,cAAc,KAAI,IAAI,gBAAgB,GAAG,YAAY,KAAK,IAAI,CAAC;AACvE,eAAI,IAAI,WAAW,KAAI,IAAI,gBAAgB,IAAI;AAC/C,eAAI,IAAI,WAAW,KAAI,IAAI,iCAAiC,KAAI,MAAM;AACtE,eAAI,IAAI,WAAW,KAAI,IAAI,WAAW,GAAG,CAAC;AAC1C,eAAI,IAAI,SAAS,KAAI,IAAI,+BAA+B;AACxD,gCAAsB,gBAAgB;AAAA,QAC1C;AACA,iBAAS,mBAAmB;AACxB,cAAI,KAAI,OAAO;AACX,kBAAM,IAAI,MAAM,4CAA4C;AAChE,cAAI,KAAI,UAAU;AACd,kBAAM,IAAI,MAAM,iBAAiB;AACrC,cAAI,KAAI,IAAI,kBAAkB,KAAI,QAAQ,KAAI,IAAI,sBAAsB,GAAG;AACvE,kBAAM,mBAAmB,KAAI,IAAI,kBAAkB,KAAI,QAAQ,KAAI,IAAI,YAAY;AACnF,gBAAI,kBAAkB;AAElB,6BAAe;AAAA,YACnB,OACK;AAED,oCAAsB,IAAI;AAAA,YAC9B;AAAA,UACJ,OACK;AAED,kCAAsB,gBAAgB;AAAA,UAC1C;AAAA,QACJ;AACA,iBAAS,iBAAiB;AACtB,cAAI,KAAI,OAAO;AACX,kBAAM,IAAI,MAAM,2CAA2C;AAC/D,eAAI,IAAI,WAAW,GAAG,GAAG,KAAI,IAAI,oBAAoB,KAAI,IAAI,qBAAqB,KAAI,IAAI,MAAM,KAAI,IAAI,eAAe,KAAI,OAAO;AAElI,mBAAS,IAAI,GAAG,IAAI,KAAI,QAAQ,QAAQ,KAAK,GAAG;AAC5C,gBAAI,KAAI,QAAQ,CAAC,MAAM,GAAG;AACtB,oBAAMC,OAAM,KAAI,QAAQ,KAAK,SAAS,GAAG,CAAC,CAAC,IAAI,KAAI,QAAQ;AAAA,gBACvD,KAAI,QAAQ,IAAI,CAAC;AAAA,gBACjB,KAAI,QAAQ,IAAI,CAAC;AAAA,gBACjB,KAAK,CAAC,IAAK,KAAI,QAAQ,CAAC,IAAI;AAAA,gBAC5B,KAAK,CAAC,IAAK,KAAI,QAAQ,IAAI,CAAC,IAAI;AAAA,cACpC,CAAC;AAED,qBAAO,aAAa,cAAc,SAASA,IAAG;AAC9C;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AACA,aAAK;AAAA,MACT;AAAA,IACJ;AACA,IAAO,gBAAQ;AAAA,2BACY,eAAe;AAAA,eAC3B,GAAG;AAAA;AAAA;AAAA;;;ACxYlB;AAAA;AAAA;AAEA;AACA;AACA;AAAA;AAAA;;;ACJA;AAAA;AAAA;AAuBA,QAAI,IAAI,OAAO,YAAY,WAAW,UAAU;AAChD,QAAI,eAAe,KAAK,OAAO,EAAE,UAAU,aACvC,EAAE,QACF,SAASC,cAAa,QAAQ,UAAU,MAAM;AAC9C,aAAO,SAAS,UAAU,MAAM,KAAK,QAAQ,UAAU,IAAI;AAAA,IAC7D;AAEF,QAAI;AACJ,QAAI,KAAK,OAAO,EAAE,YAAY,YAAY;AACxC,uBAAiB,EAAE;AAAA,IACrB,WAAW,OAAO,uBAAuB;AACvC,uBAAiB,SAASC,gBAAe,QAAQ;AAC/C,eAAO,OAAO,oBAAoB,MAAM,EACrC,OAAO,OAAO,sBAAsB,MAAM,CAAC;AAAA,MAChD;AAAA,IACF,OAAO;AACL,uBAAiB,SAASA,gBAAe,QAAQ;AAC/C,eAAO,OAAO,oBAAoB,MAAM;AAAA,MAC1C;AAAA,IACF;AAEA,aAAS,mBAAmB,SAAS;AACnC,UAAI,WAAW,QAAQ,KAAM,SAAQ,KAAK,OAAO;AAAA,IACnD;AAEA,QAAI,cAAc,OAAO,SAAS,SAASC,aAAY,OAAO;AAC5D,aAAO,UAAU;AAAA,IACnB;AAEA,aAASC,gBAAe;AACtB,MAAAA,cAAa,KAAK,KAAK,IAAI;AAAA,IAC7B;AACA,WAAO,UAAUA;AACjB,WAAO,QAAQ,OAAO;AAGtB,IAAAA,cAAa,eAAeA;AAE5B,IAAAA,cAAa,UAAU,UAAU;AACjC,IAAAA,cAAa,UAAU,eAAe;AACtC,IAAAA,cAAa,UAAU,gBAAgB;AAIvC,QAAI,sBAAsB;AAE1B,aAAS,cAAc,UAAU;AAC/B,UAAI,OAAO,aAAa,YAAY;AAClC,cAAM,IAAI,UAAU,qEAAqE,OAAO,QAAQ;AAAA,MAC1G;AAAA,IACF;AAEA,WAAO,eAAeA,eAAc,uBAAuB;AAAA,MACzD,YAAY;AAAA,MACZ,KAAK,WAAW;AACd,eAAO;AAAA,MACT;AAAA,MACA,KAAK,SAAS,KAAK;AACjB,YAAI,OAAO,QAAQ,YAAY,MAAM,KAAK,YAAY,GAAG,GAAG;AAC1D,gBAAM,IAAI,WAAW,oGAAoG,MAAM,GAAG;AAAA,QACpI;AACA,8BAAsB;AAAA,MACxB;AAAA,IACF,CAAC;AAED,IAAAA,cAAa,OAAO,WAAW;AAE7B,UAAI,KAAK,YAAY,UACjB,KAAK,YAAY,OAAO,eAAe,IAAI,EAAE,SAAS;AACxD,aAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,aAAK,eAAe;AAAA,MACtB;AAEA,WAAK,gBAAgB,KAAK,iBAAiB;AAAA,IAC7C;AAIA,IAAAA,cAAa,UAAU,kBAAkB,SAAS,gBAAgB,GAAG;AACnE,UAAI,OAAO,MAAM,YAAY,IAAI,KAAK,YAAY,CAAC,GAAG;AACpD,cAAM,IAAI,WAAW,kFAAkF,IAAI,GAAG;AAAA,MAChH;AACA,WAAK,gBAAgB;AACrB,aAAO;AAAA,IACT;AAEA,aAAS,iBAAiB,MAAM;AAC9B,UAAI,KAAK,kBAAkB;AACzB,eAAOA,cAAa;AACtB,aAAO,KAAK;AAAA,IACd;AAEA,IAAAA,cAAa,UAAU,kBAAkB,SAAS,kBAAkB;AAClE,aAAO,iBAAiB,IAAI;AAAA,IAC9B;AAEA,IAAAA,cAAa,UAAU,OAAO,SAAS,KAAK,MAAM;AAChD,UAAI,OAAO,CAAC;AACZ,eAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAK,MAAK,KAAK,UAAU,CAAC,CAAC;AACjE,UAAI,UAAW,SAAS;AAExB,UAAI,SAAS,KAAK;AAClB,UAAI,WAAW;AACb,kBAAW,WAAW,OAAO,UAAU;AAAA,eAChC,CAAC;AACR,eAAO;AAGT,UAAI,SAAS;AACX,YAAI;AACJ,YAAI,KAAK,SAAS;AAChB,eAAK,KAAK,CAAC;AACb,YAAI,cAAc,OAAO;AAGvB,gBAAM;AAAA,QACR;AAEA,YAAI,MAAM,IAAI,MAAM,sBAAsB,KAAK,OAAO,GAAG,UAAU,MAAM,GAAG;AAC5E,YAAI,UAAU;AACd,cAAM;AAAA,MACR;AAEA,UAAI,UAAU,OAAO,IAAI;AAEzB,UAAI,YAAY;AACd,eAAO;AAET,UAAI,OAAO,YAAY,YAAY;AACjC,qBAAa,SAAS,MAAM,IAAI;AAAA,MAClC,OAAO;AACL,YAAI,MAAM,QAAQ;AAClB,YAAI,YAAY,WAAW,SAAS,GAAG;AACvC,iBAAS,IAAI,GAAG,IAAI,KAAK,EAAE;AACzB,uBAAa,UAAU,CAAC,GAAG,MAAM,IAAI;AAAA,MACzC;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,aAAa,QAAQ,MAAM,UAAU,SAAS;AACrD,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,oBAAc,QAAQ;AAEtB,eAAS,OAAO;AAChB,UAAI,WAAW,QAAW;AACxB,iBAAS,OAAO,UAAU,uBAAO,OAAO,IAAI;AAC5C,eAAO,eAAe;AAAA,MACxB,OAAO;AAGL,YAAI,OAAO,gBAAgB,QAAW;AACpC,iBAAO;AAAA,YAAK;AAAA,YAAe;AAAA,YACf,SAAS,WAAW,SAAS,WAAW;AAAA,UAAQ;AAI5D,mBAAS,OAAO;AAAA,QAClB;AACA,mBAAW,OAAO,IAAI;AAAA,MACxB;AAEA,UAAI,aAAa,QAAW;AAE1B,mBAAW,OAAO,IAAI,IAAI;AAC1B,UAAE,OAAO;AAAA,MACX,OAAO;AACL,YAAI,OAAO,aAAa,YAAY;AAElC,qBAAW,OAAO,IAAI,IACpB,UAAU,CAAC,UAAU,QAAQ,IAAI,CAAC,UAAU,QAAQ;AAAA,QAExD,WAAW,SAAS;AAClB,mBAAS,QAAQ,QAAQ;AAAA,QAC3B,OAAO;AACL,mBAAS,KAAK,QAAQ;AAAA,QACxB;AAGA,YAAI,iBAAiB,MAAM;AAC3B,YAAI,IAAI,KAAK,SAAS,SAAS,KAAK,CAAC,SAAS,QAAQ;AACpD,mBAAS,SAAS;AAGlB,cAAI,IAAI,IAAI,MAAM,iDACE,SAAS,SAAS,MAAM,OAAO,IAAI,IAAI,mEAEvB;AACpC,YAAE,OAAO;AACT,YAAE,UAAU;AACZ,YAAE,OAAO;AACT,YAAE,QAAQ,SAAS;AACnB,6BAAmB,CAAC;AAAA,QACtB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,IAAAA,cAAa,UAAU,cAAc,SAAS,YAAY,MAAM,UAAU;AACxE,aAAO,aAAa,MAAM,MAAM,UAAU,KAAK;AAAA,IACjD;AAEA,IAAAA,cAAa,UAAU,KAAKA,cAAa,UAAU;AAEnD,IAAAA,cAAa,UAAU,kBACnB,SAAS,gBAAgB,MAAM,UAAU;AACvC,aAAO,aAAa,MAAM,MAAM,UAAU,IAAI;AAAA,IAChD;AAEJ,aAAS,cAAc;AACrB,UAAI,CAAC,KAAK,OAAO;AACf,aAAK,OAAO,eAAe,KAAK,MAAM,KAAK,MAAM;AACjD,aAAK,QAAQ;AACb,YAAI,UAAU,WAAW;AACvB,iBAAO,KAAK,SAAS,KAAK,KAAK,MAAM;AACvC,eAAO,KAAK,SAAS,MAAM,KAAK,QAAQ,SAAS;AAAA,MACnD;AAAA,IACF;AAEA,aAAS,UAAU,QAAQ,MAAM,UAAU;AACzC,UAAI,QAAQ,EAAE,OAAO,OAAO,QAAQ,QAAW,QAAgB,MAAY,SAAmB;AAC9F,UAAI,UAAU,YAAY,KAAK,KAAK;AACpC,cAAQ,WAAW;AACnB,YAAM,SAAS;AACf,aAAO;AAAA,IACT;AAEA,IAAAA,cAAa,UAAU,OAAO,SAASC,MAAK,MAAM,UAAU;AAC1D,oBAAc,QAAQ;AACtB,WAAK,GAAG,MAAM,UAAU,MAAM,MAAM,QAAQ,CAAC;AAC7C,aAAO;AAAA,IACT;AAEA,IAAAD,cAAa,UAAU,sBACnB,SAAS,oBAAoB,MAAM,UAAU;AAC3C,oBAAc,QAAQ;AACtB,WAAK,gBAAgB,MAAM,UAAU,MAAM,MAAM,QAAQ,CAAC;AAC1D,aAAO;AAAA,IACT;AAGJ,IAAAA,cAAa,UAAU,iBACnB,SAAS,eAAe,MAAM,UAAU;AACtC,UAAI,MAAM,QAAQ,UAAU,GAAG;AAE/B,oBAAc,QAAQ;AAEtB,eAAS,KAAK;AACd,UAAI,WAAW;AACb,eAAO;AAET,aAAO,OAAO,IAAI;AAClB,UAAI,SAAS;AACX,eAAO;AAET,UAAI,SAAS,YAAY,KAAK,aAAa,UAAU;AACnD,YAAI,EAAE,KAAK,iBAAiB;AAC1B,eAAK,UAAU,uBAAO,OAAO,IAAI;AAAA,aAC9B;AACH,iBAAO,OAAO,IAAI;AAClB,cAAI,OAAO;AACT,iBAAK,KAAK,kBAAkB,MAAM,KAAK,YAAY,QAAQ;AAAA,QAC/D;AAAA,MACF,WAAW,OAAO,SAAS,YAAY;AACrC,mBAAW;AAEX,aAAK,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACrC,cAAI,KAAK,CAAC,MAAM,YAAY,KAAK,CAAC,EAAE,aAAa,UAAU;AACzD,+BAAmB,KAAK,CAAC,EAAE;AAC3B,uBAAW;AACX;AAAA,UACF;AAAA,QACF;AAEA,YAAI,WAAW;AACb,iBAAO;AAET,YAAI,aAAa;AACf,eAAK,MAAM;AAAA,aACR;AACH,oBAAU,MAAM,QAAQ;AAAA,QAC1B;AAEA,YAAI,KAAK,WAAW;AAClB,iBAAO,IAAI,IAAI,KAAK,CAAC;AAEvB,YAAI,OAAO,mBAAmB;AAC5B,eAAK,KAAK,kBAAkB,MAAM,oBAAoB,QAAQ;AAAA,MAClE;AAEA,aAAO;AAAA,IACT;AAEJ,IAAAA,cAAa,UAAU,MAAMA,cAAa,UAAU;AAEpD,IAAAA,cAAa,UAAU,qBACnB,SAAS,mBAAmB,MAAM;AAChC,UAAI,WAAW,QAAQ;AAEvB,eAAS,KAAK;AACd,UAAI,WAAW;AACb,eAAO;AAGT,UAAI,OAAO,mBAAmB,QAAW;AACvC,YAAI,UAAU,WAAW,GAAG;AAC1B,eAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,eAAK,eAAe;AAAA,QACtB,WAAW,OAAO,IAAI,MAAM,QAAW;AACrC,cAAI,EAAE,KAAK,iBAAiB;AAC1B,iBAAK,UAAU,uBAAO,OAAO,IAAI;AAAA;AAEjC,mBAAO,OAAO,IAAI;AAAA,QACtB;AACA,eAAO;AAAA,MACT;AAGA,UAAI,UAAU,WAAW,GAAG;AAC1B,YAAI,OAAO,OAAO,KAAK,MAAM;AAC7B,YAAI;AACJ,aAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAChC,gBAAM,KAAK,CAAC;AACZ,cAAI,QAAQ,iBAAkB;AAC9B,eAAK,mBAAmB,GAAG;AAAA,QAC7B;AACA,aAAK,mBAAmB,gBAAgB;AACxC,aAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,aAAK,eAAe;AACpB,eAAO;AAAA,MACT;AAEA,kBAAY,OAAO,IAAI;AAEvB,UAAI,OAAO,cAAc,YAAY;AACnC,aAAK,eAAe,MAAM,SAAS;AAAA,MACrC,WAAW,cAAc,QAAW;AAElC,aAAK,IAAI,UAAU,SAAS,GAAG,KAAK,GAAG,KAAK;AAC1C,eAAK,eAAe,MAAM,UAAU,CAAC,CAAC;AAAA,QACxC;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEJ,aAAS,WAAW,QAAQ,MAAM,QAAQ;AACxC,UAAI,SAAS,OAAO;AAEpB,UAAI,WAAW;AACb,eAAO,CAAC;AAEV,UAAI,aAAa,OAAO,IAAI;AAC5B,UAAI,eAAe;AACjB,eAAO,CAAC;AAEV,UAAI,OAAO,eAAe;AACxB,eAAO,SAAS,CAAC,WAAW,YAAY,UAAU,IAAI,CAAC,UAAU;AAEnE,aAAO,SACL,gBAAgB,UAAU,IAAI,WAAW,YAAY,WAAW,MAAM;AAAA,IAC1E;AAEA,IAAAA,cAAa,UAAU,YAAY,SAAS,UAAU,MAAM;AAC1D,aAAO,WAAW,MAAM,MAAM,IAAI;AAAA,IACpC;AAEA,IAAAA,cAAa,UAAU,eAAe,SAAS,aAAa,MAAM;AAChE,aAAO,WAAW,MAAM,MAAM,KAAK;AAAA,IACrC;AAEA,IAAAA,cAAa,gBAAgB,SAAS,SAAS,MAAM;AACnD,UAAI,OAAO,QAAQ,kBAAkB,YAAY;AAC/C,eAAO,QAAQ,cAAc,IAAI;AAAA,MACnC,OAAO;AACL,eAAO,cAAc,KAAK,SAAS,IAAI;AAAA,MACzC;AAAA,IACF;AAEA,IAAAA,cAAa,UAAU,gBAAgB;AACvC,aAAS,cAAc,MAAM;AAC3B,UAAI,SAAS,KAAK;AAElB,UAAI,WAAW,QAAW;AACxB,YAAI,aAAa,OAAO,IAAI;AAE5B,YAAI,OAAO,eAAe,YAAY;AACpC,iBAAO;AAAA,QACT,WAAW,eAAe,QAAW;AACnC,iBAAO,WAAW;AAAA,QACpB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,IAAAA,cAAa,UAAU,aAAa,SAAS,aAAa;AACxD,aAAO,KAAK,eAAe,IAAI,eAAe,KAAK,OAAO,IAAI,CAAC;AAAA,IACjE;AAEA,aAAS,WAAW,KAAK,GAAG;AAC1B,UAAI,OAAO,IAAI,MAAM,CAAC;AACtB,eAAS,IAAI,GAAG,IAAI,GAAG,EAAE;AACvB,aAAK,CAAC,IAAI,IAAI,CAAC;AACjB,aAAO;AAAA,IACT;AAEA,aAAS,UAAU,MAAM,OAAO;AAC9B,aAAO,QAAQ,IAAI,KAAK,QAAQ;AAC9B,aAAK,KAAK,IAAI,KAAK,QAAQ,CAAC;AAC9B,WAAK,IAAI;AAAA,IACX;AAEA,aAAS,gBAAgB,KAAK;AAC5B,UAAI,MAAM,IAAI,MAAM,IAAI,MAAM;AAC9B,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACnC,YAAI,CAAC,IAAI,IAAI,CAAC,EAAE,YAAY,IAAI,CAAC;AAAA,MACnC;AACA,aAAO;AAAA,IACT;AAEA,aAAS,KAAK,SAAS,MAAM;AAC3B,aAAO,IAAI,QAAQ,SAAU,SAAS,QAAQ;AAC5C,iBAAS,cAAc,KAAK;AAC1B,kBAAQ,eAAe,MAAM,QAAQ;AACrC,iBAAO,GAAG;AAAA,QACZ;AAEA,iBAAS,WAAW;AAClB,cAAI,OAAO,QAAQ,mBAAmB,YAAY;AAChD,oBAAQ,eAAe,SAAS,aAAa;AAAA,UAC/C;AACA,kBAAQ,CAAC,EAAE,MAAM,KAAK,SAAS,CAAC;AAAA,QAClC;AAAC;AAED,uCAA+B,SAAS,MAAM,UAAU,EAAE,MAAM,KAAK,CAAC;AACtE,YAAI,SAAS,SAAS;AACpB,wCAA8B,SAAS,eAAe,EAAE,MAAM,KAAK,CAAC;AAAA,QACtE;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,8BAA8B,SAAS,SAAS,OAAO;AAC9D,UAAI,OAAO,QAAQ,OAAO,YAAY;AACpC,uCAA+B,SAAS,SAAS,SAAS,KAAK;AAAA,MACjE;AAAA,IACF;AAEA,aAAS,+BAA+B,SAAS,MAAM,UAAU,OAAO;AACtE,UAAI,OAAO,QAAQ,OAAO,YAAY;AACpC,YAAI,MAAM,MAAM;AACd,kBAAQ,KAAK,MAAM,QAAQ;AAAA,QAC7B,OAAO;AACL,kBAAQ,GAAG,MAAM,QAAQ;AAAA,QAC3B;AAAA,MACF,WAAW,OAAO,QAAQ,qBAAqB,YAAY;AAGzD,gBAAQ,iBAAiB,MAAM,SAAS,aAAa,KAAK;AAGxD,cAAI,MAAM,MAAM;AACd,oBAAQ,oBAAoB,MAAM,YAAY;AAAA,UAChD;AACA,mBAAS,GAAG;AAAA,QACd,CAAC;AAAA,MACH,OAAO;AACL,cAAM,IAAI,UAAU,wEAAwE,OAAO,OAAO;AAAA,MAC5G;AAAA,IACF;AAAA;AAAA;;;ACtbA,SAAS,SAAS,OAAK;AACrB,SAAO,OAAO,UAAU;AAC1B;AA5DA,IAKM,cACA,eAEO,4BAWA;AAnBb;;AAKA,IAAM,eAAe,CAAA;AACrB,IAAM,gBAAgB,CAAA;AAEf,IAAM,6BAA6B,CAAC,MAAc,iBAAyC;AAChG,oBAAc,IAAI,IAAI;IACxB;AASO,IAAM,yBAAyB,CAIpC,SACK;MACL,MAAM,yBAAyB,MAAK;QAElC,YAAY,SAAkB,QAAY,SAAa;AAGrD,gBAAM,WAAW,MAAM,OAAO;AAE9B,iBAAO,eAAe,MAAM,iBAAiB,SAAS;AACtD,eAAK,OAAO;AACZ,cAAI,QAAQ;AACV,uBAAW,KAAK,QAAQ;AAGtB,mBAAK,CAAC,IAAI,OAAO,CAAC;YACpB;UACF;AACA,cAAI,WAAW,SAAS,OAAO,KAAK,WAAW,WAAW,EAAE,WAAW,OAAO;AAG5E,kBAAM,QAAQ,QAAQ;AACtB,iBAAK,QAAQ;AACb,gBAAI,WAAW,OAAO;AACpB,mBAAK,QAAQ,KAAK,QAAQ,cAAc,MAAM;YAChD;UACF;QACF;;AAGF,mBAAa,IAAI,IAAI;AAErB,aAAO;IACT;;;;;AC2PM,SAAU,oBAAoB,MAAY;AAC9C,UAAQ,MAAM;;IAEZ,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;EACX;AACA,MAAI,SAAU,QAAQ,QAAQ,OAAQ;AACpC,WAAO;EACT;AACF;AAxUA,IAUa,0BACA,qBACA,sCAGA,gBACA,mBACA,iBACA,gBACA,sBACA,yBACA,sBAIA,6BACA,+BAGA,uBACA,2BACA,6BACA,qBACA,cACA,mBACA,kBACA,0BACA,oBACA,yBACA,oBACA,mCAGA,mCAGA,mCAGA,oBACA,gCAGA,qBACA,uBACA,eACA,eACA,gBACA,cACA,8CAGA,yBACA,YACA,gBACA,2BACA,uBACA,iCACA,0BACA,8BACA,gCAGA,0BACA,oCAGA,4BACA,wBACA,aACA,cACA,kBACA,kBACA,sBACA,4BACA,iCAGA,2BACA,8CAGA,kBACA,cAEA,kBACA,kBACA,2BACA,2BACA,qBACA,mBACA,oBACA,6BACA,cACA,yBACA,wBACA,6BACA,uBACA,eACA,sBACA,0BACA,mBACA,0CAGA,uCAGA,qBACA,qBACA,oBACA,eACA,6BACA,oBACA,2BACA,yBACA,qBACA,WACA,oBACA,4BACA,gCAGA,wBACA,gCAGA,kCAGA,+BAGA,uBACA,0BACA,2BACA,uBACA,6BACA,6BACA,qBAEA,kBACA,gBACA,cACA,kBACA,aACA,YACA,kBACA,WACA,eACA,oBACA,oBAMA,cAIA,cAIA,6BAGA,mCAKA,uBACA,WAGA,kBAGA,eACA,iBACA,YAEA,qBACA,mCAUD,sBA+BC,gBAcA,aAoFA,sBAmCA;AAjXb;;;AAUO,IAAM,2BAA2B,uBAAuB,qBAAqB;AAC7E,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,uCAAuC,uBAClD,sCAAsC;AAEjC,IAAM,iBAAiB,uBAAuB,gBAAgB;AAC9D,IAAM,oBAAoB,uBAAuB,mBAAmB;AACpE,IAAM,kBAAkB,uBAAuB,iBAAiB;AAChE,IAAM,iBAAiB,uBAAuB,gBAAgB;AAC9D,IAAM,uBAAuB,uBAAuB,sBAAsB;AAC1E,IAAM,0BAA0B,uBAAuB,yBAAyB;AAChF,IAAM,uBAAuB,uBAGlC,sBAAsB;AACjB,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,gCAAgC,uBAC3C,+BAA+B;AAE1B,IAAM,wBAAwB,uBAAuB,kBAAkB;AACvE,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,eAAe,uBAAuB,cAAc;AAC1D,IAAM,oBAAoB,uBAAuB,mBAAmB;AACpE,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,2BAA2B,uBAAuB,0BAA0B;AAClF,IAAM,qBAAqB,uBAAuB,0BAA0B;AAC5E,IAAM,0BAA0B,uBAAuB,yBAAyB;AAChF,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,oCAAoC,uBAC/C,mCAAmC;AAE9B,IAAM,oCAAoC,uBAC/C,mCAAmC;AAE9B,IAAM,oCAAoC,uBAC/C,mCAAmC;AAE9B,IAAM,qBAAqB,uBAAuB,eAAe;AACjE,IAAM,iCAAiC,uBAC5C,gCAAgC;AAE3B,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,wBAAwB,uBAAuB,uBAAuB;AAC5E,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,iBAAiB,uBAAuB,gBAAgB;AAC9D,IAAM,eAAe,uBAAuB,cAAc;AAC1D,IAAM,+CAA+C,uBAC1D,8CAA8C;AAEzC,IAAM,0BAA0B,uBAAuB,yBAAyB;AAChF,IAAM,aAAa,uBAAuB,YAAY;AACtD,IAAM,iBAAiB,uBAAuB,gBAAgB;AAC9D,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,wBAAwB,uBAAuB,uBAAuB;AAC5E,IAAM,kCAAkC,uBAAuB,4BAA4B;AAC3F,IAAM,2BAA2B,uBAAuB,qBAAqB;AAC7E,IAAM,+BAA+B,uBAAuB,8BAA8B;AAC1F,IAAM,iCAAiC,uBAC5C,gCAAgC;AAE3B,IAAM,2BAA2B,uBAAuB,qBAAqB;AAC7E,IAAM,qCAAqC,uBAChD,+BAA+B;AAE1B,IAAM,6BAA6B,uBAAuB,uBAAuB;AACjF,IAAM,yBAAyB,uBAAuB,wBAAwB;AAC9E,IAAM,cAAc,uBAAuB,aAAa;AACxD,IAAM,eAAe,uBAAuB,cAAc;AAC1D,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,uBAAuB,uBAAuB,sBAAsB;AAC1E,IAAM,6BAA6B,uBAAuB,4BAA4B;AACtF,IAAM,kCAAkC,uBAC7C,iCAAiC;AAE5B,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,+CAA+C,uBAC1D,8CAA8C;AAEzC,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,eAAe,uBAAuB,cAAc;AAE1D,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,oBAAoB,uBAAuB,mBAAmB;AACpE,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,eAAe,uBAAuB,cAAc;AAC1D,IAAM,0BAA0B,uBAAuB,oBAAoB;AAC3E,IAAM,yBAAyB,uBAAuB,mBAAmB;AACzE,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,wBAAwB,uBAAuB,uBAAuB;AAC5E,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,uBAAuB,uBAAuB,sBAAsB;AAC1E,IAAM,2BAA2B,uBAAuB,0BAA0B;AAClF,IAAM,oBAAoB,uBAAuB,mBAAmB;AACpE,IAAM,2CAA2C,uBACtD,0CAA0C;AAErC,IAAM,wCAAwC,uBACnD,uCAAuC;AAElC,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,0BAA0B,uBAAuB,yBAAyB;AAChF,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,YAAY,uBAAuB,WAAW;AACpD,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,6BAA6B,uBAAuB,4BAA4B;AACtF,IAAM,iCAAiC,uBAC5C,gCAAgC;AAE3B,IAAM,yBAAyB,uBAAuB,wBAAwB;AAC9E,IAAM,iCAAiC,uBAC5C,gCAAgC;AAE3B,IAAM,mCAAmC,uBAC9C,kCAAkC;AAE7B,IAAM,gCAAgC,uBAC3C,+BAA+B;AAE1B,IAAM,wBAAwB,uBAAuB,uBAAuB;AAC5E,IAAM,2BAA2B,uBAAuB,0BAA0B;AAClF,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,wBAAwB,uBAAuB,uBAAuB;AAC5E,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,sBAAsB,uBAAuB,qBAAqB;AAExE,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,iBAAiB,uBAAuB,gBAAgB;AAC9D,IAAM,eAAe,uBAAuB,cAAc;AAC1D,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,cAAc,uBAAuB,aAAa;AACxD,IAAM,aAAa,uBAAuB,YAAY;AACtD,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,YAAY,uBAAuB,WAAW;AACpD,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,qBAAqB,uBAAuB,oBAAoB;AAMtE,IAAM,eAAe,uBAG1B,cAAc;AACT,IAAM,eAAe,uBAG1B,cAAc;AACT,IAAM,8BAA8B,uBAAuB,6BAA6B;AAGxF,IAAM,oCAAoC,uBAC/C,mCAAmC;AAI9B,IAAM,wBAAwB,uBAAuB,mBAAmB;AACxE,IAAM,YAAY,uBAAuB,WAAW;AAGpD,IAAM,mBAAmB,uBAAuB,kBAAkB;AAGlE,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,kBAAkB,uBAAuB,iBAAiB;AAChE,IAAM,aAAa,uBAAuB,YAAY;AAEtD,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,oCAAoC,uBAC/C,mCAAmC;AASrC,KAAA,SAAYE,uBAAoB;AAC9B,MAAAA,sBAAA,SAAA,IAAA;AACA,MAAAA,sBAAA,0BAAA,IAAA;AACA,MAAAA,sBAAA,8BAAA,IAAA;AACA,MAAAA,sBAAA,0BAAA,IAAA;IACF,GALY,yBAAA,uBAAoB,CAAA,EAAA;AA+B1B,IAAO,iBAAP,cAA8B,MAAK;MAEvC,YAAY,SAAiBC,KAAU;AACrC,cAAM,OAAO;AACb,cAAM,WAAW,IAAI;AACrB,aAAK,OAAO;AACZ,aAAK,UAAU;AACf,aAAK,QAAQ,IAAI,MAAM,OAAO,EAAE;AAChC,aAAK,KAAKA;MACZ;;AAGF,+BAA2B,kBAAkB,OAAK,IAAI,eAAe,EAAE,SAAS,EAAE,EAAE,CAAC;AAE9E,IAAM,cAAc;MACzB,gCAAgC;MAChC,yBAAyB;MACzB,mBAAmB;MACnB,cAAc;MACd,sBAAsB;MACtB,qCAAqC;MACrC,iCAAiC;MACjC,4BAA4B;MAC5B,kCAAkC;MAClC,yBAAyB;MACzB,oBAAoB;MACpB,qBAAqB;MACrB,gBAAgB;MAChB,gBAAgB;MAChB,QAAQ;MACR,mBAAmB;MACnB,gBAAgB;MAChB,kBAAkB;MAClB,iBAAiB;MACjB,mBAAmB;MACnB,sBAAsB;MACtB,wBAAwB;MACxB,aAAa;MACb,gBAAgB;MAChB,WAAW;MACX,eAAe;MACf,mBAAmB;MACnB,gBAAgB;MAChB,4BAA4B;MAC5B,gBAAgB;MAChB,yBAAyB;MACzB,IAAI;MACJ,wBAAwB;MACxB,2BAA2B;MAC3B,+BAA+B;MAC/B,mBAAmB;MACnB,cAAc;MACd,wBAAwB;MACxB,kBAAkB;MAClB,kCAAkC;MAClC,yBAAyB;MACzB,oBAAoB;MACpB,kCAAkC;MAClC,kCAAkC;MAClC,4BAA4B;MAC5B,sBAAsB;MACtB,aAAa;MACb,uBAAuB;MACvB,uBAAuB;MACvB,sBAAsB;MACtB,uBAAuB;;MAGvB,uBAAuB;;AA8BnB,IAAO,uBAAP,MAAO,8BAA6B,MAAK;;;;;;;MAU7C,YACE,YACA,EAAE,0BAA0B,KAAI,IAA4C,CAAA,GAAE;AAE9E,cAAM,aACJ,OAAO,KAAK,WAAW,EAAE,KAAK,OAAK,YAAY,CAAC,MAAM,UAAU,KAAK;AACvE,cAAM,OAAO,oBAAoB,UAAU,KAAK;AAChD,cAAM,gBAAgB,WAAW,SAAS,EAAE;AAC5C,cAAM,UAAU,kBAAkB,IAAI,OAAO,aAAa;AAE1D,cAAM,OAAO;AACb,aAAK,OAAO;AAEZ,aAAK,aAAa;AAClB,aAAK,aAAa;AAElB,eAAO,eAAe,MAAM,sBAAqB,SAAS;AAG1D,YAAI,2BAA2B,eAAe,YAAY,eAAe;AACvE,iBAAO,IAAI,kBAAkB,OAAO;QACtC;MACF;;AAGI,IAAO,oBAAP,MAAO,2BAA0B,qBAAoB;MACzD,YAAY,SAAgB;AAC1B,cAAM,YAAY,eAAe,EAAE,yBAAyB,MAAK,CAAE;AACnE,YAAI,SAAS;AACX,eAAK,UAAU;QACjB;AACA,aAAK,OAAO;AACZ,eAAO,eAAe,MAAM,mBAAkB,SAAS;MACzD;;AAMF,+BAA2B,wBAAwB,OAAK,IAAI,qBAAqB,EAAE,UAAU,CAAC;;;;;ACxM9F,SAAS,SAASC,MAAQ;AACxB,WAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,QAAI;AACF,kBAAY,CAAC,EAAEA,IAAG;aACX,GAAG;AACV,cAAQ,MAAM,CAAC;;;AAGrB;AA7JA,IAAI,IACE,aAQO,KAmBA,OAiCA,aA2EA;AAxIb,IAAAC,eAAA;;IAAI,KAAK;AACT,IAAM,cAA4B,CAAA;AAQ3B,IAAM,MAAM,CAAC,MAAe,SAAkB,SAAkB;AACrE,YAAM,MAAW;QACf;QACA,IAAI,OAAO,EAAE,EAAE;QACf,MAAM,oBAAI,KAAI;;AAEhB,UAAI;AAAS,YAAI,UAAU;AAC3B,UAAI;AAAM,YAAI,OAAO;AACrB,eAAS,GAAG;IACd;AAUO,IAAM,QAAQ,CAAC,EACpB,MACA,SACA,MACA,SAAAC,SAAO,MAMJ;AACH,YAAM,MAAW;QACf;QACA,IAAI,OAAO,EAAE,EAAE;QACf,MAAM,oBAAI,KAAI;;AAGhB,UAAI;AAAS,YAAI,UAAU;AAC3B,UAAI;AAAM,YAAI,OAAO;AACrB,UAAIA;AAAS,YAAI,UAAUA;AAE3B,eAAS,GAAG;IACd;AAWM,IAAO,cAAP,MAAO,aAAW;MACtB,YACU,MACAA,UAAsB;AADtB,aAAA,OAAA;AACA,aAAA,UAAAA;MACP;MAEH,MAAM,SAAiB,MAAmB;AACxC,cAAM;UACJ,MAAM,KAAK;UACX;UACA;UACA,SAAS,KAAK;SACf;MACH;MAEA,aAAU;AACR,eAAO,KAAK;MACd;MAEA,WAAWA,UAAsB;AAC/B,aAAK,UAAUA;MACjB;MAEA,cAAc,cAA0B;AACtC,aAAK,UAAO,OAAA,OAAA,OAAA,OAAA,CAAA,GAAQ,KAAK,OAAO,GAAK,YAAY;MACnD;MAEA,UAAO;AACL,eAAO,KAAK;MACd;MAEA,QAAQ,MAAa;AACnB,aAAK,OAAO;MACd;;;;;;;MAQA,SAAS,MAAa;AACpB,eAAO,IAAI,aAAY,MAAM,KAAK,OAAO;MAC3C;;;;;;;;;MAUA,YAAYA,UAAsB;AAChC,eAAO,IAAI,aAAY,KAAK,MAAMA,QAAO;MAC3C;;;;;;;;MASA,mBAAmB,cAA0B;AAC3C,eAAO,IAAI,aAAY,KAAK,MAAI,OAAA,OAAA,OAAA,OAAA,CAAA,GAAO,KAAK,OAAO,GAAK,YAAY,CAAA;MACtE;;AASK,IAAM,SAAS,CAAC,OAA+B;AACpD,kBAAY,KAAK,EAAE;AACnB,aAAO,MAAK;AACV,cAAM,IAAI,YAAY,QAAQ,EAAE;AAEhC,YAAI,MAAM,IAAI;AAEZ,sBAAY,CAAC,IAAI,YAAY,YAAY,SAAS,CAAC;AACnD,sBAAY,IAAG;;MAEnB;IACF;AAoBA,QAAI,OAAO,WAAW,aAAa;AACjC,aAAO,qBAAqB;;;;;;IC1M9B,0BAYM,kBAyCe;;;AArDrB,oBAAyB;AAEzB;AAOA,IAAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAGA,IAAM,mBAAmB;AAyCzB,IAAqB,YAArB,MAA8B;MAM5B,YAAY,EAAE,SAAAC,UAAS,QAAO,IAAoD,CAAA,GAAE;AALpF,aAAA,kBAAkB;AAClB,aAAA,sBAAsB;AACtB,aAAA,cAA8C;AAoI9C,aAAA,UAAU,IAAI,cAAAC,QAAY;AA6D1B,aAAA,OAAO,CAAA,OAAA,OAAA,MAAA,SAAA,WAQc,UAAA,MAAA,CAAA,OAAA,OAAA,MAAA,MAAA,GAAA,MAAA,GAAA,QAAA,WAPnB,KACA,KACA,IACA,IACA,OAAe,OAAO,MAAM,CAAC,GAC7B,aAA4B,CAAC,YAAY,EAAE,GAC3C,EAAE,eAAc,IAAkC,CAAA,GAAE;AAEpD,gBAAM,SAAS,KAAK,OAAO,mBAAmB,EAAE,UAAU,OAAM,CAAE;AAElE,cAAI,KAAK,UAAU,KAAK;AACtB,mBAAO,MAAM,wCAAwC,EAAE,YAAY,KAAK,OAAM,CAAE;AAChF,kBAAM,IAAI,eACR,8CAA8C,KAAK,QACnD,kBAAkB;UAEtB;AAEA,iBAAO,MAAM,wBAAwB,EAAE,eAAc,CAAE;AACvD,gBAAM,WAAW,MAAM,KAAK;;YAE1B,OAAO,OAAO,CAAC,OAAO,KAAK,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC,GAAG,OAAO,KAAK,CAAC,KAAK,MAAM,CAAC,GAAG,IAAI,CAAC;YACjF,EAAE,eAAc;UAAE;AAEpB,iBAAO,MAAM,iCAAiC;AAC9C,gBAAM,KAAK,SAAS,aAAa,SAAS,SAAS,CAAC;AAEpD,cAAI,CAAC,WAAW,KAAK,OAAK,MAAM,EAAE,GAAG;AACnC,kBAAM,IAAI,qBAAqB,EAAE;UACnC;AAEA,iBAAO;QACT,CAAC;AAyGD,aAAA,cAA6B;AAvU3B,aAAK,SAAS,IAAI,YAAY,YAAO,QAAP,YAAO,SAAP,UAAW,kBAAkBD,QAAO;MACpE;;;;;;;;;;MA+DA,SACE,OACA,EAAE,gBAAgB,gBAAe,IAAkC,CAAA,GAAE;AAErE,cAAM,IAAI,MAAM,0BAA0B;MAC5C;;;;;;;;MASA,aAAa,OAAiB,UAA0B;AACtD,YAAI,eAAe;AACnB,cAAM,cAAc,MAAK;AACvB,yBAAe;QACjB;AAEA,cAAM,OAAO,MAAW,UAAA,MAAA,QAAA,QAAA,aAAA;AACtB,cAAI;AAAc;AAClB,qBAAW,QAAQ,OAAO;AACxB,kBAAM,IAAI,MAAM,KAAK,SAAS,IAAI;AAClC,gBAAI;AAAc;AAClB,kBAAM,SAAS,EAAE,aAAa,EAAE,SAAS,CAAC;AAC1C,gBAAI,WAAW,YAAY,IAAI;AAC7B,oBAAM,IAAI,qBAAqB,MAAM;YACvC;AACA,qBAAS,KAAK,CAAC;UACjB;QACF,CAAC;AAED,aAAI,EAAG,KACL,MAAM,CAAC,gBAAgB,SAAS,SAAQ,GACxC,OAAK,CAAC,gBAAgB,SAAS,MAAM,CAAC,CAAC;AAGzC,eAAO,EAAE,YAAW;MACtB;;;;;;;;;MAUA,eAAe,MAAY;MAAG;;;;;;;;;;MAW9B,QAAK;AACH,eAAO,QAAQ,QAAO;MACxB;;;;;;;;MAWA,GAAG,WAAmB,IAAgC;AACpD,aAAK,QAAQ,GAAG,WAAW,EAAE;MAC/B;;;;MAKA,IAAI,WAAmB,IAAgC;AACrD,aAAK,QAAQ,eAAe,WAAW,EAAE;MAC3C;MAEA,KAAK,UAAkB,MAAS;AAC9B,aAAK,QAAQ,KAAK,OAAO,GAAG,IAAI;MAClC;;;;MAKA,eAAY;AACV,gBAAQ,KACN,8FAA8F;MAElG;;;;MAKA,mBAAmB,iBAAuB;AACxC,aAAK,kBAAkB;MACzB;;;;MAKA,+BAA+B,qBAA2B;AACxD,aAAK,sBAAsB;MAC7B;;;;;;;;MA0DA,OAAO,OAAO,cAAc,KAAM,eAAsB;AACtD,eAAO,IAAI,QAAQ,CAAC,SAAS,WAAU;AACrC,cAAI,QAAQ;AACZ,gBAAM,MAAM,KAAK,OAAO;YACtB,MAAM,OAAI;AACR,sBAAQ;AACR,kBAAI;AAAK,oBAAI,YAAW;AACxB,kBAAI;AAAiB,6BAAa,eAAe;AACjD,mBAAK,KAAK,EAAE,YAAY,WAAW,EAAE,KAAK,SAAS,MAAM;YAC3D;YACA,OAAO,OAAI;AACT,kBAAI;AAAiB,6BAAa,eAAe;AACjD,qBAAO,CAAC;YACV;YACA,UAAU,MAAK;AACb,kBAAI;AAAiB,6BAAa,eAAe;AAEjD,kBAAI,CAAC,OAAO;AACV,uBAAO,IAAI,eAAe,KAAK,4BAA4B,eAAe,CAAC;cAC7E;YACF;WACD;AACD,gBAAM,kBAAkB,gBACpB,WAAW,MAAK;AACd,gBAAI,YAAW;AACf,mBAAO,IAAI,eAAe,KAAK,4BAA4B,eAAe,CAAC;UAC7E,GAAG,aAAa,IAChB;QACN,CAAC;MACH;;;;;;;;;MAaM,mBAA2B,GAAwB;;AACvD,gBAAM,SAAS,KAAK,OAAO,mBAAmB;YAC5C,UAAU;YACV,qBAAqB,KAAK;WAC3B;AAED,cAAI,KAAK,qBAAqB;AAC5B,mBAAO,MAAM,iCAAiC;AAC9C,kBAAM,IAAI,uBACR,+EAA+E;UAEnF;AAGA,cAAI;AACJ,gBAAM,cAA6B,IAAI,QAAQ,OAAI;AACjD,0BAAc;UAChB,CAAC;AACD,eAAK,sBAAsB;AAG3B,cAAI,sBAAsB;AAC1B,gBAAM,UAAU,WAAW,MAAK;AAC9B,mBAAO,MAAM,4DAA4D;cACvE,qBAAqB,KAAK;aAC3B;AACD,kCAAsB;AACtB,iBAAK,KAAK,cAAc;UAC1B,GAAG,KAAK,mBAAmB;AAE3B,cAAI;AACF,kBAAM,MAAM,MAAM,EAAC;AAEnB,gBAAI,qBAAqB;AACvB,qBAAO,MAAM,8CAA8C;AAC3D,mBAAK,KAAK,YAAY;YACxB;AAEA,mBAAO;UACT;AACE,mBAAO,MAAM,+BAA+B;AAE5C,yBAAa,OAAO;AACpB,gBAAI;AAAa,0BAAW;AAC5B,iBAAK,sBAAsB;UAC7B;QACF,CAAC;;MAED,sBAAsB,MAA2B,SAAwB,aAAmB;AAC1F,mBAAW,cAAc,SAAS;AAChC,eAAK,UAAU,IAAI,KAAK,qBAAqB,YAAY,KAAK,UAAU,GAAG,MAAM,WAAW;QAC9F;MACF;MAIA,qBACE,YACA,GACA,KACA,aAAmB;AAEnB,eAAO,IAAU,SAAQ,UAAA,MAAA,QAAA,QAAA,aAAA;AACvB,gBAAM,EAAE,YAAW,IAAK;AAExB,cAAI,aAAa;AACf,mBAAO,QAAQ,OACb,IAAI,eAAe,iCAAiC,cAAc,KAAK,iBAAiB,CAAC;UAE7F;AAEA,cAAI;AACF,iBAAK,cAAc;AACnB,iBAAK,eAAe,WAAW;AAC/B,mBAAO,MAAM,EAAE,MAAM,KAAK,IAAI;UAChC;AACE,iBAAK,cAAc;UACrB;QACF,CAAC;MACH;;;;;;;;;MAUA,gBAAgBA,UAAsB;AACpC,aAAK,SAAS,KAAK,OAAO,YAAYA,QAAO;MAC/C;;;;;;;;MASA,mBAAmB,cAA0B;AAC3C,aAAK,OAAO,cAAc,YAAY;MACxC;;;;MAKA,kBAAe;AACb,eAAO,KAAK,OAAO,WAAU;MAC/B;;AAEO,cAAA,6BAA6B;AAC7B,cAAA,6BAA6B;wBAxYjB;;;;;ACrDrB;AAAA;AAEA,QAAM,sBAAsB;AAE5B,QAAM,aAAa;AACnB,QAAM,mBAAmB,OAAO;AAAA,IACL;AAG3B,QAAM,4BAA4B;AAIlC,QAAM,wBAAwB,aAAa;AAE3C,QAAM,gBAAgB;AAAA,MACpB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,yBAAyB;AAAA,MACzB,YAAY;AAAA,IACd;AAAA;AAAA;;;AClCA;AAAA;AAAA,QAAM,QACJ,OAAO,YAAY,YACnB,QAAQ,OACR,QAAQ,IAAI,cACZ,cAAc,KAAK,QAAQ,IAAI,UAAU,IACvC,IAAI,SAAS,QAAQ,MAAM,UAAU,GAAG,IAAI,IAC5C,MAAM;AAAA,IAAC;AAEX,WAAO,UAAU;AAAA;AAAA;;;ACRjB;AAAA;AAAA,QAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI;AACJ,QAAM,QAAQ;AACd,cAAU,OAAO,UAAU,CAAC;AAG5B,QAAM,KAAK,QAAQ,KAAK,CAAC;AACzB,QAAM,SAAS,QAAQ,SAAS,CAAC;AACjC,QAAM,MAAM,QAAQ,MAAM,CAAC;AAC3B,QAAM,IAAI,QAAQ,IAAI,CAAC;AACvB,QAAI,IAAI;AAER,QAAM,mBAAmB;AAQzB,QAAM,wBAAwB;AAAA,MAC5B,CAAC,OAAO,CAAC;AAAA,MACT,CAAC,OAAO,UAAU;AAAA,MAClB,CAAC,kBAAkB,qBAAqB;AAAA,IAC1C;AAEA,QAAM,gBAAgB,CAAC,UAAU;AAC/B,iBAAW,CAAC,OAAO,GAAG,KAAK,uBAAuB;AAChD,gBAAQ,MACL,MAAM,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,MAAM,GAAG,GAAG,EAC5C,MAAM,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,MAAM,GAAG,GAAG;AAAA,MACjD;AACA,aAAO;AAAA,IACT;AAEA,QAAM,cAAc,CAAC,MAAM,OAAO,aAAa;AAC7C,YAAM,OAAO,cAAc,KAAK;AAChC,YAAM,QAAQ;AACd,YAAM,MAAM,OAAO,KAAK;AACxB,QAAE,IAAI,IAAI;AACV,UAAI,KAAK,IAAI;AACb,SAAG,KAAK,IAAI,IAAI,OAAO,OAAO,WAAW,MAAM,MAAS;AACxD,aAAO,KAAK,IAAI,IAAI,OAAO,MAAM,WAAW,MAAM,MAAS;AAAA,IAC7D;AAQA,gBAAY,qBAAqB,aAAa;AAC9C,gBAAY,0BAA0B,MAAM;AAM5C,gBAAY,wBAAwB,gBAAgB,gBAAgB,GAAG;AAKvE,gBAAY,eAAe,IAAI,IAAI,EAAE,iBAAiB,CAAC,QAChC,IAAI,EAAE,iBAAiB,CAAC,QACxB,IAAI,EAAE,iBAAiB,CAAC,GAAG;AAElD,gBAAY,oBAAoB,IAAI,IAAI,EAAE,sBAAsB,CAAC,QACrC,IAAI,EAAE,sBAAsB,CAAC,QAC7B,IAAI,EAAE,sBAAsB,CAAC,GAAG;AAK5D,gBAAY,wBAAwB,MAAM,IAAI,EAAE,iBAAiB,CACjE,IAAI,IAAI,EAAE,oBAAoB,CAAC,GAAG;AAElC,gBAAY,6BAA6B,MAAM,IAAI,EAAE,sBAAsB,CAC3E,IAAI,IAAI,EAAE,oBAAoB,CAAC,GAAG;AAMlC,gBAAY,cAAc,QAAQ,IAAI,EAAE,oBAAoB,CAC5D,SAAS,IAAI,EAAE,oBAAoB,CAAC,MAAM;AAE1C,gBAAY,mBAAmB,SAAS,IAAI,EAAE,yBAAyB,CACvE,SAAS,IAAI,EAAE,yBAAyB,CAAC,MAAM;AAK/C,gBAAY,mBAAmB,GAAG,gBAAgB,GAAG;AAMrD,gBAAY,SAAS,UAAU,IAAI,EAAE,eAAe,CACpD,SAAS,IAAI,EAAE,eAAe,CAAC,MAAM;AAWrC,gBAAY,aAAa,KAAK,IAAI,EAAE,WAAW,CAC/C,GAAG,IAAI,EAAE,UAAU,CAAC,IAClB,IAAI,EAAE,KAAK,CAAC,GAAG;AAEjB,gBAAY,QAAQ,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG;AAK3C,gBAAY,cAAc,WAAW,IAAI,EAAE,gBAAgB,CAC3D,GAAG,IAAI,EAAE,eAAe,CAAC,IACvB,IAAI,EAAE,KAAK,CAAC,GAAG;AAEjB,gBAAY,SAAS,IAAI,IAAI,EAAE,UAAU,CAAC,GAAG;AAE7C,gBAAY,QAAQ,cAAc;AAKlC,gBAAY,yBAAyB,GAAG,IAAI,EAAE,sBAAsB,CAAC,UAAU;AAC/E,gBAAY,oBAAoB,GAAG,IAAI,EAAE,iBAAiB,CAAC,UAAU;AAErE,gBAAY,eAAe,YAAY,IAAI,EAAE,gBAAgB,CAAC,WACjC,IAAI,EAAE,gBAAgB,CAAC,WACvB,IAAI,EAAE,gBAAgB,CAAC,OAC3B,IAAI,EAAE,UAAU,CAAC,KACrB,IAAI,EAAE,KAAK,CAAC,OACR;AAEzB,gBAAY,oBAAoB,YAAY,IAAI,EAAE,qBAAqB,CAAC,WACtC,IAAI,EAAE,qBAAqB,CAAC,WAC5B,IAAI,EAAE,qBAAqB,CAAC,OAChC,IAAI,EAAE,eAAe,CAAC,KAC1B,IAAI,EAAE,KAAK,CAAC,OACR;AAE9B,gBAAY,UAAU,IAAI,IAAI,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,WAAW,CAAC,GAAG;AACjE,gBAAY,eAAe,IAAI,IAAI,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,gBAAgB,CAAC,GAAG;AAI3E,gBAAY,eAAe,GAAG,mBACP,GAAG,yBAAyB,kBACrB,yBAAyB,oBACzB,yBAAyB,MAAM;AAC7D,gBAAY,UAAU,GAAG,IAAI,EAAE,WAAW,CAAC,cAAc;AACzD,gBAAY,cAAc,IAAI,EAAE,WAAW,IAC7B,MAAM,IAAI,EAAE,UAAU,CAAC,QACjB,IAAI,EAAE,KAAK,CAAC,gBACJ;AAC5B,gBAAY,aAAa,IAAI,EAAE,MAAM,GAAG,IAAI;AAC5C,gBAAY,iBAAiB,IAAI,EAAE,UAAU,GAAG,IAAI;AAIpD,gBAAY,aAAa,SAAS;AAElC,gBAAY,aAAa,SAAS,IAAI,EAAE,SAAS,CAAC,QAAQ,IAAI;AAC9D,YAAQ,mBAAmB;AAE3B,gBAAY,SAAS,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,WAAW,CAAC,GAAG;AACjE,gBAAY,cAAc,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,gBAAgB,CAAC,GAAG;AAI3E,gBAAY,aAAa,SAAS;AAElC,gBAAY,aAAa,SAAS,IAAI,EAAE,SAAS,CAAC,QAAQ,IAAI;AAC9D,YAAQ,mBAAmB;AAE3B,gBAAY,SAAS,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,WAAW,CAAC,GAAG;AACjE,gBAAY,cAAc,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,gBAAgB,CAAC,GAAG;AAG3E,gBAAY,mBAAmB,IAAI,IAAI,EAAE,IAAI,CAAC,QAAQ,IAAI,EAAE,UAAU,CAAC,OAAO;AAC9E,gBAAY,cAAc,IAAI,IAAI,EAAE,IAAI,CAAC,QAAQ,IAAI,EAAE,SAAS,CAAC,OAAO;AAIxE,gBAAY,kBAAkB,SAAS,IAAI,EAAE,IAAI,CACjD,QAAQ,IAAI,EAAE,UAAU,CAAC,IAAI,IAAI,EAAE,WAAW,CAAC,KAAK,IAAI;AACxD,YAAQ,wBAAwB;AAMhC,gBAAY,eAAe,SAAS,IAAI,EAAE,WAAW,CAAC,cAE/B,IAAI,EAAE,WAAW,CAAC,QACf;AAE1B,gBAAY,oBAAoB,SAAS,IAAI,EAAE,gBAAgB,CAAC,cAEpC,IAAI,EAAE,gBAAgB,CAAC,QACpB;AAG/B,gBAAY,QAAQ,iBAAiB;AAErC,gBAAY,QAAQ,2BAA2B;AAC/C,gBAAY,WAAW,6BAA6B;AAAA;AAAA;;;ACxNpD;AAAA;AACA,QAAM,cAAc,OAAO,OAAO,EAAE,OAAO,KAAK,CAAC;AACjD,QAAM,YAAY,OAAO,OAAO,CAAE,CAAC;AACnC,QAAM,eAAe,aAAW;AAC9B,UAAI,CAAC,SAAS;AACZ,eAAO;AAAA,MACT;AAEA,UAAI,OAAO,YAAY,UAAU;AAC/B,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AACA,WAAO,UAAU;AAAA;AAAA;;;ACdjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,qBAAqB,CAAC,GAAG,MAAM;AACnC,YAAM,OAAO,QAAQ,KAAK,CAAC;AAC3B,YAAM,OAAO,QAAQ,KAAK,CAAC;AAE3B,UAAI,QAAQ,MAAM;AAChB,YAAI,CAAC;AACL,YAAI,CAAC;AAAA,MACP;AAEA,aAAO,MAAM,IAAI,IACZ,QAAQ,CAAC,OAAQ,KACjB,QAAQ,CAAC,OAAQ,IAClB,IAAI,IAAI,KACR;AAAA,IACN;AAEA,QAAM,sBAAsB,CAAC,GAAG,MAAM,mBAAmB,GAAG,CAAC;AAE7D,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAAA;AAAA;;;ACtBA;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,EAAE,YAAY,iBAAiB,IAAI;AACzC,QAAM,EAAE,QAAQ,IAAI,EAAE,IAAI;AAE1B,QAAM,eAAe;AACrB,QAAM,EAAE,mBAAmB,IAAI;AAC/B,QAAM,SAAN,MAAM,QAAO;AAAA,MACX,YAAa,SAAS,SAAS;AAC7B,kBAAU,aAAa,OAAO;AAE9B,YAAI,mBAAmB,SAAQ;AAC7B,cAAI,QAAQ,UAAU,CAAC,CAAC,QAAQ,SAC5B,QAAQ,sBAAsB,CAAC,CAAC,QAAQ,mBAAmB;AAC7D,mBAAO;AAAA,UACT,OAAO;AACL,sBAAU,QAAQ;AAAA,UACpB;AAAA,QACF,WAAW,OAAO,YAAY,UAAU;AACtC,gBAAM,IAAI,UAAU,gDAAgD,OAAO,OAAO,IAAI;AAAA,QACxF;AAEA,YAAI,QAAQ,SAAS,YAAY;AAC/B,gBAAM,IAAI;AAAA,YACR,0BAA0B,UAAU;AAAA,UACtC;AAAA,QACF;AAEA,cAAM,UAAU,SAAS,OAAO;AAChC,aAAK,UAAU;AACf,aAAK,QAAQ,CAAC,CAAC,QAAQ;AAGvB,aAAK,oBAAoB,CAAC,CAAC,QAAQ;AAEnC,cAAM,IAAI,QAAQ,KAAK,EAAE,MAAM,QAAQ,QAAQ,GAAG,EAAE,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC;AAEvE,YAAI,CAAC,GAAG;AACN,gBAAM,IAAI,UAAU,oBAAoB,OAAO,EAAE;AAAA,QACnD;AAEA,aAAK,MAAM;AAGX,aAAK,QAAQ,CAAC,EAAE,CAAC;AACjB,aAAK,QAAQ,CAAC,EAAE,CAAC;AACjB,aAAK,QAAQ,CAAC,EAAE,CAAC;AAEjB,YAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAAG;AACnD,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC7C;AAEA,YAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAAG;AACnD,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC7C;AAEA,YAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAAG;AACnD,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC7C;AAGA,YAAI,CAAC,EAAE,CAAC,GAAG;AACT,eAAK,aAAa,CAAC;AAAA,QACrB,OAAO;AACL,eAAK,aAAa,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,CAACE,QAAO;AAC5C,gBAAI,WAAW,KAAKA,GAAE,GAAG;AACvB,oBAAM,MAAM,CAACA;AACb,kBAAI,OAAO,KAAK,MAAM,kBAAkB;AACtC,uBAAO;AAAA,cACT;AAAA,YACF;AACA,mBAAOA;AAAA,UACT,CAAC;AAAA,QACH;AAEA,aAAK,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;AACvC,aAAK,OAAO;AAAA,MACd;AAAA,MAEA,SAAU;AACR,aAAK,UAAU,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK;AACxD,YAAI,KAAK,WAAW,QAAQ;AAC1B,eAAK,WAAW,IAAI,KAAK,WAAW,KAAK,GAAG,CAAC;AAAA,QAC/C;AACA,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,WAAY;AACV,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,QAAS,OAAO;AACd,cAAM,kBAAkB,KAAK,SAAS,KAAK,SAAS,KAAK;AACzD,YAAI,EAAE,iBAAiB,UAAS;AAC9B,cAAI,OAAO,UAAU,YAAY,UAAU,KAAK,SAAS;AACvD,mBAAO;AAAA,UACT;AACA,kBAAQ,IAAI,QAAO,OAAO,KAAK,OAAO;AAAA,QACxC;AAEA,YAAI,MAAM,YAAY,KAAK,SAAS;AAClC,iBAAO;AAAA,QACT;AAEA,eAAO,KAAK,YAAY,KAAK,KAAK,KAAK,WAAW,KAAK;AAAA,MACzD;AAAA,MAEA,YAAa,OAAO;AAClB,YAAI,EAAE,iBAAiB,UAAS;AAC9B,kBAAQ,IAAI,QAAO,OAAO,KAAK,OAAO;AAAA,QACxC;AAEA,eACE,mBAAmB,KAAK,OAAO,MAAM,KAAK,KAC1C,mBAAmB,KAAK,OAAO,MAAM,KAAK,KAC1C,mBAAmB,KAAK,OAAO,MAAM,KAAK;AAAA,MAE9C;AAAA,MAEA,WAAY,OAAO;AACjB,YAAI,EAAE,iBAAiB,UAAS;AAC9B,kBAAQ,IAAI,QAAO,OAAO,KAAK,OAAO;AAAA,QACxC;AAGA,YAAI,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,QAAQ;AACtD,iBAAO;AAAA,QACT,WAAW,CAAC,KAAK,WAAW,UAAU,MAAM,WAAW,QAAQ;AAC7D,iBAAO;AAAA,QACT,WAAW,CAAC,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,QAAQ;AAC9D,iBAAO;AAAA,QACT;AAEA,YAAI,IAAI;AACR,WAAG;AACD,gBAAM,IAAI,KAAK,WAAW,CAAC;AAC3B,gBAAM,IAAI,MAAM,WAAW,CAAC;AAC5B,gBAAM,sBAAsB,GAAG,GAAG,CAAC;AACnC,cAAI,MAAM,UAAa,MAAM,QAAW;AACtC,mBAAO;AAAA,UACT,WAAW,MAAM,QAAW;AAC1B,mBAAO;AAAA,UACT,WAAW,MAAM,QAAW;AAC1B,mBAAO;AAAA,UACT,WAAW,MAAM,GAAG;AAClB;AAAA,UACF,OAAO;AACL,mBAAO,mBAAmB,GAAG,CAAC;AAAA,UAChC;AAAA,QACF,SAAS,EAAE;AAAA,MACb;AAAA,MAEA,aAAc,OAAO;AACnB,YAAI,EAAE,iBAAiB,UAAS;AAC9B,kBAAQ,IAAI,QAAO,OAAO,KAAK,OAAO;AAAA,QACxC;AAEA,YAAI,IAAI;AACR,WAAG;AACD,gBAAM,IAAI,KAAK,MAAM,CAAC;AACtB,gBAAM,IAAI,MAAM,MAAM,CAAC;AACvB,gBAAM,iBAAiB,GAAG,GAAG,CAAC;AAC9B,cAAI,MAAM,UAAa,MAAM,QAAW;AACtC,mBAAO;AAAA,UACT,WAAW,MAAM,QAAW;AAC1B,mBAAO;AAAA,UACT,WAAW,MAAM,QAAW;AAC1B,mBAAO;AAAA,UACT,WAAW,MAAM,GAAG;AAClB;AAAA,UACF,OAAO;AACL,mBAAO,mBAAmB,GAAG,CAAC;AAAA,UAChC;AAAA,QACF,SAAS,EAAE;AAAA,MACb;AAAA;AAAA;AAAA,MAIA,IAAK,SAAS,YAAY,gBAAgB;AACxC,gBAAQ,SAAS;AAAA,UACf,KAAK;AACH,iBAAK,WAAW,SAAS;AACzB,iBAAK,QAAQ;AACb,iBAAK,QAAQ;AACb,iBAAK;AACL,iBAAK,IAAI,OAAO,YAAY,cAAc;AAC1C;AAAA,UACF,KAAK;AACH,iBAAK,WAAW,SAAS;AACzB,iBAAK,QAAQ;AACb,iBAAK;AACL,iBAAK,IAAI,OAAO,YAAY,cAAc;AAC1C;AAAA,UACF,KAAK;AAIH,iBAAK,WAAW,SAAS;AACzB,iBAAK,IAAI,SAAS,YAAY,cAAc;AAC5C,iBAAK,IAAI,OAAO,YAAY,cAAc;AAC1C;AAAA;AAAA;AAAA,UAGF,KAAK;AACH,gBAAI,KAAK,WAAW,WAAW,GAAG;AAChC,mBAAK,IAAI,SAAS,YAAY,cAAc;AAAA,YAC9C;AACA,iBAAK,IAAI,OAAO,YAAY,cAAc;AAC1C;AAAA,UAEF,KAAK;AAKH,gBACE,KAAK,UAAU,KACf,KAAK,UAAU,KACf,KAAK,WAAW,WAAW,GAC3B;AACA,mBAAK;AAAA,YACP;AACA,iBAAK,QAAQ;AACb,iBAAK,QAAQ;AACb,iBAAK,aAAa,CAAC;AACnB;AAAA,UACF,KAAK;AAKH,gBAAI,KAAK,UAAU,KAAK,KAAK,WAAW,WAAW,GAAG;AACpD,mBAAK;AAAA,YACP;AACA,iBAAK,QAAQ;AACb,iBAAK,aAAa,CAAC;AACnB;AAAA,UACF,KAAK;AAKH,gBAAI,KAAK,WAAW,WAAW,GAAG;AAChC,mBAAK;AAAA,YACP;AACA,iBAAK,aAAa,CAAC;AACnB;AAAA;AAAA;AAAA,UAGF,KAAK,OAAO;AACV,kBAAM,OAAO,OAAO,cAAc,IAAI,IAAI;AAE1C,gBAAI,CAAC,cAAc,mBAAmB,OAAO;AAC3C,oBAAM,IAAI,MAAM,iDAAiD;AAAA,YACnE;AAEA,gBAAI,KAAK,WAAW,WAAW,GAAG;AAChC,mBAAK,aAAa,CAAC,IAAI;AAAA,YACzB,OAAO;AACL,kBAAI,IAAI,KAAK,WAAW;AACxB,qBAAO,EAAE,KAAK,GAAG;AACf,oBAAI,OAAO,KAAK,WAAW,CAAC,MAAM,UAAU;AAC1C,uBAAK,WAAW,CAAC;AACjB,sBAAI;AAAA,gBACN;AAAA,cACF;AACA,kBAAI,MAAM,IAAI;AAEZ,oBAAI,eAAe,KAAK,WAAW,KAAK,GAAG,KAAK,mBAAmB,OAAO;AACxE,wBAAM,IAAI,MAAM,uDAAuD;AAAA,gBACzE;AACA,qBAAK,WAAW,KAAK,IAAI;AAAA,cAC3B;AAAA,YACF;AACA,gBAAI,YAAY;AAGd,kBAAI,aAAa,CAAC,YAAY,IAAI;AAClC,kBAAI,mBAAmB,OAAO;AAC5B,6BAAa,CAAC,UAAU;AAAA,cAC1B;AACA,kBAAI,mBAAmB,KAAK,WAAW,CAAC,GAAG,UAAU,MAAM,GAAG;AAC5D,oBAAI,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG;AAC7B,uBAAK,aAAa;AAAA,gBACpB;AAAA,cACF,OAAO;AACL,qBAAK,aAAa;AAAA,cACpB;AAAA,YACF;AACA;AAAA,UACF;AAAA,UACA;AACE,kBAAM,IAAI,MAAM,+BAA+B,OAAO,EAAE;AAAA,QAC5D;AACA,aAAK,MAAM,KAAK,OAAO;AACvB,YAAI,KAAK,MAAM,QAAQ;AACrB,eAAK,OAAO,IAAI,KAAK,MAAM,KAAK,GAAG,CAAC;AAAA,QACtC;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,UAAU;AAAA;AAAA;;;AC7SjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ,CAAC,SAAS,SAAS,cAAc,UAAU;AACvD,UAAI,mBAAmB,QAAQ;AAC7B,eAAO;AAAA,MACT;AACA,UAAI;AACF,eAAO,IAAI,OAAO,SAAS,OAAO;AAAA,MACpC,SAAS,IAAI;AACX,YAAI,CAAC,aAAa;AAChB,iBAAO;AAAA,QACT;AACA,cAAM;AAAA,MACR;AAAA,IACF;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACfjB;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,QAAQ,CAAC,SAAS,YAAY;AAClC,YAAM,IAAI,MAAM,SAAS,OAAO;AAChC,aAAO,IAAI,EAAE,UAAU;AAAA,IACzB;AACA,WAAO,UAAU;AAAA;AAAA;;;ACLjB;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,QAAQ,CAAC,SAAS,YAAY;AAClC,YAAM,IAAI,MAAM,QAAQ,KAAK,EAAE,QAAQ,UAAU,EAAE,GAAG,OAAO;AAC7D,aAAO,IAAI,EAAE,UAAU;AAAA,IACzB;AACA,WAAO,UAAU;AAAA;AAAA;;;ACLjB;AAAA;AAAA,QAAM,SAAS;AAEf,QAAM,MAAM,CAAC,SAAS,SAAS,SAAS,YAAY,mBAAmB;AACrE,UAAI,OAAQ,YAAa,UAAU;AACjC,yBAAiB;AACjB,qBAAa;AACb,kBAAU;AAAA,MACZ;AAEA,UAAI;AACF,eAAO,IAAI;AAAA,UACT,mBAAmB,SAAS,QAAQ,UAAU;AAAA,UAC9C;AAAA,QACF,EAAE,IAAI,SAAS,YAAY,cAAc,EAAE;AAAA,MAC7C,SAAS,IAAI;AACX,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO,UAAU;AAAA;AAAA;;;AClBjB;AAAA;AAAA,QAAM,QAAQ;AAEd,QAAM,OAAO,CAAC,UAAU,aAAa;AACnC,YAAM,KAAK,MAAM,UAAU,MAAM,IAAI;AACrC,YAAM,KAAK,MAAM,UAAU,MAAM,IAAI;AACrC,YAAM,aAAa,GAAG,QAAQ,EAAE;AAEhC,UAAI,eAAe,GAAG;AACpB,eAAO;AAAA,MACT;AAEA,YAAM,WAAW,aAAa;AAC9B,YAAM,cAAc,WAAW,KAAK;AACpC,YAAM,aAAa,WAAW,KAAK;AACnC,YAAM,aAAa,CAAC,CAAC,YAAY,WAAW;AAC5C,YAAM,YAAY,CAAC,CAAC,WAAW,WAAW;AAE1C,UAAI,aAAa,CAAC,YAAY;AAQ5B,YAAI,CAAC,WAAW,SAAS,CAAC,WAAW,OAAO;AAC1C,iBAAO;AAAA,QACT;AAIA,YAAI,YAAY,OAAO;AAErB,iBAAO;AAAA,QACT;AAEA,YAAI,YAAY,OAAO;AAErB,iBAAO;AAAA,QACT;AAGA,eAAO;AAAA,MACT;AAGA,YAAM,SAAS,aAAa,QAAQ;AAEpC,UAAI,GAAG,UAAU,GAAG,OAAO;AACzB,eAAO,SAAS;AAAA,MAClB;AAEA,UAAI,GAAG,UAAU,GAAG,OAAO;AACzB,eAAO,SAAS;AAAA,MAClB;AAEA,UAAI,GAAG,UAAU,GAAG,OAAO;AACzB,eAAO,SAAS;AAAA,MAClB;AAGA,aAAO;AAAA,IACT;AAEA,WAAO,UAAU;AAAA;AAAA;;;AChEjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ,CAAC,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,EAAE;AACjD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ,CAAC,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,EAAE;AACjD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ,CAAC,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,EAAE;AACjD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,aAAa,CAAC,SAAS,YAAY;AACvC,YAAM,SAAS,MAAM,SAAS,OAAO;AACrC,aAAQ,UAAU,OAAO,WAAW,SAAU,OAAO,aAAa;AAAA,IACpE;AACA,WAAO,UAAU;AAAA;AAAA;;;ACLjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,UAAU,CAAC,GAAG,GAAG,UACrB,IAAI,OAAO,GAAG,KAAK,EAAE,QAAQ,IAAI,OAAO,GAAG,KAAK,CAAC;AAEnD,WAAO,UAAU;AAAA;AAAA;;;ACJjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,WAAW,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK;AACrD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,eAAe,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,IAAI;AACjD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,eAAe,CAAC,GAAG,GAAG,UAAU;AACpC,YAAM,WAAW,IAAI,OAAO,GAAG,KAAK;AACpC,YAAM,WAAW,IAAI,OAAO,GAAG,KAAK;AACpC,aAAO,SAAS,QAAQ,QAAQ,KAAK,SAAS,aAAa,QAAQ;AAAA,IACrE;AACA,WAAO,UAAU;AAAA;AAAA;;;ACNjB;AAAA;AAAA,QAAM,eAAe;AACrB,QAAM,OAAO,CAAC,MAAM,UAAU,KAAK,KAAK,CAAC,GAAG,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC;AAC3E,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,eAAe;AACrB,QAAM,QAAQ,CAAC,MAAM,UAAU,KAAK,KAAK,CAAC,GAAG,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC;AAC5E,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,KAAK,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,IAAI;AACnD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,KAAK,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,IAAI;AACnD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,KAAK,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,MAAM;AACrD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,MAAM,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,MAAM;AACtD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,MAAM,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,KAAK;AACrD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,MAAM,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,KAAK;AACrD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,KAAK;AACX,QAAM,MAAM;AACZ,QAAM,KAAK;AACX,QAAM,MAAM;AACZ,QAAM,KAAK;AACX,QAAM,MAAM;AAEZ,QAAM,MAAM,CAAC,GAAG,IAAI,GAAG,UAAU;AAC/B,cAAQ,IAAI;AAAA,QACV,KAAK;AACH,cAAI,OAAO,MAAM,UAAU;AACzB,gBAAI,EAAE;AAAA,UACR;AACA,cAAI,OAAO,MAAM,UAAU;AACzB,gBAAI,EAAE;AAAA,UACR;AACA,iBAAO,MAAM;AAAA,QAEf,KAAK;AACH,cAAI,OAAO,MAAM,UAAU;AACzB,gBAAI,EAAE;AAAA,UACR;AACA,cAAI,OAAO,MAAM,UAAU;AACzB,gBAAI,EAAE;AAAA,UACR;AACA,iBAAO,MAAM;AAAA,QAEf,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,GAAG,GAAG,GAAG,KAAK;AAAA,QAEvB,KAAK;AACH,iBAAO,IAAI,GAAG,GAAG,KAAK;AAAA,QAExB,KAAK;AACH,iBAAO,GAAG,GAAG,GAAG,KAAK;AAAA,QAEvB,KAAK;AACH,iBAAO,IAAI,GAAG,GAAG,KAAK;AAAA,QAExB,KAAK;AACH,iBAAO,GAAG,GAAG,GAAG,KAAK;AAAA,QAEvB,KAAK;AACH,iBAAO,IAAI,GAAG,GAAG,KAAK;AAAA,QAExB;AACE,gBAAM,IAAI,UAAU,qBAAqB,EAAE,EAAE;AAAA,MACjD;AAAA,IACF;AACA,WAAO,UAAU;AAAA;AAAA;;;ACnDjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ;AACd,QAAM,EAAE,QAAQ,IAAI,EAAE,IAAI;AAE1B,QAAM,SAAS,CAAC,SAAS,YAAY;AACnC,UAAI,mBAAmB,QAAQ;AAC7B,eAAO;AAAA,MACT;AAEA,UAAI,OAAO,YAAY,UAAU;AAC/B,kBAAU,OAAO,OAAO;AAAA,MAC1B;AAEA,UAAI,OAAO,YAAY,UAAU;AAC/B,eAAO;AAAA,MACT;AAEA,gBAAU,WAAW,CAAC;AAEtB,UAAI,QAAQ;AACZ,UAAI,CAAC,QAAQ,KAAK;AAChB,gBAAQ,QAAQ,MAAM,QAAQ,oBAAoB,GAAG,EAAE,UAAU,IAAI,GAAG,EAAE,MAAM,CAAC;AAAA,MACnF,OAAO;AAUL,cAAM,iBAAiB,QAAQ,oBAAoB,GAAG,EAAE,aAAa,IAAI,GAAG,EAAE,SAAS;AACvF,YAAI;AACJ,gBAAQ,OAAO,eAAe,KAAK,OAAO,OACrC,CAAC,SAAS,MAAM,QAAQ,MAAM,CAAC,EAAE,WAAW,QAAQ,SACvD;AACA,cAAI,CAAC,SACC,KAAK,QAAQ,KAAK,CAAC,EAAE,WAAW,MAAM,QAAQ,MAAM,CAAC,EAAE,QAAQ;AACnE,oBAAQ;AAAA,UACV;AACA,yBAAe,YAAY,KAAK,QAAQ,KAAK,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE;AAAA,QACnE;AAEA,uBAAe,YAAY;AAAA,MAC7B;AAEA,UAAI,UAAU,MAAM;AAClB,eAAO;AAAA,MACT;AAEA,YAAM,QAAQ,MAAM,CAAC;AACrB,YAAM,QAAQ,MAAM,CAAC,KAAK;AAC1B,YAAM,QAAQ,MAAM,CAAC,KAAK;AAC1B,YAAM,aAAa,QAAQ,qBAAqB,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,KAAK;AAC5E,YAAM,QAAQ,QAAQ,qBAAqB,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,KAAK;AAEvE,aAAO,MAAM,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,UAAU,GAAG,KAAK,IAAI,OAAO;AAAA,IACzE;AACA,WAAO,UAAU;AAAA;AAAA;;;AC3DjB;AAAA;AAAA,QAAM,WAAN,MAAe;AAAA,MACb,cAAe;AACb,aAAK,MAAM;AACX,aAAK,MAAM,oBAAI,IAAI;AAAA,MACrB;AAAA,MAEA,IAAK,KAAK;AACR,cAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;AAC9B,YAAI,UAAU,QAAW;AACvB,iBAAO;AAAA,QACT,OAAO;AAEL,eAAK,IAAI,OAAO,GAAG;AACnB,eAAK,IAAI,IAAI,KAAK,KAAK;AACvB,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,MAEA,OAAQ,KAAK;AACX,eAAO,KAAK,IAAI,OAAO,GAAG;AAAA,MAC5B;AAAA,MAEA,IAAK,KAAK,OAAO;AACf,cAAM,UAAU,KAAK,OAAO,GAAG;AAE/B,YAAI,CAAC,WAAW,UAAU,QAAW;AAEnC,cAAI,KAAK,IAAI,QAAQ,KAAK,KAAK;AAC7B,kBAAM,WAAW,KAAK,IAAI,KAAK,EAAE,KAAK,EAAE;AACxC,iBAAK,OAAO,QAAQ;AAAA,UACtB;AAEA,eAAK,IAAI,IAAI,KAAK,KAAK;AAAA,QACzB;AAEA,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACvCjB;AAAA;AAAA,QAAM,mBAAmB;AAGzB,QAAM,QAAN,MAAM,OAAM;AAAA,MACV,YAAa,OAAO,SAAS;AAC3B,kBAAU,aAAa,OAAO;AAE9B,YAAI,iBAAiB,QAAO;AAC1B,cACE,MAAM,UAAU,CAAC,CAAC,QAAQ,SAC1B,MAAM,sBAAsB,CAAC,CAAC,QAAQ,mBACtC;AACA,mBAAO;AAAA,UACT,OAAO;AACL,mBAAO,IAAI,OAAM,MAAM,KAAK,OAAO;AAAA,UACrC;AAAA,QACF;AAEA,YAAI,iBAAiB,YAAY;AAE/B,eAAK,MAAM,MAAM;AACjB,eAAK,MAAM,CAAC,CAAC,KAAK,CAAC;AACnB,eAAK,YAAY;AACjB,iBAAO;AAAA,QACT;AAEA,aAAK,UAAU;AACf,aAAK,QAAQ,CAAC,CAAC,QAAQ;AACvB,aAAK,oBAAoB,CAAC,CAAC,QAAQ;AAKnC,aAAK,MAAM,MAAM,KAAK,EAAE,QAAQ,kBAAkB,GAAG;AAGrD,aAAK,MAAM,KAAK,IACb,MAAM,IAAI,EAEV,IAAI,OAAK,KAAK,WAAW,EAAE,KAAK,CAAC,CAAC,EAIlC,OAAO,OAAK,EAAE,MAAM;AAEvB,YAAI,CAAC,KAAK,IAAI,QAAQ;AACpB,gBAAM,IAAI,UAAU,yBAAyB,KAAK,GAAG,EAAE;AAAA,QACzD;AAGA,YAAI,KAAK,IAAI,SAAS,GAAG;AAEvB,gBAAMC,SAAQ,KAAK,IAAI,CAAC;AACxB,eAAK,MAAM,KAAK,IAAI,OAAO,OAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;AAChD,cAAI,KAAK,IAAI,WAAW,GAAG;AACzB,iBAAK,MAAM,CAACA,MAAK;AAAA,UACnB,WAAW,KAAK,IAAI,SAAS,GAAG;AAE9B,uBAAW,KAAK,KAAK,KAAK;AACxB,kBAAI,EAAE,WAAW,KAAK,MAAM,EAAE,CAAC,CAAC,GAAG;AACjC,qBAAK,MAAM,CAAC,CAAC;AACb;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,aAAK,YAAY;AAAA,MACnB;AAAA,MAEA,IAAI,QAAS;AACX,YAAI,KAAK,cAAc,QAAW;AAChC,eAAK,YAAY;AACjB,mBAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;AACxC,gBAAI,IAAI,GAAG;AACT,mBAAK,aAAa;AAAA,YACpB;AACA,kBAAM,QAAQ,KAAK,IAAI,CAAC;AACxB,qBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,kBAAI,IAAI,GAAG;AACT,qBAAK,aAAa;AAAA,cACpB;AACA,mBAAK,aAAa,MAAM,CAAC,EAAE,SAAS,EAAE,KAAK;AAAA,YAC7C;AAAA,UACF;AAAA,QACF;AACA,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,SAAU;AACR,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,WAAY;AACV,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,WAAY,OAAO;AAGjB,cAAM,YACH,KAAK,QAAQ,qBAAqB,4BAClC,KAAK,QAAQ,SAAS;AACzB,cAAM,UAAU,WAAW,MAAM;AACjC,cAAM,SAAS,MAAM,IAAI,OAAO;AAChC,YAAI,QAAQ;AACV,iBAAO;AAAA,QACT;AAEA,cAAM,QAAQ,KAAK,QAAQ;AAE3B,cAAM,KAAK,QAAQ,GAAG,EAAE,gBAAgB,IAAI,GAAG,EAAE,WAAW;AAC5D,gBAAQ,MAAM,QAAQ,IAAI,cAAc,KAAK,QAAQ,iBAAiB,CAAC;AACvE,cAAM,kBAAkB,KAAK;AAG7B,gBAAQ,MAAM,QAAQ,GAAG,EAAE,cAAc,GAAG,qBAAqB;AACjE,cAAM,mBAAmB,KAAK;AAG9B,gBAAQ,MAAM,QAAQ,GAAG,EAAE,SAAS,GAAG,gBAAgB;AACvD,cAAM,cAAc,KAAK;AAGzB,gBAAQ,MAAM,QAAQ,GAAG,EAAE,SAAS,GAAG,gBAAgB;AACvD,cAAM,cAAc,KAAK;AAKzB,YAAI,YAAY,MACb,MAAM,GAAG,EACT,IAAI,UAAQ,gBAAgB,MAAM,KAAK,OAAO,CAAC,EAC/C,KAAK,GAAG,EACR,MAAM,KAAK,EAEX,IAAI,UAAQ,YAAY,MAAM,KAAK,OAAO,CAAC;AAE9C,YAAI,OAAO;AAET,sBAAY,UAAU,OAAO,UAAQ;AACnC,kBAAM,wBAAwB,MAAM,KAAK,OAAO;AAChD,mBAAO,CAAC,CAAC,KAAK,MAAM,GAAG,EAAE,eAAe,CAAC;AAAA,UAC3C,CAAC;AAAA,QACH;AACA,cAAM,cAAc,SAAS;AAK7B,cAAM,WAAW,oBAAI,IAAI;AACzB,cAAM,cAAc,UAAU,IAAI,UAAQ,IAAI,WAAW,MAAM,KAAK,OAAO,CAAC;AAC5E,mBAAW,QAAQ,aAAa;AAC9B,cAAI,UAAU,IAAI,GAAG;AACnB,mBAAO,CAAC,IAAI;AAAA,UACd;AACA,mBAAS,IAAI,KAAK,OAAO,IAAI;AAAA,QAC/B;AACA,YAAI,SAAS,OAAO,KAAK,SAAS,IAAI,EAAE,GAAG;AACzC,mBAAS,OAAO,EAAE;AAAA,QACpB;AAEA,cAAM,SAAS,CAAC,GAAG,SAAS,OAAO,CAAC;AACpC,cAAM,IAAI,SAAS,MAAM;AACzB,eAAO;AAAA,MACT;AAAA,MAEA,WAAY,OAAO,SAAS;AAC1B,YAAI,EAAE,iBAAiB,SAAQ;AAC7B,gBAAM,IAAI,UAAU,qBAAqB;AAAA,QAC3C;AAEA,eAAO,KAAK,IAAI,KAAK,CAAC,oBAAoB;AACxC,iBACE,cAAc,iBAAiB,OAAO,KACtC,MAAM,IAAI,KAAK,CAAC,qBAAqB;AACnC,mBACE,cAAc,kBAAkB,OAAO,KACvC,gBAAgB,MAAM,CAAC,mBAAmB;AACxC,qBAAO,iBAAiB,MAAM,CAAC,oBAAoB;AACjD,uBAAO,eAAe,WAAW,iBAAiB,OAAO;AAAA,cAC3D,CAAC;AAAA,YACH,CAAC;AAAA,UAEL,CAAC;AAAA,QAEL,CAAC;AAAA,MACH;AAAA;AAAA,MAGA,KAAM,SAAS;AACb,YAAI,CAAC,SAAS;AACZ,iBAAO;AAAA,QACT;AAEA,YAAI,OAAO,YAAY,UAAU;AAC/B,cAAI;AACF,sBAAU,IAAI,OAAO,SAAS,KAAK,OAAO;AAAA,UAC5C,SAAS,IAAI;AACX,mBAAO;AAAA,UACT;AAAA,QACF;AAEA,iBAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;AACxC,cAAI,QAAQ,KAAK,IAAI,CAAC,GAAG,SAAS,KAAK,OAAO,GAAG;AAC/C,mBAAO;AAAA,UACT;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,UAAU;AAEjB,QAAM,MAAM;AACZ,QAAM,QAAQ,IAAI,IAAI;AAEtB,QAAM,eAAe;AACrB,QAAM,aAAa;AACnB,QAAM,QAAQ;AACd,QAAM,SAAS;AACf,QAAM;AAAA,MACJ,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI;AACJ,QAAM,EAAE,yBAAyB,WAAW,IAAI;AAEhD,QAAM,YAAY,OAAK,EAAE,UAAU;AACnC,QAAM,QAAQ,OAAK,EAAE,UAAU;AAI/B,QAAM,gBAAgB,CAAC,aAAa,YAAY;AAC9C,UAAI,SAAS;AACb,YAAM,uBAAuB,YAAY,MAAM;AAC/C,UAAI,iBAAiB,qBAAqB,IAAI;AAE9C,aAAO,UAAU,qBAAqB,QAAQ;AAC5C,iBAAS,qBAAqB,MAAM,CAAC,oBAAoB;AACvD,iBAAO,eAAe,WAAW,iBAAiB,OAAO;AAAA,QAC3D,CAAC;AAED,yBAAiB,qBAAqB,IAAI;AAAA,MAC5C;AAEA,aAAO;AAAA,IACT;AAKA,QAAM,kBAAkB,CAAC,MAAM,YAAY;AACzC,YAAM,QAAQ,MAAM,OAAO;AAC3B,aAAO,cAAc,MAAM,OAAO;AAClC,YAAM,SAAS,IAAI;AACnB,aAAO,cAAc,MAAM,OAAO;AAClC,YAAM,UAAU,IAAI;AACpB,aAAO,eAAe,MAAM,OAAO;AACnC,YAAM,UAAU,IAAI;AACpB,aAAO,aAAa,MAAM,OAAO;AACjC,YAAM,SAAS,IAAI;AACnB,aAAO;AAAA,IACT;AAEA,QAAM,MAAM,CAAAC,QAAM,CAACA,OAAMA,IAAG,YAAY,MAAM,OAAOA,QAAO;AAS5D,QAAM,gBAAgB,CAAC,MAAM,YAAY;AACvC,aAAO,KACJ,KAAK,EACL,MAAM,KAAK,EACX,IAAI,CAAC,MAAM,aAAa,GAAG,OAAO,CAAC,EACnC,KAAK,GAAG;AAAA,IACb;AAEA,QAAM,eAAe,CAAC,MAAM,YAAY;AACtC,YAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,UAAU,IAAI,GAAG,EAAE,KAAK;AACvD,aAAO,KAAK,QAAQ,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,OAAO;AACzC,cAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE;AACnC,YAAI;AAEJ,YAAI,IAAI,CAAC,GAAG;AACV,gBAAM;AAAA,QACR,WAAW,IAAI,CAAC,GAAG;AACjB,gBAAM,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC;AAAA,QAC7B,WAAW,IAAI,CAAC,GAAG;AAEjB,gBAAM,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,QACrC,WAAW,IAAI;AACb,gBAAM,mBAAmB,EAAE;AAC3B,gBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAC1B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,QAClB,OAAO;AAEL,gBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,QAClB;AAEA,cAAM,gBAAgB,GAAG;AACzB,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAUA,QAAM,gBAAgB,CAAC,MAAM,YAAY;AACvC,aAAO,KACJ,KAAK,EACL,MAAM,KAAK,EACX,IAAI,CAAC,MAAM,aAAa,GAAG,OAAO,CAAC,EACnC,KAAK,GAAG;AAAA,IACb;AAEA,QAAM,eAAe,CAAC,MAAM,YAAY;AACtC,YAAM,SAAS,MAAM,OAAO;AAC5B,YAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,UAAU,IAAI,GAAG,EAAE,KAAK;AACvD,YAAM,IAAI,QAAQ,oBAAoB,OAAO;AAC7C,aAAO,KAAK,QAAQ,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,OAAO;AACzC,cAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE;AACnC,YAAI;AAEJ,YAAI,IAAI,CAAC,GAAG;AACV,gBAAM;AAAA,QACR,WAAW,IAAI,CAAC,GAAG;AACjB,gBAAM,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC;AAAA,QACjC,WAAW,IAAI,CAAC,GAAG;AACjB,cAAI,MAAM,KAAK;AACb,kBAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,UACzC,OAAO;AACL,kBAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;AAAA,UACpC;AAAA,QACF,WAAW,IAAI;AACb,gBAAM,mBAAmB,EAAE;AAC3B,cAAI,MAAM,KAAK;AACb,gBAAI,MAAM,KAAK;AACb,oBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAC1B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,YACvB,OAAO;AACL,oBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAC1B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,YAClB;AAAA,UACF,OAAO;AACL,kBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAC1B,KAAK,CAAC,IAAI,CAAC;AAAA,UACb;AAAA,QACF,OAAO;AACL,gBAAM,OAAO;AACb,cAAI,MAAM,KAAK;AACb,gBAAI,MAAM,KAAK;AACb,oBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CACrB,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,YAC3B,OAAO;AACL,oBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CACrB,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,YACtB;AAAA,UACF,OAAO;AACL,kBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CACrB,KAAK,CAAC,IAAI,CAAC;AAAA,UACb;AAAA,QACF;AAEA,cAAM,gBAAgB,GAAG;AACzB,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,QAAM,iBAAiB,CAAC,MAAM,YAAY;AACxC,YAAM,kBAAkB,MAAM,OAAO;AACrC,aAAO,KACJ,MAAM,KAAK,EACX,IAAI,CAAC,MAAM,cAAc,GAAG,OAAO,CAAC,EACpC,KAAK,GAAG;AAAA,IACb;AAEA,QAAM,gBAAgB,CAAC,MAAM,YAAY;AACvC,aAAO,KAAK,KAAK;AACjB,YAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,WAAW,IAAI,GAAG,EAAE,MAAM;AACzD,aAAO,KAAK,QAAQ,GAAG,CAAC,KAAK,MAAM,GAAG,GAAG,GAAG,OAAO;AACjD,cAAM,UAAU,MAAM,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE;AAC5C,cAAM,KAAK,IAAI,CAAC;AAChB,cAAM,KAAK,MAAM,IAAI,CAAC;AACtB,cAAM,KAAK,MAAM,IAAI,CAAC;AACtB,cAAM,OAAO;AAEb,YAAI,SAAS,OAAO,MAAM;AACxB,iBAAO;AAAA,QACT;AAIA,aAAK,QAAQ,oBAAoB,OAAO;AAExC,YAAI,IAAI;AACN,cAAI,SAAS,OAAO,SAAS,KAAK;AAEhC,kBAAM;AAAA,UACR,OAAO;AAEL,kBAAM;AAAA,UACR;AAAA,QACF,WAAW,QAAQ,MAAM;AAGvB,cAAI,IAAI;AACN,gBAAI;AAAA,UACN;AACA,cAAI;AAEJ,cAAI,SAAS,KAAK;AAGhB,mBAAO;AACP,gBAAI,IAAI;AACN,kBAAI,CAAC,IAAI;AACT,kBAAI;AACJ,kBAAI;AAAA,YACN,OAAO;AACL,kBAAI,CAAC,IAAI;AACT,kBAAI;AAAA,YACN;AAAA,UACF,WAAW,SAAS,MAAM;AAGxB,mBAAO;AACP,gBAAI,IAAI;AACN,kBAAI,CAAC,IAAI;AAAA,YACX,OAAO;AACL,kBAAI,CAAC,IAAI;AAAA,YACX;AAAA,UACF;AAEA,cAAI,SAAS,KAAK;AAChB,iBAAK;AAAA,UACP;AAEA,gBAAM,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;AAAA,QAClC,WAAW,IAAI;AACb,gBAAM,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC;AAAA,QAClC,WAAW,IAAI;AACb,gBAAM,KAAK,CAAC,IAAI,CAAC,KAAK,EACtB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,QAClB;AAEA,cAAM,iBAAiB,GAAG;AAE1B,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAIA,QAAM,eAAe,CAAC,MAAM,YAAY;AACtC,YAAM,gBAAgB,MAAM,OAAO;AAEnC,aAAO,KACJ,KAAK,EACL,QAAQ,GAAG,EAAE,IAAI,GAAG,EAAE;AAAA,IAC3B;AAEA,QAAM,cAAc,CAAC,MAAM,YAAY;AACrC,YAAM,eAAe,MAAM,OAAO;AAClC,aAAO,KACJ,KAAK,EACL,QAAQ,GAAG,QAAQ,oBAAoB,EAAE,UAAU,EAAE,IAAI,GAAG,EAAE;AAAA,IACnE;AAQA,QAAM,gBAAgB,WAAS,CAAC,IAC9BC,OAAM,IAAI,IAAI,IAAI,KAAK,IACvB,IAAI,IAAI,IAAI,IAAI,QAAQ;AACxB,UAAI,IAAI,EAAE,GAAG;AACX,QAAAA,QAAO;AAAA,MACT,WAAW,IAAI,EAAE,GAAG;AAClB,QAAAA,QAAO,KAAK,EAAE,OAAO,QAAQ,OAAO,EAAE;AAAA,MACxC,WAAW,IAAI,EAAE,GAAG;AAClB,QAAAA,QAAO,KAAK,EAAE,IAAI,EAAE,KAAK,QAAQ,OAAO,EAAE;AAAA,MAC5C,WAAW,KAAK;AACd,QAAAA,QAAO,KAAKA,KAAI;AAAA,MAClB,OAAO;AACL,QAAAA,QAAO,KAAKA,KAAI,GAAG,QAAQ,OAAO,EAAE;AAAA,MACtC;AAEA,UAAI,IAAI,EAAE,GAAG;AACX,aAAK;AAAA,MACP,WAAW,IAAI,EAAE,GAAG;AAClB,aAAK,IAAI,CAAC,KAAK,CAAC;AAAA,MAClB,WAAW,IAAI,EAAE,GAAG;AAClB,aAAK,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC;AAAA,MACxB,WAAW,KAAK;AACd,aAAK,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG;AAAA,MACjC,WAAW,OAAO;AAChB,aAAK,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC;AAAA,MAC9B,OAAO;AACL,aAAK,KAAK,EAAE;AAAA,MACd;AAEA,aAAO,GAAGA,KAAI,IAAI,EAAE,GAAG,KAAK;AAAA,IAC9B;AAEA,QAAM,UAAU,CAAC,KAAK,SAAS,YAAY;AACzC,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,CAAC,IAAI,CAAC,EAAE,KAAK,OAAO,GAAG;AACzB,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,QAAQ,WAAW,UAAU,CAAC,QAAQ,mBAAmB;AAM3D,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,gBAAM,IAAI,CAAC,EAAE,MAAM;AACnB,cAAI,IAAI,CAAC,EAAE,WAAW,WAAW,KAAK;AACpC;AAAA,UACF;AAEA,cAAI,IAAI,CAAC,EAAE,OAAO,WAAW,SAAS,GAAG;AACvC,kBAAM,UAAU,IAAI,CAAC,EAAE;AACvB,gBAAI,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,OAAO;AACnC,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AAGA,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;ACziBA;AAAA;AAAA,QAAM,MAAM,OAAO,YAAY;AAE/B,QAAM,aAAN,MAAM,YAAW;AAAA,MACf,WAAW,MAAO;AAChB,eAAO;AAAA,MACT;AAAA,MAEA,YAAa,MAAM,SAAS;AAC1B,kBAAU,aAAa,OAAO;AAE9B,YAAI,gBAAgB,aAAY;AAC9B,cAAI,KAAK,UAAU,CAAC,CAAC,QAAQ,OAAO;AAClC,mBAAO;AAAA,UACT,OAAO;AACL,mBAAO,KAAK;AAAA,UACd;AAAA,QACF;AAEA,eAAO,KAAK,KAAK,EAAE,MAAM,KAAK,EAAE,KAAK,GAAG;AACxC,cAAM,cAAc,MAAM,OAAO;AACjC,aAAK,UAAU;AACf,aAAK,QAAQ,CAAC,CAAC,QAAQ;AACvB,aAAK,MAAM,IAAI;AAEf,YAAI,KAAK,WAAW,KAAK;AACvB,eAAK,QAAQ;AAAA,QACf,OAAO;AACL,eAAK,QAAQ,KAAK,WAAW,KAAK,OAAO;AAAA,QAC3C;AAEA,cAAM,QAAQ,IAAI;AAAA,MACpB;AAAA,MAEA,MAAO,MAAM;AACX,cAAM,IAAI,KAAK,QAAQ,QAAQ,GAAG,EAAE,eAAe,IAAI,GAAG,EAAE,UAAU;AACtE,cAAM,IAAI,KAAK,MAAM,CAAC;AAEtB,YAAI,CAAC,GAAG;AACN,gBAAM,IAAI,UAAU,uBAAuB,IAAI,EAAE;AAAA,QACnD;AAEA,aAAK,WAAW,EAAE,CAAC,MAAM,SAAY,EAAE,CAAC,IAAI;AAC5C,YAAI,KAAK,aAAa,KAAK;AACzB,eAAK,WAAW;AAAA,QAClB;AAGA,YAAI,CAAC,EAAE,CAAC,GAAG;AACT,eAAK,SAAS;AAAA,QAChB,OAAO;AACL,eAAK,SAAS,IAAI,OAAO,EAAE,CAAC,GAAG,KAAK,QAAQ,KAAK;AAAA,QACnD;AAAA,MACF;AAAA,MAEA,WAAY;AACV,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,KAAM,SAAS;AACb,cAAM,mBAAmB,SAAS,KAAK,QAAQ,KAAK;AAEpD,YAAI,KAAK,WAAW,OAAO,YAAY,KAAK;AAC1C,iBAAO;AAAA,QACT;AAEA,YAAI,OAAO,YAAY,UAAU;AAC/B,cAAI;AACF,sBAAU,IAAI,OAAO,SAAS,KAAK,OAAO;AAAA,UAC5C,SAAS,IAAI;AACX,mBAAO;AAAA,UACT;AAAA,QACF;AAEA,eAAO,IAAI,SAAS,KAAK,UAAU,KAAK,QAAQ,KAAK,OAAO;AAAA,MAC9D;AAAA,MAEA,WAAY,MAAM,SAAS;AACzB,YAAI,EAAE,gBAAgB,cAAa;AACjC,gBAAM,IAAI,UAAU,0BAA0B;AAAA,QAChD;AAEA,YAAI,KAAK,aAAa,IAAI;AACxB,cAAI,KAAK,UAAU,IAAI;AACrB,mBAAO;AAAA,UACT;AACA,iBAAO,IAAI,MAAM,KAAK,OAAO,OAAO,EAAE,KAAK,KAAK,KAAK;AAAA,QACvD,WAAW,KAAK,aAAa,IAAI;AAC/B,cAAI,KAAK,UAAU,IAAI;AACrB,mBAAO;AAAA,UACT;AACA,iBAAO,IAAI,MAAM,KAAK,OAAO,OAAO,EAAE,KAAK,KAAK,MAAM;AAAA,QACxD;AAEA,kBAAU,aAAa,OAAO;AAG9B,YAAI,QAAQ,sBACT,KAAK,UAAU,cAAc,KAAK,UAAU,aAAa;AAC1D,iBAAO;AAAA,QACT;AACA,YAAI,CAAC,QAAQ,sBACV,KAAK,MAAM,WAAW,QAAQ,KAAK,KAAK,MAAM,WAAW,QAAQ,IAAI;AACtE,iBAAO;AAAA,QACT;AAGA,YAAI,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAAG;AAClE,iBAAO;AAAA,QACT;AAEA,YAAI,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAAG;AAClE,iBAAO;AAAA,QACT;AAEA,YACG,KAAK,OAAO,YAAY,KAAK,OAAO,WACrC,KAAK,SAAS,SAAS,GAAG,KAAK,KAAK,SAAS,SAAS,GAAG,GAAG;AAC5D,iBAAO;AAAA,QACT;AAEA,YAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAAG;AAChE,iBAAO;AAAA,QACT;AAEA,YAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAAG;AAChE,iBAAO;AAAA,QACT;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,UAAU;AAEjB,QAAM,eAAe;AACrB,QAAM,EAAE,QAAQ,IAAI,EAAE,IAAI;AAC1B,QAAM,MAAM;AACZ,QAAM,QAAQ;AACd,QAAM,SAAS;AACf,QAAM,QAAQ;AAAA;AAAA;;;AC5Id;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,YAAY,CAAC,SAAS,OAAO,YAAY;AAC7C,UAAI;AACF,gBAAQ,IAAI,MAAM,OAAO,OAAO;AAAA,MAClC,SAAS,IAAI;AACX,eAAO;AAAA,MACT;AACA,aAAO,MAAM,KAAK,OAAO;AAAA,IAC3B;AACA,WAAO,UAAU;AAAA;AAAA;;;ACTjB;AAAA;AAAA,QAAM,QAAQ;AAGd,QAAM,gBAAgB,CAAC,OAAO,YAC5B,IAAI,MAAM,OAAO,OAAO,EAAE,IACvB,IAAI,UAAQ,KAAK,IAAI,OAAK,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC;AAEnE,WAAO,UAAU;AAAA;AAAA;;;ACPjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ;AAEd,QAAM,gBAAgB,CAAC,UAAU,OAAO,YAAY;AAClD,UAAI,MAAM;AACV,UAAI,QAAQ;AACZ,UAAI,WAAW;AACf,UAAI;AACF,mBAAW,IAAI,MAAM,OAAO,OAAO;AAAA,MACrC,SAAS,IAAI;AACX,eAAO;AAAA,MACT;AACA,eAAS,QAAQ,CAAC,MAAM;AACtB,YAAI,SAAS,KAAK,CAAC,GAAG;AAEpB,cAAI,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,IAAI;AAEnC,kBAAM;AACN,oBAAQ,IAAI,OAAO,KAAK,OAAO;AAAA,UACjC;AAAA,QACF;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AACA,WAAO,UAAU;AAAA;AAAA;;;ACxBjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ;AACd,QAAM,gBAAgB,CAAC,UAAU,OAAO,YAAY;AAClD,UAAI,MAAM;AACV,UAAI,QAAQ;AACZ,UAAI,WAAW;AACf,UAAI;AACF,mBAAW,IAAI,MAAM,OAAO,OAAO;AAAA,MACrC,SAAS,IAAI;AACX,eAAO;AAAA,MACT;AACA,eAAS,QAAQ,CAAC,MAAM;AACtB,YAAI,SAAS,KAAK,CAAC,GAAG;AAEpB,cAAI,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,GAAG;AAElC,kBAAM;AACN,oBAAQ,IAAI,OAAO,KAAK,OAAO;AAAA,UACjC;AAAA,QACF;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AACA,WAAO,UAAU;AAAA;AAAA;;;ACvBjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ;AACd,QAAM,KAAK;AAEX,QAAM,aAAa,CAAC,OAAO,UAAU;AACnC,cAAQ,IAAI,MAAM,OAAO,KAAK;AAE9B,UAAI,SAAS,IAAI,OAAO,OAAO;AAC/B,UAAI,MAAM,KAAK,MAAM,GAAG;AACtB,eAAO;AAAA,MACT;AAEA,eAAS,IAAI,OAAO,SAAS;AAC7B,UAAI,MAAM,KAAK,MAAM,GAAG;AACtB,eAAO;AAAA,MACT;AAEA,eAAS;AACT,eAAS,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;AACzC,cAAM,cAAc,MAAM,IAAI,CAAC;AAE/B,YAAI,SAAS;AACb,oBAAY,QAAQ,CAAC,eAAe;AAElC,gBAAM,UAAU,IAAI,OAAO,WAAW,OAAO,OAAO;AACpD,kBAAQ,WAAW,UAAU;AAAA,YAC3B,KAAK;AACH,kBAAI,QAAQ,WAAW,WAAW,GAAG;AACnC,wBAAQ;AAAA,cACV,OAAO;AACL,wBAAQ,WAAW,KAAK,CAAC;AAAA,cAC3B;AACA,sBAAQ,MAAM,QAAQ,OAAO;AAAA;AAAA,YAE/B,KAAK;AAAA,YACL,KAAK;AACH,kBAAI,CAAC,UAAU,GAAG,SAAS,MAAM,GAAG;AAClC,yBAAS;AAAA,cACX;AACA;AAAA,YACF,KAAK;AAAA,YACL,KAAK;AAEH;AAAA;AAAA,YAEF;AACE,oBAAM,IAAI,MAAM,yBAAyB,WAAW,QAAQ,EAAE;AAAA,UAClE;AAAA,QACF,CAAC;AACD,YAAI,WAAW,CAAC,UAAU,GAAG,QAAQ,MAAM,IAAI;AAC7C,mBAAS;AAAA,QACX;AAAA,MACF;AAEA,UAAI,UAAU,MAAM,KAAK,MAAM,GAAG;AAChC,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AACA,WAAO,UAAU;AAAA;AAAA;;;AC5DjB,IAAAC,iBAAA;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,aAAa,CAAC,OAAO,YAAY;AACrC,UAAI;AAGF,eAAO,IAAI,MAAM,OAAO,OAAO,EAAE,SAAS;AAAA,MAC5C,SAAS,IAAI;AACX,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO,UAAU;AAAA;AAAA;;;ACVjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,aAAa;AACnB,QAAM,EAAE,IAAI,IAAI;AAChB,QAAM,QAAQ;AACd,QAAM,YAAY;AAClB,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,MAAM;AACZ,QAAM,MAAM;AAEZ,QAAM,UAAU,CAAC,SAAS,OAAO,MAAM,YAAY;AACjD,gBAAU,IAAI,OAAO,SAAS,OAAO;AACrC,cAAQ,IAAI,MAAM,OAAO,OAAO;AAEhC,UAAI,MAAM,OAAO,MAAM,MAAM;AAC7B,cAAQ,MAAM;AAAA,QACZ,KAAK;AACH,iBAAO;AACP,kBAAQ;AACR,iBAAO;AACP,iBAAO;AACP,kBAAQ;AACR;AAAA,QACF,KAAK;AACH,iBAAO;AACP,kBAAQ;AACR,iBAAO;AACP,iBAAO;AACP,kBAAQ;AACR;AAAA,QACF;AACE,gBAAM,IAAI,UAAU,uCAAuC;AAAA,MAC/D;AAGA,UAAI,UAAU,SAAS,OAAO,OAAO,GAAG;AACtC,eAAO;AAAA,MACT;AAKA,eAAS,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;AACzC,cAAM,cAAc,MAAM,IAAI,CAAC;AAE/B,YAAI,OAAO;AACX,YAAI,MAAM;AAEV,oBAAY,QAAQ,CAAC,eAAe;AAClC,cAAI,WAAW,WAAW,KAAK;AAC7B,yBAAa,IAAI,WAAW,SAAS;AAAA,UACvC;AACA,iBAAO,QAAQ;AACf,gBAAM,OAAO;AACb,cAAI,KAAK,WAAW,QAAQ,KAAK,QAAQ,OAAO,GAAG;AACjD,mBAAO;AAAA,UACT,WAAW,KAAK,WAAW,QAAQ,IAAI,QAAQ,OAAO,GAAG;AACvD,kBAAM;AAAA,UACR;AAAA,QACF,CAAC;AAID,YAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,OAAO;AACrD,iBAAO;AAAA,QACT;AAIA,aAAK,CAAC,IAAI,YAAY,IAAI,aAAa,SACnC,MAAM,SAAS,IAAI,MAAM,GAAG;AAC9B,iBAAO;AAAA,QACT,WAAW,IAAI,aAAa,SAAS,KAAK,SAAS,IAAI,MAAM,GAAG;AAC9D,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,WAAO,UAAU;AAAA;AAAA;;;AC/EjB;AAAA;AACA,QAAM,UAAU;AAChB,QAAM,MAAM,CAAC,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;AAC7E,WAAO,UAAU;AAAA;AAAA;;;ACHjB;AAAA;AAAA,QAAM,UAAU;AAEhB,QAAM,MAAM,CAAC,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;AAC7E,WAAO,UAAU;AAAA;AAAA;;;ACHjB;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,aAAa,CAAC,IAAI,IAAI,YAAY;AACtC,WAAK,IAAI,MAAM,IAAI,OAAO;AAC1B,WAAK,IAAI,MAAM,IAAI,OAAO;AAC1B,aAAO,GAAG,WAAW,IAAI,OAAO;AAAA,IAClC;AACA,WAAO,UAAU;AAAA;AAAA;;;ACNjB;AAAA;AAGA,QAAM,YAAY;AAClB,QAAM,UAAU;AAChB,WAAO,UAAU,CAAC,UAAU,OAAO,YAAY;AAC7C,YAAM,MAAM,CAAC;AACb,UAAIC,SAAQ;AACZ,UAAI,OAAO;AACX,YAAM,IAAI,SAAS,KAAK,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,OAAO,CAAC;AACxD,iBAAW,WAAW,GAAG;AACvB,cAAM,WAAW,UAAU,SAAS,OAAO,OAAO;AAClD,YAAI,UAAU;AACZ,iBAAO;AACP,cAAI,CAACA,QAAO;AACV,YAAAA,SAAQ;AAAA,UACV;AAAA,QACF,OAAO;AACL,cAAI,MAAM;AACR,gBAAI,KAAK,CAACA,QAAO,IAAI,CAAC;AAAA,UACxB;AACA,iBAAO;AACP,UAAAA,SAAQ;AAAA,QACV;AAAA,MACF;AACA,UAAIA,QAAO;AACT,YAAI,KAAK,CAACA,QAAO,IAAI,CAAC;AAAA,MACxB;AAEA,YAAM,SAAS,CAAC;AAChB,iBAAW,CAAC,KAAK,GAAG,KAAK,KAAK;AAC5B,YAAI,QAAQ,KAAK;AACf,iBAAO,KAAK,GAAG;AAAA,QACjB,WAAW,CAAC,OAAO,QAAQ,EAAE,CAAC,GAAG;AAC/B,iBAAO,KAAK,GAAG;AAAA,QACjB,WAAW,CAAC,KAAK;AACf,iBAAO,KAAK,KAAK,GAAG,EAAE;AAAA,QACxB,WAAW,QAAQ,EAAE,CAAC,GAAG;AACvB,iBAAO,KAAK,KAAK,GAAG,EAAE;AAAA,QACxB,OAAO;AACL,iBAAO,KAAK,GAAG,GAAG,MAAM,GAAG,EAAE;AAAA,QAC/B;AAAA,MACF;AACA,YAAM,aAAa,OAAO,KAAK,MAAM;AACrC,YAAM,WAAW,OAAO,MAAM,QAAQ,WAAW,MAAM,MAAM,OAAO,KAAK;AACzE,aAAO,WAAW,SAAS,SAAS,SAAS,aAAa;AAAA,IAC5D;AAAA;AAAA;;;AC9CA;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,aAAa;AACnB,QAAM,EAAE,IAAI,IAAI;AAChB,QAAM,YAAY;AAClB,QAAM,UAAU;AAsChB,QAAM,SAAS,CAAC,KAAK,KAAK,UAAU,CAAC,MAAM;AACzC,UAAI,QAAQ,KAAK;AACf,eAAO;AAAA,MACT;AAEA,YAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,YAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,UAAI,aAAa;AAEjB,YAAO,YAAW,aAAa,IAAI,KAAK;AACtC,mBAAW,aAAa,IAAI,KAAK;AAC/B,gBAAM,QAAQ,aAAa,WAAW,WAAW,OAAO;AACxD,uBAAa,cAAc,UAAU;AACrC,cAAI,OAAO;AACT,qBAAS;AAAA,UACX;AAAA,QACF;AAKA,YAAI,YAAY;AACd,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,QAAM,+BAA+B,CAAC,IAAI,WAAW,WAAW,CAAC;AACjE,QAAM,iBAAiB,CAAC,IAAI,WAAW,SAAS,CAAC;AAEjD,QAAM,eAAe,CAAC,KAAK,KAAK,YAAY;AAC1C,UAAI,QAAQ,KAAK;AACf,eAAO;AAAA,MACT;AAEA,UAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,YAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,iBAAO;AAAA,QACT,WAAW,QAAQ,mBAAmB;AACpC,gBAAM;AAAA,QACR,OAAO;AACL,gBAAM;AAAA,QACR;AAAA,MACF;AAEA,UAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,YAAI,QAAQ,mBAAmB;AAC7B,iBAAO;AAAA,QACT,OAAO;AACL,gBAAM;AAAA,QACR;AAAA,MACF;AAEA,YAAM,QAAQ,oBAAI,IAAI;AACtB,UAAI,IAAI;AACR,iBAAW,KAAK,KAAK;AACnB,YAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,eAAK,SAAS,IAAI,GAAG,OAAO;AAAA,QAC9B,WAAW,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AACpD,eAAK,QAAQ,IAAI,GAAG,OAAO;AAAA,QAC7B,OAAO;AACL,gBAAM,IAAI,EAAE,MAAM;AAAA,QACpB;AAAA,MACF;AAEA,UAAI,MAAM,OAAO,GAAG;AAClB,eAAO;AAAA,MACT;AAEA,UAAI;AACJ,UAAI,MAAM,IAAI;AACZ,mBAAW,QAAQ,GAAG,QAAQ,GAAG,QAAQ,OAAO;AAChD,YAAI,WAAW,GAAG;AAChB,iBAAO;AAAA,QACT,WAAW,aAAa,MAAM,GAAG,aAAa,QAAQ,GAAG,aAAa,OAAO;AAC3E,iBAAO;AAAA,QACT;AAAA,MACF;AAGA,iBAAW,MAAM,OAAO;AACtB,YAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,iBAAO;AAAA,QACT;AAEA,YAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,iBAAO;AAAA,QACT;AAEA,mBAAW,KAAK,KAAK;AACnB,cAAI,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,OAAO,GAAG;AACtC,mBAAO;AAAA,UACT;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAEA,UAAI,QAAQ;AACZ,UAAI,UAAU;AAGd,UAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAC5C,UAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAE5C,UAAI,gBAAgB,aAAa,WAAW,WAAW,KACnD,GAAG,aAAa,OAAO,aAAa,WAAW,CAAC,MAAM,GAAG;AAC3D,uBAAe;AAAA,MACjB;AAEA,iBAAW,KAAK,KAAK;AACnB,mBAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,mBAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,YAAI,IAAI;AACN,cAAI,cAAc;AAChB,gBAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,6BAAe;AAAA,YACjB;AAAA,UACF;AACA,cAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,qBAAS,SAAS,IAAI,GAAG,OAAO;AAChC,gBAAI,WAAW,KAAK,WAAW,IAAI;AACjC,qBAAO;AAAA,YACT;AAAA,UACF,WAAW,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,mBAAO;AAAA,UACT;AAAA,QACF;AACA,YAAI,IAAI;AACN,cAAI,cAAc;AAChB,gBAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,6BAAe;AAAA,YACjB;AAAA,UACF;AACA,cAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,oBAAQ,QAAQ,IAAI,GAAG,OAAO;AAC9B,gBAAI,UAAU,KAAK,UAAU,IAAI;AAC/B,qBAAO;AAAA,YACT;AAAA,UACF,WAAW,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,mBAAO;AAAA,UACT;AAAA,QACF;AACA,YAAI,CAAC,EAAE,aAAa,MAAM,OAAO,aAAa,GAAG;AAC/C,iBAAO;AAAA,QACT;AAAA,MACF;AAKA,UAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,eAAO;AAAA,MACT;AAEA,UAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,eAAO;AAAA,MACT;AAKA,UAAI,gBAAgB,cAAc;AAChC,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AAGA,QAAM,WAAW,CAAC,GAAG,GAAG,YAAY;AAClC,UAAI,CAAC,GAAG;AACN,eAAO;AAAA,MACT;AACA,YAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,aAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AAAA,IACN;AAGA,QAAM,UAAU,CAAC,GAAG,GAAG,YAAY;AACjC,UAAI,CAAC,GAAG;AACN,eAAO;AAAA,MACT;AACA,YAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,aAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AAAA,IACN;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACtPjB,IAAAC,kBAAA;AAAA;AACA,QAAM,aAAa;AACnB,QAAM,YAAY;AAClB,QAAM,SAAS;AACf,QAAM,cAAc;AACpB,QAAM,QAAQ;AACd,QAAM,QAAQ;AACd,QAAM,QAAQ;AACd,QAAM,MAAM;AACZ,QAAM,OAAO;AACb,QAAM,QAAQ;AACd,QAAM,QAAQ;AACd,QAAM,QAAQ;AACd,QAAM,aAAa;AACnB,QAAM,UAAU;AAChB,QAAM,WAAW;AACjB,QAAM,eAAe;AACrB,QAAM,eAAe;AACrB,QAAM,OAAO;AACb,QAAM,QAAQ;AACd,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,QAAM,SAAS;AACf,QAAM,aAAa;AACnB,QAAM,QAAQ;AACd,QAAM,YAAY;AAClB,QAAM,gBAAgB;AACtB,QAAM,gBAAgB;AACtB,QAAM,gBAAgB;AACtB,QAAM,aAAa;AACnB,QAAM,aAAa;AACnB,QAAM,UAAU;AAChB,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,QAAM,aAAa;AACnB,QAAM,gBAAgB;AACtB,QAAM,SAAS;AACf,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,IAAI,WAAW;AAAA,MACf,KAAK,WAAW;AAAA,MAChB,QAAQ,WAAW;AAAA,MACnB,qBAAqB,UAAU;AAAA,MAC/B,eAAe,UAAU;AAAA,MACzB,oBAAoB,YAAY;AAAA,MAChC,qBAAqB,YAAY;AAAA,IACnC;AAAA;AAAA;;;ACxFA,mBAuBY,eAeN,SAwFA,YASA,aAKO,mBA6BA,sBAaP,mBACA,oBAsBO,0BAKA;AAlNb,IAAAC,eAAA;;oBAAmB;AAuBnB,KAAA,SAAYC,gBAAa;AAEvB,MAAAA,eAAA,MAAA,IAAA;AAEA,MAAAA,eAAA,OAAA,IAAA;AAEA,MAAAA,eAAA,QAAA,IAAA;AAEA,MAAAA,eAAA,OAAA,IAAA;AAEA,MAAAA,eAAA,MAAA,IAAA;AAEA,MAAAA,eAAA,QAAA,IAAA;IACF,GAbY,kBAAA,gBAAa,CAAA,EAAA;AAezB,IAAM,UAAmD;MACvD,CAAC,cAAc,IAAI,GAAG;QACpB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,MAAM;QAClB,OAAO,CAAC,WAAY,SAAU;QAC9B,cAAc,CAAC,oBAAoC,IAAI;;MAEzD,CAAC,cAAc,KAAK,GAAG;QACrB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,MAAM;QAClB,OAAO,CAAC,SAAU;QAClB,cAAc,CAAC,oBAAmC;AAAA,cAAAC;AAChD,iBAAA,cAAAC,QAAO,IAAGD,MAAA,cAAAC,QAAO,OAAO,eAAe,OAAC,QAAAD,QAAA,SAAAA,MAAI,IAAI,OAAO,IAAI,IAAI,OAAO,IAAI;QAAI;;MAElF,CAAC,cAAc,KAAK,GAAG;QACrB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,IAAI,OAAO;QACvB,OAAO,CAAC,SAAU;QAClB,cAAc,CAAC,oBAAoC,IAAI;QACvD,eAAe;UACb;YACE,aAAa;YACb,YAAY;YACZ,WAAW;YACX,cAAc;;;;MAIpB,CAAC,cAAc,MAAM,GAAG;QACtB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,OAAO;QACnB,OAAO,CAAC,SAAU;QAClB,cAAc,CAAC,qBAAqC;;MAEtD,CAAC,cAAc,IAAI,GAAG;QACpB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,OAAO;QACnB,OAAO,CAAC,SAAU;QAClB,cAAc,CAAC,qBAAqC;QACpD,eAAe;UACb;YACE,aAAa;YACb,YAAY;YACZ,WAAW;YACX,cAAc;;;;MAIpB,CAAC,cAAc,MAAM,GAAG;QACtB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,OAAO;QACnB,OAAO,CAAC,SAAU;QAClB,cAAc,CAAC,qBAAqC;QACpD,eAAe;UACb;YACE,aAAa;YACb,YAAY;YACZ,WAAW;YACX,cAAc;;;;;AAMtB,IAAM,aAAa;MACjB,MAAM,cAAc;MACpB,UAAU,cAAc;MACxB,eAAe,cAAc;MAC7B,UAAU,cAAc;MACxB,MAAM,cAAc;MACpB,QAAQ,cAAc;;AAGxB,IAAM,cAA6B,OAAO,OAAO,OAAO;AAKjD,IAAM,oBAAoB;AA6B1B,IAAM,uBAAuB,CAAC,iBAAwD;AAC3F,YAAM,SAAS,YAAY,KAAK,OAAK,EAAE,uBAAuB,YAAY;AAC1E,UAAI;AAAQ,eAAO;AACnB,YAAM,KAAK,gBAAgB;AAC3B,YAAM,cAAc,YAAY,KAAK,OAAK,EAAE,gBAAgB,EAAE;AAC9D,aAAO;IACT;AAOA,IAAM,oBAA8B,CAAA;AACpC,IAAM,qBAAqD,CAAA;AAE3D,eAAWE,OAAM,SAAS;AACxB,YAAM,cAAc,QAAQA,GAAE;AAC9B,YAAM,EAAE,cAAa,IAAK;AAC1B,UAAI,eAAe;AACjB,iBAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,gBAAM,OAAO,cAAc,CAAC;AAC5B,4BAAkB,KAAK,KAAK,WAAW;AACvC,6BAAmB,KAAK,WAAW,IAAI,mBACrC,KAAK,YAAY,QAAQ,MAAM,EAAE,CAAC,IACnC,OAAA,OAAA,EACC,YAAW,GACR,IAAI;QAEX;MACF;IACF;AAKO,IAAM,2BAA2B,MAAgB;AAKjD,IAAM,yBAAyB,CAAC,SACrC,mBAAmB,KAAK,YAAW,CAAE;;;;;AC5LhC,SAAS,UAAU,GAAG,GAAG;AAC9B,MAAI,OAAO,MAAM,cAAc,MAAM;AACjC,UAAM,IAAI,UAAU,yBAAyB,OAAO,CAAC,IAAI,+BAA+B;AAC5F,gBAAc,GAAG,CAAC;AAClB,WAAS,KAAK;AAAE,SAAK,cAAc;AAAA,EAAG;AACtC,IAAE,YAAY,MAAM,OAAO,OAAO,OAAO,CAAC,KAAK,GAAG,YAAY,EAAE,WAAW,IAAI,GAAG;AACpF;AAqFO,SAASC,WAAU,SAAS,YAAY,GAAG,WAAW;AAC3D,WAAS,MAAM,OAAO;AAAE,WAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU,SAAS;AAAE,cAAQ,KAAK;AAAA,IAAG,CAAC;AAAA,EAAG;AAC3G,SAAO,KAAK,MAAM,IAAI,UAAU,SAAU,SAAS,QAAQ;AACvD,aAAS,UAAU,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,KAAK,KAAK,CAAC;AAAA,MAAG,SAAS,GAAG;AAAE,eAAO,CAAC;AAAA,MAAG;AAAA,IAAE;AAC1F,aAAS,SAAS,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,OAAO,EAAE,KAAK,CAAC;AAAA,MAAG,SAAS,GAAG;AAAE,eAAO,CAAC;AAAA,MAAG;AAAA,IAAE;AAC7F,aAAS,KAAK,QAAQ;AAAE,aAAO,OAAO,QAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;AAAA,IAAG;AAC7G,UAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAC,CAAC,GAAG,KAAK,CAAC;AAAA,EACxE,CAAC;AACH;AAEO,SAAS,YAAY,SAAS,MAAM;AACzC,MAAI,IAAI,EAAE,OAAO,GAAG,MAAM,WAAW;AAAE,QAAI,EAAE,CAAC,IAAI,EAAG,OAAM,EAAE,CAAC;AAAG,WAAO,EAAE,CAAC;AAAA,EAAG,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,IAAI,OAAO,QAAQ,OAAO,aAAa,aAAa,WAAW,QAAQ,SAAS;AAC/L,SAAO,EAAE,OAAO,KAAK,CAAC,GAAG,EAAE,OAAO,IAAI,KAAK,CAAC,GAAG,EAAE,QAAQ,IAAI,KAAK,CAAC,GAAG,OAAO,WAAW,eAAe,EAAE,OAAO,QAAQ,IAAI,WAAW;AAAE,WAAO;AAAA,EAAM,IAAI;AAC1J,WAAS,KAAK,GAAG;AAAE,WAAO,SAAU,GAAG;AAAE,aAAO,KAAK,CAAC,GAAG,CAAC,CAAC;AAAA,IAAG;AAAA,EAAG;AACjE,WAAS,KAAK,IAAI;AACd,QAAI,EAAG,OAAM,IAAI,UAAU,iCAAiC;AAC5D,WAAO,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,IAAI,KAAK,EAAG,KAAI;AAC1C,UAAI,IAAI,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,IAAI,EAAE,QAAQ,IAAI,GAAG,CAAC,IAAI,EAAE,OAAO,OAAO,IAAI,EAAE,QAAQ,MAAM,EAAE,KAAK,CAAC,GAAG,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,GAAG,GAAG,CAAC,CAAC,GAAG,KAAM,QAAO;AAC3J,UAAI,IAAI,GAAG,EAAG,MAAK,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,KAAK;AACtC,cAAQ,GAAG,CAAC,GAAG;AAAA,QACX,KAAK;AAAA,QAAG,KAAK;AAAG,cAAI;AAAI;AAAA,QACxB,KAAK;AAAG,YAAE;AAAS,iBAAO,EAAE,OAAO,GAAG,CAAC,GAAG,MAAM,MAAM;AAAA,QACtD,KAAK;AAAG,YAAE;AAAS,cAAI,GAAG,CAAC;AAAG,eAAK,CAAC,CAAC;AAAG;AAAA,QACxC,KAAK;AAAG,eAAK,EAAE,IAAI,IAAI;AAAG,YAAE,KAAK,IAAI;AAAG;AAAA,QACxC;AACI,cAAI,EAAE,IAAI,EAAE,MAAM,IAAI,EAAE,SAAS,KAAK,EAAE,EAAE,SAAS,CAAC,OAAO,GAAG,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI;AAAE,gBAAI;AAAG;AAAA,UAAU;AAC3G,cAAI,GAAG,CAAC,MAAM,MAAM,CAAC,KAAM,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC,IAAK;AAAE,cAAE,QAAQ,GAAG,CAAC;AAAG;AAAA,UAAO;AACrF,cAAI,GAAG,CAAC,MAAM,KAAK,EAAE,QAAQ,EAAE,CAAC,GAAG;AAAE,cAAE,QAAQ,EAAE,CAAC;AAAG,gBAAI;AAAI;AAAA,UAAO;AACpE,cAAI,KAAK,EAAE,QAAQ,EAAE,CAAC,GAAG;AAAE,cAAE,QAAQ,EAAE,CAAC;AAAG,cAAE,IAAI,KAAK,EAAE;AAAG;AAAA,UAAO;AAClE,cAAI,EAAE,CAAC,EAAG,GAAE,IAAI,IAAI;AACpB,YAAE,KAAK,IAAI;AAAG;AAAA,MACtB;AACA,WAAK,KAAK,KAAK,SAAS,CAAC;AAAA,IAC7B,SAAS,GAAG;AAAE,WAAK,CAAC,GAAG,CAAC;AAAG,UAAI;AAAA,IAAG,UAAE;AAAU,UAAI,IAAI;AAAA,IAAG;AACzD,QAAI,GAAG,CAAC,IAAI,EAAG,OAAM,GAAG,CAAC;AAAG,WAAO,EAAE,OAAO,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,QAAQ,MAAM,KAAK;AAAA,EACnF;AACF;AAkBO,SAAS,SAAS,GAAG;AAC1B,MAAI,IAAI,OAAO,WAAW,cAAc,OAAO,UAAU,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI;AAC5E,MAAI,EAAG,QAAO,EAAE,KAAK,CAAC;AACtB,MAAI,KAAK,OAAO,EAAE,WAAW,SAAU,QAAO;AAAA,IAC1C,MAAM,WAAY;AACd,UAAI,KAAK,KAAK,EAAE,OAAQ,KAAI;AAC5B,aAAO,EAAE,OAAO,KAAK,EAAE,GAAG,GAAG,MAAM,CAAC,EAAE;AAAA,IAC1C;AAAA,EACJ;AACA,QAAM,IAAI,UAAU,IAAI,4BAA4B,iCAAiC;AACvF;AAEO,SAAS,OAAO,GAAG,GAAG;AAC3B,MAAI,IAAI,OAAO,WAAW,cAAc,EAAE,OAAO,QAAQ;AACzD,MAAI,CAAC,EAAG,QAAO;AACf,MAAI,IAAI,EAAE,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG;AAC/B,MAAI;AACA,YAAQ,MAAM,UAAU,MAAM,MAAM,EAAE,IAAI,EAAE,KAAK,GAAG,KAAM,IAAG,KAAK,EAAE,KAAK;AAAA,EAC7E,SACO,OAAO;AAAE,QAAI,EAAE,MAAa;AAAA,EAAG,UACtC;AACI,QAAI;AACA,UAAI,KAAK,CAAC,EAAE,SAAS,IAAI,EAAE,QAAQ,GAAI,GAAE,KAAK,CAAC;AAAA,IACnD,UACA;AAAU,UAAI,EAAG,OAAM,EAAE;AAAA,IAAO;AAAA,EACpC;AACA,SAAO;AACT;AAkBO,SAAS,cAAc,IAAIC,OAAM,MAAM;AAC5C,MAAI,QAAQ,UAAU,WAAW,EAAG,UAAS,IAAI,GAAG,IAAIA,MAAK,QAAQ,IAAI,IAAI,GAAG,KAAK;AACjF,QAAI,MAAM,EAAE,KAAKA,QAAO;AACpB,UAAI,CAAC,GAAI,MAAK,MAAM,UAAU,MAAM,KAAKA,OAAM,GAAG,CAAC;AACnD,SAAG,CAAC,IAAIA,MAAK,CAAC;AAAA,IAClB;AAAA,EACJ;AACA,SAAO,GAAG,OAAO,MAAM,MAAM,UAAU,MAAM,KAAKA,KAAI,CAAC;AACzD;AAEO,SAAS,QAAQ,GAAG;AACzB,SAAO,gBAAgB,WAAW,KAAK,IAAI,GAAG,QAAQ,IAAI,QAAQ,CAAC;AACrE;AAEO,SAAS,iBAAiB,SAAS,YAAY,WAAW;AAC/D,MAAI,CAAC,OAAO,cAAe,OAAM,IAAI,UAAU,sCAAsC;AACrF,MAAI,IAAI,UAAU,MAAM,SAAS,cAAc,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC;AAC5D,SAAO,IAAI,OAAO,QAAQ,OAAO,kBAAkB,aAAa,gBAAgB,QAAQ,SAAS,GAAG,KAAK,MAAM,GAAG,KAAK,OAAO,GAAG,KAAK,UAAU,WAAW,GAAG,EAAE,OAAO,aAAa,IAAI,WAAY;AAAE,WAAO;AAAA,EAAM,GAAG;AACtN,WAAS,YAAY,GAAG;AAAE,WAAO,SAAU,GAAG;AAAE,aAAO,QAAQ,QAAQ,CAAC,EAAE,KAAK,GAAG,MAAM;AAAA,IAAG;AAAA,EAAG;AAC9F,WAAS,KAAK,GAAG,GAAG;AAAE,QAAI,EAAE,CAAC,GAAG;AAAE,QAAE,CAAC,IAAI,SAAU,GAAG;AAAE,eAAO,IAAI,QAAQ,SAAU,GAAG,GAAG;AAAE,YAAE,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,OAAO,GAAG,CAAC;AAAA,QAAG,CAAC;AAAA,MAAG;AAAG,UAAI,EAAG,GAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AAAA,IAAG;AAAA,EAAE;AACvK,WAAS,OAAO,GAAG,GAAG;AAAE,QAAI;AAAE,WAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAAA,IAAG,SAAS,GAAG;AAAE,aAAO,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC;AAAA,IAAG;AAAA,EAAE;AACjF,WAAS,KAAK,GAAG;AAAE,MAAE,iBAAiB,UAAU,QAAQ,QAAQ,EAAE,MAAM,CAAC,EAAE,KAAK,SAAS,MAAM,IAAI,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC;AAAA,EAAG;AACvH,WAAS,QAAQ,OAAO;AAAE,WAAO,QAAQ,KAAK;AAAA,EAAG;AACjD,WAAS,OAAO,OAAO;AAAE,WAAO,SAAS,KAAK;AAAA,EAAG;AACjD,WAAS,OAAO,GAAG,GAAG;AAAE,QAAI,EAAE,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,OAAQ,QAAO,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AAAA,EAAG;AACnF;AAQO,SAAS,cAAc,GAAG;AAC/B,MAAI,CAAC,OAAO,cAAe,OAAM,IAAI,UAAU,sCAAsC;AACrF,MAAI,IAAI,EAAE,OAAO,aAAa,GAAG;AACjC,SAAO,IAAI,EAAE,KAAK,CAAC,KAAK,IAAI,OAAO,aAAa,aAAa,SAAS,CAAC,IAAI,EAAE,OAAO,QAAQ,EAAE,GAAG,IAAI,CAAC,GAAG,KAAK,MAAM,GAAG,KAAK,OAAO,GAAG,KAAK,QAAQ,GAAG,EAAE,OAAO,aAAa,IAAI,WAAY;AAAE,WAAO;AAAA,EAAM,GAAG;AAC9M,WAAS,KAAK,GAAG;AAAE,MAAE,CAAC,IAAI,EAAE,CAAC,KAAK,SAAU,GAAG;AAAE,aAAO,IAAI,QAAQ,SAAU,SAAS,QAAQ;AAAE,YAAI,EAAE,CAAC,EAAE,CAAC,GAAG,OAAO,SAAS,QAAQ,EAAE,MAAM,EAAE,KAAK;AAAA,MAAG,CAAC;AAAA,IAAG;AAAA,EAAG;AAC/J,WAAS,OAAO,SAAS,QAAQ,GAAG,GAAG;AAAE,YAAQ,QAAQ,CAAC,EAAE,KAAK,SAASC,IAAG;AAAE,cAAQ,EAAE,OAAOA,IAAG,MAAM,EAAE,CAAC;AAAA,IAAG,GAAG,MAAM;AAAA,EAAG;AAC7H;AA5PA,IAgBI;AAhBJ;AAAA;AAgBA,IAAI,gBAAgB,SAAS,GAAG,GAAG;AACjC,sBAAgB,OAAO,kBAClB,EAAE,WAAW,CAAC,EAAE,aAAa,SAAS,SAAUC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAA,MAAG,KAC1E,SAAUD,IAAGC,IAAG;AAAE,iBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,CAAAD,GAAE,CAAC,IAAIC,GAAE,CAAC;AAAA,MAAG;AACpG,aAAO,cAAc,GAAG,CAAC;AAAA,IAC3B;AAAA;AAAA;;;ACjBM,SAAU,WAAW,OAAU;AACnC,SAAO,OAAO,UAAU;AAC1B;AAFA;;;;;;ACKM,SAAU,iBAAoB,YAAgC;AAClE,MAAM,SAAS,SAAC,UAAa;AAC3B,UAAM,KAAK,QAAQ;AACnB,aAAS,QAAQ,IAAI,MAAK,EAAG;EAC/B;AAEA,MAAM,WAAW,WAAW,MAAM;AAClC,WAAS,YAAY,OAAO,OAAO,MAAM,SAAS;AAClD,WAAS,UAAU,cAAc;AACjC,SAAO;AACT;AAVA;;;;;;ACTA,IAkBa;AAlBb;;;AAkBO,IAAM,sBAA+C,iBAC1D,SAAC,QAAM;AACL,aAAA,SAAS,wBAAmC,QAA0B;AACpE,eAAO,IAAI;AACX,aAAK,UAAU,SACR,OAAO,SAAM,8CACxB,OAAO,IAAI,SAAC,KAAK,GAAC;AAAK,iBAAG,IAAI,IAAC,OAAK,IAAI,SAAQ;QAAzB,CAA6B,EAAE,KAAK,MAAM,IACzD;AACJ,aAAK,OAAO;AACZ,aAAK,SAAS;MAChB;IARA,CAQC;;;;;ACvBC,SAAU,UAAa,KAA6B,MAAO;AAC/D,MAAI,KAAK;AACP,QAAM,QAAQ,IAAI,QAAQ,IAAI;AAC9B,SAAK,SAAS,IAAI,OAAO,OAAO,CAAC;;AAErC;AALA;;;;;;ACqMM,SAAU,eAAe,OAAU;AACvC,SACE,iBAAiB,gBAChB,SAAS,YAAY,SAAS,WAAW,MAAM,MAAM,KAAK,WAAW,MAAM,GAAG,KAAK,WAAW,MAAM,WAAW;AAEpH;AAEA,SAAS,cAAc,WAAwC;AAC7D,MAAI,WAAW,SAAS,GAAG;AACzB,cAAS;SACJ;AACL,cAAU,YAAW;;AAEzB;IAtMA,cAuLa;;;;AAxMb;AACA;AAEA;AAcA,IAAA,eAAA,WAAA;AAyBE,eAAAC,cAAoB,iBAA4B;AAA5B,aAAA,kBAAA;AAdb,aAAA,SAAS;AAER,aAAA,aAAmD;AAMnD,aAAA,cAAqD;MAMV;AAQnD,MAAAA,cAAA,UAAA,cAAA,WAAA;;AACE,YAAI;AAEJ,YAAI,CAAC,KAAK,QAAQ;AAChB,eAAK,SAAS;AAGN,cAAA,aAAe,KAAI;AAC3B,cAAI,YAAY;AACd,iBAAK,aAAa;AAClB,gBAAI,MAAM,QAAQ,UAAU,GAAG;;AAC7B,yBAAqB,eAAA,SAAA,UAAU,GAAA,iBAAA,aAAA,KAAA,GAAA,CAAA,eAAA,MAAA,iBAAA,aAAA,KAAA,GAAE;AAA5B,sBAAM,WAAM,eAAA;AACf,2BAAO,OAAO,IAAI;;;;;;;;;;;mBAEf;AACL,yBAAW,OAAO,IAAI;;;AAIlB,cAAiB,mBAAqB,KAAI;AAClD,cAAI,WAAW,gBAAgB,GAAG;AAChC,gBAAI;AACF,+BAAgB;qBACT,GAAG;AACV,uBAAS,aAAa,sBAAsB,EAAE,SAAS,CAAC,CAAC;;;AAIrD,cAAA,cAAgB,KAAI;AAC5B,cAAI,aAAa;AACf,iBAAK,cAAc;;AACnB,uBAAwB,gBAAA,SAAA,WAAW,GAAA,kBAAA,cAAA,KAAA,GAAA,CAAA,gBAAA,MAAA,kBAAA,cAAA,KAAA,GAAE;AAAhC,oBAAM,YAAS,gBAAA;AAClB,oBAAI;AACF,gCAAc,SAAS;yBAChB,KAAK;AACZ,2BAAS,WAAM,QAAN,WAAM,SAAN,SAAU,CAAA;AACnB,sBAAI,eAAe,qBAAqB;AACtC,6BAAM,cAAA,cAAA,CAAA,GAAA,OAAO,MAAM,CAAA,GAAA,OAAK,IAAI,MAAM,CAAA;yBAC7B;AACL,2BAAO,KAAK,GAAG;;;;;;;;;;;;;;AAMvB,cAAI,QAAQ;AACV,kBAAM,IAAI,oBAAoB,MAAM;;;MAG1C;AAoBA,MAAAA,cAAA,UAAA,MAAA,SAAI,UAAuB;;AAGzB,YAAI,YAAY,aAAa,MAAM;AACjC,cAAI,KAAK,QAAQ;AAGf,0BAAc,QAAQ;iBACjB;AACL,gBAAI,oBAAoBA,eAAc;AAGpC,kBAAI,SAAS,UAAU,SAAS,WAAW,IAAI,GAAG;AAChD;;AAEF,uBAAS,WAAW,IAAI;;AAE1B,aAAC,KAAK,eAAcC,MAAA,KAAK,iBAAW,QAAAA,QAAA,SAAAA,MAAI,CAAA,GAAI,KAAK,QAAQ;;;MAG/D;AAOQ,MAAAD,cAAA,UAAA,aAAR,SAAmB,QAAoB;AAC7B,YAAA,aAAe,KAAI;AAC3B,eAAO,eAAe,UAAW,MAAM,QAAQ,UAAU,KAAK,WAAW,SAAS,MAAM;MAC1F;AASQ,MAAAA,cAAA,UAAA,aAAR,SAAmB,QAAoB;AAC7B,YAAA,aAAe,KAAI;AAC3B,aAAK,aAAa,MAAM,QAAQ,UAAU,KAAK,WAAW,KAAK,MAAM,GAAG,cAAc,aAAa,CAAC,YAAY,MAAM,IAAI;MAC5H;AAMQ,MAAAA,cAAA,UAAA,gBAAR,SAAsB,QAAoB;AAChC,YAAA,aAAe,KAAI;AAC3B,YAAI,eAAe,QAAQ;AACzB,eAAK,aAAa;mBACT,MAAM,QAAQ,UAAU,GAAG;AACpC,oBAAU,YAAY,MAAM;;MAEhC;AAgBA,MAAAA,cAAA,UAAA,SAAA,SAAO,UAAsC;AACnC,YAAA,cAAgB,KAAI;AAC5B,uBAAe,UAAU,aAAa,QAAQ;AAE9C,YAAI,oBAAoBA,eAAc;AACpC,mBAAS,cAAc,IAAI;;MAE/B;AAlLc,MAAAA,cAAA,QAAS,WAAA;AACrB,YAAM,QAAQ,IAAIA,cAAY;AAC9B,cAAM,SAAS;AACf,eAAO;MACT,EAAE;AA+KJ,aAAAA;MArLA;AAuLO,IAAM,qBAAqB,aAAa;;;;;ACjM/C,IAAa;AAAb;;AAAO,IAAM,SAAuB;MAClC,kBAAkB;MAClB,uBAAuB;MACvB,SAAS;MACT,uCAAuC;MACvC,0BAA0B;;;;;;ICGf;;;;AAAN,IAAM,kBAAmC;MAG9C,YAAA,SAAW,SAAqB,SAAgB;AAAE,YAAA,OAAA,CAAA;iBAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAAO;AAAP,eAAA,KAAA,CAAA,IAAA,UAAA,EAAA;;AACxC,YAAA,WAAa,gBAAe;AACpC,YAAI,aAAQ,QAAR,aAAQ,SAAA,SAAR,SAAU,YAAY;AACxB,iBAAO,SAAS,WAAU,MAAnB,UAAQ,cAAA,CAAY,SAAS,OAAO,GAAA,OAAK,IAAI,CAAA,CAAA;;AAEtD,eAAO,WAAU,MAAA,QAAA,cAAA,CAAC,SAAS,OAAO,GAAA,OAAK,IAAI,CAAA,CAAA;MAC7C;MACA,cAAA,SAAa,QAAM;AACT,YAAA,WAAa,gBAAe;AACpC,iBAAQ,aAAQ,QAAR,aAAQ,SAAA,SAAR,SAAU,iBAAgB,cAAc,MAAa;MAC/D;MACA,UAAU;;;;;;ACjBN,SAAU,qBAAqB,KAAQ;AAC3C,kBAAgB,WAAW,WAAA;AACjB,QAAA,mBAAqB,OAAM;AACnC,QAAI,kBAAkB;AAEpB,uBAAiB,GAAG;WACf;AAEL,YAAM;;EAEV,CAAC;AACH;AAvBA;;;AACA;;;;;ACAM,SAAU,OAAI;AAAK;AAAzB;;;;;;ACaM,SAAU,kBAAkB,OAAU;AAC1C,SAAO,mBAAmB,KAAK,QAAW,KAAK;AACjD;AAOM,SAAU,iBAAoB,OAAQ;AAC1C,SAAO,mBAAmB,KAAK,OAAO,MAAS;AACjD;AAQM,SAAU,mBAAmB,MAAuB,OAAY,OAAU;AAC9E,SAAO;IACL;IACA;IACA;;AAEJ;AAhCA,IAAa;AAAb;;AAAO,IAAM,wBAAyB,WAAA;AAAM,aAAA,mBAAmB,KAAK,QAAW,MAAS;IAA5C,EAAsE;;;;;ACI5G,SAAU,aAAa,IAAc;AACzC,MAAI,OAAO,uCAAuC;AAChD,QAAM,SAAS,CAAC;AAChB,QAAI,QAAQ;AACV,gBAAU,EAAE,aAAa,OAAO,OAAO,KAAI;;AAE7C,OAAE;AACF,QAAI,QAAQ;AACJ,UAAAE,MAAyB,SAAvB,cAAWA,IAAA,aAAE,QAAKA,IAAA;AAC1B,gBAAU;AACV,UAAI,aAAa;AACf,cAAM;;;SAGL;AAGL,OAAE;;AAEN;AAMM,SAAU,aAAa,KAAQ;AACnC,MAAI,OAAO,yCAAyC,SAAS;AAC3D,YAAQ,cAAc;AACtB,YAAQ,QAAQ;;AAEpB;AAzCA,IAEI;AAFJ;;;AAEA,IAAI,UAAuD;;;;;AC+I3D,SAAS,KAAyC,IAAQ,SAAY;AACpE,SAAO,MAAM,KAAK,IAAI,OAAO;AAC/B;AAwFA,SAAS,qBAAqB,OAAU;AACtC,MAAI,OAAO,uCAAuC;AAChD,iBAAa,KAAK;SACb;AAGL,yBAAqB,KAAK;;AAE9B;AAQA,SAAS,oBAAoB,KAAQ;AACnC,QAAM;AACR;AAOA,SAAS,0BAA0B,cAA2C,YAA2B;AAC/F,MAAA,wBAA0B,OAAM;AACxC,2BAAyB,gBAAgB,WAAW,WAAA;AAAM,WAAA,sBAAsB,cAAc,UAAU;EAA9C,CAA+C;AAC3G;IAnPA,YA2HM,OAUN,kBAuCA,gBA8Ea;;;;AA9Qb;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AAYA,IAAA,aAAA,SAAA,QAAA;AAAmC,gBAAAC,aAAA,MAAA;AA6BjC,eAAAA,YAAY,aAA6C;AAAzD,YAAA,QACE,OAAA,KAAA,IAAA,KAAO;AATC,cAAA,YAAqB;AAU7B,YAAI,aAAa;AACf,gBAAK,cAAc;AAGnB,cAAI,eAAe,WAAW,GAAG;AAC/B,wBAAY,IAAI,KAAI;;eAEjB;AACL,gBAAK,cAAc;;;MAEvB;AAzBO,MAAAA,YAAA,SAAP,SAAiB,MAAwB,OAA2B,UAAqB;AACvF,eAAO,IAAI,eAAe,MAAM,OAAO,QAAQ;MACjD;AAgCA,MAAAA,YAAA,UAAA,OAAA,SAAK,OAAS;AACZ,YAAI,KAAK,WAAW;AAClB,oCAA0B,iBAAiB,KAAK,GAAG,IAAI;eAClD;AACL,eAAK,MAAM,KAAM;;MAErB;AASA,MAAAA,YAAA,UAAA,QAAA,SAAM,KAAS;AACb,YAAI,KAAK,WAAW;AAClB,oCAA0B,kBAAkB,GAAG,GAAG,IAAI;eACjD;AACL,eAAK,YAAY;AACjB,eAAK,OAAO,GAAG;;MAEnB;AAQA,MAAAA,YAAA,UAAA,WAAA,WAAA;AACE,YAAI,KAAK,WAAW;AAClB,oCAA0B,uBAAuB,IAAI;eAChD;AACL,eAAK,YAAY;AACjB,eAAK,UAAS;;MAElB;AAEA,MAAAA,YAAA,UAAA,cAAA,WAAA;AACE,YAAI,CAAC,KAAK,QAAQ;AAChB,eAAK,YAAY;AACjB,iBAAA,UAAM,YAAW,KAAA,IAAA;AACjB,eAAK,cAAc;;MAEvB;AAEU,MAAAA,YAAA,UAAA,QAAV,SAAgB,OAAQ;AACtB,aAAK,YAAY,KAAK,KAAK;MAC7B;AAEU,MAAAA,YAAA,UAAA,SAAV,SAAiB,KAAQ;AACvB,YAAI;AACF,eAAK,YAAY,MAAM,GAAG;;AAE1B,eAAK,YAAW;;MAEpB;AAEU,MAAAA,YAAA,UAAA,YAAV,WAAA;AACE,YAAI;AACF,eAAK,YAAY,SAAQ;;AAEzB,eAAK,YAAW;;MAEpB;AACF,aAAAA;IAAA,EApHmC,YAAY;AA2H/C,IAAM,QAAQ,SAAS,UAAU;AAUjC,IAAA,mBAAA,WAAA;AACE,eAAAC,kBAAoB,iBAAqC;AAArC,aAAA,kBAAA;MAAwC;AAE5D,MAAAA,kBAAA,UAAA,OAAA,SAAK,OAAQ;AACH,YAAA,kBAAoB,KAAI;AAChC,YAAI,gBAAgB,MAAM;AACxB,cAAI;AACF,4BAAgB,KAAK,KAAK;mBACnB,OAAO;AACd,iCAAqB,KAAK;;;MAGhC;AAEA,MAAAA,kBAAA,UAAA,QAAA,SAAM,KAAQ;AACJ,YAAA,kBAAoB,KAAI;AAChC,YAAI,gBAAgB,OAAO;AACzB,cAAI;AACF,4BAAgB,MAAM,GAAG;mBAClB,OAAO;AACd,iCAAqB,KAAK;;eAEvB;AACL,+BAAqB,GAAG;;MAE5B;AAEA,MAAAA,kBAAA,UAAA,WAAA,WAAA;AACU,YAAA,kBAAoB,KAAI;AAChC,YAAI,gBAAgB,UAAU;AAC5B,cAAI;AACF,4BAAgB,SAAQ;mBACjB,OAAO;AACd,iCAAqB,KAAK;;;MAGhC;AACF,aAAAA;IAAA,EArCA;AAuCA,IAAA,iBAAA,SAAA,QAAA;AAAuC,gBAAAC,iBAAA,MAAA;AACrC,eAAAA,gBACE,gBACA,OACA,UAA8B;AAHhC,YAAA,QAKE,OAAA,KAAA,IAAA,KAAO;AAEP,YAAI;AACJ,YAAI,WAAW,cAAc,KAAK,CAAC,gBAAgB;AAGjD,4BAAkB;YAChB,MAAO,mBAAc,QAAd,mBAAc,SAAd,iBAAkB;YACzB,OAAO,UAAK,QAAL,UAAK,SAAL,QAAS;YAChB,UAAU,aAAQ,QAAR,aAAQ,SAAR,WAAY;;eAEnB;AAEL,cAAI;AACJ,cAAI,SAAQ,OAAO,0BAA0B;AAI3C,wBAAU,OAAO,OAAO,cAAc;AACtC,sBAAQ,cAAc,WAAA;AAAM,qBAAA,MAAK,YAAW;YAAhB;AAC5B,8BAAkB;cAChB,MAAM,eAAe,QAAQ,KAAK,eAAe,MAAM,SAAO;cAC9D,OAAO,eAAe,SAAS,KAAK,eAAe,OAAO,SAAO;cACjE,UAAU,eAAe,YAAY,KAAK,eAAe,UAAU,SAAO;;iBAEvE;AAEL,8BAAkB;;;AAMtB,cAAK,cAAc,IAAI,iBAAiB,eAAe;;MACzD;AACF,aAAAA;IAAA,EAzCuC,UAAU;AA8E1C,IAAM,iBAA6D;MACxE,QAAQ;MACR,MAAM;MACN,OAAO;MACP,UAAU;;;;;;AC5QZ,IAAa;AAAb;;AAAO,IAAM,aAA+B,WAAA;AAAM,aAAC,OAAO,WAAW,cAAc,OAAO,cAAe;IAAvD,EAAsE;;;;;ACoClH,SAAU,SAAY,GAAI;AAC9B,SAAO;AACT;AAFA;;;;;;ACwCM,SAAU,cAAoB,KAA+B;AACjE,MAAI,IAAI,WAAW,GAAG;AACpB,WAAO;;AAGT,MAAI,IAAI,WAAW,GAAG;AACpB,WAAO,IAAI,CAAC;;AAGd,SAAO,SAAS,MAAM,OAAQ;AAC5B,WAAO,IAAI,OAAO,SAAC,MAAW,IAAuB;AAAK,aAAA,GAAG,IAAI;IAAP,GAAU,KAAY;EAClF;AACF;AA9FA;;;;;;;ACueA,SAAS,eAAe,aAA+C;;AACrE,UAAOC,MAAA,gBAAW,QAAX,gBAAW,SAAX,cAAe,OAAO,aAAO,QAAAA,QAAA,SAAAA,MAAI;AAC1C;AAEA,SAAS,WAAc,OAAU;AAC/B,SAAO,SAAS,WAAW,MAAM,IAAI,KAAK,WAAW,MAAM,KAAK,KAAK,WAAW,MAAM,QAAQ;AAChG;AAEA,SAAS,aAAgB,OAAU;AACjC,SAAQ,SAAS,iBAAiB,cAAgB,WAAW,KAAK,KAAK,eAAe,KAAK;AAC7F;AAhfA,IAeA;AAfA;;;AACA;AAEA;AACA;AACA;AACA;AACA;AAQA,IAAA,aAAA,WAAA;AAkBE,eAAAC,YAAY,WAA6E;AACvF,YAAI,WAAW;AACb,eAAK,aAAa;;MAEtB;AA4BA,MAAAA,YAAA,UAAA,OAAA,SAAQ,UAAyB;AAC/B,YAAMC,cAAa,IAAID,YAAU;AACjC,QAAAC,YAAW,SAAS;AACpB,QAAAA,YAAW,WAAW;AACtB,eAAOA;MACT;AA6IA,MAAAD,YAAA,UAAA,YAAA,SACE,gBACA,OACA,UAA8B;AAHhC,YAAA,QAAA;AAKE,YAAM,aAAa,aAAa,cAAc,IAAI,iBAAiB,IAAI,eAAe,gBAAgB,OAAO,QAAQ;AAErH,qBAAa,WAAA;AACL,cAAAD,MAAuB,OAArB,WAAQA,IAAA,UAAE,SAAMA,IAAA;AACxB,qBAAW,IACT,WAGI,SAAS,KAAK,YAAY,MAAM,IAChC,SAIA,MAAK,WAAW,UAAU,IAG1B,MAAK,cAAc,UAAU,CAAC;QAEtC,CAAC;AAED,eAAO;MACT;AAGU,MAAAC,YAAA,UAAA,gBAAV,SAAwB,MAAmB;AACzC,YAAI;AACF,iBAAO,KAAK,WAAW,IAAI;iBACpB,KAAK;AAIZ,eAAK,MAAM,GAAG;;MAElB;AA6DA,MAAAA,YAAA,UAAA,UAAA,SAAQ,MAA0B,aAAoC;AAAtE,YAAA,QAAA;AACE,sBAAc,eAAe,WAAW;AAExC,eAAO,IAAI,YAAkB,SAAC,SAAS,QAAM;AAC3C,cAAM,aAAa,IAAI,eAAkB;YACvC,MAAM,SAAC,OAAK;AACV,kBAAI;AACF,qBAAK,KAAK;uBACH,KAAK;AACZ,uBAAO,GAAG;AACV,2BAAW,YAAW;;YAE1B;YACA,OAAO;YACP,UAAU;WACX;AACD,gBAAK,UAAU,UAAU;QAC3B,CAAC;MACH;AAGU,MAAAA,YAAA,UAAA,aAAV,SAAqB,YAA2B;;AAC9C,gBAAOD,MAAA,KAAK,YAAM,QAAAA,QAAA,SAAA,SAAAA,IAAE,UAAU,UAAU;MAC1C;AAOA,MAAAC,YAAA,UAAC,UAAiB,IAAlB,WAAA;AACE,eAAO;MACT;AA4FA,MAAAA,YAAA,UAAA,OAAA,WAAA;AAAK,YAAA,aAAA,CAAA;iBAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAA2C;AAA3C,qBAAA,EAAA,IAAA,UAAA,EAAA;;AACH,eAAO,cAAc,UAAU,EAAE,IAAI;MACvC;AA6BA,MAAAA,YAAA,UAAA,YAAA,SAAU,aAAoC;AAA9C,YAAA,QAAA;AACE,sBAAc,eAAe,WAAW;AAExC,eAAO,IAAI,YAAY,SAAC,SAAS,QAAM;AACrC,cAAI;AACJ,gBAAK,UACH,SAAC,GAAI;AAAK,mBAAC,QAAQ;UAAT,GACV,SAAC,KAAQ;AAAK,mBAAA,OAAO,GAAG;UAAV,GACd,WAAA;AAAM,mBAAA,QAAQ,KAAK;UAAb,CAAc;QAExB,CAAC;MACH;AA1aO,MAAAA,YAAA,SAAkC,SAAI,WAAwD;AACnG,eAAO,IAAIA,YAAc,SAAS;MACpC;AAyaF,aAAAA;MA9cA;;;;;ACRM,SAAU,QAAQ,QAAW;AACjC,SAAO,WAAW,WAAM,QAAN,WAAM,SAAA,SAAN,OAAQ,IAAI;AAChC;AAMM,SAAU,QACd,MAAqF;AAErF,SAAO,SAAC,QAAqB;AAC3B,QAAI,QAAQ,MAAM,GAAG;AACnB,aAAO,OAAO,KAAK,SAA+B,cAA2B;AAC3E,YAAI;AACF,iBAAO,KAAK,cAAc,IAAI;iBACvB,KAAK;AACZ,eAAK,MAAM,GAAG;;MAElB,CAAC;;AAEH,UAAM,IAAI,UAAU,wCAAwC;EAC9D;AACF;AA5BA;;;;;;;ACWM,SAAU,yBACd,aACA,QACA,YACA,SACA,YAAuB;AAEvB,SAAO,IAAI,mBAAmB,aAAa,QAAQ,YAAY,SAAS,UAAU;AACpF;IAMA;;;;AA5BA;AA4BA,IAAA,qBAAA,SAAA,QAAA;AAA2C,gBAAAE,qBAAA,MAAA;AAiBzC,eAAAA,oBACE,aACA,QACA,YACA,SACQ,YACA,mBAAiC;AAN3C,YAAA,QAoBE,OAAA,KAAA,MAAM,WAAW,KAAC;AAfV,cAAA,aAAA;AACA,cAAA,oBAAA;AAeR,cAAK,QAAQ,SACT,SAAuC,OAAQ;AAC7C,cAAI;AACF,mBAAO,KAAK;mBACL,KAAK;AACZ,wBAAY,MAAM,GAAG;;QAEzB,IACA,OAAA,UAAM;AACV,cAAK,SAAS,UACV,SAAuC,KAAQ;AAC7C,cAAI;AACF,oBAAQ,GAAG;mBACJC,MAAK;AAEZ,wBAAY,MAAMA,IAAG;;AAGrB,iBAAK,YAAW;;QAEpB,IACA,OAAA,UAAM;AACV,cAAK,YAAY,aACb,WAAA;AACE,cAAI;AACF,uBAAU;mBACH,KAAK;AAEZ,wBAAY,MAAM,GAAG;;AAGrB,iBAAK,YAAW;;QAEpB,IACA,OAAA,UAAM;;MACZ;AAEA,MAAAD,oBAAA,UAAA,cAAA,WAAA;;AACE,YAAI,CAAC,KAAK,qBAAqB,KAAK,kBAAiB,GAAI;AAC/C,cAAA,WAAW,KAAI;AACvB,iBAAA,UAAM,YAAW,KAAA,IAAA;AAEjB,WAAC,cAAUE,MAAA,KAAK,gBAAU,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAAf,IAAI;;MAEnB;AACF,aAAAF;IAAA,EAnF2C,UAAU;;;;;AC5BrD,IAqBa;AArBb;;;AAqBO,IAAM,0BAAuD,iBAClE,SAAC,QAAM;AACL,aAAA,SAAS,8BAA2B;AAClC,eAAO,IAAI;AACX,aAAK,OAAO;AACZ,aAAK,UAAU;MACjB;IAJA,CAIC;;;;;ICXL,SAkJA;;;;AAjKA;AAEA;AAEA;AACA;AACA;AASA,IAAA,UAAA,SAAA,QAAA;AAAgC,gBAAAG,UAAA,MAAA;AAwB9B,eAAAA,WAAA;AAAA,YAAA,QAEE,OAAA,KAAA,IAAA,KAAO;AAzBT,cAAA,SAAS;AAED,cAAA,mBAAyC;AAGjD,cAAA,YAA2B,CAAA;AAE3B,cAAA,YAAY;AAEZ,cAAA,WAAW;AAEX,cAAA,cAAmB;;MAenB;AAGA,MAAAA,SAAA,UAAA,OAAA,SAAQ,UAAwB;AAC9B,YAAM,UAAU,IAAI,iBAAiB,MAAM,IAAI;AAC/C,gBAAQ,WAAW;AACnB,eAAO;MACT;AAGU,MAAAA,SAAA,UAAA,iBAAV,WAAA;AACE,YAAI,KAAK,QAAQ;AACf,gBAAM,IAAI,wBAAuB;;MAErC;AAEA,MAAAA,SAAA,UAAA,OAAA,SAAK,OAAQ;AAAb,YAAA,QAAA;AACE,qBAAa,WAAA;;AACX,gBAAK,eAAc;AACnB,cAAI,CAAC,MAAK,WAAW;AACnB,gBAAI,CAAC,MAAK,kBAAkB;AAC1B,oBAAK,mBAAmB,MAAM,KAAK,MAAK,SAAS;;;AAEnD,uBAAuB,KAAA,SAAA,MAAK,gBAAgB,GAAA,KAAA,GAAA,KAAA,GAAA,CAAA,GAAA,MAAA,KAAA,GAAA,KAAA,GAAE;AAAzC,oBAAM,WAAQ,GAAA;AACjB,yBAAS,KAAK,KAAK;;;;;;;;;;;;QAGzB,CAAC;MACH;AAEA,MAAAA,SAAA,UAAA,QAAA,SAAM,KAAQ;AAAd,YAAA,QAAA;AACE,qBAAa,WAAA;AACX,gBAAK,eAAc;AACnB,cAAI,CAAC,MAAK,WAAW;AACnB,kBAAK,WAAW,MAAK,YAAY;AACjC,kBAAK,cAAc;AACX,gBAAA,YAAc,MAAI;AAC1B,mBAAO,UAAU,QAAQ;AACvB,wBAAU,MAAK,EAAI,MAAM,GAAG;;;QAGlC,CAAC;MACH;AAEA,MAAAA,SAAA,UAAA,WAAA,WAAA;AAAA,YAAA,QAAA;AACE,qBAAa,WAAA;AACX,gBAAK,eAAc;AACnB,cAAI,CAAC,MAAK,WAAW;AACnB,kBAAK,YAAY;AACT,gBAAA,YAAc,MAAI;AAC1B,mBAAO,UAAU,QAAQ;AACvB,wBAAU,MAAK,EAAI,SAAQ;;;QAGjC,CAAC;MACH;AAEA,MAAAA,SAAA,UAAA,cAAA,WAAA;AACE,aAAK,YAAY,KAAK,SAAS;AAC/B,aAAK,YAAY,KAAK,mBAAmB;MAC3C;AAEA,aAAA,eAAIA,SAAA,WAAA,YAAQ;aAAZ,WAAA;;AACE,mBAAOC,MAAA,KAAK,eAAS,QAAAA,QAAA,SAAA,SAAAA,IAAE,UAAS;QAClC;;;;AAGU,MAAAD,SAAA,UAAA,gBAAV,SAAwB,YAAyB;AAC/C,aAAK,eAAc;AACnB,eAAO,OAAA,UAAM,cAAa,KAAA,MAAC,UAAU;MACvC;AAGU,MAAAA,SAAA,UAAA,aAAV,SAAqB,YAAyB;AAC5C,aAAK,eAAc;AACnB,aAAK,wBAAwB,UAAU;AACvC,eAAO,KAAK,gBAAgB,UAAU;MACxC;AAGU,MAAAA,SAAA,UAAA,kBAAV,SAA0B,YAA2B;AAArD,YAAA,QAAA;AACQ,YAAAC,MAAqC,MAAnC,WAAQA,IAAA,UAAE,YAASA,IAAA,WAAE,YAASA,IAAA;AACtC,YAAI,YAAY,WAAW;AACzB,iBAAO;;AAET,aAAK,mBAAmB;AACxB,kBAAU,KAAK,UAAU;AACzB,eAAO,IAAI,aAAa,WAAA;AACtB,gBAAK,mBAAmB;AACxB,oBAAU,WAAW,UAAU;QACjC,CAAC;MACH;AAGU,MAAAD,SAAA,UAAA,0BAAV,SAAkC,YAA2B;AACrD,YAAAC,MAAuC,MAArC,WAAQA,IAAA,UAAE,cAAWA,IAAA,aAAE,YAASA,IAAA;AACxC,YAAI,UAAU;AACZ,qBAAW,MAAM,WAAW;mBACnB,WAAW;AACpB,qBAAW,SAAQ;;MAEvB;AAQA,MAAAD,SAAA,UAAA,eAAA,WAAA;AACE,YAAME,cAAkB,IAAI,WAAU;AACtC,QAAAA,YAAW,SAAS;AACpB,eAAOA;MACT;AAxHO,MAAAF,SAAA,SAAkC,SAAI,aAA0B,QAAqB;AAC1F,eAAO,IAAI,iBAAoB,aAAa,MAAM;MACpD;AAuHF,aAAAA;MA7IgC,UAAU;AAkJ1C,IAAA,mBAAA,SAAA,QAAA;AAAyC,gBAAAG,mBAAA,MAAA;AACvC,eAAAA,kBAES,aACP,QAAsB;AAHxB,YAAA,QAKE,OAAA,KAAA,IAAA,KAAO;AAHA,cAAA,cAAA;AAIP,cAAK,SAAS;;MAChB;AAEA,MAAAA,kBAAA,UAAA,OAAA,SAAK,OAAQ;;AACX,SAAA,MAAAF,MAAA,KAAK,iBAAW,QAAAA,QAAA,SAAA,SAAAA,IAAE,UAAI,QAAA,OAAA,SAAA,SAAA,GAAA,KAAAA,KAAG,KAAK;MAChC;AAEA,MAAAE,kBAAA,UAAA,QAAA,SAAM,KAAQ;;AACZ,SAAA,MAAAF,MAAA,KAAK,iBAAW,QAAAA,QAAA,SAAA,SAAAA,IAAE,WAAK,QAAA,OAAA,SAAA,SAAA,GAAA,KAAAA,KAAG,GAAG;MAC/B;AAEA,MAAAE,kBAAA,UAAA,WAAA,WAAA;;AACE,SAAA,MAAAF,MAAA,KAAK,iBAAW,QAAAA,QAAA,SAAA,SAAAA,IAAE,cAAQ,QAAA,OAAA,SAAA,SAAA,GAAA,KAAAA,GAAA;MAC5B;AAGU,MAAAE,kBAAA,UAAA,aAAV,SAAqB,YAAyB;;AAC5C,gBAAO,MAAAF,MAAA,KAAK,YAAM,QAAAA,QAAA,SAAA,SAAAA,IAAE,UAAU,UAAU,OAAC,QAAA,OAAA,SAAA,KAAI;MAC/C;AACF,aAAAE;IAAA,EA1ByC,OAAO;;;;;AC5JhD,IAAa;AAAb;;AAAO,IAAM,wBAA+C;MAC1D,KAAG,WAAA;AAGD,gBAAQ,sBAAsB,YAAY,MAAM,IAAG;MACrD;MACA,UAAU;;;;;;ICwBZ;;;;AApCA;AAIA;AAgCA,IAAA,gBAAA,SAAA,QAAA;AAAsC,gBAAAC,gBAAA,MAAA;AAUpC,eAAAA,eACU,aACA,aACA,oBAA6D;AAF7D,YAAA,gBAAA,QAAA;AAAA,wBAAA;QAAsB;AACtB,YAAA,gBAAA,QAAA;AAAA,wBAAA;QAAsB;AACtB,YAAA,uBAAA,QAAA;AAAA,+BAAA;QAA6D;AAHvE,YAAA,QAKE,OAAA,KAAA,IAAA,KAAO;AAJC,cAAA,cAAA;AACA,cAAA,cAAA;AACA,cAAA,qBAAA;AAZF,cAAA,UAA0B,CAAA;AAC1B,cAAA,sBAAsB;AAc5B,cAAK,sBAAsB,gBAAgB;AAC3C,cAAK,cAAc,KAAK,IAAI,GAAG,WAAW;AAC1C,cAAK,cAAc,KAAK,IAAI,GAAG,WAAW;;MAC5C;AAEA,MAAAA,eAAA,UAAA,OAAA,SAAK,OAAQ;AACL,YAAAC,MAA+E,MAA7E,YAASA,IAAA,WAAE,UAAOA,IAAA,SAAE,sBAAmBA,IAAA,qBAAE,qBAAkBA,IAAA,oBAAE,cAAWA,IAAA;AAChF,YAAI,CAAC,WAAW;AACd,kBAAQ,KAAK,KAAK;AAClB,WAAC,uBAAuB,QAAQ,KAAK,mBAAmB,IAAG,IAAK,WAAW;;AAE7E,aAAK,YAAW;AAChB,eAAA,UAAM,KAAI,KAAA,MAAC,KAAK;MAClB;AAGU,MAAAD,eAAA,UAAA,aAAV,SAAqB,YAAyB;AAC5C,aAAK,eAAc;AACnB,aAAK,YAAW;AAEhB,YAAM,eAAe,KAAK,gBAAgB,UAAU;AAE9C,YAAAC,MAAmC,MAAjC,sBAAmBA,IAAA,qBAAE,UAAOA,IAAA;AAGpC,YAAM,OAAO,QAAQ,MAAK;AAC1B,iBAAS,IAAI,GAAG,IAAI,KAAK,UAAU,CAAC,WAAW,QAAQ,KAAK,sBAAsB,IAAI,GAAG;AACvF,qBAAW,KAAK,KAAK,CAAC,CAAM;;AAG9B,aAAK,wBAAwB,UAAU;AAEvC,eAAO;MACT;AAEQ,MAAAD,eAAA,UAAA,cAAR,WAAA;AACQ,YAAAC,MAAoE,MAAlE,cAAWA,IAAA,aAAE,qBAAkBA,IAAA,oBAAE,UAAOA,IAAA,SAAE,sBAAmBA,IAAA;AAKrE,YAAM,sBAAsB,sBAAsB,IAAI,KAAK;AAC3D,sBAAc,YAAY,qBAAqB,QAAQ,UAAU,QAAQ,OAAO,GAAG,QAAQ,SAAS,kBAAkB;AAItH,YAAI,CAAC,qBAAqB;AACxB,cAAM,MAAM,mBAAmB,IAAG;AAClC,cAAIC,QAAO;AAGX,mBAAS,IAAI,GAAG,IAAI,QAAQ,UAAW,QAAQ,CAAC,KAAgB,KAAK,KAAK,GAAG;AAC3E,YAAAA,QAAO;;AAET,UAAAA,SAAQ,QAAQ,OAAO,GAAGA,QAAO,CAAC;;MAEtC;AACF,aAAAF;IAAA,EAzEsC,OAAO;;;;;ACpC7C,IAiEa;AAjEb;;;AAiEO,IAAM,QAAQ,IAAI,WAAkB,SAAC,YAAU;AAAK,aAAA,WAAW,SAAQ;IAAnB,CAAqB;;;;;AC9D1E,SAAU,YAAY,OAAU;AACpC,SAAO,SAAS,WAAW,MAAM,QAAQ;AAC3C;AAJA;;;;;;;ACGA,SAAS,KAAQ,KAAQ;AACvB,SAAO,IAAI,IAAI,SAAS,CAAC;AAC3B;AAMM,SAAU,aAAa,MAAW;AACtC,SAAO,YAAY,KAAK,IAAI,CAAC,IAAI,KAAK,IAAG,IAAK;AAChD;AAEM,SAAU,UAAU,MAAa,cAAoB;AACzD,SAAO,OAAO,KAAK,IAAI,MAAM,WAAW,KAAK,IAAG,IAAM;AACxD;AAjBA;;AACA;;;;;ACFA,IAAa;AAAb;;AAAO,IAAM,cAAe,SAAI,GAAM;AAAwB,aAAA,KAAK,OAAO,EAAE,WAAW,YAAY,OAAO,MAAM;IAAlD;;;;;ACMxD,SAAU,UAAU,OAAU;AAClC,SAAO,WAAW,UAAK,QAAL,UAAK,SAAA,SAAL,MAAO,IAAI;AAC/B;AARA;;;;;;;ACKM,SAAU,oBAAoB,OAAU;AAC5C,SAAO,WAAW,MAAM,UAAiB,CAAC;AAC5C;AANA;;;AACA;;;;;ACAM,SAAU,gBAAmB,KAAQ;AACzC,SAAO,OAAO,iBAAiB,WAAW,QAAG,QAAH,QAAG,SAAA,SAAH,IAAM,OAAO,aAAa,CAAC;AACvE;AAJA;;;;;;;ACIM,SAAU,iCAAiC,OAAU;AAEzD,SAAO,IAAI,UACT,mBACE,UAAU,QAAQ,OAAO,UAAU,WAAW,sBAAsB,MAAI,QAAK,OAAG,0HACwC;AAE9H;AAPA;;;;;;ACJM,SAAU,oBAAiB;AAC/B,MAAI,OAAO,WAAW,cAAc,CAAC,OAAO,UAAU;AACpD,WAAO;;AAGT,SAAO,OAAO;AAChB;AANA,IAQa;AARb;;AAQO,IAAM,WAAW,kBAAiB;;;;;ACJnC,SAAU,WAAW,OAAU;AACnC,SAAO,WAAW,UAAK,QAAL,UAAK,SAAA,SAAL,MAAQ,QAAe,CAAC;AAC5C;AANA;;;AACA;;;;;ACEM,SAAiB,mCAAsC,gBAAqC;;;;;;AAC1F,mBAAS,eAAe,UAAS;;;;;;oBAE1B,QAAA,CAAA,GAAA,CAAA;AACe,iBAAA,CAAA,GAAA,QAAM,OAAO,KAAI,CAAE,CAAA;;AAArC,UAAAG,MAAkB,GAAA,KAAA,GAAhB,QAAKA,IAAA,OAAE,OAAIA,IAAA;eACf,KAAA,QAAA,CAAA,GAAA,CAAA;;;AACF,iBAAA,CAAA,GAAA,GAAA,KAAA,CAAA;;6BAEI,KAAM,CAAA;;AAAZ,iBAAA,CAAA,GAAA,GAAA,KAAA,CAAA;;AAAA,aAAA,KAAA;;;;;AAGF,iBAAO,YAAW;;;;;;;;AAIhB,SAAU,qBAAwB,KAAQ;AAG9C,SAAO,WAAW,QAAG,QAAH,QAAG,SAAA,SAAH,IAAK,SAAS;AAClC;;;;AArBA;;;;;ACcM,SAAU,UAAa,OAAyB;AACpD,MAAI,iBAAiB,YAAY;AAC/B,WAAO;;AAET,MAAI,SAAS,MAAM;AACjB,QAAI,oBAAoB,KAAK,GAAG;AAC9B,aAAO,sBAAsB,KAAK;;AAEpC,QAAI,YAAY,KAAK,GAAG;AACtB,aAAO,cAAc,KAAK;;AAE5B,QAAI,UAAU,KAAK,GAAG;AACpB,aAAO,YAAY,KAAK;;AAE1B,QAAI,gBAAgB,KAAK,GAAG;AAC1B,aAAO,kBAAkB,KAAK;;AAEhC,QAAI,WAAW,KAAK,GAAG;AACrB,aAAO,aAAa,KAAK;;AAE3B,QAAI,qBAAqB,KAAK,GAAG;AAC/B,aAAO,uBAAuB,KAAK;;;AAIvC,QAAM,iCAAiC,KAAK;AAC9C;AAMM,SAAU,sBAAyB,KAAQ;AAC/C,SAAO,IAAI,WAAW,SAAC,YAAyB;AAC9C,QAAM,MAAM,IAAI,UAAiB,EAAC;AAClC,QAAI,WAAW,IAAI,SAAS,GAAG;AAC7B,aAAO,IAAI,UAAU,UAAU;;AAGjC,UAAM,IAAI,UAAU,gEAAgE;EACtF,CAAC;AACH;AASM,SAAU,cAAiB,OAAmB;AAClD,SAAO,IAAI,WAAW,SAAC,YAAyB;AAU9C,aAAS,IAAI,GAAG,IAAI,MAAM,UAAU,CAAC,WAAW,QAAQ,KAAK;AAC3D,iBAAW,KAAK,MAAM,CAAC,CAAC;;AAE1B,eAAW,SAAQ;EACrB,CAAC;AACH;AAEM,SAAU,YAAe,SAAuB;AACpD,SAAO,IAAI,WAAW,SAAC,YAAyB;AAC9C,YACG,KACC,SAAC,OAAK;AACJ,UAAI,CAAC,WAAW,QAAQ;AACtB,mBAAW,KAAK,KAAK;AACrB,mBAAW,SAAQ;;IAEvB,GACA,SAAC,KAAQ;AAAK,aAAA,WAAW,MAAM,GAAG;IAApB,CAAqB,EAEpC,KAAK,MAAM,oBAAoB;EACpC,CAAC;AACH;AAEM,SAAU,aAAgB,UAAqB;AACnD,SAAO,IAAI,WAAW,SAAC,YAAyB;;;AAC9C,eAAoB,aAAA,SAAA,QAAQ,GAAA,eAAA,WAAA,KAAA,GAAA,CAAA,aAAA,MAAA,eAAA,WAAA,KAAA,GAAE;AAAzB,YAAM,QAAK,aAAA;AACd,mBAAW,KAAK,KAAK;AACrB,YAAI,WAAW,QAAQ;AACrB;;;;;;;;;;;;AAGJ,eAAW,SAAQ;EACrB,CAAC;AACH;AAEM,SAAU,kBAAqB,eAA+B;AAClE,SAAO,IAAI,WAAW,SAAC,YAAyB;AAC9C,IAAAC,SAAQ,eAAe,UAAU,EAAE,MAAM,SAAC,KAAG;AAAK,aAAA,WAAW,MAAM,GAAG;IAApB,CAAqB;EACzE,CAAC;AACH;AAEM,SAAU,uBAA0B,gBAAqC;AAC7E,SAAO,kBAAkB,mCAAmC,cAAc,CAAC;AAC7E;AAEA,SAAeA,SAAW,eAAiC,YAAyB;;;;;;;;;AACxD,4BAAA,cAAA,aAAa;;;;;;AAAtB,kBAAK,kBAAA;AACpB,qBAAW,KAAK,KAAK;AAGrB,cAAI,WAAW,QAAQ;AACrB,mBAAA,CAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;AAGJ,qBAAW,SAAQ;;;;;;;;;AAlIrB;AACA;AACA;AAEA;AACA;AACA;AACA;AACA;AAEA;AACA;AACA;;;;;ACMM,SAAU,gBACd,oBACA,WACA,MACA,OACA,QAAc;AADd,MAAA,UAAA,QAAA;AAAA,YAAA;EAAS;AACT,MAAA,WAAA,QAAA;AAAA,aAAA;EAAc;AAEd,MAAM,uBAAuB,UAAU,SAAS,WAAA;AAC9C,SAAI;AACJ,QAAI,QAAQ;AACV,yBAAmB,IAAI,KAAK,SAAS,MAAM,KAAK,CAAC;WAC5C;AACL,WAAK,YAAW;;EAEpB,GAAG,KAAK;AAER,qBAAmB,IAAI,oBAAoB;AAE3C,MAAI,CAAC,QAAQ;AAKX,WAAO;;AAEX;AAzBA;;;;;;ACwCM,SAAU,UAAa,WAA0B,OAAS;AAAT,MAAA,UAAA,QAAA;AAAA,YAAA;EAAS;AAC9D,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,WAAO,UACL,yBACE,YACA,SAAC,OAAK;AAAK,aAAA,gBAAgB,YAAY,WAAW,WAAA;AAAM,eAAA,WAAW,KAAK,KAAK;MAArB,GAAwB,KAAK;IAA1E,GACX,WAAA;AAAM,aAAA,gBAAgB,YAAY,WAAW,WAAA;AAAM,eAAA,WAAW,SAAQ;MAAnB,GAAuB,KAAK;IAAzE,GACN,SAAC,KAAG;AAAK,aAAA,gBAAgB,YAAY,WAAW,WAAA;AAAM,eAAA,WAAW,MAAM,GAAG;MAApB,GAAuB,KAAK;IAAzE,CAA0E,CACpF;EAEL,CAAC;AACH;AAnEA;;;AACA;AACA;;;;;AC0DM,SAAU,YAAe,WAA0B,OAAiB;AAAjB,MAAA,UAAA,QAAA;AAAA,YAAA;EAAiB;AACxE,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,eAAW,IAAI,UAAU,SAAS,WAAA;AAAM,aAAA,OAAO,UAAU,UAAU;IAA3B,GAA8B,KAAK,CAAC;EAC9E,CAAC;AACH;AAjEA;;;;;;;ACIM,SAAU,mBAAsB,OAA6B,WAAwB;AACzF,SAAO,UAAU,KAAK,EAAE,KAAK,YAAY,SAAS,GAAG,UAAU,SAAS,CAAC;AAC3E;AAPA;;;AACA;AACA;;;;;ACGM,SAAU,gBAAmB,OAAuB,WAAwB;AAChF,SAAO,UAAU,KAAK,EAAE,KAAK,YAAY,SAAS,GAAG,UAAU,SAAS,CAAC;AAC3E;AAPA;;;AACA;AACA;;;;;ACCM,SAAU,cAAiB,OAAqB,WAAwB;AAC5E,SAAO,IAAI,WAAc,SAAC,YAAU;AAElC,QAAI,IAAI;AAER,WAAO,UAAU,SAAS,WAAA;AACxB,UAAI,MAAM,MAAM,QAAQ;AAGtB,mBAAW,SAAQ;aACd;AAGL,mBAAW,KAAK,MAAM,GAAG,CAAC;AAI1B,YAAI,CAAC,WAAW,QAAQ;AACtB,eAAK,SAAQ;;;IAGnB,CAAC;EACH,CAAC;AACH;AA1BA;;;;;;;ACWM,SAAU,iBAAoB,OAAoB,WAAwB;AAC9E,SAAO,IAAI,WAAc,SAAC,YAAU;AAClC,QAAIC;AAKJ,oBAAgB,YAAY,WAAW,WAAA;AAErC,MAAAA,YAAY,MAAc,QAAe,EAAC;AAE1C,sBACE,YACA,WACA,WAAA;;AACE,YAAI;AACJ,YAAI;AACJ,YAAI;AAEF,UAACC,MAAkBD,UAAS,KAAI,GAA7B,QAAKC,IAAA,OAAE,OAAIA,IAAA;iBACP,KAAK;AAEZ,qBAAW,MAAM,GAAG;AACpB;;AAGF,YAAI,MAAM;AAKR,qBAAW,SAAQ;eACd;AAEL,qBAAW,KAAK,KAAK;;MAEzB,GACA,GACA,IAAI;IAER,CAAC;AAMD,WAAO,WAAA;AAAM,aAAA,WAAWD,cAAQ,QAARA,cAAQ,SAAA,SAARA,UAAU,MAAM,KAAKA,UAAS,OAAM;IAA/C;EACf,CAAC;AACH;AA3DA;;;AAEA;AACA;AACA;;;;;ACAM,SAAU,sBAAyB,OAAyB,WAAwB;AACxF,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,MAAM,yBAAyB;;AAE3C,SAAO,IAAI,WAAc,SAAC,YAAU;AAClC,oBAAgB,YAAY,WAAW,WAAA;AACrC,UAAME,YAAW,MAAM,OAAO,aAAa,EAAC;AAC5C,sBACE,YACA,WACA,WAAA;AACE,QAAAA,UAAS,KAAI,EAAG,KAAK,SAAC,QAAM;AAC1B,cAAI,OAAO,MAAM;AAGf,uBAAW,SAAQ;iBACd;AACL,uBAAW,KAAK,OAAO,KAAK;;QAEhC,CAAC;MACH,GACA,GACA,IAAI;IAER,CAAC;EACH,CAAC;AACH;AA7BA;;;AACA;;;;;ACGM,SAAU,2BAA8B,OAA8B,WAAwB;AAClG,SAAO,sBAAsB,mCAAmC,KAAK,GAAG,SAAS;AACnF;AALA;;;AACA;;;;;ACwBM,SAAU,UAAa,OAA2B,WAAwB;AAC9E,MAAI,SAAS,MAAM;AACjB,QAAI,oBAAoB,KAAK,GAAG;AAC9B,aAAO,mBAAmB,OAAO,SAAS;;AAE5C,QAAI,YAAY,KAAK,GAAG;AACtB,aAAO,cAAc,OAAO,SAAS;;AAEvC,QAAI,UAAU,KAAK,GAAG;AACpB,aAAO,gBAAgB,OAAO,SAAS;;AAEzC,QAAI,gBAAgB,KAAK,GAAG;AAC1B,aAAO,sBAAsB,OAAO,SAAS;;AAE/C,QAAI,WAAW,KAAK,GAAG;AACrB,aAAO,iBAAiB,OAAO,SAAS;;AAE1C,QAAI,qBAAqB,KAAK,GAAG;AAC/B,aAAO,2BAA2B,OAAO,SAAS;;;AAGtD,QAAM,iCAAiC,KAAK;AAC9C;AAjDA;;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAGA;AACA;AACA;AACA;;;;;ACuFM,SAAU,KAAQ,OAA2B,WAAyB;AAC1E,SAAO,YAAY,UAAU,OAAO,SAAS,IAAI,UAAU,KAAK;AAClE;AArGA;;;AACA;;;;;ACHA,IAwBa;AAxBb;;;AAwBO,IAAM,aAA6B,iBAAiB,SAAC,QAAM;AAAK,aAAA,SAAS,iBAAc;AAC5F,eAAO,IAAI;AACX,aAAK,OAAO;AACZ,aAAK,UAAU;MACjB;IAJuE,CAItE;;;;;AC2BK,SAAU,eAAqB,QAAuBC,SAAgC;AAC1F,MAAM,YAAY,OAAOA,YAAW;AACpC,SAAO,IAAI,QAAe,SAAC,SAAS,QAAM;AACxC,QAAM,aAAa,IAAI,eAAkB;MACvC,MAAM,SAAC,OAAK;AACV,gBAAQ,KAAK;AACb,mBAAW,YAAW;MACxB;MACA,OAAO;MACP,UAAU,WAAA;AACR,YAAI,WAAW;AACb,kBAAQA,QAAQ,YAAY;eACvB;AACL,iBAAO,IAAI,WAAU,CAAE;;MAE3B;KACD;AACD,WAAO,UAAU,UAAU;EAC7B,CAAC;AACH;AAzEA;;;AACA;;;;;AC6CM,SAAU,IAAU,SAAyC,SAAa;AAC9E,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAEhC,QAAI,QAAQ;AAGZ,WAAO,UACL,yBAAyB,YAAY,SAAC,OAAQ;AAG5C,iBAAW,KAAK,QAAQ,KAAK,SAAS,OAAO,OAAO,CAAC;IACvD,CAAC,CAAC;EAEN,CAAC;AACH;AA5DA;;;AACA;;;;;ACkBM,SAAU,eACd,QACA,YACA,SACA,YACA,cACA,QACA,mBACA,qBAAgC;AAGhC,MAAMC,UAAc,CAAA;AAEpB,MAAI,SAAS;AAEb,MAAI,QAAQ;AAEZ,MAAI,aAAa;AAKjB,MAAM,gBAAgB,WAAA;AAIpB,QAAI,cAAc,CAACA,QAAO,UAAU,CAAC,QAAQ;AAC3C,iBAAW,SAAQ;;EAEvB;AAGA,MAAM,YAAY,SAAC,OAAQ;AAAK,WAAC,SAAS,aAAa,WAAW,KAAK,IAAIA,QAAO,KAAK,KAAK;EAA5D;AAEhC,MAAM,aAAa,SAAC,OAAQ;AAI1B,cAAU,WAAW,KAAK,KAAY;AAItC;AAKA,QAAI,gBAAgB;AAGpB,cAAU,QAAQ,OAAO,OAAO,CAAC,EAAE,UACjC,yBACE,YACA,SAAC,YAAU;AAGT,uBAAY,QAAZ,iBAAY,SAAA,SAAZ,aAAe,UAAU;AAEzB,UAAI,QAAQ;AAGV,kBAAU,UAAiB;aACtB;AAEL,mBAAW,KAAK,UAAU;;IAE9B,GACA,WAAA;AAGE,sBAAgB;IAClB,GAEA,QACA,WAAA;AAIE,UAAI,eAAe;AAKjB,YAAI;AAIF;;AAME,gBAAM,gBAAgBA,QAAO,MAAK;AAIlC,gBAAI,mBAAmB;AACrB,8BAAgB,YAAY,mBAAmB,WAAA;AAAM,uBAAA,WAAW,aAAa;cAAxB,CAAyB;mBACzE;AACL,yBAAW,aAAa;;;AAR5B,iBAAOA,QAAO,UAAU,SAAS,YAAU;;;AAY3C,wBAAa;iBACN,KAAK;AACZ,qBAAW,MAAM,GAAG;;;IAG1B,CAAC,CACF;EAEL;AAGA,SAAO,UACL,yBAAyB,YAAY,WAAW,WAAA;AAE9C,iBAAa;AACb,kBAAa;EACf,CAAC,CAAC;AAKJ,SAAO,WAAA;AACL,4BAAmB,QAAnB,wBAAmB,SAAA,SAAnB,oBAAmB;EACrB;AACF;AAnJA;;;AAGA;AACA;;;;;AC6EM,SAAU,SACd,SACA,gBACA,YAA6B;AAA7B,MAAA,eAAA,QAAA;AAAA,iBAAA;EAA6B;AAE7B,MAAI,WAAW,cAAc,GAAG;AAE9B,WAAO,SAAS,SAAC,GAAG,GAAC;AAAK,aAAA,IAAI,SAAC,GAAQ,IAAU;AAAK,eAAA,eAAe,GAAG,GAAG,GAAG,EAAE;MAA1B,CAA2B,EAAE,UAAU,QAAQ,GAAG,CAAC,CAAC,CAAC;IAAjF,GAAoF,UAAU;aAC/G,OAAO,mBAAmB,UAAU;AAC7C,iBAAa;;AAGf,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAAK,WAAA,eAAe,QAAQ,YAAY,SAAS,UAAU;EAAtD,CAAuD;AAChG;AA9FA;;;AACA;AACA;AACA;AACA;;;;;AC0DM,SAAU,SAAyC,YAA6B;AAA7B,MAAA,eAAA,QAAA;AAAA,iBAAA;EAA6B;AACpF,SAAO,SAAS,UAAU,UAAU;AACtC;AAjEA;;;AACA;;;;;ACmDM,SAAU,MAAsC,mBAA0B;AAC9E,SAAO,IAAI,WAA+B,SAAC,YAAU;AACnD,cAAU,kBAAiB,CAAE,EAAE,UAAU,UAAU;EACrD,CAAC;AACH;AAxDA;;;AAEA;;;;;ACuFM,SAAU,QAAK;AAAC,MAAA,OAAA,CAAA;WAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAA8D;AAA9D,SAAA,EAAA,IAAA,UAAA,EAAA;;AACpB,MAAM,YAAY,aAAa,IAAI;AACnC,MAAM,aAAa,UAAU,MAAM,QAAQ;AAC3C,MAAM,UAAU;AAChB,SAAO,CAAC,QAAQ,SAEZ,QACA,QAAQ,WAAW,IAEnB,UAAU,QAAQ,CAAC,CAAC,IAEpB,SAAS,UAAU,EAAE,KAAK,SAAS,SAAS,CAAC;AACnD;AAnGA;;;AACA;AACA;AACA;AACA;;;;;ACsDM,SAAU,OAAU,WAAiD,SAAa;AACtF,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAEhC,QAAI,QAAQ;AAIZ,WAAO,UAIL,yBAAyB,YAAY,SAAC,OAAK;AAAK,aAAA,UAAU,KAAK,SAAS,OAAO,OAAO,KAAK,WAAW,KAAK,KAAK;IAAhE,CAAiE,CAAC;EAEtH,CAAC;AACH;AAzEA;;;AACA;;;;;ACFA;AAAA;AAAA;AAAA;;;ACuCM,SAAU,eAAqB,cAAe;AAClD,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,QAAI,WAAW;AACf,WAAO,UACL,yBACE,YACA,SAAC,OAAK;AACJ,iBAAW;AACX,iBAAW,KAAK,KAAK;IACvB,GACA,WAAA;AACE,UAAI,CAAC,UAAU;AACb,mBAAW,KAAK,YAAa;;AAE/B,iBAAW,SAAQ;IACrB,CAAC,CACF;EAEL,CAAC;AACH;AAzDA;;;AACA;;;;;AC6CM,SAAU,KAAQ,OAAa;AACnC,SAAO,SAAS,IAEZ,WAAA;AAAM,WAAA;EAAA,IACN,QAAQ,SAAC,QAAQ,YAAU;AACzB,QAAI,OAAO;AACX,WAAO,UACL,yBAAyB,YAAY,SAAC,OAAK;AAIzC,UAAI,EAAE,QAAQ,OAAO;AACnB,mBAAW,KAAK,KAAK;AAIrB,YAAI,SAAS,MAAM;AACjB,qBAAW,SAAQ;;;IAGzB,CAAC,CAAC;EAEN,CAAC;AACP;AArEA;;;AACA;AACA;;;;;ACqCM,SAAU,iBAAc;AAC5B,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,WAAO,UAAU,yBAAyB,YAAY,IAAI,CAAC;EAC7D,CAAC;AACH;AA3CA;;;AACA;AACA;;;;;ACsCM,SAAU,aAAgB,cAA6C;AAA7C,MAAA,iBAAA,QAAA;AAAA,mBAAA;EAA6C;AAC3E,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,QAAI,WAAW;AACf,WAAO,UACL,yBACE,YACA,SAAC,OAAK;AACJ,iBAAW;AACX,iBAAW,KAAK,KAAK;IACvB,GACA,WAAA;AAAM,aAAC,WAAW,WAAW,SAAQ,IAAK,WAAW,MAAM,aAAY,CAAE;IAAnE,CAAqE,CAC5E;EAEL,CAAC;AACH;AAEA,SAAS,sBAAmB;AAC1B,SAAO,IAAI,WAAU;AACvB;AA3DA;;;AAEA;AACA;;;;;AC6EM,SAAU,MACd,WACA,cAAgB;AAEhB,MAAM,kBAAkB,UAAU,UAAU;AAC5C,SAAO,SAAC,QAAqB;AAC3B,WAAA,OAAO,KACL,YAAY,OAAO,SAAC,GAAG,GAAC;AAAK,aAAA,UAAU,GAAG,GAAG,MAAM;IAAtB,CAAuB,IAAI,UACxD,KAAK,CAAC,GACN,kBAAkB,eAAe,YAAa,IAAI,aAAa,WAAA;AAAM,aAAA,IAAI,WAAU;IAAd,CAAgB,CAAC;EAHxF;AAKJ;AA1FA;;;AAEA;AACA;AACA;AACA;AACA;;;;;ACsIM,SAAU,MAAS,SAA4B;AAA5B,MAAA,YAAA,QAAA;AAAA,cAAA,CAAA;EAA4B;AAC3C,MAAAC,MAAgH,QAAO,WAAvH,YAASA,QAAA,SAAG,WAAA;AAAM,WAAA,IAAI,QAAO;EAAX,IAAgBA,KAAE,KAA4E,QAAO,cAAnF,eAAY,OAAA,SAAG,OAAI,IAAE,KAAuD,QAAO,iBAA9D,kBAAe,OAAA,SAAG,OAAI,IAAE,KAA+B,QAAO,qBAAtC,sBAAmB,OAAA,SAAG,OAAI;AAUnH,SAAO,SAAC,eAAa;AACnB,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI,WAAW;AACf,QAAI,eAAe;AACnB,QAAI,aAAa;AAEjB,QAAM,cAAc,WAAA;AAClB,0BAAe,QAAf,oBAAe,SAAA,SAAf,gBAAiB,YAAW;AAC5B,wBAAkB;IACpB;AAGA,QAAM,QAAQ,WAAA;AACZ,kBAAW;AACX,mBAAa,UAAU;AACvB,qBAAe,aAAa;IAC9B;AACA,QAAM,sBAAsB,WAAA;AAG1B,UAAM,OAAO;AACb,YAAK;AACL,eAAI,QAAJ,SAAI,SAAA,SAAJ,KAAM,YAAW;IACnB;AAEA,WAAO,QAAc,SAAC,QAAQ,YAAU;AACtC;AACA,UAAI,CAAC,cAAc,CAAC,cAAc;AAChC,oBAAW;;AAOb,UAAM,OAAQ,UAAU,YAAO,QAAP,YAAO,SAAP,UAAW,UAAS;AAO5C,iBAAW,IAAI,WAAA;AACb;AAKA,YAAI,aAAa,KAAK,CAAC,cAAc,CAAC,cAAc;AAClD,4BAAkB,YAAY,qBAAqB,mBAAmB;;MAE1E,CAAC;AAID,WAAK,UAAU,UAAU;AAEzB,UACE,CAAC,cAID,WAAW,GACX;AAMA,qBAAa,IAAI,eAAe;UAC9B,MAAM,SAAC,OAAK;AAAK,mBAAA,KAAK,KAAK,KAAK;UAAf;UACjB,OAAO,SAAC,KAAG;AACT,yBAAa;AACb,wBAAW;AACX,8BAAkB,YAAY,OAAO,cAAc,GAAG;AACtD,iBAAK,MAAM,GAAG;UAChB;UACA,UAAU,WAAA;AACR,2BAAe;AACf,wBAAW;AACX,8BAAkB,YAAY,OAAO,eAAe;AACpD,iBAAK,SAAQ;UACf;SACD;AACD,kBAAU,MAAM,EAAE,UAAU,UAAU;;IAE1C,CAAC,EAAE,aAAa;EAClB;AACF;AAEA,SAAS,YACP,OACA,IAAoD;AACpD,MAAA,OAAA,CAAA;WAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAAU;AAAV,SAAA,KAAA,CAAA,IAAA,UAAA,EAAA;;AAEA,MAAI,OAAO,MAAM;AACf,UAAK;AACL;;AAGF,MAAI,OAAO,OAAO;AAChB;;AAGF,MAAM,eAAe,IAAI,eAAe;IACtC,MAAM,WAAA;AACJ,mBAAa,YAAW;AACxB,YAAK;IACP;GACD;AAED,SAAO,UAAU,GAAE,MAAA,QAAA,cAAA,CAAA,GAAA,OAAI,IAAI,CAAA,CAAA,CAAA,EAAG,UAAU,YAAY;AACtD;;;;AA1QA;AACA;AACA;AAGA;;;;;ACwCM,SAAU,UAAa,UAA8B;AACzD,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,cAAU,QAAQ,EAAE,UAAU,yBAAyB,YAAY,WAAA;AAAM,aAAA,WAAW,SAAQ;IAAnB,GAAuB,IAAI,CAAC;AACrG,KAAC,WAAW,UAAU,OAAO,UAAU,UAAU;EACnD,CAAC;AACH;AAjDA;;;AACA;AACA;AACA;;;;;ACkKM,SAAU,IACd,gBACA,OACA,UAA8B;AAK9B,MAAM,cACJ,WAAW,cAAc,KAAK,SAAS,WAElC,EAAE,MAAM,gBAA2E,OAAO,SAAQ,IACnG;AAEN,SAAO,cACH,QAAQ,SAAC,QAAQ,YAAU;;AACzB,KAAAC,MAAA,YAAY,eAAS,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAArB,WAAW;AACX,QAAI,UAAU;AACd,WAAO,UACL,yBACE,YACA,SAAC,OAAK;;AACJ,OAAAA,MAAA,YAAY,UAAI,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAAhB,aAAmB,KAAK;AACxB,iBAAW,KAAK,KAAK;IACvB,GACA,WAAA;;AACE,gBAAU;AACV,OAAAA,MAAA,YAAY,cAAQ,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAApB,WAAW;AACX,iBAAW,SAAQ;IACrB,GACA,SAAC,KAAG;;AACF,gBAAU;AACV,OAAAA,MAAA,YAAY,WAAK,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAAjB,aAAoB,GAAG;AACvB,iBAAW,MAAM,GAAG;IACtB,GACA,WAAA;;AACE,UAAI,SAAS;AACX,SAAAA,MAAA,YAAY,iBAAW,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAAvB,WAAW;;AAEb,OAAA,KAAA,YAAY,cAAQ,QAAA,OAAA,SAAA,SAAA,GAAA,KAApB,WAAW;IACb,CAAC,CACF;EAEL,CAAC,IAID;AACN;AArNA;;;AACA;AACA;AACA;;;;;ACWA;;;AAUA;AA0BA;AAiBA;AAGA;AAMA;AAmBA;AA8FA;;;;;AChLA,SAAS,qBACPC,SACA,cAAsC;AAEtC,QAAM,SAAmB,CAAA;AAEzB,WAAS,IAAI,GAAG,OAAO,aAAa,CAAC,GAAG,IAAIA,QAAO,QAAQ,KAAK,MAAM,OAAO,aAAa,CAAC,GAAG;AAG5F,WAAO,KAAKA,QAAO,MAAM,GAAG,IAAI,IAAI,CAAC;EACvC;AAEA,SAAO;AACT;gBAzBM,OAqCO;;;AAvCb;AACA,IAAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA,IAAM,QAAQ;AAqCP,IAAM,WAAW,CACtB,OACA,MACA,SACA,EAAE,SAAAC,SAAO,IAAiC,CAAA,MACpB;AAItB,YAAM,SAAS,qBAAqB,MAAM,OAAK,WAAW,MAAM,IAAI,IAAI,EAAE,EAAE,IAAI,CAACF,SAAQ,MAAK;AAC5F,cAAM,OAAO,OAAO,MAAM,MAAM,IAAI,IAAI,CAAC;AACzC,aAAK,WAAW,OAAO,CAAC;AAExB,aAAK,cAAc,GAAG,CAAC;AAGvB,YAAI,MAAM,GAAG;AACX,eAAK,cAAc,KAAK,QAAQ,CAAC;QACnC;AAGA,eAAO,OAAO,OAAO,CAAC,MAAMA,OAAM,CAAC;MACrC,CAAC;AAED,aAAO,IAAI,WAAW,OAAI;AACxB,YAAI,aAAa;AAEjB,iBAAe,OAAI;;AACjB,uBAAW,SAAS,QAAQ;AAC1B,kBAAI;AAAY;AAChB,oBAAM,MAAM,KAAK;YACnB;UACF,CAAC;;AAED,aAAI,EAAG,KACL,MAAK;AACH,uBAAa;AACb,YAAE,SAAQ;QACZ,GACA,WAAQ;AACN,uBAAa;AACb,gBAAM;YACJ,MAAM;YACN,SAAS,qBAAqB,KAAK;YACnC,MAAM,EAAE,MAAK;YACb,SAAAE;WACD;AACD,YAAE,MAAM,KAAK;QACf,CAAC;AAGH,cAAM,cAAc,MAAK;AACvB,cAAI,CAAC,YAAY;AACf,kBAAM;cACJ,MAAM;cACN,SAAS;cACT,SAAAA;aACD;AACD,yBAAa;UACf;QACF;AAEA,eAAO;MACT,CAAC;IACH;;;;;ACvGA,IAGMC,QAUO;AAbb;;;AACA;AACA,IAAAC;AACA,IAAMD,SAAQ;AAUP,IAAM,cAAc,CACzB,WACA,EAAE,SAAAE,SAAO,IAAiC,CAAA,MAE1C,IAAI,WAAW,OAAI;AACjB,UAAI,gBAAgB;AACpB,UAAI,qBAAqB;AACzB,UAAI,eAAe,OAAO,MAAM,CAAC;AACjC,YAAM,sBAAsB,IAAI,cAAa;AAG7C,gBAAU,KAAK,UAAU,mBAAmB,CAAC,EAAE,UAAU;QACvD,UAAU,MAAK;AACb,YAAE,MAAM,IAAI,mBAAkB,CAAE;QAClC;QACA,OAAO,WAAQ;AACb,gBAAM;YACJ,MAAM;YACN,SAAS,yBAAyB,KAAK;YACvC,MAAM,EAAE,MAAK;YACb,SAAAA;WACD;AACD,YAAE,MAAM,KAAK;QACf;QACA,MAAM,WAAQ;AAEZ,cAAI,iBAAiB,OAAO;AAC1B,kBAAM;cACJ,MAAM;cACN,SAAS,sCAAsC,KAAK;cACpD,MAAM,EAAE,OAAO,MAAK;cACpB,SAAAA;aACD;AAED;UACF;AAEA,gBAAM,MAAM,MAAM,UAAU,CAAC;AAC7B,gBAAM,aAAa,MAAM,aAAa,CAAC;AAEvC,cAAI,YAAY,MAAM,MAAM,CAAC;AAE7B,cAAI,QAAQF,QAAO;AACjB,cAAE,MAAM,IAAI,eAAe,iBAAiB,IAAI,SAAS,EAAE,GAAG,YAAY,CAAC;AAC3E;UACF;AAGA,cAAI,kBAAkB,YAAY;AAChC,cAAE,MACA,IAAI,eACF,8DAA8D,UAAU,iBAAiB,aAAa,IACtG,iBAAiB,CAClB;AAEH;UACF;AAGA,cAAI,eAAe,GAAG;AACpB,iCAAqB,UAAU,aAAa,CAAC;AAE7C,wBAAY,UAAU,MAAM,CAAC;UAC/B;AAEA;AAGA,yBAAe,OAAO,OAAO,CAAC,cAAc,SAAS,CAAC;AAEtD,cAAI,aAAa,SAAS,oBAAoB;AAC5C,cAAE,MACA,IAAI,eACF,6DAA6D,aAAa,MAAM,iBAAiB,kBAAkB,IACnH,gBAAgB,CACjB;AAEH;UACF;AAEA,cAAI,aAAa,WAAW,oBAAoB;AAC9C,cAAE,KAAK,YAAY;AACnB,cAAE,SAAQ;AAEV,gCAAoB,KAAI;UAC1B;QACF;OACD;AAED,aAAO,MAAK;AACV,4BAAoB,KAAI;MAC1B;IACF,CAAC;;;;;ACxGH;;AAuCA;AAEA;AAGA;AAkCA;AAiBA;;;;;AChGA,IAIa;AAJb;;;AAEA,IAAAG;AAEO,IAAM,wBAAwB,CAAC,mBACpC,WAAW,OAAO,OAAI;AACpB,UAAI,eAAe,mBAAmB,eAAe,IAAI;AAEzD,eAAS,6BAA6B,OAAK;AACzC,cAAMC,kBAAiB,MAAM;AAE7B,YAAIA,gBAAe,OAAO;AACxB,YAAE,KAAK,OAAO,KAAKA,gBAAe,MAAM,MAAM,CAAC;QACjD;MACF;AAEA,qBAAe,mBAAkB,EAAG,KAAK,MAAK;AAC5C,uBAAe,iBAAiB,8BAA8B,4BAA4B;MAC5F,CAAC;AACD,aAAO,MAAK;AACV,YAAI,eAAe,iBAAiB,eAAe,IAAI;AACvD,uBAAe,kBAAiB;MAClC;IACF,CAAC;;;;;ACuCH,SAAe,KAAK,YAA6B,gBAAuB;;AACtE,QAAI;AAEJ,QAAI,OAAO,eAAe,UAAU;AAClC,UAAI,gBAAgB,UAAU,GAAG;AAC/B,YAAI,eAAe,iCAAiC;AACpD,eAAO,gBAAgB,UAAU;MACnC;AAEA,YAAM,YAAY,kBAAiB;AAEnC,eAAS,MAAM,UAAU,cAAc,mBAAkB,CAAE;IAC7D,OAAO;AACL,eAAS;IACX;AAEA,QAAI,CAAC,OAAO,KAAK,WAAW;AAC1B,UAAI,eAAe,8BAA8B;AACjD,YAAM,OAAO,KAAK,QAAO;IAC3B;AAEA,UAAM,CAAC,SAAS,KAAK,IAAI,MAAM,gBAAgB,MAAM;AACrD,UAAM,EAAE,aAAa,WAAW,WAAU,IAAK;AAC/C,UAAM,CAAC,QAAQ,OAAO,IAAI,MAAM,QAAQ,IAAI;MAC1C,QAAQ,kBAAkB,SAAS;MACnC,QAAQ,kBAAkB,UAAU;KACrC;AACD,UAAM,mBAAmB,sBAAsB,OAAO,EAAE,KACtD,IAAI,WAAQ;AACV,UAAI,aAAa,QAAQ,MAAM,SAAS,KAAK,CAAC;IAChD,CAAC,GACD,MAAK,CAAE;AAET,UAAM,QAAQ,iBAAiB,UAAS;AACxC,UAAM,YAAY,IAAI,mBAAmB,QAAQ,QAAQ,kBAAkB,WAAW;AAEtF,QAAI,CAAC,OAAO,KAAK,WAAW;AAC1B,YAAM,IAAI,mBAAkB;IAC9B;AAGA,oBAAgB,UAAU,EAAE,IAAI;AAEhC,UAAM,eAAe,OAAI;AACvB,cAAQ,IAAI,iBAAiB,CAAC;AAC9B,aAAO,gBAAgB,UAAU,EAAE;AACnC,gBAAU,qBAAqB;AAC/B,YAAM,YAAW;AACjB,aAAO,oBAAoB,0BAA0B,YAAY;AACjE,UAAI,eAAe,gBAAgB,UAAU,EAAE,gBAAgB;AAC/D,gBAAU,KAAK,cAAc,CAAC;IAChC;AAEA,WAAO,iBAAiB,0BAA0B,YAAY;AAC9D,UAAM,gBAAgB,KAAK,IAAG;AAE9B,QAAI;AACF,YAAM,UAAU,SAAQ;IAC1B;AACE,YAAM,eAAe,KAAK,IAAG;AAK7B,UAAI,eAAe,gBAAgB,KAAM;AACvC,yBAAiB;MACnB;AAEA,UAAI,gBAAgB;AAClB,cAAM,OAAO,KAAK,WAAU;AAE5B,cAAM,IAAI,QAAQ,OAAK,WAAW,GAAG,GAAI,CAAC;MAC5C;IACF;AAEA,QAAI,gBAAgB;AAClB,aAAO,KAAK,QAAQ,KAAK;IAC3B;AAEA,WAAO;EACT,CAAC;;oBAjIK,mBAWA,cAqBA,iBAEA,oBAMA,iBAgGe;;;AApJrB;AACA;AACA,IAAAC;AAEA;AACA;AACA,IAAAA;AACA;AACA;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,IAAM,oBAAoB,MAAK;AAE7B,YAAM,EAAE,UAAS,IAAK;AAEtB,UAAI,OAAO,cAAc,aAAa;AACpC,cAAM,IAAI,MAAM,6BAA6B;MAC/C;AAEA,aAAO;IACT;AAEA,IAAM,eAAe,MACnB,WAAW,OAAO,cAAW;AAC3B,YAAM,YAAY,kBAAiB;AAEnC,YAAM,wBAAwB,OAAI;AAChC,iBAAS,KAAK,EAAE,KAAK;MACvB;AAEA,gBAAU,iBAAiB,uBAAuB,qBAAqB;AACvE,UAAI,eAAe;AACnB,gBAAU,gBAAe,EAAG,KAAK,eAAY;AAC3C,YAAI,CAAC,cAAc;AACjB,mBAAS,KAAK,SAAS;QACzB;MACF,CAAC;AACD,aAAO,MAAK;AACV,uBAAe;AACf,kBAAU,oBAAoB,uBAAuB,qBAAqB;MAC5E;IACF,CAAC;AAEH,IAAM,kBAAkB,CAAA;AAExB,IAAM,qBAAqB,OAAO;MAChC,SAAS,yBAAwB,EAAG,IAAI,WAAS;QAC/C,UAAU,CAAC,IAAI;QACf;;AAGJ,IAAM,kBAAkB,CAAM,WAASC,WAAA,QAAA,QAAA,QAAA,aAAA;AACrC,UAAI,CAAC,OAAO;AAAM,cAAM,IAAI,MAAM,0BAA0B;AAC5D,YAAM,CAAC,OAAO,IAAI,MAAM,OAAO,KAAK,mBAAkB;AACtD,UAAI,CAAC;AAAS,cAAM,IAAI,MAAM,6BAA6B;AAC3D,YAAM,QAAQ,uBAAuB,QAAQ,IAAI;AACjD,UAAI,CAAC;AAAO,cAAM,IAAI,MAAM,mCAAmC;AAC/D,aAAO,CAAC,SAAS,KAAK;IACxB,CAAC;AAyFD,IAAqB,qBAArB,cAAgD,kBAAS;;;;;MAqBvD,OAAO,OAAO,UAAa;AACzB,YAAI,eAAe,WAAW;AAC9B,YAAI;AACJ,cAAM,YAAY,kBAAiB;AACnC,kBAAU,cAAc,mBAAkB,CAAE,EAAE,KAC5C,YAAS;AACP,cAAI,CAAC,cAAc;AACjB,qBAAS,KAAK;cACZ,MAAM;cACN,YAAY;aACb;AACD,qBAAS,SAAQ;UACnB;QACF,GACA,WAAQ;AACN,mBAAS,MAAM,IAAI,2BAA2B,MAAM,OAAO,CAAC;QAC9D,CAAC;AAGH,iBAAS,cAAW;AAClB,yBAAe;QACjB;AAEA,eAAO;UACL;;MAEJ;;;;MAKA,OAAa,KAAK,YAA2B;;AAC3C,iBAAO,KAAK,YAAY,IAAI;QAC9B,CAAC;;MAqBD,YACE,QACA,qBACA,kBACA,aAAwB;AAExB,cAAK;AAZP,aAAA,UAAU;AAGV,aAAA,qBAAqB;AAiFrB,aAAA,QAAQ,CAAOC,YAAkBD,WAAA,MAAA,QAAA,QAAA,aAAA;AAC/B,cAAI,aAAa,QAAQC,QAAO,SAAS,KAAK,CAAC;AAC/C,gBAAM,KAAK,oBAAoB,WAAWA,OAAM;QAClD,CAAC;AA1EC,aAAK,KAAK,OAAO;AACjB,aAAK,SAAS;AACd,aAAK,sBAAsB;AAC3B,aAAK,mBAAmB;AACxB,aAAK,cAAc;AACnB,YAAI,eAAe,gBAAgB,OAAO,KAAK,EAAE,CAAC,gBAAgB;MACpE;MAEM,WAAQ;;AACZ,cAAI,MAAM;AACV,gBAAM,KAAK,mBAAmB,MAAWD,WAAA,MAAA,QAAA,QAAA,aAAA;AACvC,gBAAI;AACF,qBACG,MAAM,eACL,MACE,KAAK,iBAAiB,KACpB,MAAM,CAAAC,YAAUA,QAAO,UAAU,CAAC,MAAM,CAAI,GAC5C,IAAI,CAAAA,YAAUA,QAAO,UAAU,CAAC,CAAC,CAAC,GAEpC,MAAM,MAAM,KAAK,KAAK,MAAM,OAAO,KAAK,CAAC,GAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,eAAc,CAAE,CAAC,CACtF,KACE;YACT,SAAS,GAAG;AACV,kBAAI,aAAa,kBAAkB,OAAO,CAAC,CAAC;AAC5C,mBAAK,OAAO,KAAK,WAAU;AAC3B,oBAAM;YACR;UACF,CAAC,CAAA;AAED,cAAI,MAAM,IAAI;AACZ,kBAAM,UAAU,MAAM;AACtB,gBAAI,eAAe,gBAAgB,OAAO,KAAK,EAAE,CAAC,gBAAgB,OAAO,OAAO,CAAC,EAAE;AACnF,iBAAK,UAAU;UACjB;AAEA,iBAAO,KAAK;QACd,CAAC;;;;;;;MAOK,SAAS,MAAY;;AACzB,gBAAM,IAAI,MAAM,KAAK,mBAAmB,MAAWD,WAAA,MAAA,QAAA,QAAA,aAAA;AACjD,gBAAI;AACF,oBAAM,QAAQ,KAAK,SAAS,KAAK;AACjC,kBAAI,QAAQ,MAAM,KAAK,EAAE;AACzB,oBAAM,OAAO,MAAM,eACjB,MAAM,KAAK,iBAAiB,KAAK,WAAW,GAAG,SAAS,KAAK,OAAO,MAAM,KAAK,OAAO,CAAC,CAAC;AAE1F,oBAAM,SAAS,KAAK,SAAS,KAAK;AAClC,kBAAI,QAAQ,MAAM,MAAM,EAAE;AAC1B,qBAAO;YACT,SAAS,GAAG;AACV,kBAAI,aAAa,kBAAkB,OAAO,CAAC,CAAC;AAE5C,kBAAI,KAAK,oBAAoB;AAE3B,qBAAK,OAAO,KAAK,WAAU;cAC7B;AAEA,oBAAM;YACR;UACF,CAAC,CAAA;AAED,iBAAO;QACT,CAAC;;MAED,iBAAc;MAAI;MAOZ,QAAK;;AACT,cAAI,KAAK,qBAAqB;AAC5B,kBAAM,KAAK;UACb;QACF,CAAC;;;;AAjKM,uBAAA,cAAc,MACnB,QAAQ,QAAO,EACZ,KAAK,iBAAiB,EACtB,KACC,MAAM,MACN,MAAM,KAAK;AAQV,uBAAA,sBAAsB,CAAC,aAAgC,aAAY,EAAG,UAAU,QAAQ;AACxF,uBAAA,OAAO,MAAW,QAAQ,QAAQ,CAAA,CAAE;AA4CpC,uBAAA,aAAa,CAAOE,QAAWF,WAAA,QAAA,QAAA,QAAA,aAAA;AACpC,UAAI,eAAe,mBAAmBE,GAAE,GAAG;AAC3C,YAAM,YAAY,gBAAgBA,GAAE;AAEpC,UAAI,WAAW;AACb,kBAAU,OAAO,KAAK,WAAU;MAClC;IACF,CAAC;8BAlEkB;;;;;ACtIrB,SAAS,WAAW,OAAK;AACvB,QAAM,IAAI,OAAO,MAAM,CAAC;AACxB,IAAE,cAAc,OAAO,CAAC;AACxB,SAAO;AACT;AAnBA,IAaM,KAQA,YAYA,kBAkGN;AAnIA;;;AAaA,IAAM,MAAM;AAQZ,IAAM,aAAa;MACjB,MAAM,OAAO,MAAM,CAAC;MACpB,YAAY;MACZ,UAAU;;AASZ,IAAM,mBAAmB,CAAC,SAAiB,eAAsB;AAC/D,aAAO;;;;;;;QAOL,WAAW,MAAY;AAKrB,cAAI,OAAO,OAAO,OAAO,CAAC,WAAW,KAAK,MAAM,GAAG,IAAI,CAAC;AAExD,gBAAM,YAAY,aAAa;AAC/B,gBAAM,WAAW,KAAK,KAAK,KAAK,SAAS,SAAS;AAGlD,iBAAO,OAAO,OAAO,CAAC,MAAM,OAAO,MAAM,WAAW,YAAY,KAAK,SAAS,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AAEzF,gBAAM,SAAmB,CAAA;AAEzB,mBAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,kBAAM,OAAO,OAAO,MAAM,CAAC;AAC3B,iBAAK,cAAc,SAAS,CAAC;AAC7B,iBAAK,WAAW,KAAK,CAAC;AACtB,iBAAK,cAAc,GAAG,CAAC;AAGvB,kBAAM,QAAQ,KAAK,MAAM,IAAI,YAAY,IAAI,KAAK,SAAS;AAE3D,mBAAO,KAAK,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;UAC1C;AAEA,iBAAO;QACT;;;;;;;;;QAUA,eAAe,KAAkB,OAAa;AAC5C,cAAI,EAAE,MAAM,YAAY,SAAQ,IAAK,OAAO;AAE5C,cAAI,MAAM,aAAa,CAAC,MAAM,SAAS;AACrC,kBAAM,IAAI,eAAe,mBAAmB,gBAAgB;UAC9D;AAEA,cAAI,MAAM,UAAU,CAAC,MAAM,KAAK;AAC9B,kBAAM,IAAI,eAAe,eAAe,YAAY;UACtD;AAEA,cAAI,MAAM,aAAa,CAAC,MAAM,UAAU;AACtC,kBAAM,IAAI,eAAe,oBAAoB,iBAAiB;UAChE;AAGA,cAAI,CAAC,KAAK;AACR,yBAAa,MAAM,aAAa,CAAC;UACnC;AAEA;AAEA,gBAAM,YAAY,MAAM,MAAM,MAAM,IAAI,CAAC;AACzC,iBAAO,OAAO,OAAO,CAAC,MAAM,SAAS,CAAC;AAGtC,cAAI,KAAK,SAAS,YAAY;AAC5B,mBAAO,KAAK,MAAM,GAAG,UAAU;UACjC;AAEA,iBAAO;YACL;YACA;YACA;;QAEJ;;;;;;;;QASA,iBAAiB,KAAgB;AAC/B,cAAI,OAAO,IAAI,eAAe,IAAI,KAAK,QAAQ;AAC7C,mBAAO,IAAI;UACb;QACF;;IAEJ;AAEA,IAAA,sBAAe;;;;;AC3HT,SAAgB,sBAAmB;;AACvC,UAAM,SAAS,MAAM,UAAU,IAAI,cAAc;MAC/C,SAAS;KACV;AACD,WAAO;EACT,CAAC;;AAEK,SAAgB,mBAAgB;;AACpC,UAAMC,WAAU,MAAM,UAAU,IAAI,WAAU;AAC9C,WAAOA,SAAQ,OAAO,OAAK,EAAE,aAAa,iBAAiB;EAC7D,CAAC;;AAEK,SAAgB,uBAAoB;;AACxC,UAAM,kBAAkB,MAAM,iBAAgB;AAC9C,QAAI,gBAAgB,SAAS;AAAG,aAAO,gBAAgB,CAAC;AACxD,WAAO,oBAAmB;EAC5B,CAAC;;gBAtBK,eAwBO;;;AA1Bb,IAAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,IAAM,gBAAgB;MACpB;QACE,UAAU;;;AAsBP,IAAM,cAAc,MACzB,QAAQ,QAAQ,CAAC,CAAC,aAAa,CAAC,CAAC,UAAU,OAAO,OAAO,UAAU,IAAI,eAAe,UAAU;;;;;AC2LlG,SAAe,sBAAsB,QAAiB;;AACpD,QAAI;AACF,YAAM,OAAO,MAAK;IACpB,SAAS,KAAK;AACZ,cAAQ,KAAK,GAAG;IAClB;EACF,CAAC;;gBA7MK,oBACA,gBASe;;;AAzBrB;AAEA;AACA,IAAAC;AAEA,IAAAA;AACA;AAOA;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,IAAM,qBAAqB;AAC3B,IAAM,iBAAiB;AASvB,IAAqB,kBAArB,MAAqB,yBAAwB,kBAAS;MAOpD,YAAY,QAAmB,iBAAuB;AACpD,cAAK;AALP,aAAA,UAAU,KAAK,MAAM,KAAK,OAAM,IAAK,KAAM;AAC3C,aAAA,aAAa;AAyHb,aAAA,qBAAqB;AACrB,aAAA,kBAAkB,CAAC,MAAY;AAC7B,cAAI,KAAK;AAAoB;AAC7B,eAAK,qBAAqB;AAC1B,eAAK,KAAK,cAAc,CAAC;QAC3B;AAzHE,aAAK,SAAS;AACd,aAAK,kBAAkB;AACvB,aAAK,cAAc,qBAAqB,OAAO,SAAS;MAC1D;;;;MAqDA,OAAa,UAAO;;AAClB,gBAAM,SAAS,MAAM,oBAAmB;AACxC,iBAAO,iBAAgB,KAAK,MAAM;QACpC,CAAC;;;;;MAKD,OAAa,gBAAa;;AACxB,gBAAMC,WAAU,MAAM,iBAAgB;AACtC,cAAIA,SAAQ,WAAW;AAAG,mBAAO;AACjC,iBAAO,iBAAgB,KAAKA,SAAQ,CAAC,CAAC;QACxC,CAAC;;;;;MAKD,OAAa,KAAK,QAAiB;;AACjC,gBAAM,OAAO,KAAI;AAEjB,cAAI,OAAO,kBAAkB,MAAM;AACjC,kBAAM,OAAO,oBAAoB,kBAAkB;UACrD;AAEA,gBAAM,sBAAsB,MAAM;AAClC,gBAAM,QAAQ,OAAO,eAAe,CAAC,EAAE,WAAW,KAAK,CAAC,EAAE,WAAU,MAClE,WAAW,KAAK,OAAK,EAAE,mBAAmB,GAAG,CAAC;AAGhD,cAAI,CAAC,OAAO;AACV,kBAAM,IAAI,+BACR,mGAAmG;UAEvG;AAEA,gBAAM,kBAAkB,MAAM;AAE9B,cAAI;AACF,kBAAM,OAAO,eAAe,eAAe;UAC7C,SAAS,GAAQ;AACf,kBAAM,OAAO,MAAK;AAClB,kBAAM,IAAI,+BAA+B,EAAE,OAAO;UACpD;AAEA,gBAAM,YAAY,IAAI,iBAAgB,QAAQ,eAAe;AAE7D,gBAAM,eAAe,OAAI;AACvB,gBAAI,WAAW,EAAE,QAAQ;AAEvB,wBAAU,IAAI,oBAAoB,cAAc,YAAY;AAE5D,wBAAU,gBAAgB,IAAI,mBAAkB,CAAE;YACpD;UACF;AAGA,oBAAU,IAAI,iBAAiB,cAAc,YAAY;AACzD,iBAAO;QACT,CAAC;;;;;MAYK,QAAK;;AACT,gBAAM,KAAK;AACX,gBAAM,KAAK,OAAO,iBAAiB,KAAK,eAAe;AACvD,gBAAM,sBAAsB,KAAK,MAAM;AACvC,gBAAM,KAAK,OAAO,MAAK;QACzB,CAAC;;;;;;;MAOK,SAAS,MAAY;;AACzB,gBAAM,IAAI,MAAM,KAAK,mBAAmB,MAAWC,WAAA,MAAA,QAAA,QAAA,aAAA;AACjD,kBAAM,EAAE,SAAS,WAAU,IAAK;AAChC,gBAAI,QAAQ,QAAQ,KAAK,SAAS,KAAK,CAAC;AACxC,kBAAM,UAAU,oBAAW,SAAS,UAAU;AAE9C,kBAAM,SAAS,QAAQ,WAAW,IAAI;AAEtC,qBAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,oBAAM,KAAK,OAAO,YAAY,gBAAgB,OAAO,CAAC,CAAC;YACzD;AAGA,gBAAI;AACJ,gBAAI;AAEJ,mBAAO,EAAE,SAAS,QAAQ,iBAAiB,GAAG,IAAI;AAChD,oBAAM,IAAI,MAAM,KAAK,OAAO,WAAW,gBAAgB,UAAU;AAGjE,oBAAMC,UAAS,OAAO,KAAK,EAAE,KAAK,MAAM;AACxC,oBAAM,QAAQ,eAAe,KAAKA,OAAM;YAC1C;AAEA,gBAAI,QAAQ,QAAQ,OAAO,SAAS,KAAK,CAAC;AAC1C,mBAAO;UACT,CAAC,CAAA,EAAE,MAAM,OAAI;AACX,gBAAI,KAAK,EAAE,WAAW,EAAE,QAAQ,SAAS,cAAc,GAAG;AACxD,mBAAK,gBAAgB,CAAC;AAEtB,oBAAM,IAAI,kCAAkC,EAAE,OAAO;YACvD;AAEA,kBAAM;UACR,CAAC;AAED,iBAAO;QACT,CAAC;;MAED,iBAAc;MAAI;;AAzKX,oBAAA,cAAc;AAKd,oBAAA,OAAO;AAQP,oBAAA,SAAS,CAAC,aAAgE;AAC/E,UAAI,eAAe;AACnB,2BAAoB,EAAG,KACrB,YAAS;AACP,YAAI,CAAC,cAAc;AACjB,gBAAM,cAAc,qBAAqB,OAAO,SAAS;AACzD,mBAAS,KAAK;YACZ,MAAM;YACN,YAAY;YACZ;WACD;AACD,mBAAS,SAAQ;QACnB;MACF,GACA,WAAQ;AACN,YAAI,OAAO,gBAAgB,iBAAiB,OAAO,gBAAgB,MAAM,SAAS,IAAI;AACpF,mBAAS,MAAM,IAAI,+BAA+B,MAAM,OAAO,CAAC;QAClE,OAAO;AACL,mBAAS,MAAM,IAAI,2BAA2B,MAAM,OAAO,CAAC;QAC9D;MACF,CAAC;AAGH,eAAS,cAAW;AAClB,uBAAe;MACjB;AAEA,aAAO;QACL;;IAEJ;8BA5DmB;;;;;ACGrB,SAAe,uBAAoB;;AACjC,UAAM,SAAS,MAAM,OAAM,EAAG,cAAc;MAC1C,SAASC;KACV;AACD,QAAI,MAAM,QAAQ,MAAM;AAAG,aAAO;AAClC,WAAO,CAAC,MAAM;EAChB,CAAC;;AAED,SAAeC,oBAAgB;;AAC7B,UAAMC,WAAU,MAAM,OAAM,EAAG,WAAU;AACzC,WAAOA,SAAQ,OAAO,OAAK,EAAE,aAAa,iBAAiB;EAC7D,CAAC;;AAED,SAAeC,wBAAoB;;AACjC,UAAM,kBAAkB,MAAMF,kBAAgB;AAC9C,QAAI,gBAAgB,SAAS;AAAG,aAAO,gBAAgB,CAAC;AACxD,UAAMC,WAAU,MAAM,qBAAoB;AAC1C,WAAOA,SAAQ,CAAC;EAClB,CAAC;;gBAjCKF,gBAMAI,cAEA,QAkCe;;;AAvDrB;AAEA;AACA,IAAAC;AAEA,IAAAA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAOA,IAAML,iBAAgB;MACpB;QACE,UAAU;;;AAId,IAAMI,eAAc,MAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,aAAa,OAAO,UAAU,IAAI;AAEtF,IAAM,SAAS,MAAU;AAEvB,YAAM,EAAE,IAAG,IAAK;AAChB,UAAI,CAAC;AAAK,cAAM,IAAI,eAAe,kCAAkC,iBAAiB;AACtF,aAAO;IACT;AA6BA,IAAqB,kBAArB,MAAqB,yBAAwB,kBAAS;MAMpD,YAAY,QAAiB;AAC3B,cAAK;AAJP,aAAA,UAAU,KAAK,MAAM,KAAK,OAAM,IAAK,KAAM;AAC3C,aAAA,aAAa;AAUb,aAAA,SAAmB,CAAA;AAEnB,aAAA,OAAO,MAAsB;AAC3B,cAAI,KAAK,OAAO,QAAQ;AACtB,mBAAO,QAAQ,QAAQ,KAAK,OAAO,MAAK,CAAuB;UACjE;AAEA,iBAAO,IAAI,QAAQ,aAAU;AAC3B,iBAAK,gBAAgB;UACvB,CAAC;QACH;AACA,aAAA,gBAAgB,CAAC,MAA0B;AACzC,gBAAME,UAAS,OAAO,KAAK,EAAE,KAAK,MAAM;AAExC,cAAI,KAAK,eAAe;AACtB,iBAAK,cAAcA,OAAM;AACzB,iBAAK,gBAAgB;UACvB,OAAO;AACL,iBAAK,OAAO,KAAKA,OAAM;UACzB;QACF;AAuFA,aAAA,qBAAqB;AACrB,aAAA,kBAAkB,CAAC,MAAY;AAC7B,cAAI,KAAK;AAAoB;AAC7B,eAAK,qBAAqB;AAC1B,eAAK,KAAK,cAAc,CAAC;QAC3B;AAgBA,aAAA,WAAW,CAAO,SAAiCC,WAAA,MAAA,QAAA,QAAA,aAAA;AACjD,gBAAM,IAAI,MAAM,KAAK,mBAAmB,MAAWA,WAAA,MAAA,QAAA,QAAA,aAAA;AACjD,kBAAM,EAAE,SAAS,WAAU,IAAK;AAChC,gBAAI,QAAQ,QAAQ,KAAK,SAAS,KAAK,CAAC;AACxC,kBAAM,UAAU,oBAAW,SAAS,UAAU;AAE9C,kBAAM,SAAS,QAAQ,WAAW,IAAI;AAEtC,qBAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,oBAAM,KAAK,OAAO,WAAW,GAAG,OAAO,CAAC,CAAC;YAC3C;AAGA,gBAAI;AACJ,gBAAI;AAEJ,mBAAO,EAAE,SAAS,QAAQ,iBAAiB,GAAG,IAAI;AAChD,oBAAMD,UAAS,MAAM,KAAK,KAAI;AAC9B,oBAAM,QAAQ,eAAe,KAAKA,OAAM;YAC1C;AAEA,gBAAI,QAAQ,QAAQ,OAAO,SAAS,KAAK,CAAC;AAC1C,mBAAO;UACT,CAAC,CAAA,EAAE,MAAM,OAAI;AACX,gBAAI,KAAK,EAAE,WAAW,EAAE,QAAQ,SAAS,OAAO,GAAG;AACjD,mBAAK,gBAAgB,CAAC;AAEtB,oBAAM,IAAI,kCAAkC,EAAE,OAAO;YACvD;AAEA,kBAAM;UACR,CAAC;AACD,iBAAO;QACT,CAAC;AAvKC,aAAK,SAAS;AACd,aAAK,cACH,OAAO,OAAO,cAAc,WAAW,qBAAqB,OAAO,SAAS,IAAI;AAClF,eAAO,iBAAiB,eAAe,KAAK,aAAa;MAC3D;;;;MA4EA,OAAa,UAAO;;AAClB,gBAAM,CAAC,MAAM,IAAI,MAAM,qBAAoB;AAC3C,iBAAO,iBAAgB,KAAK,MAAM;QACpC,CAAC;;;;;MAKD,OAAa,gBAAa;;AACxB,gBAAMJ,WAAU,MAAMD,kBAAgB;AACtC,cAAIC,SAAQ,WAAW;AAAG,mBAAO;AACjC,iBAAO,iBAAgB,KAAKA,SAAQ,CAAC,CAAC;QACxC,CAAC;;;;;MAKD,OAAa,KAAK,QAAiB;;AACjC,gBAAM,OAAO,KAAI;AACjB,gBAAM,YAAY,IAAI,iBAAgB,MAAM;AAE5C,gBAAM,eAAe,OAAI;AACvB,gBAAI,WAAW,EAAE,QAAQ;AACvB,qBAAM,EAAG,oBAAoB,cAAc,YAAY;AAEvD,wBAAU,gBAAgB,IAAI,mBAAkB,CAAE;YACpD;UACF;AAEA,iBAAM,EAAG,iBAAiB,cAAc,YAAY;AACpD,iBAAO;QACT,CAAC;;;;;MAYK,QAAK;;AACT,gBAAM,KAAK;AACX,eAAK,OAAO,oBAAoB,eAAe,KAAK,aAAa;AACjE,gBAAM,KAAK,OAAO,MAAK;QACzB,CAAC;;MA0CD,iBAAc;MAAI;;AA1IX,oBAAA,cAAcE;AAKd,oBAAA,OAAOH;AAQP,oBAAA,SAAS,CAAC,aAAgE;AAC/E,UAAI,eAAe;AACnB,MAAAE,sBAAoB,EAAG,KACrB,YAAS;AACP,YAAI,CAAC,QAAQ;AACX,mBAAS,MAAM,IAAI,2BAA2B,oCAAoC,CAAC;QACrF,WAAW,CAAC,cAAc;AACxB,gBAAM,cACJ,OAAO,OAAO,cAAc,WACxB,qBAAqB,OAAO,SAAS,IACrC;AACN,mBAAS,KAAK;YACZ,MAAM;YACN,YAAY;YACZ;WACD;AACD,mBAAS,SAAQ;QACnB;MACF,GACA,WAAQ;AACN,iBAAS,MAAM,IAAI,2BAA2B,MAAM,OAAO,CAAC;MAC9D,CAAC;AAGH,eAAS,cAAW;AAClB,uBAAe;MACjB;AAEA,aAAO;QACL;;IAEJ;8BAnFmB;;;;;ACvDrB;AAAA;AAAA;AAAA;AAAA,IASa;AATb;AAAA;AAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAM,SAAN,MAAM,QAAO;AAAA,MAChB,OAAO,cAAc;AAAA,MACrB,UAAU;AAAA,MACV,IAAI,SAAS;AAAE,eAAO,KAAK;AAAA,MAAS;AAAA,MACpC,cAAc;AAAA,MACd,gBAAgB;AAAA,MAChB,YAAY;AAAA,MACZ,mBAAmB;AAAA,MACnB,cAAc;AACV,YAAI,CAAC,QAAO,aAAa;AACrB,gBAAM,IAAI,MAAM,2DAA2D;AAAA,QAC/E;AACA,gBAAO,cAAc;AAAA,MACzB;AAAA,MACA,aAAa,OAAO;AAChB,gBAAO,cAAc;AACrB,cAAM,OAAO,IAAI,KAAK;AACtB,cAAM,KAAK,oBAAoB;AAC/B,cAAM,KAAK,OAAO;AAClB,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,MAAM,sBAAsB;AACxB,gBAAQ,IAAI,oCAAoC;AAChD,cAAM,WAAW;AAAA,UACb,KAAK,MAAM,wBAAa,YAAY;AAAA,UACpC,KAAK,MAAM,wBAAa,YAAY;AAAA,UACpC,KAAK,MAAM,wBAAa,YAAY;AAAA,QACxC;AACA,gBAAQ,IAAI,QAAQ,SAAS,GAAG,UAAU,SAAS,GAAG,UAAU,SAAS,GAAG,EAAE;AAC9E,YAAI,SAAS,KAAK;AACd,eAAK,mBAAmB;AAAA,QAC5B,WACS,SAAS,KAAK;AACnB,eAAK,mBAAmB;AAAA,QAC5B,WACS,SAAS,KAAK;AACnB,eAAK,mBAAmB;AAAA,QAC5B,OACK;AACD,gBAAM,IAAI,MAAM,qBAAqB;AAAA,QACzC;AAAA,MACJ;AAAA,MACA,MAAM,SAAS;AACX,cAAM,EAAE,IAAI,IAAI,WAAW;AAC3B,YAAI,KAAK;AACL,cAAI,iBAAiB,WAAW,QAAQ,IAAI,KAAK,OAAO,CAAC;AACzD,cAAI,iBAAiB,cAAc,QAAQ,IAAI,KAAK,OAAO,CAAC;AAAA,QAChE;AAAA,MACJ;AAAA,MACA,MAAM,UAAU;AACZ,cAAM,EAAE,IAAI,IAAI,WAAW;AAC3B,YAAI,KAAK;AACL,cAAI,oBAAoB,cAAc,KAAK,gBAAgB,KAAK,IAAI,CAAC;AACrE,cAAI,iBAAiB,cAAc,KAAK,gBAAgB,KAAK,IAAI,CAAC;AAAA,QACtE;AACA,cAAM,UAAU,MAAM,KAAK,QAAQ;AACnC,YAAI,QAAQ,WAAW,MAAM;AACzB,cAAI,QAAQ,SAAS,QAAQ;AACzB,kBAAM,UAAU,MAAM,KAAK,QAAQ;AACnC,gBAAI,QAAQ,WAAW,MAAM;AACzB,mBAAK,UAAU;AAAA,YACnB,WACS,QAAQ,WAAW,iCAAiC;AACzD,mBAAK,UAAU;AAAA,YACnB,OACK;AACD,mBAAK,UAAU;AAAA,YACnB;AAAA,UACJ,WACS,QAAQ,SAAS,SAAS;AAC/B,kBAAMK,QAAO,MAAM,KAAK,KAAK;AAC7B,iBAAK,UAAWA,MAAK,WAAW,OAC1B,cACA;AAAA,UACV,OACK;AACD,iBAAK,UAAU;AAAA,UACnB;AAAA,QACJ,OACK;AACD,eAAK,UAAU;AAAA,QACnB;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,MAAM,gBAAgB,GAAG;AACrB,YAAI,EAAE,QAAQ,qBAAqB,UAAU;AACzC,gBAAM,EAAE,IAAI,IAAI,WAAW;AAC3B,cAAI,oBAAoB,cAAc,KAAK,eAAe;AAC1D,eAAK,UAAU;AAAA,QACnB;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAcA,MAAM,OAAO;AACT,cAAM,OAAO,IAAI,YAAY,EAAE,OAAO,MAAM;AAC5C,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,cAAM,WAAW,MAAM,UAAU,KAAK,KAAM,KAAM,GAAM,GAAM,IAAI,EAC7D,KAAK,SAAO,MAAM,MAAM,GAAG,CAAC,EAC5B,MAAM,SAAO,IAAI,UAAU;AAChC,eAAO,IAAI,QAAQ,aAAW,WAAW,SAAS,KAAM,EAAE,QAAQ,oBAAoB,QAAQ,EAAE,CAAC,CAAC;AAAA,MACtG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAcA,MAAM,QAAQ;AACV,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,cAAM,WAAW,MAAM,UAAU,KAAK,KAAM,KAAM,GAAM,CAAI,EACvD,KAAK,SAAO,MAAM,MAAM,GAAG,CAAC,EAC5B,MAAM,SAAO,IAAI,UAAU;AAChC,eAAO,IAAI,QAAQ,aAAW,WAAW,SAAS,KAAM,EAAE,QAAQ,oBAAoB,QAAQ,EAAE,CAAC,CAAC;AAAA,MACtG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,MAAM,UAAU;AACZ,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,cAAM,WAAW,MAAM,UAAU,KAAK,KAAM,GAAM,GAAM,CAAI,EACvD,MAAM,SAAO,IAAI,QAAQ,IAAI,UAAU,CAAC;AAC7C,cAAM,UAAU,MAAM;AACtB,YAAI,SAAS,WAAW,GAAG;AACvB,gBAAMC,cAAa,MAAM,MAAM,QAAQ;AACvC,gBAAMC,UAAS,oBAAoBD,WAAU,KAAK;AAClD,iBAAO,EAAE,QAAAC,SAAQ,MAAM,MAAM,SAAS,KAAK;AAAA,QAC/C;AACA,cAAM,aAAa,SAAS,CAAC;AAC7B,cAAM,OAAO,SAAS,MAAM,GAAG,IAAI,UAAU,EAAE,SAAS;AACxD,cAAM,gBAAgB,SAAS,IAAI,UAAU;AAC7C,cAAM,UAAU,SAAS,MAAM,IAAI,aAAa,GAAG,IAAI,aAAa,IAAI,aAAa,EAAE,SAAS;AAChG,cAAM,aAAa,MAAM,MAAM,SAAS,MAAM,EAAE,CAAC;AACjD,cAAM,SAAS,oBAAoB,UAAU;AAC7C,eAAO,EAAE,QAAQ,MAAM,QAAQ;AAAA,MACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAM,QAAQ,QAAQ,GAAG,OAAO,OAAO;AACnC,YAAI,OAAO,UAAU,YAAY,QAAQ,KAAK,SAAS,iBAAiB;AACpE,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC/C;AACA,cAAM,UAAU,IAAI,QAAQ,gBAAgB,iBAAiB,CAAC;AAC9D,cAAM,OAAO,IAAI,QAAQ,kBAAkB,iBAAiB,CAAC;AAC7D,cAAM,UAAU,IAAI,QAAQ,QAAQ,iBAAiB,CAAC;AACtD,cAAM,OAAO,IAAI,WAAW,CAAC,GAAM,GAAG,SAAS,GAAG,MAAM,GAAG,OAAO,CAAC;AACnE,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,cAAM,WAAW,MAAM,UAAU,KAAK,KAAM,GAAM,OAAO,IAAO,GAAM,GAAM,IAAI,EAC3E,MAAM,SAAO,IAAI,QAAQ,IAAI,UAAU,CAAC;AAC7C,cAAM,UAAU,MAAM;AACtB,YAAI,SAAS,WAAW,GAAG;AACvB,gBAAM,aAAa,MAAM,MAAM,QAAQ;AACvC,gBAAM,SAAS,oBAAoB,UAAU,KAAK;AAClD,iBAAO,EAAE,QAAQ,WAAW,MAAM,SAAS,KAAK;AAAA,QACpD;AACA,YAAI;AACA,gBAAM,YAAY,MAAM,MAAM,SAAS,MAAM,GAAG,EAAE,CAAC;AACnD,gBAAM,gBAAgB,SAAS,EAAE;AACjC,gBAAM,UAAU,SAAS,MAAM,IAAI,KAAK,aAAa,EAAE,SAAS;AAChE,gBAAM,aAAa,MAAM,MAAM,SAAS,MAAM,KAAK,aAAa,CAAC;AACjE,gBAAM,SAAS,oBAAoB,UAAU;AAC7C,iBAAO,EAAE,QAAQ,WAAW,QAAQ;AAAA,QACxC,SACO,KAAK;AACR,iBAAO,EAAE,QAAQ,yBAAyB,WAAW,MAAM,SAAS,KAAK;AAAA,QAC7E;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,WAAW,QAAQ,GAAG,OAAO;AAC/B,YAAI,OAAO,UAAU,YAAY,QAAQ,KAAK,SAAS,iBAAiB;AACpE,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC/C;AACA,YAAI,EAAE,iBAAiB,cAAc,EAAE,iBAAiB,iBAAiB,EAAE,iBAAiB,cAAc;AACtG,gBAAM,IAAI,UAAU,sBAAsB;AAAA,QAC9C;AACA,YAAI,CAAC,MAAM,WAAW;AAClB,gBAAM,IAAI,eAAe,6BAA6B;AAAA,QAC1D;AACA,cAAM,UAAU,IAAI,QAAQ,gBAAgB,iBAAiB,CAAC;AAC9D,cAAM,OAAO,IAAI,QAAQ,kBAAkB,iBAAiB,CAAC;AAC7D,cAAM,UAAU,IAAI,QAAQ,QAAQ,iBAAiB,CAAC;AACtD,cAAM,WAAW,IAAI,QAAQ,MAAM,QAAQ;AAC3C,cAAM,OAAO,IAAI,QAAQ,MAAM,IAAI;AACnC,cAAM,iBAAiB,IAAI,QAAQ,MAAM,eAAe,SAAS;AACjE,cAAM,UAAU,IAAI,QAAQ,OAAO,MAAM,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE;AAClE,cAAM,YAAY,IAAI,QAAQ,MAAM,SAAS;AAC7C,cAAM,OAAO,IAAI,WAAW,CAAC,GAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,GAAG,UAAU,GAAG,MAAM,GAAG,gBAAgB,GAAG,SAAS,GAAG,SAAS,CAAC;AACtI,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,cAAM,WAAW,MAAM,UAAU,KAAK,KAAM,GAAM,GAAM,GAAM,IAAI,EAC7D,KAAK,SAAO,MAAM,MAAM,GAAG,CAAC,EAC5B,MAAM,SAAO,IAAI,UAAU;AAChC,cAAM,UAAU,MAAM;AACtB,eAAO,EAAE,QAAQ,oBAAoB,QAAQ,EAAE;AAAA,MACnD;AAAA,MACA,MAAM,KAAK,QAAQ,GAAG,OAAO;AACzB,YAAI,OAAO,UAAU,YAAY,QAAQ,KAAK,SAAS,iBAAiB;AACpE,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC/C;AACA,cAAM,UAAU,IAAI,QAAQ,gBAAgB,iBAAiB,CAAC;AAC9D,cAAM,OAAO,IAAI,QAAQ,kBAAkB,iBAAiB,CAAC;AAC7D,cAAM,UAAU,IAAI,QAAQ,QAAQ,iBAAiB,CAAC;AACtD,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,YAAI,OAAO,UAAU,UAAU;AAE3B,gBAAM,QAAQ,KAAK,QAAQ,KAAK;AAChC,cAAI,MAAM,WAAW,IAAI;AACrB,kBAAM,IAAI,WAAW,8BAA8B;AAAA,UACvD;AACA,gBAAM,OAAO,IAAI,WAAW,CAAC,GAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,GAAG,KAAK,CAAC;AAC7E,gBAAM,WAAW,MAAM,UAAU,KAAK,KAAM,GAAM,GAAM,GAAM,IAAI,EAC7D,MAAM,SAAO,IAAI,QAAQ,IAAI,UAAU,CAAC;AAC7C,gBAAM,UAAU,MAAM;AACtB,cAAI,SAAS,WAAW,GAAG;AACvB,kBAAMD,cAAa,MAAM,MAAM,QAAQ;AACvC,kBAAMC,UAAS,oBAAoBD,WAAU,KAAK;AAClD,mBAAO,EAAE,QAAAC,SAAQ,WAAW,KAAK;AAAA,UACrC;AACA,gBAAM,YAAY,MAAM,MAAM,SAAS,MAAM,GAAG,EAAE,CAAC;AACnD,gBAAM,aAAa,MAAM,MAAM,SAAS,MAAM,EAAE,CAAC;AACjD,gBAAM,SAAS,oBAAoB,UAAU;AAC7C,iBAAO,EAAE,QAAQ,UAAU;AAAA,QAC/B,OACK;AAED,gBAAM,WAAW,IAAI,QAAQ,MAAM,QAAQ;AAC3C,gBAAM,OAAO,IAAI,QAAQ,MAAM,IAAI;AACnC,gBAAM,iBAAiB,IAAI,QAAQ,MAAM,eAAe,SAAS;AACjE,gBAAM,UAAU,IAAI,QAAQ,OAAO,MAAM,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE;AAClE,gBAAM,OAAO,IAAI,WAAW,CAAC,GAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,GAAG,UAAU,GAAG,MAAM,GAAG,gBAAgB,GAAG,OAAO,CAAC;AACxH,gBAAM,WAAW,MAAM,UAAU,KAAK,KAAM,GAAM,GAAM,GAAM,IAAI,EAC7D,MAAM,SAAO,IAAI,QAAQ,IAAI,UAAU,CAAC;AAC7C,gBAAM,UAAU,MAAM;AACtB,cAAI,SAAS,WAAW,GAAG;AACvB,kBAAMD,cAAa,MAAM,MAAM,QAAQ;AACvC,kBAAMC,UAAS,oBAAoBD,WAAU,KAAK;AAClD,mBAAO,EAAE,QAAAC,SAAQ,WAAW,MAAM,MAAM,KAAK;AAAA,UACjD;AACA,gBAAMC,QAAO,MAAM,MAAM,SAAS,MAAM,GAAG,EAAE,CAAC;AAC9C,gBAAM,YAAY,MAAM,MAAM,SAAS,MAAM,IAAI,EAAE,CAAC;AACpD,gBAAM,aAAa,MAAM,MAAM,SAAS,MAAM,EAAE,CAAC;AACjD,gBAAM,SAAS,oBAAoB,UAAU;AAC7C,iBAAO,EAAE,QAAQ,WAAW,MAAAA,MAAK;AAAA,QACrC;AAAA,MACJ;AAAA,MACA,MAAM,YAAY,OAAO,OAAO,MAAM;AAClC,YAAI,OAAO,UAAU,YAAY,MAAM,gBAAgB,KAAK;AACxD,gBAAM,OAAO;AAAA,YACT,cAAc;AAAA,YACd,QAAQ;AAAA,UACZ;AACA,gBAAM,MAAM,MAAM,KAAK,KAAK,cAAc,IAAI;AAC9C,cAAI,CAAC,OAAO,IAAI,OAAO,OAAO;AAC1B,kBAAM,IAAI,MAAM,8BAA8B,GAAG;AAAA,UACrD;AACA,kBAAQ,IAAI;AAAA,QAChB;AACA,eAAO,KAAK,WAAW,OAAO,KAAK;AAAA,MACvC;AAAA,IACJ;AAAA;AAAA;;;ACtDA,SAAS,SAAS,OAAO;AACrB,MAAI,MAAM,WAAW,MAAM;AACvB,UAAM,IAAI,MAAM,iBAAiB;AAAA,EACrC;AACA,MAAI,MAAM,YAAY,QAAQ,MAAM,aAAa,IAAI;AACjD,UAAM,IAAI,MAAM,kBAAkB;AAAA,EACtC;AACA,MAAI,MAAM,kBAAkB,MAAM;AAC9B,UAAM,IAAI,MAAM,wBAAwB;AAAA,EAC5C;AACA,MAAI,MAAM,WAAW,MAAM;AACvB,UAAM,IAAI,MAAM,iBAAiB;AAAA,EACrC;AACA,MAAI,MAAM,UAAU,GAAG;AACnB,UAAM,IAAI,MAAM,kBAAkB;AAAA,EACtC;AACA,UAAQ,MAAM,aAAa;AAAA,IACvB,KAAK,WAAW;AACZ,UAAI,MAAM,QAAQ,QAAQ,MAAM,SAAS,IAAI;AACzC,cAAM,IAAI,MAAM,mBAAmB;AAAA,MACvC;AACA;AAAA,IACJ;AAAA,IACA,KAAK,cAAc;AACf,UAAI,MAAM,QAAQ,MAAM;AACpB,cAAM,IAAI,MAAM,gCAAgC;AAAA,MACpD;AACA;AAAA,IACJ;AAAA,IACA,KAAK,aAAa;AACd,UAAI,MAAM,QAAQ,MAAM;AACpB,cAAM,IAAI,MAAM,2BAA2B;AAAA,MAC/C;AACA,UAAI,CAAC,MAAM,SAAS,GAAG;AACnB,cAAM,IAAI,MAAM,2BAA2B;AAAA,MAC/C;AACA;AAAA,IACJ;AAAA,EACJ;AACJ;AA/RA,IAcM,OAgKO,WAyBA,cA0BA;AAjOb;AAAA;AAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AAMA,IAAM,QAAN,MAAM,OAAM;AAAA,MACR,OAAO,QAAQ,IAAI,KAAK,aAAG;AAAA,MAC3B;AAAA,MACA,OAAO;AAAA,MACP,YAAY,SAAS;AACjB,YAAI,KAAK,gBAAgB,QAAO;AAC5B,gBAAM,IAAI,MAAM,iEAAiE;AAAA,QACrF;AACA,YAAI,QAAQ,gBAAgB,SAAS;AACjC,eAAK,UAAU;AAAA,QACnB,WACS,OAAO,YAAY,UAAU;AAClC,eAAK,UAAU,QAAQ,YAAY,OAAO;AAAA,QAC9C,OACK;AACD,gBAAM,IAAI,UAAU,iBAAiB;AAAA,QACzC;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAO;AACH,eAAO;AAAA,UACH,QAAQ,KAAK;AAAA,UACb,WAAW,KAAK,QAAQ;AAAA,UACxB,YAAY,KAAK;AAAA,UACjB,kBAAkB,KAAK,eAAe;AAAA,UACtC,WAAW,KAAK,QAAQ,SAAS;AAAA,UACjC,QAAQ,KAAK;AAAA,UACb,aAAa,KAAK,aAAa;AAAA,UAC/B,QAAQ,KAAK,QAAQ;AAAA,QACzB;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAM,OAAO;AACT,cAAM,OAAO;AAAA,UACT;AAAA,UACA,KAAK,QAAQ;AAAA,UACb,KAAK;AAAA,UACL,KAAK,eAAe;AAAA,UACpB,IAAI,MAAM,KAAK,SAAS,EAAE;AAAA,UAC1B,KAAK;AAAA,QACT;AACA,cAAMC,QAAO,IAAI,QAAQ,EAAE;AAC3B,aAAK,QAAQ,SAAOA,MAAK,OAAO,IAAI,QAAQ,GAAG,CAAC,CAAC;AACjD,eAAOA,MAAK,OAAO,KAAK,EAAE,YAAY;AAAA,MAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAM,MAAM;AACR,cAAM,OAAO;AAAA,UACT,QAAQ,KAAK;AAAA,UACb,aAAc,gBAAgB,aAAa,gBAAgB,cACrD,iBACA;AAAA,QACV;AACA,cAAM,CAAC,EAAE,KAAK,CAAC,IAAI,MAAM,OAAM,MAAM,OAAO,CAAC,IAAI,CAAC;AAClD,aAAK,OAAO;AAAA,MAChB;AAAA,MACA,MAAM,KAAK,OAAO,OAAO;AACrB,YAAI,OAAO,UAAU,UAAU;AAC3B,gBAAM,QAAQ;AACd,gBAAM,EAAE,QAAAC,QAAO,IAAI,MAAM;AACzB,gBAAM,SAAS,MAAMA,QAAO,KAAK;AACjC,gBAAM,OAAO,KAAK;AAClB,cAAI,OAAO;AACP,gBAAI;AACA,oBAAM,OAAO,YAAY,OAAO,KAAK;AAAA,YACzC,SACO,KAAK;AACR,sBAAQ,KAAK,8EAA8E,GAAG;AAAA,YAClG;AAAA,UACJ;AACA,gBAAM,SAAS,MAAM,OAAO,KAAK,OAAO,IAAI;AAC5C,cAAI,OAAO,WAAW,MAAM;AACxB,kBAAM,IAAI,MAAM,OAAO,MAAM;AAAA,UACjC;AACA,eAAK,YAAY,OAAO;AAAA,QAC5B,OACK;AACD,gBAAM,MAAM,SAAS,KAAK,QAAQ;AAClC,cAAI,OAAO,MAAM;AACb,kBAAM,IAAI,MAAM,kCAAkC;AAAA,UACtD;AACA,gBAAM,UAAU,MAAM,QAAQ,eAAe,GAAG;AAChD,cAAI;AACA,kBAAM,YAAY,SAAS,SAAS,IAAI,QAAQ,MAAM,KAAK,KAAK,CAAC,GAAG,IAAI,QAAQ,GAAG,QAAQ,UAAU,EAAE,CAAC;AACxG,iBAAK,YAAY;AAAA,UACrB,SACO,KAAK;AACR,kBAAM,IAAI,MAAM,iCAAiC,GAAG,KAAK,GAAG,EAAE;AAAA,UAClE;AAAA,QACJ;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,MAAM,QAAQ,KAAK;AACf,YAAI,CAAC,KAAK,WAAW;AACjB,gBAAM,IAAI,MAAM,uDAAuD;AAAA,QAC3E;AACA,YAAI,CAAC,KAAK,QAAQ,MAAM;AACpB,gBAAM,IAAI,MAAM,6DAA6D;AAAA,QACjF;AACA,cAAM,OAAO;AAAA,UACT,WAAW,KAAK;AAAA,UAChB,cAAc;AAAA,UACd,SAAS,KAAK,KAAK;AAAA,QACvB;AACA,cAAM,MAAM,MAAM,IAAI,KAAK,WAAW,IAAI;AAC1C,YAAI,IAAI,QAAQ,MAAM;AAClB,gBAAM,IAAI,MAAM,gCAAgC,GAAG;AAAA,QACvD;AACA,eAAO,IAAI;AAAA,MACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,OAAO,KAAK;AACd,gBAAQ,KAAK,QAAQ;AACrB,YAAI,CAAC,KAAK;AACN,gBAAM,IAAI,MAAM,iDAAiD;AAAA,QACrE;AACA,cAAM,OAAO;AAAA,UACT;AAAA,UACA,KAAK,QAAQ;AAAA,UACb,KAAK;AAAA,UACL,KAAK,eAAe;AAAA,UACpB,IAAI,MAAM,KAAK,SAAS,EAAE;AAAA,UAC1B,KAAK;AAAA,QACT;AACA,cAAMD,QAAO,IAAI,QAAQ,EAAE;AAC3B,aAAK,QAAQ,SAAOA,MAAK,OAAO,IAAI,QAAQ,GAAG,CAAC,CAAC;AACjD,cAAM,YAAYA,MAAK,OAAO,KAAK,EAAE,YAAY;AACjD,eAAO,SAAS,OAAO,IAAI,QAAQ,SAAS,GAAG,IAAI,QAAQ,KAAK,aAAa,EAAE,GAAG,IAAI,QAAQ,GAAG,CAAC;AAAA,MACtG;AAAA,IACJ;AAKO,IAAM,YAAN,cAAwB,MAAM;AAAA,MACjC,OAAO;AAAA,MACP,UAAU;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY,QAAQ,SAAS,WAAW,QAAQ,gBAAgB,UAAU,MAAM;AAC5E,cAAM,MAAM;AACZ,aAAK,WAAW;AAChB,aAAK,iBAAiB,QAAQ,YAAY,cAAc;AACxD,aAAK,OAAO,QAAQ,YAAY,SAAS,EAAE;AAC3C,aAAK,OAAO,QAAQ;AACpB,cAAM,aAAa,OAAO,OAAO;AACjC,cAAM,YAAY,OAAO,MAAM;AAC/B,aAAK,UAAU,aAAa;AAC5B,iBAAS,IAAI;AAAA,MACjB;AAAA,IACJ;AAKO,IAAM,eAAN,cAA2B,MAAM;AAAA,MACpC,OAAO;AAAA,MACP,UAAU;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY,WAAW,SAAS,QAAQ,QAAQ,gBAAgB,UAAU,MAAM;AAC5E,cAAM,SAAS;AACf,aAAK,WAAW,YAAY,QAAQ,YAAY,SAAS,EAAE;AAC3D,aAAK,iBAAiB,QAAQ,YAAY,cAAc;AACxD,aAAK,OAAO;AACZ,aAAK,OAAO,QAAQ;AACpB,cAAM,aAAa,OAAO,OAAO;AACjC,cAAM,YAAY,OAAO,MAAM;AAC/B,aAAK,UAAU,aAAa;AAC5B,iBAAS,IAAI;AAAA,MACjB;AAAA,IACJ;AAMO,IAAM,cAAN,cAA0B,MAAM;AAAA,MACnC,OAAO;AAAA,MACP,UAAU;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,QAAQ,YAAY,YAAY,EAAE;AAAA,MACzC;AAAA,MACA;AAAA,MACA,YAAY,SAAS,SAAS,gBAAgB,UAAU,MAAM;AAC1D,cAAM,OAAO;AACb,aAAK,WAAW;AAChB,aAAK,iBAAiB,QAAQ,YAAY,cAAc;AACxD,aAAK,UAAU,OAAO,OAAO;AAC7B,aAAK,OAAO,QAAQ;AACpB,iBAAS,IAAI;AAAA,MACjB;AAAA,IACJ;AAAA;AAAA;;;AClPA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASA,SAAS,KAAK,MAAM,UAAU;AAC1B,MAAI,CAAC,MAAM,QAAQ,IAAI;AACnB,WAAO,CAAC,IAAI;AAChB,QAAME,QAAO,IAAI,QAAQ,EAAE;AAC3B,MAAI,aAAa,OAAO;AACpB,SAAK,QAAQ,SAAOA,MAAK,OAAO,IAAI,QAAQ,GAAG,CAAC,CAAC;AAAA,EACrD,OACK;AACD,UAAM,MAAM,IAAI,YAAY;AAC5B,SAAK,QAAQ,SAAOA,MAAK,OAAO,IAAI,OAAO,GAAG,CAAC,CAAC;AAAA,EACpD;AACA,SAAOA,MAAK,OAAO,KAAK,EAAE,YAAY;AAC1C;AAQA,eAAsB,QAAQ,QAAQ,WAAW,YAAY;AACzD,MAAI,OAAO,WAAW,UAAU;AAC5B,aAAS,OAAO,SAAS;AAAA,EAC7B;AACA,MAAI,OAAO,WAAW,YAAY,WAAW,MAAM,CAAC,oBAAoB,KAAK,MAAM,GAAG;AAClF,UAAM,IAAI,MAAM,gBAAgB;AAAA,EACpC;AACA,MAAI,CAAC,IAAI,IAAI,IAAI,EAAE,IAAI,OAAO,SAAS,EAAE,MAAM,GAAG;AAClD,MAAI,EAAE,QAAQ,QAAQ,EAAE;AACxB,MAAI,EAAE,QAAQ,QAAQ,EAAE;AACxB,cAAY,UAAU,YAAY;AAClC,eAAa,WAAW,YAAY;AACpC,MAAI,EAAE,aAAa,QAAQ;AACvB,UAAM,IAAI,MAAM,wBAAwB,SAAS,oCAAoC,OAAO,KAAK,KAAK,CAAC,EAAE;AAAA,EAC7G;AACA,MAAI,EAAE,cAAc,QAAQ;AACxB,UAAM,IAAI,MAAM,wBAAwB,UAAU,oCAAoC,OAAO,KAAK,KAAK,CAAC,EAAE;AAAA,EAC9G;AAEA,MAAI,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,SAAS,CAAC,CAAC,GAAG,OAAO,EAAE,SAAS,MAAM,SAAS,GAAG,GAAG;AACjF,MAAI,EAAE,MAAM,MAAM,SAAS,CAAC;AAC5B,MAAI,EAAE,SAAS,IAAI;AACf,UAAM,IAAI,MAAM,4BAA4B;AAAA,EAChD;AACA,MAAI,EAAE,SAAS,GAAG;AACd,UAAM,IAAI,MAAM,+BAA+B;AAAA,EACnD;AACA,MAAI,EAAE,SAAS,GAAG;AACd,UAAM,IAAI,MAAM,gCAAgC;AAAA,EACpD;AAEA,MAAI,MAAM,UAAU,MAAM,GAAG;AACzB,QAAI,EAAE,SAAS,IAAI,GAAG,EAAE,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI;AACpD,QAAI,EAAE,MAAM,GAAG,CAAC,MAAM,UAAU,CAAC;AAAA,EACrC;AACA,MAAI,EAAE,QAAQ,QAAQ,EAAE,KAAK;AAC7B,MAAI,EAAE,QAAQ,QAAQ,EAAE;AACxB,SAAO,GAAG,CAAC,GAAG,IAAI,MAAM,EAAE,GAAG,CAAC;AAClC;AAQA,eAAsB,KAAK,QAAQ,OAAO;AACtC,QAAM,UAAU,MAAM,QAAQ,eAAe,GAAG;AAChD,QAAM,OAAO,KAAK,KAAK;AACvB,QAAM,YAAY,SAAS,SAAS,IAAI,QAAQ,IAAI,GAAG,IAAI,QAAQ,GAAG,QAAQ,UAAU,EAAE,CAAC;AAC3F,SAAO;AACX;AAYA,eAAsB,MAAM,KAAK,QAAQ,WAAWC,QAAO,GAAG,KAAKA,OAAM;AACrE,MAAI,OAAO,QAAQ,UAAU,QAAQ,aAAa,MAAM;AACpD,UAAM,IAAI,eAAe,kCAAkC;AAAA,EAC/D;AACA,MAAI,OAAO,QAAQ,YAAY,IAAI,gBAAgB,KAAK;AACpD,UAAM,IAAI,IAAI,GAAG;AAAA,EACrB;AACA,MAAI,IAAI,gBAAgB,KAAK;AACzB,UAAM,IAAI,UAAU,0BAA0B;AAAA,EAClD;AACA,QAAM,aAAa,CAAC;AACpB,QAAM,UAAU,CAAC;AACjB,QAAM,mBAAmB,QAAQ,YAAY,SAAS;AACtD,QAAM,WAAW,MAAM,OAAO,QAAQ,KAAKA,OAAM,EAAE;AACnD,aAAW,WAAW,UAAU;AAC5B,QAAI,QAAQ,gBAAgB,WAAW,QAAQ,UAAU;AACrD,YAAM,QAAQ,IAAI,UAAU,SAAS,QAAQ,SAAS,SAAS,KAAK,KAAK,iBAAiB,SAAS,QAAQ,SAAS,SAAS,KAAK,KAAK,QAAQ,eAAe,SAAS,QAAQ,QAAQ;AACvL,YAAM,eAAe,IAAI,QAAQ,OAAO,YAAY;AAChD,YAAI;AACA,gBAAM,MAAM,IAAI;AAChB,gBAAM,MAAM,KAAK;AACjB,gBAAMD,QAAO,MAAM,MAAM,QAAQ,GAAG;AACpC,kBAAQ,KAAK,EAAE,QAAQ,WAAW,SAAS,MAAM,QAAQ,SAAS,SAASA,MAAK,CAAC;AAAA,QACrF,SACO,KAAK;AACR,kBAAQ,KAAK,EAAE,QAAQ,SAAS,SAAS,MAAM,QAAQ,SAAS,SAAS,IAAI,QAAQ,CAAC;AAAA,QAC1F,UACA;AACI,kBAAQ;AAAA,QACZ;AAAA,MACJ,CAAC;AACD,iBAAW,KAAK,YAAY;AAAA,IAChC;AAAA,EACJ;AACA,QAAM,QAAQ,WAAW,UAAU;AACnC,SAAO;AACX;AASA,eAAsB,OAAO,KAAK,cAAc,OAAO;AACnD,QAAM,OAAO,KAAK,KAAK;AACvB,MAAI;AACA,WAAO,MAAM,SAAS,OAAO,IAAI,QAAQ,IAAI,GAAG,IAAI,QAAQ,SAAS,GAAG,IAAI,QAAQ,GAAG,CAAC;AAAA,EAC5F,SACO,KAAK;AACR,YAAQ,MAAM,GAAG;AACjB,WAAO;AAAA,EACX;AACJ;AAlJA,IAmJa;AAnJb;AAAA;AAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AA2IO,IAAM,QAAQ,EAAE,SAAS,MAAM,OAAO,OAAO;AAAA;AAAA;;;ACnJpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAEA;AACA;AACA;AACA;AACA;;;ACJA;AAKO,IAAM,UAAN,MAAc;AAAA,EACjB,WAAW,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWZ,MAAM,IAAI,MAAM,SAAS;AACrB,QAAI,QAAQ,QAAQ,SAAS,IAAI;AAC7B,YAAM,IAAI,MAAM,sCAAsC;AAAA,IAC1D;AACA,QAAI,OAAO,SAAS,UAAU;AAC1B,YAAM,IAAI,MAAM,2CAA2C;AAAA,IAC/D;AACA,QAAI,WAAW,QAAQ,YAAY,IAAI;AACnC,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC7D;AACA,QAAI,OAAO,YAAY,UAAU;AAC7B,YAAM,IAAI,MAAM,8CAA8C;AAAA,IAClE;AACA,WAAO,KACF,WAAW,KAAK,SAAS,EACzB,WAAW,KAAK,SAAS,EACzB,WAAW,KAAK,SAAS,EACzB,WAAW,MAAM,SAAS;AAC/B,UAAM,UAAU,QAAQ,YAAY,OAAO;AAC3C,UAAM,aAAa,KAAK,SAAS,KAAK,OAAK,EAAE,SAAS,IAAI;AAC1D,UAAM,gBAAgB,KAAK,SAAS,KAAK,OAAK,EAAE,QAAQ,YAAY,OAAO;AAC3E,QAAI,CAAC,eAAe;AAChB,WAAK,SAAS,KAAK,EAAE,MAAM,QAAQ,CAAC;AAAA,IACxC,WACS,CAAC,YAAY;AAClB,oBAAc,OAAO;AAAA,IACzB;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,SAAS;AACb,UAAM,SAAS,KAAK,SAAS,KAAK,OAAK,EAAE,QAAQ,YAAY,OAAO;AACpE,WAAO,QAAQ,QAAQ;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,MAAM;AACf,UAAM,UAAU,KAAK,SAAS,OAAO,OAAK,EAAE,SAAS,IAAI;AACzD,WAAO,QAAQ,IAAI,OAAK,EAAE,QAAQ,OAAO;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc;AACV,WAAO,KAAK,SAAS,IAAI,OAAK,EAAE,IAAI;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,OAAO,MAAM,cAAc,MAAM;AACnC,UAAM,EAAE,OAAAE,OAAM,IAAI,MAAM;AACxB,UAAM,UAAU,KAAK,SAAS,OAAO,OAAK,EAAE,SAAS,IAAI;AACzD,eAAW,SAAS,SAAS;AACzB,YAAM,MAAM,MAAM,QAAQ;AAC1B,YAAM,WAAW,MAAMA,OAAM,OAAO,KAAK,WAAW,GAAG,IAAI;AAC3D,UAAI,UAAU;AACV,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;;;ADxFA;AACA;;;AEPA;AACA;;;ACEO,IAAM,aAAa,OAAO,OAAO;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC;;;ACngED;AACA;AACA;AACA,IAAM,EAAE,QAAAC,QAAO,IAAI,WAAW;AAIvB,IAAM,gBAAN,MAAM,eAAc;AAAA,EACvB,OAAO,cAAc;AAAA,EACrB,aAAa;AAAA,EACb,eAAe;AAAA,EACf,UAAU;AAAA,EACV,IAAI,SAAS;AAAE,WAAO,KAAK,QAAQ,UAAU,MAAM;AAAA,EAAG;AAAA,EACtD,cAAc;AACV,QAAI,CAAC,eAAc,aAAa;AAC5B,YAAM,IAAI,MAAM,sIAAsI;AAAA,IAC1J;AACA,mBAAc,cAAc;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,aAAa,WAAW,QAAQ;AAC5B,mBAAc,cAAc;AAC5B,UAAM,OAAO,IAAI,KAAK;AACtB,UAAM,UAAU,MAAM,eAAc,SAAS,MAAM;AACnD,QAAI,SAAS;AACT,WAAK,UAAU,OAAO,UAAU,MAAM;AACtC,aAAO;AAAA,IACX,OACK;AACD,YAAM,IAAI,MAAM,0BAA0B;AAAA,IAC9C;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,aAAa,YAAY,SAAS;AAC9B,UAAM,IAAI,MAAM,QAAQ,OAAO,OAAO;AACtC,UAAM,WAAW,MAAM,KAAK,SAAS,CAAC;AACtC,QAAI,gBAAgB,GAAG,EAAE,IAAI,GAAG,QAAQ;AACxC,UAAM,QAAQ,CAAC;AACf,WAAO,cAAc,SAAS,GAAG;AAC7B,YAAM,WAAW,cAAc,UAAU,GAAG,EAAE;AAC9C,YAAM,YAAY,SAAS,UAAU,CAAC;AACtC,YAAM,KAAK,WAAW,SAAS,CAAC;AAChC,sBAAgB,cAAc,UAAU,EAAE;AAAA,IAC9C;AACA,UAAM,WAAW,MAAM,KAAK,GAAG;AAC/B,WAAO,eAAc,WAAW,QAAQ;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aAAa,SAAS,SAAS;AAC3B,UAAM,aAAa,MAAMA,QAAO,OAAO,WAAW,QAAQ,KAAK;AAC/D,UAAM,YAAY,IAAI,WAAW,UAAU;AAC3C,UAAM,WAAW,MAAM,MAAM,SAAS;AACtC,UAAM,iBAAiB,QAAQ,KAAK,SAAS;AAC7C,UAAM,WAAW,SAAS,UAAU,GAAG,cAAc;AACrD,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,SAAS,UAAU;AAC5B,UAAM,QAAQ,SAAS,UAAU,MAAM,EAAE,MAAM,GAAG;AAClD,QAAI,MAAM,SAAS,MAAM,GAAG;AACxB,aAAO;AAAA,IACX;AACA,UAAM,WAAW,MAAM,IAAI,UAAQ;AAC/B,YAAM,YAAY,WAAW,QAAQ,IAAI;AACzC,UAAI,cAAc,IAAI;AAClB,eAAO;AAAA,MACX;AACA,aAAO,IAAI,MAAM,WAAW,EAAE;AAAA,IAClC,CAAC,EAAE,KAAK,EAAE;AACV,UAAM,iBAAiB,SAAS,SAAS;AACzC,UAAM,gBAAgB,SAAS,SAAS;AACxC,UAAM,cAAc,SAAS,UAAU,GAAG,aAAa;AACvD,UAAM,eAAe,SAAS,UAAU,aAAa;AACrD,QAAI,eAAe,QACZ,YAAY,SAAS,OACrB,YAAY,SAAS,OACrB,YAAY,SAAS,OAAO,GAAG;AAClC,aAAO;AAAA,IACX;AACA,UAAM,UAAU,MAAM,QAAQ,OAAO,IAAI,QAAQ,WAAW,CAAC;AAC7D,UAAM,mBAAmB,MAAM,KAAK,SAAS,OAAO;AACpD,QAAI,qBAAqB,cAAc;AACnC,aAAO;AAAA,IACX;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,YAAY,YAAY;AAC1B,QAAI,KAAK,iBAAiB,IAAI;AAC1B,UAAI,cAAc,QAAQ,OAAO,eAAe,UAAU;AACtD,qBAAa;AAAA,MACjB;AACA,mBAAa,WAAW,WAAW,UAAU,MAAM,CAAC;AACpD,YAAM,sBAAsB;AAAA,QACxB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM,KAAK,QAAQ,UAAU;AAAA,QAC7B,YAAY;AAAA,MAChB;AACA,YAAM,YAAY,MAAMA,QAAO,UAAU,OAAO,KAAK,QAAQ,KAAK,MAAM,GAAG,UAAU,OAAO,CAAC,cAAc,WAAW,CAAC;AACvH,YAAM,iBAAiB;AAAA,QACnB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ;AAAA,MACZ;AACA,YAAM,uBAAuB;AAC7B,YAAM,gBAAgB,CAAC,MAAM;AAC7B,YAAM,UAAU,MAAMA,QAAO,UAAU,qBAAqB,WAAW,gBAAgB,sBAAsB,aAAa;AAC1H,YAAM,aAAa,MAAMA,QAAO,UAAU,OAAO,OAAO;AACxD,YAAM,YAAY,IAAI,WAAW,UAAU;AAC3C,YAAM,OAAO,MAAM,MAAM,SAAS;AAClC,WAAK,aAAa;AAAA,IACtB;AACA,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,gBAAgB;AAClB,QAAI,KAAK,iBAAiB,IAAI;AAC1B,YAAM,YAAY,KAAK,OAAO,MAAM,GAAG;AACvC,YAAM,OAAO,UAAU,IAAI,CAAC,MAAM;AAC9B,cAAM,YAAY,WAAW,QAAQ,CAAC;AACtC,YAAI,cAAc,IAAI;AAClB,iBAAO;AAAA,QACX;AACA,eAAO,IAAI,MAAM,WAAW,EAAE;AAAA,MAClC,CAAC,EAAE,KAAK,EAAE;AACV,YAAM,eAAe,KAAK,MAAM,KAAK,SAAS,EAAE,IAAI;AACpD,YAAM,cAAc,KAAK,MAAM,GAAG,YAAY;AAC9C,YAAM,eAAe,YAAY,MAAM,WAAW,GAAG,IAAI,CAACC,SAAQ,SAASA,MAAK,CAAC,CAAC;AAClF,UAAI,gBAAgB,MAAM;AACtB,cAAM,IAAI,MAAM,yBAAyB;AAAA,MAC7C;AACA,WAAK,eAAe,MAAM,MAAM,WAAW,KAAK,YAAY,CAAC;AAAA,IACjE;AACA,WAAO,KAAK;AAAA,EAChB;AACJ;;;AF7KA;AACA;AACA;AACA;AACA;AACA;AAQA,IAAM,SAAN,MAAM,QAAO;AAAA,EACT;AAAA,EACA;AAAA,EACA,UAAU;AAAA,EACV;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,IAAI,KAAK;AAAE,WAAO,KAAK,IAAI;AAAA,EAAK;AAAA,EAChC,IAAI,WAAW;AAAE,WAAO,KAAK;AAAA,EAAS;AAAA,EACtC,IAAI,aAAa;AAAE,WAAO,CAAC,KAAK;AAAA,EAAS;AAAA,EACzC,IAAI,WAAW;AACX,QAAI,KAAK,qBAAqB,eAAe;AACzC,aAAO,KAAK,UAAU;AAAA,IAC1B;AACA,WAAO;AAAA,EACX;AAAA,EACA,IAAI,OAAO;AACP,QAAI,OAAO,KAAK,UAAU,UAAU;AAChC,aAAO,KAAK;AAAA,IAChB;AACA,WAAO;AAAA,EACX;AAAA,EACA,YAAYC,KAAI,MAAM,UAAU;AAC5B,QAAI,KAAK,gBAAgB,SAAQ;AAC7B,YAAM,IAAI,MAAM,kEAAkE;AAAA,IACtF;AACA,SAAK,YAAY,CAAC;AAClB,SAAK,MAAMA;AACX,SAAK,YAAY,YAAY;AAC7B,SAAK,gBAAgB,IAAI,KAAK,iBAAQ;AACtC,SAAK,QAAQ,IAAI,KAAK;AACtB,SAAK,QAAQ,QAAQ;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,MAAM,SAASC,QAAO,GAAG,KAAKA,OAAM;AAChC,QAAIA,QAAO,IAAI;AACX,YAAM,OAAOA;AACb,MAAAA,QAAO;AACP,WAAK;AAAA,IACT;AACA,UAAM,UAAU,CAAC;AACjB,aAAS,IAAIA,OAAM,KAAK,IAAI,KAAK;AAC7B,UAAI,KAAK,UAAU,CAAC,KAAK,MAAM;AAC3B,gBAAQ,KAAK,CAAC;AAAA,MAClB;AAAA,IACJ;AACA,QAAI,QAAQ,SAAS,GAAG;AACpB,UAAI,UAAU,MAAM,KAAK,IAAI,OAAO;AACpC,YAAM,OAAO,CAAC;AACd,cAAQ,QAAQ,OAAK,KAAK,KAAK,EAAE,YAAY,EAAE,YAAY,OAAO,EAAE,MAAM,CAAC,CAAC;AAC5E,YAAM,WAAW,MAAM,KAAK,cAAc,OAAO,IAAI;AACrD,iBAAW,WAAW,UAAU;AAC5B,YAAI,QAAQ,cAAc;AACtB,gBAAM,IAAI,WAAW,6BAA6B;AACtD,YAAI,QAAQ,aAAa;AACrB,gBAAM,IAAI,WAAW,4BAA4B;AACrD,YAAI,QAAQ,SAAS;AACjB,gBAAM,IAAI,WAAW,wCAAwC;AACjE,cAAM,EAAE,YAAY,WAAW,MAAM,IAAI;AACzC,aAAK,UAAU,QAAQ,KAAK,IAAI,QAAQ,YAAY,YAAY,WAAW,KAAK;AAAA,MACpF;AAAA,IACJ;AACA,WAAO,KAAK,UAAU,MAAMA,OAAM,KAAK,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,kBAAkB,KAAK,YAAY,aAAaA,QAAO,GAAG;AAC5D,QAAI,CAAC,OAAO,cAAc,SAAS,KAAK,YAAY,GAAG;AACnD,YAAM,IAAI,WAAW,sBAAsB,SAAS,EAAE;AAAA,IAC1D;AACA,UAAM,WAAW,MAAM,KAAK,SAASA,OAAMA,QAAO,YAAY,CAAC;AAC/D,UAAM,YAAY,SAAS,IAAI,CAAC,EAAE,QAAQ,MAAM,OAAO;AACvD,UAAM,OAAO;AAAA,MACT,YAAY;AAAA,IAChB;AACA,UAAM,EAAE,OAAO,IAAI,MAAM,IAAI,KAAK,sBAAsB,IAAI;AAC5D,eAAW,OAAO,OAAO,KAAK,UAAU,CAAC,CAAC,GAAG;AACzC,YAAM,QAAQ,OAAO,GAAG;AACxB,UAAI,UAAU,qBAAqB;AAC/B,eAAO,QAAQ,YAAY,GAAG;AAAA,MAClC;AAAA,IACJ;AACA,WAAO,MAAM,KAAK,kBAAkB,KAAK,WAAWA,QAAO,SAAS;AAAA,EACxE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,QAAQ,KAAKA,QAAO,GAAG,KAAKA,OAAM;AACpC,QAAI,OAAO,QAAQ,YAAY,IAAI,gBAAgB,KAAK;AACpD,YAAM,IAAI,IAAI,GAAG;AAAA,IACrB;AACA,QAAI,IAAI,gBAAgB,KAAK;AACzB,YAAM,IAAI,UAAU,0BAA0B;AAAA,IAClD;AACA,UAAM,WAAW,MAAM,KAAK,SAASA,OAAM,EAAE;AAC7C,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACtC,UAAI;AACA,cAAM,SAAS,CAAC,EAAE,QAAQ,GAAG;AAAA,MACjC,SACO,KAAK;AACR,iBAAS,OAAO,KAAK,CAAC;AAAA,MAC1B;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,MAAM,KAAK,SAAS;AAChB,QAAI,UAAU;AACd,QAAI;AACA,YAAM,OAAO;AAAA,QACT,IAAI,KAAK;AAAA,QACT,UAAU;AAAA,QACV,MAAM;AAAA,MACV;AACA,UAAI,KAAK,qBAAqB,eAAe;AACzC,aAAK,WAAW,KAAK,UAAU;AAAA,MACnC;AACA,UAAI,OAAO,KAAK,UAAU,UAAU;AAChC,aAAK,OAAO,KAAK;AAAA,MACrB;AACA,kBAAY,MAAM,KAAK,MAAM,IAAI,KAAK,IAAI,SAAS,IAAI;AACvD,YAAM,QAAQ,IAAI,KAAK,UAAU,IAAI,CAAC,MAAM,EAAE,KAAK,OAAO,CAAC,CAAC;AAC5D,UAAI,CAAC,SAAS;AACV,cAAM;AAAA,MACV;AAAA,IACJ,SACO,KAAK;AACR,YAAM,IAAI,MAAM,uBAAuB;AAAA,IAC3C;AACA,SAAK,UAAU;AACf,SAAK,YAAY;AACjB,SAAK,QAAQ;AACb,WAAO;AAAA,EACX;AAAA,EACA,MAAM,OAAO,SAAS;AAClB,QAAI;AACA,YAAM,EAAE,IAAAD,KAAI,UAAU,KAAK,IAAI,MAAM,KAAK,MAAM,IAAI,KAAK,IAAI,OAAO;AACpE,UAAIA,QAAO,KAAK,IAAI;AAChB,cAAM;AAAA,MACV;AACA,YAAM,QAAQ,IAAI,KAAK,UAAU,IAAI,CAAC,MAAM,EAAE,OAAO,OAAO,CAAC,CAAC;AAC9D,UAAI,YAAY,MAAM;AAClB,aAAK,YAAY,MAAM,cAAc,WAAW,QAAQ;AAAA,MAC5D;AACA,UAAI,QAAQ,MAAM;AACd,aAAK,QAAQ;AAAA,MACjB;AACA,WAAK,UAAU;AAAA,IACnB,SACO,KAAK;AACR,YAAM,IAAI,MAAM,yBAAyB;AAAA,IAC7C;AACA,WAAO;AAAA,EACX;AACJ;AAuBO,IAAM,cAAN,MAAM,qBAAoB,OAAO;AAAA,EACpC,OAAO,cAAc;AAAA,EACrB,OAAO,gBAAgB,IAAI,KAAK,iBAAQ;AAAA,EACxC,YAAYA,KAAI,MAAM,UAAU;AAC5B,QAAI,CAAC,aAAY,aAAa;AAC1B,YAAM,IAAI,MAAM,wFAAwF;AAAA,IAC5G;AACA,iBAAY,cAAc;AAC1B,UAAMA,KAAI,MAAM,QAAQ;AAAA,EAC5B;AAAA,EACA,aAAa,OAAO,SAAS,OAAO,IAAI;AACpC,QAAI;AACA,YAAM,IAAI,MAAM,QAAQ,OAAO;AAC/B,aAAO,MAAM,aAAY,YAAY,SAAS,EAAE,KAAK,IAAI;AAAA,IAC7D,SACO,KAAK;AACR,YAAM,IAAI,MAAM,mCAAmC,GAAG,EAAE;AAAA,IAC5D;AAAA,EACJ;AAAA,EACA,aAAa,YAAY,SAAS,SAAS,OAAO,IAAI;AAClD,QAAI;AACA,YAAMA,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,YAAM,IAAI,MAAM,QAAQ,OAAO,OAAO;AACtC,YAAM,IAAI,MAAM,cAAc,YAAY,EAAE,GAAG;AAC/C,YAAM,IAAI,MAAM,EAAE,YAAY,IAAI;AAClC,mBAAY,cAAc;AAC1B,YAAM,SAAS,IAAI,KAAKA,KAAI,GAAG,CAAC;AAChC,YAAM,OAAO,KAAK,OAAO;AACzB,aAAO;AAAA,IACX,SACO,KAAK;AACR,YAAM,IAAI,MAAM,6CAA6C,GAAG,EAAE;AAAA,IACtE;AAAA,EACJ;AAAA,EACA,aAAa,aAAa,SAAS,UAAU,OAAO,IAAI;AACpD,QAAI;AACA,YAAMA,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,YAAM,IAAI,MAAM,cAAc,WAAW,QAAQ;AACjD,YAAM,IAAI,MAAM,EAAE,YAAY,IAAI;AAClC,mBAAY,cAAc;AAC1B,YAAM,SAAS,IAAI,KAAKA,KAAI,GAAG,CAAC;AAChC,YAAM,OAAO,KAAK,OAAO;AACzB,aAAO;AAAA,IACX,SACO,KAAK;AACR,YAAM,IAAI,MAAM,8CAA8C,GAAG,EAAE;AAAA,IACvE;AAAA,EACJ;AAAA,EACA,aAAa,SAAS,SAAS,MAAM;AACjC,QAAI,KAAK,WAAW,mBAAmB;AACnC,YAAM,IAAI,MAAM,cAAc,iBAAiB,iCAAiC,KAAK,MAAM,oBAAoB;AAAA,IACnH;AACA,QAAI,CAAC,kBAAkB,KAAK,IAAI,GAAG;AAC/B,YAAM,IAAI,MAAM,+CAA+C;AAAA,IACnE;AACA,UAAMA,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,iBAAY,cAAc;AAC1B,UAAM,SAAS,IAAI,KAAKA,KAAI,IAAI;AAChC,UAAM,OAAO,KAAK,OAAO;AACzB,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,QAAQA,KAAI;AACrB,QAAI,OAAOA,QAAO,YAAYA,QAAO,IAAI;AACrC,YAAM,IAAI,UAAU,kCAAkC;AAAA,IAC1D;AACA,iBAAY,cAAc;AAC1B,WAAO,IAAI,KAAK,MAAM,QAAQ,OAAOA,GAAE,GAAG,EAAE;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAI,SAAS;AACf,UAAM,OAAO,CAAC;AACd,YAAQ,QAAQ,OAAK,KAAK,KAAK,EAAE,MAAM,KAAK,MAAM,OAAO,EAAE,CAAC,CAAC;AAC7D,UAAM,cAAc,MAAM,aAAY,cAAc,OAAO,IAAI;AAC/D,WAAO;AAAA,EACX;AACJ;AAiBO,IAAM,gBAAN,MAAM,uBAAsB,OAAO;AAAA,EACtC,OAAO,cAAc;AAAA,EACrB,YAAYA,KAAI,MAAM,UAAU;AAC5B,QAAI,CAAC,eAAc,aAAa;AAC5B,YAAM,IAAI,MAAM,4FAA4F;AAAA,IAChH;AACA,mBAAc,cAAc;AAC5B,UAAMA,KAAI,MAAM,QAAQ;AAAA,EAC5B;AAAA,EACA,aAAa,OAAO,SAAS;AACzB,QAAI;AACA,YAAM,OAAO,MAAM,QAAQ,OAAO;AAClC,aAAO,MAAM,eAAc,SAAS,SAAS,KAAK,GAAG;AAAA,IACzD,SACO,KAAK;AACR,YAAM,IAAI,MAAM,qCAAqC,GAAG,EAAE;AAAA,IAC9D;AAAA,EACJ;AAAA,EACA,aAAa,SAAS,SAAS,MAAM;AACjC,QAAI,KAAK,WAAW,qBAAqB;AACrC,YAAM,IAAI,MAAM,cAAc,mBAAmB,iCAAiC,KAAK,MAAM,oBAAoB;AAAA,IACrH;AACA,QAAI,CAAC,kBAAkB,KAAK,IAAI,GAAG;AAC/B,YAAM,IAAI,MAAM,+CAA+C;AAAA,IACnE;AACA,UAAMA,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,UAAM,IAAI;AACV,UAAM,IAAI,MAAM,cAAc,YAAY,IAAI;AAC9C,mBAAc,cAAc;AAC5B,UAAM,SAAS,IAAI,KAAKA,KAAI,GAAG,CAAC;AAChC,UAAM,OAAO,KAAK,OAAO;AACzB,WAAO;AAAA,EACX;AAAA,EACA,aAAa,aAAa,SAAS,UAAU;AACzC,QAAI;AACA,YAAMA,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,YAAM,IAAI,MAAM,cAAc,WAAW,QAAQ;AACjD,YAAM,IAAI,MAAM,EAAE,cAAc;AAChC,qBAAc,cAAc;AAC5B,YAAM,SAAS,IAAI,KAAKA,KAAI,GAAG,CAAC;AAChC,YAAM,OAAO,KAAK,OAAO;AACzB,aAAO;AAAA,IACX,SACO,KAAK;AACR,YAAM,IAAI,MAAM,gDAAgD,GAAG,EAAE;AAAA,IACzE;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,QAAQA,KAAI;AACrB,QAAI,OAAOA,QAAO,YAAYA,QAAO,IAAI;AACrC,YAAM,IAAI,UAAU,kCAAkC;AAAA,IAC1D;AACA,mBAAc,cAAc;AAC5B,WAAO,IAAI,KAAK,MAAM,QAAQ,OAAOA,GAAE,GAAG,EAAE;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAI,SAAS;AACf,UAAM,UAAU,QAAQ,IAAI,WAAS;AACjC,YAAM,WAAW,MAAM,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,EAAE,YAAY;AACjE,YAAM,WAAW,GAAG,KAAK,IAAI,GAAG,QAAQ,GAAG,SAAS,IAAI,GAAG;AAC3D,YAAM,cAAc,SAAS,MAAM,SAAS,KAAK,CAAC,GAAG,IAAI,OAAK,SAAS,GAAG,EAAE,CAAC;AAC7E,YAAM,aAAa,WAAW,KAAK,UAAU;AAC7C,YAAM,aAAa,IAAI,QAAQ,EAAE,EAAE,OAAO,UAAU,EAAE,OAAO,KAAK;AAClE,aAAO,EAAE,YAAY,MAAM;AAAA,IAC/B,CAAC;AACD,WAAO;AAAA,EACX;AACJ;AAYO,IAAM,eAAN,MAAM,sBAAqB,OAAO;AAAA,EACrC,OAAO,cAAc;AAAA,EACrB;AAAA,EACA,IAAI,SAAS;AAAE,WAAO,KAAK;AAAA,EAAS;AAAA,EACpC,YAAYA,KAAI,QAAQ;AACpB,QAAI,CAAC,cAAa,aAAa;AAC3B,YAAM,IAAI,MAAM,0FAA0F;AAAA,IAC9G;AACA,kBAAa,cAAc;AAC3B,UAAMA,GAAE;AACR,SAAK,UAAU;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,SAAS;AAClB,UAAM,EAAE,QAAAE,QAAO,IAAI,MAAM;AACzB,UAAM,IAAI,MAAMA,QAAO,KAAK;AAC5B,UAAMF,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,kBAAa,cAAc;AAC3B,WAAO,IAAI,KAAKA,KAAI,CAAC;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,QAAQA,KAAI;AACrB,QAAI,OAAOA,QAAO,YAAYA,QAAO,IAAI;AACrC,YAAM,IAAI,UAAU,kCAAkC;AAAA,IAC1D;AACA,UAAM,EAAE,QAAAE,QAAO,IAAI,MAAM;AACzB,UAAM,IAAI,MAAMA,QAAO,KAAK;AAC5B,kBAAa,cAAc;AAC3B,WAAO,IAAI,KAAK,MAAM,QAAQ,OAAOF,GAAE,GAAG,CAAC;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAI,SAAS;AACf,UAAM,UAAU,CAAC;AACjB,eAAW,SAAS,SAAS;AACzB,YAAM,EAAE,QAAQ,UAAU,IAAI,MAAM,KAAK,OAAO,QAAQ,KAAK;AAC7D,UAAI,WAAW,QAAQ,aAAa,MAAM;AACtC,gBAAQ,KAAK,EAAE,WAAW,MAAM,CAAC;AAAA,MACrC,OACK;AACD,cAAM,IAAI,MAAM,iCAAiC,MAAM,EAAE;AAAA,MAC7D;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,OAAO;AACT,QAAI,KAAK,UAAU,MAAM;AACrB,aAAO;AAAA,IACX;AACA,UAAM,SAAS,MAAM,KAAK,OAAO,MAAM;AACvC,WAAO,WAAW;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,SAAS;AACX,QAAI,KAAK,UAAU,MAAM;AACrB,aAAO;AAAA,IACX;AACA,UAAM,SAAS,MAAM,KAAK,OAAO,QAAQ;AACzC,WAAO,WAAW;AAAA,EACtB;AACJ;;;AGtfA,WAAW,YAAY;",
-  "names": ["last", "base32", "bin", "bytes", "buffer", "hex", "utf8", "process", "crypto", "bytes", "buffer", "hash", "hex", "hex", "subtle", "hash", "hex", "ReflectApply", "ReflectOwnKeys", "NumberIsNaN", "EventEmitter", "once", "HwTransportErrorType", "id", "log", "init_lib_es", "context", "init_lib_es", "context", "EventEmitter", "id", "first", "id", "from", "require_valid", "first", "require_semver", "init_lib_es", "DeviceModelId", "_a", "semver", "id", "__awaiter", "from", "v", "d", "b", "Subscription", "_a", "_a", "Subscriber", "ConsumerObserver", "SafeSubscriber", "_a", "Observable", "observable", "OperatorSubscriber", "err", "_a", "Subject", "_a", "observable", "AnonymousSubject", "ReplaySubject", "_a", "last", "_a", "process", "iterator", "_a", "iterator", "config", "buffer", "_a", "_a", "buffer", "init_lib_es", "context", "TagId", "init_lib_es", "context", "init_lib_es", "characteristic", "init_lib_es", "__awaiter", "buffer", "id", "devices", "init_lib_es", "init_lib_es", "devices", "__awaiter", "buffer", "ledgerDevices", "getLedgerDevices", "devices", "getFirstLedgerDevice", "isSupported", "init_lib_es", "buffer", "__awaiter", "open", "statusCode", "status", "hash", "hash", "Ledger", "hash", "from", "Tools", "subtle", "bin", "id", "from", "Ledger"]
+  "sources": ["lib/blake2b.js", "lib/constants.js", "lib/convert.js", "lib/rpc.js", "lib/entropy.js", "lib/safe.js", "lib/pool.js", "lib/workers/nano-nacl.js", "lib/account.js", "lib/workers/bip44-ckd.js", "lib/workers/powgl.js", "lib/workers/powgpu.js", "lib/workers.js", "../node_modules/events/events.js", "../node_modules/@ledgerhq/errors/src/helpers.ts", "../node_modules/@ledgerhq/errors/src/index.ts", "../node_modules/@ledgerhq/logs/src/index.ts", "../node_modules/@ledgerhq/hw-transport/src/Transport.ts", "../node_modules/semver/internal/constants.js", "../node_modules/semver/internal/debug.js", "../node_modules/semver/internal/re.js", "../node_modules/semver/internal/parse-options.js", "../node_modules/semver/internal/identifiers.js", "../node_modules/semver/classes/semver.js", "../node_modules/semver/functions/parse.js", "../node_modules/semver/functions/valid.js", "../node_modules/semver/functions/clean.js", "../node_modules/semver/functions/inc.js", "../node_modules/semver/functions/diff.js", "../node_modules/semver/functions/major.js", "../node_modules/semver/functions/minor.js", "../node_modules/semver/functions/patch.js", "../node_modules/semver/functions/prerelease.js", "../node_modules/semver/functions/compare.js", "../node_modules/semver/functions/rcompare.js", "../node_modules/semver/functions/compare-loose.js", "../node_modules/semver/functions/compare-build.js", "../node_modules/semver/functions/sort.js", "../node_modules/semver/functions/rsort.js", "../node_modules/semver/functions/gt.js", "../node_modules/semver/functions/lt.js", "../node_modules/semver/functions/eq.js", "../node_modules/semver/functions/neq.js", "../node_modules/semver/functions/gte.js", "../node_modules/semver/functions/lte.js", "../node_modules/semver/functions/cmp.js", "../node_modules/semver/functions/coerce.js", "../node_modules/semver/internal/lrucache.js", "../node_modules/semver/classes/range.js", "../node_modules/semver/classes/comparator.js", "../node_modules/semver/functions/satisfies.js", "../node_modules/semver/ranges/to-comparators.js", "../node_modules/semver/ranges/max-satisfying.js", "../node_modules/semver/ranges/min-satisfying.js", "../node_modules/semver/ranges/min-version.js", "../node_modules/semver/ranges/valid.js", "../node_modules/semver/ranges/outside.js", "../node_modules/semver/ranges/gtr.js", "../node_modules/semver/ranges/ltr.js", "../node_modules/semver/ranges/intersects.js", "../node_modules/semver/ranges/simplify.js", "../node_modules/semver/ranges/subset.js", "../node_modules/semver/index.js", "../node_modules/@ledgerhq/devices/src/index.ts", "../node_modules/tslib/tslib.es6.mjs", "../node_modules/rxjs/src/internal/util/isFunction.ts", "../node_modules/rxjs/src/internal/util/createErrorClass.ts", "../node_modules/rxjs/src/internal/util/UnsubscriptionError.ts", "../node_modules/rxjs/src/internal/util/arrRemove.ts", "../node_modules/rxjs/src/internal/Subscription.ts", "../node_modules/rxjs/src/internal/config.ts", "../node_modules/rxjs/src/internal/scheduler/timeoutProvider.ts", "../node_modules/rxjs/src/internal/util/reportUnhandledError.ts", "../node_modules/rxjs/src/internal/util/noop.ts", "../node_modules/rxjs/src/internal/NotificationFactories.ts", "../node_modules/rxjs/src/internal/util/errorContext.ts", "../node_modules/rxjs/src/internal/Subscriber.ts", "../node_modules/rxjs/src/internal/symbol/observable.ts", "../node_modules/rxjs/src/internal/util/identity.ts", "../node_modules/rxjs/src/internal/util/pipe.ts", "../node_modules/rxjs/src/internal/Observable.ts", "../node_modules/rxjs/src/internal/util/lift.ts", "../node_modules/rxjs/src/internal/operators/OperatorSubscriber.ts", "../node_modules/rxjs/src/internal/util/ObjectUnsubscribedError.ts", "../node_modules/rxjs/src/internal/Subject.ts", "../node_modules/rxjs/src/internal/scheduler/dateTimestampProvider.ts", "../node_modules/rxjs/src/internal/ReplaySubject.ts", "../node_modules/rxjs/src/internal/observable/empty.ts", "../node_modules/rxjs/src/internal/util/isScheduler.ts", "../node_modules/rxjs/src/internal/util/args.ts", "../node_modules/rxjs/src/internal/util/isArrayLike.ts", "../node_modules/rxjs/src/internal/util/isPromise.ts", "../node_modules/rxjs/src/internal/util/isInteropObservable.ts", "../node_modules/rxjs/src/internal/util/isAsyncIterable.ts", "../node_modules/rxjs/src/internal/util/throwUnobservableError.ts", "../node_modules/rxjs/src/internal/symbol/iterator.ts", "../node_modules/rxjs/src/internal/util/isIterable.ts", "../node_modules/rxjs/src/internal/util/isReadableStreamLike.ts", "../node_modules/rxjs/src/internal/observable/innerFrom.ts", "../node_modules/rxjs/src/internal/util/executeSchedule.ts", "../node_modules/rxjs/src/internal/operators/observeOn.ts", "../node_modules/rxjs/src/internal/operators/subscribeOn.ts", "../node_modules/rxjs/src/internal/scheduled/scheduleObservable.ts", "../node_modules/rxjs/src/internal/scheduled/schedulePromise.ts", "../node_modules/rxjs/src/internal/scheduled/scheduleArray.ts", "../node_modules/rxjs/src/internal/scheduled/scheduleIterable.ts", "../node_modules/rxjs/src/internal/scheduled/scheduleAsyncIterable.ts", "../node_modules/rxjs/src/internal/scheduled/scheduleReadableStreamLike.ts", "../node_modules/rxjs/src/internal/scheduled/scheduled.ts", "../node_modules/rxjs/src/internal/observable/from.ts", "../node_modules/rxjs/src/internal/util/EmptyError.ts", "../node_modules/rxjs/src/internal/firstValueFrom.ts", "../node_modules/rxjs/src/internal/operators/map.ts", "../node_modules/rxjs/src/internal/operators/mergeInternals.ts", "../node_modules/rxjs/src/internal/operators/mergeMap.ts", "../node_modules/rxjs/src/internal/operators/mergeAll.ts", "../node_modules/rxjs/src/internal/observable/defer.ts", "../node_modules/rxjs/src/internal/observable/merge.ts", "../node_modules/rxjs/src/internal/operators/filter.ts", "../node_modules/rxjs/dist/esm5/internal/types.js", "../node_modules/rxjs/src/internal/operators/defaultIfEmpty.ts", "../node_modules/rxjs/src/internal/operators/take.ts", "../node_modules/rxjs/src/internal/operators/ignoreElements.ts", "../node_modules/rxjs/src/internal/operators/throwIfEmpty.ts", "../node_modules/rxjs/src/internal/operators/first.ts", "../node_modules/rxjs/src/internal/operators/share.ts", "../node_modules/rxjs/src/internal/operators/takeUntil.ts", "../node_modules/rxjs/src/internal/operators/tap.ts", "../node_modules/rxjs/src/index.ts", "../node_modules/@ledgerhq/devices/src/ble/sendAPDU.ts", "../node_modules/@ledgerhq/devices/src/ble/receiveAPDU.ts", "../node_modules/rxjs/src/operators/index.ts", "../node_modules/@ledgerhq/hw-transport-web-ble/src/monitorCharacteristic.ts", "../node_modules/@ledgerhq/hw-transport-web-ble/src/TransportWebBLE.ts", "../node_modules/@ledgerhq/devices/src/hid-framing.ts", "../node_modules/@ledgerhq/hw-transport-webusb/src/webusb.ts", "../node_modules/@ledgerhq/hw-transport-webusb/src/TransportWebUSB.ts", "../node_modules/@ledgerhq/hw-transport-webhid/src/TransportWebHID.ts", "lib/ledger.js", "lib/block.js", "lib/tools.js", "main.js", "lib/rolodex.js", "lib/wallet.js", "lib/bip39-wordlist.js", "lib/bip39-mnemonic.js", "global.js"],
+  "sourcesContent": ["// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n/**\n* Implementation derived from blake2b@2.1.4. Copyright 2017 Emil Bay\n* <github@tixz.dk> (https://github.com/emilbayes/blake2b). See LICENSES/ISC.txt\n*\n* Modified to eliminate dependencies, port to TypeScript, and embed in web\n* workers.\n*\n* Original source commit: https://github.com/emilbayes/blake2b/blob/1f63e02e3f226642959506cdaa67c8819ff145cd/index.js\n*/\nexport class Blake2b {\n    static BYTES_MIN = 1;\n    static BYTES_MAX = 64;\n    static KEYBYTES_MIN = 16;\n    static KEYBYTES_MAX = 64;\n    static SALTBYTES = 16;\n    static PERSONALBYTES = 16;\n    // Initialization Vector\n    static BLAKE2B_IV32 = new Uint32Array([\n        0xF3BCC908, 0x6A09E667, 0x84CAA73B, 0xBB67AE85,\n        0xFE94F82B, 0x3C6EF372, 0x5F1D36F1, 0xA54FF53A,\n        0xADE682D1, 0x510E527F, 0x2B3E6C1F, 0x9B05688C,\n        0xFB41BD6B, 0x1F83D9AB, 0x137E2179, 0x5BE0CD19\n    ]);\n    static SIGMA8 = [\n        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n        14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,\n        11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,\n        7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,\n        9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,\n        2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,\n        12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11,\n        13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10,\n        6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5,\n        10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0,\n        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n        14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3\n    ];\n    /**\n    * These are offsets into a uint64 buffer.\n    * Multiply them all by 2 to make them offsets into a uint32 buffer,\n    * because this is Javascript and we don't have uint64s\n    */\n    static SIGMA82 = new Uint8Array(this.SIGMA8.map(x => x * 2));\n    // reusable parameter_block\n    static parameter_block = new Uint8Array([\n        0, 0, 0, 0, //  0: outlen, keylen, fanout, depth\n        0, 0, 0, 0, //  4: leaf length, sequential mode\n        0, 0, 0, 0, //  8: node offset\n        0, 0, 0, 0, // 12: node offset\n        0, 0, 0, 0, // 16: node depth, inner length, rfu\n        0, 0, 0, 0, // 20: rfu\n        0, 0, 0, 0, // 24: rfu\n        0, 0, 0, 0, // 28: rfu\n        0, 0, 0, 0, // 32: salt\n        0, 0, 0, 0, // 36: salt\n        0, 0, 0, 0, // 40: salt\n        0, 0, 0, 0, // 44: salt\n        0, 0, 0, 0, // 48: personal\n        0, 0, 0, 0, // 52: personal\n        0, 0, 0, 0, // 56: personal\n        0, 0, 0, 0 // 60: personal\n    ]);\n    static v = new Uint32Array(32);\n    static m = new Uint32Array(32);\n    /**\n    * 64-bit unsigned addition\n    * Sets v[a,a+1] += v[b,b+1]\n    * v should be a Uint32Array\n    */\n    static ADD64AA(v, a, b) {\n        var o0 = v[a] + v[b];\n        var o1 = v[a + 1] + v[b + 1];\n        if (o0 >= 0x100000000) {\n            o1++;\n        }\n        v[a] = o0;\n        v[a + 1] = o1;\n    }\n    /**\n    * 64-bit unsigned addition\n    * Sets v[a,a+1] += b\n    * b0 is the low 32 bits of b, b1 represents the high 32 bits\n    */\n    static ADD64AC(v, a, b0, b1) {\n        var o0 = v[a] + b0;\n        if (b0 < 0) {\n            o0 += 0x100000000;\n        }\n        var o1 = v[a + 1] + b1;\n        if (o0 >= 0x100000000) {\n            o1++;\n        }\n        v[a] = o0;\n        v[a + 1] = o1;\n    }\n    // Little-endian byte access\n    static B2B_GET32(arr, i) {\n        return (arr[i] ^\n            (arr[i + 1] << 8) ^\n            (arr[i + 2] << 16) ^\n            (arr[i + 3] << 24));\n    }\n    /**\n    * G Mixing function\n    * The ROTRs are inlined for speed\n    */\n    static B2B_G(a, b, c, d, ix, iy) {\n        var x0 = Blake2b.m[ix];\n        var x1 = Blake2b.m[ix + 1];\n        var y0 = Blake2b.m[iy];\n        var y1 = Blake2b.m[iy + 1];\n        Blake2b.ADD64AA(Blake2b.v, a, b); // v[a,a+1] += v[b,b+1] ... in JS we must store a uint64 as two uint32s\n        Blake2b.ADD64AC(Blake2b.v, a, x0, x1); // v[a, a+1] += x ... x0 is the low 32 bits of x, x1 is the high 32 bits\n        // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated to the right by 32 bits\n        var xor0 = Blake2b.v[d] ^ Blake2b.v[a];\n        var xor1 = Blake2b.v[d + 1] ^ Blake2b.v[a + 1];\n        Blake2b.v[d] = xor1;\n        Blake2b.v[d + 1] = xor0;\n        Blake2b.ADD64AA(Blake2b.v, c, d);\n        // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 24 bits\n        xor0 = Blake2b.v[b] ^ Blake2b.v[c];\n        xor1 = Blake2b.v[b + 1] ^ Blake2b.v[c + 1];\n        Blake2b.v[b] = (xor0 >>> 24) ^ (xor1 << 8);\n        Blake2b.v[b + 1] = (xor1 >>> 24) ^ (xor0 << 8);\n        Blake2b.ADD64AA(Blake2b.v, a, b);\n        Blake2b.ADD64AC(Blake2b.v, a, y0, y1);\n        // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated right by 16 bits\n        xor0 = Blake2b.v[d] ^ Blake2b.v[a];\n        xor1 = Blake2b.v[d + 1] ^ Blake2b.v[a + 1];\n        Blake2b.v[d] = (xor0 >>> 16) ^ (xor1 << 16);\n        Blake2b.v[d + 1] = (xor1 >>> 16) ^ (xor0 << 16);\n        Blake2b.ADD64AA(Blake2b.v, c, d);\n        // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 63 bits\n        xor0 = Blake2b.v[b] ^ Blake2b.v[c];\n        xor1 = Blake2b.v[b + 1] ^ Blake2b.v[c + 1];\n        Blake2b.v[b] = (xor1 >>> 31) ^ (xor0 << 1);\n        Blake2b.v[b + 1] = (xor0 >>> 31) ^ (xor1 << 1);\n    }\n    /**\n    * Compression function. 'last' flag indicates last block.\n    * Note we're representing 16 uint64s as 32 uint32s\n    */\n    static blake2bCompress(ctx, last) {\n        let i = 0;\n        // init work variables\n        for (i = 0; i < 16; i++) {\n            Blake2b.v[i] = ctx.h[i];\n            Blake2b.v[i + 16] = Blake2b.BLAKE2B_IV32[i];\n        }\n        // low 64 bits of offset\n        Blake2b.v[24] = Blake2b.v[24] ^ ctx.t;\n        Blake2b.v[25] = Blake2b.v[25] ^ (ctx.t / 0x100000000);\n        // high 64 bits not supported, offset may not be higher than 2**53-1\n        // last block flag set ?\n        if (last) {\n            Blake2b.v[28] = ~Blake2b.v[28];\n            Blake2b.v[29] = ~Blake2b.v[29];\n        }\n        // get little-endian words\n        for (i = 0; i < 32; i++) {\n            Blake2b.m[i] = Blake2b.B2B_GET32(ctx.b, 4 * i);\n        }\n        // twelve rounds of mixing\n        for (i = 0; i < 12; i++) {\n            Blake2b.B2B_G(0, 8, 16, 24, Blake2b.SIGMA82[i * 16 + 0], Blake2b.SIGMA82[i * 16 + 1]);\n            Blake2b.B2B_G(2, 10, 18, 26, Blake2b.SIGMA82[i * 16 + 2], Blake2b.SIGMA82[i * 16 + 3]);\n            Blake2b.B2B_G(4, 12, 20, 28, Blake2b.SIGMA82[i * 16 + 4], Blake2b.SIGMA82[i * 16 + 5]);\n            Blake2b.B2B_G(6, 14, 22, 30, Blake2b.SIGMA82[i * 16 + 6], Blake2b.SIGMA82[i * 16 + 7]);\n            Blake2b.B2B_G(0, 10, 20, 30, Blake2b.SIGMA82[i * 16 + 8], Blake2b.SIGMA82[i * 16 + 9]);\n            Blake2b.B2B_G(2, 12, 22, 24, Blake2b.SIGMA82[i * 16 + 10], Blake2b.SIGMA82[i * 16 + 11]);\n            Blake2b.B2B_G(4, 14, 16, 26, Blake2b.SIGMA82[i * 16 + 12], Blake2b.SIGMA82[i * 16 + 13]);\n            Blake2b.B2B_G(6, 8, 18, 28, Blake2b.SIGMA82[i * 16 + 14], Blake2b.SIGMA82[i * 16 + 15]);\n        }\n        for (i = 0; i < 16; i++) {\n            ctx.h[i] = ctx.h[i] ^ Blake2b.v[i] ^ Blake2b.v[i + 16];\n        }\n    }\n    /**\n    * Updates a BLAKE2b streaming hash\n    * Requires hash context and Uint8Array (byte array)\n    */\n    static blake2bUpdate(ctx, input) {\n        for (var i = 0; i < input.length; i++) {\n            if (ctx.c === 128) { // buffer full ?\n                ctx.t += ctx.c; // add counters\n                Blake2b.blake2bCompress(ctx, false); // compress (not last)\n                ctx.c = 0; // counter to zero\n            }\n            ctx.b[ctx.c++] = input[i];\n        }\n    }\n    /**\n    * Completes a BLAKE2b streaming hash\n    * Returns a Uint8Array containing the message digest\n    */\n    static blake2bFinal(ctx, out) {\n        ctx.t += ctx.c; // mark last block offset\n        while (ctx.c < 128) { // fill up with zeros\n            ctx.b[ctx.c++] = 0;\n        }\n        Blake2b.blake2bCompress(ctx, true); // final block flag = 1\n        for (var i = 0; i < ctx.outlen; i++) {\n            out[i] = ctx.h[i >> 2] >> (8 * (i & 3));\n        }\n        return out;\n    }\n    static hexSlice(buf) {\n        let str = '';\n        for (let i = 0; i < buf.length; i++)\n            str += Blake2b.toHex(buf[i]);\n        return str;\n    }\n    static toHex(n) {\n        if (typeof n !== 'number')\n            throw new TypeError(`expected number to convert to hex; received ${typeof n}`);\n        if (n < 0 || n > 255)\n            throw new RangeError(`expected byte value 0-255; received ${n}`);\n        return n.toString(16).padStart(2, '0');\n    }\n    b;\n    h;\n    t;\n    c;\n    outlen;\n    /**\n    * Creates a BLAKE2b hashing context\n    * Requires an output length between 1 and 64 bytes\n    * Takes an optional Uint8Array key\n    */\n    constructor(outlen, key, salt, personal, noAssert) {\n        if (noAssert !== true) {\n            if (outlen < Blake2b.BYTES_MIN)\n                throw new RangeError(`expected outlen >= ${Blake2b.BYTES_MIN}; actual ${outlen}`);\n            if (outlen > Blake2b.BYTES_MAX)\n                throw new RangeError(`expectd outlen <= ${Blake2b.BYTES_MAX}; actual ${outlen}`);\n            if (key != null) {\n                if (!(key instanceof Uint8Array))\n                    throw new TypeError(`key must be Uint8Array or Buffer`);\n                if (key.length < Blake2b.KEYBYTES_MIN)\n                    throw new RangeError(`expected key >= ${Blake2b.KEYBYTES_MIN}; actual ${key.length}`);\n                if (key.length > Blake2b.KEYBYTES_MAX)\n                    throw new RangeError(`expected key <= ${Blake2b.KEYBYTES_MAX}; actual ${key.length}`);\n            }\n            if (salt != null) {\n                if (!(salt instanceof Uint8Array))\n                    throw new TypeError(`salt must be Uint8Array or Buffer`);\n                if (salt.length !== Blake2b.SALTBYTES)\n                    throw new RangeError(`expected salt ${Blake2b.SALTBYTES} bytes; actual ${salt.length} bytes`);\n            }\n            if (personal != null) {\n                if (!(personal instanceof Uint8Array))\n                    throw new TypeError(`personal must be Uint8Array or Buffer`);\n                if (personal.length !== Blake2b.PERSONALBYTES)\n                    throw new RangeError(`expected personal ${Blake2b.PERSONALBYTES} bytes; actual ${personal.length} bytes`);\n            }\n        }\n        this.b = new Uint8Array(128);\n        this.h = new Uint32Array(16);\n        this.t = 0; // input count\n        this.c = 0; // pointer within buffer\n        this.outlen = outlen; // output length in bytes\n        // zero out parameter_block before usage\n        Blake2b.parameter_block.fill(0);\n        // state, 'param block'\n        Blake2b.parameter_block[0] = outlen;\n        if (key)\n            Blake2b.parameter_block[1] = key.length;\n        Blake2b.parameter_block[2] = 1; // fanout\n        Blake2b.parameter_block[3] = 1; // depth\n        if (salt)\n            Blake2b.parameter_block.set(salt, 32);\n        if (personal)\n            Blake2b.parameter_block.set(personal, 48);\n        // initialize hash state\n        for (var i = 0; i < 16; i++) {\n            this.h[i] = Blake2b.BLAKE2B_IV32[i] ^ Blake2b.B2B_GET32(Blake2b.parameter_block, i * 4);\n        }\n        // key the hash, if applicable\n        if (key) {\n            Blake2b.blake2bUpdate(this, key);\n            // at the end\n            this.c = 128;\n        }\n    }\n    update(input) {\n        if (!(input instanceof Uint8Array))\n            throw new TypeError(`input must be Uint8Array or Buffer`);\n        Blake2b.blake2bUpdate(this, input);\n        return this;\n    }\n    digest(out) {\n        const buf = (!out || out === 'binary' || out === 'hex') ? new Uint8Array(this.outlen) : out;\n        if (!(buf instanceof Uint8Array))\n            throw new TypeError(`out must be \"binary\", \"hex\", Uint8Array, or Buffer`);\n        if (buf.length < this.outlen)\n            throw new RangeError(`out must have at least outlen bytes of space`);\n        Blake2b.blake2bFinal(this, buf);\n        if (out === 'hex')\n            return Blake2b.hexSlice(buf);\n        return buf;\n    }\n}\nexport default Blake2b.toString();\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nexport const ACCOUNT_KEY_LENGTH = 64;\nexport const ADDRESS_GAP = 20;\nexport const ALPHABET = '13456789abcdefghijkmnopqrstuwxyz';\nexport const BIP39_ITERATIONS = 2048;\nexport const BIP44_PURPOSE = 44;\nexport const BIP44_COIN_NANO = 165;\nexport const BURN_ADDRESS = 'nano_1111111111111111111111111111111111111111111111111111hifc8npp';\nexport const HARDENED_OFFSET = 0x80000000;\nexport const NONCE_LENGTH = 24;\nexport const PREAMBLE = '0000000000000000000000000000000000000000000000000000000000000006';\nexport const PREFIX = 'nano_';\nexport const PREFIX_LEGACY = 'xrb_';\nexport const SEED_LENGTH_BIP44 = 128;\nexport const SEED_LENGTH_BLAKE2B = 64;\nexport const SLIP10_ED25519 = 'ed25519 seed';\nexport const THRESHOLD_RECEIVE = 0xfffffe00;\nexport const THRESHOLD_SEND = 0xfffffff8;\nexport const XNO = '\u04FE';\nexport const LEDGER_STATUS_CODES = Object.freeze({\n    0x6700: 'INCORRECT_LENGTH',\n    0x670a: 'NO_APPLICATION_SPECIFIED',\n    0x6807: 'APPLICATION_NOT_INSTALLED',\n    0x6d00: 'APPLICATION_ALREADY_LAUNCHED',\n    0x6982: 'SECURITY_STATUS_NOT_SATISFIED',\n    0x6985: 'CONDITIONS_OF_USE_NOT_SATISFIED',\n    0x6a81: 'INVALID_SIGNATURE',\n    0x6a82: 'CACHE_MISS',\n    0x6b00: 'INCORRECT_PARAMETER',\n    0x6e01: 'TRANSPORT_STATUS_ERROR',\n    0x9000: 'OK'\n});\nexport const UNITS = Object.freeze({\n    RAW: 0,\n    RAI: 24,\n    NYANO: 24,\n    KRAI: 27,\n    PICO: 27,\n    MRAI: 30,\n    NANO: 30,\n    KNANO: 33,\n    MNANO: 36\n});\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { ALPHABET } from \"./constants.js\";\nexport const base32 = {\n    /**\n    * Converts a base32 string to a Uint8Array of bytes.\n    *\n    * @param {string} base32 - String to convert\n    * @returns {Uint8Array} Byte array representation of the input string\n    */\n    toBytes(base32) {\n        const leftover = (base32.length * 5) % 8;\n        const offset = leftover === 0\n            ? 0\n            : 8 - leftover;\n        let bits = 0;\n        let value = 0;\n        let index = 0;\n        let output = new Uint8Array(Math.ceil((base32.length * 5) / 8));\n        for (let i = 0; i < base32.length; i++) {\n            value = (value << 5) | ALPHABET.indexOf(base32[i]);\n            bits += 5;\n            if (bits >= 8) {\n                output[index++] = (value >>> (bits + offset - 8)) & 255;\n                bits -= 8;\n            }\n        }\n        if (bits > 0) {\n            output[index++] = (value << (bits + offset - 8)) & 255;\n        }\n        if (leftover !== 0) {\n            output = output.slice(1);\n        }\n        return output;\n    },\n    /**\n    * Converts a base32 string to a hexadecimal string.\n    *\n    * @param {string} base32 - String to convert\n    * @returns {string} Hexadecimal representation of the input base32\n    */\n    toHex(base32) {\n        return bytes.toHex(this.toBytes(base32));\n    }\n};\nexport const bin = {\n    /**\n    * Convert a binary string to a Uint8Array of bytes.\n    *\n    * @param {string} bin - String to convert\n    * @returns {Uint8Array} Byte array representation of the input string\n    */\n    toBytes(bin) {\n        const bytes = [];\n        while (bin.length > 0) {\n            const bits = bin.substring(0, 8);\n            bytes.push(parseInt(bits, 2));\n            bin = bin.substring(8);\n        }\n        return new Uint8Array(bytes);\n    },\n    /**\n    * Convert a binary string to a hexadecimal string.\n    *\n    * @param {string} bin - String to convert\n    * @returns {string} Hexadecimal string representation of the input binary\n    */\n    toHex(bin) {\n        return parseInt(bin, 2).toString(16);\n    }\n};\nexport const buffer = {\n    /**\n    * Converts an ArrayBuffer to a base32 string.\n    *\n    * @param {ArrayBuffer} buffer - Buffer to convert\n    * @returns {string} Base32 string representation of the input buffer\n    */\n    toBase32(buffer) {\n        return bytes.toBase32(new Uint8Array(buffer));\n    },\n    /**\n    * Converts an ArrayBuffer to a binary string.\n    *\n    * @param {ArrayBuffer} buffer - Buffer to convert\n    * @returns {string} Binary string representation of the input buffer\n    */\n    toBin(buffer) {\n        return bytes.toBin(new Uint8Array(buffer));\n    },\n    /**\n    * Sums an ArrayBuffer to a decimal integer. If the result is larger than\n    * Number.MAX_SAFE_INTEGER, it will be returned as a bigint.\n    *\n    * @param {ArrayBuffer} buffer - Buffer to convert\n    * @returns {bigint|number} Decimal sum of the literal buffer values\n    */\n    toDec(buffer) {\n        return bytes.toDec(new Uint8Array(buffer));\n    },\n    /**\n    * Converts an ArrayBuffer to a hexadecimal string.\n    *\n    * @param {ArrayBuffer} buffer - Buffer to convert\n    * @returns {string} Hexadecimal string representation of the input buffer\n    */\n    toHex(buffer) {\n        return bytes.toHex(new Uint8Array(buffer));\n    },\n    /**\n    * Converts an ArrayBuffer to a UTF-8 text string.\n    *\n    * @param {ArrayBuffer} buffer - Buffer to convert\n    * @returns {string} UTF-8 encoded text string\n    */\n    toUtf8(buffer) {\n        return bytes.toUtf8(new Uint8Array(buffer));\n    }\n};\nexport const bytes = {\n    /**\n    * Converts a Uint8Aarray of bytes to a base32 string.\n    *\n    * @param {Uint8Array} bytes - Byte array to convert\n    * @returns {string} Base32 string representation of the input bytes\n    */\n    toBase32(bytes) {\n        const leftover = (bytes.length * 8) % 5;\n        const offset = leftover === 0\n            ? 0\n            : 5 - leftover;\n        let value = 0;\n        let output = '';\n        let bits = 0;\n        for (let i = 0; i < bytes.length; i++) {\n            value = (value << 8) | bytes[i];\n            bits += 8;\n            while (bits >= 5) {\n                output += ALPHABET[(value >>> (bits + offset - 5)) & 31];\n                bits -= 5;\n            }\n        }\n        if (bits > 0) {\n            output += ALPHABET[(value << (5 - (bits + offset))) & 31];\n        }\n        return output;\n    },\n    /**\n    * Convert a Uint8Array of bytes to a binary string.\n    *\n    * @param {Uint8Array} bytes - Byte array to convert\n    * @returns {string} Binary string representation of the input value\n    */\n    toBin(bytes) {\n        return [...bytes].map(b => b.toString(2).padStart(8, '0')).join('');\n    },\n    /**\n    * Sums an array of bytes to a decimal integer. If the result is larger than\n    * Number.MAX_SAFE_INTEGER, it will be returned as a bigint.\n    *\n    * @param {Uint8Array} bytes - Byte array to convert\n    * @returns {bigint|number} Decimal sum of the literal byte values\n    */\n    toDec(bytes) {\n        const integers = [];\n        bytes.reverse().forEach(b => integers.push(BigInt(b)));\n        let decimal = 0n;\n        for (let i = 0; i < integers.length; i++) {\n            decimal += integers[i] << BigInt(i * 8);\n        }\n        if (decimal > 9007199254740991n) {\n            return decimal;\n        }\n        else {\n            return Number(decimal);\n        }\n    },\n    /**\n    * Converts a Uint8Array of bytes to a hexadecimal string.\n    *\n    * @param {Uint8Array} bytes - Byte array to convert\n    * @returns {string} Hexadecimal string representation of the input bytes\n    */\n    toHex(bytes) {\n        const byteArray = [...bytes].map(byte => byte.toString(16).padStart(2, '0'));\n        return byteArray.join('').toUpperCase();\n    },\n    /**\n    * Converts a Uint8Array of bytes to a UTF-8 text string.\n    *\n    * @param {Uint8Array} bytes - Byte array to convert\n    * @returns {string} UTF-8 encoded text string\n    */\n    toUtf8(bytes) {\n        return new TextDecoder().decode(bytes);\n    }\n};\nexport const dec = {\n    /**\n    * Convert a decimal integer to a binary string.\n    *\n    * @param {bigint|number|string} decimal - Integer to convert\n    * @param {number} [padding=0] - Minimum length of the resulting string which will be padded as necessary with starting zeroes\n    * @returns {string} Binary string representation of the input decimal\n    */\n    toBin(decimal, padding = 0) {\n        if (typeof padding !== 'number') {\n            throw new TypeError('Invalid padding');\n        }\n        try {\n            return BigInt(decimal)\n                .toString(2)\n                .padStart(padding, '0');\n        }\n        catch (err) {\n            throw new RangeError('Invalid decimal integer');\n        }\n    },\n    /**\n    * Convert a decimal integer to a Uint8Array of bytes. Fractional part is truncated.\n    *\n    * @param {bigint|number|string} decimal - Integer to convert\n    * @param {number} [padding=0] - Minimum length of the resulting array which will be padded as necessary with starting 0x00 bytes\n    * @returns {Uint8Array} Byte array representation of the input decimal\n    */\n    toBytes(decimal, padding = 0) {\n        if (typeof padding !== 'number') {\n            throw new TypeError('Invalid padding');\n        }\n        let integer = BigInt(decimal);\n        const bytes = [];\n        while (integer > 0) {\n            const lsb = BigInt.asUintN(8, integer);\n            bytes.push(Number(lsb));\n            integer >>= 8n;\n        }\n        const result = new Uint8Array(Math.max(padding, bytes.length));\n        result.set(bytes);\n        return (result.reverse());\n    },\n    /**\n    * Convert a decimal integer to a hexadecimal string.\n    *\n    * @param {(bigint|number|string)} decimal - Integer to convert\n    * @param {number} [padding=0] - Minimum length of the resulting string which will be padded as necessary with starting zeroes\n    * @returns {string} Hexadecimal string representation of the input decimal\n    */\n    toHex(decimal, padding = 0) {\n        if (typeof padding !== 'number') {\n            throw new TypeError('Invalid padding');\n        }\n        try {\n            return BigInt(decimal)\n                .toString(16)\n                .padStart(padding, '0')\n                .toUpperCase();\n        }\n        catch (err) {\n            throw new RangeError('Invalid decimal integer');\n        }\n    }\n};\nexport const hex = {\n    /**\n    * Convert a hexadecimal string to a binary string.\n    *\n    * @param {string} hex - Hexadecimal number string to convert\n    * @returns {string} Binary string representation of the input value\n    */\n    toBin(hex) {\n        return [...hex].map(c => dec.toBin(parseInt(c, 16), 4)).join('');\n    },\n    /**\n    * Convert a hexadecimal string to a Uint8Array of bytes.\n    *\n    * @param {string} hex - Hexadecimal number string to convert\n    * @param {number} [padding=0] - Minimum length of the resulting array which will be padded as necessary with starting 0x00 bytes\n    * @returns {Uint8Array} Byte array representation of the input value\n    */\n    toBytes(hex, padding = 0) {\n        if (typeof padding !== 'number') {\n            throw new TypeError('Invalid padding when converting hex to bytes');\n        }\n        const hexArray = hex.match(/.{1,2}/g);\n        if (!/^[0-9a-f]+$/i.test(hex) || hexArray == null) {\n            console.warn('Invalid hex string when converting to bytes');\n            return new Uint8Array();\n        }\n        else {\n            const bytes = Uint8Array.from(hexArray.map(byte => parseInt(byte, 16)));\n            const result = new Uint8Array(Math.max(padding, bytes.length));\n            result.set(bytes.reverse());\n            return result.reverse();\n        }\n    }\n};\nexport const utf8 = {\n    /**\n    * Convert a UTF-8 text string to a Uint8Array of bytes.\n    *\n    * @param {string} utf8 - String to convert\n    * @returns {Uint8Array} Byte array representation of the input string\n    */\n    toBytes(utf8) {\n        return new TextEncoder().encode(utf8);\n    },\n    /**\n    * Convert a string to a hexadecimal representation\n    *\n    * @param {string} utf8 - String to convert\n    * @returns {string} Hexadecimal representation of the input string\n    */\n    toHex(utf8) {\n        return bytes.toHex(this.toBytes(utf8));\n    }\n};\nexport default { base32, bin, bytes, dec, hex, utf8 };\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n/**\n* Represents a Nano network node. It primarily consists of a URL which will\n* accept RPC calls, and an optional API key header construction can be passed if\n* required by the node. Once instantiated, the Rpc object can be used to call\n* any action supported by the Nano protocol. The URL protocol must be HTTPS; any\n* other value will be changed automatically.\n*/\nexport class Rpc {\n    #u;\n    #n;\n    constructor(url, apiKeyName) {\n        this.#u = new URL(url);\n        this.#u.protocol = 'https:';\n        this.#n = apiKeyName;\n    }\n    /**\n     *\n     * @param {string} action - Nano protocol RPC call to execute\n     * @param {object} [data] - JSON to send to the node as defined by the action\n     * @returns {Promise<any>} JSON-formatted RPC results from the node\n     */\n    async call(action, data) {\n        var process = process || null;\n        this.#validate(action);\n        const headers = {};\n        headers['Content-Type'] = 'application/json';\n        if (this.#n && process?.env?.LIBNEMO_RPC_API_KEY) {\n            headers[this.#n] = process.env.LIBNEMO_RPC_API_KEY;\n        }\n        data ??= {};\n        data.action = action.toLowerCase();\n        const body = JSON.stringify(data)\n            .replaceAll('/', '\\\\u002f')\n            .replaceAll('<', '\\\\u003c')\n            .replaceAll('>', '\\\\u003d')\n            .replaceAll('\\\\', '\\\\u005c');\n        const req = new Request(this.#u, {\n            method: 'POST',\n            headers,\n            body\n        });\n        try {\n            const res = await fetch(req);\n            return await res.json();\n        }\n        catch (err) {\n            console.error(err);\n            return JSON.stringify(err);\n        }\n    }\n    #validate(action) {\n        if (!action) {\n            throw new ReferenceError('Action is required for RPCs');\n        }\n        if (typeof action !== 'string') {\n            throw new TypeError('RPC action must be a string');\n        }\n        if (!/^[A-Za-z]+(_[A-Za-z]+)*$/.test(action)) {\n            throw new TypeError('RPC action contains invalid characters');\n        }\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { bytes, hex } from './convert.js';\nconst { crypto } = globalThis;\nconst MIN = 16;\nconst MAX = 32;\nconst MOD = 4;\n/**\n* Represents a cryptographically strong source of entropy suitable for use in\n* BIP-39 mnemonic phrase generation and consequently BIP-44 key derivation.\n*\n* The constructor will accept one of several different data types under certain\n* constraints. If the constraints are not met, an error will be thrown. If no\n* value, or the equivalent of no value, is passed to the constructor, then a\n* brand new source of entropy will be generated at the maximum size of 256 bits.\n*/\nexport class Entropy {\n    static #isInternal = false;\n    #bytes;\n    get bits() { return bytes.toBin(this.#bytes); }\n    get buffer() { return this.#bytes.buffer; }\n    get bytes() { return this.#bytes; }\n    get hex() { return bytes.toHex(this.#bytes); }\n    constructor(bytes) {\n        if (!Entropy.#isInternal) {\n            throw new Error(`Entropy cannot be instantiated directly. Use 'await Entropy.create()' instead.`);\n        }\n        Entropy.#isInternal = false;\n        this.#bytes = bytes;\n    }\n    static async create(size) {\n        return new Promise(resolve => {\n            if (size != null) {\n                if (typeof size !== 'number') {\n                    throw new TypeError(`Entropy cannot use ${typeof size} as a size`);\n                }\n                if (size < MIN || size > MAX) {\n                    throw new RangeError(`Entropy must be ${MIN}-${MAX} bytes`);\n                }\n                if (size % MOD !== 0) {\n                    throw new RangeError(`Entropy must be a multiple of ${MOD} bytes`);\n                }\n            }\n            Entropy.#isInternal = true;\n            resolve(new this(crypto.getRandomValues(new Uint8Array(size ?? MAX))));\n        });\n    }\n    static async import(input) {\n        return new Promise((resolve, reject) => {\n            if (typeof input === 'string') {\n                if (input.length < MIN * 2 || input.length > MAX * 2) {\n                    throw new RangeError(`Entropy must be ${MIN * 2}-${MAX * 2} characters`);\n                }\n                if (input.length % MOD * 2 !== 0) {\n                    throw new RangeError(`Entropy must be a multiple of ${MOD * 2} characters`);\n                }\n                if (!/^[0-9a-fA-F]+$/i.test(input)) {\n                    throw new RangeError('Entropy contains invalid hexadecimal characters');\n                }\n                Entropy.#isInternal = true;\n                resolve(new this(hex.toBytes(input)));\n            }\n            if (input instanceof ArrayBuffer) {\n                if (input.byteLength < MIN || input.byteLength > MAX) {\n                    throw new Error(`Entropy must be ${MIN}-${MAX} bytes`);\n                }\n                if (input.byteLength % MOD !== 0) {\n                    throw new RangeError(`Entropy must be a multiple of ${MOD} bytes`);\n                }\n                Entropy.#isInternal = true;\n                resolve(new this(new Uint8Array(input)));\n            }\n            if (input instanceof Uint8Array) {\n                if (input.length < MIN || input.length > MAX) {\n                    throw new Error(`Entropy must be ${MIN}-${MAX} bytes`);\n                }\n                if (input.length % MOD !== 0) {\n                    throw new RangeError(`Entropy must be a multiple of ${MOD} bytes`);\n                }\n                Entropy.#isInternal = true;\n                resolve(new this(input));\n            }\n            reject(new TypeError(`Entropy cannot import ${typeof input}`));\n        });\n    }\n    /**\n    * Randomizes the bytes, rendering the original values generally inaccessible.\n    */\n    destroy() {\n        try {\n            crypto.getRandomValues(this.#bytes);\n            return true;\n        }\n        catch (err) {\n            return false;\n        }\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { buffer, hex, utf8 } from './convert.js';\nimport { Entropy } from './entropy.js';\nconst { subtle } = globalThis.crypto;\nconst ERR_MSG = 'Failed to store item in Safe';\nexport class Safe {\n    #storage;\n    constructor() {\n        this.#storage = globalThis.sessionStorage;\n    }\n    async put(name, passkey, data) {\n        if (this.#storage.getItem(name)) {\n            throw new Error(ERR_MSG);\n        }\n        return this.overwrite(name, passkey, data);\n    }\n    async overwrite(name, passkey, data) {\n        if (this.#isNotValid(name, passkey, data)) {\n            throw new Error(ERR_MSG);\n        }\n        const iv = await Entropy.create();\n        if (typeof passkey === 'string') {\n            try {\n                passkey = await subtle.importKey('raw', utf8.toBytes(passkey), 'PBKDF2', false, ['deriveBits', 'deriveKey']);\n                passkey = await subtle.deriveKey({ name: 'PBKDF2', hash: 'SHA-512', salt: iv.bytes, iterations: 210000 }, passkey, { name: 'AES-GCM', length: 256 }, false, ['encrypt']);\n            }\n            catch (err) {\n                throw new Error(ERR_MSG);\n            }\n        }\n        try {\n            if (typeof data === 'bigint') {\n                data = data.toString();\n            }\n            data = JSON.stringify(data);\n            const encoded = utf8.toBytes(data);\n            const encrypted = await subtle.encrypt({ name: 'AES-GCM', iv: iv.buffer }, passkey, encoded);\n            const record = {\n                encrypted: buffer.toHex(encrypted),\n                iv: iv.hex\n            };\n            await new Promise((resolve, reject) => {\n                try {\n                    this.#storage.setItem(name, JSON.stringify(record));\n                    resolve();\n                }\n                catch (err) {\n                    reject(err);\n                }\n            });\n            passkey = '';\n        }\n        catch (err) {\n            throw new Error(ERR_MSG);\n        }\n        return (this.#storage.getItem(name) != null);\n    }\n    async get(name, passkey) {\n        if (this.#isNotValid(name, passkey)) {\n            return null;\n        }\n        const item = await new Promise(resolve => {\n            resolve(this.#storage.getItem(name));\n        });\n        if (item == null) {\n            return null;\n        }\n        const record = JSON.parse(item);\n        const encrypted = hex.toBytes(record.encrypted);\n        const iv = await Entropy.import(record.iv);\n        try {\n            if (typeof passkey === 'string') {\n                passkey = await subtle.importKey('raw', utf8.toBytes(passkey), 'PBKDF2', false, ['deriveBits', 'deriveKey']);\n                passkey = await subtle.deriveKey({ name: 'PBKDF2', hash: 'SHA-512', salt: iv.bytes, iterations: 210000 }, passkey, { name: 'AES-GCM', length: 256 }, false, ['decrypt']);\n            }\n        }\n        catch (err) {\n            return null;\n        }\n        try {\n            const decrypted = await subtle.decrypt({ name: 'AES-GCM', iv: iv.buffer }, passkey, encrypted);\n            const decoded = buffer.toUtf8(decrypted);\n            const data = JSON.parse(decoded);\n            passkey = '';\n            this.#storage.removeItem(name);\n            return data;\n        }\n        catch (err) {\n            return null;\n        }\n    }\n    #isNotValid(name, passkey, data) {\n        if (typeof name !== 'string' || name === '') {\n            return true;\n        }\n        if (typeof passkey !== 'string' || passkey === '') {\n            if (!(passkey instanceof CryptoKey)) {\n                return true;\n            }\n        }\n        if (typeof data === 'object') {\n            try {\n                JSON.stringify(data);\n            }\n            catch (err) {\n                return true;\n            }\n        }\n        return false;\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n/**\n* Processes an array of tasks using Web Workers.\n*/\nexport class Pool {\n    static #cores = Math.max(1, navigator.hardwareConcurrency - 1);\n    #queue = [];\n    #threads = [];\n    #url;\n    get threadsBusy() {\n        let n = 0;\n        for (const thread of this.#threads) {\n            n += +(thread.job != null);\n        }\n        return n;\n    }\n    get threadsIdle() {\n        let n = 0;\n        for (const thread of this.#threads) {\n            n += +(thread.job == null);\n        }\n        return n;\n    }\n    async assign(data) {\n        if (!(data instanceof ArrayBuffer || Array.isArray(data)))\n            data = [data];\n        return new Promise((resolve, reject) => {\n            const job = {\n                id: performance.now(),\n                results: [],\n                data,\n                resolve,\n                reject\n            };\n            if (this.#queue.length > 0) {\n                this.#queue.push(job);\n            }\n            else {\n                for (const thread of this.#threads)\n                    this.#assign(thread, job);\n            }\n        });\n    }\n    /**\n    *\n    * @param {string} worker - Stringified worker class\n    * @param {number} [count=1] - Integer between 1 and CPU thread count shared among all Pools\n    */\n    constructor(worker, count = 1) {\n        count = Math.min(Pool.#cores, Math.max(1, Math.floor(Math.abs(count))));\n        this.#url = URL.createObjectURL(new Blob([worker], { type: 'text/javascript' }));\n        for (let i = 0; i < count; i++) {\n            const thread = {\n                worker: new Worker(this.#url, { type: 'module' }),\n                job: null\n            };\n            thread.worker.addEventListener('message', message => {\n                let result = JSON.parse(new TextDecoder().decode(message.data) || \"[]\");\n                if (!Array.isArray(result))\n                    result = [result];\n                this.#report(thread, result);\n            });\n            this.#threads.push(thread);\n            Pool.#cores = Math.max(1, Pool.#cores - this.#threads.length);\n        }\n    }\n    #assign(thread, job) {\n        if (job.data instanceof ArrayBuffer) {\n            if (job.data.byteLength > 0) {\n                thread.job = job;\n                thread.worker.postMessage({ buffer: job.data }, [job.data]);\n            }\n        }\n        else {\n            const chunk = 1 + (job.data.length / this.threadsIdle);\n            const next = job.data.slice(0, chunk);\n            job.data = job.data.slice(chunk);\n            if (job.data.length === 0)\n                this.#queue.shift();\n            if (next?.length > 0) {\n                const buffer = new TextEncoder().encode(JSON.stringify(next)).buffer;\n                thread.job = job;\n                thread.worker.postMessage({ buffer }, [buffer]);\n            }\n        }\n    }\n    #isJobDone(jobId) {\n        for (const thread of this.#threads) {\n            if (thread.job?.id === jobId)\n                return false;\n        }\n        return true;\n    }\n    #report(thread, results) {\n        if (thread.job == null) {\n            throw new Error('Thread returned results but had nowhere to report it.');\n        }\n        const job = thread.job;\n        if (this.#queue.length > 0) {\n            this.#assign(thread, this.#queue[0]);\n        }\n        else {\n            thread.job = null;\n        }\n        if (results.length > 0) {\n            job.results.push(...results);\n        }\n        if (this.#isJobDone(job.id)) {\n            job.resolve(job.results);\n        }\n    }\n}\n/**\n* Provides basic worker event messaging to extending classes.\n*\n* In order to be properly bundled in a format that can be used to create an\n* inline Web Worker, the extending classes must export WorkerInterface and\n* themselves as a string:\n*```\n* export default `\n* \tconst WorkerInterface = ${WorkerInterface}\n* \tconst Pow = ${Pow}\n* `\n* ```\n* They must also initialize the event listener by calling their inherited\n* `listen()` function. Finally, they must override the implementation of the\n* `work()` function. See the documentation of those functions for details.\n*/\nexport class WorkerInterface {\n    /**\n    * Processes data through a worker.\n    *\n    * Extending classes must override this template by implementing the same\n    * function signature and providing their own processing call in the try-catch\n    * block.\n    *\n    * @param {any[]} data - Array of data to process\n    * @returns Promise for that data after being processed\n    */\n    static async work(data) {\n        return new Promise(async (resolve, reject) => {\n            for (let d of data) {\n                try {\n                    d = await d;\n                }\n                catch (err) {\n                    reject(err);\n                }\n            }\n            resolve(data);\n        });\n    }\n    /**\n    * Encodes worker results as an ArrayBuffer so it can be transferred back to\n    * the main thread.\n    *\n    * @param {any[]} results - Array of processed data\n    */\n    static report(results) {\n        const buffer = new TextEncoder().encode(JSON.stringify(results)).buffer;\n        //@ts-expect-error\n        postMessage(buffer, [buffer]);\n    }\n    /**\n    * Listens for messages from the main thread.\n    *\n    * Extending classes must call this in a static initialization block:\n    * ```\n    * static {\n    * \tPow.listen()\n    * }\n    * ```\n    */\n    static listen() {\n        addEventListener('message', (message) => {\n            const { name, buffer } = message.data;\n            if (name === 'STOP') {\n                close();\n                const buffer = new ArrayBuffer(0);\n                //@ts-expect-error\n                postMessage(buffer, [buffer]);\n            }\n            else {\n                const data = JSON.parse(new TextDecoder().decode(buffer));\n                this.work(data).then(this.report);\n            }\n        });\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n'use strict';\nimport { Blake2b } from '../blake2b.js';\nimport { WorkerInterface } from '../pool.js';\n// Ported in 2014 by Dmitry Chestnykh and Devi Mandiri.\n// Public domain.\n//\n// Implementation derived from TweetNaCl version 20140427.\n// See for details: http://tweetnacl.cr.yp.to/\n//\n// Modified in 2024 by Chris Duncan to hash secret key to public key using\n// BLAKE2b instead of SHA-512 as specified in the documentation for Nano\n// cryptocurrency.\n// See for details: https://docs.nano.org/integration-guides/the-basics/\n// Original source commit: https://github.com/dchest/tweetnacl-js/blob/71df1d6a1d78236ca3e9f6c788786e21f5a651a6/nacl-fast.js\nexport class NanoNaCl extends WorkerInterface {\n    static {\n        NanoNaCl.listen();\n    }\n    static async work(data) {\n        return new Promise(async (resolve, reject) => {\n            for (let d of data) {\n                try {\n                    d.publicKey = await this.convert(d.privateKey);\n                }\n                catch (err) {\n                    reject(err);\n                }\n            }\n            resolve(data);\n        });\n    }\n    static gf = function (init) {\n        const r = new Float64Array(16);\n        if (init)\n            for (let i = 0; i < init.length; i++)\n                r[i] = init[i];\n        return r;\n    };\n    static gf0 = this.gf();\n    static gf1 = this.gf([1]);\n    static D = this.gf([0x78a3, 0x1359, 0x4dca, 0x75eb, 0xd8ab, 0x4141, 0x0a4d, 0x0070, 0xe898, 0x7779, 0x4079, 0x8cc7, 0xfe73, 0x2b6f, 0x6cee, 0x5203]);\n    static D2 = this.gf([0xf159, 0x26b2, 0x9b94, 0xebd6, 0xb156, 0x8283, 0x149a, 0x00e0, 0xd130, 0xeef3, 0x80f2, 0x198e, 0xfce7, 0x56df, 0xd9dc, 0x2406]);\n    static X = this.gf([0xd51a, 0x8f25, 0x2d60, 0xc956, 0xa7b2, 0x9525, 0xc760, 0x692c, 0xdc5c, 0xfdd6, 0xe231, 0xc0a4, 0x53fe, 0xcd6e, 0x36d3, 0x2169]);\n    static Y = this.gf([0x6658, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666]);\n    static I = this.gf([0xa0b0, 0x4a0e, 0x1b27, 0xc4ee, 0xe478, 0xad2f, 0x1806, 0x2f43, 0xd7a7, 0x3dfb, 0x0099, 0x2b4d, 0xdf0b, 0x4fc1, 0x2480, 0x2b83]);\n    static vn(x, xi, y, yi, n) {\n        let d = 0;\n        for (let i = 0; i < n; i++)\n            d |= x[xi + i] ^ y[yi + i];\n        return (1 & ((d - 1) >>> 8)) - 1;\n    }\n    static crypto_verify_32(x, xi, y, yi) {\n        return this.vn(x, xi, y, yi, 32);\n    }\n    static set25519(r, a) {\n        for (let i = 0; i < 16; i++)\n            r[i] = a[i] | 0;\n    }\n    static car25519(o) {\n        let v, c = 1;\n        for (let i = 0; i < 16; i++) {\n            v = o[i] + c + 65535;\n            c = Math.floor(v / 65536);\n            o[i] = v - c * 65536;\n        }\n        o[0] += c - 1 + 37 * (c - 1);\n    }\n    static sel25519(p, q, b) {\n        let t;\n        const c = ~(b - 1);\n        for (let i = 0; i < 16; i++) {\n            t = c & (p[i] ^ q[i]);\n            p[i] ^= t;\n            q[i] ^= t;\n        }\n    }\n    static pack25519(o, n) {\n        let b;\n        const m = this.gf();\n        const t = this.gf();\n        for (let i = 0; i < 16; i++)\n            t[i] = n[i];\n        this.car25519(t);\n        this.car25519(t);\n        this.car25519(t);\n        for (let j = 0; j < 2; j++) {\n            m[0] = t[0] - 0xffed;\n            for (let i = 1; i < 15; i++) {\n                m[i] = t[i] - 0xffff - ((m[i - 1] >> 16) & 1);\n                m[i - 1] &= 0xffff;\n            }\n            m[15] = t[15] - 0x7fff - ((m[14] >> 16) & 1);\n            b = (m[15] >> 16) & 1;\n            m[14] &= 0xffff;\n            this.sel25519(t, m, 1 - b);\n        }\n        for (let i = 0; i < 16; i++) {\n            o[2 * i] = t[i] & 0xff;\n            o[2 * i + 1] = t[i] >> 8;\n        }\n    }\n    static neq25519(a, b) {\n        const c = new Uint8Array(32);\n        const d = new Uint8Array(32);\n        this.pack25519(c, a);\n        this.pack25519(d, b);\n        return this.crypto_verify_32(c, 0, d, 0);\n    }\n    static par25519(a) {\n        var d = new Uint8Array(32);\n        this.pack25519(d, a);\n        return d[0] & 1;\n    }\n    static unpack25519(o, n) {\n        for (let i = 0; i < 16; i++)\n            o[i] = n[2 * i] + (n[2 * i + 1] << 8);\n        o[15] &= 0x7fff;\n    }\n    static A(o, a, b) {\n        for (let i = 0; i < 16; i++)\n            o[i] = a[i] + b[i];\n    }\n    static Z(o, a, b) {\n        for (let i = 0; i < 16; i++)\n            o[i] = a[i] - b[i];\n    }\n    static M(o, a, b) {\n        let v, c, t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0, t8 = 0, t9 = 0, t10 = 0, t11 = 0, t12 = 0, t13 = 0, t14 = 0, t15 = 0, t16 = 0, t17 = 0, t18 = 0, t19 = 0, t20 = 0, t21 = 0, t22 = 0, t23 = 0, t24 = 0, t25 = 0, t26 = 0, t27 = 0, t28 = 0, t29 = 0, t30 = 0, b0 = b[0], b1 = b[1], b2 = b[2], b3 = b[3], b4 = b[4], b5 = b[5], b6 = b[6], b7 = b[7], b8 = b[8], b9 = b[9], b10 = b[10], b11 = b[11], b12 = b[12], b13 = b[13], b14 = b[14], b15 = b[15];\n        v = a[0];\n        t0 += v * b0;\n        t1 += v * b1;\n        t2 += v * b2;\n        t3 += v * b3;\n        t4 += v * b4;\n        t5 += v * b5;\n        t6 += v * b6;\n        t7 += v * b7;\n        t8 += v * b8;\n        t9 += v * b9;\n        t10 += v * b10;\n        t11 += v * b11;\n        t12 += v * b12;\n        t13 += v * b13;\n        t14 += v * b14;\n        t15 += v * b15;\n        v = a[1];\n        t1 += v * b0;\n        t2 += v * b1;\n        t3 += v * b2;\n        t4 += v * b3;\n        t5 += v * b4;\n        t6 += v * b5;\n        t7 += v * b6;\n        t8 += v * b7;\n        t9 += v * b8;\n        t10 += v * b9;\n        t11 += v * b10;\n        t12 += v * b11;\n        t13 += v * b12;\n        t14 += v * b13;\n        t15 += v * b14;\n        t16 += v * b15;\n        v = a[2];\n        t2 += v * b0;\n        t3 += v * b1;\n        t4 += v * b2;\n        t5 += v * b3;\n        t6 += v * b4;\n        t7 += v * b5;\n        t8 += v * b6;\n        t9 += v * b7;\n        t10 += v * b8;\n        t11 += v * b9;\n        t12 += v * b10;\n        t13 += v * b11;\n        t14 += v * b12;\n        t15 += v * b13;\n        t16 += v * b14;\n        t17 += v * b15;\n        v = a[3];\n        t3 += v * b0;\n        t4 += v * b1;\n        t5 += v * b2;\n        t6 += v * b3;\n        t7 += v * b4;\n        t8 += v * b5;\n        t9 += v * b6;\n        t10 += v * b7;\n        t11 += v * b8;\n        t12 += v * b9;\n        t13 += v * b10;\n        t14 += v * b11;\n        t15 += v * b12;\n        t16 += v * b13;\n        t17 += v * b14;\n        t18 += v * b15;\n        v = a[4];\n        t4 += v * b0;\n        t5 += v * b1;\n        t6 += v * b2;\n        t7 += v * b3;\n        t8 += v * b4;\n        t9 += v * b5;\n        t10 += v * b6;\n        t11 += v * b7;\n        t12 += v * b8;\n        t13 += v * b9;\n        t14 += v * b10;\n        t15 += v * b11;\n        t16 += v * b12;\n        t17 += v * b13;\n        t18 += v * b14;\n        t19 += v * b15;\n        v = a[5];\n        t5 += v * b0;\n        t6 += v * b1;\n        t7 += v * b2;\n        t8 += v * b3;\n        t9 += v * b4;\n        t10 += v * b5;\n        t11 += v * b6;\n        t12 += v * b7;\n        t13 += v * b8;\n        t14 += v * b9;\n        t15 += v * b10;\n        t16 += v * b11;\n        t17 += v * b12;\n        t18 += v * b13;\n        t19 += v * b14;\n        t20 += v * b15;\n        v = a[6];\n        t6 += v * b0;\n        t7 += v * b1;\n        t8 += v * b2;\n        t9 += v * b3;\n        t10 += v * b4;\n        t11 += v * b5;\n        t12 += v * b6;\n        t13 += v * b7;\n        t14 += v * b8;\n        t15 += v * b9;\n        t16 += v * b10;\n        t17 += v * b11;\n        t18 += v * b12;\n        t19 += v * b13;\n        t20 += v * b14;\n        t21 += v * b15;\n        v = a[7];\n        t7 += v * b0;\n        t8 += v * b1;\n        t9 += v * b2;\n        t10 += v * b3;\n        t11 += v * b4;\n        t12 += v * b5;\n        t13 += v * b6;\n        t14 += v * b7;\n        t15 += v * b8;\n        t16 += v * b9;\n        t17 += v * b10;\n        t18 += v * b11;\n        t19 += v * b12;\n        t20 += v * b13;\n        t21 += v * b14;\n        t22 += v * b15;\n        v = a[8];\n        t8 += v * b0;\n        t9 += v * b1;\n        t10 += v * b2;\n        t11 += v * b3;\n        t12 += v * b4;\n        t13 += v * b5;\n        t14 += v * b6;\n        t15 += v * b7;\n        t16 += v * b8;\n        t17 += v * b9;\n        t18 += v * b10;\n        t19 += v * b11;\n        t20 += v * b12;\n        t21 += v * b13;\n        t22 += v * b14;\n        t23 += v * b15;\n        v = a[9];\n        t9 += v * b0;\n        t10 += v * b1;\n        t11 += v * b2;\n        t12 += v * b3;\n        t13 += v * b4;\n        t14 += v * b5;\n        t15 += v * b6;\n        t16 += v * b7;\n        t17 += v * b8;\n        t18 += v * b9;\n        t19 += v * b10;\n        t20 += v * b11;\n        t21 += v * b12;\n        t22 += v * b13;\n        t23 += v * b14;\n        t24 += v * b15;\n        v = a[10];\n        t10 += v * b0;\n        t11 += v * b1;\n        t12 += v * b2;\n        t13 += v * b3;\n        t14 += v * b4;\n        t15 += v * b5;\n        t16 += v * b6;\n        t17 += v * b7;\n        t18 += v * b8;\n        t19 += v * b9;\n        t20 += v * b10;\n        t21 += v * b11;\n        t22 += v * b12;\n        t23 += v * b13;\n        t24 += v * b14;\n        t25 += v * b15;\n        v = a[11];\n        t11 += v * b0;\n        t12 += v * b1;\n        t13 += v * b2;\n        t14 += v * b3;\n        t15 += v * b4;\n        t16 += v * b5;\n        t17 += v * b6;\n        t18 += v * b7;\n        t19 += v * b8;\n        t20 += v * b9;\n        t21 += v * b10;\n        t22 += v * b11;\n        t23 += v * b12;\n        t24 += v * b13;\n        t25 += v * b14;\n        t26 += v * b15;\n        v = a[12];\n        t12 += v * b0;\n        t13 += v * b1;\n        t14 += v * b2;\n        t15 += v * b3;\n        t16 += v * b4;\n        t17 += v * b5;\n        t18 += v * b6;\n        t19 += v * b7;\n        t20 += v * b8;\n        t21 += v * b9;\n        t22 += v * b10;\n        t23 += v * b11;\n        t24 += v * b12;\n        t25 += v * b13;\n        t26 += v * b14;\n        t27 += v * b15;\n        v = a[13];\n        t13 += v * b0;\n        t14 += v * b1;\n        t15 += v * b2;\n        t16 += v * b3;\n        t17 += v * b4;\n        t18 += v * b5;\n        t19 += v * b6;\n        t20 += v * b7;\n        t21 += v * b8;\n        t22 += v * b9;\n        t23 += v * b10;\n        t24 += v * b11;\n        t25 += v * b12;\n        t26 += v * b13;\n        t27 += v * b14;\n        t28 += v * b15;\n        v = a[14];\n        t14 += v * b0;\n        t15 += v * b1;\n        t16 += v * b2;\n        t17 += v * b3;\n        t18 += v * b4;\n        t19 += v * b5;\n        t20 += v * b6;\n        t21 += v * b7;\n        t22 += v * b8;\n        t23 += v * b9;\n        t24 += v * b10;\n        t25 += v * b11;\n        t26 += v * b12;\n        t27 += v * b13;\n        t28 += v * b14;\n        t29 += v * b15;\n        v = a[15];\n        t15 += v * b0;\n        t16 += v * b1;\n        t17 += v * b2;\n        t18 += v * b3;\n        t19 += v * b4;\n        t20 += v * b5;\n        t21 += v * b6;\n        t22 += v * b7;\n        t23 += v * b8;\n        t24 += v * b9;\n        t25 += v * b10;\n        t26 += v * b11;\n        t27 += v * b12;\n        t28 += v * b13;\n        t29 += v * b14;\n        t30 += v * b15;\n        t0 += 38 * t16;\n        t1 += 38 * t17;\n        t2 += 38 * t18;\n        t3 += 38 * t19;\n        t4 += 38 * t20;\n        t5 += 38 * t21;\n        t6 += 38 * t22;\n        t7 += 38 * t23;\n        t8 += 38 * t24;\n        t9 += 38 * t25;\n        t10 += 38 * t26;\n        t11 += 38 * t27;\n        t12 += 38 * t28;\n        t13 += 38 * t29;\n        t14 += 38 * t30;\n        // t15 left as is\n        // first car\n        c = 1;\n        v = t0 + c + 65535;\n        c = Math.floor(v / 65536);\n        t0 = v - c * 65536;\n        v = t1 + c + 65535;\n        c = Math.floor(v / 65536);\n        t1 = v - c * 65536;\n        v = t2 + c + 65535;\n        c = Math.floor(v / 65536);\n        t2 = v - c * 65536;\n        v = t3 + c + 65535;\n        c = Math.floor(v / 65536);\n        t3 = v - c * 65536;\n        v = t4 + c + 65535;\n        c = Math.floor(v / 65536);\n        t4 = v - c * 65536;\n        v = t5 + c + 65535;\n        c = Math.floor(v / 65536);\n        t5 = v - c * 65536;\n        v = t6 + c + 65535;\n        c = Math.floor(v / 65536);\n        t6 = v - c * 65536;\n        v = t7 + c + 65535;\n        c = Math.floor(v / 65536);\n        t7 = v - c * 65536;\n        v = t8 + c + 65535;\n        c = Math.floor(v / 65536);\n        t8 = v - c * 65536;\n        v = t9 + c + 65535;\n        c = Math.floor(v / 65536);\n        t9 = v - c * 65536;\n        v = t10 + c + 65535;\n        c = Math.floor(v / 65536);\n        t10 = v - c * 65536;\n        v = t11 + c + 65535;\n        c = Math.floor(v / 65536);\n        t11 = v - c * 65536;\n        v = t12 + c + 65535;\n        c = Math.floor(v / 65536);\n        t12 = v - c * 65536;\n        v = t13 + c + 65535;\n        c = Math.floor(v / 65536);\n        t13 = v - c * 65536;\n        v = t14 + c + 65535;\n        c = Math.floor(v / 65536);\n        t14 = v - c * 65536;\n        v = t15 + c + 65535;\n        c = Math.floor(v / 65536);\n        t15 = v - c * 65536;\n        t0 += c - 1 + 37 * (c - 1);\n        // second car\n        c = 1;\n        v = t0 + c + 65535;\n        c = Math.floor(v / 65536);\n        t0 = v - c * 65536;\n        v = t1 + c + 65535;\n        c = Math.floor(v / 65536);\n        t1 = v - c * 65536;\n        v = t2 + c + 65535;\n        c = Math.floor(v / 65536);\n        t2 = v - c * 65536;\n        v = t3 + c + 65535;\n        c = Math.floor(v / 65536);\n        t3 = v - c * 65536;\n        v = t4 + c + 65535;\n        c = Math.floor(v / 65536);\n        t4 = v - c * 65536;\n        v = t5 + c + 65535;\n        c = Math.floor(v / 65536);\n        t5 = v - c * 65536;\n        v = t6 + c + 65535;\n        c = Math.floor(v / 65536);\n        t6 = v - c * 65536;\n        v = t7 + c + 65535;\n        c = Math.floor(v / 65536);\n        t7 = v - c * 65536;\n        v = t8 + c + 65535;\n        c = Math.floor(v / 65536);\n        t8 = v - c * 65536;\n        v = t9 + c + 65535;\n        c = Math.floor(v / 65536);\n        t9 = v - c * 65536;\n        v = t10 + c + 65535;\n        c = Math.floor(v / 65536);\n        t10 = v - c * 65536;\n        v = t11 + c + 65535;\n        c = Math.floor(v / 65536);\n        t11 = v - c * 65536;\n        v = t12 + c + 65535;\n        c = Math.floor(v / 65536);\n        t12 = v - c * 65536;\n        v = t13 + c + 65535;\n        c = Math.floor(v / 65536);\n        t13 = v - c * 65536;\n        v = t14 + c + 65535;\n        c = Math.floor(v / 65536);\n        t14 = v - c * 65536;\n        v = t15 + c + 65535;\n        c = Math.floor(v / 65536);\n        t15 = v - c * 65536;\n        t0 += c - 1 + 37 * (c - 1);\n        o[0] = t0;\n        o[1] = t1;\n        o[2] = t2;\n        o[3] = t3;\n        o[4] = t4;\n        o[5] = t5;\n        o[6] = t6;\n        o[7] = t7;\n        o[8] = t8;\n        o[9] = t9;\n        o[10] = t10;\n        o[11] = t11;\n        o[12] = t12;\n        o[13] = t13;\n        o[14] = t14;\n        o[15] = t15;\n    }\n    static S(o, a) {\n        this.M(o, a, a);\n    }\n    static inv25519(o, i) {\n        const c = this.gf();\n        for (let a = 0; a < 16; a++)\n            c[a] = i[a];\n        for (let a = 253; a >= 0; a--) {\n            this.S(c, c);\n            if (a !== 2 && a !== 4)\n                this.M(c, c, i);\n        }\n        for (let a = 0; a < 16; a++)\n            o[a] = c[a];\n    }\n    static pow2523(o, i) {\n        const c = this.gf();\n        for (let a = 0; a < 16; a++)\n            c[a] = i[a];\n        for (let a = 250; a >= 0; a--) {\n            this.S(c, c);\n            if (a !== 1)\n                this.M(c, c, i);\n        }\n        for (let a = 0; a < 16; a++)\n            o[a] = c[a];\n    }\n    // Note: difference from TweetNaCl - BLAKE2b used to hash instead of SHA-512.\n    static crypto_hash(out, m, n) {\n        const input = new Uint8Array(n);\n        for (let i = 0; i < n; ++i)\n            input[i] = m[i];\n        const hash = new Blake2b(64).update(m).digest();\n        for (let i = 0; i < 64; ++i)\n            out[i] = hash[i];\n        return 0;\n    }\n    static add(p, q) {\n        const a = this.gf();\n        const b = this.gf();\n        const c = this.gf();\n        const d = this.gf();\n        const e = this.gf();\n        const f = this.gf();\n        const g = this.gf();\n        const h = this.gf();\n        const t = this.gf();\n        this.Z(a, p[1], p[0]);\n        this.Z(t, q[1], q[0]);\n        this.M(a, a, t);\n        this.A(b, p[0], p[1]);\n        this.A(t, q[0], q[1]);\n        this.M(b, b, t);\n        this.M(c, p[3], q[3]);\n        this.M(c, c, this.D2);\n        this.M(d, p[2], q[2]);\n        this.A(d, d, d);\n        this.Z(e, b, a);\n        this.Z(f, d, c);\n        this.A(g, d, c);\n        this.A(h, b, a);\n        this.M(p[0], e, f);\n        this.M(p[1], h, g);\n        this.M(p[2], g, f);\n        this.M(p[3], e, h);\n    }\n    static cswap(p, q, b) {\n        for (let i = 0; i < 4; i++) {\n            this.sel25519(p[i], q[i], b);\n        }\n    }\n    static pack(r, p) {\n        const tx = this.gf();\n        const ty = this.gf();\n        const zi = this.gf();\n        this.inv25519(zi, p[2]);\n        this.M(tx, p[0], zi);\n        this.M(ty, p[1], zi);\n        this.pack25519(r, ty);\n        r[31] ^= this.par25519(tx) << 7;\n    }\n    static scalarmult(p, q, s) {\n        this.set25519(p[0], this.gf0);\n        this.set25519(p[1], this.gf1);\n        this.set25519(p[2], this.gf1);\n        this.set25519(p[3], this.gf0);\n        for (let i = 255; i >= 0; --i) {\n            const b = (s[(i / 8) | 0] >> (i & 7)) & 1;\n            this.cswap(p, q, b);\n            this.add(q, p);\n            this.add(p, p);\n            this.cswap(p, q, b);\n        }\n    }\n    static scalarbase(p, s) {\n        const q = [this.gf(), this.gf(), this.gf(), this.gf()];\n        this.set25519(q[0], this.X);\n        this.set25519(q[1], this.Y);\n        this.set25519(q[2], this.gf1);\n        this.M(q[3], this.X, this.Y);\n        this.scalarmult(p, q, s);\n    }\n    static L = new Float64Array([\n        0xed, 0xd3, 0xf5, 0x5c, 0x1a, 0x63, 0x12, 0x58,\n        0xd6, 0x9c, 0xf7, 0xa2, 0xde, 0xf9, 0xde, 0x14,\n        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10\n    ]);\n    static modL(r, x) {\n        let carry, i, j, k;\n        for (i = 63; i >= 32; --i) {\n            carry = 0;\n            for (j = i - 32, k = i - 12; j < k; ++j) {\n                x[j] += carry - 16 * x[i] * this.L[j - (i - 32)];\n                carry = Math.floor((x[j] + 128) / 256);\n                x[j] -= carry * 256;\n            }\n            x[j] += carry;\n            x[i] = 0;\n        }\n        carry = 0;\n        for (j = 0; j < 32; j++) {\n            x[j] += carry - (x[31] >> 4) * this.L[j];\n            carry = x[j] >> 8;\n            x[j] &= 255;\n        }\n        for (j = 0; j < 32; j++)\n            x[j] -= carry * this.L[j];\n        for (i = 0; i < 32; i++) {\n            x[i + 1] += x[i] >> 8;\n            r[i] = x[i] & 255;\n        }\n    }\n    static reduce(r) {\n        let x = new Float64Array(64);\n        for (let i = 0; i < 64; i++)\n            x[i] = r[i];\n        for (let i = 0; i < 64; i++)\n            r[i] = 0;\n        this.modL(r, x);\n    }\n    // Note: difference from C - smlen returned, not passed as argument.\n    static crypto_sign(sm, m, n, sk, pk) {\n        const d = new Uint8Array(64);\n        const h = new Uint8Array(64);\n        const r = new Uint8Array(64);\n        const x = new Float64Array(64);\n        const p = [this.gf(), this.gf(), this.gf(), this.gf()];\n        this.crypto_hash(d, sk, 32);\n        d[0] &= 248;\n        d[31] &= 127;\n        d[31] |= 64;\n        const smlen = n + 64;\n        for (let i = 0; i < n; i++)\n            sm[64 + i] = m[i];\n        for (let i = 0; i < 32; i++)\n            sm[32 + i] = d[32 + i];\n        this.crypto_hash(r, sm.subarray(32), n + 32);\n        this.reduce(r);\n        this.scalarbase(p, r);\n        this.pack(sm, p);\n        for (let i = 0; i < 32; i++)\n            sm[i + 32] = pk[i];\n        this.crypto_hash(h, sm, n + 64);\n        this.reduce(h);\n        for (let i = 0; i < 64; i++)\n            x[i] = 0;\n        for (let i = 0; i < 32; i++)\n            x[i] = r[i];\n        for (let i = 0; i < 32; i++) {\n            for (let j = 0; j < 32; j++) {\n                x[i + j] += h[i] * d[j];\n            }\n        }\n        this.modL(sm.subarray(32), x);\n        return smlen;\n    }\n    static unpackneg(r, p) {\n        const t = this.gf();\n        const chk = this.gf();\n        const num = this.gf();\n        const den = this.gf();\n        const den2 = this.gf();\n        const den4 = this.gf();\n        const den6 = this.gf();\n        this.set25519(r[2], this.gf1);\n        this.unpack25519(r[1], p);\n        this.S(num, r[1]);\n        this.M(den, num, this.D);\n        this.Z(num, num, r[2]);\n        this.A(den, r[2], den);\n        this.S(den2, den);\n        this.S(den4, den2);\n        this.M(den6, den4, den2);\n        this.M(t, den6, num);\n        this.M(t, t, den);\n        this.pow2523(t, t);\n        this.M(t, t, num);\n        this.M(t, t, den);\n        this.M(t, t, den);\n        this.M(r[0], t, den);\n        this.S(chk, r[0]);\n        this.M(chk, chk, den);\n        if (this.neq25519(chk, num))\n            this.M(r[0], r[0], this.I);\n        this.S(chk, r[0]);\n        this.M(chk, chk, den);\n        if (this.neq25519(chk, num))\n            return -1;\n        if (this.par25519(r[0]) === (p[31] >> 7))\n            this.Z(r[0], this.gf0, r[0]);\n        this.M(r[3], r[0], r[1]);\n        return 0;\n    }\n    static crypto_sign_open(m, sm, n, pk) {\n        const t = new Uint8Array(32);\n        const h = new Uint8Array(64);\n        const p = [this.gf(), this.gf(), this.gf(), this.gf()];\n        const q = [this.gf(), this.gf(), this.gf(), this.gf()];\n        if (n < 64)\n            return -1;\n        if (this.unpackneg(q, pk))\n            return -1;\n        for (let i = 0; i < n; i++)\n            m[i] = sm[i];\n        for (let i = 0; i < 32; i++)\n            m[i + 32] = pk[i];\n        this.crypto_hash(h, m, n);\n        this.reduce(h);\n        this.scalarmult(p, q, h);\n        this.scalarbase(q, sm.subarray(32));\n        this.add(p, q);\n        this.pack(t, p);\n        n -= 64;\n        if (this.crypto_verify_32(sm, 0, t, 0)) {\n            for (let i = 0; i < n; i++)\n                m[i] = 0;\n            return -1;\n        }\n        for (let i = 0; i < n; i++)\n            m[i] = sm[i + 64];\n        return n;\n    }\n    static crypto_sign_BYTES = 64;\n    static crypto_sign_PUBLICKEYBYTES = 32;\n    static crypto_sign_SECRETKEYBYTES = 32;\n    static crypto_sign_SEEDBYTES = 32;\n    /* High-level API */\n    static checkArrayTypes(...args) {\n        for (let i = 0; i < args.length; i++) {\n            if (!(args[i] instanceof Uint8Array))\n                throw new TypeError(`expected Uint8Array; received ${args[i].constructor?.name ?? typeof args[i]}`);\n        }\n    }\n    static parseHex(hex) {\n        if (hex.length % 2 === 1)\n            hex = `0${hex}`;\n        const arr = hex.match(/.{1,2}/g)?.map(byte => parseInt(byte, 16));\n        return Uint8Array.from(arr ?? []);\n    }\n    static hexify(buf) {\n        let str = '';\n        for (let i = 0; i < buf.length; i++) {\n            if (typeof buf[i] !== 'number')\n                throw new TypeError(`expected number to convert to hex; received ${typeof buf[i]}`);\n            if (buf[i] < 0 || buf[i] > 255)\n                throw new RangeError(`expected byte value 0-255; received ${buf[i]}`);\n            str += buf[i].toString(16).padStart(2, '0');\n        }\n        return str;\n    }\n    static sign(msg, secretKey) {\n        this.checkArrayTypes(msg, secretKey);\n        if (secretKey.length !== this.crypto_sign_SECRETKEYBYTES)\n            throw new Error('bad secret key size');\n        var signedMsg = new Uint8Array(this.crypto_sign_BYTES + msg.length);\n        const publicKey = this.parseHex(this.convert(secretKey));\n        this.crypto_sign(signedMsg, msg, msg.length, secretKey, publicKey);\n        return signedMsg;\n    }\n    static open(signedMsg, publicKey) {\n        this.checkArrayTypes(signedMsg, publicKey);\n        if (publicKey.length !== this.crypto_sign_PUBLICKEYBYTES)\n            throw new Error('bad public key size');\n        const tmp = new Uint8Array(signedMsg.length);\n        var mlen = this.crypto_sign_open(tmp, signedMsg, signedMsg.length, publicKey);\n        if (mlen < 0)\n            return new Uint8Array(0);\n        var m = new Uint8Array(mlen);\n        for (var i = 0; i < m.length; i++)\n            m[i] = tmp[i];\n        return m;\n    }\n    static detached(msg, secretKey) {\n        var signedMsg = this.sign(msg, secretKey);\n        var sig = new Uint8Array(this.crypto_sign_BYTES);\n        for (var i = 0; i < sig.length; i++)\n            sig[i] = signedMsg[i];\n        return this.hexify(sig).toUpperCase();\n    }\n    static verify(msg, sig, publicKey) {\n        this.checkArrayTypes(msg, sig, publicKey);\n        if (sig.length !== this.crypto_sign_BYTES)\n            throw new Error('bad signature size');\n        if (publicKey.length !== this.crypto_sign_PUBLICKEYBYTES)\n            throw new Error('bad public key size');\n        const sm = new Uint8Array(this.crypto_sign_BYTES + msg.length);\n        const m = new Uint8Array(this.crypto_sign_BYTES + msg.length);\n        for (let i = 0; i < this.crypto_sign_BYTES; i++)\n            sm[i] = sig[i];\n        for (let i = 0; i < msg.length; i++)\n            sm[i + this.crypto_sign_BYTES] = msg[i];\n        return (this.crypto_sign_open(m, sm, sm.length, publicKey) >= 0);\n    }\n    static convert(seed) {\n        if (typeof seed === 'string')\n            seed = this.parseHex(seed);\n        this.checkArrayTypes(seed);\n        if (seed.length !== this.crypto_sign_SEEDBYTES)\n            throw new Error('bad seed size');\n        const pk = new Uint8Array(this.crypto_sign_PUBLICKEYBYTES);\n        const p = [this.gf(), this.gf(), this.gf(), this.gf()];\n        const hash = new Blake2b(64).update(seed).digest();\n        hash[0] &= 248;\n        hash[31] &= 127;\n        hash[31] |= 64;\n        this.scalarbase(p, hash);\n        this.pack(pk, p);\n        return this.hexify(pk).toUpperCase();\n    }\n}\nexport default `\r\n\tconst Blake2b = ${Blake2b}\r\n\tconst WorkerInterface = ${WorkerInterface}\r\n\tconst NanoNaCl = ${NanoNaCl}\r\n`;\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Blake2b } from './blake2b.js';\nimport { ACCOUNT_KEY_LENGTH, ALPHABET, PREFIX, PREFIX_LEGACY } from './constants.js';\nimport { base32, bytes, hex } from './convert.js';\nimport { Rpc } from './rpc.js';\nimport { Safe } from './safe.js';\nimport { NanoNaCl } from './workers/nano-nacl.js';\n/**\n* Represents a single Nano address and the associated public key. To include the\n* matching private key, it must be known at the time of object instantiation.\n* The frontier, balance, and representative for the account can also be set or\n* be fetched from the network.\n*/\nexport class Account {\n    static #isInternal = false;\n    #a;\n    #pub;\n    #prv;\n    #i;\n    #f;\n    #b;\n    #r;\n    #rep;\n    #w;\n    #s;\n    get address() { return `${PREFIX}${this.#a}`; }\n    get publicKey() { return this.#pub; }\n    get privateKey() { return this.#prv; }\n    get index() { return this.#i; }\n    get frontier() { return this.#f; }\n    get balance() { return this.#b; }\n    get receivable() { return this.#r; }\n    get representative() { return this.#rep; }\n    get weight() { return this.#w; }\n    set frontier(v) { this.#f = v; }\n    set balance(v) { this.#b = v ? BigInt(v) : undefined; }\n    set receivable(v) { this.#r = v ? BigInt(v) : undefined; }\n    set representative(v) {\n        if (v?.constructor === Account) {\n            this.#rep = v;\n        }\n        else if (typeof v === 'string') {\n            this.#rep = Account.fromAddress(v);\n        }\n        else {\n            throw new TypeError(`Invalid argument for account representative: ${v}`);\n        }\n    }\n    set weight(v) { this.#w = v ? BigInt(v) : undefined; }\n    constructor(address, publicKey, privateKey, index) {\n        if (!Account.#isInternal) {\n            throw new Error(`Account cannot be instantiated directly. Use factory methods instead.`);\n        }\n        if (index !== undefined && typeof index !== 'number') {\n            throw new TypeError(`Invalid index ${index} when creating Account ${address}`);\n        }\n        this.#a = address\n            .replace(PREFIX, '')\n            .replace(PREFIX_LEGACY, '');\n        this.#pub = publicKey;\n        this.#prv = privateKey ?? null;\n        this.#i = index;\n        this.#s = new Safe();\n        Account.#isInternal = false;\n    }\n    /**\n    * Instantiates an Account object from its Nano address.\n    *\n    * @param {string} address - Address of the account\n    * @param {number} [index] - Account number used when deriving the address\n    * @returns {Account} The instantiated Account object\n    */\n    static fromAddress(address, index) {\n        Account.#isInternal = true;\n        Account.validate(address);\n        const publicKey = Account.#addressToKey(address);\n        const account = new this(address, publicKey, undefined, index);\n        return account;\n    }\n    /**\n    * Instantiates an Account object from its public key.\n    *\n    * @param {string} publicKey - Public key of the account\n    * @param {number} [index] - Account number used when deriving the key\n    * @returns {Account} The instantiated Account object\n    */\n    static fromPublicKey(publicKey, index) {\n        Account.#isInternal = true;\n        Account.#validateKey(publicKey);\n        const address = Account.#keyToAddress(publicKey);\n        const account = new this(address, publicKey, undefined, index);\n        return account;\n    }\n    /**\n    * Instantiates an Account object from its private key. The\n    * corresponding public key will automatically be derived and saved.\n    *\n    * @param {string} privateKey - Private key of the account\n    * @param {number} [index] - Account number used when deriving the key\n    * @returns {Account} A new Account object\n    */\n    static fromPrivateKey(privateKey, index) {\n        Account.#isInternal = true;\n        Account.#validateKey(privateKey);\n        const publicKey = NanoNaCl.convert(privateKey);\n        const account = Account.fromPublicKey(publicKey, index);\n        account.#prv = privateKey.toUpperCase();\n        return account;\n    }\n    /**\n    * Instantiates an Account object from its public and private\n    * keys.\n    *\n    * WARNING: The validity of the keys is checked, but they are assumed to have\n    * been precalculated. Whether they are an actual matching pair is NOT checked!\n    * If unsure, use `Account.fromPrivateKey(key)` instead.\n    *\n    * @param {string} publicKey - Public key of the account\n    * @param {string} privateKey - Private key of the account\n    * @param {number} [index] - Account number used when deriving the key\n    * @returns {Account} The instantiated Account object\n    */\n    static fromKeypair(privateKey, publicKey, index) {\n        Account.#isInternal = true;\n        Account.#validateKey(privateKey);\n        const account = Account.fromPublicKey(publicKey, index);\n        account.#prv = privateKey.toUpperCase();\n        return account;\n    }\n    async lock(passkey) {\n        try {\n            if (this.#prv != null) {\n                await this.#s.put(this.#pub, passkey, this.#prv);\n            }\n        }\n        catch (err) {\n            console.error(`Failed to lock account ${this.address}`, err);\n            return false;\n        }\n        this.#prv = null;\n        return true;\n    }\n    async unlock(passkey) {\n        try {\n            this.#prv = await this.#s.get(this.#pub, passkey);\n        }\n        catch (err) {\n            console.error(`Failed to unlock account ${this.address}`, err);\n            return false;\n        }\n        return true;\n    }\n    /**\n    * Validates a Nano address with 'nano' and 'xrb' prefixes\n    * Derived from https://github.com/alecrios/nano-address-validator\n    *\n    * @param {string} address - Nano address to validate\n    * @throws Error if address is undefined, not a string, or an invalid format\n    */\n    static validate(address) {\n        if (address === undefined) {\n            throw new ReferenceError('Address is undefined.');\n        }\n        if (typeof address !== 'string') {\n            throw new TypeError('Address must be a string.');\n        }\n        const pattern = new RegExp(`^(${PREFIX}|${PREFIX_LEGACY})[13]{1}[${ALPHABET}]{59}$`);\n        if (!pattern.test(address)) {\n            throw new RangeError('Invalid address format');\n        }\n        const expectedChecksum = address.slice(-8);\n        const keyBase32 = address.slice(address.indexOf('_') + 1, -8);\n        const keyBuf = base32.toBytes(keyBase32);\n        const actualChecksumBuf = new Blake2b(5).update(keyBuf).digest();\n        actualChecksumBuf.reverse();\n        const actualChecksum = bytes.toBase32(actualChecksumBuf);\n        if (expectedChecksum !== actualChecksum) {\n            throw new Error('Incorrect address checksum');\n        }\n    }\n    /**\n    * Refreshes the account from its current state on the network.\n    *\n    * A successful response sets the balance, frontier, and representative\n    * properties.\n    *\n    * @param {Rpc|string|URL} rpc - RPC node information required to call `account_info`\n    */\n    async refresh(rpc) {\n        if (typeof rpc === 'string' || rpc.constructor === URL) {\n            rpc = new Rpc(rpc);\n        }\n        if (rpc.constructor !== Rpc) {\n            throw new TypeError('RPC must be a valid node');\n        }\n        const data = {\n            \"account\": this.address,\n            \"receivable\": \"true\",\n            \"representative\": \"true\",\n            \"weight\": \"true\"\n        };\n        const { balance, frontier, receivable, representative, weight } = await rpc.call('account_info', data);\n        if (frontier == null) {\n            throw new Error('Account not found');\n        }\n        this.#b = BigInt(balance);\n        this.#f = frontier;\n        this.#r = BigInt(receivable);\n        this.#rep = Account.fromAddress(representative);\n        this.#w = BigInt(weight);\n    }\n    static #addressToKey(v) {\n        const publicKeyBytes = base32.toBytes(v.slice(-60, -8));\n        const checksumBytes = base32.toBytes(v.slice(-8));\n        const rechecksumBytes = new Blake2b(5).update(publicKeyBytes).digest().reverse();\n        if (bytes.toHex(checksumBytes) !== bytes.toHex(rechecksumBytes)) {\n            throw new Error('Checksum mismatch in address');\n        }\n        return bytes.toHex(publicKeyBytes);\n    }\n    static #keyToAddress(publicKey) {\n        const publicKeyBytes = hex.toBytes(publicKey);\n        const checksumBytes = new Blake2b(5).update(publicKeyBytes).digest().reverse();\n        const encodedPublicKey = bytes.toBase32(publicKeyBytes);\n        const encodedChecksum = bytes.toBase32(checksumBytes);\n        return `${PREFIX}${encodedPublicKey}${encodedChecksum}`;\n    }\n    static #validateKey(key) {\n        if (key === undefined) {\n            throw new TypeError(`Key is undefined`);\n        }\n        if (typeof key !== 'string') {\n            throw new TypeError(`Key must be a string`);\n        }\n        if (key.length !== ACCOUNT_KEY_LENGTH) {\n            throw new TypeError(`Key must be ${ACCOUNT_KEY_LENGTH} characters`);\n        }\n        if (!/^[0-9a-fA-F]+$/i.test(key)) {\n            throw new RangeError('Key is not a valid hexadecimal value');\n        }\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { WorkerInterface } from '../pool.js';\nexport class Bip44Ckd extends WorkerInterface {\n    static BIP44_COIN_NANO = 165;\n    static BIP44_PURPOSE = 44;\n    static HARDENED_OFFSET = 0x80000000;\n    static SLIP10_ED25519 = 'ed25519 seed';\n    static {\n        Bip44Ckd.listen();\n    }\n    static async work(data) {\n        for (const d of data) {\n            if (d.coin != null && d.coin !== this.BIP44_PURPOSE) {\n                d.privateKey = await this.ckd(d.seed, d.coin, d.index);\n            }\n            else {\n                d.privateKey = await this.nanoCKD(d.seed, d.index);\n            }\n        }\n        return data;\n    }\n    /**\n    * Derives a private child key following the BIP-32 and BIP-44 derivation path\n    * registered to the Nano block lattice. Only hardened child keys are defined.\n    *\n    * @param {string} seed - Hexadecimal seed derived from mnemonic phrase\n    * @param {number} index - Account number between 0 and 2^31-1\n    * @returns {Promise<string>} Private child key for the account\n    */\n    static async nanoCKD(seed, index) {\n        if (!Number.isSafeInteger(index) || index < 0 || index > 0x7fffffff) {\n            throw new RangeError(`Invalid child key index 0x${index.toString(16)}`);\n        }\n        return await this.ckd(seed, this.BIP44_COIN_NANO, index);\n    }\n    /**\n    * Derives a private child key for a coin by following the specified BIP-32 and\n    * BIP-44 derivation path. Purpose is always 44'. Only hardened child keys are\n    * defined.\n    *\n    * @param {string} seed - Hexadecimal seed derived from mnemonic phrase\n    * @param {number} coin - Number registered to a specific coin in SLIP-044\n    * @param {number} index - Account number between 0 and 2^31-1\n    * @returns {Promise<string>} Private child key for the account\n    */\n    static async ckd(seed, coin, index) {\n        if (seed.length < 32 || seed.length > 128) {\n            throw new RangeError(`Invalid seed length`);\n        }\n        if (!Number.isSafeInteger(index) || index < 0 || index > 0x7fffffff) {\n            throw new RangeError(`Invalid child key index 0x${index.toString(16)}`);\n        }\n        const masterKey = await this.slip10(this.SLIP10_ED25519, seed);\n        const purposeKey = await this.CKDpriv(masterKey, this.BIP44_PURPOSE + this.HARDENED_OFFSET);\n        const coinKey = await this.CKDpriv(purposeKey, coin + this.HARDENED_OFFSET);\n        const accountKey = await this.CKDpriv(coinKey, index + this.HARDENED_OFFSET);\n        const privateKey = new Uint8Array(accountKey.privateKey.buffer);\n        let hex = '';\n        for (let i = 0; i < privateKey.length; i++) {\n            hex += privateKey[i].toString(16).padStart(2, '0');\n        }\n        return hex;\n    }\n    static async slip10(curve, S) {\n        const key = new TextEncoder().encode(curve);\n        const data = new Uint8Array(64);\n        data.set(S.match(/.{1,2}/g).map(byte => parseInt(byte, 16)));\n        const I = await this.hmac(key, data);\n        const IL = new DataView(I.buffer.slice(0, I.length / 2));\n        const IR = new DataView(I.buffer.slice(I.length / 2));\n        return ({ privateKey: IL, chainCode: IR });\n    }\n    static async CKDpriv({ privateKey, chainCode }, index) {\n        const key = new Uint8Array(chainCode.buffer);\n        const data = new Uint8Array(37);\n        data.set([0]);\n        data.set(this.ser256(privateKey), 1);\n        data.set(this.ser32(index), 33);\n        const I = await this.hmac(key, data);\n        const IL = new DataView(I.buffer.slice(0, I.length / 2));\n        const IR = new DataView(I.buffer.slice(I.length / 2));\n        return ({ privateKey: IL, chainCode: IR });\n    }\n    static ser32(integer) {\n        if (typeof integer !== 'number') {\n            throw new TypeError(`Expected a number, received ${typeof integer}`);\n        }\n        if (integer > 0xffffffff) {\n            throw new RangeError(`Expected 32-bit integer, received ${integer.toString(2).length}-bit value: ${integer}`);\n        }\n        const view = new DataView(new ArrayBuffer(4));\n        view.setUint32(0, integer, false);\n        return new Uint8Array(view.buffer);\n    }\n    static ser256(integer) {\n        if (integer.constructor !== DataView) {\n            throw new TypeError(`Expected DataView, received ${typeof integer}`);\n        }\n        if (integer.byteLength > 32) {\n            throw new RangeError(`Expected 32-byte integer, received ${integer.byteLength}-byte value: ${integer}`);\n        }\n        return new Uint8Array(integer.buffer);\n    }\n    static async hmac(key, data) {\n        const { subtle } = globalThis.crypto;\n        const pk = await subtle.importKey('raw', key, { name: 'HMAC', hash: 'SHA-512' }, false, ['sign']);\n        const signature = await subtle.sign('HMAC', pk, data);\n        return new Uint8Array(signature);\n    }\n}\nexport default `\n\tconst WorkerInterface = ${WorkerInterface}\n\tconst Bip44Ckd = ${Bip44Ckd}\n`;\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n// Based on nano-webgl-pow by Ben Green (numtel) <ben@latenightsketches.com>\n// https://github.com/numtel/nano-webgl-pow\nimport { WorkerInterface } from '../pool.js';\nexport class Pow extends WorkerInterface {\n    static {\n        Pow.listen();\n    }\n    /**\n    * Calculates proof-of-work as described by the Nano cryptocurrency protocol.\n    *\n    * @param {any[]} data - Array of hashes and minimum thresholds\n    * @returns Promise for proof-of-work attached to original array objects\n    */\n    static async work(data) {\n        return new Promise(async (resolve, reject) => {\n            for (const d of data) {\n                try {\n                    d.work = await this.find(d.hash, d.threshold);\n                }\n                catch (err) {\n                    reject(err);\n                }\n            }\n            resolve(data);\n        });\n    }\n    /**\n    * Finds a nonce that satisfies the Nano proof-of-work requirements.\n    *\n    * @param {string} hashHex - Hexadecimal hash of previous block, or public key for new accounts\n    * @param {number} [threshold=0xfffffff8] - Difficulty of proof-of-work calculation\n    */\n    static async find(hash, threshold = 0xfffffff8) {\n        return new Promise(resolve => {\n            this.#calculate(hash, resolve, threshold);\n        });\n    }\n    // Vertex Shader\n    static #vsSource = `#version 300 es\n#pragma vscode_glsllint_stage: vert\nprecision highp float;\nlayout (location=0) in vec4 position;\nlayout (location=1) in vec2 uv;\n\nout vec2 uv_pos;\n\nvoid main() {\n\tuv_pos = uv;\n\tgl_Position = position;\n}`;\n    // Fragment shader\n    static #fsSource = `#version 300 es\n#pragma vscode_glsllint_stage: frag\nprecision highp float;\nprecision highp int;\n\nin vec2 uv_pos;\nout vec4 fragColor;\n\n// blockhash - array of precalculated block hash components\n// threshold - 0xfffffff8 for send/change blocks, 0xfffffe00 for all else\n// workload - Defines canvas size\nlayout(std140) uniform UBO {\n\tuint blockhash[8];\n\tuint threshold;\n\tfloat workload;\n};\n\n// Random work values\n// First 2 bytes will be overwritten by texture pixel position\n// Second 2 bytes will be modified if the canvas size is greater than 256x256\n// Last 4 bytes remain as generated externally\nlayout(std140) uniform WORK {\n\tuvec4 work[2];\n};\n\n// Defined separately from uint v[32] below as the original value is required\n// to calculate the second uint32 of the digest for threshold comparison\nconst uint BLAKE2B_IV32_1 = 0x6A09E667u;\n\n// Both buffers represent 16 uint64s as 32 uint32s\n// because that's what GLSL offers, just like Javascript\n\n// Compression buffer, intialized to 2 instances of the initialization vector\n// The following values have been modified from the BLAKE2B_IV:\n// OUTLEN is constant 8 bytes\n// v[0] ^= 0x01010000u ^ uint(OUTLEN);\n// INLEN is constant 40 bytes: work value (8) + block hash (32)\n// v[24] ^= uint(INLEN);\n// It's always the \"last\" compression at this INLEN\n// v[28] = ~v[28];\n// v[29] = ~v[29];\nuint v[32] = uint[32](\n\t0xF2BDC900u, 0x6A09E667u, 0x84CAA73Bu, 0xBB67AE85u,\n\t0xFE94F82Bu, 0x3C6EF372u, 0x5F1D36F1u, 0xA54FF53Au,\n\t0xADE682D1u, 0x510E527Fu, 0x2B3E6C1Fu, 0x9B05688Cu,\n\t0xFB41BD6Bu, 0x1F83D9ABu, 0x137E2179u, 0x5BE0CD19u,\n\t0xF3BCC908u, 0x6A09E667u, 0x84CAA73Bu, 0xBB67AE85u,\n\t0xFE94F82Bu, 0x3C6EF372u, 0x5F1D36F1u, 0xA54FF53Au,\n\t0xADE682F9u, 0x510E527Fu, 0x2B3E6C1Fu, 0x9B05688Cu,\n\t0x04BE4294u, 0xE07C2654u, 0x137E2179u, 0x5BE0CD19u\n);\n// Input data buffer\nuint m[32];\n\n// These are offsets into the input data buffer for each mixing step.\n// They are multiplied by 2 from the original SIGMA values in\n// the C reference implementation, which refered to uint64s.\nconst uint SIGMA82[192] = uint[192](\n\t0u,2u,4u,6u,8u,10u,12u,14u,16u,18u,20u,22u,24u,26u,28u,30u,\n\t28u,20u,8u,16u,18u,30u,26u,12u,2u,24u,0u,4u,22u,14u,10u,6u,\n\t22u,16u,24u,0u,10u,4u,30u,26u,20u,28u,6u,12u,14u,2u,18u,8u,\n\t14u,18u,6u,2u,26u,24u,22u,28u,4u,12u,10u,20u,8u,0u,30u,16u,\n\t18u,0u,10u,14u,4u,8u,20u,30u,28u,2u,22u,24u,12u,16u,6u,26u,\n\t4u,24u,12u,20u,0u,22u,16u,6u,8u,26u,14u,10u,30u,28u,2u,18u,\n\t24u,10u,2u,30u,28u,26u,8u,20u,0u,14u,12u,6u,18u,4u,16u,22u,\n\t26u,22u,14u,28u,24u,2u,6u,18u,10u,0u,30u,8u,16u,12u,4u,20u,\n\t12u,30u,28u,18u,22u,6u,0u,16u,24u,4u,26u,14u,2u,8u,20u,10u,\n\t20u,4u,16u,8u,14u,12u,2u,10u,30u,22u,18u,28u,6u,24u,26u,0u,\n\t0u,2u,4u,6u,8u,10u,12u,14u,16u,18u,20u,22u,24u,26u,28u,30u,\n\t28u,20u,8u,16u,18u,30u,26u,12u,2u,24u,0u,4u,22u,14u,10u,6u\n);\n\n// 64-bit unsigned addition within the compression buffer\n// Sets v[a,a+1] += b\n// b0 is the low 32 bits of b, b1 represents the high 32 bits\nvoid add_uint64 (uint a, uint b0, uint b1) {\n\tuint o0 = v[a] + b0;\n\tuint o1 = v[a+1u] + b1;\n\tif (v[a] > 0xFFFFFFFFu - b0) { // did low 32 bits overflow?\n\t\to1++;\n\t}\n\tv[a] = o0;\n\tv[a+1u] = o1;\n}\n\n// G Mixing function\nvoid B2B_G (uint a, uint b, uint c, uint d, uint ix, uint iy) {\n\tadd_uint64(a, v[b], v[b+1u]);\n\tadd_uint64(a, m[ix], m[ix+1u]);\n\n\t// v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated to the right by 32 bits\n\tuint xor0 = v[d] ^ v[a];\n\tuint xor1 = v[d+1u] ^ v[a+1u];\n\tv[d] = xor1;\n\tv[d+1u] = xor0;\n\n\tadd_uint64(c, v[d], v[d+1u]);\n\n\t// v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 24 bits\n\txor0 = v[b] ^ v[c];\n\txor1 = v[b+1u] ^ v[c+1u];\n\tv[b] = (xor0 >> 24u) ^ (xor1 << 8u);\n\tv[b+1u] = (xor1 >> 24u) ^ (xor0 << 8u);\n\n\tadd_uint64(a, v[b], v[b+1u]);\n\tadd_uint64(a, m[iy], m[iy+1u]);\n\n\t// v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated right by 16 bits\n\txor0 = v[d] ^ v[a];\n\txor1 = v[d+1u] ^ v[a+1u];\n\tv[d] = (xor0 >> 16u) ^ (xor1 << 16u);\n\tv[d+1u] = (xor1 >> 16u) ^ (xor0 << 16u);\n\n\tadd_uint64(c, v[d], v[d+1u]);\n\n\t// v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 63 bits\n\txor0 = v[b] ^ v[c];\n\txor1 = v[b+1u] ^ v[c+1u];\n\tv[b] = (xor1 >> 31u) ^ (xor0 << 1u);\n\tv[b+1u] = (xor0 >> 31u) ^ (xor1 << 1u);\n}\n\nvoid main() {\n\tint i;\n\tuvec4 u_work0 = work[0u];\n\tuvec4 u_work1 = work[1u];\n\tuint uv_x = uint(uv_pos.x * workload);\n\tuint uv_y = uint(uv_pos.y * workload);\n\tuint x_pos = uv_x % 256u;\n\tuint y_pos = uv_y % 256u;\n\tuint x_index = (uv_x - x_pos) / 256u;\n\tuint y_index = (uv_y - y_pos) / 256u;\n\n\t// First 2 work bytes are the x,y pos within the 256x256 area, the next\n\t// two bytes are modified from the random generated value, XOR'd with\n\t// the x,y area index of where this pixel is located\n\tm[0u] = (x_pos ^ (y_pos << 8u) ^ ((u_work0.b ^ x_index) << 16u) ^ ((u_work0.a ^ y_index) << 24u));\n\n\t// Remaining bytes are un-modified from the random generated value\n\tm[1u] = (u_work1.r ^ (u_work1.g << 8u) ^ (u_work1.b << 16u) ^ (u_work1.a << 24u));\n\n\t// Block hash\n\tfor (uint i = 0u; i < 8u; i = i + 1u) {\n\t\tm[i+2u] = blockhash[i];\n\t}\n\n\t// twelve rounds of mixing\n\tfor(uint i = 0u; i < 12u; i = i + 1u) {\n\t\tB2B_G(0u, 8u, 16u, 24u, SIGMA82[i * 16u + 0u], SIGMA82[i * 16u + 1u]);\n\t\tB2B_G(2u, 10u, 18u, 26u, SIGMA82[i * 16u + 2u], SIGMA82[i * 16u + 3u]);\n\t\tB2B_G(4u, 12u, 20u, 28u, SIGMA82[i * 16u + 4u], SIGMA82[i * 16u + 5u]);\n\t\tB2B_G(6u, 14u, 22u, 30u, SIGMA82[i * 16u + 6u], SIGMA82[i * 16u + 7u]);\n\t\tB2B_G(0u, 10u, 20u, 30u, SIGMA82[i * 16u + 8u], SIGMA82[i * 16u + 9u]);\n\t\tB2B_G(2u, 12u, 22u, 24u, SIGMA82[i * 16u + 10u], SIGMA82[i * 16u + 11u]);\n\t\tB2B_G(4u, 14u, 16u, 26u, SIGMA82[i * 16u + 12u], SIGMA82[i * 16u + 13u]);\n\t\tB2B_G(6u, 8u, 18u, 28u, SIGMA82[i * 16u + 14u], SIGMA82[i * 16u + 15u]);\n\t}\n\n\t// Pixel data is multipled by threshold test result (0 or 1)\n\t// First 4 bytes insignificant, only calculate digest of second 4 bytes\n\tif ((BLAKE2B_IV32_1 ^ v[1u] ^ v[17u]) > threshold) {\n\t\tfragColor = vec4(\n\t\t\tfloat(x_index + 1u)/255.0, // +1 to distinguish from 0 (unsuccessful) pixels\n\t\t\tfloat(y_index + 1u)/255.0, // Same as previous\n\t\t\tfloat(x_pos)/255.0, // Return the 2 custom bytes used in work value\n\t\t\tfloat(y_pos)/255.0  // Second custom byte\n\t\t);\n\t} else {\n \t\tdiscard;\n\t}\n}`;\n    /** Used to set canvas size. Must be a multiple of 256. */\n    static #WORKLOAD = 256 * Math.max(1, Math.floor(navigator.hardwareConcurrency));\n    static #hexify(arr) {\n        let out = '';\n        for (let i = arr.length - 1; i >= 0; i--) {\n            out += arr[i].toString(16).padStart(2, '0');\n        }\n        return out;\n    }\n    static #gl;\n    static #program;\n    static #vertexShader;\n    static #fragmentShader;\n    static #positionBuffer;\n    static #uvBuffer;\n    static #uboBuffer;\n    static #workBuffer;\n    static #query;\n    static #pixels;\n    // Vertex Positions, 2 triangles\n    static #positions = new Float32Array([\n        -1, -1, 0, -1, 1, 0, 1, 1, 0,\n        1, -1, 0, 1, 1, 0, -1, -1, 0\n    ]);\n    // Texture Positions\n    static #uvPosArray = new Float32Array([\n        1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1\n    ]);\n    // Compile\n    static {\n        this.#gl = new OffscreenCanvas(this.#WORKLOAD, this.#WORKLOAD).getContext('webgl2');\n        if (this.#gl == null)\n            throw new Error('WebGL 2 is required');\n        this.#gl.clearColor(0, 0, 0, 1);\n        this.#program = this.#gl.createProgram();\n        if (this.#program == null)\n            throw new Error('Failed to create shader program');\n        this.#vertexShader = this.#gl.createShader(this.#gl.VERTEX_SHADER);\n        if (this.#vertexShader == null)\n            throw new Error('Failed to create vertex shader');\n        this.#gl.shaderSource(this.#vertexShader, this.#vsSource);\n        this.#gl.compileShader(this.#vertexShader);\n        if (!this.#gl.getShaderParameter(this.#vertexShader, this.#gl.COMPILE_STATUS))\n            throw new Error(this.#gl.getShaderInfoLog(this.#vertexShader) ?? `Failed to compile vertex shader`);\n        this.#fragmentShader = this.#gl.createShader(this.#gl.FRAGMENT_SHADER);\n        if (this.#fragmentShader == null)\n            throw new Error('Failed to create fragment shader');\n        this.#gl.shaderSource(this.#fragmentShader, this.#fsSource);\n        this.#gl.compileShader(this.#fragmentShader);\n        if (!this.#gl.getShaderParameter(this.#fragmentShader, this.#gl.COMPILE_STATUS))\n            throw new Error(this.#gl.getShaderInfoLog(this.#fragmentShader) ?? `Failed to compile fragment shader`);\n        this.#gl.attachShader(this.#program, this.#vertexShader);\n        this.#gl.attachShader(this.#program, this.#fragmentShader);\n        this.#gl.linkProgram(this.#program);\n        if (!this.#gl.getProgramParameter(this.#program, this.#gl.LINK_STATUS))\n            throw new Error(this.#gl.getProgramInfoLog(this.#program) ?? `Failed to link program`);\n        // Construct simple 2D geometry\n        this.#gl.useProgram(this.#program);\n        const triangleArray = this.#gl.createVertexArray();\n        this.#gl.bindVertexArray(triangleArray);\n        this.#positionBuffer = this.#gl.createBuffer();\n        this.#gl.bindBuffer(this.#gl.ARRAY_BUFFER, this.#positionBuffer);\n        this.#gl.bufferData(this.#gl.ARRAY_BUFFER, this.#positions, this.#gl.STATIC_DRAW);\n        this.#gl.vertexAttribPointer(0, 3, this.#gl.FLOAT, false, 0, 0);\n        this.#gl.enableVertexAttribArray(0);\n        this.#uvBuffer = this.#gl.createBuffer();\n        this.#gl.bindBuffer(this.#gl.ARRAY_BUFFER, this.#uvBuffer);\n        this.#gl.bufferData(this.#gl.ARRAY_BUFFER, this.#uvPosArray, this.#gl.STATIC_DRAW);\n        this.#gl.vertexAttribPointer(1, 2, this.#gl.FLOAT, false, 0, 0);\n        this.#gl.enableVertexAttribArray(1);\n        this.#uboBuffer = this.#gl.createBuffer();\n        this.#gl.bindBuffer(this.#gl.UNIFORM_BUFFER, this.#uboBuffer);\n        this.#gl.bufferData(this.#gl.UNIFORM_BUFFER, 144, this.#gl.DYNAMIC_DRAW);\n        this.#gl.bindBuffer(this.#gl.UNIFORM_BUFFER, null);\n        this.#gl.bindBufferBase(this.#gl.UNIFORM_BUFFER, 0, this.#uboBuffer);\n        this.#gl.uniformBlockBinding(this.#program, this.#gl.getUniformBlockIndex(this.#program, 'UBO'), 0);\n        this.#workBuffer = this.#gl.createBuffer();\n        this.#gl.bindBuffer(this.#gl.UNIFORM_BUFFER, this.#workBuffer);\n        this.#gl.bufferData(this.#gl.UNIFORM_BUFFER, 32, this.#gl.STREAM_DRAW);\n        this.#gl.bindBuffer(this.#gl.UNIFORM_BUFFER, null);\n        this.#gl.bindBufferBase(this.#gl.UNIFORM_BUFFER, 1, this.#workBuffer);\n        this.#gl.uniformBlockBinding(this.#program, this.#gl.getUniformBlockIndex(this.#program, 'WORK'), 1);\n        this.#pixels = new Uint8Array(this.#gl.drawingBufferWidth * this.#gl.drawingBufferHeight * 4);\n        this.#query = this.#gl.createQuery();\n    }\n    static #calculate(hashHex, callback, threshold) {\n        if (Pow.#gl == null)\n            throw new Error('WebGL 2 is required');\n        if (!/^[A-F-a-f0-9]{64}$/.test(hashHex))\n            throw new Error(`invalid_hash ${hashHex}`);\n        if (typeof threshold !== 'number')\n            throw new TypeError(`Invalid threshold ${threshold}`);\n        if (this.#gl == null)\n            throw new Error('WebGL 2 is required');\n        // Set up uniform buffer object\n        const uboView = new DataView(new ArrayBuffer(144));\n        for (let i = 0; i < 64; i += 8) {\n            const uint32 = hashHex.slice(i, i + 8);\n            uboView.setUint32(i * 2, parseInt(uint32, 16));\n        }\n        uboView.setUint32(128, threshold, true);\n        uboView.setFloat32(132, Pow.#WORKLOAD - 1, true);\n        Pow.#gl.bindBuffer(Pow.#gl.UNIFORM_BUFFER, Pow.#uboBuffer);\n        Pow.#gl.bufferSubData(Pow.#gl.UNIFORM_BUFFER, 0, uboView);\n        Pow.#gl.bindBuffer(Pow.#gl.UNIFORM_BUFFER, null);\n        // Draw output until success or progressCallback says to stop\n        const work = new Uint8Array(8);\n        let start;\n        const draw = () => {\n            start = performance.now();\n            if (Pow.#gl == null)\n                throw new Error('WebGL 2 is required');\n            if (Pow.#query == null)\n                throw new Error('WebGL 2 is required to run queries');\n            Pow.#gl.clear(Pow.#gl.COLOR_BUFFER_BIT);\n            // Upload work buffer\n            crypto.getRandomValues(work);\n            Pow.#gl.bindBuffer(Pow.#gl.UNIFORM_BUFFER, Pow.#workBuffer);\n            Pow.#gl.bufferSubData(Pow.#gl.UNIFORM_BUFFER, 0, Uint32Array.from(work));\n            Pow.#gl.bindBuffer(Pow.#gl.UNIFORM_BUFFER, null);\n            Pow.#gl.beginQuery(Pow.#gl.ANY_SAMPLES_PASSED_CONSERVATIVE, Pow.#query);\n            Pow.#gl.drawArrays(Pow.#gl.TRIANGLES, 0, 6);\n            Pow.#gl.endQuery(Pow.#gl.ANY_SAMPLES_PASSED_CONSERVATIVE);\n            requestAnimationFrame(checkQueryResult);\n        };\n        function checkQueryResult() {\n            if (Pow.#gl == null)\n                throw new Error('WebGL 2 is required to check query results');\n            if (Pow.#query == null)\n                throw new Error('Query not found');\n            console.log(`checking (${performance.now() - start} ms)`);\n            if (Pow.#gl.getQueryParameter(Pow.#query, Pow.#gl.QUERY_RESULT_AVAILABLE)) {\n                console.log(`AVAILABLE (${performance.now() - start} ms)`);\n                const anySamplesPassed = Pow.#gl.getQueryParameter(Pow.#query, Pow.#gl.QUERY_RESULT);\n                if (anySamplesPassed) {\n                    // A valid nonce was found\n                    readBackResult();\n                }\n                else {\n                    console.log(`not found (${performance.now() - start} ms)`);\n                    // No valid nonce found, start the next draw call\n                    requestAnimationFrame(draw);\n                }\n            }\n            else {\n                console.log(`not ready (${performance.now() - start} ms)`);\n                // Query result not yet available, check again in the next frame\n                requestAnimationFrame(checkQueryResult);\n            }\n        }\n        function readBackResult() {\n            if (Pow.#gl == null)\n                throw new Error('WebGL 2 is required to check read results');\n            Pow.#gl.readPixels(0, 0, Pow.#gl.drawingBufferWidth, Pow.#gl.drawingBufferHeight, Pow.#gl.RGBA, Pow.#gl.UNSIGNED_BYTE, Pow.#pixels);\n            // Check the pixels for any success\n            for (let i = 0; i < Pow.#pixels.length; i += 4) {\n                if (Pow.#pixels[i] !== 0) {\n                    console.log(`FOUND (${performance.now() - start} ms)`);\n                    const hex = Pow.#hexify(work.subarray(4, 8)) + Pow.#hexify([\n                        Pow.#pixels[i + 2],\n                        Pow.#pixels[i + 3],\n                        work[2] ^ (Pow.#pixels[i] - 1),\n                        work[3] ^ (Pow.#pixels[i + 1] - 1)\n                    ]);\n                    // Return the work value with the custom bits\n                    typeof callback === 'function' && callback(hex);\n                    return;\n                }\n            }\n        }\n        draw();\n    }\n}\nexport default `\n\tconst WorkerInterface = ${WorkerInterface}\n\tconst Pow = ${Pow}\n`;\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n// BLAKE2b hashing implementation derived from nano-webgl-pow by Ben Green <ben@latenightsketches.com> (https://github.com/numtel/nano-webgl-pow)\n/// <reference types=\"@webgpu/types\" />\nimport { WorkerInterface } from '../pool.js';\nexport class PowGpu extends WorkerInterface {\n    static {\n        PowGpu.listen();\n    }\n    /**\n    * Calculates proof-of-work as described by the Nano cryptocurrency protocol.\n    *\n    * @param {any[]} data - Array of hashes and minimum thresholds\n    * @returns Promise for proof-of-work attached to original array objects\n    */\n    static async work(data) {\n        return new Promise(async (resolve, reject) => {\n            for (const d of data) {\n                try {\n                    d.work = await this.find(d.hash, d.threshold);\n                }\n                catch (err) {\n                    reject(err);\n                }\n            }\n            resolve(data);\n        });\n    }\n    /**\n    * Finds a nonce that satisfies the Nano proof-of-work requirements.\n    *\n    * @param {string} hash - Hexadecimal hash of previous block, or public key for new accounts\n    * @param {number} [threshold=0xfffffff8] - Difficulty of proof-of-work calculation\n    */\n    static async find(hash, threshold = 0xfffffff8) {\n        return new Promise(async (resolve) => {\n            await this.#calculate(hash, resolve, threshold);\n        });\n    }\n    // WebGPU Compute Shader\n    static #shader = `\n\t\tstruct UBO {\n\t\t\tblockhash: array<vec4<u32>, 2>,\n\t\t\tthreshold: u32\n\t\t};\n\t\t@group(0) @binding(0) var<uniform> ubo: UBO;\n\n\t\tstruct WORK {\n\t\t\tnonce: vec2<u32>,\n\t\t\tfound: atomic<u32>\n\t\t};\n\t\t@group(0) @binding(1) var<storage, read_write> work: WORK;\n\n\t\t/**\n\t\t* Defined separately from uint v[32] below as the original value is required\n\t\t* to calculate the second uint32 of the digest for threshold comparison\n\t\t*/\n\t\tconst BLAKE2B_IV32_1: u32 = 0x6A09E667u;\n\n\t\t/**\n\t\t* These are offsets into the input data buffer for each mixing step.\n\t\t* They are multiplied by 2 from the original SIGMA values in\n\t\t* the C reference implementation, which refered to uint64s.\n\t\t*/\n\t\tconst SIGMA82: array<u32, 192> = array<u32, 192>(\n\t\t\t0u,2u,4u,6u,8u,10u,12u,14u,16u,18u,20u,22u,24u,26u,28u,30u,\n\t\t\t28u,20u,8u,16u,18u,30u,26u,12u,2u,24u,0u,4u,22u,14u,10u,6u,\n\t\t\t22u,16u,24u,0u,10u,4u,30u,26u,20u,28u,6u,12u,14u,2u,18u,8u,\n\t\t\t14u,18u,6u,2u,26u,24u,22u,28u,4u,12u,10u,20u,8u,0u,30u,16u,\n\t\t\t18u,0u,10u,14u,4u,8u,20u,30u,28u,2u,22u,24u,12u,16u,6u,26u,\n\t\t\t4u,24u,12u,20u,0u,22u,16u,6u,8u,26u,14u,10u,30u,28u,2u,18u,\n\t\t\t24u,10u,2u,30u,28u,26u,8u,20u,0u,14u,12u,6u,18u,4u,16u,22u,\n\t\t\t26u,22u,14u,28u,24u,2u,6u,18u,10u,0u,30u,8u,16u,12u,4u,20u,\n\t\t\t12u,30u,28u,18u,22u,6u,0u,16u,24u,4u,26u,14u,2u,8u,20u,10u,\n\t\t\t20u,4u,16u,8u,14u,12u,2u,10u,30u,22u,18u,28u,6u,24u,26u,0u,\n\t\t\t0u,2u,4u,6u,8u,10u,12u,14u,16u,18u,20u,22u,24u,26u,28u,30u,\n\t\t\t28u,20u,8u,16u,18u,30u,26u,12u,2u,24u,0u,4u,22u,14u,10u,6u\n\t\t);\n\n\t\t/**\n\t\t* 64-bit unsigned addition within the compression buffer\n\t\t* Sets v[i,i+1] += b\n\t\t* LSb is the Least-Significant (32) Bits of b\n\t\t* MSb is the Most-Significant (32) Bits of b\n\t\t* If LSb overflows, increment MSb operand\n\t\t*/\n\t\tfn add_uint64 (v: ptr<function, array<u32, 32>>, i: u32, LSb: u32, MSb: u32) {\n\t\t\tvar o0: u32 = (*v)[i] + LSb;\n\t\t\tvar o1: u32 = (*v)[i+1u] + MSb;\n\t\t\tif ((*v)[i] > 0xFFFFFFFFu - LSb) {\n\t\t\t\to1 = o1 + 1u;\n\t\t\t}\n\t\t\t(*v)[i] = o0;\n\t\t\t(*v)[i+1u] = o1;\n\t\t}\n\n\t\t/**\n\t\t* G Mixing function\n\t\t*/\n\t\tfn G (v: ptr<function, array<u32, 32>>, m: ptr<function, array<u32, 16>>, a: u32, b: u32, c: u32, d: u32, ix: u32, iy: u32) {\n\t\t\tadd_uint64(v, a, (*v)[b], (*v)[b+1u]);\n\t\t\tadd_uint64(v, a, (*m)[ix], (*m)[ix+1u]);\n\n\t\t\t// v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated to the right by 32 bits\n\t\t\tvar xor0: u32 = (*v)[d] ^ (*v)[a];\n\t\t\tvar xor1: u32 = (*v)[d+1u] ^ (*v)[a+1u];\n\t\t\t(*v)[d] = xor1;\n\t\t\t(*v)[d+1u] = xor0;\n\n\t\t\tadd_uint64(v, c, (*v)[d], (*v)[d+1u]);\n\n\t\t\t// v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 24 bits\n\t\t\txor0 = (*v)[b] ^ (*v)[c];\n\t\t\txor1 = (*v)[b+1u] ^ (*v)[c+1u];\n\t\t\t(*v)[b] = (xor0 >> 24u) ^ (xor1 << 8u);\n\t\t\t(*v)[b+1u] = (xor1 >> 24u) ^ (xor0 << 8u);\n\n\t\t\tadd_uint64(v, a, (*v)[b], (*v)[b+1u]);\n\t\t\tadd_uint64(v, a, (*m)[iy], (*m)[iy+1u]);\n\n\t\t\t// v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated right by 16 bits\n\t\t\txor0 = (*v)[d] ^ (*v)[a];\n\t\t\txor1 = (*v)[d+1u] ^ (*v)[a+1u];\n\t\t\t(*v)[d] = (xor0 >> 16u) ^ (xor1 << 16u);\n\t\t\t(*v)[d+1u] = (xor1 >> 16u) ^ (xor0 << 16u);\n\n\t\t\tadd_uint64(v, c, (*v)[d], (*v)[d+1u]);\n\n\t\t\t// v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 63 bits\n\t\t\txor0 = (*v)[b] ^ (*v)[c];\n\t\t\txor1 = (*v)[b+1u] ^ (*v)[c+1u];\n\t\t\t(*v)[b] = (xor1 >> 31u) ^ (xor0 << 1u);\n\t\t\t(*v)[b+1u] = (xor0 >> 31u) ^ (xor1 << 1u);\n\t\t}\n\n\t\t/**\n\t\t* Main compute function\n\t\t*\n\t\t* 8-byte work is split into two 4-byte u32\n\t\t* First 4 bytes will be iterated by shader\n\t\t* Last 4 bytes are defined by index of each thread\n\t\t*/\n\t\t@compute @workgroup_size(256)\n\t\tfn main(\n\t\t\t@builtin(workgroup_id) workgroup_id: vec3<u32>,\n\t\t\t@builtin(local_invocation_id) local_id: vec3<u32>\n\t\t) {\n\t\t\tvar id: u32 = ((workgroup_id.x & 0xff) << 24) |\n\t\t\t\t\t\t\t\t\t\t((workgroup_id.y & 0xff) << 16) |\n\t\t\t\t\t\t\t\t\t\t((workgroup_id.z & 0xff) << 8) |\n\t\t\t\t\t\t\t\t\t\t(local_id.x & 0xff);\n\t\t\tvar m: array<u32, 16>;\n\t\t\tm[0u] = id;\n\t\t\tm[1u] = id;\n\t\t\tm[2u] = ubo.blockhash[0u].x;\n\t\t\tm[3u] = ubo.blockhash[0u].y;\n\t\t\tm[4u] = ubo.blockhash[0u].z;\n\t\t\tm[5u] = ubo.blockhash[0u].w;\n\t\t\tm[6u] = ubo.blockhash[1u].x;\n\t\t\tm[7u] = ubo.blockhash[1u].y;\n\t\t\tm[8u] = ubo.blockhash[1u].z;\n\t\t\tm[9u] = ubo.blockhash[1u].w;\n\n\n\t\t\t/**\n\t\t\t* Compression buffer, intialized to 2 instances of the initialization vector\n\t\t\t* The following values have been modified from the BLAKE2B_IV:\n\t\t\t* OUTLEN is constant 8 bytes\n\t\t\t* v[0u] ^= 0x01010000u ^ uint(OUTLEN);\n\t\t\t* INLEN is constant 40 bytes: work value (8) + block hash (32)\n\t\t\t* v[24u] ^= uint(INLEN);\n\t\t\t* It's always the \"last\" compression at this INLEN\n\t\t\t* v[28u] = ~v[28u];\n\t\t\t* v[29u] = ~v[29u];\n\t\t\t*/\n\t\t\tvar v = array<u32, 32>(\n\t\t\t\t0xF2BDC900u, 0x6A09E667u, 0x84CAA73Bu, 0xBB67AE85u,\n\t\t\t\t0xFE94F82Bu, 0x3C6EF372u, 0x5F1D36F1u, 0xA54FF53Au,\n\t\t\t\t0xADE682D1u, 0x510E527Fu, 0x2B3E6C1Fu, 0x9B05688Cu,\n\t\t\t\t0xFB41BD6Bu, 0x1F83D9ABu, 0x137E2179u, 0x5BE0CD19u,\n\t\t\t\t0xF3BCC908u, 0x6A09E667u, 0x84CAA73Bu, 0xBB67AE85u,\n\t\t\t\t0xFE94F82Bu, 0x3C6EF372u, 0x5F1D36F1u, 0xA54FF53Au,\n\t\t\t\t0xADE682F9u, 0x510E527Fu, 0x2B3E6C1Fu, 0x9B05688Cu,\n\t\t\t\t0x04BE4294u, 0xE07C2654u, 0x137E2179u, 0x5BE0CD19u\n\t\t\t);\n\n\t\t\t/**\n\t\t\t* Iterate and hash until nonce found\n\t\t\t*/\n\t\t\tfor (var j: u32 = id; j < id + 1u; j = j + 1u) {\n\t\t\t\tif (atomicLoad(&work.found) != 0u) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tm[0u] = j;\n\n\t\t\t\t// twelve rounds of mixing\n\t\t\t\tfor (var i: u32 = 0u; i < 12u; i = i + 1u) {\n\t\t\t\t\tG(&v, &m, 0u, 8u, 16u, 24u, SIGMA82[i * 16u + 0u], SIGMA82[i * 16u + 1u]);\n\t\t\t\t\tG(&v, &m, 2u, 10u, 18u, 26u, SIGMA82[i * 16u + 2u], SIGMA82[i * 16u + 3u]);\n\t\t\t\t\tG(&v, &m, 4u, 12u, 20u, 28u, SIGMA82[i * 16u + 4u], SIGMA82[i * 16u + 5u]);\n\t\t\t\t\tG(&v, &m, 6u, 14u, 22u, 30u, SIGMA82[i * 16u + 6u], SIGMA82[i * 16u + 7u]);\n\t\t\t\t\tG(&v, &m, 0u, 10u, 20u, 30u, SIGMA82[i * 16u + 8u], SIGMA82[i * 16u + 9u]);\n\t\t\t\t\tG(&v, &m, 2u, 12u, 22u, 24u, SIGMA82[i * 16u + 10u], SIGMA82[i * 16u + 11u]);\n\t\t\t\t\tG(&v, &m, 4u, 14u, 16u, 26u, SIGMA82[i * 16u + 12u], SIGMA82[i * 16u + 13u]);\n\t\t\t\t\tG(&v, &m, 6u, 8u, 18u, 28u, SIGMA82[i * 16u + 14u], SIGMA82[i * 16u + 15u]);\n\t\t\t\t}\n\n\t\t\t\t// Store the result directly into work array\n\t\t\t\tif ((BLAKE2B_IV32_1 ^ v[1u] ^ v[17u]) > ubo.threshold) {\n\t\t\t\t\tatomicStore(&work.found, 1u);\n\t\t\t\t\twork.nonce.x = id;\n\t\t\t\t\twork.nonce.y = j;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\t`;\n    // Initialize WebGPU\n    static #device = null;\n    static #gpuBuffer;\n    static #cpuBuffer;\n    static #bindGroupLayout;\n    static #pipeline;\n    // Initialize WebGPU\n    static {\n        // Request device and adapter\n        if (navigator.gpu == null) {\n            throw new Error('WebGPU is not supported in this browser.');\n        }\n        navigator.gpu.requestAdapter()\n            .then(adapter => {\n            if (adapter == null) {\n                throw new Error('WebGPU adapter refused by browser.');\n            }\n            adapter.requestDevice()\n                .then(device => {\n                this.#device = device;\n                // Create buffers for writing GPU calculations and reading from Javascript\n                this.#gpuBuffer = this.#device.createBuffer({\n                    size: 16,\n                    usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_DST | GPUBufferUsage.COPY_SRC\n                });\n                this.#cpuBuffer = this.#device.createBuffer({\n                    size: 16,\n                    usage: GPUBufferUsage.COPY_DST | GPUBufferUsage.MAP_READ\n                });\n                // Create binding group data structure and use it later once UBO is known\n                this.#bindGroupLayout = this.#device.createBindGroupLayout({\n                    entries: [\n                        {\n                            binding: 0,\n                            visibility: GPUShaderStage.COMPUTE,\n                            buffer: {\n                                type: 'uniform'\n                            },\n                        },\n                        {\n                            binding: 1,\n                            visibility: GPUShaderStage.COMPUTE,\n                            buffer: {\n                                type: 'storage'\n                            },\n                        }\n                    ]\n                });\n                // Create pipeline to connect compute shader to binding layout\n                this.#pipeline = this.#device.createComputePipeline({\n                    layout: this.#device.createPipelineLayout({\n                        bindGroupLayouts: [this.#bindGroupLayout]\n                    }),\n                    compute: {\n                        entryPoint: 'main',\n                        module: this.#device.createShaderModule({\n                            code: this.#shader\n                        })\n                    }\n                });\n            });\n        })\n            .catch(err => { throw new Error(err.message); });\n    }\n    static async #calculate(hashHex, callback, threshold) {\n        if (!/^[A-Fa-f0-9]{64}$/.test(hashHex))\n            throw new Error(`Invalid hash ${hashHex}`);\n        if (typeof threshold !== 'number')\n            throw new TypeError(`Invalid threshold ${threshold}`);\n        // Ensure WebGPU is initialized else restart calculation\n        if (PowGpu.#device == null) {\n            setTimeout(async () => { await this.#calculate(hashHex, callback, threshold); }, 100);\n            return;\n        }\n        // Set up uniform buffer object\n        const uboView = new DataView(new ArrayBuffer(48));\n        for (let i = 0; i < 64; i += 8) {\n            const uint32 = hashHex.slice(i, i + 8);\n            uboView.setUint32(i / 2, parseInt(uint32, 16));\n        }\n        uboView.setUint32(32, threshold, true);\n        const uboBuffer = PowGpu.#device.createBuffer({\n            size: uboView.byteLength,\n            usage: GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST,\n        });\n        PowGpu.#device.queue.writeBuffer(uboBuffer, 0, uboView);\n        // Work buffer\n        const bindGroup = PowGpu.#device.createBindGroup({\n            layout: PowGpu.#bindGroupLayout,\n            entries: [\n                {\n                    binding: 0,\n                    resource: {\n                        buffer: uboBuffer,\n                    },\n                },\n                {\n                    binding: 1,\n                    resource: {\n                        buffer: PowGpu.#gpuBuffer,\n                    },\n                },\n            ],\n        });\n        // Create command encoder to issue commands to GPU and initiate computation\n        const commandEncoder = PowGpu.#device.createCommandEncoder();\n        const passEncoder = commandEncoder.beginComputePass();\n        // Issue commands and end compute pass structure\n        passEncoder.setPipeline(PowGpu.#pipeline);\n        passEncoder.setBindGroup(0, bindGroup);\n        passEncoder.dispatchWorkgroups(256, 256, 256);\n        passEncoder.end();\n        // Copy 8-byte nonce and 4-byte found flag from GPU to CPU for reading\n        commandEncoder.copyBufferToBuffer(PowGpu.#gpuBuffer, 0, PowGpu.#cpuBuffer, 0, 12);\n        // End computation by passing array of command buffers to command queue for execution\n        PowGpu.#device.queue.submit([commandEncoder.finish()]);\n        // Read results back to Javascript and then unmap buffer after reading\n        await PowGpu.#cpuBuffer.mapAsync(GPUMapMode.READ);\n        await PowGpu.#device.queue.onSubmittedWorkDone();\n        const data = new DataView(PowGpu.#cpuBuffer.getMappedRange());\n        const nonce = data.getBigUint64(0, true);\n        const found = !!data.getUint32(8);\n        console.log(new Uint32Array(data.buffer));\n        PowGpu.#cpuBuffer.unmap();\n        console.log(`found: ${found}`);\n        console.log(`nonce: ${nonce}`);\n        if (found) {\n            const hex = nonce.toString(16).padStart(16, '0');\n            typeof callback === 'function' && callback(hex);\n            return;\n        }\n        else {\n            console.warn(`PoW ended but 'found' is false for nonce: ${nonce}`);\n        }\n    }\n}\nexport default `\n\tconst WorkerInterface = ${WorkerInterface}\n\tconst PowGpu = ${PowGpu}\n`;\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { default as Bip44Ckd } from './workers/bip44-ckd.js';\nimport { default as NanoNaCl } from './workers/nano-nacl.js';\nimport { default as Pow } from './workers/powgl.js';\nimport { default as PowGpu } from './workers/powgpu.js';\nexport { Bip44Ckd, NanoNaCl, Pow, PowGpu };\n", "// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n  ? R.apply\n  : function ReflectApply(target, receiver, args) {\n    return Function.prototype.apply.call(target, receiver, args);\n  }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n  ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target)\n      .concat(Object.getOwnPropertySymbols(target));\n  };\n} else {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target);\n  };\n}\n\nfunction ProcessEmitWarning(warning) {\n  if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n  return value !== value;\n}\n\nfunction EventEmitter() {\n  EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n  if (typeof listener !== 'function') {\n    throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n  }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n  enumerable: true,\n  get: function() {\n    return defaultMaxListeners;\n  },\n  set: function(arg) {\n    if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n      throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n    }\n    defaultMaxListeners = arg;\n  }\n});\n\nEventEmitter.init = function() {\n\n  if (this._events === undefined ||\n      this._events === Object.getPrototypeOf(this)._events) {\n    this._events = Object.create(null);\n    this._eventsCount = 0;\n  }\n\n  this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n  if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n    throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n  }\n  this._maxListeners = n;\n  return this;\n};\n\nfunction _getMaxListeners(that) {\n  if (that._maxListeners === undefined)\n    return EventEmitter.defaultMaxListeners;\n  return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n  return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n  var args = [];\n  for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n  var doError = (type === 'error');\n\n  var events = this._events;\n  if (events !== undefined)\n    doError = (doError && events.error === undefined);\n  else if (!doError)\n    return false;\n\n  // If there is no 'error' event listener then throw.\n  if (doError) {\n    var er;\n    if (args.length > 0)\n      er = args[0];\n    if (er instanceof Error) {\n      // Note: The comments on the `throw` lines are intentional, they show\n      // up in Node's output if this results in an unhandled exception.\n      throw er; // Unhandled 'error' event\n    }\n    // At least give some kind of context to the user\n    var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n    err.context = er;\n    throw err; // Unhandled 'error' event\n  }\n\n  var handler = events[type];\n\n  if (handler === undefined)\n    return false;\n\n  if (typeof handler === 'function') {\n    ReflectApply(handler, this, args);\n  } else {\n    var len = handler.length;\n    var listeners = arrayClone(handler, len);\n    for (var i = 0; i < len; ++i)\n      ReflectApply(listeners[i], this, args);\n  }\n\n  return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n  var m;\n  var events;\n  var existing;\n\n  checkListener(listener);\n\n  events = target._events;\n  if (events === undefined) {\n    events = target._events = Object.create(null);\n    target._eventsCount = 0;\n  } else {\n    // To avoid recursion in the case that type === \"newListener\"! Before\n    // adding it to the listeners, first emit \"newListener\".\n    if (events.newListener !== undefined) {\n      target.emit('newListener', type,\n                  listener.listener ? listener.listener : listener);\n\n      // Re-assign `events` because a newListener handler could have caused the\n      // this._events to be assigned to a new object\n      events = target._events;\n    }\n    existing = events[type];\n  }\n\n  if (existing === undefined) {\n    // Optimize the case of one listener. Don't need the extra array object.\n    existing = events[type] = listener;\n    ++target._eventsCount;\n  } else {\n    if (typeof existing === 'function') {\n      // Adding the second element, need to change to array.\n      existing = events[type] =\n        prepend ? [listener, existing] : [existing, listener];\n      // If we've already got an array, just append.\n    } else if (prepend) {\n      existing.unshift(listener);\n    } else {\n      existing.push(listener);\n    }\n\n    // Check for listener leak\n    m = _getMaxListeners(target);\n    if (m > 0 && existing.length > m && !existing.warned) {\n      existing.warned = true;\n      // No error code for this since it is a Warning\n      // eslint-disable-next-line no-restricted-syntax\n      var w = new Error('Possible EventEmitter memory leak detected. ' +\n                          existing.length + ' ' + String(type) + ' listeners ' +\n                          'added. Use emitter.setMaxListeners() to ' +\n                          'increase limit');\n      w.name = 'MaxListenersExceededWarning';\n      w.emitter = target;\n      w.type = type;\n      w.count = existing.length;\n      ProcessEmitWarning(w);\n    }\n  }\n\n  return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n  return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n    function prependListener(type, listener) {\n      return _addListener(this, type, listener, true);\n    };\n\nfunction onceWrapper() {\n  if (!this.fired) {\n    this.target.removeListener(this.type, this.wrapFn);\n    this.fired = true;\n    if (arguments.length === 0)\n      return this.listener.call(this.target);\n    return this.listener.apply(this.target, arguments);\n  }\n}\n\nfunction _onceWrap(target, type, listener) {\n  var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n  var wrapped = onceWrapper.bind(state);\n  wrapped.listener = listener;\n  state.wrapFn = wrapped;\n  return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n  checkListener(listener);\n  this.on(type, _onceWrap(this, type, listener));\n  return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n    function prependOnceListener(type, listener) {\n      checkListener(listener);\n      this.prependListener(type, _onceWrap(this, type, listener));\n      return this;\n    };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n    function removeListener(type, listener) {\n      var list, events, position, i, originalListener;\n\n      checkListener(listener);\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      list = events[type];\n      if (list === undefined)\n        return this;\n\n      if (list === listener || list.listener === listener) {\n        if (--this._eventsCount === 0)\n          this._events = Object.create(null);\n        else {\n          delete events[type];\n          if (events.removeListener)\n            this.emit('removeListener', type, list.listener || listener);\n        }\n      } else if (typeof list !== 'function') {\n        position = -1;\n\n        for (i = list.length - 1; i >= 0; i--) {\n          if (list[i] === listener || list[i].listener === listener) {\n            originalListener = list[i].listener;\n            position = i;\n            break;\n          }\n        }\n\n        if (position < 0)\n          return this;\n\n        if (position === 0)\n          list.shift();\n        else {\n          spliceOne(list, position);\n        }\n\n        if (list.length === 1)\n          events[type] = list[0];\n\n        if (events.removeListener !== undefined)\n          this.emit('removeListener', type, originalListener || listener);\n      }\n\n      return this;\n    };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n    function removeAllListeners(type) {\n      var listeners, events, i;\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      // not listening for removeListener, no need to emit\n      if (events.removeListener === undefined) {\n        if (arguments.length === 0) {\n          this._events = Object.create(null);\n          this._eventsCount = 0;\n        } else if (events[type] !== undefined) {\n          if (--this._eventsCount === 0)\n            this._events = Object.create(null);\n          else\n            delete events[type];\n        }\n        return this;\n      }\n\n      // emit removeListener for all listeners on all events\n      if (arguments.length === 0) {\n        var keys = Object.keys(events);\n        var key;\n        for (i = 0; i < keys.length; ++i) {\n          key = keys[i];\n          if (key === 'removeListener') continue;\n          this.removeAllListeners(key);\n        }\n        this.removeAllListeners('removeListener');\n        this._events = Object.create(null);\n        this._eventsCount = 0;\n        return this;\n      }\n\n      listeners = events[type];\n\n      if (typeof listeners === 'function') {\n        this.removeListener(type, listeners);\n      } else if (listeners !== undefined) {\n        // LIFO order\n        for (i = listeners.length - 1; i >= 0; i--) {\n          this.removeListener(type, listeners[i]);\n        }\n      }\n\n      return this;\n    };\n\nfunction _listeners(target, type, unwrap) {\n  var events = target._events;\n\n  if (events === undefined)\n    return [];\n\n  var evlistener = events[type];\n  if (evlistener === undefined)\n    return [];\n\n  if (typeof evlistener === 'function')\n    return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n  return unwrap ?\n    unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n  return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n  return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n  if (typeof emitter.listenerCount === 'function') {\n    return emitter.listenerCount(type);\n  } else {\n    return listenerCount.call(emitter, type);\n  }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n  var events = this._events;\n\n  if (events !== undefined) {\n    var evlistener = events[type];\n\n    if (typeof evlistener === 'function') {\n      return 1;\n    } else if (evlistener !== undefined) {\n      return evlistener.length;\n    }\n  }\n\n  return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n  return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n  var copy = new Array(n);\n  for (var i = 0; i < n; ++i)\n    copy[i] = arr[i];\n  return copy;\n}\n\nfunction spliceOne(list, index) {\n  for (; index + 1 < list.length; index++)\n    list[index] = list[index + 1];\n  list.pop();\n}\n\nfunction unwrapListeners(arr) {\n  var ret = new Array(arr.length);\n  for (var i = 0; i < ret.length; ++i) {\n    ret[i] = arr[i].listener || arr[i];\n  }\n  return ret;\n}\n\nfunction once(emitter, name) {\n  return new Promise(function (resolve, reject) {\n    function errorListener(err) {\n      emitter.removeListener(name, resolver);\n      reject(err);\n    }\n\n    function resolver() {\n      if (typeof emitter.removeListener === 'function') {\n        emitter.removeListener('error', errorListener);\n      }\n      resolve([].slice.call(arguments));\n    };\n\n    eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n    if (name !== 'error') {\n      addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n    }\n  });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n  if (typeof emitter.on === 'function') {\n    eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n  }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n  if (typeof emitter.on === 'function') {\n    if (flags.once) {\n      emitter.once(name, listener);\n    } else {\n      emitter.on(name, listener);\n    }\n  } else if (typeof emitter.addEventListener === 'function') {\n    // EventTarget does not have `error` event semantics like Node\n    // EventEmitters, we do not listen for `error` events here.\n    emitter.addEventListener(name, function wrapListener(arg) {\n      // IE does not have builtin `{ once: true }` support so we\n      // have to do it manually.\n      if (flags.once) {\n        emitter.removeEventListener(name, wrapListener);\n      }\n      listener(arg);\n    });\n  } else {\n    throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n  }\n}\n", "/* eslint-disable no-continue */\n/* eslint-disable no-unused-vars */\n/* eslint-disable no-param-reassign */\n/* eslint-disable no-prototype-builtins */\n\nconst errorClasses = {};\nconst deserializers = {};\n\nexport const addCustomErrorDeserializer = (name: string, deserializer: (obj: any) => any): void => {\n  deserializers[name] = deserializer;\n};\n\nexport interface LedgerErrorConstructor<F extends { [key: string]: unknown }>\n  extends ErrorConstructor {\n  new (message?: string, fields?: F, options?: any): Error;\n  (message?: string, fields?: F, options?: any): Error;\n  readonly prototype: Error;\n}\n\nexport const createCustomErrorClass = <\n  F extends { [key: string]: unknown },\n  T extends LedgerErrorConstructor<F> = LedgerErrorConstructor<F>,\n>(\n  name: string,\n): T => {\n  class CustomErrorClass extends Error {\n    cause?: Error;\n    constructor(message?: string, fields?: F, options?: any) {\n      // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n      // @ts-ignore\n      super(message || name, options);\n      // Set the prototype explicitly. See https://github.com/Microsoft/TypeScript/wiki/Breaking-Changes#extending-built-ins-like-error-array-and-map-may-no-longer-work\n      Object.setPrototypeOf(this, CustomErrorClass.prototype);\n      this.name = name;\n      if (fields) {\n        for (const k in fields) {\n          // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n          // @ts-ignore\n          this[k] = fields[k];\n        }\n      }\n      if (options && isObject(options) && \"cause\" in options && !(\"cause\" in this)) {\n        // .cause was specified but the superconstructor\n        // did not create an instance property.\n        const cause = options.cause;\n        this.cause = cause;\n        if (\"stack\" in cause) {\n          this.stack = this.stack + \"\\nCAUSE: \" + cause.stack;\n        }\n      }\n    }\n  }\n\n  errorClasses[name] = CustomErrorClass;\n\n  return CustomErrorClass as unknown as T;\n};\n\nfunction isObject(value) {\n  return typeof value === \"object\";\n}\n\n// inspired from https://github.com/programble/errio/blob/master/index.js\nexport const deserializeError = (object: any): Error | undefined => {\n  if (object && typeof object === \"object\") {\n    try {\n      if (typeof object.message === \"string\") {\n        const msg = JSON.parse(object.message);\n        if (msg.message && msg.name) {\n          object = msg;\n        }\n      }\n    } catch (e) {\n      // nothing\n    }\n\n    let error;\n    if (typeof object.name === \"string\") {\n      const { name } = object;\n      const des = deserializers[name];\n      if (des) {\n        error = des(object);\n      } else {\n        let constructor = name === \"Error\" ? Error : errorClasses[name];\n\n        if (!constructor) {\n          console.warn(\"deserializing an unknown class '\" + name + \"'\");\n          constructor = createCustomErrorClass(name);\n        }\n\n        error = Object.create(constructor.prototype);\n        try {\n          for (const prop in object) {\n            if (object.hasOwnProperty(prop)) {\n              error[prop] = object[prop];\n            }\n          }\n        } catch (e) {\n          // sometimes setting a property can fail (e.g. .name)\n        }\n      }\n    } else {\n      if (typeof object.message === \"string\") {\n        error = new Error(object.message);\n      }\n    }\n\n    if (error && !error.stack && Error.captureStackTrace) {\n      Error.captureStackTrace(error, deserializeError);\n    }\n    return error;\n  }\n  return new Error(String(object));\n};\n\n// inspired from https://github.com/sindresorhus/serialize-error/blob/master/index.js\nexport const serializeError = (\n  value: undefined | To | string | (() => unknown),\n): undefined | To | string => {\n  if (!value) return value;\n  if (typeof value === \"object\") {\n    return destroyCircular(value, []);\n  }\n  if (typeof value === \"function\") {\n    return `[Function: ${value.name || \"anonymous\"}]`;\n  }\n  return value;\n};\n\ninterface To {\n  name?: string;\n  message?: string;\n  stack?: string;\n}\n\n// https://www.npmjs.com/package/destroy-circular\nfunction destroyCircular(from: To, seen: Array<To>): To {\n  const to: To = {};\n  seen.push(from);\n  for (const key of Object.keys(from)) {\n    const value = from[key];\n    if (typeof value === \"function\") {\n      continue;\n    }\n    if (!value || typeof value !== \"object\") {\n      to[key] = value;\n      continue;\n    }\n    if (seen.indexOf(from[key]) === -1) {\n      to[key] = destroyCircular(from[key], seen.slice(0));\n      continue;\n    }\n    to[key] = \"[Circular]\";\n  }\n  if (typeof from.name === \"string\") {\n    to.name = from.name;\n  }\n  if (typeof from.message === \"string\") {\n    to.message = from.message;\n  }\n  if (typeof from.stack === \"string\") {\n    to.stack = from.stack;\n  }\n  return to;\n}\n", "import {\n  serializeError,\n  deserializeError,\n  createCustomErrorClass,\n  addCustomErrorDeserializer,\n  LedgerErrorConstructor,\n} from \"./helpers\";\n\nexport { serializeError, deserializeError, createCustomErrorClass, addCustomErrorDeserializer };\n\nexport const AccountNameRequiredError = createCustomErrorClass(\"AccountNameRequired\");\nexport const AccountNotSupported = createCustomErrorClass(\"AccountNotSupported\");\nexport const AccountAwaitingSendPendingOperations = createCustomErrorClass(\n  \"AccountAwaitingSendPendingOperations\",\n);\nexport const AmountRequired = createCustomErrorClass(\"AmountRequired\");\nexport const BluetoothRequired = createCustomErrorClass(\"BluetoothRequired\");\nexport const BtcUnmatchedApp = createCustomErrorClass(\"BtcUnmatchedApp\");\nexport const CantOpenDevice = createCustomErrorClass(\"CantOpenDevice\");\nexport const CashAddrNotSupported = createCustomErrorClass(\"CashAddrNotSupported\");\nexport const ClaimRewardsFeesWarning = createCustomErrorClass(\"ClaimRewardsFeesWarning\");\nexport const CurrencyNotSupported = createCustomErrorClass<\n  { currencyName: string },\n  LedgerErrorConstructor<{ currencyName: string }>\n>(\"CurrencyNotSupported\");\nexport const DeviceAppVerifyNotSupported = createCustomErrorClass(\"DeviceAppVerifyNotSupported\");\nexport const DeviceGenuineSocketEarlyClose = createCustomErrorClass(\n  \"DeviceGenuineSocketEarlyClose\",\n);\nexport const DeviceNotGenuineError = createCustomErrorClass(\"DeviceNotGenuine\");\nexport const DeviceOnDashboardExpected = createCustomErrorClass(\"DeviceOnDashboardExpected\");\nexport const DeviceOnDashboardUnexpected = createCustomErrorClass(\"DeviceOnDashboardUnexpected\");\nexport const DeviceInOSUExpected = createCustomErrorClass(\"DeviceInOSUExpected\");\nexport const DeviceHalted = createCustomErrorClass(\"DeviceHalted\");\nexport const DeviceNameInvalid = createCustomErrorClass(\"DeviceNameInvalid\");\nexport const DeviceSocketFail = createCustomErrorClass(\"DeviceSocketFail\");\nexport const DeviceSocketNoBulkStatus = createCustomErrorClass(\"DeviceSocketNoBulkStatus\");\nexport const DeviceNeedsRestart = createCustomErrorClass(\"DeviceSocketNoBulkStatus\");\nexport const UnresponsiveDeviceError = createCustomErrorClass(\"UnresponsiveDeviceError\");\nexport const DisconnectedDevice = createCustomErrorClass(\"DisconnectedDevice\");\nexport const DisconnectedDeviceDuringOperation = createCustomErrorClass(\n  \"DisconnectedDeviceDuringOperation\",\n);\nexport const DeviceExtractOnboardingStateError = createCustomErrorClass(\n  \"DeviceExtractOnboardingStateError\",\n);\nexport const DeviceOnboardingStatePollingError = createCustomErrorClass(\n  \"DeviceOnboardingStatePollingError\",\n);\nexport const EnpointConfigError = createCustomErrorClass(\"EnpointConfig\");\nexport const EthAppPleaseEnableContractData = createCustomErrorClass(\n  \"EthAppPleaseEnableContractData\",\n);\nexport const FeeEstimationFailed = createCustomErrorClass(\"FeeEstimationFailed\");\nexport const FirmwareNotRecognized = createCustomErrorClass(\"FirmwareNotRecognized\");\nexport const HardResetFail = createCustomErrorClass(\"HardResetFail\");\nexport const InvalidXRPTag = createCustomErrorClass(\"InvalidXRPTag\");\nexport const InvalidAddress = createCustomErrorClass(\"InvalidAddress\");\nexport const InvalidNonce = createCustomErrorClass(\"InvalidNonce\");\nexport const InvalidAddressBecauseDestinationIsAlsoSource = createCustomErrorClass(\n  \"InvalidAddressBecauseDestinationIsAlsoSource\",\n);\nexport const LatestMCUInstalledError = createCustomErrorClass(\"LatestMCUInstalledError\");\nexport const UnknownMCU = createCustomErrorClass(\"UnknownMCU\");\nexport const LedgerAPIError = createCustomErrorClass(\"LedgerAPIError\");\nexport const LedgerAPIErrorWithMessage = createCustomErrorClass(\"LedgerAPIErrorWithMessage\");\nexport const LedgerAPINotAvailable = createCustomErrorClass(\"LedgerAPINotAvailable\");\nexport const ManagerAppAlreadyInstalledError = createCustomErrorClass(\"ManagerAppAlreadyInstalled\");\nexport const ManagerAppRelyOnBTCError = createCustomErrorClass(\"ManagerAppRelyOnBTC\");\nexport const ManagerAppDepInstallRequired = createCustomErrorClass(\"ManagerAppDepInstallRequired\");\nexport const ManagerAppDepUninstallRequired = createCustomErrorClass(\n  \"ManagerAppDepUninstallRequired\",\n);\nexport const ManagerDeviceLockedError = createCustomErrorClass(\"ManagerDeviceLocked\");\nexport const ManagerFirmwareNotEnoughSpaceError = createCustomErrorClass(\n  \"ManagerFirmwareNotEnoughSpace\",\n);\nexport const ManagerNotEnoughSpaceError = createCustomErrorClass(\"ManagerNotEnoughSpace\");\nexport const ManagerUninstallBTCDep = createCustomErrorClass(\"ManagerUninstallBTCDep\");\nexport const NetworkDown = createCustomErrorClass(\"NetworkDown\");\nexport const NetworkError = createCustomErrorClass(\"NetworkError\");\nexport const NoAddressesFound = createCustomErrorClass(\"NoAddressesFound\");\nexport const NotEnoughBalance = createCustomErrorClass(\"NotEnoughBalance\");\nexport const NotEnoughBalanceSwap = createCustomErrorClass(\"NotEnoughBalanceSwap\");\nexport const NotEnoughBalanceToDelegate = createCustomErrorClass(\"NotEnoughBalanceToDelegate\");\nexport const NotEnoughBalanceInParentAccount = createCustomErrorClass(\n  \"NotEnoughBalanceInParentAccount\",\n);\nexport const NotEnoughSpendableBalance = createCustomErrorClass(\"NotEnoughSpendableBalance\");\nexport const NotEnoughBalanceBecauseDestinationNotCreated = createCustomErrorClass(\n  \"NotEnoughBalanceBecauseDestinationNotCreated\",\n);\nexport const NoAccessToCamera = createCustomErrorClass(\"NoAccessToCamera\");\nexport const NotEnoughGas = createCustomErrorClass(\"NotEnoughGas\");\n// Error message specifically for the PTX swap flow\nexport const NotEnoughGasSwap = createCustomErrorClass(\"NotEnoughGasSwap\");\nexport const TronEmptyAccount = createCustomErrorClass(\"TronEmptyAccount\");\nexport const MaybeKeepTronAccountAlive = createCustomErrorClass(\"MaybeKeepTronAccountAlive\");\nexport const NotSupportedLegacyAddress = createCustomErrorClass(\"NotSupportedLegacyAddress\");\nexport const GasLessThanEstimate = createCustomErrorClass(\"GasLessThanEstimate\");\nexport const PriorityFeeTooLow = createCustomErrorClass(\"PriorityFeeTooLow\");\nexport const PriorityFeeTooHigh = createCustomErrorClass(\"PriorityFeeTooHigh\");\nexport const PriorityFeeHigherThanMaxFee = createCustomErrorClass(\"PriorityFeeHigherThanMaxFee\");\nexport const MaxFeeTooLow = createCustomErrorClass(\"MaxFeeTooLow\");\nexport const PasswordsDontMatchError = createCustomErrorClass(\"PasswordsDontMatch\");\nexport const PasswordIncorrectError = createCustomErrorClass(\"PasswordIncorrect\");\nexport const RecommendSubAccountsToEmpty = createCustomErrorClass(\"RecommendSubAccountsToEmpty\");\nexport const RecommendUndelegation = createCustomErrorClass(\"RecommendUndelegation\");\nexport const TimeoutTagged = createCustomErrorClass(\"TimeoutTagged\");\nexport const UnexpectedBootloader = createCustomErrorClass(\"UnexpectedBootloader\");\nexport const MCUNotGenuineToDashboard = createCustomErrorClass(\"MCUNotGenuineToDashboard\");\nexport const RecipientRequired = createCustomErrorClass(\"RecipientRequired\");\nexport const UnavailableTezosOriginatedAccountReceive = createCustomErrorClass(\n  \"UnavailableTezosOriginatedAccountReceive\",\n);\nexport const UnavailableTezosOriginatedAccountSend = createCustomErrorClass(\n  \"UnavailableTezosOriginatedAccountSend\",\n);\nexport const UpdateFetchFileFail = createCustomErrorClass(\"UpdateFetchFileFail\");\nexport const UpdateIncorrectHash = createCustomErrorClass(\"UpdateIncorrectHash\");\nexport const UpdateIncorrectSig = createCustomErrorClass(\"UpdateIncorrectSig\");\nexport const UpdateYourApp = createCustomErrorClass(\"UpdateYourApp\");\nexport const UserRefusedDeviceNameChange = createCustomErrorClass(\"UserRefusedDeviceNameChange\");\nexport const UserRefusedAddress = createCustomErrorClass(\"UserRefusedAddress\");\nexport const UserRefusedFirmwareUpdate = createCustomErrorClass(\"UserRefusedFirmwareUpdate\");\nexport const UserRefusedAllowManager = createCustomErrorClass(\"UserRefusedAllowManager\");\nexport const UserRefusedOnDevice = createCustomErrorClass(\"UserRefusedOnDevice\"); // TODO rename because it's just for transaction refusal\nexport const PinNotSet = createCustomErrorClass(\"PinNotSet\");\nexport const ExpertModeRequired = createCustomErrorClass(\"ExpertModeRequired\");\nexport const TransportOpenUserCancelled = createCustomErrorClass(\"TransportOpenUserCancelled\");\nexport const TransportInterfaceNotAvailable = createCustomErrorClass(\n  \"TransportInterfaceNotAvailable\",\n);\nexport const TransportRaceCondition = createCustomErrorClass(\"TransportRaceCondition\");\nexport const TransportWebUSBGestureRequired = createCustomErrorClass(\n  \"TransportWebUSBGestureRequired\",\n);\nexport const TransactionHasBeenValidatedError = createCustomErrorClass(\n  \"TransactionHasBeenValidatedError\",\n);\nexport const TransportExchangeTimeoutError = createCustomErrorClass(\n  \"TransportExchangeTimeoutError\",\n);\nexport const DeviceShouldStayInApp = createCustomErrorClass(\"DeviceShouldStayInApp\");\nexport const WebsocketConnectionError = createCustomErrorClass(\"WebsocketConnectionError\");\nexport const WebsocketConnectionFailed = createCustomErrorClass(\"WebsocketConnectionFailed\");\nexport const WrongDeviceForAccount = createCustomErrorClass(\"WrongDeviceForAccount\");\nexport const WrongDeviceForAccountPayout = createCustomErrorClass(\"WrongDeviceForAccountPayout\");\nexport const WrongDeviceForAccountRefund = createCustomErrorClass(\"WrongDeviceForAccountRefund\");\nexport const WrongAppForCurrency = createCustomErrorClass(\"WrongAppForCurrency\");\n\nexport const ETHAddressNonEIP = createCustomErrorClass(\"ETHAddressNonEIP\");\nexport const CantScanQRCode = createCustomErrorClass(\"CantScanQRCode\");\nexport const FeeNotLoaded = createCustomErrorClass(\"FeeNotLoaded\");\nexport const FeeNotLoadedSwap = createCustomErrorClass(\"FeeNotLoadedSwap\");\nexport const FeeRequired = createCustomErrorClass(\"FeeRequired\");\nexport const FeeTooHigh = createCustomErrorClass(\"FeeTooHigh\");\nexport const PendingOperation = createCustomErrorClass(\"PendingOperation\");\nexport const SyncError = createCustomErrorClass(\"SyncError\");\nexport const PairingFailed = createCustomErrorClass(\"PairingFailed\");\nexport const PeerRemovedPairing = createCustomErrorClass(\"PeerRemovedPairing\");\nexport const GenuineCheckFailed = createCustomErrorClass(\"GenuineCheckFailed\");\ntype NetworkType = {\n  status: number;\n  url: string | undefined;\n  method: string;\n};\nexport const LedgerAPI4xx = createCustomErrorClass<\n  NetworkType,\n  LedgerErrorConstructor<NetworkType>\n>(\"LedgerAPI4xx\");\nexport const LedgerAPI5xx = createCustomErrorClass<\n  NetworkType,\n  LedgerErrorConstructor<NetworkType>\n>(\"LedgerAPI5xx\");\nexport const FirmwareOrAppUpdateRequired = createCustomErrorClass(\"FirmwareOrAppUpdateRequired\");\n\n// SpeedUp / Cancel EVM tx\nexport const ReplacementTransactionUnderpriced = createCustomErrorClass(\n  \"ReplacementTransactionUnderpriced\",\n);\n\n// Bitcoin family\nexport const OpReturnDataSizeLimit = createCustomErrorClass(\"OpReturnSizeLimit\");\nexport const DustLimit = createCustomErrorClass(\"DustLimit\");\n\n// Language\nexport const LanguageNotFound = createCustomErrorClass(\"LanguageNotFound\");\n\n// db stuff, no need to translate\nexport const NoDBPathGiven = createCustomErrorClass(\"NoDBPathGiven\");\nexport const DBWrongPassword = createCustomErrorClass(\"DBWrongPassword\");\nexport const DBNotReset = createCustomErrorClass(\"DBNotReset\");\n\nexport const SequenceNumberError = createCustomErrorClass(\"SequenceNumberError\");\nexport const DisabledTransactionBroadcastError = createCustomErrorClass(\n  \"DisabledTransactionBroadcastError\",\n);\n\n// Represents the type of all the classes created with createCustomErrorClass\nexport type CustomErrorClassType = ReturnType<typeof createCustomErrorClass>;\n\n/**\n * Type of a Transport error used to represent all equivalent errors coming from all possible implementation of Transport\n */\nexport enum HwTransportErrorType {\n  Unknown = \"Unknown\",\n  LocationServicesDisabled = \"LocationServicesDisabled\",\n  LocationServicesUnauthorized = \"LocationServicesUnauthorized\",\n  BluetoothScanStartFailed = \"BluetoothScanStartFailed\",\n}\n\n/**\n * Represents an error coming from the usage of any Transport implementation.\n *\n * Needed to map a specific implementation error into an error that\n * can be managed by any code unaware of the specific Transport implementation\n * that was used.\n */\nexport class HwTransportError extends Error {\n  type: HwTransportErrorType;\n\n  constructor(type: HwTransportErrorType, message: string) {\n    super(message);\n    this.name = \"HwTransportError\";\n    this.type = type;\n\n    // Needed as long as we target < ES6\n    Object.setPrototypeOf(this, HwTransportError.prototype);\n  }\n}\n\n/**\n * TransportError is used for any generic transport errors.\n * e.g. Error thrown when data received by exchanges are incorrect or if exchanged failed to communicate with the device for various reason.\n */\nexport class TransportError extends Error {\n  id: string;\n  constructor(message: string, id: string) {\n    const name = \"TransportError\";\n    super(message || name);\n    this.name = name;\n    this.message = message;\n    this.stack = new Error(message).stack;\n    this.id = id;\n  }\n}\n\naddCustomErrorDeserializer(\"TransportError\", e => new TransportError(e.message, e.id));\n\nexport const StatusCodes = {\n  ACCESS_CONDITION_NOT_FULFILLED: 0x9804,\n  ALGORITHM_NOT_SUPPORTED: 0x9484,\n  CLA_NOT_SUPPORTED: 0x6e00,\n  CODE_BLOCKED: 0x9840,\n  CODE_NOT_INITIALIZED: 0x9802,\n  COMMAND_INCOMPATIBLE_FILE_STRUCTURE: 0x6981,\n  CONDITIONS_OF_USE_NOT_SATISFIED: 0x6985,\n  CONTRADICTION_INVALIDATION: 0x9810,\n  CONTRADICTION_SECRET_CODE_STATUS: 0x9808,\n  DEVICE_IN_RECOVERY_MODE: 0x662f,\n  CUSTOM_IMAGE_EMPTY: 0x662e,\n  FILE_ALREADY_EXISTS: 0x6a89,\n  FILE_NOT_FOUND: 0x9404,\n  GP_AUTH_FAILED: 0x6300,\n  HALTED: 0x6faa,\n  INCONSISTENT_FILE: 0x9408,\n  INCORRECT_DATA: 0x6a80,\n  INCORRECT_LENGTH: 0x6700,\n  INCORRECT_P1_P2: 0x6b00,\n  INS_NOT_SUPPORTED: 0x6d00,\n  DEVICE_NOT_ONBOARDED: 0x6d07,\n  DEVICE_NOT_ONBOARDED_2: 0x6611,\n  INVALID_KCV: 0x9485,\n  INVALID_OFFSET: 0x9402,\n  LICENSING: 0x6f42,\n  LOCKED_DEVICE: 0x5515,\n  MAX_VALUE_REACHED: 0x9850,\n  MEMORY_PROBLEM: 0x9240,\n  MISSING_CRITICAL_PARAMETER: 0x6800,\n  NO_EF_SELECTED: 0x9400,\n  NOT_ENOUGH_MEMORY_SPACE: 0x6a84,\n  OK: 0x9000,\n  PIN_REMAINING_ATTEMPTS: 0x63c0,\n  REFERENCED_DATA_NOT_FOUND: 0x6a88,\n  SECURITY_STATUS_NOT_SATISFIED: 0x6982,\n  TECHNICAL_PROBLEM: 0x6f00,\n  UNKNOWN_APDU: 0x6d02,\n  USER_REFUSED_ON_DEVICE: 0x5501,\n  NOT_ENOUGH_SPACE: 0x5102,\n  APP_NOT_FOUND_OR_INVALID_CONTEXT: 0x5123,\n  INVALID_APP_NAME_LENGTH: 0x670a,\n  GEN_AES_KEY_FAILED: 0x5419,\n  INTERNAL_CRYPTO_OPERATION_FAILED: 0x541a,\n  INTERNAL_COMPUTE_AES_CMAC_FAILED: 0x541b,\n  ENCRYPT_APP_STORAGE_FAILED: 0x541c,\n  INVALID_BACKUP_STATE: 0x6642,\n  PIN_NOT_SET: 0x5502,\n  INVALID_BACKUP_LENGTH: 0x6733,\n  INVALID_RESTORE_STATE: 0x6643,\n  INVALID_CHUNK_LENGTH: 0x6734,\n  INVALID_BACKUP_HEADER: 0x684a,\n\n  // Not documented:\n  TRUSTCHAIN_WRONG_SEED: 0xb007,\n};\n\nexport function getAltStatusMessage(code: number): string | undefined | null {\n  switch (code) {\n    // improve text of most common errors\n    case 0x6700:\n      return \"Incorrect length\";\n    case 0x6800:\n      return \"Missing critical parameter\";\n    case 0x6982:\n      return \"Security not satisfied (dongle locked or have invalid access rights)\";\n    case 0x6985:\n      return \"Condition of use not satisfied (denied by the user?)\";\n    case 0x6a80:\n      return \"Invalid data received\";\n    case 0x6b00:\n      return \"Invalid parameter received\";\n    case 0x5515:\n      return \"Locked device\";\n  }\n  if (0x6f00 <= code && code <= 0x6fff) {\n    return \"Internal error, please report\";\n  }\n}\n\n/**\n * Error thrown when a device returned a non success status.\n * the error.statusCode is one of the `StatusCodes` exported by this library.\n */\nexport class TransportStatusError extends Error {\n  statusCode: number;\n  statusText: string;\n\n  /**\n   * @param statusCode The error status code coming from a Transport implementation\n   * @param options containing:\n   *  - canBeMappedToChildError: enable the mapping of TransportStatusError to an error extending/inheriting from it\n   *  . Ex: LockedDeviceError. Default to true.\n   */\n  constructor(\n    statusCode: number,\n    { canBeMappedToChildError = true }: { canBeMappedToChildError?: boolean } = {},\n  ) {\n    const statusText =\n      Object.keys(StatusCodes).find(k => StatusCodes[k] === statusCode) || \"UNKNOWN_ERROR\";\n    const smsg = getAltStatusMessage(statusCode) || statusText;\n    const statusCodeStr = statusCode.toString(16);\n    const message = `Ledger device: ${smsg} (0x${statusCodeStr})`;\n\n    super(message);\n    this.name = \"TransportStatusError\";\n\n    this.statusCode = statusCode;\n    this.statusText = statusText;\n\n    Object.setPrototypeOf(this, TransportStatusError.prototype);\n\n    // Maps to a LockedDeviceError\n    if (canBeMappedToChildError && statusCode === StatusCodes.LOCKED_DEVICE) {\n      return new LockedDeviceError(message);\n    }\n  }\n}\n\nexport class LockedDeviceError extends TransportStatusError {\n  constructor(message?: string) {\n    super(StatusCodes.LOCKED_DEVICE, { canBeMappedToChildError: false });\n    if (message) {\n      this.message = message;\n    }\n    this.name = \"LockedDeviceError\";\n    Object.setPrototypeOf(this, LockedDeviceError.prototype);\n  }\n}\n\n// Represents the type of the class TransportStatusError and its children\nexport type TransportStatusErrorClassType = typeof TransportStatusError | typeof LockedDeviceError;\n\naddCustomErrorDeserializer(\"TransportStatusError\", e => new TransportStatusError(e.statusCode));\n", "export type TraceContext = Record<string, unknown>;\nexport type LogData = any;\nexport type LogType = string;\n\n/**\n * A Log object\n */\nexport interface Log {\n  /**\n   * A namespaced identifier of the log (not a level like \"debug\", \"error\" but more like \"apdu\", \"hw\", etc...)\n   */\n  type: LogType;\n  message?: string;\n  /**\n   * Data associated to the log event\n   */\n  data?: LogData;\n  /**\n   * Context data, coming for example from the caller's parent, to enable a simple tracing system\n   */\n  context?: TraceContext;\n  /**\n   * Unique id among all logs\n   */\n  id: string;\n  /*\n   * Date when the log occurred\n   */\n  date: Date;\n}\n\nexport type Unsubscribe = () => void;\nexport type Subscriber = (arg0: Log) => void;\n\nlet id = 0;\nconst subscribers: Subscriber[] = [];\n\n/**\n * Logs something\n *\n * @param type a namespaced identifier of the log (it is not a level like \"debug\", \"error\" but more like \"apdu-in\", \"apdu-out\", etc...)\n * @param message a clear message of the log associated to the type\n */\nexport const log = (type: LogType, message?: string, data?: LogData) => {\n  const obj: Log = {\n    type,\n    id: String(++id),\n    date: new Date(),\n  };\n  if (message) obj.message = message;\n  if (data) obj.data = data;\n  dispatch(obj);\n};\n\n/**\n * A simple tracer function, only expanding the existing log function\n *\n * Its goal is to capture more context than a log function.\n * This is simple for now, but can be improved later.\n *\n * @param context Anything representing the context where the log occurred\n */\nexport const trace = ({\n  type,\n  message,\n  data,\n  context,\n}: {\n  type: LogType;\n  message?: string;\n  data?: LogData;\n  context?: TraceContext;\n}) => {\n  const obj: Log = {\n    type,\n    id: String(++id),\n    date: new Date(),\n  };\n\n  if (message) obj.message = message;\n  if (data) obj.data = data;\n  if (context) obj.context = context;\n\n  dispatch(obj);\n};\n\n/**\n * A simple tracer class, that can be used to avoid repetition when using the `trace` function\n *\n * Its goal is to capture more context than a log function.\n * This is simple for now, but can be improved later.\n *\n * @param type A given type (not level) for the current local tracer (\"hw\", \"withDevice\", etc.)\n * @param context Anything representing the context where the log occurred\n */\nexport class LocalTracer {\n  constructor(\n    private type: LogType,\n    private context?: TraceContext,\n  ) {}\n\n  trace(message: string, data?: TraceContext) {\n    trace({\n      type: this.type,\n      message,\n      data,\n      context: this.context,\n    });\n  }\n\n  getContext(): TraceContext | undefined {\n    return this.context;\n  }\n\n  setContext(context?: TraceContext) {\n    this.context = context;\n  }\n\n  updateContext(contextToAdd: TraceContext) {\n    this.context = { ...this.context, ...contextToAdd };\n  }\n\n  getType(): LogType {\n    return this.type;\n  }\n\n  setType(type: LogType) {\n    this.type = type;\n  }\n\n  /**\n   * Create a new instance of the LocalTracer with an updated `type`\n   *\n   * It does not mutate the calling instance, but returns a new LocalTracer,\n   * following a simple builder pattern.\n   */\n  withType(type: LogType): LocalTracer {\n    return new LocalTracer(type, this.context);\n  }\n\n  /**\n   * Create a new instance of the LocalTracer with a new `context`\n   *\n   * It does not mutate the calling instance, but returns a new LocalTracer,\n   * following a simple builder pattern.\n   *\n   * @param context A TraceContext, that can undefined to reset the context\n   */\n  withContext(context?: TraceContext): LocalTracer {\n    return new LocalTracer(this.type, context);\n  }\n\n  /**\n   * Create a new instance of the LocalTracer with an updated `context`,\n   * on which an additional context is merged with the existing one.\n   *\n   * It does not mutate the calling instance, but returns a new LocalTracer,\n   * following a simple builder pattern.\n   */\n  withUpdatedContext(contextToAdd: TraceContext): LocalTracer {\n    return new LocalTracer(this.type, { ...this.context, ...contextToAdd });\n  }\n}\n\n/**\n * Adds a subscribers to the emitted logs.\n *\n * @param cb that is called for each future log() with the Log object\n * @return a function that can be called to unsubscribe the listener\n */\nexport const listen = (cb: Subscriber): Unsubscribe => {\n  subscribers.push(cb);\n  return () => {\n    const i = subscribers.indexOf(cb);\n\n    if (i !== -1) {\n      // equivalent of subscribers.splice(i, 1) // https://twitter.com/Rich_Harris/status/1125850391155965952\n      subscribers[i] = subscribers[subscribers.length - 1];\n      subscribers.pop();\n    }\n  };\n};\n\nfunction dispatch(log: Log) {\n  for (let i = 0; i < subscribers.length; i++) {\n    try {\n      subscribers[i](log);\n    } catch (e) {\n      console.error(e);\n    }\n  }\n}\n\n// for debug purpose\n\ndeclare global {\n  interface Window {\n    __ledgerLogsListen: any;\n  }\n}\n\nif (typeof window !== \"undefined\") {\n  window.__ledgerLogsListen = listen;\n}\n", "import EventEmitter from \"events\";\nimport type { DeviceModel } from \"@ledgerhq/devices\";\nimport {\n  TransportRaceCondition,\n  TransportError,\n  StatusCodes,\n  getAltStatusMessage,\n  TransportStatusError,\n} from \"@ledgerhq/errors\";\nimport { LocalTracer, TraceContext, LogType } from \"@ledgerhq/logs\";\nexport { TransportError, TransportStatusError, StatusCodes, getAltStatusMessage };\n\nconst DEFAULT_LOG_TYPE = \"transport\";\n\n/**\n */\nexport type Subscription = {\n  unsubscribe: () => void;\n};\n\n/**\n */\nexport type Device = any; // Should be a union type of all possible Device object's shape\n\nexport type DescriptorEventType = \"add\" | \"remove\";\n/**\n * A \"descriptor\" is a parameter that is specific to the implementation, and can be an ID, file path, or URL.\n * type: add or remove event\n * descriptor: a parameter that can be passed to open(descriptor)\n * deviceModel: device info on the model (is it a nano s, nano x, ...)\n * device: transport specific device info\n */\nexport interface DescriptorEvent<Descriptor> {\n  type: DescriptorEventType;\n  descriptor: Descriptor;\n  deviceModel?: DeviceModel | null | undefined;\n  device?: Device;\n}\n\n/**\n * Observer generic type, following the Observer pattern\n */\nexport type Observer<EventType, EventError = unknown> = Readonly<{\n  next: (event: EventType) => unknown;\n  error: (e: EventError) => unknown;\n  complete: () => unknown;\n}>;\n\n/**\n * The Transport class defines a generic interface for communicating with a Ledger hardware wallet.\n * There are different kind of transports based on the technology (channels like U2F, HID, Bluetooth, Webusb) and environment (Node, Web,...).\n * It is an abstract class that needs to be implemented.\n */\nexport default class Transport {\n  exchangeTimeout = 30000;\n  unresponsiveTimeout = 15000;\n  deviceModel: DeviceModel | null | undefined = null;\n  tracer: LocalTracer;\n\n  constructor({ context, logType }: { context?: TraceContext; logType?: LogType } = {}) {\n    this.tracer = new LocalTracer(logType ?? DEFAULT_LOG_TYPE, context);\n  }\n\n  /**\n   * Check if the transport is supported on the current platform/browser.\n   * @returns {Promise<boolean>} A promise that resolves with a boolean indicating support.\n   */\n  static readonly isSupported: () => Promise<boolean>;\n\n  /**\n   * List all available descriptors for the transport.\n   * For a better granularity, checkout `listen()`.\n   *\n   * @returns {Promise<Array<any>>} A promise that resolves with an array of descriptors.\n   * @example\n   * TransportFoo.list().then(descriptors => ...)\n   */\n  static readonly list: () => Promise<Array<any>>;\n\n  /**\n   * Listen for device events for the transport. The method takes an observer of DescriptorEvent and returns a Subscription.\n   * A DescriptorEvent is an object containing a \"descriptor\" and a \"type\" field. The \"type\" field can be \"add\" or \"remove\", and the \"descriptor\" field can be passed to the \"open\" method.\n   * The \"listen\" method will first emit all currently connected devices and then will emit events as they occur, such as when a USB device is plugged in or a Bluetooth device becomes discoverable.\n   * @param {Observer<DescriptorEvent<any>>} observer - An object with \"next\", \"error\", and \"complete\" functions, following the observer pattern.\n   * @returns {Subscription} A Subscription object on which you can call \".unsubscribe()\" to stop listening to descriptors.\n   * @example\n  const sub = TransportFoo.listen({\n  next: e => {\n    if (e.type===\"add\") {\n      sub.unsubscribe();\n      const transport = await TransportFoo.open(e.descriptor);\n      ...\n    }\n  },\n  error: error => {},\n  complete: () => {}\n  })\n   */\n  static readonly listen: (observer: Observer<DescriptorEvent<any>>) => Subscription;\n\n  /**\n   * Attempt to create a Transport instance with a specific descriptor.\n   * @param {any} descriptor - The descriptor to open the transport with.\n   * @param {number} timeout - An optional timeout for the transport connection.\n   * @param {TraceContext} context Optional tracing/log context\n   * @returns {Promise<Transport>} A promise that resolves with a Transport instance.\n   * @example\n  TransportFoo.open(descriptor).then(transport => ...)\n   */\n  static readonly open: (\n    descriptor?: any,\n    timeoutMs?: number,\n    context?: TraceContext,\n  ) => Promise<Transport>;\n\n  /**\n   * Send data to the device using a low level API.\n   * It's recommended to use the \"send\" method for a higher level API.\n   * @param {Buffer} apdu - The data to send.\n   * @param {Object} options - Contains optional options for the exchange function\n   *  - abortTimeoutMs: stop the exchange after a given timeout. Another timeout exists\n   *    to detect unresponsive device (see `unresponsiveTimeout`). This timeout aborts the exchange.\n   * @returns {Promise<Buffer>} A promise that resolves with the response data from the device.\n   */\n  exchange(\n    _apdu: Buffer,\n    { abortTimeoutMs: _abortTimeoutMs }: { abortTimeoutMs?: number } = {},\n  ): Promise<Buffer> {\n    throw new Error(\"exchange not implemented\");\n  }\n\n  /**\n   * Send apdus in batch to the device using a low level API.\n   * The default implementation is to call exchange for each apdu.\n   * @param {Array<Buffer>} apdus - array of apdus to send.\n   * @param {Observer<Buffer>} observer - an observer that will receive the response of each apdu.\n   * @returns {Subscription} A Subscription object on which you can call \".unsubscribe()\" to stop sending apdus.\n   */\n  exchangeBulk(apdus: Buffer[], observer: Observer<Buffer>): Subscription {\n    let unsubscribed = false;\n    const unsubscribe = () => {\n      unsubscribed = true;\n    };\n\n    const main = async () => {\n      if (unsubscribed) return;\n      for (const apdu of apdus) {\n        const r = await this.exchange(apdu);\n        if (unsubscribed) return;\n        const status = r.readUInt16BE(r.length - 2);\n        if (status !== StatusCodes.OK) {\n          throw new TransportStatusError(status);\n        }\n        observer.next(r);\n      }\n    };\n\n    main().then(\n      () => !unsubscribed && observer.complete(),\n      e => !unsubscribed && observer.error(e),\n    );\n\n    return { unsubscribe };\n  }\n\n  /**\n   * Set the \"scramble key\" for the next data exchanges with the device.\n   * Each app can have a different scramble key and it is set internally during instantiation.\n   * @param {string} key - The scramble key to set.\n   * deprecated This method is no longer needed for modern transports and should be migrated away from.\n   * no @ before deprecated as it breaks documentationjs on version 14.0.2\n   * https://github.com/documentationjs/documentation/issues/1596\n   */\n  setScrambleKey(_key: string) {}\n\n  /**\n   * Close the connection with the device.\n   *\n   * Note: for certain transports (hw-transport-node-hid-singleton for ex), once the promise resolved,\n   * the transport instance is actually still cached, and the device is disconnected only after a defined timeout.\n   * But for the consumer of the Transport, this does not matter and it can consider the transport to be closed.\n   *\n   * @returns {Promise<void>} A promise that resolves when the transport is closed.\n   */\n  close(): Promise<void> {\n    return Promise.resolve();\n  }\n\n  _events = new EventEmitter();\n\n  /**\n   * Listen for an event on the transport instance.\n   * Transport implementations may have specific events. Common events include:\n   * \"disconnect\" : triggered when the transport is disconnected.\n   * @param {string} eventName - The name of the event to listen for.\n   * @param {(...args: Array<any>) => any} cb - The callback function to be invoked when the event occurs.\n   */\n  on(eventName: string, cb: (...args: Array<any>) => any): void {\n    this._events.on(eventName, cb);\n  }\n\n  /**\n   * Stop listening to an event on an instance of transport.\n   */\n  off(eventName: string, cb: (...args: Array<any>) => any): void {\n    this._events.removeListener(eventName, cb);\n  }\n\n  emit(event: string, ...args: any): void {\n    this._events.emit(event, ...args);\n  }\n\n  /**\n   * Enable or not logs of the binary exchange\n   */\n  setDebugMode() {\n    console.warn(\n      \"setDebugMode is deprecated. use @ledgerhq/logs instead. No logs are emitted in this anymore.\",\n    );\n  }\n\n  /**\n   * Set a timeout (in milliseconds) for the exchange call. Only some transport might implement it. (e.g. U2F)\n   */\n  setExchangeTimeout(exchangeTimeout: number): void {\n    this.exchangeTimeout = exchangeTimeout;\n  }\n\n  /**\n   * Define the delay before emitting \"unresponsive\" on an exchange that does not respond\n   */\n  setExchangeUnresponsiveTimeout(unresponsiveTimeout: number): void {\n    this.unresponsiveTimeout = unresponsiveTimeout;\n  }\n\n  /**\n   * Send data to the device using the higher level API.\n   *\n   * @param {number} cla - The instruction class for the command.\n   * @param {number} ins - The instruction code for the command.\n   * @param {number} p1 - The first parameter for the instruction.\n   * @param {number} p2 - The second parameter for the instruction.\n   * @param {Buffer} data - The data to be sent. Defaults to an empty buffer.\n   * @param {Array<number>} statusList - A list of acceptable status codes for the response. Defaults to [StatusCodes.OK].\n   * @param {Object} options - Contains optional options for the exchange function\n   *  - abortTimeoutMs: stop the send after a given timeout. Another timeout exists\n   *    to detect unresponsive device (see `unresponsiveTimeout`). This timeout aborts the exchange.\n   * @returns {Promise<Buffer>} A promise that resolves with the response data from the device.\n   */\n  send = async (\n    cla: number,\n    ins: number,\n    p1: number,\n    p2: number,\n    data: Buffer = Buffer.alloc(0),\n    statusList: Array<number> = [StatusCodes.OK],\n    { abortTimeoutMs }: { abortTimeoutMs?: number } = {},\n  ): Promise<Buffer> => {\n    const tracer = this.tracer.withUpdatedContext({ function: \"send\" });\n\n    if (data.length >= 256) {\n      tracer.trace(\"data.length exceeded 256 bytes limit\", { dataLength: data.length });\n      throw new TransportError(\n        \"data.length exceed 256 bytes limit. Got: \" + data.length,\n        \"DataLengthTooBig\",\n      );\n    }\n\n    tracer.trace(\"Starting an exchange\", { abortTimeoutMs });\n    const response = await this.exchange(\n      // The size of the data is added in 1 byte just before `data`\n      Buffer.concat([Buffer.from([cla, ins, p1, p2]), Buffer.from([data.length]), data]),\n      { abortTimeoutMs },\n    );\n    tracer.trace(\"Received response from exchange\");\n    const sw = response.readUInt16BE(response.length - 2);\n\n    if (!statusList.some(s => s === sw)) {\n      throw new TransportStatusError(sw);\n    }\n\n    return response;\n  };\n\n  /**\n   * create() allows to open the first descriptor available or\n   * throw if there is none or if timeout is reached.\n   * This is a light helper, alternative to using listen() and open() (that you may need for any more advanced usecase)\n   * @example\n  TransportFoo.create().then(transport => ...)\n   */\n  static create(openTimeout = 3000, listenTimeout?: number): Promise<Transport> {\n    return new Promise((resolve, reject) => {\n      let found = false;\n      const sub = this.listen({\n        next: e => {\n          found = true;\n          if (sub) sub.unsubscribe();\n          if (listenTimeoutId) clearTimeout(listenTimeoutId);\n          this.open(e.descriptor, openTimeout).then(resolve, reject);\n        },\n        error: e => {\n          if (listenTimeoutId) clearTimeout(listenTimeoutId);\n          reject(e);\n        },\n        complete: () => {\n          if (listenTimeoutId) clearTimeout(listenTimeoutId);\n\n          if (!found) {\n            reject(new TransportError(this.ErrorMessage_NoDeviceFound, \"NoDeviceFound\"));\n          }\n        },\n      });\n      const listenTimeoutId = listenTimeout\n        ? setTimeout(() => {\n            sub.unsubscribe();\n            reject(new TransportError(this.ErrorMessage_ListenTimeout, \"ListenTimeout\"));\n          }, listenTimeout)\n        : null;\n    });\n  }\n\n  // Blocks other exchange to happen concurrently\n  exchangeBusyPromise: Promise<void> | null | undefined;\n\n  /**\n   * Wrapper to make an exchange \"atomic\" (blocking any other exchange)\n   *\n   * It also handles \"unresponsiveness\" by emitting \"unresponsive\" and \"responsive\" events.\n   *\n   * @param f The exchange job, using the transport to run\n   * @returns a Promise resolving with the output of the given job\n   */\n  async exchangeAtomicImpl<Output>(f: () => Promise<Output>): Promise<Output> {\n    const tracer = this.tracer.withUpdatedContext({\n      function: \"exchangeAtomicImpl\",\n      unresponsiveTimeout: this.unresponsiveTimeout,\n    });\n\n    if (this.exchangeBusyPromise) {\n      tracer.trace(\"Atomic exchange is already busy\");\n      throw new TransportRaceCondition(\n        \"An action was already pending on the Ledger device. Please deny or reconnect.\",\n      );\n    }\n\n    // Sets the atomic guard\n    let resolveBusy;\n    const busyPromise: Promise<void> = new Promise(r => {\n      resolveBusy = r;\n    });\n    this.exchangeBusyPromise = busyPromise;\n\n    // The device unresponsiveness handler\n    let unresponsiveReached = false;\n    const timeout = setTimeout(() => {\n      tracer.trace(`Timeout reached, emitting Transport event \"unresponsive\"`, {\n        unresponsiveTimeout: this.unresponsiveTimeout,\n      });\n      unresponsiveReached = true;\n      this.emit(\"unresponsive\");\n    }, this.unresponsiveTimeout);\n\n    try {\n      const res = await f();\n\n      if (unresponsiveReached) {\n        tracer.trace(\"Device was unresponsive, emitting responsive\");\n        this.emit(\"responsive\");\n      }\n\n      return res;\n    } finally {\n      tracer.trace(\"Finalize, clearing busy guard\");\n\n      clearTimeout(timeout);\n      if (resolveBusy) resolveBusy();\n      this.exchangeBusyPromise = null;\n    }\n  }\n\n  decorateAppAPIMethods(self: Record<string, any>, methods: Array<string>, scrambleKey: string) {\n    for (const methodName of methods) {\n      self[methodName] = this.decorateAppAPIMethod(methodName, self[methodName], self, scrambleKey);\n    }\n  }\n\n  _appAPIlock: string | null = null;\n\n  decorateAppAPIMethod<R, A extends any[]>(\n    methodName: string,\n    f: (...args: A) => Promise<R>,\n    ctx: any,\n    scrambleKey: string,\n  ): (...args: A) => Promise<R> {\n    return async (...args) => {\n      const { _appAPIlock } = this;\n\n      if (_appAPIlock) {\n        return Promise.reject(\n          new TransportError(\"Ledger Device is busy (lock \" + _appAPIlock + \")\", \"TransportLocked\"),\n        );\n      }\n\n      try {\n        this._appAPIlock = methodName;\n        this.setScrambleKey(scrambleKey);\n        return await f.apply(ctx, args);\n      } finally {\n        this._appAPIlock = null;\n      }\n    };\n  }\n\n  /**\n   * Sets the context used by the logging/tracing mechanism\n   *\n   * Useful when re-using (cached) the same Transport instance,\n   * but with a new tracing context.\n   *\n   * @param context A TraceContext, that can undefined to reset the context\n   */\n  setTraceContext(context?: TraceContext) {\n    this.tracer = this.tracer.withContext(context);\n  }\n\n  /**\n   * Updates the context used by the logging/tracing mechanism\n   *\n   * The update only overrides the key-value that are already defined in the current context.\n   *\n   * @param contextToAdd A TraceContext that will be added to the current context\n   */\n  updateTraceContext(contextToAdd: TraceContext) {\n    this.tracer.updateContext(contextToAdd);\n  }\n\n  /**\n   * Gets the tracing context of the transport instance\n   */\n  getTraceContext(): TraceContext | undefined {\n    return this.tracer.getContext();\n  }\n\n  static ErrorMessage_ListenTimeout = \"No Ledger device found (timeout)\";\n  static ErrorMessage_NoDeviceFound = \"No Ledger device found\";\n}\n", "// Note: this is the semver.org version of the spec that it implements\n// Not necessarily the package version of this code.\nconst SEMVER_SPEC_VERSION = '2.0.0'\n\nconst MAX_LENGTH = 256\nconst MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||\n/* istanbul ignore next */ 9007199254740991\n\n// Max safe segment length for coercion.\nconst MAX_SAFE_COMPONENT_LENGTH = 16\n\n// Max safe length for a build identifier. The max length minus 6 characters for\n// the shortest version with a build 0.0.0+BUILD.\nconst MAX_SAFE_BUILD_LENGTH = MAX_LENGTH - 6\n\nconst RELEASE_TYPES = [\n  'major',\n  'premajor',\n  'minor',\n  'preminor',\n  'patch',\n  'prepatch',\n  'prerelease',\n]\n\nmodule.exports = {\n  MAX_LENGTH,\n  MAX_SAFE_COMPONENT_LENGTH,\n  MAX_SAFE_BUILD_LENGTH,\n  MAX_SAFE_INTEGER,\n  RELEASE_TYPES,\n  SEMVER_SPEC_VERSION,\n  FLAG_INCLUDE_PRERELEASE: 0b001,\n  FLAG_LOOSE: 0b010,\n}\n", "const debug = (\n  typeof process === 'object' &&\n  process.env &&\n  process.env.NODE_DEBUG &&\n  /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n  : () => {}\n\nmodule.exports = debug\n", "const {\n  MAX_SAFE_COMPONENT_LENGTH,\n  MAX_SAFE_BUILD_LENGTH,\n  MAX_LENGTH,\n} = require('./constants')\nconst debug = require('./debug')\nexports = module.exports = {}\n\n// The actual regexps go on exports.re\nconst re = exports.re = []\nconst safeRe = exports.safeRe = []\nconst src = exports.src = []\nconst t = exports.t = {}\nlet R = 0\n\nconst LETTERDASHNUMBER = '[a-zA-Z0-9-]'\n\n// Replace some greedy regex tokens to prevent regex dos issues. These regex are\n// used internally via the safeRe object since all inputs in this library get\n// normalized first to trim and collapse all extra whitespace. The original\n// regexes are exported for userland consumption and lower level usage. A\n// future breaking change could export the safer regex only with a note that\n// all input should have extra whitespace removed.\nconst safeRegexReplacements = [\n  ['\\\\s', 1],\n  ['\\\\d', MAX_LENGTH],\n  [LETTERDASHNUMBER, MAX_SAFE_BUILD_LENGTH],\n]\n\nconst makeSafeRegex = (value) => {\n  for (const [token, max] of safeRegexReplacements) {\n    value = value\n      .split(`${token}*`).join(`${token}{0,${max}}`)\n      .split(`${token}+`).join(`${token}{1,${max}}`)\n  }\n  return value\n}\n\nconst createToken = (name, value, isGlobal) => {\n  const safe = makeSafeRegex(value)\n  const index = R++\n  debug(name, index, value)\n  t[name] = index\n  src[index] = value\n  re[index] = new RegExp(value, isGlobal ? 'g' : undefined)\n  safeRe[index] = new RegExp(safe, isGlobal ? 'g' : undefined)\n}\n\n// The following Regular Expressions can be used for tokenizing,\n// validating, and parsing SemVer version strings.\n\n// ## Numeric Identifier\n// A single `0`, or a non-zero digit followed by zero or more digits.\n\ncreateToken('NUMERICIDENTIFIER', '0|[1-9]\\\\d*')\ncreateToken('NUMERICIDENTIFIERLOOSE', '\\\\d+')\n\n// ## Non-numeric Identifier\n// Zero or more digits, followed by a letter or hyphen, and then zero or\n// more letters, digits, or hyphens.\n\ncreateToken('NONNUMERICIDENTIFIER', `\\\\d*[a-zA-Z-]${LETTERDASHNUMBER}*`)\n\n// ## Main Version\n// Three dot-separated numeric identifiers.\n\ncreateToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n                   `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n                   `(${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n                        `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n                        `(${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version Identifier\n// A numeric identifier, or a non-numeric identifier.\n\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NUMERICIDENTIFIER]\n}|${src[t.NONNUMERICIDENTIFIER]})`)\n\ncreateToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NUMERICIDENTIFIERLOOSE]\n}|${src[t.NONNUMERICIDENTIFIER]})`)\n\n// ## Pre-release Version\n// Hyphen, followed by one or more dot-separated pre-release version\n// identifiers.\n\ncreateToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIER]})*))`)\n\ncreateToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`)\n\n// ## Build Metadata Identifier\n// Any combination of digits, letters, or hyphens.\n\ncreateToken('BUILDIDENTIFIER', `${LETTERDASHNUMBER}+`)\n\n// ## Build Metadata\n// Plus sign, followed by one or more period-separated build metadata\n// identifiers.\n\ncreateToken('BUILD', `(?:\\\\+(${src[t.BUILDIDENTIFIER]\n}(?:\\\\.${src[t.BUILDIDENTIFIER]})*))`)\n\n// ## Full Version String\n// A main version, followed optionally by a pre-release version and\n// build metadata.\n\n// Note that the only major, minor, patch, and pre-release sections of\n// the version string are capturing groups.  The build metadata is not a\n// capturing group, because it should not ever be used in version\n// comparison.\n\ncreateToken('FULLPLAIN', `v?${src[t.MAINVERSION]\n}${src[t.PRERELEASE]}?${\n  src[t.BUILD]}?`)\n\ncreateToken('FULL', `^${src[t.FULLPLAIN]}$`)\n\n// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.\n// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty\n// common in the npm registry.\ncreateToken('LOOSEPLAIN', `[v=\\\\s]*${src[t.MAINVERSIONLOOSE]\n}${src[t.PRERELEASELOOSE]}?${\n  src[t.BUILD]}?`)\n\ncreateToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`)\n\ncreateToken('GTLT', '((?:<|>)?=?)')\n\n// Something like \"2.*\" or \"1.2.x\".\n// Note that \"x.x\" is a valid xRange identifer, meaning \"any version\"\n// Only the first item is strictly required.\ncreateToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\\\*`)\ncreateToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\\\*`)\n\ncreateToken('XRANGEPLAIN', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:${src[t.PRERELEASE]})?${\n                     src[t.BUILD]}?` +\n                   `)?)?`)\n\ncreateToken('XRANGEPLAINLOOSE', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:${src[t.PRERELEASELOOSE]})?${\n                          src[t.BUILD]}?` +\n                        `)?)?`)\n\ncreateToken('XRANGE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAIN]}$`)\ncreateToken('XRANGELOOSE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Coercion.\n// Extract anything that could conceivably be a part of a valid semver\ncreateToken('COERCEPLAIN', `${'(^|[^\\\\d])' +\n              '(\\\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +\n              `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n              `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?`)\ncreateToken('COERCE', `${src[t.COERCEPLAIN]}(?:$|[^\\\\d])`)\ncreateToken('COERCEFULL', src[t.COERCEPLAIN] +\n              `(?:${src[t.PRERELEASE]})?` +\n              `(?:${src[t.BUILD]})?` +\n              `(?:$|[^\\\\d])`)\ncreateToken('COERCERTL', src[t.COERCE], true)\ncreateToken('COERCERTLFULL', src[t.COERCEFULL], true)\n\n// Tilde ranges.\n// Meaning is \"reasonably at or greater than\"\ncreateToken('LONETILDE', '(?:~>?)')\n\ncreateToken('TILDETRIM', `(\\\\s*)${src[t.LONETILDE]}\\\\s+`, true)\nexports.tildeTrimReplace = '$1~'\n\ncreateToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Caret ranges.\n// Meaning is \"at least and backwards compatible with\"\ncreateToken('LONECARET', '(?:\\\\^)')\n\ncreateToken('CARETTRIM', `(\\\\s*)${src[t.LONECARET]}\\\\s+`, true)\nexports.caretTrimReplace = '$1^'\n\ncreateToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// A simple gt/lt/eq thing, or just \"\" to indicate \"any version\"\ncreateToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\\\s*(${src[t.LOOSEPLAIN]})$|^$`)\ncreateToken('COMPARATOR', `^${src[t.GTLT]}\\\\s*(${src[t.FULLPLAIN]})$|^$`)\n\n// An expression to strip any whitespace between the gtlt and the thing\n// it modifies, so that `> 1.2.3` ==> `>1.2.3`\ncreateToken('COMPARATORTRIM', `(\\\\s*)${src[t.GTLT]\n}\\\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true)\nexports.comparatorTrimReplace = '$1$2$3'\n\n// Something like `1.2.3 - 1.2.4`\n// Note that these all use the loose form, because they'll be\n// checked against either the strict or loose comparator form\n// later.\ncreateToken('HYPHENRANGE', `^\\\\s*(${src[t.XRANGEPLAIN]})` +\n                   `\\\\s+-\\\\s+` +\n                   `(${src[t.XRANGEPLAIN]})` +\n                   `\\\\s*$`)\n\ncreateToken('HYPHENRANGELOOSE', `^\\\\s*(${src[t.XRANGEPLAINLOOSE]})` +\n                        `\\\\s+-\\\\s+` +\n                        `(${src[t.XRANGEPLAINLOOSE]})` +\n                        `\\\\s*$`)\n\n// Star ranges basically just allow anything at all.\ncreateToken('STAR', '(<|>)?=?\\\\s*\\\\*')\n// >=0.0.0 is like a star\ncreateToken('GTE0', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0\\\\s*$')\ncreateToken('GTE0PRE', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0-0\\\\s*$')\n", "// parse out just the options we care about\nconst looseOption = Object.freeze({ loose: true })\nconst emptyOpts = Object.freeze({ })\nconst parseOptions = options => {\n  if (!options) {\n    return emptyOpts\n  }\n\n  if (typeof options !== 'object') {\n    return looseOption\n  }\n\n  return options\n}\nmodule.exports = parseOptions\n", "const numeric = /^[0-9]+$/\nconst compareIdentifiers = (a, b) => {\n  const anum = numeric.test(a)\n  const bnum = numeric.test(b)\n\n  if (anum && bnum) {\n    a = +a\n    b = +b\n  }\n\n  return a === b ? 0\n    : (anum && !bnum) ? -1\n    : (bnum && !anum) ? 1\n    : a < b ? -1\n    : 1\n}\n\nconst rcompareIdentifiers = (a, b) => compareIdentifiers(b, a)\n\nmodule.exports = {\n  compareIdentifiers,\n  rcompareIdentifiers,\n}\n", "const debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n  constructor (version, options) {\n    options = parseOptions(options)\n\n    if (version instanceof SemVer) {\n      if (version.loose === !!options.loose &&\n          version.includePrerelease === !!options.includePrerelease) {\n        return version\n      } else {\n        version = version.version\n      }\n    } else if (typeof version !== 'string') {\n      throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n    }\n\n    if (version.length > MAX_LENGTH) {\n      throw new TypeError(\n        `version is longer than ${MAX_LENGTH} characters`\n      )\n    }\n\n    debug('SemVer', version, options)\n    this.options = options\n    this.loose = !!options.loose\n    // this isn't actually relevant for versions, but keep it so that we\n    // don't run into trouble passing this.options around.\n    this.includePrerelease = !!options.includePrerelease\n\n    const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n    if (!m) {\n      throw new TypeError(`Invalid Version: ${version}`)\n    }\n\n    this.raw = version\n\n    // these are actually numbers\n    this.major = +m[1]\n    this.minor = +m[2]\n    this.patch = +m[3]\n\n    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n      throw new TypeError('Invalid major version')\n    }\n\n    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n      throw new TypeError('Invalid minor version')\n    }\n\n    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n      throw new TypeError('Invalid patch version')\n    }\n\n    // numberify any prerelease numeric ids\n    if (!m[4]) {\n      this.prerelease = []\n    } else {\n      this.prerelease = m[4].split('.').map((id) => {\n        if (/^[0-9]+$/.test(id)) {\n          const num = +id\n          if (num >= 0 && num < MAX_SAFE_INTEGER) {\n            return num\n          }\n        }\n        return id\n      })\n    }\n\n    this.build = m[5] ? m[5].split('.') : []\n    this.format()\n  }\n\n  format () {\n    this.version = `${this.major}.${this.minor}.${this.patch}`\n    if (this.prerelease.length) {\n      this.version += `-${this.prerelease.join('.')}`\n    }\n    return this.version\n  }\n\n  toString () {\n    return this.version\n  }\n\n  compare (other) {\n    debug('SemVer.compare', this.version, this.options, other)\n    if (!(other instanceof SemVer)) {\n      if (typeof other === 'string' && other === this.version) {\n        return 0\n      }\n      other = new SemVer(other, this.options)\n    }\n\n    if (other.version === this.version) {\n      return 0\n    }\n\n    return this.compareMain(other) || this.comparePre(other)\n  }\n\n  compareMain (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    return (\n      compareIdentifiers(this.major, other.major) ||\n      compareIdentifiers(this.minor, other.minor) ||\n      compareIdentifiers(this.patch, other.patch)\n    )\n  }\n\n  comparePre (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    // NOT having a prerelease is > having one\n    if (this.prerelease.length && !other.prerelease.length) {\n      return -1\n    } else if (!this.prerelease.length && other.prerelease.length) {\n      return 1\n    } else if (!this.prerelease.length && !other.prerelease.length) {\n      return 0\n    }\n\n    let i = 0\n    do {\n      const a = this.prerelease[i]\n      const b = other.prerelease[i]\n      debug('prerelease compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  compareBuild (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    let i = 0\n    do {\n      const a = this.build[i]\n      const b = other.build[i]\n      debug('build compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  // preminor will bump the version up to the next minor release, and immediately\n  // down to pre-release. premajor and prepatch work the same way.\n  inc (release, identifier, identifierBase) {\n    switch (release) {\n      case 'premajor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor = 0\n        this.major++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'preminor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'prepatch':\n        // If this is already a prerelease, it will bump to the next version\n        // drop any prereleases that might already exist, since they are not\n        // relevant at this point.\n        this.prerelease.length = 0\n        this.inc('patch', identifier, identifierBase)\n        this.inc('pre', identifier, identifierBase)\n        break\n      // If the input is a non-prerelease version, this acts the same as\n      // prepatch.\n      case 'prerelease':\n        if (this.prerelease.length === 0) {\n          this.inc('patch', identifier, identifierBase)\n        }\n        this.inc('pre', identifier, identifierBase)\n        break\n\n      case 'major':\n        // If this is a pre-major version, bump up to the same major version.\n        // Otherwise increment major.\n        // 1.0.0-5 bumps to 1.0.0\n        // 1.1.0 bumps to 2.0.0\n        if (\n          this.minor !== 0 ||\n          this.patch !== 0 ||\n          this.prerelease.length === 0\n        ) {\n          this.major++\n        }\n        this.minor = 0\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'minor':\n        // If this is a pre-minor version, bump up to the same minor version.\n        // Otherwise increment minor.\n        // 1.2.0-5 bumps to 1.2.0\n        // 1.2.1 bumps to 1.3.0\n        if (this.patch !== 0 || this.prerelease.length === 0) {\n          this.minor++\n        }\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'patch':\n        // If this is not a pre-release version, it will increment the patch.\n        // If it is a pre-release it will bump up to the same patch version.\n        // 1.2.0-5 patches to 1.2.0\n        // 1.2.0 patches to 1.2.1\n        if (this.prerelease.length === 0) {\n          this.patch++\n        }\n        this.prerelease = []\n        break\n      // This probably shouldn't be used publicly.\n      // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n      case 'pre': {\n        const base = Number(identifierBase) ? 1 : 0\n\n        if (!identifier && identifierBase === false) {\n          throw new Error('invalid increment argument: identifier is empty')\n        }\n\n        if (this.prerelease.length === 0) {\n          this.prerelease = [base]\n        } else {\n          let i = this.prerelease.length\n          while (--i >= 0) {\n            if (typeof this.prerelease[i] === 'number') {\n              this.prerelease[i]++\n              i = -2\n            }\n          }\n          if (i === -1) {\n            // didn't increment anything\n            if (identifier === this.prerelease.join('.') && identifierBase === false) {\n              throw new Error('invalid increment argument: identifier already exists')\n            }\n            this.prerelease.push(base)\n          }\n        }\n        if (identifier) {\n          // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n          // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n          let prerelease = [identifier, base]\n          if (identifierBase === false) {\n            prerelease = [identifier]\n          }\n          if (compareIdentifiers(this.prerelease[0], identifier) === 0) {\n            if (isNaN(this.prerelease[1])) {\n              this.prerelease = prerelease\n            }\n          } else {\n            this.prerelease = prerelease\n          }\n        }\n        break\n      }\n      default:\n        throw new Error(`invalid increment argument: ${release}`)\n    }\n    this.raw = this.format()\n    if (this.build.length) {\n      this.raw += `+${this.build.join('.')}`\n    }\n    return this\n  }\n}\n\nmodule.exports = SemVer\n", "const SemVer = require('../classes/semver')\nconst parse = (version, options, throwErrors = false) => {\n  if (version instanceof SemVer) {\n    return version\n  }\n  try {\n    return new SemVer(version, options)\n  } catch (er) {\n    if (!throwErrors) {\n      return null\n    }\n    throw er\n  }\n}\n\nmodule.exports = parse\n", "const parse = require('./parse')\nconst valid = (version, options) => {\n  const v = parse(version, options)\n  return v ? v.version : null\n}\nmodule.exports = valid\n", "const parse = require('./parse')\nconst clean = (version, options) => {\n  const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n  return s ? s.version : null\n}\nmodule.exports = clean\n", "const SemVer = require('../classes/semver')\n\nconst inc = (version, release, options, identifier, identifierBase) => {\n  if (typeof (options) === 'string') {\n    identifierBase = identifier\n    identifier = options\n    options = undefined\n  }\n\n  try {\n    return new SemVer(\n      version instanceof SemVer ? version.version : version,\n      options\n    ).inc(release, identifier, identifierBase).version\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = inc\n", "const parse = require('./parse.js')\n\nconst diff = (version1, version2) => {\n  const v1 = parse(version1, null, true)\n  const v2 = parse(version2, null, true)\n  const comparison = v1.compare(v2)\n\n  if (comparison === 0) {\n    return null\n  }\n\n  const v1Higher = comparison > 0\n  const highVersion = v1Higher ? v1 : v2\n  const lowVersion = v1Higher ? v2 : v1\n  const highHasPre = !!highVersion.prerelease.length\n  const lowHasPre = !!lowVersion.prerelease.length\n\n  if (lowHasPre && !highHasPre) {\n    // Going from prerelease -> no prerelease requires some special casing\n\n    // If the low version has only a major, then it will always be a major\n    // Some examples:\n    // 1.0.0-1 -> 1.0.0\n    // 1.0.0-1 -> 1.1.1\n    // 1.0.0-1 -> 2.0.0\n    if (!lowVersion.patch && !lowVersion.minor) {\n      return 'major'\n    }\n\n    // Otherwise it can be determined by checking the high version\n\n    if (highVersion.patch) {\n      // anything higher than a patch bump would result in the wrong version\n      return 'patch'\n    }\n\n    if (highVersion.minor) {\n      // anything higher than a minor bump would result in the wrong version\n      return 'minor'\n    }\n\n    // bumping major/minor/patch all have same result\n    return 'major'\n  }\n\n  // add the `pre` prefix if we are going to a prerelease version\n  const prefix = highHasPre ? 'pre' : ''\n\n  if (v1.major !== v2.major) {\n    return prefix + 'major'\n  }\n\n  if (v1.minor !== v2.minor) {\n    return prefix + 'minor'\n  }\n\n  if (v1.patch !== v2.patch) {\n    return prefix + 'patch'\n  }\n\n  // high and low are preleases\n  return 'prerelease'\n}\n\nmodule.exports = diff\n", "const SemVer = require('../classes/semver')\nconst major = (a, loose) => new SemVer(a, loose).major\nmodule.exports = major\n", "const SemVer = require('../classes/semver')\nconst minor = (a, loose) => new SemVer(a, loose).minor\nmodule.exports = minor\n", "const SemVer = require('../classes/semver')\nconst patch = (a, loose) => new SemVer(a, loose).patch\nmodule.exports = patch\n", "const parse = require('./parse')\nconst prerelease = (version, options) => {\n  const parsed = parse(version, options)\n  return (parsed && parsed.prerelease.length) ? parsed.prerelease : null\n}\nmodule.exports = prerelease\n", "const SemVer = require('../classes/semver')\nconst compare = (a, b, loose) =>\n  new SemVer(a, loose).compare(new SemVer(b, loose))\n\nmodule.exports = compare\n", "const compare = require('./compare')\nconst rcompare = (a, b, loose) => compare(b, a, loose)\nmodule.exports = rcompare\n", "const compare = require('./compare')\nconst compareLoose = (a, b) => compare(a, b, true)\nmodule.exports = compareLoose\n", "const SemVer = require('../classes/semver')\nconst compareBuild = (a, b, loose) => {\n  const versionA = new SemVer(a, loose)\n  const versionB = new SemVer(b, loose)\n  return versionA.compare(versionB) || versionA.compareBuild(versionB)\n}\nmodule.exports = compareBuild\n", "const compareBuild = require('./compare-build')\nconst sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose))\nmodule.exports = sort\n", "const compareBuild = require('./compare-build')\nconst rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose))\nmodule.exports = rsort\n", "const compare = require('./compare')\nconst gt = (a, b, loose) => compare(a, b, loose) > 0\nmodule.exports = gt\n", "const compare = require('./compare')\nconst lt = (a, b, loose) => compare(a, b, loose) < 0\nmodule.exports = lt\n", "const compare = require('./compare')\nconst eq = (a, b, loose) => compare(a, b, loose) === 0\nmodule.exports = eq\n", "const compare = require('./compare')\nconst neq = (a, b, loose) => compare(a, b, loose) !== 0\nmodule.exports = neq\n", "const compare = require('./compare')\nconst gte = (a, b, loose) => compare(a, b, loose) >= 0\nmodule.exports = gte\n", "const compare = require('./compare')\nconst lte = (a, b, loose) => compare(a, b, loose) <= 0\nmodule.exports = lte\n", "const eq = require('./eq')\nconst neq = require('./neq')\nconst gt = require('./gt')\nconst gte = require('./gte')\nconst lt = require('./lt')\nconst lte = require('./lte')\n\nconst cmp = (a, op, b, loose) => {\n  switch (op) {\n    case '===':\n      if (typeof a === 'object') {\n        a = a.version\n      }\n      if (typeof b === 'object') {\n        b = b.version\n      }\n      return a === b\n\n    case '!==':\n      if (typeof a === 'object') {\n        a = a.version\n      }\n      if (typeof b === 'object') {\n        b = b.version\n      }\n      return a !== b\n\n    case '':\n    case '=':\n    case '==':\n      return eq(a, b, loose)\n\n    case '!=':\n      return neq(a, b, loose)\n\n    case '>':\n      return gt(a, b, loose)\n\n    case '>=':\n      return gte(a, b, loose)\n\n    case '<':\n      return lt(a, b, loose)\n\n    case '<=':\n      return lte(a, b, loose)\n\n    default:\n      throw new TypeError(`Invalid operator: ${op}`)\n  }\n}\nmodule.exports = cmp\n", "const SemVer = require('../classes/semver')\nconst parse = require('./parse')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst coerce = (version, options) => {\n  if (version instanceof SemVer) {\n    return version\n  }\n\n  if (typeof version === 'number') {\n    version = String(version)\n  }\n\n  if (typeof version !== 'string') {\n    return null\n  }\n\n  options = options || {}\n\n  let match = null\n  if (!options.rtl) {\n    match = version.match(options.includePrerelease ? re[t.COERCEFULL] : re[t.COERCE])\n  } else {\n    // Find the right-most coercible string that does not share\n    // a terminus with a more left-ward coercible string.\n    // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'\n    // With includePrerelease option set, '1.2.3.4-rc' wants to coerce '2.3.4-rc', not '2.3.4'\n    //\n    // Walk through the string checking with a /g regexp\n    // Manually set the index so as to pick up overlapping matches.\n    // Stop when we get a match that ends at the string end, since no\n    // coercible string can be more right-ward without the same terminus.\n    const coerceRtlRegex = options.includePrerelease ? re[t.COERCERTLFULL] : re[t.COERCERTL]\n    let next\n    while ((next = coerceRtlRegex.exec(version)) &&\n        (!match || match.index + match[0].length !== version.length)\n    ) {\n      if (!match ||\n            next.index + next[0].length !== match.index + match[0].length) {\n        match = next\n      }\n      coerceRtlRegex.lastIndex = next.index + next[1].length + next[2].length\n    }\n    // leave it in a clean state\n    coerceRtlRegex.lastIndex = -1\n  }\n\n  if (match === null) {\n    return null\n  }\n\n  const major = match[2]\n  const minor = match[3] || '0'\n  const patch = match[4] || '0'\n  const prerelease = options.includePrerelease && match[5] ? `-${match[5]}` : ''\n  const build = options.includePrerelease && match[6] ? `+${match[6]}` : ''\n\n  return parse(`${major}.${minor}.${patch}${prerelease}${build}`, options)\n}\nmodule.exports = coerce\n", "class LRUCache {\n  constructor () {\n    this.max = 1000\n    this.map = new Map()\n  }\n\n  get (key) {\n    const value = this.map.get(key)\n    if (value === undefined) {\n      return undefined\n    } else {\n      // Remove the key from the map and add it to the end\n      this.map.delete(key)\n      this.map.set(key, value)\n      return value\n    }\n  }\n\n  delete (key) {\n    return this.map.delete(key)\n  }\n\n  set (key, value) {\n    const deleted = this.delete(key)\n\n    if (!deleted && value !== undefined) {\n      // If cache is full, delete the least recently used item\n      if (this.map.size >= this.max) {\n        const firstKey = this.map.keys().next().value\n        this.delete(firstKey)\n      }\n\n      this.map.set(key, value)\n    }\n\n    return this\n  }\n}\n\nmodule.exports = LRUCache\n", "const SPACE_CHARACTERS = /\\s+/g\n\n// hoisted class for cyclic dependency\nclass Range {\n  constructor (range, options) {\n    options = parseOptions(options)\n\n    if (range instanceof Range) {\n      if (\n        range.loose === !!options.loose &&\n        range.includePrerelease === !!options.includePrerelease\n      ) {\n        return range\n      } else {\n        return new Range(range.raw, options)\n      }\n    }\n\n    if (range instanceof Comparator) {\n      // just put it in the set and return\n      this.raw = range.value\n      this.set = [[range]]\n      this.formatted = undefined\n      return this\n    }\n\n    this.options = options\n    this.loose = !!options.loose\n    this.includePrerelease = !!options.includePrerelease\n\n    // First reduce all whitespace as much as possible so we do not have to rely\n    // on potentially slow regexes like \\s*. This is then stored and used for\n    // future error messages as well.\n    this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')\n\n    // First, split on ||\n    this.set = this.raw\n      .split('||')\n      // map the range to a 2d array of comparators\n      .map(r => this.parseRange(r.trim()))\n      // throw out any comparator lists that are empty\n      // this generally means that it was not a valid range, which is allowed\n      // in loose mode, but will still throw if the WHOLE range is invalid.\n      .filter(c => c.length)\n\n    if (!this.set.length) {\n      throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n    }\n\n    // if we have any that are not the null set, throw out null sets.\n    if (this.set.length > 1) {\n      // keep the first one, in case they're all null sets\n      const first = this.set[0]\n      this.set = this.set.filter(c => !isNullSet(c[0]))\n      if (this.set.length === 0) {\n        this.set = [first]\n      } else if (this.set.length > 1) {\n        // if we have any that are *, then the range is just *\n        for (const c of this.set) {\n          if (c.length === 1 && isAny(c[0])) {\n            this.set = [c]\n            break\n          }\n        }\n      }\n    }\n\n    this.formatted = undefined\n  }\n\n  get range () {\n    if (this.formatted === undefined) {\n      this.formatted = ''\n      for (let i = 0; i < this.set.length; i++) {\n        if (i > 0) {\n          this.formatted += '||'\n        }\n        const comps = this.set[i]\n        for (let k = 0; k < comps.length; k++) {\n          if (k > 0) {\n            this.formatted += ' '\n          }\n          this.formatted += comps[k].toString().trim()\n        }\n      }\n    }\n    return this.formatted\n  }\n\n  format () {\n    return this.range\n  }\n\n  toString () {\n    return this.range\n  }\n\n  parseRange (range) {\n    // memoize range parsing for performance.\n    // this is a very hot path, and fully deterministic.\n    const memoOpts =\n      (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n      (this.options.loose && FLAG_LOOSE)\n    const memoKey = memoOpts + ':' + range\n    const cached = cache.get(memoKey)\n    if (cached) {\n      return cached\n    }\n\n    const loose = this.options.loose\n    // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n    const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n    range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n    debug('hyphen replace', range)\n\n    // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n    range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n    debug('comparator trim', range)\n\n    // `~ 1.2.3` => `~1.2.3`\n    range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n    debug('tilde trim', range)\n\n    // `^ 1.2.3` => `^1.2.3`\n    range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n    debug('caret trim', range)\n\n    // At this point, the range is completely trimmed and\n    // ready to be split into comparators.\n\n    let rangeList = range\n      .split(' ')\n      .map(comp => parseComparator(comp, this.options))\n      .join(' ')\n      .split(/\\s+/)\n      // >=0.0.0 is equivalent to *\n      .map(comp => replaceGTE0(comp, this.options))\n\n    if (loose) {\n      // in loose mode, throw out any that are not valid comparators\n      rangeList = rangeList.filter(comp => {\n        debug('loose invalid filter', comp, this.options)\n        return !!comp.match(re[t.COMPARATORLOOSE])\n      })\n    }\n    debug('range list', rangeList)\n\n    // if any comparators are the null set, then replace with JUST null set\n    // if more than one comparator, remove any * comparators\n    // also, don't include the same comparator more than once\n    const rangeMap = new Map()\n    const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n    for (const comp of comparators) {\n      if (isNullSet(comp)) {\n        return [comp]\n      }\n      rangeMap.set(comp.value, comp)\n    }\n    if (rangeMap.size > 1 && rangeMap.has('')) {\n      rangeMap.delete('')\n    }\n\n    const result = [...rangeMap.values()]\n    cache.set(memoKey, result)\n    return result\n  }\n\n  intersects (range, options) {\n    if (!(range instanceof Range)) {\n      throw new TypeError('a Range is required')\n    }\n\n    return this.set.some((thisComparators) => {\n      return (\n        isSatisfiable(thisComparators, options) &&\n        range.set.some((rangeComparators) => {\n          return (\n            isSatisfiable(rangeComparators, options) &&\n            thisComparators.every((thisComparator) => {\n              return rangeComparators.every((rangeComparator) => {\n                return thisComparator.intersects(rangeComparator, options)\n              })\n            })\n          )\n        })\n      )\n    })\n  }\n\n  // if ANY of the sets match ALL of its comparators, then pass\n  test (version) {\n    if (!version) {\n      return false\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    for (let i = 0; i < this.set.length; i++) {\n      if (testSet(this.set[i], version, this.options)) {\n        return true\n      }\n    }\n    return false\n  }\n}\n\nmodule.exports = Range\n\nconst LRU = require('../internal/lrucache')\nconst cache = new LRU()\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n  safeRe: re,\n  t,\n  comparatorTrimReplace,\n  tildeTrimReplace,\n  caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n  let result = true\n  const remainingComparators = comparators.slice()\n  let testComparator = remainingComparators.pop()\n\n  while (result && remainingComparators.length) {\n    result = remainingComparators.every((otherComparator) => {\n      return testComparator.intersects(otherComparator, options)\n    })\n\n    testComparator = remainingComparators.pop()\n  }\n\n  return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n  debug('comp', comp, options)\n  comp = replaceCarets(comp, options)\n  debug('caret', comp)\n  comp = replaceTildes(comp, options)\n  debug('tildes', comp)\n  comp = replaceXRanges(comp, options)\n  debug('xrange', comp)\n  comp = replaceStars(comp, options)\n  debug('stars', comp)\n  return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceTilde(c, options))\n    .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n  const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('tilde', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      // ~1.2 == >=1.2.0 <1.3.0-0\n      ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n    } else if (pr) {\n      debug('replaceTilde pr', pr)\n      ret = `>=${M}.${m}.${p}-${pr\n      } <${M}.${+m + 1}.0-0`\n    } else {\n      // ~1.2.3 == >=1.2.3 <1.3.0-0\n      ret = `>=${M}.${m}.${p\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('tilde return', ret)\n    return ret\n  })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceCaret(c, options))\n    .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n  debug('caret', comp, options)\n  const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n  const z = options.includePrerelease ? '-0' : ''\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('caret', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      if (M === '0') {\n        ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n      } else {\n        ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n      }\n    } else if (pr) {\n      debug('replaceCaret pr', pr)\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p}-${pr\n        } <${+M + 1}.0.0-0`\n      }\n    } else {\n      debug('no pr')\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p\n        } <${+M + 1}.0.0-0`\n      }\n    }\n\n    debug('caret return', ret)\n    return ret\n  })\n}\n\nconst replaceXRanges = (comp, options) => {\n  debug('replaceXRanges', comp, options)\n  return comp\n    .split(/\\s+/)\n    .map((c) => replaceXRange(c, options))\n    .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n  comp = comp.trim()\n  const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n    debug('xRange', comp, ret, gtlt, M, m, p, pr)\n    const xM = isX(M)\n    const xm = xM || isX(m)\n    const xp = xm || isX(p)\n    const anyX = xp\n\n    if (gtlt === '=' && anyX) {\n      gtlt = ''\n    }\n\n    // if we're including prereleases in the match, then we need\n    // to fix this to -0, the lowest possible prerelease value\n    pr = options.includePrerelease ? '-0' : ''\n\n    if (xM) {\n      if (gtlt === '>' || gtlt === '<') {\n        // nothing is allowed\n        ret = '<0.0.0-0'\n      } else {\n        // nothing is forbidden\n        ret = '*'\n      }\n    } else if (gtlt && anyX) {\n      // we know patch is an x, because we have any x at all.\n      // replace X with 0\n      if (xm) {\n        m = 0\n      }\n      p = 0\n\n      if (gtlt === '>') {\n        // >1 => >=2.0.0\n        // >1.2 => >=1.3.0\n        gtlt = '>='\n        if (xm) {\n          M = +M + 1\n          m = 0\n          p = 0\n        } else {\n          m = +m + 1\n          p = 0\n        }\n      } else if (gtlt === '<=') {\n        // <=0.7.x is actually <0.8.0, since any 0.7.x should\n        // pass.  Similarly, <=7.x is actually <8.0.0, etc.\n        gtlt = '<'\n        if (xm) {\n          M = +M + 1\n        } else {\n          m = +m + 1\n        }\n      }\n\n      if (gtlt === '<') {\n        pr = '-0'\n      }\n\n      ret = `${gtlt + M}.${m}.${p}${pr}`\n    } else if (xm) {\n      ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n    } else if (xp) {\n      ret = `>=${M}.${m}.0${pr\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('xRange return', ret)\n\n    return ret\n  })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n  debug('replaceStars', comp, options)\n  // Looseness is ignored here.  star is always as loose as it gets!\n  return comp\n    .trim()\n    .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n  debug('replaceGTE0', comp, options)\n  return comp\n    .trim()\n    .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\n// TODO build?\nconst hyphenReplace = incPr => ($0,\n  from, fM, fm, fp, fpr, fb,\n  to, tM, tm, tp, tpr) => {\n  if (isX(fM)) {\n    from = ''\n  } else if (isX(fm)) {\n    from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n  } else if (isX(fp)) {\n    from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n  } else if (fpr) {\n    from = `>=${from}`\n  } else {\n    from = `>=${from}${incPr ? '-0' : ''}`\n  }\n\n  if (isX(tM)) {\n    to = ''\n  } else if (isX(tm)) {\n    to = `<${+tM + 1}.0.0-0`\n  } else if (isX(tp)) {\n    to = `<${tM}.${+tm + 1}.0-0`\n  } else if (tpr) {\n    to = `<=${tM}.${tm}.${tp}-${tpr}`\n  } else if (incPr) {\n    to = `<${tM}.${tm}.${+tp + 1}-0`\n  } else {\n    to = `<=${to}`\n  }\n\n  return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n  for (let i = 0; i < set.length; i++) {\n    if (!set[i].test(version)) {\n      return false\n    }\n  }\n\n  if (version.prerelease.length && !options.includePrerelease) {\n    // Find the set of versions that are allowed to have prereleases\n    // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n    // That should allow `1.2.3-pr.2` to pass.\n    // However, `1.2.4-alpha.notready` should NOT be allowed,\n    // even though it's within the range set by the comparators.\n    for (let i = 0; i < set.length; i++) {\n      debug(set[i].semver)\n      if (set[i].semver === Comparator.ANY) {\n        continue\n      }\n\n      if (set[i].semver.prerelease.length > 0) {\n        const allowed = set[i].semver\n        if (allowed.major === version.major &&\n            allowed.minor === version.minor &&\n            allowed.patch === version.patch) {\n          return true\n        }\n      }\n    }\n\n    // Version has a -pre, but it's not one of the ones we like.\n    return false\n  }\n\n  return true\n}\n", "const ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n  static get ANY () {\n    return ANY\n  }\n\n  constructor (comp, options) {\n    options = parseOptions(options)\n\n    if (comp instanceof Comparator) {\n      if (comp.loose === !!options.loose) {\n        return comp\n      } else {\n        comp = comp.value\n      }\n    }\n\n    comp = comp.trim().split(/\\s+/).join(' ')\n    debug('comparator', comp, options)\n    this.options = options\n    this.loose = !!options.loose\n    this.parse(comp)\n\n    if (this.semver === ANY) {\n      this.value = ''\n    } else {\n      this.value = this.operator + this.semver.version\n    }\n\n    debug('comp', this)\n  }\n\n  parse (comp) {\n    const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n    const m = comp.match(r)\n\n    if (!m) {\n      throw new TypeError(`Invalid comparator: ${comp}`)\n    }\n\n    this.operator = m[1] !== undefined ? m[1] : ''\n    if (this.operator === '=') {\n      this.operator = ''\n    }\n\n    // if it literally is just '>' or '' then allow anything.\n    if (!m[2]) {\n      this.semver = ANY\n    } else {\n      this.semver = new SemVer(m[2], this.options.loose)\n    }\n  }\n\n  toString () {\n    return this.value\n  }\n\n  test (version) {\n    debug('Comparator.test', version, this.options.loose)\n\n    if (this.semver === ANY || version === ANY) {\n      return true\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    return cmp(version, this.operator, this.semver, this.options)\n  }\n\n  intersects (comp, options) {\n    if (!(comp instanceof Comparator)) {\n      throw new TypeError('a Comparator is required')\n    }\n\n    if (this.operator === '') {\n      if (this.value === '') {\n        return true\n      }\n      return new Range(comp.value, options).test(this.value)\n    } else if (comp.operator === '') {\n      if (comp.value === '') {\n        return true\n      }\n      return new Range(this.value, options).test(comp.semver)\n    }\n\n    options = parseOptions(options)\n\n    // Special cases where nothing can possibly be lower\n    if (options.includePrerelease &&\n      (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n      return false\n    }\n    if (!options.includePrerelease &&\n      (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n      return false\n    }\n\n    // Same direction increasing (> or >=)\n    if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n      return true\n    }\n    // Same direction decreasing (< or <=)\n    if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // same SemVer and both sides are inclusive (<= or >=)\n    if (\n      (this.semver.version === comp.semver.version) &&\n      this.operator.includes('=') && comp.operator.includes('=')) {\n      return true\n    }\n    // opposite directions less than\n    if (cmp(this.semver, '<', comp.semver, options) &&\n      this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // opposite directions greater than\n    if (cmp(this.semver, '>', comp.semver, options) &&\n      this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n      return true\n    }\n    return false\n  }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n", "const Range = require('../classes/range')\nconst satisfies = (version, range, options) => {\n  try {\n    range = new Range(range, options)\n  } catch (er) {\n    return false\n  }\n  return range.test(version)\n}\nmodule.exports = satisfies\n", "const Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n  new Range(range, options).set\n    .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n", "const SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\n\nconst maxSatisfying = (versions, range, options) => {\n  let max = null\n  let maxSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!max || maxSV.compare(v) === -1) {\n        // compare(max, v, true)\n        max = v\n        maxSV = new SemVer(max, options)\n      }\n    }\n  })\n  return max\n}\nmodule.exports = maxSatisfying\n", "const SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst minSatisfying = (versions, range, options) => {\n  let min = null\n  let minSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!min || minSV.compare(v) === 1) {\n        // compare(min, v, true)\n        min = v\n        minSV = new SemVer(min, options)\n      }\n    }\n  })\n  return min\n}\nmodule.exports = minSatisfying\n", "const SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst gt = require('../functions/gt')\n\nconst minVersion = (range, loose) => {\n  range = new Range(range, loose)\n\n  let minver = new SemVer('0.0.0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = new SemVer('0.0.0-0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = null\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let setMin = null\n    comparators.forEach((comparator) => {\n      // Clone to avoid manipulating the comparator's semver object.\n      const compver = new SemVer(comparator.semver.version)\n      switch (comparator.operator) {\n        case '>':\n          if (compver.prerelease.length === 0) {\n            compver.patch++\n          } else {\n            compver.prerelease.push(0)\n          }\n          compver.raw = compver.format()\n          /* fallthrough */\n        case '':\n        case '>=':\n          if (!setMin || gt(compver, setMin)) {\n            setMin = compver\n          }\n          break\n        case '<':\n        case '<=':\n          /* Ignore maximum versions */\n          break\n        /* istanbul ignore next */\n        default:\n          throw new Error(`Unexpected operation: ${comparator.operator}`)\n      }\n    })\n    if (setMin && (!minver || gt(minver, setMin))) {\n      minver = setMin\n    }\n  }\n\n  if (minver && range.test(minver)) {\n    return minver\n  }\n\n  return null\n}\nmodule.exports = minVersion\n", "const Range = require('../classes/range')\nconst validRange = (range, options) => {\n  try {\n    // Return '*' instead of '' so that truthiness works.\n    // This will throw if it's invalid anyway\n    return new Range(range, options).range || '*'\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = validRange\n", "const SemVer = require('../classes/semver')\nconst Comparator = require('../classes/comparator')\nconst { ANY } = Comparator\nconst Range = require('../classes/range')\nconst satisfies = require('../functions/satisfies')\nconst gt = require('../functions/gt')\nconst lt = require('../functions/lt')\nconst lte = require('../functions/lte')\nconst gte = require('../functions/gte')\n\nconst outside = (version, range, hilo, options) => {\n  version = new SemVer(version, options)\n  range = new Range(range, options)\n\n  let gtfn, ltefn, ltfn, comp, ecomp\n  switch (hilo) {\n    case '>':\n      gtfn = gt\n      ltefn = lte\n      ltfn = lt\n      comp = '>'\n      ecomp = '>='\n      break\n    case '<':\n      gtfn = lt\n      ltefn = gte\n      ltfn = gt\n      comp = '<'\n      ecomp = '<='\n      break\n    default:\n      throw new TypeError('Must provide a hilo val of \"<\" or \">\"')\n  }\n\n  // If it satisfies the range it is not outside\n  if (satisfies(version, range, options)) {\n    return false\n  }\n\n  // From now on, variable terms are as if we're in \"gtr\" mode.\n  // but note that everything is flipped for the \"ltr\" function.\n\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let high = null\n    let low = null\n\n    comparators.forEach((comparator) => {\n      if (comparator.semver === ANY) {\n        comparator = new Comparator('>=0.0.0')\n      }\n      high = high || comparator\n      low = low || comparator\n      if (gtfn(comparator.semver, high.semver, options)) {\n        high = comparator\n      } else if (ltfn(comparator.semver, low.semver, options)) {\n        low = comparator\n      }\n    })\n\n    // If the edge version comparator has a operator then our version\n    // isn't outside it\n    if (high.operator === comp || high.operator === ecomp) {\n      return false\n    }\n\n    // If the lowest version comparator has an operator and our version\n    // is less than it then it isn't higher than the range\n    if ((!low.operator || low.operator === comp) &&\n        ltefn(version, low.semver)) {\n      return false\n    } else if (low.operator === ecomp && ltfn(version, low.semver)) {\n      return false\n    }\n  }\n  return true\n}\n\nmodule.exports = outside\n", "// Determine if version is greater than all the versions possible in the range.\nconst outside = require('./outside')\nconst gtr = (version, range, options) => outside(version, range, '>', options)\nmodule.exports = gtr\n", "const outside = require('./outside')\n// Determine if version is less than all the versions possible in the range\nconst ltr = (version, range, options) => outside(version, range, '<', options)\nmodule.exports = ltr\n", "const Range = require('../classes/range')\nconst intersects = (r1, r2, options) => {\n  r1 = new Range(r1, options)\n  r2 = new Range(r2, options)\n  return r1.intersects(r2, options)\n}\nmodule.exports = intersects\n", "// given a set of versions and a range, create a \"simplified\" range\n// that includes the same versions that the original range does\n// If the original range is shorter than the simplified one, return that.\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\nmodule.exports = (versions, range, options) => {\n  const set = []\n  let first = null\n  let prev = null\n  const v = versions.sort((a, b) => compare(a, b, options))\n  for (const version of v) {\n    const included = satisfies(version, range, options)\n    if (included) {\n      prev = version\n      if (!first) {\n        first = version\n      }\n    } else {\n      if (prev) {\n        set.push([first, prev])\n      }\n      prev = null\n      first = null\n    }\n  }\n  if (first) {\n    set.push([first, null])\n  }\n\n  const ranges = []\n  for (const [min, max] of set) {\n    if (min === max) {\n      ranges.push(min)\n    } else if (!max && min === v[0]) {\n      ranges.push('*')\n    } else if (!max) {\n      ranges.push(`>=${min}`)\n    } else if (min === v[0]) {\n      ranges.push(`<=${max}`)\n    } else {\n      ranges.push(`${min} - ${max}`)\n    }\n  }\n  const simplified = ranges.join(' || ')\n  const original = typeof range.raw === 'string' ? range.raw : String(range)\n  return simplified.length < original.length ? simplified : range\n}\n", "const Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n//   some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n//   - If C is only the ANY comparator, return true\n//   - Else if in prerelease mode, return false\n//   - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n//   - if in prerelease mode, return true\n//   - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n//   - If GT, and EQ does not satisfy GT, return true (null set)\n//   - If LT, and EQ does not satisfy LT, return true (null set)\n//   - If EQ satisfies every C, return true\n//   - Else return false\n// - If GT\n//   - If GT.semver is lower than any > or >= comp in C, return false\n//   - If GT is >=, and GT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n//   - If LT.semver is greater than any < or <= comp in C, return false\n//   - If LT is <=, and LT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n  if (sub === dom) {\n    return true\n  }\n\n  sub = new Range(sub, options)\n  dom = new Range(dom, options)\n  let sawNonNull = false\n\n  OUTER: for (const simpleSub of sub.set) {\n    for (const simpleDom of dom.set) {\n      const isSub = simpleSubset(simpleSub, simpleDom, options)\n      sawNonNull = sawNonNull || isSub !== null\n      if (isSub) {\n        continue OUTER\n      }\n    }\n    // the null set is a subset of everything, but null simple ranges in\n    // a complex range should be ignored.  so if we saw a non-null range,\n    // then we know this isn't a subset, but if EVERY simple range was null,\n    // then it is a subset.\n    if (sawNonNull) {\n      return false\n    }\n  }\n  return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n  if (sub === dom) {\n    return true\n  }\n\n  if (sub.length === 1 && sub[0].semver === ANY) {\n    if (dom.length === 1 && dom[0].semver === ANY) {\n      return true\n    } else if (options.includePrerelease) {\n      sub = minimumVersionWithPreRelease\n    } else {\n      sub = minimumVersion\n    }\n  }\n\n  if (dom.length === 1 && dom[0].semver === ANY) {\n    if (options.includePrerelease) {\n      return true\n    } else {\n      dom = minimumVersion\n    }\n  }\n\n  const eqSet = new Set()\n  let gt, lt\n  for (const c of sub) {\n    if (c.operator === '>' || c.operator === '>=') {\n      gt = higherGT(gt, c, options)\n    } else if (c.operator === '<' || c.operator === '<=') {\n      lt = lowerLT(lt, c, options)\n    } else {\n      eqSet.add(c.semver)\n    }\n  }\n\n  if (eqSet.size > 1) {\n    return null\n  }\n\n  let gtltComp\n  if (gt && lt) {\n    gtltComp = compare(gt.semver, lt.semver, options)\n    if (gtltComp > 0) {\n      return null\n    } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n      return null\n    }\n  }\n\n  // will iterate one or zero times\n  for (const eq of eqSet) {\n    if (gt && !satisfies(eq, String(gt), options)) {\n      return null\n    }\n\n    if (lt && !satisfies(eq, String(lt), options)) {\n      return null\n    }\n\n    for (const c of dom) {\n      if (!satisfies(eq, String(c), options)) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  let higher, lower\n  let hasDomLT, hasDomGT\n  // if the subset has a prerelease, we need a comparator in the superset\n  // with the same tuple and a prerelease, or it's not a subset\n  let needDomLTPre = lt &&\n    !options.includePrerelease &&\n    lt.semver.prerelease.length ? lt.semver : false\n  let needDomGTPre = gt &&\n    !options.includePrerelease &&\n    gt.semver.prerelease.length ? gt.semver : false\n  // exception: <1.2.3-0 is the same as <1.2.3\n  if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n      lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n    needDomLTPre = false\n  }\n\n  for (const c of dom) {\n    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n    if (gt) {\n      if (needDomGTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomGTPre.major &&\n            c.semver.minor === needDomGTPre.minor &&\n            c.semver.patch === needDomGTPre.patch) {\n          needDomGTPre = false\n        }\n      }\n      if (c.operator === '>' || c.operator === '>=') {\n        higher = higherGT(gt, c, options)\n        if (higher === c && higher !== gt) {\n          return false\n        }\n      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (lt) {\n      if (needDomLTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomLTPre.major &&\n            c.semver.minor === needDomLTPre.minor &&\n            c.semver.patch === needDomLTPre.patch) {\n          needDomLTPre = false\n        }\n      }\n      if (c.operator === '<' || c.operator === '<=') {\n        lower = lowerLT(lt, c, options)\n        if (lower === c && lower !== lt) {\n          return false\n        }\n      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (!c.operator && (lt || gt) && gtltComp !== 0) {\n      return false\n    }\n  }\n\n  // if there was a < or >, and nothing in the dom, then must be false\n  // UNLESS it was limited by another range in the other direction.\n  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n  if (gt && hasDomLT && !lt && gtltComp !== 0) {\n    return false\n  }\n\n  if (lt && hasDomGT && !gt && gtltComp !== 0) {\n    return false\n  }\n\n  // we needed a prerelease range in a specific tuple, but didn't get one\n  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,\n  // because it includes prereleases in the 1.2.3 tuple\n  if (needDomGTPre || needDomLTPre) {\n    return false\n  }\n\n  return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp > 0 ? a\n    : comp < 0 ? b\n    : b.operator === '>' && a.operator === '>=' ? b\n    : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp < 0 ? a\n    : comp > 0 ? b\n    : b.operator === '<' && a.operator === '<=' ? b\n    : a\n}\n\nmodule.exports = subset\n", "// just pre-load all the stuff that index.js lazily exports\nconst internalRe = require('./internal/re')\nconst constants = require('./internal/constants')\nconst SemVer = require('./classes/semver')\nconst identifiers = require('./internal/identifiers')\nconst parse = require('./functions/parse')\nconst valid = require('./functions/valid')\nconst clean = require('./functions/clean')\nconst inc = require('./functions/inc')\nconst diff = require('./functions/diff')\nconst major = require('./functions/major')\nconst minor = require('./functions/minor')\nconst patch = require('./functions/patch')\nconst prerelease = require('./functions/prerelease')\nconst compare = require('./functions/compare')\nconst rcompare = require('./functions/rcompare')\nconst compareLoose = require('./functions/compare-loose')\nconst compareBuild = require('./functions/compare-build')\nconst sort = require('./functions/sort')\nconst rsort = require('./functions/rsort')\nconst gt = require('./functions/gt')\nconst lt = require('./functions/lt')\nconst eq = require('./functions/eq')\nconst neq = require('./functions/neq')\nconst gte = require('./functions/gte')\nconst lte = require('./functions/lte')\nconst cmp = require('./functions/cmp')\nconst coerce = require('./functions/coerce')\nconst Comparator = require('./classes/comparator')\nconst Range = require('./classes/range')\nconst satisfies = require('./functions/satisfies')\nconst toComparators = require('./ranges/to-comparators')\nconst maxSatisfying = require('./ranges/max-satisfying')\nconst minSatisfying = require('./ranges/min-satisfying')\nconst minVersion = require('./ranges/min-version')\nconst validRange = require('./ranges/valid')\nconst outside = require('./ranges/outside')\nconst gtr = require('./ranges/gtr')\nconst ltr = require('./ranges/ltr')\nconst intersects = require('./ranges/intersects')\nconst simplifyRange = require('./ranges/simplify')\nconst subset = require('./ranges/subset')\nmodule.exports = {\n  parse,\n  valid,\n  clean,\n  inc,\n  diff,\n  major,\n  minor,\n  patch,\n  prerelease,\n  compare,\n  rcompare,\n  compareLoose,\n  compareBuild,\n  sort,\n  rsort,\n  gt,\n  lt,\n  eq,\n  neq,\n  gte,\n  lte,\n  cmp,\n  coerce,\n  Comparator,\n  Range,\n  satisfies,\n  toComparators,\n  maxSatisfying,\n  minSatisfying,\n  minVersion,\n  validRange,\n  outside,\n  gtr,\n  ltr,\n  intersects,\n  simplifyRange,\n  subset,\n  SemVer,\n  re: internalRe.re,\n  src: internalRe.src,\n  tokens: internalRe.t,\n  SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,\n  RELEASE_TYPES: constants.RELEASE_TYPES,\n  compareIdentifiers: identifiers.compareIdentifiers,\n  rcompareIdentifiers: identifiers.rcompareIdentifiers,\n}\n", "import semver from \"semver\";\n\n/**\n * The USB product IDs will be defined as MMII, encoding a model (MM) and an interface bitfield (II)\n *\n ** Model\n * Ledger Nano S : 0x10\n * Ledger Blue : 0x00\n * Ledger Nano X : 0x40\n *\n ** Interface support bitfield\n * Generic HID : 0x01\n * Keyboard HID : 0x02\n * U2F : 0x04\n * CCID : 0x08\n * WebUSB : 0x10\n */\nexport const IIGenericHID = 0x01;\nexport const IIKeyboardHID = 0x02;\nexport const IIU2F = 0x04;\nexport const IICCID = 0x08;\nexport const IIWebUSB = 0x10;\n\nexport enum DeviceModelId {\n  /** Ledger Blue */\n  blue = \"blue\",\n  /** Ledger Nano S */\n  nanoS = \"nanoS\",\n  /** Ledger Nano S Plus */\n  nanoSP = \"nanoSP\",\n  /** Ledger Nano X */\n  nanoX = \"nanoX\",\n  /** Ledger Stax */\n  stax = \"stax\",\n  /** Ledger Flex (\"europa\" is the internal name) */\n  europa = \"europa\", // DO NOT CHANGE TO FLEX or handle all migration issues, things will break\n}\n\nconst devices: { [key in DeviceModelId]: DeviceModel } = {\n  [DeviceModelId.blue]: {\n    id: DeviceModelId.blue,\n    productName: \"Ledger\u00A0Blue\",\n    productIdMM: 0x00,\n    legacyUsbProductId: 0x0000,\n    usbOnly: true,\n    memorySize: 480 * 1024,\n    masks: [0x31000000, 0x31010000],\n    getBlockSize: (_firwareVersion: string): number => 4 * 1024,\n  },\n  [DeviceModelId.nanoS]: {\n    id: DeviceModelId.nanoS,\n    productName: \"Ledger\u00A0Nano\u00A0S\",\n    productIdMM: 0x10,\n    legacyUsbProductId: 0x0001,\n    usbOnly: true,\n    memorySize: 320 * 1024,\n    masks: [0x31100000],\n    getBlockSize: (firmwareVersion: string): number =>\n      semver.lt(semver.coerce(firmwareVersion) ?? \"\", \"2.0.0\") ? 4 * 1024 : 2 * 1024,\n  },\n  [DeviceModelId.nanoX]: {\n    id: DeviceModelId.nanoX,\n    productName: \"Ledger\u00A0Nano\u00A0X\",\n    productIdMM: 0x40,\n    legacyUsbProductId: 0x0004,\n    usbOnly: false,\n    memorySize: 2 * 1024 * 1024,\n    masks: [0x33000000],\n    getBlockSize: (_firwareVersion: string): number => 4 * 1024,\n    bluetoothSpec: [\n      {\n        serviceUuid: \"13d63400-2c97-0004-0000-4c6564676572\",\n        notifyUuid: \"13d63400-2c97-0004-0001-4c6564676572\",\n        writeUuid: \"13d63400-2c97-0004-0002-4c6564676572\",\n        writeCmdUuid: \"13d63400-2c97-0004-0003-4c6564676572\",\n      },\n    ],\n  },\n  [DeviceModelId.nanoSP]: {\n    id: DeviceModelId.nanoSP,\n    productName: \"Ledger Nano S Plus\",\n    productIdMM: 0x50,\n    legacyUsbProductId: 0x0005,\n    usbOnly: true,\n    memorySize: 1533 * 1024,\n    masks: [0x33100000],\n    getBlockSize: (_firmwareVersion: string): number => 32,\n  },\n  [DeviceModelId.stax]: {\n    id: DeviceModelId.stax,\n    productName: \"Ledger\u00A0Stax\",\n    productIdMM: 0x60,\n    legacyUsbProductId: 0x0006,\n    usbOnly: false,\n    memorySize: 1533 * 1024,\n    masks: [0x33200000],\n    getBlockSize: (_firmwareVersion: string): number => 32,\n    bluetoothSpec: [\n      {\n        serviceUuid: \"13d63400-2c97-6004-0000-4c6564676572\",\n        notifyUuid: \"13d63400-2c97-6004-0001-4c6564676572\",\n        writeUuid: \"13d63400-2c97-6004-0002-4c6564676572\",\n        writeCmdUuid: \"13d63400-2c97-6004-0003-4c6564676572\",\n      },\n    ],\n  },\n  [DeviceModelId.europa]: {\n    id: DeviceModelId.europa,\n    productName: \"Ledger\u00A0Flex\",\n    productIdMM: 0x70,\n    legacyUsbProductId: 0x0007,\n    usbOnly: false,\n    memorySize: 1533 * 1024,\n    masks: [0x33300000],\n    getBlockSize: (_firmwareVersion: string): number => 32,\n    bluetoothSpec: [\n      {\n        serviceUuid: \"13d63400-2c97-3004-0000-4c6564676572\",\n        notifyUuid: \"13d63400-2c97-3004-0001-4c6564676572\",\n        writeUuid: \"13d63400-2c97-3004-0002-4c6564676572\",\n        writeCmdUuid: \"13d63400-2c97-3004-0003-4c6564676572\",\n      },\n    ],\n  },\n};\n\nconst productMap = {\n  Blue: DeviceModelId.blue,\n  \"Nano S\": DeviceModelId.nanoS,\n  \"Nano S Plus\": DeviceModelId.nanoSP,\n  \"Nano X\": DeviceModelId.nanoX,\n  Stax: DeviceModelId.stax,\n  Europa: DeviceModelId.europa,\n};\n\nconst devicesList: DeviceModel[] = Object.values(devices);\n\n/**\n *\n */\nexport const ledgerUSBVendorId = 0x2c97;\n\n/**\n *\n */\nexport const getDeviceModel = (id: DeviceModelId): DeviceModel => {\n  const info = devices[id];\n  if (!info) throw new Error(\"device '\" + id + \"' does not exist\");\n  return info;\n};\n\n/**\n * Given a `targetId`, return the deviceModel associated to it,\n * based on the first two bytes.\n */\nexport const identifyTargetId = (targetId: number): DeviceModel | null | undefined => {\n  const deviceModel = devicesList.find(({ masks }) =>\n    masks.find(mask => (targetId & 0xffff0000) === mask),\n  );\n\n  return deviceModel;\n};\n\n/**\n * From a given USB product id, return the deviceModel associated to it.\n *\n * The mapping from the product id is only based on the 2 most significant bytes.\n * For example, Stax is defined with a product id of 0x60ii, a product id 0x6011 would be mapped to it.\n */\nexport const identifyUSBProductId = (usbProductId: number): DeviceModel | null | undefined => {\n  const legacy = devicesList.find(d => d.legacyUsbProductId === usbProductId);\n  if (legacy) return legacy;\n  const mm = usbProductId >> 8;\n  const deviceModel = devicesList.find(d => d.productIdMM === mm);\n  return deviceModel;\n};\n\nexport const identifyProductName = (productName: string): DeviceModel | null | undefined => {\n  const deviceModel = devicesList.find(d => d.id === productMap[productName]);\n  return deviceModel;\n};\n\nconst bluetoothServices: string[] = [];\nconst serviceUuidToInfos: Record<string, BluetoothInfos> = {};\n\nfor (const id in devices) {\n  const deviceModel = devices[id];\n  const { bluetoothSpec } = deviceModel;\n  if (bluetoothSpec) {\n    for (let i = 0; i < bluetoothSpec.length; i++) {\n      const spec = bluetoothSpec[i];\n      bluetoothServices.push(spec.serviceUuid);\n      serviceUuidToInfos[spec.serviceUuid] = serviceUuidToInfos[\n        spec.serviceUuid.replace(/-/g, \"\")\n      ] = {\n        deviceModel,\n        ...spec,\n      };\n    }\n  }\n}\n\n/**\n *\n */\nexport const getBluetoothServiceUuids = (): string[] => bluetoothServices;\n\n/**\n *\n */\nexport const getInfosForServiceUuid = (uuid: string): BluetoothInfos | undefined =>\n  serviceUuidToInfos[uuid.toLowerCase()];\n\n/**\n *\n */\nexport interface DeviceModel {\n  id: DeviceModelId;\n  productName: string;\n  productIdMM: number;\n  legacyUsbProductId: number;\n  usbOnly: boolean;\n  memorySize: number;\n  masks: number[];\n  // blockSize: number, // THIS FIELD IS DEPRECATED, use getBlockSize\n  getBlockSize: (firmwareVersion: string) => number;\n  bluetoothSpec?: {\n    serviceUuid: string;\n    writeUuid: string;\n    writeCmdUuid: string;\n    notifyUuid: string;\n  }[];\n}\n\n/**\n *\n */\nexport interface BluetoothInfos {\n  deviceModel: DeviceModel;\n  serviceUuid: string;\n  writeUuid: string;\n  writeCmdUuid: string;\n  notifyUuid: string;\n}\n", "/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol, Iterator */\n\nvar extendStatics = function(d, b) {\n  extendStatics = Object.setPrototypeOf ||\n      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n  return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null)\n      throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() { this.constructor = d; }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n  __assign = Object.assign || function __assign(t) {\n      for (var s, i = 1, n = arguments.length; i < n; i++) {\n          s = arguments[i];\n          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n      }\n      return t;\n  }\n  return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n      t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n              t[p[i]] = s[p[i]];\n      }\n  return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n  else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n  return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n  var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _, done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n      var context = {};\n      for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n      for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n      context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n      var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n      if (kind === \"accessor\") {\n          if (result === void 0) continue;\n          if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n          if (_ = accept(result.get)) descriptor.get = _;\n          if (_ = accept(result.set)) descriptor.set = _;\n          if (_ = accept(result.init)) initializers.unshift(_);\n      }\n      else if (_ = accept(result)) {\n          if (kind === \"field\") initializers.unshift(_);\n          else descriptor[key] = _;\n      }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n  return new (P || (P = Promise))(function (resolve, reject) {\n      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n      function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n      step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\n\nexport function __generator(thisArg, body) {\n  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n  return g.next = verb(0), g[\"throw\"] = verb(1), g[\"return\"] = verb(2), typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n  function verb(n) { return function (v) { return step([n, v]); }; }\n  function step(op) {\n      if (f) throw new TypeError(\"Generator is already executing.\");\n      while (g && (g = 0, op[0] && (_ = 0)), _) try {\n          if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n          if (y = 0, t) op = [op[0] & 2, t.value];\n          switch (op[0]) {\n              case 0: case 1: t = op; break;\n              case 4: _.label++; return { value: op[1], done: false };\n              case 5: _.label++; y = op[1]; op = [0]; continue;\n              case 7: op = _.ops.pop(); _.trys.pop(); continue;\n              default:\n                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                  if (t[2]) _.ops.pop();\n                  _.trys.pop(); continue;\n          }\n          op = body.call(thisArg, _);\n      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n  }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n  }\n  Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n      next: function () {\n          if (o && i >= o.length) o = void 0;\n          return { value: o && o[i++], done: !o };\n      }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o), r, ar = [], e;\n  try {\n      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  }\n  catch (error) { e = { error: error }; }\n  finally {\n      try {\n          if (r && !r.done && (m = i[\"return\"])) m.call(i);\n      }\n      finally { if (e) throw e.error; }\n  }\n  return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++)\n      ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++)\n      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n          r[k] = a[j];\n  return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n      if (ar || !(i in from)) {\n          if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n          ar[i] = from[i];\n      }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []), i, q = [];\n  return i = Object.create((typeof AsyncIterator === \"function\" ? AsyncIterator : Object).prototype), verb(\"next\"), verb(\"throw\"), verb(\"return\", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;\n  function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }\n  function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }\n  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n  function fulfill(value) { resume(\"next\", value); }\n  function reject(value) { resume(\"throw\", value); }\n  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator], i;\n  return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n  function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n  return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n  Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n  o[\"default\"] = v;\n};\n\nvar ownKeys = function(o) {\n  ownKeys = Object.getOwnPropertyNames || function (o) {\n    var ar = [];\n    for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n    return ar;\n  };\n  return ownKeys(o);\n};\n\nexport function __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n  __setModuleDefault(result, mod);\n  return result;\n}\n\nexport function __importDefault(mod) {\n  return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n  return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n  if (value !== null && value !== void 0) {\n    if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n    var dispose, inner;\n    if (async) {\n      if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n      dispose = value[Symbol.asyncDispose];\n    }\n    if (dispose === void 0) {\n      if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n      dispose = value[Symbol.dispose];\n      if (async) inner = dispose;\n    }\n    if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n    if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };\n    env.stack.push({ value: value, dispose: dispose, async: async });\n  }\n  else if (async) {\n    env.stack.push({ async: true });\n  }\n  return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n  var e = new Error(message);\n  return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n  function fail(e) {\n    env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n    env.hasError = true;\n  }\n  var r, s = 0;\n  function next() {\n    while (r = env.stack.pop()) {\n      try {\n        if (!r.async && s === 1) return s = 0, env.stack.push(r), Promise.resolve().then(next);\n        if (r.dispose) {\n          var result = r.dispose.call(r.value);\n          if (r.async) return s |= 2, Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n        }\n        else s |= 1;\n      }\n      catch (e) {\n        fail(e);\n      }\n    }\n    if (s === 1) return env.hasError ? Promise.reject(env.error) : Promise.resolve();\n    if (env.hasError) throw env.error;\n  }\n  return next();\n}\n\nexport function __rewriteRelativeImportExtension(path, preserveJsx) {\n  if (typeof path === \"string\" && /^\\.\\.?\\//.test(path)) {\n      return path.replace(/\\.(tsx)$|((?:\\.d)?)((?:\\.[^./]+?)?)\\.([cm]?)ts$/i, function (m, tsx, d, ext, cm) {\n          return tsx ? preserveJsx ? \".jsx\" : \".js\" : d && (!ext || !cm) ? m : (d + ext + \".\" + cm.toLowerCase() + \"js\");\n      });\n  }\n  return path;\n}\n\nexport default {\n  __extends,\n  __assign,\n  __rest,\n  __decorate,\n  __param,\n  __esDecorate,\n  __runInitializers,\n  __propKey,\n  __setFunctionName,\n  __metadata,\n  __awaiter,\n  __generator,\n  __createBinding,\n  __exportStar,\n  __values,\n  __read,\n  __spread,\n  __spreadArrays,\n  __spreadArray,\n  __await,\n  __asyncGenerator,\n  __asyncDelegator,\n  __asyncValues,\n  __makeTemplateObject,\n  __importStar,\n  __importDefault,\n  __classPrivateFieldGet,\n  __classPrivateFieldSet,\n  __classPrivateFieldIn,\n  __addDisposableResource,\n  __disposeResources,\n  __rewriteRelativeImportExtension,\n};\n", "/**\n * Returns true if the object is a function.\n * @param value The value to check\n */\nexport function isFunction(value: any): value is (...args: any[]) => any {\n  return typeof value === 'function';\n}\n", "/**\n * Used to create Error subclasses until the community moves away from ES5.\n *\n * This is because compiling from TypeScript down to ES5 has issues with subclassing Errors\n * as well as other built-in types: https://github.com/Microsoft/TypeScript/issues/12123\n *\n * @param createImpl A factory function to create the actual constructor implementation. The returned\n * function should be a named function that calls `_super` internally.\n */\nexport function createErrorClass<T>(createImpl: (_super: any) => any): T {\n  const _super = (instance: any) => {\n    Error.call(instance);\n    instance.stack = new Error().stack;\n  };\n\n  const ctorFunc = createImpl(_super);\n  ctorFunc.prototype = Object.create(Error.prototype);\n  ctorFunc.prototype.constructor = ctorFunc;\n  return ctorFunc;\n}\n", "import { createErrorClass } from './createErrorClass';\n\nexport interface UnsubscriptionError extends Error {\n  readonly errors: any[];\n}\n\nexport interface UnsubscriptionErrorCtor {\n  /**\n   * @deprecated Internal implementation detail. Do not construct error instances.\n   * Cannot be tagged as internal: https://github.com/ReactiveX/rxjs/issues/6269\n   */\n  new (errors: any[]): UnsubscriptionError;\n}\n\n/**\n * An error thrown when one or more errors have occurred during the\n * `unsubscribe` of a {@link Subscription}.\n */\nexport const UnsubscriptionError: UnsubscriptionErrorCtor = createErrorClass(\n  (_super) =>\n    function UnsubscriptionErrorImpl(this: any, errors: (Error | string)[]) {\n      _super(this);\n      this.message = errors\n        ? `${errors.length} errors occurred during unsubscription:\n${errors.map((err, i) => `${i + 1}) ${err.toString()}`).join('\\n  ')}`\n        : '';\n      this.name = 'UnsubscriptionError';\n      this.errors = errors;\n    }\n);\n", "/**\n * Removes an item from an array, mutating it.\n * @param arr The array to remove the item from\n * @param item The item to remove\n */\nexport function arrRemove<T>(arr: T[] | undefined | null, item: T) {\n  if (arr) {\n    const index = arr.indexOf(item);\n    0 <= index && arr.splice(index, 1);\n  }\n}\n", "import { isFunction } from './util/isFunction';\nimport { UnsubscriptionError } from './util/UnsubscriptionError';\nimport { SubscriptionLike, TeardownLogic, Unsubscribable } from './types';\nimport { arrRemove } from './util/arrRemove';\n\n/**\n * Represents a disposable resource, such as the execution of an Observable. A\n * Subscription has one important method, `unsubscribe`, that takes no argument\n * and just disposes the resource held by the subscription.\n *\n * Additionally, subscriptions may be grouped together through the `add()`\n * method, which will attach a child Subscription to the current Subscription.\n * When a Subscription is unsubscribed, all its children (and its grandchildren)\n * will be unsubscribed as well.\n *\n * @class Subscription\n */\nexport class Subscription implements SubscriptionLike {\n  /** @nocollapse */\n  public static EMPTY = (() => {\n    const empty = new Subscription();\n    empty.closed = true;\n    return empty;\n  })();\n\n  /**\n   * A flag to indicate whether this Subscription has already been unsubscribed.\n   */\n  public closed = false;\n\n  private _parentage: Subscription[] | Subscription | null = null;\n\n  /**\n   * The list of registered finalizers to execute upon unsubscription. Adding and removing from this\n   * list occurs in the {@link #add} and {@link #remove} methods.\n   */\n  private _finalizers: Exclude<TeardownLogic, void>[] | null = null;\n\n  /**\n   * @param initialTeardown A function executed first as part of the finalization\n   * process that is kicked off when {@link #unsubscribe} is called.\n   */\n  constructor(private initialTeardown?: () => void) {}\n\n  /**\n   * Disposes the resources held by the subscription. May, for instance, cancel\n   * an ongoing Observable execution or cancel any other type of work that\n   * started when the Subscription was created.\n   * @return {void}\n   */\n  unsubscribe(): void {\n    let errors: any[] | undefined;\n\n    if (!this.closed) {\n      this.closed = true;\n\n      // Remove this from it's parents.\n      const { _parentage } = this;\n      if (_parentage) {\n        this._parentage = null;\n        if (Array.isArray(_parentage)) {\n          for (const parent of _parentage) {\n            parent.remove(this);\n          }\n        } else {\n          _parentage.remove(this);\n        }\n      }\n\n      const { initialTeardown: initialFinalizer } = this;\n      if (isFunction(initialFinalizer)) {\n        try {\n          initialFinalizer();\n        } catch (e) {\n          errors = e instanceof UnsubscriptionError ? e.errors : [e];\n        }\n      }\n\n      const { _finalizers } = this;\n      if (_finalizers) {\n        this._finalizers = null;\n        for (const finalizer of _finalizers) {\n          try {\n            execFinalizer(finalizer);\n          } catch (err) {\n            errors = errors ?? [];\n            if (err instanceof UnsubscriptionError) {\n              errors = [...errors, ...err.errors];\n            } else {\n              errors.push(err);\n            }\n          }\n        }\n      }\n\n      if (errors) {\n        throw new UnsubscriptionError(errors);\n      }\n    }\n  }\n\n  /**\n   * Adds a finalizer to this subscription, so that finalization will be unsubscribed/called\n   * when this subscription is unsubscribed. If this subscription is already {@link #closed},\n   * because it has already been unsubscribed, then whatever finalizer is passed to it\n   * will automatically be executed (unless the finalizer itself is also a closed subscription).\n   *\n   * Closed Subscriptions cannot be added as finalizers to any subscription. Adding a closed\n   * subscription to a any subscription will result in no operation. (A noop).\n   *\n   * Adding a subscription to itself, or adding `null` or `undefined` will not perform any\n   * operation at all. (A noop).\n   *\n   * `Subscription` instances that are added to this instance will automatically remove themselves\n   * if they are unsubscribed. Functions and {@link Unsubscribable} objects that you wish to remove\n   * will need to be removed manually with {@link #remove}\n   *\n   * @param teardown The finalization logic to add to this subscription.\n   */\n  add(teardown: TeardownLogic): void {\n    // Only add the finalizer if it's not undefined\n    // and don't add a subscription to itself.\n    if (teardown && teardown !== this) {\n      if (this.closed) {\n        // If this subscription is already closed,\n        // execute whatever finalizer is handed to it automatically.\n        execFinalizer(teardown);\n      } else {\n        if (teardown instanceof Subscription) {\n          // We don't add closed subscriptions, and we don't add the same subscription\n          // twice. Subscription unsubscribe is idempotent.\n          if (teardown.closed || teardown._hasParent(this)) {\n            return;\n          }\n          teardown._addParent(this);\n        }\n        (this._finalizers = this._finalizers ?? []).push(teardown);\n      }\n    }\n  }\n\n  /**\n   * Checks to see if a this subscription already has a particular parent.\n   * This will signal that this subscription has already been added to the parent in question.\n   * @param parent the parent to check for\n   */\n  private _hasParent(parent: Subscription) {\n    const { _parentage } = this;\n    return _parentage === parent || (Array.isArray(_parentage) && _parentage.includes(parent));\n  }\n\n  /**\n   * Adds a parent to this subscription so it can be removed from the parent if it\n   * unsubscribes on it's own.\n   *\n   * NOTE: THIS ASSUMES THAT {@link _hasParent} HAS ALREADY BEEN CHECKED.\n   * @param parent The parent subscription to add\n   */\n  private _addParent(parent: Subscription) {\n    const { _parentage } = this;\n    this._parentage = Array.isArray(_parentage) ? (_parentage.push(parent), _parentage) : _parentage ? [_parentage, parent] : parent;\n  }\n\n  /**\n   * Called on a child when it is removed via {@link #remove}.\n   * @param parent The parent to remove\n   */\n  private _removeParent(parent: Subscription) {\n    const { _parentage } = this;\n    if (_parentage === parent) {\n      this._parentage = null;\n    } else if (Array.isArray(_parentage)) {\n      arrRemove(_parentage, parent);\n    }\n  }\n\n  /**\n   * Removes a finalizer from this subscription that was previously added with the {@link #add} method.\n   *\n   * Note that `Subscription` instances, when unsubscribed, will automatically remove themselves\n   * from every other `Subscription` they have been added to. This means that using the `remove` method\n   * is not a common thing and should be used thoughtfully.\n   *\n   * If you add the same finalizer instance of a function or an unsubscribable object to a `Subscription` instance\n   * more than once, you will need to call `remove` the same number of times to remove all instances.\n   *\n   * All finalizer instances are removed to free up memory upon unsubscription.\n   *\n   * @param teardown The finalizer to remove from this subscription\n   */\n  remove(teardown: Exclude<TeardownLogic, void>): void {\n    const { _finalizers } = this;\n    _finalizers && arrRemove(_finalizers, teardown);\n\n    if (teardown instanceof Subscription) {\n      teardown._removeParent(this);\n    }\n  }\n}\n\nexport const EMPTY_SUBSCRIPTION = Subscription.EMPTY;\n\nexport function isSubscription(value: any): value is Subscription {\n  return (\n    value instanceof Subscription ||\n    (value && 'closed' in value && isFunction(value.remove) && isFunction(value.add) && isFunction(value.unsubscribe))\n  );\n}\n\nfunction execFinalizer(finalizer: Unsubscribable | (() => void)) {\n  if (isFunction(finalizer)) {\n    finalizer();\n  } else {\n    finalizer.unsubscribe();\n  }\n}\n", "import { Subscriber } from './Subscriber';\nimport { ObservableNotification } from './types';\n\n/**\n * The {@link GlobalConfig} object for RxJS. It is used to configure things\n * like how to react on unhandled errors.\n */\nexport const config: GlobalConfig = {\n  onUnhandledError: null,\n  onStoppedNotification: null,\n  Promise: undefined,\n  useDeprecatedSynchronousErrorHandling: false,\n  useDeprecatedNextContext: false,\n};\n\n/**\n * The global configuration object for RxJS, used to configure things\n * like how to react on unhandled errors. Accessible via {@link config}\n * object.\n */\nexport interface GlobalConfig {\n  /**\n   * A registration point for unhandled errors from RxJS. These are errors that\n   * cannot were not handled by consuming code in the usual subscription path. For\n   * example, if you have this configured, and you subscribe to an observable without\n   * providing an error handler, errors from that subscription will end up here. This\n   * will _always_ be called asynchronously on another job in the runtime. This is because\n   * we do not want errors thrown in this user-configured handler to interfere with the\n   * behavior of the library.\n   */\n  onUnhandledError: ((err: any) => void) | null;\n\n  /**\n   * A registration point for notifications that cannot be sent to subscribers because they\n   * have completed, errored or have been explicitly unsubscribed. By default, next, complete\n   * and error notifications sent to stopped subscribers are noops. However, sometimes callers\n   * might want a different behavior. For example, with sources that attempt to report errors\n   * to stopped subscribers, a caller can configure RxJS to throw an unhandled error instead.\n   * This will _always_ be called asynchronously on another job in the runtime. This is because\n   * we do not want errors thrown in this user-configured handler to interfere with the\n   * behavior of the library.\n   */\n  onStoppedNotification: ((notification: ObservableNotification<any>, subscriber: Subscriber<any>) => void) | null;\n\n  /**\n   * The promise constructor used by default for {@link Observable#toPromise toPromise} and {@link Observable#forEach forEach}\n   * methods.\n   *\n   * @deprecated As of version 8, RxJS will no longer support this sort of injection of a\n   * Promise constructor. If you need a Promise implementation other than native promises,\n   * please polyfill/patch Promise as you see appropriate. Will be removed in v8.\n   */\n  Promise?: PromiseConstructorLike;\n\n  /**\n   * If true, turns on synchronous error rethrowing, which is a deprecated behavior\n   * in v6 and higher. This behavior enables bad patterns like wrapping a subscribe\n   * call in a try/catch block. It also enables producer interference, a nasty bug\n   * where a multicast can be broken for all observers by a downstream consumer with\n   * an unhandled error. DO NOT USE THIS FLAG UNLESS IT'S NEEDED TO BUY TIME\n   * FOR MIGRATION REASONS.\n   *\n   * @deprecated As of version 8, RxJS will no longer support synchronous throwing\n   * of unhandled errors. All errors will be thrown on a separate call stack to prevent bad\n   * behaviors described above. Will be removed in v8.\n   */\n  useDeprecatedSynchronousErrorHandling: boolean;\n\n  /**\n   * If true, enables an as-of-yet undocumented feature from v5: The ability to access\n   * `unsubscribe()` via `this` context in `next` functions created in observers passed\n   * to `subscribe`.\n   *\n   * This is being removed because the performance was severely problematic, and it could also cause\n   * issues when types other than POJOs are passed to subscribe as subscribers, as they will likely have\n   * their `this` context overwritten.\n   *\n   * @deprecated As of version 8, RxJS will no longer support altering the\n   * context of next functions provided as part of an observer to Subscribe. Instead,\n   * you will have access to a subscription or a signal or token that will allow you to do things like\n   * unsubscribe and test closed status. Will be removed in v8.\n   */\n  useDeprecatedNextContext: boolean;\n}\n", "import type { TimerHandle } from './timerHandle';\ntype SetTimeoutFunction = (handler: () => void, timeout?: number, ...args: any[]) => TimerHandle;\ntype ClearTimeoutFunction = (handle: TimerHandle) => void;\n\ninterface TimeoutProvider {\n  setTimeout: SetTimeoutFunction;\n  clearTimeout: ClearTimeoutFunction;\n  delegate:\n    | {\n        setTimeout: SetTimeoutFunction;\n        clearTimeout: ClearTimeoutFunction;\n      }\n    | undefined;\n}\n\nexport const timeoutProvider: TimeoutProvider = {\n  // When accessing the delegate, use the variable rather than `this` so that\n  // the functions can be called without being bound to the provider.\n  setTimeout(handler: () => void, timeout?: number, ...args) {\n    const { delegate } = timeoutProvider;\n    if (delegate?.setTimeout) {\n      return delegate.setTimeout(handler, timeout, ...args);\n    }\n    return setTimeout(handler, timeout, ...args);\n  },\n  clearTimeout(handle) {\n    const { delegate } = timeoutProvider;\n    return (delegate?.clearTimeout || clearTimeout)(handle as any);\n  },\n  delegate: undefined,\n};\n", "import { config } from '../config';\nimport { timeoutProvider } from '../scheduler/timeoutProvider';\n\n/**\n * Handles an error on another job either with the user-configured {@link onUnhandledError},\n * or by throwing it on that new job so it can be picked up by `window.onerror`, `process.on('error')`, etc.\n *\n * This should be called whenever there is an error that is out-of-band with the subscription\n * or when an error hits a terminal boundary of the subscription and no error handler was provided.\n *\n * @param err the error to report\n */\nexport function reportUnhandledError(err: any) {\n  timeoutProvider.setTimeout(() => {\n    const { onUnhandledError } = config;\n    if (onUnhandledError) {\n      // Execute the user-configured error handler.\n      onUnhandledError(err);\n    } else {\n      // Throw so it is picked up by the runtime's uncaught error mechanism.\n      throw err;\n    }\n  });\n}\n", "/* tslint:disable:no-empty */\nexport function noop() { }\n", "import { CompleteNotification, NextNotification, ErrorNotification } from './types';\n\n/**\n * A completion object optimized for memory use and created to be the\n * same \"shape\" as other notifications in v8.\n * @internal\n */\nexport const COMPLETE_NOTIFICATION = (() => createNotification('C', undefined, undefined) as CompleteNotification)();\n\n/**\n * Internal use only. Creates an optimized error notification that is the same \"shape\"\n * as other notifications.\n * @internal\n */\nexport function errorNotification(error: any): ErrorNotification {\n  return createNotification('E', undefined, error) as any;\n}\n\n/**\n * Internal use only. Creates an optimized next notification that is the same \"shape\"\n * as other notifications.\n * @internal\n */\nexport function nextNotification<T>(value: T) {\n  return createNotification('N', value, undefined) as NextNotification<T>;\n}\n\n/**\n * Ensures that all notifications created internally have the same \"shape\" in v8.\n *\n * TODO: This is only exported to support a crazy legacy test in `groupBy`.\n * @internal\n */\nexport function createNotification(kind: 'N' | 'E' | 'C', value: any, error: any) {\n  return {\n    kind,\n    value,\n    error,\n  };\n}\n", "import { config } from '../config';\n\nlet context: { errorThrown: boolean; error: any } | null = null;\n\n/**\n * Handles dealing with errors for super-gross mode. Creates a context, in which\n * any synchronously thrown errors will be passed to {@link captureError}. Which\n * will record the error such that it will be rethrown after the call back is complete.\n * TODO: Remove in v8\n * @param cb An immediately executed function.\n */\nexport function errorContext(cb: () => void) {\n  if (config.useDeprecatedSynchronousErrorHandling) {\n    const isRoot = !context;\n    if (isRoot) {\n      context = { errorThrown: false, error: null };\n    }\n    cb();\n    if (isRoot) {\n      const { errorThrown, error } = context!;\n      context = null;\n      if (errorThrown) {\n        throw error;\n      }\n    }\n  } else {\n    // This is the general non-deprecated path for everyone that\n    // isn't crazy enough to use super-gross mode (useDeprecatedSynchronousErrorHandling)\n    cb();\n  }\n}\n\n/**\n * Captures errors only in super-gross mode.\n * @param err the error to capture\n */\nexport function captureError(err: any) {\n  if (config.useDeprecatedSynchronousErrorHandling && context) {\n    context.errorThrown = true;\n    context.error = err;\n  }\n}\n", "import { isFunction } from './util/isFunction';\nimport { Observer, ObservableNotification } from './types';\nimport { isSubscription, Subscription } from './Subscription';\nimport { config } from './config';\nimport { reportUnhandledError } from './util/reportUnhandledError';\nimport { noop } from './util/noop';\nimport { nextNotification, errorNotification, COMPLETE_NOTIFICATION } from './NotificationFactories';\nimport { timeoutProvider } from './scheduler/timeoutProvider';\nimport { captureError } from './util/errorContext';\n\n/**\n * Implements the {@link Observer} interface and extends the\n * {@link Subscription} class. While the {@link Observer} is the public API for\n * consuming the values of an {@link Observable}, all Observers get converted to\n * a Subscriber, in order to provide Subscription-like capabilities such as\n * `unsubscribe`. Subscriber is a common type in RxJS, and crucial for\n * implementing operators, but it is rarely used as a public API.\n *\n * @class Subscriber<T>\n */\nexport class Subscriber<T> extends Subscription implements Observer<T> {\n  /**\n   * A static factory for a Subscriber, given a (potentially partial) definition\n   * of an Observer.\n   * @param next The `next` callback of an Observer.\n   * @param error The `error` callback of an\n   * Observer.\n   * @param complete The `complete` callback of an\n   * Observer.\n   * @return A Subscriber wrapping the (partially defined)\n   * Observer represented by the given arguments.\n   * @nocollapse\n   * @deprecated Do not use. Will be removed in v8. There is no replacement for this\n   * method, and there is no reason to be creating instances of `Subscriber` directly.\n   * If you have a specific use case, please file an issue.\n   */\n  static create<T>(next?: (x?: T) => void, error?: (e?: any) => void, complete?: () => void): Subscriber<T> {\n    return new SafeSubscriber(next, error, complete);\n  }\n\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  protected isStopped: boolean = false;\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  protected destination: Subscriber<any> | Observer<any>; // this `any` is the escape hatch to erase extra type param (e.g. R)\n\n  /**\n   * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n   * There is no reason to directly create an instance of Subscriber. This type is exported for typings reasons.\n   */\n  constructor(destination?: Subscriber<any> | Observer<any>) {\n    super();\n    if (destination) {\n      this.destination = destination;\n      // Automatically chain subscriptions together here.\n      // if destination is a Subscription, then it is a Subscriber.\n      if (isSubscription(destination)) {\n        destination.add(this);\n      }\n    } else {\n      this.destination = EMPTY_OBSERVER;\n    }\n  }\n\n  /**\n   * The {@link Observer} callback to receive notifications of type `next` from\n   * the Observable, with a value. The Observable may call this method 0 or more\n   * times.\n   * @param {T} [value] The `next` value.\n   * @return {void}\n   */\n  next(value?: T): void {\n    if (this.isStopped) {\n      handleStoppedNotification(nextNotification(value), this);\n    } else {\n      this._next(value!);\n    }\n  }\n\n  /**\n   * The {@link Observer} callback to receive notifications of type `error` from\n   * the Observable, with an attached `Error`. Notifies the Observer that\n   * the Observable has experienced an error condition.\n   * @param {any} [err] The `error` exception.\n   * @return {void}\n   */\n  error(err?: any): void {\n    if (this.isStopped) {\n      handleStoppedNotification(errorNotification(err), this);\n    } else {\n      this.isStopped = true;\n      this._error(err);\n    }\n  }\n\n  /**\n   * The {@link Observer} callback to receive a valueless notification of type\n   * `complete` from the Observable. Notifies the Observer that the Observable\n   * has finished sending push-based notifications.\n   * @return {void}\n   */\n  complete(): void {\n    if (this.isStopped) {\n      handleStoppedNotification(COMPLETE_NOTIFICATION, this);\n    } else {\n      this.isStopped = true;\n      this._complete();\n    }\n  }\n\n  unsubscribe(): void {\n    if (!this.closed) {\n      this.isStopped = true;\n      super.unsubscribe();\n      this.destination = null!;\n    }\n  }\n\n  protected _next(value: T): void {\n    this.destination.next(value);\n  }\n\n  protected _error(err: any): void {\n    try {\n      this.destination.error(err);\n    } finally {\n      this.unsubscribe();\n    }\n  }\n\n  protected _complete(): void {\n    try {\n      this.destination.complete();\n    } finally {\n      this.unsubscribe();\n    }\n  }\n}\n\n/**\n * This bind is captured here because we want to be able to have\n * compatibility with monoid libraries that tend to use a method named\n * `bind`. In particular, a library called Monio requires this.\n */\nconst _bind = Function.prototype.bind;\n\nfunction bind<Fn extends (...args: any[]) => any>(fn: Fn, thisArg: any): Fn {\n  return _bind.call(fn, thisArg);\n}\n\n/**\n * Internal optimization only, DO NOT EXPOSE.\n * @internal\n */\nclass ConsumerObserver<T> implements Observer<T> {\n  constructor(private partialObserver: Partial<Observer<T>>) {}\n\n  next(value: T): void {\n    const { partialObserver } = this;\n    if (partialObserver.next) {\n      try {\n        partialObserver.next(value);\n      } catch (error) {\n        handleUnhandledError(error);\n      }\n    }\n  }\n\n  error(err: any): void {\n    const { partialObserver } = this;\n    if (partialObserver.error) {\n      try {\n        partialObserver.error(err);\n      } catch (error) {\n        handleUnhandledError(error);\n      }\n    } else {\n      handleUnhandledError(err);\n    }\n  }\n\n  complete(): void {\n    const { partialObserver } = this;\n    if (partialObserver.complete) {\n      try {\n        partialObserver.complete();\n      } catch (error) {\n        handleUnhandledError(error);\n      }\n    }\n  }\n}\n\nexport class SafeSubscriber<T> extends Subscriber<T> {\n  constructor(\n    observerOrNext?: Partial<Observer<T>> | ((value: T) => void) | null,\n    error?: ((e?: any) => void) | null,\n    complete?: (() => void) | null\n  ) {\n    super();\n\n    let partialObserver: Partial<Observer<T>>;\n    if (isFunction(observerOrNext) || !observerOrNext) {\n      // The first argument is a function, not an observer. The next\n      // two arguments *could* be observers, or they could be empty.\n      partialObserver = {\n        next: (observerOrNext ?? undefined) as (((value: T) => void) | undefined),\n        error: error ?? undefined,\n        complete: complete ?? undefined,\n      };\n    } else {\n      // The first argument is a partial observer.\n      let context: any;\n      if (this && config.useDeprecatedNextContext) {\n        // This is a deprecated path that made `this.unsubscribe()` available in\n        // next handler functions passed to subscribe. This only exists behind a flag\n        // now, as it is *very* slow.\n        context = Object.create(observerOrNext);\n        context.unsubscribe = () => this.unsubscribe();\n        partialObserver = {\n          next: observerOrNext.next && bind(observerOrNext.next, context),\n          error: observerOrNext.error && bind(observerOrNext.error, context),\n          complete: observerOrNext.complete && bind(observerOrNext.complete, context),\n        };\n      } else {\n        // The \"normal\" path. Just use the partial observer directly.\n        partialObserver = observerOrNext;\n      }\n    }\n\n    // Wrap the partial observer to ensure it's a full observer, and\n    // make sure proper error handling is accounted for.\n    this.destination = new ConsumerObserver(partialObserver);\n  }\n}\n\nfunction handleUnhandledError(error: any) {\n  if (config.useDeprecatedSynchronousErrorHandling) {\n    captureError(error);\n  } else {\n    // Ideal path, we report this as an unhandled error,\n    // which is thrown on a new call stack.\n    reportUnhandledError(error);\n  }\n}\n\n/**\n * An error handler used when no error handler was supplied\n * to the SafeSubscriber -- meaning no error handler was supplied\n * do the `subscribe` call on our observable.\n * @param err The error to handle\n */\nfunction defaultErrorHandler(err: any) {\n  throw err;\n}\n\n/**\n * A handler for notifications that cannot be sent to a stopped subscriber.\n * @param notification The notification being sent\n * @param subscriber The stopped subscriber\n */\nfunction handleStoppedNotification(notification: ObservableNotification<any>, subscriber: Subscriber<any>) {\n  const { onStoppedNotification } = config;\n  onStoppedNotification && timeoutProvider.setTimeout(() => onStoppedNotification(notification, subscriber));\n}\n\n/**\n * The observer used as a stub for subscriptions where the user did not\n * pass any arguments to `subscribe`. Comes with the default error handling\n * behavior.\n */\nexport const EMPTY_OBSERVER: Readonly<Observer<any>> & { closed: true } = {\n  closed: true,\n  next: noop,\n  error: defaultErrorHandler,\n  complete: noop,\n};\n", "/**\n * Symbol.observable or a string \"@@observable\". Used for interop\n *\n * @deprecated We will no longer be exporting this symbol in upcoming versions of RxJS.\n * Instead polyfill and use Symbol.observable directly *or* use https://www.npmjs.com/package/symbol-observable\n */\nexport const observable: string | symbol = (() => (typeof Symbol === 'function' && Symbol.observable) || '@@observable')();\n", "/**\n * This function takes one parameter and just returns it. Simply put,\n * this is like `<T>(x: T): T => x`.\n *\n * ## Examples\n *\n * This is useful in some cases when using things like `mergeMap`\n *\n * ```ts\n * import { interval, take, map, range, mergeMap, identity } from 'rxjs';\n *\n * const source$ = interval(1000).pipe(take(5));\n *\n * const result$ = source$.pipe(\n *   map(i => range(i)),\n *   mergeMap(identity) // same as mergeMap(x => x)\n * );\n *\n * result$.subscribe({\n *   next: console.log\n * });\n * ```\n *\n * Or when you want to selectively apply an operator\n *\n * ```ts\n * import { interval, take, identity } from 'rxjs';\n *\n * const shouldLimit = () => Math.random() < 0.5;\n *\n * const source$ = interval(1000);\n *\n * const result$ = source$.pipe(shouldLimit() ? take(5) : identity);\n *\n * result$.subscribe({\n *   next: console.log\n * });\n * ```\n *\n * @param x Any value that is returned by this function\n * @returns The value passed as the first parameter to this function\n */\nexport function identity<T>(x: T): T {\n  return x;\n}\n", "import { identity } from './identity';\nimport { UnaryFunction } from '../types';\n\nexport function pipe(): typeof identity;\nexport function pipe<T, A>(fn1: UnaryFunction<T, A>): UnaryFunction<T, A>;\nexport function pipe<T, A, B>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>): UnaryFunction<T, B>;\nexport function pipe<T, A, B, C>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>, fn3: UnaryFunction<B, C>): UnaryFunction<T, C>;\nexport function pipe<T, A, B, C, D>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>\n): UnaryFunction<T, D>;\nexport function pipe<T, A, B, C, D, E>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>\n): UnaryFunction<T, E>;\nexport function pipe<T, A, B, C, D, E, F>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>,\n  fn6: UnaryFunction<E, F>\n): UnaryFunction<T, F>;\nexport function pipe<T, A, B, C, D, E, F, G>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>,\n  fn6: UnaryFunction<E, F>,\n  fn7: UnaryFunction<F, G>\n): UnaryFunction<T, G>;\nexport function pipe<T, A, B, C, D, E, F, G, H>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>,\n  fn6: UnaryFunction<E, F>,\n  fn7: UnaryFunction<F, G>,\n  fn8: UnaryFunction<G, H>\n): UnaryFunction<T, H>;\nexport function pipe<T, A, B, C, D, E, F, G, H, I>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>,\n  fn6: UnaryFunction<E, F>,\n  fn7: UnaryFunction<F, G>,\n  fn8: UnaryFunction<G, H>,\n  fn9: UnaryFunction<H, I>\n): UnaryFunction<T, I>;\nexport function pipe<T, A, B, C, D, E, F, G, H, I>(\n  fn1: UnaryFunction<T, A>,\n  fn2: UnaryFunction<A, B>,\n  fn3: UnaryFunction<B, C>,\n  fn4: UnaryFunction<C, D>,\n  fn5: UnaryFunction<D, E>,\n  fn6: UnaryFunction<E, F>,\n  fn7: UnaryFunction<F, G>,\n  fn8: UnaryFunction<G, H>,\n  fn9: UnaryFunction<H, I>,\n  ...fns: UnaryFunction<any, any>[]\n): UnaryFunction<T, unknown>;\n\n/**\n * pipe() can be called on one or more functions, each of which can take one argument (\"UnaryFunction\")\n * and uses it to return a value.\n * It returns a function that takes one argument, passes it to the first UnaryFunction, and then\n * passes the result to the next one, passes that result to the next one, and so on.  \n */\nexport function pipe(...fns: Array<UnaryFunction<any, any>>): UnaryFunction<any, any> {\n  return pipeFromArray(fns);\n}\n\n/** @internal */\nexport function pipeFromArray<T, R>(fns: Array<UnaryFunction<T, R>>): UnaryFunction<T, R> {\n  if (fns.length === 0) {\n    return identity as UnaryFunction<any, any>;\n  }\n\n  if (fns.length === 1) {\n    return fns[0];\n  }\n\n  return function piped(input: T): R {\n    return fns.reduce((prev: any, fn: UnaryFunction<T, R>) => fn(prev), input as any);\n  };\n}\n", "import { Operator } from './Operator';\nimport { SafeSubscriber, Subscriber } from './Subscriber';\nimport { isSubscription, Subscription } from './Subscription';\nimport { TeardownLogic, OperatorFunction, Subscribable, Observer } from './types';\nimport { observable as Symbol_observable } from './symbol/observable';\nimport { pipeFromArray } from './util/pipe';\nimport { config } from './config';\nimport { isFunction } from './util/isFunction';\nimport { errorContext } from './util/errorContext';\n\n/**\n * A representation of any set of values over any amount of time. This is the most basic building block\n * of RxJS.\n *\n * @class Observable<T>\n */\nexport class Observable<T> implements Subscribable<T> {\n  /**\n   * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n   */\n  source: Observable<any> | undefined;\n\n  /**\n   * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n   */\n  operator: Operator<any, T> | undefined;\n\n  /**\n   * @constructor\n   * @param {Function} subscribe the function that is called when the Observable is\n   * initially subscribed to. This function is given a Subscriber, to which new values\n   * can be `next`ed, or an `error` method can be called to raise an error, or\n   * `complete` can be called to notify of a successful completion.\n   */\n  constructor(subscribe?: (this: Observable<T>, subscriber: Subscriber<T>) => TeardownLogic) {\n    if (subscribe) {\n      this._subscribe = subscribe;\n    }\n  }\n\n  // HACK: Since TypeScript inherits static properties too, we have to\n  // fight against TypeScript here so Subject can have a different static create signature\n  /**\n   * Creates a new Observable by calling the Observable constructor\n   * @owner Observable\n   * @method create\n   * @param {Function} subscribe? the subscriber function to be passed to the Observable constructor\n   * @return {Observable} a new observable\n   * @nocollapse\n   * @deprecated Use `new Observable()` instead. Will be removed in v8.\n   */\n  static create: (...args: any[]) => any = <T>(subscribe?: (subscriber: Subscriber<T>) => TeardownLogic) => {\n    return new Observable<T>(subscribe);\n  };\n\n  /**\n   * Creates a new Observable, with this Observable instance as the source, and the passed\n   * operator defined as the new observable's operator.\n   * @method lift\n   * @param operator the operator defining the operation to take on the observable\n   * @return a new observable with the Operator applied\n   * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n   * If you have implemented an operator using `lift`, it is recommended that you create an\n   * operator by simply returning `new Observable()` directly. See \"Creating new operators from\n   * scratch\" section here: https://rxjs.dev/guide/operators\n   */\n  lift<R>(operator?: Operator<T, R>): Observable<R> {\n    const observable = new Observable<R>();\n    observable.source = this;\n    observable.operator = operator;\n    return observable;\n  }\n\n  subscribe(observerOrNext?: Partial<Observer<T>> | ((value: T) => void)): Subscription;\n  /** @deprecated Instead of passing separate callback arguments, use an observer argument. Signatures taking separate callback arguments will be removed in v8. Details: https://rxjs.dev/deprecations/subscribe-arguments */\n  subscribe(next?: ((value: T) => void) | null, error?: ((error: any) => void) | null, complete?: (() => void) | null): Subscription;\n  /**\n   * Invokes an execution of an Observable and registers Observer handlers for notifications it will emit.\n   *\n   * <span class=\"informal\">Use it when you have all these Observables, but still nothing is happening.</span>\n   *\n   * `subscribe` is not a regular operator, but a method that calls Observable's internal `subscribe` function. It\n   * might be for example a function that you passed to Observable's constructor, but most of the time it is\n   * a library implementation, which defines what will be emitted by an Observable, and when it be will emitted. This means\n   * that calling `subscribe` is actually the moment when Observable starts its work, not when it is created, as it is often\n   * the thought.\n   *\n   * Apart from starting the execution of an Observable, this method allows you to listen for values\n   * that an Observable emits, as well as for when it completes or errors. You can achieve this in two\n   * of the following ways.\n   *\n   * The first way is creating an object that implements {@link Observer} interface. It should have methods\n   * defined by that interface, but note that it should be just a regular JavaScript object, which you can create\n   * yourself in any way you want (ES6 class, classic function constructor, object literal etc.). In particular, do\n   * not attempt to use any RxJS implementation details to create Observers - you don't need them. Remember also\n   * that your object does not have to implement all methods. If you find yourself creating a method that doesn't\n   * do anything, you can simply omit it. Note however, if the `error` method is not provided and an error happens,\n   * it will be thrown asynchronously. Errors thrown asynchronously cannot be caught using `try`/`catch`. Instead,\n   * use the {@link onUnhandledError} configuration option or use a runtime handler (like `window.onerror` or\n   * `process.on('error)`) to be notified of unhandled errors. Because of this, it's recommended that you provide\n   * an `error` method to avoid missing thrown errors.\n   *\n   * The second way is to give up on Observer object altogether and simply provide callback functions in place of its methods.\n   * This means you can provide three functions as arguments to `subscribe`, where the first function is equivalent\n   * of a `next` method, the second of an `error` method and the third of a `complete` method. Just as in case of an Observer,\n   * if you do not need to listen for something, you can omit a function by passing `undefined` or `null`,\n   * since `subscribe` recognizes these functions by where they were placed in function call. When it comes\n   * to the `error` function, as with an Observer, if not provided, errors emitted by an Observable will be thrown asynchronously.\n   *\n   * You can, however, subscribe with no parameters at all. This may be the case where you're not interested in terminal events\n   * and you also handled emissions internally by using operators (e.g. using `tap`).\n   *\n   * Whichever style of calling `subscribe` you use, in both cases it returns a Subscription object.\n   * This object allows you to call `unsubscribe` on it, which in turn will stop the work that an Observable does and will clean\n   * up all resources that an Observable used. Note that cancelling a subscription will not call `complete` callback\n   * provided to `subscribe` function, which is reserved for a regular completion signal that comes from an Observable.\n   *\n   * Remember that callbacks provided to `subscribe` are not guaranteed to be called asynchronously.\n   * It is an Observable itself that decides when these functions will be called. For example {@link of}\n   * by default emits all its values synchronously. Always check documentation for how given Observable\n   * will behave when subscribed and if its default behavior can be modified with a `scheduler`.\n   *\n   * #### Examples\n   *\n   * Subscribe with an {@link guide/observer Observer}\n   *\n   * ```ts\n   * import { of } from 'rxjs';\n   *\n   * const sumObserver = {\n   *   sum: 0,\n   *   next(value) {\n   *     console.log('Adding: ' + value);\n   *     this.sum = this.sum + value;\n   *   },\n   *   error() {\n   *     // We actually could just remove this method,\n   *     // since we do not really care about errors right now.\n   *   },\n   *   complete() {\n   *     console.log('Sum equals: ' + this.sum);\n   *   }\n   * };\n   *\n   * of(1, 2, 3) // Synchronously emits 1, 2, 3 and then completes.\n   *   .subscribe(sumObserver);\n   *\n   * // Logs:\n   * // 'Adding: 1'\n   * // 'Adding: 2'\n   * // 'Adding: 3'\n   * // 'Sum equals: 6'\n   * ```\n   *\n   * Subscribe with functions ({@link deprecations/subscribe-arguments deprecated})\n   *\n   * ```ts\n   * import { of } from 'rxjs'\n   *\n   * let sum = 0;\n   *\n   * of(1, 2, 3).subscribe(\n   *   value => {\n   *     console.log('Adding: ' + value);\n   *     sum = sum + value;\n   *   },\n   *   undefined,\n   *   () => console.log('Sum equals: ' + sum)\n   * );\n   *\n   * // Logs:\n   * // 'Adding: 1'\n   * // 'Adding: 2'\n   * // 'Adding: 3'\n   * // 'Sum equals: 6'\n   * ```\n   *\n   * Cancel a subscription\n   *\n   * ```ts\n   * import { interval } from 'rxjs';\n   *\n   * const subscription = interval(1000).subscribe({\n   *   next(num) {\n   *     console.log(num)\n   *   },\n   *   complete() {\n   *     // Will not be called, even when cancelling subscription.\n   *     console.log('completed!');\n   *   }\n   * });\n   *\n   * setTimeout(() => {\n   *   subscription.unsubscribe();\n   *   console.log('unsubscribed!');\n   * }, 2500);\n   *\n   * // Logs:\n   * // 0 after 1s\n   * // 1 after 2s\n   * // 'unsubscribed!' after 2.5s\n   * ```\n   *\n   * @param {Observer|Function} observerOrNext (optional) Either an observer with methods to be called,\n   * or the first of three possible handlers, which is the handler for each value emitted from the subscribed\n   * Observable.\n   * @param {Function} error (optional) A handler for a terminal event resulting from an error. If no error handler is provided,\n   * the error will be thrown asynchronously as unhandled.\n   * @param {Function} complete (optional) A handler for a terminal event resulting from successful completion.\n   * @return {Subscription} a subscription reference to the registered handlers\n   * @method subscribe\n   */\n  subscribe(\n    observerOrNext?: Partial<Observer<T>> | ((value: T) => void) | null,\n    error?: ((error: any) => void) | null,\n    complete?: (() => void) | null\n  ): Subscription {\n    const subscriber = isSubscriber(observerOrNext) ? observerOrNext : new SafeSubscriber(observerOrNext, error, complete);\n\n    errorContext(() => {\n      const { operator, source } = this;\n      subscriber.add(\n        operator\n          ? // We're dealing with a subscription in the\n            // operator chain to one of our lifted operators.\n            operator.call(subscriber, source)\n          : source\n          ? // If `source` has a value, but `operator` does not, something that\n            // had intimate knowledge of our API, like our `Subject`, must have\n            // set it. We're going to just call `_subscribe` directly.\n            this._subscribe(subscriber)\n          : // In all other cases, we're likely wrapping a user-provided initializer\n            // function, so we need to catch errors and handle them appropriately.\n            this._trySubscribe(subscriber)\n      );\n    });\n\n    return subscriber;\n  }\n\n  /** @internal */\n  protected _trySubscribe(sink: Subscriber<T>): TeardownLogic {\n    try {\n      return this._subscribe(sink);\n    } catch (err) {\n      // We don't need to return anything in this case,\n      // because it's just going to try to `add()` to a subscription\n      // above.\n      sink.error(err);\n    }\n  }\n\n  /**\n   * Used as a NON-CANCELLABLE means of subscribing to an observable, for use with\n   * APIs that expect promises, like `async/await`. You cannot unsubscribe from this.\n   *\n   * **WARNING**: Only use this with observables you *know* will complete. If the source\n   * observable does not complete, you will end up with a promise that is hung up, and\n   * potentially all of the state of an async function hanging out in memory. To avoid\n   * this situation, look into adding something like {@link timeout}, {@link take},\n   * {@link takeWhile}, or {@link takeUntil} amongst others.\n   *\n   * #### Example\n   *\n   * ```ts\n   * import { interval, take } from 'rxjs';\n   *\n   * const source$ = interval(1000).pipe(take(4));\n   *\n   * async function getTotal() {\n   *   let total = 0;\n   *\n   *   await source$.forEach(value => {\n   *     total += value;\n   *     console.log('observable -> ' + value);\n   *   });\n   *\n   *   return total;\n   * }\n   *\n   * getTotal().then(\n   *   total => console.log('Total: ' + total)\n   * );\n   *\n   * // Expected:\n   * // 'observable -> 0'\n   * // 'observable -> 1'\n   * // 'observable -> 2'\n   * // 'observable -> 3'\n   * // 'Total: 6'\n   * ```\n   *\n   * @param next a handler for each value emitted by the observable\n   * @return a promise that either resolves on observable completion or\n   *  rejects with the handled error\n   */\n  forEach(next: (value: T) => void): Promise<void>;\n\n  /**\n   * @param next a handler for each value emitted by the observable\n   * @param promiseCtor a constructor function used to instantiate the Promise\n   * @return a promise that either resolves on observable completion or\n   *  rejects with the handled error\n   * @deprecated Passing a Promise constructor will no longer be available\n   * in upcoming versions of RxJS. This is because it adds weight to the library, for very\n   * little benefit. If you need this functionality, it is recommended that you either\n   * polyfill Promise, or you create an adapter to convert the returned native promise\n   * to whatever promise implementation you wanted. Will be removed in v8.\n   */\n  forEach(next: (value: T) => void, promiseCtor: PromiseConstructorLike): Promise<void>;\n\n  forEach(next: (value: T) => void, promiseCtor?: PromiseConstructorLike): Promise<void> {\n    promiseCtor = getPromiseCtor(promiseCtor);\n\n    return new promiseCtor<void>((resolve, reject) => {\n      const subscriber = new SafeSubscriber<T>({\n        next: (value) => {\n          try {\n            next(value);\n          } catch (err) {\n            reject(err);\n            subscriber.unsubscribe();\n          }\n        },\n        error: reject,\n        complete: resolve,\n      });\n      this.subscribe(subscriber);\n    }) as Promise<void>;\n  }\n\n  /** @internal */\n  protected _subscribe(subscriber: Subscriber<any>): TeardownLogic {\n    return this.source?.subscribe(subscriber);\n  }\n\n  /**\n   * An interop point defined by the es7-observable spec https://github.com/zenparsing/es-observable\n   * @method Symbol.observable\n   * @return {Observable} this instance of the observable\n   */\n  [Symbol_observable]() {\n    return this;\n  }\n\n  /* tslint:disable:max-line-length */\n  pipe(): Observable<T>;\n  pipe<A>(op1: OperatorFunction<T, A>): Observable<A>;\n  pipe<A, B>(op1: OperatorFunction<T, A>, op2: OperatorFunction<A, B>): Observable<B>;\n  pipe<A, B, C>(op1: OperatorFunction<T, A>, op2: OperatorFunction<A, B>, op3: OperatorFunction<B, C>): Observable<C>;\n  pipe<A, B, C, D>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>\n  ): Observable<D>;\n  pipe<A, B, C, D, E>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>\n  ): Observable<E>;\n  pipe<A, B, C, D, E, F>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>\n  ): Observable<F>;\n  pipe<A, B, C, D, E, F, G>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>\n  ): Observable<G>;\n  pipe<A, B, C, D, E, F, G, H>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>,\n    op8: OperatorFunction<G, H>\n  ): Observable<H>;\n  pipe<A, B, C, D, E, F, G, H, I>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>,\n    op8: OperatorFunction<G, H>,\n    op9: OperatorFunction<H, I>\n  ): Observable<I>;\n  pipe<A, B, C, D, E, F, G, H, I>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>,\n    op8: OperatorFunction<G, H>,\n    op9: OperatorFunction<H, I>,\n    ...operations: OperatorFunction<any, any>[]\n  ): Observable<unknown>;\n  /* tslint:enable:max-line-length */\n\n  /**\n   * Used to stitch together functional operators into a chain.\n   * @method pipe\n   * @return {Observable} the Observable result of all of the operators having\n   * been called in the order they were passed in.\n   *\n   * ## Example\n   *\n   * ```ts\n   * import { interval, filter, map, scan } from 'rxjs';\n   *\n   * interval(1000)\n   *   .pipe(\n   *     filter(x => x % 2 === 0),\n   *     map(x => x + x),\n   *     scan((acc, x) => acc + x)\n   *   )\n   *   .subscribe(x => console.log(x));\n   * ```\n   */\n  pipe(...operations: OperatorFunction<any, any>[]): Observable<any> {\n    return pipeFromArray(operations)(this);\n  }\n\n  /* tslint:disable:max-line-length */\n  /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n  toPromise(): Promise<T | undefined>;\n  /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n  toPromise(PromiseCtor: typeof Promise): Promise<T | undefined>;\n  /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n  toPromise(PromiseCtor: PromiseConstructorLike): Promise<T | undefined>;\n  /* tslint:enable:max-line-length */\n\n  /**\n   * Subscribe to this Observable and get a Promise resolving on\n   * `complete` with the last emission (if any).\n   *\n   * **WARNING**: Only use this with observables you *know* will complete. If the source\n   * observable does not complete, you will end up with a promise that is hung up, and\n   * potentially all of the state of an async function hanging out in memory. To avoid\n   * this situation, look into adding something like {@link timeout}, {@link take},\n   * {@link takeWhile}, or {@link takeUntil} amongst others.\n   *\n   * @method toPromise\n   * @param [promiseCtor] a constructor function used to instantiate\n   * the Promise\n   * @return A Promise that resolves with the last value emit, or\n   * rejects on an error. If there were no emissions, Promise\n   * resolves with undefined.\n   * @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise\n   */\n  toPromise(promiseCtor?: PromiseConstructorLike): Promise<T | undefined> {\n    promiseCtor = getPromiseCtor(promiseCtor);\n\n    return new promiseCtor((resolve, reject) => {\n      let value: T | undefined;\n      this.subscribe(\n        (x: T) => (value = x),\n        (err: any) => reject(err),\n        () => resolve(value)\n      );\n    }) as Promise<T | undefined>;\n  }\n}\n\n/**\n * Decides between a passed promise constructor from consuming code,\n * A default configured promise constructor, and the native promise\n * constructor and returns it. If nothing can be found, it will throw\n * an error.\n * @param promiseCtor The optional promise constructor to passed by consuming code\n */\nfunction getPromiseCtor(promiseCtor: PromiseConstructorLike | undefined) {\n  return promiseCtor ?? config.Promise ?? Promise;\n}\n\nfunction isObserver<T>(value: any): value is Observer<T> {\n  return value && isFunction(value.next) && isFunction(value.error) && isFunction(value.complete);\n}\n\nfunction isSubscriber<T>(value: any): value is Subscriber<T> {\n  return (value && value instanceof Subscriber) || (isObserver(value) && isSubscription(value));\n}\n", "import { Observable } from '../Observable';\nimport { Subscriber } from '../Subscriber';\nimport { OperatorFunction } from '../types';\nimport { isFunction } from './isFunction';\n\n/**\n * Used to determine if an object is an Observable with a lift function.\n */\nexport function hasLift(source: any): source is { lift: InstanceType<typeof Observable>['lift'] } {\n  return isFunction(source?.lift);\n}\n\n/**\n * Creates an `OperatorFunction`. Used to define operators throughout the library in a concise way.\n * @param init The logic to connect the liftedSource to the subscriber at the moment of subscription.\n */\nexport function operate<T, R>(\n  init: (liftedSource: Observable<T>, subscriber: Subscriber<R>) => (() => void) | void\n): OperatorFunction<T, R> {\n  return (source: Observable<T>) => {\n    if (hasLift(source)) {\n      return source.lift(function (this: Subscriber<R>, liftedSource: Observable<T>) {\n        try {\n          return init(liftedSource, this);\n        } catch (err) {\n          this.error(err);\n        }\n      });\n    }\n    throw new TypeError('Unable to lift unknown Observable type');\n  };\n}\n", "import { Subscriber } from '../Subscriber';\n\n/**\n * Creates an instance of an `OperatorSubscriber`.\n * @param destination The downstream subscriber.\n * @param onNext Handles next values, only called if this subscriber is not stopped or closed. Any\n * error that occurs in this function is caught and sent to the `error` method of this subscriber.\n * @param onError Handles errors from the subscription, any errors that occur in this handler are caught\n * and send to the `destination` error handler.\n * @param onComplete Handles completion notification from the subscription. Any errors that occur in\n * this handler are sent to the `destination` error handler.\n * @param onFinalize Additional teardown logic here. This will only be called on teardown if the\n * subscriber itself is not already closed. This is called after all other teardown logic is executed.\n */\nexport function createOperatorSubscriber<T>(\n  destination: Subscriber<any>,\n  onNext?: (value: T) => void,\n  onComplete?: () => void,\n  onError?: (err: any) => void,\n  onFinalize?: () => void\n): Subscriber<T> {\n  return new OperatorSubscriber(destination, onNext, onComplete, onError, onFinalize);\n}\n\n/**\n * A generic helper for allowing operators to be created with a Subscriber and\n * use closures to capture necessary state from the operator function itself.\n */\nexport class OperatorSubscriber<T> extends Subscriber<T> {\n  /**\n   * Creates an instance of an `OperatorSubscriber`.\n   * @param destination The downstream subscriber.\n   * @param onNext Handles next values, only called if this subscriber is not stopped or closed. Any\n   * error that occurs in this function is caught and sent to the `error` method of this subscriber.\n   * @param onError Handles errors from the subscription, any errors that occur in this handler are caught\n   * and send to the `destination` error handler.\n   * @param onComplete Handles completion notification from the subscription. Any errors that occur in\n   * this handler are sent to the `destination` error handler.\n   * @param onFinalize Additional finalization logic here. This will only be called on finalization if the\n   * subscriber itself is not already closed. This is called after all other finalization logic is executed.\n   * @param shouldUnsubscribe An optional check to see if an unsubscribe call should truly unsubscribe.\n   * NOTE: This currently **ONLY** exists to support the strange behavior of {@link groupBy}, where unsubscription\n   * to the resulting observable does not actually disconnect from the source if there are active subscriptions\n   * to any grouped observable. (DO NOT EXPOSE OR USE EXTERNALLY!!!)\n   */\n  constructor(\n    destination: Subscriber<any>,\n    onNext?: (value: T) => void,\n    onComplete?: () => void,\n    onError?: (err: any) => void,\n    private onFinalize?: () => void,\n    private shouldUnsubscribe?: () => boolean\n  ) {\n    // It's important - for performance reasons - that all of this class's\n    // members are initialized and that they are always initialized in the same\n    // order. This will ensure that all OperatorSubscriber instances have the\n    // same hidden class in V8. This, in turn, will help keep the number of\n    // hidden classes involved in property accesses within the base class as\n    // low as possible. If the number of hidden classes involved exceeds four,\n    // the property accesses will become megamorphic and performance penalties\n    // will be incurred - i.e. inline caches won't be used.\n    //\n    // The reasons for ensuring all instances have the same hidden class are\n    // further discussed in this blog post from Benedikt Meurer:\n    // https://benediktmeurer.de/2018/03/23/impact-of-polymorphism-on-component-based-frameworks-like-react/\n    super(destination);\n    this._next = onNext\n      ? function (this: OperatorSubscriber<T>, value: T) {\n          try {\n            onNext(value);\n          } catch (err) {\n            destination.error(err);\n          }\n        }\n      : super._next;\n    this._error = onError\n      ? function (this: OperatorSubscriber<T>, err: any) {\n          try {\n            onError(err);\n          } catch (err) {\n            // Send any errors that occur down stream.\n            destination.error(err);\n          } finally {\n            // Ensure finalization.\n            this.unsubscribe();\n          }\n        }\n      : super._error;\n    this._complete = onComplete\n      ? function (this: OperatorSubscriber<T>) {\n          try {\n            onComplete();\n          } catch (err) {\n            // Send any errors that occur down stream.\n            destination.error(err);\n          } finally {\n            // Ensure finalization.\n            this.unsubscribe();\n          }\n        }\n      : super._complete;\n  }\n\n  unsubscribe() {\n    if (!this.shouldUnsubscribe || this.shouldUnsubscribe()) {\n      const { closed } = this;\n      super.unsubscribe();\n      // Execute additional teardown if we have any and we didn't already do so.\n      !closed && this.onFinalize?.();\n    }\n  }\n}\n", "import { createErrorClass } from './createErrorClass';\n\nexport interface ObjectUnsubscribedError extends Error {}\n\nexport interface ObjectUnsubscribedErrorCtor {\n  /**\n   * @deprecated Internal implementation detail. Do not construct error instances.\n   * Cannot be tagged as internal: https://github.com/ReactiveX/rxjs/issues/6269\n   */\n  new (): ObjectUnsubscribedError;\n}\n\n/**\n * An error thrown when an action is invalid because the object has been\n * unsubscribed.\n *\n * @see {@link Subject}\n * @see {@link BehaviorSubject}\n *\n * @class ObjectUnsubscribedError\n */\nexport const ObjectUnsubscribedError: ObjectUnsubscribedErrorCtor = createErrorClass(\n  (_super) =>\n    function ObjectUnsubscribedErrorImpl(this: any) {\n      _super(this);\n      this.name = 'ObjectUnsubscribedError';\n      this.message = 'object unsubscribed';\n    }\n);\n", "import { Operator } from './Operator';\nimport { Observable } from './Observable';\nimport { Subscriber } from './Subscriber';\nimport { Subscription, EMPTY_SUBSCRIPTION } from './Subscription';\nimport { Observer, SubscriptionLike, TeardownLogic } from './types';\nimport { ObjectUnsubscribedError } from './util/ObjectUnsubscribedError';\nimport { arrRemove } from './util/arrRemove';\nimport { errorContext } from './util/errorContext';\n\n/**\n * A Subject is a special type of Observable that allows values to be\n * multicasted to many Observers. Subjects are like EventEmitters.\n *\n * Every Subject is an Observable and an Observer. You can subscribe to a\n * Subject, and you can call next to feed values as well as error and complete.\n */\nexport class Subject<T> extends Observable<T> implements SubscriptionLike {\n  closed = false;\n\n  private currentObservers: Observer<T>[] | null = null;\n\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  observers: Observer<T>[] = [];\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  isStopped = false;\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  hasError = false;\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  thrownError: any = null;\n\n  /**\n   * Creates a \"subject\" by basically gluing an observer to an observable.\n   *\n   * @nocollapse\n   * @deprecated Recommended you do not use. Will be removed at some point in the future. Plans for replacement still under discussion.\n   */\n  static create: (...args: any[]) => any = <T>(destination: Observer<T>, source: Observable<T>): AnonymousSubject<T> => {\n    return new AnonymousSubject<T>(destination, source);\n  };\n\n  constructor() {\n    // NOTE: This must be here to obscure Observable's constructor.\n    super();\n  }\n\n  /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n  lift<R>(operator: Operator<T, R>): Observable<R> {\n    const subject = new AnonymousSubject(this, this);\n    subject.operator = operator as any;\n    return subject as any;\n  }\n\n  /** @internal */\n  protected _throwIfClosed() {\n    if (this.closed) {\n      throw new ObjectUnsubscribedError();\n    }\n  }\n\n  next(value: T) {\n    errorContext(() => {\n      this._throwIfClosed();\n      if (!this.isStopped) {\n        if (!this.currentObservers) {\n          this.currentObservers = Array.from(this.observers);\n        }\n        for (const observer of this.currentObservers) {\n          observer.next(value);\n        }\n      }\n    });\n  }\n\n  error(err: any) {\n    errorContext(() => {\n      this._throwIfClosed();\n      if (!this.isStopped) {\n        this.hasError = this.isStopped = true;\n        this.thrownError = err;\n        const { observers } = this;\n        while (observers.length) {\n          observers.shift()!.error(err);\n        }\n      }\n    });\n  }\n\n  complete() {\n    errorContext(() => {\n      this._throwIfClosed();\n      if (!this.isStopped) {\n        this.isStopped = true;\n        const { observers } = this;\n        while (observers.length) {\n          observers.shift()!.complete();\n        }\n      }\n    });\n  }\n\n  unsubscribe() {\n    this.isStopped = this.closed = true;\n    this.observers = this.currentObservers = null!;\n  }\n\n  get observed() {\n    return this.observers?.length > 0;\n  }\n\n  /** @internal */\n  protected _trySubscribe(subscriber: Subscriber<T>): TeardownLogic {\n    this._throwIfClosed();\n    return super._trySubscribe(subscriber);\n  }\n\n  /** @internal */\n  protected _subscribe(subscriber: Subscriber<T>): Subscription {\n    this._throwIfClosed();\n    this._checkFinalizedStatuses(subscriber);\n    return this._innerSubscribe(subscriber);\n  }\n\n  /** @internal */\n  protected _innerSubscribe(subscriber: Subscriber<any>) {\n    const { hasError, isStopped, observers } = this;\n    if (hasError || isStopped) {\n      return EMPTY_SUBSCRIPTION;\n    }\n    this.currentObservers = null;\n    observers.push(subscriber);\n    return new Subscription(() => {\n      this.currentObservers = null;\n      arrRemove(observers, subscriber);\n    });\n  }\n\n  /** @internal */\n  protected _checkFinalizedStatuses(subscriber: Subscriber<any>) {\n    const { hasError, thrownError, isStopped } = this;\n    if (hasError) {\n      subscriber.error(thrownError);\n    } else if (isStopped) {\n      subscriber.complete();\n    }\n  }\n\n  /**\n   * Creates a new Observable with this Subject as the source. You can do this\n   * to create custom Observer-side logic of the Subject and conceal it from\n   * code that uses the Observable.\n   * @return {Observable} Observable that the Subject casts to\n   */\n  asObservable(): Observable<T> {\n    const observable: any = new Observable<T>();\n    observable.source = this;\n    return observable;\n  }\n}\n\n/**\n * @class AnonymousSubject<T>\n */\nexport class AnonymousSubject<T> extends Subject<T> {\n  constructor(\n    /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n    public destination?: Observer<T>,\n    source?: Observable<T>\n  ) {\n    super();\n    this.source = source;\n  }\n\n  next(value: T) {\n    this.destination?.next?.(value);\n  }\n\n  error(err: any) {\n    this.destination?.error?.(err);\n  }\n\n  complete() {\n    this.destination?.complete?.();\n  }\n\n  /** @internal */\n  protected _subscribe(subscriber: Subscriber<T>): Subscription {\n    return this.source?.subscribe(subscriber) ?? EMPTY_SUBSCRIPTION;\n  }\n}\n", "import { TimestampProvider } from '../types';\n\ninterface DateTimestampProvider extends TimestampProvider {\n  delegate: TimestampProvider | undefined;\n}\n\nexport const dateTimestampProvider: DateTimestampProvider = {\n  now() {\n    // Use the variable rather than `this` so that the function can be called\n    // without being bound to the provider.\n    return (dateTimestampProvider.delegate || Date).now();\n  },\n  delegate: undefined,\n};\n", "import { Subject } from './Subject';\nimport { TimestampProvider } from './types';\nimport { Subscriber } from './Subscriber';\nimport { Subscription } from './Subscription';\nimport { dateTimestampProvider } from './scheduler/dateTimestampProvider';\n\n/**\n * A variant of {@link Subject} that \"replays\" old values to new subscribers by emitting them when they first subscribe.\n *\n * `ReplaySubject` has an internal buffer that will store a specified number of values that it has observed. Like `Subject`,\n * `ReplaySubject` \"observes\" values by having them passed to its `next` method. When it observes a value, it will store that\n * value for a time determined by the configuration of the `ReplaySubject`, as passed to its constructor.\n *\n * When a new subscriber subscribes to the `ReplaySubject` instance, it will synchronously emit all values in its buffer in\n * a First-In-First-Out (FIFO) manner. The `ReplaySubject` will also complete, if it has observed completion; and it will\n * error if it has observed an error.\n *\n * There are two main configuration items to be concerned with:\n *\n * 1. `bufferSize` - This will determine how many items are stored in the buffer, defaults to infinite.\n * 2. `windowTime` - The amount of time to hold a value in the buffer before removing it from the buffer.\n *\n * Both configurations may exist simultaneously. So if you would like to buffer a maximum of 3 values, as long as the values\n * are less than 2 seconds old, you could do so with a `new ReplaySubject(3, 2000)`.\n *\n * ### Differences with BehaviorSubject\n *\n * `BehaviorSubject` is similar to `new ReplaySubject(1)`, with a couple of exceptions:\n *\n * 1. `BehaviorSubject` comes \"primed\" with a single value upon construction.\n * 2. `ReplaySubject` will replay values, even after observing an error, where `BehaviorSubject` will not.\n *\n * @see {@link Subject}\n * @see {@link BehaviorSubject}\n * @see {@link shareReplay}\n */\nexport class ReplaySubject<T> extends Subject<T> {\n  private _buffer: (T | number)[] = [];\n  private _infiniteTimeWindow = true;\n\n  /**\n   * @param bufferSize The size of the buffer to replay on subscription\n   * @param windowTime The amount of time the buffered items will stay buffered\n   * @param timestampProvider An object with a `now()` method that provides the current timestamp. This is used to\n   * calculate the amount of time something has been buffered.\n   */\n  constructor(\n    private _bufferSize = Infinity,\n    private _windowTime = Infinity,\n    private _timestampProvider: TimestampProvider = dateTimestampProvider\n  ) {\n    super();\n    this._infiniteTimeWindow = _windowTime === Infinity;\n    this._bufferSize = Math.max(1, _bufferSize);\n    this._windowTime = Math.max(1, _windowTime);\n  }\n\n  next(value: T): void {\n    const { isStopped, _buffer, _infiniteTimeWindow, _timestampProvider, _windowTime } = this;\n    if (!isStopped) {\n      _buffer.push(value);\n      !_infiniteTimeWindow && _buffer.push(_timestampProvider.now() + _windowTime);\n    }\n    this._trimBuffer();\n    super.next(value);\n  }\n\n  /** @internal */\n  protected _subscribe(subscriber: Subscriber<T>): Subscription {\n    this._throwIfClosed();\n    this._trimBuffer();\n\n    const subscription = this._innerSubscribe(subscriber);\n\n    const { _infiniteTimeWindow, _buffer } = this;\n    // We use a copy here, so reentrant code does not mutate our array while we're\n    // emitting it to a new subscriber.\n    const copy = _buffer.slice();\n    for (let i = 0; i < copy.length && !subscriber.closed; i += _infiniteTimeWindow ? 1 : 2) {\n      subscriber.next(copy[i] as T);\n    }\n\n    this._checkFinalizedStatuses(subscriber);\n\n    return subscription;\n  }\n\n  private _trimBuffer() {\n    const { _bufferSize, _timestampProvider, _buffer, _infiniteTimeWindow } = this;\n    // If we don't have an infinite buffer size, and we're over the length,\n    // use splice to truncate the old buffer values off. Note that we have to\n    // double the size for instances where we're not using an infinite time window\n    // because we're storing the values and the timestamps in the same array.\n    const adjustedBufferSize = (_infiniteTimeWindow ? 1 : 2) * _bufferSize;\n    _bufferSize < Infinity && adjustedBufferSize < _buffer.length && _buffer.splice(0, _buffer.length - adjustedBufferSize);\n\n    // Now, if we're not in an infinite time window, remove all values where the time is\n    // older than what is allowed.\n    if (!_infiniteTimeWindow) {\n      const now = _timestampProvider.now();\n      let last = 0;\n      // Search the array for the first timestamp that isn't expired and\n      // truncate the buffer up to that point.\n      for (let i = 1; i < _buffer.length && (_buffer[i] as number) <= now; i += 2) {\n        last = i;\n      }\n      last && _buffer.splice(0, last + 1);\n    }\n  }\n}\n", "import { Observable } from '../Observable';\nimport { SchedulerLike } from '../types';\n\n/**\n * A simple Observable that emits no items to the Observer and immediately\n * emits a complete notification.\n *\n * <span class=\"informal\">Just emits 'complete', and nothing else.</span>\n *\n * ![](empty.png)\n *\n * A simple Observable that only emits the complete notification. It can be used\n * for composing with other Observables, such as in a {@link mergeMap}.\n *\n * ## Examples\n *\n * Log complete notification\n *\n * ```ts\n * import { EMPTY } from 'rxjs';\n *\n * EMPTY.subscribe({\n *   next: () => console.log('Next'),\n *   complete: () => console.log('Complete!')\n * });\n *\n * // Outputs\n * // Complete!\n * ```\n *\n * Emit the number 7, then complete\n *\n * ```ts\n * import { EMPTY, startWith } from 'rxjs';\n *\n * const result = EMPTY.pipe(startWith(7));\n * result.subscribe(x => console.log(x));\n *\n * // Outputs\n * // 7\n * ```\n *\n * Map and flatten only odd numbers to the sequence `'a'`, `'b'`, `'c'`\n *\n * ```ts\n * import { interval, mergeMap, of, EMPTY } from 'rxjs';\n *\n * const interval$ = interval(1000);\n * const result = interval$.pipe(\n *   mergeMap(x => x % 2 === 1 ? of('a', 'b', 'c') : EMPTY),\n * );\n * result.subscribe(x => console.log(x));\n *\n * // Results in the following to the console:\n * // x is equal to the count on the interval, e.g. (0, 1, 2, 3, ...)\n * // x will occur every 1000ms\n * // if x % 2 is equal to 1, print a, b, c (each on its own)\n * // if x % 2 is not equal to 1, nothing will be output\n * ```\n *\n * @see {@link Observable}\n * @see {@link NEVER}\n * @see {@link of}\n * @see {@link throwError}\n */\nexport const EMPTY = new Observable<never>((subscriber) => subscriber.complete());\n\n/**\n * @param scheduler A {@link SchedulerLike} to use for scheduling\n * the emission of the complete notification.\n * @deprecated Replaced with the {@link EMPTY} constant or {@link scheduled} (e.g. `scheduled([], scheduler)`). Will be removed in v8.\n */\nexport function empty(scheduler?: SchedulerLike) {\n  return scheduler ? emptyScheduled(scheduler) : EMPTY;\n}\n\nfunction emptyScheduled(scheduler: SchedulerLike) {\n  return new Observable<never>((subscriber) => scheduler.schedule(() => subscriber.complete()));\n}\n", "import { SchedulerLike } from '../types';\nimport { isFunction } from './isFunction';\n\nexport function isScheduler(value: any): value is SchedulerLike {\n  return value && isFunction(value.schedule);\n}\n", "import { SchedulerLike } from '../types';\nimport { isFunction } from './isFunction';\nimport { isScheduler } from './isScheduler';\n\nfunction last<T>(arr: T[]): T | undefined {\n  return arr[arr.length - 1];\n}\n\nexport function popResultSelector(args: any[]): ((...args: unknown[]) => unknown) | undefined {\n  return isFunction(last(args)) ? args.pop() : undefined;\n}\n\nexport function popScheduler(args: any[]): SchedulerLike | undefined {\n  return isScheduler(last(args)) ? args.pop() : undefined;\n}\n\nexport function popNumber(args: any[], defaultValue: number): number {\n  return typeof last(args) === 'number' ? args.pop()! : defaultValue;\n}\n", "export const isArrayLike = (<T>(x: any): x is ArrayLike<T> => x && typeof x.length === 'number' && typeof x !== 'function');", "import { isFunction } from \"./isFunction\";\n\n/**\n * Tests to see if the object is \"thennable\".\n * @param value the object to test\n */\nexport function isPromise(value: any): value is PromiseLike<any> {\n  return isFunction(value?.then);\n}\n", "import { InteropObservable } from '../types';\nimport { observable as Symbol_observable } from '../symbol/observable';\nimport { isFunction } from './isFunction';\n\n/** Identifies an input as being Observable (but not necessary an Rx Observable) */\nexport function isInteropObservable(input: any): input is InteropObservable<any> {\n  return isFunction(input[Symbol_observable]);\n}\n", "import { isFunction } from './isFunction';\n\nexport function isAsyncIterable<T>(obj: any): obj is AsyncIterable<T> {\n  return Symbol.asyncIterator && isFunction(obj?.[Symbol.asyncIterator]);\n}\n", "/**\n * Creates the TypeError to throw if an invalid object is passed to `from` or `scheduled`.\n * @param input The object that was passed.\n */\nexport function createInvalidObservableTypeError(input: any) {\n  // TODO: We should create error codes that can be looked up, so this can be less verbose.\n  return new TypeError(\n    `You provided ${\n      input !== null && typeof input === 'object' ? 'an invalid object' : `'${input}'`\n    } where a stream was expected. You can provide an Observable, Promise, ReadableStream, Array, AsyncIterable, or Iterable.`\n  );\n}\n", "export function getSymbolIterator(): symbol {\n  if (typeof Symbol !== 'function' || !Symbol.iterator) {\n    return '@@iterator' as any;\n  }\n\n  return Symbol.iterator;\n}\n\nexport const iterator = getSymbolIterator();\n", "import { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { isFunction } from './isFunction';\n\n/** Identifies an input as being an Iterable */\nexport function isIterable(input: any): input is Iterable<any> {\n  return isFunction(input?.[Symbol_iterator]);\n}\n", "import { ReadableStreamLike } from '../types';\nimport { isFunction } from './isFunction';\n\nexport async function* readableStreamLikeToAsyncGenerator<T>(readableStream: ReadableStreamLike<T>): AsyncGenerator<T> {\n  const reader = readableStream.getReader();\n  try {\n    while (true) {\n      const { value, done } = await reader.read();\n      if (done) {\n        return;\n      }\n      yield value!;\n    }\n  } finally {\n    reader.releaseLock();\n  }\n}\n\nexport function isReadableStreamLike<T>(obj: any): obj is ReadableStreamLike<T> {\n  // We don't want to use instanceof checks because they would return\n  // false for instances from another Realm, like an <iframe>.\n  return isFunction(obj?.getReader);\n}\n", "import { isArrayLike } from '../util/isArrayLike';\nimport { isPromise } from '../util/isPromise';\nimport { Observable } from '../Observable';\nimport { ObservableInput, ObservedValueOf, ReadableStreamLike } from '../types';\nimport { isInteropObservable } from '../util/isInteropObservable';\nimport { isAsyncIterable } from '../util/isAsyncIterable';\nimport { createInvalidObservableTypeError } from '../util/throwUnobservableError';\nimport { isIterable } from '../util/isIterable';\nimport { isReadableStreamLike, readableStreamLikeToAsyncGenerator } from '../util/isReadableStreamLike';\nimport { Subscriber } from '../Subscriber';\nimport { isFunction } from '../util/isFunction';\nimport { reportUnhandledError } from '../util/reportUnhandledError';\nimport { observable as Symbol_observable } from '../symbol/observable';\n\nexport function innerFrom<O extends ObservableInput<any>>(input: O): Observable<ObservedValueOf<O>>;\nexport function innerFrom<T>(input: ObservableInput<T>): Observable<T> {\n  if (input instanceof Observable) {\n    return input;\n  }\n  if (input != null) {\n    if (isInteropObservable(input)) {\n      return fromInteropObservable(input);\n    }\n    if (isArrayLike(input)) {\n      return fromArrayLike(input);\n    }\n    if (isPromise(input)) {\n      return fromPromise(input);\n    }\n    if (isAsyncIterable(input)) {\n      return fromAsyncIterable(input);\n    }\n    if (isIterable(input)) {\n      return fromIterable(input);\n    }\n    if (isReadableStreamLike(input)) {\n      return fromReadableStreamLike(input);\n    }\n  }\n\n  throw createInvalidObservableTypeError(input);\n}\n\n/**\n * Creates an RxJS Observable from an object that implements `Symbol.observable`.\n * @param obj An object that properly implements `Symbol.observable`.\n */\nexport function fromInteropObservable<T>(obj: any) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    const obs = obj[Symbol_observable]();\n    if (isFunction(obs.subscribe)) {\n      return obs.subscribe(subscriber);\n    }\n    // Should be caught by observable subscribe function error handling.\n    throw new TypeError('Provided object does not correctly implement Symbol.observable');\n  });\n}\n\n/**\n * Synchronously emits the values of an array like and completes.\n * This is exported because there are creation functions and operators that need to\n * make direct use of the same logic, and there's no reason to make them run through\n * `from` conditionals because we *know* they're dealing with an array.\n * @param array The array to emit values from\n */\nexport function fromArrayLike<T>(array: ArrayLike<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    // Loop over the array and emit each value. Note two things here:\n    // 1. We're making sure that the subscriber is not closed on each loop.\n    //    This is so we don't continue looping over a very large array after\n    //    something like a `take`, `takeWhile`, or other synchronous unsubscription\n    //    has already unsubscribed.\n    // 2. In this form, reentrant code can alter that array we're looping over.\n    //    This is a known issue, but considered an edge case. The alternative would\n    //    be to copy the array before executing the loop, but this has\n    //    performance implications.\n    for (let i = 0; i < array.length && !subscriber.closed; i++) {\n      subscriber.next(array[i]);\n    }\n    subscriber.complete();\n  });\n}\n\nexport function fromPromise<T>(promise: PromiseLike<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    promise\n      .then(\n        (value) => {\n          if (!subscriber.closed) {\n            subscriber.next(value);\n            subscriber.complete();\n          }\n        },\n        (err: any) => subscriber.error(err)\n      )\n      .then(null, reportUnhandledError);\n  });\n}\n\nexport function fromIterable<T>(iterable: Iterable<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    for (const value of iterable) {\n      subscriber.next(value);\n      if (subscriber.closed) {\n        return;\n      }\n    }\n    subscriber.complete();\n  });\n}\n\nexport function fromAsyncIterable<T>(asyncIterable: AsyncIterable<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    process(asyncIterable, subscriber).catch((err) => subscriber.error(err));\n  });\n}\n\nexport function fromReadableStreamLike<T>(readableStream: ReadableStreamLike<T>) {\n  return fromAsyncIterable(readableStreamLikeToAsyncGenerator(readableStream));\n}\n\nasync function process<T>(asyncIterable: AsyncIterable<T>, subscriber: Subscriber<T>) {\n  for await (const value of asyncIterable) {\n    subscriber.next(value);\n    // A side-effect may have closed our subscriber,\n    // check before the next iteration.\n    if (subscriber.closed) {\n      return;\n    }\n  }\n  subscriber.complete();\n}\n", "import { Subscription } from '../Subscription';\nimport { SchedulerAction, SchedulerLike } from '../types';\n\nexport function executeSchedule(\n  parentSubscription: Subscription,\n  scheduler: SchedulerLike,\n  work: () => void,\n  delay: number,\n  repeat: true\n): void;\nexport function executeSchedule(\n  parentSubscription: Subscription,\n  scheduler: SchedulerLike,\n  work: () => void,\n  delay?: number,\n  repeat?: false\n): Subscription;\n\nexport function executeSchedule(\n  parentSubscription: Subscription,\n  scheduler: SchedulerLike,\n  work: () => void,\n  delay = 0,\n  repeat = false\n): Subscription | void {\n  const scheduleSubscription = scheduler.schedule(function (this: SchedulerAction<any>) {\n    work();\n    if (repeat) {\n      parentSubscription.add(this.schedule(null, delay));\n    } else {\n      this.unsubscribe();\n    }\n  }, delay);\n\n  parentSubscription.add(scheduleSubscription);\n\n  if (!repeat) {\n    // Because user-land scheduler implementations are unlikely to properly reuse\n    // Actions for repeat scheduling, we can't trust that the returned subscription\n    // will control repeat subscription scenarios. So we're trying to avoid using them\n    // incorrectly within this library.\n    return scheduleSubscription;\n  }\n}\n", "/** @prettier */\nimport { MonoTypeOperatorFunction, SchedulerLike } from '../types';\nimport { executeSchedule } from '../util/executeSchedule';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * Re-emits all notifications from source Observable with specified scheduler.\n *\n * <span class=\"informal\">Ensure a specific scheduler is used, from outside of an Observable.</span>\n *\n * `observeOn` is an operator that accepts a scheduler as a first parameter, which will be used to reschedule\n * notifications emitted by the source Observable. It might be useful, if you do not have control over\n * internal scheduler of a given Observable, but want to control when its values are emitted nevertheless.\n *\n * Returned Observable emits the same notifications (nexted values, complete and error events) as the source Observable,\n * but rescheduled with provided scheduler. Note that this doesn't mean that source Observables internal\n * scheduler will be replaced in any way. Original scheduler still will be used, but when the source Observable emits\n * notification, it will be immediately scheduled again - this time with scheduler passed to `observeOn`.\n * An anti-pattern would be calling `observeOn` on Observable that emits lots of values synchronously, to split\n * that emissions into asynchronous chunks. For this to happen, scheduler would have to be passed into the source\n * Observable directly (usually into the operator that creates it). `observeOn` simply delays notifications a\n * little bit more, to ensure that they are emitted at expected moments.\n *\n * As a matter of fact, `observeOn` accepts second parameter, which specifies in milliseconds with what delay notifications\n * will be emitted. The main difference between {@link delay} operator and `observeOn` is that `observeOn`\n * will delay all notifications - including error notifications - while `delay` will pass through error\n * from source Observable immediately when it is emitted. In general it is highly recommended to use `delay` operator\n * for any kind of delaying of values in the stream, while using `observeOn` to specify which scheduler should be used\n * for notification emissions in general.\n *\n * ## Example\n *\n * Ensure values in subscribe are called just before browser repaint\n *\n * ```ts\n * import { interval, observeOn, animationFrameScheduler } from 'rxjs';\n *\n * const someDiv = document.createElement('div');\n * someDiv.style.cssText = 'width: 200px;background: #09c';\n * document.body.appendChild(someDiv);\n * const intervals = interval(10);      // Intervals are scheduled\n *                                      // with async scheduler by default...\n * intervals.pipe(\n *   observeOn(animationFrameScheduler) // ...but we will observe on animationFrame\n * )                                    // scheduler to ensure smooth animation.\n * .subscribe(val => {\n *   someDiv.style.height = val + 'px';\n * });\n * ```\n *\n * @see {@link delay}\n *\n * @param scheduler Scheduler that will be used to reschedule notifications from source Observable.\n * @param delay Number of milliseconds that states with what delay every notification should be rescheduled.\n * @return A function that returns an Observable that emits the same\n * notifications as the source Observable, but with provided scheduler.\n */\nexport function observeOn<T>(scheduler: SchedulerLike, delay = 0): MonoTypeOperatorFunction<T> {\n  return operate((source, subscriber) => {\n    source.subscribe(\n      createOperatorSubscriber(\n        subscriber,\n        (value) => executeSchedule(subscriber, scheduler, () => subscriber.next(value), delay),\n        () => executeSchedule(subscriber, scheduler, () => subscriber.complete(), delay),\n        (err) => executeSchedule(subscriber, scheduler, () => subscriber.error(err), delay)\n      )\n    );\n  });\n}\n", "import { MonoTypeOperatorFunction, SchedulerLike } from '../types';\nimport { operate } from '../util/lift';\n\n/**\n * Asynchronously subscribes Observers to this Observable on the specified {@link SchedulerLike}.\n *\n * With `subscribeOn` you can decide what type of scheduler a specific Observable will be using when it is subscribed to.\n *\n * Schedulers control the speed and order of emissions to observers from an Observable stream.\n *\n * ![](subscribeOn.png)\n *\n * ## Example\n *\n * Given the following code:\n *\n * ```ts\n * import { of, merge } from 'rxjs';\n *\n * const a = of(1, 2, 3);\n * const b = of(4, 5, 6);\n *\n * merge(a, b).subscribe(console.log);\n *\n * // Outputs\n * // 1\n * // 2\n * // 3\n * // 4\n * // 5\n * // 6\n * ```\n *\n * Both Observable `a` and `b` will emit their values directly and synchronously once they are subscribed to.\n *\n * If we instead use the `subscribeOn` operator declaring that we want to use the {@link asyncScheduler} for values emitted by Observable `a`:\n *\n * ```ts\n * import { of, subscribeOn, asyncScheduler, merge } from 'rxjs';\n *\n * const a = of(1, 2, 3).pipe(subscribeOn(asyncScheduler));\n * const b = of(4, 5, 6);\n *\n * merge(a, b).subscribe(console.log);\n *\n * // Outputs\n * // 4\n * // 5\n * // 6\n * // 1\n * // 2\n * // 3\n * ```\n *\n * The reason for this is that Observable `b` emits its values directly and synchronously like before\n * but the emissions from `a` are scheduled on the event loop because we are now using the {@link asyncScheduler} for that specific Observable.\n *\n * @param scheduler The {@link SchedulerLike} to perform subscription actions on.\n * @param delay A delay to pass to the scheduler to delay subscriptions\n * @return A function that returns an Observable modified so that its\n * subscriptions happen on the specified {@link SchedulerLike}.\n */\nexport function subscribeOn<T>(scheduler: SchedulerLike, delay: number = 0): MonoTypeOperatorFunction<T> {\n  return operate((source, subscriber) => {\n    subscriber.add(scheduler.schedule(() => source.subscribe(subscriber), delay));\n  });\n}\n", "import { innerFrom } from '../observable/innerFrom';\nimport { observeOn } from '../operators/observeOn';\nimport { subscribeOn } from '../operators/subscribeOn';\nimport { InteropObservable, SchedulerLike } from '../types';\n\nexport function scheduleObservable<T>(input: InteropObservable<T>, scheduler: SchedulerLike) {\n  return innerFrom(input).pipe(subscribeOn(scheduler), observeOn(scheduler));\n}\n", "import { innerFrom } from '../observable/innerFrom';\nimport { observeOn } from '../operators/observeOn';\nimport { subscribeOn } from '../operators/subscribeOn';\nimport { SchedulerLike } from '../types';\n\nexport function schedulePromise<T>(input: PromiseLike<T>, scheduler: SchedulerLike) {\n  return innerFrom(input).pipe(subscribeOn(scheduler), observeOn(scheduler));\n}\n", "import { Observable } from '../Observable';\nimport { SchedulerLike } from '../types';\n\nexport function scheduleArray<T>(input: ArrayLike<T>, scheduler: SchedulerLike) {\n  return new Observable<T>((subscriber) => {\n    // The current array index.\n    let i = 0;\n    // Start iterating over the array like on a schedule.\n    return scheduler.schedule(function () {\n      if (i === input.length) {\n        // If we have hit the end of the array like in the\n        // previous job, we can complete.\n        subscriber.complete();\n      } else {\n        // Otherwise let's next the value at the current index,\n        // then increment our index.\n        subscriber.next(input[i++]);\n        // If the last emission didn't cause us to close the subscriber\n        // (via take or some side effect), reschedule the job and we'll\n        // make another pass.\n        if (!subscriber.closed) {\n          this.schedule();\n        }\n      }\n    });\n  });\n}\n", "import { Observable } from '../Observable';\nimport { SchedulerLike } from '../types';\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { isFunction } from '../util/isFunction';\nimport { executeSchedule } from '../util/executeSchedule';\n\n/**\n * Used in {@link scheduled} to create an observable from an Iterable.\n * @param input The iterable to create an observable from\n * @param scheduler The scheduler to use\n */\nexport function scheduleIterable<T>(input: Iterable<T>, scheduler: SchedulerLike) {\n  return new Observable<T>((subscriber) => {\n    let iterator: Iterator<T, T>;\n\n    // Schedule the initial creation of the iterator from\n    // the iterable. This is so the code in the iterable is\n    // not called until the scheduled job fires.\n    executeSchedule(subscriber, scheduler, () => {\n      // Create the iterator.\n      iterator = (input as any)[Symbol_iterator]();\n\n      executeSchedule(\n        subscriber,\n        scheduler,\n        () => {\n          let value: T;\n          let done: boolean | undefined;\n          try {\n            // Pull the value out of the iterator\n            ({ value, done } = iterator.next());\n          } catch (err) {\n            // We got an error while pulling from the iterator\n            subscriber.error(err);\n            return;\n          }\n\n          if (done) {\n            // If it is \"done\" we just complete. This mimics the\n            // behavior of JavaScript's `for..of` consumption of\n            // iterables, which will not emit the value from an iterator\n            // result of `{ done: true: value: 'here' }`.\n            subscriber.complete();\n          } else {\n            // The iterable is not done, emit the value.\n            subscriber.next(value);\n          }\n        },\n        0,\n        true\n      );\n    });\n\n    // During finalization, if we see this iterator has a `return` method,\n    // then we know it is a Generator, and not just an Iterator. So we call\n    // the `return()` function. This will ensure that any `finally { }` blocks\n    // inside of the generator we can hit will be hit properly.\n    return () => isFunction(iterator?.return) && iterator.return();\n  });\n}\n", "import { SchedulerLike } from '../types';\nimport { Observable } from '../Observable';\nimport { executeSchedule } from '../util/executeSchedule';\n\nexport function scheduleAsyncIterable<T>(input: AsyncIterable<T>, scheduler: SchedulerLike) {\n  if (!input) {\n    throw new Error('Iterable cannot be null');\n  }\n  return new Observable<T>((subscriber) => {\n    executeSchedule(subscriber, scheduler, () => {\n      const iterator = input[Symbol.asyncIterator]();\n      executeSchedule(\n        subscriber,\n        scheduler,\n        () => {\n          iterator.next().then((result) => {\n            if (result.done) {\n              // This will remove the subscriptions from\n              // the parent subscription.\n              subscriber.complete();\n            } else {\n              subscriber.next(result.value);\n            }\n          });\n        },\n        0,\n        true\n      );\n    });\n  });\n}\n", "import { SchedulerLike, ReadableStreamLike } from '../types';\nimport { Observable } from '../Observable';\nimport { scheduleAsyncIterable } from './scheduleAsyncIterable';\nimport { readableStreamLikeToAsyncGenerator } from '../util/isReadableStreamLike';\n\nexport function scheduleReadableStreamLike<T>(input: ReadableStreamLike<T>, scheduler: SchedulerLike): Observable<T> {\n  return scheduleAsyncIterable(readableStreamLikeToAsyncGenerator(input), scheduler);\n}\n", "import { scheduleObservable } from './scheduleObservable';\nimport { schedulePromise } from './schedulePromise';\nimport { scheduleArray } from './scheduleArray';\nimport { scheduleIterable } from './scheduleIterable';\nimport { scheduleAsyncIterable } from './scheduleAsyncIterable';\nimport { isInteropObservable } from '../util/isInteropObservable';\nimport { isPromise } from '../util/isPromise';\nimport { isArrayLike } from '../util/isArrayLike';\nimport { isIterable } from '../util/isIterable';\nimport { ObservableInput, SchedulerLike } from '../types';\nimport { Observable } from '../Observable';\nimport { isAsyncIterable } from '../util/isAsyncIterable';\nimport { createInvalidObservableTypeError } from '../util/throwUnobservableError';\nimport { isReadableStreamLike } from '../util/isReadableStreamLike';\nimport { scheduleReadableStreamLike } from './scheduleReadableStreamLike';\n\n/**\n * Converts from a common {@link ObservableInput} type to an observable where subscription and emissions\n * are scheduled on the provided scheduler.\n *\n * @see {@link from}\n * @see {@link of}\n *\n * @param input The observable, array, promise, iterable, etc you would like to schedule\n * @param scheduler The scheduler to use to schedule the subscription and emissions from\n * the returned observable.\n */\nexport function scheduled<T>(input: ObservableInput<T>, scheduler: SchedulerLike): Observable<T> {\n  if (input != null) {\n    if (isInteropObservable(input)) {\n      return scheduleObservable(input, scheduler);\n    }\n    if (isArrayLike(input)) {\n      return scheduleArray(input, scheduler);\n    }\n    if (isPromise(input)) {\n      return schedulePromise(input, scheduler);\n    }\n    if (isAsyncIterable(input)) {\n      return scheduleAsyncIterable(input, scheduler);\n    }\n    if (isIterable(input)) {\n      return scheduleIterable(input, scheduler);\n    }\n    if (isReadableStreamLike(input)) {\n      return scheduleReadableStreamLike(input, scheduler);\n    }\n  }\n  throw createInvalidObservableTypeError(input);\n}\n", "import { Observable } from '../Observable';\nimport { ObservableInput, SchedulerLike, ObservedValueOf } from '../types';\nimport { scheduled } from '../scheduled/scheduled';\nimport { innerFrom } from './innerFrom';\n\nexport function from<O extends ObservableInput<any>>(input: O): Observable<ObservedValueOf<O>>;\n/** @deprecated The `scheduler` parameter will be removed in v8. Use `scheduled`. Details: https://rxjs.dev/deprecations/scheduler-argument */\nexport function from<O extends ObservableInput<any>>(input: O, scheduler: SchedulerLike | undefined): Observable<ObservedValueOf<O>>;\n\n/**\n * Creates an Observable from an Array, an array-like object, a Promise, an iterable object, or an Observable-like object.\n *\n * <span class=\"informal\">Converts almost anything to an Observable.</span>\n *\n * ![](from.png)\n *\n * `from` converts various other objects and data types into Observables. It also converts a Promise, an array-like, or an\n * <a href=\"https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#iterable\" target=\"_blank\">iterable</a>\n * object into an Observable that emits the items in that promise, array, or iterable. A String, in this context, is treated\n * as an array of characters. Observable-like objects (contains a function named with the ES2015 Symbol for Observable) can also be\n * converted through this operator.\n *\n * ## Examples\n *\n * Converts an array to an Observable\n *\n * ```ts\n * import { from } from 'rxjs';\n *\n * const array = [10, 20, 30];\n * const result = from(array);\n *\n * result.subscribe(x => console.log(x));\n *\n * // Logs:\n * // 10\n * // 20\n * // 30\n * ```\n *\n * Convert an infinite iterable (from a generator) to an Observable\n *\n * ```ts\n * import { from, take } from 'rxjs';\n *\n * function* generateDoubles(seed) {\n *    let i = seed;\n *    while (true) {\n *      yield i;\n *      i = 2 * i; // double it\n *    }\n * }\n *\n * const iterator = generateDoubles(3);\n * const result = from(iterator).pipe(take(10));\n *\n * result.subscribe(x => console.log(x));\n *\n * // Logs:\n * // 3\n * // 6\n * // 12\n * // 24\n * // 48\n * // 96\n * // 192\n * // 384\n * // 768\n * // 1536\n * ```\n *\n * With `asyncScheduler`\n *\n * ```ts\n * import { from, asyncScheduler } from 'rxjs';\n *\n * console.log('start');\n *\n * const array = [10, 20, 30];\n * const result = from(array, asyncScheduler);\n *\n * result.subscribe(x => console.log(x));\n *\n * console.log('end');\n *\n * // Logs:\n * // 'start'\n * // 'end'\n * // 10\n * // 20\n * // 30\n * ```\n *\n * @see {@link fromEvent}\n * @see {@link fromEventPattern}\n *\n * @param {ObservableInput<T>} A subscription object, a Promise, an Observable-like,\n * an Array, an iterable, or an array-like object to be converted.\n * @param {SchedulerLike} An optional {@link SchedulerLike} on which to schedule the emission of values.\n * @return {Observable<T>}\n */\nexport function from<T>(input: ObservableInput<T>, scheduler?: SchedulerLike): Observable<T> {\n  return scheduler ? scheduled(input, scheduler) : innerFrom(input);\n}\n", "import { createErrorClass } from './createErrorClass';\n\nexport interface EmptyError extends Error {}\n\nexport interface EmptyErrorCtor {\n  /**\n   * @deprecated Internal implementation detail. Do not construct error instances.\n   * Cannot be tagged as internal: https://github.com/ReactiveX/rxjs/issues/6269\n   */\n  new (): EmptyError;\n}\n\n/**\n * An error thrown when an Observable or a sequence was queried but has no\n * elements.\n *\n * @see {@link first}\n * @see {@link last}\n * @see {@link single}\n * @see {@link firstValueFrom}\n * @see {@link lastValueFrom}\n *\n * @class EmptyError\n */\nexport const EmptyError: EmptyErrorCtor = createErrorClass((_super) => function EmptyErrorImpl(this: any) {\n  _super(this);\n  this.name = 'EmptyError';\n  this.message = 'no elements in sequence';\n});\n", "import { Observable } from './Observable';\nimport { EmptyError } from './util/EmptyError';\nimport { SafeSubscriber } from './Subscriber';\n\nexport interface FirstValueFromConfig<T> {\n  defaultValue: T;\n}\n\nexport function firstValueFrom<T, D>(source: Observable<T>, config: FirstValueFromConfig<D>): Promise<T | D>;\nexport function firstValueFrom<T>(source: Observable<T>): Promise<T>;\n\n/**\n * Converts an observable to a promise by subscribing to the observable,\n * and returning a promise that will resolve as soon as the first value\n * arrives from the observable. The subscription will then be closed.\n *\n * If the observable stream completes before any values were emitted, the\n * returned promise will reject with {@link EmptyError} or will resolve\n * with the default value if a default was specified.\n *\n * If the observable stream emits an error, the returned promise will reject\n * with that error.\n *\n * **WARNING**: Only use this with observables you *know* will emit at least one value,\n * *OR* complete. If the source observable does not emit one value or complete, you will\n * end up with a promise that is hung up, and potentially all of the state of an\n * async function hanging out in memory. To avoid this situation, look into adding\n * something like {@link timeout}, {@link take}, {@link takeWhile}, or {@link takeUntil}\n * amongst others.\n *\n * ## Example\n *\n * Wait for the first value from a stream and emit it from a promise in\n * an async function\n *\n * ```ts\n * import { interval, firstValueFrom } from 'rxjs';\n *\n * async function execute() {\n *   const source$ = interval(2000);\n *   const firstNumber = await firstValueFrom(source$);\n *   console.log(`The first number is ${ firstNumber }`);\n * }\n *\n * execute();\n *\n * // Expected output:\n * // 'The first number is 0'\n * ```\n *\n * @see {@link lastValueFrom}\n *\n * @param source the observable to convert to a promise\n * @param config a configuration object to define the `defaultValue` to use if the source completes without emitting a value\n */\nexport function firstValueFrom<T, D>(source: Observable<T>, config?: FirstValueFromConfig<D>): Promise<T | D> {\n  const hasConfig = typeof config === 'object';\n  return new Promise<T | D>((resolve, reject) => {\n    const subscriber = new SafeSubscriber<T>({\n      next: (value) => {\n        resolve(value);\n        subscriber.unsubscribe();\n      },\n      error: reject,\n      complete: () => {\n        if (hasConfig) {\n          resolve(config!.defaultValue);\n        } else {\n          reject(new EmptyError());\n        }\n      },\n    });\n    source.subscribe(subscriber);\n  });\n}\n", "import { OperatorFunction } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\nexport function map<T, R>(project: (value: T, index: number) => R): OperatorFunction<T, R>;\n/** @deprecated Use a closure instead of a `thisArg`. Signatures accepting a `thisArg` will be removed in v8. */\nexport function map<T, R, A>(project: (this: A, value: T, index: number) => R, thisArg: A): OperatorFunction<T, R>;\n\n/**\n * Applies a given `project` function to each value emitted by the source\n * Observable, and emits the resulting values as an Observable.\n *\n * <span class=\"informal\">Like [Array.prototype.map()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map),\n * it passes each source value through a transformation function to get\n * corresponding output values.</span>\n *\n * ![](map.png)\n *\n * Similar to the well known `Array.prototype.map` function, this operator\n * applies a projection to each value and emits that projection in the output\n * Observable.\n *\n * ## Example\n *\n * Map every click to the `clientX` position of that click\n *\n * ```ts\n * import { fromEvent, map } from 'rxjs';\n *\n * const clicks = fromEvent<PointerEvent>(document, 'click');\n * const positions = clicks.pipe(map(ev => ev.clientX));\n *\n * positions.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link mapTo}\n * @see {@link pluck}\n *\n * @param {function(value: T, index: number): R} project The function to apply\n * to each `value` emitted by the source Observable. The `index` parameter is\n * the number `i` for the i-th emission that has happened since the\n * subscription, starting from the number `0`.\n * @param {any} [thisArg] An optional argument to define what `this` is in the\n * `project` function.\n * @return A function that returns an Observable that emits the values from the\n * source Observable transformed by the given `project` function.\n */\nexport function map<T, R>(project: (value: T, index: number) => R, thisArg?: any): OperatorFunction<T, R> {\n  return operate((source, subscriber) => {\n    // The index of the value from the source. Used with projection.\n    let index = 0;\n    // Subscribe to the source, all errors and completions are sent along\n    // to the consumer.\n    source.subscribe(\n      createOperatorSubscriber(subscriber, (value: T) => {\n        // Call the projection function with the appropriate this context,\n        // and send the resulting value to the consumer.\n        subscriber.next(project.call(thisArg, value, index++));\n      })\n    );\n  });\n}\n", "import { Observable } from '../Observable';\nimport { innerFrom } from '../observable/innerFrom';\nimport { Subscriber } from '../Subscriber';\nimport { ObservableInput, SchedulerLike } from '../types';\nimport { executeSchedule } from '../util/executeSchedule';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * A process embodying the general \"merge\" strategy. This is used in\n * `mergeMap` and `mergeScan` because the logic is otherwise nearly identical.\n * @param source The original source observable\n * @param subscriber The consumer subscriber\n * @param project The projection function to get our inner sources\n * @param concurrent The number of concurrent inner subscriptions\n * @param onBeforeNext Additional logic to apply before nexting to our consumer\n * @param expand If `true` this will perform an \"expand\" strategy, which differs only\n * in that it recurses, and the inner subscription must be schedule-able.\n * @param innerSubScheduler A scheduler to use to schedule inner subscriptions,\n * this is to support the expand strategy, mostly, and should be deprecated\n */\nexport function mergeInternals<T, R>(\n  source: Observable<T>,\n  subscriber: Subscriber<R>,\n  project: (value: T, index: number) => ObservableInput<R>,\n  concurrent: number,\n  onBeforeNext?: (innerValue: R) => void,\n  expand?: boolean,\n  innerSubScheduler?: SchedulerLike,\n  additionalFinalizer?: () => void\n) {\n  // Buffered values, in the event of going over our concurrency limit\n  const buffer: T[] = [];\n  // The number of active inner subscriptions.\n  let active = 0;\n  // An index to pass to our accumulator function\n  let index = 0;\n  // Whether or not the outer source has completed.\n  let isComplete = false;\n\n  /**\n   * Checks to see if we can complete our result or not.\n   */\n  const checkComplete = () => {\n    // If the outer has completed, and nothing is left in the buffer,\n    // and we don't have any active inner subscriptions, then we can\n    // Emit the state and complete.\n    if (isComplete && !buffer.length && !active) {\n      subscriber.complete();\n    }\n  };\n\n  // If we're under our concurrency limit, just start the inner subscription, otherwise buffer and wait.\n  const outerNext = (value: T) => (active < concurrent ? doInnerSub(value) : buffer.push(value));\n\n  const doInnerSub = (value: T) => {\n    // If we're expanding, we need to emit the outer values and the inner values\n    // as the inners will \"become outers\" in a way as they are recursively fed\n    // back to the projection mechanism.\n    expand && subscriber.next(value as any);\n\n    // Increment the number of active subscriptions so we can track it\n    // against our concurrency limit later.\n    active++;\n\n    // A flag used to show that the inner observable completed.\n    // This is checked during finalization to see if we should\n    // move to the next item in the buffer, if there is on.\n    let innerComplete = false;\n\n    // Start our inner subscription.\n    innerFrom(project(value, index++)).subscribe(\n      createOperatorSubscriber(\n        subscriber,\n        (innerValue) => {\n          // `mergeScan` has additional handling here. For example\n          // taking the inner value and updating state.\n          onBeforeNext?.(innerValue);\n\n          if (expand) {\n            // If we're expanding, then just recurse back to our outer\n            // handler. It will emit the value first thing.\n            outerNext(innerValue as any);\n          } else {\n            // Otherwise, emit the inner value.\n            subscriber.next(innerValue);\n          }\n        },\n        () => {\n          // Flag that we have completed, so we know to check the buffer\n          // during finalization.\n          innerComplete = true;\n        },\n        // Errors are passed to the destination.\n        undefined,\n        () => {\n          // During finalization, if the inner completed (it wasn't errored or\n          // cancelled), then we want to try the next item in the buffer if\n          // there is one.\n          if (innerComplete) {\n            // We have to wrap this in a try/catch because it happens during\n            // finalization, possibly asynchronously, and we want to pass\n            // any errors that happen (like in a projection function) to\n            // the outer Subscriber.\n            try {\n              // INNER SOURCE COMPLETE\n              // Decrement the active count to ensure that the next time\n              // we try to call `doInnerSub`, the number is accurate.\n              active--;\n              // If we have more values in the buffer, try to process those\n              // Note that this call will increment `active` ahead of the\n              // next conditional, if there were any more inner subscriptions\n              // to start.\n              while (buffer.length && active < concurrent) {\n                const bufferedValue = buffer.shift()!;\n                // Particularly for `expand`, we need to check to see if a scheduler was provided\n                // for when we want to start our inner subscription. Otherwise, we just start\n                // are next inner subscription.\n                if (innerSubScheduler) {\n                  executeSchedule(subscriber, innerSubScheduler, () => doInnerSub(bufferedValue));\n                } else {\n                  doInnerSub(bufferedValue);\n                }\n              }\n              // Check to see if we can complete, and complete if so.\n              checkComplete();\n            } catch (err) {\n              subscriber.error(err);\n            }\n          }\n        }\n      )\n    );\n  };\n\n  // Subscribe to our source observable.\n  source.subscribe(\n    createOperatorSubscriber(subscriber, outerNext, () => {\n      // Outer completed, make a note of it, and check to see if we can complete everything.\n      isComplete = true;\n      checkComplete();\n    })\n  );\n\n  // Additional finalization (for when the destination is torn down).\n  // Other finalization is added implicitly via subscription above.\n  return () => {\n    additionalFinalizer?.();\n  };\n}\n", "import { ObservableInput, OperatorFunction, ObservedValueOf } from '../types';\nimport { map } from './map';\nimport { innerFrom } from '../observable/innerFrom';\nimport { operate } from '../util/lift';\nimport { mergeInternals } from './mergeInternals';\nimport { isFunction } from '../util/isFunction';\n\n/* tslint:disable:max-line-length */\nexport function mergeMap<T, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  concurrent?: number\n): OperatorFunction<T, ObservedValueOf<O>>;\n/** @deprecated The `resultSelector` parameter will be removed in v8. Use an inner `map` instead. Details: https://rxjs.dev/deprecations/resultSelector */\nexport function mergeMap<T, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  resultSelector: undefined,\n  concurrent?: number\n): OperatorFunction<T, ObservedValueOf<O>>;\n/** @deprecated The `resultSelector` parameter will be removed in v8. Use an inner `map` instead. Details: https://rxjs.dev/deprecations/resultSelector */\nexport function mergeMap<T, R, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  resultSelector: (outerValue: T, innerValue: ObservedValueOf<O>, outerIndex: number, innerIndex: number) => R,\n  concurrent?: number\n): OperatorFunction<T, R>;\n/* tslint:enable:max-line-length */\n\n/**\n * Projects each source value to an Observable which is merged in the output\n * Observable.\n *\n * <span class=\"informal\">Maps each value to an Observable, then flattens all of\n * these inner Observables using {@link mergeAll}.</span>\n *\n * ![](mergeMap.png)\n *\n * Returns an Observable that emits items based on applying a function that you\n * supply to each item emitted by the source Observable, where that function\n * returns an Observable, and then merging those resulting Observables and\n * emitting the results of this merger.\n *\n * ## Example\n *\n * Map and flatten each letter to an Observable ticking every 1 second\n *\n * ```ts\n * import { of, mergeMap, interval, map } from 'rxjs';\n *\n * const letters = of('a', 'b', 'c');\n * const result = letters.pipe(\n *   mergeMap(x => interval(1000).pipe(map(i => x + i)))\n * );\n *\n * result.subscribe(x => console.log(x));\n *\n * // Results in the following:\n * // a0\n * // b0\n * // c0\n * // a1\n * // b1\n * // c1\n * // continues to list a, b, c every second with respective ascending integers\n * ```\n *\n * @see {@link concatMap}\n * @see {@link exhaustMap}\n * @see {@link merge}\n * @see {@link mergeAll}\n * @see {@link mergeMapTo}\n * @see {@link mergeScan}\n * @see {@link switchMap}\n *\n * @param {function(value: T, ?index: number): ObservableInput} project A function\n * that, when applied to an item emitted by the source Observable, returns an\n * Observable.\n * @param {number} [concurrent=Infinity] Maximum number of input\n * Observables being subscribed to concurrently.\n * @return A function that returns an Observable that emits the result of\n * applying the projection function (and the optional deprecated\n * `resultSelector`) to each item emitted by the source Observable and merging\n * the results of the Observables obtained from this transformation.\n */\nexport function mergeMap<T, R, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  resultSelector?: ((outerValue: T, innerValue: ObservedValueOf<O>, outerIndex: number, innerIndex: number) => R) | number,\n  concurrent: number = Infinity\n): OperatorFunction<T, ObservedValueOf<O> | R> {\n  if (isFunction(resultSelector)) {\n    // DEPRECATED PATH\n    return mergeMap((a, i) => map((b: any, ii: number) => resultSelector(a, b, i, ii))(innerFrom(project(a, i))), concurrent);\n  } else if (typeof resultSelector === 'number') {\n    concurrent = resultSelector;\n  }\n\n  return operate((source, subscriber) => mergeInternals(source, subscriber, project, concurrent));\n}\n", "import { mergeMap } from './mergeMap';\nimport { identity } from '../util/identity';\nimport { OperatorFunction, ObservableInput, ObservedValueOf } from '../types';\n\n/**\n * Converts a higher-order Observable into a first-order Observable which\n * concurrently delivers all values that are emitted on the inner Observables.\n *\n * <span class=\"informal\">Flattens an Observable-of-Observables.</span>\n *\n * ![](mergeAll.png)\n *\n * `mergeAll` subscribes to an Observable that emits Observables, also known as\n * a higher-order Observable. Each time it observes one of these emitted inner\n * Observables, it subscribes to that and delivers all the values from the\n * inner Observable on the output Observable. The output Observable only\n * completes once all inner Observables have completed. Any error delivered by\n * a inner Observable will be immediately emitted on the output Observable.\n *\n * ## Examples\n *\n * Spawn a new interval Observable for each click event, and blend their outputs as one Observable\n *\n * ```ts\n * import { fromEvent, map, interval, mergeAll } from 'rxjs';\n *\n * const clicks = fromEvent(document, 'click');\n * const higherOrder = clicks.pipe(map(() => interval(1000)));\n * const firstOrder = higherOrder.pipe(mergeAll());\n *\n * firstOrder.subscribe(x => console.log(x));\n * ```\n *\n * Count from 0 to 9 every second for each click, but only allow 2 concurrent timers\n *\n * ```ts\n * import { fromEvent, map, interval, take, mergeAll } from 'rxjs';\n *\n * const clicks = fromEvent(document, 'click');\n * const higherOrder = clicks.pipe(\n *   map(() => interval(1000).pipe(take(10)))\n * );\n * const firstOrder = higherOrder.pipe(mergeAll(2));\n *\n * firstOrder.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link combineLatestAll}\n * @see {@link concatAll}\n * @see {@link exhaustAll}\n * @see {@link merge}\n * @see {@link mergeMap}\n * @see {@link mergeMapTo}\n * @see {@link mergeScan}\n * @see {@link switchAll}\n * @see {@link switchMap}\n * @see {@link zipAll}\n *\n * @param {number} [concurrent=Infinity] Maximum number of inner\n * Observables being subscribed to concurrently.\n * @return A function that returns an Observable that emits values coming from\n * all the inner Observables emitted by the source Observable.\n */\nexport function mergeAll<O extends ObservableInput<any>>(concurrent: number = Infinity): OperatorFunction<O, ObservedValueOf<O>> {\n  return mergeMap(identity, concurrent);\n}\n", "import { Observable } from '../Observable';\nimport { ObservedValueOf, ObservableInput } from '../types';\nimport { innerFrom } from './innerFrom';\n\n/**\n * Creates an Observable that, on subscribe, calls an Observable factory to\n * make an Observable for each new Observer.\n *\n * <span class=\"informal\">Creates the Observable lazily, that is, only when it\n * is subscribed.\n * </span>\n *\n * ![](defer.png)\n *\n * `defer` allows you to create an Observable only when the Observer\n * subscribes. It waits until an Observer subscribes to it, calls the given\n * factory function to get an Observable -- where a factory function typically\n * generates a new Observable -- and subscribes the Observer to this Observable.\n * In case the factory function returns a falsy value, then EMPTY is used as\n * Observable instead. Last but not least, an exception during the factory\n * function call is transferred to the Observer by calling `error`.\n *\n * ## Example\n *\n * Subscribe to either an Observable of clicks or an Observable of interval, at random\n *\n * ```ts\n * import { defer, fromEvent, interval } from 'rxjs';\n *\n * const clicksOrInterval = defer(() => {\n *   return Math.random() > 0.5\n *     ? fromEvent(document, 'click')\n *     : interval(1000);\n * });\n * clicksOrInterval.subscribe(x => console.log(x));\n *\n * // Results in the following behavior:\n * // If the result of Math.random() is greater than 0.5 it will listen\n * // for clicks anywhere on the \"document\"; when document is clicked it\n * // will log a MouseEvent object to the console. If the result is less\n * // than 0.5 it will emit ascending numbers, one every second(1000ms).\n * ```\n *\n * @see {@link Observable}\n *\n * @param {function(): ObservableInput} observableFactory The Observable\n * factory function to invoke for each Observer that subscribes to the output\n * Observable. May also return a Promise, which will be converted on the fly\n * to an Observable.\n * @return {Observable} An Observable whose Observers' subscriptions trigger\n * an invocation of the given Observable factory function.\n */\nexport function defer<R extends ObservableInput<any>>(observableFactory: () => R): Observable<ObservedValueOf<R>> {\n  return new Observable<ObservedValueOf<R>>((subscriber) => {\n    innerFrom(observableFactory()).subscribe(subscriber);\n  });\n}\n", "import { Observable } from '../Observable';\nimport { ObservableInput, ObservableInputTuple, SchedulerLike } from '../types';\nimport { mergeAll } from '../operators/mergeAll';\nimport { innerFrom } from './innerFrom';\nimport { EMPTY } from './empty';\nimport { popNumber, popScheduler } from '../util/args';\nimport { from } from './from';\n\nexport function merge<A extends readonly unknown[]>(...sources: [...ObservableInputTuple<A>]): Observable<A[number]>;\nexport function merge<A extends readonly unknown[]>(...sourcesAndConcurrency: [...ObservableInputTuple<A>, number?]): Observable<A[number]>;\n/** @deprecated The `scheduler` parameter will be removed in v8. Use `scheduled` and `mergeAll`. Details: https://rxjs.dev/deprecations/scheduler-argument */\nexport function merge<A extends readonly unknown[]>(\n  ...sourcesAndScheduler: [...ObservableInputTuple<A>, SchedulerLike?]\n): Observable<A[number]>;\n/** @deprecated The `scheduler` parameter will be removed in v8. Use `scheduled` and `mergeAll`. Details: https://rxjs.dev/deprecations/scheduler-argument */\nexport function merge<A extends readonly unknown[]>(\n  ...sourcesAndConcurrencyAndScheduler: [...ObservableInputTuple<A>, number?, SchedulerLike?]\n): Observable<A[number]>;\n\n/**\n * Creates an output Observable which concurrently emits all values from every\n * given input Observable.\n *\n * <span class=\"informal\">Flattens multiple Observables together by blending\n * their values into one Observable.</span>\n *\n * ![](merge.png)\n *\n * `merge` subscribes to each given input Observable (as arguments), and simply\n * forwards (without doing any transformation) all the values from all the input\n * Observables to the output Observable. The output Observable only completes\n * once all input Observables have completed. Any error delivered by an input\n * Observable will be immediately emitted on the output Observable.\n *\n * ## Examples\n *\n * Merge together two Observables: 1s interval and clicks\n *\n * ```ts\n * import { merge, fromEvent, interval } from 'rxjs';\n *\n * const clicks = fromEvent(document, 'click');\n * const timer = interval(1000);\n * const clicksOrTimer = merge(clicks, timer);\n * clicksOrTimer.subscribe(x => console.log(x));\n *\n * // Results in the following:\n * // timer will emit ascending values, one every second(1000ms) to console\n * // clicks logs MouseEvents to console every time the \"document\" is clicked\n * // Since the two streams are merged you see these happening\n * // as they occur.\n * ```\n *\n * Merge together 3 Observables, but run only 2 concurrently\n *\n * ```ts\n * import { interval, take, merge } from 'rxjs';\n *\n * const timer1 = interval(1000).pipe(take(10));\n * const timer2 = interval(2000).pipe(take(6));\n * const timer3 = interval(500).pipe(take(10));\n *\n * const concurrent = 2; // the argument\n * const merged = merge(timer1, timer2, timer3, concurrent);\n * merged.subscribe(x => console.log(x));\n *\n * // Results in the following:\n * // - First timer1 and timer2 will run concurrently\n * // - timer1 will emit a value every 1000ms for 10 iterations\n * // - timer2 will emit a value every 2000ms for 6 iterations\n * // - after timer1 hits its max iteration, timer2 will\n * //   continue, and timer3 will start to run concurrently with timer2\n * // - when timer2 hits its max iteration it terminates, and\n * //   timer3 will continue to emit a value every 500ms until it is complete\n * ```\n *\n * @see {@link mergeAll}\n * @see {@link mergeMap}\n * @see {@link mergeMapTo}\n * @see {@link mergeScan}\n *\n * @param {...ObservableInput} observables Input Observables to merge together.\n * @param {number} [concurrent=Infinity] Maximum number of input\n * Observables being subscribed to concurrently.\n * @param {SchedulerLike} [scheduler=null] The {@link SchedulerLike} to use for managing\n * concurrency of input Observables.\n * @return {Observable} an Observable that emits items that are the result of\n * every input Observable.\n */\nexport function merge(...args: (ObservableInput<unknown> | number | SchedulerLike)[]): Observable<unknown> {\n  const scheduler = popScheduler(args);\n  const concurrent = popNumber(args, Infinity);\n  const sources = args as ObservableInput<unknown>[];\n  return !sources.length\n    ? // No source provided\n      EMPTY\n    : sources.length === 1\n    ? // One source? Just return it.\n      innerFrom(sources[0])\n    : // Merge all sources\n      mergeAll(concurrent)(from(sources, scheduler));\n}\n", "import { OperatorFunction, MonoTypeOperatorFunction, TruthyTypesOf } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/** @deprecated Use a closure instead of a `thisArg`. Signatures accepting a `thisArg` will be removed in v8. */\nexport function filter<T, S extends T, A>(predicate: (this: A, value: T, index: number) => value is S, thisArg: A): OperatorFunction<T, S>;\nexport function filter<T, S extends T>(predicate: (value: T, index: number) => value is S): OperatorFunction<T, S>;\nexport function filter<T>(predicate: BooleanConstructor): OperatorFunction<T, TruthyTypesOf<T>>;\n/** @deprecated Use a closure instead of a `thisArg`. Signatures accepting a `thisArg` will be removed in v8. */\nexport function filter<T, A>(predicate: (this: A, value: T, index: number) => boolean, thisArg: A): MonoTypeOperatorFunction<T>;\nexport function filter<T>(predicate: (value: T, index: number) => boolean): MonoTypeOperatorFunction<T>;\n\n/**\n * Filter items emitted by the source Observable by only emitting those that\n * satisfy a specified predicate.\n *\n * <span class=\"informal\">Like\n * [Array.prototype.filter()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/filter),\n * it only emits a value from the source if it passes a criterion function.</span>\n *\n * ![](filter.png)\n *\n * Similar to the well-known `Array.prototype.filter` method, this operator\n * takes values from the source Observable, passes them through a `predicate`\n * function and only emits those values that yielded `true`.\n *\n * ## Example\n *\n * Emit only click events whose target was a DIV element\n *\n * ```ts\n * import { fromEvent, filter } from 'rxjs';\n *\n * const div = document.createElement('div');\n * div.style.cssText = 'width: 200px; height: 200px; background: #09c;';\n * document.body.appendChild(div);\n *\n * const clicks = fromEvent(document, 'click');\n * const clicksOnDivs = clicks.pipe(filter(ev => (<HTMLElement>ev.target).tagName === 'DIV'));\n * clicksOnDivs.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link distinct}\n * @see {@link distinctUntilChanged}\n * @see {@link distinctUntilKeyChanged}\n * @see {@link ignoreElements}\n * @see {@link partition}\n * @see {@link skip}\n *\n * @param predicate A function that\n * evaluates each value emitted by the source Observable. If it returns `true`,\n * the value is emitted, if `false` the value is not passed to the output\n * Observable. The `index` parameter is the number `i` for the i-th source\n * emission that has happened since the subscription, starting from the number\n * `0`.\n * @param thisArg An optional argument to determine the value of `this`\n * in the `predicate` function.\n * @return A function that returns an Observable that emits items from the\n * source Observable that satisfy the specified `predicate`.\n */\nexport function filter<T>(predicate: (value: T, index: number) => boolean, thisArg?: any): MonoTypeOperatorFunction<T> {\n  return operate((source, subscriber) => {\n    // An index passed to our predicate function on each call.\n    let index = 0;\n\n    // Subscribe to the source, all errors and completions are\n    // forwarded to the consumer.\n    source.subscribe(\n      // Call the predicate with the appropriate `this` context,\n      // if the predicate returns `true`, then send the value\n      // to the consumer.\n      createOperatorSubscriber(subscriber, (value) => predicate.call(thisArg, value, index++) && subscriber.next(value))\n    );\n  });\n}\n", "export {};\n//# sourceMappingURL=types.js.map", "import { OperatorFunction } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * Emits a given value if the source Observable completes without emitting any\n * `next` value, otherwise mirrors the source Observable.\n *\n * <span class=\"informal\">If the source Observable turns out to be empty, then\n * this operator will emit a default value.</span>\n *\n * ![](defaultIfEmpty.png)\n *\n * `defaultIfEmpty` emits the values emitted by the source Observable or a\n * specified default value if the source Observable is empty (completes without\n * having emitted any `next` value).\n *\n * ## Example\n *\n * If no clicks happen in 5 seconds, then emit 'no clicks'\n *\n * ```ts\n * import { fromEvent, takeUntil, interval, defaultIfEmpty } from 'rxjs';\n *\n * const clicks = fromEvent(document, 'click');\n * const clicksBeforeFive = clicks.pipe(takeUntil(interval(5000)));\n * const result = clicksBeforeFive.pipe(defaultIfEmpty('no clicks'));\n * result.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link empty}\n * @see {@link last}\n *\n * @param defaultValue The default value used if the source\n * Observable is empty.\n * @return A function that returns an Observable that emits either the\n * specified `defaultValue` if the source Observable emits no items, or the\n * values emitted by the source Observable.\n */\nexport function defaultIfEmpty<T, R>(defaultValue: R): OperatorFunction<T, T | R> {\n  return operate((source, subscriber) => {\n    let hasValue = false;\n    source.subscribe(\n      createOperatorSubscriber(\n        subscriber,\n        (value) => {\n          hasValue = true;\n          subscriber.next(value);\n        },\n        () => {\n          if (!hasValue) {\n            subscriber.next(defaultValue!);\n          }\n          subscriber.complete();\n        }\n      )\n    );\n  });\n}\n", "import { MonoTypeOperatorFunction } from '../types';\nimport { EMPTY } from '../observable/empty';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * Emits only the first `count` values emitted by the source Observable.\n *\n * <span class=\"informal\">Takes the first `count` values from the source, then\n * completes.</span>\n *\n * ![](take.png)\n *\n * `take` returns an Observable that emits only the first `count` values emitted\n * by the source Observable. If the source emits fewer than `count` values then\n * all of its values are emitted. After that, it completes, regardless if the\n * source completes.\n *\n * ## Example\n *\n * Take the first 5 seconds of an infinite 1-second interval Observable\n *\n * ```ts\n * import { interval, take } from 'rxjs';\n *\n * const intervalCount = interval(1000);\n * const takeFive = intervalCount.pipe(take(5));\n * takeFive.subscribe(x => console.log(x));\n *\n * // Logs:\n * // 0\n * // 1\n * // 2\n * // 3\n * // 4\n * ```\n *\n * @see {@link takeLast}\n * @see {@link takeUntil}\n * @see {@link takeWhile}\n * @see {@link skip}\n *\n * @param count The maximum number of `next` values to emit.\n * @return A function that returns an Observable that emits only the first\n * `count` values emitted by the source Observable, or all of the values from\n * the source if the source emits fewer than `count` values.\n */\nexport function take<T>(count: number): MonoTypeOperatorFunction<T> {\n  return count <= 0\n    ? // If we are taking no values, that's empty.\n      () => EMPTY\n    : operate((source, subscriber) => {\n        let seen = 0;\n        source.subscribe(\n          createOperatorSubscriber(subscriber, (value) => {\n            // Increment the number of values we have seen,\n            // then check it against the allowed count to see\n            // if we are still letting values through.\n            if (++seen <= count) {\n              subscriber.next(value);\n              // If we have met or passed our allowed count,\n              // we need to complete. We have to do <= here,\n              // because re-entrant code will increment `seen` twice.\n              if (count <= seen) {\n                subscriber.complete();\n              }\n            }\n          })\n        );\n      });\n}\n", "import { OperatorFunction } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { noop } from '../util/noop';\n\n/**\n * Ignores all items emitted by the source Observable and only passes calls of `complete` or `error`.\n *\n * ![](ignoreElements.png)\n *\n * The `ignoreElements` operator suppresses all items emitted by the source Observable,\n * but allows its termination notification (either `error` or `complete`) to pass through unchanged.\n *\n * If you do not care about the items being emitted by an Observable, but you do want to be notified\n * when it completes or when it terminates with an error, you can apply the `ignoreElements` operator\n * to the Observable, which will ensure that it will never call its observers\u2019 `next` handlers.\n *\n * ## Example\n *\n * Ignore all `next` emissions from the source\n *\n * ```ts\n * import { of, ignoreElements } from 'rxjs';\n *\n * of('you', 'talking', 'to', 'me')\n *   .pipe(ignoreElements())\n *   .subscribe({\n *     next: word => console.log(word),\n *     error: err => console.log('error:', err),\n *     complete: () => console.log('the end'),\n *   });\n *\n * // result:\n * // 'the end'\n * ```\n *\n * @return A function that returns an empty Observable that only calls\n * `complete` or `error`, based on which one is called by the source\n * Observable.\n */\nexport function ignoreElements(): OperatorFunction<unknown, never> {\n  return operate((source, subscriber) => {\n    source.subscribe(createOperatorSubscriber(subscriber, noop));\n  });\n}\n", "import { EmptyError } from '../util/EmptyError';\nimport { MonoTypeOperatorFunction } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * If the source observable completes without emitting a value, it will emit\n * an error. The error will be created at that time by the optional\n * `errorFactory` argument, otherwise, the error will be {@link EmptyError}.\n *\n * ![](throwIfEmpty.png)\n *\n * ## Example\n *\n * Throw an error if the document wasn't clicked within 1 second\n *\n * ```ts\n * import { fromEvent, takeUntil, timer, throwIfEmpty } from 'rxjs';\n *\n * const click$ = fromEvent(document, 'click');\n *\n * click$.pipe(\n *   takeUntil(timer(1000)),\n *   throwIfEmpty(() => new Error('The document was not clicked within 1 second'))\n * )\n * .subscribe({\n *   next() {\n *    console.log('The document was clicked');\n *   },\n *   error(err) {\n *     console.error(err.message);\n *   }\n * });\n * ```\n *\n * @param errorFactory A factory function called to produce the\n * error to be thrown when the source observable completes without emitting a\n * value.\n * @return A function that returns an Observable that throws an error if the\n * source Observable completed without emitting.\n */\nexport function throwIfEmpty<T>(errorFactory: () => any = defaultErrorFactory): MonoTypeOperatorFunction<T> {\n  return operate((source, subscriber) => {\n    let hasValue = false;\n    source.subscribe(\n      createOperatorSubscriber(\n        subscriber,\n        (value) => {\n          hasValue = true;\n          subscriber.next(value);\n        },\n        () => (hasValue ? subscriber.complete() : subscriber.error(errorFactory()))\n      )\n    );\n  });\n}\n\nfunction defaultErrorFactory() {\n  return new EmptyError();\n}\n", "import { Observable } from '../Observable';\nimport { EmptyError } from '../util/EmptyError';\nimport { OperatorFunction, TruthyTypesOf } from '../types';\nimport { filter } from './filter';\nimport { take } from './take';\nimport { defaultIfEmpty } from './defaultIfEmpty';\nimport { throwIfEmpty } from './throwIfEmpty';\nimport { identity } from '../util/identity';\n\nexport function first<T, D = T>(predicate?: null, defaultValue?: D): OperatorFunction<T, T | D>;\nexport function first<T>(predicate: BooleanConstructor): OperatorFunction<T, TruthyTypesOf<T>>;\nexport function first<T, D>(predicate: BooleanConstructor, defaultValue: D): OperatorFunction<T, TruthyTypesOf<T> | D>;\nexport function first<T, S extends T>(\n  predicate: (value: T, index: number, source: Observable<T>) => value is S,\n  defaultValue?: S\n): OperatorFunction<T, S>;\nexport function first<T, S extends T, D>(\n  predicate: (value: T, index: number, source: Observable<T>) => value is S,\n  defaultValue: D\n): OperatorFunction<T, S | D>;\nexport function first<T, D = T>(\n  predicate: (value: T, index: number, source: Observable<T>) => boolean,\n  defaultValue?: D\n): OperatorFunction<T, T | D>;\n\n/**\n * Emits only the first value (or the first value that meets some condition)\n * emitted by the source Observable.\n *\n * <span class=\"informal\">Emits only the first value. Or emits only the first\n * value that passes some test.</span>\n *\n * ![](first.png)\n *\n * If called with no arguments, `first` emits the first value of the source\n * Observable, then completes. If called with a `predicate` function, `first`\n * emits the first value of the source that matches the specified condition. Throws an error if\n * `defaultValue` was not provided and a matching element is not found.\n *\n * ## Examples\n *\n * Emit only the first click that happens on the DOM\n *\n * ```ts\n * import { fromEvent, first } from 'rxjs';\n *\n * const clicks = fromEvent(document, 'click');\n * const result = clicks.pipe(first());\n * result.subscribe(x => console.log(x));\n * ```\n *\n * Emits the first click that happens on a DIV\n *\n * ```ts\n * import { fromEvent, first } from 'rxjs';\n *\n * const div = document.createElement('div');\n * div.style.cssText = 'width: 200px; height: 200px; background: #09c;';\n * document.body.appendChild(div);\n *\n * const clicks = fromEvent(document, 'click');\n * const result = clicks.pipe(first(ev => (<HTMLElement>ev.target).tagName === 'DIV'));\n * result.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link filter}\n * @see {@link find}\n * @see {@link take}\n *\n * @throws {EmptyError} Delivers an EmptyError to the Observer's `error`\n * callback if the Observable completes before any `next` notification was sent.\n * This is how `first()` is different from {@link take}(1) which completes instead.\n *\n * @param {function(value: T, index: number, source: Observable<T>): boolean} [predicate]\n * An optional function called with each item to test for condition matching.\n * @param {D} [defaultValue] The default value emitted in case no valid value\n * was found on the source.\n * @return A function that returns an Observable that emits the first item that\n * matches the condition.\n */\nexport function first<T, D>(\n  predicate?: ((value: T, index: number, source: Observable<T>) => boolean) | null,\n  defaultValue?: D\n): OperatorFunction<T, T | D> {\n  const hasDefaultValue = arguments.length >= 2;\n  return (source: Observable<T>) =>\n    source.pipe(\n      predicate ? filter((v, i) => predicate(v, i, source)) : identity,\n      take(1),\n      hasDefaultValue ? defaultIfEmpty(defaultValue!) : throwIfEmpty(() => new EmptyError())\n    );\n}\n", "import { innerFrom } from '../observable/innerFrom';\nimport { Subject } from '../Subject';\nimport { SafeSubscriber } from '../Subscriber';\nimport { Subscription } from '../Subscription';\nimport { MonoTypeOperatorFunction, SubjectLike, ObservableInput } from '../types';\nimport { operate } from '../util/lift';\n\nexport interface ShareConfig<T> {\n  /**\n   * The factory used to create the subject that will connect the source observable to\n   * multicast consumers.\n   */\n  connector?: () => SubjectLike<T>;\n  /**\n   * If `true`, the resulting observable will reset internal state on error from source and return to a \"cold\" state. This\n   * allows the resulting observable to be \"retried\" in the event of an error.\n   * If `false`, when an error comes from the source it will push the error into the connecting subject, and the subject\n   * will remain the connecting subject, meaning the resulting observable will not go \"cold\" again, and subsequent retries\n   * or resubscriptions will resubscribe to that same subject. In all cases, RxJS subjects will emit the same error again, however\n   * {@link ReplaySubject} will also push its buffered values before pushing the error.\n   * It is also possible to pass a notifier factory returning an `ObservableInput` instead which grants more fine-grained\n   * control over how and when the reset should happen. This allows behaviors like conditional or delayed resets.\n   */\n  resetOnError?: boolean | ((error: any) => ObservableInput<any>);\n  /**\n   * If `true`, the resulting observable will reset internal state on completion from source and return to a \"cold\" state. This\n   * allows the resulting observable to be \"repeated\" after it is done.\n   * If `false`, when the source completes, it will push the completion through the connecting subject, and the subject\n   * will remain the connecting subject, meaning the resulting observable will not go \"cold\" again, and subsequent repeats\n   * or resubscriptions will resubscribe to that same subject.\n   * It is also possible to pass a notifier factory returning an `ObservableInput` instead which grants more fine-grained\n   * control over how and when the reset should happen. This allows behaviors like conditional or delayed resets.\n   */\n  resetOnComplete?: boolean | (() => ObservableInput<any>);\n  /**\n   * If `true`, when the number of subscribers to the resulting observable reaches zero due to those subscribers unsubscribing, the\n   * internal state will be reset and the resulting observable will return to a \"cold\" state. This means that the next\n   * time the resulting observable is subscribed to, a new subject will be created and the source will be subscribed to\n   * again.\n   * If `false`, when the number of subscribers to the resulting observable reaches zero due to unsubscription, the subject\n   * will remain connected to the source, and new subscriptions to the result will be connected through that same subject.\n   * It is also possible to pass a notifier factory returning an `ObservableInput` instead which grants more fine-grained\n   * control over how and when the reset should happen. This allows behaviors like conditional or delayed resets.\n   */\n  resetOnRefCountZero?: boolean | (() => ObservableInput<any>);\n}\n\nexport function share<T>(): MonoTypeOperatorFunction<T>;\n\nexport function share<T>(options: ShareConfig<T>): MonoTypeOperatorFunction<T>;\n\n/**\n * Returns a new Observable that multicasts (shares) the original Observable. As long as there is at least one\n * Subscriber this Observable will be subscribed and emitting data. When all subscribers have unsubscribed it will\n * unsubscribe from the source Observable. Because the Observable is multicasting it makes the stream `hot`.\n * This is an alias for `multicast(() => new Subject()), refCount()`.\n *\n * The subscription to the underlying source Observable can be reset (unsubscribe and resubscribe for new subscribers),\n * if the subscriber count to the shared observable drops to 0, or if the source Observable errors or completes. It is\n * possible to use notifier factories for the resets to allow for behaviors like conditional or delayed resets. Please\n * note that resetting on error or complete of the source Observable does not behave like a transparent retry or restart\n * of the source because the error or complete will be forwarded to all subscribers and their subscription will be\n * closed. Only new subscribers after a reset on error or complete happened will cause a fresh subscription to the\n * source. To achieve transparent retries or restarts pipe the source through appropriate operators before sharing.\n *\n * ![](share.png)\n *\n * ## Example\n *\n * Generate new multicast Observable from the `source` Observable value\n *\n * ```ts\n * import { interval, tap, map, take, share } from 'rxjs';\n *\n * const source = interval(1000).pipe(\n *   tap(x => console.log('Processing: ', x)),\n *   map(x => x * x),\n *   take(6),\n *   share()\n * );\n *\n * source.subscribe(x => console.log('subscription 1: ', x));\n * source.subscribe(x => console.log('subscription 2: ', x));\n *\n * // Logs:\n * // Processing: 0\n * // subscription 1: 0\n * // subscription 2: 0\n * // Processing: 1\n * // subscription 1: 1\n * // subscription 2: 1\n * // Processing: 2\n * // subscription 1: 4\n * // subscription 2: 4\n * // Processing: 3\n * // subscription 1: 9\n * // subscription 2: 9\n * // Processing: 4\n * // subscription 1: 16\n * // subscription 2: 16\n * // Processing: 5\n * // subscription 1: 25\n * // subscription 2: 25\n * ```\n *\n * ## Example with notifier factory: Delayed reset\n *\n * ```ts\n * import { interval, take, share, timer } from 'rxjs';\n *\n * const source = interval(1000).pipe(\n *   take(3),\n *   share({\n *     resetOnRefCountZero: () => timer(1000)\n *   })\n * );\n *\n * const subscriptionOne = source.subscribe(x => console.log('subscription 1: ', x));\n * setTimeout(() => subscriptionOne.unsubscribe(), 1300);\n *\n * setTimeout(() => source.subscribe(x => console.log('subscription 2: ', x)), 1700);\n *\n * setTimeout(() => source.subscribe(x => console.log('subscription 3: ', x)), 5000);\n *\n * // Logs:\n * // subscription 1:  0\n * // (subscription 1 unsubscribes here)\n * // (subscription 2 subscribes here ~400ms later, source was not reset)\n * // subscription 2:  1\n * // subscription 2:  2\n * // (subscription 2 unsubscribes here)\n * // (subscription 3 subscribes here ~2000ms later, source did reset before)\n * // subscription 3:  0\n * // subscription 3:  1\n * // subscription 3:  2\n * ```\n *\n * @see {@link shareReplay}\n *\n * @return A function that returns an Observable that mirrors the source.\n */\nexport function share<T>(options: ShareConfig<T> = {}): MonoTypeOperatorFunction<T> {\n  const { connector = () => new Subject<T>(), resetOnError = true, resetOnComplete = true, resetOnRefCountZero = true } = options;\n  // It's necessary to use a wrapper here, as the _operator_ must be\n  // referentially transparent. Otherwise, it cannot be used in calls to the\n  // static `pipe` function - to create a partial pipeline.\n  //\n  // The _operator function_ - the function returned by the _operator_ - will\n  // not be referentially transparent - as it shares its source - but the\n  // _operator function_ is called when the complete pipeline is composed via a\n  // call to a source observable's `pipe` method - not when the static `pipe`\n  // function is called.\n  return (wrapperSource) => {\n    let connection: SafeSubscriber<T> | undefined;\n    let resetConnection: Subscription | undefined;\n    let subject: SubjectLike<T> | undefined;\n    let refCount = 0;\n    let hasCompleted = false;\n    let hasErrored = false;\n\n    const cancelReset = () => {\n      resetConnection?.unsubscribe();\n      resetConnection = undefined;\n    };\n    // Used to reset the internal state to a \"cold\"\n    // state, as though it had never been subscribed to.\n    const reset = () => {\n      cancelReset();\n      connection = subject = undefined;\n      hasCompleted = hasErrored = false;\n    };\n    const resetAndUnsubscribe = () => {\n      // We need to capture the connection before\n      // we reset (if we need to reset).\n      const conn = connection;\n      reset();\n      conn?.unsubscribe();\n    };\n\n    return operate<T, T>((source, subscriber) => {\n      refCount++;\n      if (!hasErrored && !hasCompleted) {\n        cancelReset();\n      }\n\n      // Create the subject if we don't have one yet. Grab a local reference to\n      // it as well, which avoids non-null assertions when using it and, if we\n      // connect to it now, then error/complete need a reference after it was\n      // reset.\n      const dest = (subject = subject ?? connector());\n\n      // Add the finalization directly to the subscriber - instead of returning it -\n      // so that the handling of the subscriber's unsubscription will be wired\n      // up _before_ the subscription to the source occurs. This is done so that\n      // the assignment to the source connection's `closed` property will be seen\n      // by synchronous firehose sources.\n      subscriber.add(() => {\n        refCount--;\n\n        // If we're resetting on refCount === 0, and it's 0, we only want to do\n        // that on \"unsubscribe\", really. Resetting on error or completion is a different\n        // configuration.\n        if (refCount === 0 && !hasErrored && !hasCompleted) {\n          resetConnection = handleReset(resetAndUnsubscribe, resetOnRefCountZero);\n        }\n      });\n\n      // The following line adds the subscription to the subscriber passed.\n      // Basically, `subscriber === dest.subscribe(subscriber)` is `true`.\n      dest.subscribe(subscriber);\n\n      if (\n        !connection &&\n        // Check this shareReplay is still activate - it can be reset to 0\n        // and be \"unsubscribed\" _before_ it actually subscribes.\n        // If we were to subscribe then, it'd leak and get stuck.\n        refCount > 0\n      ) {\n        // We need to create a subscriber here - rather than pass an observer and\n        // assign the returned subscription to connection - because it's possible\n        // for reentrant subscriptions to the shared observable to occur and in\n        // those situations we want connection to be already-assigned so that we\n        // don't create another connection to the source.\n        connection = new SafeSubscriber({\n          next: (value) => dest.next(value),\n          error: (err) => {\n            hasErrored = true;\n            cancelReset();\n            resetConnection = handleReset(reset, resetOnError, err);\n            dest.error(err);\n          },\n          complete: () => {\n            hasCompleted = true;\n            cancelReset();\n            resetConnection = handleReset(reset, resetOnComplete);\n            dest.complete();\n          },\n        });\n        innerFrom(source).subscribe(connection);\n      }\n    })(wrapperSource);\n  };\n}\n\nfunction handleReset<T extends unknown[] = never[]>(\n  reset: () => void,\n  on: boolean | ((...args: T) => ObservableInput<any>),\n  ...args: T\n): Subscription | undefined {\n  if (on === true) {\n    reset();\n    return;\n  }\n\n  if (on === false) {\n    return;\n  }\n\n  const onSubscriber = new SafeSubscriber({\n    next: () => {\n      onSubscriber.unsubscribe();\n      reset();\n    },\n  });\n\n  return innerFrom(on(...args)).subscribe(onSubscriber);\n}\n", "import { MonoTypeOperatorFunction, ObservableInput } from '../types';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { innerFrom } from '../observable/innerFrom';\nimport { noop } from '../util/noop';\n\n/**\n * Emits the values emitted by the source Observable until a `notifier`\n * Observable emits a value.\n *\n * <span class=\"informal\">Lets values pass until a second Observable,\n * `notifier`, emits a value. Then, it completes.</span>\n *\n * ![](takeUntil.png)\n *\n * `takeUntil` subscribes and begins mirroring the source Observable. It also\n * monitors a second Observable, `notifier` that you provide. If the `notifier`\n * emits a value, the output Observable stops mirroring the source Observable\n * and completes. If the `notifier` doesn't emit any value and completes\n * then `takeUntil` will pass all values.\n *\n * ## Example\n *\n * Tick every second until the first click happens\n *\n * ```ts\n * import { interval, fromEvent, takeUntil } from 'rxjs';\n *\n * const source = interval(1000);\n * const clicks = fromEvent(document, 'click');\n * const result = source.pipe(takeUntil(clicks));\n * result.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link take}\n * @see {@link takeLast}\n * @see {@link takeWhile}\n * @see {@link skip}\n *\n * @param {Observable} notifier The Observable whose first emitted value will\n * cause the output Observable of `takeUntil` to stop emitting values from the\n * source Observable.\n * @return A function that returns an Observable that emits the values from the\n * source Observable until `notifier` emits its first value.\n */\nexport function takeUntil<T>(notifier: ObservableInput<any>): MonoTypeOperatorFunction<T> {\n  return operate((source, subscriber) => {\n    innerFrom(notifier).subscribe(createOperatorSubscriber(subscriber, () => subscriber.complete(), noop));\n    !subscriber.closed && source.subscribe(subscriber);\n  });\n}\n", "import { MonoTypeOperatorFunction, Observer } from '../types';\nimport { isFunction } from '../util/isFunction';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { identity } from '../util/identity';\n\n/**\n * An extension to the {@link Observer} interface used only by the {@link tap} operator.\n *\n * It provides a useful set of callbacks a user can register to do side-effects in\n * cases other than what the usual {@link Observer} callbacks are\n * ({@link guide/glossary-and-semantics#next next},\n * {@link guide/glossary-and-semantics#error error} and/or\n * {@link guide/glossary-and-semantics#complete complete}).\n *\n * ## Example\n *\n * ```ts\n * import { fromEvent, switchMap, tap, interval, take } from 'rxjs';\n *\n * const source$ = fromEvent(document, 'click');\n * const result$ = source$.pipe(\n *   switchMap((_, i) => i % 2 === 0\n *     ? fromEvent(document, 'mousemove').pipe(\n *         tap({\n *           subscribe: () => console.log('Subscribed to the mouse move events after click #' + i),\n *           unsubscribe: () => console.log('Mouse move events #' + i + ' unsubscribed'),\n *           finalize: () => console.log('Mouse move events #' + i + ' finalized')\n *         })\n *       )\n *     : interval(1_000).pipe(\n *         take(5),\n *         tap({\n *           subscribe: () => console.log('Subscribed to the 1-second interval events after click #' + i),\n *           unsubscribe: () => console.log('1-second interval events #' + i + ' unsubscribed'),\n *           finalize: () => console.log('1-second interval events #' + i + ' finalized')\n *         })\n *       )\n *   )\n * );\n *\n * const subscription = result$.subscribe({\n *   next: console.log\n * });\n *\n * setTimeout(() => {\n *   console.log('Unsubscribe after 60 seconds');\n *   subscription.unsubscribe();\n * }, 60_000);\n * ```\n */\nexport interface TapObserver<T> extends Observer<T> {\n  /**\n   * The callback that `tap` operator invokes at the moment when the source Observable\n   * gets subscribed to.\n   */\n  subscribe: () => void;\n  /**\n   * The callback that `tap` operator invokes when an explicit\n   * {@link guide/glossary-and-semantics#unsubscription unsubscribe} happens. It won't get invoked on\n   * `error` or `complete` events.\n   */\n  unsubscribe: () => void;\n  /**\n   * The callback that `tap` operator invokes when any kind of\n   * {@link guide/glossary-and-semantics#finalization finalization} happens - either when\n   * the source Observable `error`s or `complete`s or when it gets explicitly unsubscribed\n   * by the user. There is no difference in using this callback or the {@link finalize}\n   * operator, but if you're already using `tap` operator, you can use this callback\n   * instead. You'd get the same result in either case.\n   */\n  finalize: () => void;\n}\nexport function tap<T>(observerOrNext?: Partial<TapObserver<T>> | ((value: T) => void)): MonoTypeOperatorFunction<T>;\n/** @deprecated Instead of passing separate callback arguments, use an observer argument. Signatures taking separate callback arguments will be removed in v8. Details: https://rxjs.dev/deprecations/subscribe-arguments */\nexport function tap<T>(\n  next?: ((value: T) => void) | null,\n  error?: ((error: any) => void) | null,\n  complete?: (() => void) | null\n): MonoTypeOperatorFunction<T>;\n\n/**\n * Used to perform side-effects for notifications from the source observable\n *\n * <span class=\"informal\">Used when you want to affect outside state with a notification without altering the notification</span>\n *\n * ![](tap.png)\n *\n * Tap is designed to allow the developer a designated place to perform side effects. While you _could_ perform side-effects\n * inside of a `map` or a `mergeMap`, that would make their mapping functions impure, which isn't always a big deal, but will\n * make it so you can't do things like memoize those functions. The `tap` operator is designed solely for such side-effects to\n * help you remove side-effects from other operations.\n *\n * For any notification, next, error, or complete, `tap` will call the appropriate callback you have provided to it, via a function\n * reference, or a partial observer, then pass that notification down the stream.\n *\n * The observable returned by `tap` is an exact mirror of the source, with one exception: Any error that occurs -- synchronously -- in a handler\n * provided to `tap` will be emitted as an error from the returned observable.\n *\n * > Be careful! You can mutate objects as they pass through the `tap` operator's handlers.\n *\n * The most common use of `tap` is actually for debugging. You can place a `tap(console.log)` anywhere\n * in your observable `pipe`, log out the notifications as they are emitted by the source returned by the previous\n * operation.\n *\n * ## Examples\n *\n * Check a random number before it is handled. Below is an observable that will use a random number between 0 and 1,\n * and emit `'big'` or `'small'` depending on the size of that number. But we wanted to log what the original number\n * was, so we have added a `tap(console.log)`.\n *\n * ```ts\n * import { of, tap, map } from 'rxjs';\n *\n * of(Math.random()).pipe(\n *   tap(console.log),\n *   map(n => n > 0.5 ? 'big' : 'small')\n * ).subscribe(console.log);\n * ```\n *\n * Using `tap` to analyze a value and force an error. Below is an observable where in our system we only\n * want to emit numbers 3 or less we get from another source. We can force our observable to error\n * using `tap`.\n *\n * ```ts\n * import { of, tap } from 'rxjs';\n *\n * const source = of(1, 2, 3, 4, 5);\n *\n * source.pipe(\n *   tap(n => {\n *     if (n > 3) {\n *       throw new TypeError(`Value ${ n } is greater than 3`);\n *     }\n *   })\n * )\n * .subscribe({ next: console.log, error: err => console.log(err.message) });\n * ```\n *\n * We want to know when an observable completes before moving on to the next observable. The system\n * below will emit a random series of `'X'` characters from 3 different observables in sequence. The\n * only way we know when one observable completes and moves to the next one, in this case, is because\n * we have added a `tap` with the side effect of logging to console.\n *\n * ```ts\n * import { of, concatMap, interval, take, map, tap } from 'rxjs';\n *\n * of(1, 2, 3).pipe(\n *   concatMap(n => interval(1000).pipe(\n *     take(Math.round(Math.random() * 10)),\n *     map(() => 'X'),\n *     tap({ complete: () => console.log(`Done with ${ n }`) })\n *   ))\n * )\n * .subscribe(console.log);\n * ```\n *\n * @see {@link finalize}\n * @see {@link TapObserver}\n *\n * @param observerOrNext A next handler or partial observer\n * @param error An error handler\n * @param complete A completion handler\n * @return A function that returns an Observable identical to the source, but\n * runs the specified Observer or callback(s) for each item.\n */\nexport function tap<T>(\n  observerOrNext?: Partial<TapObserver<T>> | ((value: T) => void) | null,\n  error?: ((e: any) => void) | null,\n  complete?: (() => void) | null\n): MonoTypeOperatorFunction<T> {\n  // We have to check to see not only if next is a function,\n  // but if error or complete were passed. This is because someone\n  // could technically call tap like `tap(null, fn)` or `tap(null, null, fn)`.\n  const tapObserver =\n    isFunction(observerOrNext) || error || complete\n      ? // tslint:disable-next-line: no-object-literal-type-assertion\n        ({ next: observerOrNext as Exclude<typeof observerOrNext, Partial<TapObserver<T>>>, error, complete } as Partial<TapObserver<T>>)\n      : observerOrNext;\n\n  return tapObserver\n    ? operate((source, subscriber) => {\n        tapObserver.subscribe?.();\n        let isUnsub = true;\n        source.subscribe(\n          createOperatorSubscriber(\n            subscriber,\n            (value) => {\n              tapObserver.next?.(value);\n              subscriber.next(value);\n            },\n            () => {\n              isUnsub = false;\n              tapObserver.complete?.();\n              subscriber.complete();\n            },\n            (err) => {\n              isUnsub = false;\n              tapObserver.error?.(err);\n              subscriber.error(err);\n            },\n            () => {\n              if (isUnsub) {\n                tapObserver.unsubscribe?.();\n              }\n              tapObserver.finalize?.();\n            }\n          )\n        );\n      })\n    : // Tap was called with no valid tap observer or handler\n      // (e.g. `tap(null, null, null)` or `tap(null)` or `tap()`)\n      // so we're going to just mirror the source.\n      identity;\n}\n", "//////////////////////////////////////////////////////////\n// Here we need to reference our other deep imports\n// so VS code will figure out where they are\n// see conversation here:\n// https://github.com/microsoft/TypeScript/issues/43034\n//////////////////////////////////////////////////////////\n\n// tslint:disable: no-reference\n// It's tempting to add references to all of the deep-import locations, but\n// adding references to those that require DOM types breaks Node projects.\n/// <reference path=\"./operators/index.ts\" />\n/// <reference path=\"./testing/index.ts\" />\n// tslint:enable: no-reference\n\n/* Observable */\nexport { Observable } from './internal/Observable';\nexport { ConnectableObservable } from './internal/observable/ConnectableObservable';\nexport { GroupedObservable } from './internal/operators/groupBy';\nexport { Operator } from './internal/Operator';\nexport { observable } from './internal/symbol/observable';\nexport { animationFrames } from './internal/observable/dom/animationFrames';\n\n/* Subjects */\nexport { Subject } from './internal/Subject';\nexport { BehaviorSubject } from './internal/BehaviorSubject';\nexport { ReplaySubject } from './internal/ReplaySubject';\nexport { AsyncSubject } from './internal/AsyncSubject';\n\n/* Schedulers */\nexport { asap, asapScheduler } from './internal/scheduler/asap';\nexport { async, asyncScheduler } from './internal/scheduler/async';\nexport { queue, queueScheduler } from './internal/scheduler/queue';\nexport { animationFrame, animationFrameScheduler } from './internal/scheduler/animationFrame';\nexport { VirtualTimeScheduler, VirtualAction } from './internal/scheduler/VirtualTimeScheduler';\nexport { Scheduler } from './internal/Scheduler';\n\n/* Subscription */\nexport { Subscription } from './internal/Subscription';\nexport { Subscriber } from './internal/Subscriber';\n\n/* Notification */\nexport { Notification, NotificationKind } from './internal/Notification';\n\n/* Utils */\nexport { pipe } from './internal/util/pipe';\nexport { noop } from './internal/util/noop';\nexport { identity } from './internal/util/identity';\nexport { isObservable } from './internal/util/isObservable';\n\n/* Promise Conversion */\nexport { lastValueFrom } from './internal/lastValueFrom';\nexport { firstValueFrom } from './internal/firstValueFrom';\n\n/* Error types */\nexport { ArgumentOutOfRangeError } from './internal/util/ArgumentOutOfRangeError';\nexport { EmptyError } from './internal/util/EmptyError';\nexport { NotFoundError } from './internal/util/NotFoundError';\nexport { ObjectUnsubscribedError } from './internal/util/ObjectUnsubscribedError';\nexport { SequenceError } from './internal/util/SequenceError';\nexport { TimeoutError } from './internal/operators/timeout';\nexport { UnsubscriptionError } from './internal/util/UnsubscriptionError';\n\n/* Static observable creation exports */\nexport { bindCallback } from './internal/observable/bindCallback';\nexport { bindNodeCallback } from './internal/observable/bindNodeCallback';\nexport { combineLatest } from './internal/observable/combineLatest';\nexport { concat } from './internal/observable/concat';\nexport { connectable } from './internal/observable/connectable';\nexport { defer } from './internal/observable/defer';\nexport { empty } from './internal/observable/empty';\nexport { forkJoin } from './internal/observable/forkJoin';\nexport { from } from './internal/observable/from';\nexport { fromEvent } from './internal/observable/fromEvent';\nexport { fromEventPattern } from './internal/observable/fromEventPattern';\nexport { generate } from './internal/observable/generate';\nexport { iif } from './internal/observable/iif';\nexport { interval } from './internal/observable/interval';\nexport { merge } from './internal/observable/merge';\nexport { never } from './internal/observable/never';\nexport { of } from './internal/observable/of';\nexport { onErrorResumeNext } from './internal/observable/onErrorResumeNext';\nexport { pairs } from './internal/observable/pairs';\nexport { partition } from './internal/observable/partition';\nexport { race } from './internal/observable/race';\nexport { range } from './internal/observable/range';\nexport { throwError } from './internal/observable/throwError';\nexport { timer } from './internal/observable/timer';\nexport { using } from './internal/observable/using';\nexport { zip } from './internal/observable/zip';\nexport { scheduled } from './internal/scheduled/scheduled';\n\n/* Constants */\nexport { EMPTY } from './internal/observable/empty';\nexport { NEVER } from './internal/observable/never';\n\n/* Types */\nexport * from './internal/types';\n\n/* Config */\nexport { config, GlobalConfig } from './internal/config';\n\n/* Operators */\nexport { audit } from './internal/operators/audit';\nexport { auditTime } from './internal/operators/auditTime';\nexport { buffer } from './internal/operators/buffer';\nexport { bufferCount } from './internal/operators/bufferCount';\nexport { bufferTime } from './internal/operators/bufferTime';\nexport { bufferToggle } from './internal/operators/bufferToggle';\nexport { bufferWhen } from './internal/operators/bufferWhen';\nexport { catchError } from './internal/operators/catchError';\nexport { combineAll } from './internal/operators/combineAll';\nexport { combineLatestAll } from './internal/operators/combineLatestAll';\nexport { combineLatestWith } from './internal/operators/combineLatestWith';\nexport { concatAll } from './internal/operators/concatAll';\nexport { concatMap } from './internal/operators/concatMap';\nexport { concatMapTo } from './internal/operators/concatMapTo';\nexport { concatWith } from './internal/operators/concatWith';\nexport { connect, ConnectConfig } from './internal/operators/connect';\nexport { count } from './internal/operators/count';\nexport { debounce } from './internal/operators/debounce';\nexport { debounceTime } from './internal/operators/debounceTime';\nexport { defaultIfEmpty } from './internal/operators/defaultIfEmpty';\nexport { delay } from './internal/operators/delay';\nexport { delayWhen } from './internal/operators/delayWhen';\nexport { dematerialize } from './internal/operators/dematerialize';\nexport { distinct } from './internal/operators/distinct';\nexport { distinctUntilChanged } from './internal/operators/distinctUntilChanged';\nexport { distinctUntilKeyChanged } from './internal/operators/distinctUntilKeyChanged';\nexport { elementAt } from './internal/operators/elementAt';\nexport { endWith } from './internal/operators/endWith';\nexport { every } from './internal/operators/every';\nexport { exhaust } from './internal/operators/exhaust';\nexport { exhaustAll } from './internal/operators/exhaustAll';\nexport { exhaustMap } from './internal/operators/exhaustMap';\nexport { expand } from './internal/operators/expand';\nexport { filter } from './internal/operators/filter';\nexport { finalize } from './internal/operators/finalize';\nexport { find } from './internal/operators/find';\nexport { findIndex } from './internal/operators/findIndex';\nexport { first } from './internal/operators/first';\nexport { groupBy, BasicGroupByOptions, GroupByOptionsWithElement } from './internal/operators/groupBy';\nexport { ignoreElements } from './internal/operators/ignoreElements';\nexport { isEmpty } from './internal/operators/isEmpty';\nexport { last } from './internal/operators/last';\nexport { map } from './internal/operators/map';\nexport { mapTo } from './internal/operators/mapTo';\nexport { materialize } from './internal/operators/materialize';\nexport { max } from './internal/operators/max';\nexport { mergeAll } from './internal/operators/mergeAll';\nexport { flatMap } from './internal/operators/flatMap';\nexport { mergeMap } from './internal/operators/mergeMap';\nexport { mergeMapTo } from './internal/operators/mergeMapTo';\nexport { mergeScan } from './internal/operators/mergeScan';\nexport { mergeWith } from './internal/operators/mergeWith';\nexport { min } from './internal/operators/min';\nexport { multicast } from './internal/operators/multicast';\nexport { observeOn } from './internal/operators/observeOn';\nexport { onErrorResumeNextWith } from './internal/operators/onErrorResumeNextWith';\nexport { pairwise } from './internal/operators/pairwise';\nexport { pluck } from './internal/operators/pluck';\nexport { publish } from './internal/operators/publish';\nexport { publishBehavior } from './internal/operators/publishBehavior';\nexport { publishLast } from './internal/operators/publishLast';\nexport { publishReplay } from './internal/operators/publishReplay';\nexport { raceWith } from './internal/operators/raceWith';\nexport { reduce } from './internal/operators/reduce';\nexport { repeat, RepeatConfig } from './internal/operators/repeat';\nexport { repeatWhen } from './internal/operators/repeatWhen';\nexport { retry, RetryConfig } from './internal/operators/retry';\nexport { retryWhen } from './internal/operators/retryWhen';\nexport { refCount } from './internal/operators/refCount';\nexport { sample } from './internal/operators/sample';\nexport { sampleTime } from './internal/operators/sampleTime';\nexport { scan } from './internal/operators/scan';\nexport { sequenceEqual } from './internal/operators/sequenceEqual';\nexport { share, ShareConfig } from './internal/operators/share';\nexport { shareReplay, ShareReplayConfig } from './internal/operators/shareReplay';\nexport { single } from './internal/operators/single';\nexport { skip } from './internal/operators/skip';\nexport { skipLast } from './internal/operators/skipLast';\nexport { skipUntil } from './internal/operators/skipUntil';\nexport { skipWhile } from './internal/operators/skipWhile';\nexport { startWith } from './internal/operators/startWith';\nexport { subscribeOn } from './internal/operators/subscribeOn';\nexport { switchAll } from './internal/operators/switchAll';\nexport { switchMap } from './internal/operators/switchMap';\nexport { switchMapTo } from './internal/operators/switchMapTo';\nexport { switchScan } from './internal/operators/switchScan';\nexport { take } from './internal/operators/take';\nexport { takeLast } from './internal/operators/takeLast';\nexport { takeUntil } from './internal/operators/takeUntil';\nexport { takeWhile } from './internal/operators/takeWhile';\nexport { tap, TapObserver } from './internal/operators/tap';\nexport { throttle, ThrottleConfig } from './internal/operators/throttle';\nexport { throttleTime } from './internal/operators/throttleTime';\nexport { throwIfEmpty } from './internal/operators/throwIfEmpty';\nexport { timeInterval } from './internal/operators/timeInterval';\nexport { timeout, TimeoutConfig, TimeoutInfo } from './internal/operators/timeout';\nexport { timeoutWith } from './internal/operators/timeoutWith';\nexport { timestamp } from './internal/operators/timestamp';\nexport { toArray } from './internal/operators/toArray';\nexport { window } from './internal/operators/window';\nexport { windowCount } from './internal/operators/windowCount';\nexport { windowTime } from './internal/operators/windowTime';\nexport { windowToggle } from './internal/operators/windowToggle';\nexport { windowWhen } from './internal/operators/windowWhen';\nexport { withLatestFrom } from './internal/operators/withLatestFrom';\nexport { zipAll } from './internal/operators/zipAll';\nexport { zipWith } from './internal/operators/zipWith';\n", "import { Observable } from \"rxjs\";\nimport { TraceContext, trace } from \"@ledgerhq/logs\";\nconst TagId = 0x05;\n\n/**\n * Creates a list of chunked buffer from one buffer\n *\n * If this is using a Node buffer: the chunked buffers reference to the same memory as the original buffer.\n * If this is using a Uint8Array: each part of the original buffer is copied into the chunked buffers\n *\n * @param buffer a Node Buffer, or a Uint8Array\n * @param sizeForIndex A function that takes an index (on the buffer) and returns the size of the chunk at that index\n * @returns a list of chunked buffers\n */\nfunction createChunkedBuffers(\n  buffer: Buffer,\n  sizeForIndex: (arg0: number) => number,\n): Array<Buffer> {\n  const chunks: Buffer[] = [];\n\n  for (let i = 0, size = sizeForIndex(0); i < buffer.length; i += size, size = sizeForIndex(i)) {\n    // If this is a Node buffer: this chunked buffer points to the same memory but with cropped starting and ending indices\n    // `slice` and not `subarray`: this might not be a Node Buffer, but probably only a Uint8Array.\n    chunks.push(buffer.slice(i, i + size));\n  }\n\n  return chunks;\n}\n\n/**\n * Sends an APDU by encoding it into chunks and sending the chunks using the given `write` function\n *\n * @param write The function to send each chunk to the device\n * @param apdu\n * @param mtuSize The negotiated maximum size of the data to be sent in one chunk\n * @param options Optional options containing:\n *   - context An optional context object for log/tracing strategy\n * @returns An observable that will only emit if an error occurred, otherwise it will complete\n */\nexport const sendAPDU = (\n  write: (arg0: Buffer) => Promise<void>,\n  apdu: Buffer,\n  mtuSize: number,\n  { context }: { context?: TraceContext } = {},\n): Observable<Buffer> => {\n  // Prepares the data to be sent in chunks, by adding a header to chunked of the APDU\n  // The first chunk will contain the total length of the APDU, which reduces the size of the data written in the first chunk.\n  // The total length of the APDU is encoded in 2 bytes (so 5 bytes for the header with the tag id and the chunk index).\n  const chunks = createChunkedBuffers(apdu, i => mtuSize - (i === 0 ? 5 : 3)).map((buffer, i) => {\n    const head = Buffer.alloc(i === 0 ? 5 : 3);\n    head.writeUInt8(TagId, 0);\n    // Index of the chunk as the 2 next bytes\n    head.writeUInt16BE(i, 1);\n\n    // The total length of the APDU is written on the first chunk\n    if (i === 0) {\n      head.writeUInt16BE(apdu.length, 3);\n    }\n\n    // No 0-padding is needed\n    return Buffer.concat([head, buffer]);\n  });\n\n  return new Observable(o => {\n    let terminated = false;\n\n    async function main() {\n      for (const chunk of chunks) {\n        if (terminated) return;\n        await write(chunk);\n      }\n    }\n\n    main().then(\n      () => {\n        terminated = true;\n        o.complete();\n      },\n      error => {\n        terminated = true;\n        trace({\n          type: \"ble-error\",\n          message: `sendAPDU failure: ${error}`,\n          data: { error },\n          context,\n        });\n        o.error(error);\n      },\n    );\n\n    const unsubscribe = () => {\n      if (!terminated) {\n        trace({\n          type: \"ble-error\",\n          message: \"sendAPDU interruption\",\n          context,\n        });\n        terminated = true;\n      }\n    };\n\n    return unsubscribe;\n  });\n};\n", "import { TransportError, DisconnectedDevice } from \"@ledgerhq/errors\";\nimport { Observable, ReplaySubject, takeUntil } from \"rxjs\";\nimport { TraceContext, trace } from \"@ledgerhq/logs\";\nconst TagId = 0x05;\n\n/**\n * Parses a raw stream coming from a BLE communication into an APDU response\n *\n * @param rawStream An observable containing the raw stream as emitted buffers\n * @param options Optional options containing:\n *   - context An optional context object for log/tracing strategy\n * @returns An observable containing the APDU response as one emitted buffer\n */\nexport const receiveAPDU = (\n  rawStream: Observable<Buffer | Error>,\n  { context }: { context?: TraceContext } = {},\n): Observable<Buffer> =>\n  new Observable(o => {\n    let notifiedIndex = 0;\n    let notifiedDataLength = 0;\n    let notifiedData = Buffer.alloc(0);\n    const subscriptionCleaner = new ReplaySubject<void>();\n\n    // The raw stream is listened/subscribed to until a full message (that can be made of several frames) is received\n    rawStream.pipe(takeUntil(subscriptionCleaner)).subscribe({\n      complete: () => {\n        o.error(new DisconnectedDevice());\n      },\n      error: error => {\n        trace({\n          type: \"ble-error\",\n          message: `Error in receiveAPDU: ${error}`,\n          data: { error },\n          context,\n        });\n        o.error(error);\n      },\n      next: value => {\n        // Silences emitted errors in next\n        if (value instanceof Error) {\n          trace({\n            type: \"ble-error\",\n            message: `Error emitted to receiveAPDU next: ${value}`,\n            data: { error: value },\n            context,\n          });\n\n          return;\n        }\n\n        const tag = value.readUInt8(0);\n        const chunkIndex = value.readUInt16BE(1);\n        // `slice` and not `subarray`: this is not a Node Buffer, but probably only a Uint8Array.\n        let chunkData = value.slice(3);\n\n        if (tag !== TagId) {\n          o.error(new TransportError(\"Invalid tag \" + tag.toString(16), \"InvalidTag\"));\n          return;\n        }\n\n        // A chunk was probably missed\n        if (notifiedIndex !== chunkIndex) {\n          o.error(\n            new TransportError(\n              `BLE: Invalid sequence number. discontinued chunk. Received ${chunkIndex} but expected ${notifiedIndex}`,\n              \"InvalidSequence\",\n            ),\n          );\n          return;\n        }\n\n        // The total length of the response is located on the next 2 bytes on the 1st chunk\n        if (chunkIndex === 0) {\n          notifiedDataLength = chunkData.readUInt16BE(0);\n          // `slice` and not `subarray`: this is not a Node Buffer, but probably only a Uint8Array.\n          chunkData = chunkData.slice(2);\n        }\n\n        notifiedIndex++;\n        // The cost of creating a new buffer for each received chunk is low because the response is often contained in 1 chunk.\n        // Allocating `notifiedData` buffer with the received total length and mutating it will probably not improve any performance.\n        notifiedData = Buffer.concat([notifiedData, chunkData]);\n\n        if (notifiedData.length > notifiedDataLength) {\n          o.error(\n            new TransportError(\n              `BLE: received too much data. discontinued chunk. Received ${notifiedData.length} but expected ${notifiedDataLength}`,\n              \"BLETooMuchData\",\n            ),\n          );\n          return;\n        }\n\n        if (notifiedData.length === notifiedDataLength) {\n          o.next(notifiedData);\n          o.complete();\n          // Tries to unsubscribe from the raw stream as soon as we complete the parent observer\n          subscriptionCleaner.next();\n        }\n      },\n    });\n\n    return () => {\n      subscriptionCleaner.next();\n    };\n  });\n", "/* Operator exports */\nexport { audit } from '../internal/operators/audit';\nexport { auditTime } from '../internal/operators/auditTime';\nexport { buffer } from '../internal/operators/buffer';\nexport { bufferCount } from '../internal/operators/bufferCount';\nexport { bufferTime } from '../internal/operators/bufferTime';\nexport { bufferToggle } from '../internal/operators/bufferToggle';\nexport { bufferWhen } from '../internal/operators/bufferWhen';\nexport { catchError } from '../internal/operators/catchError';\nexport { combineAll } from '../internal/operators/combineAll';\nexport { combineLatestAll } from '../internal/operators/combineLatestAll';\nexport { combineLatest } from '../internal/operators/combineLatest';\nexport { combineLatestWith } from '../internal/operators/combineLatestWith';\nexport { concat } from '../internal/operators/concat';\nexport { concatAll } from '../internal/operators/concatAll';\nexport { concatMap } from '../internal/operators/concatMap';\nexport { concatMapTo } from '../internal/operators/concatMapTo';\nexport { concatWith } from '../internal/operators/concatWith';\nexport { connect, ConnectConfig } from '../internal/operators/connect';\nexport { count } from '../internal/operators/count';\nexport { debounce } from '../internal/operators/debounce';\nexport { debounceTime } from '../internal/operators/debounceTime';\nexport { defaultIfEmpty } from '../internal/operators/defaultIfEmpty';\nexport { delay } from '../internal/operators/delay';\nexport { delayWhen } from '../internal/operators/delayWhen';\nexport { dematerialize } from '../internal/operators/dematerialize';\nexport { distinct } from '../internal/operators/distinct';\nexport { distinctUntilChanged } from '../internal/operators/distinctUntilChanged';\nexport { distinctUntilKeyChanged } from '../internal/operators/distinctUntilKeyChanged';\nexport { elementAt } from '../internal/operators/elementAt';\nexport { endWith } from '../internal/operators/endWith';\nexport { every } from '../internal/operators/every';\nexport { exhaust } from '../internal/operators/exhaust';\nexport { exhaustAll } from '../internal/operators/exhaustAll';\nexport { exhaustMap } from '../internal/operators/exhaustMap';\nexport { expand } from '../internal/operators/expand';\nexport { filter } from '../internal/operators/filter';\nexport { finalize } from '../internal/operators/finalize';\nexport { find } from '../internal/operators/find';\nexport { findIndex } from '../internal/operators/findIndex';\nexport { first } from '../internal/operators/first';\nexport { groupBy, BasicGroupByOptions, GroupByOptionsWithElement } from '../internal/operators/groupBy';\nexport { ignoreElements } from '../internal/operators/ignoreElements';\nexport { isEmpty } from '../internal/operators/isEmpty';\nexport { last } from '../internal/operators/last';\nexport { map } from '../internal/operators/map';\nexport { mapTo } from '../internal/operators/mapTo';\nexport { materialize } from '../internal/operators/materialize';\nexport { max } from '../internal/operators/max';\nexport { merge } from '../internal/operators/merge';\nexport { mergeAll } from '../internal/operators/mergeAll';\nexport { flatMap } from '../internal/operators/flatMap';\nexport { mergeMap } from '../internal/operators/mergeMap';\nexport { mergeMapTo } from '../internal/operators/mergeMapTo';\nexport { mergeScan } from '../internal/operators/mergeScan';\nexport { mergeWith } from '../internal/operators/mergeWith';\nexport { min } from '../internal/operators/min';\nexport { multicast } from '../internal/operators/multicast';\nexport { observeOn } from '../internal/operators/observeOn';\nexport { onErrorResumeNext } from '../internal/operators/onErrorResumeNextWith';\nexport { pairwise } from '../internal/operators/pairwise';\nexport { partition } from '../internal/operators/partition';\nexport { pluck } from '../internal/operators/pluck';\nexport { publish } from '../internal/operators/publish';\nexport { publishBehavior } from '../internal/operators/publishBehavior';\nexport { publishLast } from '../internal/operators/publishLast';\nexport { publishReplay } from '../internal/operators/publishReplay';\nexport { race } from '../internal/operators/race';\nexport { raceWith } from '../internal/operators/raceWith';\nexport { reduce } from '../internal/operators/reduce';\nexport { repeat, RepeatConfig } from '../internal/operators/repeat';\nexport { repeatWhen } from '../internal/operators/repeatWhen';\nexport { retry, RetryConfig } from '../internal/operators/retry';\nexport { retryWhen } from '../internal/operators/retryWhen';\nexport { refCount } from '../internal/operators/refCount';\nexport { sample } from '../internal/operators/sample';\nexport { sampleTime } from '../internal/operators/sampleTime';\nexport { scan } from '../internal/operators/scan';\nexport { sequenceEqual } from '../internal/operators/sequenceEqual';\nexport { share, ShareConfig } from '../internal/operators/share';\nexport { shareReplay, ShareReplayConfig } from '../internal/operators/shareReplay';\nexport { single } from '../internal/operators/single';\nexport { skip } from '../internal/operators/skip';\nexport { skipLast } from '../internal/operators/skipLast';\nexport { skipUntil } from '../internal/operators/skipUntil';\nexport { skipWhile } from '../internal/operators/skipWhile';\nexport { startWith } from '../internal/operators/startWith';\nexport { subscribeOn } from '../internal/operators/subscribeOn';\nexport { switchAll } from '../internal/operators/switchAll';\nexport { switchMap } from '../internal/operators/switchMap';\nexport { switchMapTo } from '../internal/operators/switchMapTo';\nexport { switchScan } from '../internal/operators/switchScan';\nexport { take } from '../internal/operators/take';\nexport { takeLast } from '../internal/operators/takeLast';\nexport { takeUntil } from '../internal/operators/takeUntil';\nexport { takeWhile } from '../internal/operators/takeWhile';\nexport { tap, TapObserver } from '../internal/operators/tap';\nexport { throttle, ThrottleConfig } from '../internal/operators/throttle';\nexport { throttleTime } from '../internal/operators/throttleTime';\nexport { throwIfEmpty } from '../internal/operators/throwIfEmpty';\nexport { timeInterval } from '../internal/operators/timeInterval';\nexport { timeout, TimeoutConfig, TimeoutInfo } from '../internal/operators/timeout';\nexport { timeoutWith } from '../internal/operators/timeoutWith';\nexport { timestamp } from '../internal/operators/timestamp';\nexport { toArray } from '../internal/operators/toArray';\nexport { window } from '../internal/operators/window';\nexport { windowCount } from '../internal/operators/windowCount';\nexport { windowTime } from '../internal/operators/windowTime';\nexport { windowToggle } from '../internal/operators/windowToggle';\nexport { windowWhen } from '../internal/operators/windowWhen';\nexport { withLatestFrom } from '../internal/operators/withLatestFrom';\nexport { zip } from '../internal/operators/zip';\nexport { zipAll } from '../internal/operators/zipAll';\nexport { zipWith } from '../internal/operators/zipWith';\n", "import { Observable } from \"rxjs\";\nimport type { Characteristic } from \"./types\";\nimport { log } from \"@ledgerhq/logs\";\n\nexport const monitorCharacteristic = (characteristic: Characteristic): Observable<Buffer> =>\n  Observable.create(o => {\n    log(\"ble-verbose\", \"start monitor \" + characteristic.uuid);\n\n    function onCharacteristicValueChanged(event) {\n      const characteristic = event.target;\n\n      if (characteristic.value) {\n        o.next(Buffer.from(characteristic.value.buffer));\n      }\n    }\n\n    characteristic.startNotifications().then(() => {\n      characteristic.addEventListener(\"characteristicvaluechanged\", onCharacteristicValueChanged);\n    });\n    return () => {\n      log(\"ble-verbose\", \"end monitor \" + characteristic.uuid);\n      characteristic.stopNotifications();\n    };\n  });\n", "/* eslint-disable prefer-template */\nimport Transport from \"@ledgerhq/hw-transport\";\nimport { DisconnectedDevice, TransportOpenUserCancelled } from \"@ledgerhq/errors\";\nimport { getBluetoothServiceUuids, getInfosForServiceUuid } from \"@ledgerhq/devices\";\nimport type { DeviceModel } from \"@ledgerhq/devices\";\nimport { sendAPDU } from \"@ledgerhq/devices/ble/sendAPDU\";\nimport { receiveAPDU } from \"@ledgerhq/devices/ble/receiveAPDU\";\nimport { log } from \"@ledgerhq/logs\";\nimport { Observable, Subscription, defer, merge, from, firstValueFrom } from \"rxjs\";\nimport { share, ignoreElements, first, map, tap } from \"rxjs/operators\";\nimport type { Device, Characteristic } from \"./types\";\nimport { monitorCharacteristic } from \"./monitorCharacteristic\";\n\nconst requiresBluetooth = () => {\n  // $FlowFixMe\n  const { bluetooth } = navigator;\n\n  if (typeof bluetooth === \"undefined\") {\n    throw new Error(\"web bluetooth not supported\");\n  }\n\n  return bluetooth;\n};\n\nconst availability = (): Observable<boolean> =>\n  Observable.create(observer => {\n    const bluetooth = requiresBluetooth();\n\n    const onAvailabilityChanged = e => {\n      observer.next(e.value);\n    };\n\n    bluetooth.addEventListener(\"availabilitychanged\", onAvailabilityChanged);\n    let unsubscribed = false;\n    bluetooth.getAvailability().then(available => {\n      if (!unsubscribed) {\n        observer.next(available);\n      }\n    });\n    return () => {\n      unsubscribed = true;\n      bluetooth.removeEventListener(\"availabilitychanged\", onAvailabilityChanged);\n    };\n  });\n\nconst transportsCache = {};\n\nconst requestDeviceParam = () => ({\n  filters: getBluetoothServiceUuids().map(uuid => ({\n    services: [uuid],\n  })),\n});\n\nconst retrieveService = async device => {\n  if (!device.gatt) throw new Error(\"bluetooth gatt not found\");\n  const [service] = await device.gatt.getPrimaryServices();\n  if (!service) throw new Error(\"bluetooth service not found\");\n  const infos = getInfosForServiceUuid(service.uuid);\n  if (!infos) throw new Error(\"bluetooth service infos not found\");\n  return [service, infos];\n};\n\nasync function open(deviceOrId: Device | string, needsReconnect: boolean) {\n  let device;\n\n  if (typeof deviceOrId === \"string\") {\n    if (transportsCache[deviceOrId]) {\n      log(\"ble-verbose\", \"Transport in cache, using that.\");\n      return transportsCache[deviceOrId];\n    }\n\n    const bluetooth = requiresBluetooth();\n    // TODO instead we should \"query\" the device by its ID\n    device = await bluetooth.requestDevice(requestDeviceParam());\n  } else {\n    device = deviceOrId;\n  }\n\n  if (!device.gatt.connected) {\n    log(\"ble-verbose\", \"not connected. connecting...\");\n    await device.gatt.connect();\n  }\n\n  const [service, infos] = await retrieveService(device);\n  const { deviceModel, writeUuid, notifyUuid } = infos;\n  const [writeC, notifyC] = await Promise.all([\n    service.getCharacteristic(writeUuid),\n    service.getCharacteristic(notifyUuid),\n  ]);\n  const notifyObservable = monitorCharacteristic(notifyC).pipe(\n    tap(value => {\n      log(\"ble-frame\", \"<= \" + value.toString(\"hex\"));\n    }),\n    share(),\n  );\n  const notif = notifyObservable.subscribe();\n  const transport = new BluetoothTransport(device, writeC, notifyObservable, deviceModel);\n\n  if (!device.gatt.connected) {\n    throw new DisconnectedDevice();\n  }\n\n  // eslint-disable-next-line require-atomic-updates\n  transportsCache[transport.id] = transport;\n\n  const onDisconnect = e => {\n    console.log(\"onDisconnect!\", e);\n    delete transportsCache[transport.id];\n    transport.notYetDisconnected = false;\n    notif.unsubscribe();\n    device.removeEventListener(\"gattserverdisconnected\", onDisconnect);\n    log(\"ble-verbose\", `BleTransport(${transport.id}) disconnected`);\n    transport.emit(\"disconnect\", e);\n  };\n\n  device.addEventListener(\"gattserverdisconnected\", onDisconnect);\n  const beforeMTUTime = Date.now();\n\n  try {\n    await transport.inferMTU();\n  } finally {\n    const afterMTUTime = Date.now();\n\n    // workaround for #279: we need to open() again if we come the first time here,\n    // to make sure we do a disconnect() after the first pairing time\n    // because of a firmware bug\n    if (afterMTUTime - beforeMTUTime < 1000) {\n      needsReconnect = false; // (optim) there is likely no new pairing done because mtu answer was fast.\n    }\n\n    if (needsReconnect) {\n      await device.gatt.disconnect();\n      // necessary time for the bonding workaround\n      await new Promise(s => setTimeout(s, 4000));\n    }\n  }\n\n  if (needsReconnect) {\n    return open(device, false);\n  }\n\n  return transport;\n}\n/**\n * react-native bluetooth BLE implementation\n * @example\n * import BluetoothTransport from \"@ledgerhq/hw-transport-web-ble\";\n */\n\nexport default class BluetoothTransport extends Transport {\n  static isSupported = (): Promise<boolean> =>\n    Promise.resolve()\n      .then(requiresBluetooth)\n      .then(\n        () => true,\n        () => false,\n      );\n\n  /**\n   * observe event with { available: bool, type: string }\n   * (available is generic, type is specific)\n   * an event is emit once and then each time it changes\n   */\n  static observeAvailability = (observer: any): Subscription => availability().subscribe(observer);\n  static list = (): any => Promise.resolve([]);\n\n  /**\n   * Scan for Ledger Bluetooth devices.\n   * On this web implementation, it only emits ONE device, the one that was selected in the UI (if any).\n   */\n  static listen(observer: any) {\n    log(\"ble-verbose\", \"listen...\");\n    let unsubscribed;\n    const bluetooth = requiresBluetooth();\n    bluetooth.requestDevice(requestDeviceParam()).then(\n      device => {\n        if (!unsubscribed) {\n          observer.next({\n            type: \"add\",\n            descriptor: device,\n          });\n          observer.complete();\n        }\n      },\n      error => {\n        observer.error(new TransportOpenUserCancelled(error.message));\n      },\n    );\n\n    function unsubscribe() {\n      unsubscribed = true;\n    }\n\n    return {\n      unsubscribe,\n    };\n  }\n\n  /**\n   * open a bluetooth device.\n   */\n  static async open(deviceOrId: Device | string) {\n    return open(deviceOrId, true);\n  }\n\n  /**\n   * globally disconnect a bluetooth device by its id.\n   */\n  static disconnect = async (id: any) => {\n    log(\"ble-verbose\", `user disconnect(${id})`);\n    const transport = transportsCache[id];\n\n    if (transport) {\n      transport.device.gatt.disconnect();\n    }\n  };\n  id: string;\n  device: Device;\n  mtuSize = 20;\n  writeCharacteristic: Characteristic;\n  notifyObservable: Observable<Buffer>;\n  notYetDisconnected = true;\n  deviceModel: DeviceModel;\n\n  constructor(\n    device: Device,\n    writeCharacteristic: Characteristic,\n    notifyObservable: Observable<any>,\n    deviceModel: DeviceModel,\n  ) {\n    super();\n    this.id = device.id;\n    this.device = device;\n    this.writeCharacteristic = writeCharacteristic;\n    this.notifyObservable = notifyObservable;\n    this.deviceModel = deviceModel;\n    log(\"ble-verbose\", `BleTransport(${String(this.id)}) new instance`);\n  }\n\n  async inferMTU() {\n    let mtu = 23;\n    await this.exchangeAtomicImpl(async () => {\n      try {\n        mtu =\n          (await firstValueFrom(\n            merge(\n              this.notifyObservable.pipe(\n                first(buffer => buffer.readUInt8(0) === 0x08),\n                map(buffer => buffer.readUInt8(5)),\n              ),\n              defer(() => from(this.write(Buffer.from([0x08, 0, 0, 0, 0])))).pipe(ignoreElements()),\n            ),\n          )) + 3;\n      } catch (e) {\n        log(\"ble-error\", \"inferMTU got \" + String(e));\n        this.device.gatt.disconnect();\n        throw e;\n      }\n    });\n\n    if (mtu > 23) {\n      const mtuSize = mtu - 3;\n      log(\"ble-verbose\", `BleTransport(${String(this.id)}) mtu set to ${String(mtuSize)}`);\n      this.mtuSize = mtuSize;\n    }\n\n    return this.mtuSize;\n  }\n\n  /**\n   * Exchange with the device using APDU protocol.\n   * @param apdu\n   * @returns a promise of apdu response\n   */\n  async exchange(apdu: Buffer): Promise<Buffer> {\n    const b = await this.exchangeAtomicImpl(async () => {\n      try {\n        const msgIn = apdu.toString(\"hex\");\n        log(\"apdu\", `=> ${msgIn}`);\n        const data = await firstValueFrom(\n          merge(this.notifyObservable.pipe(receiveAPDU), sendAPDU(this.write, apdu, this.mtuSize)),\n        );\n        const msgOut = data.toString(\"hex\");\n        log(\"apdu\", `<= ${msgOut}`);\n        return data;\n      } catch (e) {\n        log(\"ble-error\", \"exchange got \" + String(e));\n\n        if (this.notYetDisconnected) {\n          // in such case we will always disconnect because something is bad.\n          this.device.gatt.disconnect();\n        }\n\n        throw e;\n      }\n    });\n\n    return b as Buffer;\n  }\n\n  setScrambleKey() {}\n\n  write = async (buffer: Buffer) => {\n    log(\"ble-frame\", \"=> \" + buffer.toString(\"hex\"));\n    await this.writeCharacteristic.writeValue(buffer);\n  };\n\n  async close() {\n    if (this.exchangeBusyPromise) {\n      await this.exchangeBusyPromise;\n    }\n  }\n}\n", "import { TransportError } from \"@ledgerhq/errors\";\n\n// Represents a response message from the device being reduced from HID USB frames/packets\nexport type ResponseAcc =\n  | {\n      data: Buffer;\n      dataLength: number;\n      // The current frame id/number\n      sequence: number;\n    }\n  | null\n  | undefined;\n\nconst Tag = 0x05;\n\nfunction asUInt16BE(value) {\n  const b = Buffer.alloc(2);\n  b.writeUInt16BE(value, 0);\n  return b;\n}\n\nconst initialAcc = {\n  data: Buffer.alloc(0),\n  dataLength: 0,\n  sequence: 0,\n};\n\n/**\n * Object to handle HID frames (encoding and decoding)\n *\n * @param channel\n * @param packetSize The HID protocol packet size in bytes (usually 64)\n */\nconst createHIDframing = (channel: number, packetSize: number) => {\n  return {\n    /**\n     * Frames/encodes an APDU message into HID USB packets/frames\n     *\n     * @param apdu The APDU message to send, in a Buffer containing [cla, ins, p1, p2, data length, data(if not empty)]\n     * @returns an array of HID USB frames ready to be sent\n     */\n    makeBlocks(apdu: Buffer): Buffer[] {\n      // Encodes the APDU length in 2 bytes before the APDU itself.\n      // The length is measured as the number of bytes.\n      // As the size of the APDU `data` should have been added in 1 byte just before `data`,\n      // the minimum size of an APDU is 5 bytes.\n      let data = Buffer.concat([asUInt16BE(apdu.length), apdu]);\n\n      const blockSize = packetSize - 5;\n      const nbBlocks = Math.ceil(data.length / blockSize);\n\n      // Fills data with 0-padding\n      data = Buffer.concat([data, Buffer.alloc(nbBlocks * blockSize - data.length + 1).fill(0)]);\n\n      const blocks: Buffer[] = [];\n\n      for (let i = 0; i < nbBlocks; i++) {\n        const head = Buffer.alloc(5);\n        head.writeUInt16BE(channel, 0);\n        head.writeUInt8(Tag, 2);\n        head.writeUInt16BE(i, 3);\n\n        // `slice` and not `subarray`: this might not be a Node Buffer, but probably only a Uint8Array\n        const chunk = data.slice(i * blockSize, (i + 1) * blockSize);\n\n        blocks.push(Buffer.concat([head, chunk]));\n      }\n\n      return blocks;\n    },\n\n    /**\n     * Reduces HID USB packets/frames to one response.\n     *\n     * @param acc The value resulting from (accumulating) the previous call of reduceResponse.\n     *   On first call initialized to `initialAcc`. The accumulator enables handling multi-frames messages.\n     * @param chunk Current chunk to reduce into accumulator\n     * @returns An accumulator value updated with the current chunk\n     */\n    reduceResponse(acc: ResponseAcc, chunk: Buffer): ResponseAcc {\n      let { data, dataLength, sequence } = acc || initialAcc;\n\n      if (chunk.readUInt16BE(0) !== channel) {\n        throw new TransportError(\"Invalid channel\", \"InvalidChannel\");\n      }\n\n      if (chunk.readUInt8(2) !== Tag) {\n        throw new TransportError(\"Invalid tag\", \"InvalidTag\");\n      }\n\n      if (chunk.readUInt16BE(3) !== sequence) {\n        throw new TransportError(\"Invalid sequence\", \"InvalidSequence\");\n      }\n\n      // Gets the total length of the response from the 1st frame\n      if (!acc) {\n        dataLength = chunk.readUInt16BE(5);\n      }\n\n      sequence++;\n      // The total length on the 1st frame takes 2 more bytes\n      const chunkData = chunk.slice(acc ? 5 : 7);\n      data = Buffer.concat([data, chunkData]);\n\n      // Removes any 0 padding\n      if (data.length > dataLength) {\n        data = data.slice(0, dataLength);\n      }\n\n      return {\n        data,\n        dataLength,\n        sequence,\n      };\n    },\n\n    /**\n     * Returns the response message that has been reduced from the HID USB frames\n     *\n     * @param acc The accumulator\n     * @returns A Buffer containing the cleaned response message, or null if no response message, or undefined if the\n     *   accumulator is incorrect (message length is not valid)\n     */\n    getReducedResult(acc: ResponseAcc): Buffer | null | undefined {\n      if (acc && acc.dataLength === acc.data.length) {\n        return acc.data;\n      }\n    },\n  };\n};\n\nexport default createHIDframing;\n", "import { ledgerUSBVendorId } from \"@ledgerhq/devices\";\n\nconst ledgerDevices = [\n  {\n    vendorId: ledgerUSBVendorId,\n  },\n];\n\nexport async function requestLedgerDevice(): Promise<USBDevice> {\n  const device = await navigator.usb.requestDevice({\n    filters: ledgerDevices,\n  });\n  return device;\n}\n\nexport async function getLedgerDevices(): Promise<USBDevice[]> {\n  const devices = await navigator.usb.getDevices();\n  return devices.filter(d => d.vendorId === ledgerUSBVendorId);\n}\n\nexport async function getFirstLedgerDevice(): Promise<USBDevice> {\n  const existingDevices = await getLedgerDevices();\n  if (existingDevices.length > 0) return existingDevices[0];\n  return requestLedgerDevice();\n}\n\nexport const isSupported = (): Promise<boolean> =>\n  Promise.resolve(!!navigator && !!navigator.usb && typeof navigator.usb.getDevices === \"function\");\n", "import Transport from \"@ledgerhq/hw-transport\";\nimport type { Observer, DescriptorEvent, Subscription } from \"@ledgerhq/hw-transport\";\nimport hidFraming from \"@ledgerhq/devices/hid-framing\";\nimport { identifyUSBProductId } from \"@ledgerhq/devices\";\nimport type { DeviceModel } from \"@ledgerhq/devices\";\nimport { log } from \"@ledgerhq/logs\";\nimport {\n  TransportOpenUserCancelled,\n  TransportInterfaceNotAvailable,\n  TransportWebUSBGestureRequired,\n  DisconnectedDeviceDuringOperation,\n  DisconnectedDevice,\n} from \"@ledgerhq/errors\";\nimport { getLedgerDevices, getFirstLedgerDevice, requestLedgerDevice, isSupported } from \"./webusb\";\n\nconst configurationValue = 1;\nconst endpointNumber = 3;\n\n/**\n * WebUSB Transport implementation\n * @example\n * import TransportWebUSB from \"@ledgerhq/hw-transport-webusb\";\n * ...\n * TransportWebUSB.create().then(transport => ...)\n */\nexport default class TransportWebUSB extends Transport {\n  device: USBDevice;\n  deviceModel: DeviceModel | null | undefined;\n  channel = Math.floor(Math.random() * 0xffff);\n  packetSize = 64;\n  interfaceNumber: number;\n\n  constructor(device: USBDevice, interfaceNumber: number) {\n    super();\n    this.device = device;\n    this.interfaceNumber = interfaceNumber;\n    this.deviceModel = identifyUSBProductId(device.productId);\n  }\n\n  /**\n   * Check if WebUSB transport is supported.\n   */\n  static isSupported = isSupported;\n\n  /**\n   * List the WebUSB devices that was previously authorized by the user.\n   */\n  static list = getLedgerDevices;\n\n  /**\n   * Actively listen to WebUSB devices and emit ONE device\n   * that was either accepted before, if not it will trigger the native permission UI.\n   *\n   * Important: it must be called in the context of a UI click!\n   */\n  static listen = (observer: Observer<DescriptorEvent<USBDevice>>): Subscription => {\n    let unsubscribed = false;\n    getFirstLedgerDevice().then(\n      device => {\n        if (!unsubscribed) {\n          const deviceModel = identifyUSBProductId(device.productId);\n          observer.next({\n            type: \"add\",\n            descriptor: device,\n            deviceModel,\n          });\n          observer.complete();\n        }\n      },\n      error => {\n        if (window.DOMException && error instanceof window.DOMException && error.code === 18) {\n          observer.error(new TransportWebUSBGestureRequired(error.message));\n        } else {\n          observer.error(new TransportOpenUserCancelled(error.message));\n        }\n      },\n    );\n\n    function unsubscribe() {\n      unsubscribed = true;\n    }\n\n    return {\n      unsubscribe,\n    };\n  };\n\n  /**\n   * Similar to create() except it will always display the device permission (even if some devices are already accepted).\n   */\n  static async request() {\n    const device = await requestLedgerDevice();\n    return TransportWebUSB.open(device);\n  }\n\n  /**\n   * Similar to create() except it will never display the device permission (it returns a Promise<?Transport>, null if it fails to find a device).\n   */\n  static async openConnected() {\n    const devices = await getLedgerDevices();\n    if (devices.length === 0) return null;\n    return TransportWebUSB.open(devices[0]);\n  }\n\n  /**\n   * Create a Ledger transport with a USBDevice\n   */\n  static async open(device: USBDevice) {\n    await device.open();\n\n    if (device.configuration === null) {\n      await device.selectConfiguration(configurationValue);\n    }\n\n    await gracefullyResetDevice(device);\n    const iface = device.configurations[0].interfaces.find(({ alternates }) =>\n      alternates.some(a => a.interfaceClass === 255),\n    );\n\n    if (!iface) {\n      throw new TransportInterfaceNotAvailable(\n        \"No WebUSB interface found for your Ledger device. Please upgrade firmware or contact techsupport.\",\n      );\n    }\n\n    const interfaceNumber = iface.interfaceNumber;\n\n    try {\n      await device.claimInterface(interfaceNumber);\n    } catch (e: any) {\n      await device.close();\n      throw new TransportInterfaceNotAvailable(e.message);\n    }\n\n    const transport = new TransportWebUSB(device, interfaceNumber);\n\n    const onDisconnect = e => {\n      if (device === e.device) {\n        // $FlowFixMe\n        navigator.usb.removeEventListener(\"disconnect\", onDisconnect);\n\n        transport._emitDisconnect(new DisconnectedDevice());\n      }\n    };\n\n    // $FlowFixMe\n    navigator.usb.addEventListener(\"disconnect\", onDisconnect);\n    return transport;\n  }\n\n  _disconnectEmitted = false;\n  _emitDisconnect = (e: Error) => {\n    if (this._disconnectEmitted) return;\n    this._disconnectEmitted = true;\n    this.emit(\"disconnect\", e);\n  };\n\n  /**\n   * Release the transport device\n   */\n  async close(): Promise<void> {\n    await this.exchangeBusyPromise;\n    await this.device.releaseInterface(this.interfaceNumber);\n    await gracefullyResetDevice(this.device);\n    await this.device.close();\n  }\n\n  /**\n   * Exchange with the device using APDU protocol.\n   * @param apdu\n   * @returns a promise of apdu response\n   */\n  async exchange(apdu: Buffer): Promise<Buffer> {\n    const b = await this.exchangeAtomicImpl(async () => {\n      const { channel, packetSize } = this;\n      log(\"apdu\", \"=> \" + apdu.toString(\"hex\"));\n      const framing = hidFraming(channel, packetSize);\n      // Write...\n      const blocks = framing.makeBlocks(apdu);\n\n      for (let i = 0; i < blocks.length; i++) {\n        await this.device.transferOut(endpointNumber, blocks[i]);\n      }\n\n      // Read...\n      let result;\n      let acc;\n\n      while (!(result = framing.getReducedResult(acc))) {\n        const r = await this.device.transferIn(endpointNumber, packetSize);\n        // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        // @ts-ignore\n        const buffer = Buffer.from(r.data.buffer);\n        acc = framing.reduceResponse(acc, buffer);\n      }\n\n      log(\"apdu\", \"<= \" + result.toString(\"hex\"));\n      return result;\n    }).catch(e => {\n      if (e && e.message && e.message.includes(\"disconnected\")) {\n        this._emitDisconnect(e);\n\n        throw new DisconnectedDeviceDuringOperation(e.message);\n      }\n\n      throw e;\n    });\n\n    return b as Buffer;\n  }\n\n  setScrambleKey() {}\n}\n\nasync function gracefullyResetDevice(device: USBDevice) {\n  try {\n    await device.reset();\n  } catch (err) {\n    console.warn(err);\n  }\n}\n", "import Transport from \"@ledgerhq/hw-transport\";\nimport type { Observer, DescriptorEvent, Subscription } from \"@ledgerhq/hw-transport\";\nimport hidFraming from \"@ledgerhq/devices/hid-framing\";\nimport { identifyUSBProductId, ledgerUSBVendorId } from \"@ledgerhq/devices\";\nimport type { DeviceModel } from \"@ledgerhq/devices\";\nimport { log } from \"@ledgerhq/logs\";\nimport {\n  TransportOpenUserCancelled,\n  DisconnectedDeviceDuringOperation,\n  DisconnectedDevice,\n  TransportError,\n} from \"@ledgerhq/errors\";\n\nconst ledgerDevices = [\n  {\n    vendorId: ledgerUSBVendorId,\n  },\n];\n\nconst isSupported = () => Promise.resolve(!!(window.navigator && window.navigator.hid));\n\nconst getHID = (): HID => {\n  // $FlowFixMe\n  const { hid } = navigator;\n  if (!hid) throw new TransportError(\"navigator.hid is not supported\", \"HIDNotSupported\");\n  return hid;\n};\n\nasync function requestLedgerDevices(): Promise<HIDDevice[]> {\n  const device = await getHID().requestDevice({\n    filters: ledgerDevices,\n  });\n  if (Array.isArray(device)) return device;\n  return [device];\n}\n\nasync function getLedgerDevices(): Promise<HIDDevice[]> {\n  const devices = await getHID().getDevices();\n  return devices.filter(d => d.vendorId === ledgerUSBVendorId);\n}\n\nasync function getFirstLedgerDevice(): Promise<HIDDevice> {\n  const existingDevices = await getLedgerDevices();\n  if (existingDevices.length > 0) return existingDevices[0];\n  const devices = await requestLedgerDevices();\n  return devices[0];\n}\n/**\n * WebHID Transport implementation\n * @example\n * import TransportWebHID from \"@ledgerhq/hw-transport-webhid\";\n * ...\n * TransportWebHID.create().then(transport => ...)\n */\n\nexport default class TransportWebHID extends Transport {\n  device: HIDDevice;\n  deviceModel: DeviceModel | null | undefined;\n  channel = Math.floor(Math.random() * 0xffff);\n  packetSize = 64;\n\n  constructor(device: HIDDevice) {\n    super();\n    this.device = device;\n    this.deviceModel =\n      typeof device.productId === \"number\" ? identifyUSBProductId(device.productId) : undefined;\n    device.addEventListener(\"inputreport\", this.onInputReport);\n  }\n\n  inputs: Buffer[] = [];\n  inputCallback: ((arg0: Buffer) => void) | null | undefined;\n  read = (): Promise<Buffer> => {\n    if (this.inputs.length) {\n      return Promise.resolve(this.inputs.shift() as unknown as Buffer);\n    }\n\n    return new Promise(success => {\n      this.inputCallback = success;\n    });\n  };\n  onInputReport = (e: HIDInputReportEvent) => {\n    const buffer = Buffer.from(e.data.buffer);\n\n    if (this.inputCallback) {\n      this.inputCallback(buffer);\n      this.inputCallback = null;\n    } else {\n      this.inputs.push(buffer);\n    }\n  };\n\n  /**\n   * Check if WebUSB transport is supported.\n   */\n  static isSupported = isSupported;\n\n  /**\n   * List the WebUSB devices that was previously authorized by the user.\n   */\n  static list = getLedgerDevices;\n\n  /**\n   * Actively listen to WebUSB devices and emit ONE device\n   * that was either accepted before, if not it will trigger the native permission UI.\n   *\n   * Important: it must be called in the context of a UI click!\n   */\n  static listen = (observer: Observer<DescriptorEvent<HIDDevice>>): Subscription => {\n    let unsubscribed = false;\n    getFirstLedgerDevice().then(\n      device => {\n        if (!device) {\n          observer.error(new TransportOpenUserCancelled(\"Access denied to use Ledger device\"));\n        } else if (!unsubscribed) {\n          const deviceModel =\n            typeof device.productId === \"number\"\n              ? identifyUSBProductId(device.productId)\n              : undefined;\n          observer.next({\n            type: \"add\",\n            descriptor: device,\n            deviceModel,\n          });\n          observer.complete();\n        }\n      },\n      error => {\n        observer.error(new TransportOpenUserCancelled(error.message));\n      },\n    );\n\n    function unsubscribe() {\n      unsubscribed = true;\n    }\n\n    return {\n      unsubscribe,\n    };\n  };\n\n  /**\n   * Similar to create() except it will always display the device permission (even if some devices are already accepted).\n   */\n  static async request() {\n    const [device] = await requestLedgerDevices();\n    return TransportWebHID.open(device);\n  }\n\n  /**\n   * Similar to create() except it will never display the device permission (it returns a Promise<?Transport>, null if it fails to find a device).\n   */\n  static async openConnected() {\n    const devices = await getLedgerDevices();\n    if (devices.length === 0) return null;\n    return TransportWebHID.open(devices[0]);\n  }\n\n  /**\n   * Create a Ledger transport with a HIDDevice\n   */\n  static async open(device: HIDDevice) {\n    await device.open();\n    const transport = new TransportWebHID(device);\n\n    const onDisconnect = e => {\n      if (device === e.device) {\n        getHID().removeEventListener(\"disconnect\", onDisconnect);\n\n        transport._emitDisconnect(new DisconnectedDevice());\n      }\n    };\n\n    getHID().addEventListener(\"disconnect\", onDisconnect);\n    return transport;\n  }\n\n  _disconnectEmitted = false;\n  _emitDisconnect = (e: Error) => {\n    if (this._disconnectEmitted) return;\n    this._disconnectEmitted = true;\n    this.emit(\"disconnect\", e);\n  };\n\n  /**\n   * Release the transport device\n   */\n  async close(): Promise<void> {\n    await this.exchangeBusyPromise;\n    this.device.removeEventListener(\"inputreport\", this.onInputReport);\n    await this.device.close();\n  }\n\n  /**\n   * Exchange with the device using APDU protocol.\n   * @param apdu\n   * @returns a promise of apdu response\n   */\n  exchange = async (apdu: Buffer): Promise<Buffer> => {\n    const b = await this.exchangeAtomicImpl(async () => {\n      const { channel, packetSize } = this;\n      log(\"apdu\", \"=> \" + apdu.toString(\"hex\"));\n      const framing = hidFraming(channel, packetSize);\n      // Write...\n      const blocks = framing.makeBlocks(apdu);\n\n      for (let i = 0; i < blocks.length; i++) {\n        await this.device.sendReport(0, blocks[i]);\n      }\n\n      // Read...\n      let result;\n      let acc;\n\n      while (!(result = framing.getReducedResult(acc))) {\n        const buffer = await this.read();\n        acc = framing.reduceResponse(acc, buffer);\n      }\n\n      log(\"apdu\", \"<= \" + result.toString(\"hex\"));\n      return result;\n    }).catch(e => {\n      if (e && e.message && e.message.includes(\"write\")) {\n        this._emitDisconnect(e);\n\n        throw new DisconnectedDeviceDuringOperation(e.message);\n      }\n\n      throw e;\n    });\n    return b as Buffer;\n  };\n\n  setScrambleKey() {}\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { default as TransportBLE } from '@ledgerhq/hw-transport-web-ble';\nimport { default as TransportUSB } from '@ledgerhq/hw-transport-webusb';\nimport { default as TransportHID } from '@ledgerhq/hw-transport-webhid';\nimport { BIP44_COIN_NANO, BIP44_PURPOSE, HARDENED_OFFSET, LEDGER_STATUS_CODES } from './constants.js';\nimport { bytes, dec, hex, utf8 } from './convert.js';\nimport { Rpc } from './rpc.js';\nimport { ChangeBlock, ReceiveBlock, SendBlock } from './block.js';\nexport class Ledger {\n    static #isInternal = false;\n    #status = 'DISCONNECTED';\n    get status() { return this.#status; }\n    openTimeout = 3000;\n    listenTimeout = 30000;\n    transport = null;\n    DynamicTransport = TransportHID;\n    constructor() {\n        if (!Ledger.#isInternal) {\n            throw new Error('Ledger cannot be instantiated directly. Use Ledger.init()');\n        }\n        Ledger.#isInternal = false;\n    }\n    static async init() {\n        Ledger.#isInternal = true;\n        const self = new this();\n        await self.checkBrowserSupport();\n        await self.listen();\n        return self;\n    }\n    /**\n    * Check which transport protocols are supported by the browser and set the\n    * transport type according to the following priorities: Bluetooth, USB, HID.\n    */\n    async checkBrowserSupport() {\n        console.log('Checking browser Ledger support...');\n        const supports = {\n            ble: await TransportBLE.isSupported(),\n            usb: await TransportUSB.isSupported(),\n            hid: await TransportHID.isSupported()\n        };\n        console.log(`ble: ${supports.ble}; usb: ${supports.usb}; hid: ${supports.hid}`);\n        if (supports.ble) {\n            this.DynamicTransport = TransportBLE;\n        }\n        else if (supports.usb) {\n            this.DynamicTransport = TransportUSB;\n        }\n        else if (supports.hid) {\n            this.DynamicTransport = TransportHID;\n        }\n        else {\n            throw new Error('Unsupported browser');\n        }\n    }\n    async listen() {\n        const { usb } = globalThis.navigator;\n        if (usb) {\n            usb.addEventListener('connect', console.log.bind(console));\n            usb.addEventListener('disconnect', console.log.bind(console));\n        }\n    }\n    async connect() {\n        const { usb } = globalThis.navigator;\n        if (usb) {\n            usb.removeEventListener('disconnect', this.onDisconnectUsb.bind(this));\n            usb.addEventListener('disconnect', this.onDisconnectUsb.bind(this));\n        }\n        const version = await this.version();\n        if (version.status === 'OK') {\n            if (version.name === 'Nano') {\n                const account = await this.account();\n                if (account.status === 'OK') {\n                    this.#status = 'CONNECTED';\n                }\n                else if (account.status === 'SECURITY_STATUS_NOT_SATISFIED') {\n                    this.#status = 'LOCKED';\n                }\n                else {\n                    this.#status = 'DISCONNECTED';\n                }\n            }\n            else if (version.name === 'BOLOS') {\n                const open = await this.open();\n                this.#status = (open.status === 'OK')\n                    ? 'CONNECTED'\n                    : 'DISCONNECTED';\n            }\n            else {\n                this.#status = 'BUSY';\n            }\n        }\n        else {\n            this.#status = 'DISCONNECTED';\n        }\n        return this.status;\n    }\n    async onDisconnectUsb(e) {\n        if (e.device?.manufacturerName === 'Ledger') {\n            const { usb } = globalThis.navigator;\n            usb.removeEventListener('disconnect', this.onDisconnectUsb);\n            this.#status = 'DISCONNECTED';\n        }\n    }\n    /**\n    * Open Nano app by launching user flow.\n    *\n    * https://developers.ledger.com/docs/connectivity/ledgerJS/open-close-info-on-apps#open-application\n    *\n    * This command resets the internal USB connection of the device which can\n    * cause subsequent commands to fail if called too quickly. A one-second delay\n    * is implemented in this method to mitigate the issue.\n    *\n    * https://github.com/LedgerHQ/ledger-live/issues/4964#issuecomment-1878361157\n    *\n    * @returns Status of command\n    */\n    async open() {\n        const name = new TextEncoder().encode('Nano');\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        const response = await transport.send(0xe0, 0xd8, 0x00, 0x00, name)\n            .then(res => bytes.toDec(res))\n            .catch(err => err.statusCode);\n        return new Promise(resolve => setTimeout(resolve, 1000, { status: LEDGER_STATUS_CODES[response] }));\n    }\n    /**\n    * Close the currently running app.\n    *\n    * https://developers.ledger.com/docs/connectivity/ledgerJS/open-close-info-on-apps#quit-application\n    *\n    * This command resets the internal USB connection of the device which can\n    * cause subsequent commands to fail if called too quickly. A one-second delay\n    * is implemented in this method to mitigate the issue.\n    *\n    * https://github.com/LedgerHQ/ledger-live/issues/4964#issuecomment-1878361157\n    *\n    * @returns Status of command\n    */\n    async close() {\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        const response = await transport.send(0xb0, 0xa7, 0x00, 0x00)\n            .then(res => bytes.toDec(res))\n            .catch(err => err.statusCode);\n        return new Promise(resolve => setTimeout(resolve, 1000, { status: LEDGER_STATUS_CODES[response] }));\n    }\n    /**\n    * Get the version of the current process. If a specific app is running, get\n    * the app version. Otherwise, get the Ledger BOLOS version instead.\n    *\n    * https://developers.ledger.com/docs/connectivity/ledgerJS/open-close-info-on-apps#get-information\n    *\n    * @returns Status, process name, and version\n    */\n    async version() {\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        const response = await transport.send(0xb0, 0x01, 0x00, 0x00)\n            .catch(err => dec.toBytes(err.statusCode));\n        await transport.close();\n        if (response.length === 2) {\n            const statusCode = bytes.toDec(response);\n            const status = LEDGER_STATUS_CODES[statusCode] ?? 'UNKNOWN_ERROR';\n            return { status, name: null, version: null };\n        }\n        const nameLength = response[1];\n        const name = response.slice(2, 2 + nameLength).toString();\n        const versionLength = response[2 + nameLength];\n        const version = response.slice(2 + nameLength + 1, 2 + nameLength + 1 + versionLength).toString();\n        const statusCode = bytes.toDec(response.slice(-2));\n        const status = LEDGER_STATUS_CODES[statusCode];\n        return { status, name, version };\n    }\n    /**\n    * Get an account at a specific BIP-44 index.\n    *\n    * @returns Response object containing command status, public key, and address\n    */\n    async account(index = 0, show = false) {\n        if (typeof index !== 'number' || index < 0 || index >= HARDENED_OFFSET) {\n            throw new TypeError('Invalid account index');\n        }\n        const purpose = dec.toBytes(BIP44_PURPOSE + HARDENED_OFFSET, 4);\n        const coin = dec.toBytes(BIP44_COIN_NANO + HARDENED_OFFSET, 4);\n        const account = dec.toBytes(index + HARDENED_OFFSET, 4);\n        const data = new Uint8Array([0x03, ...purpose, ...coin, ...account]);\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        const response = await transport.send(0xa1, 0x02, show ? 0x01 : 0x00, 0x00, data)\n            .catch(err => dec.toBytes(err.statusCode));\n        await transport.close();\n        if (response.length === 2) {\n            const statusCode = bytes.toDec(response);\n            const status = LEDGER_STATUS_CODES[statusCode] ?? 'UNKNOWN_ERROR';\n            return { status, publicKey: null, address: null };\n        }\n        try {\n            const publicKey = bytes.toHex(response.slice(0, 32));\n            const addressLength = response[32];\n            const address = response.slice(33, 33 + addressLength).toString();\n            const statusCode = bytes.toDec(response.slice(33 + addressLength));\n            const status = LEDGER_STATUS_CODES[statusCode];\n            return { status, publicKey, address };\n        }\n        catch (err) {\n            return { status: 'ERROR_PARSING_ACCOUNT', publicKey: null, address: null };\n        }\n    }\n    /**\n    * Cache frontier block in device memory.\n    *\n    * @param {number} index - Account number\n    * @param {any} block - Block data to cache\n    * @returns Status of command\n    */\n    async cacheBlock(index = 0, block) {\n        if (typeof index !== 'number' || index < 0 || index >= HARDENED_OFFSET) {\n            throw new TypeError('Invalid account index');\n        }\n        if (!(block instanceof SendBlock) && !(block instanceof ReceiveBlock) && !(block instanceof ChangeBlock)) {\n            throw new TypeError('Invalid block format');\n        }\n        if (!block.signature) {\n            throw new ReferenceError('Cannot cache unsigned block');\n        }\n        const purpose = dec.toBytes(BIP44_PURPOSE + HARDENED_OFFSET, 4);\n        const coin = dec.toBytes(BIP44_COIN_NANO + HARDENED_OFFSET, 4);\n        const account = dec.toBytes(index + HARDENED_OFFSET, 4);\n        const previous = hex.toBytes(block.previous);\n        const link = hex.toBytes(block.link);\n        const representative = hex.toBytes(block.representative.publicKey);\n        const balance = hex.toBytes(BigInt(block.balance).toString(16), 16);\n        const signature = hex.toBytes(block.signature);\n        const data = new Uint8Array([0x03, ...purpose, ...coin, ...account, ...previous, ...link, ...representative, ...balance, ...signature]);\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        const response = await transport.send(0xa1, 0x03, 0x00, 0x00, data)\n            .then(res => bytes.toDec(res))\n            .catch(err => err.statusCode);\n        await transport.close();\n        return { status: LEDGER_STATUS_CODES[response] };\n    }\n    async sign(index = 0, input) {\n        if (typeof index !== 'number' || index < 0 || index >= HARDENED_OFFSET) {\n            throw new TypeError('Invalid account index');\n        }\n        const purpose = dec.toBytes(BIP44_PURPOSE + HARDENED_OFFSET, 4);\n        const coin = dec.toBytes(BIP44_COIN_NANO + HARDENED_OFFSET, 4);\n        const account = dec.toBytes(index + HARDENED_OFFSET, 4);\n        const transport = await this.DynamicTransport.create(this.openTimeout, this.listenTimeout);\n        if (typeof input === 'string') {\n            // input is a nonce\n            const nonce = utf8.toBytes(input);\n            if (nonce.length !== 16) {\n                throw new RangeError('Nonce must be 16-byte string');\n            }\n            const data = new Uint8Array([0x03, ...purpose, ...coin, ...account, ...nonce]);\n            const response = await transport.send(0xa1, 0x05, 0x00, 0x00, data)\n                .catch(err => dec.toBytes(err.statusCode));\n            await transport.close();\n            if (response.length === 2) {\n                const statusCode = bytes.toDec(response);\n                const status = LEDGER_STATUS_CODES[statusCode] ?? 'UNKNOWN_ERROR';\n                return { status, signature: null };\n            }\n            const signature = bytes.toHex(response.slice(0, 64));\n            const statusCode = bytes.toDec(response.slice(-2));\n            const status = LEDGER_STATUS_CODES[statusCode];\n            return { status, signature };\n        }\n        else {\n            // input is a block\n            const previous = hex.toBytes(input.previous);\n            const link = hex.toBytes(input.link);\n            const representative = hex.toBytes(input.representative.publicKey);\n            const balance = hex.toBytes(BigInt(input.balance).toString(16), 16);\n            const data = new Uint8Array([0x03, ...purpose, ...coin, ...account, ...previous, ...link, ...representative, ...balance]);\n            const response = await transport.send(0xa1, 0x04, 0x00, 0x00, data)\n                .catch(err => dec.toBytes(err.statusCode));\n            await transport.close();\n            if (response.length === 2) {\n                const statusCode = bytes.toDec(response);\n                const status = LEDGER_STATUS_CODES[statusCode] ?? 'UNKNOWN_ERROR';\n                return { status, signature: null, hash: null };\n            }\n            const hash = bytes.toHex(response.slice(0, 32));\n            const signature = bytes.toHex(response.slice(32, 96));\n            const statusCode = bytes.toDec(response.slice(-2));\n            const status = LEDGER_STATUS_CODES[statusCode];\n            return { status, signature, hash };\n        }\n    }\n    async updateCache(index, input, node) {\n        if (typeof input === 'string' && node?.constructor === Rpc) {\n            const data = {\n                'json_block': 'true',\n                'hash': input\n            };\n            const res = await node.call('block_info', data);\n            if (!res || res.ok === false) {\n                throw new Error(`Unable to fetch block info`, res);\n            }\n            input = res.contents;\n        }\n        return this.cacheBlock(index, input);\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { BURN_ADDRESS, PREAMBLE, THRESHOLD_RECEIVE, THRESHOLD_SEND } from './constants.js';\nimport { Account } from './account.js';\nimport { Blake2b } from './blake2b.js';\nimport { dec, hex } from './convert.js';\nimport { NanoNaCl } from './workers/nano-nacl.js';\nimport { Pool } from './pool.js';\nimport { PowGpu } from './workers.js';\n/**\n* Represents a block as defined by the Nano cryptocurrency protocol. The Block\n* class is abstract and cannot be directly instantiated. Every block must be one\n* of three derived classes: SendBlock, ReceiveBlock, ChangeBlock.\n*/\nclass Block {\n    static #pool = new Pool(PowGpu);\n    account;\n    type = 'state';\n    constructor(account) {\n        if (this.constructor === Block) {\n            throw new Error('Block is an abstract class and cannot be instantiated directly.');\n        }\n        if (account.constructor === Account) {\n            this.account = account;\n        }\n        else if (typeof account === 'string') {\n            this.account = Account.fromAddress(account);\n        }\n        else {\n            throw new TypeError('Invalid account');\n        }\n    }\n    /**\n    * Converts the block to JSON format as expected by the `process` RPC.\n    *\n    * @returns {string} JSON representation of the block\n    */\n    json() {\n        return {\n            \"type\": this.type,\n            \"account\": this.account.address,\n            \"previous\": this.previous,\n            \"representative\": this.representative.address,\n            \"balance\": this.balance.toString(),\n            \"link\": this.link,\n            \"signature\": this.signature ?? '',\n            \"work\": this.work ?? ''\n        };\n    }\n    /**\n    * Hashes the block using Blake2b.\n    *\n    * @returns {Promise<string>} Block data hashed to a byte array\n    */\n    async hash() {\n        const data = [\n            PREAMBLE,\n            this.account.publicKey,\n            this.previous,\n            this.representative.publicKey,\n            dec.toHex(this.balance, 32),\n            this.link\n        ];\n        const hash = new Blake2b(32);\n        data.forEach(str => hash.update(hex.toBytes(str)));\n        return hash.digest('hex').toUpperCase();\n    }\n    /**\n    * Calculates proof-of-work using a pool of WebGL workers.\n    *\n    * A successful response sets the `work` property.\n    */\n    async pow() {\n        const data = {\n            \"hash\": this.previous,\n            \"threshold\": (this instanceof SendBlock || this instanceof ChangeBlock)\n                ? THRESHOLD_SEND\n                : THRESHOLD_RECEIVE\n        };\n        const [{ work }] = await Block.#pool.assign([data]);\n        this.work = work;\n    }\n    async sign(input, block) {\n        if (typeof input === 'number') {\n            const index = input;\n            const { Ledger } = await import('./ledger.js');\n            const ledger = await Ledger.init();\n            await ledger.open();\n            if (block) {\n                try {\n                    await ledger.updateCache(index, block);\n                }\n                catch (err) {\n                    console.warn('Error updating Ledger cache of previous block, attempting signature anyway', err);\n                }\n            }\n            const result = await ledger.sign(index, this);\n            if (result.status !== 'OK') {\n                throw new Error(result.status);\n            }\n            this.signature = result.signature;\n        }\n        else {\n            const key = input ?? this.account.privateKey;\n            if (key == null) {\n                throw new Error('No valid key found to sign block');\n            }\n            const account = await Account.fromPrivateKey(key);\n            try {\n                const signature = NanoNaCl.detached(hex.toBytes(await this.hash()), hex.toBytes(`${account.privateKey}`));\n                this.signature = signature;\n            }\n            catch (err) {\n                throw new Error(`Failed to sign block with key ${key}: ${err}`);\n            }\n        }\n    }\n    /**\n    * Sends the block to a node for processing on the network.\n    *\n    * The block must already be signed (see `sign()` for more information).\n    * The block must also have a `work` value.\n    *\n    * @param {Rpc|string|URL} rpc - RPC node information required to call `process`\n    * @returns {Promise<string>} Hash of the processed block\n    */\n    async process(rpc) {\n        if (!this.signature) {\n            throw new Error('Block is missing signature. Use sign() and try again.');\n        }\n        if (!this.work == null) {\n            throw new Error('Block is missing proof-of-work. Generate PoW and try again.');\n        }\n        const data = {\n            \"subtype\": this.subtype,\n            \"json_block\": \"true\",\n            \"block\": this.json()\n        };\n        const res = await rpc.call('process', data);\n        if (res.hash == null) {\n            throw new Error('Block could not be processed', res);\n        }\n        return res.hash;\n    }\n    /**\n    * Verifies the signature of the block. If a key is not provided, the public\n    * key of the block's account will be used if it exists.\n    *\n    * @param {string} [key] - Hexadecimal-formatted public key to use for verification\n    * @returns {boolean} True if block was signed by the matching private key\n    */\n    async verify(key) {\n        key ??= this.account.publicKey;\n        if (!key) {\n            throw new Error('Provide a key for block signature verification.');\n        }\n        const data = [\n            PREAMBLE,\n            this.account.publicKey,\n            this.previous,\n            this.representative.publicKey,\n            dec.toHex(this.balance, 32),\n            this.link\n        ];\n        const hash = new Blake2b(32);\n        data.forEach(str => hash.update(hex.toBytes(str)));\n        const blockHash = hash.digest('hex').toUpperCase();\n        return NanoNaCl.verify(hex.toBytes(blockHash), hex.toBytes(this.signature ?? ''), hex.toBytes(key));\n    }\n}\n/**\n* Represents a block that sends funds from one address to another as defined by\n* the Nano cryptocurrency protocol.\n*/\nexport class SendBlock extends Block {\n    type = 'state';\n    subtype = 'send';\n    previous;\n    representative;\n    balance;\n    link;\n    signature;\n    work;\n    constructor(sender, balance, recipient, amount, representative, frontier, work) {\n        super(sender);\n        this.previous = frontier;\n        this.representative = Account.fromAddress(representative);\n        this.link = Account.fromAddress(recipient).publicKey;\n        this.work = work ?? '';\n        const bigBalance = BigInt(balance);\n        const bigAmount = BigInt(amount);\n        this.balance = bigBalance - bigAmount;\n        validate(this);\n    }\n}\n/**\n* Represents a block that receives funds sent to one address from another as\n* defined by the Nano cryptocurrency protocol.\n*/\nexport class ReceiveBlock extends Block {\n    type = 'state';\n    subtype = 'receive';\n    previous;\n    representative;\n    balance;\n    link;\n    signature;\n    work;\n    constructor(recipient, balance, origin, amount, representative, frontier, work) {\n        super(recipient);\n        this.previous = frontier ?? Account.fromAddress(recipient).publicKey;\n        this.representative = Account.fromAddress(representative);\n        this.link = origin;\n        this.work = work ?? '';\n        const bigBalance = BigInt(balance);\n        const bigAmount = BigInt(amount);\n        this.balance = bigBalance + bigAmount;\n        validate(this);\n    }\n}\n/**\n* Represents a block that changes the representative account to which the user\n* account delegates their vote weight using the the Open Representative Voting\n* specification as defined by the Nano cryptocurrency protocol.\n*/\nexport class ChangeBlock extends Block {\n    type = 'state';\n    subtype = 'change';\n    previous;\n    representative;\n    balance;\n    link = Account.fromAddress(BURN_ADDRESS).publicKey;\n    signature;\n    work;\n    constructor(account, balance, representative, frontier, work) {\n        super(account);\n        this.previous = frontier;\n        this.representative = Account.fromAddress(representative);\n        this.balance = BigInt(balance);\n        this.work = work ?? '';\n        validate(this);\n    }\n}\n/**\n * Validates block data.\n *\n * @param {Block} block - SendBlock, ReceiveBlock, or ChangeBlock to validate\n */\nfunction validate(block) {\n    if (block.account == null) {\n        throw new Error('Account missing');\n    }\n    if (block.previous == null || block.previous === '') {\n        throw new Error('Frontier missing');\n    }\n    if (block.representative == null) {\n        throw new Error('Representative missing');\n    }\n    if (block.balance == null) {\n        throw new Error('Balance missing');\n    }\n    if (block.balance < 0) {\n        throw new Error('Negative balance');\n    }\n    switch (block.constructor) {\n        case SendBlock: {\n            if (block.link == null || block.link === '') {\n                throw new Error('Recipient missing');\n            }\n            break;\n        }\n        case ReceiveBlock: {\n            if (block.link == null) {\n                throw new Error('Origin send block hash missing');\n            }\n            break;\n        }\n        case ChangeBlock: {\n            if (block.link == null) {\n                throw new Error('Change block link missing');\n            }\n            if (+block.link !== 0) {\n                throw new Error('Invalid change block link');\n            }\n            break;\n        }\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Account } from './account.js';\nimport { Blake2b } from './blake2b.js';\nimport { UNITS } from './constants.js';\nimport { hex } from './convert.js';\nimport { Rpc } from './rpc.js';\nimport { SendBlock } from './block.js';\nimport { NanoNaCl } from './workers/nano-nacl.js';\nfunction hash(data, encoding) {\n    if (!Array.isArray(data))\n        data = [data];\n    const hash = new Blake2b(32);\n    if (encoding === 'hex') {\n        data.forEach(str => hash.update(hex.toBytes(str)));\n    }\n    else {\n        const enc = new TextEncoder();\n        data.forEach(str => hash.update(enc.encode(str)));\n    }\n    return hash.digest('hex').toUpperCase();\n}\n/**\n* Converts a decimal amount of nano from one unit divider to another.\n*\n* @param {bigint|string} amount - Decimal amount to convert\n* @param {string} inputUnit - Current denomination\n* @param {string} outputUnit - Desired denomination\n*/\nexport async function convert(amount, inputUnit, outputUnit) {\n    if (typeof amount === 'bigint') {\n        amount = amount.toString();\n    }\n    if (typeof amount !== 'string' || amount === '' || !/^[0-9]*\\.?[0-9]*$/.test(amount)) {\n        throw new Error('Invalid amount');\n    }\n    let [i = '', f = ''] = amount.toString().split('.');\n    i = i.replace(/^0*/g, '');\n    f = f.replace(/0*$/g, '');\n    inputUnit = inputUnit.toUpperCase();\n    outputUnit = outputUnit.toUpperCase();\n    if (!(inputUnit in UNITS)) {\n        throw new Error(`Unknown denomination ${inputUnit}, expected one of the following: ${Object.keys(UNITS)}`);\n    }\n    if (!(outputUnit in UNITS)) {\n        throw new Error(`Unknown denomination ${outputUnit}, expected one of the following: ${Object.keys(UNITS)}`);\n    }\n    // convert to raw\n    i = `${i}${f.slice(0, UNITS[inputUnit])}`.padEnd(i.length + UNITS[inputUnit], '0');\n    f = f.slice(UNITS[inputUnit]);\n    if (i.length > 39) {\n        throw new Error('Amount exceeds Nano limits');\n    }\n    if (i.length < 1) {\n        throw new Error('Amount must be at least 1 raw');\n    }\n    if (f.length > 0) {\n        throw new Error('Amount contains fractional raw');\n    }\n    // convert to desired denomination\n    if (UNITS[outputUnit] !== 0) {\n        f = i.padStart(40, '0').slice(-UNITS[outputUnit]) + f;\n        i = i.slice(0, -UNITS[outputUnit]);\n    }\n    i = i.replace(/^0*/g, '') ?? '0';\n    f = f.replace(/0*$/g, '');\n    return `${i}${f ? '.' : ''}${f}`;\n}\n/**\n* Signs arbitrary strings with a private key using the Ed25519 signature scheme.\n*\n* @param {string} key - Hexadecimal-formatted private key to use for signing\n* @param {...string} input - Data to be signed\n* @returns {Promise<string>} Hexadecimal-formatted signature\n*/\nexport async function sign(key, ...input) {\n    const account = await Account.fromPrivateKey(key);\n    const data = hash(input);\n    const signature = NanoNaCl.detached(hex.toBytes(data), hex.toBytes(`${account.privateKey}`));\n    return signature;\n}\n/**\n* Collects the funds from a specified range of accounts in a wallet and sends\n* them all to a single recipient address. Hardware wallets are unsupported.\n*\n* @param {Rpc|string|URL} rpc - RPC node information required to refresh accounts, calculate PoW, and process blocks\n* @param {Blake2bWallet|Bip44Wallet|LedgerWallet} wallet - Wallet from which to sweep funds\n* @param {string} recipient - Destination address for all swept funds\n* @param {number} from - Starting account index to sweep\n* @param {number} to - Ending account index to sweep\n* @returns An array of results including both successes and failures\n */\nexport async function sweep(rpc, wallet, recipient, from = 0, to = from) {\n    if (rpc == null || wallet == null || recipient == null) {\n        throw new ReferenceError('Missing required sweep arguments');\n    }\n    if (typeof rpc === 'string' || rpc.constructor === URL) {\n        rpc = new Rpc(rpc);\n    }\n    if (rpc.constructor !== Rpc) {\n        throw new TypeError('RPC must be a valid node');\n    }\n    const blockQueue = [];\n    const results = [];\n    const recipientAccount = Account.fromAddress(recipient);\n    const accounts = await wallet.refresh(rpc, from, to);\n    for (const account of accounts) {\n        if (account.representative?.address && account.frontier) {\n            const block = new SendBlock(account, account.balance?.toString() ?? '0', recipientAccount.address, account.balance?.toString() ?? '0', account.representative.address, account.frontier);\n            const blockRequest = new Promise(async (resolve) => {\n                try {\n                    await block.pow();\n                    await block.sign();\n                    const hash = await block.process(rpc);\n                    results.push({ status: 'success', address: block.account.address, message: hash });\n                }\n                catch (err) {\n                    results.push({ status: 'error', address: block.account.address, message: err.message });\n                }\n                finally {\n                    resolve();\n                }\n            });\n            blockQueue.push(blockRequest);\n        }\n    }\n    await Promise.allSettled(blockQueue);\n    return results;\n}\n/**\n* Verifies the signature of arbitrary strings using a public key.\n*\n* @param {string} key - Hexadecimal-formatted public key to use for verification\n* @param {string} signature - Hexadcimal-formatted signature\n* @param {...string} input - Data to be verified\n* @returns {Promise<boolean>} True if the data was signed by the public key's matching private key\n*/\nexport async function verify(key, signature, ...input) {\n    const data = hash(input);\n    try {\n        return await NanoNaCl.verify(hex.toBytes(data), hex.toBytes(signature), hex.toBytes(key));\n    }\n    catch (err) {\n        console.error(err);\n        return false;\n    }\n}\nexport const Tools = { convert, sign, sweep, verify };\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Account } from './lib/account.js';\nimport { Blake2b } from './lib/blake2b.js';\nimport { SendBlock, ReceiveBlock, ChangeBlock } from './lib/block.js';\nimport { Pow } from './lib/workers/powgl.js';\nimport { Rpc } from './lib/rpc.js';\nimport { Rolodex } from './lib/rolodex.js';\nimport { Safe } from './lib/safe.js';\nimport { Tools } from './lib/tools.js';\nimport { Bip44Wallet, Blake2bWallet, LedgerWallet } from './lib/wallet.js';\nexport { Account, Blake2b, SendBlock, ReceiveBlock, ChangeBlock, Pow, Rpc, Rolodex, Safe, Tools, Bip44Wallet, Blake2bWallet, LedgerWallet };\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Account } from './account.js';\n/**\n* Represents a basic address book of Nano accounts. Multiple addresses can be\n* saved under one nickname.\n*/\nexport class Rolodex {\n    #entries = [];\n    /**\n    * Adds an address to the rolodex under a specific nickname.\n    *\n    * If the name exists, add the address as a new association to that name. If\n    * the account exists under a different name, update the name. If no matches\n    * are found at all, add a completely new entry.\n    *\n    * @param {string} name - Alias for the address\n    * @param {string} address - Nano account address\n    */\n    async add(name, address) {\n        if (name == null || name === '') {\n            throw new Error('Name is required for rolodex entries');\n        }\n        if (typeof name !== 'string') {\n            throw new Error('Name must be a string for rolodex entries');\n        }\n        if (address == null || address === '') {\n            throw new Error('Address is required for rolodex entries');\n        }\n        if (typeof address !== 'string') {\n            throw new Error('Address must be a string for rolodex entries');\n        }\n        name = name\n            .replaceAll('/', '\\\\u002f')\n            .replaceAll('<', '\\\\u003c')\n            .replaceAll('>', '\\\\u003d')\n            .replaceAll('\\\\', '\\\\u005c');\n        const account = Account.fromAddress(address);\n        const nameResult = this.#entries.find(e => e.name === name);\n        const accountResult = this.#entries.find(e => e.account.address === address);\n        if (!accountResult) {\n            this.#entries.push({ name, account });\n        }\n        else if (!nameResult) {\n            accountResult.name = name;\n        }\n    }\n    /**\n    * Gets the name associated with a specific Nano address from the rolodex.\n    *\n    * @param {string} address - Nano account address\n    * @returns {string|null} Name associated with the address, or null if not found\n    */\n    getName(address) {\n        const result = this.#entries.find(e => e.account.address === address);\n        return result?.name ?? null;\n    }\n    /**\n    * Gets all Nano addresses associated with a name from the rolodex.\n    *\n    * @param {string} name - Alias to look up\n    * @returns {string[]} List of Nano addresses associated with the name\n    */\n    getAddresses(name) {\n        const entries = this.#entries.filter(e => e.name === name);\n        return entries.map(a => a.account.address);\n    }\n    /**\n    * Gets all names stored in the rolodex.\n    *\n    * @returns {string[]} List of names stored in the rolodex\n    */\n    getAllNames() {\n        return this.#entries.map(e => e.name);\n    }\n    /**\n    * Verifies whether the public key of any Nano address saved under a specific\n    * name in the rolodex was used to sign a specific set of data.\n    *\n    * @param {string} name - Alias to look up\n    * @param {string} signature - Signature to use for verification\n    * @param {...string} data - Signed data to verify\n    * @returns {Promise<boolean>} True if the signature was used to sign the data, else false\n    */\n    async verify(name, signature, ...data) {\n        const { Tools } = await import('./tools.js');\n        const entries = this.#entries.filter(e => e.name === name);\n        for (const entry of entries) {\n            const key = entry.account.publicKey;\n            const verified = await Tools.verify(key, signature, ...data);\n            if (verified) {\n                return true;\n            }\n        }\n        return false;\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Account } from './account.js';\nimport { Blake2b } from './blake2b.js';\nimport { Bip39Mnemonic } from './bip39-mnemonic.js';\nimport { ADDRESS_GAP, SEED_LENGTH_BIP44, SEED_LENGTH_BLAKE2B } from './constants.js';\nimport { Entropy } from './entropy.js';\nimport { Pool } from './pool.js';\nimport { Rpc } from './rpc.js';\nimport { Safe } from './safe.js';\nimport { Bip44Ckd, NanoNaCl } from './workers.js';\n/**\n* Represents a wallet containing numerous Nano accounts derived from a single\n* source, the form of which can vary based on the type of wallet. The Wallet\n* class itself is abstract and cannot be directly instantiated. Currently, three\n* types of wallets are supported, each as a derived class: Bip44Wallet,\n* Blake2bWallet, LedgerWallet.\n*/\nclass Wallet {\n    #accounts;\n    #id;\n    #locked = true;\n    #mnemonic;\n    #poolNanoNacl;\n    #safe;\n    #seed;\n    get id() { return this.#id.hex; }\n    get isLocked() { return this.#locked; }\n    get isUnlocked() { return !this.#locked; }\n    get mnemonic() {\n        if (this.#mnemonic instanceof Bip39Mnemonic) {\n            return this.#mnemonic.phrase;\n        }\n        return '';\n    }\n    get seed() {\n        if (typeof this.#seed === 'string') {\n            return this.#seed;\n        }\n        return '';\n    }\n    constructor(id, seed, mnemonic) {\n        if (this.constructor === Wallet) {\n            throw new Error('Wallet is an abstract class and cannot be instantiated directly.');\n        }\n        this.#accounts = [];\n        this.#id = id;\n        this.#mnemonic = mnemonic ?? null;\n        this.#poolNanoNacl = new Pool(NanoNaCl);\n        this.#safe = new Safe();\n        this.#seed = seed ?? null;\n    }\n    /**\n    * Retrieves accounts from a wallet using its child key derivation function.\n    * Defaults to the first account at index 0.\n    *\n    * Note: The wallet index of a given requested account might not correlate with\n    * its index in the returned array.\n    *\n    * For example, calling `await wallet.accounts(5)` will return the sixth\n    * account of the wallet in the first array element position at index 0.\n    *\n    * A shorthand way of getting one specific account could be\n    * `const account = (await wallet.accounts(N))[0]` where N is the wallet index\n    * of the desired account.\n    *\n    * @param {number} from - Start index of secret keys. Default: 0\n    * @param {number} to - End index of secret keys. Default: `from`\n    */\n    async accounts(from = 0, to = from) {\n        if (from > to) {\n            const swap = from;\n            from = to;\n            to = swap;\n        }\n        const indexes = [];\n        for (let i = from; i <= to; i++) {\n            if (this.#accounts[i] == null) {\n                indexes.push(i);\n            }\n        }\n        if (indexes.length > 0) {\n            let results = await this.ckd(indexes);\n            const data = [];\n            results.forEach(r => data.push({ privateKey: r.privateKey, index: r.index }));\n            const keypairs = await this.#poolNanoNacl.assign(data);\n            for (const keypair of keypairs) {\n                if (keypair.privateKey == null)\n                    throw new RangeError('Account private key missing');\n                if (keypair.publicKey == null)\n                    throw new RangeError('Account public key missing');\n                if (keypair.index == null)\n                    throw new RangeError('Account keys derived but index missing');\n                const { privateKey, publicKey, index } = keypair;\n                this.#accounts[keypair.index] = Account.fromKeypair(privateKey, publicKey, index);\n            }\n        }\n        return this.#accounts.slice(from, to + 1);\n    }\n    /**\n    * Fetches the lowest-indexed unopened account from a wallet in sequential\n    * order. An account is unopened if it has no frontier block.\n    *\n    * @param {Rpc|string|URL} rpc - RPC node information required to refresh accounts, calculate PoW, and process blocks\n    * @param {number} batchSize - Number of accounts to fetch and check per RPC callout\n    * @param {number} from - Account index from which to start the search\n    * @returns {Promise<Account>} The lowest-indexed unopened account belonging to the wallet\n    */\n    async getNextNewAccount(rpc, batchSize = ADDRESS_GAP, from = 0) {\n        if (!Number.isSafeInteger(batchSize) || batchSize < 1) {\n            throw new RangeError(`Invalid batch size ${batchSize}`);\n        }\n        const accounts = await this.accounts(from, from + batchSize - 1);\n        const addresses = accounts.map(({ address }) => address);\n        const data = {\n            \"accounts\": addresses\n        };\n        const { errors } = await rpc.call('accounts_frontiers', data);\n        for (const key of Object.keys(errors ?? {})) {\n            const value = errors[key];\n            if (value === 'Account not found') {\n                return Account.fromAddress(key);\n            }\n        }\n        return await this.getNextNewAccount(rpc, batchSize, from + batchSize);\n    }\n    /**\n    * Refreshes wallet account balances, frontiers, and representatives from the\n    * current state on the network.\n    *\n    * A successful response will set these properties on each account.\n    *\n    * @param {Rpc|string|URL} rpc - RPC node information required to refresh accounts, calculate PoW, and process blocks\n    * @returns {Promise<Account[]>} Accounts with updated balances, frontiers, and representatives\n    */\n    async refresh(rpc, from = 0, to = from) {\n        if (typeof rpc === 'string' || rpc.constructor === URL) {\n            rpc = new Rpc(rpc);\n        }\n        if (rpc.constructor !== Rpc) {\n            throw new TypeError('RPC must be a valid node');\n        }\n        const accounts = await this.accounts(from, to);\n        for (let i = 0; i < accounts.length; i++) {\n            try {\n                await accounts[i].refresh(rpc);\n            }\n            catch (err) {\n                accounts.splice(i--, 1);\n            }\n        }\n        return accounts;\n    }\n    async lock(passkey) {\n        let success = true;\n        try {\n            const data = {\n                id: this.id,\n                mnemonic: null,\n                seed: null\n            };\n            if (this.#mnemonic instanceof Bip39Mnemonic) {\n                data.mnemonic = this.#mnemonic.phrase;\n            }\n            if (typeof this.#seed === 'string') {\n                data.seed = this.#seed;\n            }\n            success &&= await this.#safe.put(this.id, passkey, data);\n            await Promise.all(this.#accounts.map((a) => a.lock(passkey)));\n            if (!success) {\n                throw null;\n            }\n        }\n        catch (err) {\n            throw new Error('Failed to lock wallet');\n        }\n        this.#locked = true;\n        this.#mnemonic = null;\n        this.#seed = null;\n        return true;\n    }\n    async unlock(passkey) {\n        try {\n            const { id, mnemonic, seed } = await this.#safe.get(this.id, passkey);\n            if (id !== this.id) {\n                throw null;\n            }\n            await Promise.all(this.#accounts.map((a) => a.unlock(passkey)));\n            if (mnemonic != null) {\n                this.#mnemonic = await Bip39Mnemonic.fromPhrase(mnemonic);\n            }\n            if (seed != null) {\n                this.#seed = seed;\n            }\n            this.#locked = false;\n        }\n        catch (err) {\n            throw new Error('Failed to unlock wallet');\n        }\n        return true;\n    }\n}\n/**\n* Hierarchical deterministic (HD) wallet created by using a source of entropy to\n* derive a mnemonic phrase. The mnemonic phrase, in combination with an optional\n* salt, is used to generate a seed. A value can be provided as a parameter for\n* entropy, mnemonic + salt, or seed; if no argument is passed, a new entropy\n* value will be generated using a cryptographically strong pseudorandom number\n* generator.\n*\n* Importantly, the salt is not stored in the instantiated Wallet object. If a\n* salt is used, then losing it means losing the ability to regenerate the seed\n* from the mnemonic.\n*\n* Accounts are derived from the seed. Private keys are derived using a BIP-44\n* derivation path. The public key is derived from the private key using the\n* Ed25519 key algorithm. Account addresses are derived as described in the nano\n* documentation (https://docs.nano.org)\n*\n* A password must be provided when creating or importing the wallet and is used\n* to lock and unlock the wallet. The wallet will be initialized as locked. When\n* the wallet is unlocked, a new password can be specified using the lock()\n* method.\n*/\nexport class Bip44Wallet extends Wallet {\n    static #isInternal = false;\n    static #poolBip44Ckd = new Pool(Bip44Ckd);\n    constructor(id, seed, mnemonic) {\n        if (!Bip44Wallet.#isInternal) {\n            throw new Error(`Bip44Wallet cannot be instantiated directly. Use 'await Bip44Wallet.create()' instead.`);\n        }\n        Bip44Wallet.#isInternal = false;\n        super(id, seed, mnemonic);\n    }\n    static async create(passkey, salt = '') {\n        try {\n            const e = await Entropy.create();\n            return await Bip44Wallet.fromEntropy(passkey, e.hex, salt);\n        }\n        catch (err) {\n            throw new Error(`Error creating new Bip44Wallet: ${err}`);\n        }\n    }\n    static async fromEntropy(passkey, entropy, salt = '') {\n        try {\n            const id = await Entropy.create(16);\n            const e = await Entropy.import(entropy);\n            const m = await Bip39Mnemonic.fromEntropy(e.hex);\n            const s = await m.toBip39Seed(salt);\n            Bip44Wallet.#isInternal = true;\n            const wallet = new this(id, s, m);\n            await wallet.lock(passkey);\n            return wallet;\n        }\n        catch (err) {\n            throw new Error(`Error importing Bip44Wallet from entropy: ${err}`);\n        }\n    }\n    static async fromMnemonic(passkey, mnemonic, salt = '') {\n        try {\n            const id = await Entropy.create(16);\n            const m = await Bip39Mnemonic.fromPhrase(mnemonic);\n            const s = await m.toBip39Seed(salt);\n            Bip44Wallet.#isInternal = true;\n            const wallet = new this(id, s, m);\n            await wallet.lock(passkey);\n            return wallet;\n        }\n        catch (err) {\n            throw new Error(`Error importing Bip44Wallet from mnemonic: ${err}`);\n        }\n    }\n    static async fromSeed(passkey, seed) {\n        if (seed.length !== SEED_LENGTH_BIP44) {\n            throw new Error(`Expected a ${SEED_LENGTH_BIP44}-character seed, but received ${seed.length}-character string.`);\n        }\n        if (!/^[0-9a-fA-F]+$/i.test(seed)) {\n            throw new Error('Seed contains invalid hexadecimal characters.');\n        }\n        const id = await Entropy.create(16);\n        Bip44Wallet.#isInternal = true;\n        const wallet = new this(id, seed);\n        await wallet.lock(passkey);\n        return wallet;\n    }\n    /**\n    * Retrieves an existing HD wallet from session storage using its ID.\n    *\n    * @param {string} id - Generated when the wallet was initially created\n    * @returns {Bip44Wallet} Restored locked Bip44Wallet\n    */\n    static async restore(id) {\n        if (typeof id !== 'string' || id === '') {\n            throw new TypeError('Wallet ID is required to restore');\n        }\n        Bip44Wallet.#isInternal = true;\n        return new this(await Entropy.import(id), '');\n    }\n    /**\n    * Derives BIP-44 Nano account private keys.\n    *\n    * @param {number[]} indexes - Indexes of the accounts\n    * @returns {Promise<Account>}\n    */\n    async ckd(indexes) {\n        const data = [];\n        indexes.forEach(i => data.push({ seed: this.seed, index: i }));\n        const privateKeys = await Bip44Wallet.#poolBip44Ckd.assign(data);\n        return privateKeys;\n    }\n}\n/**\n* BLAKE2b wallet created by deriving a mnemonic phrase from a seed or vice\n* versa. If no value is provided for either, a new BIP-39 seed and mnemonic will\n* be generated using a cryptographically strong pseudorandom number generator.\n*\n* Account private keys are derived on an ad hoc basis using the Blake2b hashing\n* function. Account public key are derived from the private key using the\n* Ed25519 key algorithm. Account addresses are derived from the public key as\n* described in the Nano documentation.\n* https://docs.nano.org/integration-guides/the-basics/\n*\n* A password must be provided when creating or importing the wallet and is used\n* to lock and unlock the wallet. The wallet will be initialized as locked. When\n* the wallet is unlocked, a new password can be specified using the lock()\n* method.\n*/\nexport class Blake2bWallet extends Wallet {\n    static #isInternal = false;\n    constructor(id, seed, mnemonic) {\n        if (!Blake2bWallet.#isInternal) {\n            throw new Error(`Blake2bWallet cannot be instantiated directly. Use 'await Blake2bWallet.create()' instead.`);\n        }\n        Blake2bWallet.#isInternal = false;\n        super(id, seed, mnemonic);\n    }\n    static async create(passkey) {\n        try {\n            const seed = await Entropy.create();\n            return await Blake2bWallet.fromSeed(passkey, seed.hex);\n        }\n        catch (err) {\n            throw new Error(`Error creating new Blake2bWallet: ${err}`);\n        }\n    }\n    static async fromSeed(passkey, seed) {\n        if (seed.length !== SEED_LENGTH_BLAKE2B) {\n            throw new Error(`Expected a ${SEED_LENGTH_BLAKE2B}-character seed, but received ${seed.length}-character string.`);\n        }\n        if (!/^[0-9a-fA-F]+$/i.test(seed)) {\n            throw new Error('Seed contains invalid hexadecimal characters.');\n        }\n        const id = await Entropy.create(16);\n        const s = seed;\n        const m = await Bip39Mnemonic.fromEntropy(seed);\n        Blake2bWallet.#isInternal = true;\n        const wallet = new this(id, s, m);\n        await wallet.lock(passkey);\n        return wallet;\n    }\n    static async fromMnemonic(passkey, mnemonic) {\n        try {\n            const id = await Entropy.create(16);\n            const m = await Bip39Mnemonic.fromPhrase(mnemonic);\n            const s = await m.toBlake2bSeed();\n            Blake2bWallet.#isInternal = true;\n            const wallet = new this(id, s, m);\n            await wallet.lock(passkey);\n            return wallet;\n        }\n        catch (err) {\n            throw new Error(`Error importing Blake2bWallet from mnemonic: ${err}`);\n        }\n    }\n    /**\n    * Retrieves an existing BLAKE2b wallet from session storage using its ID.\n    *\n    * @param {string} id - Generated when the wallet was initially created\n    * @returns {Blake2bWallet} Restored locked Blake2bWallet\n    */\n    static async restore(id) {\n        if (typeof id !== 'string' || id === '') {\n            throw new TypeError('Wallet ID is required to restore');\n        }\n        Blake2bWallet.#isInternal = true;\n        return new this(await Entropy.import(id), '');\n    }\n    /**\n    * Derives BLAKE2b account private keys.\n    *\n    * @param {number[]} indexes - Indexes of the accounts\n    * @returns {Promise<Account>}\n    */\n    async ckd(indexes) {\n        const results = indexes.map(index => {\n            const indexHex = index.toString(16).padStart(8, '0').toUpperCase();\n            const inputHex = `${this.seed}${indexHex}`.padStart(72, '0');\n            const inputArray = (inputHex.match(/.{1,2}/g) ?? []).map(h => parseInt(h, 16));\n            const inputBytes = Uint8Array.from(inputArray);\n            const privateKey = new Blake2b(32).update(inputBytes).digest('hex');\n            return { privateKey, index };\n        });\n        return results;\n    }\n}\n/**\n* Ledger hardware wallet created by communicating with a Ledger device via ADPU\n* calls. This wallet does not feature any seed nor mnemonic phrase as all\n* private keys are held in the secure chip of the device. As such, the user\n* is responsible for using Ledger technology to back up these pieces of data.\n*\n* Usage of this wallet is generally controlled by calling functions of the\n* `ledger` object. For example, the wallet interface should have a button to\n* initiate a device connection by calling `wallet.ledger.connect()`. For more\n* information, refer to the ledger.js service file.\n*/\nexport class LedgerWallet extends Wallet {\n    static #isInternal = false;\n    #ledger;\n    get ledger() { return this.#ledger; }\n    constructor(id, ledger) {\n        if (!LedgerWallet.#isInternal) {\n            throw new Error(`LedgerWallet cannot be instantiated directly. Use 'await LedgerWallet.create()' instead.`);\n        }\n        LedgerWallet.#isInternal = false;\n        super(id);\n        this.#ledger = ledger;\n    }\n    /**\n    * Creates a new Ledger hardware wallet communication layer by dynamically\n    * importing the ledger.js service.\n    *\n    * @returns {LedgerWallet} A wallet containing accounts and a Ledger device communication object\n    */\n    static async create() {\n        const { Ledger } = await import('./ledger.js');\n        const l = await Ledger.init();\n        const id = await Entropy.create(16);\n        LedgerWallet.#isInternal = true;\n        return new this(id, l);\n    }\n    /**\n    * Retrieves an existing Ledger wallet from session storage using its ID.\n    *\n    * @param {string} id - Generated when the wallet was initially created\n    * @returns {LedgerWallet} Restored LedgerWallet\n    */\n    static async restore(id) {\n        if (typeof id !== 'string' || id === '') {\n            throw new TypeError('Wallet ID is required to restore');\n        }\n        const { Ledger } = await import('./ledger.js');\n        const l = await Ledger.init();\n        LedgerWallet.#isInternal = true;\n        return new this(await Entropy.import(id), l);\n    }\n    /**\n    * Gets the public key for an account from the Ledger device.\n    *\n    * @param {number[]} indexes - Indexes of the accounts\n    * @returns {Promise<Account>}\n    */\n    async ckd(indexes) {\n        const results = [];\n        for (const index of indexes) {\n            const { status, publicKey } = await this.ledger.account(index);\n            if (status === 'OK' && publicKey != null) {\n                results.push({ publicKey, index });\n            }\n            else {\n                throw new Error(`Error getting Ledger account: ${status}`);\n            }\n        }\n        return results;\n    }\n    /**\n    * Attempts to close the current process on the Ledger device.\n    *\n    * Overrides the default wallet `lock()` method since as a hardware wallet it\n    * does not need to be encrypted by software.\n    *\n    * @returns True if successfully locked\n    */\n    async lock() {\n        if (this.ledger == null) {\n            return false;\n        }\n        const result = await this.ledger.close();\n        return result === 'OK';\n    }\n    /**\n    * Attempts to connect to the Ledger device.\n    *\n    * Overrides the default wallet `unlock()` method since as a hardware wallet it\n    * does not need to be encrypted by software.\n    *\n    * @returns True if successfully unlocked\n    */\n    async unlock() {\n        if (this.ledger == null) {\n            return false;\n        }\n        const result = await this.ledger.connect();\n        return result === 'OK';\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\n/**\n* https://github.com/bitcoin/bips/blob/master/bip-0039/english.txt\n*/\nexport const Bip39Words = Object.freeze([\n    'abandon',\n    'ability',\n    'able',\n    'about',\n    'above',\n    'absent',\n    'absorb',\n    'abstract',\n    'absurd',\n    'abuse',\n    'access',\n    'accident',\n    'account',\n    'accuse',\n    'achieve',\n    'acid',\n    'acoustic',\n    'acquire',\n    'across',\n    'act',\n    'action',\n    'actor',\n    'actress',\n    'actual',\n    'adapt',\n    'add',\n    'addict',\n    'address',\n    'adjust',\n    'admit',\n    'adult',\n    'advance',\n    'advice',\n    'aerobic',\n    'affair',\n    'afford',\n    'afraid',\n    'again',\n    'age',\n    'agent',\n    'agree',\n    'ahead',\n    'aim',\n    'air',\n    'airport',\n    'aisle',\n    'alarm',\n    'album',\n    'alcohol',\n    'alert',\n    'alien',\n    'all',\n    'alley',\n    'allow',\n    'almost',\n    'alone',\n    'alpha',\n    'already',\n    'also',\n    'alter',\n    'always',\n    'amateur',\n    'amazing',\n    'among',\n    'amount',\n    'amused',\n    'analyst',\n    'anchor',\n    'ancient',\n    'anger',\n    'angle',\n    'angry',\n    'animal',\n    'ankle',\n    'announce',\n    'annual',\n    'another',\n    'answer',\n    'antenna',\n    'antique',\n    'anxiety',\n    'any',\n    'apart',\n    'apology',\n    'appear',\n    'apple',\n    'approve',\n    'april',\n    'arch',\n    'arctic',\n    'area',\n    'arena',\n    'argue',\n    'arm',\n    'armed',\n    'armor',\n    'army',\n    'around',\n    'arrange',\n    'arrest',\n    'arrive',\n    'arrow',\n    'art',\n    'artefact',\n    'artist',\n    'artwork',\n    'ask',\n    'aspect',\n    'assault',\n    'asset',\n    'assist',\n    'assume',\n    'asthma',\n    'athlete',\n    'atom',\n    'attack',\n    'attend',\n    'attitude',\n    'attract',\n    'auction',\n    'audit',\n    'august',\n    'aunt',\n    'author',\n    'auto',\n    'autumn',\n    'average',\n    'avocado',\n    'avoid',\n    'awake',\n    'aware',\n    'away',\n    'awesome',\n    'awful',\n    'awkward',\n    'axis',\n    'baby',\n    'bachelor',\n    'bacon',\n    'badge',\n    'bag',\n    'balance',\n    'balcony',\n    'ball',\n    'bamboo',\n    'banana',\n    'banner',\n    'bar',\n    'barely',\n    'bargain',\n    'barrel',\n    'base',\n    'basic',\n    'basket',\n    'battle',\n    'beach',\n    'bean',\n    'beauty',\n    'because',\n    'become',\n    'beef',\n    'before',\n    'begin',\n    'behave',\n    'behind',\n    'believe',\n    'below',\n    'belt',\n    'bench',\n    'benefit',\n    'best',\n    'betray',\n    'better',\n    'between',\n    'beyond',\n    'bicycle',\n    'bid',\n    'bike',\n    'bind',\n    'biology',\n    'bird',\n    'birth',\n    'bitter',\n    'black',\n    'blade',\n    'blame',\n    'blanket',\n    'blast',\n    'bleak',\n    'bless',\n    'blind',\n    'blood',\n    'blossom',\n    'blouse',\n    'blue',\n    'blur',\n    'blush',\n    'board',\n    'boat',\n    'body',\n    'boil',\n    'bomb',\n    'bone',\n    'bonus',\n    'book',\n    'boost',\n    'border',\n    'boring',\n    'borrow',\n    'boss',\n    'bottom',\n    'bounce',\n    'box',\n    'boy',\n    'bracket',\n    'brain',\n    'brand',\n    'brass',\n    'brave',\n    'bread',\n    'breeze',\n    'brick',\n    'bridge',\n    'brief',\n    'bright',\n    'bring',\n    'brisk',\n    'broccoli',\n    'broken',\n    'bronze',\n    'broom',\n    'brother',\n    'brown',\n    'brush',\n    'bubble',\n    'buddy',\n    'budget',\n    'buffalo',\n    'build',\n    'bulb',\n    'bulk',\n    'bullet',\n    'bundle',\n    'bunker',\n    'burden',\n    'burger',\n    'burst',\n    'bus',\n    'business',\n    'busy',\n    'butter',\n    'buyer',\n    'buzz',\n    'cabbage',\n    'cabin',\n    'cable',\n    'cactus',\n    'cage',\n    'cake',\n    'call',\n    'calm',\n    'camera',\n    'camp',\n    'can',\n    'canal',\n    'cancel',\n    'candy',\n    'cannon',\n    'canoe',\n    'canvas',\n    'canyon',\n    'capable',\n    'capital',\n    'captain',\n    'car',\n    'carbon',\n    'card',\n    'cargo',\n    'carpet',\n    'carry',\n    'cart',\n    'case',\n    'cash',\n    'casino',\n    'castle',\n    'casual',\n    'cat',\n    'catalog',\n    'catch',\n    'category',\n    'cattle',\n    'caught',\n    'cause',\n    'caution',\n    'cave',\n    'ceiling',\n    'celery',\n    'cement',\n    'census',\n    'century',\n    'cereal',\n    'certain',\n    'chair',\n    'chalk',\n    'champion',\n    'change',\n    'chaos',\n    'chapter',\n    'charge',\n    'chase',\n    'chat',\n    'cheap',\n    'check',\n    'cheese',\n    'chef',\n    'cherry',\n    'chest',\n    'chicken',\n    'chief',\n    'child',\n    'chimney',\n    'choice',\n    'choose',\n    'chronic',\n    'chuckle',\n    'chunk',\n    'churn',\n    'cigar',\n    'cinnamon',\n    'circle',\n    'citizen',\n    'city',\n    'civil',\n    'claim',\n    'clap',\n    'clarify',\n    'claw',\n    'clay',\n    'clean',\n    'clerk',\n    'clever',\n    'click',\n    'client',\n    'cliff',\n    'climb',\n    'clinic',\n    'clip',\n    'clock',\n    'clog',\n    'close',\n    'cloth',\n    'cloud',\n    'clown',\n    'club',\n    'clump',\n    'cluster',\n    'clutch',\n    'coach',\n    'coast',\n    'coconut',\n    'code',\n    'coffee',\n    'coil',\n    'coin',\n    'collect',\n    'color',\n    'column',\n    'combine',\n    'come',\n    'comfort',\n    'comic',\n    'common',\n    'company',\n    'concert',\n    'conduct',\n    'confirm',\n    'congress',\n    'connect',\n    'consider',\n    'control',\n    'convince',\n    'cook',\n    'cool',\n    'copper',\n    'copy',\n    'coral',\n    'core',\n    'corn',\n    'correct',\n    'cost',\n    'cotton',\n    'couch',\n    'country',\n    'couple',\n    'course',\n    'cousin',\n    'cover',\n    'coyote',\n    'crack',\n    'cradle',\n    'craft',\n    'cram',\n    'crane',\n    'crash',\n    'crater',\n    'crawl',\n    'crazy',\n    'cream',\n    'credit',\n    'creek',\n    'crew',\n    'cricket',\n    'crime',\n    'crisp',\n    'critic',\n    'crop',\n    'cross',\n    'crouch',\n    'crowd',\n    'crucial',\n    'cruel',\n    'cruise',\n    'crumble',\n    'crunch',\n    'crush',\n    'cry',\n    'crystal',\n    'cube',\n    'culture',\n    'cup',\n    'cupboard',\n    'curious',\n    'current',\n    'curtain',\n    'curve',\n    'cushion',\n    'custom',\n    'cute',\n    'cycle',\n    'dad',\n    'damage',\n    'damp',\n    'dance',\n    'danger',\n    'daring',\n    'dash',\n    'daughter',\n    'dawn',\n    'day',\n    'deal',\n    'debate',\n    'debris',\n    'decade',\n    'december',\n    'decide',\n    'decline',\n    'decorate',\n    'decrease',\n    'deer',\n    'defense',\n    'define',\n    'defy',\n    'degree',\n    'delay',\n    'deliver',\n    'demand',\n    'demise',\n    'denial',\n    'dentist',\n    'deny',\n    'depart',\n    'depend',\n    'deposit',\n    'depth',\n    'deputy',\n    'derive',\n    'describe',\n    'desert',\n    'design',\n    'desk',\n    'despair',\n    'destroy',\n    'detail',\n    'detect',\n    'develop',\n    'device',\n    'devote',\n    'diagram',\n    'dial',\n    'diamond',\n    'diary',\n    'dice',\n    'diesel',\n    'diet',\n    'differ',\n    'digital',\n    'dignity',\n    'dilemma',\n    'dinner',\n    'dinosaur',\n    'direct',\n    'dirt',\n    'disagree',\n    'discover',\n    'disease',\n    'dish',\n    'dismiss',\n    'disorder',\n    'display',\n    'distance',\n    'divert',\n    'divide',\n    'divorce',\n    'dizzy',\n    'doctor',\n    'document',\n    'dog',\n    'doll',\n    'dolphin',\n    'domain',\n    'donate',\n    'donkey',\n    'donor',\n    'door',\n    'dose',\n    'double',\n    'dove',\n    'draft',\n    'dragon',\n    'drama',\n    'drastic',\n    'draw',\n    'dream',\n    'dress',\n    'drift',\n    'drill',\n    'drink',\n    'drip',\n    'drive',\n    'drop',\n    'drum',\n    'dry',\n    'duck',\n    'dumb',\n    'dune',\n    'during',\n    'dust',\n    'dutch',\n    'duty',\n    'dwarf',\n    'dynamic',\n    'eager',\n    'eagle',\n    'early',\n    'earn',\n    'earth',\n    'easily',\n    'east',\n    'easy',\n    'echo',\n    'ecology',\n    'economy',\n    'edge',\n    'edit',\n    'educate',\n    'effort',\n    'egg',\n    'eight',\n    'either',\n    'elbow',\n    'elder',\n    'electric',\n    'elegant',\n    'element',\n    'elephant',\n    'elevator',\n    'elite',\n    'else',\n    'embark',\n    'embody',\n    'embrace',\n    'emerge',\n    'emotion',\n    'employ',\n    'empower',\n    'empty',\n    'enable',\n    'enact',\n    'end',\n    'endless',\n    'endorse',\n    'enemy',\n    'energy',\n    'enforce',\n    'engage',\n    'engine',\n    'enhance',\n    'enjoy',\n    'enlist',\n    'enough',\n    'enrich',\n    'enroll',\n    'ensure',\n    'enter',\n    'entire',\n    'entry',\n    'envelope',\n    'episode',\n    'equal',\n    'equip',\n    'era',\n    'erase',\n    'erode',\n    'erosion',\n    'error',\n    'erupt',\n    'escape',\n    'essay',\n    'essence',\n    'estate',\n    'eternal',\n    'ethics',\n    'evidence',\n    'evil',\n    'evoke',\n    'evolve',\n    'exact',\n    'example',\n    'excess',\n    'exchange',\n    'excite',\n    'exclude',\n    'excuse',\n    'execute',\n    'exercise',\n    'exhaust',\n    'exhibit',\n    'exile',\n    'exist',\n    'exit',\n    'exotic',\n    'expand',\n    'expect',\n    'expire',\n    'explain',\n    'expose',\n    'express',\n    'extend',\n    'extra',\n    'eye',\n    'eyebrow',\n    'fabric',\n    'face',\n    'faculty',\n    'fade',\n    'faint',\n    'faith',\n    'fall',\n    'false',\n    'fame',\n    'family',\n    'famous',\n    'fan',\n    'fancy',\n    'fantasy',\n    'farm',\n    'fashion',\n    'fat',\n    'fatal',\n    'father',\n    'fatigue',\n    'fault',\n    'favorite',\n    'feature',\n    'february',\n    'federal',\n    'fee',\n    'feed',\n    'feel',\n    'female',\n    'fence',\n    'festival',\n    'fetch',\n    'fever',\n    'few',\n    'fiber',\n    'fiction',\n    'field',\n    'figure',\n    'file',\n    'film',\n    'filter',\n    'final',\n    'find',\n    'fine',\n    'finger',\n    'finish',\n    'fire',\n    'firm',\n    'first',\n    'fiscal',\n    'fish',\n    'fit',\n    'fitness',\n    'fix',\n    'flag',\n    'flame',\n    'flash',\n    'flat',\n    'flavor',\n    'flee',\n    'flight',\n    'flip',\n    'float',\n    'flock',\n    'floor',\n    'flower',\n    'fluid',\n    'flush',\n    'fly',\n    'foam',\n    'focus',\n    'fog',\n    'foil',\n    'fold',\n    'follow',\n    'food',\n    'foot',\n    'force',\n    'forest',\n    'forget',\n    'fork',\n    'fortune',\n    'forum',\n    'forward',\n    'fossil',\n    'foster',\n    'found',\n    'fox',\n    'fragile',\n    'frame',\n    'frequent',\n    'fresh',\n    'friend',\n    'fringe',\n    'frog',\n    'front',\n    'frost',\n    'frown',\n    'frozen',\n    'fruit',\n    'fuel',\n    'fun',\n    'funny',\n    'furnace',\n    'fury',\n    'future',\n    'gadget',\n    'gain',\n    'galaxy',\n    'gallery',\n    'game',\n    'gap',\n    'garage',\n    'garbage',\n    'garden',\n    'garlic',\n    'garment',\n    'gas',\n    'gasp',\n    'gate',\n    'gather',\n    'gauge',\n    'gaze',\n    'general',\n    'genius',\n    'genre',\n    'gentle',\n    'genuine',\n    'gesture',\n    'ghost',\n    'giant',\n    'gift',\n    'giggle',\n    'ginger',\n    'giraffe',\n    'girl',\n    'give',\n    'glad',\n    'glance',\n    'glare',\n    'glass',\n    'glide',\n    'glimpse',\n    'globe',\n    'gloom',\n    'glory',\n    'glove',\n    'glow',\n    'glue',\n    'goat',\n    'goddess',\n    'gold',\n    'good',\n    'goose',\n    'gorilla',\n    'gospel',\n    'gossip',\n    'govern',\n    'gown',\n    'grab',\n    'grace',\n    'grain',\n    'grant',\n    'grape',\n    'grass',\n    'gravity',\n    'great',\n    'green',\n    'grid',\n    'grief',\n    'grit',\n    'grocery',\n    'group',\n    'grow',\n    'grunt',\n    'guard',\n    'guess',\n    'guide',\n    'guilt',\n    'guitar',\n    'gun',\n    'gym',\n    'habit',\n    'hair',\n    'half',\n    'hammer',\n    'hamster',\n    'hand',\n    'happy',\n    'harbor',\n    'hard',\n    'harsh',\n    'harvest',\n    'hat',\n    'have',\n    'hawk',\n    'hazard',\n    'head',\n    'health',\n    'heart',\n    'heavy',\n    'hedgehog',\n    'height',\n    'hello',\n    'helmet',\n    'help',\n    'hen',\n    'hero',\n    'hidden',\n    'high',\n    'hill',\n    'hint',\n    'hip',\n    'hire',\n    'history',\n    'hobby',\n    'hockey',\n    'hold',\n    'hole',\n    'holiday',\n    'hollow',\n    'home',\n    'honey',\n    'hood',\n    'hope',\n    'horn',\n    'horror',\n    'horse',\n    'hospital',\n    'host',\n    'hotel',\n    'hour',\n    'hover',\n    'hub',\n    'huge',\n    'human',\n    'humble',\n    'humor',\n    'hundred',\n    'hungry',\n    'hunt',\n    'hurdle',\n    'hurry',\n    'hurt',\n    'husband',\n    'hybrid',\n    'ice',\n    'icon',\n    'idea',\n    'identify',\n    'idle',\n    'ignore',\n    'ill',\n    'illegal',\n    'illness',\n    'image',\n    'imitate',\n    'immense',\n    'immune',\n    'impact',\n    'impose',\n    'improve',\n    'impulse',\n    'inch',\n    'include',\n    'income',\n    'increase',\n    'index',\n    'indicate',\n    'indoor',\n    'industry',\n    'infant',\n    'inflict',\n    'inform',\n    'inhale',\n    'inherit',\n    'initial',\n    'inject',\n    'injury',\n    'inmate',\n    'inner',\n    'innocent',\n    'input',\n    'inquiry',\n    'insane',\n    'insect',\n    'inside',\n    'inspire',\n    'install',\n    'intact',\n    'interest',\n    'into',\n    'invest',\n    'invite',\n    'involve',\n    'iron',\n    'island',\n    'isolate',\n    'issue',\n    'item',\n    'ivory',\n    'jacket',\n    'jaguar',\n    'jar',\n    'jazz',\n    'jealous',\n    'jeans',\n    'jelly',\n    'jewel',\n    'job',\n    'join',\n    'joke',\n    'journey',\n    'joy',\n    'judge',\n    'juice',\n    'jump',\n    'jungle',\n    'junior',\n    'junk',\n    'just',\n    'kangaroo',\n    'keen',\n    'keep',\n    'ketchup',\n    'key',\n    'kick',\n    'kid',\n    'kidney',\n    'kind',\n    'kingdom',\n    'kiss',\n    'kit',\n    'kitchen',\n    'kite',\n    'kitten',\n    'kiwi',\n    'knee',\n    'knife',\n    'knock',\n    'know',\n    'lab',\n    'label',\n    'labor',\n    'ladder',\n    'lady',\n    'lake',\n    'lamp',\n    'language',\n    'laptop',\n    'large',\n    'later',\n    'latin',\n    'laugh',\n    'laundry',\n    'lava',\n    'law',\n    'lawn',\n    'lawsuit',\n    'layer',\n    'lazy',\n    'leader',\n    'leaf',\n    'learn',\n    'leave',\n    'lecture',\n    'left',\n    'leg',\n    'legal',\n    'legend',\n    'leisure',\n    'lemon',\n    'lend',\n    'length',\n    'lens',\n    'leopard',\n    'lesson',\n    'letter',\n    'level',\n    'liar',\n    'liberty',\n    'library',\n    'license',\n    'life',\n    'lift',\n    'light',\n    'like',\n    'limb',\n    'limit',\n    'link',\n    'lion',\n    'liquid',\n    'list',\n    'little',\n    'live',\n    'lizard',\n    'load',\n    'loan',\n    'lobster',\n    'local',\n    'lock',\n    'logic',\n    'lonely',\n    'long',\n    'loop',\n    'lottery',\n    'loud',\n    'lounge',\n    'love',\n    'loyal',\n    'lucky',\n    'luggage',\n    'lumber',\n    'lunar',\n    'lunch',\n    'luxury',\n    'lyrics',\n    'machine',\n    'mad',\n    'magic',\n    'magnet',\n    'maid',\n    'mail',\n    'main',\n    'major',\n    'make',\n    'mammal',\n    'man',\n    'manage',\n    'mandate',\n    'mango',\n    'mansion',\n    'manual',\n    'maple',\n    'marble',\n    'march',\n    'margin',\n    'marine',\n    'market',\n    'marriage',\n    'mask',\n    'mass',\n    'master',\n    'match',\n    'material',\n    'math',\n    'matrix',\n    'matter',\n    'maximum',\n    'maze',\n    'meadow',\n    'mean',\n    'measure',\n    'meat',\n    'mechanic',\n    'medal',\n    'media',\n    'melody',\n    'melt',\n    'member',\n    'memory',\n    'mention',\n    'menu',\n    'mercy',\n    'merge',\n    'merit',\n    'merry',\n    'mesh',\n    'message',\n    'metal',\n    'method',\n    'middle',\n    'midnight',\n    'milk',\n    'million',\n    'mimic',\n    'mind',\n    'minimum',\n    'minor',\n    'minute',\n    'miracle',\n    'mirror',\n    'misery',\n    'miss',\n    'mistake',\n    'mix',\n    'mixed',\n    'mixture',\n    'mobile',\n    'model',\n    'modify',\n    'mom',\n    'moment',\n    'monitor',\n    'monkey',\n    'monster',\n    'month',\n    'moon',\n    'moral',\n    'more',\n    'morning',\n    'mosquito',\n    'mother',\n    'motion',\n    'motor',\n    'mountain',\n    'mouse',\n    'move',\n    'movie',\n    'much',\n    'muffin',\n    'mule',\n    'multiply',\n    'muscle',\n    'museum',\n    'mushroom',\n    'music',\n    'must',\n    'mutual',\n    'myself',\n    'mystery',\n    'myth',\n    'naive',\n    'name',\n    'napkin',\n    'narrow',\n    'nasty',\n    'nation',\n    'nature',\n    'near',\n    'neck',\n    'need',\n    'negative',\n    'neglect',\n    'neither',\n    'nephew',\n    'nerve',\n    'nest',\n    'net',\n    'network',\n    'neutral',\n    'never',\n    'news',\n    'next',\n    'nice',\n    'night',\n    'noble',\n    'noise',\n    'nominee',\n    'noodle',\n    'normal',\n    'north',\n    'nose',\n    'notable',\n    'note',\n    'nothing',\n    'notice',\n    'novel',\n    'now',\n    'nuclear',\n    'number',\n    'nurse',\n    'nut',\n    'oak',\n    'obey',\n    'object',\n    'oblige',\n    'obscure',\n    'observe',\n    'obtain',\n    'obvious',\n    'occur',\n    'ocean',\n    'october',\n    'odor',\n    'off',\n    'offer',\n    'office',\n    'often',\n    'oil',\n    'okay',\n    'old',\n    'olive',\n    'olympic',\n    'omit',\n    'once',\n    'one',\n    'onion',\n    'online',\n    'only',\n    'open',\n    'opera',\n    'opinion',\n    'oppose',\n    'option',\n    'orange',\n    'orbit',\n    'orchard',\n    'order',\n    'ordinary',\n    'organ',\n    'orient',\n    'original',\n    'orphan',\n    'ostrich',\n    'other',\n    'outdoor',\n    'outer',\n    'output',\n    'outside',\n    'oval',\n    'oven',\n    'over',\n    'own',\n    'owner',\n    'oxygen',\n    'oyster',\n    'ozone',\n    'pact',\n    'paddle',\n    'page',\n    'pair',\n    'palace',\n    'palm',\n    'panda',\n    'panel',\n    'panic',\n    'panther',\n    'paper',\n    'parade',\n    'parent',\n    'park',\n    'parrot',\n    'party',\n    'pass',\n    'patch',\n    'path',\n    'patient',\n    'patrol',\n    'pattern',\n    'pause',\n    'pave',\n    'payment',\n    'peace',\n    'peanut',\n    'pear',\n    'peasant',\n    'pelican',\n    'pen',\n    'penalty',\n    'pencil',\n    'people',\n    'pepper',\n    'perfect',\n    'permit',\n    'person',\n    'pet',\n    'phone',\n    'photo',\n    'phrase',\n    'physical',\n    'piano',\n    'picnic',\n    'picture',\n    'piece',\n    'pig',\n    'pigeon',\n    'pill',\n    'pilot',\n    'pink',\n    'pioneer',\n    'pipe',\n    'pistol',\n    'pitch',\n    'pizza',\n    'place',\n    'planet',\n    'plastic',\n    'plate',\n    'play',\n    'please',\n    'pledge',\n    'pluck',\n    'plug',\n    'plunge',\n    'poem',\n    'poet',\n    'point',\n    'polar',\n    'pole',\n    'police',\n    'pond',\n    'pony',\n    'pool',\n    'popular',\n    'portion',\n    'position',\n    'possible',\n    'post',\n    'potato',\n    'pottery',\n    'poverty',\n    'powder',\n    'power',\n    'practice',\n    'praise',\n    'predict',\n    'prefer',\n    'prepare',\n    'present',\n    'pretty',\n    'prevent',\n    'price',\n    'pride',\n    'primary',\n    'print',\n    'priority',\n    'prison',\n    'private',\n    'prize',\n    'problem',\n    'process',\n    'produce',\n    'profit',\n    'program',\n    'project',\n    'promote',\n    'proof',\n    'property',\n    'prosper',\n    'protect',\n    'proud',\n    'provide',\n    'public',\n    'pudding',\n    'pull',\n    'pulp',\n    'pulse',\n    'pumpkin',\n    'punch',\n    'pupil',\n    'puppy',\n    'purchase',\n    'purity',\n    'purpose',\n    'purse',\n    'push',\n    'put',\n    'puzzle',\n    'pyramid',\n    'quality',\n    'quantum',\n    'quarter',\n    'question',\n    'quick',\n    'quit',\n    'quiz',\n    'quote',\n    'rabbit',\n    'raccoon',\n    'race',\n    'rack',\n    'radar',\n    'radio',\n    'rail',\n    'rain',\n    'raise',\n    'rally',\n    'ramp',\n    'ranch',\n    'random',\n    'range',\n    'rapid',\n    'rare',\n    'rate',\n    'rather',\n    'raven',\n    'raw',\n    'razor',\n    'ready',\n    'real',\n    'reason',\n    'rebel',\n    'rebuild',\n    'recall',\n    'receive',\n    'recipe',\n    'record',\n    'recycle',\n    'reduce',\n    'reflect',\n    'reform',\n    'refuse',\n    'region',\n    'regret',\n    'regular',\n    'reject',\n    'relax',\n    'release',\n    'relief',\n    'rely',\n    'remain',\n    'remember',\n    'remind',\n    'remove',\n    'render',\n    'renew',\n    'rent',\n    'reopen',\n    'repair',\n    'repeat',\n    'replace',\n    'report',\n    'require',\n    'rescue',\n    'resemble',\n    'resist',\n    'resource',\n    'response',\n    'result',\n    'retire',\n    'retreat',\n    'return',\n    'reunion',\n    'reveal',\n    'review',\n    'reward',\n    'rhythm',\n    'rib',\n    'ribbon',\n    'rice',\n    'rich',\n    'ride',\n    'ridge',\n    'rifle',\n    'right',\n    'rigid',\n    'ring',\n    'riot',\n    'ripple',\n    'risk',\n    'ritual',\n    'rival',\n    'river',\n    'road',\n    'roast',\n    'robot',\n    'robust',\n    'rocket',\n    'romance',\n    'roof',\n    'rookie',\n    'room',\n    'rose',\n    'rotate',\n    'rough',\n    'round',\n    'route',\n    'royal',\n    'rubber',\n    'rude',\n    'rug',\n    'rule',\n    'run',\n    'runway',\n    'rural',\n    'sad',\n    'saddle',\n    'sadness',\n    'safe',\n    'sail',\n    'salad',\n    'salmon',\n    'salon',\n    'salt',\n    'salute',\n    'same',\n    'sample',\n    'sand',\n    'satisfy',\n    'satoshi',\n    'sauce',\n    'sausage',\n    'save',\n    'say',\n    'scale',\n    'scan',\n    'scare',\n    'scatter',\n    'scene',\n    'scheme',\n    'school',\n    'science',\n    'scissors',\n    'scorpion',\n    'scout',\n    'scrap',\n    'screen',\n    'script',\n    'scrub',\n    'sea',\n    'search',\n    'season',\n    'seat',\n    'second',\n    'secret',\n    'section',\n    'security',\n    'seed',\n    'seek',\n    'segment',\n    'select',\n    'sell',\n    'seminar',\n    'senior',\n    'sense',\n    'sentence',\n    'series',\n    'service',\n    'session',\n    'settle',\n    'setup',\n    'seven',\n    'shadow',\n    'shaft',\n    'shallow',\n    'share',\n    'shed',\n    'shell',\n    'sheriff',\n    'shield',\n    'shift',\n    'shine',\n    'ship',\n    'shiver',\n    'shock',\n    'shoe',\n    'shoot',\n    'shop',\n    'short',\n    'shoulder',\n    'shove',\n    'shrimp',\n    'shrug',\n    'shuffle',\n    'shy',\n    'sibling',\n    'sick',\n    'side',\n    'siege',\n    'sight',\n    'sign',\n    'silent',\n    'silk',\n    'silly',\n    'silver',\n    'similar',\n    'simple',\n    'since',\n    'sing',\n    'siren',\n    'sister',\n    'situate',\n    'six',\n    'size',\n    'skate',\n    'sketch',\n    'ski',\n    'skill',\n    'skin',\n    'skirt',\n    'skull',\n    'slab',\n    'slam',\n    'sleep',\n    'slender',\n    'slice',\n    'slide',\n    'slight',\n    'slim',\n    'slogan',\n    'slot',\n    'slow',\n    'slush',\n    'small',\n    'smart',\n    'smile',\n    'smoke',\n    'smooth',\n    'snack',\n    'snake',\n    'snap',\n    'sniff',\n    'snow',\n    'soap',\n    'soccer',\n    'social',\n    'sock',\n    'soda',\n    'soft',\n    'solar',\n    'soldier',\n    'solid',\n    'solution',\n    'solve',\n    'someone',\n    'song',\n    'soon',\n    'sorry',\n    'sort',\n    'soul',\n    'sound',\n    'soup',\n    'source',\n    'south',\n    'space',\n    'spare',\n    'spatial',\n    'spawn',\n    'speak',\n    'special',\n    'speed',\n    'spell',\n    'spend',\n    'sphere',\n    'spice',\n    'spider',\n    'spike',\n    'spin',\n    'spirit',\n    'split',\n    'spoil',\n    'sponsor',\n    'spoon',\n    'sport',\n    'spot',\n    'spray',\n    'spread',\n    'spring',\n    'spy',\n    'square',\n    'squeeze',\n    'squirrel',\n    'stable',\n    'stadium',\n    'staff',\n    'stage',\n    'stairs',\n    'stamp',\n    'stand',\n    'start',\n    'state',\n    'stay',\n    'steak',\n    'steel',\n    'stem',\n    'step',\n    'stereo',\n    'stick',\n    'still',\n    'sting',\n    'stock',\n    'stomach',\n    'stone',\n    'stool',\n    'story',\n    'stove',\n    'strategy',\n    'street',\n    'strike',\n    'strong',\n    'struggle',\n    'student',\n    'stuff',\n    'stumble',\n    'style',\n    'subject',\n    'submit',\n    'subway',\n    'success',\n    'such',\n    'sudden',\n    'suffer',\n    'sugar',\n    'suggest',\n    'suit',\n    'summer',\n    'sun',\n    'sunny',\n    'sunset',\n    'super',\n    'supply',\n    'supreme',\n    'sure',\n    'surface',\n    'surge',\n    'surprise',\n    'surround',\n    'survey',\n    'suspect',\n    'sustain',\n    'swallow',\n    'swamp',\n    'swap',\n    'swarm',\n    'swear',\n    'sweet',\n    'swift',\n    'swim',\n    'swing',\n    'switch',\n    'sword',\n    'symbol',\n    'symptom',\n    'syrup',\n    'system',\n    'table',\n    'tackle',\n    'tag',\n    'tail',\n    'talent',\n    'talk',\n    'tank',\n    'tape',\n    'target',\n    'task',\n    'taste',\n    'tattoo',\n    'taxi',\n    'teach',\n    'team',\n    'tell',\n    'ten',\n    'tenant',\n    'tennis',\n    'tent',\n    'term',\n    'test',\n    'text',\n    'thank',\n    'that',\n    'theme',\n    'then',\n    'theory',\n    'there',\n    'they',\n    'thing',\n    'this',\n    'thought',\n    'three',\n    'thrive',\n    'throw',\n    'thumb',\n    'thunder',\n    'ticket',\n    'tide',\n    'tiger',\n    'tilt',\n    'timber',\n    'time',\n    'tiny',\n    'tip',\n    'tired',\n    'tissue',\n    'title',\n    'toast',\n    'tobacco',\n    'today',\n    'toddler',\n    'toe',\n    'together',\n    'toilet',\n    'token',\n    'tomato',\n    'tomorrow',\n    'tone',\n    'tongue',\n    'tonight',\n    'tool',\n    'tooth',\n    'top',\n    'topic',\n    'topple',\n    'torch',\n    'tornado',\n    'tortoise',\n    'toss',\n    'total',\n    'tourist',\n    'toward',\n    'tower',\n    'town',\n    'toy',\n    'track',\n    'trade',\n    'traffic',\n    'tragic',\n    'train',\n    'transfer',\n    'trap',\n    'trash',\n    'travel',\n    'tray',\n    'treat',\n    'tree',\n    'trend',\n    'trial',\n    'tribe',\n    'trick',\n    'trigger',\n    'trim',\n    'trip',\n    'trophy',\n    'trouble',\n    'truck',\n    'true',\n    'truly',\n    'trumpet',\n    'trust',\n    'truth',\n    'try',\n    'tube',\n    'tuition',\n    'tumble',\n    'tuna',\n    'tunnel',\n    'turkey',\n    'turn',\n    'turtle',\n    'twelve',\n    'twenty',\n    'twice',\n    'twin',\n    'twist',\n    'two',\n    'type',\n    'typical',\n    'ugly',\n    'umbrella',\n    'unable',\n    'unaware',\n    'uncle',\n    'uncover',\n    'under',\n    'undo',\n    'unfair',\n    'unfold',\n    'unhappy',\n    'uniform',\n    'unique',\n    'unit',\n    'universe',\n    'unknown',\n    'unlock',\n    'until',\n    'unusual',\n    'unveil',\n    'update',\n    'upgrade',\n    'uphold',\n    'upon',\n    'upper',\n    'upset',\n    'urban',\n    'urge',\n    'usage',\n    'use',\n    'used',\n    'useful',\n    'useless',\n    'usual',\n    'utility',\n    'vacant',\n    'vacuum',\n    'vague',\n    'valid',\n    'valley',\n    'valve',\n    'van',\n    'vanish',\n    'vapor',\n    'various',\n    'vast',\n    'vault',\n    'vehicle',\n    'velvet',\n    'vendor',\n    'venture',\n    'venue',\n    'verb',\n    'verify',\n    'version',\n    'very',\n    'vessel',\n    'veteran',\n    'viable',\n    'vibrant',\n    'vicious',\n    'victory',\n    'video',\n    'view',\n    'village',\n    'vintage',\n    'violin',\n    'virtual',\n    'virus',\n    'visa',\n    'visit',\n    'visual',\n    'vital',\n    'vivid',\n    'vocal',\n    'voice',\n    'void',\n    'volcano',\n    'volume',\n    'vote',\n    'voyage',\n    'wage',\n    'wagon',\n    'wait',\n    'walk',\n    'wall',\n    'walnut',\n    'want',\n    'warfare',\n    'warm',\n    'warrior',\n    'wash',\n    'wasp',\n    'waste',\n    'water',\n    'wave',\n    'way',\n    'wealth',\n    'weapon',\n    'wear',\n    'weasel',\n    'weather',\n    'web',\n    'wedding',\n    'weekend',\n    'weird',\n    'welcome',\n    'west',\n    'wet',\n    'whale',\n    'what',\n    'wheat',\n    'wheel',\n    'when',\n    'where',\n    'whip',\n    'whisper',\n    'wide',\n    'width',\n    'wife',\n    'wild',\n    'will',\n    'win',\n    'window',\n    'wine',\n    'wing',\n    'wink',\n    'winner',\n    'winter',\n    'wire',\n    'wisdom',\n    'wise',\n    'wish',\n    'witness',\n    'wolf',\n    'woman',\n    'wonder',\n    'wood',\n    'wool',\n    'word',\n    'work',\n    'world',\n    'worry',\n    'worth',\n    'wrap',\n    'wreck',\n    'wrestle',\n    'wrist',\n    'write',\n    'wrong',\n    'yard',\n    'year',\n    'yellow',\n    'you',\n    'young',\n    'youth',\n    'zebra',\n    'zero',\n    'zone',\n    'zoo'\n]);\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport { Bip39Words } from './bip39-wordlist.js';\nimport { bin, bytes, dec, utf8 } from './convert.js';\nimport { BIP39_ITERATIONS } from './constants.js';\nimport { Entropy } from './entropy.js';\nconst { subtle } = globalThis.crypto;\n/**\n* Represents a mnemonic phrase that identifies a wallet as defined by BIP-39.\n*/\nexport class Bip39Mnemonic {\n    static #isInternal = false;\n    #bip44Seed = '';\n    #blake2bSeed = '';\n    #phrase = '';\n    get phrase() { return this.#phrase.normalize('NFKD'); }\n    constructor() {\n        if (!Bip39Mnemonic.#isInternal) {\n            throw new Error(`Bip39Mnemonic cannot be instantiated directly. Use 'await Bip39Mnemonic.fromPhrase()' or 'await Bip39Mnemonic.fromEntropy() instead.`);\n        }\n        Bip39Mnemonic.#isInternal = false;\n    }\n    /**\n    * Imports and validates an existing mnemonic phrase.\n    *\n    * The phrase must be valid according to the BIP-39 specification. Typically\n    * wallets use the maximum of 24 words.\n    *\n    * @param {string} phrase - String of 12, 15, 18, 21, or 24 words\n    * @returns {string} Mnemonic phrase validated using the BIP-39 wordlist\n    */\n    static async fromPhrase(phrase) {\n        Bip39Mnemonic.#isInternal = true;\n        const self = new this();\n        const isValid = await Bip39Mnemonic.validate(phrase);\n        if (isValid) {\n            self.#phrase = phrase.normalize('NFKD');\n            return self;\n        }\n        else {\n            throw new Error('Invalid mnemonic phrase.');\n        }\n    }\n    /**\n    * Derives a mnemonic phrase from source of entropy or seed.\n    *\n    * The entropy must be between 32-64 characters to stay within the defined\n    * limit of 128-256 bits. Typically wallets use the maximum entropy allowed.\n    *\n    * @param {string} entropy - Hexadecimal string\n    * @returns {string} Mnemonic phrase created using the BIP-39 wordlist\n    */\n    static async fromEntropy(entropy) {\n        const e = await Entropy.import(entropy);\n        const checksum = await this.checksum(e);\n        let concatenation = `${e.bits}${checksum}`;\n        const words = [];\n        while (concatenation.length > 0) {\n            const wordBits = concatenation.substring(0, 11);\n            const wordIndex = parseInt(wordBits, 2);\n            words.push(Bip39Words[wordIndex]);\n            concatenation = concatenation.substring(11);\n        }\n        const sentence = words.join(' ');\n        return Bip39Mnemonic.fromPhrase(sentence);\n    }\n    /**\n     * SHA-256 hash of entropy that is appended to the entropy and subsequently\n     * used to generate the mnemonic phrase.\n     *\n     * @param {Entropy} entropy - Cryptographically strong pseudorandom data of length N bits\n     * @returns {Promise<string>} First N/32 bits of the hash as a hexadecimal string\n     */\n    static async checksum(entropy) {\n        const hashBuffer = await subtle.digest('SHA-256', entropy.bytes);\n        const hashBytes = new Uint8Array(hashBuffer);\n        const hashBits = bytes.toBin(hashBytes);\n        const checksumLength = entropy.bits.length / 32;\n        const checksum = hashBits.substring(0, checksumLength);\n        return checksum;\n    }\n    /**\n    * Validates a mnemonic phrase.\n    *\n    * @param {string} mnemonic - Mnemonic phrase to validate\n    * @returns {boolean} True if the mnemonic phrase is valid\n    */\n    static async validate(mnemonic) {\n        const words = mnemonic.normalize('NFKD').split(' ');\n        if (words.length % 3 !== 0) {\n            return false;\n        }\n        const wordBits = words.map(word => {\n            const wordIndex = Bip39Words.indexOf(word);\n            if (wordIndex === -1) {\n                return false;\n            }\n            return dec.toBin(wordIndex, 11);\n        }).join('');\n        const checksumLength = wordBits.length / 33;\n        const entropyLength = wordBits.length - checksumLength;\n        const entropyBits = wordBits.substring(0, entropyLength);\n        const checksumBits = wordBits.substring(entropyLength);\n        if (entropyBits == null\n            || entropyBits.length < 128\n            || entropyBits.length > 256\n            || entropyBits.length % 32 !== 0) {\n            return false;\n        }\n        const entropy = await Entropy.import(bin.toBytes(entropyBits));\n        const expectedChecksum = await this.checksum(entropy);\n        if (expectedChecksum !== checksumBits) {\n            return false;\n        }\n        return true;\n    }\n    /**\n    * Converts the mnemonic phrase to a BIP-39 seed.\n    *\n    * A passphrase string can be specified. If the passphrase is undefined, null,\n    * or not a string, the empty string (\"\") is used instead.\n    *\n    * @param {string} [passphrase=''] - Used as the PBKDF2 salt. Default: \"\"\n    * @returns {string} Hexadecimal seed\n    */\n    async toBip39Seed(passphrase) {\n        if (this.#blake2bSeed === '') {\n            if (passphrase == null || typeof passphrase !== 'string') {\n                passphrase = '';\n            }\n            passphrase = `mnemonic${passphrase.normalize('NFKD')}`;\n            const derivationAlgorithm = {\n                name: 'PBKDF2',\n                hash: 'SHA-512',\n                salt: utf8.toBytes(passphrase),\n                iterations: BIP39_ITERATIONS\n            };\n            const phraseKey = await subtle.importKey('raw', utf8.toBytes(this.phrase), 'PBKDF2', false, ['deriveBits', 'deriveKey']);\n            const derivedKeyType = {\n                name: 'HMAC',\n                hash: 'SHA-512',\n                length: 512\n            };\n            const isSeedKeyExtractable = true;\n            const seedKeyUsages = ['sign'];\n            const seedKey = await subtle.deriveKey(derivationAlgorithm, phraseKey, derivedKeyType, isSeedKeyExtractable, seedKeyUsages);\n            const seedBuffer = await subtle.exportKey('raw', seedKey);\n            const seedBytes = new Uint8Array(seedBuffer);\n            const seed = bytes.toHex(seedBytes);\n            this.#bip44Seed = seed;\n        }\n        return this.#bip44Seed;\n    }\n    /**\n    * Converts the mnemonic phrase to a BLAKE2b seed.\n    *\n    * @returns {string} Hexadecimal seed\n    */\n    async toBlake2bSeed() {\n        if (this.#blake2bSeed === '') {\n            const wordArray = this.phrase.split(' ');\n            const bits = wordArray.map((w) => {\n                const wordIndex = Bip39Words.indexOf(w);\n                if (wordIndex === -1) {\n                    return false;\n                }\n                return dec.toBin(wordIndex, 11);\n            }).join('');\n            const dividerIndex = Math.floor(bits.length / 33) * 32;\n            const entropyBits = bits.slice(0, dividerIndex);\n            const entropyBytes = entropyBits.match(/(.{1,8})/g)?.map((bin) => parseInt(bin, 2));\n            if (entropyBytes == null) {\n                throw new Error('Invalid mnemonic phrase');\n            }\n            this.#blake2bSeed = bytes.toHex(Uint8Array.from(entropyBytes));\n        }\n        return this.#blake2bSeed;\n    }\n}\n", "// SPDX-FileCopyrightText: 2024 Chris Duncan <chris@zoso.dev>\n// SPDX-License-Identifier: GPL-3.0-or-later\nimport * as main from './main.js';\nglobalThis.libnemo ??= main;\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,IAWa,SAqSN;AAhTP;AAAA;AAAA;AAWO,IAAM,UAAN,MAAM,SAAQ;AAAA,MACjB,OAAO,YAAY;AAAA,MACnB,OAAO,YAAY;AAAA,MACnB,OAAO,eAAe;AAAA,MACtB,OAAO,eAAe;AAAA,MACtB,OAAO,YAAY;AAAA,MACnB,OAAO,gBAAgB;AAAA;AAAA,MAEvB,OAAO,eAAe,IAAI,YAAY;AAAA,QAClC;AAAA,QAAY;AAAA,QAAY;AAAA,QAAY;AAAA,QACpC;AAAA,QAAY;AAAA,QAAY;AAAA,QAAY;AAAA,QACpC;AAAA,QAAY;AAAA,QAAY;AAAA,QAAY;AAAA,QACpC;AAAA,QAAY;AAAA,QAAY;AAAA,QAAY;AAAA,MACxC,CAAC;AAAA,MACD,OAAO,SAAS;AAAA,QACZ;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAClD;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QACnD;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QACnD;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QACnD;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAClD;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QACnD;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAClD;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAClD;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QACnD;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QACnD;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAClD;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,MACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAO,UAAU,IAAI,WAAW,KAAK,OAAO,IAAI,OAAK,IAAI,CAAC,CAAC;AAAA;AAAA,MAE3D,OAAO,kBAAkB,IAAI,WAAW;AAAA,QACpC;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,QACT;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,MACb,CAAC;AAAA,MACD,OAAO,IAAI,IAAI,YAAY,EAAE;AAAA,MAC7B,OAAO,IAAI,IAAI,YAAY,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAM7B,OAAO,QAAQ,GAAG,GAAG,GAAG;AACpB,YAAI,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AACnB,YAAI,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;AAC3B,YAAI,MAAM,YAAa;AACnB;AAAA,QACJ;AACA,UAAE,CAAC,IAAI;AACP,UAAE,IAAI,CAAC,IAAI;AAAA,MACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAO,QAAQ,GAAG,GAAG,IAAI,IAAI;AACzB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,KAAK,GAAG;AACR,gBAAM;AAAA,QACV;AACA,YAAI,KAAK,EAAE,IAAI,CAAC,IAAI;AACpB,YAAI,MAAM,YAAa;AACnB;AAAA,QACJ;AACA,UAAE,CAAC,IAAI;AACP,UAAE,IAAI,CAAC,IAAI;AAAA,MACf;AAAA;AAAA,MAEA,OAAO,UAAU,KAAK,GAAG;AACrB,eAAQ,IAAI,CAAC,IACR,IAAI,IAAI,CAAC,KAAK,IACd,IAAI,IAAI,CAAC,KAAK,KACd,IAAI,IAAI,CAAC,KAAK;AAAA,MACvB;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,OAAO,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI;AAC7B,YAAI,KAAK,SAAQ,EAAE,EAAE;AACrB,YAAI,KAAK,SAAQ,EAAE,KAAK,CAAC;AACzB,YAAI,KAAK,SAAQ,EAAE,EAAE;AACrB,YAAI,KAAK,SAAQ,EAAE,KAAK,CAAC;AACzB,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,CAAC;AAC/B,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,IAAI,EAAE;AAEpC,YAAI,OAAO,SAAQ,EAAE,CAAC,IAAI,SAAQ,EAAE,CAAC;AACrC,YAAI,OAAO,SAAQ,EAAE,IAAI,CAAC,IAAI,SAAQ,EAAE,IAAI,CAAC;AAC7C,iBAAQ,EAAE,CAAC,IAAI;AACf,iBAAQ,EAAE,IAAI,CAAC,IAAI;AACnB,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,CAAC;AAE/B,eAAO,SAAQ,EAAE,CAAC,IAAI,SAAQ,EAAE,CAAC;AACjC,eAAO,SAAQ,EAAE,IAAI,CAAC,IAAI,SAAQ,EAAE,IAAI,CAAC;AACzC,iBAAQ,EAAE,CAAC,IAAK,SAAS,KAAO,QAAQ;AACxC,iBAAQ,EAAE,IAAI,CAAC,IAAK,SAAS,KAAO,QAAQ;AAC5C,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,CAAC;AAC/B,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,IAAI,EAAE;AAEpC,eAAO,SAAQ,EAAE,CAAC,IAAI,SAAQ,EAAE,CAAC;AACjC,eAAO,SAAQ,EAAE,IAAI,CAAC,IAAI,SAAQ,EAAE,IAAI,CAAC;AACzC,iBAAQ,EAAE,CAAC,IAAK,SAAS,KAAO,QAAQ;AACxC,iBAAQ,EAAE,IAAI,CAAC,IAAK,SAAS,KAAO,QAAQ;AAC5C,iBAAQ,QAAQ,SAAQ,GAAG,GAAG,CAAC;AAE/B,eAAO,SAAQ,EAAE,CAAC,IAAI,SAAQ,EAAE,CAAC;AACjC,eAAO,SAAQ,EAAE,IAAI,CAAC,IAAI,SAAQ,EAAE,IAAI,CAAC;AACzC,iBAAQ,EAAE,CAAC,IAAK,SAAS,KAAO,QAAQ;AACxC,iBAAQ,EAAE,IAAI,CAAC,IAAK,SAAS,KAAO,QAAQ;AAAA,MAChD;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,OAAO,gBAAgB,KAAKA,OAAM;AAC9B,YAAI,IAAI;AAER,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,mBAAQ,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;AACtB,mBAAQ,EAAE,IAAI,EAAE,IAAI,SAAQ,aAAa,CAAC;AAAA,QAC9C;AAEA,iBAAQ,EAAE,EAAE,IAAI,SAAQ,EAAE,EAAE,IAAI,IAAI;AACpC,iBAAQ,EAAE,EAAE,IAAI,SAAQ,EAAE,EAAE,IAAK,IAAI,IAAI;AAGzC,YAAIA,OAAM;AACN,mBAAQ,EAAE,EAAE,IAAI,CAAC,SAAQ,EAAE,EAAE;AAC7B,mBAAQ,EAAE,EAAE,IAAI,CAAC,SAAQ,EAAE,EAAE;AAAA,QACjC;AAEA,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,mBAAQ,EAAE,CAAC,IAAI,SAAQ,UAAU,IAAI,GAAG,IAAI,CAAC;AAAA,QACjD;AAEA,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,mBAAQ,MAAM,GAAG,GAAG,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,CAAC,GAAG,SAAQ,QAAQ,IAAI,KAAK,CAAC,CAAC;AACpF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,CAAC,GAAG,SAAQ,QAAQ,IAAI,KAAK,CAAC,CAAC;AACrF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,CAAC,GAAG,SAAQ,QAAQ,IAAI,KAAK,CAAC,CAAC;AACrF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,CAAC,GAAG,SAAQ,QAAQ,IAAI,KAAK,CAAC,CAAC;AACrF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,CAAC,GAAG,SAAQ,QAAQ,IAAI,KAAK,CAAC,CAAC;AACrF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,EAAE,GAAG,SAAQ,QAAQ,IAAI,KAAK,EAAE,CAAC;AACvF,mBAAQ,MAAM,GAAG,IAAI,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,EAAE,GAAG,SAAQ,QAAQ,IAAI,KAAK,EAAE,CAAC;AACvF,mBAAQ,MAAM,GAAG,GAAG,IAAI,IAAI,SAAQ,QAAQ,IAAI,KAAK,EAAE,GAAG,SAAQ,QAAQ,IAAI,KAAK,EAAE,CAAC;AAAA,QAC1F;AACA,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,cAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,SAAQ,EAAE,CAAC,IAAI,SAAQ,EAAE,IAAI,EAAE;AAAA,QACzD;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,OAAO,cAAc,KAAK,OAAO;AAC7B,iBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,cAAI,IAAI,MAAM,KAAK;AACf,gBAAI,KAAK,IAAI;AACb,qBAAQ,gBAAgB,KAAK,KAAK;AAClC,gBAAI,IAAI;AAAA,UACZ;AACA,cAAI,EAAE,IAAI,GAAG,IAAI,MAAM,CAAC;AAAA,QAC5B;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,OAAO,aAAa,KAAK,KAAK;AAC1B,YAAI,KAAK,IAAI;AACb,eAAO,IAAI,IAAI,KAAK;AAChB,cAAI,EAAE,IAAI,GAAG,IAAI;AAAA,QACrB;AACA,iBAAQ,gBAAgB,KAAK,IAAI;AACjC,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,cAAI,CAAC,IAAI,IAAI,EAAE,KAAK,CAAC,KAAM,KAAK,IAAI;AAAA,QACxC;AACA,eAAO;AAAA,MACX;AAAA,MACA,OAAO,SAAS,KAAK;AACjB,YAAI,MAAM;AACV,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC5B,iBAAO,SAAQ,MAAM,IAAI,CAAC,CAAC;AAC/B,eAAO;AAAA,MACX;AAAA,MACA,OAAO,MAAM,GAAG;AACZ,YAAI,OAAO,MAAM;AACb,gBAAM,IAAI,UAAU,+CAA+C,OAAO,CAAC,EAAE;AACjF,YAAI,IAAI,KAAK,IAAI;AACb,gBAAM,IAAI,WAAW,uCAAuC,CAAC,EAAE;AACnE,eAAO,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAAA,MACzC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,YAAY,QAAQ,KAAK,MAAM,UAAU,UAAU;AAC/C,YAAI,aAAa,MAAM;AACnB,cAAI,SAAS,SAAQ;AACjB,kBAAM,IAAI,WAAW,sBAAsB,SAAQ,SAAS,YAAY,MAAM,EAAE;AACpF,cAAI,SAAS,SAAQ;AACjB,kBAAM,IAAI,WAAW,qBAAqB,SAAQ,SAAS,YAAY,MAAM,EAAE;AACnF,cAAI,OAAO,MAAM;AACb,gBAAI,EAAE,eAAe;AACjB,oBAAM,IAAI,UAAU,kCAAkC;AAC1D,gBAAI,IAAI,SAAS,SAAQ;AACrB,oBAAM,IAAI,WAAW,mBAAmB,SAAQ,YAAY,YAAY,IAAI,MAAM,EAAE;AACxF,gBAAI,IAAI,SAAS,SAAQ;AACrB,oBAAM,IAAI,WAAW,mBAAmB,SAAQ,YAAY,YAAY,IAAI,MAAM,EAAE;AAAA,UAC5F;AACA,cAAI,QAAQ,MAAM;AACd,gBAAI,EAAE,gBAAgB;AAClB,oBAAM,IAAI,UAAU,mCAAmC;AAC3D,gBAAI,KAAK,WAAW,SAAQ;AACxB,oBAAM,IAAI,WAAW,iBAAiB,SAAQ,SAAS,kBAAkB,KAAK,MAAM,QAAQ;AAAA,UACpG;AACA,cAAI,YAAY,MAAM;AAClB,gBAAI,EAAE,oBAAoB;AACtB,oBAAM,IAAI,UAAU,uCAAuC;AAC/D,gBAAI,SAAS,WAAW,SAAQ;AAC5B,oBAAM,IAAI,WAAW,qBAAqB,SAAQ,aAAa,kBAAkB,SAAS,MAAM,QAAQ;AAAA,UAChH;AAAA,QACJ;AACA,aAAK,IAAI,IAAI,WAAW,GAAG;AAC3B,aAAK,IAAI,IAAI,YAAY,EAAE;AAC3B,aAAK,IAAI;AACT,aAAK,IAAI;AACT,aAAK,SAAS;AAEd,iBAAQ,gBAAgB,KAAK,CAAC;AAE9B,iBAAQ,gBAAgB,CAAC,IAAI;AAC7B,YAAI;AACA,mBAAQ,gBAAgB,CAAC,IAAI,IAAI;AACrC,iBAAQ,gBAAgB,CAAC,IAAI;AAC7B,iBAAQ,gBAAgB,CAAC,IAAI;AAC7B,YAAI;AACA,mBAAQ,gBAAgB,IAAI,MAAM,EAAE;AACxC,YAAI;AACA,mBAAQ,gBAAgB,IAAI,UAAU,EAAE;AAE5C,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,eAAK,EAAE,CAAC,IAAI,SAAQ,aAAa,CAAC,IAAI,SAAQ,UAAU,SAAQ,iBAAiB,IAAI,CAAC;AAAA,QAC1F;AAEA,YAAI,KAAK;AACL,mBAAQ,cAAc,MAAM,GAAG;AAE/B,eAAK,IAAI;AAAA,QACb;AAAA,MACJ;AAAA,MACA,OAAO,OAAO;AACV,YAAI,EAAE,iBAAiB;AACnB,gBAAM,IAAI,UAAU,oCAAoC;AAC5D,iBAAQ,cAAc,MAAM,KAAK;AACjC,eAAO;AAAA,MACX;AAAA,MACA,OAAO,KAAK;AACR,cAAM,MAAO,CAAC,OAAO,QAAQ,YAAY,QAAQ,QAAS,IAAI,WAAW,KAAK,MAAM,IAAI;AACxF,YAAI,EAAE,eAAe;AACjB,gBAAM,IAAI,UAAU,oDAAoD;AAC5E,YAAI,IAAI,SAAS,KAAK;AAClB,gBAAM,IAAI,WAAW,8CAA8C;AACvE,iBAAQ,aAAa,MAAM,GAAG;AAC9B,YAAI,QAAQ;AACR,iBAAO,SAAQ,SAAS,GAAG;AAC/B,eAAO;AAAA,MACX;AAAA,IACJ;AACA,IAAO,kBAAQ,QAAQ,SAAS;AAAA;AAAA;;;AChThC,IAEa,oBACA,aACA,UACA,kBACA,eACA,iBACA,cACA,iBAEA,UACA,QACA,eACA,mBACA,qBAEA,mBACA,gBAEA,qBAaA;AAjCb;AAAA;AAAA;AAEO,IAAM,qBAAqB;AAC3B,IAAM,cAAc;AACpB,IAAM,WAAW;AACjB,IAAM,mBAAmB;AACzB,IAAM,gBAAgB;AACtB,IAAM,kBAAkB;AACxB,IAAM,eAAe;AACrB,IAAM,kBAAkB;AAExB,IAAM,WAAW;AACjB,IAAM,SAAS;AACf,IAAM,gBAAgB;AACtB,IAAM,oBAAoB;AAC1B,IAAM,sBAAsB;AAE5B,IAAM,oBAAoB;AAC1B,IAAM,iBAAiB;AAEvB,IAAM,sBAAsB,OAAO,OAAO;AAAA,MAC7C,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,MACR,OAAQ;AAAA,IACZ,CAAC;AACM,IAAM,QAAQ,OAAO,OAAO;AAAA,MAC/B,KAAK;AAAA,MACL,KAAK;AAAA,MACL,OAAO;AAAA,MACP,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,OAAO;AAAA,MACP,OAAO;AAAA,IACX,CAAC;AAAA;AAAA;;;AC3CD,IAGa,QA0CA,KA0BA,QAgDA,OA8EA,KAiEA,KAkCA;AAxSb;AAAA;AAAA;AAEA;AACO,IAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOlB,QAAQC,SAAQ;AACZ,cAAM,WAAYA,QAAO,SAAS,IAAK;AACvC,cAAM,SAAS,aAAa,IACtB,IACA,IAAI;AACV,YAAI,OAAO;AACX,YAAI,QAAQ;AACZ,YAAI,QAAQ;AACZ,YAAI,SAAS,IAAI,WAAW,KAAK,KAAMA,QAAO,SAAS,IAAK,CAAC,CAAC;AAC9D,iBAAS,IAAI,GAAG,IAAIA,QAAO,QAAQ,KAAK;AACpC,kBAAS,SAAS,IAAK,SAAS,QAAQA,QAAO,CAAC,CAAC;AACjD,kBAAQ;AACR,cAAI,QAAQ,GAAG;AACX,mBAAO,OAAO,IAAK,UAAW,OAAO,SAAS,IAAM;AACpD,oBAAQ;AAAA,UACZ;AAAA,QACJ;AACA,YAAI,OAAO,GAAG;AACV,iBAAO,OAAO,IAAK,SAAU,OAAO,SAAS,IAAM;AAAA,QACvD;AACA,YAAI,aAAa,GAAG;AAChB,mBAAS,OAAO,MAAM,CAAC;AAAA,QAC3B;AACA,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,SAAQ;AACV,eAAO,MAAM,MAAM,KAAK,QAAQA,OAAM,CAAC;AAAA,MAC3C;AAAA,IACJ;AACO,IAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOf,QAAQC,MAAK;AACT,cAAMC,SAAQ,CAAC;AACf,eAAOD,KAAI,SAAS,GAAG;AACnB,gBAAM,OAAOA,KAAI,UAAU,GAAG,CAAC;AAC/B,UAAAC,OAAM,KAAK,SAAS,MAAM,CAAC,CAAC;AAC5B,UAAAD,OAAMA,KAAI,UAAU,CAAC;AAAA,QACzB;AACA,eAAO,IAAI,WAAWC,MAAK;AAAA,MAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMD,MAAK;AACP,eAAO,SAASA,MAAK,CAAC,EAAE,SAAS,EAAE;AAAA,MACvC;AAAA,IACJ;AACO,IAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOlB,SAASE,SAAQ;AACb,eAAO,MAAM,SAAS,IAAI,WAAWA,OAAM,CAAC;AAAA,MAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,SAAQ;AACV,eAAO,MAAM,MAAM,IAAI,WAAWA,OAAM,CAAC;AAAA,MAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAMA,SAAQ;AACV,eAAO,MAAM,MAAM,IAAI,WAAWA,OAAM,CAAC;AAAA,MAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,SAAQ;AACV,eAAO,MAAM,MAAM,IAAI,WAAWA,OAAM,CAAC;AAAA,MAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAOA,SAAQ;AACX,eAAO,MAAM,OAAO,IAAI,WAAWA,OAAM,CAAC;AAAA,MAC9C;AAAA,IACJ;AACO,IAAM,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOjB,SAASD,QAAO;AACZ,cAAM,WAAYA,OAAM,SAAS,IAAK;AACtC,cAAM,SAAS,aAAa,IACtB,IACA,IAAI;AACV,YAAI,QAAQ;AACZ,YAAI,SAAS;AACb,YAAI,OAAO;AACX,iBAAS,IAAI,GAAG,IAAIA,OAAM,QAAQ,KAAK;AACnC,kBAAS,SAAS,IAAKA,OAAM,CAAC;AAC9B,kBAAQ;AACR,iBAAO,QAAQ,GAAG;AACd,sBAAU,SAAU,UAAW,OAAO,SAAS,IAAM,EAAE;AACvD,oBAAQ;AAAA,UACZ;AAAA,QACJ;AACA,YAAI,OAAO,GAAG;AACV,oBAAU,SAAU,SAAU,KAAK,OAAO,UAAY,EAAE;AAAA,QAC5D;AACA,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,QAAO;AACT,eAAO,CAAC,GAAGA,MAAK,EAAE,IAAI,OAAK,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE,KAAK,EAAE;AAAA,MACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAMA,QAAO;AACT,cAAM,WAAW,CAAC;AAClB,QAAAA,OAAM,QAAQ,EAAE,QAAQ,OAAK,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC;AACrD,YAAI,UAAU;AACd,iBAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACtC,qBAAW,SAAS,CAAC,KAAK,OAAO,IAAI,CAAC;AAAA,QAC1C;AACA,YAAI,UAAU,mBAAmB;AAC7B,iBAAO;AAAA,QACX,OACK;AACD,iBAAO,OAAO,OAAO;AAAA,QACzB;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,QAAO;AACT,cAAM,YAAY,CAAC,GAAGA,MAAK,EAAE,IAAI,UAAQ,KAAK,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAC3E,eAAO,UAAU,KAAK,EAAE,EAAE,YAAY;AAAA,MAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAOA,QAAO;AACV,eAAO,IAAI,YAAY,EAAE,OAAOA,MAAK;AAAA,MACzC;AAAA,IACJ;AACO,IAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQf,MAAM,SAAS,UAAU,GAAG;AACxB,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,iBAAiB;AAAA,QACzC;AACA,YAAI;AACA,iBAAO,OAAO,OAAO,EAChB,SAAS,CAAC,EACV,SAAS,SAAS,GAAG;AAAA,QAC9B,SACO,KAAK;AACR,gBAAM,IAAI,WAAW,yBAAyB;AAAA,QAClD;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,SAAS,UAAU,GAAG;AAC1B,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,iBAAiB;AAAA,QACzC;AACA,YAAI,UAAU,OAAO,OAAO;AAC5B,cAAMA,SAAQ,CAAC;AACf,eAAO,UAAU,GAAG;AAChB,gBAAM,MAAM,OAAO,QAAQ,GAAG,OAAO;AACrC,UAAAA,OAAM,KAAK,OAAO,GAAG,CAAC;AACtB,sBAAY;AAAA,QAChB;AACA,cAAM,SAAS,IAAI,WAAW,KAAK,IAAI,SAASA,OAAM,MAAM,CAAC;AAC7D,eAAO,IAAIA,MAAK;AAChB,eAAQ,OAAO,QAAQ;AAAA,MAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,SAAS,UAAU,GAAG;AACxB,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,iBAAiB;AAAA,QACzC;AACA,YAAI;AACA,iBAAO,OAAO,OAAO,EAChB,SAAS,EAAE,EACX,SAAS,SAAS,GAAG,EACrB,YAAY;AAAA,QACrB,SACO,KAAK;AACR,gBAAM,IAAI,WAAW,yBAAyB;AAAA,QAClD;AAAA,MACJ;AAAA,IACJ;AACO,IAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOf,MAAME,MAAK;AACP,eAAO,CAAC,GAAGA,IAAG,EAAE,IAAI,OAAK,IAAI,MAAM,SAAS,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE;AAAA,MACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQA,MAAK,UAAU,GAAG;AACtB,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,8CAA8C;AAAA,QACtE;AACA,cAAM,WAAWA,KAAI,MAAM,SAAS;AACpC,YAAI,CAAC,eAAe,KAAKA,IAAG,KAAK,YAAY,MAAM;AAC/C,kBAAQ,KAAK,6CAA6C;AAC1D,iBAAO,IAAI,WAAW;AAAA,QAC1B,OACK;AACD,gBAAMF,SAAQ,WAAW,KAAK,SAAS,IAAI,UAAQ,SAAS,MAAM,EAAE,CAAC,CAAC;AACtE,gBAAM,SAAS,IAAI,WAAW,KAAK,IAAI,SAASA,OAAM,MAAM,CAAC;AAC7D,iBAAO,IAAIA,OAAM,QAAQ,CAAC;AAC1B,iBAAO,OAAO,QAAQ;AAAA,QAC1B;AAAA,MACJ;AAAA,IACJ;AACO,IAAM,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOhB,QAAQG,OAAM;AACV,eAAO,IAAI,YAAY,EAAE,OAAOA,KAAI;AAAA,MACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAMA,OAAM;AACR,eAAO,MAAM,MAAM,KAAK,QAAQA,KAAI,CAAC;AAAA,MACzC;AAAA,IACJ;AAAA;AAAA;;;AC3TA,IASa;AATb;AAAA;AAAA;AASO,IAAM,MAAN,MAAU;AAAA,MACb;AAAA,MACA;AAAA,MACA,YAAY,KAAK,YAAY;AACzB,aAAK,KAAK,IAAI,IAAI,GAAG;AACrB,aAAK,GAAG,WAAW;AACnB,aAAK,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAM,KAAK,QAAQ,MAAM;AACrB,YAAIC,WAAUA,YAAW;AACzB,aAAK,UAAU,MAAM;AACrB,cAAM,UAAU,CAAC;AACjB,gBAAQ,cAAc,IAAI;AAC1B,YAAI,KAAK,MAAMA,UAAS,KAAK,qBAAqB;AAC9C,kBAAQ,KAAK,EAAE,IAAIA,SAAQ,IAAI;AAAA,QACnC;AACA,iBAAS,CAAC;AACV,aAAK,SAAS,OAAO,YAAY;AACjC,cAAM,OAAO,KAAK,UAAU,IAAI,EAC3B,WAAW,KAAK,SAAS,EACzB,WAAW,KAAK,SAAS,EACzB,WAAW,KAAK,SAAS,EACzB,WAAW,MAAM,SAAS;AAC/B,cAAM,MAAM,IAAI,QAAQ,KAAK,IAAI;AAAA,UAC7B,QAAQ;AAAA,UACR;AAAA,UACA;AAAA,QACJ,CAAC;AACD,YAAI;AACA,gBAAM,MAAM,MAAM,MAAM,GAAG;AAC3B,iBAAO,MAAM,IAAI,KAAK;AAAA,QAC1B,SACO,KAAK;AACR,kBAAQ,MAAM,GAAG;AACjB,iBAAO,KAAK,UAAU,GAAG;AAAA,QAC7B;AAAA,MACJ;AAAA,MACA,UAAU,QAAQ;AACd,YAAI,CAAC,QAAQ;AACT,gBAAM,IAAI,eAAe,6BAA6B;AAAA,QAC1D;AACA,YAAI,OAAO,WAAW,UAAU;AAC5B,gBAAM,IAAI,UAAU,6BAA6B;AAAA,QACrD;AACA,YAAI,CAAC,2BAA2B,KAAK,MAAM,GAAG;AAC1C,gBAAM,IAAI,UAAU,wCAAwC;AAAA,QAChE;AAAA,MACJ;AAAA,IACJ;AAAA;AAAA;;;AC/DA,IAGQC,SACF,KACA,KACA,KAUO;AAhBb;AAAA;AAAA;AAEA;AACA,KAAM,EAAE,QAAAA,YAAW;AACnB,IAAM,MAAM;AACZ,IAAM,MAAM;AACZ,IAAM,MAAM;AAUL,IAAM,UAAN,MAAM,SAAQ;AAAA,MACjB,OAAO,cAAc;AAAA,MACrB;AAAA,MACA,IAAI,OAAO;AAAE,eAAO,MAAM,MAAM,KAAK,MAAM;AAAA,MAAG;AAAA,MAC9C,IAAI,SAAS;AAAE,eAAO,KAAK,OAAO;AAAA,MAAQ;AAAA,MAC1C,IAAI,QAAQ;AAAE,eAAO,KAAK;AAAA,MAAQ;AAAA,MAClC,IAAI,MAAM;AAAE,eAAO,MAAM,MAAM,KAAK,MAAM;AAAA,MAAG;AAAA,MAC7C,YAAYC,QAAO;AACf,YAAI,CAAC,SAAQ,aAAa;AACtB,gBAAM,IAAI,MAAM,gFAAgF;AAAA,QACpG;AACA,iBAAQ,cAAc;AACtB,aAAK,SAASA;AAAA,MAClB;AAAA,MACA,aAAa,OAAO,MAAM;AACtB,eAAO,IAAI,QAAQ,aAAW;AAC1B,cAAI,QAAQ,MAAM;AACd,gBAAI,OAAO,SAAS,UAAU;AAC1B,oBAAM,IAAI,UAAU,sBAAsB,OAAO,IAAI,YAAY;AAAA,YACrE;AACA,gBAAI,OAAO,OAAO,OAAO,KAAK;AAC1B,oBAAM,IAAI,WAAW,mBAAmB,GAAG,IAAI,GAAG,QAAQ;AAAA,YAC9D;AACA,gBAAI,OAAO,QAAQ,GAAG;AAClB,oBAAM,IAAI,WAAW,iCAAiC,GAAG,QAAQ;AAAA,YACrE;AAAA,UACJ;AACA,mBAAQ,cAAc;AACtB,kBAAQ,IAAI,KAAKD,QAAO,gBAAgB,IAAI,WAAW,QAAQ,GAAG,CAAC,CAAC,CAAC;AAAA,QACzE,CAAC;AAAA,MACL;AAAA,MACA,aAAa,OAAO,OAAO;AACvB,eAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,cAAI,OAAO,UAAU,UAAU;AAC3B,gBAAI,MAAM,SAAS,MAAM,KAAK,MAAM,SAAS,MAAM,GAAG;AAClD,oBAAM,IAAI,WAAW,mBAAmB,MAAM,CAAC,IAAI,MAAM,CAAC,aAAa;AAAA,YAC3E;AACA,gBAAI,MAAM,SAAS,MAAM,MAAM,GAAG;AAC9B,oBAAM,IAAI,WAAW,iCAAiC,MAAM,CAAC,aAAa;AAAA,YAC9E;AACA,gBAAI,CAAC,kBAAkB,KAAK,KAAK,GAAG;AAChC,oBAAM,IAAI,WAAW,iDAAiD;AAAA,YAC1E;AACA,qBAAQ,cAAc;AACtB,oBAAQ,IAAI,KAAK,IAAI,QAAQ,KAAK,CAAC,CAAC;AAAA,UACxC;AACA,cAAI,iBAAiB,aAAa;AAC9B,gBAAI,MAAM,aAAa,OAAO,MAAM,aAAa,KAAK;AAClD,oBAAM,IAAI,MAAM,mBAAmB,GAAG,IAAI,GAAG,QAAQ;AAAA,YACzD;AACA,gBAAI,MAAM,aAAa,QAAQ,GAAG;AAC9B,oBAAM,IAAI,WAAW,iCAAiC,GAAG,QAAQ;AAAA,YACrE;AACA,qBAAQ,cAAc;AACtB,oBAAQ,IAAI,KAAK,IAAI,WAAW,KAAK,CAAC,CAAC;AAAA,UAC3C;AACA,cAAI,iBAAiB,YAAY;AAC7B,gBAAI,MAAM,SAAS,OAAO,MAAM,SAAS,KAAK;AAC1C,oBAAM,IAAI,MAAM,mBAAmB,GAAG,IAAI,GAAG,QAAQ;AAAA,YACzD;AACA,gBAAI,MAAM,SAAS,QAAQ,GAAG;AAC1B,oBAAM,IAAI,WAAW,iCAAiC,GAAG,QAAQ;AAAA,YACrE;AACA,qBAAQ,cAAc;AACtB,oBAAQ,IAAI,KAAK,KAAK,CAAC;AAAA,UAC3B;AACA,iBAAO,IAAI,UAAU,yBAAyB,OAAO,KAAK,EAAE,CAAC;AAAA,QACjE,CAAC;AAAA,MACL;AAAA;AAAA;AAAA;AAAA,MAIA,UAAU;AACN,YAAI;AACA,UAAAA,QAAO,gBAAgB,KAAK,MAAM;AAClC,iBAAO;AAAA,QACX,SACO,KAAK;AACR,iBAAO;AAAA,QACX;AAAA,MACJ;AAAA,IACJ;AAAA;AAAA;;;ACjGA,IAIQ,QACF,SACO;AANb;AAAA;AAAA;AAEA;AACA;AACA,KAAM,EAAE,WAAW,WAAW;AAC9B,IAAM,UAAU;AACT,IAAM,OAAN,MAAW;AAAA,MACd;AAAA,MACA,cAAc;AACV,aAAK,WAAW,WAAW;AAAA,MAC/B;AAAA,MACA,MAAM,IAAI,MAAM,SAAS,MAAM;AAC3B,YAAI,KAAK,SAAS,QAAQ,IAAI,GAAG;AAC7B,gBAAM,IAAI,MAAM,OAAO;AAAA,QAC3B;AACA,eAAO,KAAK,UAAU,MAAM,SAAS,IAAI;AAAA,MAC7C;AAAA,MACA,MAAM,UAAU,MAAM,SAAS,MAAM;AACjC,YAAI,KAAK,YAAY,MAAM,SAAS,IAAI,GAAG;AACvC,gBAAM,IAAI,MAAM,OAAO;AAAA,QAC3B;AACA,cAAM,KAAK,MAAM,QAAQ,OAAO;AAChC,YAAI,OAAO,YAAY,UAAU;AAC7B,cAAI;AACA,sBAAU,MAAM,OAAO,UAAU,OAAO,KAAK,QAAQ,OAAO,GAAG,UAAU,OAAO,CAAC,cAAc,WAAW,CAAC;AAC3G,sBAAU,MAAM,OAAO,UAAU,EAAE,MAAM,UAAU,MAAM,WAAW,MAAM,GAAG,OAAO,YAAY,KAAO,GAAG,SAAS,EAAE,MAAM,WAAW,QAAQ,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC;AAAA,UAC3K,SACO,KAAK;AACR,kBAAM,IAAI,MAAM,OAAO;AAAA,UAC3B;AAAA,QACJ;AACA,YAAI;AACA,cAAI,OAAO,SAAS,UAAU;AAC1B,mBAAO,KAAK,SAAS;AAAA,UACzB;AACA,iBAAO,KAAK,UAAU,IAAI;AAC1B,gBAAM,UAAU,KAAK,QAAQ,IAAI;AACjC,gBAAM,YAAY,MAAM,OAAO,QAAQ,EAAE,MAAM,WAAW,IAAI,GAAG,OAAO,GAAG,SAAS,OAAO;AAC3F,gBAAM,SAAS;AAAA,YACX,WAAW,OAAO,MAAM,SAAS;AAAA,YACjC,IAAI,GAAG;AAAA,UACX;AACA,gBAAM,IAAI,QAAQ,CAAC,SAAS,WAAW;AACnC,gBAAI;AACA,mBAAK,SAAS,QAAQ,MAAM,KAAK,UAAU,MAAM,CAAC;AAClD,sBAAQ;AAAA,YACZ,SACO,KAAK;AACR,qBAAO,GAAG;AAAA,YACd;AAAA,UACJ,CAAC;AACD,oBAAU;AAAA,QACd,SACO,KAAK;AACR,gBAAM,IAAI,MAAM,OAAO;AAAA,QAC3B;AACA,eAAQ,KAAK,SAAS,QAAQ,IAAI,KAAK;AAAA,MAC3C;AAAA,MACA,MAAM,IAAI,MAAM,SAAS;AACrB,YAAI,KAAK,YAAY,MAAM,OAAO,GAAG;AACjC,iBAAO;AAAA,QACX;AACA,cAAM,OAAO,MAAM,IAAI,QAAQ,aAAW;AACtC,kBAAQ,KAAK,SAAS,QAAQ,IAAI,CAAC;AAAA,QACvC,CAAC;AACD,YAAI,QAAQ,MAAM;AACd,iBAAO;AAAA,QACX;AACA,cAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,cAAM,YAAY,IAAI,QAAQ,OAAO,SAAS;AAC9C,cAAM,KAAK,MAAM,QAAQ,OAAO,OAAO,EAAE;AACzC,YAAI;AACA,cAAI,OAAO,YAAY,UAAU;AAC7B,sBAAU,MAAM,OAAO,UAAU,OAAO,KAAK,QAAQ,OAAO,GAAG,UAAU,OAAO,CAAC,cAAc,WAAW,CAAC;AAC3G,sBAAU,MAAM,OAAO,UAAU,EAAE,MAAM,UAAU,MAAM,WAAW,MAAM,GAAG,OAAO,YAAY,KAAO,GAAG,SAAS,EAAE,MAAM,WAAW,QAAQ,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC;AAAA,UAC3K;AAAA,QACJ,SACO,KAAK;AACR,iBAAO;AAAA,QACX;AACA,YAAI;AACA,gBAAM,YAAY,MAAM,OAAO,QAAQ,EAAE,MAAM,WAAW,IAAI,GAAG,OAAO,GAAG,SAAS,SAAS;AAC7F,gBAAM,UAAU,OAAO,OAAO,SAAS;AACvC,gBAAM,OAAO,KAAK,MAAM,OAAO;AAC/B,oBAAU;AACV,eAAK,SAAS,WAAW,IAAI;AAC7B,iBAAO;AAAA,QACX,SACO,KAAK;AACR,iBAAO;AAAA,QACX;AAAA,MACJ;AAAA,MACA,YAAY,MAAM,SAAS,MAAM;AAC7B,YAAI,OAAO,SAAS,YAAY,SAAS,IAAI;AACzC,iBAAO;AAAA,QACX;AACA,YAAI,OAAO,YAAY,YAAY,YAAY,IAAI;AAC/C,cAAI,EAAE,mBAAmB,YAAY;AACjC,mBAAO;AAAA,UACX;AAAA,QACJ;AACA,YAAI,OAAO,SAAS,UAAU;AAC1B,cAAI;AACA,iBAAK,UAAU,IAAI;AAAA,UACvB,SACO,KAAK;AACR,mBAAO;AAAA,UACX;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AAAA,IACJ;AAAA;AAAA;;;AC/GA,IAKa,MA4HA;AAjIb;AAAA;AAAA;AAKO,IAAM,OAAN,MAAM,MAAK;AAAA,MACd,OAAO,SAAS,KAAK,IAAI,GAAG,UAAU,sBAAsB,CAAC;AAAA,MAC7D,SAAS,CAAC;AAAA,MACV,WAAW,CAAC;AAAA,MACZ;AAAA,MACA,IAAI,cAAc;AACd,YAAI,IAAI;AACR,mBAAW,UAAU,KAAK,UAAU;AAChC,eAAK,EAAE,OAAO,OAAO;AAAA,QACzB;AACA,eAAO;AAAA,MACX;AAAA,MACA,IAAI,cAAc;AACd,YAAI,IAAI;AACR,mBAAW,UAAU,KAAK,UAAU;AAChC,eAAK,EAAE,OAAO,OAAO;AAAA,QACzB;AACA,eAAO;AAAA,MACX;AAAA,MACA,MAAM,OAAO,MAAM;AACf,YAAI,EAAE,gBAAgB,eAAe,MAAM,QAAQ,IAAI;AACnD,iBAAO,CAAC,IAAI;AAChB,eAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,gBAAM,MAAM;AAAA,YACR,IAAI,YAAY,IAAI;AAAA,YACpB,SAAS,CAAC;AAAA,YACV;AAAA,YACA;AAAA,YACA;AAAA,UACJ;AACA,cAAI,KAAK,OAAO,SAAS,GAAG;AACxB,iBAAK,OAAO,KAAK,GAAG;AAAA,UACxB,OACK;AACD,uBAAW,UAAU,KAAK;AACtB,mBAAK,QAAQ,QAAQ,GAAG;AAAA,UAChC;AAAA,QACJ,CAAC;AAAA,MACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,YAAY,QAAQ,QAAQ,GAAG;AAC3B,gBAAQ,KAAK,IAAI,MAAK,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC;AACtE,aAAK,OAAO,IAAI,gBAAgB,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE,MAAM,kBAAkB,CAAC,CAAC;AAC/E,iBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,gBAAM,SAAS;AAAA,YACX,QAAQ,IAAI,OAAO,KAAK,MAAM,EAAE,MAAM,SAAS,CAAC;AAAA,YAChD,KAAK;AAAA,UACT;AACA,iBAAO,OAAO,iBAAiB,WAAW,aAAW;AACjD,gBAAI,SAAS,KAAK,MAAM,IAAI,YAAY,EAAE,OAAO,QAAQ,IAAI,KAAK,IAAI;AACtE,gBAAI,CAAC,MAAM,QAAQ,MAAM;AACrB,uBAAS,CAAC,MAAM;AACpB,iBAAK,QAAQ,QAAQ,MAAM;AAAA,UAC/B,CAAC;AACD,eAAK,SAAS,KAAK,MAAM;AACzB,gBAAK,SAAS,KAAK,IAAI,GAAG,MAAK,SAAS,KAAK,SAAS,MAAM;AAAA,QAChE;AAAA,MACJ;AAAA,MACA,QAAQ,QAAQ,KAAK;AACjB,YAAI,IAAI,gBAAgB,aAAa;AACjC,cAAI,IAAI,KAAK,aAAa,GAAG;AACzB,mBAAO,MAAM;AACb,mBAAO,OAAO,YAAY,EAAE,QAAQ,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC;AAAA,UAC9D;AAAA,QACJ,OACK;AACD,gBAAM,QAAQ,IAAK,IAAI,KAAK,SAAS,KAAK;AAC1C,gBAAM,OAAO,IAAI,KAAK,MAAM,GAAG,KAAK;AACpC,cAAI,OAAO,IAAI,KAAK,MAAM,KAAK;AAC/B,cAAI,IAAI,KAAK,WAAW;AACpB,iBAAK,OAAO,MAAM;AACtB,cAAI,MAAM,SAAS,GAAG;AAClB,kBAAME,UAAS,IAAI,YAAY,EAAE,OAAO,KAAK,UAAU,IAAI,CAAC,EAAE;AAC9D,mBAAO,MAAM;AACb,mBAAO,OAAO,YAAY,EAAE,QAAAA,QAAO,GAAG,CAACA,OAAM,CAAC;AAAA,UAClD;AAAA,QACJ;AAAA,MACJ;AAAA,MACA,WAAW,OAAO;AACd,mBAAW,UAAU,KAAK,UAAU;AAChC,cAAI,OAAO,KAAK,OAAO;AACnB,mBAAO;AAAA,QACf;AACA,eAAO;AAAA,MACX;AAAA,MACA,QAAQ,QAAQ,SAAS;AACrB,YAAI,OAAO,OAAO,MAAM;AACpB,gBAAM,IAAI,MAAM,uDAAuD;AAAA,QAC3E;AACA,cAAM,MAAM,OAAO;AACnB,YAAI,KAAK,OAAO,SAAS,GAAG;AACxB,eAAK,QAAQ,QAAQ,KAAK,OAAO,CAAC,CAAC;AAAA,QACvC,OACK;AACD,iBAAO,MAAM;AAAA,QACjB;AACA,YAAI,QAAQ,SAAS,GAAG;AACpB,cAAI,QAAQ,KAAK,GAAG,OAAO;AAAA,QAC/B;AACA,YAAI,KAAK,WAAW,IAAI,EAAE,GAAG;AACzB,cAAI,QAAQ,IAAI,OAAO;AAAA,QAC3B;AAAA,MACJ;AAAA,IACJ;AAiBO,IAAM,kBAAN,MAAsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWzB,aAAa,KAAK,MAAM;AACpB,eAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC1C,mBAAS,KAAK,MAAM;AAChB,gBAAI;AACA,kBAAI,MAAM;AAAA,YACd,SACO,KAAK;AACR,qBAAO,GAAG;AAAA,YACd;AAAA,UACJ;AACA,kBAAQ,IAAI;AAAA,QAChB,CAAC;AAAA,MACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,OAAO,SAAS;AACnB,cAAMA,UAAS,IAAI,YAAY,EAAE,OAAO,KAAK,UAAU,OAAO,CAAC,EAAE;AAEjE,oBAAYA,SAAQ,CAACA,OAAM,CAAC;AAAA,MAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,OAAO,SAAS;AACZ,yBAAiB,WAAW,CAAC,YAAY;AACrC,gBAAM,EAAE,MAAM,QAAAA,QAAO,IAAI,QAAQ;AACjC,cAAI,SAAS,QAAQ;AACjB,kBAAM;AACN,kBAAMA,UAAS,IAAI,YAAY,CAAC;AAEhC,wBAAYA,SAAQ,CAACA,OAAM,CAAC;AAAA,UAChC,OACK;AACD,kBAAM,OAAO,KAAK,MAAM,IAAI,YAAY,EAAE,OAAOA,OAAM,CAAC;AACxD,iBAAK,KAAK,IAAI,EAAE,KAAK,KAAK,MAAM;AAAA,UACpC;AAAA,QACJ,CAAC;AAAA,MACL;AAAA,IACJ;AAAA;AAAA;;;AC7LA,IAgBa,UAo1BN;AAp2BP;AAAA;AAAA;AAGA;AACA;AAYO,IAAM,WAAN,MAAM,kBAAiB,gBAAgB;AAAA,MAC1C,OAAO;AACH,kBAAS,OAAO;AAAA,MACpB;AAAA,MACA,aAAa,KAAK,MAAM;AACpB,eAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC1C,mBAAS,KAAK,MAAM;AAChB,gBAAI;AACA,gBAAE,YAAY,MAAM,KAAK,QAAQ,EAAE,UAAU;AAAA,YACjD,SACO,KAAK;AACR,qBAAO,GAAG;AAAA,YACd;AAAA,UACJ;AACA,kBAAQ,IAAI;AAAA,QAChB,CAAC;AAAA,MACL;AAAA,MACA,OAAO,KAAK,SAAU,MAAM;AACxB,cAAM,IAAI,IAAI,aAAa,EAAE;AAC7B,YAAI;AACA,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ;AAC7B,cAAE,CAAC,IAAI,KAAK,CAAC;AACrB,eAAO;AAAA,MACX;AAAA,MACA,OAAO,MAAM,KAAK,GAAG;AAAA,MACrB,OAAO,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC;AAAA,MACxB,OAAO,IAAI,KAAK,GAAG,CAAC,OAAQ,MAAQ,OAAQ,OAAQ,OAAQ,OAAQ,MAAQ,KAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,KAAM,CAAC;AAAA,MACnJ,OAAO,KAAK,KAAK,GAAG,CAAC,OAAQ,MAAQ,OAAQ,OAAQ,OAAQ,OAAQ,MAAQ,KAAQ,OAAQ,OAAQ,OAAQ,MAAQ,OAAQ,OAAQ,OAAQ,IAAM,CAAC;AAAA,MACpJ,OAAO,IAAI,KAAK,GAAG,CAAC,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,IAAM,CAAC;AAAA,MACnJ,OAAO,IAAI,KAAK,GAAG,CAAC,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,KAAM,CAAC;AAAA,MACnJ,OAAO,IAAI,KAAK,GAAG,CAAC,OAAQ,OAAQ,MAAQ,OAAQ,OAAQ,OAAQ,MAAQ,OAAQ,OAAQ,OAAQ,KAAQ,OAAQ,OAAQ,OAAQ,MAAQ,KAAM,CAAC;AAAA,MACnJ,OAAO,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG;AACvB,YAAI,IAAI;AACR,iBAAS,IAAI,GAAG,IAAI,GAAG;AACnB,eAAK,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;AAC7B,gBAAQ,IAAM,IAAI,MAAO,KAAM;AAAA,MACnC;AAAA,MACA,OAAO,iBAAiB,GAAG,IAAI,GAAG,IAAI;AAClC,eAAO,KAAK,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE;AAAA,MACnC;AAAA,MACA,OAAO,SAAS,GAAG,GAAG;AAClB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC,IAAI;AAAA,MACtB;AAAA,MACA,OAAO,SAAS,GAAG;AACf,YAAI,GAAG,IAAI;AACX,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,cAAI,EAAE,CAAC,IAAI,IAAI;AACf,cAAI,KAAK,MAAM,IAAI,KAAK;AACxB,YAAE,CAAC,IAAI,IAAI,IAAI;AAAA,QACnB;AACA,UAAE,CAAC,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,MAC9B;AAAA,MACA,OAAO,SAAS,GAAG,GAAG,GAAG;AACrB,YAAI;AACJ,cAAM,IAAI,EAAE,IAAI;AAChB,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,cAAI,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AACnB,YAAE,CAAC,KAAK;AACR,YAAE,CAAC,KAAK;AAAA,QACZ;AAAA,MACJ;AAAA,MACA,OAAO,UAAU,GAAG,GAAG;AACnB,YAAI;AACJ,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AACd,aAAK,SAAS,CAAC;AACf,aAAK,SAAS,CAAC;AACf,aAAK,SAAS,CAAC;AACf,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,YAAE,CAAC,IAAI,EAAE,CAAC,IAAI;AACd,mBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,cAAE,CAAC,IAAI,EAAE,CAAC,IAAI,SAAW,EAAE,IAAI,CAAC,KAAK,KAAM;AAC3C,cAAE,IAAI,CAAC,KAAK;AAAA,UAChB;AACA,YAAE,EAAE,IAAI,EAAE,EAAE,IAAI,SAAW,EAAE,EAAE,KAAK,KAAM;AAC1C,cAAK,EAAE,EAAE,KAAK,KAAM;AACpB,YAAE,EAAE,KAAK;AACT,eAAK,SAAS,GAAG,GAAG,IAAI,CAAC;AAAA,QAC7B;AACA,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,YAAE,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI;AAClB,YAAE,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK;AAAA,QAC3B;AAAA,MACJ;AAAA,MACA,OAAO,SAAS,GAAG,GAAG;AAClB,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,aAAK,UAAU,GAAG,CAAC;AACnB,aAAK,UAAU,GAAG,CAAC;AACnB,eAAO,KAAK,iBAAiB,GAAG,GAAG,GAAG,CAAC;AAAA,MAC3C;AAAA,MACA,OAAO,SAAS,GAAG;AACf,YAAI,IAAI,IAAI,WAAW,EAAE;AACzB,aAAK,UAAU,GAAG,CAAC;AACnB,eAAO,EAAE,CAAC,IAAI;AAAA,MAClB;AAAA,MACA,OAAO,YAAY,GAAG,GAAG;AACrB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,KAAK;AACvC,UAAE,EAAE,KAAK;AAAA,MACb;AAAA,MACA,OAAO,EAAE,GAAG,GAAG,GAAG;AACd,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,MACzB;AAAA,MACA,OAAO,EAAE,GAAG,GAAG,GAAG;AACd,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,MACzB;AAAA,MACA,OAAO,EAAE,GAAG,GAAG,GAAG;AACd,YAAI,GAAG,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE;AAChd,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,CAAC;AACP,cAAM,IAAI;AACV,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,YAAI,EAAE,EAAE;AACR,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,eAAO,IAAI;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,cAAM,KAAK;AACX,eAAO,KAAK;AACZ,eAAO,KAAK;AACZ,eAAO,KAAK;AACZ,eAAO,KAAK;AACZ,eAAO,KAAK;AAGZ,YAAI;AACJ,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,cAAM,IAAI,IAAI,MAAM,IAAI;AAExB,YAAI;AACJ,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,KAAK,IAAI;AACb,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,aAAK,IAAI,IAAI;AACb,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,YAAI,MAAM,IAAI;AACd,YAAI,KAAK,MAAM,IAAI,KAAK;AACxB,cAAM,IAAI,IAAI;AACd,cAAM,IAAI,IAAI,MAAM,IAAI;AACxB,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AAAA,MACZ;AAAA,MACA,OAAO,EAAE,GAAG,GAAG;AACX,aAAK,EAAE,GAAG,GAAG,CAAC;AAAA,MAClB;AAAA,MACA,OAAO,SAAS,GAAG,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AACd,iBAAS,IAAI,KAAK,KAAK,GAAG,KAAK;AAC3B,eAAK,EAAE,GAAG,CAAC;AACX,cAAI,MAAM,KAAK,MAAM;AACjB,iBAAK,EAAE,GAAG,GAAG,CAAC;AAAA,QACtB;AACA,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AAAA,MAClB;AAAA,MACA,OAAO,QAAQ,GAAG,GAAG;AACjB,cAAM,IAAI,KAAK,GAAG;AAClB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AACd,iBAAS,IAAI,KAAK,KAAK,GAAG,KAAK;AAC3B,eAAK,EAAE,GAAG,CAAC;AACX,cAAI,MAAM;AACN,iBAAK,EAAE,GAAG,GAAG,CAAC;AAAA,QACtB;AACA,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AAAA,MAClB;AAAA;AAAA,MAEA,OAAO,YAAY,KAAK,GAAG,GAAG;AAC1B,cAAM,QAAQ,IAAI,WAAW,CAAC;AAC9B,iBAAS,IAAI,GAAG,IAAI,GAAG,EAAE;AACrB,gBAAM,CAAC,IAAI,EAAE,CAAC;AAClB,cAAMC,QAAO,IAAI,QAAQ,EAAE,EAAE,OAAO,CAAC,EAAE,OAAO;AAC9C,iBAAS,IAAI,GAAG,IAAI,IAAI,EAAE;AACtB,cAAI,CAAC,IAAIA,MAAK,CAAC;AACnB,eAAO;AAAA,MACX;AAAA,MACA,OAAO,IAAI,GAAG,GAAG;AACb,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,IAAI,KAAK,GAAG;AAClB,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,GAAG,KAAK,EAAE;AACpB,aAAK,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpB,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,GAAG,GAAG,CAAC;AACd,aAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC;AACjB,aAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC;AACjB,aAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC;AACjB,aAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC;AAAA,MACrB;AAAA,MACA,OAAO,MAAM,GAAG,GAAG,GAAG;AAClB,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,eAAK,SAAS,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC;AAAA,QAC/B;AAAA,MACJ;AAAA,MACA,OAAO,KAAK,GAAG,GAAG;AACd,cAAM,KAAK,KAAK,GAAG;AACnB,cAAM,KAAK,KAAK,GAAG;AACnB,cAAM,KAAK,KAAK,GAAG;AACnB,aAAK,SAAS,IAAI,EAAE,CAAC,CAAC;AACtB,aAAK,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE;AACnB,aAAK,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE;AACnB,aAAK,UAAU,GAAG,EAAE;AACpB,UAAE,EAAE,KAAK,KAAK,SAAS,EAAE,KAAK;AAAA,MAClC;AAAA,MACA,OAAO,WAAW,GAAG,GAAG,GAAG;AACvB,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,iBAAS,IAAI,KAAK,KAAK,GAAG,EAAE,GAAG;AAC3B,gBAAM,IAAK,EAAG,IAAI,IAAK,CAAC,MAAM,IAAI,KAAM;AACxC,eAAK,MAAM,GAAG,GAAG,CAAC;AAClB,eAAK,IAAI,GAAG,CAAC;AACb,eAAK,IAAI,GAAG,CAAC;AACb,eAAK,MAAM,GAAG,GAAG,CAAC;AAAA,QACtB;AAAA,MACJ;AAAA,MACA,OAAO,WAAW,GAAG,GAAG;AACpB,cAAM,IAAI,CAAC,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AACrD,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC;AAC1B,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC;AAC1B,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,aAAK,EAAE,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;AAC3B,aAAK,WAAW,GAAG,GAAG,CAAC;AAAA,MAC3B;AAAA,MACA,OAAO,IAAI,IAAI,aAAa;AAAA,QACxB;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAC1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAC1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAC1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,MAC9C,CAAC;AAAA,MACD,OAAO,KAAK,GAAG,GAAG;AACd,YAAI,OAAO,GAAG,GAAG;AACjB,aAAK,IAAI,IAAI,KAAK,IAAI,EAAE,GAAG;AACvB,kBAAQ;AACR,eAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,EAAE,GAAG;AACrC,cAAE,CAAC,KAAK,QAAQ,KAAK,EAAE,CAAC,IAAI,KAAK,EAAE,KAAK,IAAI,GAAG;AAC/C,oBAAQ,KAAK,OAAO,EAAE,CAAC,IAAI,OAAO,GAAG;AACrC,cAAE,CAAC,KAAK,QAAQ;AAAA,UACpB;AACA,YAAE,CAAC,KAAK;AACR,YAAE,CAAC,IAAI;AAAA,QACX;AACA,gBAAQ;AACR,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,YAAE,CAAC,KAAK,SAAS,EAAE,EAAE,KAAK,KAAK,KAAK,EAAE,CAAC;AACvC,kBAAQ,EAAE,CAAC,KAAK;AAChB,YAAE,CAAC,KAAK;AAAA,QACZ;AACA,aAAK,IAAI,GAAG,IAAI,IAAI;AAChB,YAAE,CAAC,KAAK,QAAQ,KAAK,EAAE,CAAC;AAC5B,aAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACrB,YAAE,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC,IAAI;AAAA,QAClB;AAAA,MACJ;AAAA,MACA,OAAO,OAAO,GAAG;AACb,YAAI,IAAI,IAAI,aAAa,EAAE;AAC3B,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AACd,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI;AACX,aAAK,KAAK,GAAG,CAAC;AAAA,MAClB;AAAA;AAAA,MAEA,OAAO,YAAY,IAAI,GAAG,GAAG,IAAI,IAAI;AACjC,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,IAAI,aAAa,EAAE;AAC7B,cAAM,IAAI,CAAC,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AACrD,aAAK,YAAY,GAAG,IAAI,EAAE;AAC1B,UAAE,CAAC,KAAK;AACR,UAAE,EAAE,KAAK;AACT,UAAE,EAAE,KAAK;AACT,cAAM,QAAQ,IAAI;AAClB,iBAAS,IAAI,GAAG,IAAI,GAAG;AACnB,aAAG,KAAK,CAAC,IAAI,EAAE,CAAC;AACpB,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,aAAG,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;AACzB,aAAK,YAAY,GAAG,GAAG,SAAS,EAAE,GAAG,IAAI,EAAE;AAC3C,aAAK,OAAO,CAAC;AACb,aAAK,WAAW,GAAG,CAAC;AACpB,aAAK,KAAK,IAAI,CAAC;AACf,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,aAAG,IAAI,EAAE,IAAI,GAAG,CAAC;AACrB,aAAK,YAAY,GAAG,IAAI,IAAI,EAAE;AAC9B,aAAK,OAAO,CAAC;AACb,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI;AACX,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,CAAC,IAAI,EAAE,CAAC;AACd,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,mBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,cAAE,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,UAC1B;AAAA,QACJ;AACA,aAAK,KAAK,GAAG,SAAS,EAAE,GAAG,CAAC;AAC5B,eAAO;AAAA,MACX;AAAA,MACA,OAAO,UAAU,GAAG,GAAG;AACnB,cAAM,IAAI,KAAK,GAAG;AAClB,cAAM,MAAM,KAAK,GAAG;AACpB,cAAM,MAAM,KAAK,GAAG;AACpB,cAAM,MAAM,KAAK,GAAG;AACpB,cAAM,OAAO,KAAK,GAAG;AACrB,cAAM,OAAO,KAAK,GAAG;AACrB,cAAM,OAAO,KAAK,GAAG;AACrB,aAAK,SAAS,EAAE,CAAC,GAAG,KAAK,GAAG;AAC5B,aAAK,YAAY,EAAE,CAAC,GAAG,CAAC;AACxB,aAAK,EAAE,KAAK,EAAE,CAAC,CAAC;AAChB,aAAK,EAAE,KAAK,KAAK,KAAK,CAAC;AACvB,aAAK,EAAE,KAAK,KAAK,EAAE,CAAC,CAAC;AACrB,aAAK,EAAE,KAAK,EAAE,CAAC,GAAG,GAAG;AACrB,aAAK,EAAE,MAAM,GAAG;AAChB,aAAK,EAAE,MAAM,IAAI;AACjB,aAAK,EAAE,MAAM,MAAM,IAAI;AACvB,aAAK,EAAE,GAAG,MAAM,GAAG;AACnB,aAAK,EAAE,GAAG,GAAG,GAAG;AAChB,aAAK,QAAQ,GAAG,CAAC;AACjB,aAAK,EAAE,GAAG,GAAG,GAAG;AAChB,aAAK,EAAE,GAAG,GAAG,GAAG;AAChB,aAAK,EAAE,GAAG,GAAG,GAAG;AAChB,aAAK,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG;AACnB,aAAK,EAAE,KAAK,EAAE,CAAC,CAAC;AAChB,aAAK,EAAE,KAAK,KAAK,GAAG;AACpB,YAAI,KAAK,SAAS,KAAK,GAAG;AACtB,eAAK,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;AAC7B,aAAK,EAAE,KAAK,EAAE,CAAC,CAAC;AAChB,aAAK,EAAE,KAAK,KAAK,GAAG;AACpB,YAAI,KAAK,SAAS,KAAK,GAAG;AACtB,iBAAO;AACX,YAAI,KAAK,SAAS,EAAE,CAAC,CAAC,MAAO,EAAE,EAAE,KAAK;AAClC,eAAK,EAAE,EAAE,CAAC,GAAG,KAAK,KAAK,EAAE,CAAC,CAAC;AAC/B,aAAK,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACvB,eAAO;AAAA,MACX;AAAA,MACA,OAAO,iBAAiB,GAAG,IAAI,GAAG,IAAI;AAClC,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,cAAM,IAAI,CAAC,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AACrD,cAAM,IAAI,CAAC,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AACrD,YAAI,IAAI;AACJ,iBAAO;AACX,YAAI,KAAK,UAAU,GAAG,EAAE;AACpB,iBAAO;AACX,iBAAS,IAAI,GAAG,IAAI,GAAG;AACnB,YAAE,CAAC,IAAI,GAAG,CAAC;AACf,iBAAS,IAAI,GAAG,IAAI,IAAI;AACpB,YAAE,IAAI,EAAE,IAAI,GAAG,CAAC;AACpB,aAAK,YAAY,GAAG,GAAG,CAAC;AACxB,aAAK,OAAO,CAAC;AACb,aAAK,WAAW,GAAG,GAAG,CAAC;AACvB,aAAK,WAAW,GAAG,GAAG,SAAS,EAAE,CAAC;AAClC,aAAK,IAAI,GAAG,CAAC;AACb,aAAK,KAAK,GAAG,CAAC;AACd,aAAK;AACL,YAAI,KAAK,iBAAiB,IAAI,GAAG,GAAG,CAAC,GAAG;AACpC,mBAAS,IAAI,GAAG,IAAI,GAAG;AACnB,cAAE,CAAC,IAAI;AACX,iBAAO;AAAA,QACX;AACA,iBAAS,IAAI,GAAG,IAAI,GAAG;AACnB,YAAE,CAAC,IAAI,GAAG,IAAI,EAAE;AACpB,eAAO;AAAA,MACX;AAAA,MACA,OAAO,oBAAoB;AAAA,MAC3B,OAAO,6BAA6B;AAAA,MACpC,OAAO,6BAA6B;AAAA,MACpC,OAAO,wBAAwB;AAAA;AAAA,MAE/B,OAAO,mBAAmB,MAAM;AAC5B,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAClC,cAAI,EAAE,KAAK,CAAC,aAAa;AACrB,kBAAM,IAAI,UAAU,iCAAiC,KAAK,CAAC,EAAE,aAAa,QAAQ,OAAO,KAAK,CAAC,CAAC,EAAE;AAAA,QAC1G;AAAA,MACJ;AAAA,MACA,OAAO,SAASC,MAAK;AACjB,YAAIA,KAAI,SAAS,MAAM;AACnB,UAAAA,OAAM,IAAIA,IAAG;AACjB,cAAM,MAAMA,KAAI,MAAM,SAAS,GAAG,IAAI,UAAQ,SAAS,MAAM,EAAE,CAAC;AAChE,eAAO,WAAW,KAAK,OAAO,CAAC,CAAC;AAAA,MACpC;AAAA,MACA,OAAO,OAAO,KAAK;AACf,YAAI,MAAM;AACV,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,cAAI,OAAO,IAAI,CAAC,MAAM;AAClB,kBAAM,IAAI,UAAU,+CAA+C,OAAO,IAAI,CAAC,CAAC,EAAE;AACtF,cAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;AACvB,kBAAM,IAAI,WAAW,uCAAuC,IAAI,CAAC,CAAC,EAAE;AACxE,iBAAO,IAAI,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAAA,QAC9C;AACA,eAAO;AAAA,MACX;AAAA,MACA,OAAO,KAAK,KAAK,WAAW;AACxB,aAAK,gBAAgB,KAAK,SAAS;AACnC,YAAI,UAAU,WAAW,KAAK;AAC1B,gBAAM,IAAI,MAAM,qBAAqB;AACzC,YAAI,YAAY,IAAI,WAAW,KAAK,oBAAoB,IAAI,MAAM;AAClE,cAAM,YAAY,KAAK,SAAS,KAAK,QAAQ,SAAS,CAAC;AACvD,aAAK,YAAY,WAAW,KAAK,IAAI,QAAQ,WAAW,SAAS;AACjE,eAAO;AAAA,MACX;AAAA,MACA,OAAO,KAAK,WAAW,WAAW;AAC9B,aAAK,gBAAgB,WAAW,SAAS;AACzC,YAAI,UAAU,WAAW,KAAK;AAC1B,gBAAM,IAAI,MAAM,qBAAqB;AACzC,cAAM,MAAM,IAAI,WAAW,UAAU,MAAM;AAC3C,YAAI,OAAO,KAAK,iBAAiB,KAAK,WAAW,UAAU,QAAQ,SAAS;AAC5E,YAAI,OAAO;AACP,iBAAO,IAAI,WAAW,CAAC;AAC3B,YAAI,IAAI,IAAI,WAAW,IAAI;AAC3B,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ;AAC1B,YAAE,CAAC,IAAI,IAAI,CAAC;AAChB,eAAO;AAAA,MACX;AAAA,MACA,OAAO,SAAS,KAAK,WAAW;AAC5B,YAAI,YAAY,KAAK,KAAK,KAAK,SAAS;AACxC,YAAI,MAAM,IAAI,WAAW,KAAK,iBAAiB;AAC/C,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC5B,cAAI,CAAC,IAAI,UAAU,CAAC;AACxB,eAAO,KAAK,OAAO,GAAG,EAAE,YAAY;AAAA,MACxC;AAAA,MACA,OAAO,OAAO,KAAK,KAAK,WAAW;AAC/B,aAAK,gBAAgB,KAAK,KAAK,SAAS;AACxC,YAAI,IAAI,WAAW,KAAK;AACpB,gBAAM,IAAI,MAAM,oBAAoB;AACxC,YAAI,UAAU,WAAW,KAAK;AAC1B,gBAAM,IAAI,MAAM,qBAAqB;AACzC,cAAM,KAAK,IAAI,WAAW,KAAK,oBAAoB,IAAI,MAAM;AAC7D,cAAM,IAAI,IAAI,WAAW,KAAK,oBAAoB,IAAI,MAAM;AAC5D,iBAAS,IAAI,GAAG,IAAI,KAAK,mBAAmB;AACxC,aAAG,CAAC,IAAI,IAAI,CAAC;AACjB,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC5B,aAAG,IAAI,KAAK,iBAAiB,IAAI,IAAI,CAAC;AAC1C,eAAQ,KAAK,iBAAiB,GAAG,IAAI,GAAG,QAAQ,SAAS,KAAK;AAAA,MAClE;AAAA,MACA,OAAO,QAAQ,MAAM;AACjB,YAAI,OAAO,SAAS;AAChB,iBAAO,KAAK,SAAS,IAAI;AAC7B,aAAK,gBAAgB,IAAI;AACzB,YAAI,KAAK,WAAW,KAAK;AACrB,gBAAM,IAAI,MAAM,eAAe;AACnC,cAAM,KAAK,IAAI,WAAW,KAAK,0BAA0B;AACzD,cAAM,IAAI,CAAC,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AACrD,cAAMD,QAAO,IAAI,QAAQ,EAAE,EAAE,OAAO,IAAI,EAAE,OAAO;AACjD,QAAAA,MAAK,CAAC,KAAK;AACX,QAAAA,MAAK,EAAE,KAAK;AACZ,QAAAA,MAAK,EAAE,KAAK;AACZ,aAAK,WAAW,GAAGA,KAAI;AACvB,aAAK,KAAK,IAAI,CAAC;AACf,eAAO,KAAK,OAAO,EAAE,EAAE,YAAY;AAAA,MACvC;AAAA,IACJ;AACA,IAAO,oBAAQ;AAAA,mBACI,OAAO;AAAA,2BACC,eAAe;AAAA,oBACtB,QAAQ;AAAA;AAAA;AAAA;;;ACv2B5B,IAca;AAdb;AAAA;AAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AAOO,IAAM,UAAN,MAAM,SAAQ;AAAA,MACjB,OAAO,cAAc;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,IAAI,UAAU;AAAE,eAAO,GAAG,MAAM,GAAG,KAAK,EAAE;AAAA,MAAI;AAAA,MAC9C,IAAI,YAAY;AAAE,eAAO,KAAK;AAAA,MAAM;AAAA,MACpC,IAAI,aAAa;AAAE,eAAO,KAAK;AAAA,MAAM;AAAA,MACrC,IAAI,QAAQ;AAAE,eAAO,KAAK;AAAA,MAAI;AAAA,MAC9B,IAAI,WAAW;AAAE,eAAO,KAAK;AAAA,MAAI;AAAA,MACjC,IAAI,UAAU;AAAE,eAAO,KAAK;AAAA,MAAI;AAAA,MAChC,IAAI,aAAa;AAAE,eAAO,KAAK;AAAA,MAAI;AAAA,MACnC,IAAI,iBAAiB;AAAE,eAAO,KAAK;AAAA,MAAM;AAAA,MACzC,IAAI,SAAS;AAAE,eAAO,KAAK;AAAA,MAAI;AAAA,MAC/B,IAAI,SAAS,GAAG;AAAE,aAAK,KAAK;AAAA,MAAG;AAAA,MAC/B,IAAI,QAAQ,GAAG;AAAE,aAAK,KAAK,IAAI,OAAO,CAAC,IAAI;AAAA,MAAW;AAAA,MACtD,IAAI,WAAW,GAAG;AAAE,aAAK,KAAK,IAAI,OAAO,CAAC,IAAI;AAAA,MAAW;AAAA,MACzD,IAAI,eAAe,GAAG;AAClB,YAAI,GAAG,gBAAgB,UAAS;AAC5B,eAAK,OAAO;AAAA,QAChB,WACS,OAAO,MAAM,UAAU;AAC5B,eAAK,OAAO,SAAQ,YAAY,CAAC;AAAA,QACrC,OACK;AACD,gBAAM,IAAI,UAAU,gDAAgD,CAAC,EAAE;AAAA,QAC3E;AAAA,MACJ;AAAA,MACA,IAAI,OAAO,GAAG;AAAE,aAAK,KAAK,IAAI,OAAO,CAAC,IAAI;AAAA,MAAW;AAAA,MACrD,YAAY,SAAS,WAAW,YAAY,OAAO;AAC/C,YAAI,CAAC,SAAQ,aAAa;AACtB,gBAAM,IAAI,MAAM,uEAAuE;AAAA,QAC3F;AACA,YAAI,UAAU,UAAa,OAAO,UAAU,UAAU;AAClD,gBAAM,IAAI,UAAU,iBAAiB,KAAK,0BAA0B,OAAO,EAAE;AAAA,QACjF;AACA,aAAK,KAAK,QACL,QAAQ,QAAQ,EAAE,EAClB,QAAQ,eAAe,EAAE;AAC9B,aAAK,OAAO;AACZ,aAAK,OAAO,cAAc;AAC1B,aAAK,KAAK;AACV,aAAK,KAAK,IAAI,KAAK;AACnB,iBAAQ,cAAc;AAAA,MAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,OAAO,YAAY,SAAS,OAAO;AAC/B,iBAAQ,cAAc;AACtB,iBAAQ,SAAS,OAAO;AACxB,cAAM,YAAY,SAAQ,cAAc,OAAO;AAC/C,cAAM,UAAU,IAAI,KAAK,SAAS,WAAW,QAAW,KAAK;AAC7D,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,OAAO,cAAc,WAAW,OAAO;AACnC,iBAAQ,cAAc;AACtB,iBAAQ,aAAa,SAAS;AAC9B,cAAM,UAAU,SAAQ,cAAc,SAAS;AAC/C,cAAM,UAAU,IAAI,KAAK,SAAS,WAAW,QAAW,KAAK;AAC7D,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,OAAO,eAAe,YAAY,OAAO;AACrC,iBAAQ,cAAc;AACtB,iBAAQ,aAAa,UAAU;AAC/B,cAAM,YAAY,SAAS,QAAQ,UAAU;AAC7C,cAAM,UAAU,SAAQ,cAAc,WAAW,KAAK;AACtD,gBAAQ,OAAO,WAAW,YAAY;AACtC,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAcA,OAAO,YAAY,YAAY,WAAW,OAAO;AAC7C,iBAAQ,cAAc;AACtB,iBAAQ,aAAa,UAAU;AAC/B,cAAM,UAAU,SAAQ,cAAc,WAAW,KAAK;AACtD,gBAAQ,OAAO,WAAW,YAAY;AACtC,eAAO;AAAA,MACX;AAAA,MACA,MAAM,KAAK,SAAS;AAChB,YAAI;AACA,cAAI,KAAK,QAAQ,MAAM;AACnB,kBAAM,KAAK,GAAG,IAAI,KAAK,MAAM,SAAS,KAAK,IAAI;AAAA,UACnD;AAAA,QACJ,SACO,KAAK;AACR,kBAAQ,MAAM,0BAA0B,KAAK,OAAO,IAAI,GAAG;AAC3D,iBAAO;AAAA,QACX;AACA,aAAK,OAAO;AACZ,eAAO;AAAA,MACX;AAAA,MACA,MAAM,OAAO,SAAS;AAClB,YAAI;AACA,eAAK,OAAO,MAAM,KAAK,GAAG,IAAI,KAAK,MAAM,OAAO;AAAA,QACpD,SACO,KAAK;AACR,kBAAQ,MAAM,4BAA4B,KAAK,OAAO,IAAI,GAAG;AAC7D,iBAAO;AAAA,QACX;AACA,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,OAAO,SAAS,SAAS;AACrB,YAAI,YAAY,QAAW;AACvB,gBAAM,IAAI,eAAe,uBAAuB;AAAA,QACpD;AACA,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,2BAA2B;AAAA,QACnD;AACA,cAAM,UAAU,IAAI,OAAO,KAAK,MAAM,IAAI,aAAa,YAAY,QAAQ,QAAQ;AACnF,YAAI,CAAC,QAAQ,KAAK,OAAO,GAAG;AACxB,gBAAM,IAAI,WAAW,wBAAwB;AAAA,QACjD;AACA,cAAM,mBAAmB,QAAQ,MAAM,EAAE;AACzC,cAAM,YAAY,QAAQ,MAAM,QAAQ,QAAQ,GAAG,IAAI,GAAG,EAAE;AAC5D,cAAM,SAAS,OAAO,QAAQ,SAAS;AACvC,cAAM,oBAAoB,IAAI,QAAQ,CAAC,EAAE,OAAO,MAAM,EAAE,OAAO;AAC/D,0BAAkB,QAAQ;AAC1B,cAAM,iBAAiB,MAAM,SAAS,iBAAiB;AACvD,YAAI,qBAAqB,gBAAgB;AACrC,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAChD;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,MAAM,QAAQ,KAAK;AACf,YAAI,OAAO,QAAQ,YAAY,IAAI,gBAAgB,KAAK;AACpD,gBAAM,IAAI,IAAI,GAAG;AAAA,QACrB;AACA,YAAI,IAAI,gBAAgB,KAAK;AACzB,gBAAM,IAAI,UAAU,0BAA0B;AAAA,QAClD;AACA,cAAM,OAAO;AAAA,UACT,WAAW,KAAK;AAAA,UAChB,cAAc;AAAA,UACd,kBAAkB;AAAA,UAClB,UAAU;AAAA,QACd;AACA,cAAM,EAAE,SAAS,UAAU,YAAY,gBAAgB,OAAO,IAAI,MAAM,IAAI,KAAK,gBAAgB,IAAI;AACrG,YAAI,YAAY,MAAM;AAClB,gBAAM,IAAI,MAAM,mBAAmB;AAAA,QACvC;AACA,aAAK,KAAK,OAAO,OAAO;AACxB,aAAK,KAAK;AACV,aAAK,KAAK,OAAO,UAAU;AAC3B,aAAK,OAAO,SAAQ,YAAY,cAAc;AAC9C,aAAK,KAAK,OAAO,MAAM;AAAA,MAC3B;AAAA,MACA,OAAO,cAAc,GAAG;AACpB,cAAM,iBAAiB,OAAO,QAAQ,EAAE,MAAM,KAAK,EAAE,CAAC;AACtD,cAAM,gBAAgB,OAAO,QAAQ,EAAE,MAAM,EAAE,CAAC;AAChD,cAAM,kBAAkB,IAAI,QAAQ,CAAC,EAAE,OAAO,cAAc,EAAE,OAAO,EAAE,QAAQ;AAC/E,YAAI,MAAM,MAAM,aAAa,MAAM,MAAM,MAAM,eAAe,GAAG;AAC7D,gBAAM,IAAI,MAAM,8BAA8B;AAAA,QAClD;AACA,eAAO,MAAM,MAAM,cAAc;AAAA,MACrC;AAAA,MACA,OAAO,cAAc,WAAW;AAC5B,cAAM,iBAAiB,IAAI,QAAQ,SAAS;AAC5C,cAAM,gBAAgB,IAAI,QAAQ,CAAC,EAAE,OAAO,cAAc,EAAE,OAAO,EAAE,QAAQ;AAC7E,cAAM,mBAAmB,MAAM,SAAS,cAAc;AACtD,cAAM,kBAAkB,MAAM,SAAS,aAAa;AACpD,eAAO,GAAG,MAAM,GAAG,gBAAgB,GAAG,eAAe;AAAA,MACzD;AAAA,MACA,OAAO,aAAa,KAAK;AACrB,YAAI,QAAQ,QAAW;AACnB,gBAAM,IAAI,UAAU,kBAAkB;AAAA,QAC1C;AACA,YAAI,OAAO,QAAQ,UAAU;AACzB,gBAAM,IAAI,UAAU,sBAAsB;AAAA,QAC9C;AACA,YAAI,IAAI,WAAW,oBAAoB;AACnC,gBAAM,IAAI,UAAU,eAAe,kBAAkB,aAAa;AAAA,QACtE;AACA,YAAI,CAAC,kBAAkB,KAAK,GAAG,GAAG;AAC9B,gBAAM,IAAI,WAAW,sCAAsC;AAAA,QAC/D;AAAA,MACJ;AAAA,IACJ;AAAA;AAAA;;;AClPA,IAGa,UA4GN;AA/GP;AAAA;AAAA;AAEA;AACO,IAAM,WAAN,MAAM,kBAAiB,gBAAgB;AAAA,MAC1C,OAAO,kBAAkB;AAAA,MACzB,OAAO,gBAAgB;AAAA,MACvB,OAAO,kBAAkB;AAAA,MACzB,OAAO,iBAAiB;AAAA,MACxB,OAAO;AACH,kBAAS,OAAO;AAAA,MACpB;AAAA,MACA,aAAa,KAAK,MAAM;AACpB,mBAAW,KAAK,MAAM;AAClB,cAAI,EAAE,QAAQ,QAAQ,EAAE,SAAS,KAAK,eAAe;AACjD,cAAE,aAAa,MAAM,KAAK,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK;AAAA,UACzD,OACK;AACD,cAAE,aAAa,MAAM,KAAK,QAAQ,EAAE,MAAM,EAAE,KAAK;AAAA,UACrD;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,aAAa,QAAQ,MAAM,OAAO;AAC9B,YAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,KAAK,QAAQ,YAAY;AACjE,gBAAM,IAAI,WAAW,6BAA6B,MAAM,SAAS,EAAE,CAAC,EAAE;AAAA,QAC1E;AACA,eAAO,MAAM,KAAK,IAAI,MAAM,KAAK,iBAAiB,KAAK;AAAA,MAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,aAAa,IAAI,MAAM,MAAM,OAAO;AAChC,YAAI,KAAK,SAAS,MAAM,KAAK,SAAS,KAAK;AACvC,gBAAM,IAAI,WAAW,qBAAqB;AAAA,QAC9C;AACA,YAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,KAAK,QAAQ,YAAY;AACjE,gBAAM,IAAI,WAAW,6BAA6B,MAAM,SAAS,EAAE,CAAC,EAAE;AAAA,QAC1E;AACA,cAAM,YAAY,MAAM,KAAK,OAAO,KAAK,gBAAgB,IAAI;AAC7D,cAAM,aAAa,MAAM,KAAK,QAAQ,WAAW,KAAK,gBAAgB,KAAK,eAAe;AAC1F,cAAM,UAAU,MAAM,KAAK,QAAQ,YAAY,OAAO,KAAK,eAAe;AAC1E,cAAM,aAAa,MAAM,KAAK,QAAQ,SAAS,QAAQ,KAAK,eAAe;AAC3E,cAAM,aAAa,IAAI,WAAW,WAAW,WAAW,MAAM;AAC9D,YAAIE,OAAM;AACV,iBAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AACxC,UAAAA,QAAO,WAAW,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAAA,QACrD;AACA,eAAOA;AAAA,MACX;AAAA,MACA,aAAa,OAAO,OAAO,GAAG;AAC1B,cAAM,MAAM,IAAI,YAAY,EAAE,OAAO,KAAK;AAC1C,cAAM,OAAO,IAAI,WAAW,EAAE;AAC9B,aAAK,IAAI,EAAE,MAAM,SAAS,EAAE,IAAI,UAAQ,SAAS,MAAM,EAAE,CAAC,CAAC;AAC3D,cAAM,IAAI,MAAM,KAAK,KAAK,KAAK,IAAI;AACnC,cAAM,KAAK,IAAI,SAAS,EAAE,OAAO,MAAM,GAAG,EAAE,SAAS,CAAC,CAAC;AACvD,cAAM,KAAK,IAAI,SAAS,EAAE,OAAO,MAAM,EAAE,SAAS,CAAC,CAAC;AACpD,eAAQ,EAAE,YAAY,IAAI,WAAW,GAAG;AAAA,MAC5C;AAAA,MACA,aAAa,QAAQ,EAAE,YAAY,UAAU,GAAG,OAAO;AACnD,cAAM,MAAM,IAAI,WAAW,UAAU,MAAM;AAC3C,cAAM,OAAO,IAAI,WAAW,EAAE;AAC9B,aAAK,IAAI,CAAC,CAAC,CAAC;AACZ,aAAK,IAAI,KAAK,OAAO,UAAU,GAAG,CAAC;AACnC,aAAK,IAAI,KAAK,MAAM,KAAK,GAAG,EAAE;AAC9B,cAAM,IAAI,MAAM,KAAK,KAAK,KAAK,IAAI;AACnC,cAAM,KAAK,IAAI,SAAS,EAAE,OAAO,MAAM,GAAG,EAAE,SAAS,CAAC,CAAC;AACvD,cAAM,KAAK,IAAI,SAAS,EAAE,OAAO,MAAM,EAAE,SAAS,CAAC,CAAC;AACpD,eAAQ,EAAE,YAAY,IAAI,WAAW,GAAG;AAAA,MAC5C;AAAA,MACA,OAAO,MAAM,SAAS;AAClB,YAAI,OAAO,YAAY,UAAU;AAC7B,gBAAM,IAAI,UAAU,+BAA+B,OAAO,OAAO,EAAE;AAAA,QACvE;AACA,YAAI,UAAU,YAAY;AACtB,gBAAM,IAAI,WAAW,qCAAqC,QAAQ,SAAS,CAAC,EAAE,MAAM,eAAe,OAAO,EAAE;AAAA,QAChH;AACA,cAAM,OAAO,IAAI,SAAS,IAAI,YAAY,CAAC,CAAC;AAC5C,aAAK,UAAU,GAAG,SAAS,KAAK;AAChC,eAAO,IAAI,WAAW,KAAK,MAAM;AAAA,MACrC;AAAA,MACA,OAAO,OAAO,SAAS;AACnB,YAAI,QAAQ,gBAAgB,UAAU;AAClC,gBAAM,IAAI,UAAU,+BAA+B,OAAO,OAAO,EAAE;AAAA,QACvE;AACA,YAAI,QAAQ,aAAa,IAAI;AACzB,gBAAM,IAAI,WAAW,sCAAsC,QAAQ,UAAU,gBAAgB,OAAO,EAAE;AAAA,QAC1G;AACA,eAAO,IAAI,WAAW,QAAQ,MAAM;AAAA,MACxC;AAAA,MACA,aAAa,KAAK,KAAK,MAAM;AACzB,cAAM,EAAE,QAAAC,QAAO,IAAI,WAAW;AAC9B,cAAM,KAAK,MAAMA,QAAO,UAAU,OAAO,KAAK,EAAE,MAAM,QAAQ,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC;AAChG,cAAM,YAAY,MAAMA,QAAO,KAAK,QAAQ,IAAI,IAAI;AACpD,eAAO,IAAI,WAAW,SAAS;AAAA,MACnC;AAAA,IACJ;AACA,IAAO,oBAAQ;AAAA,2BACY,eAAe;AAAA,oBACtB,QAAQ;AAAA;AAAA;AAAA;;;ACjH5B,IAKa,KAwYN;AA7YP;AAAA;AAAA;AAIA;AACO,IAAM,MAAN,MAAM,aAAY,gBAAgB;AAAA,MACrC,OAAO;AACH,aAAI,OAAO;AAAA,MACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,aAAa,KAAK,MAAM;AACpB,eAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC1C,qBAAW,KAAK,MAAM;AAClB,gBAAI;AACA,gBAAE,OAAO,MAAM,KAAK,KAAK,EAAE,MAAM,EAAE,SAAS;AAAA,YAChD,SACO,KAAK;AACR,qBAAO,GAAG;AAAA,YACd;AAAA,UACJ;AACA,kBAAQ,IAAI;AAAA,QAChB,CAAC;AAAA,MACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,aAAa,KAAKC,OAAM,YAAY,YAAY;AAC5C,eAAO,IAAI,QAAQ,aAAW;AAC1B,eAAK,WAAWA,OAAM,SAAS,SAAS;AAAA,QAC5C,CAAC;AAAA,MACL;AAAA;AAAA,MAEA,OAAO,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAanB,OAAO,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MA4KnB,OAAO,YAAY,MAAM,KAAK,IAAI,GAAG,KAAK,MAAM,UAAU,mBAAmB,CAAC;AAAA,MAC9E,OAAO,QAAQ,KAAK;AAChB,YAAI,MAAM;AACV,iBAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACtC,iBAAO,IAAI,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAAA,QAC9C;AACA,eAAO;AAAA,MACX;AAAA,MACA,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA;AAAA,MAEP,OAAO,aAAa,IAAI,aAAa;AAAA,QACjC;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAC3B;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,MAC/B,CAAC;AAAA;AAAA,MAED,OAAO,cAAc,IAAI,aAAa;AAAA,QAClC;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,MACrC,CAAC;AAAA,MAED,OAAO;AACH,aAAK,MAAM,IAAI,gBAAgB,KAAK,WAAW,KAAK,SAAS,EAAE,WAAW,QAAQ;AAClF,YAAI,KAAK,OAAO;AACZ,gBAAM,IAAI,MAAM,qBAAqB;AACzC,aAAK,IAAI,WAAW,GAAG,GAAG,GAAG,CAAC;AAC9B,aAAK,WAAW,KAAK,IAAI,cAAc;AACvC,YAAI,KAAK,YAAY;AACjB,gBAAM,IAAI,MAAM,iCAAiC;AACrD,aAAK,gBAAgB,KAAK,IAAI,aAAa,KAAK,IAAI,aAAa;AACjE,YAAI,KAAK,iBAAiB;AACtB,gBAAM,IAAI,MAAM,gCAAgC;AACpD,aAAK,IAAI,aAAa,KAAK,eAAe,KAAK,SAAS;AACxD,aAAK,IAAI,cAAc,KAAK,aAAa;AACzC,YAAI,CAAC,KAAK,IAAI,mBAAmB,KAAK,eAAe,KAAK,IAAI,cAAc;AACxE,gBAAM,IAAI,MAAM,KAAK,IAAI,iBAAiB,KAAK,aAAa,KAAK,iCAAiC;AACtG,aAAK,kBAAkB,KAAK,IAAI,aAAa,KAAK,IAAI,eAAe;AACrE,YAAI,KAAK,mBAAmB;AACxB,gBAAM,IAAI,MAAM,kCAAkC;AACtD,aAAK,IAAI,aAAa,KAAK,iBAAiB,KAAK,SAAS;AAC1D,aAAK,IAAI,cAAc,KAAK,eAAe;AAC3C,YAAI,CAAC,KAAK,IAAI,mBAAmB,KAAK,iBAAiB,KAAK,IAAI,cAAc;AAC1E,gBAAM,IAAI,MAAM,KAAK,IAAI,iBAAiB,KAAK,eAAe,KAAK,mCAAmC;AAC1G,aAAK,IAAI,aAAa,KAAK,UAAU,KAAK,aAAa;AACvD,aAAK,IAAI,aAAa,KAAK,UAAU,KAAK,eAAe;AACzD,aAAK,IAAI,YAAY,KAAK,QAAQ;AAClC,YAAI,CAAC,KAAK,IAAI,oBAAoB,KAAK,UAAU,KAAK,IAAI,WAAW;AACjE,gBAAM,IAAI,MAAM,KAAK,IAAI,kBAAkB,KAAK,QAAQ,KAAK,wBAAwB;AAEzF,aAAK,IAAI,WAAW,KAAK,QAAQ;AACjC,cAAM,gBAAgB,KAAK,IAAI,kBAAkB;AACjD,aAAK,IAAI,gBAAgB,aAAa;AACtC,aAAK,kBAAkB,KAAK,IAAI,aAAa;AAC7C,aAAK,IAAI,WAAW,KAAK,IAAI,cAAc,KAAK,eAAe;AAC/D,aAAK,IAAI,WAAW,KAAK,IAAI,cAAc,KAAK,YAAY,KAAK,IAAI,WAAW;AAChF,aAAK,IAAI,oBAAoB,GAAG,GAAG,KAAK,IAAI,OAAO,OAAO,GAAG,CAAC;AAC9D,aAAK,IAAI,wBAAwB,CAAC;AAClC,aAAK,YAAY,KAAK,IAAI,aAAa;AACvC,aAAK,IAAI,WAAW,KAAK,IAAI,cAAc,KAAK,SAAS;AACzD,aAAK,IAAI,WAAW,KAAK,IAAI,cAAc,KAAK,aAAa,KAAK,IAAI,WAAW;AACjF,aAAK,IAAI,oBAAoB,GAAG,GAAG,KAAK,IAAI,OAAO,OAAO,GAAG,CAAC;AAC9D,aAAK,IAAI,wBAAwB,CAAC;AAClC,aAAK,aAAa,KAAK,IAAI,aAAa;AACxC,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,KAAK,UAAU;AAC5D,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,KAAK,KAAK,IAAI,YAAY;AACvE,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,IAAI;AACjD,aAAK,IAAI,eAAe,KAAK,IAAI,gBAAgB,GAAG,KAAK,UAAU;AACnE,aAAK,IAAI,oBAAoB,KAAK,UAAU,KAAK,IAAI,qBAAqB,KAAK,UAAU,KAAK,GAAG,CAAC;AAClG,aAAK,cAAc,KAAK,IAAI,aAAa;AACzC,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,KAAK,WAAW;AAC7D,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,IAAI,KAAK,IAAI,WAAW;AACrE,aAAK,IAAI,WAAW,KAAK,IAAI,gBAAgB,IAAI;AACjD,aAAK,IAAI,eAAe,KAAK,IAAI,gBAAgB,GAAG,KAAK,WAAW;AACpE,aAAK,IAAI,oBAAoB,KAAK,UAAU,KAAK,IAAI,qBAAqB,KAAK,UAAU,MAAM,GAAG,CAAC;AACnG,aAAK,UAAU,IAAI,WAAW,KAAK,IAAI,qBAAqB,KAAK,IAAI,sBAAsB,CAAC;AAC5F,aAAK,SAAS,KAAK,IAAI,YAAY;AAAA,MACvC;AAAA,MACA,OAAO,WAAW,SAAS,UAAU,WAAW;AAC5C,YAAI,KAAI,OAAO;AACX,gBAAM,IAAI,MAAM,qBAAqB;AACzC,YAAI,CAAC,qBAAqB,KAAK,OAAO;AAClC,gBAAM,IAAI,MAAM,gBAAgB,OAAO,EAAE;AAC7C,YAAI,OAAO,cAAc;AACrB,gBAAM,IAAI,UAAU,qBAAqB,SAAS,EAAE;AACxD,YAAI,KAAK,OAAO;AACZ,gBAAM,IAAI,MAAM,qBAAqB;AAEzC,cAAM,UAAU,IAAI,SAAS,IAAI,YAAY,GAAG,CAAC;AACjD,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;AAC5B,gBAAM,SAAS,QAAQ,MAAM,GAAG,IAAI,CAAC;AACrC,kBAAQ,UAAU,IAAI,GAAG,SAAS,QAAQ,EAAE,CAAC;AAAA,QACjD;AACA,gBAAQ,UAAU,KAAK,WAAW,IAAI;AACtC,gBAAQ,WAAW,KAAK,KAAI,YAAY,GAAG,IAAI;AAC/C,aAAI,IAAI,WAAW,KAAI,IAAI,gBAAgB,KAAI,UAAU;AACzD,aAAI,IAAI,cAAc,KAAI,IAAI,gBAAgB,GAAG,OAAO;AACxD,aAAI,IAAI,WAAW,KAAI,IAAI,gBAAgB,IAAI;AAE/C,cAAM,OAAO,IAAI,WAAW,CAAC;AAC7B,YAAI;AACJ,cAAM,OAAO,MAAM;AACf,kBAAQ,YAAY,IAAI;AACxB,cAAI,KAAI,OAAO;AACX,kBAAM,IAAI,MAAM,qBAAqB;AACzC,cAAI,KAAI,UAAU;AACd,kBAAM,IAAI,MAAM,oCAAoC;AACxD,eAAI,IAAI,MAAM,KAAI,IAAI,gBAAgB;AAEtC,iBAAO,gBAAgB,IAAI;AAC3B,eAAI,IAAI,WAAW,KAAI,IAAI,gBAAgB,KAAI,WAAW;AAC1D,eAAI,IAAI,cAAc,KAAI,IAAI,gBAAgB,GAAG,YAAY,KAAK,IAAI,CAAC;AACvE,eAAI,IAAI,WAAW,KAAI,IAAI,gBAAgB,IAAI;AAC/C,eAAI,IAAI,WAAW,KAAI,IAAI,iCAAiC,KAAI,MAAM;AACtE,eAAI,IAAI,WAAW,KAAI,IAAI,WAAW,GAAG,CAAC;AAC1C,eAAI,IAAI,SAAS,KAAI,IAAI,+BAA+B;AACxD,gCAAsB,gBAAgB;AAAA,QAC1C;AACA,iBAAS,mBAAmB;AACxB,cAAI,KAAI,OAAO;AACX,kBAAM,IAAI,MAAM,4CAA4C;AAChE,cAAI,KAAI,UAAU;AACd,kBAAM,IAAI,MAAM,iBAAiB;AACrC,kBAAQ,IAAI,aAAa,YAAY,IAAI,IAAI,KAAK,MAAM;AACxD,cAAI,KAAI,IAAI,kBAAkB,KAAI,QAAQ,KAAI,IAAI,sBAAsB,GAAG;AACvE,oBAAQ,IAAI,cAAc,YAAY,IAAI,IAAI,KAAK,MAAM;AACzD,kBAAM,mBAAmB,KAAI,IAAI,kBAAkB,KAAI,QAAQ,KAAI,IAAI,YAAY;AACnF,gBAAI,kBAAkB;AAElB,6BAAe;AAAA,YACnB,OACK;AACD,sBAAQ,IAAI,cAAc,YAAY,IAAI,IAAI,KAAK,MAAM;AAEzD,oCAAsB,IAAI;AAAA,YAC9B;AAAA,UACJ,OACK;AACD,oBAAQ,IAAI,cAAc,YAAY,IAAI,IAAI,KAAK,MAAM;AAEzD,kCAAsB,gBAAgB;AAAA,UAC1C;AAAA,QACJ;AACA,iBAAS,iBAAiB;AACtB,cAAI,KAAI,OAAO;AACX,kBAAM,IAAI,MAAM,2CAA2C;AAC/D,eAAI,IAAI,WAAW,GAAG,GAAG,KAAI,IAAI,oBAAoB,KAAI,IAAI,qBAAqB,KAAI,IAAI,MAAM,KAAI,IAAI,eAAe,KAAI,OAAO;AAElI,mBAAS,IAAI,GAAG,IAAI,KAAI,QAAQ,QAAQ,KAAK,GAAG;AAC5C,gBAAI,KAAI,QAAQ,CAAC,MAAM,GAAG;AACtB,sBAAQ,IAAI,UAAU,YAAY,IAAI,IAAI,KAAK,MAAM;AACrD,oBAAMC,OAAM,KAAI,QAAQ,KAAK,SAAS,GAAG,CAAC,CAAC,IAAI,KAAI,QAAQ;AAAA,gBACvD,KAAI,QAAQ,IAAI,CAAC;AAAA,gBACjB,KAAI,QAAQ,IAAI,CAAC;AAAA,gBACjB,KAAK,CAAC,IAAK,KAAI,QAAQ,CAAC,IAAI;AAAA,gBAC5B,KAAK,CAAC,IAAK,KAAI,QAAQ,IAAI,CAAC,IAAI;AAAA,cACpC,CAAC;AAED,qBAAO,aAAa,cAAc,SAASA,IAAG;AAC9C;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AACA,aAAK;AAAA,MACT;AAAA,IACJ;AACA,IAAO,gBAAQ;AAAA,2BACY,eAAe;AAAA,eAC3B,GAAG;AAAA;AAAA;AAAA;;;AC/YlB,IAKa,QA8VN;AAnWP;AAAA;AAAA;AAIA;AACO,IAAM,SAAN,MAAM,gBAAe,gBAAgB;AAAA,MACxC,OAAO;AACH,gBAAO,OAAO;AAAA,MAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,aAAa,KAAK,MAAM;AACpB,eAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC1C,qBAAW,KAAK,MAAM;AAClB,gBAAI;AACA,gBAAE,OAAO,MAAM,KAAK,KAAK,EAAE,MAAM,EAAE,SAAS;AAAA,YAChD,SACO,KAAK;AACR,qBAAO,GAAG;AAAA,YACd;AAAA,UACJ;AACA,kBAAQ,IAAI;AAAA,QAChB,CAAC;AAAA,MACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,aAAa,KAAKC,OAAM,YAAY,YAAY;AAC5C,eAAO,IAAI,QAAQ,OAAO,YAAY;AAClC,gBAAM,KAAK,WAAWA,OAAM,SAAS,SAAS;AAAA,QAClD,CAAC;AAAA,MACL;AAAA;AAAA,MAEA,OAAO,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAoLjB,OAAO,UAAU;AAAA,MACjB,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MAEP,OAAO;AAEH,YAAI,UAAU,OAAO,MAAM;AACvB,gBAAM,IAAI,MAAM,0CAA0C;AAAA,QAC9D;AACA,kBAAU,IAAI,eAAe,EACxB,KAAK,aAAW;AACjB,cAAI,WAAW,MAAM;AACjB,kBAAM,IAAI,MAAM,oCAAoC;AAAA,UACxD;AACA,kBAAQ,cAAc,EACjB,KAAK,YAAU;AAChB,iBAAK,UAAU;AAEf,iBAAK,aAAa,KAAK,QAAQ,aAAa;AAAA,cACxC,MAAM;AAAA,cACN,OAAO,eAAe,UAAU,eAAe,WAAW,eAAe;AAAA,YAC7E,CAAC;AACD,iBAAK,aAAa,KAAK,QAAQ,aAAa;AAAA,cACxC,MAAM;AAAA,cACN,OAAO,eAAe,WAAW,eAAe;AAAA,YACpD,CAAC;AAED,iBAAK,mBAAmB,KAAK,QAAQ,sBAAsB;AAAA,cACvD,SAAS;AAAA,gBACL;AAAA,kBACI,SAAS;AAAA,kBACT,YAAY,eAAe;AAAA,kBAC3B,QAAQ;AAAA,oBACJ,MAAM;AAAA,kBACV;AAAA,gBACJ;AAAA,gBACA;AAAA,kBACI,SAAS;AAAA,kBACT,YAAY,eAAe;AAAA,kBAC3B,QAAQ;AAAA,oBACJ,MAAM;AAAA,kBACV;AAAA,gBACJ;AAAA,cACJ;AAAA,YACJ,CAAC;AAED,iBAAK,YAAY,KAAK,QAAQ,sBAAsB;AAAA,cAChD,QAAQ,KAAK,QAAQ,qBAAqB;AAAA,gBACtC,kBAAkB,CAAC,KAAK,gBAAgB;AAAA,cAC5C,CAAC;AAAA,cACD,SAAS;AAAA,gBACL,YAAY;AAAA,gBACZ,QAAQ,KAAK,QAAQ,mBAAmB;AAAA,kBACpC,MAAM,KAAK;AAAA,gBACf,CAAC;AAAA,cACL;AAAA,YACJ,CAAC;AAAA,UACL,CAAC;AAAA,QACL,CAAC,EACI,MAAM,SAAO;AAAE,gBAAM,IAAI,MAAM,IAAI,OAAO;AAAA,QAAG,CAAC;AAAA,MACvD;AAAA,MACA,aAAa,WAAW,SAAS,UAAU,WAAW;AAClD,YAAI,CAAC,oBAAoB,KAAK,OAAO;AACjC,gBAAM,IAAI,MAAM,gBAAgB,OAAO,EAAE;AAC7C,YAAI,OAAO,cAAc;AACrB,gBAAM,IAAI,UAAU,qBAAqB,SAAS,EAAE;AAExD,YAAI,QAAO,WAAW,MAAM;AACxB,qBAAW,YAAY;AAAE,kBAAM,KAAK,WAAW,SAAS,UAAU,SAAS;AAAA,UAAG,GAAG,GAAG;AACpF;AAAA,QACJ;AAEA,cAAM,UAAU,IAAI,SAAS,IAAI,YAAY,EAAE,CAAC;AAChD,iBAAS,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;AAC5B,gBAAM,SAAS,QAAQ,MAAM,GAAG,IAAI,CAAC;AACrC,kBAAQ,UAAU,IAAI,GAAG,SAAS,QAAQ,EAAE,CAAC;AAAA,QACjD;AACA,gBAAQ,UAAU,IAAI,WAAW,IAAI;AACrC,cAAM,YAAY,QAAO,QAAQ,aAAa;AAAA,UAC1C,MAAM,QAAQ;AAAA,UACd,OAAO,eAAe,UAAU,eAAe;AAAA,QACnD,CAAC;AACD,gBAAO,QAAQ,MAAM,YAAY,WAAW,GAAG,OAAO;AAEtD,cAAM,YAAY,QAAO,QAAQ,gBAAgB;AAAA,UAC7C,QAAQ,QAAO;AAAA,UACf,SAAS;AAAA,YACL;AAAA,cACI,SAAS;AAAA,cACT,UAAU;AAAA,gBACN,QAAQ;AAAA,cACZ;AAAA,YACJ;AAAA,YACA;AAAA,cACI,SAAS;AAAA,cACT,UAAU;AAAA,gBACN,QAAQ,QAAO;AAAA,cACnB;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ,CAAC;AAED,cAAM,iBAAiB,QAAO,QAAQ,qBAAqB;AAC3D,cAAM,cAAc,eAAe,iBAAiB;AAEpD,oBAAY,YAAY,QAAO,SAAS;AACxC,oBAAY,aAAa,GAAG,SAAS;AACrC,oBAAY,mBAAmB,KAAK,KAAK,GAAG;AAC5C,oBAAY,IAAI;AAEhB,uBAAe,mBAAmB,QAAO,YAAY,GAAG,QAAO,YAAY,GAAG,EAAE;AAEhF,gBAAO,QAAQ,MAAM,OAAO,CAAC,eAAe,OAAO,CAAC,CAAC;AAErD,cAAM,QAAO,WAAW,SAAS,WAAW,IAAI;AAChD,cAAM,QAAO,QAAQ,MAAM,oBAAoB;AAC/C,cAAM,OAAO,IAAI,SAAS,QAAO,WAAW,eAAe,CAAC;AAC5D,cAAM,QAAQ,KAAK,aAAa,GAAG,IAAI;AACvC,cAAM,QAAQ,CAAC,CAAC,KAAK,UAAU,CAAC;AAChC,gBAAQ,IAAI,IAAI,YAAY,KAAK,MAAM,CAAC;AACxC,gBAAO,WAAW,MAAM;AACxB,gBAAQ,IAAI,UAAU,KAAK,EAAE;AAC7B,gBAAQ,IAAI,UAAU,KAAK,EAAE;AAC7B,YAAI,OAAO;AACP,gBAAMC,OAAM,MAAM,SAAS,EAAE,EAAE,SAAS,IAAI,GAAG;AAC/C,iBAAO,aAAa,cAAc,SAASA,IAAG;AAC9C;AAAA,QACJ,OACK;AACD,kBAAQ,KAAK,6CAA6C,KAAK,EAAE;AAAA,QACrE;AAAA,MACJ;AAAA,IACJ;AACA,IAAO,iBAAQ;AAAA,2BACY,eAAe;AAAA,kBACxB,MAAM;AAAA;AAAA;AAAA;;;ACrWxB;AAAA;AAAA;AAEA;AACA;AACA;AACA;AAAA;AAAA;;;ACLA;AAAA;AAAA;AAuBA,QAAI,IAAI,OAAO,YAAY,WAAW,UAAU;AAChD,QAAI,eAAe,KAAK,OAAO,EAAE,UAAU,aACvC,EAAE,QACF,SAASC,cAAa,QAAQ,UAAU,MAAM;AAC9C,aAAO,SAAS,UAAU,MAAM,KAAK,QAAQ,UAAU,IAAI;AAAA,IAC7D;AAEF,QAAI;AACJ,QAAI,KAAK,OAAO,EAAE,YAAY,YAAY;AACxC,uBAAiB,EAAE;AAAA,IACrB,WAAW,OAAO,uBAAuB;AACvC,uBAAiB,SAASC,gBAAe,QAAQ;AAC/C,eAAO,OAAO,oBAAoB,MAAM,EACrC,OAAO,OAAO,sBAAsB,MAAM,CAAC;AAAA,MAChD;AAAA,IACF,OAAO;AACL,uBAAiB,SAASA,gBAAe,QAAQ;AAC/C,eAAO,OAAO,oBAAoB,MAAM;AAAA,MAC1C;AAAA,IACF;AAEA,aAAS,mBAAmB,SAAS;AACnC,UAAI,WAAW,QAAQ,KAAM,SAAQ,KAAK,OAAO;AAAA,IACnD;AAEA,QAAI,cAAc,OAAO,SAAS,SAASC,aAAY,OAAO;AAC5D,aAAO,UAAU;AAAA,IACnB;AAEA,aAASC,gBAAe;AACtB,MAAAA,cAAa,KAAK,KAAK,IAAI;AAAA,IAC7B;AACA,WAAO,UAAUA;AACjB,WAAO,QAAQ,OAAO;AAGtB,IAAAA,cAAa,eAAeA;AAE5B,IAAAA,cAAa,UAAU,UAAU;AACjC,IAAAA,cAAa,UAAU,eAAe;AACtC,IAAAA,cAAa,UAAU,gBAAgB;AAIvC,QAAI,sBAAsB;AAE1B,aAAS,cAAc,UAAU;AAC/B,UAAI,OAAO,aAAa,YAAY;AAClC,cAAM,IAAI,UAAU,qEAAqE,OAAO,QAAQ;AAAA,MAC1G;AAAA,IACF;AAEA,WAAO,eAAeA,eAAc,uBAAuB;AAAA,MACzD,YAAY;AAAA,MACZ,KAAK,WAAW;AACd,eAAO;AAAA,MACT;AAAA,MACA,KAAK,SAAS,KAAK;AACjB,YAAI,OAAO,QAAQ,YAAY,MAAM,KAAK,YAAY,GAAG,GAAG;AAC1D,gBAAM,IAAI,WAAW,oGAAoG,MAAM,GAAG;AAAA,QACpI;AACA,8BAAsB;AAAA,MACxB;AAAA,IACF,CAAC;AAED,IAAAA,cAAa,OAAO,WAAW;AAE7B,UAAI,KAAK,YAAY,UACjB,KAAK,YAAY,OAAO,eAAe,IAAI,EAAE,SAAS;AACxD,aAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,aAAK,eAAe;AAAA,MACtB;AAEA,WAAK,gBAAgB,KAAK,iBAAiB;AAAA,IAC7C;AAIA,IAAAA,cAAa,UAAU,kBAAkB,SAAS,gBAAgB,GAAG;AACnE,UAAI,OAAO,MAAM,YAAY,IAAI,KAAK,YAAY,CAAC,GAAG;AACpD,cAAM,IAAI,WAAW,kFAAkF,IAAI,GAAG;AAAA,MAChH;AACA,WAAK,gBAAgB;AACrB,aAAO;AAAA,IACT;AAEA,aAAS,iBAAiB,MAAM;AAC9B,UAAI,KAAK,kBAAkB;AACzB,eAAOA,cAAa;AACtB,aAAO,KAAK;AAAA,IACd;AAEA,IAAAA,cAAa,UAAU,kBAAkB,SAAS,kBAAkB;AAClE,aAAO,iBAAiB,IAAI;AAAA,IAC9B;AAEA,IAAAA,cAAa,UAAU,OAAO,SAAS,KAAK,MAAM;AAChD,UAAI,OAAO,CAAC;AACZ,eAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAK,MAAK,KAAK,UAAU,CAAC,CAAC;AACjE,UAAI,UAAW,SAAS;AAExB,UAAI,SAAS,KAAK;AAClB,UAAI,WAAW;AACb,kBAAW,WAAW,OAAO,UAAU;AAAA,eAChC,CAAC;AACR,eAAO;AAGT,UAAI,SAAS;AACX,YAAI;AACJ,YAAI,KAAK,SAAS;AAChB,eAAK,KAAK,CAAC;AACb,YAAI,cAAc,OAAO;AAGvB,gBAAM;AAAA,QACR;AAEA,YAAI,MAAM,IAAI,MAAM,sBAAsB,KAAK,OAAO,GAAG,UAAU,MAAM,GAAG;AAC5E,YAAI,UAAU;AACd,cAAM;AAAA,MACR;AAEA,UAAI,UAAU,OAAO,IAAI;AAEzB,UAAI,YAAY;AACd,eAAO;AAET,UAAI,OAAO,YAAY,YAAY;AACjC,qBAAa,SAAS,MAAM,IAAI;AAAA,MAClC,OAAO;AACL,YAAI,MAAM,QAAQ;AAClB,YAAI,YAAY,WAAW,SAAS,GAAG;AACvC,iBAAS,IAAI,GAAG,IAAI,KAAK,EAAE;AACzB,uBAAa,UAAU,CAAC,GAAG,MAAM,IAAI;AAAA,MACzC;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,aAAa,QAAQ,MAAM,UAAU,SAAS;AACrD,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,oBAAc,QAAQ;AAEtB,eAAS,OAAO;AAChB,UAAI,WAAW,QAAW;AACxB,iBAAS,OAAO,UAAU,uBAAO,OAAO,IAAI;AAC5C,eAAO,eAAe;AAAA,MACxB,OAAO;AAGL,YAAI,OAAO,gBAAgB,QAAW;AACpC,iBAAO;AAAA,YAAK;AAAA,YAAe;AAAA,YACf,SAAS,WAAW,SAAS,WAAW;AAAA,UAAQ;AAI5D,mBAAS,OAAO;AAAA,QAClB;AACA,mBAAW,OAAO,IAAI;AAAA,MACxB;AAEA,UAAI,aAAa,QAAW;AAE1B,mBAAW,OAAO,IAAI,IAAI;AAC1B,UAAE,OAAO;AAAA,MACX,OAAO;AACL,YAAI,OAAO,aAAa,YAAY;AAElC,qBAAW,OAAO,IAAI,IACpB,UAAU,CAAC,UAAU,QAAQ,IAAI,CAAC,UAAU,QAAQ;AAAA,QAExD,WAAW,SAAS;AAClB,mBAAS,QAAQ,QAAQ;AAAA,QAC3B,OAAO;AACL,mBAAS,KAAK,QAAQ;AAAA,QACxB;AAGA,YAAI,iBAAiB,MAAM;AAC3B,YAAI,IAAI,KAAK,SAAS,SAAS,KAAK,CAAC,SAAS,QAAQ;AACpD,mBAAS,SAAS;AAGlB,cAAI,IAAI,IAAI,MAAM,iDACE,SAAS,SAAS,MAAM,OAAO,IAAI,IAAI,mEAEvB;AACpC,YAAE,OAAO;AACT,YAAE,UAAU;AACZ,YAAE,OAAO;AACT,YAAE,QAAQ,SAAS;AACnB,6BAAmB,CAAC;AAAA,QACtB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,IAAAA,cAAa,UAAU,cAAc,SAAS,YAAY,MAAM,UAAU;AACxE,aAAO,aAAa,MAAM,MAAM,UAAU,KAAK;AAAA,IACjD;AAEA,IAAAA,cAAa,UAAU,KAAKA,cAAa,UAAU;AAEnD,IAAAA,cAAa,UAAU,kBACnB,SAAS,gBAAgB,MAAM,UAAU;AACvC,aAAO,aAAa,MAAM,MAAM,UAAU,IAAI;AAAA,IAChD;AAEJ,aAAS,cAAc;AACrB,UAAI,CAAC,KAAK,OAAO;AACf,aAAK,OAAO,eAAe,KAAK,MAAM,KAAK,MAAM;AACjD,aAAK,QAAQ;AACb,YAAI,UAAU,WAAW;AACvB,iBAAO,KAAK,SAAS,KAAK,KAAK,MAAM;AACvC,eAAO,KAAK,SAAS,MAAM,KAAK,QAAQ,SAAS;AAAA,MACnD;AAAA,IACF;AAEA,aAAS,UAAU,QAAQ,MAAM,UAAU;AACzC,UAAI,QAAQ,EAAE,OAAO,OAAO,QAAQ,QAAW,QAAgB,MAAY,SAAmB;AAC9F,UAAI,UAAU,YAAY,KAAK,KAAK;AACpC,cAAQ,WAAW;AACnB,YAAM,SAAS;AACf,aAAO;AAAA,IACT;AAEA,IAAAA,cAAa,UAAU,OAAO,SAASC,MAAK,MAAM,UAAU;AAC1D,oBAAc,QAAQ;AACtB,WAAK,GAAG,MAAM,UAAU,MAAM,MAAM,QAAQ,CAAC;AAC7C,aAAO;AAAA,IACT;AAEA,IAAAD,cAAa,UAAU,sBACnB,SAAS,oBAAoB,MAAM,UAAU;AAC3C,oBAAc,QAAQ;AACtB,WAAK,gBAAgB,MAAM,UAAU,MAAM,MAAM,QAAQ,CAAC;AAC1D,aAAO;AAAA,IACT;AAGJ,IAAAA,cAAa,UAAU,iBACnB,SAAS,eAAe,MAAM,UAAU;AACtC,UAAI,MAAM,QAAQ,UAAU,GAAG;AAE/B,oBAAc,QAAQ;AAEtB,eAAS,KAAK;AACd,UAAI,WAAW;AACb,eAAO;AAET,aAAO,OAAO,IAAI;AAClB,UAAI,SAAS;AACX,eAAO;AAET,UAAI,SAAS,YAAY,KAAK,aAAa,UAAU;AACnD,YAAI,EAAE,KAAK,iBAAiB;AAC1B,eAAK,UAAU,uBAAO,OAAO,IAAI;AAAA,aAC9B;AACH,iBAAO,OAAO,IAAI;AAClB,cAAI,OAAO;AACT,iBAAK,KAAK,kBAAkB,MAAM,KAAK,YAAY,QAAQ;AAAA,QAC/D;AAAA,MACF,WAAW,OAAO,SAAS,YAAY;AACrC,mBAAW;AAEX,aAAK,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACrC,cAAI,KAAK,CAAC,MAAM,YAAY,KAAK,CAAC,EAAE,aAAa,UAAU;AACzD,+BAAmB,KAAK,CAAC,EAAE;AAC3B,uBAAW;AACX;AAAA,UACF;AAAA,QACF;AAEA,YAAI,WAAW;AACb,iBAAO;AAET,YAAI,aAAa;AACf,eAAK,MAAM;AAAA,aACR;AACH,oBAAU,MAAM,QAAQ;AAAA,QAC1B;AAEA,YAAI,KAAK,WAAW;AAClB,iBAAO,IAAI,IAAI,KAAK,CAAC;AAEvB,YAAI,OAAO,mBAAmB;AAC5B,eAAK,KAAK,kBAAkB,MAAM,oBAAoB,QAAQ;AAAA,MAClE;AAEA,aAAO;AAAA,IACT;AAEJ,IAAAA,cAAa,UAAU,MAAMA,cAAa,UAAU;AAEpD,IAAAA,cAAa,UAAU,qBACnB,SAAS,mBAAmB,MAAM;AAChC,UAAI,WAAW,QAAQ;AAEvB,eAAS,KAAK;AACd,UAAI,WAAW;AACb,eAAO;AAGT,UAAI,OAAO,mBAAmB,QAAW;AACvC,YAAI,UAAU,WAAW,GAAG;AAC1B,eAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,eAAK,eAAe;AAAA,QACtB,WAAW,OAAO,IAAI,MAAM,QAAW;AACrC,cAAI,EAAE,KAAK,iBAAiB;AAC1B,iBAAK,UAAU,uBAAO,OAAO,IAAI;AAAA;AAEjC,mBAAO,OAAO,IAAI;AAAA,QACtB;AACA,eAAO;AAAA,MACT;AAGA,UAAI,UAAU,WAAW,GAAG;AAC1B,YAAI,OAAO,OAAO,KAAK,MAAM;AAC7B,YAAI;AACJ,aAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAChC,gBAAM,KAAK,CAAC;AACZ,cAAI,QAAQ,iBAAkB;AAC9B,eAAK,mBAAmB,GAAG;AAAA,QAC7B;AACA,aAAK,mBAAmB,gBAAgB;AACxC,aAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,aAAK,eAAe;AACpB,eAAO;AAAA,MACT;AAEA,kBAAY,OAAO,IAAI;AAEvB,UAAI,OAAO,cAAc,YAAY;AACnC,aAAK,eAAe,MAAM,SAAS;AAAA,MACrC,WAAW,cAAc,QAAW;AAElC,aAAK,IAAI,UAAU,SAAS,GAAG,KAAK,GAAG,KAAK;AAC1C,eAAK,eAAe,MAAM,UAAU,CAAC,CAAC;AAAA,QACxC;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEJ,aAAS,WAAW,QAAQ,MAAM,QAAQ;AACxC,UAAI,SAAS,OAAO;AAEpB,UAAI,WAAW;AACb,eAAO,CAAC;AAEV,UAAI,aAAa,OAAO,IAAI;AAC5B,UAAI,eAAe;AACjB,eAAO,CAAC;AAEV,UAAI,OAAO,eAAe;AACxB,eAAO,SAAS,CAAC,WAAW,YAAY,UAAU,IAAI,CAAC,UAAU;AAEnE,aAAO,SACL,gBAAgB,UAAU,IAAI,WAAW,YAAY,WAAW,MAAM;AAAA,IAC1E;AAEA,IAAAA,cAAa,UAAU,YAAY,SAAS,UAAU,MAAM;AAC1D,aAAO,WAAW,MAAM,MAAM,IAAI;AAAA,IACpC;AAEA,IAAAA,cAAa,UAAU,eAAe,SAAS,aAAa,MAAM;AAChE,aAAO,WAAW,MAAM,MAAM,KAAK;AAAA,IACrC;AAEA,IAAAA,cAAa,gBAAgB,SAAS,SAAS,MAAM;AACnD,UAAI,OAAO,QAAQ,kBAAkB,YAAY;AAC/C,eAAO,QAAQ,cAAc,IAAI;AAAA,MACnC,OAAO;AACL,eAAO,cAAc,KAAK,SAAS,IAAI;AAAA,MACzC;AAAA,IACF;AAEA,IAAAA,cAAa,UAAU,gBAAgB;AACvC,aAAS,cAAc,MAAM;AAC3B,UAAI,SAAS,KAAK;AAElB,UAAI,WAAW,QAAW;AACxB,YAAI,aAAa,OAAO,IAAI;AAE5B,YAAI,OAAO,eAAe,YAAY;AACpC,iBAAO;AAAA,QACT,WAAW,eAAe,QAAW;AACnC,iBAAO,WAAW;AAAA,QACpB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,IAAAA,cAAa,UAAU,aAAa,SAAS,aAAa;AACxD,aAAO,KAAK,eAAe,IAAI,eAAe,KAAK,OAAO,IAAI,CAAC;AAAA,IACjE;AAEA,aAAS,WAAW,KAAK,GAAG;AAC1B,UAAI,OAAO,IAAI,MAAM,CAAC;AACtB,eAAS,IAAI,GAAG,IAAI,GAAG,EAAE;AACvB,aAAK,CAAC,IAAI,IAAI,CAAC;AACjB,aAAO;AAAA,IACT;AAEA,aAAS,UAAU,MAAM,OAAO;AAC9B,aAAO,QAAQ,IAAI,KAAK,QAAQ;AAC9B,aAAK,KAAK,IAAI,KAAK,QAAQ,CAAC;AAC9B,WAAK,IAAI;AAAA,IACX;AAEA,aAAS,gBAAgB,KAAK;AAC5B,UAAI,MAAM,IAAI,MAAM,IAAI,MAAM;AAC9B,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACnC,YAAI,CAAC,IAAI,IAAI,CAAC,EAAE,YAAY,IAAI,CAAC;AAAA,MACnC;AACA,aAAO;AAAA,IACT;AAEA,aAAS,KAAK,SAAS,MAAM;AAC3B,aAAO,IAAI,QAAQ,SAAU,SAAS,QAAQ;AAC5C,iBAAS,cAAc,KAAK;AAC1B,kBAAQ,eAAe,MAAM,QAAQ;AACrC,iBAAO,GAAG;AAAA,QACZ;AAEA,iBAAS,WAAW;AAClB,cAAI,OAAO,QAAQ,mBAAmB,YAAY;AAChD,oBAAQ,eAAe,SAAS,aAAa;AAAA,UAC/C;AACA,kBAAQ,CAAC,EAAE,MAAM,KAAK,SAAS,CAAC;AAAA,QAClC;AAAC;AAED,uCAA+B,SAAS,MAAM,UAAU,EAAE,MAAM,KAAK,CAAC;AACtE,YAAI,SAAS,SAAS;AACpB,wCAA8B,SAAS,eAAe,EAAE,MAAM,KAAK,CAAC;AAAA,QACtE;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,8BAA8B,SAAS,SAAS,OAAO;AAC9D,UAAI,OAAO,QAAQ,OAAO,YAAY;AACpC,uCAA+B,SAAS,SAAS,SAAS,KAAK;AAAA,MACjE;AAAA,IACF;AAEA,aAAS,+BAA+B,SAAS,MAAM,UAAU,OAAO;AACtE,UAAI,OAAO,QAAQ,OAAO,YAAY;AACpC,YAAI,MAAM,MAAM;AACd,kBAAQ,KAAK,MAAM,QAAQ;AAAA,QAC7B,OAAO;AACL,kBAAQ,GAAG,MAAM,QAAQ;AAAA,QAC3B;AAAA,MACF,WAAW,OAAO,QAAQ,qBAAqB,YAAY;AAGzD,gBAAQ,iBAAiB,MAAM,SAAS,aAAa,KAAK;AAGxD,cAAI,MAAM,MAAM;AACd,oBAAQ,oBAAoB,MAAM,YAAY;AAAA,UAChD;AACA,mBAAS,GAAG;AAAA,QACd,CAAC;AAAA,MACH,OAAO;AACL,cAAM,IAAI,UAAU,wEAAwE,OAAO,OAAO;AAAA,MAC5G;AAAA,IACF;AAAA;AAAA;;;ACtbA,SAAS,SAAS,OAAK;AACrB,SAAO,OAAO,UAAU;AAC1B;AA5DA,IAKM,cACA,eAEO,4BAWA;AAnBb;;AAKA,IAAM,eAAe,CAAA;AACrB,IAAM,gBAAgB,CAAA;AAEf,IAAM,6BAA6B,CAAC,MAAc,iBAAyC;AAChG,oBAAc,IAAI,IAAI;IACxB;AASO,IAAM,yBAAyB,CAIpC,SACK;MACL,MAAM,yBAAyB,MAAK;QAElC,YAAY,SAAkB,QAAY,SAAa;AAGrD,gBAAM,WAAW,MAAM,OAAO;AAE9B,iBAAO,eAAe,MAAM,iBAAiB,SAAS;AACtD,eAAK,OAAO;AACZ,cAAI,QAAQ;AACV,uBAAW,KAAK,QAAQ;AAGtB,mBAAK,CAAC,IAAI,OAAO,CAAC;YACpB;UACF;AACA,cAAI,WAAW,SAAS,OAAO,KAAK,WAAW,WAAW,EAAE,WAAW,OAAO;AAG5E,kBAAM,QAAQ,QAAQ;AACtB,iBAAK,QAAQ;AACb,gBAAI,WAAW,OAAO;AACpB,mBAAK,QAAQ,KAAK,QAAQ,cAAc,MAAM;YAChD;UACF;QACF;;AAGF,mBAAa,IAAI,IAAI;AAErB,aAAO;IACT;;;;;AC2PM,SAAU,oBAAoB,MAAY;AAC9C,UAAQ,MAAM;;IAEZ,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;IACT,KAAK;AACH,aAAO;EACX;AACA,MAAI,SAAU,QAAQ,QAAQ,OAAQ;AACpC,WAAO;EACT;AACF;AAxUA,IAUa,0BACA,qBACA,sCAGA,gBACA,mBACA,iBACA,gBACA,sBACA,yBACA,sBAIA,6BACA,+BAGA,uBACA,2BACA,6BACA,qBACA,cACA,mBACA,kBACA,0BACA,oBACA,yBACA,oBACA,mCAGA,mCAGA,mCAGA,oBACA,gCAGA,qBACA,uBACA,eACA,eACA,gBACA,cACA,8CAGA,yBACA,YACA,gBACA,2BACA,uBACA,iCACA,0BACA,8BACA,gCAGA,0BACA,oCAGA,4BACA,wBACA,aACA,cACA,kBACA,kBACA,sBACA,4BACA,iCAGA,2BACA,8CAGA,kBACA,cAEA,kBACA,kBACA,2BACA,2BACA,qBACA,mBACA,oBACA,6BACA,cACA,yBACA,wBACA,6BACA,uBACA,eACA,sBACA,0BACA,mBACA,0CAGA,uCAGA,qBACA,qBACA,oBACA,eACA,6BACA,oBACA,2BACA,yBACA,qBACA,WACA,oBACA,4BACA,gCAGA,wBACA,gCAGA,kCAGA,+BAGA,uBACA,0BACA,2BACA,uBACA,6BACA,6BACA,qBAEA,kBACA,gBACA,cACA,kBACA,aACA,YACA,kBACA,WACA,eACA,oBACA,oBAMA,cAIA,cAIA,6BAGA,mCAKA,uBACA,WAGA,kBAGA,eACA,iBACA,YAEA,qBACA,mCAUD,sBA+BC,gBAcA,aAoFA,sBAmCA;AAjXb;;;AAUO,IAAM,2BAA2B,uBAAuB,qBAAqB;AAC7E,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,uCAAuC,uBAClD,sCAAsC;AAEjC,IAAM,iBAAiB,uBAAuB,gBAAgB;AAC9D,IAAM,oBAAoB,uBAAuB,mBAAmB;AACpE,IAAM,kBAAkB,uBAAuB,iBAAiB;AAChE,IAAM,iBAAiB,uBAAuB,gBAAgB;AAC9D,IAAM,uBAAuB,uBAAuB,sBAAsB;AAC1E,IAAM,0BAA0B,uBAAuB,yBAAyB;AAChF,IAAM,uBAAuB,uBAGlC,sBAAsB;AACjB,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,gCAAgC,uBAC3C,+BAA+B;AAE1B,IAAM,wBAAwB,uBAAuB,kBAAkB;AACvE,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,eAAe,uBAAuB,cAAc;AAC1D,IAAM,oBAAoB,uBAAuB,mBAAmB;AACpE,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,2BAA2B,uBAAuB,0BAA0B;AAClF,IAAM,qBAAqB,uBAAuB,0BAA0B;AAC5E,IAAM,0BAA0B,uBAAuB,yBAAyB;AAChF,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,oCAAoC,uBAC/C,mCAAmC;AAE9B,IAAM,oCAAoC,uBAC/C,mCAAmC;AAE9B,IAAM,oCAAoC,uBAC/C,mCAAmC;AAE9B,IAAM,qBAAqB,uBAAuB,eAAe;AACjE,IAAM,iCAAiC,uBAC5C,gCAAgC;AAE3B,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,wBAAwB,uBAAuB,uBAAuB;AAC5E,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,iBAAiB,uBAAuB,gBAAgB;AAC9D,IAAM,eAAe,uBAAuB,cAAc;AAC1D,IAAM,+CAA+C,uBAC1D,8CAA8C;AAEzC,IAAM,0BAA0B,uBAAuB,yBAAyB;AAChF,IAAM,aAAa,uBAAuB,YAAY;AACtD,IAAM,iBAAiB,uBAAuB,gBAAgB;AAC9D,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,wBAAwB,uBAAuB,uBAAuB;AAC5E,IAAM,kCAAkC,uBAAuB,4BAA4B;AAC3F,IAAM,2BAA2B,uBAAuB,qBAAqB;AAC7E,IAAM,+BAA+B,uBAAuB,8BAA8B;AAC1F,IAAM,iCAAiC,uBAC5C,gCAAgC;AAE3B,IAAM,2BAA2B,uBAAuB,qBAAqB;AAC7E,IAAM,qCAAqC,uBAChD,+BAA+B;AAE1B,IAAM,6BAA6B,uBAAuB,uBAAuB;AACjF,IAAM,yBAAyB,uBAAuB,wBAAwB;AAC9E,IAAM,cAAc,uBAAuB,aAAa;AACxD,IAAM,eAAe,uBAAuB,cAAc;AAC1D,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,uBAAuB,uBAAuB,sBAAsB;AAC1E,IAAM,6BAA6B,uBAAuB,4BAA4B;AACtF,IAAM,kCAAkC,uBAC7C,iCAAiC;AAE5B,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,+CAA+C,uBAC1D,8CAA8C;AAEzC,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,eAAe,uBAAuB,cAAc;AAE1D,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,oBAAoB,uBAAuB,mBAAmB;AACpE,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,eAAe,uBAAuB,cAAc;AAC1D,IAAM,0BAA0B,uBAAuB,oBAAoB;AAC3E,IAAM,yBAAyB,uBAAuB,mBAAmB;AACzE,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,wBAAwB,uBAAuB,uBAAuB;AAC5E,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,uBAAuB,uBAAuB,sBAAsB;AAC1E,IAAM,2BAA2B,uBAAuB,0BAA0B;AAClF,IAAM,oBAAoB,uBAAuB,mBAAmB;AACpE,IAAM,2CAA2C,uBACtD,0CAA0C;AAErC,IAAM,wCAAwC,uBACnD,uCAAuC;AAElC,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,0BAA0B,uBAAuB,yBAAyB;AAChF,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,YAAY,uBAAuB,WAAW;AACpD,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,6BAA6B,uBAAuB,4BAA4B;AACtF,IAAM,iCAAiC,uBAC5C,gCAAgC;AAE3B,IAAM,yBAAyB,uBAAuB,wBAAwB;AAC9E,IAAM,iCAAiC,uBAC5C,gCAAgC;AAE3B,IAAM,mCAAmC,uBAC9C,kCAAkC;AAE7B,IAAM,gCAAgC,uBAC3C,+BAA+B;AAE1B,IAAM,wBAAwB,uBAAuB,uBAAuB;AAC5E,IAAM,2BAA2B,uBAAuB,0BAA0B;AAClF,IAAM,4BAA4B,uBAAuB,2BAA2B;AACpF,IAAM,wBAAwB,uBAAuB,uBAAuB;AAC5E,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,8BAA8B,uBAAuB,6BAA6B;AACxF,IAAM,sBAAsB,uBAAuB,qBAAqB;AAExE,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,iBAAiB,uBAAuB,gBAAgB;AAC9D,IAAM,eAAe,uBAAuB,cAAc;AAC1D,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,cAAc,uBAAuB,aAAa;AACxD,IAAM,aAAa,uBAAuB,YAAY;AACtD,IAAM,mBAAmB,uBAAuB,kBAAkB;AAClE,IAAM,YAAY,uBAAuB,WAAW;AACpD,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,qBAAqB,uBAAuB,oBAAoB;AACtE,IAAM,qBAAqB,uBAAuB,oBAAoB;AAMtE,IAAM,eAAe,uBAG1B,cAAc;AACT,IAAM,eAAe,uBAG1B,cAAc;AACT,IAAM,8BAA8B,uBAAuB,6BAA6B;AAGxF,IAAM,oCAAoC,uBAC/C,mCAAmC;AAI9B,IAAM,wBAAwB,uBAAuB,mBAAmB;AACxE,IAAM,YAAY,uBAAuB,WAAW;AAGpD,IAAM,mBAAmB,uBAAuB,kBAAkB;AAGlE,IAAM,gBAAgB,uBAAuB,eAAe;AAC5D,IAAM,kBAAkB,uBAAuB,iBAAiB;AAChE,IAAM,aAAa,uBAAuB,YAAY;AAEtD,IAAM,sBAAsB,uBAAuB,qBAAqB;AACxE,IAAM,oCAAoC,uBAC/C,mCAAmC;AASrC,KAAA,SAAYE,uBAAoB;AAC9B,MAAAA,sBAAA,SAAA,IAAA;AACA,MAAAA,sBAAA,0BAAA,IAAA;AACA,MAAAA,sBAAA,8BAAA,IAAA;AACA,MAAAA,sBAAA,0BAAA,IAAA;IACF,GALY,yBAAA,uBAAoB,CAAA,EAAA;AA+B1B,IAAO,iBAAP,cAA8B,MAAK;MAEvC,YAAY,SAAiBC,KAAU;AACrC,cAAM,OAAO;AACb,cAAM,WAAW,IAAI;AACrB,aAAK,OAAO;AACZ,aAAK,UAAU;AACf,aAAK,QAAQ,IAAI,MAAM,OAAO,EAAE;AAChC,aAAK,KAAKA;MACZ;;AAGF,+BAA2B,kBAAkB,OAAK,IAAI,eAAe,EAAE,SAAS,EAAE,EAAE,CAAC;AAE9E,IAAM,cAAc;MACzB,gCAAgC;MAChC,yBAAyB;MACzB,mBAAmB;MACnB,cAAc;MACd,sBAAsB;MACtB,qCAAqC;MACrC,iCAAiC;MACjC,4BAA4B;MAC5B,kCAAkC;MAClC,yBAAyB;MACzB,oBAAoB;MACpB,qBAAqB;MACrB,gBAAgB;MAChB,gBAAgB;MAChB,QAAQ;MACR,mBAAmB;MACnB,gBAAgB;MAChB,kBAAkB;MAClB,iBAAiB;MACjB,mBAAmB;MACnB,sBAAsB;MACtB,wBAAwB;MACxB,aAAa;MACb,gBAAgB;MAChB,WAAW;MACX,eAAe;MACf,mBAAmB;MACnB,gBAAgB;MAChB,4BAA4B;MAC5B,gBAAgB;MAChB,yBAAyB;MACzB,IAAI;MACJ,wBAAwB;MACxB,2BAA2B;MAC3B,+BAA+B;MAC/B,mBAAmB;MACnB,cAAc;MACd,wBAAwB;MACxB,kBAAkB;MAClB,kCAAkC;MAClC,yBAAyB;MACzB,oBAAoB;MACpB,kCAAkC;MAClC,kCAAkC;MAClC,4BAA4B;MAC5B,sBAAsB;MACtB,aAAa;MACb,uBAAuB;MACvB,uBAAuB;MACvB,sBAAsB;MACtB,uBAAuB;;MAGvB,uBAAuB;;AA8BnB,IAAO,uBAAP,MAAO,8BAA6B,MAAK;;;;;;;MAU7C,YACE,YACA,EAAE,0BAA0B,KAAI,IAA4C,CAAA,GAAE;AAE9E,cAAM,aACJ,OAAO,KAAK,WAAW,EAAE,KAAK,OAAK,YAAY,CAAC,MAAM,UAAU,KAAK;AACvE,cAAM,OAAO,oBAAoB,UAAU,KAAK;AAChD,cAAM,gBAAgB,WAAW,SAAS,EAAE;AAC5C,cAAM,UAAU,kBAAkB,IAAI,OAAO,aAAa;AAE1D,cAAM,OAAO;AACb,aAAK,OAAO;AAEZ,aAAK,aAAa;AAClB,aAAK,aAAa;AAElB,eAAO,eAAe,MAAM,sBAAqB,SAAS;AAG1D,YAAI,2BAA2B,eAAe,YAAY,eAAe;AACvE,iBAAO,IAAI,kBAAkB,OAAO;QACtC;MACF;;AAGI,IAAO,oBAAP,MAAO,2BAA0B,qBAAoB;MACzD,YAAY,SAAgB;AAC1B,cAAM,YAAY,eAAe,EAAE,yBAAyB,MAAK,CAAE;AACnE,YAAI,SAAS;AACX,eAAK,UAAU;QACjB;AACA,aAAK,OAAO;AACZ,eAAO,eAAe,MAAM,mBAAkB,SAAS;MACzD;;AAMF,+BAA2B,wBAAwB,OAAK,IAAI,qBAAqB,EAAE,UAAU,CAAC;;;;;ACxM9F,SAAS,SAASC,MAAQ;AACxB,WAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,QAAI;AACF,kBAAY,CAAC,EAAEA,IAAG;aACX,GAAG;AACV,cAAQ,MAAM,CAAC;;;AAGrB;AA7JA,IAAI,IACE,aAQO,KAmBA,OAiCA,aA2EA;AAxIb,IAAAC,eAAA;;IAAI,KAAK;AACT,IAAM,cAA4B,CAAA;AAQ3B,IAAM,MAAM,CAAC,MAAe,SAAkB,SAAkB;AACrE,YAAM,MAAW;QACf;QACA,IAAI,OAAO,EAAE,EAAE;QACf,MAAM,oBAAI,KAAI;;AAEhB,UAAI;AAAS,YAAI,UAAU;AAC3B,UAAI;AAAM,YAAI,OAAO;AACrB,eAAS,GAAG;IACd;AAUO,IAAM,QAAQ,CAAC,EACpB,MACA,SACA,MACA,SAAAC,SAAO,MAMJ;AACH,YAAM,MAAW;QACf;QACA,IAAI,OAAO,EAAE,EAAE;QACf,MAAM,oBAAI,KAAI;;AAGhB,UAAI;AAAS,YAAI,UAAU;AAC3B,UAAI;AAAM,YAAI,OAAO;AACrB,UAAIA;AAAS,YAAI,UAAUA;AAE3B,eAAS,GAAG;IACd;AAWM,IAAO,cAAP,MAAO,aAAW;MACtB,YACU,MACAA,UAAsB;AADtB,aAAA,OAAA;AACA,aAAA,UAAAA;MACP;MAEH,MAAM,SAAiB,MAAmB;AACxC,cAAM;UACJ,MAAM,KAAK;UACX;UACA;UACA,SAAS,KAAK;SACf;MACH;MAEA,aAAU;AACR,eAAO,KAAK;MACd;MAEA,WAAWA,UAAsB;AAC/B,aAAK,UAAUA;MACjB;MAEA,cAAc,cAA0B;AACtC,aAAK,UAAO,OAAA,OAAA,OAAA,OAAA,CAAA,GAAQ,KAAK,OAAO,GAAK,YAAY;MACnD;MAEA,UAAO;AACL,eAAO,KAAK;MACd;MAEA,QAAQ,MAAa;AACnB,aAAK,OAAO;MACd;;;;;;;MAQA,SAAS,MAAa;AACpB,eAAO,IAAI,aAAY,MAAM,KAAK,OAAO;MAC3C;;;;;;;;;MAUA,YAAYA,UAAsB;AAChC,eAAO,IAAI,aAAY,KAAK,MAAMA,QAAO;MAC3C;;;;;;;;MASA,mBAAmB,cAA0B;AAC3C,eAAO,IAAI,aAAY,KAAK,MAAI,OAAA,OAAA,OAAA,OAAA,CAAA,GAAO,KAAK,OAAO,GAAK,YAAY,CAAA;MACtE;;AASK,IAAM,SAAS,CAAC,OAA+B;AACpD,kBAAY,KAAK,EAAE;AACnB,aAAO,MAAK;AACV,cAAM,IAAI,YAAY,QAAQ,EAAE;AAEhC,YAAI,MAAM,IAAI;AAEZ,sBAAY,CAAC,IAAI,YAAY,YAAY,SAAS,CAAC;AACnD,sBAAY,IAAG;;MAEnB;IACF;AAoBA,QAAI,OAAO,WAAW,aAAa;AACjC,aAAO,qBAAqB;;;;;;IC1M9B,0BAYM,kBAyCe;;;AArDrB,oBAAyB;AAEzB;AAOA,IAAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAGA,IAAM,mBAAmB;AAyCzB,IAAqB,YAArB,MAA8B;MAM5B,YAAY,EAAE,SAAAC,UAAS,QAAO,IAAoD,CAAA,GAAE;AALpF,aAAA,kBAAkB;AAClB,aAAA,sBAAsB;AACtB,aAAA,cAA8C;AAoI9C,aAAA,UAAU,IAAI,cAAAC,QAAY;AA6D1B,aAAA,OAAO,CAAA,OAAA,OAAA,MAAA,SAAA,WAQc,UAAA,MAAA,CAAA,OAAA,OAAA,MAAA,MAAA,GAAA,MAAA,GAAA,QAAA,WAPnB,KACA,KACA,IACA,IACA,OAAe,OAAO,MAAM,CAAC,GAC7B,aAA4B,CAAC,YAAY,EAAE,GAC3C,EAAE,eAAc,IAAkC,CAAA,GAAE;AAEpD,gBAAM,SAAS,KAAK,OAAO,mBAAmB,EAAE,UAAU,OAAM,CAAE;AAElE,cAAI,KAAK,UAAU,KAAK;AACtB,mBAAO,MAAM,wCAAwC,EAAE,YAAY,KAAK,OAAM,CAAE;AAChF,kBAAM,IAAI,eACR,8CAA8C,KAAK,QACnD,kBAAkB;UAEtB;AAEA,iBAAO,MAAM,wBAAwB,EAAE,eAAc,CAAE;AACvD,gBAAM,WAAW,MAAM,KAAK;;YAE1B,OAAO,OAAO,CAAC,OAAO,KAAK,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC,GAAG,OAAO,KAAK,CAAC,KAAK,MAAM,CAAC,GAAG,IAAI,CAAC;YACjF,EAAE,eAAc;UAAE;AAEpB,iBAAO,MAAM,iCAAiC;AAC9C,gBAAM,KAAK,SAAS,aAAa,SAAS,SAAS,CAAC;AAEpD,cAAI,CAAC,WAAW,KAAK,OAAK,MAAM,EAAE,GAAG;AACnC,kBAAM,IAAI,qBAAqB,EAAE;UACnC;AAEA,iBAAO;QACT,CAAC;AAyGD,aAAA,cAA6B;AAvU3B,aAAK,SAAS,IAAI,YAAY,YAAO,QAAP,YAAO,SAAP,UAAW,kBAAkBD,QAAO;MACpE;;;;;;;;;;MA+DA,SACE,OACA,EAAE,gBAAgB,gBAAe,IAAkC,CAAA,GAAE;AAErE,cAAM,IAAI,MAAM,0BAA0B;MAC5C;;;;;;;;MASA,aAAa,OAAiB,UAA0B;AACtD,YAAI,eAAe;AACnB,cAAM,cAAc,MAAK;AACvB,yBAAe;QACjB;AAEA,cAAM,OAAO,MAAW,UAAA,MAAA,QAAA,QAAA,aAAA;AACtB,cAAI;AAAc;AAClB,qBAAW,QAAQ,OAAO;AACxB,kBAAM,IAAI,MAAM,KAAK,SAAS,IAAI;AAClC,gBAAI;AAAc;AAClB,kBAAM,SAAS,EAAE,aAAa,EAAE,SAAS,CAAC;AAC1C,gBAAI,WAAW,YAAY,IAAI;AAC7B,oBAAM,IAAI,qBAAqB,MAAM;YACvC;AACA,qBAAS,KAAK,CAAC;UACjB;QACF,CAAC;AAED,aAAI,EAAG,KACL,MAAM,CAAC,gBAAgB,SAAS,SAAQ,GACxC,OAAK,CAAC,gBAAgB,SAAS,MAAM,CAAC,CAAC;AAGzC,eAAO,EAAE,YAAW;MACtB;;;;;;;;;MAUA,eAAe,MAAY;MAAG;;;;;;;;;;MAW9B,QAAK;AACH,eAAO,QAAQ,QAAO;MACxB;;;;;;;;MAWA,GAAG,WAAmB,IAAgC;AACpD,aAAK,QAAQ,GAAG,WAAW,EAAE;MAC/B;;;;MAKA,IAAI,WAAmB,IAAgC;AACrD,aAAK,QAAQ,eAAe,WAAW,EAAE;MAC3C;MAEA,KAAK,UAAkB,MAAS;AAC9B,aAAK,QAAQ,KAAK,OAAO,GAAG,IAAI;MAClC;;;;MAKA,eAAY;AACV,gBAAQ,KACN,8FAA8F;MAElG;;;;MAKA,mBAAmB,iBAAuB;AACxC,aAAK,kBAAkB;MACzB;;;;MAKA,+BAA+B,qBAA2B;AACxD,aAAK,sBAAsB;MAC7B;;;;;;;;MA0DA,OAAO,OAAO,cAAc,KAAM,eAAsB;AACtD,eAAO,IAAI,QAAQ,CAAC,SAAS,WAAU;AACrC,cAAI,QAAQ;AACZ,gBAAM,MAAM,KAAK,OAAO;YACtB,MAAM,OAAI;AACR,sBAAQ;AACR,kBAAI;AAAK,oBAAI,YAAW;AACxB,kBAAI;AAAiB,6BAAa,eAAe;AACjD,mBAAK,KAAK,EAAE,YAAY,WAAW,EAAE,KAAK,SAAS,MAAM;YAC3D;YACA,OAAO,OAAI;AACT,kBAAI;AAAiB,6BAAa,eAAe;AACjD,qBAAO,CAAC;YACV;YACA,UAAU,MAAK;AACb,kBAAI;AAAiB,6BAAa,eAAe;AAEjD,kBAAI,CAAC,OAAO;AACV,uBAAO,IAAI,eAAe,KAAK,4BAA4B,eAAe,CAAC;cAC7E;YACF;WACD;AACD,gBAAM,kBAAkB,gBACpB,WAAW,MAAK;AACd,gBAAI,YAAW;AACf,mBAAO,IAAI,eAAe,KAAK,4BAA4B,eAAe,CAAC;UAC7E,GAAG,aAAa,IAChB;QACN,CAAC;MACH;;;;;;;;;MAaM,mBAA2B,GAAwB;;AACvD,gBAAM,SAAS,KAAK,OAAO,mBAAmB;YAC5C,UAAU;YACV,qBAAqB,KAAK;WAC3B;AAED,cAAI,KAAK,qBAAqB;AAC5B,mBAAO,MAAM,iCAAiC;AAC9C,kBAAM,IAAI,uBACR,+EAA+E;UAEnF;AAGA,cAAI;AACJ,gBAAM,cAA6B,IAAI,QAAQ,OAAI;AACjD,0BAAc;UAChB,CAAC;AACD,eAAK,sBAAsB;AAG3B,cAAI,sBAAsB;AAC1B,gBAAM,UAAU,WAAW,MAAK;AAC9B,mBAAO,MAAM,4DAA4D;cACvE,qBAAqB,KAAK;aAC3B;AACD,kCAAsB;AACtB,iBAAK,KAAK,cAAc;UAC1B,GAAG,KAAK,mBAAmB;AAE3B,cAAI;AACF,kBAAM,MAAM,MAAM,EAAC;AAEnB,gBAAI,qBAAqB;AACvB,qBAAO,MAAM,8CAA8C;AAC3D,mBAAK,KAAK,YAAY;YACxB;AAEA,mBAAO;UACT;AACE,mBAAO,MAAM,+BAA+B;AAE5C,yBAAa,OAAO;AACpB,gBAAI;AAAa,0BAAW;AAC5B,iBAAK,sBAAsB;UAC7B;QACF,CAAC;;MAED,sBAAsB,MAA2B,SAAwB,aAAmB;AAC1F,mBAAW,cAAc,SAAS;AAChC,eAAK,UAAU,IAAI,KAAK,qBAAqB,YAAY,KAAK,UAAU,GAAG,MAAM,WAAW;QAC9F;MACF;MAIA,qBACE,YACA,GACA,KACA,aAAmB;AAEnB,eAAO,IAAU,SAAQ,UAAA,MAAA,QAAA,QAAA,aAAA;AACvB,gBAAM,EAAE,YAAW,IAAK;AAExB,cAAI,aAAa;AACf,mBAAO,QAAQ,OACb,IAAI,eAAe,iCAAiC,cAAc,KAAK,iBAAiB,CAAC;UAE7F;AAEA,cAAI;AACF,iBAAK,cAAc;AACnB,iBAAK,eAAe,WAAW;AAC/B,mBAAO,MAAM,EAAE,MAAM,KAAK,IAAI;UAChC;AACE,iBAAK,cAAc;UACrB;QACF,CAAC;MACH;;;;;;;;;MAUA,gBAAgBA,UAAsB;AACpC,aAAK,SAAS,KAAK,OAAO,YAAYA,QAAO;MAC/C;;;;;;;;MASA,mBAAmB,cAA0B;AAC3C,aAAK,OAAO,cAAc,YAAY;MACxC;;;;MAKA,kBAAe;AACb,eAAO,KAAK,OAAO,WAAU;MAC/B;;AAEO,cAAA,6BAA6B;AAC7B,cAAA,6BAA6B;wBAxYjB;;;;;ACrDrB;AAAA;AAEA,QAAM,sBAAsB;AAE5B,QAAM,aAAa;AACnB,QAAM,mBAAmB,OAAO;AAAA,IACL;AAG3B,QAAM,4BAA4B;AAIlC,QAAM,wBAAwB,aAAa;AAE3C,QAAM,gBAAgB;AAAA,MACpB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,yBAAyB;AAAA,MACzB,YAAY;AAAA,IACd;AAAA;AAAA;;;AClCA;AAAA;AAAA,QAAM,QACJ,OAAO,YAAY,YACnB,QAAQ,OACR,QAAQ,IAAI,cACZ,cAAc,KAAK,QAAQ,IAAI,UAAU,IACvC,IAAI,SAAS,QAAQ,MAAM,UAAU,GAAG,IAAI,IAC5C,MAAM;AAAA,IAAC;AAEX,WAAO,UAAU;AAAA;AAAA;;;ACRjB;AAAA;AAAA,QAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI;AACJ,QAAM,QAAQ;AACd,cAAU,OAAO,UAAU,CAAC;AAG5B,QAAM,KAAK,QAAQ,KAAK,CAAC;AACzB,QAAM,SAAS,QAAQ,SAAS,CAAC;AACjC,QAAM,MAAM,QAAQ,MAAM,CAAC;AAC3B,QAAM,IAAI,QAAQ,IAAI,CAAC;AACvB,QAAI,IAAI;AAER,QAAM,mBAAmB;AAQzB,QAAM,wBAAwB;AAAA,MAC5B,CAAC,OAAO,CAAC;AAAA,MACT,CAAC,OAAO,UAAU;AAAA,MAClB,CAAC,kBAAkB,qBAAqB;AAAA,IAC1C;AAEA,QAAM,gBAAgB,CAAC,UAAU;AAC/B,iBAAW,CAAC,OAAO,GAAG,KAAK,uBAAuB;AAChD,gBAAQ,MACL,MAAM,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,MAAM,GAAG,GAAG,EAC5C,MAAM,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,MAAM,GAAG,GAAG;AAAA,MACjD;AACA,aAAO;AAAA,IACT;AAEA,QAAM,cAAc,CAAC,MAAM,OAAO,aAAa;AAC7C,YAAM,OAAO,cAAc,KAAK;AAChC,YAAM,QAAQ;AACd,YAAM,MAAM,OAAO,KAAK;AACxB,QAAE,IAAI,IAAI;AACV,UAAI,KAAK,IAAI;AACb,SAAG,KAAK,IAAI,IAAI,OAAO,OAAO,WAAW,MAAM,MAAS;AACxD,aAAO,KAAK,IAAI,IAAI,OAAO,MAAM,WAAW,MAAM,MAAS;AAAA,IAC7D;AAQA,gBAAY,qBAAqB,aAAa;AAC9C,gBAAY,0BAA0B,MAAM;AAM5C,gBAAY,wBAAwB,gBAAgB,gBAAgB,GAAG;AAKvE,gBAAY,eAAe,IAAI,IAAI,EAAE,iBAAiB,CAAC,QAChC,IAAI,EAAE,iBAAiB,CAAC,QACxB,IAAI,EAAE,iBAAiB,CAAC,GAAG;AAElD,gBAAY,oBAAoB,IAAI,IAAI,EAAE,sBAAsB,CAAC,QACrC,IAAI,EAAE,sBAAsB,CAAC,QAC7B,IAAI,EAAE,sBAAsB,CAAC,GAAG;AAK5D,gBAAY,wBAAwB,MAAM,IAAI,EAAE,iBAAiB,CACjE,IAAI,IAAI,EAAE,oBAAoB,CAAC,GAAG;AAElC,gBAAY,6BAA6B,MAAM,IAAI,EAAE,sBAAsB,CAC3E,IAAI,IAAI,EAAE,oBAAoB,CAAC,GAAG;AAMlC,gBAAY,cAAc,QAAQ,IAAI,EAAE,oBAAoB,CAC5D,SAAS,IAAI,EAAE,oBAAoB,CAAC,MAAM;AAE1C,gBAAY,mBAAmB,SAAS,IAAI,EAAE,yBAAyB,CACvE,SAAS,IAAI,EAAE,yBAAyB,CAAC,MAAM;AAK/C,gBAAY,mBAAmB,GAAG,gBAAgB,GAAG;AAMrD,gBAAY,SAAS,UAAU,IAAI,EAAE,eAAe,CACpD,SAAS,IAAI,EAAE,eAAe,CAAC,MAAM;AAWrC,gBAAY,aAAa,KAAK,IAAI,EAAE,WAAW,CAC/C,GAAG,IAAI,EAAE,UAAU,CAAC,IAClB,IAAI,EAAE,KAAK,CAAC,GAAG;AAEjB,gBAAY,QAAQ,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG;AAK3C,gBAAY,cAAc,WAAW,IAAI,EAAE,gBAAgB,CAC3D,GAAG,IAAI,EAAE,eAAe,CAAC,IACvB,IAAI,EAAE,KAAK,CAAC,GAAG;AAEjB,gBAAY,SAAS,IAAI,IAAI,EAAE,UAAU,CAAC,GAAG;AAE7C,gBAAY,QAAQ,cAAc;AAKlC,gBAAY,yBAAyB,GAAG,IAAI,EAAE,sBAAsB,CAAC,UAAU;AAC/E,gBAAY,oBAAoB,GAAG,IAAI,EAAE,iBAAiB,CAAC,UAAU;AAErE,gBAAY,eAAe,YAAY,IAAI,EAAE,gBAAgB,CAAC,WACjC,IAAI,EAAE,gBAAgB,CAAC,WACvB,IAAI,EAAE,gBAAgB,CAAC,OAC3B,IAAI,EAAE,UAAU,CAAC,KACrB,IAAI,EAAE,KAAK,CAAC,OACR;AAEzB,gBAAY,oBAAoB,YAAY,IAAI,EAAE,qBAAqB,CAAC,WACtC,IAAI,EAAE,qBAAqB,CAAC,WAC5B,IAAI,EAAE,qBAAqB,CAAC,OAChC,IAAI,EAAE,eAAe,CAAC,KAC1B,IAAI,EAAE,KAAK,CAAC,OACR;AAE9B,gBAAY,UAAU,IAAI,IAAI,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,WAAW,CAAC,GAAG;AACjE,gBAAY,eAAe,IAAI,IAAI,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,gBAAgB,CAAC,GAAG;AAI3E,gBAAY,eAAe,GAAG,mBACP,GAAG,yBAAyB,kBACrB,yBAAyB,oBACzB,yBAAyB,MAAM;AAC7D,gBAAY,UAAU,GAAG,IAAI,EAAE,WAAW,CAAC,cAAc;AACzD,gBAAY,cAAc,IAAI,EAAE,WAAW,IAC7B,MAAM,IAAI,EAAE,UAAU,CAAC,QACjB,IAAI,EAAE,KAAK,CAAC,gBACJ;AAC5B,gBAAY,aAAa,IAAI,EAAE,MAAM,GAAG,IAAI;AAC5C,gBAAY,iBAAiB,IAAI,EAAE,UAAU,GAAG,IAAI;AAIpD,gBAAY,aAAa,SAAS;AAElC,gBAAY,aAAa,SAAS,IAAI,EAAE,SAAS,CAAC,QAAQ,IAAI;AAC9D,YAAQ,mBAAmB;AAE3B,gBAAY,SAAS,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,WAAW,CAAC,GAAG;AACjE,gBAAY,cAAc,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,gBAAgB,CAAC,GAAG;AAI3E,gBAAY,aAAa,SAAS;AAElC,gBAAY,aAAa,SAAS,IAAI,EAAE,SAAS,CAAC,QAAQ,IAAI;AAC9D,YAAQ,mBAAmB;AAE3B,gBAAY,SAAS,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,WAAW,CAAC,GAAG;AACjE,gBAAY,cAAc,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,gBAAgB,CAAC,GAAG;AAG3E,gBAAY,mBAAmB,IAAI,IAAI,EAAE,IAAI,CAAC,QAAQ,IAAI,EAAE,UAAU,CAAC,OAAO;AAC9E,gBAAY,cAAc,IAAI,IAAI,EAAE,IAAI,CAAC,QAAQ,IAAI,EAAE,SAAS,CAAC,OAAO;AAIxE,gBAAY,kBAAkB,SAAS,IAAI,EAAE,IAAI,CACjD,QAAQ,IAAI,EAAE,UAAU,CAAC,IAAI,IAAI,EAAE,WAAW,CAAC,KAAK,IAAI;AACxD,YAAQ,wBAAwB;AAMhC,gBAAY,eAAe,SAAS,IAAI,EAAE,WAAW,CAAC,cAE/B,IAAI,EAAE,WAAW,CAAC,QACf;AAE1B,gBAAY,oBAAoB,SAAS,IAAI,EAAE,gBAAgB,CAAC,cAEpC,IAAI,EAAE,gBAAgB,CAAC,QACpB;AAG/B,gBAAY,QAAQ,iBAAiB;AAErC,gBAAY,QAAQ,2BAA2B;AAC/C,gBAAY,WAAW,6BAA6B;AAAA;AAAA;;;ACxNpD;AAAA;AACA,QAAM,cAAc,OAAO,OAAO,EAAE,OAAO,KAAK,CAAC;AACjD,QAAM,YAAY,OAAO,OAAO,CAAE,CAAC;AACnC,QAAM,eAAe,aAAW;AAC9B,UAAI,CAAC,SAAS;AACZ,eAAO;AAAA,MACT;AAEA,UAAI,OAAO,YAAY,UAAU;AAC/B,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AACA,WAAO,UAAU;AAAA;AAAA;;;ACdjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,qBAAqB,CAAC,GAAG,MAAM;AACnC,YAAM,OAAO,QAAQ,KAAK,CAAC;AAC3B,YAAM,OAAO,QAAQ,KAAK,CAAC;AAE3B,UAAI,QAAQ,MAAM;AAChB,YAAI,CAAC;AACL,YAAI,CAAC;AAAA,MACP;AAEA,aAAO,MAAM,IAAI,IACZ,QAAQ,CAAC,OAAQ,KACjB,QAAQ,CAAC,OAAQ,IAClB,IAAI,IAAI,KACR;AAAA,IACN;AAEA,QAAM,sBAAsB,CAAC,GAAG,MAAM,mBAAmB,GAAG,CAAC;AAE7D,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAAA;AAAA;;;ACtBA;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,EAAE,YAAY,iBAAiB,IAAI;AACzC,QAAM,EAAE,QAAQ,IAAI,EAAE,IAAI;AAE1B,QAAM,eAAe;AACrB,QAAM,EAAE,mBAAmB,IAAI;AAC/B,QAAM,SAAN,MAAM,QAAO;AAAA,MACX,YAAa,SAAS,SAAS;AAC7B,kBAAU,aAAa,OAAO;AAE9B,YAAI,mBAAmB,SAAQ;AAC7B,cAAI,QAAQ,UAAU,CAAC,CAAC,QAAQ,SAC5B,QAAQ,sBAAsB,CAAC,CAAC,QAAQ,mBAAmB;AAC7D,mBAAO;AAAA,UACT,OAAO;AACL,sBAAU,QAAQ;AAAA,UACpB;AAAA,QACF,WAAW,OAAO,YAAY,UAAU;AACtC,gBAAM,IAAI,UAAU,gDAAgD,OAAO,OAAO,IAAI;AAAA,QACxF;AAEA,YAAI,QAAQ,SAAS,YAAY;AAC/B,gBAAM,IAAI;AAAA,YACR,0BAA0B,UAAU;AAAA,UACtC;AAAA,QACF;AAEA,cAAM,UAAU,SAAS,OAAO;AAChC,aAAK,UAAU;AACf,aAAK,QAAQ,CAAC,CAAC,QAAQ;AAGvB,aAAK,oBAAoB,CAAC,CAAC,QAAQ;AAEnC,cAAM,IAAI,QAAQ,KAAK,EAAE,MAAM,QAAQ,QAAQ,GAAG,EAAE,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC;AAEvE,YAAI,CAAC,GAAG;AACN,gBAAM,IAAI,UAAU,oBAAoB,OAAO,EAAE;AAAA,QACnD;AAEA,aAAK,MAAM;AAGX,aAAK,QAAQ,CAAC,EAAE,CAAC;AACjB,aAAK,QAAQ,CAAC,EAAE,CAAC;AACjB,aAAK,QAAQ,CAAC,EAAE,CAAC;AAEjB,YAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAAG;AACnD,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC7C;AAEA,YAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAAG;AACnD,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC7C;AAEA,YAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAAG;AACnD,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC7C;AAGA,YAAI,CAAC,EAAE,CAAC,GAAG;AACT,eAAK,aAAa,CAAC;AAAA,QACrB,OAAO;AACL,eAAK,aAAa,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,CAACE,QAAO;AAC5C,gBAAI,WAAW,KAAKA,GAAE,GAAG;AACvB,oBAAM,MAAM,CAACA;AACb,kBAAI,OAAO,KAAK,MAAM,kBAAkB;AACtC,uBAAO;AAAA,cACT;AAAA,YACF;AACA,mBAAOA;AAAA,UACT,CAAC;AAAA,QACH;AAEA,aAAK,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;AACvC,aAAK,OAAO;AAAA,MACd;AAAA,MAEA,SAAU;AACR,aAAK,UAAU,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK;AACxD,YAAI,KAAK,WAAW,QAAQ;AAC1B,eAAK,WAAW,IAAI,KAAK,WAAW,KAAK,GAAG,CAAC;AAAA,QAC/C;AACA,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,WAAY;AACV,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,QAAS,OAAO;AACd,cAAM,kBAAkB,KAAK,SAAS,KAAK,SAAS,KAAK;AACzD,YAAI,EAAE,iBAAiB,UAAS;AAC9B,cAAI,OAAO,UAAU,YAAY,UAAU,KAAK,SAAS;AACvD,mBAAO;AAAA,UACT;AACA,kBAAQ,IAAI,QAAO,OAAO,KAAK,OAAO;AAAA,QACxC;AAEA,YAAI,MAAM,YAAY,KAAK,SAAS;AAClC,iBAAO;AAAA,QACT;AAEA,eAAO,KAAK,YAAY,KAAK,KAAK,KAAK,WAAW,KAAK;AAAA,MACzD;AAAA,MAEA,YAAa,OAAO;AAClB,YAAI,EAAE,iBAAiB,UAAS;AAC9B,kBAAQ,IAAI,QAAO,OAAO,KAAK,OAAO;AAAA,QACxC;AAEA,eACE,mBAAmB,KAAK,OAAO,MAAM,KAAK,KAC1C,mBAAmB,KAAK,OAAO,MAAM,KAAK,KAC1C,mBAAmB,KAAK,OAAO,MAAM,KAAK;AAAA,MAE9C;AAAA,MAEA,WAAY,OAAO;AACjB,YAAI,EAAE,iBAAiB,UAAS;AAC9B,kBAAQ,IAAI,QAAO,OAAO,KAAK,OAAO;AAAA,QACxC;AAGA,YAAI,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,QAAQ;AACtD,iBAAO;AAAA,QACT,WAAW,CAAC,KAAK,WAAW,UAAU,MAAM,WAAW,QAAQ;AAC7D,iBAAO;AAAA,QACT,WAAW,CAAC,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,QAAQ;AAC9D,iBAAO;AAAA,QACT;AAEA,YAAI,IAAI;AACR,WAAG;AACD,gBAAM,IAAI,KAAK,WAAW,CAAC;AAC3B,gBAAM,IAAI,MAAM,WAAW,CAAC;AAC5B,gBAAM,sBAAsB,GAAG,GAAG,CAAC;AACnC,cAAI,MAAM,UAAa,MAAM,QAAW;AACtC,mBAAO;AAAA,UACT,WAAW,MAAM,QAAW;AAC1B,mBAAO;AAAA,UACT,WAAW,MAAM,QAAW;AAC1B,mBAAO;AAAA,UACT,WAAW,MAAM,GAAG;AAClB;AAAA,UACF,OAAO;AACL,mBAAO,mBAAmB,GAAG,CAAC;AAAA,UAChC;AAAA,QACF,SAAS,EAAE;AAAA,MACb;AAAA,MAEA,aAAc,OAAO;AACnB,YAAI,EAAE,iBAAiB,UAAS;AAC9B,kBAAQ,IAAI,QAAO,OAAO,KAAK,OAAO;AAAA,QACxC;AAEA,YAAI,IAAI;AACR,WAAG;AACD,gBAAM,IAAI,KAAK,MAAM,CAAC;AACtB,gBAAM,IAAI,MAAM,MAAM,CAAC;AACvB,gBAAM,iBAAiB,GAAG,GAAG,CAAC;AAC9B,cAAI,MAAM,UAAa,MAAM,QAAW;AACtC,mBAAO;AAAA,UACT,WAAW,MAAM,QAAW;AAC1B,mBAAO;AAAA,UACT,WAAW,MAAM,QAAW;AAC1B,mBAAO;AAAA,UACT,WAAW,MAAM,GAAG;AAClB;AAAA,UACF,OAAO;AACL,mBAAO,mBAAmB,GAAG,CAAC;AAAA,UAChC;AAAA,QACF,SAAS,EAAE;AAAA,MACb;AAAA;AAAA;AAAA,MAIA,IAAK,SAAS,YAAY,gBAAgB;AACxC,gBAAQ,SAAS;AAAA,UACf,KAAK;AACH,iBAAK,WAAW,SAAS;AACzB,iBAAK,QAAQ;AACb,iBAAK,QAAQ;AACb,iBAAK;AACL,iBAAK,IAAI,OAAO,YAAY,cAAc;AAC1C;AAAA,UACF,KAAK;AACH,iBAAK,WAAW,SAAS;AACzB,iBAAK,QAAQ;AACb,iBAAK;AACL,iBAAK,IAAI,OAAO,YAAY,cAAc;AAC1C;AAAA,UACF,KAAK;AAIH,iBAAK,WAAW,SAAS;AACzB,iBAAK,IAAI,SAAS,YAAY,cAAc;AAC5C,iBAAK,IAAI,OAAO,YAAY,cAAc;AAC1C;AAAA;AAAA;AAAA,UAGF,KAAK;AACH,gBAAI,KAAK,WAAW,WAAW,GAAG;AAChC,mBAAK,IAAI,SAAS,YAAY,cAAc;AAAA,YAC9C;AACA,iBAAK,IAAI,OAAO,YAAY,cAAc;AAC1C;AAAA,UAEF,KAAK;AAKH,gBACE,KAAK,UAAU,KACf,KAAK,UAAU,KACf,KAAK,WAAW,WAAW,GAC3B;AACA,mBAAK;AAAA,YACP;AACA,iBAAK,QAAQ;AACb,iBAAK,QAAQ;AACb,iBAAK,aAAa,CAAC;AACnB;AAAA,UACF,KAAK;AAKH,gBAAI,KAAK,UAAU,KAAK,KAAK,WAAW,WAAW,GAAG;AACpD,mBAAK;AAAA,YACP;AACA,iBAAK,QAAQ;AACb,iBAAK,aAAa,CAAC;AACnB;AAAA,UACF,KAAK;AAKH,gBAAI,KAAK,WAAW,WAAW,GAAG;AAChC,mBAAK;AAAA,YACP;AACA,iBAAK,aAAa,CAAC;AACnB;AAAA;AAAA;AAAA,UAGF,KAAK,OAAO;AACV,kBAAM,OAAO,OAAO,cAAc,IAAI,IAAI;AAE1C,gBAAI,CAAC,cAAc,mBAAmB,OAAO;AAC3C,oBAAM,IAAI,MAAM,iDAAiD;AAAA,YACnE;AAEA,gBAAI,KAAK,WAAW,WAAW,GAAG;AAChC,mBAAK,aAAa,CAAC,IAAI;AAAA,YACzB,OAAO;AACL,kBAAI,IAAI,KAAK,WAAW;AACxB,qBAAO,EAAE,KAAK,GAAG;AACf,oBAAI,OAAO,KAAK,WAAW,CAAC,MAAM,UAAU;AAC1C,uBAAK,WAAW,CAAC;AACjB,sBAAI;AAAA,gBACN;AAAA,cACF;AACA,kBAAI,MAAM,IAAI;AAEZ,oBAAI,eAAe,KAAK,WAAW,KAAK,GAAG,KAAK,mBAAmB,OAAO;AACxE,wBAAM,IAAI,MAAM,uDAAuD;AAAA,gBACzE;AACA,qBAAK,WAAW,KAAK,IAAI;AAAA,cAC3B;AAAA,YACF;AACA,gBAAI,YAAY;AAGd,kBAAI,aAAa,CAAC,YAAY,IAAI;AAClC,kBAAI,mBAAmB,OAAO;AAC5B,6BAAa,CAAC,UAAU;AAAA,cAC1B;AACA,kBAAI,mBAAmB,KAAK,WAAW,CAAC,GAAG,UAAU,MAAM,GAAG;AAC5D,oBAAI,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG;AAC7B,uBAAK,aAAa;AAAA,gBACpB;AAAA,cACF,OAAO;AACL,qBAAK,aAAa;AAAA,cACpB;AAAA,YACF;AACA;AAAA,UACF;AAAA,UACA;AACE,kBAAM,IAAI,MAAM,+BAA+B,OAAO,EAAE;AAAA,QAC5D;AACA,aAAK,MAAM,KAAK,OAAO;AACvB,YAAI,KAAK,MAAM,QAAQ;AACrB,eAAK,OAAO,IAAI,KAAK,MAAM,KAAK,GAAG,CAAC;AAAA,QACtC;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,UAAU;AAAA;AAAA;;;AC7SjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ,CAAC,SAAS,SAAS,cAAc,UAAU;AACvD,UAAI,mBAAmB,QAAQ;AAC7B,eAAO;AAAA,MACT;AACA,UAAI;AACF,eAAO,IAAI,OAAO,SAAS,OAAO;AAAA,MACpC,SAAS,IAAI;AACX,YAAI,CAAC,aAAa;AAChB,iBAAO;AAAA,QACT;AACA,cAAM;AAAA,MACR;AAAA,IACF;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACfjB;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,QAAQ,CAAC,SAAS,YAAY;AAClC,YAAM,IAAI,MAAM,SAAS,OAAO;AAChC,aAAO,IAAI,EAAE,UAAU;AAAA,IACzB;AACA,WAAO,UAAU;AAAA;AAAA;;;ACLjB;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,QAAQ,CAAC,SAAS,YAAY;AAClC,YAAM,IAAI,MAAM,QAAQ,KAAK,EAAE,QAAQ,UAAU,EAAE,GAAG,OAAO;AAC7D,aAAO,IAAI,EAAE,UAAU;AAAA,IACzB;AACA,WAAO,UAAU;AAAA;AAAA;;;ACLjB;AAAA;AAAA,QAAM,SAAS;AAEf,QAAM,MAAM,CAAC,SAAS,SAAS,SAAS,YAAY,mBAAmB;AACrE,UAAI,OAAQ,YAAa,UAAU;AACjC,yBAAiB;AACjB,qBAAa;AACb,kBAAU;AAAA,MACZ;AAEA,UAAI;AACF,eAAO,IAAI;AAAA,UACT,mBAAmB,SAAS,QAAQ,UAAU;AAAA,UAC9C;AAAA,QACF,EAAE,IAAI,SAAS,YAAY,cAAc,EAAE;AAAA,MAC7C,SAAS,IAAI;AACX,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO,UAAU;AAAA;AAAA;;;AClBjB;AAAA;AAAA,QAAM,QAAQ;AAEd,QAAM,OAAO,CAAC,UAAU,aAAa;AACnC,YAAM,KAAK,MAAM,UAAU,MAAM,IAAI;AACrC,YAAM,KAAK,MAAM,UAAU,MAAM,IAAI;AACrC,YAAM,aAAa,GAAG,QAAQ,EAAE;AAEhC,UAAI,eAAe,GAAG;AACpB,eAAO;AAAA,MACT;AAEA,YAAM,WAAW,aAAa;AAC9B,YAAM,cAAc,WAAW,KAAK;AACpC,YAAM,aAAa,WAAW,KAAK;AACnC,YAAM,aAAa,CAAC,CAAC,YAAY,WAAW;AAC5C,YAAM,YAAY,CAAC,CAAC,WAAW,WAAW;AAE1C,UAAI,aAAa,CAAC,YAAY;AAQ5B,YAAI,CAAC,WAAW,SAAS,CAAC,WAAW,OAAO;AAC1C,iBAAO;AAAA,QACT;AAIA,YAAI,YAAY,OAAO;AAErB,iBAAO;AAAA,QACT;AAEA,YAAI,YAAY,OAAO;AAErB,iBAAO;AAAA,QACT;AAGA,eAAO;AAAA,MACT;AAGA,YAAM,SAAS,aAAa,QAAQ;AAEpC,UAAI,GAAG,UAAU,GAAG,OAAO;AACzB,eAAO,SAAS;AAAA,MAClB;AAEA,UAAI,GAAG,UAAU,GAAG,OAAO;AACzB,eAAO,SAAS;AAAA,MAClB;AAEA,UAAI,GAAG,UAAU,GAAG,OAAO;AACzB,eAAO,SAAS;AAAA,MAClB;AAGA,aAAO;AAAA,IACT;AAEA,WAAO,UAAU;AAAA;AAAA;;;AChEjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ,CAAC,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,EAAE;AACjD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ,CAAC,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,EAAE;AACjD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ,CAAC,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,EAAE;AACjD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,aAAa,CAAC,SAAS,YAAY;AACvC,YAAM,SAAS,MAAM,SAAS,OAAO;AACrC,aAAQ,UAAU,OAAO,WAAW,SAAU,OAAO,aAAa;AAAA,IACpE;AACA,WAAO,UAAU;AAAA;AAAA;;;ACLjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,UAAU,CAAC,GAAG,GAAG,UACrB,IAAI,OAAO,GAAG,KAAK,EAAE,QAAQ,IAAI,OAAO,GAAG,KAAK,CAAC;AAEnD,WAAO,UAAU;AAAA;AAAA;;;ACJjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,WAAW,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK;AACrD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,eAAe,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,IAAI;AACjD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,eAAe,CAAC,GAAG,GAAG,UAAU;AACpC,YAAM,WAAW,IAAI,OAAO,GAAG,KAAK;AACpC,YAAM,WAAW,IAAI,OAAO,GAAG,KAAK;AACpC,aAAO,SAAS,QAAQ,QAAQ,KAAK,SAAS,aAAa,QAAQ;AAAA,IACrE;AACA,WAAO,UAAU;AAAA;AAAA;;;ACNjB;AAAA;AAAA,QAAM,eAAe;AACrB,QAAM,OAAO,CAAC,MAAM,UAAU,KAAK,KAAK,CAAC,GAAG,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC;AAC3E,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,eAAe;AACrB,QAAM,QAAQ,CAAC,MAAM,UAAU,KAAK,KAAK,CAAC,GAAG,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC;AAC5E,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,KAAK,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,IAAI;AACnD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,KAAK,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,IAAI;AACnD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,KAAK,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,MAAM;AACrD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,MAAM,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,MAAM;AACtD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,MAAM,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,KAAK;AACrD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,UAAU;AAChB,QAAM,MAAM,CAAC,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,KAAK;AACrD,WAAO,UAAU;AAAA;AAAA;;;ACFjB;AAAA;AAAA,QAAM,KAAK;AACX,QAAM,MAAM;AACZ,QAAM,KAAK;AACX,QAAM,MAAM;AACZ,QAAM,KAAK;AACX,QAAM,MAAM;AAEZ,QAAM,MAAM,CAAC,GAAG,IAAI,GAAG,UAAU;AAC/B,cAAQ,IAAI;AAAA,QACV,KAAK;AACH,cAAI,OAAO,MAAM,UAAU;AACzB,gBAAI,EAAE;AAAA,UACR;AACA,cAAI,OAAO,MAAM,UAAU;AACzB,gBAAI,EAAE;AAAA,UACR;AACA,iBAAO,MAAM;AAAA,QAEf,KAAK;AACH,cAAI,OAAO,MAAM,UAAU;AACzB,gBAAI,EAAE;AAAA,UACR;AACA,cAAI,OAAO,MAAM,UAAU;AACzB,gBAAI,EAAE;AAAA,UACR;AACA,iBAAO,MAAM;AAAA,QAEf,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,GAAG,GAAG,GAAG,KAAK;AAAA,QAEvB,KAAK;AACH,iBAAO,IAAI,GAAG,GAAG,KAAK;AAAA,QAExB,KAAK;AACH,iBAAO,GAAG,GAAG,GAAG,KAAK;AAAA,QAEvB,KAAK;AACH,iBAAO,IAAI,GAAG,GAAG,KAAK;AAAA,QAExB,KAAK;AACH,iBAAO,GAAG,GAAG,GAAG,KAAK;AAAA,QAEvB,KAAK;AACH,iBAAO,IAAI,GAAG,GAAG,KAAK;AAAA,QAExB;AACE,gBAAM,IAAI,UAAU,qBAAqB,EAAE,EAAE;AAAA,MACjD;AAAA,IACF;AACA,WAAO,UAAU;AAAA;AAAA;;;ACnDjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ;AACd,QAAM,EAAE,QAAQ,IAAI,EAAE,IAAI;AAE1B,QAAM,SAAS,CAAC,SAAS,YAAY;AACnC,UAAI,mBAAmB,QAAQ;AAC7B,eAAO;AAAA,MACT;AAEA,UAAI,OAAO,YAAY,UAAU;AAC/B,kBAAU,OAAO,OAAO;AAAA,MAC1B;AAEA,UAAI,OAAO,YAAY,UAAU;AAC/B,eAAO;AAAA,MACT;AAEA,gBAAU,WAAW,CAAC;AAEtB,UAAI,QAAQ;AACZ,UAAI,CAAC,QAAQ,KAAK;AAChB,gBAAQ,QAAQ,MAAM,QAAQ,oBAAoB,GAAG,EAAE,UAAU,IAAI,GAAG,EAAE,MAAM,CAAC;AAAA,MACnF,OAAO;AAUL,cAAM,iBAAiB,QAAQ,oBAAoB,GAAG,EAAE,aAAa,IAAI,GAAG,EAAE,SAAS;AACvF,YAAI;AACJ,gBAAQ,OAAO,eAAe,KAAK,OAAO,OACrC,CAAC,SAAS,MAAM,QAAQ,MAAM,CAAC,EAAE,WAAW,QAAQ,SACvD;AACA,cAAI,CAAC,SACC,KAAK,QAAQ,KAAK,CAAC,EAAE,WAAW,MAAM,QAAQ,MAAM,CAAC,EAAE,QAAQ;AACnE,oBAAQ;AAAA,UACV;AACA,yBAAe,YAAY,KAAK,QAAQ,KAAK,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE;AAAA,QACnE;AAEA,uBAAe,YAAY;AAAA,MAC7B;AAEA,UAAI,UAAU,MAAM;AAClB,eAAO;AAAA,MACT;AAEA,YAAM,QAAQ,MAAM,CAAC;AACrB,YAAM,QAAQ,MAAM,CAAC,KAAK;AAC1B,YAAM,QAAQ,MAAM,CAAC,KAAK;AAC1B,YAAM,aAAa,QAAQ,qBAAqB,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,KAAK;AAC5E,YAAM,QAAQ,QAAQ,qBAAqB,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,KAAK;AAEvE,aAAO,MAAM,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,UAAU,GAAG,KAAK,IAAI,OAAO;AAAA,IACzE;AACA,WAAO,UAAU;AAAA;AAAA;;;AC3DjB;AAAA;AAAA,QAAM,WAAN,MAAe;AAAA,MACb,cAAe;AACb,aAAK,MAAM;AACX,aAAK,MAAM,oBAAI,IAAI;AAAA,MACrB;AAAA,MAEA,IAAK,KAAK;AACR,cAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;AAC9B,YAAI,UAAU,QAAW;AACvB,iBAAO;AAAA,QACT,OAAO;AAEL,eAAK,IAAI,OAAO,GAAG;AACnB,eAAK,IAAI,IAAI,KAAK,KAAK;AACvB,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,MAEA,OAAQ,KAAK;AACX,eAAO,KAAK,IAAI,OAAO,GAAG;AAAA,MAC5B;AAAA,MAEA,IAAK,KAAK,OAAO;AACf,cAAM,UAAU,KAAK,OAAO,GAAG;AAE/B,YAAI,CAAC,WAAW,UAAU,QAAW;AAEnC,cAAI,KAAK,IAAI,QAAQ,KAAK,KAAK;AAC7B,kBAAM,WAAW,KAAK,IAAI,KAAK,EAAE,KAAK,EAAE;AACxC,iBAAK,OAAO,QAAQ;AAAA,UACtB;AAEA,eAAK,IAAI,IAAI,KAAK,KAAK;AAAA,QACzB;AAEA,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACvCjB;AAAA;AAAA,QAAM,mBAAmB;AAGzB,QAAM,QAAN,MAAM,OAAM;AAAA,MACV,YAAa,OAAO,SAAS;AAC3B,kBAAU,aAAa,OAAO;AAE9B,YAAI,iBAAiB,QAAO;AAC1B,cACE,MAAM,UAAU,CAAC,CAAC,QAAQ,SAC1B,MAAM,sBAAsB,CAAC,CAAC,QAAQ,mBACtC;AACA,mBAAO;AAAA,UACT,OAAO;AACL,mBAAO,IAAI,OAAM,MAAM,KAAK,OAAO;AAAA,UACrC;AAAA,QACF;AAEA,YAAI,iBAAiB,YAAY;AAE/B,eAAK,MAAM,MAAM;AACjB,eAAK,MAAM,CAAC,CAAC,KAAK,CAAC;AACnB,eAAK,YAAY;AACjB,iBAAO;AAAA,QACT;AAEA,aAAK,UAAU;AACf,aAAK,QAAQ,CAAC,CAAC,QAAQ;AACvB,aAAK,oBAAoB,CAAC,CAAC,QAAQ;AAKnC,aAAK,MAAM,MAAM,KAAK,EAAE,QAAQ,kBAAkB,GAAG;AAGrD,aAAK,MAAM,KAAK,IACb,MAAM,IAAI,EAEV,IAAI,OAAK,KAAK,WAAW,EAAE,KAAK,CAAC,CAAC,EAIlC,OAAO,OAAK,EAAE,MAAM;AAEvB,YAAI,CAAC,KAAK,IAAI,QAAQ;AACpB,gBAAM,IAAI,UAAU,yBAAyB,KAAK,GAAG,EAAE;AAAA,QACzD;AAGA,YAAI,KAAK,IAAI,SAAS,GAAG;AAEvB,gBAAMC,SAAQ,KAAK,IAAI,CAAC;AACxB,eAAK,MAAM,KAAK,IAAI,OAAO,OAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;AAChD,cAAI,KAAK,IAAI,WAAW,GAAG;AACzB,iBAAK,MAAM,CAACA,MAAK;AAAA,UACnB,WAAW,KAAK,IAAI,SAAS,GAAG;AAE9B,uBAAW,KAAK,KAAK,KAAK;AACxB,kBAAI,EAAE,WAAW,KAAK,MAAM,EAAE,CAAC,CAAC,GAAG;AACjC,qBAAK,MAAM,CAAC,CAAC;AACb;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,aAAK,YAAY;AAAA,MACnB;AAAA,MAEA,IAAI,QAAS;AACX,YAAI,KAAK,cAAc,QAAW;AAChC,eAAK,YAAY;AACjB,mBAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;AACxC,gBAAI,IAAI,GAAG;AACT,mBAAK,aAAa;AAAA,YACpB;AACA,kBAAM,QAAQ,KAAK,IAAI,CAAC;AACxB,qBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,kBAAI,IAAI,GAAG;AACT,qBAAK,aAAa;AAAA,cACpB;AACA,mBAAK,aAAa,MAAM,CAAC,EAAE,SAAS,EAAE,KAAK;AAAA,YAC7C;AAAA,UACF;AAAA,QACF;AACA,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,SAAU;AACR,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,WAAY;AACV,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,WAAY,OAAO;AAGjB,cAAM,YACH,KAAK,QAAQ,qBAAqB,4BAClC,KAAK,QAAQ,SAAS;AACzB,cAAM,UAAU,WAAW,MAAM;AACjC,cAAM,SAAS,MAAM,IAAI,OAAO;AAChC,YAAI,QAAQ;AACV,iBAAO;AAAA,QACT;AAEA,cAAM,QAAQ,KAAK,QAAQ;AAE3B,cAAM,KAAK,QAAQ,GAAG,EAAE,gBAAgB,IAAI,GAAG,EAAE,WAAW;AAC5D,gBAAQ,MAAM,QAAQ,IAAI,cAAc,KAAK,QAAQ,iBAAiB,CAAC;AACvE,cAAM,kBAAkB,KAAK;AAG7B,gBAAQ,MAAM,QAAQ,GAAG,EAAE,cAAc,GAAG,qBAAqB;AACjE,cAAM,mBAAmB,KAAK;AAG9B,gBAAQ,MAAM,QAAQ,GAAG,EAAE,SAAS,GAAG,gBAAgB;AACvD,cAAM,cAAc,KAAK;AAGzB,gBAAQ,MAAM,QAAQ,GAAG,EAAE,SAAS,GAAG,gBAAgB;AACvD,cAAM,cAAc,KAAK;AAKzB,YAAI,YAAY,MACb,MAAM,GAAG,EACT,IAAI,UAAQ,gBAAgB,MAAM,KAAK,OAAO,CAAC,EAC/C,KAAK,GAAG,EACR,MAAM,KAAK,EAEX,IAAI,UAAQ,YAAY,MAAM,KAAK,OAAO,CAAC;AAE9C,YAAI,OAAO;AAET,sBAAY,UAAU,OAAO,UAAQ;AACnC,kBAAM,wBAAwB,MAAM,KAAK,OAAO;AAChD,mBAAO,CAAC,CAAC,KAAK,MAAM,GAAG,EAAE,eAAe,CAAC;AAAA,UAC3C,CAAC;AAAA,QACH;AACA,cAAM,cAAc,SAAS;AAK7B,cAAM,WAAW,oBAAI,IAAI;AACzB,cAAM,cAAc,UAAU,IAAI,UAAQ,IAAI,WAAW,MAAM,KAAK,OAAO,CAAC;AAC5E,mBAAW,QAAQ,aAAa;AAC9B,cAAI,UAAU,IAAI,GAAG;AACnB,mBAAO,CAAC,IAAI;AAAA,UACd;AACA,mBAAS,IAAI,KAAK,OAAO,IAAI;AAAA,QAC/B;AACA,YAAI,SAAS,OAAO,KAAK,SAAS,IAAI,EAAE,GAAG;AACzC,mBAAS,OAAO,EAAE;AAAA,QACpB;AAEA,cAAM,SAAS,CAAC,GAAG,SAAS,OAAO,CAAC;AACpC,cAAM,IAAI,SAAS,MAAM;AACzB,eAAO;AAAA,MACT;AAAA,MAEA,WAAY,OAAO,SAAS;AAC1B,YAAI,EAAE,iBAAiB,SAAQ;AAC7B,gBAAM,IAAI,UAAU,qBAAqB;AAAA,QAC3C;AAEA,eAAO,KAAK,IAAI,KAAK,CAAC,oBAAoB;AACxC,iBACE,cAAc,iBAAiB,OAAO,KACtC,MAAM,IAAI,KAAK,CAAC,qBAAqB;AACnC,mBACE,cAAc,kBAAkB,OAAO,KACvC,gBAAgB,MAAM,CAAC,mBAAmB;AACxC,qBAAO,iBAAiB,MAAM,CAAC,oBAAoB;AACjD,uBAAO,eAAe,WAAW,iBAAiB,OAAO;AAAA,cAC3D,CAAC;AAAA,YACH,CAAC;AAAA,UAEL,CAAC;AAAA,QAEL,CAAC;AAAA,MACH;AAAA;AAAA,MAGA,KAAM,SAAS;AACb,YAAI,CAAC,SAAS;AACZ,iBAAO;AAAA,QACT;AAEA,YAAI,OAAO,YAAY,UAAU;AAC/B,cAAI;AACF,sBAAU,IAAI,OAAO,SAAS,KAAK,OAAO;AAAA,UAC5C,SAAS,IAAI;AACX,mBAAO;AAAA,UACT;AAAA,QACF;AAEA,iBAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;AACxC,cAAI,QAAQ,KAAK,IAAI,CAAC,GAAG,SAAS,KAAK,OAAO,GAAG;AAC/C,mBAAO;AAAA,UACT;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,UAAU;AAEjB,QAAM,MAAM;AACZ,QAAM,QAAQ,IAAI,IAAI;AAEtB,QAAM,eAAe;AACrB,QAAM,aAAa;AACnB,QAAM,QAAQ;AACd,QAAM,SAAS;AACf,QAAM;AAAA,MACJ,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI;AACJ,QAAM,EAAE,yBAAyB,WAAW,IAAI;AAEhD,QAAM,YAAY,OAAK,EAAE,UAAU;AACnC,QAAM,QAAQ,OAAK,EAAE,UAAU;AAI/B,QAAM,gBAAgB,CAAC,aAAa,YAAY;AAC9C,UAAI,SAAS;AACb,YAAM,uBAAuB,YAAY,MAAM;AAC/C,UAAI,iBAAiB,qBAAqB,IAAI;AAE9C,aAAO,UAAU,qBAAqB,QAAQ;AAC5C,iBAAS,qBAAqB,MAAM,CAAC,oBAAoB;AACvD,iBAAO,eAAe,WAAW,iBAAiB,OAAO;AAAA,QAC3D,CAAC;AAED,yBAAiB,qBAAqB,IAAI;AAAA,MAC5C;AAEA,aAAO;AAAA,IACT;AAKA,QAAM,kBAAkB,CAAC,MAAM,YAAY;AACzC,YAAM,QAAQ,MAAM,OAAO;AAC3B,aAAO,cAAc,MAAM,OAAO;AAClC,YAAM,SAAS,IAAI;AACnB,aAAO,cAAc,MAAM,OAAO;AAClC,YAAM,UAAU,IAAI;AACpB,aAAO,eAAe,MAAM,OAAO;AACnC,YAAM,UAAU,IAAI;AACpB,aAAO,aAAa,MAAM,OAAO;AACjC,YAAM,SAAS,IAAI;AACnB,aAAO;AAAA,IACT;AAEA,QAAM,MAAM,CAAAC,QAAM,CAACA,OAAMA,IAAG,YAAY,MAAM,OAAOA,QAAO;AAS5D,QAAM,gBAAgB,CAAC,MAAM,YAAY;AACvC,aAAO,KACJ,KAAK,EACL,MAAM,KAAK,EACX,IAAI,CAAC,MAAM,aAAa,GAAG,OAAO,CAAC,EACnC,KAAK,GAAG;AAAA,IACb;AAEA,QAAM,eAAe,CAAC,MAAM,YAAY;AACtC,YAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,UAAU,IAAI,GAAG,EAAE,KAAK;AACvD,aAAO,KAAK,QAAQ,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,OAAO;AACzC,cAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE;AACnC,YAAI;AAEJ,YAAI,IAAI,CAAC,GAAG;AACV,gBAAM;AAAA,QACR,WAAW,IAAI,CAAC,GAAG;AACjB,gBAAM,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC;AAAA,QAC7B,WAAW,IAAI,CAAC,GAAG;AAEjB,gBAAM,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,QACrC,WAAW,IAAI;AACb,gBAAM,mBAAmB,EAAE;AAC3B,gBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAC1B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,QAClB,OAAO;AAEL,gBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,QAClB;AAEA,cAAM,gBAAgB,GAAG;AACzB,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAUA,QAAM,gBAAgB,CAAC,MAAM,YAAY;AACvC,aAAO,KACJ,KAAK,EACL,MAAM,KAAK,EACX,IAAI,CAAC,MAAM,aAAa,GAAG,OAAO,CAAC,EACnC,KAAK,GAAG;AAAA,IACb;AAEA,QAAM,eAAe,CAAC,MAAM,YAAY;AACtC,YAAM,SAAS,MAAM,OAAO;AAC5B,YAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,UAAU,IAAI,GAAG,EAAE,KAAK;AACvD,YAAM,IAAI,QAAQ,oBAAoB,OAAO;AAC7C,aAAO,KAAK,QAAQ,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,OAAO;AACzC,cAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE;AACnC,YAAI;AAEJ,YAAI,IAAI,CAAC,GAAG;AACV,gBAAM;AAAA,QACR,WAAW,IAAI,CAAC,GAAG;AACjB,gBAAM,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC;AAAA,QACjC,WAAW,IAAI,CAAC,GAAG;AACjB,cAAI,MAAM,KAAK;AACb,kBAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,UACzC,OAAO;AACL,kBAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;AAAA,UACpC;AAAA,QACF,WAAW,IAAI;AACb,gBAAM,mBAAmB,EAAE;AAC3B,cAAI,MAAM,KAAK;AACb,gBAAI,MAAM,KAAK;AACb,oBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAC1B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,YACvB,OAAO;AACL,oBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAC1B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,YAClB;AAAA,UACF,OAAO;AACL,kBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAC1B,KAAK,CAAC,IAAI,CAAC;AAAA,UACb;AAAA,QACF,OAAO;AACL,gBAAM,OAAO;AACb,cAAI,MAAM,KAAK;AACb,gBAAI,MAAM,KAAK;AACb,oBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CACrB,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,YAC3B,OAAO;AACL,oBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CACrB,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,YACtB;AAAA,UACF,OAAO;AACL,kBAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CACrB,KAAK,CAAC,IAAI,CAAC;AAAA,UACb;AAAA,QACF;AAEA,cAAM,gBAAgB,GAAG;AACzB,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,QAAM,iBAAiB,CAAC,MAAM,YAAY;AACxC,YAAM,kBAAkB,MAAM,OAAO;AACrC,aAAO,KACJ,MAAM,KAAK,EACX,IAAI,CAAC,MAAM,cAAc,GAAG,OAAO,CAAC,EACpC,KAAK,GAAG;AAAA,IACb;AAEA,QAAM,gBAAgB,CAAC,MAAM,YAAY;AACvC,aAAO,KAAK,KAAK;AACjB,YAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,WAAW,IAAI,GAAG,EAAE,MAAM;AACzD,aAAO,KAAK,QAAQ,GAAG,CAAC,KAAK,MAAM,GAAG,GAAG,GAAG,OAAO;AACjD,cAAM,UAAU,MAAM,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE;AAC5C,cAAM,KAAK,IAAI,CAAC;AAChB,cAAM,KAAK,MAAM,IAAI,CAAC;AACtB,cAAM,KAAK,MAAM,IAAI,CAAC;AACtB,cAAM,OAAO;AAEb,YAAI,SAAS,OAAO,MAAM;AACxB,iBAAO;AAAA,QACT;AAIA,aAAK,QAAQ,oBAAoB,OAAO;AAExC,YAAI,IAAI;AACN,cAAI,SAAS,OAAO,SAAS,KAAK;AAEhC,kBAAM;AAAA,UACR,OAAO;AAEL,kBAAM;AAAA,UACR;AAAA,QACF,WAAW,QAAQ,MAAM;AAGvB,cAAI,IAAI;AACN,gBAAI;AAAA,UACN;AACA,cAAI;AAEJ,cAAI,SAAS,KAAK;AAGhB,mBAAO;AACP,gBAAI,IAAI;AACN,kBAAI,CAAC,IAAI;AACT,kBAAI;AACJ,kBAAI;AAAA,YACN,OAAO;AACL,kBAAI,CAAC,IAAI;AACT,kBAAI;AAAA,YACN;AAAA,UACF,WAAW,SAAS,MAAM;AAGxB,mBAAO;AACP,gBAAI,IAAI;AACN,kBAAI,CAAC,IAAI;AAAA,YACX,OAAO;AACL,kBAAI,CAAC,IAAI;AAAA,YACX;AAAA,UACF;AAEA,cAAI,SAAS,KAAK;AAChB,iBAAK;AAAA,UACP;AAEA,gBAAM,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;AAAA,QAClC,WAAW,IAAI;AACb,gBAAM,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC;AAAA,QAClC,WAAW,IAAI;AACb,gBAAM,KAAK,CAAC,IAAI,CAAC,KAAK,EACtB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,QAClB;AAEA,cAAM,iBAAiB,GAAG;AAE1B,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAIA,QAAM,eAAe,CAAC,MAAM,YAAY;AACtC,YAAM,gBAAgB,MAAM,OAAO;AAEnC,aAAO,KACJ,KAAK,EACL,QAAQ,GAAG,EAAE,IAAI,GAAG,EAAE;AAAA,IAC3B;AAEA,QAAM,cAAc,CAAC,MAAM,YAAY;AACrC,YAAM,eAAe,MAAM,OAAO;AAClC,aAAO,KACJ,KAAK,EACL,QAAQ,GAAG,QAAQ,oBAAoB,EAAE,UAAU,EAAE,IAAI,GAAG,EAAE;AAAA,IACnE;AAQA,QAAM,gBAAgB,WAAS,CAAC,IAC9BC,OAAM,IAAI,IAAI,IAAI,KAAK,IACvB,IAAI,IAAI,IAAI,IAAI,QAAQ;AACxB,UAAI,IAAI,EAAE,GAAG;AACX,QAAAA,QAAO;AAAA,MACT,WAAW,IAAI,EAAE,GAAG;AAClB,QAAAA,QAAO,KAAK,EAAE,OAAO,QAAQ,OAAO,EAAE;AAAA,MACxC,WAAW,IAAI,EAAE,GAAG;AAClB,QAAAA,QAAO,KAAK,EAAE,IAAI,EAAE,KAAK,QAAQ,OAAO,EAAE;AAAA,MAC5C,WAAW,KAAK;AACd,QAAAA,QAAO,KAAKA,KAAI;AAAA,MAClB,OAAO;AACL,QAAAA,QAAO,KAAKA,KAAI,GAAG,QAAQ,OAAO,EAAE;AAAA,MACtC;AAEA,UAAI,IAAI,EAAE,GAAG;AACX,aAAK;AAAA,MACP,WAAW,IAAI,EAAE,GAAG;AAClB,aAAK,IAAI,CAAC,KAAK,CAAC;AAAA,MAClB,WAAW,IAAI,EAAE,GAAG;AAClB,aAAK,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC;AAAA,MACxB,WAAW,KAAK;AACd,aAAK,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG;AAAA,MACjC,WAAW,OAAO;AAChB,aAAK,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC;AAAA,MAC9B,OAAO;AACL,aAAK,KAAK,EAAE;AAAA,MACd;AAEA,aAAO,GAAGA,KAAI,IAAI,EAAE,GAAG,KAAK;AAAA,IAC9B;AAEA,QAAM,UAAU,CAAC,KAAK,SAAS,YAAY;AACzC,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,CAAC,IAAI,CAAC,EAAE,KAAK,OAAO,GAAG;AACzB,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,QAAQ,WAAW,UAAU,CAAC,QAAQ,mBAAmB;AAM3D,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,gBAAM,IAAI,CAAC,EAAE,MAAM;AACnB,cAAI,IAAI,CAAC,EAAE,WAAW,WAAW,KAAK;AACpC;AAAA,UACF;AAEA,cAAI,IAAI,CAAC,EAAE,OAAO,WAAW,SAAS,GAAG;AACvC,kBAAM,UAAU,IAAI,CAAC,EAAE;AACvB,gBAAI,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,OAAO;AACnC,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AAGA,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;ACziBA;AAAA;AAAA,QAAM,MAAM,OAAO,YAAY;AAE/B,QAAM,aAAN,MAAM,YAAW;AAAA,MACf,WAAW,MAAO;AAChB,eAAO;AAAA,MACT;AAAA,MAEA,YAAa,MAAM,SAAS;AAC1B,kBAAU,aAAa,OAAO;AAE9B,YAAI,gBAAgB,aAAY;AAC9B,cAAI,KAAK,UAAU,CAAC,CAAC,QAAQ,OAAO;AAClC,mBAAO;AAAA,UACT,OAAO;AACL,mBAAO,KAAK;AAAA,UACd;AAAA,QACF;AAEA,eAAO,KAAK,KAAK,EAAE,MAAM,KAAK,EAAE,KAAK,GAAG;AACxC,cAAM,cAAc,MAAM,OAAO;AACjC,aAAK,UAAU;AACf,aAAK,QAAQ,CAAC,CAAC,QAAQ;AACvB,aAAK,MAAM,IAAI;AAEf,YAAI,KAAK,WAAW,KAAK;AACvB,eAAK,QAAQ;AAAA,QACf,OAAO;AACL,eAAK,QAAQ,KAAK,WAAW,KAAK,OAAO;AAAA,QAC3C;AAEA,cAAM,QAAQ,IAAI;AAAA,MACpB;AAAA,MAEA,MAAO,MAAM;AACX,cAAM,IAAI,KAAK,QAAQ,QAAQ,GAAG,EAAE,eAAe,IAAI,GAAG,EAAE,UAAU;AACtE,cAAM,IAAI,KAAK,MAAM,CAAC;AAEtB,YAAI,CAAC,GAAG;AACN,gBAAM,IAAI,UAAU,uBAAuB,IAAI,EAAE;AAAA,QACnD;AAEA,aAAK,WAAW,EAAE,CAAC,MAAM,SAAY,EAAE,CAAC,IAAI;AAC5C,YAAI,KAAK,aAAa,KAAK;AACzB,eAAK,WAAW;AAAA,QAClB;AAGA,YAAI,CAAC,EAAE,CAAC,GAAG;AACT,eAAK,SAAS;AAAA,QAChB,OAAO;AACL,eAAK,SAAS,IAAI,OAAO,EAAE,CAAC,GAAG,KAAK,QAAQ,KAAK;AAAA,QACnD;AAAA,MACF;AAAA,MAEA,WAAY;AACV,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,KAAM,SAAS;AACb,cAAM,mBAAmB,SAAS,KAAK,QAAQ,KAAK;AAEpD,YAAI,KAAK,WAAW,OAAO,YAAY,KAAK;AAC1C,iBAAO;AAAA,QACT;AAEA,YAAI,OAAO,YAAY,UAAU;AAC/B,cAAI;AACF,sBAAU,IAAI,OAAO,SAAS,KAAK,OAAO;AAAA,UAC5C,SAAS,IAAI;AACX,mBAAO;AAAA,UACT;AAAA,QACF;AAEA,eAAO,IAAI,SAAS,KAAK,UAAU,KAAK,QAAQ,KAAK,OAAO;AAAA,MAC9D;AAAA,MAEA,WAAY,MAAM,SAAS;AACzB,YAAI,EAAE,gBAAgB,cAAa;AACjC,gBAAM,IAAI,UAAU,0BAA0B;AAAA,QAChD;AAEA,YAAI,KAAK,aAAa,IAAI;AACxB,cAAI,KAAK,UAAU,IAAI;AACrB,mBAAO;AAAA,UACT;AACA,iBAAO,IAAI,MAAM,KAAK,OAAO,OAAO,EAAE,KAAK,KAAK,KAAK;AAAA,QACvD,WAAW,KAAK,aAAa,IAAI;AAC/B,cAAI,KAAK,UAAU,IAAI;AACrB,mBAAO;AAAA,UACT;AACA,iBAAO,IAAI,MAAM,KAAK,OAAO,OAAO,EAAE,KAAK,KAAK,MAAM;AAAA,QACxD;AAEA,kBAAU,aAAa,OAAO;AAG9B,YAAI,QAAQ,sBACT,KAAK,UAAU,cAAc,KAAK,UAAU,aAAa;AAC1D,iBAAO;AAAA,QACT;AACA,YAAI,CAAC,QAAQ,sBACV,KAAK,MAAM,WAAW,QAAQ,KAAK,KAAK,MAAM,WAAW,QAAQ,IAAI;AACtE,iBAAO;AAAA,QACT;AAGA,YAAI,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAAG;AAClE,iBAAO;AAAA,QACT;AAEA,YAAI,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAAG;AAClE,iBAAO;AAAA,QACT;AAEA,YACG,KAAK,OAAO,YAAY,KAAK,OAAO,WACrC,KAAK,SAAS,SAAS,GAAG,KAAK,KAAK,SAAS,SAAS,GAAG,GAAG;AAC5D,iBAAO;AAAA,QACT;AAEA,YAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAAG;AAChE,iBAAO;AAAA,QACT;AAEA,YAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAAG;AAChE,iBAAO;AAAA,QACT;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,UAAU;AAEjB,QAAM,eAAe;AACrB,QAAM,EAAE,QAAQ,IAAI,EAAE,IAAI;AAC1B,QAAM,MAAM;AACZ,QAAM,QAAQ;AACd,QAAM,SAAS;AACf,QAAM,QAAQ;AAAA;AAAA;;;AC5Id;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,YAAY,CAAC,SAAS,OAAO,YAAY;AAC7C,UAAI;AACF,gBAAQ,IAAI,MAAM,OAAO,OAAO;AAAA,MAClC,SAAS,IAAI;AACX,eAAO;AAAA,MACT;AACA,aAAO,MAAM,KAAK,OAAO;AAAA,IAC3B;AACA,WAAO,UAAU;AAAA;AAAA;;;ACTjB;AAAA;AAAA,QAAM,QAAQ;AAGd,QAAM,gBAAgB,CAAC,OAAO,YAC5B,IAAI,MAAM,OAAO,OAAO,EAAE,IACvB,IAAI,UAAQ,KAAK,IAAI,OAAK,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC;AAEnE,WAAO,UAAU;AAAA;AAAA;;;ACPjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ;AAEd,QAAM,gBAAgB,CAAC,UAAU,OAAO,YAAY;AAClD,UAAI,MAAM;AACV,UAAI,QAAQ;AACZ,UAAI,WAAW;AACf,UAAI;AACF,mBAAW,IAAI,MAAM,OAAO,OAAO;AAAA,MACrC,SAAS,IAAI;AACX,eAAO;AAAA,MACT;AACA,eAAS,QAAQ,CAAC,MAAM;AACtB,YAAI,SAAS,KAAK,CAAC,GAAG;AAEpB,cAAI,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,IAAI;AAEnC,kBAAM;AACN,oBAAQ,IAAI,OAAO,KAAK,OAAO;AAAA,UACjC;AAAA,QACF;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AACA,WAAO,UAAU;AAAA;AAAA;;;ACxBjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ;AACd,QAAM,gBAAgB,CAAC,UAAU,OAAO,YAAY;AAClD,UAAI,MAAM;AACV,UAAI,QAAQ;AACZ,UAAI,WAAW;AACf,UAAI;AACF,mBAAW,IAAI,MAAM,OAAO,OAAO;AAAA,MACrC,SAAS,IAAI;AACX,eAAO;AAAA,MACT;AACA,eAAS,QAAQ,CAAC,MAAM;AACtB,YAAI,SAAS,KAAK,CAAC,GAAG;AAEpB,cAAI,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,GAAG;AAElC,kBAAM;AACN,oBAAQ,IAAI,OAAO,KAAK,OAAO;AAAA,UACjC;AAAA,QACF;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AACA,WAAO,UAAU;AAAA;AAAA;;;ACvBjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,QAAQ;AACd,QAAM,KAAK;AAEX,QAAM,aAAa,CAAC,OAAO,UAAU;AACnC,cAAQ,IAAI,MAAM,OAAO,KAAK;AAE9B,UAAI,SAAS,IAAI,OAAO,OAAO;AAC/B,UAAI,MAAM,KAAK,MAAM,GAAG;AACtB,eAAO;AAAA,MACT;AAEA,eAAS,IAAI,OAAO,SAAS;AAC7B,UAAI,MAAM,KAAK,MAAM,GAAG;AACtB,eAAO;AAAA,MACT;AAEA,eAAS;AACT,eAAS,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;AACzC,cAAM,cAAc,MAAM,IAAI,CAAC;AAE/B,YAAI,SAAS;AACb,oBAAY,QAAQ,CAAC,eAAe;AAElC,gBAAM,UAAU,IAAI,OAAO,WAAW,OAAO,OAAO;AACpD,kBAAQ,WAAW,UAAU;AAAA,YAC3B,KAAK;AACH,kBAAI,QAAQ,WAAW,WAAW,GAAG;AACnC,wBAAQ;AAAA,cACV,OAAO;AACL,wBAAQ,WAAW,KAAK,CAAC;AAAA,cAC3B;AACA,sBAAQ,MAAM,QAAQ,OAAO;AAAA;AAAA,YAE/B,KAAK;AAAA,YACL,KAAK;AACH,kBAAI,CAAC,UAAU,GAAG,SAAS,MAAM,GAAG;AAClC,yBAAS;AAAA,cACX;AACA;AAAA,YACF,KAAK;AAAA,YACL,KAAK;AAEH;AAAA;AAAA,YAEF;AACE,oBAAM,IAAI,MAAM,yBAAyB,WAAW,QAAQ,EAAE;AAAA,UAClE;AAAA,QACF,CAAC;AACD,YAAI,WAAW,CAAC,UAAU,GAAG,QAAQ,MAAM,IAAI;AAC7C,mBAAS;AAAA,QACX;AAAA,MACF;AAEA,UAAI,UAAU,MAAM,KAAK,MAAM,GAAG;AAChC,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AACA,WAAO,UAAU;AAAA;AAAA;;;AC5DjB,IAAAC,iBAAA;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,aAAa,CAAC,OAAO,YAAY;AACrC,UAAI;AAGF,eAAO,IAAI,MAAM,OAAO,OAAO,EAAE,SAAS;AAAA,MAC5C,SAAS,IAAI;AACX,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO,UAAU;AAAA;AAAA;;;ACVjB;AAAA;AAAA,QAAM,SAAS;AACf,QAAM,aAAa;AACnB,QAAM,EAAE,IAAI,IAAI;AAChB,QAAM,QAAQ;AACd,QAAM,YAAY;AAClB,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,MAAM;AACZ,QAAM,MAAM;AAEZ,QAAM,UAAU,CAAC,SAAS,OAAO,MAAM,YAAY;AACjD,gBAAU,IAAI,OAAO,SAAS,OAAO;AACrC,cAAQ,IAAI,MAAM,OAAO,OAAO;AAEhC,UAAI,MAAM,OAAO,MAAM,MAAM;AAC7B,cAAQ,MAAM;AAAA,QACZ,KAAK;AACH,iBAAO;AACP,kBAAQ;AACR,iBAAO;AACP,iBAAO;AACP,kBAAQ;AACR;AAAA,QACF,KAAK;AACH,iBAAO;AACP,kBAAQ;AACR,iBAAO;AACP,iBAAO;AACP,kBAAQ;AACR;AAAA,QACF;AACE,gBAAM,IAAI,UAAU,uCAAuC;AAAA,MAC/D;AAGA,UAAI,UAAU,SAAS,OAAO,OAAO,GAAG;AACtC,eAAO;AAAA,MACT;AAKA,eAAS,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;AACzC,cAAM,cAAc,MAAM,IAAI,CAAC;AAE/B,YAAI,OAAO;AACX,YAAI,MAAM;AAEV,oBAAY,QAAQ,CAAC,eAAe;AAClC,cAAI,WAAW,WAAW,KAAK;AAC7B,yBAAa,IAAI,WAAW,SAAS;AAAA,UACvC;AACA,iBAAO,QAAQ;AACf,gBAAM,OAAO;AACb,cAAI,KAAK,WAAW,QAAQ,KAAK,QAAQ,OAAO,GAAG;AACjD,mBAAO;AAAA,UACT,WAAW,KAAK,WAAW,QAAQ,IAAI,QAAQ,OAAO,GAAG;AACvD,kBAAM;AAAA,UACR;AAAA,QACF,CAAC;AAID,YAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,OAAO;AACrD,iBAAO;AAAA,QACT;AAIA,aAAK,CAAC,IAAI,YAAY,IAAI,aAAa,SACnC,MAAM,SAAS,IAAI,MAAM,GAAG;AAC9B,iBAAO;AAAA,QACT,WAAW,IAAI,aAAa,SAAS,KAAK,SAAS,IAAI,MAAM,GAAG;AAC9D,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,WAAO,UAAU;AAAA;AAAA;;;AC/EjB;AAAA;AACA,QAAM,UAAU;AAChB,QAAM,MAAM,CAAC,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;AAC7E,WAAO,UAAU;AAAA;AAAA;;;ACHjB;AAAA;AAAA,QAAM,UAAU;AAEhB,QAAM,MAAM,CAAC,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;AAC7E,WAAO,UAAU;AAAA;AAAA;;;ACHjB;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,aAAa,CAAC,IAAI,IAAI,YAAY;AACtC,WAAK,IAAI,MAAM,IAAI,OAAO;AAC1B,WAAK,IAAI,MAAM,IAAI,OAAO;AAC1B,aAAO,GAAG,WAAW,IAAI,OAAO;AAAA,IAClC;AACA,WAAO,UAAU;AAAA;AAAA;;;ACNjB;AAAA;AAGA,QAAM,YAAY;AAClB,QAAM,UAAU;AAChB,WAAO,UAAU,CAAC,UAAU,OAAO,YAAY;AAC7C,YAAM,MAAM,CAAC;AACb,UAAIC,SAAQ;AACZ,UAAI,OAAO;AACX,YAAM,IAAI,SAAS,KAAK,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,OAAO,CAAC;AACxD,iBAAW,WAAW,GAAG;AACvB,cAAM,WAAW,UAAU,SAAS,OAAO,OAAO;AAClD,YAAI,UAAU;AACZ,iBAAO;AACP,cAAI,CAACA,QAAO;AACV,YAAAA,SAAQ;AAAA,UACV;AAAA,QACF,OAAO;AACL,cAAI,MAAM;AACR,gBAAI,KAAK,CAACA,QAAO,IAAI,CAAC;AAAA,UACxB;AACA,iBAAO;AACP,UAAAA,SAAQ;AAAA,QACV;AAAA,MACF;AACA,UAAIA,QAAO;AACT,YAAI,KAAK,CAACA,QAAO,IAAI,CAAC;AAAA,MACxB;AAEA,YAAM,SAAS,CAAC;AAChB,iBAAW,CAAC,KAAK,GAAG,KAAK,KAAK;AAC5B,YAAI,QAAQ,KAAK;AACf,iBAAO,KAAK,GAAG;AAAA,QACjB,WAAW,CAAC,OAAO,QAAQ,EAAE,CAAC,GAAG;AAC/B,iBAAO,KAAK,GAAG;AAAA,QACjB,WAAW,CAAC,KAAK;AACf,iBAAO,KAAK,KAAK,GAAG,EAAE;AAAA,QACxB,WAAW,QAAQ,EAAE,CAAC,GAAG;AACvB,iBAAO,KAAK,KAAK,GAAG,EAAE;AAAA,QACxB,OAAO;AACL,iBAAO,KAAK,GAAG,GAAG,MAAM,GAAG,EAAE;AAAA,QAC/B;AAAA,MACF;AACA,YAAM,aAAa,OAAO,KAAK,MAAM;AACrC,YAAM,WAAW,OAAO,MAAM,QAAQ,WAAW,MAAM,MAAM,OAAO,KAAK;AACzE,aAAO,WAAW,SAAS,SAAS,SAAS,aAAa;AAAA,IAC5D;AAAA;AAAA;;;AC9CA;AAAA;AAAA,QAAM,QAAQ;AACd,QAAM,aAAa;AACnB,QAAM,EAAE,IAAI,IAAI;AAChB,QAAM,YAAY;AAClB,QAAM,UAAU;AAsChB,QAAM,SAAS,CAAC,KAAK,KAAK,UAAU,CAAC,MAAM;AACzC,UAAI,QAAQ,KAAK;AACf,eAAO;AAAA,MACT;AAEA,YAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,YAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,UAAI,aAAa;AAEjB,YAAO,YAAW,aAAa,IAAI,KAAK;AACtC,mBAAW,aAAa,IAAI,KAAK;AAC/B,gBAAM,QAAQ,aAAa,WAAW,WAAW,OAAO;AACxD,uBAAa,cAAc,UAAU;AACrC,cAAI,OAAO;AACT,qBAAS;AAAA,UACX;AAAA,QACF;AAKA,YAAI,YAAY;AACd,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,QAAM,+BAA+B,CAAC,IAAI,WAAW,WAAW,CAAC;AACjE,QAAM,iBAAiB,CAAC,IAAI,WAAW,SAAS,CAAC;AAEjD,QAAM,eAAe,CAAC,KAAK,KAAK,YAAY;AAC1C,UAAI,QAAQ,KAAK;AACf,eAAO;AAAA,MACT;AAEA,UAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,YAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,iBAAO;AAAA,QACT,WAAW,QAAQ,mBAAmB;AACpC,gBAAM;AAAA,QACR,OAAO;AACL,gBAAM;AAAA,QACR;AAAA,MACF;AAEA,UAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,YAAI,QAAQ,mBAAmB;AAC7B,iBAAO;AAAA,QACT,OAAO;AACL,gBAAM;AAAA,QACR;AAAA,MACF;AAEA,YAAM,QAAQ,oBAAI,IAAI;AACtB,UAAI,IAAI;AACR,iBAAW,KAAK,KAAK;AACnB,YAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,eAAK,SAAS,IAAI,GAAG,OAAO;AAAA,QAC9B,WAAW,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AACpD,eAAK,QAAQ,IAAI,GAAG,OAAO;AAAA,QAC7B,OAAO;AACL,gBAAM,IAAI,EAAE,MAAM;AAAA,QACpB;AAAA,MACF;AAEA,UAAI,MAAM,OAAO,GAAG;AAClB,eAAO;AAAA,MACT;AAEA,UAAI;AACJ,UAAI,MAAM,IAAI;AACZ,mBAAW,QAAQ,GAAG,QAAQ,GAAG,QAAQ,OAAO;AAChD,YAAI,WAAW,GAAG;AAChB,iBAAO;AAAA,QACT,WAAW,aAAa,MAAM,GAAG,aAAa,QAAQ,GAAG,aAAa,OAAO;AAC3E,iBAAO;AAAA,QACT;AAAA,MACF;AAGA,iBAAW,MAAM,OAAO;AACtB,YAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,iBAAO;AAAA,QACT;AAEA,YAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,iBAAO;AAAA,QACT;AAEA,mBAAW,KAAK,KAAK;AACnB,cAAI,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,OAAO,GAAG;AACtC,mBAAO;AAAA,UACT;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAEA,UAAI,QAAQ;AACZ,UAAI,UAAU;AAGd,UAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAC5C,UAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAE5C,UAAI,gBAAgB,aAAa,WAAW,WAAW,KACnD,GAAG,aAAa,OAAO,aAAa,WAAW,CAAC,MAAM,GAAG;AAC3D,uBAAe;AAAA,MACjB;AAEA,iBAAW,KAAK,KAAK;AACnB,mBAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,mBAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,YAAI,IAAI;AACN,cAAI,cAAc;AAChB,gBAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,6BAAe;AAAA,YACjB;AAAA,UACF;AACA,cAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,qBAAS,SAAS,IAAI,GAAG,OAAO;AAChC,gBAAI,WAAW,KAAK,WAAW,IAAI;AACjC,qBAAO;AAAA,YACT;AAAA,UACF,WAAW,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,mBAAO;AAAA,UACT;AAAA,QACF;AACA,YAAI,IAAI;AACN,cAAI,cAAc;AAChB,gBAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,6BAAe;AAAA,YACjB;AAAA,UACF;AACA,cAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,oBAAQ,QAAQ,IAAI,GAAG,OAAO;AAC9B,gBAAI,UAAU,KAAK,UAAU,IAAI;AAC/B,qBAAO;AAAA,YACT;AAAA,UACF,WAAW,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,mBAAO;AAAA,UACT;AAAA,QACF;AACA,YAAI,CAAC,EAAE,aAAa,MAAM,OAAO,aAAa,GAAG;AAC/C,iBAAO;AAAA,QACT;AAAA,MACF;AAKA,UAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,eAAO;AAAA,MACT;AAEA,UAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,eAAO;AAAA,MACT;AAKA,UAAI,gBAAgB,cAAc;AAChC,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AAGA,QAAM,WAAW,CAAC,GAAG,GAAG,YAAY;AAClC,UAAI,CAAC,GAAG;AACN,eAAO;AAAA,MACT;AACA,YAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,aAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AAAA,IACN;AAGA,QAAM,UAAU,CAAC,GAAG,GAAG,YAAY;AACjC,UAAI,CAAC,GAAG;AACN,eAAO;AAAA,MACT;AACA,YAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,aAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AAAA,IACN;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACtPjB,IAAAC,kBAAA;AAAA;AACA,QAAM,aAAa;AACnB,QAAM,YAAY;AAClB,QAAM,SAAS;AACf,QAAM,cAAc;AACpB,QAAM,QAAQ;AACd,QAAM,QAAQ;AACd,QAAM,QAAQ;AACd,QAAM,MAAM;AACZ,QAAM,OAAO;AACb,QAAM,QAAQ;AACd,QAAM,QAAQ;AACd,QAAM,QAAQ;AACd,QAAM,aAAa;AACnB,QAAM,UAAU;AAChB,QAAM,WAAW;AACjB,QAAM,eAAe;AACrB,QAAM,eAAe;AACrB,QAAM,OAAO;AACb,QAAM,QAAQ;AACd,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,QAAM,SAAS;AACf,QAAM,aAAa;AACnB,QAAM,QAAQ;AACd,QAAM,YAAY;AAClB,QAAM,gBAAgB;AACtB,QAAM,gBAAgB;AACtB,QAAM,gBAAgB;AACtB,QAAM,aAAa;AACnB,QAAM,aAAa;AACnB,QAAM,UAAU;AAChB,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,QAAM,aAAa;AACnB,QAAM,gBAAgB;AACtB,QAAM,SAAS;AACf,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,IAAI,WAAW;AAAA,MACf,KAAK,WAAW;AAAA,MAChB,QAAQ,WAAW;AAAA,MACnB,qBAAqB,UAAU;AAAA,MAC/B,eAAe,UAAU;AAAA,MACzB,oBAAoB,YAAY;AAAA,MAChC,qBAAqB,YAAY;AAAA,IACnC;AAAA;AAAA;;;ACxFA,mBAuBY,eAeN,SAwFA,YASA,aAKO,mBA6BA,sBAaP,mBACA,oBAsBO,0BAKA;AAlNb,IAAAC,eAAA;;oBAAmB;AAuBnB,KAAA,SAAYC,gBAAa;AAEvB,MAAAA,eAAA,MAAA,IAAA;AAEA,MAAAA,eAAA,OAAA,IAAA;AAEA,MAAAA,eAAA,QAAA,IAAA;AAEA,MAAAA,eAAA,OAAA,IAAA;AAEA,MAAAA,eAAA,MAAA,IAAA;AAEA,MAAAA,eAAA,QAAA,IAAA;IACF,GAbY,kBAAA,gBAAa,CAAA,EAAA;AAezB,IAAM,UAAmD;MACvD,CAAC,cAAc,IAAI,GAAG;QACpB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,MAAM;QAClB,OAAO,CAAC,WAAY,SAAU;QAC9B,cAAc,CAAC,oBAAoC,IAAI;;MAEzD,CAAC,cAAc,KAAK,GAAG;QACrB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,MAAM;QAClB,OAAO,CAAC,SAAU;QAClB,cAAc,CAAC,oBAAmC;AAAA,cAAAC;AAChD,iBAAA,cAAAC,QAAO,IAAGD,MAAA,cAAAC,QAAO,OAAO,eAAe,OAAC,QAAAD,QAAA,SAAAA,MAAI,IAAI,OAAO,IAAI,IAAI,OAAO,IAAI;QAAI;;MAElF,CAAC,cAAc,KAAK,GAAG;QACrB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,IAAI,OAAO;QACvB,OAAO,CAAC,SAAU;QAClB,cAAc,CAAC,oBAAoC,IAAI;QACvD,eAAe;UACb;YACE,aAAa;YACb,YAAY;YACZ,WAAW;YACX,cAAc;;;;MAIpB,CAAC,cAAc,MAAM,GAAG;QACtB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,OAAO;QACnB,OAAO,CAAC,SAAU;QAClB,cAAc,CAAC,qBAAqC;;MAEtD,CAAC,cAAc,IAAI,GAAG;QACpB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,OAAO;QACnB,OAAO,CAAC,SAAU;QAClB,cAAc,CAAC,qBAAqC;QACpD,eAAe;UACb;YACE,aAAa;YACb,YAAY;YACZ,WAAW;YACX,cAAc;;;;MAIpB,CAAC,cAAc,MAAM,GAAG;QACtB,IAAI,cAAc;QAClB,aAAa;QACb,aAAa;QACb,oBAAoB;QACpB,SAAS;QACT,YAAY,OAAO;QACnB,OAAO,CAAC,SAAU;QAClB,cAAc,CAAC,qBAAqC;QACpD,eAAe;UACb;YACE,aAAa;YACb,YAAY;YACZ,WAAW;YACX,cAAc;;;;;AAMtB,IAAM,aAAa;MACjB,MAAM,cAAc;MACpB,UAAU,cAAc;MACxB,eAAe,cAAc;MAC7B,UAAU,cAAc;MACxB,MAAM,cAAc;MACpB,QAAQ,cAAc;;AAGxB,IAAM,cAA6B,OAAO,OAAO,OAAO;AAKjD,IAAM,oBAAoB;AA6B1B,IAAM,uBAAuB,CAAC,iBAAwD;AAC3F,YAAM,SAAS,YAAY,KAAK,OAAK,EAAE,uBAAuB,YAAY;AAC1E,UAAI;AAAQ,eAAO;AACnB,YAAM,KAAK,gBAAgB;AAC3B,YAAM,cAAc,YAAY,KAAK,OAAK,EAAE,gBAAgB,EAAE;AAC9D,aAAO;IACT;AAOA,IAAM,oBAA8B,CAAA;AACpC,IAAM,qBAAqD,CAAA;AAE3D,eAAWE,OAAM,SAAS;AACxB,YAAM,cAAc,QAAQA,GAAE;AAC9B,YAAM,EAAE,cAAa,IAAK;AAC1B,UAAI,eAAe;AACjB,iBAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,gBAAM,OAAO,cAAc,CAAC;AAC5B,4BAAkB,KAAK,KAAK,WAAW;AACvC,6BAAmB,KAAK,WAAW,IAAI,mBACrC,KAAK,YAAY,QAAQ,MAAM,EAAE,CAAC,IACnC,OAAA,OAAA,EACC,YAAW,GACR,IAAI;QAEX;MACF;IACF;AAKO,IAAM,2BAA2B,MAAgB;AAKjD,IAAM,yBAAyB,CAAC,SACrC,mBAAmB,KAAK,YAAW,CAAE;;;;;AC5LhC,SAAS,UAAU,GAAG,GAAG;AAC9B,MAAI,OAAO,MAAM,cAAc,MAAM;AACjC,UAAM,IAAI,UAAU,yBAAyB,OAAO,CAAC,IAAI,+BAA+B;AAC5F,gBAAc,GAAG,CAAC;AAClB,WAAS,KAAK;AAAE,SAAK,cAAc;AAAA,EAAG;AACtC,IAAE,YAAY,MAAM,OAAO,OAAO,OAAO,CAAC,KAAK,GAAG,YAAY,EAAE,WAAW,IAAI,GAAG;AACpF;AAqFO,SAASC,WAAU,SAAS,YAAY,GAAG,WAAW;AAC3D,WAAS,MAAM,OAAO;AAAE,WAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU,SAAS;AAAE,cAAQ,KAAK;AAAA,IAAG,CAAC;AAAA,EAAG;AAC3G,SAAO,KAAK,MAAM,IAAI,UAAU,SAAU,SAAS,QAAQ;AACvD,aAAS,UAAU,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,KAAK,KAAK,CAAC;AAAA,MAAG,SAAS,GAAG;AAAE,eAAO,CAAC;AAAA,MAAG;AAAA,IAAE;AAC1F,aAAS,SAAS,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,OAAO,EAAE,KAAK,CAAC;AAAA,MAAG,SAAS,GAAG;AAAE,eAAO,CAAC;AAAA,MAAG;AAAA,IAAE;AAC7F,aAAS,KAAK,QAAQ;AAAE,aAAO,OAAO,QAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;AAAA,IAAG;AAC7G,UAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAC,CAAC,GAAG,KAAK,CAAC;AAAA,EACxE,CAAC;AACH;AAEO,SAAS,YAAY,SAAS,MAAM;AACzC,MAAI,IAAI,EAAE,OAAO,GAAG,MAAM,WAAW;AAAE,QAAI,EAAE,CAAC,IAAI,EAAG,OAAM,EAAE,CAAC;AAAG,WAAO,EAAE,CAAC;AAAA,EAAG,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,IAAI,OAAO,QAAQ,OAAO,aAAa,aAAa,WAAW,QAAQ,SAAS;AAC/L,SAAO,EAAE,OAAO,KAAK,CAAC,GAAG,EAAE,OAAO,IAAI,KAAK,CAAC,GAAG,EAAE,QAAQ,IAAI,KAAK,CAAC,GAAG,OAAO,WAAW,eAAe,EAAE,OAAO,QAAQ,IAAI,WAAW;AAAE,WAAO;AAAA,EAAM,IAAI;AAC1J,WAAS,KAAK,GAAG;AAAE,WAAO,SAAU,GAAG;AAAE,aAAO,KAAK,CAAC,GAAG,CAAC,CAAC;AAAA,IAAG;AAAA,EAAG;AACjE,WAAS,KAAK,IAAI;AACd,QAAI,EAAG,OAAM,IAAI,UAAU,iCAAiC;AAC5D,WAAO,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,IAAI,KAAK,EAAG,KAAI;AAC1C,UAAI,IAAI,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,IAAI,EAAE,QAAQ,IAAI,GAAG,CAAC,IAAI,EAAE,OAAO,OAAO,IAAI,EAAE,QAAQ,MAAM,EAAE,KAAK,CAAC,GAAG,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,GAAG,GAAG,CAAC,CAAC,GAAG,KAAM,QAAO;AAC3J,UAAI,IAAI,GAAG,EAAG,MAAK,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,KAAK;AACtC,cAAQ,GAAG,CAAC,GAAG;AAAA,QACX,KAAK;AAAA,QAAG,KAAK;AAAG,cAAI;AAAI;AAAA,QACxB,KAAK;AAAG,YAAE;AAAS,iBAAO,EAAE,OAAO,GAAG,CAAC,GAAG,MAAM,MAAM;AAAA,QACtD,KAAK;AAAG,YAAE;AAAS,cAAI,GAAG,CAAC;AAAG,eAAK,CAAC,CAAC;AAAG;AAAA,QACxC,KAAK;AAAG,eAAK,EAAE,IAAI,IAAI;AAAG,YAAE,KAAK,IAAI;AAAG;AAAA,QACxC;AACI,cAAI,EAAE,IAAI,EAAE,MAAM,IAAI,EAAE,SAAS,KAAK,EAAE,EAAE,SAAS,CAAC,OAAO,GAAG,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI;AAAE,gBAAI;AAAG;AAAA,UAAU;AAC3G,cAAI,GAAG,CAAC,MAAM,MAAM,CAAC,KAAM,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC,IAAK;AAAE,cAAE,QAAQ,GAAG,CAAC;AAAG;AAAA,UAAO;AACrF,cAAI,GAAG,CAAC,MAAM,KAAK,EAAE,QAAQ,EAAE,CAAC,GAAG;AAAE,cAAE,QAAQ,EAAE,CAAC;AAAG,gBAAI;AAAI;AAAA,UAAO;AACpE,cAAI,KAAK,EAAE,QAAQ,EAAE,CAAC,GAAG;AAAE,cAAE,QAAQ,EAAE,CAAC;AAAG,cAAE,IAAI,KAAK,EAAE;AAAG;AAAA,UAAO;AAClE,cAAI,EAAE,CAAC,EAAG,GAAE,IAAI,IAAI;AACpB,YAAE,KAAK,IAAI;AAAG;AAAA,MACtB;AACA,WAAK,KAAK,KAAK,SAAS,CAAC;AAAA,IAC7B,SAAS,GAAG;AAAE,WAAK,CAAC,GAAG,CAAC;AAAG,UAAI;AAAA,IAAG,UAAE;AAAU,UAAI,IAAI;AAAA,IAAG;AACzD,QAAI,GAAG,CAAC,IAAI,EAAG,OAAM,GAAG,CAAC;AAAG,WAAO,EAAE,OAAO,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,QAAQ,MAAM,KAAK;AAAA,EACnF;AACF;AAkBO,SAAS,SAAS,GAAG;AAC1B,MAAI,IAAI,OAAO,WAAW,cAAc,OAAO,UAAU,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI;AAC5E,MAAI,EAAG,QAAO,EAAE,KAAK,CAAC;AACtB,MAAI,KAAK,OAAO,EAAE,WAAW,SAAU,QAAO;AAAA,IAC1C,MAAM,WAAY;AACd,UAAI,KAAK,KAAK,EAAE,OAAQ,KAAI;AAC5B,aAAO,EAAE,OAAO,KAAK,EAAE,GAAG,GAAG,MAAM,CAAC,EAAE;AAAA,IAC1C;AAAA,EACJ;AACA,QAAM,IAAI,UAAU,IAAI,4BAA4B,iCAAiC;AACvF;AAEO,SAAS,OAAO,GAAG,GAAG;AAC3B,MAAI,IAAI,OAAO,WAAW,cAAc,EAAE,OAAO,QAAQ;AACzD,MAAI,CAAC,EAAG,QAAO;AACf,MAAI,IAAI,EAAE,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG;AAC/B,MAAI;AACA,YAAQ,MAAM,UAAU,MAAM,MAAM,EAAE,IAAI,EAAE,KAAK,GAAG,KAAM,IAAG,KAAK,EAAE,KAAK;AAAA,EAC7E,SACO,OAAO;AAAE,QAAI,EAAE,MAAa;AAAA,EAAG,UACtC;AACI,QAAI;AACA,UAAI,KAAK,CAAC,EAAE,SAAS,IAAI,EAAE,QAAQ,GAAI,GAAE,KAAK,CAAC;AAAA,IACnD,UACA;AAAU,UAAI,EAAG,OAAM,EAAE;AAAA,IAAO;AAAA,EACpC;AACA,SAAO;AACT;AAkBO,SAAS,cAAc,IAAIC,OAAM,MAAM;AAC5C,MAAI,QAAQ,UAAU,WAAW,EAAG,UAAS,IAAI,GAAG,IAAIA,MAAK,QAAQ,IAAI,IAAI,GAAG,KAAK;AACjF,QAAI,MAAM,EAAE,KAAKA,QAAO;AACpB,UAAI,CAAC,GAAI,MAAK,MAAM,UAAU,MAAM,KAAKA,OAAM,GAAG,CAAC;AACnD,SAAG,CAAC,IAAIA,MAAK,CAAC;AAAA,IAClB;AAAA,EACJ;AACA,SAAO,GAAG,OAAO,MAAM,MAAM,UAAU,MAAM,KAAKA,KAAI,CAAC;AACzD;AAEO,SAAS,QAAQ,GAAG;AACzB,SAAO,gBAAgB,WAAW,KAAK,IAAI,GAAG,QAAQ,IAAI,QAAQ,CAAC;AACrE;AAEO,SAAS,iBAAiB,SAAS,YAAY,WAAW;AAC/D,MAAI,CAAC,OAAO,cAAe,OAAM,IAAI,UAAU,sCAAsC;AACrF,MAAI,IAAI,UAAU,MAAM,SAAS,cAAc,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC;AAC5D,SAAO,IAAI,OAAO,QAAQ,OAAO,kBAAkB,aAAa,gBAAgB,QAAQ,SAAS,GAAG,KAAK,MAAM,GAAG,KAAK,OAAO,GAAG,KAAK,UAAU,WAAW,GAAG,EAAE,OAAO,aAAa,IAAI,WAAY;AAAE,WAAO;AAAA,EAAM,GAAG;AACtN,WAAS,YAAY,GAAG;AAAE,WAAO,SAAU,GAAG;AAAE,aAAO,QAAQ,QAAQ,CAAC,EAAE,KAAK,GAAG,MAAM;AAAA,IAAG;AAAA,EAAG;AAC9F,WAAS,KAAK,GAAG,GAAG;AAAE,QAAI,EAAE,CAAC,GAAG;AAAE,QAAE,CAAC,IAAI,SAAU,GAAG;AAAE,eAAO,IAAI,QAAQ,SAAU,GAAG,GAAG;AAAE,YAAE,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,OAAO,GAAG,CAAC;AAAA,QAAG,CAAC;AAAA,MAAG;AAAG,UAAI,EAAG,GAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AAAA,IAAG;AAAA,EAAE;AACvK,WAAS,OAAO,GAAG,GAAG;AAAE,QAAI;AAAE,WAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAAA,IAAG,SAAS,GAAG;AAAE,aAAO,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC;AAAA,IAAG;AAAA,EAAE;AACjF,WAAS,KAAK,GAAG;AAAE,MAAE,iBAAiB,UAAU,QAAQ,QAAQ,EAAE,MAAM,CAAC,EAAE,KAAK,SAAS,MAAM,IAAI,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC;AAAA,EAAG;AACvH,WAAS,QAAQ,OAAO;AAAE,WAAO,QAAQ,KAAK;AAAA,EAAG;AACjD,WAAS,OAAO,OAAO;AAAE,WAAO,SAAS,KAAK;AAAA,EAAG;AACjD,WAAS,OAAO,GAAG,GAAG;AAAE,QAAI,EAAE,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,OAAQ,QAAO,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AAAA,EAAG;AACnF;AAQO,SAAS,cAAc,GAAG;AAC/B,MAAI,CAAC,OAAO,cAAe,OAAM,IAAI,UAAU,sCAAsC;AACrF,MAAI,IAAI,EAAE,OAAO,aAAa,GAAG;AACjC,SAAO,IAAI,EAAE,KAAK,CAAC,KAAK,IAAI,OAAO,aAAa,aAAa,SAAS,CAAC,IAAI,EAAE,OAAO,QAAQ,EAAE,GAAG,IAAI,CAAC,GAAG,KAAK,MAAM,GAAG,KAAK,OAAO,GAAG,KAAK,QAAQ,GAAG,EAAE,OAAO,aAAa,IAAI,WAAY;AAAE,WAAO;AAAA,EAAM,GAAG;AAC9M,WAAS,KAAK,GAAG;AAAE,MAAE,CAAC,IAAI,EAAE,CAAC,KAAK,SAAU,GAAG;AAAE,aAAO,IAAI,QAAQ,SAAU,SAAS,QAAQ;AAAE,YAAI,EAAE,CAAC,EAAE,CAAC,GAAG,OAAO,SAAS,QAAQ,EAAE,MAAM,EAAE,KAAK;AAAA,MAAG,CAAC;AAAA,IAAG;AAAA,EAAG;AAC/J,WAAS,OAAO,SAAS,QAAQ,GAAG,GAAG;AAAE,YAAQ,QAAQ,CAAC,EAAE,KAAK,SAASC,IAAG;AAAE,cAAQ,EAAE,OAAOA,IAAG,MAAM,EAAE,CAAC;AAAA,IAAG,GAAG,MAAM;AAAA,EAAG;AAC7H;AA5PA,IAgBI;AAhBJ;AAAA;AAgBA,IAAI,gBAAgB,SAAS,GAAG,GAAG;AACjC,sBAAgB,OAAO,kBAClB,EAAE,WAAW,CAAC,EAAE,aAAa,SAAS,SAAUC,IAAGC,IAAG;AAAE,QAAAD,GAAE,YAAYC;AAAA,MAAG,KAC1E,SAAUD,IAAGC,IAAG;AAAE,iBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,CAAAD,GAAE,CAAC,IAAIC,GAAE,CAAC;AAAA,MAAG;AACpG,aAAO,cAAc,GAAG,CAAC;AAAA,IAC3B;AAAA;AAAA;;;ACjBM,SAAU,WAAW,OAAU;AACnC,SAAO,OAAO,UAAU;AAC1B;AAFA;;;;;;ACKM,SAAU,iBAAoB,YAAgC;AAClE,MAAM,SAAS,SAAC,UAAa;AAC3B,UAAM,KAAK,QAAQ;AACnB,aAAS,QAAQ,IAAI,MAAK,EAAG;EAC/B;AAEA,MAAM,WAAW,WAAW,MAAM;AAClC,WAAS,YAAY,OAAO,OAAO,MAAM,SAAS;AAClD,WAAS,UAAU,cAAc;AACjC,SAAO;AACT;AAVA;;;;;;ACTA,IAkBa;AAlBb;;;AAkBO,IAAM,sBAA+C,iBAC1D,SAAC,QAAM;AACL,aAAA,SAAS,wBAAmC,QAA0B;AACpE,eAAO,IAAI;AACX,aAAK,UAAU,SACR,OAAO,SAAM,8CACxB,OAAO,IAAI,SAAC,KAAK,GAAC;AAAK,iBAAG,IAAI,IAAC,OAAK,IAAI,SAAQ;QAAzB,CAA6B,EAAE,KAAK,MAAM,IACzD;AACJ,aAAK,OAAO;AACZ,aAAK,SAAS;MAChB;IARA,CAQC;;;;;ACvBC,SAAU,UAAa,KAA6B,MAAO;AAC/D,MAAI,KAAK;AACP,QAAM,QAAQ,IAAI,QAAQ,IAAI;AAC9B,SAAK,SAAS,IAAI,OAAO,OAAO,CAAC;;AAErC;AALA;;;;;;ACqMM,SAAU,eAAe,OAAU;AACvC,SACE,iBAAiB,gBAChB,SAAS,YAAY,SAAS,WAAW,MAAM,MAAM,KAAK,WAAW,MAAM,GAAG,KAAK,WAAW,MAAM,WAAW;AAEpH;AAEA,SAAS,cAAc,WAAwC;AAC7D,MAAI,WAAW,SAAS,GAAG;AACzB,cAAS;SACJ;AACL,cAAU,YAAW;;AAEzB;IAtMA,cAuLa;;;;AAxMb;AACA;AAEA;AAcA,IAAA,eAAA,WAAA;AAyBE,eAAAC,cAAoB,iBAA4B;AAA5B,aAAA,kBAAA;AAdb,aAAA,SAAS;AAER,aAAA,aAAmD;AAMnD,aAAA,cAAqD;MAMV;AAQnD,MAAAA,cAAA,UAAA,cAAA,WAAA;;AACE,YAAI;AAEJ,YAAI,CAAC,KAAK,QAAQ;AAChB,eAAK,SAAS;AAGN,cAAA,aAAe,KAAI;AAC3B,cAAI,YAAY;AACd,iBAAK,aAAa;AAClB,gBAAI,MAAM,QAAQ,UAAU,GAAG;;AAC7B,yBAAqB,eAAA,SAAA,UAAU,GAAA,iBAAA,aAAA,KAAA,GAAA,CAAA,eAAA,MAAA,iBAAA,aAAA,KAAA,GAAE;AAA5B,sBAAM,WAAM,eAAA;AACf,2BAAO,OAAO,IAAI;;;;;;;;;;;mBAEf;AACL,yBAAW,OAAO,IAAI;;;AAIlB,cAAiB,mBAAqB,KAAI;AAClD,cAAI,WAAW,gBAAgB,GAAG;AAChC,gBAAI;AACF,+BAAgB;qBACT,GAAG;AACV,uBAAS,aAAa,sBAAsB,EAAE,SAAS,CAAC,CAAC;;;AAIrD,cAAA,cAAgB,KAAI;AAC5B,cAAI,aAAa;AACf,iBAAK,cAAc;;AACnB,uBAAwB,gBAAA,SAAA,WAAW,GAAA,kBAAA,cAAA,KAAA,GAAA,CAAA,gBAAA,MAAA,kBAAA,cAAA,KAAA,GAAE;AAAhC,oBAAM,YAAS,gBAAA;AAClB,oBAAI;AACF,gCAAc,SAAS;yBAChB,KAAK;AACZ,2BAAS,WAAM,QAAN,WAAM,SAAN,SAAU,CAAA;AACnB,sBAAI,eAAe,qBAAqB;AACtC,6BAAM,cAAA,cAAA,CAAA,GAAA,OAAO,MAAM,CAAA,GAAA,OAAK,IAAI,MAAM,CAAA;yBAC7B;AACL,2BAAO,KAAK,GAAG;;;;;;;;;;;;;;AAMvB,cAAI,QAAQ;AACV,kBAAM,IAAI,oBAAoB,MAAM;;;MAG1C;AAoBA,MAAAA,cAAA,UAAA,MAAA,SAAI,UAAuB;;AAGzB,YAAI,YAAY,aAAa,MAAM;AACjC,cAAI,KAAK,QAAQ;AAGf,0BAAc,QAAQ;iBACjB;AACL,gBAAI,oBAAoBA,eAAc;AAGpC,kBAAI,SAAS,UAAU,SAAS,WAAW,IAAI,GAAG;AAChD;;AAEF,uBAAS,WAAW,IAAI;;AAE1B,aAAC,KAAK,eAAcC,MAAA,KAAK,iBAAW,QAAAA,QAAA,SAAAA,MAAI,CAAA,GAAI,KAAK,QAAQ;;;MAG/D;AAOQ,MAAAD,cAAA,UAAA,aAAR,SAAmB,QAAoB;AAC7B,YAAA,aAAe,KAAI;AAC3B,eAAO,eAAe,UAAW,MAAM,QAAQ,UAAU,KAAK,WAAW,SAAS,MAAM;MAC1F;AASQ,MAAAA,cAAA,UAAA,aAAR,SAAmB,QAAoB;AAC7B,YAAA,aAAe,KAAI;AAC3B,aAAK,aAAa,MAAM,QAAQ,UAAU,KAAK,WAAW,KAAK,MAAM,GAAG,cAAc,aAAa,CAAC,YAAY,MAAM,IAAI;MAC5H;AAMQ,MAAAA,cAAA,UAAA,gBAAR,SAAsB,QAAoB;AAChC,YAAA,aAAe,KAAI;AAC3B,YAAI,eAAe,QAAQ;AACzB,eAAK,aAAa;mBACT,MAAM,QAAQ,UAAU,GAAG;AACpC,oBAAU,YAAY,MAAM;;MAEhC;AAgBA,MAAAA,cAAA,UAAA,SAAA,SAAO,UAAsC;AACnC,YAAA,cAAgB,KAAI;AAC5B,uBAAe,UAAU,aAAa,QAAQ;AAE9C,YAAI,oBAAoBA,eAAc;AACpC,mBAAS,cAAc,IAAI;;MAE/B;AAlLc,MAAAA,cAAA,QAAS,WAAA;AACrB,YAAM,QAAQ,IAAIA,cAAY;AAC9B,cAAM,SAAS;AACf,eAAO;MACT,EAAE;AA+KJ,aAAAA;MArLA;AAuLO,IAAM,qBAAqB,aAAa;;;;;ACjM/C,IAAa;AAAb;;AAAO,IAAM,SAAuB;MAClC,kBAAkB;MAClB,uBAAuB;MACvB,SAAS;MACT,uCAAuC;MACvC,0BAA0B;;;;;;ICGf;;;;AAAN,IAAM,kBAAmC;MAG9C,YAAA,SAAW,SAAqB,SAAgB;AAAE,YAAA,OAAA,CAAA;iBAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAAO;AAAP,eAAA,KAAA,CAAA,IAAA,UAAA,EAAA;;AACxC,YAAA,WAAa,gBAAe;AACpC,YAAI,aAAQ,QAAR,aAAQ,SAAA,SAAR,SAAU,YAAY;AACxB,iBAAO,SAAS,WAAU,MAAnB,UAAQ,cAAA,CAAY,SAAS,OAAO,GAAA,OAAK,IAAI,CAAA,CAAA;;AAEtD,eAAO,WAAU,MAAA,QAAA,cAAA,CAAC,SAAS,OAAO,GAAA,OAAK,IAAI,CAAA,CAAA;MAC7C;MACA,cAAA,SAAa,QAAM;AACT,YAAA,WAAa,gBAAe;AACpC,iBAAQ,aAAQ,QAAR,aAAQ,SAAA,SAAR,SAAU,iBAAgB,cAAc,MAAa;MAC/D;MACA,UAAU;;;;;;ACjBN,SAAU,qBAAqB,KAAQ;AAC3C,kBAAgB,WAAW,WAAA;AACjB,QAAA,mBAAqB,OAAM;AACnC,QAAI,kBAAkB;AAEpB,uBAAiB,GAAG;WACf;AAEL,YAAM;;EAEV,CAAC;AACH;AAvBA;;;AACA;;;;;ACAM,SAAU,OAAI;AAAK;AAAzB;;;;;;ACaM,SAAU,kBAAkB,OAAU;AAC1C,SAAO,mBAAmB,KAAK,QAAW,KAAK;AACjD;AAOM,SAAU,iBAAoB,OAAQ;AAC1C,SAAO,mBAAmB,KAAK,OAAO,MAAS;AACjD;AAQM,SAAU,mBAAmB,MAAuB,OAAY,OAAU;AAC9E,SAAO;IACL;IACA;IACA;;AAEJ;AAhCA,IAAa;AAAb;;AAAO,IAAM,wBAAyB,WAAA;AAAM,aAAA,mBAAmB,KAAK,QAAW,MAAS;IAA5C,EAAsE;;;;;ACI5G,SAAU,aAAa,IAAc;AACzC,MAAI,OAAO,uCAAuC;AAChD,QAAM,SAAS,CAAC;AAChB,QAAI,QAAQ;AACV,gBAAU,EAAE,aAAa,OAAO,OAAO,KAAI;;AAE7C,OAAE;AACF,QAAI,QAAQ;AACJ,UAAAE,MAAyB,SAAvB,cAAWA,IAAA,aAAE,QAAKA,IAAA;AAC1B,gBAAU;AACV,UAAI,aAAa;AACf,cAAM;;;SAGL;AAGL,OAAE;;AAEN;AAMM,SAAU,aAAa,KAAQ;AACnC,MAAI,OAAO,yCAAyC,SAAS;AAC3D,YAAQ,cAAc;AACtB,YAAQ,QAAQ;;AAEpB;AAzCA,IAEI;AAFJ;;;AAEA,IAAI,UAAuD;;;;;AC+I3D,SAAS,KAAyC,IAAQ,SAAY;AACpE,SAAO,MAAM,KAAK,IAAI,OAAO;AAC/B;AAwFA,SAAS,qBAAqB,OAAU;AACtC,MAAI,OAAO,uCAAuC;AAChD,iBAAa,KAAK;SACb;AAGL,yBAAqB,KAAK;;AAE9B;AAQA,SAAS,oBAAoB,KAAQ;AACnC,QAAM;AACR;AAOA,SAAS,0BAA0B,cAA2C,YAA2B;AAC/F,MAAA,wBAA0B,OAAM;AACxC,2BAAyB,gBAAgB,WAAW,WAAA;AAAM,WAAA,sBAAsB,cAAc,UAAU;EAA9C,CAA+C;AAC3G;IAnPA,YA2HM,OAUN,kBAuCA,gBA8Ea;;;;AA9Qb;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AAYA,IAAA,aAAA,SAAA,QAAA;AAAmC,gBAAAC,aAAA,MAAA;AA6BjC,eAAAA,YAAY,aAA6C;AAAzD,YAAA,QACE,OAAA,KAAA,IAAA,KAAO;AATC,cAAA,YAAqB;AAU7B,YAAI,aAAa;AACf,gBAAK,cAAc;AAGnB,cAAI,eAAe,WAAW,GAAG;AAC/B,wBAAY,IAAI,KAAI;;eAEjB;AACL,gBAAK,cAAc;;;MAEvB;AAzBO,MAAAA,YAAA,SAAP,SAAiB,MAAwB,OAA2B,UAAqB;AACvF,eAAO,IAAI,eAAe,MAAM,OAAO,QAAQ;MACjD;AAgCA,MAAAA,YAAA,UAAA,OAAA,SAAK,OAAS;AACZ,YAAI,KAAK,WAAW;AAClB,oCAA0B,iBAAiB,KAAK,GAAG,IAAI;eAClD;AACL,eAAK,MAAM,KAAM;;MAErB;AASA,MAAAA,YAAA,UAAA,QAAA,SAAM,KAAS;AACb,YAAI,KAAK,WAAW;AAClB,oCAA0B,kBAAkB,GAAG,GAAG,IAAI;eACjD;AACL,eAAK,YAAY;AACjB,eAAK,OAAO,GAAG;;MAEnB;AAQA,MAAAA,YAAA,UAAA,WAAA,WAAA;AACE,YAAI,KAAK,WAAW;AAClB,oCAA0B,uBAAuB,IAAI;eAChD;AACL,eAAK,YAAY;AACjB,eAAK,UAAS;;MAElB;AAEA,MAAAA,YAAA,UAAA,cAAA,WAAA;AACE,YAAI,CAAC,KAAK,QAAQ;AAChB,eAAK,YAAY;AACjB,iBAAA,UAAM,YAAW,KAAA,IAAA;AACjB,eAAK,cAAc;;MAEvB;AAEU,MAAAA,YAAA,UAAA,QAAV,SAAgB,OAAQ;AACtB,aAAK,YAAY,KAAK,KAAK;MAC7B;AAEU,MAAAA,YAAA,UAAA,SAAV,SAAiB,KAAQ;AACvB,YAAI;AACF,eAAK,YAAY,MAAM,GAAG;;AAE1B,eAAK,YAAW;;MAEpB;AAEU,MAAAA,YAAA,UAAA,YAAV,WAAA;AACE,YAAI;AACF,eAAK,YAAY,SAAQ;;AAEzB,eAAK,YAAW;;MAEpB;AACF,aAAAA;IAAA,EApHmC,YAAY;AA2H/C,IAAM,QAAQ,SAAS,UAAU;AAUjC,IAAA,mBAAA,WAAA;AACE,eAAAC,kBAAoB,iBAAqC;AAArC,aAAA,kBAAA;MAAwC;AAE5D,MAAAA,kBAAA,UAAA,OAAA,SAAK,OAAQ;AACH,YAAA,kBAAoB,KAAI;AAChC,YAAI,gBAAgB,MAAM;AACxB,cAAI;AACF,4BAAgB,KAAK,KAAK;mBACnB,OAAO;AACd,iCAAqB,KAAK;;;MAGhC;AAEA,MAAAA,kBAAA,UAAA,QAAA,SAAM,KAAQ;AACJ,YAAA,kBAAoB,KAAI;AAChC,YAAI,gBAAgB,OAAO;AACzB,cAAI;AACF,4BAAgB,MAAM,GAAG;mBAClB,OAAO;AACd,iCAAqB,KAAK;;eAEvB;AACL,+BAAqB,GAAG;;MAE5B;AAEA,MAAAA,kBAAA,UAAA,WAAA,WAAA;AACU,YAAA,kBAAoB,KAAI;AAChC,YAAI,gBAAgB,UAAU;AAC5B,cAAI;AACF,4BAAgB,SAAQ;mBACjB,OAAO;AACd,iCAAqB,KAAK;;;MAGhC;AACF,aAAAA;IAAA,EArCA;AAuCA,IAAA,iBAAA,SAAA,QAAA;AAAuC,gBAAAC,iBAAA,MAAA;AACrC,eAAAA,gBACE,gBACA,OACA,UAA8B;AAHhC,YAAA,QAKE,OAAA,KAAA,IAAA,KAAO;AAEP,YAAI;AACJ,YAAI,WAAW,cAAc,KAAK,CAAC,gBAAgB;AAGjD,4BAAkB;YAChB,MAAO,mBAAc,QAAd,mBAAc,SAAd,iBAAkB;YACzB,OAAO,UAAK,QAAL,UAAK,SAAL,QAAS;YAChB,UAAU,aAAQ,QAAR,aAAQ,SAAR,WAAY;;eAEnB;AAEL,cAAI;AACJ,cAAI,SAAQ,OAAO,0BAA0B;AAI3C,wBAAU,OAAO,OAAO,cAAc;AACtC,sBAAQ,cAAc,WAAA;AAAM,qBAAA,MAAK,YAAW;YAAhB;AAC5B,8BAAkB;cAChB,MAAM,eAAe,QAAQ,KAAK,eAAe,MAAM,SAAO;cAC9D,OAAO,eAAe,SAAS,KAAK,eAAe,OAAO,SAAO;cACjE,UAAU,eAAe,YAAY,KAAK,eAAe,UAAU,SAAO;;iBAEvE;AAEL,8BAAkB;;;AAMtB,cAAK,cAAc,IAAI,iBAAiB,eAAe;;MACzD;AACF,aAAAA;IAAA,EAzCuC,UAAU;AA8E1C,IAAM,iBAA6D;MACxE,QAAQ;MACR,MAAM;MACN,OAAO;MACP,UAAU;;;;;;AC5QZ,IAAa;AAAb;;AAAO,IAAM,aAA+B,WAAA;AAAM,aAAC,OAAO,WAAW,cAAc,OAAO,cAAe;IAAvD,EAAsE;;;;;ACoClH,SAAU,SAAY,GAAI;AAC9B,SAAO;AACT;AAFA;;;;;;ACwCM,SAAU,cAAoB,KAA+B;AACjE,MAAI,IAAI,WAAW,GAAG;AACpB,WAAO;;AAGT,MAAI,IAAI,WAAW,GAAG;AACpB,WAAO,IAAI,CAAC;;AAGd,SAAO,SAAS,MAAM,OAAQ;AAC5B,WAAO,IAAI,OAAO,SAAC,MAAW,IAAuB;AAAK,aAAA,GAAG,IAAI;IAAP,GAAU,KAAY;EAClF;AACF;AA9FA;;;;;;;ACueA,SAAS,eAAe,aAA+C;;AACrE,UAAOC,MAAA,gBAAW,QAAX,gBAAW,SAAX,cAAe,OAAO,aAAO,QAAAA,QAAA,SAAAA,MAAI;AAC1C;AAEA,SAAS,WAAc,OAAU;AAC/B,SAAO,SAAS,WAAW,MAAM,IAAI,KAAK,WAAW,MAAM,KAAK,KAAK,WAAW,MAAM,QAAQ;AAChG;AAEA,SAAS,aAAgB,OAAU;AACjC,SAAQ,SAAS,iBAAiB,cAAgB,WAAW,KAAK,KAAK,eAAe,KAAK;AAC7F;AAhfA,IAeA;AAfA;;;AACA;AAEA;AACA;AACA;AACA;AACA;AAQA,IAAA,aAAA,WAAA;AAkBE,eAAAC,YAAY,WAA6E;AACvF,YAAI,WAAW;AACb,eAAK,aAAa;;MAEtB;AA4BA,MAAAA,YAAA,UAAA,OAAA,SAAQ,UAAyB;AAC/B,YAAMC,cAAa,IAAID,YAAU;AACjC,QAAAC,YAAW,SAAS;AACpB,QAAAA,YAAW,WAAW;AACtB,eAAOA;MACT;AA6IA,MAAAD,YAAA,UAAA,YAAA,SACE,gBACA,OACA,UAA8B;AAHhC,YAAA,QAAA;AAKE,YAAM,aAAa,aAAa,cAAc,IAAI,iBAAiB,IAAI,eAAe,gBAAgB,OAAO,QAAQ;AAErH,qBAAa,WAAA;AACL,cAAAD,MAAuB,OAArB,WAAQA,IAAA,UAAE,SAAMA,IAAA;AACxB,qBAAW,IACT,WAGI,SAAS,KAAK,YAAY,MAAM,IAChC,SAIA,MAAK,WAAW,UAAU,IAG1B,MAAK,cAAc,UAAU,CAAC;QAEtC,CAAC;AAED,eAAO;MACT;AAGU,MAAAC,YAAA,UAAA,gBAAV,SAAwB,MAAmB;AACzC,YAAI;AACF,iBAAO,KAAK,WAAW,IAAI;iBACpB,KAAK;AAIZ,eAAK,MAAM,GAAG;;MAElB;AA6DA,MAAAA,YAAA,UAAA,UAAA,SAAQ,MAA0B,aAAoC;AAAtE,YAAA,QAAA;AACE,sBAAc,eAAe,WAAW;AAExC,eAAO,IAAI,YAAkB,SAAC,SAAS,QAAM;AAC3C,cAAM,aAAa,IAAI,eAAkB;YACvC,MAAM,SAAC,OAAK;AACV,kBAAI;AACF,qBAAK,KAAK;uBACH,KAAK;AACZ,uBAAO,GAAG;AACV,2BAAW,YAAW;;YAE1B;YACA,OAAO;YACP,UAAU;WACX;AACD,gBAAK,UAAU,UAAU;QAC3B,CAAC;MACH;AAGU,MAAAA,YAAA,UAAA,aAAV,SAAqB,YAA2B;;AAC9C,gBAAOD,MAAA,KAAK,YAAM,QAAAA,QAAA,SAAA,SAAAA,IAAE,UAAU,UAAU;MAC1C;AAOA,MAAAC,YAAA,UAAC,UAAiB,IAAlB,WAAA;AACE,eAAO;MACT;AA4FA,MAAAA,YAAA,UAAA,OAAA,WAAA;AAAK,YAAA,aAAA,CAAA;iBAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAA2C;AAA3C,qBAAA,EAAA,IAAA,UAAA,EAAA;;AACH,eAAO,cAAc,UAAU,EAAE,IAAI;MACvC;AA6BA,MAAAA,YAAA,UAAA,YAAA,SAAU,aAAoC;AAA9C,YAAA,QAAA;AACE,sBAAc,eAAe,WAAW;AAExC,eAAO,IAAI,YAAY,SAAC,SAAS,QAAM;AACrC,cAAI;AACJ,gBAAK,UACH,SAAC,GAAI;AAAK,mBAAC,QAAQ;UAAT,GACV,SAAC,KAAQ;AAAK,mBAAA,OAAO,GAAG;UAAV,GACd,WAAA;AAAM,mBAAA,QAAQ,KAAK;UAAb,CAAc;QAExB,CAAC;MACH;AA1aO,MAAAA,YAAA,SAAkC,SAAI,WAAwD;AACnG,eAAO,IAAIA,YAAc,SAAS;MACpC;AAyaF,aAAAA;MA9cA;;;;;ACRM,SAAU,QAAQ,QAAW;AACjC,SAAO,WAAW,WAAM,QAAN,WAAM,SAAA,SAAN,OAAQ,IAAI;AAChC;AAMM,SAAU,QACd,MAAqF;AAErF,SAAO,SAAC,QAAqB;AAC3B,QAAI,QAAQ,MAAM,GAAG;AACnB,aAAO,OAAO,KAAK,SAA+B,cAA2B;AAC3E,YAAI;AACF,iBAAO,KAAK,cAAc,IAAI;iBACvB,KAAK;AACZ,eAAK,MAAM,GAAG;;MAElB,CAAC;;AAEH,UAAM,IAAI,UAAU,wCAAwC;EAC9D;AACF;AA5BA;;;;;;;ACWM,SAAU,yBACd,aACA,QACA,YACA,SACA,YAAuB;AAEvB,SAAO,IAAI,mBAAmB,aAAa,QAAQ,YAAY,SAAS,UAAU;AACpF;IAMA;;;;AA5BA;AA4BA,IAAA,qBAAA,SAAA,QAAA;AAA2C,gBAAAE,qBAAA,MAAA;AAiBzC,eAAAA,oBACE,aACA,QACA,YACA,SACQ,YACA,mBAAiC;AAN3C,YAAA,QAoBE,OAAA,KAAA,MAAM,WAAW,KAAC;AAfV,cAAA,aAAA;AACA,cAAA,oBAAA;AAeR,cAAK,QAAQ,SACT,SAAuC,OAAQ;AAC7C,cAAI;AACF,mBAAO,KAAK;mBACL,KAAK;AACZ,wBAAY,MAAM,GAAG;;QAEzB,IACA,OAAA,UAAM;AACV,cAAK,SAAS,UACV,SAAuC,KAAQ;AAC7C,cAAI;AACF,oBAAQ,GAAG;mBACJC,MAAK;AAEZ,wBAAY,MAAMA,IAAG;;AAGrB,iBAAK,YAAW;;QAEpB,IACA,OAAA,UAAM;AACV,cAAK,YAAY,aACb,WAAA;AACE,cAAI;AACF,uBAAU;mBACH,KAAK;AAEZ,wBAAY,MAAM,GAAG;;AAGrB,iBAAK,YAAW;;QAEpB,IACA,OAAA,UAAM;;MACZ;AAEA,MAAAD,oBAAA,UAAA,cAAA,WAAA;;AACE,YAAI,CAAC,KAAK,qBAAqB,KAAK,kBAAiB,GAAI;AAC/C,cAAA,WAAW,KAAI;AACvB,iBAAA,UAAM,YAAW,KAAA,IAAA;AAEjB,WAAC,cAAUE,MAAA,KAAK,gBAAU,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAAf,IAAI;;MAEnB;AACF,aAAAF;IAAA,EAnF2C,UAAU;;;;;AC5BrD,IAqBa;AArBb;;;AAqBO,IAAM,0BAAuD,iBAClE,SAAC,QAAM;AACL,aAAA,SAAS,8BAA2B;AAClC,eAAO,IAAI;AACX,aAAK,OAAO;AACZ,aAAK,UAAU;MACjB;IAJA,CAIC;;;;;ICXL,SAkJA;;;;AAjKA;AAEA;AAEA;AACA;AACA;AASA,IAAA,UAAA,SAAA,QAAA;AAAgC,gBAAAG,UAAA,MAAA;AAwB9B,eAAAA,WAAA;AAAA,YAAA,QAEE,OAAA,KAAA,IAAA,KAAO;AAzBT,cAAA,SAAS;AAED,cAAA,mBAAyC;AAGjD,cAAA,YAA2B,CAAA;AAE3B,cAAA,YAAY;AAEZ,cAAA,WAAW;AAEX,cAAA,cAAmB;;MAenB;AAGA,MAAAA,SAAA,UAAA,OAAA,SAAQ,UAAwB;AAC9B,YAAM,UAAU,IAAI,iBAAiB,MAAM,IAAI;AAC/C,gBAAQ,WAAW;AACnB,eAAO;MACT;AAGU,MAAAA,SAAA,UAAA,iBAAV,WAAA;AACE,YAAI,KAAK,QAAQ;AACf,gBAAM,IAAI,wBAAuB;;MAErC;AAEA,MAAAA,SAAA,UAAA,OAAA,SAAK,OAAQ;AAAb,YAAA,QAAA;AACE,qBAAa,WAAA;;AACX,gBAAK,eAAc;AACnB,cAAI,CAAC,MAAK,WAAW;AACnB,gBAAI,CAAC,MAAK,kBAAkB;AAC1B,oBAAK,mBAAmB,MAAM,KAAK,MAAK,SAAS;;;AAEnD,uBAAuB,KAAA,SAAA,MAAK,gBAAgB,GAAA,KAAA,GAAA,KAAA,GAAA,CAAA,GAAA,MAAA,KAAA,GAAA,KAAA,GAAE;AAAzC,oBAAM,WAAQ,GAAA;AACjB,yBAAS,KAAK,KAAK;;;;;;;;;;;;QAGzB,CAAC;MACH;AAEA,MAAAA,SAAA,UAAA,QAAA,SAAM,KAAQ;AAAd,YAAA,QAAA;AACE,qBAAa,WAAA;AACX,gBAAK,eAAc;AACnB,cAAI,CAAC,MAAK,WAAW;AACnB,kBAAK,WAAW,MAAK,YAAY;AACjC,kBAAK,cAAc;AACX,gBAAA,YAAc,MAAI;AAC1B,mBAAO,UAAU,QAAQ;AACvB,wBAAU,MAAK,EAAI,MAAM,GAAG;;;QAGlC,CAAC;MACH;AAEA,MAAAA,SAAA,UAAA,WAAA,WAAA;AAAA,YAAA,QAAA;AACE,qBAAa,WAAA;AACX,gBAAK,eAAc;AACnB,cAAI,CAAC,MAAK,WAAW;AACnB,kBAAK,YAAY;AACT,gBAAA,YAAc,MAAI;AAC1B,mBAAO,UAAU,QAAQ;AACvB,wBAAU,MAAK,EAAI,SAAQ;;;QAGjC,CAAC;MACH;AAEA,MAAAA,SAAA,UAAA,cAAA,WAAA;AACE,aAAK,YAAY,KAAK,SAAS;AAC/B,aAAK,YAAY,KAAK,mBAAmB;MAC3C;AAEA,aAAA,eAAIA,SAAA,WAAA,YAAQ;aAAZ,WAAA;;AACE,mBAAOC,MAAA,KAAK,eAAS,QAAAA,QAAA,SAAA,SAAAA,IAAE,UAAS;QAClC;;;;AAGU,MAAAD,SAAA,UAAA,gBAAV,SAAwB,YAAyB;AAC/C,aAAK,eAAc;AACnB,eAAO,OAAA,UAAM,cAAa,KAAA,MAAC,UAAU;MACvC;AAGU,MAAAA,SAAA,UAAA,aAAV,SAAqB,YAAyB;AAC5C,aAAK,eAAc;AACnB,aAAK,wBAAwB,UAAU;AACvC,eAAO,KAAK,gBAAgB,UAAU;MACxC;AAGU,MAAAA,SAAA,UAAA,kBAAV,SAA0B,YAA2B;AAArD,YAAA,QAAA;AACQ,YAAAC,MAAqC,MAAnC,WAAQA,IAAA,UAAE,YAASA,IAAA,WAAE,YAASA,IAAA;AACtC,YAAI,YAAY,WAAW;AACzB,iBAAO;;AAET,aAAK,mBAAmB;AACxB,kBAAU,KAAK,UAAU;AACzB,eAAO,IAAI,aAAa,WAAA;AACtB,gBAAK,mBAAmB;AACxB,oBAAU,WAAW,UAAU;QACjC,CAAC;MACH;AAGU,MAAAD,SAAA,UAAA,0BAAV,SAAkC,YAA2B;AACrD,YAAAC,MAAuC,MAArC,WAAQA,IAAA,UAAE,cAAWA,IAAA,aAAE,YAASA,IAAA;AACxC,YAAI,UAAU;AACZ,qBAAW,MAAM,WAAW;mBACnB,WAAW;AACpB,qBAAW,SAAQ;;MAEvB;AAQA,MAAAD,SAAA,UAAA,eAAA,WAAA;AACE,YAAME,cAAkB,IAAI,WAAU;AACtC,QAAAA,YAAW,SAAS;AACpB,eAAOA;MACT;AAxHO,MAAAF,SAAA,SAAkC,SAAI,aAA0B,QAAqB;AAC1F,eAAO,IAAI,iBAAoB,aAAa,MAAM;MACpD;AAuHF,aAAAA;MA7IgC,UAAU;AAkJ1C,IAAA,mBAAA,SAAA,QAAA;AAAyC,gBAAAG,mBAAA,MAAA;AACvC,eAAAA,kBAES,aACP,QAAsB;AAHxB,YAAA,QAKE,OAAA,KAAA,IAAA,KAAO;AAHA,cAAA,cAAA;AAIP,cAAK,SAAS;;MAChB;AAEA,MAAAA,kBAAA,UAAA,OAAA,SAAK,OAAQ;;AACX,SAAA,MAAAF,MAAA,KAAK,iBAAW,QAAAA,QAAA,SAAA,SAAAA,IAAE,UAAI,QAAA,OAAA,SAAA,SAAA,GAAA,KAAAA,KAAG,KAAK;MAChC;AAEA,MAAAE,kBAAA,UAAA,QAAA,SAAM,KAAQ;;AACZ,SAAA,MAAAF,MAAA,KAAK,iBAAW,QAAAA,QAAA,SAAA,SAAAA,IAAE,WAAK,QAAA,OAAA,SAAA,SAAA,GAAA,KAAAA,KAAG,GAAG;MAC/B;AAEA,MAAAE,kBAAA,UAAA,WAAA,WAAA;;AACE,SAAA,MAAAF,MAAA,KAAK,iBAAW,QAAAA,QAAA,SAAA,SAAAA,IAAE,cAAQ,QAAA,OAAA,SAAA,SAAA,GAAA,KAAAA,GAAA;MAC5B;AAGU,MAAAE,kBAAA,UAAA,aAAV,SAAqB,YAAyB;;AAC5C,gBAAO,MAAAF,MAAA,KAAK,YAAM,QAAAA,QAAA,SAAA,SAAAA,IAAE,UAAU,UAAU,OAAC,QAAA,OAAA,SAAA,KAAI;MAC/C;AACF,aAAAE;IAAA,EA1ByC,OAAO;;;;;AC5JhD,IAAa;AAAb;;AAAO,IAAM,wBAA+C;MAC1D,KAAG,WAAA;AAGD,gBAAQ,sBAAsB,YAAY,MAAM,IAAG;MACrD;MACA,UAAU;;;;;;ICwBZ;;;;AApCA;AAIA;AAgCA,IAAA,gBAAA,SAAA,QAAA;AAAsC,gBAAAC,gBAAA,MAAA;AAUpC,eAAAA,eACU,aACA,aACA,oBAA6D;AAF7D,YAAA,gBAAA,QAAA;AAAA,wBAAA;QAAsB;AACtB,YAAA,gBAAA,QAAA;AAAA,wBAAA;QAAsB;AACtB,YAAA,uBAAA,QAAA;AAAA,+BAAA;QAA6D;AAHvE,YAAA,QAKE,OAAA,KAAA,IAAA,KAAO;AAJC,cAAA,cAAA;AACA,cAAA,cAAA;AACA,cAAA,qBAAA;AAZF,cAAA,UAA0B,CAAA;AAC1B,cAAA,sBAAsB;AAc5B,cAAK,sBAAsB,gBAAgB;AAC3C,cAAK,cAAc,KAAK,IAAI,GAAG,WAAW;AAC1C,cAAK,cAAc,KAAK,IAAI,GAAG,WAAW;;MAC5C;AAEA,MAAAA,eAAA,UAAA,OAAA,SAAK,OAAQ;AACL,YAAAC,MAA+E,MAA7E,YAASA,IAAA,WAAE,UAAOA,IAAA,SAAE,sBAAmBA,IAAA,qBAAE,qBAAkBA,IAAA,oBAAE,cAAWA,IAAA;AAChF,YAAI,CAAC,WAAW;AACd,kBAAQ,KAAK,KAAK;AAClB,WAAC,uBAAuB,QAAQ,KAAK,mBAAmB,IAAG,IAAK,WAAW;;AAE7E,aAAK,YAAW;AAChB,eAAA,UAAM,KAAI,KAAA,MAAC,KAAK;MAClB;AAGU,MAAAD,eAAA,UAAA,aAAV,SAAqB,YAAyB;AAC5C,aAAK,eAAc;AACnB,aAAK,YAAW;AAEhB,YAAM,eAAe,KAAK,gBAAgB,UAAU;AAE9C,YAAAC,MAAmC,MAAjC,sBAAmBA,IAAA,qBAAE,UAAOA,IAAA;AAGpC,YAAM,OAAO,QAAQ,MAAK;AAC1B,iBAAS,IAAI,GAAG,IAAI,KAAK,UAAU,CAAC,WAAW,QAAQ,KAAK,sBAAsB,IAAI,GAAG;AACvF,qBAAW,KAAK,KAAK,CAAC,CAAM;;AAG9B,aAAK,wBAAwB,UAAU;AAEvC,eAAO;MACT;AAEQ,MAAAD,eAAA,UAAA,cAAR,WAAA;AACQ,YAAAC,MAAoE,MAAlE,cAAWA,IAAA,aAAE,qBAAkBA,IAAA,oBAAE,UAAOA,IAAA,SAAE,sBAAmBA,IAAA;AAKrE,YAAM,sBAAsB,sBAAsB,IAAI,KAAK;AAC3D,sBAAc,YAAY,qBAAqB,QAAQ,UAAU,QAAQ,OAAO,GAAG,QAAQ,SAAS,kBAAkB;AAItH,YAAI,CAAC,qBAAqB;AACxB,cAAM,MAAM,mBAAmB,IAAG;AAClC,cAAIC,QAAO;AAGX,mBAAS,IAAI,GAAG,IAAI,QAAQ,UAAW,QAAQ,CAAC,KAAgB,KAAK,KAAK,GAAG;AAC3E,YAAAA,QAAO;;AAET,UAAAA,SAAQ,QAAQ,OAAO,GAAGA,QAAO,CAAC;;MAEtC;AACF,aAAAF;IAAA,EAzEsC,OAAO;;;;;ACpC7C,IAiEa;AAjEb;;;AAiEO,IAAM,QAAQ,IAAI,WAAkB,SAAC,YAAU;AAAK,aAAA,WAAW,SAAQ;IAAnB,CAAqB;;;;;AC9D1E,SAAU,YAAY,OAAU;AACpC,SAAO,SAAS,WAAW,MAAM,QAAQ;AAC3C;AAJA;;;;;;;ACGA,SAAS,KAAQ,KAAQ;AACvB,SAAO,IAAI,IAAI,SAAS,CAAC;AAC3B;AAMM,SAAU,aAAa,MAAW;AACtC,SAAO,YAAY,KAAK,IAAI,CAAC,IAAI,KAAK,IAAG,IAAK;AAChD;AAEM,SAAU,UAAU,MAAa,cAAoB;AACzD,SAAO,OAAO,KAAK,IAAI,MAAM,WAAW,KAAK,IAAG,IAAM;AACxD;AAjBA;;AACA;;;;;ACFA,IAAa;AAAb;;AAAO,IAAM,cAAe,SAAI,GAAM;AAAwB,aAAA,KAAK,OAAO,EAAE,WAAW,YAAY,OAAO,MAAM;IAAlD;;;;;ACMxD,SAAU,UAAU,OAAU;AAClC,SAAO,WAAW,UAAK,QAAL,UAAK,SAAA,SAAL,MAAO,IAAI;AAC/B;AARA;;;;;;;ACKM,SAAU,oBAAoB,OAAU;AAC5C,SAAO,WAAW,MAAM,UAAiB,CAAC;AAC5C;AANA;;;AACA;;;;;ACAM,SAAU,gBAAmB,KAAQ;AACzC,SAAO,OAAO,iBAAiB,WAAW,QAAG,QAAH,QAAG,SAAA,SAAH,IAAM,OAAO,aAAa,CAAC;AACvE;AAJA;;;;;;;ACIM,SAAU,iCAAiC,OAAU;AAEzD,SAAO,IAAI,UACT,mBACE,UAAU,QAAQ,OAAO,UAAU,WAAW,sBAAsB,MAAI,QAAK,OAAG,0HACwC;AAE9H;AAPA;;;;;;ACJM,SAAU,oBAAiB;AAC/B,MAAI,OAAO,WAAW,cAAc,CAAC,OAAO,UAAU;AACpD,WAAO;;AAGT,SAAO,OAAO;AAChB;AANA,IAQa;AARb;;AAQO,IAAM,WAAW,kBAAiB;;;;;ACJnC,SAAU,WAAW,OAAU;AACnC,SAAO,WAAW,UAAK,QAAL,UAAK,SAAA,SAAL,MAAQ,QAAe,CAAC;AAC5C;AANA;;;AACA;;;;;ACEM,SAAiB,mCAAsC,gBAAqC;;;;;;AAC1F,mBAAS,eAAe,UAAS;;;;;;oBAE1B,QAAA,CAAA,GAAA,CAAA;AACe,iBAAA,CAAA,GAAA,QAAM,OAAO,KAAI,CAAE,CAAA;;AAArC,UAAAG,MAAkB,GAAA,KAAA,GAAhB,QAAKA,IAAA,OAAE,OAAIA,IAAA;eACf,KAAA,QAAA,CAAA,GAAA,CAAA;;;AACF,iBAAA,CAAA,GAAA,GAAA,KAAA,CAAA;;6BAEI,KAAM,CAAA;;AAAZ,iBAAA,CAAA,GAAA,GAAA,KAAA,CAAA;;AAAA,aAAA,KAAA;;;;;AAGF,iBAAO,YAAW;;;;;;;;AAIhB,SAAU,qBAAwB,KAAQ;AAG9C,SAAO,WAAW,QAAG,QAAH,QAAG,SAAA,SAAH,IAAK,SAAS;AAClC;;;;AArBA;;;;;ACcM,SAAU,UAAa,OAAyB;AACpD,MAAI,iBAAiB,YAAY;AAC/B,WAAO;;AAET,MAAI,SAAS,MAAM;AACjB,QAAI,oBAAoB,KAAK,GAAG;AAC9B,aAAO,sBAAsB,KAAK;;AAEpC,QAAI,YAAY,KAAK,GAAG;AACtB,aAAO,cAAc,KAAK;;AAE5B,QAAI,UAAU,KAAK,GAAG;AACpB,aAAO,YAAY,KAAK;;AAE1B,QAAI,gBAAgB,KAAK,GAAG;AAC1B,aAAO,kBAAkB,KAAK;;AAEhC,QAAI,WAAW,KAAK,GAAG;AACrB,aAAO,aAAa,KAAK;;AAE3B,QAAI,qBAAqB,KAAK,GAAG;AAC/B,aAAO,uBAAuB,KAAK;;;AAIvC,QAAM,iCAAiC,KAAK;AAC9C;AAMM,SAAU,sBAAyB,KAAQ;AAC/C,SAAO,IAAI,WAAW,SAAC,YAAyB;AAC9C,QAAM,MAAM,IAAI,UAAiB,EAAC;AAClC,QAAI,WAAW,IAAI,SAAS,GAAG;AAC7B,aAAO,IAAI,UAAU,UAAU;;AAGjC,UAAM,IAAI,UAAU,gEAAgE;EACtF,CAAC;AACH;AASM,SAAU,cAAiB,OAAmB;AAClD,SAAO,IAAI,WAAW,SAAC,YAAyB;AAU9C,aAAS,IAAI,GAAG,IAAI,MAAM,UAAU,CAAC,WAAW,QAAQ,KAAK;AAC3D,iBAAW,KAAK,MAAM,CAAC,CAAC;;AAE1B,eAAW,SAAQ;EACrB,CAAC;AACH;AAEM,SAAU,YAAe,SAAuB;AACpD,SAAO,IAAI,WAAW,SAAC,YAAyB;AAC9C,YACG,KACC,SAAC,OAAK;AACJ,UAAI,CAAC,WAAW,QAAQ;AACtB,mBAAW,KAAK,KAAK;AACrB,mBAAW,SAAQ;;IAEvB,GACA,SAAC,KAAQ;AAAK,aAAA,WAAW,MAAM,GAAG;IAApB,CAAqB,EAEpC,KAAK,MAAM,oBAAoB;EACpC,CAAC;AACH;AAEM,SAAU,aAAgB,UAAqB;AACnD,SAAO,IAAI,WAAW,SAAC,YAAyB;;;AAC9C,eAAoB,aAAA,SAAA,QAAQ,GAAA,eAAA,WAAA,KAAA,GAAA,CAAA,aAAA,MAAA,eAAA,WAAA,KAAA,GAAE;AAAzB,YAAM,QAAK,aAAA;AACd,mBAAW,KAAK,KAAK;AACrB,YAAI,WAAW,QAAQ;AACrB;;;;;;;;;;;;AAGJ,eAAW,SAAQ;EACrB,CAAC;AACH;AAEM,SAAU,kBAAqB,eAA+B;AAClE,SAAO,IAAI,WAAW,SAAC,YAAyB;AAC9C,IAAAC,SAAQ,eAAe,UAAU,EAAE,MAAM,SAAC,KAAG;AAAK,aAAA,WAAW,MAAM,GAAG;IAApB,CAAqB;EACzE,CAAC;AACH;AAEM,SAAU,uBAA0B,gBAAqC;AAC7E,SAAO,kBAAkB,mCAAmC,cAAc,CAAC;AAC7E;AAEA,SAAeA,SAAW,eAAiC,YAAyB;;;;;;;;;AACxD,4BAAA,cAAA,aAAa;;;;;;AAAtB,kBAAK,kBAAA;AACpB,qBAAW,KAAK,KAAK;AAGrB,cAAI,WAAW,QAAQ;AACrB,mBAAA,CAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;AAGJ,qBAAW,SAAQ;;;;;;;;;AAlIrB;AACA;AACA;AAEA;AACA;AACA;AACA;AACA;AAEA;AACA;AACA;;;;;ACMM,SAAU,gBACd,oBACA,WACA,MACA,OACA,QAAc;AADd,MAAA,UAAA,QAAA;AAAA,YAAA;EAAS;AACT,MAAA,WAAA,QAAA;AAAA,aAAA;EAAc;AAEd,MAAM,uBAAuB,UAAU,SAAS,WAAA;AAC9C,SAAI;AACJ,QAAI,QAAQ;AACV,yBAAmB,IAAI,KAAK,SAAS,MAAM,KAAK,CAAC;WAC5C;AACL,WAAK,YAAW;;EAEpB,GAAG,KAAK;AAER,qBAAmB,IAAI,oBAAoB;AAE3C,MAAI,CAAC,QAAQ;AAKX,WAAO;;AAEX;AAzBA;;;;;;ACwCM,SAAU,UAAa,WAA0B,OAAS;AAAT,MAAA,UAAA,QAAA;AAAA,YAAA;EAAS;AAC9D,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,WAAO,UACL,yBACE,YACA,SAAC,OAAK;AAAK,aAAA,gBAAgB,YAAY,WAAW,WAAA;AAAM,eAAA,WAAW,KAAK,KAAK;MAArB,GAAwB,KAAK;IAA1E,GACX,WAAA;AAAM,aAAA,gBAAgB,YAAY,WAAW,WAAA;AAAM,eAAA,WAAW,SAAQ;MAAnB,GAAuB,KAAK;IAAzE,GACN,SAAC,KAAG;AAAK,aAAA,gBAAgB,YAAY,WAAW,WAAA;AAAM,eAAA,WAAW,MAAM,GAAG;MAApB,GAAuB,KAAK;IAAzE,CAA0E,CACpF;EAEL,CAAC;AACH;AAnEA;;;AACA;AACA;;;;;AC0DM,SAAU,YAAe,WAA0B,OAAiB;AAAjB,MAAA,UAAA,QAAA;AAAA,YAAA;EAAiB;AACxE,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,eAAW,IAAI,UAAU,SAAS,WAAA;AAAM,aAAA,OAAO,UAAU,UAAU;IAA3B,GAA8B,KAAK,CAAC;EAC9E,CAAC;AACH;AAjEA;;;;;;;ACIM,SAAU,mBAAsB,OAA6B,WAAwB;AACzF,SAAO,UAAU,KAAK,EAAE,KAAK,YAAY,SAAS,GAAG,UAAU,SAAS,CAAC;AAC3E;AAPA;;;AACA;AACA;;;;;ACGM,SAAU,gBAAmB,OAAuB,WAAwB;AAChF,SAAO,UAAU,KAAK,EAAE,KAAK,YAAY,SAAS,GAAG,UAAU,SAAS,CAAC;AAC3E;AAPA;;;AACA;AACA;;;;;ACCM,SAAU,cAAiB,OAAqB,WAAwB;AAC5E,SAAO,IAAI,WAAc,SAAC,YAAU;AAElC,QAAI,IAAI;AAER,WAAO,UAAU,SAAS,WAAA;AACxB,UAAI,MAAM,MAAM,QAAQ;AAGtB,mBAAW,SAAQ;aACd;AAGL,mBAAW,KAAK,MAAM,GAAG,CAAC;AAI1B,YAAI,CAAC,WAAW,QAAQ;AACtB,eAAK,SAAQ;;;IAGnB,CAAC;EACH,CAAC;AACH;AA1BA;;;;;;;ACWM,SAAU,iBAAoB,OAAoB,WAAwB;AAC9E,SAAO,IAAI,WAAc,SAAC,YAAU;AAClC,QAAIC;AAKJ,oBAAgB,YAAY,WAAW,WAAA;AAErC,MAAAA,YAAY,MAAc,QAAe,EAAC;AAE1C,sBACE,YACA,WACA,WAAA;;AACE,YAAI;AACJ,YAAI;AACJ,YAAI;AAEF,UAACC,MAAkBD,UAAS,KAAI,GAA7B,QAAKC,IAAA,OAAE,OAAIA,IAAA;iBACP,KAAK;AAEZ,qBAAW,MAAM,GAAG;AACpB;;AAGF,YAAI,MAAM;AAKR,qBAAW,SAAQ;eACd;AAEL,qBAAW,KAAK,KAAK;;MAEzB,GACA,GACA,IAAI;IAER,CAAC;AAMD,WAAO,WAAA;AAAM,aAAA,WAAWD,cAAQ,QAARA,cAAQ,SAAA,SAARA,UAAU,MAAM,KAAKA,UAAS,OAAM;IAA/C;EACf,CAAC;AACH;AA3DA;;;AAEA;AACA;AACA;;;;;ACAM,SAAU,sBAAyB,OAAyB,WAAwB;AACxF,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,MAAM,yBAAyB;;AAE3C,SAAO,IAAI,WAAc,SAAC,YAAU;AAClC,oBAAgB,YAAY,WAAW,WAAA;AACrC,UAAME,YAAW,MAAM,OAAO,aAAa,EAAC;AAC5C,sBACE,YACA,WACA,WAAA;AACE,QAAAA,UAAS,KAAI,EAAG,KAAK,SAAC,QAAM;AAC1B,cAAI,OAAO,MAAM;AAGf,uBAAW,SAAQ;iBACd;AACL,uBAAW,KAAK,OAAO,KAAK;;QAEhC,CAAC;MACH,GACA,GACA,IAAI;IAER,CAAC;EACH,CAAC;AACH;AA7BA;;;AACA;;;;;ACGM,SAAU,2BAA8B,OAA8B,WAAwB;AAClG,SAAO,sBAAsB,mCAAmC,KAAK,GAAG,SAAS;AACnF;AALA;;;AACA;;;;;ACwBM,SAAU,UAAa,OAA2B,WAAwB;AAC9E,MAAI,SAAS,MAAM;AACjB,QAAI,oBAAoB,KAAK,GAAG;AAC9B,aAAO,mBAAmB,OAAO,SAAS;;AAE5C,QAAI,YAAY,KAAK,GAAG;AACtB,aAAO,cAAc,OAAO,SAAS;;AAEvC,QAAI,UAAU,KAAK,GAAG;AACpB,aAAO,gBAAgB,OAAO,SAAS;;AAEzC,QAAI,gBAAgB,KAAK,GAAG;AAC1B,aAAO,sBAAsB,OAAO,SAAS;;AAE/C,QAAI,WAAW,KAAK,GAAG;AACrB,aAAO,iBAAiB,OAAO,SAAS;;AAE1C,QAAI,qBAAqB,KAAK,GAAG;AAC/B,aAAO,2BAA2B,OAAO,SAAS;;;AAGtD,QAAM,iCAAiC,KAAK;AAC9C;AAjDA;;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAGA;AACA;AACA;AACA;;;;;ACuFM,SAAU,KAAQ,OAA2B,WAAyB;AAC1E,SAAO,YAAY,UAAU,OAAO,SAAS,IAAI,UAAU,KAAK;AAClE;AArGA;;;AACA;;;;;ACHA,IAwBa;AAxBb;;;AAwBO,IAAM,aAA6B,iBAAiB,SAAC,QAAM;AAAK,aAAA,SAAS,iBAAc;AAC5F,eAAO,IAAI;AACX,aAAK,OAAO;AACZ,aAAK,UAAU;MACjB;IAJuE,CAItE;;;;;AC2BK,SAAU,eAAqB,QAAuBC,SAAgC;AAC1F,MAAM,YAAY,OAAOA,YAAW;AACpC,SAAO,IAAI,QAAe,SAAC,SAAS,QAAM;AACxC,QAAM,aAAa,IAAI,eAAkB;MACvC,MAAM,SAAC,OAAK;AACV,gBAAQ,KAAK;AACb,mBAAW,YAAW;MACxB;MACA,OAAO;MACP,UAAU,WAAA;AACR,YAAI,WAAW;AACb,kBAAQA,QAAQ,YAAY;eACvB;AACL,iBAAO,IAAI,WAAU,CAAE;;MAE3B;KACD;AACD,WAAO,UAAU,UAAU;EAC7B,CAAC;AACH;AAzEA;;;AACA;;;;;AC6CM,SAAU,IAAU,SAAyC,SAAa;AAC9E,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAEhC,QAAI,QAAQ;AAGZ,WAAO,UACL,yBAAyB,YAAY,SAAC,OAAQ;AAG5C,iBAAW,KAAK,QAAQ,KAAK,SAAS,OAAO,OAAO,CAAC;IACvD,CAAC,CAAC;EAEN,CAAC;AACH;AA5DA;;;AACA;;;;;ACkBM,SAAU,eACd,QACA,YACA,SACA,YACA,cACA,QACA,mBACA,qBAAgC;AAGhC,MAAMC,UAAc,CAAA;AAEpB,MAAI,SAAS;AAEb,MAAI,QAAQ;AAEZ,MAAI,aAAa;AAKjB,MAAM,gBAAgB,WAAA;AAIpB,QAAI,cAAc,CAACA,QAAO,UAAU,CAAC,QAAQ;AAC3C,iBAAW,SAAQ;;EAEvB;AAGA,MAAM,YAAY,SAAC,OAAQ;AAAK,WAAC,SAAS,aAAa,WAAW,KAAK,IAAIA,QAAO,KAAK,KAAK;EAA5D;AAEhC,MAAM,aAAa,SAAC,OAAQ;AAI1B,cAAU,WAAW,KAAK,KAAY;AAItC;AAKA,QAAI,gBAAgB;AAGpB,cAAU,QAAQ,OAAO,OAAO,CAAC,EAAE,UACjC,yBACE,YACA,SAAC,YAAU;AAGT,uBAAY,QAAZ,iBAAY,SAAA,SAAZ,aAAe,UAAU;AAEzB,UAAI,QAAQ;AAGV,kBAAU,UAAiB;aACtB;AAEL,mBAAW,KAAK,UAAU;;IAE9B,GACA,WAAA;AAGE,sBAAgB;IAClB,GAEA,QACA,WAAA;AAIE,UAAI,eAAe;AAKjB,YAAI;AAIF;;AAME,gBAAM,gBAAgBA,QAAO,MAAK;AAIlC,gBAAI,mBAAmB;AACrB,8BAAgB,YAAY,mBAAmB,WAAA;AAAM,uBAAA,WAAW,aAAa;cAAxB,CAAyB;mBACzE;AACL,yBAAW,aAAa;;;AAR5B,iBAAOA,QAAO,UAAU,SAAS,YAAU;;;AAY3C,wBAAa;iBACN,KAAK;AACZ,qBAAW,MAAM,GAAG;;;IAG1B,CAAC,CACF;EAEL;AAGA,SAAO,UACL,yBAAyB,YAAY,WAAW,WAAA;AAE9C,iBAAa;AACb,kBAAa;EACf,CAAC,CAAC;AAKJ,SAAO,WAAA;AACL,4BAAmB,QAAnB,wBAAmB,SAAA,SAAnB,oBAAmB;EACrB;AACF;AAnJA;;;AAGA;AACA;;;;;AC6EM,SAAU,SACd,SACA,gBACA,YAA6B;AAA7B,MAAA,eAAA,QAAA;AAAA,iBAAA;EAA6B;AAE7B,MAAI,WAAW,cAAc,GAAG;AAE9B,WAAO,SAAS,SAAC,GAAG,GAAC;AAAK,aAAA,IAAI,SAAC,GAAQ,IAAU;AAAK,eAAA,eAAe,GAAG,GAAG,GAAG,EAAE;MAA1B,CAA2B,EAAE,UAAU,QAAQ,GAAG,CAAC,CAAC,CAAC;IAAjF,GAAoF,UAAU;aAC/G,OAAO,mBAAmB,UAAU;AAC7C,iBAAa;;AAGf,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAAK,WAAA,eAAe,QAAQ,YAAY,SAAS,UAAU;EAAtD,CAAuD;AAChG;AA9FA;;;AACA;AACA;AACA;AACA;;;;;AC0DM,SAAU,SAAyC,YAA6B;AAA7B,MAAA,eAAA,QAAA;AAAA,iBAAA;EAA6B;AACpF,SAAO,SAAS,UAAU,UAAU;AACtC;AAjEA;;;AACA;;;;;ACmDM,SAAU,MAAsC,mBAA0B;AAC9E,SAAO,IAAI,WAA+B,SAAC,YAAU;AACnD,cAAU,kBAAiB,CAAE,EAAE,UAAU,UAAU;EACrD,CAAC;AACH;AAxDA;;;AAEA;;;;;ACuFM,SAAU,QAAK;AAAC,MAAA,OAAA,CAAA;WAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAA8D;AAA9D,SAAA,EAAA,IAAA,UAAA,EAAA;;AACpB,MAAM,YAAY,aAAa,IAAI;AACnC,MAAM,aAAa,UAAU,MAAM,QAAQ;AAC3C,MAAM,UAAU;AAChB,SAAO,CAAC,QAAQ,SAEZ,QACA,QAAQ,WAAW,IAEnB,UAAU,QAAQ,CAAC,CAAC,IAEpB,SAAS,UAAU,EAAE,KAAK,SAAS,SAAS,CAAC;AACnD;AAnGA;;;AACA;AACA;AACA;AACA;;;;;ACsDM,SAAU,OAAU,WAAiD,SAAa;AACtF,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAEhC,QAAI,QAAQ;AAIZ,WAAO,UAIL,yBAAyB,YAAY,SAAC,OAAK;AAAK,aAAA,UAAU,KAAK,SAAS,OAAO,OAAO,KAAK,WAAW,KAAK,KAAK;IAAhE,CAAiE,CAAC;EAEtH,CAAC;AACH;AAzEA;;;AACA;;;;;ACFA;AAAA;AAAA;AAAA;;;ACuCM,SAAU,eAAqB,cAAe;AAClD,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,QAAI,WAAW;AACf,WAAO,UACL,yBACE,YACA,SAAC,OAAK;AACJ,iBAAW;AACX,iBAAW,KAAK,KAAK;IACvB,GACA,WAAA;AACE,UAAI,CAAC,UAAU;AACb,mBAAW,KAAK,YAAa;;AAE/B,iBAAW,SAAQ;IACrB,CAAC,CACF;EAEL,CAAC;AACH;AAzDA;;;AACA;;;;;AC6CM,SAAU,KAAQ,OAAa;AACnC,SAAO,SAAS,IAEZ,WAAA;AAAM,WAAA;EAAA,IACN,QAAQ,SAAC,QAAQ,YAAU;AACzB,QAAI,OAAO;AACX,WAAO,UACL,yBAAyB,YAAY,SAAC,OAAK;AAIzC,UAAI,EAAE,QAAQ,OAAO;AACnB,mBAAW,KAAK,KAAK;AAIrB,YAAI,SAAS,MAAM;AACjB,qBAAW,SAAQ;;;IAGzB,CAAC,CAAC;EAEN,CAAC;AACP;AArEA;;;AACA;AACA;;;;;ACqCM,SAAU,iBAAc;AAC5B,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,WAAO,UAAU,yBAAyB,YAAY,IAAI,CAAC;EAC7D,CAAC;AACH;AA3CA;;;AACA;AACA;;;;;ACsCM,SAAU,aAAgB,cAA6C;AAA7C,MAAA,iBAAA,QAAA;AAAA,mBAAA;EAA6C;AAC3E,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,QAAI,WAAW;AACf,WAAO,UACL,yBACE,YACA,SAAC,OAAK;AACJ,iBAAW;AACX,iBAAW,KAAK,KAAK;IACvB,GACA,WAAA;AAAM,aAAC,WAAW,WAAW,SAAQ,IAAK,WAAW,MAAM,aAAY,CAAE;IAAnE,CAAqE,CAC5E;EAEL,CAAC;AACH;AAEA,SAAS,sBAAmB;AAC1B,SAAO,IAAI,WAAU;AACvB;AA3DA;;;AAEA;AACA;;;;;AC6EM,SAAU,MACd,WACA,cAAgB;AAEhB,MAAM,kBAAkB,UAAU,UAAU;AAC5C,SAAO,SAAC,QAAqB;AAC3B,WAAA,OAAO,KACL,YAAY,OAAO,SAAC,GAAG,GAAC;AAAK,aAAA,UAAU,GAAG,GAAG,MAAM;IAAtB,CAAuB,IAAI,UACxD,KAAK,CAAC,GACN,kBAAkB,eAAe,YAAa,IAAI,aAAa,WAAA;AAAM,aAAA,IAAI,WAAU;IAAd,CAAgB,CAAC;EAHxF;AAKJ;AA1FA;;;AAEA;AACA;AACA;AACA;AACA;;;;;ACsIM,SAAU,MAAS,SAA4B;AAA5B,MAAA,YAAA,QAAA;AAAA,cAAA,CAAA;EAA4B;AAC3C,MAAAC,MAAgH,QAAO,WAAvH,YAASA,QAAA,SAAG,WAAA;AAAM,WAAA,IAAI,QAAO;EAAX,IAAgBA,KAAE,KAA4E,QAAO,cAAnF,eAAY,OAAA,SAAG,OAAI,IAAE,KAAuD,QAAO,iBAA9D,kBAAe,OAAA,SAAG,OAAI,IAAE,KAA+B,QAAO,qBAAtC,sBAAmB,OAAA,SAAG,OAAI;AAUnH,SAAO,SAAC,eAAa;AACnB,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI,WAAW;AACf,QAAI,eAAe;AACnB,QAAI,aAAa;AAEjB,QAAM,cAAc,WAAA;AAClB,0BAAe,QAAf,oBAAe,SAAA,SAAf,gBAAiB,YAAW;AAC5B,wBAAkB;IACpB;AAGA,QAAM,QAAQ,WAAA;AACZ,kBAAW;AACX,mBAAa,UAAU;AACvB,qBAAe,aAAa;IAC9B;AACA,QAAM,sBAAsB,WAAA;AAG1B,UAAM,OAAO;AACb,YAAK;AACL,eAAI,QAAJ,SAAI,SAAA,SAAJ,KAAM,YAAW;IACnB;AAEA,WAAO,QAAc,SAAC,QAAQ,YAAU;AACtC;AACA,UAAI,CAAC,cAAc,CAAC,cAAc;AAChC,oBAAW;;AAOb,UAAM,OAAQ,UAAU,YAAO,QAAP,YAAO,SAAP,UAAW,UAAS;AAO5C,iBAAW,IAAI,WAAA;AACb;AAKA,YAAI,aAAa,KAAK,CAAC,cAAc,CAAC,cAAc;AAClD,4BAAkB,YAAY,qBAAqB,mBAAmB;;MAE1E,CAAC;AAID,WAAK,UAAU,UAAU;AAEzB,UACE,CAAC,cAID,WAAW,GACX;AAMA,qBAAa,IAAI,eAAe;UAC9B,MAAM,SAAC,OAAK;AAAK,mBAAA,KAAK,KAAK,KAAK;UAAf;UACjB,OAAO,SAAC,KAAG;AACT,yBAAa;AACb,wBAAW;AACX,8BAAkB,YAAY,OAAO,cAAc,GAAG;AACtD,iBAAK,MAAM,GAAG;UAChB;UACA,UAAU,WAAA;AACR,2BAAe;AACf,wBAAW;AACX,8BAAkB,YAAY,OAAO,eAAe;AACpD,iBAAK,SAAQ;UACf;SACD;AACD,kBAAU,MAAM,EAAE,UAAU,UAAU;;IAE1C,CAAC,EAAE,aAAa;EAClB;AACF;AAEA,SAAS,YACP,OACA,IAAoD;AACpD,MAAA,OAAA,CAAA;WAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAAU;AAAV,SAAA,KAAA,CAAA,IAAA,UAAA,EAAA;;AAEA,MAAI,OAAO,MAAM;AACf,UAAK;AACL;;AAGF,MAAI,OAAO,OAAO;AAChB;;AAGF,MAAM,eAAe,IAAI,eAAe;IACtC,MAAM,WAAA;AACJ,mBAAa,YAAW;AACxB,YAAK;IACP;GACD;AAED,SAAO,UAAU,GAAE,MAAA,QAAA,cAAA,CAAA,GAAA,OAAI,IAAI,CAAA,CAAA,CAAA,EAAG,UAAU,YAAY;AACtD;;;;AA1QA;AACA;AACA;AAGA;;;;;ACwCM,SAAU,UAAa,UAA8B;AACzD,SAAO,QAAQ,SAAC,QAAQ,YAAU;AAChC,cAAU,QAAQ,EAAE,UAAU,yBAAyB,YAAY,WAAA;AAAM,aAAA,WAAW,SAAQ;IAAnB,GAAuB,IAAI,CAAC;AACrG,KAAC,WAAW,UAAU,OAAO,UAAU,UAAU;EACnD,CAAC;AACH;AAjDA;;;AACA;AACA;AACA;;;;;ACkKM,SAAU,IACd,gBACA,OACA,UAA8B;AAK9B,MAAM,cACJ,WAAW,cAAc,KAAK,SAAS,WAElC,EAAE,MAAM,gBAA2E,OAAO,SAAQ,IACnG;AAEN,SAAO,cACH,QAAQ,SAAC,QAAQ,YAAU;;AACzB,KAAAC,MAAA,YAAY,eAAS,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAArB,WAAW;AACX,QAAI,UAAU;AACd,WAAO,UACL,yBACE,YACA,SAAC,OAAK;;AACJ,OAAAA,MAAA,YAAY,UAAI,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAAhB,aAAmB,KAAK;AACxB,iBAAW,KAAK,KAAK;IACvB,GACA,WAAA;;AACE,gBAAU;AACV,OAAAA,MAAA,YAAY,cAAQ,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAApB,WAAW;AACX,iBAAW,SAAQ;IACrB,GACA,SAAC,KAAG;;AACF,gBAAU;AACV,OAAAA,MAAA,YAAY,WAAK,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAAjB,aAAoB,GAAG;AACvB,iBAAW,MAAM,GAAG;IACtB,GACA,WAAA;;AACE,UAAI,SAAS;AACX,SAAAA,MAAA,YAAY,iBAAW,QAAAA,QAAA,SAAA,SAAAA,IAAA,KAAvB,WAAW;;AAEb,OAAA,KAAA,YAAY,cAAQ,QAAA,OAAA,SAAA,SAAA,GAAA,KAApB,WAAW;IACb,CAAC,CACF;EAEL,CAAC,IAID;AACN;AArNA;;;AACA;AACA;AACA;;;;;ACWA;;;AAUA;AA0BA;AAiBA;AAGA;AAMA;AAmBA;AA8FA;;;;;AChLA,SAAS,qBACPC,SACA,cAAsC;AAEtC,QAAM,SAAmB,CAAA;AAEzB,WAAS,IAAI,GAAG,OAAO,aAAa,CAAC,GAAG,IAAIA,QAAO,QAAQ,KAAK,MAAM,OAAO,aAAa,CAAC,GAAG;AAG5F,WAAO,KAAKA,QAAO,MAAM,GAAG,IAAI,IAAI,CAAC;EACvC;AAEA,SAAO;AACT;gBAzBM,OAqCO;;;AAvCb;AACA,IAAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA,IAAM,QAAQ;AAqCP,IAAM,WAAW,CACtB,OACA,MACA,SACA,EAAE,SAAAC,SAAO,IAAiC,CAAA,MACpB;AAItB,YAAM,SAAS,qBAAqB,MAAM,OAAK,WAAW,MAAM,IAAI,IAAI,EAAE,EAAE,IAAI,CAACF,SAAQ,MAAK;AAC5F,cAAM,OAAO,OAAO,MAAM,MAAM,IAAI,IAAI,CAAC;AACzC,aAAK,WAAW,OAAO,CAAC;AAExB,aAAK,cAAc,GAAG,CAAC;AAGvB,YAAI,MAAM,GAAG;AACX,eAAK,cAAc,KAAK,QAAQ,CAAC;QACnC;AAGA,eAAO,OAAO,OAAO,CAAC,MAAMA,OAAM,CAAC;MACrC,CAAC;AAED,aAAO,IAAI,WAAW,OAAI;AACxB,YAAI,aAAa;AAEjB,iBAAe,OAAI;;AACjB,uBAAW,SAAS,QAAQ;AAC1B,kBAAI;AAAY;AAChB,oBAAM,MAAM,KAAK;YACnB;UACF,CAAC;;AAED,aAAI,EAAG,KACL,MAAK;AACH,uBAAa;AACb,YAAE,SAAQ;QACZ,GACA,WAAQ;AACN,uBAAa;AACb,gBAAM;YACJ,MAAM;YACN,SAAS,qBAAqB,KAAK;YACnC,MAAM,EAAE,MAAK;YACb,SAAAE;WACD;AACD,YAAE,MAAM,KAAK;QACf,CAAC;AAGH,cAAM,cAAc,MAAK;AACvB,cAAI,CAAC,YAAY;AACf,kBAAM;cACJ,MAAM;cACN,SAAS;cACT,SAAAA;aACD;AACD,yBAAa;UACf;QACF;AAEA,eAAO;MACT,CAAC;IACH;;;;;ACvGA,IAGMC,QAUO;AAbb;;;AACA;AACA,IAAAC;AACA,IAAMD,SAAQ;AAUP,IAAM,cAAc,CACzB,WACA,EAAE,SAAAE,SAAO,IAAiC,CAAA,MAE1C,IAAI,WAAW,OAAI;AACjB,UAAI,gBAAgB;AACpB,UAAI,qBAAqB;AACzB,UAAI,eAAe,OAAO,MAAM,CAAC;AACjC,YAAM,sBAAsB,IAAI,cAAa;AAG7C,gBAAU,KAAK,UAAU,mBAAmB,CAAC,EAAE,UAAU;QACvD,UAAU,MAAK;AACb,YAAE,MAAM,IAAI,mBAAkB,CAAE;QAClC;QACA,OAAO,WAAQ;AACb,gBAAM;YACJ,MAAM;YACN,SAAS,yBAAyB,KAAK;YACvC,MAAM,EAAE,MAAK;YACb,SAAAA;WACD;AACD,YAAE,MAAM,KAAK;QACf;QACA,MAAM,WAAQ;AAEZ,cAAI,iBAAiB,OAAO;AAC1B,kBAAM;cACJ,MAAM;cACN,SAAS,sCAAsC,KAAK;cACpD,MAAM,EAAE,OAAO,MAAK;cACpB,SAAAA;aACD;AAED;UACF;AAEA,gBAAM,MAAM,MAAM,UAAU,CAAC;AAC7B,gBAAM,aAAa,MAAM,aAAa,CAAC;AAEvC,cAAI,YAAY,MAAM,MAAM,CAAC;AAE7B,cAAI,QAAQF,QAAO;AACjB,cAAE,MAAM,IAAI,eAAe,iBAAiB,IAAI,SAAS,EAAE,GAAG,YAAY,CAAC;AAC3E;UACF;AAGA,cAAI,kBAAkB,YAAY;AAChC,cAAE,MACA,IAAI,eACF,8DAA8D,UAAU,iBAAiB,aAAa,IACtG,iBAAiB,CAClB;AAEH;UACF;AAGA,cAAI,eAAe,GAAG;AACpB,iCAAqB,UAAU,aAAa,CAAC;AAE7C,wBAAY,UAAU,MAAM,CAAC;UAC/B;AAEA;AAGA,yBAAe,OAAO,OAAO,CAAC,cAAc,SAAS,CAAC;AAEtD,cAAI,aAAa,SAAS,oBAAoB;AAC5C,cAAE,MACA,IAAI,eACF,6DAA6D,aAAa,MAAM,iBAAiB,kBAAkB,IACnH,gBAAgB,CACjB;AAEH;UACF;AAEA,cAAI,aAAa,WAAW,oBAAoB;AAC9C,cAAE,KAAK,YAAY;AACnB,cAAE,SAAQ;AAEV,gCAAoB,KAAI;UAC1B;QACF;OACD;AAED,aAAO,MAAK;AACV,4BAAoB,KAAI;MAC1B;IACF,CAAC;;;;;ACxGH;;AAuCA;AAEA;AAGA;AAkCA;AAiBA;;;;;AChGA,IAIa;AAJb;;;AAEA,IAAAG;AAEO,IAAM,wBAAwB,CAAC,mBACpC,WAAW,OAAO,OAAI;AACpB,UAAI,eAAe,mBAAmB,eAAe,IAAI;AAEzD,eAAS,6BAA6B,OAAK;AACzC,cAAMC,kBAAiB,MAAM;AAE7B,YAAIA,gBAAe,OAAO;AACxB,YAAE,KAAK,OAAO,KAAKA,gBAAe,MAAM,MAAM,CAAC;QACjD;MACF;AAEA,qBAAe,mBAAkB,EAAG,KAAK,MAAK;AAC5C,uBAAe,iBAAiB,8BAA8B,4BAA4B;MAC5F,CAAC;AACD,aAAO,MAAK;AACV,YAAI,eAAe,iBAAiB,eAAe,IAAI;AACvD,uBAAe,kBAAiB;MAClC;IACF,CAAC;;;;;ACuCH,SAAe,KAAK,YAA6B,gBAAuB;;AACtE,QAAI;AAEJ,QAAI,OAAO,eAAe,UAAU;AAClC,UAAI,gBAAgB,UAAU,GAAG;AAC/B,YAAI,eAAe,iCAAiC;AACpD,eAAO,gBAAgB,UAAU;MACnC;AAEA,YAAM,YAAY,kBAAiB;AAEnC,eAAS,MAAM,UAAU,cAAc,mBAAkB,CAAE;IAC7D,OAAO;AACL,eAAS;IACX;AAEA,QAAI,CAAC,OAAO,KAAK,WAAW;AAC1B,UAAI,eAAe,8BAA8B;AACjD,YAAM,OAAO,KAAK,QAAO;IAC3B;AAEA,UAAM,CAAC,SAAS,KAAK,IAAI,MAAM,gBAAgB,MAAM;AACrD,UAAM,EAAE,aAAa,WAAW,WAAU,IAAK;AAC/C,UAAM,CAAC,QAAQ,OAAO,IAAI,MAAM,QAAQ,IAAI;MAC1C,QAAQ,kBAAkB,SAAS;MACnC,QAAQ,kBAAkB,UAAU;KACrC;AACD,UAAM,mBAAmB,sBAAsB,OAAO,EAAE,KACtD,IAAI,WAAQ;AACV,UAAI,aAAa,QAAQ,MAAM,SAAS,KAAK,CAAC;IAChD,CAAC,GACD,MAAK,CAAE;AAET,UAAM,QAAQ,iBAAiB,UAAS;AACxC,UAAM,YAAY,IAAI,mBAAmB,QAAQ,QAAQ,kBAAkB,WAAW;AAEtF,QAAI,CAAC,OAAO,KAAK,WAAW;AAC1B,YAAM,IAAI,mBAAkB;IAC9B;AAGA,oBAAgB,UAAU,EAAE,IAAI;AAEhC,UAAM,eAAe,OAAI;AACvB,cAAQ,IAAI,iBAAiB,CAAC;AAC9B,aAAO,gBAAgB,UAAU,EAAE;AACnC,gBAAU,qBAAqB;AAC/B,YAAM,YAAW;AACjB,aAAO,oBAAoB,0BAA0B,YAAY;AACjE,UAAI,eAAe,gBAAgB,UAAU,EAAE,gBAAgB;AAC/D,gBAAU,KAAK,cAAc,CAAC;IAChC;AAEA,WAAO,iBAAiB,0BAA0B,YAAY;AAC9D,UAAM,gBAAgB,KAAK,IAAG;AAE9B,QAAI;AACF,YAAM,UAAU,SAAQ;IAC1B;AACE,YAAM,eAAe,KAAK,IAAG;AAK7B,UAAI,eAAe,gBAAgB,KAAM;AACvC,yBAAiB;MACnB;AAEA,UAAI,gBAAgB;AAClB,cAAM,OAAO,KAAK,WAAU;AAE5B,cAAM,IAAI,QAAQ,OAAK,WAAW,GAAG,GAAI,CAAC;MAC5C;IACF;AAEA,QAAI,gBAAgB;AAClB,aAAO,KAAK,QAAQ,KAAK;IAC3B;AAEA,WAAO;EACT,CAAC;;oBAjIK,mBAWA,cAqBA,iBAEA,oBAMA,iBAgGe;;;AApJrB;AACA;AACA,IAAAC;AAEA;AACA;AACA,IAAAA;AACA;AACA;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,IAAM,oBAAoB,MAAK;AAE7B,YAAM,EAAE,UAAS,IAAK;AAEtB,UAAI,OAAO,cAAc,aAAa;AACpC,cAAM,IAAI,MAAM,6BAA6B;MAC/C;AAEA,aAAO;IACT;AAEA,IAAM,eAAe,MACnB,WAAW,OAAO,cAAW;AAC3B,YAAM,YAAY,kBAAiB;AAEnC,YAAM,wBAAwB,OAAI;AAChC,iBAAS,KAAK,EAAE,KAAK;MACvB;AAEA,gBAAU,iBAAiB,uBAAuB,qBAAqB;AACvE,UAAI,eAAe;AACnB,gBAAU,gBAAe,EAAG,KAAK,eAAY;AAC3C,YAAI,CAAC,cAAc;AACjB,mBAAS,KAAK,SAAS;QACzB;MACF,CAAC;AACD,aAAO,MAAK;AACV,uBAAe;AACf,kBAAU,oBAAoB,uBAAuB,qBAAqB;MAC5E;IACF,CAAC;AAEH,IAAM,kBAAkB,CAAA;AAExB,IAAM,qBAAqB,OAAO;MAChC,SAAS,yBAAwB,EAAG,IAAI,WAAS;QAC/C,UAAU,CAAC,IAAI;QACf;;AAGJ,IAAM,kBAAkB,CAAM,WAASC,WAAA,QAAA,QAAA,QAAA,aAAA;AACrC,UAAI,CAAC,OAAO;AAAM,cAAM,IAAI,MAAM,0BAA0B;AAC5D,YAAM,CAAC,OAAO,IAAI,MAAM,OAAO,KAAK,mBAAkB;AACtD,UAAI,CAAC;AAAS,cAAM,IAAI,MAAM,6BAA6B;AAC3D,YAAM,QAAQ,uBAAuB,QAAQ,IAAI;AACjD,UAAI,CAAC;AAAO,cAAM,IAAI,MAAM,mCAAmC;AAC/D,aAAO,CAAC,SAAS,KAAK;IACxB,CAAC;AAyFD,IAAqB,qBAArB,cAAgD,kBAAS;;;;;MAqBvD,OAAO,OAAO,UAAa;AACzB,YAAI,eAAe,WAAW;AAC9B,YAAI;AACJ,cAAM,YAAY,kBAAiB;AACnC,kBAAU,cAAc,mBAAkB,CAAE,EAAE,KAC5C,YAAS;AACP,cAAI,CAAC,cAAc;AACjB,qBAAS,KAAK;cACZ,MAAM;cACN,YAAY;aACb;AACD,qBAAS,SAAQ;UACnB;QACF,GACA,WAAQ;AACN,mBAAS,MAAM,IAAI,2BAA2B,MAAM,OAAO,CAAC;QAC9D,CAAC;AAGH,iBAAS,cAAW;AAClB,yBAAe;QACjB;AAEA,eAAO;UACL;;MAEJ;;;;MAKA,OAAa,KAAK,YAA2B;;AAC3C,iBAAO,KAAK,YAAY,IAAI;QAC9B,CAAC;;MAqBD,YACE,QACA,qBACA,kBACA,aAAwB;AAExB,cAAK;AAZP,aAAA,UAAU;AAGV,aAAA,qBAAqB;AAiFrB,aAAA,QAAQ,CAAOC,YAAkBD,WAAA,MAAA,QAAA,QAAA,aAAA;AAC/B,cAAI,aAAa,QAAQC,QAAO,SAAS,KAAK,CAAC;AAC/C,gBAAM,KAAK,oBAAoB,WAAWA,OAAM;QAClD,CAAC;AA1EC,aAAK,KAAK,OAAO;AACjB,aAAK,SAAS;AACd,aAAK,sBAAsB;AAC3B,aAAK,mBAAmB;AACxB,aAAK,cAAc;AACnB,YAAI,eAAe,gBAAgB,OAAO,KAAK,EAAE,CAAC,gBAAgB;MACpE;MAEM,WAAQ;;AACZ,cAAI,MAAM;AACV,gBAAM,KAAK,mBAAmB,MAAWD,WAAA,MAAA,QAAA,QAAA,aAAA;AACvC,gBAAI;AACF,qBACG,MAAM,eACL,MACE,KAAK,iBAAiB,KACpB,MAAM,CAAAC,YAAUA,QAAO,UAAU,CAAC,MAAM,CAAI,GAC5C,IAAI,CAAAA,YAAUA,QAAO,UAAU,CAAC,CAAC,CAAC,GAEpC,MAAM,MAAM,KAAK,KAAK,MAAM,OAAO,KAAK,CAAC,GAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,eAAc,CAAE,CAAC,CACtF,KACE;YACT,SAAS,GAAG;AACV,kBAAI,aAAa,kBAAkB,OAAO,CAAC,CAAC;AAC5C,mBAAK,OAAO,KAAK,WAAU;AAC3B,oBAAM;YACR;UACF,CAAC,CAAA;AAED,cAAI,MAAM,IAAI;AACZ,kBAAM,UAAU,MAAM;AACtB,gBAAI,eAAe,gBAAgB,OAAO,KAAK,EAAE,CAAC,gBAAgB,OAAO,OAAO,CAAC,EAAE;AACnF,iBAAK,UAAU;UACjB;AAEA,iBAAO,KAAK;QACd,CAAC;;;;;;;MAOK,SAAS,MAAY;;AACzB,gBAAM,IAAI,MAAM,KAAK,mBAAmB,MAAWD,WAAA,MAAA,QAAA,QAAA,aAAA;AACjD,gBAAI;AACF,oBAAM,QAAQ,KAAK,SAAS,KAAK;AACjC,kBAAI,QAAQ,MAAM,KAAK,EAAE;AACzB,oBAAM,OAAO,MAAM,eACjB,MAAM,KAAK,iBAAiB,KAAK,WAAW,GAAG,SAAS,KAAK,OAAO,MAAM,KAAK,OAAO,CAAC,CAAC;AAE1F,oBAAM,SAAS,KAAK,SAAS,KAAK;AAClC,kBAAI,QAAQ,MAAM,MAAM,EAAE;AAC1B,qBAAO;YACT,SAAS,GAAG;AACV,kBAAI,aAAa,kBAAkB,OAAO,CAAC,CAAC;AAE5C,kBAAI,KAAK,oBAAoB;AAE3B,qBAAK,OAAO,KAAK,WAAU;cAC7B;AAEA,oBAAM;YACR;UACF,CAAC,CAAA;AAED,iBAAO;QACT,CAAC;;MAED,iBAAc;MAAI;MAOZ,QAAK;;AACT,cAAI,KAAK,qBAAqB;AAC5B,kBAAM,KAAK;UACb;QACF,CAAC;;;;AAjKM,uBAAA,cAAc,MACnB,QAAQ,QAAO,EACZ,KAAK,iBAAiB,EACtB,KACC,MAAM,MACN,MAAM,KAAK;AAQV,uBAAA,sBAAsB,CAAC,aAAgC,aAAY,EAAG,UAAU,QAAQ;AACxF,uBAAA,OAAO,MAAW,QAAQ,QAAQ,CAAA,CAAE;AA4CpC,uBAAA,aAAa,CAAOE,QAAWF,WAAA,QAAA,QAAA,QAAA,aAAA;AACpC,UAAI,eAAe,mBAAmBE,GAAE,GAAG;AAC3C,YAAM,YAAY,gBAAgBA,GAAE;AAEpC,UAAI,WAAW;AACb,kBAAU,OAAO,KAAK,WAAU;MAClC;IACF,CAAC;8BAlEkB;;;;;ACtIrB,SAAS,WAAW,OAAK;AACvB,QAAM,IAAI,OAAO,MAAM,CAAC;AACxB,IAAE,cAAc,OAAO,CAAC;AACxB,SAAO;AACT;AAnBA,IAaM,KAQA,YAYA,kBAkGN;AAnIA;;;AAaA,IAAM,MAAM;AAQZ,IAAM,aAAa;MACjB,MAAM,OAAO,MAAM,CAAC;MACpB,YAAY;MACZ,UAAU;;AASZ,IAAM,mBAAmB,CAAC,SAAiB,eAAsB;AAC/D,aAAO;;;;;;;QAOL,WAAW,MAAY;AAKrB,cAAI,OAAO,OAAO,OAAO,CAAC,WAAW,KAAK,MAAM,GAAG,IAAI,CAAC;AAExD,gBAAM,YAAY,aAAa;AAC/B,gBAAM,WAAW,KAAK,KAAK,KAAK,SAAS,SAAS;AAGlD,iBAAO,OAAO,OAAO,CAAC,MAAM,OAAO,MAAM,WAAW,YAAY,KAAK,SAAS,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AAEzF,gBAAM,SAAmB,CAAA;AAEzB,mBAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,kBAAM,OAAO,OAAO,MAAM,CAAC;AAC3B,iBAAK,cAAc,SAAS,CAAC;AAC7B,iBAAK,WAAW,KAAK,CAAC;AACtB,iBAAK,cAAc,GAAG,CAAC;AAGvB,kBAAM,QAAQ,KAAK,MAAM,IAAI,YAAY,IAAI,KAAK,SAAS;AAE3D,mBAAO,KAAK,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;UAC1C;AAEA,iBAAO;QACT;;;;;;;;;QAUA,eAAe,KAAkB,OAAa;AAC5C,cAAI,EAAE,MAAM,YAAY,SAAQ,IAAK,OAAO;AAE5C,cAAI,MAAM,aAAa,CAAC,MAAM,SAAS;AACrC,kBAAM,IAAI,eAAe,mBAAmB,gBAAgB;UAC9D;AAEA,cAAI,MAAM,UAAU,CAAC,MAAM,KAAK;AAC9B,kBAAM,IAAI,eAAe,eAAe,YAAY;UACtD;AAEA,cAAI,MAAM,aAAa,CAAC,MAAM,UAAU;AACtC,kBAAM,IAAI,eAAe,oBAAoB,iBAAiB;UAChE;AAGA,cAAI,CAAC,KAAK;AACR,yBAAa,MAAM,aAAa,CAAC;UACnC;AAEA;AAEA,gBAAM,YAAY,MAAM,MAAM,MAAM,IAAI,CAAC;AACzC,iBAAO,OAAO,OAAO,CAAC,MAAM,SAAS,CAAC;AAGtC,cAAI,KAAK,SAAS,YAAY;AAC5B,mBAAO,KAAK,MAAM,GAAG,UAAU;UACjC;AAEA,iBAAO;YACL;YACA;YACA;;QAEJ;;;;;;;;QASA,iBAAiB,KAAgB;AAC/B,cAAI,OAAO,IAAI,eAAe,IAAI,KAAK,QAAQ;AAC7C,mBAAO,IAAI;UACb;QACF;;IAEJ;AAEA,IAAA,sBAAe;;;;;AC3HT,SAAgB,sBAAmB;;AACvC,UAAM,SAAS,MAAM,UAAU,IAAI,cAAc;MAC/C,SAAS;KACV;AACD,WAAO;EACT,CAAC;;AAEK,SAAgB,mBAAgB;;AACpC,UAAMC,WAAU,MAAM,UAAU,IAAI,WAAU;AAC9C,WAAOA,SAAQ,OAAO,OAAK,EAAE,aAAa,iBAAiB;EAC7D,CAAC;;AAEK,SAAgB,uBAAoB;;AACxC,UAAM,kBAAkB,MAAM,iBAAgB;AAC9C,QAAI,gBAAgB,SAAS;AAAG,aAAO,gBAAgB,CAAC;AACxD,WAAO,oBAAmB;EAC5B,CAAC;;gBAtBK,eAwBO;;;AA1Bb,IAAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,IAAM,gBAAgB;MACpB;QACE,UAAU;;;AAsBP,IAAM,cAAc,MACzB,QAAQ,QAAQ,CAAC,CAAC,aAAa,CAAC,CAAC,UAAU,OAAO,OAAO,UAAU,IAAI,eAAe,UAAU;;;;;AC2LlG,SAAe,sBAAsB,QAAiB;;AACpD,QAAI;AACF,YAAM,OAAO,MAAK;IACpB,SAAS,KAAK;AACZ,cAAQ,KAAK,GAAG;IAClB;EACF,CAAC;;gBA7MK,oBACA,gBASe;;;AAzBrB;AAEA;AACA,IAAAC;AAEA,IAAAA;AACA;AAOA;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,IAAM,qBAAqB;AAC3B,IAAM,iBAAiB;AASvB,IAAqB,kBAArB,MAAqB,yBAAwB,kBAAS;MAOpD,YAAY,QAAmB,iBAAuB;AACpD,cAAK;AALP,aAAA,UAAU,KAAK,MAAM,KAAK,OAAM,IAAK,KAAM;AAC3C,aAAA,aAAa;AAyHb,aAAA,qBAAqB;AACrB,aAAA,kBAAkB,CAAC,MAAY;AAC7B,cAAI,KAAK;AAAoB;AAC7B,eAAK,qBAAqB;AAC1B,eAAK,KAAK,cAAc,CAAC;QAC3B;AAzHE,aAAK,SAAS;AACd,aAAK,kBAAkB;AACvB,aAAK,cAAc,qBAAqB,OAAO,SAAS;MAC1D;;;;MAqDA,OAAa,UAAO;;AAClB,gBAAM,SAAS,MAAM,oBAAmB;AACxC,iBAAO,iBAAgB,KAAK,MAAM;QACpC,CAAC;;;;;MAKD,OAAa,gBAAa;;AACxB,gBAAMC,WAAU,MAAM,iBAAgB;AACtC,cAAIA,SAAQ,WAAW;AAAG,mBAAO;AACjC,iBAAO,iBAAgB,KAAKA,SAAQ,CAAC,CAAC;QACxC,CAAC;;;;;MAKD,OAAa,KAAK,QAAiB;;AACjC,gBAAM,OAAO,KAAI;AAEjB,cAAI,OAAO,kBAAkB,MAAM;AACjC,kBAAM,OAAO,oBAAoB,kBAAkB;UACrD;AAEA,gBAAM,sBAAsB,MAAM;AAClC,gBAAM,QAAQ,OAAO,eAAe,CAAC,EAAE,WAAW,KAAK,CAAC,EAAE,WAAU,MAClE,WAAW,KAAK,OAAK,EAAE,mBAAmB,GAAG,CAAC;AAGhD,cAAI,CAAC,OAAO;AACV,kBAAM,IAAI,+BACR,mGAAmG;UAEvG;AAEA,gBAAM,kBAAkB,MAAM;AAE9B,cAAI;AACF,kBAAM,OAAO,eAAe,eAAe;UAC7C,SAAS,GAAQ;AACf,kBAAM,OAAO,MAAK;AAClB,kBAAM,IAAI,+BAA+B,EAAE,OAAO;UACpD;AAEA,gBAAM,YAAY,IAAI,iBAAgB,QAAQ,eAAe;AAE7D,gBAAM,eAAe,OAAI;AACvB,gBAAI,WAAW,EAAE,QAAQ;AAEvB,wBAAU,IAAI,oBAAoB,cAAc,YAAY;AAE5D,wBAAU,gBAAgB,IAAI,mBAAkB,CAAE;YACpD;UACF;AAGA,oBAAU,IAAI,iBAAiB,cAAc,YAAY;AACzD,iBAAO;QACT,CAAC;;;;;MAYK,QAAK;;AACT,gBAAM,KAAK;AACX,gBAAM,KAAK,OAAO,iBAAiB,KAAK,eAAe;AACvD,gBAAM,sBAAsB,KAAK,MAAM;AACvC,gBAAM,KAAK,OAAO,MAAK;QACzB,CAAC;;;;;;;MAOK,SAAS,MAAY;;AACzB,gBAAM,IAAI,MAAM,KAAK,mBAAmB,MAAWC,WAAA,MAAA,QAAA,QAAA,aAAA;AACjD,kBAAM,EAAE,SAAS,WAAU,IAAK;AAChC,gBAAI,QAAQ,QAAQ,KAAK,SAAS,KAAK,CAAC;AACxC,kBAAM,UAAU,oBAAW,SAAS,UAAU;AAE9C,kBAAM,SAAS,QAAQ,WAAW,IAAI;AAEtC,qBAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,oBAAM,KAAK,OAAO,YAAY,gBAAgB,OAAO,CAAC,CAAC;YACzD;AAGA,gBAAI;AACJ,gBAAI;AAEJ,mBAAO,EAAE,SAAS,QAAQ,iBAAiB,GAAG,IAAI;AAChD,oBAAM,IAAI,MAAM,KAAK,OAAO,WAAW,gBAAgB,UAAU;AAGjE,oBAAMC,UAAS,OAAO,KAAK,EAAE,KAAK,MAAM;AACxC,oBAAM,QAAQ,eAAe,KAAKA,OAAM;YAC1C;AAEA,gBAAI,QAAQ,QAAQ,OAAO,SAAS,KAAK,CAAC;AAC1C,mBAAO;UACT,CAAC,CAAA,EAAE,MAAM,OAAI;AACX,gBAAI,KAAK,EAAE,WAAW,EAAE,QAAQ,SAAS,cAAc,GAAG;AACxD,mBAAK,gBAAgB,CAAC;AAEtB,oBAAM,IAAI,kCAAkC,EAAE,OAAO;YACvD;AAEA,kBAAM;UACR,CAAC;AAED,iBAAO;QACT,CAAC;;MAED,iBAAc;MAAI;;AAzKX,oBAAA,cAAc;AAKd,oBAAA,OAAO;AAQP,oBAAA,SAAS,CAAC,aAAgE;AAC/E,UAAI,eAAe;AACnB,2BAAoB,EAAG,KACrB,YAAS;AACP,YAAI,CAAC,cAAc;AACjB,gBAAM,cAAc,qBAAqB,OAAO,SAAS;AACzD,mBAAS,KAAK;YACZ,MAAM;YACN,YAAY;YACZ;WACD;AACD,mBAAS,SAAQ;QACnB;MACF,GACA,WAAQ;AACN,YAAI,OAAO,gBAAgB,iBAAiB,OAAO,gBAAgB,MAAM,SAAS,IAAI;AACpF,mBAAS,MAAM,IAAI,+BAA+B,MAAM,OAAO,CAAC;QAClE,OAAO;AACL,mBAAS,MAAM,IAAI,2BAA2B,MAAM,OAAO,CAAC;QAC9D;MACF,CAAC;AAGH,eAAS,cAAW;AAClB,uBAAe;MACjB;AAEA,aAAO;QACL;;IAEJ;8BA5DmB;;;;;ACGrB,SAAe,uBAAoB;;AACjC,UAAM,SAAS,MAAM,OAAM,EAAG,cAAc;MAC1C,SAASC;KACV;AACD,QAAI,MAAM,QAAQ,MAAM;AAAG,aAAO;AAClC,WAAO,CAAC,MAAM;EAChB,CAAC;;AAED,SAAeC,oBAAgB;;AAC7B,UAAMC,WAAU,MAAM,OAAM,EAAG,WAAU;AACzC,WAAOA,SAAQ,OAAO,OAAK,EAAE,aAAa,iBAAiB;EAC7D,CAAC;;AAED,SAAeC,wBAAoB;;AACjC,UAAM,kBAAkB,MAAMF,kBAAgB;AAC9C,QAAI,gBAAgB,SAAS;AAAG,aAAO,gBAAgB,CAAC;AACxD,UAAMC,WAAU,MAAM,qBAAoB;AAC1C,WAAOA,SAAQ,CAAC;EAClB,CAAC;;gBAjCKF,gBAMAI,cAEA,QAkCe;;;AAvDrB;AAEA;AACA,IAAAC;AAEA,IAAAA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAOA,IAAML,iBAAgB;MACpB;QACE,UAAU;;;AAId,IAAMI,eAAc,MAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,aAAa,OAAO,UAAU,IAAI;AAEtF,IAAM,SAAS,MAAU;AAEvB,YAAM,EAAE,IAAG,IAAK;AAChB,UAAI,CAAC;AAAK,cAAM,IAAI,eAAe,kCAAkC,iBAAiB;AACtF,aAAO;IACT;AA6BA,IAAqB,kBAArB,MAAqB,yBAAwB,kBAAS;MAMpD,YAAY,QAAiB;AAC3B,cAAK;AAJP,aAAA,UAAU,KAAK,MAAM,KAAK,OAAM,IAAK,KAAM;AAC3C,aAAA,aAAa;AAUb,aAAA,SAAmB,CAAA;AAEnB,aAAA,OAAO,MAAsB;AAC3B,cAAI,KAAK,OAAO,QAAQ;AACtB,mBAAO,QAAQ,QAAQ,KAAK,OAAO,MAAK,CAAuB;UACjE;AAEA,iBAAO,IAAI,QAAQ,aAAU;AAC3B,iBAAK,gBAAgB;UACvB,CAAC;QACH;AACA,aAAA,gBAAgB,CAAC,MAA0B;AACzC,gBAAME,UAAS,OAAO,KAAK,EAAE,KAAK,MAAM;AAExC,cAAI,KAAK,eAAe;AACtB,iBAAK,cAAcA,OAAM;AACzB,iBAAK,gBAAgB;UACvB,OAAO;AACL,iBAAK,OAAO,KAAKA,OAAM;UACzB;QACF;AAuFA,aAAA,qBAAqB;AACrB,aAAA,kBAAkB,CAAC,MAAY;AAC7B,cAAI,KAAK;AAAoB;AAC7B,eAAK,qBAAqB;AAC1B,eAAK,KAAK,cAAc,CAAC;QAC3B;AAgBA,aAAA,WAAW,CAAO,SAAiCC,WAAA,MAAA,QAAA,QAAA,aAAA;AACjD,gBAAM,IAAI,MAAM,KAAK,mBAAmB,MAAWA,WAAA,MAAA,QAAA,QAAA,aAAA;AACjD,kBAAM,EAAE,SAAS,WAAU,IAAK;AAChC,gBAAI,QAAQ,QAAQ,KAAK,SAAS,KAAK,CAAC;AACxC,kBAAM,UAAU,oBAAW,SAAS,UAAU;AAE9C,kBAAM,SAAS,QAAQ,WAAW,IAAI;AAEtC,qBAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,oBAAM,KAAK,OAAO,WAAW,GAAG,OAAO,CAAC,CAAC;YAC3C;AAGA,gBAAI;AACJ,gBAAI;AAEJ,mBAAO,EAAE,SAAS,QAAQ,iBAAiB,GAAG,IAAI;AAChD,oBAAMD,UAAS,MAAM,KAAK,KAAI;AAC9B,oBAAM,QAAQ,eAAe,KAAKA,OAAM;YAC1C;AAEA,gBAAI,QAAQ,QAAQ,OAAO,SAAS,KAAK,CAAC;AAC1C,mBAAO;UACT,CAAC,CAAA,EAAE,MAAM,OAAI;AACX,gBAAI,KAAK,EAAE,WAAW,EAAE,QAAQ,SAAS,OAAO,GAAG;AACjD,mBAAK,gBAAgB,CAAC;AAEtB,oBAAM,IAAI,kCAAkC,EAAE,OAAO;YACvD;AAEA,kBAAM;UACR,CAAC;AACD,iBAAO;QACT,CAAC;AAvKC,aAAK,SAAS;AACd,aAAK,cACH,OAAO,OAAO,cAAc,WAAW,qBAAqB,OAAO,SAAS,IAAI;AAClF,eAAO,iBAAiB,eAAe,KAAK,aAAa;MAC3D;;;;MA4EA,OAAa,UAAO;;AAClB,gBAAM,CAAC,MAAM,IAAI,MAAM,qBAAoB;AAC3C,iBAAO,iBAAgB,KAAK,MAAM;QACpC,CAAC;;;;;MAKD,OAAa,gBAAa;;AACxB,gBAAMJ,WAAU,MAAMD,kBAAgB;AACtC,cAAIC,SAAQ,WAAW;AAAG,mBAAO;AACjC,iBAAO,iBAAgB,KAAKA,SAAQ,CAAC,CAAC;QACxC,CAAC;;;;;MAKD,OAAa,KAAK,QAAiB;;AACjC,gBAAM,OAAO,KAAI;AACjB,gBAAM,YAAY,IAAI,iBAAgB,MAAM;AAE5C,gBAAM,eAAe,OAAI;AACvB,gBAAI,WAAW,EAAE,QAAQ;AACvB,qBAAM,EAAG,oBAAoB,cAAc,YAAY;AAEvD,wBAAU,gBAAgB,IAAI,mBAAkB,CAAE;YACpD;UACF;AAEA,iBAAM,EAAG,iBAAiB,cAAc,YAAY;AACpD,iBAAO;QACT,CAAC;;;;;MAYK,QAAK;;AACT,gBAAM,KAAK;AACX,eAAK,OAAO,oBAAoB,eAAe,KAAK,aAAa;AACjE,gBAAM,KAAK,OAAO,MAAK;QACzB,CAAC;;MA0CD,iBAAc;MAAI;;AA1IX,oBAAA,cAAcE;AAKd,oBAAA,OAAOH;AAQP,oBAAA,SAAS,CAAC,aAAgE;AAC/E,UAAI,eAAe;AACnB,MAAAE,sBAAoB,EAAG,KACrB,YAAS;AACP,YAAI,CAAC,QAAQ;AACX,mBAAS,MAAM,IAAI,2BAA2B,oCAAoC,CAAC;QACrF,WAAW,CAAC,cAAc;AACxB,gBAAM,cACJ,OAAO,OAAO,cAAc,WACxB,qBAAqB,OAAO,SAAS,IACrC;AACN,mBAAS,KAAK;YACZ,MAAM;YACN,YAAY;YACZ;WACD;AACD,mBAAS,SAAQ;QACnB;MACF,GACA,WAAQ;AACN,iBAAS,MAAM,IAAI,2BAA2B,MAAM,OAAO,CAAC;MAC9D,CAAC;AAGH,eAAS,cAAW;AAClB,uBAAe;MACjB;AAEA,aAAO;QACL;;IAEJ;8BAnFmB;;;;;ACvDrB;AAAA;AAAA;AAAA;AAAA,IASa;AATb;AAAA;AAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAM,SAAN,MAAM,QAAO;AAAA,MAChB,OAAO,cAAc;AAAA,MACrB,UAAU;AAAA,MACV,IAAI,SAAS;AAAE,eAAO,KAAK;AAAA,MAAS;AAAA,MACpC,cAAc;AAAA,MACd,gBAAgB;AAAA,MAChB,YAAY;AAAA,MACZ,mBAAmB;AAAA,MACnB,cAAc;AACV,YAAI,CAAC,QAAO,aAAa;AACrB,gBAAM,IAAI,MAAM,2DAA2D;AAAA,QAC/E;AACA,gBAAO,cAAc;AAAA,MACzB;AAAA,MACA,aAAa,OAAO;AAChB,gBAAO,cAAc;AACrB,cAAM,OAAO,IAAI,KAAK;AACtB,cAAM,KAAK,oBAAoB;AAC/B,cAAM,KAAK,OAAO;AAClB,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,MAAM,sBAAsB;AACxB,gBAAQ,IAAI,oCAAoC;AAChD,cAAM,WAAW;AAAA,UACb,KAAK,MAAM,wBAAa,YAAY;AAAA,UACpC,KAAK,MAAM,wBAAa,YAAY;AAAA,UACpC,KAAK,MAAM,wBAAa,YAAY;AAAA,QACxC;AACA,gBAAQ,IAAI,QAAQ,SAAS,GAAG,UAAU,SAAS,GAAG,UAAU,SAAS,GAAG,EAAE;AAC9E,YAAI,SAAS,KAAK;AACd,eAAK,mBAAmB;AAAA,QAC5B,WACS,SAAS,KAAK;AACnB,eAAK,mBAAmB;AAAA,QAC5B,WACS,SAAS,KAAK;AACnB,eAAK,mBAAmB;AAAA,QAC5B,OACK;AACD,gBAAM,IAAI,MAAM,qBAAqB;AAAA,QACzC;AAAA,MACJ;AAAA,MACA,MAAM,SAAS;AACX,cAAM,EAAE,IAAI,IAAI,WAAW;AAC3B,YAAI,KAAK;AACL,cAAI,iBAAiB,WAAW,QAAQ,IAAI,KAAK,OAAO,CAAC;AACzD,cAAI,iBAAiB,cAAc,QAAQ,IAAI,KAAK,OAAO,CAAC;AAAA,QAChE;AAAA,MACJ;AAAA,MACA,MAAM,UAAU;AACZ,cAAM,EAAE,IAAI,IAAI,WAAW;AAC3B,YAAI,KAAK;AACL,cAAI,oBAAoB,cAAc,KAAK,gBAAgB,KAAK,IAAI,CAAC;AACrE,cAAI,iBAAiB,cAAc,KAAK,gBAAgB,KAAK,IAAI,CAAC;AAAA,QACtE;AACA,cAAM,UAAU,MAAM,KAAK,QAAQ;AACnC,YAAI,QAAQ,WAAW,MAAM;AACzB,cAAI,QAAQ,SAAS,QAAQ;AACzB,kBAAM,UAAU,MAAM,KAAK,QAAQ;AACnC,gBAAI,QAAQ,WAAW,MAAM;AACzB,mBAAK,UAAU;AAAA,YACnB,WACS,QAAQ,WAAW,iCAAiC;AACzD,mBAAK,UAAU;AAAA,YACnB,OACK;AACD,mBAAK,UAAU;AAAA,YACnB;AAAA,UACJ,WACS,QAAQ,SAAS,SAAS;AAC/B,kBAAMK,QAAO,MAAM,KAAK,KAAK;AAC7B,iBAAK,UAAWA,MAAK,WAAW,OAC1B,cACA;AAAA,UACV,OACK;AACD,iBAAK,UAAU;AAAA,UACnB;AAAA,QACJ,OACK;AACD,eAAK,UAAU;AAAA,QACnB;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,MAAM,gBAAgB,GAAG;AACrB,YAAI,EAAE,QAAQ,qBAAqB,UAAU;AACzC,gBAAM,EAAE,IAAI,IAAI,WAAW;AAC3B,cAAI,oBAAoB,cAAc,KAAK,eAAe;AAC1D,eAAK,UAAU;AAAA,QACnB;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAcA,MAAM,OAAO;AACT,cAAM,OAAO,IAAI,YAAY,EAAE,OAAO,MAAM;AAC5C,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,cAAM,WAAW,MAAM,UAAU,KAAK,KAAM,KAAM,GAAM,GAAM,IAAI,EAC7D,KAAK,SAAO,MAAM,MAAM,GAAG,CAAC,EAC5B,MAAM,SAAO,IAAI,UAAU;AAChC,eAAO,IAAI,QAAQ,aAAW,WAAW,SAAS,KAAM,EAAE,QAAQ,oBAAoB,QAAQ,EAAE,CAAC,CAAC;AAAA,MACtG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAcA,MAAM,QAAQ;AACV,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,cAAM,WAAW,MAAM,UAAU,KAAK,KAAM,KAAM,GAAM,CAAI,EACvD,KAAK,SAAO,MAAM,MAAM,GAAG,CAAC,EAC5B,MAAM,SAAO,IAAI,UAAU;AAChC,eAAO,IAAI,QAAQ,aAAW,WAAW,SAAS,KAAM,EAAE,QAAQ,oBAAoB,QAAQ,EAAE,CAAC,CAAC;AAAA,MACtG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,MAAM,UAAU;AACZ,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,cAAM,WAAW,MAAM,UAAU,KAAK,KAAM,GAAM,GAAM,CAAI,EACvD,MAAM,SAAO,IAAI,QAAQ,IAAI,UAAU,CAAC;AAC7C,cAAM,UAAU,MAAM;AACtB,YAAI,SAAS,WAAW,GAAG;AACvB,gBAAMC,cAAa,MAAM,MAAM,QAAQ;AACvC,gBAAMC,UAAS,oBAAoBD,WAAU,KAAK;AAClD,iBAAO,EAAE,QAAAC,SAAQ,MAAM,MAAM,SAAS,KAAK;AAAA,QAC/C;AACA,cAAM,aAAa,SAAS,CAAC;AAC7B,cAAM,OAAO,SAAS,MAAM,GAAG,IAAI,UAAU,EAAE,SAAS;AACxD,cAAM,gBAAgB,SAAS,IAAI,UAAU;AAC7C,cAAM,UAAU,SAAS,MAAM,IAAI,aAAa,GAAG,IAAI,aAAa,IAAI,aAAa,EAAE,SAAS;AAChG,cAAM,aAAa,MAAM,MAAM,SAAS,MAAM,EAAE,CAAC;AACjD,cAAM,SAAS,oBAAoB,UAAU;AAC7C,eAAO,EAAE,QAAQ,MAAM,QAAQ;AAAA,MACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAM,QAAQ,QAAQ,GAAG,OAAO,OAAO;AACnC,YAAI,OAAO,UAAU,YAAY,QAAQ,KAAK,SAAS,iBAAiB;AACpE,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC/C;AACA,cAAM,UAAU,IAAI,QAAQ,gBAAgB,iBAAiB,CAAC;AAC9D,cAAM,OAAO,IAAI,QAAQ,kBAAkB,iBAAiB,CAAC;AAC7D,cAAM,UAAU,IAAI,QAAQ,QAAQ,iBAAiB,CAAC;AACtD,cAAM,OAAO,IAAI,WAAW,CAAC,GAAM,GAAG,SAAS,GAAG,MAAM,GAAG,OAAO,CAAC;AACnE,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,cAAM,WAAW,MAAM,UAAU,KAAK,KAAM,GAAM,OAAO,IAAO,GAAM,GAAM,IAAI,EAC3E,MAAM,SAAO,IAAI,QAAQ,IAAI,UAAU,CAAC;AAC7C,cAAM,UAAU,MAAM;AACtB,YAAI,SAAS,WAAW,GAAG;AACvB,gBAAM,aAAa,MAAM,MAAM,QAAQ;AACvC,gBAAM,SAAS,oBAAoB,UAAU,KAAK;AAClD,iBAAO,EAAE,QAAQ,WAAW,MAAM,SAAS,KAAK;AAAA,QACpD;AACA,YAAI;AACA,gBAAM,YAAY,MAAM,MAAM,SAAS,MAAM,GAAG,EAAE,CAAC;AACnD,gBAAM,gBAAgB,SAAS,EAAE;AACjC,gBAAM,UAAU,SAAS,MAAM,IAAI,KAAK,aAAa,EAAE,SAAS;AAChE,gBAAM,aAAa,MAAM,MAAM,SAAS,MAAM,KAAK,aAAa,CAAC;AACjE,gBAAM,SAAS,oBAAoB,UAAU;AAC7C,iBAAO,EAAE,QAAQ,WAAW,QAAQ;AAAA,QACxC,SACO,KAAK;AACR,iBAAO,EAAE,QAAQ,yBAAyB,WAAW,MAAM,SAAS,KAAK;AAAA,QAC7E;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,WAAW,QAAQ,GAAG,OAAO;AAC/B,YAAI,OAAO,UAAU,YAAY,QAAQ,KAAK,SAAS,iBAAiB;AACpE,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC/C;AACA,YAAI,EAAE,iBAAiB,cAAc,EAAE,iBAAiB,iBAAiB,EAAE,iBAAiB,cAAc;AACtG,gBAAM,IAAI,UAAU,sBAAsB;AAAA,QAC9C;AACA,YAAI,CAAC,MAAM,WAAW;AAClB,gBAAM,IAAI,eAAe,6BAA6B;AAAA,QAC1D;AACA,cAAM,UAAU,IAAI,QAAQ,gBAAgB,iBAAiB,CAAC;AAC9D,cAAM,OAAO,IAAI,QAAQ,kBAAkB,iBAAiB,CAAC;AAC7D,cAAM,UAAU,IAAI,QAAQ,QAAQ,iBAAiB,CAAC;AACtD,cAAM,WAAW,IAAI,QAAQ,MAAM,QAAQ;AAC3C,cAAM,OAAO,IAAI,QAAQ,MAAM,IAAI;AACnC,cAAM,iBAAiB,IAAI,QAAQ,MAAM,eAAe,SAAS;AACjE,cAAM,UAAU,IAAI,QAAQ,OAAO,MAAM,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE;AAClE,cAAM,YAAY,IAAI,QAAQ,MAAM,SAAS;AAC7C,cAAM,OAAO,IAAI,WAAW,CAAC,GAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,GAAG,UAAU,GAAG,MAAM,GAAG,gBAAgB,GAAG,SAAS,GAAG,SAAS,CAAC;AACtI,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,cAAM,WAAW,MAAM,UAAU,KAAK,KAAM,GAAM,GAAM,GAAM,IAAI,EAC7D,KAAK,SAAO,MAAM,MAAM,GAAG,CAAC,EAC5B,MAAM,SAAO,IAAI,UAAU;AAChC,cAAM,UAAU,MAAM;AACtB,eAAO,EAAE,QAAQ,oBAAoB,QAAQ,EAAE;AAAA,MACnD;AAAA,MACA,MAAM,KAAK,QAAQ,GAAG,OAAO;AACzB,YAAI,OAAO,UAAU,YAAY,QAAQ,KAAK,SAAS,iBAAiB;AACpE,gBAAM,IAAI,UAAU,uBAAuB;AAAA,QAC/C;AACA,cAAM,UAAU,IAAI,QAAQ,gBAAgB,iBAAiB,CAAC;AAC9D,cAAM,OAAO,IAAI,QAAQ,kBAAkB,iBAAiB,CAAC;AAC7D,cAAM,UAAU,IAAI,QAAQ,QAAQ,iBAAiB,CAAC;AACtD,cAAM,YAAY,MAAM,KAAK,iBAAiB,OAAO,KAAK,aAAa,KAAK,aAAa;AACzF,YAAI,OAAO,UAAU,UAAU;AAE3B,gBAAM,QAAQ,KAAK,QAAQ,KAAK;AAChC,cAAI,MAAM,WAAW,IAAI;AACrB,kBAAM,IAAI,WAAW,8BAA8B;AAAA,UACvD;AACA,gBAAM,OAAO,IAAI,WAAW,CAAC,GAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,GAAG,KAAK,CAAC;AAC7E,gBAAM,WAAW,MAAM,UAAU,KAAK,KAAM,GAAM,GAAM,GAAM,IAAI,EAC7D,MAAM,SAAO,IAAI,QAAQ,IAAI,UAAU,CAAC;AAC7C,gBAAM,UAAU,MAAM;AACtB,cAAI,SAAS,WAAW,GAAG;AACvB,kBAAMD,cAAa,MAAM,MAAM,QAAQ;AACvC,kBAAMC,UAAS,oBAAoBD,WAAU,KAAK;AAClD,mBAAO,EAAE,QAAAC,SAAQ,WAAW,KAAK;AAAA,UACrC;AACA,gBAAM,YAAY,MAAM,MAAM,SAAS,MAAM,GAAG,EAAE,CAAC;AACnD,gBAAM,aAAa,MAAM,MAAM,SAAS,MAAM,EAAE,CAAC;AACjD,gBAAM,SAAS,oBAAoB,UAAU;AAC7C,iBAAO,EAAE,QAAQ,UAAU;AAAA,QAC/B,OACK;AAED,gBAAM,WAAW,IAAI,QAAQ,MAAM,QAAQ;AAC3C,gBAAM,OAAO,IAAI,QAAQ,MAAM,IAAI;AACnC,gBAAM,iBAAiB,IAAI,QAAQ,MAAM,eAAe,SAAS;AACjE,gBAAM,UAAU,IAAI,QAAQ,OAAO,MAAM,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE;AAClE,gBAAM,OAAO,IAAI,WAAW,CAAC,GAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,GAAG,UAAU,GAAG,MAAM,GAAG,gBAAgB,GAAG,OAAO,CAAC;AACxH,gBAAM,WAAW,MAAM,UAAU,KAAK,KAAM,GAAM,GAAM,GAAM,IAAI,EAC7D,MAAM,SAAO,IAAI,QAAQ,IAAI,UAAU,CAAC;AAC7C,gBAAM,UAAU,MAAM;AACtB,cAAI,SAAS,WAAW,GAAG;AACvB,kBAAMD,cAAa,MAAM,MAAM,QAAQ;AACvC,kBAAMC,UAAS,oBAAoBD,WAAU,KAAK;AAClD,mBAAO,EAAE,QAAAC,SAAQ,WAAW,MAAM,MAAM,KAAK;AAAA,UACjD;AACA,gBAAMC,QAAO,MAAM,MAAM,SAAS,MAAM,GAAG,EAAE,CAAC;AAC9C,gBAAM,YAAY,MAAM,MAAM,SAAS,MAAM,IAAI,EAAE,CAAC;AACpD,gBAAM,aAAa,MAAM,MAAM,SAAS,MAAM,EAAE,CAAC;AACjD,gBAAM,SAAS,oBAAoB,UAAU;AAC7C,iBAAO,EAAE,QAAQ,WAAW,MAAAA,MAAK;AAAA,QACrC;AAAA,MACJ;AAAA,MACA,MAAM,YAAY,OAAO,OAAO,MAAM;AAClC,YAAI,OAAO,UAAU,YAAY,MAAM,gBAAgB,KAAK;AACxD,gBAAM,OAAO;AAAA,YACT,cAAc;AAAA,YACd,QAAQ;AAAA,UACZ;AACA,gBAAM,MAAM,MAAM,KAAK,KAAK,cAAc,IAAI;AAC9C,cAAI,CAAC,OAAO,IAAI,OAAO,OAAO;AAC1B,kBAAM,IAAI,MAAM,8BAA8B,GAAG;AAAA,UACrD;AACA,kBAAQ,IAAI;AAAA,QAChB;AACA,eAAO,KAAK,WAAW,OAAO,KAAK;AAAA,MACvC;AAAA,IACJ;AAAA;AAAA;;;ACtDA,SAAS,SAAS,OAAO;AACrB,MAAI,MAAM,WAAW,MAAM;AACvB,UAAM,IAAI,MAAM,iBAAiB;AAAA,EACrC;AACA,MAAI,MAAM,YAAY,QAAQ,MAAM,aAAa,IAAI;AACjD,UAAM,IAAI,MAAM,kBAAkB;AAAA,EACtC;AACA,MAAI,MAAM,kBAAkB,MAAM;AAC9B,UAAM,IAAI,MAAM,wBAAwB;AAAA,EAC5C;AACA,MAAI,MAAM,WAAW,MAAM;AACvB,UAAM,IAAI,MAAM,iBAAiB;AAAA,EACrC;AACA,MAAI,MAAM,UAAU,GAAG;AACnB,UAAM,IAAI,MAAM,kBAAkB;AAAA,EACtC;AACA,UAAQ,MAAM,aAAa;AAAA,IACvB,KAAK,WAAW;AACZ,UAAI,MAAM,QAAQ,QAAQ,MAAM,SAAS,IAAI;AACzC,cAAM,IAAI,MAAM,mBAAmB;AAAA,MACvC;AACA;AAAA,IACJ;AAAA,IACA,KAAK,cAAc;AACf,UAAI,MAAM,QAAQ,MAAM;AACpB,cAAM,IAAI,MAAM,gCAAgC;AAAA,MACpD;AACA;AAAA,IACJ;AAAA,IACA,KAAK,aAAa;AACd,UAAI,MAAM,QAAQ,MAAM;AACpB,cAAM,IAAI,MAAM,2BAA2B;AAAA,MAC/C;AACA,UAAI,CAAC,MAAM,SAAS,GAAG;AACnB,cAAM,IAAI,MAAM,2BAA2B;AAAA,MAC/C;AACA;AAAA,IACJ;AAAA,EACJ;AACJ;AA/RA,IAcM,OAgKO,WAyBA,cA0BA;AAjOb;AAAA;AAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AAMA,IAAM,QAAN,MAAM,OAAM;AAAA,MACR,OAAO,QAAQ,IAAI,KAAK,cAAM;AAAA,MAC9B;AAAA,MACA,OAAO;AAAA,MACP,YAAY,SAAS;AACjB,YAAI,KAAK,gBAAgB,QAAO;AAC5B,gBAAM,IAAI,MAAM,iEAAiE;AAAA,QACrF;AACA,YAAI,QAAQ,gBAAgB,SAAS;AACjC,eAAK,UAAU;AAAA,QACnB,WACS,OAAO,YAAY,UAAU;AAClC,eAAK,UAAU,QAAQ,YAAY,OAAO;AAAA,QAC9C,OACK;AACD,gBAAM,IAAI,UAAU,iBAAiB;AAAA,QACzC;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAO;AACH,eAAO;AAAA,UACH,QAAQ,KAAK;AAAA,UACb,WAAW,KAAK,QAAQ;AAAA,UACxB,YAAY,KAAK;AAAA,UACjB,kBAAkB,KAAK,eAAe;AAAA,UACtC,WAAW,KAAK,QAAQ,SAAS;AAAA,UACjC,QAAQ,KAAK;AAAA,UACb,aAAa,KAAK,aAAa;AAAA,UAC/B,QAAQ,KAAK,QAAQ;AAAA,QACzB;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAM,OAAO;AACT,cAAM,OAAO;AAAA,UACT;AAAA,UACA,KAAK,QAAQ;AAAA,UACb,KAAK;AAAA,UACL,KAAK,eAAe;AAAA,UACpB,IAAI,MAAM,KAAK,SAAS,EAAE;AAAA,UAC1B,KAAK;AAAA,QACT;AACA,cAAMC,QAAO,IAAI,QAAQ,EAAE;AAC3B,aAAK,QAAQ,SAAOA,MAAK,OAAO,IAAI,QAAQ,GAAG,CAAC,CAAC;AACjD,eAAOA,MAAK,OAAO,KAAK,EAAE,YAAY;AAAA,MAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAM,MAAM;AACR,cAAM,OAAO;AAAA,UACT,QAAQ,KAAK;AAAA,UACb,aAAc,gBAAgB,aAAa,gBAAgB,cACrD,iBACA;AAAA,QACV;AACA,cAAM,CAAC,EAAE,KAAK,CAAC,IAAI,MAAM,OAAM,MAAM,OAAO,CAAC,IAAI,CAAC;AAClD,aAAK,OAAO;AAAA,MAChB;AAAA,MACA,MAAM,KAAK,OAAO,OAAO;AACrB,YAAI,OAAO,UAAU,UAAU;AAC3B,gBAAM,QAAQ;AACd,gBAAM,EAAE,QAAAC,QAAO,IAAI,MAAM;AACzB,gBAAM,SAAS,MAAMA,QAAO,KAAK;AACjC,gBAAM,OAAO,KAAK;AAClB,cAAI,OAAO;AACP,gBAAI;AACA,oBAAM,OAAO,YAAY,OAAO,KAAK;AAAA,YACzC,SACO,KAAK;AACR,sBAAQ,KAAK,8EAA8E,GAAG;AAAA,YAClG;AAAA,UACJ;AACA,gBAAM,SAAS,MAAM,OAAO,KAAK,OAAO,IAAI;AAC5C,cAAI,OAAO,WAAW,MAAM;AACxB,kBAAM,IAAI,MAAM,OAAO,MAAM;AAAA,UACjC;AACA,eAAK,YAAY,OAAO;AAAA,QAC5B,OACK;AACD,gBAAM,MAAM,SAAS,KAAK,QAAQ;AAClC,cAAI,OAAO,MAAM;AACb,kBAAM,IAAI,MAAM,kCAAkC;AAAA,UACtD;AACA,gBAAM,UAAU,MAAM,QAAQ,eAAe,GAAG;AAChD,cAAI;AACA,kBAAM,YAAY,SAAS,SAAS,IAAI,QAAQ,MAAM,KAAK,KAAK,CAAC,GAAG,IAAI,QAAQ,GAAG,QAAQ,UAAU,EAAE,CAAC;AACxG,iBAAK,YAAY;AAAA,UACrB,SACO,KAAK;AACR,kBAAM,IAAI,MAAM,iCAAiC,GAAG,KAAK,GAAG,EAAE;AAAA,UAClE;AAAA,QACJ;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,MAAM,QAAQ,KAAK;AACf,YAAI,CAAC,KAAK,WAAW;AACjB,gBAAM,IAAI,MAAM,uDAAuD;AAAA,QAC3E;AACA,YAAI,CAAC,KAAK,QAAQ,MAAM;AACpB,gBAAM,IAAI,MAAM,6DAA6D;AAAA,QACjF;AACA,cAAM,OAAO;AAAA,UACT,WAAW,KAAK;AAAA,UAChB,cAAc;AAAA,UACd,SAAS,KAAK,KAAK;AAAA,QACvB;AACA,cAAM,MAAM,MAAM,IAAI,KAAK,WAAW,IAAI;AAC1C,YAAI,IAAI,QAAQ,MAAM;AAClB,gBAAM,IAAI,MAAM,gCAAgC,GAAG;AAAA,QACvD;AACA,eAAO,IAAI;AAAA,MACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,OAAO,KAAK;AACd,gBAAQ,KAAK,QAAQ;AACrB,YAAI,CAAC,KAAK;AACN,gBAAM,IAAI,MAAM,iDAAiD;AAAA,QACrE;AACA,cAAM,OAAO;AAAA,UACT;AAAA,UACA,KAAK,QAAQ;AAAA,UACb,KAAK;AAAA,UACL,KAAK,eAAe;AAAA,UACpB,IAAI,MAAM,KAAK,SAAS,EAAE;AAAA,UAC1B,KAAK;AAAA,QACT;AACA,cAAMD,QAAO,IAAI,QAAQ,EAAE;AAC3B,aAAK,QAAQ,SAAOA,MAAK,OAAO,IAAI,QAAQ,GAAG,CAAC,CAAC;AACjD,cAAM,YAAYA,MAAK,OAAO,KAAK,EAAE,YAAY;AACjD,eAAO,SAAS,OAAO,IAAI,QAAQ,SAAS,GAAG,IAAI,QAAQ,KAAK,aAAa,EAAE,GAAG,IAAI,QAAQ,GAAG,CAAC;AAAA,MACtG;AAAA,IACJ;AAKO,IAAM,YAAN,cAAwB,MAAM;AAAA,MACjC,OAAO;AAAA,MACP,UAAU;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY,QAAQ,SAAS,WAAW,QAAQ,gBAAgB,UAAU,MAAM;AAC5E,cAAM,MAAM;AACZ,aAAK,WAAW;AAChB,aAAK,iBAAiB,QAAQ,YAAY,cAAc;AACxD,aAAK,OAAO,QAAQ,YAAY,SAAS,EAAE;AAC3C,aAAK,OAAO,QAAQ;AACpB,cAAM,aAAa,OAAO,OAAO;AACjC,cAAM,YAAY,OAAO,MAAM;AAC/B,aAAK,UAAU,aAAa;AAC5B,iBAAS,IAAI;AAAA,MACjB;AAAA,IACJ;AAKO,IAAM,eAAN,cAA2B,MAAM;AAAA,MACpC,OAAO;AAAA,MACP,UAAU;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY,WAAW,SAAS,QAAQ,QAAQ,gBAAgB,UAAU,MAAM;AAC5E,cAAM,SAAS;AACf,aAAK,WAAW,YAAY,QAAQ,YAAY,SAAS,EAAE;AAC3D,aAAK,iBAAiB,QAAQ,YAAY,cAAc;AACxD,aAAK,OAAO;AACZ,aAAK,OAAO,QAAQ;AACpB,cAAM,aAAa,OAAO,OAAO;AACjC,cAAM,YAAY,OAAO,MAAM;AAC/B,aAAK,UAAU,aAAa;AAC5B,iBAAS,IAAI;AAAA,MACjB;AAAA,IACJ;AAMO,IAAM,cAAN,cAA0B,MAAM;AAAA,MACnC,OAAO;AAAA,MACP,UAAU;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,QAAQ,YAAY,YAAY,EAAE;AAAA,MACzC;AAAA,MACA;AAAA,MACA,YAAY,SAAS,SAAS,gBAAgB,UAAU,MAAM;AAC1D,cAAM,OAAO;AACb,aAAK,WAAW;AAChB,aAAK,iBAAiB,QAAQ,YAAY,cAAc;AACxD,aAAK,UAAU,OAAO,OAAO;AAC7B,aAAK,OAAO,QAAQ;AACpB,iBAAS,IAAI;AAAA,MACjB;AAAA,IACJ;AAAA;AAAA;;;AClPA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASA,SAAS,KAAK,MAAM,UAAU;AAC1B,MAAI,CAAC,MAAM,QAAQ,IAAI;AACnB,WAAO,CAAC,IAAI;AAChB,QAAME,QAAO,IAAI,QAAQ,EAAE;AAC3B,MAAI,aAAa,OAAO;AACpB,SAAK,QAAQ,SAAOA,MAAK,OAAO,IAAI,QAAQ,GAAG,CAAC,CAAC;AAAA,EACrD,OACK;AACD,UAAM,MAAM,IAAI,YAAY;AAC5B,SAAK,QAAQ,SAAOA,MAAK,OAAO,IAAI,OAAO,GAAG,CAAC,CAAC;AAAA,EACpD;AACA,SAAOA,MAAK,OAAO,KAAK,EAAE,YAAY;AAC1C;AAQA,eAAsB,QAAQ,QAAQ,WAAW,YAAY;AACzD,MAAI,OAAO,WAAW,UAAU;AAC5B,aAAS,OAAO,SAAS;AAAA,EAC7B;AACA,MAAI,OAAO,WAAW,YAAY,WAAW,MAAM,CAAC,oBAAoB,KAAK,MAAM,GAAG;AAClF,UAAM,IAAI,MAAM,gBAAgB;AAAA,EACpC;AACA,MAAI,CAAC,IAAI,IAAI,IAAI,EAAE,IAAI,OAAO,SAAS,EAAE,MAAM,GAAG;AAClD,MAAI,EAAE,QAAQ,QAAQ,EAAE;AACxB,MAAI,EAAE,QAAQ,QAAQ,EAAE;AACxB,cAAY,UAAU,YAAY;AAClC,eAAa,WAAW,YAAY;AACpC,MAAI,EAAE,aAAa,QAAQ;AACvB,UAAM,IAAI,MAAM,wBAAwB,SAAS,oCAAoC,OAAO,KAAK,KAAK,CAAC,EAAE;AAAA,EAC7G;AACA,MAAI,EAAE,cAAc,QAAQ;AACxB,UAAM,IAAI,MAAM,wBAAwB,UAAU,oCAAoC,OAAO,KAAK,KAAK,CAAC,EAAE;AAAA,EAC9G;AAEA,MAAI,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,SAAS,CAAC,CAAC,GAAG,OAAO,EAAE,SAAS,MAAM,SAAS,GAAG,GAAG;AACjF,MAAI,EAAE,MAAM,MAAM,SAAS,CAAC;AAC5B,MAAI,EAAE,SAAS,IAAI;AACf,UAAM,IAAI,MAAM,4BAA4B;AAAA,EAChD;AACA,MAAI,EAAE,SAAS,GAAG;AACd,UAAM,IAAI,MAAM,+BAA+B;AAAA,EACnD;AACA,MAAI,EAAE,SAAS,GAAG;AACd,UAAM,IAAI,MAAM,gCAAgC;AAAA,EACpD;AAEA,MAAI,MAAM,UAAU,MAAM,GAAG;AACzB,QAAI,EAAE,SAAS,IAAI,GAAG,EAAE,MAAM,CAAC,MAAM,UAAU,CAAC,IAAI;AACpD,QAAI,EAAE,MAAM,GAAG,CAAC,MAAM,UAAU,CAAC;AAAA,EACrC;AACA,MAAI,EAAE,QAAQ,QAAQ,EAAE,KAAK;AAC7B,MAAI,EAAE,QAAQ,QAAQ,EAAE;AACxB,SAAO,GAAG,CAAC,GAAG,IAAI,MAAM,EAAE,GAAG,CAAC;AAClC;AAQA,eAAsB,KAAK,QAAQ,OAAO;AACtC,QAAM,UAAU,MAAM,QAAQ,eAAe,GAAG;AAChD,QAAM,OAAO,KAAK,KAAK;AACvB,QAAM,YAAY,SAAS,SAAS,IAAI,QAAQ,IAAI,GAAG,IAAI,QAAQ,GAAG,QAAQ,UAAU,EAAE,CAAC;AAC3F,SAAO;AACX;AAYA,eAAsB,MAAM,KAAK,QAAQ,WAAWC,QAAO,GAAG,KAAKA,OAAM;AACrE,MAAI,OAAO,QAAQ,UAAU,QAAQ,aAAa,MAAM;AACpD,UAAM,IAAI,eAAe,kCAAkC;AAAA,EAC/D;AACA,MAAI,OAAO,QAAQ,YAAY,IAAI,gBAAgB,KAAK;AACpD,UAAM,IAAI,IAAI,GAAG;AAAA,EACrB;AACA,MAAI,IAAI,gBAAgB,KAAK;AACzB,UAAM,IAAI,UAAU,0BAA0B;AAAA,EAClD;AACA,QAAM,aAAa,CAAC;AACpB,QAAM,UAAU,CAAC;AACjB,QAAM,mBAAmB,QAAQ,YAAY,SAAS;AACtD,QAAM,WAAW,MAAM,OAAO,QAAQ,KAAKA,OAAM,EAAE;AACnD,aAAW,WAAW,UAAU;AAC5B,QAAI,QAAQ,gBAAgB,WAAW,QAAQ,UAAU;AACrD,YAAM,QAAQ,IAAI,UAAU,SAAS,QAAQ,SAAS,SAAS,KAAK,KAAK,iBAAiB,SAAS,QAAQ,SAAS,SAAS,KAAK,KAAK,QAAQ,eAAe,SAAS,QAAQ,QAAQ;AACvL,YAAM,eAAe,IAAI,QAAQ,OAAO,YAAY;AAChD,YAAI;AACA,gBAAM,MAAM,IAAI;AAChB,gBAAM,MAAM,KAAK;AACjB,gBAAMD,QAAO,MAAM,MAAM,QAAQ,GAAG;AACpC,kBAAQ,KAAK,EAAE,QAAQ,WAAW,SAAS,MAAM,QAAQ,SAAS,SAASA,MAAK,CAAC;AAAA,QACrF,SACO,KAAK;AACR,kBAAQ,KAAK,EAAE,QAAQ,SAAS,SAAS,MAAM,QAAQ,SAAS,SAAS,IAAI,QAAQ,CAAC;AAAA,QAC1F,UACA;AACI,kBAAQ;AAAA,QACZ;AAAA,MACJ,CAAC;AACD,iBAAW,KAAK,YAAY;AAAA,IAChC;AAAA,EACJ;AACA,QAAM,QAAQ,WAAW,UAAU;AACnC,SAAO;AACX;AASA,eAAsB,OAAO,KAAK,cAAc,OAAO;AACnD,QAAM,OAAO,KAAK,KAAK;AACvB,MAAI;AACA,WAAO,MAAM,SAAS,OAAO,IAAI,QAAQ,IAAI,GAAG,IAAI,QAAQ,SAAS,GAAG,IAAI,QAAQ,GAAG,CAAC;AAAA,EAC5F,SACO,KAAK;AACR,YAAQ,MAAM,GAAG;AACjB,WAAO;AAAA,EACX;AACJ;AAlJA,IAmJa;AAnJb;AAAA;AAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AA2IO,IAAM,QAAQ,EAAE,SAAS,MAAM,OAAO,OAAO;AAAA;AAAA;;;ACnJpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAEA;AACA;AACA;AACA;AACA;;;ACJA;AAKO,IAAM,UAAN,MAAc;AAAA,EACjB,WAAW,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWZ,MAAM,IAAI,MAAM,SAAS;AACrB,QAAI,QAAQ,QAAQ,SAAS,IAAI;AAC7B,YAAM,IAAI,MAAM,sCAAsC;AAAA,IAC1D;AACA,QAAI,OAAO,SAAS,UAAU;AAC1B,YAAM,IAAI,MAAM,2CAA2C;AAAA,IAC/D;AACA,QAAI,WAAW,QAAQ,YAAY,IAAI;AACnC,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC7D;AACA,QAAI,OAAO,YAAY,UAAU;AAC7B,YAAM,IAAI,MAAM,8CAA8C;AAAA,IAClE;AACA,WAAO,KACF,WAAW,KAAK,SAAS,EACzB,WAAW,KAAK,SAAS,EACzB,WAAW,KAAK,SAAS,EACzB,WAAW,MAAM,SAAS;AAC/B,UAAM,UAAU,QAAQ,YAAY,OAAO;AAC3C,UAAM,aAAa,KAAK,SAAS,KAAK,OAAK,EAAE,SAAS,IAAI;AAC1D,UAAM,gBAAgB,KAAK,SAAS,KAAK,OAAK,EAAE,QAAQ,YAAY,OAAO;AAC3E,QAAI,CAAC,eAAe;AAChB,WAAK,SAAS,KAAK,EAAE,MAAM,QAAQ,CAAC;AAAA,IACxC,WACS,CAAC,YAAY;AAClB,oBAAc,OAAO;AAAA,IACzB;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,SAAS;AACb,UAAM,SAAS,KAAK,SAAS,KAAK,OAAK,EAAE,QAAQ,YAAY,OAAO;AACpE,WAAO,QAAQ,QAAQ;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,MAAM;AACf,UAAM,UAAU,KAAK,SAAS,OAAO,OAAK,EAAE,SAAS,IAAI;AACzD,WAAO,QAAQ,IAAI,OAAK,EAAE,QAAQ,OAAO;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc;AACV,WAAO,KAAK,SAAS,IAAI,OAAK,EAAE,IAAI;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,OAAO,MAAM,cAAc,MAAM;AACnC,UAAM,EAAE,OAAAE,OAAM,IAAI,MAAM;AACxB,UAAM,UAAU,KAAK,SAAS,OAAO,OAAK,EAAE,SAAS,IAAI;AACzD,eAAW,SAAS,SAAS;AACzB,YAAM,MAAM,MAAM,QAAQ;AAC1B,YAAM,WAAW,MAAMA,OAAM,OAAO,KAAK,WAAW,GAAG,IAAI;AAC3D,UAAI,UAAU;AACV,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;;;ADxFA;AACA;;;AEPA;AACA;;;ACEO,IAAM,aAAa,OAAO,OAAO;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC;;;ACngED;AACA;AACA;AACA,IAAM,EAAE,QAAAC,QAAO,IAAI,WAAW;AAIvB,IAAM,gBAAN,MAAM,eAAc;AAAA,EACvB,OAAO,cAAc;AAAA,EACrB,aAAa;AAAA,EACb,eAAe;AAAA,EACf,UAAU;AAAA,EACV,IAAI,SAAS;AAAE,WAAO,KAAK,QAAQ,UAAU,MAAM;AAAA,EAAG;AAAA,EACtD,cAAc;AACV,QAAI,CAAC,eAAc,aAAa;AAC5B,YAAM,IAAI,MAAM,sIAAsI;AAAA,IAC1J;AACA,mBAAc,cAAc;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,aAAa,WAAW,QAAQ;AAC5B,mBAAc,cAAc;AAC5B,UAAM,OAAO,IAAI,KAAK;AACtB,UAAM,UAAU,MAAM,eAAc,SAAS,MAAM;AACnD,QAAI,SAAS;AACT,WAAK,UAAU,OAAO,UAAU,MAAM;AACtC,aAAO;AAAA,IACX,OACK;AACD,YAAM,IAAI,MAAM,0BAA0B;AAAA,IAC9C;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,aAAa,YAAY,SAAS;AAC9B,UAAM,IAAI,MAAM,QAAQ,OAAO,OAAO;AACtC,UAAM,WAAW,MAAM,KAAK,SAAS,CAAC;AACtC,QAAI,gBAAgB,GAAG,EAAE,IAAI,GAAG,QAAQ;AACxC,UAAM,QAAQ,CAAC;AACf,WAAO,cAAc,SAAS,GAAG;AAC7B,YAAM,WAAW,cAAc,UAAU,GAAG,EAAE;AAC9C,YAAM,YAAY,SAAS,UAAU,CAAC;AACtC,YAAM,KAAK,WAAW,SAAS,CAAC;AAChC,sBAAgB,cAAc,UAAU,EAAE;AAAA,IAC9C;AACA,UAAM,WAAW,MAAM,KAAK,GAAG;AAC/B,WAAO,eAAc,WAAW,QAAQ;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aAAa,SAAS,SAAS;AAC3B,UAAM,aAAa,MAAMA,QAAO,OAAO,WAAW,QAAQ,KAAK;AAC/D,UAAM,YAAY,IAAI,WAAW,UAAU;AAC3C,UAAM,WAAW,MAAM,MAAM,SAAS;AACtC,UAAM,iBAAiB,QAAQ,KAAK,SAAS;AAC7C,UAAM,WAAW,SAAS,UAAU,GAAG,cAAc;AACrD,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,SAAS,UAAU;AAC5B,UAAM,QAAQ,SAAS,UAAU,MAAM,EAAE,MAAM,GAAG;AAClD,QAAI,MAAM,SAAS,MAAM,GAAG;AACxB,aAAO;AAAA,IACX;AACA,UAAM,WAAW,MAAM,IAAI,UAAQ;AAC/B,YAAM,YAAY,WAAW,QAAQ,IAAI;AACzC,UAAI,cAAc,IAAI;AAClB,eAAO;AAAA,MACX;AACA,aAAO,IAAI,MAAM,WAAW,EAAE;AAAA,IAClC,CAAC,EAAE,KAAK,EAAE;AACV,UAAM,iBAAiB,SAAS,SAAS;AACzC,UAAM,gBAAgB,SAAS,SAAS;AACxC,UAAM,cAAc,SAAS,UAAU,GAAG,aAAa;AACvD,UAAM,eAAe,SAAS,UAAU,aAAa;AACrD,QAAI,eAAe,QACZ,YAAY,SAAS,OACrB,YAAY,SAAS,OACrB,YAAY,SAAS,OAAO,GAAG;AAClC,aAAO;AAAA,IACX;AACA,UAAM,UAAU,MAAM,QAAQ,OAAO,IAAI,QAAQ,WAAW,CAAC;AAC7D,UAAM,mBAAmB,MAAM,KAAK,SAAS,OAAO;AACpD,QAAI,qBAAqB,cAAc;AACnC,aAAO;AAAA,IACX;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,YAAY,YAAY;AAC1B,QAAI,KAAK,iBAAiB,IAAI;AAC1B,UAAI,cAAc,QAAQ,OAAO,eAAe,UAAU;AACtD,qBAAa;AAAA,MACjB;AACA,mBAAa,WAAW,WAAW,UAAU,MAAM,CAAC;AACpD,YAAM,sBAAsB;AAAA,QACxB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM,KAAK,QAAQ,UAAU;AAAA,QAC7B,YAAY;AAAA,MAChB;AACA,YAAM,YAAY,MAAMA,QAAO,UAAU,OAAO,KAAK,QAAQ,KAAK,MAAM,GAAG,UAAU,OAAO,CAAC,cAAc,WAAW,CAAC;AACvH,YAAM,iBAAiB;AAAA,QACnB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ;AAAA,MACZ;AACA,YAAM,uBAAuB;AAC7B,YAAM,gBAAgB,CAAC,MAAM;AAC7B,YAAM,UAAU,MAAMA,QAAO,UAAU,qBAAqB,WAAW,gBAAgB,sBAAsB,aAAa;AAC1H,YAAM,aAAa,MAAMA,QAAO,UAAU,OAAO,OAAO;AACxD,YAAM,YAAY,IAAI,WAAW,UAAU;AAC3C,YAAM,OAAO,MAAM,MAAM,SAAS;AAClC,WAAK,aAAa;AAAA,IACtB;AACA,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,gBAAgB;AAClB,QAAI,KAAK,iBAAiB,IAAI;AAC1B,YAAM,YAAY,KAAK,OAAO,MAAM,GAAG;AACvC,YAAM,OAAO,UAAU,IAAI,CAAC,MAAM;AAC9B,cAAM,YAAY,WAAW,QAAQ,CAAC;AACtC,YAAI,cAAc,IAAI;AAClB,iBAAO;AAAA,QACX;AACA,eAAO,IAAI,MAAM,WAAW,EAAE;AAAA,MAClC,CAAC,EAAE,KAAK,EAAE;AACV,YAAM,eAAe,KAAK,MAAM,KAAK,SAAS,EAAE,IAAI;AACpD,YAAM,cAAc,KAAK,MAAM,GAAG,YAAY;AAC9C,YAAM,eAAe,YAAY,MAAM,WAAW,GAAG,IAAI,CAACC,SAAQ,SAASA,MAAK,CAAC,CAAC;AAClF,UAAI,gBAAgB,MAAM;AACtB,cAAM,IAAI,MAAM,yBAAyB;AAAA,MAC7C;AACA,WAAK,eAAe,MAAM,MAAM,WAAW,KAAK,YAAY,CAAC;AAAA,IACjE;AACA,WAAO,KAAK;AAAA,EAChB;AACJ;;;AF7KA;AACA;AACA;AACA;AACA;AACA;AAQA,IAAM,SAAN,MAAM,QAAO;AAAA,EACT;AAAA,EACA;AAAA,EACA,UAAU;AAAA,EACV;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,IAAI,KAAK;AAAE,WAAO,KAAK,IAAI;AAAA,EAAK;AAAA,EAChC,IAAI,WAAW;AAAE,WAAO,KAAK;AAAA,EAAS;AAAA,EACtC,IAAI,aAAa;AAAE,WAAO,CAAC,KAAK;AAAA,EAAS;AAAA,EACzC,IAAI,WAAW;AACX,QAAI,KAAK,qBAAqB,eAAe;AACzC,aAAO,KAAK,UAAU;AAAA,IAC1B;AACA,WAAO;AAAA,EACX;AAAA,EACA,IAAI,OAAO;AACP,QAAI,OAAO,KAAK,UAAU,UAAU;AAChC,aAAO,KAAK;AAAA,IAChB;AACA,WAAO;AAAA,EACX;AAAA,EACA,YAAYC,KAAI,MAAM,UAAU;AAC5B,QAAI,KAAK,gBAAgB,SAAQ;AAC7B,YAAM,IAAI,MAAM,kEAAkE;AAAA,IACtF;AACA,SAAK,YAAY,CAAC;AAClB,SAAK,MAAMA;AACX,SAAK,YAAY,YAAY;AAC7B,SAAK,gBAAgB,IAAI,KAAK,iBAAQ;AACtC,SAAK,QAAQ,IAAI,KAAK;AACtB,SAAK,QAAQ,QAAQ;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,MAAM,SAASC,QAAO,GAAG,KAAKA,OAAM;AAChC,QAAIA,QAAO,IAAI;AACX,YAAM,OAAOA;AACb,MAAAA,QAAO;AACP,WAAK;AAAA,IACT;AACA,UAAM,UAAU,CAAC;AACjB,aAAS,IAAIA,OAAM,KAAK,IAAI,KAAK;AAC7B,UAAI,KAAK,UAAU,CAAC,KAAK,MAAM;AAC3B,gBAAQ,KAAK,CAAC;AAAA,MAClB;AAAA,IACJ;AACA,QAAI,QAAQ,SAAS,GAAG;AACpB,UAAI,UAAU,MAAM,KAAK,IAAI,OAAO;AACpC,YAAM,OAAO,CAAC;AACd,cAAQ,QAAQ,OAAK,KAAK,KAAK,EAAE,YAAY,EAAE,YAAY,OAAO,EAAE,MAAM,CAAC,CAAC;AAC5E,YAAM,WAAW,MAAM,KAAK,cAAc,OAAO,IAAI;AACrD,iBAAW,WAAW,UAAU;AAC5B,YAAI,QAAQ,cAAc;AACtB,gBAAM,IAAI,WAAW,6BAA6B;AACtD,YAAI,QAAQ,aAAa;AACrB,gBAAM,IAAI,WAAW,4BAA4B;AACrD,YAAI,QAAQ,SAAS;AACjB,gBAAM,IAAI,WAAW,wCAAwC;AACjE,cAAM,EAAE,YAAY,WAAW,MAAM,IAAI;AACzC,aAAK,UAAU,QAAQ,KAAK,IAAI,QAAQ,YAAY,YAAY,WAAW,KAAK;AAAA,MACpF;AAAA,IACJ;AACA,WAAO,KAAK,UAAU,MAAMA,OAAM,KAAK,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,kBAAkB,KAAK,YAAY,aAAaA,QAAO,GAAG;AAC5D,QAAI,CAAC,OAAO,cAAc,SAAS,KAAK,YAAY,GAAG;AACnD,YAAM,IAAI,WAAW,sBAAsB,SAAS,EAAE;AAAA,IAC1D;AACA,UAAM,WAAW,MAAM,KAAK,SAASA,OAAMA,QAAO,YAAY,CAAC;AAC/D,UAAM,YAAY,SAAS,IAAI,CAAC,EAAE,QAAQ,MAAM,OAAO;AACvD,UAAM,OAAO;AAAA,MACT,YAAY;AAAA,IAChB;AACA,UAAM,EAAE,OAAO,IAAI,MAAM,IAAI,KAAK,sBAAsB,IAAI;AAC5D,eAAW,OAAO,OAAO,KAAK,UAAU,CAAC,CAAC,GAAG;AACzC,YAAM,QAAQ,OAAO,GAAG;AACxB,UAAI,UAAU,qBAAqB;AAC/B,eAAO,QAAQ,YAAY,GAAG;AAAA,MAClC;AAAA,IACJ;AACA,WAAO,MAAM,KAAK,kBAAkB,KAAK,WAAWA,QAAO,SAAS;AAAA,EACxE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,QAAQ,KAAKA,QAAO,GAAG,KAAKA,OAAM;AACpC,QAAI,OAAO,QAAQ,YAAY,IAAI,gBAAgB,KAAK;AACpD,YAAM,IAAI,IAAI,GAAG;AAAA,IACrB;AACA,QAAI,IAAI,gBAAgB,KAAK;AACzB,YAAM,IAAI,UAAU,0BAA0B;AAAA,IAClD;AACA,UAAM,WAAW,MAAM,KAAK,SAASA,OAAM,EAAE;AAC7C,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACtC,UAAI;AACA,cAAM,SAAS,CAAC,EAAE,QAAQ,GAAG;AAAA,MACjC,SACO,KAAK;AACR,iBAAS,OAAO,KAAK,CAAC;AAAA,MAC1B;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,MAAM,KAAK,SAAS;AAChB,QAAI,UAAU;AACd,QAAI;AACA,YAAM,OAAO;AAAA,QACT,IAAI,KAAK;AAAA,QACT,UAAU;AAAA,QACV,MAAM;AAAA,MACV;AACA,UAAI,KAAK,qBAAqB,eAAe;AACzC,aAAK,WAAW,KAAK,UAAU;AAAA,MACnC;AACA,UAAI,OAAO,KAAK,UAAU,UAAU;AAChC,aAAK,OAAO,KAAK;AAAA,MACrB;AACA,kBAAY,MAAM,KAAK,MAAM,IAAI,KAAK,IAAI,SAAS,IAAI;AACvD,YAAM,QAAQ,IAAI,KAAK,UAAU,IAAI,CAAC,MAAM,EAAE,KAAK,OAAO,CAAC,CAAC;AAC5D,UAAI,CAAC,SAAS;AACV,cAAM;AAAA,MACV;AAAA,IACJ,SACO,KAAK;AACR,YAAM,IAAI,MAAM,uBAAuB;AAAA,IAC3C;AACA,SAAK,UAAU;AACf,SAAK,YAAY;AACjB,SAAK,QAAQ;AACb,WAAO;AAAA,EACX;AAAA,EACA,MAAM,OAAO,SAAS;AAClB,QAAI;AACA,YAAM,EAAE,IAAAD,KAAI,UAAU,KAAK,IAAI,MAAM,KAAK,MAAM,IAAI,KAAK,IAAI,OAAO;AACpE,UAAIA,QAAO,KAAK,IAAI;AAChB,cAAM;AAAA,MACV;AACA,YAAM,QAAQ,IAAI,KAAK,UAAU,IAAI,CAAC,MAAM,EAAE,OAAO,OAAO,CAAC,CAAC;AAC9D,UAAI,YAAY,MAAM;AAClB,aAAK,YAAY,MAAM,cAAc,WAAW,QAAQ;AAAA,MAC5D;AACA,UAAI,QAAQ,MAAM;AACd,aAAK,QAAQ;AAAA,MACjB;AACA,WAAK,UAAU;AAAA,IACnB,SACO,KAAK;AACR,YAAM,IAAI,MAAM,yBAAyB;AAAA,IAC7C;AACA,WAAO;AAAA,EACX;AACJ;AAuBO,IAAM,cAAN,MAAM,qBAAoB,OAAO;AAAA,EACpC,OAAO,cAAc;AAAA,EACrB,OAAO,gBAAgB,IAAI,KAAK,iBAAQ;AAAA,EACxC,YAAYA,KAAI,MAAM,UAAU;AAC5B,QAAI,CAAC,aAAY,aAAa;AAC1B,YAAM,IAAI,MAAM,wFAAwF;AAAA,IAC5G;AACA,iBAAY,cAAc;AAC1B,UAAMA,KAAI,MAAM,QAAQ;AAAA,EAC5B;AAAA,EACA,aAAa,OAAO,SAAS,OAAO,IAAI;AACpC,QAAI;AACA,YAAM,IAAI,MAAM,QAAQ,OAAO;AAC/B,aAAO,MAAM,aAAY,YAAY,SAAS,EAAE,KAAK,IAAI;AAAA,IAC7D,SACO,KAAK;AACR,YAAM,IAAI,MAAM,mCAAmC,GAAG,EAAE;AAAA,IAC5D;AAAA,EACJ;AAAA,EACA,aAAa,YAAY,SAAS,SAAS,OAAO,IAAI;AAClD,QAAI;AACA,YAAMA,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,YAAM,IAAI,MAAM,QAAQ,OAAO,OAAO;AACtC,YAAM,IAAI,MAAM,cAAc,YAAY,EAAE,GAAG;AAC/C,YAAM,IAAI,MAAM,EAAE,YAAY,IAAI;AAClC,mBAAY,cAAc;AAC1B,YAAM,SAAS,IAAI,KAAKA,KAAI,GAAG,CAAC;AAChC,YAAM,OAAO,KAAK,OAAO;AACzB,aAAO;AAAA,IACX,SACO,KAAK;AACR,YAAM,IAAI,MAAM,6CAA6C,GAAG,EAAE;AAAA,IACtE;AAAA,EACJ;AAAA,EACA,aAAa,aAAa,SAAS,UAAU,OAAO,IAAI;AACpD,QAAI;AACA,YAAMA,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,YAAM,IAAI,MAAM,cAAc,WAAW,QAAQ;AACjD,YAAM,IAAI,MAAM,EAAE,YAAY,IAAI;AAClC,mBAAY,cAAc;AAC1B,YAAM,SAAS,IAAI,KAAKA,KAAI,GAAG,CAAC;AAChC,YAAM,OAAO,KAAK,OAAO;AACzB,aAAO;AAAA,IACX,SACO,KAAK;AACR,YAAM,IAAI,MAAM,8CAA8C,GAAG,EAAE;AAAA,IACvE;AAAA,EACJ;AAAA,EACA,aAAa,SAAS,SAAS,MAAM;AACjC,QAAI,KAAK,WAAW,mBAAmB;AACnC,YAAM,IAAI,MAAM,cAAc,iBAAiB,iCAAiC,KAAK,MAAM,oBAAoB;AAAA,IACnH;AACA,QAAI,CAAC,kBAAkB,KAAK,IAAI,GAAG;AAC/B,YAAM,IAAI,MAAM,+CAA+C;AAAA,IACnE;AACA,UAAMA,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,iBAAY,cAAc;AAC1B,UAAM,SAAS,IAAI,KAAKA,KAAI,IAAI;AAChC,UAAM,OAAO,KAAK,OAAO;AACzB,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,QAAQA,KAAI;AACrB,QAAI,OAAOA,QAAO,YAAYA,QAAO,IAAI;AACrC,YAAM,IAAI,UAAU,kCAAkC;AAAA,IAC1D;AACA,iBAAY,cAAc;AAC1B,WAAO,IAAI,KAAK,MAAM,QAAQ,OAAOA,GAAE,GAAG,EAAE;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAI,SAAS;AACf,UAAM,OAAO,CAAC;AACd,YAAQ,QAAQ,OAAK,KAAK,KAAK,EAAE,MAAM,KAAK,MAAM,OAAO,EAAE,CAAC,CAAC;AAC7D,UAAM,cAAc,MAAM,aAAY,cAAc,OAAO,IAAI;AAC/D,WAAO;AAAA,EACX;AACJ;AAiBO,IAAM,gBAAN,MAAM,uBAAsB,OAAO;AAAA,EACtC,OAAO,cAAc;AAAA,EACrB,YAAYA,KAAI,MAAM,UAAU;AAC5B,QAAI,CAAC,eAAc,aAAa;AAC5B,YAAM,IAAI,MAAM,4FAA4F;AAAA,IAChH;AACA,mBAAc,cAAc;AAC5B,UAAMA,KAAI,MAAM,QAAQ;AAAA,EAC5B;AAAA,EACA,aAAa,OAAO,SAAS;AACzB,QAAI;AACA,YAAM,OAAO,MAAM,QAAQ,OAAO;AAClC,aAAO,MAAM,eAAc,SAAS,SAAS,KAAK,GAAG;AAAA,IACzD,SACO,KAAK;AACR,YAAM,IAAI,MAAM,qCAAqC,GAAG,EAAE;AAAA,IAC9D;AAAA,EACJ;AAAA,EACA,aAAa,SAAS,SAAS,MAAM;AACjC,QAAI,KAAK,WAAW,qBAAqB;AACrC,YAAM,IAAI,MAAM,cAAc,mBAAmB,iCAAiC,KAAK,MAAM,oBAAoB;AAAA,IACrH;AACA,QAAI,CAAC,kBAAkB,KAAK,IAAI,GAAG;AAC/B,YAAM,IAAI,MAAM,+CAA+C;AAAA,IACnE;AACA,UAAMA,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,UAAM,IAAI;AACV,UAAM,IAAI,MAAM,cAAc,YAAY,IAAI;AAC9C,mBAAc,cAAc;AAC5B,UAAM,SAAS,IAAI,KAAKA,KAAI,GAAG,CAAC;AAChC,UAAM,OAAO,KAAK,OAAO;AACzB,WAAO;AAAA,EACX;AAAA,EACA,aAAa,aAAa,SAAS,UAAU;AACzC,QAAI;AACA,YAAMA,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,YAAM,IAAI,MAAM,cAAc,WAAW,QAAQ;AACjD,YAAM,IAAI,MAAM,EAAE,cAAc;AAChC,qBAAc,cAAc;AAC5B,YAAM,SAAS,IAAI,KAAKA,KAAI,GAAG,CAAC;AAChC,YAAM,OAAO,KAAK,OAAO;AACzB,aAAO;AAAA,IACX,SACO,KAAK;AACR,YAAM,IAAI,MAAM,gDAAgD,GAAG,EAAE;AAAA,IACzE;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,QAAQA,KAAI;AACrB,QAAI,OAAOA,QAAO,YAAYA,QAAO,IAAI;AACrC,YAAM,IAAI,UAAU,kCAAkC;AAAA,IAC1D;AACA,mBAAc,cAAc;AAC5B,WAAO,IAAI,KAAK,MAAM,QAAQ,OAAOA,GAAE,GAAG,EAAE;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAI,SAAS;AACf,UAAM,UAAU,QAAQ,IAAI,WAAS;AACjC,YAAM,WAAW,MAAM,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,EAAE,YAAY;AACjE,YAAM,WAAW,GAAG,KAAK,IAAI,GAAG,QAAQ,GAAG,SAAS,IAAI,GAAG;AAC3D,YAAM,cAAc,SAAS,MAAM,SAAS,KAAK,CAAC,GAAG,IAAI,OAAK,SAAS,GAAG,EAAE,CAAC;AAC7E,YAAM,aAAa,WAAW,KAAK,UAAU;AAC7C,YAAM,aAAa,IAAI,QAAQ,EAAE,EAAE,OAAO,UAAU,EAAE,OAAO,KAAK;AAClE,aAAO,EAAE,YAAY,MAAM;AAAA,IAC/B,CAAC;AACD,WAAO;AAAA,EACX;AACJ;AAYO,IAAM,eAAN,MAAM,sBAAqB,OAAO;AAAA,EACrC,OAAO,cAAc;AAAA,EACrB;AAAA,EACA,IAAI,SAAS;AAAE,WAAO,KAAK;AAAA,EAAS;AAAA,EACpC,YAAYA,KAAI,QAAQ;AACpB,QAAI,CAAC,cAAa,aAAa;AAC3B,YAAM,IAAI,MAAM,0FAA0F;AAAA,IAC9G;AACA,kBAAa,cAAc;AAC3B,UAAMA,GAAE;AACR,SAAK,UAAU;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,SAAS;AAClB,UAAM,EAAE,QAAAE,QAAO,IAAI,MAAM;AACzB,UAAM,IAAI,MAAMA,QAAO,KAAK;AAC5B,UAAMF,MAAK,MAAM,QAAQ,OAAO,EAAE;AAClC,kBAAa,cAAc;AAC3B,WAAO,IAAI,KAAKA,KAAI,CAAC;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,QAAQA,KAAI;AACrB,QAAI,OAAOA,QAAO,YAAYA,QAAO,IAAI;AACrC,YAAM,IAAI,UAAU,kCAAkC;AAAA,IAC1D;AACA,UAAM,EAAE,QAAAE,QAAO,IAAI,MAAM;AACzB,UAAM,IAAI,MAAMA,QAAO,KAAK;AAC5B,kBAAa,cAAc;AAC3B,WAAO,IAAI,KAAK,MAAM,QAAQ,OAAOF,GAAE,GAAG,CAAC;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAI,SAAS;AACf,UAAM,UAAU,CAAC;AACjB,eAAW,SAAS,SAAS;AACzB,YAAM,EAAE,QAAQ,UAAU,IAAI,MAAM,KAAK,OAAO,QAAQ,KAAK;AAC7D,UAAI,WAAW,QAAQ,aAAa,MAAM;AACtC,gBAAQ,KAAK,EAAE,WAAW,MAAM,CAAC;AAAA,MACrC,OACK;AACD,cAAM,IAAI,MAAM,iCAAiC,MAAM,EAAE;AAAA,MAC7D;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,OAAO;AACT,QAAI,KAAK,UAAU,MAAM;AACrB,aAAO;AAAA,IACX;AACA,UAAM,SAAS,MAAM,KAAK,OAAO,MAAM;AACvC,WAAO,WAAW;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,SAAS;AACX,QAAI,KAAK,UAAU,MAAM;AACrB,aAAO;AAAA,IACX;AACA,UAAM,SAAS,MAAM,KAAK,OAAO,QAAQ;AACzC,WAAO,WAAW;AAAA,EACtB;AACJ;;;AGtfA,WAAW,YAAY;",
+  "names": ["last", "base32", "bin", "bytes", "buffer", "hex", "utf8", "process", "crypto", "bytes", "buffer", "hash", "hex", "hex", "subtle", "hash", "hex", "hash", "hex", "ReflectApply", "ReflectOwnKeys", "NumberIsNaN", "EventEmitter", "once", "HwTransportErrorType", "id", "log", "init_lib_es", "context", "init_lib_es", "context", "EventEmitter", "id", "first", "id", "from", "require_valid", "first", "require_semver", "init_lib_es", "DeviceModelId", "_a", "semver", "id", "__awaiter", "from", "v", "d", "b", "Subscription", "_a", "_a", "Subscriber", "ConsumerObserver", "SafeSubscriber", "_a", "Observable", "observable", "OperatorSubscriber", "err", "_a", "Subject", "_a", "observable", "AnonymousSubject", "ReplaySubject", "_a", "last", "_a", "process", "iterator", "_a", "iterator", "config", "buffer", "_a", "_a", "buffer", "init_lib_es", "context", "TagId", "init_lib_es", "context", "init_lib_es", "characteristic", "init_lib_es", "__awaiter", "buffer", "id", "devices", "init_lib_es", "init_lib_es", "devices", "__awaiter", "buffer", "ledgerDevices", "getLedgerDevices", "devices", "getFirstLedgerDevice", "isSupported", "init_lib_es", "buffer", "__awaiter", "open", "statusCode", "status", "hash", "hash", "Ledger", "hash", "from", "Tools", "subtle", "bin", "id", "from", "Ledger"]
 }