@pixerate/editor 0.112.0 → 0.114.0

package/dist/chunk-6FCKOS2B.js

@@ -0,0 +1,534 @@
+// src/raster/zlib.ts
+var LENGTH_BASE = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258];
+var LENGTH_EXTRA = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0];
+var DIST_BASE = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577];
+var DIST_EXTRA = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13];
+var CL_ORDER = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+var ZlibError = class extends Error {
+  constructor(message) {
+    super(message);
+    this.name = "ZlibError";
+  }
+};
+function buildHuffman(lengths, n) {
+  const counts = new Uint16Array(16);
+  for (let i = 0; i < n; i++) counts[lengths[i]]++;
+  counts[0] = 0;
+  const offs = new Uint16Array(16);
+  for (let i = 1; i < 16; i++) offs[i] = offs[i - 1] + counts[i - 1];
+  const symbols = new Uint16Array(n);
+  for (let i = 0; i < n; i++) if (lengths[i]) symbols[offs[lengths[i]]++] = i;
+  return { counts, symbols };
+}
+var fixedLit = null;
+var fixedDist = null;
+function fixedTables() {
+  if (!fixedLit || !fixedDist) {
+    const l = new Uint8Array(288);
+    for (let i = 0; i < 144; i++) l[i] = 8;
+    for (let i = 144; i < 256; i++) l[i] = 9;
+    for (let i = 256; i < 280; i++) l[i] = 7;
+    for (let i = 280; i < 288; i++) l[i] = 8;
+    fixedLit = buildHuffman(l, 288);
+    const d = new Uint8Array(30).fill(5);
+    fixedDist = buildHuffman(d, 30);
+  }
+  return [fixedLit, fixedDist];
+}
+var BitReader = class {
+  constructor(data) {
+    this.data = data;
+  }
+  data;
+  pos = 0;
+  bit = 0;
+  bits = 0;
+  need(n) {
+    while (this.bits < n) {
+      if (this.pos >= this.data.length) throw new ZlibError("Unexpected end of compressed data");
+      this.bit |= this.data[this.pos++] << this.bits;
+      this.bits += 8;
+    }
+    const v = this.bit & (1 << n) - 1;
+    this.bit >>>= n;
+    this.bits -= n;
+    return v;
+  }
+  decode(h) {
+    let code = 0;
+    let first = 0;
+    let index = 0;
+    for (let len = 1; len < 16; len++) {
+      code |= this.need(1);
+      const count = h.counts[len];
+      if (code - count < first) return h.symbols[index + (code - first)];
+      index += count;
+      first += count;
+      first <<= 1;
+      code <<= 1;
+    }
+    throw new ZlibError("Invalid Huffman code");
+  }
+  align() {
+    this.bit = 0;
+    this.bits = 0;
+  }
+};
+var Output = class {
+  constructor(hint, max) {
+    this.max = max;
+    this.buf = new Uint8Array(Math.max(1024, Math.min(hint, max)));
+  }
+  max;
+  buf;
+  len = 0;
+  ensure(n) {
+    if (this.len + n > this.max) throw new ZlibError(`Decompressed data exceeds ${this.max} bytes`);
+    if (this.len + n <= this.buf.length) return;
+    let size = this.buf.length * 2;
+    while (size < this.len + n) size *= 2;
+    const next = new Uint8Array(Math.min(size, Math.max(this.max, this.len + n)));
+    next.set(this.buf.subarray(0, this.len));
+    this.buf = next;
+  }
+};
+function inflateRaw(data, options = {}) {
+  const max = options.maxOutput ?? 512 * 1024 * 1024;
+  const out = new Output(options.sizeHint ?? data.length * 4, max);
+  const br = new BitReader(data);
+  let final = 0;
+  while (!final) {
+    final = br.need(1);
+    const type = br.need(2);
+    if (type === 0) {
+      br.align();
+      if (br.pos + 4 > data.length) throw new ZlibError("Unexpected end of compressed data");
+      const len = data[br.pos] | data[br.pos + 1] << 8;
+      const nlen = data[br.pos + 2] | data[br.pos + 3] << 8;
+      br.pos += 4;
+      if ((len ^ 65535) !== nlen) throw new ZlibError("Stored block length mismatch");
+      if (br.pos + len > data.length) throw new ZlibError("Unexpected end of compressed data");
+      out.ensure(len);
+      out.buf.set(data.subarray(br.pos, br.pos + len), out.len);
+      out.len += len;
+      br.pos += len;
+      continue;
+    }
+    let lit;
+    let dist;
+    if (type === 1) [lit, dist] = fixedTables();
+    else if (type === 2) {
+      const hlit = br.need(5) + 257;
+      const hdist = br.need(5) + 1;
+      const hclen = br.need(4) + 4;
+      const cl = new Uint8Array(19);
+      for (let i2 = 0; i2 < hclen; i2++) cl[CL_ORDER[i2]] = br.need(3);
+      const clh = buildHuffman(cl, 19);
+      const lengths = new Uint8Array(hlit + hdist);
+      let i = 0;
+      while (i < hlit + hdist) {
+        const sym = br.decode(clh);
+        if (sym < 16) lengths[i++] = sym;
+        else {
+          let rep = 0;
+          let val = 0;
+          if (sym === 16) {
+            if (i === 0) throw new ZlibError("Repeat with no previous length");
+            val = lengths[i - 1];
+            rep = 3 + br.need(2);
+          } else if (sym === 17) rep = 3 + br.need(3);
+          else rep = 11 + br.need(7);
+          if (i + rep > hlit + hdist) throw new ZlibError("Too many code lengths");
+          while (rep--) lengths[i++] = val;
+        }
+      }
+      lit = buildHuffman(lengths.subarray(0, hlit), hlit);
+      dist = buildHuffman(lengths.subarray(hlit), hdist);
+    } else throw new ZlibError("Invalid block type");
+    for (; ; ) {
+      const sym = br.decode(lit);
+      if (sym < 256) {
+        out.ensure(1);
+        out.buf[out.len++] = sym;
+      } else if (sym === 256) break;
+      else {
+        const li = sym - 257;
+        if (li >= 29) throw new ZlibError("Invalid length symbol");
+        const len = LENGTH_BASE[li] + br.need(LENGTH_EXTRA[li]);
+        const di = br.decode(dist);
+        if (di >= 30) throw new ZlibError("Invalid distance symbol");
+        const d = DIST_BASE[di] + br.need(DIST_EXTRA[di]);
+        if (d > out.len) throw new ZlibError("Distance too far back");
+        out.ensure(len);
+        const buf = out.buf;
+        let p = out.len;
+        for (let k = 0; k < len; k++, p++) buf[p] = buf[p - d];
+        out.len = p;
+      }
+    }
+  }
+  return out.buf.slice(0, out.len);
+}
+function adler32(data) {
+  let a = 1;
+  let b = 0;
+  const n = data.length;
+  let i = 0;
+  while (i < n) {
+    const end = Math.min(n, i + 3800);
+    for (; i < end; i++) {
+      a += data[i];
+      b += a;
+    }
+    a %= 65521;
+    b %= 65521;
+  }
+  return (b << 16 | a) >>> 0;
+}
+function inflate(data, options = {}) {
+  if (data.length < 6) throw new ZlibError("Truncated zlib stream");
+  const cmf = data[0];
+  const flg = data[1];
+  if ((cmf & 15) !== 8 || (cmf << 8 | flg) % 31 !== 0) throw new ZlibError("Not a zlib stream");
+  if (flg & 32) throw new ZlibError("Preset dictionaries are not supported");
+  const out = inflateRaw(data.subarray(2), options);
+  if (options.verify !== false && data.length >= 6) {
+    const t = data.length - 4;
+    const want = (data[t] << 24 | data[t + 1] << 16 | data[t + 2] << 8 | data[t + 3]) >>> 0;
+    if (adler32(out) !== want) throw new ZlibError("Adler-32 mismatch");
+  }
+  return out;
+}
+var BitWriter = class {
+  buf;
+  len = 0;
+  bit = 0;
+  bits = 0;
+  constructor(hint) {
+    this.buf = new Uint8Array(Math.max(1024, hint));
+  }
+  grow() {
+    const next = new Uint8Array(this.buf.length * 2);
+    next.set(this.buf);
+    this.buf = next;
+  }
+  write(value, n) {
+    this.bit |= value << this.bits;
+    this.bits += n;
+    while (this.bits >= 8) {
+      if (this.len >= this.buf.length) this.grow();
+      this.buf[this.len++] = this.bit & 255;
+      this.bit >>>= 8;
+      this.bits -= 8;
+    }
+  }
+  flush() {
+    if (this.bits > 0) {
+      if (this.len >= this.buf.length) this.grow();
+      this.buf[this.len++] = this.bit & 255;
+    }
+    this.bit = 0;
+    this.bits = 0;
+  }
+  bytes() {
+    return this.buf.slice(0, this.len);
+  }
+};
+function codeLengths(freqs, maxBits) {
+  const n = freqs.length;
+  const lengths = new Uint8Array(n);
+  const f = Float64Array.from(freqs);
+  for (; ; ) {
+    const nodes = [];
+    for (let i = 0; i < n; i++) if (f[i] > 0) nodes.push({ w: f[i], sym: i });
+    lengths.fill(0);
+    if (nodes.length === 0) return lengths;
+    if (nodes.length === 1) {
+      lengths[nodes[0].sym] = 1;
+      return lengths;
+    }
+    const heap = nodes.map((_, i) => i);
+    const less = (a, b) => nodes[a].w < nodes[b].w || nodes[a].w === nodes[b].w && a < b;
+    const down = (i) => {
+      for (; ; ) {
+        const l = 2 * i + 1;
+        const r = l + 1;
+        let m = i;
+        if (l < heap.length && less(heap[l], heap[m])) m = l;
+        if (r < heap.length && less(heap[r], heap[m])) m = r;
+        if (m === i) return;
+        [heap[i], heap[m]] = [heap[m], heap[i]];
+        i = m;
+      }
+    };
+    const up = (i) => {
+      while (i > 0) {
+        const p = i - 1 >> 1;
+        if (!less(heap[i], heap[p])) return;
+        [heap[i], heap[p]] = [heap[p], heap[i]];
+        i = p;
+      }
+    };
+    for (let i = (heap.length >> 1) - 1; i >= 0; i--) down(i);
+    const pop = () => {
+      const top = heap[0];
+      const last = heap.pop();
+      if (heap.length) {
+        heap[0] = last;
+        down(0);
+      }
+      return top;
+    };
+    while (heap.length > 1) {
+      const a = pop();
+      const b = pop();
+      nodes.push({ w: nodes[a].w + nodes[b].w, sym: -1, left: a, right: b });
+      heap.push(nodes.length - 1);
+      up(heap.length - 1);
+    }
+    let maxLen = 0;
+    const stack = [[heap[0], 0]];
+    while (stack.length) {
+      const [i, d] = stack.pop();
+      const node = nodes[i];
+      if (node.sym >= 0) {
+        lengths[node.sym] = d;
+        if (d > maxLen) maxLen = d;
+      } else {
+        stack.push([node.left, d + 1], [node.right, d + 1]);
+      }
+    }
+    if (maxLen <= maxBits) return lengths;
+    for (let i = 0; i < n; i++) if (f[i] > 0) f[i] = Math.floor(f[i] / 2) + 1;
+  }
+}
+function canonicalCodes(lengths) {
+  const blCount = new Uint16Array(16);
+  for (const l of lengths) blCount[l]++;
+  blCount[0] = 0;
+  const next = new Uint16Array(16);
+  let code = 0;
+  for (let bits = 1; bits < 16; bits++) {
+    code = code + blCount[bits - 1] << 1;
+    next[bits] = code;
+  }
+  const codes = new Uint16Array(lengths.length);
+  for (let i = 0; i < lengths.length; i++) {
+    const len = lengths[i];
+    if (!len) continue;
+    let c = next[len]++;
+    let r = 0;
+    for (let k = 0; k < len; k++) {
+      r = r << 1 | c & 1;
+      c >>= 1;
+    }
+    codes[i] = r;
+  }
+  return codes;
+}
+function lengthSymbol(len) {
+  let i = 28;
+  while (LENGTH_BASE[i] > len) i--;
+  return i;
+}
+function distSymbol(d) {
+  let i = 29;
+  while (DIST_BASE[i] > d) i--;
+  return i;
+}
+var WINDOW = 32768;
+var HASH_BITS = 15;
+var HASH_SIZE = 1 << HASH_BITS;
+var MAX_CHAIN = 24;
+var MAX_MATCH = 258;
+var BLOCK_SYMBOLS = 65536;
+function deflateRaw(data, level = 1) {
+  const w = new BitWriter(Math.ceil(data.length / 2) + 64);
+  const n = data.length;
+  if (level === 0 || n === 0) {
+    let pos = 0;
+    do {
+      const len = Math.min(65535, n - pos);
+      const final = pos + len >= n ? 1 : 0;
+      w.write(final, 1);
+      w.write(0, 2);
+      w.flush();
+      w.write(len & 65535, 16);
+      w.write(~len & 65535, 16);
+      for (let i2 = 0; i2 < len; i2++) w.write(data[pos + i2], 8);
+      pos += len;
+    } while (pos < n);
+    return w.bytes();
+  }
+  const head = new Int32Array(HASH_SIZE).fill(-1);
+  const prev = new Int32Array(WINDOW);
+  const litLen = new Uint16Array(BLOCK_SYMBOLS);
+  const dists = new Uint16Array(BLOCK_SYMBOLS);
+  let count = 0;
+  const hash = (i2) => (data[i2] << 10 ^ data[i2 + 1] << 5 ^ data[i2 + 2]) * 2654435761 >>> 32 - HASH_BITS;
+  const insert = (i2) => {
+    if (i2 + 2 >= n) return;
+    const h = hash(i2);
+    prev[i2 & WINDOW - 1] = head[h];
+    head[h] = i2;
+  };
+  const flushBlock = (final) => {
+    const litFreq = new Uint32Array(286);
+    const distFreq = new Uint32Array(30);
+    for (let k = 0; k < count; k++) {
+      if (dists[k] === 0) litFreq[litLen[k]]++;
+      else {
+        litFreq[257 + lengthSymbol(litLen[k])]++;
+        distFreq[distSymbol(dists[k])]++;
+      }
+    }
+    litFreq[256] = 1;
+    let anyDist = false;
+    for (const v of distFreq) if (v) anyDist = true;
+    if (!anyDist) distFreq[0] = 1;
+    const litLengths = codeLengths(litFreq, 15);
+    const distLengths = codeLengths(distFreq, 15);
+    let hlit = 286;
+    while (hlit > 257 && !litLengths[hlit - 1]) hlit--;
+    let hdist = 30;
+    while (hdist > 1 && !distLengths[hdist - 1]) hdist--;
+    const all = new Uint8Array(hlit + hdist);
+    all.set(litLengths.subarray(0, hlit));
+    all.set(distLengths.subarray(0, hdist), hlit);
+    const clSyms = [];
+    const clExtra = [];
+    for (let i2 = 0; i2 < all.length; ) {
+      const v = all[i2];
+      let run = 1;
+      while (i2 + run < all.length && all[i2 + run] === v) run++;
+      if (v === 0 && run >= 3) {
+        const r = Math.min(run, 138);
+        if (r >= 11) {
+          clSyms.push(18);
+          clExtra.push(r - 11);
+        } else {
+          clSyms.push(17);
+          clExtra.push(r - 3);
+        }
+        i2 += r;
+      } else if (v !== 0 && run >= 4) {
+        clSyms.push(v);
+        clExtra.push(0);
+        const r = Math.min(run - 1, 6);
+        clSyms.push(16);
+        clExtra.push(r - 3);
+        i2 += r + 1;
+      } else {
+        clSyms.push(v);
+        clExtra.push(0);
+        i2++;
+      }
+    }
+    const clFreq = new Uint32Array(19);
+    for (const s of clSyms) clFreq[s]++;
+    const clLengths = codeLengths(clFreq, 7);
+    let hclen = 19;
+    while (hclen > 4 && !clLengths[CL_ORDER[hclen - 1]]) hclen--;
+    const clCodes = canonicalCodes(clLengths);
+    const litCodes = canonicalCodes(litLengths);
+    const distCodes = canonicalCodes(distLengths);
+    w.write(final ? 1 : 0, 1);
+    w.write(2, 2);
+    w.write(hlit - 257, 5);
+    w.write(hdist - 1, 5);
+    w.write(hclen - 4, 4);
+    for (let i2 = 0; i2 < hclen; i2++) w.write(clLengths[CL_ORDER[i2]], 3);
+    for (let i2 = 0; i2 < clSyms.length; i2++) {
+      const s = clSyms[i2];
+      w.write(clCodes[s], clLengths[s]);
+      if (s === 16) w.write(clExtra[i2], 2);
+      else if (s === 17) w.write(clExtra[i2], 3);
+      else if (s === 18) w.write(clExtra[i2], 7);
+    }
+    for (let k = 0; k < count; k++) {
+      const d = dists[k];
+      if (d === 0) {
+        const s = litLen[k];
+        w.write(litCodes[s], litLengths[s]);
+      } else {
+        const len = litLen[k];
+        const li = lengthSymbol(len);
+        w.write(litCodes[257 + li], litLengths[257 + li]);
+        if (LENGTH_EXTRA[li]) w.write(len - LENGTH_BASE[li], LENGTH_EXTRA[li]);
+        const di = distSymbol(d);
+        w.write(distCodes[di], distLengths[di]);
+        if (DIST_EXTRA[di]) w.write(d - DIST_BASE[di], DIST_EXTRA[di]);
+      }
+    }
+    w.write(litCodes[256], litLengths[256]);
+    count = 0;
+  };
+  let i = 0;
+  while (i < n) {
+    let bestLen = 0;
+    let bestDist = 0;
+    if (i + 2 < n) {
+      let cand = head[hash(i)];
+      let chain = MAX_CHAIN;
+      const limit = Math.min(MAX_MATCH, n - i);
+      while (cand >= 0 && i - cand <= WINDOW - 1 && chain-- > 0) {
+        if (data[cand + bestLen] === data[i + bestLen]) {
+          let l = 0;
+          while (l < limit && data[cand + l] === data[i + l]) l++;
+          if (l > bestLen) {
+            bestLen = l;
+            bestDist = i - cand;
+            if (l === limit) break;
+          }
+        }
+        const next = prev[cand & WINDOW - 1];
+        if (next >= cand) break;
+        cand = next;
+      }
+    }
+    if (bestLen >= 3) {
+      litLen[count] = bestLen;
+      dists[count] = bestDist;
+      count++;
+      const end = i + bestLen;
+      const insertEnd = bestLen > 64 ? i + 64 : end;
+      for (let k = i; k < insertEnd; k++) insert(k);
+      for (let k = Math.max(insertEnd, end - 3); k < end; k++) insert(k);
+      i = end;
+    } else {
+      litLen[count] = data[i];
+      dists[count] = 0;
+      count++;
+      insert(i);
+      i++;
+    }
+    if (count >= BLOCK_SYMBOLS - 1 && i < n) flushBlock(false);
+  }
+  flushBlock(true);
+  w.flush();
+  return w.bytes();
+}
+function deflate(data, level = 1) {
+  const raw = deflateRaw(data, level);
+  const out = new Uint8Array(raw.length + 6);
+  out[0] = 120;
+  out[1] = 1;
+  out.set(raw, 2);
+  const a = adler32(data);
+  const t = out.length - 4;
+  out[t] = a >>> 24;
+  out[t + 1] = a >>> 16 & 255;
+  out[t + 2] = a >>> 8 & 255;
+  out[t + 3] = a & 255;
+  return out;
+}
+
+export {
+  ZlibError,
+  inflateRaw,
+  adler32,
+  inflate,
+  deflateRaw,
+  deflate
+};
+//# sourceMappingURL=chunk-6FCKOS2B.js.map

