{"version":3,"file":"index.0cc89e10.js","sources":["../../../../ui/node_modules/.pnpm/@lezer+lr@1.3.3/node_modules/@lezer/lr/dist/index.js","../../../../ui/node_modules/.pnpm/@lezer+javascript@1.4.1/node_modules/@lezer/javascript/dist/index.es.js","../../../../ui/node_modules/.pnpm/@codemirror+lang-javascript@6.1.4/node_modules/@codemirror/lang-javascript/dist/index.js"],"sourcesContent":["import { Parser, NodeProp, NodeSet, NodeType, DefaultBufferLength, Tree, IterMode } from '@lezer/common';\n\n/// A parse stack. These are used internally by the parser to track\n/// parsing progress. They also provide some properties and methods\n/// that external code such as a tokenizer can use to get information\n/// about the parse state.\nclass Stack {\n /// @internal\n constructor(\n /// The parse that this stack is part of @internal\n p, \n /// Holds state, input pos, buffer index triplets for all but the\n /// top state @internal\n stack, \n /// The current parse state @internal\n state, \n // The position at which the next reduce should take place. This\n // can be less than `this.pos` when skipped expressions have been\n // added to the stack (which should be moved outside of the next\n // reduction)\n /// @internal\n reducePos, \n /// The input position up to which this stack has parsed.\n pos, \n /// The dynamic score of the stack, including dynamic precedence\n /// and error-recovery penalties\n /// @internal\n score, \n // The output buffer. Holds (type, start, end, size) quads\n // representing nodes created by the parser, where `size` is\n // amount of buffer array entries covered by this node.\n /// @internal\n buffer, \n // The base offset of the buffer. When stacks are split, the split\n // instance shared the buffer history with its parent up to\n // `bufferBase`, which is the absolute offset (including the\n // offset of previous splits) into the buffer at which this stack\n // starts writing.\n /// @internal\n bufferBase, \n /// @internal\n curContext, \n /// @internal\n lookAhead = 0, \n // A parent stack from which this was split off, if any. This is\n // set up so that it always points to a stack that has some\n // additional buffer content, never to a stack with an equal\n // `bufferBase`.\n /// @internal\n parent) {\n this.p = p;\n this.stack = stack;\n this.state = state;\n this.reducePos = reducePos;\n this.pos = pos;\n this.score = score;\n this.buffer = buffer;\n this.bufferBase = bufferBase;\n this.curContext = curContext;\n this.lookAhead = lookAhead;\n this.parent = parent;\n }\n /// @internal\n toString() {\n return `[${this.stack.filter((_, i) => i % 3 == 0).concat(this.state)}]@${this.pos}${this.score ? \"!\" + this.score : \"\"}`;\n }\n // Start an empty stack\n /// @internal\n static start(p, state, pos = 0) {\n let cx = p.parser.context;\n return new Stack(p, [], state, pos, pos, 0, [], 0, cx ? new StackContext(cx, cx.start) : null, 0, null);\n }\n /// The stack's current [context](#lr.ContextTracker) value, if\n /// any. Its type will depend on the context tracker's type\n /// parameter, or it will be `null` if there is no context\n /// tracker.\n get context() { return this.curContext ? this.curContext.context : null; }\n // Push a state onto the stack, tracking its start position as well\n // as the buffer base at that point.\n /// @internal\n pushState(state, start) {\n this.stack.push(this.state, start, this.bufferBase + this.buffer.length);\n this.state = state;\n }\n // Apply a reduce action\n /// @internal\n reduce(action) {\n var _a;\n let depth = action >> 19 /* Action.ReduceDepthShift */, type = action & 65535 /* Action.ValueMask */;\n let { parser } = this.p;\n let dPrec = parser.dynamicPrecedence(type);\n if (dPrec)\n this.score += dPrec;\n if (depth == 0) {\n this.pushState(parser.getGoto(this.state, type, true), this.reducePos);\n // Zero-depth reductions are a special case—they add stuff to\n // the stack without popping anything off.\n if (type < parser.minRepeatTerm)\n this.storeNode(type, this.reducePos, this.reducePos, 4, true);\n this.reduceContext(type, this.reducePos);\n return;\n }\n // Find the base index into `this.stack`, content after which will\n // be dropped. Note that with `StayFlag` reductions we need to\n // consume two extra frames (the dummy parent node for the skipped\n // expression and the state that we'll be staying in, which should\n // be moved to `this.state`).\n let base = this.stack.length - ((depth - 1) * 3) - (action & 262144 /* Action.StayFlag */ ? 6 : 0);\n let start = base ? this.stack[base - 2] : this.p.ranges[0].from, size = this.reducePos - start;\n // This is a kludge to try and detect overly deep left-associative\n // trees, which will not increase the parse stack depth and thus\n // won't be caught by the regular stack-depth limit check.\n if (size >= 2000 /* Recover.MinBigReduction */ && !((_a = this.p.parser.nodeSet.types[type]) === null || _a === void 0 ? void 0 : _a.isAnonymous)) {\n if (start == this.p.lastBigReductionStart) {\n this.p.bigReductionCount++;\n this.p.lastBigReductionSize = size;\n }\n else if (this.p.lastBigReductionSize < size) {\n this.p.bigReductionCount = 1;\n this.p.lastBigReductionStart = start;\n this.p.lastBigReductionSize = size;\n }\n }\n let bufferBase = base ? this.stack[base - 1] : 0, count = this.bufferBase + this.buffer.length - bufferBase;\n // Store normal terms or `R -> R R` repeat reductions\n if (type < parser.minRepeatTerm || (action & 131072 /* Action.RepeatFlag */)) {\n let pos = parser.stateFlag(this.state, 1 /* StateFlag.Skipped */) ? this.pos : this.reducePos;\n this.storeNode(type, start, pos, count + 4, true);\n }\n if (action & 262144 /* Action.StayFlag */) {\n this.state = this.stack[base];\n }\n else {\n let baseStateID = this.stack[base - 3];\n this.state = parser.getGoto(baseStateID, type, true);\n }\n while (this.stack.length > base)\n this.stack.pop();\n this.reduceContext(type, start);\n }\n // Shift a value into the buffer\n /// @internal\n storeNode(term, start, end, size = 4, isReduce = false) {\n if (term == 0 /* Term.Err */ &&\n (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) {\n // Try to omit/merge adjacent error nodes\n let cur = this, top = this.buffer.length;\n if (top == 0 && cur.parent) {\n top = cur.bufferBase - cur.parent.bufferBase;\n cur = cur.parent;\n }\n if (top > 0 && cur.buffer[top - 4] == 0 /* Term.Err */ && cur.buffer[top - 1] > -1) {\n if (start == end)\n return;\n if (cur.buffer[top - 2] >= start) {\n cur.buffer[top - 2] = end;\n return;\n }\n }\n }\n if (!isReduce || this.pos == end) { // Simple case, just append\n this.buffer.push(term, start, end, size);\n }\n else { // There may be skipped nodes that have to be moved forward\n let index = this.buffer.length;\n if (index > 0 && this.buffer[index - 4] != 0 /* Term.Err */)\n while (index > 0 && this.buffer[index - 2] > end) {\n // Move this record forward\n this.buffer[index] = this.buffer[index - 4];\n this.buffer[index + 1] = this.buffer[index - 3];\n this.buffer[index + 2] = this.buffer[index - 2];\n this.buffer[index + 3] = this.buffer[index - 1];\n index -= 4;\n if (size > 4)\n size -= 4;\n }\n this.buffer[index] = term;\n this.buffer[index + 1] = start;\n this.buffer[index + 2] = end;\n this.buffer[index + 3] = size;\n }\n }\n // Apply a shift action\n /// @internal\n shift(action, next, nextEnd) {\n let start = this.pos;\n if (action & 131072 /* Action.GotoFlag */) {\n this.pushState(action & 65535 /* Action.ValueMask */, this.pos);\n }\n else if ((action & 262144 /* Action.StayFlag */) == 0) { // Regular shift\n let nextState = action, { parser } = this.p;\n if (nextEnd > this.pos || next <= parser.maxNode) {\n this.pos = nextEnd;\n if (!parser.stateFlag(nextState, 1 /* StateFlag.Skipped */))\n this.reducePos = nextEnd;\n }\n this.pushState(nextState, start);\n this.shiftContext(next, start);\n if (next <= parser.maxNode)\n this.buffer.push(next, start, nextEnd, 4);\n }\n else { // Shift-and-stay, which means this is a skipped token\n this.pos = nextEnd;\n this.shiftContext(next, start);\n if (next <= this.p.parser.maxNode)\n this.buffer.push(next, start, nextEnd, 4);\n }\n }\n // Apply an action\n /// @internal\n apply(action, next, nextEnd) {\n if (action & 65536 /* Action.ReduceFlag */)\n this.reduce(action);\n else\n this.shift(action, next, nextEnd);\n }\n // Add a prebuilt (reused) node into the buffer.\n /// @internal\n useNode(value, next) {\n let index = this.p.reused.length - 1;\n if (index < 0 || this.p.reused[index] != value) {\n this.p.reused.push(value);\n index++;\n }\n let start = this.pos;\n this.reducePos = this.pos = start + value.length;\n this.pushState(next, start);\n this.buffer.push(index, start, this.reducePos, -1 /* size == -1 means this is a reused value */);\n if (this.curContext)\n this.updateContext(this.curContext.tracker.reuse(this.curContext.context, value, this, this.p.stream.reset(this.pos - value.length)));\n }\n // Split the stack. Due to the buffer sharing and the fact\n // that `this.stack` tends to stay quite shallow, this isn't very\n // expensive.\n /// @internal\n split() {\n let parent = this;\n let off = parent.buffer.length;\n // Because the top of the buffer (after this.pos) may be mutated\n // to reorder reductions and skipped tokens, and shared buffers\n // should be immutable, this copies any outstanding skipped tokens\n // to the new buffer, and puts the base pointer before them.\n while (off > 0 && parent.buffer[off - 2] > parent.reducePos)\n off -= 4;\n let buffer = parent.buffer.slice(off), base = parent.bufferBase + off;\n // Make sure parent points to an actual parent with content, if there is such a parent.\n while (parent && base == parent.bufferBase)\n parent = parent.parent;\n return new Stack(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, buffer, base, this.curContext, this.lookAhead, parent);\n }\n // Try to recover from an error by 'deleting' (ignoring) one token.\n /// @internal\n recoverByDelete(next, nextEnd) {\n let isNode = next <= this.p.parser.maxNode;\n if (isNode)\n this.storeNode(next, this.pos, nextEnd, 4);\n this.storeNode(0 /* Term.Err */, this.pos, nextEnd, isNode ? 8 : 4);\n this.pos = this.reducePos = nextEnd;\n this.score -= 190 /* Recover.Delete */;\n }\n /// Check if the given term would be able to be shifted (optionally\n /// after some reductions) on this stack. This can be useful for\n /// external tokenizers that want to make sure they only provide a\n /// given token when it applies.\n canShift(term) {\n for (let sim = new SimulatedStack(this);;) {\n let action = this.p.parser.stateSlot(sim.state, 4 /* ParseState.DefaultReduce */) || this.p.parser.hasAction(sim.state, term);\n if (action == 0)\n return false;\n if ((action & 65536 /* Action.ReduceFlag */) == 0)\n return true;\n sim.reduce(action);\n }\n }\n // Apply up to Recover.MaxNext recovery actions that conceptually\n // inserts some missing token or rule.\n /// @internal\n recoverByInsert(next) {\n if (this.stack.length >= 300 /* Recover.MaxInsertStackDepth */)\n return [];\n let nextStates = this.p.parser.nextStates(this.state);\n if (nextStates.length > 4 /* Recover.MaxNext */ << 1 || this.stack.length >= 120 /* Recover.DampenInsertStackDepth */) {\n let best = [];\n for (let i = 0, s; i < nextStates.length; i += 2) {\n if ((s = nextStates[i + 1]) != this.state && this.p.parser.hasAction(s, next))\n best.push(nextStates[i], s);\n }\n if (this.stack.length < 120 /* Recover.DampenInsertStackDepth */)\n for (let i = 0; best.length < 4 /* Recover.MaxNext */ << 1 && i < nextStates.length; i += 2) {\n let s = nextStates[i + 1];\n if (!best.some((v, i) => (i & 1) && v == s))\n best.push(nextStates[i], s);\n }\n nextStates = best;\n }\n let result = [];\n for (let i = 0; i < nextStates.length && result.length < 4 /* Recover.MaxNext */; i += 2) {\n let s = nextStates[i + 1];\n if (s == this.state)\n continue;\n let stack = this.split();\n stack.pushState(s, this.pos);\n stack.storeNode(0 /* Term.Err */, stack.pos, stack.pos, 4, true);\n stack.shiftContext(nextStates[i], this.pos);\n stack.score -= 200 /* Recover.Insert */;\n result.push(stack);\n }\n return result;\n }\n // Force a reduce, if possible. Return false if that can't\n // be done.\n /// @internal\n forceReduce() {\n let reduce = this.p.parser.stateSlot(this.state, 5 /* ParseState.ForcedReduce */);\n if ((reduce & 65536 /* Action.ReduceFlag */) == 0)\n return false;\n let { parser } = this.p;\n if (!parser.validAction(this.state, reduce)) {\n let depth = reduce >> 19 /* Action.ReduceDepthShift */, term = reduce & 65535 /* Action.ValueMask */;\n let target = this.stack.length - depth * 3;\n if (target < 0 || parser.getGoto(this.stack[target], term, false) < 0)\n return false;\n this.storeNode(0 /* Term.Err */, this.reducePos, this.reducePos, 4, true);\n this.score -= 100 /* Recover.Reduce */;\n }\n this.reducePos = this.pos;\n this.reduce(reduce);\n return true;\n }\n /// @internal\n forceAll() {\n while (!this.p.parser.stateFlag(this.state, 2 /* StateFlag.Accepting */)) {\n if (!this.forceReduce()) {\n this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n break;\n }\n }\n return this;\n }\n /// Check whether this state has no further actions (assumed to be a direct descendant of the\n /// top state, since any other states must be able to continue\n /// somehow). @internal\n get deadEnd() {\n if (this.stack.length != 3)\n return false;\n let { parser } = this.p;\n return parser.data[parser.stateSlot(this.state, 1 /* ParseState.Actions */)] == 65535 /* Seq.End */ &&\n !parser.stateSlot(this.state, 4 /* ParseState.DefaultReduce */);\n }\n /// Restart the stack (put it back in its start state). Only safe\n /// when this.stack.length == 3 (state is directly below the top\n /// state). @internal\n restart() {\n this.state = this.stack[0];\n this.stack.length = 0;\n }\n /// @internal\n sameState(other) {\n if (this.state != other.state || this.stack.length != other.stack.length)\n return false;\n for (let i = 0; i < this.stack.length; i += 3)\n if (this.stack[i] != other.stack[i])\n return false;\n return true;\n }\n /// Get the parser used by this stack.\n get parser() { return this.p.parser; }\n /// Test whether a given dialect (by numeric ID, as exported from\n /// the terms file) is enabled.\n dialectEnabled(dialectID) { return this.p.parser.dialect.flags[dialectID]; }\n shiftContext(term, start) {\n if (this.curContext)\n this.updateContext(this.curContext.tracker.shift(this.curContext.context, term, this, this.p.stream.reset(start)));\n }\n reduceContext(term, start) {\n if (this.curContext)\n this.updateContext(this.curContext.tracker.reduce(this.curContext.context, term, this, this.p.stream.reset(start)));\n }\n /// @internal\n emitContext() {\n let last = this.buffer.length - 1;\n if (last < 0 || this.buffer[last] != -3)\n this.buffer.push(this.curContext.hash, this.reducePos, this.reducePos, -3);\n }\n /// @internal\n emitLookAhead() {\n let last = this.buffer.length - 1;\n if (last < 0 || this.buffer[last] != -4)\n this.buffer.push(this.lookAhead, this.reducePos, this.reducePos, -4);\n }\n updateContext(context) {\n if (context != this.curContext.context) {\n let newCx = new StackContext(this.curContext.tracker, context);\n if (newCx.hash != this.curContext.hash)\n this.emitContext();\n this.curContext = newCx;\n }\n }\n /// @internal\n setLookAhead(lookAhead) {\n if (lookAhead > this.lookAhead) {\n this.emitLookAhead();\n this.lookAhead = lookAhead;\n }\n }\n /// @internal\n close() {\n if (this.curContext && this.curContext.tracker.strict)\n this.emitContext();\n if (this.lookAhead > 0)\n this.emitLookAhead();\n }\n}\nclass StackContext {\n constructor(tracker, context) {\n this.tracker = tracker;\n this.context = context;\n this.hash = tracker.strict ? tracker.hash(context) : 0;\n }\n}\nvar Recover;\n(function (Recover) {\n Recover[Recover[\"Insert\"] = 200] = \"Insert\";\n Recover[Recover[\"Delete\"] = 190] = \"Delete\";\n Recover[Recover[\"Reduce\"] = 100] = \"Reduce\";\n Recover[Recover[\"MaxNext\"] = 4] = \"MaxNext\";\n Recover[Recover[\"MaxInsertStackDepth\"] = 300] = \"MaxInsertStackDepth\";\n Recover[Recover[\"DampenInsertStackDepth\"] = 120] = \"DampenInsertStackDepth\";\n Recover[Recover[\"MinBigReduction\"] = 2000] = \"MinBigReduction\";\n})(Recover || (Recover = {}));\n// Used to cheaply run some reductions to scan ahead without mutating\n// an entire stack\nclass SimulatedStack {\n constructor(start) {\n this.start = start;\n this.state = start.state;\n this.stack = start.stack;\n this.base = this.stack.length;\n }\n reduce(action) {\n let term = action & 65535 /* Action.ValueMask */, depth = action >> 19 /* Action.ReduceDepthShift */;\n if (depth == 0) {\n if (this.stack == this.start.stack)\n this.stack = this.stack.slice();\n this.stack.push(this.state, 0, 0);\n this.base += 3;\n }\n else {\n this.base -= (depth - 1) * 3;\n }\n let goto = this.start.p.parser.getGoto(this.stack[this.base - 3], term, true);\n this.state = goto;\n }\n}\n// This is given to `Tree.build` to build a buffer, and encapsulates\n// the parent-stack-walking necessary to read the nodes.\nclass StackBufferCursor {\n constructor(stack, pos, index) {\n this.stack = stack;\n this.pos = pos;\n this.index = index;\n this.buffer = stack.buffer;\n if (this.index == 0)\n this.maybeNext();\n }\n static create(stack, pos = stack.bufferBase + stack.buffer.length) {\n return new StackBufferCursor(stack, pos, pos - stack.bufferBase);\n }\n maybeNext() {\n let next = this.stack.parent;\n if (next != null) {\n this.index = this.stack.bufferBase - next.bufferBase;\n this.stack = next;\n this.buffer = next.buffer;\n }\n }\n get id() { return this.buffer[this.index - 4]; }\n get start() { return this.buffer[this.index - 3]; }\n get end() { return this.buffer[this.index - 2]; }\n get size() { return this.buffer[this.index - 1]; }\n next() {\n this.index -= 4;\n this.pos -= 4;\n if (this.index == 0)\n this.maybeNext();\n }\n fork() {\n return new StackBufferCursor(this.stack, this.pos, this.index);\n }\n}\n\n// See lezer-generator/src/encode.ts for comments about the encoding\n// used here\nfunction decodeArray(input, Type = Uint16Array) {\n if (typeof input != \"string\")\n return input;\n let array = null;\n for (let pos = 0, out = 0; pos < input.length;) {\n let value = 0;\n for (;;) {\n let next = input.charCodeAt(pos++), stop = false;\n if (next == 126 /* Encode.BigValCode */) {\n value = 65535 /* Encode.BigVal */;\n break;\n }\n if (next >= 92 /* Encode.Gap2 */)\n next--;\n if (next >= 34 /* Encode.Gap1 */)\n next--;\n let digit = next - 32 /* Encode.Start */;\n if (digit >= 46 /* Encode.Base */) {\n digit -= 46 /* Encode.Base */;\n stop = true;\n }\n value += digit;\n if (stop)\n break;\n value *= 46 /* Encode.Base */;\n }\n if (array)\n array[out++] = value;\n else\n array = new Type(value);\n }\n return array;\n}\n\nclass CachedToken {\n constructor() {\n this.start = -1;\n this.value = -1;\n this.end = -1;\n this.extended = -1;\n this.lookAhead = 0;\n this.mask = 0;\n this.context = 0;\n }\n}\nconst nullToken = new CachedToken;\n/// [Tokenizers](#lr.ExternalTokenizer) interact with the input\n/// through this interface. It presents the input as a stream of\n/// characters, tracking lookahead and hiding the complexity of\n/// [ranges](#common.Parser.parse^ranges) from tokenizer code.\nclass InputStream {\n /// @internal\n constructor(\n /// @internal\n input, \n /// @internal\n ranges) {\n this.input = input;\n this.ranges = ranges;\n /// @internal\n this.chunk = \"\";\n /// @internal\n this.chunkOff = 0;\n /// Backup chunk\n this.chunk2 = \"\";\n this.chunk2Pos = 0;\n /// The character code of the next code unit in the input, or -1\n /// when the stream is at the end of the input.\n this.next = -1;\n /// @internal\n this.token = nullToken;\n this.rangeIndex = 0;\n this.pos = this.chunkPos = ranges[0].from;\n this.range = ranges[0];\n this.end = ranges[ranges.length - 1].to;\n this.readNext();\n }\n /// @internal\n resolveOffset(offset, assoc) {\n let range = this.range, index = this.rangeIndex;\n let pos = this.pos + offset;\n while (pos < range.from) {\n if (!index)\n return null;\n let next = this.ranges[--index];\n pos -= range.from - next.to;\n range = next;\n }\n while (assoc < 0 ? pos > range.to : pos >= range.to) {\n if (index == this.ranges.length - 1)\n return null;\n let next = this.ranges[++index];\n pos += next.from - range.to;\n range = next;\n }\n return pos;\n }\n /// @internal\n clipPos(pos) {\n if (pos >= this.range.from && pos < this.range.to)\n return pos;\n for (let range of this.ranges)\n if (range.to > pos)\n return Math.max(pos, range.from);\n return this.end;\n }\n /// Look at a code unit near the stream position. `.peek(0)` equals\n /// `.next`, `.peek(-1)` gives you the previous character, and so\n /// on.\n ///\n /// Note that looking around during tokenizing creates dependencies\n /// on potentially far-away content, which may reduce the\n /// effectiveness incremental parsing—when looking forward—or even\n /// cause invalid reparses when looking backward more than 25 code\n /// units, since the library does not track lookbehind.\n peek(offset) {\n let idx = this.chunkOff + offset, pos, result;\n if (idx >= 0 && idx < this.chunk.length) {\n pos = this.pos + offset;\n result = this.chunk.charCodeAt(idx);\n }\n else {\n let resolved = this.resolveOffset(offset, 1);\n if (resolved == null)\n return -1;\n pos = resolved;\n if (pos >= this.chunk2Pos && pos < this.chunk2Pos + this.chunk2.length) {\n result = this.chunk2.charCodeAt(pos - this.chunk2Pos);\n }\n else {\n let i = this.rangeIndex, range = this.range;\n while (range.to <= pos)\n range = this.ranges[++i];\n this.chunk2 = this.input.chunk(this.chunk2Pos = pos);\n if (pos + this.chunk2.length > range.to)\n this.chunk2 = this.chunk2.slice(0, range.to - pos);\n result = this.chunk2.charCodeAt(0);\n }\n }\n if (pos >= this.token.lookAhead)\n this.token.lookAhead = pos + 1;\n return result;\n }\n /// Accept a token. By default, the end of the token is set to the\n /// current stream position, but you can pass an offset (relative to\n /// the stream position) to change that.\n acceptToken(token, endOffset = 0) {\n let end = endOffset ? this.resolveOffset(endOffset, -1) : this.pos;\n if (end == null || end < this.token.start)\n throw new RangeError(\"Token end out of bounds\");\n this.token.value = token;\n this.token.end = end;\n }\n getChunk() {\n if (this.pos >= this.chunk2Pos && this.pos < this.chunk2Pos + this.chunk2.length) {\n let { chunk, chunkPos } = this;\n this.chunk = this.chunk2;\n this.chunkPos = this.chunk2Pos;\n this.chunk2 = chunk;\n this.chunk2Pos = chunkPos;\n this.chunkOff = this.pos - this.chunkPos;\n }\n else {\n this.chunk2 = this.chunk;\n this.chunk2Pos = this.chunkPos;\n let nextChunk = this.input.chunk(this.pos);\n let end = this.pos + nextChunk.length;\n this.chunk = end > this.range.to ? nextChunk.slice(0, this.range.to - this.pos) : nextChunk;\n this.chunkPos = this.pos;\n this.chunkOff = 0;\n }\n }\n readNext() {\n if (this.chunkOff >= this.chunk.length) {\n this.getChunk();\n if (this.chunkOff == this.chunk.length)\n return this.next = -1;\n }\n return this.next = this.chunk.charCodeAt(this.chunkOff);\n }\n /// Move the stream forward N (defaults to 1) code units. Returns\n /// the new value of [`next`](#lr.InputStream.next).\n advance(n = 1) {\n this.chunkOff += n;\n while (this.pos + n >= this.range.to) {\n if (this.rangeIndex == this.ranges.length - 1)\n return this.setDone();\n n -= this.range.to - this.pos;\n this.range = this.ranges[++this.rangeIndex];\n this.pos = this.range.from;\n }\n this.pos += n;\n if (this.pos >= this.token.lookAhead)\n this.token.lookAhead = this.pos + 1;\n return this.readNext();\n }\n setDone() {\n this.pos = this.chunkPos = this.end;\n this.range = this.ranges[this.rangeIndex = this.ranges.length - 1];\n this.chunk = \"\";\n return this.next = -1;\n }\n /// @internal\n reset(pos, token) {\n if (token) {\n this.token = token;\n token.start = pos;\n token.lookAhead = pos + 1;\n token.value = token.extended = -1;\n }\n else {\n this.token = nullToken;\n }\n if (this.pos != pos) {\n this.pos = pos;\n if (pos == this.end) {\n this.setDone();\n return this;\n }\n while (pos < this.range.from)\n this.range = this.ranges[--this.rangeIndex];\n while (pos >= this.range.to)\n this.range = this.ranges[++this.rangeIndex];\n if (pos >= this.chunkPos && pos < this.chunkPos + this.chunk.length) {\n this.chunkOff = pos - this.chunkPos;\n }\n else {\n this.chunk = \"\";\n this.chunkOff = 0;\n }\n this.readNext();\n }\n return this;\n }\n /// @internal\n read(from, to) {\n if (from >= this.chunkPos && to <= this.chunkPos + this.chunk.length)\n return this.chunk.slice(from - this.chunkPos, to - this.chunkPos);\n if (from >= this.chunk2Pos && to <= this.chunk2Pos + this.chunk2.length)\n return this.chunk2.slice(from - this.chunk2Pos, to - this.chunk2Pos);\n if (from >= this.range.from && to <= this.range.to)\n return this.input.read(from, to);\n let result = \"\";\n for (let r of this.ranges) {\n if (r.from >= to)\n break;\n if (r.to > from)\n result += this.input.read(Math.max(r.from, from), Math.min(r.to, to));\n }\n return result;\n }\n}\n/// @internal\nclass TokenGroup {\n constructor(data, id) {\n this.data = data;\n this.id = id;\n }\n token(input, stack) {\n let { parser } = stack.p;\n readToken(this.data, input, stack, this.id, parser.data, parser.tokenPrecTable);\n }\n}\nTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/// @hide\nclass LocalTokenGroup {\n constructor(data, precTable, elseToken) {\n this.precTable = precTable;\n this.elseToken = elseToken;\n this.data = typeof data == \"string\" ? decodeArray(data) : data;\n }\n token(input, stack) {\n let start = input.pos, cur;\n for (;;) {\n cur = input.pos;\n readToken(this.data, input, stack, 0, this.data, this.precTable);\n if (input.token.value > -1)\n break;\n if (this.elseToken == null)\n return;\n if (input.next < 0)\n break;\n input.advance();\n input.reset(cur + 1, input.token);\n }\n if (cur > start) {\n input.reset(start, input.token);\n input.acceptToken(this.elseToken, cur - start);\n }\n }\n}\nLocalTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/// `@external tokens` declarations in the grammar should resolve to\n/// an instance of this class.\nclass ExternalTokenizer {\n /// Create a tokenizer. The first argument is the function that,\n /// given an input stream, scans for the types of tokens it\n /// recognizes at the stream's position, and calls\n /// [`acceptToken`](#lr.InputStream.acceptToken) when it finds\n /// one.\n constructor(\n /// @internal\n token, options = {}) {\n this.token = token;\n this.contextual = !!options.contextual;\n this.fallback = !!options.fallback;\n this.extend = !!options.extend;\n }\n}\n// Tokenizer data is stored a big uint16 array containing, for each\n// state:\n//\n// - A group bitmask, indicating what token groups are reachable from\n// this state, so that paths that can only lead to tokens not in\n// any of the current groups can be cut off early.\n//\n// - The position of the end of the state's sequence of accepting\n// tokens\n//\n// - The number of outgoing edges for the state\n//\n// - The accepting tokens, as (token id, group mask) pairs\n//\n// - The outgoing edges, as (start character, end character, state\n// index) triples, with end character being exclusive\n//\n// This function interprets that data, running through a stream as\n// long as new states with the a matching group mask can be reached,\n// and updating `input.token` when it matches a token.\nfunction readToken(data, input, stack, group, precTable, precOffset) {\n let state = 0, groupMask = 1 << group, { dialect } = stack.p.parser;\n scan: for (;;) {\n if ((groupMask & data[state]) == 0)\n break;\n let accEnd = data[state + 1];\n // Check whether this state can lead to a token in the current group\n // Accept tokens in this state, possibly overwriting\n // lower-precedence / shorter tokens\n for (let i = state + 3; i < accEnd; i += 2)\n if ((data[i + 1] & groupMask) > 0) {\n let term = data[i];\n if (dialect.allows(term) &&\n (input.token.value == -1 || input.token.value == term ||\n overrides(term, input.token.value, precTable, precOffset))) {\n input.acceptToken(term);\n break;\n }\n }\n let next = input.next, low = 0, high = data[state + 2];\n // Special case for EOF\n if (input.next < 0 && high > low && data[accEnd + high * 3 - 3] == 65535 /* Seq.End */ && data[accEnd + high * 3 - 3] == 65535 /* Seq.End */) {\n state = data[accEnd + high * 3 - 1];\n continue scan;\n }\n // Do a binary search on the state's edges\n for (; low < high;) {\n let mid = (low + high) >> 1;\n let index = accEnd + mid + (mid << 1);\n let from = data[index], to = data[index + 1] || 0x10000;\n if (next < from)\n high = mid;\n else if (next >= to)\n low = mid + 1;\n else {\n state = data[index + 2];\n input.advance();\n continue scan;\n }\n }\n break;\n }\n}\nfunction findOffset(data, start, term) {\n for (let i = start, next; (next = data[i]) != 65535 /* Seq.End */; i++)\n if (next == term)\n return i - start;\n return -1;\n}\nfunction overrides(token, prev, tableData, tableOffset) {\n let iPrev = findOffset(tableData, tableOffset, prev);\n return iPrev < 0 || findOffset(tableData, tableOffset, token) < iPrev;\n}\n\n// Environment variable used to control console output\nconst verbose = typeof process != \"undefined\" && process.env && /\\bparse\\b/.test(process.env.LOG);\nlet stackIDs = null;\nvar Safety;\n(function (Safety) {\n Safety[Safety[\"Margin\"] = 25] = \"Margin\";\n})(Safety || (Safety = {}));\nfunction cutAt(tree, pos, side) {\n let cursor = tree.cursor(IterMode.IncludeAnonymous);\n cursor.moveTo(pos);\n for (;;) {\n if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos)))\n for (;;) {\n if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError)\n return side < 0 ? Math.max(0, Math.min(cursor.to - 1, pos - 25 /* Safety.Margin */))\n : Math.min(tree.length, Math.max(cursor.from + 1, pos + 25 /* Safety.Margin */));\n if (side < 0 ? cursor.prevSibling() : cursor.nextSibling())\n break;\n if (!cursor.parent())\n return side < 0 ? 0 : tree.length;\n }\n }\n}\nclass FragmentCursor {\n constructor(fragments, nodeSet) {\n this.fragments = fragments;\n this.nodeSet = nodeSet;\n this.i = 0;\n this.fragment = null;\n this.safeFrom = -1;\n this.safeTo = -1;\n this.trees = [];\n this.start = [];\n this.index = [];\n this.nextFragment();\n }\n nextFragment() {\n let fr = this.fragment = this.i == this.fragments.length ? null : this.fragments[this.i++];\n if (fr) {\n this.safeFrom = fr.openStart ? cutAt(fr.tree, fr.from + fr.offset, 1) - fr.offset : fr.from;\n this.safeTo = fr.openEnd ? cutAt(fr.tree, fr.to + fr.offset, -1) - fr.offset : fr.to;\n while (this.trees.length) {\n this.trees.pop();\n this.start.pop();\n this.index.pop();\n }\n this.trees.push(fr.tree);\n this.start.push(-fr.offset);\n this.index.push(0);\n this.nextStart = this.safeFrom;\n }\n else {\n this.nextStart = 1e9;\n }\n }\n // `pos` must be >= any previously given `pos` for this cursor\n nodeAt(pos) {\n if (pos < this.nextStart)\n return null;\n while (this.fragment && this.safeTo <= pos)\n this.nextFragment();\n if (!this.fragment)\n return null;\n for (;;) {\n let last = this.trees.length - 1;\n if (last < 0) { // End of tree\n this.nextFragment();\n return null;\n }\n let top = this.trees[last], index = this.index[last];\n if (index == top.children.length) {\n this.trees.pop();\n this.start.pop();\n this.index.pop();\n continue;\n }\n let next = top.children[index];\n let start = this.start[last] + top.positions[index];\n if (start > pos) {\n this.nextStart = start;\n return null;\n }\n if (next instanceof Tree) {\n if (start == pos) {\n if (start < this.safeFrom)\n return null;\n let end = start + next.length;\n if (end <= this.safeTo) {\n let lookAhead = next.prop(NodeProp.lookAhead);\n if (!lookAhead || end + lookAhead < this.fragment.to)\n return next;\n }\n }\n this.index[last]++;\n if (start + next.length >= Math.max(this.safeFrom, pos)) { // Enter this node\n this.trees.push(next);\n this.start.push(start);\n this.index.push(0);\n }\n }\n else {\n this.index[last]++;\n this.nextStart = start + next.length;\n }\n }\n }\n}\nclass TokenCache {\n constructor(parser, stream) {\n this.stream = stream;\n this.tokens = [];\n this.mainToken = null;\n this.actions = [];\n this.tokens = parser.tokenizers.map(_ => new CachedToken);\n }\n getActions(stack) {\n let actionIndex = 0;\n let main = null;\n let { parser } = stack.p, { tokenizers } = parser;\n let mask = parser.stateSlot(stack.state, 3 /* ParseState.TokenizerMask */);\n let context = stack.curContext ? stack.curContext.hash : 0;\n let lookAhead = 0;\n for (let i = 0; i < tokenizers.length; i++) {\n if (((1 << i) & mask) == 0)\n continue;\n let tokenizer = tokenizers[i], token = this.tokens[i];\n if (main && !tokenizer.fallback)\n continue;\n if (tokenizer.contextual || token.start != stack.pos || token.mask != mask || token.context != context) {\n this.updateCachedToken(token, tokenizer, stack);\n token.mask = mask;\n token.context = context;\n }\n if (token.lookAhead > token.end + 25 /* Safety.Margin */)\n lookAhead = Math.max(token.lookAhead, lookAhead);\n if (token.value != 0 /* Term.Err */) {\n let startIndex = actionIndex;\n if (token.extended > -1)\n actionIndex = this.addActions(stack, token.extended, token.end, actionIndex);\n actionIndex = this.addActions(stack, token.value, token.end, actionIndex);\n if (!tokenizer.extend) {\n main = token;\n if (actionIndex > startIndex)\n break;\n }\n }\n }\n while (this.actions.length > actionIndex)\n this.actions.pop();\n if (lookAhead)\n stack.setLookAhead(lookAhead);\n if (!main && stack.pos == this.stream.end) {\n main = new CachedToken;\n main.value = stack.p.parser.eofTerm;\n main.start = main.end = stack.pos;\n actionIndex = this.addActions(stack, main.value, main.end, actionIndex);\n }\n this.mainToken = main;\n return this.actions;\n }\n getMainToken(stack) {\n if (this.mainToken)\n return this.mainToken;\n let main = new CachedToken, { pos, p } = stack;\n main.start = pos;\n main.end = Math.min(pos + 1, p.stream.end);\n main.value = pos == p.stream.end ? p.parser.eofTerm : 0 /* Term.Err */;\n return main;\n }\n updateCachedToken(token, tokenizer, stack) {\n let start = this.stream.clipPos(stack.pos);\n tokenizer.token(this.stream.reset(start, token), stack);\n if (token.value > -1) {\n let { parser } = stack.p;\n for (let i = 0; i < parser.specialized.length; i++)\n if (parser.specialized[i] == token.value) {\n let result = parser.specializers[i](this.stream.read(token.start, token.end), stack);\n if (result >= 0 && stack.p.parser.dialect.allows(result >> 1)) {\n if ((result & 1) == 0 /* Specialize.Specialize */)\n token.value = result >> 1;\n else\n token.extended = result >> 1;\n break;\n }\n }\n }\n else {\n token.value = 0 /* Term.Err */;\n token.end = this.stream.clipPos(start + 1);\n }\n }\n putAction(action, token, end, index) {\n // Don't add duplicate actions\n for (let i = 0; i < index; i += 3)\n if (this.actions[i] == action)\n return index;\n this.actions[index++] = action;\n this.actions[index++] = token;\n this.actions[index++] = end;\n return index;\n }\n addActions(stack, token, end, index) {\n let { state } = stack, { parser } = stack.p, { data } = parser;\n for (let set = 0; set < 2; set++) {\n for (let i = parser.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */);; i += 3) {\n if (data[i] == 65535 /* Seq.End */) {\n if (data[i + 1] == 1 /* Seq.Next */) {\n i = pair(data, i + 2);\n }\n else {\n if (index == 0 && data[i + 1] == 2 /* Seq.Other */)\n index = this.putAction(pair(data, i + 2), token, end, index);\n break;\n }\n }\n if (data[i] == token)\n index = this.putAction(pair(data, i + 1), token, end, index);\n }\n }\n return index;\n }\n}\nvar Rec;\n(function (Rec) {\n Rec[Rec[\"Distance\"] = 5] = \"Distance\";\n Rec[Rec[\"MaxRemainingPerStep\"] = 3] = \"MaxRemainingPerStep\";\n // When two stacks have been running independently long enough to\n // add this many elements to their buffers, prune one.\n Rec[Rec[\"MinBufferLengthPrune\"] = 500] = \"MinBufferLengthPrune\";\n Rec[Rec[\"ForceReduceLimit\"] = 10] = \"ForceReduceLimit\";\n // Once a stack reaches this depth (in .stack.length) force-reduce\n // it back to CutTo to avoid creating trees that overflow the stack\n // on recursive traversal.\n Rec[Rec[\"CutDepth\"] = 15000] = \"CutDepth\";\n Rec[Rec[\"CutTo\"] = 9000] = \"CutTo\";\n Rec[Rec[\"MaxLeftAssociativeReductionCount\"] = 300] = \"MaxLeftAssociativeReductionCount\";\n // The maximum number of non-recovering stacks to explore (to avoid\n // getting bogged down with exponentially multiplying stacks in\n // ambiguous content)\n Rec[Rec[\"MaxStackCount\"] = 12] = \"MaxStackCount\";\n})(Rec || (Rec = {}));\nclass Parse {\n constructor(parser, input, fragments, ranges) {\n this.parser = parser;\n this.input = input;\n this.ranges = ranges;\n this.recovering = 0;\n this.nextStackID = 0x2654; // ♔, ♕, ♖, ♗, ♘, ♙, ♠, ♡, ♢, ♣, ♤, ♥, ♦, ♧\n this.minStackPos = 0;\n this.reused = [];\n this.stoppedAt = null;\n this.lastBigReductionStart = -1;\n this.lastBigReductionSize = 0;\n this.bigReductionCount = 0;\n this.stream = new InputStream(input, ranges);\n this.tokens = new TokenCache(parser, this.stream);\n this.topTerm = parser.top[1];\n let { from } = ranges[0];\n this.stacks = [Stack.start(this, parser.top[0], from)];\n this.fragments = fragments.length && this.stream.end - from > parser.bufferLength * 4\n ? new FragmentCursor(fragments, parser.nodeSet) : null;\n }\n get parsedPos() {\n return this.minStackPos;\n }\n // Move the parser forward. This will process all parse stacks at\n // `this.pos` and try to advance them to a further position. If no\n // stack for such a position is found, it'll start error-recovery.\n //\n // When the parse is finished, this will return a syntax tree. When\n // not, it returns `null`.\n advance() {\n let stacks = this.stacks, pos = this.minStackPos;\n // This will hold stacks beyond `pos`.\n let newStacks = this.stacks = [];\n let stopped, stoppedTokens;\n // If a large amount of reductions happened with the same start\n // position, force the stack out of that production in order to\n // avoid creating a tree too deep to recurse through.\n // (This is an ugly kludge, because unfortunately there is no\n // straightforward, cheap way to check for this happening, due to\n // the history of reductions only being available in an\n // expensive-to-access format in the stack buffers.)\n if (this.bigReductionCount > 300 /* Rec.MaxLeftAssociativeReductionCount */ && stacks.length == 1) {\n let [s] = stacks;\n while (s.forceReduce() && s.stack.length && s.stack[s.stack.length - 2] >= this.lastBigReductionStart) { }\n this.bigReductionCount = this.lastBigReductionSize = 0;\n }\n // Keep advancing any stacks at `pos` until they either move\n // forward or can't be advanced. Gather stacks that can't be\n // advanced further in `stopped`.\n for (let i = 0; i < stacks.length; i++) {\n let stack = stacks[i];\n for (;;) {\n this.tokens.mainToken = null;\n if (stack.pos > pos) {\n newStacks.push(stack);\n }\n else if (this.advanceStack(stack, newStacks, stacks)) {\n continue;\n }\n else {\n if (!stopped) {\n stopped = [];\n stoppedTokens = [];\n }\n stopped.push(stack);\n let tok = this.tokens.getMainToken(stack);\n stoppedTokens.push(tok.value, tok.end);\n }\n break;\n }\n }\n if (!newStacks.length) {\n let finished = stopped && findFinished(stopped);\n if (finished)\n return this.stackToTree(finished);\n if (this.parser.strict) {\n if (verbose && stopped)\n console.log(\"Stuck with token \" + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : \"none\"));\n throw new SyntaxError(\"No parse at \" + pos);\n }\n if (!this.recovering)\n this.recovering = 5 /* Rec.Distance */;\n }\n if (this.recovering && stopped) {\n let finished = this.stoppedAt != null && stopped[0].pos > this.stoppedAt ? stopped[0]\n : this.runRecovery(stopped, stoppedTokens, newStacks);\n if (finished)\n return this.stackToTree(finished.forceAll());\n }\n if (this.recovering) {\n let maxRemaining = this.recovering == 1 ? 1 : this.recovering * 3 /* Rec.MaxRemainingPerStep */;\n if (newStacks.length > maxRemaining) {\n newStacks.sort((a, b) => b.score - a.score);\n while (newStacks.length > maxRemaining)\n newStacks.pop();\n }\n if (newStacks.some(s => s.reducePos > pos))\n this.recovering--;\n }\n else if (newStacks.length > 1) {\n // Prune stacks that are in the same state, or that have been\n // running without splitting for a while, to avoid getting stuck\n // with multiple successful stacks running endlessly on.\n outer: for (let i = 0; i < newStacks.length - 1; i++) {\n let stack = newStacks[i];\n for (let j = i + 1; j < newStacks.length; j++) {\n let other = newStacks[j];\n if (stack.sameState(other) ||\n stack.buffer.length > 500 /* Rec.MinBufferLengthPrune */ && other.buffer.length > 500 /* Rec.MinBufferLengthPrune */) {\n if (((stack.score - other.score) || (stack.buffer.length - other.buffer.length)) > 0) {\n newStacks.splice(j--, 1);\n }\n else {\n newStacks.splice(i--, 1);\n continue outer;\n }\n }\n }\n }\n if (newStacks.length > 12 /* Rec.MaxStackCount */)\n newStacks.splice(12 /* Rec.MaxStackCount */, newStacks.length - 12 /* Rec.MaxStackCount */);\n }\n this.minStackPos = newStacks[0].pos;\n for (let i = 1; i < newStacks.length; i++)\n if (newStacks[i].pos < this.minStackPos)\n this.minStackPos = newStacks[i].pos;\n return null;\n }\n stopAt(pos) {\n if (this.stoppedAt != null && this.stoppedAt < pos)\n throw new RangeError(\"Can't move stoppedAt forward\");\n this.stoppedAt = pos;\n }\n // Returns an updated version of the given stack, or null if the\n // stack can't advance normally. When `split` and `stacks` are\n // given, stacks split off by ambiguous operations will be pushed to\n // `split`, or added to `stacks` if they move `pos` forward.\n advanceStack(stack, stacks, split) {\n let start = stack.pos, { parser } = this;\n let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n if (this.stoppedAt != null && start > this.stoppedAt)\n return stack.forceReduce() ? stack : null;\n if (this.fragments) {\n let strictCx = stack.curContext && stack.curContext.tracker.strict, cxHash = strictCx ? stack.curContext.hash : 0;\n for (let cached = this.fragments.nodeAt(start); cached;) {\n let match = this.parser.nodeSet.types[cached.type.id] == cached.type ? parser.getGoto(stack.state, cached.type.id) : -1;\n if (match > -1 && cached.length && (!strictCx || (cached.prop(NodeProp.contextHash) || 0) == cxHash)) {\n stack.useNode(cached, match);\n if (verbose)\n console.log(base + this.stackID(stack) + ` (via reuse of ${parser.getName(cached.type.id)})`);\n return true;\n }\n if (!(cached instanceof Tree) || cached.children.length == 0 || cached.positions[0] > 0)\n break;\n let inner = cached.children[0];\n if (inner instanceof Tree && cached.positions[0] == 0)\n cached = inner;\n else\n break;\n }\n }\n let defaultReduce = parser.stateSlot(stack.state, 4 /* ParseState.DefaultReduce */);\n if (defaultReduce > 0) {\n stack.reduce(defaultReduce);\n if (verbose)\n console.log(base + this.stackID(stack) + ` (via always-reduce ${parser.getName(defaultReduce & 65535 /* Action.ValueMask */)})`);\n return true;\n }\n if (stack.stack.length >= 15000 /* Rec.CutDepth */) {\n while (stack.stack.length > 9000 /* Rec.CutTo */ && stack.forceReduce()) { }\n }\n let actions = this.tokens.getActions(stack);\n for (let i = 0; i < actions.length;) {\n let action = actions[i++], term = actions[i++], end = actions[i++];\n let last = i == actions.length || !split;\n let localStack = last ? stack : stack.split();\n localStack.apply(action, term, end);\n if (verbose)\n console.log(base + this.stackID(localStack) + ` (via ${(action & 65536 /* Action.ReduceFlag */) == 0 ? \"shift\"\n : `reduce of ${parser.getName(action & 65535 /* Action.ValueMask */)}`} for ${parser.getName(term)} @ ${start}${localStack == stack ? \"\" : \", split\"})`);\n if (last)\n return true;\n else if (localStack.pos > start)\n stacks.push(localStack);\n else\n split.push(localStack);\n }\n return false;\n }\n // Advance a given stack forward as far as it will go. Returns the\n // (possibly updated) stack if it got stuck, or null if it moved\n // forward and was given to `pushStackDedup`.\n advanceFully(stack, newStacks) {\n let pos = stack.pos;\n for (;;) {\n if (!this.advanceStack(stack, null, null))\n return false;\n if (stack.pos > pos) {\n pushStackDedup(stack, newStacks);\n return true;\n }\n }\n }\n runRecovery(stacks, tokens, newStacks) {\n let finished = null, restarted = false;\n for (let i = 0; i < stacks.length; i++) {\n let stack = stacks[i], token = tokens[i << 1], tokenEnd = tokens[(i << 1) + 1];\n let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n if (stack.deadEnd) {\n if (restarted)\n continue;\n restarted = true;\n stack.restart();\n if (verbose)\n console.log(base + this.stackID(stack) + \" (restarted)\");\n let done = this.advanceFully(stack, newStacks);\n if (done)\n continue;\n }\n let force = stack.split(), forceBase = base;\n for (let j = 0; force.forceReduce() && j < 10 /* Rec.ForceReduceLimit */; j++) {\n if (verbose)\n console.log(forceBase + this.stackID(force) + \" (via force-reduce)\");\n let done = this.advanceFully(force, newStacks);\n if (done)\n break;\n if (verbose)\n forceBase = this.stackID(force) + \" -> \";\n }\n for (let insert of stack.recoverByInsert(token)) {\n if (verbose)\n console.log(base + this.stackID(insert) + \" (via recover-insert)\");\n this.advanceFully(insert, newStacks);\n }\n if (this.stream.end > stack.pos) {\n if (tokenEnd == stack.pos) {\n tokenEnd++;\n token = 0 /* Term.Err */;\n }\n stack.recoverByDelete(token, tokenEnd);\n if (verbose)\n console.log(base + this.stackID(stack) + ` (via recover-delete ${this.parser.getName(token)})`);\n pushStackDedup(stack, newStacks);\n }\n else if (!finished || finished.score < stack.score) {\n finished = stack;\n }\n }\n return finished;\n }\n // Convert the stack's buffer to a syntax tree.\n stackToTree(stack) {\n stack.close();\n return Tree.build({ buffer: StackBufferCursor.create(stack),\n nodeSet: this.parser.nodeSet,\n topID: this.topTerm,\n maxBufferLength: this.parser.bufferLength,\n reused: this.reused,\n start: this.ranges[0].from,\n length: stack.pos - this.ranges[0].from,\n minRepeatType: this.parser.minRepeatTerm });\n }\n stackID(stack) {\n let id = (stackIDs || (stackIDs = new WeakMap)).get(stack);\n if (!id)\n stackIDs.set(stack, id = String.fromCodePoint(this.nextStackID++));\n return id + stack;\n }\n}\nfunction pushStackDedup(stack, newStacks) {\n for (let i = 0; i < newStacks.length; i++) {\n let other = newStacks[i];\n if (other.pos == stack.pos && other.sameState(stack)) {\n if (newStacks[i].score < stack.score)\n newStacks[i] = stack;\n return;\n }\n }\n newStacks.push(stack);\n}\nclass Dialect {\n constructor(source, flags, disabled) {\n this.source = source;\n this.flags = flags;\n this.disabled = disabled;\n }\n allows(term) { return !this.disabled || this.disabled[term] == 0; }\n}\nconst id = x => x;\n/// Context trackers are used to track stateful context (such as\n/// indentation in the Python grammar, or parent elements in the XML\n/// grammar) needed by external tokenizers. You declare them in a\n/// grammar file as `@context exportName from \"module\"`.\n///\n/// Context values should be immutable, and can be updated (replaced)\n/// on shift or reduce actions.\n///\n/// The export used in a `@context` declaration should be of this\n/// type.\nclass ContextTracker {\n /// Define a context tracker.\n constructor(spec) {\n this.start = spec.start;\n this.shift = spec.shift || id;\n this.reduce = spec.reduce || id;\n this.reuse = spec.reuse || id;\n this.hash = spec.hash || (() => 0);\n this.strict = spec.strict !== false;\n }\n}\n/// Holds the parse tables for a given grammar, as generated by\n/// `lezer-generator`, and provides [methods](#common.Parser) to parse\n/// content with.\nclass LRParser extends Parser {\n /// @internal\n constructor(spec) {\n super();\n /// @internal\n this.wrappers = [];\n if (spec.version != 14 /* File.Version */)\n throw new RangeError(`Parser version (${spec.version}) doesn't match runtime version (${14 /* File.Version */})`);\n let nodeNames = spec.nodeNames.split(\" \");\n this.minRepeatTerm = nodeNames.length;\n for (let i = 0; i < spec.repeatNodeCount; i++)\n nodeNames.push(\"\");\n let topTerms = Object.keys(spec.topRules).map(r => spec.topRules[r][1]);\n let nodeProps = [];\n for (let i = 0; i < nodeNames.length; i++)\n nodeProps.push([]);\n function setProp(nodeID, prop, value) {\n nodeProps[nodeID].push([prop, prop.deserialize(String(value))]);\n }\n if (spec.nodeProps)\n for (let propSpec of spec.nodeProps) {\n let prop = propSpec[0];\n if (typeof prop == \"string\")\n prop = NodeProp[prop];\n for (let i = 1; i < propSpec.length;) {\n let next = propSpec[i++];\n if (next >= 0) {\n setProp(next, prop, propSpec[i++]);\n }\n else {\n let value = propSpec[i + -next];\n for (let j = -next; j > 0; j--)\n setProp(propSpec[i++], prop, value);\n i++;\n }\n }\n }\n this.nodeSet = new NodeSet(nodeNames.map((name, i) => NodeType.define({\n name: i >= this.minRepeatTerm ? undefined : name,\n id: i,\n props: nodeProps[i],\n top: topTerms.indexOf(i) > -1,\n error: i == 0,\n skipped: spec.skippedNodes && spec.skippedNodes.indexOf(i) > -1\n })));\n if (spec.propSources)\n this.nodeSet = this.nodeSet.extend(...spec.propSources);\n this.strict = false;\n this.bufferLength = DefaultBufferLength;\n let tokenArray = decodeArray(spec.tokenData);\n this.context = spec.context;\n this.specializerSpecs = spec.specialized || [];\n this.specialized = new Uint16Array(this.specializerSpecs.length);\n for (let i = 0; i < this.specializerSpecs.length; i++)\n this.specialized[i] = this.specializerSpecs[i].term;\n this.specializers = this.specializerSpecs.map(getSpecializer);\n this.states = decodeArray(spec.states, Uint32Array);\n this.data = decodeArray(spec.stateData);\n this.goto = decodeArray(spec.goto);\n this.maxTerm = spec.maxTerm;\n this.tokenizers = spec.tokenizers.map(value => typeof value == \"number\" ? new TokenGroup(tokenArray, value) : value);\n this.topRules = spec.topRules;\n this.dialects = spec.dialects || {};\n this.dynamicPrecedences = spec.dynamicPrecedences || null;\n this.tokenPrecTable = spec.tokenPrec;\n this.termNames = spec.termNames || null;\n this.maxNode = this.nodeSet.types.length - 1;\n this.dialect = this.parseDialect();\n this.top = this.topRules[Object.keys(this.topRules)[0]];\n }\n createParse(input, fragments, ranges) {\n let parse = new Parse(this, input, fragments, ranges);\n for (let w of this.wrappers)\n parse = w(parse, input, fragments, ranges);\n return parse;\n }\n /// Get a goto table entry @internal\n getGoto(state, term, loose = false) {\n let table = this.goto;\n if (term >= table[0])\n return -1;\n for (let pos = table[term + 1];;) {\n let groupTag = table[pos++], last = groupTag & 1;\n let target = table[pos++];\n if (last && loose)\n return target;\n for (let end = pos + (groupTag >> 1); pos < end; pos++)\n if (table[pos] == state)\n return target;\n if (last)\n return -1;\n }\n }\n /// Check if this state has an action for a given terminal @internal\n hasAction(state, terminal) {\n let data = this.data;\n for (let set = 0; set < 2; set++) {\n for (let i = this.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */), next;; i += 3) {\n if ((next = data[i]) == 65535 /* Seq.End */) {\n if (data[i + 1] == 1 /* Seq.Next */)\n next = data[i = pair(data, i + 2)];\n else if (data[i + 1] == 2 /* Seq.Other */)\n return pair(data, i + 2);\n else\n break;\n }\n if (next == terminal || next == 0 /* Term.Err */)\n return pair(data, i + 1);\n }\n }\n return 0;\n }\n /// @internal\n stateSlot(state, slot) {\n return this.states[(state * 6 /* ParseState.Size */) + slot];\n }\n /// @internal\n stateFlag(state, flag) {\n return (this.stateSlot(state, 0 /* ParseState.Flags */) & flag) > 0;\n }\n /// @internal\n validAction(state, action) {\n if (action == this.stateSlot(state, 4 /* ParseState.DefaultReduce */))\n return true;\n for (let i = this.stateSlot(state, 1 /* ParseState.Actions */);; i += 3) {\n if (this.data[i] == 65535 /* Seq.End */) {\n if (this.data[i + 1] == 1 /* Seq.Next */)\n i = pair(this.data, i + 2);\n else\n return false;\n }\n if (action == pair(this.data, i + 1))\n return true;\n }\n }\n /// Get the states that can follow this one through shift actions or\n /// goto jumps. @internal\n nextStates(state) {\n let result = [];\n for (let i = this.stateSlot(state, 1 /* ParseState.Actions */);; i += 3) {\n if (this.data[i] == 65535 /* Seq.End */) {\n if (this.data[i + 1] == 1 /* Seq.Next */)\n i = pair(this.data, i + 2);\n else\n break;\n }\n if ((this.data[i + 2] & (65536 /* Action.ReduceFlag */ >> 16)) == 0) {\n let value = this.data[i + 1];\n if (!result.some((v, i) => (i & 1) && v == value))\n result.push(this.data[i], value);\n }\n }\n return result;\n }\n /// Configure the parser. Returns a new parser instance that has the\n /// given settings modified. Settings not provided in `config` are\n /// kept from the original parser.\n configure(config) {\n // Hideous reflection-based kludge to make it easy to create a\n // slightly modified copy of a parser.\n let copy = Object.assign(Object.create(LRParser.prototype), this);\n if (config.props)\n copy.nodeSet = this.nodeSet.extend(...config.props);\n if (config.top) {\n let info = this.topRules[config.top];\n if (!info)\n throw new RangeError(`Invalid top rule name ${config.top}`);\n copy.top = info;\n }\n if (config.tokenizers)\n copy.tokenizers = this.tokenizers.map(t => {\n let found = config.tokenizers.find(r => r.from == t);\n return found ? found.to : t;\n });\n if (config.specializers) {\n copy.specializers = this.specializers.slice();\n copy.specializerSpecs = this.specializerSpecs.map((s, i) => {\n let found = config.specializers.find(r => r.from == s.external);\n if (!found)\n return s;\n let spec = Object.assign(Object.assign({}, s), { external: found.to });\n copy.specializers[i] = getSpecializer(spec);\n return spec;\n });\n }\n if (config.contextTracker)\n copy.context = config.contextTracker;\n if (config.dialect)\n copy.dialect = this.parseDialect(config.dialect);\n if (config.strict != null)\n copy.strict = config.strict;\n if (config.wrap)\n copy.wrappers = copy.wrappers.concat(config.wrap);\n if (config.bufferLength != null)\n copy.bufferLength = config.bufferLength;\n return copy;\n }\n /// Tells you whether any [parse wrappers](#lr.ParserConfig.wrap)\n /// are registered for this parser.\n hasWrappers() {\n return this.wrappers.length > 0;\n }\n /// Returns the name associated with a given term. This will only\n /// work for all terms when the parser was generated with the\n /// `--names` option. By default, only the names of tagged terms are\n /// stored.\n getName(term) {\n return this.termNames ? this.termNames[term] : String(term <= this.maxNode && this.nodeSet.types[term].name || term);\n }\n /// The eof term id is always allocated directly after the node\n /// types. @internal\n get eofTerm() { return this.maxNode + 1; }\n /// The type of top node produced by the parser.\n get topNode() { return this.nodeSet.types[this.top[1]]; }\n /// @internal\n dynamicPrecedence(term) {\n let prec = this.dynamicPrecedences;\n return prec == null ? 0 : prec[term] || 0;\n }\n /// @internal\n parseDialect(dialect) {\n let values = Object.keys(this.dialects), flags = values.map(() => false);\n if (dialect)\n for (let part of dialect.split(\" \")) {\n let id = values.indexOf(part);\n if (id >= 0)\n flags[id] = true;\n }\n let disabled = null;\n for (let i = 0; i < values.length; i++)\n if (!flags[i]) {\n for (let j = this.dialects[values[i]], id; (id = this.data[j++]) != 65535 /* Seq.End */;)\n (disabled || (disabled = new Uint8Array(this.maxTerm + 1)))[id] = 1;\n }\n return new Dialect(dialect, flags, disabled);\n }\n /// Used by the output of the parser generator. Not available to\n /// user code. @hide\n static deserialize(spec) {\n return new LRParser(spec);\n }\n}\nfunction pair(data, off) { return data[off] | (data[off + 1] << 16); }\nfunction findFinished(stacks) {\n let best = null;\n for (let stack of stacks) {\n let stopped = stack.p.stoppedAt;\n if ((stack.pos == stack.p.stream.end || stopped != null && stack.pos > stopped) &&\n stack.p.parser.stateFlag(stack.state, 2 /* StateFlag.Accepting */) &&\n (!best || best.score < stack.score))\n best = stack;\n }\n return best;\n}\nfunction getSpecializer(spec) {\n if (spec.external) {\n let mask = spec.extend ? 1 /* Specialize.Extend */ : 0 /* Specialize.Specialize */;\n return (value, stack) => (spec.external(value, stack) << 1) | mask;\n }\n return spec.get;\n}\n\nexport { ContextTracker, ExternalTokenizer, InputStream, LRParser, LocalTokenGroup, Stack };\n","import { ContextTracker, ExternalTokenizer, LRParser, LocalTokenGroup } from '@lezer/lr';\nimport { styleTags, tags } from '@lezer/highlight';\n\n// This file was generated by lezer-generator. You probably shouldn't edit it.\nconst noSemi = 301,\n incdec = 1,\n incdecPrefix = 2,\n insertSemi = 302,\n spaces = 304,\n newline = 305,\n LineComment = 3,\n BlockComment = 4;\n\n/* Hand-written tokenizers for JavaScript tokens that can't be\n expressed by lezer's built-in tokenizer. */\n\nconst space = [9, 10, 11, 12, 13, 32, 133, 160, 5760, 8192, 8193, 8194, 8195, 8196, 8197, 8198, 8199, 8200,\n 8201, 8202, 8232, 8233, 8239, 8287, 12288];\n\nconst braceR = 125, semicolon = 59, slash = 47, star = 42,\n plus = 43, minus = 45;\n\nconst trackNewline = new ContextTracker({\n start: false,\n shift(context, term) {\n return term == LineComment || term == BlockComment || term == spaces ? context : term == newline\n },\n strict: false\n});\n\nconst insertSemicolon = new ExternalTokenizer((input, stack) => {\n let {next} = input;\n if ((next == braceR || next == -1 || stack.context) && stack.canShift(insertSemi))\n input.acceptToken(insertSemi);\n}, {contextual: true, fallback: true});\n\nconst noSemicolon = new ExternalTokenizer((input, stack) => {\n let {next} = input, after;\n if (space.indexOf(next) > -1) return\n if (next == slash && ((after = input.peek(1)) == slash || after == star)) return\n if (next != braceR && next != semicolon && next != -1 && !stack.context && stack.canShift(noSemi))\n input.acceptToken(noSemi);\n}, {contextual: true});\n\nconst incdecToken = new ExternalTokenizer((input, stack) => {\n let {next} = input;\n if (next == plus || next == minus) {\n input.advance();\n if (next == input.next) {\n input.advance();\n let mayPostfix = !stack.context && stack.canShift(incdec);\n input.acceptToken(mayPostfix ? incdec : incdecPrefix);\n }\n }\n}, {contextual: true});\n\nconst jsHighlight = styleTags({\n \"get set async static\": tags.modifier,\n \"for while do if else switch try catch finally return throw break continue default case\": tags.controlKeyword,\n \"in of await yield void typeof delete instanceof\": tags.operatorKeyword,\n \"let var const function class extends\": tags.definitionKeyword,\n \"import export from\": tags.moduleKeyword,\n \"with debugger as new\": tags.keyword,\n TemplateString: tags.special(tags.string),\n super: tags.atom,\n BooleanLiteral: tags.bool,\n this: tags.self,\n null: tags.null,\n Star: tags.modifier,\n VariableName: tags.variableName,\n \"CallExpression/VariableName TaggedTemplateExpression/VariableName\": tags.function(tags.variableName),\n VariableDefinition: tags.definition(tags.variableName),\n Label: tags.labelName,\n PropertyName: tags.propertyName,\n PrivatePropertyName: tags.special(tags.propertyName),\n \"CallExpression/MemberExpression/PropertyName\": tags.function(tags.propertyName),\n \"FunctionDeclaration/VariableDefinition\": tags.function(tags.definition(tags.variableName)),\n \"ClassDeclaration/VariableDefinition\": tags.definition(tags.className),\n PropertyDefinition: tags.definition(tags.propertyName),\n PrivatePropertyDefinition: tags.definition(tags.special(tags.propertyName)),\n UpdateOp: tags.updateOperator,\n LineComment: tags.lineComment,\n BlockComment: tags.blockComment,\n Number: tags.number,\n String: tags.string,\n Escape: tags.escape,\n ArithOp: tags.arithmeticOperator,\n LogicOp: tags.logicOperator,\n BitOp: tags.bitwiseOperator,\n CompareOp: tags.compareOperator,\n RegExp: tags.regexp,\n Equals: tags.definitionOperator,\n Arrow: tags.function(tags.punctuation),\n \": Spread\": tags.punctuation,\n \"( )\": tags.paren,\n \"[ ]\": tags.squareBracket,\n \"{ }\": tags.brace,\n \"InterpolationStart InterpolationEnd\": tags.special(tags.brace),\n \".\": tags.derefOperator,\n \", ;\": tags.separator,\n \"@\": tags.meta,\n\n TypeName: tags.typeName,\n TypeDefinition: tags.definition(tags.typeName),\n \"type enum interface implements namespace module declare\": tags.definitionKeyword,\n \"abstract global Privacy readonly override\": tags.modifier,\n \"is keyof unique infer\": tags.operatorKeyword,\n\n JSXAttributeValue: tags.attributeValue,\n JSXText: tags.content,\n \"JSXStartTag JSXStartCloseTag JSXSelfCloseEndTag JSXEndTag\": tags.angleBracket,\n \"JSXIdentifier JSXNameSpacedName\": tags.tagName,\n \"JSXAttribute/JSXIdentifier JSXAttribute/JSXNameSpacedName\": tags.attributeName,\n \"JSXBuiltin/JSXIdentifier\": tags.standard(tags.tagName)\n});\n\n// This file was generated by lezer-generator. You probably shouldn't edit it.\nconst spec_identifier = {__proto__:null,export:14, as:19, from:27, default:30, async:35, function:36, extends:46, this:50, true:58, false:58, null:70, void:74, typeof:78, super:96, new:130, delete:146, yield:155, await:159, class:164, public:219, private:219, protected:219, readonly:221, instanceof:240, satisfies:243, in:244, const:246, import:278, keyof:333, unique:337, infer:343, is:379, abstract:399, implements:401, type:403, let:406, var:408, interface:415, enum:419, namespace:425, module:427, declare:431, global:435, for:456, of:465, while:468, with:472, do:476, if:480, else:482, switch:486, case:492, try:498, catch:502, finally:506, return:510, throw:514, break:518, continue:522, debugger:526};\nconst spec_word = {__proto__:null,async:117, get:119, set:121, public:181, private:181, protected:181, static:183, abstract:185, override:187, readonly:193, accessor:195, new:383};\nconst spec_LessThan = {__proto__:null,\"<\":137};\nconst parser = LRParser.deserialize({\n version: 14,\n states: \"$BhO`QUOOO%QQUOOO'TQWOOP(_OSOOO*mQ(CjO'#CfO*tOpO'#CgO+SO!bO'#CgO+bO07`O'#DZO-sQUO'#DaO.TQUO'#DlO%QQUO'#DvO0[QUO'#EOOOQ(CY'#EW'#EWO0rQSO'#ETOOQO'#I_'#I_O0zQSO'#GjOOQO'#Eh'#EhO1VQSO'#EgO1[QSO'#EgO3^Q(CjO'#JbO5}Q(CjO'#JcO6kQSO'#FVO6pQ#tO'#FnOOQ(CY'#F_'#F_O6{O&jO'#F_O7ZQ,UO'#FuO8qQSO'#FtOOQ(CY'#Jc'#JcOOQ(CW'#Jb'#JbOOQQ'#J|'#J|O8vQSO'#IOO8{Q(C[O'#IPOOQQ'#JO'#JOOOQQ'#IT'#ITQ`QUOOO%QQUO'#DnO9TQUO'#DzO%QQUO'#D|O9[QSO'#GjO9aQ,UO'#ClO9oQSO'#EfO9zQSO'#EqO:PQ,UO'#F^O:nQSO'#GjO:sQSO'#GnO;OQSO'#GnO;^QSO'#GqO;^QSO'#GrO;^QSO'#GtO9[QSO'#GwO;}QSO'#GzO=`QSO'#CbO=pQSO'#HXO=xQSO'#H_O=xQSO'#HaO`QUO'#HcO=xQSO'#HeO=xQSO'#HhO=}QSO'#HnO>SQ(C]O'#HtO%QQUO'#HvO>_Q(C]O'#HxO>jQ(C]O'#HzO8{Q(C[O'#H|O>uQ(CjO'#CfO?wQWO'#DfQOQSOOO@_QSO'#EPO9aQ,UO'#EfO@jQSO'#EfO@uQ`O'#F^OOQQ'#Cd'#CdOOQ(CW'#Dk'#DkOOQ(CW'#Jf'#JfO%QQUO'#JfOBOQWO'#E_OOQ(CW'#E^'#E^OBYQ(C`O'#E_OBtQWO'#ESOOQO'#Ji'#JiOCYQWO'#ESOCgQWO'#E_OC}QWO'#EeODQQWO'#E_O@}QWO'#E_OBtQWO'#E_PDkO?MpO'#C`POOO)CDm)CDmOOOO'#IU'#IUODvOpO,59ROOQ(CY,59R,59ROOOO'#IV'#IVOEUO!bO,59RO%QQUO'#D]OOOO'#IX'#IXOEdO07`O,59uOOQ(CY,59u,59uOErQUO'#IYOFVQSO'#JdOHXQbO'#JdO+pQUO'#JdOH`QSO,59{OHvQSO'#EhOITQSO'#JqOI`QSO'#JpOI`QSO'#JpOIhQSO,5;UOImQSO'#JoOOQ(CY,5:W,5:WOItQUO,5:WOKuQ(CjO,5:bOLfQSO,5:jOLkQSO'#JmOMeQ(C[O'#JnO:sQSO'#JmOMlQSO'#JmOMtQSO,5;TOMyQSO'#JmOOQ(CY'#Cf'#CfO%QQUO'#EOONmQ`O,5:oOOQO'#Jj'#JjOOQO-E<]-E<]O9[QSO,5=UO! TQSO,5=UO! YQUO,5;RO!#]Q,UO'#EcO!$pQSO,5;RO!&YQ,UO'#DpO!&aQUO'#DuO!&kQWO,5;[O!&sQWO,5;[O%QQUO,5;[OOQQ'#E}'#E}OOQQ'#FP'#FPO%QQUO,5;]O%QQUO,5;]O%QQUO,5;]O%QQUO,5;]O%QQUO,5;]O%QQUO,5;]O%QQUO,5;]O%QQUO,5;]O%QQUO,5;]O%QQUO,5;]O%QQUO,5;]OOQQ'#FT'#FTO!'RQUO,5;nOOQ(CY,5;s,5;sOOQ(CY,5;t,5;tO!)UQSO,5;tOOQ(CY,5;u,5;uO%QQUO'#IeO!)^Q(C[O,5jOOQQ'#JW'#JWOOQQ,5>k,5>kOOQQ-EgQWO'#EkOOQ(CW'#Jo'#JoO!>nQ(C[O'#J}O8{Q(C[O,5=YO;^QSO,5=`OOQO'#Cr'#CrO!>yQWO,5=]O!?RQ,UO,5=^O!?^QSO,5=`O!?cQ`O,5=cO=}QSO'#G|O9[QSO'#HOO!?kQSO'#HOO9aQ,UO'#HRO!?pQSO'#HROOQQ,5=f,5=fO!?uQSO'#HSO!?}QSO'#ClO!@SQSO,58|O!@^QSO,58|O!BfQUO,58|OOQQ,58|,58|O!BsQ(C[O,58|O%QQUO,58|O!COQUO'#HZOOQQ'#H['#H[OOQQ'#H]'#H]O`QUO,5=sO!C`QSO,5=sO`QUO,5=yO`QUO,5={O!CeQSO,5=}O`QUO,5>PO!CjQSO,5>SO!CoQUO,5>YOOQQ,5>`,5>`O%QQUO,5>`O8{Q(C[O,5>bOOQQ,5>d,5>dO!GvQSO,5>dOOQQ,5>f,5>fO!GvQSO,5>fOOQQ,5>h,5>hO!G{QWO'#DXO%QQUO'#JfO!HjQWO'#JfO!IXQWO'#DgO!IjQWO'#DgO!K{QUO'#DgO!LSQSO'#JeO!L[QSO,5:QO!LaQSO'#ElO!LoQSO'#JrO!LwQSO,5;VO!L|QWO'#DgO!MZQWO'#EROOQ(CY,5:k,5:kO%QQUO,5:kO!MbQSO,5:kO=}QSO,5;QO!;xQWO,5;QO!tO+pQUO,5>tOOQO,5>z,5>zO#$vQUO'#IYOOQO-EtO$8XQSO1G5jO$8aQSO1G5vO$8iQbO1G5wO:sQSO,5>zO$8sQSO1G5sO$8sQSO1G5sO:sQSO1G5sO$8{Q(CjO1G5tO%QQUO1G5tO$9]Q(C[O1G5tO$9nQSO,5>|O:sQSO,5>|OOQO,5>|,5>|O$:SQSO,5>|OOQO-E<`-E<`OOQO1G0]1G0]OOQO1G0_1G0_O!)XQSO1G0_OOQQ7+([7+([O!#]Q,UO7+([O%QQUO7+([O$:bQSO7+([O$:mQ,UO7+([O$:{Q(CjO,59nO$=TQ(CjO,5UOOQQ,5>U,5>UO%QQUO'#HkO%&qQSO'#HmOOQQ,5>[,5>[O:sQSO,5>[OOQQ,5>^,5>^OOQQ7+)`7+)`OOQQ7+)f7+)fOOQQ7+)j7+)jOOQQ7+)l7+)lO%&vQWO1G5lO%'[Q$IUO1G0rO%'fQSO1G0rOOQO1G/m1G/mO%'qQ$IUO1G/mO=}QSO1G/mO!'RQUO'#DgOOQO,5>u,5>uOOQO-E{,5>{OOQO-E<_-E<_O!;xQWO1G/mOOQO-E<[-E<[OOQ(CY1G0X1G0XOOQ(CY7+%q7+%qO!MeQSO7+%qOOQ(CY7+&W7+&WO=}QSO7+&WO!;xQWO7+&WOOQO7+%t7+%tO$7kQ(CjO7+&POOQO7+&P7+&PO%QQUO7+&PO%'{Q(C[O7+&PO=}QSO7+%tO!;xQWO7+%tO%(WQ(C[O7+&POBtQWO7+%tO%(fQ(C[O7+&PO%(zQ(C`O7+&PO%)UQWO7+%tOBtQWO7+&PO%)cQWO7+&PO%)yQSO7++_O%)yQSO7++_O%*RQ(CjO7++`O%QQUO7++`OOQO1G4h1G4hO:sQSO1G4hO%*cQSO1G4hOOQO7+%y7+%yO!MeQSO<vOOQO-EwO%QQUO,5>wOOQO-ESQ$IUO1G0wO%>ZQ$IUO1G0wO%@RQ$IUO1G0wO%@fQ(CjO<VOOQQ,5>X,5>XO&#WQSO1G3vO:sQSO7+&^O!'RQUO7+&^OOQO7+%X7+%XO&#]Q$IUO1G5wO=}QSO7+%XOOQ(CY<zAN>zO%QQUOAN?VO=}QSOAN>zO&<^Q(C[OAN?VO!;xQWOAN>zO&zO&RO!V+iO^(qX'j(qX~O#W+mO'|%OO~Og+pO!X$yO'|%OO~O!X+rO~Oy+tO!XXO~O!t+yO~Ob,OO~O's#jO!W(sP~Ob%lO~O%a!OO's%|O~PRO!V,yO!W(fa~O!W2SO~P'TO^%^O#W2]O'j%^O~O^%^O!a#rO#W2]O'j%^O~O^%^O!a#rO!h%ZO!l2aO#W2]O'j%^O'|%OO(`'dO~O!]2bO!^2bO't!iO~PBtO![2eO!]2bO!^2bO#S2fO#T2fO't!iO~PBtO![2eO!]2bO!^2bO#P2gO#S2fO#T2fO't!iO~PBtO^%^O!a#rO!l2aO#W2]O'j%^O(`'dO~O^%^O'j%^O~P!3jO!V$^Oo$ja~O!S&|i!V&|i~P!3jO!V'xO!S(Wi~O!V(PO!S(di~O!S(ei!V(ei~P!3jO!V(]O!g(ai~O!V(bi!g(bi^(bi'j(bi~P!3jO#W2kO!V(bi!g(bi^(bi'j(bi~O|%vO!X%wO!x]O#a2nO#b2mO's%eO~O|%vO!X%wO#b2mO's%eO~Og2uO!X'QO%`2tO~Og2uO!X'QO%`2tO'|%OO~O#cvaPvaXva^vakva!eva!fva!hva!lva#fva#gva#hva#iva#jva#kva#lva#mva#nva#pva#rva#tva#uva'jva(Qva(`va!gva!Sva'hvaova!Xva%`va!ava~P#M{O#c$kaP$kaX$ka^$kak$kaz$ka!e$ka!f$ka!h$ka!l$ka#f$ka#g$ka#h$ka#i$ka#j$ka#k$ka#l$ka#m$ka#n$ka#p$ka#r$ka#t$ka#u$ka'j$ka(Q$ka(`$ka!g$ka!S$ka'h$kao$ka!X$ka%`$ka!a$ka~P#NqO#c$maP$maX$ma^$mak$maz$ma!e$ma!f$ma!h$ma!l$ma#f$ma#g$ma#h$ma#i$ma#j$ma#k$ma#l$ma#m$ma#n$ma#p$ma#r$ma#t$ma#u$ma'j$ma(Q$ma(`$ma!g$ma!S$ma'h$mao$ma!X$ma%`$ma!a$ma~P$ dO#c${aP${aX${a^${ak${az${a!V${a!e${a!f${a!h${a!l${a#f${a#g${a#h${a#i${a#j${a#k${a#l${a#m${a#n${a#p${a#r${a#t${a#u${a'j${a(Q${a(`${a!g${a!S${a'h${a#W${ao${a!X${a%`${a!a${a~P#(yO^#Zq!V#Zq'j#Zq'h#Zq!S#Zq!g#Zqo#Zq!X#Zq%`#Zq!a#Zq~P!3jOd'OX!V'OX~P!$uO!V._Od(Za~O!U2}O!V'PX!g'PX~P%QO!V.bO!g([a~O!V.bO!g([a~P!3jO!S3QO~O#x!ja!W!ja~PI{O#x!ba!V!ba!W!ba~P#?dO#x!na!W!na~P!6TO#x!pa!W!pa~P!8nO!X3dO$TfO$^3eO~O!W3iO~Oo3jO~P#(yO^$gq!V$gq'j$gq'h$gq!S$gq!g$gqo$gq!X$gq%`$gq!a$gq~P!3jO!S3kO~Ol.}O'uTO'xUO~Oy)sO|)tO(h)xOg%Wi(g%Wi!V%Wi#W%Wi~Od%Wi#x%Wi~P$HbOy)sO|)tOg%Yi(g%Yi(h%Yi!V%Yi#W%Yi~Od%Yi#x%Yi~P$ITO(`$WO~P#(yO!U3nO's%eO!V'YX!g'YX~O!V/VO!g(ma~O!V/VO!a#rO!g(ma~O!V/VO!a#rO(`'dO!g(ma~Od$ti!V$ti#W$ti#x$ti~P!-jO!U3vO's*UO!S'[X!V'[X~P!.XO!V/_O!S(na~O!V/_O!S(na~P#(yO!a#rO~O!a#rO#n4OO~Ok4RO!a#rO(`'dO~Od(Oi!V(Oi~P!-jO#W4UOd(Oi!V(Oi~P!-jO!g4XO~O^$hq!V$hq'j$hq'h$hq!S$hq!g$hqo$hq!X$hq%`$hq!a$hq~P!3jO!V4]O!X(oX~P#(yO!f#tO~P3zO!X$rX%TYX^$rX!V$rX'j$rX~P!,aO%T4_OghXyhX|hX!XhX(ghX(hhX^hX!VhX'jhX~O%T4_O~O%a4fO's+WO'uTO'xUO!V'eX!W'eX~O!V0_O!W(ua~OX4jO~O]4kO~O!S4oO~O^%^O'j%^O~P#(yO!X$yO~P#(yO!V4tO#W4vO!W(rX~O!W4wO~Ol!kO|4yO![5WO!]4}O!^4}O!x;oO!|5VO!}5UO#O5UO#P5TO#S5SO#T!wO't!iO'uTO'xUO(T!jO(_!nO~O!W5RO~P%#XOg5]O!X0zO%`5[O~Og5]O!X0zO%`5[O'|%OO~O's#jO!V'dX!W'dX~O!V1VO!W(sa~O'uTO'xUO(T5fO~O]5jO~O!g5mO~P%QO^5oO~O^5oO~P%QO#n5qO&Q5rO~PMPO_1mO!W5vO&`1lO~P`O!a5xO~O!a5zO!V(Yi!W(Yi!a(Yi!h(Yi'|(Yi~O!V#`i!W#`i~P#?dO#W5{O!V#`i!W#`i~O!V!Zi!W!Zi~P#?dO^%^O#W6UO'j%^O~O^%^O!a#rO#W6UO'j%^O~O^%^O!a#rO!l6ZO#W6UO'j%^O(`'dO~O!h%ZO'|%OO~P%(fO!]6[O!^6[O't!iO~PBtO![6_O!]6[O!^6[O#S6`O#T6`O't!iO~PBtO!V(]O!g(aq~O!V(bq!g(bq^(bq'j(bq~P!3jO|%vO!X%wO#b6dO's%eO~O!X'QO%`6gO~Og6jO!X'QO%`6gO~O#c%WiP%WiX%Wi^%Wik%Wiz%Wi!e%Wi!f%Wi!h%Wi!l%Wi#f%Wi#g%Wi#h%Wi#i%Wi#j%Wi#k%Wi#l%Wi#m%Wi#n%Wi#p%Wi#r%Wi#t%Wi#u%Wi'j%Wi(Q%Wi(`%Wi!g%Wi!S%Wi'h%Wio%Wi!X%Wi%`%Wi!a%Wi~P$HbO#c%YiP%YiX%Yi^%Yik%Yiz%Yi!e%Yi!f%Yi!h%Yi!l%Yi#f%Yi#g%Yi#h%Yi#i%Yi#j%Yi#k%Yi#l%Yi#m%Yi#n%Yi#p%Yi#r%Yi#t%Yi#u%Yi'j%Yi(Q%Yi(`%Yi!g%Yi!S%Yi'h%Yio%Yi!X%Yi%`%Yi!a%Yi~P$ITO#c$tiP$tiX$ti^$tik$tiz$ti!V$ti!e$ti!f$ti!h$ti!l$ti#f$ti#g$ti#h$ti#i$ti#j$ti#k$ti#l$ti#m$ti#n$ti#p$ti#r$ti#t$ti#u$ti'j$ti(Q$ti(`$ti!g$ti!S$ti'h$ti#W$tio$ti!X$ti%`$ti!a$ti~P#(yOd'Oa!V'Oa~P!-jO!V'Pa!g'Pa~P!3jO!V.bO!g([i~O#x#Zi!V#Zi!W#Zi~P#?dOP$YOy#vOz#wO|#xO!f#tO!h#uO!l$YO(QVOX#eik#ei!e#ei#g#ei#h#ei#i#ei#j#ei#k#ei#l#ei#m#ei#n#ei#p#ei#r#ei#t#ei#u#ei#x#ei(`#ei(g#ei(h#ei!V#ei!W#ei~O#f#ei~P%2xO#f;wO~P%2xOP$YOy#vOz#wO|#xO!f#tO!h#uO!l$YO#f;wO#g;xO#h;xO#i;xO(QVOX#ei!e#ei#j#ei#k#ei#l#ei#m#ei#n#ei#p#ei#r#ei#t#ei#u#ei#x#ei(`#ei(g#ei(h#ei!V#ei!W#ei~Ok#ei~P%5TOk;yO~P%5TOP$YOk;yOy#vOz#wO|#xO!f#tO!h#uO!l$YO#f;wO#g;xO#h;xO#i;xO#j;zO(QVO#p#ei#r#ei#t#ei#u#ei#x#ei(`#ei(g#ei(h#ei!V#ei!W#ei~OX#ei!e#ei#k#ei#l#ei#m#ei#n#ei~P%7`OXbO^#vy!V#vy'j#vy'h#vy!S#vy!g#vyo#vy!X#vy%`#vy!a#vy~P!3jOg=jOy)sO|)tO(g)vO(h)xO~OP#eiX#eik#eiz#ei!e#ei!f#ei!h#ei!l#ei#f#ei#g#ei#h#ei#i#ei#j#ei#k#ei#l#ei#m#ei#n#ei#p#ei#r#ei#t#ei#u#ei#x#ei(Q#ei(`#ei!V#ei!W#ei~P%AYO!f#tOP(PXX(PXg(PXk(PXy(PXz(PX|(PX!e(PX!h(PX!l(PX#f(PX#g(PX#h(PX#i(PX#j(PX#k(PX#l(PX#m(PX#n(PX#p(PX#r(PX#t(PX#u(PX#x(PX(Q(PX(`(PX(g(PX(h(PX!V(PX!W(PX~O#x#yi!V#yi!W#yi~P#?dO#x!ni!W!ni~P$!qO!W6vO~O!V'Xa!W'Xa~P#?dO!a#rO(`'dO!V'Ya!g'Ya~O!V/VO!g(mi~O!V/VO!a#rO!g(mi~Od$tq!V$tq#W$tq#x$tq~P!-jO!S'[a!V'[a~P#(yO!a6}O~O!V/_O!S(ni~P#(yO!V/_O!S(ni~O!S7RO~O!a#rO#n7WO~Ok7XO!a#rO(`'dO~O!S7ZO~Od$vq!V$vq#W$vq#x$vq~P!-jO^$hy!V$hy'j$hy'h$hy!S$hy!g$hyo$hy!X$hy%`$hy!a$hy~P!3jO!V4]O!X(oa~O^#Zy!V#Zy'j#Zy'h#Zy!S#Zy!g#Zyo#Zy!X#Zy%`#Zy!a#Zy~P!3jOX7`O~O!V0_O!W(ui~O]7fO~O!a5zO~O(T(qO!V'aX!W'aX~O!V4tO!W(ra~O!h%ZO'|%OO^(YX!a(YX!l(YX#W(YX'j(YX(`(YX~O's7oO~P.[O!x;oO!|7rO!}7qO#O7qO#P7pO#S'bO#T'bO~PBtO^%^O!a#rO!l'hO#W'fO'j%^O(`'dO~O!W7vO~P%#XOl!kO'uTO'xUO(T!jO(_!nO~O|7wO~P%MdO![7{O!]7zO!^7zO#P7pO#S'bO#T'bO't!iO~PBtO![7{O!]7zO!^7zO!}7|O#O7|O#P7pO#S'bO#T'bO't!iO~PBtO!]7zO!^7zO't!iO(T!jO(_!nO~O!X0zO~O!X0zO%`8OO~Og8RO!X0zO%`8OO~OX8WO!V'da!W'da~O!V1VO!W(si~O!g8[O~O!g8]O~O!g8^O~O!g8^O~P%QO^8`O~O!a8cO~O!g8dO~O!V(ei!W(ei~P#?dO^%^O#W8lO'j%^O~O^%^O!a#rO#W8lO'j%^O~O^%^O!a#rO!l8pO#W8lO'j%^O(`'dO~O!h%ZO'|%OO~P&$QO!]8qO!^8qO't!iO~PBtO!V(]O!g(ay~O!V(by!g(by^(by'j(by~P!3jO!X'QO%`8uO~O#c$tqP$tqX$tq^$tqk$tqz$tq!V$tq!e$tq!f$tq!h$tq!l$tq#f$tq#g$tq#h$tq#i$tq#j$tq#k$tq#l$tq#m$tq#n$tq#p$tq#r$tq#t$tq#u$tq'j$tq(Q$tq(`$tq!g$tq!S$tq'h$tq#W$tqo$tq!X$tq%`$tq!a$tq~P#(yO#c$vqP$vqX$vq^$vqk$vqz$vq!V$vq!e$vq!f$vq!h$vq!l$vq#f$vq#g$vq#h$vq#i$vq#j$vq#k$vq#l$vq#m$vq#n$vq#p$vq#r$vq#t$vq#u$vq'j$vq(Q$vq(`$vq!g$vq!S$vq'h$vq#W$vqo$vq!X$vq%`$vq!a$vq~P#(yO!V'Pi!g'Pi~P!3jO#x#Zq!V#Zq!W#Zq~P#?dOy/yOz/yO|/zOPvaXvagvakva!eva!fva!hva!lva#fva#gva#hva#iva#jva#kva#lva#mva#nva#pva#rva#tva#uva#xva(Qva(`va(gva(hva!Vva!Wva~Oy)sO|)tOP$kaX$kag$kak$kaz$ka!e$ka!f$ka!h$ka!l$ka#f$ka#g$ka#h$ka#i$ka#j$ka#k$ka#l$ka#m$ka#n$ka#p$ka#r$ka#t$ka#u$ka#x$ka(Q$ka(`$ka(g$ka(h$ka!V$ka!W$ka~Oy)sO|)tOP$maX$mag$mak$maz$ma!e$ma!f$ma!h$ma!l$ma#f$ma#g$ma#h$ma#i$ma#j$ma#k$ma#l$ma#m$ma#n$ma#p$ma#r$ma#t$ma#u$ma#x$ma(Q$ma(`$ma(g$ma(h$ma!V$ma!W$ma~OP${aX${ak${az${a!e${a!f${a!h${a!l${a#f${a#g${a#h${a#i${a#j${a#k${a#l${a#m${a#n${a#p${a#r${a#t${a#u${a#x${a(Q${a(`${a!V${a!W${a~P%AYO#x$gq!V$gq!W$gq~P#?dO#x$hq!V$hq!W$hq~P#?dO!W9PO~O#x9QO~P!-jO!a#rO!V'Yi!g'Yi~O!a#rO(`'dO!V'Yi!g'Yi~O!V/VO!g(mq~O!S'[i!V'[i~P#(yO!V/_O!S(nq~O!S9WO~P#(yO!S9WO~Od(Oy!V(Oy~P!-jO!V'_a!X'_a~P#(yO!X%Sq^%Sq!V%Sq'j%Sq~P#(yOX9]O~O!V0_O!W(uq~O#W9aO!V'aa!W'aa~O!V4tO!W(ri~P#?dOPYXXYXkYXyYXzYX|YX!SYX!VYX!eYX!fYX!hYX!lYX#WYX#ccX#fYX#gYX#hYX#iYX#jYX#kYX#lYX#mYX#nYX#pYX#rYX#tYX#uYX#zYX(QYX(`YX(gYX(hYX~O!a%QX#n%QX~P&6lO#S-cO#T-cO~PBtO#P9eO#S-cO#T-cO~PBtO!}9fO#O9fO#P9eO#S-cO#T-cO~PBtO!]9iO!^9iO't!iO(T!jO(_!nO~O![9lO!]9iO!^9iO#P9eO#S-cO#T-cO't!iO~PBtO!X0zO%`9oO~O'uTO'xUO(T9tO~O!V1VO!W(sq~O!g9wO~O!g9wO~P%QO!g9yO~O!g9zO~O#W9|O!V#`y!W#`y~O!V#`y!W#`y~P#?dO^%^O#W:QO'j%^O~O^%^O!a#rO#W:QO'j%^O~O^%^O!a#rO!l:UO#W:QO'j%^O(`'dO~O!X'QO%`:XO~O#x#vy!V#vy!W#vy~P#?dOP$tiX$tik$tiz$ti!e$ti!f$ti!h$ti!l$ti#f$ti#g$ti#h$ti#i$ti#j$ti#k$ti#l$ti#m$ti#n$ti#p$ti#r$ti#t$ti#u$ti#x$ti(Q$ti(`$ti!V$ti!W$ti~P%AYOy)sO|)tO(h)xOP%WiX%Wig%Wik%Wiz%Wi!e%Wi!f%Wi!h%Wi!l%Wi#f%Wi#g%Wi#h%Wi#i%Wi#j%Wi#k%Wi#l%Wi#m%Wi#n%Wi#p%Wi#r%Wi#t%Wi#u%Wi#x%Wi(Q%Wi(`%Wi(g%Wi!V%Wi!W%Wi~Oy)sO|)tOP%YiX%Yig%Yik%Yiz%Yi!e%Yi!f%Yi!h%Yi!l%Yi#f%Yi#g%Yi#h%Yi#i%Yi#j%Yi#k%Yi#l%Yi#m%Yi#n%Yi#p%Yi#r%Yi#t%Yi#u%Yi#x%Yi(Q%Yi(`%Yi(g%Yi(h%Yi!V%Yi!W%Yi~O#x$hy!V$hy!W$hy~P#?dO#x#Zy!V#Zy!W#Zy~P#?dO!a#rO!V'Yq!g'Yq~O!V/VO!g(my~O!S'[q!V'[q~P#(yO!S:`O~P#(yO!V0_O!W(uy~O!V4tO!W(rq~O#S2fO#T2fO~PBtO#P:gO#S2fO#T2fO~PBtO!]:kO!^:kO't!iO(T!jO(_!nO~O!X0zO%`:nO~O!g:qO~O^%^O#W:vO'j%^O~O^%^O!a#rO#W:vO'j%^O~O!X'QO%`:{O~OP$tqX$tqk$tqz$tq!e$tq!f$tq!h$tq!l$tq#f$tq#g$tq#h$tq#i$tq#j$tq#k$tq#l$tq#m$tq#n$tq#p$tq#r$tq#t$tq#u$tq#x$tq(Q$tq(`$tq!V$tq!W$tq~P%AYOP$vqX$vqk$vqz$vq!e$vq!f$vq!h$vq!l$vq#f$vq#g$vq#h$vq#i$vq#j$vq#k$vq#l$vq#m$vq#n$vq#p$vq#r$vq#t$vq#u$vq#x$vq(Q$vq(`$vq!V$vq!W$vq~P%AYOd%[!Z!V%[!Z#W%[!Z#x%[!Z~P!-jO!V'aq!W'aq~P#?dO#S6`O#T6`O~PBtO!V#`!Z!W#`!Z~P#?dO^%^O#W;ZO'j%^O~O#c%[!ZP%[!ZX%[!Z^%[!Zk%[!Zz%[!Z!V%[!Z!e%[!Z!f%[!Z!h%[!Z!l%[!Z#f%[!Z#g%[!Z#h%[!Z#i%[!Z#j%[!Z#k%[!Z#l%[!Z#m%[!Z#n%[!Z#p%[!Z#r%[!Z#t%[!Z#u%[!Z'j%[!Z(Q%[!Z(`%[!Z!g%[!Z!S%[!Z'h%[!Z#W%[!Zo%[!Z!X%[!Z%`%[!Z!a%[!Z~P#(yOP%[!ZX%[!Zk%[!Zz%[!Z!e%[!Z!f%[!Z!h%[!Z!l%[!Z#f%[!Z#g%[!Z#h%[!Z#i%[!Z#j%[!Z#k%[!Z#l%[!Z#m%[!Z#n%[!Z#p%[!Z#r%[!Z#t%[!Z#u%[!Z#x%[!Z(Q%[!Z(`%[!Z!V%[!Z!W%[!Z~P%AYOo(UX~P1dO't!iO~P!'RO!ScX!VcX#WcX~P&6lOPYXXYXkYXyYXzYX|YX!VYX!VcX!eYX!fYX!hYX!lYX#WYX#WcX#ccX#fYX#gYX#hYX#iYX#jYX#kYX#lYX#mYX#nYX#pYX#rYX#tYX#uYX#zYX(QYX(`YX(gYX(hYX~O!acX!gYX!gcX(`cX~P'!sOP;nOQ;nOa=_Ob!fOikOk;nOlkOmkOskOu;nOw;nO|WO!QkO!RkO!XXO!c;qO!hZO!k;nO!l;nO!m;nO!o;rO!q;sO!t!eO$P!hO$TfO's)RO'uTO'xUO(QVO(_[O(l=]O~O!Vv!>v!BnPPP!BuHdPPPPPPPPPPP!FTP!GiPPHd!HyPHdPHdHdHdHdPHd!J`PP!MiP#!nP#!r#!|##Q##QP!MfP##U##UP#&ZP#&_HdHd#&e#)iAQPAQPAQAQP#*sAQAQ#,mAQ#.zAQ#0nAQAQ#1[#3W#3W#3[#3d#3W#3lP#3WPAQ#4hAQ#5pAQAQ6iPPP#6{PP#7e#7eP#7eP#7z#7ePP#8QP#7wP#7w#8d!1p#7w#9O#9U6f(}#9X(}P#9`#9`#9`P(}P(}P(}P(}PP(}P#9f#9iP#9i(}P#9mP#9pP(}P(}P(}P(}P(}P(}(}PP#9v#9|#:W#:^#:d#:j#:p#;O#;U#;[#;f#;l#b#?r#@Q#@W#@^#@d#@j#@t#@z#AQ#A[#An#AtPPPPPPPPPP#AzPPPPPPP#Bn#FYP#Gu#G|#HUPPPP#L`$ U$'t$'w$'z$)w$)z$)}$*UPP$*[$*`$+X$,X$,]$,qPP$,u$,{$-PP$-S$-W$-Z$.P$.g$.l$.o$.r$.x$.{$/P$/TR!yRmpOXr!X#a%]&d&f&g&i,^,c1g1jU!pQ'Q-OQ%ctQ%kwQ%rzQ&[!TS&x!c,vQ'W!f[']!m!r!s!t!u!vS*[$y*aQ+U%lQ+c%tQ+}&UQ,|'PQ-W'XW-`'^'_'`'aQ/p*cQ1U,OU2b-b-d-eS4}0z5QS6[2e2gU7z5U5V5WQ8q6_S9i7{7|Q:k9lR TypeParamList TypeDefinition extends ThisType this LiteralType ArithOp Number BooleanLiteral TemplateType InterpolationEnd Interpolation InterpolationStart NullType null VoidType void TypeofType typeof MemberExpression . ?. PropertyName [ TemplateString Escape Interpolation super RegExp ] ArrayExpression Spread , } { ObjectExpression Property async get set PropertyDefinition Block : NewExpression new TypeArgList CompareOp < ) ( ArgList UnaryExpression delete LogicOp BitOp YieldExpression yield AwaitExpression await ParenthesizedExpression ClassExpression class ClassBody MethodDeclaration Decorator @ MemberExpression PrivatePropertyName CallExpression Privacy static abstract override PrivatePropertyDefinition PropertyDeclaration readonly accessor Optional TypeAnnotation Equals StaticBlock FunctionExpression ArrowFunction ParamList ParamList ArrayPattern ObjectPattern PatternProperty Privacy readonly Arrow MemberExpression BinaryExpression ArithOp ArithOp ArithOp ArithOp BitOp CompareOp instanceof satisfies in const CompareOp BitOp BitOp BitOp LogicOp LogicOp ConditionalExpression LogicOp LogicOp AssignmentExpression UpdateOp PostfixExpression CallExpression TaggedTemplateExpression DynamicImport import ImportMeta JSXElement JSXSelfCloseEndTag JSXStartTag JSXSelfClosingTag JSXIdentifier JSXBuiltin JSXIdentifier JSXNamespacedName JSXMemberExpression JSXSpreadAttribute JSXAttribute JSXAttributeValue JSXEscape JSXEndTag JSXOpenTag JSXFragmentTag JSXText JSXEscape JSXStartCloseTag JSXCloseTag PrefixCast ArrowFunction TypeParamList SequenceExpression KeyofType keyof UniqueType unique ImportType InferredType infer TypeName ParenthesizedType FunctionSignature ParamList NewSignature IndexedType TupleType Label ArrayType ReadonlyType ObjectType MethodType PropertyType IndexSignature PropertyDefinition CallSignature TypePredicate is NewSignature new UnionType LogicOp IntersectionType LogicOp ConditionalType ParameterizedType ClassDeclaration abstract implements type VariableDeclaration let var TypeAliasDeclaration InterfaceDeclaration interface EnumDeclaration enum EnumBody NamespaceDeclaration namespace module AmbientDeclaration declare GlobalDeclaration global ClassDeclaration ClassBody MethodDeclaration AmbientFunctionDeclaration ExportGroup VariableName VariableName ImportDeclaration ImportGroup ForStatement for ForSpec ForInSpec ForOfSpec of WhileStatement while WithStatement with DoStatement do IfStatement if else SwitchStatement switch SwitchBody CaseLabel case DefaultLabel TryStatement try CatchClause catch FinallyClause finally ReturnStatement return ThrowStatement throw BreakStatement break ContinueStatement continue DebuggerStatement debugger LabeledStatement ExpressionStatement SingleExpression SingleClassItem\",\n maxTerm: 362,\n context: trackNewline,\n nodeProps: [\n [\"group\", -26,6,14,16,62,198,202,205,206,208,211,214,225,227,233,235,237,239,242,248,254,256,258,260,262,264,265,\"Statement\",-32,10,11,25,28,29,35,45,48,49,51,56,64,72,76,78,80,81,102,103,112,113,130,133,135,136,137,138,140,141,161,162,164,\"Expression\",-23,24,26,30,34,36,38,165,167,169,170,172,173,174,176,177,178,180,181,182,192,194,196,197,\"Type\",-3,84,95,101,\"ClassItem\"],\n [\"openedBy\", 31,\"InterpolationStart\",50,\"[\",54,\"{\",69,\"(\",142,\"JSXStartTag\",154,\"JSXStartTag JSXStartCloseTag\"],\n [\"closedBy\", 33,\"InterpolationEnd\",44,\"]\",55,\"}\",70,\")\",143,\"JSXSelfCloseEndTag JSXEndTag\",159,\"JSXEndTag\"]\n ],\n propSources: [jsHighlight],\n skippedNodes: [0,3,4,268],\n repeatNodeCount: 32,\n tokenData: \"$>y(CSR!bOX%ZXY+gYZ-yZ[+g[]%Z]^.c^p%Zpq+gqr/mrs3cst:_tu>PuvBavwDxwxGgxyMvyz! Qz{!![{|!%O|}!&]}!O!%O!O!P!'g!P!Q!1w!Q!R#0t!R![#3T![!]#@T!]!^#Aa!^!_#Bk!_!`#GS!`!a#In!a!b#N{!b!c$$z!c!}>P!}#O$&U#O#P$'`#P#Q$,w#Q#R$.R#R#S>P#S#T$/`#T#o$0j#o#p$4z#p#q$5p#q#r$7Q#r#s$8^#s$f%Z$f$g+g$g#BY>P#BY#BZ$9h#BZ$IS>P$IS$I_$9h$I_$I|>P$I|$I}$P$JT$JU$9h$JU$KV>P$KV$KW$9h$KW&FU>P&FU&FV$9h&FV;'S>P;'S;=`BZ<%l?HT>P?HT?HU$9h?HUO>P(n%d_$c&j'vp'y!bOY%ZYZ&cZr%Zrs&}sw%Zwx(rx!^%Z!^!_*g!_#O%Z#O#P&c#P#o%Z#o#p*g#p;'S%Z;'S;=`+a<%lO%Z&j&hT$c&jO!^&c!_#o&c#p;'S&c;'S;=`&w<%lO&c&j&zP;=`<%l&c'|'U]$c&j'y!bOY&}YZ&cZw&}wx&cx!^&}!^!_'}!_#O&}#O#P&c#P#o&}#o#p'}#p;'S&};'S;=`(l<%lO&}!b(SU'y!bOY'}Zw'}x#O'}#P;'S'};'S;=`(f<%lO'}!b(iP;=`<%l'}'|(oP;=`<%l&}'[(y]$c&j'vpOY(rYZ&cZr(rrs&cs!^(r!^!_)r!_#O(r#O#P&c#P#o(r#o#p)r#p;'S(r;'S;=`*a<%lO(rp)wU'vpOY)rZr)rs#O)r#P;'S)r;'S;=`*Z<%lO)rp*^P;=`<%l)r'[*dP;=`<%l(r#S*nX'vp'y!bOY*gZr*grs'}sw*gwx)rx#O*g#P;'S*g;'S;=`+Z<%lO*g#S+^P;=`<%l*g(n+dP;=`<%l%Z(CS+rq$c&j'vp'y!b'l(;dOX%ZXY+gYZ&cZ[+g[p%Zpq+gqr%Zrs&}sw%Zwx(rx!^%Z!^!_*g!_#O%Z#O#P&c#P#o%Z#o#p*g#p$f%Z$f$g+g$g#BY%Z#BY#BZ+g#BZ$IS%Z$IS$I_+g$I_$JT%Z$JT$JU+g$JU$KV%Z$KV$KW+g$KW&FU%Z&FU&FV+g&FV;'S%Z;'S;=`+a<%l?HT%Z?HT?HU+g?HUO%Z(CS.ST'w#S$c&j'm(;dO!^&c!_#o&c#p;'S&c;'S;=`&w<%lO&c(CS.n_$c&j'vp'y!b'm(;dOY%ZYZ&cZr%Zrs&}sw%Zwx(rx!^%Z!^!_*g!_#O%Z#O#P&c#P#o%Z#o#p*g#p;'S%Z;'S;=`+a<%lO%Z%#`/x`$c&j!l$Ip'vp'y!bOY%ZYZ&cZr%Zrs&}sw%Zwx(rx!^%Z!^!_*g!_!`0z!`#O%Z#O#P&c#P#o%Z#o#p*g#p;'S%Z;'S;=`+a<%lO%Z%#S1V`#p$Id$c&j'vp'y!bOY%ZYZ&cZr%Zrs&}sw%Zwx(rx!^%Z!^!_*g!_!`2X!`#O%Z#O#P&c#P#o%Z#o#p*g#p;'S%Z;'S;=`+a<%lO%Z%#S2d_#p$Id$c&j'vp'y!bOY%ZYZ&cZr%Zrs&}sw%Zwx(rx!^%Z!^!_*g!_#O%Z#O#P&c#P#o%Z#o#p*g#p;'S%Z;'S;=`+a<%lO%Z$2b3l_'u$(n$c&j'y!bOY4kYZ5qZr4krs7nsw4kwx5qx!^4k!^!_8p!_#O4k#O#P5q#P#o4k#o#p8p#p;'S4k;'S;=`:X<%lO4k*r4r_$c&j'y!bOY4kYZ5qZr4krs7nsw4kwx5qx!^4k!^!_8p!_#O4k#O#P5q#P#o4k#o#p8p#p;'S4k;'S;=`:X<%lO4k)`5vX$c&jOr5qrs6cs!^5q!^!_6y!_#o5q#o#p6y#p;'S5q;'S;=`7h<%lO5q)`6jT$^#t$c&jO!^&c!_#o&c#p;'S&c;'S;=`&w<%lO&c#t6|TOr6yrs7]s;'S6y;'S;=`7b<%lO6y#t7bO$^#t#t7eP;=`<%l6y)`7kP;=`<%l5q*r7w]$^#t$c&j'y!bOY&}YZ&cZw&}wx&cx!^&}!^!_'}!_#O&}#O#P&c#P#o&}#o#p'}#p;'S&};'S;=`(l<%lO&}%W8uZ'y!bOY8pYZ6yZr8prs9hsw8pwx6yx#O8p#O#P6y#P;'S8p;'S;=`:R<%lO8p%W9oU$^#t'y!bOY'}Zw'}x#O'}#P;'S'};'S;=`(f<%lO'}%W:UP;=`<%l8p*r:[P;=`<%l4k#%|:hg$c&j'vp'y!bOY%ZYZ&cZr%Zrs&}st%Ztu`k$c&j'vp'y!b(T!LY's&;d$V#tOY%ZYZ&cZr%Zrs&}st%Ztu>Puw%Zwx(rx}%Z}!O@T!O!Q%Z!Q![>P![!^%Z!^!_*g!_!c%Z!c!}>P!}#O%Z#O#P&c#P#R%Z#R#S>P#S#T%Z#T#o>P#o#p*g#p$g%Z$g;'S>P;'S;=`BZ<%lO>P+d@`k$c&j'vp'y!b$V#tOY%ZYZ&cZr%Zrs&}st%Ztu@Tuw%Zwx(rx}%Z}!O@T!O!Q%Z!Q![@T![!^%Z!^!_*g!_!c%Z!c!}@T!}#O%Z#O#P&c#P#R%Z#R#S@T#S#T%Z#T#o@T#o#p*g#p$g%Z$g;'S@T;'S;=`BT<%lO@T+dBWP;=`<%l@T(CSB^P;=`<%l>P%#SBl`$c&j'vp'y!b#h$IdOY%ZYZ&cZr%Zrs&}sw%Zwx(rx!^%Z!^!_*g!_!`Cn!`#O%Z#O#P&c#P#o%Z#o#p*g#p;'S%Z;'S;=`+a<%lO%Z%#SCy_$c&j#z$Id'vp'y!bOY%ZYZ&cZr%Zrs&}sw%Zwx(rx!^%Z!^!_*g!_#O%Z#O#P&c#P#o%Z#o#p*g#p;'S%Z;'S;=`+a<%lO%Z%DfETa(h%Z![!^%Z!^!_*g!_!c%Z!c!i#>Z!i#O%Z#O#P&c#P#R%Z#R#S#>Z#S#T%Z#T#Z#>Z#Z#o%Z#o#p*g#p;'S%Z;'S;=`+a<%lO%Z$/l#>fi$c&j'vp'y!bl$'|OY%ZYZ&cZr%Zrs&}sw%Zwx(rx!Q%Z!Q![#>Z![!^%Z!^!_*g!_!c%Z!c!i#>Z!i#O%Z#O#P&c#P#R%Z#R#S#>Z#S#T%Z#T#Z#>Z#Z#b%Z#b#c#5T#c#o%Z#o#p*g#p;'S%Z;'S;=`+a<%lO%Z%Gh#@b_!a$b$c&j#x%Puw%Zwx(rx}%Z}!O@T!O!Q%Z!Q![>P![!^%Z!^!_*g!_!c%Z!c!}>P!}#O%Z#O#P&c#P#R%Z#R#S>P#S#T%Z#T#o>P#o#p*g#p$f%Z$f$g+g$g#BY>P#BY#BZ$9h#BZ$IS>P$IS$I_$9h$I_$JT>P$JT$JU$9h$JU$KV>P$KV$KW$9h$KW&FU>P&FU&FV$9h&FV;'S>P;'S;=`BZ<%l?HT>P?HT?HU$9h?HUO>P(CS$=Uk$c&j'vp'y!b'm(;d(T!LY's&;d$V#tOY%ZYZ&cZr%Zrs&}st%Ztu>Puw%Zwx(rx}%Z}!O@T!O!Q%Z!Q![>P![!^%Z!^!_*g!_!c%Z!c!}>P!}#O%Z#O#P&c#P#R%Z#R#S>P#S#T%Z#T#o>P#o#p*g#p$g%Z$g;'S>P;'S;=`BZ<%lO>P\",\n tokenizers: [noSemicolon, incdecToken, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, insertSemicolon, new LocalTokenGroup(\"$S~RRtu[#O#Pg#S#T#|~_P#o#pb~gOq~~jVO#i!P#i#j!U#j#l!P#l#m!q#m;'S!P;'S;=`#v<%lO!P~!UO!O~~!XS!Q![!e!c!i!e#T#Z!e#o#p#Z~!hR!Q![!q!c!i!q#T#Z!q~!tR!Q![!}!c!i!}#T#Z!}~#QR!Q![!P!c!i!P#T#Z!P~#^R!Q![#g!c!i#g#T#Z#g~#jS!Q![#g!c!i#g#T#Z#g#q#r!P~#yP;=`<%l!P~$RO(S~~\", 141, 325), new LocalTokenGroup(\"j~RQYZXz{^~^O'p~~aP!P!Qd~iO'q~~\", 25, 307)],\n topRules: {\"Script\":[0,5],\"SingleExpression\":[1,266],\"SingleClassItem\":[2,267]},\n dialects: {jsx: 13213, ts: 13215},\n dynamicPrecedences: {\"76\":1,\"78\":1,\"162\":1,\"190\":1},\n specialized: [{term: 311, get: value => spec_identifier[value] || -1},{term: 327, get: value => spec_word[value] || -1},{term: 67, get: value => spec_LessThan[value] || -1}],\n tokenPrec: 13238\n});\n\nexport { parser };\n","import { parser } from '@lezer/javascript';\nimport { syntaxTree, LRLanguage, indentNodeProp, continuedIndent, flatIndent, delimitedIndent, foldNodeProp, foldInside, defineLanguageFacet, sublanguageProp, LanguageSupport } from '@codemirror/language';\nimport { EditorSelection } from '@codemirror/state';\nimport { EditorView } from '@codemirror/view';\nimport { snippetCompletion, ifNotIn, completeFromList } from '@codemirror/autocomplete';\nimport { NodeWeakMap, IterMode } from '@lezer/common';\n\n/**\nA collection of JavaScript-related\n[snippets](https://codemirror.net/6/docs/ref/#autocomplete.snippet).\n*/\nconst snippets = [\n /*@__PURE__*/snippetCompletion(\"function ${name}(${params}) {\\n\\t${}\\n}\", {\n label: \"function\",\n detail: \"definition\",\n type: \"keyword\"\n }),\n /*@__PURE__*/snippetCompletion(\"for (let ${index} = 0; ${index} < ${bound}; ${index}++) {\\n\\t${}\\n}\", {\n label: \"for\",\n detail: \"loop\",\n type: \"keyword\"\n }),\n /*@__PURE__*/snippetCompletion(\"for (let ${name} of ${collection}) {\\n\\t${}\\n}\", {\n label: \"for\",\n detail: \"of loop\",\n type: \"keyword\"\n }),\n /*@__PURE__*/snippetCompletion(\"do {\\n\\t${}\\n} while (${})\", {\n label: \"do\",\n detail: \"loop\",\n type: \"keyword\"\n }),\n /*@__PURE__*/snippetCompletion(\"while (${}) {\\n\\t${}\\n}\", {\n label: \"while\",\n detail: \"loop\",\n type: \"keyword\"\n }),\n /*@__PURE__*/snippetCompletion(\"try {\\n\\t${}\\n} catch (${error}) {\\n\\t${}\\n}\", {\n label: \"try\",\n detail: \"/ catch block\",\n type: \"keyword\"\n }),\n /*@__PURE__*/snippetCompletion(\"if (${}) {\\n\\t${}\\n}\", {\n label: \"if\",\n detail: \"block\",\n type: \"keyword\"\n }),\n /*@__PURE__*/snippetCompletion(\"if (${}) {\\n\\t${}\\n} else {\\n\\t${}\\n}\", {\n label: \"if\",\n detail: \"/ else block\",\n type: \"keyword\"\n }),\n /*@__PURE__*/snippetCompletion(\"class ${name} {\\n\\tconstructor(${params}) {\\n\\t\\t${}\\n\\t}\\n}\", {\n label: \"class\",\n detail: \"definition\",\n type: \"keyword\"\n }),\n /*@__PURE__*/snippetCompletion(\"import {${names}} from \\\"${module}\\\"\\n${}\", {\n label: \"import\",\n detail: \"named\",\n type: \"keyword\"\n }),\n /*@__PURE__*/snippetCompletion(\"import ${name} from \\\"${module}\\\"\\n${}\", {\n label: \"import\",\n detail: \"default\",\n type: \"keyword\"\n })\n];\n\nconst cache = /*@__PURE__*/new NodeWeakMap();\nconst ScopeNodes = /*@__PURE__*/new Set([\n \"Script\", \"Block\",\n \"FunctionExpression\", \"FunctionDeclaration\", \"ArrowFunction\", \"MethodDeclaration\",\n \"ForStatement\"\n]);\nfunction defID(type) {\n return (node, def) => {\n let id = node.node.getChild(\"VariableDefinition\");\n if (id)\n def(id, type);\n return true;\n };\n}\nconst functionContext = [\"FunctionDeclaration\"];\nconst gatherCompletions = {\n FunctionDeclaration: /*@__PURE__*/defID(\"function\"),\n ClassDeclaration: /*@__PURE__*/defID(\"class\"),\n ClassExpression: () => true,\n EnumDeclaration: /*@__PURE__*/defID(\"constant\"),\n TypeAliasDeclaration: /*@__PURE__*/defID(\"type\"),\n NamespaceDeclaration: /*@__PURE__*/defID(\"namespace\"),\n VariableDefinition(node, def) { if (!node.matchContext(functionContext))\n def(node, \"variable\"); },\n TypeDefinition(node, def) { def(node, \"type\"); },\n __proto__: null\n};\nfunction getScope(doc, node) {\n let cached = cache.get(node);\n if (cached)\n return cached;\n let completions = [], top = true;\n function def(node, type) {\n let name = doc.sliceString(node.from, node.to);\n completions.push({ label: name, type });\n }\n node.cursor(IterMode.IncludeAnonymous).iterate(node => {\n if (top) {\n top = false;\n }\n else if (node.name) {\n let gather = gatherCompletions[node.name];\n if (gather && gather(node, def) || ScopeNodes.has(node.name))\n return false;\n }\n else if (node.to - node.from > 8192) {\n // Allow caching for bigger internal nodes\n for (let c of getScope(doc, node.node))\n completions.push(c);\n return false;\n }\n });\n cache.set(node, completions);\n return completions;\n}\nconst Identifier = /^[\\w$\\xa1-\\uffff][\\w$\\d\\xa1-\\uffff]*$/;\nconst dontComplete = [\n \"TemplateString\", \"String\", \"RegExp\",\n \"LineComment\", \"BlockComment\",\n \"VariableDefinition\", \"TypeDefinition\", \"Label\",\n \"PropertyDefinition\", \"PropertyName\",\n \"PrivatePropertyDefinition\", \"PrivatePropertyName\"\n];\n/**\nCompletion source that looks up locally defined names in\nJavaScript code.\n*/\nfunction localCompletionSource(context) {\n let inner = syntaxTree(context.state).resolveInner(context.pos, -1);\n if (dontComplete.indexOf(inner.name) > -1)\n return null;\n let isWord = inner.name == \"VariableName\" ||\n inner.to - inner.from < 20 && Identifier.test(context.state.sliceDoc(inner.from, inner.to));\n if (!isWord && !context.explicit)\n return null;\n let options = [];\n for (let pos = inner; pos; pos = pos.parent) {\n if (ScopeNodes.has(pos.name))\n options = options.concat(getScope(context.state.doc, pos));\n }\n return {\n options,\n from: isWord ? inner.from : context.pos,\n validFor: Identifier\n };\n}\nfunction pathFor(read, member, name) {\n var _a;\n let path = [];\n for (;;) {\n let obj = member.firstChild, prop;\n if ((obj === null || obj === void 0 ? void 0 : obj.name) == \"VariableName\") {\n path.push(read(obj));\n return { path: path.reverse(), name };\n }\n else if ((obj === null || obj === void 0 ? void 0 : obj.name) == \"MemberExpression\" && ((_a = (prop = obj.lastChild)) === null || _a === void 0 ? void 0 : _a.name) == \"PropertyName\") {\n path.push(read(prop));\n member = obj;\n }\n else {\n return null;\n }\n }\n}\n/**\nHelper function for defining JavaScript completion sources. It\nreturns the completable name and object path for a completion\ncontext, or null if no name/property completion should happen at\nthat position. For example, when completing after `a.b.c` it will\nreturn `{path: [\"a\", \"b\"], name: \"c\"}`. When completing after `x`\nit will return `{path: [], name: \"x\"}`. When not in a property or\nname, it will return null if `context.explicit` is false, and\n`{path: [], name: \"\"}` otherwise.\n*/\nfunction completionPath(context) {\n let read = (node) => context.state.doc.sliceString(node.from, node.to);\n let inner = syntaxTree(context.state).resolveInner(context.pos, -1);\n if (inner.name == \"PropertyName\") {\n return pathFor(read, inner.parent, read(inner));\n }\n else if (dontComplete.indexOf(inner.name) > -1) {\n return null;\n }\n else if (inner.name == \"VariableName\" || inner.to - inner.from < 20 && Identifier.test(read(inner))) {\n return { path: [], name: read(inner) };\n }\n else if ((inner.name == \".\" || inner.name == \"?.\") && inner.parent.name == \"MemberExpression\") {\n return pathFor(read, inner.parent, \"\");\n }\n else if (inner.name == \"MemberExpression\") {\n return pathFor(read, inner, \"\");\n }\n else {\n return context.explicit ? { path: [], name: \"\" } : null;\n }\n}\nfunction enumeratePropertyCompletions(obj, top) {\n let options = [], seen = new Set;\n for (let depth = 0;; depth++) {\n for (let name of (Object.getOwnPropertyNames || Object.keys)(obj)) {\n if (seen.has(name))\n continue;\n seen.add(name);\n let value;\n try {\n value = obj[name];\n }\n catch (_) {\n continue;\n }\n options.push({\n label: name,\n type: typeof value == \"function\" ? (/^[A-Z]/.test(name) ? \"class\" : top ? \"function\" : \"method\")\n : top ? \"variable\" : \"property\",\n boost: -depth\n });\n }\n let next = Object.getPrototypeOf(obj);\n if (!next)\n return options;\n obj = next;\n }\n}\n/**\nDefines a [completion source](https://codemirror.net/6/docs/ref/#autocomplete.CompletionSource) that\ncompletes from the given scope object (for example `globalThis`).\nWill enter properties of the object when completing properties on\na directly-named path.\n*/\nfunction scopeCompletionSource(scope) {\n let cache = new Map;\n return (context) => {\n let path = completionPath(context);\n if (!path)\n return null;\n let target = scope;\n for (let step of path.path) {\n target = target[step];\n if (!target)\n return null;\n }\n let options = cache.get(target);\n if (!options)\n cache.set(target, options = enumeratePropertyCompletions(target, !path.path.length));\n return {\n from: context.pos - path.name.length,\n options,\n validFor: Identifier\n };\n };\n}\n\n/**\nA language provider based on the [Lezer JavaScript\nparser](https://github.com/lezer-parser/javascript), extended with\nhighlighting and indentation information.\n*/\nconst javascriptLanguage = /*@__PURE__*/LRLanguage.define({\n name: \"javascript\",\n parser: /*@__PURE__*/parser.configure({\n props: [\n /*@__PURE__*/indentNodeProp.add({\n IfStatement: /*@__PURE__*/continuedIndent({ except: /^\\s*({|else\\b)/ }),\n TryStatement: /*@__PURE__*/continuedIndent({ except: /^\\s*({|catch\\b|finally\\b)/ }),\n LabeledStatement: flatIndent,\n SwitchBody: context => {\n let after = context.textAfter, closed = /^\\s*\\}/.test(after), isCase = /^\\s*(case|default)\\b/.test(after);\n return context.baseIndent + (closed ? 0 : isCase ? 1 : 2) * context.unit;\n },\n Block: /*@__PURE__*/delimitedIndent({ closing: \"}\" }),\n ArrowFunction: cx => cx.baseIndent + cx.unit,\n \"TemplateString BlockComment\": () => null,\n \"Statement Property\": /*@__PURE__*/continuedIndent({ except: /^{/ }),\n JSXElement(context) {\n let closed = /^\\s*<\\//.test(context.textAfter);\n return context.lineIndent(context.node.from) + (closed ? 0 : context.unit);\n },\n JSXEscape(context) {\n let closed = /\\s*\\}/.test(context.textAfter);\n return context.lineIndent(context.node.from) + (closed ? 0 : context.unit);\n },\n \"JSXOpenTag JSXSelfClosingTag\"(context) {\n return context.column(context.node.from) + context.unit;\n }\n }),\n /*@__PURE__*/foldNodeProp.add({\n \"Block ClassBody SwitchBody EnumBody ObjectExpression ArrayExpression\": foldInside,\n BlockComment(tree) { return { from: tree.from + 2, to: tree.to - 2 }; }\n })\n ]\n }),\n languageData: {\n closeBrackets: { brackets: [\"(\", \"[\", \"{\", \"'\", '\"', \"`\"] },\n commentTokens: { line: \"//\", block: { open: \"/*\", close: \"*/\" } },\n indentOnInput: /^\\s*(?:case |default:|\\{|\\}|<\\/)$/,\n wordChars: \"$\"\n }\n});\nconst jsxSublanguage = {\n test: node => /^JSX/.test(node.name),\n facet: /*@__PURE__*/defineLanguageFacet({ commentTokens: { block: { open: \"{/*\", close: \"*/}\" } } })\n};\n/**\nA language provider for TypeScript.\n*/\nconst typescriptLanguage = /*@__PURE__*/javascriptLanguage.configure({ dialect: \"ts\" }, \"typescript\");\n/**\nLanguage provider for JSX.\n*/\nconst jsxLanguage = /*@__PURE__*/javascriptLanguage.configure({\n dialect: \"jsx\",\n props: [/*@__PURE__*/sublanguageProp.add(n => n.isTop ? [jsxSublanguage] : undefined)]\n});\n/**\nLanguage provider for JSX + TypeScript.\n*/\nconst tsxLanguage = /*@__PURE__*/javascriptLanguage.configure({\n dialect: \"jsx ts\",\n props: [/*@__PURE__*/sublanguageProp.add(n => n.isTop ? [jsxSublanguage] : undefined)]\n}, \"typescript\");\nconst keywords = /*@__PURE__*/\"break case const continue default delete export extends false finally in instanceof let new return static super switch this throw true typeof var yield\".split(\" \").map(kw => ({ label: kw, type: \"keyword\" }));\n/**\nJavaScript support. Includes [snippet](https://codemirror.net/6/docs/ref/#lang-javascript.snippets)\ncompletion.\n*/\nfunction javascript(config = {}) {\n let lang = config.jsx ? (config.typescript ? tsxLanguage : jsxLanguage)\n : config.typescript ? typescriptLanguage : javascriptLanguage;\n return new LanguageSupport(lang, [\n javascriptLanguage.data.of({\n autocomplete: ifNotIn(dontComplete, completeFromList(snippets.concat(keywords)))\n }),\n javascriptLanguage.data.of({\n autocomplete: localCompletionSource\n }),\n config.jsx ? autoCloseTags : [],\n ]);\n}\nfunction findOpenTag(node) {\n for (;;) {\n if (node.name == \"JSXOpenTag\" || node.name == \"JSXSelfClosingTag\" || node.name == \"JSXFragmentTag\")\n return node;\n if (!node.parent)\n return null;\n node = node.parent;\n }\n}\nfunction elementName(doc, tree, max = doc.length) {\n for (let ch = tree === null || tree === void 0 ? void 0 : tree.firstChild; ch; ch = ch.nextSibling) {\n if (ch.name == \"JSXIdentifier\" || ch.name == \"JSXBuiltin\" || ch.name == \"JSXNamespacedName\" ||\n ch.name == \"JSXMemberExpression\")\n return doc.sliceString(ch.from, Math.min(ch.to, max));\n }\n return \"\";\n}\nconst android = typeof navigator == \"object\" && /*@__PURE__*//Android\\b/.test(navigator.userAgent);\n/**\nExtension that will automatically insert JSX close tags when a `>` or\n`/` is typed.\n*/\nconst autoCloseTags = /*@__PURE__*/EditorView.inputHandler.of((view, from, to, text) => {\n if ((android ? view.composing : view.compositionStarted) || view.state.readOnly ||\n from != to || (text != \">\" && text != \"/\") ||\n !javascriptLanguage.isActiveAt(view.state, from, -1))\n return false;\n let { state } = view;\n let changes = state.changeByRange(range => {\n var _a, _b;\n let { head } = range, around = syntaxTree(state).resolveInner(head, -1), name;\n if (around.name == \"JSXStartTag\")\n around = around.parent;\n if (text == \">\" && around.name == \"JSXFragmentTag\") {\n return { range: EditorSelection.cursor(head + 1), changes: { from: head, insert: `>` } };\n }\n else if (text == \"/\" && around.name == \"JSXFragmentTag\") {\n let empty = around.parent, base = empty === null || empty === void 0 ? void 0 : empty.parent;\n if (empty.from == head - 1 && ((_a = base.lastChild) === null || _a === void 0 ? void 0 : _a.name) != \"JSXEndTag\" &&\n (name = elementName(state.doc, base === null || base === void 0 ? void 0 : base.firstChild, head))) {\n let insert = `/${name}>`;\n return { range: EditorSelection.cursor(head + insert.length), changes: { from: head, insert } };\n }\n }\n else if (text == \">\") {\n let openTag = findOpenTag(around);\n if (openTag && ((_b = openTag.lastChild) === null || _b === void 0 ? void 0 : _b.name) != \"JSXEndTag\" &&\n state.sliceDoc(head, head + 2) != \"` } };\n }\n return { range };\n });\n if (changes.changes.empty)\n return false;\n view.dispatch(changes, { userEvent: \"input.type\", scrollIntoView: true });\n return true;\n});\n\n/**\nConnects an [ESLint](https://eslint.org/) linter to CodeMirror's\n[lint](https://codemirror.net/6/docs/ref/#lint) integration. `eslint` should be an instance of the\n[`Linter`](https://eslint.org/docs/developer-guide/nodejs-api#linter)\nclass, and `config` an optional ESLint configuration. The return\nvalue of this function can be passed to [`linter`](https://codemirror.net/6/docs/ref/#lint.linter)\nto create a JavaScript linting extension.\n\nNote that ESLint targets node, and is tricky to run in the\nbrowser. The\n[eslint-linter-browserify](https://github.com/UziTech/eslint-linter-browserify)\npackage may help with that (see\n[example](https://github.com/UziTech/eslint-linter-browserify/blob/master/example/script.js)).\n*/\nfunction esLint(eslint, config) {\n if (!config) {\n config = {\n parserOptions: { ecmaVersion: 2019, sourceType: \"module\" },\n env: { browser: true, node: true, es6: true, es2015: true, es2017: true, es2020: true },\n rules: {}\n };\n eslint.getRules().forEach((desc, name) => {\n if (desc.meta.docs.recommended)\n config.rules[name] = 2;\n });\n }\n return (view) => {\n let { state } = view, found = [];\n for (let { from, to } of javascriptLanguage.findRegions(state)) {\n let fromLine = state.doc.lineAt(from), offset = { line: fromLine.number - 1, col: from - fromLine.from, pos: from };\n for (let d of eslint.verify(state.sliceDoc(from, to), config))\n found.push(translateDiagnostic(d, state.doc, offset));\n }\n return found;\n };\n}\nfunction mapPos(line, col, doc, offset) {\n return doc.line(line + offset.line).from + col + (line == 1 ? offset.col - 1 : -1);\n}\nfunction translateDiagnostic(input, doc, offset) {\n let start = mapPos(input.line, input.column, doc, offset);\n let result = {\n from: start,\n to: input.endLine != null && input.endColumn != 1 ? mapPos(input.endLine, input.endColumn, doc, offset) : start,\n message: input.message,\n source: input.ruleId ? \"eslint:\" + input.ruleId : \"eslint\",\n severity: input.severity == 1 ? \"warning\" : \"error\",\n };\n if (input.fix) {\n let { range, text } = input.fix, from = range[0] + offset.pos - start, to = range[1] + offset.pos - start;\n result.actions = [{\n name: \"fix\",\n apply(view, start) {\n view.dispatch({ changes: { from: start + from, to: start + to, insert: text }, scrollIntoView: true });\n }\n }];\n }\n return result;\n}\n\nexport { autoCloseTags, completionPath, esLint, javascript, javascriptLanguage, jsxLanguage, localCompletionSource, scopeCompletionSource, snippets, tsxLanguage, typescriptLanguage };\n"],"names":[],"mappings":"shBAMA,MAAM,CAAM,CAER,YAEA,EAGA,EAEA,EAMA,EAEA,EAIA,EAKA,EAOA,EAEA,EAEA,EAAY,EAMZ,EAAQ,CACJ,KAAK,EAAI,EACT,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,UAAY,EACjB,KAAK,IAAM,EACX,KAAK,MAAQ,EACb,KAAK,OAAS,EACd,KAAK,WAAa,EAClB,KAAK,WAAa,EAClB,KAAK,UAAY,EACjB,KAAK,OAAS,EAGlB,UAAW,CACP,MAAO,IAAI,KAAK,MAAM,OAAO,CAAC,EAAG,IAAM,EAAI,GAAK,CAAC,EAAE,OAAO,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,MAAQ,IAAM,KAAK,MAAQ,WAIlH,OAAM,EAAG,EAAO,EAAM,EAAG,CAC5B,GAAI,GAAK,EAAE,OAAO,QAClB,MAAO,IAAI,GAAM,EAAG,GAAI,EAAO,EAAK,EAAK,EAAG,GAAI,EAAG,EAAK,GAAI,GAAa,EAAI,EAAG,KAAK,EAAI,KAAM,EAAG,IAAI,KAMtG,UAAU,CAAE,MAAO,MAAK,WAAa,KAAK,WAAW,QAAU,KAInE,UAAU,EAAO,EAAO,CACpB,KAAK,MAAM,KAAK,KAAK,MAAO,EAAO,KAAK,WAAa,KAAK,OAAO,MAAM,EACvE,KAAK,MAAQ,EAIjB,OAAO,EAAQ,CACX,GAAI,GACJ,GAAI,GAAQ,GAAU,GAAkC,EAAO,EAAS,MACpE,CAAE,UAAW,KAAK,EAClB,EAAQ,EAAO,kBAAkB,CAAI,EAGzC,GAFI,GACA,MAAK,OAAS,GACd,GAAS,EAAG,CACZ,KAAK,UAAU,EAAO,QAAQ,KAAK,MAAO,EAAM,EAAI,EAAG,KAAK,SAAS,EAGjE,EAAO,EAAO,eACd,KAAK,UAAU,EAAM,KAAK,UAAW,KAAK,UAAW,EAAG,EAAI,EAChE,KAAK,cAAc,EAAM,KAAK,SAAS,EACvC,OAOJ,GAAI,GAAO,KAAK,MAAM,OAAW,GAAQ,GAAK,EAAM,GAAS,OAA+B,EAAI,GAC5F,EAAQ,EAAO,KAAK,MAAM,EAAO,GAAK,KAAK,EAAE,OAAO,GAAG,KAAM,EAAO,KAAK,UAAY,EAIzF,AAAI,GAAQ,KAAsC,CAAG,MAAK,KAAK,EAAE,OAAO,QAAQ,MAAM,MAAW,MAAQ,IAAO,SAAkB,EAAG,cACjI,CAAI,GAAS,KAAK,EAAE,sBAChB,MAAK,EAAE,oBACP,KAAK,EAAE,qBAAuB,GAEzB,KAAK,EAAE,qBAAuB,GACnC,MAAK,EAAE,kBAAoB,EAC3B,KAAK,EAAE,sBAAwB,EAC/B,KAAK,EAAE,qBAAuB,IAGtC,GAAI,GAAa,EAAO,KAAK,MAAM,EAAO,GAAK,EAAG,EAAQ,KAAK,WAAa,KAAK,OAAO,OAAS,EAEjG,GAAI,EAAO,EAAO,eAAkB,EAAS,OAAiC,CAC1E,GAAI,GAAM,EAAO,UAAU,KAAK,MAAO,GAA6B,KAAK,IAAM,KAAK,UACpF,KAAK,UAAU,EAAM,EAAO,EAAK,EAAQ,EAAG,EAAI,EAEpD,GAAI,EAAS,OACT,KAAK,MAAQ,KAAK,MAAM,OAEvB,CACD,GAAI,GAAc,KAAK,MAAM,EAAO,GACpC,KAAK,MAAQ,EAAO,QAAQ,EAAa,EAAM,EAAI,EAEvD,KAAO,KAAK,MAAM,OAAS,GACvB,KAAK,MAAM,MACf,KAAK,cAAc,EAAM,CAAK,EAIlC,UAAU,EAAM,EAAO,EAAK,EAAO,EAAG,EAAW,GAAO,CACpD,GAAI,GAAQ,GACP,EAAC,KAAK,MAAM,QAAU,KAAK,MAAM,KAAK,MAAM,OAAS,GAAK,KAAK,OAAO,OAAS,KAAK,YAAa,CAElG,GAAI,GAAM,KAAM,EAAM,KAAK,OAAO,OAKlC,GAJI,GAAO,GAAK,EAAI,QAChB,GAAM,EAAI,WAAa,EAAI,OAAO,WAClC,EAAM,EAAI,QAEV,EAAM,GAAK,EAAI,OAAO,EAAM,IAAM,GAAoB,EAAI,OAAO,EAAM,GAAK,GAAI,CAChF,GAAI,GAAS,EACT,OACJ,GAAI,EAAI,OAAO,EAAM,IAAM,EAAO,CAC9B,EAAI,OAAO,EAAM,GAAK,EACtB,SAIZ,GAAI,CAAC,GAAY,KAAK,KAAO,EACzB,KAAK,OAAO,KAAK,EAAM,EAAO,EAAK,CAAI,MAEtC,CACD,GAAI,GAAQ,KAAK,OAAO,OACxB,GAAI,EAAQ,GAAK,KAAK,OAAO,EAAQ,IAAM,EACvC,KAAO,EAAQ,GAAK,KAAK,OAAO,EAAQ,GAAK,GAEzC,KAAK,OAAO,GAAS,KAAK,OAAO,EAAQ,GACzC,KAAK,OAAO,EAAQ,GAAK,KAAK,OAAO,EAAQ,GAC7C,KAAK,OAAO,EAAQ,GAAK,KAAK,OAAO,EAAQ,GAC7C,KAAK,OAAO,EAAQ,GAAK,KAAK,OAAO,EAAQ,GAC7C,GAAS,EACL,EAAO,GACP,IAAQ,GAEpB,KAAK,OAAO,GAAS,EACrB,KAAK,OAAO,EAAQ,GAAK,EACzB,KAAK,OAAO,EAAQ,GAAK,EACzB,KAAK,OAAO,EAAQ,GAAK,GAKjC,MAAM,EAAQ,EAAM,EAAS,CACzB,GAAI,GAAQ,KAAK,IACjB,GAAI,EAAS,OACT,KAAK,UAAU,EAAS,MAA8B,KAAK,GAAG,UAExD,GAAS,SAAiC,EAAG,CACnD,GAAI,GAAY,EAAQ,CAAE,UAAW,KAAK,EAC1C,AAAI,GAAU,KAAK,KAAO,GAAQ,EAAO,UACrC,MAAK,IAAM,EACN,EAAO,UAAU,EAAW,IAC7B,MAAK,UAAY,IAEzB,KAAK,UAAU,EAAW,CAAK,EAC/B,KAAK,aAAa,EAAM,CAAK,EACzB,GAAQ,EAAO,SACf,KAAK,OAAO,KAAK,EAAM,EAAO,EAAS,CAAC,MAG5C,MAAK,IAAM,EACX,KAAK,aAAa,EAAM,CAAK,EACzB,GAAQ,KAAK,EAAE,OAAO,SACtB,KAAK,OAAO,KAAK,EAAM,EAAO,EAAS,CAAC,EAKpD,MAAM,EAAQ,EAAM,EAAS,CACzB,AAAI,EAAS,MACT,KAAK,OAAO,CAAM,EAElB,KAAK,MAAM,EAAQ,EAAM,CAAO,EAIxC,QAAQ,EAAO,EAAM,CACjB,GAAI,GAAQ,KAAK,EAAE,OAAO,OAAS,EACnC,AAAI,GAAQ,GAAK,KAAK,EAAE,OAAO,IAAU,IACrC,MAAK,EAAE,OAAO,KAAK,CAAK,EACxB,KAEJ,GAAI,GAAQ,KAAK,IACjB,KAAK,UAAY,KAAK,IAAM,EAAQ,EAAM,OAC1C,KAAK,UAAU,EAAM,CAAK,EAC1B,KAAK,OAAO,KAAK,EAAO,EAAO,KAAK,UAAW,IAC3C,KAAK,YACL,KAAK,cAAc,KAAK,WAAW,QAAQ,MAAM,KAAK,WAAW,QAAS,EAAO,KAAM,KAAK,EAAE,OAAO,MAAM,KAAK,IAAM,EAAM,MAAM,CAAC,CAAC,EAM5I,OAAQ,CACJ,GAAI,GAAS,KACT,EAAM,EAAO,OAAO,OAKxB,KAAO,EAAM,GAAK,EAAO,OAAO,EAAM,GAAK,EAAO,WAC9C,GAAO,EACX,GAAI,GAAS,EAAO,OAAO,MAAM,CAAG,EAAG,EAAO,EAAO,WAAa,EAElE,KAAO,GAAU,GAAQ,EAAO,YAC5B,EAAS,EAAO,OACpB,MAAO,IAAI,GAAM,KAAK,EAAG,KAAK,MAAM,QAAS,KAAK,MAAO,KAAK,UAAW,KAAK,IAAK,KAAK,MAAO,EAAQ,EAAM,KAAK,WAAY,KAAK,UAAW,CAAM,EAIxJ,gBAAgB,EAAM,EAAS,CAC3B,GAAI,GAAS,GAAQ,KAAK,EAAE,OAAO,QACnC,AAAI,GACA,KAAK,UAAU,EAAM,KAAK,IAAK,EAAS,CAAC,EAC7C,KAAK,UAAU,EAAkB,KAAK,IAAK,EAAS,EAAS,EAAI,CAAC,EAClE,KAAK,IAAM,KAAK,UAAY,EAC5B,KAAK,OAAS,IAMlB,SAAS,EAAM,CACX,OAAS,GAAM,GAAI,IAAe,IAAI,IAAK,CACvC,GAAI,GAAS,KAAK,EAAE,OAAO,UAAU,EAAI,MAAO,IAAqC,KAAK,EAAE,OAAO,UAAU,EAAI,MAAO,CAAI,EAC5H,GAAI,GAAU,EACV,MAAO,GACX,GAAK,GAAS,QAAkC,EAC5C,MAAO,GACX,EAAI,OAAO,CAAM,GAMzB,gBAAgB,EAAM,CAClB,GAAI,KAAK,MAAM,QAAU,IACrB,MAAO,GACX,GAAI,GAAa,KAAK,EAAE,OAAO,WAAW,KAAK,KAAK,EACpD,GAAI,EAAW,OAAS,GAA2B,GAAK,KAAK,MAAM,QAAU,IAA0C,CACnH,GAAI,GAAO,GACX,OAAS,GAAI,EAAG,EAAG,EAAI,EAAW,OAAQ,GAAK,EAC3C,AAAK,GAAI,EAAW,EAAI,KAAO,KAAK,OAAS,KAAK,EAAE,OAAO,UAAU,EAAG,CAAI,GACxE,EAAK,KAAK,EAAW,GAAI,CAAC,EAElC,GAAI,KAAK,MAAM,OAAS,IACpB,OAAS,GAAI,EAAG,EAAK,OAAS,GAA2B,GAAK,EAAI,EAAW,OAAQ,GAAK,EAAG,CACzF,GAAI,GAAI,EAAW,EAAI,GACvB,AAAK,EAAK,KAAK,CAAC,EAAG,IAAO,EAAI,GAAM,GAAK,CAAC,GACtC,EAAK,KAAK,EAAW,GAAI,CAAC,EAEtC,EAAa,EAEjB,GAAI,GAAS,GACb,OAAS,GAAI,EAAG,EAAI,EAAW,QAAU,EAAO,OAAS,EAAyB,GAAK,EAAG,CACtF,GAAI,GAAI,EAAW,EAAI,GACvB,GAAI,GAAK,KAAK,MACV,SACJ,GAAI,GAAQ,KAAK,QACjB,EAAM,UAAU,EAAG,KAAK,GAAG,EAC3B,EAAM,UAAU,EAAkB,EAAM,IAAK,EAAM,IAAK,EAAG,EAAI,EAC/D,EAAM,aAAa,EAAW,GAAI,KAAK,GAAG,EAC1C,EAAM,OAAS,IACf,EAAO,KAAK,CAAK,EAErB,MAAO,GAKX,aAAc,CACV,GAAI,GAAS,KAAK,EAAE,OAAO,UAAU,KAAK,MAAO,GACjD,GAAK,GAAS,QAAkC,EAC5C,MAAO,GACX,GAAI,CAAE,UAAW,KAAK,EACtB,GAAI,CAAC,EAAO,YAAY,KAAK,MAAO,CAAM,EAAG,CACzC,GAAI,GAAQ,GAAU,GAAkC,EAAO,EAAS,MACpE,EAAS,KAAK,MAAM,OAAS,EAAQ,EACzC,GAAI,EAAS,GAAK,EAAO,QAAQ,KAAK,MAAM,GAAS,EAAM,EAAK,EAAI,EAChE,MAAO,GACX,KAAK,UAAU,EAAkB,KAAK,UAAW,KAAK,UAAW,EAAG,EAAI,EACxE,KAAK,OAAS,IAElB,YAAK,UAAY,KAAK,IACtB,KAAK,OAAO,CAAM,EACX,GAGX,UAAW,CACP,KAAO,CAAC,KAAK,EAAE,OAAO,UAAU,KAAK,MAAO,IACxC,GAAI,CAAC,KAAK,cAAe,CACrB,KAAK,UAAU,EAAkB,KAAK,IAAK,KAAK,IAAK,EAAG,EAAI,EAC5D,MAGR,MAAO,SAKP,UAAU,CACV,GAAI,KAAK,MAAM,QAAU,EACrB,MAAO,GACX,GAAI,CAAE,UAAW,KAAK,EACtB,MAAO,GAAO,KAAK,EAAO,UAAU,KAAK,MAAO,KAAgC,OAC5E,CAAC,EAAO,UAAU,KAAK,MAAO,GAKtC,SAAU,CACN,KAAK,MAAQ,KAAK,MAAM,GACxB,KAAK,MAAM,OAAS,EAGxB,UAAU,EAAO,CACb,GAAI,KAAK,OAAS,EAAM,OAAS,KAAK,MAAM,QAAU,EAAM,MAAM,OAC9D,MAAO,GACX,OAAS,GAAI,EAAG,EAAI,KAAK,MAAM,OAAQ,GAAK,EACxC,GAAI,KAAK,MAAM,IAAM,EAAM,MAAM,GAC7B,MAAO,GACf,MAAO,MAGP,SAAS,CAAE,MAAO,MAAK,EAAE,OAG7B,eAAe,EAAW,CAAE,MAAO,MAAK,EAAE,OAAO,QAAQ,MAAM,GAC/D,aAAa,EAAM,EAAO,CACtB,AAAI,KAAK,YACL,KAAK,cAAc,KAAK,WAAW,QAAQ,MAAM,KAAK,WAAW,QAAS,EAAM,KAAM,KAAK,EAAE,OAAO,MAAM,CAAK,CAAC,CAAC,EAEzH,cAAc,EAAM,EAAO,CACvB,AAAI,KAAK,YACL,KAAK,cAAc,KAAK,WAAW,QAAQ,OAAO,KAAK,WAAW,QAAS,EAAM,KAAM,KAAK,EAAE,OAAO,MAAM,CAAK,CAAC,CAAC,EAG1H,aAAc,CACV,GAAI,GAAO,KAAK,OAAO,OAAS,EAChC,AAAI,GAAO,GAAK,KAAK,OAAO,IAAS,KACjC,KAAK,OAAO,KAAK,KAAK,WAAW,KAAM,KAAK,UAAW,KAAK,UAAW,EAAE,EAGjF,eAAgB,CACZ,GAAI,GAAO,KAAK,OAAO,OAAS,EAChC,AAAI,GAAO,GAAK,KAAK,OAAO,IAAS,KACjC,KAAK,OAAO,KAAK,KAAK,UAAW,KAAK,UAAW,KAAK,UAAW,EAAE,EAE3E,cAAc,EAAS,CACnB,GAAI,GAAW,KAAK,WAAW,QAAS,CACpC,GAAI,GAAQ,GAAI,GAAa,KAAK,WAAW,QAAS,CAAO,EAC7D,AAAI,EAAM,MAAQ,KAAK,WAAW,MAC9B,KAAK,cACT,KAAK,WAAa,GAI1B,aAAa,EAAW,CACpB,AAAI,EAAY,KAAK,WACjB,MAAK,gBACL,KAAK,UAAY,GAIzB,OAAQ,CACJ,AAAI,KAAK,YAAc,KAAK,WAAW,QAAQ,QAC3C,KAAK,cACL,KAAK,UAAY,GACjB,KAAK,gBAEjB,CACA,MAAM,CAAa,CACf,YAAY,EAAS,EAAS,CAC1B,KAAK,QAAU,EACf,KAAK,QAAU,EACf,KAAK,KAAO,EAAQ,OAAS,EAAQ,KAAK,CAAO,EAAI,EAE7D,CACA,GAAI,GACJ,AAAC,UAAU,EAAS,CAChB,EAAQ,EAAQ,OAAY,KAAO,SACnC,EAAQ,EAAQ,OAAY,KAAO,SACnC,EAAQ,EAAQ,OAAY,KAAO,SACnC,EAAQ,EAAQ,QAAa,GAAK,UAClC,EAAQ,EAAQ,oBAAyB,KAAO,sBAChD,EAAQ,EAAQ,uBAA4B,KAAO,yBACnD,EAAQ,EAAQ,gBAAqB,KAAQ,iBACjD,GAAG,GAAY,GAAU,GAAG,EAG5B,MAAM,EAAe,CACjB,YAAY,EAAO,CACf,KAAK,MAAQ,EACb,KAAK,MAAQ,EAAM,MACnB,KAAK,MAAQ,EAAM,MACnB,KAAK,KAAO,KAAK,MAAM,OAE3B,OAAO,EAAQ,CACX,GAAI,GAAO,EAAS,MAA8B,EAAQ,GAAU,GACpE,AAAI,GAAS,EACL,MAAK,OAAS,KAAK,MAAM,OACzB,MAAK,MAAQ,KAAK,MAAM,SAC5B,KAAK,MAAM,KAAK,KAAK,MAAO,EAAG,CAAC,EAChC,KAAK,MAAQ,GAGb,KAAK,MAAS,GAAQ,GAAK,EAE/B,GAAI,GAAO,KAAK,MAAM,EAAE,OAAO,QAAQ,KAAK,MAAM,KAAK,KAAO,GAAI,EAAM,EAAI,EAC5E,KAAK,MAAQ,EAErB,CAGA,MAAM,CAAkB,CACpB,YAAY,EAAO,EAAK,EAAO,CAC3B,KAAK,MAAQ,EACb,KAAK,IAAM,EACX,KAAK,MAAQ,EACb,KAAK,OAAS,EAAM,OAChB,KAAK,OAAS,GACd,KAAK,kBAEN,QAAO,EAAO,EAAM,EAAM,WAAa,EAAM,OAAO,OAAQ,CAC/D,MAAO,IAAI,GAAkB,EAAO,EAAK,EAAM,EAAM,UAAU,EAEnE,WAAY,CACR,GAAI,GAAO,KAAK,MAAM,OACtB,AAAI,GAAQ,MACR,MAAK,MAAQ,KAAK,MAAM,WAAa,EAAK,WAC1C,KAAK,MAAQ,EACb,KAAK,OAAS,EAAK,WAGvB,KAAK,CAAE,MAAO,MAAK,OAAO,KAAK,MAAQ,MACvC,QAAQ,CAAE,MAAO,MAAK,OAAO,KAAK,MAAQ,MAC1C,MAAM,CAAE,MAAO,MAAK,OAAO,KAAK,MAAQ,MACxC,OAAO,CAAE,MAAO,MAAK,OAAO,KAAK,MAAQ,GAC7C,MAAO,CACH,KAAK,OAAS,EACd,KAAK,KAAO,EACR,KAAK,OAAS,GACd,KAAK,YAEb,MAAO,CACH,MAAO,IAAI,GAAkB,KAAK,MAAO,KAAK,IAAK,KAAK,KAAK,EAErE,CAIA,WAAqB,EAAO,EAAO,YAAa,CAC5C,GAAI,MAAO,IAAS,SAChB,MAAO,GACX,GAAI,GAAQ,KACZ,OAAS,GAAM,EAAG,EAAM,EAAG,EAAM,EAAM,QAAS,CAC5C,GAAI,GAAQ,EACZ,OAAS,CACL,GAAI,GAAO,EAAM,WAAW,GAAK,EAAG,EAAO,GAC3C,GAAI,GAAQ,IAA6B,CACrC,EAAQ,MACR,MAEJ,AAAI,GAAQ,IACR,IACA,GAAQ,IACR,IACJ,GAAI,GAAQ,EAAO,GAMnB,GALI,GAAS,IACT,IAAS,GACT,EAAO,IAEX,GAAS,EACL,EACA,MACJ,GAAS,GAEb,AAAI,EACA,EAAM,KAAS,EAEf,EAAQ,GAAI,GAAK,CAAK,EAE9B,MAAO,EACX,CAEA,MAAM,CAAY,CACd,aAAc,CACV,KAAK,MAAQ,GACb,KAAK,MAAQ,GACb,KAAK,IAAM,GACX,KAAK,SAAW,GAChB,KAAK,UAAY,EACjB,KAAK,KAAO,EACZ,KAAK,QAAU,EAEvB,CACA,KAAM,GAAY,GAAI,GAKtB,MAAM,EAAY,CAEd,YAEA,EAEA,EAAQ,CACJ,KAAK,MAAQ,EACb,KAAK,OAAS,EAEd,KAAK,MAAQ,GAEb,KAAK,SAAW,EAEhB,KAAK,OAAS,GACd,KAAK,UAAY,EAGjB,KAAK,KAAO,GAEZ,KAAK,MAAQ,EACb,KAAK,WAAa,EAClB,KAAK,IAAM,KAAK,SAAW,EAAO,GAAG,KACrC,KAAK,MAAQ,EAAO,GACpB,KAAK,IAAM,EAAO,EAAO,OAAS,GAAG,GACrC,KAAK,WAGT,cAAc,EAAQ,EAAO,CACzB,GAAI,GAAQ,KAAK,MAAO,EAAQ,KAAK,WACjC,EAAM,KAAK,IAAM,EACrB,KAAO,EAAM,EAAM,MAAM,CACrB,GAAI,CAAC,EACD,MAAO,MACX,GAAI,GAAO,KAAK,OAAO,EAAE,GACzB,GAAO,EAAM,KAAO,EAAK,GACzB,EAAQ,EAEZ,KAAO,EAAQ,EAAI,EAAM,EAAM,GAAK,GAAO,EAAM,IAAI,CACjD,GAAI,GAAS,KAAK,OAAO,OAAS,EAC9B,MAAO,MACX,GAAI,GAAO,KAAK,OAAO,EAAE,GACzB,GAAO,EAAK,KAAO,EAAM,GACzB,EAAQ,EAEZ,MAAO,GAGX,QAAQ,EAAK,CACT,GAAI,GAAO,KAAK,MAAM,MAAQ,EAAM,KAAK,MAAM,GAC3C,MAAO,GACX,OAAS,KAAS,MAAK,OACnB,GAAI,EAAM,GAAK,EACX,MAAO,MAAK,IAAI,EAAK,EAAM,IAAI,EACvC,MAAO,MAAK,IAWhB,KAAK,EAAQ,CACT,GAAI,GAAM,KAAK,SAAW,EAAQ,EAAK,EACvC,GAAI,GAAO,GAAK,EAAM,KAAK,MAAM,OAC7B,EAAM,KAAK,IAAM,EACjB,EAAS,KAAK,MAAM,WAAW,CAAG,MAEjC,CACD,GAAI,GAAW,KAAK,cAAc,EAAQ,CAAC,EAC3C,GAAI,GAAY,KACZ,MAAO,GAEX,GADA,EAAM,EACF,GAAO,KAAK,WAAa,EAAM,KAAK,UAAY,KAAK,OAAO,OAC5D,EAAS,KAAK,OAAO,WAAW,EAAM,KAAK,SAAS,MAEnD,CACD,GAAI,GAAI,KAAK,WAAY,EAAQ,KAAK,MACtC,KAAO,EAAM,IAAM,GACf,EAAQ,KAAK,OAAO,EAAE,GAC1B,KAAK,OAAS,KAAK,MAAM,MAAM,KAAK,UAAY,CAAG,EAC/C,EAAM,KAAK,OAAO,OAAS,EAAM,IACjC,MAAK,OAAS,KAAK,OAAO,MAAM,EAAG,EAAM,GAAK,CAAG,GACrD,EAAS,KAAK,OAAO,WAAW,CAAC,GAGzC,MAAI,IAAO,KAAK,MAAM,WAClB,MAAK,MAAM,UAAY,EAAM,GAC1B,EAKX,YAAY,EAAO,EAAY,EAAG,CAC9B,GAAI,GAAM,EAAY,KAAK,cAAc,EAAW,EAAE,EAAI,KAAK,IAC/D,GAAI,GAAO,MAAQ,EAAM,KAAK,MAAM,MAChC,KAAM,IAAI,YAAW,yBAAyB,EAClD,KAAK,MAAM,MAAQ,EACnB,KAAK,MAAM,IAAM,EAErB,UAAW,CACP,GAAI,KAAK,KAAO,KAAK,WAAa,KAAK,IAAM,KAAK,UAAY,KAAK,OAAO,OAAQ,CAC9E,GAAI,CAAE,QAAO,YAAa,KAC1B,KAAK,MAAQ,KAAK,OAClB,KAAK,SAAW,KAAK,UACrB,KAAK,OAAS,EACd,KAAK,UAAY,EACjB,KAAK,SAAW,KAAK,IAAM,KAAK,aAE/B,CACD,KAAK,OAAS,KAAK,MACnB,KAAK,UAAY,KAAK,SACtB,GAAI,GAAY,KAAK,MAAM,MAAM,KAAK,GAAG,EACrC,EAAM,KAAK,IAAM,EAAU,OAC/B,KAAK,MAAQ,EAAM,KAAK,MAAM,GAAK,EAAU,MAAM,EAAG,KAAK,MAAM,GAAK,KAAK,GAAG,EAAI,EAClF,KAAK,SAAW,KAAK,IACrB,KAAK,SAAW,GAGxB,UAAW,CACP,MAAI,MAAK,UAAY,KAAK,MAAM,QAC5B,MAAK,WACD,KAAK,UAAY,KAAK,MAAM,QACrB,KAAK,KAAO,GAEpB,KAAK,KAAO,KAAK,MAAM,WAAW,KAAK,QAAQ,EAI1D,QAAQ,EAAI,EAAG,CAEX,IADA,KAAK,UAAY,EACV,KAAK,IAAM,GAAK,KAAK,MAAM,IAAI,CAClC,GAAI,KAAK,YAAc,KAAK,OAAO,OAAS,EACxC,MAAO,MAAK,UAChB,GAAK,KAAK,MAAM,GAAK,KAAK,IAC1B,KAAK,MAAQ,KAAK,OAAO,EAAE,KAAK,YAChC,KAAK,IAAM,KAAK,MAAM,KAE1B,YAAK,KAAO,EACR,KAAK,KAAO,KAAK,MAAM,WACvB,MAAK,MAAM,UAAY,KAAK,IAAM,GAC/B,KAAK,WAEhB,SAAU,CACN,YAAK,IAAM,KAAK,SAAW,KAAK,IAChC,KAAK,MAAQ,KAAK,OAAO,KAAK,WAAa,KAAK,OAAO,OAAS,GAChE,KAAK,MAAQ,GACN,KAAK,KAAO,GAGvB,MAAM,EAAK,EAAO,CAUd,GATA,AAAI,EACA,MAAK,MAAQ,EACb,EAAM,MAAQ,EACd,EAAM,UAAY,EAAM,EACxB,EAAM,MAAQ,EAAM,SAAW,IAG/B,KAAK,MAAQ,EAEb,KAAK,KAAO,EAAK,CAEjB,GADA,KAAK,IAAM,EACP,GAAO,KAAK,IACZ,YAAK,UACE,KAEX,KAAO,EAAM,KAAK,MAAM,MACpB,KAAK,MAAQ,KAAK,OAAO,EAAE,KAAK,YACpC,KAAO,GAAO,KAAK,MAAM,IACrB,KAAK,MAAQ,KAAK,OAAO,EAAE,KAAK,YACpC,AAAI,GAAO,KAAK,UAAY,EAAM,KAAK,SAAW,KAAK,MAAM,OACzD,KAAK,SAAW,EAAM,KAAK,SAG3B,MAAK,MAAQ,GACb,KAAK,SAAW,GAEpB,KAAK,WAET,MAAO,MAGX,KAAK,EAAM,EAAI,CACX,GAAI,GAAQ,KAAK,UAAY,GAAM,KAAK,SAAW,KAAK,MAAM,OAC1D,MAAO,MAAK,MAAM,MAAM,EAAO,KAAK,SAAU,EAAK,KAAK,QAAQ,EACpE,GAAI,GAAQ,KAAK,WAAa,GAAM,KAAK,UAAY,KAAK,OAAO,OAC7D,MAAO,MAAK,OAAO,MAAM,EAAO,KAAK,UAAW,EAAK,KAAK,SAAS,EACvE,GAAI,GAAQ,KAAK,MAAM,MAAQ,GAAM,KAAK,MAAM,GAC5C,MAAO,MAAK,MAAM,KAAK,EAAM,CAAE,EACnC,GAAI,GAAS,GACb,OAAS,KAAK,MAAK,OAAQ,CACvB,GAAI,EAAE,MAAQ,EACV,MACJ,AAAI,EAAE,GAAK,GACP,IAAU,KAAK,MAAM,KAAK,KAAK,IAAI,EAAE,KAAM,CAAI,EAAG,KAAK,IAAI,EAAE,GAAI,CAAE,CAAC,GAE5E,MAAO,GAEf,CAEA,MAAM,CAAW,CACb,YAAY,EAAM,EAAI,CAClB,KAAK,KAAO,EACZ,KAAK,GAAK,EAEd,MAAM,EAAO,EAAO,CAChB,GAAI,CAAE,UAAW,EAAM,EACvB,GAAU,KAAK,KAAM,EAAO,EAAO,KAAK,GAAI,EAAO,KAAM,EAAO,cAAc,EAEtF,CACA,EAAW,UAAU,WAAa,EAAW,UAAU,SAAW,EAAW,UAAU,OAAS,GAEhG,MAAM,CAAgB,CAClB,YAAY,EAAM,EAAW,EAAW,CACpC,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,KAAO,MAAO,IAAQ,SAAW,EAAY,CAAI,EAAI,EAE9D,MAAM,EAAO,EAAO,CAChB,GAAI,GAAQ,EAAM,IAAK,EACvB,KACI,EAAM,EAAM,IACZ,GAAU,KAAK,KAAM,EAAO,EAAO,EAAG,KAAK,KAAM,KAAK,SAAS,EAC3D,IAAM,MAAM,MAAQ,KAHnB,CAKL,GAAI,KAAK,WAAa,KAClB,OACJ,GAAI,EAAM,KAAO,EACb,MACJ,EAAM,UACN,EAAM,MAAM,EAAM,EAAG,EAAM,KAAK,EAEpC,AAAI,EAAM,GACN,GAAM,MAAM,EAAO,EAAM,KAAK,EAC9B,EAAM,YAAY,KAAK,UAAW,EAAM,CAAK,GAGzD,CACA,EAAgB,UAAU,WAAa,EAAW,UAAU,SAAW,EAAW,UAAU,OAAS,GAGrG,MAAM,CAAkB,CAMpB,YAEA,EAAO,EAAU,GAAI,CACjB,KAAK,MAAQ,EACb,KAAK,WAAa,CAAC,CAAC,EAAQ,WAC5B,KAAK,SAAW,CAAC,CAAC,EAAQ,SAC1B,KAAK,OAAS,CAAC,CAAC,EAAQ,OAEhC,CAqBA,YAAmB,EAAM,EAAO,EAAO,EAAO,EAAW,EAAY,CACjE,GAAI,GAAQ,EAAG,EAAY,GAAK,EAAO,CAAE,WAAY,EAAM,EAAE,OAC7D,EAAM,KACG,GAAY,EAAK,KAAW,GADtB,CAGX,GAAI,GAAS,EAAK,EAAQ,GAI1B,OAAS,GAAI,EAAQ,EAAG,EAAI,EAAQ,GAAK,EACrC,GAAK,GAAK,EAAI,GAAK,GAAa,EAAG,CAC/B,GAAI,GAAO,EAAK,GAChB,GAAI,EAAQ,OAAO,CAAI,GAClB,GAAM,MAAM,OAAS,IAAM,EAAM,MAAM,OAAS,GAC7C,GAAU,EAAM,EAAM,MAAM,MAAO,EAAW,CAAU,GAAI,CAChE,EAAM,YAAY,CAAI,EACtB,OAGZ,GAAI,GAAO,EAAM,KAAM,EAAM,EAAG,EAAO,EAAK,EAAQ,GAEpD,GAAI,EAAM,KAAO,GAAK,EAAO,GAAO,EAAK,EAAS,EAAO,EAAI,IAAM,OAAuB,EAAK,EAAS,EAAO,EAAI,IAAM,MAAqB,CAC1I,EAAQ,EAAK,EAAS,EAAO,EAAI,GACjC,WAGJ,KAAO,EAAM,GAAO,CAChB,GAAI,GAAO,EAAM,GAAS,EACtB,EAAQ,EAAS,EAAO,IAAO,GAC/B,GAAO,EAAK,GAAQ,GAAK,EAAK,EAAQ,IAAM,MAChD,GAAI,EAAO,GACP,EAAO,UACF,GAAQ,GACb,EAAM,EAAM,MACX,CACD,EAAQ,EAAK,EAAQ,GACrB,EAAM,UACN,YAGR,MAER,CACA,WAAoB,EAAM,EAAO,EAAM,CACnC,OAAS,GAAI,EAAO,EAAO,GAAO,EAAK,KAAO,MAAqB,IAC/D,GAAI,GAAQ,EACR,MAAO,GAAI,EACnB,MAAO,EACX,CACA,YAAmB,EAAO,EAAM,EAAW,EAAa,CACpD,GAAI,GAAQ,EAAW,EAAW,EAAa,CAAI,EACnD,MAAO,GAAQ,GAAK,EAAW,EAAW,EAAa,CAAK,EAAI,CACpE,CAGA,KAAM,GAAU,MAAO,SAAW,KAAe,QAAQ,KAAO,YAAY,QAAiB,GAAG,EAChG,GAAI,GAAW,KACf,GAAI,GACJ,AAAC,UAAU,EAAQ,CACf,EAAO,EAAO,OAAY,IAAM,QACpC,GAAG,GAAW,GAAS,GAAG,EAC1B,WAAe,EAAM,EAAK,EAAM,CAC5B,GAAI,GAAS,EAAK,OAAO,GAAS,gBAAgB,EAElD,IADA,EAAO,OAAO,CAAG,IAEb,GAAI,CAAE,GAAO,EAAI,EAAO,YAAY,CAAG,EAAI,EAAO,WAAW,CAAG,GAC5D,OAAS,CACL,GAAK,GAAO,EAAI,EAAO,GAAK,EAAM,EAAO,KAAO,IAAQ,CAAC,EAAO,KAAK,QACjE,MAAO,GAAO,EAAI,KAAK,IAAI,EAAG,KAAK,IAAI,EAAO,GAAK,EAAG,EAAM,GAAuB,EAC7E,KAAK,IAAI,EAAK,OAAQ,KAAK,IAAI,EAAO,KAAO,EAAG,EAAM,GAAuB,EACvF,GAAI,EAAO,EAAI,EAAO,cAAgB,EAAO,cACzC,MACJ,GAAI,CAAC,EAAO,SACR,MAAO,GAAO,EAAI,EAAI,EAAK,OAG/C,CACA,MAAM,EAAe,CACjB,YAAY,EAAW,EAAS,CAC5B,KAAK,UAAY,EACjB,KAAK,QAAU,EACf,KAAK,EAAI,EACT,KAAK,SAAW,KAChB,KAAK,SAAW,GAChB,KAAK,OAAS,GACd,KAAK,MAAQ,GACb,KAAK,MAAQ,GACb,KAAK,MAAQ,GACb,KAAK,eAET,cAAe,CACX,GAAI,GAAK,KAAK,SAAW,KAAK,GAAK,KAAK,UAAU,OAAS,KAAO,KAAK,UAAU,KAAK,KACtF,GAAI,EAAI,CAGJ,IAFA,KAAK,SAAW,EAAG,UAAY,EAAM,EAAG,KAAM,EAAG,KAAO,EAAG,OAAQ,CAAC,EAAI,EAAG,OAAS,EAAG,KACvF,KAAK,OAAS,EAAG,QAAU,EAAM,EAAG,KAAM,EAAG,GAAK,EAAG,OAAQ,EAAE,EAAI,EAAG,OAAS,EAAG,GAC3E,KAAK,MAAM,QACd,KAAK,MAAM,MACX,KAAK,MAAM,MACX,KAAK,MAAM,MAEf,KAAK,MAAM,KAAK,EAAG,IAAI,EACvB,KAAK,MAAM,KAAK,CAAC,EAAG,MAAM,EAC1B,KAAK,MAAM,KAAK,CAAC,EACjB,KAAK,UAAY,KAAK,aAGtB,MAAK,UAAY,IAIzB,OAAO,EAAK,CACR,GAAI,EAAM,KAAK,UACX,MAAO,MACX,KAAO,KAAK,UAAY,KAAK,QAAU,GACnC,KAAK,eACT,GAAI,CAAC,KAAK,SACN,MAAO,MACX,OAAS,CACL,GAAI,GAAO,KAAK,MAAM,OAAS,EAC/B,GAAI,EAAO,EACP,YAAK,eACE,KAEX,GAAI,GAAM,KAAK,MAAM,GAAO,EAAQ,KAAK,MAAM,GAC/C,GAAI,GAAS,EAAI,SAAS,OAAQ,CAC9B,KAAK,MAAM,MACX,KAAK,MAAM,MACX,KAAK,MAAM,MACX,SAEJ,GAAI,GAAO,EAAI,SAAS,GACpB,EAAQ,KAAK,MAAM,GAAQ,EAAI,UAAU,GAC7C,GAAI,EAAQ,EACR,YAAK,UAAY,EACV,KAEX,GAAI,YAAgB,GAAM,CACtB,GAAI,GAAS,EAAK,CACd,GAAI,EAAQ,KAAK,SACb,MAAO,MACX,GAAI,GAAM,EAAQ,EAAK,OACvB,GAAI,GAAO,KAAK,OAAQ,CACpB,GAAI,GAAY,EAAK,KAAK,EAAS,SAAS,EAC5C,GAAI,CAAC,GAAa,EAAM,EAAY,KAAK,SAAS,GAC9C,MAAO,IAGnB,KAAK,MAAM,KACP,EAAQ,EAAK,QAAU,KAAK,IAAI,KAAK,SAAU,CAAG,GAClD,MAAK,MAAM,KAAK,CAAI,EACpB,KAAK,MAAM,KAAK,CAAK,EACrB,KAAK,MAAM,KAAK,CAAC,OAIrB,MAAK,MAAM,KACX,KAAK,UAAY,EAAQ,EAAK,QAI9C,CACA,MAAM,EAAW,CACb,YAAY,EAAQ,EAAQ,CACxB,KAAK,OAAS,EACd,KAAK,OAAS,GACd,KAAK,UAAY,KACjB,KAAK,QAAU,GACf,KAAK,OAAS,EAAO,WAAW,IAAI,GAAK,GAAI,EAAW,EAE5D,WAAW,EAAO,CACd,GAAI,GAAc,EACd,EAAO,KACP,CAAE,UAAW,EAAM,EAAG,CAAE,cAAe,EACvC,EAAO,EAAO,UAAU,EAAM,MAAO,GACrC,EAAU,EAAM,WAAa,EAAM,WAAW,KAAO,EACrD,EAAY,EAChB,OAAS,GAAI,EAAG,EAAI,EAAW,OAAQ,IAAK,CACxC,GAAM,IAAK,EAAK,IAAS,EACrB,SACJ,GAAI,GAAY,EAAW,GAAI,EAAQ,KAAK,OAAO,GACnD,GAAI,KAAQ,CAAC,EAAU,WAEnB,IAAU,YAAc,EAAM,OAAS,EAAM,KAAO,EAAM,MAAQ,GAAQ,EAAM,SAAW,IAC3F,MAAK,kBAAkB,EAAO,EAAW,CAAK,EAC9C,EAAM,KAAO,EACb,EAAM,QAAU,GAEhB,EAAM,UAAY,EAAM,IAAM,IAC9B,GAAY,KAAK,IAAI,EAAM,UAAW,CAAS,GAC/C,EAAM,OAAS,GAAkB,CACjC,GAAI,GAAa,EAIjB,GAHI,EAAM,SAAW,IACjB,GAAc,KAAK,WAAW,EAAO,EAAM,SAAU,EAAM,IAAK,CAAW,GAC/E,EAAc,KAAK,WAAW,EAAO,EAAM,MAAO,EAAM,IAAK,CAAW,EACpE,CAAC,EAAU,QACX,GAAO,EACH,EAAc,GACd,OAIhB,KAAO,KAAK,QAAQ,OAAS,GACzB,KAAK,QAAQ,MACjB,MAAI,IACA,EAAM,aAAa,CAAS,EAC5B,CAAC,GAAQ,EAAM,KAAO,KAAK,OAAO,KAClC,GAAO,GAAI,GACX,EAAK,MAAQ,EAAM,EAAE,OAAO,QAC5B,EAAK,MAAQ,EAAK,IAAM,EAAM,IAC9B,EAAc,KAAK,WAAW,EAAO,EAAK,MAAO,EAAK,IAAK,CAAW,GAE1E,KAAK,UAAY,EACV,KAAK,QAEhB,aAAa,EAAO,CAChB,GAAI,KAAK,UACL,MAAO,MAAK,UAChB,GAAI,GAAO,GAAI,GAAa,CAAE,MAAK,KAAM,EACzC,SAAK,MAAQ,EACb,EAAK,IAAM,KAAK,IAAI,EAAM,EAAG,EAAE,OAAO,GAAG,EACzC,EAAK,MAAQ,GAAO,EAAE,OAAO,IAAM,EAAE,OAAO,QAAU,EAC/C,EAEX,kBAAkB,EAAO,EAAW,EAAO,CACvC,GAAI,GAAQ,KAAK,OAAO,QAAQ,EAAM,GAAG,EAEzC,GADA,EAAU,MAAM,KAAK,OAAO,MAAM,EAAO,CAAK,EAAG,CAAK,EAClD,EAAM,MAAQ,GAAI,CAClB,GAAI,CAAE,UAAW,EAAM,EACvB,OAAS,GAAI,EAAG,EAAI,EAAO,YAAY,OAAQ,IAC3C,GAAI,EAAO,YAAY,IAAM,EAAM,MAAO,CACtC,GAAI,GAAS,EAAO,aAAa,GAAG,KAAK,OAAO,KAAK,EAAM,MAAO,EAAM,GAAG,EAAG,CAAK,EACnF,GAAI,GAAU,GAAK,EAAM,EAAE,OAAO,QAAQ,OAAO,GAAU,CAAC,EAAG,CAC3D,AAAK,GAAS,IAAM,EAChB,EAAM,MAAQ,GAAU,EAExB,EAAM,SAAW,GAAU,EAC/B,YAKZ,GAAM,MAAQ,EACd,EAAM,IAAM,KAAK,OAAO,QAAQ,EAAQ,CAAC,EAGjD,UAAU,EAAQ,EAAO,EAAK,EAAO,CAEjC,OAAS,GAAI,EAAG,EAAI,EAAO,GAAK,EAC5B,GAAI,KAAK,QAAQ,IAAM,EACnB,MAAO,GACf,YAAK,QAAQ,KAAW,EACxB,KAAK,QAAQ,KAAW,EACxB,KAAK,QAAQ,KAAW,EACjB,EAEX,WAAW,EAAO,EAAO,EAAK,EAAO,CACjC,GAAI,CAAE,SAAU,EAAO,CAAE,UAAW,EAAM,EAAG,CAAE,QAAS,EACxD,OAAS,GAAM,EAAG,EAAM,EAAG,IACvB,OAAS,GAAI,EAAO,UAAU,EAAO,EAAM,EAA0B,IAA8B,GAAK,EAAG,CACvG,GAAI,EAAK,IAAM,MACX,GAAI,EAAK,EAAI,IAAM,EACf,EAAI,EAAK,EAAM,EAAI,CAAC,MAEnB,CACD,AAAI,GAAS,GAAK,EAAK,EAAI,IAAM,GAC7B,GAAQ,KAAK,UAAU,EAAK,EAAM,EAAI,CAAC,EAAG,EAAO,EAAK,CAAK,GAC/D,MAGR,AAAI,EAAK,IAAM,GACX,GAAQ,KAAK,UAAU,EAAK,EAAM,EAAI,CAAC,EAAG,EAAO,EAAK,CAAK,GAGvE,MAAO,GAEf,CACA,GAAI,GACJ,AAAC,UAAU,EAAK,CACZ,EAAI,EAAI,SAAc,GAAK,WAC3B,EAAI,EAAI,oBAAyB,GAAK,sBAGtC,EAAI,EAAI,qBAA0B,KAAO,uBACzC,EAAI,EAAI,iBAAsB,IAAM,mBAIpC,EAAI,EAAI,SAAc,MAAS,WAC/B,EAAI,EAAI,MAAW,KAAQ,QAC3B,EAAI,EAAI,iCAAsC,KAAO,mCAIrD,EAAI,EAAI,cAAmB,IAAM,eACrC,GAAG,GAAQ,GAAM,GAAG,EACpB,MAAM,EAAM,CACR,YAAY,EAAQ,EAAO,EAAW,EAAQ,CAC1C,KAAK,OAAS,EACd,KAAK,MAAQ,EACb,KAAK,OAAS,EACd,KAAK,WAAa,EAClB,KAAK,YAAc,KACnB,KAAK,YAAc,EACnB,KAAK,OAAS,GACd,KAAK,UAAY,KACjB,KAAK,sBAAwB,GAC7B,KAAK,qBAAuB,EAC5B,KAAK,kBAAoB,EACzB,KAAK,OAAS,GAAI,IAAY,EAAO,CAAM,EAC3C,KAAK,OAAS,GAAI,IAAW,EAAQ,KAAK,MAAM,EAChD,KAAK,QAAU,EAAO,IAAI,GAC1B,GAAI,CAAE,QAAS,EAAO,GACtB,KAAK,OAAS,CAAC,EAAM,MAAM,KAAM,EAAO,IAAI,GAAI,CAAI,CAAC,EACrD,KAAK,UAAY,EAAU,QAAU,KAAK,OAAO,IAAM,EAAO,EAAO,aAAe,EAC9E,GAAI,IAAe,EAAW,EAAO,OAAO,EAAI,QAEtD,YAAY,CACZ,MAAO,MAAK,YAQhB,SAAU,CACN,GAAI,GAAS,KAAK,OAAQ,EAAM,KAAK,YAEjC,EAAY,KAAK,OAAS,GAC1B,EAAS,EAQb,GAAI,KAAK,kBAAoB,KAAkD,EAAO,QAAU,EAAG,CAC/F,GAAI,CAAC,GAAK,EACV,KAAO,EAAE,eAAiB,EAAE,MAAM,QAAU,EAAE,MAAM,EAAE,MAAM,OAAS,IAAM,KAAK,uBAAuB,CACvG,KAAK,kBAAoB,KAAK,qBAAuB,EAKzD,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACpC,GAAI,GAAQ,EAAO,GACnB,OAAS,CAEL,GADA,KAAK,OAAO,UAAY,KACpB,EAAM,IAAM,EACZ,EAAU,KAAK,CAAK,MAEnB,IAAI,KAAK,aAAa,EAAO,EAAW,CAAM,EAC/C,SAEC,CACD,AAAK,GACD,GAAU,GACV,EAAgB,IAEpB,EAAQ,KAAK,CAAK,EAClB,GAAI,GAAM,KAAK,OAAO,aAAa,CAAK,EACxC,EAAc,KAAK,EAAI,MAAO,EAAI,GAAG,GAEzC,OAGR,GAAI,CAAC,EAAU,OAAQ,CACnB,GAAI,GAAW,GAAW,GAAa,CAAO,EAC9C,GAAI,EACA,MAAO,MAAK,YAAY,CAAQ,EACpC,GAAI,KAAK,OAAO,OACZ,KAAI,IAAW,GACX,QAAQ,IAAI,oBAAuB,MAAK,OAAO,UAAY,KAAK,OAAO,QAAQ,KAAK,OAAO,UAAU,KAAK,EAAI,OAAO,EACnH,GAAI,aAAY,eAAiB,CAAG,EAE9C,AAAK,KAAK,YACN,MAAK,WAAa,GAE1B,GAAI,KAAK,YAAc,EAAS,CAC5B,GAAI,GAAW,KAAK,WAAa,MAAQ,EAAQ,GAAG,IAAM,KAAK,UAAY,EAAQ,GAC7E,KAAK,YAAY,EAAS,EAAe,CAAS,EACxD,GAAI,EACA,MAAO,MAAK,YAAY,EAAS,UAAU,EAEnD,GAAI,KAAK,WAAY,CACjB,GAAI,GAAe,KAAK,YAAc,EAAI,EAAI,KAAK,WAAa,EAChE,GAAI,EAAU,OAAS,EAEnB,IADA,EAAU,KAAK,CAAC,EAAG,IAAM,EAAE,MAAQ,EAAE,KAAK,EACnC,EAAU,OAAS,GACtB,EAAU,MAElB,AAAI,EAAU,KAAK,GAAK,EAAE,UAAY,CAAG,GACrC,KAAK,qBAEJ,EAAU,OAAS,EAAG,CAI3B,EAAO,OAAS,GAAI,EAAG,EAAI,EAAU,OAAS,EAAG,IAAK,CAClD,GAAI,GAAQ,EAAU,GACtB,OAAS,GAAI,EAAI,EAAG,EAAI,EAAU,OAAQ,IAAK,CAC3C,GAAI,GAAQ,EAAU,GACtB,GAAI,EAAM,UAAU,CAAK,GACrB,EAAM,OAAO,OAAS,KAAsC,EAAM,OAAO,OAAS,IAClF,GAAM,GAAM,MAAQ,EAAM,OAAW,EAAM,OAAO,OAAS,EAAM,OAAO,QAAW,EAC/E,EAAU,OAAO,IAAK,CAAC,MAEtB,CACD,EAAU,OAAO,IAAK,CAAC,EACvB,aAKhB,AAAI,EAAU,OAAS,IACnB,EAAU,OAAO,GAA4B,EAAU,OAAS,IAExE,KAAK,YAAc,EAAU,GAAG,IAChC,OAAS,GAAI,EAAG,EAAI,EAAU,OAAQ,IAClC,AAAI,EAAU,GAAG,IAAM,KAAK,aACxB,MAAK,YAAc,EAAU,GAAG,KACxC,MAAO,MAEX,OAAO,EAAK,CACR,GAAI,KAAK,WAAa,MAAQ,KAAK,UAAY,EAC3C,KAAM,IAAI,YAAW,8BAA8B,EACvD,KAAK,UAAY,EAMrB,aAAa,EAAO,EAAQ,EAAO,CAC/B,GAAI,GAAQ,EAAM,IAAK,CAAE,UAAW,KAChC,EAAO,EAAU,KAAK,QAAQ,CAAK,EAAI,OAAS,GACpD,GAAI,KAAK,WAAa,MAAQ,EAAQ,KAAK,UACvC,MAAO,GAAM,cAAgB,EAAQ,KACzC,GAAI,KAAK,UAAW,CAChB,GAAI,GAAW,EAAM,YAAc,EAAM,WAAW,QAAQ,OAAQ,EAAS,EAAW,EAAM,WAAW,KAAO,EAChH,OAAS,GAAS,KAAK,UAAU,OAAO,CAAK,EAAG,GAAS,CACrD,GAAI,GAAQ,KAAK,OAAO,QAAQ,MAAM,EAAO,KAAK,KAAO,EAAO,KAAO,EAAO,QAAQ,EAAM,MAAO,EAAO,KAAK,EAAE,EAAI,GACrH,GAAI,EAAQ,IAAM,EAAO,QAAW,EAAC,GAAa,GAAO,KAAK,EAAS,WAAW,GAAK,IAAM,GACzF,SAAM,QAAQ,EAAQ,CAAK,EACvB,GACA,QAAQ,IAAI,EAAO,KAAK,QAAQ,CAAK,EAAI,kBAAkB,EAAO,QAAQ,EAAO,KAAK,EAAE,IAAI,EACzF,GAEX,GAAI,CAAE,aAAkB,KAAS,EAAO,SAAS,QAAU,GAAK,EAAO,UAAU,GAAK,EAClF,MACJ,GAAI,GAAQ,EAAO,SAAS,GAC5B,GAAI,YAAiB,IAAQ,EAAO,UAAU,IAAM,EAChD,EAAS,MAET,QAGZ,GAAI,GAAgB,EAAO,UAAU,EAAM,MAAO,GAClD,GAAI,EAAgB,EAChB,SAAM,OAAO,CAAa,EACtB,GACA,QAAQ,IAAI,EAAO,KAAK,QAAQ,CAAK,EAAI,uBAAuB,EAAO,QAAQ,EAAgB,SAAgC,EAC5H,GAEX,GAAI,EAAM,MAAM,QAAU,KACtB,KAAO,EAAM,MAAM,OAAS,KAAwB,EAAM,eAAe,CAE7E,GAAI,GAAU,KAAK,OAAO,WAAW,CAAK,EAC1C,OAAS,GAAI,EAAG,EAAI,EAAQ,QAAS,CACjC,GAAI,GAAS,EAAQ,KAAM,EAAO,EAAQ,KAAM,EAAM,EAAQ,KAC1D,EAAO,GAAK,EAAQ,QAAU,CAAC,EAC/B,EAAa,EAAO,EAAQ,EAAM,QAKtC,GAJA,EAAW,MAAM,EAAQ,EAAM,CAAG,EAC9B,GACA,QAAQ,IAAI,EAAO,KAAK,QAAQ,CAAU,EAAI,SAAU,GAAS,QAAkC,EAAI,QACjG,aAAa,EAAO,QAAQ,EAAS,gBAAuC,EAAO,QAAQ,CAAI,OAAO,IAAQ,GAAc,EAAQ,GAAK,YAAY,EAC3J,EACA,MAAO,GACN,AAAI,EAAW,IAAM,EACtB,EAAO,KAAK,CAAU,EAEtB,EAAM,KAAK,CAAU,EAE7B,MAAO,GAKX,aAAa,EAAO,EAAW,CAC3B,GAAI,GAAM,EAAM,IAChB,OAAS,CACL,GAAI,CAAC,KAAK,aAAa,EAAO,KAAM,IAAI,EACpC,MAAO,GACX,GAAI,EAAM,IAAM,EACZ,SAAe,EAAO,CAAS,EACxB,IAInB,YAAY,EAAQ,EAAQ,EAAW,CACnC,GAAI,GAAW,KAAM,EAAY,GACjC,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACpC,GAAI,GAAQ,EAAO,GAAI,EAAQ,EAAO,GAAK,GAAI,EAAW,EAAQ,IAAK,GAAK,GACxE,EAAO,EAAU,KAAK,QAAQ,CAAK,EAAI,OAAS,GACpD,GAAI,EAAM,SACF,IAEJ,GAAY,GACZ,EAAM,UACF,GACA,QAAQ,IAAI,EAAO,KAAK,QAAQ,CAAK,EAAI,cAAc,EAChD,KAAK,aAAa,EAAO,CAAS,IAEzC,SAER,GAAI,GAAQ,EAAM,QAAS,EAAY,EACvC,OAAS,GAAI,EAAG,EAAM,eAAiB,EAAI,IACnC,IACA,QAAQ,IAAI,EAAY,KAAK,QAAQ,CAAK,EAAI,qBAAqB,EAC5D,MAAK,aAAa,EAAO,CAAS,GAHyB,IAMtE,AAAI,GACA,GAAY,KAAK,QAAQ,CAAK,EAAI,QAE1C,OAAS,KAAU,GAAM,gBAAgB,CAAK,EAC1C,AAAI,GACA,QAAQ,IAAI,EAAO,KAAK,QAAQ,CAAM,EAAI,uBAAuB,EACrE,KAAK,aAAa,EAAQ,CAAS,EAEvC,AAAI,KAAK,OAAO,IAAM,EAAM,IACpB,IAAY,EAAM,KAClB,KACA,EAAQ,GAEZ,EAAM,gBAAgB,EAAO,CAAQ,EACjC,GACA,QAAQ,IAAI,EAAO,KAAK,QAAQ,CAAK,EAAI,wBAAwB,KAAK,OAAO,QAAQ,CAAK,IAAI,EAClG,EAAe,EAAO,CAAS,GAE1B,EAAC,GAAY,EAAS,MAAQ,EAAM,QACzC,GAAW,GAGnB,MAAO,GAGX,YAAY,EAAO,CACf,SAAM,QACC,EAAK,MAAM,CAAE,OAAQ,EAAkB,OAAO,CAAK,EACtD,QAAS,KAAK,OAAO,QACrB,MAAO,KAAK,QACZ,gBAAiB,KAAK,OAAO,aAC7B,OAAQ,KAAK,OACb,MAAO,KAAK,OAAO,GAAG,KACtB,OAAQ,EAAM,IAAM,KAAK,OAAO,GAAG,KACnC,cAAe,KAAK,OAAO,cAAe,EAElD,QAAQ,EAAO,CACX,GAAI,GAAM,IAAa,GAAW,GAAI,WAAU,IAAI,CAAK,EACzD,MAAK,IACD,EAAS,IAAI,EAAO,EAAK,OAAO,cAAc,KAAK,aAAa,CAAC,EAC9D,EAAK,EAEpB,CACA,WAAwB,EAAO,EAAW,CACtC,OAAS,GAAI,EAAG,EAAI,EAAU,OAAQ,IAAK,CACvC,GAAI,GAAQ,EAAU,GACtB,GAAI,EAAM,KAAO,EAAM,KAAO,EAAM,UAAU,CAAK,EAAG,CAClD,AAAI,EAAU,GAAG,MAAQ,EAAM,OAC3B,GAAU,GAAK,GACnB,QAGR,EAAU,KAAK,CAAK,CACxB,CACA,MAAM,EAAQ,CACV,YAAY,EAAQ,EAAO,EAAU,CACjC,KAAK,OAAS,EACd,KAAK,MAAQ,EACb,KAAK,SAAW,EAEpB,OAAO,EAAM,CAAE,MAAO,CAAC,KAAK,UAAY,KAAK,SAAS,IAAS,EACnE,CACA,KAAM,GAAK,GAAK,EAWhB,MAAM,EAAe,CAEjB,YAAY,EAAM,CACd,KAAK,MAAQ,EAAK,MAClB,KAAK,MAAQ,EAAK,OAAS,EAC3B,KAAK,OAAS,EAAK,QAAU,EAC7B,KAAK,MAAQ,EAAK,OAAS,EAC3B,KAAK,KAAO,EAAK,MAAS,KAAM,GAChC,KAAK,OAAS,EAAK,SAAW,GAEtC,CAIA,MAAM,SAAiB,GAAO,CAE1B,YAAY,EAAM,CAId,GAHA,QAEA,KAAK,SAAW,GACZ,EAAK,SAAW,GAChB,KAAM,IAAI,YAAW,mBAAmB,EAAK,2CAA2C,KAAwB,EACpH,GAAI,GAAY,EAAK,UAAU,MAAM,GAAG,EACxC,KAAK,cAAgB,EAAU,OAC/B,OAAS,GAAI,EAAG,EAAI,EAAK,gBAAiB,IACtC,EAAU,KAAK,EAAE,EACrB,GAAI,GAAW,OAAO,KAAK,EAAK,QAAQ,EAAE,IAAI,GAAK,EAAK,SAAS,GAAG,EAAE,EAClE,EAAY,GAChB,OAAS,GAAI,EAAG,EAAI,EAAU,OAAQ,IAClC,EAAU,KAAK,EAAE,EACrB,WAAiB,EAAQ,EAAM,EAAO,CAClC,EAAU,GAAQ,KAAK,CAAC,EAAM,EAAK,YAAY,OAAO,CAAK,CAAC,CAAC,CAAC,EAElE,GAAI,EAAK,UACL,OAAS,KAAY,GAAK,UAAW,CACjC,GAAI,GAAO,EAAS,GACpB,AAAI,MAAO,IAAQ,UACf,GAAO,EAAS,IACpB,OAAS,GAAI,EAAG,EAAI,EAAS,QAAS,CAClC,GAAI,GAAO,EAAS,KACpB,GAAI,GAAQ,EACR,EAAQ,EAAM,EAAM,EAAS,IAAI,MAEhC,CACD,GAAI,GAAQ,EAAS,EAAI,CAAC,GAC1B,OAAS,GAAI,CAAC,EAAM,EAAI,EAAG,IACvB,EAAQ,EAAS,KAAM,EAAM,CAAK,EACtC,MAIhB,KAAK,QAAU,GAAI,IAAQ,EAAU,IAAI,CAAC,EAAM,IAAM,GAAS,OAAO,CAClE,KAAM,GAAK,KAAK,cAAgB,OAAY,EAC5C,GAAI,EACJ,MAAO,EAAU,GACjB,IAAK,EAAS,QAAQ,CAAC,EAAI,GAC3B,MAAO,GAAK,EACZ,QAAS,EAAK,cAAgB,EAAK,aAAa,QAAQ,CAAC,EAAI,GAChE,CAAC,CAAC,EACC,EAAK,aACL,MAAK,QAAU,KAAK,QAAQ,OAAO,GAAG,EAAK,WAAW,GAC1D,KAAK,OAAS,GACd,KAAK,aAAe,GACpB,GAAI,GAAa,EAAY,EAAK,SAAS,EAC3C,KAAK,QAAU,EAAK,QACpB,KAAK,iBAAmB,EAAK,aAAe,GAC5C,KAAK,YAAc,GAAI,aAAY,KAAK,iBAAiB,MAAM,EAC/D,OAAS,GAAI,EAAG,EAAI,KAAK,iBAAiB,OAAQ,IAC9C,KAAK,YAAY,GAAK,KAAK,iBAAiB,GAAG,KACnD,KAAK,aAAe,KAAK,iBAAiB,IAAI,CAAc,EAC5D,KAAK,OAAS,EAAY,EAAK,OAAQ,WAAW,EAClD,KAAK,KAAO,EAAY,EAAK,SAAS,EACtC,KAAK,KAAO,EAAY,EAAK,IAAI,EACjC,KAAK,QAAU,EAAK,QACpB,KAAK,WAAa,EAAK,WAAW,IAAI,GAAS,MAAO,IAAS,SAAW,GAAI,GAAW,EAAY,CAAK,EAAI,CAAK,EACnH,KAAK,SAAW,EAAK,SACrB,KAAK,SAAW,EAAK,UAAY,GACjC,KAAK,mBAAqB,EAAK,oBAAsB,KACrD,KAAK,eAAiB,EAAK,UAC3B,KAAK,UAAY,EAAK,WAAa,KACnC,KAAK,QAAU,KAAK,QAAQ,MAAM,OAAS,EAC3C,KAAK,QAAU,KAAK,eACpB,KAAK,IAAM,KAAK,SAAS,OAAO,KAAK,KAAK,QAAQ,EAAE,IAExD,YAAY,EAAO,EAAW,EAAQ,CAClC,GAAI,GAAQ,GAAI,IAAM,KAAM,EAAO,EAAW,CAAM,EACpD,OAAS,KAAK,MAAK,SACf,EAAQ,EAAE,EAAO,EAAO,EAAW,CAAM,EAC7C,MAAO,GAGX,QAAQ,EAAO,EAAM,EAAQ,GAAO,CAChC,GAAI,GAAQ,KAAK,KACjB,GAAI,GAAQ,EAAM,GACd,MAAO,GACX,OAAS,GAAM,EAAM,EAAO,KAAM,CAC9B,GAAI,GAAW,EAAM,KAAQ,EAAO,EAAW,EAC3C,EAAS,EAAM,KACnB,GAAI,GAAQ,EACR,MAAO,GACX,OAAS,GAAM,EAAO,IAAY,GAAI,EAAM,EAAK,IAC7C,GAAI,EAAM,IAAQ,EACd,MAAO,GACf,GAAI,EACA,MAAO,IAInB,UAAU,EAAO,EAAU,CACvB,GAAI,GAAO,KAAK,KAChB,OAAS,GAAM,EAAG,EAAM,EAAG,IACvB,OAAS,GAAI,KAAK,UAAU,EAAO,EAAM,EAA0B,GAA6B,GAAO,GAAK,EAAG,CAC3G,GAAK,GAAO,EAAK,KAAO,MACpB,GAAI,EAAK,EAAI,IAAM,EACf,EAAO,EAAK,EAAI,EAAK,EAAM,EAAI,CAAC,OAC/B,IAAI,EAAK,EAAI,IAAM,EACpB,MAAO,GAAK,EAAM,EAAI,CAAC,EAEvB,MAER,GAAI,GAAQ,GAAY,GAAQ,EAC5B,MAAO,GAAK,EAAM,EAAI,CAAC,EAGnC,MAAO,GAGX,UAAU,EAAO,EAAM,CACnB,MAAO,MAAK,OAAQ,EAAQ,EAA2B,GAG3D,UAAU,EAAO,EAAM,CACnB,MAAQ,MAAK,UAAU,EAAO,GAA4B,GAAQ,EAGtE,YAAY,EAAO,EAAQ,CACvB,GAAI,GAAU,KAAK,UAAU,EAAO,GAChC,MAAO,GACX,OAAS,GAAI,KAAK,UAAU,EAAO,IAA8B,GAAK,EAAG,CACrE,GAAI,KAAK,KAAK,IAAM,MAChB,GAAI,KAAK,KAAK,EAAI,IAAM,EACpB,EAAI,EAAK,KAAK,KAAM,EAAI,CAAC,MAEzB,OAAO,GAEf,GAAI,GAAU,EAAK,KAAK,KAAM,EAAI,CAAC,EAC/B,MAAO,IAKnB,WAAW,EAAO,CACd,GAAI,GAAS,GACb,OAAS,GAAI,KAAK,UAAU,EAAO,IAA8B,GAAK,EAAG,CACrE,GAAI,KAAK,KAAK,IAAM,MAChB,GAAI,KAAK,KAAK,EAAI,IAAM,EACpB,EAAI,EAAK,KAAK,KAAM,EAAI,CAAC,MAEzB,OAER,GAAK,MAAK,KAAK,EAAI,GAAM,IAAyC,EAAG,CACjE,GAAI,GAAQ,KAAK,KAAK,EAAI,GAC1B,AAAK,EAAO,KAAK,CAAC,EAAG,IAAO,EAAI,GAAM,GAAK,CAAK,GAC5C,EAAO,KAAK,KAAK,KAAK,GAAI,CAAK,GAG3C,MAAO,GAKX,UAAU,EAAQ,CAGd,GAAI,GAAO,OAAO,OAAO,OAAO,OAAO,EAAS,SAAS,EAAG,IAAI,EAGhE,GAFI,EAAO,OACP,GAAK,QAAU,KAAK,QAAQ,OAAO,GAAG,EAAO,KAAK,GAClD,EAAO,IAAK,CACZ,GAAI,GAAO,KAAK,SAAS,EAAO,KAChC,GAAI,CAAC,EACD,KAAM,IAAI,YAAW,yBAAyB,EAAO,KAAK,EAC9D,EAAK,IAAM,EAEf,MAAI,GAAO,YACP,GAAK,WAAa,KAAK,WAAW,IAAI,GAAK,CACvC,GAAI,GAAQ,EAAO,WAAW,KAAK,GAAK,EAAE,MAAQ,CAAC,EACnD,MAAO,GAAQ,EAAM,GAAK,EAC7B,GACD,EAAO,cACP,GAAK,aAAe,KAAK,aAAa,QACtC,EAAK,iBAAmB,KAAK,iBAAiB,IAAI,CAAC,EAAG,IAAM,CACxD,GAAI,GAAQ,EAAO,aAAa,KAAK,GAAK,EAAE,MAAQ,EAAE,QAAQ,EAC9D,GAAI,CAAC,EACD,MAAO,GACX,GAAI,GAAO,OAAO,OAAO,OAAO,OAAO,GAAI,CAAC,EAAG,CAAE,SAAU,EAAM,GAAI,EACrE,SAAK,aAAa,GAAK,EAAe,CAAI,EACnC,EACV,GAED,EAAO,gBACP,GAAK,QAAU,EAAO,gBACtB,EAAO,SACP,GAAK,QAAU,KAAK,aAAa,EAAO,OAAO,GAC/C,EAAO,QAAU,MACjB,GAAK,OAAS,EAAO,QACrB,EAAO,MACP,GAAK,SAAW,EAAK,SAAS,OAAO,EAAO,IAAI,GAChD,EAAO,cAAgB,MACvB,GAAK,aAAe,EAAO,cACxB,EAIX,aAAc,CACV,MAAO,MAAK,SAAS,OAAS,EAMlC,QAAQ,EAAM,CACV,MAAO,MAAK,UAAY,KAAK,UAAU,GAAQ,OAAO,GAAQ,KAAK,SAAW,KAAK,QAAQ,MAAM,GAAM,MAAQ,CAAI,KAInH,UAAU,CAAE,MAAO,MAAK,QAAU,KAElC,UAAU,CAAE,MAAO,MAAK,QAAQ,MAAM,KAAK,IAAI,IAEnD,kBAAkB,EAAM,CACpB,GAAI,GAAO,KAAK,mBAChB,MAAO,IAAQ,KAAO,EAAI,EAAK,IAAS,EAG5C,aAAa,EAAS,CAClB,GAAI,GAAS,OAAO,KAAK,KAAK,QAAQ,EAAG,EAAQ,EAAO,IAAI,IAAM,EAAK,EACvE,GAAI,EACA,OAAS,KAAQ,GAAQ,MAAM,GAAG,EAAG,CACjC,GAAI,GAAK,EAAO,QAAQ,CAAI,EAC5B,AAAI,GAAM,GACN,GAAM,GAAM,IAExB,GAAI,GAAW,KACf,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAC/B,GAAI,CAAC,EAAM,GACP,OAAS,GAAI,KAAK,SAAS,EAAO,IAAK,EAAK,GAAK,KAAK,KAAK,OAAS,OAChE,AAAC,IAAa,GAAW,GAAI,YAAW,KAAK,QAAU,CAAC,IAAI,GAAM,EAE9E,MAAO,IAAI,IAAQ,EAAS,EAAO,CAAQ,QAIxC,aAAY,EAAM,CACrB,MAAO,IAAI,GAAS,CAAI,EAEhC,CACA,WAAc,EAAM,EAAK,CAAE,MAAO,GAAK,GAAQ,EAAK,EAAM,IAAM,GAChE,YAAsB,EAAQ,CAC1B,GAAI,GAAO,KACX,OAAS,KAAS,GAAQ,CACtB,GAAI,GAAU,EAAM,EAAE,UACtB,AAAK,GAAM,KAAO,EAAM,EAAE,OAAO,KAAO,GAAW,MAAQ,EAAM,IAAM,IACnE,EAAM,EAAE,OAAO,UAAU,EAAM,MAAO,IACrC,EAAC,GAAQ,EAAK,MAAQ,EAAM,QAC7B,GAAO,GAEf,MAAO,EACX,CACA,WAAwB,EAAM,CAC1B,GAAI,EAAK,SAAU,CACf,GAAI,GAAO,EAAK,OAAS,EAA4B,EACrD,MAAO,CAAC,EAAO,IAAW,EAAK,SAAS,EAAO,CAAK,GAAK,EAAK,EAElE,MAAO,GAAK,GAChB,CCvpDA,KAAM,GAAS,IACb,EAAS,EACT,GAAe,EACf,EAAa,IACb,GAAS,IACT,GAAU,IACV,GAAc,EACd,GAAe,EAKX,GAAQ,CAAC,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KACvF,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAK,EAElD,GAAS,IAAK,GAAY,GAAI,EAAQ,GAAI,GAAO,GACjD,GAAO,GAAI,GAAQ,GAEnB,GAAe,GAAI,IAAe,CACtC,MAAO,GACP,MAAM,EAAS,EAAM,CACnB,MAAO,IAAQ,IAAe,GAAQ,IAAgB,GAAQ,GAAS,EAAU,GAAQ,IAE3F,OAAQ,EACV,CAAC,EAEK,GAAkB,GAAI,GAAkB,CAAC,EAAO,IAAU,CAC9D,GAAI,CAAC,QAAQ,EACb,AAAK,IAAQ,IAAU,GAAQ,IAAM,EAAM,UAAY,EAAM,SAAS,CAAU,GAC9E,EAAM,YAAY,CAAU,CAChC,EAAG,CAAC,WAAY,GAAM,SAAU,EAAI,CAAC,EAE/B,GAAc,GAAI,GAAkB,CAAC,EAAO,IAAU,CAC1D,GAAI,CAAC,QAAQ,EAAO,EACpB,AAAI,GAAM,QAAQ,CAAI,EAAI,IACtB,GAAQ,GAAW,IAAQ,EAAM,KAAK,CAAC,IAAM,GAAS,GAAS,KAC/D,GAAQ,IAAU,GAAQ,IAAa,GAAQ,IAAM,CAAC,EAAM,SAAW,EAAM,SAAS,CAAM,GAC9F,EAAM,YAAY,CAAM,CAC5B,EAAG,CAAC,WAAY,EAAI,CAAC,EAEf,GAAc,GAAI,GAAkB,CAAC,EAAO,IAAU,CAC1D,GAAI,CAAC,QAAQ,EACb,GAAI,IAAQ,IAAQ,GAAQ,KAC1B,GAAM,UACF,GAAQ,EAAM,MAAM,CACtB,EAAM,UACN,GAAI,GAAa,CAAC,EAAM,SAAW,EAAM,SAAS,CAAM,EACxD,EAAM,YAAY,EAAa,EAAS,EAAY,EAG1D,EAAG,CAAC,WAAY,EAAI,CAAC,EAEf,GAAc,GAAU,CAC5B,uBAAwB,EAAK,SAC7B,yFAA0F,EAAK,eAC/F,kDAAmD,EAAK,gBACxD,uCAAwC,EAAK,kBAC7C,qBAAsB,EAAK,cAC3B,uBAAwB,EAAK,QAC7B,eAAgB,EAAK,QAAQ,EAAK,MAAM,EACxC,MAAO,EAAK,KACZ,eAAgB,EAAK,KACrB,KAAM,EAAK,KACX,KAAM,EAAK,KACX,KAAM,EAAK,SACX,aAAc,EAAK,aACnB,oEAAqE,EAAK,SAAS,EAAK,YAAY,EACpG,mBAAoB,EAAK,WAAW,EAAK,YAAY,EACrD,MAAO,EAAK,UACZ,aAAc,EAAK,aACnB,oBAAqB,EAAK,QAAQ,EAAK,YAAY,EACnD,+CAAgD,EAAK,SAAS,EAAK,YAAY,EAC/E,yCAA0C,EAAK,SAAS,EAAK,WAAW,EAAK,YAAY,CAAC,EAC1F,sCAAuC,EAAK,WAAW,EAAK,SAAS,EACrE,mBAAoB,EAAK,WAAW,EAAK,YAAY,EACrD,0BAA2B,EAAK,WAAW,EAAK,QAAQ,EAAK,YAAY,CAAC,EAC1E,SAAU,EAAK,eACf,YAAa,EAAK,YAClB,aAAc,EAAK,aACnB,OAAQ,EAAK,OACb,OAAQ,EAAK,OACb,OAAQ,EAAK,OACb,QAAS,EAAK,mBACd,QAAS,EAAK,cACd,MAAO,EAAK,gBACZ,UAAW,EAAK,gBAChB,OAAQ,EAAK,OACb,OAAQ,EAAK,mBACb,MAAO,EAAK,SAAS,EAAK,WAAW,EACrC,WAAY,EAAK,YACjB,MAAO,EAAK,MACZ,MAAO,EAAK,cACZ,MAAO,EAAK,MACZ,sCAAuC,EAAK,QAAQ,EAAK,KAAK,EAC9D,IAAK,EAAK,cACV,MAAO,EAAK,UACZ,IAAK,EAAK,KAEV,SAAU,EAAK,SACf,eAAgB,EAAK,WAAW,EAAK,QAAQ,EAC7C,0DAA2D,EAAK,kBAChE,4CAA6C,EAAK,SAClD,wBAAyB,EAAK,gBAE9B,kBAAmB,EAAK,eACxB,QAAS,EAAK,QACd,4DAA6D,EAAK,aAClE,kCAAmC,EAAK,QACxC,4DAA6D,EAAK,cAClE,2BAA4B,EAAK,SAAS,EAAK,OAAO,CACxD,CAAC,EAGK,GAAkB,CAAC,UAAU,KAAK,OAAO,GAAI,GAAG,GAAI,KAAK,GAAI,QAAQ,GAAI,MAAM,GAAI,SAAS,GAAI,QAAQ,GAAI,KAAK,GAAI,KAAK,GAAI,MAAM,GAAI,KAAK,GAAI,KAAK,GAAI,OAAO,GAAI,MAAM,GAAI,IAAI,IAAK,OAAO,IAAK,MAAM,IAAK,MAAM,IAAK,MAAM,IAAK,OAAO,IAAK,QAAQ,IAAK,UAAU,IAAK,SAAS,IAAK,WAAW,IAAK,UAAU,IAAK,GAAG,IAAK,MAAM,IAAK,OAAO,IAAK,MAAM,IAAK,OAAO,IAAK,MAAM,IAAK,GAAG,IAAK,SAAS,IAAK,WAAW,IAAK,KAAK,IAAK,IAAI,IAAK,IAAI,IAAK,UAAU,IAAK,KAAK,IAAK,UAAU,IAAK,OAAO,IAAK,QAAQ,IAAK,OAAO,IAAK,IAAI,IAAK,GAAG,IAAK,MAAM,IAAK,KAAK,IAAK,GAAG,IAAK,GAAG,IAAK,KAAK,IAAK,OAAO,IAAK,KAAK,IAAK,IAAI,IAAK,MAAM,IAAK,QAAQ,IAAK,OAAO,IAAK,MAAM,IAAK,MAAM,IAAK,SAAS,IAAK,SAAS,GAAG,EAC7rB,GAAY,CAAC,UAAU,KAAK,MAAM,IAAK,IAAI,IAAK,IAAI,IAAK,OAAO,IAAK,QAAQ,IAAK,UAAU,IAAK,OAAO,IAAK,SAAS,IAAK,SAAS,IAAK,SAAS,IAAK,SAAS,IAAK,IAAI,GAAG,EAC5K,GAAgB,CAAC,UAAU,KAAK,IAAI,GAAG,EACvC,GAAS,EAAS,YAAY,CAClC,QAAS,GACT,OAAQ,i4dACR,UAAW,spnBACX,KAAM,4hZACN,UAAW,o4FACX,QAAS,IACT,QAAS,GACT,UAAW,CACT,CAAC,QAAS,IAAI,EAAE,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,YAAY,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,aAAa,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,WAAW,EACtX,CAAC,WAAY,GAAG,qBAAqB,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,cAAc,IAAI,8BAA8B,EAC9G,CAAC,WAAY,GAAG,mBAAmB,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,+BAA+B,IAAI,WAAW,GAE5G,YAAa,CAAC,EAAW,EACzB,aAAc,CAAC,EAAE,EAAE,EAAE,GAAG,EACxB,gBAAiB,GACjB,UAAW,6wdACX,WAAY,CAAC,GAAa,GAAa,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAiB,GAAI,GAAgB,6PAA8P,IAAK,GAAG,EAAG,GAAI,GAAgB,kCAAmC,GAAI,GAAG,CAAC,EAC5b,SAAU,CAAC,OAAS,CAAC,EAAE,CAAC,EAAE,iBAAmB,CAAC,EAAE,GAAG,EAAE,gBAAkB,CAAC,EAAE,GAAG,CAAC,EAC9E,SAAU,CAAC,IAAK,MAAO,GAAI,KAAK,EAChC,mBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAClD,YAAa,CAAC,CAAC,KAAM,IAAK,IAAK,GAAS,GAAgB,IAAU,EAAE,EAAE,CAAC,KAAM,IAAK,IAAK,GAAS,GAAU,IAAU,EAAE,EAAE,CAAC,KAAM,GAAI,IAAK,GAAS,GAAc,IAAU,EAAE,CAAC,EAC5K,UAAW,KACb,CAAC,ECpIK,GAAW,CACA,EAAkB,yCAA2C,CACtE,MAAO,WACP,OAAQ,aACR,KAAM,UACT,EACY,EAAkB,qEAAuE,CAClG,MAAO,MACP,OAAQ,OACR,KAAM,UACT,EACY,EAAkB,gDAAkD,CAC7E,MAAO,MACP,OAAQ,UACR,KAAM,UACT,EACY,EAAkB,4BAA8B,CACzD,MAAO,KACP,OAAQ,OACR,KAAM,UACT,EACY,EAAkB,yBAA2B,CACtD,MAAO,QACP,OAAQ,OACR,KAAM,UACT,EACY,EAAkB;AAAA;AAAA;AAAA;AAAA,GAAgD,CAC3E,MAAO,MACP,OAAQ,gBACR,KAAM,UACT,EACY,EAAkB,sBAAwB,CACnD,MAAO,KACP,OAAQ,QACR,KAAM,UACT,EACY,EAAkB;AAAA;AAAA;AAAA;AAAA,GAAyC,CACpE,MAAO,KACP,OAAQ,eACR,KAAM,UACT,EACY,EAAkB;AAAA;AAAA;AAAA;AAAA,GAAgE,CAC3F,MAAO,QACP,OAAQ,aACR,KAAM,UACT,EACY,EAAkB,0CAA6C,CACxE,MAAO,SACP,OAAQ,QACR,KAAM,UACT,EACY,EAAkB,uCAA0C,CACrE,MAAO,SACP,OAAQ,UACR,KAAM,UACT,CACL,EAEM,EAAqB,GAAI,IACzB,GAA0B,GAAI,KAAI,CACpC,SAAU,QACV,qBAAsB,sBAAuB,gBAAiB,oBAC9D,cACJ,CAAC,EACD,WAAe,EAAM,CACjB,MAAO,CAAC,EAAM,IAAQ,CAClB,GAAI,GAAK,EAAK,KAAK,SAAS,oBAAoB,EAChD,MAAI,IACA,EAAI,EAAI,CAAI,EACT,GAEf,CACA,KAAM,IAAkB,CAAC,qBAAqB,EACxC,GAAoB,CACtB,oBAAkC,EAAM,UAAU,EAClD,iBAA+B,EAAM,OAAO,EAC5C,gBAAiB,IAAM,GACvB,gBAA8B,EAAM,UAAU,EAC9C,qBAAmC,EAAM,MAAM,EAC/C,qBAAmC,EAAM,WAAW,EACpD,mBAAmB,EAAM,EAAK,CAAE,AAAK,EAAK,aAAa,EAAe,GAClE,EAAI,EAAM,UAAU,GACxB,eAAe,EAAM,EAAK,CAAE,EAAI,EAAM,MAAM,GAC5C,UAAW,IACf,EACA,YAAkB,EAAK,EAAM,CACzB,GAAI,GAAS,EAAM,IAAI,CAAI,EAC3B,GAAI,EACA,MAAO,GACX,GAAI,GAAc,GAAI,EAAM,GAC5B,WAAa,EAAM,EAAM,CACrB,GAAI,GAAO,EAAI,YAAY,EAAK,KAAM,EAAK,EAAE,EAC7C,EAAY,KAAK,CAAE,MAAO,EAAM,OAAM,EAE1C,SAAK,OAAO,GAAS,gBAAgB,EAAE,QAAQ,GAAQ,CACnD,GAAI,EACA,EAAM,WAED,EAAK,KAAM,CAChB,GAAI,GAAS,GAAkB,EAAK,MACpC,GAAI,GAAU,EAAO,EAAM,CAAG,GAAK,GAAW,IAAI,EAAK,IAAI,EACvD,MAAO,WAEN,EAAK,GAAK,EAAK,KAAO,KAAM,CAEjC,OAAS,KAAK,IAAS,EAAK,EAAK,IAAI,EACjC,EAAY,KAAK,CAAC,EACtB,MAAO,IAEd,EACD,EAAM,IAAI,EAAM,CAAW,EACpB,CACX,CACA,KAAM,GAAa,wCACb,EAAe,CACjB,iBAAkB,SAAU,SAC5B,cAAe,eACf,qBAAsB,iBAAkB,QACxC,qBAAsB,eACtB,4BAA6B,qBACjC,EAKA,YAA+B,EAAS,CACpC,GAAI,GAAQ,EAAW,EAAQ,KAAK,EAAE,aAAa,EAAQ,IAAK,EAAE,EAClE,GAAI,EAAa,QAAQ,EAAM,IAAI,EAAI,GACnC,MAAO,MACX,GAAI,GAAS,EAAM,MAAQ,gBACvB,EAAM,GAAK,EAAM,KAAO,IAAM,EAAW,KAAK,EAAQ,MAAM,SAAS,EAAM,KAAM,EAAM,EAAE,CAAC,EAC9F,GAAI,CAAC,GAAU,CAAC,EAAQ,SACpB,MAAO,MACX,GAAI,GAAU,GACd,OAAS,GAAM,EAAO,EAAK,EAAM,EAAI,OACjC,AAAI,GAAW,IAAI,EAAI,IAAI,GACvB,GAAU,EAAQ,OAAO,GAAS,EAAQ,MAAM,IAAK,CAAG,CAAC,GAEjE,MAAO,CACH,UACA,KAAM,EAAS,EAAM,KAAO,EAAQ,IACpC,SAAU,EAElB,CACA,WAAiB,EAAM,EAAQ,EAAM,CACjC,GAAI,GACJ,GAAI,GAAO,GACX,OAAS,CACL,GAAI,GAAM,EAAO,WAAY,EAC7B,GAAK,AAA0C,GAAI,MAAS,eACxD,SAAK,KAAK,EAAK,CAAG,CAAC,EACZ,CAAE,KAAM,EAAK,UAAW,QAE9B,GAAK,AAA0C,GAAI,MAAS,oBAAwB,IAAM,EAAO,EAAI,aAAgB,MAAQ,IAAO,OAAS,OAAS,EAAG,OAAS,eACnK,EAAK,KAAK,EAAK,CAAI,CAAC,EACpB,EAAS,MAGT,OAAO,MAGnB,CAWA,YAAwB,EAAS,CAC7B,GAAI,GAAO,AAAC,GAAS,EAAQ,MAAM,IAAI,YAAY,EAAK,KAAM,EAAK,EAAE,EACjE,EAAQ,EAAW,EAAQ,KAAK,EAAE,aAAa,EAAQ,IAAK,EAAE,EAClE,MAAI,GAAM,MAAQ,eACP,EAAQ,EAAM,EAAM,OAAQ,EAAK,CAAK,CAAC,EAEzC,EAAa,QAAQ,EAAM,IAAI,EAAI,GACjC,KAEF,EAAM,MAAQ,gBAAkB,EAAM,GAAK,EAAM,KAAO,IAAM,EAAW,KAAK,EAAK,CAAK,CAAC,EACvF,CAAE,KAAM,GAAI,KAAM,EAAK,CAAK,GAE7B,GAAM,MAAQ,KAAO,EAAM,MAAQ,OAAS,EAAM,OAAO,MAAQ,mBAChE,EAAQ,EAAM,EAAM,OAAQ,EAAE,EAEhC,EAAM,MAAQ,mBACZ,EAAQ,EAAM,EAAO,EAAE,EAGvB,EAAQ,SAAW,CAAE,KAAM,GAAI,KAAM,IAAO,IAE3D,CACA,YAAsC,EAAK,EAAK,CAC5C,GAAI,GAAU,GAAI,EAAO,GAAI,KAC7B,OAAS,GAAQ,GAAI,IAAS,CAC1B,OAAS,KAAS,QAAO,qBAAuB,OAAO,MAAM,CAAG,EAAG,CAC/D,GAAI,EAAK,IAAI,CAAI,EACb,SACJ,EAAK,IAAI,CAAI,EACb,GAAI,GACJ,GAAI,CACA,EAAQ,EAAI,QAEhB,CACI,SAEJ,EAAQ,KAAK,CACT,MAAO,EACP,KAAM,MAAO,IAAS,WAAc,SAAS,KAAK,CAAI,EAAI,QAAU,EAAM,WAAa,SACjF,EAAM,WAAa,WACzB,MAAO,CAAC,EACX,EAEL,GAAI,GAAO,OAAO,eAAe,CAAG,EACpC,GAAI,CAAC,EACD,MAAO,GACX,EAAM,EAEd,CAOA,YAA+B,EAAO,CAClC,GAAI,GAAQ,GAAI,KAChB,MAAO,AAAC,IAAY,CAChB,GAAI,GAAO,GAAe,CAAO,EACjC,GAAI,CAAC,EACD,MAAO,MACX,GAAI,GAAS,EACb,OAAS,KAAQ,GAAK,KAElB,GADA,EAAS,EAAO,GACZ,CAAC,EACD,MAAO,MAEf,GAAI,GAAU,EAAM,IAAI,CAAM,EAC9B,MAAK,IACD,EAAM,IAAI,EAAQ,EAAU,GAA6B,EAAQ,CAAC,EAAK,KAAK,MAAM,CAAC,EAChF,CACH,KAAM,EAAQ,IAAM,EAAK,KAAK,OAC9B,UACA,SAAU,GAGtB,CAOK,KAAC,GAAkC,GAAW,OAAO,CACtD,KAAM,aACN,OAAqB,GAAO,UAAU,CAClC,MAAO,CACU,GAAe,IAAI,CAC5B,YAA0B,EAAgB,CAAE,OAAQ,iBAAkB,EACtE,aAA2B,EAAgB,CAAE,OAAQ,4BAA6B,EAClF,iBAAkB,GAClB,WAAY,GAAW,CACnB,GAAI,GAAQ,EAAQ,UAAW,EAAS,SAAS,KAAK,CAAK,EAAG,EAAS,uBAAuB,KAAK,CAAK,EACxG,MAAO,GAAQ,WAAc,GAAS,EAAI,EAAS,EAAI,GAAK,EAAQ,MAExE,MAAoB,GAAgB,CAAE,QAAS,IAAK,EACpD,cAAe,GAAM,EAAG,WAAa,EAAG,KACxC,8BAA+B,IAAM,KACrC,qBAAmC,EAAgB,CAAE,OAAQ,KAAM,EACnE,WAAW,EAAS,CAChB,GAAI,GAAS,UAAU,KAAK,EAAQ,SAAS,EAC7C,MAAO,GAAQ,WAAW,EAAQ,KAAK,IAAI,EAAK,GAAS,EAAI,EAAQ,OAEzE,UAAU,EAAS,CACf,GAAI,GAAS,QAAQ,KAAK,EAAQ,SAAS,EAC3C,MAAO,GAAQ,WAAW,EAAQ,KAAK,IAAI,EAAK,GAAS,EAAI,EAAQ,OAEzE,+BAA+B,EAAS,CACpC,MAAO,GAAQ,OAAO,EAAQ,KAAK,IAAI,EAAI,EAAQ,MAE1D,EACY,GAAa,IAAI,CAC1B,uEAAwE,GACxE,aAAa,EAAM,CAAE,MAAO,CAAE,KAAM,EAAK,KAAO,EAAG,GAAI,EAAK,GAAK,IACpE,GAER,EACD,aAAc,CACV,cAAe,CAAE,SAAU,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,GAAG,GACxD,cAAe,CAAE,KAAM,KAAM,MAAO,CAAE,KAAM,KAAM,MAAO,OACzD,cAAe,oCACf,UAAW,IAEnB,CAAC,EACK,GAAiB,CACnB,KAAM,GAAQ,OAAO,KAAK,EAAK,IAAI,EACnC,MAAoB,GAAoB,CAAE,cAAe,CAAE,MAAO,CAAE,KAAM,MAAO,MAAO,QAAW,CACvG,EAIM,GAAkC,EAAmB,UAAU,CAAE,QAAS,MAAQ,YAAY,EAI9F,GAA2B,EAAmB,UAAU,CAC1D,QAAS,MACT,MAAO,CAAc,GAAgB,IAAI,GAAK,EAAE,MAAQ,CAAC,EAAc,EAAI,MAAS,CAAC,CACzF,CAAC,EAIK,GAA2B,EAAmB,UAAU,CAC1D,QAAS,SACT,MAAO,CAAc,GAAgB,IAAI,GAAK,EAAE,MAAQ,CAAC,EAAc,EAAI,MAAS,CAAC,CACzF,EAAG,YAAY,EACT,GAAwB,0JAA0J,MAAM,GAAG,EAAE,IAAI,GAAO,EAAE,MAAO,EAAI,KAAM,WAAY,EAK7O,YAAoB,EAAS,GAAI,CAC7B,GAAI,GAAO,EAAO,IAAO,EAAO,WAAa,GAAc,GACrD,EAAO,WAAa,GAAqB,EAC/C,MAAO,IAAI,IAAgB,EAAM,CAC7B,EAAmB,KAAK,GAAG,CACvB,aAAc,GAAQ,EAAc,GAAiB,GAAS,OAAO,EAAQ,CAAC,CAAC,EAClF,EACD,EAAmB,KAAK,GAAG,CACvB,aAAc,GACjB,EACD,EAAO,IAAM,GAAgB,GAChC,CACL,CACA,YAAqB,EAAM,CACvB,OAAS,CACL,GAAI,EAAK,MAAQ,cAAgB,EAAK,MAAQ,qBAAuB,EAAK,MAAQ,iBAC9E,MAAO,GACX,GAAI,CAAC,EAAK,OACN,MAAO,MACX,EAAO,EAAK,OAEpB,CACA,WAAqB,EAAK,EAAM,EAAM,EAAI,OAAQ,CAC9C,OAAS,GAAiD,GAAK,WAAY,EAAI,EAAK,EAAG,YACnF,GAAI,EAAG,MAAQ,iBAAmB,EAAG,MAAQ,cAAgB,EAAG,MAAQ,qBACpE,EAAG,MAAQ,sBACX,MAAO,GAAI,YAAY,EAAG,KAAM,KAAK,IAAI,EAAG,GAAI,CAAG,CAAC,EAE5D,MAAO,EACX,CACA,KAAM,IAAU,MAAO,YAAa,UAAyB,YAAY,KAAK,UAAU,SAAS,EAK3F,GAA6B,GAAW,aAAa,GAAG,CAAC,EAAM,EAAM,EAAI,IAAS,CACpF,GAAK,IAAU,EAAK,UAAY,EAAK,qBAAuB,EAAK,MAAM,UACnE,GAAQ,GAAO,GAAQ,KAAO,GAAQ,KACtC,CAAC,EAAmB,WAAW,EAAK,MAAO,EAAM,EAAE,EACnD,MAAO,GACX,GAAI,CAAE,SAAU,EACZ,EAAU,EAAM,cAAc,GAAS,CACvC,GAAI,GAAI,EACR,GAAI,CAAE,QAAS,EAAO,EAAS,EAAW,CAAK,EAAE,aAAa,EAAM,EAAE,EAAG,EAGzE,GAFI,EAAO,MAAQ,eACf,GAAS,EAAO,QAChB,GAAQ,KAAO,EAAO,MAAQ,iBAC9B,MAAO,CAAE,MAAO,EAAgB,OAAO,EAAO,CAAC,EAAG,QAAS,CAAE,KAAM,EAAM,OAAQ,SAEhF,GAAI,GAAQ,KAAO,EAAO,MAAQ,iBAAkB,CACrD,GAAI,GAAQ,EAAO,OAAQ,EAAqD,GAAM,OACtF,GAAI,EAAM,MAAQ,EAAO,GAAO,IAAK,EAAK,aAAe,MAAQ,IAAO,OAAS,OAAS,EAAG,OAAS,aACjG,GAAO,EAAY,EAAM,IAAiD,GAAK,WAAY,CAAI,GAAI,CACpG,GAAI,GAAS,IAAI,KACjB,MAAO,CAAE,MAAO,EAAgB,OAAO,EAAO,EAAO,MAAM,EAAG,QAAS,CAAE,KAAM,EAAM,oBAGpF,GAAQ,IAAK,CAClB,GAAI,GAAU,GAAY,CAAM,EAChC,GAAI,GAAa,IAAK,EAAQ,aAAe,MAAQ,IAAO,OAAS,OAAS,EAAG,OAAS,aACtF,EAAM,SAAS,EAAM,EAAO,CAAC,GAAK,MACjC,GAAO,EAAY,EAAM,IAAK,EAAS,CAAI,GAC5C,MAAO,CAAE,MAAO,EAAgB,OAAO,EAAO,CAAC,EAAG,QAAS,CAAE,KAAM,EAAM,OAAQ,MAAM,OAE/F,MAAO,CAAE,SACZ,EACD,MAAI,GAAQ,QAAQ,MACT,GACX,GAAK,SAAS,EAAS,CAAE,UAAW,aAAc,eAAgB,GAAM,EACjE,GACX,CAAC,EAgBD,YAAgB,EAAQ,EAAQ,CAC5B,MAAK,IACD,GAAS,CACL,cAAe,CAAE,YAAa,KAAM,WAAY,UAChD,IAAK,CAAE,QAAS,GAAM,KAAM,GAAM,IAAK,GAAM,OAAQ,GAAM,OAAQ,GAAM,OAAQ,IACjF,MAAO,IAEX,EAAO,WAAW,QAAQ,CAAC,EAAM,IAAS,CACtC,AAAI,EAAK,KAAK,KAAK,aACf,GAAO,MAAM,GAAQ,GAC5B,GAEE,AAAC,GAAS,CACb,GAAI,CAAE,SAAU,EAAM,EAAQ,GAC9B,OAAS,CAAE,OAAM,OAAQ,GAAmB,YAAY,CAAK,EAAG,CAC5D,GAAI,GAAW,EAAM,IAAI,OAAO,CAAI,EAAG,EAAS,CAAE,KAAM,EAAS,OAAS,EAAG,IAAK,EAAO,EAAS,KAAM,IAAK,GAC7G,OAAS,KAAK,GAAO,OAAO,EAAM,SAAS,EAAM,CAAE,EAAG,CAAM,EACxD,EAAM,KAAK,GAAoB,EAAG,EAAM,IAAK,CAAM,CAAC,EAE5D,MAAO,GAEf,CACA,YAAgB,EAAM,EAAK,EAAK,EAAQ,CACpC,MAAO,GAAI,KAAK,EAAO,EAAO,IAAI,EAAE,KAAO,EAAO,IAAQ,EAAI,EAAO,IAAM,EAAI,GACnF,CACA,YAA6B,EAAO,EAAK,EAAQ,CAC7C,GAAI,GAAQ,GAAO,EAAM,KAAM,EAAM,OAAQ,EAAK,CAAM,EACpD,EAAS,CACT,KAAM,EACN,GAAI,EAAM,SAAW,MAAQ,EAAM,WAAa,EAAI,GAAO,EAAM,QAAS,EAAM,UAAW,EAAK,CAAM,EAAI,EAC1G,QAAS,EAAM,QACf,OAAQ,EAAM,OAAS,UAAY,EAAM,OAAS,SAClD,SAAU,EAAM,UAAY,EAAI,UAAY,SAEhD,GAAI,EAAM,IAAK,CACX,GAAI,CAAE,QAAO,QAAS,EAAM,IAAK,EAAO,EAAM,GAAK,EAAO,IAAM,EAAO,EAAK,EAAM,GAAK,EAAO,IAAM,EACpG,EAAO,QAAU,CAAC,CACV,KAAM,MACN,MAAM,EAAM,EAAO,CACf,EAAK,SAAS,CAAE,QAAS,CAAE,KAAM,EAAQ,EAAM,GAAI,EAAQ,EAAI,OAAQ,GAAQ,eAAgB,GAAM,GAE5G,EAET,MAAO,EACX"}