@gilav21/shadcn-angular-rte 0.1.1

package/fesm2022/gilav21-shadcn-angular-rte-inflate-laXxypva.mjs

@@ -0,0 +1,290 @@
+/**
+ * A growable byte buffer with a hard ceiling, for decoders that produce output
+ * of unknown length.
+ *
+ * Every decoder here used to accumulate into a `number[]` and convert at the
+ * end. That representation costs 4-8 bytes per output byte, so a "256 MB"
+ * decompression ceiling let a hostile stream take 1-2 GB of memory before the
+ * guard tripped -- the bomb was stopped after it had done its damage. A typed
+ * array costs one byte per byte, doubles as it grows, and refuses the write
+ * that would cross the ceiling before allocating for it.
+ */
+class ByteSink {
+    /**
+     * @param maxBytes Largest output permitted; a write past it throws. Omit
+     * for no ceiling.
+     * @param initialCapacity Starting allocation, doubled on demand.
+     */
+    constructor(maxBytes = Number.POSITIVE_INFINITY, initialCapacity = 4096) {
+        this.maxBytes = maxBytes;
+        this.size = 0;
+        this.buffer = new Uint8Array(Math.max(16, Math.min(initialCapacity, this.capacityCap())));
+    }
+    /** Bytes written so far. */
+    get length() {
+        return this.size;
+    }
+    /** The byte at `index`, which must already have been written. */
+    at(index) {
+        return this.buffer[index];
+    }
+    push(byte) {
+        this.ensure(1);
+        this.buffer[this.size++] = byte;
+    }
+    pushSlice(bytes) {
+        this.ensure(bytes.length);
+        this.buffer.set(bytes, this.size);
+        this.size += bytes.length;
+    }
+    /**
+     * Append `length` bytes copied from `distance` bytes back -- the DEFLATE
+     * back-reference. Copied one byte at a time on purpose: when `length`
+     * exceeds `distance` the source overlaps the bytes being written, which is
+     * how a run is expressed, and a block copy would read stale data.
+     */
+    copyBack(distance, length) {
+        const start = this.size - distance;
+        if (start < 0)
+            throw new Error('Invalid back-reference distance');
+        this.ensure(length);
+        for (let i = 0; i < length; i++) {
+            this.buffer[this.size + i] = this.buffer[start + i];
+        }
+        this.size += length;
+    }
+    /** The bytes written, as an exact-length view over a fresh array. */
+    toUint8Array() {
+        return this.buffer.slice(0, this.size);
+    }
+    capacityCap() {
+        return Number.isFinite(this.maxBytes) ? this.maxBytes : Number.MAX_SAFE_INTEGER;
+    }
+    ensure(extra) {
+        const needed = this.size + extra;
+        if (needed > this.maxBytes) {
+            throw new Error(`Decompressed data exceeds the maximum allowed size of ${this.maxBytes} bytes`);
+        }
+        if (needed <= this.buffer.length)
+            return;
+        let capacity = this.buffer.length;
+        while (capacity < needed)
+            capacity *= 2;
+        const grown = new Uint8Array(Math.min(capacity, this.capacityCap()));
+        grown.set(this.buffer.subarray(0, this.size));
+        this.buffer = grown;
+    }
+}
+
+const LENGTH_EXTRA_BITS = [
+    0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0
+];
+const 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
+];
+const DIST_EXTRA_BITS = [
+    0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13
+];
+const 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
+];
+const CL_ORDER = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+class BitReader {
+    constructor(data) {
+        this.pos = 0;
+        this.bitBuf = 0;
+        this.bitCount = 0;
+        this.data = data;
+    }
+    bits(n) {
+        while (this.bitCount < n) {
+            if (this.pos >= this.data.length)
+                throw new Error('Unexpected end of deflate stream');
+            this.bitBuf |= this.data[this.pos++] << this.bitCount;
+            this.bitCount += 8;
+        }
+        const val = this.bitBuf & ((1 << n) - 1);
+        this.bitBuf >>>= n;
+        this.bitCount -= n;
+        return val;
+    }
+    alignByte() {
+        this.bitBuf = 0;
+        this.bitCount = 0;
+    }
+    readByte() {
+        if (this.pos >= this.data.length)
+            throw new Error('Unexpected end of deflate stream');
+        return this.data[this.pos++];
+    }
+    readU16LE() {
+        const lo = this.readByte();
+        const hi = this.readByte();
+        return lo | (hi << 8);
+    }
+}
+function buildHuffmanTable(codeLengths, maxSymbol) {
+    let maxBits = 0;
+    for (let i = 0; i < maxSymbol; i++) {
+        if (codeLengths[i] > maxBits)
+            maxBits = codeLengths[i];
+    }
+    const counts = new Uint16Array(maxBits + 1);
+    for (let i = 0; i < maxSymbol; i++) {
+        if (codeLengths[i])
+            counts[codeLengths[i]]++;
+    }
+    const offsets = new Uint16Array(maxBits + 1);
+    for (let i = 1; i <= maxBits; i++) {
+        offsets[i] = offsets[i - 1] + counts[i - 1];
+    }
+    const symbols = new Uint16Array(offsets[maxBits] + counts[maxBits]);
+    for (let i = 0; i < maxSymbol; i++) {
+        if (codeLengths[i]) {
+            symbols[offsets[codeLengths[i]]++] = i;
+        }
+    }
+    return { counts, symbols };
+}
+function decodeSymbol(reader, table) {
+    let code = 0;
+    let first = 0;
+    let index = 0;
+    for (let len = 1; len < table.counts.length; len++) {
+        code |= reader.bits(1);
+        const count = table.counts[len];
+        if (code < first + count) {
+            return table.symbols[index + (code - first)];
+        }
+        index += count;
+        first = (first + count) << 1;
+        code <<= 1;
+    }
+    throw new Error('Invalid Huffman code');
+}
+function buildFixedLitTable() {
+    const lengths = new Uint8Array(288);
+    for (let i = 0; i <= 143; i++)
+        lengths[i] = 8;
+    for (let i = 144; i <= 255; i++)
+        lengths[i] = 9;
+    for (let i = 256; i <= 279; i++)
+        lengths[i] = 7;
+    for (let i = 280; i <= 287; i++)
+        lengths[i] = 8;
+    return buildHuffmanTable(lengths, 288);
+}
+function buildFixedDistTable() {
+    const lengths = new Uint8Array(32);
+    for (let i = 0; i < 32; i++)
+        lengths[i] = 5;
+    return buildHuffmanTable(lengths, 32);
+}
+const FIXED_LIT_TABLE = buildFixedLitTable();
+const FIXED_DIST_TABLE = buildFixedDistTable();
+function inflateStoredBlock(reader, output) {
+    reader.alignByte();
+    const len = reader.readU16LE();
+    reader.readU16LE();
+    for (let i = 0; i < len; i++) {
+        output.push(reader.readByte());
+    }
+}
+function fillRepeatLengths(allLengths, startIdx, count, value) {
+    let idx = startIdx;
+    for (let r = 0; r < count; r++) {
+        allLengths[idx++] = value;
+    }
+    return idx;
+}
+function decodeLengthSymbol(reader, clTable, allLengths, idx) {
+    const sym = decodeSymbol(reader, clTable);
+    if (sym < 16) {
+        allLengths[idx++] = sym;
+        return idx;
+    }
+    if (sym === 16) {
+        const rep = reader.bits(2) + 3;
+        const prev = idx > 0 ? allLengths[idx - 1] : 0;
+        return fillRepeatLengths(allLengths, idx, rep, prev);
+    }
+    const rep = sym === 17 ? reader.bits(3) + 3 : reader.bits(7) + 11;
+    return fillRepeatLengths(allLengths, idx, rep, 0);
+}
+function buildDynamicTables(reader) {
+    const hlit = reader.bits(5) + 257;
+    const hdist = reader.bits(5) + 1;
+    const hclen = reader.bits(4) + 4;
+    const clLengths = new Uint8Array(19);
+    for (let i = 0; i < hclen; i++) {
+        clLengths[CL_ORDER[i]] = reader.bits(3);
+    }
+    const clTable = buildHuffmanTable(clLengths, 19);
+    const allLengths = new Uint8Array(hlit + hdist);
+    let i = 0;
+    while (i < hlit + hdist) {
+        i = decodeLengthSymbol(reader, clTable, allLengths, i);
+    }
+    const litLengths = allLengths.slice(0, hlit);
+    const distLengths = allLengths.slice(hlit);
+    return {
+        litTable: buildHuffmanTable(litLengths, hlit),
+        distTable: buildHuffmanTable(distLengths, hdist),
+    };
+}
+function inflateCompressedBlock(reader, output, litTable, distTable) {
+    for (;;) {
+        const sym = decodeSymbol(reader, litTable);
+        if (sym === 256)
+            break;
+        if (sym < 256) {
+            output.push(sym);
+            continue;
+        }
+        const lengthIdx = sym - 257;
+        const length = LENGTH_BASE[lengthIdx] + reader.bits(LENGTH_EXTRA_BITS[lengthIdx]);
+        const distSym = decodeSymbol(reader, distTable);
+        const distance = DIST_BASE[distSym] + reader.bits(DIST_EXTRA_BITS[distSym]);
+        output.copyBack(distance, length);
+    }
+}
+function inflate(compressed, options) {
+    const reader = new BitReader(compressed);
+    // A typed sink, not a number[]: at 4-8 bytes per element a "256 MB" ceiling
+    // let a bomb take over a gigabyte before it tripped. The sink refuses the
+    // write that would cross the ceiling before allocating for it.
+    const output = new ByteSink(options?.maxOutputBytes);
+    let finalBlock = false;
+    while (!finalBlock) {
+        finalBlock = reader.bits(1) === 1;
+        const blockType = reader.bits(2);
+        if (blockType === 0) {
+            inflateStoredBlock(reader, output);
+        }
+        else if (blockType === 1) {
+            inflateCompressedBlock(reader, output, FIXED_LIT_TABLE, FIXED_DIST_TABLE);
+        }
+        else if (blockType === 2) {
+            const { litTable, distTable } = buildDynamicTables(reader);
+            inflateCompressedBlock(reader, output, litTable, distTable);
+        }
+        else {
+            throw new Error('Invalid deflate block type');
+        }
+    }
+    return output.toUint8Array();
+}
+function zlibInflate(data, options) {
+    if (data.length < 2)
+        return data;
+    const cmf = data[0];
+    const cm = cmf & 0x0f;
+    if (cm !== 8)
+        return inflate(data, options);
+    return inflate(data.subarray(2), options);
+}
+
+export { ByteSink as B, inflate as i, zlibInflate as z };
+//# sourceMappingURL=gilav21-shadcn-angular-rte-inflate-laXxypva.mjs.map

