@mittwald/flow-react-components 0.2.0-alpha.864 → 0.2.0-alpha.866

package/dist/js/node_modules/.pnpm/@lezer_common@1.5.2/node_modules/@lezer/common/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":[],"sources":["../../../../../../../../../../../node_modules/.pnpm/@lezer+common@1.5.2/node_modules/@lezer/common/dist/index.js"],"sourcesContent":["/**\nThe default maximum length of a `TreeBuffer` node.\n*/\nconst DefaultBufferLength = 1024;\nlet nextPropID = 0;\nclass Range {\n    constructor(from, to) {\n        this.from = from;\n        this.to = to;\n    }\n}\n/**\nEach [node type](#common.NodeType) or [individual tree](#common.Tree)\ncan have metadata associated with it in props. Instances of this\nclass represent prop names.\n*/\nclass NodeProp {\n    /**\n    Create a new node prop type.\n    */\n    constructor(config = {}) {\n        this.id = nextPropID++;\n        this.perNode = !!config.perNode;\n        this.deserialize = config.deserialize || (() => {\n            throw new Error(\"This node type doesn't define a deserialize function\");\n        });\n        this.combine = config.combine || null;\n    }\n    /**\n    This is meant to be used with\n    [`NodeSet.extend`](#common.NodeSet.extend) or\n    [`LRParser.configure`](#lr.ParserConfig.props) to compute\n    prop values for each node type in the set. Takes a [match\n    object](#common.NodeType^match) or function that returns undefined\n    if the node type doesn't get this prop, and the prop's value if\n    it does.\n    */\n    add(match) {\n        if (this.perNode)\n            throw new RangeError(\"Can't add per-node props to node types\");\n        if (typeof match != \"function\")\n            match = NodeType.match(match);\n        return (type) => {\n            let result = match(type);\n            return result === undefined ? null : [this, result];\n        };\n    }\n}\n/**\nProp that is used to describe matching delimiters. For opening\ndelimiters, this holds an array of node names (written as a\nspace-separated string when declaring this prop in a grammar)\nfor the node types of closing delimiters that match it.\n*/\nNodeProp.closedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/**\nThe inverse of [`closedBy`](#common.NodeProp^closedBy). This is\nattached to closing delimiters, holding an array of node names\nof types of matching opening delimiters.\n*/\nNodeProp.openedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/**\nUsed to assign node types to groups (for example, all node\ntypes that represent an expression could be tagged with an\n`\"Expression\"` group).\n*/\nNodeProp.group = new NodeProp({ deserialize: str => str.split(\" \") });\n/**\nAttached to nodes to indicate these should be\n[displayed](https://codemirror.net/docs/ref/#language.syntaxTree)\nin a bidirectional text isolate, so that direction-neutral\ncharacters on their sides don't incorrectly get associated with\nsurrounding text. You'll generally want to set this for nodes\nthat contain arbitrary text, like strings and comments, and for\nnodes that appear _inside_ arbitrary text, like HTML tags. When\nnot given a value, in a grammar declaration, defaults to\n`\"auto\"`.\n*/\nNodeProp.isolate = new NodeProp({ deserialize: value => {\n        if (value && value != \"rtl\" && value != \"ltr\" && value != \"auto\")\n            throw new RangeError(\"Invalid value for isolate: \" + value);\n        return value || \"auto\";\n    } });\n/**\nThe hash of the [context](#lr.ContextTracker.constructor)\nthat the node was parsed in, if any. Used to limit reuse of\ncontextual nodes.\n*/\nNodeProp.contextHash = new NodeProp({ perNode: true });\n/**\nThe distance beyond the end of the node that the tokenizer\nlooked ahead for any of the tokens inside the node. (The LR\nparser only stores this when it is larger than 25, for\nefficiency reasons.)\n*/\nNodeProp.lookAhead = new NodeProp({ perNode: true });\n/**\nThis per-node prop is used to replace a given node, or part of a\nnode, with another tree. This is useful to include trees from\ndifferent languages in mixed-language parsers.\n*/\nNodeProp.mounted = new NodeProp({ perNode: true });\n/**\nA mounted tree, which can be [stored](#common.NodeProp^mounted) on\na tree node to indicate that parts of its content are\nrepresented by another tree.\n*/\nclass MountedTree {\n    constructor(\n    /**\n    The inner tree.\n    */\n    tree, \n    /**\n    If this is null, this tree replaces the entire node (it will\n    be included in the regular iteration instead of its host\n    node). If not, only the given ranges are considered to be\n    covered by this tree. This is used for trees that are mixed in\n    a way that isn't strictly hierarchical. Such mounted trees are\n    only entered by [`resolveInner`](#common.Tree.resolveInner)\n    and [`enter`](#common.SyntaxNode.enter).\n    */\n    overlay, \n    /**\n    The parser used to create this subtree.\n    */\n    parser, \n    /**\n    [Indicates](#common.IterMode.EnterBracketed) that the nested\n    content is delineated with some kind\n    of bracket token.\n    */\n    bracketed = false) {\n        this.tree = tree;\n        this.overlay = overlay;\n        this.parser = parser;\n        this.bracketed = bracketed;\n    }\n    /**\n    @internal\n    */\n    static get(tree) {\n        return tree && tree.props && tree.props[NodeProp.mounted.id];\n    }\n}\nconst noProps = Object.create(null);\n/**\nEach node in a syntax tree has a node type associated with it.\n*/\nclass NodeType {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The name of the node type. Not necessarily unique, but if the\n    grammar was written properly, different node types with the\n    same name within a node set should play the same semantic\n    role.\n    */\n    name, \n    /**\n    @internal\n    */\n    props, \n    /**\n    The id of this node in its set. Corresponds to the term ids\n    used in the parser.\n    */\n    id, \n    /**\n    @internal\n    */\n    flags = 0) {\n        this.name = name;\n        this.props = props;\n        this.id = id;\n        this.flags = flags;\n    }\n    /**\n    Define a node type.\n    */\n    static define(spec) {\n        let props = spec.props && spec.props.length ? Object.create(null) : noProps;\n        let flags = (spec.top ? 1 /* NodeFlag.Top */ : 0) | (spec.skipped ? 2 /* NodeFlag.Skipped */ : 0) |\n            (spec.error ? 4 /* NodeFlag.Error */ : 0) | (spec.name == null ? 8 /* NodeFlag.Anonymous */ : 0);\n        let type = new NodeType(spec.name || \"\", props, spec.id, flags);\n        if (spec.props)\n            for (let src of spec.props) {\n                if (!Array.isArray(src))\n                    src = src(type);\n                if (src) {\n                    if (src[0].perNode)\n                        throw new RangeError(\"Can't store a per-node prop on a node type\");\n                    props[src[0].id] = src[1];\n                }\n            }\n        return type;\n    }\n    /**\n    Retrieves a node prop for this type. Will return `undefined` if\n    the prop isn't present on this node.\n    */\n    prop(prop) { return this.props[prop.id]; }\n    /**\n    True when this is the top node of a grammar.\n    */\n    get isTop() { return (this.flags & 1 /* NodeFlag.Top */) > 0; }\n    /**\n    True when this node is produced by a skip rule.\n    */\n    get isSkipped() { return (this.flags & 2 /* NodeFlag.Skipped */) > 0; }\n    /**\n    Indicates whether this is an error node.\n    */\n    get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }\n    /**\n    When true, this node type doesn't correspond to a user-declared\n    named node, for example because it is used to cache repetition.\n    */\n    get isAnonymous() { return (this.flags & 8 /* NodeFlag.Anonymous */) > 0; }\n    /**\n    Returns true when this node's name or one of its\n    [groups](#common.NodeProp^group) matches the given string.\n    */\n    is(name) {\n        if (typeof name == 'string') {\n            if (this.name == name)\n                return true;\n            let group = this.prop(NodeProp.group);\n            return group ? group.indexOf(name) > -1 : false;\n        }\n        return this.id == name;\n    }\n    /**\n    Create a function from node types to arbitrary values by\n    specifying an object whose property names are node or\n    [group](#common.NodeProp^group) names. Often useful with\n    [`NodeProp.add`](#common.NodeProp.add). You can put multiple\n    names, separated by spaces, in a single property name to map\n    multiple node names to a single value.\n    */\n    static match(map) {\n        let direct = Object.create(null);\n        for (let prop in map)\n            for (let name of prop.split(\" \"))\n                direct[name] = map[prop];\n        return (node) => {\n            for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {\n                let found = direct[i < 0 ? node.name : groups[i]];\n                if (found)\n                    return found;\n            }\n        };\n    }\n}\n/**\nAn empty dummy node type to use when no actual type is available.\n*/\nNodeType.none = new NodeType(\"\", Object.create(null), 0, 8 /* NodeFlag.Anonymous */);\n/**\nA node set holds a collection of node types. It is used to\ncompactly represent trees by storing their type ids, rather than a\nfull pointer to the type object, in a numeric array. Each parser\n[has](#lr.LRParser.nodeSet) a node set, and [tree\nbuffers](#common.TreeBuffer) can only store collections of nodes\nfrom the same set. A set can have a maximum of 2**16 (65536) node\ntypes in it, so that the ids fit into 16-bit typed array slots.\n*/\nclass NodeSet {\n    /**\n    Create a set with the given types. The `id` property of each\n    type should correspond to its position within the array.\n    */\n    constructor(\n    /**\n    The node types in this set, by id.\n    */\n    types) {\n        this.types = types;\n        for (let i = 0; i < types.length; i++)\n            if (types[i].id != i)\n                throw new RangeError(\"Node type ids should correspond to array positions when creating a node set\");\n    }\n    /**\n    Create a copy of this set with some node properties added. The\n    arguments to this method can be created with\n    [`NodeProp.add`](#common.NodeProp.add).\n    */\n    extend(...props) {\n        let newTypes = [];\n        for (let type of this.types) {\n            let newProps = null;\n            for (let source of props) {\n                let add = source(type);\n                if (add) {\n                    if (!newProps)\n                        newProps = Object.assign({}, type.props);\n                    let value = add[1], prop = add[0];\n                    if (prop.combine && prop.id in newProps)\n                        value = prop.combine(newProps[prop.id], value);\n                    newProps[prop.id] = value;\n                }\n            }\n            newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);\n        }\n        return new NodeSet(newTypes);\n    }\n}\nconst CachedNode = new WeakMap(), CachedInnerNode = new WeakMap();\n/**\nOptions that control iteration. Can be combined with the `|`\noperator to enable multiple ones.\n*/\nvar IterMode;\n(function (IterMode) {\n    /**\n    When enabled, iteration will only visit [`Tree`](#common.Tree)\n    objects, not nodes packed into\n    [`TreeBuffer`](#common.TreeBuffer)s.\n    */\n    IterMode[IterMode[\"ExcludeBuffers\"] = 1] = \"ExcludeBuffers\";\n    /**\n    Enable this to make iteration include anonymous nodes (such as\n    the nodes that wrap repeated grammar constructs into a balanced\n    tree).\n    */\n    IterMode[IterMode[\"IncludeAnonymous\"] = 2] = \"IncludeAnonymous\";\n    /**\n    By default, regular [mounted](#common.NodeProp^mounted) nodes\n    replace their base node in iteration. Enable this to ignore them\n    instead.\n    */\n    IterMode[IterMode[\"IgnoreMounts\"] = 4] = \"IgnoreMounts\";\n    /**\n    This option only applies in\n    [`enter`](#common.SyntaxNode.enter)-style methods. It tells the\n    library to not enter mounted overlays if one covers the given\n    position.\n    */\n    IterMode[IterMode[\"IgnoreOverlays\"] = 8] = \"IgnoreOverlays\";\n    /**\n    When set, positions on the boundary of a mounted overlay tree\n    that has its [`bracketed`](#common.NestedParse.bracketed) flag\n    set will enter that tree regardless of side. Only supported in\n    [`enter`](#common.SyntaxNode.enter), not in cursors.\n    */\n    IterMode[IterMode[\"EnterBracketed\"] = 16] = \"EnterBracketed\";\n})(IterMode || (IterMode = {}));\n/**\nA piece of syntax tree. There are two ways to approach these\ntrees: the way they are actually stored in memory, and the\nconvenient way.\n\nSyntax trees are stored as a tree of `Tree` and `TreeBuffer`\nobjects. By packing detail information into `TreeBuffer` leaf\nnodes, the representation is made a lot more memory-efficient.\n\nHowever, when you want to actually work with tree nodes, this\nrepresentation is very awkward, so most client code will want to\nuse the [`TreeCursor`](#common.TreeCursor) or\n[`SyntaxNode`](#common.SyntaxNode) interface instead, which provides\na view on some part of this data structure, and can be used to\nmove around to adjacent nodes.\n*/\nclass Tree {\n    /**\n    Construct a new tree. See also [`Tree.build`](#common.Tree^build).\n    */\n    constructor(\n    /**\n    The type of the top node.\n    */\n    type, \n    /**\n    This node's child nodes.\n    */\n    children, \n    /**\n    The positions (offsets relative to the start of this tree) of\n    the children.\n    */\n    positions, \n    /**\n    The total length of this tree\n    */\n    length, \n    /**\n    Per-node [node props](#common.NodeProp) to associate with this node.\n    */\n    props) {\n        this.type = type;\n        this.children = children;\n        this.positions = positions;\n        this.length = length;\n        /**\n        @internal\n        */\n        this.props = null;\n        if (props && props.length) {\n            this.props = Object.create(null);\n            for (let [prop, value] of props)\n                this.props[typeof prop == \"number\" ? prop : prop.id] = value;\n        }\n    }\n    /**\n    @internal\n    */\n    toString() {\n        let mounted = MountedTree.get(this);\n        if (mounted && !mounted.overlay)\n            return mounted.tree.toString();\n        let children = \"\";\n        for (let ch of this.children) {\n            let str = ch.toString();\n            if (str) {\n                if (children)\n                    children += \",\";\n                children += str;\n            }\n        }\n        return !this.type.name ? children :\n            (/\\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) +\n                (children.length ? \"(\" + children + \")\" : \"\");\n    }\n    /**\n    Get a [tree cursor](#common.TreeCursor) positioned at the top of\n    the tree. Mode can be used to [control](#common.IterMode) which\n    nodes the cursor visits.\n    */\n    cursor(mode = 0) {\n        return new TreeCursor(this.topNode, mode);\n    }\n    /**\n    Get a [tree cursor](#common.TreeCursor) pointing into this tree\n    at the given position and side (see\n    [`moveTo`](#common.TreeCursor.moveTo).\n    */\n    cursorAt(pos, side = 0, mode = 0) {\n        let scope = CachedNode.get(this) || this.topNode;\n        let cursor = new TreeCursor(scope);\n        cursor.moveTo(pos, side);\n        CachedNode.set(this, cursor._tree);\n        return cursor;\n    }\n    /**\n    Get a [syntax node](#common.SyntaxNode) object for the top of the\n    tree.\n    */\n    get topNode() {\n        return new TreeNode(this, 0, 0, null);\n    }\n    /**\n    Get the [syntax node](#common.SyntaxNode) at the given position.\n    If `side` is -1, this will move into nodes that end at the\n    position. If 1, it'll move into nodes that start at the\n    position. With 0, it'll only enter nodes that cover the position\n    from both sides.\n    \n    Note that this will not enter\n    [overlays](#common.MountedTree.overlay), and you often want\n    [`resolveInner`](#common.Tree.resolveInner) instead.\n    */\n    resolve(pos, side = 0) {\n        let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);\n        CachedNode.set(this, node);\n        return node;\n    }\n    /**\n    Like [`resolve`](#common.Tree.resolve), but will enter\n    [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node\n    pointing into the innermost overlaid tree at the given position\n    (with parent links going through all parent structure, including\n    the host trees).\n    */\n    resolveInner(pos, side = 0) {\n        let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);\n        CachedInnerNode.set(this, node);\n        return node;\n    }\n    /**\n    In some situations, it can be useful to iterate through all\n    nodes around a position, including those in overlays that don't\n    directly cover the position. This method gives you an iterator\n    that will produce all nodes, from small to big, around the given\n    position.\n    */\n    resolveStack(pos, side = 0) {\n        return stackIterator(this, pos, side);\n    }\n    /**\n    Iterate over the tree and its children, calling `enter` for any\n    node that touches the `from`/`to` region (if given) before\n    running over such a node's children, and `leave` (if given) when\n    leaving the node. When `enter` returns `false`, that node will\n    not have its children iterated over (or `leave` called).\n    */\n    iterate(spec) {\n        let { enter, leave, from = 0, to = this.length } = spec;\n        let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;\n        for (let c = this.cursor(mode | IterMode.IncludeAnonymous);;) {\n            let entered = false;\n            if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {\n                if (c.firstChild())\n                    continue;\n                entered = true;\n            }\n            for (;;) {\n                if (entered && leave && (anon || !c.type.isAnonymous))\n                    leave(c);\n                if (c.nextSibling())\n                    break;\n                if (!c.parent())\n                    return;\n                entered = true;\n            }\n        }\n    }\n    /**\n    Get the value of the given [node prop](#common.NodeProp) for this\n    node. Works with both per-node and per-type props.\n    */\n    prop(prop) {\n        return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : undefined;\n    }\n    /**\n    Returns the node's [per-node props](#common.NodeProp.perNode) in a\n    format that can be passed to the [`Tree`](#common.Tree)\n    constructor.\n    */\n    get propValues() {\n        let result = [];\n        if (this.props)\n            for (let id in this.props)\n                result.push([+id, this.props[id]]);\n        return result;\n    }\n    /**\n    Balance the direct children of this tree, producing a copy of\n    which may have children grouped into subtrees with type\n    [`NodeType.none`](#common.NodeType^none).\n    */\n    balance(config = {}) {\n        return this.children.length <= 8 /* Balance.BranchFactor */ ? this :\n            balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));\n    }\n    /**\n    Build a tree from a postfix-ordered buffer of node information,\n    or a cursor over such a buffer.\n    */\n    static build(data) { return buildTree(data); }\n}\n/**\nThe empty tree\n*/\nTree.empty = new Tree(NodeType.none, [], [], 0);\nclass FlatBufferCursor {\n    constructor(buffer, index) {\n        this.buffer = buffer;\n        this.index = index;\n    }\n    get id() { return this.buffer[this.index - 4]; }\n    get start() { return this.buffer[this.index - 3]; }\n    get end() { return this.buffer[this.index - 2]; }\n    get size() { return this.buffer[this.index - 1]; }\n    get pos() { return this.index; }\n    next() { this.index -= 4; }\n    fork() { return new FlatBufferCursor(this.buffer, this.index); }\n}\n/**\nTree buffers contain (type, start, end, endIndex) quads for each\nnode. In such a buffer, nodes are stored in prefix order (parents\nbefore children, with the endIndex of the parent indicating which\nchildren belong to it).\n*/\nclass TreeBuffer {\n    /**\n    Create a tree buffer.\n    */\n    constructor(\n    /**\n    The buffer's content.\n    */\n    buffer, \n    /**\n    The total length of the group of nodes in the buffer.\n    */\n    length, \n    /**\n    The node set used in this buffer.\n    */\n    set) {\n        this.buffer = buffer;\n        this.length = length;\n        this.set = set;\n    }\n    /**\n    @internal\n    */\n    get type() { return NodeType.none; }\n    /**\n    @internal\n    */\n    toString() {\n        let result = [];\n        for (let index = 0; index < this.buffer.length;) {\n            result.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result.join(\",\");\n    }\n    /**\n    @internal\n    */\n    childString(index) {\n        let id = this.buffer[index], endIndex = this.buffer[index + 3];\n        let type = this.set.types[id], result = type.name;\n        if (/\\W/.test(result) && !type.isError)\n            result = JSON.stringify(result);\n        index += 4;\n        if (endIndex == index)\n            return result;\n        let children = [];\n        while (index < endIndex) {\n            children.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result + \"(\" + children.join(\",\") + \")\";\n    }\n    /**\n    @internal\n    */\n    findChild(startIndex, endIndex, dir, pos, side) {\n        let { buffer } = this, pick = -1;\n        for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {\n            if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {\n                pick = i;\n                if (dir > 0)\n                    break;\n            }\n        }\n        return pick;\n    }\n    /**\n    @internal\n    */\n    slice(startI, endI, from) {\n        let b = this.buffer;\n        let copy = new Uint16Array(endI - startI), len = 0;\n        for (let i = startI, j = 0; i < endI;) {\n            copy[j++] = b[i++];\n            copy[j++] = b[i++] - from;\n            let to = copy[j++] = b[i++] - from;\n            copy[j++] = b[i++] - startI;\n            len = Math.max(len, to);\n        }\n        return new TreeBuffer(copy, len, this.set);\n    }\n}\nfunction checkSide(side, pos, from, to) {\n    switch (side) {\n        case -2 /* Side.Before */: return from < pos;\n        case -1 /* Side.AtOrBefore */: return to >= pos && from < pos;\n        case 0 /* Side.Around */: return from < pos && to > pos;\n        case 1 /* Side.AtOrAfter */: return from <= pos && to > pos;\n        case 2 /* Side.After */: return to > pos;\n        case 4 /* Side.DontCare */: return true;\n    }\n}\nfunction resolveNode(node, pos, side, overlays) {\n    var _a;\n    // Move up to a node that actually holds the position, if possible\n    while (node.from == node.to ||\n        (side < 1 ? node.from >= pos : node.from > pos) ||\n        (side > -1 ? node.to <= pos : node.to < pos)) {\n        let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;\n        if (!parent)\n            return node;\n        node = parent;\n    }\n    let mode = overlays ? 0 : IterMode.IgnoreOverlays;\n    // Must go up out of overlays when those do not overlap with pos\n    if (overlays)\n        for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {\n            if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)\n                node = parent;\n        }\n    for (;;) {\n        let inner = node.enter(pos, side, mode);\n        if (!inner)\n            return node;\n        node = inner;\n    }\n}\nclass BaseNode {\n    cursor(mode = 0) { return new TreeCursor(this, mode); }\n    getChild(type, before = null, after = null) {\n        let r = getChildren(this, type, before, after);\n        return r.length ? r[0] : null;\n    }\n    getChildren(type, before = null, after = null) {\n        return getChildren(this, type, before, after);\n    }\n    resolve(pos, side = 0) {\n        return resolveNode(this, pos, side, false);\n    }\n    resolveInner(pos, side = 0) {\n        return resolveNode(this, pos, side, true);\n    }\n    matchContext(context) {\n        return matchNodeContext(this.parent, context);\n    }\n    enterUnfinishedNodesBefore(pos) {\n        let scan = this.childBefore(pos), node = this;\n        while (scan) {\n            let last = scan.lastChild;\n            if (!last || last.to != scan.to)\n                break;\n            if (last.type.isError && last.from == last.to) {\n                node = scan;\n                scan = last.prevSibling;\n            }\n            else {\n                scan = last;\n            }\n        }\n        return node;\n    }\n    get node() { return this; }\n    get next() { return this.parent; }\n}\nclass TreeNode extends BaseNode {\n    constructor(_tree, from, \n    // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)\n    index, _parent) {\n        super();\n        this._tree = _tree;\n        this.from = from;\n        this.index = index;\n        this._parent = _parent;\n    }\n    get type() { return this._tree.type; }\n    get name() { return this._tree.type.name; }\n    get to() { return this.from + this._tree.length; }\n    nextChild(i, dir, pos, side, mode = 0) {\n        for (let parent = this;;) {\n            for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {\n                let next = children[i], start = positions[i] + parent.from, mounted;\n                if (!((mode & IterMode.EnterBracketed) && next instanceof Tree &&\n                    (mounted = MountedTree.get(next)) && !mounted.overlay && mounted.bracketed &&\n                    pos >= start && pos <= start + next.length) &&\n                    !checkSide(side, pos, start, start + next.length))\n                    continue;\n                if (next instanceof TreeBuffer) {\n                    if (mode & IterMode.ExcludeBuffers)\n                        continue;\n                    let index = next.findChild(0, next.buffer.length, dir, pos - start, side);\n                    if (index > -1)\n                        return new BufferNode(new BufferContext(parent, next, i, start), null, index);\n                }\n                else if ((mode & IterMode.IncludeAnonymous) || (!next.type.isAnonymous || hasChild(next))) {\n                    let mounted;\n                    if (!(mode & IterMode.IgnoreMounts) && (mounted = MountedTree.get(next)) && !mounted.overlay)\n                        return new TreeNode(mounted.tree, start, i, parent);\n                    let inner = new TreeNode(next, start, i, parent);\n                    return (mode & IterMode.IncludeAnonymous) || !inner.type.isAnonymous ? inner\n                        : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side, mode);\n                }\n            }\n            if ((mode & IterMode.IncludeAnonymous) || !parent.type.isAnonymous)\n                return null;\n            if (parent.index >= 0)\n                i = parent.index + dir;\n            else\n                i = dir < 0 ? -1 : parent._parent._tree.children.length;\n            parent = parent._parent;\n            if (!parent)\n                return null;\n        }\n    }\n    get firstChild() { return this.nextChild(0, 1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Side.Before */); }\n    prop(prop) { return this._tree.prop(prop); }\n    enter(pos, side, mode = 0) {\n        let mounted;\n        if (!(mode & IterMode.IgnoreOverlays) && (mounted = MountedTree.get(this._tree)) && mounted.overlay) {\n            let rPos = pos - this.from, enterBracketed = (mode & IterMode.EnterBracketed) && mounted.bracketed;\n            for (let { from, to } of mounted.overlay) {\n                if ((side > 0 || enterBracketed ? from <= rPos : from < rPos) &&\n                    (side < 0 || enterBracketed ? to >= rPos : to > rPos))\n                    return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);\n            }\n        }\n        return this.nextChild(0, 1, pos, side, mode);\n    }\n    nextSignificantParent() {\n        let val = this;\n        while (val.type.isAnonymous && val._parent)\n            val = val._parent;\n        return val;\n    }\n    get parent() {\n        return this._parent ? this._parent.nextSignificantParent() : null;\n    }\n    get nextSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index + 1, 1, 0, 4 /* Side.DontCare */) : null;\n    }\n    get prevSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* Side.DontCare */) : null;\n    }\n    get tree() { return this._tree; }\n    toTree() { return this._tree; }\n    /**\n    @internal\n    */\n    toString() { return this._tree.toString(); }\n}\nfunction getChildren(node, type, before, after) {\n    let cur = node.cursor(), result = [];\n    if (!cur.firstChild())\n        return result;\n    if (before != null)\n        for (let found = false; !found;) {\n            found = cur.type.is(before);\n            if (!cur.nextSibling())\n                return result;\n        }\n    for (;;) {\n        if (after != null && cur.type.is(after))\n            return result;\n        if (cur.type.is(type))\n            result.push(cur.node);\n        if (!cur.nextSibling())\n            return after == null ? result : [];\n    }\n}\nfunction matchNodeContext(node, context, i = context.length - 1) {\n    for (let p = node; i >= 0; p = p.parent) {\n        if (!p)\n            return false;\n        if (!p.type.isAnonymous) {\n            if (context[i] && context[i] != p.name)\n                return false;\n            i--;\n        }\n    }\n    return true;\n}\nclass BufferContext {\n    constructor(parent, buffer, index, start) {\n        this.parent = parent;\n        this.buffer = buffer;\n        this.index = index;\n        this.start = start;\n    }\n}\nclass BufferNode extends BaseNode {\n    get name() { return this.type.name; }\n    get from() { return this.context.start + this.context.buffer.buffer[this.index + 1]; }\n    get to() { return this.context.start + this.context.buffer.buffer[this.index + 2]; }\n    constructor(context, _parent, index) {\n        super();\n        this.context = context;\n        this._parent = _parent;\n        this.index = index;\n        this.type = context.buffer.set.types[context.buffer.buffer[index]];\n    }\n    child(dir, pos, side) {\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get firstChild() { return this.child(1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.child(-1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.child(1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.child(-1, pos, -2 /* Side.Before */); }\n    prop(prop) { return this.type.prop(prop); }\n    enter(pos, side, mode = 0) {\n        if (mode & IterMode.ExcludeBuffers)\n            return null;\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get parent() {\n        return this._parent || this.context.parent.nextSignificantParent();\n    }\n    externalSibling(dir) {\n        return this._parent ? null : this.context.parent.nextChild(this.context.index + dir, dir, 0, 4 /* Side.DontCare */);\n    }\n    get nextSibling() {\n        let { buffer } = this.context;\n        let after = buffer.buffer[this.index + 3];\n        if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))\n            return new BufferNode(this.context, this._parent, after);\n        return this.externalSibling(1);\n    }\n    get prevSibling() {\n        let { buffer } = this.context;\n        let parentStart = this._parent ? this._parent.index + 4 : 0;\n        if (this.index == parentStart)\n            return this.externalSibling(-1);\n        return new BufferNode(this.context, this._parent, buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n    }\n    get tree() { return null; }\n    toTree() {\n        let children = [], positions = [];\n        let { buffer } = this.context;\n        let startI = this.index + 4, endI = buffer.buffer[this.index + 3];\n        if (endI > startI) {\n            let from = buffer.buffer[this.index + 1];\n            children.push(buffer.slice(startI, endI, from));\n            positions.push(0);\n        }\n        return new Tree(this.type, children, positions, this.to - this.from);\n    }\n    /**\n    @internal\n    */\n    toString() { return this.context.buffer.childString(this.index); }\n}\nfunction iterStack(heads) {\n    if (!heads.length)\n        return null;\n    let pick = 0, picked = heads[0];\n    for (let i = 1; i < heads.length; i++) {\n        let node = heads[i];\n        if (node.from > picked.from || node.to < picked.to) {\n            picked = node;\n            pick = i;\n        }\n    }\n    let next = picked instanceof TreeNode && picked.index < 0 ? null : picked.parent;\n    let newHeads = heads.slice();\n    if (next)\n        newHeads[pick] = next;\n    else\n        newHeads.splice(pick, 1);\n    return new StackIterator(newHeads, picked);\n}\nclass StackIterator {\n    constructor(heads, node) {\n        this.heads = heads;\n        this.node = node;\n    }\n    get next() { return iterStack(this.heads); }\n}\nfunction stackIterator(tree, pos, side) {\n    let inner = tree.resolveInner(pos, side), layers = null;\n    for (let scan = inner instanceof TreeNode ? inner : inner.context.parent; scan; scan = scan.parent) {\n        if (scan.index < 0) { // This is an overlay root\n            let parent = scan.parent;\n            (layers || (layers = [inner])).push(parent.resolve(pos, side));\n            scan = parent;\n        }\n        else {\n            let mount = MountedTree.get(scan.tree);\n            // Relevant overlay branching off\n            if (mount && mount.overlay && mount.overlay[0].from <= pos && mount.overlay[mount.overlay.length - 1].to >= pos) {\n                let root = new TreeNode(mount.tree, mount.overlay[0].from + scan.from, -1, scan);\n                (layers || (layers = [inner])).push(resolveNode(root, pos, side, false));\n            }\n        }\n    }\n    return layers ? iterStack(layers) : inner;\n}\n/**\nA tree cursor object focuses on a given node in a syntax tree, and\nallows you to move to adjacent nodes.\n*/\nclass TreeCursor {\n    /**\n    Shorthand for `.type.name`.\n    */\n    get name() { return this.type.name; }\n    /**\n    @internal\n    */\n    constructor(node, mode = 0) {\n        /**\n        @internal\n        */\n        this.buffer = null;\n        this.stack = [];\n        /**\n        @internal\n        */\n        this.index = 0;\n        this.bufferNode = null;\n        this.mode = mode & ~IterMode.EnterBracketed;\n        if (node instanceof TreeNode) {\n            this.yieldNode(node);\n        }\n        else {\n            this._tree = node.context.parent;\n            this.buffer = node.context;\n            for (let n = node._parent; n; n = n._parent)\n                this.stack.unshift(n.index);\n            this.bufferNode = node;\n            this.yieldBuf(node.index);\n        }\n    }\n    yieldNode(node) {\n        if (!node)\n            return false;\n        this._tree = node;\n        this.type = node.type;\n        this.from = node.from;\n        this.to = node.to;\n        return true;\n    }\n    yieldBuf(index, type) {\n        this.index = index;\n        let { start, buffer } = this.buffer;\n        this.type = type || buffer.set.types[buffer.buffer[index]];\n        this.from = start + buffer.buffer[index + 1];\n        this.to = start + buffer.buffer[index + 2];\n        return true;\n    }\n    /**\n    @internal\n    */\n    yield(node) {\n        if (!node)\n            return false;\n        if (node instanceof TreeNode) {\n            this.buffer = null;\n            return this.yieldNode(node);\n        }\n        this.buffer = node.context;\n        return this.yieldBuf(node.index, node.type);\n    }\n    /**\n    @internal\n    */\n    toString() {\n        return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();\n    }\n    /**\n    @internal\n    */\n    enterChild(dir, pos, side) {\n        if (!this.buffer)\n            return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));\n        let { buffer } = this.buffer;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);\n        if (index < 0)\n            return false;\n        this.stack.push(this.index);\n        return this.yieldBuf(index);\n    }\n    /**\n    Move the cursor to this node's first child. When this returns\n    false, the node has no child, and the cursor has not been moved.\n    */\n    firstChild() { return this.enterChild(1, 0, 4 /* Side.DontCare */); }\n    /**\n    Move the cursor to this node's last child.\n    */\n    lastChild() { return this.enterChild(-1, 0, 4 /* Side.DontCare */); }\n    /**\n    Move the cursor to the first child that ends after `pos`.\n    */\n    childAfter(pos) { return this.enterChild(1, pos, 2 /* Side.After */); }\n    /**\n    Move to the last child that starts before `pos`.\n    */\n    childBefore(pos) { return this.enterChild(-1, pos, -2 /* Side.Before */); }\n    /**\n    Move the cursor to the child around `pos`. If side is -1 the\n    child may end at that position, when 1 it may start there. This\n    will also enter [overlaid](#common.MountedTree.overlay)\n    [mounted](#common.NodeProp^mounted) trees unless `overlays` is\n    set to false.\n    */\n    enter(pos, side, mode = this.mode) {\n        if (!this.buffer)\n            return this.yield(this._tree.enter(pos, side, mode));\n        return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);\n    }\n    /**\n    Move to the node's parent node, if this isn't the top node.\n    */\n    parent() {\n        if (!this.buffer)\n            return this.yieldNode((this.mode & IterMode.IncludeAnonymous) ? this._tree._parent : this._tree.parent);\n        if (this.stack.length)\n            return this.yieldBuf(this.stack.pop());\n        let parent = (this.mode & IterMode.IncludeAnonymous) ? this.buffer.parent : this.buffer.parent.nextSignificantParent();\n        this.buffer = null;\n        return this.yieldNode(parent);\n    }\n    /**\n    @internal\n    */\n    sibling(dir) {\n        if (!this.buffer)\n            return !this._tree._parent ? false\n                : this.yield(this._tree.index < 0 ? null\n                    : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode));\n        let { buffer } = this.buffer, d = this.stack.length - 1;\n        if (dir < 0) {\n            let parentStart = d < 0 ? 0 : this.stack[d] + 4;\n            if (this.index != parentStart)\n                return this.yieldBuf(buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n        }\n        else {\n            let after = buffer.buffer[this.index + 3];\n            if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))\n                return this.yieldBuf(after);\n        }\n        return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode)) : false;\n    }\n    /**\n    Move to this node's next sibling, if any.\n    */\n    nextSibling() { return this.sibling(1); }\n    /**\n    Move to this node's previous sibling, if any.\n    */\n    prevSibling() { return this.sibling(-1); }\n    atLastNode(dir) {\n        let index, parent, { buffer } = this;\n        if (buffer) {\n            if (dir > 0) {\n                if (this.index < buffer.buffer.buffer.length)\n                    return false;\n            }\n            else {\n                for (let i = 0; i < this.index; i++)\n                    if (buffer.buffer.buffer[i + 3] < this.index)\n                        return false;\n            }\n            ({ index, parent } = buffer);\n        }\n        else {\n            ({ index, _parent: parent } = this._tree);\n        }\n        for (; parent; { index, _parent: parent } = parent) {\n            if (index > -1)\n                for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {\n                    let child = parent._tree.children[i];\n                    if ((this.mode & IterMode.IncludeAnonymous) ||\n                        child instanceof TreeBuffer ||\n                        !child.type.isAnonymous ||\n                        hasChild(child))\n                        return false;\n                }\n        }\n        return true;\n    }\n    move(dir, enter) {\n        if (enter && this.enterChild(dir, 0, 4 /* Side.DontCare */))\n            return true;\n        for (;;) {\n            if (this.sibling(dir))\n                return true;\n            if (this.atLastNode(dir) || !this.parent())\n                return false;\n        }\n    }\n    /**\n    Move to the next node in a\n    [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)\n    traversal, going from a node to its first child or, if the\n    current node is empty or `enter` is false, its next sibling or\n    the next sibling of the first parent node that has one.\n    */\n    next(enter = true) { return this.move(1, enter); }\n    /**\n    Move to the next node in a last-to-first pre-order traversal. A\n    node is followed by its last child or, if it has none, its\n    previous sibling or the previous sibling of the first parent\n    node that has one.\n    */\n    prev(enter = true) { return this.move(-1, enter); }\n    /**\n    Move the cursor to the innermost node that covers `pos`. If\n    `side` is -1, it will enter nodes that end at `pos`. If it is 1,\n    it will enter nodes that start at `pos`.\n    */\n    moveTo(pos, side = 0) {\n        // Move up to a node that actually holds the position, if possible\n        while (this.from == this.to ||\n            (side < 1 ? this.from >= pos : this.from > pos) ||\n            (side > -1 ? this.to <= pos : this.to < pos))\n            if (!this.parent())\n                break;\n        // Then scan down into child nodes as far as possible\n        while (this.enterChild(1, pos, side)) { }\n        return this;\n    }\n    /**\n    Get a [syntax node](#common.SyntaxNode) at the cursor's current\n    position.\n    */\n    get node() {\n        if (!this.buffer)\n            return this._tree;\n        let cache = this.bufferNode, result = null, depth = 0;\n        if (cache && cache.context == this.buffer) {\n            scan: for (let index = this.index, d = this.stack.length; d >= 0;) {\n                for (let c = cache; c; c = c._parent)\n                    if (c.index == index) {\n                        if (index == this.index)\n                            return c;\n                        result = c;\n                        depth = d + 1;\n                        break scan;\n                    }\n                index = this.stack[--d];\n            }\n        }\n        for (let i = depth; i < this.stack.length; i++)\n            result = new BufferNode(this.buffer, result, this.stack[i]);\n        return this.bufferNode = new BufferNode(this.buffer, result, this.index);\n    }\n    /**\n    Get the [tree](#common.Tree) that represents the current node, if\n    any. Will return null when the node is in a [tree\n    buffer](#common.TreeBuffer).\n    */\n    get tree() {\n        return this.buffer ? null : this._tree._tree;\n    }\n    /**\n    Iterate over the current node and all its descendants, calling\n    `enter` when entering a node and `leave`, if given, when leaving\n    one. When `enter` returns `false`, any children of that node are\n    skipped, and `leave` isn't called for it.\n    */\n    iterate(enter, leave) {\n        for (let depth = 0;;) {\n            let mustLeave = false;\n            if (this.type.isAnonymous || enter(this) !== false) {\n                if (this.firstChild()) {\n                    depth++;\n                    continue;\n                }\n                if (!this.type.isAnonymous)\n                    mustLeave = true;\n            }\n            for (;;) {\n                if (mustLeave && leave)\n                    leave(this);\n                mustLeave = this.type.isAnonymous;\n                if (!depth)\n                    return;\n                if (this.nextSibling())\n                    break;\n                this.parent();\n                depth--;\n                mustLeave = true;\n            }\n        }\n    }\n    /**\n    Test whether the current node matches a given context—a sequence\n    of direct parent node names. Empty strings in the context array\n    are treated as wildcards.\n    */\n    matchContext(context) {\n        if (!this.buffer)\n            return matchNodeContext(this.node.parent, context);\n        let { buffer } = this.buffer, { types } = buffer.set;\n        for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {\n            if (d < 0)\n                return matchNodeContext(this._tree, context, i);\n            let type = types[buffer.buffer[this.stack[d]]];\n            if (!type.isAnonymous) {\n                if (context[i] && context[i] != type.name)\n                    return false;\n                i--;\n            }\n        }\n        return true;\n    }\n}\nfunction hasChild(tree) {\n    return tree.children.some(ch => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));\n}\nfunction buildTree(data) {\n    var _a;\n    let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;\n    let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;\n    let types = nodeSet.types;\n    let contextHash = 0, lookAhead = 0;\n    function takeNode(parentStart, minPos, children, positions, inRepeat, depth) {\n        let { id, start, end, size } = cursor;\n        let lookAheadAtStart = lookAhead, contextAtStart = contextHash;\n        if (size < 0) {\n            cursor.next();\n            if (size == -1 /* SpecialRecord.Reuse */) {\n                let node = reused[id];\n                children.push(node);\n                positions.push(start - parentStart);\n                return;\n            }\n            else if (size == -3 /* SpecialRecord.ContextChange */) { // Context change\n                contextHash = id;\n                return;\n            }\n            else if (size == -4 /* SpecialRecord.LookAhead */) {\n                lookAhead = id;\n                return;\n            }\n            else {\n                throw new RangeError(`Unrecognized record size: ${size}`);\n            }\n        }\n        let type = types[id], node, buffer;\n        let startPos = start - parentStart;\n        if (end - start <= maxBufferLength && (buffer = findBufferSize(cursor.pos - minPos, inRepeat))) {\n            // Small enough for a buffer, and no reused nodes inside\n            let data = new Uint16Array(buffer.size - buffer.skip);\n            let endPos = cursor.pos - buffer.size, index = data.length;\n            while (cursor.pos > endPos)\n                index = copyToBuffer(buffer.start, data, index);\n            node = new TreeBuffer(data, end - buffer.start, nodeSet);\n            startPos = buffer.start - parentStart;\n        }\n        else { // Make it a node\n            let endPos = cursor.pos - size;\n            cursor.next();\n            let localChildren = [], localPositions = [];\n            let localInRepeat = id >= minRepeatType ? id : -1;\n            let lastGroup = 0, lastEnd = end;\n            while (cursor.pos > endPos) {\n                if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {\n                    if (cursor.end <= lastEnd - maxBufferLength) {\n                        makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart, contextAtStart);\n                        lastGroup = localChildren.length;\n                        lastEnd = cursor.end;\n                    }\n                    cursor.next();\n                }\n                else if (depth > 2500 /* CutOff.Depth */) {\n                    takeFlatNode(start, endPos, localChildren, localPositions);\n                }\n                else {\n                    takeNode(start, endPos, localChildren, localPositions, localInRepeat, depth + 1);\n                }\n            }\n            if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)\n                makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart, contextAtStart);\n            localChildren.reverse();\n            localPositions.reverse();\n            if (localInRepeat > -1 && lastGroup > 0) {\n                let make = makeBalanced(type, contextAtStart);\n                node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);\n            }\n            else {\n                node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end, contextAtStart);\n            }\n        }\n        children.push(node);\n        positions.push(startPos);\n    }\n    function takeFlatNode(parentStart, minPos, children, positions) {\n        let nodes = []; // Temporary, inverted array of leaf nodes found, with absolute positions\n        let nodeCount = 0, stopAt = -1;\n        while (cursor.pos > minPos) {\n            let { id, start, end, size } = cursor;\n            if (size > 4) { // Not a leaf\n                cursor.next();\n            }\n            else if (stopAt > -1 && start < stopAt) {\n                break;\n            }\n            else {\n                if (stopAt < 0)\n                    stopAt = end - maxBufferLength;\n                nodes.push(id, start, end);\n                nodeCount++;\n                cursor.next();\n            }\n        }\n        if (nodeCount) {\n            let buffer = new Uint16Array(nodeCount * 4);\n            let start = nodes[nodes.length - 2];\n            for (let i = nodes.length - 3, j = 0; i >= 0; i -= 3) {\n                buffer[j++] = nodes[i];\n                buffer[j++] = nodes[i + 1] - start;\n                buffer[j++] = nodes[i + 2] - start;\n                buffer[j++] = j;\n            }\n            children.push(new TreeBuffer(buffer, nodes[2] - start, nodeSet));\n            positions.push(start - parentStart);\n        }\n    }\n    function makeBalanced(type, contextHash) {\n        return (children, positions, length) => {\n            let lookAhead = 0, lastI = children.length - 1, last, lookAheadProp;\n            if (lastI >= 0 && (last = children[lastI]) instanceof Tree) {\n                if (!lastI && last.type == type && last.length == length)\n                    return last;\n                if (lookAheadProp = last.prop(NodeProp.lookAhead))\n                    lookAhead = positions[lastI] + last.length + lookAheadProp;\n            }\n            return makeTree(type, children, positions, length, lookAhead, contextHash);\n        };\n    }\n    function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead, contextHash) {\n        let localChildren = [], localPositions = [];\n        while (children.length > i) {\n            localChildren.push(children.pop());\n            localPositions.push(positions.pop() + base - from);\n        }\n        children.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead - to, contextHash));\n        positions.push(from - base);\n    }\n    function makeTree(type, children, positions, length, lookAhead, contextHash, props) {\n        if (contextHash) {\n            let pair = [NodeProp.contextHash, contextHash];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        if (lookAhead > 25) {\n            let pair = [NodeProp.lookAhead, lookAhead];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        return new Tree(type, children, positions, length, props);\n    }\n    function findBufferSize(maxSize, inRepeat) {\n        // Scan through the buffer to find previous siblings that fit\n        // together in a TreeBuffer, and don't contain any reused nodes\n        // (which can't be stored in a buffer).\n        // If `inRepeat` is > -1, ignore node boundaries of that type for\n        // nesting, but make sure the end falls either at the start\n        // (`maxSize`) or before such a node.\n        let fork = cursor.fork();\n        let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;\n        let result = { size: 0, start: 0, skip: 0 };\n        scan: for (let minPos = fork.pos - maxSize; fork.pos > minPos;) {\n            let nodeSize = fork.size;\n            // Pretend nested repeat nodes of the same type don't exist\n            if (fork.id == inRepeat && nodeSize >= 0) {\n                // Except that we store the current state as a valid return\n                // value.\n                result.size = size;\n                result.start = start;\n                result.skip = skip;\n                skip += 4;\n                size += 4;\n                fork.next();\n                continue;\n            }\n            let startPos = fork.pos - nodeSize;\n            if (nodeSize < 0 || startPos < minPos || fork.start < minStart)\n                break;\n            let localSkipped = fork.id >= minRepeatType ? 4 : 0;\n            let nodeStart = fork.start;\n            fork.next();\n            while (fork.pos > startPos) {\n                if (fork.size < 0) {\n                    if (fork.size == -3 /* SpecialRecord.ContextChange */ || fork.size == -4 /* SpecialRecord.LookAhead */)\n                        localSkipped += 4;\n                    else\n                        break scan;\n                }\n                else if (fork.id >= minRepeatType) {\n                    localSkipped += 4;\n                }\n                fork.next();\n            }\n            start = nodeStart;\n            size += nodeSize;\n            skip += localSkipped;\n        }\n        if (inRepeat < 0 || size == maxSize) {\n            result.size = size;\n            result.start = start;\n            result.skip = skip;\n        }\n        return result.size > 4 ? result : undefined;\n    }\n    function copyToBuffer(bufferStart, buffer, index) {\n        let { id, start, end, size } = cursor;\n        cursor.next();\n        if (size >= 0 && id < minRepeatType) {\n            let startIndex = index;\n            if (size > 4) {\n                let endPos = cursor.pos - (size - 4);\n                while (cursor.pos > endPos)\n                    index = copyToBuffer(bufferStart, buffer, index);\n            }\n            buffer[--index] = startIndex;\n            buffer[--index] = end - bufferStart;\n            buffer[--index] = start - bufferStart;\n            buffer[--index] = id;\n        }\n        else if (size == -3 /* SpecialRecord.ContextChange */) {\n            contextHash = id;\n        }\n        else if (size == -4 /* SpecialRecord.LookAhead */) {\n            lookAhead = id;\n        }\n        return index;\n    }\n    let children = [], positions = [];\n    while (cursor.pos > 0)\n        takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1, 0);\n    let length = (_a = data.length) !== null && _a !== void 0 ? _a : (children.length ? positions[0] + children[0].length : 0);\n    return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);\n}\nconst nodeSizeCache = new WeakMap;\nfunction nodeSize(balanceType, node) {\n    if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)\n        return 1;\n    let size = nodeSizeCache.get(node);\n    if (size == null) {\n        size = 1;\n        for (let child of node.children) {\n            if (child.type != balanceType || !(child instanceof Tree)) {\n                size = 1;\n                break;\n            }\n            size += nodeSize(balanceType, child);\n        }\n        nodeSizeCache.set(node, size);\n    }\n    return size;\n}\nfunction balanceRange(\n// The type the balanced tree's inner nodes.\nbalanceType, \n// The direct children and their positions\nchildren, positions, \n// The index range in children/positions to use\nfrom, to, \n// The start position of the nodes, relative to their parent.\nstart, \n// Length of the outer node\nlength, \n// Function to build the top node of the balanced tree\nmkTop, \n// Function to build internal nodes for the balanced tree\nmkTree) {\n    let total = 0;\n    for (let i = from; i < to; i++)\n        total += nodeSize(balanceType, children[i]);\n    let maxChild = Math.ceil((total * 1.5) / 8 /* Balance.BranchFactor */);\n    let localChildren = [], localPositions = [];\n    function divide(children, positions, from, to, offset) {\n        for (let i = from; i < to;) {\n            let groupFrom = i, groupStart = positions[i], groupSize = nodeSize(balanceType, children[i]);\n            i++;\n            for (; i < to; i++) {\n                let nextSize = nodeSize(balanceType, children[i]);\n                if (groupSize + nextSize >= maxChild)\n                    break;\n                groupSize += nextSize;\n            }\n            if (i == groupFrom + 1) {\n                if (groupSize > maxChild) {\n                    let only = children[groupFrom]; // Only trees can have a size > 1\n                    divide(only.children, only.positions, 0, only.children.length, positions[groupFrom] + offset);\n                    continue;\n                }\n                localChildren.push(children[groupFrom]);\n            }\n            else {\n                let length = positions[i - 1] + children[i - 1].length - groupStart;\n                localChildren.push(balanceRange(balanceType, children, positions, groupFrom, i, groupStart, length, null, mkTree));\n            }\n            localPositions.push(groupStart + offset - start);\n        }\n    }\n    divide(children, positions, from, to, 0);\n    return (mkTop || mkTree)(localChildren, localPositions, length);\n}\n/**\nProvides a way to associate values with pieces of trees. As long\nas that part of the tree is reused, the associated values can be\nretrieved from an updated tree.\n*/\nclass NodeWeakMap {\n    constructor() {\n        this.map = new WeakMap();\n    }\n    setBuffer(buffer, index, value) {\n        let inner = this.map.get(buffer);\n        if (!inner)\n            this.map.set(buffer, inner = new Map);\n        inner.set(index, value);\n    }\n    getBuffer(buffer, index) {\n        let inner = this.map.get(buffer);\n        return inner && inner.get(index);\n    }\n    /**\n    Set the value for this syntax node.\n    */\n    set(node, value) {\n        if (node instanceof BufferNode)\n            this.setBuffer(node.context.buffer, node.index, value);\n        else if (node instanceof TreeNode)\n            this.map.set(node.tree, value);\n    }\n    /**\n    Retrieve value for this syntax node, if it exists in the map.\n    */\n    get(node) {\n        return node instanceof BufferNode ? this.getBuffer(node.context.buffer, node.index)\n            : node instanceof TreeNode ? this.map.get(node.tree) : undefined;\n    }\n    /**\n    Set the value for the node that a cursor currently points to.\n    */\n    cursorSet(cursor, value) {\n        if (cursor.buffer)\n            this.setBuffer(cursor.buffer.buffer, cursor.index, value);\n        else\n            this.map.set(cursor.tree, value);\n    }\n    /**\n    Retrieve the value for the node that a cursor currently points\n    to.\n    */\n    cursorGet(cursor) {\n        return cursor.buffer ? this.getBuffer(cursor.buffer.buffer, cursor.index) : this.map.get(cursor.tree);\n    }\n}\n\n/**\nTree fragments are used during [incremental\nparsing](#common.Parser.startParse) to track parts of old trees\nthat can be reused in a new parse. An array of fragments is used\nto track regions of an old tree whose nodes might be reused in new\nparses. Use the static\n[`applyChanges`](#common.TreeFragment^applyChanges) method to\nupdate fragments for document changes.\n*/\nclass TreeFragment {\n    /**\n    Construct a tree fragment. You'll usually want to use\n    [`addTree`](#common.TreeFragment^addTree) and\n    [`applyChanges`](#common.TreeFragment^applyChanges) instead of\n    calling this directly.\n    */\n    constructor(\n    /**\n    The start of the unchanged range pointed to by this fragment.\n    This refers to an offset in the _updated_ document (as opposed\n    to the original tree).\n    */\n    from, \n    /**\n    The end of the unchanged range.\n    */\n    to, \n    /**\n    The tree that this fragment is based on.\n    */\n    tree, \n    /**\n    The offset between the fragment's tree and the document that\n    this fragment can be used against. Add this when going from\n    document to tree positions, subtract it to go from tree to\n    document positions.\n    */\n    offset, openStart = false, openEnd = false) {\n        this.from = from;\n        this.to = to;\n        this.tree = tree;\n        this.offset = offset;\n        this.open = (openStart ? 1 /* Open.Start */ : 0) | (openEnd ? 2 /* Open.End */ : 0);\n    }\n    /**\n    Whether the start of the fragment represents the start of a\n    parse, or the end of a change. (In the second case, it may not\n    be safe to reuse some nodes at the start, depending on the\n    parsing algorithm.)\n    */\n    get openStart() { return (this.open & 1 /* Open.Start */) > 0; }\n    /**\n    Whether the end of the fragment represents the end of a\n    full-document parse, or the start of a change.\n    */\n    get openEnd() { return (this.open & 2 /* Open.End */) > 0; }\n    /**\n    Create a set of fragments from a freshly parsed tree, or update\n    an existing set of fragments by replacing the ones that overlap\n    with a tree with content from the new tree. When `partial` is\n    true, the parse is treated as incomplete, and the resulting\n    fragment has [`openEnd`](#common.TreeFragment.openEnd) set to\n    true.\n    */\n    static addTree(tree, fragments = [], partial = false) {\n        let result = [new TreeFragment(0, tree.length, tree, 0, false, partial)];\n        for (let f of fragments)\n            if (f.to > tree.length)\n                result.push(f);\n        return result;\n    }\n    /**\n    Apply a set of edits to an array of fragments, removing or\n    splitting fragments as necessary to remove edited ranges, and\n    adjusting offsets for fragments that moved.\n    */\n    static applyChanges(fragments, changes, minGap = 128) {\n        if (!changes.length)\n            return fragments;\n        let result = [];\n        let fI = 1, nextF = fragments.length ? fragments[0] : null;\n        for (let cI = 0, pos = 0, off = 0;; cI++) {\n            let nextC = cI < changes.length ? changes[cI] : null;\n            let nextPos = nextC ? nextC.fromA : 1e9;\n            if (nextPos - pos >= minGap)\n                while (nextF && nextF.from < nextPos) {\n                    let cut = nextF;\n                    if (pos >= cut.from || nextPos <= cut.to || off) {\n                        let fFrom = Math.max(cut.from, pos) - off, fTo = Math.min(cut.to, nextPos) - off;\n                        cut = fFrom >= fTo ? null : new TreeFragment(fFrom, fTo, cut.tree, cut.offset + off, cI > 0, !!nextC);\n                    }\n                    if (cut)\n                        result.push(cut);\n                    if (nextF.to > nextPos)\n                        break;\n                    nextF = fI < fragments.length ? fragments[fI++] : null;\n                }\n            if (!nextC)\n                break;\n            pos = nextC.toA;\n            off = nextC.toA - nextC.toB;\n        }\n        return result;\n    }\n}\n/**\nA superclass that parsers should extend.\n*/\nclass Parser {\n    /**\n    Start a parse, returning a [partial parse](#common.PartialParse)\n    object. [`fragments`](#common.TreeFragment) can be passed in to\n    make the parse incremental.\n    \n    By default, the entire input is parsed. You can pass `ranges`,\n    which should be a sorted array of non-empty, non-overlapping\n    ranges, to parse only those ranges. The tree returned in that\n    case will start at `ranges[0].from`.\n    */\n    startParse(input, fragments, ranges) {\n        if (typeof input == \"string\")\n            input = new StringInput(input);\n        ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map(r => new Range(r.from, r.to)) : [new Range(0, 0)];\n        return this.createParse(input, fragments || [], ranges);\n    }\n    /**\n    Run a full parse, returning the resulting tree.\n    */\n    parse(input, fragments, ranges) {\n        let parse = this.startParse(input, fragments, ranges);\n        for (;;) {\n            let done = parse.advance();\n            if (done)\n                return done;\n        }\n    }\n}\nclass StringInput {\n    constructor(string) {\n        this.string = string;\n    }\n    get length() { return this.string.length; }\n    chunk(from) { return this.string.slice(from); }\n    get lineChunks() { return false; }\n    read(from, to) { return this.string.slice(from, to); }\n}\n\n/**\nCreate a parse wrapper that, after the inner parse completes,\nscans its tree for mixed language regions with the `nest`\nfunction, runs the resulting [inner parses](#common.NestedParse),\nand then [mounts](#common.NodeProp^mounted) their results onto the\ntree.\n*/\nfunction parseMixed(nest) {\n    return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges);\n}\nclass InnerParse {\n    constructor(parser, parse, overlay, bracketed, target, from) {\n        this.parser = parser;\n        this.parse = parse;\n        this.overlay = overlay;\n        this.bracketed = bracketed;\n        this.target = target;\n        this.from = from;\n    }\n}\nfunction checkRanges(ranges) {\n    if (!ranges.length || ranges.some(r => r.from >= r.to))\n        throw new RangeError(\"Invalid inner parse ranges given: \" + JSON.stringify(ranges));\n}\nclass ActiveOverlay {\n    constructor(parser, predicate, mounts, index, start, bracketed, target, prev) {\n        this.parser = parser;\n        this.predicate = predicate;\n        this.mounts = mounts;\n        this.index = index;\n        this.start = start;\n        this.bracketed = bracketed;\n        this.target = target;\n        this.prev = prev;\n        this.depth = 0;\n        this.ranges = [];\n    }\n}\nconst stoppedInner = new NodeProp({ perNode: true });\nclass MixedParse {\n    constructor(base, nest, input, fragments, ranges) {\n        this.nest = nest;\n        this.input = input;\n        this.fragments = fragments;\n        this.ranges = ranges;\n        this.inner = [];\n        this.innerDone = 0;\n        this.baseTree = null;\n        this.stoppedAt = null;\n        this.baseParse = base;\n    }\n    advance() {\n        if (this.baseParse) {\n            let done = this.baseParse.advance();\n            if (!done)\n                return null;\n            this.baseParse = null;\n            this.baseTree = done;\n            this.startInner();\n            if (this.stoppedAt != null)\n                for (let inner of this.inner)\n                    inner.parse.stopAt(this.stoppedAt);\n        }\n        if (this.innerDone == this.inner.length) {\n            let result = this.baseTree;\n            if (this.stoppedAt != null)\n                result = new Tree(result.type, result.children, result.positions, result.length, result.propValues.concat([[stoppedInner, this.stoppedAt]]));\n            return result;\n        }\n        let inner = this.inner[this.innerDone], done = inner.parse.advance();\n        if (done) {\n            this.innerDone++;\n            // This is a somewhat dodgy but super helpful hack where we\n            // patch up nodes created by the inner parse (and thus\n            // presumably not aliased anywhere else) to hold the information\n            // about the inner parse.\n            let props = Object.assign(Object.create(null), inner.target.props);\n            props[NodeProp.mounted.id] = new MountedTree(done, inner.overlay, inner.parser, inner.bracketed);\n            inner.target.props = props;\n        }\n        return null;\n    }\n    get parsedPos() {\n        if (this.baseParse)\n            return 0;\n        let pos = this.input.length;\n        for (let i = this.innerDone; i < this.inner.length; i++) {\n            if (this.inner[i].from < pos)\n                pos = Math.min(pos, this.inner[i].parse.parsedPos);\n        }\n        return pos;\n    }\n    stopAt(pos) {\n        this.stoppedAt = pos;\n        if (this.baseParse)\n            this.baseParse.stopAt(pos);\n        else\n            for (let i = this.innerDone; i < this.inner.length; i++)\n                this.inner[i].parse.stopAt(pos);\n    }\n    startInner() {\n        let fragmentCursor = new FragmentCursor(this.fragments);\n        let overlay = null;\n        let covered = null;\n        let cursor = new TreeCursor(new TreeNode(this.baseTree, this.ranges[0].from, 0, null), IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n        scan: for (let nest, isCovered;;) {\n            let enter = true, range;\n            if (this.stoppedAt != null && cursor.from >= this.stoppedAt) {\n                enter = false;\n            }\n            else if (fragmentCursor.hasNode(cursor)) {\n                if (overlay) {\n                    let match = overlay.mounts.find(m => m.frag.from <= cursor.from && m.frag.to >= cursor.to && m.mount.overlay);\n                    if (match)\n                        for (let r of match.mount.overlay) {\n                            let from = r.from + match.pos, to = r.to + match.pos;\n                            if (from >= cursor.from && to <= cursor.to && !overlay.ranges.some(r => r.from < to && r.to > from))\n                                overlay.ranges.push({ from, to });\n                        }\n                }\n                enter = false;\n            }\n            else if (covered && (isCovered = checkCover(covered.ranges, cursor.from, cursor.to))) {\n                enter = isCovered != 2 /* Cover.Full */;\n            }\n            else if (!cursor.type.isAnonymous && (nest = this.nest(cursor, this.input)) &&\n                (cursor.from < cursor.to || !nest.overlay)) {\n                if (!cursor.tree) {\n                    materialize(cursor);\n                    // materialize create one more level of nesting\n                    // we need to add depth to active overlay for going backwards\n                    if (overlay)\n                        overlay.depth++;\n                    if (covered)\n                        covered.depth++;\n                }\n                let oldMounts = fragmentCursor.findMounts(cursor.from, nest.parser);\n                if (typeof nest.overlay == \"function\") {\n                    overlay = new ActiveOverlay(nest.parser, nest.overlay, oldMounts, this.inner.length, cursor.from, !!nest.bracketed, cursor.tree, overlay);\n                }\n                else {\n                    let ranges = punchRanges(this.ranges, nest.overlay ||\n                        (cursor.from < cursor.to ? [new Range(cursor.from, cursor.to)] : []));\n                    if (ranges.length)\n                        checkRanges(ranges);\n                    if (ranges.length || !nest.overlay)\n                        this.inner.push(new InnerParse(nest.parser, ranges.length ? nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges)\n                            : nest.parser.startParse(\"\"), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, !!nest.bracketed, cursor.tree, ranges.length ? ranges[0].from : cursor.from));\n                    if (!nest.overlay)\n                        enter = false;\n                    else if (ranges.length)\n                        covered = { ranges, depth: 0, prev: covered };\n                }\n            }\n            else if (overlay && (range = overlay.predicate(cursor))) {\n                if (range === true)\n                    range = new Range(cursor.from, cursor.to);\n                if (range.from < range.to) {\n                    let last = overlay.ranges.length - 1;\n                    if (last >= 0 && overlay.ranges[last].to == range.from)\n                        overlay.ranges[last] = { from: overlay.ranges[last].from, to: range.to };\n                    else\n                        overlay.ranges.push(range);\n                }\n            }\n            if (enter && cursor.firstChild()) {\n                if (overlay)\n                    overlay.depth++;\n                if (covered)\n                    covered.depth++;\n            }\n            else {\n                for (;;) {\n                    if (cursor.nextSibling())\n                        break;\n                    if (!cursor.parent())\n                        break scan;\n                    if (overlay && !--overlay.depth) {\n                        let ranges = punchRanges(this.ranges, overlay.ranges);\n                        if (ranges.length) {\n                            checkRanges(ranges);\n                            this.inner.splice(overlay.index, 0, new InnerParse(overlay.parser, overlay.parser.startParse(this.input, enterFragments(overlay.mounts, ranges), ranges), overlay.ranges.map(r => new Range(r.from - overlay.start, r.to - overlay.start)), overlay.bracketed, overlay.target, ranges[0].from));\n                        }\n                        overlay = overlay.prev;\n                    }\n                    if (covered && !--covered.depth)\n                        covered = covered.prev;\n                }\n            }\n        }\n    }\n}\nfunction checkCover(covered, from, to) {\n    for (let range of covered) {\n        if (range.from >= to)\n            break;\n        if (range.to > from)\n            return range.from <= from && range.to >= to ? 2 /* Cover.Full */ : 1 /* Cover.Partial */;\n    }\n    return 0 /* Cover.None */;\n}\n// Take a piece of buffer and convert it into a stand-alone\n// TreeBuffer.\nfunction sliceBuf(buf, startI, endI, nodes, positions, off) {\n    if (startI < endI) {\n        let from = buf.buffer[startI + 1];\n        nodes.push(buf.slice(startI, endI, from));\n        positions.push(from - off);\n    }\n}\n// This function takes a node that's in a buffer, and converts it, and\n// its parent buffer nodes, into a Tree. This is again acting on the\n// assumption that the trees and buffers have been constructed by the\n// parse that was ran via the mix parser, and thus aren't shared with\n// any other code, making violations of the immutability safe.\nfunction materialize(cursor) {\n    let { node } = cursor, stack = [];\n    let buffer = node.context.buffer;\n    // Scan up to the nearest tree\n    do {\n        stack.push(cursor.index);\n        cursor.parent();\n    } while (!cursor.tree);\n    // Find the index of the buffer in that tree\n    let base = cursor.tree, i = base.children.indexOf(buffer);\n    let buf = base.children[i], b = buf.buffer, newStack = [i];\n    // Split a level in the buffer, putting the nodes before and after\n    // the child that contains `node` into new buffers.\n    function split(startI, endI, type, innerOffset, length, stackPos) {\n        let targetI = stack[stackPos];\n        let children = [], positions = [];\n        sliceBuf(buf, startI, targetI, children, positions, innerOffset);\n        let from = b[targetI + 1], to = b[targetI + 2];\n        newStack.push(children.length);\n        let child = stackPos\n            ? split(targetI + 4, b[targetI + 3], buf.set.types[b[targetI]], from, to - from, stackPos - 1)\n            : node.toTree();\n        children.push(child);\n        positions.push(from - innerOffset);\n        sliceBuf(buf, b[targetI + 3], endI, children, positions, innerOffset);\n        return new Tree(type, children, positions, length);\n    }\n    base.children[i] = split(0, b.length, NodeType.none, 0, buf.length, stack.length - 1);\n    // Move the cursor back to the target node\n    for (let index of newStack) {\n        let tree = cursor.tree.children[index], pos = cursor.tree.positions[index];\n        cursor.yield(new TreeNode(tree, pos + cursor.from, index, cursor._tree));\n    }\n}\nclass StructureCursor {\n    constructor(root, offset) {\n        this.offset = offset;\n        this.done = false;\n        this.cursor = root.cursor(IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n    }\n    // Move to the first node (in pre-order) that starts at or after `pos`.\n    moveTo(pos) {\n        let { cursor } = this, p = pos - this.offset;\n        while (!this.done && cursor.from < p) {\n            if (cursor.to >= pos && cursor.enter(p, 1, IterMode.IgnoreOverlays | IterMode.ExcludeBuffers)) ;\n            else if (cursor.to <= pos) {\n                if (!cursor.next(false))\n                    this.done = true;\n                // Moved to next node\n            }\n            else {\n                break;\n            }\n        }\n    }\n    hasNode(cursor) {\n        this.moveTo(cursor.from);\n        if (!this.done && this.cursor.from + this.offset == cursor.from && this.cursor.tree) {\n            for (let tree = this.cursor.tree;;) {\n                if (tree == cursor.tree)\n                    return true;\n                if (tree.children.length && tree.positions[0] == 0 && tree.children[0] instanceof Tree)\n                    tree = tree.children[0];\n                else\n                    break;\n            }\n        }\n        return false;\n    }\n}\nclass FragmentCursor {\n    constructor(fragments) {\n        var _a;\n        this.fragments = fragments;\n        this.curTo = 0;\n        this.fragI = 0;\n        if (fragments.length) {\n            let first = this.curFrag = fragments[0];\n            this.curTo = (_a = first.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : first.to;\n            this.inner = new StructureCursor(first.tree, -first.offset);\n        }\n        else {\n            this.curFrag = this.inner = null;\n        }\n    }\n    hasNode(node) {\n        while (this.curFrag && node.from >= this.curTo)\n            this.nextFrag();\n        return this.curFrag && this.curFrag.from <= node.from && this.curTo >= node.to && this.inner.hasNode(node);\n    }\n    nextFrag() {\n        var _a;\n        this.fragI++;\n        if (this.fragI == this.fragments.length) {\n            this.curFrag = this.inner = null;\n        }\n        else {\n            let frag = this.curFrag = this.fragments[this.fragI];\n            this.curTo = (_a = frag.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : frag.to;\n            this.inner = new StructureCursor(frag.tree, -frag.offset);\n        }\n    }\n    findMounts(pos, parser) {\n        var _a;\n        let result = [];\n        if (this.inner) {\n            this.inner.cursor.moveTo(pos, 1);\n            for (let pos = this.inner.cursor.node; pos; pos = pos.parent) {\n                let mount = (_a = pos.tree) === null || _a === void 0 ? void 0 : _a.prop(NodeProp.mounted);\n                if (mount && mount.parser == parser) {\n                    for (let i = this.fragI; i < this.fragments.length; i++) {\n                        let frag = this.fragments[i];\n                        if (frag.from >= pos.to)\n                            break;\n                        if (frag.tree == this.curFrag.tree)\n                            result.push({\n                                frag,\n                                pos: pos.from - frag.offset,\n                                mount\n                            });\n                    }\n                }\n            }\n        }\n        return result;\n    }\n}\nfunction punchRanges(outer, ranges) {\n    let copy = null, current = ranges;\n    for (let i = 1, j = 0; i < outer.length; i++) {\n        let gapFrom = outer[i - 1].to, gapTo = outer[i].from;\n        for (; j < current.length; j++) {\n            let r = current[j];\n            if (r.from >= gapTo)\n                break;\n            if (r.to <= gapFrom)\n                continue;\n            if (!copy)\n                current = copy = ranges.slice();\n            if (r.from < gapFrom) {\n                copy[j] = new Range(r.from, gapFrom);\n                if (r.to > gapTo)\n                    copy.splice(j + 1, 0, new Range(gapTo, r.to));\n            }\n            else if (r.to > gapTo) {\n                copy[j--] = new Range(gapTo, r.to);\n            }\n            else {\n                copy.splice(j--, 1);\n            }\n        }\n    }\n    return current;\n}\nfunction findCoverChanges(a, b, from, to) {\n    let iA = 0, iB = 0, inA = false, inB = false, pos = -1e9;\n    let result = [];\n    for (;;) {\n        let nextA = iA == a.length ? 1e9 : inA ? a[iA].to : a[iA].from;\n        let nextB = iB == b.length ? 1e9 : inB ? b[iB].to : b[iB].from;\n        if (inA != inB) {\n            let start = Math.max(pos, from), end = Math.min(nextA, nextB, to);\n            if (start < end)\n                result.push(new Range(start, end));\n        }\n        pos = Math.min(nextA, nextB);\n        if (pos == 1e9)\n            break;\n        if (nextA == pos) {\n            if (!inA)\n                inA = true;\n            else {\n                inA = false;\n                iA++;\n            }\n        }\n        if (nextB == pos) {\n            if (!inB)\n                inB = true;\n            else {\n                inB = false;\n                iB++;\n            }\n        }\n    }\n    return result;\n}\n// Given a number of fragments for the outer tree, and a set of ranges\n// to parse, find fragments for inner trees mounted around those\n// ranges, if any.\nfunction enterFragments(mounts, ranges) {\n    let result = [];\n    for (let { pos, mount, frag } of mounts) {\n        let startPos = pos + (mount.overlay ? mount.overlay[0].from : 0), endPos = startPos + mount.tree.length;\n        let from = Math.max(frag.from, startPos), to = Math.min(frag.to, endPos);\n        if (mount.overlay) {\n            let overlay = mount.overlay.map(r => new Range(r.from + pos, r.to + pos));\n            let changes = findCoverChanges(ranges, overlay, from, to);\n            for (let i = 0, pos = from;; i++) {\n                let last = i == changes.length, end = last ? to : changes[i].from;\n                if (end > pos)\n                    result.push(new TreeFragment(pos, end, mount.tree, -startPos, frag.from >= pos || frag.openStart, frag.to <= end || frag.openEnd));\n                if (last)\n                    break;\n                pos = changes[i].to;\n            }\n        }\n        else {\n            result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos || frag.openStart, frag.to <= endPos || frag.openEnd));\n        }\n    }\n    return result;\n}\n\nexport { DefaultBufferLength, IterMode, MountedTree, NodeProp, NodeSet, NodeType, NodeWeakMap, Parser, Tree, TreeBuffer, TreeCursor, TreeFragment, parseMixed };\n"],"x_google_ignoreList":[0],"mappings":";;;;AAGA,IAAM,sBAAsB;AAC5B,IAAI,aAAa;AACjB,IAAM,QAAN,MAAY;CACR,YAAY,MAAM,IAAI;EAClB,KAAK,OAAO;EACZ,KAAK,KAAK;CACd;AACJ;;;;;;AAMA,IAAM,WAAN,MAAe;;;;CAIX,YAAY,SAAS,CAAC,GAAG;EACrB,KAAK,KAAK;EACV,KAAK,UAAU,CAAC,CAAC,OAAO;EACxB,KAAK,cAAc,OAAO,sBAAsB;GAC5C,MAAM,IAAI,MAAM,sDAAsD;EAC1E;EACA,KAAK,UAAU,OAAO,WAAW;CACrC;;;;;;;;;;CAUA,IAAI,OAAO;EACP,IAAI,KAAK,SACL,MAAM,IAAI,WAAW,wCAAwC;EACjE,IAAI,OAAO,SAAS,YAChB,QAAQ,SAAS,MAAM,KAAK;EAChC,QAAQ,SAAS;GACb,IAAI,SAAS,MAAM,IAAI;GACvB,OAAO,WAAW,KAAA,IAAY,OAAO,CAAC,MAAM,MAAM;EACtD;CACJ;AACJ;;;;;;;AAOA,SAAS,WAAW,IAAI,SAAS,EAAE,cAAa,QAAO,IAAI,MAAM,GAAG,EAAE,CAAC;;;;;;AAMvE,SAAS,WAAW,IAAI,SAAS,EAAE,cAAa,QAAO,IAAI,MAAM,GAAG,EAAE,CAAC;;;;;;AAMvE,SAAS,QAAQ,IAAI,SAAS,EAAE,cAAa,QAAO,IAAI,MAAM,GAAG,EAAE,CAAC;;;;;;;;;;;;AAYpE,SAAS,UAAU,IAAI,SAAS,EAAE,cAAa,UAAS;CAChD,IAAI,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,QACtD,MAAM,IAAI,WAAW,gCAAgC,KAAK;CAC9D,OAAO,SAAS;AACpB,EAAE,CAAC;;;;;;AAMP,SAAS,cAAc,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC;;;;;;;AAOrD,SAAS,YAAY,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC;;;;;;AAMnD,SAAS,UAAU,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC;;;;;;AAMjD,IAAM,cAAN,MAAkB;CACd,YAIA,MAUA,SAIA,QAMA,YAAY,OAAO;EACf,KAAK,OAAO;EACZ,KAAK,UAAU;EACf,KAAK,SAAS;EACd,KAAK,YAAY;CACrB;;;;CAIA,OAAO,IAAI,MAAM;EACb,OAAO,QAAQ,KAAK,SAAS,KAAK,MAAM,SAAS,QAAQ;CAC7D;AACJ;AACA,IAAM,UAAU,OAAO,OAAO,IAAI;;;;AAIlC,IAAM,WAAN,MAAM,SAAS;;;;CAIX,YAOA,MAIA,OAKA,IAIA,QAAQ,GAAG;EACP,KAAK,OAAO;EACZ,KAAK,QAAQ;EACb,KAAK,KAAK;EACV,KAAK,QAAQ;CACjB;;;;CAIA,OAAO,OAAO,MAAM;EAChB,IAAI,QAAQ,KAAK,SAAS,KAAK,MAAM,SAAS,OAAO,OAAO,IAAI,IAAI;EACpE,IAAI,SAAS,KAAK,MAAM,IAAuB,MAAM,KAAK,UAAU,IAA2B,MAC1F,KAAK,QAAQ,IAAyB,MAAM,KAAK,QAAQ,OAAO,IAA6B;EAClG,IAAI,OAAO,IAAI,SAAS,KAAK,QAAQ,IAAI,OAAO,KAAK,IAAI,KAAK;EAC9D,IAAI,KAAK,OACL,KAAK,IAAI,OAAO,KAAK,OAAO;GACxB,IAAI,CAAC,MAAM,QAAQ,GAAG,GAClB,MAAM,IAAI,IAAI;GAClB,IAAI,KAAK;IACL,IAAI,IAAI,GAAG,SACP,MAAM,IAAI,WAAW,4CAA4C;IACrE,MAAM,IAAI,GAAG,MAAM,IAAI;GAC3B;EACJ;EACJ,OAAO;CACX;;;;;CAKA,KAAK,MAAM;EAAE,OAAO,KAAK,MAAM,KAAK;CAAK;;;;CAIzC,IAAI,QAAQ;EAAE,QAAQ,KAAK,QAAQ,KAAwB;CAAG;;;;CAI9D,IAAI,YAAY;EAAE,QAAQ,KAAK,QAAQ,KAA4B;CAAG;;;;CAItE,IAAI,UAAU;EAAE,QAAQ,KAAK,QAAQ,KAA0B;CAAG;;;;;CAKlE,IAAI,cAAc;EAAE,QAAQ,KAAK,QAAQ,KAA8B;CAAG;;;;;CAK1E,GAAG,MAAM;EACL,IAAI,OAAO,QAAQ,UAAU;GACzB,IAAI,KAAK,QAAQ,MACb,OAAO;GACX,IAAI,QAAQ,KAAK,KAAK,SAAS,KAAK;GACpC,OAAO,QAAQ,MAAM,QAAQ,IAAI,IAAI,KAAK;EAC9C;EACA,OAAO,KAAK,MAAM;CACtB;;;;;;;;;CASA,OAAO,MAAM,KAAK;EACd,IAAI,SAAS,OAAO,OAAO,IAAI;EAC/B,KAAK,IAAI,QAAQ,KACb,KAAK,IAAI,QAAQ,KAAK,MAAM,GAAG,GAC3B,OAAO,QAAQ,IAAI;EAC3B,QAAQ,SAAS;GACb,KAAK,IAAI,SAAS,KAAK,KAAK,SAAS,KAAK,GAAG,IAAI,IAAI,KAAK,SAAS,OAAO,SAAS,IAAI,KAAK;IACxF,IAAI,QAAQ,OAAO,IAAI,IAAI,KAAK,OAAO,OAAO;IAC9C,IAAI,OACA,OAAO;GACf;EACJ;CACJ;AACJ;;;;AAIA,SAAS,OAAO,IAAI,SAAS,IAAI,OAAO,OAAO,IAAI,GAAG,GAAG,CAA0B;;;;;;;;;;AAUnF,IAAM,UAAN,MAAM,QAAQ;;;;;CAKV,YAIA,OAAO;EACH,KAAK,QAAQ;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAC9B,IAAI,MAAM,GAAG,MAAM,GACf,MAAM,IAAI,WAAW,6EAA6E;CAC9G;;;;;;CAMA,OAAO,GAAG,OAAO;EACb,IAAI,WAAW,CAAC;EAChB,KAAK,IAAI,QAAQ,KAAK,OAAO;GACzB,IAAI,WAAW;GACf,KAAK,IAAI,UAAU,OAAO;IACtB,IAAI,MAAM,OAAO,IAAI;IACrB,IAAI,KAAK;KACL,IAAI,CAAC,UACD,WAAW,OAAO,OAAO,CAAC,GAAG,KAAK,KAAK;KAC3C,IAAI,QAAQ,IAAI,IAAI,OAAO,IAAI;KAC/B,IAAI,KAAK,WAAW,KAAK,MAAM,UAC3B,QAAQ,KAAK,QAAQ,SAAS,KAAK,KAAK,KAAK;KACjD,SAAS,KAAK,MAAM;IACxB;GACJ;GACA,SAAS,KAAK,WAAW,IAAI,SAAS,KAAK,MAAM,UAAU,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI;EAC1F;EACA,OAAO,IAAI,QAAQ,QAAQ;CAC/B;AACJ;AACA,IAAM,6BAAa,IAAI,QAAQ,GAAG,kCAAkB,IAAI,QAAQ;;;;;AAKhE,IAAI;CACH,SAAU,UAAU;;;;;;CAMjB,SAAS,SAAS,oBAAoB,KAAK;;;;;;CAM3C,SAAS,SAAS,sBAAsB,KAAK;;;;;;CAM7C,SAAS,SAAS,kBAAkB,KAAK;;;;;;;CAOzC,SAAS,SAAS,oBAAoB,KAAK;;;;;;;CAO3C,SAAS,SAAS,oBAAoB,MAAM;AAChD,GAAG,aAAa,WAAW,CAAC,EAAE;;;;;;;;;;;;;;;;;AAiB9B,IAAM,OAAN,MAAM,KAAK;;;;CAIP,YAIA,MAIA,UAKA,WAIA,QAIA,OAAO;EACH,KAAK,OAAO;EACZ,KAAK,WAAW;EAChB,KAAK,YAAY;EACjB,KAAK,SAAS;;;;EAId,KAAK,QAAQ;EACb,IAAI,SAAS,MAAM,QAAQ;GACvB,KAAK,QAAQ,OAAO,OAAO,IAAI;GAC/B,KAAK,IAAI,CAAC,MAAM,UAAU,OACtB,KAAK,MAAM,OAAO,QAAQ,WAAW,OAAO,KAAK,MAAM;EAC/D;CACJ;;;;CAIA,WAAW;EACP,IAAI,UAAU,YAAY,IAAI,IAAI;EAClC,IAAI,WAAW,CAAC,QAAQ,SACpB,OAAO,QAAQ,KAAK,SAAS;EACjC,IAAI,WAAW;EACf,KAAK,IAAI,MAAM,KAAK,UAAU;GAC1B,IAAI,MAAM,GAAG,SAAS;GACtB,IAAI,KAAK;IACL,IAAI,UACA,YAAY;IAChB,YAAY;GAChB;EACJ;EACA,OAAO,CAAC,KAAK,KAAK,OAAO,YACpB,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,UAAU,KAAK,UAAU,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SACzF,SAAS,SAAS,MAAM,WAAW,MAAM;CACtD;;;;;;CAMA,OAAO,OAAO,GAAG;EACb,OAAO,IAAI,WAAW,KAAK,SAAS,IAAI;CAC5C;;;;;;CAMA,SAAS,KAAK,OAAO,GAAG,OAAO,GAAG;EAE9B,IAAI,SAAS,IAAI,WADL,WAAW,IAAI,IAAI,KAAK,KAAK,OACR;EACjC,OAAO,OAAO,KAAK,IAAI;EACvB,WAAW,IAAI,MAAM,OAAO,KAAK;EACjC,OAAO;CACX;;;;;CAKA,IAAI,UAAU;EACV,OAAO,IAAI,SAAS,MAAM,GAAG,GAAG,IAAI;CACxC;;;;;;;;;;;;CAYA,QAAQ,KAAK,OAAO,GAAG;EACnB,IAAI,OAAO,YAAY,WAAW,IAAI,IAAI,KAAK,KAAK,SAAS,KAAK,MAAM,KAAK;EAC7E,WAAW,IAAI,MAAM,IAAI;EACzB,OAAO;CACX;;;;;;;;CAQA,aAAa,KAAK,OAAO,GAAG;EACxB,IAAI,OAAO,YAAY,gBAAgB,IAAI,IAAI,KAAK,KAAK,SAAS,KAAK,MAAM,IAAI;EACjF,gBAAgB,IAAI,MAAM,IAAI;EAC9B,OAAO;CACX;;;;;;;;CAQA,aAAa,KAAK,OAAO,GAAG;EACxB,OAAO,cAAc,MAAM,KAAK,IAAI;CACxC;;;;;;;;CAQA,QAAQ,MAAM;EACV,IAAI,EAAE,OAAO,OAAO,OAAO,GAAG,KAAK,KAAK,WAAW;EACnD,IAAI,OAAO,KAAK,QAAQ,GAAG,QAAQ,OAAO,SAAS,oBAAoB;EACvE,KAAK,IAAI,IAAI,KAAK,OAAO,OAAO,SAAS,gBAAgB,KAAK;GAC1D,IAAI,UAAU;GACd,IAAI,EAAE,QAAQ,MAAM,EAAE,MAAM,SAAS,CAAC,QAAQ,EAAE,KAAK,eAAe,MAAM,CAAC,MAAM,QAAQ;IACrF,IAAI,EAAE,WAAW,GACb;IACJ,UAAU;GACd;GACA,SAAS;IACL,IAAI,WAAW,UAAU,QAAQ,CAAC,EAAE,KAAK,cACrC,MAAM,CAAC;IACX,IAAI,EAAE,YAAY,GACd;IACJ,IAAI,CAAC,EAAE,OAAO,GACV;IACJ,UAAU;GACd;EACJ;CACJ;;;;;CAKA,KAAK,MAAM;EACP,OAAO,CAAC,KAAK,UAAU,KAAK,KAAK,KAAK,IAAI,IAAI,KAAK,QAAQ,KAAK,MAAM,KAAK,MAAM,KAAA;CACrF;;;;;;CAMA,IAAI,aAAa;EACb,IAAI,SAAS,CAAC;EACd,IAAI,KAAK,OACL,KAAK,IAAI,MAAM,KAAK,OAChB,OAAO,KAAK,CAAC,CAAC,IAAI,KAAK,MAAM,GAAG,CAAC;EACzC,OAAO;CACX;;;;;;CAMA,QAAQ,SAAS,CAAC,GAAG;EACjB,OAAO,KAAK,SAAS,UAAU,IAA+B,OAC1D,aAAa,SAAS,MAAM,KAAK,UAAU,KAAK,WAAW,GAAG,KAAK,SAAS,QAAQ,GAAG,KAAK,SAAS,UAAU,WAAW,WAAW,IAAI,KAAK,KAAK,MAAM,UAAU,WAAW,QAAQ,KAAK,UAAU,GAAG,OAAO,cAAc,UAAU,WAAW,WAAW,IAAI,KAAK,SAAS,MAAM,UAAU,WAAW,MAAM,EAAE;CAC1T;;;;;CAKA,OAAO,MAAM,MAAM;EAAE,OAAO,UAAU,IAAI;CAAG;AACjD;;;;AAIA,KAAK,QAAQ,IAAI,KAAK,SAAS,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;AAC9C,IAAM,mBAAN,MAAM,iBAAiB;CACnB,YAAY,QAAQ,OAAO;EACvB,KAAK,SAAS;EACd,KAAK,QAAQ;CACjB;CACA,IAAI,KAAK;EAAE,OAAO,KAAK,OAAO,KAAK,QAAQ;CAAI;CAC/C,IAAI,QAAQ;EAAE,OAAO,KAAK,OAAO,KAAK,QAAQ;CAAI;CAClD,IAAI,MAAM;EAAE,OAAO,KAAK,OAAO,KAAK,QAAQ;CAAI;CAChD,IAAI,OAAO;EAAE,OAAO,KAAK,OAAO,KAAK,QAAQ;CAAI;CACjD,IAAI,MAAM;EAAE,OAAO,KAAK;CAAO;CAC/B,OAAO;EAAE,KAAK,SAAS;CAAG;CAC1B,OAAO;EAAE,OAAO,IAAI,iBAAiB,KAAK,QAAQ,KAAK,KAAK;CAAG;AACnE;;;;;;;AAOA,IAAM,aAAN,MAAM,WAAW;;;;CAIb,YAIA,QAIA,QAIA,KAAK;EACD,KAAK,SAAS;EACd,KAAK,SAAS;EACd,KAAK,MAAM;CACf;;;;CAIA,IAAI,OAAO;EAAE,OAAO,SAAS;CAAM;;;;CAInC,WAAW;EACP,IAAI,SAAS,CAAC;EACd,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,OAAO,SAAS;GAC7C,OAAO,KAAK,KAAK,YAAY,KAAK,CAAC;GACnC,QAAQ,KAAK,OAAO,QAAQ;EAChC;EACA,OAAO,OAAO,KAAK,GAAG;CAC1B;;;;CAIA,YAAY,OAAO;EACf,IAAI,KAAK,KAAK,OAAO,QAAQ,WAAW,KAAK,OAAO,QAAQ;EAC5D,IAAI,OAAO,KAAK,IAAI,MAAM,KAAK,SAAS,KAAK;EAC7C,IAAI,KAAK,KAAK,MAAM,KAAK,CAAC,KAAK,SAC3B,SAAS,KAAK,UAAU,MAAM;EAClC,SAAS;EACT,IAAI,YAAY,OACZ,OAAO;EACX,IAAI,WAAW,CAAC;EAChB,OAAO,QAAQ,UAAU;GACrB,SAAS,KAAK,KAAK,YAAY,KAAK,CAAC;GACrC,QAAQ,KAAK,OAAO,QAAQ;EAChC;EACA,OAAO,SAAS,MAAM,SAAS,KAAK,GAAG,IAAI;CAC/C;;;;CAIA,UAAU,YAAY,UAAU,KAAK,KAAK,MAAM;EAC5C,IAAI,EAAE,WAAW,MAAM,OAAO;EAC9B,KAAK,IAAI,IAAI,YAAY,KAAK,UAAU,IAAI,OAAO,IAAI,IACnD,IAAI,UAAU,MAAM,KAAK,OAAO,IAAI,IAAI,OAAO,IAAI,EAAE,GAAG;GACpD,OAAO;GACP,IAAI,MAAM,GACN;EACR;EAEJ,OAAO;CACX;;;;CAIA,MAAM,QAAQ,MAAM,MAAM;EACtB,IAAI,IAAI,KAAK;EACb,IAAI,OAAO,IAAI,YAAY,OAAO,MAAM,GAAG,MAAM;EACjD,KAAK,IAAI,IAAI,QAAQ,IAAI,GAAG,IAAI,OAAO;GACnC,KAAK,OAAO,EAAE;GACd,KAAK,OAAO,EAAE,OAAO;GACrB,IAAI,KAAK,KAAK,OAAO,EAAE,OAAO;GAC9B,KAAK,OAAO,EAAE,OAAO;GACrB,MAAM,KAAK,IAAI,KAAK,EAAE;EAC1B;EACA,OAAO,IAAI,WAAW,MAAM,KAAK,KAAK,GAAG;CAC7C;AACJ;AACA,SAAS,UAAU,MAAM,KAAK,MAAM,IAAI;CACpC,QAAQ,MAAR;EACI,KAAK,IAAsB,OAAO,OAAO;EACzC,KAAK,IAA0B,OAAO,MAAM,OAAO,OAAO;EAC1D,KAAK,GAAqB,OAAO,OAAO,OAAO,KAAK;EACpD,KAAK,GAAwB,OAAO,QAAQ,OAAO,KAAK;EACxD,KAAK,GAAoB,OAAO,KAAK;EACrC,KAAK,GAAuB,OAAO;CACvC;AACJ;AACA,SAAS,YAAY,MAAM,KAAK,MAAM,UAAU;CAC5C,IAAI;CAEJ,OAAO,KAAK,QAAQ,KAAK,OACpB,OAAO,IAAI,KAAK,QAAQ,MAAM,KAAK,OAAO,SAC1C,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM;EAC9C,IAAI,SAAS,CAAC,YAAY,gBAAgB,YAAY,KAAK,QAAQ,IAAI,OAAO,KAAK;EACnF,IAAI,CAAC,QACD,OAAO;EACX,OAAO;CACX;CACA,IAAI,OAAO,WAAW,IAAI,SAAS;CAEnC,IAAI;OACK,IAAI,OAAO,MAAM,SAAS,KAAK,QAAQ,QAAQ,OAAO,QAAQ,SAAS,KAAK,QAC7E,IAAI,gBAAgB,YAAY,KAAK,QAAQ,OAAO,KAAK,OAAO,MAAM,KAAK,MAAM,IAAI,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,SAAS,KAAK,MAC1I,OAAO;CAAA;CAEnB,SAAS;EACL,IAAI,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI;EACtC,IAAI,CAAC,OACD,OAAO;EACX,OAAO;CACX;AACJ;AACA,IAAM,WAAN,MAAe;CACX,OAAO,OAAO,GAAG;EAAE,OAAO,IAAI,WAAW,MAAM,IAAI;CAAG;CACtD,SAAS,MAAM,SAAS,MAAM,QAAQ,MAAM;EACxC,IAAI,IAAI,YAAY,MAAM,MAAM,QAAQ,KAAK;EAC7C,OAAO,EAAE,SAAS,EAAE,KAAK;CAC7B;CACA,YAAY,MAAM,SAAS,MAAM,QAAQ,MAAM;EAC3C,OAAO,YAAY,MAAM,MAAM,QAAQ,KAAK;CAChD;CACA,QAAQ,KAAK,OAAO,GAAG;EACnB,OAAO,YAAY,MAAM,KAAK,MAAM,KAAK;CAC7C;CACA,aAAa,KAAK,OAAO,GAAG;EACxB,OAAO,YAAY,MAAM,KAAK,MAAM,IAAI;CAC5C;CACA,aAAa,SAAS;EAClB,OAAO,iBAAiB,KAAK,QAAQ,OAAO;CAChD;CACA,2BAA2B,KAAK;EAC5B,IAAI,OAAO,KAAK,YAAY,GAAG,GAAG,OAAO;EACzC,OAAO,MAAM;GACT,IAAI,OAAO,KAAK;GAChB,IAAI,CAAC,QAAQ,KAAK,MAAM,KAAK,IACzB;GACJ,IAAI,KAAK,KAAK,WAAW,KAAK,QAAQ,KAAK,IAAI;IAC3C,OAAO;IACP,OAAO,KAAK;GAChB,OAEI,OAAO;EAEf;EACA,OAAO;CACX;CACA,IAAI,OAAO;EAAE,OAAO;CAAM;CAC1B,IAAI,OAAO;EAAE,OAAO,KAAK;CAAQ;AACrC;AACA,IAAM,WAAN,MAAM,iBAAiB,SAAS;CAC5B,YAAY,OAAO,MAEnB,OAAO,SAAS;EACZ,MAAM;EACN,KAAK,QAAQ;EACb,KAAK,OAAO;EACZ,KAAK,QAAQ;EACb,KAAK,UAAU;CACnB;CACA,IAAI,OAAO;EAAE,OAAO,KAAK,MAAM;CAAM;CACrC,IAAI,OAAO;EAAE,OAAO,KAAK,MAAM,KAAK;CAAM;CAC1C,IAAI,KAAK;EAAE,OAAO,KAAK,OAAO,KAAK,MAAM;CAAQ;CACjD,UAAU,GAAG,KAAK,KAAK,MAAM,OAAO,GAAG;EACnC,KAAK,IAAI,SAAS,QAAQ;GACtB,KAAK,IAAI,EAAE,UAAU,cAAc,OAAO,OAAO,IAAI,MAAM,IAAI,SAAS,SAAS,IAAI,KAAK,GAAG,KAAK,KAAK;IACnG,IAAI,OAAO,SAAS,IAAI,QAAQ,UAAU,KAAK,OAAO,MAAM;IAC5D,IAAI,EAAG,OAAO,SAAS,kBAAmB,gBAAgB,SACrD,UAAU,YAAY,IAAI,IAAI,MAAM,CAAC,QAAQ,WAAW,QAAQ,aACjE,OAAO,SAAS,OAAO,QAAQ,KAAK,WACpC,CAAC,UAAU,MAAM,KAAK,OAAO,QAAQ,KAAK,MAAM,GAChD;IACJ,IAAI,gBAAgB,YAAY;KAC5B,IAAI,OAAO,SAAS,gBAChB;KACJ,IAAI,QAAQ,KAAK,UAAU,GAAG,KAAK,OAAO,QAAQ,KAAK,MAAM,OAAO,IAAI;KACxE,IAAI,QAAQ,IACR,OAAO,IAAI,WAAW,IAAI,cAAc,QAAQ,MAAM,GAAG,KAAK,GAAG,MAAM,KAAK;IACpF,OACK,IAAK,OAAO,SAAS,oBAAsB,CAAC,KAAK,KAAK,eAAe,SAAS,IAAI,GAAI;KACvF,IAAI;KACJ,IAAI,EAAE,OAAO,SAAS,kBAAkB,UAAU,YAAY,IAAI,IAAI,MAAM,CAAC,QAAQ,SACjF,OAAO,IAAI,SAAS,QAAQ,MAAM,OAAO,GAAG,MAAM;KACtD,IAAI,QAAQ,IAAI,SAAS,MAAM,OAAO,GAAG,MAAM;KAC/C,OAAQ,OAAO,SAAS,oBAAqB,CAAC,MAAM,KAAK,cAAc,QACjE,MAAM,UAAU,MAAM,IAAI,KAAK,SAAS,SAAS,IAAI,GAAG,KAAK,KAAK,MAAM,IAAI;IACtF;GACJ;GACA,IAAK,OAAO,SAAS,oBAAqB,CAAC,OAAO,KAAK,aACnD,OAAO;GACX,IAAI,OAAO,SAAS,GAChB,IAAI,OAAO,QAAQ;QAEnB,IAAI,MAAM,IAAI,KAAK,OAAO,QAAQ,MAAM,SAAS;GACrD,SAAS,OAAO;GAChB,IAAI,CAAC,QACD,OAAO;EACf;CACJ;CACA,IAAI,aAAa;EAAE,OAAO,KAAK,UAAU,GAAG,GAAG,GAAG,CAAqB;CAAG;CAC1E,IAAI,YAAY;EAAE,OAAO,KAAK,UAAU,KAAK,MAAM,SAAS,SAAS,GAAG,IAAI,GAAG,CAAqB;CAAG;CACvG,WAAW,KAAK;EAAE,OAAO,KAAK,UAAU,GAAG,GAAG,KAAK,CAAkB;CAAG;CACxE,YAAY,KAAK;EAAE,OAAO,KAAK,UAAU,KAAK,MAAM,SAAS,SAAS,GAAG,IAAI,KAAK,EAAoB;CAAG;CACzG,KAAK,MAAM;EAAE,OAAO,KAAK,MAAM,KAAK,IAAI;CAAG;CAC3C,MAAM,KAAK,MAAM,OAAO,GAAG;EACvB,IAAI;EACJ,IAAI,EAAE,OAAO,SAAS,oBAAoB,UAAU,YAAY,IAAI,KAAK,KAAK,MAAM,QAAQ,SAAS;GACjG,IAAI,OAAO,MAAM,KAAK,MAAM,iBAAkB,OAAO,SAAS,kBAAmB,QAAQ;GACzF,KAAK,IAAI,EAAE,MAAM,QAAQ,QAAQ,SAC7B,KAAK,OAAO,KAAK,iBAAiB,QAAQ,OAAO,OAAO,UACnD,OAAO,KAAK,iBAAiB,MAAM,OAAO,KAAK,OAChD,OAAO,IAAI,SAAS,QAAQ,MAAM,QAAQ,QAAQ,GAAG,OAAO,KAAK,MAAM,IAAI,IAAI;EAE3F;EACA,OAAO,KAAK,UAAU,GAAG,GAAG,KAAK,MAAM,IAAI;CAC/C;CACA,wBAAwB;EACpB,IAAI,MAAM;EACV,OAAO,IAAI,KAAK,eAAe,IAAI,SAC/B,MAAM,IAAI;EACd,OAAO;CACX;CACA,IAAI,SAAS;EACT,OAAO,KAAK,UAAU,KAAK,QAAQ,sBAAsB,IAAI;CACjE;CACA,IAAI,cAAc;EACd,OAAO,KAAK,WAAW,KAAK,SAAS,IAAI,KAAK,QAAQ,UAAU,KAAK,QAAQ,GAAG,GAAG,GAAG,CAAqB,IAAI;CACnH;CACA,IAAI,cAAc;EACd,OAAO,KAAK,WAAW,KAAK,SAAS,IAAI,KAAK,QAAQ,UAAU,KAAK,QAAQ,GAAG,IAAI,GAAG,CAAqB,IAAI;CACpH;CACA,IAAI,OAAO;EAAE,OAAO,KAAK;CAAO;CAChC,SAAS;EAAE,OAAO,KAAK;CAAO;;;;CAI9B,WAAW;EAAE,OAAO,KAAK,MAAM,SAAS;CAAG;AAC/C;AACA,SAAS,YAAY,MAAM,MAAM,QAAQ,OAAO;CAC5C,IAAI,MAAM,KAAK,OAAO,GAAG,SAAS,CAAC;CACnC,IAAI,CAAC,IAAI,WAAW,GAChB,OAAO;CACX,IAAI,UAAU,MACV,KAAK,IAAI,QAAQ,OAAO,CAAC,QAAQ;EAC7B,QAAQ,IAAI,KAAK,GAAG,MAAM;EAC1B,IAAI,CAAC,IAAI,YAAY,GACjB,OAAO;CACf;CACJ,SAAS;EACL,IAAI,SAAS,QAAQ,IAAI,KAAK,GAAG,KAAK,GAClC,OAAO;EACX,IAAI,IAAI,KAAK,GAAG,IAAI,GAChB,OAAO,KAAK,IAAI,IAAI;EACxB,IAAI,CAAC,IAAI,YAAY,GACjB,OAAO,SAAS,OAAO,SAAS,CAAC;CACzC;AACJ;AACA,SAAS,iBAAiB,MAAM,SAAS,IAAI,QAAQ,SAAS,GAAG;CAC7D,KAAK,IAAI,IAAI,MAAM,KAAK,GAAG,IAAI,EAAE,QAAQ;EACrC,IAAI,CAAC,GACD,OAAO;EACX,IAAI,CAAC,EAAE,KAAK,aAAa;GACrB,IAAI,QAAQ,MAAM,QAAQ,MAAM,EAAE,MAC9B,OAAO;GACX;EACJ;CACJ;CACA,OAAO;AACX;AACA,IAAM,gBAAN,MAAoB;CAChB,YAAY,QAAQ,QAAQ,OAAO,OAAO;EACtC,KAAK,SAAS;EACd,KAAK,SAAS;EACd,KAAK,QAAQ;EACb,KAAK,QAAQ;CACjB;AACJ;AACA,IAAM,aAAN,MAAM,mBAAmB,SAAS;CAC9B,IAAI,OAAO;EAAE,OAAO,KAAK,KAAK;CAAM;CACpC,IAAI,OAAO;EAAE,OAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,QAAQ;CAAI;CACrF,IAAI,KAAK;EAAE,OAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,QAAQ;CAAI;CACnF,YAAY,SAAS,SAAS,OAAO;EACjC,MAAM;EACN,KAAK,UAAU;EACf,KAAK,UAAU;EACf,KAAK,QAAQ;EACb,KAAK,OAAO,QAAQ,OAAO,IAAI,MAAM,QAAQ,OAAO,OAAO;CAC/D;CACA,MAAM,KAAK,KAAK,MAAM;EAClB,IAAI,EAAE,WAAW,KAAK;EACtB,IAAI,QAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,QAAQ,OAAO,IAAI;EAC/G,OAAO,QAAQ,IAAI,OAAO,IAAI,WAAW,KAAK,SAAS,MAAM,KAAK;CACtE;CACA,IAAI,aAAa;EAAE,OAAO,KAAK,MAAM,GAAG,GAAG,CAAqB;CAAG;CACnE,IAAI,YAAY;EAAE,OAAO,KAAK,MAAM,IAAI,GAAG,CAAqB;CAAG;CACnE,WAAW,KAAK;EAAE,OAAO,KAAK,MAAM,GAAG,KAAK,CAAkB;CAAG;CACjE,YAAY,KAAK;EAAE,OAAO,KAAK,MAAM,IAAI,KAAK,EAAoB;CAAG;CACrE,KAAK,MAAM;EAAE,OAAO,KAAK,KAAK,KAAK,IAAI;CAAG;CAC1C,MAAM,KAAK,MAAM,OAAO,GAAG;EACvB,IAAI,OAAO,SAAS,gBAChB,OAAO;EACX,IAAI,EAAE,WAAW,KAAK;EACtB,IAAI,QAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,IAAI,IAAI,IAAI,MAAM,KAAK,QAAQ,OAAO,IAAI;EAC7H,OAAO,QAAQ,IAAI,OAAO,IAAI,WAAW,KAAK,SAAS,MAAM,KAAK;CACtE;CACA,IAAI,SAAS;EACT,OAAO,KAAK,WAAW,KAAK,QAAQ,OAAO,sBAAsB;CACrE;CACA,gBAAgB,KAAK;EACjB,OAAO,KAAK,UAAU,OAAO,KAAK,QAAQ,OAAO,UAAU,KAAK,QAAQ,QAAQ,KAAK,KAAK,GAAG,CAAqB;CACtH;CACA,IAAI,cAAc;EACd,IAAI,EAAE,WAAW,KAAK;EACtB,IAAI,QAAQ,OAAO,OAAO,KAAK,QAAQ;EACvC,IAAI,SAAS,KAAK,UAAU,OAAO,OAAO,KAAK,QAAQ,QAAQ,KAAK,OAAO,OAAO,SAC9E,OAAO,IAAI,WAAW,KAAK,SAAS,KAAK,SAAS,KAAK;EAC3D,OAAO,KAAK,gBAAgB,CAAC;CACjC;CACA,IAAI,cAAc;EACd,IAAI,EAAE,WAAW,KAAK;EACtB,IAAI,cAAc,KAAK,UAAU,KAAK,QAAQ,QAAQ,IAAI;EAC1D,IAAI,KAAK,SAAS,aACd,OAAO,KAAK,gBAAgB,EAAE;EAClC,OAAO,IAAI,WAAW,KAAK,SAAS,KAAK,SAAS,OAAO,UAAU,aAAa,KAAK,OAAO,IAAI,GAAG,CAAqB,CAAC;CAC7H;CACA,IAAI,OAAO;EAAE,OAAO;CAAM;CAC1B,SAAS;EACL,IAAI,WAAW,CAAC,GAAG,YAAY,CAAC;EAChC,IAAI,EAAE,WAAW,KAAK;EACtB,IAAI,SAAS,KAAK,QAAQ,GAAG,OAAO,OAAO,OAAO,KAAK,QAAQ;EAC/D,IAAI,OAAO,QAAQ;GACf,IAAI,OAAO,OAAO,OAAO,KAAK,QAAQ;GACtC,SAAS,KAAK,OAAO,MAAM,QAAQ,MAAM,IAAI,CAAC;GAC9C,UAAU,KAAK,CAAC;EACpB;EACA,OAAO,IAAI,KAAK,KAAK,MAAM,UAAU,WAAW,KAAK,KAAK,KAAK,IAAI;CACvE;;;;CAIA,WAAW;EAAE,OAAO,KAAK,QAAQ,OAAO,YAAY,KAAK,KAAK;CAAG;AACrE;AACA,SAAS,UAAU,OAAO;CACtB,IAAI,CAAC,MAAM,QACP,OAAO;CACX,IAAI,OAAO,GAAG,SAAS,MAAM;CAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACnC,IAAI,OAAO,MAAM;EACjB,IAAI,KAAK,OAAO,OAAO,QAAQ,KAAK,KAAK,OAAO,IAAI;GAChD,SAAS;GACT,OAAO;EACX;CACJ;CACA,IAAI,OAAO,kBAAkB,YAAY,OAAO,QAAQ,IAAI,OAAO,OAAO;CAC1E,IAAI,WAAW,MAAM,MAAM;CAC3B,IAAI,MACA,SAAS,QAAQ;MAEjB,SAAS,OAAO,MAAM,CAAC;CAC3B,OAAO,IAAI,cAAc,UAAU,MAAM;AAC7C;AACA,IAAM,gBAAN,MAAoB;CAChB,YAAY,OAAO,MAAM;EACrB,KAAK,QAAQ;EACb,KAAK,OAAO;CAChB;CACA,IAAI,OAAO;EAAE,OAAO,UAAU,KAAK,KAAK;CAAG;AAC/C;AACA,SAAS,cAAc,MAAM,KAAK,MAAM;CACpC,IAAI,QAAQ,KAAK,aAAa,KAAK,IAAI,GAAG,SAAS;CACnD,KAAK,IAAI,OAAO,iBAAiB,WAAW,QAAQ,MAAM,QAAQ,QAAQ,MAAM,OAAO,KAAK,QACxF,IAAI,KAAK,QAAQ,GAAG;EAChB,IAAI,SAAS,KAAK;EAClB,CAAC,WAAW,SAAS,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,KAAK,IAAI,CAAC;EAC7D,OAAO;CACX,OACK;EACD,IAAI,QAAQ,YAAY,IAAI,KAAK,IAAI;EAErC,IAAI,SAAS,MAAM,WAAW,MAAM,QAAQ,GAAG,QAAQ,OAAO,MAAM,QAAQ,MAAM,QAAQ,SAAS,GAAG,MAAM,KAAK;GAC7G,IAAI,OAAO,IAAI,SAAS,MAAM,MAAM,MAAM,QAAQ,GAAG,OAAO,KAAK,MAAM,IAAI,IAAI;GAC/E,CAAC,WAAW,SAAS,CAAC,KAAK,IAAI,KAAK,YAAY,MAAM,KAAK,MAAM,KAAK,CAAC;EAC3E;CACJ;CAEJ,OAAO,SAAS,UAAU,MAAM,IAAI;AACxC;;;;;AAKA,IAAM,aAAN,MAAiB;;;;CAIb,IAAI,OAAO;EAAE,OAAO,KAAK,KAAK;CAAM;;;;CAIpC,YAAY,MAAM,OAAO,GAAG;;;;EAIxB,KAAK,SAAS;EACd,KAAK,QAAQ,CAAC;;;;EAId,KAAK,QAAQ;EACb,KAAK,aAAa;EAClB,KAAK,OAAO,OAAO,CAAC,SAAS;EAC7B,IAAI,gBAAgB,UAChB,KAAK,UAAU,IAAI;OAElB;GACD,KAAK,QAAQ,KAAK,QAAQ;GAC1B,KAAK,SAAS,KAAK;GACnB,KAAK,IAAI,IAAI,KAAK,SAAS,GAAG,IAAI,EAAE,SAChC,KAAK,MAAM,QAAQ,EAAE,KAAK;GAC9B,KAAK,aAAa;GAClB,KAAK,SAAS,KAAK,KAAK;EAC5B;CACJ;CACA,UAAU,MAAM;EACZ,IAAI,CAAC,MACD,OAAO;EACX,KAAK,QAAQ;EACb,KAAK,OAAO,KAAK;EACjB,KAAK,OAAO,KAAK;EACjB,KAAK,KAAK,KAAK;EACf,OAAO;CACX;CACA,SAAS,OAAO,MAAM;EAClB,KAAK,QAAQ;EACb,IAAI,EAAE,OAAO,WAAW,KAAK;EAC7B,KAAK,OAAO,QAAQ,OAAO,IAAI,MAAM,OAAO,OAAO;EACnD,KAAK,OAAO,QAAQ,OAAO,OAAO,QAAQ;EAC1C,KAAK,KAAK,QAAQ,OAAO,OAAO,QAAQ;EACxC,OAAO;CACX;;;;CAIA,MAAM,MAAM;EACR,IAAI,CAAC,MACD,OAAO;EACX,IAAI,gBAAgB,UAAU;GAC1B,KAAK,SAAS;GACd,OAAO,KAAK,UAAU,IAAI;EAC9B;EACA,KAAK,SAAS,KAAK;EACnB,OAAO,KAAK,SAAS,KAAK,OAAO,KAAK,IAAI;CAC9C;;;;CAIA,WAAW;EACP,OAAO,KAAK,SAAS,KAAK,OAAO,OAAO,YAAY,KAAK,KAAK,IAAI,KAAK,MAAM,SAAS;CAC1F;;;;CAIA,WAAW,KAAK,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,QACN,OAAO,KAAK,MAAM,KAAK,MAAM,UAAU,MAAM,IAAI,KAAK,MAAM,MAAM,SAAS,SAAS,IAAI,GAAG,KAAK,KAAK,MAAM,KAAK,IAAI,CAAC;EACzH,IAAI,EAAE,WAAW,KAAK;EACtB,IAAI,QAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,OAAO,OAAO,IAAI;EAC9G,IAAI,QAAQ,GACR,OAAO;EACX,KAAK,MAAM,KAAK,KAAK,KAAK;EAC1B,OAAO,KAAK,SAAS,KAAK;CAC9B;;;;;CAKA,aAAa;EAAE,OAAO,KAAK,WAAW,GAAG,GAAG,CAAqB;CAAG;;;;CAIpE,YAAY;EAAE,OAAO,KAAK,WAAW,IAAI,GAAG,CAAqB;CAAG;;;;CAIpE,WAAW,KAAK;EAAE,OAAO,KAAK,WAAW,GAAG,KAAK,CAAkB;CAAG;;;;CAItE,YAAY,KAAK;EAAE,OAAO,KAAK,WAAW,IAAI,KAAK,EAAoB;CAAG;;;;;;;;CAQ1E,MAAM,KAAK,MAAM,OAAO,KAAK,MAAM;EAC/B,IAAI,CAAC,KAAK,QACN,OAAO,KAAK,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI,CAAC;EACvD,OAAO,OAAO,SAAS,iBAAiB,QAAQ,KAAK,WAAW,GAAG,KAAK,IAAI;CAChF;;;;CAIA,SAAS;EACL,IAAI,CAAC,KAAK,QACN,OAAO,KAAK,UAAW,KAAK,OAAO,SAAS,mBAAoB,KAAK,MAAM,UAAU,KAAK,MAAM,MAAM;EAC1G,IAAI,KAAK,MAAM,QACX,OAAO,KAAK,SAAS,KAAK,MAAM,IAAI,CAAC;EACzC,IAAI,SAAU,KAAK,OAAO,SAAS,mBAAoB,KAAK,OAAO,SAAS,KAAK,OAAO,OAAO,sBAAsB;EACrH,KAAK,SAAS;EACd,OAAO,KAAK,UAAU,MAAM;CAChC;;;;CAIA,QAAQ,KAAK;EACT,IAAI,CAAC,KAAK,QACN,OAAO,CAAC,KAAK,MAAM,UAAU,QACvB,KAAK,MAAM,KAAK,MAAM,QAAQ,IAAI,OAC9B,KAAK,MAAM,QAAQ,UAAU,KAAK,MAAM,QAAQ,KAAK,KAAK,GAAG,GAAuB,KAAK,IAAI,CAAC;EAC5G,IAAI,EAAE,WAAW,KAAK,QAAQ,IAAI,KAAK,MAAM,SAAS;EACtD,IAAI,MAAM,GAAG;GACT,IAAI,cAAc,IAAI,IAAI,IAAI,KAAK,MAAM,KAAK;GAC9C,IAAI,KAAK,SAAS,aACd,OAAO,KAAK,SAAS,OAAO,UAAU,aAAa,KAAK,OAAO,IAAI,GAAG,CAAqB,CAAC;EACpG,OACK;GACD,IAAI,QAAQ,OAAO,OAAO,KAAK,QAAQ;GACvC,IAAI,SAAS,IAAI,IAAI,OAAO,OAAO,SAAS,OAAO,OAAO,KAAK,MAAM,KAAK,KACtE,OAAO,KAAK,SAAS,KAAK;EAClC;EACA,OAAO,IAAI,IAAI,KAAK,MAAM,KAAK,OAAO,OAAO,UAAU,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG,GAAuB,KAAK,IAAI,CAAC,IAAI;CACjI;;;;CAIA,cAAc;EAAE,OAAO,KAAK,QAAQ,CAAC;CAAG;;;;CAIxC,cAAc;EAAE,OAAO,KAAK,QAAQ,EAAE;CAAG;CACzC,WAAW,KAAK;EACZ,IAAI,OAAO,QAAQ,EAAE,WAAW;EAChC,IAAI,QAAQ;GACR,IAAI,MAAM;QACF,KAAK,QAAQ,OAAO,OAAO,OAAO,QAClC,OAAO;GAAA,OAGX,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAC5B,IAAI,OAAO,OAAO,OAAO,IAAI,KAAK,KAAK,OACnC,OAAO;GAEnB,CAAC,CAAE,OAAO,UAAW;EACzB,OAEI,CAAC,CAAE,OAAO,SAAS,UAAW,KAAK;EAEvC,OAAO,QAAQ,CAAE,OAAO,SAAS,UAAW,QACxC,IAAI,QAAQ,IACR,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,MAAM,IAAI,KAAK,OAAO,MAAM,SAAS,QAAQ,KAAK,GAAG,KAAK,KAAK;GACzF,IAAI,QAAQ,OAAO,MAAM,SAAS;GAClC,IAAK,KAAK,OAAO,SAAS,oBACtB,iBAAiB,cACjB,CAAC,MAAM,KAAK,eACZ,SAAS,KAAK,GACd,OAAO;EACf;EAER,OAAO;CACX;CACA,KAAK,KAAK,OAAO;EACb,IAAI,SAAS,KAAK,WAAW,KAAK,GAAG,CAAqB,GACtD,OAAO;EACX,SAAS;GACL,IAAI,KAAK,QAAQ,GAAG,GAChB,OAAO;GACX,IAAI,KAAK,WAAW,GAAG,KAAK,CAAC,KAAK,OAAO,GACrC,OAAO;EACf;CACJ;;;;;;;;CAQA,KAAK,QAAQ,MAAM;EAAE,OAAO,KAAK,KAAK,GAAG,KAAK;CAAG;;;;;;;CAOjD,KAAK,QAAQ,MAAM;EAAE,OAAO,KAAK,KAAK,IAAI,KAAK;CAAG;;;;;;CAMlD,OAAO,KAAK,OAAO,GAAG;EAElB,OAAO,KAAK,QAAQ,KAAK,OACpB,OAAO,IAAI,KAAK,QAAQ,MAAM,KAAK,OAAO,SAC1C,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MACxC,IAAI,CAAC,KAAK,OAAO,GACb;EAER,OAAO,KAAK,WAAW,GAAG,KAAK,IAAI;EACnC,OAAO;CACX;;;;;CAKA,IAAI,OAAO;EACP,IAAI,CAAC,KAAK,QACN,OAAO,KAAK;EAChB,IAAI,QAAQ,KAAK,YAAY,SAAS,MAAM,QAAQ;EACpD,IAAI,SAAS,MAAM,WAAW,KAAK,QAC/B,MAAM,KAAK,IAAI,QAAQ,KAAK,OAAO,IAAI,KAAK,MAAM,QAAQ,KAAK,IAAI;GAC/D,KAAK,IAAI,IAAI,OAAO,GAAG,IAAI,EAAE,SACzB,IAAI,EAAE,SAAS,OAAO;IAClB,IAAI,SAAS,KAAK,OACd,OAAO;IACX,SAAS;IACT,QAAQ,IAAI;IACZ,MAAM;GACV;GACJ,QAAQ,KAAK,MAAM,EAAE;EACzB;EAEJ,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,MAAM,QAAQ,KACvC,SAAS,IAAI,WAAW,KAAK,QAAQ,QAAQ,KAAK,MAAM,EAAE;EAC9D,OAAO,KAAK,aAAa,IAAI,WAAW,KAAK,QAAQ,QAAQ,KAAK,KAAK;CAC3E;;;;;;CAMA,IAAI,OAAO;EACP,OAAO,KAAK,SAAS,OAAO,KAAK,MAAM;CAC3C;;;;;;;CAOA,QAAQ,OAAO,OAAO;EAClB,KAAK,IAAI,QAAQ,KAAK;GAClB,IAAI,YAAY;GAChB,IAAI,KAAK,KAAK,eAAe,MAAM,IAAI,MAAM,OAAO;IAChD,IAAI,KAAK,WAAW,GAAG;KACnB;KACA;IACJ;IACA,IAAI,CAAC,KAAK,KAAK,aACX,YAAY;GACpB;GACA,SAAS;IACL,IAAI,aAAa,OACb,MAAM,IAAI;IACd,YAAY,KAAK,KAAK;IACtB,IAAI,CAAC,OACD;IACJ,IAAI,KAAK,YAAY,GACjB;IACJ,KAAK,OAAO;IACZ;IACA,YAAY;GAChB;EACJ;CACJ;;;;;;CAMA,aAAa,SAAS;EAClB,IAAI,CAAC,KAAK,QACN,OAAO,iBAAiB,KAAK,KAAK,QAAQ,OAAO;EACrD,IAAI,EAAE,WAAW,KAAK,QAAQ,EAAE,UAAU,OAAO;EACjD,KAAK,IAAI,IAAI,QAAQ,SAAS,GAAG,IAAI,KAAK,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;GACrE,IAAI,IAAI,GACJ,OAAO,iBAAiB,KAAK,OAAO,SAAS,CAAC;GAClD,IAAI,OAAO,MAAM,OAAO,OAAO,KAAK,MAAM;GAC1C,IAAI,CAAC,KAAK,aAAa;IACnB,IAAI,QAAQ,MAAM,QAAQ,MAAM,KAAK,MACjC,OAAO;IACX;GACJ;EACJ;EACA,OAAO;CACX;AACJ;AACA,SAAS,SAAS,MAAM;CACpB,OAAO,KAAK,SAAS,MAAK,OAAM,cAAc,cAAc,CAAC,GAAG,KAAK,eAAe,SAAS,EAAE,CAAC;AACpG;AACA,SAAS,UAAU,MAAM;CACrB,IAAI;CACJ,IAAI,EAAE,QAAQ,SAAS,kBAAkB,qBAAqB,SAAS,CAAC,GAAG,gBAAgB,QAAQ,MAAM,WAAW;CACpH,IAAI,SAAS,MAAM,QAAQ,MAAM,IAAI,IAAI,iBAAiB,QAAQ,OAAO,MAAM,IAAI;CACnF,IAAI,QAAQ,QAAQ;CACpB,IAAI,cAAc,GAAG,YAAY;CACjC,SAAS,SAAS,aAAa,QAAQ,UAAU,WAAW,UAAU,OAAO;EACzE,IAAI,EAAE,IAAI,OAAO,KAAK,SAAS;EAC/B,IAAI,mBAAmB,WAAW,iBAAiB;EACnD,IAAI,OAAO,GAAG;GACV,OAAO,KAAK;GACZ,IAAI,QAAQ,IAA8B;IACtC,IAAI,OAAO,OAAO;IAClB,SAAS,KAAK,IAAI;IAClB,UAAU,KAAK,QAAQ,WAAW;IAClC;GACJ,OACK,IAAI,QAAQ,IAAsC;IACnD,cAAc;IACd;GACJ,OACK,IAAI,QAAQ,IAAkC;IAC/C,YAAY;IACZ;GACJ,OAEI,MAAM,IAAI,WAAW,6BAA6B,MAAM;EAEhE;EACA,IAAI,OAAO,MAAM,KAAK,MAAM;EAC5B,IAAI,WAAW,QAAQ;EACvB,IAAI,MAAM,SAAS,oBAAoB,SAAS,eAAe,OAAO,MAAM,QAAQ,QAAQ,IAAI;GAE5F,IAAI,OAAO,IAAI,YAAY,OAAO,OAAO,OAAO,IAAI;GACpD,IAAI,SAAS,OAAO,MAAM,OAAO,MAAM,QAAQ,KAAK;GACpD,OAAO,OAAO,MAAM,QAChB,QAAQ,aAAa,OAAO,OAAO,MAAM,KAAK;GAClD,OAAO,IAAI,WAAW,MAAM,MAAM,OAAO,OAAO,OAAO;GACvD,WAAW,OAAO,QAAQ;EAC9B,OACK;GACD,IAAI,SAAS,OAAO,MAAM;GAC1B,OAAO,KAAK;GACZ,IAAI,gBAAgB,CAAC,GAAG,iBAAiB,CAAC;GAC1C,IAAI,gBAAgB,MAAM,gBAAgB,KAAK;GAC/C,IAAI,YAAY,GAAG,UAAU;GAC7B,OAAO,OAAO,MAAM,QAChB,IAAI,iBAAiB,KAAK,OAAO,MAAM,iBAAiB,OAAO,QAAQ,GAAG;IACtE,IAAI,OAAO,OAAO,UAAU,iBAAiB;KACzC,eAAe,eAAe,gBAAgB,OAAO,WAAW,OAAO,KAAK,SAAS,eAAe,kBAAkB,cAAc;KACpI,YAAY,cAAc;KAC1B,UAAU,OAAO;IACrB;IACA,OAAO,KAAK;GAChB,OACK,IAAI,QAAQ,MACb,aAAa,OAAO,QAAQ,eAAe,cAAc;QAGzD,SAAS,OAAO,QAAQ,eAAe,gBAAgB,eAAe,QAAQ,CAAC;GAGvF,IAAI,iBAAiB,KAAK,YAAY,KAAK,YAAY,cAAc,QACjE,eAAe,eAAe,gBAAgB,OAAO,WAAW,OAAO,SAAS,eAAe,kBAAkB,cAAc;GACnI,cAAc,QAAQ;GACtB,eAAe,QAAQ;GACvB,IAAI,gBAAgB,MAAM,YAAY,GAAG;IACrC,IAAI,OAAO,aAAa,MAAM,cAAc;IAC5C,OAAO,aAAa,MAAM,eAAe,gBAAgB,GAAG,cAAc,QAAQ,GAAG,MAAM,OAAO,MAAM,IAAI;GAChH,OAEI,OAAO,SAAS,MAAM,eAAe,gBAAgB,MAAM,OAAO,mBAAmB,KAAK,cAAc;EAEhH;EACA,SAAS,KAAK,IAAI;EAClB,UAAU,KAAK,QAAQ;CAC3B;CACA,SAAS,aAAa,aAAa,QAAQ,UAAU,WAAW;EAC5D,IAAI,QAAQ,CAAC;EACb,IAAI,YAAY,GAAG,SAAS;EAC5B,OAAO,OAAO,MAAM,QAAQ;GACxB,IAAI,EAAE,IAAI,OAAO,KAAK,SAAS;GAC/B,IAAI,OAAO,GACP,OAAO,KAAK;QAEX,IAAI,SAAS,MAAM,QAAQ,QAC5B;QAEC;IACD,IAAI,SAAS,GACT,SAAS,MAAM;IACnB,MAAM,KAAK,IAAI,OAAO,GAAG;IACzB;IACA,OAAO,KAAK;GAChB;EACJ;EACA,IAAI,WAAW;GACX,IAAI,SAAS,IAAI,YAAY,YAAY,CAAC;GAC1C,IAAI,QAAQ,MAAM,MAAM,SAAS;GACjC,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG;IAClD,OAAO,OAAO,MAAM;IACpB,OAAO,OAAO,MAAM,IAAI,KAAK;IAC7B,OAAO,OAAO,MAAM,IAAI,KAAK;IAC7B,OAAO,OAAO;GAClB;GACA,SAAS,KAAK,IAAI,WAAW,QAAQ,MAAM,KAAK,OAAO,OAAO,CAAC;GAC/D,UAAU,KAAK,QAAQ,WAAW;EACtC;CACJ;CACA,SAAS,aAAa,MAAM,aAAa;EACrC,QAAQ,UAAU,WAAW,WAAW;GACpC,IAAI,YAAY,GAAG,QAAQ,SAAS,SAAS,GAAG,MAAM;GACtD,IAAI,SAAS,MAAM,OAAO,SAAS,mBAAmB,MAAM;IACxD,IAAI,CAAC,SAAS,KAAK,QAAQ,QAAQ,KAAK,UAAU,QAC9C,OAAO;IACX,IAAI,gBAAgB,KAAK,KAAK,SAAS,SAAS,GAC5C,YAAY,UAAU,SAAS,KAAK,SAAS;GACrD;GACA,OAAO,SAAS,MAAM,UAAU,WAAW,QAAQ,WAAW,WAAW;EAC7E;CACJ;CACA,SAAS,eAAe,UAAU,WAAW,MAAM,GAAG,MAAM,IAAI,MAAM,WAAW,aAAa;EAC1F,IAAI,gBAAgB,CAAC,GAAG,iBAAiB,CAAC;EAC1C,OAAO,SAAS,SAAS,GAAG;GACxB,cAAc,KAAK,SAAS,IAAI,CAAC;GACjC,eAAe,KAAK,UAAU,IAAI,IAAI,OAAO,IAAI;EACrD;EACA,SAAS,KAAK,SAAS,QAAQ,MAAM,OAAO,eAAe,gBAAgB,KAAK,MAAM,YAAY,IAAI,WAAW,CAAC;EAClH,UAAU,KAAK,OAAO,IAAI;CAC9B;CACA,SAAS,SAAS,MAAM,UAAU,WAAW,QAAQ,WAAW,aAAa,OAAO;EAChF,IAAI,aAAa;GACb,IAAI,OAAO,CAAC,SAAS,aAAa,WAAW;GAC7C,QAAQ,QAAQ,CAAC,IAAI,EAAE,OAAO,KAAK,IAAI,CAAC,IAAI;EAChD;EACA,IAAI,YAAY,IAAI;GAChB,IAAI,OAAO,CAAC,SAAS,WAAW,SAAS;GACzC,QAAQ,QAAQ,CAAC,IAAI,EAAE,OAAO,KAAK,IAAI,CAAC,IAAI;EAChD;EACA,OAAO,IAAI,KAAK,MAAM,UAAU,WAAW,QAAQ,KAAK;CAC5D;CACA,SAAS,eAAe,SAAS,UAAU;EAOvC,IAAI,OAAO,OAAO,KAAK;EACvB,IAAI,OAAO,GAAG,QAAQ,GAAG,OAAO,GAAG,WAAW,KAAK,MAAM;EACzD,IAAI,SAAS;GAAE,MAAM;GAAG,OAAO;GAAG,MAAM;EAAE;EAC1C,MAAM,KAAK,IAAI,SAAS,KAAK,MAAM,SAAS,KAAK,MAAM,SAAS;GAC5D,IAAI,WAAW,KAAK;GAEpB,IAAI,KAAK,MAAM,YAAY,YAAY,GAAG;IAGtC,OAAO,OAAO;IACd,OAAO,QAAQ;IACf,OAAO,OAAO;IACd,QAAQ;IACR,QAAQ;IACR,KAAK,KAAK;IACV;GACJ;GACA,IAAI,WAAW,KAAK,MAAM;GAC1B,IAAI,WAAW,KAAK,WAAW,UAAU,KAAK,QAAQ,UAClD;GACJ,IAAI,eAAe,KAAK,MAAM,gBAAgB,IAAI;GAClD,IAAI,YAAY,KAAK;GACrB,KAAK,KAAK;GACV,OAAO,KAAK,MAAM,UAAU;IACxB,IAAI,KAAK,OAAO,GACZ,IAAI,KAAK,QAAQ,MAAwC,KAAK,QAAQ,IAClE,gBAAgB;SAEhB,MAAM;SAET,IAAI,KAAK,MAAM,eAChB,gBAAgB;IAEpB,KAAK,KAAK;GACd;GACA,QAAQ;GACR,QAAQ;GACR,QAAQ;EACZ;EACA,IAAI,WAAW,KAAK,QAAQ,SAAS;GACjC,OAAO,OAAO;GACd,OAAO,QAAQ;GACf,OAAO,OAAO;EAClB;EACA,OAAO,OAAO,OAAO,IAAI,SAAS,KAAA;CACtC;CACA,SAAS,aAAa,aAAa,QAAQ,OAAO;EAC9C,IAAI,EAAE,IAAI,OAAO,KAAK,SAAS;EAC/B,OAAO,KAAK;EACZ,IAAI,QAAQ,KAAK,KAAK,eAAe;GACjC,IAAI,aAAa;GACjB,IAAI,OAAO,GAAG;IACV,IAAI,SAAS,OAAO,OAAO,OAAO;IAClC,OAAO,OAAO,MAAM,QAChB,QAAQ,aAAa,aAAa,QAAQ,KAAK;GACvD;GACA,OAAO,EAAE,SAAS;GAClB,OAAO,EAAE,SAAS,MAAM;GACxB,OAAO,EAAE,SAAS,QAAQ;GAC1B,OAAO,EAAE,SAAS;EACtB,OACK,IAAI,QAAQ,IACb,cAAc;OAEb,IAAI,QAAQ,IACb,YAAY;EAEhB,OAAO;CACX;CACA,IAAI,WAAW,CAAC,GAAG,YAAY,CAAC;CAChC,OAAO,OAAO,MAAM,GAChB,SAAS,KAAK,SAAS,GAAG,KAAK,eAAe,GAAG,UAAU,WAAW,IAAI,CAAC;CAC/E,IAAI,UAAU,KAAK,KAAK,YAAY,QAAQ,OAAO,KAAK,IAAI,KAAM,SAAS,SAAS,UAAU,KAAK,SAAS,GAAG,SAAS;CACxH,OAAO,IAAI,KAAK,MAAM,KAAK,QAAQ,SAAS,QAAQ,GAAG,UAAU,QAAQ,GAAG,MAAM;AACtF;AACA,IAAM,gCAAgB,IAAI,QAAM;AAChC,SAAS,SAAS,aAAa,MAAM;CACjC,IAAI,CAAC,YAAY,eAAe,gBAAgB,cAAc,KAAK,QAAQ,aACvE,OAAO;CACX,IAAI,OAAO,cAAc,IAAI,IAAI;CACjC,IAAI,QAAQ,MAAM;EACd,OAAO;EACP,KAAK,IAAI,SAAS,KAAK,UAAU;GAC7B,IAAI,MAAM,QAAQ,eAAe,EAAE,iBAAiB,OAAO;IACvD,OAAO;IACP;GACJ;GACA,QAAQ,SAAS,aAAa,KAAK;EACvC;EACA,cAAc,IAAI,MAAM,IAAI;CAChC;CACA,OAAO;AACX;AACA,SAAS,aAET,aAEA,UAAU,WAEV,MAAM,IAEN,OAEA,QAEA,OAEA,QAAQ;CACJ,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,MAAM,IAAI,IAAI,KACvB,SAAS,SAAS,aAAa,SAAS,EAAE;CAC9C,IAAI,WAAW,KAAK,KAAM,QAAQ,MAAO,CAA4B;CACrE,IAAI,gBAAgB,CAAC,GAAG,iBAAiB,CAAC;CAC1C,SAAS,OAAO,UAAU,WAAW,MAAM,IAAI,QAAQ;EACnD,KAAK,IAAI,IAAI,MAAM,IAAI,KAAK;GACxB,IAAI,YAAY,GAAG,aAAa,UAAU,IAAI,YAAY,SAAS,aAAa,SAAS,EAAE;GAC3F;GACA,OAAO,IAAI,IAAI,KAAK;IAChB,IAAI,WAAW,SAAS,aAAa,SAAS,EAAE;IAChD,IAAI,YAAY,YAAY,UACxB;IACJ,aAAa;GACjB;GACA,IAAI,KAAK,YAAY,GAAG;IACpB,IAAI,YAAY,UAAU;KACtB,IAAI,OAAO,SAAS;KACpB,OAAO,KAAK,UAAU,KAAK,WAAW,GAAG,KAAK,SAAS,QAAQ,UAAU,aAAa,MAAM;KAC5F;IACJ;IACA,cAAc,KAAK,SAAS,UAAU;GAC1C,OACK;IACD,IAAI,SAAS,UAAU,IAAI,KAAK,SAAS,IAAI,GAAG,SAAS;IACzD,cAAc,KAAK,aAAa,aAAa,UAAU,WAAW,WAAW,GAAG,YAAY,QAAQ,MAAM,MAAM,CAAC;GACrH;GACA,eAAe,KAAK,aAAa,SAAS,KAAK;EACnD;CACJ;CACA,OAAO,UAAU,WAAW,MAAM,IAAI,CAAC;CACvC,QAAQ,SAAS,QAAQ,eAAe,gBAAgB,MAAM;AAClE;;;;AAkKA,IAAM,SAAN,MAAa;;;;;;;;;;;CAWT,WAAW,OAAO,WAAW,QAAQ;EACjC,IAAI,OAAO,SAAS,UAChB,QAAQ,IAAI,YAAY,KAAK;EACjC,SAAS,CAAC,SAAS,CAAC,IAAI,MAAM,GAAG,MAAM,MAAM,CAAC,IAAI,OAAO,SAAS,OAAO,KAAI,MAAK,IAAI,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC;EAC7H,OAAO,KAAK,YAAY,OAAO,aAAa,CAAC,GAAG,MAAM;CAC1D;;;;CAIA,MAAM,OAAO,WAAW,QAAQ;EAC5B,IAAI,QAAQ,KAAK,WAAW,OAAO,WAAW,MAAM;EACpD,SAAS;GACL,IAAI,OAAO,MAAM,QAAQ;GACzB,IAAI,MACA,OAAO;EACf;CACJ;AACJ;AACA,IAAM,cAAN,MAAkB;CACd,YAAY,QAAQ;EAChB,KAAK,SAAS;CAClB;CACA,IAAI,SAAS;EAAE,OAAO,KAAK,OAAO;CAAQ;CAC1C,MAAM,MAAM;EAAE,OAAO,KAAK,OAAO,MAAM,IAAI;CAAG;CAC9C,IAAI,aAAa;EAAE,OAAO;CAAO;CACjC,KAAK,MAAM,IAAI;EAAE,OAAO,KAAK,OAAO,MAAM,MAAM,EAAE;CAAG;AACzD;AAwCqB,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC"}