chrome-devtools-frontend 1.0.1669021 → 1.0.1672388

package/front_end/third_party/codemirror.next/chunk/markdown.js.map

@@ -1 +1 @@
-{"version":3,"file":"markdown.js","sources":["../node_modules/@lezer/markdown/dist/index.js","../node_modules/@codemirror/lang-markdown/dist/index.js"],"sourcesContent":["import { NodeType, NodeProp, NodeSet, Tree, Parser, parseMixed } from '@lezer/common';\nimport { styleTags, tags, Tag } from '@lezer/highlight';\n\nclass CompositeBlock {\n    static create(type, value, from, parentHash, end) {\n        let hash = (parentHash + (parentHash << 8) + type + (value << 4)) | 0;\n        return new CompositeBlock(type, value, from, hash, end, [], []);\n    }\n    constructor(type, \n    // Used for indentation in list items, markup character in lists\n    value, from, hash, end, children, positions) {\n        this.type = type;\n        this.value = value;\n        this.from = from;\n        this.hash = hash;\n        this.end = end;\n        this.children = children;\n        this.positions = positions;\n        this.hashProp = [[NodeProp.contextHash, hash]];\n    }\n    addChild(child, pos) {\n        if (child.prop(NodeProp.contextHash) != this.hash)\n            child = new Tree(child.type, child.children, child.positions, child.length, this.hashProp);\n        this.children.push(child);\n        this.positions.push(pos);\n    }\n    toTree(nodeSet, end = this.end) {\n        let last = this.children.length - 1;\n        if (last >= 0)\n            end = Math.max(end, this.positions[last] + this.children[last].length + this.from);\n        return new Tree(nodeSet.types[this.type], this.children, this.positions, end - this.from).balance({\n            makeTree: (children, positions, length) => new Tree(NodeType.none, children, positions, length, this.hashProp)\n        });\n    }\n}\nvar Type;\n(function (Type) {\n    Type[Type[\"Document\"] = 1] = \"Document\";\n    Type[Type[\"CodeBlock\"] = 2] = \"CodeBlock\";\n    Type[Type[\"FencedCode\"] = 3] = \"FencedCode\";\n    Type[Type[\"Blockquote\"] = 4] = \"Blockquote\";\n    Type[Type[\"HorizontalRule\"] = 5] = \"HorizontalRule\";\n    Type[Type[\"BulletList\"] = 6] = \"BulletList\";\n    Type[Type[\"OrderedList\"] = 7] = \"OrderedList\";\n    Type[Type[\"ListItem\"] = 8] = \"ListItem\";\n    Type[Type[\"ATXHeading1\"] = 9] = \"ATXHeading1\";\n    Type[Type[\"ATXHeading2\"] = 10] = \"ATXHeading2\";\n    Type[Type[\"ATXHeading3\"] = 11] = \"ATXHeading3\";\n    Type[Type[\"ATXHeading4\"] = 12] = \"ATXHeading4\";\n    Type[Type[\"ATXHeading5\"] = 13] = \"ATXHeading5\";\n    Type[Type[\"ATXHeading6\"] = 14] = \"ATXHeading6\";\n    Type[Type[\"SetextHeading1\"] = 15] = \"SetextHeading1\";\n    Type[Type[\"SetextHeading2\"] = 16] = \"SetextHeading2\";\n    Type[Type[\"HTMLBlock\"] = 17] = \"HTMLBlock\";\n    Type[Type[\"LinkReference\"] = 18] = \"LinkReference\";\n    Type[Type[\"Paragraph\"] = 19] = \"Paragraph\";\n    Type[Type[\"CommentBlock\"] = 20] = \"CommentBlock\";\n    Type[Type[\"ProcessingInstructionBlock\"] = 21] = \"ProcessingInstructionBlock\";\n    // Inline\n    Type[Type[\"Escape\"] = 22] = \"Escape\";\n    Type[Type[\"Entity\"] = 23] = \"Entity\";\n    Type[Type[\"HardBreak\"] = 24] = \"HardBreak\";\n    Type[Type[\"Emphasis\"] = 25] = \"Emphasis\";\n    Type[Type[\"StrongEmphasis\"] = 26] = \"StrongEmphasis\";\n    Type[Type[\"Link\"] = 27] = \"Link\";\n    Type[Type[\"Image\"] = 28] = \"Image\";\n    Type[Type[\"InlineCode\"] = 29] = \"InlineCode\";\n    Type[Type[\"HTMLTag\"] = 30] = \"HTMLTag\";\n    Type[Type[\"Comment\"] = 31] = \"Comment\";\n    Type[Type[\"ProcessingInstruction\"] = 32] = \"ProcessingInstruction\";\n    Type[Type[\"Autolink\"] = 33] = \"Autolink\";\n    // Smaller tokens\n    Type[Type[\"HeaderMark\"] = 34] = \"HeaderMark\";\n    Type[Type[\"QuoteMark\"] = 35] = \"QuoteMark\";\n    Type[Type[\"ListMark\"] = 36] = \"ListMark\";\n    Type[Type[\"LinkMark\"] = 37] = \"LinkMark\";\n    Type[Type[\"EmphasisMark\"] = 38] = \"EmphasisMark\";\n    Type[Type[\"CodeMark\"] = 39] = \"CodeMark\";\n    Type[Type[\"CodeText\"] = 40] = \"CodeText\";\n    Type[Type[\"CodeInfo\"] = 41] = \"CodeInfo\";\n    Type[Type[\"LinkTitle\"] = 42] = \"LinkTitle\";\n    Type[Type[\"LinkLabel\"] = 43] = \"LinkLabel\";\n    Type[Type[\"URL\"] = 44] = \"URL\";\n})(Type || (Type = {}));\n/**\nData structure used to accumulate a block's content during [leaf\nblock parsing](#BlockParser.leaf).\n*/\nclass LeafBlock {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The start position of the block.\n    */\n    start, \n    /**\n    The block's text content.\n    */\n    content) {\n        this.start = start;\n        this.content = content;\n        /**\n        @internal\n        */\n        this.marks = [];\n        /**\n        The block parsers active for this block.\n        */\n        this.parsers = [];\n    }\n}\n/**\nData structure used during block-level per-line parsing.\n*/\nclass Line {\n    constructor() {\n        /**\n        The line's full text.\n        */\n        this.text = \"\";\n        /**\n        The base indent provided by the composite contexts (that have\n        been handled so far).\n        */\n        this.baseIndent = 0;\n        /**\n        The string position corresponding to the base indent.\n        */\n        this.basePos = 0;\n        /**\n        The number of contexts handled @internal\n        */\n        this.depth = 0;\n        /**\n        Any markers (i.e. block quote markers) parsed for the contexts. @internal\n        */\n        this.markers = [];\n        /**\n        The position of the next non-whitespace character beyond any\n        list, blockquote, or other composite block markers.\n        */\n        this.pos = 0;\n        /**\n        The column of the next non-whitespace character.\n        */\n        this.indent = 0;\n        /**\n        The character code of the character after `pos`.\n        */\n        this.next = -1;\n    }\n    /**\n    @internal\n    */\n    forward() {\n        if (this.basePos > this.pos)\n            this.forwardInner();\n    }\n    /**\n    @internal\n    */\n    forwardInner() {\n        let newPos = this.skipSpace(this.basePos);\n        this.indent = this.countIndent(newPos, this.pos, this.indent);\n        this.pos = newPos;\n        this.next = newPos == this.text.length ? -1 : this.text.charCodeAt(newPos);\n    }\n    /**\n    Skip whitespace after the given position, return the position of\n    the next non-space character or the end of the line if there's\n    only space after `from`.\n    */\n    skipSpace(from) { return skipSpace(this.text, from); }\n    /**\n    @internal\n    */\n    reset(text) {\n        this.text = text;\n        this.baseIndent = this.basePos = this.pos = this.indent = 0;\n        this.forwardInner();\n        this.depth = 1;\n        while (this.markers.length)\n            this.markers.pop();\n    }\n    /**\n    Move the line's base position forward to the given position.\n    This should only be called by composite [block\n    parsers](#BlockParser.parse) or [markup skipping\n    functions](#NodeSpec.composite).\n    */\n    moveBase(to) {\n        this.basePos = to;\n        this.baseIndent = this.countIndent(to, this.pos, this.indent);\n    }\n    /**\n    Move the line's base position forward to the given _column_.\n    */\n    moveBaseColumn(indent) {\n        this.baseIndent = indent;\n        this.basePos = this.findColumn(indent);\n    }\n    /**\n    Store a composite-block-level marker. Should be called from\n    [markup skipping functions](#NodeSpec.composite) when they\n    consume any non-whitespace characters.\n    */\n    addMarker(elt) {\n        this.markers.push(elt);\n    }\n    /**\n    Find the column position at `to`, optionally starting at a given\n    position and column.\n    */\n    countIndent(to, from = 0, indent = 0) {\n        for (let i = from; i < to; i++)\n            indent += this.text.charCodeAt(i) == 9 ? 4 - indent % 4 : 1;\n        return indent;\n    }\n    /**\n    Find the position corresponding to the given column.\n    */\n    findColumn(goal) {\n        let i = 0;\n        for (let indent = 0; i < this.text.length && indent < goal; i++)\n            indent += this.text.charCodeAt(i) == 9 ? 4 - indent % 4 : 1;\n        return i;\n    }\n    /**\n    @internal\n    */\n    scrub() {\n        if (!this.baseIndent)\n            return this.text;\n        let result = \"\";\n        for (let i = 0; i < this.basePos; i++)\n            result += \" \";\n        return result + this.text.slice(this.basePos);\n    }\n}\nfunction skipForList(bl, cx, line) {\n    if (line.pos == line.text.length ||\n        (bl != cx.block && line.indent >= cx.stack[line.depth + 1].value + line.baseIndent))\n        return true;\n    if (line.indent >= line.baseIndent + 4)\n        return false;\n    let size = (bl.type == Type.OrderedList ? isOrderedList : isBulletList)(line, cx, false);\n    return size > 0 &&\n        (bl.type != Type.BulletList || isHorizontalRule(line, cx, false) < 0) &&\n        line.text.charCodeAt(line.pos + size - 1) == bl.value;\n}\nconst DefaultSkipMarkup = {\n    [Type.Blockquote](bl, cx, line) {\n        if (line.next != 62 /* '>' */)\n            return false;\n        line.markers.push(elt(Type.QuoteMark, cx.lineStart + line.pos, cx.lineStart + line.pos + 1));\n        line.moveBase(line.pos + (space(line.text.charCodeAt(line.pos + 1)) ? 2 : 1));\n        bl.end = cx.lineStart + line.text.length;\n        return true;\n    },\n    [Type.ListItem](bl, _cx, line) {\n        if (line.indent < line.baseIndent + bl.value && line.next > -1)\n            return false;\n        line.moveBaseColumn(line.baseIndent + bl.value);\n        return true;\n    },\n    [Type.OrderedList]: skipForList,\n    [Type.BulletList]: skipForList,\n    [Type.Document]() { return true; }\n};\nfunction space(ch) { return ch == 32 || ch == 9 || ch == 10 || ch == 13; }\nfunction skipSpace(line, i = 0) {\n    while (i < line.length && space(line.charCodeAt(i)))\n        i++;\n    return i;\n}\nfunction skipSpaceBack(line, i, to) {\n    while (i > to && space(line.charCodeAt(i - 1)))\n        i--;\n    return i;\n}\nfunction isFencedCode(line) {\n    if (line.next != 96 && line.next != 126 /* '`~' */)\n        return -1;\n    let pos = line.pos + 1;\n    while (pos < line.text.length && line.text.charCodeAt(pos) == line.next)\n        pos++;\n    if (pos < line.pos + 3)\n        return -1;\n    if (line.next == 96)\n        for (let i = pos; i < line.text.length; i++)\n            if (line.text.charCodeAt(i) == 96)\n                return -1;\n    return pos;\n}\nfunction isBlockquote(line) {\n    return line.next != 62 /* '>' */ ? -1 : line.text.charCodeAt(line.pos + 1) == 32 ? 2 : 1;\n}\nfunction isHorizontalRule(line, cx, breaking) {\n    if (line.next != 42 && line.next != 45 && line.next != 95 /* '_-*' */)\n        return -1;\n    let count = 1;\n    for (let pos = line.pos + 1; pos < line.text.length; pos++) {\n        let ch = line.text.charCodeAt(pos);\n        if (ch == line.next)\n            count++;\n        else if (!space(ch))\n            return -1;\n    }\n    // Setext headers take precedence\n    if (breaking && line.next == 45 && isSetextUnderline(line) > -1 && line.depth == cx.stack.length &&\n        cx.parser.leafBlockParsers.indexOf(DefaultLeafBlocks.SetextHeading) > -1)\n        return -1;\n    return count < 3 ? -1 : 1;\n}\nfunction inList(cx, type) {\n    for (let i = cx.stack.length - 1; i >= 0; i--)\n        if (cx.stack[i].type == type)\n            return true;\n    return false;\n}\nfunction isBulletList(line, cx, breaking) {\n    return (line.next == 45 || line.next == 43 || line.next == 42 /* '-+*' */) &&\n        (line.pos == line.text.length - 1 || space(line.text.charCodeAt(line.pos + 1))) &&\n        (!breaking || inList(cx, Type.BulletList) || line.skipSpace(line.pos + 2) < line.text.length) ? 1 : -1;\n}\nfunction isOrderedList(line, cx, breaking) {\n    let pos = line.pos, next = line.next;\n    for (;;) {\n        if (next >= 48 && next <= 57 /* '0-9' */)\n            pos++;\n        else\n            break;\n        if (pos == line.text.length)\n            return -1;\n        next = line.text.charCodeAt(pos);\n    }\n    if (pos == line.pos || pos > line.pos + 9 ||\n        (next != 46 && next != 41 /* '.)' */) ||\n        (pos < line.text.length - 1 && !space(line.text.charCodeAt(pos + 1))) ||\n        breaking && !inList(cx, Type.OrderedList) &&\n            (line.skipSpace(pos + 1) == line.text.length || pos > line.pos + 1 || line.next != 49 /* '1' */))\n        return -1;\n    return pos + 1 - line.pos;\n}\nfunction isAtxHeading(line) {\n    if (line.next != 35 /* '#' */)\n        return -1;\n    let pos = line.pos + 1;\n    while (pos < line.text.length && line.text.charCodeAt(pos) == 35)\n        pos++;\n    if (pos < line.text.length && line.text.charCodeAt(pos) != 32)\n        return -1;\n    let size = pos - line.pos;\n    return size > 6 ? -1 : size;\n}\nfunction isSetextUnderline(line) {\n    if (line.next != 45 && line.next != 61 /* '-=' */ || line.indent >= line.baseIndent + 4)\n        return -1;\n    let pos = line.pos + 1;\n    while (pos < line.text.length && line.text.charCodeAt(pos) == line.next)\n        pos++;\n    let end = pos;\n    while (pos < line.text.length && space(line.text.charCodeAt(pos)))\n        pos++;\n    return pos == line.text.length ? end : -1;\n}\nconst EmptyLine = /^[ \\t]*$/, CommentEnd = /-->/, ProcessingEnd = /\\?>/;\nconst HTMLBlockStyle = [\n    [/^<(?:script|pre|style)(?:\\s|>|$)/i, /<\\/(?:script|pre|style)>/i],\n    [/^\\s*<!--/, CommentEnd],\n    [/^\\s*<\\?/, ProcessingEnd],\n    [/^\\s*<![A-Z]/, />/],\n    [/^\\s*<!\\[CDATA\\[/, /\\]\\]>/],\n    [/^\\s*<\\/?(?:address|article|aside|base|basefont|blockquote|body|caption|center|col|colgroup|dd|details|dialog|dir|div|dl|dt|fieldset|figcaption|figure|footer|form|frame|frameset|h1|h2|h3|h4|h5|h6|head|header|hr|html|iframe|legend|li|link|main|menu|menuitem|nav|noframes|ol|optgroup|option|p|param|section|source|summary|table|tbody|td|tfoot|th|thead|title|tr|track|ul)(?:\\s|\\/?>|$)/i, EmptyLine],\n    [/^\\s*(?:<\\/[a-z][\\w-]*\\s*>|<[a-z][\\w-]*(\\s+[a-z:_][\\w-.]*(?:\\s*=\\s*(?:[^\\s\"'=<>`]+|'[^']*'|\"[^\"]*\"))?)*\\s*>)\\s*$/i, EmptyLine]\n];\nfunction isHTMLBlock(line, _cx, breaking) {\n    if (line.next != 60 /* '<' */)\n        return -1;\n    let rest = line.text.slice(line.pos);\n    for (let i = 0, e = HTMLBlockStyle.length - (breaking ? 1 : 0); i < e; i++)\n        if (HTMLBlockStyle[i][0].test(rest))\n            return i;\n    return -1;\n}\nfunction getListIndent(line, pos) {\n    let indentAfter = line.countIndent(pos, line.pos, line.indent);\n    let indented = line.countIndent(line.skipSpace(pos), pos, indentAfter);\n    return indented >= indentAfter + 5 ? indentAfter + 1 : indented;\n}\nfunction addCodeText(marks, from, to) {\n    let last = marks.length - 1;\n    if (last >= 0 && marks[last].to == from && marks[last].type == Type.CodeText)\n        marks[last].to = to;\n    else\n        marks.push(elt(Type.CodeText, from, to));\n}\n// Rules for parsing blocks. A return value of false means the rule\n// doesn't apply here, true means it does. When true is returned and\n// `p.line` has been updated, the rule is assumed to have consumed a\n// leaf block. Otherwise, it is assumed to have opened a context.\nconst DefaultBlockParsers = {\n    LinkReference: undefined,\n    IndentedCode(cx, line) {\n        let base = line.baseIndent + 4;\n        if (line.indent < base)\n            return false;\n        let start = line.findColumn(base);\n        let from = cx.lineStart + start, to = cx.lineStart + line.text.length;\n        let marks = [], pendingMarks = [];\n        addCodeText(marks, from, to);\n        while (cx.nextLine() && line.depth >= cx.stack.length) {\n            if (line.pos == line.text.length) { // Empty\n                addCodeText(pendingMarks, cx.lineStart - 1, cx.lineStart);\n                for (let m of line.markers)\n                    pendingMarks.push(m);\n            }\n            else if (line.indent < base) {\n                break;\n            }\n            else {\n                if (pendingMarks.length) {\n                    for (let m of pendingMarks) {\n                        if (m.type == Type.CodeText)\n                            addCodeText(marks, m.from, m.to);\n                        else\n                            marks.push(m);\n                    }\n                    pendingMarks = [];\n                }\n                addCodeText(marks, cx.lineStart - 1, cx.lineStart);\n                for (let m of line.markers)\n                    marks.push(m);\n                to = cx.lineStart + line.text.length;\n                let codeStart = cx.lineStart + line.findColumn(line.baseIndent + 4);\n                if (codeStart < to)\n                    addCodeText(marks, codeStart, to);\n            }\n        }\n        if (pendingMarks.length) {\n            pendingMarks = pendingMarks.filter(m => m.type != Type.CodeText);\n            if (pendingMarks.length)\n                line.markers = pendingMarks.concat(line.markers);\n        }\n        cx.addNode(cx.buffer.writeElements(marks, -from).finish(Type.CodeBlock, to - from), from);\n        return true;\n    },\n    FencedCode(cx, line) {\n        let fenceEnd = isFencedCode(line);\n        if (fenceEnd < 0)\n            return false;\n        let from = cx.lineStart + line.pos, ch = line.next, len = fenceEnd - line.pos;\n        let infoFrom = line.skipSpace(fenceEnd), infoTo = skipSpaceBack(line.text, line.text.length, infoFrom);\n        let marks = [elt(Type.CodeMark, from, from + len)];\n        if (infoFrom < infoTo)\n            marks.push(elt(Type.CodeInfo, cx.lineStart + infoFrom, cx.lineStart + infoTo));\n        for (let first = true; cx.nextLine() && line.depth >= cx.stack.length; first = false) {\n            let i = line.pos;\n            if (line.indent - line.baseIndent < 4)\n                while (i < line.text.length && line.text.charCodeAt(i) == ch)\n                    i++;\n            if (i - line.pos >= len && line.skipSpace(i) == line.text.length) {\n                for (let m of line.markers)\n                    marks.push(m);\n                marks.push(elt(Type.CodeMark, cx.lineStart + line.pos, cx.lineStart + i));\n                cx.nextLine();\n                break;\n            }\n            else {\n                if (!first)\n                    addCodeText(marks, cx.lineStart - 1, cx.lineStart);\n                for (let m of line.markers)\n                    marks.push(m);\n                let textStart = cx.lineStart + line.basePos, textEnd = cx.lineStart + line.text.length;\n                if (textStart < textEnd)\n                    addCodeText(marks, textStart, textEnd);\n            }\n        }\n        cx.addNode(cx.buffer.writeElements(marks, -from)\n            .finish(Type.FencedCode, cx.prevLineEnd() - from), from);\n        return true;\n    },\n    Blockquote(cx, line) {\n        let size = isBlockquote(line);\n        if (size < 0)\n            return false;\n        cx.startContext(Type.Blockquote, line.pos);\n        cx.addNode(Type.QuoteMark, cx.lineStart + line.pos, cx.lineStart + line.pos + 1);\n        line.moveBase(line.pos + size);\n        return null;\n    },\n    HorizontalRule(cx, line) {\n        if (isHorizontalRule(line, cx, false) < 0)\n            return false;\n        let from = cx.lineStart + line.pos;\n        cx.nextLine();\n        cx.addNode(Type.HorizontalRule, from);\n        return true;\n    },\n    BulletList(cx, line) {\n        let size = isBulletList(line, cx, false);\n        if (size < 0)\n            return false;\n        if (cx.block.type != Type.BulletList)\n            cx.startContext(Type.BulletList, line.basePos, line.next);\n        let newBase = getListIndent(line, line.pos + 1);\n        cx.startContext(Type.ListItem, line.basePos, newBase - line.baseIndent);\n        cx.addNode(Type.ListMark, cx.lineStart + line.pos, cx.lineStart + line.pos + size);\n        line.moveBaseColumn(newBase);\n        return null;\n    },\n    OrderedList(cx, line) {\n        let size = isOrderedList(line, cx, false);\n        if (size < 0)\n            return false;\n        if (cx.block.type != Type.OrderedList)\n            cx.startContext(Type.OrderedList, line.basePos, line.text.charCodeAt(line.pos + size - 1));\n        let newBase = getListIndent(line, line.pos + size);\n        cx.startContext(Type.ListItem, line.basePos, newBase - line.baseIndent);\n        cx.addNode(Type.ListMark, cx.lineStart + line.pos, cx.lineStart + line.pos + size);\n        line.moveBaseColumn(newBase);\n        return null;\n    },\n    ATXHeading(cx, line) {\n        let size = isAtxHeading(line);\n        if (size < 0)\n            return false;\n        let off = line.pos, from = cx.lineStart + off;\n        let endOfSpace = skipSpaceBack(line.text, line.text.length, off), after = endOfSpace;\n        while (after > off && line.text.charCodeAt(after - 1) == line.next)\n            after--;\n        if (after == endOfSpace || after == off || !space(line.text.charCodeAt(after - 1)))\n            after = line.text.length;\n        let buf = cx.buffer\n            .write(Type.HeaderMark, 0, size)\n            .writeElements(cx.parser.parseInline(line.text.slice(off + size + 1, after), from + size + 1), -from);\n        if (after < line.text.length)\n            buf.write(Type.HeaderMark, after - off, endOfSpace - off);\n        let node = buf.finish(Type.ATXHeading1 - 1 + size, line.text.length - off);\n        cx.nextLine();\n        cx.addNode(node, from);\n        return true;\n    },\n    HTMLBlock(cx, line) {\n        let type = isHTMLBlock(line, cx, false);\n        if (type < 0)\n            return false;\n        let from = cx.lineStart + line.pos, end = HTMLBlockStyle[type][1];\n        let marks = [], trailing = end != EmptyLine;\n        while (!end.test(line.text) && cx.nextLine()) {\n            if (line.depth < cx.stack.length) {\n                trailing = false;\n                break;\n            }\n            for (let m of line.markers)\n                marks.push(m);\n        }\n        if (trailing)\n            cx.nextLine();\n        let nodeType = end == CommentEnd ? Type.CommentBlock : end == ProcessingEnd ? Type.ProcessingInstructionBlock : Type.HTMLBlock;\n        let to = cx.prevLineEnd();\n        cx.addNode(cx.buffer.writeElements(marks, -from).finish(nodeType, to - from), from);\n        return true;\n    },\n    SetextHeading: undefined // Specifies relative precedence for block-continue function\n};\n// This implements a state machine that incrementally parses link references. At each\n// next line, it looks ahead to see if the line continues the reference or not. If it\n// doesn't and a valid link is available ending before that line, it finishes that.\n// Similarly, on `finish` (when the leaf is terminated by external circumstances), it\n// creates a link reference if there's a valid reference up to the current point.\nclass LinkReferenceParser {\n    constructor(leaf) {\n        this.stage = 0 /* RefStage.Start */;\n        this.elts = [];\n        this.pos = 0;\n        this.start = leaf.start;\n        this.advance(leaf.content);\n    }\n    nextLine(cx, line, leaf) {\n        if (this.stage == -1 /* RefStage.Failed */)\n            return false;\n        let content = leaf.content + \"\\n\" + line.scrub();\n        let finish = this.advance(content);\n        if (finish > -1 && finish < content.length)\n            return this.complete(cx, leaf, finish);\n        return false;\n    }\n    finish(cx, leaf) {\n        if ((this.stage == 2 /* RefStage.Link */ || this.stage == 3 /* RefStage.Title */) && skipSpace(leaf.content, this.pos) == leaf.content.length)\n            return this.complete(cx, leaf, leaf.content.length);\n        return false;\n    }\n    complete(cx, leaf, len) {\n        cx.addLeafElement(leaf, elt(Type.LinkReference, this.start, this.start + len, this.elts));\n        return true;\n    }\n    nextStage(elt) {\n        if (elt) {\n            this.pos = elt.to - this.start;\n            this.elts.push(elt);\n            this.stage++;\n            return true;\n        }\n        if (elt === false)\n            this.stage = -1 /* RefStage.Failed */;\n        return false;\n    }\n    advance(content) {\n        for (;;) {\n            if (this.stage == -1 /* RefStage.Failed */) {\n                return -1;\n            }\n            else if (this.stage == 0 /* RefStage.Start */) {\n                if (!this.nextStage(parseLinkLabel(content, this.pos, this.start, true)))\n                    return -1;\n                if (content.charCodeAt(this.pos) != 58 /* ':' */)\n                    return this.stage = -1 /* RefStage.Failed */;\n                this.elts.push(elt(Type.LinkMark, this.pos + this.start, this.pos + this.start + 1));\n                this.pos++;\n            }\n            else if (this.stage == 1 /* RefStage.Label */) {\n                if (!this.nextStage(parseURL(content, skipSpace(content, this.pos), this.start)))\n                    return -1;\n            }\n            else if (this.stage == 2 /* RefStage.Link */) {\n                let skip = skipSpace(content, this.pos), end = 0;\n                if (skip > this.pos) {\n                    let title = parseLinkTitle(content, skip, this.start);\n                    if (title) {\n                        let titleEnd = lineEnd(content, title.to - this.start);\n                        if (titleEnd > 0) {\n                            this.nextStage(title);\n                            end = titleEnd;\n                        }\n                    }\n                }\n                if (!end)\n                    end = lineEnd(content, this.pos);\n                return end > 0 && end < content.length ? end : -1;\n            }\n            else { // RefStage.Title\n                return lineEnd(content, this.pos);\n            }\n        }\n    }\n}\nfunction lineEnd(text, pos) {\n    for (; pos < text.length; pos++) {\n        let next = text.charCodeAt(pos);\n        if (next == 10)\n            break;\n        if (!space(next))\n            return -1;\n    }\n    return pos;\n}\nclass SetextHeadingParser {\n    nextLine(cx, line, leaf) {\n        let underline = line.depth < cx.stack.length ? -1 : isSetextUnderline(line);\n        let next = line.next;\n        if (underline < 0)\n            return false;\n        let underlineMark = elt(Type.HeaderMark, cx.lineStart + line.pos, cx.lineStart + underline);\n        cx.nextLine();\n        cx.addLeafElement(leaf, elt(next == 61 ? Type.SetextHeading1 : Type.SetextHeading2, leaf.start, cx.prevLineEnd(), [\n            ...cx.parser.parseInline(leaf.content, leaf.start),\n            underlineMark\n        ]));\n        return true;\n    }\n    finish() {\n        return false;\n    }\n}\nconst DefaultLeafBlocks = {\n    LinkReference(_, leaf) { return leaf.content.charCodeAt(0) == 91 /* '[' */ ? new LinkReferenceParser(leaf) : null; },\n    SetextHeading() { return new SetextHeadingParser; }\n};\nconst DefaultEndLeaf = [\n    (_, line) => isAtxHeading(line) >= 0,\n    (_, line) => isFencedCode(line) >= 0,\n    (_, line) => isBlockquote(line) >= 0,\n    (p, line) => isBulletList(line, p, true) >= 0,\n    (p, line) => isOrderedList(line, p, true) >= 0,\n    (p, line) => isHorizontalRule(line, p, true) >= 0,\n    (p, line) => isHTMLBlock(line, p, true) >= 0\n];\nconst scanLineResult = { text: \"\", end: 0 };\n/**\nBlock-level parsing functions get access to this context object.\n*/\nclass BlockContext {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The parser configuration used.\n    */\n    parser, \n    /**\n    @internal\n    */\n    input, fragments, \n    /**\n    @internal\n    */\n    ranges) {\n        this.parser = parser;\n        this.input = input;\n        this.ranges = ranges;\n        this.line = new Line();\n        this.atEnd = false;\n        /**\n        For reused nodes on gaps, we can't directly put the original\n        node into the tree, since that may be bigger than its parent.\n        When this happens, we create a dummy tree that is replaced by\n        the proper node in `injectGaps` @internal\n        */\n        this.reusePlaceholders = new Map;\n        this.stoppedAt = null;\n        /**\n        The range index that absoluteLineStart points into @internal\n        */\n        this.rangeI = 0;\n        this.to = ranges[ranges.length - 1].to;\n        this.lineStart = this.absoluteLineStart = this.absoluteLineEnd = ranges[0].from;\n        this.block = CompositeBlock.create(Type.Document, 0, this.lineStart, 0, 0);\n        this.stack = [this.block];\n        this.fragments = fragments.length ? new FragmentCursor(fragments, input) : null;\n        this.readLine();\n    }\n    get parsedPos() {\n        return this.absoluteLineStart;\n    }\n    advance() {\n        if (this.stoppedAt != null && this.absoluteLineStart > this.stoppedAt)\n            return this.finish();\n        let { line } = this;\n        for (;;) {\n            for (let markI = 0;;) {\n                let next = line.depth < this.stack.length ? this.stack[this.stack.length - 1] : null;\n                while (markI < line.markers.length && (!next || line.markers[markI].from < next.end)) {\n                    let mark = line.markers[markI++];\n                    this.addNode(mark.type, mark.from, mark.to);\n                }\n                if (!next)\n                    break;\n                this.finishContext();\n            }\n            if (line.pos < line.text.length)\n                break;\n            // Empty line\n            if (!this.nextLine())\n                return this.finish();\n        }\n        if (this.fragments && this.reuseFragment(line.basePos))\n            return null;\n        start: for (;;) {\n            for (let type of this.parser.blockParsers)\n                if (type) {\n                    let result = type(this, line);\n                    if (result != false) {\n                        if (result == true)\n                            return null;\n                        line.forward();\n                        continue start;\n                    }\n                }\n            break;\n        }\n        let leaf = new LeafBlock(this.lineStart + line.pos, line.text.slice(line.pos));\n        for (let parse of this.parser.leafBlockParsers)\n            if (parse) {\n                let parser = parse(this, leaf);\n                if (parser)\n                    leaf.parsers.push(parser);\n            }\n        lines: while (this.nextLine()) {\n            if (line.pos == line.text.length)\n                break;\n            if (line.indent < line.baseIndent + 4) {\n                for (let stop of this.parser.endLeafBlock)\n                    if (stop(this, line, leaf))\n                        break lines;\n            }\n            for (let parser of leaf.parsers)\n                if (parser.nextLine(this, line, leaf))\n                    return null;\n            leaf.content += \"\\n\" + line.scrub();\n            for (let m of line.markers)\n                leaf.marks.push(m);\n        }\n        this.finishLeaf(leaf);\n        return null;\n    }\n    stopAt(pos) {\n        if (this.stoppedAt != null && this.stoppedAt < pos)\n            throw new RangeError(\"Can't move stoppedAt forward\");\n        this.stoppedAt = pos;\n    }\n    reuseFragment(start) {\n        if (!this.fragments.moveTo(this.absoluteLineStart + start, this.absoluteLineStart) ||\n            !this.fragments.matches(this.block.hash))\n            return false;\n        let taken = this.fragments.takeNodes(this);\n        if (!taken)\n            return false;\n        this.absoluteLineStart += taken;\n        this.lineStart = toRelative(this.absoluteLineStart, this.ranges);\n        this.moveRangeI();\n        if (this.absoluteLineStart < this.to) {\n            this.lineStart++;\n            this.absoluteLineStart++;\n            this.readLine();\n        }\n        else {\n            this.atEnd = true;\n            this.readLine();\n        }\n        return true;\n    }\n    /**\n    The number of parent blocks surrounding the current block.\n    */\n    get depth() {\n        return this.stack.length;\n    }\n    /**\n    Get the type of the parent block at the given depth. When no\n    depth is passed, return the type of the innermost parent.\n    */\n    parentType(depth = this.depth - 1) {\n        return this.parser.nodeSet.types[this.stack[depth].type];\n    }\n    /**\n    Move to the next input line. This should only be called by\n    (non-composite) [block parsers](#BlockParser.parse) that consume\n    the line directly, or leaf block parser\n    [`nextLine`](#LeafBlockParser.nextLine) methods when they\n    consume the current line (and return true).\n    */\n    nextLine() {\n        this.lineStart += this.line.text.length;\n        if (this.absoluteLineEnd >= this.to) {\n            this.absoluteLineStart = this.absoluteLineEnd;\n            this.atEnd = true;\n            this.readLine();\n            return false;\n        }\n        else {\n            this.lineStart++;\n            this.absoluteLineStart = this.absoluteLineEnd + 1;\n            this.moveRangeI();\n            this.readLine();\n            return true;\n        }\n    }\n    /**\n    Retrieve the text of the line after the current one, without\n    actually moving the context's current line forward.\n    */\n    peekLine() {\n        return this.scanLine(this.absoluteLineEnd + 1).text;\n    }\n    moveRangeI() {\n        while (this.rangeI < this.ranges.length - 1 && this.absoluteLineStart >= this.ranges[this.rangeI].to) {\n            this.rangeI++;\n            this.absoluteLineStart = Math.max(this.absoluteLineStart, this.ranges[this.rangeI].from);\n        }\n    }\n    /**\n    @internal\n    Collect the text for the next line.\n    */\n    scanLine(start) {\n        let r = scanLineResult;\n        r.end = start;\n        if (start >= this.to) {\n            r.text = \"\";\n        }\n        else {\n            r.text = this.lineChunkAt(start);\n            r.end += r.text.length;\n            if (this.ranges.length > 1) {\n                let textOffset = this.absoluteLineStart, rangeI = this.rangeI;\n                while (this.ranges[rangeI].to < r.end) {\n                    rangeI++;\n                    let nextFrom = this.ranges[rangeI].from;\n                    let after = this.lineChunkAt(nextFrom);\n                    r.end = nextFrom + after.length;\n                    r.text = r.text.slice(0, this.ranges[rangeI - 1].to - textOffset) + after;\n                    textOffset = r.end - r.text.length;\n                }\n            }\n        }\n        return r;\n    }\n    /**\n    @internal\n    Populate this.line with the content of the next line. Skip\n    leading characters covered by composite blocks.\n    */\n    readLine() {\n        let { line } = this, { text, end } = this.scanLine(this.absoluteLineStart);\n        this.absoluteLineEnd = end;\n        line.reset(text);\n        for (; line.depth < this.stack.length; line.depth++) {\n            let cx = this.stack[line.depth], handler = this.parser.skipContextMarkup[cx.type];\n            if (!handler)\n                throw new Error(\"Unhandled block context \" + Type[cx.type]);\n            if (!handler(cx, this, line))\n                break;\n            line.forward();\n        }\n    }\n    lineChunkAt(pos) {\n        let next = this.input.chunk(pos), text;\n        if (!this.input.lineChunks) {\n            let eol = next.indexOf(\"\\n\");\n            text = eol < 0 ? next : next.slice(0, eol);\n        }\n        else {\n            text = next == \"\\n\" ? \"\" : next;\n        }\n        return pos + text.length > this.to ? text.slice(0, this.to - pos) : text;\n    }\n    /**\n    The end position of the previous line.\n    */\n    prevLineEnd() { return this.atEnd ? this.lineStart : this.lineStart - 1; }\n    /**\n    @internal\n    */\n    startContext(type, start, value = 0) {\n        this.block = CompositeBlock.create(type, value, this.lineStart + start, this.block.hash, this.lineStart + this.line.text.length);\n        this.stack.push(this.block);\n    }\n    /**\n    Start a composite block. Should only be called from [block\n    parser functions](#BlockParser.parse) that return null.\n    */\n    startComposite(type, start, value = 0) {\n        this.startContext(this.parser.getNodeType(type), start, value);\n    }\n    /**\n    @internal\n    */\n    addNode(block, from, to) {\n        if (typeof block == \"number\")\n            block = new Tree(this.parser.nodeSet.types[block], none, none, (to !== null && to !== void 0 ? to : this.prevLineEnd()) - from);\n        this.block.addChild(block, from - this.block.from);\n    }\n    /**\n    Add a block element. Can be called by [block\n    parsers](#BlockParser.parse).\n    */\n    addElement(elt) {\n        this.block.addChild(elt.toTree(this.parser.nodeSet), elt.from - this.block.from);\n    }\n    /**\n    Add a block element from a [leaf parser](#LeafBlockParser). This\n    makes sure any extra composite block markup (such as blockquote\n    markers) inside the block are also added to the syntax tree.\n    */\n    addLeafElement(leaf, elt) {\n        this.addNode(this.buffer\n            .writeElements(injectMarks(elt.children, leaf.marks), -elt.from)\n            .finish(elt.type, elt.to - elt.from), elt.from);\n    }\n    /**\n    @internal\n    */\n    finishContext() {\n        let cx = this.stack.pop();\n        let top = this.stack[this.stack.length - 1];\n        top.addChild(cx.toTree(this.parser.nodeSet), cx.from - top.from);\n        this.block = top;\n    }\n    finish() {\n        while (this.stack.length > 1)\n            this.finishContext();\n        return this.addGaps(this.block.toTree(this.parser.nodeSet, this.lineStart));\n    }\n    addGaps(tree) {\n        return this.ranges.length > 1 ?\n            injectGaps(this.ranges, 0, tree.topNode, this.ranges[0].from, this.reusePlaceholders) : tree;\n    }\n    /**\n    @internal\n    */\n    finishLeaf(leaf) {\n        for (let parser of leaf.parsers)\n            if (parser.finish(this, leaf))\n                return;\n        let inline = injectMarks(this.parser.parseInline(leaf.content, leaf.start), leaf.marks);\n        this.addNode(this.buffer\n            .writeElements(inline, -leaf.start)\n            .finish(Type.Paragraph, leaf.content.length), leaf.start);\n    }\n    elt(type, from, to, children) {\n        if (typeof type == \"string\")\n            return elt(this.parser.getNodeType(type), from, to, children);\n        return new TreeElement(type, from);\n    }\n    /**\n    @internal\n    */\n    get buffer() { return new Buffer(this.parser.nodeSet); }\n}\nfunction injectGaps(ranges, rangeI, tree, offset, dummies) {\n    let rangeEnd = ranges[rangeI].to;\n    let children = [], positions = [], start = tree.from + offset;\n    function movePastNext(upto, inclusive) {\n        while (inclusive ? upto >= rangeEnd : upto > rangeEnd) {\n            let size = ranges[rangeI + 1].from - rangeEnd;\n            offset += size;\n            upto += size;\n            rangeI++;\n            rangeEnd = ranges[rangeI].to;\n        }\n    }\n    for (let ch = tree.firstChild; ch; ch = ch.nextSibling) {\n        movePastNext(ch.from + offset, true);\n        let from = ch.from + offset, node, reuse = dummies.get(ch.tree);\n        if (reuse) {\n            node = reuse;\n        }\n        else if (ch.to + offset > rangeEnd) {\n            node = injectGaps(ranges, rangeI, ch, offset, dummies);\n            movePastNext(ch.to + offset, false);\n        }\n        else {\n            node = ch.toTree();\n        }\n        children.push(node);\n        positions.push(from - start);\n    }\n    movePastNext(tree.to + offset, false);\n    return new Tree(tree.type, children, positions, tree.to + offset - start, tree.tree ? tree.tree.propValues : undefined);\n}\n/**\nA Markdown parser configuration.\n*/\nclass MarkdownParser extends Parser {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The parser's syntax [node\n    types](https://lezer.codemirror.net/docs/ref/#common.NodeSet).\n    */\n    nodeSet, \n    /**\n    @internal\n    */\n    blockParsers, \n    /**\n    @internal\n    */\n    leafBlockParsers, \n    /**\n    @internal\n    */\n    blockNames, \n    /**\n    @internal\n    */\n    endLeafBlock, \n    /**\n    @internal\n    */\n    skipContextMarkup, \n    /**\n    @internal\n    */\n    inlineParsers, \n    /**\n    @internal\n    */\n    inlineNames, \n    /**\n    @internal\n    */\n    wrappers) {\n        super();\n        this.nodeSet = nodeSet;\n        this.blockParsers = blockParsers;\n        this.leafBlockParsers = leafBlockParsers;\n        this.blockNames = blockNames;\n        this.endLeafBlock = endLeafBlock;\n        this.skipContextMarkup = skipContextMarkup;\n        this.inlineParsers = inlineParsers;\n        this.inlineNames = inlineNames;\n        this.wrappers = wrappers;\n        /**\n        @internal\n        */\n        this.nodeTypes = Object.create(null);\n        for (let t of nodeSet.types)\n            this.nodeTypes[t.name] = t.id;\n    }\n    createParse(input, fragments, ranges) {\n        let parse = new BlockContext(this, input, fragments, ranges);\n        for (let w of this.wrappers)\n            parse = w(parse, input, fragments, ranges);\n        return parse;\n    }\n    /**\n    Reconfigure the parser.\n    */\n    configure(spec) {\n        let config = resolveConfig(spec);\n        if (!config)\n            return this;\n        let { nodeSet, skipContextMarkup } = this;\n        let blockParsers = this.blockParsers.slice(), leafBlockParsers = this.leafBlockParsers.slice(), blockNames = this.blockNames.slice(), inlineParsers = this.inlineParsers.slice(), inlineNames = this.inlineNames.slice(), endLeafBlock = this.endLeafBlock.slice(), wrappers = this.wrappers;\n        if (nonEmpty(config.defineNodes)) {\n            skipContextMarkup = Object.assign({}, skipContextMarkup);\n            let nodeTypes = nodeSet.types.slice(), styles;\n            for (let s of config.defineNodes) {\n                let { name, block, composite, style } = typeof s == \"string\" ? { name: s } : s;\n                if (nodeTypes.some(t => t.name == name))\n                    continue;\n                if (composite)\n                    skipContextMarkup[nodeTypes.length] =\n                        (bl, cx, line) => composite(cx, line, bl.value);\n                let id = nodeTypes.length;\n                let group = composite ? [\"Block\", \"BlockContext\"] : !block ? undefined\n                    : id >= Type.ATXHeading1 && id <= Type.SetextHeading2 ? [\"Block\", \"LeafBlock\", \"Heading\"] : [\"Block\", \"LeafBlock\"];\n                nodeTypes.push(NodeType.define({\n                    id,\n                    name,\n                    props: group && [[NodeProp.group, group]]\n                }));\n                if (style) {\n                    if (!styles)\n                        styles = {};\n                    if (Array.isArray(style) || style instanceof Tag)\n                        styles[name] = style;\n                    else\n                        Object.assign(styles, style);\n                }\n            }\n            nodeSet = new NodeSet(nodeTypes);\n            if (styles)\n                nodeSet = nodeSet.extend(styleTags(styles));\n        }\n        if (nonEmpty(config.props))\n            nodeSet = nodeSet.extend(...config.props);\n        if (nonEmpty(config.remove)) {\n            for (let rm of config.remove) {\n                let block = this.blockNames.indexOf(rm), inline = this.inlineNames.indexOf(rm);\n                if (block > -1)\n                    blockParsers[block] = leafBlockParsers[block] = undefined;\n                if (inline > -1)\n                    inlineParsers[inline] = undefined;\n            }\n        }\n        if (nonEmpty(config.parseBlock)) {\n            for (let spec of config.parseBlock) {\n                let found = blockNames.indexOf(spec.name);\n                if (found > -1) {\n                    blockParsers[found] = spec.parse;\n                    leafBlockParsers[found] = spec.leaf;\n                }\n                else {\n                    let pos = spec.before ? findName(blockNames, spec.before)\n                        : spec.after ? findName(blockNames, spec.after) + 1 : blockNames.length - 1;\n                    blockParsers.splice(pos, 0, spec.parse);\n                    leafBlockParsers.splice(pos, 0, spec.leaf);\n                    blockNames.splice(pos, 0, spec.name);\n                }\n                if (spec.endLeaf)\n                    endLeafBlock.push(spec.endLeaf);\n            }\n        }\n        if (nonEmpty(config.parseInline)) {\n            for (let spec of config.parseInline) {\n                let found = inlineNames.indexOf(spec.name);\n                if (found > -1) {\n                    inlineParsers[found] = spec.parse;\n                }\n                else {\n                    let pos = spec.before ? findName(inlineNames, spec.before)\n                        : spec.after ? findName(inlineNames, spec.after) + 1 : inlineNames.length - 1;\n                    inlineParsers.splice(pos, 0, spec.parse);\n                    inlineNames.splice(pos, 0, spec.name);\n                }\n            }\n        }\n        if (config.wrap)\n            wrappers = wrappers.concat(config.wrap);\n        return new MarkdownParser(nodeSet, blockParsers, leafBlockParsers, blockNames, endLeafBlock, skipContextMarkup, inlineParsers, inlineNames, wrappers);\n    }\n    /**\n    @internal\n    */\n    getNodeType(name) {\n        let found = this.nodeTypes[name];\n        if (found == null)\n            throw new RangeError(`Unknown node type '${name}'`);\n        return found;\n    }\n    /**\n    Parse the given piece of inline text at the given offset,\n    returning an array of [`Element`](#Element) objects representing\n    the inline content.\n    */\n    parseInline(text, offset) {\n        let cx = new InlineContext(this, text, offset);\n        outer: for (let pos = offset; pos < cx.end;) {\n            let next = cx.char(pos);\n            for (let token of this.inlineParsers)\n                if (token) {\n                    let result = token(cx, next, pos);\n                    if (result >= 0) {\n                        pos = result;\n                        continue outer;\n                    }\n                }\n            pos++;\n        }\n        return cx.resolveMarkers(0);\n    }\n}\nfunction nonEmpty(a) {\n    return a != null && a.length > 0;\n}\nfunction resolveConfig(spec) {\n    if (!Array.isArray(spec))\n        return spec;\n    if (spec.length == 0)\n        return null;\n    let conf = resolveConfig(spec[0]);\n    if (spec.length == 1)\n        return conf;\n    let rest = resolveConfig(spec.slice(1));\n    if (!rest || !conf)\n        return conf || rest;\n    let conc = (a, b) => (a || none).concat(b || none);\n    let wrapA = conf.wrap, wrapB = rest.wrap;\n    return {\n        props: conc(conf.props, rest.props),\n        defineNodes: conc(conf.defineNodes, rest.defineNodes),\n        parseBlock: conc(conf.parseBlock, rest.parseBlock),\n        parseInline: conc(conf.parseInline, rest.parseInline),\n        remove: conc(conf.remove, rest.remove),\n        wrap: !wrapA ? wrapB : !wrapB ? wrapA :\n            (inner, input, fragments, ranges) => wrapA(wrapB(inner, input, fragments, ranges), input, fragments, ranges)\n    };\n}\nfunction findName(names, name) {\n    let found = names.indexOf(name);\n    if (found < 0)\n        throw new RangeError(`Position specified relative to unknown parser ${name}`);\n    return found;\n}\nlet nodeTypes = [NodeType.none];\nfor (let i = 1, name; name = Type[i]; i++) {\n    nodeTypes[i] = NodeType.define({\n        id: i,\n        name,\n        props: i >= Type.Escape ? [] : [[NodeProp.group, i in DefaultSkipMarkup ? [\"Block\", \"BlockContext\"] : [\"Block\", \"LeafBlock\"]]],\n        top: name == \"Document\"\n    });\n}\nconst none = [];\nclass Buffer {\n    constructor(nodeSet) {\n        this.nodeSet = nodeSet;\n        this.content = [];\n        this.nodes = [];\n    }\n    write(type, from, to, children = 0) {\n        this.content.push(type, from, to, 4 + children * 4);\n        return this;\n    }\n    writeElements(elts, offset = 0) {\n        for (let e of elts)\n            e.writeTo(this, offset);\n        return this;\n    }\n    finish(type, length) {\n        return Tree.build({\n            buffer: this.content,\n            nodeSet: this.nodeSet,\n            reused: this.nodes,\n            topID: type,\n            length\n        });\n    }\n}\n/**\nElements are used to compose syntax nodes during parsing.\n*/\nclass Element {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The node's\n    [id](https://lezer.codemirror.net/docs/ref/#common.NodeType.id).\n    */\n    type, \n    /**\n    The start of the node, as an offset from the start of the document.\n    */\n    from, \n    /**\n    The end of the node.\n    */\n    to, \n    /**\n    The node's child nodes @internal\n    */\n    children = none) {\n        this.type = type;\n        this.from = from;\n        this.to = to;\n        this.children = children;\n    }\n    /**\n    @internal\n    */\n    writeTo(buf, offset) {\n        let startOff = buf.content.length;\n        buf.writeElements(this.children, offset);\n        buf.content.push(this.type, this.from + offset, this.to + offset, buf.content.length + 4 - startOff);\n    }\n    /**\n    @internal\n    */\n    toTree(nodeSet) {\n        return new Buffer(nodeSet).writeElements(this.children, -this.from).finish(this.type, this.to - this.from);\n    }\n}\nclass TreeElement {\n    constructor(tree, from) {\n        this.tree = tree;\n        this.from = from;\n    }\n    get to() { return this.from + this.tree.length; }\n    get type() { return this.tree.type.id; }\n    get children() { return none; }\n    writeTo(buf, offset) {\n        buf.nodes.push(this.tree);\n        buf.content.push(buf.nodes.length - 1, this.from + offset, this.to + offset, -1);\n    }\n    toTree() { return this.tree; }\n}\nfunction elt(type, from, to, children) {\n    return new Element(type, from, to, children);\n}\nconst EmphasisUnderscore = { resolve: \"Emphasis\", mark: \"EmphasisMark\" };\nconst EmphasisAsterisk = { resolve: \"Emphasis\", mark: \"EmphasisMark\" };\nconst LinkStart = {}, ImageStart = {};\nclass InlineDelimiter {\n    constructor(type, from, to, side) {\n        this.type = type;\n        this.from = from;\n        this.to = to;\n        this.side = side;\n    }\n}\nconst Escapable = \"!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~\";\nlet Punctuation = /[!\"#$%&'()*+,\\-.\\/:;<=>?@\\[\\\\\\]^_`{|}~\\xA1\\u2010-\\u2027]/;\ntry {\n    Punctuation = new RegExp(\"[\\\\p{S}|\\\\p{P}]\", \"u\");\n}\ncatch (_) { }\nconst DefaultInline = {\n    Escape(cx, next, start) {\n        if (next != 92 /* '\\\\' */ || start == cx.end - 1)\n            return -1;\n        let escaped = cx.char(start + 1);\n        for (let i = 0; i < Escapable.length; i++)\n            if (Escapable.charCodeAt(i) == escaped)\n                return cx.append(elt(Type.Escape, start, start + 2));\n        return -1;\n    },\n    Entity(cx, next, start) {\n        if (next != 38 /* '&' */)\n            return -1;\n        let m = /^(?:#\\d+|#x[a-f\\d]+|\\w+);/i.exec(cx.slice(start + 1, start + 31));\n        return m ? cx.append(elt(Type.Entity, start, start + 1 + m[0].length)) : -1;\n    },\n    InlineCode(cx, next, start) {\n        if (next != 96 /* '`' */ || start && cx.char(start - 1) == 96)\n            return -1;\n        let pos = start + 1;\n        while (pos < cx.end && cx.char(pos) == 96)\n            pos++;\n        let size = pos - start, curSize = 0;\n        for (; pos < cx.end; pos++) {\n            if (cx.char(pos) == 96) {\n                curSize++;\n                if (curSize == size && cx.char(pos + 1) != 96)\n                    return cx.append(elt(Type.InlineCode, start, pos + 1, [\n                        elt(Type.CodeMark, start, start + size),\n                        elt(Type.CodeMark, pos + 1 - size, pos + 1)\n                    ]));\n            }\n            else {\n                curSize = 0;\n            }\n        }\n        return -1;\n    },\n    HTMLTag(cx, next, start) {\n        if (next != 60 /* '<' */ || start == cx.end - 1)\n            return -1;\n        let after = cx.slice(start + 1, cx.end);\n        let url = /^(?:[a-z][-\\w+.]+:[^\\s>]+|[a-z\\d.!#$%&'*+/=?^_`{|}~-]+@[a-z\\d](?:[a-z\\d-]{0,61}[a-z\\d])?(?:\\.[a-z\\d](?:[a-z\\d-]{0,61}[a-z\\d])?)*)>/i.exec(after);\n        if (url) {\n            return cx.append(elt(Type.Autolink, start, start + 1 + url[0].length, [\n                elt(Type.LinkMark, start, start + 1),\n                // url[0] includes the closing bracket, so exclude it from this slice\n                elt(Type.URL, start + 1, start + url[0].length),\n                elt(Type.LinkMark, start + url[0].length, start + 1 + url[0].length)\n            ]));\n        }\n        let comment = /^!--[^>](?:-[^-]|[^-])*?-->/i.exec(after);\n        if (comment)\n            return cx.append(elt(Type.Comment, start, start + 1 + comment[0].length));\n        let procInst = /^\\?[^]*?\\?>/.exec(after);\n        if (procInst)\n            return cx.append(elt(Type.ProcessingInstruction, start, start + 1 + procInst[0].length));\n        let m = /^(?:![A-Z][^]*?>|!\\[CDATA\\[[^]*?\\]\\]>|\\/\\s*[a-zA-Z][\\w-]*\\s*>|\\s*[a-zA-Z][\\w-]*(\\s+[a-zA-Z:_][\\w-.:]*(?:\\s*=\\s*(?:[^\\s\"'=<>`]+|'[^']*'|\"[^\"]*\"))?)*\\s*(\\/\\s*)?>)/.exec(after);\n        if (!m)\n            return -1;\n        return cx.append(elt(Type.HTMLTag, start, start + 1 + m[0].length));\n    },\n    Emphasis(cx, next, start) {\n        if (next != 95 && next != 42)\n            return -1;\n        let pos = start + 1;\n        while (cx.char(pos) == next)\n            pos++;\n        let before = cx.slice(start - 1, start), after = cx.slice(pos, pos + 1);\n        let pBefore = Punctuation.test(before), pAfter = Punctuation.test(after);\n        let sBefore = /\\s|^$/.test(before), sAfter = /\\s|^$/.test(after);\n        let leftFlanking = !sAfter && (!pAfter || sBefore || pBefore);\n        let rightFlanking = !sBefore && (!pBefore || sAfter || pAfter);\n        let canOpen = leftFlanking && (next == 42 || !rightFlanking || pBefore);\n        let canClose = rightFlanking && (next == 42 || !leftFlanking || pAfter);\n        return cx.append(new InlineDelimiter(next == 95 ? EmphasisUnderscore : EmphasisAsterisk, start, pos, (canOpen ? 1 /* Mark.Open */ : 0 /* Mark.None */) | (canClose ? 2 /* Mark.Close */ : 0 /* Mark.None */)));\n    },\n    HardBreak(cx, next, start) {\n        if (next == 92 /* '\\\\' */ && cx.char(start + 1) == 10 /* '\\n' */)\n            return cx.append(elt(Type.HardBreak, start, start + 2));\n        if (next == 32) {\n            let pos = start + 1;\n            while (cx.char(pos) == 32)\n                pos++;\n            if (cx.char(pos) == 10 && pos >= start + 2)\n                return cx.append(elt(Type.HardBreak, start, pos + 1));\n        }\n        return -1;\n    },\n    Link(cx, next, start) {\n        return next == 91 /* '[' */ ? cx.append(new InlineDelimiter(LinkStart, start, start + 1, 1 /* Mark.Open */)) : -1;\n    },\n    Image(cx, next, start) {\n        return next == 33 /* '!' */ && cx.char(start + 1) == 91 /* '[' */\n            ? cx.append(new InlineDelimiter(ImageStart, start, start + 2, 1 /* Mark.Open */)) : -1;\n    },\n    LinkEnd(cx, next, start) {\n        if (next != 93 /* ']' */)\n            return -1;\n        // Scanning back to the next link/image start marker\n        for (let i = cx.parts.length - 1; i >= 0; i--) {\n            let part = cx.parts[i];\n            if (part instanceof InlineDelimiter && (part.type == LinkStart || part.type == ImageStart)) {\n                // If this one has been set invalid (because it would produce\n                // a nested link) or there's no valid link here ignore both.\n                if (!part.side || cx.skipSpace(part.to) == start && !/[(\\[]/.test(cx.slice(start + 1, start + 2))) {\n                    cx.parts[i] = null;\n                    return -1;\n                }\n                // Finish the content and replace the entire range in\n                // this.parts with the link/image node.\n                let content = cx.takeContent(i);\n                let link = cx.parts[i] = finishLink(cx, content, part.type == LinkStart ? Type.Link : Type.Image, part.from, start + 1);\n                // Set any open-link markers before this link to invalid.\n                if (part.type == LinkStart)\n                    for (let j = 0; j < i; j++) {\n                        let p = cx.parts[j];\n                        if (p instanceof InlineDelimiter && p.type == LinkStart)\n                            p.side = 0 /* Mark.None */;\n                    }\n                return link.to;\n            }\n        }\n        return -1;\n    }\n};\nfunction finishLink(cx, content, type, start, startPos) {\n    let { text } = cx, next = cx.char(startPos), endPos = startPos;\n    content.unshift(elt(Type.LinkMark, start, start + (type == Type.Image ? 2 : 1)));\n    content.push(elt(Type.LinkMark, startPos - 1, startPos));\n    if (next == 40 /* '(' */) {\n        let pos = cx.skipSpace(startPos + 1);\n        let dest = parseURL(text, pos - cx.offset, cx.offset), title;\n        if (dest) {\n            pos = cx.skipSpace(dest.to);\n            // The destination and title must be separated by whitespace\n            if (pos != dest.to) {\n                title = parseLinkTitle(text, pos - cx.offset, cx.offset);\n                if (title)\n                    pos = cx.skipSpace(title.to);\n            }\n        }\n        if (cx.char(pos) == 41 /* ')' */) {\n            content.push(elt(Type.LinkMark, startPos, startPos + 1));\n            endPos = pos + 1;\n            if (dest)\n                content.push(dest);\n            if (title)\n                content.push(title);\n            content.push(elt(Type.LinkMark, pos, endPos));\n        }\n    }\n    else if (next == 91 /* '[' */) {\n        let label = parseLinkLabel(text, startPos - cx.offset, cx.offset, false);\n        if (label) {\n            content.push(label);\n            endPos = label.to;\n        }\n    }\n    return elt(type, start, endPos, content);\n}\n// These return `null` when falling off the end of the input, `false`\n// when parsing fails otherwise (for use in the incremental link\n// reference parser).\nfunction parseURL(text, start, offset) {\n    let next = text.charCodeAt(start);\n    if (next == 60 /* '<' */) {\n        for (let pos = start + 1; pos < text.length; pos++) {\n            let ch = text.charCodeAt(pos);\n            if (ch == 62 /* '>' */)\n                return elt(Type.URL, start + offset, pos + 1 + offset);\n            if (ch == 60 || ch == 10 /* '<\\n' */)\n                return false;\n        }\n        return null;\n    }\n    else {\n        let depth = 0, pos = start;\n        for (let escaped = false; pos < text.length; pos++) {\n            let ch = text.charCodeAt(pos);\n            if (space(ch)) {\n                break;\n            }\n            else if (escaped) {\n                escaped = false;\n            }\n            else if (ch == 40 /* '(' */) {\n                depth++;\n            }\n            else if (ch == 41 /* ')' */) {\n                if (!depth)\n                    break;\n                depth--;\n            }\n            else if (ch == 92 /* '\\\\' */) {\n                escaped = true;\n            }\n        }\n        return pos > start ? elt(Type.URL, start + offset, pos + offset) : pos == text.length ? null : false;\n    }\n}\nfunction parseLinkTitle(text, start, offset) {\n    let next = text.charCodeAt(start);\n    if (next != 39 && next != 34 && next != 40 /* '\"\\'(' */)\n        return false;\n    let end = next == 40 ? 41 : next;\n    for (let pos = start + 1, escaped = false; pos < text.length; pos++) {\n        let ch = text.charCodeAt(pos);\n        if (escaped)\n            escaped = false;\n        else if (ch == end)\n            return elt(Type.LinkTitle, start + offset, pos + 1 + offset);\n        else if (ch == 92 /* '\\\\' */)\n            escaped = true;\n    }\n    return null;\n}\nfunction parseLinkLabel(text, start, offset, requireNonWS) {\n    for (let escaped = false, pos = start + 1, end = Math.min(text.length, pos + 999); pos < end; pos++) {\n        let ch = text.charCodeAt(pos);\n        if (escaped)\n            escaped = false;\n        else if (ch == 93 /* ']' */)\n            return requireNonWS ? false : elt(Type.LinkLabel, start + offset, pos + 1 + offset);\n        else {\n            if (requireNonWS && !space(ch))\n                requireNonWS = false;\n            if (ch == 91 /* '[' */)\n                return false;\n            else if (ch == 92 /* '\\\\' */)\n                escaped = true;\n        }\n    }\n    return null;\n}\n/**\nInline parsing functions get access to this context, and use it to\nread the content and emit syntax nodes.\n*/\nclass InlineContext {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The parser that is being used.\n    */\n    parser, \n    /**\n    The text of this inline section.\n    */\n    text, \n    /**\n    The starting offset of the section in the document.\n    */\n    offset) {\n        this.parser = parser;\n        this.text = text;\n        this.offset = offset;\n        /**\n        @internal\n        */\n        this.parts = [];\n    }\n    /**\n    Get the character code at the given (document-relative)\n    position.\n    */\n    char(pos) { return pos >= this.end ? -1 : this.text.charCodeAt(pos - this.offset); }\n    /**\n    The position of the end of this inline section.\n    */\n    get end() { return this.offset + this.text.length; }\n    /**\n    Get a substring of this inline section. Again uses\n    document-relative positions.\n    */\n    slice(from, to) { return this.text.slice(from - this.offset, to - this.offset); }\n    /**\n    @internal\n    */\n    append(elt) {\n        this.parts.push(elt);\n        return elt.to;\n    }\n    /**\n    Add a [delimiter](#DelimiterType) at this given position. `open`\n    and `close` indicate whether this delimiter is opening, closing,\n    or both. Returns the end of the delimiter, for convenient\n    returning from [parse functions](#InlineParser.parse).\n    */\n    addDelimiter(type, from, to, open, close) {\n        return this.append(new InlineDelimiter(type, from, to, (open ? 1 /* Mark.Open */ : 0 /* Mark.None */) | (close ? 2 /* Mark.Close */ : 0 /* Mark.None */)));\n    }\n    /**\n    Returns true when there is an unmatched link or image opening\n    token before the current position.\n    */\n    get hasOpenLink() {\n        for (let i = this.parts.length - 1; i >= 0; i--) {\n            let part = this.parts[i];\n            if (part instanceof InlineDelimiter && (part.type == LinkStart || part.type == ImageStart))\n                return true;\n        }\n        return false;\n    }\n    /**\n    Add an inline element. Returns the end of the element.\n    */\n    addElement(elt) {\n        return this.append(elt);\n    }\n    /**\n    Resolve markers between this.parts.length and from, wrapping matched markers in the\n    appropriate node and updating the content of this.parts. @internal\n    */\n    resolveMarkers(from) {\n        // Scan forward, looking for closing tokens\n        for (let i = from; i < this.parts.length; i++) {\n            let close = this.parts[i];\n            if (!(close instanceof InlineDelimiter && close.type.resolve && (close.side & 2 /* Mark.Close */)))\n                continue;\n            let emp = close.type == EmphasisUnderscore || close.type == EmphasisAsterisk;\n            let closeSize = close.to - close.from;\n            let open, j = i - 1;\n            // Continue scanning for a matching opening token\n            for (; j >= from; j--) {\n                let part = this.parts[j];\n                if (part instanceof InlineDelimiter && (part.side & 1 /* Mark.Open */) && part.type == close.type &&\n                    // Ignore emphasis delimiters where the character count doesn't match\n                    !(emp && ((close.side & 1 /* Mark.Open */) || (part.side & 2 /* Mark.Close */)) &&\n                        (part.to - part.from + closeSize) % 3 == 0 && ((part.to - part.from) % 3 || closeSize % 3))) {\n                    open = part;\n                    break;\n                }\n            }\n            if (!open)\n                continue;\n            let type = close.type.resolve, content = [];\n            let start = open.from, end = close.to;\n            // Emphasis marker effect depends on the character count. Size consumed is minimum of the two\n            // markers.\n            if (emp) {\n                let size = Math.min(2, open.to - open.from, closeSize);\n                start = open.to - size;\n                end = close.from + size;\n                type = size == 1 ? \"Emphasis\" : \"StrongEmphasis\";\n            }\n            // Move the covered region into content, optionally adding marker nodes\n            if (open.type.mark)\n                content.push(this.elt(open.type.mark, start, open.to));\n            for (let k = j + 1; k < i; k++) {\n                if (this.parts[k] instanceof Element)\n                    content.push(this.parts[k]);\n                this.parts[k] = null;\n            }\n            if (close.type.mark)\n                content.push(this.elt(close.type.mark, close.from, end));\n            let element = this.elt(type, start, end, content);\n            // If there are leftover emphasis marker characters, shrink the close/open markers. Otherwise, clear them.\n            this.parts[j] = emp && open.from != start ? new InlineDelimiter(open.type, open.from, start, open.side) : null;\n            let keep = this.parts[i] = emp && close.to != end ? new InlineDelimiter(close.type, end, close.to, close.side) : null;\n            // Insert the new element in this.parts\n            if (keep)\n                this.parts.splice(i, 0, element);\n            else\n                this.parts[i] = element;\n        }\n        // Collect the elements remaining in this.parts into an array.\n        let result = [];\n        for (let i = from; i < this.parts.length; i++) {\n            let part = this.parts[i];\n            if (part instanceof Element)\n                result.push(part);\n        }\n        return result;\n    }\n    /**\n    Find an opening delimiter of the given type. Returns `null` if\n    no delimiter is found, or an index that can be passed to\n    [`takeContent`](#InlineContext.takeContent) otherwise.\n    */\n    findOpeningDelimiter(type) {\n        for (let i = this.parts.length - 1; i >= 0; i--) {\n            let part = this.parts[i];\n            if (part instanceof InlineDelimiter && part.type == type)\n                return i;\n        }\n        return null;\n    }\n    /**\n    Remove all inline elements and delimiters starting from the\n    given index (which you should get from\n    [`findOpeningDelimiter`](#InlineContext.findOpeningDelimiter),\n    resolve delimiters inside of them, and return them as an array\n    of elements.\n    */\n    takeContent(startIndex) {\n        let content = this.resolveMarkers(startIndex);\n        this.parts.length = startIndex;\n        return content;\n    }\n    /**\n    Skip space after the given (document) position, returning either\n    the position of the next non-space character or the end of the\n    section.\n    */\n    skipSpace(from) { return skipSpace(this.text, from - this.offset) + this.offset; }\n    elt(type, from, to, children) {\n        if (typeof type == \"string\")\n            return elt(this.parser.getNodeType(type), from, to, children);\n        return new TreeElement(type, from);\n    }\n}\nfunction injectMarks(elements, marks) {\n    if (!marks.length)\n        return elements;\n    if (!elements.length)\n        return marks;\n    let elts = elements.slice(), eI = 0;\n    for (let mark of marks) {\n        while (eI < elts.length && elts[eI].to < mark.to)\n            eI++;\n        if (eI < elts.length && elts[eI].from < mark.from) {\n            let e = elts[eI];\n            if (e instanceof Element)\n                elts[eI] = new Element(e.type, e.from, e.to, injectMarks(e.children, [mark]));\n        }\n        else {\n            elts.splice(eI++, 0, mark);\n        }\n    }\n    return elts;\n}\n// These are blocks that can span blank lines, and should thus only be\n// reused if their next sibling is also being reused.\nconst NotLast = [Type.CodeBlock, Type.ListItem, Type.OrderedList, Type.BulletList];\nclass FragmentCursor {\n    constructor(fragments, input) {\n        this.fragments = fragments;\n        this.input = input;\n        // Index into fragment array\n        this.i = 0;\n        // Active fragment\n        this.fragment = null;\n        this.fragmentEnd = -1;\n        // Cursor into the current fragment, if any. When `moveTo` returns\n        // true, this points at the first block after `pos`.\n        this.cursor = null;\n        if (fragments.length)\n            this.fragment = fragments[this.i++];\n    }\n    nextFragment() {\n        this.fragment = this.i < this.fragments.length ? this.fragments[this.i++] : null;\n        this.cursor = null;\n        this.fragmentEnd = -1;\n    }\n    moveTo(pos, lineStart) {\n        while (this.fragment && this.fragment.to <= pos)\n            this.nextFragment();\n        if (!this.fragment || this.fragment.from > (pos ? pos - 1 : 0))\n            return false;\n        if (this.fragmentEnd < 0) {\n            let end = this.fragment.to;\n            while (end > 0 && this.input.read(end - 1, end) != \"\\n\")\n                end--;\n            this.fragmentEnd = end ? end - 1 : 0;\n        }\n        let c = this.cursor;\n        if (!c) {\n            c = this.cursor = this.fragment.tree.cursor();\n            c.firstChild();\n        }\n        let rPos = pos + this.fragment.offset;\n        while (c.to <= rPos)\n            if (!c.parent())\n                return false;\n        for (;;) {\n            if (c.from >= rPos)\n                return this.fragment.from <= lineStart;\n            if (!c.childAfter(rPos))\n                return false;\n        }\n    }\n    matches(hash) {\n        let tree = this.cursor.tree;\n        return tree && tree.prop(NodeProp.contextHash) == hash;\n    }\n    takeNodes(cx) {\n        let cur = this.cursor, off = this.fragment.offset, fragEnd = this.fragmentEnd - (this.fragment.openEnd ? 1 : 0);\n        let start = cx.absoluteLineStart, end = start, blockI = cx.block.children.length;\n        let prevEnd = end, prevI = blockI;\n        for (;;) {\n            if (cur.to - off > fragEnd) {\n                if (cur.type.isAnonymous && cur.firstChild())\n                    continue;\n                break;\n            }\n            let pos = toRelative(cur.from - off, cx.ranges);\n            if (cur.to - off <= cx.ranges[cx.rangeI].to) { // Fits in current range\n                cx.addNode(cur.tree, pos);\n            }\n            else {\n                let dummy = new Tree(cx.parser.nodeSet.types[Type.Paragraph], [], [], 0, cx.block.hashProp);\n                cx.reusePlaceholders.set(dummy, cur.tree);\n                cx.addNode(dummy, pos);\n            }\n            // Taken content must always end in a block, because incremental\n            // parsing happens on block boundaries. Never stop directly\n            // after an indented code block, since those can continue after\n            // any number of blank lines.\n            if (cur.type.is(\"Block\")) {\n                if (NotLast.indexOf(cur.type.id) < 0) {\n                    end = cur.to - off;\n                    blockI = cx.block.children.length;\n                }\n                else {\n                    end = prevEnd;\n                    blockI = prevI;\n                    prevEnd = cur.to - off;\n                    prevI = cx.block.children.length;\n                }\n            }\n            if (!cur.nextSibling())\n                break;\n        }\n        while (cx.block.children.length > blockI) {\n            cx.block.children.pop();\n            cx.block.positions.pop();\n        }\n        return end - start;\n    }\n}\n// Convert an input-stream-relative position to a\n// Markdown-doc-relative position by subtracting the size of all input\n// gaps before `abs`.\nfunction toRelative(abs, ranges) {\n    let pos = abs;\n    for (let i = 1; i < ranges.length; i++) {\n        let gapFrom = ranges[i - 1].to, gapTo = ranges[i].from;\n        if (gapFrom < abs)\n            pos -= gapTo - gapFrom;\n    }\n    return pos;\n}\nconst markdownHighlighting = styleTags({\n    \"Blockquote/...\": tags.quote,\n    HorizontalRule: tags.contentSeparator,\n    \"ATXHeading1/... SetextHeading1/...\": tags.heading1,\n    \"ATXHeading2/... SetextHeading2/...\": tags.heading2,\n    \"ATXHeading3/...\": tags.heading3,\n    \"ATXHeading4/...\": tags.heading4,\n    \"ATXHeading5/...\": tags.heading5,\n    \"ATXHeading6/...\": tags.heading6,\n    \"Comment CommentBlock\": tags.comment,\n    Escape: tags.escape,\n    Entity: tags.character,\n    \"Emphasis/...\": tags.emphasis,\n    \"StrongEmphasis/...\": tags.strong,\n    \"Link/... Image/...\": tags.link,\n    \"OrderedList/... BulletList/...\": tags.list,\n    \"BlockQuote/...\": tags.quote,\n    \"InlineCode CodeText\": tags.monospace,\n    \"URL Autolink\": tags.url,\n    \"HeaderMark HardBreak QuoteMark ListMark LinkMark EmphasisMark CodeMark\": tags.processingInstruction,\n    \"CodeInfo LinkLabel\": tags.labelName,\n    LinkTitle: tags.string,\n    Paragraph: tags.content\n});\n/**\nThe default CommonMark parser.\n*/\nconst parser = new MarkdownParser(new NodeSet(nodeTypes).extend(markdownHighlighting), Object.keys(DefaultBlockParsers).map(n => DefaultBlockParsers[n]), Object.keys(DefaultBlockParsers).map(n => DefaultLeafBlocks[n]), Object.keys(DefaultBlockParsers), DefaultEndLeaf, DefaultSkipMarkup, Object.keys(DefaultInline).map(n => DefaultInline[n]), Object.keys(DefaultInline), []);\n\nfunction leftOverSpace(node, from, to) {\n    let ranges = [];\n    for (let n = node.firstChild, pos = from;; n = n.nextSibling) {\n        let nextPos = n ? n.from : to;\n        if (nextPos > pos)\n            ranges.push({ from: pos, to: nextPos });\n        if (!n)\n            break;\n        pos = n.to;\n    }\n    return ranges;\n}\n/**\nCreate a Markdown extension to enable nested parsing on code\nblocks and/or embedded HTML.\n*/\nfunction parseCode(config) {\n    let { codeParser, htmlParser } = config;\n    let wrap = parseMixed((node, input) => {\n        let id = node.type.id;\n        if (codeParser && (id == Type.CodeBlock || id == Type.FencedCode)) {\n            let info = \"\";\n            if (id == Type.FencedCode) {\n                let infoNode = node.node.getChild(Type.CodeInfo);\n                if (infoNode)\n                    info = input.read(infoNode.from, infoNode.to);\n            }\n            let parser = codeParser(info);\n            if (parser)\n                return { parser, overlay: node => node.type.id == Type.CodeText };\n        }\n        else if (htmlParser && (id == Type.HTMLBlock || id == Type.HTMLTag || id == Type.CommentBlock)) {\n            return { parser: htmlParser, overlay: leftOverSpace(node.node, node.from, node.to) };\n        }\n        return null;\n    });\n    return { wrap };\n}\n\nconst StrikethroughDelim = { resolve: \"Strikethrough\", mark: \"StrikethroughMark\" };\n/**\nAn extension that implements\n[GFM-style](https://github.github.com/gfm/#strikethrough-extension-)\nStrikethrough syntax using `~~` delimiters.\n*/\nconst Strikethrough = {\n    defineNodes: [{\n            name: \"Strikethrough\",\n            style: { \"Strikethrough/...\": tags.strikethrough }\n        }, {\n            name: \"StrikethroughMark\",\n            style: tags.processingInstruction\n        }],\n    parseInline: [{\n            name: \"Strikethrough\",\n            parse(cx, next, pos) {\n                if (next != 126 /* '~' */ || cx.char(pos + 1) != 126 || cx.char(pos + 2) == 126)\n                    return -1;\n                let before = cx.slice(pos - 1, pos), after = cx.slice(pos + 2, pos + 3);\n                let sBefore = /\\s|^$/.test(before), sAfter = /\\s|^$/.test(after);\n                let pBefore = Punctuation.test(before), pAfter = Punctuation.test(after);\n                return cx.addDelimiter(StrikethroughDelim, pos, pos + 2, !sAfter && (!pAfter || sBefore || pBefore), !sBefore && (!pBefore || sAfter || pAfter));\n            },\n            after: \"Emphasis\"\n        }]\n};\n// Parse a line as a table row and return the row count. When `elts`\n// is given, push syntax elements for the content onto it.\nfunction parseRow(cx, line, startI = 0, elts, offset = 0) {\n    let count = 0, first = true, cellStart = -1, cellEnd = -1, esc = false;\n    let parseCell = () => {\n        elts.push(cx.elt(\"TableCell\", offset + cellStart, offset + cellEnd, cx.parser.parseInline(line.slice(cellStart, cellEnd), offset + cellStart)));\n    };\n    for (let i = startI; i < line.length; i++) {\n        let next = line.charCodeAt(i);\n        if (next == 124 /* '|' */ && !esc) {\n            if (!first || cellStart > -1)\n                count++;\n            first = false;\n            if (elts) {\n                if (cellStart > -1)\n                    parseCell();\n                elts.push(cx.elt(\"TableDelimiter\", i + offset, i + offset + 1));\n            }\n            cellStart = cellEnd = -1;\n        }\n        else if (esc || next != 32 && next != 9) {\n            if (cellStart < 0)\n                cellStart = i;\n            cellEnd = i + 1;\n        }\n        esc = !esc && next == 92;\n    }\n    if (cellStart > -1) {\n        count++;\n        if (elts)\n            parseCell();\n    }\n    return count;\n}\nfunction hasPipe(str, start) {\n    for (let i = start; i < str.length; i++) {\n        let next = str.charCodeAt(i);\n        if (next == 124 /* '|' */)\n            return true;\n        if (next == 92 /* '\\\\' */)\n            i++;\n    }\n    return false;\n}\nconst delimiterLine = /^\\|?(\\s*:?-+:?\\s*\\|)+(\\s*:?-+:?\\s*)?$/;\nclass TableParser {\n    constructor() {\n        // Null means we haven't seen the second line yet, false means this\n        // isn't a table, and an array means this is a table and we've\n        // parsed the given rows so far.\n        this.rows = null;\n    }\n    nextLine(cx, line, leaf) {\n        if (this.rows == null) { // Second line\n            this.rows = false;\n            let lineText;\n            if ((line.next == 45 || line.next == 58 || line.next == 124 /* '-:|' */) &&\n                delimiterLine.test(lineText = line.text.slice(line.pos))) {\n                let firstRow = [], firstCount = parseRow(cx, leaf.content, 0, firstRow, leaf.start);\n                if (firstCount == parseRow(cx, lineText, line.pos))\n                    this.rows = [cx.elt(\"TableHeader\", leaf.start, leaf.start + leaf.content.length, firstRow),\n                        cx.elt(\"TableDelimiter\", cx.lineStart + line.pos, cx.lineStart + line.text.length)];\n            }\n        }\n        else if (this.rows) { // Line after the second\n            let content = [];\n            parseRow(cx, line.text, line.pos, content, cx.lineStart);\n            this.rows.push(cx.elt(\"TableRow\", cx.lineStart + line.pos, cx.lineStart + line.text.length, content));\n        }\n        return false;\n    }\n    finish(cx, leaf) {\n        if (!this.rows)\n            return false;\n        cx.addLeafElement(leaf, cx.elt(\"Table\", leaf.start, leaf.start + leaf.content.length, this.rows));\n        return true;\n    }\n}\n/**\nThis extension provides\n[GFM-style](https://github.github.com/gfm/#tables-extension-)\ntables, using syntax like this:\n\n```\n| head 1 | head 2 |\n| ---    | ---    |\n| cell 1 | cell 2 |\n```\n*/\nconst Table = {\n    defineNodes: [\n        { name: \"Table\", block: true },\n        { name: \"TableHeader\", style: { \"TableHeader/...\": tags.heading } },\n        \"TableRow\",\n        { name: \"TableCell\", style: tags.content },\n        { name: \"TableDelimiter\", style: tags.processingInstruction },\n    ],\n    parseBlock: [{\n            name: \"Table\",\n            leaf(_, leaf) { return hasPipe(leaf.content, 0) ? new TableParser : null; },\n            endLeaf(cx, line, leaf) {\n                if (leaf.parsers.some(p => p instanceof TableParser) || !hasPipe(line.text, line.basePos))\n                    return false;\n                let next = cx.peekLine();\n                return delimiterLine.test(next) && parseRow(cx, line.text, line.basePos) == parseRow(cx, next, line.basePos);\n            },\n            before: \"SetextHeading\"\n        }]\n};\nclass TaskParser {\n    nextLine() { return false; }\n    finish(cx, leaf) {\n        cx.addLeafElement(leaf, cx.elt(\"Task\", leaf.start, leaf.start + leaf.content.length, [\n            cx.elt(\"TaskMarker\", leaf.start, leaf.start + 3),\n            ...cx.parser.parseInline(leaf.content.slice(3), leaf.start + 3)\n        ]));\n        return true;\n    }\n}\n/**\nExtension providing\n[GFM-style](https://github.github.com/gfm/#task-list-items-extension-)\ntask list items, where list items can be prefixed with `[ ]` or\n`[x]` to add a checkbox.\n*/\nconst TaskList = {\n    defineNodes: [\n        { name: \"Task\", block: true, style: tags.list },\n        { name: \"TaskMarker\", style: tags.atom }\n    ],\n    parseBlock: [{\n            name: \"TaskList\",\n            leaf(cx, leaf) {\n                return /^\\[[ xX]\\][ \\t]/.test(leaf.content) && cx.parentType().name == \"ListItem\" ? new TaskParser : null;\n            },\n            after: \"SetextHeading\"\n        }]\n};\nconst autolinkRE = /(www\\.)|(https?:\\/\\/)|([\\w.+-]{1,100}@)|(mailto:|xmpp:)/gy;\nconst urlRE = /[\\w-]+(\\.[\\w-]+)+(\\/[^\\s<]*)?/gy;\nconst lastTwoDomainWords = /[\\w-]+\\.[\\w-]+($|\\/)/;\nconst emailRE = /[\\w.+-]+@[\\w-]+(\\.[\\w.-]+)+/gy;\nconst xmppResourceRE = /\\/[a-zA-Z\\d@.]+/gy;\nfunction count(str, from, to, ch) {\n    let result = 0;\n    for (let i = from; i < to; i++)\n        if (str[i] == ch)\n            result++;\n    return result;\n}\nfunction autolinkURLEnd(text, from) {\n    urlRE.lastIndex = from;\n    let m = urlRE.exec(text);\n    if (!m || lastTwoDomainWords.exec(m[0])[0].indexOf(\"_\") > -1)\n        return -1;\n    let end = from + m[0].length;\n    for (;;) {\n        let last = text[end - 1], m;\n        if (/[?!.,:*_~]/.test(last) ||\n            last == \")\" && count(text, from, end, \")\") > count(text, from, end, \"(\"))\n            end--;\n        else if (last == \";\" && (m = /&(?:#\\d+|#x[a-f\\d]+|\\w+);$/.exec(text.slice(from, end))))\n            end = from + m.index;\n        else\n            break;\n    }\n    return end;\n}\nfunction autolinkEmailEnd(text, from) {\n    emailRE.lastIndex = from;\n    let m = emailRE.exec(text);\n    if (!m)\n        return -1;\n    let last = m[0][m[0].length - 1];\n    return last == \"_\" || last == \"-\" ? -1 : from + m[0].length - (last == \".\" ? 1 : 0);\n}\n/**\nExtension that implements autolinking for\n`www.`/`http://`/`https://`/`mailto:`/`xmpp:` URLs and email\naddresses.\n*/\nconst Autolink = {\n    parseInline: [{\n            name: \"Autolink\",\n            parse(cx, next, absPos) {\n                let pos = absPos - cx.offset;\n                if (pos && /\\w/.test(cx.text[pos - 1]))\n                    return -1;\n                autolinkRE.lastIndex = pos;\n                let m = autolinkRE.exec(cx.text), end = -1;\n                if (!m)\n                    return -1;\n                if (m[1] || m[2]) { // www., http://\n                    end = autolinkURLEnd(cx.text, pos + m[0].length);\n                    if (end > -1 && cx.hasOpenLink) {\n                        let noBracket = /([^\\[\\]]|\\[[^\\]]*\\])*/.exec(cx.text.slice(pos, end));\n                        end = pos + noBracket[0].length;\n                    }\n                }\n                else if (m[3]) { // email address\n                    end = autolinkEmailEnd(cx.text, pos);\n                }\n                else { // mailto:/xmpp:\n                    end = autolinkEmailEnd(cx.text, pos + m[0].length);\n                    if (end > -1 && m[0] == \"xmpp:\") {\n                        xmppResourceRE.lastIndex = end;\n                        m = xmppResourceRE.exec(cx.text);\n                        if (m)\n                            end = m.index + m[0].length;\n                    }\n                }\n                if (end < 0)\n                    return -1;\n                cx.addElement(cx.elt(\"URL\", absPos, end + cx.offset));\n                return end + cx.offset;\n            }\n        }]\n};\n/**\nExtension bundle containing [`Table`](#Table),\n[`TaskList`](#TaskList), [`Strikethrough`](#Strikethrough), and\n[`Autolink`](#Autolink).\n*/\nconst GFM = [Table, TaskList, Strikethrough, Autolink];\nfunction parseSubSuper(ch, node, mark) {\n    return (cx, next, pos) => {\n        if (next != ch || cx.char(pos + 1) == ch)\n            return -1;\n        let elts = [cx.elt(mark, pos, pos + 1)];\n        for (let i = pos + 1; i < cx.end; i++) {\n            let next = cx.char(i);\n            if (next == ch)\n                return cx.addElement(cx.elt(node, pos, i + 1, elts.concat(cx.elt(mark, i, i + 1))));\n            if (next == 92 /* '\\\\' */)\n                elts.push(cx.elt(\"Escape\", i, i++ + 2));\n            if (space(next))\n                break;\n        }\n        return -1;\n    };\n}\n/**\nExtension providing\n[Pandoc-style](https://pandoc.org/MANUAL.html#superscripts-and-subscripts)\nsuperscript using `^` markers.\n*/\nconst Superscript = {\n    defineNodes: [\n        { name: \"Superscript\", style: tags.special(tags.content) },\n        { name: \"SuperscriptMark\", style: tags.processingInstruction }\n    ],\n    parseInline: [{\n            name: \"Superscript\",\n            parse: parseSubSuper(94 /* '^' */, \"Superscript\", \"SuperscriptMark\")\n        }]\n};\n/**\nExtension providing\n[Pandoc-style](https://pandoc.org/MANUAL.html#superscripts-and-subscripts)\nsubscript using `~` markers.\n*/\nconst Subscript = {\n    defineNodes: [\n        { name: \"Subscript\", style: tags.special(tags.content) },\n        { name: \"SubscriptMark\", style: tags.processingInstruction }\n    ],\n    parseInline: [{\n            name: \"Subscript\",\n            parse: parseSubSuper(126 /* '~' */, \"Subscript\", \"SubscriptMark\")\n        }]\n};\n/**\nExtension that parses two colons with only letters, underscores,\nand numbers between them as `Emoji` nodes.\n*/\nconst Emoji = {\n    defineNodes: [{ name: \"Emoji\", style: tags.character }],\n    parseInline: [{\n            name: \"Emoji\",\n            parse(cx, next, pos) {\n                let match;\n                if (next != 58 /* ':' */ || !(match = /^[a-zA-Z_0-9]+:/.exec(cx.slice(pos + 1, cx.end))))\n                    return -1;\n                return cx.addElement(cx.elt(\"Emoji\", pos, pos + 1 + match[0].length));\n            }\n        }]\n};\n\nexport { Autolink, BlockContext, Element, Emoji, GFM, InlineContext, LeafBlock, Line, MarkdownParser, Strikethrough, Subscript, Superscript, Table, TaskList, parseCode, parser };\n","import { EditorSelection, countColumn, Prec, EditorState } from '@codemirror/state';\nimport { keymap } from '@codemirror/view';\nimport { defineLanguageFacet, foldNodeProp, indentNodeProp, languageDataProp, foldService, syntaxTree, Language, LanguageDescription, ParseContext, indentUnit, LanguageSupport } from '@codemirror/language';\nimport { CompletionContext } from '@codemirror/autocomplete';\nimport { parser, GFM, Subscript, Superscript, Emoji, MarkdownParser, parseCode } from '@lezer/markdown';\nimport { html, htmlCompletionSource } from '@codemirror/lang-html';\nimport { NodeProp } from '@lezer/common';\n\nconst data = /*@__PURE__*/defineLanguageFacet({ commentTokens: { block: { open: \"<!--\", close: \"-->\" } } });\nconst headingProp = /*@__PURE__*/new NodeProp();\nconst commonmark = /*@__PURE__*/parser.configure({\n    props: [\n        /*@__PURE__*/foldNodeProp.add(type => {\n            return !type.is(\"Block\") || type.is(\"Document\") || isHeading(type) != null ? undefined\n                : (tree, state) => ({ from: state.doc.lineAt(tree.from).to, to: tree.to });\n        }),\n        /*@__PURE__*/headingProp.add(isHeading),\n        /*@__PURE__*/indentNodeProp.add({\n            Document: () => null\n        }),\n        /*@__PURE__*/languageDataProp.add({\n            Document: data\n        })\n    ]\n});\nfunction isHeading(type) {\n    let match = /^(?:ATX|Setext)Heading(\\d)$/.exec(type.name);\n    return match ? +match[1] : undefined;\n}\nfunction findSectionEnd(headerNode, level) {\n    let last = headerNode;\n    for (;;) {\n        let next = last.nextSibling, heading;\n        if (!next || (heading = isHeading(next.type)) != null && heading <= level)\n            break;\n        last = next;\n    }\n    return last.to;\n}\nconst headerIndent = /*@__PURE__*/foldService.of((state, start, end) => {\n    for (let node = syntaxTree(state).resolveInner(end, -1); node; node = node.parent) {\n        if (node.from < start)\n            break;\n        let heading = node.type.prop(headingProp);\n        if (heading == null)\n            continue;\n        let upto = findSectionEnd(node, heading);\n        if (upto > end)\n            return { from: end, to: upto };\n    }\n    return null;\n});\nfunction mkLang(parser) {\n    return new Language(data, parser, [headerIndent], \"markdown\");\n}\n/**\nLanguage support for strict CommonMark.\n*/\nconst commonmarkLanguage = /*@__PURE__*/mkLang(commonmark);\nconst extended = /*@__PURE__*/commonmark.configure([GFM, Subscript, Superscript, Emoji]);\n/**\nLanguage support for [GFM](https://github.github.com/gfm/) plus\nsubscript, superscript, and emoji syntax.\n*/\nconst markdownLanguage = /*@__PURE__*/mkLang(extended);\nfunction getCodeParser(languages, defaultLanguage) {\n    return (info) => {\n        if (info && languages) {\n            let found = null;\n            // Strip anything after whitespace\n            info = /\\S*/.exec(info)[0];\n            if (typeof languages == \"function\")\n                found = languages(info);\n            else\n                found = LanguageDescription.matchLanguageName(languages, info, true);\n            if (found instanceof LanguageDescription)\n                return found.support ? found.support.language.parser : ParseContext.getSkippingParser(found.load());\n            else if (found)\n                return found.parser;\n        }\n        return defaultLanguage ? defaultLanguage.parser : null;\n    };\n}\n\nclass Context {\n    constructor(node, from, to, spaceBefore, spaceAfter, type, item) {\n        this.node = node;\n        this.from = from;\n        this.to = to;\n        this.spaceBefore = spaceBefore;\n        this.spaceAfter = spaceAfter;\n        this.type = type;\n        this.item = item;\n    }\n    blank(maxWidth, trailing = true) {\n        let result = this.spaceBefore + (this.node.name == \"Blockquote\" ? \">\" : \"\");\n        if (maxWidth != null) {\n            while (result.length < maxWidth)\n                result += \" \";\n            return result;\n        }\n        else {\n            for (let i = this.to - this.from - result.length - this.spaceAfter.length; i > 0; i--)\n                result += \" \";\n            return result + (trailing ? this.spaceAfter : \"\");\n        }\n    }\n    marker(doc, add) {\n        let number = this.node.name == \"OrderedList\" ? String((+itemNumber(this.item, doc)[2] + add)) : \"\";\n        return this.spaceBefore + number + this.type + this.spaceAfter;\n    }\n}\nfunction getContext(node, doc) {\n    let nodes = [];\n    for (let cur = node; cur && cur.name != \"Document\"; cur = cur.parent) {\n        if (cur.name == \"ListItem\" || cur.name == \"Blockquote\" || cur.name == \"FencedCode\")\n            nodes.push(cur);\n    }\n    let context = [];\n    for (let i = nodes.length - 1; i >= 0; i--) {\n        let node = nodes[i], match;\n        let line = doc.lineAt(node.from), startPos = node.from - line.from;\n        if (node.name == \"FencedCode\") {\n            context.push(new Context(node, startPos, startPos, \"\", \"\", \"\", null));\n        }\n        else if (node.name == \"Blockquote\" && (match = /^ *>( ?)/.exec(line.text.slice(startPos)))) {\n            context.push(new Context(node, startPos, startPos + match[0].length, \"\", match[1], \">\", null));\n        }\n        else if (node.name == \"ListItem\" && node.parent.name == \"OrderedList\" &&\n            (match = /^( *)\\d+([.)])( *)/.exec(line.text.slice(startPos)))) {\n            let after = match[3], len = match[0].length;\n            if (after.length >= 4) {\n                after = after.slice(0, after.length - 4);\n                len -= 4;\n            }\n            context.push(new Context(node.parent, startPos, startPos + len, match[1], after, match[2], node));\n        }\n        else if (node.name == \"ListItem\" && node.parent.name == \"BulletList\" &&\n            (match = /^( *)([-+*])( {1,4}\\[[ xX]\\])?( +)/.exec(line.text.slice(startPos)))) {\n            let after = match[4], len = match[0].length;\n            if (after.length > 4) {\n                after = after.slice(0, after.length - 4);\n                len -= 4;\n            }\n            let type = match[2];\n            if (match[3])\n                type += match[3].replace(/[xX]/, ' ');\n            context.push(new Context(node.parent, startPos, startPos + len, match[1], after, type, node));\n        }\n    }\n    return context;\n}\nfunction itemNumber(item, doc) {\n    return /^(\\s*)(\\d+)(?=[.)])/.exec(doc.sliceString(item.from, item.from + 10));\n}\nfunction renumberList(after, doc, changes, offset = 0) {\n    for (let prev = -1, node = after;;) {\n        if (node.name == \"ListItem\") {\n            let m = itemNumber(node, doc);\n            let number = +m[2];\n            if (prev >= 0) {\n                if (number != prev + 1)\n                    return;\n                changes.push({ from: node.from + m[1].length, to: node.from + m[0].length, insert: String(prev + 2 + offset) });\n            }\n            prev = number;\n        }\n        let next = node.nextSibling;\n        if (!next)\n            break;\n        node = next;\n    }\n}\nfunction normalizeIndent(content, state) {\n    let blank = /^[ \\t]*/.exec(content)[0].length;\n    if (!blank || state.facet(indentUnit) != \"\\t\")\n        return content;\n    let col = countColumn(content, 4, blank);\n    let space = \"\";\n    for (let i = col; i > 0;) {\n        if (i >= 4) {\n            space += \"\\t\";\n            i -= 4;\n        }\n        else {\n            space += \" \";\n            i--;\n        }\n    }\n    return space + content.slice(blank);\n}\n/**\nThis command, when invoked in Markdown context with cursor\nselection(s), will create a new line with the markup for\nblockquotes and lists that were active on the old line. If the\ncursor was directly after the end of the markup for the old line,\ntrailing whitespace and list markers are removed from that line.\n\nThe command does nothing in non-Markdown context, so it should\nnot be used as the only binding for Enter (even in a Markdown\ndocument, HTML and code regions might use a different language).\n*/\nconst insertNewlineContinueMarkup = ({ state, dispatch }) => {\n    let tree = syntaxTree(state), { doc } = state;\n    let dont = null, changes = state.changeByRange(range => {\n        if (!range.empty || !markdownLanguage.isActiveAt(state, range.from))\n            return dont = { range };\n        let pos = range.from, line = doc.lineAt(pos);\n        let context = getContext(tree.resolveInner(pos, -1), doc);\n        while (context.length && context[context.length - 1].from > pos - line.from)\n            context.pop();\n        if (!context.length)\n            return dont = { range };\n        let inner = context[context.length - 1];\n        if (inner.to - inner.spaceAfter.length > pos - line.from)\n            return dont = { range };\n        let emptyLine = pos >= (inner.to - inner.spaceAfter.length) && !/\\S/.test(line.text.slice(inner.to));\n        // Empty line in list\n        if (inner.item && emptyLine) {\n            // First list item or blank line before: delete a level of markup\n            if (inner.node.firstChild.to >= pos ||\n                line.from > 0 && !/[^\\s>]/.test(doc.lineAt(line.from - 1).text)) {\n                let next = context.length > 1 ? context[context.length - 2] : null;\n                let delTo, insert = \"\";\n                if (next && next.item) { // Re-add marker for the list at the next level\n                    delTo = line.from + next.from;\n                    insert = next.marker(doc, 1);\n                }\n                else {\n                    delTo = line.from + (next ? next.to : 0);\n                }\n                let changes = [{ from: delTo, to: pos, insert }];\n                if (inner.node.name == \"OrderedList\")\n                    renumberList(inner.item, doc, changes, -2);\n                if (next && next.node.name == \"OrderedList\")\n                    renumberList(next.item, doc, changes);\n                return { range: EditorSelection.cursor(delTo + insert.length), changes };\n            }\n            else { // Move this line down\n                let insert = \"\";\n                for (let i = 0, e = context.length - 2; i <= e; i++) {\n                    insert += context[i].blank(i < e ? countColumn(line.text, 4, context[i + 1].from) - insert.length : null, i < e);\n                }\n                insert = normalizeIndent(insert, state);\n                return { range: EditorSelection.cursor(pos + insert.length + 1),\n                    changes: { from: line.from, insert: insert + state.lineBreak } };\n            }\n        }\n        if (inner.node.name == \"Blockquote\" && emptyLine && line.from) {\n            let prevLine = doc.lineAt(line.from - 1), quoted = />\\s*$/.exec(prevLine.text);\n            // Two aligned empty quoted lines in a row\n            if (quoted && quoted.index == inner.from) {\n                let changes = state.changes([{ from: prevLine.from + quoted.index, to: prevLine.to },\n                    { from: line.from + inner.from, to: line.to }]);\n                return { range: range.map(changes), changes };\n            }\n        }\n        let changes = [];\n        if (inner.node.name == \"OrderedList\")\n            renumberList(inner.item, doc, changes);\n        let continued = inner.item && inner.item.from < line.from;\n        let insert = \"\";\n        // If not dedented\n        if (!continued || /^[\\s\\d.)\\-+*>]*/.exec(line.text)[0].length >= inner.to) {\n            for (let i = 0, e = context.length - 1; i <= e; i++) {\n                insert += i == e && !continued ? context[i].marker(doc, 1)\n                    : context[i].blank(i < e ? countColumn(line.text, 4, context[i + 1].from) - insert.length : null);\n            }\n        }\n        let from = pos;\n        while (from > line.from && /\\s/.test(line.text.charAt(from - line.from - 1)))\n            from--;\n        insert = normalizeIndent(insert, state);\n        changes.push({ from, to: pos, insert: state.lineBreak + insert });\n        return { range: EditorSelection.cursor(from + insert.length + 1), changes };\n    });\n    if (dont)\n        return false;\n    dispatch(state.update(changes, { scrollIntoView: true, userEvent: \"input\" }));\n    return true;\n};\nfunction isMark(node) {\n    return node.name == \"QuoteMark\" || node.name == \"ListMark\";\n}\nfunction contextNodeForDelete(tree, pos) {\n    let node = tree.resolveInner(pos, -1), scan = pos;\n    if (isMark(node)) {\n        scan = node.from;\n        node = node.parent;\n    }\n    for (let prev; prev = node.childBefore(scan);) {\n        if (isMark(prev)) {\n            scan = prev.from;\n        }\n        else if (prev.name == \"OrderedList\" || prev.name == \"BulletList\") {\n            node = prev.lastChild;\n            scan = node.to;\n        }\n        else {\n            break;\n        }\n    }\n    return node;\n}\n/**\nThis command will, when invoked in a Markdown context with the\ncursor directly after list or blockquote markup, delete one level\nof markup. When the markup is for a list, it will be replaced by\nspaces on the first invocation (a further invocation will delete\nthe spaces), to make it easy to continue a list.\n\nWhen not after Markdown block markup, this command will return\nfalse, so it is intended to be bound alongside other deletion\ncommands, with a higher precedence than the more generic commands.\n*/\nconst deleteMarkupBackward = ({ state, dispatch }) => {\n    let tree = syntaxTree(state);\n    let dont = null, changes = state.changeByRange(range => {\n        let pos = range.from, { doc } = state;\n        if (range.empty && markdownLanguage.isActiveAt(state, range.from)) {\n            let line = doc.lineAt(pos);\n            let context = getContext(contextNodeForDelete(tree, pos), doc);\n            if (context.length) {\n                let inner = context[context.length - 1];\n                let spaceEnd = inner.to - inner.spaceAfter.length + (inner.spaceAfter ? 1 : 0);\n                // Delete extra trailing space after markup\n                if (pos - line.from > spaceEnd && !/\\S/.test(line.text.slice(spaceEnd, pos - line.from)))\n                    return { range: EditorSelection.cursor(line.from + spaceEnd),\n                        changes: { from: line.from + spaceEnd, to: pos } };\n                if (pos - line.from == spaceEnd &&\n                    // Only apply this if we're on the line that has the\n                    // construct's syntax, or there's only indentation in the\n                    // target range\n                    (!inner.item || line.from <= inner.item.from || !/\\S/.test(line.text.slice(0, inner.to)))) {\n                    let start = line.from + inner.from;\n                    // Replace a list item marker with blank space\n                    if (inner.item && inner.node.from < inner.item.from && /\\S/.test(line.text.slice(inner.from, inner.to))) {\n                        let insert = inner.blank(countColumn(line.text, 4, inner.to) - countColumn(line.text, 4, inner.from));\n                        if (start == line.from)\n                            insert = normalizeIndent(insert, state);\n                        return { range: EditorSelection.cursor(start + insert.length),\n                            changes: { from: start, to: line.from + inner.to, insert } };\n                    }\n                    // Delete one level of indentation\n                    if (start < pos)\n                        return { range: EditorSelection.cursor(start), changes: { from: start, to: pos } };\n                }\n            }\n        }\n        return dont = { range };\n    });\n    if (dont)\n        return false;\n    dispatch(state.update(changes, { scrollIntoView: true, userEvent: \"delete\" }));\n    return true;\n};\n\n/**\nA small keymap with Markdown-specific bindings. Binds Enter to\n[`insertNewlineContinueMarkup`](https://codemirror.net/6/docs/ref/#lang-markdown.insertNewlineContinueMarkup)\nand Backspace to\n[`deleteMarkupBackward`](https://codemirror.net/6/docs/ref/#lang-markdown.deleteMarkupBackward).\n*/\nconst markdownKeymap = [\n    { key: \"Enter\", run: insertNewlineContinueMarkup },\n    { key: \"Backspace\", run: deleteMarkupBackward }\n];\nconst htmlNoMatch = /*@__PURE__*/html({ matchClosingTags: false });\n/**\nMarkdown language support.\n*/\nfunction markdown(config = {}) {\n    let { codeLanguages, defaultCodeLanguage, addKeymap = true, base: { parser } = commonmarkLanguage, completeHTMLTags = true } = config;\n    if (!(parser instanceof MarkdownParser))\n        throw new RangeError(\"Base parser provided to `markdown` should be a Markdown parser\");\n    let extensions = config.extensions ? [config.extensions] : [];\n    let support = [htmlNoMatch.support], defaultCode;\n    if (defaultCodeLanguage instanceof LanguageSupport) {\n        support.push(defaultCodeLanguage.support);\n        defaultCode = defaultCodeLanguage.language;\n    }\n    else if (defaultCodeLanguage) {\n        defaultCode = defaultCodeLanguage;\n    }\n    let codeParser = codeLanguages || defaultCode ? getCodeParser(codeLanguages, defaultCode) : undefined;\n    extensions.push(parseCode({ codeParser, htmlParser: htmlNoMatch.language.parser }));\n    if (addKeymap)\n        support.push(Prec.high(keymap.of(markdownKeymap)));\n    let lang = mkLang(parser.configure(extensions));\n    if (completeHTMLTags)\n        support.push(lang.data.of({ autocomplete: htmlTagCompletion }));\n    return new LanguageSupport(lang, support);\n}\nfunction htmlTagCompletion(context) {\n    let { state, pos } = context, m = /<[:\\-\\.\\w\\u00b7-\\uffff]*$/.exec(state.sliceDoc(pos - 25, pos));\n    if (!m)\n        return null;\n    let tree = syntaxTree(state).resolveInner(pos, -1);\n    while (tree && !tree.type.isTop) {\n        if (tree.name == \"CodeBlock\" || tree.name == \"FencedCode\" || tree.name == \"ProcessingInstructionBlock\" ||\n            tree.name == \"CommentBlock\" || tree.name == \"Link\" || tree.name == \"Image\")\n            return null;\n        tree = tree.parent;\n    }\n    return {\n        from: pos - m[0].length, to: pos,\n        options: htmlTagCompletions(),\n        validFor: /^<[:\\-\\.\\w\\u00b7-\\uffff]*$/\n    };\n}\nlet _tagCompletions = null;\nfunction htmlTagCompletions() {\n    if (_tagCompletions)\n        return _tagCompletions;\n    let result = htmlCompletionSource(new CompletionContext(EditorState.create({ extensions: htmlNoMatch }), 0, true));\n    return _tagCompletions = result ? result.options : [];\n}\n\nexport { commonmarkLanguage, deleteMarkupBackward, insertNewlineContinueMarkup, markdown, markdownKeymap, markdownLanguage };\n"],"names":["CompositeBlock","create","type","value","from","parentHash","end","constructor","hash","children","positions","this","hashProp","NodeProp","contextHash","addChild","child","pos","prop","Tree","length","push","toTree","nodeSet","last","Math","max","types","balance","makeTree","NodeType","none","Type","LeafBlock","start","content","marks","parsers","Line","text","baseIndent","basePos","depth","markers","indent","next","forward","forwardInner","newPos","skipSpace","countIndent","charCodeAt","reset","pop","moveBase","to","moveBaseColumn","findColumn","addMarker","elt","i","goal","scrub","result","slice","skipForList","bl","cx","line","block","stack","size","OrderedList","isOrderedList","isBulletList","BulletList","isHorizontalRule","DefaultSkipMarkup","Blockquote","QuoteMark","lineStart","space","ListItem","_cx","Document","ch","skipSpaceBack","isFencedCode","isBlockquote","breaking","count","isSetextUnderline","parser","leafBlockParsers","indexOf","DefaultLeafBlocks","SetextHeading","inList","isAtxHeading","EmptyLine","CommentEnd","ProcessingEnd","HTMLBlockStyle","isHTMLBlock","rest","e","test","getListIndent","indentAfter","indented","addCodeText","CodeText","DefaultBlockParsers","LinkReference","undefined","IndentedCode","base","pendingMarks","nextLine","m","codeStart","filter","concat","addNode","buffer","writeElements","finish","CodeBlock","FencedCode","fenceEnd","len","infoFrom","infoTo","CodeMark","CodeInfo","first","textStart","textEnd","prevLineEnd","startContext","HorizontalRule","newBase","ListMark","ATXHeading","off","endOfSpace","after","buf","write","HeaderMark","parseInline","node","ATXHeading1","HTMLBlock","trailing","nodeType","CommentBlock","ProcessingInstructionBlock","LinkReferenceParser","leaf","stage","elts","advance","complete","addLeafElement","nextStage","parseLinkLabel","LinkMark","skip","title","parseLinkTitle","titleEnd","lineEnd","parseURL","SetextHeadingParser","underline","underlineMark","SetextHeading1","SetextHeading2","_","DefaultEndLeaf","p","scanLineResult","BlockContext","input","fragments","ranges","atEnd","reusePlaceholders","Map","stoppedAt","rangeI","absoluteLineStart","absoluteLineEnd","FragmentCursor","readLine","parsedPos","markI","mark","finishContext","reuseFragment","blockParsers","parse","lines","stop","endLeafBlock","finishLeaf","stopAt","RangeError","moveTo","matches","taken","takeNodes","toRelative","moveRangeI","parentType","peekLine","scanLine","r","lineChunkAt","textOffset","nextFrom","handler","skipContextMarkup","Error","chunk","lineChunks","eol","startComposite","getNodeType","addElement","injectMarks","top","addGaps","tree","injectGaps","topNode","inline","Paragraph","TreeElement","Buffer","offset","dummies","rangeEnd","movePastNext","upto","inclusive","firstChild","nextSibling","reuse","get","propValues","MarkdownParser","Parser","blockNames","inlineParsers","inlineNames","wrappers","super","nodeTypes","Object","t","name","id","createParse","w","configure","spec","config","resolveConfig","nonEmpty","defineNodes","assign","styles","s","composite","style","some","group","define","props","Array","isArray","Tag","NodeSet","extend","styleTags","remove","rm","parseBlock","found","before","findName","splice","endLeaf","wrap","InlineContext","outer","char","token","resolveMarkers","a","conf","conc","b","wrapA","wrapB","inner","names","Escape","nodes","writeTo","build","reused","topID","Element","startOff","EmphasisUnderscore","resolve","EmphasisAsterisk","LinkStart","ImageStart","InlineDelimiter","side","Escapable","Punctuation","RegExp","DefaultInline","escaped","append","Entity","exec","InlineCode","curSize","HTMLTag","url","Autolink","URL","comment","Comment","procInst","ProcessingInstruction","Emphasis","pBefore","pAfter","sBefore","sAfter","leftFlanking","rightFlanking","canOpen","canClose","HardBreak","Link","Image","LinkEnd","parts","part","takeContent","link","finishLink","j","startPos","endPos","unshift","dest","label","LinkTitle","requireNonWS","min","LinkLabel","addDelimiter","open","close","hasOpenLink","emp","closeSize","k","element","findOpeningDelimiter","startIndex","elements","eI","NotLast","fragment","fragmentEnd","cursor","nextFragment","read","c","rPos","parent","childAfter","cur","fragEnd","openEnd","blockI","prevEnd","prevI","isAnonymous","dummy","set","is","abs","gapFrom","gapTo","markdownHighlighting","tags","quote","contentSeparator","heading1","heading2","heading3","heading4","heading5","heading6","escape","character","emphasis","strong","list","monospace","processingInstruction","labelName","string","keys","map","n","leftOverSpace","nextPos","StrikethroughDelim","Strikethrough","strikethrough","parseRow","startI","cellStart","cellEnd","esc","parseCell","hasPipe","str","delimiterLine","TableParser","rows","lineText","firstRow","Table","heading","TaskParser","TaskList","atom","autolinkRE","urlRE","lastTwoDomainWords","emailRE","xmppResourceRE","autolinkEmailEnd","lastIndex","GFM","absPos","index","autolinkURLEnd","parseSubSuper","Superscript","special","Subscript","Emoji","match","data","defineLanguageFacet","commentTokens","headingProp","commonmark","foldNodeProp","add","isHeading","state","doc","lineAt","indentNodeProp","languageDataProp","findSectionEnd","headerNode","level","headerIndent","foldService","of","syntaxTree","resolveInner","mkLang","Language","commonmarkLanguage","markdownLanguage","Context","spaceBefore","spaceAfter","item","blank","maxWidth","marker","number","String","itemNumber","getContext","context","replace","sliceString","renumberList","changes","prev","insert","normalizeIndent","facet","indentUnit","countColumn","insertNewlineContinueMarkup","dispatch","dont","changeByRange","range","empty","isActiveAt","emptyLine","delTo","EditorSelection","lineBreak","prevLine","quoted","continued","charAt","update","scrollIntoView","userEvent","isMark","deleteMarkupBackward","scan","childBefore","lastChild","contextNodeForDelete","spaceEnd","markdownKeymap","key","run","htmlNoMatch","html","matchClosingTags","markdown","codeLanguages","defaultCodeLanguage","addKeymap","completeHTMLTags","defaultCode","extensions","support","LanguageSupport","language","codeParser","languages","defaultLanguage","info","LanguageDescription","matchLanguageName","ParseContext","getSkippingParser","load","htmlParser","parseMixed","overlay","infoNode","getChild","parseCode","Prec","high","keymap","lang","autocomplete","htmlTagCompletion","sliceDoc","isTop","options","htmlTagCompletions","validFor","_tagCompletions","htmlCompletionSource","CompletionContext","EditorState"],"mappings":"4NAGA,MAAMA,EACF,aAAOC,CAAOC,EAAMC,EAAOC,EAAMC,EAAYC,GAEzC,OAAO,IAAIN,EAAeE,EAAMC,EAAOC,EAD3BC,GAAcA,GAAc,GAAKH,GAAQC,GAAS,GAAM,EACjBG,EAAK,GAAI,GAChE,CACA,WAAAC,CAAYL,EAEZC,EAAOC,EAAMI,EAAMF,EAAKG,EAAUC,GAC9BC,KAAKT,KAAOA,EACZS,KAAKR,MAAQA,EACbQ,KAAKP,KAAOA,EACZO,KAAKH,KAAOA,EACZG,KAAKL,IAAMA,EACXK,KAAKF,SAAWA,EAChBE,KAAKD,UAAYA,EACjBC,KAAKC,SAAW,CAAC,CAACC,EAASC,YAAaN,GAC5C,CACA,QAAAO,CAASC,EAAOC,GACRD,EAAME,KAAKL,EAASC,cAAgBH,KAAKH,OACzCQ,EAAQ,IAAIG,EAAKH,EAAMd,KAAMc,EAAMP,SAAUO,EAAMN,UAAWM,EAAMI,OAAQT,KAAKC,WACrFD,KAAKF,SAASY,KAAKL,GACnBL,KAAKD,UAAUW,KAAKJ,EACxB,CACA,MAAAK,CAAOC,EAASjB,EAAMK,KAAKL,KACvB,IAAIkB,EAAOb,KAAKF,SAASW,OAAS,EAGlC,OAFII,GAAQ,IACRlB,EAAMmB,KAAKC,IAAIpB,EAAKK,KAAKD,UAAUc,GAAQb,KAAKF,SAASe,GAAMJ,OAAST,KAAKP,OAC1E,IAAIe,EAAKI,EAAQI,MAAMhB,KAAKT,MAAOS,KAAKF,SAAUE,KAAKD,UAAWJ,EAAMK,KAAKP,MAAMwB,QAAQ,CAC9FC,SAAU,CAACpB,EAAUC,EAAWU,IAAW,IAAID,EAAKW,EAASC,KAAMtB,EAAUC,EAAWU,EAAQT,KAAKC,WAE7G,EAEJ,IAAIoB,GACJ,SAAWA,GACPA,EAAKA,EAAe,SAAI,GAAK,WAC7BA,EAAKA,EAAgB,UAAI,GAAK,YAC9BA,EAAKA,EAAiB,WAAI,GAAK,aAC/BA,EAAKA,EAAiB,WAAI,GAAK,aAC/BA,EAAKA,EAAqB,eAAI,GAAK,iBACnCA,EAAKA,EAAiB,WAAI,GAAK,aAC/BA,EAAKA,EAAkB,YAAI,GAAK,cAChCA,EAAKA,EAAe,SAAI,GAAK,WAC7BA,EAAKA,EAAkB,YAAI,GAAK,cAChCA,EAAKA,EAAkB,YAAI,IAAM,cACjCA,EAAKA,EAAkB,YAAI,IAAM,cACjCA,EAAKA,EAAkB,YAAI,IAAM,cACjCA,EAAKA,EAAkB,YAAI,IAAM,cACjCA,EAAKA,EAAkB,YAAI,IAAM,cACjCA,EAAKA,EAAqB,eAAI,IAAM,iBACpCA,EAAKA,EAAqB,eAAI,IAAM,iBACpCA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAoB,cAAI,IAAM,gBACnCA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAmB,aAAI,IAAM,eAClCA,EAAKA,EAAiC,2BAAI,IAAM,6BAEhDA,EAAKA,EAAa,OAAI,IAAM,SAC5BA,EAAKA,EAAa,OAAI,IAAM,SAC5BA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAqB,eAAI,IAAM,iBACpCA,EAAKA,EAAW,KAAI,IAAM,OAC1BA,EAAKA,EAAY,MAAI,IAAM,QAC3BA,EAAKA,EAAiB,WAAI,IAAM,aAChCA,EAAKA,EAAc,QAAI,IAAM,UAC7BA,EAAKA,EAAc,QAAI,IAAM,UAC7BA,EAAKA,EAA4B,sBAAI,IAAM,wBAC3CA,EAAKA,EAAe,SAAI,IAAM,WAE9BA,EAAKA,EAAiB,WAAI,IAAM,aAChCA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAmB,aAAI,IAAM,eAClCA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAU,IAAI,IAAM,KAC5B,CA/CD,CA+CGA,IAASA,EAAO,CAAA,IAKnB,MAAMC,EAIF,WAAA1B,CAIA2B,EAIAC,GACIxB,KAAKuB,MAAQA,EACbvB,KAAKwB,QAAUA,EAIfxB,KAAKyB,MAAQ,GAIbzB,KAAK0B,QAAU,EACnB,EAKJ,MAAMC,EACF,WAAA/B,GAIII,KAAK4B,KAAO,GAKZ5B,KAAK6B,WAAa,EAIlB7B,KAAK8B,QAAU,EAIf9B,KAAK+B,MAAQ,EAIb/B,KAAKgC,QAAU,GAKfhC,KAAKM,IAAM,EAIXN,KAAKiC,OAAS,EAIdjC,KAAKkC,MAAO,CAChB,CAIA,OAAAC,GACQnC,KAAK8B,QAAU9B,KAAKM,KACpBN,KAAKoC,cACb,CAIA,YAAAA,GACI,IAAIC,EAASrC,KAAKsC,UAAUtC,KAAK8B,SACjC9B,KAAKiC,OAASjC,KAAKuC,YAAYF,EAAQrC,KAAKM,IAAKN,KAAKiC,QACtDjC,KAAKM,IAAM+B,EACXrC,KAAKkC,KAAOG,GAAUrC,KAAK4B,KAAKnB,QAAS,EAAKT,KAAK4B,KAAKY,WAAWH,EACvE,CAMA,SAAAC,CAAU7C,GAAQ,OAAO6C,EAAUtC,KAAK4B,KAAMnC,EAAO,CAIrD,KAAAgD,CAAMb,GAKF,IAJA5B,KAAK4B,KAAOA,EACZ5B,KAAK6B,WAAa7B,KAAK8B,QAAU9B,KAAKM,IAAMN,KAAKiC,OAAS,EAC1DjC,KAAKoC,eACLpC,KAAK+B,MAAQ,EACN/B,KAAKgC,QAAQvB,QAChBT,KAAKgC,QAAQU,KACrB,CAOA,QAAAC,CAASC,GACL5C,KAAK8B,QAAUc,EACf5C,KAAK6B,WAAa7B,KAAKuC,YAAYK,EAAI5C,KAAKM,IAAKN,KAAKiC,OAC1D,CAIA,cAAAY,CAAeZ,GACXjC,KAAK6B,WAAaI,EAClBjC,KAAK8B,QAAU9B,KAAK8C,WAAWb,EACnC,CAMA,SAAAc,CAAUC,GACNhD,KAAKgC,QAAQtB,KAAKsC,EACtB,CAKA,WAAAT,CAAYK,EAAInD,EAAO,EAAGwC,EAAS,GAC/B,IAAK,IAAIgB,EAAIxD,EAAMwD,EAAIL,EAAIK,IACvBhB,GAAqC,GAA3BjC,KAAK4B,KAAKY,WAAWS,GAAU,EAAIhB,EAAS,EAAI,EAC9D,OAAOA,CACX,CAIA,UAAAa,CAAWI,GACP,IAAID,EAAI,EACR,IAAK,IAAIhB,EAAS,EAAGgB,EAAIjD,KAAK4B,KAAKnB,QAAUwB,EAASiB,EAAMD,IACxDhB,GAAqC,GAA3BjC,KAAK4B,KAAKY,WAAWS,GAAU,EAAIhB,EAAS,EAAI,EAC9D,OAAOgB,CACX,CAIA,KAAAE,GACI,IAAKnD,KAAK6B,WACN,OAAO7B,KAAK4B,KAChB,IAAIwB,EAAS,GACb,IAAK,IAAIH,EAAI,EAAGA,EAAIjD,KAAK8B,QAASmB,IAC9BG,GAAU,IACd,OAAOA,EAASpD,KAAK4B,KAAKyB,MAAMrD,KAAK8B,QACzC,EAEJ,SAASwB,EAAYC,EAAIC,EAAIC,GACzB,GAAIA,EAAKnD,KAAOmD,EAAK7B,KAAKnB,QACrB8C,GAAMC,EAAGE,OAASD,EAAKxB,QAAUuB,EAAGG,MAAMF,EAAK1B,MAAQ,GAAGvC,MAAQiE,EAAK5B,WACxE,OAAO,EACX,GAAI4B,EAAKxB,QAAUwB,EAAK5B,WAAa,EACjC,OAAO,EACX,IAAI+B,GAAQL,EAAGhE,MAAQ8B,EAAKwC,YAAcC,EAAgBC,GAAcN,EAAMD,GAAI,GAClF,OAAOI,EAAO,IACTL,EAAGhE,MAAQ8B,EAAK2C,YAAcC,EAAiBR,EAAMD,GAAI,GAAS,IACnEC,EAAK7B,KAAKY,WAAWiB,EAAKnD,IAAMsD,EAAO,IAAML,EAAG/D,KACxD,CACA,MAAM0E,EAAoB,CACtB,CAAC7C,EAAK8C,YAAW,CAACZ,EAAIC,EAAIC,IACL,IAAbA,EAAKvB,OAETuB,EAAKzB,QAAQtB,KAAKsC,GAAI3B,EAAK+C,UAAWZ,EAAGa,UAAYZ,EAAKnD,IAAKkD,EAAGa,UAAYZ,EAAKnD,IAAM,IACzFmD,EAAKd,SAASc,EAAKnD,KAAOgE,EAAMb,EAAK7B,KAAKY,WAAWiB,EAAKnD,IAAM,IAAM,EAAI,IAC1EiD,EAAG5D,IAAM6D,EAAGa,UAAYZ,EAAK7B,KAAKnB,QAC3B,GAEX,CAACY,EAAKkD,UAAS,CAAChB,EAAIiB,EAAKf,MACjBA,EAAKxB,OAASwB,EAAK5B,WAAa0B,EAAG/D,OAASiE,EAAKvB,MAAO,KAE5DuB,EAAKZ,eAAeY,EAAK5B,WAAa0B,EAAG/D,QAClC,GAEX,CAAC6B,EAAKwC,aAAcP,EACpB,CAACjC,EAAK2C,YAAaV,EACnB,CAACjC,EAAKoD,UAAS,KAAY,GAE/B,SAASH,EAAMI,GAAM,OAAa,IAANA,GAAkB,GAANA,GAAiB,IAANA,GAAkB,IAANA,CAAU,CACzE,SAASpC,EAAUmB,EAAMR,EAAI,GACzB,KAAOA,EAAIQ,EAAKhD,QAAU6D,EAAMb,EAAKjB,WAAWS,KAC5CA,IACJ,OAAOA,CACX,CACA,SAAS0B,EAAclB,EAAMR,EAAGL,GAC5B,KAAOK,EAAIL,GAAM0B,EAAMb,EAAKjB,WAAWS,EAAI,KACvCA,IACJ,OAAOA,CACX,CACA,SAAS2B,EAAanB,GAClB,GAAiB,IAAbA,EAAKvB,MAA2B,KAAbuB,EAAKvB,KACxB,OAAO,EACX,IAAI5B,EAAMmD,EAAKnD,IAAM,EACrB,KAAOA,EAAMmD,EAAK7B,KAAKnB,QAAUgD,EAAK7B,KAAKY,WAAWlC,IAAQmD,EAAKvB,MAC/D5B,IACJ,GAAIA,EAAMmD,EAAKnD,IAAM,EACjB,OAAO,EACX,GAAiB,IAAbmD,EAAKvB,KACL,IAAK,IAAIe,EAAI3C,EAAK2C,EAAIQ,EAAK7B,KAAKnB,OAAQwC,IACpC,GAA+B,IAA3BQ,EAAK7B,KAAKY,WAAWS,GACrB,OAAO,EACnB,OAAO3C,CACX,CACA,SAASuE,EAAapB,GAClB,OAAoB,IAAbA,EAAKvB,MAAuB,EAA2C,IAAtCuB,EAAK7B,KAAKY,WAAWiB,EAAKnD,IAAM,GAAW,EAAI,CAC3F,CACA,SAAS2D,EAAiBR,EAAMD,EAAIsB,GAChC,GAAiB,IAAbrB,EAAKvB,MAA2B,IAAbuB,EAAKvB,MAA2B,IAAbuB,EAAKvB,KAC3C,OAAO,EACX,IAAI6C,EAAQ,EACZ,IAAK,IAAIzE,EAAMmD,EAAKnD,IAAM,EAAGA,EAAMmD,EAAK7B,KAAKnB,OAAQH,IAAO,CACxD,IAAIoE,EAAKjB,EAAK7B,KAAKY,WAAWlC,GAC9B,GAAIoE,GAAMjB,EAAKvB,KACX6C,SACC,IAAKT,EAAMI,GACZ,OAAO,CACf,CAEA,OAAII,GAAyB,IAAbrB,EAAKvB,MAAc8C,EAAkBvB,IAAQ,GAAMA,EAAK1B,OAASyB,EAAGG,MAAMlD,QACtF+C,EAAGyB,OAAOC,iBAAiBC,QAAQC,GAAkBC,gBAAiB,GAEnEN,EAAQ,GADJ,EACa,CAC5B,CACA,SAASO,EAAO9B,EAAIjE,GAChB,IAAK,IAAI0D,EAAIO,EAAGG,MAAMlD,OAAS,EAAGwC,GAAK,EAAGA,IACtC,GAAIO,EAAGG,MAAMV,GAAG1D,MAAQA,EACpB,OAAO,EACf,OAAO,CACX,CACA,SAASwE,EAAaN,EAAMD,EAAIsB,GAC5B,OAAqB,IAAbrB,EAAKvB,MAA2B,IAAbuB,EAAKvB,MAA2B,IAAbuB,EAAKvB,MAC9CuB,EAAKnD,KAAOmD,EAAK7B,KAAKnB,OAAS,IAAK6D,EAAMb,EAAK7B,KAAKY,WAAWiB,EAAKnD,IAAM,QACzEwE,GAAYQ,EAAO9B,EAAInC,EAAK2C,aAAeP,EAAKnB,UAAUmB,EAAKnD,IAAM,GAAKmD,EAAK7B,KAAKnB,SAAc,EAAJ,CACxG,CACA,SAASqD,EAAcL,EAAMD,EAAIsB,GAC7B,IAAIxE,EAAMmD,EAAKnD,IAAK4B,EAAOuB,EAAKvB,KAChC,KACQA,GAAQ,IAAMA,GAAQ,IADrB,CAKL,GAHI5B,IAGAA,GAAOmD,EAAK7B,KAAKnB,OACjB,OAAO,EACXyB,EAAOuB,EAAK7B,KAAKY,WAAWlC,EAChC,CACA,OAAIA,GAAOmD,EAAKnD,KAAOA,EAAMmD,EAAKnD,IAAM,GAC3B,IAAR4B,GAAsB,IAARA,GACd5B,EAAMmD,EAAK7B,KAAKnB,OAAS,IAAM6D,EAAMb,EAAK7B,KAAKY,WAAWlC,EAAM,KACjEwE,IAAaQ,EAAO9B,EAAInC,EAAKwC,eACxBJ,EAAKnB,UAAUhC,EAAM,IAAMmD,EAAK7B,KAAKnB,QAAUH,EAAMmD,EAAKnD,IAAM,GAAkB,IAAbmD,EAAKvB,OACxE,EACJ5B,EAAM,EAAImD,EAAKnD,GAC1B,CACA,SAASiF,EAAa9B,GAClB,GAAiB,IAAbA,EAAKvB,KACL,OAAO,EACX,IAAI5B,EAAMmD,EAAKnD,IAAM,EACrB,KAAOA,EAAMmD,EAAK7B,KAAKnB,QAAuC,IAA7BgD,EAAK7B,KAAKY,WAAWlC,IAClDA,IACJ,GAAIA,EAAMmD,EAAK7B,KAAKnB,QAAuC,IAA7BgD,EAAK7B,KAAKY,WAAWlC,GAC/C,OAAO,EACX,IAAIsD,EAAOtD,EAAMmD,EAAKnD,IACtB,OAAOsD,EAAO,GAAI,EAAKA,CAC3B,CACA,SAASoB,EAAkBvB,GACvB,GAAiB,IAAbA,EAAKvB,MAA2B,IAAbuB,EAAKvB,MAAyBuB,EAAKxB,QAAUwB,EAAK5B,WAAa,EAClF,OAAO,EACX,IAAIvB,EAAMmD,EAAKnD,IAAM,EACrB,KAAOA,EAAMmD,EAAK7B,KAAKnB,QAAUgD,EAAK7B,KAAKY,WAAWlC,IAAQmD,EAAKvB,MAC/D5B,IACJ,IAAIX,EAAMW,EACV,KAAOA,EAAMmD,EAAK7B,KAAKnB,QAAU6D,EAAMb,EAAK7B,KAAKY,WAAWlC,KACxDA,IACJ,OAAOA,GAAOmD,EAAK7B,KAAKnB,OAASd,GAAM,CAC3C,CACA,MAAM6F,EAAY,WAAYC,EAAa,MAAOC,EAAgB,MAC5DC,EAAiB,CACnB,CAAC,oCAAqC,6BACtC,CAAC,WAAYF,GACb,CAAC,UAAWC,GACZ,CAAC,cAAe,KAChB,CAAC,kBAAmB,SACpB,CAAC,gYAAiYF,GAClY,CAAC,mHAAoHA,IAEzH,SAASI,EAAYnC,EAAMe,EAAKM,GAC5B,GAAiB,IAAbrB,EAAKvB,KACL,OAAO,EACX,IAAI2D,EAAOpC,EAAK7B,KAAKyB,MAAMI,EAAKnD,KAChC,IAAK,IAAI2C,EAAI,EAAG6C,EAAIH,EAAelF,QAAUqE,EAAW,EAAI,GAAI7B,EAAI6C,EAAG7C,IACnE,GAAI0C,EAAe1C,GAAG,GAAG8C,KAAKF,GAC1B,OAAO5C,EACf,OAAO,CACX,CACA,SAAS+C,EAAcvC,EAAMnD,GACzB,IAAI2F,EAAcxC,EAAKlB,YAAYjC,EAAKmD,EAAKnD,IAAKmD,EAAKxB,QACnDiE,EAAWzC,EAAKlB,YAAYkB,EAAKnB,UAAUhC,GAAMA,EAAK2F,GAC1D,OAAOC,GAAYD,EAAc,EAAIA,EAAc,EAAIC,CAC3D,CACA,SAASC,EAAY1E,EAAOhC,EAAMmD,GAC9B,IAAI/B,EAAOY,EAAMhB,OAAS,EACtBI,GAAQ,GAAKY,EAAMZ,GAAM+B,IAAMnD,GAAQgC,EAAMZ,GAAMtB,MAAQ8B,EAAK+E,SAChE3E,EAAMZ,GAAM+B,GAAKA,EAEjBnB,EAAMf,KAAKsC,GAAI3B,EAAK+E,SAAU3G,EAAMmD,GAC5C,CAKA,MAAMyD,EAAsB,CACxBC,mBAAeC,EACf,YAAAC,CAAahD,EAAIC,GACb,IAAIgD,EAAOhD,EAAK5B,WAAa,EAC7B,GAAI4B,EAAKxB,OAASwE,EACd,OAAO,EACX,IAAIlF,EAAQkC,EAAKX,WAAW2D,GACxBhH,EAAO+D,EAAGa,UAAY9C,EAAOqB,EAAKY,EAAGa,UAAYZ,EAAK7B,KAAKnB,OAC3DgB,EAAQ,GAAIiF,EAAe,GAE/B,IADAP,EAAY1E,EAAOhC,EAAMmD,GAClBY,EAAGmD,YAAclD,EAAK1B,OAASyB,EAAGG,MAAMlD,QAC3C,GAAIgD,EAAKnD,KAAOmD,EAAK7B,KAAKnB,OAAQ,CAC9B0F,EAAYO,EAAclD,EAAGa,UAAY,EAAGb,EAAGa,WAC/C,IAAK,IAAIuC,KAAKnD,EAAKzB,QACf0E,EAAahG,KAAKkG,EAC1B,KACK,IAAInD,EAAKxB,OAASwE,EACnB,MAEC,CACD,GAAIC,EAAajG,OAAQ,CACrB,IAAK,IAAImG,KAAKF,EACNE,EAAErH,MAAQ8B,EAAK+E,SACfD,EAAY1E,EAAOmF,EAAEnH,KAAMmH,EAAEhE,IAE7BnB,EAAMf,KAAKkG,GAEnBF,EAAe,EACnB,CACAP,EAAY1E,EAAO+B,EAAGa,UAAY,EAAGb,EAAGa,WACxC,IAAK,IAAIuC,KAAKnD,EAAKzB,QACfP,EAAMf,KAAKkG,GACfhE,EAAKY,EAAGa,UAAYZ,EAAK7B,KAAKnB,OAC9B,IAAIoG,EAAYrD,EAAGa,UAAYZ,EAAKX,WAAWW,EAAK5B,WAAa,GAC7DgF,EAAYjE,GACZuD,EAAY1E,EAAOoF,EAAWjE,EACtC,EAQJ,OANI8D,EAAajG,SACbiG,EAAeA,EAAaI,OAAOF,GAAKA,EAAErH,MAAQ8B,EAAK+E,UACnDM,EAAajG,SACbgD,EAAKzB,QAAU0E,EAAaK,OAAOtD,EAAKzB,WAEhDwB,EAAGwD,QAAQxD,EAAGyD,OAAOC,cAAczF,GAAQhC,GAAM0H,OAAO9F,EAAK+F,UAAWxE,EAAKnD,GAAOA,IAC7E,CACX,EACA,UAAA4H,CAAW7D,EAAIC,GACX,IAAI6D,EAAW1C,EAAanB,GAC5B,GAAI6D,EAAW,EACX,OAAO,EACX,IAAI7H,EAAO+D,EAAGa,UAAYZ,EAAKnD,IAAKoE,EAAKjB,EAAKvB,KAAMqF,EAAMD,EAAW7D,EAAKnD,IACtEkH,EAAW/D,EAAKnB,UAAUgF,GAAWG,EAAS9C,EAAclB,EAAK7B,KAAM6B,EAAK7B,KAAKnB,OAAQ+G,GACzF/F,EAAQ,CAACuB,GAAI3B,EAAKqG,SAAUjI,EAAMA,EAAO8H,IACzCC,EAAWC,GACXhG,EAAMf,KAAKsC,GAAI3B,EAAKsG,SAAUnE,EAAGa,UAAYmD,EAAUhE,EAAGa,UAAYoD,IAC1E,IAAK,IAAIG,GAAQ,EAAMpE,EAAGmD,YAAclD,EAAK1B,OAASyB,EAAGG,MAAMlD,OAAQmH,GAAQ,EAAO,CAClF,IAAI3E,EAAIQ,EAAKnD,IACb,GAAImD,EAAKxB,OAASwB,EAAK5B,WAAa,EAChC,KAAOoB,EAAIQ,EAAK7B,KAAKnB,QAAUgD,EAAK7B,KAAKY,WAAWS,IAAMyB,GACtDzB,IACR,GAAIA,EAAIQ,EAAKnD,KAAOiH,GAAO9D,EAAKnB,UAAUW,IAAMQ,EAAK7B,KAAKnB,OAAQ,CAC9D,IAAK,IAAImG,KAAKnD,EAAKzB,QACfP,EAAMf,KAAKkG,GACfnF,EAAMf,KAAKsC,GAAI3B,EAAKqG,SAAUlE,EAAGa,UAAYZ,EAAKnD,IAAKkD,EAAGa,UAAYpB,IACtEO,EAAGmD,WACH,KACJ,CACK,CACIiB,GACDzB,EAAY1E,EAAO+B,EAAGa,UAAY,EAAGb,EAAGa,WAC5C,IAAK,IAAIuC,KAAKnD,EAAKzB,QACfP,EAAMf,KAAKkG,GACf,IAAIiB,EAAYrE,EAAGa,UAAYZ,EAAK3B,QAASgG,EAAUtE,EAAGa,UAAYZ,EAAK7B,KAAKnB,OAC5EoH,EAAYC,GACZ3B,EAAY1E,EAAOoG,EAAWC,EACtC,CACJ,CAGA,OAFAtE,EAAGwD,QAAQxD,EAAGyD,OAAOC,cAAczF,GAAQhC,GACtC0H,OAAO9F,EAAKgG,WAAY7D,EAAGuE,cAAgBtI,GAAOA,IAChD,CACX,EACA,UAAA0E,CAAWX,EAAIC,GACX,IAAIG,EAAOiB,EAAapB,GACxB,QAAIG,EAAO,KAEXJ,EAAGwE,aAAa3G,EAAK8C,WAAYV,EAAKnD,KACtCkD,EAAGwD,QAAQ3F,EAAK+C,UAAWZ,EAAGa,UAAYZ,EAAKnD,IAAKkD,EAAGa,UAAYZ,EAAKnD,IAAM,GAC9EmD,EAAKd,SAASc,EAAKnD,IAAMsD,GAClB,KACX,EACA,cAAAqE,CAAezE,EAAIC,GACf,GAAIQ,EAAiBR,EAAMD,GAAI,GAAS,EACpC,OAAO,EACX,IAAI/D,EAAO+D,EAAGa,UAAYZ,EAAKnD,IAG/B,OAFAkD,EAAGmD,WACHnD,EAAGwD,QAAQ3F,EAAK4G,eAAgBxI,IACzB,CACX,EACA,UAAAuE,CAAWR,EAAIC,GACX,IAAIG,EAAOG,EAAaN,EAAMD,GAAI,GAClC,GAAII,EAAO,EACP,OAAO,EACPJ,EAAGE,MAAMnE,MAAQ8B,EAAK2C,YACtBR,EAAGwE,aAAa3G,EAAK2C,WAAYP,EAAK3B,QAAS2B,EAAKvB,MACxD,IAAIgG,EAAUlC,EAAcvC,EAAMA,EAAKnD,IAAM,GAI7C,OAHAkD,EAAGwE,aAAa3G,EAAKkD,SAAUd,EAAK3B,QAASoG,EAAUzE,EAAK5B,YAC5D2B,EAAGwD,QAAQ3F,EAAK8G,SAAU3E,EAAGa,UAAYZ,EAAKnD,IAAKkD,EAAGa,UAAYZ,EAAKnD,IAAMsD,GAC7EH,EAAKZ,eAAeqF,GACb,IACX,EACA,WAAArE,CAAYL,EAAIC,GACZ,IAAIG,EAAOE,EAAcL,EAAMD,GAAI,GACnC,GAAII,EAAO,EACP,OAAO,EACPJ,EAAGE,MAAMnE,MAAQ8B,EAAKwC,aACtBL,EAAGwE,aAAa3G,EAAKwC,YAAaJ,EAAK3B,QAAS2B,EAAK7B,KAAKY,WAAWiB,EAAKnD,IAAMsD,EAAO,IAC3F,IAAIsE,EAAUlC,EAAcvC,EAAMA,EAAKnD,IAAMsD,GAI7C,OAHAJ,EAAGwE,aAAa3G,EAAKkD,SAAUd,EAAK3B,QAASoG,EAAUzE,EAAK5B,YAC5D2B,EAAGwD,QAAQ3F,EAAK8G,SAAU3E,EAAGa,UAAYZ,EAAKnD,IAAKkD,EAAGa,UAAYZ,EAAKnD,IAAMsD,GAC7EH,EAAKZ,eAAeqF,GACb,IACX,EACA,UAAAE,CAAW5E,EAAIC,GACX,IAAIG,EAAO2B,EAAa9B,GACxB,GAAIG,EAAO,EACP,OAAO,EACX,IAAIyE,EAAM5E,EAAKnD,IAAKb,EAAO+D,EAAGa,UAAYgE,EACtCC,EAAa3D,EAAclB,EAAK7B,KAAM6B,EAAK7B,KAAKnB,OAAQ4H,GAAME,EAAQD,EAC1E,KAAOC,EAAQF,GAAO5E,EAAK7B,KAAKY,WAAW+F,EAAQ,IAAM9E,EAAKvB,MAC1DqG,IACAA,GAASD,GAAcC,GAASF,GAAQ/D,EAAMb,EAAK7B,KAAKY,WAAW+F,EAAQ,MAC3EA,EAAQ9E,EAAK7B,KAAKnB,QACtB,IAAI+H,EAAMhF,EAAGyD,OACRwB,MAAMpH,EAAKqH,WAAY,EAAG9E,GAC1BsD,cAAc1D,EAAGyB,OAAO0D,YAAYlF,EAAK7B,KAAKyB,MAAMgF,EAAMzE,EAAO,EAAG2E,GAAQ9I,EAAOmE,EAAO,IAAKnE,GAChG8I,EAAQ9E,EAAK7B,KAAKnB,QAClB+H,EAAIC,MAAMpH,EAAKqH,WAAYH,EAAQF,EAAKC,EAAaD,GACzD,IAAIO,EAAOJ,EAAIrB,OAAO9F,EAAKwH,YAAc,EAAIjF,EAAMH,EAAK7B,KAAKnB,OAAS4H,GAGtE,OAFA7E,EAAGmD,WACHnD,EAAGwD,QAAQ4B,EAAMnJ,IACV,CACX,EACA,SAAAqJ,CAAUtF,EAAIC,GACV,IAAIlE,EAAOqG,EAAYnC,EAAMD,GAAI,GACjC,GAAIjE,EAAO,EACP,OAAO,EACX,IAAIE,EAAO+D,EAAGa,UAAYZ,EAAKnD,IAAKX,EAAMgG,EAAepG,GAAM,GAC3DkC,EAAQ,GAAIsH,EAAWpJ,GAAO6F,EAClC,MAAQ7F,EAAIoG,KAAKtC,EAAK7B,OAAS4B,EAAGmD,YAAY,CAC1C,GAAIlD,EAAK1B,MAAQyB,EAAGG,MAAMlD,OAAQ,CAC9BsI,GAAW,EACX,KACJ,CACA,IAAK,IAAInC,KAAKnD,EAAKzB,QACfP,EAAMf,KAAKkG,EACnB,CACImC,GACAvF,EAAGmD,WACP,IAAIqC,EAAWrJ,GAAO8F,EAAapE,EAAK4H,aAAetJ,GAAO+F,EAAgBrE,EAAK6H,2BAA6B7H,EAAKyH,UACjHlG,EAAKY,EAAGuE,cAEZ,OADAvE,EAAGwD,QAAQxD,EAAGyD,OAAOC,cAAczF,GAAQhC,GAAM0H,OAAO6B,EAAUpG,EAAKnD,GAAOA,IACvE,CACX,EACA4F,mBAAekB,GAOnB,MAAM4C,EACF,WAAAvJ,CAAYwJ,GACRpJ,KAAKqJ,MAAQ,EACbrJ,KAAKsJ,KAAO,GACZtJ,KAAKM,IAAM,EACXN,KAAKuB,MAAQ6H,EAAK7H,MAClBvB,KAAKuJ,QAAQH,EAAK5H,QACtB,CACA,QAAAmF,CAASnD,EAAIC,EAAM2F,GACf,IAAkB,GAAdpJ,KAAKqJ,MACL,OAAO,EACX,IAAI7H,EAAU4H,EAAK5H,QAAU,KAAOiC,EAAKN,QACrCgE,EAASnH,KAAKuJ,QAAQ/H,GAC1B,OAAI2F,GAAS,GAAMA,EAAS3F,EAAQf,QACzBT,KAAKwJ,SAAShG,EAAI4F,EAAMjC,EAEvC,CACA,MAAAA,CAAO3D,EAAI4F,GACP,OAAmB,GAAdpJ,KAAKqJ,OAAgD,GAAdrJ,KAAKqJ,QAAoC/G,EAAU8G,EAAK5H,QAASxB,KAAKM,MAAQ8I,EAAK5H,QAAQf,QAC5HT,KAAKwJ,SAAShG,EAAI4F,EAAMA,EAAK5H,QAAQf,OAEpD,CACA,QAAA+I,CAAShG,EAAI4F,EAAM7B,GAEf,OADA/D,EAAGiG,eAAeL,EAAMpG,GAAI3B,EAAKiF,cAAetG,KAAKuB,MAAOvB,KAAKuB,MAAQgG,EAAKvH,KAAKsJ,QAC5E,CACX,CACA,SAAAI,CAAU1G,GACN,OAAIA,GACAhD,KAAKM,IAAM0C,EAAIJ,GAAK5C,KAAKuB,MACzBvB,KAAKsJ,KAAK5I,KAAKsC,GACfhD,KAAKqJ,SACE,KAEC,IAARrG,IACAhD,KAAKqJ,OAAQ,IACV,EACX,CACA,OAAAE,CAAQ/H,GACJ,OAAS,CACL,OAAIxB,KAAKqJ,MACL,OAAO,EAEN,GAAkB,GAAdrJ,KAAKqJ,MAAiC,CAC3C,IAAKrJ,KAAK0J,UAAUC,GAAenI,EAASxB,KAAKM,IAAKN,KAAKuB,OAAO,IAC9D,OAAO,EACX,GAAoC,IAAhCC,EAAQgB,WAAWxC,KAAKM,KACxB,OAAON,KAAKqJ,OAAQ,EACxBrJ,KAAKsJ,KAAK5I,KAAKsC,GAAI3B,EAAKuI,SAAU5J,KAAKM,IAAMN,KAAKuB,MAAOvB,KAAKM,IAAMN,KAAKuB,MAAQ,IACjFvB,KAAKM,KACT,KACK,IAAkB,GAAdN,KAAKqJ,MAIT,IAAkB,GAAdrJ,KAAKqJ,MAAgC,CAC1C,IAAIQ,EAAOvH,EAAUd,EAASxB,KAAKM,KAAMX,EAAM,EAC/C,GAAIkK,EAAO7J,KAAKM,IAAK,CACjB,IAAIwJ,EAAQC,GAAevI,EAASqI,EAAM7J,KAAKuB,OAC/C,GAAIuI,EAAO,CACP,IAAIE,EAAWC,GAAQzI,EAASsI,EAAMlH,GAAK5C,KAAKuB,OAC5CyI,EAAW,IACXhK,KAAK0J,UAAUI,GACfnK,EAAMqK,EAEd,CACJ,CAGA,OAFKrK,IACDA,EAAMsK,GAAQzI,EAASxB,KAAKM,MACzBX,EAAM,GAAKA,EAAM6B,EAAQf,OAASd,GAAM,CACnD,CAEI,OAAOsK,GAAQzI,EAASxB,KAAKM,IACjC,CArBI,IAAKN,KAAK0J,UAAUQ,GAAS1I,EAASc,EAAUd,EAASxB,KAAKM,KAAMN,KAAKuB,QACrE,OAAO,CAoBf,CACJ,CACJ,EAEJ,SAAS0I,GAAQrI,EAAMtB,GACnB,KAAOA,EAAMsB,EAAKnB,OAAQH,IAAO,CAC7B,IAAI4B,EAAON,EAAKY,WAAWlC,GAC3B,GAAY,IAAR4B,EACA,MACJ,IAAKoC,EAAMpC,GACP,OAAO,CACf,CACA,OAAO5B,CACX,CACA,MAAM6J,GACF,QAAAxD,CAASnD,EAAIC,EAAM2F,GACf,IAAIgB,EAAY3G,EAAK1B,MAAQyB,EAAGG,MAAMlD,QAAS,EAAKuE,EAAkBvB,GAClEvB,EAAOuB,EAAKvB,KAChB,GAAIkI,EAAY,EACZ,OAAO,EACX,IAAIC,EAAgBrH,GAAI3B,EAAKqH,WAAYlF,EAAGa,UAAYZ,EAAKnD,IAAKkD,EAAGa,UAAY+F,GAMjF,OALA5G,EAAGmD,WACHnD,EAAGiG,eAAeL,EAAMpG,GAAY,IAARd,EAAab,EAAKiJ,eAAiBjJ,EAAKkJ,eAAgBnB,EAAK7H,MAAOiC,EAAGuE,cAAe,IAC3GvE,EAAGyB,OAAO0D,YAAYS,EAAK5H,QAAS4H,EAAK7H,OAC5C8I,MAEG,CACX,CACA,MAAAlD,GACI,OAAO,CACX,EAEJ,MAAM/B,GAAoB,CACtBkB,cAAa,CAACkE,EAAGpB,IAA6C,IAA9BA,EAAK5H,QAAQgB,WAAW,GAAqB,IAAI2G,EAAoBC,GAAQ,KAC7G/D,cAAa,IAAY,IAAI8E,IAE3BM,GAAiB,CACnB,CAACD,EAAG/G,IAAS8B,EAAa9B,IAAS,EACnC,CAAC+G,EAAG/G,IAASmB,EAAanB,IAAS,EACnC,CAAC+G,EAAG/G,IAASoB,EAAapB,IAAS,EACnC,CAACiH,EAAGjH,IAASM,EAAaN,EAAMiH,GAAG,IAAS,EAC5C,CAACA,EAAGjH,IAASK,EAAcL,EAAMiH,GAAG,IAAS,EAC7C,CAACA,EAAGjH,IAASQ,EAAiBR,EAAMiH,GAAG,IAAS,EAChD,CAACA,EAAGjH,IAASmC,EAAYnC,EAAMiH,GAAG,IAAS,GAEzCC,GAAiB,CAAE/I,KAAM,GAAIjC,IAAK,GAIxC,MAAMiL,GAIF,WAAAhL,CAIAqF,EAIA4F,EAAOC,EAIPC,GACI/K,KAAKiF,OAASA,EACdjF,KAAK6K,MAAQA,EACb7K,KAAK+K,OAASA,EACd/K,KAAKyD,KAAO,IAAI9B,EAChB3B,KAAKgL,OAAQ,EAObhL,KAAKiL,kBAAoB,IAAIC,IAC7BlL,KAAKmL,UAAY,KAIjBnL,KAAKoL,OAAS,EACdpL,KAAK4C,GAAKmI,EAAOA,EAAOtK,OAAS,GAAGmC,GACpC5C,KAAKqE,UAAYrE,KAAKqL,kBAAoBrL,KAAKsL,gBAAkBP,EAAO,GAAGtL,KAC3EO,KAAK0D,MAAQrE,EAAeC,OAAO+B,EAAKoD,SAAU,EAAGzE,KAAKqE,UAAW,EAAG,GACxErE,KAAK2D,MAAQ,CAAC3D,KAAK0D,OACnB1D,KAAK8K,UAAYA,EAAUrK,OAAS,IAAI8K,GAAeT,EAAWD,GAAS,KAC3E7K,KAAKwL,UACT,CACA,aAAIC,GACA,OAAOzL,KAAKqL,iBAChB,CACA,OAAA9B,GACI,GAAsB,MAAlBvJ,KAAKmL,WAAqBnL,KAAKqL,kBAAoBrL,KAAKmL,UACxD,OAAOnL,KAAKmH,SAChB,IAAI1D,KAAEA,GAASzD,KACf,OAAS,CACL,IAAK,IAAI0L,EAAQ,IAAK,CAClB,IAAIxJ,EAAOuB,EAAK1B,MAAQ/B,KAAK2D,MAAMlD,OAAST,KAAK2D,MAAM3D,KAAK2D,MAAMlD,OAAS,GAAK,KAChF,KAAOiL,EAAQjI,EAAKzB,QAAQvB,UAAYyB,GAAQuB,EAAKzB,QAAQ0J,GAAOjM,KAAOyC,EAAKvC,MAAM,CAClF,IAAIgM,EAAOlI,EAAKzB,QAAQ0J,KACxB1L,KAAKgH,QAAQ2E,EAAKpM,KAAMoM,EAAKlM,KAAMkM,EAAK/I,GAC5C,CACA,IAAKV,EACD,MACJlC,KAAK4L,eACT,CACA,GAAInI,EAAKnD,IAAMmD,EAAK7B,KAAKnB,OACrB,MAEJ,IAAKT,KAAK2G,WACN,OAAO3G,KAAKmH,QACpB,CACA,GAAInH,KAAK8K,WAAa9K,KAAK6L,cAAcpI,EAAK3B,SAC1C,OAAO,KACXP,EAAO,OAAS,CACZ,IAAK,IAAIhC,KAAQS,KAAKiF,OAAO6G,aACzB,GAAIvM,EAAM,CACN,IAAI6D,EAAS7D,EAAKS,KAAMyD,GACxB,GAAc,GAAVL,EAAiB,CACjB,GAAc,GAAVA,EACA,OAAO,KACXK,EAAKtB,UACL,SAASZ,CACb,CACJ,CACJ,KACJ,CACA,IAAI6H,EAAO,IAAI9H,EAAUtB,KAAKqE,UAAYZ,EAAKnD,IAAKmD,EAAK7B,KAAKyB,MAAMI,EAAKnD,MACzE,IAAK,IAAIyL,KAAS/L,KAAKiF,OAAOC,iBAC1B,GAAI6G,EAAO,CACP,IAAI9G,EAAS8G,EAAM/L,KAAMoJ,GACrBnE,GACAmE,EAAK1H,QAAQhB,KAAKuE,EAC1B,CACJ+G,EAAO,KAAOhM,KAAK2G,YACXlD,EAAKnD,KAAOmD,EAAK7B,KAAKnB,QADC,CAG3B,GAAIgD,EAAKxB,OAASwB,EAAK5B,WAAa,EAChC,IAAK,IAAIoK,KAAQjM,KAAKiF,OAAOiH,aACzB,GAAID,EAAKjM,KAAMyD,EAAM2F,GACjB,MAAM4C,EAElB,IAAK,IAAI/G,KAAUmE,EAAK1H,QACpB,GAAIuD,EAAO0B,SAAS3G,KAAMyD,EAAM2F,GAC5B,OAAO,KACfA,EAAK5H,SAAW,KAAOiC,EAAKN,QAC5B,IAAK,IAAIyD,KAAKnD,EAAKzB,QACfoH,EAAK3H,MAAMf,KAAKkG,EACxB,CAEA,OADA5G,KAAKmM,WAAW/C,GACT,IACX,CACA,MAAAgD,CAAO9L,GACH,GAAsB,MAAlBN,KAAKmL,WAAqBnL,KAAKmL,UAAY7K,EAC3C,MAAM,IAAI+L,WAAW,gCACzBrM,KAAKmL,UAAY7K,CACrB,CACA,aAAAuL,CAActK,GACV,IAAKvB,KAAK8K,UAAUwB,OAAOtM,KAAKqL,kBAAoB9J,EAAOvB,KAAKqL,qBAC3DrL,KAAK8K,UAAUyB,QAAQvM,KAAK0D,MAAM7D,MACnC,OAAO,EACX,IAAI2M,EAAQxM,KAAK8K,UAAU2B,UAAUzM,MACrC,QAAKwM,IAELxM,KAAKqL,mBAAqBmB,EAC1BxM,KAAKqE,UAAYqI,GAAW1M,KAAKqL,kBAAmBrL,KAAK+K,QACzD/K,KAAK2M,aACD3M,KAAKqL,kBAAoBrL,KAAK4C,IAC9B5C,KAAKqE,YACLrE,KAAKqL,oBACLrL,KAAKwL,aAGLxL,KAAKgL,OAAQ,EACbhL,KAAKwL,aAEF,EACX,CAIA,SAAIzJ,GACA,OAAO/B,KAAK2D,MAAMlD,MACtB,CAKA,UAAAmM,CAAW7K,EAAQ/B,KAAK+B,MAAQ,GAC5B,OAAO/B,KAAKiF,OAAOrE,QAAQI,MAAMhB,KAAK2D,MAAM5B,GAAOxC,KACvD,CAQA,QAAAoH,GAEI,OADA3G,KAAKqE,WAAarE,KAAKyD,KAAK7B,KAAKnB,OAC7BT,KAAKsL,iBAAmBtL,KAAK4C,IAC7B5C,KAAKqL,kBAAoBrL,KAAKsL,gBAC9BtL,KAAKgL,OAAQ,EACbhL,KAAKwL,YACE,IAGPxL,KAAKqE,YACLrE,KAAKqL,kBAAoBrL,KAAKsL,gBAAkB,EAChDtL,KAAK2M,aACL3M,KAAKwL,YACE,EAEf,CAKA,QAAAqB,GACI,OAAO7M,KAAK8M,SAAS9M,KAAKsL,gBAAkB,GAAG1J,IACnD,CACA,UAAA+K,GACI,KAAO3M,KAAKoL,OAASpL,KAAK+K,OAAOtK,OAAS,GAAKT,KAAKqL,mBAAqBrL,KAAK+K,OAAO/K,KAAKoL,QAAQxI,IAC9F5C,KAAKoL,SACLpL,KAAKqL,kBAAoBvK,KAAKC,IAAIf,KAAKqL,kBAAmBrL,KAAK+K,OAAO/K,KAAKoL,QAAQ3L,KAE3F,CAKA,QAAAqN,CAASvL,GACL,IAAIwL,EAAIpC,GAER,GADAoC,EAAEpN,IAAM4B,EACJA,GAASvB,KAAK4C,GACdmK,EAAEnL,KAAO,QAKT,GAFAmL,EAAEnL,KAAO5B,KAAKgN,YAAYzL,GAC1BwL,EAAEpN,KAAOoN,EAAEnL,KAAKnB,OACZT,KAAK+K,OAAOtK,OAAS,EAAG,CACxB,IAAIwM,EAAajN,KAAKqL,kBAAmBD,EAASpL,KAAKoL,OACvD,KAAOpL,KAAK+K,OAAOK,GAAQxI,GAAKmK,EAAEpN,KAAK,CACnCyL,IACA,IAAI8B,EAAWlN,KAAK+K,OAAOK,GAAQ3L,KAC/B8I,EAAQvI,KAAKgN,YAAYE,GAC7BH,EAAEpN,IAAMuN,EAAW3E,EAAM9H,OACzBsM,EAAEnL,KAAOmL,EAAEnL,KAAKyB,MAAM,EAAGrD,KAAK+K,OAAOK,EAAS,GAAGxI,GAAKqK,GAAc1E,EACpE0E,EAAaF,EAAEpN,IAAMoN,EAAEnL,KAAKnB,MAChC,CACJ,CAEJ,OAAOsM,CACX,CAMA,QAAAvB,GACI,IAAI/H,KAAEA,GAASzD,MAAM4B,KAAEA,EAAIjC,IAAEA,GAAQK,KAAK8M,SAAS9M,KAAKqL,mBAGxD,IAFArL,KAAKsL,gBAAkB3L,EACvB8D,EAAKhB,MAAMb,GACJ6B,EAAK1B,MAAQ/B,KAAK2D,MAAMlD,OAAQgD,EAAK1B,QAAS,CACjD,IAAIyB,EAAKxD,KAAK2D,MAAMF,EAAK1B,OAAQoL,EAAUnN,KAAKiF,OAAOmI,kBAAkB5J,EAAGjE,MAC5E,IAAK4N,EACD,MAAM,IAAIE,MAAM,2BAA6BhM,EAAKmC,EAAGjE,OACzD,IAAK4N,EAAQ3J,EAAIxD,KAAMyD,GACnB,MACJA,EAAKtB,SACT,CACJ,CACA,WAAA6K,CAAY1M,GACR,IAAkCsB,EAA9BM,EAAOlC,KAAK6K,MAAMyC,MAAMhN,GAC5B,GAAKN,KAAK6K,MAAM0C,WAKZ3L,EAAe,MAARM,EAAe,GAAKA,MALH,CACxB,IAAIsL,EAAMtL,EAAKiD,QAAQ,MACvBvD,EAAO4L,EAAM,EAAItL,EAAOA,EAAKmB,MAAM,EAAGmK,EAC1C,CAIA,OAAOlN,EAAMsB,EAAKnB,OAAST,KAAK4C,GAAKhB,EAAKyB,MAAM,EAAGrD,KAAK4C,GAAKtC,GAAOsB,CACxE,CAIA,WAAAmG,GAAgB,OAAO/H,KAAKgL,MAAQhL,KAAKqE,UAAYrE,KAAKqE,UAAY,CAAG,CAIzE,YAAA2D,CAAazI,EAAMgC,EAAO/B,EAAQ,GAC9BQ,KAAK0D,MAAQrE,EAAeC,OAAOC,EAAMC,EAAOQ,KAAKqE,UAAY9C,EAAOvB,KAAK0D,MAAM7D,KAAMG,KAAKqE,UAAYrE,KAAKyD,KAAK7B,KAAKnB,QACzHT,KAAK2D,MAAMjD,KAAKV,KAAK0D,MACzB,CAKA,cAAA+J,CAAelO,EAAMgC,EAAO/B,EAAQ,GAChCQ,KAAKgI,aAAahI,KAAKiF,OAAOyI,YAAYnO,GAAOgC,EAAO/B,EAC5D,CAIA,OAAAwH,CAAQtD,EAAOjE,EAAMmD,GACG,iBAATc,IACPA,EAAQ,IAAIlD,EAAKR,KAAKiF,OAAOrE,QAAQI,MAAM0C,GAAQtC,GAAMA,IAAOwB,QAA+BA,EAAK5C,KAAK+H,eAAiBtI,IAC9HO,KAAK0D,MAAMtD,SAASsD,EAAOjE,EAAOO,KAAK0D,MAAMjE,KACjD,CAKA,UAAAkO,CAAW3K,GACPhD,KAAK0D,MAAMtD,SAAS4C,EAAIrC,OAAOX,KAAKiF,OAAOrE,SAAUoC,EAAIvD,KAAOO,KAAK0D,MAAMjE,KAC/E,CAMA,cAAAgK,CAAeL,EAAMpG,GACjBhD,KAAKgH,QAAQhH,KAAKiH,OACbC,cAAc0G,GAAY5K,EAAIlD,SAAUsJ,EAAK3H,QAASuB,EAAIvD,MAC1D0H,OAAOnE,EAAIzD,KAAMyD,EAAIJ,GAAKI,EAAIvD,MAAOuD,EAAIvD,KAClD,CAIA,aAAAmM,GACI,IAAIpI,EAAKxD,KAAK2D,MAAMjB,MAChBmL,EAAM7N,KAAK2D,MAAM3D,KAAK2D,MAAMlD,OAAS,GACzCoN,EAAIzN,SAASoD,EAAG7C,OAAOX,KAAKiF,OAAOrE,SAAU4C,EAAG/D,KAAOoO,EAAIpO,MAC3DO,KAAK0D,MAAQmK,CACjB,CACA,MAAA1G,GACI,KAAOnH,KAAK2D,MAAMlD,OAAS,GACvBT,KAAK4L,gBACT,OAAO5L,KAAK8N,QAAQ9N,KAAK0D,MAAM/C,OAAOX,KAAKiF,OAAOrE,QAASZ,KAAKqE,WACpE,CACA,OAAAyJ,CAAQC,GACJ,OAAO/N,KAAK+K,OAAOtK,OAAS,EACxBuN,GAAWhO,KAAK+K,OAAQ,EAAGgD,EAAKE,QAASjO,KAAK+K,OAAO,GAAGtL,KAAMO,KAAKiL,mBAAqB8C,CAChG,CAIA,UAAA5B,CAAW/C,GACP,IAAK,IAAInE,KAAUmE,EAAK1H,QACpB,GAAIuD,EAAOkC,OAAOnH,KAAMoJ,GACpB,OACR,IAAI8E,EAASN,GAAY5N,KAAKiF,OAAO0D,YAAYS,EAAK5H,QAAS4H,EAAK7H,OAAQ6H,EAAK3H,OACjFzB,KAAKgH,QAAQhH,KAAKiH,OACbC,cAAcgH,GAAS9E,EAAK7H,OAC5B4F,OAAO9F,EAAK8M,UAAW/E,EAAK5H,QAAQf,QAAS2I,EAAK7H,MAC3D,CACA,GAAAyB,CAAIzD,EAAME,EAAMmD,EAAI9C,GAChB,MAAmB,iBAARP,EACAyD,GAAIhD,KAAKiF,OAAOyI,YAAYnO,GAAOE,EAAMmD,EAAI9C,GACjD,IAAIsO,GAAY7O,EAAME,EACjC,CAIA,UAAIwH,GAAW,OAAO,IAAIoH,GAAOrO,KAAKiF,OAAOrE,QAAU,EAE3D,SAASoN,GAAWjD,EAAQK,EAAQ2C,EAAMO,EAAQC,GAC9C,IAAIC,EAAWzD,EAAOK,GAAQxI,GAC1B9C,EAAW,GAAIC,EAAY,GAAIwB,EAAQwM,EAAKtO,KAAO6O,EACvD,SAASG,EAAaC,EAAMC,GACxB,KAAOA,EAAYD,GAAQF,EAAWE,EAAOF,GAAU,CACnD,IAAI5K,EAAOmH,EAAOK,EAAS,GAAG3L,KAAO+O,EACrCF,GAAU1K,EACV8K,GAAQ9K,EACRwH,IACAoD,EAAWzD,EAAOK,GAAQxI,EAC9B,CACJ,CACA,IAAK,IAAI8B,EAAKqJ,EAAKa,WAAYlK,EAAIA,EAAKA,EAAGmK,YAAa,CACpDJ,EAAa/J,EAAGjF,KAAO6O,GAAQ,GAC/B,IAA6B1F,EAAzBnJ,EAAOiF,EAAGjF,KAAO6O,EAAcQ,EAAQP,EAAQQ,IAAIrK,EAAGqJ,MACtDe,EACAlG,EAAOkG,EAEFpK,EAAG9B,GAAK0L,EAASE,GACtB5F,EAAOoF,GAAWjD,EAAQK,EAAQ1G,EAAI4J,EAAQC,GAC9CE,EAAa/J,EAAG9B,GAAK0L,GAAQ,IAG7B1F,EAAOlE,EAAG/D,SAEdb,EAASY,KAAKkI,GACd7I,EAAUW,KAAKjB,EAAO8B,EAC1B,CAEA,OADAkN,EAAaV,EAAKnL,GAAK0L,GAAQ,GACxB,IAAI9N,EAAKuN,EAAKxO,KAAMO,EAAUC,EAAWgO,EAAKnL,GAAK0L,EAAS/M,EAAOwM,EAAKA,KAAOA,EAAKA,KAAKiB,gBAAazI,EACjH,CAIA,MAAM0I,WAAuBC,EAIzB,WAAAtP,CAKAgB,EAIAkL,EAIA5G,EAIAiK,EAIAjD,EAIAkB,EAIAgC,EAIAC,EAIAC,GACIC,QACAvP,KAAKY,QAAUA,EACfZ,KAAK8L,aAAeA,EACpB9L,KAAKkF,iBAAmBA,EACxBlF,KAAKmP,WAAaA,EAClBnP,KAAKkM,aAAeA,EACpBlM,KAAKoN,kBAAoBA,EACzBpN,KAAKoP,cAAgBA,EACrBpP,KAAKqP,YAAcA,EACnBrP,KAAKsP,SAAWA,EAIhBtP,KAAKwP,UAAYC,OAAOnQ,OAAO,MAC/B,IAAK,IAAIoQ,KAAK9O,EAAQI,MAClBhB,KAAKwP,UAAUE,EAAEC,MAAQD,EAAEE,EACnC,CACA,WAAAC,CAAYhF,EAAOC,EAAWC,GAC1B,IAAIgB,EAAQ,IAAInB,GAAa5K,KAAM6K,EAAOC,EAAWC,GACrD,IAAK,IAAI+E,KAAK9P,KAAKsP,SACfvD,EAAQ+D,EAAE/D,EAAOlB,EAAOC,EAAWC,GACvC,OAAOgB,CACX,CAIA,SAAAgE,CAAUC,GACN,IAAIC,EAASC,GAAcF,GAC3B,IAAKC,EACD,OAAOjQ,KACX,IAAIY,QAAEA,EAAOwM,kBAAEA,GAAsBpN,KACjC8L,EAAe9L,KAAK8L,aAAazI,QAAS6B,EAAmBlF,KAAKkF,iBAAiB7B,QAAS8L,EAAanP,KAAKmP,WAAW9L,QAAS+L,EAAgBpP,KAAKoP,cAAc/L,QAASgM,EAAcrP,KAAKqP,YAAYhM,QAAS6I,EAAelM,KAAKkM,aAAa7I,QAASiM,EAAWtP,KAAKsP,SACpR,GAAIa,GAASF,EAAOG,aAAc,CAC9BhD,EAAoBqC,OAAOY,OAAO,CAAA,EAAIjD,GACtC,IAAuCkD,EAAnCd,EAAY5O,EAAQI,MAAMqC,QAC9B,IAAK,IAAIkN,KAAKN,EAAOG,YAAa,CAC9B,IAAIT,KAAEA,EAAIjM,MAAEA,EAAK8M,UAAEA,EAASC,MAAEA,GAAsB,iBAALF,EAAgB,CAAEZ,KAAMY,GAAMA,EAC7E,GAAIf,EAAUkB,KAAKhB,GAAKA,EAAEC,MAAQA,GAC9B,SACAa,IACApD,EAAkBoC,EAAU/O,QACxB,CAAC8C,EAAIC,EAAIC,IAAS+M,EAAUhN,EAAIC,EAAMF,EAAG/D,QACjD,IAAIoQ,EAAKJ,EAAU/O,OACfkQ,EAAQH,EAAY,CAAC,QAAS,gBAAmB9M,EAC/CkM,GAAMvO,EAAKwH,aAAe+G,GAAMvO,EAAKkJ,eAAiB,CAAC,QAAS,YAAa,WAAa,CAAC,QAAS,kBAD7ChE,EAE7DiJ,EAAU9O,KAAKS,EAASyP,OAAO,CAC3BhB,KACAD,OACAkB,MAAOF,GAAS,CAAC,CAACzQ,EAASyQ,MAAOA,OAElCF,IACKH,IACDA,EAAS,CAAA,GACTQ,MAAMC,QAAQN,IAAUA,aAAiBO,EACzCV,EAAOX,GAAQc,EAEfhB,OAAOY,OAAOC,EAAQG,GAElC,CACA7P,EAAU,IAAIqQ,EAAQzB,GAClBc,IACA1P,EAAUA,EAAQsQ,OAAOC,EAAUb,IAC3C,CAGA,GAFIH,GAASF,EAAOY,SAChBjQ,EAAUA,EAAQsQ,UAAUjB,EAAOY,QACnCV,GAASF,EAAOmB,QAChB,IAAK,IAAIC,KAAMpB,EAAOmB,OAAQ,CAC1B,IAAI1N,EAAQ1D,KAAKmP,WAAWhK,QAAQkM,GAAKnD,EAASlO,KAAKqP,YAAYlK,QAAQkM,GACvE3N,GAAQ,IACRoI,EAAapI,GAASwB,EAAiBxB,QAAS6C,GAChD2H,GAAS,IACTkB,EAAclB,QAAU3H,EAChC,CAEJ,GAAI4J,GAASF,EAAOqB,YAChB,IAAK,IAAItB,KAAQC,EAAOqB,WAAY,CAChC,IAAIC,EAAQpC,EAAWhK,QAAQ6K,EAAKL,MACpC,GAAI4B,GAAQ,EACRzF,EAAayF,GAASvB,EAAKjE,MAC3B7G,EAAiBqM,GAASvB,EAAK5G,SAE9B,CACD,IAAI9I,EAAM0P,EAAKwB,OAASC,GAAStC,EAAYa,EAAKwB,QAC5CxB,EAAKzH,MAAQkJ,GAAStC,EAAYa,EAAKzH,OAAS,EAAI4G,EAAW1O,OAAS,EAC9EqL,EAAa4F,OAAOpR,EAAK,EAAG0P,EAAKjE,OACjC7G,EAAiBwM,OAAOpR,EAAK,EAAG0P,EAAK5G,MACrC+F,EAAWuC,OAAOpR,EAAK,EAAG0P,EAAKL,KACnC,CACIK,EAAK2B,SACLzF,EAAaxL,KAAKsP,EAAK2B,QAC/B,CAEJ,GAAIxB,GAASF,EAAOtH,aAChB,IAAK,IAAIqH,KAAQC,EAAOtH,YAAa,CACjC,IAAI4I,EAAQlC,EAAYlK,QAAQ6K,EAAKL,MACrC,GAAI4B,GAAQ,EACRnC,EAAcmC,GAASvB,EAAKjE,UAE3B,CACD,IAAIzL,EAAM0P,EAAKwB,OAASC,GAASpC,EAAaW,EAAKwB,QAC7CxB,EAAKzH,MAAQkJ,GAASpC,EAAaW,EAAKzH,OAAS,EAAI8G,EAAY5O,OAAS,EAChF2O,EAAcsC,OAAOpR,EAAK,EAAG0P,EAAKjE,OAClCsD,EAAYqC,OAAOpR,EAAK,EAAG0P,EAAKL,KACpC,CACJ,CAIJ,OAFIM,EAAO2B,OACPtC,EAAWA,EAASvI,OAAOkJ,EAAO2B,OAC/B,IAAI3C,GAAerO,EAASkL,EAAc5G,EAAkBiK,EAAYjD,EAAckB,EAAmBgC,EAAeC,EAAaC,EAChJ,CAIA,WAAA5B,CAAYiC,GACR,IAAI4B,EAAQvR,KAAKwP,UAAUG,GAC3B,GAAa,MAAT4B,EACA,MAAM,IAAIlF,WAAW,sBAAsBsD,MAC/C,OAAO4B,CACX,CAMA,WAAA5I,CAAY/G,EAAM0M,GACd,IAAI9K,EAAK,IAAIqO,GAAc7R,KAAM4B,EAAM0M,GACvCwD,EAAO,IAAK,IAAIxR,EAAMgO,EAAQhO,EAAMkD,EAAG7D,KAAM,CACzC,IAAIuC,EAAOsB,EAAGuO,KAAKzR,GACnB,IAAK,IAAI0R,KAAShS,KAAKoP,cACnB,GAAI4C,EAAO,CACP,IAAI5O,EAAS4O,EAAMxO,EAAItB,EAAM5B,GAC7B,GAAI8C,GAAU,EAAG,CACb9C,EAAM8C,EACN,SAAS0O,CACb,CACJ,CACJxR,GACJ,CACA,OAAOkD,EAAGyO,eAAe,EAC7B,EAEJ,SAAS9B,GAAS+B,GACd,OAAY,MAALA,GAAaA,EAAEzR,OAAS,CACnC,CACA,SAASyP,GAAcF,GACnB,IAAKc,MAAMC,QAAQf,GACf,OAAOA,EACX,GAAmB,GAAfA,EAAKvP,OACL,OAAO,KACX,IAAI0R,EAAOjC,GAAcF,EAAK,IAC9B,GAAmB,GAAfA,EAAKvP,OACL,OAAO0R,EACX,IAAItM,EAAOqK,GAAcF,EAAK3M,MAAM,IACpC,IAAKwC,IAASsM,EACV,OAAOA,GAAQtM,EACnB,IAAIuM,EAAO,CAACF,EAAGG,KAAOH,GAAK9Q,IAAM2F,OAAOsL,GAAKjR,IACzCkR,EAAQH,EAAKP,KAAMW,EAAQ1M,EAAK+L,KACpC,MAAO,CACHf,MAAOuB,EAAKD,EAAKtB,MAAOhL,EAAKgL,OAC7BT,YAAagC,EAAKD,EAAK/B,YAAavK,EAAKuK,aACzCkB,WAAYc,EAAKD,EAAKb,WAAYzL,EAAKyL,YACvC3I,YAAayJ,EAAKD,EAAKxJ,YAAa9C,EAAK8C,aACzCyI,OAAQgB,EAAKD,EAAKf,OAAQvL,EAAKuL,QAC/BQ,KAAOU,EAAiBC,EACpB,CAACC,EAAO3H,EAAOC,EAAWC,IAAWuH,EAAMC,EAAMC,EAAO3H,EAAOC,EAAWC,GAASF,EAAOC,EAAWC,GADzEuH,EAAjBC,EAGvB,CACA,SAASd,GAASgB,EAAO9C,GACrB,IAAI4B,EAAQkB,EAAMtN,QAAQwK,GAC1B,GAAI4B,EAAQ,EACR,MAAM,IAAIlF,WAAW,iDAAiDsD,KAC1E,OAAO4B,CACX,CACA,IAAI/B,GAAY,CAACrO,EAASC,MAC1B,IAAK,IAAWuO,EAAP1M,EAAI,EAAS0M,EAAOtO,EAAK4B,GAAIA,IAClCuM,GAAUvM,GAAK9B,EAASyP,OAAO,CAC3BhB,GAAI3M,EACJ0M,OACAkB,MAAO5N,GAAK5B,EAAKqR,OAAS,GAAK,CAAC,CAACxS,EAASyQ,MAAO1N,KAAKiB,EAAoB,CAAC,QAAS,gBAAkB,CAAC,QAAS,eAChH2J,IAAa,YAAR8B,IAGb,MAAMvO,GAAO,GACb,MAAMiN,GACF,WAAAzO,CAAYgB,GACRZ,KAAKY,QAAUA,EACfZ,KAAKwB,QAAU,GACfxB,KAAK2S,MAAQ,EACjB,CACA,KAAAlK,CAAMlJ,EAAME,EAAMmD,EAAI9C,EAAW,GAE7B,OADAE,KAAKwB,QAAQd,KAAKnB,EAAME,EAAMmD,EAAI,EAAe,EAAX9C,GAC/BE,IACX,CACA,aAAAkH,CAAcoC,EAAMgF,EAAS,GACzB,IAAK,IAAIxI,KAAKwD,EACVxD,EAAE8M,QAAQ5S,KAAMsO,GACpB,OAAOtO,IACX,CACA,MAAAmH,CAAO5H,EAAMkB,GACT,OAAOD,EAAKqS,MAAM,CACd5L,OAAQjH,KAAKwB,QACbZ,QAASZ,KAAKY,QACdkS,OAAQ9S,KAAK2S,MACbI,MAAOxT,EACPkB,UAER,EAKJ,MAAMuS,GAIF,WAAApT,CAKAL,EAIAE,EAIAmD,EAIA9C,EAAWsB,IACPpB,KAAKT,KAAOA,EACZS,KAAKP,KAAOA,EACZO,KAAK4C,GAAKA,EACV5C,KAAKF,SAAWA,CACpB,CAIA,OAAA8S,CAAQpK,EAAK8F,GACT,IAAI2E,EAAWzK,EAAIhH,QAAQf,OAC3B+H,EAAItB,cAAclH,KAAKF,SAAUwO,GACjC9F,EAAIhH,QAAQd,KAAKV,KAAKT,KAAMS,KAAKP,KAAO6O,EAAQtO,KAAK4C,GAAK0L,EAAQ9F,EAAIhH,QAAQf,OAAS,EAAIwS,EAC/F,CAIA,MAAAtS,CAAOC,GACH,OAAO,IAAIyN,GAAOzN,GAASsG,cAAclH,KAAKF,UAAWE,KAAKP,MAAM0H,OAAOnH,KAAKT,KAAMS,KAAK4C,GAAK5C,KAAKP,KACzG,EAEJ,MAAM2O,GACF,WAAAxO,CAAYmO,EAAMtO,GACdO,KAAK+N,KAAOA,EACZ/N,KAAKP,KAAOA,CAChB,CACA,MAAImD,GAAO,OAAO5C,KAAKP,KAAOO,KAAK+N,KAAKtN,MAAQ,CAChD,QAAIlB,GAAS,OAAOS,KAAK+N,KAAKxO,KAAKqQ,EAAI,CACvC,YAAI9P,GAAa,OAAOsB,EAAM,CAC9B,OAAAwR,CAAQpK,EAAK8F,GACT9F,EAAImK,MAAMjS,KAAKV,KAAK+N,MACpBvF,EAAIhH,QAAQd,KAAK8H,EAAImK,MAAMlS,OAAS,EAAGT,KAAKP,KAAO6O,EAAQtO,KAAK4C,GAAK0L,GAAQ,EACjF,CACA,MAAA3N,GAAW,OAAOX,KAAK+N,IAAM,EAEjC,SAAS/K,GAAIzD,EAAME,EAAMmD,EAAI9C,GACzB,OAAO,IAAIkT,GAAQzT,EAAME,EAAMmD,EAAI9C,EACvC,CACA,MAAMoT,GAAqB,CAAEC,QAAS,WAAYxH,KAAM,gBAClDyH,GAAmB,CAAED,QAAS,WAAYxH,KAAM,gBAChD0H,GAAY,CAAA,EAAIC,GAAa,CAAA,EACnC,MAAMC,GACF,WAAA3T,CAAYL,EAAME,EAAMmD,EAAI4Q,GACxBxT,KAAKT,KAAOA,EACZS,KAAKP,KAAOA,EACZO,KAAK4C,GAAKA,EACV5C,KAAKwT,KAAOA,CAChB,EAEJ,MAAMC,GAAY,qCAClB,IAAIC,GAAc,2DAClB,IACIA,GAAc,IAAIC,OAAO,kBAAmB,IAChD,CACA,MAAOnJ,GAAK,CACZ,MAAMoJ,GAAgB,CAClB,MAAAlB,CAAOlP,EAAItB,EAAMX,GACb,GAAY,IAARW,GAAyBX,GAASiC,EAAG7D,IAAM,EAC3C,OAAO,EACX,IAAIkU,EAAUrQ,EAAGuO,KAAKxQ,EAAQ,GAC9B,IAAK,IAAI0B,EAAI,EAAGA,EAAIwQ,GAAkBxQ,IAClC,GAAIwQ,GAAUjR,WAAWS,IAAM4Q,EAC3B,OAAOrQ,EAAGsQ,OAAO9Q,GAAI3B,EAAKqR,OAAQnR,EAAOA,EAAQ,IACzD,OAAO,CACX,EACA,MAAAwS,CAAOvQ,EAAItB,EAAMX,GACb,GAAY,IAARW,EACA,OAAO,EACX,IAAI0E,EAAI,6BAA6BoN,KAAKxQ,EAAGH,MAAM9B,EAAQ,EAAGA,EAAQ,KACtE,OAAOqF,EAAIpD,EAAGsQ,OAAO9Q,GAAI3B,EAAK0S,OAAQxS,EAAOA,EAAQ,EAAIqF,EAAE,GAAGnG,UAAW,CAC7E,EACA,UAAAwT,CAAWzQ,EAAItB,EAAMX,GACjB,GAAY,IAARW,GAAwBX,GAA+B,IAAtBiC,EAAGuO,KAAKxQ,EAAQ,GACjD,OAAO,EACX,IAAIjB,EAAMiB,EAAQ,EAClB,KAAOjB,EAAMkD,EAAG7D,KAAuB,IAAhB6D,EAAGuO,KAAKzR,IAC3BA,IACJ,IAAIsD,EAAOtD,EAAMiB,EAAO2S,EAAU,EAClC,KAAO5T,EAAMkD,EAAG7D,IAAKW,IACjB,GAAoB,IAAhBkD,EAAGuO,KAAKzR,IAER,GADA4T,IACIA,GAAWtQ,GAA4B,IAApBJ,EAAGuO,KAAKzR,EAAM,GACjC,OAAOkD,EAAGsQ,OAAO9Q,GAAI3B,EAAK4S,WAAY1S,EAAOjB,EAAM,EAAG,CAClD0C,GAAI3B,EAAKqG,SAAUnG,EAAOA,EAAQqC,GAClCZ,GAAI3B,EAAKqG,SAAUpH,EAAM,EAAIsD,EAAMtD,EAAM,WAIjD4T,EAAU,EAGlB,OAAO,CACX,EACA,OAAAC,CAAQ3Q,EAAItB,EAAMX,GACd,GAAY,IAARW,GAAwBX,GAASiC,EAAG7D,IAAM,EAC1C,OAAO,EACX,IAAI4I,EAAQ/E,EAAGH,MAAM9B,EAAQ,EAAGiC,EAAG7D,KAC/ByU,EAAM,sIAAsIJ,KAAKzL,GACrJ,GAAI6L,EACA,OAAO5Q,EAAGsQ,OAAO9Q,GAAI3B,EAAKgT,SAAU9S,EAAOA,EAAQ,EAAI6S,EAAI,GAAG3T,OAAQ,CAClEuC,GAAI3B,EAAKuI,SAAUrI,EAAOA,EAAQ,GAElCyB,GAAI3B,EAAKiT,IAAK/S,EAAQ,EAAGA,EAAQ6S,EAAI,GAAG3T,QACxCuC,GAAI3B,EAAKuI,SAAUrI,EAAQ6S,EAAI,GAAG3T,OAAQc,EAAQ,EAAI6S,EAAI,GAAG3T,WAGrE,IAAI8T,EAAU,+BAA+BP,KAAKzL,GAClD,GAAIgM,EACA,OAAO/Q,EAAGsQ,OAAO9Q,GAAI3B,EAAKmT,QAASjT,EAAOA,EAAQ,EAAIgT,EAAQ,GAAG9T,SACrE,IAAIgU,EAAW,cAAcT,KAAKzL,GAClC,GAAIkM,EACA,OAAOjR,EAAGsQ,OAAO9Q,GAAI3B,EAAKqT,sBAAuBnT,EAAOA,EAAQ,EAAIkT,EAAS,GAAGhU,SACpF,IAAImG,EAAI,mKAAmKoN,KAAKzL,GAChL,OAAK3B,EAEEpD,EAAGsQ,OAAO9Q,GAAI3B,EAAK8S,QAAS5S,EAAOA,EAAQ,EAAIqF,EAAE,GAAGnG,UADhD,CAEf,EACA,QAAAkU,CAASnR,EAAItB,EAAMX,GACf,GAAY,IAARW,GAAsB,IAARA,EACd,OAAO,EACX,IAAI5B,EAAMiB,EAAQ,EAClB,KAAOiC,EAAGuO,KAAKzR,IAAQ4B,GACnB5B,IACJ,IAAIkR,EAAShO,EAAGH,MAAM9B,EAAQ,EAAGA,GAAQgH,EAAQ/E,EAAGH,MAAM/C,EAAKA,EAAM,GACjEsU,EAAUlB,GAAY3N,KAAKyL,GAASqD,EAASnB,GAAY3N,KAAKwC,GAC9DuM,EAAU,QAAQ/O,KAAKyL,GAASuD,EAAS,QAAQhP,KAAKwC,GACtDyM,GAAgBD,KAAYF,GAAUC,GAAWF,GACjDK,GAAiBH,KAAaF,GAAWG,GAAUF,GACnDK,EAAUF,IAAyB,IAAR9S,IAAe+S,GAAiBL,GAC3DO,EAAWF,IAA0B,IAAR/S,IAAe8S,GAAgBH,GAChE,OAAOrR,EAAGsQ,OAAO,IAAIP,GAAwB,IAARrR,EAAagR,GAAqBE,GAAkB7R,EAAOjB,GAAM4U,EAAU,EAAoB,IAAsBC,EAAW,EAAqB,IAC9L,EACA,SAAAC,CAAU5R,EAAItB,EAAMX,GAChB,GAAY,IAARW,GAA+C,IAAtBsB,EAAGuO,KAAKxQ,EAAQ,GACzC,OAAOiC,EAAGsQ,OAAO9Q,GAAI3B,EAAK+T,UAAW7T,EAAOA,EAAQ,IACxD,GAAY,IAARW,EAAY,CACZ,IAAI5B,EAAMiB,EAAQ,EAClB,KAAuB,IAAhBiC,EAAGuO,KAAKzR,IACXA,IACJ,GAAoB,IAAhBkD,EAAGuO,KAAKzR,IAAcA,GAAOiB,EAAQ,EACrC,OAAOiC,EAAGsQ,OAAO9Q,GAAI3B,EAAK+T,UAAW7T,EAAOjB,EAAM,GAC1D,CACA,OAAO,CACX,EACA+U,KAAI,CAAC7R,EAAItB,EAAMX,IACI,IAARW,EAAuBsB,EAAGsQ,OAAO,IAAIP,GAAgBF,GAAW9R,EAAOA,EAAQ,EAAG,KAAsB,EAEnH+T,MAAK,CAAC9R,EAAItB,EAAMX,IACG,IAARW,GAA8C,IAAtBsB,EAAGuO,KAAKxQ,EAAQ,GACzCiC,EAAGsQ,OAAO,IAAIP,GAAgBD,GAAY/R,EAAOA,EAAQ,EAAG,KAAsB,EAE5F,OAAAgU,CAAQ/R,EAAItB,EAAMX,GACd,GAAY,IAARW,EACA,OAAO,EAEX,IAAK,IAAIe,EAAIO,EAAGgS,MAAM/U,OAAS,EAAGwC,GAAK,EAAGA,IAAK,CAC3C,IAAIwS,EAAOjS,EAAGgS,MAAMvS,GACpB,GAAIwS,aAAgBlC,KAAoBkC,EAAKlW,MAAQ8T,IAAaoC,EAAKlW,MAAQ+T,IAAa,CAGxF,IAAKmC,EAAKjC,MAAQhQ,EAAGlB,UAAUmT,EAAK7S,KAAOrB,IAAU,QAAQwE,KAAKvC,EAAGH,MAAM9B,EAAQ,EAAGA,EAAQ,IAE1F,OADAiC,EAAGgS,MAAMvS,GAAK,MACP,EAIX,IAAIzB,EAAUgC,EAAGkS,YAAYzS,GACzB0S,EAAOnS,EAAGgS,MAAMvS,GAAK2S,GAAWpS,EAAIhC,EAASiU,EAAKlW,MAAQ8T,GAAYhS,EAAKgU,KAAOhU,EAAKiU,MAAOG,EAAKhW,KAAM8B,EAAQ,GAErH,GAAIkU,EAAKlW,MAAQ8T,GACb,IAAK,IAAIwC,EAAI,EAAGA,EAAI5S,EAAG4S,IAAK,CACxB,IAAInL,EAAIlH,EAAGgS,MAAMK,GACbnL,aAAa6I,IAAmB7I,EAAEnL,MAAQ8T,KAC1C3I,EAAE8I,KAAO,EACjB,CACJ,OAAOmC,EAAK/S,EAChB,CACJ,CACA,OAAO,CACX,GAEJ,SAASgT,GAAWpS,EAAIhC,EAASjC,EAAMgC,EAAOuU,GAC1C,IAAIlU,KAAEA,GAAS4B,EAAItB,EAAOsB,EAAGuO,KAAK+D,GAAWC,EAASD,EAGtD,GAFAtU,EAAQwU,QAAQhT,GAAI3B,EAAKuI,SAAUrI,EAAOA,GAAShC,GAAQ8B,EAAKiU,MAAQ,EAAI,KAC5E9T,EAAQd,KAAKsC,GAAI3B,EAAKuI,SAAUkM,EAAW,EAAGA,IAClC,IAAR5T,EAAsB,CACtB,IACuD4H,EADnDxJ,EAAMkD,EAAGlB,UAAUwT,EAAW,GAC9BG,EAAO/L,GAAStI,EAAMtB,EAAMkD,EAAG8K,OAAQ9K,EAAG8K,QAC1C2H,IACA3V,EAAMkD,EAAGlB,UAAU2T,EAAKrT,IAEpBtC,GAAO2V,EAAKrT,KACZkH,EAAQC,GAAenI,EAAMtB,EAAMkD,EAAG8K,OAAQ9K,EAAG8K,QAC7CxE,IACAxJ,EAAMkD,EAAGlB,UAAUwH,EAAMlH,OAGjB,IAAhBY,EAAGuO,KAAKzR,KACRkB,EAAQd,KAAKsC,GAAI3B,EAAKuI,SAAUkM,EAAUA,EAAW,IACrDC,EAASzV,EAAM,EACX2V,GACAzU,EAAQd,KAAKuV,GACbnM,GACAtI,EAAQd,KAAKoJ,GACjBtI,EAAQd,KAAKsC,GAAI3B,EAAKuI,SAAUtJ,EAAKyV,IAE7C,MACK,GAAY,IAAR7T,EAAsB,CAC3B,IAAIgU,EAAQvM,GAAe/H,EAAMkU,EAAWtS,EAAG8K,OAAQ9K,EAAG8K,QAAQ,GAC9D4H,IACA1U,EAAQd,KAAKwV,GACbH,EAASG,EAAMtT,GAEvB,CACA,OAAOI,GAAIzD,EAAMgC,EAAOwU,EAAQvU,EACpC,CAIA,SAAS0I,GAAStI,EAAML,EAAO+M,GAE3B,GAAY,IADD1M,EAAKY,WAAWjB,GACD,CACtB,IAAK,IAAIjB,EAAMiB,EAAQ,EAAGjB,EAAMsB,EAAKnB,OAAQH,IAAO,CAChD,IAAIoE,EAAK9C,EAAKY,WAAWlC,GACzB,GAAU,IAANoE,EACA,OAAO1B,GAAI3B,EAAKiT,IAAK/S,EAAQ+M,EAAQhO,EAAM,EAAIgO,GACnD,GAAU,IAAN5J,GAAkB,IAANA,EACZ,OAAO,CACf,CACA,OAAO,IACX,CACK,CACD,IAAI3C,EAAQ,EAAGzB,EAAMiB,EACrB,IAAK,IAAIsS,GAAU,EAAOvT,EAAMsB,EAAKnB,OAAQH,IAAO,CAChD,IAAIoE,EAAK9C,EAAKY,WAAWlC,GACzB,GAAIgE,EAAMI,GACN,MAEC,GAAImP,EACLA,GAAU,OAET,GAAU,IAANnP,EACL3C,SAEC,GAAU,IAAN2C,EAAoB,CACzB,IAAK3C,EACD,MACJA,GACJ,MACe,IAAN2C,IACLmP,GAAU,EAElB,CACA,OAAOvT,EAAMiB,EAAQyB,GAAI3B,EAAKiT,IAAK/S,EAAQ+M,EAAQhO,EAAMgO,GAAUhO,GAAOsB,EAAKnB,QAAS,IAC5F,CACJ,CACA,SAASsJ,GAAenI,EAAML,EAAO+M,GACjC,IAAIpM,EAAON,EAAKY,WAAWjB,GAC3B,GAAY,IAARW,GAAsB,IAARA,GAAsB,IAARA,EAC5B,OAAO,EACX,IAAIvC,EAAc,IAARuC,EAAa,GAAKA,EAC5B,IAAK,IAAI5B,EAAMiB,EAAQ,EAAGsS,GAAU,EAAOvT,EAAMsB,EAAKnB,OAAQH,IAAO,CACjE,IAAIoE,EAAK9C,EAAKY,WAAWlC,GACzB,GAAIuT,EACAA,GAAU,MACT,IAAInP,GAAM/E,EACX,OAAOqD,GAAI3B,EAAK8U,UAAW5U,EAAQ+M,EAAQhO,EAAM,EAAIgO,GAC1C,IAAN5J,IACLmP,GAAU,EAAI,CACtB,CACA,OAAO,IACX,CACA,SAASlK,GAAe/H,EAAML,EAAO+M,EAAQ8H,GACzC,IAAK,IAAIvC,GAAU,EAAOvT,EAAMiB,EAAQ,EAAG5B,EAAMmB,KAAKuV,IAAIzU,EAAKnB,OAAQH,EAAM,KAAMA,EAAMX,EAAKW,IAAO,CACjG,IAAIoE,EAAK9C,EAAKY,WAAWlC,GACzB,GAAIuT,EACAA,GAAU,MACT,IAAU,IAANnP,EACL,OAAO0R,GAAuBpT,GAAI3B,EAAKiV,UAAW/U,EAAQ+M,EAAQhO,EAAM,EAAIgO,GAI5E,GAFI8H,IAAiB9R,EAAMI,KACvB0R,GAAe,GACT,IAAN1R,EACA,OAAO,EACI,IAANA,IACLmP,GAAU,EAClB,CACJ,CACA,OAAO,IACX,CAKA,MAAMhC,GAIF,WAAAjS,CAIAqF,EAIArD,EAIA0M,GACItO,KAAKiF,OAASA,EACdjF,KAAK4B,KAAOA,EACZ5B,KAAKsO,OAASA,EAIdtO,KAAKwV,MAAQ,EACjB,CAKA,IAAAzD,CAAKzR,GAAO,OAAOA,GAAON,KAAKL,KAAM,EAAKK,KAAK4B,KAAKY,WAAWlC,EAAMN,KAAKsO,OAAS,CAInF,OAAI3O,GAAQ,OAAOK,KAAKsO,OAAStO,KAAK4B,KAAKnB,MAAQ,CAKnD,KAAA4C,CAAM5D,EAAMmD,GAAM,OAAO5C,KAAK4B,KAAKyB,MAAM5D,EAAOO,KAAKsO,OAAQ1L,EAAK5C,KAAKsO,OAAS,CAIhF,MAAAwF,CAAO9Q,GAEH,OADAhD,KAAKwV,MAAM9U,KAAKsC,GACTA,EAAIJ,EACf,CAOA,YAAA2T,CAAahX,EAAME,EAAMmD,EAAI4T,EAAMC,GAC/B,OAAOzW,KAAK8T,OAAO,IAAIP,GAAgBhU,EAAME,EAAMmD,GAAK4T,EAAO,EAAoB,IAAsBC,EAAQ,EAAqB,IAC1I,CAKA,eAAIC,GACA,IAAK,IAAIzT,EAAIjD,KAAKwV,MAAM/U,OAAS,EAAGwC,GAAK,EAAGA,IAAK,CAC7C,IAAIwS,EAAOzV,KAAKwV,MAAMvS,GACtB,GAAIwS,aAAgBlC,KAAoBkC,EAAKlW,MAAQ8T,IAAaoC,EAAKlW,MAAQ+T,IAC3E,OAAO,CACf,CACA,OAAO,CACX,CAIA,UAAA3F,CAAW3K,GACP,OAAOhD,KAAK8T,OAAO9Q,EACvB,CAKA,cAAAiP,CAAexS,GAEX,IAAK,IAAIwD,EAAIxD,EAAMwD,EAAIjD,KAAKwV,MAAM/U,OAAQwC,IAAK,CAC3C,IAAIwT,EAAQzW,KAAKwV,MAAMvS,GACvB,KAAMwT,aAAiBlD,IAAmBkD,EAAMlX,KAAK4T,SAAyB,EAAbsD,EAAMjD,MACnE,SACJ,IAEIgD,EAFAG,EAAMF,EAAMlX,MAAQ2T,IAAsBuD,EAAMlX,MAAQ6T,GACxDwD,EAAYH,EAAM7T,GAAK6T,EAAMhX,KACvBoW,EAAI5S,EAAI,EAElB,KAAO4S,GAAKpW,EAAMoW,IAAK,CACnB,IAAIJ,EAAOzV,KAAKwV,MAAMK,GACtB,GAAIJ,aAAgBlC,IAAgC,EAAZkC,EAAKjC,MAA6BiC,EAAKlW,MAAQkX,EAAMlX,QAEvFoX,IAAsB,EAAbF,EAAMjD,MAA0C,EAAZiC,EAAKjC,QAC/CiC,EAAK7S,GAAK6S,EAAKhW,KAAOmX,GAAa,GAAK,KAAOnB,EAAK7S,GAAK6S,EAAKhW,MAAQ,GAAKmX,EAAY,IAAK,CACjGJ,EAAOf,EACP,KACJ,CACJ,CACA,IAAKe,EACD,SACJ,IAAIjX,EAAOkX,EAAMlX,KAAK4T,QAAS3R,EAAU,GACrCD,EAAQiV,EAAK/W,KAAME,EAAM8W,EAAM7T,GAGnC,GAAI+T,EAAK,CACL,IAAI/S,EAAO9C,KAAKuV,IAAI,EAAGG,EAAK5T,GAAK4T,EAAK/W,KAAMmX,GAC5CrV,EAAQiV,EAAK5T,GAAKgB,EAClBjE,EAAM8W,EAAMhX,KAAOmE,EACnBrE,EAAe,GAARqE,EAAY,WAAa,gBACpC,CAEI4S,EAAKjX,KAAKoM,MACVnK,EAAQd,KAAKV,KAAKgD,IAAIwT,EAAKjX,KAAKoM,KAAMpK,EAAOiV,EAAK5T,KACtD,IAAK,IAAIiU,EAAIhB,EAAI,EAAGgB,EAAI5T,EAAG4T,IACnB7W,KAAKwV,MAAMqB,aAAc7D,IACzBxR,EAAQd,KAAKV,KAAKwV,MAAMqB,IAC5B7W,KAAKwV,MAAMqB,GAAK,KAEhBJ,EAAMlX,KAAKoM,MACXnK,EAAQd,KAAKV,KAAKgD,IAAIyT,EAAMlX,KAAKoM,KAAM8K,EAAMhX,KAAME,IACvD,IAAImX,EAAU9W,KAAKgD,IAAIzD,EAAMgC,EAAO5B,EAAK6B,GAEzCxB,KAAKwV,MAAMK,GAAKc,GAAOH,EAAK/W,MAAQ8B,EAAQ,IAAIgS,GAAgBiD,EAAKjX,KAAMiX,EAAK/W,KAAM8B,EAAOiV,EAAKhD,MAAQ,MAC/FxT,KAAKwV,MAAMvS,GAAK0T,GAAOF,EAAM7T,IAAMjD,EAAM,IAAI4T,GAAgBkD,EAAMlX,KAAMI,EAAK8W,EAAM7T,GAAI6T,EAAMjD,MAAQ,MAG7GxT,KAAKwV,MAAM9D,OAAOzO,EAAG,EAAG6T,GAExB9W,KAAKwV,MAAMvS,GAAK6T,CACxB,CAEA,IAAI1T,EAAS,GACb,IAAK,IAAIH,EAAIxD,EAAMwD,EAAIjD,KAAKwV,MAAM/U,OAAQwC,IAAK,CAC3C,IAAIwS,EAAOzV,KAAKwV,MAAMvS,GAClBwS,aAAgBzC,IAChB5P,EAAO1C,KAAK+U,EACpB,CACA,OAAOrS,CACX,CAMA,oBAAA2T,CAAqBxX,GACjB,IAAK,IAAI0D,EAAIjD,KAAKwV,MAAM/U,OAAS,EAAGwC,GAAK,EAAGA,IAAK,CAC7C,IAAIwS,EAAOzV,KAAKwV,MAAMvS,GACtB,GAAIwS,aAAgBlC,IAAmBkC,EAAKlW,MAAQA,EAChD,OAAO0D,CACf,CACA,OAAO,IACX,CAQA,WAAAyS,CAAYsB,GACR,IAAIxV,EAAUxB,KAAKiS,eAAe+E,GAElC,OADAhX,KAAKwV,MAAM/U,OAASuW,EACbxV,CACX,CAMA,SAAAc,CAAU7C,GAAQ,OAAO6C,EAAUtC,KAAK4B,KAAMnC,EAAOO,KAAKsO,QAAUtO,KAAKsO,MAAQ,CACjF,GAAAtL,CAAIzD,EAAME,EAAMmD,EAAI9C,GAChB,MAAmB,iBAARP,EACAyD,GAAIhD,KAAKiF,OAAOyI,YAAYnO,GAAOE,EAAMmD,EAAI9C,GACjD,IAAIsO,GAAY7O,EAAME,EACjC,EAEJ,SAASmO,GAAYqJ,EAAUxV,GAC3B,IAAKA,EAAMhB,OACP,OAAOwW,EACX,IAAKA,EAASxW,OACV,OAAOgB,EACX,IAAI6H,EAAO2N,EAAS5T,QAAS6T,EAAK,EAClC,IAAK,IAAIvL,KAAQlK,EAAO,CACpB,KAAOyV,EAAK5N,EAAK7I,QAAU6I,EAAK4N,GAAItU,GAAK+I,EAAK/I,IAC1CsU,IACJ,GAAIA,EAAK5N,EAAK7I,QAAU6I,EAAK4N,GAAIzX,KAAOkM,EAAKlM,KAAM,CAC/C,IAAIqG,EAAIwD,EAAK4N,GACTpR,aAAakN,KACb1J,EAAK4N,GAAM,IAAIlE,GAAQlN,EAAEvG,KAAMuG,EAAErG,KAAMqG,EAAElD,GAAIgL,GAAY9H,EAAEhG,SAAU,CAAC6L,KAC9E,MAEIrC,EAAKoI,OAAOwF,IAAM,EAAGvL,EAE7B,CACA,OAAOrC,CACX,CAGA,MAAM6N,GAAU,CAAC9V,EAAK+F,UAAW/F,EAAKkD,SAAUlD,EAAKwC,YAAaxC,EAAK2C,YACvE,MAAMuH,GACF,WAAA3L,CAAYkL,EAAWD,GACnB7K,KAAK8K,UAAYA,EACjB9K,KAAK6K,MAAQA,EAEb7K,KAAKiD,EAAI,EAETjD,KAAKoX,SAAW,KAChBpX,KAAKqX,aAAc,EAGnBrX,KAAKsX,OAAS,KACVxM,EAAUrK,SACVT,KAAKoX,SAAWtM,EAAU9K,KAAKiD,KACvC,CACA,YAAAsU,GACIvX,KAAKoX,SAAWpX,KAAKiD,EAAIjD,KAAK8K,UAAUrK,OAAST,KAAK8K,UAAU9K,KAAKiD,KAAO,KAC5EjD,KAAKsX,OAAS,KACdtX,KAAKqX,aAAc,CACvB,CACA,MAAA/K,CAAOhM,EAAK+D,GACR,KAAOrE,KAAKoX,UAAYpX,KAAKoX,SAASxU,IAAMtC,GACxCN,KAAKuX,eACT,IAAKvX,KAAKoX,UAAYpX,KAAKoX,SAAS3X,MAAQa,EAAMA,EAAM,EAAI,GACxD,OAAO,EACX,GAAIN,KAAKqX,YAAc,EAAG,CACtB,IAAI1X,EAAMK,KAAKoX,SAASxU,GACxB,KAAOjD,EAAM,GAAsC,MAAjCK,KAAK6K,MAAM2M,KAAK7X,EAAM,EAAGA,IACvCA,IACJK,KAAKqX,YAAc1X,EAAMA,EAAM,EAAI,CACvC,CACA,IAAI8X,EAAIzX,KAAKsX,OACRG,IACDA,EAAIzX,KAAKsX,OAAStX,KAAKoX,SAASrJ,KAAKuJ,SACrCG,EAAE7I,cAEN,IAAI8I,EAAOpX,EAAMN,KAAKoX,SAAS9I,OAC/B,KAAOmJ,EAAE7U,IAAM8U,OACND,EAAEE,SACH,OAAO,EACf,OAAS,CACL,GAAIF,EAAEhY,MAAQiY,EACV,OAAO1X,KAAKoX,SAAS3X,MAAQ4E,EACjC,IAAKoT,EAAEG,WAAWF,GACd,OAAO,CACf,CACJ,CACA,OAAAnL,CAAQ1M,GACJ,IAAIkO,EAAO/N,KAAKsX,OAAOvJ,KACvB,OAAOA,GAAQA,EAAKxN,KAAKL,EAASC,cAAgBN,CACtD,CACA,SAAA4M,CAAUjJ,GACN,IAAIqU,EAAM7X,KAAKsX,OAAQjP,EAAMrI,KAAKoX,SAAS9I,OAAQwJ,EAAU9X,KAAKqX,aAAerX,KAAKoX,SAASW,QAAU,EAAI,GACzGxW,EAAQiC,EAAG6H,kBAAmB1L,EAAM4B,EAAOyW,EAASxU,EAAGE,MAAM5D,SAASW,OACtEwX,EAAUtY,EAAKuY,EAAQF,EAC3B,OAAS,CACL,GAAIH,EAAIjV,GAAKyF,EAAMyP,EAAS,CACxB,GAAID,EAAItY,KAAK4Y,aAAeN,EAAIjJ,aAC5B,SACJ,KACJ,CACA,IAAItO,EAAMoM,GAAWmL,EAAIpY,KAAO4I,EAAK7E,EAAGuH,QACxC,GAAI8M,EAAIjV,GAAKyF,GAAO7E,EAAGuH,OAAOvH,EAAG4H,QAAQxI,GACrCY,EAAGwD,QAAQ6Q,EAAI9J,KAAMzN,OAEpB,CACD,IAAI8X,EAAQ,IAAI5X,EAAKgD,EAAGyB,OAAOrE,QAAQI,MAAMK,EAAK8M,WAAY,GAAI,GAAI,EAAG3K,EAAGE,MAAMzD,UAClFuD,EAAGyH,kBAAkBoN,IAAID,EAAOP,EAAI9J,MACpCvK,EAAGwD,QAAQoR,EAAO9X,EACtB,CAiBA,GAZIuX,EAAItY,KAAK+Y,GAAG,WACRnB,GAAQhS,QAAQ0S,EAAItY,KAAKqQ,IAAM,GAC/BjQ,EAAMkY,EAAIjV,GAAKyF,EACf2P,EAASxU,EAAGE,MAAM5D,SAASW,SAG3Bd,EAAMsY,EACND,EAASE,EACTD,EAAUJ,EAAIjV,GAAKyF,EACnB6P,EAAQ1U,EAAGE,MAAM5D,SAASW,UAG7BoX,EAAIhJ,cACL,KACR,CACA,KAAOrL,EAAGE,MAAM5D,SAASW,OAASuX,GAC9BxU,EAAGE,MAAM5D,SAAS4C,MAClBc,EAAGE,MAAM3D,UAAU2C,MAEvB,OAAO/C,EAAM4B,CACjB,EAKJ,SAASmL,GAAW6L,EAAKxN,GACrB,IAAIzK,EAAMiY,EACV,IAAK,IAAItV,EAAI,EAAGA,EAAI8H,EAAOtK,OAAQwC,IAAK,CACpC,IAAIuV,EAAUzN,EAAO9H,EAAI,GAAGL,GAAI6V,EAAQ1N,EAAO9H,GAAGxD,KAC9C+Y,EAAUD,IACVjY,GAAOmY,EAAQD,EACvB,CACA,OAAOlY,CACX,CACA,MAAMoY,GAAuBvH,EAAU,CACnC,iBAAkBwH,EAAKC,MACvB3Q,eAAgB0Q,EAAKE,iBACrB,qCAAsCF,EAAKG,SAC3C,qCAAsCH,EAAKI,SAC3C,kBAAmBJ,EAAKK,SACxB,kBAAmBL,EAAKM,SACxB,kBAAmBN,EAAKO,SACxB,kBAAmBP,EAAKQ,SACxB,uBAAwBR,EAAKpE,QAC7B7B,OAAQiG,EAAKS,OACbrF,OAAQ4E,EAAKU,UACb,eAAgBV,EAAKW,SACrB,qBAAsBX,EAAKY,OAC3B,qBAAsBZ,EAAKhD,KAC3B,iCAAkCgD,EAAKa,KACvC,iBAAkBb,EAAKC,MACvB,sBAAuBD,EAAKc,UAC5B,eAAgBd,EAAKvE,IACrB,yEAA0EuE,EAAKe,sBAC/E,qBAAsBf,EAAKgB,UAC3BxD,UAAWwC,EAAKiB,OAChBzL,UAAWwK,EAAKnX,UAKdyD,GAAS,IAAIgK,GAAe,IAAIgC,EAAQzB,IAAW0B,OAAOwH,IAAuBjJ,OAAOoK,KAAKxT,GAAqByT,IAAIC,GAAK1T,EAAoB0T,IAAKtK,OAAOoK,KAAKxT,GAAqByT,IAAIC,GAAK3U,GAAkB2U,IAAKtK,OAAOoK,KAAKxT,GAAsBoE,GAAgBvG,EAAmBuL,OAAOoK,KAAKjG,IAAekG,IAAIC,GAAKnG,GAAcmG,IAAKtK,OAAOoK,KAAKjG,IAAgB,IAEnX,SAASoG,GAAcpR,EAAMnJ,EAAMmD,GAC/B,IAAImI,EAAS,GACb,IAAK,IAAIgP,EAAInR,EAAKgG,WAAYtO,EAAMb,GAAOsa,EAAIA,EAAElL,YAAa,CAC1D,IAAIoL,EAAUF,EAAIA,EAAEta,KAAOmD,EAG3B,GAFIqX,EAAU3Z,GACVyK,EAAOrK,KAAK,CAAEjB,KAAMa,EAAKsC,GAAIqX,KAC5BF,EACD,MACJzZ,EAAMyZ,EAAEnX,EACZ,CACA,OAAOmI,CACX,CA4BA,MAAMmP,GAAqB,CAAE/G,QAAS,gBAAiBxH,KAAM,qBAMvDwO,GAAgB,CAClB/J,YAAa,CAAC,CACNT,KAAM,gBACNc,MAAO,CAAE,oBAAqBkI,EAAKyB,gBACpC,CACCzK,KAAM,oBACNc,MAAOkI,EAAKe,wBAEpB/Q,YAAa,CAAC,CACNgH,KAAM,gBACN,KAAA5D,CAAMvI,EAAItB,EAAM5B,GACZ,GAAY,KAAR4B,GAA6C,KAApBsB,EAAGuO,KAAKzR,EAAM,IAAiC,KAApBkD,EAAGuO,KAAKzR,EAAM,GAClE,OAAO,EACX,IAAIkR,EAAShO,EAAGH,MAAM/C,EAAM,EAAGA,GAAMiI,EAAQ/E,EAAGH,MAAM/C,EAAM,EAAGA,EAAM,GACjEwU,EAAU,QAAQ/O,KAAKyL,GAASuD,EAAS,QAAQhP,KAAKwC,GACtDqM,EAAUlB,GAAY3N,KAAKyL,GAASqD,EAASnB,GAAY3N,KAAKwC,GAClE,OAAO/E,EAAG+S,aAAa2D,GAAoB5Z,EAAKA,EAAM,GAAIyU,KAAYF,GAAUC,GAAWF,IAAWE,KAAaF,GAAWG,GAAUF,GAC5I,EACAtM,MAAO,cAKnB,SAAS8R,GAAS7W,EAAIC,EAAM6W,EAAS,EAAGhR,EAAMgF,EAAS,GACnD,IAAIvJ,EAAQ,EAAG6C,GAAQ,EAAM2S,GAAY,EAAIC,KAAcC,GAAM,EAC7DC,EAAY,KACZpR,EAAK5I,KAAK8C,EAAGR,IAAI,YAAasL,EAASiM,EAAWjM,EAASkM,EAAShX,EAAGyB,OAAO0D,YAAYlF,EAAKJ,MAAMkX,EAAWC,GAAUlM,EAASiM,MAEvI,IAAK,IAAItX,EAAIqX,EAAQrX,EAAIQ,EAAKhD,OAAQwC,IAAK,CACvC,IAAIf,EAAOuB,EAAKjB,WAAWS,GACf,KAARf,GAA0BuY,GAWrBA,GAAe,IAARvY,GAAsB,GAARA,KACtBqY,EAAY,IACZA,EAAYtX,GAChBuX,EAAUvX,EAAI,MAbT2E,GAAS2S,GAAY,IACtBxV,IACJ6C,GAAQ,EACJ0B,IACIiR,GAAY,GACZG,IACJpR,EAAK5I,KAAK8C,EAAGR,IAAI,iBAAkBC,EAAIqL,EAAQrL,EAAIqL,EAAS,KAEhEiM,EAAYC,GAAU,GAO1BC,GAAOA,GAAe,IAARvY,CAClB,CAMA,OALIqY,GAAY,IACZxV,IACIuE,GACAoR,KAED3V,CACX,CACA,SAAS4V,GAAQC,EAAKrZ,GAClB,IAAK,IAAI0B,EAAI1B,EAAO0B,EAAI2X,EAAIna,OAAQwC,IAAK,CACrC,IAAIf,EAAO0Y,EAAIpY,WAAWS,GAC1B,GAAY,KAARf,EACA,OAAO,EACC,IAARA,GACAe,GACR,CACA,OAAO,CACX,CACA,MAAM4X,GAAgB,wCACtB,MAAMC,GACF,WAAAlb,GAIII,KAAK+a,KAAO,IAChB,CACA,QAAApU,CAASnD,EAAIC,EAAM2F,GACf,GAAiB,MAAbpJ,KAAK+a,KAAc,CAEnB,IAAIC,EACJ,GAFAhb,KAAK+a,MAAO,GAEM,IAAbtX,EAAKvB,MAA2B,IAAbuB,EAAKvB,MAA2B,KAAbuB,EAAKvB,OAC5C2Y,GAAc9U,KAAKiV,EAAWvX,EAAK7B,KAAKyB,MAAMI,EAAKnD,MAAO,CAC1D,IAAI2a,EAAW,GAAiBZ,GAAS7W,EAAI4F,EAAK5H,QAAS,EAAGyZ,EAAU7R,EAAK7H,QAC3D8Y,GAAS7W,EAAIwX,EAAUvX,EAAKnD,OAC1CN,KAAK+a,KAAO,CAACvX,EAAGR,IAAI,cAAeoG,EAAK7H,MAAO6H,EAAK7H,MAAQ6H,EAAK5H,QAAQf,OAAQwa,GAC7EzX,EAAGR,IAAI,iBAAkBQ,EAAGa,UAAYZ,EAAKnD,IAAKkD,EAAGa,UAAYZ,EAAK7B,KAAKnB,SACvF,CACJ,MACK,GAAIT,KAAK+a,KAAM,CAChB,IAAIvZ,EAAU,GACd6Y,GAAS7W,EAAIC,EAAK7B,KAAM6B,EAAKnD,IAAKkB,EAASgC,EAAGa,WAC9CrE,KAAK+a,KAAKra,KAAK8C,EAAGR,IAAI,WAAYQ,EAAGa,UAAYZ,EAAKnD,IAAKkD,EAAGa,UAAYZ,EAAK7B,KAAKnB,OAAQe,GAChG,CACA,OAAO,CACX,CACA,MAAA2F,CAAO3D,EAAI4F,GACP,QAAKpJ,KAAK+a,OAEVvX,EAAGiG,eAAeL,EAAM5F,EAAGR,IAAI,QAASoG,EAAK7H,MAAO6H,EAAK7H,MAAQ6H,EAAK5H,QAAQf,OAAQT,KAAK+a,QACpF,EACX,EAaJ,MAAMG,GAAQ,CACV9K,YAAa,CACT,CAAET,KAAM,QAASjM,OAAO,GACxB,CAAEiM,KAAM,cAAec,MAAO,CAAE,kBAAmBkI,EAAKwC,UACxD,WACA,CAAExL,KAAM,YAAac,MAAOkI,EAAKnX,SACjC,CAAEmO,KAAM,iBAAkBc,MAAOkI,EAAKe,wBAE1CpI,WAAY,CAAC,CACL3B,KAAM,QACNvG,KAAI,CAACoB,EAAGpB,IAAeuR,GAAQvR,EAAK5H,QAAS,GAAK,IAAIsZ,GAAc,KACpE,OAAAnJ,CAAQnO,EAAIC,EAAM2F,GACd,GAAIA,EAAK1H,QAAQgP,KAAKhG,GAAKA,aAAaoQ,MAAiBH,GAAQlX,EAAK7B,KAAM6B,EAAK3B,SAC7E,OAAO,EACX,IAAII,EAAOsB,EAAGqJ,WACd,OAAOgO,GAAc9U,KAAK7D,IAASmY,GAAS7W,EAAIC,EAAK7B,KAAM6B,EAAK3B,UAAYuY,GAAS7W,EAAItB,EAAMuB,EAAK3B,QACxG,EACA0P,OAAQ,mBAGpB,MAAM4J,GACF,QAAAzU,GAAa,OAAO,CAAO,CAC3B,MAAAQ,CAAO3D,EAAI4F,GAKP,OAJA5F,EAAGiG,eAAeL,EAAM5F,EAAGR,IAAI,OAAQoG,EAAK7H,MAAO6H,EAAK7H,MAAQ6H,EAAK5H,QAAQf,OAAQ,CACjF+C,EAAGR,IAAI,aAAcoG,EAAK7H,MAAO6H,EAAK7H,MAAQ,MAC3CiC,EAAGyB,OAAO0D,YAAYS,EAAK5H,QAAQ6B,MAAM,GAAI+F,EAAK7H,MAAQ,OAE1D,CACX,EAQJ,MAAM8Z,GAAW,CACbjL,YAAa,CACT,CAAET,KAAM,OAAQjM,OAAO,EAAM+M,MAAOkI,EAAKa,MACzC,CAAE7J,KAAM,aAAcc,MAAOkI,EAAK2C,OAEtChK,WAAY,CAAC,CACL3B,KAAM,WACNvG,KAAI,CAAC5F,EAAI4F,IACE,kBAAkBrD,KAAKqD,EAAK5H,UAAoC,YAAxBgC,EAAGoJ,aAAa+C,KAAqB,IAAIyL,GAAa,KAEzG7S,MAAO,mBAGbgT,GAAa,4DACbC,GAAQ,kCACRC,GAAqB,uBACrBC,GAAU,gCACVC,GAAiB,oBACvB,SAAS5W,GAAM6V,EAAKnb,EAAMmD,EAAI8B,GAC1B,IAAItB,EAAS,EACb,IAAK,IAAIH,EAAIxD,EAAMwD,EAAIL,EAAIK,IACnB2X,EAAI3X,IAAMyB,GACVtB,IACR,OAAOA,CACX,CAmBA,SAASwY,GAAiBha,EAAMnC,GAC5Bic,GAAQG,UAAYpc,EACpB,IAAImH,EAAI8U,GAAQ1H,KAAKpS,GACrB,IAAKgF,EACD,OAAO,EACX,IAAI/F,EAAO+F,EAAE,GAAGA,EAAE,GAAGnG,OAAS,GAC9B,MAAe,KAARI,GAAuB,KAARA,GAAc,EAAKpB,EAAOmH,EAAE,GAAGnG,QAAkB,KAARI,EAAc,EAAI,EACrF,CAMA,MA0CMib,GAAM,CAACZ,GAAOG,GAAUlB,GA1Cb,CACbxR,YAAa,CAAC,CACNgH,KAAM,WACN,KAAA5D,CAAMvI,EAAItB,EAAM6Z,GACZ,IAAIzb,EAAMyb,EAASvY,EAAG8K,OACtB,GAAIhO,GAAO,KAAKyF,KAAKvC,EAAG5B,KAAKtB,EAAM,IAC/B,OAAO,EACXib,GAAWM,UAAYvb,EACvB,IAAIsG,EAAI2U,GAAWvH,KAAKxQ,EAAG5B,MAAOjC,GAAM,EACxC,IAAKiH,EACD,OAAO,EACX,GAAIA,EAAE,IAAMA,EAAE,IAEV,GADAjH,EA3CpB,SAAwBiC,EAAMnC,GAC1B+b,GAAMK,UAAYpc,EAClB,IAAImH,EAAI4U,GAAMxH,KAAKpS,GACnB,IAAKgF,GAAK6U,GAAmBzH,KAAKpN,EAAE,IAAI,GAAGzB,QAAQ,MAAO,EACtD,OAAO,EACX,IAAIxF,EAAMF,EAAOmH,EAAE,GAAGnG,OACtB,OAAS,CACL,IAA0BmG,EAAtB/F,EAAOe,EAAKjC,EAAM,GACtB,GAAI,aAAaoG,KAAKlF,IACV,KAARA,GAAekE,GAAMnD,EAAMnC,EAAME,EAAK,KAAOoF,GAAMnD,EAAMnC,EAAME,EAAK,KACpEA,QACC,IAAY,KAARkB,KAAgB+F,EAAI,6BAA6BoN,KAAKpS,EAAKyB,MAAM5D,EAAME,KAG5E,MAFAA,EAAMF,EAAOmH,EAAEoV,KAEf,CACR,CACA,OAAOrc,CACX,CA0B0Bsc,CAAezY,EAAG5B,KAAMtB,EAAMsG,EAAE,GAAGnG,QACrCd,GAAM,GAAM6D,EAAGkT,YAAa,CAE5B/W,EAAMW,EADU,wBAAwB0T,KAAKxQ,EAAG5B,KAAKyB,MAAM/C,EAAKX,IAC1C,GAAGc,MAC7B,OAEKmG,EAAE,GACPjH,EAAMic,GAAiBpY,EAAG5B,KAAMtB,IAGhCX,EAAMic,GAAiBpY,EAAG5B,KAAMtB,EAAMsG,EAAE,GAAGnG,QACvCd,GAAM,GAAc,SAARiH,EAAE,KACd+U,GAAeE,UAAYlc,EAC3BiH,EAAI+U,GAAe3H,KAAKxQ,EAAG5B,MACvBgF,IACAjH,EAAMiH,EAAEoV,MAAQpV,EAAE,GAAGnG,UAGjC,OAAId,EAAM,GACC,GACX6D,EAAGmK,WAAWnK,EAAGR,IAAI,MAAO+Y,EAAQpc,EAAM6D,EAAG8K,SACtC3O,EAAM6D,EAAG8K,OACpB,MASZ,SAAS4N,GAAcxX,EAAIkE,EAAM+C,GAC7B,MAAO,CAACnI,EAAItB,EAAM5B,KACd,GAAI4B,GAAQwC,GAAMlB,EAAGuO,KAAKzR,EAAM,IAAMoE,EAClC,OAAO,EACX,IAAI4E,EAAO,CAAC9F,EAAGR,IAAI2I,EAAMrL,EAAKA,EAAM,IACpC,IAAK,IAAI2C,EAAI3C,EAAM,EAAG2C,EAAIO,EAAG7D,IAAKsD,IAAK,CACnC,IAAIf,EAAOsB,EAAGuO,KAAK9O,GACnB,GAAIf,GAAQwC,EACR,OAAOlB,EAAGmK,WAAWnK,EAAGR,IAAI4F,EAAMtI,EAAK2C,EAAI,EAAGqG,EAAKvC,OAAOvD,EAAGR,IAAI2I,EAAM1I,EAAGA,EAAI,MAGlF,GAFY,IAARf,GACAoH,EAAK5I,KAAK8C,EAAGR,IAAI,SAAUC,EAAS,EAANA,MAC9BqB,EAAMpC,GACN,KACR,CACA,OAAO,EAEf,CAMA,MAAMia,GAAc,CAChB/L,YAAa,CACT,CAAET,KAAM,cAAec,MAAOkI,EAAKyD,QAAQzD,EAAKnX,UAChD,CAAEmO,KAAM,kBAAmBc,MAAOkI,EAAKe,wBAE3C/Q,YAAa,CAAC,CACNgH,KAAM,cACN5D,MAAOmQ,GAAc,GAAc,cAAe,sBAQxDG,GAAY,CACdjM,YAAa,CACT,CAAET,KAAM,YAAac,MAAOkI,EAAKyD,QAAQzD,EAAKnX,UAC9C,CAAEmO,KAAM,gBAAiBc,MAAOkI,EAAKe,wBAEzC/Q,YAAa,CAAC,CACNgH,KAAM,YACN5D,MAAOmQ,GAAc,IAAe,YAAa,oBAOvDI,GAAQ,CACVlM,YAAa,CAAC,CAAET,KAAM,QAASc,MAAOkI,EAAKU,YAC3C1Q,YAAa,CAAC,CACNgH,KAAM,QACN,KAAA5D,CAAMvI,EAAItB,EAAM5B,GACZ,IAAIic,EACJ,OAAY,IAARra,IAA0Bqa,EAAQ,kBAAkBvI,KAAKxQ,EAAGH,MAAM/C,EAAM,EAAGkD,EAAG7D,OAE3E6D,EAAGmK,WAAWnK,EAAGR,IAAI,QAAS1C,EAAKA,EAAM,EAAIic,EAAM,GAAG9b,UADlD,CAEf,KCpvEN+b,GAAoBC,EAAoB,CAAEC,cAAe,CAAEhZ,MAAO,CAAE8S,KAAM,UAAQC,MAAO,aACzFkG,GAA2B,IAAIzc,EAC/B0c,GAA0B3X,GAAO8K,UAAU,CAC7Cc,MAAO,CACUgM,EAAaC,IAAIvd,IAClBA,EAAK+Y,GAAG,UAAY/Y,EAAK+Y,GAAG,aAAkC,MAAnByE,GAAUxd,QAAgBgH,EACvE,CAACwH,EAAMiP,KAAK,CAAQvd,KAAMud,EAAMC,IAAIC,OAAOnP,EAAKtO,MAAMmD,GAAIA,GAAImL,EAAKnL,MAEhE+Z,GAAYG,IAAIC,IAChBI,EAAeL,IAAI,CAC5BrY,SAAU,IAAM,OAEP2Y,EAAiBN,IAAI,CAC9BrY,SAAU+X,QAItB,SAASO,GAAUxd,GACf,IAAIgd,EAAQ,8BAA8BvI,KAAKzU,EAAKoQ,MACpD,OAAO4M,GAASA,EAAM,QAAKhW,CAC/B,CACA,SAAS8W,GAAeC,EAAYC,GAChC,IAAI1c,EAAOyc,EACX,OAAS,CACL,IAA6BnC,EAAzBjZ,EAAOrB,EAAKgO,YAChB,IAAK3M,GAA4C,OAAnCiZ,EAAU4B,GAAU7a,EAAK3C,QAAkB4b,GAAWoC,EAChE,MACJ1c,EAAOqB,CACX,CACA,OAAOrB,EAAK+B,EAChB,CACA,MAAM4a,GAA4BC,EAAYC,GAAG,CAACV,EAAOzb,EAAO5B,KAC5D,IAAK,IAAIiJ,EAAO+U,EAAWX,GAAOY,aAAaje,GAAK,GAAKiJ,KACjDA,EAAKnJ,KAAO8B,GAD2CqH,EAAOA,EAAK+O,OAAQ,CAG/E,IAAIwD,EAAUvS,EAAKrJ,KAAKgB,KAAKoc,IAC7B,GAAe,MAAXxB,EACA,SACJ,IAAIzM,EAAO2O,GAAezU,EAAMuS,GAChC,GAAIzM,EAAO/O,EACP,MAAO,CAAEF,KAAME,EAAKiD,GAAI8L,EAChC,CACA,OAAO,OAEX,SAASmP,GAAO5Y,GACZ,OAAO,IAAI6Y,EAAStB,GAAMvX,EAAQ,CAACuY,IAAe,WACtD,CAIK,MAACO,GAAkCF,GAAOjB,IAMzCoB,GAAgCH,GALRjB,GAAW7M,UAAU,CAAC+L,GAAKO,GAAWF,GAAaG,MAyBjF,MAAM2B,GACF,WAAAre,CAAYgJ,EAAMnJ,EAAMmD,EAAIsb,EAAaC,EAAY5e,EAAM6e,GACvDpe,KAAK4I,KAAOA,EACZ5I,KAAKP,KAAOA,EACZO,KAAK4C,GAAKA,EACV5C,KAAKke,YAAcA,EACnBle,KAAKme,WAAaA,EAClBne,KAAKT,KAAOA,EACZS,KAAKoe,KAAOA,CAChB,CACA,KAAAC,CAAMC,EAAUvV,GAAW,GACvB,IAAI3F,EAASpD,KAAKke,aAAiC,cAAlBle,KAAK4I,KAAK+G,KAAuB,IAAM,IACxE,GAAgB,MAAZ2O,EAAkB,CAClB,KAAOlb,EAAO3C,OAAS6d,GACnBlb,GAAU,IACd,OAAOA,CACX,CAEI,IAAK,IAAIH,EAAIjD,KAAK4C,GAAK5C,KAAKP,KAAO2D,EAAO3C,OAAST,KAAKme,WAAW1d,OAAQwC,EAAI,EAAGA,IAC9EG,GAAU,IACd,OAAOA,GAAU2F,EAAW/I,KAAKme,WAAa,GAEtD,CACA,MAAAI,CAAOtB,EAAKH,GACR,IAAI0B,EAA2B,eAAlBxe,KAAK4I,KAAK+G,KAAwB8O,QAASC,GAAW1e,KAAKoe,KAAMnB,GAAK,GAAKH,GAAQ,GAChG,OAAO9c,KAAKke,YAAcM,EAASxe,KAAKT,KAAOS,KAAKme,UACxD,EAEJ,SAASQ,GAAW/V,EAAMqU,GACtB,IAAItK,EAAQ,GACZ,IAAK,IAAIkF,EAAMjP,EAAMiP,GAAmB,YAAZA,EAAIlI,KAAoBkI,EAAMA,EAAIF,OAC1C,YAAZE,EAAIlI,MAAkC,cAAZkI,EAAIlI,MAAoC,cAAZkI,EAAIlI,MAC1DgD,EAAMjS,KAAKmX,GAEnB,IAAI+G,EAAU,GACd,IAAK,IAAI3b,EAAI0P,EAAMlS,OAAS,EAAGwC,GAAK,EAAGA,IAAK,CACxC,IAAqBsZ,EAAjB3T,EAAO+J,EAAM1P,GACbQ,EAAOwZ,EAAIC,OAAOtU,EAAKnJ,MAAOqW,EAAWlN,EAAKnJ,KAAOgE,EAAKhE,KAC9D,GAAiB,cAAbmJ,EAAK+G,KACLiP,EAAQle,KAAK,IAAIud,GAAQrV,EAAMkN,EAAUA,EAAU,GAAI,GAAI,GAAI,YAE9D,GAAiB,cAAblN,EAAK+G,OAAyB4M,EAAQ,WAAWvI,KAAKvQ,EAAK7B,KAAKyB,MAAMyS,KAC3E8I,EAAQle,KAAK,IAAIud,GAAQrV,EAAMkN,EAAUA,EAAWyG,EAAM,GAAG9b,OAAQ,GAAI8b,EAAM,GAAI,IAAK,YAEvF,GAAiB,YAAb3T,EAAK+G,MAA0C,eAApB/G,EAAK+O,OAAOhI,OAC3C4M,EAAQ,qBAAqBvI,KAAKvQ,EAAK7B,KAAKyB,MAAMyS,KAAa,CAChE,IAAIvN,EAAQgU,EAAM,GAAIhV,EAAMgV,EAAM,GAAG9b,OACjC8H,EAAM9H,QAAU,IAChB8H,EAAQA,EAAMlF,MAAM,EAAGkF,EAAM9H,OAAS,GACtC8G,GAAO,GAEXqX,EAAQle,KAAK,IAAIud,GAAQrV,EAAK+O,OAAQ7B,EAAUA,EAAWvO,EAAKgV,EAAM,GAAIhU,EAAOgU,EAAM,GAAI3T,GAC/F,MACK,GAAiB,YAAbA,EAAK+G,MAA0C,cAApB/G,EAAK+O,OAAOhI,OAC3C4M,EAAQ,qCAAqCvI,KAAKvQ,EAAK7B,KAAKyB,MAAMyS,KAAa,CAChF,IAAIvN,EAAQgU,EAAM,GAAIhV,EAAMgV,EAAM,GAAG9b,OACjC8H,EAAM9H,OAAS,IACf8H,EAAQA,EAAMlF,MAAM,EAAGkF,EAAM9H,OAAS,GACtC8G,GAAO,GAEX,IAAIhI,EAAOgd,EAAM,GACbA,EAAM,KACNhd,GAAQgd,EAAM,GAAGsC,QAAQ,OAAQ,MACrCD,EAAQle,KAAK,IAAIud,GAAQrV,EAAK+O,OAAQ7B,EAAUA,EAAWvO,EAAKgV,EAAM,GAAIhU,EAAOhJ,EAAMqJ,GAC3F,CACJ,CACA,OAAOgW,CACX,CACA,SAASF,GAAWN,EAAMnB,GACtB,MAAO,sBAAsBjJ,KAAKiJ,EAAI6B,YAAYV,EAAK3e,KAAM2e,EAAK3e,KAAO,IAC7E,CACA,SAASsf,GAAaxW,EAAO0U,EAAK+B,EAAS1Q,EAAS,GAChD,IAAK,IAAI2Q,KAAWrW,EAAOL,IAAS,CAChC,GAAiB,YAAbK,EAAK+G,KAAoB,CACzB,IAAI/I,EAAI8X,GAAW9V,EAAMqU,GACrBuB,GAAU5X,EAAE,GAChB,GAAIqY,GAAQ,EAAG,CACX,GAAIT,GAAUS,EAAO,EACjB,OACJD,EAAQte,KAAK,CAAEjB,KAAMmJ,EAAKnJ,KAAOmH,EAAE,GAAGnG,OAAQmC,GAAIgG,EAAKnJ,KAAOmH,EAAE,GAAGnG,OAAQye,OAAQT,OAAOQ,EAAO,EAAI3Q,IACzG,CACA2Q,EAAOT,CACX,CACA,IAAItc,EAAO0G,EAAKiG,YAChB,IAAK3M,EACD,MACJ0G,EAAO1G,CACX,CACJ,CACA,SAASid,GAAgB3d,EAASwb,GAC9B,IAAIqB,EAAQ,UAAUrK,KAAKxS,GAAS,GAAGf,OACvC,IAAK4d,GAAoC,MAA3BrB,EAAMoC,MAAMC,GACtB,OAAO7d,EACX,IACI8C,EAAQ,GACZ,IAAK,IAAIrB,EAFCqc,EAAY9d,EAAS,EAAG6c,GAEhBpb,EAAI,GACdA,GAAK,GACLqB,GAAS,KACTrB,GAAK,IAGLqB,GAAS,IACTrB,KAGR,OAAOqB,EAAQ9C,EAAQ6B,MAAMgb,EACjC,CAYK,MAACkB,GAA8B,EAAGvC,QAAOwC,eAC1C,IAAIzR,EAAO4P,EAAWX,IAAQC,IAAEA,GAAQD,EACpCyC,EAAO,KAAMT,EAAUhC,EAAM0C,cAAcC,IAC3C,IAAKA,EAAMC,QAAU5B,GAAiB6B,WAAW7C,EAAO2C,EAAMlgB,MAC1D,OAAOggB,EAAO,CAAEE,SACpB,IAAIrf,EAAMqf,EAAMlgB,KAAMgE,EAAOwZ,EAAIC,OAAO5c,GACpCse,EAAUD,GAAW5Q,EAAK6P,aAAatd,GAAK,GAAK2c,GACrD,KAAO2B,EAAQne,QAAUme,EAAQA,EAAQne,OAAS,GAAGhB,KAAOa,EAAMmD,EAAKhE,MACnEmf,EAAQlc,MACZ,IAAKkc,EAAQne,OACT,OAAOgf,EAAO,CAAEE,SACpB,IAAInN,EAAQoM,EAAQA,EAAQne,OAAS,GACrC,GAAI+R,EAAM5P,GAAK4P,EAAM2L,WAAW1d,OAASH,EAAMmD,EAAKhE,KAChD,OAAOggB,EAAO,CAAEE,SACpB,IAAIG,EAAYxf,GAAQkS,EAAM5P,GAAK4P,EAAM2L,WAAW1d,SAAY,KAAKsF,KAAKtC,EAAK7B,KAAKyB,MAAMmP,EAAM5P,KAEhG,GAAI4P,EAAM4L,MAAQ0B,EAAW,CAEzB,GAAItN,EAAM5J,KAAKgG,WAAWhM,IAAMtC,GAC5BmD,EAAKhE,KAAO,IAAM,SAASsG,KAAKkX,EAAIC,OAAOzZ,EAAKhE,KAAO,GAAGmC,MAAO,CACjE,IACIme,EADA7d,EAAO0c,EAAQne,OAAS,EAAIme,EAAQA,EAAQne,OAAS,GAAK,KACnDye,EAAS,GAChBhd,GAAQA,EAAKkc,MACb2B,EAAQtc,EAAKhE,KAAOyC,EAAKzC,KACzByf,EAAShd,EAAKqc,OAAOtB,EAAK,IAG1B8C,EAAQtc,EAAKhE,MAAQyC,EAAOA,EAAKU,GAAK,GAE1C,IAAIoc,EAAU,CAAC,CAAEvf,KAAMsgB,EAAOnd,GAAItC,EAAK4e,WAKvC,MAJuB,eAAnB1M,EAAM5J,KAAK+G,MACXoP,GAAavM,EAAM4L,KAAMnB,EAAK+B,GAAS,GACvC9c,GAA0B,eAAlBA,EAAK0G,KAAK+G,MAClBoP,GAAa7c,EAAKkc,KAAMnB,EAAK+B,GAC1B,CAAEW,MAAOK,EAAgB1I,OAAOyI,EAAQb,EAAOze,QAASue,UACnE,CACK,CACD,IAAIE,EAAS,GACb,IAAK,IAAIjc,EAAI,EAAG6C,EAAI8Y,EAAQne,OAAS,EAAGwC,GAAK6C,EAAG7C,IAC5Cic,GAAUN,EAAQ3b,GAAGob,MAAMpb,EAAI6C,EAAIwZ,EAAY7b,EAAK7B,KAAM,EAAGgd,EAAQ3b,EAAI,GAAGxD,MAAQyf,EAAOze,OAAS,KAAMwC,EAAI6C,GAGlH,OADAoZ,EAASC,GAAgBD,EAAQlC,GAC1B,CAAE2C,MAAOK,EAAgB1I,OAAOhX,EAAM4e,EAAOze,OAAS,GACzDue,QAAS,CAAEvf,KAAMgE,EAAKhE,KAAMyf,OAAQA,EAASlC,EAAMiD,WAC3D,CACJ,CACA,GAAuB,cAAnBzN,EAAM5J,KAAK+G,MAAwBmQ,GAAarc,EAAKhE,KAAM,CAC3D,IAAIygB,EAAWjD,EAAIC,OAAOzZ,EAAKhE,KAAO,GAAI0gB,EAAS,QAAQnM,KAAKkM,EAASte,MAEzE,GAAIue,GAAUA,EAAOnE,OAASxJ,EAAM/S,KAAM,CACtC,IAAIuf,EAAUhC,EAAMgC,QAAQ,CAAC,CAAEvf,KAAMygB,EAASzgB,KAAO0gB,EAAOnE,MAAOpZ,GAAIsd,EAAStd,IAC5E,CAAEnD,KAAMgE,EAAKhE,KAAO+S,EAAM/S,KAAMmD,GAAIa,EAAKb,MAC7C,MAAO,CAAE+c,MAAOA,EAAM7F,IAAIkF,GAAUA,UACxC,CACJ,CACA,IAAIA,EAAU,GACS,eAAnBxM,EAAM5J,KAAK+G,MACXoP,GAAavM,EAAM4L,KAAMnB,EAAK+B,GAClC,IAAIoB,EAAY5N,EAAM4L,MAAQ5L,EAAM4L,KAAK3e,KAAOgE,EAAKhE,KACjDyf,EAAS,GAEb,IAAKkB,GAAa,kBAAkBpM,KAAKvQ,EAAK7B,MAAM,GAAGnB,QAAU+R,EAAM5P,GACnE,IAAK,IAAIK,EAAI,EAAG6C,EAAI8Y,EAAQne,OAAS,EAAGwC,GAAK6C,EAAG7C,IAC5Cic,GAAUjc,GAAK6C,GAAMsa,EACfxB,EAAQ3b,GAAGob,MAAMpb,EAAI6C,EAAIwZ,EAAY7b,EAAK7B,KAAM,EAAGgd,EAAQ3b,EAAI,GAAGxD,MAAQyf,EAAOze,OAAS,MAD/Dme,EAAQ3b,GAAGsb,OAAOtB,EAAK,GAIhE,IAAIxd,EAAOa,EACX,KAAOb,EAAOgE,EAAKhE,MAAQ,KAAKsG,KAAKtC,EAAK7B,KAAKye,OAAO5gB,EAAOgE,EAAKhE,KAAO,KACrEA,IAGJ,OAFAyf,EAASC,GAAgBD,EAAQlC,GACjCgC,EAAQte,KAAK,CAAEjB,OAAMmD,GAAItC,EAAK4e,OAAQlC,EAAMiD,UAAYf,IACjD,CAAES,MAAOK,EAAgB1I,OAAO7X,EAAOyf,EAAOze,OAAS,GAAIue,aAEtE,OAAIS,IAEJD,EAASxC,EAAMsD,OAAOtB,EAAS,CAAEuB,gBAAgB,EAAMC,UAAW,YAC3D,IAEX,SAASC,GAAO7X,GACZ,MAAoB,aAAbA,EAAK+G,MAAoC,YAAb/G,EAAK+G,IAC5C,CAgCK,MAAC+Q,GAAuB,EAAG1D,QAAOwC,eACnC,IAAIzR,EAAO4P,EAAWX,GAClByC,EAAO,KAAMT,EAAUhC,EAAM0C,cAAcC,IAC3C,IAAIrf,EAAMqf,EAAMlgB,MAAMwd,IAAEA,GAAQD,EAChC,GAAI2C,EAAMC,OAAS5B,GAAiB6B,WAAW7C,EAAO2C,EAAMlgB,MAAO,CAC/D,IAAIgE,EAAOwZ,EAAIC,OAAO5c,GAClBse,EAAUD,GArC1B,SAA8B5Q,EAAMzN,GAChC,IAAIsI,EAAOmF,EAAK6P,aAAatd,GAAK,GAAKqgB,EAAOrgB,EAC1CmgB,GAAO7X,KACP+X,EAAO/X,EAAKnJ,KACZmJ,EAAOA,EAAK+O,QAEhB,IAAK,IAAIsH,EAAMA,EAAOrW,EAAKgY,YAAYD,IACnC,GAAIF,GAAOxB,GACP0B,EAAO1B,EAAKxf,SAEX,IAAiB,eAAbwf,EAAKtP,MAAsC,cAAbsP,EAAKtP,KAKxC,MAJA/G,EAAOqW,EAAK4B,UACZF,EAAO/X,EAAKhG,EAIhB,CAEJ,OAAOgG,CACX,CAkBqCkY,CAAqB/S,EAAMzN,GAAM2c,GAC1D,GAAI2B,EAAQne,OAAQ,CAChB,IAAI+R,EAAQoM,EAAQA,EAAQne,OAAS,GACjCsgB,EAAWvO,EAAM5P,GAAK4P,EAAM2L,WAAW1d,QAAU+R,EAAM2L,WAAa,EAAI,GAE5E,GAAI7d,EAAMmD,EAAKhE,KAAOshB,IAAa,KAAKhb,KAAKtC,EAAK7B,KAAKyB,MAAM0d,EAAUzgB,EAAMmD,EAAKhE,OAC9E,MAAO,CAAEkgB,MAAOK,EAAgB1I,OAAO7T,EAAKhE,KAAOshB,GAC/C/B,QAAS,CAAEvf,KAAMgE,EAAKhE,KAAOshB,EAAUne,GAAItC,IACnD,GAAIA,EAAMmD,EAAKhE,MAAQshB,KAIjBvO,EAAM4L,MAAQ3a,EAAKhE,MAAQ+S,EAAM4L,KAAK3e,OAAS,KAAKsG,KAAKtC,EAAK7B,KAAKyB,MAAM,EAAGmP,EAAM5P,MAAO,CAC3F,IAAIrB,EAAQkC,EAAKhE,KAAO+S,EAAM/S,KAE9B,GAAI+S,EAAM4L,MAAQ5L,EAAM5J,KAAKnJ,KAAO+S,EAAM4L,KAAK3e,MAAQ,KAAKsG,KAAKtC,EAAK7B,KAAKyB,MAAMmP,EAAM/S,KAAM+S,EAAM5P,KAAM,CACrG,IAAIsc,EAAS1M,EAAM6L,MAAMiB,EAAY7b,EAAK7B,KAAM,EAAG4Q,EAAM5P,IAAM0c,EAAY7b,EAAK7B,KAAM,EAAG4Q,EAAM/S,OAG/F,OAFI8B,GAASkC,EAAKhE,OACdyf,EAASC,GAAgBD,EAAQlC,IAC9B,CAAE2C,MAAOK,EAAgB1I,OAAO/V,EAAQ2d,EAAOze,QAClDue,QAAS,CAAEvf,KAAM8B,EAAOqB,GAAIa,EAAKhE,KAAO+S,EAAM5P,GAAIsc,UAC1D,CAEA,GAAI3d,EAAQjB,EACR,MAAO,CAAEqf,MAAOK,EAAgB1I,OAAO/V,GAAQyd,QAAS,CAAEvf,KAAM8B,EAAOqB,GAAItC,GACnF,CACJ,CACJ,CACA,OAAOmf,EAAO,CAAEE,WAEpB,OAAIF,IAEJD,EAASxC,EAAMsD,OAAOtB,EAAS,CAAEuB,gBAAgB,EAAMC,UAAW,aAC3D,IASLQ,GAAiB,CACnB,CAAEC,IAAK,QAASC,IAAK3B,IACrB,CAAE0B,IAAK,YAAaC,IAAKR,KAEvBS,GAA2BC,EAAK,CAAEC,kBAAkB,IAI1D,SAASC,GAASrR,EAAS,IACvB,IAAIsR,cAAEA,EAAaC,oBAAEA,EAAmBC,UAAEA,GAAY,EAAMhb,MAAMxB,OAAEA,GAAW8Y,GAAkB2D,iBAAEA,GAAmB,GAASzR,EAC/H,KAAMhL,aAAkBgK,IACpB,MAAM,IAAI5C,WAAW,kEACzB,IACqCsV,EADjCC,EAAa3R,EAAO2R,WAAa,CAAC3R,EAAO2R,YAAc,GACvDC,EAAU,CAACV,GAAYU,SACvBL,aAA+BM,GAC/BD,EAAQnhB,KAAK8gB,EAAoBK,SACjCF,EAAcH,EAAoBO,UAE7BP,IACLG,EAAcH,GAElB,IAAIQ,EAAaT,GAAiBI,GA/TfM,EA+T2CV,EA/ThCW,EA+T+CP,EA9TrEQ,IACJ,GAAIA,GAAQF,EAAW,CACnB,IAAI1Q,EAAQ,KAOZ,GALA4Q,EAAO,MAAMnO,KAAKmO,GAAM,GAEpB5Q,EADoB,mBAAb0Q,EACCA,EAAUE,GAEVC,EAAoBC,kBAAkBJ,EAAWE,GAAM,GAC/D5Q,aAAiB6Q,EACjB,OAAO7Q,EAAMsQ,QAAUtQ,EAAMsQ,QAAQE,SAAS9c,OAASqd,EAAaC,kBAAkBhR,EAAMiR,QAC3F,GAAIjR,EACL,OAAOA,EAAMtM,MACrB,CACA,OAAOid,EAAkBA,EAAgBjd,OAAS,YAgTsCsB,EA/ThG,IAAuB0b,EAAWC,EAgU9BN,EAAWlhB,KD6iDf,SAAmBuP,GACf,IAAI+R,WAAEA,EAAUS,WAAEA,GAAexS,EAC7B2B,EAAO8Q,EAAW,CAAC9Z,EAAMiC,KACzB,IAAI+E,EAAKhH,EAAKrJ,KAAKqQ,GACnB,IAAIoS,GAAepS,GAAMvO,EAAK+F,WAAawI,GAAMvO,EAAKgG,YAWjD,GAAIob,IAAe7S,GAAMvO,EAAKyH,WAAa8G,GAAMvO,EAAK8S,SAAWvE,GAAMvO,EAAK4H,cAC7E,MAAO,CAAEhE,OAAQwd,EAAYE,QAAS3I,GAAcpR,EAAKA,KAAMA,EAAKnJ,KAAMmJ,EAAKhG,SAZhB,CAC/D,IAAIuf,EAAO,GACX,GAAIvS,GAAMvO,EAAKgG,WAAY,CACvB,IAAIub,EAAWha,EAAKA,KAAKia,SAASxhB,EAAKsG,UACnCib,IACAT,EAAOtX,EAAM2M,KAAKoL,EAASnjB,KAAMmjB,EAAShgB,IAClD,CACA,IAAIqC,EAAS+c,EAAWG,GACxB,GAAIld,EACA,MAAO,CAAEA,SAAQ0d,QAAS/Z,GAAQA,EAAKrJ,KAAKqQ,IAAMvO,EAAK+E,SAC/D,CAIA,OAAO,OAEX,MAAO,CAAEwL,OACb,CClkDoBkR,CAAU,CAAEd,aAAYS,WAAYtB,GAAYY,SAAS9c,UACrEwc,GACAI,EAAQnhB,KAAKqiB,EAAKC,KAAKC,EAAOvF,GAAGsD,MACrC,IAAIkC,EAAOrF,GAAO5Y,EAAO8K,UAAU6R,IAGnC,OAFIF,GACAG,EAAQnhB,KAAKwiB,EAAK1G,KAAKkB,GAAG,CAAEyF,aAAcC,MACvC,IAAItB,EAAgBoB,EAAMrB,EACrC,CACA,SAASuB,GAAkBxE,GACvB,IAAI5B,MAAEA,EAAK1c,IAAEA,GAAQse,EAAShY,EAAI,4BAA4BoN,KAAKgJ,EAAMqG,SAAS/iB,EAAM,GAAIA,IAC5F,IAAKsG,EACD,OAAO,KACX,IAAImH,EAAO4P,EAAWX,GAAOY,aAAatd,MAC1C,KAAOyN,IAASA,EAAKxO,KAAK+jB,OAAO,CAC7B,GAAiB,aAAbvV,EAAK4B,MAAoC,cAAb5B,EAAK4B,MAAqC,8BAAb5B,EAAK4B,MACjD,gBAAb5B,EAAK4B,MAAuC,QAAb5B,EAAK4B,MAA+B,SAAb5B,EAAK4B,KAC3D,OAAO,KACX5B,EAAOA,EAAK4J,MAChB,CACA,MAAO,CACHlY,KAAMa,EAAMsG,EAAE,GAAGnG,OAAQmC,GAAItC,EAC7BijB,QAASC,KACTC,SAAU,6BAElB,CACA,IAAIC,GAAkB,KACtB,SAASF,KACL,GAAIE,GACA,OAAOA,GACX,IAAItgB,EAASugB,EAAqB,IAAIC,EAAkBC,EAAYvkB,OAAO,CAAEsiB,WAAYT,KAAgB,GAAG,IAC5G,OAAOuC,GAAkBtgB,EAASA,EAAOmgB,QAAU,EACvD","x_google_ignoreList":[0,1]}
+{"version":3,"file":"markdown.js","sources":["../node_modules/@lezer/markdown/node_modules/@lezer/common/dist/index.js","../node_modules/@lezer/markdown/dist/index.js","../node_modules/@codemirror/lang-markdown/dist/index.js"],"sourcesContent":["/**\nThe default maximum length of a `TreeBuffer` node.\n*/\nconst DefaultBufferLength = 1024;\nlet nextPropID = 0;\nclass Range {\n    constructor(from, to) {\n        this.from = from;\n        this.to = to;\n    }\n}\n/**\nEach [node type](#common.NodeType) or [individual tree](#common.Tree)\ncan have metadata associated with it in props. Instances of this\nclass represent prop names.\n*/\nclass NodeProp {\n    /**\n    Create a new node prop type.\n    */\n    constructor(config = {}) {\n        this.id = nextPropID++;\n        this.perNode = !!config.perNode;\n        this.deserialize = config.deserialize || (() => {\n            throw new Error(\"This node type doesn't define a deserialize function\");\n        });\n        this.combine = config.combine || null;\n    }\n    /**\n    This is meant to be used with\n    [`NodeSet.extend`](#common.NodeSet.extend) or\n    [`LRParser.configure`](#lr.ParserConfig.props) to compute\n    prop values for each node type in the set. Takes a [match\n    object](#common.NodeType^match) or function that returns undefined\n    if the node type doesn't get this prop, and the prop's value if\n    it does.\n    */\n    add(match) {\n        if (this.perNode)\n            throw new RangeError(\"Can't add per-node props to node types\");\n        if (typeof match != \"function\")\n            match = NodeType.match(match);\n        return (type) => {\n            let result = match(type);\n            return result === undefined ? null : [this, result];\n        };\n    }\n}\n/**\nProp that is used to describe matching delimiters. For opening\ndelimiters, this holds an array of node names (written as a\nspace-separated string when declaring this prop in a grammar)\nfor the node types of closing delimiters that match it.\n*/\nNodeProp.closedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/**\nThe inverse of [`closedBy`](#common.NodeProp^closedBy). This is\nattached to closing delimiters, holding an array of node names\nof types of matching opening delimiters.\n*/\nNodeProp.openedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/**\nUsed to assign node types to groups (for example, all node\ntypes that represent an expression could be tagged with an\n`\"Expression\"` group).\n*/\nNodeProp.group = new NodeProp({ deserialize: str => str.split(\" \") });\n/**\nAttached to nodes to indicate these should be\n[displayed](https://codemirror.net/docs/ref/#language.syntaxTree)\nin a bidirectional text isolate, so that direction-neutral\ncharacters on their sides don't incorrectly get associated with\nsurrounding text. You'll generally want to set this for nodes\nthat contain arbitrary text, like strings and comments, and for\nnodes that appear _inside_ arbitrary text, like HTML tags. When\nnot given a value, in a grammar declaration, defaults to\n`\"auto\"`.\n*/\nNodeProp.isolate = new NodeProp({ deserialize: value => {\n        if (value && value != \"rtl\" && value != \"ltr\" && value != \"auto\")\n            throw new RangeError(\"Invalid value for isolate: \" + value);\n        return value || \"auto\";\n    } });\n/**\nThe hash of the [context](#lr.ContextTracker.constructor)\nthat the node was parsed in, if any. Used to limit reuse of\ncontextual nodes.\n*/\nNodeProp.contextHash = new NodeProp({ perNode: true });\n/**\nThe distance beyond the end of the node that the tokenizer\nlooked ahead for any of the tokens inside the node. (The LR\nparser only stores this when it is larger than 25, for\nefficiency reasons.)\n*/\nNodeProp.lookAhead = new NodeProp({ perNode: true });\n/**\nThis per-node prop is used to replace a given node, or part of a\nnode, with another tree. This is useful to include trees from\ndifferent languages in mixed-language parsers.\n*/\nNodeProp.mounted = new NodeProp({ perNode: true });\n/**\nA mounted tree, which can be [stored](#common.NodeProp^mounted) on\na tree node to indicate that parts of its content are\nrepresented by another tree.\n*/\nclass MountedTree {\n    constructor(\n    /**\n    The inner tree.\n    */\n    tree, \n    /**\n    If this is null, this tree replaces the entire node (it will\n    be included in the regular iteration instead of its host\n    node). If not, only the given ranges are considered to be\n    covered by this tree. This is used for trees that are mixed in\n    a way that isn't strictly hierarchical. Such mounted trees are\n    only entered by [`resolveInner`](#common.Tree.resolveInner)\n    and [`enter`](#common.SyntaxNode.enter).\n    */\n    overlay, \n    /**\n    The parser used to create this subtree.\n    */\n    parser, \n    /**\n    [Indicates](#common.IterMode.EnterBracketed) that the nested\n    content is delineated with some kind\n    of bracket token.\n    */\n    bracketed = false) {\n        this.tree = tree;\n        this.overlay = overlay;\n        this.parser = parser;\n        this.bracketed = bracketed;\n    }\n    /**\n    @internal\n    */\n    static get(tree) {\n        return tree && tree.props && tree.props[NodeProp.mounted.id];\n    }\n}\nconst noProps = Object.create(null);\n/**\nEach node in a syntax tree has a node type associated with it.\n*/\nclass NodeType {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The name of the node type. Not necessarily unique, but if the\n    grammar was written properly, different node types with the\n    same name within a node set should play the same semantic\n    role.\n    */\n    name, \n    /**\n    @internal\n    */\n    props, \n    /**\n    The id of this node in its set. Corresponds to the term ids\n    used in the parser.\n    */\n    id, \n    /**\n    @internal\n    */\n    flags = 0) {\n        this.name = name;\n        this.props = props;\n        this.id = id;\n        this.flags = flags;\n    }\n    /**\n    Define a node type.\n    */\n    static define(spec) {\n        let props = spec.props && spec.props.length ? Object.create(null) : noProps;\n        let flags = (spec.top ? 1 /* NodeFlag.Top */ : 0) | (spec.skipped ? 2 /* NodeFlag.Skipped */ : 0) |\n            (spec.error ? 4 /* NodeFlag.Error */ : 0) | (spec.name == null ? 8 /* NodeFlag.Anonymous */ : 0);\n        let type = new NodeType(spec.name || \"\", props, spec.id, flags);\n        if (spec.props)\n            for (let src of spec.props) {\n                if (!Array.isArray(src))\n                    src = src(type);\n                if (src) {\n                    if (src[0].perNode)\n                        throw new RangeError(\"Can't store a per-node prop on a node type\");\n                    props[src[0].id] = src[1];\n                }\n            }\n        return type;\n    }\n    /**\n    Retrieves a node prop for this type. Will return `undefined` if\n    the prop isn't present on this node.\n    */\n    prop(prop) { return this.props[prop.id]; }\n    /**\n    True when this is the top node of a grammar.\n    */\n    get isTop() { return (this.flags & 1 /* NodeFlag.Top */) > 0; }\n    /**\n    True when this node is produced by a skip rule.\n    */\n    get isSkipped() { return (this.flags & 2 /* NodeFlag.Skipped */) > 0; }\n    /**\n    Indicates whether this is an error node.\n    */\n    get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }\n    /**\n    When true, this node type doesn't correspond to a user-declared\n    named node, for example because it is used to cache repetition.\n    */\n    get isAnonymous() { return (this.flags & 8 /* NodeFlag.Anonymous */) > 0; }\n    /**\n    Returns true when this node's name or one of its\n    [groups](#common.NodeProp^group) matches the given string.\n    */\n    is(name) {\n        if (typeof name == 'string') {\n            if (this.name == name)\n                return true;\n            let group = this.prop(NodeProp.group);\n            return group ? group.indexOf(name) > -1 : false;\n        }\n        return this.id == name;\n    }\n    /**\n    Create a function from node types to arbitrary values by\n    specifying an object whose property names are node or\n    [group](#common.NodeProp^group) names. Often useful with\n    [`NodeProp.add`](#common.NodeProp.add). You can put multiple\n    names, separated by spaces, in a single property name to map\n    multiple node names to a single value.\n    */\n    static match(map) {\n        let direct = Object.create(null);\n        for (let prop in map)\n            for (let name of prop.split(\" \"))\n                direct[name] = map[prop];\n        return (node) => {\n            for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {\n                let found = direct[i < 0 ? node.name : groups[i]];\n                if (found)\n                    return found;\n            }\n        };\n    }\n}\n/**\nAn empty dummy node type to use when no actual type is available.\n*/\nNodeType.none = new NodeType(\"\", Object.create(null), 0, 8 /* NodeFlag.Anonymous */);\n/**\nA node set holds a collection of node types. It is used to\ncompactly represent trees by storing their type ids, rather than a\nfull pointer to the type object, in a numeric array. Each parser\n[has](#lr.LRParser.nodeSet) a node set, and [tree\nbuffers](#common.TreeBuffer) can only store collections of nodes\nfrom the same set. A set can have a maximum of 2**16 (65536) node\ntypes in it, so that the ids fit into 16-bit typed array slots.\n*/\nclass NodeSet {\n    /**\n    Create a set with the given types. The `id` property of each\n    type should correspond to its position within the array.\n    */\n    constructor(\n    /**\n    The node types in this set, by id.\n    */\n    types) {\n        this.types = types;\n        for (let i = 0; i < types.length; i++)\n            if (types[i].id != i)\n                throw new RangeError(\"Node type ids should correspond to array positions when creating a node set\");\n    }\n    /**\n    Create a copy of this set with some node properties added. The\n    arguments to this method can be created with\n    [`NodeProp.add`](#common.NodeProp.add).\n    */\n    extend(...props) {\n        let newTypes = [];\n        for (let type of this.types) {\n            let newProps = null;\n            for (let source of props) {\n                let add = source(type);\n                if (add) {\n                    if (!newProps)\n                        newProps = Object.assign({}, type.props);\n                    let value = add[1], prop = add[0];\n                    if (prop.combine && prop.id in newProps)\n                        value = prop.combine(newProps[prop.id], value);\n                    newProps[prop.id] = value;\n                }\n            }\n            newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);\n        }\n        return new NodeSet(newTypes);\n    }\n}\nconst CachedNode = new WeakMap(), CachedInnerNode = new WeakMap();\n/**\nOptions that control iteration. Can be combined with the `|`\noperator to enable multiple ones.\n*/\nvar IterMode;\n(function (IterMode) {\n    /**\n    When enabled, iteration will only visit [`Tree`](#common.Tree)\n    objects, not nodes packed into\n    [`TreeBuffer`](#common.TreeBuffer)s.\n    */\n    IterMode[IterMode[\"ExcludeBuffers\"] = 1] = \"ExcludeBuffers\";\n    /**\n    Enable this to make iteration include anonymous nodes (such as\n    the nodes that wrap repeated grammar constructs into a balanced\n    tree).\n    */\n    IterMode[IterMode[\"IncludeAnonymous\"] = 2] = \"IncludeAnonymous\";\n    /**\n    By default, regular [mounted](#common.NodeProp^mounted) nodes\n    replace their base node in iteration. Enable this to ignore them\n    instead.\n    */\n    IterMode[IterMode[\"IgnoreMounts\"] = 4] = \"IgnoreMounts\";\n    /**\n    This option only applies in\n    [`enter`](#common.SyntaxNode.enter)-style methods. It tells the\n    library to not enter mounted overlays if one covers the given\n    position.\n    */\n    IterMode[IterMode[\"IgnoreOverlays\"] = 8] = \"IgnoreOverlays\";\n    /**\n    When set, positions on the boundary of a mounted overlay tree\n    that has its [`bracketed`](#common.NestedParse.bracketed) flag\n    set will enter that tree regardless of side. Only supported in\n    [`enter`](#common.SyntaxNode.enter), not in cursors.\n    */\n    IterMode[IterMode[\"EnterBracketed\"] = 16] = \"EnterBracketed\";\n})(IterMode || (IterMode = {}));\n/**\nA piece of syntax tree. There are two ways to approach these\ntrees: the way they are actually stored in memory, and the\nconvenient way.\n\nSyntax trees are stored as a tree of `Tree` and `TreeBuffer`\nobjects. By packing detail information into `TreeBuffer` leaf\nnodes, the representation is made a lot more memory-efficient.\n\nHowever, when you want to actually work with tree nodes, this\nrepresentation is very awkward, so most client code will want to\nuse the [`TreeCursor`](#common.TreeCursor) or\n[`SyntaxNode`](#common.SyntaxNode) interface instead, which provides\na view on some part of this data structure, and can be used to\nmove around to adjacent nodes.\n*/\nclass Tree {\n    /**\n    Construct a new tree. See also [`Tree.build`](#common.Tree^build).\n    */\n    constructor(\n    /**\n    The type of the top node.\n    */\n    type, \n    /**\n    This node's child nodes.\n    */\n    children, \n    /**\n    The positions (offsets relative to the start of this tree) of\n    the children.\n    */\n    positions, \n    /**\n    The total length of this tree\n    */\n    length, \n    /**\n    Per-node [node props](#common.NodeProp) to associate with this node.\n    */\n    props) {\n        this.type = type;\n        this.children = children;\n        this.positions = positions;\n        this.length = length;\n        /**\n        @internal\n        */\n        this.props = null;\n        if (props && props.length) {\n            this.props = Object.create(null);\n            for (let [prop, value] of props)\n                this.props[typeof prop == \"number\" ? prop : prop.id] = value;\n        }\n    }\n    /**\n    @internal\n    */\n    toString() {\n        let mounted = MountedTree.get(this);\n        if (mounted && !mounted.overlay)\n            return mounted.tree.toString();\n        let children = \"\";\n        for (let ch of this.children) {\n            let str = ch.toString();\n            if (str) {\n                if (children)\n                    children += \",\";\n                children += str;\n            }\n        }\n        return !this.type.name ? children :\n            (/\\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) +\n                (children.length ? \"(\" + children + \")\" : \"\");\n    }\n    /**\n    Get a [tree cursor](#common.TreeCursor) positioned at the top of\n    the tree. Mode can be used to [control](#common.IterMode) which\n    nodes the cursor visits.\n    */\n    cursor(mode = 0) {\n        return new TreeCursor(this.topNode, mode);\n    }\n    /**\n    Get a [tree cursor](#common.TreeCursor) pointing into this tree\n    at the given position and side (see\n    [`moveTo`](#common.TreeCursor.moveTo).\n    */\n    cursorAt(pos, side = 0, mode = 0) {\n        let scope = CachedNode.get(this) || this.topNode;\n        let cursor = new TreeCursor(scope);\n        cursor.moveTo(pos, side);\n        CachedNode.set(this, cursor._tree);\n        return cursor;\n    }\n    /**\n    Get a [syntax node](#common.SyntaxNode) object for the top of the\n    tree.\n    */\n    get topNode() {\n        return new TreeNode(this, 0, 0, null);\n    }\n    /**\n    Get the [syntax node](#common.SyntaxNode) at the given position.\n    If `side` is -1, this will move into nodes that end at the\n    position. If 1, it'll move into nodes that start at the\n    position. With 0, it'll only enter nodes that cover the position\n    from both sides.\n    \n    Note that this will not enter\n    [overlays](#common.MountedTree.overlay), and you often want\n    [`resolveInner`](#common.Tree.resolveInner) instead.\n    */\n    resolve(pos, side = 0) {\n        let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);\n        CachedNode.set(this, node);\n        return node;\n    }\n    /**\n    Like [`resolve`](#common.Tree.resolve), but will enter\n    [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node\n    pointing into the innermost overlaid tree at the given position\n    (with parent links going through all parent structure, including\n    the host trees).\n    */\n    resolveInner(pos, side = 0) {\n        let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);\n        CachedInnerNode.set(this, node);\n        return node;\n    }\n    /**\n    In some situations, it can be useful to iterate through all\n    nodes around a position, including those in overlays that don't\n    directly cover the position. This method gives you an iterator\n    that will produce all nodes, from small to big, around the given\n    position.\n    */\n    resolveStack(pos, side = 0) {\n        return stackIterator(this, pos, side);\n    }\n    /**\n    Iterate over the tree and its children, calling `enter` for any\n    node that touches the `from`/`to` region (if given) before\n    running over such a node's children, and `leave` (if given) when\n    leaving the node. When `enter` returns `false`, that node will\n    not have its children iterated over (or `leave` called).\n    */\n    iterate(spec) {\n        let { enter, leave, from = 0, to = this.length } = spec;\n        let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;\n        for (let c = this.cursor(mode | IterMode.IncludeAnonymous);;) {\n            let entered = false;\n            if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {\n                if (c.firstChild())\n                    continue;\n                entered = true;\n            }\n            for (;;) {\n                if (entered && leave && (anon || !c.type.isAnonymous))\n                    leave(c);\n                if (c.nextSibling())\n                    break;\n                if (!c.parent())\n                    return;\n                entered = true;\n            }\n        }\n    }\n    /**\n    Get the value of the given [node prop](#common.NodeProp) for this\n    node. Works with both per-node and per-type props.\n    */\n    prop(prop) {\n        return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : undefined;\n    }\n    /**\n    Returns the node's [per-node props](#common.NodeProp.perNode) in a\n    format that can be passed to the [`Tree`](#common.Tree)\n    constructor.\n    */\n    get propValues() {\n        let result = [];\n        if (this.props)\n            for (let id in this.props)\n                result.push([+id, this.props[id]]);\n        return result;\n    }\n    /**\n    Balance the direct children of this tree, producing a copy of\n    which may have children grouped into subtrees with type\n    [`NodeType.none`](#common.NodeType^none).\n    */\n    balance(config = {}) {\n        return this.children.length <= 8 /* Balance.BranchFactor */ ? this :\n            balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));\n    }\n    /**\n    Build a tree from a postfix-ordered buffer of node information,\n    or a cursor over such a buffer.\n    */\n    static build(data) { return buildTree(data); }\n}\n/**\nThe empty tree\n*/\nTree.empty = new Tree(NodeType.none, [], [], 0);\nclass FlatBufferCursor {\n    constructor(buffer, index) {\n        this.buffer = buffer;\n        this.index = index;\n    }\n    get id() { return this.buffer[this.index - 4]; }\n    get start() { return this.buffer[this.index - 3]; }\n    get end() { return this.buffer[this.index - 2]; }\n    get size() { return this.buffer[this.index - 1]; }\n    get pos() { return this.index; }\n    next() { this.index -= 4; }\n    fork() { return new FlatBufferCursor(this.buffer, this.index); }\n}\n/**\nTree buffers contain (type, start, end, endIndex) quads for each\nnode. In such a buffer, nodes are stored in prefix order (parents\nbefore children, with the endIndex of the parent indicating which\nchildren belong to it).\n*/\nclass TreeBuffer {\n    /**\n    Create a tree buffer.\n    */\n    constructor(\n    /**\n    The buffer's content.\n    */\n    buffer, \n    /**\n    The total length of the group of nodes in the buffer.\n    */\n    length, \n    /**\n    The node set used in this buffer.\n    */\n    set) {\n        this.buffer = buffer;\n        this.length = length;\n        this.set = set;\n    }\n    /**\n    @internal\n    */\n    get type() { return NodeType.none; }\n    /**\n    @internal\n    */\n    toString() {\n        let result = [];\n        for (let index = 0; index < this.buffer.length;) {\n            result.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result.join(\",\");\n    }\n    /**\n    @internal\n    */\n    childString(index) {\n        let id = this.buffer[index], endIndex = this.buffer[index + 3];\n        let type = this.set.types[id], result = type.name;\n        if (/\\W/.test(result) && !type.isError)\n            result = JSON.stringify(result);\n        index += 4;\n        if (endIndex == index)\n            return result;\n        let children = [];\n        while (index < endIndex) {\n            children.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result + \"(\" + children.join(\",\") + \")\";\n    }\n    /**\n    @internal\n    */\n    findChild(startIndex, endIndex, dir, pos, side) {\n        let { buffer } = this, pick = -1;\n        for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {\n            if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {\n                pick = i;\n                if (dir > 0)\n                    break;\n            }\n        }\n        return pick;\n    }\n    /**\n    @internal\n    */\n    slice(startI, endI, from) {\n        let b = this.buffer;\n        let copy = new Uint16Array(endI - startI), len = 0;\n        for (let i = startI, j = 0; i < endI;) {\n            copy[j++] = b[i++];\n            copy[j++] = b[i++] - from;\n            let to = copy[j++] = b[i++] - from;\n            copy[j++] = b[i++] - startI;\n            len = Math.max(len, to);\n        }\n        return new TreeBuffer(copy, len, this.set);\n    }\n}\nfunction checkSide(side, pos, from, to) {\n    switch (side) {\n        case -2 /* Side.Before */: return from < pos;\n        case -1 /* Side.AtOrBefore */: return to >= pos && from < pos;\n        case 0 /* Side.Around */: return from < pos && to > pos;\n        case 1 /* Side.AtOrAfter */: return from <= pos && to > pos;\n        case 2 /* Side.After */: return to > pos;\n        case 4 /* Side.DontCare */: return true;\n    }\n}\nfunction resolveNode(node, pos, side, overlays) {\n    var _a;\n    // Move up to a node that actually holds the position, if possible\n    while (node.from == node.to ||\n        (side < 1 ? node.from >= pos : node.from > pos) ||\n        (side > -1 ? node.to <= pos : node.to < pos)) {\n        let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;\n        if (!parent)\n            return node;\n        node = parent;\n    }\n    let mode = overlays ? 0 : IterMode.IgnoreOverlays;\n    // Must go up out of overlays when those do not overlap with pos\n    if (overlays)\n        for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {\n            if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)\n                node = parent;\n        }\n    for (;;) {\n        let inner = node.enter(pos, side, mode);\n        if (!inner)\n            return node;\n        node = inner;\n    }\n}\nclass BaseNode {\n    cursor(mode = 0) { return new TreeCursor(this, mode); }\n    getChild(type, before = null, after = null) {\n        let r = getChildren(this, type, before, after);\n        return r.length ? r[0] : null;\n    }\n    getChildren(type, before = null, after = null) {\n        return getChildren(this, type, before, after);\n    }\n    resolve(pos, side = 0) {\n        return resolveNode(this, pos, side, false);\n    }\n    resolveInner(pos, side = 0) {\n        return resolveNode(this, pos, side, true);\n    }\n    matchContext(context) {\n        return matchNodeContext(this.parent, context);\n    }\n    enterUnfinishedNodesBefore(pos) {\n        let scan = this.childBefore(pos), node = this;\n        while (scan) {\n            let last = scan.lastChild;\n            if (!last || last.to != scan.to)\n                break;\n            if (last.type.isError && last.from == last.to) {\n                node = scan;\n                scan = last.prevSibling;\n            }\n            else {\n                scan = last;\n            }\n        }\n        return node;\n    }\n    get node() { return this; }\n    get next() { return this.parent; }\n}\nclass TreeNode extends BaseNode {\n    constructor(_tree, from, \n    // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)\n    index, _parent) {\n        super();\n        this._tree = _tree;\n        this.from = from;\n        this.index = index;\n        this._parent = _parent;\n    }\n    get type() { return this._tree.type; }\n    get name() { return this._tree.type.name; }\n    get to() { return this.from + this._tree.length; }\n    nextChild(i, dir, pos, side, mode = 0) {\n        for (let parent = this;;) {\n            for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {\n                let next = children[i], start = positions[i] + parent.from, mounted;\n                if (!((mode & IterMode.EnterBracketed) && next instanceof Tree &&\n                    (mounted = MountedTree.get(next)) && !mounted.overlay && mounted.bracketed &&\n                    pos >= start && pos <= start + next.length) &&\n                    !checkSide(side, pos, start, start + next.length))\n                    continue;\n                if (next instanceof TreeBuffer) {\n                    if (mode & IterMode.ExcludeBuffers)\n                        continue;\n                    let index = next.findChild(0, next.buffer.length, dir, pos - start, side);\n                    if (index > -1)\n                        return new BufferNode(new BufferContext(parent, next, i, start), null, index);\n                }\n                else if ((mode & IterMode.IncludeAnonymous) || (!next.type.isAnonymous || hasChild(next))) {\n                    let mounted;\n                    if (!(mode & IterMode.IgnoreMounts) && (mounted = MountedTree.get(next)) && !mounted.overlay)\n                        return new TreeNode(mounted.tree, start, i, parent);\n                    let inner = new TreeNode(next, start, i, parent);\n                    return (mode & IterMode.IncludeAnonymous) || !inner.type.isAnonymous ? inner\n                        : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side, mode);\n                }\n            }\n            if ((mode & IterMode.IncludeAnonymous) || !parent.type.isAnonymous)\n                return null;\n            if (parent.index >= 0)\n                i = parent.index + dir;\n            else\n                i = dir < 0 ? -1 : parent._parent._tree.children.length;\n            parent = parent._parent;\n            if (!parent)\n                return null;\n        }\n    }\n    get firstChild() { return this.nextChild(0, 1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Side.Before */); }\n    prop(prop) { return this._tree.prop(prop); }\n    enter(pos, side, mode = 0) {\n        let mounted;\n        if (!(mode & IterMode.IgnoreOverlays) && (mounted = MountedTree.get(this._tree)) && mounted.overlay) {\n            let rPos = pos - this.from, enterBracketed = (mode & IterMode.EnterBracketed) && mounted.bracketed;\n            for (let { from, to } of mounted.overlay) {\n                if ((side > 0 || enterBracketed ? from <= rPos : from < rPos) &&\n                    (side < 0 || enterBracketed ? to >= rPos : to > rPos))\n                    return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);\n            }\n        }\n        return this.nextChild(0, 1, pos, side, mode);\n    }\n    nextSignificantParent() {\n        let val = this;\n        while (val.type.isAnonymous && val._parent)\n            val = val._parent;\n        return val;\n    }\n    get parent() {\n        return this._parent ? this._parent.nextSignificantParent() : null;\n    }\n    get nextSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index + 1, 1, 0, 4 /* Side.DontCare */) : null;\n    }\n    get prevSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* Side.DontCare */) : null;\n    }\n    get tree() { return this._tree; }\n    toTree() { return this._tree; }\n    /**\n    @internal\n    */\n    toString() { return this._tree.toString(); }\n}\nfunction getChildren(node, type, before, after) {\n    let cur = node.cursor(), result = [];\n    if (!cur.firstChild())\n        return result;\n    if (before != null)\n        for (let found = false; !found;) {\n            found = cur.type.is(before);\n            if (!cur.nextSibling())\n                return result;\n        }\n    for (;;) {\n        if (after != null && cur.type.is(after))\n            return result;\n        if (cur.type.is(type))\n            result.push(cur.node);\n        if (!cur.nextSibling())\n            return after == null ? result : [];\n    }\n}\nfunction matchNodeContext(node, context, i = context.length - 1) {\n    for (let p = node; i >= 0; p = p.parent) {\n        if (!p)\n            return false;\n        if (!p.type.isAnonymous) {\n            if (context[i] && context[i] != p.name)\n                return false;\n            i--;\n        }\n    }\n    return true;\n}\nclass BufferContext {\n    constructor(parent, buffer, index, start) {\n        this.parent = parent;\n        this.buffer = buffer;\n        this.index = index;\n        this.start = start;\n    }\n}\nclass BufferNode extends BaseNode {\n    get name() { return this.type.name; }\n    get from() { return this.context.start + this.context.buffer.buffer[this.index + 1]; }\n    get to() { return this.context.start + this.context.buffer.buffer[this.index + 2]; }\n    constructor(context, _parent, index) {\n        super();\n        this.context = context;\n        this._parent = _parent;\n        this.index = index;\n        this.type = context.buffer.set.types[context.buffer.buffer[index]];\n    }\n    child(dir, pos, side) {\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get firstChild() { return this.child(1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.child(-1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.child(1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.child(-1, pos, -2 /* Side.Before */); }\n    prop(prop) { return this.type.prop(prop); }\n    enter(pos, side, mode = 0) {\n        if (mode & IterMode.ExcludeBuffers)\n            return null;\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get parent() {\n        return this._parent || this.context.parent.nextSignificantParent();\n    }\n    externalSibling(dir) {\n        return this._parent ? null : this.context.parent.nextChild(this.context.index + dir, dir, 0, 4 /* Side.DontCare */);\n    }\n    get nextSibling() {\n        let { buffer } = this.context;\n        let after = buffer.buffer[this.index + 3];\n        if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))\n            return new BufferNode(this.context, this._parent, after);\n        return this.externalSibling(1);\n    }\n    get prevSibling() {\n        let { buffer } = this.context;\n        let parentStart = this._parent ? this._parent.index + 4 : 0;\n        if (this.index == parentStart)\n            return this.externalSibling(-1);\n        return new BufferNode(this.context, this._parent, buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n    }\n    get tree() { return null; }\n    toTree() {\n        let children = [], positions = [];\n        let { buffer } = this.context;\n        let startI = this.index + 4, endI = buffer.buffer[this.index + 3];\n        if (endI > startI) {\n            let from = buffer.buffer[this.index + 1];\n            children.push(buffer.slice(startI, endI, from));\n            positions.push(0);\n        }\n        return new Tree(this.type, children, positions, this.to - this.from);\n    }\n    /**\n    @internal\n    */\n    toString() { return this.context.buffer.childString(this.index); }\n}\nfunction iterStack(heads) {\n    if (!heads.length)\n        return null;\n    let pick = 0, picked = heads[0];\n    for (let i = 1; i < heads.length; i++) {\n        let node = heads[i];\n        if (node.from > picked.from || node.to < picked.to) {\n            picked = node;\n            pick = i;\n        }\n    }\n    let next = picked instanceof TreeNode && picked.index < 0 ? null : picked.parent;\n    let newHeads = heads.slice();\n    if (next)\n        newHeads[pick] = next;\n    else\n        newHeads.splice(pick, 1);\n    return new StackIterator(newHeads, picked);\n}\nclass StackIterator {\n    constructor(heads, node) {\n        this.heads = heads;\n        this.node = node;\n    }\n    get next() { return iterStack(this.heads); }\n}\nfunction stackIterator(tree, pos, side) {\n    let inner = tree.resolveInner(pos, side), layers = null;\n    for (let scan = inner instanceof TreeNode ? inner : inner.context.parent; scan; scan = scan.parent) {\n        if (scan.index < 0) { // This is an overlay root\n            let parent = scan.parent;\n            (layers || (layers = [inner])).push(parent.resolve(pos, side));\n            scan = parent;\n        }\n        else {\n            let mount = MountedTree.get(scan.tree);\n            // Relevant overlay branching off\n            if (mount && mount.overlay && mount.overlay[0].from <= pos && mount.overlay[mount.overlay.length - 1].to >= pos) {\n                let root = new TreeNode(mount.tree, mount.overlay[0].from + scan.from, -1, scan);\n                (layers || (layers = [inner])).push(resolveNode(root, pos, side, false));\n            }\n        }\n    }\n    return layers ? iterStack(layers) : inner;\n}\n/**\nA tree cursor object focuses on a given node in a syntax tree, and\nallows you to move to adjacent nodes.\n*/\nclass TreeCursor {\n    /**\n    Shorthand for `.type.name`.\n    */\n    get name() { return this.type.name; }\n    /**\n    @internal\n    */\n    constructor(node, mode = 0) {\n        /**\n        @internal\n        */\n        this.buffer = null;\n        this.stack = [];\n        /**\n        @internal\n        */\n        this.index = 0;\n        this.bufferNode = null;\n        this.mode = mode & ~IterMode.EnterBracketed;\n        if (node instanceof TreeNode) {\n            this.yieldNode(node);\n        }\n        else {\n            this._tree = node.context.parent;\n            this.buffer = node.context;\n            for (let n = node._parent; n; n = n._parent)\n                this.stack.unshift(n.index);\n            this.bufferNode = node;\n            this.yieldBuf(node.index);\n        }\n    }\n    yieldNode(node) {\n        if (!node)\n            return false;\n        this._tree = node;\n        this.type = node.type;\n        this.from = node.from;\n        this.to = node.to;\n        return true;\n    }\n    yieldBuf(index, type) {\n        this.index = index;\n        let { start, buffer } = this.buffer;\n        this.type = type || buffer.set.types[buffer.buffer[index]];\n        this.from = start + buffer.buffer[index + 1];\n        this.to = start + buffer.buffer[index + 2];\n        return true;\n    }\n    /**\n    @internal\n    */\n    yield(node) {\n        if (!node)\n            return false;\n        if (node instanceof TreeNode) {\n            this.buffer = null;\n            return this.yieldNode(node);\n        }\n        this.buffer = node.context;\n        return this.yieldBuf(node.index, node.type);\n    }\n    /**\n    @internal\n    */\n    toString() {\n        return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();\n    }\n    /**\n    @internal\n    */\n    enterChild(dir, pos, side) {\n        if (!this.buffer)\n            return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));\n        let { buffer } = this.buffer;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);\n        if (index < 0)\n            return false;\n        this.stack.push(this.index);\n        return this.yieldBuf(index);\n    }\n    /**\n    Move the cursor to this node's first child. When this returns\n    false, the node has no child, and the cursor has not been moved.\n    */\n    firstChild() { return this.enterChild(1, 0, 4 /* Side.DontCare */); }\n    /**\n    Move the cursor to this node's last child.\n    */\n    lastChild() { return this.enterChild(-1, 0, 4 /* Side.DontCare */); }\n    /**\n    Move the cursor to the first child that ends after `pos`.\n    */\n    childAfter(pos) { return this.enterChild(1, pos, 2 /* Side.After */); }\n    /**\n    Move to the last child that starts before `pos`.\n    */\n    childBefore(pos) { return this.enterChild(-1, pos, -2 /* Side.Before */); }\n    /**\n    Move the cursor to the child around `pos`. If side is -1 the\n    child may end at that position, when 1 it may start there. This\n    will also enter [overlaid](#common.MountedTree.overlay)\n    [mounted](#common.NodeProp^mounted) trees unless `overlays` is\n    set to false.\n    */\n    enter(pos, side, mode = this.mode) {\n        if (!this.buffer)\n            return this.yield(this._tree.enter(pos, side, mode));\n        return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);\n    }\n    /**\n    Move to the node's parent node, if this isn't the top node.\n    */\n    parent() {\n        if (!this.buffer)\n            return this.yieldNode((this.mode & IterMode.IncludeAnonymous) ? this._tree._parent : this._tree.parent);\n        if (this.stack.length)\n            return this.yieldBuf(this.stack.pop());\n        let parent = (this.mode & IterMode.IncludeAnonymous) ? this.buffer.parent : this.buffer.parent.nextSignificantParent();\n        this.buffer = null;\n        return this.yieldNode(parent);\n    }\n    /**\n    @internal\n    */\n    sibling(dir) {\n        if (!this.buffer)\n            return !this._tree._parent ? false\n                : this.yield(this._tree.index < 0 ? null\n                    : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode));\n        let { buffer } = this.buffer, d = this.stack.length - 1;\n        if (dir < 0) {\n            let parentStart = d < 0 ? 0 : this.stack[d] + 4;\n            if (this.index != parentStart)\n                return this.yieldBuf(buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n        }\n        else {\n            let after = buffer.buffer[this.index + 3];\n            if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))\n                return this.yieldBuf(after);\n        }\n        return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode)) : false;\n    }\n    /**\n    Move to this node's next sibling, if any.\n    */\n    nextSibling() { return this.sibling(1); }\n    /**\n    Move to this node's previous sibling, if any.\n    */\n    prevSibling() { return this.sibling(-1); }\n    atLastNode(dir) {\n        let index, parent, { buffer } = this;\n        if (buffer) {\n            if (dir > 0) {\n                if (this.index < buffer.buffer.buffer.length)\n                    return false;\n            }\n            else {\n                for (let i = 0; i < this.index; i++)\n                    if (buffer.buffer.buffer[i + 3] < this.index)\n                        return false;\n            }\n            ({ index, parent } = buffer);\n        }\n        else {\n            ({ index, _parent: parent } = this._tree);\n        }\n        for (; parent; { index, _parent: parent } = parent) {\n            if (index > -1)\n                for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {\n                    let child = parent._tree.children[i];\n                    if ((this.mode & IterMode.IncludeAnonymous) ||\n                        child instanceof TreeBuffer ||\n                        !child.type.isAnonymous ||\n                        hasChild(child))\n                        return false;\n                }\n        }\n        return true;\n    }\n    move(dir, enter) {\n        if (enter && this.enterChild(dir, 0, 4 /* Side.DontCare */))\n            return true;\n        for (;;) {\n            if (this.sibling(dir))\n                return true;\n            if (this.atLastNode(dir) || !this.parent())\n                return false;\n        }\n    }\n    /**\n    Move to the next node in a\n    [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)\n    traversal, going from a node to its first child or, if the\n    current node is empty or `enter` is false, its next sibling or\n    the next sibling of the first parent node that has one.\n    */\n    next(enter = true) { return this.move(1, enter); }\n    /**\n    Move to the next node in a last-to-first pre-order traversal. A\n    node is followed by its last child or, if it has none, its\n    previous sibling or the previous sibling of the first parent\n    node that has one.\n    */\n    prev(enter = true) { return this.move(-1, enter); }\n    /**\n    Move the cursor to the innermost node that covers `pos`. If\n    `side` is -1, it will enter nodes that end at `pos`. If it is 1,\n    it will enter nodes that start at `pos`.\n    */\n    moveTo(pos, side = 0) {\n        // Move up to a node that actually holds the position, if possible\n        while (this.from == this.to ||\n            (side < 1 ? this.from >= pos : this.from > pos) ||\n            (side > -1 ? this.to <= pos : this.to < pos))\n            if (!this.parent())\n                break;\n        // Then scan down into child nodes as far as possible\n        while (this.enterChild(1, pos, side)) { }\n        return this;\n    }\n    /**\n    Get a [syntax node](#common.SyntaxNode) at the cursor's current\n    position.\n    */\n    get node() {\n        if (!this.buffer)\n            return this._tree;\n        let cache = this.bufferNode, result = null, depth = 0;\n        if (cache && cache.context == this.buffer) {\n            scan: for (let index = this.index, d = this.stack.length; d >= 0;) {\n                for (let c = cache; c; c = c._parent)\n                    if (c.index == index) {\n                        if (index == this.index)\n                            return c;\n                        result = c;\n                        depth = d + 1;\n                        break scan;\n                    }\n                index = this.stack[--d];\n            }\n        }\n        for (let i = depth; i < this.stack.length; i++)\n            result = new BufferNode(this.buffer, result, this.stack[i]);\n        return this.bufferNode = new BufferNode(this.buffer, result, this.index);\n    }\n    /**\n    Get the [tree](#common.Tree) that represents the current node, if\n    any. Will return null when the node is in a [tree\n    buffer](#common.TreeBuffer).\n    */\n    get tree() {\n        return this.buffer ? null : this._tree._tree;\n    }\n    /**\n    Iterate over the current node and all its descendants, calling\n    `enter` when entering a node and `leave`, if given, when leaving\n    one. When `enter` returns `false`, any children of that node are\n    skipped, and `leave` isn't called for it.\n    */\n    iterate(enter, leave) {\n        for (let depth = 0;;) {\n            let mustLeave = false;\n            if (this.type.isAnonymous || enter(this) !== false) {\n                if (this.firstChild()) {\n                    depth++;\n                    continue;\n                }\n                if (!this.type.isAnonymous)\n                    mustLeave = true;\n            }\n            for (;;) {\n                if (mustLeave && leave)\n                    leave(this);\n                mustLeave = this.type.isAnonymous;\n                if (!depth)\n                    return;\n                if (this.nextSibling())\n                    break;\n                this.parent();\n                depth--;\n                mustLeave = true;\n            }\n        }\n    }\n    /**\n    Test whether the current node matches a given context—a sequence\n    of direct parent node names. Empty strings in the context array\n    are treated as wildcards.\n    */\n    matchContext(context) {\n        if (!this.buffer)\n            return matchNodeContext(this.node.parent, context);\n        let { buffer } = this.buffer, { types } = buffer.set;\n        for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {\n            if (d < 0)\n                return matchNodeContext(this._tree, context, i);\n            let type = types[buffer.buffer[this.stack[d]]];\n            if (!type.isAnonymous) {\n                if (context[i] && context[i] != type.name)\n                    return false;\n                i--;\n            }\n        }\n        return true;\n    }\n}\nfunction hasChild(tree) {\n    return tree.children.some(ch => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));\n}\nfunction buildTree(data) {\n    var _a;\n    let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;\n    let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;\n    let types = nodeSet.types;\n    let contextHash = 0, lookAhead = 0;\n    function takeNode(parentStart, minPos, children, positions, inRepeat, depth) {\n        let { id, start, end, size } = cursor;\n        let lookAheadAtStart = lookAhead, contextAtStart = contextHash;\n        if (size < 0) {\n            cursor.next();\n            if (size == -1 /* SpecialRecord.Reuse */) {\n                let node = reused[id];\n                children.push(node);\n                positions.push(start - parentStart);\n                return;\n            }\n            else if (size == -3 /* SpecialRecord.ContextChange */) { // Context change\n                contextHash = id;\n                return;\n            }\n            else if (size == -4 /* SpecialRecord.LookAhead */) {\n                lookAhead = id;\n                return;\n            }\n            else {\n                throw new RangeError(`Unrecognized record size: ${size}`);\n            }\n        }\n        let type = types[id], node, buffer;\n        let startPos = start - parentStart;\n        if (end - start <= maxBufferLength && (buffer = findBufferSize(cursor.pos - minPos, inRepeat))) {\n            // Small enough for a buffer, and no reused nodes inside\n            let data = new Uint16Array(buffer.size - buffer.skip);\n            let endPos = cursor.pos - buffer.size, index = data.length;\n            while (cursor.pos > endPos)\n                index = copyToBuffer(buffer.start, data, index);\n            node = new TreeBuffer(data, end - buffer.start, nodeSet);\n            startPos = buffer.start - parentStart;\n        }\n        else { // Make it a node\n            let endPos = cursor.pos - size;\n            cursor.next();\n            let localChildren = [], localPositions = [];\n            let localInRepeat = id >= minRepeatType ? id : -1;\n            let lastGroup = 0, lastEnd = end;\n            while (cursor.pos > endPos) {\n                if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {\n                    if (cursor.end <= lastEnd - maxBufferLength) {\n                        makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart, contextAtStart);\n                        lastGroup = localChildren.length;\n                        lastEnd = cursor.end;\n                    }\n                    cursor.next();\n                }\n                else if (depth > 2500 /* CutOff.Depth */) {\n                    takeFlatNode(start, endPos, localChildren, localPositions);\n                }\n                else {\n                    takeNode(start, endPos, localChildren, localPositions, localInRepeat, depth + 1);\n                }\n            }\n            if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)\n                makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart, contextAtStart);\n            localChildren.reverse();\n            localPositions.reverse();\n            if (localInRepeat > -1 && lastGroup > 0) {\n                let make = makeBalanced(type, contextAtStart);\n                node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);\n            }\n            else {\n                node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end, contextAtStart);\n            }\n        }\n        children.push(node);\n        positions.push(startPos);\n    }\n    function takeFlatNode(parentStart, minPos, children, positions) {\n        let nodes = []; // Temporary, inverted array of leaf nodes found, with absolute positions\n        let nodeCount = 0, stopAt = -1;\n        while (cursor.pos > minPos) {\n            let { id, start, end, size } = cursor;\n            if (size > 4) { // Not a leaf\n                cursor.next();\n            }\n            else if (stopAt > -1 && start < stopAt) {\n                break;\n            }\n            else {\n                if (stopAt < 0)\n                    stopAt = end - maxBufferLength;\n                nodes.push(id, start, end);\n                nodeCount++;\n                cursor.next();\n            }\n        }\n        if (nodeCount) {\n            let buffer = new Uint16Array(nodeCount * 4);\n            let start = nodes[nodes.length - 2];\n            for (let i = nodes.length - 3, j = 0; i >= 0; i -= 3) {\n                buffer[j++] = nodes[i];\n                buffer[j++] = nodes[i + 1] - start;\n                buffer[j++] = nodes[i + 2] - start;\n                buffer[j++] = j;\n            }\n            children.push(new TreeBuffer(buffer, nodes[2] - start, nodeSet));\n            positions.push(start - parentStart);\n        }\n    }\n    function makeBalanced(type, contextHash) {\n        return (children, positions, length) => {\n            let lookAhead = 0, lastI = children.length - 1, last, lookAheadProp;\n            if (lastI >= 0 && (last = children[lastI]) instanceof Tree) {\n                if (!lastI && last.type == type && last.length == length)\n                    return last;\n                if (lookAheadProp = last.prop(NodeProp.lookAhead))\n                    lookAhead = positions[lastI] + last.length + lookAheadProp;\n            }\n            return makeTree(type, children, positions, length, lookAhead, contextHash);\n        };\n    }\n    function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead, contextHash) {\n        let localChildren = [], localPositions = [];\n        while (children.length > i) {\n            localChildren.push(children.pop());\n            localPositions.push(positions.pop() + base - from);\n        }\n        children.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead - to, contextHash));\n        positions.push(from - base);\n    }\n    function makeTree(type, children, positions, length, lookAhead, contextHash, props) {\n        if (contextHash) {\n            let pair = [NodeProp.contextHash, contextHash];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        if (lookAhead > 25) {\n            let pair = [NodeProp.lookAhead, lookAhead];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        return new Tree(type, children, positions, length, props);\n    }\n    function findBufferSize(maxSize, inRepeat) {\n        // Scan through the buffer to find previous siblings that fit\n        // together in a TreeBuffer, and don't contain any reused nodes\n        // (which can't be stored in a buffer).\n        // If `inRepeat` is > -1, ignore node boundaries of that type for\n        // nesting, but make sure the end falls either at the start\n        // (`maxSize`) or before such a node.\n        let fork = cursor.fork();\n        let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;\n        let result = { size: 0, start: 0, skip: 0 };\n        scan: for (let minPos = fork.pos - maxSize; fork.pos > minPos;) {\n            let nodeSize = fork.size;\n            // Pretend nested repeat nodes of the same type don't exist\n            if (fork.id == inRepeat && nodeSize >= 0) {\n                // Except that we store the current state as a valid return\n                // value.\n                result.size = size;\n                result.start = start;\n                result.skip = skip;\n                skip += 4;\n                size += 4;\n                fork.next();\n                continue;\n            }\n            let startPos = fork.pos - nodeSize;\n            if (nodeSize < 0 || startPos < minPos || fork.start < minStart)\n                break;\n            let localSkipped = fork.id >= minRepeatType ? 4 : 0;\n            let nodeStart = fork.start;\n            fork.next();\n            while (fork.pos > startPos) {\n                if (fork.size < 0) {\n                    if (fork.size == -3 /* SpecialRecord.ContextChange */ || fork.size == -4 /* SpecialRecord.LookAhead */)\n                        localSkipped += 4;\n                    else\n                        break scan;\n                }\n                else if (fork.id >= minRepeatType) {\n                    localSkipped += 4;\n                }\n                fork.next();\n            }\n            start = nodeStart;\n            size += nodeSize;\n            skip += localSkipped;\n        }\n        if (inRepeat < 0 || size == maxSize) {\n            result.size = size;\n            result.start = start;\n            result.skip = skip;\n        }\n        return result.size > 4 ? result : undefined;\n    }\n    function copyToBuffer(bufferStart, buffer, index) {\n        let { id, start, end, size } = cursor;\n        cursor.next();\n        if (size >= 0 && id < minRepeatType) {\n            let startIndex = index;\n            if (size > 4) {\n                let endPos = cursor.pos - (size - 4);\n                while (cursor.pos > endPos)\n                    index = copyToBuffer(bufferStart, buffer, index);\n            }\n            buffer[--index] = startIndex;\n            buffer[--index] = end - bufferStart;\n            buffer[--index] = start - bufferStart;\n            buffer[--index] = id;\n        }\n        else if (size == -3 /* SpecialRecord.ContextChange */) {\n            contextHash = id;\n        }\n        else if (size == -4 /* SpecialRecord.LookAhead */) {\n            lookAhead = id;\n        }\n        return index;\n    }\n    let children = [], positions = [];\n    while (cursor.pos > 0)\n        takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1, 0);\n    let length = (_a = data.length) !== null && _a !== void 0 ? _a : (children.length ? positions[0] + children[0].length : 0);\n    return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);\n}\nconst nodeSizeCache = new WeakMap;\nfunction nodeSize(balanceType, node) {\n    if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)\n        return 1;\n    let size = nodeSizeCache.get(node);\n    if (size == null) {\n        size = 1;\n        for (let child of node.children) {\n            if (child.type != balanceType || !(child instanceof Tree)) {\n                size = 1;\n                break;\n            }\n            size += nodeSize(balanceType, child);\n        }\n        nodeSizeCache.set(node, size);\n    }\n    return size;\n}\nfunction balanceRange(\n// The type the balanced tree's inner nodes.\nbalanceType, \n// The direct children and their positions\nchildren, positions, \n// The index range in children/positions to use\nfrom, to, \n// The start position of the nodes, relative to their parent.\nstart, \n// Length of the outer node\nlength, \n// Function to build the top node of the balanced tree\nmkTop, \n// Function to build internal nodes for the balanced tree\nmkTree) {\n    let total = 0;\n    for (let i = from; i < to; i++)\n        total += nodeSize(balanceType, children[i]);\n    let maxChild = Math.ceil((total * 1.5) / 8 /* Balance.BranchFactor */);\n    let localChildren = [], localPositions = [];\n    function divide(children, positions, from, to, offset) {\n        for (let i = from; i < to;) {\n            let groupFrom = i, groupStart = positions[i], groupSize = nodeSize(balanceType, children[i]);\n            i++;\n            for (; i < to; i++) {\n                let nextSize = nodeSize(balanceType, children[i]);\n                if (groupSize + nextSize >= maxChild)\n                    break;\n                groupSize += nextSize;\n            }\n            if (i == groupFrom + 1) {\n                if (groupSize > maxChild) {\n                    let only = children[groupFrom]; // Only trees can have a size > 1\n                    divide(only.children, only.positions, 0, only.children.length, positions[groupFrom] + offset);\n                    continue;\n                }\n                localChildren.push(children[groupFrom]);\n            }\n            else {\n                let length = positions[i - 1] + children[i - 1].length - groupStart;\n                localChildren.push(balanceRange(balanceType, children, positions, groupFrom, i, groupStart, length, null, mkTree));\n            }\n            localPositions.push(groupStart + offset - start);\n        }\n    }\n    divide(children, positions, from, to, 0);\n    return (mkTop || mkTree)(localChildren, localPositions, length);\n}\n/**\nProvides a way to associate values with pieces of trees. As long\nas that part of the tree is reused, the associated values can be\nretrieved from an updated tree.\n*/\nclass NodeWeakMap {\n    constructor() {\n        this.map = new WeakMap();\n    }\n    setBuffer(buffer, index, value) {\n        let inner = this.map.get(buffer);\n        if (!inner)\n            this.map.set(buffer, inner = new Map);\n        inner.set(index, value);\n    }\n    getBuffer(buffer, index) {\n        let inner = this.map.get(buffer);\n        return inner && inner.get(index);\n    }\n    /**\n    Set the value for this syntax node.\n    */\n    set(node, value) {\n        if (node instanceof BufferNode)\n            this.setBuffer(node.context.buffer, node.index, value);\n        else if (node instanceof TreeNode)\n            this.map.set(node.tree, value);\n    }\n    /**\n    Retrieve value for this syntax node, if it exists in the map.\n    */\n    get(node) {\n        return node instanceof BufferNode ? this.getBuffer(node.context.buffer, node.index)\n            : node instanceof TreeNode ? this.map.get(node.tree) : undefined;\n    }\n    /**\n    Set the value for the node that a cursor currently points to.\n    */\n    cursorSet(cursor, value) {\n        if (cursor.buffer)\n            this.setBuffer(cursor.buffer.buffer, cursor.index, value);\n        else\n            this.map.set(cursor.tree, value);\n    }\n    /**\n    Retrieve the value for the node that a cursor currently points\n    to.\n    */\n    cursorGet(cursor) {\n        return cursor.buffer ? this.getBuffer(cursor.buffer.buffer, cursor.index) : this.map.get(cursor.tree);\n    }\n}\n\n/**\nTree fragments are used during [incremental\nparsing](#common.Parser.startParse) to track parts of old trees\nthat can be reused in a new parse. An array of fragments is used\nto track regions of an old tree whose nodes might be reused in new\nparses. Use the static\n[`applyChanges`](#common.TreeFragment^applyChanges) method to\nupdate fragments for document changes.\n*/\nclass TreeFragment {\n    /**\n    Construct a tree fragment. You'll usually want to use\n    [`addTree`](#common.TreeFragment^addTree) and\n    [`applyChanges`](#common.TreeFragment^applyChanges) instead of\n    calling this directly.\n    */\n    constructor(\n    /**\n    The start of the unchanged range pointed to by this fragment.\n    This refers to an offset in the _updated_ document (as opposed\n    to the original tree).\n    */\n    from, \n    /**\n    The end of the unchanged range.\n    */\n    to, \n    /**\n    The tree that this fragment is based on.\n    */\n    tree, \n    /**\n    The offset between the fragment's tree and the document that\n    this fragment can be used against. Add this when going from\n    document to tree positions, subtract it to go from tree to\n    document positions.\n    */\n    offset, openStart = false, openEnd = false) {\n        this.from = from;\n        this.to = to;\n        this.tree = tree;\n        this.offset = offset;\n        this.open = (openStart ? 1 /* Open.Start */ : 0) | (openEnd ? 2 /* Open.End */ : 0);\n    }\n    /**\n    Whether the start of the fragment represents the start of a\n    parse, or the end of a change. (In the second case, it may not\n    be safe to reuse some nodes at the start, depending on the\n    parsing algorithm.)\n    */\n    get openStart() { return (this.open & 1 /* Open.Start */) > 0; }\n    /**\n    Whether the end of the fragment represents the end of a\n    full-document parse, or the start of a change.\n    */\n    get openEnd() { return (this.open & 2 /* Open.End */) > 0; }\n    /**\n    Create a set of fragments from a freshly parsed tree, or update\n    an existing set of fragments by replacing the ones that overlap\n    with a tree with content from the new tree. When `partial` is\n    true, the parse is treated as incomplete, and the resulting\n    fragment has [`openEnd`](#common.TreeFragment.openEnd) set to\n    true.\n    */\n    static addTree(tree, fragments = [], partial = false) {\n        let result = [new TreeFragment(0, tree.length, tree, 0, false, partial)];\n        for (let f of fragments)\n            if (f.to > tree.length)\n                result.push(f);\n        return result;\n    }\n    /**\n    Apply a set of edits to an array of fragments, removing or\n    splitting fragments as necessary to remove edited ranges, and\n    adjusting offsets for fragments that moved.\n    */\n    static applyChanges(fragments, changes, minGap = 128) {\n        if (!changes.length)\n            return fragments;\n        let result = [];\n        let fI = 1, nextF = fragments.length ? fragments[0] : null;\n        for (let cI = 0, pos = 0, off = 0;; cI++) {\n            let nextC = cI < changes.length ? changes[cI] : null;\n            let nextPos = nextC ? nextC.fromA : 1e9;\n            if (nextPos - pos >= minGap)\n                while (nextF && nextF.from < nextPos) {\n                    let cut = nextF;\n                    if (pos >= cut.from || nextPos <= cut.to || off) {\n                        let fFrom = Math.max(cut.from, pos) - off, fTo = Math.min(cut.to, nextPos) - off;\n                        cut = fFrom >= fTo ? null : new TreeFragment(fFrom, fTo, cut.tree, cut.offset + off, cI > 0, !!nextC);\n                    }\n                    if (cut)\n                        result.push(cut);\n                    if (nextF.to > nextPos)\n                        break;\n                    nextF = fI < fragments.length ? fragments[fI++] : null;\n                }\n            if (!nextC)\n                break;\n            pos = nextC.toA;\n            off = nextC.toA - nextC.toB;\n        }\n        return result;\n    }\n}\n/**\nA superclass that parsers should extend.\n*/\nclass Parser {\n    /**\n    Start a parse, returning a [partial parse](#common.PartialParse)\n    object. [`fragments`](#common.TreeFragment) can be passed in to\n    make the parse incremental.\n    \n    By default, the entire input is parsed. You can pass `ranges`,\n    which should be a sorted array of non-empty, non-overlapping\n    ranges, to parse only those ranges. The tree returned in that\n    case will start at `ranges[0].from`.\n    */\n    startParse(input, fragments, ranges) {\n        if (typeof input == \"string\")\n            input = new StringInput(input);\n        ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map(r => new Range(r.from, r.to)) : [new Range(0, 0)];\n        return this.createParse(input, fragments || [], ranges);\n    }\n    /**\n    Run a full parse, returning the resulting tree.\n    */\n    parse(input, fragments, ranges) {\n        let parse = this.startParse(input, fragments, ranges);\n        for (;;) {\n            let done = parse.advance();\n            if (done)\n                return done;\n        }\n    }\n}\nclass StringInput {\n    constructor(string) {\n        this.string = string;\n    }\n    get length() { return this.string.length; }\n    chunk(from) { return this.string.slice(from); }\n    get lineChunks() { return false; }\n    read(from, to) { return this.string.slice(from, to); }\n}\n\n/**\nCreate a parse wrapper that, after the inner parse completes,\nscans its tree for mixed language regions with the `nest`\nfunction, runs the resulting [inner parses](#common.NestedParse),\nand then [mounts](#common.NodeProp^mounted) their results onto the\ntree.\n*/\nfunction parseMixed(nest) {\n    return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges);\n}\nclass InnerParse {\n    constructor(parser, parse, overlay, bracketed, target, from) {\n        this.parser = parser;\n        this.parse = parse;\n        this.overlay = overlay;\n        this.bracketed = bracketed;\n        this.target = target;\n        this.from = from;\n    }\n}\nfunction checkRanges(ranges) {\n    if (!ranges.length || ranges.some(r => r.from >= r.to))\n        throw new RangeError(\"Invalid inner parse ranges given: \" + JSON.stringify(ranges));\n}\nclass ActiveOverlay {\n    constructor(parser, predicate, mounts, index, start, bracketed, target, prev) {\n        this.parser = parser;\n        this.predicate = predicate;\n        this.mounts = mounts;\n        this.index = index;\n        this.start = start;\n        this.bracketed = bracketed;\n        this.target = target;\n        this.prev = prev;\n        this.depth = 0;\n        this.ranges = [];\n    }\n}\nconst stoppedInner = new NodeProp({ perNode: true });\nclass MixedParse {\n    constructor(base, nest, input, fragments, ranges) {\n        this.nest = nest;\n        this.input = input;\n        this.fragments = fragments;\n        this.ranges = ranges;\n        this.inner = [];\n        this.innerDone = 0;\n        this.baseTree = null;\n        this.stoppedAt = null;\n        this.baseParse = base;\n    }\n    advance() {\n        if (this.baseParse) {\n            let done = this.baseParse.advance();\n            if (!done)\n                return null;\n            this.baseParse = null;\n            this.baseTree = done;\n            this.startInner();\n            if (this.stoppedAt != null)\n                for (let inner of this.inner)\n                    inner.parse.stopAt(this.stoppedAt);\n        }\n        if (this.innerDone == this.inner.length) {\n            let result = this.baseTree;\n            if (this.stoppedAt != null)\n                result = new Tree(result.type, result.children, result.positions, result.length, result.propValues.concat([[stoppedInner, this.stoppedAt]]));\n            return result;\n        }\n        let inner = this.inner[this.innerDone], done = inner.parse.advance();\n        if (done) {\n            this.innerDone++;\n            // This is a somewhat dodgy but super helpful hack where we\n            // patch up nodes created by the inner parse (and thus\n            // presumably not aliased anywhere else) to hold the information\n            // about the inner parse.\n            let props = Object.assign(Object.create(null), inner.target.props);\n            props[NodeProp.mounted.id] = new MountedTree(done, inner.overlay, inner.parser, inner.bracketed);\n            inner.target.props = props;\n        }\n        return null;\n    }\n    get parsedPos() {\n        if (this.baseParse)\n            return 0;\n        let pos = this.input.length;\n        for (let i = this.innerDone; i < this.inner.length; i++) {\n            if (this.inner[i].from < pos)\n                pos = Math.min(pos, this.inner[i].parse.parsedPos);\n        }\n        return pos;\n    }\n    stopAt(pos) {\n        this.stoppedAt = pos;\n        if (this.baseParse)\n            this.baseParse.stopAt(pos);\n        else\n            for (let i = this.innerDone; i < this.inner.length; i++)\n                this.inner[i].parse.stopAt(pos);\n    }\n    startInner() {\n        let fragmentCursor = new FragmentCursor(this.fragments);\n        let overlay = null;\n        let covered = null;\n        let cursor = new TreeCursor(new TreeNode(this.baseTree, this.ranges[0].from, 0, null), IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n        scan: for (let nest, isCovered;;) {\n            let enter = true, range;\n            if (this.stoppedAt != null && cursor.from >= this.stoppedAt) {\n                enter = false;\n            }\n            else if (fragmentCursor.hasNode(cursor)) {\n                if (overlay) {\n                    let match = overlay.mounts.find(m => m.frag.from <= cursor.from && m.frag.to >= cursor.to && m.mount.overlay);\n                    if (match)\n                        for (let r of match.mount.overlay) {\n                            let from = r.from + match.pos, to = r.to + match.pos;\n                            if (from >= cursor.from && to <= cursor.to && !overlay.ranges.some(r => r.from < to && r.to > from))\n                                overlay.ranges.push({ from, to });\n                        }\n                }\n                enter = false;\n            }\n            else if (covered && (isCovered = checkCover(covered.ranges, cursor.from, cursor.to))) {\n                enter = isCovered != 2 /* Cover.Full */;\n            }\n            else if (!cursor.type.isAnonymous && (nest = this.nest(cursor, this.input)) &&\n                (cursor.from < cursor.to || !nest.overlay)) {\n                if (!cursor.tree) {\n                    materialize(cursor);\n                    // materialize create one more level of nesting\n                    // we need to add depth to active overlay for going backwards\n                    if (overlay)\n                        overlay.depth++;\n                    if (covered)\n                        covered.depth++;\n                }\n                let oldMounts = fragmentCursor.findMounts(cursor.from, nest.parser);\n                if (typeof nest.overlay == \"function\") {\n                    overlay = new ActiveOverlay(nest.parser, nest.overlay, oldMounts, this.inner.length, cursor.from, !!nest.bracketed, cursor.tree, overlay);\n                }\n                else {\n                    let ranges = punchRanges(this.ranges, nest.overlay ||\n                        (cursor.from < cursor.to ? [new Range(cursor.from, cursor.to)] : []));\n                    if (ranges.length)\n                        checkRanges(ranges);\n                    if (ranges.length || !nest.overlay)\n                        this.inner.push(new InnerParse(nest.parser, ranges.length ? nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges)\n                            : nest.parser.startParse(\"\"), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, !!nest.bracketed, cursor.tree, ranges.length ? ranges[0].from : cursor.from));\n                    if (!nest.overlay)\n                        enter = false;\n                    else if (ranges.length)\n                        covered = { ranges, depth: 0, prev: covered };\n                }\n            }\n            else if (overlay && (range = overlay.predicate(cursor))) {\n                if (range === true)\n                    range = new Range(cursor.from, cursor.to);\n                if (range.from < range.to) {\n                    let last = overlay.ranges.length - 1;\n                    if (last >= 0 && overlay.ranges[last].to == range.from)\n                        overlay.ranges[last] = { from: overlay.ranges[last].from, to: range.to };\n                    else\n                        overlay.ranges.push(range);\n                }\n            }\n            if (enter && cursor.firstChild()) {\n                if (overlay)\n                    overlay.depth++;\n                if (covered)\n                    covered.depth++;\n            }\n            else {\n                for (;;) {\n                    if (cursor.nextSibling())\n                        break;\n                    if (!cursor.parent())\n                        break scan;\n                    if (overlay && !--overlay.depth) {\n                        let ranges = punchRanges(this.ranges, overlay.ranges);\n                        if (ranges.length) {\n                            checkRanges(ranges);\n                            this.inner.splice(overlay.index, 0, new InnerParse(overlay.parser, overlay.parser.startParse(this.input, enterFragments(overlay.mounts, ranges), ranges), overlay.ranges.map(r => new Range(r.from - overlay.start, r.to - overlay.start)), overlay.bracketed, overlay.target, ranges[0].from));\n                        }\n                        overlay = overlay.prev;\n                    }\n                    if (covered && !--covered.depth)\n                        covered = covered.prev;\n                }\n            }\n        }\n    }\n}\nfunction checkCover(covered, from, to) {\n    for (let range of covered) {\n        if (range.from >= to)\n            break;\n        if (range.to > from)\n            return range.from <= from && range.to >= to ? 2 /* Cover.Full */ : 1 /* Cover.Partial */;\n    }\n    return 0 /* Cover.None */;\n}\n// Take a piece of buffer and convert it into a stand-alone\n// TreeBuffer.\nfunction sliceBuf(buf, startI, endI, nodes, positions, off) {\n    if (startI < endI) {\n        let from = buf.buffer[startI + 1];\n        nodes.push(buf.slice(startI, endI, from));\n        positions.push(from - off);\n    }\n}\n// This function takes a node that's in a buffer, and converts it, and\n// its parent buffer nodes, into a Tree. This is again acting on the\n// assumption that the trees and buffers have been constructed by the\n// parse that was ran via the mix parser, and thus aren't shared with\n// any other code, making violations of the immutability safe.\nfunction materialize(cursor) {\n    let { node } = cursor, stack = [];\n    let buffer = node.context.buffer;\n    // Scan up to the nearest tree\n    do {\n        stack.push(cursor.index);\n        cursor.parent();\n    } while (!cursor.tree);\n    // Find the index of the buffer in that tree\n    let base = cursor.tree, i = base.children.indexOf(buffer);\n    let buf = base.children[i], b = buf.buffer, newStack = [i];\n    // Split a level in the buffer, putting the nodes before and after\n    // the child that contains `node` into new buffers.\n    function split(startI, endI, type, innerOffset, length, stackPos) {\n        let targetI = stack[stackPos];\n        let children = [], positions = [];\n        sliceBuf(buf, startI, targetI, children, positions, innerOffset);\n        let from = b[targetI + 1], to = b[targetI + 2];\n        newStack.push(children.length);\n        let child = stackPos\n            ? split(targetI + 4, b[targetI + 3], buf.set.types[b[targetI]], from, to - from, stackPos - 1)\n            : node.toTree();\n        children.push(child);\n        positions.push(from - innerOffset);\n        sliceBuf(buf, b[targetI + 3], endI, children, positions, innerOffset);\n        return new Tree(type, children, positions, length);\n    }\n    base.children[i] = split(0, b.length, NodeType.none, 0, buf.length, stack.length - 1);\n    // Move the cursor back to the target node\n    for (let index of newStack) {\n        let tree = cursor.tree.children[index], pos = cursor.tree.positions[index];\n        cursor.yield(new TreeNode(tree, pos + cursor.from, index, cursor._tree));\n    }\n}\nclass StructureCursor {\n    constructor(root, offset) {\n        this.offset = offset;\n        this.done = false;\n        this.cursor = root.cursor(IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n    }\n    // Move to the first node (in pre-order) that starts at or after `pos`.\n    moveTo(pos) {\n        let { cursor } = this, p = pos - this.offset;\n        while (!this.done && cursor.from < p) {\n            if (cursor.to >= pos && cursor.enter(p, 1, IterMode.IgnoreOverlays | IterMode.ExcludeBuffers)) ;\n            else if (cursor.to <= pos) {\n                if (!cursor.next(false))\n                    this.done = true;\n                // Moved to next node\n            }\n            else {\n                break;\n            }\n        }\n    }\n    hasNode(cursor) {\n        this.moveTo(cursor.from);\n        if (!this.done && this.cursor.from + this.offset == cursor.from && this.cursor.tree) {\n            for (let tree = this.cursor.tree;;) {\n                if (tree == cursor.tree)\n                    return true;\n                if (tree.children.length && tree.positions[0] == 0 && tree.children[0] instanceof Tree)\n                    tree = tree.children[0];\n                else\n                    break;\n            }\n        }\n        return false;\n    }\n}\nclass FragmentCursor {\n    constructor(fragments) {\n        var _a;\n        this.fragments = fragments;\n        this.curTo = 0;\n        this.fragI = 0;\n        if (fragments.length) {\n            let first = this.curFrag = fragments[0];\n            this.curTo = (_a = first.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : first.to;\n            this.inner = new StructureCursor(first.tree, -first.offset);\n        }\n        else {\n            this.curFrag = this.inner = null;\n        }\n    }\n    hasNode(node) {\n        while (this.curFrag && node.from >= this.curTo)\n            this.nextFrag();\n        return this.curFrag && this.curFrag.from <= node.from && this.curTo >= node.to && this.inner.hasNode(node);\n    }\n    nextFrag() {\n        var _a;\n        this.fragI++;\n        if (this.fragI == this.fragments.length) {\n            this.curFrag = this.inner = null;\n        }\n        else {\n            let frag = this.curFrag = this.fragments[this.fragI];\n            this.curTo = (_a = frag.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : frag.to;\n            this.inner = new StructureCursor(frag.tree, -frag.offset);\n        }\n    }\n    findMounts(pos, parser) {\n        var _a;\n        let result = [];\n        if (this.inner) {\n            this.inner.cursor.moveTo(pos, 1);\n            for (let pos = this.inner.cursor.node; pos; pos = pos.parent) {\n                let mount = (_a = pos.tree) === null || _a === void 0 ? void 0 : _a.prop(NodeProp.mounted);\n                if (mount && mount.parser == parser) {\n                    for (let i = this.fragI; i < this.fragments.length; i++) {\n                        let frag = this.fragments[i];\n                        if (frag.from >= pos.to)\n                            break;\n                        if (frag.tree == this.curFrag.tree)\n                            result.push({\n                                frag,\n                                pos: pos.from - frag.offset,\n                                mount\n                            });\n                    }\n                }\n            }\n        }\n        return result;\n    }\n}\nfunction punchRanges(outer, ranges) {\n    let copy = null, current = ranges;\n    for (let i = 1, j = 0; i < outer.length; i++) {\n        let gapFrom = outer[i - 1].to, gapTo = outer[i].from;\n        for (; j < current.length; j++) {\n            let r = current[j];\n            if (r.from >= gapTo)\n                break;\n            if (r.to <= gapFrom)\n                continue;\n            if (!copy)\n                current = copy = ranges.slice();\n            if (r.from < gapFrom) {\n                copy[j] = new Range(r.from, gapFrom);\n                if (r.to > gapTo)\n                    copy.splice(j + 1, 0, new Range(gapTo, r.to));\n            }\n            else if (r.to > gapTo) {\n                copy[j--] = new Range(gapTo, r.to);\n            }\n            else {\n                copy.splice(j--, 1);\n            }\n        }\n    }\n    return current;\n}\nfunction findCoverChanges(a, b, from, to) {\n    let iA = 0, iB = 0, inA = false, inB = false, pos = -1e9;\n    let result = [];\n    for (;;) {\n        let nextA = iA == a.length ? 1e9 : inA ? a[iA].to : a[iA].from;\n        let nextB = iB == b.length ? 1e9 : inB ? b[iB].to : b[iB].from;\n        if (inA != inB) {\n            let start = Math.max(pos, from), end = Math.min(nextA, nextB, to);\n            if (start < end)\n                result.push(new Range(start, end));\n        }\n        pos = Math.min(nextA, nextB);\n        if (pos == 1e9)\n            break;\n        if (nextA == pos) {\n            if (!inA)\n                inA = true;\n            else {\n                inA = false;\n                iA++;\n            }\n        }\n        if (nextB == pos) {\n            if (!inB)\n                inB = true;\n            else {\n                inB = false;\n                iB++;\n            }\n        }\n    }\n    return result;\n}\n// Given a number of fragments for the outer tree, and a set of ranges\n// to parse, find fragments for inner trees mounted around those\n// ranges, if any.\nfunction enterFragments(mounts, ranges) {\n    let result = [];\n    for (let { pos, mount, frag } of mounts) {\n        let startPos = pos + (mount.overlay ? mount.overlay[0].from : 0), endPos = startPos + mount.tree.length;\n        let from = Math.max(frag.from, startPos), to = Math.min(frag.to, endPos);\n        if (mount.overlay) {\n            let overlay = mount.overlay.map(r => new Range(r.from + pos, r.to + pos));\n            let changes = findCoverChanges(ranges, overlay, from, to);\n            for (let i = 0, pos = from;; i++) {\n                let last = i == changes.length, end = last ? to : changes[i].from;\n                if (end > pos)\n                    result.push(new TreeFragment(pos, end, mount.tree, -startPos, frag.from >= pos || frag.openStart, frag.to <= end || frag.openEnd));\n                if (last)\n                    break;\n                pos = changes[i].to;\n            }\n        }\n        else {\n            result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos || frag.openStart, frag.to <= endPos || frag.openEnd));\n        }\n    }\n    return result;\n}\n\nexport { DefaultBufferLength, IterMode, MountedTree, NodeProp, NodeSet, NodeType, NodeWeakMap, Parser, Tree, TreeBuffer, TreeCursor, TreeFragment, parseMixed };\n","import { NodeType, NodeProp, NodeSet, Tree, Parser, parseMixed } from '@lezer/common';\nimport { styleTags, tags, Tag } from '@lezer/highlight';\n\nclass CompositeBlock {\n    static create(type, value, from, parentHash, end) {\n        let hash = (parentHash + (parentHash << 8) + type + (value << 4)) | 0;\n        return new CompositeBlock(type, value, from, hash, end, [], []);\n    }\n    constructor(type, \n    // Used for indentation in list items, markup character in lists\n    value, from, hash, end, children, positions) {\n        this.type = type;\n        this.value = value;\n        this.from = from;\n        this.hash = hash;\n        this.end = end;\n        this.children = children;\n        this.positions = positions;\n        this.hashProp = [[NodeProp.contextHash, hash]];\n    }\n    addChild(child, pos) {\n        if (child.prop(NodeProp.contextHash) != this.hash)\n            child = new Tree(child.type, child.children, child.positions, child.length, this.hashProp);\n        this.children.push(child);\n        this.positions.push(pos);\n    }\n    toTree(nodeSet, end = this.end) {\n        let last = this.children.length - 1;\n        if (last >= 0)\n            end = Math.max(end, this.positions[last] + this.children[last].length + this.from);\n        return new Tree(nodeSet.types[this.type], this.children, this.positions, end - this.from).balance({\n            makeTree: (children, positions, length) => new Tree(NodeType.none, children, positions, length, this.hashProp)\n        });\n    }\n}\nvar Type;\n(function (Type) {\n    Type[Type[\"Document\"] = 1] = \"Document\";\n    Type[Type[\"CodeBlock\"] = 2] = \"CodeBlock\";\n    Type[Type[\"FencedCode\"] = 3] = \"FencedCode\";\n    Type[Type[\"Blockquote\"] = 4] = \"Blockquote\";\n    Type[Type[\"HorizontalRule\"] = 5] = \"HorizontalRule\";\n    Type[Type[\"BulletList\"] = 6] = \"BulletList\";\n    Type[Type[\"OrderedList\"] = 7] = \"OrderedList\";\n    Type[Type[\"ListItem\"] = 8] = \"ListItem\";\n    Type[Type[\"ATXHeading1\"] = 9] = \"ATXHeading1\";\n    Type[Type[\"ATXHeading2\"] = 10] = \"ATXHeading2\";\n    Type[Type[\"ATXHeading3\"] = 11] = \"ATXHeading3\";\n    Type[Type[\"ATXHeading4\"] = 12] = \"ATXHeading4\";\n    Type[Type[\"ATXHeading5\"] = 13] = \"ATXHeading5\";\n    Type[Type[\"ATXHeading6\"] = 14] = \"ATXHeading6\";\n    Type[Type[\"SetextHeading1\"] = 15] = \"SetextHeading1\";\n    Type[Type[\"SetextHeading2\"] = 16] = \"SetextHeading2\";\n    Type[Type[\"HTMLBlock\"] = 17] = \"HTMLBlock\";\n    Type[Type[\"LinkReference\"] = 18] = \"LinkReference\";\n    Type[Type[\"Paragraph\"] = 19] = \"Paragraph\";\n    Type[Type[\"CommentBlock\"] = 20] = \"CommentBlock\";\n    Type[Type[\"ProcessingInstructionBlock\"] = 21] = \"ProcessingInstructionBlock\";\n    // Inline\n    Type[Type[\"Escape\"] = 22] = \"Escape\";\n    Type[Type[\"Entity\"] = 23] = \"Entity\";\n    Type[Type[\"HardBreak\"] = 24] = \"HardBreak\";\n    Type[Type[\"Emphasis\"] = 25] = \"Emphasis\";\n    Type[Type[\"StrongEmphasis\"] = 26] = \"StrongEmphasis\";\n    Type[Type[\"Link\"] = 27] = \"Link\";\n    Type[Type[\"Image\"] = 28] = \"Image\";\n    Type[Type[\"InlineCode\"] = 29] = \"InlineCode\";\n    Type[Type[\"HTMLTag\"] = 30] = \"HTMLTag\";\n    Type[Type[\"Comment\"] = 31] = \"Comment\";\n    Type[Type[\"ProcessingInstruction\"] = 32] = \"ProcessingInstruction\";\n    Type[Type[\"Autolink\"] = 33] = \"Autolink\";\n    // Smaller tokens\n    Type[Type[\"HeaderMark\"] = 34] = \"HeaderMark\";\n    Type[Type[\"QuoteMark\"] = 35] = \"QuoteMark\";\n    Type[Type[\"ListMark\"] = 36] = \"ListMark\";\n    Type[Type[\"LinkMark\"] = 37] = \"LinkMark\";\n    Type[Type[\"EmphasisMark\"] = 38] = \"EmphasisMark\";\n    Type[Type[\"CodeMark\"] = 39] = \"CodeMark\";\n    Type[Type[\"CodeText\"] = 40] = \"CodeText\";\n    Type[Type[\"CodeInfo\"] = 41] = \"CodeInfo\";\n    Type[Type[\"LinkTitle\"] = 42] = \"LinkTitle\";\n    Type[Type[\"LinkLabel\"] = 43] = \"LinkLabel\";\n    Type[Type[\"URL\"] = 44] = \"URL\";\n})(Type || (Type = {}));\n/**\nData structure used to accumulate a block's content during [leaf\nblock parsing](#BlockParser.leaf).\n*/\nclass LeafBlock {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The start position of the block.\n    */\n    start, \n    /**\n    The block's text content.\n    */\n    content) {\n        this.start = start;\n        this.content = content;\n        /**\n        @internal\n        */\n        this.marks = [];\n        /**\n        The block parsers active for this block.\n        */\n        this.parsers = [];\n    }\n}\n/**\nData structure used during block-level per-line parsing.\n*/\nclass Line {\n    constructor() {\n        /**\n        The line's full text.\n        */\n        this.text = \"\";\n        /**\n        The base indent provided by the composite contexts (that have\n        been handled so far).\n        */\n        this.baseIndent = 0;\n        /**\n        The string position corresponding to the base indent.\n        */\n        this.basePos = 0;\n        /**\n        The number of contexts handled @internal\n        */\n        this.depth = 0;\n        /**\n        Any markers (i.e. block quote markers) parsed for the contexts.\n        A block parser that moves across lines, covering such marks, may\n        need to include these in its node structure.\n        */\n        this.markers = [];\n        /**\n        The position of the next non-whitespace character beyond any\n        list, blockquote, or other composite block markers.\n        */\n        this.pos = 0;\n        /**\n        The column of the next non-whitespace character.\n        */\n        this.indent = 0;\n        /**\n        The character code of the character after `pos`.\n        */\n        this.next = -1;\n    }\n    /**\n    @internal\n    */\n    forward() {\n        if (this.basePos > this.pos)\n            this.forwardInner();\n    }\n    /**\n    @internal\n    */\n    forwardInner() {\n        let newPos = this.skipSpace(this.basePos);\n        this.indent = this.countIndent(newPos, this.pos, this.indent);\n        this.pos = newPos;\n        this.next = newPos == this.text.length ? -1 : this.text.charCodeAt(newPos);\n    }\n    /**\n    Skip whitespace after the given position, return the position of\n    the next non-space character or the end of the line if there's\n    only space after `from`.\n    */\n    skipSpace(from) { return skipSpace(this.text, from); }\n    /**\n    @internal\n    */\n    reset(text) {\n        this.text = text;\n        this.baseIndent = this.basePos = this.pos = this.indent = 0;\n        this.forwardInner();\n        this.depth = 1;\n        while (this.markers.length)\n            this.markers.pop();\n    }\n    /**\n    Move the line's base position forward to the given position.\n    This should only be called by composite [block\n    parsers](#BlockParser.parse) or [markup skipping\n    functions](#NodeSpec.composite).\n    */\n    moveBase(to) {\n        this.basePos = to;\n        this.baseIndent = this.countIndent(to, this.pos, this.indent);\n    }\n    /**\n    Move the line's base position forward to the given _column_.\n    */\n    moveBaseColumn(indent) {\n        this.baseIndent = indent;\n        this.basePos = this.findColumn(indent);\n    }\n    /**\n    Store a composite-block-level marker. Should be called from\n    [markup skipping functions](#NodeSpec.composite) when they\n    consume any non-whitespace characters.\n    */\n    addMarker(elt) {\n        this.markers.push(elt);\n    }\n    /**\n    Find the column position at `to`, optionally starting at a given\n    position and column.\n    */\n    countIndent(to, from = 0, indent = 0) {\n        for (let i = from; i < to; i++)\n            indent += this.text.charCodeAt(i) == 9 ? 4 - indent % 4 : 1;\n        return indent;\n    }\n    /**\n    Find the position corresponding to the given column.\n    */\n    findColumn(goal) {\n        let i = 0;\n        for (let indent = 0; i < this.text.length && indent < goal; i++)\n            indent += this.text.charCodeAt(i) == 9 ? 4 - indent % 4 : 1;\n        return i;\n    }\n    /**\n    @internal\n    */\n    scrub() {\n        if (!this.baseIndent)\n            return this.text;\n        let result = \"\";\n        for (let i = 0; i < this.basePos; i++)\n            result += \" \";\n        return result + this.text.slice(this.basePos);\n    }\n}\nfunction skipForList(bl, cx, line) {\n    if (line.pos == line.text.length ||\n        (bl != cx.block && line.indent >= cx.stack[line.depth + 1].value + line.baseIndent))\n        return true;\n    if (line.indent >= line.baseIndent + 4)\n        return false;\n    let size = (bl.type == Type.OrderedList ? isOrderedList : isBulletList)(line, cx, false);\n    return size > 0 &&\n        (bl.type != Type.BulletList || isHorizontalRule(line, cx, false) < 0) &&\n        line.text.charCodeAt(line.pos + size - 1) == bl.value;\n}\nconst DefaultSkipMarkup = {\n    [Type.Blockquote](bl, cx, line) {\n        if (line.next != 62 /* '>' */)\n            return false;\n        line.markers.push(elt(Type.QuoteMark, cx.lineStart + line.pos, cx.lineStart + line.pos + 1));\n        line.moveBase(line.pos + (space(line.text.charCodeAt(line.pos + 1)) ? 2 : 1));\n        bl.end = cx.lineStart + line.text.length;\n        return true;\n    },\n    [Type.ListItem](bl, _cx, line) {\n        if (line.indent < line.baseIndent + bl.value && line.next > -1)\n            return false;\n        line.moveBaseColumn(line.baseIndent + bl.value);\n        return true;\n    },\n    [Type.OrderedList]: skipForList,\n    [Type.BulletList]: skipForList,\n    [Type.Document]() { return true; }\n};\nfunction space(ch) { return ch == 32 || ch == 9 || ch == 10 || ch == 13; }\nfunction skipSpace(line, i = 0) {\n    while (i < line.length && space(line.charCodeAt(i)))\n        i++;\n    return i;\n}\nfunction skipSpaceBack(line, i, to) {\n    while (i > to && space(line.charCodeAt(i - 1)))\n        i--;\n    return i;\n}\nfunction isFencedCode(line) {\n    if (line.next != 96 && line.next != 126 /* '`~' */)\n        return -1;\n    let pos = line.pos + 1;\n    while (pos < line.text.length && line.text.charCodeAt(pos) == line.next)\n        pos++;\n    if (pos < line.pos + 3)\n        return -1;\n    if (line.next == 96)\n        for (let i = pos; i < line.text.length; i++)\n            if (line.text.charCodeAt(i) == 96)\n                return -1;\n    return pos;\n}\nfunction isBlockquote(line) {\n    return line.next != 62 /* '>' */ ? -1 : line.text.charCodeAt(line.pos + 1) == 32 ? 2 : 1;\n}\nfunction isHorizontalRule(line, cx, breaking) {\n    if (line.next != 42 && line.next != 45 && line.next != 95 /* '_-*' */)\n        return -1;\n    let count = 1;\n    for (let pos = line.pos + 1; pos < line.text.length; pos++) {\n        let ch = line.text.charCodeAt(pos);\n        if (ch == line.next)\n            count++;\n        else if (!space(ch))\n            return -1;\n    }\n    // Setext headers take precedence\n    if (breaking && line.next == 45 && isSetextUnderline(line) > -1 && line.depth == cx.stack.length &&\n        cx.parser.leafBlockParsers.indexOf(DefaultLeafBlocks.SetextHeading) > -1)\n        return -1;\n    return count < 3 ? -1 : 1;\n}\nfunction inList(cx, type) {\n    for (let i = cx.stack.length - 1; i >= 0; i--)\n        if (cx.stack[i].type == type)\n            return true;\n    return false;\n}\nfunction isBulletList(line, cx, breaking) {\n    return (line.next == 45 || line.next == 43 || line.next == 42 /* '-+*' */) &&\n        (line.pos == line.text.length - 1 || space(line.text.charCodeAt(line.pos + 1))) &&\n        (!breaking || inList(cx, Type.BulletList) || line.skipSpace(line.pos + 2) < line.text.length) ? 1 : -1;\n}\nfunction isOrderedList(line, cx, breaking) {\n    let pos = line.pos, next = line.next;\n    for (;;) {\n        if (next >= 48 && next <= 57 /* '0-9' */)\n            pos++;\n        else\n            break;\n        if (pos == line.text.length)\n            return -1;\n        next = line.text.charCodeAt(pos);\n    }\n    if (pos == line.pos || pos > line.pos + 9 ||\n        (next != 46 && next != 41 /* '.)' */) ||\n        (pos < line.text.length - 1 && !space(line.text.charCodeAt(pos + 1))) ||\n        breaking && !inList(cx, Type.OrderedList) &&\n            (line.skipSpace(pos + 1) == line.text.length || pos > line.pos + 1 || line.next != 49 /* '1' */))\n        return -1;\n    return pos + 1 - line.pos;\n}\nfunction isAtxHeading(line) {\n    if (line.next != 35 /* '#' */)\n        return -1;\n    let pos = line.pos + 1;\n    while (pos < line.text.length && line.text.charCodeAt(pos) == 35)\n        pos++;\n    if (pos < line.text.length && line.text.charCodeAt(pos) != 32)\n        return -1;\n    let size = pos - line.pos;\n    return size > 6 ? -1 : size;\n}\nfunction isSetextUnderline(line) {\n    if (line.next != 45 && line.next != 61 /* '-=' */ || line.indent >= line.baseIndent + 4)\n        return -1;\n    let pos = line.pos + 1;\n    while (pos < line.text.length && line.text.charCodeAt(pos) == line.next)\n        pos++;\n    let end = pos;\n    while (pos < line.text.length && space(line.text.charCodeAt(pos)))\n        pos++;\n    return pos == line.text.length ? end : -1;\n}\nconst EmptyLine = /^[ \\t]*$/, CommentEnd = /-->/, ProcessingEnd = /\\?>/;\nconst HTMLBlockStyle = [\n    [/^<(?:script|pre|style)(?:\\s|>|$)/i, /<\\/(?:script|pre|style)>/i],\n    [/^\\s*<!--/, CommentEnd],\n    [/^\\s*<\\?/, ProcessingEnd],\n    [/^\\s*<![A-Z]/, />/],\n    [/^\\s*<!\\[CDATA\\[/, /\\]\\]>/],\n    [/^\\s*<\\/?(?:address|article|aside|base|basefont|blockquote|body|caption|center|col|colgroup|dd|details|dialog|dir|div|dl|dt|fieldset|figcaption|figure|footer|form|frame|frameset|h1|h2|h3|h4|h5|h6|head|header|hr|html|iframe|legend|li|link|main|menu|menuitem|nav|noframes|ol|optgroup|option|p|param|section|source|summary|table|tbody|td|tfoot|th|thead|title|tr|track|ul)(?:\\s|\\/?>|$)/i, EmptyLine],\n    [/^\\s*(?:<\\/[a-z][\\w-]*\\s*>|<[a-z][\\w-]*(\\s+[a-z:_][\\w-.]*(?:\\s*=\\s*(?:[^\\s\"'=<>`]+|'[^']*'|\"[^\"]*\"))?)*\\s*>)\\s*$/i, EmptyLine]\n];\nfunction isHTMLBlock(line, _cx, breaking) {\n    if (line.next != 60 /* '<' */)\n        return -1;\n    let rest = line.text.slice(line.pos);\n    for (let i = 0, e = HTMLBlockStyle.length - (breaking ? 1 : 0); i < e; i++)\n        if (HTMLBlockStyle[i][0].test(rest))\n            return i;\n    return -1;\n}\nfunction getListIndent(line, pos) {\n    let indentAfter = line.countIndent(pos, line.pos, line.indent);\n    let skipped = line.skipSpace(pos);\n    let indented = line.countIndent(skipped, pos, indentAfter);\n    return indented >= indentAfter + 5 || skipped == line.text.length ? indentAfter + 1 : indented;\n}\nfunction addCodeText(marks, from, to) {\n    let last = marks.length - 1;\n    if (last >= 0 && marks[last].to == from && marks[last].type == Type.CodeText)\n        marks[last].to = to;\n    else\n        marks.push(elt(Type.CodeText, from, to));\n}\n// Rules for parsing blocks. A return value of false means the rule\n// doesn't apply here, true means it does. When true is returned and\n// `p.line` has been updated, the rule is assumed to have consumed a\n// leaf block. Otherwise, it is assumed to have opened a context.\nconst DefaultBlockParsers = {\n    LinkReference: undefined,\n    IndentedCode(cx, line) {\n        let base = line.baseIndent + 4;\n        if (line.indent < base)\n            return false;\n        let start = line.findColumn(base);\n        let from = cx.lineStart + start, to = cx.lineStart + line.text.length;\n        let marks = [], pendingMarks = [];\n        addCodeText(marks, from, to);\n        while (cx.nextLine() && line.depth >= cx.stack.length) {\n            if (line.pos == line.text.length) { // Empty\n                addCodeText(pendingMarks, cx.lineStart - 1, cx.lineStart);\n                for (let m of line.markers)\n                    pendingMarks.push(m);\n            }\n            else if (line.indent < base) {\n                break;\n            }\n            else {\n                if (pendingMarks.length) {\n                    for (let m of pendingMarks) {\n                        if (m.type == Type.CodeText)\n                            addCodeText(marks, m.from, m.to);\n                        else\n                            marks.push(m);\n                    }\n                    pendingMarks = [];\n                }\n                addCodeText(marks, cx.lineStart - 1, cx.lineStart);\n                for (let m of line.markers)\n                    marks.push(m);\n                to = cx.lineStart + line.text.length;\n                let codeStart = cx.lineStart + line.findColumn(line.baseIndent + 4);\n                if (codeStart < to)\n                    addCodeText(marks, codeStart, to);\n            }\n        }\n        if (pendingMarks.length) {\n            pendingMarks = pendingMarks.filter(m => m.type != Type.CodeText);\n            if (pendingMarks.length)\n                line.markers = pendingMarks.concat(line.markers);\n        }\n        cx.addNode(cx.buffer.writeElements(marks, -from).finish(Type.CodeBlock, to - from), from);\n        return true;\n    },\n    FencedCode(cx, line) {\n        let fenceEnd = isFencedCode(line);\n        if (fenceEnd < 0)\n            return false;\n        let from = cx.lineStart + line.pos, ch = line.next, len = fenceEnd - line.pos;\n        let infoFrom = line.skipSpace(fenceEnd), infoTo = skipSpaceBack(line.text, line.text.length, infoFrom);\n        let marks = [elt(Type.CodeMark, from, from + len)];\n        if (infoFrom < infoTo)\n            marks.push(elt(Type.CodeInfo, cx.lineStart + infoFrom, cx.lineStart + infoTo));\n        for (let first = true, empty = true, hasLine = false; cx.nextLine() && line.depth >= cx.stack.length; first = false) {\n            let i = line.pos;\n            if (line.indent - line.baseIndent < 4)\n                while (i < line.text.length && line.text.charCodeAt(i) == ch)\n                    i++;\n            if (i - line.pos >= len && line.skipSpace(i) == line.text.length) {\n                for (let m of line.markers)\n                    marks.push(m);\n                if (empty && hasLine)\n                    addCodeText(marks, cx.lineStart - 1, cx.lineStart);\n                marks.push(elt(Type.CodeMark, cx.lineStart + line.pos, cx.lineStart + i));\n                cx.nextLine();\n                break;\n            }\n            else {\n                hasLine = true;\n                if (!first) {\n                    addCodeText(marks, cx.lineStart - 1, cx.lineStart);\n                    empty = false;\n                }\n                for (let m of line.markers)\n                    marks.push(m);\n                let textStart = cx.lineStart + line.basePos, textEnd = cx.lineStart + line.text.length;\n                if (textStart < textEnd) {\n                    addCodeText(marks, textStart, textEnd);\n                    empty = false;\n                }\n            }\n        }\n        cx.addNode(cx.buffer.writeElements(marks, -from)\n            .finish(Type.FencedCode, cx.prevLineEnd() - from), from);\n        return true;\n    },\n    Blockquote(cx, line) {\n        let size = isBlockquote(line);\n        if (size < 0)\n            return false;\n        cx.startContext(Type.Blockquote, line.pos);\n        cx.addNode(Type.QuoteMark, cx.lineStart + line.pos, cx.lineStart + line.pos + 1);\n        line.moveBase(line.pos + size);\n        return null;\n    },\n    HorizontalRule(cx, line) {\n        if (isHorizontalRule(line, cx, false) < 0)\n            return false;\n        let from = cx.lineStart + line.pos;\n        cx.nextLine();\n        cx.addNode(Type.HorizontalRule, from);\n        return true;\n    },\n    BulletList(cx, line) {\n        let size = isBulletList(line, cx, false);\n        if (size < 0)\n            return false;\n        if (cx.block.type != Type.BulletList)\n            cx.startContext(Type.BulletList, line.basePos, line.next);\n        let newBase = getListIndent(line, line.pos + 1);\n        cx.startContext(Type.ListItem, line.basePos, newBase - line.baseIndent);\n        cx.addNode(Type.ListMark, cx.lineStart + line.pos, cx.lineStart + line.pos + size);\n        line.moveBaseColumn(newBase);\n        return null;\n    },\n    OrderedList(cx, line) {\n        let size = isOrderedList(line, cx, false);\n        if (size < 0)\n            return false;\n        if (cx.block.type != Type.OrderedList)\n            cx.startContext(Type.OrderedList, line.basePos, line.text.charCodeAt(line.pos + size - 1));\n        let newBase = getListIndent(line, line.pos + size);\n        cx.startContext(Type.ListItem, line.basePos, newBase - line.baseIndent);\n        cx.addNode(Type.ListMark, cx.lineStart + line.pos, cx.lineStart + line.pos + size);\n        line.moveBaseColumn(newBase);\n        return null;\n    },\n    ATXHeading(cx, line) {\n        let size = isAtxHeading(line);\n        if (size < 0)\n            return false;\n        let off = line.pos, from = cx.lineStart + off;\n        let endOfSpace = skipSpaceBack(line.text, line.text.length, off), after = endOfSpace;\n        while (after > off && line.text.charCodeAt(after - 1) == line.next)\n            after--;\n        if (after == endOfSpace || after == off || !space(line.text.charCodeAt(after - 1)))\n            after = line.text.length;\n        let buf = cx.buffer\n            .write(Type.HeaderMark, 0, size)\n            .writeElements(cx.parser.parseInline(line.text.slice(off + size + 1, after), from + size + 1), -from);\n        if (after < line.text.length)\n            buf.write(Type.HeaderMark, after - off, endOfSpace - off);\n        let node = buf.finish(Type.ATXHeading1 - 1 + size, line.text.length - off);\n        cx.nextLine();\n        cx.addNode(node, from);\n        return true;\n    },\n    HTMLBlock(cx, line) {\n        let type = isHTMLBlock(line, cx, false);\n        if (type < 0)\n            return false;\n        let from = cx.lineStart + line.pos, end = HTMLBlockStyle[type][1];\n        let marks = [], trailing = end != EmptyLine;\n        while (!end.test(line.text) && cx.nextLine()) {\n            if (line.depth < cx.stack.length) {\n                trailing = false;\n                break;\n            }\n            for (let m of line.markers)\n                marks.push(m);\n        }\n        if (trailing)\n            cx.nextLine();\n        let nodeType = end == CommentEnd ? Type.CommentBlock : end == ProcessingEnd ? Type.ProcessingInstructionBlock : Type.HTMLBlock;\n        let to = cx.prevLineEnd();\n        cx.addNode(cx.buffer.writeElements(marks, -from).finish(nodeType, to - from), from);\n        return true;\n    },\n    SetextHeading: undefined // Specifies relative precedence for block-continue function\n};\n// This implements a state machine that incrementally parses link references. At each\n// next line, it looks ahead to see if the line continues the reference or not. If it\n// doesn't and a valid link is available ending before that line, it finishes that.\n// Similarly, on `finish` (when the leaf is terminated by external circumstances), it\n// creates a link reference if there's a valid reference up to the current point.\nclass LinkReferenceParser {\n    constructor(leaf) {\n        this.stage = 0 /* RefStage.Start */;\n        this.elts = [];\n        this.pos = 0;\n        this.start = leaf.start;\n        this.advance(leaf.content);\n    }\n    nextLine(cx, line, leaf) {\n        if (this.stage == -1 /* RefStage.Failed */)\n            return false;\n        let content = leaf.content + \"\\n\" + line.scrub();\n        let finish = this.advance(content);\n        if (finish > -1 && finish < content.length)\n            return this.complete(cx, leaf, finish);\n        return false;\n    }\n    finish(cx, leaf) {\n        if ((this.stage == 2 /* RefStage.Link */ || this.stage == 3 /* RefStage.Title */) && skipSpace(leaf.content, this.pos) == leaf.content.length)\n            return this.complete(cx, leaf, leaf.content.length);\n        return false;\n    }\n    complete(cx, leaf, len) {\n        cx.addLeafElement(leaf, elt(Type.LinkReference, this.start, this.start + len, this.elts));\n        return true;\n    }\n    nextStage(elt) {\n        if (elt) {\n            this.pos = elt.to - this.start;\n            this.elts.push(elt);\n            this.stage++;\n            return true;\n        }\n        if (elt === false)\n            this.stage = -1 /* RefStage.Failed */;\n        return false;\n    }\n    advance(content) {\n        for (;;) {\n            if (this.stage == -1 /* RefStage.Failed */) {\n                return -1;\n            }\n            else if (this.stage == 0 /* RefStage.Start */) {\n                if (!this.nextStage(parseLinkLabel(content, this.pos, this.start, true)))\n                    return -1;\n                if (content.charCodeAt(this.pos) != 58 /* ':' */)\n                    return this.stage = -1 /* RefStage.Failed */;\n                this.elts.push(elt(Type.LinkMark, this.pos + this.start, this.pos + this.start + 1));\n                this.pos++;\n            }\n            else if (this.stage == 1 /* RefStage.Label */) {\n                if (!this.nextStage(parseURL(content, skipSpace(content, this.pos), this.start)))\n                    return -1;\n            }\n            else if (this.stage == 2 /* RefStage.Link */) {\n                let skip = skipSpace(content, this.pos), end = 0;\n                if (skip > this.pos) {\n                    let title = parseLinkTitle(content, skip, this.start);\n                    if (title) {\n                        let titleEnd = lineEnd(content, title.to - this.start);\n                        if (titleEnd > 0) {\n                            this.nextStage(title);\n                            end = titleEnd;\n                        }\n                    }\n                }\n                if (!end)\n                    end = lineEnd(content, this.pos);\n                return end > 0 && end < content.length ? end : -1;\n            }\n            else { // RefStage.Title\n                return lineEnd(content, this.pos);\n            }\n        }\n    }\n}\nfunction lineEnd(text, pos) {\n    for (; pos < text.length; pos++) {\n        let next = text.charCodeAt(pos);\n        if (next == 10)\n            break;\n        if (!space(next))\n            return -1;\n    }\n    return pos;\n}\nclass SetextHeadingParser {\n    nextLine(cx, line, leaf) {\n        let underline = line.depth < cx.stack.length ? -1 : isSetextUnderline(line);\n        let next = line.next;\n        if (underline < 0)\n            return false;\n        let underlineMark = elt(Type.HeaderMark, cx.lineStart + line.pos, cx.lineStart + underline);\n        cx.nextLine();\n        cx.addLeafElement(leaf, elt(next == 61 ? Type.SetextHeading1 : Type.SetextHeading2, leaf.start, cx.prevLineEnd(), [\n            ...cx.parser.parseInline(leaf.content, leaf.start),\n            underlineMark\n        ]));\n        return true;\n    }\n    finish() {\n        return false;\n    }\n}\nconst DefaultLeafBlocks = {\n    LinkReference(_, leaf) { return leaf.content.charCodeAt(0) == 91 /* '[' */ ? new LinkReferenceParser(leaf) : null; },\n    SetextHeading() { return new SetextHeadingParser; }\n};\nconst DefaultEndLeaf = [\n    (_, line) => isAtxHeading(line) >= 0,\n    (_, line) => isFencedCode(line) >= 0,\n    (_, line) => isBlockquote(line) >= 0,\n    (p, line) => isBulletList(line, p, true) >= 0,\n    (p, line) => isOrderedList(line, p, true) >= 0,\n    (p, line) => isHorizontalRule(line, p, true) >= 0,\n    (p, line) => isHTMLBlock(line, p, true) >= 0\n];\nconst scanLineResult = { text: \"\", end: 0 };\n/**\nBlock-level parsing functions get access to this context object.\n*/\nclass BlockContext {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The parser configuration used.\n    */\n    parser, \n    /**\n    @internal\n    */\n    input, fragments, \n    /**\n    @internal\n    */\n    ranges) {\n        this.parser = parser;\n        this.input = input;\n        this.ranges = ranges;\n        this.line = new Line();\n        this.atEnd = false;\n        /**\n        For reused nodes on gaps, we can't directly put the original\n        node into the tree, since that may be bigger than its parent.\n        When this happens, we create a dummy tree that is replaced by\n        the proper node in `injectGaps` @internal\n        */\n        this.reusePlaceholders = new Map;\n        this.stoppedAt = null;\n        /**\n        The range index that absoluteLineStart points into @internal\n        */\n        this.rangeI = 0;\n        this.to = ranges[ranges.length - 1].to;\n        this.lineStart = this.absoluteLineStart = this.absoluteLineEnd = ranges[0].from;\n        this.block = CompositeBlock.create(Type.Document, 0, this.lineStart, 0, 0);\n        this.stack = [this.block];\n        this.fragments = fragments.length ? new FragmentCursor(fragments, input) : null;\n        this.readLine();\n    }\n    get parsedPos() {\n        return this.absoluteLineStart;\n    }\n    advance() {\n        if (this.stoppedAt != null && this.absoluteLineStart > this.stoppedAt)\n            return this.finish();\n        let { line } = this;\n        for (;;) {\n            for (let markI = 0;;) {\n                let next = line.depth < this.stack.length ? this.stack[this.stack.length - 1] : null;\n                while (markI < line.markers.length && (!next || line.markers[markI].from < next.end)) {\n                    let mark = line.markers[markI++];\n                    this.addNode(mark.type, mark.from, mark.to);\n                }\n                if (!next)\n                    break;\n                this.finishContext();\n            }\n            if (line.pos < line.text.length)\n                break;\n            // Empty line\n            if (!this.nextLine())\n                return this.finish();\n        }\n        if (this.fragments && this.reuseFragment(line.basePos))\n            return null;\n        start: for (;;) {\n            for (let type of this.parser.blockParsers)\n                if (type) {\n                    let result = type(this, line);\n                    if (result != false) {\n                        if (result == true)\n                            return null;\n                        line.forward();\n                        continue start;\n                    }\n                }\n            break;\n        }\n        if (line.pos == line.text.length)\n            return this.nextLine() ? null : this.finish();\n        let leaf = new LeafBlock(this.lineStart + line.pos, line.text.slice(line.pos));\n        for (let parse of this.parser.leafBlockParsers)\n            if (parse) {\n                let parser = parse(this, leaf);\n                if (parser)\n                    leaf.parsers.push(parser);\n            }\n        lines: while (this.nextLine()) {\n            if (line.pos == line.text.length)\n                break;\n            if (line.indent < line.baseIndent + 4) {\n                for (let stop of this.parser.endLeafBlock)\n                    if (stop(this, line, leaf))\n                        break lines;\n            }\n            for (let parser of leaf.parsers)\n                if (parser.nextLine(this, line, leaf))\n                    return null;\n            leaf.content += \"\\n\" + line.scrub();\n            for (let m of line.markers)\n                leaf.marks.push(m);\n        }\n        this.finishLeaf(leaf);\n        return null;\n    }\n    stopAt(pos) {\n        if (this.stoppedAt != null && this.stoppedAt < pos)\n            throw new RangeError(\"Can't move stoppedAt forward\");\n        this.stoppedAt = pos;\n    }\n    reuseFragment(start) {\n        if (!this.fragments.moveTo(this.absoluteLineStart + start, this.absoluteLineStart) ||\n            !this.fragments.matches(this.block.hash))\n            return false;\n        let taken = this.fragments.takeNodes(this);\n        if (!taken)\n            return false;\n        this.absoluteLineStart += taken;\n        this.lineStart = toRelative(this.absoluteLineStart, this.ranges);\n        this.moveRangeI();\n        if (this.absoluteLineStart < this.to) {\n            this.lineStart++;\n            this.absoluteLineStart++;\n            this.readLine();\n        }\n        else {\n            this.atEnd = true;\n            this.readLine();\n        }\n        return true;\n    }\n    /**\n    The number of parent blocks surrounding the current block.\n    */\n    get depth() {\n        return this.stack.length;\n    }\n    /**\n    Get the type of the parent block at the given depth. When no\n    depth is passed, return the type of the innermost parent.\n    */\n    parentType(depth = this.depth - 1) {\n        return this.parser.nodeSet.types[this.stack[depth].type];\n    }\n    /**\n    Move to the next input line. This should only be called by\n    (non-composite) [block parsers](#BlockParser.parse) that consume\n    the line directly, or leaf block parser\n    [`nextLine`](#LeafBlockParser.nextLine) methods when they\n    consume the current line (and return true).\n    */\n    nextLine() {\n        this.lineStart += this.line.text.length;\n        if (this.absoluteLineEnd >= this.to) {\n            this.absoluteLineStart = this.absoluteLineEnd;\n            this.atEnd = true;\n            this.readLine();\n            return false;\n        }\n        else {\n            this.lineStart++;\n            this.absoluteLineStart = this.absoluteLineEnd + 1;\n            this.moveRangeI();\n            this.readLine();\n            return true;\n        }\n    }\n    /**\n    Retrieve the text of the line after the current one, without\n    actually moving the context's current line forward.\n    */\n    peekLine() {\n        return this.scanLine(this.absoluteLineEnd + 1).text;\n    }\n    moveRangeI() {\n        while (this.rangeI < this.ranges.length - 1 && this.absoluteLineStart >= this.ranges[this.rangeI].to) {\n            this.rangeI++;\n            this.absoluteLineStart = Math.max(this.absoluteLineStart, this.ranges[this.rangeI].from);\n        }\n    }\n    /**\n    @internal\n    Collect the text for the next line.\n    */\n    scanLine(start) {\n        let r = scanLineResult;\n        r.end = start;\n        if (start >= this.to) {\n            r.text = \"\";\n        }\n        else {\n            r.text = this.lineChunkAt(start);\n            r.end += r.text.length;\n            if (this.ranges.length > 1) {\n                let textOffset = this.absoluteLineStart, rangeI = this.rangeI;\n                while (this.ranges[rangeI].to < r.end) {\n                    rangeI++;\n                    let nextFrom = this.ranges[rangeI].from;\n                    let after = this.lineChunkAt(nextFrom);\n                    r.end = nextFrom + after.length;\n                    r.text = r.text.slice(0, this.ranges[rangeI - 1].to - textOffset) + after;\n                    textOffset = r.end - r.text.length;\n                }\n            }\n        }\n        return r;\n    }\n    /**\n    @internal\n    Populate this.line with the content of the next line. Skip\n    leading characters covered by composite blocks.\n    */\n    readLine() {\n        let { line } = this, { text, end } = this.scanLine(this.absoluteLineStart);\n        this.absoluteLineEnd = end;\n        line.reset(text);\n        for (; line.depth < this.stack.length; line.depth++) {\n            let cx = this.stack[line.depth], handler = this.parser.skipContextMarkup[cx.type];\n            if (!handler)\n                throw new Error(\"Unhandled block context \" + Type[cx.type]);\n            let marks = this.line.markers.length;\n            if (!handler(cx, this, line)) {\n                if (this.line.markers.length > marks)\n                    cx.end = this.line.markers[this.line.markers.length - 1].to;\n                line.forward();\n                break;\n            }\n            line.forward();\n        }\n    }\n    lineChunkAt(pos) {\n        let next = this.input.chunk(pos), text;\n        if (!this.input.lineChunks) {\n            let eol = next.indexOf(\"\\n\");\n            text = eol < 0 ? next : next.slice(0, eol);\n        }\n        else {\n            text = next == \"\\n\" ? \"\" : next;\n        }\n        return pos + text.length > this.to ? text.slice(0, this.to - pos) : text;\n    }\n    /**\n    The end position of the previous line.\n    */\n    prevLineEnd() { return this.atEnd ? this.lineStart : this.lineStart - 1; }\n    /**\n    @internal\n    */\n    startContext(type, start, value = 0) {\n        this.block = CompositeBlock.create(type, value, this.lineStart + start, this.block.hash, this.lineStart + this.line.text.length);\n        this.stack.push(this.block);\n    }\n    /**\n    Start a composite block. Should only be called from [block\n    parser functions](#BlockParser.parse) that return null.\n    */\n    startComposite(type, start, value = 0) {\n        this.startContext(this.parser.getNodeType(type), start, value);\n    }\n    /**\n    @internal\n    */\n    addNode(block, from, to) {\n        if (typeof block == \"number\")\n            block = new Tree(this.parser.nodeSet.types[block], none, none, (to !== null && to !== void 0 ? to : this.prevLineEnd()) - from);\n        this.block.addChild(block, from - this.block.from);\n    }\n    /**\n    Add a block element. Can be called by [block\n    parsers](#BlockParser.parse).\n    */\n    addElement(elt) {\n        this.block.addChild(elt.toTree(this.parser.nodeSet), elt.from - this.block.from);\n    }\n    /**\n    Add a block element from a [leaf parser](#LeafBlockParser). This\n    makes sure any extra composite block markup (such as blockquote\n    markers) inside the block are also added to the syntax tree.\n    */\n    addLeafElement(leaf, elt) {\n        this.addNode(this.buffer\n            .writeElements(injectMarks(elt.children, leaf.marks), -elt.from)\n            .finish(elt.type, elt.to - elt.from), elt.from);\n    }\n    /**\n    @internal\n    */\n    finishContext() {\n        let cx = this.stack.pop();\n        let top = this.stack[this.stack.length - 1];\n        top.addChild(cx.toTree(this.parser.nodeSet), cx.from - top.from);\n        this.block = top;\n    }\n    finish() {\n        while (this.stack.length > 1)\n            this.finishContext();\n        return this.addGaps(this.block.toTree(this.parser.nodeSet, this.lineStart));\n    }\n    addGaps(tree) {\n        return this.ranges.length > 1 ?\n            injectGaps(this.ranges, 0, tree.topNode, this.ranges[0].from, this.reusePlaceholders) : tree;\n    }\n    /**\n    @internal\n    */\n    finishLeaf(leaf) {\n        for (let parser of leaf.parsers)\n            if (parser.finish(this, leaf))\n                return;\n        let inline = injectMarks(this.parser.parseInline(leaf.content, leaf.start), leaf.marks);\n        this.addNode(this.buffer\n            .writeElements(inline, -leaf.start)\n            .finish(Type.Paragraph, leaf.content.length), leaf.start);\n    }\n    elt(type, from, to, children) {\n        if (typeof type == \"string\")\n            return elt(this.parser.getNodeType(type), from, to, children);\n        return new TreeElement(type, from);\n    }\n    /**\n    @internal\n    */\n    get buffer() { return new Buffer(this.parser.nodeSet); }\n}\nfunction injectGaps(ranges, rangeI, tree, offset, dummies) {\n    let rangeEnd = ranges[rangeI].to;\n    let children = [], positions = [], start = tree.from + offset;\n    function movePastNext(upto, inclusive) {\n        while (inclusive ? upto >= rangeEnd : upto > rangeEnd) {\n            let size = ranges[rangeI + 1].from - rangeEnd;\n            offset += size;\n            upto += size;\n            rangeI++;\n            rangeEnd = ranges[rangeI].to;\n        }\n    }\n    for (let ch = tree.firstChild; ch; ch = ch.nextSibling) {\n        movePastNext(ch.from + offset, true);\n        let from = ch.from + offset, node, reuse = dummies.get(ch.tree);\n        if (reuse) {\n            node = reuse;\n        }\n        else if (ch.to + offset > rangeEnd) {\n            node = injectGaps(ranges, rangeI, ch, offset, dummies);\n            movePastNext(ch.to + offset, false);\n        }\n        else {\n            node = ch.toTree();\n        }\n        children.push(node);\n        positions.push(from - start);\n    }\n    movePastNext(tree.to + offset, false);\n    return new Tree(tree.type, children, positions, tree.to + offset - start, tree.tree ? tree.tree.propValues : undefined);\n}\n/**\nA Markdown parser configuration.\n*/\nclass MarkdownParser extends Parser {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The parser's syntax [node\n    types](https://lezer.codemirror.net/docs/ref/#common.NodeSet).\n    */\n    nodeSet, \n    /**\n    @internal\n    */\n    blockParsers, \n    /**\n    @internal\n    */\n    leafBlockParsers, \n    /**\n    @internal\n    */\n    blockNames, \n    /**\n    @internal\n    */\n    endLeafBlock, \n    /**\n    @internal\n    */\n    skipContextMarkup, \n    /**\n    @internal\n    */\n    inlineParsers, \n    /**\n    @internal\n    */\n    inlineNames, \n    /**\n    @internal\n    */\n    wrappers) {\n        super();\n        this.nodeSet = nodeSet;\n        this.blockParsers = blockParsers;\n        this.leafBlockParsers = leafBlockParsers;\n        this.blockNames = blockNames;\n        this.endLeafBlock = endLeafBlock;\n        this.skipContextMarkup = skipContextMarkup;\n        this.inlineParsers = inlineParsers;\n        this.inlineNames = inlineNames;\n        this.wrappers = wrappers;\n        /**\n        @internal\n        */\n        this.nodeTypes = Object.create(null);\n        for (let t of nodeSet.types)\n            this.nodeTypes[t.name] = t.id;\n    }\n    createParse(input, fragments, ranges) {\n        let parse = new BlockContext(this, input, fragments, ranges);\n        for (let w of this.wrappers)\n            parse = w(parse, input, fragments, ranges);\n        return parse;\n    }\n    /**\n    Reconfigure the parser.\n    */\n    configure(spec) {\n        let config = resolveConfig(spec);\n        if (!config)\n            return this;\n        let { nodeSet, skipContextMarkup } = this;\n        let blockParsers = this.blockParsers.slice(), leafBlockParsers = this.leafBlockParsers.slice(), blockNames = this.blockNames.slice(), inlineParsers = this.inlineParsers.slice(), inlineNames = this.inlineNames.slice(), endLeafBlock = this.endLeafBlock.slice(), wrappers = this.wrappers;\n        if (nonEmpty(config.defineNodes)) {\n            skipContextMarkup = Object.assign({}, skipContextMarkup);\n            let nodeTypes = nodeSet.types.slice(), styles;\n            for (let s of config.defineNodes) {\n                let { name, block, composite, style } = typeof s == \"string\" ? { name: s } : s;\n                if (nodeTypes.some(t => t.name == name))\n                    continue;\n                if (composite)\n                    skipContextMarkup[nodeTypes.length] =\n                        (bl, cx, line) => composite(cx, line, bl.value);\n                let id = nodeTypes.length;\n                let group = composite ? [\"Block\", \"BlockContext\"] : !block ? undefined\n                    : id >= Type.ATXHeading1 && id <= Type.SetextHeading2 ? [\"Block\", \"LeafBlock\", \"Heading\"] : [\"Block\", \"LeafBlock\"];\n                nodeTypes.push(NodeType.define({\n                    id,\n                    name,\n                    props: group && [[NodeProp.group, group]]\n                }));\n                if (style) {\n                    if (!styles)\n                        styles = {};\n                    if (Array.isArray(style) || style instanceof Tag)\n                        styles[name] = style;\n                    else\n                        Object.assign(styles, style);\n                }\n            }\n            nodeSet = new NodeSet(nodeTypes);\n            if (styles)\n                nodeSet = nodeSet.extend(styleTags(styles));\n        }\n        if (nonEmpty(config.props))\n            nodeSet = nodeSet.extend(...config.props);\n        if (nonEmpty(config.remove)) {\n            for (let rm of config.remove) {\n                let block = this.blockNames.indexOf(rm), inline = this.inlineNames.indexOf(rm);\n                if (block > -1)\n                    blockParsers[block] = leafBlockParsers[block] = undefined;\n                if (inline > -1)\n                    inlineParsers[inline] = undefined;\n            }\n        }\n        if (nonEmpty(config.parseBlock)) {\n            for (let spec of config.parseBlock) {\n                let found = blockNames.indexOf(spec.name);\n                if (found > -1) {\n                    blockParsers[found] = spec.parse;\n                    leafBlockParsers[found] = spec.leaf;\n                }\n                else {\n                    let pos = spec.before ? findName(blockNames, spec.before)\n                        : spec.after ? findName(blockNames, spec.after) + 1 : blockNames.length - 1;\n                    blockParsers.splice(pos, 0, spec.parse);\n                    leafBlockParsers.splice(pos, 0, spec.leaf);\n                    blockNames.splice(pos, 0, spec.name);\n                }\n                if (spec.endLeaf)\n                    endLeafBlock.push(spec.endLeaf);\n            }\n        }\n        if (nonEmpty(config.parseInline)) {\n            for (let spec of config.parseInline) {\n                let found = inlineNames.indexOf(spec.name);\n                if (found > -1) {\n                    inlineParsers[found] = spec.parse;\n                }\n                else {\n                    let pos = spec.before ? findName(inlineNames, spec.before)\n                        : spec.after ? findName(inlineNames, spec.after) + 1 : inlineNames.length - 1;\n                    inlineParsers.splice(pos, 0, spec.parse);\n                    inlineNames.splice(pos, 0, spec.name);\n                }\n            }\n        }\n        if (config.wrap)\n            wrappers = wrappers.concat(config.wrap);\n        return new MarkdownParser(nodeSet, blockParsers, leafBlockParsers, blockNames, endLeafBlock, skipContextMarkup, inlineParsers, inlineNames, wrappers);\n    }\n    /**\n    @internal\n    */\n    getNodeType(name) {\n        let found = this.nodeTypes[name];\n        if (found == null)\n            throw new RangeError(`Unknown node type '${name}'`);\n        return found;\n    }\n    /**\n    Parse the given piece of inline text at the given offset,\n    returning an array of [`Element`](#Element) objects representing\n    the inline content.\n    */\n    parseInline(text, offset) {\n        let cx = new InlineContext(this, text, offset);\n        outer: for (let pos = offset; pos < cx.end;) {\n            let next = cx.char(pos);\n            for (let token of this.inlineParsers)\n                if (token) {\n                    let result = token(cx, next, pos);\n                    if (result >= 0) {\n                        pos = result;\n                        continue outer;\n                    }\n                }\n            pos++;\n        }\n        return cx.resolveMarkers(0);\n    }\n}\nfunction nonEmpty(a) {\n    return a != null && a.length > 0;\n}\nfunction resolveConfig(spec) {\n    if (!Array.isArray(spec))\n        return spec;\n    if (spec.length == 0)\n        return null;\n    let conf = resolveConfig(spec[0]);\n    if (spec.length == 1)\n        return conf;\n    let rest = resolveConfig(spec.slice(1));\n    if (!rest || !conf)\n        return conf || rest;\n    let conc = (a, b) => (a || none).concat(b || none);\n    let wrapA = conf.wrap, wrapB = rest.wrap;\n    return {\n        props: conc(conf.props, rest.props),\n        defineNodes: conc(conf.defineNodes, rest.defineNodes),\n        parseBlock: conc(conf.parseBlock, rest.parseBlock),\n        parseInline: conc(conf.parseInline, rest.parseInline),\n        remove: conc(conf.remove, rest.remove),\n        wrap: !wrapA ? wrapB : !wrapB ? wrapA :\n            (inner, input, fragments, ranges) => wrapA(wrapB(inner, input, fragments, ranges), input, fragments, ranges)\n    };\n}\nfunction findName(names, name) {\n    let found = names.indexOf(name);\n    if (found < 0)\n        throw new RangeError(`Position specified relative to unknown parser ${name}`);\n    return found;\n}\nlet nodeTypes = [NodeType.none];\nfor (let i = 1, name; name = Type[i]; i++) {\n    nodeTypes[i] = NodeType.define({\n        id: i,\n        name,\n        props: i >= Type.Escape ? [] : [[NodeProp.group, i in DefaultSkipMarkup ? [\"Block\", \"BlockContext\"] : [\"Block\", \"LeafBlock\"]]],\n        top: name == \"Document\"\n    });\n}\nconst none = [];\nclass Buffer {\n    constructor(nodeSet) {\n        this.nodeSet = nodeSet;\n        this.content = [];\n        this.nodes = [];\n    }\n    write(type, from, to, children = 0) {\n        this.content.push(type, from, to, 4 + children * 4);\n        return this;\n    }\n    writeElements(elts, offset = 0) {\n        for (let e of elts)\n            e.writeTo(this, offset);\n        return this;\n    }\n    finish(type, length) {\n        return Tree.build({\n            buffer: this.content,\n            nodeSet: this.nodeSet,\n            reused: this.nodes,\n            topID: type,\n            length\n        });\n    }\n}\n/**\nElements are used to compose syntax nodes during parsing.\n*/\nclass Element {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The node's\n    [id](https://lezer.codemirror.net/docs/ref/#common.NodeType.id).\n    */\n    type, \n    /**\n    The start of the node, as an offset from the start of the document.\n    */\n    from, \n    /**\n    The end of the node.\n    */\n    to, \n    /**\n    The node's child nodes @internal\n    */\n    children = none) {\n        this.type = type;\n        this.from = from;\n        this.to = to;\n        this.children = children;\n    }\n    /**\n    @internal\n    */\n    writeTo(buf, offset) {\n        let startOff = buf.content.length;\n        buf.writeElements(this.children, offset);\n        buf.content.push(this.type, this.from + offset, this.to + offset, buf.content.length + 4 - startOff);\n    }\n    /**\n    @internal\n    */\n    toTree(nodeSet) {\n        return new Buffer(nodeSet).writeElements(this.children, -this.from).finish(this.type, this.to - this.from);\n    }\n}\nclass TreeElement {\n    constructor(tree, from) {\n        this.tree = tree;\n        this.from = from;\n    }\n    get to() { return this.from + this.tree.length; }\n    get type() { return this.tree.type.id; }\n    get children() { return none; }\n    writeTo(buf, offset) {\n        buf.nodes.push(this.tree);\n        buf.content.push(buf.nodes.length - 1, this.from + offset, this.to + offset, -1);\n    }\n    toTree() { return this.tree; }\n}\nfunction elt(type, from, to, children) {\n    return new Element(type, from, to, children);\n}\nconst EmphasisUnderscore = { resolve: \"Emphasis\", mark: \"EmphasisMark\" };\nconst EmphasisAsterisk = { resolve: \"Emphasis\", mark: \"EmphasisMark\" };\nconst LinkStart = {}, ImageStart = {};\nclass InlineDelimiter {\n    constructor(type, from, to, side) {\n        this.type = type;\n        this.from = from;\n        this.to = to;\n        this.side = side;\n    }\n}\nconst Escapable = \"!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~\";\nlet Punctuation = /[!\"#$%&'()*+,\\-.\\/:;<=>?@\\[\\\\\\]^_`{|}~\\xA1\\u2010-\\u2027]/;\ntry {\n    Punctuation = new RegExp(\"[\\\\p{S}|\\\\p{P}]\", \"u\");\n}\ncatch (_) { }\nconst DefaultInline = {\n    Escape(cx, next, start) {\n        if (next != 92 /* '\\\\' */ || start == cx.end - 1)\n            return -1;\n        let escaped = cx.char(start + 1);\n        for (let i = 0; i < Escapable.length; i++)\n            if (Escapable.charCodeAt(i) == escaped)\n                return cx.append(elt(Type.Escape, start, start + 2));\n        return -1;\n    },\n    Entity(cx, next, start) {\n        if (next != 38 /* '&' */)\n            return -1;\n        let m = /^(?:#\\d+|#x[a-f\\d]+|\\w+);/i.exec(cx.slice(start + 1, start + 31));\n        return m ? cx.append(elt(Type.Entity, start, start + 1 + m[0].length)) : -1;\n    },\n    InlineCode(cx, next, start) {\n        if (next != 96 /* '`' */ || start && cx.char(start - 1) == 96)\n            return -1;\n        let pos = start + 1;\n        while (pos < cx.end && cx.char(pos) == 96)\n            pos++;\n        let size = pos - start, curSize = 0;\n        for (; pos < cx.end; pos++) {\n            if (cx.char(pos) == 96) {\n                curSize++;\n                if (curSize == size && cx.char(pos + 1) != 96)\n                    return cx.append(elt(Type.InlineCode, start, pos + 1, [\n                        elt(Type.CodeMark, start, start + size),\n                        elt(Type.CodeMark, pos + 1 - size, pos + 1)\n                    ]));\n            }\n            else {\n                curSize = 0;\n            }\n        }\n        return -1;\n    },\n    HTMLTag(cx, next, start) {\n        if (next != 60 /* '<' */ || start == cx.end - 1)\n            return -1;\n        let after = cx.slice(start + 1, cx.end);\n        let url = /^(?:[a-z][-\\w+.]+:[^\\s>]+|[a-z\\d.!#$%&'*+/=?^_`{|}~-]+@[a-z\\d](?:[a-z\\d-]{0,61}[a-z\\d])?(?:\\.[a-z\\d](?:[a-z\\d-]{0,61}[a-z\\d])?)*)>/i.exec(after);\n        if (url) {\n            return cx.append(elt(Type.Autolink, start, start + 1 + url[0].length, [\n                elt(Type.LinkMark, start, start + 1),\n                // url[0] includes the closing bracket, so exclude it from this slice\n                elt(Type.URL, start + 1, start + url[0].length),\n                elt(Type.LinkMark, start + url[0].length, start + 1 + url[0].length)\n            ]));\n        }\n        let comment = /^!--[^>](?:-[^-]|[^-])*?-->/i.exec(after);\n        if (comment)\n            return cx.append(elt(Type.Comment, start, start + 1 + comment[0].length));\n        let procInst = /^\\?[^]*?\\?>/.exec(after);\n        if (procInst)\n            return cx.append(elt(Type.ProcessingInstruction, start, start + 1 + procInst[0].length));\n        let m = /^(?:![A-Z][^]*?>|!\\[CDATA\\[[^]*?\\]\\]>|\\/\\s*[a-zA-Z][\\w-]*\\s*>|\\s*[a-zA-Z][\\w-]*(\\s+[a-zA-Z:_][\\w-.:]*(?:\\s*=\\s*(?:[^\\s\"'=<>`]+|'[^']*'|\"[^\"]*\"))?)*\\s*(\\/\\s*)?>)/.exec(after);\n        if (!m)\n            return -1;\n        return cx.append(elt(Type.HTMLTag, start, start + 1 + m[0].length));\n    },\n    Emphasis(cx, next, start) {\n        if (next != 95 && next != 42)\n            return -1;\n        let pos = start + 1;\n        while (cx.char(pos) == next)\n            pos++;\n        let before = cx.slice(start - 1, start), after = cx.slice(pos, pos + 1);\n        let pBefore = Punctuation.test(before), pAfter = Punctuation.test(after);\n        let sBefore = /\\s|^$/.test(before), sAfter = /\\s|^$/.test(after);\n        let leftFlanking = !sAfter && (!pAfter || sBefore || pBefore);\n        let rightFlanking = !sBefore && (!pBefore || sAfter || pAfter);\n        let canOpen = leftFlanking && (next == 42 || !rightFlanking || pBefore);\n        let canClose = rightFlanking && (next == 42 || !leftFlanking || pAfter);\n        return cx.append(new InlineDelimiter(next == 95 ? EmphasisUnderscore : EmphasisAsterisk, start, pos, (canOpen ? 1 /* Mark.Open */ : 0 /* Mark.None */) | (canClose ? 2 /* Mark.Close */ : 0 /* Mark.None */)));\n    },\n    HardBreak(cx, next, start) {\n        if (next == 92 /* '\\\\' */ && cx.char(start + 1) == 10 /* '\\n' */)\n            return cx.append(elt(Type.HardBreak, start, start + 2));\n        if (next == 32) {\n            let pos = start + 1;\n            while (cx.char(pos) == 32)\n                pos++;\n            if (cx.char(pos) == 10 && pos >= start + 2)\n                return cx.append(elt(Type.HardBreak, start, pos + 1));\n        }\n        return -1;\n    },\n    Link(cx, next, start) {\n        return next == 91 /* '[' */ ? cx.append(new InlineDelimiter(LinkStart, start, start + 1, 1 /* Mark.Open */)) : -1;\n    },\n    Image(cx, next, start) {\n        return next == 33 /* '!' */ && cx.char(start + 1) == 91 /* '[' */\n            ? cx.append(new InlineDelimiter(ImageStart, start, start + 2, 1 /* Mark.Open */)) : -1;\n    },\n    LinkEnd(cx, next, start) {\n        if (next != 93 /* ']' */)\n            return -1;\n        // Scanning back to the next link/image start marker\n        for (let i = cx.parts.length - 1; i >= 0; i--) {\n            let part = cx.parts[i];\n            if (part instanceof InlineDelimiter && (part.type == LinkStart || part.type == ImageStart)) {\n                // If this one has been set invalid (because it would produce\n                // a nested link) or there's no valid link here ignore both.\n                if (!part.side || cx.skipSpace(part.to) == start && !/[(\\[]/.test(cx.slice(start + 1, start + 2))) {\n                    cx.parts[i] = null;\n                    return -1;\n                }\n                // Finish the content and replace the entire range in\n                // this.parts with the link/image node.\n                let content = cx.takeContent(i);\n                let link = cx.parts[i] = finishLink(cx, content, part.type == LinkStart ? Type.Link : Type.Image, part.from, start + 1);\n                // Set any open-link markers before this link to invalid.\n                if (part.type == LinkStart)\n                    for (let j = 0; j < i; j++) {\n                        let p = cx.parts[j];\n                        if (p instanceof InlineDelimiter && p.type == LinkStart)\n                            p.side = 0 /* Mark.None */;\n                    }\n                return link.to;\n            }\n        }\n        return -1;\n    }\n};\nfunction finishLink(cx, content, type, start, startPos) {\n    let { text } = cx, next = cx.char(startPos), endPos = startPos;\n    content.unshift(elt(Type.LinkMark, start, start + (type == Type.Image ? 2 : 1)));\n    content.push(elt(Type.LinkMark, startPos - 1, startPos));\n    if (next == 40 /* '(' */) {\n        let pos = cx.skipSpace(startPos + 1);\n        let dest = parseURL(text, pos - cx.offset, cx.offset), title;\n        if (dest) {\n            pos = cx.skipSpace(dest.to);\n            // The destination and title must be separated by whitespace\n            if (pos != dest.to) {\n                title = parseLinkTitle(text, pos - cx.offset, cx.offset);\n                if (title)\n                    pos = cx.skipSpace(title.to);\n            }\n        }\n        if (cx.char(pos) == 41 /* ')' */) {\n            content.push(elt(Type.LinkMark, startPos, startPos + 1));\n            endPos = pos + 1;\n            if (dest)\n                content.push(dest);\n            if (title)\n                content.push(title);\n            content.push(elt(Type.LinkMark, pos, endPos));\n        }\n    }\n    else if (next == 91 /* '[' */) {\n        let label = parseLinkLabel(text, startPos - cx.offset, cx.offset, false);\n        if (label) {\n            content.push(label);\n            endPos = label.to;\n        }\n    }\n    return elt(type, start, endPos, content);\n}\n// These return `null` when falling off the end of the input, `false`\n// when parsing fails otherwise (for use in the incremental link\n// reference parser).\nfunction parseURL(text, start, offset) {\n    let next = text.charCodeAt(start);\n    if (next == 60 /* '<' */) {\n        for (let pos = start + 1; pos < text.length; pos++) {\n            let ch = text.charCodeAt(pos);\n            if (ch == 62 /* '>' */)\n                return elt(Type.URL, start + offset, pos + 1 + offset);\n            if (ch == 60 || ch == 10 /* '<\\n' */)\n                return false;\n        }\n        return null;\n    }\n    else {\n        let depth = 0, pos = start;\n        for (let escaped = false; pos < text.length; pos++) {\n            let ch = text.charCodeAt(pos);\n            if (space(ch)) {\n                break;\n            }\n            else if (escaped) {\n                escaped = false;\n            }\n            else if (ch == 40 /* '(' */) {\n                depth++;\n            }\n            else if (ch == 41 /* ')' */) {\n                if (!depth)\n                    break;\n                depth--;\n            }\n            else if (ch == 92 /* '\\\\' */) {\n                escaped = true;\n            }\n        }\n        return pos > start ? elt(Type.URL, start + offset, pos + offset) : pos == text.length ? null : false;\n    }\n}\nfunction parseLinkTitle(text, start, offset) {\n    let next = text.charCodeAt(start);\n    if (next != 39 && next != 34 && next != 40 /* '\"\\'(' */)\n        return false;\n    let end = next == 40 ? 41 : next;\n    for (let pos = start + 1, escaped = false; pos < text.length; pos++) {\n        let ch = text.charCodeAt(pos);\n        if (escaped)\n            escaped = false;\n        else if (ch == end)\n            return elt(Type.LinkTitle, start + offset, pos + 1 + offset);\n        else if (ch == 92 /* '\\\\' */)\n            escaped = true;\n    }\n    return null;\n}\nfunction parseLinkLabel(text, start, offset, requireNonWS) {\n    for (let escaped = false, pos = start + 1, end = Math.min(text.length, pos + 999); pos < end; pos++) {\n        let ch = text.charCodeAt(pos);\n        if (escaped)\n            escaped = false;\n        else if (ch == 93 /* ']' */)\n            return requireNonWS ? false : elt(Type.LinkLabel, start + offset, pos + 1 + offset);\n        else {\n            if (requireNonWS && !space(ch))\n                requireNonWS = false;\n            if (ch == 91 /* '[' */)\n                return false;\n            else if (ch == 92 /* '\\\\' */)\n                escaped = true;\n        }\n    }\n    return null;\n}\n/**\nInline parsing functions get access to this context, and use it to\nread the content and emit syntax nodes.\n*/\nclass InlineContext {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The parser that is being used.\n    */\n    parser, \n    /**\n    The text of this inline section.\n    */\n    text, \n    /**\n    The starting offset of the section in the document.\n    */\n    offset) {\n        this.parser = parser;\n        this.text = text;\n        this.offset = offset;\n        /**\n        @internal\n        */\n        this.parts = [];\n    }\n    /**\n    Get the character code at the given (document-relative)\n    position.\n    */\n    char(pos) { return pos >= this.end ? -1 : this.text.charCodeAt(pos - this.offset); }\n    /**\n    The position of the end of this inline section.\n    */\n    get end() { return this.offset + this.text.length; }\n    /**\n    Get a substring of this inline section. Again uses\n    document-relative positions.\n    */\n    slice(from, to) { return this.text.slice(from - this.offset, to - this.offset); }\n    /**\n    @internal\n    */\n    append(elt) {\n        this.parts.push(elt);\n        return elt.to;\n    }\n    /**\n    Add a [delimiter](#DelimiterType) at this given position. `open`\n    and `close` indicate whether this delimiter is opening, closing,\n    or both. Returns the end of the delimiter, for convenient\n    returning from [parse functions](#InlineParser.parse).\n    */\n    addDelimiter(type, from, to, open, close) {\n        return this.append(new InlineDelimiter(type, from, to, (open ? 1 /* Mark.Open */ : 0 /* Mark.None */) | (close ? 2 /* Mark.Close */ : 0 /* Mark.None */)));\n    }\n    /**\n    Returns true when there is an unmatched link or image opening\n    token before the current position.\n    */\n    get hasOpenLink() {\n        for (let i = this.parts.length - 1; i >= 0; i--) {\n            let part = this.parts[i];\n            if (part instanceof InlineDelimiter && (part.type == LinkStart || part.type == ImageStart))\n                return true;\n        }\n        return false;\n    }\n    /**\n    Add an inline element. Returns the end of the element.\n    */\n    addElement(elt) {\n        return this.append(elt);\n    }\n    /**\n    Resolve markers between this.parts.length and from, wrapping matched markers in the\n    appropriate node and updating the content of this.parts. @internal\n    */\n    resolveMarkers(from) {\n        // Scan forward, looking for closing tokens\n        for (let i = from; i < this.parts.length; i++) {\n            let close = this.parts[i];\n            if (!(close instanceof InlineDelimiter && close.type.resolve && (close.side & 2 /* Mark.Close */)))\n                continue;\n            let emp = close.type == EmphasisUnderscore || close.type == EmphasisAsterisk;\n            let closeSize = close.to - close.from;\n            let open, j = i - 1;\n            // Continue scanning for a matching opening token\n            for (; j >= from; j--) {\n                let part = this.parts[j];\n                if (part instanceof InlineDelimiter && (part.side & 1 /* Mark.Open */) && part.type == close.type &&\n                    // Ignore emphasis delimiters where the character count doesn't match\n                    !(emp && ((close.side & 1 /* Mark.Open */) || (part.side & 2 /* Mark.Close */)) &&\n                        (part.to - part.from + closeSize) % 3 == 0 && ((part.to - part.from) % 3 || closeSize % 3))) {\n                    open = part;\n                    break;\n                }\n            }\n            if (!open)\n                continue;\n            let type = close.type.resolve, content = [];\n            let start = open.from, end = close.to;\n            // Emphasis marker effect depends on the character count. Size consumed is minimum of the two\n            // markers.\n            if (emp) {\n                let size = Math.min(2, open.to - open.from, closeSize);\n                start = open.to - size;\n                end = close.from + size;\n                type = size == 1 ? \"Emphasis\" : \"StrongEmphasis\";\n            }\n            // Move the covered region into content, optionally adding marker nodes\n            if (open.type.mark)\n                content.push(this.elt(open.type.mark, start, open.to));\n            for (let k = j + 1; k < i; k++) {\n                if (this.parts[k] instanceof Element)\n                    content.push(this.parts[k]);\n                this.parts[k] = null;\n            }\n            if (close.type.mark)\n                content.push(this.elt(close.type.mark, close.from, end));\n            let element = this.elt(type, start, end, content);\n            // If there are leftover emphasis marker characters, shrink the close/open markers. Otherwise, clear them.\n            this.parts[j] = emp && open.from != start ? new InlineDelimiter(open.type, open.from, start, open.side) : null;\n            let keep = this.parts[i] = emp && close.to != end ? new InlineDelimiter(close.type, end, close.to, close.side) : null;\n            // Insert the new element in this.parts\n            if (keep)\n                this.parts.splice(i, 0, element);\n            else\n                this.parts[i] = element;\n        }\n        // Collect the elements remaining in this.parts into an array.\n        let result = [];\n        for (let i = from; i < this.parts.length; i++) {\n            let part = this.parts[i];\n            if (part instanceof Element)\n                result.push(part);\n        }\n        return result;\n    }\n    /**\n    Find an opening delimiter of the given type. Returns `null` if\n    no delimiter is found, or an index that can be passed to\n    [`takeContent`](#InlineContext.takeContent) otherwise.\n    */\n    findOpeningDelimiter(type) {\n        for (let i = this.parts.length - 1; i >= 0; i--) {\n            let part = this.parts[i];\n            if (part instanceof InlineDelimiter && part.type == type && (part.side & 1 /* Mark.Open */))\n                return i;\n        }\n        return null;\n    }\n    /**\n    Remove all inline elements and delimiters starting from the\n    given index (which you should get from\n    [`findOpeningDelimiter`](#InlineContext.findOpeningDelimiter),\n    resolve delimiters inside of them, and return them as an array\n    of elements.\n    */\n    takeContent(startIndex) {\n        let content = this.resolveMarkers(startIndex);\n        this.parts.length = startIndex;\n        return content;\n    }\n    /**\n    Return the delimiter at the given index. Mostly useful to get\n    additional info out of a delimiter index returned by\n    [`findOpeningDelimiter`](#InlineContext.findOpeningDelimiter).\n    Returns null if there is no delimiter at this index.\n    */\n    getDelimiterAt(index) {\n        let part = this.parts[index];\n        return part instanceof InlineDelimiter ? part : null;\n    }\n    /**\n    Skip space after the given (document) position, returning either\n    the position of the next non-space character or the end of the\n    section.\n    */\n    skipSpace(from) { return skipSpace(this.text, from - this.offset) + this.offset; }\n    elt(type, from, to, children) {\n        if (typeof type == \"string\")\n            return elt(this.parser.getNodeType(type), from, to, children);\n        return new TreeElement(type, from);\n    }\n}\n/**\nThe opening delimiter type used by the standard link parser.\n*/\nInlineContext.linkStart = LinkStart;\n/**\nOpening delimiter type used for standard images.\n*/\nInlineContext.imageStart = ImageStart;\nfunction injectMarks(elements, marks) {\n    if (!marks.length)\n        return elements;\n    if (!elements.length)\n        return marks;\n    let elts = elements.slice(), eI = 0;\n    for (let mark of marks) {\n        while (eI < elts.length && elts[eI].to < mark.to)\n            eI++;\n        if (eI < elts.length && elts[eI].from < mark.from) {\n            let e = elts[eI];\n            if (e instanceof Element)\n                elts[eI] = new Element(e.type, e.from, e.to, injectMarks(e.children, [mark]));\n        }\n        else {\n            elts.splice(eI++, 0, mark);\n        }\n    }\n    return elts;\n}\n// These are blocks that can span blank lines, and should thus only be\n// reused if their next sibling is also being reused.\nconst NotLast = [Type.CodeBlock, Type.ListItem, Type.OrderedList, Type.BulletList];\nclass FragmentCursor {\n    constructor(fragments, input) {\n        this.fragments = fragments;\n        this.input = input;\n        // Index into fragment array\n        this.i = 0;\n        // Active fragment\n        this.fragment = null;\n        this.fragmentEnd = -1;\n        // Cursor into the current fragment, if any. When `moveTo` returns\n        // true, this points at the first block after `pos`.\n        this.cursor = null;\n        if (fragments.length)\n            this.fragment = fragments[this.i++];\n    }\n    nextFragment() {\n        this.fragment = this.i < this.fragments.length ? this.fragments[this.i++] : null;\n        this.cursor = null;\n        this.fragmentEnd = -1;\n    }\n    moveTo(pos, lineStart) {\n        while (this.fragment && this.fragment.to <= pos)\n            this.nextFragment();\n        if (!this.fragment || this.fragment.from > (pos ? pos - 1 : 0))\n            return false;\n        if (this.fragmentEnd < 0) {\n            let end = this.fragment.to;\n            while (end > 0 && this.input.read(end - 1, end) != \"\\n\")\n                end--;\n            this.fragmentEnd = end ? end - 1 : 0;\n        }\n        let c = this.cursor;\n        if (!c) {\n            c = this.cursor = this.fragment.tree.cursor();\n            c.firstChild();\n        }\n        let rPos = pos + this.fragment.offset;\n        while (c.to <= rPos)\n            if (!c.parent())\n                return false;\n        for (;;) {\n            if (c.from >= rPos)\n                return this.fragment.from <= lineStart;\n            if (!c.childAfter(rPos))\n                return false;\n        }\n    }\n    matches(hash) {\n        let tree = this.cursor.tree;\n        return tree && tree.prop(NodeProp.contextHash) == hash;\n    }\n    takeNodes(cx) {\n        let cur = this.cursor, off = this.fragment.offset, fragEnd = this.fragmentEnd - (this.fragment.openEnd ? 1 : 0);\n        let start = cx.absoluteLineStart, end = start, blockI = cx.block.children.length;\n        let prevEnd = end, prevI = blockI;\n        for (;;) {\n            if (cur.to - off > fragEnd) {\n                if (cur.type.isAnonymous && cur.firstChild())\n                    continue;\n                break;\n            }\n            let pos = toRelative(cur.from - off, cx.ranges);\n            if (cur.to - off <= cx.ranges[cx.rangeI].to) { // Fits in current range\n                cx.addNode(cur.tree, pos);\n            }\n            else {\n                let dummy = new Tree(cx.parser.nodeSet.types[Type.Paragraph], [], [], 0, cx.block.hashProp);\n                cx.reusePlaceholders.set(dummy, cur.tree);\n                cx.addNode(dummy, pos);\n            }\n            // Taken content must always end in a block, because incremental\n            // parsing happens on block boundaries. Never stop directly\n            // after an indented code block, since those can continue after\n            // any number of blank lines.\n            if (cur.type.is(\"Block\")) {\n                if (NotLast.indexOf(cur.type.id) < 0) {\n                    end = cur.to - off;\n                    blockI = cx.block.children.length;\n                }\n                else {\n                    end = prevEnd;\n                    blockI = prevI;\n                }\n                prevEnd = cur.to - off;\n                prevI = cx.block.children.length;\n            }\n            if (!cur.nextSibling())\n                break;\n        }\n        while (cx.block.children.length > blockI) {\n            cx.block.children.pop();\n            cx.block.positions.pop();\n        }\n        return end - start;\n    }\n}\n// Convert an input-stream-relative position to a\n// Markdown-doc-relative position by subtracting the size of all input\n// gaps before `abs`.\nfunction toRelative(abs, ranges) {\n    let pos = abs;\n    for (let i = 1; i < ranges.length; i++) {\n        let gapFrom = ranges[i - 1].to, gapTo = ranges[i].from;\n        if (gapFrom < abs)\n            pos -= gapTo - gapFrom;\n    }\n    return pos;\n}\nconst markdownHighlighting = styleTags({\n    \"Blockquote/...\": tags.quote,\n    HorizontalRule: tags.contentSeparator,\n    \"ATXHeading1/... SetextHeading1/...\": tags.heading1,\n    \"ATXHeading2/... SetextHeading2/...\": tags.heading2,\n    \"ATXHeading3/...\": tags.heading3,\n    \"ATXHeading4/...\": tags.heading4,\n    \"ATXHeading5/...\": tags.heading5,\n    \"ATXHeading6/...\": tags.heading6,\n    \"Comment CommentBlock\": tags.comment,\n    Escape: tags.escape,\n    Entity: tags.character,\n    \"Emphasis/...\": tags.emphasis,\n    \"StrongEmphasis/...\": tags.strong,\n    \"Link/... Image/...\": tags.link,\n    \"OrderedList/... BulletList/...\": tags.list,\n    \"BlockQuote/...\": tags.quote,\n    \"InlineCode CodeText\": tags.monospace,\n    \"URL Autolink\": tags.url,\n    \"HeaderMark HardBreak QuoteMark ListMark LinkMark EmphasisMark CodeMark\": tags.processingInstruction,\n    \"CodeInfo LinkLabel\": tags.labelName,\n    LinkTitle: tags.string,\n    Paragraph: tags.content\n});\n/**\nThe default CommonMark parser.\n*/\nconst parser = new MarkdownParser(new NodeSet(nodeTypes).extend(markdownHighlighting), Object.keys(DefaultBlockParsers).map(n => DefaultBlockParsers[n]), Object.keys(DefaultBlockParsers).map(n => DefaultLeafBlocks[n]), Object.keys(DefaultBlockParsers), DefaultEndLeaf, DefaultSkipMarkup, Object.keys(DefaultInline).map(n => DefaultInline[n]), Object.keys(DefaultInline), []);\n\nfunction leftOverSpace(node, from, to) {\n    let ranges = [];\n    for (let n = node.firstChild, pos = from;; n = n.nextSibling) {\n        let nextPos = n ? n.from : to;\n        if (nextPos > pos)\n            ranges.push({ from: pos, to: nextPos });\n        if (!n)\n            break;\n        pos = n.to;\n    }\n    return ranges;\n}\n/**\nCreate a Markdown extension to enable nested parsing on code\nblocks and/or embedded HTML.\n*/\nfunction parseCode(config) {\n    let { codeParser, htmlParser } = config;\n    let wrap = parseMixed((node, input) => {\n        let id = node.type.id;\n        if (codeParser && (id == Type.CodeBlock || id == Type.FencedCode)) {\n            let info = \"\";\n            if (id == Type.FencedCode) {\n                let infoNode = node.node.getChild(Type.CodeInfo);\n                if (infoNode)\n                    info = input.read(infoNode.from, infoNode.to);\n            }\n            let parser = codeParser(info);\n            if (parser)\n                return { parser, overlay: node => node.type.id == Type.CodeText, bracketed: id == Type.FencedCode };\n        }\n        else if (htmlParser && (id == Type.HTMLBlock || id == Type.HTMLTag || id == Type.CommentBlock)) {\n            return { parser: htmlParser, overlay: leftOverSpace(node.node, node.from, node.to) };\n        }\n        return null;\n    });\n    return { wrap };\n}\n\nconst StrikethroughDelim = { resolve: \"Strikethrough\", mark: \"StrikethroughMark\" };\n/**\nAn extension that implements\n[GFM-style](https://github.github.com/gfm/#strikethrough-extension-)\nStrikethrough syntax using `~~` delimiters.\n*/\nconst Strikethrough = {\n    defineNodes: [{\n            name: \"Strikethrough\",\n            style: { \"Strikethrough/...\": tags.strikethrough }\n        }, {\n            name: \"StrikethroughMark\",\n            style: tags.processingInstruction\n        }],\n    parseInline: [{\n            name: \"Strikethrough\",\n            parse(cx, next, pos) {\n                if (next != 126 /* '~' */ || cx.char(pos + 1) != 126 || cx.char(pos + 2) == 126)\n                    return -1;\n                let before = cx.slice(pos - 1, pos), after = cx.slice(pos + 2, pos + 3);\n                let sBefore = /\\s|^$/.test(before), sAfter = /\\s|^$/.test(after);\n                let pBefore = Punctuation.test(before), pAfter = Punctuation.test(after);\n                return cx.addDelimiter(StrikethroughDelim, pos, pos + 2, !sAfter && (!pAfter || sBefore || pBefore), !sBefore && (!pBefore || sAfter || pAfter));\n            },\n            after: \"Emphasis\"\n        }]\n};\n// Parse a line as a table row and return the row count. When `elts`\n// is given, push syntax elements for the content onto it.\nfunction parseRow(cx, line, startI = 0, elts, offset = 0) {\n    let count = 0, first = true, cellStart = -1, cellEnd = -1, esc = false;\n    let parseCell = () => {\n        elts.push(cx.elt(\"TableCell\", offset + cellStart, offset + cellEnd, cx.parser.parseInline(line.slice(cellStart, cellEnd), offset + cellStart)));\n    };\n    for (let i = startI; i < line.length; i++) {\n        let next = line.charCodeAt(i);\n        if (next == 124 /* '|' */ && !esc) {\n            if (!first || cellStart > -1)\n                count++;\n            first = false;\n            if (elts) {\n                if (cellStart > -1)\n                    parseCell();\n                elts.push(cx.elt(\"TableDelimiter\", i + offset, i + offset + 1));\n            }\n            cellStart = cellEnd = -1;\n        }\n        else if (esc || next != 32 && next != 9) {\n            if (cellStart < 0)\n                cellStart = i;\n            cellEnd = i + 1;\n        }\n        esc = !esc && next == 92;\n    }\n    if (cellStart > -1) {\n        count++;\n        if (elts)\n            parseCell();\n    }\n    return count;\n}\nfunction hasPipe(str, start) {\n    for (let i = start; i < str.length; i++) {\n        let next = str.charCodeAt(i);\n        if (next == 124 /* '|' */)\n            return true;\n        if (next == 92 /* '\\\\' */)\n            i++;\n    }\n    return false;\n}\nconst delimiterLine = /^[>\\s]*\\|?(\\s*:?-+:?\\s*\\|)+(\\s*:?-+:?\\s*)?$/;\nclass TableParser {\n    constructor() {\n        // Null means we haven't seen the second line yet, false means this\n        // isn't a table, and an array means this is a table and we've\n        // parsed the given rows so far.\n        this.rows = null;\n    }\n    nextLine(cx, line, leaf) {\n        if (this.rows == null) { // Second line\n            this.rows = false;\n            let lineText;\n            if ((line.next == 45 || line.next == 58 || line.next == 124 /* '-:|' */) &&\n                delimiterLine.test(lineText = line.text.slice(line.pos))) {\n                let firstRow = [], firstCount = parseRow(cx, leaf.content, 0, firstRow, leaf.start);\n                if (firstCount == parseRow(cx, lineText, 0))\n                    this.rows = [cx.elt(\"TableHeader\", leaf.start, leaf.start + leaf.content.length, firstRow),\n                        cx.elt(\"TableDelimiter\", cx.lineStart + line.pos, cx.lineStart + line.text.length)];\n            }\n        }\n        else if (this.rows) { // Line after the second\n            let content = [];\n            parseRow(cx, line.text, line.pos, content, cx.lineStart);\n            this.rows.push(cx.elt(\"TableRow\", cx.lineStart + line.pos, cx.lineStart + line.text.length, content));\n        }\n        return false;\n    }\n    finish(cx, leaf) {\n        if (!this.rows)\n            return false;\n        cx.addLeafElement(leaf, cx.elt(\"Table\", leaf.start, leaf.start + leaf.content.length, this.rows));\n        return true;\n    }\n}\n/**\nThis extension provides\n[GFM-style](https://github.github.com/gfm/#tables-extension-)\ntables, using syntax like this:\n\n```\n| head 1 | head 2 |\n| ---    | ---    |\n| cell 1 | cell 2 |\n```\n*/\nconst Table = {\n    defineNodes: [\n        { name: \"Table\", block: true },\n        { name: \"TableHeader\", style: { \"TableHeader/...\": tags.heading } },\n        \"TableRow\",\n        { name: \"TableCell\", style: tags.content },\n        { name: \"TableDelimiter\", style: tags.processingInstruction },\n    ],\n    parseBlock: [{\n            name: \"Table\",\n            leaf(_, leaf) { return hasPipe(leaf.content, 0) ? new TableParser : null; },\n            endLeaf(cx, line, leaf) {\n                if (leaf.parsers.some(p => p instanceof TableParser) || !hasPipe(line.text, line.basePos))\n                    return false;\n                let next = cx.peekLine();\n                return delimiterLine.test(next) && parseRow(cx, line.text, line.basePos) == parseRow(cx, next, line.basePos);\n            },\n            before: \"SetextHeading\"\n        }]\n};\nclass TaskParser {\n    nextLine() { return false; }\n    finish(cx, leaf) {\n        cx.addLeafElement(leaf, cx.elt(\"Task\", leaf.start, leaf.start + leaf.content.length, [\n            cx.elt(\"TaskMarker\", leaf.start, leaf.start + 3),\n            ...cx.parser.parseInline(leaf.content.slice(3), leaf.start + 3)\n        ]));\n        return true;\n    }\n}\n/**\nExtension providing\n[GFM-style](https://github.github.com/gfm/#task-list-items-extension-)\ntask list items, where list items can be prefixed with `[ ]` or\n`[x]` to add a checkbox.\n*/\nconst TaskList = {\n    defineNodes: [\n        { name: \"Task\", block: true, style: tags.list },\n        { name: \"TaskMarker\", style: tags.atom }\n    ],\n    parseBlock: [{\n            name: \"TaskList\",\n            leaf(cx, leaf) {\n                return /^\\[[ xX]\\][ \\t]/.test(leaf.content) && cx.parentType().name == \"ListItem\" ? new TaskParser : null;\n            },\n            after: \"SetextHeading\"\n        }]\n};\nconst autolinkRE = /(www\\.)|(https?:\\/\\/)|([\\w.+-]{1,100}@)|(mailto:|xmpp:)/gy;\nconst urlRE = /[\\w-]+(\\.[\\w-]+)+(:\\d+)?(\\/[^\\s<]*)?/gy;\nconst lastTwoDomainWords = /[\\w-]+\\.[\\w-]+($|[/:])/;\nconst emailRE = /[\\w.+-]+@[\\w-]+(\\.[\\w.-]+)+/gy;\nconst xmppResourceRE = /\\/[a-zA-Z\\d@.]+/gy;\nfunction count(str, from, to, ch) {\n    let result = 0;\n    for (let i = from; i < to; i++)\n        if (str[i] == ch)\n            result++;\n    return result;\n}\nfunction autolinkURLEnd(text, from) {\n    urlRE.lastIndex = from;\n    let m = urlRE.exec(text);\n    if (!m || lastTwoDomainWords.exec(m[0])[0].indexOf(\"_\") > -1)\n        return -1;\n    let end = from + m[0].length;\n    for (;;) {\n        let last = text[end - 1], m;\n        if (/[?!.,:*_~]/.test(last) ||\n            last == \")\" && count(text, from, end, \")\") > count(text, from, end, \"(\"))\n            end--;\n        else if (last == \";\" && (m = /&(?:#\\d+|#x[a-f\\d]+|\\w+);$/.exec(text.slice(from, end))))\n            end = from + m.index;\n        else\n            break;\n    }\n    return end;\n}\nfunction autolinkEmailEnd(text, from) {\n    emailRE.lastIndex = from;\n    let m = emailRE.exec(text);\n    if (!m)\n        return -1;\n    let last = m[0][m[0].length - 1];\n    return last == \"_\" || last == \"-\" ? -1 : from + m[0].length - (last == \".\" ? 1 : 0);\n}\n/**\nExtension that implements autolinking for\n`www.`/`http://`/`https://`/`mailto:`/`xmpp:` URLs and email\naddresses.\n*/\nconst Autolink = {\n    parseInline: [{\n            name: \"Autolink\",\n            parse(cx, next, absPos) {\n                let pos = absPos - cx.offset;\n                if (pos && /\\w/.test(cx.text[pos - 1]))\n                    return -1;\n                autolinkRE.lastIndex = pos;\n                let m = autolinkRE.exec(cx.text), end = -1;\n                if (!m)\n                    return -1;\n                if (m[1] || m[2]) { // www., http://\n                    end = autolinkURLEnd(cx.text, pos + m[0].length);\n                    if (end > -1 && cx.hasOpenLink) {\n                        let noBracket = /([^\\[\\]]|\\[[^\\]]*\\])*/.exec(cx.text.slice(pos, end));\n                        end = pos + noBracket[0].length;\n                    }\n                }\n                else if (m[3]) { // email address\n                    end = autolinkEmailEnd(cx.text, pos);\n                }\n                else { // mailto:/xmpp:\n                    end = autolinkEmailEnd(cx.text, pos + m[0].length);\n                    if (end > -1 && m[0] == \"xmpp:\") {\n                        xmppResourceRE.lastIndex = end;\n                        m = xmppResourceRE.exec(cx.text);\n                        if (m)\n                            end = m.index + m[0].length;\n                    }\n                }\n                if (end < 0)\n                    return -1;\n                cx.addElement(cx.elt(\"URL\", absPos, end + cx.offset));\n                return end + cx.offset;\n            }\n        }]\n};\n/**\nExtension bundle containing [`Table`](#Table),\n[`TaskList`](#TaskList), [`Strikethrough`](#Strikethrough), and\n[`Autolink`](#Autolink).\n*/\nconst GFM = [Table, TaskList, Strikethrough, Autolink];\nfunction parseSubSuper(ch, node, mark) {\n    return (cx, next, pos) => {\n        if (next != ch || cx.char(pos + 1) == ch)\n            return -1;\n        let elts = [cx.elt(mark, pos, pos + 1)];\n        for (let i = pos + 1; i < cx.end; i++) {\n            let next = cx.char(i);\n            if (next == ch)\n                return cx.addElement(cx.elt(node, pos, i + 1, elts.concat(cx.elt(mark, i, i + 1))));\n            if (next == 92 /* '\\\\' */)\n                elts.push(cx.elt(\"Escape\", i, i++ + 2));\n            if (space(next))\n                break;\n        }\n        return -1;\n    };\n}\n/**\nExtension providing\n[Pandoc-style](https://pandoc.org/MANUAL.html#superscripts-and-subscripts)\nsuperscript using `^` markers.\n*/\nconst Superscript = {\n    defineNodes: [\n        { name: \"Superscript\", style: tags.special(tags.content) },\n        { name: \"SuperscriptMark\", style: tags.processingInstruction }\n    ],\n    parseInline: [{\n            name: \"Superscript\",\n            parse: parseSubSuper(94 /* '^' */, \"Superscript\", \"SuperscriptMark\")\n        }]\n};\n/**\nExtension providing\n[Pandoc-style](https://pandoc.org/MANUAL.html#superscripts-and-subscripts)\nsubscript using `~` markers.\n*/\nconst Subscript = {\n    defineNodes: [\n        { name: \"Subscript\", style: tags.special(tags.content) },\n        { name: \"SubscriptMark\", style: tags.processingInstruction }\n    ],\n    parseInline: [{\n            name: \"Subscript\",\n            parse: parseSubSuper(126 /* '~' */, \"Subscript\", \"SubscriptMark\")\n        }]\n};\n/**\nExtension that parses two colons with only letters, underscores,\nand numbers between them as `Emoji` nodes.\n*/\nconst Emoji = {\n    defineNodes: [{ name: \"Emoji\", style: tags.character }],\n    parseInline: [{\n            name: \"Emoji\",\n            parse(cx, next, pos) {\n                let match;\n                if (next != 58 /* ':' */ || !(match = /^[a-zA-Z_0-9]+:/.exec(cx.slice(pos + 1, cx.end))))\n                    return -1;\n                return cx.addElement(cx.elt(\"Emoji\", pos, pos + 1 + match[0].length));\n            }\n        }]\n};\n\nexport { Autolink, BlockContext, Element, Emoji, GFM, InlineContext, LeafBlock, Line, MarkdownParser, Strikethrough, Subscript, Superscript, Table, TaskList, parseCode, parser };\n","import { EditorSelection, countColumn, Prec, EditorState } from '@codemirror/state';\nimport { keymap } from '@codemirror/view';\nimport { defineLanguageFacet, foldNodeProp, indentNodeProp, languageDataProp, foldService, syntaxTree, Language, LanguageDescription, ParseContext, indentUnit, LanguageSupport } from '@codemirror/language';\nimport { CompletionContext } from '@codemirror/autocomplete';\nimport { parser, GFM, Subscript, Superscript, Emoji, MarkdownParser, parseCode } from '@lezer/markdown';\nimport { html, htmlCompletionSource } from '@codemirror/lang-html';\nimport { NodeProp } from '@lezer/common';\n\nconst data = /*@__PURE__*/defineLanguageFacet({ commentTokens: { block: { open: \"<!--\", close: \"-->\" } } });\nconst headingProp = /*@__PURE__*/new NodeProp();\nconst commonmark = /*@__PURE__*/parser.configure({\n    props: [\n        /*@__PURE__*/foldNodeProp.add(type => {\n            return !type.is(\"Block\") || type.is(\"Document\") || isHeading(type) != null ? undefined\n                : (tree, state) => ({ from: state.doc.lineAt(tree.from).to, to: tree.to });\n        }),\n        /*@__PURE__*/headingProp.add(isHeading),\n        /*@__PURE__*/indentNodeProp.add({\n            Document: () => null\n        }),\n        /*@__PURE__*/languageDataProp.add({\n            Document: data\n        })\n    ]\n});\nfunction isHeading(type) {\n    let match = /^(?:ATX|Setext)Heading(\\d)$/.exec(type.name);\n    return match ? +match[1] : undefined;\n}\nfunction findSectionEnd(headerNode, level) {\n    let last = headerNode;\n    for (;;) {\n        let next = last.nextSibling, heading;\n        if (!next || (heading = isHeading(next.type)) != null && heading <= level)\n            break;\n        last = next;\n    }\n    return last.to;\n}\nconst headerIndent = /*@__PURE__*/foldService.of((state, start, end) => {\n    for (let node = syntaxTree(state).resolveInner(end, -1); node; node = node.parent) {\n        if (node.from < start)\n            break;\n        let heading = node.type.prop(headingProp);\n        if (heading == null)\n            continue;\n        let upto = findSectionEnd(node, heading);\n        if (upto > end)\n            return { from: end, to: upto };\n    }\n    return null;\n});\nfunction mkLang(parser) {\n    return new Language(data, parser, [headerIndent], \"markdown\");\n}\n/**\nLanguage support for strict CommonMark.\n*/\nconst commonmarkLanguage = /*@__PURE__*/mkLang(commonmark);\nconst extended = /*@__PURE__*/commonmark.configure([GFM, Subscript, Superscript, Emoji]);\n/**\nLanguage support for [GFM](https://github.github.com/gfm/) plus\nsubscript, superscript, and emoji syntax.\n*/\nconst markdownLanguage = /*@__PURE__*/mkLang(extended);\nfunction getCodeParser(languages, defaultLanguage) {\n    return (info) => {\n        if (info && languages) {\n            let found = null;\n            // Strip anything after whitespace\n            info = /\\S*/.exec(info)[0];\n            if (typeof languages == \"function\")\n                found = languages(info);\n            else\n                found = LanguageDescription.matchLanguageName(languages, info, true);\n            if (found instanceof LanguageDescription)\n                return found.support ? found.support.language.parser : ParseContext.getSkippingParser(found.load());\n            else if (found)\n                return found.parser;\n        }\n        return defaultLanguage ? defaultLanguage.parser : null;\n    };\n}\n\nclass Context {\n    constructor(node, from, to, spaceBefore, spaceAfter, type, item) {\n        this.node = node;\n        this.from = from;\n        this.to = to;\n        this.spaceBefore = spaceBefore;\n        this.spaceAfter = spaceAfter;\n        this.type = type;\n        this.item = item;\n    }\n    blank(maxWidth, trailing = true) {\n        let result = this.spaceBefore + (this.node.name == \"Blockquote\" ? \">\" : \"\");\n        if (maxWidth != null) {\n            while (result.length < maxWidth)\n                result += \" \";\n            return result;\n        }\n        else {\n            for (let i = this.to - this.from - result.length - this.spaceAfter.length; i > 0; i--)\n                result += \" \";\n            return result + (trailing ? this.spaceAfter : \"\");\n        }\n    }\n    marker(doc, add) {\n        let number = this.node.name == \"OrderedList\" ? String((+itemNumber(this.item, doc)[2] + add)) : \"\";\n        return this.spaceBefore + number + this.type + this.spaceAfter;\n    }\n}\nfunction getContext(node, doc) {\n    let nodes = [];\n    for (let cur = node; cur && cur.name != \"Document\"; cur = cur.parent) {\n        if (cur.name == \"ListItem\" || cur.name == \"Blockquote\" || cur.name == \"FencedCode\")\n            nodes.push(cur);\n    }\n    let context = [];\n    for (let i = nodes.length - 1; i >= 0; i--) {\n        let node = nodes[i], match;\n        let line = doc.lineAt(node.from), startPos = node.from - line.from;\n        if (node.name == \"FencedCode\") {\n            context.push(new Context(node, startPos, startPos, \"\", \"\", \"\", null));\n        }\n        else if (node.name == \"Blockquote\" && (match = /^ *>( ?)/.exec(line.text.slice(startPos)))) {\n            context.push(new Context(node, startPos, startPos + match[0].length, \"\", match[1], \">\", null));\n        }\n        else if (node.name == \"ListItem\" && node.parent.name == \"OrderedList\" &&\n            (match = /^( *)\\d+([.)])( *)/.exec(line.text.slice(startPos)))) {\n            let after = match[3], len = match[0].length;\n            if (after.length >= 4) {\n                after = after.slice(0, after.length - 4);\n                len -= 4;\n            }\n            context.push(new Context(node.parent, startPos, startPos + len, match[1], after, match[2], node));\n        }\n        else if (node.name == \"ListItem\" && node.parent.name == \"BulletList\" &&\n            (match = /^( *)([-+*])( {1,4}\\[[ xX]\\])?( +)/.exec(line.text.slice(startPos)))) {\n            let after = match[4], len = match[0].length;\n            if (after.length > 4) {\n                after = after.slice(0, after.length - 4);\n                len -= 4;\n            }\n            let type = match[2];\n            if (match[3])\n                type += match[3].replace(/[xX]/, ' ');\n            context.push(new Context(node.parent, startPos, startPos + len, match[1], after, type, node));\n        }\n    }\n    return context;\n}\nfunction itemNumber(item, doc) {\n    return /^(\\s*)(\\d+)(?=[.)])/.exec(doc.sliceString(item.from, item.from + 10));\n}\nfunction renumberList(after, doc, changes, offset = 0) {\n    for (let prev = -1, node = after;;) {\n        if (node.name == \"ListItem\") {\n            let m = itemNumber(node, doc);\n            let number = +m[2];\n            if (prev >= 0) {\n                if (number != prev + 1)\n                    return;\n                changes.push({ from: node.from + m[1].length, to: node.from + m[0].length, insert: String(prev + 2 + offset) });\n            }\n            prev = number;\n        }\n        let next = node.nextSibling;\n        if (!next)\n            break;\n        node = next;\n    }\n}\nfunction normalizeIndent(content, state) {\n    let blank = /^[ \\t]*/.exec(content)[0].length;\n    if (!blank || state.facet(indentUnit) != \"\\t\")\n        return content;\n    let col = countColumn(content, 4, blank);\n    let space = \"\";\n    for (let i = col; i > 0;) {\n        if (i >= 4) {\n            space += \"\\t\";\n            i -= 4;\n        }\n        else {\n            space += \" \";\n            i--;\n        }\n    }\n    return space + content.slice(blank);\n}\n/**\nThis command, when invoked in Markdown context with cursor\nselection(s), will create a new line with the markup for\nblockquotes and lists that were active on the old line. If the\ncursor was directly after the end of the markup for the old line,\ntrailing whitespace and list markers are removed from that line.\n\nThe command does nothing in non-Markdown context, so it should\nnot be used as the only binding for Enter (even in a Markdown\ndocument, HTML and code regions might use a different language).\n*/\nconst insertNewlineContinueMarkup = ({ state, dispatch }) => {\n    let tree = syntaxTree(state), { doc } = state;\n    let dont = null, changes = state.changeByRange(range => {\n        if (!range.empty || !markdownLanguage.isActiveAt(state, range.from))\n            return dont = { range };\n        let pos = range.from, line = doc.lineAt(pos);\n        let context = getContext(tree.resolveInner(pos, -1), doc);\n        while (context.length && context[context.length - 1].from > pos - line.from)\n            context.pop();\n        if (!context.length)\n            return dont = { range };\n        let inner = context[context.length - 1];\n        if (inner.to - inner.spaceAfter.length > pos - line.from)\n            return dont = { range };\n        let emptyLine = pos >= (inner.to - inner.spaceAfter.length) && !/\\S/.test(line.text.slice(inner.to));\n        // Empty line in list\n        if (inner.item && emptyLine) {\n            // First list item or blank line before: delete a level of markup\n            if (inner.node.firstChild.to >= pos ||\n                line.from > 0 && !/[^\\s>]/.test(doc.lineAt(line.from - 1).text)) {\n                let next = context.length > 1 ? context[context.length - 2] : null;\n                let delTo, insert = \"\";\n                if (next && next.item) { // Re-add marker for the list at the next level\n                    delTo = line.from + next.from;\n                    insert = next.marker(doc, 1);\n                }\n                else {\n                    delTo = line.from + (next ? next.to : 0);\n                }\n                let changes = [{ from: delTo, to: pos, insert }];\n                if (inner.node.name == \"OrderedList\")\n                    renumberList(inner.item, doc, changes, -2);\n                if (next && next.node.name == \"OrderedList\")\n                    renumberList(next.item, doc, changes);\n                return { range: EditorSelection.cursor(delTo + insert.length), changes };\n            }\n            else { // Move this line down\n                let insert = \"\";\n                for (let i = 0, e = context.length - 2; i <= e; i++) {\n                    insert += context[i].blank(i < e ? countColumn(line.text, 4, context[i + 1].from) - insert.length : null, i < e);\n                }\n                insert = normalizeIndent(insert, state);\n                return { range: EditorSelection.cursor(pos + insert.length + 1),\n                    changes: { from: line.from, insert: insert + state.lineBreak } };\n            }\n        }\n        if (inner.node.name == \"Blockquote\" && emptyLine && line.from) {\n            let prevLine = doc.lineAt(line.from - 1), quoted = />\\s*$/.exec(prevLine.text);\n            // Two aligned empty quoted lines in a row\n            if (quoted && quoted.index == inner.from) {\n                let changes = state.changes([{ from: prevLine.from + quoted.index, to: prevLine.to },\n                    { from: line.from + inner.from, to: line.to }]);\n                return { range: range.map(changes), changes };\n            }\n        }\n        let changes = [];\n        if (inner.node.name == \"OrderedList\")\n            renumberList(inner.item, doc, changes);\n        let continued = inner.item && inner.item.from < line.from;\n        let insert = \"\";\n        // If not dedented\n        if (!continued || /^[\\s\\d.)\\-+*>]*/.exec(line.text)[0].length >= inner.to) {\n            for (let i = 0, e = context.length - 1; i <= e; i++) {\n                insert += i == e && !continued ? context[i].marker(doc, 1)\n                    : context[i].blank(i < e ? countColumn(line.text, 4, context[i + 1].from) - insert.length : null);\n            }\n        }\n        let from = pos;\n        while (from > line.from && /\\s/.test(line.text.charAt(from - line.from - 1)))\n            from--;\n        insert = normalizeIndent(insert, state);\n        changes.push({ from, to: pos, insert: state.lineBreak + insert });\n        return { range: EditorSelection.cursor(from + insert.length + 1), changes };\n    });\n    if (dont)\n        return false;\n    dispatch(state.update(changes, { scrollIntoView: true, userEvent: \"input\" }));\n    return true;\n};\nfunction isMark(node) {\n    return node.name == \"QuoteMark\" || node.name == \"ListMark\";\n}\nfunction contextNodeForDelete(tree, pos) {\n    let node = tree.resolveInner(pos, -1), scan = pos;\n    if (isMark(node)) {\n        scan = node.from;\n        node = node.parent;\n    }\n    for (let prev; prev = node.childBefore(scan);) {\n        if (isMark(prev)) {\n            scan = prev.from;\n        }\n        else if (prev.name == \"OrderedList\" || prev.name == \"BulletList\") {\n            node = prev.lastChild;\n            scan = node.to;\n        }\n        else {\n            break;\n        }\n    }\n    return node;\n}\n/**\nThis command will, when invoked in a Markdown context with the\ncursor directly after list or blockquote markup, delete one level\nof markup. When the markup is for a list, it will be replaced by\nspaces on the first invocation (a further invocation will delete\nthe spaces), to make it easy to continue a list.\n\nWhen not after Markdown block markup, this command will return\nfalse, so it is intended to be bound alongside other deletion\ncommands, with a higher precedence than the more generic commands.\n*/\nconst deleteMarkupBackward = ({ state, dispatch }) => {\n    let tree = syntaxTree(state);\n    let dont = null, changes = state.changeByRange(range => {\n        let pos = range.from, { doc } = state;\n        if (range.empty && markdownLanguage.isActiveAt(state, range.from)) {\n            let line = doc.lineAt(pos);\n            let context = getContext(contextNodeForDelete(tree, pos), doc);\n            if (context.length) {\n                let inner = context[context.length - 1];\n                let spaceEnd = inner.to - inner.spaceAfter.length + (inner.spaceAfter ? 1 : 0);\n                // Delete extra trailing space after markup\n                if (pos - line.from > spaceEnd && !/\\S/.test(line.text.slice(spaceEnd, pos - line.from)))\n                    return { range: EditorSelection.cursor(line.from + spaceEnd),\n                        changes: { from: line.from + spaceEnd, to: pos } };\n                if (pos - line.from == spaceEnd &&\n                    // Only apply this if we're on the line that has the\n                    // construct's syntax, or there's only indentation in the\n                    // target range\n                    (!inner.item || line.from <= inner.item.from || !/\\S/.test(line.text.slice(0, inner.to)))) {\n                    let start = line.from + inner.from;\n                    // Replace a list item marker with blank space\n                    if (inner.item && inner.node.from < inner.item.from && /\\S/.test(line.text.slice(inner.from, inner.to))) {\n                        let insert = inner.blank(countColumn(line.text, 4, inner.to) - countColumn(line.text, 4, inner.from));\n                        if (start == line.from)\n                            insert = normalizeIndent(insert, state);\n                        return { range: EditorSelection.cursor(start + insert.length),\n                            changes: { from: start, to: line.from + inner.to, insert } };\n                    }\n                    // Delete one level of indentation\n                    if (start < pos)\n                        return { range: EditorSelection.cursor(start), changes: { from: start, to: pos } };\n                }\n            }\n        }\n        return dont = { range };\n    });\n    if (dont)\n        return false;\n    dispatch(state.update(changes, { scrollIntoView: true, userEvent: \"delete\" }));\n    return true;\n};\n\n/**\nA small keymap with Markdown-specific bindings. Binds Enter to\n[`insertNewlineContinueMarkup`](https://codemirror.net/6/docs/ref/#lang-markdown.insertNewlineContinueMarkup)\nand Backspace to\n[`deleteMarkupBackward`](https://codemirror.net/6/docs/ref/#lang-markdown.deleteMarkupBackward).\n*/\nconst markdownKeymap = [\n    { key: \"Enter\", run: insertNewlineContinueMarkup },\n    { key: \"Backspace\", run: deleteMarkupBackward }\n];\nconst htmlNoMatch = /*@__PURE__*/html({ matchClosingTags: false });\n/**\nMarkdown language support.\n*/\nfunction markdown(config = {}) {\n    let { codeLanguages, defaultCodeLanguage, addKeymap = true, base: { parser } = commonmarkLanguage, completeHTMLTags = true } = config;\n    if (!(parser instanceof MarkdownParser))\n        throw new RangeError(\"Base parser provided to `markdown` should be a Markdown parser\");\n    let extensions = config.extensions ? [config.extensions] : [];\n    let support = [htmlNoMatch.support], defaultCode;\n    if (defaultCodeLanguage instanceof LanguageSupport) {\n        support.push(defaultCodeLanguage.support);\n        defaultCode = defaultCodeLanguage.language;\n    }\n    else if (defaultCodeLanguage) {\n        defaultCode = defaultCodeLanguage;\n    }\n    let codeParser = codeLanguages || defaultCode ? getCodeParser(codeLanguages, defaultCode) : undefined;\n    extensions.push(parseCode({ codeParser, htmlParser: htmlNoMatch.language.parser }));\n    if (addKeymap)\n        support.push(Prec.high(keymap.of(markdownKeymap)));\n    let lang = mkLang(parser.configure(extensions));\n    if (completeHTMLTags)\n        support.push(lang.data.of({ autocomplete: htmlTagCompletion }));\n    return new LanguageSupport(lang, support);\n}\nfunction htmlTagCompletion(context) {\n    let { state, pos } = context, m = /<[:\\-\\.\\w\\u00b7-\\uffff]*$/.exec(state.sliceDoc(pos - 25, pos));\n    if (!m)\n        return null;\n    let tree = syntaxTree(state).resolveInner(pos, -1);\n    while (tree && !tree.type.isTop) {\n        if (tree.name == \"CodeBlock\" || tree.name == \"FencedCode\" || tree.name == \"ProcessingInstructionBlock\" ||\n            tree.name == \"CommentBlock\" || tree.name == \"Link\" || tree.name == \"Image\")\n            return null;\n        tree = tree.parent;\n    }\n    return {\n        from: pos - m[0].length, to: pos,\n        options: htmlTagCompletions(),\n        validFor: /^<[:\\-\\.\\w\\u00b7-\\uffff]*$/\n    };\n}\nlet _tagCompletions = null;\nfunction htmlTagCompletions() {\n    if (_tagCompletions)\n        return _tagCompletions;\n    let result = htmlCompletionSource(new CompletionContext(EditorState.create({ extensions: htmlNoMatch }), 0, true));\n    return _tagCompletions = result ? result.options : [];\n}\n\nexport { commonmarkLanguage, deleteMarkupBackward, insertNewlineContinueMarkup, markdown, markdownKeymap, markdownLanguage };\n"],"names":["DefaultBufferLength","nextPropID","Range","constructor","from","to","this","NodeProp","config","id","perNode","deserialize","Error","combine","add","match","RangeError","NodeType","type","result","undefined","closedBy","str","split","openedBy","group","isolate","value","contextHash","lookAhead","mounted","MountedTree","tree","overlay","parser","bracketed","get","props","noProps","Object","create","name","flags","define","spec","length","top","skipped","error","src","Array","isArray","prop","isTop","isSkipped","isError","isAnonymous","is","indexOf","map","direct","node","groups","i","found","none","NodeSet","types","extend","newTypes","newProps","source","assign","push","CachedNode","WeakMap","CachedInnerNode","IterMode","Tree","children","positions","toString","ch","test","JSON","stringify","cursor","mode","TreeCursor","topNode","cursorAt","pos","side","scope","moveTo","set","_tree","TreeNode","resolve","resolveNode","resolveInner","resolveStack","inner","layers","scan","context","parent","index","mount","root","iterStack","stackIterator","iterate","enter","leave","anon","IncludeAnonymous","c","entered","firstChild","nextSibling","propValues","balance","balanceRange","makeTree","build","data","_a","buffer","nodeSet","maxBufferLength","reused","minRepeatType","FlatBufferCursor","takeNode","parentStart","minPos","inRepeat","depth","start","end","size","lookAheadAtStart","contextAtStart","next","startPos","findBufferSize","Uint16Array","skip","endPos","copyToBuffer","TreeBuffer","localChildren","localPositions","localInRepeat","lastGroup","lastEnd","makeRepeatLeaf","takeFlatNode","reverse","make","makeBalanced","nodes","nodeCount","stopAt","j","last","lookAheadProp","lastI","base","pop","pair","concat","maxSize","fork","minStart","nodeSize","localSkipped","nodeStart","bufferStart","startIndex","topID","buildTree","empty","childString","join","endIndex","findChild","dir","pick","checkSide","slice","startI","endI","b","copy","len","Math","max","overlays","IgnoreOverlays","BaseNode","getChild","before","after","r","getChildren","matchContext","matchNodeContext","enterUnfinishedNodesBefore","childBefore","lastChild","prevSibling","_parent","super","nextChild","e","EnterBracketed","ExcludeBuffers","BufferNode","BufferContext","hasChild","IgnoreMounts","childAfter","rPos","enterBracketed","nextSignificantParent","val","toTree","cur","p","child","externalSibling","heads","picked","newHeads","splice","StackIterator","stack","bufferNode","yieldNode","n","unshift","yieldBuf","yield","enterChild","sibling","d","atLastNode","move","prev","cache","mustLeave","some","nodeSizeCache","balanceType","mkTop","mkTree","total","maxChild","ceil","divide","offset","groupFrom","groupStart","groupSize","nextSize","only","TreeFragment","openStart","openEnd","open","addTree","fragments","partial","f","applyChanges","changes","minGap","fI","nextF","cI","off","nextC","nextPos","fromA","cut","fFrom","fTo","min","toA","toB","Parser","startParse","input","ranges","StringInput","createParse","parse","done","advance","string","chunk","lineChunks","read","InnerParse","target","checkRanges","ActiveOverlay","predicate","mounts","stoppedInner","MixedParse","nest","innerDone","baseTree","stoppedAt","baseParse","startInner","parsedPos","fragmentCursor","FragmentCursor","covered","isCovered","range","hasNode","find","m","frag","checkCover","materialize","oldMounts","findMounts","punchRanges","enterFragments","sliceBuf","buf","newStack","innerOffset","stackPos","targetI","StructureCursor","FragmentCursor$1","curTo","fragI","first","curFrag","nextFrag","outer","current","gapFrom","gapTo","findCoverChanges","a","iA","iB","inA","inB","nextA","nextB","CompositeBlock","parentHash","hash","hashProp","addChild","Type","LeafBlock","content","marks","parsers","Line","text","baseIndent","basePos","markers","indent","forward","forwardInner","newPos","skipSpace","countIndent","charCodeAt","reset","moveBase","moveBaseColumn","findColumn","addMarker","elt","goal","scrub","skipForList","bl","cx","line","block","OrderedList","isOrderedList","isBulletList","BulletList","isHorizontalRule","DefaultSkipMarkup","Blockquote","QuoteMark","lineStart","space","ListItem","_cx","Document","skipSpaceBack","isFencedCode","isBlockquote","breaking","count","isSetextUnderline","leafBlockParsers","DefaultLeafBlocks","SetextHeading","inList","isAtxHeading","EmptyLine","CommentEnd","ProcessingEnd","HTMLBlockStyle","isHTMLBlock","rest","getListIndent","indentAfter","indented","addCodeText","CodeText","DefaultBlockParsers","LinkReference","IndentedCode","pendingMarks","nextLine","codeStart","filter","addNode","writeElements","finish","CodeBlock","FencedCode","fenceEnd","infoFrom","infoTo","CodeMark","CodeInfo","hasLine","textStart","textEnd","prevLineEnd","startContext","HorizontalRule","newBase","ListMark","ATXHeading","endOfSpace","write","HeaderMark","parseInline","ATXHeading1","HTMLBlock","trailing","nodeType","CommentBlock","ProcessingInstructionBlock","LinkReferenceParser","leaf","stage","elts","complete","addLeafElement","nextStage","parseLinkLabel","LinkMark","title","parseLinkTitle","titleEnd","lineEnd","parseURL","SetextHeadingParser","underline","underlineMark","SetextHeading1","SetextHeading2","_","DefaultEndLeaf","scanLineResult","BlockContext","atEnd","reusePlaceholders","Map","rangeI","absoluteLineStart","absoluteLineEnd","readLine","markI","mark","finishContext","reuseFragment","blockParsers","lines","stop","endLeafBlock","finishLeaf","matches","taken","takeNodes","toRelative","moveRangeI","parentType","peekLine","scanLine","lineChunkAt","textOffset","nextFrom","handler","skipContextMarkup","eol","startComposite","getNodeType","addElement","injectMarks","addGaps","injectGaps","inline","Paragraph","TreeElement","Buffer","dummies","rangeEnd","movePastNext","upto","inclusive","reuse","MarkdownParser","blockNames","inlineParsers","inlineNames","wrappers","nodeTypes","t","w","configure","resolveConfig","nonEmpty","defineNodes","styles","s","composite","style","Tag","styleTags","remove","rm","parseBlock","findName","endLeaf","wrap","InlineContext","char","token","resolveMarkers","conf","conc","wrapA","wrapB","names","Escape","writeTo","Element","startOff","EmphasisUnderscore","EmphasisAsterisk","LinkStart","ImageStart","InlineDelimiter","Escapable","Punctuation","RegExp","DefaultInline","escaped","append","Entity","exec","InlineCode","curSize","HTMLTag","url","Autolink","URL","comment","Comment","procInst","ProcessingInstruction","Emphasis","pBefore","pAfter","sBefore","sAfter","leftFlanking","rightFlanking","canOpen","canClose","HardBreak","Link","Image","LinkEnd","parts","part","takeContent","link","finishLink","dest","label","LinkTitle","requireNonWS","LinkLabel","addDelimiter","close","hasOpenLink","emp","closeSize","k","element","findOpeningDelimiter","getDelimiterAt","elements","eI","linkStart","imageStart","NotLast","fragment","fragmentEnd","nextFragment","fragEnd","blockI","prevEnd","prevI","dummy","abs","markdownHighlighting","tags","quote","contentSeparator","heading1","heading2","heading3","heading4","heading5","heading6","escape","character","emphasis","strong","list","monospace","processingInstruction","labelName","keys","leftOverSpace","parseCode","codeParser","htmlParser","info","infoNode","StrikethroughDelim","Strikethrough","strikethrough","parseRow","cellStart","cellEnd","esc","parseCell","hasPipe","delimiterLine","TableParser","rows","lineText","firstRow","Table","heading","TaskParser","TaskList","atom","autolinkRE","urlRE","lastTwoDomainWords","emailRE","xmppResourceRE","autolinkEmailEnd","lastIndex","GFM","absPos","autolinkURLEnd","parseSubSuper","Superscript","special","Subscript","Emoji","defineLanguageFacet","commentTokens","headingProp","commonmark","foldNodeProp","isHeading","state","doc","lineAt","indentNodeProp","languageDataProp","findSectionEnd","headerNode","level","headerIndent","foldService","of","syntaxTree","mkLang","Language","commonmarkLanguage","markdownLanguage","Context","spaceBefore","spaceAfter","item","blank","maxWidth","marker","number","String","itemNumber","getContext","replace","sliceString","renumberList","insert","normalizeIndent","facet","indentUnit","countColumn","insertNewlineContinueMarkup","dispatch","dont","changeByRange","isActiveAt","emptyLine","delTo","EditorSelection","lineBreak","prevLine","quoted","continued","charAt","update","scrollIntoView","userEvent","isMark","deleteMarkupBackward","contextNodeForDelete","spaceEnd","markdownKeymap","key","run","htmlNoMatch","html","matchClosingTags","markdown","codeLanguages","defaultCodeLanguage","addKeymap","completeHTMLTags","defaultCode","extensions","support","LanguageSupport","language","languages","defaultLanguage","LanguageDescription","matchLanguageName","ParseContext","getSkippingParser","load","Prec","high","keymap","lang","autocomplete","htmlTagCompletion","sliceDoc","options","htmlTagCompletions","validFor","_tagCompletions","htmlCompletionSource","CompletionContext","EditorState"],"mappings":"2MAGA,MAAMA,EAAsB,KAC5B,IAAIC,EAAa,EACjB,MAAMC,EACF,WAAAC,CAAYC,EAAMC,GACdC,KAAKF,KAAOA,EACZE,KAAKD,GAAKA,CACd,EAOJ,MAAME,EAIF,WAAAJ,CAAYK,EAAS,IACjBF,KAAKG,GAAKR,IACVK,KAAKI,UAAYF,EAAOE,QACxBJ,KAAKK,YAAcH,EAAOG,mBACtB,MAAM,IAAIC,MAAM,uDACnB,GACDN,KAAKO,QAAUL,EAAOK,SAAW,IACrC,CAUA,GAAAC,CAAIC,GACA,GAAIT,KAAKI,QACL,MAAM,IAAIM,WAAW,0CAGzB,MAFoB,mBAATD,IACPA,EAAQE,EAASF,MAAMA,IACnBG,IACJ,IAAIC,EAASJ,EAAMG,GACnB,YAAkBE,IAAXD,EAAuB,KAAO,CAACb,KAAMa,GAEpD,EAQJZ,EAASc,SAAW,IAAId,EAAS,CAAEI,YAAaW,GAAOA,EAAIC,MAAM,OAMjEhB,EAASiB,SAAW,IAAIjB,EAAS,CAAEI,YAAaW,GAAOA,EAAIC,MAAM,OAMjEhB,EAASkB,MAAQ,IAAIlB,EAAS,CAAEI,YAAaW,GAAOA,EAAIC,MAAM,OAY9DhB,EAASmB,QAAU,IAAInB,EAAS,CAAEI,YAAagB,IACvC,GAAIA,GAAkB,OAATA,GAA2B,OAATA,GAA2B,QAATA,EAC7C,MAAM,IAAIX,WAAW,8BAAgCW,GACzD,OAAOA,GAAS,UAOxBpB,EAASqB,YAAc,IAAIrB,EAAS,CAAEG,SAAS,IAO/CH,EAASsB,UAAY,IAAItB,EAAS,CAAEG,SAAS,IAM7CH,EAASuB,QAAU,IAAIvB,EAAS,CAAEG,SAAS,IAM3C,MAAMqB,EACF,WAAA5B,CAIA6B,EAUAC,EAIAC,EAMAC,GAAY,GACR7B,KAAK0B,KAAOA,EACZ1B,KAAK2B,QAAUA,EACf3B,KAAK4B,OAASA,EACd5B,KAAK6B,UAAYA,CACrB,CAIA,UAAOC,CAAIJ,GACP,OAAOA,GAAQA,EAAKK,OAASL,EAAKK,MAAM9B,EAASuB,QAAQrB,GAC7D,EAEJ,MAAM6B,EAAUC,OAAOC,OAAO,MAI9B,MAAMvB,EAIF,WAAAd,CAOAsC,EAIAJ,EAKA5B,EAIAiC,EAAQ,GACJpC,KAAKmC,KAAOA,EACZnC,KAAK+B,MAAQA,EACb/B,KAAKG,GAAKA,EACVH,KAAKoC,MAAQA,CACjB,CAIA,aAAOC,CAAOC,GACV,IAAIP,EAAQO,EAAKP,OAASO,EAAKP,MAAMQ,OAASN,OAAOC,OAAO,MAAQF,EAChEI,GAASE,EAAKE,IAAM,EAAuB,IAAMF,EAAKG,QAAU,EAA2B,IAC1FH,EAAKI,MAAQ,EAAyB,IAAmB,MAAbJ,EAAKH,KAAe,EAA6B,GAC9FvB,EAAO,IAAID,EAAS2B,EAAKH,MAAQ,GAAIJ,EAAOO,EAAKnC,GAAIiC,GACzD,GAAIE,EAAKP,MACL,IAAK,IAAIY,KAAOL,EAAKP,MAGjB,GAFKa,MAAMC,QAAQF,KACfA,EAAMA,EAAI/B,IACV+B,EAAK,CACL,GAAIA,EAAI,GAAGvC,QACP,MAAM,IAAIM,WAAW,8CACzBqB,EAAMY,EAAI,GAAGxC,IAAMwC,EAAI,EAC3B,CAER,OAAO/B,CACX,CAKA,IAAAkC,CAAKA,GAAQ,OAAO9C,KAAK+B,MAAMe,EAAK3C,GAAK,CAIzC,SAAI4C,GAAU,OAAqB,EAAb/C,KAAKoC,OAAgC,CAAG,CAI9D,aAAIY,GAAc,OAAqB,EAAbhD,KAAKoC,OAAoC,CAAG,CAItE,WAAIa,GAAY,OAAqB,EAAbjD,KAAKoC,OAAkC,CAAG,CAKlE,eAAIc,GAAgB,OAAqB,EAAblD,KAAKoC,OAAsC,CAAG,CAK1E,EAAAe,CAAGhB,GACC,GAAmB,iBAARA,EAAkB,CACzB,GAAInC,KAAKmC,MAAQA,EACb,OAAO,EACX,IAAIhB,EAAQnB,KAAK8C,KAAK7C,EAASkB,OAC/B,QAAOA,GAAQA,EAAMiC,QAAQjB,IAAQ,CACzC,CACA,OAAOnC,KAAKG,IAAMgC,CACtB,CASA,YAAO1B,CAAM4C,GACT,IAAIC,EAASrB,OAAOC,OAAO,MAC3B,IAAK,IAAIY,KAAQO,EACb,IAAK,IAAIlB,KAAQW,EAAK7B,MAAM,KACxBqC,EAAOnB,GAAQkB,EAAIP,GAC3B,OAAQS,IACJ,IAAK,IAAIC,EAASD,EAAKT,KAAK7C,EAASkB,OAAQsC,GAAI,EAAIA,GAAKD,EAASA,EAAOjB,OAAS,GAAIkB,IAAK,CACxF,IAAIC,EAAQJ,EAAOG,EAAI,EAAIF,EAAKpB,KAAOqB,EAAOC,IAC9C,GAAIC,EACA,OAAOA,CACf,EAER,EAKJ/C,EAASgD,KAAO,IAAIhD,EAAS,GAAIsB,OAAOC,OAAO,MAAO,EAAG,GAUzD,MAAM0B,EAKF,WAAA/D,CAIAgE,GACI7D,KAAK6D,MAAQA,EACb,IAAK,IAAIJ,EAAI,EAAGA,EAAII,EAAMtB,OAAQkB,IAC9B,GAAII,EAAMJ,GAAGtD,IAAMsD,EACf,MAAM,IAAI/C,WAAW,8EACjC,CAMA,MAAAoD,IAAU/B,GACN,IAAIgC,EAAW,GACf,IAAK,IAAInD,KAAQZ,KAAK6D,MAAO,CACzB,IAAIG,EAAW,KACf,IAAK,IAAIC,KAAUlC,EAAO,CACtB,IAAIvB,EAAMyD,EAAOrD,GACjB,GAAIJ,EAAK,CACAwD,IACDA,EAAW/B,OAAOiC,OAAO,CAAA,EAAItD,EAAKmB,QACtC,IAAIV,EAAQb,EAAI,GAAIsC,EAAOtC,EAAI,GAC3BsC,EAAKvC,SAAWuC,EAAK3C,MAAM6D,IAC3B3C,EAAQyB,EAAKvC,QAAQyD,EAASlB,EAAK3C,IAAKkB,IAC5C2C,EAASlB,EAAK3C,IAAMkB,CACxB,CACJ,CACA0C,EAASI,KAAKH,EAAW,IAAIrD,EAASC,EAAKuB,KAAM6B,EAAUpD,EAAKT,GAAIS,EAAKwB,OAASxB,EACtF,CACA,OAAO,IAAIgD,EAAQG,EACvB,EAEJ,MAAMK,EAAa,IAAIC,QAAWC,EAAkB,IAAID,QAKxD,IAAIE,GACJ,SAAWA,GAMPA,EAASA,EAAyB,eAAI,GAAK,iBAM3CA,EAASA,EAA2B,iBAAI,GAAK,mBAM7CA,EAASA,EAAuB,aAAI,GAAK,eAOzCA,EAASA,EAAyB,eAAI,GAAK,iBAO3CA,EAASA,EAAyB,eAAI,IAAM,gBAC/C,CAjCD,CAiCGA,IAAaA,EAAW,CAAA,IAiB3B,MAAMC,EAIF,WAAA3E,CAIAe,EAIA6D,EAKAC,EAIAnC,EAIAR,GASI,GARA/B,KAAKY,KAAOA,EACZZ,KAAKyE,SAAWA,EAChBzE,KAAK0E,UAAYA,EACjB1E,KAAKuC,OAASA,EAIdvC,KAAK+B,MAAQ,KACTA,GAASA,EAAMQ,OAAQ,CACvBvC,KAAK+B,MAAQE,OAAOC,OAAO,MAC3B,IAAK,IAAKY,EAAMzB,KAAUU,EACtB/B,KAAK+B,MAAqB,iBAARe,EAAmBA,EAAOA,EAAK3C,IAAMkB,CAC/D,CACJ,CAIA,QAAAsD,GACI,IAAInD,EAAUC,EAAYK,IAAI9B,MAC9B,GAAIwB,IAAYA,EAAQG,QACpB,OAAOH,EAAQE,KAAKiD,WACxB,IAAIF,EAAW,GACf,IAAK,IAAIG,KAAM5E,KAAKyE,SAAU,CAC1B,IAAIzD,EAAM4D,EAAGD,WACT3D,IACIyD,IACAA,GAAY,KAChBA,GAAYzD,EAEpB,CACA,OAAQhB,KAAKY,KAAKuB,MACb,KAAK0C,KAAK7E,KAAKY,KAAKuB,QAAUnC,KAAKY,KAAKqC,QAAU6B,KAAKC,UAAU/E,KAAKY,KAAKuB,MAAQnC,KAAKY,KAAKuB,OACzFsC,EAASlC,OAAS,IAAMkC,EAAW,IAAM,IAFzBA,CAG7B,CAMA,MAAAO,CAAOC,EAAO,GACV,OAAO,IAAIC,EAAWlF,KAAKmF,QAASF,EACxC,CAMA,QAAAG,CAASC,EAAKC,EAAO,EAAGL,EAAO,GAC3B,IAAIM,EAAQnB,EAAWtC,IAAI9B,OAASA,KAAKmF,QACrCH,EAAS,IAAIE,EAAWK,GAG5B,OAFAP,EAAOQ,OAAOH,EAAKC,GACnBlB,EAAWqB,IAAIzF,KAAMgF,EAAOU,OACrBV,CACX,CAKA,WAAIG,GACA,OAAO,IAAIQ,EAAS3F,KAAM,EAAG,EAAG,KACpC,CAYA,OAAA4F,CAAQP,EAAKC,EAAO,GAChB,IAAI/B,EAAOsC,EAAYzB,EAAWtC,IAAI9B,OAASA,KAAKmF,QAASE,EAAKC,GAAM,GAExE,OADAlB,EAAWqB,IAAIzF,KAAMuD,GACdA,CACX,CAQA,YAAAuC,CAAaT,EAAKC,EAAO,GACrB,IAAI/B,EAAOsC,EAAYvB,EAAgBxC,IAAI9B,OAASA,KAAKmF,QAASE,EAAKC,GAAM,GAE7E,OADAhB,EAAgBmB,IAAIzF,KAAMuD,GACnBA,CACX,CAQA,YAAAwC,CAAaV,EAAKC,EAAO,GACrB,OA6cR,SAAuB5D,EAAM2D,EAAKC,GAC9B,IAAIU,EAAQtE,EAAKoE,aAAaT,EAAKC,GAAOW,EAAS,KACnD,IAAK,IAAIC,EAAOF,aAAiBL,EAAWK,EAAQA,EAAMG,QAAQC,OAAQF,EAAMA,EAAOA,EAAKE,OACxF,GAAIF,EAAKG,MAAQ,EAAG,CAChB,IAAID,EAASF,EAAKE,QACjBH,IAAWA,EAAS,CAACD,KAAS7B,KAAKiC,EAAOR,QAAQP,EAAKC,IACxDY,EAAOE,CACX,KACK,CACD,IAAIE,EAAQ7E,EAAYK,IAAIoE,EAAKxE,MAEjC,GAAI4E,GAASA,EAAM3E,SAAW2E,EAAM3E,QAAQ,GAAG7B,MAAQuF,GAAOiB,EAAM3E,QAAQ2E,EAAM3E,QAAQY,OAAS,GAAGxC,IAAMsF,EAAK,CAC7G,IAAIkB,EAAO,IAAIZ,EAASW,EAAM5E,KAAM4E,EAAM3E,QAAQ,GAAG7B,KAAOoG,EAAKpG,MAAM,EAAIoG,IAC1ED,IAAWA,EAAS,CAACD,KAAS7B,KAAK0B,EAAYU,EAAMlB,EAAKC,GAAM,GACrE,CACJ,CAEJ,OAAOW,EAASO,EAAUP,GAAUD,CACxC,CA/deS,CAAczG,KAAMqF,EAAKC,EACpC,CAQA,OAAAoB,CAAQpE,GACJ,IAAIqE,MAAEA,EAAKC,MAAEA,EAAK9G,KAAEA,EAAO,EAACC,GAAEA,EAAKC,KAAKuC,QAAWD,EAC/C2C,EAAO3C,EAAK2C,MAAQ,EAAG4B,GAAQ5B,EAAOV,EAASuC,kBAAoB,EACvE,IAAK,IAAIC,EAAI/G,KAAKgF,OAAOC,EAAOV,EAASuC,oBAAqB,CAC1D,IAAIE,GAAU,EACd,GAAID,EAAEjH,MAAQC,GAAMgH,EAAEhH,IAAMD,KAAU+G,GAAQE,EAAEnG,KAAKsC,cAA4B,IAAbyD,EAAMI,IAAe,CACrF,GAAIA,EAAEE,aACF,SACJD,GAAU,CACd,CACA,KACQA,GAAWJ,IAAUC,IAASE,EAAEnG,KAAKsC,cACrC0D,EAAMG,IACNA,EAAEG,eAHD,CAKL,IAAKH,EAAEX,SACH,OACJY,GAAU,CACd,CACJ,CACJ,CAKA,IAAAlE,CAAKA,GACD,OAAQA,EAAK1C,QAAiCJ,KAAK+B,MAAQ/B,KAAK+B,MAAMe,EAAK3C,SAAMW,EAA1Dd,KAAKY,KAAKkC,KAAKA,EAC1C,CAMA,cAAIqE,GACA,IAAItG,EAAS,GACb,GAAIb,KAAK+B,MACL,IAAK,IAAI5B,KAAMH,KAAK+B,MAChBlB,EAAOsD,KAAK,EAAEhE,EAAIH,KAAK+B,MAAM5B,KACrC,OAAOU,CACX,CAMA,OAAAuG,CAAQlH,EAAS,IACb,OAAOF,KAAKyE,SAASlC,QAAU,EAA+BvC,KAC1DqH,EAAa1G,EAASgD,KAAM3D,KAAKyE,SAAUzE,KAAK0E,UAAW,EAAG1E,KAAKyE,SAASlC,OAAQ,EAAGvC,KAAKuC,OAAQ,CAACkC,EAAUC,EAAWnC,IAAW,IAAIiC,EAAKxE,KAAKY,KAAM6D,EAAUC,EAAWnC,EAAQvC,KAAKmH,YAAajH,EAAOoH,YAAc7C,EAAUC,EAAWnC,IAAW,IAAIiC,EAAK7D,EAASgD,KAAMc,EAAUC,EAAWnC,IAClT,CAKA,YAAOgF,CAAMC,GAAQ,OA6tBzB,SAAmBA,GACf,IAAIC,EACJ,IAAIC,OAAEA,EAAMC,QAAEA,EAAOC,gBAAEA,EAAkBlI,EAAmBmI,OAAEA,EAAS,GAAEC,cAAEA,EAAgBH,EAAQ9D,MAAMtB,QAAWiF,EAChHxC,EAASpC,MAAMC,QAAQ6E,GAAU,IAAIK,EAAiBL,EAAQA,EAAOnF,QAAUmF,EAC/E7D,EAAQ8D,EAAQ9D,MAChBvC,EAAc,EAAGC,EAAY,EACjC,SAASyG,EAASC,EAAaC,EAAQzD,EAAUC,EAAWyD,EAAUC,GAClE,IAAIjI,GAAEA,EAAEkI,MAAEA,EAAKC,IAAEA,EAAGC,KAAEA,GAASvD,EAC3BwD,EAAmBjH,EAAWkH,EAAiBnH,EACnD,GAAIiH,EAAO,EAAG,CAEV,GADAvD,EAAO0D,QACK,GAARH,EAAsC,CACtC,IAAIhF,EAAOsE,EAAO1H,GAGlB,OAFAsE,EAASN,KAAKZ,QACdmB,EAAUP,KAAKkE,EAAQJ,EAE3B,CACK,IAAY,GAARM,EAEL,YADAjH,EAAcnB,GAGb,IAAY,GAARoI,EAEL,YADAhH,EAAYpB,GAIZ,MAAM,IAAIO,WAAW,6BAA6B6H,IAE1D,CACA,IAAsBhF,EAAMmE,EAAxB9G,EAAOiD,EAAM1D,GACbwI,EAAWN,EAAQJ,EACvB,GAAIK,EAAMD,GAAST,IAAoBF,EAASkB,EAAe5D,EAAOK,IAAM6C,EAAQC,IAAY,CAE5F,IAAIX,EAAO,IAAIqB,YAAYnB,EAAOa,KAAOb,EAAOoB,MAC5CC,EAAS/D,EAAOK,IAAMqC,EAAOa,KAAMlC,EAAQmB,EAAKjF,OACpD,KAAOyC,EAAOK,IAAM0D,GAChB1C,EAAQ2C,EAAatB,EAAOW,MAAOb,EAAMnB,GAC7C9C,EAAO,IAAI0F,EAAWzB,EAAMc,EAAMZ,EAAOW,MAAOV,GAChDgB,EAAWjB,EAAOW,MAAQJ,CAC9B,KACK,CACD,IAAIc,EAAS/D,EAAOK,IAAMkD,EAC1BvD,EAAO0D,OACP,IAAIQ,EAAgB,GAAIC,EAAiB,GACrCC,EAAgBjJ,GAAM2H,EAAgB3H,GAAK,EAC3CkJ,EAAY,EAAGC,EAAUhB,EAC7B,KAAOtD,EAAOK,IAAM0D,GACZK,GAAiB,GAAKpE,EAAO7E,IAAMiJ,GAAiBpE,EAAOuD,MAAQ,GAC/DvD,EAAOsD,KAAOgB,EAAU1B,IACxB2B,EAAeL,EAAeC,EAAgBd,EAAOgB,EAAWrE,EAAOsD,IAAKgB,EAASF,EAAeZ,EAAkBC,GACtHY,EAAYH,EAAc3G,OAC1B+G,EAAUtE,EAAOsD,KAErBtD,EAAO0D,QAEFN,EAAQ,KACboB,EAAanB,EAAOU,EAAQG,EAAeC,GAG3CnB,EAASK,EAAOU,EAAQG,EAAeC,EAAgBC,EAAehB,EAAQ,GAOtF,GAJIgB,GAAiB,GAAKC,EAAY,GAAKA,EAAYH,EAAc3G,QACjEgH,EAAeL,EAAeC,EAAgBd,EAAOgB,EAAWhB,EAAOiB,EAASF,EAAeZ,EAAkBC,GACrHS,EAAcO,UACdN,EAAeM,UACXL,GAAgB,GAAMC,EAAY,EAAG,CACrC,IAAIK,EAAOC,EAAa/I,EAAM6H,GAC9BlF,EAAO8D,EAAazG,EAAMsI,EAAeC,EAAgB,EAAGD,EAAc3G,OAAQ,EAAG+F,EAAMD,EAAOqB,EAAMA,EAC5G,MAEInG,EAAO+D,EAAS1G,EAAMsI,EAAeC,EAAgBb,EAAMD,EAAOG,EAAmBF,EAAKG,EAElG,CACAhE,EAASN,KAAKZ,GACdmB,EAAUP,KAAKwE,EACnB,CACA,SAASa,EAAavB,EAAaC,EAAQzD,EAAUC,GACjD,IAAIkF,EAAQ,GACRC,EAAY,EAAGC,GAAS,EAC5B,KAAO9E,EAAOK,IAAM6C,GAAQ,CACxB,IAAI/H,GAAEA,EAAEkI,MAAEA,EAAKC,IAAEA,EAAGC,KAAEA,GAASvD,EAC/B,GAAIuD,EAAO,EACPvD,EAAO0D,WAEN,IAAIoB,GAAS,GAAMzB,EAAQyB,EAC5B,MAGIA,EAAS,IACTA,EAASxB,EAAMV,GACnBgC,EAAMzF,KAAKhE,EAAIkI,EAAOC,GACtBuB,IACA7E,EAAO0D,MACX,CACJ,CACA,GAAImB,EAAW,CACX,IAAInC,EAAS,IAAImB,YAAwB,EAAZgB,GACzBxB,EAAQuB,EAAMA,EAAMrH,OAAS,GACjC,IAAK,IAAIkB,EAAImG,EAAMrH,OAAS,EAAGwH,EAAI,EAAGtG,GAAK,EAAGA,GAAK,EAC/CiE,EAAOqC,KAAOH,EAAMnG,GACpBiE,EAAOqC,KAAOH,EAAMnG,EAAI,GAAK4E,EAC7BX,EAAOqC,KAAOH,EAAMnG,EAAI,GAAK4E,EAC7BX,EAAOqC,KAAOA,EAElBtF,EAASN,KAAK,IAAI8E,EAAWvB,EAAQkC,EAAM,GAAKvB,EAAOV,IACvDjD,EAAUP,KAAKkE,EAAQJ,EAC3B,CACJ,CACA,SAAS0B,EAAa/I,EAAMU,GACxB,MAAO,CAACmD,EAAUC,EAAWnC,KACzB,IAAgDyH,EAAMC,EAAlD1I,EAAY,EAAG2I,EAAQzF,EAASlC,OAAS,EAC7C,GAAI2H,GAAS,IAAMF,EAAOvF,EAASyF,cAAmB1F,EAAM,CACxD,IAAK0F,GAASF,EAAKpJ,MAAQA,GAAQoJ,EAAKzH,QAAUA,EAC9C,OAAOyH,GACPC,EAAgBD,EAAKlH,KAAK7C,EAASsB,cACnCA,EAAYmD,EAAUwF,GAASF,EAAKzH,OAAS0H,EACrD,CACA,OAAO3C,EAAS1G,EAAM6D,EAAUC,EAAWnC,EAAQhB,EAAWD,GAEtE,CACA,SAASiI,EAAe9E,EAAUC,EAAWyF,EAAM1G,EAAG3D,EAAMC,EAAIa,EAAMW,EAAWD,GAC7E,IAAI4H,EAAgB,GAAIC,EAAiB,GACzC,KAAO1E,EAASlC,OAASkB,GACrByF,EAAc/E,KAAKM,EAAS2F,OAC5BjB,EAAehF,KAAKO,EAAU0F,MAAQD,EAAOrK,GAEjD2E,EAASN,KAAKmD,EAASK,EAAQ9D,MAAMjD,GAAOsI,EAAeC,EAAgBpJ,EAAKD,EAAMyB,EAAYxB,EAAIuB,IACtGoD,EAAUP,KAAKrE,EAAOqK,EAC1B,CACA,SAAS7C,EAAS1G,EAAM6D,EAAUC,EAAWnC,EAAQhB,EAAWD,EAAaS,GACzE,GAAIT,EAAa,CACb,IAAI+I,EAAO,CAACpK,EAASqB,YAAaA,GAClCS,EAAQA,EAAQ,CAACsI,GAAMC,OAAOvI,GAAS,CAACsI,EAC5C,CACA,GAAI9I,EAAY,GAAI,CAChB,IAAI8I,EAAO,CAACpK,EAASsB,UAAWA,GAChCQ,EAAQA,EAAQ,CAACsI,GAAMC,OAAOvI,GAAS,CAACsI,EAC5C,CACA,OAAO,IAAI7F,EAAK5D,EAAM6D,EAAUC,EAAWnC,EAAQR,EACvD,CACA,SAAS6G,EAAe2B,EAASpC,GAO7B,IAAIqC,EAAOxF,EAAOwF,OACdjC,EAAO,EAAGF,EAAQ,EAAGS,EAAO,EAAG2B,EAAWD,EAAKlC,IAAMV,EACrD/G,EAAS,CAAE0H,KAAM,EAAGF,MAAO,EAAGS,KAAM,GACxC5C,EAAM,IAAK,IAAIgC,EAASsC,EAAKnF,IAAMkF,EAASC,EAAKnF,IAAM6C,GAAS,CAC5D,IAAIwC,EAAWF,EAAKjC,KAEpB,GAAIiC,EAAKrK,IAAMgI,GAAYuC,GAAY,EAAG,CAGtC7J,EAAO0H,KAAOA,EACd1H,EAAOwH,MAAQA,EACfxH,EAAOiI,KAAOA,EACdA,GAAQ,EACRP,GAAQ,EACRiC,EAAK9B,OACL,QACJ,CACA,IAAIC,EAAW6B,EAAKnF,IAAMqF,EAC1B,GAAIA,EAAW,GAAK/B,EAAWT,GAAUsC,EAAKnC,MAAQoC,EAClD,MACJ,IAAIE,EAAeH,EAAKrK,IAAM2H,EAAgB,EAAI,EAC9C8C,EAAYJ,EAAKnC,MAErB,IADAmC,EAAK9B,OACE8B,EAAKnF,IAAMsD,GAAU,CACxB,GAAI6B,EAAKjC,KAAO,EAAG,CACf,IAAiB,GAAbiC,EAAKjC,OAA6D,GAAbiC,EAAKjC,KAG1D,MAAMrC,EAFNyE,GAAgB,CAGxB,MACSH,EAAKrK,IAAM2H,IAChB6C,GAAgB,GAEpBH,EAAK9B,MACT,CACAL,EAAQuC,EACRrC,GAAQmC,EACR5B,GAAQ6B,CACZ,CAMA,OALIxC,EAAW,GAAKI,GAAQgC,KACxB1J,EAAO0H,KAAOA,EACd1H,EAAOwH,MAAQA,EACfxH,EAAOiI,KAAOA,GAEXjI,EAAO0H,KAAO,EAAI1H,OAASC,CACtC,CACA,SAASkI,EAAa6B,EAAanD,EAAQrB,GACvC,IAAIlG,GAAEA,EAAEkI,MAAEA,EAAKC,IAAEA,EAAGC,KAAEA,GAASvD,EAE/B,GADAA,EAAO0D,OACHH,GAAQ,GAAKpI,EAAK2H,EAAe,CACjC,IAAIgD,EAAazE,EACjB,GAAIkC,EAAO,EAAG,CACV,IAAIQ,EAAS/D,EAAOK,KAAOkD,EAAO,GAClC,KAAOvD,EAAOK,IAAM0D,GAChB1C,EAAQ2C,EAAa6B,EAAanD,EAAQrB,EAClD,CACAqB,IAASrB,GAASyE,EAClBpD,IAASrB,GAASiC,EAAMuC,EACxBnD,IAASrB,GAASgC,EAAQwC,EAC1BnD,IAASrB,GAASlG,CACtB,MACiB,GAARoI,EACLjH,EAAcnB,GAED,GAARoI,IACLhH,EAAYpB,GAEhB,OAAOkG,CACX,CACA,IAAI5B,EAAW,GAAIC,EAAY,GAC/B,KAAOM,EAAOK,IAAM,GAChB2C,EAASR,EAAKa,OAAS,EAAGb,EAAKqD,aAAe,EAAGpG,EAAUC,GAAW,EAAI,GAC9E,IAAInC,EAAgC,QAAtBkF,EAAKD,EAAKjF,kBAAoBkF,EAAgBA,EAAMhD,EAASlC,OAASmC,EAAU,GAAKD,EAAS,GAAGlC,OAAS,EACxH,OAAO,IAAIiC,EAAKX,EAAM2D,EAAKuD,OAAQtG,EAASgF,UAAW/E,EAAU+E,UAAWlH,EAChF,CA37BgCyI,CAAUxD,EAAO,EAKjDhD,EAAKyG,MAAQ,IAAIzG,EAAK7D,EAASgD,KAAM,GAAI,GAAI,GAC7C,MAAMoE,EACF,WAAAlI,CAAY6H,EAAQrB,GAChBrG,KAAK0H,OAASA,EACd1H,KAAKqG,MAAQA,CACjB,CACA,MAAIlG,GAAO,OAAOH,KAAK0H,OAAO1H,KAAKqG,MAAQ,EAAI,CAC/C,SAAIgC,GAAU,OAAOrI,KAAK0H,OAAO1H,KAAKqG,MAAQ,EAAI,CAClD,OAAIiC,GAAQ,OAAOtI,KAAK0H,OAAO1H,KAAKqG,MAAQ,EAAI,CAChD,QAAIkC,GAAS,OAAOvI,KAAK0H,OAAO1H,KAAKqG,MAAQ,EAAI,CACjD,OAAIhB,GAAQ,OAAOrF,KAAKqG,KAAO,CAC/B,IAAAqC,GAAS1I,KAAKqG,OAAS,CAAG,CAC1B,IAAAmE,GAAS,OAAO,IAAIzC,EAAiB/H,KAAK0H,OAAQ1H,KAAKqG,MAAQ,EAQnE,MAAM4C,EAIF,WAAApJ,CAIA6H,EAIAnF,EAIAkD,GACIzF,KAAK0H,OAASA,EACd1H,KAAKuC,OAASA,EACdvC,KAAKyF,IAAMA,CACf,CAIA,QAAI7E,GAAS,OAAOD,EAASgD,IAAM,CAInC,QAAAgB,GACI,IAAI9D,EAAS,GACb,IAAK,IAAIwF,EAAQ,EAAGA,EAAQrG,KAAK0H,OAAOnF,QACpC1B,EAAOsD,KAAKnE,KAAKkL,YAAY7E,IAC7BA,EAAQrG,KAAK0H,OAAOrB,EAAQ,GAEhC,OAAOxF,EAAOsK,KAAK,IACvB,CAIA,WAAAD,CAAY7E,GACR,IAAIlG,EAAKH,KAAK0H,OAAOrB,GAAQ+E,EAAWpL,KAAK0H,OAAOrB,EAAQ,GACxDzF,EAAOZ,KAAKyF,IAAI5B,MAAM1D,GAAKU,EAASD,EAAKuB,KAI7C,GAHI,KAAK0C,KAAKhE,KAAYD,EAAKqC,UAC3BpC,EAASiE,KAAKC,UAAUlE,IAExBuK,IADJ/E,GAAS,GAEL,OAAOxF,EACX,IAAI4D,EAAW,GACf,KAAO4B,EAAQ+E,GACX3G,EAASN,KAAKnE,KAAKkL,YAAY7E,IAC/BA,EAAQrG,KAAK0H,OAAOrB,EAAQ,GAEhC,OAAOxF,EAAS,IAAM4D,EAAS0G,KAAK,KAAO,GAC/C,CAIA,SAAAE,CAAUP,EAAYM,EAAUE,EAAKjG,EAAKC,GACtC,IAAIoC,OAAEA,GAAW1H,KAAMuL,GAAO,EAC9B,IAAK,IAAI9H,EAAIqH,EAAYrH,GAAK2H,KACtBI,EAAUlG,EAAMD,EAAKqC,EAAOjE,EAAI,GAAIiE,EAAOjE,EAAI,MAC/C8H,EAAO9H,EACH6H,EAAM,IAHsB7H,EAAIiE,EAAOjE,EAAI,IAOvD,OAAO8H,CACX,CAIA,KAAAE,CAAMC,EAAQC,EAAM7L,GAChB,IAAI8L,EAAI5L,KAAK0H,OACTmE,EAAO,IAAIhD,YAAY8C,EAAOD,GAASI,EAAM,EACjD,IAAK,IAAIrI,EAAIiI,EAAQ3B,EAAI,EAAGtG,EAAIkI,GAAO,CACnCE,EAAK9B,KAAO6B,EAAEnI,KACdoI,EAAK9B,KAAO6B,EAAEnI,KAAO3D,EACrB,IAAIC,EAAK8L,EAAK9B,KAAO6B,EAAEnI,KAAO3D,EAC9B+L,EAAK9B,KAAO6B,EAAEnI,KAAOiI,EACrBI,EAAMC,KAAKC,IAAIF,EAAK/L,EACxB,CACA,OAAO,IAAIkJ,EAAW4C,EAAMC,EAAK9L,KAAKyF,IAC1C,EAEJ,SAAS+F,EAAUlG,EAAMD,EAAKvF,EAAMC,GAChC,OAAQuF,GACJ,KAAK,EAAsB,OAAOxF,EAAOuF,EACzC,KAAK,EAA0B,OAAOtF,GAAMsF,GAAOvF,EAAOuF,EAC1D,KAAK,EAAqB,OAAOvF,EAAOuF,GAAOtF,EAAKsF,EACpD,KAAK,EAAwB,OAAOvF,GAAQuF,GAAOtF,EAAKsF,EACxD,KAAK,EAAoB,OAAOtF,EAAKsF,EACrC,KAAK,EAAuB,OAAO,EAE3C,CACA,SAASQ,EAAYtC,EAAM8B,EAAKC,EAAM2G,GAGlC,IAFA,IAAIxE,EAEGlE,EAAKzD,MAAQyD,EAAKxD,KACpBuF,EAAO,EAAI/B,EAAKzD,MAAQuF,EAAM9B,EAAKzD,KAAOuF,KAC1CC,GAAO,EAAK/B,EAAKxD,IAAMsF,EAAM9B,EAAKxD,GAAKsF,IAAM,CAC9C,IAAIe,GAAU6F,GAAY1I,aAAgBoC,GAAYpC,EAAK8C,MAAQ,EAAI,KAAO9C,EAAK6C,OACnF,IAAKA,EACD,OAAO7C,EACXA,EAAO6C,CACX,CACA,IAAInB,EAAOgH,EAAW,EAAI1H,EAAS2H,eAEnC,GAAID,EACA,IAAK,IAAI/F,EAAO3C,EAAM6C,EAASF,EAAKE,OAAQA,EAAQF,EAAOE,EAAQA,EAASF,EAAKE,OACzEF,aAAgBP,GAAYO,EAAKG,MAAQ,IAA+C,QAAxCoB,EAAKrB,EAAOO,MAAMtB,EAAKC,EAAML,UAA0B,IAAPwC,OAAgB,EAASA,EAAG3H,OAASoG,EAAKpG,OAC1IyD,EAAO6C,GAEnB,OAAS,CACL,IAAIJ,EAAQzC,EAAKoD,MAAMtB,EAAKC,EAAML,GAClC,IAAKe,EACD,OAAOzC,EACXA,EAAOyC,CACX,CACJ,CACA,MAAMmG,EACF,MAAAnH,CAAOC,EAAO,GAAK,OAAO,IAAIC,EAAWlF,KAAMiF,EAAO,CACtD,QAAAmH,CAASxL,EAAMyL,EAAS,KAAMC,EAAQ,MAClC,IAAIC,EAAIC,EAAYxM,KAAMY,EAAMyL,EAAQC,GACxC,OAAOC,EAAEhK,OAASgK,EAAE,GAAK,IAC7B,CACA,WAAAC,CAAY5L,EAAMyL,EAAS,KAAMC,EAAQ,MACrC,OAAOE,EAAYxM,KAAMY,EAAMyL,EAAQC,EAC3C,CACA,OAAA1G,CAAQP,EAAKC,EAAO,GAChB,OAAOO,EAAY7F,KAAMqF,EAAKC,GAAM,EACxC,CACA,YAAAQ,CAAaT,EAAKC,EAAO,GACrB,OAAOO,EAAY7F,KAAMqF,EAAKC,GAAM,EACxC,CACA,YAAAmH,CAAatG,GACT,OAAOuG,EAAiB1M,KAAKoG,OAAQD,EACzC,CACA,0BAAAwG,CAA2BtH,GACvB,IAAIa,EAAOlG,KAAK4M,YAAYvH,GAAM9B,EAAOvD,KACzC,KAAOkG,GAAM,CACT,IAAI8D,EAAO9D,EAAK2G,UAChB,IAAK7C,GAAQA,EAAKjK,IAAMmG,EAAKnG,GACzB,MACAiK,EAAKpJ,KAAKqC,SAAW+G,EAAKlK,MAAQkK,EAAKjK,IACvCwD,EAAO2C,EACPA,EAAO8D,EAAK8C,aAGZ5G,EAAO8D,CAEf,CACA,OAAOzG,CACX,CACA,QAAIA,GAAS,OAAOvD,IAAM,CAC1B,QAAI0I,GAAS,OAAO1I,KAAKoG,MAAQ,EAErC,MAAMT,UAAiBwG,EACnB,WAAAtM,CAAY6F,EAAO5F,EAEnBuG,EAAO0G,GACHC,QACAhN,KAAK0F,MAAQA,EACb1F,KAAKF,KAAOA,EACZE,KAAKqG,MAAQA,EACbrG,KAAK+M,QAAUA,CACnB,CACA,QAAInM,GAAS,OAAOZ,KAAK0F,MAAM9E,IAAM,CACrC,QAAIuB,GAAS,OAAOnC,KAAK0F,MAAM9E,KAAKuB,IAAM,CAC1C,MAAIpC,GAAO,OAAOC,KAAKF,KAAOE,KAAK0F,MAAMnD,MAAQ,CACjD,SAAA0K,CAAUxJ,EAAG6H,EAAKjG,EAAKC,EAAML,EAAO,GAChC,IAAK,IAAImB,EAASpG,OAAQ,CACtB,IAAK,IAAIyE,SAAEA,EAAQC,UAAEA,GAAc0B,EAAOV,MAAOwH,EAAI5B,EAAM,EAAI7G,EAASlC,QAAS,EAAIkB,GAAKyJ,EAAGzJ,GAAK6H,EAAK,CACnG,IAA4D9J,EAAxDkH,EAAOjE,EAAShB,GAAI4E,EAAQ3D,EAAUjB,GAAK2C,EAAOtG,KACtD,GAAOmF,EAAOV,EAAS4I,gBAAmBzE,aAAgBlE,IACrDhD,EAAUC,EAAYK,IAAI4G,MAAWlH,EAAQG,SAAWH,EAAQK,WACjEwD,GAAOgD,GAAShD,GAAOgD,EAAQK,EAAKnG,QACnCiJ,EAAUlG,EAAMD,EAAKgD,EAAOA,EAAQK,EAAKnG,QAE9C,GAAImG,aAAgBO,EAAY,CAC5B,GAAIhE,EAAOV,EAAS6I,eAChB,SACJ,IAAI/G,EAAQqC,EAAK2C,UAAU,EAAG3C,EAAKhB,OAAOnF,OAAQ+I,EAAKjG,EAAMgD,EAAO/C,GACpE,GAAIe,GAAQ,EACR,OAAO,IAAIgH,EAAW,IAAIC,EAAclH,EAAQsC,EAAMjF,EAAG4E,GAAQ,KAAMhC,EAC/E,MACK,GAAKpB,EAAOV,EAASuC,mBAAuB4B,EAAK9H,KAAKsC,aAAeqK,EAAS7E,GAAQ,CACvF,IAAIlH,EACJ,KAAMyD,EAAOV,EAASiJ,gBAAkBhM,EAAUC,EAAYK,IAAI4G,MAAWlH,EAAQG,QACjF,OAAO,IAAIgE,EAASnE,EAAQE,KAAM2G,EAAO5E,EAAG2C,GAChD,IAAIJ,EAAQ,IAAIL,EAAS+C,EAAML,EAAO5E,EAAG2C,GACzC,OAAQnB,EAAOV,EAASuC,mBAAsBd,EAAMpF,KAAKsC,YAAc8C,EACjEA,EAAMiH,UAAU3B,EAAM,EAAI5C,EAAKjE,SAASlC,OAAS,EAAI,EAAG+I,EAAKjG,EAAKC,EAAML,EAClF,CACJ,CACA,GAAKA,EAAOV,EAASuC,mBAAsBV,EAAOxF,KAAKsC,YACnD,OAAO,KAMX,GAJIO,EADA2C,EAAOC,OAAS,EACZD,EAAOC,MAAQiF,EAEfA,EAAM,GAAI,EAAKlF,EAAO2G,QAAQrH,MAAMjB,SAASlC,OACrD6D,EAASA,EAAO2G,SACX3G,EACD,OAAO,IACf,CACJ,CACA,cAAIa,GAAe,OAAOjH,KAAKiN,UAAU,EAAG,EAAG,EAAG,EAAwB,CAC1E,aAAIJ,GAAc,OAAO7M,KAAKiN,UAAUjN,KAAK0F,MAAMjB,SAASlC,OAAS,GAAG,EAAI,EAAG,EAAwB,CACvG,UAAAkL,CAAWpI,GAAO,OAAOrF,KAAKiN,UAAU,EAAG,EAAG5H,EAAK,EAAqB,CACxE,WAAAuH,CAAYvH,GAAO,OAAOrF,KAAKiN,UAAUjN,KAAK0F,MAAMjB,SAASlC,OAAS,GAAG,EAAI8C,GAAK,EAAuB,CACzG,IAAAvC,CAAKA,GAAQ,OAAO9C,KAAK0F,MAAM5C,KAAKA,EAAO,CAC3C,KAAA6D,CAAMtB,EAAKC,EAAML,EAAO,GACpB,IAAIzD,EACJ,KAAMyD,EAAOV,EAAS2H,kBAAoB1K,EAAUC,EAAYK,IAAI9B,KAAK0F,SAAWlE,EAAQG,QAAS,CACjG,IAAI+L,EAAOrI,EAAMrF,KAAKF,KAAM6N,EAAkB1I,EAAOV,EAAS4I,gBAAmB3L,EAAQK,UACzF,IAAK,IAAI/B,KAAEA,EAAIC,GAAEA,KAAQyB,EAAQG,QAC7B,IAAK2D,EAAO,GAAKqI,EAAiB7N,GAAQ4N,EAAO5N,EAAO4N,KACnDpI,EAAO,GAAKqI,EAAiB5N,GAAM2N,EAAO3N,EAAK2N,GAChD,OAAO,IAAI/H,EAASnE,EAAQE,KAAMF,EAAQG,QAAQ,GAAG7B,KAAOE,KAAKF,MAAM,EAAIE,KAEvF,CACA,OAAOA,KAAKiN,UAAU,EAAG,EAAG5H,EAAKC,EAAML,EAC3C,CACA,qBAAA2I,GACI,IAAIC,EAAM7N,KACV,KAAO6N,EAAIjN,KAAKsC,aAAe2K,EAAId,SAC/Bc,EAAMA,EAAId,QACd,OAAOc,CACX,CACA,UAAIzH,GACA,OAAOpG,KAAK+M,QAAU/M,KAAK+M,QAAQa,wBAA0B,IACjE,CACA,eAAI1G,GACA,OAAOlH,KAAK+M,SAAW/M,KAAKqG,OAAS,EAAIrG,KAAK+M,QAAQE,UAAUjN,KAAKqG,MAAQ,EAAG,EAAG,EAAG,GAAyB,IACnH,CACA,eAAIyG,GACA,OAAO9M,KAAK+M,SAAW/M,KAAKqG,OAAS,EAAIrG,KAAK+M,QAAQE,UAAUjN,KAAKqG,MAAQ,GAAG,EAAI,EAAG,GAAyB,IACpH,CACA,QAAI3E,GAAS,OAAO1B,KAAK0F,KAAO,CAChC,MAAAoI,GAAW,OAAO9N,KAAK0F,KAAO,CAI9B,QAAAf,GAAa,OAAO3E,KAAK0F,MAAMf,UAAY,EAE/C,SAAS6H,EAAYjJ,EAAM3C,EAAMyL,EAAQC,GACrC,IAAIyB,EAAMxK,EAAKyB,SAAUnE,EAAS,GAClC,IAAKkN,EAAI9G,aACL,OAAOpG,EACX,GAAc,MAAVwL,EACA,IAAK,IAAI3I,GAAQ,GAAQA,GAErB,GADAA,EAAQqK,EAAInN,KAAKuC,GAAGkJ,IACf0B,EAAI7G,cACL,OAAOrG,EAEnB,OAAS,CACL,GAAa,MAATyL,GAAiByB,EAAInN,KAAKuC,GAAGmJ,GAC7B,OAAOzL,EAGX,GAFIkN,EAAInN,KAAKuC,GAAGvC,IACZC,EAAOsD,KAAK4J,EAAIxK,OACfwK,EAAI7G,cACL,OAAgB,MAAToF,EAAgBzL,EAAS,EACxC,CACJ,CACA,SAAS6L,EAAiBnJ,EAAM4C,EAAS1C,EAAI0C,EAAQ5D,OAAS,GAC1D,IAAK,IAAIyL,EAAIzK,EAAME,GAAK,EAAGuK,EAAIA,EAAE5H,OAAQ,CACrC,IAAK4H,EACD,OAAO,EACX,IAAKA,EAAEpN,KAAKsC,YAAa,CACrB,GAAIiD,EAAQ1C,IAAM0C,EAAQ1C,IAAMuK,EAAE7L,KAC9B,OAAO,EACXsB,GACJ,CACJ,CACA,OAAO,CACX,CACA,MAAM6J,EACF,WAAAzN,CAAYuG,EAAQsB,EAAQrB,EAAOgC,GAC/BrI,KAAKoG,OAASA,EACdpG,KAAK0H,OAASA,EACd1H,KAAKqG,MAAQA,EACbrG,KAAKqI,MAAQA,CACjB,EAEJ,MAAMgF,UAAmBlB,EACrB,QAAIhK,GAAS,OAAOnC,KAAKY,KAAKuB,IAAM,CACpC,QAAIrC,GAAS,OAAOE,KAAKmG,QAAQkC,MAAQrI,KAAKmG,QAAQuB,OAAOA,OAAO1H,KAAKqG,MAAQ,EAAI,CACrF,MAAItG,GAAO,OAAOC,KAAKmG,QAAQkC,MAAQrI,KAAKmG,QAAQuB,OAAOA,OAAO1H,KAAKqG,MAAQ,EAAI,CACnF,WAAAxG,CAAYsG,EAAS4G,EAAS1G,GAC1B2G,QACAhN,KAAKmG,QAAUA,EACfnG,KAAK+M,QAAUA,EACf/M,KAAKqG,MAAQA,EACbrG,KAAKY,KAAOuF,EAAQuB,OAAOjC,IAAI5B,MAAMsC,EAAQuB,OAAOA,OAAOrB,GAC/D,CACA,KAAA4H,CAAM3C,EAAKjG,EAAKC,GACZ,IAAIoC,OAAEA,GAAW1H,KAAKmG,QAClBE,EAAQqB,EAAO2D,UAAUrL,KAAKqG,MAAQ,EAAGqB,EAAOA,OAAO1H,KAAKqG,MAAQ,GAAIiF,EAAKjG,EAAMrF,KAAKmG,QAAQkC,MAAO/C,GAC3G,OAAOe,EAAQ,EAAI,KAAO,IAAIgH,EAAWrN,KAAKmG,QAASnG,KAAMqG,EACjE,CACA,cAAIY,GAAe,OAAOjH,KAAKiO,MAAM,EAAG,EAAG,EAAwB,CACnE,aAAIpB,GAAc,OAAO7M,KAAKiO,OAAM,EAAI,EAAG,EAAwB,CACnE,UAAAR,CAAWpI,GAAO,OAAOrF,KAAKiO,MAAM,EAAG5I,EAAK,EAAqB,CACjE,WAAAuH,CAAYvH,GAAO,OAAOrF,KAAKiO,SAAU5I,GAAK,EAAuB,CACrE,IAAAvC,CAAKA,GAAQ,OAAO9C,KAAKY,KAAKkC,KAAKA,EAAO,CAC1C,KAAA6D,CAAMtB,EAAKC,EAAML,EAAO,GACpB,GAAIA,EAAOV,EAAS6I,eAChB,OAAO,KACX,IAAI1F,OAAEA,GAAW1H,KAAKmG,QAClBE,EAAQqB,EAAO2D,UAAUrL,KAAKqG,MAAQ,EAAGqB,EAAOA,OAAO1H,KAAKqG,MAAQ,GAAIf,EAAO,EAAI,GAAI,EAAID,EAAMrF,KAAKmG,QAAQkC,MAAO/C,GACzH,OAAOe,EAAQ,EAAI,KAAO,IAAIgH,EAAWrN,KAAKmG,QAASnG,KAAMqG,EACjE,CACA,UAAID,GACA,OAAOpG,KAAK+M,SAAW/M,KAAKmG,QAAQC,OAAOwH,uBAC/C,CACA,eAAAM,CAAgB5C,GACZ,OAAOtL,KAAK+M,QAAU,KAAO/M,KAAKmG,QAAQC,OAAO6G,UAAUjN,KAAKmG,QAAQE,MAAQiF,EAAKA,EAAK,EAAG,EACjG,CACA,eAAIpE,GACA,IAAIQ,OAAEA,GAAW1H,KAAKmG,QAClBmG,EAAQ5E,EAAOA,OAAO1H,KAAKqG,MAAQ,GACvC,OAAIiG,GAAStM,KAAK+M,QAAUrF,EAAOA,OAAO1H,KAAK+M,QAAQ1G,MAAQ,GAAKqB,EAAOA,OAAOnF,QACvE,IAAI8K,EAAWrN,KAAKmG,QAASnG,KAAK+M,QAAST,GAC/CtM,KAAKkO,gBAAgB,EAChC,CACA,eAAIpB,GACA,IAAIpF,OAAEA,GAAW1H,KAAKmG,QAClB8B,EAAcjI,KAAK+M,QAAU/M,KAAK+M,QAAQ1G,MAAQ,EAAI,EAC1D,OAAIrG,KAAKqG,OAAS4B,EACPjI,KAAKkO,oBACT,IAAIb,EAAWrN,KAAKmG,QAASnG,KAAK+M,QAASrF,EAAO2D,UAAUpD,EAAajI,KAAKqG,OAAO,EAAI,EAAG,GACvG,CACA,QAAI3E,GAAS,OAAO,IAAM,CAC1B,MAAAoM,GACI,IAAIrJ,EAAW,GAAIC,EAAY,IAC3BgD,OAAEA,GAAW1H,KAAKmG,QAClBuF,EAAS1L,KAAKqG,MAAQ,EAAGsF,EAAOjE,EAAOA,OAAO1H,KAAKqG,MAAQ,GAC/D,GAAIsF,EAAOD,EAAQ,CACf,IAAI5L,EAAO4H,EAAOA,OAAO1H,KAAKqG,MAAQ,GACtC5B,EAASN,KAAKuD,EAAO+D,MAAMC,EAAQC,EAAM7L,IACzC4E,EAAUP,KAAK,EACnB,CACA,OAAO,IAAIK,EAAKxE,KAAKY,KAAM6D,EAAUC,EAAW1E,KAAKD,GAAKC,KAAKF,KACnE,CAIA,QAAA6E,GAAa,OAAO3E,KAAKmG,QAAQuB,OAAOwD,YAAYlL,KAAKqG,MAAQ,EAErE,SAASG,EAAU2H,GACf,IAAKA,EAAM5L,OACP,OAAO,KACX,IAAIgJ,EAAO,EAAG6C,EAASD,EAAM,GAC7B,IAAK,IAAI1K,EAAI,EAAGA,EAAI0K,EAAM5L,OAAQkB,IAAK,CACnC,IAAIF,EAAO4K,EAAM1K,IACbF,EAAKzD,KAAOsO,EAAOtO,MAAQyD,EAAKxD,GAAKqO,EAAOrO,MAC5CqO,EAAS7K,EACTgI,EAAO9H,EAEf,CACA,IAAIiF,EAAO0F,aAAkBzI,GAAYyI,EAAO/H,MAAQ,EAAI,KAAO+H,EAAOhI,OACtEiI,EAAWF,EAAM1C,QAKrB,OAJI/C,EACA2F,EAAS9C,GAAQ7C,EAEjB2F,EAASC,OAAO/C,EAAM,GACnB,IAAIgD,EAAcF,EAAUD,EACvC,CACA,MAAMG,EACF,WAAA1O,CAAYsO,EAAO5K,GACfvD,KAAKmO,MAAQA,EACbnO,KAAKuD,KAAOA,CAChB,CACA,QAAImF,GAAS,OAAOlC,EAAUxG,KAAKmO,MAAQ,EAyB/C,MAAMjJ,EAIF,QAAI/C,GAAS,OAAOnC,KAAKY,KAAKuB,IAAM,CAIpC,WAAAtC,CAAY0D,EAAM0B,EAAO,GAYrB,GARAjF,KAAK0H,OAAS,KACd1H,KAAKwO,MAAQ,GAIbxO,KAAKqG,MAAQ,EACbrG,KAAKyO,WAAa,KAClBzO,KAAKiF,KAAOA,GAAQV,EAAS4I,eACzB5J,aAAgBoC,EAChB3F,KAAK0O,UAAUnL,OAEd,CACDvD,KAAK0F,MAAQnC,EAAK4C,QAAQC,OAC1BpG,KAAK0H,OAASnE,EAAK4C,QACnB,IAAK,IAAIwI,EAAIpL,EAAKwJ,QAAS4B,EAAGA,EAAIA,EAAE5B,QAChC/M,KAAKwO,MAAMI,QAAQD,EAAEtI,OACzBrG,KAAKyO,WAAalL,EAClBvD,KAAK6O,SAAStL,EAAK8C,MACvB,CACJ,CACA,SAAAqI,CAAUnL,GACN,QAAKA,IAELvD,KAAK0F,MAAQnC,EACbvD,KAAKY,KAAO2C,EAAK3C,KACjBZ,KAAKF,KAAOyD,EAAKzD,KACjBE,KAAKD,GAAKwD,EAAKxD,IACR,EACX,CACA,QAAA8O,CAASxI,EAAOzF,GACZZ,KAAKqG,MAAQA,EACb,IAAIgC,MAAEA,EAAKX,OAAEA,GAAW1H,KAAK0H,OAI7B,OAHA1H,KAAKY,KAAOA,GAAQ8G,EAAOjC,IAAI5B,MAAM6D,EAAOA,OAAOrB,IACnDrG,KAAKF,KAAOuI,EAAQX,EAAOA,OAAOrB,EAAQ,GAC1CrG,KAAKD,GAAKsI,EAAQX,EAAOA,OAAOrB,EAAQ,IACjC,CACX,CAIA,KAAAyI,CAAMvL,GACF,QAAKA,IAEDA,aAAgBoC,GAChB3F,KAAK0H,OAAS,KACP1H,KAAK0O,UAAUnL,KAE1BvD,KAAK0H,OAASnE,EAAK4C,QACZnG,KAAK6O,SAAStL,EAAK8C,MAAO9C,EAAK3C,OAC1C,CAIA,QAAA+D,GACI,OAAO3E,KAAK0H,OAAS1H,KAAK0H,OAAOA,OAAOwD,YAAYlL,KAAKqG,OAASrG,KAAK0F,MAAMf,UACjF,CAIA,UAAAoK,CAAWzD,EAAKjG,EAAKC,GACjB,IAAKtF,KAAK0H,OACN,OAAO1H,KAAK8O,MAAM9O,KAAK0F,MAAMuH,UAAU3B,EAAM,EAAItL,KAAK0F,MAAMA,MAAMjB,SAASlC,OAAS,EAAI,EAAG+I,EAAKjG,EAAKC,EAAMtF,KAAKiF,OACpH,IAAIyC,OAAEA,GAAW1H,KAAK0H,OAClBrB,EAAQqB,EAAO2D,UAAUrL,KAAKqG,MAAQ,EAAGqB,EAAOA,OAAO1H,KAAKqG,MAAQ,GAAIiF,EAAKjG,EAAMrF,KAAK0H,OAAOW,MAAO/C,GAC1G,QAAIe,EAAQ,KAEZrG,KAAKwO,MAAMrK,KAAKnE,KAAKqG,OACdrG,KAAK6O,SAASxI,GACzB,CAKA,UAAAY,GAAe,OAAOjH,KAAK+O,WAAW,EAAG,EAAG,EAAwB,CAIpE,SAAAlC,GAAc,OAAO7M,KAAK+O,YAAW,EAAI,EAAG,EAAwB,CAIpE,UAAAtB,CAAWpI,GAAO,OAAOrF,KAAK+O,WAAW,EAAG1J,EAAK,EAAqB,CAItE,WAAAuH,CAAYvH,GAAO,OAAOrF,KAAK+O,cAAe1J,GAAK,EAAuB,CAQ1E,KAAAsB,CAAMtB,EAAKC,EAAML,EAAOjF,KAAKiF,MACzB,OAAKjF,KAAK0H,SAEHzC,EAAOV,EAAS6I,iBAAyBpN,KAAK+O,WAAW,EAAG1J,EAAKC,GAD7DtF,KAAK8O,MAAM9O,KAAK0F,MAAMiB,MAAMtB,EAAKC,EAAML,GAEtD,CAIA,MAAAmB,GACI,IAAKpG,KAAK0H,OACN,OAAO1H,KAAK0O,UAAW1O,KAAKiF,KAAOV,EAASuC,iBAAoB9G,KAAK0F,MAAMqH,QAAU/M,KAAK0F,MAAMU,QACpG,GAAIpG,KAAKwO,MAAMjM,OACX,OAAOvC,KAAK6O,SAAS7O,KAAKwO,MAAMpE,OACpC,IAAIhE,EAAUpG,KAAKiF,KAAOV,EAASuC,iBAAoB9G,KAAK0H,OAAOtB,OAASpG,KAAK0H,OAAOtB,OAAOwH,wBAE/F,OADA5N,KAAK0H,OAAS,KACP1H,KAAK0O,UAAUtI,EAC1B,CAIA,OAAA4I,CAAQ1D,GACJ,IAAKtL,KAAK0H,OACN,QAAQ1H,KAAK0F,MAAMqH,SACb/M,KAAK8O,MAAM9O,KAAK0F,MAAMW,MAAQ,EAAI,KAC9BrG,KAAK0F,MAAMqH,QAAQE,UAAUjN,KAAK0F,MAAMW,MAAQiF,EAAKA,EAAK,EAAG,EAAuBtL,KAAKiF,OACvG,IAAIyC,OAAEA,GAAW1H,KAAK0H,OAAQuH,EAAIjP,KAAKwO,MAAMjM,OAAS,EACtD,GAAI+I,EAAM,EAAG,CACT,IAAIrD,EAAcgH,EAAI,EAAI,EAAIjP,KAAKwO,MAAMS,GAAK,EAC9C,GAAIjP,KAAKqG,OAAS4B,EACd,OAAOjI,KAAK6O,SAASnH,EAAO2D,UAAUpD,EAAajI,KAAKqG,OAAO,EAAI,EAAG,GAC9E,KACK,CACD,IAAIiG,EAAQ5E,EAAOA,OAAO1H,KAAKqG,MAAQ,GACvC,GAAIiG,GAAS2C,EAAI,EAAIvH,EAAOA,OAAOnF,OAASmF,EAAOA,OAAO1H,KAAKwO,MAAMS,GAAK,IACtE,OAAOjP,KAAK6O,SAASvC,EAC7B,CACA,OAAO2C,EAAI,GAAIjP,KAAK8O,MAAM9O,KAAK0H,OAAOtB,OAAO6G,UAAUjN,KAAK0H,OAAOrB,MAAQiF,EAAKA,EAAK,EAAG,EAAuBtL,KAAKiF,MACxH,CAIA,WAAAiC,GAAgB,OAAOlH,KAAKgP,QAAQ,EAAI,CAIxC,WAAAlC,GAAgB,OAAO9M,KAAKgP,SAAQ,EAAK,CACzC,UAAAE,CAAW5D,GACP,IAAIjF,EAAOD,GAAQsB,OAAEA,GAAW1H,KAChC,GAAI0H,EAAQ,CACR,GAAI4D,EAAM,GACN,GAAItL,KAAKqG,MAAQqB,EAAOA,OAAOA,OAAOnF,OAClC,OAAO,OAGX,IAAK,IAAIkB,EAAI,EAAGA,EAAIzD,KAAKqG,MAAO5C,IAC5B,GAAIiE,EAAOA,OAAOA,OAAOjE,EAAI,GAAKzD,KAAKqG,MACnC,OAAO,IAEhBA,QAAOD,UAAWsB,EACzB,OAEOrB,QAAO0G,QAAS3G,GAAWpG,KAAK0F,OAEvC,KAAOU,IAAUC,QAAO0G,QAAS3G,GAAWA,GACxC,GAAIC,GAAQ,EACR,IAAK,IAAI5C,EAAI4C,EAAQiF,EAAK4B,EAAI5B,EAAM,GAAI,EAAKlF,EAAOV,MAAMjB,SAASlC,OAAQkB,GAAKyJ,EAAGzJ,GAAK6H,EAAK,CACzF,IAAI2C,EAAQ7H,EAAOV,MAAMjB,SAAShB,GAClC,GAAKzD,KAAKiF,KAAOV,EAASuC,kBACtBmH,aAAiBhF,IAChBgF,EAAMrN,KAAKsC,aACZqK,EAASU,GACT,OAAO,CACf,CAER,OAAO,CACX,CACA,IAAAkB,CAAK7D,EAAK3E,GACN,GAAIA,GAAS3G,KAAK+O,WAAWzD,EAAK,EAAG,GACjC,OAAO,EACX,OAAS,CACL,GAAItL,KAAKgP,QAAQ1D,GACb,OAAO,EACX,GAAItL,KAAKkP,WAAW5D,KAAStL,KAAKoG,SAC9B,OAAO,CACf,CACJ,CAQA,IAAAsC,CAAK/B,GAAQ,GAAQ,OAAO3G,KAAKmP,KAAK,EAAGxI,EAAQ,CAOjD,IAAAyI,CAAKzI,GAAQ,GAAQ,OAAO3G,KAAKmP,MAAK,EAAIxI,EAAQ,CAMlD,MAAAnB,CAAOH,EAAKC,EAAO,GAEf,MAAOtF,KAAKF,MAAQE,KAAKD,KACpBuF,EAAO,EAAItF,KAAKF,MAAQuF,EAAMrF,KAAKF,KAAOuF,KAC1CC,GAAO,EAAKtF,KAAKD,IAAMsF,EAAMrF,KAAKD,GAAKsF,KACnCrF,KAAKoG,WAGd,KAAOpG,KAAK+O,WAAW,EAAG1J,EAAKC,KAC/B,OAAOtF,IACX,CAKA,QAAIuD,GACA,IAAKvD,KAAK0H,OACN,OAAO1H,KAAK0F,MAChB,IAAI2J,EAAQrP,KAAKyO,WAAY5N,EAAS,KAAMuH,EAAQ,EACpD,GAAIiH,GAASA,EAAMlJ,SAAWnG,KAAK0H,OAC/BxB,EAAM,IAAK,IAAIG,EAAQrG,KAAKqG,MAAO4I,EAAIjP,KAAKwO,MAAMjM,OAAQ0M,GAAK,GAAI,CAC/D,IAAK,IAAIlI,EAAIsI,EAAOtI,EAAGA,EAAIA,EAAEgG,QACzB,GAAIhG,EAAEV,OAASA,EAAO,CAClB,GAAIA,GAASrG,KAAKqG,MACd,OAAOU,EACXlG,EAASkG,EACTqB,EAAQ6G,EAAI,EACZ,MAAM/I,CACV,CACJG,EAAQrG,KAAKwO,QAAQS,EACzB,CAEJ,IAAK,IAAIxL,EAAI2E,EAAO3E,EAAIzD,KAAKwO,MAAMjM,OAAQkB,IACvC5C,EAAS,IAAIwM,EAAWrN,KAAK0H,OAAQ7G,EAAQb,KAAKwO,MAAM/K,IAC5D,OAAOzD,KAAKyO,WAAa,IAAIpB,EAAWrN,KAAK0H,OAAQ7G,EAAQb,KAAKqG,MACtE,CAMA,QAAI3E,GACA,OAAO1B,KAAK0H,OAAS,KAAO1H,KAAK0F,MAAMA,KAC3C,CAOA,OAAAgB,CAAQC,EAAOC,GACX,IAAK,IAAIwB,EAAQ,IAAK,CAClB,IAAIkH,GAAY,EAChB,GAAItP,KAAKY,KAAKsC,cAA+B,IAAhByD,EAAM3G,MAAiB,CAChD,GAAIA,KAAKiH,aAAc,CACnBmB,IACA,QACJ,CACKpI,KAAKY,KAAKsC,cACXoM,GAAY,EACpB,CACA,OAAS,CAIL,GAHIA,GAAa1I,GACbA,EAAM5G,MACVsP,EAAYtP,KAAKY,KAAKsC,aACjBkF,EACD,OACJ,GAAIpI,KAAKkH,cACL,MACJlH,KAAKoG,SACLgC,IACAkH,GAAY,CAChB,CACJ,CACJ,CAMA,YAAA7C,CAAatG,GACT,IAAKnG,KAAK0H,OACN,OAAOgF,EAAiB1M,KAAKuD,KAAK6C,OAAQD,GAC9C,IAAIuB,OAAEA,GAAW1H,KAAK0H,QAAQ7D,MAAEA,GAAU6D,EAAOjC,IACjD,IAAK,IAAIhC,EAAI0C,EAAQ5D,OAAS,EAAG0M,EAAIjP,KAAKwO,MAAMjM,OAAS,EAAGkB,GAAK,EAAGwL,IAAK,CACrE,GAAIA,EAAI,EACJ,OAAOvC,EAAiB1M,KAAK0F,MAAOS,EAAS1C,GACjD,IAAI7C,EAAOiD,EAAM6D,EAAOA,OAAO1H,KAAKwO,MAAMS,KAC1C,IAAKrO,EAAKsC,YAAa,CACnB,GAAIiD,EAAQ1C,IAAM0C,EAAQ1C,IAAM7C,EAAKuB,KACjC,OAAO,EACXsB,GACJ,CACJ,CACA,OAAO,CACX,EAEJ,SAAS8J,EAAS7L,GACd,OAAOA,EAAK+C,SAAS8K,KAAK3K,GAAMA,aAAcqE,IAAerE,EAAGhE,KAAKsC,aAAeqK,EAAS3I,GACjG,CAgOA,MAAM4K,EAAgB,IAAInL,QAC1B,SAASqG,EAAS+E,EAAalM,GAC3B,IAAKkM,EAAYvM,aAAeK,aAAgB0F,GAAc1F,EAAK3C,MAAQ6O,EACvE,OAAO,EACX,IAAIlH,EAAOiH,EAAc1N,IAAIyB,GAC7B,GAAY,MAARgF,EAAc,CACdA,EAAO,EACP,IAAK,IAAI0F,KAAS1K,EAAKkB,SAAU,CAC7B,GAAIwJ,EAAMrN,MAAQ6O,KAAiBxB,aAAiBzJ,GAAO,CACvD+D,EAAO,EACP,KACJ,CACAA,GAAQmC,EAAS+E,EAAaxB,EAClC,CACAuB,EAAc/J,IAAIlC,EAAMgF,EAC5B,CACA,OAAOA,CACX,CACA,SAASlB,EAEToI,EAEAhL,EAAUC,EAEV5E,EAAMC,EAENsI,EAEA9F,EAEAmN,EAEAC,GACI,IAAIC,EAAQ,EACZ,IAAK,IAAInM,EAAI3D,EAAM2D,EAAI1D,EAAI0D,IACvBmM,GAASlF,EAAS+E,EAAahL,EAAShB,IAC5C,IAAIoM,EAAW9D,KAAK+D,KAAc,IAARF,EAAe,GACrC1G,EAAgB,GAAIC,EAAiB,GA2BzC,OA1BA,SAAS4G,EAAOtL,EAAUC,EAAW5E,EAAMC,EAAIiQ,GAC3C,IAAK,IAAIvM,EAAI3D,EAAM2D,EAAI1D,GAAK,CACxB,IAAIkQ,EAAYxM,EAAGyM,EAAaxL,EAAUjB,GAAI0M,EAAYzF,EAAS+E,EAAahL,EAAShB,IAEzF,IADAA,IACOA,EAAI1D,EAAI0D,IAAK,CAChB,IAAI2M,EAAW1F,EAAS+E,EAAahL,EAAShB,IAC9C,GAAI0M,EAAYC,GAAYP,EACxB,MACJM,GAAaC,CACjB,CACA,GAAI3M,GAAKwM,EAAY,EAAG,CACpB,GAAIE,EAAYN,EAAU,CACtB,IAAIQ,EAAO5L,EAASwL,GACpBF,EAAOM,EAAK5L,SAAU4L,EAAK3L,UAAW,EAAG2L,EAAK5L,SAASlC,OAAQmC,EAAUuL,GAAaD,GACtF,QACJ,CACA9G,EAAc/E,KAAKM,EAASwL,GAChC,KACK,CACD,IAAI1N,EAASmC,EAAUjB,EAAI,GAAKgB,EAAShB,EAAI,GAAGlB,OAAS2N,EACzDhH,EAAc/E,KAAKkD,EAAaoI,EAAahL,EAAUC,EAAWuL,EAAWxM,EAAGyM,EAAY3N,EAAQ,KAAMoN,GAC9G,CACAxG,EAAehF,KAAK+L,EAAaF,EAAS3H,EAC9C,CACJ,CACA0H,CAAOtL,EAAUC,EAAW5E,EAAMC,EAAI,IAC9B2P,GAASC,GAAQzG,EAAeC,EAAgB5G,EAC5D,CA+DA,MAAM+N,EAOF,WAAAzQ,CAMAC,EAIAC,EAIA2B,EAOAsO,EAAQO,GAAY,EAAOC,GAAU,GACjCxQ,KAAKF,KAAOA,EACZE,KAAKD,GAAKA,EACVC,KAAK0B,KAAOA,EACZ1B,KAAKgQ,OAASA,EACdhQ,KAAKyQ,MAAQF,EAAY,EAAqB,IAAMC,EAAU,EAAmB,EACrF,CAOA,aAAID,GAAc,OAAoB,EAAZvQ,KAAKyQ,MAA6B,CAAG,CAK/D,WAAID,GAAY,OAAoB,EAAZxQ,KAAKyQ,MAA2B,CAAG,CAS3D,cAAOC,CAAQhP,EAAMiP,EAAY,GAAIC,GAAU,GAC3C,IAAI/P,EAAS,CAAC,IAAIyP,EAAa,EAAG5O,EAAKa,OAAQb,EAAM,GAAG,EAAOkP,IAC/D,IAAK,IAAIC,KAAKF,EACNE,EAAE9Q,GAAK2B,EAAKa,QACZ1B,EAAOsD,KAAK0M,GACpB,OAAOhQ,CACX,CAMA,mBAAOiQ,CAAaH,EAAWI,EAASC,EAAS,KAC7C,IAAKD,EAAQxO,OACT,OAAOoO,EACX,IAAI9P,EAAS,GACToQ,EAAK,EAAGC,EAAQP,EAAUpO,OAASoO,EAAU,GAAK,KACtD,IAAK,IAAIQ,EAAK,EAAG9L,EAAM,EAAG+L,EAAM,GAAID,IAAM,CACtC,IAAIE,EAAQF,EAAKJ,EAAQxO,OAASwO,EAAQI,GAAM,KAC5CG,EAAUD,EAAQA,EAAME,MAAQ,IACpC,GAAID,EAAUjM,GAAO2L,EACjB,KAAOE,GAASA,EAAMpR,KAAOwR,GAAS,CAClC,IAAIE,EAAMN,EACV,GAAI7L,GAAOmM,EAAI1R,MAAQwR,GAAWE,EAAIzR,IAAMqR,EAAK,CAC7C,IAAIK,EAAQ1F,KAAKC,IAAIwF,EAAI1R,KAAMuF,GAAO+L,EAAKM,EAAM3F,KAAK4F,IAAIH,EAAIzR,GAAIuR,GAAWF,EAC7EI,EAAMC,GAASC,EAAM,KAAO,IAAIpB,EAAamB,EAAOC,EAAKF,EAAI9P,KAAM8P,EAAIxB,OAASoB,EAAKD,EAAK,IAAKE,EACnG,CAGA,GAFIG,GACA3Q,EAAOsD,KAAKqN,GACZN,EAAMnR,GAAKuR,EACX,MACJJ,EAAQD,EAAKN,EAAUpO,OAASoO,EAAUM,KAAQ,IACtD,CACJ,IAAKI,EACD,MACJhM,EAAMgM,EAAMO,IACZR,EAAMC,EAAMO,IAAMP,EAAMQ,GAC5B,CACA,OAAOhR,CACX,EAKJ,MAAMiR,EAWF,UAAAC,CAAWC,EAAOrB,EAAWsB,GAIzB,MAHoB,iBAATD,IACPA,EAAQ,IAAIE,GAAYF,IAC5BC,EAAUA,EAAwCA,EAAO1P,OAAS0P,EAAO5O,IAAIkJ,GAAK,IAAI3M,EAAM2M,EAAEzM,KAAMyM,EAAExM,KAAO,CAAC,IAAIH,EAAM,EAAG,IAAxG,CAAC,IAAIA,EAAM,EAAGoS,EAAMzP,SAChCvC,KAAKmS,YAAYH,EAAOrB,GAAa,GAAIsB,EACpD,CAIA,KAAAG,CAAMJ,EAAOrB,EAAWsB,GACpB,IAAIG,EAAQpS,KAAK+R,WAAWC,EAAOrB,EAAWsB,GAC9C,OAAS,CACL,IAAII,EAAOD,EAAME,UACjB,GAAID,EACA,OAAOA,CACf,CACJ,EAEJ,MAAMH,GACF,WAAArS,CAAY0S,GACRvS,KAAKuS,OAASA,CAClB,CACA,UAAIhQ,GAAW,OAAOvC,KAAKuS,OAAOhQ,MAAQ,CAC1C,KAAAiQ,CAAM1S,GAAQ,OAAOE,KAAKuS,OAAO9G,MAAM3L,EAAO,CAC9C,cAAI2S,GAAe,OAAO,CAAO,CACjC,IAAAC,CAAK5S,EAAMC,GAAM,OAAOC,KAAKuS,OAAO9G,MAAM3L,EAAMC,EAAK,EAazD,MAAM4S,GACF,WAAA9S,CAAY+B,EAAQwQ,EAAOzQ,EAASE,EAAW+Q,EAAQ9S,GACnDE,KAAK4B,OAASA,EACd5B,KAAKoS,MAAQA,EACbpS,KAAK2B,QAAUA,EACf3B,KAAK6B,UAAYA,EACjB7B,KAAK4S,OAASA,EACd5S,KAAKF,KAAOA,CAChB,EAEJ,SAAS+S,GAAYZ,GACjB,IAAKA,EAAO1P,QAAU0P,EAAO1C,KAAKhD,GAAKA,EAAEzM,MAAQyM,EAAExM,IAC/C,MAAM,IAAIW,WAAW,qCAAuCoE,KAAKC,UAAUkN,GACnF,CACA,MAAMa,GACF,WAAAjT,CAAY+B,EAAQmR,EAAWC,EAAQ3M,EAAOgC,EAAOxG,EAAW+Q,EAAQxD,GACpEpP,KAAK4B,OAASA,EACd5B,KAAK+S,UAAYA,EACjB/S,KAAKgT,OAASA,EACdhT,KAAKqG,MAAQA,EACbrG,KAAKqI,MAAQA,EACbrI,KAAK6B,UAAYA,EACjB7B,KAAK4S,OAASA,EACd5S,KAAKoP,KAAOA,EACZpP,KAAKoI,MAAQ,EACbpI,KAAKiS,OAAS,EAClB,EAEJ,MAAMgB,GAAe,IAAIhT,EAAS,CAAEG,SAAS,IAC7C,MAAM8S,GACF,WAAArT,CAAYsK,EAAMgJ,EAAMnB,EAAOrB,EAAWsB,GACtCjS,KAAKmT,KAAOA,EACZnT,KAAKgS,MAAQA,EACbhS,KAAK2Q,UAAYA,EACjB3Q,KAAKiS,OAASA,EACdjS,KAAKgG,MAAQ,GACbhG,KAAKoT,UAAY,EACjBpT,KAAKqT,SAAW,KAChBrT,KAAKsT,UAAY,KACjBtT,KAAKuT,UAAYpJ,CACrB,CACA,OAAAmI,GACI,GAAItS,KAAKuT,UAAW,CAChB,IAAIlB,EAAOrS,KAAKuT,UAAUjB,UAC1B,IAAKD,EACD,OAAO,KAIX,GAHArS,KAAKuT,UAAY,KACjBvT,KAAKqT,SAAWhB,EAChBrS,KAAKwT,aACiB,MAAlBxT,KAAKsT,UACL,IAAK,IAAItN,KAAShG,KAAKgG,MACnBA,EAAMoM,MAAMtI,OAAO9J,KAAKsT,UACpC,CACA,GAAItT,KAAKoT,WAAapT,KAAKgG,MAAMzD,OAAQ,CACrC,IAAI1B,EAASb,KAAKqT,SAGlB,OAFsB,MAAlBrT,KAAKsT,YACLzS,EAAS,IAAI2D,EAAK3D,EAAOD,KAAMC,EAAO4D,SAAU5D,EAAO6D,UAAW7D,EAAO0B,OAAQ1B,EAAOsG,WAAWmD,OAAO,CAAC,CAAC2I,GAAcjT,KAAKsT,eAC5HzS,CACX,CACA,IAAImF,EAAQhG,KAAKgG,MAAMhG,KAAKoT,WAAYf,EAAOrM,EAAMoM,MAAME,UAC3D,GAAID,EAAM,CACNrS,KAAKoT,YAKL,IAAIrR,EAAQE,OAAOiC,OAAOjC,OAAOC,OAAO,MAAO8D,EAAM4M,OAAO7Q,OAC5DA,EAAM9B,EAASuB,QAAQrB,IAAM,IAAIsB,EAAY4Q,EAAMrM,EAAMrE,QAASqE,EAAMpE,OAAQoE,EAAMnE,WACtFmE,EAAM4M,OAAO7Q,MAAQA,CACzB,CACA,OAAO,IACX,CACA,aAAI0R,GACA,GAAIzT,KAAKuT,UACL,OAAO,EACX,IAAIlO,EAAMrF,KAAKgS,MAAMzP,OACrB,IAAK,IAAIkB,EAAIzD,KAAKoT,UAAW3P,EAAIzD,KAAKgG,MAAMzD,OAAQkB,IAC5CzD,KAAKgG,MAAMvC,GAAG3D,KAAOuF,IACrBA,EAAM0G,KAAK4F,IAAItM,EAAKrF,KAAKgG,MAAMvC,GAAG2O,MAAMqB,YAEhD,OAAOpO,CACX,CACA,MAAAyE,CAAOzE,GAEH,GADArF,KAAKsT,UAAYjO,EACbrF,KAAKuT,UACLvT,KAAKuT,UAAUzJ,OAAOzE,QAEtB,IAAK,IAAI5B,EAAIzD,KAAKoT,UAAW3P,EAAIzD,KAAKgG,MAAMzD,OAAQkB,IAChDzD,KAAKgG,MAAMvC,GAAG2O,MAAMtI,OAAOzE,EACvC,CACA,UAAAmO,GACI,IAAIE,EAAiB,IAAIC,GAAe3T,KAAK2Q,WACzChP,EAAU,KACViS,EAAU,KACV5O,EAAS,IAAIE,EAAW,IAAIS,EAAS3F,KAAKqT,SAAUrT,KAAKiS,OAAO,GAAGnS,KAAM,EAAG,MAAOyE,EAASuC,iBAAmBvC,EAASiJ,cAC5HtH,EAAM,IAAK,IAAIiN,EAAMU,IAAa,CAC9B,IAAkBC,EAAdnN,GAAQ,EACZ,GAAsB,MAAlB3G,KAAKsT,WAAqBtO,EAAOlF,MAAQE,KAAKsT,UAC9C3M,GAAQ,OAEP,GAAI+M,EAAeK,QAAQ/O,GAAS,CACrC,GAAIrD,EAAS,CACT,IAAIlB,EAAQkB,EAAQqR,OAAOgB,KAAKC,GAAKA,EAAEC,KAAKpU,MAAQkF,EAAOlF,MAAQmU,EAAEC,KAAKnU,IAAMiF,EAAOjF,IAAMkU,EAAE3N,MAAM3E,SACrG,GAAIlB,EACA,IAAK,IAAI8L,KAAK9L,EAAM6F,MAAM3E,QAAS,CAC/B,IAAI7B,EAAOyM,EAAEzM,KAAOW,EAAM4E,IAAKtF,EAAKwM,EAAExM,GAAKU,EAAM4E,IAC7CvF,GAAQkF,EAAOlF,MAAQC,GAAMiF,EAAOjF,KAAO4B,EAAQsQ,OAAO1C,KAAKhD,GAAKA,EAAEzM,KAAOC,GAAMwM,EAAExM,GAAKD,IAC1F6B,EAAQsQ,OAAO9N,KAAK,CAAErE,OAAMC,MACpC,CACR,CACA4G,GAAQ,CACZ,MACK,GAAIiN,IAAYC,EAAYM,GAAWP,EAAQ3B,OAAQjN,EAAOlF,KAAMkF,EAAOjF,KAC5E4G,EAAqB,GAAbkN,OAEP,IAAK7O,EAAOpE,KAAKsC,cAAgBiQ,EAAOnT,KAAKmT,KAAKnO,EAAQhF,KAAKgS,UAC/DhN,EAAOlF,KAAOkF,EAAOjF,KAAOoT,EAAKxR,SAAU,CACvCqD,EAAOtD,OACR0S,GAAYpP,GAGRrD,GACAA,EAAQyG,QACRwL,GACAA,EAAQxL,SAEhB,IAAIiM,EAAYX,EAAeY,WAAWtP,EAAOlF,KAAMqT,EAAKvR,QAC5D,GAA2B,mBAAhBuR,EAAKxR,QACZA,EAAU,IAAImR,GAAcK,EAAKvR,OAAQuR,EAAKxR,QAAS0S,EAAWrU,KAAKgG,MAAMzD,OAAQyC,EAAOlF,OAAQqT,EAAKtR,UAAWmD,EAAOtD,KAAMC,OAEhI,CACD,IAAIsQ,EAASsC,GAAYvU,KAAKiS,OAAQkB,EAAKxR,UACtCqD,EAAOlF,KAAOkF,EAAOjF,GAAK,CAAC,IAAIH,EAAMoF,EAAOlF,KAAMkF,EAAOjF,KAAO,KACjEkS,EAAO1P,QACPsQ,GAAYZ,IACZA,EAAO1P,QAAW4Q,EAAKxR,SACvB3B,KAAKgG,MAAM7B,KAAK,IAAIwO,GAAWQ,EAAKvR,OAAQqQ,EAAO1P,OAAS4Q,EAAKvR,OAAOmQ,WAAW/R,KAAKgS,MAAOwC,GAAeH,EAAWpC,GAASA,GAC5HkB,EAAKvR,OAAOmQ,WAAW,IAAKoB,EAAKxR,QAAUwR,EAAKxR,QAAQ0B,IAAIkJ,GAAK,IAAI3M,EAAM2M,EAAEzM,KAAOkF,EAAOlF,KAAMyM,EAAExM,GAAKiF,EAAOlF,OAAS,OAAQqT,EAAKtR,UAAWmD,EAAOtD,KAAMuQ,EAAO1P,OAAS0P,EAAO,GAAGnS,KAAOkF,EAAOlF,OAC1MqT,EAAKxR,QAEDsQ,EAAO1P,SACZqR,EAAU,CAAE3B,SAAQ7J,MAAO,EAAGgH,KAAMwE,IAFpCjN,GAAQ,CAGhB,CACJ,MACK,GAAIhF,IAAYmS,EAAQnS,EAAQoR,UAAU/N,OAC7B,IAAV8O,IACAA,EAAQ,IAAIlU,EAAMoF,EAAOlF,KAAMkF,EAAOjF,KACtC+T,EAAMhU,KAAOgU,EAAM/T,IAAI,CACvB,IAAIiK,EAAOrI,EAAQsQ,OAAO1P,OAAS,EAC/ByH,GAAQ,GAAKrI,EAAQsQ,OAAOjI,GAAMjK,IAAM+T,EAAMhU,KAC9C6B,EAAQsQ,OAAOjI,GAAQ,CAAElK,KAAM6B,EAAQsQ,OAAOjI,GAAMlK,KAAMC,GAAI+T,EAAM/T,IAEpE4B,EAAQsQ,OAAO9N,KAAK2P,EAC5B,CAEJ,GAAInN,GAAS3B,EAAOiC,aACZtF,GACAA,EAAQyG,QACRwL,GACAA,EAAQxL,aAGZ,MACQpD,EAAOkC,eADN,CAGL,IAAKlC,EAAOoB,SACR,MAAMF,EACV,GAAIvE,OAAcA,EAAQyG,MAAO,CAC7B,IAAI6J,EAASsC,GAAYvU,KAAKiS,OAAQtQ,EAAQsQ,QAC1CA,EAAO1P,SACPsQ,GAAYZ,GACZjS,KAAKgG,MAAMsI,OAAO3M,EAAQ0E,MAAO,EAAG,IAAIsM,GAAWhR,EAAQC,OAAQD,EAAQC,OAAOmQ,WAAW/R,KAAKgS,MAAOwC,GAAe7S,EAAQqR,OAAQf,GAASA,GAAStQ,EAAQsQ,OAAO5O,IAAIkJ,GAAK,IAAI3M,EAAM2M,EAAEzM,KAAO6B,EAAQ0G,MAAOkE,EAAExM,GAAK4B,EAAQ0G,QAAS1G,EAAQE,UAAWF,EAAQiR,OAAQX,EAAO,GAAGnS,QAE7R6B,EAAUA,EAAQyN,IACtB,CACIwE,OAAcA,EAAQxL,QACtBwL,EAAUA,EAAQxE,KAC1B,CAER,CACJ,EAEJ,SAAS+E,GAAWP,EAAS9T,EAAMC,GAC/B,IAAK,IAAI+T,KAASF,EAAS,CACvB,GAAIE,EAAMhU,MAAQC,EACd,MACJ,GAAI+T,EAAM/T,GAAKD,EACX,OAAOgU,EAAMhU,MAAQA,GAAQgU,EAAM/T,IAAMA,EAAK,EAAqB,CAC3E,CACA,OAAO,CACX,CAGA,SAAS0U,GAASC,EAAKhJ,EAAQC,EAAM/B,EAAOlF,EAAW0M,GACnD,GAAI1F,EAASC,EAAM,CACf,IAAI7L,EAAO4U,EAAIhN,OAAOgE,EAAS,GAC/B9B,EAAMzF,KAAKuQ,EAAIjJ,MAAMC,EAAQC,EAAM7L,IACnC4E,EAAUP,KAAKrE,EAAOsR,EAC1B,CACJ,CAMA,SAASgD,GAAYpP,GACjB,IAAIzB,KAAEA,GAASyB,EAAQwJ,EAAQ,GAC3B9G,EAASnE,EAAK4C,QAAQuB,OAE1B,GACI8G,EAAMrK,KAAKa,EAAOqB,OAClBrB,EAAOoB,gBACDpB,EAAOtD,MAEjB,IAAIyI,EAAOnF,EAAOtD,KAAM+B,EAAI0G,EAAK1F,SAASrB,QAAQsE,GAC9CgN,EAAMvK,EAAK1F,SAAShB,GAAImI,EAAI8I,EAAIhN,OAAQiN,EAAW,CAAClR,GAiBxD0G,EAAK1F,SAAShB,GAdd,SAASxC,EAAMyK,EAAQC,EAAM/K,EAAMgU,EAAarS,EAAQsS,GACpD,IAAIC,EAAUtG,EAAMqG,GAChBpQ,EAAW,GAAIC,EAAY,GAC/B+P,GAASC,EAAKhJ,EAAQoJ,EAASrQ,EAAUC,EAAWkQ,GACpD,IAAI9U,EAAO8L,EAAEkJ,EAAU,GAAI/U,EAAK6L,EAAEkJ,EAAU,GAC5CH,EAASxQ,KAAKM,EAASlC,QACvB,IAAI0L,EAAQ4G,EACN5T,EAAM6T,EAAU,EAAGlJ,EAAEkJ,EAAU,GAAIJ,EAAIjP,IAAI5B,MAAM+H,EAAEkJ,IAAWhV,EAAMC,EAAKD,EAAM+U,EAAW,GAC1FtR,EAAKuK,SAIX,OAHArJ,EAASN,KAAK8J,GACdvJ,EAAUP,KAAKrE,EAAO8U,GACtBH,GAASC,EAAK9I,EAAEkJ,EAAU,GAAInJ,EAAMlH,EAAUC,EAAWkQ,GAClD,IAAIpQ,EAAK5D,EAAM6D,EAAUC,EAAWnC,EAC/C,CACmBtB,CAAM,EAAG2K,EAAErJ,OAAQ5B,EAASgD,KAAM,EAAG+Q,EAAInS,OAAQiM,EAAMjM,OAAS,GAEnF,IAAK,IAAI8D,KAASsO,EAAU,CACxB,IAAIjT,EAAOsD,EAAOtD,KAAK+C,SAAS4B,GAAQhB,EAAML,EAAOtD,KAAKgD,UAAU2B,GACpErB,EAAO8J,MAAM,IAAInJ,EAASjE,EAAM2D,EAAML,EAAOlF,KAAMuG,EAAOrB,EAAOU,OACrE,CACJ,CACA,MAAMqP,GACF,WAAAlV,CAAY0G,EAAMyJ,GACdhQ,KAAKgQ,OAASA,EACdhQ,KAAKqS,MAAO,EACZrS,KAAKgF,OAASuB,EAAKvB,OAAOT,EAASuC,iBAAmBvC,EAASiJ,aACnE,CAEA,MAAAhI,CAAOH,GACH,IAAIL,OAAEA,GAAWhF,KAAMgO,EAAI3I,EAAMrF,KAAKgQ,OACtC,MAAQhQ,KAAKqS,MAAQrN,EAAOlF,KAAOkO,GAC/B,GAAIhJ,EAAOjF,IAAMsF,GAAOL,EAAO2B,MAAMqH,EAAG,EAAGzJ,EAAS2H,eAAiB3H,EAAS6I,qBACzE,MAAIpI,EAAOjF,IAAMsF,GAMlB,MALKL,EAAO0D,MAAK,KACb1I,KAAKqS,MAAO,EAKpB,CAER,CACA,OAAA0B,CAAQ/O,GAEJ,GADAhF,KAAKwF,OAAOR,EAAOlF,OACdE,KAAKqS,MAAQrS,KAAKgF,OAAOlF,KAAOE,KAAKgQ,QAAUhL,EAAOlF,MAAQE,KAAKgF,OAAOtD,KAC3E,IAAK,IAAIA,EAAO1B,KAAKgF,OAAOtD,OAAQ,CAChC,GAAIA,GAAQsD,EAAOtD,KACf,OAAO,EACX,KAAIA,EAAK+C,SAASlC,QAA+B,GAArBb,EAAKgD,UAAU,IAAWhD,EAAK+C,SAAS,aAAcD,GAG9E,MAFA9C,EAAOA,EAAK+C,SAAS,EAG7B,CAEJ,OAAO,CACX,EAEJ,IAAAuQ,GAAA,MACI,WAAAnV,CAAY8Q,GACR,IAAIlJ,EAIJ,GAHAzH,KAAK2Q,UAAYA,EACjB3Q,KAAKiV,MAAQ,EACbjV,KAAKkV,MAAQ,EACTvE,EAAUpO,OAAQ,CAClB,IAAI4S,EAAQnV,KAAKoV,QAAUzE,EAAU,GACrC3Q,KAAKiV,MAAiD,QAAxCxN,EAAK0N,EAAMzT,KAAKoB,KAAKmQ,WAAkC,IAAPxL,EAAgBA,EAAK0N,EAAMpV,GACzFC,KAAKgG,MAAQ,IAAI+O,GAAgBI,EAAMzT,MAAOyT,EAAMnF,OACxD,MAEIhQ,KAAKoV,QAAUpV,KAAKgG,MAAQ,IAEpC,CACA,OAAA+N,CAAQxQ,GACJ,KAAOvD,KAAKoV,SAAW7R,EAAKzD,MAAQE,KAAKiV,OACrCjV,KAAKqV,WACT,OAAOrV,KAAKoV,SAAWpV,KAAKoV,QAAQtV,MAAQyD,EAAKzD,MAAQE,KAAKiV,OAAS1R,EAAKxD,IAAMC,KAAKgG,MAAM+N,QAAQxQ,EACzG,CACA,QAAA8R,GACI,IAAI5N,EAEJ,GADAzH,KAAKkV,QACDlV,KAAKkV,OAASlV,KAAK2Q,UAAUpO,OAC7BvC,KAAKoV,QAAUpV,KAAKgG,MAAQ,SAE3B,CACD,IAAIkO,EAAOlU,KAAKoV,QAAUpV,KAAK2Q,UAAU3Q,KAAKkV,OAC9ClV,KAAKiV,MAAgD,QAAvCxN,EAAKyM,EAAKxS,KAAKoB,KAAKmQ,WAAkC,IAAPxL,EAAgBA,EAAKyM,EAAKnU,GACvFC,KAAKgG,MAAQ,IAAI+O,GAAgBb,EAAKxS,MAAOwS,EAAKlE,OACtD,CACJ,CACA,UAAAsE,CAAWjP,EAAKzD,GACZ,IAAI6F,EACJ,IAAI5G,EAAS,GACb,GAAIb,KAAKgG,MAAO,CACZhG,KAAKgG,MAAMhB,OAAOQ,OAAOH,EAAK,GAC9B,IAAK,IAAIA,EAAMrF,KAAKgG,MAAMhB,OAAOzB,KAAM8B,EAAKA,EAAMA,EAAIe,OAAQ,CAC1D,IAAIE,EAA4B,QAAnBmB,EAAKpC,EAAI3D,YAAyB,IAAP+F,OAAgB,EAASA,EAAG3E,KAAK7C,EAASuB,SAClF,GAAI8E,GAASA,EAAM1E,QAAUA,EACzB,IAAK,IAAI6B,EAAIzD,KAAKkV,MAAOzR,EAAIzD,KAAK2Q,UAAUpO,OAAQkB,IAAK,CACrD,IAAIyQ,EAAOlU,KAAK2Q,UAAUlN,GAC1B,GAAIyQ,EAAKpU,MAAQuF,EAAItF,GACjB,MACAmU,EAAKxS,MAAQ1B,KAAKoV,QAAQ1T,MAC1Bb,EAAOsD,KAAK,CACR+P,OACA7O,IAAKA,EAAIvF,KAAOoU,EAAKlE,OACrB1J,SAEZ,CAER,CACJ,CACA,OAAOzF,CACX,GAEJ,SAAS0T,GAAYe,EAAOrD,GACxB,IAAIpG,EAAO,KAAM0J,EAAUtD,EAC3B,IAAK,IAAIxO,EAAI,EAAGsG,EAAI,EAAGtG,EAAI6R,EAAM/S,OAAQkB,IAAK,CAC1C,IAAI+R,EAAUF,EAAM7R,EAAI,GAAG1D,GAAI0V,EAAQH,EAAM7R,GAAG3D,KAChD,KAAOiK,EAAIwL,EAAQhT,OAAQwH,IAAK,CAC5B,IAAIwC,EAAIgJ,EAAQxL,GAChB,GAAIwC,EAAEzM,MAAQ2V,EACV,MACAlJ,EAAExM,IAAMyV,IAEP3J,IACD0J,EAAU1J,EAAOoG,EAAOxG,SACxBc,EAAEzM,KAAO0V,GACT3J,EAAK9B,GAAK,IAAInK,EAAM2M,EAAEzM,KAAM0V,GACxBjJ,EAAExM,GAAK0V,GACP5J,EAAKyC,OAAOvE,EAAI,EAAG,EAAG,IAAInK,EAAM6V,EAAOlJ,EAAExM,MAExCwM,EAAExM,GAAK0V,EACZ5J,EAAK9B,KAAO,IAAInK,EAAM6V,EAAOlJ,EAAExM,IAG/B8L,EAAKyC,OAAOvE,IAAK,GAEzB,CACJ,CACA,OAAOwL,CACX,CACA,SAASG,GAAiBC,EAAG/J,EAAG9L,EAAMC,GAClC,IAAI6V,EAAK,EAAGC,EAAK,EAAGC,GAAM,EAAOC,GAAM,EAAO1Q,GAAM,IAChDxE,EAAS,GACb,OAAS,CACL,IAAImV,EAAQJ,GAAMD,EAAEpT,OAAS,IAAMuT,EAAMH,EAAEC,GAAI7V,GAAK4V,EAAEC,GAAI9V,KACtDmW,EAAQJ,GAAMjK,EAAErJ,OAAS,IAAMwT,EAAMnK,EAAEiK,GAAI9V,GAAK6L,EAAEiK,GAAI/V,KAC1D,GAAIgW,GAAOC,EAAK,CACZ,IAAI1N,EAAQ0D,KAAKC,IAAI3G,EAAKvF,GAAOwI,EAAMyD,KAAK4F,IAAIqE,EAAOC,EAAOlW,GAC1DsI,EAAQC,GACRzH,EAAOsD,KAAK,IAAIvE,EAAMyI,EAAOC,GACrC,CAEA,GADAjD,EAAM0G,KAAK4F,IAAIqE,EAAOC,GACX,KAAP5Q,EACA,MACA2Q,GAAS3Q,IACJyQ,GAGDA,GAAM,EACNF,KAHAE,GAAM,GAMVG,GAAS5Q,IACJ0Q,GAGDA,GAAM,EACNF,KAHAE,GAAM,EAMlB,CACA,OAAOlV,CACX,CAIA,SAAS2T,GAAexB,EAAQf,GAC5B,IAAIpR,EAAS,GACb,IAAK,IAAIwE,IAAEA,EAAGiB,MAAEA,EAAK4N,KAAEA,KAAUlB,EAAQ,CACrC,IAAIrK,EAAWtD,GAAOiB,EAAM3E,QAAU2E,EAAM3E,QAAQ,GAAG7B,KAAO,GAAIiJ,EAASJ,EAAWrC,EAAM5E,KAAKa,OAC7FzC,EAAOiM,KAAKC,IAAIkI,EAAKpU,KAAM6I,GAAW5I,EAAKgM,KAAK4F,IAAIuC,EAAKnU,GAAIgJ,GACjE,GAAIzC,EAAM3E,QAAS,CACf,IACIoP,EAAU2E,GAAiBzD,EADjB3L,EAAM3E,QAAQ0B,IAAIkJ,GAAK,IAAI3M,EAAM2M,EAAEzM,KAAOuF,EAAKkH,EAAExM,GAAKsF,IACpBvF,EAAMC,GACtD,IAAK,IAAI0D,EAAI,EAAG4B,EAAMvF,GAAO2D,IAAK,CAC9B,IAAIuG,EAAOvG,GAAKsN,EAAQxO,OAAQ+F,EAAM0B,EAAOjK,EAAKgR,EAAQtN,GAAG3D,KAG7D,GAFIwI,EAAMjD,GACNxE,EAAOsD,KAAK,IAAImM,EAAajL,EAAKiD,EAAKhC,EAAM5E,MAAOiH,EAAUuL,EAAKpU,MAAQuF,GAAO6O,EAAK3D,UAAW2D,EAAKnU,IAAMuI,GAAO4L,EAAK1D,UACzHxG,EACA,MACJ3E,EAAM0L,EAAQtN,GAAG1D,EACrB,CACJ,MAEIc,EAAOsD,KAAK,IAAImM,EAAaxQ,EAAMC,EAAIuG,EAAM5E,MAAOiH,EAAUuL,EAAKpU,MAAQ6I,GAAYuL,EAAK3D,UAAW2D,EAAKnU,IAAMgJ,GAAUmL,EAAK1D,SAEzI,CACA,OAAO3P,CACX,CCppEA,MAAMqV,GACF,aAAOhU,CAAOtB,EAAMS,EAAOvB,EAAMqW,EAAY7N,GAEzC,OAAO,IAAI4N,GAAetV,EAAMS,EAAOvB,EAD3BqW,GAAcA,GAAc,GAAKvV,GAAQS,GAAS,GAAM,EACjBiH,EAAK,GAAI,GAChE,CACA,WAAAzI,CAAYe,EAEZS,EAAOvB,EAAMsW,EAAM9N,EAAK7D,EAAUC,GAC9B1E,KAAKY,KAAOA,EACZZ,KAAKqB,MAAQA,EACbrB,KAAKF,KAAOA,EACZE,KAAKoW,KAAOA,EACZpW,KAAKsI,IAAMA,EACXtI,KAAKyE,SAAWA,EAChBzE,KAAK0E,UAAYA,EACjB1E,KAAKqW,SAAW,CAAC,CAACpW,EAASqB,YAAa8U,GAC5C,CACA,QAAAE,CAASrI,EAAO5I,GACR4I,EAAMnL,KAAK7C,EAASqB,cAAgBtB,KAAKoW,OACzCnI,EAAQ,IAAIzJ,EAAKyJ,EAAMrN,KAAMqN,EAAMxJ,SAAUwJ,EAAMvJ,UAAWuJ,EAAM1L,OAAQvC,KAAKqW,WACrFrW,KAAKyE,SAASN,KAAK8J,GACnBjO,KAAK0E,UAAUP,KAAKkB,EACxB,CACA,MAAAyI,CAAOnG,EAASW,EAAMtI,KAAKsI,KACvB,IAAI0B,EAAOhK,KAAKyE,SAASlC,OAAS,EAGlC,OAFIyH,GAAQ,IACR1B,EAAMyD,KAAKC,IAAI1D,EAAKtI,KAAK0E,UAAUsF,GAAQhK,KAAKyE,SAASuF,GAAMzH,OAASvC,KAAKF,OAC1E,IAAI0E,EAAKmD,EAAQ9D,MAAM7D,KAAKY,MAAOZ,KAAKyE,SAAUzE,KAAK0E,UAAW4D,EAAMtI,KAAKF,MAAMsH,QAAQ,CAC9FE,SAAU,CAAC7C,EAAUC,EAAWnC,IAAW,IAAIiC,EAAK7D,EAASgD,KAAMc,EAAUC,EAAWnC,EAAQvC,KAAKqW,WAE7G,EAEJ,IAAIE,IACJ,SAAWA,GACPA,EAAKA,EAAe,SAAI,GAAK,WAC7BA,EAAKA,EAAgB,UAAI,GAAK,YAC9BA,EAAKA,EAAiB,WAAI,GAAK,aAC/BA,EAAKA,EAAiB,WAAI,GAAK,aAC/BA,EAAKA,EAAqB,eAAI,GAAK,iBACnCA,EAAKA,EAAiB,WAAI,GAAK,aAC/BA,EAAKA,EAAkB,YAAI,GAAK,cAChCA,EAAKA,EAAe,SAAI,GAAK,WAC7BA,EAAKA,EAAkB,YAAI,GAAK,cAChCA,EAAKA,EAAkB,YAAI,IAAM,cACjCA,EAAKA,EAAkB,YAAI,IAAM,cACjCA,EAAKA,EAAkB,YAAI,IAAM,cACjCA,EAAKA,EAAkB,YAAI,IAAM,cACjCA,EAAKA,EAAkB,YAAI,IAAM,cACjCA,EAAKA,EAAqB,eAAI,IAAM,iBACpCA,EAAKA,EAAqB,eAAI,IAAM,iBACpCA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAoB,cAAI,IAAM,gBACnCA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAmB,aAAI,IAAM,eAClCA,EAAKA,EAAiC,2BAAI,IAAM,6BAEhDA,EAAKA,EAAa,OAAI,IAAM,SAC5BA,EAAKA,EAAa,OAAI,IAAM,SAC5BA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAqB,eAAI,IAAM,iBACpCA,EAAKA,EAAW,KAAI,IAAM,OAC1BA,EAAKA,EAAY,MAAI,IAAM,QAC3BA,EAAKA,EAAiB,WAAI,IAAM,aAChCA,EAAKA,EAAc,QAAI,IAAM,UAC7BA,EAAKA,EAAc,QAAI,IAAM,UAC7BA,EAAKA,EAA4B,sBAAI,IAAM,wBAC3CA,EAAKA,EAAe,SAAI,IAAM,WAE9BA,EAAKA,EAAiB,WAAI,IAAM,aAChCA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAmB,aAAI,IAAM,eAClCA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAe,SAAI,IAAM,WAC9BA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAgB,UAAI,IAAM,YAC/BA,EAAKA,EAAU,IAAI,IAAM,KAC5B,CA/CD,CA+CGA,KAASA,GAAO,CAAA,IAKnB,MAAMC,GAIF,WAAA3W,CAIAwI,EAIAoO,GACIzW,KAAKqI,MAAQA,EACbrI,KAAKyW,QAAUA,EAIfzW,KAAK0W,MAAQ,GAIb1W,KAAK2W,QAAU,EACnB,EAKJ,MAAMC,GACF,WAAA/W,GAIIG,KAAK6W,KAAO,GAKZ7W,KAAK8W,WAAa,EAIlB9W,KAAK+W,QAAU,EAIf/W,KAAKoI,MAAQ,EAMbpI,KAAKgX,QAAU,GAKfhX,KAAKqF,IAAM,EAIXrF,KAAKiX,OAAS,EAIdjX,KAAK0I,MAAO,CAChB,CAIA,OAAAwO,GACQlX,KAAK+W,QAAU/W,KAAKqF,KACpBrF,KAAKmX,cACb,CAIA,YAAAA,GACI,IAAIC,EAASpX,KAAKqX,UAAUrX,KAAK+W,SACjC/W,KAAKiX,OAASjX,KAAKsX,YAAYF,EAAQpX,KAAKqF,IAAKrF,KAAKiX,QACtDjX,KAAKqF,IAAM+R,EACXpX,KAAK0I,KAAO0O,GAAUpX,KAAK6W,KAAKtU,QAAS,EAAKvC,KAAK6W,KAAKU,WAAWH,EACvE,CAMA,SAAAC,CAAUvX,GAAQ,OAAOuX,GAAUrX,KAAK6W,KAAM/W,EAAO,CAIrD,KAAA0X,CAAMX,GAKF,IAJA7W,KAAK6W,KAAOA,EACZ7W,KAAK8W,WAAa9W,KAAK+W,QAAU/W,KAAKqF,IAAMrF,KAAKiX,OAAS,EAC1DjX,KAAKmX,eACLnX,KAAKoI,MAAQ,EACNpI,KAAKgX,QAAQzU,QAChBvC,KAAKgX,QAAQ5M,KACrB,CAOA,QAAAqN,CAAS1X,GACLC,KAAK+W,QAAUhX,EACfC,KAAK8W,WAAa9W,KAAKsX,YAAYvX,EAAIC,KAAKqF,IAAKrF,KAAKiX,OAC1D,CAIA,cAAAS,CAAeT,GACXjX,KAAK8W,WAAaG,EAClBjX,KAAK+W,QAAU/W,KAAK2X,WAAWV,EACnC,CAMA,SAAAW,CAAUC,GACN7X,KAAKgX,QAAQ7S,KAAK0T,EACtB,CAKA,WAAAP,CAAYvX,EAAID,EAAO,EAAGmX,EAAS,GAC/B,IAAK,IAAIxT,EAAI3D,EAAM2D,EAAI1D,EAAI0D,IACvBwT,GAAqC,GAA3BjX,KAAK6W,KAAKU,WAAW9T,GAAU,EAAIwT,EAAS,EAAI,EAC9D,OAAOA,CACX,CAIA,UAAAU,CAAWG,GACP,IAAIrU,EAAI,EACR,IAAK,IAAIwT,EAAS,EAAGxT,EAAIzD,KAAK6W,KAAKtU,QAAU0U,EAASa,EAAMrU,IACxDwT,GAAqC,GAA3BjX,KAAK6W,KAAKU,WAAW9T,GAAU,EAAIwT,EAAS,EAAI,EAC9D,OAAOxT,CACX,CAIA,KAAAsU,GACI,IAAK/X,KAAK8W,WACN,OAAO9W,KAAK6W,KAChB,IAAIhW,EAAS,GACb,IAAK,IAAI4C,EAAI,EAAGA,EAAIzD,KAAK+W,QAAStT,IAC9B5C,GAAU,IACd,OAAOA,EAASb,KAAK6W,KAAKpL,MAAMzL,KAAK+W,QACzC,EAEJ,SAASiB,GAAYC,EAAIC,EAAIC,GACzB,GAAIA,EAAK9S,KAAO8S,EAAKtB,KAAKtU,QACrB0V,GAAMC,EAAGE,OAASD,EAAKlB,QAAUiB,EAAG1J,MAAM2J,EAAK/P,MAAQ,GAAG/G,MAAQ8W,EAAKrB,WACxE,OAAO,EACX,GAAIqB,EAAKlB,QAAUkB,EAAKrB,WAAa,EACjC,OAAO,EACX,IAAIvO,GAAQ0P,EAAGrX,MAAQ2V,GAAK8B,YAAcC,GAAgBC,IAAcJ,EAAMD,GAAI,GAClF,OAAO3P,EAAO,IACT0P,EAAGrX,MAAQ2V,GAAKiC,YAAcC,GAAiBN,EAAMD,GAAI,GAAS,IACnEC,EAAKtB,KAAKU,WAAWY,EAAK9S,IAAMkD,EAAO,IAAM0P,EAAG5W,KACxD,CACA,MAAMqX,GAAoB,CACtB,CAACnC,GAAKoC,YAAW,CAACV,EAAIC,EAAIC,IACL,IAAbA,EAAKzP,OAETyP,EAAKnB,QAAQ7S,KAAK0T,GAAItB,GAAKqC,UAAWV,EAAGW,UAAYV,EAAK9S,IAAK6S,EAAGW,UAAYV,EAAK9S,IAAM,IACzF8S,EAAKV,SAASU,EAAK9S,KAAOyT,GAAMX,EAAKtB,KAAKU,WAAWY,EAAK9S,IAAM,IAAM,EAAI,IAC1E4S,EAAG3P,IAAM4P,EAAGW,UAAYV,EAAKtB,KAAKtU,QAC3B,GAEX,CAACgU,GAAKwC,UAAS,CAACd,EAAIe,EAAKb,MACjBA,EAAKlB,OAASkB,EAAKrB,WAAamB,EAAG5W,OAAS8W,EAAKzP,MAAO,KAE5DyP,EAAKT,eAAeS,EAAKrB,WAAamB,EAAG5W,QAClC,GAEX,CAACkV,GAAK8B,aAAcL,GACpB,CAACzB,GAAKiC,YAAaR,GACnB,CAACzB,GAAK0C,UAAS,KAAY,GAE/B,SAASH,GAAMlU,GAAM,OAAa,IAANA,GAAkB,GAANA,GAAiB,IAANA,GAAkB,IAANA,CAAU,CACzE,SAASyS,GAAUc,EAAM1U,EAAI,GACzB,KAAOA,EAAI0U,EAAK5V,QAAUuW,GAAMX,EAAKZ,WAAW9T,KAC5CA,IACJ,OAAOA,CACX,CACA,SAASyV,GAAcf,EAAM1U,EAAG1D,GAC5B,KAAO0D,EAAI1D,GAAM+Y,GAAMX,EAAKZ,WAAW9T,EAAI,KACvCA,IACJ,OAAOA,CACX,CACA,SAAS0V,GAAahB,GAClB,GAAiB,IAAbA,EAAKzP,MAA2B,KAAbyP,EAAKzP,KACxB,OAAO,EACX,IAAIrD,EAAM8S,EAAK9S,IAAM,EACrB,KAAOA,EAAM8S,EAAKtB,KAAKtU,QAAU4V,EAAKtB,KAAKU,WAAWlS,IAAQ8S,EAAKzP,MAC/DrD,IACJ,GAAIA,EAAM8S,EAAK9S,IAAM,EACjB,OAAO,EACX,GAAiB,IAAb8S,EAAKzP,KACL,IAAK,IAAIjF,EAAI4B,EAAK5B,EAAI0U,EAAKtB,KAAKtU,OAAQkB,IACpC,GAA+B,IAA3B0U,EAAKtB,KAAKU,WAAW9T,GACrB,OAAO,EACnB,OAAO4B,CACX,CACA,SAAS+T,GAAajB,GAClB,OAAoB,IAAbA,EAAKzP,MAAuB,EAA2C,IAAtCyP,EAAKtB,KAAKU,WAAWY,EAAK9S,IAAM,GAAW,EAAI,CAC3F,CACA,SAASoT,GAAiBN,EAAMD,EAAImB,GAChC,GAAiB,IAAblB,EAAKzP,MAA2B,IAAbyP,EAAKzP,MAA2B,IAAbyP,EAAKzP,KAC3C,OAAO,EACX,IAAI4Q,EAAQ,EACZ,IAAK,IAAIjU,EAAM8S,EAAK9S,IAAM,EAAGA,EAAM8S,EAAKtB,KAAKtU,OAAQ8C,IAAO,CACxD,IAAIT,EAAKuT,EAAKtB,KAAKU,WAAWlS,GAC9B,GAAIT,GAAMuT,EAAKzP,KACX4Q,SACC,IAAKR,GAAMlU,GACZ,OAAO,CACf,CAEA,OAAIyU,GAAyB,IAAblB,EAAKzP,MAAc6Q,GAAkBpB,IAAQ,GAAMA,EAAK/P,OAAS8P,EAAG1J,MAAMjM,QACtF2V,EAAGtW,OAAO4X,iBAAiBpW,QAAQqW,GAAkBC,gBAAiB,GAEnEJ,EAAQ,GADJ,EACa,CAC5B,CACA,SAASK,GAAOzB,EAAItX,GAChB,IAAK,IAAI6C,EAAIyU,EAAG1J,MAAMjM,OAAS,EAAGkB,GAAK,EAAGA,IACtC,GAAIyU,EAAG1J,MAAM/K,GAAG7C,MAAQA,EACpB,OAAO,EACf,OAAO,CACX,CACA,SAAS2X,GAAaJ,EAAMD,EAAImB,GAC5B,OAAqB,IAAblB,EAAKzP,MAA2B,IAAbyP,EAAKzP,MAA2B,IAAbyP,EAAKzP,MAC9CyP,EAAK9S,KAAO8S,EAAKtB,KAAKtU,OAAS,IAAKuW,GAAMX,EAAKtB,KAAKU,WAAWY,EAAK9S,IAAM,QACzEgU,GAAYM,GAAOzB,EAAI3B,GAAKiC,aAAeL,EAAKd,UAAUc,EAAK9S,IAAM,GAAK8S,EAAKtB,KAAKtU,SAAc,EAAJ,CACxG,CACA,SAAS+V,GAAcH,EAAMD,EAAImB,GAC7B,IAAIhU,EAAM8S,EAAK9S,IAAKqD,EAAOyP,EAAKzP,KAChC,KACQA,GAAQ,IAAMA,GAAQ,IADrB,CAKL,GAHIrD,IAGAA,GAAO8S,EAAKtB,KAAKtU,OACjB,OAAO,EACXmG,EAAOyP,EAAKtB,KAAKU,WAAWlS,EAChC,CACA,OAAIA,GAAO8S,EAAK9S,KAAOA,EAAM8S,EAAK9S,IAAM,GAC3B,IAARqD,GAAsB,IAARA,GACdrD,EAAM8S,EAAKtB,KAAKtU,OAAS,IAAMuW,GAAMX,EAAKtB,KAAKU,WAAWlS,EAAM,KACjEgU,IAAaM,GAAOzB,EAAI3B,GAAK8B,eACxBF,EAAKd,UAAUhS,EAAM,IAAM8S,EAAKtB,KAAKtU,QAAU8C,EAAM8S,EAAK9S,IAAM,GAAkB,IAAb8S,EAAKzP,OACxE,EACJrD,EAAM,EAAI8S,EAAK9S,GAC1B,CACA,SAASuU,GAAazB,GAClB,GAAiB,IAAbA,EAAKzP,KACL,OAAO,EACX,IAAIrD,EAAM8S,EAAK9S,IAAM,EACrB,KAAOA,EAAM8S,EAAKtB,KAAKtU,QAAuC,IAA7B4V,EAAKtB,KAAKU,WAAWlS,IAClDA,IACJ,GAAIA,EAAM8S,EAAKtB,KAAKtU,QAAuC,IAA7B4V,EAAKtB,KAAKU,WAAWlS,GAC/C,OAAO,EACX,IAAIkD,EAAOlD,EAAM8S,EAAK9S,IACtB,OAAOkD,EAAO,GAAI,EAAKA,CAC3B,CACA,SAASgR,GAAkBpB,GACvB,GAAiB,IAAbA,EAAKzP,MAA2B,IAAbyP,EAAKzP,MAAyByP,EAAKlB,QAAUkB,EAAKrB,WAAa,EAClF,OAAO,EACX,IAAIzR,EAAM8S,EAAK9S,IAAM,EACrB,KAAOA,EAAM8S,EAAKtB,KAAKtU,QAAU4V,EAAKtB,KAAKU,WAAWlS,IAAQ8S,EAAKzP,MAC/DrD,IACJ,IAAIiD,EAAMjD,EACV,KAAOA,EAAM8S,EAAKtB,KAAKtU,QAAUuW,GAAMX,EAAKtB,KAAKU,WAAWlS,KACxDA,IACJ,OAAOA,GAAO8S,EAAKtB,KAAKtU,OAAS+F,GAAM,CAC3C,CACA,MAAMuR,GAAY,WAAYC,GAAa,MAAOC,GAAgB,MAC5DC,GAAiB,CACnB,CAAC,oCAAqC,6BACtC,CAAC,WAAYF,IACb,CAAC,UAAWC,IACZ,CAAC,cAAe,KAChB,CAAC,kBAAmB,SACpB,CAAC,gYAAiYF,IAClY,CAAC,mHAAoHA,KAEzH,SAASI,GAAY9B,EAAMa,EAAKK,GAC5B,GAAiB,IAAblB,EAAKzP,KACL,OAAO,EACX,IAAIwR,EAAO/B,EAAKtB,KAAKpL,MAAM0M,EAAK9S,KAChC,IAAK,IAAI5B,EAAI,EAAGyJ,EAAI8M,GAAezX,QAAU8W,EAAW,EAAI,GAAI5V,EAAIyJ,EAAGzJ,IACnE,GAAIuW,GAAevW,GAAG,GAAGoB,KAAKqV,GAC1B,OAAOzW,EACf,OAAO,CACX,CACA,SAAS0W,GAAchC,EAAM9S,GACzB,IAAI+U,EAAcjC,EAAKb,YAAYjS,EAAK8S,EAAK9S,IAAK8S,EAAKlB,QACnDxU,EAAU0V,EAAKd,UAAUhS,GACzBgV,EAAWlC,EAAKb,YAAY7U,EAAS4C,EAAK+U,GAC9C,OAAOC,GAAYD,EAAc,GAAK3X,GAAW0V,EAAKtB,KAAKtU,OAAS6X,EAAc,EAAIC,CAC1F,CACA,SAASC,GAAY5D,EAAO5W,EAAMC,GAC9B,IAAIiK,EAAO0M,EAAMnU,OAAS,EACtByH,GAAQ,GAAK0M,EAAM1M,GAAMjK,IAAMD,GAAQ4W,EAAM1M,GAAMpJ,MAAQ2V,GAAKgE,SAChE7D,EAAM1M,GAAMjK,GAAKA,EAEjB2W,EAAMvS,KAAK0T,GAAItB,GAAKgE,SAAUza,EAAMC,GAC5C,CAKA,MAAMya,GAAsB,CACxBC,mBAAe3Z,EACf,YAAA4Z,CAAaxC,EAAIC,GACb,IAAIhO,EAAOgO,EAAKrB,WAAa,EAC7B,GAAIqB,EAAKlB,OAAS9M,EACd,OAAO,EACX,IAAI9B,EAAQ8P,EAAKR,WAAWxN,GACxBrK,EAAOoY,EAAGW,UAAYxQ,EAAOtI,EAAKmY,EAAGW,UAAYV,EAAKtB,KAAKtU,OAC3DmU,EAAQ,GAAIiE,EAAe,GAE/B,IADAL,GAAY5D,EAAO5W,EAAMC,GAClBmY,EAAG0C,YAAczC,EAAK/P,OAAS8P,EAAG1J,MAAMjM,QAC3C,GAAI4V,EAAK9S,KAAO8S,EAAKtB,KAAKtU,OAAQ,CAC9B+X,GAAYK,EAAczC,EAAGW,UAAY,EAAGX,EAAGW,WAC/C,IAAK,IAAI5E,KAAKkE,EAAKnB,QACf2D,EAAaxW,KAAK8P,EAC1B,KACK,IAAIkE,EAAKlB,OAAS9M,EACnB,MAEC,CACD,GAAIwQ,EAAapY,OAAQ,CACrB,IAAK,IAAI0R,KAAK0G,EACN1G,EAAErT,MAAQ2V,GAAKgE,SACfD,GAAY5D,EAAOzC,EAAEnU,KAAMmU,EAAElU,IAE7B2W,EAAMvS,KAAK8P,GAEnB0G,EAAe,EACnB,CACAL,GAAY5D,EAAOwB,EAAGW,UAAY,EAAGX,EAAGW,WACxC,IAAK,IAAI5E,KAAKkE,EAAKnB,QACfN,EAAMvS,KAAK8P,GACflU,EAAKmY,EAAGW,UAAYV,EAAKtB,KAAKtU,OAC9B,IAAIsY,EAAY3C,EAAGW,UAAYV,EAAKR,WAAWQ,EAAKrB,WAAa,GAC7D+D,EAAY9a,GACZua,GAAY5D,EAAOmE,EAAW9a,EACtC,EAQJ,OANI4a,EAAapY,SACboY,EAAeA,EAAaG,OAAO7G,GAAKA,EAAErT,MAAQ2V,GAAKgE,UACnDI,EAAapY,SACb4V,EAAKnB,QAAU2D,EAAarQ,OAAO6N,EAAKnB,WAEhDkB,EAAG6C,QAAQ7C,EAAGxQ,OAAOsT,cAActE,GAAQ5W,GAAMmb,OAAO1E,GAAK2E,UAAWnb,EAAKD,GAAOA,IAC7E,CACX,EACA,UAAAqb,CAAWjD,EAAIC,GACX,IAAIiD,EAAWjC,GAAahB,GAC5B,GAAIiD,EAAW,EACX,OAAO,EACX,IAAItb,EAAOoY,EAAGW,UAAYV,EAAK9S,IAAKT,EAAKuT,EAAKzP,KAAMoD,EAAMsP,EAAWjD,EAAK9S,IACtEgW,EAAWlD,EAAKd,UAAU+D,GAAWE,EAASpC,GAAcf,EAAKtB,KAAMsB,EAAKtB,KAAKtU,OAAQ8Y,GACzF3E,EAAQ,CAACmB,GAAItB,GAAKgF,SAAUzb,EAAMA,EAAOgM,IACzCuP,EAAWC,GACX5E,EAAMvS,KAAK0T,GAAItB,GAAKiF,SAAUtD,EAAGW,UAAYwC,EAAUnD,EAAGW,UAAYyC,IAC1E,IAAK,IAAInG,GAAQ,EAAMlK,GAAQ,EAAMwQ,GAAU,EAAOvD,EAAG0C,YAAczC,EAAK/P,OAAS8P,EAAG1J,MAAMjM,OAAQ4S,GAAQ,EAAO,CACjH,IAAI1R,EAAI0U,EAAK9S,IACb,GAAI8S,EAAKlB,OAASkB,EAAKrB,WAAa,EAChC,KAAOrT,EAAI0U,EAAKtB,KAAKtU,QAAU4V,EAAKtB,KAAKU,WAAW9T,IAAMmB,GACtDnB,IACR,GAAIA,EAAI0U,EAAK9S,KAAOyG,GAAOqM,EAAKd,UAAU5T,IAAM0U,EAAKtB,KAAKtU,OAAQ,CAC9D,IAAK,IAAI0R,KAAKkE,EAAKnB,QACfN,EAAMvS,KAAK8P,GACXhJ,GAASwQ,GACTnB,GAAY5D,EAAOwB,EAAGW,UAAY,EAAGX,EAAGW,WAC5CnC,EAAMvS,KAAK0T,GAAItB,GAAKgF,SAAUrD,EAAGW,UAAYV,EAAK9S,IAAK6S,EAAGW,UAAYpV,IACtEyU,EAAG0C,WACH,KACJ,CACK,CACDa,GAAU,EACLtG,IACDmF,GAAY5D,EAAOwB,EAAGW,UAAY,EAAGX,EAAGW,WACxC5N,GAAQ,GAEZ,IAAK,IAAIgJ,KAAKkE,EAAKnB,QACfN,EAAMvS,KAAK8P,GACf,IAAIyH,EAAYxD,EAAGW,UAAYV,EAAKpB,QAAS4E,EAAUzD,EAAGW,UAAYV,EAAKtB,KAAKtU,OAC5EmZ,EAAYC,IACZrB,GAAY5D,EAAOgF,EAAWC,GAC9B1Q,GAAQ,EAEhB,CACJ,CAGA,OAFAiN,EAAG6C,QAAQ7C,EAAGxQ,OAAOsT,cAActE,GAAQ5W,GACtCmb,OAAO1E,GAAK4E,WAAYjD,EAAG0D,cAAgB9b,GAAOA,IAChD,CACX,EACA,UAAA6Y,CAAWT,EAAIC,GACX,IAAI5P,EAAO6Q,GAAajB,GACxB,QAAI5P,EAAO,KAEX2P,EAAG2D,aAAatF,GAAKoC,WAAYR,EAAK9S,KACtC6S,EAAG6C,QAAQxE,GAAKqC,UAAWV,EAAGW,UAAYV,EAAK9S,IAAK6S,EAAGW,UAAYV,EAAK9S,IAAM,GAC9E8S,EAAKV,SAASU,EAAK9S,IAAMkD,GAClB,KACX,EACA,cAAAuT,CAAe5D,EAAIC,GACf,GAAIM,GAAiBN,EAAMD,GAAI,GAAS,EACpC,OAAO,EACX,IAAIpY,EAAOoY,EAAGW,UAAYV,EAAK9S,IAG/B,OAFA6S,EAAG0C,WACH1C,EAAG6C,QAAQxE,GAAKuF,eAAgBhc,IACzB,CACX,EACA,UAAA0Y,CAAWN,EAAIC,GACX,IAAI5P,EAAOgQ,GAAaJ,EAAMD,GAAI,GAClC,GAAI3P,EAAO,EACP,OAAO,EACP2P,EAAGE,MAAMxX,MAAQ2V,GAAKiC,YACtBN,EAAG2D,aAAatF,GAAKiC,WAAYL,EAAKpB,QAASoB,EAAKzP,MACxD,IAAIqT,EAAU5B,GAAchC,EAAMA,EAAK9S,IAAM,GAI7C,OAHA6S,EAAG2D,aAAatF,GAAKwC,SAAUZ,EAAKpB,QAASgF,EAAU5D,EAAKrB,YAC5DoB,EAAG6C,QAAQxE,GAAKyF,SAAU9D,EAAGW,UAAYV,EAAK9S,IAAK6S,EAAGW,UAAYV,EAAK9S,IAAMkD,GAC7E4P,EAAKT,eAAeqE,GACb,IACX,EACA,WAAA1D,CAAYH,EAAIC,GACZ,IAAI5P,EAAO+P,GAAcH,EAAMD,GAAI,GACnC,GAAI3P,EAAO,EACP,OAAO,EACP2P,EAAGE,MAAMxX,MAAQ2V,GAAK8B,aACtBH,EAAG2D,aAAatF,GAAK8B,YAAaF,EAAKpB,QAASoB,EAAKtB,KAAKU,WAAWY,EAAK9S,IAAMkD,EAAO,IAC3F,IAAIwT,EAAU5B,GAAchC,EAAMA,EAAK9S,IAAMkD,GAI7C,OAHA2P,EAAG2D,aAAatF,GAAKwC,SAAUZ,EAAKpB,QAASgF,EAAU5D,EAAKrB,YAC5DoB,EAAG6C,QAAQxE,GAAKyF,SAAU9D,EAAGW,UAAYV,EAAK9S,IAAK6S,EAAGW,UAAYV,EAAK9S,IAAMkD,GAC7E4P,EAAKT,eAAeqE,GACb,IACX,EACA,UAAAE,CAAW/D,EAAIC,GACX,IAAI5P,EAAOqR,GAAazB,GACxB,GAAI5P,EAAO,EACP,OAAO,EACX,IAAI6I,EAAM+G,EAAK9S,IAAKvF,EAAOoY,EAAGW,UAAYzH,EACtC8K,EAAahD,GAAcf,EAAKtB,KAAMsB,EAAKtB,KAAKtU,OAAQ6O,GAAM9E,EAAQ4P,EAC1E,KAAO5P,EAAQ8E,GAAO+G,EAAKtB,KAAKU,WAAWjL,EAAQ,IAAM6L,EAAKzP,MAC1D4D,IACAA,GAAS4P,GAAc5P,GAAS8E,GAAQ0H,GAAMX,EAAKtB,KAAKU,WAAWjL,EAAQ,MAC3EA,EAAQ6L,EAAKtB,KAAKtU,QACtB,IAAImS,EAAMwD,EAAGxQ,OACRyU,MAAM5F,GAAK6F,WAAY,EAAG7T,GAC1ByS,cAAc9C,EAAGtW,OAAOya,YAAYlE,EAAKtB,KAAKpL,MAAM2F,EAAM7I,EAAO,EAAG+D,GAAQxM,EAAOyI,EAAO,IAAKzI,GAChGwM,EAAQ6L,EAAKtB,KAAKtU,QAClBmS,EAAIyH,MAAM5F,GAAK6F,WAAY9P,EAAQ8E,EAAK8K,EAAa9K,GACzD,IAAI7N,EAAOmR,EAAIuG,OAAO1E,GAAK+F,YAAc,EAAI/T,EAAM4P,EAAKtB,KAAKtU,OAAS6O,GAGtE,OAFA8G,EAAG0C,WACH1C,EAAG6C,QAAQxX,EAAMzD,IACV,CACX,EACA,SAAAyc,CAAUrE,EAAIC,GACV,IAAIvX,EAAOqZ,GAAY9B,EAAMD,GAAI,GACjC,GAAItX,EAAO,EACP,OAAO,EACX,IAAId,EAAOoY,EAAGW,UAAYV,EAAK9S,IAAKiD,EAAM0R,GAAepZ,GAAM,GAC3D8V,EAAQ,GAAI8F,EAAWlU,GAAOuR,GAClC,MAAQvR,EAAIzD,KAAKsT,EAAKtB,OAASqB,EAAG0C,YAAY,CAC1C,GAAIzC,EAAK/P,MAAQ8P,EAAG1J,MAAMjM,OAAQ,CAC9Bia,GAAW,EACX,KACJ,CACA,IAAK,IAAIvI,KAAKkE,EAAKnB,QACfN,EAAMvS,KAAK8P,EACnB,CACIuI,GACAtE,EAAG0C,WACP,IAAI6B,EAAWnU,GAAOwR,GAAavD,GAAKmG,aAAepU,GAAOyR,GAAgBxD,GAAKoG,2BAA6BpG,GAAKgG,UACjHxc,EAAKmY,EAAG0D,cAEZ,OADA1D,EAAG6C,QAAQ7C,EAAGxQ,OAAOsT,cAActE,GAAQ5W,GAAMmb,OAAOwB,EAAU1c,EAAKD,GAAOA,IACvE,CACX,EACA4Z,mBAAe5Y,GAOnB,MAAM8b,GACF,WAAA/c,CAAYgd,GACR7c,KAAK8c,MAAQ,EACb9c,KAAK+c,KAAO,GACZ/c,KAAKqF,IAAM,EACXrF,KAAKqI,MAAQwU,EAAKxU,MAClBrI,KAAKsS,QAAQuK,EAAKpG,QACtB,CACA,QAAAmE,CAAS1C,EAAIC,EAAM0E,GACf,IAAkB,GAAd7c,KAAK8c,MACL,OAAO,EACX,IAAIrG,EAAUoG,EAAKpG,QAAU,KAAO0B,EAAKJ,QACrCkD,EAASjb,KAAKsS,QAAQmE,GAC1B,OAAIwE,GAAS,GAAMA,EAASxE,EAAQlU,QACzBvC,KAAKgd,SAAS9E,EAAI2E,EAAM5B,EAEvC,CACA,MAAAA,CAAO/C,EAAI2E,GACP,OAAmB,GAAd7c,KAAK8c,OAAgD,GAAd9c,KAAK8c,QAAoCzF,GAAUwF,EAAKpG,QAASzW,KAAKqF,MAAQwX,EAAKpG,QAAQlU,QAC5HvC,KAAKgd,SAAS9E,EAAI2E,EAAMA,EAAKpG,QAAQlU,OAEpD,CACA,QAAAya,CAAS9E,EAAI2E,EAAM/Q,GAEf,OADAoM,EAAG+E,eAAeJ,EAAMhF,GAAItB,GAAKkE,cAAeza,KAAKqI,MAAOrI,KAAKqI,MAAQyD,EAAK9L,KAAK+c,QAC5E,CACX,CACA,SAAAG,CAAUrF,GACN,OAAIA,GACA7X,KAAKqF,IAAMwS,EAAI9X,GAAKC,KAAKqI,MACzBrI,KAAK+c,KAAK5Y,KAAK0T,GACf7X,KAAK8c,SACE,KAEC,IAARjF,IACA7X,KAAK8c,OAAQ,IACV,EACX,CACA,OAAAxK,CAAQmE,GACJ,OAAS,CACL,OAAIzW,KAAK8c,MACL,OAAO,EAEN,GAAkB,GAAd9c,KAAK8c,MAAiC,CAC3C,IAAK9c,KAAKkd,UAAUC,GAAe1G,EAASzW,KAAKqF,IAAKrF,KAAKqI,OAAO,IAC9D,OAAO,EACX,GAAoC,IAAhCoO,EAAQc,WAAWvX,KAAKqF,KACxB,OAAOrF,KAAK8c,OAAQ,EACxB9c,KAAK+c,KAAK5Y,KAAK0T,GAAItB,GAAK6G,SAAUpd,KAAKqF,IAAMrF,KAAKqI,MAAOrI,KAAKqF,IAAMrF,KAAKqI,MAAQ,IACjFrI,KAAKqF,KACT,KACK,IAAkB,GAAdrF,KAAK8c,MAIT,IAAkB,GAAd9c,KAAK8c,MAAgC,CAC1C,IAAIhU,EAAOuO,GAAUZ,EAASzW,KAAKqF,KAAMiD,EAAM,EAC/C,GAAIQ,EAAO9I,KAAKqF,IAAK,CACjB,IAAIgY,EAAQC,GAAe7G,EAAS3N,EAAM9I,KAAKqI,OAC/C,GAAIgV,EAAO,CACP,IAAIE,EAAWC,GAAQ/G,EAAS4G,EAAMtd,GAAKC,KAAKqI,OAC5CkV,EAAW,IACXvd,KAAKkd,UAAUG,GACf/U,EAAMiV,EAEd,CACJ,CAGA,OAFKjV,IACDA,EAAMkV,GAAQ/G,EAASzW,KAAKqF,MACzBiD,EAAM,GAAKA,EAAMmO,EAAQlU,OAAS+F,GAAM,CACnD,CAEI,OAAOkV,GAAQ/G,EAASzW,KAAKqF,IACjC,CArBI,IAAKrF,KAAKkd,UAAUO,GAAShH,EAASY,GAAUZ,EAASzW,KAAKqF,KAAMrF,KAAKqI,QACrE,OAAO,CAoBf,CACJ,CACJ,EAEJ,SAASmV,GAAQ3G,EAAMxR,GACnB,KAAOA,EAAMwR,EAAKtU,OAAQ8C,IAAO,CAC7B,IAAIqD,EAAOmO,EAAKU,WAAWlS,GAC3B,GAAY,IAARqD,EACA,MACJ,IAAKoQ,GAAMpQ,GACP,OAAO,CACf,CACA,OAAOrD,CACX,CACA,MAAMqY,GACF,QAAA9C,CAAS1C,EAAIC,EAAM0E,GACf,IAAIc,EAAYxF,EAAK/P,MAAQ8P,EAAG1J,MAAMjM,QAAS,EAAKgX,GAAkBpB,GAClEzP,EAAOyP,EAAKzP,KAChB,GAAIiV,EAAY,EACZ,OAAO,EACX,IAAIC,EAAgB/F,GAAItB,GAAK6F,WAAYlE,EAAGW,UAAYV,EAAK9S,IAAK6S,EAAGW,UAAY8E,GAMjF,OALAzF,EAAG0C,WACH1C,EAAG+E,eAAeJ,EAAMhF,GAAY,IAARnP,EAAa6N,GAAKsH,eAAiBtH,GAAKuH,eAAgBjB,EAAKxU,MAAO6P,EAAG0D,cAAe,IAC3G1D,EAAGtW,OAAOya,YAAYQ,EAAKpG,QAASoG,EAAKxU,OAC5CuV,MAEG,CACX,CACA,MAAA3C,GACI,OAAO,CACX,EAEJ,MAAMxB,GAAoB,CACtBgB,cAAa,CAACsD,EAAGlB,IAA6C,IAA9BA,EAAKpG,QAAQc,WAAW,GAAqB,IAAIqF,GAAoBC,GAAQ,KAC7GnD,cAAa,IAAY,IAAIgE,IAE3BM,GAAiB,CACnB,CAACD,EAAG5F,IAASyB,GAAazB,IAAS,EACnC,CAAC4F,EAAG5F,IAASgB,GAAahB,IAAS,EACnC,CAAC4F,EAAG5F,IAASiB,GAAajB,IAAS,EACnC,CAACnK,EAAGmK,IAASI,GAAaJ,EAAMnK,GAAG,IAAS,EAC5C,CAACA,EAAGmK,IAASG,GAAcH,EAAMnK,GAAG,IAAS,EAC7C,CAACA,EAAGmK,IAASM,GAAiBN,EAAMnK,GAAG,IAAS,EAChD,CAACA,EAAGmK,IAAS8B,GAAY9B,EAAMnK,GAAG,IAAS,GAEzCiQ,GAAiB,CAAEpH,KAAM,GAAIvO,IAAK,GAIxC,MAAM4V,GAIF,WAAAre,CAIA+B,EAIAoQ,EAAOrB,EAIPsB,GACIjS,KAAK4B,OAASA,EACd5B,KAAKgS,MAAQA,EACbhS,KAAKiS,OAASA,EACdjS,KAAKmY,KAAO,IAAIvB,GAChB5W,KAAKme,OAAQ,EAObne,KAAKoe,kBAAoB,IAAIC,IAC7Bre,KAAKsT,UAAY,KAIjBtT,KAAKse,OAAS,EACdte,KAAKD,GAAKkS,EAAOA,EAAO1P,OAAS,GAAGxC,GACpCC,KAAK6Y,UAAY7Y,KAAKue,kBAAoBve,KAAKwe,gBAAkBvM,EAAO,GAAGnS,KAC3EE,KAAKoY,MAAQlC,GAAehU,OAAOqU,GAAK0C,SAAU,EAAGjZ,KAAK6Y,UAAW,EAAG,GACxE7Y,KAAKwO,MAAQ,CAACxO,KAAKoY,OACnBpY,KAAK2Q,UAAYA,EAAUpO,OAAS,IAAIoR,GAAehD,EAAWqB,GAAS,KAC3EhS,KAAKye,UACT,CACA,aAAIhL,GACA,OAAOzT,KAAKue,iBAChB,CACA,OAAAjM,GACI,GAAsB,MAAlBtS,KAAKsT,WAAqBtT,KAAKue,kBAAoBve,KAAKsT,UACxD,OAAOtT,KAAKib,SAChB,IAAI9C,KAAEA,GAASnY,KACf,OAAS,CACL,IAAK,IAAI0e,EAAQ,IAAK,CAClB,IAAIhW,EAAOyP,EAAK/P,MAAQpI,KAAKwO,MAAMjM,OAASvC,KAAKwO,MAAMxO,KAAKwO,MAAMjM,OAAS,GAAK,KAChF,KAAOmc,EAAQvG,EAAKnB,QAAQzU,UAAYmG,GAAQyP,EAAKnB,QAAQ0H,GAAO5e,KAAO4I,EAAKJ,MAAM,CAClF,IAAIqW,EAAOxG,EAAKnB,QAAQ0H,KACxB1e,KAAK+a,QAAQ4D,EAAK/d,KAAM+d,EAAK7e,KAAM6e,EAAK5e,GAC5C,CACA,IAAK2I,EACD,MACJ1I,KAAK4e,eACT,CACA,GAAIzG,EAAK9S,IAAM8S,EAAKtB,KAAKtU,OACrB,MAEJ,IAAKvC,KAAK4a,WACN,OAAO5a,KAAKib,QACpB,CACA,GAAIjb,KAAK2Q,WAAa3Q,KAAK6e,cAAc1G,EAAKpB,SAC1C,OAAO,KACX1O,EAAO,OAAS,CACZ,IAAK,IAAIzH,KAAQZ,KAAK4B,OAAOkd,aACzB,GAAIle,EAAM,CACN,IAAIC,EAASD,EAAKZ,KAAMmY,GACxB,GAAc,GAAVtX,EAAiB,CACjB,GAAc,GAAVA,EACA,OAAO,KACXsX,EAAKjB,UACL,SAAS7O,CACb,CACJ,CACJ,KACJ,CACA,GAAI8P,EAAK9S,KAAO8S,EAAKtB,KAAKtU,OACtB,OAAOvC,KAAK4a,WAAa,KAAO5a,KAAKib,SACzC,IAAI4B,EAAO,IAAIrG,GAAUxW,KAAK6Y,UAAYV,EAAK9S,IAAK8S,EAAKtB,KAAKpL,MAAM0M,EAAK9S,MACzE,IAAK,IAAI+M,KAASpS,KAAK4B,OAAO4X,iBAC1B,GAAIpH,EAAO,CACP,IAAIxQ,EAASwQ,EAAMpS,KAAM6c,GACrBjb,GACAib,EAAKlG,QAAQxS,KAAKvC,EAC1B,CACJmd,EAAO,KAAO/e,KAAK4a,YACXzC,EAAK9S,KAAO8S,EAAKtB,KAAKtU,QADC,CAG3B,GAAI4V,EAAKlB,OAASkB,EAAKrB,WAAa,EAChC,IAAK,IAAIkI,KAAQhf,KAAK4B,OAAOqd,aACzB,GAAID,EAAKhf,KAAMmY,EAAM0E,GACjB,MAAMkC,EAElB,IAAK,IAAInd,KAAUib,EAAKlG,QACpB,GAAI/U,EAAOgZ,SAAS5a,KAAMmY,EAAM0E,GAC5B,OAAO,KACfA,EAAKpG,SAAW,KAAO0B,EAAKJ,QAC5B,IAAK,IAAI9D,KAAKkE,EAAKnB,QACf6F,EAAKnG,MAAMvS,KAAK8P,EACxB,CAEA,OADAjU,KAAKkf,WAAWrC,GACT,IACX,CACA,MAAA/S,CAAOzE,GACH,GAAsB,MAAlBrF,KAAKsT,WAAqBtT,KAAKsT,UAAYjO,EAC3C,MAAM,IAAI3E,WAAW,gCACzBV,KAAKsT,UAAYjO,CACrB,CACA,aAAAwZ,CAAcxW,GACV,IAAKrI,KAAK2Q,UAAUnL,OAAOxF,KAAKue,kBAAoBlW,EAAOrI,KAAKue,qBAC3Dve,KAAK2Q,UAAUwO,QAAQnf,KAAKoY,MAAMhC,MACnC,OAAO,EACX,IAAIgJ,EAAQpf,KAAK2Q,UAAU0O,UAAUrf,MACrC,QAAKof,IAELpf,KAAKue,mBAAqBa,EAC1Bpf,KAAK6Y,UAAYyG,GAAWtf,KAAKue,kBAAmBve,KAAKiS,QACzDjS,KAAKuf,aACDvf,KAAKue,kBAAoBve,KAAKD,IAC9BC,KAAK6Y,YACL7Y,KAAKue,oBACLve,KAAKye,aAGLze,KAAKme,OAAQ,EACbne,KAAKye,aAEF,EACX,CAIA,SAAIrW,GACA,OAAOpI,KAAKwO,MAAMjM,MACtB,CAKA,UAAAid,CAAWpX,EAAQpI,KAAKoI,MAAQ,GAC5B,OAAOpI,KAAK4B,OAAO+F,QAAQ9D,MAAM7D,KAAKwO,MAAMpG,GAAOxH,KACvD,CAQA,QAAAga,GAEI,OADA5a,KAAK6Y,WAAa7Y,KAAKmY,KAAKtB,KAAKtU,OAC7BvC,KAAKwe,iBAAmBxe,KAAKD,IAC7BC,KAAKue,kBAAoBve,KAAKwe,gBAC9Bxe,KAAKme,OAAQ,EACbne,KAAKye,YACE,IAGPze,KAAK6Y,YACL7Y,KAAKue,kBAAoBve,KAAKwe,gBAAkB,EAChDxe,KAAKuf,aACLvf,KAAKye,YACE,EAEf,CAKA,QAAAgB,GACI,OAAOzf,KAAK0f,SAAS1f,KAAKwe,gBAAkB,GAAG3H,IACnD,CACA,UAAA0I,GACI,KAAOvf,KAAKse,OAASte,KAAKiS,OAAO1P,OAAS,GAAKvC,KAAKue,mBAAqBve,KAAKiS,OAAOjS,KAAKse,QAAQve,IAC9FC,KAAKse,SACLte,KAAKue,kBAAoBxS,KAAKC,IAAIhM,KAAKue,kBAAmBve,KAAKiS,OAAOjS,KAAKse,QAAQxe,KAE3F,CAKA,QAAA4f,CAASrX,GACL,IAAIkE,EAAI0R,GAER,GADA1R,EAAEjE,IAAMD,EACJA,GAASrI,KAAKD,GACdwM,EAAEsK,KAAO,QAKT,GAFAtK,EAAEsK,KAAO7W,KAAK2f,YAAYtX,GAC1BkE,EAAEjE,KAAOiE,EAAEsK,KAAKtU,OACZvC,KAAKiS,OAAO1P,OAAS,EAAG,CACxB,IAAIqd,EAAa5f,KAAKue,kBAAmBD,EAASte,KAAKse,OACvD,KAAOte,KAAKiS,OAAOqM,GAAQve,GAAKwM,EAAEjE,KAAK,CACnCgW,IACA,IAAIuB,EAAW7f,KAAKiS,OAAOqM,GAAQxe,KAC/BwM,EAAQtM,KAAK2f,YAAYE,GAC7BtT,EAAEjE,IAAMuX,EAAWvT,EAAM/J,OACzBgK,EAAEsK,KAAOtK,EAAEsK,KAAKpL,MAAM,EAAGzL,KAAKiS,OAAOqM,EAAS,GAAGve,GAAK6f,GAActT,EACpEsT,EAAarT,EAAEjE,IAAMiE,EAAEsK,KAAKtU,MAChC,CACJ,CAEJ,OAAOgK,CACX,CAMA,QAAAkS,GACI,IAAItG,KAAEA,GAASnY,MAAM6W,KAAEA,EAAIvO,IAAEA,GAAQtI,KAAK0f,SAAS1f,KAAKue,mBAGxD,IAFAve,KAAKwe,gBAAkBlW,EACvB6P,EAAKX,MAAMX,GACJsB,EAAK/P,MAAQpI,KAAKwO,MAAMjM,OAAQ4V,EAAK/P,QAAS,CACjD,IAAI8P,EAAKlY,KAAKwO,MAAM2J,EAAK/P,OAAQ0X,EAAU9f,KAAK4B,OAAOme,kBAAkB7H,EAAGtX,MAC5E,IAAKkf,EACD,MAAM,IAAIxf,MAAM,2BAA6BiW,GAAK2B,EAAGtX,OACzD,IAAI8V,EAAQ1W,KAAKmY,KAAKnB,QAAQzU,OAC9B,IAAKud,EAAQ5H,EAAIlY,KAAMmY,GAAO,CACtBnY,KAAKmY,KAAKnB,QAAQzU,OAASmU,IAC3BwB,EAAG5P,IAAMtI,KAAKmY,KAAKnB,QAAQhX,KAAKmY,KAAKnB,QAAQzU,OAAS,GAAGxC,IAC7DoY,EAAKjB,UACL,KACJ,CACAiB,EAAKjB,SACT,CACJ,CACA,WAAAyI,CAAYta,GACR,IAAkCwR,EAA9BnO,EAAO1I,KAAKgS,MAAMQ,MAAMnN,GAC5B,GAAKrF,KAAKgS,MAAMS,WAKZoE,EAAe,MAARnO,EAAe,GAAKA,MALH,CACxB,IAAIsX,EAAMtX,EAAKtF,QAAQ,MACvByT,EAAOmJ,EAAM,EAAItX,EAAOA,EAAK+C,MAAM,EAAGuU,EAC1C,CAIA,OAAO3a,EAAMwR,EAAKtU,OAASvC,KAAKD,GAAK8W,EAAKpL,MAAM,EAAGzL,KAAKD,GAAKsF,GAAOwR,CACxE,CAIA,WAAA+E,GAAgB,OAAO5b,KAAKme,MAAQne,KAAK6Y,UAAY7Y,KAAK6Y,UAAY,CAAG,CAIzE,YAAAgD,CAAajb,EAAMyH,EAAOhH,EAAQ,GAC9BrB,KAAKoY,MAAQlC,GAAehU,OAAOtB,EAAMS,EAAOrB,KAAK6Y,UAAYxQ,EAAOrI,KAAKoY,MAAMhC,KAAMpW,KAAK6Y,UAAY7Y,KAAKmY,KAAKtB,KAAKtU,QACzHvC,KAAKwO,MAAMrK,KAAKnE,KAAKoY,MACzB,CAKA,cAAA6H,CAAerf,EAAMyH,EAAOhH,EAAQ,GAChCrB,KAAK6b,aAAa7b,KAAK4B,OAAOse,YAAYtf,GAAOyH,EAAOhH,EAC5D,CAIA,OAAA0Z,CAAQ3C,EAAOtY,EAAMC,GACG,iBAATqY,IACPA,EAAQ,IAAI5T,EAAKxE,KAAK4B,OAAO+F,QAAQ9D,MAAMuU,GAAQzU,GAAMA,IAAO5D,QAA+BA,EAAKC,KAAK4b,eAAiB9b,IAC9HE,KAAKoY,MAAM9B,SAAS8B,EAAOtY,EAAOE,KAAKoY,MAAMtY,KACjD,CAKA,UAAAqgB,CAAWtI,GACP7X,KAAKoY,MAAM9B,SAASuB,EAAI/J,OAAO9N,KAAK4B,OAAO+F,SAAUkQ,EAAI/X,KAAOE,KAAKoY,MAAMtY,KAC/E,CAMA,cAAAmd,CAAeJ,EAAMhF,GACjB7X,KAAK+a,QAAQ/a,KAAK0H,OACbsT,cAAcoF,GAAYvI,EAAIpT,SAAUoY,EAAKnG,QAASmB,EAAI/X,MAC1Dmb,OAAOpD,EAAIjX,KAAMiX,EAAI9X,GAAK8X,EAAI/X,MAAO+X,EAAI/X,KAClD,CAIA,aAAA8e,GACI,IAAI1G,EAAKlY,KAAKwO,MAAMpE,MAChB5H,EAAMxC,KAAKwO,MAAMxO,KAAKwO,MAAMjM,OAAS,GACzCC,EAAI8T,SAAS4B,EAAGpK,OAAO9N,KAAK4B,OAAO+F,SAAUuQ,EAAGpY,KAAO0C,EAAI1C,MAC3DE,KAAKoY,MAAQ5V,CACjB,CACA,MAAAyY,GACI,KAAOjb,KAAKwO,MAAMjM,OAAS,GACvBvC,KAAK4e,gBACT,OAAO5e,KAAKqgB,QAAQrgB,KAAKoY,MAAMtK,OAAO9N,KAAK4B,OAAO+F,QAAS3H,KAAK6Y,WACpE,CACA,OAAAwH,CAAQ3e,GACJ,OAAO1B,KAAKiS,OAAO1P,OAAS,EACxB+d,GAAWtgB,KAAKiS,OAAQ,EAAGvQ,EAAKyD,QAASnF,KAAKiS,OAAO,GAAGnS,KAAME,KAAKoe,mBAAqB1c,CAChG,CAIA,UAAAwd,CAAWrC,GACP,IAAK,IAAIjb,KAAUib,EAAKlG,QACpB,GAAI/U,EAAOqZ,OAAOjb,KAAM6c,GACpB,OACR,IAAI0D,EAASH,GAAYpgB,KAAK4B,OAAOya,YAAYQ,EAAKpG,QAASoG,EAAKxU,OAAQwU,EAAKnG,OACjF1W,KAAK+a,QAAQ/a,KAAK0H,OACbsT,cAAcuF,GAAS1D,EAAKxU,OAC5B4S,OAAO1E,GAAKiK,UAAW3D,EAAKpG,QAAQlU,QAASsa,EAAKxU,MAC3D,CACA,GAAAwP,CAAIjX,EAAMd,EAAMC,EAAI0E,GAChB,MAAmB,iBAAR7D,EACAiX,GAAI7X,KAAK4B,OAAOse,YAAYtf,GAAOd,EAAMC,EAAI0E,GACjD,IAAIgc,GAAY7f,EAAMd,EACjC,CAIA,UAAI4H,GAAW,OAAO,IAAIgZ,GAAO1gB,KAAK4B,OAAO+F,QAAU,EAE3D,SAAS2Y,GAAWrO,EAAQqM,EAAQ5c,EAAMsO,EAAQ2Q,GAC9C,IAAIC,EAAW3O,EAAOqM,GAAQve,GAC1B0E,EAAW,GAAIC,EAAY,GAAI2D,EAAQ3G,EAAK5B,KAAOkQ,EACvD,SAAS6Q,EAAaC,EAAMC,GACxB,KAAOA,EAAYD,GAAQF,EAAWE,EAAOF,GAAU,CACnD,IAAIrY,EAAO0J,EAAOqM,EAAS,GAAGxe,KAAO8gB,EACrC5Q,GAAUzH,EACVuY,GAAQvY,EACR+V,IACAsC,EAAW3O,EAAOqM,GAAQve,EAC9B,CACJ,CACA,IAAK,IAAI6E,EAAKlD,EAAKuF,WAAYrC,EAAIA,EAAKA,EAAGsC,YAAa,CACpD2Z,EAAajc,EAAG9E,KAAOkQ,GAAQ,GAC/B,IAA6BzM,EAAzBzD,EAAO8E,EAAG9E,KAAOkQ,EAAcgR,EAAQL,EAAQ7e,IAAI8C,EAAGlD,MACtDsf,EACAzd,EAAOyd,EAEFpc,EAAG7E,GAAKiQ,EAAS4Q,GACtBrd,EAAO+c,GAAWrO,EAAQqM,EAAQ1Z,EAAIoL,EAAQ2Q,GAC9CE,EAAajc,EAAG7E,GAAKiQ,GAAQ,IAG7BzM,EAAOqB,EAAGkJ,SAEdrJ,EAASN,KAAKZ,GACdmB,EAAUP,KAAKrE,EAAOuI,EAC1B,CAEA,OADAwY,EAAanf,EAAK3B,GAAKiQ,GAAQ,GACxB,IAAIxL,EAAK9C,EAAKd,KAAM6D,EAAUC,EAAWhD,EAAK3B,GAAKiQ,EAAS3H,EAAO3G,EAAKA,KAAOA,EAAKA,KAAKyF,gBAAarG,EACjH,CAIA,MAAMmgB,WAAuBnP,EAIzB,WAAAjS,CAKA8H,EAIAmX,EAIAtF,EAIA0H,EAIAjC,EAIAc,EAIAoB,EAIAC,EAIAC,GACIrU,QACAhN,KAAK2H,QAAUA,EACf3H,KAAK8e,aAAeA,EACpB9e,KAAKwZ,iBAAmBA,EACxBxZ,KAAKkhB,WAAaA,EAClBlhB,KAAKif,aAAeA,EACpBjf,KAAK+f,kBAAoBA,EACzB/f,KAAKmhB,cAAgBA,EACrBnhB,KAAKohB,YAAcA,EACnBphB,KAAKqhB,SAAWA,EAIhBrhB,KAAKshB,UAAYrf,OAAOC,OAAO,MAC/B,IAAK,IAAIqf,KAAK5Z,EAAQ9D,MAClB7D,KAAKshB,UAAUC,EAAEpf,MAAQof,EAAEphB,EACnC,CACA,WAAAgS,CAAYH,EAAOrB,EAAWsB,GAC1B,IAAIG,EAAQ,IAAI8L,GAAale,KAAMgS,EAAOrB,EAAWsB,GACrD,IAAK,IAAIuP,KAAKxhB,KAAKqhB,SACfjP,EAAQoP,EAAEpP,EAAOJ,EAAOrB,EAAWsB,GACvC,OAAOG,CACX,CAIA,SAAAqP,CAAUnf,GACN,IAAIpC,EAASwhB,GAAcpf,GAC3B,IAAKpC,EACD,OAAOF,KACX,IAAI2H,QAAEA,EAAOoY,kBAAEA,GAAsB/f,KACjC8e,EAAe9e,KAAK8e,aAAarT,QAAS+N,EAAmBxZ,KAAKwZ,iBAAiB/N,QAASyV,EAAalhB,KAAKkhB,WAAWzV,QAAS0V,EAAgBnhB,KAAKmhB,cAAc1V,QAAS2V,EAAcphB,KAAKohB,YAAY3V,QAASwT,EAAejf,KAAKif,aAAaxT,QAAS4V,EAAWrhB,KAAKqhB,SACpR,GAAIM,GAASzhB,EAAO0hB,aAAc,CAC9B7B,EAAoB9d,OAAOiC,OAAO,CAAA,EAAI6b,GACtC,IAAuC8B,EAAnCP,EAAY3Z,EAAQ9D,MAAM4H,QAC9B,IAAK,IAAIqW,KAAK5hB,EAAO0hB,YAAa,CAC9B,IAAIzf,KAAEA,EAAIiW,MAAEA,EAAK2J,UAAEA,EAASC,MAAEA,GAAsB,iBAALF,EAAgB,CAAE3f,KAAM2f,GAAMA,EAC7E,GAAIR,EAAU/R,KAAKgS,GAAKA,EAAEpf,MAAQA,GAC9B,SACA4f,IACAhC,EAAkBuB,EAAU/e,QACxB,CAAC0V,EAAIC,EAAIC,IAAS4J,EAAU7J,EAAIC,EAAMF,EAAG5W,QACjD,IAAIlB,EAAKmhB,EAAU/e,OACfpB,EAAQ4gB,EAAY,CAAC,QAAS,gBAAmB3J,EAC/CjY,GAAMoW,GAAK+F,aAAenc,GAAMoW,GAAKuH,eAAiB,CAAC,QAAS,YAAa,WAAa,CAAC,QAAS,kBAD7Chd,EAE7DwgB,EAAUnd,KAAKxD,EAAS0B,OAAO,CAC3BlC,KACAgC,OACAJ,MAAOZ,GAAS,CAAC,CAAClB,EAASkB,MAAOA,OAElC6gB,IACKH,IACDA,EAAS,CAAA,GACTjf,MAAMC,QAAQmf,IAAUA,aAAiBC,EACzCJ,EAAO1f,GAAQ6f,EAEf/f,OAAOiC,OAAO2d,EAAQG,GAElC,CACAra,EAAU,IAAI/D,EAAQ0d,GAClBO,IACAla,EAAUA,EAAQ7D,OAAOoe,EAAUL,IAC3C,CAGA,GAFIF,GAASzhB,EAAO6B,SAChB4F,EAAUA,EAAQ7D,UAAU5D,EAAO6B,QACnC4f,GAASzhB,EAAOiiB,QAChB,IAAK,IAAIC,KAAMliB,EAAOiiB,OAAQ,CAC1B,IAAI/J,EAAQpY,KAAKkhB,WAAW9d,QAAQgf,GAAK7B,EAASvgB,KAAKohB,YAAYhe,QAAQgf,GACvEhK,GAAQ,IACR0G,EAAa1G,GAASoB,EAAiBpB,QAAStX,GAChDyf,GAAS,IACTY,EAAcZ,QAAUzf,EAChC,CAEJ,GAAI6gB,GAASzhB,EAAOmiB,YAChB,IAAK,IAAI/f,KAAQpC,EAAOmiB,WAAY,CAChC,IAAI3e,EAAQwd,EAAW9d,QAAQd,EAAKH,MACpC,GAAIuB,GAAQ,EACRob,EAAapb,GAASpB,EAAK8P,MAC3BoH,EAAiB9V,GAASpB,EAAKua,SAE9B,CACD,IAAIxX,EAAM/C,EAAK+J,OAASiW,GAASpB,EAAY5e,EAAK+J,QAC5C/J,EAAKgK,MAAQgW,GAASpB,EAAY5e,EAAKgK,OAAS,EAAI4U,EAAW3e,OAAS,EAC9Euc,EAAaxQ,OAAOjJ,EAAK,EAAG/C,EAAK8P,OACjCoH,EAAiBlL,OAAOjJ,EAAK,EAAG/C,EAAKua,MACrCqE,EAAW5S,OAAOjJ,EAAK,EAAG/C,EAAKH,KACnC,CACIG,EAAKigB,SACLtD,EAAa9a,KAAK7B,EAAKigB,QAC/B,CAEJ,GAAIZ,GAASzhB,EAAOmc,aAChB,IAAK,IAAI/Z,KAAQpC,EAAOmc,YAAa,CACjC,IAAI3Y,EAAQ0d,EAAYhe,QAAQd,EAAKH,MACrC,GAAIuB,GAAQ,EACRyd,EAAczd,GAASpB,EAAK8P,UAE3B,CACD,IAAI/M,EAAM/C,EAAK+J,OAASiW,GAASlB,EAAa9e,EAAK+J,QAC7C/J,EAAKgK,MAAQgW,GAASlB,EAAa9e,EAAKgK,OAAS,EAAI8U,EAAY7e,OAAS,EAChF4e,EAAc7S,OAAOjJ,EAAK,EAAG/C,EAAK8P,OAClCgP,EAAY9S,OAAOjJ,EAAK,EAAG/C,EAAKH,KACpC,CACJ,CAIJ,OAFIjC,EAAOsiB,OACPnB,EAAWA,EAAS/W,OAAOpK,EAAOsiB,OAC/B,IAAIvB,GAAetZ,EAASmX,EAActF,EAAkB0H,EAAYjC,EAAcc,EAAmBoB,EAAeC,EAAaC,EAChJ,CAIA,WAAAnB,CAAY/d,GACR,IAAIuB,EAAQ1D,KAAKshB,UAAUnf,GAC3B,GAAa,MAATuB,EACA,MAAM,IAAIhD,WAAW,sBAAsByB,MAC/C,OAAOuB,CACX,CAMA,WAAA2Y,CAAYxF,EAAM7G,GACd,IAAIkI,EAAK,IAAIuK,GAAcziB,KAAM6W,EAAM7G,GACvCsF,EAAO,IAAK,IAAIjQ,EAAM2K,EAAQ3K,EAAM6S,EAAG5P,KAAM,CACzC,IAAII,EAAOwP,EAAGwK,KAAKrd,GACnB,IAAK,IAAIsd,KAAS3iB,KAAKmhB,cACnB,GAAIwB,EAAO,CACP,IAAI9hB,EAAS8hB,EAAMzK,EAAIxP,EAAMrD,GAC7B,GAAIxE,GAAU,EAAG,CACbwE,EAAMxE,EACN,SAASyU,CACb,CACJ,CACJjQ,GACJ,CACA,OAAO6S,EAAG0K,eAAe,EAC7B,EAEJ,SAASjB,GAAShM,GACd,OAAY,MAALA,GAAaA,EAAEpT,OAAS,CACnC,CACA,SAASmf,GAAcpf,GACnB,IAAKM,MAAMC,QAAQP,GACf,OAAOA,EACX,GAAmB,GAAfA,EAAKC,OACL,OAAO,KACX,IAAIsgB,EAAOnB,GAAcpf,EAAK,IAC9B,GAAmB,GAAfA,EAAKC,OACL,OAAOsgB,EACX,IAAI3I,EAAOwH,GAAcpf,EAAKmJ,MAAM,IACpC,IAAKyO,IAAS2I,EACV,OAAOA,GAAQ3I,EACnB,IAAI4I,EAAO,CAACnN,EAAG/J,KAAO+J,GAAKhS,IAAM2G,OAAOsB,GAAKjI,IACzCof,EAAQF,EAAKL,KAAMQ,EAAQ9I,EAAKsI,KACpC,MAAO,CACHzgB,MAAO+gB,EAAKD,EAAK9gB,MAAOmY,EAAKnY,OAC7B6f,YAAakB,EAAKD,EAAKjB,YAAa1H,EAAK0H,aACzCS,WAAYS,EAAKD,EAAKR,WAAYnI,EAAKmI,YACvChG,YAAayG,EAAKD,EAAKxG,YAAanC,EAAKmC,aACzC8F,OAAQW,EAAKD,EAAKV,OAAQjI,EAAKiI,QAC/BK,KAAOO,EAAiBC,EACpB,CAAChd,EAAOgM,EAAOrB,EAAWsB,IAAW8Q,EAAMC,EAAMhd,EAAOgM,EAAOrB,EAAWsB,GAASD,EAAOrB,EAAWsB,GADzE8Q,EAAjBC,EAGvB,CACA,SAASV,GAASW,EAAO9gB,GACrB,IAAIuB,EAAQuf,EAAM7f,QAAQjB,GAC1B,GAAIuB,EAAQ,EACR,MAAM,IAAIhD,WAAW,iDAAiDyB,KAC1E,OAAOuB,CACX,CACA,IAAI4d,GAAY,CAAC3gB,EAASgD,MAC1B,IAAK,IAAWxB,EAAPsB,EAAI,EAAStB,EAAOoU,GAAK9S,GAAIA,IAClC6d,GAAU7d,GAAK9C,EAAS0B,OAAO,CAC3BlC,GAAIsD,EACJtB,OACAJ,MAAO0B,GAAK8S,GAAK2M,OAAS,GAAK,CAAC,CAACjjB,EAASkB,MAAOsC,KAAKiV,GAAoB,CAAC,QAAS,gBAAkB,CAAC,QAAS,eAChHlW,IAAa,YAARL,IAGb,MAAMwB,GAAO,GACb,MAAM+c,GACF,WAAA7gB,CAAY8H,GACR3H,KAAK2H,QAAUA,EACf3H,KAAKyW,QAAU,GACfzW,KAAK4J,MAAQ,EACjB,CACA,KAAAuS,CAAMvb,EAAMd,EAAMC,EAAI0E,EAAW,GAE7B,OADAzE,KAAKyW,QAAQtS,KAAKvD,EAAMd,EAAMC,EAAI,EAAe,EAAX0E,GAC/BzE,IACX,CACA,aAAAgb,CAAc+B,EAAM/M,EAAS,GACzB,IAAK,IAAI9C,KAAK6P,EACV7P,EAAEiW,QAAQnjB,KAAMgQ,GACpB,OAAOhQ,IACX,CACA,MAAAib,CAAOra,EAAM2B,GACT,OAAOiC,EAAK+C,MAAM,CACdG,OAAQ1H,KAAKyW,QACb9O,QAAS3H,KAAK2H,QACdE,OAAQ7H,KAAK4J,MACbmB,MAAOnK,EACP2B,UAER,EAKJ,MAAM6gB,GAIF,WAAAvjB,CAKAe,EAIAd,EAIAC,EAIA0E,EAAWd,IACP3D,KAAKY,KAAOA,EACZZ,KAAKF,KAAOA,EACZE,KAAKD,GAAKA,EACVC,KAAKyE,SAAWA,CACpB,CAIA,OAAA0e,CAAQzO,EAAK1E,GACT,IAAIqT,EAAW3O,EAAI+B,QAAQlU,OAC3BmS,EAAIsG,cAAchb,KAAKyE,SAAUuL,GACjC0E,EAAI+B,QAAQtS,KAAKnE,KAAKY,KAAMZ,KAAKF,KAAOkQ,EAAQhQ,KAAKD,GAAKiQ,EAAQ0E,EAAI+B,QAAQlU,OAAS,EAAI8gB,EAC/F,CAIA,MAAAvV,CAAOnG,GACH,OAAO,IAAI+Y,GAAO/Y,GAASqT,cAAchb,KAAKyE,UAAWzE,KAAKF,MAAMmb,OAAOjb,KAAKY,KAAMZ,KAAKD,GAAKC,KAAKF,KACzG,EAEJ,MAAM2gB,GACF,WAAA5gB,CAAY6B,EAAM5B,GACdE,KAAK0B,KAAOA,EACZ1B,KAAKF,KAAOA,CAChB,CACA,MAAIC,GAAO,OAAOC,KAAKF,KAAOE,KAAK0B,KAAKa,MAAQ,CAChD,QAAI3B,GAAS,OAAOZ,KAAK0B,KAAKd,KAAKT,EAAI,CACvC,YAAIsE,GAAa,OAAOd,EAAM,CAC9B,OAAAwf,CAAQzO,EAAK1E,GACT0E,EAAI9K,MAAMzF,KAAKnE,KAAK0B,MACpBgT,EAAI+B,QAAQtS,KAAKuQ,EAAI9K,MAAMrH,OAAS,EAAGvC,KAAKF,KAAOkQ,EAAQhQ,KAAKD,GAAKiQ,GAAQ,EACjF,CACA,MAAAlC,GAAW,OAAO9N,KAAK0B,IAAM,EAEjC,SAASmW,GAAIjX,EAAMd,EAAMC,EAAI0E,GACzB,OAAO,IAAI2e,GAAQxiB,EAAMd,EAAMC,EAAI0E,EACvC,CACA,MAAM6e,GAAqB,CAAE1d,QAAS,WAAY+Y,KAAM,gBAClD4E,GAAmB,CAAE3d,QAAS,WAAY+Y,KAAM,gBAChD6E,GAAY,CAAA,EAAIC,GAAa,CAAA,EACnC,MAAMC,GACF,WAAA7jB,CAAYe,EAAMd,EAAMC,EAAIuF,GACxBtF,KAAKY,KAAOA,EACZZ,KAAKF,KAAOA,EACZE,KAAKD,GAAKA,EACVC,KAAKsF,KAAOA,CAChB,EAEJ,MAAMqe,GAAY,qCAClB,IAAIC,GAAc,2DAClB,IACIA,GAAc,IAAIC,OAAO,kBAAmB,IAChD,CACA,MAAO9F,GAAK,CACZ,MAAM+F,GAAgB,CAClB,MAAAZ,CAAOhL,EAAIxP,EAAML,GACb,GAAY,IAARK,GAAyBL,GAAS6P,EAAG5P,IAAM,EAC3C,OAAO,EACX,IAAIyb,EAAU7L,EAAGwK,KAAKra,EAAQ,GAC9B,IAAK,IAAI5E,EAAI,EAAGA,EAAIkgB,GAAkBlgB,IAClC,GAAIkgB,GAAUpM,WAAW9T,IAAMsgB,EAC3B,OAAO7L,EAAG8L,OAAOnM,GAAItB,GAAK2M,OAAQ7a,EAAOA,EAAQ,IACzD,OAAO,CACX,EACA,MAAA4b,CAAO/L,EAAIxP,EAAML,GACb,GAAY,IAARK,EACA,OAAO,EACX,IAAIuL,EAAI,6BAA6BiQ,KAAKhM,EAAGzM,MAAMpD,EAAQ,EAAGA,EAAQ,KACtE,OAAO4L,EAAIiE,EAAG8L,OAAOnM,GAAItB,GAAK0N,OAAQ5b,EAAOA,EAAQ,EAAI4L,EAAE,GAAG1R,UAAW,CAC7E,EACA,UAAA4hB,CAAWjM,EAAIxP,EAAML,GACjB,GAAY,IAARK,GAAwBL,GAA+B,IAAtB6P,EAAGwK,KAAKra,EAAQ,GACjD,OAAO,EACX,IAAIhD,EAAMgD,EAAQ,EAClB,KAAOhD,EAAM6S,EAAG5P,KAAuB,IAAhB4P,EAAGwK,KAAKrd,IAC3BA,IACJ,IAAIkD,EAAOlD,EAAMgD,EAAO+b,EAAU,EAClC,KAAO/e,EAAM6S,EAAG5P,IAAKjD,IACjB,GAAoB,IAAhB6S,EAAGwK,KAAKrd,IAER,GADA+e,IACIA,GAAW7b,GAA4B,IAApB2P,EAAGwK,KAAKrd,EAAM,GACjC,OAAO6S,EAAG8L,OAAOnM,GAAItB,GAAK4N,WAAY9b,EAAOhD,EAAM,EAAG,CAClDwS,GAAItB,GAAKgF,SAAUlT,EAAOA,EAAQE,GAClCsP,GAAItB,GAAKgF,SAAUlW,EAAM,EAAIkD,EAAMlD,EAAM,WAIjD+e,EAAU,EAGlB,OAAO,CACX,EACA,OAAAC,CAAQnM,EAAIxP,EAAML,GACd,GAAY,IAARK,GAAwBL,GAAS6P,EAAG5P,IAAM,EAC1C,OAAO,EACX,IAAIgE,EAAQ4L,EAAGzM,MAAMpD,EAAQ,EAAG6P,EAAG5P,KAC/Bgc,EAAM,sIAAsIJ,KAAK5X,GACrJ,GAAIgY,EACA,OAAOpM,EAAG8L,OAAOnM,GAAItB,GAAKgO,SAAUlc,EAAOA,EAAQ,EAAIic,EAAI,GAAG/hB,OAAQ,CAClEsV,GAAItB,GAAK6G,SAAU/U,EAAOA,EAAQ,GAElCwP,GAAItB,GAAKiO,IAAKnc,EAAQ,EAAGA,EAAQic,EAAI,GAAG/hB,QACxCsV,GAAItB,GAAK6G,SAAU/U,EAAQic,EAAI,GAAG/hB,OAAQ8F,EAAQ,EAAIic,EAAI,GAAG/hB,WAGrE,IAAIkiB,EAAU,+BAA+BP,KAAK5X,GAClD,GAAImY,EACA,OAAOvM,EAAG8L,OAAOnM,GAAItB,GAAKmO,QAASrc,EAAOA,EAAQ,EAAIoc,EAAQ,GAAGliB,SACrE,IAAIoiB,EAAW,cAAcT,KAAK5X,GAClC,GAAIqY,EACA,OAAOzM,EAAG8L,OAAOnM,GAAItB,GAAKqO,sBAAuBvc,EAAOA,EAAQ,EAAIsc,EAAS,GAAGpiB,SACpF,IAAI0R,EAAI,mKAAmKiQ,KAAK5X,GAChL,OAAK2H,EAEEiE,EAAG8L,OAAOnM,GAAItB,GAAK8N,QAAShc,EAAOA,EAAQ,EAAI4L,EAAE,GAAG1R,UADhD,CAEf,EACA,QAAAsiB,CAAS3M,EAAIxP,EAAML,GACf,GAAY,IAARK,GAAsB,IAARA,EACd,OAAO,EACX,IAAIrD,EAAMgD,EAAQ,EAClB,KAAO6P,EAAGwK,KAAKrd,IAAQqD,GACnBrD,IACJ,IAAIgH,EAAS6L,EAAGzM,MAAMpD,EAAQ,EAAGA,GAAQiE,EAAQ4L,EAAGzM,MAAMpG,EAAKA,EAAM,GACjEyf,EAAUlB,GAAY/e,KAAKwH,GAAS0Y,EAASnB,GAAY/e,KAAKyH,GAC9D0Y,EAAU,QAAQngB,KAAKwH,GAAS4Y,EAAS,QAAQpgB,KAAKyH,GACtD4Y,GAAgBD,KAAYF,GAAUC,GAAWF,GACjDK,GAAiBH,KAAaF,GAAWG,GAAUF,GACnDK,EAAUF,IAAyB,IAARxc,IAAeyc,GAAiBL,GAC3DO,EAAWF,IAA0B,IAARzc,IAAewc,GAAgBH,GAChE,OAAO7M,EAAG8L,OAAO,IAAIN,GAAwB,IAARhb,EAAa4a,GAAqBC,GAAkBlb,EAAOhD,GAAM+f,EAAU,EAAoB,IAAsBC,EAAW,EAAqB,IAC9L,EACA,SAAAC,CAAUpN,EAAIxP,EAAML,GAChB,GAAY,IAARK,GAA+C,IAAtBwP,EAAGwK,KAAKra,EAAQ,GACzC,OAAO6P,EAAG8L,OAAOnM,GAAItB,GAAK+O,UAAWjd,EAAOA,EAAQ,IACxD,GAAY,IAARK,EAAY,CACZ,IAAIrD,EAAMgD,EAAQ,EAClB,KAAuB,IAAhB6P,EAAGwK,KAAKrd,IACXA,IACJ,GAAoB,IAAhB6S,EAAGwK,KAAKrd,IAAcA,GAAOgD,EAAQ,EACrC,OAAO6P,EAAG8L,OAAOnM,GAAItB,GAAK+O,UAAWjd,EAAOhD,EAAM,GAC1D,CACA,OAAO,CACX,EACAkgB,KAAI,CAACrN,EAAIxP,EAAML,IACI,IAARK,EAAuBwP,EAAG8L,OAAO,IAAIN,GAAgBF,GAAWnb,EAAOA,EAAQ,EAAG,KAAsB,EAEnHmd,MAAK,CAACtN,EAAIxP,EAAML,IACG,IAARK,GAA8C,IAAtBwP,EAAGwK,KAAKra,EAAQ,GACzC6P,EAAG8L,OAAO,IAAIN,GAAgBD,GAAYpb,EAAOA,EAAQ,EAAG,KAAsB,EAE5F,OAAAod,CAAQvN,EAAIxP,EAAML,GACd,GAAY,IAARK,EACA,OAAO,EAEX,IAAK,IAAIjF,EAAIyU,EAAGwN,MAAMnjB,OAAS,EAAGkB,GAAK,EAAGA,IAAK,CAC3C,IAAIkiB,EAAOzN,EAAGwN,MAAMjiB,GACpB,GAAIkiB,aAAgBjC,KAAoBiC,EAAK/kB,MAAQ4iB,IAAamC,EAAK/kB,MAAQ6iB,IAAa,CAGxF,IAAKkC,EAAKrgB,MAAQ4S,EAAGb,UAAUsO,EAAK5lB,KAAOsI,IAAU,QAAQxD,KAAKqT,EAAGzM,MAAMpD,EAAQ,EAAGA,EAAQ,IAE1F,OADA6P,EAAGwN,MAAMjiB,GAAK,MACP,EAIX,IAAIgT,EAAUyB,EAAG0N,YAAYniB,GACzBoiB,EAAO3N,EAAGwN,MAAMjiB,GAAKqiB,GAAW5N,EAAIzB,EAASkP,EAAK/kB,MAAQ4iB,GAAYjN,GAAKgP,KAAOhP,GAAKiP,MAAOG,EAAK7lB,KAAMuI,EAAQ,GAErH,GAAIsd,EAAK/kB,MAAQ4iB,GACb,IAAK,IAAIzZ,EAAI,EAAGA,EAAItG,EAAGsG,IAAK,CACxB,IAAIiE,EAAIkK,EAAGwN,MAAM3b,GACbiE,aAAa0V,IAAmB1V,EAAEpN,MAAQ4iB,KAC1CxV,EAAE1I,KAAO,EACjB,CACJ,OAAOugB,EAAK9lB,EAChB,CACJ,CACA,OAAO,CACX,GAEJ,SAAS+lB,GAAW5N,EAAIzB,EAAS7V,EAAMyH,EAAOM,GAC1C,IAAIkO,KAAEA,GAASqB,EAAIxP,EAAOwP,EAAGwK,KAAK/Z,GAAWI,EAASJ,EAGtD,GAFA8N,EAAQ7H,QAAQiJ,GAAItB,GAAK6G,SAAU/U,EAAOA,GAASzH,GAAQ2V,GAAKiP,MAAQ,EAAI,KAC5E/O,EAAQtS,KAAK0T,GAAItB,GAAK6G,SAAUzU,EAAW,EAAGA,IAClC,IAARD,EAAsB,CACtB,IACuD2U,EADnDhY,EAAM6S,EAAGb,UAAU1O,EAAW,GAC9Bod,EAAOtI,GAAS5G,EAAMxR,EAAM6S,EAAGlI,OAAQkI,EAAGlI,QAC1C+V,IACA1gB,EAAM6S,EAAGb,UAAU0O,EAAKhmB,IAEpBsF,GAAO0gB,EAAKhmB,KACZsd,EAAQC,GAAezG,EAAMxR,EAAM6S,EAAGlI,OAAQkI,EAAGlI,QAC7CqN,IACAhY,EAAM6S,EAAGb,UAAUgG,EAAMtd,OAGjB,IAAhBmY,EAAGwK,KAAKrd,KACRoR,EAAQtS,KAAK0T,GAAItB,GAAK6G,SAAUzU,EAAUA,EAAW,IACrDI,EAAS1D,EAAM,EACX0gB,GACAtP,EAAQtS,KAAK4hB,GACb1I,GACA5G,EAAQtS,KAAKkZ,GACjB5G,EAAQtS,KAAK0T,GAAItB,GAAK6G,SAAU/X,EAAK0D,IAE7C,MACK,GAAY,IAARL,EAAsB,CAC3B,IAAIsd,EAAQ7I,GAAetG,EAAMlO,EAAWuP,EAAGlI,OAAQkI,EAAGlI,QAAQ,GAC9DgW,IACAvP,EAAQtS,KAAK6hB,GACbjd,EAASid,EAAMjmB,GAEvB,CACA,OAAO8X,GAAIjX,EAAMyH,EAAOU,EAAQ0N,EACpC,CAIA,SAASgH,GAAS5G,EAAMxO,EAAO2H,GAE3B,GAAY,IADD6G,EAAKU,WAAWlP,GACD,CACtB,IAAK,IAAIhD,EAAMgD,EAAQ,EAAGhD,EAAMwR,EAAKtU,OAAQ8C,IAAO,CAChD,IAAIT,EAAKiS,EAAKU,WAAWlS,GACzB,GAAU,IAANT,EACA,OAAOiT,GAAItB,GAAKiO,IAAKnc,EAAQ2H,EAAQ3K,EAAM,EAAI2K,GACnD,GAAU,IAANpL,GAAkB,IAANA,EACZ,OAAO,CACf,CACA,OAAO,IACX,CACK,CACD,IAAIwD,EAAQ,EAAG/C,EAAMgD,EACrB,IAAK,IAAI0b,GAAU,EAAO1e,EAAMwR,EAAKtU,OAAQ8C,IAAO,CAChD,IAAIT,EAAKiS,EAAKU,WAAWlS,GACzB,GAAIyT,GAAMlU,GACN,MAEC,GAAImf,EACLA,GAAU,OAET,GAAU,IAANnf,EACLwD,SAEC,GAAU,IAANxD,EAAoB,CACzB,IAAKwD,EACD,MACJA,GACJ,MACe,IAANxD,IACLmf,GAAU,EAElB,CACA,OAAO1e,EAAMgD,EAAQwP,GAAItB,GAAKiO,IAAKnc,EAAQ2H,EAAQ3K,EAAM2K,GAAU3K,GAAOwR,EAAKtU,QAAS,IAC5F,CACJ,CACA,SAAS+a,GAAezG,EAAMxO,EAAO2H,GACjC,IAAItH,EAAOmO,EAAKU,WAAWlP,GAC3B,GAAY,IAARK,GAAsB,IAARA,GAAsB,IAARA,EAC5B,OAAO,EACX,IAAIJ,EAAc,IAARI,EAAa,GAAKA,EAC5B,IAAK,IAAIrD,EAAMgD,EAAQ,EAAG0b,GAAU,EAAO1e,EAAMwR,EAAKtU,OAAQ8C,IAAO,CACjE,IAAIT,EAAKiS,EAAKU,WAAWlS,GACzB,GAAI0e,EACAA,GAAU,MACT,IAAInf,GAAM0D,EACX,OAAOuP,GAAItB,GAAK0P,UAAW5d,EAAQ2H,EAAQ3K,EAAM,EAAI2K,GAC1C,IAANpL,IACLmf,GAAU,EAAI,CACtB,CACA,OAAO,IACX,CACA,SAAS5G,GAAetG,EAAMxO,EAAO2H,EAAQkW,GACzC,IAAK,IAAInC,GAAU,EAAO1e,EAAMgD,EAAQ,EAAGC,EAAMyD,KAAK4F,IAAIkF,EAAKtU,OAAQ8C,EAAM,KAAMA,EAAMiD,EAAKjD,IAAO,CACjG,IAAIT,EAAKiS,EAAKU,WAAWlS,GACzB,GAAI0e,EACAA,GAAU,MACT,IAAU,IAANnf,EACL,OAAOshB,GAAuBrO,GAAItB,GAAK4P,UAAW9d,EAAQ2H,EAAQ3K,EAAM,EAAI2K,GAI5E,GAFIkW,IAAiBpN,GAAMlU,KACvBshB,GAAe,GACT,IAANthB,EACA,OAAO,EACI,IAANA,IACLmf,GAAU,EAClB,CACJ,CACA,OAAO,IACX,CAKA,MAAMtB,GAIF,WAAA5iB,CAIA+B,EAIAiV,EAIA7G,GACIhQ,KAAK4B,OAASA,EACd5B,KAAK6W,KAAOA,EACZ7W,KAAKgQ,OAASA,EAIdhQ,KAAK0lB,MAAQ,EACjB,CAKA,IAAAhD,CAAKrd,GAAO,OAAOA,GAAOrF,KAAKsI,KAAM,EAAKtI,KAAK6W,KAAKU,WAAWlS,EAAMrF,KAAKgQ,OAAS,CAInF,OAAI1H,GAAQ,OAAOtI,KAAKgQ,OAAShQ,KAAK6W,KAAKtU,MAAQ,CAKnD,KAAAkJ,CAAM3L,EAAMC,GAAM,OAAOC,KAAK6W,KAAKpL,MAAM3L,EAAOE,KAAKgQ,OAAQjQ,EAAKC,KAAKgQ,OAAS,CAIhF,MAAAgU,CAAOnM,GAEH,OADA7X,KAAK0lB,MAAMvhB,KAAK0T,GACTA,EAAI9X,EACf,CAOA,YAAAqmB,CAAaxlB,EAAMd,EAAMC,EAAI0Q,EAAM4V,GAC/B,OAAOrmB,KAAKgkB,OAAO,IAAIN,GAAgB9iB,EAAMd,EAAMC,GAAK0Q,EAAO,EAAoB,IAAsB4V,EAAQ,EAAqB,IAC1I,CAKA,eAAIC,GACA,IAAK,IAAI7iB,EAAIzD,KAAK0lB,MAAMnjB,OAAS,EAAGkB,GAAK,EAAGA,IAAK,CAC7C,IAAIkiB,EAAO3lB,KAAK0lB,MAAMjiB,GACtB,GAAIkiB,aAAgBjC,KAAoBiC,EAAK/kB,MAAQ4iB,IAAamC,EAAK/kB,MAAQ6iB,IAC3E,OAAO,CACf,CACA,OAAO,CACX,CAIA,UAAAtD,CAAWtI,GACP,OAAO7X,KAAKgkB,OAAOnM,EACvB,CAKA,cAAA+K,CAAe9iB,GAEX,IAAK,IAAI2D,EAAI3D,EAAM2D,EAAIzD,KAAK0lB,MAAMnjB,OAAQkB,IAAK,CAC3C,IAAI4iB,EAAQrmB,KAAK0lB,MAAMjiB,GACvB,KAAM4iB,aAAiB3C,IAAmB2C,EAAMzlB,KAAKgF,SAAyB,EAAbygB,EAAM/gB,MACnE,SACJ,IAEImL,EAFA8V,EAAMF,EAAMzlB,MAAQ0iB,IAAsB+C,EAAMzlB,MAAQ2iB,GACxDiD,EAAYH,EAAMtmB,GAAKsmB,EAAMvmB,KACvBiK,EAAItG,EAAI,EAElB,KAAOsG,GAAKjK,EAAMiK,IAAK,CACnB,IAAI4b,EAAO3lB,KAAK0lB,MAAM3b,GACtB,GAAI4b,aAAgBjC,IAAgC,EAAZiC,EAAKrgB,MAA6BqgB,EAAK/kB,MAAQylB,EAAMzlB,QAEvF2lB,IAAsB,EAAbF,EAAM/gB,MAA0C,EAAZqgB,EAAKrgB,QAC/CqgB,EAAK5lB,GAAK4lB,EAAK7lB,KAAO0mB,GAAa,GAAK,KAAOb,EAAK5lB,GAAK4lB,EAAK7lB,MAAQ,GAAK0mB,EAAY,IAAK,CACjG/V,EAAOkV,EACP,KACJ,CACJ,CACA,IAAKlV,EACD,SACJ,IAAI7P,EAAOylB,EAAMzlB,KAAKgF,QAAS6Q,EAAU,GACrCpO,EAAQoI,EAAK3Q,KAAMwI,EAAM+d,EAAMtmB,GAGnC,GAAIwmB,EAAK,CACL,IAAIhe,EAAOwD,KAAK4F,IAAI,EAAGlB,EAAK1Q,GAAK0Q,EAAK3Q,KAAM0mB,GAC5Cne,EAAQoI,EAAK1Q,GAAKwI,EAClBD,EAAM+d,EAAMvmB,KAAOyI,EACnB3H,EAAe,GAAR2H,EAAY,WAAa,gBACpC,CAEIkI,EAAK7P,KAAK+d,MACVlI,EAAQtS,KAAKnE,KAAK6X,IAAIpH,EAAK7P,KAAK+d,KAAMtW,EAAOoI,EAAK1Q,KACtD,IAAK,IAAI0mB,EAAI1c,EAAI,EAAG0c,EAAIhjB,EAAGgjB,IACnBzmB,KAAK0lB,MAAMe,aAAcrD,IACzB3M,EAAQtS,KAAKnE,KAAK0lB,MAAMe,IAC5BzmB,KAAK0lB,MAAMe,GAAK,KAEhBJ,EAAMzlB,KAAK+d,MACXlI,EAAQtS,KAAKnE,KAAK6X,IAAIwO,EAAMzlB,KAAK+d,KAAM0H,EAAMvmB,KAAMwI,IACvD,IAAIoe,EAAU1mB,KAAK6X,IAAIjX,EAAMyH,EAAOC,EAAKmO,GAEzCzW,KAAK0lB,MAAM3b,GAAKwc,GAAO9V,EAAK3Q,MAAQuI,EAAQ,IAAIqb,GAAgBjT,EAAK7P,KAAM6P,EAAK3Q,KAAMuI,EAAOoI,EAAKnL,MAAQ,MAC/FtF,KAAK0lB,MAAMjiB,GAAK8iB,GAAOF,EAAMtmB,IAAMuI,EAAM,IAAIob,GAAgB2C,EAAMzlB,KAAM0H,EAAK+d,EAAMtmB,GAAIsmB,EAAM/gB,MAAQ,MAG7GtF,KAAK0lB,MAAMpX,OAAO7K,EAAG,EAAGijB,GAExB1mB,KAAK0lB,MAAMjiB,GAAKijB,CACxB,CAEA,IAAI7lB,EAAS,GACb,IAAK,IAAI4C,EAAI3D,EAAM2D,EAAIzD,KAAK0lB,MAAMnjB,OAAQkB,IAAK,CAC3C,IAAIkiB,EAAO3lB,KAAK0lB,MAAMjiB,GAClBkiB,aAAgBvC,IAChBviB,EAAOsD,KAAKwhB,EACpB,CACA,OAAO9kB,CACX,CAMA,oBAAA8lB,CAAqB/lB,GACjB,IAAK,IAAI6C,EAAIzD,KAAK0lB,MAAMnjB,OAAS,EAAGkB,GAAK,EAAGA,IAAK,CAC7C,IAAIkiB,EAAO3lB,KAAK0lB,MAAMjiB,GACtB,GAAIkiB,aAAgBjC,IAAmBiC,EAAK/kB,MAAQA,GAAqB,EAAZ+kB,EAAKrgB,KAC9D,OAAO7B,CACf,CACA,OAAO,IACX,CAQA,WAAAmiB,CAAY9a,GACR,IAAI2L,EAAUzW,KAAK4iB,eAAe9X,GAElC,OADA9K,KAAK0lB,MAAMnjB,OAASuI,EACb2L,CACX,CAOA,cAAAmQ,CAAevgB,GACX,IAAIsf,EAAO3lB,KAAK0lB,MAAMrf,GACtB,OAAOsf,aAAgBjC,GAAkBiC,EAAO,IACpD,CAMA,SAAAtO,CAAUvX,GAAQ,OAAOuX,GAAUrX,KAAK6W,KAAM/W,EAAOE,KAAKgQ,QAAUhQ,KAAKgQ,MAAQ,CACjF,GAAA6H,CAAIjX,EAAMd,EAAMC,EAAI0E,GAChB,MAAmB,iBAAR7D,EACAiX,GAAI7X,KAAK4B,OAAOse,YAAYtf,GAAOd,EAAMC,EAAI0E,GACjD,IAAIgc,GAAY7f,EAAMd,EACjC,EAUJ,SAASsgB,GAAYyG,EAAUnQ,GAC3B,IAAKA,EAAMnU,OACP,OAAOskB,EACX,IAAKA,EAAStkB,OACV,OAAOmU,EACX,IAAIqG,EAAO8J,EAASpb,QAASqb,EAAK,EAClC,IAAK,IAAInI,KAAQjI,EAAO,CACpB,KAAOoQ,EAAK/J,EAAKxa,QAAUwa,EAAK+J,GAAI/mB,GAAK4e,EAAK5e,IAC1C+mB,IACJ,GAAIA,EAAK/J,EAAKxa,QAAUwa,EAAK+J,GAAIhnB,KAAO6e,EAAK7e,KAAM,CAC/C,IAAIoN,EAAI6P,EAAK+J,GACT5Z,aAAakW,KACbrG,EAAK+J,GAAM,IAAI1D,GAAQlW,EAAEtM,KAAMsM,EAAEpN,KAAMoN,EAAEnN,GAAIqgB,GAAYlT,EAAEzI,SAAU,CAACka,KAC9E,MAEI5B,EAAKzO,OAAOwY,IAAM,EAAGnI,EAE7B,CACA,OAAO5B,CACX,CAxBA0F,GAAcsE,UAAYvD,GAI1Bf,GAAcuE,WAAavD,GAuB3B,MAAMwD,GAAU,CAAC1Q,GAAK2E,UAAW3E,GAAKwC,SAAUxC,GAAK8B,YAAa9B,GAAKiC,YACvE,MAAM7E,GACF,WAAA9T,CAAY8Q,EAAWqB,GACnBhS,KAAK2Q,UAAYA,EACjB3Q,KAAKgS,MAAQA,EAEbhS,KAAKyD,EAAI,EAETzD,KAAKknB,SAAW,KAChBlnB,KAAKmnB,aAAc,EAGnBnnB,KAAKgF,OAAS,KACV2L,EAAUpO,SACVvC,KAAKknB,SAAWvW,EAAU3Q,KAAKyD,KACvC,CACA,YAAA2jB,GACIpnB,KAAKknB,SAAWlnB,KAAKyD,EAAIzD,KAAK2Q,UAAUpO,OAASvC,KAAK2Q,UAAU3Q,KAAKyD,KAAO,KAC5EzD,KAAKgF,OAAS,KACdhF,KAAKmnB,aAAc,CACvB,CACA,MAAA3hB,CAAOH,EAAKwT,GACR,KAAO7Y,KAAKknB,UAAYlnB,KAAKknB,SAASnnB,IAAMsF,GACxCrF,KAAKonB,eACT,IAAKpnB,KAAKknB,UAAYlnB,KAAKknB,SAASpnB,MAAQuF,EAAMA,EAAM,EAAI,GACxD,OAAO,EACX,GAAIrF,KAAKmnB,YAAc,EAAG,CACtB,IAAI7e,EAAMtI,KAAKknB,SAASnnB,GACxB,KAAOuI,EAAM,GAAsC,MAAjCtI,KAAKgS,MAAMU,KAAKpK,EAAM,EAAGA,IACvCA,IACJtI,KAAKmnB,YAAc7e,EAAMA,EAAM,EAAI,CACvC,CACA,IAAIvB,EAAI/G,KAAKgF,OACR+B,IACDA,EAAI/G,KAAKgF,OAAShF,KAAKknB,SAASxlB,KAAKsD,SACrC+B,EAAEE,cAEN,IAAIyG,EAAOrI,EAAMrF,KAAKknB,SAASlX,OAC/B,KAAOjJ,EAAEhH,IAAM2N,OACN3G,EAAEX,SACH,OAAO,EACf,OAAS,CACL,GAAIW,EAAEjH,MAAQ4N,EACV,OAAO1N,KAAKknB,SAASpnB,MAAQ+Y,EACjC,IAAK9R,EAAE0G,WAAWC,GACd,OAAO,CACf,CACJ,CACA,OAAAyR,CAAQ/I,GACJ,IAAI1U,EAAO1B,KAAKgF,OAAOtD,KACvB,OAAOA,GAAQA,EAAKoB,KAAK7C,EAASqB,cAAgB8U,CACtD,CACA,SAAAiJ,CAAUnH,GACN,IAAInK,EAAM/N,KAAKgF,OAAQoM,EAAMpR,KAAKknB,SAASlX,OAAQqX,EAAUrnB,KAAKmnB,aAAennB,KAAKknB,SAAS1W,QAAU,EAAI,GACzGnI,EAAQ6P,EAAGqG,kBAAmBjW,EAAMD,EAAOif,EAASpP,EAAGE,MAAM3T,SAASlC,OACtEglB,EAAUjf,EAAKkf,EAAQF,EAC3B,OAAS,CACL,GAAIvZ,EAAIhO,GAAKqR,EAAMiW,EAAS,CACxB,GAAItZ,EAAInN,KAAKsC,aAAe6K,EAAI9G,aAC5B,SACJ,KACJ,CACA,IAAI5B,EAAMia,GAAWvR,EAAIjO,KAAOsR,EAAK8G,EAAGjG,QACxC,GAAIlE,EAAIhO,GAAKqR,GAAO8G,EAAGjG,OAAOiG,EAAGoG,QAAQve,GACrCmY,EAAG6C,QAAQhN,EAAIrM,KAAM2D,OAEpB,CACD,IAAIoiB,EAAQ,IAAIjjB,EAAK0T,EAAGtW,OAAO+F,QAAQ9D,MAAM0S,GAAKiK,WAAY,GAAI,GAAI,EAAGtI,EAAGE,MAAM/B,UAClF6B,EAAGkG,kBAAkB3Y,IAAIgiB,EAAO1Z,EAAIrM,MACpCwW,EAAG6C,QAAQ0M,EAAOpiB,EACtB,CAiBA,GAZI0I,EAAInN,KAAKuC,GAAG,WACR8jB,GAAQ7jB,QAAQ2K,EAAInN,KAAKT,IAAM,GAC/BmI,EAAMyF,EAAIhO,GAAKqR,EACfkW,EAASpP,EAAGE,MAAM3T,SAASlC,SAG3B+F,EAAMif,EACND,EAASE,GAEbD,EAAUxZ,EAAIhO,GAAKqR,EACnBoW,EAAQtP,EAAGE,MAAM3T,SAASlC,SAEzBwL,EAAI7G,cACL,KACR,CACA,KAAOgR,EAAGE,MAAM3T,SAASlC,OAAS+kB,GAC9BpP,EAAGE,MAAM3T,SAAS2F,MAClB8N,EAAGE,MAAM1T,UAAU0F,MAEvB,OAAO9B,EAAMD,CACjB,EAKJ,SAASiX,GAAWoI,EAAKzV,GACrB,IAAI5M,EAAMqiB,EACV,IAAK,IAAIjkB,EAAI,EAAGA,EAAIwO,EAAO1P,OAAQkB,IAAK,CACpC,IAAI+R,EAAUvD,EAAOxO,EAAI,GAAG1D,GAAI0V,EAAQxD,EAAOxO,GAAG3D,KAC9C0V,EAAUkS,IACVriB,GAAOoQ,EAAQD,EACvB,CACA,OAAOnQ,CACX,CACA,MAAMsiB,GAAuBzF,EAAU,CACnC,iBAAkB0F,EAAKC,MACvB/L,eAAgB8L,EAAKE,iBACrB,qCAAsCF,EAAKG,SAC3C,qCAAsCH,EAAKI,SAC3C,kBAAmBJ,EAAKK,SACxB,kBAAmBL,EAAKM,SACxB,kBAAmBN,EAAKO,SACxB,kBAAmBP,EAAKQ,SACxB,uBAAwBR,EAAKnD,QAC7BvB,OAAQ0E,EAAKS,OACbpE,OAAQ2D,EAAKU,UACb,eAAgBV,EAAKW,SACrB,qBAAsBX,EAAKY,OAC3B,qBAAsBZ,EAAK/B,KAC3B,iCAAkC+B,EAAKa,KACvC,iBAAkBb,EAAKC,MACvB,sBAAuBD,EAAKc,UAC5B,eAAgBd,EAAKtD,IACrB,yEAA0EsD,EAAKe,sBAC/E,qBAAsBf,EAAKgB,UAC3B3C,UAAW2B,EAAKrV,OAChBiO,UAAWoH,EAAKnR,UAKd7U,GAAS,IAAIqf,GAAe,IAAIrd,EAAQ0d,IAAWxd,OAAO6jB,IAAuB1lB,OAAO4mB,KAAKrO,IAAqBnX,IAAIsL,GAAK6L,GAAoB7L,IAAK1M,OAAO4mB,KAAKrO,IAAqBnX,IAAIsL,GAAK8K,GAAkB9K,IAAK1M,OAAO4mB,KAAKrO,IAAsBwD,GAAgBtF,GAAmBzW,OAAO4mB,KAAK/E,IAAezgB,IAAIsL,GAAKmV,GAAcnV,IAAK1M,OAAO4mB,KAAK/E,IAAgB,IAEnX,SAASgF,GAAcvlB,EAAMzD,EAAMC,GAC/B,IAAIkS,EAAS,GACb,IAAK,IAAItD,EAAIpL,EAAK0D,WAAY5B,EAAMvF,GAAO6O,EAAIA,EAAEzH,YAAa,CAC1D,IAAIoK,EAAU3C,EAAIA,EAAE7O,KAAOC,EAG3B,GAFIuR,EAAUjM,GACV4M,EAAO9N,KAAK,CAAErE,KAAMuF,EAAKtF,GAAIuR,KAC5B3C,EACD,MACJtJ,EAAMsJ,EAAE5O,EACZ,CACA,OAAOkS,CACX,CAKA,SAAS8W,GAAU7oB,GACf,IAAI8oB,WAAEA,EAAUC,WAAEA,GAAe/oB,EAC7BsiB,GDhOYrP,ECgOM,CAAC5P,EAAMyO,KACzB,IAAI7R,EAAKoD,EAAK3C,KAAKT,GACnB,IAAI6oB,GAAe7oB,GAAMoW,GAAK2E,WAAa/a,GAAMoW,GAAK4E,YAWjD,GAAI8N,IAAe9oB,GAAMoW,GAAKgG,WAAapc,GAAMoW,GAAK8N,SAAWlkB,GAAMoW,GAAKmG,cAC7E,MAAO,CAAE9a,OAAQqnB,EAAYtnB,QAASmnB,GAAcvlB,EAAKA,KAAMA,EAAKzD,KAAMyD,EAAKxD,SAZhB,CAC/D,IAAImpB,EAAO,GACX,GAAI/oB,GAAMoW,GAAK4E,WAAY,CACvB,IAAIgO,EAAW5lB,EAAKA,KAAK6I,SAASmK,GAAKiF,UACnC2N,IACAD,EAAOlX,EAAMU,KAAKyW,EAASrpB,KAAMqpB,EAASppB,IAClD,CACA,IAAI6B,EAASonB,EAAWE,GACxB,GAAItnB,EACA,MAAO,CAAEA,SAAQD,QAAS4B,GAAQA,EAAK3C,KAAKT,IAAMoW,GAAKgE,SAAU1Y,UAAW1B,GAAMoW,GAAK4E,WAC/F,CAIA,OAAO,MD/OJ,CAAC/I,EAAOJ,EAAOrB,EAAWsB,IAAW,IAAIiB,GAAWd,EAAOe,EAAMnB,EAAOrB,EAAWsB,IAD9F,IAAoBkB,ECkPhB,MAAO,CAAEqP,OACb,CAEA,MAAM4G,GAAqB,CAAExjB,QAAS,gBAAiB+Y,KAAM,qBAMvD0K,GAAgB,CAClBzH,YAAa,CAAC,CACNzf,KAAM,gBACN6f,MAAO,CAAE,oBAAqB4F,EAAK0B,gBACpC,CACCnnB,KAAM,oBACN6f,MAAO4F,EAAKe,wBAEpBtM,YAAa,CAAC,CACNla,KAAM,gBACN,KAAAiQ,CAAM8F,EAAIxP,EAAMrD,GACZ,GAAY,KAARqD,GAA6C,KAApBwP,EAAGwK,KAAKrd,EAAM,IAAiC,KAApB6S,EAAGwK,KAAKrd,EAAM,GAClE,OAAO,EACX,IAAIgH,EAAS6L,EAAGzM,MAAMpG,EAAM,EAAGA,GAAMiH,EAAQ4L,EAAGzM,MAAMpG,EAAM,EAAGA,EAAM,GACjE2f,EAAU,QAAQngB,KAAKwH,GAAS4Y,EAAS,QAAQpgB,KAAKyH,GACtDwY,EAAUlB,GAAY/e,KAAKwH,GAAS0Y,EAASnB,GAAY/e,KAAKyH,GAClE,OAAO4L,EAAGkO,aAAagD,GAAoB/jB,EAAKA,EAAM,GAAI4f,KAAYF,GAAUC,GAAWF,IAAWE,KAAaF,GAAWG,GAAUF,GAC5I,EACAzY,MAAO,cAKnB,SAASid,GAASrR,EAAIC,EAAMzM,EAAS,EAAGqR,EAAM/M,EAAS,GACnD,IAAIsJ,EAAQ,EAAGnE,GAAQ,EAAMqU,GAAY,EAAIC,KAAcC,GAAM,EAC7DC,EAAY,KACZ5M,EAAK5Y,KAAK+T,EAAGL,IAAI,YAAa7H,EAASwZ,EAAWxZ,EAASyZ,EAASvR,EAAGtW,OAAOya,YAAYlE,EAAK1M,MAAM+d,EAAWC,GAAUzZ,EAASwZ,MAEvI,IAAK,IAAI/lB,EAAIiI,EAAQjI,EAAI0U,EAAK5V,OAAQkB,IAAK,CACvC,IAAIiF,EAAOyP,EAAKZ,WAAW9T,GACf,KAARiF,GAA0BghB,GAWrBA,GAAe,IAARhhB,GAAsB,GAARA,KACtB8gB,EAAY,IACZA,EAAY/lB,GAChBgmB,EAAUhmB,EAAI,MAbT0R,GAASqU,GAAY,IACtBlQ,IACJnE,GAAQ,EACJ4H,IACIyM,GAAY,GACZG,IACJ5M,EAAK5Y,KAAK+T,EAAGL,IAAI,iBAAkBpU,EAAIuM,EAAQvM,EAAIuM,EAAS,KAEhEwZ,EAAYC,GAAU,GAO1BC,GAAOA,GAAe,IAARhhB,CAClB,CAMA,OALI8gB,GAAY,IACZlQ,IACIyD,GACA4M,KAEDrQ,CACX,CACA,SAASsQ,GAAQ5oB,EAAKqH,GAClB,IAAK,IAAI5E,EAAI4E,EAAO5E,EAAIzC,EAAIuB,OAAQkB,IAAK,CACrC,IAAIiF,EAAO1H,EAAIuW,WAAW9T,GAC1B,GAAY,KAARiF,EACA,OAAO,EACC,IAARA,GACAjF,GACR,CACA,OAAO,CACX,CACA,MAAMomB,GAAgB,8CACtB,MAAMC,GACF,WAAAjqB,GAIIG,KAAK+pB,KAAO,IAChB,CACA,QAAAnP,CAAS1C,EAAIC,EAAM0E,GACf,GAAiB,MAAb7c,KAAK+pB,KAAc,CAEnB,IAAIC,EACJ,GAFAhqB,KAAK+pB,MAAO,GAEM,IAAb5R,EAAKzP,MAA2B,IAAbyP,EAAKzP,MAA2B,KAAbyP,EAAKzP,OAC5CmhB,GAAchlB,KAAKmlB,EAAW7R,EAAKtB,KAAKpL,MAAM0M,EAAK9S,MAAO,CAC1D,IAAI4kB,EAAW,GAAiBV,GAASrR,EAAI2E,EAAKpG,QAAS,EAAGwT,EAAUpN,EAAKxU,QAC3DkhB,GAASrR,EAAI8R,EAAU,KACrChqB,KAAK+pB,KAAO,CAAC7R,EAAGL,IAAI,cAAegF,EAAKxU,MAAOwU,EAAKxU,MAAQwU,EAAKpG,QAAQlU,OAAQ0nB,GAC7E/R,EAAGL,IAAI,iBAAkBK,EAAGW,UAAYV,EAAK9S,IAAK6S,EAAGW,UAAYV,EAAKtB,KAAKtU,SACvF,CACJ,MACK,GAAIvC,KAAK+pB,KAAM,CAChB,IAAItT,EAAU,GACd8S,GAASrR,EAAIC,EAAKtB,KAAMsB,EAAK9S,IAAKoR,EAASyB,EAAGW,WAC9C7Y,KAAK+pB,KAAK5lB,KAAK+T,EAAGL,IAAI,WAAYK,EAAGW,UAAYV,EAAK9S,IAAK6S,EAAGW,UAAYV,EAAKtB,KAAKtU,OAAQkU,GAChG,CACA,OAAO,CACX,CACA,MAAAwE,CAAO/C,EAAI2E,GACP,QAAK7c,KAAK+pB,OAEV7R,EAAG+E,eAAeJ,EAAM3E,EAAGL,IAAI,QAASgF,EAAKxU,MAAOwU,EAAKxU,MAAQwU,EAAKpG,QAAQlU,OAAQvC,KAAK+pB,QACpF,EACX,EAaJ,MAAMG,GAAQ,CACVtI,YAAa,CACT,CAAEzf,KAAM,QAASiW,OAAO,GACxB,CAAEjW,KAAM,cAAe6f,MAAO,CAAE,kBAAmB4F,EAAKuC,UACxD,WACA,CAAEhoB,KAAM,YAAa6f,MAAO4F,EAAKnR,SACjC,CAAEtU,KAAM,iBAAkB6f,MAAO4F,EAAKe,wBAE1CtG,WAAY,CAAC,CACLlgB,KAAM,QACN0a,KAAI,CAACkB,EAAGlB,IAAe+M,GAAQ/M,EAAKpG,QAAS,GAAK,IAAIqT,GAAc,KACpE,OAAAvH,CAAQrK,EAAIC,EAAM0E,GACd,GAAIA,EAAKlG,QAAQpH,KAAKvB,GAAKA,aAAa8b,MAAiBF,GAAQzR,EAAKtB,KAAMsB,EAAKpB,SAC7E,OAAO,EACX,IAAIrO,EAAOwP,EAAGuH,WACd,OAAOoK,GAAchlB,KAAK6D,IAAS6gB,GAASrR,EAAIC,EAAKtB,KAAMsB,EAAKpB,UAAYwS,GAASrR,EAAIxP,EAAMyP,EAAKpB,QACxG,EACA1K,OAAQ,mBAGpB,MAAM+d,GACF,QAAAxP,GAAa,OAAO,CAAO,CAC3B,MAAAK,CAAO/C,EAAI2E,GAKP,OAJA3E,EAAG+E,eAAeJ,EAAM3E,EAAGL,IAAI,OAAQgF,EAAKxU,MAAOwU,EAAKxU,MAAQwU,EAAKpG,QAAQlU,OAAQ,CACjF2V,EAAGL,IAAI,aAAcgF,EAAKxU,MAAOwU,EAAKxU,MAAQ,MAC3C6P,EAAGtW,OAAOya,YAAYQ,EAAKpG,QAAQhL,MAAM,GAAIoR,EAAKxU,MAAQ,OAE1D,CACX,EAQJ,MAAMgiB,GAAW,CACbzI,YAAa,CACT,CAAEzf,KAAM,OAAQiW,OAAO,EAAM4J,MAAO4F,EAAKa,MACzC,CAAEtmB,KAAM,aAAc6f,MAAO4F,EAAK0C,OAEtCjI,WAAY,CAAC,CACLlgB,KAAM,WACN0a,KAAI,CAAC3E,EAAI2E,IACE,kBAAkBhY,KAAKgY,EAAKpG,UAAoC,YAAxByB,EAAGsH,aAAard,KAAqB,IAAIioB,GAAa,KAEzG9d,MAAO,mBAGbie,GAAa,4DACbC,GAAQ,yCACRC,GAAqB,yBACrBC,GAAU,gCACVC,GAAiB,oBACvB,SAASrR,GAAMtY,EAAKlB,EAAMC,EAAI6E,GAC1B,IAAI/D,EAAS,EACb,IAAK,IAAI4C,EAAI3D,EAAM2D,EAAI1D,EAAI0D,IACnBzC,EAAIyC,IAAMmB,GACV/D,IACR,OAAOA,CACX,CAmBA,SAAS+pB,GAAiB/T,EAAM/W,GAC5B4qB,GAAQG,UAAY/qB,EACpB,IAAImU,EAAIyW,GAAQxG,KAAKrN,GACrB,IAAK5C,EACD,OAAO,EACX,IAAIjK,EAAOiK,EAAE,GAAGA,EAAE,GAAG1R,OAAS,GAC9B,MAAe,KAARyH,GAAuB,KAARA,GAAc,EAAKlK,EAAOmU,EAAE,GAAG1R,QAAkB,KAARyH,EAAc,EAAI,EACrF,CAMA,MA0CM8gB,GAAM,CAACZ,GAAOG,GAAUhB,GA1Cb,CACbhN,YAAa,CAAC,CACNla,KAAM,WACN,KAAAiQ,CAAM8F,EAAIxP,EAAMqiB,GACZ,IAAI1lB,EAAM0lB,EAAS7S,EAAGlI,OACtB,GAAI3K,GAAO,KAAKR,KAAKqT,EAAGrB,KAAKxR,EAAM,IAC/B,OAAO,EACXklB,GAAWM,UAAYxlB,EACvB,IAAI4O,EAAIsW,GAAWrG,KAAKhM,EAAGrB,MAAOvO,GAAM,EACxC,IAAK2L,EACD,OAAO,EACX,GAAIA,EAAE,IAAMA,EAAE,IAEV,GADA3L,EA3CpB,SAAwBuO,EAAM/W,GAC1B0qB,GAAMK,UAAY/qB,EAClB,IAAImU,EAAIuW,GAAMtG,KAAKrN,GACnB,IAAK5C,GAAKwW,GAAmBvG,KAAKjQ,EAAE,IAAI,GAAG7Q,QAAQ,MAAO,EACtD,OAAO,EACX,IAAIkF,EAAMxI,EAAOmU,EAAE,GAAG1R,OACtB,OAAS,CACL,IAA0B0R,EAAtBjK,EAAO6M,EAAKvO,EAAM,GACtB,GAAI,aAAazD,KAAKmF,IACV,KAARA,GAAesP,GAAMzC,EAAM/W,EAAMwI,EAAK,KAAOgR,GAAMzC,EAAM/W,EAAMwI,EAAK,KACpEA,QACC,IAAY,KAAR0B,KAAgBiK,EAAI,6BAA6BiQ,KAAKrN,EAAKpL,MAAM3L,EAAMwI,KAG5E,MAFAA,EAAMxI,EAAOmU,EAAE5N,KAEf,CACR,CACA,OAAOiC,CACX,CA0B0B0iB,CAAe9S,EAAGrB,KAAMxR,EAAM4O,EAAE,GAAG1R,QACrC+F,GAAM,GAAM4P,EAAGoO,YAAa,CAE5Bhe,EAAMjD,EADU,wBAAwB6e,KAAKhM,EAAGrB,KAAKpL,MAAMpG,EAAKiD,IAC1C,GAAG/F,MAC7B,OAEK0R,EAAE,GACP3L,EAAMsiB,GAAiB1S,EAAGrB,KAAMxR,IAGhCiD,EAAMsiB,GAAiB1S,EAAGrB,KAAMxR,EAAM4O,EAAE,GAAG1R,QACvC+F,GAAM,GAAc,SAAR2L,EAAE,KACd0W,GAAeE,UAAYviB,EAC3B2L,EAAI0W,GAAezG,KAAKhM,EAAGrB,MACvB5C,IACA3L,EAAM2L,EAAE5N,MAAQ4N,EAAE,GAAG1R,UAGjC,OAAI+F,EAAM,GACC,GACX4P,EAAGiI,WAAWjI,EAAGL,IAAI,MAAOkT,EAAQziB,EAAM4P,EAAGlI,SACtC1H,EAAM4P,EAAGlI,OACpB,MASZ,SAASib,GAAcrmB,EAAIrB,EAAMob,GAC7B,MAAO,CAACzG,EAAIxP,EAAMrD,KACd,GAAIqD,GAAQ9D,GAAMsT,EAAGwK,KAAKrd,EAAM,IAAMT,EAClC,OAAO,EACX,IAAImY,EAAO,CAAC7E,EAAGL,IAAI8G,EAAMtZ,EAAKA,EAAM,IACpC,IAAK,IAAI5B,EAAI4B,EAAM,EAAG5B,EAAIyU,EAAG5P,IAAK7E,IAAK,CACnC,IAAIiF,EAAOwP,EAAGwK,KAAKjf,GACnB,GAAIiF,GAAQ9D,EACR,OAAOsT,EAAGiI,WAAWjI,EAAGL,IAAItU,EAAM8B,EAAK5B,EAAI,EAAGsZ,EAAKzS,OAAO4N,EAAGL,IAAI8G,EAAMlb,EAAGA,EAAI,MAGlF,GAFY,IAARiF,GACAqU,EAAK5Y,KAAK+T,EAAGL,IAAI,SAAUpU,EAAS,EAANA,MAC9BqV,GAAMpQ,GACN,KACR,CACA,OAAO,EAEf,CAMA,MAAMwiB,GAAc,CAChBtJ,YAAa,CACT,CAAEzf,KAAM,cAAe6f,MAAO4F,EAAKuD,QAAQvD,EAAKnR,UAChD,CAAEtU,KAAM,kBAAmB6f,MAAO4F,EAAKe,wBAE3CtM,YAAa,CAAC,CACNla,KAAM,cACNiQ,MAAO6Y,GAAc,GAAc,cAAe,sBAQxDG,GAAY,CACdxJ,YAAa,CACT,CAAEzf,KAAM,YAAa6f,MAAO4F,EAAKuD,QAAQvD,EAAKnR,UAC9C,CAAEtU,KAAM,gBAAiB6f,MAAO4F,EAAKe,wBAEzCtM,YAAa,CAAC,CACNla,KAAM,YACNiQ,MAAO6Y,GAAc,IAAe,YAAa,oBAOvDI,GAAQ,CACVzJ,YAAa,CAAC,CAAEzf,KAAM,QAAS6f,MAAO4F,EAAKU,YAC3CjM,YAAa,CAAC,CACNla,KAAM,QACN,KAAAiQ,CAAM8F,EAAIxP,EAAMrD,GACZ,IAAI5E,EACJ,OAAY,IAARiI,IAA0BjI,EAAQ,kBAAkByjB,KAAKhM,EAAGzM,MAAMpG,EAAM,EAAG6S,EAAG5P,OAE3E4P,EAAGiI,WAAWjI,EAAGL,IAAI,QAASxS,EAAKA,EAAM,EAAI5E,EAAM,GAAG8B,UADlD,CAEf,KCvxENiF,GAAoB8jB,EAAoB,CAAEC,cAAe,CAAEnT,MAAO,CAAE3H,KAAM,UAAQ4V,MAAO,aACzFmF,GAA2B,IAAIvrB,EAC/BwrB,GAA0B7pB,GAAO6f,UAAU,CAC7C1f,MAAO,CACU2pB,EAAalrB,IAAII,IAClBA,EAAKuC,GAAG,UAAYvC,EAAKuC,GAAG,aAAkC,MAAnBwoB,GAAU/qB,QAAgBE,EACvE,CAACY,EAAMkqB,KAAK,CAAQ9rB,KAAM8rB,EAAMC,IAAIC,OAAOpqB,EAAK5B,MAAMC,GAAIA,GAAI2B,EAAK3B,MAEhEyrB,GAAYhrB,IAAImrB,IAChBI,EAAevrB,IAAI,CAC5ByY,SAAU,IAAM,OAEP+S,EAAiBxrB,IAAI,CAC9ByY,SAAUzR,QAItB,SAASmkB,GAAU/qB,GACf,IAAIH,EAAQ,8BAA8ByjB,KAAKtjB,EAAKuB,MACpD,OAAO1B,GAASA,EAAM,QAAKK,CAC/B,CACA,SAASmrB,GAAeC,EAAYC,GAChC,IAAIniB,EAAOkiB,EACX,OAAS,CACL,IAA6B/B,EAAzBzhB,EAAOsB,EAAK9C,YAChB,IAAKwB,GAA4C,OAAnCyhB,EAAUwB,GAAUjjB,EAAK9H,QAAkBupB,GAAWgC,EAChE,MACJniB,EAAOtB,CACX,CACA,OAAOsB,EAAKjK,EAChB,CACA,MAAMqsB,GAA4BC,EAAYC,GAAG,CAACV,EAAOvjB,EAAOC,KAC5D,IAAK,IAAI/E,EAAOgpB,EAAWX,GAAO9lB,aAAawC,GAAK,GAAK/E,KACjDA,EAAKzD,KAAOuI,GAD2C9E,EAAOA,EAAK6C,OAAQ,CAG/E,IAAI+jB,EAAU5mB,EAAK3C,KAAKkC,KAAK0oB,IAC7B,GAAe,MAAXrB,EACA,SACJ,IAAIrJ,EAAOmL,GAAe1oB,EAAM4mB,GAChC,GAAIrJ,EAAOxY,EACP,MAAO,CAAExI,KAAMwI,EAAKvI,GAAI+gB,EAChC,CACA,OAAO,OAEX,SAAS0L,GAAO5qB,GACZ,OAAO,IAAI6qB,EAASjlB,GAAM5F,EAAQ,CAACwqB,IAAe,WACtD,CAIK,MAACM,GAAkCF,GAAOf,IAMzCkB,GAAgCH,GALRf,GAAWhK,UAAU,CAACqJ,GAAKM,GAAWF,GAAaG,MAyBjF,MAAMuB,GACF,WAAA/sB,CAAY0D,EAAMzD,EAAMC,EAAI8sB,EAAaC,EAAYlsB,EAAMmsB,GACvD/sB,KAAKuD,KAAOA,EACZvD,KAAKF,KAAOA,EACZE,KAAKD,GAAKA,EACVC,KAAK6sB,YAAcA,EACnB7sB,KAAK8sB,WAAaA,EAClB9sB,KAAKY,KAAOA,EACZZ,KAAK+sB,KAAOA,CAChB,CACA,KAAAC,CAAMC,EAAUzQ,GAAW,GACvB,IAAI3b,EAASb,KAAK6sB,aAAiC,cAAlB7sB,KAAKuD,KAAKpB,KAAuB,IAAM,IACxE,GAAgB,MAAZ8qB,EAAkB,CAClB,KAAOpsB,EAAO0B,OAAS0qB,GACnBpsB,GAAU,IACd,OAAOA,CACX,CAEI,IAAK,IAAI4C,EAAIzD,KAAKD,GAAKC,KAAKF,KAAOe,EAAO0B,OAASvC,KAAK8sB,WAAWvqB,OAAQkB,EAAI,EAAGA,IAC9E5C,GAAU,IACd,OAAOA,GAAU2b,EAAWxc,KAAK8sB,WAAa,GAEtD,CACA,MAAAI,CAAOrB,EAAKrrB,GACR,IAAI2sB,EAA2B,eAAlBntB,KAAKuD,KAAKpB,KAAwBirB,QAASC,GAAWrtB,KAAK+sB,KAAMlB,GAAK,GAAKrrB,GAAQ,GAChG,OAAOR,KAAK6sB,YAAcM,EAASntB,KAAKY,KAAOZ,KAAK8sB,UACxD,EAEJ,SAASQ,GAAW/pB,EAAMsoB,GACtB,IAAIjiB,EAAQ,GACZ,IAAK,IAAImE,EAAMxK,EAAMwK,GAAmB,YAAZA,EAAI5L,KAAoB4L,EAAMA,EAAI3H,OAC1C,YAAZ2H,EAAI5L,MAAkC,cAAZ4L,EAAI5L,MAAoC,cAAZ4L,EAAI5L,MAC1DyH,EAAMzF,KAAK4J,GAEnB,IAAI5H,EAAU,GACd,IAAK,IAAI1C,EAAImG,EAAMrH,OAAS,EAAGkB,GAAK,EAAGA,IAAK,CACxC,IAAqBhD,EAAjB8C,EAAOqG,EAAMnG,GACb0U,EAAO0T,EAAIC,OAAOvoB,EAAKzD,MAAO6I,EAAWpF,EAAKzD,KAAOqY,EAAKrY,KAC9D,GAAiB,cAAbyD,EAAKpB,KACLgE,EAAQhC,KAAK,IAAIyoB,GAAQrpB,EAAMoF,EAAUA,EAAU,GAAI,GAAI,GAAI,YAE9D,GAAiB,cAAbpF,EAAKpB,OAAyB1B,EAAQ,WAAWyjB,KAAK/L,EAAKtB,KAAKpL,MAAM9C,KAC3ExC,EAAQhC,KAAK,IAAIyoB,GAAQrpB,EAAMoF,EAAUA,EAAWlI,EAAM,GAAG8B,OAAQ,GAAI9B,EAAM,GAAI,IAAK,YAEvF,GAAiB,YAAb8C,EAAKpB,MAA0C,eAApBoB,EAAK6C,OAAOjE,OAC3C1B,EAAQ,qBAAqByjB,KAAK/L,EAAKtB,KAAKpL,MAAM9C,KAAa,CAChE,IAAI2D,EAAQ7L,EAAM,GAAIqL,EAAMrL,EAAM,GAAG8B,OACjC+J,EAAM/J,QAAU,IAChB+J,EAAQA,EAAMb,MAAM,EAAGa,EAAM/J,OAAS,GACtCuJ,GAAO,GAEX3F,EAAQhC,KAAK,IAAIyoB,GAAQrpB,EAAK6C,OAAQuC,EAAUA,EAAWmD,EAAKrL,EAAM,GAAI6L,EAAO7L,EAAM,GAAI8C,GAC/F,MACK,GAAiB,YAAbA,EAAKpB,MAA0C,cAApBoB,EAAK6C,OAAOjE,OAC3C1B,EAAQ,qCAAqCyjB,KAAK/L,EAAKtB,KAAKpL,MAAM9C,KAAa,CAChF,IAAI2D,EAAQ7L,EAAM,GAAIqL,EAAMrL,EAAM,GAAG8B,OACjC+J,EAAM/J,OAAS,IACf+J,EAAQA,EAAMb,MAAM,EAAGa,EAAM/J,OAAS,GACtCuJ,GAAO,GAEX,IAAIlL,EAAOH,EAAM,GACbA,EAAM,KACNG,GAAQH,EAAM,GAAG8sB,QAAQ,OAAQ,MACrCpnB,EAAQhC,KAAK,IAAIyoB,GAAQrpB,EAAK6C,OAAQuC,EAAUA,EAAWmD,EAAKrL,EAAM,GAAI6L,EAAO1L,EAAM2C,GAC3F,CACJ,CACA,OAAO4C,CACX,CACA,SAASknB,GAAWN,EAAMlB,GACtB,MAAO,sBAAsB3H,KAAK2H,EAAI2B,YAAYT,EAAKjtB,KAAMitB,EAAKjtB,KAAO,IAC7E,CACA,SAAS2tB,GAAanhB,EAAOuf,EAAK9a,EAASf,EAAS,GAChD,IAAK,IAAIZ,KAAW7L,EAAO+I,IAAS,CAChC,GAAiB,YAAb/I,EAAKpB,KAAoB,CACzB,IAAI8R,EAAIoZ,GAAW9pB,EAAMsoB,GACrBsB,GAAUlZ,EAAE,GAChB,GAAI7E,GAAQ,EAAG,CACX,GAAI+d,GAAU/d,EAAO,EACjB,OACJ2B,EAAQ5M,KAAK,CAAErE,KAAMyD,EAAKzD,KAAOmU,EAAE,GAAG1R,OAAQxC,GAAIwD,EAAKzD,KAAOmU,EAAE,GAAG1R,OAAQmrB,OAAQN,OAAOhe,EAAO,EAAIY,IACzG,CACAZ,EAAO+d,CACX,CACA,IAAIzkB,EAAOnF,EAAK2D,YAChB,IAAKwB,EACD,MACJnF,EAAOmF,CACX,CACJ,CACA,SAASilB,GAAgBlX,EAASmV,GAC9B,IAAIoB,EAAQ,UAAU9I,KAAKzN,GAAS,GAAGlU,OACvC,IAAKyqB,GAAoC,MAA3BpB,EAAMgC,MAAMC,GACtB,OAAOpX,EACX,IACIqC,EAAQ,GACZ,IAAK,IAAIrV,EAFCqqB,EAAYrX,EAAS,EAAGuW,GAEhBvpB,EAAI,GACdA,GAAK,GACLqV,GAAS,KACTrV,GAAK,IAGLqV,GAAS,IACTrV,KAGR,OAAOqV,EAAQrC,EAAQhL,MAAMuhB,EACjC,CAYK,MAACe,GAA8B,EAAGnC,QAAOoC,eAC1C,IAAItsB,EAAO6qB,EAAWX,IAAQC,IAAEA,GAAQD,EACpCqC,EAAO,KAAMld,EAAU6a,EAAMsC,cAAcpa,IAC3C,IAAKA,EAAM7I,QAAU0hB,GAAiBwB,WAAWvC,EAAO9X,EAAMhU,MAC1D,OAAOmuB,EAAO,CAAEna,SACpB,IAAIzO,EAAMyO,EAAMhU,KAAMqY,EAAO0T,EAAIC,OAAOzmB,GACpCc,EAAUmnB,GAAW5rB,EAAKoE,aAAaT,GAAK,GAAKwmB,GACrD,KAAO1lB,EAAQ5D,QAAU4D,EAAQA,EAAQ5D,OAAS,GAAGzC,KAAOuF,EAAM8S,EAAKrY,MACnEqG,EAAQiE,MACZ,IAAKjE,EAAQ5D,OACT,OAAO0rB,EAAO,CAAEna,SACpB,IAAI9N,EAAQG,EAAQA,EAAQ5D,OAAS,GACrC,GAAIyD,EAAMjG,GAAKiG,EAAM8mB,WAAWvqB,OAAS8C,EAAM8S,EAAKrY,KAChD,OAAOmuB,EAAO,CAAEna,SACpB,IAAIsa,EAAY/oB,GAAQW,EAAMjG,GAAKiG,EAAM8mB,WAAWvqB,SAAY,KAAKsC,KAAKsT,EAAKtB,KAAKpL,MAAMzF,EAAMjG,KAEhG,GAAIiG,EAAM+mB,MAAQqB,EAAW,CAEzB,GAAIpoB,EAAMzC,KAAK0D,WAAWlH,IAAMsF,GAC5B8S,EAAKrY,KAAO,IAAM,SAAS+E,KAAKgnB,EAAIC,OAAO3T,EAAKrY,KAAO,GAAG+W,MAAO,CACjE,IACIwX,EADA3lB,EAAOvC,EAAQ5D,OAAS,EAAI4D,EAAQA,EAAQ5D,OAAS,GAAK,KACnDmrB,EAAS,GAChBhlB,GAAQA,EAAKqkB,MACbsB,EAAQlW,EAAKrY,KAAO4I,EAAK5I,KACzB4tB,EAAShlB,EAAKwkB,OAAOrB,EAAK,IAG1BwC,EAAQlW,EAAKrY,MAAQ4I,EAAOA,EAAK3I,GAAK,GAE1C,IAAIgR,EAAU,CAAC,CAAEjR,KAAMuuB,EAAOtuB,GAAIsF,EAAKqoB,WAKvC,MAJuB,eAAnB1nB,EAAMzC,KAAKpB,MACXsrB,GAAaznB,EAAM+mB,KAAMlB,EAAK9a,GAAS,GACvCrI,GAA0B,eAAlBA,EAAKnF,KAAKpB,MAClBsrB,GAAa/kB,EAAKqkB,KAAMlB,EAAK9a,GAC1B,CAAE+C,MAAOwa,EAAgBtpB,OAAOqpB,EAAQX,EAAOnrB,QAASwO,UACnE,CACK,CACD,IAAI2c,EAAS,GACb,IAAK,IAAIjqB,EAAI,EAAGyJ,EAAI/G,EAAQ5D,OAAS,EAAGkB,GAAKyJ,EAAGzJ,IAC5CiqB,GAAUvnB,EAAQ1C,GAAGupB,MAAMvpB,EAAIyJ,EAAI4gB,EAAY3V,EAAKtB,KAAM,EAAG1Q,EAAQ1C,EAAI,GAAG3D,MAAQ4tB,EAAOnrB,OAAS,KAAMkB,EAAIyJ,GAGlH,OADAwgB,EAASC,GAAgBD,EAAQ9B,GAC1B,CAAE9X,MAAOwa,EAAgBtpB,OAAOK,EAAMqoB,EAAOnrB,OAAS,GACzDwO,QAAS,CAAEjR,KAAMqY,EAAKrY,KAAM4tB,OAAQA,EAAS9B,EAAM2C,WAC3D,CACJ,CACA,GAAuB,cAAnBvoB,EAAMzC,KAAKpB,MAAwBisB,GAAajW,EAAKrY,KAAM,CAC3D,IAAI0uB,EAAW3C,EAAIC,OAAO3T,EAAKrY,KAAO,GAAI2uB,EAAS,QAAQvK,KAAKsK,EAAS3X,MAEzE,GAAI4X,GAAUA,EAAOpoB,OAASL,EAAMlG,KAAM,CACtC,IAAIiR,EAAU6a,EAAM7a,QAAQ,CAAC,CAAEjR,KAAM0uB,EAAS1uB,KAAO2uB,EAAOpoB,MAAOtG,GAAIyuB,EAASzuB,IAC5E,CAAED,KAAMqY,EAAKrY,KAAOkG,EAAMlG,KAAMC,GAAIoY,EAAKpY,MAC7C,MAAO,CAAE+T,MAAOA,EAAMzQ,IAAI0N,GAAUA,UACxC,CACJ,CACA,IAAIA,EAAU,GACS,eAAnB/K,EAAMzC,KAAKpB,MACXsrB,GAAaznB,EAAM+mB,KAAMlB,EAAK9a,GAClC,IAAI2d,EAAY1oB,EAAM+mB,MAAQ/mB,EAAM+mB,KAAKjtB,KAAOqY,EAAKrY,KACjD4tB,EAAS,GAEb,IAAKgB,GAAa,kBAAkBxK,KAAK/L,EAAKtB,MAAM,GAAGtU,QAAUyD,EAAMjG,GACnE,IAAK,IAAI0D,EAAI,EAAGyJ,EAAI/G,EAAQ5D,OAAS,EAAGkB,GAAKyJ,EAAGzJ,IAC5CiqB,GAAUjqB,GAAKyJ,GAAMwhB,EACfvoB,EAAQ1C,GAAGupB,MAAMvpB,EAAIyJ,EAAI4gB,EAAY3V,EAAKtB,KAAM,EAAG1Q,EAAQ1C,EAAI,GAAG3D,MAAQ4tB,EAAOnrB,OAAS,MAD/D4D,EAAQ1C,GAAGypB,OAAOrB,EAAK,GAIhE,IAAI/rB,EAAOuF,EACX,KAAOvF,EAAOqY,EAAKrY,MAAQ,KAAK+E,KAAKsT,EAAKtB,KAAK8X,OAAO7uB,EAAOqY,EAAKrY,KAAO,KACrEA,IAGJ,OAFA4tB,EAASC,GAAgBD,EAAQ9B,GACjC7a,EAAQ5M,KAAK,CAAErE,OAAMC,GAAIsF,EAAKqoB,OAAQ9B,EAAM2C,UAAYb,IACjD,CAAE5Z,MAAOwa,EAAgBtpB,OAAOlF,EAAO4tB,EAAOnrB,OAAS,GAAIwO,aAEtE,OAAIkd,IAEJD,EAASpC,EAAMgD,OAAO7d,EAAS,CAAE8d,gBAAgB,EAAMC,UAAW,YAC3D,IAEX,SAASC,GAAOxrB,GACZ,MAAoB,aAAbA,EAAKpB,MAAoC,YAAboB,EAAKpB,IAC5C,CAgCK,MAAC6sB,GAAuB,EAAGpD,QAAOoC,eACnC,IAAItsB,EAAO6qB,EAAWX,GAClBqC,EAAO,KAAMld,EAAU6a,EAAMsC,cAAcpa,IAC3C,IAAIzO,EAAMyO,EAAMhU,MAAM+rB,IAAEA,GAAQD,EAChC,GAAI9X,EAAM7I,OAAS0hB,GAAiBwB,WAAWvC,EAAO9X,EAAMhU,MAAO,CAC/D,IAAIqY,EAAO0T,EAAIC,OAAOzmB,GAClBc,EAAUmnB,GArC1B,SAA8B5rB,EAAM2D,GAChC,IAAI9B,EAAO7B,EAAKoE,aAAaT,GAAK,GAAKa,EAAOb,EAC1C0pB,GAAOxrB,KACP2C,EAAO3C,EAAKzD,KACZyD,EAAOA,EAAK6C,QAEhB,IAAK,IAAIgJ,EAAMA,EAAO7L,EAAKqJ,YAAY1G,IACnC,GAAI6oB,GAAO3f,GACPlJ,EAAOkJ,EAAKtP,SAEX,IAAiB,eAAbsP,EAAKjN,MAAsC,cAAbiN,EAAKjN,KAKxC,MAJAoB,EAAO6L,EAAKvC,UACZ3G,EAAO3C,EAAKxD,EAIhB,CAEJ,OAAOwD,CACX,CAkBqC0rB,CAAqBvtB,EAAM2D,GAAMwmB,GAC1D,GAAI1lB,EAAQ5D,OAAQ,CAChB,IAAIyD,EAAQG,EAAQA,EAAQ5D,OAAS,GACjC2sB,EAAWlpB,EAAMjG,GAAKiG,EAAM8mB,WAAWvqB,QAAUyD,EAAM8mB,WAAa,EAAI,GAE5E,GAAIznB,EAAM8S,EAAKrY,KAAOovB,IAAa,KAAKrqB,KAAKsT,EAAKtB,KAAKpL,MAAMyjB,EAAU7pB,EAAM8S,EAAKrY,OAC9E,MAAO,CAAEgU,MAAOwa,EAAgBtpB,OAAOmT,EAAKrY,KAAOovB,GAC/Cne,QAAS,CAAEjR,KAAMqY,EAAKrY,KAAOovB,EAAUnvB,GAAIsF,IACnD,GAAIA,EAAM8S,EAAKrY,MAAQovB,KAIjBlpB,EAAM+mB,MAAQ5U,EAAKrY,MAAQkG,EAAM+mB,KAAKjtB,OAAS,KAAK+E,KAAKsT,EAAKtB,KAAKpL,MAAM,EAAGzF,EAAMjG,MAAO,CAC3F,IAAIsI,EAAQ8P,EAAKrY,KAAOkG,EAAMlG,KAE9B,GAAIkG,EAAM+mB,MAAQ/mB,EAAMzC,KAAKzD,KAAOkG,EAAM+mB,KAAKjtB,MAAQ,KAAK+E,KAAKsT,EAAKtB,KAAKpL,MAAMzF,EAAMlG,KAAMkG,EAAMjG,KAAM,CACrG,IAAI2tB,EAAS1nB,EAAMgnB,MAAMc,EAAY3V,EAAKtB,KAAM,EAAG7Q,EAAMjG,IAAM+tB,EAAY3V,EAAKtB,KAAM,EAAG7Q,EAAMlG,OAG/F,OAFIuI,GAAS8P,EAAKrY,OACd4tB,EAASC,GAAgBD,EAAQ9B,IAC9B,CAAE9X,MAAOwa,EAAgBtpB,OAAOqD,EAAQqlB,EAAOnrB,QAClDwO,QAAS,CAAEjR,KAAMuI,EAAOtI,GAAIoY,EAAKrY,KAAOkG,EAAMjG,GAAI2tB,UAC1D,CAEA,GAAIrlB,EAAQhD,EACR,MAAO,CAAEyO,MAAOwa,EAAgBtpB,OAAOqD,GAAQ0I,QAAS,CAAEjR,KAAMuI,EAAOtI,GAAIsF,GACnF,CACJ,CACJ,CACA,OAAO4oB,EAAO,CAAEna,WAEpB,OAAIma,IAEJD,EAASpC,EAAMgD,OAAO7d,EAAS,CAAE8d,gBAAgB,EAAMC,UAAW,aAC3D,IASLK,GAAiB,CACnB,CAAEC,IAAK,QAASC,IAAKtB,IACrB,CAAEqB,IAAK,YAAaC,IAAKL,KAEvBM,GAA2BC,EAAK,CAAEC,kBAAkB,IAI1D,SAASC,GAASvvB,EAAS,IACvB,IAAIwvB,cAAEA,EAAaC,oBAAEA,EAAmBC,UAAEA,GAAY,EAAMzlB,MAAMvI,OAAEA,GAAW8qB,GAAkBmD,iBAAEA,GAAmB,GAAS3vB,EAC/H,KAAM0B,aAAkBqf,IACpB,MAAM,IAAIvgB,WAAW,kEACzB,IACqCovB,EADjCC,EAAa7vB,EAAO6vB,WAAa,CAAC7vB,EAAO6vB,YAAc,GACvDC,EAAU,CAACV,GAAYU,SACvBL,aAA+BM,GAC/BD,EAAQ7rB,KAAKwrB,EAAoBK,SACjCF,EAAcH,EAAoBO,UAE7BP,IACLG,EAAcH,GAElB,IAAI3G,EAAa0G,GAAiBI,GA/TfK,EA+T2CT,EA/ThCU,EA+T+CN,EA9TrE5G,IACJ,GAAIA,GAAQiH,EAAW,CACnB,IAAIzsB,EAAQ,KAOZ,GALAwlB,EAAO,MAAMhF,KAAKgF,GAAM,GAEpBxlB,EADoB,mBAAbysB,EACCA,EAAUjH,GAEVmH,EAAoBC,kBAAkBH,EAAWjH,GAAM,GAC/DxlB,aAAiB2sB,EACjB,OAAO3sB,EAAMssB,QAAUtsB,EAAMssB,QAAQE,SAAStuB,OAAS2uB,EAAaC,kBAAkB9sB,EAAM+sB,QAC3F,GAAI/sB,EACL,OAAOA,EAAM9B,MACrB,CACA,OAAOwuB,EAAkBA,EAAgBxuB,OAAS,YAgTsCd,EA/ThG,IAAuBqvB,EAAWC,EAgU9BL,EAAW5rB,KAAK4kB,GAAU,CAAEC,aAAYC,WAAYqG,GAAYY,SAAStuB,UACrEguB,GACAI,EAAQ7rB,KAAKusB,EAAKC,KAAKC,EAAOtE,GAAG6C,MACrC,IAAI0B,EAAOrE,GAAO5qB,EAAO6f,UAAUsO,IAGnC,OAFIF,GACAG,EAAQ7rB,KAAK0sB,EAAKrpB,KAAK8kB,GAAG,CAAEwE,aAAcC,MACvC,IAAId,EAAgBY,EAAMb,EACrC,CACA,SAASe,GAAkB5qB,GACvB,IAAIylB,MAAEA,EAAKvmB,IAAEA,GAAQc,EAAS8N,EAAI,4BAA4BiQ,KAAK0H,EAAMoF,SAAS3rB,EAAM,GAAIA,IAC5F,IAAK4O,EACD,OAAO,KACX,IAAIvS,EAAO6qB,EAAWX,GAAO9lB,aAAaT,MAC1C,KAAO3D,IAASA,EAAKd,KAAKmC,OAAO,CAC7B,GAAiB,aAAbrB,EAAKS,MAAoC,cAAbT,EAAKS,MAAqC,8BAAbT,EAAKS,MACjD,gBAAbT,EAAKS,MAAuC,QAAbT,EAAKS,MAA+B,SAAbT,EAAKS,KAC3D,OAAO,KACXT,EAAOA,EAAK0E,MAChB,CACA,MAAO,CACHtG,KAAMuF,EAAM4O,EAAE,GAAG1R,OAAQxC,GAAIsF,EAC7B4rB,QAASC,KACTC,SAAU,6BAElB,CACA,IAAIC,GAAkB,KACtB,SAASF,KACL,GAAIE,GACA,OAAOA,GACX,IAAIvwB,EAASwwB,EAAqB,IAAIC,EAAkBC,EAAYrvB,OAAO,CAAE6tB,WAAYT,KAAgB,GAAG,IAC5G,OAAO8B,GAAkBvwB,EAASA,EAAOowB,QAAU,EACvD","x_google_ignoreList":[0,1,2]}