package/fesm2022/gilav21-shadcn-angular-rte-inflate-laXxypva.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"gilav21-shadcn-angular-rte-inflate-laXxypva.mjs","sources":["../../../packages/rte-package/src/lib/parsers/byte-sink.ts","../../../packages/rte-package/src/lib/parsers/inflate.ts"],"sourcesContent":["/**\n * A growable byte buffer with a hard ceiling, for decoders that produce output\n * of unknown length.\n *\n * Every decoder here used to accumulate into a `number[]` and convert at the\n * end. That representation costs 4-8 bytes per output byte, so a \"256 MB\"\n * decompression ceiling let a hostile stream take 1-2 GB of memory before the\n * guard tripped -- the bomb was stopped after it had done its damage. A typed\n * array costs one byte per byte, doubles as it grows, and refuses the write\n * that would cross the ceiling before allocating for it.\n */\nexport class ByteSink {\n    private buffer: Uint8Array;\n    private size = 0;\n\n    /**\n     * @param maxBytes Largest output permitted; a write past it throws. Omit\n     * for no ceiling.\n     * @param initialCapacity Starting allocation, doubled on demand.\n     */\n    constructor(\n        private readonly maxBytes: number = Number.POSITIVE_INFINITY,\n        initialCapacity = 4096,\n    ) {\n        this.buffer = new Uint8Array(Math.max(16, Math.min(initialCapacity, this.capacityCap())));\n    }\n\n    /** Bytes written so far. */\n    get length(): number {\n        return this.size;\n    }\n\n    /** The byte at `index`, which must already have been written. */\n    at(index: number): number {\n        return this.buffer[index];\n    }\n\n    push(byte: number): void {\n        this.ensure(1);\n        this.buffer[this.size++] = byte;\n    }\n\n    pushSlice(bytes: ArrayLike<number>): void {\n        this.ensure(bytes.length);\n        this.buffer.set(bytes, this.size);\n        this.size += bytes.length;\n    }\n\n    /**\n     * Append `length` bytes copied from `distance` bytes back -- the DEFLATE\n     * back-reference. Copied one byte at a time on purpose: when `length`\n     * exceeds `distance` the source overlaps the bytes being written, which is\n     * how a run is expressed, and a block copy would read stale data.\n     */\n    copyBack(distance: number, length: number): void {\n        const start = this.size - distance;\n        if (start < 0) throw new Error('Invalid back-reference distance');\n        this.ensure(length);\n        for (let i = 0; i < length; i++) {\n            this.buffer[this.size + i] = this.buffer[start + i];\n        }\n        this.size += length;\n    }\n\n    /** The bytes written, as an exact-length view over a fresh array. */\n    toUint8Array(): Uint8Array {\n        return this.buffer.slice(0, this.size);\n    }\n\n    private capacityCap(): number {\n        return Number.isFinite(this.maxBytes) ? this.maxBytes : Number.MAX_SAFE_INTEGER;\n    }\n\n    private ensure(extra: number): void {\n        const needed = this.size + extra;\n        if (needed > this.maxBytes) {\n            throw new Error(\n                `Decompressed data exceeds the maximum allowed size of ${this.maxBytes} bytes`,\n            );\n        }\n        if (needed <= this.buffer.length) return;\n\n        let capacity = this.buffer.length;\n        while (capacity < needed) capacity *= 2;\n        const grown = new Uint8Array(Math.min(capacity, this.capacityCap()));\n        grown.set(this.buffer.subarray(0, this.size));\n        this.buffer = grown;\n    }\n}\n","import { ByteSink } from './byte-sink';\n\nconst LENGTH_EXTRA_BITS = [\n    0,0,0,0,0,0,0,0, 1,1,1,1, 2,2,2,2, 3,3,3,3, 4,4,4,4, 5,5,5,5, 0\n];\nconst LENGTH_BASE = [\n    3,4,5,6,7,8,9,10, 11,13,15,17, 19,23,27,31, 35,43,51,59,\n    67,83,99,115, 131,163,195,227, 258\n];\nconst DIST_EXTRA_BITS = [\n    0,0,0,0, 1,1,2,2, 3,3,4,4, 5,5,6,6, 7,7,8,8, 9,9,10,10, 11,11,12,12, 13,13\n];\nconst DIST_BASE = [\n    1,2,3,4, 5,7,9,13, 17,25,33,49, 65,97,129,193,\n    257,385,513,769, 1025,1537,2049,3073, 4097,6145,8193,12289, 16385,24577\n];\nconst CL_ORDER = [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];\n\nclass BitReader {\n    private readonly data: Uint8Array;\n    private pos = 0;\n    private bitBuf = 0;\n    private bitCount = 0;\n\n    constructor(data: Uint8Array) {\n        this.data = data;\n    }\n\n    bits(n: number): number {\n        while (this.bitCount < n) {\n            if (this.pos >= this.data.length) throw new Error('Unexpected end of deflate stream');\n            this.bitBuf |= this.data[this.pos++] << this.bitCount;\n            this.bitCount += 8;\n        }\n        const val = this.bitBuf & ((1 << n) - 1);\n        this.bitBuf >>>= n;\n        this.bitCount -= n;\n        return val;\n    }\n\n    alignByte(): void {\n        this.bitBuf = 0;\n        this.bitCount = 0;\n    }\n\n    readByte(): number {\n        if (this.pos >= this.data.length) throw new Error('Unexpected end of deflate stream');\n        return this.data[this.pos++];\n    }\n\n    readU16LE(): number {\n        const lo = this.readByte();\n        const hi = this.readByte();\n        return lo | (hi << 8);\n    }\n}\n\ninterface HuffmanTable {\n    readonly counts: Uint16Array;\n    readonly symbols: Uint16Array;\n}\n\nfunction buildHuffmanTable(codeLengths: Uint8Array, maxSymbol: number): HuffmanTable {\n    let maxBits = 0;\n    for (let i = 0; i < maxSymbol; i++) {\n        if (codeLengths[i] > maxBits) maxBits = codeLengths[i];\n    }\n    const counts = new Uint16Array(maxBits + 1);\n    for (let i = 0; i < maxSymbol; i++) {\n        if (codeLengths[i]) counts[codeLengths[i]]++;\n    }\n    const offsets = new Uint16Array(maxBits + 1);\n    for (let i = 1; i <= maxBits; i++) {\n        offsets[i] = offsets[i - 1] + counts[i - 1];\n    }\n    const symbols = new Uint16Array(offsets[maxBits] + counts[maxBits]);\n    for (let i = 0; i < maxSymbol; i++) {\n        if (codeLengths[i]) {\n            symbols[offsets[codeLengths[i]]++] = i;\n        }\n    }\n    return { counts, symbols };\n}\n\nfunction decodeSymbol(reader: BitReader, table: HuffmanTable): number {\n    let code = 0;\n    let first = 0;\n    let index = 0;\n    for (let len = 1; len < table.counts.length; len++) {\n        code |= reader.bits(1);\n        const count = table.counts[len];\n        if (code < first + count) {\n            return table.symbols[index + (code - first)];\n        }\n        index += count;\n        first = (first + count) << 1;\n        code <<= 1;\n    }\n    throw new Error('Invalid Huffman code');\n}\n\nfunction buildFixedLitTable(): HuffmanTable {\n    const lengths = new Uint8Array(288);\n    for (let i = 0; i <= 143; i++) lengths[i] = 8;\n    for (let i = 144; i <= 255; i++) lengths[i] = 9;\n    for (let i = 256; i <= 279; i++) lengths[i] = 7;\n    for (let i = 280; i <= 287; i++) lengths[i] = 8;\n    return buildHuffmanTable(lengths, 288);\n}\n\nfunction buildFixedDistTable(): HuffmanTable {\n    const lengths = new Uint8Array(32);\n    for (let i = 0; i < 32; i++) lengths[i] = 5;\n    return buildHuffmanTable(lengths, 32);\n}\n\nconst FIXED_LIT_TABLE = buildFixedLitTable();\nconst FIXED_DIST_TABLE = buildFixedDistTable();\n\n/** Options accepted by {@link inflate} and {@link zlibInflate}. */\nexport interface InflateOptions {\n    /**\n     * Maximum number of bytes the stream may decompress to. Omit for no limit.\n     *\n     * A DEFLATE stream's expansion ratio is unbounded, and a container's\n     * declared uncompressed size is attacker-controlled metadata that says\n     * nothing about what the stream actually produces — so callers handling\n     * untrusted archives must bound the OUTPUT here rather than trust a header.\n     * The ceiling is checked as the output grows, not afterwards, so a\n     * decompression bomb is stopped while it inflates instead of after it has\n     * already exhausted memory.\n     */\n    readonly maxOutputBytes?: number;\n}\n\nfunction inflateStoredBlock(reader: BitReader, output: ByteSink): void {\n    reader.alignByte();\n    const len = reader.readU16LE();\n    reader.readU16LE();\n    for (let i = 0; i < len; i++) {\n        output.push(reader.readByte());\n    }\n}\n\nfunction fillRepeatLengths(allLengths: Uint8Array, startIdx: number, count: number, value: number): number {\n    let idx = startIdx;\n    for (let r = 0; r < count; r++) {\n        allLengths[idx++] = value;\n    }\n    return idx;\n}\n\nfunction decodeLengthSymbol(reader: BitReader, clTable: HuffmanTable, allLengths: Uint8Array, idx: number): number {\n    const sym = decodeSymbol(reader, clTable);\n    if (sym < 16) {\n        allLengths[idx++] = sym;\n        return idx;\n    }\n    if (sym === 16) {\n        const rep = reader.bits(2) + 3;\n        const prev = idx > 0 ? allLengths[idx - 1] : 0;\n        return fillRepeatLengths(allLengths, idx, rep, prev);\n    }\n    const rep = sym === 17 ? reader.bits(3) + 3 : reader.bits(7) + 11;\n    return fillRepeatLengths(allLengths, idx, rep, 0);\n}\n\nfunction buildDynamicTables(reader: BitReader): { litTable: HuffmanTable; distTable: HuffmanTable } {\n    const hlit = reader.bits(5) + 257;\n    const hdist = reader.bits(5) + 1;\n    const hclen = reader.bits(4) + 4;\n    const clLengths = new Uint8Array(19);\n    for (let i = 0; i < hclen; i++) {\n        clLengths[CL_ORDER[i]] = reader.bits(3);\n    }\n    const clTable = buildHuffmanTable(clLengths, 19);\n    const allLengths = new Uint8Array(hlit + hdist);\n    let i = 0;\n    while (i < hlit + hdist) {\n        i = decodeLengthSymbol(reader, clTable, allLengths, i);\n    }\n    const litLengths = allLengths.slice(0, hlit);\n    const distLengths = allLengths.slice(hlit);\n    return {\n        litTable: buildHuffmanTable(litLengths, hlit),\n        distTable: buildHuffmanTable(distLengths, hdist),\n    };\n}\n\nfunction inflateCompressedBlock(\n    reader: BitReader,\n    output: ByteSink,\n    litTable: HuffmanTable,\n    distTable: HuffmanTable,\n): void {\n    for (;;) {\n        const sym = decodeSymbol(reader, litTable);\n        if (sym === 256) break;\n        if (sym < 256) {\n            output.push(sym);\n            continue;\n        }\n        const lengthIdx = sym - 257;\n        const length = LENGTH_BASE[lengthIdx] + reader.bits(LENGTH_EXTRA_BITS[lengthIdx]);\n        const distSym = decodeSymbol(reader, distTable);\n        const distance = DIST_BASE[distSym] + reader.bits(DIST_EXTRA_BITS[distSym]);\n        output.copyBack(distance, length);\n    }\n}\n\nexport function inflate(compressed: Uint8Array, options?: InflateOptions): Uint8Array {\n    const reader = new BitReader(compressed);\n    // A typed sink, not a number[]: at 4-8 bytes per element a \"256 MB\" ceiling\n    // let a bomb take over a gigabyte before it tripped. The sink refuses the\n    // write that would cross the ceiling before allocating for it.\n    const output = new ByteSink(options?.maxOutputBytes);\n    let finalBlock = false;\n\n    while (!finalBlock) {\n        finalBlock = reader.bits(1) === 1;\n        const blockType = reader.bits(2);\n\n        if (blockType === 0) {\n            inflateStoredBlock(reader, output);\n        } else if (blockType === 1) {\n            inflateCompressedBlock(reader, output, FIXED_LIT_TABLE, FIXED_DIST_TABLE);\n        } else if (blockType === 2) {\n            const { litTable, distTable } = buildDynamicTables(reader);\n            inflateCompressedBlock(reader, output, litTable, distTable);\n        } else {\n            throw new Error('Invalid deflate block type');\n        }\n    }\n\n    return output.toUint8Array();\n}\n\nexport function zlibInflate(data: Uint8Array, options?: InflateOptions): Uint8Array {\n    if (data.length < 2) return data;\n    const cmf = data[0];\n    const cm = cmf & 0x0f;\n    if (cm !== 8) return inflate(data, options);\n    return inflate(data.subarray(2), options);\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;AAUG;MACU,QAAQ,CAAA;AAIjB;;;;AAIG;AACH,IAAA,WAAA,CACqB,WAAmB,MAAM,CAAC,iBAAiB,EAC5D,eAAe,GAAG,IAAI,EAAA;QADL,IAAA,CAAA,QAAQ,GAAR,QAAQ;QARrB,IAAA,CAAA,IAAI,GAAG,CAAC;QAWZ,IAAI,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC7F;;AAGA,IAAA,IAAI,MAAM,GAAA;QACN,OAAO,IAAI,CAAC,IAAI;IACpB;;AAGA,IAAA,EAAE,CAAC,KAAa,EAAA;AACZ,QAAA,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;IAC7B;AAEA,IAAA,IAAI,CAAC,IAAY,EAAA;AACb,QAAA,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACd,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI;IACnC;AAEA,IAAA,SAAS,CAAC,KAAwB,EAAA;AAC9B,QAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC;AACjC,QAAA,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,MAAM;IAC7B;AAEA;;;;;AAKG;IACH,QAAQ,CAAC,QAAgB,EAAE,MAAc,EAAA;AACrC,QAAA,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,QAAQ;QAClC,IAAI,KAAK,GAAG,CAAC;AAAE,YAAA,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC;AACjE,QAAA,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;AACnB,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;AAC7B,YAAA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;QACvD;AACA,QAAA,IAAI,CAAC,IAAI,IAAI,MAAM;IACvB;;IAGA,YAAY,GAAA;AACR,QAAA,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC;IAC1C;IAEQ,WAAW,GAAA;QACf,OAAO,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,gBAAgB;IACnF;AAEQ,IAAA,MAAM,CAAC,KAAa,EAAA;AACxB,QAAA,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,GAAG,KAAK;AAChC,QAAA,IAAI,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE;YACxB,MAAM,IAAI,KAAK,CACX,CAAA,sDAAA,EAAyD,IAAI,CAAC,QAAQ,CAAA,MAAA,CAAQ,CACjF;QACL;AACA,QAAA,IAAI,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE;AAElC,QAAA,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM;QACjC,OAAO,QAAQ,GAAG,MAAM;YAAE,QAAQ,IAAI,CAAC;AACvC,QAAA,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;AACpE,QAAA,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7C,QAAA,IAAI,CAAC,MAAM,GAAG,KAAK;IACvB;AACH;;ACtFD,MAAM,iBAAiB,GAAG;IACtB,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE;CACjE;AACD,MAAM,WAAW,GAAG;AAChB,IAAA,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,EAAE,EAAE,EAAE,EAAC,EAAE,EAAC,EAAE,EAAC,EAAE,EAAE,EAAE,EAAC,EAAE,EAAC,EAAE,EAAC,EAAE,EAAE,EAAE,EAAC,EAAE,EAAC,EAAE,EAAC,EAAE;AACvD,IAAA,EAAE,EAAC,EAAE,EAAC,EAAE,EAAC,GAAG,EAAE,GAAG,EAAC,GAAG,EAAC,GAAG,EAAC,GAAG,EAAE;CAClC;AACD,MAAM,eAAe,GAAG;IACpB,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC,EAAC,EAAE,EAAC,EAAE,EAAE,EAAE,EAAC,EAAE,EAAC,EAAE,EAAC,EAAE,EAAE,EAAE,EAAC;CAC3E;AACD,MAAM,SAAS,GAAG;AACd,IAAA,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAE,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,EAAE,EAAE,EAAE,EAAC,EAAE,EAAC,EAAE,EAAC,EAAE,EAAE,EAAE,EAAC,EAAE,EAAC,GAAG,EAAC,GAAG;IAC7C,GAAG,EAAC,GAAG,EAAC,GAAG,EAAC,GAAG,EAAE,IAAI,EAAC,IAAI,EAAC,IAAI,EAAC,IAAI,EAAE,IAAI,EAAC,IAAI,EAAC,IAAI,EAAC,KAAK,EAAE,KAAK,EAAC;CACrE;AACD,MAAM,QAAQ,GAAG,CAAC,EAAE,EAAC,EAAE,EAAC,EAAE,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,EAAE,EAAC,CAAC,EAAC,EAAE,EAAC,CAAC,EAAC,EAAE,EAAC,CAAC,EAAC,EAAE,EAAC,CAAC,EAAC,EAAE,EAAC,CAAC,EAAC,EAAE,CAAC;AAEjE,MAAM,SAAS,CAAA;AAMX,IAAA,WAAA,CAAY,IAAgB,EAAA;QAJpB,IAAA,CAAA,GAAG,GAAG,CAAC;QACP,IAAA,CAAA,MAAM,GAAG,CAAC;QACV,IAAA,CAAA,QAAQ,GAAG,CAAC;AAGhB,QAAA,IAAI,CAAC,IAAI,GAAG,IAAI;IACpB;AAEA,IAAA,IAAI,CAAC,CAAS,EAAA;AACV,QAAA,OAAO,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE;YACtB,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM;AAAE,gBAAA,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC;AACrF,YAAA,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,CAAC,QAAQ;AACrD,YAAA,IAAI,CAAC,QAAQ,IAAI,CAAC;QACtB;AACA,QAAA,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACxC,QAAA,IAAI,CAAC,MAAM,MAAM,CAAC;AAClB,QAAA,IAAI,CAAC,QAAQ,IAAI,CAAC;AAClB,QAAA,OAAO,GAAG;IACd;IAEA,SAAS,GAAA;AACL,QAAA,IAAI,CAAC,MAAM,GAAG,CAAC;AACf,QAAA,IAAI,CAAC,QAAQ,GAAG,CAAC;IACrB;IAEA,QAAQ,GAAA;QACJ,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM;AAAE,YAAA,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC;QACrF,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;IAChC;IAEA,SAAS,GAAA;AACL,QAAA,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE;AAC1B,QAAA,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE;AAC1B,QAAA,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACzB;AACH;AAOD,SAAS,iBAAiB,CAAC,WAAuB,EAAE,SAAiB,EAAA;IACjE,IAAI,OAAO,GAAG,CAAC;AACf,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;AAChC,QAAA,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO;AAAE,YAAA,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC;IAC1D;IACA,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,OAAO,GAAG,CAAC,CAAC;AAC3C,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;QAChC,IAAI,WAAW,CAAC,CAAC,CAAC;AAAE,YAAA,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE;IAChD;IACA,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,OAAO,GAAG,CAAC,CAAC;AAC5C,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE;AAC/B,QAAA,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/C;AACA,IAAA,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;AACnE,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;AAChC,QAAA,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE;AAChB,YAAA,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC;QAC1C;IACJ;AACA,IAAA,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE;AAC9B;AAEA,SAAS,YAAY,CAAC,MAAiB,EAAE,KAAmB,EAAA;IACxD,IAAI,IAAI,GAAG,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC;IACb,IAAI,KAAK,GAAG,CAAC;AACb,IAAA,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;AAChD,QAAA,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QACtB,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC;AAC/B,QAAA,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK,EAAE;AACtB,YAAA,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC;QAChD;QACA,KAAK,IAAI,KAAK;QACd,KAAK,GAAG,CAAC,KAAK,GAAG,KAAK,KAAK,CAAC;QAC5B,IAAI,KAAK,CAAC;IACd;AACA,IAAA,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC;AAC3C;AAEA,SAAS,kBAAkB,GAAA;AACvB,IAAA,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;AAAE,QAAA,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;AAAE,QAAA,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;AAAE,QAAA,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;AAAE,QAAA,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;AAC/C,IAAA,OAAO,iBAAiB,CAAC,OAAO,EAAE,GAAG,CAAC;AAC1C;AAEA,SAAS,mBAAmB,GAAA;AACxB,IAAA,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;AAAE,QAAA,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;AAC3C,IAAA,OAAO,iBAAiB,CAAC,OAAO,EAAE,EAAE,CAAC;AACzC;AAEA,MAAM,eAAe,GAAG,kBAAkB,EAAE;AAC5C,MAAM,gBAAgB,GAAG,mBAAmB,EAAE;AAkB9C,SAAS,kBAAkB,CAAC,MAAiB,EAAE,MAAgB,EAAA;IAC3D,MAAM,CAAC,SAAS,EAAE;AAClB,IAAA,MAAM,GAAG,GAAG,MAAM,CAAC,SAAS,EAAE;IAC9B,MAAM,CAAC,SAAS,EAAE;AAClB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAC1B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;IAClC;AACJ;AAEA,SAAS,iBAAiB,CAAC,UAAsB,EAAE,QAAgB,EAAE,KAAa,EAAE,KAAa,EAAA;IAC7F,IAAI,GAAG,GAAG,QAAQ;AAClB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;AAC5B,QAAA,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK;IAC7B;AACA,IAAA,OAAO,GAAG;AACd;AAEA,SAAS,kBAAkB,CAAC,MAAiB,EAAE,OAAqB,EAAE,UAAsB,EAAE,GAAW,EAAA;IACrG,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC;AACzC,IAAA,IAAI,GAAG,GAAG,EAAE,EAAE;AACV,QAAA,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG;AACvB,QAAA,OAAO,GAAG;IACd;AACA,IAAA,IAAI,GAAG,KAAK,EAAE,EAAE;QACZ,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;AAC9B,QAAA,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;QAC9C,OAAO,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC;IACxD;IACA,MAAM,GAAG,GAAG,GAAG,KAAK,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE;IACjE,OAAO,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;AACrD;AAEA,SAAS,kBAAkB,CAAC,MAAiB,EAAA;IACzC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG;IACjC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;IAChC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;AAChC,IAAA,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC;AACpC,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;AAC5B,QAAA,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3C;IACA,MAAM,OAAO,GAAG,iBAAiB,CAAC,SAAS,EAAE,EAAE,CAAC;IAChD,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,IAAI,GAAG,KAAK,CAAC;IAC/C,IAAI,CAAC,GAAG,CAAC;AACT,IAAA,OAAO,CAAC,GAAG,IAAI,GAAG,KAAK,EAAE;QACrB,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC;IAC1D;IACA,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;IAC5C,MAAM,WAAW,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC;IAC1C,OAAO;AACH,QAAA,QAAQ,EAAE,iBAAiB,CAAC,UAAU,EAAE,IAAI,CAAC;AAC7C,QAAA,SAAS,EAAE,iBAAiB,CAAC,WAAW,EAAE,KAAK,CAAC;KACnD;AACL;AAEA,SAAS,sBAAsB,CAC3B,MAAiB,EACjB,MAAgB,EAChB,QAAsB,EACtB,SAAuB,EAAA;AAEvB,IAAA,SAAS;QACL,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,EAAE,QAAQ,CAAC;QAC1C,IAAI,GAAG,KAAK,GAAG;YAAE;AACjB,QAAA,IAAI,GAAG,GAAG,GAAG,EAAE;AACX,YAAA,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;YAChB;QACJ;AACA,QAAA,MAAM,SAAS,GAAG,GAAG,GAAG,GAAG;AAC3B,QAAA,MAAM,MAAM,GAAG,WAAW,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;QACjF,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC;AAC/C,QAAA,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;AAC3E,QAAA,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IACrC;AACJ;AAEM,SAAU,OAAO,CAAC,UAAsB,EAAE,OAAwB,EAAA;AACpE,IAAA,MAAM,MAAM,GAAG,IAAI,SAAS,CAAC,UAAU,CAAC;;;;IAIxC,MAAM,MAAM,GAAG,IAAI,QAAQ,CAAC,OAAO,EAAE,cAAc,CAAC;IACpD,IAAI,UAAU,GAAG,KAAK;IAEtB,OAAO,CAAC,UAAU,EAAE;QAChB,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;QACjC,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AAEhC,QAAA,IAAI,SAAS,KAAK,CAAC,EAAE;AACjB,YAAA,kBAAkB,CAAC,MAAM,EAAE,MAAM,CAAC;QACtC;AAAO,aAAA,IAAI,SAAS,KAAK,CAAC,EAAE;YACxB,sBAAsB,CAAC,MAAM,EAAE,MAAM,EAAE,eAAe,EAAE,gBAAgB,CAAC;QAC7E;AAAO,aAAA,IAAI,SAAS,KAAK,CAAC,EAAE;YACxB,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,kBAAkB,CAAC,MAAM,CAAC;YAC1D,sBAAsB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC;QAC/D;aAAO;AACH,YAAA,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC;QACjD;IACJ;AAEA,IAAA,OAAO,MAAM,CAAC,YAAY,EAAE;AAChC;AAEM,SAAU,WAAW,CAAC,IAAgB,EAAE,OAAwB,EAAA;AAClE,IAAA,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;AAAE,QAAA,OAAO,IAAI;AAChC,IAAA,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC;AACnB,IAAA,MAAM,EAAE,GAAG,GAAG,GAAG,IAAI;IACrB,IAAI,EAAE,KAAK,CAAC;AAAE,QAAA,OAAO,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC;IAC3C,OAAO,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC;AAC7C;;;;"}