qidian-vue-ui 1.1.58 → 1.1.60

package/dist/node_modules/.pnpm/@codemirror_language@6.12.1/node_modules/@codemirror/language/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/@codemirror+language@6.12.1/node_modules/@codemirror/language/dist/index.js"],"sourcesContent":["import { NodeProp, IterMode, Tree, TreeFragment, Parser, NodeType, NodeSet } from '@lezer/common';\nimport { StateEffect, StateField, Facet, EditorState, countColumn, combineConfig, RangeSet, RangeSetBuilder, Prec } from '@codemirror/state';\nimport { ViewPlugin, logException, EditorView, Decoration, WidgetType, gutter, GutterMarker, Direction } from '@codemirror/view';\nimport { tags, tagHighlighter, highlightTree, styleTags } from '@lezer/highlight';\nimport { StyleModule } from 'style-mod';\n\nvar _a;\n/**\nNode prop stored in a parser's top syntax node to provide the\nfacet that stores language-specific data for that language.\n*/\nconst languageDataProp = /*@__PURE__*/new NodeProp();\n/**\nHelper function to define a facet (to be added to the top syntax\nnode(s) for a language via\n[`languageDataProp`](https://codemirror.net/6/docs/ref/#language.languageDataProp)), that will be\nused to associate language data with the language. You\nprobably only need this when subclassing\n[`Language`](https://codemirror.net/6/docs/ref/#language.Language).\n*/\nfunction defineLanguageFacet(baseData) {\n    return Facet.define({\n        combine: baseData ? values => values.concat(baseData) : undefined\n    });\n}\n/**\nSyntax node prop used to register sublanguages. Should be added to\nthe top level node type for the language.\n*/\nconst sublanguageProp = /*@__PURE__*/new NodeProp();\n/**\nA language object manages parsing and per-language\n[metadata](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt). Parse data is\nmanaged as a [Lezer](https://lezer.codemirror.net) tree. The class\ncan be used directly, via the [`LRLanguage`](https://codemirror.net/6/docs/ref/#language.LRLanguage)\nsubclass for [Lezer](https://lezer.codemirror.net/) LR parsers, or\nvia the [`StreamLanguage`](https://codemirror.net/6/docs/ref/#language.StreamLanguage) subclass\nfor stream parsers.\n*/\nclass Language {\n    /**\n    Construct a language object. If you need to invoke this\n    directly, first define a data facet with\n    [`defineLanguageFacet`](https://codemirror.net/6/docs/ref/#language.defineLanguageFacet), and then\n    configure your parser to [attach](https://codemirror.net/6/docs/ref/#language.languageDataProp) it\n    to the language's outer syntax node.\n    */\n    constructor(\n    /**\n    The [language data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) facet\n    used for this language.\n    */\n    data, parser, extraExtensions = [], \n    /**\n    A language name.\n    */\n    name = \"\") {\n        this.data = data;\n        this.name = name;\n        // Kludge to define EditorState.tree as a debugging helper,\n        // without the EditorState package actually knowing about\n        // languages and lezer trees.\n        if (!EditorState.prototype.hasOwnProperty(\"tree\"))\n            Object.defineProperty(EditorState.prototype, \"tree\", { get() { return syntaxTree(this); } });\n        this.parser = parser;\n        this.extension = [\n            language.of(this),\n            EditorState.languageData.of((state, pos, side) => {\n                let top = topNodeAt(state, pos, side), data = top.type.prop(languageDataProp);\n                if (!data)\n                    return [];\n                let base = state.facet(data), sub = top.type.prop(sublanguageProp);\n                if (sub) {\n                    let innerNode = top.resolve(pos - top.from, side);\n                    for (let sublang of sub)\n                        if (sublang.test(innerNode, state)) {\n                            let data = state.facet(sublang.facet);\n                            return sublang.type == \"replace\" ? data : data.concat(base);\n                        }\n                }\n                return base;\n            })\n        ].concat(extraExtensions);\n    }\n    /**\n    Query whether this language is active at the given position.\n    */\n    isActiveAt(state, pos, side = -1) {\n        return topNodeAt(state, pos, side).type.prop(languageDataProp) == this.data;\n    }\n    /**\n    Find the document regions that were parsed using this language.\n    The returned regions will _include_ any nested languages rooted\n    in this language, when those exist.\n    */\n    findRegions(state) {\n        let lang = state.facet(language);\n        if ((lang === null || lang === void 0 ? void 0 : lang.data) == this.data)\n            return [{ from: 0, to: state.doc.length }];\n        if (!lang || !lang.allowsNesting)\n            return [];\n        let result = [];\n        let explore = (tree, from) => {\n            if (tree.prop(languageDataProp) == this.data) {\n                result.push({ from, to: from + tree.length });\n                return;\n            }\n            let mount = tree.prop(NodeProp.mounted);\n            if (mount) {\n                if (mount.tree.prop(languageDataProp) == this.data) {\n                    if (mount.overlay)\n                        for (let r of mount.overlay)\n                            result.push({ from: r.from + from, to: r.to + from });\n                    else\n                        result.push({ from: from, to: from + tree.length });\n                    return;\n                }\n                else if (mount.overlay) {\n                    let size = result.length;\n                    explore(mount.tree, mount.overlay[0].from + from);\n                    if (result.length > size)\n                        return;\n                }\n            }\n            for (let i = 0; i < tree.children.length; i++) {\n                let ch = tree.children[i];\n                if (ch instanceof Tree)\n                    explore(ch, tree.positions[i] + from);\n            }\n        };\n        explore(syntaxTree(state), 0);\n        return result;\n    }\n    /**\n    Indicates whether this language allows nested languages. The\n    default implementation returns true.\n    */\n    get allowsNesting() { return true; }\n}\n/**\n@internal\n*/\nLanguage.setState = /*@__PURE__*/StateEffect.define();\nfunction topNodeAt(state, pos, side) {\n    let topLang = state.facet(language), tree = syntaxTree(state).topNode;\n    if (!topLang || topLang.allowsNesting) {\n        for (let node = tree; node; node = node.enter(pos, side, IterMode.ExcludeBuffers | IterMode.EnterBracketed))\n            if (node.type.isTop)\n                tree = node;\n    }\n    return tree;\n}\n/**\nA subclass of [`Language`](https://codemirror.net/6/docs/ref/#language.Language) for use with Lezer\n[LR parsers](https://lezer.codemirror.net/docs/ref#lr.LRParser)\nparsers.\n*/\nclass LRLanguage extends Language {\n    constructor(data, parser, name) {\n        super(data, parser, [], name);\n        this.parser = parser;\n    }\n    /**\n    Define a language from a parser.\n    */\n    static define(spec) {\n        let data = defineLanguageFacet(spec.languageData);\n        return new LRLanguage(data, spec.parser.configure({\n            props: [languageDataProp.add(type => type.isTop ? data : undefined)]\n        }), spec.name);\n    }\n    /**\n    Create a new instance of this language with a reconfigured\n    version of its parser and optionally a new name.\n    */\n    configure(options, name) {\n        return new LRLanguage(this.data, this.parser.configure(options), name || this.name);\n    }\n    get allowsNesting() { return this.parser.hasWrappers(); }\n}\n/**\nGet the syntax tree for a state, which is the current (possibly\nincomplete) parse tree of the active\n[language](https://codemirror.net/6/docs/ref/#language.Language), or the empty tree if there is no\nlanguage available.\n*/\nfunction syntaxTree(state) {\n    let field = state.field(Language.state, false);\n    return field ? field.tree : Tree.empty;\n}\n/**\nTry to get a parse tree that spans at least up to `upto`. The\nmethod will do at most `timeout` milliseconds of work to parse\nup to that point if the tree isn't already available.\n*/\nfunction ensureSyntaxTree(state, upto, timeout = 50) {\n    var _a;\n    let parse = (_a = state.field(Language.state, false)) === null || _a === void 0 ? void 0 : _a.context;\n    if (!parse)\n        return null;\n    let oldVieport = parse.viewport;\n    parse.updateViewport({ from: 0, to: upto });\n    let result = parse.isDone(upto) || parse.work(timeout, upto) ? parse.tree : null;\n    parse.updateViewport(oldVieport);\n    return result;\n}\n/**\nQueries whether there is a full syntax tree available up to the\ngiven document position. If there isn't, the background parse\nprocess _might_ still be working and update the tree further, but\nthere is no guarantee of that—the parser will [stop\nworking](https://codemirror.net/6/docs/ref/#language.syntaxParserRunning) when it has spent a\ncertain amount of time or has moved beyond the visible viewport.\nAlways returns false if no language has been enabled.\n*/\nfunction syntaxTreeAvailable(state, upto = state.doc.length) {\n    var _a;\n    return ((_a = state.field(Language.state, false)) === null || _a === void 0 ? void 0 : _a.context.isDone(upto)) || false;\n}\n/**\nMove parsing forward, and update the editor state afterwards to\nreflect the new tree. Will work for at most `timeout`\nmilliseconds. Returns true if the parser managed get to the given\nposition in that time.\n*/\nfunction forceParsing(view, upto = view.viewport.to, timeout = 100) {\n    let success = ensureSyntaxTree(view.state, upto, timeout);\n    if (success != syntaxTree(view.state))\n        view.dispatch({});\n    return !!success;\n}\n/**\nTells you whether the language parser is planning to do more\nparsing work (in a `requestIdleCallback` pseudo-thread) or has\nstopped running, either because it parsed the entire document,\nbecause it spent too much time and was cut off, or because there\nis no language parser enabled.\n*/\nfunction syntaxParserRunning(view) {\n    var _a;\n    return ((_a = view.plugin(parseWorker)) === null || _a === void 0 ? void 0 : _a.isWorking()) || false;\n}\n/**\nLezer-style\n[`Input`](https://lezer.codemirror.net/docs/ref#common.Input)\nobject for a [`Text`](https://codemirror.net/6/docs/ref/#state.Text) object.\n*/\nclass DocInput {\n    /**\n    Create an input object for the given document.\n    */\n    constructor(doc) {\n        this.doc = doc;\n        this.cursorPos = 0;\n        this.string = \"\";\n        this.cursor = doc.iter();\n    }\n    get length() { return this.doc.length; }\n    syncTo(pos) {\n        this.string = this.cursor.next(pos - this.cursorPos).value;\n        this.cursorPos = pos + this.string.length;\n        return this.cursorPos - this.string.length;\n    }\n    chunk(pos) {\n        this.syncTo(pos);\n        return this.string;\n    }\n    get lineChunks() { return true; }\n    read(from, to) {\n        let stringStart = this.cursorPos - this.string.length;\n        if (from < stringStart || to >= this.cursorPos)\n            return this.doc.sliceString(from, to);\n        else\n            return this.string.slice(from - stringStart, to - stringStart);\n    }\n}\nlet currentContext = null;\n/**\nA parse context provided to parsers working on the editor content.\n*/\nclass ParseContext {\n    constructor(parser, \n    /**\n    The current editor state.\n    */\n    state, \n    /**\n    Tree fragments that can be reused by incremental re-parses.\n    */\n    fragments = [], \n    /**\n    @internal\n    */\n    tree, \n    /**\n    @internal\n    */\n    treeLen, \n    /**\n    The current editor viewport (or some overapproximation\n    thereof). Intended to be used for opportunistically avoiding\n    work (in which case\n    [`skipUntilInView`](https://codemirror.net/6/docs/ref/#language.ParseContext.skipUntilInView)\n    should be called to make sure the parser is restarted when the\n    skipped region becomes visible).\n    */\n    viewport, \n    /**\n    @internal\n    */\n    skipped, \n    /**\n    This is where skipping parsers can register a promise that,\n    when resolved, will schedule a new parse. It is cleared when\n    the parse worker picks up the promise. @internal\n    */\n    scheduleOn) {\n        this.parser = parser;\n        this.state = state;\n        this.fragments = fragments;\n        this.tree = tree;\n        this.treeLen = treeLen;\n        this.viewport = viewport;\n        this.skipped = skipped;\n        this.scheduleOn = scheduleOn;\n        this.parse = null;\n        /**\n        @internal\n        */\n        this.tempSkipped = [];\n    }\n    /**\n    @internal\n    */\n    static create(parser, state, viewport) {\n        return new ParseContext(parser, state, [], Tree.empty, 0, viewport, [], null);\n    }\n    startParse() {\n        return this.parser.startParse(new DocInput(this.state.doc), this.fragments);\n    }\n    /**\n    @internal\n    */\n    work(until, upto) {\n        if (upto != null && upto >= this.state.doc.length)\n            upto = undefined;\n        if (this.tree != Tree.empty && this.isDone(upto !== null && upto !== void 0 ? upto : this.state.doc.length)) {\n            this.takeTree();\n            return true;\n        }\n        return this.withContext(() => {\n            var _a;\n            if (typeof until == \"number\") {\n                let endTime = Date.now() + until;\n                until = () => Date.now() > endTime;\n            }\n            if (!this.parse)\n                this.parse = this.startParse();\n            if (upto != null && (this.parse.stoppedAt == null || this.parse.stoppedAt > upto) &&\n                upto < this.state.doc.length)\n                this.parse.stopAt(upto);\n            for (;;) {\n                let done = this.parse.advance();\n                if (done) {\n                    this.fragments = this.withoutTempSkipped(TreeFragment.addTree(done, this.fragments, this.parse.stoppedAt != null));\n                    this.treeLen = (_a = this.parse.stoppedAt) !== null && _a !== void 0 ? _a : this.state.doc.length;\n                    this.tree = done;\n                    this.parse = null;\n                    if (this.treeLen < (upto !== null && upto !== void 0 ? upto : this.state.doc.length))\n                        this.parse = this.startParse();\n                    else\n                        return true;\n                }\n                if (until())\n                    return false;\n            }\n        });\n    }\n    /**\n    @internal\n    */\n    takeTree() {\n        let pos, tree;\n        if (this.parse && (pos = this.parse.parsedPos) >= this.treeLen) {\n            if (this.parse.stoppedAt == null || this.parse.stoppedAt > pos)\n                this.parse.stopAt(pos);\n            this.withContext(() => { while (!(tree = this.parse.advance())) { } });\n            this.treeLen = pos;\n            this.tree = tree;\n            this.fragments = this.withoutTempSkipped(TreeFragment.addTree(this.tree, this.fragments, true));\n            this.parse = null;\n        }\n    }\n    withContext(f) {\n        let prev = currentContext;\n        currentContext = this;\n        try {\n            return f();\n        }\n        finally {\n            currentContext = prev;\n        }\n    }\n    withoutTempSkipped(fragments) {\n        for (let r; r = this.tempSkipped.pop();)\n            fragments = cutFragments(fragments, r.from, r.to);\n        return fragments;\n    }\n    /**\n    @internal\n    */\n    changes(changes, newState) {\n        let { fragments, tree, treeLen, viewport, skipped } = this;\n        this.takeTree();\n        if (!changes.empty) {\n            let ranges = [];\n            changes.iterChangedRanges((fromA, toA, fromB, toB) => ranges.push({ fromA, toA, fromB, toB }));\n            fragments = TreeFragment.applyChanges(fragments, ranges);\n            tree = Tree.empty;\n            treeLen = 0;\n            viewport = { from: changes.mapPos(viewport.from, -1), to: changes.mapPos(viewport.to, 1) };\n            if (this.skipped.length) {\n                skipped = [];\n                for (let r of this.skipped) {\n                    let from = changes.mapPos(r.from, 1), to = changes.mapPos(r.to, -1);\n                    if (from < to)\n                        skipped.push({ from, to });\n                }\n            }\n        }\n        return new ParseContext(this.parser, newState, fragments, tree, treeLen, viewport, skipped, this.scheduleOn);\n    }\n    /**\n    @internal\n    */\n    updateViewport(viewport) {\n        if (this.viewport.from == viewport.from && this.viewport.to == viewport.to)\n            return false;\n        this.viewport = viewport;\n        let startLen = this.skipped.length;\n        for (let i = 0; i < this.skipped.length; i++) {\n            let { from, to } = this.skipped[i];\n            if (from < viewport.to && to > viewport.from) {\n                this.fragments = cutFragments(this.fragments, from, to);\n                this.skipped.splice(i--, 1);\n            }\n        }\n        if (this.skipped.length >= startLen)\n            return false;\n        this.reset();\n        return true;\n    }\n    /**\n    @internal\n    */\n    reset() {\n        if (this.parse) {\n            this.takeTree();\n            this.parse = null;\n        }\n    }\n    /**\n    Notify the parse scheduler that the given region was skipped\n    because it wasn't in view, and the parse should be restarted\n    when it comes into view.\n    */\n    skipUntilInView(from, to) {\n        this.skipped.push({ from, to });\n    }\n    /**\n    Returns a parser intended to be used as placeholder when\n    asynchronously loading a nested parser. It'll skip its input and\n    mark it as not-really-parsed, so that the next update will parse\n    it again.\n    \n    When `until` is given, a reparse will be scheduled when that\n    promise resolves.\n    */\n    static getSkippingParser(until) {\n        return new class extends Parser {\n            createParse(input, fragments, ranges) {\n                let from = ranges[0].from, to = ranges[ranges.length - 1].to;\n                let parser = {\n                    parsedPos: from,\n                    advance() {\n                        let cx = currentContext;\n                        if (cx) {\n                            for (let r of ranges)\n                                cx.tempSkipped.push(r);\n                            if (until)\n                                cx.scheduleOn = cx.scheduleOn ? Promise.all([cx.scheduleOn, until]) : until;\n                        }\n                        this.parsedPos = to;\n                        return new Tree(NodeType.none, [], [], to - from);\n                    },\n                    stoppedAt: null,\n                    stopAt() { }\n                };\n                return parser;\n            }\n        };\n    }\n    /**\n    @internal\n    */\n    isDone(upto) {\n        upto = Math.min(upto, this.state.doc.length);\n        let frags = this.fragments;\n        return this.treeLen >= upto && frags.length && frags[0].from == 0 && frags[0].to >= upto;\n    }\n    /**\n    Get the context for the current parse, or `null` if no editor\n    parse is in progress.\n    */\n    static get() { return currentContext; }\n}\nfunction cutFragments(fragments, from, to) {\n    return TreeFragment.applyChanges(fragments, [{ fromA: from, toA: to, fromB: from, toB: to }]);\n}\nclass LanguageState {\n    constructor(\n    // A mutable parse state that is used to preserve work done during\n    // the lifetime of a state when moving to the next state.\n    context) {\n        this.context = context;\n        this.tree = context.tree;\n    }\n    apply(tr) {\n        if (!tr.docChanged && this.tree == this.context.tree)\n            return this;\n        let newCx = this.context.changes(tr.changes, tr.state);\n        // If the previous parse wasn't done, go forward only up to its\n        // end position or the end of the viewport, to avoid slowing down\n        // state updates with parse work beyond the viewport.\n        let upto = this.context.treeLen == tr.startState.doc.length ? undefined\n            : Math.max(tr.changes.mapPos(this.context.treeLen), newCx.viewport.to);\n        if (!newCx.work(20 /* Work.Apply */, upto))\n            newCx.takeTree();\n        return new LanguageState(newCx);\n    }\n    static init(state) {\n        let vpTo = Math.min(3000 /* Work.InitViewport */, state.doc.length);\n        let parseState = ParseContext.create(state.facet(language).parser, state, { from: 0, to: vpTo });\n        if (!parseState.work(20 /* Work.Apply */, vpTo))\n            parseState.takeTree();\n        return new LanguageState(parseState);\n    }\n}\nLanguage.state = /*@__PURE__*/StateField.define({\n    create: LanguageState.init,\n    update(value, tr) {\n        for (let e of tr.effects)\n            if (e.is(Language.setState))\n                return e.value;\n        if (tr.startState.facet(language) != tr.state.facet(language))\n            return LanguageState.init(tr.state);\n        return value.apply(tr);\n    }\n});\nlet requestIdle = (callback) => {\n    let timeout = setTimeout(() => callback(), 500 /* Work.MaxPause */);\n    return () => clearTimeout(timeout);\n};\nif (typeof requestIdleCallback != \"undefined\")\n    requestIdle = (callback) => {\n        let idle = -1, timeout = setTimeout(() => {\n            idle = requestIdleCallback(callback, { timeout: 500 /* Work.MaxPause */ - 100 /* Work.MinPause */ });\n        }, 100 /* Work.MinPause */);\n        return () => idle < 0 ? clearTimeout(timeout) : cancelIdleCallback(idle);\n    };\nconst isInputPending = typeof navigator != \"undefined\" && ((_a = navigator.scheduling) === null || _a === void 0 ? void 0 : _a.isInputPending)\n    ? () => navigator.scheduling.isInputPending() : null;\nconst parseWorker = /*@__PURE__*/ViewPlugin.fromClass(class ParseWorker {\n    constructor(view) {\n        this.view = view;\n        this.working = null;\n        this.workScheduled = 0;\n        // End of the current time chunk\n        this.chunkEnd = -1;\n        // Milliseconds of budget left for this chunk\n        this.chunkBudget = -1;\n        this.work = this.work.bind(this);\n        this.scheduleWork();\n    }\n    update(update) {\n        let cx = this.view.state.field(Language.state).context;\n        if (cx.updateViewport(update.view.viewport) || this.view.viewport.to > cx.treeLen)\n            this.scheduleWork();\n        if (update.docChanged || update.selectionSet) {\n            if (this.view.hasFocus)\n                this.chunkBudget += 50 /* Work.ChangeBonus */;\n            this.scheduleWork();\n        }\n        this.checkAsyncSchedule(cx);\n    }\n    scheduleWork() {\n        if (this.working)\n            return;\n        let { state } = this.view, field = state.field(Language.state);\n        if (field.tree != field.context.tree || !field.context.isDone(state.doc.length))\n            this.working = requestIdle(this.work);\n    }\n    work(deadline) {\n        this.working = null;\n        let now = Date.now();\n        if (this.chunkEnd < now && (this.chunkEnd < 0 || this.view.hasFocus)) { // Start a new chunk\n            this.chunkEnd = now + 30000 /* Work.ChunkTime */;\n            this.chunkBudget = 3000 /* Work.ChunkBudget */;\n        }\n        if (this.chunkBudget <= 0)\n            return; // No more budget\n        let { state, viewport: { to: vpTo } } = this.view, field = state.field(Language.state);\n        if (field.tree == field.context.tree && field.context.isDone(vpTo + 100000 /* Work.MaxParseAhead */))\n            return;\n        let endTime = Date.now() + Math.min(this.chunkBudget, 100 /* Work.Slice */, deadline && !isInputPending ? Math.max(25 /* Work.MinSlice */, deadline.timeRemaining() - 5) : 1e9);\n        let viewportFirst = field.context.treeLen < vpTo && state.doc.length > vpTo + 1000;\n        let done = field.context.work(() => {\n            return isInputPending && isInputPending() || Date.now() > endTime;\n        }, vpTo + (viewportFirst ? 0 : 100000 /* Work.MaxParseAhead */));\n        this.chunkBudget -= Date.now() - now;\n        if (done || this.chunkBudget <= 0) {\n            field.context.takeTree();\n            this.view.dispatch({ effects: Language.setState.of(new LanguageState(field.context)) });\n        }\n        if (this.chunkBudget > 0 && !(done && !viewportFirst))\n            this.scheduleWork();\n        this.checkAsyncSchedule(field.context);\n    }\n    checkAsyncSchedule(cx) {\n        if (cx.scheduleOn) {\n            this.workScheduled++;\n            cx.scheduleOn\n                .then(() => this.scheduleWork())\n                .catch(err => logException(this.view.state, err))\n                .then(() => this.workScheduled--);\n            cx.scheduleOn = null;\n        }\n    }\n    destroy() {\n        if (this.working)\n            this.working();\n    }\n    isWorking() {\n        return !!(this.working || this.workScheduled > 0);\n    }\n}, {\n    eventHandlers: { focus() { this.scheduleWork(); } }\n});\n/**\nThe facet used to associate a language with an editor state. Used\nby `Language` object's `extension` property (so you don't need to\nmanually wrap your languages in this). Can be used to access the\ncurrent language on a state.\n*/\nconst language = /*@__PURE__*/Facet.define({\n    combine(languages) { return languages.length ? languages[0] : null; },\n    enables: language => [\n        Language.state,\n        parseWorker,\n        EditorView.contentAttributes.compute([language], state => {\n            let lang = state.facet(language);\n            return lang && lang.name ? { \"data-language\": lang.name } : {};\n        })\n    ]\n});\n/**\nThis class bundles a [language](https://codemirror.net/6/docs/ref/#language.Language) with an\noptional set of supporting extensions. Language packages are\nencouraged to export a function that optionally takes a\nconfiguration object and returns a `LanguageSupport` instance, as\nthe main way for client code to use the package.\n*/\nclass LanguageSupport {\n    /**\n    Create a language support object.\n    */\n    constructor(\n    /**\n    The language object.\n    */\n    language, \n    /**\n    An optional set of supporting extensions. When nesting a\n    language in another language, the outer language is encouraged\n    to include the supporting extensions for its inner languages\n    in its own set of support extensions.\n    */\n    support = []) {\n        this.language = language;\n        this.support = support;\n        this.extension = [language, support];\n    }\n}\n/**\nLanguage descriptions are used to store metadata about languages\nand to dynamically load them. Their main role is finding the\nappropriate language for a filename or dynamically loading nested\nparsers.\n*/\nclass LanguageDescription {\n    constructor(\n    /**\n    The name of this language.\n    */\n    name, \n    /**\n    Alternative names for the mode (lowercased, includes `this.name`).\n    */\n    alias, \n    /**\n    File extensions associated with this language.\n    */\n    extensions, \n    /**\n    Optional filename pattern that should be associated with this\n    language.\n    */\n    filename, loadFunc, \n    /**\n    If the language has been loaded, this will hold its value.\n    */\n    support = undefined) {\n        this.name = name;\n        this.alias = alias;\n        this.extensions = extensions;\n        this.filename = filename;\n        this.loadFunc = loadFunc;\n        this.support = support;\n        this.loading = null;\n    }\n    /**\n    Start loading the the language. Will return a promise that\n    resolves to a [`LanguageSupport`](https://codemirror.net/6/docs/ref/#language.LanguageSupport)\n    object when the language successfully loads.\n    */\n    load() {\n        return this.loading || (this.loading = this.loadFunc().then(support => this.support = support, err => { this.loading = null; throw err; }));\n    }\n    /**\n    Create a language description.\n    */\n    static of(spec) {\n        let { load, support } = spec;\n        if (!load) {\n            if (!support)\n                throw new RangeError(\"Must pass either 'load' or 'support' to LanguageDescription.of\");\n            load = () => Promise.resolve(support);\n        }\n        return new LanguageDescription(spec.name, (spec.alias || []).concat(spec.name).map(s => s.toLowerCase()), spec.extensions || [], spec.filename, load, support);\n    }\n    /**\n    Look for a language in the given array of descriptions that\n    matches the filename. Will first match\n    [`filename`](https://codemirror.net/6/docs/ref/#language.LanguageDescription.filename) patterns,\n    and then [extensions](https://codemirror.net/6/docs/ref/#language.LanguageDescription.extensions),\n    and return the first language that matches.\n    */\n    static matchFilename(descs, filename) {\n        for (let d of descs)\n            if (d.filename && d.filename.test(filename))\n                return d;\n        let ext = /\\.([^.]+)$/.exec(filename);\n        if (ext)\n            for (let d of descs)\n                if (d.extensions.indexOf(ext[1]) > -1)\n                    return d;\n        return null;\n    }\n    /**\n    Look for a language whose name or alias matches the the given\n    name (case-insensitively). If `fuzzy` is true, and no direct\n    matchs is found, this'll also search for a language whose name\n    or alias occurs in the string (for names shorter than three\n    characters, only when surrounded by non-word characters).\n    */\n    static matchLanguageName(descs, name, fuzzy = true) {\n        name = name.toLowerCase();\n        for (let d of descs)\n            if (d.alias.some(a => a == name))\n                return d;\n        if (fuzzy)\n            for (let d of descs)\n                for (let a of d.alias) {\n                    let found = name.indexOf(a);\n                    if (found > -1 && (a.length > 2 || !/\\w/.test(name[found - 1]) && !/\\w/.test(name[found + a.length])))\n                        return d;\n                }\n        return null;\n    }\n}\n\n/**\nFacet that defines a way to provide a function that computes the\nappropriate indentation depth, as a column number (see\n[`indentString`](https://codemirror.net/6/docs/ref/#language.indentString)), at the start of a given\nline. A return value of `null` indicates no indentation can be\ndetermined, and the line should inherit the indentation of the one\nabove it. A return value of `undefined` defers to the next indent\nservice.\n*/\nconst indentService = /*@__PURE__*/Facet.define();\n/**\nFacet for overriding the unit by which indentation happens. Should\nbe a string consisting entirely of the same whitespace character.\nWhen not set, this defaults to 2 spaces.\n*/\nconst indentUnit = /*@__PURE__*/Facet.define({\n    combine: values => {\n        if (!values.length)\n            return \"  \";\n        let unit = values[0];\n        if (!unit || /\\S/.test(unit) || Array.from(unit).some(e => e != unit[0]))\n            throw new Error(\"Invalid indent unit: \" + JSON.stringify(values[0]));\n        return unit;\n    }\n});\n/**\nReturn the _column width_ of an indent unit in the state.\nDetermined by the [`indentUnit`](https://codemirror.net/6/docs/ref/#language.indentUnit)\nfacet, and [`tabSize`](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize) when that\ncontains tabs.\n*/\nfunction getIndentUnit(state) {\n    let unit = state.facet(indentUnit);\n    return unit.charCodeAt(0) == 9 ? state.tabSize * unit.length : unit.length;\n}\n/**\nCreate an indentation string that covers columns 0 to `cols`.\nWill use tabs for as much of the columns as possible when the\n[`indentUnit`](https://codemirror.net/6/docs/ref/#language.indentUnit) facet contains\ntabs.\n*/\nfunction indentString(state, cols) {\n    let result = \"\", ts = state.tabSize, ch = state.facet(indentUnit)[0];\n    if (ch == \"\\t\") {\n        while (cols >= ts) {\n            result += \"\\t\";\n            cols -= ts;\n        }\n        ch = \" \";\n    }\n    for (let i = 0; i < cols; i++)\n        result += ch;\n    return result;\n}\n/**\nGet the indentation, as a column number, at the given position.\nWill first consult any [indent services](https://codemirror.net/6/docs/ref/#language.indentService)\nthat are registered, and if none of those return an indentation,\nthis will check the syntax tree for the [indent node\nprop](https://codemirror.net/6/docs/ref/#language.indentNodeProp) and use that if found. Returns a\nnumber when an indentation could be determined, and null\notherwise.\n*/\nfunction getIndentation(context, pos) {\n    if (context instanceof EditorState)\n        context = new IndentContext(context);\n    for (let service of context.state.facet(indentService)) {\n        let result = service(context, pos);\n        if (result !== undefined)\n            return result;\n    }\n    let tree = syntaxTree(context.state);\n    return tree.length >= pos ? syntaxIndentation(context, tree, pos) : null;\n}\n/**\nCreate a change set that auto-indents all lines touched by the\ngiven document range.\n*/\nfunction indentRange(state, from, to) {\n    let updated = Object.create(null);\n    let context = new IndentContext(state, { overrideIndentation: start => { var _a; return (_a = updated[start]) !== null && _a !== void 0 ? _a : -1; } });\n    let changes = [];\n    for (let pos = from; pos <= to;) {\n        let line = state.doc.lineAt(pos);\n        pos = line.to + 1;\n        let indent = getIndentation(context, line.from);\n        if (indent == null)\n            continue;\n        if (!/\\S/.test(line.text))\n            indent = 0;\n        let cur = /^\\s*/.exec(line.text)[0];\n        let norm = indentString(state, indent);\n        if (cur != norm) {\n            updated[line.from] = indent;\n            changes.push({ from: line.from, to: line.from + cur.length, insert: norm });\n        }\n    }\n    return state.changes(changes);\n}\n/**\nIndentation contexts are used when calling [indentation\nservices](https://codemirror.net/6/docs/ref/#language.indentService). They provide helper utilities\nuseful in indentation logic, and can selectively override the\nindentation reported for some lines.\n*/\nclass IndentContext {\n    /**\n    Create an indent context.\n    */\n    constructor(\n    /**\n    The editor state.\n    */\n    state, \n    /**\n    @internal\n    */\n    options = {}) {\n        this.state = state;\n        this.options = options;\n        this.unit = getIndentUnit(state);\n    }\n    /**\n    Get a description of the line at the given position, taking\n    [simulated line\n    breaks](https://codemirror.net/6/docs/ref/#language.IndentContext.constructor^options.simulateBreak)\n    into account. If there is such a break at `pos`, the `bias`\n    argument determines whether the part of the line line before or\n    after the break is used.\n    */\n    lineAt(pos, bias = 1) {\n        let line = this.state.doc.lineAt(pos);\n        let { simulateBreak, simulateDoubleBreak } = this.options;\n        if (simulateBreak != null && simulateBreak >= line.from && simulateBreak <= line.to) {\n            if (simulateDoubleBreak && simulateBreak == pos)\n                return { text: \"\", from: pos };\n            else if (bias < 0 ? simulateBreak < pos : simulateBreak <= pos)\n                return { text: line.text.slice(simulateBreak - line.from), from: simulateBreak };\n            else\n                return { text: line.text.slice(0, simulateBreak - line.from), from: line.from };\n        }\n        return line;\n    }\n    /**\n    Get the text directly after `pos`, either the entire line\n    or the next 100 characters, whichever is shorter.\n    */\n    textAfterPos(pos, bias = 1) {\n        if (this.options.simulateDoubleBreak && pos == this.options.simulateBreak)\n            return \"\";\n        let { text, from } = this.lineAt(pos, bias);\n        return text.slice(pos - from, Math.min(text.length, pos + 100 - from));\n    }\n    /**\n    Find the column for the given position.\n    */\n    column(pos, bias = 1) {\n        let { text, from } = this.lineAt(pos, bias);\n        let result = this.countColumn(text, pos - from);\n        let override = this.options.overrideIndentation ? this.options.overrideIndentation(from) : -1;\n        if (override > -1)\n            result += override - this.countColumn(text, text.search(/\\S|$/));\n        return result;\n    }\n    /**\n    Find the column position (taking tabs into account) of the given\n    position in the given string.\n    */\n    countColumn(line, pos = line.length) {\n        return countColumn(line, this.state.tabSize, pos);\n    }\n    /**\n    Find the indentation column of the line at the given point.\n    */\n    lineIndent(pos, bias = 1) {\n        let { text, from } = this.lineAt(pos, bias);\n        let override = this.options.overrideIndentation;\n        if (override) {\n            let overriden = override(from);\n            if (overriden > -1)\n                return overriden;\n        }\n        return this.countColumn(text, text.search(/\\S|$/));\n    }\n    /**\n    Returns the [simulated line\n    break](https://codemirror.net/6/docs/ref/#language.IndentContext.constructor^options.simulateBreak)\n    for this context, if any.\n    */\n    get simulatedBreak() {\n        return this.options.simulateBreak || null;\n    }\n}\n/**\nA syntax tree node prop used to associate indentation strategies\nwith node types. Such a strategy is a function from an indentation\ncontext to a column number (see also\n[`indentString`](https://codemirror.net/6/docs/ref/#language.indentString)) or null, where null\nindicates that no definitive indentation can be determined.\n*/\nconst indentNodeProp = /*@__PURE__*/new NodeProp();\n// Compute the indentation for a given position from the syntax tree.\nfunction syntaxIndentation(cx, ast, pos) {\n    let stack = ast.resolveStack(pos);\n    let inner = ast.resolveInner(pos, -1).resolve(pos, 0).enterUnfinishedNodesBefore(pos);\n    if (inner != stack.node) {\n        let add = [];\n        for (let cur = inner; cur && !(cur.from < stack.node.from || cur.to > stack.node.to ||\n            cur.from == stack.node.from && cur.type == stack.node.type); cur = cur.parent)\n            add.push(cur);\n        for (let i = add.length - 1; i >= 0; i--)\n            stack = { node: add[i], next: stack };\n    }\n    return indentFor(stack, cx, pos);\n}\nfunction indentFor(stack, cx, pos) {\n    for (let cur = stack; cur; cur = cur.next) {\n        let strategy = indentStrategy(cur.node);\n        if (strategy)\n            return strategy(TreeIndentContext.create(cx, pos, cur));\n    }\n    return 0;\n}\nfunction ignoreClosed(cx) {\n    return cx.pos == cx.options.simulateBreak && cx.options.simulateDoubleBreak;\n}\nfunction indentStrategy(tree) {\n    let strategy = tree.type.prop(indentNodeProp);\n    if (strategy)\n        return strategy;\n    let first = tree.firstChild, close;\n    if (first && (close = first.type.prop(NodeProp.closedBy))) {\n        let last = tree.lastChild, closed = last && close.indexOf(last.name) > -1;\n        return cx => delimitedStrategy(cx, true, 1, undefined, closed && !ignoreClosed(cx) ? last.from : undefined);\n    }\n    return tree.parent == null ? topIndent : null;\n}\nfunction topIndent() { return 0; }\n/**\nObjects of this type provide context information and helper\nmethods to indentation functions registered on syntax nodes.\n*/\nclass TreeIndentContext extends IndentContext {\n    constructor(base, \n    /**\n    The position at which indentation is being computed.\n    */\n    pos, \n    /**\n    @internal\n    */\n    context) {\n        super(base.state, base.options);\n        this.base = base;\n        this.pos = pos;\n        this.context = context;\n    }\n    /**\n    The syntax tree node to which the indentation strategy\n    applies.\n    */\n    get node() { return this.context.node; }\n    /**\n    @internal\n    */\n    static create(base, pos, context) {\n        return new TreeIndentContext(base, pos, context);\n    }\n    /**\n    Get the text directly after `this.pos`, either the entire line\n    or the next 100 characters, whichever is shorter.\n    */\n    get textAfter() {\n        return this.textAfterPos(this.pos);\n    }\n    /**\n    Get the indentation at the reference line for `this.node`, which\n    is the line on which it starts, unless there is a node that is\n    _not_ a parent of this node covering the start of that line. If\n    so, the line at the start of that node is tried, again skipping\n    on if it is covered by another such node.\n    */\n    get baseIndent() {\n        return this.baseIndentFor(this.node);\n    }\n    /**\n    Get the indentation for the reference line of the given node\n    (see [`baseIndent`](https://codemirror.net/6/docs/ref/#language.TreeIndentContext.baseIndent)).\n    */\n    baseIndentFor(node) {\n        let line = this.state.doc.lineAt(node.from);\n        // Skip line starts that are covered by a sibling (or cousin, etc)\n        for (;;) {\n            let atBreak = node.resolve(line.from);\n            while (atBreak.parent && atBreak.parent.from == atBreak.from)\n                atBreak = atBreak.parent;\n            if (isParent(atBreak, node))\n                break;\n            line = this.state.doc.lineAt(atBreak.from);\n        }\n        return this.lineIndent(line.from);\n    }\n    /**\n    Continue looking for indentations in the node's parent nodes,\n    and return the result of that.\n    */\n    continue() {\n        return indentFor(this.context.next, this.base, this.pos);\n    }\n}\nfunction isParent(parent, of) {\n    for (let cur = of; cur; cur = cur.parent)\n        if (parent == cur)\n            return true;\n    return false;\n}\n// Check whether a delimited node is aligned (meaning there are\n// non-skipped nodes on the same line as the opening delimiter). And\n// if so, return the opening token.\nfunction bracketedAligned(context) {\n    let tree = context.node;\n    let openToken = tree.childAfter(tree.from), last = tree.lastChild;\n    if (!openToken)\n        return null;\n    let sim = context.options.simulateBreak;\n    let openLine = context.state.doc.lineAt(openToken.from);\n    let lineEnd = sim == null || sim <= openLine.from ? openLine.to : Math.min(openLine.to, sim);\n    for (let pos = openToken.to;;) {\n        let next = tree.childAfter(pos);\n        if (!next || next == last)\n            return null;\n        if (!next.type.isSkipped) {\n            if (next.from >= lineEnd)\n                return null;\n            let space = /^ */.exec(openLine.text.slice(openToken.to - openLine.from))[0].length;\n            return { from: openToken.from, to: openToken.to + space };\n        }\n        pos = next.to;\n    }\n}\n/**\nAn indentation strategy for delimited (usually bracketed) nodes.\nWill, by default, indent one unit more than the parent's base\nindent unless the line starts with a closing token. When `align`\nis true and there are non-skipped nodes on the node's opening\nline, the content of the node will be aligned with the end of the\nopening node, like this:\n\n    foo(bar,\n        baz)\n*/\nfunction delimitedIndent({ closing, align = true, units = 1 }) {\n    return (context) => delimitedStrategy(context, align, units, closing);\n}\nfunction delimitedStrategy(context, align, units, closing, closedAt) {\n    let after = context.textAfter, space = after.match(/^\\s*/)[0].length;\n    let closed = closing && after.slice(space, space + closing.length) == closing || closedAt == context.pos + space;\n    let aligned = align ? bracketedAligned(context) : null;\n    if (aligned)\n        return closed ? context.column(aligned.from) : context.column(aligned.to);\n    return context.baseIndent + (closed ? 0 : context.unit * units);\n}\n/**\nAn indentation strategy that aligns a node's content to its base\nindentation.\n*/\nconst flatIndent = (context) => context.baseIndent;\n/**\nCreates an indentation strategy that, by default, indents\ncontinued lines one unit more than the node's base indentation.\nYou can provide `except` to prevent indentation of lines that\nmatch a pattern (for example `/^else\\b/` in `if`/`else`\nconstructs), and you can change the amount of units used with the\n`units` option.\n*/\nfunction continuedIndent({ except, units = 1 } = {}) {\n    return (context) => {\n        let matchExcept = except && except.test(context.textAfter);\n        return context.baseIndent + (matchExcept ? 0 : units * context.unit);\n    };\n}\nconst DontIndentBeyond = 200;\n/**\nEnables reindentation on input. When a language defines an\n`indentOnInput` field in its [language\ndata](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt), which must hold a regular\nexpression, the line at the cursor will be reindented whenever new\ntext is typed and the input from the start of the line up to the\ncursor matches that regexp.\n\nTo avoid unneccesary reindents, it is recommended to start the\nregexp with `^` (usually followed by `\\s*`), and end it with `$`.\nFor example, `/^\\s*\\}$/` will reindent when a closing brace is\nadded at the start of a line.\n*/\nfunction indentOnInput() {\n    return EditorState.transactionFilter.of(tr => {\n        if (!tr.docChanged || !tr.isUserEvent(\"input.type\") && !tr.isUserEvent(\"input.complete\"))\n            return tr;\n        let rules = tr.startState.languageDataAt(\"indentOnInput\", tr.startState.selection.main.head);\n        if (!rules.length)\n            return tr;\n        let doc = tr.newDoc, { head } = tr.newSelection.main, line = doc.lineAt(head);\n        if (head > line.from + DontIndentBeyond)\n            return tr;\n        let lineStart = doc.sliceString(line.from, head);\n        if (!rules.some(r => r.test(lineStart)))\n            return tr;\n        let { state } = tr, last = -1, changes = [];\n        for (let { head } of state.selection.ranges) {\n            let line = state.doc.lineAt(head);\n            if (line.from == last)\n                continue;\n            last = line.from;\n            let indent = getIndentation(state, line.from);\n            if (indent == null)\n                continue;\n            let cur = /^\\s*/.exec(line.text)[0];\n            let norm = indentString(state, indent);\n            if (cur != norm)\n                changes.push({ from: line.from, to: line.from + cur.length, insert: norm });\n        }\n        return changes.length ? [tr, { changes, sequential: true }] : tr;\n    });\n}\n\n/**\nA facet that registers a code folding service. When called with\nthe extent of a line, such a function should return a foldable\nrange that starts on that line (but continues beyond it), if one\ncan be found.\n*/\nconst foldService = /*@__PURE__*/Facet.define();\n/**\nThis node prop is used to associate folding information with\nsyntax node types. Given a syntax node, it should check whether\nthat tree is foldable and return the range that can be collapsed\nwhen it is.\n*/\nconst foldNodeProp = /*@__PURE__*/new NodeProp();\n/**\n[Fold](https://codemirror.net/6/docs/ref/#language.foldNodeProp) function that folds everything but\nthe first and the last child of a syntax node. Useful for nodes\nthat start and end with delimiters.\n*/\nfunction foldInside(node) {\n    let first = node.firstChild, last = node.lastChild;\n    return first && first.to < last.from ? { from: first.to, to: last.type.isError ? node.to : last.from } : null;\n}\nfunction syntaxFolding(state, start, end) {\n    let tree = syntaxTree(state);\n    if (tree.length < end)\n        return null;\n    let stack = tree.resolveStack(end, 1);\n    let found = null;\n    for (let iter = stack; iter; iter = iter.next) {\n        let cur = iter.node;\n        if (cur.to <= end || cur.from > end)\n            continue;\n        if (found && cur.from < start)\n            break;\n        let prop = cur.type.prop(foldNodeProp);\n        if (prop && (cur.to < tree.length - 50 || tree.length == state.doc.length || !isUnfinished(cur))) {\n            let value = prop(cur, state);\n            if (value && value.from <= end && value.from >= start && value.to > end)\n                found = value;\n        }\n    }\n    return found;\n}\nfunction isUnfinished(node) {\n    let ch = node.lastChild;\n    return ch && ch.to == node.to && ch.type.isError;\n}\n/**\nCheck whether the given line is foldable. First asks any fold\nservices registered through\n[`foldService`](https://codemirror.net/6/docs/ref/#language.foldService), and if none of them return\na result, tries to query the [fold node\nprop](https://codemirror.net/6/docs/ref/#language.foldNodeProp) of syntax nodes that cover the end\nof the line.\n*/\nfunction foldable(state, lineStart, lineEnd) {\n    for (let service of state.facet(foldService)) {\n        let result = service(state, lineStart, lineEnd);\n        if (result)\n            return result;\n    }\n    return syntaxFolding(state, lineStart, lineEnd);\n}\nfunction mapRange(range, mapping) {\n    let from = mapping.mapPos(range.from, 1), to = mapping.mapPos(range.to, -1);\n    return from >= to ? undefined : { from, to };\n}\n/**\nState effect that can be attached to a transaction to fold the\ngiven range. (You probably only need this in exceptional\ncircumstances—usually you'll just want to let\n[`foldCode`](https://codemirror.net/6/docs/ref/#language.foldCode) and the [fold\ngutter](https://codemirror.net/6/docs/ref/#language.foldGutter) create the transactions.)\n*/\nconst foldEffect = /*@__PURE__*/StateEffect.define({ map: mapRange });\n/**\nState effect that unfolds the given range (if it was folded).\n*/\nconst unfoldEffect = /*@__PURE__*/StateEffect.define({ map: mapRange });\nfunction selectedLines(view) {\n    let lines = [];\n    for (let { head } of view.state.selection.ranges) {\n        if (lines.some(l => l.from <= head && l.to >= head))\n            continue;\n        lines.push(view.lineBlockAt(head));\n    }\n    return lines;\n}\n/**\nThe state field that stores the folded ranges (as a [decoration\nset](https://codemirror.net/6/docs/ref/#view.DecorationSet)). Can be passed to\n[`EditorState.toJSON`](https://codemirror.net/6/docs/ref/#state.EditorState.toJSON) and\n[`fromJSON`](https://codemirror.net/6/docs/ref/#state.EditorState^fromJSON) to serialize the fold\nstate.\n*/\nconst foldState = /*@__PURE__*/StateField.define({\n    create() {\n        return Decoration.none;\n    },\n    update(folded, tr) {\n        if (tr.isUserEvent(\"delete\"))\n            tr.changes.iterChangedRanges((fromA, toA) => folded = clearTouchedFolds(folded, fromA, toA));\n        folded = folded.map(tr.changes);\n        for (let e of tr.effects) {\n            if (e.is(foldEffect) && !foldExists(folded, e.value.from, e.value.to)) {\n                let { preparePlaceholder } = tr.state.facet(foldConfig);\n                let widget = !preparePlaceholder ? foldWidget :\n                    Decoration.replace({ widget: new PreparedFoldWidget(preparePlaceholder(tr.state, e.value)) });\n                folded = folded.update({ add: [widget.range(e.value.from, e.value.to)] });\n            }\n            else if (e.is(unfoldEffect)) {\n                folded = folded.update({ filter: (from, to) => e.value.from != from || e.value.to != to,\n                    filterFrom: e.value.from, filterTo: e.value.to });\n            }\n        }\n        // Clear folded ranges that cover the selection head\n        if (tr.selection)\n            folded = clearTouchedFolds(folded, tr.selection.main.head);\n        return folded;\n    },\n    provide: f => EditorView.decorations.from(f),\n    toJSON(folded, state) {\n        let ranges = [];\n        folded.between(0, state.doc.length, (from, to) => { ranges.push(from, to); });\n        return ranges;\n    },\n    fromJSON(value) {\n        if (!Array.isArray(value) || value.length % 2)\n            throw new RangeError(\"Invalid JSON for fold state\");\n        let ranges = [];\n        for (let i = 0; i < value.length;) {\n            let from = value[i++], to = value[i++];\n            if (typeof from != \"number\" || typeof to != \"number\")\n                throw new RangeError(\"Invalid JSON for fold state\");\n            ranges.push(foldWidget.range(from, to));\n        }\n        return Decoration.set(ranges, true);\n    }\n});\nfunction clearTouchedFolds(folded, from, to = from) {\n    let touched = false;\n    folded.between(from, to, (a, b) => { if (a < to && b > from)\n        touched = true; });\n    return !touched ? folded : folded.update({\n        filterFrom: from,\n        filterTo: to,\n        filter: (a, b) => a >= to || b <= from\n    });\n}\n/**\nGet a [range set](https://codemirror.net/6/docs/ref/#state.RangeSet) containing the folded ranges\nin the given state.\n*/\nfunction foldedRanges(state) {\n    return state.field(foldState, false) || RangeSet.empty;\n}\nfunction findFold(state, from, to) {\n    var _a;\n    let found = null;\n    (_a = state.field(foldState, false)) === null || _a === void 0 ? void 0 : _a.between(from, to, (from, to) => {\n        if (!found || found.from > from)\n            found = { from, to };\n    });\n    return found;\n}\nfunction foldExists(folded, from, to) {\n    let found = false;\n    folded.between(from, from, (a, b) => { if (a == from && b == to)\n        found = true; });\n    return found;\n}\nfunction maybeEnable(state, other) {\n    return state.field(foldState, false) ? other : other.concat(StateEffect.appendConfig.of(codeFolding()));\n}\n/**\nFold the lines that are selected, if possible.\n*/\nconst foldCode = view => {\n    for (let line of selectedLines(view)) {\n        let range = foldable(view.state, line.from, line.to);\n        if (range) {\n            view.dispatch({ effects: maybeEnable(view.state, [foldEffect.of(range), announceFold(view, range)]) });\n            return true;\n        }\n    }\n    return false;\n};\n/**\nUnfold folded ranges on selected lines.\n*/\nconst unfoldCode = view => {\n    if (!view.state.field(foldState, false))\n        return false;\n    let effects = [];\n    for (let line of selectedLines(view)) {\n        let folded = findFold(view.state, line.from, line.to);\n        if (folded)\n            effects.push(unfoldEffect.of(folded), announceFold(view, folded, false));\n    }\n    if (effects.length)\n        view.dispatch({ effects });\n    return effects.length > 0;\n};\nfunction announceFold(view, range, fold = true) {\n    let lineFrom = view.state.doc.lineAt(range.from).number, lineTo = view.state.doc.lineAt(range.to).number;\n    return EditorView.announce.of(`${view.state.phrase(fold ? \"Folded lines\" : \"Unfolded lines\")} ${lineFrom} ${view.state.phrase(\"to\")} ${lineTo}.`);\n}\n/**\nFold all top-level foldable ranges. Note that, in most cases,\nfolding information will depend on the [syntax\ntree](https://codemirror.net/6/docs/ref/#language.syntaxTree), and folding everything may not work\nreliably when the document hasn't been fully parsed (either\nbecause the editor state was only just initialized, or because the\ndocument is so big that the parser decided not to parse it\nentirely).\n*/\nconst foldAll = view => {\n    let { state } = view, effects = [];\n    for (let pos = 0; pos < state.doc.length;) {\n        let line = view.lineBlockAt(pos), range = foldable(state, line.from, line.to);\n        if (range)\n            effects.push(foldEffect.of(range));\n        pos = (range ? view.lineBlockAt(range.to) : line).to + 1;\n    }\n    if (effects.length)\n        view.dispatch({ effects: maybeEnable(view.state, effects) });\n    return !!effects.length;\n};\n/**\nUnfold all folded code.\n*/\nconst unfoldAll = view => {\n    let field = view.state.field(foldState, false);\n    if (!field || !field.size)\n        return false;\n    let effects = [];\n    field.between(0, view.state.doc.length, (from, to) => { effects.push(unfoldEffect.of({ from, to })); });\n    view.dispatch({ effects });\n    return true;\n};\n// Find the foldable region containing the given line, if one exists\nfunction foldableContainer(view, lineBlock) {\n    // Look backwards through line blocks until we find a foldable region that\n    // intersects with the line\n    for (let line = lineBlock;;) {\n        let foldableRegion = foldable(view.state, line.from, line.to);\n        if (foldableRegion && foldableRegion.to > lineBlock.from)\n            return foldableRegion;\n        if (!line.from)\n            return null;\n        line = view.lineBlockAt(line.from - 1);\n    }\n}\n/**\nToggle folding at cursors. Unfolds if there is an existing fold\nstarting in that line, tries to find a foldable range around it\notherwise.\n*/\nconst toggleFold = (view) => {\n    let effects = [];\n    for (let line of selectedLines(view)) {\n        let folded = findFold(view.state, line.from, line.to);\n        if (folded) {\n            effects.push(unfoldEffect.of(folded), announceFold(view, folded, false));\n        }\n        else {\n            let foldRange = foldableContainer(view, line);\n            if (foldRange)\n                effects.push(foldEffect.of(foldRange), announceFold(view, foldRange));\n        }\n    }\n    if (effects.length > 0)\n        view.dispatch({ effects: maybeEnable(view.state, effects) });\n    return !!effects.length;\n};\n/**\nDefault fold-related key bindings.\n\n - Ctrl-Shift-[ (Cmd-Alt-[ on macOS): [`foldCode`](https://codemirror.net/6/docs/ref/#language.foldCode).\n - Ctrl-Shift-] (Cmd-Alt-] on macOS): [`unfoldCode`](https://codemirror.net/6/docs/ref/#language.unfoldCode).\n - Ctrl-Alt-[: [`foldAll`](https://codemirror.net/6/docs/ref/#language.foldAll).\n - Ctrl-Alt-]: [`unfoldAll`](https://codemirror.net/6/docs/ref/#language.unfoldAll).\n*/\nconst foldKeymap = [\n    { key: \"Ctrl-Shift-[\", mac: \"Cmd-Alt-[\", run: foldCode },\n    { key: \"Ctrl-Shift-]\", mac: \"Cmd-Alt-]\", run: unfoldCode },\n    { key: \"Ctrl-Alt-[\", run: foldAll },\n    { key: \"Ctrl-Alt-]\", run: unfoldAll }\n];\nconst defaultConfig = {\n    placeholderDOM: null,\n    preparePlaceholder: null,\n    placeholderText: \"…\"\n};\nconst foldConfig = /*@__PURE__*/Facet.define({\n    combine(values) { return combineConfig(values, defaultConfig); }\n});\n/**\nCreate an extension that configures code folding.\n*/\nfunction codeFolding(config) {\n    let result = [foldState, baseTheme$1];\n    if (config)\n        result.push(foldConfig.of(config));\n    return result;\n}\nfunction widgetToDOM(view, prepared) {\n    let { state } = view, conf = state.facet(foldConfig);\n    let onclick = (event) => {\n        let line = view.lineBlockAt(view.posAtDOM(event.target));\n        let folded = findFold(view.state, line.from, line.to);\n        if (folded)\n            view.dispatch({ effects: unfoldEffect.of(folded) });\n        event.preventDefault();\n    };\n    if (conf.placeholderDOM)\n        return conf.placeholderDOM(view, onclick, prepared);\n    let element = document.createElement(\"span\");\n    element.textContent = conf.placeholderText;\n    element.setAttribute(\"aria-label\", state.phrase(\"folded code\"));\n    element.title = state.phrase(\"unfold\");\n    element.className = \"cm-foldPlaceholder\";\n    element.onclick = onclick;\n    return element;\n}\nconst foldWidget = /*@__PURE__*/Decoration.replace({ widget: /*@__PURE__*/new class extends WidgetType {\n        toDOM(view) { return widgetToDOM(view, null); }\n    } });\nclass PreparedFoldWidget extends WidgetType {\n    constructor(value) {\n        super();\n        this.value = value;\n    }\n    eq(other) { return this.value == other.value; }\n    toDOM(view) { return widgetToDOM(view, this.value); }\n}\nconst foldGutterDefaults = {\n    openText: \"⌄\",\n    closedText: \"›\",\n    markerDOM: null,\n    domEventHandlers: {},\n    foldingChanged: () => false\n};\nclass FoldMarker extends GutterMarker {\n    constructor(config, open) {\n        super();\n        this.config = config;\n        this.open = open;\n    }\n    eq(other) { return this.config == other.config && this.open == other.open; }\n    toDOM(view) {\n        if (this.config.markerDOM)\n            return this.config.markerDOM(this.open);\n        let span = document.createElement(\"span\");\n        span.textContent = this.open ? this.config.openText : this.config.closedText;\n        span.title = view.state.phrase(this.open ? \"Fold line\" : \"Unfold line\");\n        return span;\n    }\n}\n/**\nCreate an extension that registers a fold gutter, which shows a\nfold status indicator before foldable lines (which can be clicked\nto fold or unfold the line).\n*/\nfunction foldGutter(config = {}) {\n    let fullConfig = { ...foldGutterDefaults, ...config };\n    let canFold = new FoldMarker(fullConfig, true), canUnfold = new FoldMarker(fullConfig, false);\n    let markers = ViewPlugin.fromClass(class {\n        constructor(view) {\n            this.from = view.viewport.from;\n            this.markers = this.buildMarkers(view);\n        }\n        update(update) {\n            if (update.docChanged || update.viewportChanged ||\n                update.startState.facet(language) != update.state.facet(language) ||\n                update.startState.field(foldState, false) != update.state.field(foldState, false) ||\n                syntaxTree(update.startState) != syntaxTree(update.state) ||\n                fullConfig.foldingChanged(update))\n                this.markers = this.buildMarkers(update.view);\n        }\n        buildMarkers(view) {\n            let builder = new RangeSetBuilder();\n            for (let line of view.viewportLineBlocks) {\n                let mark = findFold(view.state, line.from, line.to) ? canUnfold\n                    : foldable(view.state, line.from, line.to) ? canFold : null;\n                if (mark)\n                    builder.add(line.from, line.from, mark);\n            }\n            return builder.finish();\n        }\n    });\n    let { domEventHandlers } = fullConfig;\n    return [\n        markers,\n        gutter({\n            class: \"cm-foldGutter\",\n            markers(view) { var _a; return ((_a = view.plugin(markers)) === null || _a === void 0 ? void 0 : _a.markers) || RangeSet.empty; },\n            initialSpacer() {\n                return new FoldMarker(fullConfig, false);\n            },\n            domEventHandlers: {\n                ...domEventHandlers,\n                click: (view, line, event) => {\n                    if (domEventHandlers.click && domEventHandlers.click(view, line, event))\n                        return true;\n                    let folded = findFold(view.state, line.from, line.to);\n                    if (folded) {\n                        view.dispatch({ effects: unfoldEffect.of(folded) });\n                        return true;\n                    }\n                    let range = foldable(view.state, line.from, line.to);\n                    if (range) {\n                        view.dispatch({ effects: foldEffect.of(range) });\n                        return true;\n                    }\n                    return false;\n                }\n            }\n        }),\n        codeFolding()\n    ];\n}\nconst baseTheme$1 = /*@__PURE__*/EditorView.baseTheme({\n    \".cm-foldPlaceholder\": {\n        backgroundColor: \"#eee\",\n        border: \"1px solid #ddd\",\n        color: \"#888\",\n        borderRadius: \".2em\",\n        margin: \"0 1px\",\n        padding: \"0 1px\",\n        cursor: \"pointer\"\n    },\n    \".cm-foldGutter span\": {\n        padding: \"0 1px\",\n        cursor: \"pointer\"\n    }\n});\n\n/**\nA highlight style associates CSS styles with highlighting\n[tags](https://lezer.codemirror.net/docs/ref#highlight.Tag).\n*/\nclass HighlightStyle {\n    constructor(\n    /**\n    The tag styles used to create this highlight style.\n    */\n    specs, options) {\n        this.specs = specs;\n        let modSpec;\n        function def(spec) {\n            let cls = StyleModule.newName();\n            (modSpec || (modSpec = Object.create(null)))[\".\" + cls] = spec;\n            return cls;\n        }\n        const all = typeof options.all == \"string\" ? options.all : options.all ? def(options.all) : undefined;\n        const scopeOpt = options.scope;\n        this.scope = scopeOpt instanceof Language ? (type) => type.prop(languageDataProp) == scopeOpt.data\n            : scopeOpt ? (type) => type == scopeOpt : undefined;\n        this.style = tagHighlighter(specs.map(style => ({\n            tag: style.tag,\n            class: style.class || def(Object.assign({}, style, { tag: null }))\n        })), {\n            all,\n        }).style;\n        this.module = modSpec ? new StyleModule(modSpec) : null;\n        this.themeType = options.themeType;\n    }\n    /**\n    Create a highlighter style that associates the given styles to\n    the given tags. The specs must be objects that hold a style tag\n    or array of tags in their `tag` property, and either a single\n    `class` property providing a static CSS class (for highlighter\n    that rely on external styling), or a\n    [`style-mod`](https://github.com/marijnh/style-mod#documentation)-style\n    set of CSS properties (which define the styling for those tags).\n    \n    The CSS rules created for a highlighter will be emitted in the\n    order of the spec's properties. That means that for elements that\n    have multiple tags associated with them, styles defined further\n    down in the list will have a higher CSS precedence than styles\n    defined earlier.\n    */\n    static define(specs, options) {\n        return new HighlightStyle(specs, options || {});\n    }\n}\nconst highlighterFacet = /*@__PURE__*/Facet.define();\nconst fallbackHighlighter = /*@__PURE__*/Facet.define({\n    combine(values) { return values.length ? [values[0]] : null; }\n});\nfunction getHighlighters(state) {\n    let main = state.facet(highlighterFacet);\n    return main.length ? main : state.facet(fallbackHighlighter);\n}\n/**\nWrap a highlighter in an editor extension that uses it to apply\nsyntax highlighting to the editor content.\n\nWhen multiple (non-fallback) styles are provided, the styling\napplied is the union of the classes they emit.\n*/\nfunction syntaxHighlighting(highlighter, options) {\n    let ext = [treeHighlighter], themeType;\n    if (highlighter instanceof HighlightStyle) {\n        if (highlighter.module)\n            ext.push(EditorView.styleModule.of(highlighter.module));\n        themeType = highlighter.themeType;\n    }\n    if (options === null || options === void 0 ? void 0 : options.fallback)\n        ext.push(fallbackHighlighter.of(highlighter));\n    else if (themeType)\n        ext.push(highlighterFacet.computeN([EditorView.darkTheme], state => {\n            return state.facet(EditorView.darkTheme) == (themeType == \"dark\") ? [highlighter] : [];\n        }));\n    else\n        ext.push(highlighterFacet.of(highlighter));\n    return ext;\n}\n/**\nReturns the CSS classes (if any) that the highlighters active in\nthe state would assign to the given style\n[tags](https://lezer.codemirror.net/docs/ref#highlight.Tag) and\n(optional) language\n[scope](https://codemirror.net/6/docs/ref/#language.HighlightStyle^define^options.scope).\n*/\nfunction highlightingFor(state, tags, scope) {\n    let highlighters = getHighlighters(state);\n    let result = null;\n    if (highlighters)\n        for (let highlighter of highlighters) {\n            if (!highlighter.scope || scope && highlighter.scope(scope)) {\n                let cls = highlighter.style(tags);\n                if (cls)\n                    result = result ? result + \" \" + cls : cls;\n            }\n        }\n    return result;\n}\nclass TreeHighlighter {\n    constructor(view) {\n        this.markCache = Object.create(null);\n        this.tree = syntaxTree(view.state);\n        this.decorations = this.buildDeco(view, getHighlighters(view.state));\n        this.decoratedTo = view.viewport.to;\n    }\n    update(update) {\n        let tree = syntaxTree(update.state), highlighters = getHighlighters(update.state);\n        let styleChange = highlighters != getHighlighters(update.startState);\n        let { viewport } = update.view, decoratedToMapped = update.changes.mapPos(this.decoratedTo, 1);\n        if (tree.length < viewport.to && !styleChange && tree.type == this.tree.type && decoratedToMapped >= viewport.to) {\n            this.decorations = this.decorations.map(update.changes);\n            this.decoratedTo = decoratedToMapped;\n        }\n        else if (tree != this.tree || update.viewportChanged || styleChange) {\n            this.tree = tree;\n            this.decorations = this.buildDeco(update.view, highlighters);\n            this.decoratedTo = viewport.to;\n        }\n    }\n    buildDeco(view, highlighters) {\n        if (!highlighters || !this.tree.length)\n            return Decoration.none;\n        let builder = new RangeSetBuilder();\n        for (let { from, to } of view.visibleRanges) {\n            highlightTree(this.tree, highlighters, (from, to, style) => {\n                builder.add(from, to, this.markCache[style] || (this.markCache[style] = Decoration.mark({ class: style })));\n            }, from, to);\n        }\n        return builder.finish();\n    }\n}\nconst treeHighlighter = /*@__PURE__*/Prec.high(/*@__PURE__*/ViewPlugin.fromClass(TreeHighlighter, {\n    decorations: v => v.decorations\n}));\n/**\nA default highlight style (works well with light themes).\n*/\nconst defaultHighlightStyle = /*@__PURE__*/HighlightStyle.define([\n    { tag: tags.meta,\n        color: \"#404740\" },\n    { tag: tags.link,\n        textDecoration: \"underline\" },\n    { tag: tags.heading,\n        textDecoration: \"underline\",\n        fontWeight: \"bold\" },\n    { tag: tags.emphasis,\n        fontStyle: \"italic\" },\n    { tag: tags.strong,\n        fontWeight: \"bold\" },\n    { tag: tags.strikethrough,\n        textDecoration: \"line-through\" },\n    { tag: tags.keyword,\n        color: \"#708\" },\n    { tag: [tags.atom, tags.bool, tags.url, tags.contentSeparator, tags.labelName],\n        color: \"#219\" },\n    { tag: [tags.literal, tags.inserted],\n        color: \"#164\" },\n    { tag: [tags.string, tags.deleted],\n        color: \"#a11\" },\n    { tag: [tags.regexp, tags.escape, /*@__PURE__*/tags.special(tags.string)],\n        color: \"#e40\" },\n    { tag: /*@__PURE__*/tags.definition(tags.variableName),\n        color: \"#00f\" },\n    { tag: /*@__PURE__*/tags.local(tags.variableName),\n        color: \"#30a\" },\n    { tag: [tags.typeName, tags.namespace],\n        color: \"#085\" },\n    { tag: tags.className,\n        color: \"#167\" },\n    { tag: [/*@__PURE__*/tags.special(tags.variableName), tags.macroName],\n        color: \"#256\" },\n    { tag: /*@__PURE__*/tags.definition(tags.propertyName),\n        color: \"#00c\" },\n    { tag: tags.comment,\n        color: \"#940\" },\n    { tag: tags.invalid,\n        color: \"#f00\" }\n]);\n\nconst baseTheme = /*@__PURE__*/EditorView.baseTheme({\n    \"&.cm-focused .cm-matchingBracket\": { backgroundColor: \"#328c8252\" },\n    \"&.cm-focused .cm-nonmatchingBracket\": { backgroundColor: \"#bb555544\" }\n});\nconst DefaultScanDist = 10000, DefaultBrackets = \"()[]{}\";\nconst bracketMatchingConfig = /*@__PURE__*/Facet.define({\n    combine(configs) {\n        return combineConfig(configs, {\n            afterCursor: true,\n            brackets: DefaultBrackets,\n            maxScanDistance: DefaultScanDist,\n            renderMatch: defaultRenderMatch\n        });\n    }\n});\nconst matchingMark = /*@__PURE__*/Decoration.mark({ class: \"cm-matchingBracket\" }), nonmatchingMark = /*@__PURE__*/Decoration.mark({ class: \"cm-nonmatchingBracket\" });\nfunction defaultRenderMatch(match) {\n    let decorations = [];\n    let mark = match.matched ? matchingMark : nonmatchingMark;\n    decorations.push(mark.range(match.start.from, match.start.to));\n    if (match.end)\n        decorations.push(mark.range(match.end.from, match.end.to));\n    return decorations;\n}\nconst bracketMatchingState = /*@__PURE__*/StateField.define({\n    create() { return Decoration.none; },\n    update(deco, tr) {\n        if (!tr.docChanged && !tr.selection)\n            return deco;\n        let decorations = [];\n        let config = tr.state.facet(bracketMatchingConfig);\n        for (let range of tr.state.selection.ranges) {\n            if (!range.empty)\n                continue;\n            let match = matchBrackets(tr.state, range.head, -1, config)\n                || (range.head > 0 && matchBrackets(tr.state, range.head - 1, 1, config))\n                || (config.afterCursor &&\n                    (matchBrackets(tr.state, range.head, 1, config) ||\n                        (range.head < tr.state.doc.length && matchBrackets(tr.state, range.head + 1, -1, config))));\n            if (match)\n                decorations = decorations.concat(config.renderMatch(match, tr.state));\n        }\n        return Decoration.set(decorations, true);\n    },\n    provide: f => EditorView.decorations.from(f)\n});\nconst bracketMatchingUnique = [\n    bracketMatchingState,\n    baseTheme\n];\n/**\nCreate an extension that enables bracket matching. Whenever the\ncursor is next to a bracket, that bracket and the one it matches\nare highlighted. Or, when no matching bracket is found, another\nhighlighting style is used to indicate this.\n*/\nfunction bracketMatching(config = {}) {\n    return [bracketMatchingConfig.of(config), bracketMatchingUnique];\n}\n/**\nWhen larger syntax nodes, such as HTML tags, are marked as\nopening/closing, it can be a bit messy to treat the whole node as\na matchable bracket. This node prop allows you to define, for such\na node, a ‘handle’—the part of the node that is highlighted, and\nthat the cursor must be on to activate highlighting in the first\nplace.\n*/\nconst bracketMatchingHandle = /*@__PURE__*/new NodeProp();\nfunction matchingNodes(node, dir, brackets) {\n    let byProp = node.prop(dir < 0 ? NodeProp.openedBy : NodeProp.closedBy);\n    if (byProp)\n        return byProp;\n    if (node.name.length == 1) {\n        let index = brackets.indexOf(node.name);\n        if (index > -1 && index % 2 == (dir < 0 ? 1 : 0))\n            return [brackets[index + dir]];\n    }\n    return null;\n}\nfunction findHandle(node) {\n    let hasHandle = node.type.prop(bracketMatchingHandle);\n    return hasHandle ? hasHandle(node.node) : node;\n}\n/**\nFind the matching bracket for the token at `pos`, scanning\ndirection `dir`. Only the `brackets` and `maxScanDistance`\nproperties are used from `config`, if given. Returns null if no\nbracket was found at `pos`, or a match result otherwise.\n*/\nfunction matchBrackets(state, pos, dir, config = {}) {\n    let maxScanDistance = config.maxScanDistance || DefaultScanDist, brackets = config.brackets || DefaultBrackets;\n    let tree = syntaxTree(state), node = tree.resolveInner(pos, dir);\n    for (let cur = node; cur; cur = cur.parent) {\n        let matches = matchingNodes(cur.type, dir, brackets);\n        if (matches && cur.from < cur.to) {\n            let handle = findHandle(cur);\n            if (handle && (dir > 0 ? pos >= handle.from && pos < handle.to : pos > handle.from && pos <= handle.to))\n                return matchMarkedBrackets(state, pos, dir, cur, handle, matches, brackets);\n        }\n    }\n    return matchPlainBrackets(state, pos, dir, tree, node.type, maxScanDistance, brackets);\n}\nfunction matchMarkedBrackets(_state, _pos, dir, token, handle, matching, brackets) {\n    let parent = token.parent, firstToken = { from: handle.from, to: handle.to };\n    let depth = 0, cursor = parent === null || parent === void 0 ? void 0 : parent.cursor();\n    if (cursor && (dir < 0 ? cursor.childBefore(token.from) : cursor.childAfter(token.to)))\n        do {\n            if (dir < 0 ? cursor.to <= token.from : cursor.from >= token.to) {\n                if (depth == 0 && matching.indexOf(cursor.type.name) > -1 && cursor.from < cursor.to) {\n                    let endHandle = findHandle(cursor);\n                    return { start: firstToken, end: endHandle ? { from: endHandle.from, to: endHandle.to } : undefined, matched: true };\n                }\n                else if (matchingNodes(cursor.type, dir, brackets)) {\n                    depth++;\n                }\n                else if (matchingNodes(cursor.type, -dir, brackets)) {\n                    if (depth == 0) {\n                        let endHandle = findHandle(cursor);\n                        return {\n                            start: firstToken,\n                            end: endHandle && endHandle.from < endHandle.to ? { from: endHandle.from, to: endHandle.to } : undefined,\n                            matched: false\n                        };\n                    }\n                    depth--;\n                }\n            }\n        } while (dir < 0 ? cursor.prevSibling() : cursor.nextSibling());\n    return { start: firstToken, matched: false };\n}\nfunction matchPlainBrackets(state, pos, dir, tree, tokenType, maxScanDistance, brackets) {\n    let startCh = dir < 0 ? state.sliceDoc(pos - 1, pos) : state.sliceDoc(pos, pos + 1);\n    let bracket = brackets.indexOf(startCh);\n    if (bracket < 0 || (bracket % 2 == 0) != (dir > 0))\n        return null;\n    let startToken = { from: dir < 0 ? pos - 1 : pos, to: dir > 0 ? pos + 1 : pos };\n    let iter = state.doc.iterRange(pos, dir > 0 ? state.doc.length : 0), depth = 0;\n    for (let distance = 0; !(iter.next()).done && distance <= maxScanDistance;) {\n        let text = iter.value;\n        if (dir < 0)\n            distance += text.length;\n        let basePos = pos + distance * dir;\n        for (let pos = dir > 0 ? 0 : text.length - 1, end = dir > 0 ? text.length : -1; pos != end; pos += dir) {\n            let found = brackets.indexOf(text[pos]);\n            if (found < 0 || tree.resolveInner(basePos + pos, 1).type != tokenType)\n                continue;\n            if ((found % 2 == 0) == (dir > 0)) {\n                depth++;\n            }\n            else if (depth == 1) { // Closing\n                return { start: startToken, end: { from: basePos + pos, to: basePos + pos + 1 }, matched: (found >> 1) == (bracket >> 1) };\n            }\n            else {\n                depth--;\n            }\n        }\n        if (dir > 0)\n            distance += text.length;\n    }\n    return iter.done ? { start: startToken, matched: false } : null;\n}\n\n// Counts the column offset in a string, taking tabs into account.\n// Used mostly to find indentation.\nfunction countCol(string, end, tabSize, startIndex = 0, startValue = 0) {\n    if (end == null) {\n        end = string.search(/[^\\s\\u00a0]/);\n        if (end == -1)\n            end = string.length;\n    }\n    let n = startValue;\n    for (let i = startIndex; i < end; i++) {\n        if (string.charCodeAt(i) == 9)\n            n += tabSize - (n % tabSize);\n        else\n            n++;\n    }\n    return n;\n}\n/**\nEncapsulates a single line of input. Given to stream syntax code,\nwhich uses it to tokenize the content.\n*/\nclass StringStream {\n    /**\n    Create a stream.\n    */\n    constructor(\n    /**\n    The line.\n    */\n    string, tabSize, \n    /**\n    The current indent unit size.\n    */\n    indentUnit, overrideIndent) {\n        this.string = string;\n        this.tabSize = tabSize;\n        this.indentUnit = indentUnit;\n        this.overrideIndent = overrideIndent;\n        /**\n        The current position on the line.\n        */\n        this.pos = 0;\n        /**\n        The start position of the current token.\n        */\n        this.start = 0;\n        this.lastColumnPos = 0;\n        this.lastColumnValue = 0;\n    }\n    /**\n    True if we are at the end of the line.\n    */\n    eol() { return this.pos >= this.string.length; }\n    /**\n    True if we are at the start of the line.\n    */\n    sol() { return this.pos == 0; }\n    /**\n    Get the next code unit after the current position, or undefined\n    if we're at the end of the line.\n    */\n    peek() { return this.string.charAt(this.pos) || undefined; }\n    /**\n    Read the next code unit and advance `this.pos`.\n    */\n    next() {\n        if (this.pos < this.string.length)\n            return this.string.charAt(this.pos++);\n    }\n    /**\n    Match the next character against the given string, regular\n    expression, or predicate. Consume and return it if it matches.\n    */\n    eat(match) {\n        let ch = this.string.charAt(this.pos);\n        let ok;\n        if (typeof match == \"string\")\n            ok = ch == match;\n        else\n            ok = ch && (match instanceof RegExp ? match.test(ch) : match(ch));\n        if (ok) {\n            ++this.pos;\n            return ch;\n        }\n    }\n    /**\n    Continue matching characters that match the given string,\n    regular expression, or predicate function. Return true if any\n    characters were consumed.\n    */\n    eatWhile(match) {\n        let start = this.pos;\n        while (this.eat(match)) { }\n        return this.pos > start;\n    }\n    /**\n    Consume whitespace ahead of `this.pos`. Return true if any was\n    found.\n    */\n    eatSpace() {\n        let start = this.pos;\n        while (/[\\s\\u00a0]/.test(this.string.charAt(this.pos)))\n            ++this.pos;\n        return this.pos > start;\n    }\n    /**\n    Move to the end of the line.\n    */\n    skipToEnd() { this.pos = this.string.length; }\n    /**\n    Move to directly before the given character, if found on the\n    current line.\n    */\n    skipTo(ch) {\n        let found = this.string.indexOf(ch, this.pos);\n        if (found > -1) {\n            this.pos = found;\n            return true;\n        }\n    }\n    /**\n    Move back `n` characters.\n    */\n    backUp(n) { this.pos -= n; }\n    /**\n    Get the column position at `this.pos`.\n    */\n    column() {\n        if (this.lastColumnPos < this.start) {\n            this.lastColumnValue = countCol(this.string, this.start, this.tabSize, this.lastColumnPos, this.lastColumnValue);\n            this.lastColumnPos = this.start;\n        }\n        return this.lastColumnValue;\n    }\n    /**\n    Get the indentation column of the current line.\n    */\n    indentation() {\n        var _a;\n        return (_a = this.overrideIndent) !== null && _a !== void 0 ? _a : countCol(this.string, null, this.tabSize);\n    }\n    /**\n    Match the input against the given string or regular expression\n    (which should start with a `^`). Return true or the regexp match\n    if it matches.\n    \n    Unless `consume` is set to `false`, this will move `this.pos`\n    past the matched text.\n    \n    When matching a string `caseInsensitive` can be set to true to\n    make the match case-insensitive.\n    */\n    match(pattern, consume, caseInsensitive) {\n        if (typeof pattern == \"string\") {\n            let cased = (str) => caseInsensitive ? str.toLowerCase() : str;\n            let substr = this.string.substr(this.pos, pattern.length);\n            if (cased(substr) == cased(pattern)) {\n                if (consume !== false)\n                    this.pos += pattern.length;\n                return true;\n            }\n            else\n                return null;\n        }\n        else {\n            let match = this.string.slice(this.pos).match(pattern);\n            if (match && match.index > 0)\n                return null;\n            if (match && consume !== false)\n                this.pos += match[0].length;\n            return match;\n        }\n    }\n    /**\n    Get the current token.\n    */\n    current() { return this.string.slice(this.start, this.pos); }\n}\n\nfunction fullParser(spec) {\n    return {\n        name: spec.name || \"\",\n        token: spec.token,\n        blankLine: spec.blankLine || (() => { }),\n        startState: spec.startState || (() => true),\n        copyState: spec.copyState || defaultCopyState,\n        indent: spec.indent || (() => null),\n        languageData: spec.languageData || {},\n        tokenTable: spec.tokenTable || noTokens,\n        mergeTokens: spec.mergeTokens !== false\n    };\n}\nfunction defaultCopyState(state) {\n    if (typeof state != \"object\")\n        return state;\n    let newState = {};\n    for (let prop in state) {\n        let val = state[prop];\n        newState[prop] = (val instanceof Array ? val.slice() : val);\n    }\n    return newState;\n}\nconst IndentedFrom = /*@__PURE__*/new WeakMap();\n/**\nA [language](https://codemirror.net/6/docs/ref/#language.Language) class based on a CodeMirror\n5-style [streaming parser](https://codemirror.net/6/docs/ref/#language.StreamParser).\n*/\nclass StreamLanguage extends Language {\n    constructor(parser) {\n        let data = defineLanguageFacet(parser.languageData);\n        let p = fullParser(parser), self;\n        let impl = new class extends Parser {\n            createParse(input, fragments, ranges) {\n                return new Parse(self, input, fragments, ranges);\n            }\n        };\n        super(data, impl, [], parser.name);\n        this.topNode = docID(data, this);\n        self = this;\n        this.streamParser = p;\n        this.stateAfter = new NodeProp({ perNode: true });\n        this.tokenTable = parser.tokenTable ? new TokenTable(p.tokenTable) : defaultTokenTable;\n    }\n    /**\n    Define a stream language.\n    */\n    static define(spec) { return new StreamLanguage(spec); }\n    /**\n    @internal\n    */\n    getIndent(cx) {\n        let from = undefined;\n        let { overrideIndentation } = cx.options;\n        if (overrideIndentation) {\n            from = IndentedFrom.get(cx.state);\n            if (from != null && from < cx.pos - 1e4)\n                from = undefined;\n        }\n        let start = findState(this, cx.node.tree, cx.node.from, cx.node.from, from !== null && from !== void 0 ? from : cx.pos), statePos, state;\n        if (start) {\n            state = start.state;\n            statePos = start.pos + 1;\n        }\n        else {\n            state = this.streamParser.startState(cx.unit);\n            statePos = cx.node.from;\n        }\n        if (cx.pos - statePos > 10000 /* C.MaxIndentScanDist */)\n            return null;\n        while (statePos < cx.pos) {\n            let line = cx.state.doc.lineAt(statePos), end = Math.min(cx.pos, line.to);\n            if (line.length) {\n                let indentation = overrideIndentation ? overrideIndentation(line.from) : -1;\n                let stream = new StringStream(line.text, cx.state.tabSize, cx.unit, indentation < 0 ? undefined : indentation);\n                while (stream.pos < end - line.from)\n                    readToken(this.streamParser.token, stream, state);\n            }\n            else {\n                this.streamParser.blankLine(state, cx.unit);\n            }\n            if (end == cx.pos)\n                break;\n            statePos = line.to + 1;\n        }\n        let line = cx.lineAt(cx.pos);\n        if (overrideIndentation && from == null)\n            IndentedFrom.set(cx.state, line.from);\n        return this.streamParser.indent(state, /^\\s*(.*)/.exec(line.text)[1], cx);\n    }\n    get allowsNesting() { return false; }\n}\nfunction findState(lang, tree, off, startPos, before) {\n    let state = off >= startPos && off + tree.length <= before && tree.prop(lang.stateAfter);\n    if (state)\n        return { state: lang.streamParser.copyState(state), pos: off + tree.length };\n    for (let i = tree.children.length - 1; i >= 0; i--) {\n        let child = tree.children[i], pos = off + tree.positions[i];\n        let found = child instanceof Tree && pos < before && findState(lang, child, pos, startPos, before);\n        if (found)\n            return found;\n    }\n    return null;\n}\nfunction cutTree(lang, tree, from, to, inside) {\n    if (inside && from <= 0 && to >= tree.length)\n        return tree;\n    if (!inside && from == 0 && tree.type == lang.topNode)\n        inside = true;\n    for (let i = tree.children.length - 1; i >= 0; i--) {\n        let pos = tree.positions[i], child = tree.children[i], inner;\n        if (pos < to && child instanceof Tree) {\n            if (!(inner = cutTree(lang, child, from - pos, to - pos, inside)))\n                break;\n            return !inside ? inner\n                : new Tree(tree.type, tree.children.slice(0, i).concat(inner), tree.positions.slice(0, i + 1), pos + inner.length);\n        }\n    }\n    return null;\n}\nfunction findStartInFragments(lang, fragments, startPos, endPos, editorState) {\n    for (let f of fragments) {\n        let from = f.from + (f.openStart ? 25 : 0), to = f.to - (f.openEnd ? 25 : 0);\n        let found = from <= startPos && to > startPos && findState(lang, f.tree, 0 - f.offset, startPos, to), tree;\n        if (found && found.pos <= endPos && (tree = cutTree(lang, f.tree, startPos + f.offset, found.pos + f.offset, false)))\n            return { state: found.state, tree };\n    }\n    return { state: lang.streamParser.startState(editorState ? getIndentUnit(editorState) : 4), tree: Tree.empty };\n}\nclass Parse {\n    constructor(lang, input, fragments, ranges) {\n        this.lang = lang;\n        this.input = input;\n        this.fragments = fragments;\n        this.ranges = ranges;\n        this.stoppedAt = null;\n        this.chunks = [];\n        this.chunkPos = [];\n        this.chunk = [];\n        this.chunkReused = undefined;\n        this.rangeIndex = 0;\n        this.to = ranges[ranges.length - 1].to;\n        let context = ParseContext.get(), from = ranges[0].from;\n        let { state, tree } = findStartInFragments(lang, fragments, from, this.to, context === null || context === void 0 ? void 0 : context.state);\n        this.state = state;\n        this.parsedPos = this.chunkStart = from + tree.length;\n        for (let i = 0; i < tree.children.length; i++) {\n            this.chunks.push(tree.children[i]);\n            this.chunkPos.push(tree.positions[i]);\n        }\n        if (context && this.parsedPos < context.viewport.from - 100000 /* C.MaxDistanceBeforeViewport */ &&\n            ranges.some(r => r.from <= context.viewport.from && r.to >= context.viewport.from)) {\n            this.state = this.lang.streamParser.startState(getIndentUnit(context.state));\n            context.skipUntilInView(this.parsedPos, context.viewport.from);\n            this.parsedPos = context.viewport.from;\n        }\n        this.moveRangeIndex();\n    }\n    advance() {\n        let context = ParseContext.get();\n        let parseEnd = this.stoppedAt == null ? this.to : Math.min(this.to, this.stoppedAt);\n        let end = Math.min(parseEnd, this.chunkStart + 512 /* C.ChunkSize */);\n        if (context)\n            end = Math.min(end, context.viewport.to);\n        while (this.parsedPos < end)\n            this.parseLine(context);\n        if (this.chunkStart < this.parsedPos)\n            this.finishChunk();\n        if (this.parsedPos >= parseEnd)\n            return this.finish();\n        if (context && this.parsedPos >= context.viewport.to) {\n            context.skipUntilInView(this.parsedPos, parseEnd);\n            return this.finish();\n        }\n        return null;\n    }\n    stopAt(pos) {\n        this.stoppedAt = pos;\n    }\n    lineAfter(pos) {\n        let chunk = this.input.chunk(pos);\n        if (!this.input.lineChunks) {\n            let eol = chunk.indexOf(\"\\n\");\n            if (eol > -1)\n                chunk = chunk.slice(0, eol);\n        }\n        else if (chunk == \"\\n\") {\n            chunk = \"\";\n        }\n        return pos + chunk.length <= this.to ? chunk : chunk.slice(0, this.to - pos);\n    }\n    nextLine() {\n        let from = this.parsedPos, line = this.lineAfter(from), end = from + line.length;\n        for (let index = this.rangeIndex;;) {\n            let rangeEnd = this.ranges[index].to;\n            if (rangeEnd >= end)\n                break;\n            line = line.slice(0, rangeEnd - (end - line.length));\n            index++;\n            if (index == this.ranges.length)\n                break;\n            let rangeStart = this.ranges[index].from;\n            let after = this.lineAfter(rangeStart);\n            line += after;\n            end = rangeStart + after.length;\n        }\n        return { line, end };\n    }\n    skipGapsTo(pos, offset, side) {\n        for (;;) {\n            let end = this.ranges[this.rangeIndex].to, offPos = pos + offset;\n            if (side > 0 ? end > offPos : end >= offPos)\n                break;\n            let start = this.ranges[++this.rangeIndex].from;\n            offset += start - end;\n        }\n        return offset;\n    }\n    moveRangeIndex() {\n        while (this.ranges[this.rangeIndex].to < this.parsedPos)\n            this.rangeIndex++;\n    }\n    emitToken(id, from, to, offset) {\n        let size = 4;\n        if (this.ranges.length > 1) {\n            offset = this.skipGapsTo(from, offset, 1);\n            from += offset;\n            let len0 = this.chunk.length;\n            offset = this.skipGapsTo(to, offset, -1);\n            to += offset;\n            size += this.chunk.length - len0;\n        }\n        let last = this.chunk.length - 4;\n        if (this.lang.streamParser.mergeTokens && size == 4 && last >= 0 &&\n            this.chunk[last] == id && this.chunk[last + 2] == from)\n            this.chunk[last + 2] = to;\n        else\n            this.chunk.push(id, from, to, size);\n        return offset;\n    }\n    parseLine(context) {\n        let { line, end } = this.nextLine(), offset = 0, { streamParser } = this.lang;\n        let stream = new StringStream(line, context ? context.state.tabSize : 4, context ? getIndentUnit(context.state) : 2);\n        if (stream.eol()) {\n            streamParser.blankLine(this.state, stream.indentUnit);\n        }\n        else {\n            while (!stream.eol()) {\n                let token = readToken(streamParser.token, stream, this.state);\n                if (token)\n                    offset = this.emitToken(this.lang.tokenTable.resolve(token), this.parsedPos + stream.start, this.parsedPos + stream.pos, offset);\n                if (stream.start > 10000 /* C.MaxLineLength */)\n                    break;\n            }\n        }\n        this.parsedPos = end;\n        this.moveRangeIndex();\n        if (this.parsedPos < this.to)\n            this.parsedPos++;\n    }\n    finishChunk() {\n        let tree = Tree.build({\n            buffer: this.chunk,\n            start: this.chunkStart,\n            length: this.parsedPos - this.chunkStart,\n            nodeSet,\n            topID: 0,\n            maxBufferLength: 512 /* C.ChunkSize */,\n            reused: this.chunkReused\n        });\n        tree = new Tree(tree.type, tree.children, tree.positions, tree.length, [[this.lang.stateAfter, this.lang.streamParser.copyState(this.state)]]);\n        this.chunks.push(tree);\n        this.chunkPos.push(this.chunkStart - this.ranges[0].from);\n        this.chunk = [];\n        this.chunkReused = undefined;\n        this.chunkStart = this.parsedPos;\n    }\n    finish() {\n        return new Tree(this.lang.topNode, this.chunks, this.chunkPos, this.parsedPos - this.ranges[0].from).balance();\n    }\n}\nfunction readToken(token, stream, state) {\n    stream.start = stream.pos;\n    for (let i = 0; i < 10; i++) {\n        let result = token(stream, state);\n        if (stream.pos > stream.start)\n            return result;\n    }\n    throw new Error(\"Stream parser failed to advance stream.\");\n}\nconst noTokens = /*@__PURE__*/Object.create(null);\nconst typeArray = [NodeType.none];\nconst nodeSet = /*@__PURE__*/new NodeSet(typeArray);\nconst warned = [];\n// Cache of node types by name and tags\nconst byTag = /*@__PURE__*/Object.create(null);\nconst defaultTable = /*@__PURE__*/Object.create(null);\nfor (let [legacyName, name] of [\n    [\"variable\", \"variableName\"],\n    [\"variable-2\", \"variableName.special\"],\n    [\"string-2\", \"string.special\"],\n    [\"def\", \"variableName.definition\"],\n    [\"tag\", \"tagName\"],\n    [\"attribute\", \"attributeName\"],\n    [\"type\", \"typeName\"],\n    [\"builtin\", \"variableName.standard\"],\n    [\"qualifier\", \"modifier\"],\n    [\"error\", \"invalid\"],\n    [\"header\", \"heading\"],\n    [\"property\", \"propertyName\"]\n])\n    defaultTable[legacyName] = /*@__PURE__*/createTokenType(noTokens, name);\nclass TokenTable {\n    constructor(extra) {\n        this.extra = extra;\n        this.table = Object.assign(Object.create(null), defaultTable);\n    }\n    resolve(tag) {\n        return !tag ? 0 : this.table[tag] || (this.table[tag] = createTokenType(this.extra, tag));\n    }\n}\nconst defaultTokenTable = /*@__PURE__*/new TokenTable(noTokens);\nfunction warnForPart(part, msg) {\n    if (warned.indexOf(part) > -1)\n        return;\n    warned.push(part);\n    console.warn(msg);\n}\nfunction createTokenType(extra, tagStr) {\n    let tags$1 = [];\n    for (let name of tagStr.split(\" \")) {\n        let found = [];\n        for (let part of name.split(\".\")) {\n            let value = (extra[part] || tags[part]);\n            if (!value) {\n                warnForPart(part, `Unknown highlighting tag ${part}`);\n            }\n            else if (typeof value == \"function\") {\n                if (!found.length)\n                    warnForPart(part, `Modifier ${part} used at start of tag`);\n                else\n                    found = found.map(value);\n            }\n            else {\n                if (found.length)\n                    warnForPart(part, `Tag ${part} used as modifier`);\n                else\n                    found = Array.isArray(value) ? value : [value];\n            }\n        }\n        for (let tag of found)\n            tags$1.push(tag);\n    }\n    if (!tags$1.length)\n        return 0;\n    let name = tagStr.replace(/ /g, \"_\"), key = name + \" \" + tags$1.map(t => t.id);\n    let known = byTag[key];\n    if (known)\n        return known.id;\n    let type = byTag[key] = NodeType.define({\n        id: typeArray.length,\n        name,\n        props: [styleTags({ [name]: tags$1 })]\n    });\n    typeArray.push(type);\n    return type.id;\n}\nfunction docID(data, lang) {\n    let type = NodeType.define({ id: typeArray.length, name: \"Document\", props: [\n            languageDataProp.add(() => data),\n            indentNodeProp.add(() => cx => lang.getIndent(cx))\n        ], top: true });\n    typeArray.push(type);\n    return type;\n}\n\nfunction buildForLine(line) {\n    return line.length <= 4096 && /[\\u0590-\\u05f4\\u0600-\\u06ff\\u0700-\\u08ac\\ufb50-\\ufdff]/.test(line);\n}\nfunction textHasRTL(text) {\n    for (let i = text.iter(); !i.next().done;)\n        if (buildForLine(i.value))\n            return true;\n    return false;\n}\nfunction changeAddsRTL(change) {\n    let added = false;\n    change.iterChanges((fA, tA, fB, tB, ins) => {\n        if (!added && textHasRTL(ins))\n            added = true;\n    });\n    return added;\n}\nconst alwaysIsolate = /*@__PURE__*/Facet.define({ combine: values => values.some(x => x) });\n/**\nMake sure nodes\n[marked](https://lezer.codemirror.net/docs/ref/#common.NodeProp^isolate)\nas isolating for bidirectional text are rendered in a way that\nisolates them from the surrounding text.\n*/\nfunction bidiIsolates(options = {}) {\n    let extensions = [isolateMarks];\n    if (options.alwaysIsolate)\n        extensions.push(alwaysIsolate.of(true));\n    return extensions;\n}\nconst isolateMarks = /*@__PURE__*/ViewPlugin.fromClass(class {\n    constructor(view) {\n        this.always = view.state.facet(alwaysIsolate) ||\n            view.textDirection != Direction.LTR ||\n            view.state.facet(EditorView.perLineTextDirection);\n        this.hasRTL = !this.always && textHasRTL(view.state.doc);\n        this.tree = syntaxTree(view.state);\n        this.decorations = this.always || this.hasRTL ? buildDeco(view, this.tree, this.always) : Decoration.none;\n    }\n    update(update) {\n        let always = update.state.facet(alwaysIsolate) ||\n            update.view.textDirection != Direction.LTR ||\n            update.state.facet(EditorView.perLineTextDirection);\n        if (!always && !this.hasRTL && changeAddsRTL(update.changes))\n            this.hasRTL = true;\n        if (!always && !this.hasRTL)\n            return;\n        let tree = syntaxTree(update.state);\n        if (always != this.always || tree != this.tree || update.docChanged || update.viewportChanged) {\n            this.tree = tree;\n            this.always = always;\n            this.decorations = buildDeco(update.view, tree, always);\n        }\n    }\n}, {\n    provide: plugin => {\n        function access(view) {\n            var _a, _b;\n            return (_b = (_a = view.plugin(plugin)) === null || _a === void 0 ? void 0 : _a.decorations) !== null && _b !== void 0 ? _b : Decoration.none;\n        }\n        return [EditorView.outerDecorations.of(access),\n            Prec.lowest(EditorView.bidiIsolatedRanges.of(access))];\n    }\n});\nfunction buildDeco(view, tree, always) {\n    let deco = new RangeSetBuilder();\n    let ranges = view.visibleRanges;\n    if (!always)\n        ranges = clipRTLLines(ranges, view.state.doc);\n    for (let { from, to } of ranges) {\n        tree.iterate({\n            enter: node => {\n                let iso = node.type.prop(NodeProp.isolate);\n                if (iso)\n                    deco.add(node.from, node.to, marks[iso]);\n            },\n            from, to\n        });\n    }\n    return deco.finish();\n}\nfunction clipRTLLines(ranges, doc) {\n    let cur = doc.iter(), pos = 0, result = [], last = null;\n    for (let { from, to } of ranges) {\n        if (last && last.to > from) {\n            from = last.to;\n            if (from >= to)\n                continue;\n        }\n        if (pos + cur.value.length < from) {\n            cur.next(from - (pos + cur.value.length));\n            pos = from;\n        }\n        for (;;) {\n            let start = pos, end = pos + cur.value.length;\n            if (!cur.lineBreak && buildForLine(cur.value)) {\n                if (last && last.to > start - 10)\n                    last.to = Math.min(to, end);\n                else\n                    result.push(last = { from: start, to: Math.min(to, end) });\n            }\n            if (end >= to)\n                break;\n            pos = end;\n            cur.next();\n        }\n    }\n    return result;\n}\nconst marks = {\n    rtl: /*@__PURE__*/Decoration.mark({ class: \"cm-iso\", inclusive: true, attributes: { dir: \"rtl\" }, bidiIsolate: Direction.RTL }),\n    ltr: /*@__PURE__*/Decoration.mark({ class: \"cm-iso\", inclusive: true, attributes: { dir: \"ltr\" }, bidiIsolate: Direction.LTR }),\n    auto: /*@__PURE__*/Decoration.mark({ class: \"cm-iso\", inclusive: true, attributes: { dir: \"auto\" }, bidiIsolate: null })\n};\n\nexport { DocInput, HighlightStyle, IndentContext, LRLanguage, Language, LanguageDescription, LanguageSupport, ParseContext, StreamLanguage, StringStream, TreeIndentContext, bidiIsolates, bracketMatching, bracketMatchingHandle, codeFolding, continuedIndent, defaultHighlightStyle, defineLanguageFacet, delimitedIndent, ensureSyntaxTree, flatIndent, foldAll, foldCode, foldEffect, foldGutter, foldInside, foldKeymap, foldNodeProp, foldService, foldState, foldable, foldedRanges, forceParsing, getIndentUnit, getIndentation, highlightingFor, indentNodeProp, indentOnInput, indentRange, indentService, indentString, indentUnit, language, languageDataProp, matchBrackets, sublanguageProp, syntaxHighlighting, syntaxParserRunning, syntaxTree, syntaxTreeAvailable, toggleFold, unfoldAll, unfoldCode, unfoldEffect };\n"],"names":["data","_a","language","from","to","pos","indentUnit","line","name"],"mappings":";;;;;AAMA,IAAI;AAKC,MAAC,mBAAgC,oBAAI,SAAQ;AASlD,SAAS,oBAAoB,UAAU;AACnC,SAAO,MAAM,OAAO;AAAA,IAChB,SAAS,WAAW,YAAU,OAAO,OAAO,QAAQ,IAAI;AAAA,EAChE,CAAK;AACL;AAKK,MAAC,kBAA+B,oBAAI,SAAQ;AAUjD,MAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQX,YAKA,MAAM,QAAQ,kBAAkB,CAAA,GAIhC,OAAO,IAAI;AACP,SAAK,OAAO;AACZ,SAAK,OAAO;AAIZ,QAAI,CAAC,YAAY,UAAU,eAAe,MAAM;AAC5C,aAAO,eAAe,YAAY,WAAW,QAAQ,EAAE,MAAM;AAAE,eAAO,WAAW,IAAI;AAAA,MAAG,EAAC,CAAE;AAC/F,SAAK,SAAS;AACd,SAAK,YAAY;AAAA,MACb,SAAS,GAAG,IAAI;AAAA,MAChB,YAAY,aAAa,GAAG,CAAC,OAAO,KAAK,SAAS;AAC9C,YAAI,MAAM,UAAU,OAAO,KAAK,IAAI,GAAGA,QAAO,IAAI,KAAK,KAAK,gBAAgB;AAC5E,YAAI,CAACA;AACD,iBAAO,CAAA;AACX,YAAI,OAAO,MAAM,MAAMA,KAAI,GAAG,MAAM,IAAI,KAAK,KAAK,eAAe;AACjE,YAAI,KAAK;AACL,cAAI,YAAY,IAAI,QAAQ,MAAM,IAAI,MAAM,IAAI;AAChD,mBAAS,WAAW;AAChB,gBAAI,QAAQ,KAAK,WAAW,KAAK,GAAG;AAChC,kBAAIA,QAAO,MAAM,MAAM,QAAQ,KAAK;AACpC,qBAAO,QAAQ,QAAQ,YAAYA,QAAOA,MAAK,OAAO,IAAI;AAAA,YAC9D;AAAA,QACR;AACA,eAAO;AAAA,MACX,CAAC;AAAA,IACb,EAAU,OAAO,eAAe;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAIA,WAAW,OAAO,KAAK,OAAO,IAAI;AAC9B,WAAO,UAAU,OAAO,KAAK,IAAI,EAAE,KAAK,KAAK,gBAAgB,KAAK,KAAK;AAAA,EAC3E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,OAAO;AACf,QAAI,OAAO,MAAM,MAAM,QAAQ;AAC/B,SAAK,SAAS,QAAQ,SAAS,SAAS,SAAS,KAAK,SAAS,KAAK;AAChE,aAAO,CAAC,EAAE,MAAM,GAAG,IAAI,MAAM,IAAI,QAAQ;AAC7C,QAAI,CAAC,QAAQ,CAAC,KAAK;AACf,aAAO,CAAA;AACX,QAAI,SAAS,CAAA;AACb,QAAI,UAAU,CAAC,MAAM,SAAS;AAC1B,UAAI,KAAK,KAAK,gBAAgB,KAAK,KAAK,MAAM;AAC1C,eAAO,KAAK,EAAE,MAAM,IAAI,OAAO,KAAK,QAAQ;AAC5C;AAAA,MACJ;AACA,UAAI,QAAQ,KAAK,KAAK,SAAS,OAAO;AACtC,UAAI,OAAO;AACP,YAAI,MAAM,KAAK,KAAK,gBAAgB,KAAK,KAAK,MAAM;AAChD,cAAI,MAAM;AACN,qBAAS,KAAK,MAAM;AAChB,qBAAO,KAAK,EAAE,MAAM,EAAE,OAAO,MAAM,IAAI,EAAE,KAAK,KAAI,CAAE;AAAA;AAExD,mBAAO,KAAK,EAAE,MAAY,IAAI,OAAO,KAAK,QAAQ;AACtD;AAAA,QACJ,WACS,MAAM,SAAS;AACpB,cAAI,OAAO,OAAO;AAClB,kBAAQ,MAAM,MAAM,MAAM,QAAQ,CAAC,EAAE,OAAO,IAAI;AAChD,cAAI,OAAO,SAAS;AAChB;AAAA,QACR;AAAA,MACJ;AACA,eAAS,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;AAC3C,YAAI,KAAK,KAAK,SAAS,CAAC;AACxB,YAAI,cAAc;AACd,kBAAQ,IAAI,KAAK,UAAU,CAAC,IAAI,IAAI;AAAA,MAC5C;AAAA,IACJ;AACA,YAAQ,WAAW,KAAK,GAAG,CAAC;AAC5B,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,gBAAgB;AAAE,WAAO;AAAA,EAAM;AACvC;AAIA,SAAS,WAAwB,4BAAY,OAAM;AACnD,SAAS,UAAU,OAAO,KAAK,MAAM;AACjC,MAAI,UAAU,MAAM,MAAM,QAAQ,GAAG,OAAO,WAAW,KAAK,EAAE;AAC9D,MAAI,CAAC,WAAW,QAAQ,eAAe;AACnC,aAAS,OAAO,MAAM,MAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,iBAAiB,SAAS,cAAc;AACtG,UAAI,KAAK,KAAK;AACV,eAAO;AAAA,EACnB;AACA,SAAO;AACX;AAMA,MAAM,mBAAmB,SAAS;AAAA,EAC9B,YAAY,MAAM,QAAQ,MAAM;AAC5B,UAAM,MAAM,QAAQ,CAAA,GAAI,IAAI;AAC5B,SAAK,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO,OAAO,MAAM;AAChB,QAAI,OAAO,oBAAoB,KAAK,YAAY;AAChD,WAAO,IAAI,WAAW,MAAM,KAAK,OAAO,UAAU;AAAA,MAC9C,OAAO,CAAC,iBAAiB,IAAI,UAAQ,KAAK,QAAQ,OAAO,MAAS,CAAC;AAAA,IAC/E,CAAS,GAAG,KAAK,IAAI;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,SAAS,MAAM;AACrB,WAAO,IAAI,WAAW,KAAK,MAAM,KAAK,OAAO,UAAU,OAAO,GAAG,QAAQ,KAAK,IAAI;AAAA,EACtF;AAAA,EACA,IAAI,gBAAgB;AAAE,WAAO,KAAK,OAAO,YAAW;AAAA,EAAI;AAC5D;AAOA,SAAS,WAAW,OAAO;AACvB,MAAI,QAAQ,MAAM,MAAM,SAAS,OAAO,KAAK;AAC7C,SAAO,QAAQ,MAAM,OAAO,KAAK;AACrC;AA0DA,MAAM,SAAS;AAAA;AAAA;AAAA;AAAA,EAIX,YAAY,KAAK;AACb,SAAK,MAAM;AACX,SAAK,YAAY;AACjB,SAAK,SAAS;AACd,SAAK,SAAS,IAAI,KAAI;AAAA,EAC1B;AAAA,EACA,IAAI,SAAS;AAAE,WAAO,KAAK,IAAI;AAAA,EAAQ;AAAA,EACvC,OAAO,KAAK;AACR,SAAK,SAAS,KAAK,OAAO,KAAK,MAAM,KAAK,SAAS,EAAE;AACrD,SAAK,YAAY,MAAM,KAAK,OAAO;AACnC,WAAO,KAAK,YAAY,KAAK,OAAO;AAAA,EACxC;AAAA,EACA,MAAM,KAAK;AACP,SAAK,OAAO,GAAG;AACf,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,aAAa;AAAE,WAAO;AAAA,EAAM;AAAA,EAChC,KAAK,MAAM,IAAI;AACX,QAAI,cAAc,KAAK,YAAY,KAAK,OAAO;AAC/C,QAAI,OAAO,eAAe,MAAM,KAAK;AACjC,aAAO,KAAK,IAAI,YAAY,MAAM,EAAE;AAAA;AAEpC,aAAO,KAAK,OAAO,MAAM,OAAO,aAAa,KAAK,WAAW;AAAA,EACrE;AACJ;AACA,IAAI,iBAAiB;AAIrB,MAAM,aAAa;AAAA,EACf,YAAY,QAIZ,OAIA,YAAY,CAAA,GAIZ,MAIA,SASA,UAIA,SAMA,YAAY;AACR,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,YAAY;AACjB,SAAK,OAAO;AACZ,SAAK,UAAU;AACf,SAAK,WAAW;AAChB,SAAK,UAAU;AACf,SAAK,aAAa;AAClB,SAAK,QAAQ;AAIb,SAAK,cAAc,CAAA;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO,OAAO,QAAQ,OAAO,UAAU;AACnC,WAAO,IAAI,aAAa,QAAQ,OAAO,CAAA,GAAI,KAAK,OAAO,GAAG,UAAU,CAAA,GAAI,IAAI;AAAA,EAChF;AAAA,EACA,aAAa;AACT,WAAO,KAAK,OAAO,WAAW,IAAI,SAAS,KAAK,MAAM,GAAG,GAAG,KAAK,SAAS;AAAA,EAC9E;AAAA;AAAA;AAAA;AAAA,EAIA,KAAK,OAAO,MAAM;AACd,QAAI,QAAQ,QAAQ,QAAQ,KAAK,MAAM,IAAI;AACvC,aAAO;AACX,QAAI,KAAK,QAAQ,KAAK,SAAS,KAAK,OAAO,SAAS,QAAQ,SAAS,SAAS,OAAO,KAAK,MAAM,IAAI,MAAM,GAAG;AACzG,WAAK,SAAQ;AACb,aAAO;AAAA,IACX;AACA,WAAO,KAAK,YAAY,MAAM;AAC1B,UAAIC;AACJ,UAAI,OAAO,SAAS,UAAU;AAC1B,YAAI,UAAU,KAAK,IAAG,IAAK;AAC3B,gBAAQ,MAAM,KAAK,IAAG,IAAK;AAAA,MAC/B;AACA,UAAI,CAAC,KAAK;AACN,aAAK,QAAQ,KAAK,WAAU;AAChC,UAAI,QAAQ,SAAS,KAAK,MAAM,aAAa,QAAQ,KAAK,MAAM,YAAY,SACxE,OAAO,KAAK,MAAM,IAAI;AACtB,aAAK,MAAM,OAAO,IAAI;AAC1B,iBAAS;AACL,YAAI,OAAO,KAAK,MAAM,QAAO;AAC7B,YAAI,MAAM;AACN,eAAK,YAAY,KAAK,mBAAmB,aAAa,QAAQ,MAAM,KAAK,WAAW,KAAK,MAAM,aAAa,IAAI,CAAC;AACjH,eAAK,WAAWA,MAAK,KAAK,MAAM,eAAe,QAAQA,QAAO,SAASA,MAAK,KAAK,MAAM,IAAI;AAC3F,eAAK,OAAO;AACZ,eAAK,QAAQ;AACb,cAAI,KAAK,WAAW,SAAS,QAAQ,SAAS,SAAS,OAAO,KAAK,MAAM,IAAI;AACzE,iBAAK,QAAQ,KAAK,WAAU;AAAA;AAE5B,mBAAO;AAAA,QACf;AACA,YAAI,MAAK;AACL,iBAAO;AAAA,MACf;AAAA,IACJ,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,WAAW;AACP,QAAI,KAAK;AACT,QAAI,KAAK,UAAU,MAAM,KAAK,MAAM,cAAc,KAAK,SAAS;AAC5D,UAAI,KAAK,MAAM,aAAa,QAAQ,KAAK,MAAM,YAAY;AACvD,aAAK,MAAM,OAAO,GAAG;AACzB,WAAK,YAAY,MAAM;AAAE,eAAO,EAAE,OAAO,KAAK,MAAM,QAAO,IAAK;AAAA,QAAE;AAAA,MAAE,CAAC;AACrE,WAAK,UAAU;AACf,WAAK,OAAO;AACZ,WAAK,YAAY,KAAK,mBAAmB,aAAa,QAAQ,KAAK,MAAM,KAAK,WAAW,IAAI,CAAC;AAC9F,WAAK,QAAQ;AAAA,IACjB;AAAA,EACJ;AAAA,EACA,YAAY,GAAG;AACX,QAAI,OAAO;AACX,qBAAiB;AACjB,QAAI;AACA,aAAO,EAAC;AAAA,IACZ,UACR;AACY,uBAAiB;AAAA,IACrB;AAAA,EACJ;AAAA,EACA,mBAAmB,WAAW;AAC1B,aAAS,GAAG,IAAI,KAAK,YAAY,IAAG;AAChC,kBAAY,aAAa,WAAW,EAAE,MAAM,EAAE,EAAE;AACpD,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,QAAQ,SAAS,UAAU;AACvB,QAAI,EAAE,WAAW,MAAM,SAAS,UAAU,QAAO,IAAK;AACtD,SAAK,SAAQ;AACb,QAAI,CAAC,QAAQ,OAAO;AAChB,UAAI,SAAS,CAAA;AACb,cAAQ,kBAAkB,CAAC,OAAO,KAAK,OAAO,QAAQ,OAAO,KAAK,EAAE,OAAO,KAAK,OAAO,IAAG,CAAE,CAAC;AAC7F,kBAAY,aAAa,aAAa,WAAW,MAAM;AACvD,aAAO,KAAK;AACZ,gBAAU;AACV,iBAAW,EAAE,MAAM,QAAQ,OAAO,SAAS,MAAM,EAAE,GAAG,IAAI,QAAQ,OAAO,SAAS,IAAI,CAAC,EAAC;AACxF,UAAI,KAAK,QAAQ,QAAQ;AACrB,kBAAU,CAAA;AACV,iBAAS,KAAK,KAAK,SAAS;AACxB,cAAI,OAAO,QAAQ,OAAO,EAAE,MAAM,CAAC,GAAG,KAAK,QAAQ,OAAO,EAAE,IAAI,EAAE;AAClE,cAAI,OAAO;AACP,oBAAQ,KAAK,EAAE,MAAM,GAAE,CAAE;AAAA,QACjC;AAAA,MACJ;AAAA,IACJ;AACA,WAAO,IAAI,aAAa,KAAK,QAAQ,UAAU,WAAW,MAAM,SAAS,UAAU,SAAS,KAAK,UAAU;AAAA,EAC/G;AAAA;AAAA;AAAA;AAAA,EAIA,eAAe,UAAU;AACrB,QAAI,KAAK,SAAS,QAAQ,SAAS,QAAQ,KAAK,SAAS,MAAM,SAAS;AACpE,aAAO;AACX,SAAK,WAAW;AAChB,QAAI,WAAW,KAAK,QAAQ;AAC5B,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KAAK;AAC1C,UAAI,EAAE,MAAM,GAAE,IAAK,KAAK,QAAQ,CAAC;AACjC,UAAI,OAAO,SAAS,MAAM,KAAK,SAAS,MAAM;AAC1C,aAAK,YAAY,aAAa,KAAK,WAAW,MAAM,EAAE;AACtD,aAAK,QAAQ,OAAO,KAAK,CAAC;AAAA,MAC9B;AAAA,IACJ;AACA,QAAI,KAAK,QAAQ,UAAU;AACvB,aAAO;AACX,SAAK,MAAK;AACV,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,QAAQ;AACJ,QAAI,KAAK,OAAO;AACZ,WAAK,SAAQ;AACb,WAAK,QAAQ;AAAA,IACjB;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAgB,MAAM,IAAI;AACtB,SAAK,QAAQ,KAAK,EAAE,MAAM,GAAE,CAAE;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,OAAO,kBAAkB,OAAO;AAC5B,WAAO,IAAI,cAAc,OAAO;AAAA,MAC5B,YAAY,OAAO,WAAW,QAAQ;AAClC,YAAI,OAAO,OAAO,CAAC,EAAE,MAAM,KAAK,OAAO,OAAO,SAAS,CAAC,EAAE;AAC1D,YAAI,SAAS;AAAA,UACT,WAAW;AAAA,UACX,UAAU;AACN,gBAAI,KAAK;AACT,gBAAI,IAAI;AACJ,uBAAS,KAAK;AACV,mBAAG,YAAY,KAAK,CAAC;AACzB,kBAAI;AACA,mBAAG,aAAa,GAAG,aAAa,QAAQ,IAAI,CAAC,GAAG,YAAY,KAAK,CAAC,IAAI;AAAA,YAC9E;AACA,iBAAK,YAAY;AACjB,mBAAO,IAAI,KAAK,SAAS,MAAM,CAAA,GAAI,CAAA,GAAI,KAAK,IAAI;AAAA,UACpD;AAAA,UACA,WAAW;AAAA,UACX,SAAS;AAAA,UAAE;AAAA,QAC/B;AACgB,eAAO;AAAA,MACX;AAAA,IACZ;AAAA,EACI;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO,MAAM;AACT,WAAO,KAAK,IAAI,MAAM,KAAK,MAAM,IAAI,MAAM;AAC3C,QAAI,QAAQ,KAAK;AACjB,WAAO,KAAK,WAAW,QAAQ,MAAM,UAAU,MAAM,CAAC,EAAE,QAAQ,KAAK,MAAM,CAAC,EAAE,MAAM;AAAA,EACxF;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,MAAM;AAAE,WAAO;AAAA,EAAgB;AAC1C;AACA,SAAS,aAAa,WAAW,MAAM,IAAI;AACvC,SAAO,aAAa,aAAa,WAAW,CAAC,EAAE,OAAO,MAAM,KAAK,IAAI,OAAO,MAAM,KAAK,GAAE,CAAE,CAAC;AAChG;AACA,MAAM,cAAc;AAAA,EAChB,YAGA,SAAS;AACL,SAAK,UAAU;AACf,SAAK,OAAO,QAAQ;AAAA,EACxB;AAAA,EACA,MAAM,IAAI;AACN,QAAI,CAAC,GAAG,cAAc,KAAK,QAAQ,KAAK,QAAQ;AAC5C,aAAO;AACX,QAAI,QAAQ,KAAK,QAAQ,QAAQ,GAAG,SAAS,GAAG,KAAK;AAIrD,QAAI,OAAO,KAAK,QAAQ,WAAW,GAAG,WAAW,IAAI,SAAS,SACxD,KAAK,IAAI,GAAG,QAAQ,OAAO,KAAK,QAAQ,OAAO,GAAG,MAAM,SAAS,EAAE;AACzE,QAAI,CAAC,MAAM,KAAK,IAAqB,IAAI;AACrC,YAAM,SAAQ;AAClB,WAAO,IAAI,cAAc,KAAK;AAAA,EAClC;AAAA,EACA,OAAO,KAAK,OAAO;AACf,QAAI,OAAO,KAAK,IAAI,KAA8B,MAAM,IAAI,MAAM;AAClE,QAAI,aAAa,aAAa,OAAO,MAAM,MAAM,QAAQ,EAAE,QAAQ,OAAO,EAAE,MAAM,GAAG,IAAI,KAAI,CAAE;AAC/F,QAAI,CAAC,WAAW,KAAK,IAAqB,IAAI;AAC1C,iBAAW,SAAQ;AACvB,WAAO,IAAI,cAAc,UAAU;AAAA,EACvC;AACJ;AACA,SAAS,QAAqB,2BAAW,OAAO;AAAA,EAC5C,QAAQ,cAAc;AAAA,EACtB,OAAO,OAAO,IAAI;AACd,aAAS,KAAK,GAAG;AACb,UAAI,EAAE,GAAG,SAAS,QAAQ;AACtB,eAAO,EAAE;AACjB,QAAI,GAAG,WAAW,MAAM,QAAQ,KAAK,GAAG,MAAM,MAAM,QAAQ;AACxD,aAAO,cAAc,KAAK,GAAG,KAAK;AACtC,WAAO,MAAM,MAAM,EAAE;AAAA,EACzB;AACJ,CAAC;AACD,IAAI,cAAc,CAAC,aAAa;AAC5B,MAAI,UAAU;AAAA,IAAW,MAAM,SAAQ;AAAA,IAAI;AAAA;AAAA,EAAG;AAC9C,SAAO,MAAM,aAAa,OAAO;AACrC;AACA,IAAI,OAAO,uBAAuB;AAC9B,gBAAc,CAAC,aAAa;AACxB,QAAI,OAAO,IAAI,UAAU;AAAA,MAAW,MAAM;AACtC,eAAO,oBAAoB,UAAU;AAAA,UAAE,SAAS,MAA0B;AAAA;AAAA,SAAyB;AAAA,MACvG;AAAA,MAAG;AAAA;AAAA,IAAG;AACN,WAAO,MAAM,OAAO,IAAI,aAAa,OAAO,IAAI,mBAAmB,IAAI;AAAA,EAC3E;AACJ,MAAM,iBAAiB,OAAO,aAAa,iBAAiB,KAAK,UAAU,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,kBACzH,MAAM,UAAU,WAAW,eAAc,IAAK;AACpD,MAAM,cAA2B,2BAAW,UAAU,MAAM,YAAY;AAAA,EACpE,YAAY,MAAM;AACd,SAAK,OAAO;AACZ,SAAK,UAAU;AACf,SAAK,gBAAgB;AAErB,SAAK,WAAW;AAEhB,SAAK,cAAc;AACnB,SAAK,OAAO,KAAK,KAAK,KAAK,IAAI;AAC/B,SAAK,aAAY;AAAA,EACrB;AAAA,EACA,OAAO,QAAQ;AACX,QAAI,KAAK,KAAK,KAAK,MAAM,MAAM,SAAS,KAAK,EAAE;AAC/C,QAAI,GAAG,eAAe,OAAO,KAAK,QAAQ,KAAK,KAAK,KAAK,SAAS,KAAK,GAAG;AACtE,WAAK,aAAY;AACrB,QAAI,OAAO,cAAc,OAAO,cAAc;AAC1C,UAAI,KAAK,KAAK;AACV,aAAK,eAAe;AACxB,WAAK,aAAY;AAAA,IACrB;AACA,SAAK,mBAAmB,EAAE;AAAA,EAC9B;AAAA,EACA,eAAe;AACX,QAAI,KAAK;AACL;AACJ,QAAI,EAAE,UAAU,KAAK,MAAM,QAAQ,MAAM,MAAM,SAAS,KAAK;AAC7D,QAAI,MAAM,QAAQ,MAAM,QAAQ,QAAQ,CAAC,MAAM,QAAQ,OAAO,MAAM,IAAI,MAAM;AAC1E,WAAK,UAAU,YAAY,KAAK,IAAI;AAAA,EAC5C;AAAA,EACA,KAAK,UAAU;AACX,SAAK,UAAU;AACf,QAAI,MAAM,KAAK,IAAG;AAClB,QAAI,KAAK,WAAW,QAAQ,KAAK,WAAW,KAAK,KAAK,KAAK,WAAW;AAClE,WAAK,WAAW,MAAM;AACtB,WAAK,cAAc;AAAA,IACvB;AACA,QAAI,KAAK,eAAe;AACpB;AACJ,QAAI,EAAE,OAAO,UAAU,EAAE,IAAI,KAAI,EAAE,IAAK,KAAK,MAAM,QAAQ,MAAM,MAAM,SAAS,KAAK;AACrF,QAAI,MAAM,QAAQ,MAAM,QAAQ,QAAQ,MAAM,QAAQ;AAAA,MAAO,OAAO;AAAA;AAAA,IAAM;AACtE;AACJ,QAAI,UAAU,KAAK,IAAG,IAAK,KAAK,IAAI,KAAK,aAAa,KAAsB,YAAY,CAAC,iBAAiB,KAAK,IAAI,IAAwB,SAAS,cAAa,IAAK,CAAC,IAAI,GAAG;AAC9K,QAAI,gBAAgB,MAAM,QAAQ,UAAU,QAAQ,MAAM,IAAI,SAAS,OAAO;AAC9E,QAAI,OAAO,MAAM,QAAQ,KAAK,MAAM;AAChC,aAAO,kBAAkB,eAAc,KAAM,KAAK,IAAG,IAAK;AAAA,IAC9D,GAAG,QAAQ,gBAAgB,IAAI,IAAgC;AAC/D,SAAK,eAAe,KAAK,IAAG,IAAK;AACjC,QAAI,QAAQ,KAAK,eAAe,GAAG;AAC/B,YAAM,QAAQ,SAAQ;AACtB,WAAK,KAAK,SAAS,EAAE,SAAS,SAAS,SAAS,GAAG,IAAI,cAAc,MAAM,OAAO,CAAC,EAAC,CAAE;AAAA,IAC1F;AACA,QAAI,KAAK,cAAc,KAAK,EAAE,QAAQ,CAAC;AACnC,WAAK,aAAY;AACrB,SAAK,mBAAmB,MAAM,OAAO;AAAA,EACzC;AAAA,EACA,mBAAmB,IAAI;AACnB,QAAI,GAAG,YAAY;AACf,WAAK;AACL,SAAG,WACE,KAAK,MAAM,KAAK,aAAY,CAAE,EAC9B,MAAM,SAAO,aAAa,KAAK,KAAK,OAAO,GAAG,CAAC,EAC/C,KAAK,MAAM,KAAK,eAAe;AACpC,SAAG,aAAa;AAAA,IACpB;AAAA,EACJ;AAAA,EACA,UAAU;AACN,QAAI,KAAK;AACL,WAAK,QAAO;AAAA,EACpB;AAAA,EACA,YAAY;AACR,WAAO,CAAC,EAAE,KAAK,WAAW,KAAK,gBAAgB;AAAA,EACnD;AACJ,GAAG;AAAA,EACC,eAAe,EAAE,QAAQ;AAAE,SAAK,aAAY;AAAA,EAAI,EAAC;AACrD,CAAC;AAOI,MAAC,WAAwB,sBAAM,OAAO;AAAA,EACvC,QAAQ,WAAW;AAAE,WAAO,UAAU,SAAS,UAAU,CAAC,IAAI;AAAA,EAAM;AAAA,EACpE,SAAS,CAAAC,cAAY;AAAA,IACjB,SAAS;AAAA,IACT;AAAA,IACA,WAAW,kBAAkB,QAAQ,CAACA,SAAQ,GAAG,WAAS;AACtD,UAAI,OAAO,MAAM,MAAMA,SAAQ;AAC/B,aAAO,QAAQ,KAAK,OAAO,EAAE,iBAAiB,KAAK,KAAI,IAAK,CAAA;AAAA,IAChE,CAAC;AAAA,EACT;AACA,CAAC;AAQD,MAAM,gBAAgB;AAAA;AAAA;AAAA;AAAA,EAIlB,YAIAA,WAOA,UAAU,CAAA,GAAI;AACV,SAAK,WAAWA;AAChB,SAAK,UAAU;AACf,SAAK,YAAY,CAACA,WAAU,OAAO;AAAA,EACvC;AACJ;AAOA,MAAM,oBAAoB;AAAA,EACtB,YAIA,MAIA,OAIA,YAKA,UAAU,UAIV,UAAU,QAAW;AACjB,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,aAAa;AAClB,SAAK,WAAW;AAChB,SAAK,WAAW;AAChB,SAAK,UAAU;AACf,SAAK,UAAU;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO;AACH,WAAO,KAAK,YAAY,KAAK,UAAU,KAAK,SAAQ,EAAG,KAAK,aAAW,KAAK,UAAU,SAAS,SAAO;AAAE,WAAK,UAAU;AAAM,YAAM;AAAA,IAAK,CAAC;AAAA,EAC7I;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO,GAAG,MAAM;AACZ,QAAI,EAAE,MAAM,QAAO,IAAK;AACxB,QAAI,CAAC,MAAM;AACP,UAAI,CAAC;AACD,cAAM,IAAI,WAAW,gEAAgE;AACzF,aAAO,MAAM,QAAQ,QAAQ,OAAO;AAAA,IACxC;AACA,WAAO,IAAI,oBAAoB,KAAK,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,IAAI,EAAE,IAAI,OAAK,EAAE,YAAW,CAAE,GAAG,KAAK,cAAc,CAAA,GAAI,KAAK,UAAU,MAAM,OAAO;AAAA,EACjK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,cAAc,OAAO,UAAU;AAClC,aAAS,KAAK;AACV,UAAI,EAAE,YAAY,EAAE,SAAS,KAAK,QAAQ;AACtC,eAAO;AACf,QAAI,MAAM,aAAa,KAAK,QAAQ;AACpC,QAAI;AACA,eAAS,KAAK;AACV,YAAI,EAAE,WAAW,QAAQ,IAAI,CAAC,CAAC,IAAI;AAC/B,iBAAO;AAAA;AACnB,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,kBAAkB,OAAO,MAAM,QAAQ,MAAM;AAChD,WAAO,KAAK,YAAW;AACvB,aAAS,KAAK;AACV,UAAI,EAAE,MAAM,KAAK,OAAK,KAAK,IAAI;AAC3B,eAAO;AACf,QAAI;AACA,eAAS,KAAK;AACV,iBAAS,KAAK,EAAE,OAAO;AACnB,cAAI,QAAQ,KAAK,QAAQ,CAAC;AAC1B,cAAI,QAAQ,OAAO,EAAE,SAAS,KAAK,CAAC,KAAK,KAAK,KAAK,QAAQ,CAAC,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,QAAQ,EAAE,MAAM,CAAC;AAC/F,mBAAO;AAAA,QACf;AACR,WAAO;AAAA,EACX;AACJ;AAWK,MAAC,gBAA6B,sBAAM,OAAM;AAM1C,MAAC,aAA0B,sBAAM,OAAO;AAAA,EACzC,SAAS,YAAU;AACf,QAAI,CAAC,OAAO;AACR,aAAO;AACX,QAAI,OAAO,OAAO,CAAC;AACnB,QAAI,CAAC,QAAQ,KAAK,KAAK,IAAI,KAAK,MAAM,KAAK,IAAI,EAAE,KAAK,OAAK,KAAK,KAAK,CAAC,CAAC;AACnE,YAAM,IAAI,MAAM,0BAA0B,KAAK,UAAU,OAAO,CAAC,CAAC,CAAC;AACvE,WAAO;AAAA,EACX;AACJ,CAAC;AAOD,SAAS,cAAc,OAAO;AAC1B,MAAI,OAAO,MAAM,MAAM,UAAU;AACjC,SAAO,KAAK,WAAW,CAAC,KAAK,IAAI,MAAM,UAAU,KAAK,SAAS,KAAK;AACxE;AAOA,SAAS,aAAa,OAAO,MAAM;AAC/B,MAAI,SAAS,IAAI,KAAK,MAAM,SAAS,KAAK,MAAM,MAAM,UAAU,EAAE,CAAC;AACnE,MAAI,MAAM,KAAM;AACZ,WAAO,QAAQ,IAAI;AACf,gBAAU;AACV,cAAQ;AAAA,IACZ;AACA,SAAK;AAAA,EACT;AACA,WAAS,IAAI,GAAG,IAAI,MAAM;AACtB,cAAU;AACd,SAAO;AACX;AAUA,SAAS,eAAe,SAAS,KAAK;AAClC,MAAI,mBAAmB;AACnB,cAAU,IAAI,cAAc,OAAO;AACvC,WAAS,WAAW,QAAQ,MAAM,MAAM,aAAa,GAAG;AACpD,QAAI,SAAS,QAAQ,SAAS,GAAG;AACjC,QAAI,WAAW;AACX,aAAO;AAAA,EACf;AACA,MAAI,OAAO,WAAW,QAAQ,KAAK;AACnC,SAAO,KAAK,UAAU,MAAM,kBAAkB,SAAS,MAAM,GAAG,IAAI;AACxE;AAgCA,MAAM,cAAc;AAAA;AAAA;AAAA;AAAA,EAIhB,YAIA,OAIA,UAAU,CAAA,GAAI;AACV,SAAK,QAAQ;AACb,SAAK,UAAU;AACf,SAAK,OAAO,cAAc,KAAK;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,KAAK,OAAO,GAAG;AAClB,QAAI,OAAO,KAAK,MAAM,IAAI,OAAO,GAAG;AACpC,QAAI,EAAE,eAAe,oBAAmB,IAAK,KAAK;AAClD,QAAI,iBAAiB,QAAQ,iBAAiB,KAAK,QAAQ,iBAAiB,KAAK,IAAI;AACjF,UAAI,uBAAuB,iBAAiB;AACxC,eAAO,EAAE,MAAM,IAAI,MAAM,IAAG;AAAA,eACvB,OAAO,IAAI,gBAAgB,MAAM,iBAAiB;AACvD,eAAO,EAAE,MAAM,KAAK,KAAK,MAAM,gBAAgB,KAAK,IAAI,GAAG,MAAM,cAAa;AAAA;AAE9E,eAAO,EAAE,MAAM,KAAK,KAAK,MAAM,GAAG,gBAAgB,KAAK,IAAI,GAAG,MAAM,KAAK,KAAI;AAAA,IACrF;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,KAAK,OAAO,GAAG;AACxB,QAAI,KAAK,QAAQ,uBAAuB,OAAO,KAAK,QAAQ;AACxD,aAAO;AACX,QAAI,EAAE,MAAM,KAAI,IAAK,KAAK,OAAO,KAAK,IAAI;AAC1C,WAAO,KAAK,MAAM,MAAM,MAAM,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM,IAAI,CAAC;AAAA,EACzE;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO,KAAK,OAAO,GAAG;AAClB,QAAI,EAAE,MAAM,KAAI,IAAK,KAAK,OAAO,KAAK,IAAI;AAC1C,QAAI,SAAS,KAAK,YAAY,MAAM,MAAM,IAAI;AAC9C,QAAI,WAAW,KAAK,QAAQ,sBAAsB,KAAK,QAAQ,oBAAoB,IAAI,IAAI;AAC3F,QAAI,WAAW;AACX,gBAAU,WAAW,KAAK,YAAY,MAAM,KAAK,OAAO,MAAM,CAAC;AACnE,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,MAAM,MAAM,KAAK,QAAQ;AACjC,WAAO,YAAY,MAAM,KAAK,MAAM,SAAS,GAAG;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA,EAIA,WAAW,KAAK,OAAO,GAAG;AACtB,QAAI,EAAE,MAAM,KAAI,IAAK,KAAK,OAAO,KAAK,IAAI;AAC1C,QAAI,WAAW,KAAK,QAAQ;AAC5B,QAAI,UAAU;AACV,UAAI,YAAY,SAAS,IAAI;AAC7B,UAAI,YAAY;AACZ,eAAO;AAAA,IACf;AACA,WAAO,KAAK,YAAY,MAAM,KAAK,OAAO,MAAM,CAAC;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAI,iBAAiB;AACjB,WAAO,KAAK,QAAQ,iBAAiB;AAAA,EACzC;AACJ;AAQK,MAAC,iBAA8B,oBAAI,SAAQ;AAEhD,SAAS,kBAAkB,IAAI,KAAK,KAAK;AACrC,MAAI,QAAQ,IAAI,aAAa,GAAG;AAChC,MAAI,QAAQ,IAAI,aAAa,KAAK,EAAE,EAAE,QAAQ,KAAK,CAAC,EAAE,2BAA2B,GAAG;AACpF,MAAI,SAAS,MAAM,MAAM;AACrB,QAAI,MAAM,CAAA;AACV,aAAS,MAAM,OAAO,OAAO,EAAE,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,MAC7E,IAAI,QAAQ,MAAM,KAAK,QAAQ,IAAI,QAAQ,MAAM,KAAK,OAAO,MAAM,IAAI;AACvE,UAAI,KAAK,GAAG;AAChB,aAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG;AACjC,cAAQ,EAAE,MAAM,IAAI,CAAC,GAAG,MAAM,MAAK;AAAA,EAC3C;AACA,SAAO,UAAU,OAAO,IAAI,GAAG;AACnC;AACA,SAAS,UAAU,OAAO,IAAI,KAAK;AAC/B,WAAS,MAAM,OAAO,KAAK,MAAM,IAAI,MAAM;AACvC,QAAI,WAAW,eAAe,IAAI,IAAI;AACtC,QAAI;AACA,aAAO,SAAS,kBAAkB,OAAO,IAAI,KAAK,GAAG,CAAC;AAAA,EAC9D;AACA,SAAO;AACX;AACA,SAAS,aAAa,IAAI;AACtB,SAAO,GAAG,OAAO,GAAG,QAAQ,iBAAiB,GAAG,QAAQ;AAC5D;AACA,SAAS,eAAe,MAAM;AAC1B,MAAI,WAAW,KAAK,KAAK,KAAK,cAAc;AAC5C,MAAI;AACA,WAAO;AACX,MAAI,QAAQ,KAAK,YAAY;AAC7B,MAAI,UAAU,QAAQ,MAAM,KAAK,KAAK,SAAS,QAAQ,IAAI;AACvD,QAAI,OAAO,KAAK,WAAW,SAAS,QAAQ,MAAM,QAAQ,KAAK,IAAI,IAAI;AACvE,WAAO,QAAM,kBAAkB,IAAI,MAAM,GAAG,QAAW,UAAU,CAAC,aAAa,EAAE,IAAI,KAAK,OAAO,MAAS;AAAA,EAC9G;AACA,SAAO,KAAK,UAAU,OAAO,YAAY;AAC7C;AACA,SAAS,YAAY;AAAE,SAAO;AAAG;AAKjC,MAAM,0BAA0B,cAAc;AAAA,EAC1C,YAAY,MAIZ,KAIA,SAAS;AACL,UAAM,KAAK,OAAO,KAAK,OAAO;AAC9B,SAAK,OAAO;AACZ,SAAK,MAAM;AACX,SAAK,UAAU;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,OAAO;AAAE,WAAO,KAAK,QAAQ;AAAA,EAAM;AAAA;AAAA;AAAA;AAAA,EAIvC,OAAO,OAAO,MAAM,KAAK,SAAS;AAC9B,WAAO,IAAI,kBAAkB,MAAM,KAAK,OAAO;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,YAAY;AACZ,WAAO,KAAK,aAAa,KAAK,GAAG;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,aAAa;AACb,WAAO,KAAK,cAAc,KAAK,IAAI;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,MAAM;AAChB,QAAI,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK,IAAI;AAE1C,eAAS;AACL,UAAI,UAAU,KAAK,QAAQ,KAAK,IAAI;AACpC,aAAO,QAAQ,UAAU,QAAQ,OAAO,QAAQ,QAAQ;AACpD,kBAAU,QAAQ;AACtB,UAAI,SAAS,SAAS,IAAI;AACtB;AACJ,aAAO,KAAK,MAAM,IAAI,OAAO,QAAQ,IAAI;AAAA,IAC7C;AACA,WAAO,KAAK,WAAW,KAAK,IAAI;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW;AACP,WAAO,UAAU,KAAK,QAAQ,MAAM,KAAK,MAAM,KAAK,GAAG;AAAA,EAC3D;AACJ;AACA,SAAS,SAAS,QAAQ,IAAI;AAC1B,WAAS,MAAM,IAAI,KAAK,MAAM,IAAI;AAC9B,QAAI,UAAU;AACV,aAAO;AACf,SAAO;AACX;AAIA,SAAS,iBAAiB,SAAS;AAC/B,MAAI,OAAO,QAAQ;AACnB,MAAI,YAAY,KAAK,WAAW,KAAK,IAAI,GAAG,OAAO,KAAK;AACxD,MAAI,CAAC;AACD,WAAO;AACX,MAAI,MAAM,QAAQ,QAAQ;AAC1B,MAAI,WAAW,QAAQ,MAAM,IAAI,OAAO,UAAU,IAAI;AACtD,MAAI,UAAU,OAAO,QAAQ,OAAO,SAAS,OAAO,SAAS,KAAK,KAAK,IAAI,SAAS,IAAI,GAAG;AAC3F,WAAS,MAAM,UAAU,QAAM;AAC3B,QAAI,OAAO,KAAK,WAAW,GAAG;AAC9B,QAAI,CAAC,QAAQ,QAAQ;AACjB,aAAO;AACX,QAAI,CAAC,KAAK,KAAK,WAAW;AACtB,UAAI,KAAK,QAAQ;AACb,eAAO;AACX,UAAI,QAAQ,MAAM,KAAK,SAAS,KAAK,MAAM,UAAU,KAAK,SAAS,IAAI,CAAC,EAAE,CAAC,EAAE;AAC7E,aAAO,EAAE,MAAM,UAAU,MAAM,IAAI,UAAU,KAAK,MAAK;AAAA,IAC3D;AACA,UAAM,KAAK;AAAA,EACf;AACJ;AAYA,SAAS,gBAAgB,EAAE,SAAS,QAAQ,MAAM,QAAQ,KAAK;AAC3D,SAAO,CAAC,YAAY,kBAAkB,SAAS,OAAO,OAAO,OAAO;AACxE;AACA,SAAS,kBAAkB,SAAS,OAAO,OAAO,SAAS,UAAU;AACjE,MAAI,QAAQ,QAAQ,WAAW,QAAQ,MAAM,MAAM,MAAM,EAAE,CAAC,EAAE;AAC9D,MAAI,SAAS,WAAW,MAAM,MAAM,OAAO,QAAQ,QAAQ,MAAM,KAAK,WAAW,YAAY,QAAQ,MAAM;AAC3G,MAAI,UAAU,QAAQ,iBAAiB,OAAO,IAAI;AAClD,MAAI;AACA,WAAO,SAAS,QAAQ,OAAO,QAAQ,IAAI,IAAI,QAAQ,OAAO,QAAQ,EAAE;AAC5E,SAAO,QAAQ,cAAc,SAAS,IAAI,QAAQ,OAAO;AAC7D;AAKK,MAAC,aAAa,CAAC,YAAY,QAAQ;AASxC,SAAS,gBAAgB,EAAE,QAAQ,QAAQ,EAAC,IAAK,CAAA,GAAI;AACjD,SAAO,CAAC,YAAY;AAChB,QAAI,cAAc,UAAU,OAAO,KAAK,QAAQ,SAAS;AACzD,WAAO,QAAQ,cAAc,cAAc,IAAI,QAAQ,QAAQ;AAAA,EACnE;AACJ;AAoDK,MAAC,cAA2B,sBAAM,OAAM;AAOxC,MAAC,eAA4B,oBAAI,SAAQ;AAM9C,SAAS,WAAW,MAAM;AACtB,MAAI,QAAQ,KAAK,YAAY,OAAO,KAAK;AACzC,SAAO,SAAS,MAAM,KAAK,KAAK,OAAO,EAAE,MAAM,MAAM,IAAI,IAAI,KAAK,KAAK,UAAU,KAAK,KAAK,KAAK,KAAI,IAAK;AAC7G;AAqaA,MAAM,eAAe;AAAA,EACjB,YAIA,OAAO,SAAS;AACZ,SAAK,QAAQ;AACb,QAAI;AACJ,aAAS,IAAI,MAAM;AACf,UAAI,MAAM,YAAY,QAAO;AAC7B,OAAC,YAAY,UAAU,uBAAO,OAAO,IAAI,IAAI,MAAM,GAAG,IAAI;AAC1D,aAAO;AAAA,IACX;AACA,UAAM,MAAM,OAAO,QAAQ,OAAO,WAAW,QAAQ,MAAM,QAAQ,MAAM,IAAI,QAAQ,GAAG,IAAI;AAC5F,UAAM,WAAW,QAAQ;AACzB,SAAK,QAAQ,oBAAoB,WAAW,CAAC,SAAS,KAAK,KAAK,gBAAgB,KAAK,SAAS,OACxF,WAAW,CAAC,SAAS,QAAQ,WAAW;AAC9C,SAAK,QAAQ,eAAe,MAAM,IAAI,YAAU;AAAA,MAC5C,KAAK,MAAM;AAAA,MACX,OAAO,MAAM,SAAS,IAAI,OAAO,OAAO,CAAA,GAAI,OAAO,EAAE,KAAK,KAAI,CAAE,CAAC;AAAA,IAC7E,EAAU,GAAG;AAAA,MACD;AAAA,IACZ,CAAS,EAAE;AACH,SAAK,SAAS,UAAU,IAAI,YAAY,OAAO,IAAI;AACnD,SAAK,YAAY,QAAQ;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,OAAO,OAAO,OAAO,SAAS;AAC1B,WAAO,IAAI,eAAe,OAAO,WAAW,CAAA,CAAE;AAAA,EAClD;AACJ;AACA,MAAM,mBAAgC,sBAAM,OAAM;AAClD,MAAM,sBAAmC,sBAAM,OAAO;AAAA,EAClD,QAAQ,QAAQ;AAAE,WAAO,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC,IAAI;AAAA,EAAM;AACjE,CAAC;AACD,SAAS,gBAAgB,OAAO;AAC5B,MAAI,OAAO,MAAM,MAAM,gBAAgB;AACvC,SAAO,KAAK,SAAS,OAAO,MAAM,MAAM,mBAAmB;AAC/D;AAQA,SAAS,mBAAmB,aAAa,SAAS;AAC9C,MAAI,MAAM,CAAC,eAAe,GAAG;AAC7B,MAAI,uBAAuB,gBAAgB;AACvC,QAAI,YAAY;AACZ,UAAI,KAAK,WAAW,YAAY,GAAG,YAAY,MAAM,CAAC;AAC1D,gBAAY,YAAY;AAAA,EAC5B;AAGK,MAAI;AACL,QAAI,KAAK,iBAAiB,SAAS,CAAC,WAAW,SAAS,GAAG,WAAS;AAChE,aAAO,MAAM,MAAM,WAAW,SAAS,MAAM,aAAa,UAAU,CAAC,WAAW,IAAI,CAAA;AAAA,IACxF,CAAC,CAAC;AAAA;AAEF,QAAI,KAAK,iBAAiB,GAAG,WAAW,CAAC;AAC7C,SAAO;AACX;AAqBA,MAAM,gBAAgB;AAAA,EAClB,YAAY,MAAM;AACd,SAAK,YAAY,uBAAO,OAAO,IAAI;AACnC,SAAK,OAAO,WAAW,KAAK,KAAK;AACjC,SAAK,cAAc,KAAK,UAAU,MAAM,gBAAgB,KAAK,KAAK,CAAC;AACnE,SAAK,cAAc,KAAK,SAAS;AAAA,EACrC;AAAA,EACA,OAAO,QAAQ;AACX,QAAI,OAAO,WAAW,OAAO,KAAK,GAAG,eAAe,gBAAgB,OAAO,KAAK;AAChF,QAAI,cAAc,gBAAgB,gBAAgB,OAAO,UAAU;AACnE,QAAI,EAAE,SAAQ,IAAK,OAAO,MAAM,oBAAoB,OAAO,QAAQ,OAAO,KAAK,aAAa,CAAC;AAC7F,QAAI,KAAK,SAAS,SAAS,MAAM,CAAC,eAAe,KAAK,QAAQ,KAAK,KAAK,QAAQ,qBAAqB,SAAS,IAAI;AAC9G,WAAK,cAAc,KAAK,YAAY,IAAI,OAAO,OAAO;AACtD,WAAK,cAAc;AAAA,IACvB,WACS,QAAQ,KAAK,QAAQ,OAAO,mBAAmB,aAAa;AACjE,WAAK,OAAO;AACZ,WAAK,cAAc,KAAK,UAAU,OAAO,MAAM,YAAY;AAC3D,WAAK,cAAc,SAAS;AAAA,IAChC;AAAA,EACJ;AAAA,EACA,UAAU,MAAM,cAAc;AAC1B,QAAI,CAAC,gBAAgB,CAAC,KAAK,KAAK;AAC5B,aAAO,WAAW;AACtB,QAAI,UAAU,IAAI,gBAAe;AACjC,aAAS,EAAE,MAAM,GAAE,KAAM,KAAK,eAAe;AACzC,oBAAc,KAAK,MAAM,cAAc,CAACC,OAAMC,KAAI,UAAU;AACxD,gBAAQ,IAAID,OAAMC,KAAI,KAAK,UAAU,KAAK,MAAM,KAAK,UAAU,KAAK,IAAI,WAAW,KAAK,EAAE,OAAO,MAAK,CAAE,EAAE;AAAA,MAC9G,GAAG,MAAM,EAAE;AAAA,IACf;AACA,WAAO,QAAQ,OAAM;AAAA,EACzB;AACJ;AACA,MAAM,kBAA+B,qBAAK,KAAkB,2BAAW,UAAU,iBAAiB;AAAA,EAC9F,aAAa,OAAK,EAAE;AACxB,CAAC,CAAC;AAkDF,MAAM,kBAAkB,KAAO,kBAAkB;AA+D5C,MAAC,wBAAqC,oBAAI,SAAQ;AACvD,SAAS,cAAc,MAAM,KAAK,UAAU;AACxC,MAAI,SAAS,KAAK,KAAK,MAAM,IAAI,SAAS,WAAW,SAAS,QAAQ;AACtE,MAAI;AACA,WAAO;AACX,MAAI,KAAK,KAAK,UAAU,GAAG;AACvB,QAAI,QAAQ,SAAS,QAAQ,KAAK,IAAI;AACtC,QAAI,QAAQ,MAAM,QAAQ,MAAM,MAAM,IAAI,IAAI;AAC1C,aAAO,CAAC,SAAS,QAAQ,GAAG,CAAC;AAAA,EACrC;AACA,SAAO;AACX;AACA,SAAS,WAAW,MAAM;AACtB,MAAI,YAAY,KAAK,KAAK,KAAK,qBAAqB;AACpD,SAAO,YAAY,UAAU,KAAK,IAAI,IAAI;AAC9C;AAOA,SAAS,cAAc,OAAO,KAAK,KAAK,SAAS,CAAA,GAAI;AACjD,MAAI,kBAAkB,OAAO,mBAAmB,iBAAiB,WAAW,OAAO,YAAY;AAC/F,MAAI,OAAO,WAAW,KAAK,GAAG,OAAO,KAAK,aAAa,KAAK,GAAG;AAC/D,WAAS,MAAM,MAAM,KAAK,MAAM,IAAI,QAAQ;AACxC,QAAI,UAAU,cAAc,IAAI,MAAM,KAAK,QAAQ;AACnD,QAAI,WAAW,IAAI,OAAO,IAAI,IAAI;AAC9B,UAAI,SAAS,WAAW,GAAG;AAC3B,UAAI,WAAW,MAAM,IAAI,OAAO,OAAO,QAAQ,MAAM,OAAO,KAAK,MAAM,OAAO,QAAQ,OAAO,OAAO;AAChG,eAAO,oBAAoB,OAAO,KAAK,KAAK,KAAK,QAAQ,SAAS,QAAQ;AAAA,IAClF;AAAA,EACJ;AACA,SAAO,mBAAmB,OAAO,KAAK,KAAK,MAAM,KAAK,MAAM,iBAAiB,QAAQ;AACzF;AACA,SAAS,oBAAoB,QAAQ,MAAM,KAAK,OAAO,QAAQ,UAAU,UAAU;AAC/E,MAAI,SAAS,MAAM,QAAQ,aAAa,EAAE,MAAM,OAAO,MAAM,IAAI,OAAO,GAAE;AAC1E,MAAI,QAAQ,GAAG,SAAS,WAAW,QAAQ,WAAW,SAAS,SAAS,OAAO,OAAM;AACrF,MAAI,WAAW,MAAM,IAAI,OAAO,YAAY,MAAM,IAAI,IAAI,OAAO,WAAW,MAAM,EAAE;AAChF,OAAG;AACC,UAAI,MAAM,IAAI,OAAO,MAAM,MAAM,OAAO,OAAO,QAAQ,MAAM,IAAI;AAC7D,YAAI,SAAS,KAAK,SAAS,QAAQ,OAAO,KAAK,IAAI,IAAI,MAAM,OAAO,OAAO,OAAO,IAAI;AAClF,cAAI,YAAY,WAAW,MAAM;AACjC,iBAAO,EAAE,OAAO,YAAY,KAAK,YAAY,EAAE,MAAM,UAAU,MAAM,IAAI,UAAU,GAAE,IAAK,QAAW,SAAS,KAAI;AAAA,QACtH,WACS,cAAc,OAAO,MAAM,KAAK,QAAQ,GAAG;AAChD;AAAA,QACJ,WACS,cAAc,OAAO,MAAM,CAAC,KAAK,QAAQ,GAAG;AACjD,cAAI,SAAS,GAAG;AACZ,gBAAI,YAAY,WAAW,MAAM;AACjC,mBAAO;AAAA,cACH,OAAO;AAAA,cACP,KAAK,aAAa,UAAU,OAAO,UAAU,KAAK,EAAE,MAAM,UAAU,MAAM,IAAI,UAAU,GAAE,IAAK;AAAA,cAC/F,SAAS;AAAA,YACrC;AAAA,UACoB;AACA;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ,SAAS,MAAM,IAAI,OAAO,YAAW,IAAK,OAAO,YAAW;AAChE,SAAO,EAAE,OAAO,YAAY,SAAS,MAAK;AAC9C;AACA,SAAS,mBAAmB,OAAO,KAAK,KAAK,MAAM,WAAW,iBAAiB,UAAU;AACrF,MAAI,UAAU,MAAM,IAAI,MAAM,SAAS,MAAM,GAAG,GAAG,IAAI,MAAM,SAAS,KAAK,MAAM,CAAC;AAClF,MAAI,UAAU,SAAS,QAAQ,OAAO;AACtC,MAAI,UAAU,KAAM,UAAU,KAAK,KAAO,MAAM;AAC5C,WAAO;AACX,MAAI,aAAa,EAAE,MAAM,MAAM,IAAI,MAAM,IAAI,KAAK,IAAI,MAAM,IAAI,MAAM,IAAI,IAAG;AAC7E,MAAI,OAAO,MAAM,IAAI,UAAU,KAAK,MAAM,IAAI,MAAM,IAAI,SAAS,CAAC,GAAG,QAAQ;AAC7E,WAAS,WAAW,GAAG,CAAE,KAAK,OAAQ,QAAQ,YAAY,mBAAkB;AACxE,QAAI,OAAO,KAAK;AAChB,QAAI,MAAM;AACN,kBAAY,KAAK;AACrB,QAAI,UAAU,MAAM,WAAW;AAC/B,aAASC,OAAM,MAAM,IAAI,IAAI,KAAK,SAAS,GAAG,MAAM,MAAM,IAAI,KAAK,SAAS,IAAIA,QAAO,KAAKA,QAAO,KAAK;AACpG,UAAI,QAAQ,SAAS,QAAQ,KAAKA,IAAG,CAAC;AACtC,UAAI,QAAQ,KAAK,KAAK,aAAa,UAAUA,MAAK,CAAC,EAAE,QAAQ;AACzD;AACJ,UAAK,QAAQ,KAAK,KAAO,MAAM,GAAI;AAC/B;AAAA,MACJ,WACS,SAAS,GAAG;AACjB,eAAO,EAAE,OAAO,YAAY,KAAK,EAAE,MAAM,UAAUA,MAAK,IAAI,UAAUA,OAAM,EAAC,GAAI,SAAU,SAAS,KAAO,WAAW,EAAE;AAAA,MAC5H,OACK;AACD;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,MAAM;AACN,kBAAY,KAAK;AAAA,EACzB;AACA,SAAO,KAAK,OAAO,EAAE,OAAO,YAAY,SAAS,MAAK,IAAK;AAC/D;AAIA,SAAS,SAAS,QAAQ,KAAK,SAAS,aAAa,GAAG,aAAa,GAAG;AACpE,MAAI,OAAO,MAAM;AACb,UAAM,OAAO,OAAO,aAAa;AACjC,QAAI,OAAO;AACP,YAAM,OAAO;AAAA,EACrB;AACA,MAAI,IAAI;AACR,WAAS,IAAI,YAAY,IAAI,KAAK,KAAK;AACnC,QAAI,OAAO,WAAW,CAAC,KAAK;AACxB,WAAK,UAAW,IAAI;AAAA;AAEpB;AAAA,EACR;AACA,SAAO;AACX;AAKA,MAAM,aAAa;AAAA;AAAA;AAAA;AAAA,EAIf,YAIA,QAAQ,SAIRC,aAAY,gBAAgB;AACxB,SAAK,SAAS;AACd,SAAK,UAAU;AACf,SAAK,aAAaA;AAClB,SAAK,iBAAiB;AAItB,SAAK,MAAM;AAIX,SAAK,QAAQ;AACb,SAAK,gBAAgB;AACrB,SAAK,kBAAkB;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAIA,MAAM;AAAE,WAAO,KAAK,OAAO,KAAK,OAAO;AAAA,EAAQ;AAAA;AAAA;AAAA;AAAA,EAI/C,MAAM;AAAE,WAAO,KAAK,OAAO;AAAA,EAAG;AAAA;AAAA;AAAA;AAAA;AAAA,EAK9B,OAAO;AAAE,WAAO,KAAK,OAAO,OAAO,KAAK,GAAG,KAAK;AAAA,EAAW;AAAA;AAAA;AAAA;AAAA,EAI3D,OAAO;AACH,QAAI,KAAK,MAAM,KAAK,OAAO;AACvB,aAAO,KAAK,OAAO,OAAO,KAAK,KAAK;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,OAAO;AACP,QAAI,KAAK,KAAK,OAAO,OAAO,KAAK,GAAG;AACpC,QAAI;AACJ,QAAI,OAAO,SAAS;AAChB,WAAK,MAAM;AAAA;AAEX,WAAK,OAAO,iBAAiB,SAAS,MAAM,KAAK,EAAE,IAAI,MAAM,EAAE;AACnE,QAAI,IAAI;AACJ,QAAE,KAAK;AACP,aAAO;AAAA,IACX;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,OAAO;AACZ,QAAI,QAAQ,KAAK;AACjB,WAAO,KAAK,IAAI,KAAK,GAAG;AAAA,IAAE;AAC1B,WAAO,KAAK,MAAM;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW;AACP,QAAI,QAAQ,KAAK;AACjB,WAAO,aAAa,KAAK,KAAK,OAAO,OAAO,KAAK,GAAG,CAAC;AACjD,QAAE,KAAK;AACX,WAAO,KAAK,MAAM;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAIA,YAAY;AAAE,SAAK,MAAM,KAAK,OAAO;AAAA,EAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,EAK7C,OAAO,IAAI;AACP,QAAI,QAAQ,KAAK,OAAO,QAAQ,IAAI,KAAK,GAAG;AAC5C,QAAI,QAAQ,IAAI;AACZ,WAAK,MAAM;AACX,aAAO;AAAA,IACX;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO,GAAG;AAAE,SAAK,OAAO;AAAA,EAAG;AAAA;AAAA;AAAA;AAAA,EAI3B,SAAS;AACL,QAAI,KAAK,gBAAgB,KAAK,OAAO;AACjC,WAAK,kBAAkB,SAAS,KAAK,QAAQ,KAAK,OAAO,KAAK,SAAS,KAAK,eAAe,KAAK,eAAe;AAC/G,WAAK,gBAAgB,KAAK;AAAA,IAC9B;AACA,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA,EAIA,cAAc;AACV,QAAIL;AACJ,YAAQA,MAAK,KAAK,oBAAoB,QAAQA,QAAO,SAASA,MAAK,SAAS,KAAK,QAAQ,MAAM,KAAK,OAAO;AAAA,EAC/G;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,SAAS,SAAS,iBAAiB;AACrC,QAAI,OAAO,WAAW,UAAU;AAC5B,UAAI,QAAQ,CAAC,QAAQ,kBAAkB,IAAI,YAAW,IAAK;AAC3D,UAAI,SAAS,KAAK,OAAO,OAAO,KAAK,KAAK,QAAQ,MAAM;AACxD,UAAI,MAAM,MAAM,KAAK,MAAM,OAAO,GAAG;AACjC,YAAI,YAAY;AACZ,eAAK,OAAO,QAAQ;AACxB,eAAO;AAAA,MACX;AAEI,eAAO;AAAA,IACf,OACK;AACD,UAAI,QAAQ,KAAK,OAAO,MAAM,KAAK,GAAG,EAAE,MAAM,OAAO;AACrD,UAAI,SAAS,MAAM,QAAQ;AACvB,eAAO;AACX,UAAI,SAAS,YAAY;AACrB,aAAK,OAAO,MAAM,CAAC,EAAE;AACzB,aAAO;AAAA,IACX;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAIA,UAAU;AAAE,WAAO,KAAK,OAAO,MAAM,KAAK,OAAO,KAAK,GAAG;AAAA,EAAG;AAChE;AAEA,SAAS,WAAW,MAAM;AACtB,SAAO;AAAA,IACH,MAAM,KAAK,QAAQ;AAAA,IACnB,OAAO,KAAK;AAAA,IACZ,WAAW,KAAK,cAAc,MAAM;AAAA,IAAE;AAAA,IACtC,YAAY,KAAK,eAAe,MAAM;AAAA,IACtC,WAAW,KAAK,aAAa;AAAA,IAC7B,QAAQ,KAAK,WAAW,MAAM;AAAA,IAC9B,cAAc,KAAK,gBAAgB,CAAA;AAAA,IACnC,YAAY,KAAK,cAAc;AAAA,IAC/B,aAAa,KAAK,gBAAgB;AAAA,EAC1C;AACA;AACA,SAAS,iBAAiB,OAAO;AAC7B,MAAI,OAAO,SAAS;AAChB,WAAO;AACX,MAAI,WAAW,CAAA;AACf,WAAS,QAAQ,OAAO;AACpB,QAAI,MAAM,MAAM,IAAI;AACpB,aAAS,IAAI,IAAK,eAAe,QAAQ,IAAI,MAAK,IAAK;AAAA,EAC3D;AACA,SAAO;AACX;AACA,MAAM,eAA4B,oBAAI,QAAO;AAK7C,MAAM,uBAAuB,SAAS;AAAA,EAClC,YAAY,QAAQ;AAChB,QAAI,OAAO,oBAAoB,OAAO,YAAY;AAClD,QAAI,IAAI,WAAW,MAAM,GAAG;AAC5B,QAAI,OAAO,IAAI,cAAc,OAAO;AAAA,MAChC,YAAY,OAAO,WAAW,QAAQ;AAClC,eAAO,IAAI,MAAM,MAAM,OAAO,WAAW,MAAM;AAAA,MACnD;AAAA,IACZ;AACQ,UAAM,MAAM,MAAM,CAAA,GAAI,OAAO,IAAI;AACjC,SAAK,UAAU,MAAM,MAAM,IAAI;AAC/B,WAAO;AACP,SAAK,eAAe;AACpB,SAAK,aAAa,IAAI,SAAS,EAAE,SAAS,KAAI,CAAE;AAChD,SAAK,aAAa,OAAO,aAAa,IAAI,WAAW,EAAE,UAAU,IAAI;AAAA,EACzE;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO,OAAO,MAAM;AAAE,WAAO,IAAI,eAAe,IAAI;AAAA,EAAG;AAAA;AAAA;AAAA;AAAA,EAIvD,UAAU,IAAI;AACV,QAAI,OAAO;AACX,QAAI,EAAE,wBAAwB,GAAG;AACjC,QAAI,qBAAqB;AACrB,aAAO,aAAa,IAAI,GAAG,KAAK;AAChC,UAAI,QAAQ,QAAQ,OAAO,GAAG,MAAM;AAChC,eAAO;AAAA,IACf;AACA,QAAI,QAAQ,UAAU,MAAM,GAAG,KAAK,MAAM,GAAG,KAAK,MAAM,GAAG,KAAK,MAAM,SAAS,QAAQ,SAAS,SAAS,OAAO,GAAG,GAAG,GAAG,UAAU;AACnI,QAAI,OAAO;AACP,cAAQ,MAAM;AACd,iBAAW,MAAM,MAAM;AAAA,IAC3B,OACK;AACD,cAAQ,KAAK,aAAa,WAAW,GAAG,IAAI;AAC5C,iBAAW,GAAG,KAAK;AAAA,IACvB;AACA,QAAI,GAAG,MAAM,WAAW;AACpB,aAAO;AACX,WAAO,WAAW,GAAG,KAAK;AACtB,UAAIM,QAAO,GAAG,MAAM,IAAI,OAAO,QAAQ,GAAG,MAAM,KAAK,IAAI,GAAG,KAAKA,MAAK,EAAE;AACxE,UAAIA,MAAK,QAAQ;AACb,YAAI,cAAc,sBAAsB,oBAAoBA,MAAK,IAAI,IAAI;AACzE,YAAI,SAAS,IAAI,aAAaA,MAAK,MAAM,GAAG,MAAM,SAAS,GAAG,MAAM,cAAc,IAAI,SAAY,WAAW;AAC7G,eAAO,OAAO,MAAM,MAAMA,MAAK;AAC3B,oBAAU,KAAK,aAAa,OAAO,QAAQ,KAAK;AAAA,MACxD,OACK;AACD,aAAK,aAAa,UAAU,OAAO,GAAG,IAAI;AAAA,MAC9C;AACA,UAAI,OAAO,GAAG;AACV;AACJ,iBAAWA,MAAK,KAAK;AAAA,IACzB;AACA,QAAI,OAAO,GAAG,OAAO,GAAG,GAAG;AAC3B,QAAI,uBAAuB,QAAQ;AAC/B,mBAAa,IAAI,GAAG,OAAO,KAAK,IAAI;AACxC,WAAO,KAAK,aAAa,OAAO,OAAO,WAAW,KAAK,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE;AAAA,EAC5E;AAAA,EACA,IAAI,gBAAgB;AAAE,WAAO;AAAA,EAAO;AACxC;AACA,SAAS,UAAU,MAAM,MAAM,KAAK,UAAU,QAAQ;AAClD,MAAI,QAAQ,OAAO,YAAY,MAAM,KAAK,UAAU,UAAU,KAAK,KAAK,KAAK,UAAU;AACvF,MAAI;AACA,WAAO,EAAE,OAAO,KAAK,aAAa,UAAU,KAAK,GAAG,KAAK,MAAM,KAAK,OAAM;AAC9E,WAAS,IAAI,KAAK,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AAChD,QAAI,QAAQ,KAAK,SAAS,CAAC,GAAG,MAAM,MAAM,KAAK,UAAU,CAAC;AAC1D,QAAI,QAAQ,iBAAiB,QAAQ,MAAM,UAAU,UAAU,MAAM,OAAO,KAAK,UAAU,MAAM;AACjG,QAAI;AACA,aAAO;AAAA,EACf;AACA,SAAO;AACX;AACA,SAAS,QAAQ,MAAM,MAAM,MAAM,IAAI,QAAQ;AAC3C,MAAI,UAAU,QAAQ,KAAK,MAAM,KAAK;AAClC,WAAO;AACX,MAAI,CAAC,UAAU,QAAQ,KAAK,KAAK,QAAQ,KAAK;AAC1C,aAAS;AACb,WAAS,IAAI,KAAK,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AAChD,QAAI,MAAM,KAAK,UAAU,CAAC,GAAG,QAAQ,KAAK,SAAS,CAAC,GAAG;AACvD,QAAI,MAAM,MAAM,iBAAiB,MAAM;AACnC,UAAI,EAAE,QAAQ,QAAQ,MAAM,OAAO,OAAO,KAAK,KAAK,KAAK,MAAM;AAC3D;AACJ,aAAO,CAAC,SAAS,QACX,IAAI,KAAK,KAAK,MAAM,KAAK,SAAS,MAAM,GAAG,CAAC,EAAE,OAAO,KAAK,GAAG,KAAK,UAAU,MAAM,GAAG,IAAI,CAAC,GAAG,MAAM,MAAM,MAAM;AAAA,IACzH;AAAA,EACJ;AACA,SAAO;AACX;AACA,SAAS,qBAAqB,MAAM,WAAW,UAAU,QAAQ,aAAa;AAC1E,WAAS,KAAK,WAAW;AACrB,QAAI,OAAO,EAAE,QAAQ,EAAE,YAAY,KAAK,IAAI,KAAK,EAAE,MAAM,EAAE,UAAU,KAAK;AAC1E,QAAI,QAAQ,QAAQ,YAAY,KAAK,YAAY,UAAU,MAAM,EAAE,MAAM,IAAI,EAAE,QAAQ,UAAU,EAAE,GAAG;AACtG,QAAI,SAAS,MAAM,OAAO,WAAW,OAAO,QAAQ,MAAM,EAAE,MAAM,WAAW,EAAE,QAAQ,MAAM,MAAM,EAAE,QAAQ,KAAK;AAC9G,aAAO,EAAE,OAAO,MAAM,OAAO,KAAI;AAAA,EACzC;AACA,SAAO,EAAE,OAAO,KAAK,aAAa,WAAW,cAAc,cAAc,WAAW,IAAI,CAAC,GAAG,MAAM,KAAK,MAAK;AAChH;AACA,MAAM,MAAM;AAAA,EACR,YAAY,MAAM,OAAO,WAAW,QAAQ;AACxC,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,YAAY;AACjB,SAAK,SAAS;AACd,SAAK,YAAY;AACjB,SAAK,SAAS,CAAA;AACd,SAAK,WAAW,CAAA;AAChB,SAAK,QAAQ,CAAA;AACb,SAAK,cAAc;AACnB,SAAK,aAAa;AAClB,SAAK,KAAK,OAAO,OAAO,SAAS,CAAC,EAAE;AACpC,QAAI,UAAU,aAAa,IAAG,GAAI,OAAO,OAAO,CAAC,EAAE;AACnD,QAAI,EAAE,OAAO,KAAI,IAAK,qBAAqB,MAAM,WAAW,MAAM,KAAK,IAAI,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,KAAK;AAC1I,SAAK,QAAQ;AACb,SAAK,YAAY,KAAK,aAAa,OAAO,KAAK;AAC/C,aAAS,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;AAC3C,WAAK,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC;AACjC,WAAK,SAAS,KAAK,KAAK,UAAU,CAAC,CAAC;AAAA,IACxC;AACA,QAAI,WAAW,KAAK,YAAY,QAAQ,SAAS,OAAO,OACpD,OAAO,KAAK,OAAK,EAAE,QAAQ,QAAQ,SAAS,QAAQ,EAAE,MAAM,QAAQ,SAAS,IAAI,GAAG;AACpF,WAAK,QAAQ,KAAK,KAAK,aAAa,WAAW,cAAc,QAAQ,KAAK,CAAC;AAC3E,cAAQ,gBAAgB,KAAK,WAAW,QAAQ,SAAS,IAAI;AAC7D,WAAK,YAAY,QAAQ,SAAS;AAAA,IACtC;AACA,SAAK,eAAc;AAAA,EACvB;AAAA,EACA,UAAU;AACN,QAAI,UAAU,aAAa,IAAG;AAC9B,QAAI,WAAW,KAAK,aAAa,OAAO,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,SAAS;AAClF,QAAI,MAAM,KAAK;AAAA,MAAI;AAAA,MAAU,KAAK,aAAa;AAAA;AAAA,IAAG;AAClD,QAAI;AACA,YAAM,KAAK,IAAI,KAAK,QAAQ,SAAS,EAAE;AAC3C,WAAO,KAAK,YAAY;AACpB,WAAK,UAAU,OAAO;AAC1B,QAAI,KAAK,aAAa,KAAK;AACvB,WAAK,YAAW;AACpB,QAAI,KAAK,aAAa;AAClB,aAAO,KAAK,OAAM;AACtB,QAAI,WAAW,KAAK,aAAa,QAAQ,SAAS,IAAI;AAClD,cAAQ,gBAAgB,KAAK,WAAW,QAAQ;AAChD,aAAO,KAAK,OAAM;AAAA,IACtB;AACA,WAAO;AAAA,EACX;AAAA,EACA,OAAO,KAAK;AACR,SAAK,YAAY;AAAA,EACrB;AAAA,EACA,UAAU,KAAK;AACX,QAAI,QAAQ,KAAK,MAAM,MAAM,GAAG;AAChC,QAAI,CAAC,KAAK,MAAM,YAAY;AACxB,UAAI,MAAM,MAAM,QAAQ,IAAI;AAC5B,UAAI,MAAM;AACN,gBAAQ,MAAM,MAAM,GAAG,GAAG;AAAA,IAClC,WACS,SAAS,MAAM;AACpB,cAAQ;AAAA,IACZ;AACA,WAAO,MAAM,MAAM,UAAU,KAAK,KAAK,QAAQ,MAAM,MAAM,GAAG,KAAK,KAAK,GAAG;AAAA,EAC/E;AAAA,EACA,WAAW;AACP,QAAI,OAAO,KAAK,WAAW,OAAO,KAAK,UAAU,IAAI,GAAG,MAAM,OAAO,KAAK;AAC1E,aAAS,QAAQ,KAAK,gBAAc;AAChC,UAAI,WAAW,KAAK,OAAO,KAAK,EAAE;AAClC,UAAI,YAAY;AACZ;AACJ,aAAO,KAAK,MAAM,GAAG,YAAY,MAAM,KAAK,OAAO;AACnD;AACA,UAAI,SAAS,KAAK,OAAO;AACrB;AACJ,UAAI,aAAa,KAAK,OAAO,KAAK,EAAE;AACpC,UAAI,QAAQ,KAAK,UAAU,UAAU;AACrC,cAAQ;AACR,YAAM,aAAa,MAAM;AAAA,IAC7B;AACA,WAAO,EAAE,MAAM,IAAG;AAAA,EACtB;AAAA,EACA,WAAW,KAAK,QAAQ,MAAM;AAC1B,eAAS;AACL,UAAI,MAAM,KAAK,OAAO,KAAK,UAAU,EAAE,IAAI,SAAS,MAAM;AAC1D,UAAI,OAAO,IAAI,MAAM,SAAS,OAAO;AACjC;AACJ,UAAI,QAAQ,KAAK,OAAO,EAAE,KAAK,UAAU,EAAE;AAC3C,gBAAU,QAAQ;AAAA,IACtB;AACA,WAAO;AAAA,EACX;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK,OAAO,KAAK,UAAU,EAAE,KAAK,KAAK;AAC1C,WAAK;AAAA,EACb;AAAA,EACA,UAAU,IAAI,MAAM,IAAI,QAAQ;AAC5B,QAAI,OAAO;AACX,QAAI,KAAK,OAAO,SAAS,GAAG;AACxB,eAAS,KAAK,WAAW,MAAM,QAAQ,CAAC;AACxC,cAAQ;AACR,UAAI,OAAO,KAAK,MAAM;AACtB,eAAS,KAAK,WAAW,IAAI,QAAQ,EAAE;AACvC,YAAM;AACN,cAAQ,KAAK,MAAM,SAAS;AAAA,IAChC;AACA,QAAI,OAAO,KAAK,MAAM,SAAS;AAC/B,QAAI,KAAK,KAAK,aAAa,eAAe,QAAQ,KAAK,QAAQ,KAC3D,KAAK,MAAM,IAAI,KAAK,MAAM,KAAK,MAAM,OAAO,CAAC,KAAK;AAClD,WAAK,MAAM,OAAO,CAAC,IAAI;AAAA;AAEvB,WAAK,MAAM,KAAK,IAAI,MAAM,IAAI,IAAI;AACtC,WAAO;AAAA,EACX;AAAA,EACA,UAAU,SAAS;AACf,QAAI,EAAE,MAAM,IAAG,IAAK,KAAK,SAAQ,GAAI,SAAS,GAAG,EAAE,aAAY,IAAK,KAAK;AACzE,QAAI,SAAS,IAAI,aAAa,MAAM,UAAU,QAAQ,MAAM,UAAU,GAAG,UAAU,cAAc,QAAQ,KAAK,IAAI,CAAC;AACnH,QAAI,OAAO,OAAO;AACd,mBAAa,UAAU,KAAK,OAAO,OAAO,UAAU;AAAA,IACxD,OACK;AACD,aAAO,CAAC,OAAO,OAAO;AAClB,YAAI,QAAQ,UAAU,aAAa,OAAO,QAAQ,KAAK,KAAK;AAC5D,YAAI;AACA,mBAAS,KAAK,UAAU,KAAK,KAAK,WAAW,QAAQ,KAAK,GAAG,KAAK,YAAY,OAAO,OAAO,KAAK,YAAY,OAAO,KAAK,MAAM;AACnI,YAAI,OAAO,QAAQ;AACf;AAAA,MACR;AAAA,IACJ;AACA,SAAK,YAAY;AACjB,SAAK,eAAc;AACnB,QAAI,KAAK,YAAY,KAAK;AACtB,WAAK;AAAA,EACb;AAAA,EACA,cAAc;AACV,QAAI,OAAO,KAAK,MAAM;AAAA,MAClB,QAAQ,KAAK;AAAA,MACb,OAAO,KAAK;AAAA,MACZ,QAAQ,KAAK,YAAY,KAAK;AAAA,MAC9B;AAAA,MACA,OAAO;AAAA,MACP,iBAAiB;AAAA,MACjB,QAAQ,KAAK;AAAA,IACzB,CAAS;AACD,WAAO,IAAI,KAAK,KAAK,MAAM,KAAK,UAAU,KAAK,WAAW,KAAK,QAAQ,CAAC,CAAC,KAAK,KAAK,YAAY,KAAK,KAAK,aAAa,UAAU,KAAK,KAAK,CAAC,CAAC,CAAC;AAC7I,SAAK,OAAO,KAAK,IAAI;AACrB,SAAK,SAAS,KAAK,KAAK,aAAa,KAAK,OAAO,CAAC,EAAE,IAAI;AACxD,SAAK,QAAQ,CAAA;AACb,SAAK,cAAc;AACnB,SAAK,aAAa,KAAK;AAAA,EAC3B;AAAA,EACA,SAAS;AACL,WAAO,IAAI,KAAK,KAAK,KAAK,SAAS,KAAK,QAAQ,KAAK,UAAU,KAAK,YAAY,KAAK,OAAO,CAAC,EAAE,IAAI,EAAE,QAAO;AAAA,EAChH;AACJ;AACA,SAAS,UAAU,OAAO,QAAQ,OAAO;AACrC,SAAO,QAAQ,OAAO;AACtB,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,QAAI,SAAS,MAAM,QAAQ,KAAK;AAChC,QAAI,OAAO,MAAM,OAAO;AACpB,aAAO;AAAA,EACf;AACA,QAAM,IAAI,MAAM,yCAAyC;AAC7D;AACA,MAAM,WAAwB,uBAAO,OAAO,IAAI;AAChD,MAAM,YAAY,CAAC,SAAS,IAAI;AAChC,MAAM,UAAuB,oBAAI,QAAQ,SAAS;AAClD,MAAM,SAAS,CAAA;AAEf,MAAM,QAAqB,uBAAO,OAAO,IAAI;AAC7C,MAAM,eAA4B,uBAAO,OAAO,IAAI;AACpD,SAAS,CAAC,YAAY,IAAI,KAAK;AAAA,EAC3B,CAAC,YAAY,cAAc;AAAA,EAC3B,CAAC,cAAc,sBAAsB;AAAA,EACrC,CAAC,YAAY,gBAAgB;AAAA,EAC7B,CAAC,OAAO,yBAAyB;AAAA,EACjC,CAAC,OAAO,SAAS;AAAA,EACjB,CAAC,aAAa,eAAe;AAAA,EAC7B,CAAC,QAAQ,UAAU;AAAA,EACnB,CAAC,WAAW,uBAAuB;AAAA,EACnC,CAAC,aAAa,UAAU;AAAA,EACxB,CAAC,SAAS,SAAS;AAAA,EACnB,CAAC,UAAU,SAAS;AAAA,EACpB,CAAC,YAAY,cAAc;AAC/B;AACI,eAAa,UAAU,IAAiB,gCAAgB,UAAU,IAAI;AAC1E,MAAM,WAAW;AAAA,EACb,YAAY,OAAO;AACf,SAAK,QAAQ;AACb,SAAK,QAAQ,OAAO,OAAO,uBAAO,OAAO,IAAI,GAAG,YAAY;AAAA,EAChE;AAAA,EACA,QAAQ,KAAK;AACT,WAAO,CAAC,MAAM,IAAI,KAAK,MAAM,GAAG,MAAM,KAAK,MAAM,GAAG,IAAI,gBAAgB,KAAK,OAAO,GAAG;AAAA,EAC3F;AACJ;AACA,MAAM,oBAAiC,oBAAI,WAAW,QAAQ;AAC9D,SAAS,YAAY,MAAM,KAAK;AAC5B,MAAI,OAAO,QAAQ,IAAI,IAAI;AACvB;AACJ,SAAO,KAAK,IAAI;AAChB,UAAQ,KAAK,GAAG;AACpB;AACA,SAAS,gBAAgB,OAAO,QAAQ;AACpC,MAAI,SAAS,CAAA;AACb,WAASC,SAAQ,OAAO,MAAM,GAAG,GAAG;AAChC,QAAI,QAAQ,CAAA;AACZ,aAAS,QAAQA,MAAK,MAAM,GAAG,GAAG;AAC9B,UAAI,QAAS,MAAM,IAAI,KAAK,KAAK,IAAI;AACrC,UAAI,CAAC,OAAO;AACR,oBAAY,MAAM,4BAA4B,IAAI,EAAE;AAAA,MACxD,WACS,OAAO,SAAS,YAAY;AACjC,YAAI,CAAC,MAAM;AACP,sBAAY,MAAM,YAAY,IAAI,uBAAuB;AAAA;AAEzD,kBAAQ,MAAM,IAAI,KAAK;AAAA,MAC/B,OACK;AACD,YAAI,MAAM;AACN,sBAAY,MAAM,OAAO,IAAI,mBAAmB;AAAA;AAEhD,kBAAQ,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK;AAAA,MACrD;AAAA,IACJ;AACA,aAAS,OAAO;AACZ,aAAO,KAAK,GAAG;AAAA,EACvB;AACA,MAAI,CAAC,OAAO;AACR,WAAO;AACX,MAAI,OAAO,OAAO,QAAQ,MAAM,GAAG,GAAG,MAAM,OAAO,MAAM,OAAO,IAAI,OAAK,EAAE,EAAE;AAC7E,MAAI,QAAQ,MAAM,GAAG;AACrB,MAAI;AACA,WAAO,MAAM;AACjB,MAAI,OAAO,MAAM,GAAG,IAAI,SAAS,OAAO;AAAA,IACpC,IAAI,UAAU;AAAA,IACd;AAAA,IACA,OAAO,CAAC,UAAU,EAAE,CAAC,IAAI,GAAG,OAAM,CAAE,CAAC;AAAA,EAC7C,CAAK;AACD,YAAU,KAAK,IAAI;AACnB,SAAO,KAAK;AAChB;AACA,SAAS,MAAM,MAAM,MAAM;AACvB,MAAI,OAAO,SAAS,OAAO,EAAE,IAAI,UAAU,QAAQ,MAAM,YAAY,OAAO;AAAA,IACpE,iBAAiB,IAAI,MAAM,IAAI;AAAA,IAC/B,eAAe,IAAI,MAAM,QAAM,KAAK,UAAU,EAAE,CAAC;AAAA,EAC7D,GAAW,KAAK,MAAM;AAClB,YAAU,KAAK,IAAI;AACnB,SAAO;AACX;AAAA,CA+Gc;AAAA,EACV,KAAkB,2BAAW,KAAK,EAAE,OAAO,UAAU,WAAW,MAAM,YAAY,EAAE,KAAK,MAAK,GAAI,aAAa,UAAU,KAAK;AAAA,EAC9H,KAAkB,2BAAW,KAAK,EAAE,OAAO,UAAU,WAAW,MAAM,YAAY,EAAE,KAAK,MAAK,GAAI,aAAa,UAAU,KAAK;AAElI;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@codemirror_legacy-modes@6.5.2/node_modules/@codemirror/legacy-modes/mode/apl.mjs

@@ -0,0 +1,141 @@
+var builtInFuncs = {
+  "+": ["conjugate", "add"],
+  "−": ["negate", "subtract"],
+  "×": ["signOf", "multiply"],
+  "÷": ["reciprocal", "divide"],
+  "⌈": ["ceiling", "greaterOf"],
+  "⌊": ["floor", "lesserOf"],
+  "∣": ["absolute", "residue"],
+  "⍳": ["indexGenerate", "indexOf"],
+  "?": ["roll", "deal"],
+  "⋆": ["exponentiate", "toThePowerOf"],
+  "⍟": ["naturalLog", "logToTheBase"],
+  "○": ["piTimes", "circularFuncs"],
+  "!": ["factorial", "binomial"],
+  "⌹": ["matrixInverse", "matrixDivide"],
+  "<": [null, "lessThan"],
+  "≤": [null, "lessThanOrEqual"],
+  "=": [null, "equals"],
+  ">": [null, "greaterThan"],
+  "≥": [null, "greaterThanOrEqual"],
+  "≠": [null, "notEqual"],
+  "≡": ["depth", "match"],
+  "≢": [null, "notMatch"],
+  "∈": ["enlist", "membership"],
+  "⍷": [null, "find"],
+  "∪": ["unique", "union"],
+  "∩": [null, "intersection"],
+  "∼": ["not", "without"],
+  "∨": [null, "or"],
+  "∧": [null, "and"],
+  "⍱": [null, "nor"],
+  "⍲": [null, "nand"],
+  "⍴": ["shapeOf", "reshape"],
+  ",": ["ravel", "catenate"],
+  "⍪": [null, "firstAxisCatenate"],
+  "⌽": ["reverse", "rotate"],
+  "⊖": ["axis1Reverse", "axis1Rotate"],
+  "⍉": ["transpose", null],
+  "↑": ["first", "take"],
+  "↓": [null, "drop"],
+  "⊂": ["enclose", "partitionWithAxis"],
+  "⊃": ["diclose", "pick"],
+  "⌷": [null, "index"],
+  "⍋": ["gradeUp", null],
+  "⍒": ["gradeDown", null],
+  "⊤": ["encode", null],
+  "⊥": ["decode", null],
+  "⍕": ["format", "formatByExample"],
+  "⍎": ["execute", null],
+  "⊣": ["stop", "left"],
+  "⊢": ["pass", "right"]
+};
+var isOperator = /[\.\/⌿⍀¨⍣]/;
+var isNiladic = /⍬/;
+var isFunction = /[\+−×÷⌈⌊∣⍳\?⋆⍟○!⌹<≤=>≥≠≡≢∈⍷∪∩∼∨∧⍱⍲⍴,⍪⌽⊖⍉↑↓⊂⊃⌷⍋⍒⊤⊥⍕⍎⊣⊢]/;
+var isArrow = /←/;
+var isComment = /[⍝#].*$/;
+var stringEater = function(type) {
+  var prev;
+  prev = false;
+  return function(c) {
+    prev = c;
+    if (c === type) {
+      return prev === "\\";
+    }
+    return true;
+  };
+};
+const apl = {
+  name: "apl",
+  startState: function() {
+    return {
+      prev: false,
+      func: false,
+      op: false,
+      string: false,
+      escape: false
+    };
+  },
+  token: function(stream, state) {
+    var ch;
+    if (stream.eatSpace()) {
+      return null;
+    }
+    ch = stream.next();
+    if (ch === '"' || ch === "'") {
+      stream.eatWhile(stringEater(ch));
+      stream.next();
+      state.prev = true;
+      return "string";
+    }
+    if (/[\[{\(]/.test(ch)) {
+      state.prev = false;
+      return null;
+    }
+    if (/[\]}\)]/.test(ch)) {
+      state.prev = true;
+      return null;
+    }
+    if (isNiladic.test(ch)) {
+      state.prev = false;
+      return "atom";
+    }
+    if (/[¯\d]/.test(ch)) {
+      if (state.func) {
+        state.func = false;
+        state.prev = false;
+      } else {
+        state.prev = true;
+      }
+      stream.eatWhile(/[\w\.]/);
+      return "number";
+    }
+    if (isOperator.test(ch)) {
+      return "operator";
+    }
+    if (isArrow.test(ch)) {
+      return "operator";
+    }
+    if (isFunction.test(ch)) {
+      state.func = true;
+      state.prev = false;
+      return builtInFuncs[ch] ? "variableName.function.standard" : "variableName.function";
+    }
+    if (isComment.test(ch)) {
+      stream.skipToEnd();
+      return "comment";
+    }
+    if (ch === "∘" && stream.peek() === ".") {
+      stream.next();
+      return "variableName.function";
+    }
+    stream.eatWhile(/[\w\$_]/);
+    state.prev = true;
+    return "keyword";
+  }
+};
+export {
+  apl
+};
+//# sourceMappingURL=apl.mjs.map

package/dist/node_modules/.pnpm/@codemirror_legacy-modes@6.5.2/node_modules/@codemirror/legacy-modes/mode/apl.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"apl.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/@codemirror+legacy-modes@6.5.2/node_modules/@codemirror/legacy-modes/mode/apl.js"],"sourcesContent":["var builtInFuncs = {\n  \"+\": [\"conjugate\", \"add\"],\n  \"−\": [\"negate\", \"subtract\"],\n  \"×\": [\"signOf\", \"multiply\"],\n  \"÷\": [\"reciprocal\", \"divide\"],\n  \"⌈\": [\"ceiling\", \"greaterOf\"],\n  \"⌊\": [\"floor\", \"lesserOf\"],\n  \"∣\": [\"absolute\", \"residue\"],\n  \"⍳\": [\"indexGenerate\", \"indexOf\"],\n  \"?\": [\"roll\", \"deal\"],\n  \"⋆\": [\"exponentiate\", \"toThePowerOf\"],\n  \"⍟\": [\"naturalLog\", \"logToTheBase\"],\n  \"○\": [\"piTimes\", \"circularFuncs\"],\n  \"!\": [\"factorial\", \"binomial\"],\n  \"⌹\": [\"matrixInverse\", \"matrixDivide\"],\n  \"<\": [null, \"lessThan\"],\n  \"≤\": [null, \"lessThanOrEqual\"],\n  \"=\": [null, \"equals\"],\n  \">\": [null, \"greaterThan\"],\n  \"≥\": [null, \"greaterThanOrEqual\"],\n  \"≠\": [null, \"notEqual\"],\n  \"≡\": [\"depth\", \"match\"],\n  \"≢\": [null, \"notMatch\"],\n  \"∈\": [\"enlist\", \"membership\"],\n  \"⍷\": [null, \"find\"],\n  \"∪\": [\"unique\", \"union\"],\n  \"∩\": [null, \"intersection\"],\n  \"∼\": [\"not\", \"without\"],\n  \"∨\": [null, \"or\"],\n  \"∧\": [null, \"and\"],\n  \"⍱\": [null, \"nor\"],\n  \"⍲\": [null, \"nand\"],\n  \"⍴\": [\"shapeOf\", \"reshape\"],\n  \",\": [\"ravel\", \"catenate\"],\n  \"⍪\": [null, \"firstAxisCatenate\"],\n  \"⌽\": [\"reverse\", \"rotate\"],\n  \"⊖\": [\"axis1Reverse\", \"axis1Rotate\"],\n  \"⍉\": [\"transpose\", null],\n  \"↑\": [\"first\", \"take\"],\n  \"↓\": [null, \"drop\"],\n  \"⊂\": [\"enclose\", \"partitionWithAxis\"],\n  \"⊃\": [\"diclose\", \"pick\"],\n  \"⌷\": [null, \"index\"],\n  \"⍋\": [\"gradeUp\", null],\n  \"⍒\": [\"gradeDown\", null],\n  \"⊤\": [\"encode\", null],\n  \"⊥\": [\"decode\", null],\n  \"⍕\": [\"format\", \"formatByExample\"],\n  \"⍎\": [\"execute\", null],\n  \"⊣\": [\"stop\", \"left\"],\n  \"⊢\": [\"pass\", \"right\"]\n};\n\nvar isOperator = /[\\.\\/⌿⍀¨⍣]/;\nvar isNiladic = /⍬/;\nvar isFunction = /[\\+−×÷⌈⌊∣⍳\\?⋆⍟○!⌹<≤=>≥≠≡≢∈⍷∪∩∼∨∧⍱⍲⍴,⍪⌽⊖⍉↑↓⊂⊃⌷⍋⍒⊤⊥⍕⍎⊣⊢]/;\nvar isArrow = /←/;\nvar isComment = /[⍝#].*$/;\n\nvar stringEater = function(type) {\n  var prev;\n  prev = false;\n  return function(c) {\n    prev = c;\n    if (c === type) {\n      return prev === \"\\\\\";\n    }\n    return true;\n  };\n};\n\nexport const apl = {\n  name: \"apl\",\n  startState: function() {\n    return {\n      prev: false,\n      func: false,\n      op: false,\n      string: false,\n      escape: false\n    };\n  },\n  token: function(stream, state) {\n    var ch;\n    if (stream.eatSpace()) {\n      return null;\n    }\n    ch = stream.next();\n    if (ch === '\"' || ch === \"'\") {\n      stream.eatWhile(stringEater(ch));\n      stream.next();\n      state.prev = true;\n      return \"string\";\n    }\n    if (/[\\[{\\(]/.test(ch)) {\n      state.prev = false;\n      return null;\n    }\n    if (/[\\]}\\)]/.test(ch)) {\n      state.prev = true;\n      return null;\n    }\n    if (isNiladic.test(ch)) {\n      state.prev = false;\n      return \"atom\";\n    }\n    if (/[¯\\d]/.test(ch)) {\n      if (state.func) {\n        state.func = false;\n        state.prev = false;\n      } else {\n        state.prev = true;\n      }\n      stream.eatWhile(/[\\w\\.]/);\n      return \"number\";\n    }\n    if (isOperator.test(ch)) {\n      return \"operator\"\n    }\n    if (isArrow.test(ch)) {\n      return \"operator\";\n    }\n    if (isFunction.test(ch)) {\n      state.func = true;\n      state.prev = false;\n      return builtInFuncs[ch] ? \"variableName.function.standard\" : \"variableName.function\"\n    }\n    if (isComment.test(ch)) {\n      stream.skipToEnd();\n      return \"comment\";\n    }\n    if (ch === \"∘\" && stream.peek() === \".\") {\n      stream.next();\n      return \"variableName.function\";\n    }\n    stream.eatWhile(/[\\w\\$_]/);\n    state.prev = true;\n    return \"keyword\";\n  }\n}\n"],"names":[],"mappings":"AAAA,IAAI,eAAe;AAAA,EACjB,KAAK,CAAC,aAAa,KAAK;AAAA,EACxB,KAAK,CAAC,UAAU,UAAU;AAAA,EAC1B,KAAK,CAAC,UAAU,UAAU;AAAA,EAC1B,KAAK,CAAC,cAAc,QAAQ;AAAA,EAC5B,KAAK,CAAC,WAAW,WAAW;AAAA,EAC5B,KAAK,CAAC,SAAS,UAAU;AAAA,EACzB,KAAK,CAAC,YAAY,SAAS;AAAA,EAC3B,KAAK,CAAC,iBAAiB,SAAS;AAAA,EAChC,KAAK,CAAC,QAAQ,MAAM;AAAA,EACpB,KAAK,CAAC,gBAAgB,cAAc;AAAA,EACpC,KAAK,CAAC,cAAc,cAAc;AAAA,EAClC,KAAK,CAAC,WAAW,eAAe;AAAA,EAChC,KAAK,CAAC,aAAa,UAAU;AAAA,EAC7B,KAAK,CAAC,iBAAiB,cAAc;AAAA,EACrC,KAAK,CAAC,MAAM,UAAU;AAAA,EACtB,KAAK,CAAC,MAAM,iBAAiB;AAAA,EAC7B,KAAK,CAAC,MAAM,QAAQ;AAAA,EACpB,KAAK,CAAC,MAAM,aAAa;AAAA,EACzB,KAAK,CAAC,MAAM,oBAAoB;AAAA,EAChC,KAAK,CAAC,MAAM,UAAU;AAAA,EACtB,KAAK,CAAC,SAAS,OAAO;AAAA,EACtB,KAAK,CAAC,MAAM,UAAU;AAAA,EACtB,KAAK,CAAC,UAAU,YAAY;AAAA,EAC5B,KAAK,CAAC,MAAM,MAAM;AAAA,EAClB,KAAK,CAAC,UAAU,OAAO;AAAA,EACvB,KAAK,CAAC,MAAM,cAAc;AAAA,EAC1B,KAAK,CAAC,OAAO,SAAS;AAAA,EACtB,KAAK,CAAC,MAAM,IAAI;AAAA,EAChB,KAAK,CAAC,MAAM,KAAK;AAAA,EACjB,KAAK,CAAC,MAAM,KAAK;AAAA,EACjB,KAAK,CAAC,MAAM,MAAM;AAAA,EAClB,KAAK,CAAC,WAAW,SAAS;AAAA,EAC1B,KAAK,CAAC,SAAS,UAAU;AAAA,EACzB,KAAK,CAAC,MAAM,mBAAmB;AAAA,EAC/B,KAAK,CAAC,WAAW,QAAQ;AAAA,EACzB,KAAK,CAAC,gBAAgB,aAAa;AAAA,EACnC,KAAK,CAAC,aAAa,IAAI;AAAA,EACvB,KAAK,CAAC,SAAS,MAAM;AAAA,EACrB,KAAK,CAAC,MAAM,MAAM;AAAA,EAClB,KAAK,CAAC,WAAW,mBAAmB;AAAA,EACpC,KAAK,CAAC,WAAW,MAAM;AAAA,EACvB,KAAK,CAAC,MAAM,OAAO;AAAA,EACnB,KAAK,CAAC,WAAW,IAAI;AAAA,EACrB,KAAK,CAAC,aAAa,IAAI;AAAA,EACvB,KAAK,CAAC,UAAU,IAAI;AAAA,EACpB,KAAK,CAAC,UAAU,IAAI;AAAA,EACpB,KAAK,CAAC,UAAU,iBAAiB;AAAA,EACjC,KAAK,CAAC,WAAW,IAAI;AAAA,EACrB,KAAK,CAAC,QAAQ,MAAM;AAAA,EACpB,KAAK,CAAC,QAAQ,OAAO;AACvB;AAEA,IAAI,aAAa;AACjB,IAAI,YAAY;AAChB,IAAI,aAAa;AACjB,IAAI,UAAU;AACd,IAAI,YAAY;AAEhB,IAAI,cAAc,SAAS,MAAM;AAC/B,MAAI;AACJ,SAAO;AACP,SAAO,SAAS,GAAG;AACjB,WAAO;AACP,QAAI,MAAM,MAAM;AACd,aAAO,SAAS;AAAA,IAClB;AACA,WAAO;AAAA,EACT;AACF;AAEY,MAAC,MAAM;AAAA,EACjB,MAAM;AAAA,EACN,YAAY,WAAW;AACrB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,QAAQ;AAAA,MACR,QAAQ;AAAA,IACd;AAAA,EACE;AAAA,EACA,OAAO,SAAS,QAAQ,OAAO;AAC7B,QAAI;AACJ,QAAI,OAAO,YAAY;AACrB,aAAO;AAAA,IACT;AACA,SAAK,OAAO,KAAI;AAChB,QAAI,OAAO,OAAO,OAAO,KAAK;AAC5B,aAAO,SAAS,YAAY,EAAE,CAAC;AAC/B,aAAO,KAAI;AACX,YAAM,OAAO;AACb,aAAO;AAAA,IACT;AACA,QAAI,UAAU,KAAK,EAAE,GAAG;AACtB,YAAM,OAAO;AACb,aAAO;AAAA,IACT;AACA,QAAI,UAAU,KAAK,EAAE,GAAG;AACtB,YAAM,OAAO;AACb,aAAO;AAAA,IACT;AACA,QAAI,UAAU,KAAK,EAAE,GAAG;AACtB,YAAM,OAAO;AACb,aAAO;AAAA,IACT;AACA,QAAI,QAAQ,KAAK,EAAE,GAAG;AACpB,UAAI,MAAM,MAAM;AACd,cAAM,OAAO;AACb,cAAM,OAAO;AAAA,MACf,OAAO;AACL,cAAM,OAAO;AAAA,MACf;AACA,aAAO,SAAS,QAAQ;AACxB,aAAO;AAAA,IACT;AACA,QAAI,WAAW,KAAK,EAAE,GAAG;AACvB,aAAO;AAAA,IACT;AACA,QAAI,QAAQ,KAAK,EAAE,GAAG;AACpB,aAAO;AAAA,IACT;AACA,QAAI,WAAW,KAAK,EAAE,GAAG;AACvB,YAAM,OAAO;AACb,YAAM,OAAO;AACb,aAAO,aAAa,EAAE,IAAI,mCAAmC;AAAA,IAC/D;AACA,QAAI,UAAU,KAAK,EAAE,GAAG;AACtB,aAAO,UAAS;AAChB,aAAO;AAAA,IACT;AACA,QAAI,OAAO,OAAO,OAAO,KAAI,MAAO,KAAK;AACvC,aAAO,KAAI;AACX,aAAO;AAAA,IACT;AACA,WAAO,SAAS,SAAS;AACzB,UAAM,OAAO;AACb,WAAO;AAAA,EACT;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@codemirror_legacy-modes@6.5.2/node_modules/@codemirror/legacy-modes/mode/asciiarmor.mjs

@@ -0,0 +1,57 @@
+function errorIfNotEmpty(stream) {
+  var nonWS = stream.match(/^\s*\S/);
+  stream.skipToEnd();
+  return nonWS ? "error" : null;
+}
+const asciiArmor = {
+  name: "asciiarmor",
+  token: function(stream, state) {
+    var m;
+    if (state.state == "top") {
+      if (stream.sol() && (m = stream.match(/^-----BEGIN (.*)?-----\s*$/))) {
+        state.state = "headers";
+        state.type = m[1];
+        return "tag";
+      }
+      return errorIfNotEmpty(stream);
+    } else if (state.state == "headers") {
+      if (stream.sol() && stream.match(/^\w+:/)) {
+        state.state = "header";
+        return "atom";
+      } else {
+        var result = errorIfNotEmpty(stream);
+        if (result) state.state = "body";
+        return result;
+      }
+    } else if (state.state == "header") {
+      stream.skipToEnd();
+      state.state = "headers";
+      return "string";
+    } else if (state.state == "body") {
+      if (stream.sol() && (m = stream.match(/^-----END (.*)?-----\s*$/))) {
+        if (m[1] != state.type) return "error";
+        state.state = "end";
+        return "tag";
+      } else {
+        if (stream.eatWhile(/[A-Za-z0-9+\/=]/)) {
+          return null;
+        } else {
+          stream.next();
+          return "error";
+        }
+      }
+    } else if (state.state == "end") {
+      return errorIfNotEmpty(stream);
+    }
+  },
+  blankLine: function(state) {
+    if (state.state == "headers") state.state = "body";
+  },
+  startState: function() {
+    return { state: "top", type: null };
+  }
+};
+export {
+  asciiArmor
+};
+//# sourceMappingURL=asciiarmor.mjs.map

package/dist/node_modules/.pnpm/@codemirror_legacy-modes@6.5.2/node_modules/@codemirror/legacy-modes/mode/asciiarmor.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"asciiarmor.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/@codemirror+legacy-modes@6.5.2/node_modules/@codemirror/legacy-modes/mode/asciiarmor.js"],"sourcesContent":["function errorIfNotEmpty(stream) {\n  var nonWS = stream.match(/^\\s*\\S/);\n  stream.skipToEnd();\n  return nonWS ? \"error\" : null;\n}\n\nexport const asciiArmor = {\n  name: \"asciiarmor\",\n  token: function(stream, state) {\n    var m;\n    if (state.state == \"top\") {\n      if (stream.sol() && (m = stream.match(/^-----BEGIN (.*)?-----\\s*$/))) {\n        state.state = \"headers\";\n        state.type = m[1];\n        return \"tag\";\n      }\n      return errorIfNotEmpty(stream);\n    } else if (state.state == \"headers\") {\n      if (stream.sol() && stream.match(/^\\w+:/)) {\n        state.state = \"header\";\n        return \"atom\";\n      } else {\n        var result = errorIfNotEmpty(stream);\n        if (result) state.state = \"body\";\n        return result;\n      }\n    } else if (state.state == \"header\") {\n      stream.skipToEnd();\n      state.state = \"headers\";\n      return \"string\";\n    } else if (state.state == \"body\") {\n      if (stream.sol() && (m = stream.match(/^-----END (.*)?-----\\s*$/))) {\n        if (m[1] != state.type) return \"error\";\n        state.state = \"end\";\n        return \"tag\";\n      } else {\n        if (stream.eatWhile(/[A-Za-z0-9+\\/=]/)) {\n          return null;\n        } else {\n          stream.next();\n          return \"error\";\n        }\n      }\n    } else if (state.state == \"end\") {\n      return errorIfNotEmpty(stream);\n    }\n  },\n  blankLine: function(state) {\n    if (state.state == \"headers\") state.state = \"body\";\n  },\n  startState: function() {\n    return {state: \"top\", type: null};\n  }\n};\n"],"names":[],"mappings":"AAAA,SAAS,gBAAgB,QAAQ;AAC/B,MAAI,QAAQ,OAAO,MAAM,QAAQ;AACjC,SAAO,UAAS;AAChB,SAAO,QAAQ,UAAU;AAC3B;AAEY,MAAC,aAAa;AAAA,EACxB,MAAM;AAAA,EACN,OAAO,SAAS,QAAQ,OAAO;AAC7B,QAAI;AACJ,QAAI,MAAM,SAAS,OAAO;AACxB,UAAI,OAAO,UAAU,IAAI,OAAO,MAAM,4BAA4B,IAAI;AACpE,cAAM,QAAQ;AACd,cAAM,OAAO,EAAE,CAAC;AAChB,eAAO;AAAA,MACT;AACA,aAAO,gBAAgB,MAAM;AAAA,IAC/B,WAAW,MAAM,SAAS,WAAW;AACnC,UAAI,OAAO,IAAG,KAAM,OAAO,MAAM,OAAO,GAAG;AACzC,cAAM,QAAQ;AACd,eAAO;AAAA,MACT,OAAO;AACL,YAAI,SAAS,gBAAgB,MAAM;AACnC,YAAI,OAAQ,OAAM,QAAQ;AAC1B,eAAO;AAAA,MACT;AAAA,IACF,WAAW,MAAM,SAAS,UAAU;AAClC,aAAO,UAAS;AAChB,YAAM,QAAQ;AACd,aAAO;AAAA,IACT,WAAW,MAAM,SAAS,QAAQ;AAChC,UAAI,OAAO,UAAU,IAAI,OAAO,MAAM,0BAA0B,IAAI;AAClE,YAAI,EAAE,CAAC,KAAK,MAAM,KAAM,QAAO;AAC/B,cAAM,QAAQ;AACd,eAAO;AAAA,MACT,OAAO;AACL,YAAI,OAAO,SAAS,iBAAiB,GAAG;AACtC,iBAAO;AAAA,QACT,OAAO;AACL,iBAAO,KAAI;AACX,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF,WAAW,MAAM,SAAS,OAAO;AAC/B,aAAO,gBAAgB,MAAM;AAAA,IAC/B;AAAA,EACF;AAAA,EACA,WAAW,SAAS,OAAO;AACzB,QAAI,MAAM,SAAS,UAAW,OAAM,QAAQ;AAAA,EAC9C;AAAA,EACA,YAAY,WAAW;AACrB,WAAO,EAAC,OAAO,OAAO,MAAM,KAAI;AAAA,EAClC;AACF;","x_google_ignoreList":[0]}