{
  "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": "6ZAyEA,IAAIA,IAAU,UAAU,CACxB,IAAIC,EAAEC,EAAA,SAASC,EAAEC,EAAEH,EAAEI,EAAE,CAAC,IAAIJ,EAAEA,GAAG,CAAC,EAAEI,EAAEF,EAAE,OAAOE,IAAIJ,EAAEE,EAAEE,CAAC,CAAC,EAAED,EAAE,CAAC,OAAOH,CAAC,EAAhE,KAAkEK,EAAI,CAAC,EAAE,CAAC,EAAEC,EAAI,CAAC,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,EAAEC,EAAI,CAAC,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EACtUnB,EAAS,CAAC,MAAOE,EAAA,UAAkB,CAAE,EAApB,SACrB,GAAI,CAAC,EACL,SAAU,CAAC,MAAQ,EAAE,MAAQ,EAAE,YAAc,EAAE,KAAO,EAAE,SAAW,EAAE,IAAM,EAAE,QAAU,EAAE,KAAO,EAAE,UAAY,GAAG,MAAQ,GAAG,IAAM,GAAG,WAAa,GAAG,cAAgB,GAAG,MAAQ,GAAG,QAAU,GAAG,MAAQ,GAAG,eAAiB,GAAG,KAAO,GAAG,WAAa,GAAG,OAAS,GAAG,YAAc,GAAG,iBAAmB,GAAG,MAAQ,GAAG,UAAY,GAAG,WAAa,GAAG,MAAQ,GAAG,WAAa,GAAG,YAAc,GAAG,WAAa,GAAG,SAAW,GAAG,SAAW,GAAG,UAAY,GAAG,QAAU,EAAE,KAAO,CAAC,EACjd,WAAY,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,GAAG,QAAQ,GAAG,MAAM,GAAG,gBAAgB,GAAG,QAAQ,GAAG,UAAU,GAAG,QAAQ,GAAG,OAAO,GAAG,aAAa,GAAG,SAAS,GAAG,cAAc,GAAG,QAAQ,GAAG,QAAQ,GAAG,WAAW,GAAG,WAAW,GAAG,WAAW,EACrP,aAAc,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAC7T,cAAeA,EAAA,SAAmBkB,EAAQC,EAAQC,EAAUC,EAAIC,EAAyBC,EAAiBC,EAAiB,CAG3H,IAAIC,EAAKF,EAAG,OAAS,EACrB,OAAQD,EAAS,CACjB,IAAK,GACJ,OAAOC,EAAGE,EAAG,CAAC,EAEf,IAAK,GAAG,IAAK,GAAG,IAAK,GACpB,KAAK,EAAI,CAAC,EACX,MACA,IAAK,GACJF,EAAGE,EAAG,CAAC,EAAE,KAAKF,EAAGE,CAAE,CAAC,EAAG,KAAK,EAAIF,EAAGE,EAAG,CAAC,EACxC,MACA,IAAK,GACJ,KAAK,EAAI,CAAC,EACX,MACA,IAAK,GAAG,IAAK,IAAI,IAAK,IAAI,IAAK,IAAI,IAAK,IAAI,IAAK,IAAI,IAAK,IAAI,IAAK,IAClE,KAAK,EAAIF,EAAGE,CAAE,EACf,MACA,IAAK,GACJJ,EAAG,gBAAgBE,EAAGE,CAAE,EAAE,OAAO,CAAC,CAAC,EAAG,KAAK,EAAIF,EAAGE,CAAE,EAAE,OAAO,CAAC,EAC/D,MACA,IAAK,GACJJ,EAAG,cAAc,CAACE,EAAGE,CAAE,CAAC,EAAG,OAAW,MAAS,EAAOJ,EAAG,eAAiBA,EAAG,cAAc,EAAI,EAChG,MACA,IAAK,IACJA,EAAG,cAAc,CAACE,EAAGE,EAAG,CAAC,CAAC,EAAGF,EAAGE,CAAE,EAAG,MAAS,EAAOJ,EAAG,eAAiBA,EAAG,cAAc,EAAI,EAC/F,MACA,IAAK,IACJA,EAAG,cAAc,CAACE,EAAGE,EAAG,CAAC,CAAC,EAAG,OAAW,WAAWF,EAAGE,CAAE,CAAC,CAAC,EAAOJ,EAAG,eAAiBA,EAAG,cAAc,EAAI,EAC3G,MACA,IAAK,IACJA,EAAG,cAAc,CAACE,EAAGE,EAAG,CAAC,CAAC,EAAGF,EAAGE,EAAG,CAAC,EAAG,WAAWF,EAAGE,CAAE,CAAC,CAAC,EAAOJ,EAAG,eAAiBA,EAAG,cAAc,EAAI,EAC1G,MACA,IAAK,IACJ,GAAIE,EAAGE,CAAE,EAAE,OAAS,EAAK,MAAM,IAAI,MAAM,qCAAqC,EAASJ,EAAG,0BAA4BA,EAAG,yBAAyBE,EAAGE,CAAE,CAAC,EAAKJ,EAAG,cAAcE,EAAGE,CAAE,EAAG,OAAW,MAAS,EAAOJ,EAAG,eAAiBA,EAAG,cAAc,EAAI,EAC3P,MACA,IAAK,IACJ,GAAIE,EAAGE,EAAG,CAAC,EAAE,OAAS,EAAK,MAAM,IAAI,MAAM,qCAAqC,EAASJ,EAAG,0BAA4BA,EAAG,yBAAyBE,EAAGE,EAAG,CAAC,CAAC,EAAKJ,EAAG,cAAcE,EAAGE,EAAG,CAAC,EAAGF,EAAGE,CAAE,EAAG,MAAS,EAAOJ,EAAG,eAAiBA,EAAG,cAAc,EAAI,EAC9P,MACA,IAAK,IACJ,GAAIE,EAAGE,EAAG,CAAC,EAAE,OAAS,EAAK,MAAM,IAAI,MAAM,qCAAqC,EAASJ,EAAG,0BAA4BA,EAAG,yBAAyBE,EAAGE,EAAG,CAAC,CAAC,EAAKJ,EAAG,cAAcE,EAAGE,EAAG,CAAC,EAAG,OAAW,WAAWF,EAAGE,CAAE,CAAC,CAAC,EAAOJ,EAAG,eAAiBA,EAAG,cAAc,EAAI,EAC1Q,MACA,IAAK,IACJ,GAAIE,EAAGE,EAAG,CAAC,EAAE,OAAS,EAAK,MAAM,IAAI,MAAM,qCAAqC,EAASJ,EAAG,0BAA4BA,EAAG,yBAAyBE,EAAGE,EAAG,CAAC,CAAC,EAAKJ,EAAG,cAAcE,EAAGE,EAAG,CAAC,EAAGF,EAAGE,EAAG,CAAC,EAAG,WAAWF,EAAGE,CAAE,CAAC,CAAC,EAAOJ,EAAG,eAAiBA,EAAG,cAAc,EAAI,EACzQ,MACA,IAAK,IAAI,IAAK,IAAI,IAAK,IACtBA,EAAG,YAAYE,EAAGE,EAAG,CAAC,EAAGF,EAAGE,CAAE,EAAG,MAAS,EAC3C,MACA,IAAK,IAAI,IAAK,IACbJ,EAAG,YAAYE,EAAGE,EAAG,CAAC,EAAGF,EAAGE,EAAG,CAAC,EAAGF,EAAGE,CAAE,CAAC,EAC1C,MACA,IAAK,IACJJ,EAAG,aAAaE,EAAGE,EAAG,CAAC,EAAGF,EAAGE,CAAE,CAAC,EACjC,MACA,IAAK,IAAI,IAAK,IAAI,IAAK,IACtB,IAAIC,EAAKL,EAAG,eAAe,EAAG,GAAI,CAACK,EAAI,MAAM,IAAI,MAAM,mBAAmB,EAAGL,EAAG,YAAYK,EAAIH,EAAGE,CAAE,EAAG,MAAS,EAClH,MACA,IAAK,IAAI,IAAK,IACb,IAAIC,EAAKL,EAAG,eAAe,EAAG,GAAI,CAACK,EAAI,MAAM,IAAI,MAAM,mBAAmB,EAAGL,EAAG,YAAYK,EAAIH,EAAGE,EAAG,CAAC,EAAGF,EAAGE,CAAE,CAAC,EACjH,MACA,IAAK,IAAI,IAAK,IACb,KAAK,EAAI,CAACF,EAAGE,CAAE,CAAC,EACjB,MACA,IAAK,IAAI,IAAK,IACb,KAAK,EAAI,CAAC,GAAGF,EAAGE,EAAG,CAAC,EAAGF,EAAGE,CAAE,CAAC,EAC9B,MACA,IAAK,IACJ,KAAK,EAAI,CAACF,EAAGE,EAAG,CAAC,EAAGF,EAAGE,CAAE,CAAC,EAC3B,MACA,IAAK,IACJ,KAAK,EAAIF,EAAGE,CAAE,EAAE,KAAK,GAAG,EACzB,MACA,IAAK,IACJ,KAAK,EAAI,CAACF,EAAGE,CAAE,CAAC,EACjB,MACA,IAAK,IACJF,EAAGE,EAAG,CAAC,EAAE,KAAKF,EAAGE,CAAE,CAAC,EAAG,KAAK,EAAIF,EAAGE,EAAG,CAAC,EACxC,MACA,IAAK,IAAI,IAAK,IACb,KAAK,EAAIF,EAAGE,CAAE,EACf,KACA,CACA,EApFe,aAqFf,MAAO,CAAC1B,EAAEK,EAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAEL,EAAEM,EAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAEN,EAAEK,EAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAEL,EAAEM,EAAI,CAAC,EAAE,CAAC,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,CAAC,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,CAAC,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,GAAGC,EAAI,GAAGC,CAAG,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAGD,EAAI,GAAGC,CAAG,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAGD,EAAI,GAAGC,CAAG,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAGD,EAAI,GAAGC,CAAG,EAAER,EAAEM,EAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAEN,EAAES,EAAI,CAAC,EAAE,EAAE,CAAC,EAAET,EAAES,EAAI,CAAC,EAAE,EAAE,CAAC,EAAET,EAAEM,EAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAGI,CAAG,CAAC,EAAEV,EAAES,EAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAGC,CAAG,EAAEV,EAAEM,EAAI,CAAC,EAAE,EAAE,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAGK,EAAI,GAAG,GAAG,GAAG,GAAG,GAAGD,CAAG,EAAEV,EAAEM,EAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,GAAG,GAAGC,EAAI,GAAGC,CAAG,EAAER,EAAEM,EAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAEN,EAAEY,EAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAEZ,EAAEM,EAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,CAAC,EAAEN,EAAES,EAAI,CAAC,EAAE,EAAE,CAAC,EAAET,EAAEM,EAAI,CAAC,EAAE,EAAE,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAGK,EAAI,GAAG,EAAE,EAAE,CAAC,GAAGE,EAAI,GAAGC,EAAI,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGC,EAAI,GAAGC,EAAI,GAAGC,CAAG,EAAEjB,EAAEM,EAAI,CAAC,EAAE,EAAE,CAAC,EAAEN,EAAEM,EAAI,CAAC,EAAE,EAAE,CAAC,EAAEN,EAAEY,EAAI,CAAC,EAAE,EAAE,CAAC,EAAEZ,EAAEY,EAAI,CAAC,EAAE,EAAE,CAAC,EAAEZ,EAAEY,EAAI,CAAC,EAAE,EAAE,CAAC,EAAEZ,EAAEY,EAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,GAAGC,EAAI,GAAGC,EAAI,GAAGC,EAAI,GAAGC,EAAI,GAAGC,CAAG,CAAC,EAAEjB,EAAEkB,EAAI,CAAC,EAAE,EAAE,CAAC,EAAElB,EAAEkB,EAAI,CAAC,EAAE,EAAE,CAAC,EAAElB,EAAEkB,EAAI,CAAC,EAAE,EAAE,CAAC,EAAElB,EAAEkB,EAAI,CAAC,EAAE,EAAE,CAAC,EAAElB,EAAEkB,EAAI,CAAC,EAAE,EAAE,CAAC,EAAElB,EAAEkB,EAAI,CAAC,EAAE,EAAE,CAAC,EAAElB,EAAEkB,EAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAC3wC,eAAgB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACxB,WAAYjB,EAAA,SAAqB2B,EAAKC,EAAM,CACxC,GAAIA,EAAK,YACL,KAAK,MAAMD,CAAG,MACX,CACH,IAAIE,EAAQ,IAAI,MAAMF,CAAG,EACzB,MAAAE,EAAM,KAAOD,EACPC,CACV,CACJ,EARY,cASZ,MAAO7B,EAAA,SAAe8B,EAAO,CACzB,IAAIC,EAAO,KAAMC,EAAQ,CAAC,CAAC,EAAGC,EAAS,CAAC,EAAGC,EAAS,CAAC,IAAI,EAAGC,EAAS,CAAC,EAAGC,EAAQ,KAAK,MAAOlB,EAAS,GAAIE,EAAW,EAAGD,EAAS,EAAGkB,EAAa,EAAGC,EAAS,EAAGC,EAAM,EAClKC,EAAOL,EAAO,MAAM,KAAK,UAAW,CAAC,EACrCM,EAAQ,OAAO,OAAO,KAAK,KAAK,EAChCC,EAAc,CAAE,GAAI,CAAC,CAAE,EAC3B,QAASzC,KAAK,KAAK,GACX,OAAO,UAAU,eAAe,KAAK,KAAK,GAAIA,CAAC,IAC/CyC,EAAY,GAAGzC,CAAC,EAAI,KAAK,GAAGA,CAAC,GAGrCwC,EAAM,SAASX,EAAOY,EAAY,EAAE,EACpCA,EAAY,GAAG,MAAQD,EACvBC,EAAY,GAAG,OAAS,KACpB,OAAOD,EAAM,OAAU,MACvBA,EAAM,OAAS,CAAC,GAEpB,IAAIE,EAAQF,EAAM,OAClBN,EAAO,KAAKQ,CAAK,EACjB,IAAIC,EAASH,EAAM,SAAWA,EAAM,QAAQ,OACxC,OAAOC,EAAY,GAAG,YAAe,WACrC,KAAK,WAAaA,EAAY,GAAG,WAEjC,KAAK,WAAa,OAAO,eAAe,IAAI,EAAE,WAElD,SAASG,EAASC,EAAG,CACjBd,EAAM,OAASA,EAAM,OAAS,EAAIc,EAClCZ,EAAO,OAASA,EAAO,OAASY,EAChCX,EAAO,OAASA,EAAO,OAASW,CACpC,CAJS9C,EAAA6C,EAAA,YAKD,SAASE,GAAM,CACf,IAAIC,EACJ,OAAAA,EAAQf,EAAO,IAAI,GAAKQ,EAAM,IAAI,GAAKF,EACnC,OAAOS,GAAU,WACbA,aAAiB,QACjBf,EAASe,EACTA,EAAQf,EAAO,IAAI,GAEvBe,EAAQjB,EAAK,SAASiB,CAAK,GAAKA,GAE7BA,CACX,CAXahD,EAAA+C,EAAA,OAajB,QADIE,EAAQC,EAAgBC,EAAOC,EAAQC,EAAGC,GAAGC,EAAQ,CAAC,EAAGC,EAAGC,EAAKC,GAAUC,KAClE,CAUT,GATAR,EAAQnB,EAAMA,EAAM,OAAS,CAAC,EAC1B,KAAK,eAAemB,CAAK,EACzBC,EAAS,KAAK,eAAeD,CAAK,IAE9BF,IAAW,MAAQ,OAAOA,EAAU,OACpCA,EAASF,EAAI,GAEjBK,EAAShB,EAAMe,CAAK,GAAKf,EAAMe,CAAK,EAAEF,CAAM,GAE5C,OAAOG,EAAW,KAAe,CAACA,EAAO,QAAU,CAACA,EAAO,CAAC,EAAG,CAC/D,IAAIQ,GAAS,GACbD,GAAW,CAAC,EACZ,IAAKH,KAAKpB,EAAMe,CAAK,EACb,KAAK,WAAWK,CAAC,GAAKA,EAAIlB,GAC1BqB,GAAS,KAAK,IAAO,KAAK,WAAWH,CAAC,EAAI,GAAI,EAGlDf,EAAM,aACNmB,GAAS,wBAA0BxC,EAAW,GAAK;AAAA,EAAQqB,EAAM,aAAa,EAAI;AAAA,YAAiBkB,GAAS,KAAK,IAAI,EAAI,WAAc,KAAK,WAAWV,CAAM,GAAKA,GAAU,IAE5KW,GAAS,wBAA0BxC,EAAW,GAAK,iBAAmB6B,GAAUV,EAAM,eAAiB,KAAQ,KAAK,WAAWU,CAAM,GAAKA,GAAU,KAExJ,KAAK,WAAWW,GAAQ,CACpB,KAAMnB,EAAM,MACZ,MAAO,KAAK,WAAWQ,CAAM,GAAKA,EAClC,KAAMR,EAAM,SACZ,IAAKE,EACL,SAAUgB,EACd,CAAC,CACL,CACA,GAAIP,EAAO,CAAC,YAAa,OAASA,EAAO,OAAS,EAC9C,MAAM,IAAI,MAAM,oDAAsDD,EAAQ,YAAcF,CAAM,EAEtG,OAAQG,EAAO,CAAC,EAAG,CACnB,IAAK,GACDpB,EAAM,KAAKiB,CAAM,EACjBf,EAAO,KAAKO,EAAM,MAAM,EACxBN,EAAO,KAAKM,EAAM,MAAM,EACxBT,EAAM,KAAKoB,EAAO,CAAC,CAAC,EACpBH,EAAS,KACJC,GASDD,EAASC,EACTA,EAAiB,OATjB/B,EAASsB,EAAM,OACfvB,EAASuB,EAAM,OACfrB,EAAWqB,EAAM,SACjBE,EAAQF,EAAM,OACVJ,EAAa,GACbA,KAMR,MACJ,IAAK,GAwBD,GAvBAoB,EAAM,KAAK,aAAaL,EAAO,CAAC,CAAC,EAAE,CAAC,EACpCG,EAAM,EAAIrB,EAAOA,EAAO,OAASuB,CAAG,EACpCF,EAAM,GAAK,CACP,WAAYpB,EAAOA,EAAO,QAAUsB,GAAO,EAAE,EAAE,WAC/C,UAAWtB,EAAOA,EAAO,OAAS,CAAC,EAAE,UACrC,aAAcA,EAAOA,EAAO,QAAUsB,GAAO,EAAE,EAAE,aACjD,YAAatB,EAAOA,EAAO,OAAS,CAAC,EAAE,WAC3C,EACIS,IACAW,EAAM,GAAG,MAAQ,CACbpB,EAAOA,EAAO,QAAUsB,GAAO,EAAE,EAAE,MAAM,CAAC,EAC1CtB,EAAOA,EAAO,OAAS,CAAC,EAAE,MAAM,CAAC,CACrC,GAEJmB,GAAI,KAAK,cAAc,MAAMC,EAAO,CAChCrC,EACAC,EACAC,EACAsB,EAAY,GACZU,EAAO,CAAC,EACRlB,EACAC,CACJ,EAAE,OAAOK,CAAI,CAAC,EACV,OAAOc,GAAM,IACb,OAAOA,GAEPG,IACAzB,EAAQA,EAAM,MAAM,EAAG,GAAKyB,EAAM,CAAC,EACnCvB,EAASA,EAAO,MAAM,EAAG,GAAKuB,CAAG,EACjCtB,EAASA,EAAO,MAAM,EAAG,GAAKsB,CAAG,GAErCzB,EAAM,KAAK,KAAK,aAAaoB,EAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1ClB,EAAO,KAAKqB,EAAM,CAAC,EACnBpB,EAAO,KAAKoB,EAAM,EAAE,EACpBG,GAAWtB,EAAMJ,EAAMA,EAAM,OAAS,CAAC,CAAC,EAAEA,EAAMA,EAAM,OAAS,CAAC,CAAC,EACjEA,EAAM,KAAK0B,EAAQ,EACnB,MACJ,IAAK,GACD,MAAO,EACX,CACJ,CACA,MAAO,EACX,EA3IO,QA2IN,EAGGjB,GAAS,UAAU,CACvB,IAAIA,EAAS,CAEb,IAAI,EAEJ,WAAWzC,EAAA,SAAoB2B,EAAKC,EAAM,CAClC,GAAI,KAAK,GAAG,OACR,KAAK,GAAG,OAAO,WAAWD,EAAKC,CAAI,MAEnC,OAAM,IAAI,MAAMD,CAAG,CAE3B,EANO,cASX,SAAS3B,EAAA,SAAU8B,EAAOT,EAAI,CACtB,YAAK,GAAKA,GAAM,KAAK,IAAM,CAAC,EAC5B,KAAK,OAASS,EACd,KAAK,MAAQ,KAAK,WAAa,KAAK,KAAO,GAC3C,KAAK,SAAW,KAAK,OAAS,EAC9B,KAAK,OAAS,KAAK,QAAU,KAAK,MAAQ,GAC1C,KAAK,eAAiB,CAAC,SAAS,EAChC,KAAK,OAAS,CACV,WAAY,EACZ,aAAc,EACd,UAAW,EACX,YAAa,CACjB,EACI,KAAK,QAAQ,SACb,KAAK,OAAO,MAAQ,CAAC,EAAE,CAAC,GAE5B,KAAK,OAAS,EACP,IACX,EAlBK,YAqBT,MAAM9B,EAAA,UAAY,CACV,IAAI6D,EAAK,KAAK,OAAO,CAAC,EACtB,KAAK,QAAUA,EACf,KAAK,SACL,KAAK,SACL,KAAK,OAASA,EACd,KAAK,SAAWA,EAChB,IAAIC,EAAQD,EAAG,MAAM,iBAAiB,EACtC,OAAIC,GACA,KAAK,WACL,KAAK,OAAO,aAEZ,KAAK,OAAO,cAEZ,KAAK,QAAQ,QACb,KAAK,OAAO,MAAM,CAAC,IAGvB,KAAK,OAAS,KAAK,OAAO,MAAM,CAAC,EAC1BD,CACX,EApBE,SAuBN,MAAM7D,EAAA,SAAU6D,EAAI,CACZ,IAAIJ,EAAMI,EAAG,OACTC,EAAQD,EAAG,MAAM,eAAe,EAEpC,KAAK,OAASA,EAAK,KAAK,OACxB,KAAK,OAAS,KAAK,OAAO,OAAO,EAAG,KAAK,OAAO,OAASJ,CAAG,EAE5D,KAAK,QAAUA,EACf,IAAIM,EAAW,KAAK,MAAM,MAAM,eAAe,EAC/C,KAAK,MAAQ,KAAK,MAAM,OAAO,EAAG,KAAK,MAAM,OAAS,CAAC,EACvD,KAAK,QAAU,KAAK,QAAQ,OAAO,EAAG,KAAK,QAAQ,OAAS,CAAC,EAEzDD,EAAM,OAAS,IACf,KAAK,UAAYA,EAAM,OAAS,GAEpC,IAAIR,EAAI,KAAK,OAAO,MAEpB,YAAK,OAAS,CACV,WAAY,KAAK,OAAO,WACxB,UAAW,KAAK,SAAW,EAC3B,aAAc,KAAK,OAAO,aAC1B,YAAaQ,GACRA,EAAM,SAAWC,EAAS,OAAS,KAAK,OAAO,aAAe,GAC5DA,EAASA,EAAS,OAASD,EAAM,MAAM,EAAE,OAASA,EAAM,CAAC,EAAE,OAChE,KAAK,OAAO,aAAeL,CACjC,EAEI,KAAK,QAAQ,SACb,KAAK,OAAO,MAAQ,CAACH,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAI,KAAK,OAASG,CAAG,GAEvD,KAAK,OAAS,KAAK,OAAO,OACnB,IACX,EAhCE,SAmCN,KAAKzD,EAAA,UAAY,CACT,YAAK,MAAQ,GACN,IACX,EAHC,QAML,OAAOA,EAAA,UAAY,CACX,GAAI,KAAK,QAAQ,gBACb,KAAK,WAAa,OAElB,QAAO,KAAK,WAAW,0BAA4B,KAAK,SAAW,GAAK;AAAA,EAAqI,KAAK,aAAa,EAAG,CAC9N,KAAM,GACN,MAAO,KACP,KAAM,KAAK,QACf,CAAC,EAGL,OAAO,IACX,EAZG,UAeP,KAAKA,EAAA,SAAU8C,EAAG,CACV,KAAK,MAAM,KAAK,MAAM,MAAMA,CAAC,CAAC,CAClC,EAFC,QAKL,UAAU9C,EAAA,UAAY,CACd,IAAIgE,EAAO,KAAK,QAAQ,OAAO,EAAG,KAAK,QAAQ,OAAS,KAAK,MAAM,MAAM,EACzE,OAAQA,EAAK,OAAS,GAAK,MAAM,IAAMA,EAAK,OAAO,GAAG,EAAE,QAAQ,MAAO,EAAE,CAC7E,EAHM,aAMV,cAAchE,EAAA,UAAY,CAClB,IAAIiE,EAAO,KAAK,MAChB,OAAIA,EAAK,OAAS,KACdA,GAAQ,KAAK,OAAO,OAAO,EAAG,GAAGA,EAAK,MAAM,IAExCA,EAAK,OAAO,EAAE,EAAE,GAAKA,EAAK,OAAS,GAAK,MAAQ,KAAK,QAAQ,MAAO,EAAE,CAClF,EANU,iBASd,aAAajE,EAAA,UAAY,CACjB,IAAIkE,EAAM,KAAK,UAAU,EACrBC,EAAI,IAAI,MAAMD,EAAI,OAAS,CAAC,EAAE,KAAK,GAAG,EAC1C,OAAOA,EAAM,KAAK,cAAc,EAAI;AAAA,EAAOC,EAAI,GACnD,EAJS,gBAOb,WAAWnE,EAAA,SAASoE,EAAOC,EAAc,CACjC,IAAIrB,EACAc,EACAQ,EAwDJ,GAtDI,KAAK,QAAQ,kBAEbA,EAAS,CACL,SAAU,KAAK,SACf,OAAQ,CACJ,WAAY,KAAK,OAAO,WACxB,UAAW,KAAK,UAChB,aAAc,KAAK,OAAO,aAC1B,YAAa,KAAK,OAAO,WAC7B,EACA,OAAQ,KAAK,OACb,MAAO,KAAK,MACZ,QAAS,KAAK,QACd,QAAS,KAAK,QACd,OAAQ,KAAK,OACb,OAAQ,KAAK,OACb,MAAO,KAAK,MACZ,OAAQ,KAAK,OACb,GAAI,KAAK,GACT,eAAgB,KAAK,eAAe,MAAM,CAAC,EAC3C,KAAM,KAAK,IACf,EACI,KAAK,QAAQ,SACbA,EAAO,OAAO,MAAQ,KAAK,OAAO,MAAM,MAAM,CAAC,IAIvDR,EAAQM,EAAM,CAAC,EAAE,MAAM,iBAAiB,EACpCN,IACA,KAAK,UAAYA,EAAM,QAE3B,KAAK,OAAS,CACV,WAAY,KAAK,OAAO,UACxB,UAAW,KAAK,SAAW,EAC3B,aAAc,KAAK,OAAO,YAC1B,YAAaA,EACAA,EAAMA,EAAM,OAAS,CAAC,EAAE,OAASA,EAAMA,EAAM,OAAS,CAAC,EAAE,MAAM,QAAQ,EAAE,CAAC,EAAE,OAC5E,KAAK,OAAO,YAAcM,EAAM,CAAC,EAAE,MACpD,EACA,KAAK,QAAUA,EAAM,CAAC,EACtB,KAAK,OAASA,EAAM,CAAC,EACrB,KAAK,QAAUA,EACf,KAAK,OAAS,KAAK,OAAO,OACtB,KAAK,QAAQ,SACb,KAAK,OAAO,MAAQ,CAAC,KAAK,OAAQ,KAAK,QAAU,KAAK,MAAM,GAEhE,KAAK,MAAQ,GACb,KAAK,WAAa,GAClB,KAAK,OAAS,KAAK,OAAO,MAAMA,EAAM,CAAC,EAAE,MAAM,EAC/C,KAAK,SAAWA,EAAM,CAAC,EACvBpB,EAAQ,KAAK,cAAc,KAAK,KAAM,KAAK,GAAI,KAAMqB,EAAc,KAAK,eAAe,KAAK,eAAe,OAAS,CAAC,CAAC,EAClH,KAAK,MAAQ,KAAK,SAClB,KAAK,KAAO,IAEZrB,EACA,OAAOA,EACJ,GAAI,KAAK,WAAY,CAExB,QAAS/C,KAAKqE,EACV,KAAKrE,CAAC,EAAIqE,EAAOrE,CAAC,EAEtB,MAAO,EACX,CACA,MAAO,EACX,EArEO,cAwEX,KAAKD,EAAA,UAAY,CACT,GAAI,KAAK,KACL,OAAO,KAAK,IAEX,KAAK,SACN,KAAK,KAAO,IAGhB,IAAIgD,EACAoB,EACAG,EACAC,EACC,KAAK,QACN,KAAK,OAAS,GACd,KAAK,MAAQ,IAGjB,QADIC,EAAQ,KAAK,cAAc,EACtBC,EAAI,EAAGA,EAAID,EAAM,OAAQC,IAE9B,GADAH,EAAY,KAAK,OAAO,MAAM,KAAK,MAAME,EAAMC,CAAC,CAAC,CAAC,EAC9CH,IAAc,CAACH,GAASG,EAAU,CAAC,EAAE,OAASH,EAAM,CAAC,EAAE,SAGvD,GAFAA,EAAQG,EACRC,EAAQE,EACJ,KAAK,QAAQ,gBAAiB,CAE9B,GADA1B,EAAQ,KAAK,WAAWuB,EAAWE,EAAMC,CAAC,CAAC,EACvC1B,IAAU,GACV,OAAOA,EACJ,GAAI,KAAK,WAAY,CACxBoB,EAAQ,GACR,QACJ,KAEI,OAAO,EAEf,SAAW,CAAC,KAAK,QAAQ,KACrB,MAIZ,OAAIA,GACApB,EAAQ,KAAK,WAAWoB,EAAOK,EAAMD,CAAK,CAAC,EACvCxB,IAAU,GACHA,EAGJ,IAEP,KAAK,SAAW,GACT,KAAK,IAEL,KAAK,WAAW,0BAA4B,KAAK,SAAW,GAAK;AAAA,EAA2B,KAAK,aAAa,EAAG,CACpH,KAAM,GACN,MAAO,KACP,KAAM,KAAK,QACf,CAAC,CAET,EAvDC,QA0DL,IAAIhD,EAAA,UAAgB,CACZ,IAAIsD,EAAI,KAAK,KAAK,EAClB,OAAIA,GAGO,KAAK,IAAI,CAExB,EAPA,OAUJ,MAAMtD,EAAA,SAAgB2E,EAAW,CACzB,KAAK,eAAe,KAAKA,CAAS,CACtC,EAFE,SAKN,SAAS3E,EAAA,UAAqB,CACtB,IAAI8C,EAAI,KAAK,eAAe,OAAS,EACrC,OAAIA,EAAI,EACG,KAAK,eAAe,IAAI,EAExB,KAAK,eAAe,CAAC,CAEpC,EAPK,YAUT,cAAc9C,EAAA,UAA0B,CAChC,OAAI,KAAK,eAAe,QAAU,KAAK,eAAe,KAAK,eAAe,OAAS,CAAC,EACzE,KAAK,WAAW,KAAK,eAAe,KAAK,eAAe,OAAS,CAAC,CAAC,EAAE,MAErE,KAAK,WAAW,QAAW,KAE1C,EANU,iBASd,SAASA,EAAA,SAAmB8C,EAAG,CAEvB,OADAA,EAAI,KAAK,eAAe,OAAS,EAAI,KAAK,IAAIA,GAAK,CAAC,EAChDA,GAAK,EACE,KAAK,eAAeA,CAAC,EAErB,SAEf,EAPK,YAUT,UAAU9C,EAAA,SAAoB2E,EAAW,CACjC,KAAK,MAAMA,CAAS,CACxB,EAFM,aAKV,eAAe3E,EAAA,UAA0B,CACjC,OAAO,KAAK,eAAe,MAC/B,EAFW,kBAGf,QAAS,CAAC,mBAAmB,EAAI,EACjC,cAAeA,EAAA,SAAmBqB,EAAGuD,EAAIC,EAA0BC,EAAU,CAC7E,IAAIC,EAAQD,EACZ,OAAOD,EAA2B,CAClC,IAAK,GACL,MACA,IAAK,GACL,MACA,IAAK,GACL,MACA,IAAK,GACH,GAAIxD,EAAG,eAAiBA,EAAG,cAAc,EACvC,OAAAA,EAAG,kBAAoB,GACvB,KAAK,MAAM,SAAS,EACb,GAGX,MACA,IAAK,GACL,MACA,IAAK,GAAOA,EAAG,eAAiBA,EAAG,cAAc,EAAK,EAAK,KAAK,MAAM,SAAS,EAAG,KAAK,MAAMuD,EAAI,MAAM,EACvG,MACA,IAAK,GAAG,YAAK,MAAM,KAAK,EAAU,EAClC,MACA,IAAK,GACL,MACA,IAAK,GACL,MACA,IAAK,GAAE,MAAO,GAEd,IAAK,IAAI,MAAO,IAEhB,IAAK,IAAI,MAAO,GAEhB,IAAK,IAAI,MAAO,IAEhB,IAAK,IAAI,MAAO,IAEhB,IAAK,IAAI,GAAIvD,EAAG,kBAAqBA,EAAG,kBAAoB,OAAgB,OAAO,IACnF,MACA,IAAK,IAAI,MAAO,IAEhB,IAAK,IAAI,OAAAuD,EAAI,OAASA,EAAI,OAAO,MAAM,EAAG,EAAE,EAAU,GACtD,MACA,IAAK,IAAI,OAAAA,EAAI,OAASA,EAAI,OAAO,MAAM,EAAG,EAAE,EAAE,KAAK,EAAU,GAC7D,MACA,IAAK,IAAI,MAAO,IAEhB,IAAK,IAAI,MAAO,IAEhB,IAAK,IAAI,MAAO,IAEhB,IAAK,IAAI,MAAO,IAEhB,IAAK,IAAI,MAAO,IAEhB,IAAK,IAAI,MAAO,IAEhB,IAAK,IAAI,MAAO,IAEhB,IAAK,IAAI,MAAO,GAEhB,CACA,EA9De,aA+Df,MAAO,CAAC,uBAAuB,sBAAsB,yBAAyB,yBAAyB,eAAe,mBAAmB,gBAAgB,iBAAiB,eAAe,UAAU,wBAAwB,oBAAoB,cAAc,gBAAgB,eAAe,gBAAgB,qBAAqB,qBAAqB,iCAAiC,0BAA0B,8EAA8E,6DAA6D,iCAAiC,iBAAiB,UAAU,SAAS,EACjmB,WAAY,CAAC,IAAM,CAAC,MAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,UAAY,EAAI,EAAE,QAAU,CAAC,MAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,UAAY,EAAI,CAAC,CACtN,EACA,OAAOnC,CACP,GAAG,EACH3C,EAAO,MAAQ2C,EACf,SAASuC,GAAU,CACjB,KAAK,GAAK,CAAC,CACb,CAFS,OAAAhF,EAAAgF,EAAA,UAGTA,EAAO,UAAYlF,EAAOA,EAAO,OAASkF,EACnC,IAAIA,CACX,GAAG,EACFlF,GAAO,OAASA,GAEhB,IAAOmF,GAAQC,GChsBhB,IAAMC,GAAsB,CAAC,EACvBC,GAA4B,CAAC,EAC7BC,GAAgC,CAAC,EACjCC,GAAY,IAAI,IAClBC,GACAC,GAAa,GAEJC,GAAyCC,EAAA,CAACC,EAAgBC,EAAOC,IAAS,CACrF,IAAMC,EAAOC,GAAwBJ,CAAc,EAAE,KAAK,EACpDK,EAAeH,GAAQ,GAAK,KAAK,IAAIF,EAAe,OAAQ,CAAC,EACnEJ,GAAcO,EACVA,EAAK,SAAW,GAClBR,GAAU,IAAIQ,EAAK,CAAC,CAAC,EAGvBX,GAAQ,KAAK,CACX,KAAAW,EACA,KAAME,EACN,MAAOJ,EAAQK,GAAcL,CAAK,EAAI,MACxC,CAAC,CACH,EAbsD,iBAezCM,GAAgBR,EAAA,IACpBP,GADoB,iBAIvBc,GAAgBP,EAACS,GAAiB,CACtC,IAAMC,EAAUD,EAAK,KAAK,EAC1B,OAAIC,EAAQ,QAAU,GAAKA,EAAQ,WAAW,GAAG,GAAKA,EAAQ,SAAS,GAAG,EACjEA,EAAQ,MAAM,EAAG,EAAE,EAErBA,CACT,EANsB,iBAQhBC,GAAsBX,EAACY,GACpBA,GAAQL,GAAcK,CAAK,EADR,uBAIfC,GAAqCb,EAAA,CAACC,EAAgBa,EAAIZ,IAAU,CAC/E,IAAMa,EAAeR,GAAcO,CAAE,EACrCpB,GAAU,KAAK,CACb,KAAMW,GAAwBJ,CAAc,EAAE,KAAK,EACnD,GAAIc,EACJ,MAAOb,EAAQK,GAAcL,CAAK,EAAI,MACxC,CAAC,CACH,EAPkD,eASrCc,GAAuChB,EAAA,CAACC,EAAgBgB,IAAS,CAC5E,IAAMC,EAAUb,GAAwBJ,CAAc,EAAE,KAAK,EACvDkB,EAAiC,CAAC,EACxC,OAAW,CAACC,EAAKR,CAAK,IAAKK,EACzBE,EAAOC,CAAG,EAAIT,GAAoBC,CAAK,GAAKA,EAE9CjB,GAAa,KAAK,CAAE,QAAAuB,EAAS,OAAAC,CAAO,CAAC,CACvC,EAPoD,gBASvCE,GAAerB,EAAA,IACnBL,GADmB,gBAItBU,GAA0BL,EAACC,GACxBA,EAAe,IAAKqB,GAAef,GAAce,CAAU,CAAC,EADrC,2BAInBC,GAA+DvB,EAACC,GAAmB,CAE9F,IAAMuB,EADanB,GAAwBJ,CAAc,EAC9B,OAAQqB,GAAe,CAAC1B,GAAU,IAAI0B,CAAU,CAAC,EAC5E,GAAIE,EAAQ,OAAS,EACnB,MAAM,IAAI,MAAM,2BAA2BA,EAAQ,KAAK,IAAI,CAAC,EAAE,CAEnE,EAN4E,4BAQ/DC,GAAczB,EAAA,IAClBN,GADkB,eAIdgC,GAA2C1B,EAAA,IAAMH,GAAN,kBAC3C8B,GAAyC3B,EAAA,IAAMF,GAAN,iBACzC8B,GAAyC5B,EAAC6B,GAAY,CACjE/B,GAAa+B,CACf,EAFsD,iBAIhDC,GAAmDC,GAAe,KAExE,SAASC,IAAyC,CAChD,OAAOC,GAAcH,GAAqBE,GAAgB,EAAE,IAAI,CAClE,CAFShC,EAAAgC,GAAA,aAIT,IAAME,GAAclC,EAAA,IAAM,CACxBmC,GAAM,EACN1C,GAAQ,OAAS,EACjBC,GAAU,OAAS,EACnBC,GAAa,OAAS,EACtBC,GAAU,MAAM,EAChBC,GAAc,OACdC,GAAa,EACf,EARoB,eAUPsC,GAAa,CACxB,UAAAJ,GACA,MAAOE,GACP,YAAAG,GACA,YAAAC,GACA,gBAAAC,GACA,gBAAAC,GACA,kBAAAC,GACA,kBAAAC,GACA,cAAA3C,GACA,cAAAS,GACA,YAAAK,GACA,aAAAG,GACA,yBAAAO,GACA,YAAAE,GACA,aAAAJ,GACA,eAAAK,GACA,cAAAC,GACA,cAAAC,EACF,EC7HA,IAAMe,GAAYC,EAACC,GACjB;AAAA;AAAA;AAAA,YAGUA,EAAQ,kBAAkB;AAAA,mBACnBA,EAAQ,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA,mBAKlBA,EAAQ,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA,YAKzBA,EAAQ,gBAAgB;AAAA,mBACjBA,EAAQ,UAAU;AAAA;AAAA;AAAA;AAAA,mBAIlBA,EAAQ,UAAU;AAAA,aACxBA,EAAQ,gBAAgB;AAAA;AAAA,EArBnB,aAyBXC,GAAQH,GCff,SAASI,GAAiBC,EAASC,EAAO,CAExC,IAAMC,EAAqBC,GAAsBH,CAAO,EAGlDI,EAAcF,EAAmB,OAAQG,GAAMC,GAAmBD,EAAGL,CAAO,CAAC,EAE/EO,EAAU,EACVC,EAAc,EAEZC,EAAO,CAAC,EAId,GAAIL,EAAY,OAAS,EAAG,CAG1B,IAAMM,EAASC,GAAUP,CAAW,EACpC,QAASQ,EAAI,EAAGA,EAAIR,EAAY,OAAQ,EAAEQ,EAAG,CAC3C,IAAMP,EAAID,EAAYQ,CAAC,EACvBP,EAAE,MAAQ,KAAK,MAAMA,EAAE,EAAIK,EAAO,EAAGL,EAAE,EAAIK,EAAO,CAAC,CACrD,CACAN,EAAY,KAAK,CAACS,EAAGC,IAAMA,EAAE,MAAQD,EAAE,KAAK,EAI5C,IAAIE,EAAKX,EAAYA,EAAY,OAAS,CAAC,EAC3C,QAASQ,EAAI,EAAGA,EAAIR,EAAY,OAAQ,EAAEQ,EAAG,CAC3C,IAAMI,EAAKZ,EAAYQ,CAAC,EAGxBJ,IAAgBO,EAAG,EAAIC,EAAG,IAAMA,EAAG,EAAID,EAAG,GAG1C,IAAME,EAAW,CAAE,GAAID,EAAG,EAAID,EAAG,GAAK,EAAG,GAAIC,EAAG,EAAID,EAAG,GAAK,CAAE,EAE1DG,EAAM,KAEV,QAASC,EAAI,EAAGA,EAAIH,EAAG,YAAY,OAAQ,EAAEG,EAC3C,GAAIJ,EAAG,YAAY,SAASC,EAAG,YAAYG,CAAC,CAAC,EAAG,CAG9C,IAAMC,EAASpB,EAAQgB,EAAG,YAAYG,CAAC,CAAC,EAClCE,EAAK,KAAK,MAAML,EAAG,EAAII,EAAO,EAAGJ,EAAG,EAAII,EAAO,CAAC,EAChDE,EAAK,KAAK,MAAMP,EAAG,EAAIK,EAAO,EAAGL,EAAG,EAAIK,EAAO,CAAC,EAElDG,EAAYD,EAAKD,EACjBE,EAAY,IACdA,GAAa,EAAI,KAAK,IAKxB,IAAMV,EAAIS,EAAKC,EAAY,EACvBC,EAAQC,EAASR,EAAU,CAC7B,EAAGG,EAAO,EAAIA,EAAO,OAAS,KAAK,IAAIP,CAAC,EACxC,EAAGO,EAAO,EAAIA,EAAO,OAAS,KAAK,IAAIP,CAAC,CAC1C,CAAC,EAIGW,EAAQJ,EAAO,OAAS,IAC1BI,EAAQJ,EAAO,OAAS,IAItBF,GAAO,MAAQA,EAAI,MAAQM,KAC7BN,EAAM,CAAE,OAAAE,EAAQ,MAAAI,EAAO,GAAAR,EAAI,GAAAD,EAAI,MAAOS,EAAQJ,EAAO,OAAQ,MAAO,EAAK,EAE7E,CAGEF,GAAO,OACTT,EAAK,KAAKS,CAAG,EACbX,GAAWmB,GAAWR,EAAI,OAAO,OAAQA,EAAI,KAAK,EAClDH,EAAKC,EAET,CACF,KAAO,CAGL,IAAIW,EAAW3B,EAAQ,CAAC,EACxB,QAASY,EAAI,EAAGA,EAAIZ,EAAQ,OAAQ,EAAEY,EAChCZ,EAAQY,CAAC,EAAE,OAASe,EAAS,SAC/BA,EAAW3B,EAAQY,CAAC,GAMxB,IAAIgB,EAAW,GACf,QAAShB,EAAI,EAAGA,EAAIZ,EAAQ,OAAQ,EAAEY,EACpC,GAAIa,EAASzB,EAAQY,CAAC,EAAGe,CAAQ,EAAI,KAAK,IAAIA,EAAS,OAAS3B,EAAQY,CAAC,EAAE,MAAM,EAAG,CAClFgB,EAAW,GACX,KACF,CAGEA,EACFrB,EAAUC,EAAc,GAExBD,EAAUoB,EAAS,OAASA,EAAS,OAAS,KAAK,GACnDlB,EAAK,KAAK,CACR,OAAQkB,EACR,GAAI,CAAE,EAAGA,EAAS,EAAG,EAAGA,EAAS,EAAIA,EAAS,MAAO,EACrD,GAAI,CAAE,EAAGA,EAAS,EAAI,MAAS,EAAGA,EAAS,EAAIA,EAAS,MAAO,EAC/D,MAAOA,EAAS,OAAS,EACzB,MAAO,GACP,MAAO,EACT,CAAC,EAEL,CAEA,OAAAnB,GAAe,EAEXP,IACFA,EAAM,KAAOM,EAAUC,EACvBP,EAAM,QAAUM,EAChBN,EAAM,YAAcO,EACpBP,EAAM,KAAOQ,EACbR,EAAM,YAAcG,EACpBH,EAAM,mBAAqBC,GAGtBK,EAAUC,CACnB,CA7HSqB,EAAA9B,GAAA,oBAqIT,SAASO,GAAmBwB,EAAO9B,EAAS,CAC1C,OAAOA,EAAQ,MAAOoB,GAAWK,EAASK,EAAOV,CAAM,EAAIA,EAAO,OAAS,KAAO,CACpF,CAFSS,EAAAvB,GAAA,sBAST,SAASH,GAAsBH,EAAS,CAEtC,IAAM+B,EAAM,CAAC,EACb,QAASnB,EAAI,EAAGA,EAAIZ,EAAQ,OAAQ,EAAEY,EACpC,QAASO,EAAIP,EAAI,EAAGO,EAAInB,EAAQ,OAAQ,EAAEmB,EAAG,CAC3C,IAAMa,EAAYC,GAAyBjC,EAAQY,CAAC,EAAGZ,EAAQmB,CAAC,CAAC,EACjE,QAAWd,KAAK2B,EACd3B,EAAE,YAAc,CAACO,EAAGO,CAAC,EACrBY,EAAI,KAAK1B,CAAC,CAEd,CAEF,OAAO0B,CACT,CAbSF,EAAA1B,GAAA,yBAqBT,SAASuB,GAAWQ,EAAGV,EAAO,CAC5B,OAAOU,EAAIA,EAAI,KAAK,KAAK,EAAIV,EAAQU,CAAC,GAAKA,EAAIV,GAAS,KAAK,KAAKA,GAAS,EAAIU,EAAIV,EAAM,CAC3F,CAFSK,EAAAH,GAAA,cAUT,SAASD,EAAST,EAAID,EAAI,CACxB,OAAO,KAAK,MAAMC,EAAG,EAAID,EAAG,IAAMC,EAAG,EAAID,EAAG,IAAMC,EAAG,EAAID,EAAG,IAAMC,EAAG,EAAID,EAAG,EAAE,CAChF,CAFSc,EAAAJ,EAAA,YAaT,SAASU,GAAcC,EAAIC,EAAIC,EAAG,CAEhC,GAAIA,GAAKF,EAAKC,EACZ,MAAO,GAIT,GAAIC,GAAK,KAAK,IAAIF,EAAKC,CAAE,EACvB,OAAO,KAAK,GAAK,KAAK,IAAID,EAAIC,CAAE,EAAI,KAAK,IAAID,EAAIC,CAAE,EAGrD,IAAME,EAAKH,GAAME,EAAIA,EAAID,EAAKA,EAAKD,EAAKA,IAAO,EAAIE,GAC7CE,EAAKH,GAAMC,EAAIA,EAAIF,EAAKA,EAAKC,EAAKA,IAAO,EAAIC,GACnD,OAAOZ,GAAWU,EAAIG,CAAE,EAAIb,GAAWW,EAAIG,CAAE,CAC/C,CAdSX,EAAAM,GAAA,iBAyBT,SAASF,GAAyBjB,EAAID,EAAI,CACxC,IAAMuB,EAAIb,EAAST,EAAID,CAAE,EACnBqB,EAAKpB,EAAG,OACRqB,EAAKtB,EAAG,OAGd,GAAIuB,GAAKF,EAAKC,GAAMC,GAAK,KAAK,IAAIF,EAAKC,CAAE,EACvC,MAAO,CAAC,EAGV,IAAMxB,GAAKuB,EAAKA,EAAKC,EAAKA,EAAKC,EAAIA,IAAM,EAAIA,GACvCG,EAAI,KAAK,KAAKL,EAAKA,EAAKvB,EAAIA,CAAC,EAC7B6B,EAAK1B,EAAG,EAAKH,GAAKE,EAAG,EAAIC,EAAG,GAAMsB,EAClCK,EAAK3B,EAAG,EAAKH,GAAKE,EAAG,EAAIC,EAAG,GAAMsB,EAClCM,EAAK,EAAE7B,EAAG,EAAIC,EAAG,IAAMyB,EAAIH,GAC3BO,EAAK,EAAE9B,EAAG,EAAIC,EAAG,IAAMyB,EAAIH,GAEjC,MAAO,CACL,CAAE,EAAGI,EAAKE,EAAI,EAAGD,EAAKE,CAAG,EACzB,CAAE,EAAGH,EAAKE,EAAI,EAAGD,EAAKE,CAAG,CAC3B,CACF,CArBShB,EAAAI,GAAA,4BA4BT,SAAStB,GAAUmC,EAAQ,CACzB,IAAMpC,EAAS,CAAE,EAAG,EAAG,EAAG,CAAE,EAC5B,QAAWoB,KAASgB,EAClBpC,EAAO,GAAKoB,EAAM,EAClBpB,EAAO,GAAKoB,EAAM,EAEpB,OAAApB,EAAO,GAAKoC,EAAO,OACnBpC,EAAO,GAAKoC,EAAO,OACZpC,CACT,CATSmB,EAAAlB,GAAA,aAaT,SAASoC,GAAOC,EAAGnC,EAAGC,EAAGmC,EAAY,CACjCA,EAAaA,GAAc,CAAC,EAC5B,IAAMC,EAAgBD,EAAW,eAAiB,IAC5CE,EAAYF,EAAW,WAAa,MACpCG,EAAKJ,EAAEnC,CAAC,EACRwC,EAAKL,EAAElC,CAAC,EACVwC,EAAQxC,EAAID,EAEhB,GAAIuC,EAAKC,EAAK,EACV,KAAM,iDAGV,GAAID,IAAO,EAAG,OAAOvC,EACrB,GAAIwC,IAAO,EAAG,OAAOvC,EAErB,QAASF,EAAI,EAAGA,EAAIsC,EAAe,EAAEtC,EAAG,CACpC0C,GAAS,EACT,IAAMC,EAAM1C,EAAIyC,EACVE,EAAOR,EAAEO,CAAG,EAMlB,GAJIC,EAAOJ,GAAM,IACbvC,EAAI0C,GAGJ,KAAK,IAAID,CAAK,EAAIH,GAAaK,IAAS,EACxC,OAAOD,CAEf,CACA,OAAO1C,EAAIyC,CACf,CA7BSzB,EAAAkB,GAAA,UAiCT,SAASU,GAAMC,EAAG,CACd,IAAMxB,EAAI,IAAI,MAAMwB,CAAC,EACrB,QAAS9C,EAAI,EAAGA,EAAI8C,EAAG,EAAE9C,EACrBsB,EAAEtB,CAAC,EAAI,EAEX,OAAOsB,CACX,CANSL,EAAA4B,GAAA,SAOT,SAASE,GAAOD,EAAGE,EAAG,CAClB,OAAOH,GAAMC,CAAC,EAAE,IAAI,IAAMD,GAAMG,CAAC,CAAC,CACtC,CAFS/B,EAAA8B,GAAA,UAIT,SAASE,EAAIhD,EAAGC,EAAG,CACf,IAAIiB,EAAM,EACV,QAASnB,EAAI,EAAGA,EAAIC,EAAE,OAAQ,EAAED,EAC5BmB,GAAOlB,EAAED,CAAC,EAAIE,EAAEF,CAAC,EAErB,OAAOmB,CACX,CANSF,EAAAgC,EAAA,OAQT,SAASC,GAAMjD,EAAG,CACd,OAAO,KAAK,KAAKgD,EAAIhD,EAAGA,CAAC,CAAC,CAC9B,CAFSgB,EAAAiC,GAAA,SAIT,SAASC,GAAMhC,EAAKiC,EAAOC,EAAG,CAC1B,QAASrD,EAAI,EAAGA,EAAIoD,EAAM,OAAQ,EAAEpD,EAChCmB,EAAInB,CAAC,EAAIoD,EAAMpD,CAAC,EAAIqD,CAE5B,CAJSpC,EAAAkC,GAAA,SAMT,SAASG,EAAYnC,EAAKQ,EAAI4B,EAAI3B,EAAI4B,EAAI,CACtC,QAASjD,EAAI,EAAGA,EAAIY,EAAI,OAAQ,EAAEZ,EAC9BY,EAAIZ,CAAC,EAAIoB,EAAK4B,EAAGhD,CAAC,EAAIqB,EAAK4B,EAAGjD,CAAC,CAEvC,CAJSU,EAAAqC,EAAA,eAOT,SAASG,GAAWrB,EAAGN,EAAIO,EAAY,CACnCA,EAAaA,GAAc,CAAC,EAE5B,IAAMC,EAAgBD,EAAW,eAAiBP,EAAG,OAAS,IACxD4B,EAAerB,EAAW,cAAgB,KAC1CsB,EAAYtB,EAAW,WAAa,KACpCuB,EAAgBvB,EAAW,eAAiB,KAC5CwB,EAAexB,EAAW,eAAiB,KAC3CyB,EAAMzB,EAAW,MAAQ,OAAYA,EAAW,IAAM,EACtD0B,EAAM1B,EAAW,MAAQ,OAAYA,EAAW,IAAM,EACtD2B,EAAM3B,EAAW,MAAQ,OAAYA,EAAW,IAAM,IACtD4B,EAAQ5B,EAAW,QAAU,OAAYA,EAAW,MAAQ,GAC9D6B,EAGEC,EAAIrC,EAAG,OACPsC,EAAU,IAAI,MAAMD,EAAI,CAAC,EAC/BC,EAAQ,CAAC,EAAItC,EACbsC,EAAQ,CAAC,EAAE,GAAKhC,EAAEN,CAAE,EACpBsC,EAAQ,CAAC,EAAE,GAAK,EAChB,QAASpE,EAAI,EAAGA,EAAImE,EAAG,EAAEnE,EAAG,CACxB,IAAMkB,EAAQY,EAAG,MAAM,EACvBZ,EAAMlB,CAAC,EAAIkB,EAAMlB,CAAC,EAAIkB,EAAMlB,CAAC,EAAI0D,EAAeC,EAChDS,EAAQpE,EAAI,CAAC,EAAIkB,EACjBkD,EAAQpE,EAAI,CAAC,EAAE,GAAKoC,EAAElB,CAAK,EAC3BkD,EAAQpE,EAAI,CAAC,EAAE,GAAKA,EAAI,CAC5B,CAEA,SAASqE,EAAcjB,EAAO,CAC1B,QAASpD,EAAI,EAAGA,EAAIoD,EAAM,OAAQpD,IAC9BoE,EAAQD,CAAC,EAAEnE,CAAC,EAAIoD,EAAMpD,CAAC,EAE3BoE,EAAQD,CAAC,EAAE,GAAKf,EAAM,EAC1B,CALSnC,EAAAoD,EAAA,iBAOT,IAAMC,EAAYrD,EAAA,CAAChB,EAAGC,IAAMD,EAAE,GAAKC,EAAE,GAAnB,aAEZqE,EAAWzC,EAAG,MAAM,EACpB0C,EAAY1C,EAAG,MAAM,EACrB2C,EAAa3C,EAAG,MAAM,EACtB4C,EAAW5C,EAAG,MAAM,EAE1B,QAAS6C,EAAY,EAAGA,EAAYrC,EAAe,EAAEqC,EAAW,CAG5D,GAFAP,EAAQ,KAAKE,CAAS,EAElBjC,EAAW,QAAS,CAGpB,IAAMuC,EAAgBR,EAAQ,IAAKtB,GAAM,CACrC,IAAM+B,EAAQ/B,EAAE,MAAM,EACtB,OAAA+B,EAAM,GAAK/B,EAAE,GACb+B,EAAM,GAAK/B,EAAE,GACN+B,CACX,CAAC,EACDD,EAAc,KAAK,CAAC3E,EAAGC,IAAMD,EAAE,GAAKC,EAAE,EAAE,EAExCmC,EAAW,QAAQ,KAAK,CACpB,EAAG+B,EAAQ,CAAC,EAAE,MAAM,EACpB,GAAIA,EAAQ,CAAC,EAAE,GACf,QAASQ,CACb,CAAC,CACL,CAEAV,EAAU,EACV,QAASlE,EAAI,EAAGA,EAAImE,EAAG,EAAEnE,EACrBkE,EAAU,KAAK,IAAIA,EAAS,KAAK,IAAIE,EAAQ,CAAC,EAAEpE,CAAC,EAAIoE,EAAQ,CAAC,EAAEpE,CAAC,CAAC,CAAC,EAGvE,GAAI,KAAK,IAAIoE,EAAQ,CAAC,EAAE,GAAKA,EAAQD,CAAC,EAAE,EAAE,EAAIP,GAAiBM,EAAUL,EACrE,MAIJ,QAAS7D,EAAI,EAAGA,EAAImE,EAAG,EAAEnE,EAAG,CACxBuE,EAASvE,CAAC,EAAI,EACd,QAASO,EAAI,EAAGA,EAAI4D,EAAG,EAAE5D,EACrBgE,EAASvE,CAAC,GAAKoE,EAAQ7D,CAAC,EAAEP,CAAC,EAE/BuE,EAASvE,CAAC,GAAKmE,CACnB,CAIA,IAAMW,EAAQV,EAAQD,CAAC,EAKvB,GAJAb,EAAYkB,EAAW,EAAIV,EAAKS,EAAU,CAACT,EAAKgB,CAAK,EACrDN,EAAU,GAAKpC,EAAEoC,CAAS,EAGtBA,EAAU,GAAKJ,EAAQ,CAAC,EAAE,GAC1Bd,EAAYoB,EAAU,EAAIX,EAAKQ,EAAU,CAACR,EAAKe,CAAK,EACpDJ,EAAS,GAAKtC,EAAEsC,CAAQ,EACpBA,EAAS,GAAKF,EAAU,GACxBH,EAAcK,CAAQ,EAEtBL,EAAcG,CAAS,UAMtBA,EAAU,IAAMJ,EAAQD,EAAI,CAAC,EAAE,GAAI,CACxC,IAAIY,EAAe,GAsBnB,GApBIP,EAAU,GAAKM,EAAM,IAErBxB,EAAYmB,EAAY,EAAIT,EAAKO,EAAU,CAACP,EAAKc,CAAK,EACtDL,EAAW,GAAKrC,EAAEqC,CAAU,EACxBA,EAAW,GAAKK,EAAM,GACtBT,EAAcI,CAAU,EAExBM,EAAe,KAInBzB,EAAYmB,EAAY,EAAIT,EAAMF,EAAKS,EAAUP,EAAMF,EAAKgB,CAAK,EACjEL,EAAW,GAAKrC,EAAEqC,CAAU,EACxBA,EAAW,GAAKD,EAAU,GAC1BH,EAAcI,CAAU,EAExBM,EAAe,IAInBA,EAAc,CAEd,GAAId,GAAS,EAAG,MAGhB,QAASjE,EAAI,EAAGA,EAAIoE,EAAQ,OAAQ,EAAEpE,EAClCsD,EAAYc,EAAQpE,CAAC,EAAG,EAAIiE,EAAOG,EAAQ,CAAC,EAAGH,EAAOG,EAAQpE,CAAC,CAAC,EAChEoE,EAAQpE,CAAC,EAAE,GAAKoC,EAAEgC,EAAQpE,CAAC,CAAC,CAEpC,CACJ,MACIqE,EAAcG,CAAS,CAE/B,CAEA,OAAAJ,EAAQ,KAAKE,CAAS,EACf,CAAE,GAAIF,EAAQ,CAAC,EAAE,GAAI,EAAGA,EAAQ,CAAC,CAAE,CAC9C,CA5ISnD,EAAAwC,GAAA,cAqJT,SAASuB,GAAgB5C,EAAG6C,EAAIC,EAASC,EAAMlF,EAAGmF,EAAIC,EAAI,CACtD,IAAMC,EAAOJ,EAAQ,GACfK,EAAYtC,EAAIiC,EAAQ,QAASD,CAAE,EACrCO,EAAMF,EACNG,EAAUH,EACVI,EAAWH,EACXI,EAAK,EAET1F,EAAIA,GAAK,EACTmF,EAAKA,GAAM,KACXC,EAAKA,GAAM,GAEX,SAASO,EAAKC,EAAMC,EAAQC,EAAQ,CAChC,QAASpB,EAAY,EAAGA,EAAY,GAAI,EAAEA,EAMtC,GALA1E,GAAK4F,EAAOC,GAAU,EACtBxC,EAAY6B,EAAK,EAAG,EAAKD,EAAQ,EAAGjF,EAAGgF,CAAE,EACzCO,EAAML,EAAK,GAAK/C,EAAE+C,EAAK,EAAGA,EAAK,OAAO,EACtCO,EAAWzC,EAAIkC,EAAK,QAASF,CAAE,EAE3BO,EAAMF,EAAOF,EAAKnF,EAAIsF,GAAaC,GAAOO,EAC1CD,EAAS7F,MACN,CACH,GAAI,KAAK,IAAIyF,CAAQ,GAAK,CAACL,EAAKE,EAC5B,OAAOtF,EAGPyF,GAAYI,EAASD,IAAS,IAC9BC,EAASD,GAGbA,EAAO5F,EACP8F,EAASP,CACb,CAGJ,MAAO,EACX,CAxBSvE,EAAA2E,EAAA,QA0BT,QAASjB,EAAY,EAAGA,EAAY,GAAI,EAAEA,EAAW,CAIjD,GAHArB,EAAY6B,EAAK,EAAG,EAAKD,EAAQ,EAAGjF,EAAGgF,CAAE,EACzCO,EAAML,EAAK,GAAK/C,EAAE+C,EAAK,EAAGA,EAAK,OAAO,EACtCO,EAAWzC,EAAIkC,EAAK,QAASF,CAAE,EAC3BO,EAAMF,EAAOF,EAAKnF,EAAIsF,GAAcZ,GAAaa,GAAOC,EACxD,OAAOG,EAAKD,EAAI1F,EAAGwF,CAAO,EAG9B,GAAI,KAAK,IAAIC,CAAQ,GAAK,CAACL,EAAKE,EAC5B,OAAOtF,EAGX,GAAIyF,GAAY,EACZ,OAAOE,EAAK3F,EAAG0F,EAAIH,CAAG,EAG1BC,EAAUD,EACVG,EAAK1F,EACLA,GAAK,CACT,CAEA,OAAOA,CACX,CA5DSgB,EAAA+D,GAAA,mBA8DT,SAASgB,GAAkB5D,EAAG6D,EAASC,EAAQ,CAG3C,IAAIhB,EAAU,CAAE,EAAGe,EAAQ,MAAM,EAAG,GAAI,EAAG,QAASA,EAAQ,MAAM,CAAE,EAChEd,EAAO,CAAE,EAAGc,EAAQ,MAAM,EAAG,GAAI,EAAG,QAASA,EAAQ,MAAM,CAAE,EAC3DE,EAAKF,EAAQ,MAAM,EACrBhB,EACAmB,EACAnG,EAAI,EACJqC,EAEJ4D,EAASA,GAAU,CAAC,EACpB5D,EAAgB4D,EAAO,eAAiBD,EAAQ,OAAS,GAEzDf,EAAQ,GAAK9C,EAAE8C,EAAQ,EAAGA,EAAQ,OAAO,EACzCD,EAAKC,EAAQ,QAAQ,MAAM,EAC3B/B,GAAM8B,EAAIC,EAAQ,QAAS,EAAE,EAE7B,QAASlF,EAAI,EAAGA,EAAIsC,EAAe,EAAEtC,EAAG,CAapC,GAZAC,EAAI+E,GAAgB5C,EAAG6C,EAAIC,EAASC,EAAMlF,CAAC,EAGvCiG,EAAO,SACPA,EAAO,QAAQ,KAAK,CAChB,EAAGhB,EAAQ,EAAE,MAAM,EACnB,GAAIA,EAAQ,GACZ,QAASA,EAAQ,QAAQ,MAAM,EAC/B,MAAOjF,CACX,CAAC,EAGD,CAACA,EAGDkD,GAAM8B,EAAIC,EAAQ,QAAS,EAAE,MAC1B,CAEH5B,EAAY6C,EAAI,EAAGhB,EAAK,QAAS,GAAID,EAAQ,OAAO,EAEpD,IAAMmB,EAAUpD,EAAIiC,EAAQ,QAASA,EAAQ,OAAO,EAC9CoB,EAAS,KAAK,IAAI,EAAGrD,EAAIkD,EAAIhB,EAAK,OAAO,EAAIkB,CAAO,EAE1D/C,EAAY2B,EAAIqB,EAAQrB,EAAI,GAAIE,EAAK,OAAO,EAE5CiB,EAAOlB,EACPA,EAAUC,EACVA,EAAOiB,CACX,CAEA,GAAIlD,GAAMgC,EAAQ,OAAO,GAAK,KAC1B,KAER,CAEA,OAAIgB,EAAO,SACPA,EAAO,QAAQ,KAAK,CAChB,EAAGhB,EAAQ,EAAE,MAAM,EACnB,GAAIA,EAAQ,GACZ,QAASA,EAAQ,QAAQ,MAAM,EAC/B,MAAOjF,CACX,CAAC,EAGEiF,CACX,CAhESjE,EAAA+E,GAAA,qBAyET,SAASO,GAAKC,EAAMnE,EAAa,CAAC,EAAG,CACnCA,EAAW,cAAgBA,EAAW,eAAiB,IAEvD,IAAMoE,EAAgBpE,EAAW,eAAiBqE,GAC5CC,EAAOtE,EAAW,cAAgBuE,GAGlCC,EAAQC,GAAgBN,EAAMnE,CAAU,EAGxCjD,EAAUqH,EAAcI,EAAOxE,CAAU,EAGzC0E,EAAS,OAAO,KAAK3H,CAAO,EAE5B6G,EAAU,CAAC,EACjB,QAAWe,KAASD,EAClBd,EAAQ,KAAK7G,EAAQ4H,CAAK,EAAE,CAAC,EAC7Bf,EAAQ,KAAK7G,EAAQ4H,CAAK,EAAE,CAAC,EAuB/B,IAAMC,EAnBWxD,GACdyD,GAAW,CACV,IAAMhC,EAAU,CAAC,EACjB,QAASlF,EAAI,EAAGA,EAAI+G,EAAO,OAAQ,EAAE/G,EAAG,CACtC,IAAMgH,EAAQD,EAAO/G,CAAC,EACtBkF,EAAQ8B,CAAK,EAAI,CACf,EAAGE,EAAO,EAAIlH,CAAC,EACf,EAAGkH,EAAO,EAAIlH,EAAI,CAAC,EACnB,OAAQZ,EAAQ4H,CAAK,EAAE,MAEzB,CACF,CACA,OAAOL,EAAKzB,EAAS2B,CAAK,CAC5B,EACAZ,EACA5D,CACF,EAG2B,EAC3B,QAASrC,EAAI,EAAGA,EAAI+G,EAAO,OAAQ,EAAE/G,EAAG,CACtC,IAAMgH,EAAQD,EAAO/G,CAAC,EACtBZ,EAAQ4H,CAAK,EAAE,EAAIC,EAAU,EAAIjH,CAAC,EAClCZ,EAAQ4H,CAAK,EAAE,EAAIC,EAAU,EAAIjH,EAAI,CAAC,CACxC,CAEA,OAAOZ,CACT,CAjDS6B,EAAAsF,GAAA,QAmDT,IAAMY,GAAQ,MAUd,SAASC,GAA0B5F,EAAIC,EAAI4F,EAAS,CAElD,OAAI,KAAK,IAAI7F,EAAIC,CAAE,EAAI,KAAK,IAAID,EAAIC,CAAE,EAAI,KAAK,IAAM4F,EAAUF,GACtD,KAAK,IAAI3F,EAAKC,CAAE,EAGlBU,GAAQtB,GAAaU,GAAcC,EAAIC,EAAIZ,CAAQ,EAAIwG,EAAS,EAAG7F,EAAKC,CAAE,CACnF,CAPSR,EAAAmG,GAAA,6BAiBT,SAASN,GAAgBD,EAAOxE,EAAa,CAAC,EAAG,CAC/C,IAAMiF,EAAWjF,EAAW,SACtBf,EAAIuF,EAAM,IAAKU,GAAM,OAAO,OAAO,CAAC,EAAGA,CAAC,CAAC,EAE/C,SAASC,EAAMC,EAAK,CAClB,OAAOA,EAAI,KAAK,GAAG,CACrB,CAEA,GAJSxG,EAAAuG,EAAA,SAILF,EAAU,CAGZ,IAAMI,EAAQ,IAAI,IAClB,QAAWC,KAAQrG,EACjB,QAAStB,EAAI,EAAGA,EAAI2H,EAAK,KAAK,OAAQ3H,IAAK,CACzC,IAAM4H,EAAK,OAAOD,EAAK,KAAK3H,CAAC,CAAC,EAC9B0H,EAAM,IAAIE,EAAID,EAAK,MAAQD,EAAM,IAAIE,CAAE,GAAK,EAAE,EAC9C,QAASrH,EAAIP,EAAI,EAAGO,EAAIoH,EAAK,KAAK,OAAQpH,IAAK,CAC7C,IAAMsH,EAAK,OAAOF,EAAK,KAAKpH,CAAC,CAAC,EACxBuH,EAAK,GAAGF,CAAE,IAAIC,CAAE,GAChBE,EAAK,GAAGF,CAAE,IAAID,CAAE,GACtBF,EAAM,IAAII,EAAIH,EAAK,MAAQD,EAAM,IAAII,CAAE,GAAK,EAAE,EAC9CJ,EAAM,IAAIK,EAAIJ,EAAK,MAAQD,EAAM,IAAIK,CAAE,GAAK,EAAE,CAChD,CACF,CAEF,QAAWJ,KAAQrG,EACbqG,EAAK,KAAK,OAAS,IACrBA,EAAK,KAAOD,EAAM,IAAIF,EAAMG,EAAK,IAAI,CAAC,EAG5C,CAGA,IAAMK,EAAM,CAAC,EAGPC,EAAQ,IAAI,IAClB,QAAWN,KAAQrG,EACjB,GAAIqG,EAAK,KAAK,SAAW,EACvBK,EAAI,KAAKL,EAAK,KAAK,CAAC,CAAC,UACZA,EAAK,KAAK,SAAW,EAAG,CACjC,IAAM1H,EAAI0H,EAAK,KAAK,CAAC,EACfzH,EAAIyH,EAAK,KAAK,CAAC,EACrBM,EAAM,IAAIT,EAAMG,EAAK,IAAI,CAAC,EAC1BM,EAAM,IAAIT,EAAM,CAACtH,EAAGD,CAAC,CAAC,CAAC,CACzB,CAGF+H,EAAI,KAAK,CAAC/H,EAAGC,IAAOD,IAAMC,EAAI,EAAID,EAAIC,EAAI,GAAK,CAAG,EAElD,QAASF,EAAI,EAAGA,EAAIgI,EAAI,OAAQ,EAAEhI,EAAG,CACnC,IAAMC,EAAI+H,EAAIhI,CAAC,EACf,QAASO,EAAIP,EAAI,EAAGO,EAAIyH,EAAI,OAAQ,EAAEzH,EAAG,CACvC,IAAML,EAAI8H,EAAIzH,CAAC,EACV0H,EAAM,IAAIT,EAAM,CAACvH,EAAGC,CAAC,CAAC,CAAC,GAC1BoB,EAAE,KAAK,CAAE,KAAM,CAACrB,EAAGC,CAAC,EAAG,KAAM,CAAE,CAAC,CAEpC,CACF,CACA,OAAOoB,CACT,CA5DSL,EAAA6F,GAAA,mBAqET,SAASoB,GAAoBrB,EAAOL,EAAMO,EAAQ,CAKhD,IAAMoB,EAAYpF,GAAOyD,EAAK,OAAQA,EAAK,MAAM,EAI3C4B,EAAcrF,GAAOyD,EAAK,OAAQA,EAAK,MAAM,EAInD,OAAAK,EACG,OAAQ/D,GAAMA,EAAE,KAAK,SAAW,CAAC,EACjC,QAASoC,GAAY,CACpB,IAAMmD,EAAOtB,EAAO7B,EAAQ,KAAK,CAAC,CAAC,EAC7BoD,EAAQvB,EAAO7B,EAAQ,KAAK,CAAC,CAAC,EAC9B1D,EAAK,KAAK,KAAKgF,EAAK6B,CAAI,EAAE,KAAO,KAAK,EAAE,EACxC5G,EAAK,KAAK,KAAK+E,EAAK8B,CAAK,EAAE,KAAO,KAAK,EAAE,EACzCzH,EAAWuG,GAA0B5F,EAAIC,EAAIyD,EAAQ,IAAI,EAE/DiD,EAAUE,CAAI,EAAEC,CAAK,EAAIH,EAAUG,CAAK,EAAED,CAAI,EAAIxH,EAIlD,IAAIwC,EAAI,EACJ6B,EAAQ,KAAO,OAAS,KAAK,IAAIsB,EAAK6B,CAAI,EAAE,KAAM7B,EAAK8B,CAAK,EAAE,IAAI,EACpEjF,EAAI,EACK6B,EAAQ,MAAQ,QACzB7B,EAAI,IAEN+E,EAAYC,CAAI,EAAEC,CAAK,EAAIF,EAAYE,CAAK,EAAED,CAAI,EAAIhF,CACxD,CAAC,EAEI,CAAE,UAAA8E,EAAW,YAAAC,CAAY,CAClC,CApCSnH,EAAAiH,GAAA,uBAuCT,SAASK,GAAuBzF,EAAG0F,EAASL,EAAWC,EAAa,CAClE,QAASpI,EAAI,EAAGA,EAAIwI,EAAQ,OAAQ,EAAExI,EACpCwI,EAAQxI,CAAC,EAAI,EAGf,IAAI2G,EAAO,EACX,QAAS3G,EAAI,EAAGA,EAAImI,EAAU,OAAQ,EAAEnI,EAAG,CACzC,IAAMyI,EAAK3F,EAAE,EAAI9C,CAAC,EACZ0I,EAAK5F,EAAE,EAAI9C,EAAI,CAAC,EACtB,QAASO,EAAIP,EAAI,EAAGO,EAAI4H,EAAU,OAAQ,EAAE5H,EAAG,CAC7C,IAAMoI,EAAK7F,EAAE,EAAIvC,CAAC,EACZqI,EAAK9F,EAAE,EAAIvC,EAAI,CAAC,EAChBsI,EAAMV,EAAUnI,CAAC,EAAEO,CAAC,EACpBuI,EAAaV,EAAYpI,CAAC,EAAEO,CAAC,EAE7BwI,GAAmBJ,EAAKF,IAAOE,EAAKF,IAAOG,EAAKF,IAAOE,EAAKF,GAC5D7H,EAAW,KAAK,KAAKkI,CAAe,EACpCrG,EAAQqG,EAAkBF,EAAMA,EAEjCC,EAAa,GAAKjI,GAAYgI,GAASC,EAAa,GAAKjI,GAAYgI,IAI1ElC,GAAQ,EAAIjE,EAAQA,EAEpB8F,EAAQ,EAAIxI,CAAC,GAAK,EAAI0C,GAAS+F,EAAKE,GACpCH,EAAQ,EAAIxI,EAAI,CAAC,GAAK,EAAI0C,GAASgG,EAAKE,GAExCJ,EAAQ,EAAIjI,CAAC,GAAK,EAAImC,GAASiG,EAAKF,GACpCD,EAAQ,EAAIjI,EAAI,CAAC,GAAK,EAAImC,GAASkG,EAAKF,GAC1C,CACF,CACA,OAAO/B,CACT,CAjCS1F,EAAAsH,GAAA,0BAuCT,SAAS7B,GAAkBG,EAAOX,EAAS,CAAC,EAAG,CAC7C,IAAID,EAAU+C,GAAanC,EAAOX,CAAM,EAClCS,EAAOT,EAAO,cAAgBU,GAMpC,GAAIC,EAAM,QAAU,EAAG,CACrB,IAAMoC,EAAcC,GAAqBrC,EAAOX,CAAM,EAChDiD,EAAkBxC,EAAKsC,EAAapC,CAAK,EACzCuC,EAAazC,EAAKV,EAASY,CAAK,EAElCsC,EAAkB,KAAOC,IAC3BnD,EAAUgD,EAEd,CACA,OAAOhD,CACT,CAlBShF,EAAAyF,GAAA,qBAyBT,SAASwC,GAAqBrC,EAAOX,EAAS,CAAC,EAAG,CAChD,IAAMmD,EAAWnD,EAAO,UAAY,GAG9BM,EAAO,CAAC,EACRO,EAAS,CAAC,EAChB,QAAWY,KAAQd,EACbc,EAAK,KAAK,SAAW,IACvBZ,EAAOY,EAAK,KAAK,CAAC,CAAC,EAAInB,EAAK,OAC5BA,EAAK,KAAKmB,CAAI,GAIlB,GAAI,CAAE,UAAAQ,EAAW,YAAAC,CAAY,EAAIF,GAAoBrB,EAAOL,EAAMO,CAAM,EAIlEuC,EAAOpG,GAAMiF,EAAU,IAAIjF,EAAK,CAAC,EAAIiF,EAAU,OACrDA,EAAYA,EAAU,IAAKoB,GAAQA,EAAI,IAAKnG,GAAUA,EAAQkG,CAAI,CAAC,EAEnE,IAAME,EAAMvI,EAAA,CAAC6B,EAAG0F,IAAYD,GAAuBzF,EAAG0F,EAASL,EAAWC,CAAW,EAAzE,OAERqB,EAAO,KACX,QAASzJ,EAAI,EAAGA,EAAIqJ,EAAU,EAAErJ,EAAG,CACjC,IAAMiG,EAAUpD,GAAMsF,EAAU,OAAS,CAAC,EAAE,IAAI,KAAK,MAAM,EAErDjD,EAAUc,GAAkBwD,EAAKvD,EAASC,CAAM,GAClD,CAACuD,GAAQvE,EAAQ,GAAKuE,EAAK,MAC7BA,EAAOvE,EAEX,CAEA,IAAM+B,EAAYwC,EAAK,EAIjBrK,EAAU,CAAC,EACjB,QAASY,EAAI,EAAGA,EAAIwG,EAAK,OAAQ,EAAExG,EAAG,CACpC,IAAM0J,EAAMlD,EAAKxG,CAAC,EAClBZ,EAAQsK,EAAI,KAAK,CAAC,CAAC,EAAI,CACrB,EAAGzC,EAAU,EAAIjH,CAAC,EAAIsJ,EACtB,EAAGrC,EAAU,EAAIjH,EAAI,CAAC,EAAIsJ,EAC1B,OAAQ,KAAK,KAAKI,EAAI,KAAO,KAAK,EAAE,CACtC,CACF,CAEA,GAAIxD,EAAO,QACT,QAAWrE,KAAKqE,EAAO,QACrB/C,GAAMtB,EAAE,EAAGyH,CAAI,EAGnB,OAAOlK,CACT,CApDS6B,EAAAiI,GAAA,wBA6DT,SAASF,GAAanC,EAAOX,EAAQ,CACnC,IAAMS,EAAOT,GAAUA,EAAO,aAAeA,EAAO,aAAeU,GAI7DxH,EAAU,CAAC,EAEXuK,EAAc,CAAC,EACrB,QAAWhC,KAAQd,EACjB,GAAIc,EAAK,KAAK,SAAW,EAAG,CAC1B,IAAM+B,EAAM/B,EAAK,KAAK,CAAC,EACvBvI,EAAQsK,CAAG,EAAI,CACb,EAAG,KACH,EAAG,KACH,MAAOtK,EAAQ,OACf,KAAMuI,EAAK,KACX,OAAQ,KAAK,KAAKA,EAAK,KAAO,KAAK,EAAE,CACvC,EACAgC,EAAYD,CAAG,EAAI,CAAC,CACtB,CAGF7C,EAAQA,EAAM,OAAQ5G,GAAMA,EAAE,KAAK,SAAW,CAAC,EAG/C,QAAWiF,KAAW2B,EAAO,CAC3B,IAAI+C,EAAS1E,EAAQ,QAAU,KAAOA,EAAQ,OAAS,EACjDmD,EAAOnD,EAAQ,KAAK,CAAC,EACrBoD,EAAQpD,EAAQ,KAAK,CAAC,EAGxBA,EAAQ,KAAOiC,IAAS,KAAK,IAAI/H,EAAQiJ,CAAI,EAAE,KAAMjJ,EAAQkJ,CAAK,EAAE,IAAI,IAC1EsB,EAAS,GAGXD,EAAYtB,CAAI,EAAE,KAAK,CAAE,IAAKC,EAAO,KAAMpD,EAAQ,KAAM,OAAA0E,CAAO,CAAC,EACjED,EAAYrB,CAAK,EAAE,KAAK,CAAE,IAAKD,EAAM,KAAMnD,EAAQ,KAAM,OAAA0E,CAAO,CAAC,CACnE,CAGA,IAAMC,EAAiB,CAAC,EACxB,OAAO,KAAKF,CAAW,EAAE,QAASD,GAAQ,CACxC,IAAII,EAAO,EACX,QAAS9J,EAAI,EAAGA,EAAI2J,EAAYD,CAAG,EAAE,OAAQ,EAAE1J,EAC7C8J,GAAQH,EAAYD,CAAG,EAAE1J,CAAC,EAAE,KAAO2J,EAAYD,CAAG,EAAE1J,CAAC,EAAE,OAGzD6J,EAAe,KAAK,CAAE,IAAAH,EAAK,KAAAI,CAAK,CAAC,CACnC,CAAC,EAGD,SAASxF,EAAUrE,EAAGC,EAAG,CACvB,OAAOA,EAAE,KAAOD,EAAE,IACpB,CAFSgB,EAAAqD,EAAA,aAGTuF,EAAe,KAAKvF,CAAS,EAG7B,IAAMyF,EAAa,CAAC,EACpB,SAASC,EAAaC,EAAS,CAC7B,OAAOA,EAAQ,OAAOF,CACxB,CAFS9I,EAAA+I,EAAA,gBAST,SAASE,EAAYhJ,EAAOiJ,EAAO,CACjC/K,EAAQ+K,CAAK,EAAE,EAAIjJ,EAAM,EACzB9B,EAAQ+K,CAAK,EAAE,EAAIjJ,EAAM,EACzB6I,EAAWI,CAAK,EAAI,EACtB,CAJSlJ,EAAAiJ,EAAA,eAOTA,EAAY,CAAE,EAAG,EAAG,EAAG,CAAE,EAAGL,EAAe,CAAC,EAAE,GAAG,EAKjD,QAAS7J,EAAI,EAAGA,EAAI6J,EAAe,OAAQ,EAAE7J,EAAG,CAC9C,IAAMoK,EAAWP,EAAe7J,CAAC,EAAE,IAC7BqH,EAAUsC,EAAYS,CAAQ,EAAE,OAAOJ,CAAY,EACnDN,EAAMtK,EAAQgL,CAAQ,EAG5B,GAFA/C,EAAQ,KAAK/C,CAAS,EAElB+C,EAAQ,SAAW,EAErB,KAAM,8CAIR,IAAMnF,EAAS,CAAC,EAChB,QAAS3B,EAAI,EAAGA,EAAI8G,EAAQ,OAAQ,EAAE9G,EAAG,CAEvC,IAAMH,EAAKhB,EAAQiI,EAAQ9G,CAAC,EAAE,GAAG,EAC3B8J,EAAKjD,GAA0BsC,EAAI,OAAQtJ,EAAG,OAAQiH,EAAQ9G,CAAC,EAAE,IAAI,EAG3E2B,EAAO,KAAK,CAAE,EAAG9B,EAAG,EAAIiK,EAAI,EAAGjK,EAAG,CAAE,CAAC,EACrC8B,EAAO,KAAK,CAAE,EAAG9B,EAAG,EAAIiK,EAAI,EAAGjK,EAAG,CAAE,CAAC,EACrC8B,EAAO,KAAK,CAAE,EAAG9B,EAAG,EAAIiK,EAAI,EAAGjK,EAAG,CAAE,CAAC,EACrC8B,EAAO,KAAK,CAAE,EAAG9B,EAAG,EAAIiK,EAAI,EAAGjK,EAAG,CAAE,CAAC,EAIrC,QAASkK,EAAI/J,EAAI,EAAG+J,EAAIjD,EAAQ,OAAQ,EAAEiD,EAAG,CAC3C,IAAMnK,EAAKf,EAAQiI,EAAQiD,CAAC,EAAE,GAAG,EAC3BC,EAAKnD,GAA0BsC,EAAI,OAAQvJ,EAAG,OAAQkH,EAAQiD,CAAC,EAAE,IAAI,EAErEE,EAAcnJ,GAClB,CAAE,EAAGjB,EAAG,EAAG,EAAGA,EAAG,EAAG,OAAQiK,CAAG,EAC/B,CAAE,EAAGlK,EAAG,EAAG,EAAGA,EAAG,EAAG,OAAQoK,CAAG,CACjC,EACArI,EAAO,KAAK,GAAGsI,CAAW,CAC5B,CACF,CAIA,IAAIC,EAAW,KACXC,EAAYxI,EAAO,CAAC,EACxB,QAAWhB,KAASgB,EAAQ,CAC1B9C,EAAQgL,CAAQ,EAAE,EAAIlJ,EAAM,EAC5B9B,EAAQgL,CAAQ,EAAE,EAAIlJ,EAAM,EAC5B,IAAMyJ,EAAYhE,EAAKvH,EAASyH,CAAK,EACjC8D,EAAYF,IACdA,EAAWE,EACXD,EAAYxJ,EAEhB,CAEAgJ,EAAYQ,EAAWN,CAAQ,CACjC,CAEA,OAAOhL,CACT,CAvIS6B,EAAA+H,GAAA,gBAiJT,SAASpC,GAAaxH,EAASwL,EAAU,CACvC,IAAIC,EAAS,EAEb,QAAWlD,KAAQiD,EAAU,CAC3B,GAAIjD,EAAK,KAAK,SAAW,EACvB,SAGF,IAAIN,EACJ,GAAIM,EAAK,KAAK,SAAW,EAAG,CAC1B,IAAMU,EAAOjJ,EAAQuI,EAAK,KAAK,CAAC,CAAC,EAC3BW,EAAQlJ,EAAQuI,EAAK,KAAK,CAAC,CAAC,EAClCN,EAAU9F,GAAc8G,EAAK,OAAQC,EAAM,OAAQzH,EAASwH,EAAMC,CAAK,CAAC,CAC1E,MACEjB,EAAUlI,GAAiBwI,EAAK,KAAK,IAAKjG,GAAMtC,EAAQsC,CAAC,CAAC,CAAC,EAG7D,IAAMkI,EAASjC,EAAK,QAAU,KAAOA,EAAK,OAAS,EACnDkD,GAAUjB,GAAUvC,EAAUM,EAAK,OAASN,EAAUM,EAAK,KAC7D,CAEA,OAAOkD,CACT,CAtBS5J,EAAA2F,GAAA,gBAwBT,SAASkE,GAAqB1L,EAASwL,EAAU,CAC/C,IAAIC,EAAS,EAEb,QAAWlD,KAAQiD,EAAU,CAC3B,GAAIjD,EAAK,KAAK,SAAW,EACvB,SAGF,IAAIN,EACJ,GAAIM,EAAK,KAAK,SAAW,EAAG,CAC1B,IAAMU,EAAOjJ,EAAQuI,EAAK,KAAK,CAAC,CAAC,EAC3BW,EAAQlJ,EAAQuI,EAAK,KAAK,CAAC,CAAC,EAClCN,EAAU9F,GAAc8G,EAAK,OAAQC,EAAM,OAAQzH,EAASwH,EAAMC,CAAK,CAAC,CAC1E,MACEjB,EAAUlI,GAAiBwI,EAAK,KAAK,IAAKjG,GAAMtC,EAAQsC,CAAC,CAAC,CAAC,EAG7D,IAAMkI,EAASjC,EAAK,QAAU,KAAOA,EAAK,OAAS,EAC7CoD,EAAsB,KAAK,KAAK1D,EAAU,IAAMM,EAAK,KAAO,EAAE,EACpEkD,GAAUjB,EAASmB,EAAsBA,CAC3C,CAEA,OAAOF,CACT,CAvBS5J,EAAA6J,GAAA,wBA+BT,SAASE,GAAiB5L,EAAS6L,EAAaC,EAAkB,CAQhE,GAPIA,GAAoB,KACtB9L,EAAQ,KAAK,CAACa,EAAGC,IAAMA,EAAE,OAASD,EAAE,MAAM,EAE1Cb,EAAQ,KAAK8L,CAAgB,EAI3B9L,EAAQ,OAAS,EAAG,CACtB,IAAM+L,EAAW/L,EAAQ,CAAC,EAAE,EACtBgM,EAAWhM,EAAQ,CAAC,EAAE,EAE5B,QAAWoB,KAAUpB,EACnBoB,EAAO,GAAK2K,EACZ3K,EAAO,GAAK4K,CAEhB,CAcA,GAZIhM,EAAQ,SAAW,GAGRyB,EAASzB,EAAQ,CAAC,EAAGA,EAAQ,CAAC,CAAC,EACjC,KAAK,IAAIA,EAAQ,CAAC,EAAE,OAASA,EAAQ,CAAC,EAAE,MAAM,IACvDA,EAAQ,CAAC,EAAE,EAAIA,EAAQ,CAAC,EAAE,EAAIA,EAAQ,CAAC,EAAE,OAASA,EAAQ,CAAC,EAAE,OAAS,MACtEA,EAAQ,CAAC,EAAE,EAAIA,EAAQ,CAAC,EAAE,GAM1BA,EAAQ,OAAS,EAAG,CACtB,IAAMiM,EAAW,KAAK,MAAMjM,EAAQ,CAAC,EAAE,EAAGA,EAAQ,CAAC,EAAE,CAAC,EAAI6L,EACpD5H,EAAI,KAAK,IAAIgI,CAAQ,EACrB9D,EAAI,KAAK,IAAI8D,CAAQ,EAE3B,QAAW7K,KAAUpB,EAAS,CAC5B,IAAM0D,EAAItC,EAAO,EACXwC,EAAIxC,EAAO,EACjBA,EAAO,EAAI6C,EAAIP,EAAIyE,EAAIvE,EACvBxC,EAAO,EAAI+G,EAAIzE,EAAIO,EAAIL,CACzB,CACF,CAIA,GAAI5D,EAAQ,OAAS,EAAG,CACtB,IAAIkM,EAAQ,KAAK,MAAMlM,EAAQ,CAAC,EAAE,EAAGA,EAAQ,CAAC,EAAE,CAAC,EAAI6L,EACrD,KAAOK,EAAQ,GACbA,GAAS,EAAI,KAAK,GAEpB,KAAOA,EAAQ,EAAI,KAAK,IACtBA,GAAS,EAAI,KAAK,GAEpB,GAAIA,EAAQ,KAAK,GAAI,CACnB,IAAMC,EAAQnM,EAAQ,CAAC,EAAE,GAAK,MAAQA,EAAQ,CAAC,EAAE,GACjD,QAAWoB,KAAUpB,EAAS,CAC5B,IAAIsC,GAAKlB,EAAO,EAAI+K,EAAQ/K,EAAO,IAAM,EAAI+K,EAAQA,GACrD/K,EAAO,EAAI,EAAIkB,EAAIlB,EAAO,EAC1BA,EAAO,EAAI,EAAIkB,EAAI6J,EAAQ/K,EAAO,CACpC,CACF,CACF,CACF,CA9DSS,EAAA+J,GAAA,oBAqET,SAASQ,GAAgBpM,EAAS,CAEhCA,EAAQ,QAASoB,GAAW,CAC1BA,EAAO,OAASA,CAClB,CAAC,EAGD,SAASiL,EAAKjL,EAAQ,CACpB,OAAIA,EAAO,SAAWA,IACpBA,EAAO,OAASiL,EAAKjL,EAAO,MAAM,GAE7BA,EAAO,MAChB,CALSS,EAAAwK,EAAA,QAOT,SAASC,EAAM5I,EAAGE,EAAG,CACnB,IAAM2I,EAAQF,EAAK3I,CAAC,EACd8I,EAAQH,EAAKzI,CAAC,EACpB2I,EAAM,OAASC,CACjB,CAJS3K,EAAAyK,EAAA,SAOT,QAAS,EAAI,EAAG,EAAItM,EAAQ,OAAQ,EAAE,EACpC,QAASmB,EAAI,EAAI,EAAGA,EAAInB,EAAQ,OAAQ,EAAEmB,EAAG,CAC3C,IAAMsL,EAAczM,EAAQ,CAAC,EAAE,OAASA,EAAQmB,CAAC,EAAE,OAC/CM,EAASzB,EAAQ,CAAC,EAAGA,EAAQmB,CAAC,CAAC,EAAI,MAAQsL,GAC7CH,EAAMtM,EAAQmB,CAAC,EAAGnB,EAAQ,CAAC,CAAC,CAEhC,CAKF,IAAM0M,EAAmB,IAAI,IAC7B,QAAS,EAAI,EAAG,EAAI1M,EAAQ,OAAQ,EAAE,EAAG,CACvC,IAAM4H,EAAQyE,EAAKrM,EAAQ,CAAC,CAAC,EAAE,OAAO,MACjC0M,EAAiB,IAAI9E,CAAK,GAC7B8E,EAAiB,IAAI9E,EAAO,CAAC,CAAC,EAEhC8E,EAAiB,IAAI9E,CAAK,EAAE,KAAK5H,EAAQ,CAAC,CAAC,CAC7C,CAGA,OAAAA,EAAQ,QAASoB,GAAW,CAC1B,OAAOA,EAAO,MAChB,CAAC,EAGM,MAAM,KAAKsL,EAAiB,OAAO,CAAC,CAC7C,CAhDS7K,EAAAuK,GAAA,mBAsDT,SAASO,GAAe3M,EAAS,CAC/B,IAAM4M,EAAS/K,EAACS,GAAM,CACpB,IAAMuK,EAAK7M,EAAQ,OAAO,CAAC8M,EAAK7I,IAAM,KAAK,IAAI6I,EAAK7I,EAAE3B,CAAC,EAAI2B,EAAE,MAAM,EAAG,OAAO,iBAAiB,EACxF8I,EAAK/M,EAAQ,OAAO,CAAC8M,EAAK7I,IAAM,KAAK,IAAI6I,EAAK7I,EAAE3B,CAAC,EAAI2B,EAAE,MAAM,EAAG,OAAO,iBAAiB,EAC9F,MAAO,CAAE,IAAK4I,EAAI,IAAKE,CAAG,CAC5B,EAJe,UAKf,MAAO,CAAE,OAAQH,EAAO,GAAG,EAAG,OAAQA,EAAO,GAAG,CAAE,CACpD,CAPS/K,EAAA8K,GAAA,kBAgBT,SAASK,GAAkBC,EAAUpB,EAAaC,EAAkB,CAC9DD,GAAe,OACjBA,EAAc,KAAK,GAAK,GAK1B,IAAI7L,EAAUkN,GAAmBD,CAAQ,EAAE,IAAK3K,GAAM,OAAO,OAAO,CAAC,EAAGA,CAAC,CAAC,EAGpE6K,EAAWf,GAAgBpM,CAAO,EAGxC,QAAWoN,KAAWD,EAAU,CAC9BvB,GAAiBwB,EAASvB,EAAaC,CAAgB,EACvD,IAAMuB,EAASV,GAAeS,CAAO,EACrCA,EAAQ,MAAQC,EAAO,OAAO,IAAMA,EAAO,OAAO,MAAQA,EAAO,OAAO,IAAMA,EAAO,OAAO,KAC5FD,EAAQ,OAASC,CACnB,CACAF,EAAS,KAAK,CAACtM,EAAGC,IAAMA,EAAE,KAAOD,EAAE,IAAI,EAGvCb,EAAUmN,EAAS,CAAC,EACpB,IAAIG,EAAetN,EAAQ,OACrBuN,GAAWD,EAAa,OAAO,IAAMA,EAAa,OAAO,KAAO,GAOtE,SAASE,EAAWJ,EAASlE,EAAOuE,EAAQ,CAC1C,GAAI,CAACL,EACH,OAGF,IAAMC,EAASD,EAAQ,OAEnBM,EAEAC,EAEJ,GAAIzE,EACFwE,EAAUJ,EAAa,OAAO,IAAMD,EAAO,OAAO,IAAME,MACnD,CACLG,EAAUJ,EAAa,OAAO,IAAMD,EAAO,OAAO,IAClD,IAAMO,GACHP,EAAO,OAAO,IAAMA,EAAO,OAAO,KAAO,GAAKC,EAAa,OAAO,IAAMA,EAAa,OAAO,KAAO,EAClGM,EAAY,IACdF,GAAWE,EAEf,CAEA,GAAIH,EACFE,EAAUL,EAAa,OAAO,IAAMD,EAAO,OAAO,IAAME,MACnD,CACLI,EAAUL,EAAa,OAAO,IAAMD,EAAO,OAAO,IAClD,IAAMO,GACHP,EAAO,OAAO,IAAMA,EAAO,OAAO,KAAO,GAAKC,EAAa,OAAO,IAAMA,EAAa,OAAO,KAAO,EAClGM,EAAY,IACdD,GAAWC,EAEf,CAEA,QAAW3J,KAAKmJ,EACdnJ,EAAE,GAAKyJ,EACPzJ,EAAE,GAAK0J,EACP3N,EAAQ,KAAKiE,CAAC,CAElB,CAtCSpC,EAAA2L,EAAA,cAwCT,IAAIzC,EAAQ,EACZ,KAAOA,EAAQoC,EAAS,QACtBK,EAAWL,EAASpC,CAAK,EAAG,GAAM,EAAK,EACvCyC,EAAWL,EAASpC,EAAQ,CAAC,EAAG,GAAO,EAAI,EAC3CyC,EAAWL,EAASpC,EAAQ,CAAC,EAAG,GAAM,EAAI,EAC1CA,GAAS,EAITuC,EAAeX,GAAe3M,CAAO,EAIvC,OAAO6N,GAAiB7N,CAAO,CACjC,CArFS6B,EAAAmL,GAAA,qBAmGT,SAASc,GAAcb,EAAUzL,EAAOuM,EAAQC,EAASC,EAAY,CACnE,IAAMjO,EAAUkN,GAAmBD,CAAQ,EAE3CzL,GAAS,EAAIwM,EACbD,GAAU,EAAIC,EAEd,GAAM,CAAE,OAAAE,EAAQ,OAAAC,CAAO,EAAIxB,GAAe3M,CAAO,EAEjD,GAAIkO,EAAO,MAAQA,EAAO,KAAOC,EAAO,MAAQA,EAAO,IACrD,eAAQ,IAAI,0CAA0C,EAC/ClB,EAIT,IAAImB,EAEAC,EACJ,GAAIJ,EAAY,CACd,IAAMK,EAAkB,KAAK,KAAKL,EAAa,KAAK,EAAE,EAAI,EAC1DG,EAAW5M,EAAQ8M,EACnBD,EAAWN,EAASO,CACtB,MACEF,EAAW5M,GAAS0M,EAAO,IAAMA,EAAO,KACxCG,EAAWN,GAAUI,EAAO,IAAMA,EAAO,KAG3C,IAAMI,EAAU,KAAK,IAAIF,EAAUD,CAAQ,EAErCV,GAAWlM,GAAS0M,EAAO,IAAMA,EAAO,KAAOK,GAAW,EAC1DZ,GAAWI,GAAUI,EAAO,IAAMA,EAAO,KAAOI,GAAW,EAEjE,OAAOV,GACL7N,EAAQ,IAAKoB,IAAY,CACvB,OAAQmN,EAAUnN,EAAO,OACzB,EAAG4M,EAAUN,GAAWtM,EAAO,EAAI8M,EAAO,KAAOK,EACjD,EAAGP,EAAUL,GAAWvM,EAAO,EAAI+M,EAAO,KAAOI,EACjD,MAAOnN,EAAO,KAChB,EAAE,CACJ,CACF,CAvCSS,EAAAiM,GAAA,iBA6CT,SAASD,GAAiB7N,EAAS,CAEjC,IAAMkC,EAAI,CAAC,EACX,QAAWd,KAAUpB,EACnBkC,EAAEd,EAAO,KAAK,EAAIA,EAEpB,OAAOc,CACT,CAPSL,EAAAgM,GAAA,oBAYT,SAASX,GAAmBD,EAAU,CAEpC,OADe,OAAO,KAAKA,CAAQ,EACrB,IAAKuB,GAAO,OAAO,OAAOvB,EAASuB,CAAE,EAAG,CAAE,MAAOA,CAAG,CAAC,CAAC,CACtE,CAHS3M,EAAAqL,GAAA,sBAoBT,SAASuB,GAAYC,EAAU,CAAC,EAAG,CACjC,IAAIC,EAAa,GACfnN,EAAQ,IACRuM,EAAS,IACTC,EAAU,GACVY,EAAW,IACX/C,EAAc,KAAK,GAAK,EACxBgD,EAAY,GACZZ,EAAa,KACba,EAAO,GACPC,EAAS,GACTC,EAAW,KACXlD,EAAmB,KACnB5D,EAAW,GACX+G,EAAQ,KACRC,EAAwBR,GAAWA,EAAQ,sBAAwBA,EAAQ,sBAAwB,GAGnGS,EAAY,CAAC,EAIbC,EACEV,GAAWA,EAAQ,aACfA,EAAQ,aACRA,GAAWA,EAAQ,YACjBA,EAAQ,YACR,CACE,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,SACF,EACRW,EAAc,EACdC,EAAUzN,EAAA,SAAU0N,EAAK,CACvB,GAAIA,KAAOJ,EACT,OAAOA,EAAUI,CAAG,EAEtB,IAAIxN,EAAOoN,EAAUI,CAAG,EAAIH,EAAaC,CAAW,EACpD,OAAAA,GAAe,EACXA,GAAeD,EAAa,SAC9BC,EAAc,GAETtN,CACT,EAVU,WAWVyN,EAAiBrI,GACjBI,EAAOC,GAET,SAASiI,EAAMC,EAAW,CACxB,IAAIC,EAAOD,EAAU,MAAM,EAGrBE,EAAW,IAAI,IACrBD,EAAK,QAASE,GAAU,CAClBA,EAAM,MAAQ,GAAKA,EAAM,KAAK,QAAU,GAC1CD,EAAS,IAAIC,EAAM,KAAK,CAAC,CAAC,CAE9B,CAAC,EACDF,EAAOA,EAAK,OAAQE,GAAU,CAACA,EAAM,KAAK,KAAMvF,GAAQsF,EAAS,IAAItF,CAAG,CAAC,CAAC,EAE1E,IAAItK,EAAU,CAAC,EACX8P,EAAc,CAAC,EAEnB,GAAIH,EAAK,OAAS,EAAG,CACnB,IAAI1C,EAAWuC,EAAeG,EAAM,CAAE,aAAcpI,EAAM,SAAAW,CAAS,CAAC,EAEhE2G,IACF5B,EAAWD,GAAkBC,EAAUpB,EAAaC,CAAgB,GAGtE9L,EAAU8N,GAAcb,EAAUzL,EAAOuM,EAAQC,EAASC,CAAU,EACpE6B,EAAcC,GAAmB/P,EAAS2P,EAAMT,CAAqB,CACvE,CAIA,IAAMc,EAAS,CAAC,EAChBL,EAAK,QAASE,GAAU,CAClBA,EAAM,QACRG,EAAOH,EAAM,IAAI,EAAIA,EAAM,MAE/B,CAAC,EAED,SAASI,EAAM3N,EAAG,CAChB,GAAIA,EAAE,QAAQ0N,EACZ,OAAOA,EAAO1N,EAAE,IAAI,EAEtB,GAAIA,EAAE,KAAK,QAAU,EACnB,MAAO,GAAKA,EAAE,KAAK,CAAC,CAExB,CAPST,EAAAoO,EAAA,SAUTP,EAAU,UAAU,KAAK,EAAE,KAAK,CAAC1P,CAAO,CAAC,EAAE,MAAM,EAAE,OAAO,KAAK,EAE/D,IAAMkQ,EAAMR,EAAU,OAAO,KAAK,EAE9Bf,EACFuB,EAAI,KAAK,UAAW,OAAO1O,CAAK,IAAIuM,CAAM,EAAE,EAE5CmC,EAAI,KAAK,QAAS1O,CAAK,EAAE,KAAK,SAAUuM,CAAM,EAKhD,IAAMoC,EAAW,CAAC,EACdC,EAAc,GAClBF,EAAI,UAAU,iBAAiB,EAAE,KAAK,SAAU5N,EAAG,CACjD,IAAM+N,EAAO,KAAK,aAAa,GAAG,EAC9B/N,EAAE,KAAK,QAAU,GAAK+N,GAAQ,CAACnI,IACjCkI,EAAc,GACdD,EAAS7N,EAAE,KAAK,CAAC,CAAC,EAAIgO,GAAeD,CAAI,EAE7C,CAAC,EAGD,SAASE,EAAUjO,EAAG,CACpB,OAAQkO,GAAM,CACZ,IAAMvM,GAAI3B,EAAE,KAAK,IAAKgI,GAAQ,CAC5B,IAAImG,EAAQN,EAAS7F,CAAG,EACpBoG,EAAM1Q,EAAQsK,CAAG,EACrB,OAAKmG,IACHA,EAAQ,CAAE,EAAGjP,EAAQ,EAAG,EAAGuM,EAAS,EAAG,OAAQ,CAAE,GAE9C2C,IACHA,EAAM,CAAE,EAAGlP,EAAQ,EAAG,EAAGuM,EAAS,EAAG,OAAQ,CAAE,GAE1C,CACL,EAAG0C,EAAM,GAAK,EAAID,GAAKE,EAAI,EAAIF,EAC/B,EAAGC,EAAM,GAAK,EAAID,GAAKE,EAAI,EAAIF,EAC/B,OAAQC,EAAM,QAAU,EAAID,GAAKE,EAAI,OAASF,CAChD,CACF,CAAC,EACD,OAAOG,GAAqB1M,GAAGgL,CAAK,CACtC,CACF,CAnBSpN,EAAA0O,EAAA,aAsBT,IAAMK,EAAQV,EAAI,UAAU,YAAY,EAAE,KAAKP,EAAOrN,GAAMA,EAAE,IAAI,EAG5DuO,EAAQD,EACX,MAAM,EACN,OAAO,GAAG,EACV,KACC,QACCtO,GACC,kBAAkBA,EAAE,KAAK,QAAU,EAAI,SAAW,cAAc,GAC9DA,EAAE,QAAUA,EAAE,MAAQ,iBAAmB,EAC3C,EACJ,EACC,KAAK,iBAAmBA,GAAMA,EAAE,KAAK,KAAK,GAAG,CAAC,EAE3CwO,EAAYD,EAAM,OAAO,MAAM,EAC/BE,EAAYF,EACf,OAAO,MAAM,EACb,KAAK,QAAS,OAAO,EACrB,KAAMvO,GAAM2N,EAAM3N,CAAC,CAAC,EACpB,KAAK,cAAe,QAAQ,EAC5B,KAAK,KAAM,OAAO,EAClB,KAAK,IAAKd,EAAQ,CAAC,EACnB,KAAK,IAAKuM,EAAS,CAAC,EAGnBgB,IACF+B,EACG,MAAM,eAAgB,GAAG,EACzB,OAAQxO,GAAMA,EAAE,KAAK,QAAU,CAAC,EAChC,MAAM,OAASA,GAAOA,EAAE,OAASA,EAAE,OAASA,EAAE,MAAQA,EAAE,MAAQgN,EAAQhN,EAAE,IAAI,CAAE,EAChF,MAAM,eAAgB,KAAK,EAE9ByO,EAAU,MAAM,OAASzO,GACnBA,EAAE,QAAUA,EAAE,MACT,OAELoM,EAAQ,SACHA,EAAQ,SAEVpM,EAAE,KAAK,QAAU,EAAIgN,EAAQhN,EAAE,IAAI,EAAI,MAC/C,GAGH,SAAS0O,EAAa7I,EAAG,CACvB,OAAI,OAAOA,EAAE,YAAe,WACnBA,EAAE,WAAW,MAAM,EAAE,SAASyG,CAAQ,EAExCzG,CACT,CALStG,EAAAmP,EAAA,gBAQT,IAAIC,EAASvB,EACTU,GAAe,OAAOa,EAAO,YAAe,YAC9CA,EAASD,EAAatB,CAAS,EAC/BuB,EAAO,UAAU,MAAM,EAAE,UAAU,IAAKV,CAAS,GAEjDU,EAAO,UAAU,MAAM,EAAE,KAAK,IAAM3O,GAAMqO,GAAqBrO,EAAE,KAAK,IAAKgI,GAAQtK,EAAQsK,CAAG,CAAC,CAAC,EAAG2E,CAAK,EAG1G,IAAMiC,EAAaD,EAChB,UAAU,MAAM,EAChB,OAAQ3O,GAAMA,EAAE,QAAQwN,CAAW,EACnC,KAAMxN,GAAM2N,EAAM3N,CAAC,CAAC,EACpB,KAAK,IAAMA,GAAM,KAAK,MAAMwN,EAAYxN,EAAE,IAAI,EAAE,CAAC,CAAC,EAClD,KAAK,IAAMA,GAAM,KAAK,MAAMwN,EAAYxN,EAAE,IAAI,EAAE,CAAC,CAAC,EAEjDwM,IACEsB,EAGE,OAAQc,EACVA,EAAW,GAAG,MAAOC,GAASnR,EAASiQ,CAAK,CAAC,EAE7CiB,EAAW,KAAK,MAAOC,GAASnR,EAASiQ,CAAK,CAAC,EAGjDiB,EAAW,KAAKC,GAASnR,EAASiQ,CAAK,CAAC,GAK5C,IAAMmB,EAAOJ,EAAaJ,EAAM,KAAK,CAAC,EAAE,OAAO,EAC3C,OAAOA,EAAM,YAAe,YAC9BQ,EAAK,UAAU,MAAM,EAAE,UAAU,IAAKb,CAAS,EAGjD,IAAMc,EAAWD,EACd,UAAU,MAAM,EAChB,KAAK,IAAK5P,EAAQ,CAAC,EACnB,KAAK,IAAKuM,EAAS,CAAC,EAIvB,OAAIiB,IAAa,OACf+B,EAAU,MAAM,YAAa,KAAK,EAClCG,EAAW,MAAM,YAAalC,CAAQ,EACtCqC,EAAS,MAAM,YAAa,KAAK,GAG5B,CAAE,QAAArR,EAAS,YAAA8P,EAAa,MAAAc,EAAO,MAAAC,EAAO,OAAAI,EAAQ,KAAAG,CAAK,CAC5D,CA/LS,OAAAvP,EAAA4N,EAAA,SAiMTA,EAAM,KAAO,SAAU6B,EAAG,CACxB,OAAK,UAAU,QACfxC,EAAOwC,EACA7B,GAFuBX,CAGhC,EAEAW,EAAM,WAAa,UAAY,CAC7B,OAAAd,EAAa,GACNc,CACT,EAEAA,EAAM,MAAQ,SAAU6B,EAAG,CACzB,OAAK,UAAU,QACf9P,EAAQ8P,EACD7B,GAFuBjO,CAGhC,EAEAiO,EAAM,OAAS,SAAU6B,EAAG,CAC1B,OAAK,UAAU,QACfvD,EAASuD,EACF7B,GAFuB1B,CAGhC,EAEA0B,EAAM,QAAU,SAAU6B,EAAG,CAC3B,OAAK,UAAU,QACftD,EAAUsD,EACH7B,GAFuBzB,CAGhC,EAEAyB,EAAM,SAAW,SAAU6B,EAAG,CAC5B,OAAK,UAAU,QACfpJ,EAAWoJ,EACJ7B,GAFuBvH,CAGhC,EAEAuH,EAAM,QAAU,SAAU6B,EAAG,CAC3B,OAAK,UAAU,QACfhC,EAAUgC,EACH7B,GAFuBH,CAGhC,EAEAG,EAAM,OAAS,SAAU6B,EAAG,CAC1B,OAAK,UAAU,QACfhC,EAAUgC,EACH7B,GAFuBH,CAGhC,EAEAG,EAAM,SAAW,SAAU6B,EAAG,CAC5B,OAAK,UAAU,QACftC,EAAWsC,EACJ7B,GAFuBT,CAGhC,EAEAS,EAAM,MAAQ,SAAU6B,EAAG,CACzB,OAAK,UAAU,QACfrC,EAAQqC,EACD7B,GAFuBR,CAGhC,EAEAQ,EAAM,SAAW,SAAU6B,EAAG,CAC5B,OAAK,UAAU,QACf1C,EAAW0C,EACJ7B,GAFuBb,CAGhC,EAEAa,EAAM,eAAiB,SAAU6B,EAAG,CAClC,OAAK,UAAU,QACf9B,EAAiB8B,EACV7B,GAFuBD,CAGhC,EAEAC,EAAM,UAAY,SAAU6B,EAAG,CAC7B,OAAK,UAAU,QACfzC,EAAYyC,EACL7B,GAFuBZ,CAGhC,EAEAY,EAAM,WAAa,SAAU6B,EAAG,CAC9B,OAAK,UAAU,QACfrD,EAAaqD,EACN7B,GAFuBxB,CAGhC,EAEAwB,EAAM,OAAS,SAAU6B,EAAG,CAC1B,OAAK,UAAU,QACfvC,EAASuC,EACF7B,GAFuBV,CAGhC,EAEAU,EAAM,YAAc,SAAU6B,EAAG,CAC/B,OAAK,UAAU,QACfzF,EAAcyF,EACP7B,GAFuB5D,CAGhC,EAEA4D,EAAM,iBAAmB,SAAU6B,EAAG,CACpC,OAAK,UAAU,QACfxF,EAAmBwF,EACZ7B,GAFuB3D,CAGhC,EAEA2D,EAAM,aAAe,SAAU6B,EAAG,CAChC,OAAK,UAAU,QACf/J,EAAO+J,IAAM,UAAY9J,GAAe8J,IAAM,WAAa5F,GAAuB4F,EAC3E7B,GAFuBlI,CAGhC,EAEOkI,CACT,CAnWS5N,EAAA4M,GAAA,eA4WT,SAAS0C,GAASnR,EAASuR,EAAU,CACnC,OAAO,SAAU5B,EAAM,CACrB,IAAM6B,EAAO,KACPhQ,EAAQxB,EAAQ2P,EAAK,KAAK,CAAC,CAAC,EAAE,QAAU,GACxCM,EAAQsB,EAAS5B,CAAI,GAAK,GAE1B8B,EAAQxB,EAAM,MAAM,KAAK,EAAE,QAAQ,EAEnCyB,GAAYzB,EAAM,OAASwB,EAAM,QADtB,EAGbE,EAAOF,EAAM,IAAI,EACjBG,EAAO,CAACD,CAAI,EACZE,EAAa,EACXC,EAAa,IACnBN,EAAK,YAAc,KACnB,IAAMO,EAAS,CAAC,EAEhB,SAASC,EAAOL,EAAM,CACpB,IAAMM,EAAQT,EAAK,cAAc,gBAAgBA,EAAK,aAAc,OAAO,EAC3E,OAAAS,EAAM,YAAcN,EACpBI,EAAO,KAAKE,CAAK,EACjBT,EAAK,OAAOS,CAAK,EACVA,CACT,CANSpQ,EAAAmQ,EAAA,UAOT,IAAIC,EAAQD,EAAOL,CAAI,EAEvB,KACEA,EAAOF,EAAM,IAAI,EACb,EAACE,GAFM,CAKXC,EAAK,KAAKD,CAAI,EACd,IAAMO,EAASN,EAAK,KAAK,GAAG,EAC5BK,EAAM,YAAcC,EAChBA,EAAO,OAASR,GAAYO,EAAM,sBAAsB,EAAIzQ,IAC9DoQ,EAAK,IAAI,EACTK,EAAM,YAAcL,EAAK,KAAK,GAAG,EACjCA,EAAO,CAACD,CAAI,EACZM,EAAQD,EAAOL,CAAI,EACnBE,IAEJ,CAEA,IAAMhL,EAAU,IAAQgL,EAAaC,EAAc,EAC7CpO,EAAI8N,EAAK,aAAa,GAAG,EACzB5N,EAAI4N,EAAK,aAAa,GAAG,EAC/BO,EAAO,QAAQ,CAACvB,EAAG5P,IAAM,CACvB4P,EAAE,aAAa,IAAK9M,CAAC,EACrB8M,EAAE,aAAa,IAAK5M,CAAC,EACrB4M,EAAE,aAAa,KAAM,GAAG3J,EAAUjG,EAAIkR,CAAU,IAAI,CACtD,CAAC,CACH,CACF,CApDSjQ,EAAAsP,GAAA,YA6DT,SAASgB,GAAarM,EAASsM,EAAUC,EAAU,CACjD,IAAIC,EAASF,EAAS,CAAC,EAAE,OAAS3Q,EAAS2Q,EAAS,CAAC,EAAGtM,CAAO,EAE/D,QAAS,EAAI,EAAG,EAAIsM,EAAS,OAAQ,EAAE,EAAG,CACxC,IAAMG,EAAIH,EAAS,CAAC,EAAE,OAAS3Q,EAAS2Q,EAAS,CAAC,EAAGtM,CAAO,EACxDyM,GAAKD,IACPA,EAASC,EAEb,CAEA,QAAS,EAAI,EAAG,EAAIF,EAAS,OAAQ,EAAE,EAAG,CACxC,IAAME,EAAI9Q,EAAS4Q,EAAS,CAAC,EAAGvM,CAAO,EAAIuM,EAAS,CAAC,EAAE,OACnDE,GAAKD,IACPA,EAASC,EAEb,CACA,OAAOD,CACT,CAjBSzQ,EAAAsQ,GAAA,gBA4BT,SAASK,GAAkBJ,EAAUC,EAAUnD,EAAuB,CAIpE,IAAMpM,EAAS,CAAC,EAChB,QAAWmB,KAAKmO,EACdtP,EAAO,KAAK,CAAE,EAAGmB,EAAE,EAAG,EAAGA,EAAE,CAAE,CAAC,EAC9BnB,EAAO,KAAK,CAAE,EAAGmB,EAAE,EAAIA,EAAE,OAAS,EAAG,EAAGA,EAAE,CAAE,CAAC,EAC7CnB,EAAO,KAAK,CAAE,EAAGmB,EAAE,EAAIA,EAAE,OAAS,EAAG,EAAGA,EAAE,CAAE,CAAC,EAC7CnB,EAAO,KAAK,CAAE,EAAGmB,EAAE,EAAG,EAAGA,EAAE,EAAIA,EAAE,OAAS,CAAE,CAAC,EAC7CnB,EAAO,KAAK,CAAE,EAAGmB,EAAE,EAAG,EAAGA,EAAE,EAAIA,EAAE,OAAS,CAAE,CAAC,EAG/C,IAAI4C,EAAU/D,EAAO,CAAC,EAClBwP,EAASH,GAAarP,EAAO,CAAC,EAAGsP,EAAUC,CAAQ,EAEvD,QAASzR,EAAI,EAAGA,EAAIkC,EAAO,OAAQ,EAAElC,EAAG,CACtC,IAAM2R,EAAIJ,GAAarP,EAAOlC,CAAC,EAAGwR,EAAUC,CAAQ,EAChDE,GAAKD,IACPzL,EAAU/D,EAAOlC,CAAC,EAClB0R,EAASC,EAEb,CAGA,IAAMtF,EAAW5I,GACdhE,GAAM,GAAK8R,GAAa,CAAE,EAAG9R,EAAE,CAAC,EAAG,EAAGA,EAAE,CAAC,CAAE,EAAG+R,EAAUC,CAAQ,EACjE,CAACxL,EAAQ,EAAGA,EAAQ,CAAC,EACrB,CAAE,cAAe,IAAK,cAAe,KAAM,CAC7C,EAAE,EAEI9E,EAAM,CAAE,EAAGmN,EAAwB,EAAIjC,EAAS,CAAC,EAAG,EAAGA,EAAS,CAAC,CAAE,EAIrEwF,EAAQ,GACZ,QAAW7R,KAAKwR,EACd,GAAI3Q,EAASM,EAAKnB,CAAC,EAAIA,EAAE,OAAQ,CAC/B6R,EAAQ,GACR,KACF,CAGF,QAAWC,KAAKL,EACd,GAAI5Q,EAASM,EAAK2Q,CAAC,EAAIA,EAAE,OAAQ,CAC/BD,EAAQ,GACR,KACF,CAEF,GAAIA,EACF,OAAO1Q,EAGT,GAAIqQ,EAAS,QAAU,EACrB,MAAO,CAAE,EAAGA,EAAS,CAAC,EAAE,EAAG,EAAGA,EAAS,CAAC,EAAE,CAAE,EAE9C,IAAMO,EAAY,CAAC,EAGnB,OAFA5S,GAAiBqS,EAAUO,CAAS,EAEhCA,EAAU,KAAK,SAAW,EACrB,CAAE,EAAG,EAAG,EAAG,KAAO,SAAU,EAAK,EAEtCA,EAAU,KAAK,QAAU,EACpB,CAAE,EAAGA,EAAU,KAAK,CAAC,EAAE,OAAO,EAAG,EAAGA,EAAU,KAAK,CAAC,EAAE,OAAO,CAAE,EAEpEN,EAAS,OAEJG,GAAkBJ,EAAU,CAAC,CAAC,EAMhCzR,GAAUgS,EAAU,KAAK,IAAK9R,GAAMA,EAAE,EAAE,CAAC,CAClD,CA1ESgB,EAAA2Q,GAAA,qBA8ET,SAASI,GAAsB5S,EAAS,CACtC,IAAM+B,EAAM,CAAC,EACP8Q,EAAY,OAAO,KAAK7S,CAAO,EACrC,QAAW8S,KAAYD,EACrB9Q,EAAI+Q,CAAQ,EAAI,CAAC,EAEnB,QAASlS,EAAI,EAAGA,EAAIiS,EAAU,OAAQjS,IAAK,CACzC,IAAMmS,EAAKF,EAAUjS,CAAC,EAChBC,EAAIb,EAAQ+S,CAAE,EACpB,QAAS5R,EAAIP,EAAI,EAAGO,EAAI0R,EAAU,OAAQ,EAAE1R,EAAG,CAC7C,IAAM6R,EAAKH,EAAU1R,CAAC,EAChBL,EAAId,EAAQgT,CAAE,EACd1Q,EAAIb,EAASZ,EAAGC,CAAC,EAEnBwB,EAAIxB,EAAE,QAAUD,EAAE,OAAS,MAC7BkB,EAAIiR,CAAE,EAAE,KAAKD,CAAE,EACNzQ,EAAIzB,EAAE,QAAUC,EAAE,OAAS,OACpCiB,EAAIgR,CAAE,EAAE,KAAKC,CAAE,CAEnB,CACF,CACA,OAAOjR,CACT,CAtBSF,EAAA+Q,GAAA,yBAwBT,SAAS7C,GAAmB/P,EAASyH,EAAOyH,EAAuB,CACjE,IAAMnN,EAAM,CAAC,EACPkR,EAAaL,GAAsB5S,CAAO,EAChD,QAASY,EAAI,EAAGA,EAAI6G,EAAM,OAAQ,EAAE7G,EAAG,CACrC,IAAM2H,EAAOd,EAAM7G,CAAC,EAAE,KAChBsS,EAAU,CAAC,EACXC,EAAU,CAAC,EAEjB,QAAShS,EAAI,EAAGA,EAAIoH,EAAK,OAAQ,EAAEpH,EAAG,CACpC+R,EAAQ3K,EAAKpH,CAAC,CAAC,EAAI,GACnB,IAAMqK,EAAWyH,EAAW1K,EAAKpH,CAAC,CAAC,EAInC,QAAS+J,EAAI,EAAGA,EAAIM,EAAS,OAAQ,EAAEN,EACrCiI,EAAQ3H,EAASN,CAAC,CAAC,EAAI,EAE3B,CAEA,IAAMkH,EAAW,CAAC,EACZC,EAAW,CAAC,EAClB,QAASzK,KAAS5H,EACZ4H,KAASsL,EACXd,EAAS,KAAKpS,EAAQ4H,CAAK,CAAC,EACjBA,KAASuL,GACpBd,EAAS,KAAKrS,EAAQ4H,CAAK,CAAC,EAGhC,IAAMwL,EAASZ,GAAkBJ,EAAUC,EAAUnD,CAAqB,EAC1EnN,EAAIwG,CAAI,EAAI6K,EACRA,EAAO,UAAY3L,EAAM7G,CAAC,EAAE,KAAO,GACrC,QAAQ,IAAI,iBAAmB2H,EAAO,4BAA4B,CAEtE,CACA,OAAOxG,CACT,CAnCSF,EAAAkO,GAAA,sBAsFT,SAASsD,GAAWC,EAAGC,EAAGC,EAAG,CAC3B,IAAMC,EAAM,CAAC,EACb,OAAAA,EAAI,KAAK;AAAA,GAAOH,EAAGC,CAAC,EACpBE,EAAI,KAAK;AAAA,GAAO,CAACD,EAAG,CAAC,EACrBC,EAAI,KAAK;AAAA,GAAOD,EAAGA,EAAG,EAAG,EAAG,EAAGA,EAAI,EAAG,CAAC,EACvCC,EAAI,KAAK;AAAA,GAAOD,EAAGA,EAAG,EAAG,EAAG,EAAG,CAACA,EAAI,EAAG,CAAC,EACjCC,EAAI,KAAK,GAAG,CACrB,CAPSC,EAAAL,GAAA,cAcT,SAASM,GAAeC,EAAM,CAC5B,IAAMC,EAASD,EAAK,MAAM,GAAG,EAC7B,MAAO,CAAE,EAAG,OAAO,WAAWC,EAAO,CAAC,CAAC,EAAG,EAAG,OAAO,WAAWA,EAAO,CAAC,CAAC,EAAG,OAAQ,CAAC,OAAO,WAAWA,EAAO,CAAC,CAAC,CAAE,CACnH,CAHSH,EAAAC,GAAA,kBAKT,SAASG,GAAqBC,EAAS,CACrC,GAAIA,EAAQ,SAAW,EACrB,MAAO,CAAC,EAEV,IAAMC,EAAQ,CAAC,EACf,OAAAC,GAAiBF,EAASC,CAAK,EACxBA,EAAM,IACf,CAPSN,EAAAI,GAAA,wBAST,SAASI,GAAWC,EAAMC,EAAO,CAC/B,GAAID,EAAK,SAAW,EAClB,MAAO,QAET,IAAME,EAAU,KAAK,IAAI,GAAID,GAAS,CAAC,EACjCZ,EAAIY,GAAS,KAAQE,GAAM,KAAK,MAAMA,EAAID,CAAO,EAAIA,EAAWC,GAAMA,EAC5E,GAAIH,EAAK,QAAU,EAAG,CACpB,IAAMI,EAASJ,EAAK,CAAC,EAAE,OACvB,OAAOd,GAAWG,EAAEe,EAAO,CAAC,EAAGf,EAAEe,EAAO,CAAC,EAAGf,EAAEe,EAAO,MAAM,CAAC,CAC9D,CAEA,IAAMd,EAAM,CAAC;AAAA,GAAOD,EAAEW,EAAK,CAAC,EAAE,GAAG,CAAC,EAAGX,EAAEW,EAAK,CAAC,EAAE,GAAG,CAAC,CAAC,EACpD,QAAWK,KAAOL,EAAM,CACtB,IAAMM,EAASjB,EAAEgB,EAAI,OAAO,MAAM,EAClCf,EAAI,KAAK;AAAA,GAAOgB,EAAQA,EAAQ,EAAGD,EAAI,MAAQ,EAAI,EAAGA,EAAI,MAAQ,EAAI,EAAGhB,EAAEgB,EAAI,GAAG,CAAC,EAAGhB,EAAEgB,EAAI,GAAG,CAAC,CAAC,CACnG,CACA,OAAOf,EAAI,KAAK,GAAG,CACrB,CAjBSC,EAAAQ,GAAA,cAwBT,SAASQ,GAAqBX,EAASK,EAAO,CAC5C,OAAOF,GAAWJ,GAAqBC,CAAO,EAAGK,CAAK,CACxD,CAFSV,EAAAgB,GAAA,wBAIT,SAASC,GAAOC,EAAMC,EAAU,CAAC,EAAG,CAClC,GAAM,CACJ,aAAcC,EACd,eAAgBH,EAASI,GACzB,UAAAC,EAAY,GACZ,YAAAC,EAAc,KAAK,GAAK,EACxB,iBAAAC,EACA,MAAAC,EAAQ,IACR,OAAAC,EAAS,IACT,QAAAC,EAAU,GACV,WAAAC,EAAa,GACb,sBAAAC,EAAwB,GACxB,SAAAC,EACA,MAAApB,EAAQ,CACV,EAAIS,EAEAY,EAAWd,EAAOC,EAAM,CAC1B,aAAcE,IAAS,WAAa,CAACA,EAAOY,GAAeZ,IAAS,WAAaa,GAAuBb,EACxG,SAAAU,CACF,CAAC,EAEGR,IACFS,EAAWG,GAAkBH,EAAUR,EAAaC,CAAgB,GAGtE,IAAMnB,EAAU8B,GAAcJ,EAAUN,EAAOC,EAAQC,EAASC,CAAU,EACpEQ,EAAcC,GAAmBhC,EAASa,EAAMW,CAAqB,EAErES,EAAe,IAAI,IACvB,OAAO,KAAKjC,CAAO,EAAE,IAAKkC,GAAQ,CAChCA,EACA,CACE,IAAAA,EACA,EAAGlC,EAAQkC,CAAG,EAAE,EAChB,EAAGlC,EAAQkC,CAAG,EAAE,EAChB,OAAQlC,EAAQkC,CAAG,EAAE,MACvB,CACF,CAAC,CACH,EACMC,EAAUtB,EAAK,IAAKuB,GAAS,CACjC,IAAMpC,EAAUoC,EAAK,KAAK,IAAKC,GAAMJ,EAAa,IAAII,CAAC,CAAC,EAClDjC,EAAOL,GAAqBC,CAAO,EACnCH,EAAOM,GAAWC,EAAMC,CAAK,EACnC,MAAO,CAAE,QAAAL,EAAS,KAAAI,EAAM,KAAAP,EAAM,KAAAuC,EAAM,IAAK,IAAI,IAAIA,EAAK,IAAI,CAAE,CAC9D,CAAC,EAED,SAASE,EAAgBC,EAAM,CAC7B,IAAI9C,EAAI,GACR,QAAW+C,KAAKL,EACVK,EAAE,IAAI,KAAOD,EAAK,QAAUA,EAAK,MAAOF,GAAMG,EAAE,IAAI,IAAIH,CAAC,CAAC,IAC5D5C,GAAK,IAAM+C,EAAE,MAGjB,OAAO/C,CACT,CARS,OAAAE,EAAA2C,EAAA,mBAUFH,EAAQ,IAAI,CAAC,CAAE,QAAAnC,EAAS,KAAAI,EAAM,KAAAP,EAAM,KAAAuC,CAAK,KACvC,CACL,KAAMA,EACN,KAAML,EAAYK,EAAK,IAAI,EAC3B,QAAApC,EACA,KAAAI,EACA,KAAAP,EACA,aAAcA,EAAOyC,EAAgBF,EAAK,IAAI,CAChD,EACD,CACH,CAlESzC,EAAAiB,GAAA,UCjlET,SAAS6B,GAAgBC,EAAiE,CACxF,IAAMC,EAAM,IAAI,IAChB,QAAWC,KAASF,EAAW,CAC7B,IAAMG,EAAMD,EAAM,QAAQ,KAAK,GAAG,EAC5BE,EAAWH,EAAI,IAAIE,CAAG,EACxBC,EACF,OAAO,OAAOA,EAAUF,EAAM,MAAM,EAEpCD,EAAI,IAAIE,EAAK,CAAE,GAAGD,EAAM,MAAO,CAAC,CAEpC,CACA,OAAOD,CACT,CAZSI,EAAAN,GAAA,mBAcF,IAAMO,GAAuBD,EAAA,CAClCE,EACAC,EACAC,EACAC,IACS,CACT,IAAMC,EAAKD,EAAQ,GACbE,EAASD,EAAG,YAAY,EACxB,CAAE,eAAAE,EAAgB,KAAAC,EAAM,cAAAC,CAAc,EAAIC,GAAU,EACpDC,EAAcH,IAAS,YACvBI,EAAwB,CAC5BL,EAAe,MACfA,EAAe,MACfA,EAAe,MACfA,EAAe,MACfA,EAAe,MACfA,EAAe,MACfA,EAAe,MACfA,EAAe,KACjB,EAAE,OAAO,OAAO,EACVM,EAAQR,EAAG,kBAAkB,EAC7BS,EAAOT,EAAG,cAAc,EACxBU,EAAYV,EAAG,YAAY,EAC3BW,EAAavB,GAAgBY,EAAG,aAAa,CAAC,EAG9CY,EAAWX,GAAQ,OAAS,IAC5BY,EAAYZ,GAAQ,QAAU,IAE9Ba,EAAQF,EADU,KAElBG,EAAcP,EAAQ,GAAKM,EAAQ,EAEnCE,EAAmBd,EAAe,kBAAoBA,EAAe,UAGrEe,EAAMC,GAAiBrB,CAAE,EAC/BoB,EAAI,KAAK,UAAW,OAAOL,CAAQ,IAAIC,CAAS,EAAE,EAE9CL,GACFS,EACG,OAAO,MAAM,EACb,KAAKT,CAAK,EACV,KAAK,QAAS,YAAY,EAC1B,KAAK,YAAa,GAAG,GAAKM,CAAK,IAAI,EACnC,KAAK,cAAe,QAAQ,EAC5B,KAAK,oBAAqB,QAAQ,EAClC,KAAK,IAAK,KAAK,EACf,KAAK,IAAK,GAAKA,CAAK,EACpB,MAAM,OAAQZ,EAAe,oBAAsBA,EAAe,UAAU,EAIjF,IAAMiB,EAA2BC,GAAS,SAAS,cAAc,KAAK,CAAC,EACjEC,EACHC,GAAY,EACZ,MAAMV,CAAQ,EACd,OAAOC,EAAYE,CAAW,EACjCI,EAAY,MAAMV,CAAI,EAAE,KAAKY,CAAoB,EAEjD,IAAME,EAAWjB,EACbkB,GAAM,IAAIL,EAAY,OAAO,KAAK,EAAE,KAAK,CAAkB,EAC3D,OAGEM,EAAmBC,GAAOjB,EAAM,CACpC,MAAOG,EACP,OAAQC,EAAYE,EACpB,QAASd,GAAQ,SAAW,EAC9B,CAAC,EAGK0B,EAAc,IAAI,IACxB,QAAWC,KAAQH,EAAa,CAC9B,IAAMjC,EAAMqC,EAAc,CAAC,GAAGD,EAAK,KAAK,IAAI,EAAE,KAAK,CAAC,EACpDD,EAAY,IAAInC,EAAKoC,CAAI,CAC3B,CAEIlB,EAAU,OAAS,GACrBoB,GAAgB7B,EAAQ0B,EAAaR,EAAaT,EAAWI,EAAOH,CAAU,EAIhF,IAAMoB,EAAYC,GAAO9B,EAAe,YAAc,SAAS,EAC/DiB,EAAY,UAAU,cAAc,EAAE,KAAK,SAAUc,EAAGC,EAAG,CACzD,IAAMC,EAAQf,GAAS,IAAe,EAEhCgB,EAAUP,EAAc,CAAC,GADlBI,EAC0B,IAAI,EAAE,KAAK,CAAC,EAC7CI,EAAc1B,EAAW,IAAIyB,CAAO,EACpCE,EACJD,GAAa,MAAQ9B,EAAY2B,EAAI3B,EAAY,MAAM,GAAKL,EAAe,aAC7EiC,EAAM,QAAQ,YAAYD,EAAI,CAAC,GAAI,EAAI,EACvC,IAAMK,EAAcF,IAAc,cAAc,GAAK,GAC/CG,EAAcH,GAAa,QAAUC,EACrCG,EAAiBJ,IAAc,cAAc,GAAK,GAAG,EAAIvB,CAAK,GAEpE,GAAIR,GAAeiB,EAAU,CAC3B,IAAMmB,EAAaf,EAAY,IAAIS,CAAO,EAC1C,GAAIM,GAAcA,EAAW,QAAQ,OAAS,EAAG,CAC/C,IAAMC,EAAID,EAAW,QAAQ,CAAC,EACxBE,EAAYrB,EAAS,OAAOoB,EAAE,EAAGA,EAAE,EAAGA,EAAE,OAAS,EAAG,CACxD,UAAW,GACX,KAAMvC,EACN,KAAMyC,GAAeP,EAAW,EAAG,EACnC,UAAW,UACX,WAAY,EACZ,WAAY,EACZ,aAAc,IAAMJ,EAAI,GACxB,OAAQM,EACR,YAAa,WAAW,OAAOC,CAAc,CAAC,CAChD,CAAC,EACDN,EAAM,OAAO,MAAM,EAAE,OAAO,EAC5BA,EAAM,KAAK,GAAG,aAAaS,EAAWT,EAAM,OAAO,MAAM,EAAE,KAAK,CAAgB,CAClF,CACF,MACEA,EACG,OAAO,MAAM,EACb,MAAM,OAAQG,CAAS,EACvB,MAAM,eAAgBC,CAAW,EACjC,MAAM,SAAUC,CAAW,EAC3B,MAAM,eAAgBC,CAAc,EACpC,MAAM,iBAAkB,GAAI,EAGjC,IAAMK,EACJT,GAAa,QAAUN,EAAYgB,GAAQT,EAAW,EAAE,EAAIU,GAAOV,EAAW,EAAE,GAClFH,EACG,OAAO,MAAM,EACb,MAAM,YAAa,GAAG,GAAKrB,CAAK,IAAI,EACpC,MAAM,OAAQgC,CAAS,CAC5B,CAAC,EAGGxC,GAAeiB,EACjBJ,EAAY,UAAU,oBAAoB,EAAE,KAAK,SAAUc,EAAG,CAC5D,IAAME,EAAQf,GAAS,IAAe,EAEhCgB,EAAUP,EAAc,CAAC,GADlBI,EAC0B,IAAI,EAAE,KAAK,CAAC,EAC7CI,EAAc1B,EAAW,IAAIyB,CAAO,EACpCa,EAAaZ,GAAa,KAEhC,GAAIY,EAAY,CACd,IAAMC,EAASf,EAAM,OAAO,MAAM,EAC5BgB,EAAQD,EAAO,KAAK,GAAG,EAC7B,GAAIC,EAAO,CACT,IAAMP,EAAYrB,EAAS,KAAK4B,EAAO,CACrC,UAAW,GACX,KAAM/C,EACN,KAAMyC,GAAeI,EAAY,EAAG,EACpC,UAAW,cACX,WAAY,EACZ,WAAY,EACZ,aAAc,GACd,OAAQ,MACV,CAAC,EACKG,EAAeF,EAAO,KAAK,EACjCE,GAAc,YAAY,aAAaR,EAAWQ,CAAY,EAC9DF,EAAO,OAAO,CAChB,CACF,MACEf,EAAM,OAAO,MAAM,EAAE,MAAM,eAAgB,CAAC,EAG9CA,EACG,OAAO,MAAM,EACb,MAAM,YAAa,GAAG,GAAKrB,CAAK,IAAI,EACpC,MAAM,OAAQuB,GAAa,OAASnC,EAAe,kBAAoBc,CAAgB,CAC5F,CAAC,GAEDG,EACG,UAAU,yBAAyB,EACnC,MAAM,YAAa,GAAG,GAAKL,CAAK,IAAI,EACpC,MAAM,OAASuC,GAAM,CAEpB,IAAMjB,EAAUP,EAAc,CAAC,GADlBwB,EAC0B,IAAI,EAAE,KAAK,CAAC,EACnD,OACE1C,EAAW,IAAIyB,CAAO,GAAG,OAASlC,EAAe,kBAAoBc,CAEzE,CAAC,EACHG,EACG,UAAU,yBAAyB,EACnC,MAAM,eAAiBkC,GAAM,CAE5B,IAAMjB,EAAUP,EAAc,CAAC,GADlBwB,EAC0B,IAAI,EAAE,KAAK,CAAC,EACnD,OAAO1C,EAAW,IAAIyB,CAAO,GAAG,KAAO,EAAI,CAC7C,CAAC,EACA,MAAM,OAASiB,GAAM,CAEpB,IAAMjB,EAAUP,EAAc,CAAC,GADlBwB,EAC0B,IAAI,EAAE,KAAK,CAAC,EACnD,OAAO1C,EAAW,IAAIyB,CAAO,GAAG,MAAQ,aAC1C,CAAC,GAIL,IAAMkB,EAAYrC,EAAI,OAAO,GAAG,EAAE,KAAK,YAAa,gBAAgBF,CAAW,GAAG,EAC5EwC,EAAWpC,EAAY,OAAO,KAAK,EAAE,KAAK,EAChD,GAAIoC,GAAY,eAAgBA,EAC9B,QAAWC,IAAS,CAAC,GAAGD,EAAS,UAAU,EACzCD,EAAU,KAAK,GAAG,YAAYE,CAAK,EAGvCC,GAAiBxC,EAAKJ,EAAWD,EAAUX,GAAQ,aAAe,EAAI,CACxE,EAzMoC,QA2MpC,SAAS4B,EAAc6B,EAA0B,CAC/C,OAAOA,EAAO,KAAK,GAAG,CACxB,CAFShE,EAAAmC,EAAA,iBAIT,SAASC,GACP7B,EACA0B,EACAR,EACAT,EACAI,EACAH,EACA,CACA,IAAMgD,EAAiB1D,GAAQ,gBAAkB,GAE3C2D,EADUzC,EAAY,OAAO,KAAK,EACd,OAAO,GAAG,EAAE,KAAK,QAAS,iBAAiB,EAG/D0C,EAAc,IAAI,IACxB,QAAWC,KAAQpD,EAAW,CAC5B,IAAMlB,EAAMqC,EAAciC,EAAK,IAAI,EAC7BrE,EAAWoE,EAAY,IAAIrE,CAAG,EAChCC,EACFA,EAAS,KAAKqE,CAAI,EAElBD,EAAY,IAAIrE,EAAK,CAACsE,CAAI,CAAC,CAE/B,CAGA,OAAW,CAACtE,EAAKuE,CAAK,IAAKF,EAAY,QAAQ,EAAG,CAChD,IAAMjC,EAAOD,EAAY,IAAInC,CAAG,EAChC,GAAI,CAACoC,GAAM,KACT,SAGF,IAAMoC,EAAUpC,EAAK,KAAK,EACpBqC,EAAUrC,EAAK,KAAK,EACpBsC,EAAkB,KAAK,IAAI,GAAGtC,EAAK,QAAQ,IAAKe,GAAMA,EAAE,MAAM,CAAC,EAC/DwB,EAAiB,KAAK,IAC1B,GAAGvC,EAAK,QAAQ,IAAKe,GAAMA,EAAE,OAAS,KAAK,MAAMqB,EAAUrB,EAAE,EAAGsB,EAAUtB,EAAE,CAAC,CAAC,CAChF,EACIyB,EAAc,OAAO,SAASD,CAAc,EAAI,KAAK,IAAI,EAAGA,CAAc,EAAI,EAC9EC,IAAgB,GAAK,OAAO,SAASF,CAAe,IACtDE,EAAcF,EAAkB,IAIlC,IAAMG,EAAYT,EACf,OAAO,GAAG,EACV,KAAK,QAAS,gBAAgB,EAC9B,KAAK,YAAa,GAAG,GAAK9C,CAAK,IAAI,EAClC6C,GACFU,EACG,OAAO,QAAQ,EACf,KAAK,QAAS,wBAAwB,EACtC,KAAK,KAAML,CAAO,EAClB,KAAK,KAAMC,CAAO,EAClB,KAAK,IAAKG,CAAW,EACrB,KAAK,OAAQ,MAAM,EACnB,KAAK,SAAU,QAAQ,EACvB,KAAK,eAAgB,IAAMtD,CAAK,EAChC,KAAK,mBAAoB,GAAG,EAAIA,CAAK,IAAI,EAAIA,CAAK,EAAE,EAIzD,IAAMwD,EAAa,KAAK,IAAI,GAAKxD,EAAOsD,EAAc,EAAI,GAAI,EACxDG,EAAc,KAAK,IAAI,GAAKzD,EAAOsD,EAAc,EAAI,GAAI,EAGzDI,GAFW5C,EAAK,KAAK,OAASA,EAAK,KAAK,MAAM,OAAS,EAC1B,KAAK,IAAI,GAAKd,EAAOsD,EAAc,GAAI,EAAI,IACvCL,EAAM,QAAU,EAAI,GAAKjD,EAAQ,GAClE2D,EAAST,EAAUM,EAAa,EAChCI,EAAST,EAAUM,EAAc,EAAIC,EACrCG,EAAO,KAAK,IAAI,EAAG,KAAK,KAAK,KAAK,KAAKZ,EAAM,MAAM,CAAC,CAAC,EACrDa,EAAO,KAAK,IAAI,EAAG,KAAK,KAAKb,EAAM,OAASY,CAAI,CAAC,EACjDE,EAAYP,EAAaK,EACzBG,EAAaP,EAAcK,EAGjC,OAAW,CAAC1C,EAAG4B,CAAI,IAAKC,EAAM,QAAQ,EAAG,CACvC,IAAMgB,EAAM7C,EAAIyC,EACVK,EAAM,KAAK,MAAM9C,EAAIyC,CAAI,EACzBM,EAAIR,EAASI,GAAaE,EAAM,IAChCG,EAAIR,EAASI,GAAcE,EAAM,IAEnCrB,GACFU,EACG,OAAO,MAAM,EACb,KAAK,QAAS,sBAAsB,EACpC,KAAK,IAAKI,EAASI,EAAYE,CAAG,EAClC,KAAK,IAAKL,EAASI,EAAaE,CAAG,EACnC,KAAK,QAASH,CAAS,EACvB,KAAK,SAAUC,CAAU,EACzB,KAAK,OAAQ,MAAM,EACnB,KAAK,SAAU,MAAM,EACrB,KAAK,eAAgB,EAAIhE,CAAK,EAC9B,KAAK,mBAAoB,GAAG,EAAIA,CAAK,IAAI,EAAIA,CAAK,EAAE,EAGzD,IAAMqE,EAAWN,EAAY,GACvBO,EAAYN,EAAa,GAGzBO,EAAYhB,EACf,OAAO,eAAe,EACtB,KAAK,QAAS,mBAAmB,EACjC,KAAK,QAASc,CAAQ,EACtB,KAAK,SAAUC,CAAS,EACxB,KAAK,IAAKH,EAAIE,EAAW,CAAC,EAC1B,KAAK,IAAKD,EAAIE,EAAY,CAAC,EAC3B,KAAK,WAAY,SAAS,EAEvBtC,EAAYnC,EAAW,IAAImD,EAAK,EAAE,GAAG,MACrCwB,EAAOD,EACV,OAAO,YAAY,EACnB,KAAK,QAAS,gBAAgB,EAC9B,MAAM,UAAW,MAAM,EACvB,MAAM,QAAS,MAAM,EACrB,MAAM,SAAU,MAAM,EACtB,MAAM,cAAe,QAAQ,EAC7B,MAAM,cAAe,QAAQ,EAC7B,MAAM,kBAAmB,QAAQ,EACjC,MAAM,aAAc,QAAQ,EAC5B,MAAM,gBAAiB,QAAQ,EAC/B,MAAM,aAAc,QAAQ,EAC5B,KAAKvB,EAAK,OAASA,EAAK,EAAE,EAEzBhB,GACFwC,EAAK,MAAM,QAASxC,CAAS,CAEjC,CACF,CACF,CA/HSpD,EAAAoC,GAAA,mBAiIF,IAAMyD,GAA4B,CAAE,KAAA5F,EAAK,ECvWzC,IAAM6F,GAA6B,CACxC,OAAAC,GACA,GAAAC,GACA,SAAAC,GACA,OAAQC,EACV",
  "names": ["parser", "o", "__name", "k", "v", "l", "$V0", "$V1", "$V2", "$V3", "$V4", "$V5", "$V6", "$V7", "$V8", "$V9", "$Va", "$Vb", "$Vc", "$Vd", "yytext", "yyleng", "yylineno", "yy", "yystate", "$$", "_$", "$0", "cs", "str", "hash", "error", "input", "self", "stack", "tstack", "vstack", "lstack", "table", "recovering", "TERROR", "EOF", "args", "lexer", "sharedState", "yyloc", "ranges", "popStack", "n", "lex", "token", "symbol", "preErrorSymbol", "state", "action", "a", "r", "yyval", "p", "len", "newState", "expected", "errStr", "ch", "lines", "oldLines", "past", "next", "pre", "c", "match", "indexed_rule", "backup", "tempMatch", "index", "rules", "i", "condition", "yy_", "$avoiding_name_collisions", "YY_START", "YYSTATE", "Parser", "venn_default", "parser", "subsets", "textNodes", "styleEntries", "knownSets", "currentSets", "indentMode", "addSubsetData", "__name", "identifierList", "label", "size", "sets", "normalizeIdentifierList", "resolvedSize", "normalizeText", "getSubsetData", "text", "trimmed", "normalizeStyleValue", "value", "addTextData", "id", "normalizedId", "addStyleData", "data", "targets", "styles", "key", "getStyleData", "identifier", "validateUnionIdentifiers", "unknown", "getTextData", "getCurrentSets", "getIndentMode", "setIndentMode", "enabled", "DEFAULT_VENN_CONFIG", "defaultConfig_default", "getConfig", "cleanAndMerge", "customClear", "clear", "db", "setAccTitle", "getAccTitle", "setDiagramTitle", "getDiagramTitle", "getAccDescription", "setAccDescription", "getStyles", "__name", "options", "styles_default", "intersectionArea", "circles", "stats", "intersectionPoints", "getIntersectionPoints", "innerPoints", "p", "containedInCircles", "arcArea", "polygonArea", "arcs", "center", "getCenter", "i", "a", "b", "p2", "p1", "midPoint", "arc", "j", "circle", "a1", "a2", "angleDiff", "width", "distance", "circleArea", "smallest", "disjoint", "__name", "point", "ret", "intersect", "circleCircleIntersection", "r", "circleOverlap", "r1", "r2", "d", "w1", "w2", "h", "x0", "y0", "rx", "ry", "points", "bisect", "f", "parameters", "maxIterations", "tolerance", "fA", "fB", "delta", "mid", "fMid", "zeros", "x", "zerosM", "y", "dot", "norm2", "scale", "value", "c", "weightedSum", "v1", "v2", "nelderMead", "nonZeroDelta", "zeroDelta", "minErrorDelta", "minTolerance", "rho", "chi", "psi", "sigma", "maxDiff", "N", "simplex", "updateSimplex", "sortOrder", "centroid", "reflected", "contracted", "expanded", "iteration", "sortedSimplex", "state", "worst", "shouldReduce", "wolfeLineSearch", "pk", "current", "next", "c1", "c2", "phi0", "phiPrime0", "phi", "phi_old", "phiPrime", "a0", "zoom", "a_lo", "a_high", "phi_lo", "conjugateGradient", "initial", "params", "yk", "temp", "delta_k", "beta_k", "venn", "sets", "initialLayout", "bestInitialLayout", "loss", "lossFunction", "areas", "addMissingAreas", "setids", "setid", "positions", "values", "SMALL", "distanceFromIntersectArea", "overlap", "distinct", "s", "toKey", "arr", "count", "area", "si", "sj", "k1", "k2", "ids", "pairs", "getDistanceMatrices", "distances", "constraints", "left", "right", "constrainedMDSGradient", "fxprime", "xi", "yi", "xj", "yj", "dij", "constraint", "squaredDistance", "greedyLayout", "constrained", "constrainedMDSLayout", "constrainedLoss", "greedyLoss", "restarts", "norm", "row", "obj", "best", "set", "setOverlaps", "weight", "mostOverlapped", "size", "positioned", "isPositioned", "element", "positionSet", "index", "setIndex", "d1", "k", "d2", "extraPoints", "bestLoss", "bestPoint", "localLoss", "overlaps", "output", "logRatioLossFunction", "differenceFromIdeal", "orientateCircles", "orientation", "orientationOrder", "largestX", "largestY", "rotation", "angle", "slope", "disjointCluster", "find", "union", "xRoot", "yRoot", "maxDistance", "disjointClusters", "getBoundingBox", "minMax", "hi", "acc", "lo", "normalizeSolution", "solution", "fromObjectNotation", "clusters", "cluster", "bounds", "returnBounds", "spacing", "addCluster", "bottom", "xOffset", "yOffset", "centreing", "toObjectNotation", "scaleSolution", "height", "padding", "scaleToFit", "xRange", "yRange", "xScaling", "yScaling", "toScaleDiameter", "scaling", "id", "VennDiagram", "options", "useViewBox", "duration", "normalize", "wrap", "styled", "fontSize", "round", "symmetricalTextCentre", "colourMap", "colourScheme", "colourIndex", "colours", "key", "layoutFunction", "chart", "selection", "data", "toRemove", "datum", "textCentres", "computeTextCentres", "labels", "label", "svg", "previous", "hasPrevious", "path", "circleFromPath", "pathTween", "t", "start", "end", "intersectionAreaPath", "nodes", "enter", "enterPath", "enterText", "asTransition", "update", "updateText", "wrapText", "exit", "exitText", "_", "labeller", "text", "words", "minChars", "word", "line", "lineNumber", "lineHeight", "tspans", "append", "tspan", "joined", "circleMargin", "interior", "exterior", "margin", "m", "computeTextCentre", "valid", "e", "areaStats", "getOverlappingCircles", "circleids", "circleid", "ci", "cj", "overlapped", "areaids", "exclude", "centre", "circlePath", "x", "y", "r", "ret", "__name", "circleFromPath", "path", "tokens", "intersectionAreaArcs", "circles", "stats", "intersectionArea", "arcsToPath", "arcs", "round", "rFactor", "v", "circle", "arc", "radius", "intersectionAreaPath", "layout", "data", "options", "loss", "venn", "normalize", "orientation", "orientationOrder", "width", "height", "padding", "scaleToFit", "symmetricalTextCentre", "distinct", "solution", "lossFunction", "logRatioLossFunction", "normalizeSolution", "scaleSolution", "textCentres", "computeTextCentres", "circleLookup", "set", "helpers", "area", "s", "genDistinctPath", "sets", "e", "buildStyleByKey", "styleData", "map", "entry", "key", "existing", "__name", "draw", "_text", "id", "_version", "diagObj", "db", "config", "themeVariables", "look", "handDrawnSeed", "getConfig", "isHandDrawn", "themeColors", "title", "sets", "textNodes", "styleByKey", "svgWidth", "svgHeight", "scale", "titleHeight", "defaultTextColor", "svg", "selectSvgElement", "dummyD3root", "select_default", "vennDiagram", "VennDiagram", "roughSvg", "at", "layoutAreas", "layout", "layoutByKey", "area", "stableSetsKey", "renderTextNodes", "themeDark", "is_dark_default", "d", "i", "group", "setsKey", "customStyle", "baseColor", "fillOpacity", "strokeColor", "strokeWidthVal", "layoutArea", "c", "roughNode", "transparentize_default", "textColor", "lighten_default", "darken_default", "customFill", "pathEl", "pathD", "existingPath", "e", "vennGroup", "dummySvg", "child", "configureSvgSize", "setIds", "useDebugLayout", "textGroup", "nodesByArea", "node", "nodes", "centerX", "centerY", "minCircleRadius", "innerRadiusRaw", "innerRadius", "areaGroup", "innerWidth", "innerHeight", "labelOffset", "startX", "startY", "cols", "rows", "cellWidth", "cellHeight", "col", "row", "x", "y", "boxWidth", "boxHeight", "container", "text", "renderer", "diagram", "venn_default", "db", "renderer", "styles_default"]
}