package/dist/chunk-6FCKOS2B.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/raster/zlib.ts"],"sourcesContent":["/**\n * Synchronous zlib (RFC 1950) and raw deflate (RFC 1951), dependency-free, for the image editor's\n * layer PNGs and PSD ZIP channels. `CompressionStream` is asynchronous and not everywhere, and\n * layer pixels must serialize inside the synchronous `toJSON()`.\n *\n * - `inflate` handles stored, fixed and dynamic blocks and refuses to produce more than\n *   `maxOutput` bytes (a decompression bomb guard).\n * - `deflate` is a greedy LZ77 (hash chains, 32 KiB window) with one dynamic Huffman block per\n *   64 Ki symbols. It favours simplicity over the last few percent of ratio.\n */\n\n// ---------------------------------------------------------------------------\n// Shared tables\n// ---------------------------------------------------------------------------\n\nconst LENGTH_BASE = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258];\nconst LENGTH_EXTRA = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0];\nconst DIST_BASE = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577];\nconst DIST_EXTRA = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13];\nconst CL_ORDER = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];\n\nexport class ZlibError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'ZlibError';\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Inflate\n// ---------------------------------------------------------------------------\n\ninterface Huffman {\n  counts: Uint16Array;\n  symbols: Uint16Array;\n}\n\nfunction buildHuffman(lengths: ArrayLike<number>, n: number): Huffman {\n  const counts = new Uint16Array(16);\n  for (let i = 0; i < n; i++) counts[lengths[i]]++;\n  counts[0] = 0;\n  const offs = new Uint16Array(16);\n  for (let i = 1; i < 16; i++) offs[i] = offs[i - 1] + counts[i - 1];\n  const symbols = new Uint16Array(n);\n  for (let i = 0; i < n; i++) if (lengths[i]) symbols[offs[lengths[i]]++] = i;\n  return { counts, symbols };\n}\n\nlet fixedLit: Huffman | null = null;\nlet fixedDist: Huffman | null = null;\nfunction fixedTables(): [Huffman, Huffman] {\n  if (!fixedLit || !fixedDist) {\n    const l = new Uint8Array(288);\n    for (let i = 0; i < 144; i++) l[i] = 8;\n    for (let i = 144; i < 256; i++) l[i] = 9;\n    for (let i = 256; i < 280; i++) l[i] = 7;\n    for (let i = 280; i < 288; i++) l[i] = 8;\n    fixedLit = buildHuffman(l, 288);\n    const d = new Uint8Array(30).fill(5);\n    fixedDist = buildHuffman(d, 30);\n  }\n  return [fixedLit, fixedDist];\n}\n\nclass BitReader {\n  pos = 0;\n  bit = 0;\n  bits = 0;\n  constructor(readonly data: Uint8Array) {}\n  need(n: number): number {\n    while (this.bits < n) {\n      if (this.pos >= this.data.length) throw new ZlibError('Unexpected end of compressed data');\n      this.bit |= this.data[this.pos++] << this.bits;\n      this.bits += 8;\n    }\n    const v = this.bit & ((1 << n) - 1);\n    this.bit >>>= n;\n    this.bits -= n;\n    return v;\n  }\n  decode(h: Huffman): number {\n    let code = 0;\n    let first = 0;\n    let index = 0;\n    for (let len = 1; len < 16; len++) {\n      code |= this.need(1);\n      const count = h.counts[len];\n      if (code - count < first) return h.symbols[index + (code - first)];\n      index += count;\n      first += count;\n      first <<= 1;\n      code <<= 1;\n    }\n    throw new ZlibError('Invalid Huffman code');\n  }\n  align(): void {\n    this.bit = 0;\n    this.bits = 0;\n  }\n}\n\nclass Output {\n  buf: Uint8Array;\n  len = 0;\n  constructor(hint: number, readonly max: number) {\n    this.buf = new Uint8Array(Math.max(1024, Math.min(hint, max)));\n  }\n  ensure(n: number): void {\n    if (this.len + n > this.max) throw new ZlibError(`Decompressed data exceeds ${this.max} bytes`);\n    if (this.len + n <= this.buf.length) return;\n    let size = this.buf.length * 2;\n    while (size < this.len + n) size *= 2;\n    const next = new Uint8Array(Math.min(size, Math.max(this.max, this.len + n)));\n    next.set(this.buf.subarray(0, this.len));\n    this.buf = next;\n  }\n}\n\n/** Inflates raw deflate data (no zlib header). */\nexport function inflateRaw(data: Uint8Array, options: { maxOutput?: number; sizeHint?: number } = {}): Uint8Array {\n  const max = options.maxOutput ?? 512 * 1024 * 1024;\n  const out = new Output(options.sizeHint ?? data.length * 4, max);\n  const br = new BitReader(data);\n  let final = 0;\n  while (!final) {\n    final = br.need(1);\n    const type = br.need(2);\n    if (type === 0) {\n      br.align();\n      if (br.pos + 4 > data.length) throw new ZlibError('Unexpected end of compressed data');\n      const len = data[br.pos] | (data[br.pos + 1] << 8);\n      const nlen = data[br.pos + 2] | (data[br.pos + 3] << 8);\n      br.pos += 4;\n      if ((len ^ 0xffff) !== nlen) throw new ZlibError('Stored block length mismatch');\n      if (br.pos + len > data.length) throw new ZlibError('Unexpected end of compressed data');\n      out.ensure(len);\n      out.buf.set(data.subarray(br.pos, br.pos + len), out.len);\n      out.len += len;\n      br.pos += len;\n      continue;\n    }\n    let lit: Huffman;\n    let dist: Huffman;\n    if (type === 1) [lit, dist] = fixedTables();\n    else if (type === 2) {\n      const hlit = br.need(5) + 257;\n      const hdist = br.need(5) + 1;\n      const hclen = br.need(4) + 4;\n      const cl = new Uint8Array(19);\n      for (let i = 0; i < hclen; i++) cl[CL_ORDER[i]] = br.need(3);\n      const clh = buildHuffman(cl, 19);\n      const lengths = new Uint8Array(hlit + hdist);\n      let i = 0;\n      while (i < hlit + hdist) {\n        const sym = br.decode(clh);\n        if (sym < 16) lengths[i++] = sym;\n        else {\n          let rep = 0;\n          let val = 0;\n          if (sym === 16) {\n            if (i === 0) throw new ZlibError('Repeat with no previous length');\n            val = lengths[i - 1];\n            rep = 3 + br.need(2);\n          } else if (sym === 17) rep = 3 + br.need(3);\n          else rep = 11 + br.need(7);\n          if (i + rep > hlit + hdist) throw new ZlibError('Too many code lengths');\n          while (rep--) lengths[i++] = val;\n        }\n      }\n      lit = buildHuffman(lengths.subarray(0, hlit), hlit);\n      dist = buildHuffman(lengths.subarray(hlit), hdist);\n    } else throw new ZlibError('Invalid block type');\n    for (;;) {\n      const sym = br.decode(lit);\n      if (sym < 256) {\n        out.ensure(1);\n        out.buf[out.len++] = sym;\n      } else if (sym === 256) break;\n      else {\n        const li = sym - 257;\n        if (li >= 29) throw new ZlibError('Invalid length symbol');\n        const len = LENGTH_BASE[li] + br.need(LENGTH_EXTRA[li]);\n        const di = br.decode(dist);\n        if (di >= 30) throw new ZlibError('Invalid distance symbol');\n        const d = DIST_BASE[di] + br.need(DIST_EXTRA[di]);\n        if (d > out.len) throw new ZlibError('Distance too far back');\n        out.ensure(len);\n        const buf = out.buf;\n        let p = out.len;\n        for (let k = 0; k < len; k++, p++) buf[p] = buf[p - d];\n        out.len = p;\n      }\n    }\n  }\n  return out.buf.slice(0, out.len);\n}\n\n/** Adler-32 checksum (zlib trailer). */\nexport function adler32(data: Uint8Array): number {\n  let a = 1;\n  let b = 0;\n  const n = data.length;\n  let i = 0;\n  while (i < n) {\n    const end = Math.min(n, i + 3800);\n    for (; i < end; i++) {\n      a += data[i];\n      b += a;\n    }\n    a %= 65521;\n    b %= 65521;\n  }\n  return ((b << 16) | a) >>> 0;\n}\n\n/** Inflates zlib data (header, deflate stream, Adler-32 trailer). */\nexport function inflate(data: Uint8Array, options: { maxOutput?: number; sizeHint?: number; verify?: boolean } = {}): Uint8Array {\n  if (data.length < 6) throw new ZlibError('Truncated zlib stream');\n  const cmf = data[0];\n  const flg = data[1];\n  if ((cmf & 15) !== 8 || ((cmf << 8) | flg) % 31 !== 0) throw new ZlibError('Not a zlib stream');\n  if (flg & 32) throw new ZlibError('Preset dictionaries are not supported');\n  const out = inflateRaw(data.subarray(2), options);\n  if (options.verify !== false && data.length >= 6) {\n    const t = data.length - 4;\n    const want = ((data[t] << 24) | (data[t + 1] << 16) | (data[t + 2] << 8) | data[t + 3]) >>> 0;\n    if (adler32(out) !== want) throw new ZlibError('Adler-32 mismatch');\n  }\n  return out;\n}\n\n// ---------------------------------------------------------------------------\n// Deflate\n// ---------------------------------------------------------------------------\n\nclass BitWriter {\n  buf: Uint8Array;\n  len = 0;\n  bit = 0;\n  bits = 0;\n  constructor(hint: number) {\n    this.buf = new Uint8Array(Math.max(1024, hint));\n  }\n  private grow(): void {\n    const next = new Uint8Array(this.buf.length * 2);\n    next.set(this.buf);\n    this.buf = next;\n  }\n  write(value: number, n: number): void {\n    this.bit |= value << this.bits;\n    this.bits += n;\n    while (this.bits >= 8) {\n      if (this.len >= this.buf.length) this.grow();\n      this.buf[this.len++] = this.bit & 255;\n      this.bit >>>= 8;\n      this.bits -= 8;\n    }\n  }\n  flush(): void {\n    if (this.bits > 0) {\n      if (this.len >= this.buf.length) this.grow();\n      this.buf[this.len++] = this.bit & 255;\n    }\n    this.bit = 0;\n    this.bits = 0;\n  }\n  bytes(): Uint8Array {\n    return this.buf.slice(0, this.len);\n  }\n}\n\n/** Code lengths (≤ maxBits) for symbol frequencies, by Huffman's algorithm with frequency flattening. */\nfunction codeLengths(freqs: Uint32Array, maxBits: number): Uint8Array {\n  const n = freqs.length;\n  const lengths = new Uint8Array(n);\n  const f = Float64Array.from(freqs);\n  for (;;) {\n    const nodes: Array<{ w: number; sym: number; left?: number; right?: number }> = [];\n    for (let i = 0; i < n; i++) if (f[i] > 0) nodes.push({ w: f[i], sym: i });\n    lengths.fill(0);\n    if (nodes.length === 0) return lengths;\n    if (nodes.length === 1) {\n      lengths[nodes[0].sym] = 1;\n      return lengths;\n    }\n    // Simple binary heap of node indexes by weight.\n    const heap: number[] = nodes.map((_, i) => i);\n    const less = (a: number, b: number) => nodes[a].w < nodes[b].w || (nodes[a].w === nodes[b].w && a < b);\n    const down = (i: number) => {\n      for (;;) {\n        const l = 2 * i + 1;\n        const r = l + 1;\n        let m = i;\n        if (l < heap.length && less(heap[l], heap[m])) m = l;\n        if (r < heap.length && less(heap[r], heap[m])) m = r;\n        if (m === i) return;\n        [heap[i], heap[m]] = [heap[m], heap[i]];\n        i = m;\n      }\n    };\n    const up = (i: number) => {\n      while (i > 0) {\n        const p = (i - 1) >> 1;\n        if (!less(heap[i], heap[p])) return;\n        [heap[i], heap[p]] = [heap[p], heap[i]];\n        i = p;\n      }\n    };\n    for (let i = (heap.length >> 1) - 1; i >= 0; i--) down(i);\n    const pop = () => {\n      const top = heap[0];\n      const last = heap.pop()!;\n      if (heap.length) {\n        heap[0] = last;\n        down(0);\n      }\n      return top;\n    };\n    while (heap.length > 1) {\n      const a = pop();\n      const b = pop();\n      nodes.push({ w: nodes[a].w + nodes[b].w, sym: -1, left: a, right: b });\n      heap.push(nodes.length - 1);\n      up(heap.length - 1);\n    }\n    let maxLen = 0;\n    const stack: Array<[number, number]> = [[heap[0], 0]];\n    while (stack.length) {\n      const [i, d] = stack.pop()!;\n      const node = nodes[i];\n      if (node.sym >= 0) {\n        lengths[node.sym] = d;\n        if (d > maxLen) maxLen = d;\n      } else {\n        stack.push([node.left!, d + 1], [node.right!, d + 1]);\n      }\n    }\n    if (maxLen <= maxBits) return lengths;\n    // Too deep: flatten the distribution and retry.\n    for (let i = 0; i < n; i++) if (f[i] > 0) f[i] = Math.floor(f[i] / 2) + 1;\n  }\n}\n\n/** Canonical codes for code lengths, bit-reversed for LSB-first output. */\nfunction canonicalCodes(lengths: Uint8Array): Uint16Array {\n  const blCount = new Uint16Array(16);\n  for (const l of lengths) blCount[l]++;\n  blCount[0] = 0;\n  const next = new Uint16Array(16);\n  let code = 0;\n  for (let bits = 1; bits < 16; bits++) {\n    code = (code + blCount[bits - 1]) << 1;\n    next[bits] = code;\n  }\n  const codes = new Uint16Array(lengths.length);\n  for (let i = 0; i < lengths.length; i++) {\n    const len = lengths[i];\n    if (!len) continue;\n    let c = next[len]++;\n    let r = 0;\n    for (let k = 0; k < len; k++) {\n      r = (r << 1) | (c & 1);\n      c >>= 1;\n    }\n    codes[i] = r;\n  }\n  return codes;\n}\n\nfunction lengthSymbol(len: number): number {\n  let i = 28;\n  while (LENGTH_BASE[i] > len) i--;\n  return i;\n}\n\nfunction distSymbol(d: number): number {\n  let i = 29;\n  while (DIST_BASE[i] > d) i--;\n  return i;\n}\n\nconst WINDOW = 32768;\nconst HASH_BITS = 15;\nconst HASH_SIZE = 1 << HASH_BITS;\nconst MAX_CHAIN = 24;\nconst MAX_MATCH = 258;\nconst BLOCK_SYMBOLS = 65536;\n\n/** Raw deflate (no zlib header). `level` 0 stores the data uncompressed. */\nexport function deflateRaw(data: Uint8Array, level: 0 | 1 = 1): Uint8Array {\n  const w = new BitWriter(Math.ceil(data.length / 2) + 64);\n  const n = data.length;\n  if (level === 0 || n === 0) {\n    let pos = 0;\n    do {\n      const len = Math.min(65535, n - pos);\n      const final = pos + len >= n ? 1 : 0;\n      w.write(final, 1);\n      w.write(0, 2);\n      w.flush();\n      w.write(len & 0xffff, 16);\n      w.write(~len & 0xffff, 16);\n      for (let i = 0; i < len; i++) w.write(data[pos + i], 8);\n      pos += len;\n    } while (pos < n);\n    return w.bytes();\n  }\n\n  const head = new Int32Array(HASH_SIZE).fill(-1);\n  const prev = new Int32Array(WINDOW);\n  // Symbols of the current block: literal (0..255) or length/distance pairs.\n  const litLen = new Uint16Array(BLOCK_SYMBOLS);\n  const dists = new Uint16Array(BLOCK_SYMBOLS);\n  let count = 0;\n  const hash = (i: number) => (((data[i] << 10) ^ (data[i + 1] << 5) ^ data[i + 2]) * 2654435761) >>> (32 - HASH_BITS);\n  const insert = (i: number) => {\n    if (i + 2 >= n) return;\n    const h = hash(i);\n    prev[i & (WINDOW - 1)] = head[h];\n    head[h] = i;\n  };\n\n  const flushBlock = (final: boolean) => {\n    const litFreq = new Uint32Array(286);\n    const distFreq = new Uint32Array(30);\n    for (let k = 0; k < count; k++) {\n      if (dists[k] === 0) litFreq[litLen[k]]++;\n      else {\n        litFreq[257 + lengthSymbol(litLen[k])]++;\n        distFreq[distSymbol(dists[k])]++;\n      }\n    }\n    litFreq[256] = 1;\n    let anyDist = false;\n    for (const v of distFreq) if (v) anyDist = true;\n    if (!anyDist) distFreq[0] = 1;\n    const litLengths = codeLengths(litFreq, 15);\n    const distLengths = codeLengths(distFreq, 15);\n    let hlit = 286;\n    while (hlit > 257 && !litLengths[hlit - 1]) hlit--;\n    let hdist = 30;\n    while (hdist > 1 && !distLengths[hdist - 1]) hdist--;\n    const all = new Uint8Array(hlit + hdist);\n    all.set(litLengths.subarray(0, hlit));\n    all.set(distLengths.subarray(0, hdist), hlit);\n    // Run-length encode the code lengths.\n    const clSyms: number[] = [];\n    const clExtra: number[] = [];\n    for (let i = 0; i < all.length; ) {\n      const v = all[i];\n      let run = 1;\n      while (i + run < all.length && all[i + run] === v) run++;\n      if (v === 0 && run >= 3) {\n        const r = Math.min(run, 138);\n        if (r >= 11) {\n          clSyms.push(18);\n          clExtra.push(r - 11);\n        } else {\n          clSyms.push(17);\n          clExtra.push(r - 3);\n        }\n        i += r;\n      } else if (v !== 0 && run >= 4) {\n        clSyms.push(v);\n        clExtra.push(0);\n        const r = Math.min(run - 1, 6);\n        clSyms.push(16);\n        clExtra.push(r - 3);\n        i += r + 1;\n      } else {\n        clSyms.push(v);\n        clExtra.push(0);\n        i++;\n      }\n    }\n    const clFreq = new Uint32Array(19);\n    for (const s of clSyms) clFreq[s]++;\n    const clLengths = codeLengths(clFreq, 7);\n    let hclen = 19;\n    while (hclen > 4 && !clLengths[CL_ORDER[hclen - 1]]) hclen--;\n    const clCodes = canonicalCodes(clLengths);\n    const litCodes = canonicalCodes(litLengths);\n    const distCodes = canonicalCodes(distLengths);\n\n    w.write(final ? 1 : 0, 1);\n    w.write(2, 2);\n    w.write(hlit - 257, 5);\n    w.write(hdist - 1, 5);\n    w.write(hclen - 4, 4);\n    for (let i = 0; i < hclen; i++) w.write(clLengths[CL_ORDER[i]], 3);\n    for (let i = 0; i < clSyms.length; i++) {\n      const s = clSyms[i];\n      w.write(clCodes[s], clLengths[s]);\n      if (s === 16) w.write(clExtra[i], 2);\n      else if (s === 17) w.write(clExtra[i], 3);\n      else if (s === 18) w.write(clExtra[i], 7);\n    }\n    for (let k = 0; k < count; k++) {\n      const d = dists[k];\n      if (d === 0) {\n        const s = litLen[k];\n        w.write(litCodes[s], litLengths[s]);\n      } else {\n        const len = litLen[k];\n        const li = lengthSymbol(len);\n        w.write(litCodes[257 + li], litLengths[257 + li]);\n        if (LENGTH_EXTRA[li]) w.write(len - LENGTH_BASE[li], LENGTH_EXTRA[li]);\n        const di = distSymbol(d);\n        w.write(distCodes[di], distLengths[di]);\n        if (DIST_EXTRA[di]) w.write(d - DIST_BASE[di], DIST_EXTRA[di]);\n      }\n    }\n    w.write(litCodes[256], litLengths[256]);\n    count = 0;\n  };\n\n  let i = 0;\n  while (i < n) {\n    let bestLen = 0;\n    let bestDist = 0;\n    if (i + 2 < n) {\n      let cand = head[hash(i)];\n      let chain = MAX_CHAIN;\n      const limit = Math.min(MAX_MATCH, n - i);\n      while (cand >= 0 && i - cand <= WINDOW - 1 && chain-- > 0) {\n        if (data[cand + bestLen] === data[i + bestLen]) {\n          let l = 0;\n          while (l < limit && data[cand + l] === data[i + l]) l++;\n          if (l > bestLen) {\n            bestLen = l;\n            bestDist = i - cand;\n            if (l === limit) break;\n          }\n        }\n        const next = prev[cand & (WINDOW - 1)];\n        if (next >= cand) break;\n        cand = next;\n      }\n    }\n    if (bestLen >= 3) {\n      litLen[count] = bestLen;\n      dists[count] = bestDist;\n      count++;\n      const end = i + bestLen;\n      // Insert every position of long runs only up to a cap, which keeps solid areas fast.\n      const insertEnd = bestLen > 64 ? i + 64 : end;\n      for (let k = i; k < insertEnd; k++) insert(k);\n      for (let k = Math.max(insertEnd, end - 3); k < end; k++) insert(k);\n      i = end;\n    } else {\n      litLen[count] = data[i];\n      dists[count] = 0;\n      count++;\n      insert(i);\n      i++;\n    }\n    if (count >= BLOCK_SYMBOLS - 1 && i < n) flushBlock(false);\n  }\n  // The final block may hold only the end-of-block symbol.\n  flushBlock(true);\n  w.flush();\n  return w.bytes();\n}\n\n/** zlib stream: header, raw deflate, Adler-32. */\nexport function deflate(data: Uint8Array, level: 0 | 1 = 1): Uint8Array {\n  const raw = deflateRaw(data, level);\n  const out = new Uint8Array(raw.length + 6);\n  out[0] = 0x78;\n  out[1] = 0x01;\n  out.set(raw, 2);\n  const a = adler32(data);\n  const t = out.length - 4;\n  out[t] = a >>> 24;\n  out[t + 1] = (a >>> 16) & 255;\n  out[t + 2] = (a >>> 8) & 255;\n  out[t + 3] = a & 255;\n  return out;\n}\n"],"mappings":";AAeA,IAAM,cAAc,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACtI,IAAM,eAAe,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC3G,IAAM,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,OAAO,OAAO,KAAK;AAC/J,IAAM,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AACpH,IAAM,WAAW,CAAC,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE;AAE3E,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAWA,SAAS,aAAa,SAA4B,GAAoB;AACpE,QAAM,SAAS,IAAI,YAAY,EAAE;AACjC,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,QAAO,QAAQ,CAAC,CAAC;AAC7C,SAAO,CAAC,IAAI;AACZ,QAAM,OAAO,IAAI,YAAY,EAAE;AAC/B,WAAS,IAAI,GAAG,IAAI,IAAI,IAAK,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC;AACjE,QAAM,UAAU,IAAI,YAAY,CAAC;AACjC,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,KAAI,QAAQ,CAAC,EAAG,SAAQ,KAAK,QAAQ,CAAC,CAAC,GAAG,IAAI;AAC1E,SAAO,EAAE,QAAQ,QAAQ;AAC3B;AAEA,IAAI,WAA2B;AAC/B,IAAI,YAA4B;AAChC,SAAS,cAAkC;AACzC,MAAI,CAAC,YAAY,CAAC,WAAW;AAC3B,UAAM,IAAI,IAAI,WAAW,GAAG;AAC5B,aAAS,IAAI,GAAG,IAAI,KAAK,IAAK,GAAE,CAAC,IAAI;AACrC,aAAS,IAAI,KAAK,IAAI,KAAK,IAAK,GAAE,CAAC,IAAI;AACvC,aAAS,IAAI,KAAK,IAAI,KAAK,IAAK,GAAE,CAAC,IAAI;AACvC,aAAS,IAAI,KAAK,IAAI,KAAK,IAAK,GAAE,CAAC,IAAI;AACvC,eAAW,aAAa,GAAG,GAAG;AAC9B,UAAM,IAAI,IAAI,WAAW,EAAE,EAAE,KAAK,CAAC;AACnC,gBAAY,aAAa,GAAG,EAAE;AAAA,EAChC;AACA,SAAO,CAAC,UAAU,SAAS;AAC7B;AAEA,IAAM,YAAN,MAAgB;AAAA,EAId,YAAqB,MAAkB;AAAlB;AAAA,EAAmB;AAAA,EAAnB;AAAA,EAHrB,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EAEP,KAAK,GAAmB;AACtB,WAAO,KAAK,OAAO,GAAG;AACpB,UAAI,KAAK,OAAO,KAAK,KAAK,OAAQ,OAAM,IAAI,UAAU,mCAAmC;AACzF,WAAK,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AAC1C,WAAK,QAAQ;AAAA,IACf;AACA,UAAM,IAAI,KAAK,OAAQ,KAAK,KAAK;AACjC,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,WAAO;AAAA,EACT;AAAA,EACA,OAAO,GAAoB;AACzB,QAAI,OAAO;AACX,QAAI,QAAQ;AACZ,QAAI,QAAQ;AACZ,aAAS,MAAM,GAAG,MAAM,IAAI,OAAO;AACjC,cAAQ,KAAK,KAAK,CAAC;AACnB,YAAM,QAAQ,EAAE,OAAO,GAAG;AAC1B,UAAI,OAAO,QAAQ,MAAO,QAAO,EAAE,QAAQ,SAAS,OAAO,MAAM;AACjE,eAAS;AACT,eAAS;AACT,gBAAU;AACV,eAAS;AAAA,IACX;AACA,UAAM,IAAI,UAAU,sBAAsB;AAAA,EAC5C;AAAA,EACA,QAAc;AACZ,SAAK,MAAM;AACX,SAAK,OAAO;AAAA,EACd;AACF;AAEA,IAAM,SAAN,MAAa;AAAA,EAGX,YAAY,MAAuB,KAAa;AAAb;AACjC,SAAK,MAAM,IAAI,WAAW,KAAK,IAAI,MAAM,KAAK,IAAI,MAAM,GAAG,CAAC,CAAC;AAAA,EAC/D;AAAA,EAFmC;AAAA,EAFnC;AAAA,EACA,MAAM;AAAA,EAIN,OAAO,GAAiB;AACtB,QAAI,KAAK,MAAM,IAAI,KAAK,IAAK,OAAM,IAAI,UAAU,6BAA6B,KAAK,GAAG,QAAQ;AAC9F,QAAI,KAAK,MAAM,KAAK,KAAK,IAAI,OAAQ;AACrC,QAAI,OAAO,KAAK,IAAI,SAAS;AAC7B,WAAO,OAAO,KAAK,MAAM,EAAG,SAAQ;AACpC,UAAM,OAAO,IAAI,WAAW,KAAK,IAAI,MAAM,KAAK,IAAI,KAAK,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC;AAC5E,SAAK,IAAI,KAAK,IAAI,SAAS,GAAG,KAAK,GAAG,CAAC;AACvC,SAAK,MAAM;AAAA,EACb;AACF;AAGO,SAAS,WAAW,MAAkB,UAAqD,CAAC,GAAe;AAChH,QAAM,MAAM,QAAQ,aAAa,MAAM,OAAO;AAC9C,QAAM,MAAM,IAAI,OAAO,QAAQ,YAAY,KAAK,SAAS,GAAG,GAAG;AAC/D,QAAM,KAAK,IAAI,UAAU,IAAI;AAC7B,MAAI,QAAQ;AACZ,SAAO,CAAC,OAAO;AACb,YAAQ,GAAG,KAAK,CAAC;AACjB,UAAM,OAAO,GAAG,KAAK,CAAC;AACtB,QAAI,SAAS,GAAG;AACd,SAAG,MAAM;AACT,UAAI,GAAG,MAAM,IAAI,KAAK,OAAQ,OAAM,IAAI,UAAU,mCAAmC;AACrF,YAAM,MAAM,KAAK,GAAG,GAAG,IAAK,KAAK,GAAG,MAAM,CAAC,KAAK;AAChD,YAAM,OAAO,KAAK,GAAG,MAAM,CAAC,IAAK,KAAK,GAAG,MAAM,CAAC,KAAK;AACrD,SAAG,OAAO;AACV,WAAK,MAAM,WAAY,KAAM,OAAM,IAAI,UAAU,8BAA8B;AAC/E,UAAI,GAAG,MAAM,MAAM,KAAK,OAAQ,OAAM,IAAI,UAAU,mCAAmC;AACvF,UAAI,OAAO,GAAG;AACd,UAAI,IAAI,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG,IAAI,GAAG;AACxD,UAAI,OAAO;AACX,SAAG,OAAO;AACV;AAAA,IACF;AACA,QAAI;AACJ,QAAI;AACJ,QAAI,SAAS,EAAG,EAAC,KAAK,IAAI,IAAI,YAAY;AAAA,aACjC,SAAS,GAAG;AACnB,YAAM,OAAO,GAAG,KAAK,CAAC,IAAI;AAC1B,YAAM,QAAQ,GAAG,KAAK,CAAC,IAAI;AAC3B,YAAM,QAAQ,GAAG,KAAK,CAAC,IAAI;AAC3B,YAAM,KAAK,IAAI,WAAW,EAAE;AAC5B,eAASA,KAAI,GAAGA,KAAI,OAAOA,KAAK,IAAG,SAASA,EAAC,CAAC,IAAI,GAAG,KAAK,CAAC;AAC3D,YAAM,MAAM,aAAa,IAAI,EAAE;AAC/B,YAAM,UAAU,IAAI,WAAW,OAAO,KAAK;AAC3C,UAAI,IAAI;AACR,aAAO,IAAI,OAAO,OAAO;AACvB,cAAM,MAAM,GAAG,OAAO,GAAG;AACzB,YAAI,MAAM,GAAI,SAAQ,GAAG,IAAI;AAAA,aACxB;AACH,cAAI,MAAM;AACV,cAAI,MAAM;AACV,cAAI,QAAQ,IAAI;AACd,gBAAI,MAAM,EAAG,OAAM,IAAI,UAAU,gCAAgC;AACjE,kBAAM,QAAQ,IAAI,CAAC;AACnB,kBAAM,IAAI,GAAG,KAAK,CAAC;AAAA,UACrB,WAAW,QAAQ,GAAI,OAAM,IAAI,GAAG,KAAK,CAAC;AAAA,cACrC,OAAM,KAAK,GAAG,KAAK,CAAC;AACzB,cAAI,IAAI,MAAM,OAAO,MAAO,OAAM,IAAI,UAAU,uBAAuB;AACvE,iBAAO,MAAO,SAAQ,GAAG,IAAI;AAAA,QAC/B;AAAA,MACF;AACA,YAAM,aAAa,QAAQ,SAAS,GAAG,IAAI,GAAG,IAAI;AAClD,aAAO,aAAa,QAAQ,SAAS,IAAI,GAAG,KAAK;AAAA,IACnD,MAAO,OAAM,IAAI,UAAU,oBAAoB;AAC/C,eAAS;AACP,YAAM,MAAM,GAAG,OAAO,GAAG;AACzB,UAAI,MAAM,KAAK;AACb,YAAI,OAAO,CAAC;AACZ,YAAI,IAAI,IAAI,KAAK,IAAI;AAAA,MACvB,WAAW,QAAQ,IAAK;AAAA,WACnB;AACH,cAAM,KAAK,MAAM;AACjB,YAAI,MAAM,GAAI,OAAM,IAAI,UAAU,uBAAuB;AACzD,cAAM,MAAM,YAAY,EAAE,IAAI,GAAG,KAAK,aAAa,EAAE,CAAC;AACtD,cAAM,KAAK,GAAG,OAAO,IAAI;AACzB,YAAI,MAAM,GAAI,OAAM,IAAI,UAAU,yBAAyB;AAC3D,cAAM,IAAI,UAAU,EAAE,IAAI,GAAG,KAAK,WAAW,EAAE,CAAC;AAChD,YAAI,IAAI,IAAI,IAAK,OAAM,IAAI,UAAU,uBAAuB;AAC5D,YAAI,OAAO,GAAG;AACd,cAAM,MAAM,IAAI;AAChB,YAAI,IAAI,IAAI;AACZ,iBAAS,IAAI,GAAG,IAAI,KAAK,KAAK,IAAK,KAAI,CAAC,IAAI,IAAI,IAAI,CAAC;AACrD,YAAI,MAAM;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,SAAO,IAAI,IAAI,MAAM,GAAG,IAAI,GAAG;AACjC;AAGO,SAAS,QAAQ,MAA0B;AAChD,MAAI,IAAI;AACR,MAAI,IAAI;AACR,QAAM,IAAI,KAAK;AACf,MAAI,IAAI;AACR,SAAO,IAAI,GAAG;AACZ,UAAM,MAAM,KAAK,IAAI,GAAG,IAAI,IAAI;AAChC,WAAO,IAAI,KAAK,KAAK;AACnB,WAAK,KAAK,CAAC;AACX,WAAK;AAAA,IACP;AACA,SAAK;AACL,SAAK;AAAA,EACP;AACA,UAAS,KAAK,KAAM,OAAO;AAC7B;AAGO,SAAS,QAAQ,MAAkB,UAAuE,CAAC,GAAe;AAC/H,MAAI,KAAK,SAAS,EAAG,OAAM,IAAI,UAAU,uBAAuB;AAChE,QAAM,MAAM,KAAK,CAAC;AAClB,QAAM,MAAM,KAAK,CAAC;AAClB,OAAK,MAAM,QAAQ,MAAO,OAAO,IAAK,OAAO,OAAO,EAAG,OAAM,IAAI,UAAU,mBAAmB;AAC9F,MAAI,MAAM,GAAI,OAAM,IAAI,UAAU,uCAAuC;AACzE,QAAM,MAAM,WAAW,KAAK,SAAS,CAAC,GAAG,OAAO;AAChD,MAAI,QAAQ,WAAW,SAAS,KAAK,UAAU,GAAG;AAChD,UAAM,IAAI,KAAK,SAAS;AACxB,UAAM,QAAS,KAAK,CAAC,KAAK,KAAO,KAAK,IAAI,CAAC,KAAK,KAAO,KAAK,IAAI,CAAC,KAAK,IAAK,KAAK,IAAI,CAAC,OAAO;AAC5F,QAAI,QAAQ,GAAG,MAAM,KAAM,OAAM,IAAI,UAAU,mBAAmB;AAAA,EACpE;AACA,SAAO;AACT;AAMA,IAAM,YAAN,MAAgB;AAAA,EACd;AAAA,EACA,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,YAAY,MAAc;AACxB,SAAK,MAAM,IAAI,WAAW,KAAK,IAAI,MAAM,IAAI,CAAC;AAAA,EAChD;AAAA,EACQ,OAAa;AACnB,UAAM,OAAO,IAAI,WAAW,KAAK,IAAI,SAAS,CAAC;AAC/C,SAAK,IAAI,KAAK,GAAG;AACjB,SAAK,MAAM;AAAA,EACb;AAAA,EACA,MAAM,OAAe,GAAiB;AACpC,SAAK,OAAO,SAAS,KAAK;AAC1B,SAAK,QAAQ;AACb,WAAO,KAAK,QAAQ,GAAG;AACrB,UAAI,KAAK,OAAO,KAAK,IAAI,OAAQ,MAAK,KAAK;AAC3C,WAAK,IAAI,KAAK,KAAK,IAAI,KAAK,MAAM;AAClC,WAAK,SAAS;AACd,WAAK,QAAQ;AAAA,IACf;AAAA,EACF;AAAA,EACA,QAAc;AACZ,QAAI,KAAK,OAAO,GAAG;AACjB,UAAI,KAAK,OAAO,KAAK,IAAI,OAAQ,MAAK,KAAK;AAC3C,WAAK,IAAI,KAAK,KAAK,IAAI,KAAK,MAAM;AAAA,IACpC;AACA,SAAK,MAAM;AACX,SAAK,OAAO;AAAA,EACd;AAAA,EACA,QAAoB;AAClB,WAAO,KAAK,IAAI,MAAM,GAAG,KAAK,GAAG;AAAA,EACnC;AACF;AAGA,SAAS,YAAY,OAAoB,SAA6B;AACpE,QAAM,IAAI,MAAM;AAChB,QAAM,UAAU,IAAI,WAAW,CAAC;AAChC,QAAM,IAAI,aAAa,KAAK,KAAK;AACjC,aAAS;AACP,UAAM,QAA0E,CAAC;AACjF,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,KAAI,EAAE,CAAC,IAAI,EAAG,OAAM,KAAK,EAAE,GAAG,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC;AACxE,YAAQ,KAAK,CAAC;AACd,QAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAI,MAAM,WAAW,GAAG;AACtB,cAAQ,MAAM,CAAC,EAAE,GAAG,IAAI;AACxB,aAAO;AAAA,IACT;AAEA,UAAM,OAAiB,MAAM,IAAI,CAAC,GAAG,MAAM,CAAC;AAC5C,UAAM,OAAO,CAAC,GAAW,MAAc,MAAM,CAAC,EAAE,IAAI,MAAM,CAAC,EAAE,KAAM,MAAM,CAAC,EAAE,MAAM,MAAM,CAAC,EAAE,KAAK,IAAI;AACpG,UAAM,OAAO,CAAC,MAAc;AAC1B,iBAAS;AACP,cAAM,IAAI,IAAI,IAAI;AAClB,cAAM,IAAI,IAAI;AACd,YAAI,IAAI;AACR,YAAI,IAAI,KAAK,UAAU,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,EAAG,KAAI;AACnD,YAAI,IAAI,KAAK,UAAU,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,EAAG,KAAI;AACnD,YAAI,MAAM,EAAG;AACb,SAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AACtC,YAAI;AAAA,MACN;AAAA,IACF;AACA,UAAM,KAAK,CAAC,MAAc;AACxB,aAAO,IAAI,GAAG;AACZ,cAAM,IAAK,IAAI,KAAM;AACrB,YAAI,CAAC,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,EAAG;AAC7B,SAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AACtC,YAAI;AAAA,MACN;AAAA,IACF;AACA,aAAS,KAAK,KAAK,UAAU,KAAK,GAAG,KAAK,GAAG,IAAK,MAAK,CAAC;AACxD,UAAM,MAAM,MAAM;AAChB,YAAM,MAAM,KAAK,CAAC;AAClB,YAAM,OAAO,KAAK,IAAI;AACtB,UAAI,KAAK,QAAQ;AACf,aAAK,CAAC,IAAI;AACV,aAAK,CAAC;AAAA,MACR;AACA,aAAO;AAAA,IACT;AACA,WAAO,KAAK,SAAS,GAAG;AACtB,YAAM,IAAI,IAAI;AACd,YAAM,IAAI,IAAI;AACd,YAAM,KAAK,EAAE,GAAG,MAAM,CAAC,EAAE,IAAI,MAAM,CAAC,EAAE,GAAG,KAAK,IAAI,MAAM,GAAG,OAAO,EAAE,CAAC;AACrE,WAAK,KAAK,MAAM,SAAS,CAAC;AAC1B,SAAG,KAAK,SAAS,CAAC;AAAA,IACpB;AACA,QAAI,SAAS;AACb,UAAM,QAAiC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AACpD,WAAO,MAAM,QAAQ;AACnB,YAAM,CAAC,GAAG,CAAC,IAAI,MAAM,IAAI;AACzB,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,KAAK,OAAO,GAAG;AACjB,gBAAQ,KAAK,GAAG,IAAI;AACpB,YAAI,IAAI,OAAQ,UAAS;AAAA,MAC3B,OAAO;AACL,cAAM,KAAK,CAAC,KAAK,MAAO,IAAI,CAAC,GAAG,CAAC,KAAK,OAAQ,IAAI,CAAC,CAAC;AAAA,MACtD;AAAA,IACF;AACA,QAAI,UAAU,QAAS,QAAO;AAE9B,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,KAAI,EAAE,CAAC,IAAI,EAAG,GAAE,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC,IAAI,CAAC,IAAI;AAAA,EAC1E;AACF;AAGA,SAAS,eAAe,SAAkC;AACxD,QAAM,UAAU,IAAI,YAAY,EAAE;AAClC,aAAW,KAAK,QAAS,SAAQ,CAAC;AAClC,UAAQ,CAAC,IAAI;AACb,QAAM,OAAO,IAAI,YAAY,EAAE;AAC/B,MAAI,OAAO;AACX,WAAS,OAAO,GAAG,OAAO,IAAI,QAAQ;AACpC,WAAQ,OAAO,QAAQ,OAAO,CAAC,KAAM;AACrC,SAAK,IAAI,IAAI;AAAA,EACf;AACA,QAAM,QAAQ,IAAI,YAAY,QAAQ,MAAM;AAC5C,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAM,MAAM,QAAQ,CAAC;AACrB,QAAI,CAAC,IAAK;AACV,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,IAAI;AACR,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,UAAK,KAAK,IAAM,IAAI;AACpB,YAAM;AAAA,IACR;AACA,UAAM,CAAC,IAAI;AAAA,EACb;AACA,SAAO;AACT;AAEA,SAAS,aAAa,KAAqB;AACzC,MAAI,IAAI;AACR,SAAO,YAAY,CAAC,IAAI,IAAK;AAC7B,SAAO;AACT;AAEA,SAAS,WAAW,GAAmB;AACrC,MAAI,IAAI;AACR,SAAO,UAAU,CAAC,IAAI,EAAG;AACzB,SAAO;AACT;AAEA,IAAM,SAAS;AACf,IAAM,YAAY;AAClB,IAAM,YAAY,KAAK;AACvB,IAAM,YAAY;AAClB,IAAM,YAAY;AAClB,IAAM,gBAAgB;AAGf,SAAS,WAAW,MAAkB,QAAe,GAAe;AACzE,QAAM,IAAI,IAAI,UAAU,KAAK,KAAK,KAAK,SAAS,CAAC,IAAI,EAAE;AACvD,QAAM,IAAI,KAAK;AACf,MAAI,UAAU,KAAK,MAAM,GAAG;AAC1B,QAAI,MAAM;AACV,OAAG;AACD,YAAM,MAAM,KAAK,IAAI,OAAO,IAAI,GAAG;AACnC,YAAM,QAAQ,MAAM,OAAO,IAAI,IAAI;AACnC,QAAE,MAAM,OAAO,CAAC;AAChB,QAAE,MAAM,GAAG,CAAC;AACZ,QAAE,MAAM;AACR,QAAE,MAAM,MAAM,OAAQ,EAAE;AACxB,QAAE,MAAM,CAAC,MAAM,OAAQ,EAAE;AACzB,eAASA,KAAI,GAAGA,KAAI,KAAKA,KAAK,GAAE,MAAM,KAAK,MAAMA,EAAC,GAAG,CAAC;AACtD,aAAO;AAAA,IACT,SAAS,MAAM;AACf,WAAO,EAAE,MAAM;AAAA,EACjB;AAEA,QAAM,OAAO,IAAI,WAAW,SAAS,EAAE,KAAK,EAAE;AAC9C,QAAM,OAAO,IAAI,WAAW,MAAM;AAElC,QAAM,SAAS,IAAI,YAAY,aAAa;AAC5C,QAAM,QAAQ,IAAI,YAAY,aAAa;AAC3C,MAAI,QAAQ;AACZ,QAAM,OAAO,CAACA,QAAiB,KAAKA,EAAC,KAAK,KAAO,KAAKA,KAAI,CAAC,KAAK,IAAK,KAAKA,KAAI,CAAC,KAAK,eAAiB,KAAK;AAC1G,QAAM,SAAS,CAACA,OAAc;AAC5B,QAAIA,KAAI,KAAK,EAAG;AAChB,UAAM,IAAI,KAAKA,EAAC;AAChB,SAAKA,KAAK,SAAS,CAAE,IAAI,KAAK,CAAC;AAC/B,SAAK,CAAC,IAAIA;AAAA,EACZ;AAEA,QAAM,aAAa,CAAC,UAAmB;AACrC,UAAM,UAAU,IAAI,YAAY,GAAG;AACnC,UAAM,WAAW,IAAI,YAAY,EAAE;AACnC,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAI,MAAM,CAAC,MAAM,EAAG,SAAQ,OAAO,CAAC,CAAC;AAAA,WAChC;AACH,gBAAQ,MAAM,aAAa,OAAO,CAAC,CAAC,CAAC;AACrC,iBAAS,WAAW,MAAM,CAAC,CAAC,CAAC;AAAA,MAC/B;AAAA,IACF;AACA,YAAQ,GAAG,IAAI;AACf,QAAI,UAAU;AACd,eAAW,KAAK,SAAU,KAAI,EAAG,WAAU;AAC3C,QAAI,CAAC,QAAS,UAAS,CAAC,IAAI;AAC5B,UAAM,aAAa,YAAY,SAAS,EAAE;AAC1C,UAAM,cAAc,YAAY,UAAU,EAAE;AAC5C,QAAI,OAAO;AACX,WAAO,OAAO,OAAO,CAAC,WAAW,OAAO,CAAC,EAAG;AAC5C,QAAI,QAAQ;AACZ,WAAO,QAAQ,KAAK,CAAC,YAAY,QAAQ,CAAC,EAAG;AAC7C,UAAM,MAAM,IAAI,WAAW,OAAO,KAAK;AACvC,QAAI,IAAI,WAAW,SAAS,GAAG,IAAI,CAAC;AACpC,QAAI,IAAI,YAAY,SAAS,GAAG,KAAK,GAAG,IAAI;AAE5C,UAAM,SAAmB,CAAC;AAC1B,UAAM,UAAoB,CAAC;AAC3B,aAASA,KAAI,GAAGA,KAAI,IAAI,UAAU;AAChC,YAAM,IAAI,IAAIA,EAAC;AACf,UAAI,MAAM;AACV,aAAOA,KAAI,MAAM,IAAI,UAAU,IAAIA,KAAI,GAAG,MAAM,EAAG;AACnD,UAAI,MAAM,KAAK,OAAO,GAAG;AACvB,cAAM,IAAI,KAAK,IAAI,KAAK,GAAG;AAC3B,YAAI,KAAK,IAAI;AACX,iBAAO,KAAK,EAAE;AACd,kBAAQ,KAAK,IAAI,EAAE;AAAA,QACrB,OAAO;AACL,iBAAO,KAAK,EAAE;AACd,kBAAQ,KAAK,IAAI,CAAC;AAAA,QACpB;AACA,QAAAA,MAAK;AAAA,MACP,WAAW,MAAM,KAAK,OAAO,GAAG;AAC9B,eAAO,KAAK,CAAC;AACb,gBAAQ,KAAK,CAAC;AACd,cAAM,IAAI,KAAK,IAAI,MAAM,GAAG,CAAC;AAC7B,eAAO,KAAK,EAAE;AACd,gBAAQ,KAAK,IAAI,CAAC;AAClB,QAAAA,MAAK,IAAI;AAAA,MACX,OAAO;AACL,eAAO,KAAK,CAAC;AACb,gBAAQ,KAAK,CAAC;AACd,QAAAA;AAAA,MACF;AAAA,IACF;AACA,UAAM,SAAS,IAAI,YAAY,EAAE;AACjC,eAAW,KAAK,OAAQ,QAAO,CAAC;AAChC,UAAM,YAAY,YAAY,QAAQ,CAAC;AACvC,QAAI,QAAQ;AACZ,WAAO,QAAQ,KAAK,CAAC,UAAU,SAAS,QAAQ,CAAC,CAAC,EAAG;AACrD,UAAM,UAAU,eAAe,SAAS;AACxC,UAAM,WAAW,eAAe,UAAU;AAC1C,UAAM,YAAY,eAAe,WAAW;AAE5C,MAAE,MAAM,QAAQ,IAAI,GAAG,CAAC;AACxB,MAAE,MAAM,GAAG,CAAC;AACZ,MAAE,MAAM,OAAO,KAAK,CAAC;AACrB,MAAE,MAAM,QAAQ,GAAG,CAAC;AACpB,MAAE,MAAM,QAAQ,GAAG,CAAC;AACpB,aAASA,KAAI,GAAGA,KAAI,OAAOA,KAAK,GAAE,MAAM,UAAU,SAASA,EAAC,CAAC,GAAG,CAAC;AACjE,aAASA,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,YAAM,IAAI,OAAOA,EAAC;AAClB,QAAE,MAAM,QAAQ,CAAC,GAAG,UAAU,CAAC,CAAC;AAChC,UAAI,MAAM,GAAI,GAAE,MAAM,QAAQA,EAAC,GAAG,CAAC;AAAA,eAC1B,MAAM,GAAI,GAAE,MAAM,QAAQA,EAAC,GAAG,CAAC;AAAA,eAC/B,MAAM,GAAI,GAAE,MAAM,QAAQA,EAAC,GAAG,CAAC;AAAA,IAC1C;AACA,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,YAAM,IAAI,MAAM,CAAC;AACjB,UAAI,MAAM,GAAG;AACX,cAAM,IAAI,OAAO,CAAC;AAClB,UAAE,MAAM,SAAS,CAAC,GAAG,WAAW,CAAC,CAAC;AAAA,MACpC,OAAO;AACL,cAAM,MAAM,OAAO,CAAC;AACpB,cAAM,KAAK,aAAa,GAAG;AAC3B,UAAE,MAAM,SAAS,MAAM,EAAE,GAAG,WAAW,MAAM,EAAE,CAAC;AAChD,YAAI,aAAa,EAAE,EAAG,GAAE,MAAM,MAAM,YAAY,EAAE,GAAG,aAAa,EAAE,CAAC;AACrE,cAAM,KAAK,WAAW,CAAC;AACvB,UAAE,MAAM,UAAU,EAAE,GAAG,YAAY,EAAE,CAAC;AACtC,YAAI,WAAW,EAAE,EAAG,GAAE,MAAM,IAAI,UAAU,EAAE,GAAG,WAAW,EAAE,CAAC;AAAA,MAC/D;AAAA,IACF;AACA,MAAE,MAAM,SAAS,GAAG,GAAG,WAAW,GAAG,CAAC;AACtC,YAAQ;AAAA,EACV;AAEA,MAAI,IAAI;AACR,SAAO,IAAI,GAAG;AACZ,QAAI,UAAU;AACd,QAAI,WAAW;AACf,QAAI,IAAI,IAAI,GAAG;AACb,UAAI,OAAO,KAAK,KAAK,CAAC,CAAC;AACvB,UAAI,QAAQ;AACZ,YAAM,QAAQ,KAAK,IAAI,WAAW,IAAI,CAAC;AACvC,aAAO,QAAQ,KAAK,IAAI,QAAQ,SAAS,KAAK,UAAU,GAAG;AACzD,YAAI,KAAK,OAAO,OAAO,MAAM,KAAK,IAAI,OAAO,GAAG;AAC9C,cAAI,IAAI;AACR,iBAAO,IAAI,SAAS,KAAK,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,EAAG;AACpD,cAAI,IAAI,SAAS;AACf,sBAAU;AACV,uBAAW,IAAI;AACf,gBAAI,MAAM,MAAO;AAAA,UACnB;AAAA,QACF;AACA,cAAM,OAAO,KAAK,OAAQ,SAAS,CAAE;AACrC,YAAI,QAAQ,KAAM;AAClB,eAAO;AAAA,MACT;AAAA,IACF;AACA,QAAI,WAAW,GAAG;AAChB,aAAO,KAAK,IAAI;AAChB,YAAM,KAAK,IAAI;AACf;AACA,YAAM,MAAM,IAAI;AAEhB,YAAM,YAAY,UAAU,KAAK,IAAI,KAAK;AAC1C,eAAS,IAAI,GAAG,IAAI,WAAW,IAAK,QAAO,CAAC;AAC5C,eAAS,IAAI,KAAK,IAAI,WAAW,MAAM,CAAC,GAAG,IAAI,KAAK,IAAK,QAAO,CAAC;AACjE,UAAI;AAAA,IACN,OAAO;AACL,aAAO,KAAK,IAAI,KAAK,CAAC;AACtB,YAAM,KAAK,IAAI;AACf;AACA,aAAO,CAAC;AACR;AAAA,IACF;AACA,QAAI,SAAS,gBAAgB,KAAK,IAAI,EAAG,YAAW,KAAK;AAAA,EAC3D;AAEA,aAAW,IAAI;AACf,IAAE,MAAM;AACR,SAAO,EAAE,MAAM;AACjB;AAGO,SAAS,QAAQ,MAAkB,QAAe,GAAe;AACtE,QAAM,MAAM,WAAW,MAAM,KAAK;AAClC,QAAM,MAAM,IAAI,WAAW,IAAI,SAAS,CAAC;AACzC,MAAI,CAAC,IAAI;AACT,MAAI,CAAC,IAAI;AACT,MAAI,IAAI,KAAK,CAAC;AACd,QAAM,IAAI,QAAQ,IAAI;AACtB,QAAM,IAAI,IAAI,SAAS;AACvB,MAAI,CAAC,IAAI,MAAM;AACf,MAAI,IAAI,CAAC,IAAK,MAAM,KAAM;AAC1B,MAAI,IAAI,CAAC,IAAK,MAAM,IAAK;AACzB,MAAI,IAAI,CAAC,IAAI,IAAI;AACjB,SAAO;AACT;","names":["i"]}