{
  "version": 3,
  "sources": ["../../../src/diagrams/venn/parser/venn.jison", "../../../src/diagrams/venn/vennDB.ts", "../../../src/diagrams/venn/styles.ts", "../../../../../node_modules/.pnpm/@upsetjs+venn.js@2.0.0/node_modules/@upsetjs/venn.js/build/venn.esm.js", "../../../src/diagrams/venn/vennRenderer.ts", "../../../src/diagrams/venn/vennDiagram.ts"],
  "sourcesContent": ["/* parser generated by jison 0.4.18 */\n/*\n  Returns a Parser object of the following structure:\n\n  Parser: {\n    yy: {}\n  }\n\n  Parser.prototype: {\n    yy: {},\n    trace: function(),\n    symbols_: {associative list: name ==> number},\n    terminals_: {associative list: number ==> name},\n    productions_: [...],\n    performAction: function anonymous(yytext, yyleng, yylineno, yy, yystate, $$, _$),\n    table: [...],\n    defaultActions: {...},\n    parseError: function(str, hash),\n    parse: function(input),\n\n    lexer: {\n        EOF: 1,\n        parseError: function(str, hash),\n        setInput: function(input),\n        input: function(),\n        unput: function(str),\n        more: function(),\n        less: function(n),\n        pastInput: function(),\n        upcomingInput: function(),\n        showPosition: function(),\n        test_match: function(regex_match_array, rule_index),\n        next: function(),\n        lex: function(),\n        begin: function(condition),\n        popState: function(),\n        _currentRules: function(),\n        topState: function(),\n        pushState: function(condition),\n\n        options: {\n            ranges: boolean           (optional: true ==> token location info will include a .range[] member)\n            flex: boolean             (optional: true ==> flex-like lexing behaviour where the rules are tested exhaustively to find the longest match)\n            backtrack_lexer: boolean  (optional: true ==> lexer regexes are tested in order and for each matching regex the action code is invoked; the lexer terminates the scan when a token is returned by the action code)\n        },\n\n        performAction: function(yy, yy_, $avoiding_name_collisions, YY_START),\n        rules: [...],\n        conditions: {associative list: name ==> set},\n    }\n  }\n\n\n  token location info (@$, _$, etc.): {\n    first_line: n,\n    last_line: n,\n    first_column: n,\n    last_column: n,\n    range: [start_number, end_number]       (where the numbers are indexes into the input string, regular zero-based)\n  }\n\n\n  the parseError function receives a 'hash' object with these members for lexer and parser errors: {\n    text:        (matched text)\n    token:       (the produced terminal token, if any)\n    line:        (yylineno)\n  }\n  while parser (grammar) errors will also provide these members, i.e. parser errors deliver a superset of attributes: {\n    loc:         (yylloc)\n    expected:    (string describing the set of expected tokens)\n    recoverable: (boolean: TRUE when the parser has a error recovery rule available for this particular error)\n  }\n*/\nvar parser = (function(){\nvar o=function(k,v,o,l){for(o=o||{},l=k.length;l--;o[k[l]]=v);return o},$V0=[5,8],$V1=[7,8,11,12,17,19,22,24],$V2=[1,17],$V3=[1,18],$V4=[7,8,11,12,14,15,16,17,19,20,21,22,24,27],$V5=[1,31],$V6=[1,39],$V7=[7,8,11,12,17,19,22,24,27],$V8=[1,57],$V9=[1,56],$Va=[1,58],$Vb=[1,59],$Vc=[1,60],$Vd=[7,8,11,12,16,17,19,20,22,24,27,31,32,33];\nvar parser = {trace: function trace () { },\nyy: {},\nsymbols_: {\"error\":2,\"start\":3,\"optNewlines\":4,\"VENN\":5,\"document\":6,\"EOF\":7,\"NEWLINE\":8,\"line\":9,\"statement\":10,\"TITLE\":11,\"SET\":12,\"identifier\":13,\"BRACKET_LABEL\":14,\"COLON\":15,\"NUMERIC\":16,\"UNION\":17,\"identifierList\":18,\"TEXT\":19,\"IDENTIFIER\":20,\"STRING\":21,\"INDENT_TEXT\":22,\"indentedTextTail\":23,\"STYLE\":24,\"stylesOpt\":25,\"styleField\":26,\"COMMA\":27,\"styleValue\":28,\"valueTokens\":29,\"valueToken\":30,\"HEXCOLOR\":31,\"RGBCOLOR\":32,\"RGBACOLOR\":33,\"$accept\":0,\"$end\":1},\nterminals_: {2:\"error\",5:\"VENN\",7:\"EOF\",8:\"NEWLINE\",11:\"TITLE\",12:\"SET\",14:\"BRACKET_LABEL\",15:\"COLON\",16:\"NUMERIC\",17:\"UNION\",19:\"TEXT\",20:\"IDENTIFIER\",21:\"STRING\",22:\"INDENT_TEXT\",24:\"STYLE\",27:\"COMMA\",31:\"HEXCOLOR\",32:\"RGBCOLOR\",33:\"RGBACOLOR\"},\nproductions_: [0,[3,4],[4,0],[4,2],[6,0],[6,2],[9,1],[9,1],[10,1],[10,2],[10,3],[10,4],[10,5],[10,2],[10,3],[10,4],[10,5],[10,3],[10,3],[10,3],[10,4],[10,4],[10,2],[10,3],[23,1],[23,1],[23,1],[23,2],[23,2],[25,1],[25,3],[26,3],[28,1],[28,1],[29,1],[29,2],[30,1],[30,1],[30,1],[30,1],[30,1],[18,1],[18,3],[13,1],[13,1]],\nperformAction: function anonymous(yytext, yyleng, yylineno, yy, yystate /* action[1] */, $$ /* vstack */, _$ /* lstack */) {\n/* this == yyval */\n\nvar $0 = $$.length - 1;\nswitch (yystate) {\ncase 1:\n return $$[$0-1]; \nbreak;\ncase 2: case 3: case 4:\n this.$ = [] \nbreak;\ncase 5:\n $$[$0-1].push($$[$0]); this.$ = $$[$0-1] \nbreak;\ncase 6:\n this.$ = []; \nbreak;\ncase 7: case 22: case 32: case 36: case 37: case 38: case 39: case 40:\n this.$ = $$[$0]; \nbreak;\ncase 8:\n yy.setDiagramTitle($$[$0].substr(6)); this.$ = $$[$0].substr(6); \nbreak;\ncase 9:\n yy.addSubsetData([$$[$0]], undefined, undefined); if (yy.setIndentMode) { yy.setIndentMode(true); } \nbreak;\ncase 10:\n yy.addSubsetData([$$[$0-1]], $$[$0], undefined); if (yy.setIndentMode) { yy.setIndentMode(true); } \nbreak;\ncase 11:\n yy.addSubsetData([$$[$0-2]], undefined, parseFloat($$[$0])); if (yy.setIndentMode) { yy.setIndentMode(true); } \nbreak;\ncase 12:\n yy.addSubsetData([$$[$0-3]], $$[$0-2], parseFloat($$[$0])); if (yy.setIndentMode) { yy.setIndentMode(true); } \nbreak;\ncase 13:\n if ($$[$0].length < 2) { throw new Error('union requires multiple identifiers'); } if (yy.validateUnionIdentifiers) { yy.validateUnionIdentifiers($$[$0]); } yy.addSubsetData($$[$0], undefined, undefined); if (yy.setIndentMode) { yy.setIndentMode(true); } \nbreak;\ncase 14:\n if ($$[$0-1].length < 2) { throw new Error('union requires multiple identifiers'); } if (yy.validateUnionIdentifiers) { yy.validateUnionIdentifiers($$[$0-1]); } yy.addSubsetData($$[$0-1], $$[$0], undefined); if (yy.setIndentMode) { yy.setIndentMode(true); } \nbreak;\ncase 15:\n if ($$[$0-2].length < 2) { throw new Error('union requires multiple identifiers'); } if (yy.validateUnionIdentifiers) { yy.validateUnionIdentifiers($$[$0-2]); } yy.addSubsetData($$[$0-2], undefined, parseFloat($$[$0])); if (yy.setIndentMode) { yy.setIndentMode(true); } \nbreak;\ncase 16:\n if ($$[$0-3].length < 2) { throw new Error('union requires multiple identifiers'); } if (yy.validateUnionIdentifiers) { yy.validateUnionIdentifiers($$[$0-3]); } yy.addSubsetData($$[$0-3], $$[$0-2], parseFloat($$[$0])); if (yy.setIndentMode) { yy.setIndentMode(true); } \nbreak;\ncase 17: case 18: case 19:\n yy.addTextData($$[$0-1], $$[$0], undefined); \nbreak;\ncase 20: case 21:\n yy.addTextData($$[$0-2], $$[$0-1], $$[$0]); \nbreak;\ncase 23:\n yy.addStyleData($$[$0-1], $$[$0]); \nbreak;\ncase 24: case 25: case 26:\n var cs = yy.getCurrentSets(); if (!cs) throw new Error('text requires set'); yy.addTextData(cs, $$[$0], undefined); \nbreak;\ncase 27: case 28:\n var cs = yy.getCurrentSets(); if (!cs) throw new Error('text requires set'); yy.addTextData(cs, $$[$0-1], $$[$0]); \nbreak;\ncase 29: case 41:\n this.$ = [$$[$0]] \nbreak;\ncase 30: case 42:\n this.$ = [...$$[$0-2], $$[$0]] \nbreak;\ncase 31:\n this.$ = [$$[$0-2], $$[$0]] \nbreak;\ncase 33:\n this.$ = $$[$0].join(' '); \nbreak;\ncase 34:\n this.$ = [$$[$0]]; \nbreak;\ncase 35:\n $$[$0-1].push($$[$0]); this.$ = $$[$0-1]; \nbreak;\ncase 43: case 44:\n this.$ = $$[$0] \nbreak;\n}\n},\ntable: [o($V0,[2,2],{3:1,4:2}),{1:[3]},{5:[1,3],8:[1,4]},o($V1,[2,4],{6:5}),o($V0,[2,3]),{7:[1,6],8:[1,8],9:7,10:9,11:[1,10],12:[1,11],17:[1,12],19:[1,13],22:[1,14],24:[1,15]},{1:[2,1]},o($V1,[2,5]),o($V1,[2,6]),o($V1,[2,7]),o($V1,[2,8]),{13:16,20:$V2,21:$V3},{13:20,18:19,20:$V2,21:$V3},{13:20,18:21,20:$V2,21:$V3},{16:[1,25],20:[1,23],21:[1,24],23:22},{13:20,18:26,20:$V2,21:$V3},o($V1,[2,9],{14:[1,27],15:[1,28]}),o($V4,[2,43]),o($V4,[2,44]),o($V1,[2,13],{14:[1,29],15:[1,30],27:$V5}),o($V4,[2,41]),{16:[1,34],20:[1,32],21:[1,33],27:$V5},o($V1,[2,22]),o($V1,[2,24],{14:[1,35]}),o($V1,[2,25],{14:[1,36]}),o($V1,[2,26]),{20:$V6,25:37,26:38,27:$V5},o($V1,[2,10],{15:[1,40]}),{16:[1,41]},o($V1,[2,14],{15:[1,42]}),{16:[1,43]},{13:44,20:$V2,21:$V3},o($V1,[2,17],{14:[1,45]}),o($V1,[2,18],{14:[1,46]}),o($V1,[2,19]),o($V1,[2,27]),o($V1,[2,28]),o($V1,[2,23],{27:[1,47]}),o($V7,[2,29]),{15:[1,48]},{16:[1,49]},o($V1,[2,11]),{16:[1,50]},o($V1,[2,15]),o($V4,[2,42]),o($V1,[2,20]),o($V1,[2,21]),{20:$V6,26:51},{16:$V8,20:$V9,21:[1,53],28:52,29:54,30:55,31:$Va,32:$Vb,33:$Vc},o($V1,[2,12]),o($V1,[2,16]),o($V7,[2,30]),o($V7,[2,31]),o($V7,[2,32]),o($V7,[2,33],{30:61,16:$V8,20:$V9,31:$Va,32:$Vb,33:$Vc}),o($Vd,[2,34]),o($Vd,[2,36]),o($Vd,[2,37]),o($Vd,[2,38]),o($Vd,[2,39]),o($Vd,[2,40]),o($Vd,[2,35])],\ndefaultActions: {6:[2,1]},\nparseError: function parseError (str, hash) {\n    if (hash.recoverable) {\n        this.trace(str);\n    } else {\n        var error = new Error(str);\n        error.hash = hash;\n        throw error;\n    }\n},\nparse: function parse(input) {\n    var self = this, stack = [0], tstack = [], vstack = [null], lstack = [], table = this.table, yytext = '', yylineno = 0, yyleng = 0, recovering = 0, TERROR = 2, EOF = 1;\n    var args = lstack.slice.call(arguments, 1);\n    var lexer = Object.create(this.lexer);\n    var sharedState = { yy: {} };\n    for (var k in this.yy) {\n        if (Object.prototype.hasOwnProperty.call(this.yy, k)) {\n            sharedState.yy[k] = this.yy[k];\n        }\n    }\n    lexer.setInput(input, sharedState.yy);\n    sharedState.yy.lexer = lexer;\n    sharedState.yy.parser = this;\n    if (typeof lexer.yylloc == 'undefined') {\n        lexer.yylloc = {};\n    }\n    var yyloc = lexer.yylloc;\n    lstack.push(yyloc);\n    var ranges = lexer.options && lexer.options.ranges;\n    if (typeof sharedState.yy.parseError === 'function') {\n        this.parseError = sharedState.yy.parseError;\n    } else {\n        this.parseError = Object.getPrototypeOf(this).parseError;\n    }\n    function popStack(n) {\n        stack.length = stack.length - 2 * n;\n        vstack.length = vstack.length - n;\n        lstack.length = lstack.length - n;\n    }\n            function lex() {\n            var token;\n            token = tstack.pop() || lexer.lex() || EOF;\n            if (typeof token !== 'number') {\n                if (token instanceof Array) {\n                    tstack = token;\n                    token = tstack.pop();\n                }\n                token = self.symbols_[token] || token;\n            }\n            return token;\n        }\n    var symbol, preErrorSymbol, state, action, a, r, yyval = {}, p, len, newState, expected;\n    while (true) {\n        state = stack[stack.length - 1];\n        if (this.defaultActions[state]) {\n            action = this.defaultActions[state];\n        } else {\n            if (symbol === null || typeof symbol == 'undefined') {\n                symbol = lex();\n            }\n            action = table[state] && table[state][symbol];\n        }\n        if (typeof action === 'undefined' || !action.length || !action[0]) {\n            var errStr = '';\n            expected = [];\n            for (p in table[state]) {\n                if (this.terminals_[p] && p > TERROR) {\n                    expected.push('\\'' + this.terminals_[p] + '\\'');\n                }\n            }\n            if (lexer.showPosition) {\n                errStr = 'Parse error on line ' + (yylineno + 1) + ':\\n' + lexer.showPosition() + '\\nExpecting ' + expected.join(', ') + ', got \\'' + (this.terminals_[symbol] || symbol) + '\\'';\n            } else {\n                errStr = 'Parse error on line ' + (yylineno + 1) + ': Unexpected ' + (symbol == EOF ? 'end of input' : '\\'' + (this.terminals_[symbol] || symbol) + '\\'');\n            }\n            this.parseError(errStr, {\n                text: lexer.match,\n                token: this.terminals_[symbol] || symbol,\n                line: lexer.yylineno,\n                loc: yyloc,\n                expected: expected\n            });\n        }\n        if (action[0] instanceof Array && action.length > 1) {\n            throw new Error('Parse Error: multiple actions possible at state: ' + state + ', token: ' + symbol);\n        }\n        switch (action[0]) {\n        case 1:\n            stack.push(symbol);\n            vstack.push(lexer.yytext);\n            lstack.push(lexer.yylloc);\n            stack.push(action[1]);\n            symbol = null;\n            if (!preErrorSymbol) {\n                yyleng = lexer.yyleng;\n                yytext = lexer.yytext;\n                yylineno = lexer.yylineno;\n                yyloc = lexer.yylloc;\n                if (recovering > 0) {\n                    recovering--;\n                }\n            } else {\n                symbol = preErrorSymbol;\n                preErrorSymbol = null;\n            }\n            break;\n        case 2:\n            len = this.productions_[action[1]][1];\n            yyval.$ = vstack[vstack.length - len];\n            yyval._$ = {\n                first_line: lstack[lstack.length - (len || 1)].first_line,\n                last_line: lstack[lstack.length - 1].last_line,\n                first_column: lstack[lstack.length - (len || 1)].first_column,\n                last_column: lstack[lstack.length - 1].last_column\n            };\n            if (ranges) {\n                yyval._$.range = [\n                    lstack[lstack.length - (len || 1)].range[0],\n                    lstack[lstack.length - 1].range[1]\n                ];\n            }\n            r = this.performAction.apply(yyval, [\n                yytext,\n                yyleng,\n                yylineno,\n                sharedState.yy,\n                action[1],\n                vstack,\n                lstack\n            ].concat(args));\n            if (typeof r !== 'undefined') {\n                return r;\n            }\n            if (len) {\n                stack = stack.slice(0, -1 * len * 2);\n                vstack = vstack.slice(0, -1 * len);\n                lstack = lstack.slice(0, -1 * len);\n            }\n            stack.push(this.productions_[action[1]][0]);\n            vstack.push(yyval.$);\n            lstack.push(yyval._$);\n            newState = table[stack[stack.length - 2]][stack[stack.length - 1]];\n            stack.push(newState);\n            break;\n        case 3:\n            return true;\n        }\n    }\n    return true;\n}};\n\n/* generated by jison-lex 0.3.4 */\nvar lexer = (function(){\nvar lexer = ({\n\nEOF:1,\n\nparseError:function parseError(str, hash) {\n        if (this.yy.parser) {\n            this.yy.parser.parseError(str, hash);\n        } else {\n            throw new Error(str);\n        }\n    },\n\n// resets the lexer, sets new input\nsetInput:function (input, yy) {\n        this.yy = yy || this.yy || {};\n        this._input = input;\n        this._more = this._backtrack = this.done = false;\n        this.yylineno = this.yyleng = 0;\n        this.yytext = this.matched = this.match = '';\n        this.conditionStack = ['INITIAL'];\n        this.yylloc = {\n            first_line: 1,\n            first_column: 0,\n            last_line: 1,\n            last_column: 0\n        };\n        if (this.options.ranges) {\n            this.yylloc.range = [0,0];\n        }\n        this.offset = 0;\n        return this;\n    },\n\n// consumes and returns one char from the input\ninput:function () {\n        var ch = this._input[0];\n        this.yytext += ch;\n        this.yyleng++;\n        this.offset++;\n        this.match += ch;\n        this.matched += ch;\n        var lines = ch.match(/(?:\\r\\n?|\\n).*/g);\n        if (lines) {\n            this.yylineno++;\n            this.yylloc.last_line++;\n        } else {\n            this.yylloc.last_column++;\n        }\n        if (this.options.ranges) {\n            this.yylloc.range[1]++;\n        }\n\n        this._input = this._input.slice(1);\n        return ch;\n    },\n\n// unshifts one char (or a string) into the input\nunput:function (ch) {\n        var len = ch.length;\n        var lines = ch.split(/(?:\\r\\n?|\\n)/g);\n\n        this._input = ch + this._input;\n        this.yytext = this.yytext.substr(0, this.yytext.length - len);\n        //this.yyleng -= len;\n        this.offset -= len;\n        var oldLines = this.match.split(/(?:\\r\\n?|\\n)/g);\n        this.match = this.match.substr(0, this.match.length - 1);\n        this.matched = this.matched.substr(0, this.matched.length - 1);\n\n        if (lines.length - 1) {\n            this.yylineno -= lines.length - 1;\n        }\n        var r = this.yylloc.range;\n\n        this.yylloc = {\n            first_line: this.yylloc.first_line,\n            last_line: this.yylineno + 1,\n            first_column: this.yylloc.first_column,\n            last_column: lines ?\n                (lines.length === oldLines.length ? this.yylloc.first_column : 0)\n                 + oldLines[oldLines.length - lines.length].length - lines[0].length :\n              this.yylloc.first_column - len\n        };\n\n        if (this.options.ranges) {\n            this.yylloc.range = [r[0], r[0] + this.yyleng - len];\n        }\n        this.yyleng = this.yytext.length;\n        return this;\n    },\n\n// When called from action, caches matched text and appends it on next action\nmore:function () {\n        this._more = true;\n        return this;\n    },\n\n// When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.\nreject:function () {\n        if (this.options.backtrack_lexer) {\n            this._backtrack = true;\n        } else {\n            return this.parseError('Lexical error on line ' + (this.yylineno + 1) + '. You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\\n' + this.showPosition(), {\n                text: \"\",\n                token: null,\n                line: this.yylineno\n            });\n\n        }\n        return this;\n    },\n\n// retain first n characters of the match\nless:function (n) {\n        this.unput(this.match.slice(n));\n    },\n\n// displays already matched input, i.e. for error messages\npastInput:function () {\n        var past = this.matched.substr(0, this.matched.length - this.match.length);\n        return (past.length > 20 ? '...':'') + past.substr(-20).replace(/\\n/g, \"\");\n    },\n\n// displays upcoming input, i.e. for error messages\nupcomingInput:function () {\n        var next = this.match;\n        if (next.length < 20) {\n            next += this._input.substr(0, 20-next.length);\n        }\n        return (next.substr(0,20) + (next.length > 20 ? '...' : '')).replace(/\\n/g, \"\");\n    },\n\n// displays the character position where the lexing error occurred, i.e. for error messages\nshowPosition:function () {\n        var pre = this.pastInput();\n        var c = new Array(pre.length + 1).join(\"-\");\n        return pre + this.upcomingInput() + \"\\n\" + c + \"^\";\n    },\n\n// test the lexed token: return FALSE when not a match, otherwise return token\ntest_match:function(match, indexed_rule) {\n        var token,\n            lines,\n            backup;\n\n        if (this.options.backtrack_lexer) {\n            // save context\n            backup = {\n                yylineno: this.yylineno,\n                yylloc: {\n                    first_line: this.yylloc.first_line,\n                    last_line: this.last_line,\n                    first_column: this.yylloc.first_column,\n                    last_column: this.yylloc.last_column\n                },\n                yytext: this.yytext,\n                match: this.match,\n                matches: this.matches,\n                matched: this.matched,\n                yyleng: this.yyleng,\n                offset: this.offset,\n                _more: this._more,\n                _input: this._input,\n                yy: this.yy,\n                conditionStack: this.conditionStack.slice(0),\n                done: this.done\n            };\n            if (this.options.ranges) {\n                backup.yylloc.range = this.yylloc.range.slice(0);\n            }\n        }\n\n        lines = match[0].match(/(?:\\r\\n?|\\n).*/g);\n        if (lines) {\n            this.yylineno += lines.length;\n        }\n        this.yylloc = {\n            first_line: this.yylloc.last_line,\n            last_line: this.yylineno + 1,\n            first_column: this.yylloc.last_column,\n            last_column: lines ?\n                         lines[lines.length - 1].length - lines[lines.length - 1].match(/\\r?\\n?/)[0].length :\n                         this.yylloc.last_column + match[0].length\n        };\n        this.yytext += match[0];\n        this.match += match[0];\n        this.matches = match;\n        this.yyleng = this.yytext.length;\n        if (this.options.ranges) {\n            this.yylloc.range = [this.offset, this.offset += this.yyleng];\n        }\n        this._more = false;\n        this._backtrack = false;\n        this._input = this._input.slice(match[0].length);\n        this.matched += match[0];\n        token = this.performAction.call(this, this.yy, this, indexed_rule, this.conditionStack[this.conditionStack.length - 1]);\n        if (this.done && this._input) {\n            this.done = false;\n        }\n        if (token) {\n            return token;\n        } else if (this._backtrack) {\n            // recover context\n            for (var k in backup) {\n                this[k] = backup[k];\n            }\n            return false; // rule action called reject() implying the next rule should be tested instead.\n        }\n        return false;\n    },\n\n// return next match in input\nnext:function () {\n        if (this.done) {\n            return this.EOF;\n        }\n        if (!this._input) {\n            this.done = true;\n        }\n\n        var token,\n            match,\n            tempMatch,\n            index;\n        if (!this._more) {\n            this.yytext = '';\n            this.match = '';\n        }\n        var rules = this._currentRules();\n        for (var i = 0; i < rules.length; i++) {\n            tempMatch = this._input.match(this.rules[rules[i]]);\n            if (tempMatch && (!match || tempMatch[0].length > match[0].length)) {\n                match = tempMatch;\n                index = i;\n                if (this.options.backtrack_lexer) {\n                    token = this.test_match(tempMatch, rules[i]);\n                    if (token !== false) {\n                        return token;\n                    } else if (this._backtrack) {\n                        match = false;\n                        continue; // rule action called reject() implying a rule MISmatch.\n                    } else {\n                        // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)\n                        return false;\n                    }\n                } else if (!this.options.flex) {\n                    break;\n                }\n            }\n        }\n        if (match) {\n            token = this.test_match(match, rules[index]);\n            if (token !== false) {\n                return token;\n            }\n            // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)\n            return false;\n        }\n        if (this._input === \"\") {\n            return this.EOF;\n        } else {\n            return this.parseError('Lexical error on line ' + (this.yylineno + 1) + '. Unrecognized text.\\n' + this.showPosition(), {\n                text: \"\",\n                token: null,\n                line: this.yylineno\n            });\n        }\n    },\n\n// return next match that has a token\nlex:function lex () {\n        var r = this.next();\n        if (r) {\n            return r;\n        } else {\n            return this.lex();\n        }\n    },\n\n// activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)\nbegin:function begin (condition) {\n        this.conditionStack.push(condition);\n    },\n\n// pop the previously active lexer condition state off the condition stack\npopState:function popState () {\n        var n = this.conditionStack.length - 1;\n        if (n > 0) {\n            return this.conditionStack.pop();\n        } else {\n            return this.conditionStack[0];\n        }\n    },\n\n// produce the lexer rule set which is active for the currently active lexer condition state\n_currentRules:function _currentRules () {\n        if (this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1]) {\n            return this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules;\n        } else {\n            return this.conditions[\"INITIAL\"].rules;\n        }\n    },\n\n// return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available\ntopState:function topState (n) {\n        n = this.conditionStack.length - 1 - Math.abs(n || 0);\n        if (n >= 0) {\n            return this.conditionStack[n];\n        } else {\n            return \"INITIAL\";\n        }\n    },\n\n// alias for begin(condition)\npushState:function pushState (condition) {\n        this.begin(condition);\n    },\n\n// return the number of states currently on the stack\nstateStackSize:function stateStackSize() {\n        return this.conditionStack.length;\n    },\noptions: {\"case-insensitive\":true},\nperformAction: function anonymous(yy,yy_,$avoiding_name_collisions,YY_START) {\nvar YYSTATE=YY_START;\nswitch($avoiding_name_collisions) {\ncase 0:/* skip comments */\nbreak;\ncase 1:/* skip comments */\nbreak;\ncase 2:/* ignore whitespace-only lines */\nbreak;\ncase 3:\n  if (yy.getIndentMode && yy.getIndentMode()) {\n    yy.consumeIndentText = true;\n    this.begin('INITIAL');\n    return 22;\n  }\n\nbreak;\ncase 4:/* ignore leading whitespace */\nbreak;\ncase 5: if (yy.setIndentMode) { yy.setIndentMode(false); } this.begin('INITIAL'); this.unput(yy_.yytext); \nbreak;\ncase 6: this.begin('bol'); return 8; \nbreak;\ncase 7:/* do nothing */\nbreak;\ncase 8:/* skip */\nbreak;\ncase 9:return 7;\nbreak;\ncase 10: return 11; \nbreak;\ncase 11: return 5; \nbreak;\ncase 12: return 12; \nbreak;\ncase 13: return 17; \nbreak;\ncase 14: if (yy.consumeIndentText) { yy.consumeIndentText = false; } else { return 19; } \nbreak;\ncase 15: return 24; \nbreak;\ncase 16: yy_.yytext = yy_.yytext.slice(2, -2); return 14; \nbreak;\ncase 17: yy_.yytext = yy_.yytext.slice(1, -1).trim(); return 14; \nbreak;\ncase 18: return 16; \nbreak;\ncase 19: return 31; \nbreak;\ncase 20: return 33; \nbreak;\ncase 21: return 32; \nbreak;\ncase 22: return 20; \nbreak;\ncase 23: return 21; \nbreak;\ncase 24: return 27; \nbreak;\ncase 25: return 15; \nbreak;\n}\n},\nrules: [/^(?:%%(?!\\{)[^\\n]*)/i,/^(?:[^\\}]%%[^\\n]*)/i,/^(?:[ \\t]+(?=[\\n\\r]))/i,/^(?:[ \\t]+(?=text\\b))/i,/^(?:[ \\t]+)/i,/^(?:[^ \\t\\n\\r])/i,/^(?:[\\n\\r]+)/i,/^(?:%%[^\\n]*)/i,/^(?:[ \\t]+)/i,/^(?:$)/i,/^(?:title\\s[^#\\n;]+)/i,/^(?:venn-beta\\b)/i,/^(?:set\\b)/i,/^(?:union\\b)/i,/^(?:text\\b)/i,/^(?:style\\b)/i,/^(?:\\[\"[^\\\"]*\"\\])/i,/^(?:\\[[^\\]\\\"]+\\])/i,/^(?:[+-]?(\\d+(\\.\\d+)?|\\.\\d+))/i,/^(?:#[0-9a-fA-F]{3,8})/i,/^(?:rgba\\(\\s*[0-9.]+\\s*[,]\\s*[0-9.]+\\s*[,]\\s*[0-9.]+\\s*[,]\\s*[0-9.]+\\s*\\))/i,/^(?:rgb\\(\\s*[0-9.]+\\s*[,]\\s*[0-9.]+\\s*[,]\\s*[0-9.]+\\s*\\))/i,/^(?:[A-Za-z_][A-Za-z0-9\\-_]*)/i,/^(?:\"[^\\\"]*\")/i,/^(?:,)/i,/^(?::)/i],\nconditions: {\"bol\":{\"rules\":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25],\"inclusive\":true},\"INITIAL\":{\"rules\":[0,1,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25],\"inclusive\":true}}\n});\nreturn lexer;\n})();\nparser.lexer = lexer;\nfunction Parser () {\n  this.yy = {};\n}\nParser.prototype = parser;parser.Parser = Parser;\nreturn new Parser;\n})(); \n\tparser.parser = parser;\n\texport { parser };\n\texport default parser;\n\t", "import type { VennDB, VennData, VennTextData, VennStyleData } from './vennTypes.js';\nimport type { VennDiagramConfig } from '../../config.type.js';\nimport { cleanAndMerge } from '../../utils.js';\nimport { getConfig as commonGetConfig } from '../../config.js';\nimport {\n  clear,\n  getAccDescription,\n  getAccTitle,\n  getDiagramTitle,\n  setAccDescription,\n  setAccTitle,\n  setDiagramTitle,\n} from '../common/commonDb.js';\nimport DEFAULT_CONFIG from '../../defaultConfig.js';\n\nconst subsets: VennData[] = [];\nconst textNodes: VennTextData[] = [];\nconst styleEntries: VennStyleData[] = [];\nconst knownSets = new Set<string>();\nlet currentSets: string[] | undefined;\nlet indentMode = false;\n\nexport const addSubsetData: VennDB['addSubsetData'] = (identifierList, label, size) => {\n  const sets = normalizeIdentifierList(identifierList).sort();\n  const resolvedSize = size ?? 10 / Math.pow(identifierList.length, 2);\n  currentSets = sets;\n  if (sets.length === 1) {\n    knownSets.add(sets[0]);\n  }\n\n  subsets.push({\n    sets,\n    size: resolvedSize,\n    label: label ? normalizeText(label) : undefined,\n  });\n};\n\nexport const getSubsetData = () => {\n  return subsets;\n};\n\nconst normalizeText = (text: string) => {\n  const trimmed = text.trim();\n  if (trimmed.length >= 2 && trimmed.startsWith('\"') && trimmed.endsWith('\"')) {\n    return trimmed.slice(1, -1);\n  }\n  return trimmed;\n};\n\nconst normalizeStyleValue = (value: string | undefined): string | undefined => {\n  return value ? normalizeText(value) : value;\n};\n\nexport const addTextData: VennDB['addTextData'] = (identifierList, id, label) => {\n  const normalizedId = normalizeText(id);\n  textNodes.push({\n    sets: normalizeIdentifierList(identifierList).sort(),\n    id: normalizedId,\n    label: label ? normalizeText(label) : undefined,\n  });\n};\n\nexport const addStyleData: VennDB['addStyleData'] = (identifierList, data) => {\n  const targets = normalizeIdentifierList(identifierList).sort();\n  const styles: Record<string, string> = {};\n  for (const [key, value] of data) {\n    styles[key] = normalizeStyleValue(value) ?? value;\n  }\n  styleEntries.push({ targets, styles });\n};\n\nexport const getStyleData = () => {\n  return styleEntries;\n};\n\nconst normalizeIdentifierList = (identifierList: string[]) => {\n  return identifierList.map((identifier) => normalizeText(identifier));\n};\n\nexport const validateUnionIdentifiers: VennDB['validateUnionIdentifiers'] = (identifierList) => {\n  const normalized = normalizeIdentifierList(identifierList);\n  const unknown = normalized.filter((identifier) => !knownSets.has(identifier));\n  if (unknown.length > 0) {\n    throw new Error(`unknown set identifier: ${unknown.join(', ')}`);\n  }\n};\n\nexport const getTextData = () => {\n  return textNodes;\n};\n\nexport const getCurrentSets: VennDB['getCurrentSets'] = () => currentSets;\nexport const getIndentMode: VennDB['getIndentMode'] = () => indentMode;\nexport const setIndentMode: VennDB['setIndentMode'] = (enabled) => {\n  indentMode = enabled;\n};\n\nconst DEFAULT_VENN_CONFIG: Required<VennDiagramConfig> = DEFAULT_CONFIG.venn;\n\nfunction getConfig(): Required<VennDiagramConfig> {\n  return cleanAndMerge(DEFAULT_VENN_CONFIG, commonGetConfig().venn);\n}\n\nconst customClear = () => {\n  clear();\n  subsets.length = 0;\n  textNodes.length = 0;\n  styleEntries.length = 0;\n  knownSets.clear();\n  currentSets = undefined;\n  indentMode = false;\n};\n\nexport const db: VennDB = {\n  getConfig,\n  clear: customClear,\n  setAccTitle,\n  getAccTitle,\n  setDiagramTitle,\n  getDiagramTitle,\n  getAccDescription,\n  setAccDescription,\n  addSubsetData,\n  getSubsetData,\n  addTextData,\n  addStyleData,\n  validateUnionIdentifiers,\n  getTextData,\n  getStyleData,\n  getCurrentSets,\n  getIndentMode,\n  setIndentMode,\n};\n", "export interface VennChartStyleOptions {\n  vennTitleTextColor: string;\n  vennSetTextColor: string;\n  fontFamily: string;\n  textColor: string;\n}\n\nconst getStyles = (options: VennChartStyleOptions) =>\n  `\n  .venn-title {\n    font-size: 32px;\n    fill: ${options.vennTitleTextColor};\n    font-family: ${options.fontFamily};\n  }\n\n  .venn-circle text {\n    font-size: 48px;\n    font-family: ${options.fontFamily};\n  }\n\n  .venn-intersection text {\n    font-size: 48px;\n    fill: ${options.vennSetTextColor};\n    font-family: ${options.fontFamily};\n  }\n\n  .venn-text-node {\n    font-family: ${options.fontFamily};\n    color: ${options.vennSetTextColor};\n  }\n`;\n\nexport default getStyles;\n", "const SMALL$1 = 1e-10;\n\n/**\n * Returns the intersection area of a bunch of circles (where each circle\n * is an object having an x,y and radius property)\n * @param {ReadonlyArray<{x: number, y: number, radius: number}>} circles\n * @param {undefined | { area?: number, arcArea?: number, polygonArea?: number, arcs?: ReadonlyArray<{ circle: {x: number, y: number, radius: number}, width: number, p1: {x: number, y: number}, p2: {x: number, y: number} }>, innerPoints: ReadonlyArray<{\n    x: number;\n    y: number;\n    parentIndex: [number, number];\n}>, intersectionPoints: ReadonlyArray<{\n  x: number;\n  y: number;\n  parentIndex: [number, number];\n}> }} stats\n * @returns {number}\n */\nfunction intersectionArea(circles, stats) {\n  // get all the intersection points of the circles\n  const intersectionPoints = getIntersectionPoints(circles);\n\n  // filter out points that aren't included in all the circles\n  const innerPoints = intersectionPoints.filter((p) => containedInCircles(p, circles));\n\n  let arcArea = 0;\n  let polygonArea = 0;\n  /** @type {{ circle: {x: number, y: number, radius: number}, width: number, p1: {x: number, y: number}, p2: {x: number, y: number} }[]} */\n  const arcs = [];\n\n  // if we have intersection points that are within all the circles,\n  // then figure out the area contained by them\n  if (innerPoints.length > 1) {\n    // sort the points by angle from the center of the polygon, which lets\n    // us just iterate over points to get the edges\n    const center = getCenter(innerPoints);\n    for (let i = 0; i < innerPoints.length; ++i) {\n      const p = innerPoints[i];\n      p.angle = Math.atan2(p.x - center.x, p.y - center.y);\n    }\n    innerPoints.sort((a, b) => b.angle - a.angle);\n\n    // iterate over all points, get arc between the points\n    // and update the areas\n    let p2 = innerPoints[innerPoints.length - 1];\n    for (let i = 0; i < innerPoints.length; ++i) {\n      const p1 = innerPoints[i];\n\n      // polygon area updates easily ...\n      polygonArea += (p2.x + p1.x) * (p1.y - p2.y);\n\n      // updating the arc area is a little more involved\n      const midPoint = { x: (p1.x + p2.x) / 2, y: (p1.y + p2.y) / 2 };\n      /** @types null | { circle: {x: number, y: number, radius: number}, width: number, p1: {x: number, y: number}, p2: {x: number, y: number} } */\n      let arc = null;\n\n      for (let j = 0; j < p1.parentIndex.length; ++j) {\n        if (p2.parentIndex.includes(p1.parentIndex[j])) {\n          // figure out the angle halfway between the two points\n          // on the current circle\n          const circle = circles[p1.parentIndex[j]];\n          const a1 = Math.atan2(p1.x - circle.x, p1.y - circle.y);\n          const a2 = Math.atan2(p2.x - circle.x, p2.y - circle.y);\n\n          let angleDiff = a2 - a1;\n          if (angleDiff < 0) {\n            angleDiff += 2 * Math.PI;\n          }\n\n          // and use that angle to figure out the width of the\n          // arc\n          const a = a2 - angleDiff / 2;\n          let width = distance(midPoint, {\n            x: circle.x + circle.radius * Math.sin(a),\n            y: circle.y + circle.radius * Math.cos(a),\n          });\n\n          // clamp the width to the largest is can actually be\n          // (sometimes slightly overflows because of FP errors)\n          if (width > circle.radius * 2) {\n            width = circle.radius * 2;\n          }\n\n          // pick the circle whose arc has the smallest width\n          if (arc == null || arc.width > width) {\n            arc = { circle, width, p1, p2, large: width > circle.radius, sweep: true };\n          }\n        }\n      }\n\n      if (arc != null) {\n        arcs.push(arc);\n        arcArea += circleArea(arc.circle.radius, arc.width);\n        p2 = p1;\n      }\n    }\n  } else {\n    // no intersection points, is either disjoint - or is completely\n    // overlapped. figure out which by examining the smallest circle\n    let smallest = circles[0];\n    for (let i = 1; i < circles.length; ++i) {\n      if (circles[i].radius < smallest.radius) {\n        smallest = circles[i];\n      }\n    }\n\n    // make sure the smallest circle is completely contained in all\n    // the other circles\n    let disjoint = false;\n    for (let i = 0; i < circles.length; ++i) {\n      if (distance(circles[i], smallest) > Math.abs(smallest.radius - circles[i].radius)) {\n        disjoint = true;\n        break;\n      }\n    }\n\n    if (disjoint) {\n      arcArea = polygonArea = 0;\n    } else {\n      arcArea = smallest.radius * smallest.radius * Math.PI;\n      arcs.push({\n        circle: smallest,\n        p1: { x: smallest.x, y: smallest.y + smallest.radius },\n        p2: { x: smallest.x - SMALL$1, y: smallest.y + smallest.radius },\n        width: smallest.radius * 2,\n        large: true,\n        sweep: true,\n      });\n    }\n  }\n\n  polygonArea /= 2;\n\n  if (stats) {\n    stats.area = arcArea + polygonArea;\n    stats.arcArea = arcArea;\n    stats.polygonArea = polygonArea;\n    stats.arcs = arcs;\n    stats.innerPoints = innerPoints;\n    stats.intersectionPoints = intersectionPoints;\n  }\n\n  return arcArea + polygonArea;\n}\n\n/**\n * returns whether a point is contained by all of a list of circles\n * @param {{x: number, y: number}} point\n * @param {ReadonlyArray<{x: number, y: number, radius: number}>} circles\n * @returns {boolean}\n */\nfunction containedInCircles(point, circles) {\n  return circles.every((circle) => distance(point, circle) < circle.radius + SMALL$1);\n}\n\n/**\n * Gets all intersection points between a bunch of circles\n * @param {ReadonlyArray<{x: number, y: number, radius: number}>} circles\n * @returns {ReadonlyArray<{x: number, y: number, parentIndex: [number, number]}>}\n */\nfunction getIntersectionPoints(circles) {\n  /** @type {{x: number, y: number, parentIndex: [number, number]}[]} */\n  const ret = [];\n  for (let i = 0; i < circles.length; ++i) {\n    for (let j = i + 1; j < circles.length; ++j) {\n      const intersect = circleCircleIntersection(circles[i], circles[j]);\n      for (const p of intersect) {\n        p.parentIndex = [i, j];\n        ret.push(p);\n      }\n    }\n  }\n  return ret;\n}\n\n/**\n * Circular segment area calculation. See http://mathworld.wolfram.com/CircularSegment.html\n * @param {number} r\n * @param {number} width\n * @returns {number}\n **/\nfunction circleArea(r, width) {\n  return r * r * Math.acos(1 - width / r) - (r - width) * Math.sqrt(width * (2 * r - width));\n}\n\n/**\n * euclidean distance between two points\n * @param {{x: number, y: number}} p1\n * @param {{x: number, y: number}} p2\n * @returns {number}\n **/\nfunction distance(p1, p2) {\n  return Math.sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));\n}\n\n/**\n * Returns the overlap area of two circles of radius r1 and r2 - that\n * have their centers separated by distance d. Simpler faster\n * circle intersection for only two circles\n * @param {number} r1\n * @param {number} r2\n * @param {number} d\n * @returns {number}\n */\nfunction circleOverlap(r1, r2, d) {\n  // no overlap\n  if (d >= r1 + r2) {\n    return 0;\n  }\n\n  // completely overlapped\n  if (d <= Math.abs(r1 - r2)) {\n    return Math.PI * Math.min(r1, r2) * Math.min(r1, r2);\n  }\n\n  const w1 = r1 - (d * d - r2 * r2 + r1 * r1) / (2 * d);\n  const w2 = r2 - (d * d - r1 * r1 + r2 * r2) / (2 * d);\n  return circleArea(r1, w1) + circleArea(r2, w2);\n}\n\n/**\n * Given two circles (containing a x/y/radius attributes),\n * returns the intersecting points if possible\n * note: doesn't handle cases where there are infinitely many\n * intersection points (circles are equivalent):, or only one intersection point\n * @param {{x: number, y: number, radius: number}} p1\n * @param {{x: number, y: number, radius: number}} p2\n * @returns {ReadonlyArray<{x: number, y: number}>}\n **/\nfunction circleCircleIntersection(p1, p2) {\n  const d = distance(p1, p2);\n  const r1 = p1.radius;\n  const r2 = p2.radius;\n\n  // if to far away, or self contained - can't be done\n  if (d >= r1 + r2 || d <= Math.abs(r1 - r2)) {\n    return [];\n  }\n\n  const a = (r1 * r1 - r2 * r2 + d * d) / (2 * d);\n  const h = Math.sqrt(r1 * r1 - a * a);\n  const x0 = p1.x + (a * (p2.x - p1.x)) / d;\n  const y0 = p1.y + (a * (p2.y - p1.y)) / d;\n  const rx = -(p2.y - p1.y) * (h / d);\n  const ry = -(p2.x - p1.x) * (h / d);\n\n  return [\n    { x: x0 + rx, y: y0 - ry },\n    { x: x0 - rx, y: y0 + ry },\n  ];\n}\n\n/**\n * Returns the center of a bunch of points\n * @param {ReadonlyArray<{x: number, y: number}>} points\n * @returns {{x: number, y: number}}\n */\nfunction getCenter(points) {\n  const center = { x: 0, y: 0 };\n  for (const point of points) {\n    center.x += point.x;\n    center.y += point.y;\n  }\n  center.x /= points.length;\n  center.y /= points.length;\n  return center;\n}\n\n/** finds the zeros of a function, given two starting points (which must\n * have opposite signs */\nfunction bisect(f, a, b, parameters) {\n    parameters = parameters || {};\n    const maxIterations = parameters.maxIterations || 100;\n    const tolerance = parameters.tolerance || 1e-10;\n    const fA = f(a);\n    const fB = f(b);\n    let delta = b - a;\n\n    if (fA * fB > 0) {\n        throw 'Initial bisect points must have opposite signs';\n    }\n\n    if (fA === 0) return a;\n    if (fB === 0) return b;\n\n    for (let i = 0; i < maxIterations; ++i) {\n        delta /= 2;\n        const mid = a + delta;\n        const fMid = f(mid);\n\n        if (fMid * fA >= 0) {\n            a = mid;\n        }\n\n        if (Math.abs(delta) < tolerance || fMid === 0) {\n            return mid;\n        }\n    }\n    return a + delta;\n}\n\n// need some basic operations on vectors, rather than adding a dependency,\n// just define here\nfunction zeros(x) {\n    const r = new Array(x);\n    for (let i = 0; i < x; ++i) {\n        r[i] = 0;\n    }\n    return r;\n}\nfunction zerosM(x, y) {\n    return zeros(x).map(() => zeros(y));\n}\n\nfunction dot(a, b) {\n    let ret = 0;\n    for (let i = 0; i < a.length; ++i) {\n        ret += a[i] * b[i];\n    }\n    return ret;\n}\n\nfunction norm2(a) {\n    return Math.sqrt(dot(a, a));\n}\n\nfunction scale(ret, value, c) {\n    for (let i = 0; i < value.length; ++i) {\n        ret[i] = value[i] * c;\n    }\n}\n\nfunction weightedSum(ret, w1, v1, w2, v2) {\n    for (let j = 0; j < ret.length; ++j) {\n        ret[j] = w1 * v1[j] + w2 * v2[j];\n    }\n}\n\n/** minimizes a function using the downhill simplex method */\nfunction nelderMead(f, x0, parameters) {\n    parameters = parameters || {};\n\n    const maxIterations = parameters.maxIterations || x0.length * 200;\n    const nonZeroDelta = parameters.nonZeroDelta || 1.05;\n    const zeroDelta = parameters.zeroDelta || 0.001;\n    const minErrorDelta = parameters.minErrorDelta || 1e-6;\n    const minTolerance = parameters.minErrorDelta || 1e-5;\n    const rho = parameters.rho !== undefined ? parameters.rho : 1;\n    const chi = parameters.chi !== undefined ? parameters.chi : 2;\n    const psi = parameters.psi !== undefined ? parameters.psi : -0.5;\n    const sigma = parameters.sigma !== undefined ? parameters.sigma : 0.5;\n    let maxDiff;\n\n    // initialize simplex.\n    const N = x0.length;\n    const simplex = new Array(N + 1);\n    simplex[0] = x0;\n    simplex[0].fx = f(x0);\n    simplex[0].id = 0;\n    for (let i = 0; i < N; ++i) {\n        const point = x0.slice();\n        point[i] = point[i] ? point[i] * nonZeroDelta : zeroDelta;\n        simplex[i + 1] = point;\n        simplex[i + 1].fx = f(point);\n        simplex[i + 1].id = i + 1;\n    }\n\n    function updateSimplex(value) {\n        for (let i = 0; i < value.length; i++) {\n            simplex[N][i] = value[i];\n        }\n        simplex[N].fx = value.fx;\n    }\n\n    const sortOrder = (a, b) => a.fx - b.fx;\n\n    const centroid = x0.slice();\n    const reflected = x0.slice();\n    const contracted = x0.slice();\n    const expanded = x0.slice();\n\n    for (let iteration = 0; iteration < maxIterations; ++iteration) {\n        simplex.sort(sortOrder);\n\n        if (parameters.history) {\n            // copy the simplex (since later iterations will mutate) and\n            // sort it to have a consistent order between iterations\n            const sortedSimplex = simplex.map((x) => {\n                const state = x.slice();\n                state.fx = x.fx;\n                state.id = x.id;\n                return state;\n            });\n            sortedSimplex.sort((a, b) => a.id - b.id);\n\n            parameters.history.push({\n                x: simplex[0].slice(),\n                fx: simplex[0].fx,\n                simplex: sortedSimplex,\n            });\n        }\n\n        maxDiff = 0;\n        for (let i = 0; i < N; ++i) {\n            maxDiff = Math.max(maxDiff, Math.abs(simplex[0][i] - simplex[1][i]));\n        }\n\n        if (Math.abs(simplex[0].fx - simplex[N].fx) < minErrorDelta && maxDiff < minTolerance) {\n            break;\n        }\n\n        // compute the centroid of all but the worst point in the simplex\n        for (let i = 0; i < N; ++i) {\n            centroid[i] = 0;\n            for (let j = 0; j < N; ++j) {\n                centroid[i] += simplex[j][i];\n            }\n            centroid[i] /= N;\n        }\n\n        // reflect the worst point past the centroid  and compute loss at reflected\n        // point\n        const worst = simplex[N];\n        weightedSum(reflected, 1 + rho, centroid, -rho, worst);\n        reflected.fx = f(reflected);\n\n        // if the reflected point is the best seen, then possibly expand\n        if (reflected.fx < simplex[0].fx) {\n            weightedSum(expanded, 1 + chi, centroid, -chi, worst);\n            expanded.fx = f(expanded);\n            if (expanded.fx < reflected.fx) {\n                updateSimplex(expanded);\n            } else {\n                updateSimplex(reflected);\n            }\n        }\n\n        // if the reflected point is worse than the second worst, we need to\n        // contract\n        else if (reflected.fx >= simplex[N - 1].fx) {\n            let shouldReduce = false;\n\n            if (reflected.fx > worst.fx) {\n                // do an inside contraction\n                weightedSum(contracted, 1 + psi, centroid, -psi, worst);\n                contracted.fx = f(contracted);\n                if (contracted.fx < worst.fx) {\n                    updateSimplex(contracted);\n                } else {\n                    shouldReduce = true;\n                }\n            } else {\n                // do an outside contraction\n                weightedSum(contracted, 1 - psi * rho, centroid, psi * rho, worst);\n                contracted.fx = f(contracted);\n                if (contracted.fx < reflected.fx) {\n                    updateSimplex(contracted);\n                } else {\n                    shouldReduce = true;\n                }\n            }\n\n            if (shouldReduce) {\n                // if we don't contract here, we're done\n                if (sigma >= 1) break;\n\n                // do a reduction\n                for (let i = 1; i < simplex.length; ++i) {\n                    weightedSum(simplex[i], 1 - sigma, simplex[0], sigma, simplex[i]);\n                    simplex[i].fx = f(simplex[i]);\n                }\n            }\n        } else {\n            updateSimplex(reflected);\n        }\n    }\n\n    simplex.sort(sortOrder);\n    return { fx: simplex[0].fx, x: simplex[0] };\n}\n\n/// searches along line 'pk' for a point that satifies the wolfe conditions\n/// See 'Numerical Optimization' by Nocedal and Wright p59-60\n/// f : objective function\n/// pk : search direction\n/// current: object containing current gradient/loss\n/// next: output: contains next gradient/loss\n/// returns a: step size taken\nfunction wolfeLineSearch(f, pk, current, next, a, c1, c2) {\n    const phi0 = current.fx;\n    const phiPrime0 = dot(current.fxprime, pk);\n    let phi = phi0;\n    let phi_old = phi0;\n    let phiPrime = phiPrime0;\n    let a0 = 0;\n\n    a = a || 1;\n    c1 = c1 || 1e-6;\n    c2 = c2 || 0.1;\n\n    function zoom(a_lo, a_high, phi_lo) {\n        for (let iteration = 0; iteration < 16; ++iteration) {\n            a = (a_lo + a_high) / 2;\n            weightedSum(next.x, 1.0, current.x, a, pk);\n            phi = next.fx = f(next.x, next.fxprime);\n            phiPrime = dot(next.fxprime, pk);\n\n            if (phi > phi0 + c1 * a * phiPrime0 || phi >= phi_lo) {\n                a_high = a;\n            } else {\n                if (Math.abs(phiPrime) <= -c2 * phiPrime0) {\n                    return a;\n                }\n\n                if (phiPrime * (a_high - a_lo) >= 0) {\n                    a_high = a_lo;\n                }\n\n                a_lo = a;\n                phi_lo = phi;\n            }\n        }\n\n        return 0;\n    }\n\n    for (let iteration = 0; iteration < 10; ++iteration) {\n        weightedSum(next.x, 1.0, current.x, a, pk);\n        phi = next.fx = f(next.x, next.fxprime);\n        phiPrime = dot(next.fxprime, pk);\n        if (phi > phi0 + c1 * a * phiPrime0 || (iteration && phi >= phi_old)) {\n            return zoom(a0, a, phi_old);\n        }\n\n        if (Math.abs(phiPrime) <= -c2 * phiPrime0) {\n            return a;\n        }\n\n        if (phiPrime >= 0) {\n            return zoom(a, a0, phi);\n        }\n\n        phi_old = phi;\n        a0 = a;\n        a *= 2;\n    }\n\n    return a;\n}\n\nfunction conjugateGradient(f, initial, params) {\n    // allocate all memory up front here, keep out of the loop for perfomance\n    // reasons\n    let current = { x: initial.slice(), fx: 0, fxprime: initial.slice() };\n    let next = { x: initial.slice(), fx: 0, fxprime: initial.slice() };\n    const yk = initial.slice();\n    let pk;\n    let temp;\n    let a = 1;\n    let maxIterations;\n\n    params = params || {};\n    maxIterations = params.maxIterations || initial.length * 20;\n\n    current.fx = f(current.x, current.fxprime);\n    pk = current.fxprime.slice();\n    scale(pk, current.fxprime, -1);\n\n    for (let i = 0; i < maxIterations; ++i) {\n        a = wolfeLineSearch(f, pk, current, next, a);\n\n        // todo: history in wrong spot?\n        if (params.history) {\n            params.history.push({\n                x: current.x.slice(),\n                fx: current.fx,\n                fxprime: current.fxprime.slice(),\n                alpha: a,\n            });\n        }\n\n        if (!a) {\n            // faiiled to find point that satifies wolfe conditions.\n            // reset direction for next iteration\n            scale(pk, current.fxprime, -1);\n        } else {\n            // update direction using Polak\u2013Ribiere CG method\n            weightedSum(yk, 1, next.fxprime, -1, current.fxprime);\n\n            const delta_k = dot(current.fxprime, current.fxprime);\n            const beta_k = Math.max(0, dot(yk, next.fxprime) / delta_k);\n\n            weightedSum(pk, beta_k, pk, -1, next.fxprime);\n\n            temp = current;\n            current = next;\n            next = temp;\n        }\n\n        if (norm2(current.fxprime) <= 1e-5) {\n            break;\n        }\n    }\n\n    if (params.history) {\n        params.history.push({\n            x: current.x.slice(),\n            fx: current.fx,\n            fxprime: current.fxprime.slice(),\n            alpha: a,\n        });\n    }\n\n    return current;\n}\n\n/**\n * given a list of set objects, and their corresponding overlaps\n * updates the (x, y, radius) attribute on each set such that their positions\n * roughly correspond to the desired overlaps\n * @param {readonly {sets: readonly string[]; size: number; weight?: number}[]} sets\n * @returns {{[setid: string]: {x: number, y: number, radius: number}}}\n */\nfunction venn(sets, parameters = {}) {\n  parameters.maxIterations = parameters.maxIterations || 500;\n\n  const initialLayout = parameters.initialLayout || bestInitialLayout;\n  const loss = parameters.lossFunction || lossFunction;\n\n  // add in missing pairwise areas as having 0 size\n  const areas = addMissingAreas(sets, parameters);\n\n  // initial layout is done greedily\n  const circles = initialLayout(areas, parameters);\n\n  // transform x/y coordinates to a vector to optimize\n  const setids = Object.keys(circles);\n  /** @type {number[]} */\n  const initial = [];\n  for (const setid of setids) {\n    initial.push(circles[setid].x);\n    initial.push(circles[setid].y);\n  }\n\n  // optimize initial layout from our loss function\n  const solution = nelderMead(\n    (values) => {\n      const current = {};\n      for (let i = 0; i < setids.length; ++i) {\n        const setid = setids[i];\n        current[setid] = {\n          x: values[2 * i],\n          y: values[2 * i + 1],\n          radius: circles[setid].radius,\n          // size : circles[setid].size\n        };\n      }\n      return loss(current, areas);\n    },\n    initial,\n    parameters\n  );\n\n  // transform solution vector back to x/y points\n  const positions = solution.x;\n  for (let i = 0; i < setids.length; ++i) {\n    const setid = setids[i];\n    circles[setid].x = positions[2 * i];\n    circles[setid].y = positions[2 * i + 1];\n  }\n\n  return circles;\n}\n\nconst SMALL = 1e-10;\n\n/**\n * Returns the distance necessary for two circles of radius r1 + r2 to\n * have the overlap area 'overlap'\n * @param {number} r1\n * @param {number} r2\n * @param {number} overlap\n * @returns {number}\n */\nfunction distanceFromIntersectArea(r1, r2, overlap) {\n  // handle complete overlapped circles\n  if (Math.min(r1, r2) * Math.min(r1, r2) * Math.PI <= overlap + SMALL) {\n    return Math.abs(r1 - r2);\n  }\n\n  return bisect((distance) => circleOverlap(r1, r2, distance) - overlap, 0, r1 + r2);\n}\n\n/**\n * Missing pair-wise intersection area data can cause problems:\n * treating as an unknown means that sets will be laid out overlapping,\n * which isn't what people expect. To reflect that we want disjoint sets\n * here, set the overlap to 0 for all missing pairwise set intersections\n * @param {ReadonlyArray<{sets: ReadonlyArray<string>, size: number}>} areas\n * @returns {ReadonlyArray<{sets: ReadonlyArray<string>, size: number}>}\n */\nfunction addMissingAreas(areas, parameters = {}) {\n  const distinct = parameters.distinct;\n  const r = areas.map((s) => Object.assign({}, s));\n\n  function toKey(arr) {\n    return arr.join(';');\n  }\n\n  if (distinct) {\n    // recreate the full ones by adding things up but just to level two since the rest doesn't matter\n    /** @types Map<string, number> */\n    const count = new Map();\n    for (const area of r) {\n      for (let i = 0; i < area.sets.length; i++) {\n        const si = String(area.sets[i]);\n        count.set(si, area.size + (count.get(si) || 0));\n        for (let j = i + 1; j < area.sets.length; j++) {\n          const sj = String(area.sets[j]);\n          const k1 = `${si};${sj}`;\n          const k2 = `${sj};${si}`;\n          count.set(k1, area.size + (count.get(k1) || 0));\n          count.set(k2, area.size + (count.get(k2) || 0));\n        }\n      }\n    }\n    for (const area of r) {\n      if (area.sets.length < 3) {\n        area.size = count.get(toKey(area.sets));\n      }\n    }\n  }\n\n  // two circle intersections that aren't defined\n  const ids = [];\n\n  /** @type {Set<string>} */\n  const pairs = new Set();\n  for (const area of r) {\n    if (area.sets.length === 1) {\n      ids.push(area.sets[0]);\n    } else if (area.sets.length === 2) {\n      const a = area.sets[0];\n      const b = area.sets[1];\n      pairs.add(toKey(area.sets));\n      pairs.add(toKey([b, a]));\n    }\n  }\n\n  ids.sort((a, b) => (a === b ? 0 : a < b ? -1 : +1));\n\n  for (let i = 0; i < ids.length; ++i) {\n    const a = ids[i];\n    for (let j = i + 1; j < ids.length; ++j) {\n      const b = ids[j];\n      if (!pairs.has(toKey([a, b]))) {\n        r.push({ sets: [a, b], size: 0 });\n      }\n    }\n  }\n  return r;\n}\n\n/**\n * Returns two matrices, one of the euclidean distances between the sets\n * and the other indicating if there are subset or disjoint set relationships\n * @param {ReadonlyArray<{sets: ReadonlyArray<number>}>} areas\n * @param {ReadonlyArray<{size: number}>} sets\n * @param {ReadonlyArray<number>} setids\n */\nfunction getDistanceMatrices(areas, sets, setids) {\n  // initialize an empty distance matrix between all the points\n  /**\n   * @type {number[][]}\n   */\n  const distances = zerosM(sets.length, sets.length);\n  /**\n   * @type {number[][]}\n   */\n  const constraints = zerosM(sets.length, sets.length);\n\n  // compute required distances between all the sets such that\n  // the areas match\n  areas\n    .filter((x) => x.sets.length === 2)\n    .forEach((current) => {\n      const left = setids[current.sets[0]];\n      const right = setids[current.sets[1]];\n      const r1 = Math.sqrt(sets[left].size / Math.PI);\n      const r2 = Math.sqrt(sets[right].size / Math.PI);\n      const distance = distanceFromIntersectArea(r1, r2, current.size);\n\n      distances[left][right] = distances[right][left] = distance;\n\n      // also update constraints to indicate if its a subset or disjoint\n      // relationship\n      let c = 0;\n      if (current.size + 1e-10 >= Math.min(sets[left].size, sets[right].size)) {\n        c = 1;\n      } else if (current.size <= 1e-10) {\n        c = -1;\n      }\n      constraints[left][right] = constraints[right][left] = c;\n    });\n\n  return { distances, constraints };\n}\n\n/// computes the gradient and loss simultaneously for our constrained MDS optimizer\nfunction constrainedMDSGradient(x, fxprime, distances, constraints) {\n  for (let i = 0; i < fxprime.length; ++i) {\n    fxprime[i] = 0;\n  }\n\n  let loss = 0;\n  for (let i = 0; i < distances.length; ++i) {\n    const xi = x[2 * i];\n    const yi = x[2 * i + 1];\n    for (let j = i + 1; j < distances.length; ++j) {\n      const xj = x[2 * j];\n      const yj = x[2 * j + 1];\n      const dij = distances[i][j];\n      const constraint = constraints[i][j];\n\n      const squaredDistance = (xj - xi) * (xj - xi) + (yj - yi) * (yj - yi);\n      const distance = Math.sqrt(squaredDistance);\n      const delta = squaredDistance - dij * dij;\n\n      if ((constraint > 0 && distance <= dij) || (constraint < 0 && distance >= dij)) {\n        continue;\n      }\n\n      loss += 2 * delta * delta;\n\n      fxprime[2 * i] += 4 * delta * (xi - xj);\n      fxprime[2 * i + 1] += 4 * delta * (yi - yj);\n\n      fxprime[2 * j] += 4 * delta * (xj - xi);\n      fxprime[2 * j + 1] += 4 * delta * (yj - yi);\n    }\n  }\n  return loss;\n}\n\n/**\n * takes the best working variant of either constrained MDS or greedy\n * @param {ReadonlyArray<{sets: ReadonlyArray<string>, size: number}>} areas\n */\nfunction bestInitialLayout(areas, params = {}) {\n  let initial = greedyLayout(areas, params);\n  const loss = params.lossFunction || lossFunction;\n\n  // greedylayout is sufficient for all 2/3 circle cases. try out\n  // constrained MDS for higher order problems, take its output\n  // if it outperforms. (greedy is aesthetically better on 2/3 circles\n  // since it axis aligns)\n  if (areas.length >= 8) {\n    const constrained = constrainedMDSLayout(areas, params);\n    const constrainedLoss = loss(constrained, areas);\n    const greedyLoss = loss(initial, areas);\n\n    if (constrainedLoss + 1e-8 < greedyLoss) {\n      initial = constrained;\n    }\n  }\n  return initial;\n}\n\n/**\n * use the constrained MDS variant to generate an initial layout\n * @param {ReadonlyArray<{sets: ReadonlyArray<string>, size: number}>} areas\n * @returns {{[key: string]: {x: number, y: number, radius: number}}}\n */\nfunction constrainedMDSLayout(areas, params = {}) {\n  const restarts = params.restarts || 10;\n\n  // bidirectionally map sets to a rowid  (so we can create a matrix)\n  const sets = [];\n  const setids = {};\n  for (const area of areas) {\n    if (area.sets.length === 1) {\n      setids[area.sets[0]] = sets.length;\n      sets.push(area);\n    }\n  }\n\n  let { distances, constraints } = getDistanceMatrices(areas, sets, setids);\n\n  // keep distances bounded, things get messed up otherwise.\n  // TODO: proper preconditioner?\n  const norm = norm2(distances.map(norm2)) / distances.length;\n  distances = distances.map((row) => row.map((value) => value / norm));\n\n  const obj = (x, fxprime) => constrainedMDSGradient(x, fxprime, distances, constraints);\n\n  let best = null;\n  for (let i = 0; i < restarts; ++i) {\n    const initial = zeros(distances.length * 2).map(Math.random);\n\n    const current = conjugateGradient(obj, initial, params);\n    if (!best || current.fx < best.fx) {\n      best = current;\n    }\n  }\n\n  const positions = best.x;\n\n  // translate rows back to (x,y,radius) coordinates\n  /** @type {{[key: string]: {x: number, y: number, radius: number}}} */\n  const circles = {};\n  for (let i = 0; i < sets.length; ++i) {\n    const set = sets[i];\n    circles[set.sets[0]] = {\n      x: positions[2 * i] * norm,\n      y: positions[2 * i + 1] * norm,\n      radius: Math.sqrt(set.size / Math.PI),\n    };\n  }\n\n  if (params.history) {\n    for (const h of params.history) {\n      scale(h.x, norm);\n    }\n  }\n  return circles;\n}\n\n/**\n * Lays out a Venn diagram greedily, going from most overlapped sets to\n * least overlapped, attempting to position each new set such that the\n * overlapping areas to already positioned sets are basically right\n * @param {ReadonlyArray<{size: number, sets: ReadonlyArray<string>}>} areas\n * @return {{[key: string]: {x: number, y: number, radius: number}}}\n */\nfunction greedyLayout(areas, params) {\n  const loss = params && params.lossFunction ? params.lossFunction : lossFunction;\n\n  // define a circle for each set\n  /** @type {{[key: string]: {x: number, y: number, radius: number}}} */\n  const circles = {};\n  /** @type {{[key: string]: {set: string, size: number, weight: number}[]}} */\n  const setOverlaps = {};\n  for (const area of areas) {\n    if (area.sets.length === 1) {\n      const set = area.sets[0];\n      circles[set] = {\n        x: 1e10,\n        y: 1e10,\n        rowid: circles.length,\n        size: area.size,\n        radius: Math.sqrt(area.size / Math.PI),\n      };\n      setOverlaps[set] = [];\n    }\n  }\n\n  areas = areas.filter((a) => a.sets.length === 2);\n\n  // map each set to a list of all the other sets that overlap it\n  for (const current of areas) {\n    let weight = current.weight != null ? current.weight : 1.0;\n    const left = current.sets[0];\n    const right = current.sets[1];\n\n    // completely overlapped circles shouldn't be positioned early here\n    if (current.size + SMALL >= Math.min(circles[left].size, circles[right].size)) {\n      weight = 0;\n    }\n\n    setOverlaps[left].push({ set: right, size: current.size, weight });\n    setOverlaps[right].push({ set: left, size: current.size, weight });\n  }\n\n  // get list of most overlapped sets\n  const mostOverlapped = [];\n  Object.keys(setOverlaps).forEach((set) => {\n    let size = 0;\n    for (let i = 0; i < setOverlaps[set].length; ++i) {\n      size += setOverlaps[set][i].size * setOverlaps[set][i].weight;\n    }\n\n    mostOverlapped.push({ set, size });\n  });\n\n  // sort by size desc\n  function sortOrder(a, b) {\n    return b.size - a.size;\n  }\n  mostOverlapped.sort(sortOrder);\n\n  // keep track of what sets have been laid out\n  const positioned = {};\n  function isPositioned(element) {\n    return element.set in positioned;\n  }\n\n  /**\n   * adds a point to the output\n   * @param {{x: number, y: number}} point\n   * @param {number} index\n   */\n  function positionSet(point, index) {\n    circles[index].x = point.x;\n    circles[index].y = point.y;\n    positioned[index] = true;\n  }\n\n  // add most overlapped set at (0,0)\n  positionSet({ x: 0, y: 0 }, mostOverlapped[0].set);\n\n  // get distances between all points. TODO, necessary?\n  // answer: probably not\n  // var distances = venn.getDistanceMatrices(circles, areas).distances;\n  for (let i = 1; i < mostOverlapped.length; ++i) {\n    const setIndex = mostOverlapped[i].set;\n    const overlap = setOverlaps[setIndex].filter(isPositioned);\n    const set = circles[setIndex];\n    overlap.sort(sortOrder);\n\n    if (overlap.length === 0) {\n      // this shouldn't happen anymore with addMissingAreas\n      throw 'ERROR: missing pairwise overlap information';\n    }\n\n    /** @type {{x: number, y: number}[]} */\n    const points = [];\n    for (var j = 0; j < overlap.length; ++j) {\n      // get appropriate distance from most overlapped already added set\n      const p1 = circles[overlap[j].set];\n      const d1 = distanceFromIntersectArea(set.radius, p1.radius, overlap[j].size);\n\n      // sample positions at 90 degrees for maximum aesthetics\n      points.push({ x: p1.x + d1, y: p1.y });\n      points.push({ x: p1.x - d1, y: p1.y });\n      points.push({ y: p1.y + d1, x: p1.x });\n      points.push({ y: p1.y - d1, x: p1.x });\n\n      // if we have at least 2 overlaps, then figure out where the\n      // set should be positioned analytically and try those too\n      for (let k = j + 1; k < overlap.length; ++k) {\n        const p2 = circles[overlap[k].set];\n        const d2 = distanceFromIntersectArea(set.radius, p2.radius, overlap[k].size);\n\n        const extraPoints = circleCircleIntersection(\n          { x: p1.x, y: p1.y, radius: d1 },\n          { x: p2.x, y: p2.y, radius: d2 }\n        );\n        points.push(...extraPoints);\n      }\n    }\n\n    // we have some candidate positions for the set, examine loss\n    // at each position to figure out where to put it at\n    let bestLoss = 1e50;\n    let bestPoint = points[0];\n    for (const point of points) {\n      circles[setIndex].x = point.x;\n      circles[setIndex].y = point.y;\n      const localLoss = loss(circles, areas);\n      if (localLoss < bestLoss) {\n        bestLoss = localLoss;\n        bestPoint = point;\n      }\n    }\n\n    positionSet(bestPoint, setIndex);\n  }\n\n  return circles;\n}\n\n/**\n * Given a bunch of sets, and the desired overlaps between these sets - computes\n * the distance from the actual overlaps to the desired overlaps. Note that\n * this method ignores overlaps of more than 2 circles\n * @param {{[key: string]: <{x: number, y: number, radius: number}>}} circles\n * @param {ReadonlyArray<{size: number, sets: ReadonlyArray<string>, weight?: number}>} overlaps\n * @returns {number}\n */\nfunction lossFunction(circles, overlaps) {\n  let output = 0;\n\n  for (const area of overlaps) {\n    if (area.sets.length === 1) {\n      continue;\n    }\n    /** @type {number} */\n    let overlap;\n    if (area.sets.length === 2) {\n      const left = circles[area.sets[0]];\n      const right = circles[area.sets[1]];\n      overlap = circleOverlap(left.radius, right.radius, distance(left, right));\n    } else {\n      overlap = intersectionArea(area.sets.map((d) => circles[d]));\n    }\n\n    const weight = area.weight != null ? area.weight : 1.0;\n    output += weight * (overlap - area.size) * (overlap - area.size);\n  }\n\n  return output;\n}\n\nfunction logRatioLossFunction(circles, overlaps) {\n  let output = 0;\n\n  for (const area of overlaps) {\n    if (area.sets.length === 1) {\n      continue;\n    }\n    /** @type {number} */\n    let overlap;\n    if (area.sets.length === 2) {\n      const left = circles[area.sets[0]];\n      const right = circles[area.sets[1]];\n      overlap = circleOverlap(left.radius, right.radius, distance(left, right));\n    } else {\n      overlap = intersectionArea(area.sets.map((d) => circles[d]));\n    }\n\n    const weight = area.weight != null ? area.weight : 1.0;\n    const differenceFromIdeal = Math.log((overlap + 1) / (area.size + 1));\n    output += weight * differenceFromIdeal * differenceFromIdeal;\n  }\n\n  return output;\n}\n\n/**\n * orientates a bunch of circles to point in orientation\n * @param {{x :number, y: number, radius: number}[]} circles\n * @param {number | undefined} orientation\n * @param {((a: {x :number, y: number, radius: number}, b: {x :number, y: number, radius: number}) => number) | undefined} orientationOrder\n */\nfunction orientateCircles(circles, orientation, orientationOrder) {\n  if (orientationOrder == null) {\n    circles.sort((a, b) => b.radius - a.radius);\n  } else {\n    circles.sort(orientationOrder);\n  }\n\n  // shift circles so largest circle is at (0, 0)\n  if (circles.length > 0) {\n    const largestX = circles[0].x;\n    const largestY = circles[0].y;\n\n    for (const circle of circles) {\n      circle.x -= largestX;\n      circle.y -= largestY;\n    }\n  }\n\n  if (circles.length === 2) {\n    // if the second circle is a subset of the first, arrange so that\n    // it is off to one side. hack for https://github.com/benfred/venn.js/issues/120\n    const dist = distance(circles[0], circles[1]);\n    if (dist < Math.abs(circles[1].radius - circles[0].radius)) {\n      circles[1].x = circles[0].x + circles[0].radius - circles[1].radius - 1e-10;\n      circles[1].y = circles[0].y;\n    }\n  }\n\n  // rotate circles so that second largest is at an angle of 'orientation'\n  // from largest\n  if (circles.length > 1) {\n    const rotation = Math.atan2(circles[1].x, circles[1].y) - orientation;\n    const c = Math.cos(rotation);\n    const s = Math.sin(rotation);\n\n    for (const circle of circles) {\n      const x = circle.x;\n      const y = circle.y;\n      circle.x = c * x - s * y;\n      circle.y = s * x + c * y;\n    }\n  }\n\n  // mirror solution if third solution is above plane specified by\n  // first two circles\n  if (circles.length > 2) {\n    let angle = Math.atan2(circles[2].x, circles[2].y) - orientation;\n    while (angle < 0) {\n      angle += 2 * Math.PI;\n    }\n    while (angle > 2 * Math.PI) {\n      angle -= 2 * Math.PI;\n    }\n    if (angle > Math.PI) {\n      const slope = circles[1].y / (1e-10 + circles[1].x);\n      for (const circle of circles) {\n        var d = (circle.x + slope * circle.y) / (1 + slope * slope);\n        circle.x = 2 * d - circle.x;\n        circle.y = 2 * d * slope - circle.y;\n      }\n    }\n  }\n}\n\n/**\n *\n * @param {ReadonlyArray<{x: number, y: number, radius: number}>} circles\n * @returns {{x: number, y: number, radius: number}[][]}\n */\nfunction disjointCluster(circles) {\n  // union-find clustering to get disjoint sets\n  circles.forEach((circle) => {\n    circle.parent = circle;\n  });\n\n  // path compression step in union find\n  function find(circle) {\n    if (circle.parent !== circle) {\n      circle.parent = find(circle.parent);\n    }\n    return circle.parent;\n  }\n\n  function union(x, y) {\n    const xRoot = find(x);\n    const yRoot = find(y);\n    xRoot.parent = yRoot;\n  }\n\n  // get the union of all overlapping sets\n  for (let i = 0; i < circles.length; ++i) {\n    for (let j = i + 1; j < circles.length; ++j) {\n      const maxDistance = circles[i].radius + circles[j].radius;\n      if (distance(circles[i], circles[j]) + 1e-10 < maxDistance) {\n        union(circles[j], circles[i]);\n      }\n    }\n  }\n\n  // find all the disjoint clusters and group them together\n  /** @type {Map<string, {x: number, y: number, radius: number}[]>} */\n  const disjointClusters = new Map();\n  for (let i = 0; i < circles.length; ++i) {\n    const setid = find(circles[i]).parent.setid;\n    if (!disjointClusters.has(setid)) {\n      disjointClusters.set(setid, []);\n    }\n    disjointClusters.get(setid).push(circles[i]);\n  }\n\n  // cleanup bookkeeping\n  circles.forEach((circle) => {\n    delete circle.parent;\n  });\n\n  // return in more usable form\n  return Array.from(disjointClusters.values());\n}\n\n/**\n * @param {ReadonlyArray<{x :number, y: number, radius: number}>} circles\n * @returns {{xRange: [number, number], yRange: [number, number]}}\n */\nfunction getBoundingBox(circles) {\n  const minMax = (d) => {\n    const hi = circles.reduce((acc, c) => Math.max(acc, c[d] + c.radius), Number.NEGATIVE_INFINITY);\n    const lo = circles.reduce((acc, c) => Math.min(acc, c[d] - c.radius), Number.POSITIVE_INFINITY);\n    return { max: hi, min: lo };\n  };\n  return { xRange: minMax('x'), yRange: minMax('y') };\n}\n\n/**\n *\n * @param {{[setid: string]: {x: number, y: number, radius: number}}} solution\n * @param {undefined | number} orientation\n * @param {((a: {x :number, y: number, radius: number}, b: {x :number, y: number, radius: number}) => number) | undefined} orientationOrder\n * @returns {{[setid: string]: {x: number, y: number, radius: number}}}\n */\nfunction normalizeSolution(solution, orientation, orientationOrder) {\n  if (orientation == null) {\n    orientation = Math.PI / 2;\n  }\n\n  // work with a list instead of a dictionary, and take a copy so we\n  // don't mutate input\n  let circles = fromObjectNotation(solution).map((d) => Object.assign({}, d));\n\n  // get all the disjoint clusters\n  const clusters = disjointCluster(circles);\n\n  // orientate all disjoint sets, get sizes\n  for (const cluster of clusters) {\n    orientateCircles(cluster, orientation, orientationOrder);\n    const bounds = getBoundingBox(cluster);\n    cluster.size = (bounds.xRange.max - bounds.xRange.min) * (bounds.yRange.max - bounds.yRange.min);\n    cluster.bounds = bounds;\n  }\n  clusters.sort((a, b) => b.size - a.size);\n\n  // orientate the largest at 0,0, and get the bounds\n  circles = clusters[0];\n  let returnBounds = circles.bounds;\n  const spacing = (returnBounds.xRange.max - returnBounds.xRange.min) / 50;\n\n  /**\n   * @param {ReadonlyArray<{x: number, y: number, radius: number, setid: string}>} cluster\n   * @param {boolean} right\n   * @param {boolean} bottom\n   */\n  function addCluster(cluster, right, bottom) {\n    if (!cluster) {\n      return;\n    }\n\n    const bounds = cluster.bounds;\n    /** @type {number} */\n    let xOffset;\n    /** @type {number} */\n    let yOffset;\n\n    if (right) {\n      xOffset = returnBounds.xRange.max - bounds.xRange.min + spacing;\n    } else {\n      xOffset = returnBounds.xRange.max - bounds.xRange.max;\n      const centreing =\n        (bounds.xRange.max - bounds.xRange.min) / 2 - (returnBounds.xRange.max - returnBounds.xRange.min) / 2;\n      if (centreing < 0) {\n        xOffset += centreing;\n      }\n    }\n\n    if (bottom) {\n      yOffset = returnBounds.yRange.max - bounds.yRange.min + spacing;\n    } else {\n      yOffset = returnBounds.yRange.max - bounds.yRange.max;\n      const centreing =\n        (bounds.yRange.max - bounds.yRange.min) / 2 - (returnBounds.yRange.max - returnBounds.yRange.min) / 2;\n      if (centreing < 0) {\n        yOffset += centreing;\n      }\n    }\n\n    for (const c of cluster) {\n      c.x += xOffset;\n      c.y += yOffset;\n      circles.push(c);\n    }\n  }\n\n  let index = 1;\n  while (index < clusters.length) {\n    addCluster(clusters[index], true, false);\n    addCluster(clusters[index + 1], false, true);\n    addCluster(clusters[index + 2], true, true);\n    index += 3;\n\n    // have one cluster (in top left). lay out next three relative\n    // to it in a grid\n    returnBounds = getBoundingBox(circles);\n  }\n\n  // convert back to solution form\n  return toObjectNotation(circles);\n}\n\n/**\n * Scales a solution from venn.venn or venn.greedyLayout such that it fits in\n * a rectangle of width/height - with padding around the borders. also\n * centers the diagram in the available space at the same time.\n * If the scale parameter is not null, this automatic scaling is ignored in favor of this custom one\n * @param {{[setid: string]: {x: number, y: number, radius: number}}} solution\n * @param {number} width\n * @param {number} height\n * @param {number} padding\n * @param {boolean} scaleToFit\n * @returns {{[setid: string]: {x: number, y: number, radius: number}}}\n */\nfunction scaleSolution(solution, width, height, padding, scaleToFit) {\n  const circles = fromObjectNotation(solution);\n\n  width -= 2 * padding;\n  height -= 2 * padding;\n\n  const { xRange, yRange } = getBoundingBox(circles);\n\n  if (xRange.max === xRange.min || yRange.max === yRange.min) {\n    console.log('not scaling solution: zero size detected');\n    return solution;\n  }\n\n  /** @type {number} */\n  let xScaling;\n  /** @type {number} */\n  let yScaling;\n  if (scaleToFit) {\n    const toScaleDiameter = Math.sqrt(scaleToFit / Math.PI) * 2;\n    xScaling = width / toScaleDiameter;\n    yScaling = height / toScaleDiameter;\n  } else {\n    xScaling = width / (xRange.max - xRange.min);\n    yScaling = height / (yRange.max - yRange.min);\n  }\n\n  const scaling = Math.min(yScaling, xScaling);\n  // while we're at it, center the diagram too\n  const xOffset = (width - (xRange.max - xRange.min) * scaling) / 2;\n  const yOffset = (height - (yRange.max - yRange.min) * scaling) / 2;\n\n  return toObjectNotation(\n    circles.map((circle) => ({\n      radius: scaling * circle.radius,\n      x: padding + xOffset + (circle.x - xRange.min) * scaling,\n      y: padding + yOffset + (circle.y - yRange.min) * scaling,\n      setid: circle.setid,\n    }))\n  );\n}\n\n/**\n * @param {readonly {x: number, y: number, radius: number, setid: string}[]} circles\n * @returns {{[setid: string]: {x: number, y: number, radius: number, setid: string}}}\n */\nfunction toObjectNotation(circles) {\n  /** @type {{[setid: string]: {x: number, y: number, radius: number, setid: string}}} */\n  const r = {};\n  for (const circle of circles) {\n    r[circle.setid] = circle;\n  }\n  return r;\n}\n/**\n * @param {{[setid: string]: {x: number, y: number, radius: number}}} solution\n * @returns {{x: number, y: number, radius: number, setid: string}[]}}\n */\nfunction fromObjectNotation(solution) {\n  const setids = Object.keys(solution);\n  return setids.map((id) => Object.assign(solution[id], { setid: id }));\n}\n\n/**\n * VennDiagram includes an optional `options` parameter containing the following option(s):\n *\n * `colourScheme: Array<String>`\n * A list of color values to be applied when coloring diagram circles.\n *\n * `symmetricalTextCentre: Boolean`\n * Whether to symmetrically center each circle's text horizontally and vertically.\n * Defaults to `false`.\n *\n * `textFill: String`\n * The color to be applied to the text within each circle.\n *\n * @param {object} options\n */\nfunction VennDiagram(options = {}) {\n  let useViewBox = false,\n    width = 600,\n    height = 350,\n    padding = 15,\n    duration = 1000,\n    orientation = Math.PI / 2,\n    normalize = true,\n    scaleToFit = null,\n    wrap = true,\n    styled = true,\n    fontSize = null,\n    orientationOrder = null,\n    distinct = false,\n    round = null,\n    symmetricalTextCentre = options && options.symmetricalTextCentre ? options.symmetricalTextCentre : false,\n    // mimic the behaviour of d3.scale.category10 from the previous\n    // version of d3\n    colourMap = {},\n    // so this is the same as d3.schemeCategory10, which is only defined in d3 4.0\n    // since we can support older versions of d3 as long as we don't force this,\n    // I'm hackily redefining below. TODO: remove this and change to d3.schemeCategory10\n    colourScheme =\n      options && options.colourScheme\n        ? options.colourScheme\n        : options && options.colorScheme\n          ? options.colorScheme\n          : [\n              '#1f77b4',\n              '#ff7f0e',\n              '#2ca02c',\n              '#d62728',\n              '#9467bd',\n              '#8c564b',\n              '#e377c2',\n              '#7f7f7f',\n              '#bcbd22',\n              '#17becf',\n            ],\n    colourIndex = 0,\n    colours = function (key) {\n      if (key in colourMap) {\n        return colourMap[key];\n      }\n      var ret = (colourMap[key] = colourScheme[colourIndex]);\n      colourIndex += 1;\n      if (colourIndex >= colourScheme.length) {\n        colourIndex = 0;\n      }\n      return ret;\n    },\n    layoutFunction = venn,\n    loss = lossFunction;\n\n  function chart(selection) {\n    let data = selection.datum();\n\n    // handle 0-sized sets by removing from input\n    const toRemove = new Set();\n    data.forEach((datum) => {\n      if (datum.size == 0 && datum.sets.length == 1) {\n        toRemove.add(datum.sets[0]);\n      }\n    });\n    data = data.filter((datum) => !datum.sets.some((set) => toRemove.has(set)));\n\n    let circles = {};\n    let textCentres = {};\n\n    if (data.length > 0) {\n      let solution = layoutFunction(data, { lossFunction: loss, distinct });\n\n      if (normalize) {\n        solution = normalizeSolution(solution, orientation, orientationOrder);\n      }\n\n      circles = scaleSolution(solution, width, height, padding, scaleToFit);\n      textCentres = computeTextCentres(circles, data, symmetricalTextCentre);\n    }\n\n    // Figure out the current label for each set. These can change\n    // and D3 won't necessarily update (fixes https://github.com/benfred/venn.js/issues/103)\n    const labels = {};\n    data.forEach((datum) => {\n      if (datum.label) {\n        labels[datum.sets] = datum.label;\n      }\n    });\n\n    function label(d) {\n      if (d.sets in labels) {\n        return labels[d.sets];\n      }\n      if (d.sets.length == 1) {\n        return '' + d.sets[0];\n      }\n    }\n\n    // create svg if not already existing\n    selection.selectAll('svg').data([circles]).enter().append('svg');\n\n    const svg = selection.select('svg');\n\n    if (useViewBox) {\n      svg.attr('viewBox', `0 0 ${width} ${height}`);\n    } else {\n      svg.attr('width', width).attr('height', height);\n    }\n\n    // to properly transition intersection areas, we need the\n    // previous circles locations. load from elements\n    const previous = {};\n    let hasPrevious = false;\n    svg.selectAll('.venn-area path').each(function (d) {\n      const path = this.getAttribute('d');\n      if (d.sets.length == 1 && path && !distinct) {\n        hasPrevious = true;\n        previous[d.sets[0]] = circleFromPath(path);\n      }\n    });\n    // interpolate intersection area paths between previous and\n    // current paths\n    function pathTween(d) {\n      return (t) => {\n        const c = d.sets.map((set) => {\n          let start = previous[set];\n          let end = circles[set];\n          if (!start) {\n            start = { x: width / 2, y: height / 2, radius: 1 };\n          }\n          if (!end) {\n            end = { x: width / 2, y: height / 2, radius: 1 };\n          }\n          return {\n            x: start.x * (1 - t) + end.x * t,\n            y: start.y * (1 - t) + end.y * t,\n            radius: start.radius * (1 - t) + end.radius * t,\n          };\n        });\n        return intersectionAreaPath(c, round);\n      };\n    }\n\n    // update data, joining on the set ids\n    const nodes = svg.selectAll('.venn-area').data(data, (d) => d.sets);\n\n    // create new nodes\n    const enter = nodes\n      .enter()\n      .append('g')\n      .attr(\n        'class',\n        (d) =>\n          `venn-area venn-${d.sets.length == 1 ? 'circle' : 'intersection'}${\n            d.colour || d.color ? ' venn-coloured' : ''\n          }`\n      )\n      .attr('data-venn-sets', (d) => d.sets.join('_'));\n\n    const enterPath = enter.append('path');\n    const enterText = enter\n      .append('text')\n      .attr('class', 'label')\n      .text((d) => label(d))\n      .attr('text-anchor', 'middle')\n      .attr('dy', '.35em')\n      .attr('x', width / 2)\n      .attr('y', height / 2);\n\n    // apply minimal style if wanted\n    if (styled) {\n      enterPath\n        .style('fill-opacity', '0')\n        .filter((d) => d.sets.length == 1)\n        .style('fill', (d) => (d.colour ? d.colour : d.color ? d.color : colours(d.sets)))\n        .style('fill-opacity', '.25');\n\n      enterText.style('fill', (d) => {\n        if (d.colour || d.color) {\n          return '#FFF';\n        }\n        if (options.textFill) {\n          return options.textFill;\n        }\n        return d.sets.length == 1 ? colours(d.sets) : '#444';\n      });\n    }\n\n    function asTransition(s) {\n      if (typeof s.transition === 'function') {\n        return s.transition('venn').duration(duration);\n      }\n      return s;\n    }\n\n    // update existing, using pathTween if necessary\n    let update = selection;\n    if (hasPrevious && typeof update.transition === 'function') {\n      update = asTransition(selection);\n      update.selectAll('path').attrTween('d', pathTween);\n    } else {\n      update.selectAll('path').attr('d', (d) => intersectionAreaPath(d.sets.map((set) => circles[set])), round);\n    }\n\n    const updateText = update\n      .selectAll('text')\n      .filter((d) => d.sets in textCentres)\n      .text((d) => label(d))\n      .attr('x', (d) => Math.floor(textCentres[d.sets].x))\n      .attr('y', (d) => Math.floor(textCentres[d.sets].y));\n\n    if (wrap) {\n      if (hasPrevious) {\n        // d3 4.0 uses 'on' for events on transitions,\n        // but d3 3.0 used 'each' instead. switch appropriately\n        if ('on' in updateText) {\n          updateText.on('end', wrapText(circles, label));\n        } else {\n          updateText.each('end', wrapText(circles, label));\n        }\n      } else {\n        updateText.each(wrapText(circles, label));\n      }\n    }\n\n    // remove old\n    const exit = asTransition(nodes.exit()).remove();\n    if (typeof nodes.transition === 'function') {\n      exit.selectAll('path').attrTween('d', pathTween);\n    }\n\n    const exitText = exit\n      .selectAll('text')\n      .attr('x', width / 2)\n      .attr('y', height / 2);\n\n    // if we've been passed a fontSize explicitly, use it to\n    // transition\n    if (fontSize !== null) {\n      enterText.style('font-size', '0px');\n      updateText.style('font-size', fontSize);\n      exitText.style('font-size', '0px');\n    }\n\n    return { circles, textCentres, nodes, enter, update, exit };\n  }\n\n  chart.wrap = function (_) {\n    if (!arguments.length) return wrap;\n    wrap = _;\n    return chart;\n  };\n\n  chart.useViewBox = function () {\n    useViewBox = true;\n    return chart;\n  };\n\n  chart.width = function (_) {\n    if (!arguments.length) return width;\n    width = _;\n    return chart;\n  };\n\n  chart.height = function (_) {\n    if (!arguments.length) return height;\n    height = _;\n    return chart;\n  };\n\n  chart.padding = function (_) {\n    if (!arguments.length) return padding;\n    padding = _;\n    return chart;\n  };\n\n  chart.distinct = function (_) {\n    if (!arguments.length) return distinct;\n    distinct = _;\n    return chart;\n  };\n\n  chart.colours = function (_) {\n    if (!arguments.length) return colours;\n    colours = _;\n    return chart;\n  };\n\n  chart.colors = function (_) {\n    if (!arguments.length) return colours;\n    colours = _;\n    return chart;\n  };\n\n  chart.fontSize = function (_) {\n    if (!arguments.length) return fontSize;\n    fontSize = _;\n    return chart;\n  };\n\n  chart.round = function (_) {\n    if (!arguments.length) return round;\n    round = _;\n    return chart;\n  };\n\n  chart.duration = function (_) {\n    if (!arguments.length) return duration;\n    duration = _;\n    return chart;\n  };\n\n  chart.layoutFunction = function (_) {\n    if (!arguments.length) return layoutFunction;\n    layoutFunction = _;\n    return chart;\n  };\n\n  chart.normalize = function (_) {\n    if (!arguments.length) return normalize;\n    normalize = _;\n    return chart;\n  };\n\n  chart.scaleToFit = function (_) {\n    if (!arguments.length) return scaleToFit;\n    scaleToFit = _;\n    return chart;\n  };\n\n  chart.styled = function (_) {\n    if (!arguments.length) return styled;\n    styled = _;\n    return chart;\n  };\n\n  chart.orientation = function (_) {\n    if (!arguments.length) return orientation;\n    orientation = _;\n    return chart;\n  };\n\n  chart.orientationOrder = function (_) {\n    if (!arguments.length) return orientationOrder;\n    orientationOrder = _;\n    return chart;\n  };\n\n  chart.lossFunction = function (_) {\n    if (!arguments.length) return loss;\n    loss = _ === 'default' ? lossFunction : _ === 'logRatio' ? logRatioLossFunction : _;\n    return chart;\n  };\n\n  return chart;\n}\n\n// sometimes text doesn't fit inside the circle, if thats the case lets wrap\n// the text here such that it fits\n// todo: looks like this might be merged into d3 (\n// https://github.com/mbostock/d3/issues/1642),\n// also worth checking out is\n// http://engineering.findthebest.com/wrapping-axis-labels-in-d3-js/\n// this seems to be one of those things that should be easy but isn't\nfunction wrapText(circles, labeller) {\n  return function (data) {\n    const text = this;\n    const width = circles[data.sets[0]].radius || 50;\n    const label = labeller(data) || '';\n\n    const words = label.split(/\\s+/).reverse();\n    const maxLines = 3;\n    const minChars = (label.length + words.length) / maxLines;\n\n    let word = words.pop();\n    let line = [word];\n    let lineNumber = 0;\n    const lineHeight = 1.1; // ems\n    text.textContent = null; // clear\n    const tspans = [];\n\n    function append(word) {\n      const tspan = text.ownerDocument.createElementNS(text.namespaceURI, 'tspan');\n      tspan.textContent = word;\n      tspans.push(tspan);\n      text.append(tspan);\n      return tspan;\n    }\n    let tspan = append(word);\n\n    while (true) {\n      word = words.pop();\n      if (!word) {\n        break;\n      }\n      line.push(word);\n      const joined = line.join(' ');\n      tspan.textContent = joined;\n      if (joined.length > minChars && tspan.getComputedTextLength() > width) {\n        line.pop();\n        tspan.textContent = line.join(' ');\n        line = [word];\n        tspan = append(word);\n        lineNumber++;\n      }\n    }\n\n    const initial = 0.35 - (lineNumber * lineHeight) / 2;\n    const x = text.getAttribute('x');\n    const y = text.getAttribute('y');\n    tspans.forEach((t, i) => {\n      t.setAttribute('x', x);\n      t.setAttribute('y', y);\n      t.setAttribute('dy', `${initial + i * lineHeight}em`);\n    });\n  };\n}\n\n/**\n *\n * @param {{x: number, y: number}} current\n * @param {ReadonlyArray<{x: number, y: number}>} interior\n * @param {ReadonlyArray<{x: number, y: number}>} exterior\n * @returns {number}\n */\nfunction circleMargin(current, interior, exterior) {\n  let margin = interior[0].radius - distance(interior[0], current);\n\n  for (let i = 1; i < interior.length; ++i) {\n    const m = interior[i].radius - distance(interior[i], current);\n    if (m <= margin) {\n      margin = m;\n    }\n  }\n\n  for (let i = 0; i < exterior.length; ++i) {\n    const m = distance(exterior[i], current) - exterior[i].radius;\n    if (m <= margin) {\n      margin = m;\n    }\n  }\n  return margin;\n}\n\n/**\n * compute the center of some circles by maximizing the margin of\n * the center point relative to the circles (interior) after subtracting\n * nearby circles (exterior)\n * @param {readonly {x: number, y: number, radius: number}[]} interior\n * @param {readonly {x: number, y: number, radius: number}[]} exterior\n * @param {boolean} symmetricalTextCentre\n * @returns {{x:number, y: number}}\n */\nfunction computeTextCentre(interior, exterior, symmetricalTextCentre) {\n  // get an initial estimate by sampling around the interior circles\n  // and taking the point with the biggest margin\n  /** @type {{x: number, y: number}[]} */\n  const points = [];\n  for (const c of interior) {\n    points.push({ x: c.x, y: c.y });\n    points.push({ x: c.x + c.radius / 2, y: c.y });\n    points.push({ x: c.x - c.radius / 2, y: c.y });\n    points.push({ x: c.x, y: c.y + c.radius / 2 });\n    points.push({ x: c.x, y: c.y - c.radius / 2 });\n  }\n\n  let initial = points[0];\n  let margin = circleMargin(points[0], interior, exterior);\n\n  for (let i = 1; i < points.length; ++i) {\n    const m = circleMargin(points[i], interior, exterior);\n    if (m >= margin) {\n      initial = points[i];\n      margin = m;\n    }\n  }\n\n  // maximize the margin numerically\n  const solution = nelderMead(\n    (p) => -1 * circleMargin({ x: p[0], y: p[1] }, interior, exterior),\n    [initial.x, initial.y],\n    { maxIterations: 500, minErrorDelta: 1e-10 }\n  ).x;\n\n  const ret = { x: symmetricalTextCentre ? 0 : solution[0], y: solution[1] };\n\n  // check solution, fallback as needed (happens if fully overlapped\n  // etc)\n  let valid = true;\n  for (const i of interior) {\n    if (distance(ret, i) > i.radius) {\n      valid = false;\n      break;\n    }\n  }\n\n  for (const e of exterior) {\n    if (distance(ret, e) < e.radius) {\n      valid = false;\n      break;\n    }\n  }\n  if (valid) {\n    return ret;\n  }\n\n  if (interior.length == 1) {\n    return { x: interior[0].x, y: interior[0].y };\n  }\n  const areaStats = {};\n  intersectionArea(interior, areaStats);\n\n  if (areaStats.arcs.length === 0) {\n    return { x: 0, y: -1000, disjoint: true };\n  }\n  if (areaStats.arcs.length == 1) {\n    return { x: areaStats.arcs[0].circle.x, y: areaStats.arcs[0].circle.y };\n  }\n  if (exterior.length) {\n    // try again without other circles\n    return computeTextCentre(interior, []);\n  }\n  // take average of all the points in the intersection\n  // polygon. this should basically never happen\n  // and has some issues:\n  // https://github.com/benfred/venn.js/issues/48#issuecomment-146069777\n  return getCenter(areaStats.arcs.map((a) => a.p1));\n}\n\n// given a dictionary of {setid : circle}, returns\n// a dictionary of setid to list of circles that completely overlap it\nfunction getOverlappingCircles(circles) {\n  const ret = {};\n  const circleids = Object.keys(circles);\n  for (const circleid of circleids) {\n    ret[circleid] = [];\n  }\n  for (let i = 0; i < circleids.length; i++) {\n    const ci = circleids[i];\n    const a = circles[ci];\n    for (let j = i + 1; j < circleids.length; ++j) {\n      const cj = circleids[j];\n      const b = circles[cj];\n      const d = distance(a, b);\n\n      if (d + b.radius <= a.radius + 1e-10) {\n        ret[cj].push(ci);\n      } else if (d + a.radius <= b.radius + 1e-10) {\n        ret[ci].push(cj);\n      }\n    }\n  }\n  return ret;\n}\n\nfunction computeTextCentres(circles, areas, symmetricalTextCentre) {\n  const ret = {};\n  const overlapped = getOverlappingCircles(circles);\n  for (let i = 0; i < areas.length; ++i) {\n    const area = areas[i].sets;\n    const areaids = {};\n    const exclude = {};\n\n    for (let j = 0; j < area.length; ++j) {\n      areaids[area[j]] = true;\n      const overlaps = overlapped[area[j]];\n      // keep track of any circles that overlap this area,\n      // and don't consider for purposes of computing the text\n      // centre\n      for (let k = 0; k < overlaps.length; ++k) {\n        exclude[overlaps[k]] = true;\n      }\n    }\n\n    const interior = [];\n    const exterior = [];\n    for (let setid in circles) {\n      if (setid in areaids) {\n        interior.push(circles[setid]);\n      } else if (!(setid in exclude)) {\n        exterior.push(circles[setid]);\n      }\n    }\n    const centre = computeTextCentre(interior, exterior, symmetricalTextCentre);\n    ret[area] = centre;\n    if (centre.disjoint && areas[i].size > 0) {\n      console.log('WARNING: area ' + area + ' not represented on screen');\n    }\n  }\n  return ret;\n}\n\n// sorts all areas in the venn diagram, so that\n// a particular area is on top (relativeTo) - and\n// all other areas are so that the smallest areas are on top\nfunction sortAreas(div, relativeTo) {\n  // figure out sets that are completely overlapped by relativeTo\n  const overlaps = getOverlappingCircles(div.selectAll('svg').datum());\n  const exclude = new Set();\n  for (const check of relativeTo.sets) {\n    for (let setid in overlaps) {\n      const overlap = overlaps[setid];\n      for (let j = 0; j < overlap.length; ++j) {\n        if (overlap[j] == check) {\n          exclude.add(setid);\n          break;\n        }\n      }\n    }\n  }\n\n  // checks that all sets are in exclude;\n  function shouldExclude(sets) {\n    return sets.every((set) => !exclude.has(set));\n  }\n\n  // need to sort div's so that Z order is correct\n  div.selectAll('g').sort((a, b) => {\n    // highest order set intersections first\n    if (a.sets.length != b.sets.length) {\n      return a.sets.length - b.sets.length;\n    }\n\n    if (a == relativeTo) {\n      return shouldExclude(b.sets) ? -1 : 1;\n    }\n    if (b == relativeTo) {\n      return shouldExclude(a.sets) ? 1 : -1;\n    }\n\n    // finally by size\n    return b.size - a.size;\n  });\n}\n\n/**\n * @param {number} x\n * @param {number} y\n * @param {number} r\n * @returns {string}\n */\nfunction circlePath(x, y, r) {\n  const ret = [];\n  ret.push('\\nM', x, y);\n  ret.push('\\nm', -r, 0);\n  ret.push('\\na', r, r, 0, 1, 0, r * 2, 0);\n  ret.push('\\na', r, r, 0, 1, 0, -r * 2, 0);\n  return ret.join(' ');\n}\n\n/**\n * inverse of the circlePath function, returns a circle object from an svg path\n * @param {string} path\n * @returns {{x: number, y: number, radius: number}}\n */\nfunction circleFromPath(path) {\n  const tokens = path.split(' ');\n  return { x: Number.parseFloat(tokens[1]), y: Number.parseFloat(tokens[2]), radius: -Number.parseFloat(tokens[4]) };\n}\n\nfunction intersectionAreaArcs(circles) {\n  if (circles.length === 0) {\n    return [];\n  }\n  const stats = {};\n  intersectionArea(circles, stats);\n  return stats.arcs;\n}\n\nfunction arcsToPath(arcs, round) {\n  if (arcs.length === 0) {\n    return 'M 0 0';\n  }\n  const rFactor = Math.pow(10, round || 0);\n  const r = round != null ? (v) => Math.round(v * rFactor) / rFactor : (v) => v;\n  if (arcs.length == 1) {\n    const circle = arcs[0].circle;\n    return circlePath(r(circle.x), r(circle.y), r(circle.radius));\n  }\n  // draw path around arcs\n  const ret = ['\\nM', r(arcs[0].p2.x), r(arcs[0].p2.y)];\n  for (const arc of arcs) {\n    const radius = r(arc.circle.radius);\n    ret.push('\\nA', radius, radius, 0, arc.large ? 1 : 0, arc.sweep ? 1 : 0, r(arc.p1.x), r(arc.p1.y));\n  }\n  return ret.join(' ');\n}\n\n/**\n * returns a svg path of the intersection area of a bunch of circles\n * @param {ReadonlyArray<{x: number, y: number, radius: number}>} circles\n * @returns {string}\n */\nfunction intersectionAreaPath(circles, round) {\n  return arcsToPath(intersectionAreaArcs(circles), round);\n}\n\nfunction layout(data, options = {}) {\n  const {\n    lossFunction: loss,\n    layoutFunction: layout = venn,\n    normalize = true,\n    orientation = Math.PI / 2,\n    orientationOrder,\n    width = 600,\n    height = 350,\n    padding = 15,\n    scaleToFit = false,\n    symmetricalTextCentre = false,\n    distinct,\n    round = 2,\n  } = options;\n\n  let solution = layout(data, {\n    lossFunction: loss === 'default' || !loss ? lossFunction : loss === 'logRatio' ? logRatioLossFunction : loss,\n    distinct,\n  });\n\n  if (normalize) {\n    solution = normalizeSolution(solution, orientation, orientationOrder);\n  }\n\n  const circles = scaleSolution(solution, width, height, padding, scaleToFit);\n  const textCentres = computeTextCentres(circles, data, symmetricalTextCentre);\n\n  const circleLookup = new Map(\n    Object.keys(circles).map((set) => [\n      set,\n      {\n        set,\n        x: circles[set].x,\n        y: circles[set].y,\n        radius: circles[set].radius,\n      },\n    ])\n  );\n  const helpers = data.map((area) => {\n    const circles = area.sets.map((s) => circleLookup.get(s));\n    const arcs = intersectionAreaArcs(circles);\n    const path = arcsToPath(arcs, round);\n    return { circles, arcs, path, area, has: new Set(area.sets) };\n  });\n\n  function genDistinctPath(sets) {\n    let r = '';\n    for (const e of helpers) {\n      if (e.has.size > sets.length && sets.every((s) => e.has.has(s))) {\n        r += ' ' + e.path;\n      }\n    }\n    return r;\n  }\n\n  return helpers.map(({ circles, arcs, path, area }) => {\n    return {\n      data: area,\n      text: textCentres[area.sets],\n      circles,\n      arcs,\n      path,\n      distinctPath: path + genDistinctPath(area.sets),\n    };\n  });\n}\n\nexport { VennDiagram, bestInitialLayout, circleArea, circleCircleIntersection, circleFromPath, circleOverlap, circlePath, computeTextCentre, computeTextCentres, disjointCluster, distance, distanceFromIntersectArea, greedyLayout, intersectionArea, intersectionAreaPath, layout, logRatioLossFunction, lossFunction, normalizeSolution, scaleSolution, sortAreas, venn, wrapText };\n", "import type { Diagram } from '../../Diagram.js';\nimport type { VennData, VennDB, VennTextData, VennStyleData } from './vennTypes.js';\nimport type { DiagramRenderer, DrawDefinition } from '../../diagram-api/types.js';\nimport type { VennDiagramConfig } from '../../config.type.js';\nimport type { Selection } from 'd3';\nimport { select as d3select } from 'd3';\n// @ts-expect-error Incorrect khroma types\nimport { isDark, lighten, darken, transparentize } from 'khroma';\nimport { getConfig } from '../../config.js';\nimport { selectSvgElement } from '../../rendering-util/selectSvgElement.js';\nimport * as venn from '@upsetjs/venn.js';\nimport { configureSvgSize } from '../../setupGraphViewbox.js';\nimport rough from 'roughjs';\n\ntype DummyD3Root = Selection<HTMLDivElement, unknown, null, undefined>;\n\nfunction buildStyleByKey(styleData: VennStyleData[]): Map<string, Record<string, string>> {\n  const map = new Map<string, Record<string, string>>();\n  for (const entry of styleData) {\n    const key = entry.targets.join('|');\n    const existing = map.get(key);\n    if (existing) {\n      Object.assign(existing, entry.styles);\n    } else {\n      map.set(key, { ...entry.styles });\n    }\n  }\n  return map;\n}\n\nexport const draw: DrawDefinition = (\n  _text: string,\n  id: string,\n  _version: string,\n  diagObj: Diagram\n): void => {\n  const db = diagObj.db as VennDB;\n  const config = db.getConfig?.();\n  const { themeVariables, look, handDrawnSeed } = getConfig();\n  const isHandDrawn = look === 'handDrawn';\n  const themeColors: string[] = [\n    themeVariables.venn1,\n    themeVariables.venn2,\n    themeVariables.venn3,\n    themeVariables.venn4,\n    themeVariables.venn5,\n    themeVariables.venn6,\n    themeVariables.venn7,\n    themeVariables.venn8,\n  ].filter(Boolean);\n  const title = db.getDiagramTitle?.();\n  const sets = db.getSubsetData();\n  const textNodes = db.getTextData();\n  const styleByKey = buildStyleByKey(db.getStyleData());\n\n  // Configurable viewBox size with scale factor for proportional rendering\n  const svgWidth = config?.width ?? 800;\n  const svgHeight = config?.height ?? 450;\n  const REFERENCE_WIDTH = 1600;\n  const scale = svgWidth / REFERENCE_WIDTH;\n  const titleHeight = title ? 48 * scale : 0;\n\n  const defaultTextColor = themeVariables.primaryTextColor ?? themeVariables.textColor;\n\n  // Prepare the target viewBox\n  const svg = selectSvgElement(id);\n  svg.attr('viewBox', `0 0 ${svgWidth} ${svgHeight}`);\n\n  if (title) {\n    svg\n      .append('text')\n      .text(title)\n      .attr('class', 'venn-title')\n      .attr('font-size', `${32 * scale}px`)\n      .attr('text-anchor', 'middle')\n      .attr('dominant-baseline', 'middle')\n      .attr('x', '50%')\n      .attr('y', 32 * scale)\n      .style('fill', themeVariables.vennTitleTextColor || themeVariables.titleColor);\n  }\n\n  // Get the original SVG output of Venn.js from a dummy root\n  const dummyD3root: DummyD3Root = d3select(document.createElement('div'));\n  const vennDiagram = venn\n    .VennDiagram()\n    .width(svgWidth)\n    .height(svgHeight - titleHeight);\n  dummyD3root.datum(sets).call(vennDiagram as never);\n\n  const roughSvg = isHandDrawn\n    ? rough.svg(dummyD3root.select('svg').node() as SVGSVGElement)\n    : undefined;\n\n  // Compute layout areas so we can position additional text nodes\n  const layoutAreas = venn.layout(sets, {\n    width: svgWidth,\n    height: svgHeight - titleHeight,\n    padding: config?.padding ?? 15,\n  });\n\n  // Build a lookup table from set key to layout area\n  const layoutByKey = new Map<string, (typeof layoutAreas)[number]>();\n  for (const area of layoutAreas) {\n    const key = stableSetsKey([...area.data.sets].sort());\n    layoutByKey.set(key, area);\n  }\n\n  if (textNodes.length > 0) {\n    renderTextNodes(config, layoutByKey, dummyD3root, textNodes, scale, styleByKey);\n  }\n\n  // Style the set circles with theme colors\n  const themeDark = isDark(themeVariables.background || '#f4f4f4');\n  dummyD3root.selectAll('.venn-circle').each(function (d, i) {\n    const group = d3select(this as Element);\n    const data = d as VennData;\n    const setsKey = stableSetsKey([...data.sets].sort());\n    const customStyle = styleByKey.get(setsKey);\n    const baseColor =\n      customStyle?.fill || themeColors[i % themeColors.length] || themeVariables.primaryColor;\n    group.classed(`venn-set-${i % 8}`, true);\n    const fillOpacity = customStyle?.['fill-opacity'] ?? 0.1;\n    const strokeColor = customStyle?.stroke || baseColor;\n    const strokeWidthVal = customStyle?.['stroke-width'] || `${5 * scale}`;\n\n    if (isHandDrawn && roughSvg) {\n      const layoutArea = layoutByKey.get(setsKey);\n      if (layoutArea && layoutArea.circles.length > 0) {\n        const c = layoutArea.circles[0];\n        const roughNode = roughSvg.circle(c.x, c.y, c.radius * 2, {\n          roughness: 0.7,\n          seed: handDrawnSeed,\n          fill: transparentize(baseColor, 0.7),\n          fillStyle: 'hachure',\n          fillWeight: 2,\n          hachureGap: 8,\n          hachureAngle: -41 + i * 60,\n          stroke: strokeColor,\n          strokeWidth: parseFloat(String(strokeWidthVal)),\n        });\n        group.select('path').remove();\n        group.node()?.insertBefore(roughNode, group.select('text').node() as Node | null);\n      }\n    } else {\n      group\n        .select('path')\n        .style('fill', baseColor)\n        .style('fill-opacity', fillOpacity)\n        .style('stroke', strokeColor)\n        .style('stroke-width', strokeWidthVal)\n        .style('stroke-opacity', 0.95);\n    }\n    // Blend border color toward black (light theme) or white (dark theme) for readable text\n    const textColor: string =\n      customStyle?.color || (themeDark ? lighten(baseColor, 30) : darken(baseColor, 30));\n    group\n      .select('text')\n      .style('font-size', `${48 * scale}px`)\n      .style('fill', textColor);\n  });\n\n  // Style the union labels\n  if (isHandDrawn && roughSvg) {\n    dummyD3root.selectAll('.venn-intersection').each(function (d) {\n      const group = d3select(this as Element);\n      const data = d as VennData;\n      const setsKey = stableSetsKey([...data.sets].sort());\n      const customStyle = styleByKey.get(setsKey);\n      const customFill = customStyle?.fill;\n\n      if (customFill) {\n        const pathEl = group.select('path');\n        const pathD = pathEl.attr('d');\n        if (pathD) {\n          const roughNode = roughSvg.path(pathD, {\n            roughness: 0.7,\n            seed: handDrawnSeed,\n            fill: transparentize(customFill, 0.3),\n            fillStyle: 'cross-hatch',\n            fillWeight: 2,\n            hachureGap: 6,\n            hachureAngle: 60,\n            stroke: 'none',\n          });\n          const existingPath = pathEl.node() as Element | null;\n          existingPath?.parentNode?.insertBefore(roughNode, existingPath);\n          pathEl.remove();\n        }\n      } else {\n        group.select('path').style('fill-opacity', 0);\n      }\n\n      group\n        .select('text')\n        .style('font-size', `${48 * scale}px`)\n        .style('fill', customStyle?.color ?? themeVariables.vennSetTextColor ?? defaultTextColor);\n    });\n  } else {\n    dummyD3root\n      .selectAll('.venn-intersection text')\n      .style('font-size', `${48 * scale}px`)\n      .style('fill', (e) => {\n        const data = e as VennData;\n        const setsKey = stableSetsKey([...data.sets].sort());\n        return (\n          styleByKey.get(setsKey)?.color ?? themeVariables.vennSetTextColor ?? defaultTextColor\n        );\n      });\n    dummyD3root\n      .selectAll('.venn-intersection path')\n      .style('fill-opacity', (e) => {\n        const data = e as VennData;\n        const setsKey = stableSetsKey([...data.sets].sort());\n        return styleByKey.get(setsKey)?.fill ? 1 : 0;\n      })\n      .style('fill', (e) => {\n        const data = e as VennData;\n        const setsKey = stableSetsKey([...data.sets].sort());\n        return styleByKey.get(setsKey)?.fill ?? 'transparent';\n      });\n  }\n\n  // Transfer the dummy SVG contents into the real SVG group\n  const vennGroup = svg.append('g').attr('transform', `translate(0, ${titleHeight})`);\n  const dummySvg = dummyD3root.select('svg').node();\n  if (dummySvg && 'childNodes' in dummySvg) {\n    for (const child of [...dummySvg.childNodes]) {\n      vennGroup.node()?.appendChild(child);\n    }\n  }\n  configureSvgSize(svg, svgHeight, svgWidth, config?.useMaxWidth ?? true);\n};\n\nfunction stableSetsKey(setIds: string[]): string {\n  return setIds.join('|');\n}\n\nfunction renderTextNodes(\n  config: Required<VennDiagramConfig>,\n  layoutByKey: Map<string, venn.IVennLayout<VennData>>,\n  dummyD3root: DummyD3Root,\n  textNodes: VennTextData[],\n  scale: number,\n  styleByKey: Map<string, Record<string, string>>\n) {\n  const useDebugLayout = config?.useDebugLayout ?? false;\n  const vennSvg = dummyD3root.select('svg');\n  const textGroup = vennSvg.append('g').attr('class', 'venn-text-nodes');\n\n  // Group text nodes by the set key they belong to\n  const nodesByArea = new Map<string, VennTextData[]>();\n  for (const node of textNodes) {\n    const key = stableSetsKey(node.sets);\n    const existing = nodesByArea.get(key);\n    if (existing) {\n      existing.push(node);\n    } else {\n      nodesByArea.set(key, [node]);\n    }\n  }\n\n  // For each area, compute a text box and place nodes in a grid.\n  for (const [key, nodes] of nodesByArea.entries()) {\n    const area = layoutByKey.get(key);\n    if (!area?.text) {\n      continue;\n    }\n    // Calculate the center point and a safe inner radius for text.\n    const centerX = area.text.x;\n    const centerY = area.text.y;\n    const minCircleRadius = Math.min(...area.circles.map((c) => c.radius));\n    const innerRadiusRaw = Math.min(\n      ...area.circles.map((c) => c.radius - Math.hypot(centerX - c.x, centerY - c.y))\n    );\n    let innerRadius = Number.isFinite(innerRadiusRaw) ? Math.max(0, innerRadiusRaw) : 0;\n    if (innerRadius === 0 && Number.isFinite(minCircleRadius)) {\n      innerRadius = minCircleRadius * 0.6;\n    }\n\n    // Render text area container\n    const areaGroup = textGroup\n      .append('g')\n      .attr('class', 'venn-text-area')\n      .attr('font-size', `${40 * scale}px`);\n    if (useDebugLayout) {\n      areaGroup\n        .append('circle')\n        .attr('class', 'venn-text-debug-circle')\n        .attr('cx', centerX)\n        .attr('cy', centerY)\n        .attr('r', innerRadius)\n        .attr('fill', 'none')\n        .attr('stroke', 'purple')\n        .attr('stroke-width', 1.5 * scale)\n        .attr('stroke-dasharray', `${6 * scale} ${4 * scale}`);\n    }\n\n    // Compute a grid within the area for placing text nodes\n    const innerWidth = Math.max(80 * scale, innerRadius * 2 * 0.95);\n    const innerHeight = Math.max(60 * scale, innerRadius * 2 * 0.95);\n    const hasLabel = area.data.label && area.data.label.length > 0;\n    const labelOffsetBase = hasLabel ? Math.min(32 * scale, innerRadius * 0.25) : 0;\n    const labelOffset = labelOffsetBase + (nodes.length <= 2 ? 30 * scale : 0);\n    const startX = centerX - innerWidth / 2;\n    const startY = centerY - innerHeight / 2 + labelOffset;\n    const cols = Math.max(1, Math.ceil(Math.sqrt(nodes.length)));\n    const rows = Math.max(1, Math.ceil(nodes.length / cols));\n    const cellWidth = innerWidth / cols;\n    const cellHeight = innerHeight / rows;\n\n    // Place each node into a grid cell\n    for (const [i, node] of nodes.entries()) {\n      const col = i % cols;\n      const row = Math.floor(i / cols);\n      const x = startX + cellWidth * (col + 0.5);\n      const y = startY + cellHeight * (row + 0.5);\n\n      if (useDebugLayout) {\n        areaGroup\n          .append('rect')\n          .attr('class', 'venn-text-debug-cell')\n          .attr('x', startX + cellWidth * col)\n          .attr('y', startY + cellHeight * row)\n          .attr('width', cellWidth)\n          .attr('height', cellHeight)\n          .attr('fill', 'none')\n          .attr('stroke', 'teal')\n          .attr('stroke-width', 1 * scale)\n          .attr('stroke-dasharray', `${4 * scale} ${3 * scale}`);\n      }\n\n      const boxWidth = cellWidth * 0.9;\n      const boxHeight = cellHeight * 0.9;\n\n      // foreignObject lets us use HTML styling for auto-wrap\n      const container = areaGroup\n        .append('foreignObject')\n        .attr('class', 'venn-text-node-fo')\n        .attr('width', boxWidth)\n        .attr('height', boxHeight)\n        .attr('x', x - boxWidth / 2)\n        .attr('y', y - boxHeight / 2)\n        .attr('overflow', 'visible');\n\n      const textColor = styleByKey.get(node.id)?.color;\n      const text = container\n        .append('xhtml:span')\n        .attr('class', 'venn-text-node')\n        .style('display', 'flex')\n        .style('width', '100%')\n        .style('height', '100%')\n        .style('white-space', 'normal')\n        .style('align-items', 'center')\n        .style('justify-content', 'center')\n        .style('text-align', 'center')\n        .style('overflow-wrap', 'normal')\n        .style('word-break', 'normal')\n        .text(node.label ?? node.id);\n\n      if (textColor) {\n        text.style('color', textColor);\n      }\n    }\n  }\n}\n\nexport const renderer: DiagramRenderer = { draw };\n", "import type { DiagramDefinition } from '../../diagram-api/types.js';\n// @ts-ignore: jison doesn't export types\nimport parser from './parser/venn.jison';\nimport { db } from './vennDB.js';\nimport flowStyles from './styles.js';\nimport { renderer } from './vennRenderer.js';\n\nexport const diagram: DiagramDefinition = {\n  parser,\n  db,\n  renderer,\n  styles: flowStyles,\n};\n"],
  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyEA,IAAI,UAAU,WAAU;AACxB,MAAI,IAAE,gCAAS,GAAE,GAAEA,IAAE,GAAE;AAAC,SAAIA,KAAEA,MAAG,CAAC,GAAE,IAAE,EAAE,QAAO,KAAIA,GAAE,EAAE,CAAC,CAAC,IAAE,EAAE;AAAC,WAAOA;AAAA,EAAC,GAAhE,MAAkE,MAAI,CAAC,GAAE,CAAC,GAAE,MAAI,CAAC,GAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE,GAAE,MAAI,CAAC,GAAE,EAAE,GAAE,MAAI,CAAC,GAAE,EAAE,GAAE,MAAI,CAAC,GAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE,GAAE,MAAI,CAAC,GAAE,EAAE,GAAE,MAAI,CAAC,GAAE,EAAE,GAAE,MAAI,CAAC,GAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE,GAAE,MAAI,CAAC,GAAE,EAAE,GAAE,MAAI,CAAC,GAAE,EAAE,GAAE,MAAI,CAAC,GAAE,EAAE,GAAE,MAAI,CAAC,GAAE,EAAE,GAAE,MAAI,CAAC,GAAE,EAAE,GAAE,MAAI,CAAC,GAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE;AAC1U,MAAIC,UAAS;AAAA,IAAC,OAAO,gCAAS,QAAS;AAAA,IAAE,GAApB;AAAA,IACrB,IAAI,CAAC;AAAA,IACL,UAAU,EAAC,SAAQ,GAAE,SAAQ,GAAE,eAAc,GAAE,QAAO,GAAE,YAAW,GAAE,OAAM,GAAE,WAAU,GAAE,QAAO,GAAE,aAAY,IAAG,SAAQ,IAAG,OAAM,IAAG,cAAa,IAAG,iBAAgB,IAAG,SAAQ,IAAG,WAAU,IAAG,SAAQ,IAAG,kBAAiB,IAAG,QAAO,IAAG,cAAa,IAAG,UAAS,IAAG,eAAc,IAAG,oBAAmB,IAAG,SAAQ,IAAG,aAAY,IAAG,cAAa,IAAG,SAAQ,IAAG,cAAa,IAAG,eAAc,IAAG,cAAa,IAAG,YAAW,IAAG,YAAW,IAAG,aAAY,IAAG,WAAU,GAAE,QAAO,EAAC;AAAA,IACjd,YAAY,EAAC,GAAE,SAAQ,GAAE,QAAO,GAAE,OAAM,GAAE,WAAU,IAAG,SAAQ,IAAG,OAAM,IAAG,iBAAgB,IAAG,SAAQ,IAAG,WAAU,IAAG,SAAQ,IAAG,QAAO,IAAG,cAAa,IAAG,UAAS,IAAG,eAAc,IAAG,SAAQ,IAAG,SAAQ,IAAG,YAAW,IAAG,YAAW,IAAG,YAAW;AAAA,IACrP,cAAc,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,GAAE,CAAC,IAAG,CAAC,CAAC;AAAA,IAC7T,eAAe,gCAAS,UAAU,QAAQ,QAAQ,UAAU,IAAI,SAAyB,IAAiB,IAAiB;AAG3H,UAAI,KAAK,GAAG,SAAS;AACrB,cAAQ,SAAS;AAAA,QACjB,KAAK;AACJ,iBAAO,GAAG,KAAG,CAAC;AACf;AAAA,QACA,KAAK;AAAA,QAAG,KAAK;AAAA,QAAG,KAAK;AACpB,eAAK,IAAI,CAAC;AACX;AAAA,QACA,KAAK;AACJ,aAAG,KAAG,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;AAAG,eAAK,IAAI,GAAG,KAAG,CAAC;AACxC;AAAA,QACA,KAAK;AACJ,eAAK,IAAI,CAAC;AACX;AAAA,QACA,KAAK;AAAA,QAAG,KAAK;AAAA,QAAI,KAAK;AAAA,QAAI,KAAK;AAAA,QAAI,KAAK;AAAA,QAAI,KAAK;AAAA,QAAI,KAAK;AAAA,QAAI,KAAK;AAClE,eAAK,IAAI,GAAG,EAAE;AACf;AAAA,QACA,KAAK;AACJ,aAAG,gBAAgB,GAAG,EAAE,EAAE,OAAO,CAAC,CAAC;AAAG,eAAK,IAAI,GAAG,EAAE,EAAE,OAAO,CAAC;AAC/D;AAAA,QACA,KAAK;AACJ,aAAG,cAAc,CAAC,GAAG,EAAE,CAAC,GAAG,QAAW,MAAS;AAAG,cAAI,GAAG,eAAe;AAAE,eAAG,cAAc,IAAI;AAAA,UAAG;AACnG;AAAA,QACA,KAAK;AACJ,aAAG,cAAc,CAAC,GAAG,KAAG,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,MAAS;AAAG,cAAI,GAAG,eAAe;AAAE,eAAG,cAAc,IAAI;AAAA,UAAG;AAClG;AAAA,QACA,KAAK;AACJ,aAAG,cAAc,CAAC,GAAG,KAAG,CAAC,CAAC,GAAG,QAAW,WAAW,GAAG,EAAE,CAAC,CAAC;AAAG,cAAI,GAAG,eAAe;AAAE,eAAG,cAAc,IAAI;AAAA,UAAG;AAC9G;AAAA,QACA,KAAK;AACJ,aAAG,cAAc,CAAC,GAAG,KAAG,CAAC,CAAC,GAAG,GAAG,KAAG,CAAC,GAAG,WAAW,GAAG,EAAE,CAAC,CAAC;AAAG,cAAI,GAAG,eAAe;AAAE,eAAG,cAAc,IAAI;AAAA,UAAG;AAC7G;AAAA,QACA,KAAK;AACJ,cAAI,GAAG,EAAE,EAAE,SAAS,GAAG;AAAE,kBAAM,IAAI,MAAM,qCAAqC;AAAA,UAAG;AAAE,cAAI,GAAG,0BAA0B;AAAE,eAAG,yBAAyB,GAAG,EAAE,CAAC;AAAA,UAAG;AAAE,aAAG,cAAc,GAAG,EAAE,GAAG,QAAW,MAAS;AAAG,cAAI,GAAG,eAAe;AAAE,eAAG,cAAc,IAAI;AAAA,UAAG;AAC9P;AAAA,QACA,KAAK;AACJ,cAAI,GAAG,KAAG,CAAC,EAAE,SAAS,GAAG;AAAE,kBAAM,IAAI,MAAM,qCAAqC;AAAA,UAAG;AAAE,cAAI,GAAG,0BAA0B;AAAE,eAAG,yBAAyB,GAAG,KAAG,CAAC,CAAC;AAAA,UAAG;AAAE,aAAG,cAAc,GAAG,KAAG,CAAC,GAAG,GAAG,EAAE,GAAG,MAAS;AAAG,cAAI,GAAG,eAAe;AAAE,eAAG,cAAc,IAAI;AAAA,UAAG;AACjQ;AAAA,QACA,KAAK;AACJ,cAAI,GAAG,KAAG,CAAC,EAAE,SAAS,GAAG;AAAE,kBAAM,IAAI,MAAM,qCAAqC;AAAA,UAAG;AAAE,cAAI,GAAG,0BAA0B;AAAE,eAAG,yBAAyB,GAAG,KAAG,CAAC,CAAC;AAAA,UAAG;AAAE,aAAG,cAAc,GAAG,KAAG,CAAC,GAAG,QAAW,WAAW,GAAG,EAAE,CAAC,CAAC;AAAG,cAAI,GAAG,eAAe;AAAE,eAAG,cAAc,IAAI;AAAA,UAAG;AAC7Q;AAAA,QACA,KAAK;AACJ,cAAI,GAAG,KAAG,CAAC,EAAE,SAAS,GAAG;AAAE,kBAAM,IAAI,MAAM,qCAAqC;AAAA,UAAG;AAAE,cAAI,GAAG,0BAA0B;AAAE,eAAG,yBAAyB,GAAG,KAAG,CAAC,CAAC;AAAA,UAAG;AAAE,aAAG,cAAc,GAAG,KAAG,CAAC,GAAG,GAAG,KAAG,CAAC,GAAG,WAAW,GAAG,EAAE,CAAC,CAAC;AAAG,cAAI,GAAG,eAAe;AAAE,eAAG,cAAc,IAAI;AAAA,UAAG;AAC5Q;AAAA,QACA,KAAK;AAAA,QAAI,KAAK;AAAA,QAAI,KAAK;AACtB,aAAG,YAAY,GAAG,KAAG,CAAC,GAAG,GAAG,EAAE,GAAG,MAAS;AAC3C;AAAA,QACA,KAAK;AAAA,QAAI,KAAK;AACb,aAAG,YAAY,GAAG,KAAG,CAAC,GAAG,GAAG,KAAG,CAAC,GAAG,GAAG,EAAE,CAAC;AAC1C;AAAA,QACA,KAAK;AACJ,aAAG,aAAa,GAAG,KAAG,CAAC,GAAG,GAAG,EAAE,CAAC;AACjC;AAAA,QACA,KAAK;AAAA,QAAI,KAAK;AAAA,QAAI,KAAK;AACtB,cAAI,KAAK,GAAG,eAAe;AAAG,cAAI,CAAC,GAAI,OAAM,IAAI,MAAM,mBAAmB;AAAG,aAAG,YAAY,IAAI,GAAG,EAAE,GAAG,MAAS;AAClH;AAAA,QACA,KAAK;AAAA,QAAI,KAAK;AACb,cAAI,KAAK,GAAG,eAAe;AAAG,cAAI,CAAC,GAAI,OAAM,IAAI,MAAM,mBAAmB;AAAG,aAAG,YAAY,IAAI,GAAG,KAAG,CAAC,GAAG,GAAG,EAAE,CAAC;AACjH;AAAA,QACA,KAAK;AAAA,QAAI,KAAK;AACb,eAAK,IAAI,CAAC,GAAG,EAAE,CAAC;AACjB;AAAA,QACA,KAAK;AAAA,QAAI,KAAK;AACb,eAAK,IAAI,CAAC,GAAG,GAAG,KAAG,CAAC,GAAG,GAAG,EAAE,CAAC;AAC9B;AAAA,QACA,KAAK;AACJ,eAAK,IAAI,CAAC,GAAG,KAAG,CAAC,GAAG,GAAG,EAAE,CAAC;AAC3B;AAAA,QACA,KAAK;AACJ,eAAK,IAAI,GAAG,EAAE,EAAE,KAAK,GAAG;AACzB;AAAA,QACA,KAAK;AACJ,eAAK,IAAI,CAAC,GAAG,EAAE,CAAC;AACjB;AAAA,QACA,KAAK;AACJ,aAAG,KAAG,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;AAAG,eAAK,IAAI,GAAG,KAAG,CAAC;AACxC;AAAA,QACA,KAAK;AAAA,QAAI,KAAK;AACb,eAAK,IAAI,GAAG,EAAE;AACf;AAAA,MACA;AAAA,IACA,GApFe;AAAA,IAqFf,OAAO,CAAC,EAAE,KAAI,CAAC,GAAE,CAAC,GAAE,EAAC,GAAE,GAAE,GAAE,EAAC,CAAC,GAAE,EAAC,GAAE,CAAC,CAAC,EAAC,GAAE,EAAC,GAAE,CAAC,GAAE,CAAC,GAAE,GAAE,CAAC,GAAE,CAAC,EAAC,GAAE,EAAE,KAAI,CAAC,GAAE,CAAC,GAAE,EAAC,GAAE,EAAC,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,CAAC,CAAC,GAAE,EAAC,GAAE,CAAC,GAAE,CAAC,GAAE,GAAE,CAAC,GAAE,CAAC,GAAE,GAAE,GAAE,IAAG,GAAE,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,CAAC,GAAE,EAAE,EAAC,GAAE,EAAC,GAAE,CAAC,GAAE,CAAC,EAAC,GAAE,EAAE,KAAI,CAAC,GAAE,CAAC,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,CAAC,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,CAAC,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,CAAC,CAAC,GAAE,EAAC,IAAG,IAAG,IAAG,KAAI,IAAG,IAAG,GAAE,EAAC,IAAG,IAAG,IAAG,IAAG,IAAG,KAAI,IAAG,IAAG,GAAE,EAAC,IAAG,IAAG,IAAG,IAAG,IAAG,KAAI,IAAG,IAAG,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,GAAE,GAAE,EAAC,IAAG,IAAG,IAAG,IAAG,IAAG,KAAI,IAAG,IAAG,GAAE,EAAE,KAAI,CAAC,GAAE,CAAC,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,CAAC,GAAE,EAAE,EAAC,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,IAAG,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,IAAG,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAC,IAAG,KAAI,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,CAAC,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,CAAC,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,GAAE,EAAC,IAAG,IAAG,IAAG,KAAI,IAAG,IAAG,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAC,IAAG,CAAC,GAAE,EAAE,EAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAC,IAAG,KAAI,IAAG,GAAE,GAAE,EAAC,IAAG,KAAI,IAAG,KAAI,IAAG,CAAC,GAAE,EAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,KAAI,IAAG,KAAI,IAAG,IAAG,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,GAAE,EAAC,IAAG,IAAG,IAAG,KAAI,IAAG,KAAI,IAAG,KAAI,IAAG,KAAI,IAAG,IAAG,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,GAAE,EAAE,KAAI,CAAC,GAAE,EAAE,CAAC,CAAC;AAAA,IAC3wC,gBAAgB,EAAC,GAAE,CAAC,GAAE,CAAC,EAAC;AAAA,IACxB,YAAY,gCAAS,WAAY,KAAK,MAAM;AACxC,UAAI,KAAK,aAAa;AAClB,aAAK,MAAM,GAAG;AAAA,MAClB,OAAO;AACH,YAAI,QAAQ,IAAI,MAAM,GAAG;AACzB,cAAM,OAAO;AACb,cAAM;AAAA,MACV;AAAA,IACJ,GARY;AAAA,IASZ,OAAO,gCAAS,MAAM,OAAO;AACzB,UAAI,OAAO,MAAM,QAAQ,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,GAAG,QAAQ,KAAK,OAAO,SAAS,IAAI,WAAW,GAAG,SAAS,GAAG,aAAa,GAAG,SAAS,GAAG,MAAM;AACtK,UAAI,OAAO,OAAO,MAAM,KAAK,WAAW,CAAC;AACzC,UAAIC,SAAQ,OAAO,OAAO,KAAK,KAAK;AACpC,UAAI,cAAc,EAAE,IAAI,CAAC,EAAE;AAC3B,eAAS,KAAK,KAAK,IAAI;AACnB,YAAI,OAAO,UAAU,eAAe,KAAK,KAAK,IAAI,CAAC,GAAG;AAClD,sBAAY,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC;AAAA,QACjC;AAAA,MACJ;AACA,MAAAA,OAAM,SAAS,OAAO,YAAY,EAAE;AACpC,kBAAY,GAAG,QAAQA;AACvB,kBAAY,GAAG,SAAS;AACxB,UAAI,OAAOA,OAAM,UAAU,aAAa;AACpC,QAAAA,OAAM,SAAS,CAAC;AAAA,MACpB;AACA,UAAI,QAAQA,OAAM;AAClB,aAAO,KAAK,KAAK;AACjB,UAAI,SAASA,OAAM,WAAWA,OAAM,QAAQ;AAC5C,UAAI,OAAO,YAAY,GAAG,eAAe,YAAY;AACjD,aAAK,aAAa,YAAY,GAAG;AAAA,MACrC,OAAO;AACH,aAAK,aAAa,OAAO,eAAe,IAAI,EAAE;AAAA,MAClD;AACA,eAAS,SAAS,GAAG;AACjB,cAAM,SAAS,MAAM,SAAS,IAAI;AAClC,eAAO,SAAS,OAAO,SAAS;AAChC,eAAO,SAAS,OAAO,SAAS;AAAA,MACpC;AAJS;AAKD,eAAS,MAAM;AACf,YAAI;AACJ,gBAAQ,OAAO,IAAI,KAAKA,OAAM,IAAI,KAAK;AACvC,YAAI,OAAO,UAAU,UAAU;AAC3B,cAAI,iBAAiB,OAAO;AACxB,qBAAS;AACT,oBAAQ,OAAO,IAAI;AAAA,UACvB;AACA,kBAAQ,KAAK,SAAS,KAAK,KAAK;AAAA,QACpC;AACA,eAAO;AAAA,MACX;AAXa;AAYjB,UAAI,QAAQ,gBAAgB,OAAO,QAAQ,GAAG,GAAG,QAAQ,CAAC,GAAG,GAAG,KAAK,UAAU;AAC/E,aAAO,MAAM;AACT,gBAAQ,MAAM,MAAM,SAAS,CAAC;AAC9B,YAAI,KAAK,eAAe,KAAK,GAAG;AAC5B,mBAAS,KAAK,eAAe,KAAK;AAAA,QACtC,OAAO;AACH,cAAI,WAAW,QAAQ,OAAO,UAAU,aAAa;AACjD,qBAAS,IAAI;AAAA,UACjB;AACA,mBAAS,MAAM,KAAK,KAAK,MAAM,KAAK,EAAE,MAAM;AAAA,QAChD;AACA,YAAI,OAAO,WAAW,eAAe,CAAC,OAAO,UAAU,CAAC,OAAO,CAAC,GAAG;AAC/D,cAAI,SAAS;AACb,qBAAW,CAAC;AACZ,eAAK,KAAK,MAAM,KAAK,GAAG;AACpB,gBAAI,KAAK,WAAW,CAAC,KAAK,IAAI,QAAQ;AAClC,uBAAS,KAAK,MAAO,KAAK,WAAW,CAAC,IAAI,GAAI;AAAA,YAClD;AAAA,UACJ;AACA,cAAIA,OAAM,cAAc;AACpB,qBAAS,0BAA0B,WAAW,KAAK,QAAQA,OAAM,aAAa,IAAI,iBAAiB,SAAS,KAAK,IAAI,IAAI,aAAc,KAAK,WAAW,MAAM,KAAK,UAAU;AAAA,UAChL,OAAO;AACH,qBAAS,0BAA0B,WAAW,KAAK,mBAAmB,UAAU,MAAM,iBAAiB,OAAQ,KAAK,WAAW,MAAM,KAAK,UAAU;AAAA,UACxJ;AACA,eAAK,WAAW,QAAQ;AAAA,YACpB,MAAMA,OAAM;AAAA,YACZ,OAAO,KAAK,WAAW,MAAM,KAAK;AAAA,YAClC,MAAMA,OAAM;AAAA,YACZ,KAAK;AAAA,YACL;AAAA,UACJ,CAAC;AAAA,QACL;AACA,YAAI,OAAO,CAAC,aAAa,SAAS,OAAO,SAAS,GAAG;AACjD,gBAAM,IAAI,MAAM,sDAAsD,QAAQ,cAAc,MAAM;AAAA,QACtG;AACA,gBAAQ,OAAO,CAAC,GAAG;AAAA,UACnB,KAAK;AACD,kBAAM,KAAK,MAAM;AACjB,mBAAO,KAAKA,OAAM,MAAM;AACxB,mBAAO,KAAKA,OAAM,MAAM;AACxB,kBAAM,KAAK,OAAO,CAAC,CAAC;AACpB,qBAAS;AACT,gBAAI,CAAC,gBAAgB;AACjB,uBAASA,OAAM;AACf,uBAASA,OAAM;AACf,yBAAWA,OAAM;AACjB,sBAAQA,OAAM;AACd,kBAAI,aAAa,GAAG;AAChB;AAAA,cACJ;AAAA,YACJ,OAAO;AACH,uBAAS;AACT,+BAAiB;AAAA,YACrB;AACA;AAAA,UACJ,KAAK;AACD,kBAAM,KAAK,aAAa,OAAO,CAAC,CAAC,EAAE,CAAC;AACpC,kBAAM,IAAI,OAAO,OAAO,SAAS,GAAG;AACpC,kBAAM,KAAK;AAAA,cACP,YAAY,OAAO,OAAO,UAAU,OAAO,EAAE,EAAE;AAAA,cAC/C,WAAW,OAAO,OAAO,SAAS,CAAC,EAAE;AAAA,cACrC,cAAc,OAAO,OAAO,UAAU,OAAO,EAAE,EAAE;AAAA,cACjD,aAAa,OAAO,OAAO,SAAS,CAAC,EAAE;AAAA,YAC3C;AACA,gBAAI,QAAQ;AACR,oBAAM,GAAG,QAAQ;AAAA,gBACb,OAAO,OAAO,UAAU,OAAO,EAAE,EAAE,MAAM,CAAC;AAAA,gBAC1C,OAAO,OAAO,SAAS,CAAC,EAAE,MAAM,CAAC;AAAA,cACrC;AAAA,YACJ;AACA,gBAAI,KAAK,cAAc,MAAM,OAAO;AAAA,cAChC;AAAA,cACA;AAAA,cACA;AAAA,cACA,YAAY;AAAA,cACZ,OAAO,CAAC;AAAA,cACR;AAAA,cACA;AAAA,YACJ,EAAE,OAAO,IAAI,CAAC;AACd,gBAAI,OAAO,MAAM,aAAa;AAC1B,qBAAO;AAAA,YACX;AACA,gBAAI,KAAK;AACL,sBAAQ,MAAM,MAAM,GAAG,KAAK,MAAM,CAAC;AACnC,uBAAS,OAAO,MAAM,GAAG,KAAK,GAAG;AACjC,uBAAS,OAAO,MAAM,GAAG,KAAK,GAAG;AAAA,YACrC;AACA,kBAAM,KAAK,KAAK,aAAa,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;AAC1C,mBAAO,KAAK,MAAM,CAAC;AACnB,mBAAO,KAAK,MAAM,EAAE;AACpB,uBAAW,MAAM,MAAM,MAAM,SAAS,CAAC,CAAC,EAAE,MAAM,MAAM,SAAS,CAAC,CAAC;AACjE,kBAAM,KAAK,QAAQ;AACnB;AAAA,UACJ,KAAK;AACD,mBAAO;AAAA,QACX;AAAA,MACJ;AACA,aAAO;AAAA,IACX,GA3IO;AAAA,EA2IN;AAGD,MAAI,QAAS,4BAAU;AACvB,QAAIA,SAAS;AAAA,MAEb,KAAI;AAAA,MAEJ,YAAW,gCAAS,WAAW,KAAK,MAAM;AAClC,YAAI,KAAK,GAAG,QAAQ;AAChB,eAAK,GAAG,OAAO,WAAW,KAAK,IAAI;AAAA,QACvC,OAAO;AACH,gBAAM,IAAI,MAAM,GAAG;AAAA,QACvB;AAAA,MACJ,GANO;AAAA;AAAA,MASX,UAAS,gCAAU,OAAO,IAAI;AACtB,aAAK,KAAK,MAAM,KAAK,MAAM,CAAC;AAC5B,aAAK,SAAS;AACd,aAAK,QAAQ,KAAK,aAAa,KAAK,OAAO;AAC3C,aAAK,WAAW,KAAK,SAAS;AAC9B,aAAK,SAAS,KAAK,UAAU,KAAK,QAAQ;AAC1C,aAAK,iBAAiB,CAAC,SAAS;AAChC,aAAK,SAAS;AAAA,UACV,YAAY;AAAA,UACZ,cAAc;AAAA,UACd,WAAW;AAAA,UACX,aAAa;AAAA,QACjB;AACA,YAAI,KAAK,QAAQ,QAAQ;AACrB,eAAK,OAAO,QAAQ,CAAC,GAAE,CAAC;AAAA,QAC5B;AACA,aAAK,SAAS;AACd,eAAO;AAAA,MACX,GAlBK;AAAA;AAAA,MAqBT,OAAM,kCAAY;AACV,YAAI,KAAK,KAAK,OAAO,CAAC;AACtB,aAAK,UAAU;AACf,aAAK;AACL,aAAK;AACL,aAAK,SAAS;AACd,aAAK,WAAW;AAChB,YAAI,QAAQ,GAAG,MAAM,iBAAiB;AACtC,YAAI,OAAO;AACP,eAAK;AACL,eAAK,OAAO;AAAA,QAChB,OAAO;AACH,eAAK,OAAO;AAAA,QAChB;AACA,YAAI,KAAK,QAAQ,QAAQ;AACrB,eAAK,OAAO,MAAM,CAAC;AAAA,QACvB;AAEA,aAAK,SAAS,KAAK,OAAO,MAAM,CAAC;AACjC,eAAO;AAAA,MACX,GApBE;AAAA;AAAA,MAuBN,OAAM,gCAAU,IAAI;AACZ,YAAI,MAAM,GAAG;AACb,YAAI,QAAQ,GAAG,MAAM,eAAe;AAEpC,aAAK,SAAS,KAAK,KAAK;AACxB,aAAK,SAAS,KAAK,OAAO,OAAO,GAAG,KAAK,OAAO,SAAS,GAAG;AAE5D,aAAK,UAAU;AACf,YAAI,WAAW,KAAK,MAAM,MAAM,eAAe;AAC/C,aAAK,QAAQ,KAAK,MAAM,OAAO,GAAG,KAAK,MAAM,SAAS,CAAC;AACvD,aAAK,UAAU,KAAK,QAAQ,OAAO,GAAG,KAAK,QAAQ,SAAS,CAAC;AAE7D,YAAI,MAAM,SAAS,GAAG;AAClB,eAAK,YAAY,MAAM,SAAS;AAAA,QACpC;AACA,YAAI,IAAI,KAAK,OAAO;AAEpB,aAAK,SAAS;AAAA,UACV,YAAY,KAAK,OAAO;AAAA,UACxB,WAAW,KAAK,WAAW;AAAA,UAC3B,cAAc,KAAK,OAAO;AAAA,UAC1B,aAAa,SACR,MAAM,WAAW,SAAS,SAAS,KAAK,OAAO,eAAe,KAC5D,SAAS,SAAS,SAAS,MAAM,MAAM,EAAE,SAAS,MAAM,CAAC,EAAE,SAChE,KAAK,OAAO,eAAe;AAAA,QACjC;AAEA,YAAI,KAAK,QAAQ,QAAQ;AACrB,eAAK,OAAO,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,KAAK,SAAS,GAAG;AAAA,QACvD;AACA,aAAK,SAAS,KAAK,OAAO;AAC1B,eAAO;AAAA,MACX,GAhCE;AAAA;AAAA,MAmCN,MAAK,kCAAY;AACT,aAAK,QAAQ;AACb,eAAO;AAAA,MACX,GAHC;AAAA;AAAA,MAML,QAAO,kCAAY;AACX,YAAI,KAAK,QAAQ,iBAAiB;AAC9B,eAAK,aAAa;AAAA,QACtB,OAAO;AACH,iBAAO,KAAK,WAAW,4BAA4B,KAAK,WAAW,KAAK,qIAAqI,KAAK,aAAa,GAAG;AAAA,YAC9N,MAAM;AAAA,YACN,OAAO;AAAA,YACP,MAAM,KAAK;AAAA,UACf,CAAC;AAAA,QAEL;AACA,eAAO;AAAA,MACX,GAZG;AAAA;AAAA,MAeP,MAAK,gCAAU,GAAG;AACV,aAAK,MAAM,KAAK,MAAM,MAAM,CAAC,CAAC;AAAA,MAClC,GAFC;AAAA;AAAA,MAKL,WAAU,kCAAY;AACd,YAAI,OAAO,KAAK,QAAQ,OAAO,GAAG,KAAK,QAAQ,SAAS,KAAK,MAAM,MAAM;AACzE,gBAAQ,KAAK,SAAS,KAAK,QAAM,MAAM,KAAK,OAAO,GAAG,EAAE,QAAQ,OAAO,EAAE;AAAA,MAC7E,GAHM;AAAA;AAAA,MAMV,eAAc,kCAAY;AAClB,YAAI,OAAO,KAAK;AAChB,YAAI,KAAK,SAAS,IAAI;AAClB,kBAAQ,KAAK,OAAO,OAAO,GAAG,KAAG,KAAK,MAAM;AAAA,QAChD;AACA,gBAAQ,KAAK,OAAO,GAAE,EAAE,KAAK,KAAK,SAAS,KAAK,QAAQ,KAAK,QAAQ,OAAO,EAAE;AAAA,MAClF,GANU;AAAA;AAAA,MASd,cAAa,kCAAY;AACjB,YAAI,MAAM,KAAK,UAAU;AACzB,YAAI,IAAI,IAAI,MAAM,IAAI,SAAS,CAAC,EAAE,KAAK,GAAG;AAC1C,eAAO,MAAM,KAAK,cAAc,IAAI,OAAO,IAAI;AAAA,MACnD,GAJS;AAAA;AAAA,MAOb,YAAW,gCAAS,OAAO,cAAc;AACjC,YAAI,OACA,OACA;AAEJ,YAAI,KAAK,QAAQ,iBAAiB;AAE9B,mBAAS;AAAA,YACL,UAAU,KAAK;AAAA,YACf,QAAQ;AAAA,cACJ,YAAY,KAAK,OAAO;AAAA,cACxB,WAAW,KAAK;AAAA,cAChB,cAAc,KAAK,OAAO;AAAA,cAC1B,aAAa,KAAK,OAAO;AAAA,YAC7B;AAAA,YACA,QAAQ,KAAK;AAAA,YACb,OAAO,KAAK;AAAA,YACZ,SAAS,KAAK;AAAA,YACd,SAAS,KAAK;AAAA,YACd,QAAQ,KAAK;AAAA,YACb,QAAQ,KAAK;AAAA,YACb,OAAO,KAAK;AAAA,YACZ,QAAQ,KAAK;AAAA,YACb,IAAI,KAAK;AAAA,YACT,gBAAgB,KAAK,eAAe,MAAM,CAAC;AAAA,YAC3C,MAAM,KAAK;AAAA,UACf;AACA,cAAI,KAAK,QAAQ,QAAQ;AACrB,mBAAO,OAAO,QAAQ,KAAK,OAAO,MAAM,MAAM,CAAC;AAAA,UACnD;AAAA,QACJ;AAEA,gBAAQ,MAAM,CAAC,EAAE,MAAM,iBAAiB;AACxC,YAAI,OAAO;AACP,eAAK,YAAY,MAAM;AAAA,QAC3B;AACA,aAAK,SAAS;AAAA,UACV,YAAY,KAAK,OAAO;AAAA,UACxB,WAAW,KAAK,WAAW;AAAA,UAC3B,cAAc,KAAK,OAAO;AAAA,UAC1B,aAAa,QACA,MAAM,MAAM,SAAS,CAAC,EAAE,SAAS,MAAM,MAAM,SAAS,CAAC,EAAE,MAAM,QAAQ,EAAE,CAAC,EAAE,SAC5E,KAAK,OAAO,cAAc,MAAM,CAAC,EAAE;AAAA,QACpD;AACA,aAAK,UAAU,MAAM,CAAC;AACtB,aAAK,SAAS,MAAM,CAAC;AACrB,aAAK,UAAU;AACf,aAAK,SAAS,KAAK,OAAO;AAC1B,YAAI,KAAK,QAAQ,QAAQ;AACrB,eAAK,OAAO,QAAQ,CAAC,KAAK,QAAQ,KAAK,UAAU,KAAK,MAAM;AAAA,QAChE;AACA,aAAK,QAAQ;AACb,aAAK,aAAa;AAClB,aAAK,SAAS,KAAK,OAAO,MAAM,MAAM,CAAC,EAAE,MAAM;AAC/C,aAAK,WAAW,MAAM,CAAC;AACvB,gBAAQ,KAAK,cAAc,KAAK,MAAM,KAAK,IAAI,MAAM,cAAc,KAAK,eAAe,KAAK,eAAe,SAAS,CAAC,CAAC;AACtH,YAAI,KAAK,QAAQ,KAAK,QAAQ;AAC1B,eAAK,OAAO;AAAA,QAChB;AACA,YAAI,OAAO;AACP,iBAAO;AAAA,QACX,WAAW,KAAK,YAAY;AAExB,mBAAS,KAAK,QAAQ;AAClB,iBAAK,CAAC,IAAI,OAAO,CAAC;AAAA,UACtB;AACA,iBAAO;AAAA,QACX;AACA,eAAO;AAAA,MACX,GArEO;AAAA;AAAA,MAwEX,MAAK,kCAAY;AACT,YAAI,KAAK,MAAM;AACX,iBAAO,KAAK;AAAA,QAChB;AACA,YAAI,CAAC,KAAK,QAAQ;AACd,eAAK,OAAO;AAAA,QAChB;AAEA,YAAI,OACA,OACA,WACA;AACJ,YAAI,CAAC,KAAK,OAAO;AACb,eAAK,SAAS;AACd,eAAK,QAAQ;AAAA,QACjB;AACA,YAAI,QAAQ,KAAK,cAAc;AAC/B,iBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,sBAAY,KAAK,OAAO,MAAM,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC;AAClD,cAAI,cAAc,CAAC,SAAS,UAAU,CAAC,EAAE,SAAS,MAAM,CAAC,EAAE,SAAS;AAChE,oBAAQ;AACR,oBAAQ;AACR,gBAAI,KAAK,QAAQ,iBAAiB;AAC9B,sBAAQ,KAAK,WAAW,WAAW,MAAM,CAAC,CAAC;AAC3C,kBAAI,UAAU,OAAO;AACjB,uBAAO;AAAA,cACX,WAAW,KAAK,YAAY;AACxB,wBAAQ;AACR;AAAA,cACJ,OAAO;AAEH,uBAAO;AAAA,cACX;AAAA,YACJ,WAAW,CAAC,KAAK,QAAQ,MAAM;AAC3B;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AACA,YAAI,OAAO;AACP,kBAAQ,KAAK,WAAW,OAAO,MAAM,KAAK,CAAC;AAC3C,cAAI,UAAU,OAAO;AACjB,mBAAO;AAAA,UACX;AAEA,iBAAO;AAAA,QACX;AACA,YAAI,KAAK,WAAW,IAAI;AACpB,iBAAO,KAAK;AAAA,QAChB,OAAO;AACH,iBAAO,KAAK,WAAW,4BAA4B,KAAK,WAAW,KAAK,2BAA2B,KAAK,aAAa,GAAG;AAAA,YACpH,MAAM;AAAA,YACN,OAAO;AAAA,YACP,MAAM,KAAK;AAAA,UACf,CAAC;AAAA,QACL;AAAA,MACJ,GAvDC;AAAA;AAAA,MA0DL,KAAI,gCAAS,MAAO;AACZ,YAAI,IAAI,KAAK,KAAK;AAClB,YAAI,GAAG;AACH,iBAAO;AAAA,QACX,OAAO;AACH,iBAAO,KAAK,IAAI;AAAA,QACpB;AAAA,MACJ,GAPA;AAAA;AAAA,MAUJ,OAAM,gCAAS,MAAO,WAAW;AACzB,aAAK,eAAe,KAAK,SAAS;AAAA,MACtC,GAFE;AAAA;AAAA,MAKN,UAAS,gCAAS,WAAY;AACtB,YAAI,IAAI,KAAK,eAAe,SAAS;AACrC,YAAI,IAAI,GAAG;AACP,iBAAO,KAAK,eAAe,IAAI;AAAA,QACnC,OAAO;AACH,iBAAO,KAAK,eAAe,CAAC;AAAA,QAChC;AAAA,MACJ,GAPK;AAAA;AAAA,MAUT,eAAc,gCAAS,gBAAiB;AAChC,YAAI,KAAK,eAAe,UAAU,KAAK,eAAe,KAAK,eAAe,SAAS,CAAC,GAAG;AACnF,iBAAO,KAAK,WAAW,KAAK,eAAe,KAAK,eAAe,SAAS,CAAC,CAAC,EAAE;AAAA,QAChF,OAAO;AACH,iBAAO,KAAK,WAAW,SAAS,EAAE;AAAA,QACtC;AAAA,MACJ,GANU;AAAA;AAAA,MASd,UAAS,gCAAS,SAAU,GAAG;AACvB,YAAI,KAAK,eAAe,SAAS,IAAI,KAAK,IAAI,KAAK,CAAC;AACpD,YAAI,KAAK,GAAG;AACR,iBAAO,KAAK,eAAe,CAAC;AAAA,QAChC,OAAO;AACH,iBAAO;AAAA,QACX;AAAA,MACJ,GAPK;AAAA;AAAA,MAUT,WAAU,gCAAS,UAAW,WAAW;AACjC,aAAK,MAAM,SAAS;AAAA,MACxB,GAFM;AAAA;AAAA,MAKV,gBAAe,gCAAS,iBAAiB;AACjC,eAAO,KAAK,eAAe;AAAA,MAC/B,GAFW;AAAA,MAGf,SAAS,EAAC,oBAAmB,KAAI;AAAA,MACjC,eAAe,gCAAS,UAAU,IAAG,KAAI,2BAA0B,UAAU;AAC7E,YAAI,UAAQ;AACZ,gBAAO,2BAA2B;AAAA,UAClC,KAAK;AACL;AAAA,UACA,KAAK;AACL;AAAA,UACA,KAAK;AACL;AAAA,UACA,KAAK;AACH,gBAAI,GAAG,iBAAiB,GAAG,cAAc,GAAG;AAC1C,iBAAG,oBAAoB;AACvB,mBAAK,MAAM,SAAS;AACpB,qBAAO;AAAA,YACT;AAEF;AAAA,UACA,KAAK;AACL;AAAA,UACA,KAAK;AAAG,gBAAI,GAAG,eAAe;AAAE,iBAAG,cAAc,KAAK;AAAA,YAAG;AAAE,iBAAK,MAAM,SAAS;AAAG,iBAAK,MAAM,IAAI,MAAM;AACvG;AAAA,UACA,KAAK;AAAG,iBAAK,MAAM,KAAK;AAAG,mBAAO;AAClC;AAAA,UACA,KAAK;AACL;AAAA,UACA,KAAK;AACL;AAAA,UACA,KAAK;AAAE,mBAAO;AACd;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,gBAAI,GAAG,mBAAmB;AAAE,iBAAG,oBAAoB;AAAA,YAAO,OAAO;AAAE,qBAAO;AAAA,YAAI;AACvF;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,gBAAI,SAAS,IAAI,OAAO,MAAM,GAAG,EAAE;AAAG,mBAAO;AACtD;AAAA,UACA,KAAK;AAAI,gBAAI,SAAS,IAAI,OAAO,MAAM,GAAG,EAAE,EAAE,KAAK;AAAG,mBAAO;AAC7D;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,UACA,KAAK;AAAI,mBAAO;AAChB;AAAA,QACA;AAAA,MACA,GA9De;AAAA,MA+Df,OAAO,CAAC,wBAAuB,uBAAsB,0BAAyB,0BAAyB,gBAAe,oBAAmB,iBAAgB,kBAAiB,gBAAe,WAAU,yBAAwB,qBAAoB,eAAc,iBAAgB,gBAAe,iBAAgB,sBAAqB,sBAAqB,kCAAiC,2BAA0B,+EAA8E,8DAA6D,kCAAiC,kBAAiB,WAAU,SAAS;AAAA,MACjmB,YAAY,EAAC,OAAM,EAAC,SAAQ,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE,GAAE,aAAY,KAAI,GAAE,WAAU,EAAC,SAAQ,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE,GAAE,aAAY,KAAI,EAAC;AAAA,IACtN;AACA,WAAOA;AAAA,EACP,GAAG;AACH,EAAAD,QAAO,QAAQ;AACf,WAAS,SAAU;AACjB,SAAK,KAAK,CAAC;AAAA,EACb;AAFS;AAGT,SAAO,YAAYA;AAAO,EAAAA,QAAO,SAAS;AAC1C,SAAO,IAAI;AACX,GAAG;AACF,OAAO,SAAS;AAEhB,IAAO,eAAQ;;;AChsBhB,IAAM,UAAsB,CAAC;AAC7B,IAAM,YAA4B,CAAC;AACnC,IAAM,eAAgC,CAAC;AACvC,IAAM,YAAY,oBAAI,IAAY;AAClC,IAAI;AACJ,IAAI,aAAa;AAEV,IAAM,gBAAyC,wBAAC,gBAAgB,OAAO,SAAS;AACrF,QAAM,OAAO,wBAAwB,cAAc,EAAE,KAAK;AAC1D,QAAM,eAAe,QAAQ,KAAK,KAAK,IAAI,eAAe,QAAQ,CAAC;AACnE,gBAAc;AACd,MAAI,KAAK,WAAW,GAAG;AACrB,cAAU,IAAI,KAAK,CAAC,CAAC;AAAA,EACvB;AAEA,UAAQ,KAAK;AAAA,IACX;AAAA,IACA,MAAM;AAAA,IACN,OAAO,QAAQ,cAAc,KAAK,IAAI;AAAA,EACxC,CAAC;AACH,GAbsD;AAe/C,IAAM,gBAAgB,6BAAM;AACjC,SAAO;AACT,GAF6B;AAI7B,IAAM,gBAAgB,wBAAC,SAAiB;AACtC,QAAM,UAAU,KAAK,KAAK;AAC1B,MAAI,QAAQ,UAAU,KAAK,QAAQ,WAAW,GAAG,KAAK,QAAQ,SAAS,GAAG,GAAG;AAC3E,WAAO,QAAQ,MAAM,GAAG,EAAE;AAAA,EAC5B;AACA,SAAO;AACT,GANsB;AAQtB,IAAM,sBAAsB,wBAAC,UAAkD;AAC7E,SAAO,QAAQ,cAAc,KAAK,IAAI;AACxC,GAF4B;AAIrB,IAAM,cAAqC,wBAAC,gBAAgB,IAAI,UAAU;AAC/E,QAAM,eAAe,cAAc,EAAE;AACrC,YAAU,KAAK;AAAA,IACb,MAAM,wBAAwB,cAAc,EAAE,KAAK;AAAA,IACnD,IAAI;AAAA,IACJ,OAAO,QAAQ,cAAc,KAAK,IAAI;AAAA,EACxC,CAAC;AACH,GAPkD;AAS3C,IAAM,eAAuC,wBAAC,gBAAgB,SAAS;AAC5E,QAAM,UAAU,wBAAwB,cAAc,EAAE,KAAK;AAC7D,QAAM,SAAiC,CAAC;AACxC,aAAW,CAAC,KAAK,KAAK,KAAK,MAAM;AAC/B,WAAO,GAAG,IAAI,oBAAoB,KAAK,KAAK;AAAA,EAC9C;AACA,eAAa,KAAK,EAAE,SAAS,OAAO,CAAC;AACvC,GAPoD;AAS7C,IAAM,eAAe,6BAAM;AAChC,SAAO;AACT,GAF4B;AAI5B,IAAM,0BAA0B,wBAAC,mBAA6B;AAC5D,SAAO,eAAe,IAAI,CAAC,eAAe,cAAc,UAAU,CAAC;AACrE,GAFgC;AAIzB,IAAM,2BAA+D,wBAAC,mBAAmB;AAC9F,QAAM,aAAa,wBAAwB,cAAc;AACzD,QAAM,UAAU,WAAW,OAAO,CAAC,eAAe,CAAC,UAAU,IAAI,UAAU,CAAC;AAC5E,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,IAAI,MAAM,2BAA2B,QAAQ,KAAK,IAAI,CAAC,EAAE;AAAA,EACjE;AACF,GAN4E;AAQrE,IAAM,cAAc,6BAAM;AAC/B,SAAO;AACT,GAF2B;AAIpB,IAAM,iBAA2C,6BAAM,aAAN;AACjD,IAAM,gBAAyC,6BAAM,YAAN;AAC/C,IAAM,gBAAyC,wBAAC,YAAY;AACjE,eAAa;AACf,GAFsD;AAItD,IAAM,sBAAmD,sBAAe;AAExE,SAASE,aAAyC;AAChD,SAAO,cAAc,qBAAqB,UAAgB,EAAE,IAAI;AAClE;AAFS,OAAAA,YAAA;AAIT,IAAM,cAAc,6BAAM;AACxB,QAAM;AACN,UAAQ,SAAS;AACjB,YAAU,SAAS;AACnB,eAAa,SAAS;AACtB,YAAU,MAAM;AAChB,gBAAc;AACd,eAAa;AACf,GARoB;AAUb,IAAM,KAAa;AAAA,EACxB,WAAAA;AAAA,EACA,OAAO;AAAA,EACP;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;;;AC7HA,IAAM,YAAY,wBAAC,YACjB;AAAA;AAAA;AAAA,YAGU,QAAQ,kBAAkB;AAAA,mBACnB,QAAQ,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA,mBAKlB,QAAQ,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA,YAKzB,QAAQ,gBAAgB;AAAA,mBACjB,QAAQ,UAAU;AAAA;AAAA;AAAA;AAAA,mBAIlB,QAAQ,UAAU;AAAA,aACxB,QAAQ,gBAAgB;AAAA;AAAA,GArBnB;AAyBlB,IAAO,iBAAQ;;;AChCf,IAAM,UAAU;AAiBhB,SAAS,iBAAiB,SAAS,OAAO;AAExC,QAAM,qBAAqB,sBAAsB,OAAO;AAGxD,QAAM,cAAc,mBAAmB,OAAO,CAAC,MAAM,mBAAmB,GAAG,OAAO,CAAC;AAEnF,MAAI,UAAU;AACd,MAAI,cAAc;AAElB,QAAM,OAAO,CAAC;AAId,MAAI,YAAY,SAAS,GAAG;AAG1B,UAAM,SAAS,UAAU,WAAW;AACpC,aAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,EAAE,GAAG;AAC3C,YAAM,IAAI,YAAY,CAAC;AACvB,QAAE,QAAQ,KAAK,MAAM,EAAE,IAAI,OAAO,GAAG,EAAE,IAAI,OAAO,CAAC;AAAA,IACrD;AACA,gBAAY,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAI5C,QAAI,KAAK,YAAY,YAAY,SAAS,CAAC;AAC3C,aAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,EAAE,GAAG;AAC3C,YAAM,KAAK,YAAY,CAAC;AAGxB,sBAAgB,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,GAAG;AAG1C,YAAM,WAAW,EAAE,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,EAAE;AAE9D,UAAI,MAAM;AAEV,eAAS,IAAI,GAAG,IAAI,GAAG,YAAY,QAAQ,EAAE,GAAG;AAC9C,YAAI,GAAG,YAAY,SAAS,GAAG,YAAY,CAAC,CAAC,GAAG;AAG9C,gBAAM,SAAS,QAAQ,GAAG,YAAY,CAAC,CAAC;AACxC,gBAAM,KAAK,KAAK,MAAM,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,OAAO,CAAC;AACtD,gBAAM,KAAK,KAAK,MAAM,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,OAAO,CAAC;AAEtD,cAAI,YAAY,KAAK;AACrB,cAAI,YAAY,GAAG;AACjB,yBAAa,IAAI,KAAK;AAAA,UACxB;AAIA,gBAAM,IAAI,KAAK,YAAY;AAC3B,cAAI,QAAQ,SAAS,UAAU;AAAA,YAC7B,GAAG,OAAO,IAAI,OAAO,SAAS,KAAK,IAAI,CAAC;AAAA,YACxC,GAAG,OAAO,IAAI,OAAO,SAAS,KAAK,IAAI,CAAC;AAAA,UAC1C,CAAC;AAID,cAAI,QAAQ,OAAO,SAAS,GAAG;AAC7B,oBAAQ,OAAO,SAAS;AAAA,UAC1B;AAGA,cAAI,OAAO,QAAQ,IAAI,QAAQ,OAAO;AACpC,kBAAM,EAAE,QAAQ,OAAO,IAAI,IAAI,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;AAAA,UAC3E;AAAA,QACF;AAAA,MACF;AAEA,UAAI,OAAO,MAAM;AACf,aAAK,KAAK,GAAG;AACb,mBAAW,WAAW,IAAI,OAAO,QAAQ,IAAI,KAAK;AAClD,aAAK;AAAA,MACP;AAAA,IACF;AAAA,EACF,OAAO;AAGL,QAAI,WAAW,QAAQ,CAAC;AACxB,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AACvC,UAAI,QAAQ,CAAC,EAAE,SAAS,SAAS,QAAQ;AACvC,mBAAW,QAAQ,CAAC;AAAA,MACtB;AAAA,IACF;AAIA,QAAI,WAAW;AACf,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AACvC,UAAI,SAAS,QAAQ,CAAC,GAAG,QAAQ,IAAI,KAAK,IAAI,SAAS,SAAS,QAAQ,CAAC,EAAE,MAAM,GAAG;AAClF,mBAAW;AACX;AAAA,MACF;AAAA,IACF;AAEA,QAAI,UAAU;AACZ,gBAAU,cAAc;AAAA,IAC1B,OAAO;AACL,gBAAU,SAAS,SAAS,SAAS,SAAS,KAAK;AACnD,WAAK,KAAK;AAAA,QACR,QAAQ;AAAA,QACR,IAAI,EAAE,GAAG,SAAS,GAAG,GAAG,SAAS,IAAI,SAAS,OAAO;AAAA,QACrD,IAAI,EAAE,GAAG,SAAS,IAAI,SAAS,GAAG,SAAS,IAAI,SAAS,OAAO;AAAA,QAC/D,OAAO,SAAS,SAAS;AAAA,QACzB,OAAO;AAAA,QACP,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AAAA,EACF;AAEA,iBAAe;AAEf,MAAI,OAAO;AACT,UAAM,OAAO,UAAU;AACvB,UAAM,UAAU;AAChB,UAAM,cAAc;AACpB,UAAM,OAAO;AACb,UAAM,cAAc;AACpB,UAAM,qBAAqB;AAAA,EAC7B;AAEA,SAAO,UAAU;AACnB;AA7HS;AAqIT,SAAS,mBAAmB,OAAO,SAAS;AAC1C,SAAO,QAAQ,MAAM,CAAC,WAAW,SAAS,OAAO,MAAM,IAAI,OAAO,SAAS,OAAO;AACpF;AAFS;AAST,SAAS,sBAAsB,SAAS;AAEtC,QAAM,MAAM,CAAC;AACb,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AACvC,aAAS,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AAC3C,YAAM,YAAY,yBAAyB,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC;AACjE,iBAAW,KAAK,WAAW;AACzB,UAAE,cAAc,CAAC,GAAG,CAAC;AACrB,YAAI,KAAK,CAAC;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAbS;AAqBT,SAAS,WAAW,GAAG,OAAO;AAC5B,SAAO,IAAI,IAAI,KAAK,KAAK,IAAI,QAAQ,CAAC,KAAK,IAAI,SAAS,KAAK,KAAK,SAAS,IAAI,IAAI,MAAM;AAC3F;AAFS;AAUT,SAAS,SAAS,IAAI,IAAI;AACxB,SAAO,KAAK,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,GAAG,EAAE;AAChF;AAFS;AAaT,SAAS,cAAc,IAAI,IAAI,GAAG;AAEhC,MAAI,KAAK,KAAK,IAAI;AAChB,WAAO;AAAA,EACT;AAGA,MAAI,KAAK,KAAK,IAAI,KAAK,EAAE,GAAG;AAC1B,WAAO,KAAK,KAAK,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI,EAAE;AAAA,EACrD;AAEA,QAAM,KAAK,MAAM,IAAI,IAAI,KAAK,KAAK,KAAK,OAAO,IAAI;AACnD,QAAM,KAAK,MAAM,IAAI,IAAI,KAAK,KAAK,KAAK,OAAO,IAAI;AACnD,SAAO,WAAW,IAAI,EAAE,IAAI,WAAW,IAAI,EAAE;AAC/C;AAdS;AAyBT,SAAS,yBAAyB,IAAI,IAAI;AACxC,QAAM,IAAI,SAAS,IAAI,EAAE;AACzB,QAAM,KAAK,GAAG;AACd,QAAM,KAAK,GAAG;AAGd,MAAI,KAAK,KAAK,MAAM,KAAK,KAAK,IAAI,KAAK,EAAE,GAAG;AAC1C,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,MAAM,IAAI;AAC7C,QAAM,IAAI,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC;AACnC,QAAM,KAAK,GAAG,IAAK,KAAK,GAAG,IAAI,GAAG,KAAM;AACxC,QAAM,KAAK,GAAG,IAAK,KAAK,GAAG,IAAI,GAAG,KAAM;AACxC,QAAM,KAAK,EAAE,GAAG,IAAI,GAAG,MAAM,IAAI;AACjC,QAAM,KAAK,EAAE,GAAG,IAAI,GAAG,MAAM,IAAI;AAEjC,SAAO;AAAA,IACL,EAAE,GAAG,KAAK,IAAI,GAAG,KAAK,GAAG;AAAA,IACzB,EAAE,GAAG,KAAK,IAAI,GAAG,KAAK,GAAG;AAAA,EAC3B;AACF;AArBS;AA4BT,SAAS,UAAU,QAAQ;AACzB,QAAM,SAAS,EAAE,GAAG,GAAG,GAAG,EAAE;AAC5B,aAAW,SAAS,QAAQ;AAC1B,WAAO,KAAK,MAAM;AAClB,WAAO,KAAK,MAAM;AAAA,EACpB;AACA,SAAO,KAAK,OAAO;AACnB,SAAO,KAAK,OAAO;AACnB,SAAO;AACT;AATS;AAaT,SAAS,OAAO,GAAG,GAAG,GAAG,YAAY;AACjC,eAAa,cAAc,CAAC;AAC5B,QAAM,gBAAgB,WAAW,iBAAiB;AAClD,QAAM,YAAY,WAAW,aAAa;AAC1C,QAAM,KAAK,EAAE,CAAC;AACd,QAAM,KAAK,EAAE,CAAC;AACd,MAAI,QAAQ,IAAI;AAEhB,MAAI,KAAK,KAAK,GAAG;AACb,UAAM;AAAA,EACV;AAEA,MAAI,OAAO,EAAG,QAAO;AACrB,MAAI,OAAO,EAAG,QAAO;AAErB,WAAS,IAAI,GAAG,IAAI,eAAe,EAAE,GAAG;AACpC,aAAS;AACT,UAAM,MAAM,IAAI;AAChB,UAAM,OAAO,EAAE,GAAG;AAElB,QAAI,OAAO,MAAM,GAAG;AAChB,UAAI;AAAA,IACR;AAEA,QAAI,KAAK,IAAI,KAAK,IAAI,aAAa,SAAS,GAAG;AAC3C,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO,IAAI;AACf;AA7BS;AAiCT,SAAS,MAAM,GAAG;AACd,QAAM,IAAI,IAAI,MAAM,CAAC;AACrB,WAAS,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AACxB,MAAE,CAAC,IAAI;AAAA,EACX;AACA,SAAO;AACX;AANS;AAOT,SAAS,OAAO,GAAG,GAAG;AAClB,SAAO,MAAM,CAAC,EAAE,IAAI,MAAM,MAAM,CAAC,CAAC;AACtC;AAFS;AAIT,SAAS,IAAI,GAAG,GAAG;AACf,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG;AAC/B,WAAO,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,EACrB;AACA,SAAO;AACX;AANS;AAQT,SAAS,MAAM,GAAG;AACd,SAAO,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC;AAC9B;AAFS;AAIT,SAAS,MAAM,KAAK,OAAO,GAAG;AAC1B,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;AACnC,QAAI,CAAC,IAAI,MAAM,CAAC,IAAI;AAAA,EACxB;AACJ;AAJS;AAMT,SAAS,YAAY,KAAK,IAAI,IAAI,IAAI,IAAI;AACtC,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACjC,QAAI,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC;AAAA,EACnC;AACJ;AAJS;AAOT,SAAS,WAAW,GAAG,IAAI,YAAY;AACnC,eAAa,cAAc,CAAC;AAE5B,QAAM,gBAAgB,WAAW,iBAAiB,GAAG,SAAS;AAC9D,QAAM,eAAe,WAAW,gBAAgB;AAChD,QAAM,YAAY,WAAW,aAAa;AAC1C,QAAM,gBAAgB,WAAW,iBAAiB;AAClD,QAAM,eAAe,WAAW,iBAAiB;AACjD,QAAM,MAAM,WAAW,QAAQ,SAAY,WAAW,MAAM;AAC5D,QAAM,MAAM,WAAW,QAAQ,SAAY,WAAW,MAAM;AAC5D,QAAM,MAAM,WAAW,QAAQ,SAAY,WAAW,MAAM;AAC5D,QAAM,QAAQ,WAAW,UAAU,SAAY,WAAW,QAAQ;AAClE,MAAI;AAGJ,QAAM,IAAI,GAAG;AACb,QAAM,UAAU,IAAI,MAAM,IAAI,CAAC;AAC/B,UAAQ,CAAC,IAAI;AACb,UAAQ,CAAC,EAAE,KAAK,EAAE,EAAE;AACpB,UAAQ,CAAC,EAAE,KAAK;AAChB,WAAS,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AACxB,UAAM,QAAQ,GAAG,MAAM;AACvB,UAAM,CAAC,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,eAAe;AAChD,YAAQ,IAAI,CAAC,IAAI;AACjB,YAAQ,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK;AAC3B,YAAQ,IAAI,CAAC,EAAE,KAAK,IAAI;AAAA,EAC5B;AAEA,WAAS,cAAc,OAAO;AAC1B,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,cAAQ,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC;AAAA,IAC3B;AACA,YAAQ,CAAC,EAAE,KAAK,MAAM;AAAA,EAC1B;AALS;AAOT,QAAM,YAAY,wBAAC,GAAG,MAAM,EAAE,KAAK,EAAE,IAAnB;AAElB,QAAM,WAAW,GAAG,MAAM;AAC1B,QAAM,YAAY,GAAG,MAAM;AAC3B,QAAM,aAAa,GAAG,MAAM;AAC5B,QAAM,WAAW,GAAG,MAAM;AAE1B,WAAS,YAAY,GAAG,YAAY,eAAe,EAAE,WAAW;AAC5D,YAAQ,KAAK,SAAS;AAEtB,QAAI,WAAW,SAAS;AAGpB,YAAM,gBAAgB,QAAQ,IAAI,CAAC,MAAM;AACrC,cAAM,QAAQ,EAAE,MAAM;AACtB,cAAM,KAAK,EAAE;AACb,cAAM,KAAK,EAAE;AACb,eAAO;AAAA,MACX,CAAC;AACD,oBAAc,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE;AAExC,iBAAW,QAAQ,KAAK;AAAA,QACpB,GAAG,QAAQ,CAAC,EAAE,MAAM;AAAA,QACpB,IAAI,QAAQ,CAAC,EAAE;AAAA,QACf,SAAS;AAAA,MACb,CAAC;AAAA,IACL;AAEA,cAAU;AACV,aAAS,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AACxB,gBAAU,KAAK,IAAI,SAAS,KAAK,IAAI,QAAQ,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,IACvE;AAEA,QAAI,KAAK,IAAI,QAAQ,CAAC,EAAE,KAAK,QAAQ,CAAC,EAAE,EAAE,IAAI,iBAAiB,UAAU,cAAc;AACnF;AAAA,IACJ;AAGA,aAAS,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AACxB,eAAS,CAAC,IAAI;AACd,eAAS,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AACxB,iBAAS,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;AAAA,MAC/B;AACA,eAAS,CAAC,KAAK;AAAA,IACnB;AAIA,UAAM,QAAQ,QAAQ,CAAC;AACvB,gBAAY,WAAW,IAAI,KAAK,UAAU,CAAC,KAAK,KAAK;AACrD,cAAU,KAAK,EAAE,SAAS;AAG1B,QAAI,UAAU,KAAK,QAAQ,CAAC,EAAE,IAAI;AAC9B,kBAAY,UAAU,IAAI,KAAK,UAAU,CAAC,KAAK,KAAK;AACpD,eAAS,KAAK,EAAE,QAAQ;AACxB,UAAI,SAAS,KAAK,UAAU,IAAI;AAC5B,sBAAc,QAAQ;AAAA,MAC1B,OAAO;AACH,sBAAc,SAAS;AAAA,MAC3B;AAAA,IACJ,WAIS,UAAU,MAAM,QAAQ,IAAI,CAAC,EAAE,IAAI;AACxC,UAAI,eAAe;AAEnB,UAAI,UAAU,KAAK,MAAM,IAAI;AAEzB,oBAAY,YAAY,IAAI,KAAK,UAAU,CAAC,KAAK,KAAK;AACtD,mBAAW,KAAK,EAAE,UAAU;AAC5B,YAAI,WAAW,KAAK,MAAM,IAAI;AAC1B,wBAAc,UAAU;AAAA,QAC5B,OAAO;AACH,yBAAe;AAAA,QACnB;AAAA,MACJ,OAAO;AAEH,oBAAY,YAAY,IAAI,MAAM,KAAK,UAAU,MAAM,KAAK,KAAK;AACjE,mBAAW,KAAK,EAAE,UAAU;AAC5B,YAAI,WAAW,KAAK,UAAU,IAAI;AAC9B,wBAAc,UAAU;AAAA,QAC5B,OAAO;AACH,yBAAe;AAAA,QACnB;AAAA,MACJ;AAEA,UAAI,cAAc;AAEd,YAAI,SAAS,EAAG;AAGhB,iBAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AACrC,sBAAY,QAAQ,CAAC,GAAG,IAAI,OAAO,QAAQ,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC;AAChE,kBAAQ,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;AAAA,QAChC;AAAA,MACJ;AAAA,IACJ,OAAO;AACH,oBAAc,SAAS;AAAA,IAC3B;AAAA,EACJ;AAEA,UAAQ,KAAK,SAAS;AACtB,SAAO,EAAE,IAAI,QAAQ,CAAC,EAAE,IAAI,GAAG,QAAQ,CAAC,EAAE;AAC9C;AA5IS;AAqJT,SAAS,gBAAgB,GAAG,IAAI,SAAS,MAAM,GAAG,IAAI,IAAI;AACtD,QAAM,OAAO,QAAQ;AACrB,QAAM,YAAY,IAAI,QAAQ,SAAS,EAAE;AACzC,MAAI,MAAM;AACV,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,KAAK;AAET,MAAI,KAAK;AACT,OAAK,MAAM;AACX,OAAK,MAAM;AAEX,WAAS,KAAK,MAAM,QAAQ,QAAQ;AAChC,aAAS,YAAY,GAAG,YAAY,IAAI,EAAE,WAAW;AACjD,WAAK,OAAO,UAAU;AACtB,kBAAY,KAAK,GAAG,GAAK,QAAQ,GAAG,GAAG,EAAE;AACzC,YAAM,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,OAAO;AACtC,iBAAW,IAAI,KAAK,SAAS,EAAE;AAE/B,UAAI,MAAM,OAAO,KAAK,IAAI,aAAa,OAAO,QAAQ;AAClD,iBAAS;AAAA,MACb,OAAO;AACH,YAAI,KAAK,IAAI,QAAQ,KAAK,CAAC,KAAK,WAAW;AACvC,iBAAO;AAAA,QACX;AAEA,YAAI,YAAY,SAAS,SAAS,GAAG;AACjC,mBAAS;AAAA,QACb;AAEA,eAAO;AACP,iBAAS;AAAA,MACb;AAAA,IACJ;AAEA,WAAO;AAAA,EACX;AAxBS;AA0BT,WAAS,YAAY,GAAG,YAAY,IAAI,EAAE,WAAW;AACjD,gBAAY,KAAK,GAAG,GAAK,QAAQ,GAAG,GAAG,EAAE;AACzC,UAAM,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,OAAO;AACtC,eAAW,IAAI,KAAK,SAAS,EAAE;AAC/B,QAAI,MAAM,OAAO,KAAK,IAAI,aAAc,aAAa,OAAO,SAAU;AAClE,aAAO,KAAK,IAAI,GAAG,OAAO;AAAA,IAC9B;AAEA,QAAI,KAAK,IAAI,QAAQ,KAAK,CAAC,KAAK,WAAW;AACvC,aAAO;AAAA,IACX;AAEA,QAAI,YAAY,GAAG;AACf,aAAO,KAAK,GAAG,IAAI,GAAG;AAAA,IAC1B;AAEA,cAAU;AACV,SAAK;AACL,SAAK;AAAA,EACT;AAEA,SAAO;AACX;AA5DS;AA8DT,SAAS,kBAAkB,GAAG,SAAS,QAAQ;AAG3C,MAAI,UAAU,EAAE,GAAG,QAAQ,MAAM,GAAG,IAAI,GAAG,SAAS,QAAQ,MAAM,EAAE;AACpE,MAAI,OAAO,EAAE,GAAG,QAAQ,MAAM,GAAG,IAAI,GAAG,SAAS,QAAQ,MAAM,EAAE;AACjE,QAAM,KAAK,QAAQ,MAAM;AACzB,MAAI;AACJ,MAAI;AACJ,MAAI,IAAI;AACR,MAAI;AAEJ,WAAS,UAAU,CAAC;AACpB,kBAAgB,OAAO,iBAAiB,QAAQ,SAAS;AAEzD,UAAQ,KAAK,EAAE,QAAQ,GAAG,QAAQ,OAAO;AACzC,OAAK,QAAQ,QAAQ,MAAM;AAC3B,QAAM,IAAI,QAAQ,SAAS,EAAE;AAE7B,WAAS,IAAI,GAAG,IAAI,eAAe,EAAE,GAAG;AACpC,QAAI,gBAAgB,GAAG,IAAI,SAAS,MAAM,CAAC;AAG3C,QAAI,OAAO,SAAS;AAChB,aAAO,QAAQ,KAAK;AAAA,QAChB,GAAG,QAAQ,EAAE,MAAM;AAAA,QACnB,IAAI,QAAQ;AAAA,QACZ,SAAS,QAAQ,QAAQ,MAAM;AAAA,QAC/B,OAAO;AAAA,MACX,CAAC;AAAA,IACL;AAEA,QAAI,CAAC,GAAG;AAGJ,YAAM,IAAI,QAAQ,SAAS,EAAE;AAAA,IACjC,OAAO;AAEH,kBAAY,IAAI,GAAG,KAAK,SAAS,IAAI,QAAQ,OAAO;AAEpD,YAAM,UAAU,IAAI,QAAQ,SAAS,QAAQ,OAAO;AACpD,YAAM,SAAS,KAAK,IAAI,GAAG,IAAI,IAAI,KAAK,OAAO,IAAI,OAAO;AAE1D,kBAAY,IAAI,QAAQ,IAAI,IAAI,KAAK,OAAO;AAE5C,aAAO;AACP,gBAAU;AACV,aAAO;AAAA,IACX;AAEA,QAAI,MAAM,QAAQ,OAAO,KAAK,MAAM;AAChC;AAAA,IACJ;AAAA,EACJ;AAEA,MAAI,OAAO,SAAS;AAChB,WAAO,QAAQ,KAAK;AAAA,MAChB,GAAG,QAAQ,EAAE,MAAM;AAAA,MACnB,IAAI,QAAQ;AAAA,MACZ,SAAS,QAAQ,QAAQ,MAAM;AAAA,MAC/B,OAAO;AAAA,IACX,CAAC;AAAA,EACL;AAEA,SAAO;AACX;AAhES;AAyET,SAAS,KAAK,MAAM,aAAa,CAAC,GAAG;AACnC,aAAW,gBAAgB,WAAW,iBAAiB;AAEvD,QAAM,gBAAgB,WAAW,iBAAiB;AAClD,QAAM,OAAO,WAAW,gBAAgB;AAGxC,QAAM,QAAQ,gBAAgB,MAAM,UAAU;AAG9C,QAAM,UAAU,cAAc,OAAO,UAAU;AAG/C,QAAM,SAAS,OAAO,KAAK,OAAO;AAElC,QAAM,UAAU,CAAC;AACjB,aAAW,SAAS,QAAQ;AAC1B,YAAQ,KAAK,QAAQ,KAAK,EAAE,CAAC;AAC7B,YAAQ,KAAK,QAAQ,KAAK,EAAE,CAAC;AAAA,EAC/B;AAGA,QAAM,WAAW;AAAA,IACf,CAAC,WAAW;AACV,YAAM,UAAU,CAAC;AACjB,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,GAAG;AACtC,cAAM,QAAQ,OAAO,CAAC;AACtB,gBAAQ,KAAK,IAAI;AAAA,UACf,GAAG,OAAO,IAAI,CAAC;AAAA,UACf,GAAG,OAAO,IAAI,IAAI,CAAC;AAAA,UACnB,QAAQ,QAAQ,KAAK,EAAE;AAAA;AAAA,QAEzB;AAAA,MACF;AACA,aAAO,KAAK,SAAS,KAAK;AAAA,IAC5B;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAGA,QAAM,YAAY,SAAS;AAC3B,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,GAAG;AACtC,UAAM,QAAQ,OAAO,CAAC;AACtB,YAAQ,KAAK,EAAE,IAAI,UAAU,IAAI,CAAC;AAClC,YAAQ,KAAK,EAAE,IAAI,UAAU,IAAI,IAAI,CAAC;AAAA,EACxC;AAEA,SAAO;AACT;AAjDS;AAmDT,IAAM,QAAQ;AAUd,SAAS,0BAA0B,IAAI,IAAI,SAAS;AAElD,MAAI,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,MAAM,UAAU,OAAO;AACpE,WAAO,KAAK,IAAI,KAAK,EAAE;AAAA,EACzB;AAEA,SAAO,OAAO,CAACC,cAAa,cAAc,IAAI,IAAIA,SAAQ,IAAI,SAAS,GAAG,KAAK,EAAE;AACnF;AAPS;AAiBT,SAAS,gBAAgB,OAAO,aAAa,CAAC,GAAG;AAC/C,QAAM,WAAW,WAAW;AAC5B,QAAM,IAAI,MAAM,IAAI,CAAC,MAAM,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAE/C,WAAS,MAAM,KAAK;AAClB,WAAO,IAAI,KAAK,GAAG;AAAA,EACrB;AAFS;AAIT,MAAI,UAAU;AAGZ,UAAM,QAAQ,oBAAI,IAAI;AACtB,eAAW,QAAQ,GAAG;AACpB,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACzC,cAAM,KAAK,OAAO,KAAK,KAAK,CAAC,CAAC;AAC9B,cAAM,IAAI,IAAI,KAAK,QAAQ,MAAM,IAAI,EAAE,KAAK,EAAE;AAC9C,iBAAS,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AAC7C,gBAAM,KAAK,OAAO,KAAK,KAAK,CAAC,CAAC;AAC9B,gBAAM,KAAK,GAAG,EAAE,IAAI,EAAE;AACtB,gBAAM,KAAK,GAAG,EAAE,IAAI,EAAE;AACtB,gBAAM,IAAI,IAAI,KAAK,QAAQ,MAAM,IAAI,EAAE,KAAK,EAAE;AAC9C,gBAAM,IAAI,IAAI,KAAK,QAAQ,MAAM,IAAI,EAAE,KAAK,EAAE;AAAA,QAChD;AAAA,MACF;AAAA,IACF;AACA,eAAW,QAAQ,GAAG;AACpB,UAAI,KAAK,KAAK,SAAS,GAAG;AACxB,aAAK,OAAO,MAAM,IAAI,MAAM,KAAK,IAAI,CAAC;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAGA,QAAM,MAAM,CAAC;AAGb,QAAM,QAAQ,oBAAI,IAAI;AACtB,aAAW,QAAQ,GAAG;AACpB,QAAI,KAAK,KAAK,WAAW,GAAG;AAC1B,UAAI,KAAK,KAAK,KAAK,CAAC,CAAC;AAAA,IACvB,WAAW,KAAK,KAAK,WAAW,GAAG;AACjC,YAAM,IAAI,KAAK,KAAK,CAAC;AACrB,YAAM,IAAI,KAAK,KAAK,CAAC;AACrB,YAAM,IAAI,MAAM,KAAK,IAAI,CAAC;AAC1B,YAAM,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAAA,IACzB;AAAA,EACF;AAEA,MAAI,KAAK,CAAC,GAAG,MAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK,CAAG;AAElD,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACnC,UAAM,IAAI,IAAI,CAAC;AACf,aAAS,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACvC,YAAM,IAAI,IAAI,CAAC;AACf,UAAI,CAAC,MAAM,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;AAC7B,UAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AA5DS;AAqET,SAAS,oBAAoB,OAAO,MAAM,QAAQ;AAKhD,QAAM,YAAY,OAAO,KAAK,QAAQ,KAAK,MAAM;AAIjD,QAAM,cAAc,OAAO,KAAK,QAAQ,KAAK,MAAM;AAInD,QACG,OAAO,CAAC,MAAM,EAAE,KAAK,WAAW,CAAC,EACjC,QAAQ,CAAC,YAAY;AACpB,UAAM,OAAO,OAAO,QAAQ,KAAK,CAAC,CAAC;AACnC,UAAM,QAAQ,OAAO,QAAQ,KAAK,CAAC,CAAC;AACpC,UAAM,KAAK,KAAK,KAAK,KAAK,IAAI,EAAE,OAAO,KAAK,EAAE;AAC9C,UAAM,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE,OAAO,KAAK,EAAE;AAC/C,UAAMA,YAAW,0BAA0B,IAAI,IAAI,QAAQ,IAAI;AAE/D,cAAU,IAAI,EAAE,KAAK,IAAI,UAAU,KAAK,EAAE,IAAI,IAAIA;AAIlD,QAAI,IAAI;AACR,QAAI,QAAQ,OAAO,SAAS,KAAK,IAAI,KAAK,IAAI,EAAE,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG;AACvE,UAAI;AAAA,IACN,WAAW,QAAQ,QAAQ,OAAO;AAChC,UAAI;AAAA,IACN;AACA,gBAAY,IAAI,EAAE,KAAK,IAAI,YAAY,KAAK,EAAE,IAAI,IAAI;AAAA,EACxD,CAAC;AAEH,SAAO,EAAE,WAAW,YAAY;AAClC;AApCS;AAuCT,SAAS,uBAAuB,GAAG,SAAS,WAAW,aAAa;AAClE,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AACvC,YAAQ,CAAC,IAAI;AAAA,EACf;AAEA,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,EAAE,GAAG;AACzC,UAAM,KAAK,EAAE,IAAI,CAAC;AAClB,UAAM,KAAK,EAAE,IAAI,IAAI,CAAC;AACtB,aAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,EAAE,GAAG;AAC7C,YAAM,KAAK,EAAE,IAAI,CAAC;AAClB,YAAM,KAAK,EAAE,IAAI,IAAI,CAAC;AACtB,YAAM,MAAM,UAAU,CAAC,EAAE,CAAC;AAC1B,YAAM,aAAa,YAAY,CAAC,EAAE,CAAC;AAEnC,YAAM,mBAAmB,KAAK,OAAO,KAAK,OAAO,KAAK,OAAO,KAAK;AAClE,YAAMA,YAAW,KAAK,KAAK,eAAe;AAC1C,YAAM,QAAQ,kBAAkB,MAAM;AAEtC,UAAK,aAAa,KAAKA,aAAY,OAAS,aAAa,KAAKA,aAAY,KAAM;AAC9E;AAAA,MACF;AAEA,cAAQ,IAAI,QAAQ;AAEpB,cAAQ,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK;AACpC,cAAQ,IAAI,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK;AAExC,cAAQ,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK;AACpC,cAAQ,IAAI,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK;AAAA,IAC1C;AAAA,EACF;AACA,SAAO;AACT;AAjCS;AAuCT,SAAS,kBAAkB,OAAO,SAAS,CAAC,GAAG;AAC7C,MAAI,UAAU,aAAa,OAAO,MAAM;AACxC,QAAM,OAAO,OAAO,gBAAgB;AAMpC,MAAI,MAAM,UAAU,GAAG;AACrB,UAAM,cAAc,qBAAqB,OAAO,MAAM;AACtD,UAAM,kBAAkB,KAAK,aAAa,KAAK;AAC/C,UAAM,aAAa,KAAK,SAAS,KAAK;AAEtC,QAAI,kBAAkB,OAAO,YAAY;AACvC,gBAAU;AAAA,IACZ;AAAA,EACF;AACA,SAAO;AACT;AAlBS;AAyBT,SAAS,qBAAqB,OAAO,SAAS,CAAC,GAAG;AAChD,QAAM,WAAW,OAAO,YAAY;AAGpC,QAAM,OAAO,CAAC;AACd,QAAM,SAAS,CAAC;AAChB,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,KAAK,WAAW,GAAG;AAC1B,aAAO,KAAK,KAAK,CAAC,CAAC,IAAI,KAAK;AAC5B,WAAK,KAAK,IAAI;AAAA,IAChB;AAAA,EACF;AAEA,MAAI,EAAE,WAAW,YAAY,IAAI,oBAAoB,OAAO,MAAM,MAAM;AAIxE,QAAM,OAAO,MAAM,UAAU,IAAI,KAAK,CAAC,IAAI,UAAU;AACrD,cAAY,UAAU,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,UAAU,QAAQ,IAAI,CAAC;AAEnE,QAAM,MAAM,wBAAC,GAAG,YAAY,uBAAuB,GAAG,SAAS,WAAW,WAAW,GAAzE;AAEZ,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,UAAU,EAAE,GAAG;AACjC,UAAM,UAAU,MAAM,UAAU,SAAS,CAAC,EAAE,IAAI,KAAK,MAAM;AAE3D,UAAM,UAAU,kBAAkB,KAAK,SAAS,MAAM;AACtD,QAAI,CAAC,QAAQ,QAAQ,KAAK,KAAK,IAAI;AACjC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,YAAY,KAAK;AAIvB,QAAM,UAAU,CAAC;AACjB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AACpC,UAAM,MAAM,KAAK,CAAC;AAClB,YAAQ,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,MACrB,GAAG,UAAU,IAAI,CAAC,IAAI;AAAA,MACtB,GAAG,UAAU,IAAI,IAAI,CAAC,IAAI;AAAA,MAC1B,QAAQ,KAAK,KAAK,IAAI,OAAO,KAAK,EAAE;AAAA,IACtC;AAAA,EACF;AAEA,MAAI,OAAO,SAAS;AAClB,eAAW,KAAK,OAAO,SAAS;AAC9B,YAAM,EAAE,GAAG,IAAI;AAAA,IACjB;AAAA,EACF;AACA,SAAO;AACT;AApDS;AA6DT,SAAS,aAAa,OAAO,QAAQ;AACnC,QAAM,OAAO,UAAU,OAAO,eAAe,OAAO,eAAe;AAInE,QAAM,UAAU,CAAC;AAEjB,QAAM,cAAc,CAAC;AACrB,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,KAAK,WAAW,GAAG;AAC1B,YAAM,MAAM,KAAK,KAAK,CAAC;AACvB,cAAQ,GAAG,IAAI;AAAA,QACb,GAAG;AAAA,QACH,GAAG;AAAA,QACH,OAAO,QAAQ;AAAA,QACf,MAAM,KAAK;AAAA,QACX,QAAQ,KAAK,KAAK,KAAK,OAAO,KAAK,EAAE;AAAA,MACvC;AACA,kBAAY,GAAG,IAAI,CAAC;AAAA,IACtB;AAAA,EACF;AAEA,UAAQ,MAAM,OAAO,CAAC,MAAM,EAAE,KAAK,WAAW,CAAC;AAG/C,aAAW,WAAW,OAAO;AAC3B,QAAI,SAAS,QAAQ,UAAU,OAAO,QAAQ,SAAS;AACvD,UAAM,OAAO,QAAQ,KAAK,CAAC;AAC3B,UAAM,QAAQ,QAAQ,KAAK,CAAC;AAG5B,QAAI,QAAQ,OAAO,SAAS,KAAK,IAAI,QAAQ,IAAI,EAAE,MAAM,QAAQ,KAAK,EAAE,IAAI,GAAG;AAC7E,eAAS;AAAA,IACX;AAEA,gBAAY,IAAI,EAAE,KAAK,EAAE,KAAK,OAAO,MAAM,QAAQ,MAAM,OAAO,CAAC;AACjE,gBAAY,KAAK,EAAE,KAAK,EAAE,KAAK,MAAM,MAAM,QAAQ,MAAM,OAAO,CAAC;AAAA,EACnE;AAGA,QAAM,iBAAiB,CAAC;AACxB,SAAO,KAAK,WAAW,EAAE,QAAQ,CAAC,QAAQ;AACxC,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,YAAY,GAAG,EAAE,QAAQ,EAAE,GAAG;AAChD,cAAQ,YAAY,GAAG,EAAE,CAAC,EAAE,OAAO,YAAY,GAAG,EAAE,CAAC,EAAE;AAAA,IACzD;AAEA,mBAAe,KAAK,EAAE,KAAK,KAAK,CAAC;AAAA,EACnC,CAAC;AAGD,WAAS,UAAU,GAAG,GAAG;AACvB,WAAO,EAAE,OAAO,EAAE;AAAA,EACpB;AAFS;AAGT,iBAAe,KAAK,SAAS;AAG7B,QAAM,aAAa,CAAC;AACpB,WAAS,aAAa,SAAS;AAC7B,WAAO,QAAQ,OAAO;AAAA,EACxB;AAFS;AAST,WAAS,YAAY,OAAO,OAAO;AACjC,YAAQ,KAAK,EAAE,IAAI,MAAM;AACzB,YAAQ,KAAK,EAAE,IAAI,MAAM;AACzB,eAAW,KAAK,IAAI;AAAA,EACtB;AAJS;AAOT,cAAY,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,eAAe,CAAC,EAAE,GAAG;AAKjD,WAAS,IAAI,GAAG,IAAI,eAAe,QAAQ,EAAE,GAAG;AAC9C,UAAM,WAAW,eAAe,CAAC,EAAE;AACnC,UAAM,UAAU,YAAY,QAAQ,EAAE,OAAO,YAAY;AACzD,UAAM,MAAM,QAAQ,QAAQ;AAC5B,YAAQ,KAAK,SAAS;AAEtB,QAAI,QAAQ,WAAW,GAAG;AAExB,YAAM;AAAA,IACR;AAGA,UAAM,SAAS,CAAC;AAChB,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AAEvC,YAAM,KAAK,QAAQ,QAAQ,CAAC,EAAE,GAAG;AACjC,YAAM,KAAK,0BAA0B,IAAI,QAAQ,GAAG,QAAQ,QAAQ,CAAC,EAAE,IAAI;AAG3E,aAAO,KAAK,EAAE,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;AACrC,aAAO,KAAK,EAAE,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;AACrC,aAAO,KAAK,EAAE,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;AACrC,aAAO,KAAK,EAAE,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;AAIrC,eAAS,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AAC3C,cAAM,KAAK,QAAQ,QAAQ,CAAC,EAAE,GAAG;AACjC,cAAM,KAAK,0BAA0B,IAAI,QAAQ,GAAG,QAAQ,QAAQ,CAAC,EAAE,IAAI;AAE3E,cAAM,cAAc;AAAA,UAClB,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,QAAQ,GAAG;AAAA,UAC/B,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,QAAQ,GAAG;AAAA,QACjC;AACA,eAAO,KAAK,GAAG,WAAW;AAAA,MAC5B;AAAA,IACF;AAIA,QAAI,WAAW;AACf,QAAI,YAAY,OAAO,CAAC;AACxB,eAAW,SAAS,QAAQ;AAC1B,cAAQ,QAAQ,EAAE,IAAI,MAAM;AAC5B,cAAQ,QAAQ,EAAE,IAAI,MAAM;AAC5B,YAAM,YAAY,KAAK,SAAS,KAAK;AACrC,UAAI,YAAY,UAAU;AACxB,mBAAW;AACX,oBAAY;AAAA,MACd;AAAA,IACF;AAEA,gBAAY,WAAW,QAAQ;AAAA,EACjC;AAEA,SAAO;AACT;AAvIS;AAiJT,SAAS,aAAa,SAAS,UAAU;AACvC,MAAI,SAAS;AAEb,aAAW,QAAQ,UAAU;AAC3B,QAAI,KAAK,KAAK,WAAW,GAAG;AAC1B;AAAA,IACF;AAEA,QAAI;AACJ,QAAI,KAAK,KAAK,WAAW,GAAG;AAC1B,YAAM,OAAO,QAAQ,KAAK,KAAK,CAAC,CAAC;AACjC,YAAM,QAAQ,QAAQ,KAAK,KAAK,CAAC,CAAC;AAClC,gBAAU,cAAc,KAAK,QAAQ,MAAM,QAAQ,SAAS,MAAM,KAAK,CAAC;AAAA,IAC1E,OAAO;AACL,gBAAU,iBAAiB,KAAK,KAAK,IAAI,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,IAC7D;AAEA,UAAM,SAAS,KAAK,UAAU,OAAO,KAAK,SAAS;AACnD,cAAU,UAAU,UAAU,KAAK,SAAS,UAAU,KAAK;AAAA,EAC7D;AAEA,SAAO;AACT;AAtBS;AAwBT,SAAS,qBAAqB,SAAS,UAAU;AAC/C,MAAI,SAAS;AAEb,aAAW,QAAQ,UAAU;AAC3B,QAAI,KAAK,KAAK,WAAW,GAAG;AAC1B;AAAA,IACF;AAEA,QAAI;AACJ,QAAI,KAAK,KAAK,WAAW,GAAG;AAC1B,YAAM,OAAO,QAAQ,KAAK,KAAK,CAAC,CAAC;AACjC,YAAM,QAAQ,QAAQ,KAAK,KAAK,CAAC,CAAC;AAClC,gBAAU,cAAc,KAAK,QAAQ,MAAM,QAAQ,SAAS,MAAM,KAAK,CAAC;AAAA,IAC1E,OAAO;AACL,gBAAU,iBAAiB,KAAK,KAAK,IAAI,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,IAC7D;AAEA,UAAM,SAAS,KAAK,UAAU,OAAO,KAAK,SAAS;AACnD,UAAM,sBAAsB,KAAK,KAAK,UAAU,MAAM,KAAK,OAAO,EAAE;AACpE,cAAU,SAAS,sBAAsB;AAAA,EAC3C;AAEA,SAAO;AACT;AAvBS;AA+BT,SAAS,iBAAiB,SAAS,aAAa,kBAAkB;AAChE,MAAI,oBAAoB,MAAM;AAC5B,YAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAAA,EAC5C,OAAO;AACL,YAAQ,KAAK,gBAAgB;AAAA,EAC/B;AAGA,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,WAAW,QAAQ,CAAC,EAAE;AAC5B,UAAM,WAAW,QAAQ,CAAC,EAAE;AAE5B,eAAW,UAAU,SAAS;AAC5B,aAAO,KAAK;AACZ,aAAO,KAAK;AAAA,IACd;AAAA,EACF;AAEA,MAAI,QAAQ,WAAW,GAAG;AAGxB,UAAM,OAAO,SAAS,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC;AAC5C,QAAI,OAAO,KAAK,IAAI,QAAQ,CAAC,EAAE,SAAS,QAAQ,CAAC,EAAE,MAAM,GAAG;AAC1D,cAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,EAAE,SAAS,QAAQ,CAAC,EAAE,SAAS;AACtE,cAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,EAAE;AAAA,IAC5B;AAAA,EACF;AAIA,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,WAAW,KAAK,MAAM,QAAQ,CAAC,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,IAAI;AAC1D,UAAM,IAAI,KAAK,IAAI,QAAQ;AAC3B,UAAM,IAAI,KAAK,IAAI,QAAQ;AAE3B,eAAW,UAAU,SAAS;AAC5B,YAAM,IAAI,OAAO;AACjB,YAAM,IAAI,OAAO;AACjB,aAAO,IAAI,IAAI,IAAI,IAAI;AACvB,aAAO,IAAI,IAAI,IAAI,IAAI;AAAA,IACzB;AAAA,EACF;AAIA,MAAI,QAAQ,SAAS,GAAG;AACtB,QAAI,QAAQ,KAAK,MAAM,QAAQ,CAAC,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,IAAI;AACrD,WAAO,QAAQ,GAAG;AAChB,eAAS,IAAI,KAAK;AAAA,IACpB;AACA,WAAO,QAAQ,IAAI,KAAK,IAAI;AAC1B,eAAS,IAAI,KAAK;AAAA,IACpB;AACA,QAAI,QAAQ,KAAK,IAAI;AACnB,YAAM,QAAQ,QAAQ,CAAC,EAAE,KAAK,QAAQ,QAAQ,CAAC,EAAE;AACjD,iBAAW,UAAU,SAAS;AAC5B,YAAI,KAAK,OAAO,IAAI,QAAQ,OAAO,MAAM,IAAI,QAAQ;AACrD,eAAO,IAAI,IAAI,IAAI,OAAO;AAC1B,eAAO,IAAI,IAAI,IAAI,QAAQ,OAAO;AAAA,MACpC;AAAA,IACF;AAAA,EACF;AACF;AA9DS;AAqET,SAAS,gBAAgB,SAAS;AAEhC,UAAQ,QAAQ,CAAC,WAAW;AAC1B,WAAO,SAAS;AAAA,EAClB,CAAC;AAGD,WAAS,KAAK,QAAQ;AACpB,QAAI,OAAO,WAAW,QAAQ;AAC5B,aAAO,SAAS,KAAK,OAAO,MAAM;AAAA,IACpC;AACA,WAAO,OAAO;AAAA,EAChB;AALS;AAOT,WAAS,MAAM,GAAG,GAAG;AACnB,UAAM,QAAQ,KAAK,CAAC;AACpB,UAAM,QAAQ,KAAK,CAAC;AACpB,UAAM,SAAS;AAAA,EACjB;AAJS;AAOT,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AACvC,aAAS,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AAC3C,YAAM,cAAc,QAAQ,CAAC,EAAE,SAAS,QAAQ,CAAC,EAAE;AACnD,UAAI,SAAS,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,QAAQ,aAAa;AAC1D,cAAM,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AAIA,QAAM,mBAAmB,oBAAI,IAAI;AACjC,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AACvC,UAAM,QAAQ,KAAK,QAAQ,CAAC,CAAC,EAAE,OAAO;AACtC,QAAI,CAAC,iBAAiB,IAAI,KAAK,GAAG;AAChC,uBAAiB,IAAI,OAAO,CAAC,CAAC;AAAA,IAChC;AACA,qBAAiB,IAAI,KAAK,EAAE,KAAK,QAAQ,CAAC,CAAC;AAAA,EAC7C;AAGA,UAAQ,QAAQ,CAAC,WAAW;AAC1B,WAAO,OAAO;AAAA,EAChB,CAAC;AAGD,SAAO,MAAM,KAAK,iBAAiB,OAAO,CAAC;AAC7C;AAhDS;AAsDT,SAAS,eAAe,SAAS;AAC/B,QAAM,SAAS,wBAAC,MAAM;AACpB,UAAM,KAAK,QAAQ,OAAO,CAAC,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,iBAAiB;AAC9F,UAAM,KAAK,QAAQ,OAAO,CAAC,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,iBAAiB;AAC9F,WAAO,EAAE,KAAK,IAAI,KAAK,GAAG;AAAA,EAC5B,GAJe;AAKf,SAAO,EAAE,QAAQ,OAAO,GAAG,GAAG,QAAQ,OAAO,GAAG,EAAE;AACpD;AAPS;AAgBT,SAAS,kBAAkB,UAAU,aAAa,kBAAkB;AAClE,MAAI,eAAe,MAAM;AACvB,kBAAc,KAAK,KAAK;AAAA,EAC1B;AAIA,MAAI,UAAU,mBAAmB,QAAQ,EAAE,IAAI,CAAC,MAAM,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAG1E,QAAM,WAAW,gBAAgB,OAAO;AAGxC,aAAW,WAAW,UAAU;AAC9B,qBAAiB,SAAS,aAAa,gBAAgB;AACvD,UAAM,SAAS,eAAe,OAAO;AACrC,YAAQ,QAAQ,OAAO,OAAO,MAAM,OAAO,OAAO,QAAQ,OAAO,OAAO,MAAM,OAAO,OAAO;AAC5F,YAAQ,SAAS;AAAA,EACnB;AACA,WAAS,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AAGvC,YAAU,SAAS,CAAC;AACpB,MAAI,eAAe,QAAQ;AAC3B,QAAM,WAAW,aAAa,OAAO,MAAM,aAAa,OAAO,OAAO;AAOtE,WAAS,WAAW,SAAS,OAAO,QAAQ;AAC1C,QAAI,CAAC,SAAS;AACZ;AAAA,IACF;AAEA,UAAM,SAAS,QAAQ;AAEvB,QAAI;AAEJ,QAAI;AAEJ,QAAI,OAAO;AACT,gBAAU,aAAa,OAAO,MAAM,OAAO,OAAO,MAAM;AAAA,IAC1D,OAAO;AACL,gBAAU,aAAa,OAAO,MAAM,OAAO,OAAO;AAClD,YAAM,aACH,OAAO,OAAO,MAAM,OAAO,OAAO,OAAO,KAAK,aAAa,OAAO,MAAM,aAAa,OAAO,OAAO;AACtG,UAAI,YAAY,GAAG;AACjB,mBAAW;AAAA,MACb;AAAA,IACF;AAEA,QAAI,QAAQ;AACV,gBAAU,aAAa,OAAO,MAAM,OAAO,OAAO,MAAM;AAAA,IAC1D,OAAO;AACL,gBAAU,aAAa,OAAO,MAAM,OAAO,OAAO;AAClD,YAAM,aACH,OAAO,OAAO,MAAM,OAAO,OAAO,OAAO,KAAK,aAAa,OAAO,MAAM,aAAa,OAAO,OAAO;AACtG,UAAI,YAAY,GAAG;AACjB,mBAAW;AAAA,MACb;AAAA,IACF;AAEA,eAAW,KAAK,SAAS;AACvB,QAAE,KAAK;AACP,QAAE,KAAK;AACP,cAAQ,KAAK,CAAC;AAAA,IAChB;AAAA,EACF;AAtCS;AAwCT,MAAI,QAAQ;AACZ,SAAO,QAAQ,SAAS,QAAQ;AAC9B,eAAW,SAAS,KAAK,GAAG,MAAM,KAAK;AACvC,eAAW,SAAS,QAAQ,CAAC,GAAG,OAAO,IAAI;AAC3C,eAAW,SAAS,QAAQ,CAAC,GAAG,MAAM,IAAI;AAC1C,aAAS;AAIT,mBAAe,eAAe,OAAO;AAAA,EACvC;AAGA,SAAO,iBAAiB,OAAO;AACjC;AArFS;AAmGT,SAAS,cAAc,UAAU,OAAO,QAAQ,SAAS,YAAY;AACnE,QAAM,UAAU,mBAAmB,QAAQ;AAE3C,WAAS,IAAI;AACb,YAAU,IAAI;AAEd,QAAM,EAAE,QAAQ,OAAO,IAAI,eAAe,OAAO;AAEjD,MAAI,OAAO,QAAQ,OAAO,OAAO,OAAO,QAAQ,OAAO,KAAK;AAC1D,YAAQ,IAAI,0CAA0C;AACtD,WAAO;AAAA,EACT;AAGA,MAAI;AAEJ,MAAI;AACJ,MAAI,YAAY;AACd,UAAM,kBAAkB,KAAK,KAAK,aAAa,KAAK,EAAE,IAAI;AAC1D,eAAW,QAAQ;AACnB,eAAW,SAAS;AAAA,EACtB,OAAO;AACL,eAAW,SAAS,OAAO,MAAM,OAAO;AACxC,eAAW,UAAU,OAAO,MAAM,OAAO;AAAA,EAC3C;AAEA,QAAM,UAAU,KAAK,IAAI,UAAU,QAAQ;AAE3C,QAAM,WAAW,SAAS,OAAO,MAAM,OAAO,OAAO,WAAW;AAChE,QAAM,WAAW,UAAU,OAAO,MAAM,OAAO,OAAO,WAAW;AAEjE,SAAO;AAAA,IACL,QAAQ,IAAI,CAAC,YAAY;AAAA,MACvB,QAAQ,UAAU,OAAO;AAAA,MACzB,GAAG,UAAU,WAAW,OAAO,IAAI,OAAO,OAAO;AAAA,MACjD,GAAG,UAAU,WAAW,OAAO,IAAI,OAAO,OAAO;AAAA,MACjD,OAAO,OAAO;AAAA,IAChB,EAAE;AAAA,EACJ;AACF;AAvCS;AA6CT,SAAS,iBAAiB,SAAS;AAEjC,QAAM,IAAI,CAAC;AACX,aAAW,UAAU,SAAS;AAC5B,MAAE,OAAO,KAAK,IAAI;AAAA,EACpB;AACA,SAAO;AACT;AAPS;AAYT,SAAS,mBAAmB,UAAU;AACpC,QAAM,SAAS,OAAO,KAAK,QAAQ;AACnC,SAAO,OAAO,IAAI,CAAC,OAAO,OAAO,OAAO,SAAS,EAAE,GAAG,EAAE,OAAO,GAAG,CAAC,CAAC;AACtE;AAHS;AAoBT,SAAS,YAAY,UAAU,CAAC,GAAG;AACjC,MAAI,aAAa,OACf,QAAQ,KACR,SAAS,KACT,UAAU,IACV,WAAW,KACX,cAAc,KAAK,KAAK,GACxB,YAAY,MACZ,aAAa,MACb,OAAO,MACP,SAAS,MACT,WAAW,MACX,mBAAmB,MACnB,WAAW,OACX,QAAQ,MACR,wBAAwB,WAAW,QAAQ,wBAAwB,QAAQ,wBAAwB,OAGnG,YAAY,CAAC,GAIb,eACE,WAAW,QAAQ,eACf,QAAQ,eACR,WAAW,QAAQ,cACjB,QAAQ,cACR;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,GACR,cAAc,GACd,UAAU,gCAAU,KAAK;AACvB,QAAI,OAAO,WAAW;AACpB,aAAO,UAAU,GAAG;AAAA,IACtB;AACA,QAAI,MAAO,UAAU,GAAG,IAAI,aAAa,WAAW;AACpD,mBAAe;AACf,QAAI,eAAe,aAAa,QAAQ;AACtC,oBAAc;AAAA,IAChB;AACA,WAAO;AAAA,EACT,GAVU,YAWV,iBAAiB,MACjB,OAAO;AAET,WAAS,MAAM,WAAW;AACxB,QAAI,OAAO,UAAU,MAAM;AAG3B,UAAM,WAAW,oBAAI,IAAI;AACzB,SAAK,QAAQ,CAAC,UAAU;AACtB,UAAI,MAAM,QAAQ,KAAK,MAAM,KAAK,UAAU,GAAG;AAC7C,iBAAS,IAAI,MAAM,KAAK,CAAC,CAAC;AAAA,MAC5B;AAAA,IACF,CAAC;AACD,WAAO,KAAK,OAAO,CAAC,UAAU,CAAC,MAAM,KAAK,KAAK,CAAC,QAAQ,SAAS,IAAI,GAAG,CAAC,CAAC;AAE1E,QAAI,UAAU,CAAC;AACf,QAAI,cAAc,CAAC;AAEnB,QAAI,KAAK,SAAS,GAAG;AACnB,UAAI,WAAW,eAAe,MAAM,EAAE,cAAc,MAAM,SAAS,CAAC;AAEpE,UAAI,WAAW;AACb,mBAAW,kBAAkB,UAAU,aAAa,gBAAgB;AAAA,MACtE;AAEA,gBAAU,cAAc,UAAU,OAAO,QAAQ,SAAS,UAAU;AACpE,oBAAc,mBAAmB,SAAS,MAAM,qBAAqB;AAAA,IACvE;AAIA,UAAM,SAAS,CAAC;AAChB,SAAK,QAAQ,CAAC,UAAU;AACtB,UAAI,MAAM,OAAO;AACf,eAAO,MAAM,IAAI,IAAI,MAAM;AAAA,MAC7B;AAAA,IACF,CAAC;AAED,aAAS,MAAM,GAAG;AAChB,UAAI,EAAE,QAAQ,QAAQ;AACpB,eAAO,OAAO,EAAE,IAAI;AAAA,MACtB;AACA,UAAI,EAAE,KAAK,UAAU,GAAG;AACtB,eAAO,KAAK,EAAE,KAAK,CAAC;AAAA,MACtB;AAAA,IACF;AAPS;AAUT,cAAU,UAAU,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,OAAO,KAAK;AAE/D,UAAM,MAAM,UAAU,OAAO,KAAK;AAElC,QAAI,YAAY;AACd,UAAI,KAAK,WAAW,OAAO,KAAK,IAAI,MAAM,EAAE;AAAA,IAC9C,OAAO;AACL,UAAI,KAAK,SAAS,KAAK,EAAE,KAAK,UAAU,MAAM;AAAA,IAChD;AAIA,UAAM,WAAW,CAAC;AAClB,QAAI,cAAc;AAClB,QAAI,UAAU,iBAAiB,EAAE,KAAK,SAAU,GAAG;AACjD,YAAM,OAAO,KAAK,aAAa,GAAG;AAClC,UAAI,EAAE,KAAK,UAAU,KAAK,QAAQ,CAAC,UAAU;AAC3C,sBAAc;AACd,iBAAS,EAAE,KAAK,CAAC,CAAC,IAAI,eAAe,IAAI;AAAA,MAC3C;AAAA,IACF,CAAC;AAGD,aAAS,UAAU,GAAG;AACpB,aAAO,CAAC,MAAM;AACZ,cAAM,IAAI,EAAE,KAAK,IAAI,CAAC,QAAQ;AAC5B,cAAI,QAAQ,SAAS,GAAG;AACxB,cAAI,MAAM,QAAQ,GAAG;AACrB,cAAI,CAAC,OAAO;AACV,oBAAQ,EAAE,GAAG,QAAQ,GAAG,GAAG,SAAS,GAAG,QAAQ,EAAE;AAAA,UACnD;AACA,cAAI,CAAC,KAAK;AACR,kBAAM,EAAE,GAAG,QAAQ,GAAG,GAAG,SAAS,GAAG,QAAQ,EAAE;AAAA,UACjD;AACA,iBAAO;AAAA,YACL,GAAG,MAAM,KAAK,IAAI,KAAK,IAAI,IAAI;AAAA,YAC/B,GAAG,MAAM,KAAK,IAAI,KAAK,IAAI,IAAI;AAAA,YAC/B,QAAQ,MAAM,UAAU,IAAI,KAAK,IAAI,SAAS;AAAA,UAChD;AAAA,QACF,CAAC;AACD,eAAO,qBAAqB,GAAG,KAAK;AAAA,MACtC;AAAA,IACF;AAnBS;AAsBT,UAAM,QAAQ,IAAI,UAAU,YAAY,EAAE,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI;AAGlE,UAAM,QAAQ,MACX,MAAM,EACN,OAAO,GAAG,EACV;AAAA,MACC;AAAA,MACA,CAAC,MACC,kBAAkB,EAAE,KAAK,UAAU,IAAI,WAAW,cAAc,GAC9D,EAAE,UAAU,EAAE,QAAQ,mBAAmB,EAC3C;AAAA,IACJ,EACC,KAAK,kBAAkB,CAAC,MAAM,EAAE,KAAK,KAAK,GAAG,CAAC;AAEjD,UAAM,YAAY,MAAM,OAAO,MAAM;AACrC,UAAM,YAAY,MACf,OAAO,MAAM,EACb,KAAK,SAAS,OAAO,EACrB,KAAK,CAAC,MAAM,MAAM,CAAC,CAAC,EACpB,KAAK,eAAe,QAAQ,EAC5B,KAAK,MAAM,OAAO,EAClB,KAAK,KAAK,QAAQ,CAAC,EACnB,KAAK,KAAK,SAAS,CAAC;AAGvB,QAAI,QAAQ;AACV,gBACG,MAAM,gBAAgB,GAAG,EACzB,OAAO,CAAC,MAAM,EAAE,KAAK,UAAU,CAAC,EAChC,MAAM,QAAQ,CAAC,MAAO,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,QAAQ,EAAE,IAAI,CAAE,EAChF,MAAM,gBAAgB,KAAK;AAE9B,gBAAU,MAAM,QAAQ,CAAC,MAAM;AAC7B,YAAI,EAAE,UAAU,EAAE,OAAO;AACvB,iBAAO;AAAA,QACT;AACA,YAAI,QAAQ,UAAU;AACpB,iBAAO,QAAQ;AAAA,QACjB;AACA,eAAO,EAAE,KAAK,UAAU,IAAI,QAAQ,EAAE,IAAI,IAAI;AAAA,MAChD,CAAC;AAAA,IACH;AAEA,aAAS,aAAa,GAAG;AACvB,UAAI,OAAO,EAAE,eAAe,YAAY;AACtC,eAAO,EAAE,WAAW,MAAM,EAAE,SAAS,QAAQ;AAAA,MAC/C;AACA,aAAO;AAAA,IACT;AALS;AAQT,QAAI,SAAS;AACb,QAAI,eAAe,OAAO,OAAO,eAAe,YAAY;AAC1D,eAAS,aAAa,SAAS;AAC/B,aAAO,UAAU,MAAM,EAAE,UAAU,KAAK,SAAS;AAAA,IACnD,OAAO;AACL,aAAO,UAAU,MAAM,EAAE,KAAK,KAAK,CAAC,MAAM,qBAAqB,EAAE,KAAK,IAAI,CAAC,QAAQ,QAAQ,GAAG,CAAC,CAAC,GAAG,KAAK;AAAA,IAC1G;AAEA,UAAM,aAAa,OAChB,UAAU,MAAM,EAChB,OAAO,CAAC,MAAM,EAAE,QAAQ,WAAW,EACnC,KAAK,CAAC,MAAM,MAAM,CAAC,CAAC,EACpB,KAAK,KAAK,CAAC,MAAM,KAAK,MAAM,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC,EAClD,KAAK,KAAK,CAAC,MAAM,KAAK,MAAM,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;AAErD,QAAI,MAAM;AACR,UAAI,aAAa;AAGf,YAAI,QAAQ,YAAY;AACtB,qBAAW,GAAG,OAAO,SAAS,SAAS,KAAK,CAAC;AAAA,QAC/C,OAAO;AACL,qBAAW,KAAK,OAAO,SAAS,SAAS,KAAK,CAAC;AAAA,QACjD;AAAA,MACF,OAAO;AACL,mBAAW,KAAK,SAAS,SAAS,KAAK,CAAC;AAAA,MAC1C;AAAA,IACF;AAGA,UAAM,OAAO,aAAa,MAAM,KAAK,CAAC,EAAE,OAAO;AAC/C,QAAI,OAAO,MAAM,eAAe,YAAY;AAC1C,WAAK,UAAU,MAAM,EAAE,UAAU,KAAK,SAAS;AAAA,IACjD;AAEA,UAAM,WAAW,KACd,UAAU,MAAM,EAChB,KAAK,KAAK,QAAQ,CAAC,EACnB,KAAK,KAAK,SAAS,CAAC;AAIvB,QAAI,aAAa,MAAM;AACrB,gBAAU,MAAM,aAAa,KAAK;AAClC,iBAAW,MAAM,aAAa,QAAQ;AACtC,eAAS,MAAM,aAAa,KAAK;AAAA,IACnC;AAEA,WAAO,EAAE,SAAS,aAAa,OAAO,OAAO,QAAQ,KAAK;AAAA,EAC5D;AA/LS;AAiMT,QAAM,OAAO,SAAU,GAAG;AACxB,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,WAAO;AACP,WAAO;AAAA,EACT;AAEA,QAAM,aAAa,WAAY;AAC7B,iBAAa;AACb,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,SAAU,GAAG;AACzB,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,YAAQ;AACR,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,SAAU,GAAG;AAC1B,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,aAAS;AACT,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,SAAU,GAAG;AAC3B,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,cAAU;AACV,WAAO;AAAA,EACT;AAEA,QAAM,WAAW,SAAU,GAAG;AAC5B,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,eAAW;AACX,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,SAAU,GAAG;AAC3B,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,cAAU;AACV,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,SAAU,GAAG;AAC1B,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,cAAU;AACV,WAAO;AAAA,EACT;AAEA,QAAM,WAAW,SAAU,GAAG;AAC5B,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,eAAW;AACX,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,SAAU,GAAG;AACzB,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,YAAQ;AACR,WAAO;AAAA,EACT;AAEA,QAAM,WAAW,SAAU,GAAG;AAC5B,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,eAAW;AACX,WAAO;AAAA,EACT;AAEA,QAAM,iBAAiB,SAAU,GAAG;AAClC,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,qBAAiB;AACjB,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,SAAU,GAAG;AAC7B,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,gBAAY;AACZ,WAAO;AAAA,EACT;AAEA,QAAM,aAAa,SAAU,GAAG;AAC9B,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,iBAAa;AACb,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,SAAU,GAAG;AAC1B,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,aAAS;AACT,WAAO;AAAA,EACT;AAEA,QAAM,cAAc,SAAU,GAAG;AAC/B,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,kBAAc;AACd,WAAO;AAAA,EACT;AAEA,QAAM,mBAAmB,SAAU,GAAG;AACpC,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,uBAAmB;AACnB,WAAO;AAAA,EACT;AAEA,QAAM,eAAe,SAAU,GAAG;AAChC,QAAI,CAAC,UAAU,OAAQ,QAAO;AAC9B,WAAO,MAAM,YAAY,eAAe,MAAM,aAAa,uBAAuB;AAClF,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAnWS;AA4WT,SAAS,SAAS,SAAS,UAAU;AACnC,SAAO,SAAU,MAAM;AACrB,UAAM,OAAO;AACb,UAAM,QAAQ,QAAQ,KAAK,KAAK,CAAC,CAAC,EAAE,UAAU;AAC9C,UAAM,QAAQ,SAAS,IAAI,KAAK;AAEhC,UAAM,QAAQ,MAAM,MAAM,KAAK,EAAE,QAAQ;AACzC,UAAM,WAAW;AACjB,UAAM,YAAY,MAAM,SAAS,MAAM,UAAU;AAEjD,QAAI,OAAO,MAAM,IAAI;AACrB,QAAI,OAAO,CAAC,IAAI;AAChB,QAAI,aAAa;AACjB,UAAM,aAAa;AACnB,SAAK,cAAc;AACnB,UAAM,SAAS,CAAC;AAEhB,aAAS,OAAOC,OAAM;AACpB,YAAMC,SAAQ,KAAK,cAAc,gBAAgB,KAAK,cAAc,OAAO;AAC3E,MAAAA,OAAM,cAAcD;AACpB,aAAO,KAAKC,MAAK;AACjB,WAAK,OAAOA,MAAK;AACjB,aAAOA;AAAA,IACT;AANS;AAOT,QAAI,QAAQ,OAAO,IAAI;AAEvB,WAAO,MAAM;AACX,aAAO,MAAM,IAAI;AACjB,UAAI,CAAC,MAAM;AACT;AAAA,MACF;AACA,WAAK,KAAK,IAAI;AACd,YAAM,SAAS,KAAK,KAAK,GAAG;AAC5B,YAAM,cAAc;AACpB,UAAI,OAAO,SAAS,YAAY,MAAM,sBAAsB,IAAI,OAAO;AACrE,aAAK,IAAI;AACT,cAAM,cAAc,KAAK,KAAK,GAAG;AACjC,eAAO,CAAC,IAAI;AACZ,gBAAQ,OAAO,IAAI;AACnB;AAAA,MACF;AAAA,IACF;AAEA,UAAM,UAAU,OAAQ,aAAa,aAAc;AACnD,UAAM,IAAI,KAAK,aAAa,GAAG;AAC/B,UAAM,IAAI,KAAK,aAAa,GAAG;AAC/B,WAAO,QAAQ,CAAC,GAAG,MAAM;AACvB,QAAE,aAAa,KAAK,CAAC;AACrB,QAAE,aAAa,KAAK,CAAC;AACrB,QAAE,aAAa,MAAM,GAAG,UAAU,IAAI,UAAU,IAAI;AAAA,IACtD,CAAC;AAAA,EACH;AACF;AApDS;AA6DT,SAAS,aAAa,SAAS,UAAU,UAAU;AACjD,MAAI,SAAS,SAAS,CAAC,EAAE,SAAS,SAAS,SAAS,CAAC,GAAG,OAAO;AAE/D,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,EAAE,GAAG;AACxC,UAAM,IAAI,SAAS,CAAC,EAAE,SAAS,SAAS,SAAS,CAAC,GAAG,OAAO;AAC5D,QAAI,KAAK,QAAQ;AACf,eAAS;AAAA,IACX;AAAA,EACF;AAEA,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,EAAE,GAAG;AACxC,UAAM,IAAI,SAAS,SAAS,CAAC,GAAG,OAAO,IAAI,SAAS,CAAC,EAAE;AACvD,QAAI,KAAK,QAAQ;AACf,eAAS;AAAA,IACX;AAAA,EACF;AACA,SAAO;AACT;AAjBS;AA4BT,SAAS,kBAAkB,UAAU,UAAU,uBAAuB;AAIpE,QAAM,SAAS,CAAC;AAChB,aAAW,KAAK,UAAU;AACxB,WAAO,KAAK,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,CAAC;AAC9B,WAAO,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,GAAG,GAAG,EAAE,EAAE,CAAC;AAC7C,WAAO,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,GAAG,GAAG,EAAE,EAAE,CAAC;AAC7C,WAAO,KAAK,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;AAC7C,WAAO,KAAK,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;AAAA,EAC/C;AAEA,MAAI,UAAU,OAAO,CAAC;AACtB,MAAI,SAAS,aAAa,OAAO,CAAC,GAAG,UAAU,QAAQ;AAEvD,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,GAAG;AACtC,UAAM,IAAI,aAAa,OAAO,CAAC,GAAG,UAAU,QAAQ;AACpD,QAAI,KAAK,QAAQ;AACf,gBAAU,OAAO,CAAC;AAClB,eAAS;AAAA,IACX;AAAA,EACF;AAGA,QAAM,WAAW;AAAA,IACf,CAAC,MAAM,KAAK,aAAa,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,GAAG,UAAU,QAAQ;AAAA,IACjE,CAAC,QAAQ,GAAG,QAAQ,CAAC;AAAA,IACrB,EAAE,eAAe,KAAK,eAAe,MAAM;AAAA,EAC7C,EAAE;AAEF,QAAM,MAAM,EAAE,GAAG,wBAAwB,IAAI,SAAS,CAAC,GAAG,GAAG,SAAS,CAAC,EAAE;AAIzE,MAAI,QAAQ;AACZ,aAAW,KAAK,UAAU;AACxB,QAAI,SAAS,KAAK,CAAC,IAAI,EAAE,QAAQ;AAC/B,cAAQ;AACR;AAAA,IACF;AAAA,EACF;AAEA,aAAW,KAAK,UAAU;AACxB,QAAI,SAAS,KAAK,CAAC,IAAI,EAAE,QAAQ;AAC/B,cAAQ;AACR;AAAA,IACF;AAAA,EACF;AACA,MAAI,OAAO;AACT,WAAO;AAAA,EACT;AAEA,MAAI,SAAS,UAAU,GAAG;AACxB,WAAO,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,GAAG,SAAS,CAAC,EAAE,EAAE;AAAA,EAC9C;AACA,QAAM,YAAY,CAAC;AACnB,mBAAiB,UAAU,SAAS;AAEpC,MAAI,UAAU,KAAK,WAAW,GAAG;AAC/B,WAAO,EAAE,GAAG,GAAG,GAAG,MAAO,UAAU,KAAK;AAAA,EAC1C;AACA,MAAI,UAAU,KAAK,UAAU,GAAG;AAC9B,WAAO,EAAE,GAAG,UAAU,KAAK,CAAC,EAAE,OAAO,GAAG,GAAG,UAAU,KAAK,CAAC,EAAE,OAAO,EAAE;AAAA,EACxE;AACA,MAAI,SAAS,QAAQ;AAEnB,WAAO,kBAAkB,UAAU,CAAC,CAAC;AAAA,EACvC;AAKA,SAAO,UAAU,UAAU,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAClD;AA1ES;AA8ET,SAAS,sBAAsB,SAAS;AACtC,QAAM,MAAM,CAAC;AACb,QAAM,YAAY,OAAO,KAAK,OAAO;AACrC,aAAW,YAAY,WAAW;AAChC,QAAI,QAAQ,IAAI,CAAC;AAAA,EACnB;AACA,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,UAAM,KAAK,UAAU,CAAC;AACtB,UAAM,IAAI,QAAQ,EAAE;AACpB,aAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,EAAE,GAAG;AAC7C,YAAM,KAAK,UAAU,CAAC;AACtB,YAAM,IAAI,QAAQ,EAAE;AACpB,YAAM,IAAI,SAAS,GAAG,CAAC;AAEvB,UAAI,IAAI,EAAE,UAAU,EAAE,SAAS,OAAO;AACpC,YAAI,EAAE,EAAE,KAAK,EAAE;AAAA,MACjB,WAAW,IAAI,EAAE,UAAU,EAAE,SAAS,OAAO;AAC3C,YAAI,EAAE,EAAE,KAAK,EAAE;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAtBS;AAwBT,SAAS,mBAAmB,SAAS,OAAO,uBAAuB;AACjE,QAAM,MAAM,CAAC;AACb,QAAM,aAAa,sBAAsB,OAAO;AAChD,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;AACrC,UAAM,OAAO,MAAM,CAAC,EAAE;AACtB,UAAM,UAAU,CAAC;AACjB,UAAM,UAAU,CAAC;AAEjB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AACpC,cAAQ,KAAK,CAAC,CAAC,IAAI;AACnB,YAAM,WAAW,WAAW,KAAK,CAAC,CAAC;AAInC,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,EAAE,GAAG;AACxC,gBAAQ,SAAS,CAAC,CAAC,IAAI;AAAA,MACzB;AAAA,IACF;AAEA,UAAM,WAAW,CAAC;AAClB,UAAM,WAAW,CAAC;AAClB,aAAS,SAAS,SAAS;AACzB,UAAI,SAAS,SAAS;AACpB,iBAAS,KAAK,QAAQ,KAAK,CAAC;AAAA,MAC9B,WAAW,EAAE,SAAS,UAAU;AAC9B,iBAAS,KAAK,QAAQ,KAAK,CAAC;AAAA,MAC9B;AAAA,IACF;AACA,UAAM,SAAS,kBAAkB,UAAU,UAAU,qBAAqB;AAC1E,QAAI,IAAI,IAAI;AACZ,QAAI,OAAO,YAAY,MAAM,CAAC,EAAE,OAAO,GAAG;AACxC,cAAQ,IAAI,mBAAmB,OAAO,4BAA4B;AAAA,IACpE;AAAA,EACF;AACA,SAAO;AACT;AAnCS;AAsFT,SAAS,WAAW,GAAG,GAAG,GAAG;AAC3B,QAAM,MAAM,CAAC;AACb,MAAI,KAAK,OAAO,GAAG,CAAC;AACpB,MAAI,KAAK,OAAO,CAAC,GAAG,CAAC;AACrB,MAAI,KAAK,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,CAAC;AACvC,MAAI,KAAK,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC;AACxC,SAAO,IAAI,KAAK,GAAG;AACrB;AAPS;AAcT,SAAS,eAAe,MAAM;AAC5B,QAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,SAAO,EAAE,GAAG,OAAO,WAAW,OAAO,CAAC,CAAC,GAAG,GAAG,OAAO,WAAW,OAAO,CAAC,CAAC,GAAG,QAAQ,CAAC,OAAO,WAAW,OAAO,CAAC,CAAC,EAAE;AACnH;AAHS;AAKT,SAAS,qBAAqB,SAAS;AACrC,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO,CAAC;AAAA,EACV;AACA,QAAM,QAAQ,CAAC;AACf,mBAAiB,SAAS,KAAK;AAC/B,SAAO,MAAM;AACf;AAPS;AAST,SAAS,WAAW,MAAM,OAAO;AAC/B,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;AAAA,EACT;AACA,QAAM,UAAU,KAAK,IAAI,IAAI,SAAS,CAAC;AACvC,QAAM,IAAI,SAAS,OAAO,CAAC,MAAM,KAAK,MAAM,IAAI,OAAO,IAAI,UAAU,CAAC,MAAM;AAC5E,MAAI,KAAK,UAAU,GAAG;AACpB,UAAM,SAAS,KAAK,CAAC,EAAE;AACvB,WAAO,WAAW,EAAE,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,OAAO,MAAM,CAAC;AAAA,EAC9D;AAEA,QAAM,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;AACpD,aAAW,OAAO,MAAM;AACtB,UAAM,SAAS,EAAE,IAAI,OAAO,MAAM;AAClC,QAAI,KAAK,OAAO,QAAQ,QAAQ,GAAG,IAAI,QAAQ,IAAI,GAAG,IAAI,QAAQ,IAAI,GAAG,EAAE,IAAI,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,CAAC;AAAA,EACnG;AACA,SAAO,IAAI,KAAK,GAAG;AACrB;AAjBS;AAwBT,SAAS,qBAAqB,SAAS,OAAO;AAC5C,SAAO,WAAW,qBAAqB,OAAO,GAAG,KAAK;AACxD;AAFS;AAIT,SAAS,OAAO,MAAM,UAAU,CAAC,GAAG;AAClC,QAAM;AAAA,IACJ,cAAc;AAAA,IACd,gBAAgBC,UAAS;AAAA,IACzB,YAAY;AAAA,IACZ,cAAc,KAAK,KAAK;AAAA,IACxB;AAAA,IACA,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,UAAU;AAAA,IACV,aAAa;AAAA,IACb,wBAAwB;AAAA,IACxB;AAAA,IACA,QAAQ;AAAA,EACV,IAAI;AAEJ,MAAI,WAAWA,QAAO,MAAM;AAAA,IAC1B,cAAc,SAAS,aAAa,CAAC,OAAO,eAAe,SAAS,aAAa,uBAAuB;AAAA,IACxG;AAAA,EACF,CAAC;AAED,MAAI,WAAW;AACb,eAAW,kBAAkB,UAAU,aAAa,gBAAgB;AAAA,EACtE;AAEA,QAAM,UAAU,cAAc,UAAU,OAAO,QAAQ,SAAS,UAAU;AAC1E,QAAM,cAAc,mBAAmB,SAAS,MAAM,qBAAqB;AAE3E,QAAM,eAAe,IAAI;AAAA,IACvB,OAAO,KAAK,OAAO,EAAE,IAAI,CAAC,QAAQ;AAAA,MAChC;AAAA,MACA;AAAA,QACE;AAAA,QACA,GAAG,QAAQ,GAAG,EAAE;AAAA,QAChB,GAAG,QAAQ,GAAG,EAAE;AAAA,QAChB,QAAQ,QAAQ,GAAG,EAAE;AAAA,MACvB;AAAA,IACF,CAAC;AAAA,EACH;AACA,QAAM,UAAU,KAAK,IAAI,CAAC,SAAS;AACjC,UAAMC,WAAU,KAAK,KAAK,IAAI,CAAC,MAAM,aAAa,IAAI,CAAC,CAAC;AACxD,UAAM,OAAO,qBAAqBA,QAAO;AACzC,UAAM,OAAO,WAAW,MAAM,KAAK;AACnC,WAAO,EAAE,SAAAA,UAAS,MAAM,MAAM,MAAM,KAAK,IAAI,IAAI,KAAK,IAAI,EAAE;AAAA,EAC9D,CAAC;AAED,WAAS,gBAAgB,MAAM;AAC7B,QAAI,IAAI;AACR,eAAW,KAAK,SAAS;AACvB,UAAI,EAAE,IAAI,OAAO,KAAK,UAAU,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,CAAC,GAAG;AAC/D,aAAK,MAAM,EAAE;AAAA,MACf;AAAA,IACF;AACA,WAAO;AAAA,EACT;AARS;AAUT,SAAO,QAAQ,IAAI,CAAC,EAAE,SAAAA,UAAS,MAAM,MAAM,KAAK,MAAM;AACpD,WAAO;AAAA,MACL,MAAM;AAAA,MACN,MAAM,YAAY,KAAK,IAAI;AAAA,MAC3B,SAAAA;AAAA,MACA;AAAA,MACA;AAAA,MACA,cAAc,OAAO,gBAAgB,KAAK,IAAI;AAAA,IAChD;AAAA,EACF,CAAC;AACH;AAlES;;;ACjlET,SAAS,gBAAgB,WAAiE;AACxF,QAAM,MAAM,oBAAI,IAAoC;AACpD,aAAW,SAAS,WAAW;AAC7B,UAAM,MAAM,MAAM,QAAQ,KAAK,GAAG;AAClC,UAAM,WAAW,IAAI,IAAI,GAAG;AAC5B,QAAI,UAAU;AACZ,aAAO,OAAO,UAAU,MAAM,MAAM;AAAA,IACtC,OAAO;AACL,UAAI,IAAI,KAAK,EAAE,GAAG,MAAM,OAAO,CAAC;AAAA,IAClC;AAAA,EACF;AACA,SAAO;AACT;AAZS;AAcF,IAAM,OAAuB,wBAClC,OACA,IACA,UACA,YACS;AACT,QAAMC,MAAK,QAAQ;AACnB,QAAM,SAASA,IAAG,YAAY;AAC9B,QAAM,EAAE,gBAAgB,MAAM,cAAc,IAAI,UAAU;AAC1D,QAAM,cAAc,SAAS;AAC7B,QAAM,cAAwB;AAAA,IAC5B,eAAe;AAAA,IACf,eAAe;AAAA,IACf,eAAe;AAAA,IACf,eAAe;AAAA,IACf,eAAe;AAAA,IACf,eAAe;AAAA,IACf,eAAe;AAAA,IACf,eAAe;AAAA,EACjB,EAAE,OAAO,OAAO;AAChB,QAAM,QAAQA,IAAG,kBAAkB;AACnC,QAAM,OAAOA,IAAG,cAAc;AAC9B,QAAMC,aAAYD,IAAG,YAAY;AACjC,QAAM,aAAa,gBAAgBA,IAAG,aAAa,CAAC;AAGpD,QAAM,WAAW,QAAQ,SAAS;AAClC,QAAM,YAAY,QAAQ,UAAU;AACpC,QAAM,kBAAkB;AACxB,QAAME,SAAQ,WAAW;AACzB,QAAM,cAAc,QAAQ,KAAKA,SAAQ;AAEzC,QAAM,mBAAmB,eAAe,oBAAoB,eAAe;AAG3E,QAAM,MAAM,iBAAiB,EAAE;AAC/B,MAAI,KAAK,WAAW,OAAO,QAAQ,IAAI,SAAS,EAAE;AAElD,MAAI,OAAO;AACT,QACG,OAAO,MAAM,EACb,KAAK,KAAK,EACV,KAAK,SAAS,YAAY,EAC1B,KAAK,aAAa,GAAG,KAAKA,MAAK,IAAI,EACnC,KAAK,eAAe,QAAQ,EAC5B,KAAK,qBAAqB,QAAQ,EAClC,KAAK,KAAK,KAAK,EACf,KAAK,KAAK,KAAKA,MAAK,EACpB,MAAM,QAAQ,eAAe,sBAAsB,eAAe,UAAU;AAAA,EACjF;AAGA,QAAM,cAA2B,eAAS,SAAS,cAAc,KAAK,CAAC;AACvE,QAAM,cACH,YAAY,EACZ,MAAM,QAAQ,EACd,OAAO,YAAY,WAAW;AACjC,cAAY,MAAM,IAAI,EAAE,KAAK,WAAoB;AAEjD,QAAM,WAAW,cACb,GAAM,IAAI,YAAY,OAAO,KAAK,EAAE,KAAK,CAAkB,IAC3D;AAGJ,QAAM,cAAmB,OAAO,MAAM;AAAA,IACpC,OAAO;AAAA,IACP,QAAQ,YAAY;AAAA,IACpB,SAAS,QAAQ,WAAW;AAAA,EAC9B,CAAC;AAGD,QAAM,cAAc,oBAAI,IAA0C;AAClE,aAAW,QAAQ,aAAa;AAC9B,UAAM,MAAM,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,EAAE,KAAK,CAAC;AACpD,gBAAY,IAAI,KAAK,IAAI;AAAA,EAC3B;AAEA,MAAID,WAAU,SAAS,GAAG;AACxB,oBAAgB,QAAQ,aAAa,aAAaA,YAAWC,QAAO,UAAU;AAAA,EAChF;AAGA,QAAM,YAAY,gBAAO,eAAe,cAAc,SAAS;AAC/D,cAAY,UAAU,cAAc,EAAE,KAAK,SAAU,GAAG,GAAG;AACzD,UAAM,QAAQ,eAAS,IAAe;AACtC,UAAM,OAAO;AACb,UAAM,UAAU,cAAc,CAAC,GAAG,KAAK,IAAI,EAAE,KAAK,CAAC;AACnD,UAAM,cAAc,WAAW,IAAI,OAAO;AAC1C,UAAM,YACJ,aAAa,QAAQ,YAAY,IAAI,YAAY,MAAM,KAAK,eAAe;AAC7E,UAAM,QAAQ,YAAY,IAAI,CAAC,IAAI,IAAI;AACvC,UAAM,cAAc,cAAc,cAAc,KAAK;AACrD,UAAM,cAAc,aAAa,UAAU;AAC3C,UAAM,iBAAiB,cAAc,cAAc,KAAK,GAAG,IAAIA,MAAK;AAEpE,QAAI,eAAe,UAAU;AAC3B,YAAM,aAAa,YAAY,IAAI,OAAO;AAC1C,UAAI,cAAc,WAAW,QAAQ,SAAS,GAAG;AAC/C,cAAM,IAAI,WAAW,QAAQ,CAAC;AAC9B,cAAM,YAAY,SAAS,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,SAAS,GAAG;AAAA,UACxD,WAAW;AAAA,UACX,MAAM;AAAA,UACN,MAAM,uBAAe,WAAW,GAAG;AAAA,UACnC,WAAW;AAAA,UACX,YAAY;AAAA,UACZ,YAAY;AAAA,UACZ,cAAc,MAAM,IAAI;AAAA,UACxB,QAAQ;AAAA,UACR,aAAa,WAAW,OAAO,cAAc,CAAC;AAAA,QAChD,CAAC;AACD,cAAM,OAAO,MAAM,EAAE,OAAO;AAC5B,cAAM,KAAK,GAAG,aAAa,WAAW,MAAM,OAAO,MAAM,EAAE,KAAK,CAAgB;AAAA,MAClF;AAAA,IACF,OAAO;AACL,YACG,OAAO,MAAM,EACb,MAAM,QAAQ,SAAS,EACvB,MAAM,gBAAgB,WAAW,EACjC,MAAM,UAAU,WAAW,EAC3B,MAAM,gBAAgB,cAAc,EACpC,MAAM,kBAAkB,IAAI;AAAA,IACjC;AAEA,UAAM,YACJ,aAAa,UAAU,YAAY,gBAAQ,WAAW,EAAE,IAAI,eAAO,WAAW,EAAE;AAClF,UACG,OAAO,MAAM,EACb,MAAM,aAAa,GAAG,KAAKA,MAAK,IAAI,EACpC,MAAM,QAAQ,SAAS;AAAA,EAC5B,CAAC;AAGD,MAAI,eAAe,UAAU;AAC3B,gBAAY,UAAU,oBAAoB,EAAE,KAAK,SAAU,GAAG;AAC5D,YAAM,QAAQ,eAAS,IAAe;AACtC,YAAM,OAAO;AACb,YAAM,UAAU,cAAc,CAAC,GAAG,KAAK,IAAI,EAAE,KAAK,CAAC;AACnD,YAAM,cAAc,WAAW,IAAI,OAAO;AAC1C,YAAM,aAAa,aAAa;AAEhC,UAAI,YAAY;AACd,cAAM,SAAS,MAAM,OAAO,MAAM;AAClC,cAAM,QAAQ,OAAO,KAAK,GAAG;AAC7B,YAAI,OAAO;AACT,gBAAM,YAAY,SAAS,KAAK,OAAO;AAAA,YACrC,WAAW;AAAA,YACX,MAAM;AAAA,YACN,MAAM,uBAAe,YAAY,GAAG;AAAA,YACpC,WAAW;AAAA,YACX,YAAY;AAAA,YACZ,YAAY;AAAA,YACZ,cAAc;AAAA,YACd,QAAQ;AAAA,UACV,CAAC;AACD,gBAAM,eAAe,OAAO,KAAK;AACjC,wBAAc,YAAY,aAAa,WAAW,YAAY;AAC9D,iBAAO,OAAO;AAAA,QAChB;AAAA,MACF,OAAO;AACL,cAAM,OAAO,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAAA,MAC9C;AAEA,YACG,OAAO,MAAM,EACb,MAAM,aAAa,GAAG,KAAKA,MAAK,IAAI,EACpC,MAAM,QAAQ,aAAa,SAAS,eAAe,oBAAoB,gBAAgB;AAAA,IAC5F,CAAC;AAAA,EACH,OAAO;AACL,gBACG,UAAU,yBAAyB,EACnC,MAAM,aAAa,GAAG,KAAKA,MAAK,IAAI,EACpC,MAAM,QAAQ,CAAC,MAAM;AACpB,YAAM,OAAO;AACb,YAAM,UAAU,cAAc,CAAC,GAAG,KAAK,IAAI,EAAE,KAAK,CAAC;AACnD,aACE,WAAW,IAAI,OAAO,GAAG,SAAS,eAAe,oBAAoB;AAAA,IAEzE,CAAC;AACH,gBACG,UAAU,yBAAyB,EACnC,MAAM,gBAAgB,CAAC,MAAM;AAC5B,YAAM,OAAO;AACb,YAAM,UAAU,cAAc,CAAC,GAAG,KAAK,IAAI,EAAE,KAAK,CAAC;AACnD,aAAO,WAAW,IAAI,OAAO,GAAG,OAAO,IAAI;AAAA,IAC7C,CAAC,EACA,MAAM,QAAQ,CAAC,MAAM;AACpB,YAAM,OAAO;AACb,YAAM,UAAU,cAAc,CAAC,GAAG,KAAK,IAAI,EAAE,KAAK,CAAC;AACnD,aAAO,WAAW,IAAI,OAAO,GAAG,QAAQ;AAAA,IAC1C,CAAC;AAAA,EACL;AAGA,QAAM,YAAY,IAAI,OAAO,GAAG,EAAE,KAAK,aAAa,gBAAgB,WAAW,GAAG;AAClF,QAAM,WAAW,YAAY,OAAO,KAAK,EAAE,KAAK;AAChD,MAAI,YAAY,gBAAgB,UAAU;AACxC,eAAW,SAAS,CAAC,GAAG,SAAS,UAAU,GAAG;AAC5C,gBAAU,KAAK,GAAG,YAAY,KAAK;AAAA,IACrC;AAAA,EACF;AACA,mBAAiB,KAAK,WAAW,UAAU,QAAQ,eAAe,IAAI;AACxE,GAzMoC;AA2MpC,SAAS,cAAc,QAA0B;AAC/C,SAAO,OAAO,KAAK,GAAG;AACxB;AAFS;AAIT,SAAS,gBACP,QACA,aACA,aACAD,YACAC,QACA,YACA;AACA,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,QAAM,UAAU,YAAY,OAAO,KAAK;AACxC,QAAM,YAAY,QAAQ,OAAO,GAAG,EAAE,KAAK,SAAS,iBAAiB;AAGrE,QAAM,cAAc,oBAAI,IAA4B;AACpD,aAAW,QAAQD,YAAW;AAC5B,UAAM,MAAM,cAAc,KAAK,IAAI;AACnC,UAAM,WAAW,YAAY,IAAI,GAAG;AACpC,QAAI,UAAU;AACZ,eAAS,KAAK,IAAI;AAAA,IACpB,OAAO;AACL,kBAAY,IAAI,KAAK,CAAC,IAAI,CAAC;AAAA,IAC7B;AAAA,EACF;AAGA,aAAW,CAAC,KAAK,KAAK,KAAK,YAAY,QAAQ,GAAG;AAChD,UAAM,OAAO,YAAY,IAAI,GAAG;AAChC,QAAI,CAAC,MAAM,MAAM;AACf;AAAA,IACF;AAEA,UAAM,UAAU,KAAK,KAAK;AAC1B,UAAM,UAAU,KAAK,KAAK;AAC1B,UAAM,kBAAkB,KAAK,IAAI,GAAG,KAAK,QAAQ,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AACrE,UAAM,iBAAiB,KAAK;AAAA,MAC1B,GAAG,KAAK,QAAQ,IAAI,CAAC,MAAM,EAAE,SAAS,KAAK,MAAM,UAAU,EAAE,GAAG,UAAU,EAAE,CAAC,CAAC;AAAA,IAChF;AACA,QAAI,cAAc,OAAO,SAAS,cAAc,IAAI,KAAK,IAAI,GAAG,cAAc,IAAI;AAClF,QAAI,gBAAgB,KAAK,OAAO,SAAS,eAAe,GAAG;AACzD,oBAAc,kBAAkB;AAAA,IAClC;AAGA,UAAM,YAAY,UACf,OAAO,GAAG,EACV,KAAK,SAAS,gBAAgB,EAC9B,KAAK,aAAa,GAAG,KAAKC,MAAK,IAAI;AACtC,QAAI,gBAAgB;AAClB,gBACG,OAAO,QAAQ,EACf,KAAK,SAAS,wBAAwB,EACtC,KAAK,MAAM,OAAO,EAClB,KAAK,MAAM,OAAO,EAClB,KAAK,KAAK,WAAW,EACrB,KAAK,QAAQ,MAAM,EACnB,KAAK,UAAU,QAAQ,EACvB,KAAK,gBAAgB,MAAMA,MAAK,EAChC,KAAK,oBAAoB,GAAG,IAAIA,MAAK,IAAI,IAAIA,MAAK,EAAE;AAAA,IACzD;AAGA,UAAM,aAAa,KAAK,IAAI,KAAKA,QAAO,cAAc,IAAI,IAAI;AAC9D,UAAM,cAAc,KAAK,IAAI,KAAKA,QAAO,cAAc,IAAI,IAAI;AAC/D,UAAM,WAAW,KAAK,KAAK,SAAS,KAAK,KAAK,MAAM,SAAS;AAC7D,UAAM,kBAAkB,WAAW,KAAK,IAAI,KAAKA,QAAO,cAAc,IAAI,IAAI;AAC9E,UAAM,cAAc,mBAAmB,MAAM,UAAU,IAAI,KAAKA,SAAQ;AACxE,UAAM,SAAS,UAAU,aAAa;AACtC,UAAM,SAAS,UAAU,cAAc,IAAI;AAC3C,UAAM,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM,MAAM,CAAC,CAAC;AAC3D,UAAM,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,MAAM,SAAS,IAAI,CAAC;AACvD,UAAM,YAAY,aAAa;AAC/B,UAAM,aAAa,cAAc;AAGjC,eAAW,CAAC,GAAG,IAAI,KAAK,MAAM,QAAQ,GAAG;AACvC,YAAM,MAAM,IAAI;AAChB,YAAM,MAAM,KAAK,MAAM,IAAI,IAAI;AAC/B,YAAM,IAAI,SAAS,aAAa,MAAM;AACtC,YAAM,IAAI,SAAS,cAAc,MAAM;AAEvC,UAAI,gBAAgB;AAClB,kBACG,OAAO,MAAM,EACb,KAAK,SAAS,sBAAsB,EACpC,KAAK,KAAK,SAAS,YAAY,GAAG,EAClC,KAAK,KAAK,SAAS,aAAa,GAAG,EACnC,KAAK,SAAS,SAAS,EACvB,KAAK,UAAU,UAAU,EACzB,KAAK,QAAQ,MAAM,EACnB,KAAK,UAAU,MAAM,EACrB,KAAK,gBAAgB,IAAIA,MAAK,EAC9B,KAAK,oBAAoB,GAAG,IAAIA,MAAK,IAAI,IAAIA,MAAK,EAAE;AAAA,MACzD;AAEA,YAAM,WAAW,YAAY;AAC7B,YAAM,YAAY,aAAa;AAG/B,YAAM,YAAY,UACf,OAAO,eAAe,EACtB,KAAK,SAAS,mBAAmB,EACjC,KAAK,SAAS,QAAQ,EACtB,KAAK,UAAU,SAAS,EACxB,KAAK,KAAK,IAAI,WAAW,CAAC,EAC1B,KAAK,KAAK,IAAI,YAAY,CAAC,EAC3B,KAAK,YAAY,SAAS;AAE7B,YAAM,YAAY,WAAW,IAAI,KAAK,EAAE,GAAG;AAC3C,YAAM,OAAO,UACV,OAAO,YAAY,EACnB,KAAK,SAAS,gBAAgB,EAC9B,MAAM,WAAW,MAAM,EACvB,MAAM,SAAS,MAAM,EACrB,MAAM,UAAU,MAAM,EACtB,MAAM,eAAe,QAAQ,EAC7B,MAAM,eAAe,QAAQ,EAC7B,MAAM,mBAAmB,QAAQ,EACjC,MAAM,cAAc,QAAQ,EAC5B,MAAM,iBAAiB,QAAQ,EAC/B,MAAM,cAAc,QAAQ,EAC5B,KAAK,KAAK,SAAS,KAAK,EAAE;AAE7B,UAAI,WAAW;AACb,aAAK,MAAM,SAAS,SAAS;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AACF;AA/HS;AAiIF,IAAM,WAA4B,EAAE,KAAK;;;ACvWzC,IAAM,UAA6B;AAAA,EACxC;AAAA,EACA;AAAA,EACA;AAAA,EACA,QAAQ;AACV;",
  "names": ["o", "parser", "lexer", "getConfig", "distance", "word", "tspan", "layout", "circles", "db", "textNodes", "scale"]
}