@graphty/graph-io 0.3.48 → 0.3.50

package/dist/chunks/importer-C6NVpCXp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"importer-C6NVpCXp.js","sources":["../../src/formats/graphml/tree.ts","../../src/formats/graphml/yfiles.ts","../../src/formats/graphml/exporter.ts","../../src/formats/graphml/styles-yfiles3.ts","../../src/formats/graphml/styles-plain.ts","../../src/formats/graphml/importer.ts"],"sourcesContent":["/**\n * Nested XML inside a GraphML `<data>` element (yFiles / yEd `y:ShapeNode`, `y:PolyLineEdge`,\n * ...) as a JSON tree, the value of a `json` column with `origin.namespace: \"yfiles\"` (design\n * section 8.5: structure preserved, not byte-exact). The shape follows the fast-xml-parser\n * convention graphty-element's parser already navigates: an element is an object whose\n * `@_<name>` keys are its attributes, whose `#text` key is its non-whitespace character data\n * when it also has attributes or children, and whose other keys are its child elements (an\n * array when a name repeats); an element with neither attributes nor children is its text\n * (an empty string for an empty element).\n *\n * The builder consumes the tokenizer events of one subtree; the writer produces the XML text of\n * a tree again, so a yFiles column re-exports as the same nested markup.\n */\n\nimport { GraphFormatError } from \"@graphty/graph-format\";\n\nimport { escapeXmlAttribute, escapeXmlText } from \"../../common/escape.js\";\nimport { isWhitespace, isXmlName } from \"../../common/xml.js\";\n\n/** The prefix of an attribute key in a tree object. */\nconst ATTRIBUTE_PREFIX = \"@_\";\n\n/** The key of an element's character data when it also has attributes or children. */\nconst TEXT_KEY = \"#text\";\n\n/** A tree object: attributes, text and child elements by name. */\ntype XmlTreeObject = Record<string, unknown>;\n\n/** A frame of the builder: one open element. */\ninterface Frame {\n    readonly name: string;\n    readonly node: XmlTreeObject;\n    hasAttrs: boolean;\n    hasChildren: boolean;\n    text: string;\n}\n\n/**\n * Builds the tree of one subtree from start / end / text events. The outermost frame is the\n * `<data>` element itself; `finish()` returns its content: the object of its children, or its\n * text when it has none.\n * @category Plugin helpers\n */\nexport class XmlTreeBuilder {\n    private readonly frames: Frame[] = [];\n\n    private readonly root: Frame;\n\n    /** Create a builder whose implicit root is the containing element. */\n    constructor() {\n        this.root = { name: \"\", node: {}, hasAttrs: false, hasChildren: false, text: \"\" };\n    }\n\n    /**\n     * Whether the builder is inside a child element (as opposed to at the root level).\n     * @returns true while at least one child element is open\n     */\n    get open(): boolean {\n        return this.frames.length > 0;\n    }\n\n    /**\n     * An element starts.\n     * @param name - the element name as written\n     * @param attrs - its attributes\n     */\n    start(name: string, attrs: ReadonlyMap<string, string>): void {\n        const node: XmlTreeObject = {};\n        let hasAttrs = false;\n        for (const [key, value] of attrs) {\n            node[ATTRIBUTE_PREFIX + key] = value;\n            hasAttrs = true;\n        }\n        this.frames.push({ name, node, hasAttrs, hasChildren: false, text: \"\" });\n    }\n\n    /**\n     * Character data inside the current element.\n     * @param text - the text\n     */\n    text(text: string): void {\n        const frame = this.frames.at(-1) ?? this.root;\n        frame.text += text;\n    }\n\n    /** The current element ends; its value is attached to its parent. */\n    end(): void {\n        const frame = this.frames.pop();\n        if (frame === undefined) {\n            throw new GraphFormatError(\"E_COLUMN_TYPE\", \"XmlTreeBuilder.end() without a matching start()\", {\n                reason: \"tree builder underflow\",\n            });\n        }\n        const parent = this.frames.at(-1) ?? this.root;\n        attachChild(parent, frame.name, valueOf(frame));\n    }\n\n    /**\n     * The content of the containing element: its text when it has no child elements, otherwise\n     * the object of its children (with `#text` for non-whitespace mixed content).\n     * @returns the value to store in the json column\n     */\n    finish(): unknown {\n        if (this.frames.length > 0) {\n            throw new GraphFormatError(\"E_COLUMN_TYPE\", \"XmlTreeBuilder.finish() with open elements\", {\n                reason: \"tree builder open\",\n            });\n        }\n        const { root } = this;\n        if (!root.hasChildren) {\n            return root.text;\n        }\n        if (!isWhitespace(root.text)) {\n            root.node[TEXT_KEY] = root.text;\n        }\n        return root.node;\n    }\n}\n\n/**\n * The value of a finished element: its text when it has neither attributes nor children,\n * else its node with `#text` set to non-whitespace text.\n * @param frame - the finished frame\n * @returns the value\n */\nfunction valueOf(frame: Frame): unknown {\n    if (!frame.hasAttrs && !frame.hasChildren) {\n        return frame.text;\n    }\n    if (!isWhitespace(frame.text)) {\n        frame.node[TEXT_KEY] = frame.text;\n    }\n    return frame.node;\n}\n\n/**\n * Attach a child value under a name, turning a repeated name into an array.\n * @param parent - the parent frame\n * @param name - the child element name\n * @param value - the child value\n */\nfunction attachChild(parent: Frame, name: string, value: unknown): void {\n    parent.hasChildren = true;\n    // own keys only: an element named `__proto__` is a child like any other, never the object's prototype\n    const existing = Object.hasOwn(parent.node, name) ? parent.node[name] : undefined;\n    if (existing === undefined) {\n        Object.defineProperty(parent.node, name, { value, writable: true, enumerable: true, configurable: true });\n    } else if (Array.isArray(existing)) {\n        existing.push(value);\n    } else {\n        parent.node[name] = [existing, value];\n    }\n}\n\n/**\n * Whether a value is a tree the writer can serialize: a string, number, boolean or null (text),\n * an array of such trees, or an object whose keys are `#text`, `@_<Name>` or `<Name>` with tree\n * values.\n * @param value - the value\n * @returns true when writeXmlTree() accepts it\n * @category Plugin helpers\n */\nexport function isXmlTree(value: unknown): boolean {\n    return treeProblem(value) === null;\n}\n\n/**\n * Why a value is not a serializable tree.\n * @param value - the value\n * @returns a message, or null when the value is a tree\n * @category Plugin helpers\n */\nexport function treeProblem(value: unknown): string | null {\n    if (value === null || typeof value === \"string\" || typeof value === \"number\" || typeof value === \"boolean\") {\n        return null;\n    }\n    if (Array.isArray(value)) {\n        for (const item of value) {\n            if (Array.isArray(item)) {\n                return \"nested arrays cannot be written as elements\";\n            }\n            const problem = treeProblem(item);\n            if (problem !== null) {\n                return problem;\n            }\n        }\n        return null;\n    }\n    if (typeof value !== \"object\") {\n        return `a ${typeof value} cannot be written as XML`;\n    }\n    for (const [key, child] of Object.entries(value)) {\n        if (key === TEXT_KEY) {\n            if (child !== null && typeof child === \"object\") {\n                return \"#text must be a scalar\";\n            }\n            continue;\n        }\n        if (key.startsWith(ATTRIBUTE_PREFIX)) {\n            const name = key.slice(ATTRIBUTE_PREFIX.length);\n            if (!isXmlName(name)) {\n                return `\"${name}\" is not an XML attribute name`;\n            }\n            if (child !== null && typeof child === \"object\") {\n                return `attribute ${name} must be a scalar`;\n            }\n            continue;\n        }\n        if (!isXmlName(key)) {\n            return `\"${key}\" is not an XML element name`;\n        }\n        const problem = treeProblem(child);\n        if (problem !== null) {\n            return problem;\n        }\n    }\n    return null;\n}\n\n/**\n * Write the content of a tree as XML text: the children (and mixed text) of the containing\n * element. Leaf elements are written inline so their text stays exact; elements with children\n * are broken over lines and indented.\n * @param value - the tree (the content of a `<data>` element)\n * @param indent - the indentation of the containing element's children\n * @param out - receives the text parts\n * @category Plugin helpers\n */\nexport function writeXmlTree(value: unknown, indent: string, out: string[]): void {\n    const problem = treeProblem(value);\n    if (problem !== null) {\n        throw new GraphFormatError(\"E_COLUMN_TYPE\", `a yfiles value cannot be written as XML: ${problem}`, {\n            reason: \"xml tree\",\n        });\n    }\n    if (value === null || typeof value !== \"object\" || Array.isArray(value)) {\n        out.push(escapeXmlText(scalarText(value)));\n        return;\n    }\n    const object = value as XmlTreeObject;\n    let text: string | null = null;\n    for (const [key, child] of Object.entries(object)) {\n        if (key === TEXT_KEY) {\n            text = scalarText(child);\n        } else if (!key.startsWith(ATTRIBUTE_PREFIX)) {\n            writeElements(key, child, indent, out);\n        }\n    }\n    if (text !== null) {\n        out.push(escapeXmlText(text));\n    }\n}\n\n/**\n * Write one element (or, for an array, one element per item). An element holding text beside child elements (a yEd\n * label: its text, then its label model) is written without any whitespace of its own inside it, so the text reads\n * back exactly as it was.\n * @param name - the element name\n * @param value - the element value\n * @param indent - the indentation of this element, or null to write it with no line break or indentation\n * @param out - receives the text parts\n */\nfunction writeElements(name: string, value: unknown, indent: string | null, out: string[]): void {\n    if (Array.isArray(value)) {\n        for (const item of value) {\n            writeElements(name, item, indent, out);\n        }\n        return;\n    }\n    const brk = indent === null ? \"\" : `\\n${indent}`;\n    if (value === null || typeof value !== \"object\") {\n        const text = scalarText(value);\n        out.push(text.length === 0 ? `${brk}<${name}/>` : `${brk}<${name}>${escapeXmlText(text)}</${name}>`);\n        return;\n    }\n    writeObjectElement(name, value as XmlTreeObject, indent, out);\n}\n\n/**\n * Write one element whose value is a tree object: its attributes, its text and its children.\n * @param name - the element name\n * @param object - the element value\n * @param indent - the indentation of this element, or null to write it with no line break or indentation\n * @param out - receives the text parts\n */\nfunction writeObjectElement(name: string, object: XmlTreeObject, indent: string | null, out: string[]): void {\n    const brk = indent === null ? \"\" : `\\n${indent}`;\n    const { attrs, text, hasChildren } = elementParts(object);\n    if (!hasChildren) {\n        out.push(\n            text === null || text.length === 0\n                ? `${brk}<${name}${attrs}/>`\n                : `${brk}<${name}${attrs}>${escapeXmlText(text)}</${name}>`,\n        );\n        return;\n    }\n    // mixed content: the text first and the children with no whitespace, so none is added to the text\n    const inner = indent === null || text !== null ? null : `${indent}  `;\n    out.push(`${brk}<${name}${attrs}>`);\n    if (text !== null) {\n        out.push(escapeXmlText(text));\n    }\n    for (const [key, child] of Object.entries(object)) {\n        if (key !== TEXT_KEY && !key.startsWith(ATTRIBUTE_PREFIX)) {\n            writeElements(key, child, inner, out);\n        }\n    }\n    out.push(inner === null ? `</${name}>` : `${brk}</${name}>`);\n}\n\n/**\n * What a tree object holds besides its children: its attributes as text and its text.\n * @param object - the object\n * @returns the attribute text, the text (null for none) and whether it has child elements\n */\nfunction elementParts(object: XmlTreeObject): { attrs: string; text: string | null; hasChildren: boolean } {\n    let attrs = \"\";\n    let text: string | null = null;\n    let hasChildren = false;\n    for (const [key, child] of Object.entries(object)) {\n        if (key === TEXT_KEY) {\n            text = scalarText(child);\n        } else if (key.startsWith(ATTRIBUTE_PREFIX)) {\n            attrs += ` ${key.slice(ATTRIBUTE_PREFIX.length)}=\"${escapeXmlAttribute(scalarText(child))}\"`;\n        } else {\n            hasChildren = true;\n        }\n    }\n    return { attrs, text, hasChildren };\n}\n\n/**\n * The text of a scalar tree value.\n * @param value - a string, number, boolean or null\n * @returns the text; an empty string for null\n */\nfunction scalarText(value: unknown): string {\n    switch (typeof value) {\n        case \"string\":\n            return value;\n        case \"number\":\n        case \"boolean\":\n        case \"bigint\":\n            return String(value);\n        default:\n            return \"\";\n    }\n}\n","/**\n * yFiles / yEd graphics read out of the JSON tree of a `yfiles.type` key (tree.ts) into typed\n * columns, beside the tree itself: a `y:ShapeNode` gives the node's position, size, fill and\n * border colors, label and shape, and a `y:PolyLineEdge` gives the edge's line color and width,\n * its arrows and the direction they draw. The values are the ones graphty-element's own GraphML\n * parser produced, so a consumer rebuilds its records by dropping the `yfiles.` prefix: colors\n * are `#RRGGBB` in upper case (a `#RGB` is expanded, any other text is kept as written), numbers\n * are parsed with parseFloat, the position is `[x, y, 0]` and the shape is the yFiles shape type\n * as written. One difference: a label whose text is a number (`<y:NodeLabel>0</y:NodeLabel>`) is\n * kept as that text, where the element's parser turned it into a number and stored `\"\"`, nothing\n * or the number.\n *\n * The columns are views of the tree: the exporter writes the tree and never these columns, and\n * re-importing the tree gives them back. A value edited after import (a layout writing the\n * position) or a tree column removed is therefore not written, and the exporter reports it as a\n * loss (staleGraphicsRows()).\n *\n * Deprecated and frozen, not fixed: these columns, the rule that a target arrow makes an edge\n * directed and the label role of `yfiles.label` stay exactly as they are until the next major\n * version removes them. The yEd and yFiles 3 style readers read the kept graphics tree instead.\n */\n\nimport { type Column, type ColumnDecl, type GraphSnapshot, type JsonColumn } from \"@graphty/graph-format\";\n\nimport { localName } from \"../../common/xml.js\";\nimport type { ImporterPositions } from \"../../positions/types.js\";\n\n/** The name prefix of every column mapped from yFiles graphics. */\nconst YFILES_COLUMN_PREFIX = \"yfiles.\";\n\ntype Tree = Record<string, unknown>;\n\n/** The mapped node columns, by the field name graphty-element's records use. */\nconst NODE_FIELDS: Readonly<Record<string, Omit<ColumnDecl, \"name\">>> = {\n    // yEd writes the top-left corner of the node's box, y growing downward, in pixels\n    position: {\n        dtype: \"f64\",\n        components: 3,\n        role: \"position\",\n        mutable: true,\n        extra: {\n            units: \"px\",\n            yAxis: \"down\",\n            anchor: \"top-left\",\n            width: `${YFILES_COLUMN_PREFIX}width`,\n            height: `${YFILES_COLUMN_PREFIX}height`,\n        },\n    },\n    width: { dtype: \"f64\" },\n    height: { dtype: \"f64\" },\n    color: { dtype: \"string\" },\n    borderColor: { dtype: \"string\" },\n    borderWidth: { dtype: \"f64\" },\n    label: { dtype: \"string\", role: \"label\" },\n    shape: { dtype: \"string\" },\n};\n\n/** The mapped edge columns, by field name. */\nconst EDGE_FIELDS: Readonly<Record<string, Omit<ColumnDecl, \"name\">>> = {\n    color: { dtype: \"string\" },\n    width: { dtype: \"f64\" },\n    directed: { dtype: \"bool\" },\n    targetArrow: { dtype: \"string\" },\n    sourceArrow: { dtype: \"string\" },\n};\n\n/**\n * The declaration of a mapped column.\n * @param domain - node or edge\n * @param field - the field name (a key of the values graphicsValues() returns)\n * @param keyId - the id of the GraphML key whose tree it is read from\n * @returns the declaration\n * @category Plugin helpers\n */\nexport function graphicsDecl(domain: \"node\" | \"edge\", field: string, keyId: string): ColumnDecl {\n    const fields = domain === \"node\" ? NODE_FIELDS : EDGE_FIELDS;\n    return {\n        ...fields[field],\n        name: YFILES_COLUMN_PREFIX + field,\n        nullable: true,\n        origin: {\n            format: \"graphml\",\n            id: keyId,\n            title: null,\n            type: domain === \"node\" ? \"ShapeNode\" : \"PolyLineEdge\",\n            namespace: \"yfiles\",\n        },\n    };\n}\n\n/**\n * The tool behind a GraphML file's positions, for `extractPositions()`: yEd when they come from\n * yFiles graphics. The column's `meta.extra` already says how they are spelled.\n * @param snapshot - the graph the GraphML importer read\n * @returns the tool, or null to read the position column as declared\n */\nexport function yfilesPositions(snapshot: GraphSnapshot): ImporterPositions | null {\n    return snapshot.nodes.byRole(\"position\")?.meta.origin?.namespace === \"yfiles\" ? { tool: \"yed\" } : null;\n}\n\n/**\n * Whether a column is one graphicsDecl() declared (a view of a yFiles tree, never exported).\n * @param meta - the column's name, dtype and origin\n * @param meta.name - the column name\n * @param meta.dtype - the column dtype\n * @param meta.origin - the column origin\n * @returns true for a mapped graphics column\n * @category Plugin helpers\n */\nexport function isGraphicsColumn(meta: {\n    readonly name: string;\n    readonly dtype: string;\n    readonly origin: { readonly namespace: string | null } | null;\n}): boolean {\n    return meta.dtype !== \"json\" && meta.origin?.namespace === \"yfiles\" && meta.name.startsWith(YFILES_COLUMN_PREFIX);\n}\n\n/**\n * The rows of a mapped graphics column whose value is not one its yFiles tree columns (in the\n * same table) give: every set row when no tree column gives a value for the row. A file may\n * declare several yFiles keys for one domain, and the mapped column holds the values of all of\n * them, so a row is current when any tree's value matches. These are the values an export loses,\n * since only the trees are written.\n * @param column - the mapped column (isGraphicsColumn())\n * @param table - the table it is in\n * @param domain - node or edge\n * @returns the number of rows that differ from the trees\n * @category Plugin helpers\n */\nexport function staleGraphicsRows(column: Column, table: Iterable<Column>, domain: \"node\" | \"edge\"): number {\n    const field = column.meta.name.slice(YFILES_COLUMN_PREFIX.length);\n    const trees: JsonColumn[] = [];\n    for (const c of table) {\n        if (c.dtype === \"json\" && c.meta.origin?.namespace === \"yfiles\") {\n            trees.push(c);\n        }\n    }\n    let stale = 0;\n    for (let r = 0; r < column.length; r++) {\n        const wants = wantedGraphics(trees, domain, field, r);\n        const value = column.value(r);\n        const have = column.meta.components > 1 && value !== undefined ? Array.from(value as ArrayLike<number>) : value;\n        if (!wants.has(JSON.stringify(have))) {\n            stale++;\n        }\n    }\n    return stale;\n}\n\n/**\n * The serialized values the trees want for one row of a mapped column.\n * @param trees - the yFiles tree columns of the table\n * @param domain - node or edge\n * @param field - the mapped field name\n * @param r - the row\n * @returns the wanted values as JSON text; just `undefined`'s when no tree wants one\n */\nfunction wantedGraphics(trees: JsonColumn[], domain: \"node\" | \"edge\", field: string, r: number): Set<string> {\n    const wants = new Set<string>();\n    for (const tree of trees) {\n        const want = graphicsValues(domain, tree.values[r]).find(([f]) => f === field);\n        if (want !== undefined) {\n            wants.add(JSON.stringify(want[1]));\n        }\n    }\n    if (wants.size === 0) {\n        wants.add(JSON.stringify(undefined));\n    }\n    return wants;\n}\n\n/**\n * The mapped values of one `<data>` tree of a yFiles key: a ShapeNode's for a node, a\n * PolyLineEdge's for an edge. A GenericNode, ImageNode, SVGNode, UMLClassNode, UMLNoteNode, TableNode\n * or ProxyAutoBoundsNode (a group, read through the realizer `Realizers@active` names), and yFiles 3's\n * NodeGeometry `RectD`, give their geometry only: position, width and height. Nothing for any other graphics (BezierEdge, ...).\n * @param domain - node or edge\n * @param tree - the `<data>` content as tree.ts builds it\n * @param unmapped - receives the fields whose text is present but not a number (not mapped)\n * @returns field name -> value, in declaration order\n * @category Plugin helpers\n */\nexport function graphicsValues(domain: \"node\" | \"edge\", tree: unknown, unmapped: string[] = []): [string, unknown][] {\n    const out: [string, unknown][] = [];\n    if (domain === \"node\") {\n        const shape = child(tree, \"ShapeNode\");\n        const rect = child(tree, \"RectD\");\n        if (rect !== undefined) {\n            // yFiles 3's NodeGeometry: the same top-left corner and size as yEd's Geometry, capitalized\n            geometryValues(\n                {\n                    \"@_x\": attr(rect, \"X\"),\n                    \"@_y\": attr(rect, \"Y\"),\n                    \"@_width\": attr(rect, \"Width\"),\n                    \"@_height\": attr(rect, \"Height\"),\n                },\n                out,\n                unmapped,\n            );\n        } else if (shape === undefined) {\n            geometryValues(child(geometryNode(tree), \"Geometry\"), out, unmapped);\n        } else {\n            shapeNodeValues(shape, out, unmapped);\n        }\n    } else {\n        const edge = child(tree, \"PolyLineEdge\");\n        if (edge !== undefined) {\n            polyLineEdgeValues(edge, out, unmapped);\n        }\n    }\n    return out;\n}\n\n/**\n * Read a ShapeNode.\n * @param shape - the ShapeNode element\n * @param out - receives the values\n * @param unmapped - receives the fields whose text is not a number\n */\nfunction shapeNodeValues(shape: unknown, out: [string, unknown][], unmapped: string[]): void {\n    geometryValues(child(shape, \"Geometry\"), out, unmapped);\n    push(out, \"color\", color(attr(child(shape, \"Fill\"), \"color\")));\n    const border = child(shape, \"BorderStyle\");\n    push(out, \"borderColor\", color(attr(border, \"color\")));\n    push(out, \"borderWidth\", checked(attr(border, \"width\"), \"borderWidth\", unmapped));\n    const label = child(shape, \"NodeLabel\");\n    // an element with no text and no attributes is \"\" (no label); one with attributes but no text is a blank label\n    if (typeof label === \"string\" ? label.length > 0 : label !== undefined) {\n        // trimmed, as the element's parser (trimValues) reads it: pretty-printed yEd puts whitespace before the label's children\n        out.push([\"label\", (typeof label === \"string\" ? label : (text(label) ?? \"\")).trim()]);\n    }\n    push(out, \"shape\", nonEmpty(attr(child(shape, \"Shape\"), \"type\")));\n}\n\n/**\n * Read a Geometry: the position of the box's top-left corner, its width and height.\n * @param geometry - the Geometry element, or undefined\n * @param out - receives the values\n * @param unmapped - receives the fields whose text is not a number\n */\nfunction geometryValues(geometry: unknown, out: [string, unknown][], unmapped: string[]): void {\n    // yFiles requires x, y, width and height on Geometry; a position needs both coordinates\n    const x = checked(attr(geometry, \"x\"), \"x\", unmapped);\n    const y = checked(attr(geometry, \"y\"), \"y\", unmapped);\n    if (x !== undefined && y !== undefined) {\n        out.push([\"position\", [x, y, 0]]);\n    }\n    push(out, \"width\", checked(attr(geometry, \"width\"), \"width\", unmapped));\n    push(out, \"height\", checked(attr(geometry, \"height\"), \"height\", unmapped));\n}\n\n/** The node graphics besides ShapeNode whose Geometry is read. */\nconst GEOMETRY_NODES = [\"GenericNode\", \"ImageNode\", \"SVGNode\", \"UMLClassNode\", \"UMLNoteNode\", \"TableNode\"] as const;\n\n/**\n * The element holding a non-ShapeNode node's Geometry: one of GEOMETRY_NODES, or\n * the active realizer of a ProxyAutoBoundsNode (`Realizers@active`, default 0).\n * @param tree - the `<data>` content\n * @returns the element, or undefined\n */\nfunction geometryNode(tree: unknown): unknown {\n    for (const local of GEOMETRY_NODES) {\n        const node = child(tree, local);\n        if (node !== undefined) {\n            return node;\n        }\n    }\n    const realizers = child(child(tree, \"ProxyAutoBoundsNode\"), \"Realizers\");\n    const active = Number.parseInt(attr(realizers, \"active\") ?? \"0\", 10);\n    return elements(realizers)[Number.isNaN(active) ? 0 : active];\n}\n\n/**\n * Every child element of a tree node, in document order per name.\n * @param node - the tree node\n * @returns the children\n */\nfunction elements(node: unknown): unknown[] {\n    if (typeof node !== \"object\" || node === null) {\n        return [];\n    }\n    return Object.entries(node as Tree)\n        .filter(([key]) => !key.startsWith(\"@_\") && key !== \"#text\")\n        .flatMap(([, value]) => (Array.isArray(value) ? (value as unknown[]) : [value]));\n}\n\n/**\n * Read a PolyLineEdge.\n * @param edge - the PolyLineEdge element\n * @param out - receives the values\n * @param unmapped - receives the fields whose text is not a number\n */\nfunction polyLineEdgeValues(edge: unknown, out: [string, unknown][], unmapped: string[]): void {\n    const line = child(edge, \"LineStyle\");\n    push(out, \"color\", color(attr(line, \"color\")));\n    push(out, \"width\", checked(attr(line, \"width\"), \"width\", unmapped));\n    const arrows = child(edge, \"Arrows\");\n    if (arrows !== undefined && typeof arrows === \"object\") {\n        const target = attr(arrows, \"target\");\n        const source = attr(arrows, \"source\");\n        // yEd draws direction with the target arrow; the file's edgedefault still decides topology\n        out.push([\"directed\", target !== undefined && target !== \"none\"]);\n        push(out, \"targetArrow\", target === \"none\" ? undefined : nonEmpty(target));\n        push(out, \"sourceArrow\", source === \"none\" ? undefined : nonEmpty(source));\n    }\n}\n\n/**\n * Append a value when it is defined.\n * @param out - the values\n * @param field - the field name\n * @param value - the value\n */\nfunction push(out: [string, unknown][], field: string, value: unknown): void {\n    if (value !== undefined) {\n        out.push([field, value]);\n    }\n}\n\n/**\n * The first child element of a tree node by local name, whatever its namespace prefix.\n * @param node - the tree node\n * @param local - the local name\n * @returns the child, or undefined\n */\nfunction child(node: unknown, local: string): unknown {\n    if (typeof node !== \"object\" || node === null) {\n        return undefined;\n    }\n    for (const [key, value] of Object.entries(node as Tree)) {\n        if (!key.startsWith(\"@_\") && key !== \"#text\" && localName(key) === local) {\n            return Array.isArray(value) ? value[0] : value;\n        }\n    }\n    return undefined;\n}\n\n/**\n * An attribute of a tree node.\n * @param node - the tree node\n * @param name - the attribute name\n * @returns the text, or undefined\n */\nfunction attr(node: unknown, name: string): string | undefined {\n    if (typeof node !== \"object\" || node === null) {\n        return undefined;\n    }\n    const value = (node as Tree)[`@_${name}`];\n    return typeof value === \"string\" ? value : undefined;\n}\n\n/**\n * The character data of an element that also has attributes or children.\n * @param node - the tree node\n * @returns the text, or undefined\n */\nfunction text(node: unknown): string | undefined {\n    const value = typeof node === \"object\" && node !== null ? (node as Tree)[\"#text\"] : undefined;\n    return typeof value === \"string\" ? value : undefined;\n}\n\n/**\n * A non-empty text.\n * @param value - the text\n * @returns the text, or undefined when absent or empty\n */\nfunction nonEmpty(value: string | undefined): string | undefined {\n    return value === undefined || value.length === 0 ? undefined : value;\n}\n\n/**\n * A number attribute, parsed as graphty-element's parser parsed it.\n * @param value - the text\n * @returns the number, or undefined when absent, empty or not a number\n */\nfunction number(value: string | undefined): number | undefined {\n    if (value === undefined || value.length === 0) {\n        return undefined;\n    }\n    const n = Number.parseFloat(value);\n    return Number.isNaN(n) ? undefined : n;\n}\n\n/**\n * A number attribute, recording a present text that is not a number.\n * @param value - the text\n * @param field - the field it maps to\n * @param unmapped - receives the field when the text is not a number\n * @returns the number, or undefined\n */\nfunction checked(value: string | undefined, field: string, unmapped: string[]): number | undefined {\n    const n = number(value);\n    if (n === undefined && value !== undefined && value.length > 0) {\n        unmapped.push(field);\n    }\n    return n;\n}\n\n/**\n * A color attribute: `#RRGGBB` upper-cased, `#RGB` expanded, anything else as written.\n * @param value - the text\n * @returns the color, or undefined when absent or empty\n */\nfunction color(value: string | undefined): string | undefined {\n    if (value === undefined || value.length === 0) {\n        return undefined;\n    }\n    if (/^#[0-9A-Fa-f]{6}$/.test(value)) {\n        return value.toUpperCase();\n    }\n    if (/^#[0-9A-Fa-f]{3}$/.test(value)) {\n        const [, r, g, b] = value;\n        return `#${r}${r}${g}${g}${b}${b}`.toUpperCase();\n    }\n    return value;\n}\n","/**\n * The GraphML exporter (design section 8.5; research note 07 section 9): `<key>` declarations\n * regenerated from ColumnMeta.origin when the column came from GraphML (key id, attr.name,\n * attr.type, yfiles.type) and derived from the dtype otherwise; node ids sanitised to NMTOKEN\n * (`sanitizeIds: \"error\"` refuses, `\"mangle\"` rewrites and keeps the original in a\n * `graphty:originalId` data attribute the importer restores); mixed direction written with\n * `edgedefault` plus per-edge `directed` attributes, folding expanded pairs back through the\n * `pair` / `directed` role columns; explicit weights only (the role-weight column's validity);\n * containment (`parent` role) as nested graphs; yFiles json columns as nested XML again.\n *\n * check() lists every loss before anything is written: the generic capability gaps of\n * checkCapabilities() (dict / u32 / u8 dtypes, lists, components, options, positions, visual and\n * temporal roles, extension tables) plus the GraphML-specific ones (mutual edges written as\n * undirected, json columns without a yfiles origin written as JSON text, multi-parent columns,\n * containment order, ids that change type under the canonical rule, edge ids that read back as\n * strings, roles GraphML cannot express, yfiles values that are not serializable trees).\n */\n\nimport { type Column, GraphFormatError, type GraphSnapshot, INVALID_INDEX } from \"@graphty/graph-format\";\n\nimport { childrenCsr } from \"../../children.js\";\nimport { type PairFolding, pairFolding } from \"../../common/direction.js\";\nimport { escapeXmlAttribute, escapeXmlText } from \"../../common/escape.js\";\nimport {\n    capabilities,\n    checkCapabilities,\n    isNmtoken,\n    LOSS,\n    mangleNmtoken,\n    type SanitizedIds,\n    sanitizeIds,\n} from \"../../common/export.js\";\nimport { formatF32, formatF64, formatInteger } from \"../../common/format.js\";\nimport { isCanonicalIntegerText } from \"../../common/ids.js\";\nimport { type ResolvedExportOptions, resolveExportOptions } from \"../../common/options.js\";\nimport { agree, plural } from \"../../common/plural.js\";\nimport { type ExplicitWeights, explicitWeights } from \"../../common/weights.js\";\nimport { encodeChunks, joinText } from \"../../common/writer.js\";\nimport { xmlIllegalTextNotes } from \"../../common/xml.js\";\nimport type { ExporterStyleOptions } from \"../../styles/io/writer.js\";\nimport { type CommonExportOptions, type ExportCapabilities, type GraphExporter, type LossNote } from \"../../types.js\";\nimport {\n    EDGE_ID_COLUMN,\n    FORMAT,\n    GRAPHML_LOSS,\n    GRAPHML_NAMESPACE,\n    type GraphmlMeta,\n    LABEL_COLUMN,\n    META_KEY,\n    ORIGINAL_ID_ATTRIBUTE,\n    PARENT_COLUMN,\n    RESERVED_EDGE_NAMES,\n    RESERVED_NODE_NAMES,\n    SCHEMA_LOCATION,\n    SOURCE_PORT_COLUMN,\n    TARGET_PORT_COLUMN,\n    XSI_NAMESPACE,\n    YFILES_NAMESPACE,\n} from \"./constants.js\";\nimport { GRAPHML_STYLE_CAPABILITIES, graphmlStyledExport } from \"./styles-yed.js\";\nimport { treeProblem, writeXmlTree } from \"./tree.js\";\nimport { isGraphicsColumn, staleGraphicsRows } from \"./yfiles.js\";\n\n/** What the writer takes: the format's options, the common ones and the styles. */\ntype GraphmlWriteOptions = GraphmlExportOptions & CommonExportOptions & ExporterStyleOptions;\n\n/**\n * The format-specific options of the GraphML exporter.\n * @category Built-in formats\n */\nexport interface GraphmlExportOptions extends CommonExportOptions {\n    /**\n     * Indent nested elements; false writes one element per line without indentation.\n     * @defaultValue true\n     */\n    pretty?: boolean | undefined;\n    /**\n     * The `edgedefault` of the graph element. The default is the one a GraphML import read, so a\n     * file with both directions reads back with the same edges marked, else the graph's direction\n     * (for a graph with both, the direction most edges have).\n     * @defaultValue as read\n     */\n    edgedefault?: \"directed\" | \"undirected\" | undefined;\n}\n\n/** What GraphML keeps as declared (research note 07 section 9). */\nconst CAPABILITIES: ExportCapabilities = capabilities({\n    mixedDirection: true,\n    multiEdges: true,\n    selfLoops: true,\n    edgeIds: \"optional\",\n    idCharset: \"nmtoken\",\n    dtypes: [\"bool\", \"i32\", \"f32\", \"f64\", \"string\"],\n    components: false,\n    lists: false,\n    json: false,\n    defaults: true,\n    options: false,\n    hierarchy: true,\n    temporal: \"none\",\n    graphAttributes: true,\n    positions: false,\n    viz: false,\n});\n\n/** Roles handled structurally (never written as a key) or reported by checkCapabilities() and not written. */\nconst STRUCTURAL_ROLES: ReadonlySet<string> = new Set([\n    \"directed\",\n    \"pair\",\n    \"mutual\",\n    \"weight\",\n    \"timeText\",\n    \"originalId\",\n]);\nconst DROPPED_ROLES: ReadonlySet<string> = new Set([\n    \"position\",\n    \"color\",\n    \"size\",\n    \"shape\",\n    \"thickness\",\n    \"start\",\n    \"end\",\n    \"timestamp\",\n    \"timestamps\",\n    \"spells\",\n    \"open\",\n    \"spellsOpen\",\n]);\n\n/**\n * The roles GraphML has a slot for (checkCapabilities() reports every other role as lost): the\n * label key, the edge `id`, `sourceport` and `targetport` attributes and nested graphs.\n */\nconst SLOT_ROLES: ReadonlySet<string> = new Set([\"label\", \"id\", \"sourcePort\", \"targetPort\", \"parent\"]);\n\n/** The slot roles written structurally per domain (never as a key); a label is a key titled `label`. */\nconst SLOT_ROLES_BY_DOMAIN: Readonly<Record<Domain, ReadonlySet<string>>> = {\n    graph: new Set(),\n    node: new Set([\"parent\"]),\n    edge: new Set([\"id\", \"sourcePort\", \"targetPort\"]),\n};\n\n/** The names the importer gives the slot columns (design section 5.6), for the name-change notes. */\nconst ROLE_NAMES: Readonly<Record<string, string>> = Object.freeze({\n    label: LABEL_COLUMN,\n    id: EDGE_ID_COLUMN,\n    sourcePort: SOURCE_PORT_COLUMN,\n    targetPort: TARGET_PORT_COLUMN,\n    parent: PARENT_COLUMN,\n});\n\n/** The attr.name of the weight key when the weight did not come from GraphML (the importer's weightFrom default). */\nconst DEFAULT_WEIGHT_NAME = \"weight\";\n\n/** A note-recording callback. */\ntype NoteFn = (code: string, message: string, column?: string | null, count?: number | null) => void;\n\n/** The GraphML attr.type values and the dtype each maps to, for restoring origin.type. */\nconst TYPE_DTYPES: Readonly<Record<string, string>> = {\n    boolean: \"bool\",\n    int: \"i32\",\n    long: \"f64\",\n    float: \"f32\",\n    double: \"f64\",\n    string: \"string\",\n};\n\nconst I32_MAX = 2147483647;\n\n/** The yfiles.type written for a yfiles json column whose origin records none. */\nconst DEFAULT_YFILES_TYPES: Readonly<Record<Domain, string>> = {\n    node: \"nodegraphics\",\n    edge: \"edgegraphics\",\n    graph: \"resources\",\n};\n\n/** The element domains. */\ntype Domain = \"graph\" | \"node\" | \"edge\";\n\n/** One column written as a key. */\ninterface ColumnPlan {\n    readonly column: Column;\n    readonly domain: Domain;\n    /** The key id. */\n    keyId: string;\n    /** The attr.type, or null for a yfiles key. */\n    readonly attrType: string | null;\n    /** The attr.name, or null for a yfiles key. */\n    readonly attrName: string | null;\n    /** The yfiles.type, or null. */\n    readonly yfilesType: string | null;\n    /** Whether values are written as nested XML trees. */\n    readonly yfiles: boolean;\n}\n\n/** One `<key>` element (a for=\"all\" key merges up to three column plans). */\ninterface KeyPlan {\n    readonly id: string;\n    readonly domains: readonly Domain[];\n    readonly attrName: string | null;\n    readonly attrType: string | null;\n    readonly yfilesType: string | null;\n    /** The column whose default and desc are written; null for the weight key. */\n    readonly column: Column | null;\n}\n\n/** Containment as the exporter writes it. */\ninterface Hierarchy {\n    /** The parent column, or null. */\n    readonly parent: Column | null;\n    /** Nodes written at the top level, in order (roots, then the roots forced out of cycles). */\n    readonly roots: Uint32Array;\n    /** CSR of children by parent: childStart[u]..childStart[u+1] over childList. */\n    readonly childStart: Uint32Array;\n    readonly childList: Uint32Array;\n    /** Whether the written order differs from index order. */\n    readonly reordered: boolean;\n    /** Nodes whose parent chain never reaches a root. */\n    readonly unreachable: number;\n}\n\n/** Everything check() and export() agree on. */\ninterface Plan {\n    readonly options: ResolvedExportOptions;\n    readonly pretty: boolean;\n    readonly notes: LossNote[];\n    readonly keys: KeyPlan[];\n    readonly graphColumns: ColumnPlan[];\n    readonly nodeColumns: ColumnPlan[];\n    readonly edgeColumns: ColumnPlan[];\n    /** The weight key id, attr.type and the explicit weights, or null for an unweighted snapshot. */\n    readonly weight: { readonly keyId: string; readonly attrType: string; readonly weights: ExplicitWeights } | null;\n    /** The key id of the originalId attribute, when mangled ids are written. */\n    readonly originalIdKey: string | null;\n    readonly edgedefault: \"directed\" | \"undirected\";\n    /** The pair folding: mirrors skipped, source directions. */\n    readonly folding: PairFolding;\n    readonly edgeIdColumn: Column | null;\n    readonly sourcePortColumn: Column | null;\n    readonly targetPortColumn: Column | null;\n    readonly hierarchy: Hierarchy;\n    readonly meta: GraphmlMeta | null;\n    readonly needsOriginalIdKey: boolean;\n    /** Styles are written: the `y` prefix is yEd's namespace, whatever the file the graph came from bound it to. */\n    readonly yedGraphics?: boolean;\n}\n\n/** The resolved format-specific options. */\ninterface FormatOptions {\n    /** Whether to indent. */\n    readonly pretty: boolean;\n    /** The edgedefault override, or null. */\n    readonly edgedefault: \"directed\" | \"undirected\" | null;\n}\n\n/**\n * Resolve the format-specific options.\n * @param options - the caller's options\n * @returns the pretty flag and the edgedefault override\n */\nfunction resolveFormatOptions(options: GraphmlExportOptions | undefined): FormatOptions {\n    const pretty = options?.pretty ?? true;\n    if (typeof pretty !== \"boolean\") {\n        throw new GraphFormatError(\"E_UNSUPPORTED\", \"option pretty must be a boolean\", {\n            option: \"pretty\",\n            found: typeof pretty,\n        });\n    }\n    const edgedefault = options?.edgedefault ?? null;\n    if (edgedefault !== null && edgedefault !== \"directed\" && edgedefault !== \"undirected\") {\n        throw new GraphFormatError(\n            \"E_UNSUPPORTED\",\n            `option edgedefault: ${JSON.stringify(edgedefault)} is not \"directed\" or \"undirected\"`,\n            { option: \"edgedefault\", found: edgedefault },\n        );\n    }\n    return { pretty, edgedefault };\n}\n\n/**\n * The importer's `meta.extra.graphml`, when the snapshot has one of the expected shape.\n * @param snapshot - the snapshot\n * @returns the meta, or null\n */\nfunction graphmlMetaOf(snapshot: GraphSnapshot): GraphmlMeta | null {\n    const value = snapshot.meta.extra[META_KEY];\n    if (typeof value !== \"object\" || value === null) {\n        return null;\n    }\n    const record = value as Record<string, unknown>;\n    const graphId = typeof record.graphId === \"string\" ? record.graphId : null;\n    const edgedefault =\n        record.edgedefault === \"directed\" || record.edgedefault === \"undirected\" ? record.edgedefault : null;\n    const namespaces: Record<string, string> = {};\n    if (typeof record.namespaces === \"object\" && record.namespaces !== null) {\n        for (const [prefix, uri] of Object.entries(record.namespaces as Record<string, unknown>)) {\n            if (typeof uri === \"string\") {\n                namespaces[prefix] = uri;\n            }\n        }\n    }\n    return { graphId, edgedefault, namespaces };\n}\n\n/**\n * Build the plan: classify every column, assign key ids, decide the edgedefault and the\n * containment order, and collect every loss note.\n * @param snapshot - the snapshot\n * @param options - the resolved common options\n * @param format - the resolved format options\n * @param keyOrdered - write each element's data in the order of the keys (styled exports)\n * @returns the plan\n */\nfunction planExport(\n    snapshot: GraphSnapshot,\n    options: ResolvedExportOptions,\n    format: FormatOptions,\n    keyOrdered = false,\n): Plan {\n    // the generic json note is replaced by planTable()'s (yfiles trees are kept, other json is\n    // text); columns mapped from a yfiles tree are never written: planTable() notes the ones\n    // that no longer match their tree, the rest lose nothing\n    const graphics = new Set(\n        [...snapshot.nodes, ...snapshot.edges].filter((c) => isGraphicsColumn(c.meta)).map((c) => c.meta.name),\n    );\n    const notes = checkCapabilities(snapshot, CAPABILITIES, options, {\n        roles: SLOT_ROLES,\n        roleNames: ROLE_NAMES,\n    }).filter((n) => n.code !== LOSS.JSON && (n.column === null || !graphics.has(n.column)));\n    const note: NoteFn = (code, message, column = null, count = null): void => {\n        notes.push(Object.freeze({ code, message, column, count }));\n    };\n    notes.push(...xmlIllegalTextNotes(snapshot));\n    const meta = graphmlMetaOf(snapshot);\n    const keyIds = new KeyIds();\n\n    const graphColumns = planTable(snapshot.graph, \"graph\", notes, note);\n    const nodeColumns = planTable(snapshot.nodes, \"node\", notes, note);\n    const edgeColumns = planTable(snapshot.edges, \"edge\", notes, note);\n    const keys = planKeys([...graphColumns, ...nodeColumns, ...edgeColumns], keyIds);\n    if (keyOrdered) {\n        // an element's data in the order of its keys, as a re-import orders its columns, so that exporting what a\n        // styled export reads back gives the same bytes. ponytail: styled exports only, so an export without\n        // styles keeps its bytes; extend it to every export when that change is wanted on its own.\n        const keyOrder = new Map(keys.map((k, i) => [k.id, i]));\n        const byKey = (a: ColumnPlan, b: ColumnPlan): number =>\n            (keyOrder.get(a.keyId) ?? 0) - (keyOrder.get(b.keyId) ?? 0);\n        nodeColumns.sort(byKey);\n        edgeColumns.sort(byKey);\n    }\n    reservedNameNotes(nodeColumns, RESERVED_NODE_NAMES, note);\n    reservedNameNotes(edgeColumns, RESERVED_EDGE_NAMES, note);\n    const weight = planWeight(snapshot, edgeColumns, keyIds, keys, note);\n\n    // ids\n    const idTypeChanges = countIdTypeChanges(snapshot);\n    if (idTypeChanges > 0) {\n        note(\n            GRAPHML_LOSS.ID_TEXT_TYPE,\n            `${idTypeChanges} node id${plural(idTypeChanges)} ${agree(idTypeChanges, \"changes\", \"change\")} type when read back under ids: \"canonical\" (string ids that are integer text, non-integer numbers)`,\n            null,\n            idTypeChanges,\n        );\n    }\n    const edgeIdColumn = snapshot.edges.byRole(\"id\");\n    if (edgeIdColumn !== null) {\n        planEdgeIds(snapshot, edgeIdColumn, options, note);\n    }\n    const unrepresentable = countUnrepresentableNodeIds(snapshot);\n    const needsOriginalIdKey = unrepresentable > 0 && options.sanitizeIds === \"mangle\";\n    const originalIdKey = needsOriginalIdKey ? keyIds.next(null) : null;\n\n    // direction: an undirected pair folds to one undirected edge, a mutual pair too (the mark is lost)\n    const folding = pairFolding(snapshot, { foldMutual: true });\n    if (folding.mutualCount > 0) {\n        note(\n            GRAPHML_LOSS.MUTUAL_AS_UNDIRECTED,\n            `${folding.mutualCount} mutual pair${plural(folding.mutualCount)} ${agree(folding.mutualCount, \"is\", \"are\")} written as undirected edges; the mutual mark is lost`,\n            null,\n            folding.mutualCount,\n        );\n    }\n    const edgedefault = planEdgedefault(snapshot, folding, format, meta);\n\n    // containment\n    const hierarchy = planHierarchy(snapshot);\n    if (hierarchy.reordered) {\n        note(\n            GRAPHML_LOSS.HIERARCHY_REORDERED,\n            \"nodes are written in containment order (children nested under their parent); node indices change after a round trip\",\n            hierarchy.parent?.meta.name ?? null,\n        );\n    }\n    if (hierarchy.unreachable > 0) {\n        note(\n            GRAPHML_LOSS.PARENT_CYCLE,\n            `${hierarchy.unreachable} node${plural(hierarchy.unreachable)} whose parent chain never reaches a root ${agree(hierarchy.unreachable, \"is\", \"are\")} written at the top level`,\n            hierarchy.parent?.meta.name ?? null,\n            hierarchy.unreachable,\n        );\n    }\n\n    return {\n        options,\n        pretty: format.pretty,\n        notes,\n        keys,\n        graphColumns,\n        nodeColumns,\n        edgeColumns,\n        weight,\n        originalIdKey,\n        edgedefault,\n        folding,\n        edgeIdColumn,\n        sourcePortColumn: snapshot.edges.byRole(\"sourcePort\"),\n        targetPortColumn: snapshot.edges.byRole(\"targetPort\"),\n        hierarchy,\n        meta,\n        needsOriginalIdKey,\n    };\n}\n\n/**\n * A plain column titled like one of the importer's XML-derived columns (`id`, `sourceport`,\n * `targetport` on edges, `parent` on nodes) reads back renamed `<name>#<key id>` (design section\n * 5.6); the note says so.\n * @param plans - the column plans of one domain, key ids assigned\n * @param reserved - the reserved names of that domain\n * @param note - the note recorder\n */\nfunction reservedNameNotes(plans: readonly ColumnPlan[], reserved: ReadonlySet<string>, note: NoteFn): void {\n    for (const plan of plans) {\n        const { column, attrName, keyId } = plan;\n        if (attrName === null || !reserved.has(attrName)) {\n            continue;\n        }\n        note(\n            LOSS.COLUMN_NAME_CHANGED,\n            `${plan.domain} column \"${column.meta.name}\" is titled like the importer's ${attrName} column and reads back as \"${attrName}#${keyId}\"`,\n            column.meta.name,\n            column.length - column.nullCount,\n        );\n    }\n}\n\n/** The key ids handed out so far: a preferred NMTOKEN when free, else the next free `d<n>`. */\nclass KeyIds {\n    private readonly used = new Set<string>();\n    private counter = 0;\n\n    /**\n     * Take a key id.\n     * @param preferred - the id to keep when it is an NMTOKEN not handed out yet, or null\n     * @returns the id\n     */\n    next(preferred: string | null): string {\n        if (preferred !== null && isNmtoken(preferred) && !this.used.has(preferred)) {\n            this.used.add(preferred);\n            return preferred;\n        }\n        for (;;) {\n            const candidate = `d${this.counter}`;\n            this.counter++;\n            if (!this.used.has(candidate)) {\n                this.used.add(candidate);\n                return candidate;\n            }\n        }\n    }\n}\n\n/**\n * The `<key>` elements: columns sharing a GraphML origin.id across domains become one for=\"all\"\n * key when their name, type and default agree; every other column is its own key.\n * @param all - the column plans of the three domains, in writing order\n * @param keyIds - the key id allocator\n * @returns the keys, in declaration order\n */\nfunction planKeys(all: readonly ColumnPlan[], keyIds: KeyIds): KeyPlan[] {\n    const keys: KeyPlan[] = [];\n    const byOrigin = new Map<string, ColumnPlan[]>();\n    for (const plan of all) {\n        const { origin } = plan.column.meta;\n        if (origin !== null && origin.format === FORMAT && origin.id !== null) {\n            const group = byOrigin.get(origin.id) ?? [];\n            group.push(plan);\n            byOrigin.set(origin.id, group);\n        }\n    }\n    const planned = new Set<ColumnPlan>();\n    for (const plan of all) {\n        if (planned.has(plan)) {\n            continue;\n        }\n        const { origin } = plan.column.meta;\n        const group =\n            origin !== null && origin.format === FORMAT && origin.id !== null\n                ? (byOrigin.get(origin.id) ?? [plan])\n                : [plan];\n        const shared = group.length > 1 && group.every((other) => other === plan || sameKey(plan, other));\n        const members = shared ? group : [plan];\n        const id = keyIds.next(origin !== null && origin.format === FORMAT ? origin.id : null);\n        for (const member of members) {\n            member.keyId = id;\n            planned.add(member);\n        }\n        const domains = members.map((member) => member.domain);\n        // a yfiles key carries attr.name only when the column name is not the key id (yEd writes none)\n        const yfilesName = plan.column.meta.origin?.title ?? plan.column.meta.name;\n        let { attrName } = plan;\n        if (plan.yfiles) {\n            attrName = yfilesName === id ? null : yfilesName;\n        }\n        keys.push({\n            id,\n            domains: domains.length > 1 ? [\"graph\", \"node\", \"edge\"] : domains,\n            attrName,\n            attrType: plan.attrType,\n            yfilesType: plan.yfilesType,\n            column: plan.column,\n        });\n    }\n    return keys;\n}\n\n/**\n * The weight key of a weighted snapshot (its attr.name and attr.type restored from\n * meta.weightOrigin when the weight came from GraphML), and the note for an edge column the\n * importer would read as THE weight: every edge key titled like the weight key (`weight` by\n * default) is a weight key on import, so such a column reads back as the weight, not as a column.\n * @param snapshot - the snapshot\n * @param edgeColumns - the edge column plans\n * @param keyIds - the key id allocator\n * @param keys - receives the weight key\n * @param note - the note recorder\n * @returns the weight plan, or null for an unweighted snapshot\n */\nfunction planWeight(\n    snapshot: GraphSnapshot,\n    edgeColumns: readonly ColumnPlan[],\n    keyIds: KeyIds,\n    keys: KeyPlan[],\n    note: NoteFn,\n): Plan[\"weight\"] {\n    const weights = explicitWeights(snapshot);\n    const origin = snapshot.meta.weightOrigin;\n    const fromGraphml = weights.weighted && origin !== null && origin.format === FORMAT;\n    const attrName = fromGraphml && origin.title !== null ? origin.title : DEFAULT_WEIGHT_NAME;\n    for (const plan of edgeColumns) {\n        if (plan.attrName === attrName) {\n            note(\n                LOSS.WEIGHT_KEY_CLASH,\n                `edge column \"${plan.column.meta.name}\" is written as a key titled \"${attrName}\", which the importer reads as the edge weight (weightFrom); it reads back as the weight, not as a column`,\n                plan.column.meta.name,\n                plan.column.length - plan.column.nullCount,\n            );\n        }\n    }\n    if (!weights.weighted) {\n        return null;\n    }\n    let attrType = \"double\";\n    if (fromGraphml && origin.type !== null) {\n        const declared = origin.type.trim().toLowerCase();\n        if (declared === \"float\" || declared === \"double\" || declared === \"long\" || declared === \"int\") {\n            attrType = declared;\n        }\n    }\n    if ((attrType === \"int\" || attrType === \"long\") && !weightsIntegral(snapshot, weights)) {\n        // a declared integer weight only survives when every explicit weight is integral\n        attrType = \"double\";\n    }\n    const id = keyIds.next(fromGraphml ? origin.id : null);\n    keys.push({ id, domains: [\"edge\"], attrName, attrType, yfilesType: null, column: null });\n    return { keyId: id, attrType, weights };\n}\n\n/**\n * The notes about the edge id column: a numeric column reads back as string; ids outside the\n * NMTOKEN charset are refused or mangled per sanitizeIds.\n * @param snapshot - the snapshot\n * @param column - the edge id column\n * @param options - the resolved options\n * @param note - the note recorder\n */\nfunction planEdgeIds(snapshot: GraphSnapshot, column: Column, options: ResolvedExportOptions, note: NoteFn): void {\n    if (column.dtype !== \"string\" && column.dtype !== \"dict\") {\n        note(\n            GRAPHML_LOSS.EDGE_ID_TEXT,\n            `edge id column \"${column.meta.name}\" is ${column.dtype}; GraphML edge ids read back as strings`,\n            column.meta.name,\n            snapshot.edgeCount - column.nullCount,\n        );\n    }\n    const bad = countBadEdgeIds(column);\n    if (bad === 0) {\n        return;\n    }\n    if (options.sanitizeIds === \"mangle\") {\n        note(\n            LOSS.ID_MANGLED,\n            `${bad} edge id${plural(bad)} outside the nmtoken charset ${agree(bad, \"is\", \"are\")} rewritten`,\n            column.meta.name,\n            bad,\n        );\n    } else {\n        note(\n            LOSS.ID_CHARSET,\n            `${bad} edge id${plural(bad)} outside the nmtoken charset; the save fails unless sanitizeIds is \"mangle\"`,\n            column.meta.name,\n            bad,\n        );\n    }\n}\n\n/**\n * The top-level edgedefault: the override, else undirected for an undirected snapshot, else\n * directed when no written edge is undirected, else the one the importer recorded, else the\n * majority direction.\n * @param snapshot - the snapshot\n * @param folding - the pair folding\n * @param format - the resolved format options\n * @param meta - the importer's meta, or null\n * @returns the edgedefault\n */\nfunction planEdgedefault(\n    snapshot: GraphSnapshot,\n    folding: PairFolding,\n    format: FormatOptions,\n    meta: GraphmlMeta | null,\n): \"directed\" | \"undirected\" {\n    if (format.edgedefault !== null) {\n        return format.edgedefault;\n    }\n    if (!snapshot.directed) {\n        return \"undirected\";\n    }\n    let directedCount = 0;\n    let undirectedCount = 0;\n    for (let e = 0; e < snapshot.edgeCount; e++) {\n        if (folding.folded(e)) {\n            continue;\n        }\n        if (isDirectedEdge(folding, e)) {\n            directedCount++;\n        } else {\n            undirectedCount++;\n        }\n    }\n    if (undirectedCount === 0) {\n        return \"directed\";\n    }\n    const recorded = meta === null ? null : meta.edgedefault;\n    if (recorded !== null) {\n        return recorded;\n    }\n    return undirectedCount > directedCount ? \"undirected\" : \"directed\";\n}\n\n/**\n * Whether two column plans can share one for=\"all\" key.\n * @param a - one plan\n * @param b - another\n * @returns true when name, type and default agree\n */\nfunction sameKey(a: ColumnPlan, b: ColumnPlan): boolean {\n    return (\n        a.attrName === b.attrName &&\n        a.attrType === b.attrType &&\n        a.yfilesType === b.yfilesType &&\n        a.domain !== b.domain &&\n        JSON.stringify(a.column.meta.default ?? null) === JSON.stringify(b.column.meta.default ?? null)\n    );\n}\n\n/**\n * Classify the columns of one table: which are written as keys and what each loses. A label\n * column is written into the label slot (a key titled `label`, which the importer reads back\n * with the role) unless the table holds another column of that name, in which case it keeps\n * its own title and the role is lost.\n * @param table - the table\n * @param domain - its domain\n * @param notes - the notes so far (the generic name-change note of a label column that cannot take the slot is withdrawn)\n * @param note - the note recorder\n * @returns the plans of the written columns, in declaration order\n */\nfunction planTable(table: Iterable<Column>, domain: Domain, notes: LossNote[], note: NoteFn): ColumnPlan[] {\n    const plans: ColumnPlan[] = [];\n    const columns = [...table];\n    const names = new Set(columns.map((column) => column.meta.name));\n    for (const column of columns) {\n        const { meta } = column;\n        const { role, name } = meta;\n        if (isGraphicsColumn(meta)) {\n            const stale = domain === \"graph\" ? 0 : staleGraphicsRows(column, columns, domain);\n            if (stale > 0) {\n                note(\n                    GRAPHML_LOSS.YFILES_GRAPHICS_STALE,\n                    `${stale} value${plural(stale)} of ${domain} column \"${name}\" differ from the yFiles tree it was read from; only the tree is written, so they are lost`,\n                    name,\n                    stale,\n                );\n            }\n            continue;\n        }\n        if (role === \"parents\") {\n            note(\n                GRAPHML_LOSS.PARENTS_DROPPED,\n                `${domain} column \"${name}\" (parents) cannot be written: nested graphs hold one parent per node`,\n                name,\n                column.length - column.nullCount,\n            );\n            continue;\n        }\n        if (\n            role !== null &&\n            (STRUCTURAL_ROLES.has(role) || DROPPED_ROLES.has(role) || SLOT_ROLES_BY_DOMAIN[domain].has(role))\n        ) {\n            continue;\n        }\n        if (role !== null && role !== \"label\" && SLOT_ROLES.has(role)) {\n            // the slot belongs to another domain (an edge id on a node, a port on a graph)\n            withdrawNameChange(notes, name);\n            note(\n                LOSS.ROLE,\n                `${domain} column \"${name}\" (${role}) is written as a plain attribute; GraphML has no ${role} slot for a ${domain} and the role is lost`,\n                name,\n                column.length - column.nullCount,\n            );\n        }\n        const yfiles = meta.dtype === \"json\" && meta.origin?.namespace === \"yfiles\";\n        if (meta.dtype === \"json\" && !yfiles) {\n            note(\n                LOSS.JSON,\n                `${domain} column \"${name}\" holds nested values; written as JSON text, which reads back as string`,\n                name,\n                column.length - column.nullCount,\n            );\n        }\n        if (yfiles) {\n            const bad = countBadTrees(column);\n            if (bad > 0) {\n                note(\n                    GRAPHML_LOSS.YFILES_TREE,\n                    `${bad} value${plural(bad)} of yfiles column \"${name}\" ${agree(bad, \"is\", \"are\")} not XML trees; the save fails with E_COLUMN_TYPE`,\n                    name,\n                    bad,\n                );\n            }\n        }\n        const { origin } = meta;\n        const fromGraphml = origin !== null && origin.format === FORMAT;\n        let attrName: string | null = null;\n        if (!yfiles) {\n            attrName = fromGraphml && origin.title !== null ? origin.title : name;\n            if (role === \"label\" && domain !== \"graph\" && attrName !== LABEL_COLUMN) {\n                attrName = labelSlot(column, domain, names, notes, note);\n            } else if (role === null && domain !== \"graph\" && attrName === LABEL_COLUMN) {\n                note(\n                    LOSS.ROLE_ASSUMED,\n                    `${domain} column \"${name}\" has no role but is titled \"${LABEL_COLUMN}\", which the importer reads back with the label role`,\n                    name,\n                    column.length - column.nullCount,\n                );\n            }\n        }\n        plans.push({\n            column,\n            domain,\n            keyId: \"\",\n            attrType: yfiles ? null : attrTypeFor(column),\n            attrName,\n            yfilesType: yfiles ? (origin?.type ?? DEFAULT_YFILES_TYPES[domain]) : null,\n            yfiles,\n        });\n    }\n    return plans;\n}\n\n/**\n * The title a label column not named `label` is written under: the label slot when the table has\n * no other column of that name (checkCapabilities() has noted the name change), else its own\n * name with the role lost (the name-change note is withdrawn and a role note recorded).\n * @param column - the label column\n * @param domain - its domain\n * @param names - the column names of the table\n * @param notes - the notes so far\n * @param note - the note recorder\n * @returns the attr.name\n */\nfunction labelSlot(\n    column: Column,\n    domain: Domain,\n    names: ReadonlySet<string>,\n    notes: LossNote[],\n    note: NoteFn,\n): string {\n    const { name } = column.meta;\n    if (!names.has(LABEL_COLUMN)) {\n        return LABEL_COLUMN;\n    }\n    withdrawNameChange(notes, name);\n    note(\n        LOSS.ROLE,\n        `${domain} column \"${name}\" (label) is written as a plain attribute: the label slot (a key titled \"${LABEL_COLUMN}\") is taken by column \"${LABEL_COLUMN}\" and the role is lost`,\n        name,\n        column.length - column.nullCount,\n    );\n    return name;\n}\n\n/**\n * Withdraw the name-change note checkCapabilities() recorded for a role column that does not\n * take the slot after all.\n * @param notes - the notes so far\n * @param name - the column name\n */\nfunction withdrawNameChange(notes: LossNote[], name: string): void {\n    const at = notes.findIndex((n) => n.code === LOSS.COLUMN_NAME_CHANGED && n.column === name);\n    if (at >= 0) {\n        notes.splice(at, 1);\n    }\n}\n\n/**\n * The attr.type a column is declared with: the GraphML origin.type when it still describes the\n * column, else the type of the dtype (u32 / u8 as int or long, dict as string, list / json /\n * multi-component as string holding JSON text).\n * @param column - the column\n * @returns the attr.type text\n */\nfunction attrTypeFor(column: Column): string {\n    const { meta } = column;\n    const { origin } = meta;\n    const declared = origin !== null && origin.format === FORMAT && origin.type !== null ? origin.type : null;\n    if (meta.components > 1) {\n        return \"string\";\n    }\n    switch (meta.dtype) {\n        case \"bool\":\n            return \"boolean\";\n        case \"i32\":\n            return \"int\";\n        case \"f32\":\n            return \"float\";\n        case \"f64\": {\n            if (declared !== null && declared.trim().toLowerCase() === \"long\" && columnIntegral(column)) {\n                return \"long\";\n            }\n            return \"double\";\n        }\n        case \"u8\":\n            return \"int\";\n        case \"u32\":\n            return columnMax(column) <= I32_MAX ? \"int\" : \"long\";\n        case \"string\":\n            if (declared !== null && declared.trim().toLowerCase() === \"long\" && columnIntegerText(column)) {\n                // a long column read with long: \"string\" keeps its declared type, for other readers\n                return \"long\";\n            }\n            if (declared !== null && TYPE_DTYPES[declared.trim().toLowerCase()] === undefined) {\n                // an unknown declared type kept as text (W_UNKNOWN_ATTR_TYPE on import) is restored as declared\n                return declared;\n            }\n            return \"string\";\n        case \"dict\":\n        case \"list\":\n        case \"json\":\n            return \"string\";\n        default: {\n            const { dtype } = meta;\n            throw new GraphFormatError(\"E_UNSUPPORTED\", `unknown dtype ${String(dtype)}`, { dtype });\n        }\n    }\n}\n\n/**\n * Whether every set value of a string column is integer text, as a long column read with\n * `long: \"string\"` holds.\n * @param column - a string column\n * @returns true when all set values are integer text\n */\nfunction columnIntegerText(column: Column): boolean {\n    for (let r = 0; r < column.length; r++) {\n        if (column.isSet(r) && !/^[+-]?\\d+$/.test(String(column.value(r)))) {\n            return false;\n        }\n    }\n    return true;\n}\n\n/**\n * Whether every set value of a numeric column is an integer.\n * @param column - an f64 column\n * @returns true when all set values are integral\n */\nfunction columnIntegral(column: Column): boolean {\n    if (column.dtype !== \"f64\") {\n        return false;\n    }\n    const { data } = column;\n    for (let r = 0; r < column.length; r++) {\n        if (column.isSet(r) && !Number.isInteger(data[r])) {\n            return false;\n        }\n    }\n    return true;\n}\n\n/**\n * The largest set value of a u32 column.\n * @param column - a u32 column\n * @returns the maximum, 0 for an empty column\n */\nfunction columnMax(column: Column): number {\n    if (column.dtype !== \"u32\") {\n        return 0;\n    }\n    let max = 0;\n    const { data } = column;\n    for (let r = 0; r < column.length; r++) {\n        if (column.isSet(r) && data[r] > max) {\n            max = data[r];\n        }\n    }\n    return max;\n}\n\n/**\n * Whether every explicit weight is integral (so a declared int / long weight key survives).\n * @param snapshot - the snapshot\n * @param weights - the explicit weights\n * @returns true when all explicit weights are integers\n */\nfunction weightsIntegral(snapshot: GraphSnapshot, weights: ExplicitWeights): boolean {\n    for (let e = 0; e < snapshot.edgeCount; e++) {\n        if (weights.isExplicit(e) && !Number.isInteger(weights.value(e))) {\n            return false;\n        }\n    }\n    return true;\n}\n\n/**\n * How many values of a yfiles column are not serializable trees.\n * @param column - a json column\n * @returns the count\n */\nfunction countBadTrees(column: Column): number {\n    if (column.dtype !== \"json\") {\n        return 0;\n    }\n    let bad = 0;\n    for (let r = 0; r < column.length; r++) {\n        if (column.isSet(r) && treeProblem(column.values[r]) !== null) {\n            bad++;\n        }\n    }\n    return bad;\n}\n\n/**\n * Node ids that read back as another type under the canonical rule: string ids that are\n * canonical integer text, and numbers that are not safe integers.\n * @param snapshot - the snapshot\n * @returns the count\n */\nfunction countIdTypeChanges(snapshot: GraphSnapshot): number {\n    const { ids } = snapshot;\n    if (ids.kind === \"identity\" || ids.kind === \"dense\") {\n        return 0;\n    }\n    let count = 0;\n    for (let i = 0; i < ids.size; i++) {\n        const id = ids.idOf(i);\n        if (typeof id === \"string\" ? isNmtoken(id) && isCanonicalIntegerText(id) : !Number.isSafeInteger(id)) {\n            count++;\n        }\n    }\n    return count;\n}\n\n/**\n * Node ids the nmtoken charset cannot hold.\n * @param snapshot - the snapshot\n * @returns the count\n */\nfunction countUnrepresentableNodeIds(snapshot: GraphSnapshot): number {\n    const { ids } = snapshot;\n    if (ids.kind === \"identity\" || ids.kind === \"dense\") {\n        return 0;\n    }\n    let count = 0;\n    for (let i = 0; i < ids.size; i++) {\n        if (!isNmtoken(String(ids.idOf(i)))) {\n            count++;\n        }\n    }\n    return count;\n}\n\n/**\n * Edge ids that are not NMTOKENs.\n * @param column - the edge id column\n * @returns the count\n */\nfunction countBadEdgeIds(column: Column): number {\n    let bad = 0;\n    for (let e = 0; e < column.length; e++) {\n        if (column.isSet(e) && !isNmtoken(edgeIdText(column, e))) {\n            bad++;\n        }\n    }\n    return bad;\n}\n\n/**\n * The text of an edge id cell.\n * @param column - the edge id column\n * @param e - the edge\n * @returns the id as text\n */\nfunction edgeIdText(column: Column, e: number): string {\n    const value = column.value(e);\n    if (typeof value === \"string\") {\n        return value;\n    }\n    if (typeof value === \"number\") {\n        return Number.isInteger(value) ? formatInteger(value) : formatF64(value);\n    }\n    return String(value);\n}\n\n/**\n * Whether a logical edge is written as directed: never in an undirected snapshot; never for a\n * half of an expanded pair (an undirected or a mutual source edge, whose halves the resolver\n * flags directed); otherwise per the directed role column, with directed as the default.\n * @param folding - the pair folding\n * @param e - the edge\n * @returns false for a paired edge or an edge flagged undirected\n */\nfunction isDirectedEdge(folding: PairFolding, e: number): boolean {\n    return folding.mateOf(e) === INVALID_INDEX && folding.sourceDirected(e);\n}\n\n/**\n * The containment order: the children CSR over the parent column (src/children.ts), roots in\n * index order, unreachable nodes (cycles) forced to the top level.\n * @param snapshot - the snapshot\n * @returns the hierarchy\n */\nfunction planHierarchy(snapshot: GraphSnapshot): Hierarchy {\n    const parent = snapshot.nodes.byRole(\"parent\");\n    const csr = childrenCsr(snapshot, { column: parent !== null && parent.dtype === \"u32\" ? parent : null });\n    const walk = csr.depthFirst();\n    // the top-level nodes in written order: the roots, then the cycle members forced out\n    const roots = walk.order.filter((u) => walk.depth[u] === 0);\n    return {\n        parent: csr.column,\n        roots,\n        childStart: csr.rowPtr,\n        childList: csr.children,\n        reordered: walk.reordered,\n        unreachable: csr.unreachable,\n    };\n}\n\n// ============================================================ writing\n\n/**\n * The text of one set cell for a `<data>` element or a `<default>`.\n * @param column - the column\n * @param row - the row\n * @param attrType - the declared attr.type\n * @returns the text\n */\nfunction cellText(column: Column, row: number, attrType: string | null): string {\n    if (column.meta.components > 1) {\n        const value = column.value(row);\n        return JSON.stringify(Array.from(value as ArrayLike<number>));\n    }\n    switch (column.dtype) {\n        case \"bool\":\n            return column.value(row) === true ? \"true\" : \"false\";\n        case \"i32\":\n        case \"u32\":\n        case \"u8\":\n            return String(column.data[row]);\n        case \"f32\":\n            return formatF32(column.data[row]);\n        case \"f64\": {\n            const value = column.data[row];\n            return (attrType === \"long\" || attrType === \"int\") && Number.isInteger(value)\n                ? formatInteger(value)\n                : formatF64(value);\n        }\n        case \"string\":\n            return column.valueAt(row);\n        case \"dict\":\n            return column.dictionary[column.codes[row]];\n        case \"list\":\n            return JSON.stringify(Array.from(column.sliceOf(row)));\n        case \"json\":\n            return JSON.stringify(column.values[row]) ?? \"\";\n        default: {\n            const dtype: never = column;\n            throw new GraphFormatError(\"E_UNSUPPORTED\", `unknown dtype ${String(dtype)}`, {});\n        }\n    }\n}\n\n/**\n * The text of a declared default.\n * @param column - the column\n * @param attrType - the declared attr.type\n * @returns the text, or null when the column has no default\n */\nfunction defaultText(column: Column, attrType: string | null): string | null {\n    const value = column.meta.default;\n    if (value === undefined) {\n        return null;\n    }\n    switch (typeof value) {\n        case \"boolean\":\n            return value ? \"true\" : \"false\";\n        case \"number\":\n            if (column.dtype === \"f32\") {\n                return formatF32(value);\n            }\n            return (attrType === \"long\" || attrType === \"int\") && Number.isInteger(value)\n                ? formatInteger(value)\n                : formatF64(value);\n        case \"string\":\n            return value;\n        default:\n            return JSON.stringify(value) ?? \"\";\n    }\n}\n\n/**\n * Write one `<data>` element.\n * @param plan - the column plan\n * @param row - the row\n * @param indent - the indentation\n * @param out - receives the parts\n */\nfunction writeData(plan: ColumnPlan, row: number, indent: string, out: string[]): void {\n    const { column } = plan;\n    if (!column.isSet(row)) {\n        return;\n    }\n    if (plan.yfiles && column.dtype === \"json\") {\n        writeTreeData(plan.keyId, column.values[row], indent, out);\n        return;\n    }\n    out.push(`\\n${indent}<data key=\"${plan.keyId}\">${escapeXmlText(cellText(column, row, plan.attrType))}</data>`);\n}\n\n/**\n * Write a `<data>` holding a yfiles tree.\n * @param keyId - the key id\n * @param value - the tree\n * @param indent - the indentation\n * @param out - receives the parts\n */\nfunction writeTreeData(keyId: string, value: unknown, indent: string, out: string[]): void {\n    if (value === null || typeof value !== \"object\" || Array.isArray(value)) {\n        const parts: string[] = [];\n        writeXmlTree(value, indent, parts);\n        out.push(`\\n${indent}<data key=\"${keyId}\">${parts.join(\"\")}</data>`);\n        return;\n    }\n    out.push(`\\n${indent}<data key=\"${keyId}\">`);\n    writeXmlTree(value, `${indent}  `, out);\n    out.push(`\\n${indent}</data>`);\n}\n\n/**\n * Append the `<default>` element of a key.\n * @param key - the key\n * @param column - the key's column\n * @param inner - the indentation of the element\n * @param parts - where to append\n */\nfunction pushDefault(key: KeyPlan, column: Column, inner: string, parts: string[]): void {\n    if (key.yfilesType === null) {\n        parts.push(`\\n${inner}<default>${escapeXmlText(defaultText(column, key.attrType) ?? \"\")}</default>`);\n        return;\n    }\n    const value = column.meta.default;\n    if (value !== null && typeof value === \"object\" && !Array.isArray(value)) {\n        parts.push(`\\n${inner}<default>`);\n        writeXmlTree(value, `${inner}  `, parts);\n        parts.push(`\\n${inner}</default>`);\n    } else {\n        const tree: string[] = [];\n        writeXmlTree(value, inner, tree);\n        parts.push(`\\n${inner}<default>${tree.join(\"\")}</default>`);\n    }\n}\n\n/**\n * The `<key>` element of a plan.\n * @param key - the key plan\n * @param indent - the indentation\n * @returns the element text\n */\nfunction keyElement(key: KeyPlan, indent: string): string {\n    const domain = key.domains.length === 3 ? \"all\" : key.domains[0];\n    let text = `${indent}<key id=\"${escapeXmlAttribute(key.id)}\" for=\"${domain}\"`;\n    if (key.attrName !== null) {\n        text += ` attr.name=\"${escapeXmlAttribute(key.attrName)}\"`;\n    }\n    if (key.attrType !== null) {\n        text += ` attr.type=\"${escapeXmlAttribute(key.attrType)}\"`;\n    }\n    if (key.yfilesType !== null) {\n        // a yFiles 3 key is identified by its attr.uri, which the importer keeps as the column's type\n        const uri = key.yfilesType.includes(\"://\");\n        text += ` ${uri ? \"y:attr.uri\" : \"yfiles.type\"}=\"${escapeXmlAttribute(key.yfilesType)}\"`;\n    }\n    const { column } = key;\n    const desc = column?.meta.extra.desc;\n    const hasDefault = column?.meta.default !== undefined;\n    if (column === null || (typeof desc !== \"string\" && !hasDefault)) {\n        return `${text}/>\\n`;\n    }\n    const parts: string[] = [`${text}>`];\n    const inner = `${indent}  `;\n    if (typeof desc === \"string\") {\n        parts.push(`\\n${inner}<desc>${escapeXmlText(desc)}</desc>`);\n    }\n    if (hasDefault) {\n        pushDefault(key, column, inner, parts);\n    }\n    parts.push(`\\n${indent}</key>\\n`);\n    return parts.join(\"\");\n}\n\n/**\n * Sanitised edge ids: NMTOKENs as they are; the rest refused or mangled per sanitizeIds.\n * @param column - the edge id column, or null\n * @param mode - the resolved sanitizeIds option\n * @param edgeCount - the edge count\n * @returns the id text per edge (null for edges without one)\n */\nfunction sanitizeEdgeIds(column: Column | null, mode: \"error\" | \"mangle\", edgeCount: number): (string | null)[] {\n    const out: (string | null)[] = new Array<string | null>(edgeCount).fill(null);\n    if (column === null) {\n        return out;\n    }\n    const used = new Set<string>();\n    const bad: number[] = [];\n    for (let e = 0; e < edgeCount; e++) {\n        if (!column.isSet(e)) {\n            continue;\n        }\n        const text = edgeIdText(column, e);\n        if (isNmtoken(text)) {\n            out[e] = text;\n            used.add(text);\n        } else {\n            bad.push(e);\n        }\n    }\n    if (bad.length > 0 && mode === \"error\") {\n        throw new GraphFormatError(\n            \"E_INVALID_ID\",\n            `${bad.length} edge id${plural(bad.length)} ${agree(bad.length, \"is\", \"are\")} not XML name tokens (first: ${JSON.stringify(edgeIdText(column, bad[0]))} at edge ${bad[0]}); pass sanitizeIds: \"mangle\" to rewrite them`,\n            { reason: \"charset\", charset: \"nmtoken\", count: bad.length, edge: bad[0] },\n        );\n    }\n    for (const e of bad) {\n        const base = mangleNmtoken(edgeIdText(column, e));\n        let candidate = base;\n        for (let k = 2; used.has(candidate); k++) {\n            candidate = `${base}_${k}`;\n        }\n        used.add(candidate);\n        out[e] = candidate;\n    }\n    return out;\n}\n\n/**\n * The document as text parts.\n * @param snapshot - the snapshot\n * @param plan - the plan\n * @yields one element (or a group of small ones) at a time\n * @returns nothing\n */\nfunction* writeGraphml(snapshot: GraphSnapshot, plan: Plan): Generator<string, void, undefined> {\n    const ids: SanitizedIds = sanitizeIds(snapshot, \"nmtoken\", plan.options.sanitizeIds);\n    const edgeIds = sanitizeEdgeIds(plan.edgeIdColumn, plan.options.sanitizeIds, snapshot.edgeCount);\n    const i1 = plan.pretty ? \"  \" : \"\";\n    const i2 = plan.pretty ? \"    \" : \"\";\n    const i3 = plan.pretty ? \"      \" : \"\";\n    const step = plan.pretty ? \"  \" : \"\";\n\n    yield '<?xml version=\"1.0\" encoding=\"UTF-8\"?>\\n';\n    yield rootElement(plan);\n\n    for (const key of plan.keys) {\n        yield keyElement(key, i1);\n    }\n    if (plan.originalIdKey !== null) {\n        yield `${i1}<key id=\"${plan.originalIdKey}\" for=\"node\" attr.name=\"${ORIGINAL_ID_ATTRIBUTE}\" attr.type=\"string\"/>\\n`;\n    }\n\n    const graphId = plan.meta?.graphId ?? \"G\";\n    yield `${i1}<graph id=\"${escapeXmlAttribute(graphId)}\" edgedefault=\"${plan.edgedefault}\">`;\n    const { description } = snapshot.meta;\n    if (description !== null) {\n        yield `\\n${i2}<desc>${escapeXmlText(description)}</desc>`;\n    }\n    const graphParts: string[] = [];\n    for (const column of plan.graphColumns) {\n        writeData(column, 0, i2, graphParts);\n    }\n    if (graphParts.length > 0) {\n        yield graphParts.join(\"\");\n    }\n\n    // nodes in containment order, children nested under their parent\n    const { hierarchy } = plan;\n    const nested = hierarchy.childList.length > 0;\n    const walk: SubtreeWalk = {\n        stackNode: [],\n        stackCursor: [],\n        written: nested ? new Uint8Array(snapshot.nodeCount) : null,\n    };\n    for (const rootNode of hierarchy.roots) {\n        yield* writeNodeSubtree(rootNode, plan, ids, i2, step, walk);\n    }\n\n    // edges: primaries only, in index order\n    const list = snapshot.edgeList();\n    for (let e = 0; e < snapshot.edgeCount; e++) {\n        if (!plan.folding.folded(e)) {\n            const start = edgeStartTag(snapshot, plan, e, String(ids.idAt(list.src[e])), String(ids.idAt(list.dst[e])));\n            yield edgeElement(plan, e, edgeIds[e], start, [i2, i3]);\n        }\n    }\n\n    yield `\\n${i1}</graph>\\n</graphml>\\n`;\n}\n\n/**\n * The opening `<graphml>` tag with its namespaces: the kept ones, yFiles' where graphics or yFiles columns are written,\n * and XML Schema's for the schema location.\n * @param plan - the plan\n * @returns the tag\n */\nfunction rootElement(plan: Plan): string {\n    const namespaces: Record<string, string> = { ...plan.meta?.namespaces };\n    const yfilesColumns =\n        plan.nodeColumns.some((c) => c.yfiles) ||\n        plan.edgeColumns.some((c) => c.yfiles) ||\n        plan.graphColumns.some((c) => c.yfiles);\n    if (\n        plan.yedGraphics === true ||\n        (yfilesColumns &&\n            !Object.values(namespaces).includes(YFILES_NAMESPACE) &&\n            // a yFiles 3 file binds `y` to its own namespace, which its kept trees are written in\n            namespaces.y === undefined)\n    ) {\n        namespaces.y = YFILES_NAMESPACE;\n    }\n    if (!Object.values(namespaces).includes(XSI_NAMESPACE)) {\n        namespaces.xsi = XSI_NAMESPACE;\n    }\n    let root = `<graphml xmlns=\"${GRAPHML_NAMESPACE}\"`;\n    for (const [prefix, uri] of Object.entries(namespaces)) {\n        root += ` xmlns:${prefix}=\"${escapeXmlAttribute(uri)}\"`;\n    }\n    const xsiPrefix = Object.entries(namespaces).find(([, uri]) => uri === XSI_NAMESPACE)?.[0] ?? \"xsi\";\n    return `${root} ${xsiPrefix}:schemaLocation=\"${SCHEMA_LOCATION}\">\\n`;\n}\n\n/**\n * An edge's attributes after `<edge`: its source and target, a `directed` that differs from the default, its ports.\n * @param snapshot - the snapshot\n * @param plan - the plan\n * @param e - the edge\n * @param source - the source's written id\n * @param target - the target's written id\n * @returns the attribute text\n */\nfunction edgeStartTag(snapshot: GraphSnapshot, plan: Plan, e: number, source: string, target: string): string {\n    let text = ` source=\"${escapeXmlAttribute(source)}\" target=\"${escapeXmlAttribute(target)}\"`;\n    const directed = snapshot.directed && isDirectedEdge(plan.folding, e);\n    if (directed !== (plan.edgedefault === \"directed\")) {\n        text += ` directed=\"${directed ? \"true\" : \"false\"}\"`;\n    }\n    const sourcePort = portText(plan.sourcePortColumn, e);\n    if (sourcePort !== null) {\n        text += ` sourceport=\"${escapeXmlAttribute(sourcePort)}\"`;\n    }\n    const targetPort = portText(plan.targetPortColumn, e);\n    if (targetPort !== null) {\n        text += ` targetport=\"${escapeXmlAttribute(targetPort)}\"`;\n    }\n    return text;\n}\n\n/**\n * One `<edge>` element with its weight and data.\n * @param plan - the plan\n * @param e - the edge\n * @param id - its written id, or null\n * @param start - its attributes after the id\n * @param indents - the edge's indentation and its data's\n * @returns the element text\n */\nfunction edgeElement(\n    plan: Plan,\n    e: number,\n    id: string | null,\n    start: string,\n    indents: readonly [string, string],\n): string {\n    const [i2, i3] = indents;\n    const parts: string[] = [`\\n${i2}<edge`];\n    if (id !== null) {\n        parts.push(` id=\"${escapeXmlAttribute(id)}\"`);\n    }\n    parts.push(start);\n    const open = parts.length;\n    if (plan.weight !== null) {\n        const { keyId, attrType } = plan.weight;\n        const weight = plan.weight.weights.text(e, attrType === \"int\" || attrType === \"long\");\n        if (weight !== null) {\n            parts.push(`\\n${i3}<data key=\"${keyId}\">${escapeXmlText(weight)}</data>`);\n        }\n    }\n    for (const column of plan.edgeColumns) {\n        writeData(column, e, i3, parts);\n    }\n    if (parts.length === open) {\n        parts.push(\"/>\");\n    } else {\n        parts.splice(open, 0, \">\");\n        parts.push(`\\n${i2}</edge>`);\n    }\n    return parts.join(\"\");\n}\n\n/**\n * The text of a port reference cell.\n * @param column - the sourcePort / targetPort column, or null\n * @param e - the edge\n * @returns the port name, or null when unset\n */\nfunction portText(column: Column | null, e: number): string | null {\n    if (!column?.isSet(e)) {\n        return null;\n    }\n    const value = column.value(e);\n    return typeof value === \"string\" ? value : String(value);\n}\n\n/** The state a subtree walk reuses from one top-level node to the next. */\ninterface SubtreeWalk {\n    /** A reusable stack of open nodes. */\n    readonly stackNode: number[];\n    /** A reusable stack of child cursors. */\n    readonly stackCursor: number[];\n    /** Nodes already written (null when nothing is nested). */\n    readonly written: Uint8Array | null;\n}\n\n/**\n * Write a top-level node and, nested, every node contained in it (iteratively, so a deep chain\n * cannot overflow the call stack).\n * @param root - the top-level node\n * @param plan - the plan\n * @param ids - the sanitised ids\n * @param indent - the indentation of top-level nodes\n * @param step - one indentation step\n * @param walk - the reusable walk state\n * @yields the node elements\n * @returns nothing\n */\nfunction* writeNodeSubtree(\n    root: number,\n    plan: Plan,\n    ids: SanitizedIds,\n    indent: string,\n    step: string,\n    walk: SubtreeWalk,\n): Generator<string, void, undefined> {\n    const { stackNode, stackCursor, written } = walk;\n    const { hierarchy } = plan;\n    const hasChildren = (u: number): boolean => hierarchy.childStart[u + 1] > hierarchy.childStart[u];\n    const openNode = (u: number, depth: number): string => {\n        const pad = indent + step.repeat(depth * 2);\n        const parts: string[] = [`\\n${pad}<node id=\"${escapeXmlAttribute(String(ids.idAt(u)))}\"`];\n        const open = parts.length;\n        if (plan.originalIdKey !== null && ids.isChanged(u)) {\n            parts.push(\n                `\\n${pad}${step}<data key=\"${plan.originalIdKey}\">${escapeXmlText(String(ids.originalAt(u)))}</data>`,\n            );\n        }\n        for (const column of plan.nodeColumns) {\n            writeData(column, u, pad + step, parts);\n        }\n        if (hasChildren(u)) {\n            parts.splice(open, 0, \">\");\n            const graphId = `${String(ids.idAt(u))}:`;\n            parts.push(`\\n${pad}${step}<graph id=\"${escapeXmlAttribute(graphId)}\" edgedefault=\"${plan.edgedefault}\">`);\n            return parts.join(\"\");\n        }\n        if (parts.length === open) {\n            parts.push(\"/>\");\n        } else {\n            parts.splice(open, 0, \">\");\n            parts.push(`\\n${pad}</node>`);\n        }\n        return parts.join(\"\");\n    };\n    const closeNode = (depth: number): string => {\n        const pad = indent + step.repeat(depth * 2);\n        return `\\n${pad}${step}</graph>\\n${pad}</node>`;\n    };\n    if (written !== null) {\n        written[root] = 1;\n    }\n    yield openNode(root, 0);\n    if (!hasChildren(root)) {\n        return;\n    }\n    stackNode.push(root);\n    stackCursor.push(hierarchy.childStart[root]);\n    while (stackNode.length > 0) {\n        const top = stackNode.length - 1;\n        const u = stackNode[top];\n        const cursor = stackCursor[top];\n        if (cursor >= hierarchy.childStart[u + 1]) {\n            stackNode.pop();\n            stackCursor.pop();\n            yield closeNode(top);\n            continue;\n        }\n        stackCursor[top] = cursor + 1;\n        const v = hierarchy.childList[cursor];\n        if (written !== null && written[v] === 1) {\n            continue;\n        }\n        if (written !== null) {\n            written[v] = 1;\n        }\n        yield openNode(v, top + 1);\n        if (hasChildren(v)) {\n            stackNode.push(v);\n            stackCursor.push(hierarchy.childStart[v]);\n        }\n    }\n}\n\n/**\n * The GraphML exporter.\n * @category Built-in formats\n */\nexport const graphmlExporter: GraphExporter<GraphmlExportOptions> = Object.freeze({\n    format: FORMAT,\n    options: Object.freeze([\"edgedefault\", \"pretty\"]),\n    capabilities: CAPABILITIES,\n    styles: Object.freeze({ capabilities: GRAPHML_STYLE_CAPABILITIES }),\n    /**\n     * Pre-flight: every loss the export would incur.\n     * @param snapshot - the snapshot\n     * @param options - format-specific and common options\n     * @returns the notes\n     */\n    check(snapshot: GraphSnapshot, options?: GraphmlWriteOptions): readonly LossNote[] {\n        const { plan, styled } = prepare(snapshot, options);\n        return Object.freeze([...plan.notes, ...(styled?.notes ?? [])]);\n    },\n    /**\n     * Write the document as UTF-8 chunks.\n     * @param snapshot - the snapshot\n     * @param options - format-specific and common options\n     * @returns the chunks\n     */\n    export(snapshot: GraphSnapshot, options?: GraphmlWriteOptions): AsyncIterable<Uint8Array> {\n        const { plan, written } = prepare(snapshot, options);\n        return encodeChunks(writeGraphml(written, plan));\n    },\n    /**\n     * Write the document as one string.\n     * @param snapshot - the snapshot\n     * @param options - format-specific and common options\n     * @returns the document\n     */\n    exportToString(snapshot: GraphSnapshot, options?: GraphmlWriteOptions): Promise<string> {\n        const { plan, written } = prepare(snapshot, options);\n        return joinText(writeGraphml(written, plan));\n    },\n});\n\n/**\n * The plan of an export, with styles: the graph to write with yEd graphics in place of its yFiles columns.\n * @param snapshot - the snapshot\n * @param options - format-specific and common options\n * @returns the plan, the graph to write and the styled export (null without styles)\n */\nfunction prepare(\n    snapshot: GraphSnapshot,\n    options: GraphmlWriteOptions | undefined,\n): { plan: Plan; written: GraphSnapshot; styled: ReturnType<typeof graphmlStyledExport> } {\n    const styled = graphmlStyledExport(snapshot, options?.styles);\n    const written = styled?.snapshot ?? snapshot;\n    const plan = planExport(written, resolveExportOptions(options), resolveFormatOptions(options), styled !== null);\n    if (styled === null) {\n        return { plan, written, styled };\n    }\n    // the yEd graphics carry each node's position in its y:Geometry, so the position column is not lost\n    const position = written.nodes.byRole(\"position\")?.meta.name;\n    const notes = plan.notes.filter((n) => n.code !== LOSS.POSITIONS || n.column !== position);\n    return { plan: { ...plan, notes, yedGraphics: true }, written, styled };\n}\n","/**\n * yFiles 3 styles (yFiles for HTML, yEd Live): the per-element style objects of the `NodeStyle`, `EdgeStyle`,\n * `NodeLabels`, `EdgeLabels`, `NodeGeometry` and `EdgeGeometry` keys, inline or by reference to the graph's `SharedData`, read into\n * the neutral style vocabulary. References are resolved by value with a depth limit; a reference that is circular\n * or deeper than the limit is one `W_STYLE_REFERENCE_CYCLE` note, never a hang.\n */\n\nimport type { GraphSnapshot } from \"@graphty/graph-format\";\n\nimport { type BendPoint, canonBends, canonNodeOffsets } from \"../../styles/canon/bends.js\";\nimport { canonColor, colorOpacity } from \"../../styles/canon/color.js\";\nimport { canonEnum } from \"../../styles/canon/enums.js\";\nimport { canonNumber } from \"../../styles/canon/number.js\";\nimport { MAX_STYLE_VALUE_LENGTH, noteAt } from \"../../styles/canon/site.js\";\nimport { canonText } from \"../../styles/canon/text.js\";\nimport { STYLE_ISSUE } from \"../../styles/codes.js\";\nimport type { StyleNotes } from \"../../styles/notes.js\";\nimport { plainCell } from \"../../styles/plan/resolve.js\";\nimport type { StyleDialect, StyleTarget, StyleWorkBudget } from \"../../styles/types.js\";\nimport {\n    configurationOutline,\n    isTree,\n    localOf,\n    type PutValue,\n    type SiteOf,\n    treeAttr,\n    treeChild,\n    treeChildren,\n    treeText,\n    valueColumns,\n    type YedOutline,\n    type YedRead,\n} from \"./styles-yed.js\";\n\n/** How deep a chain of shared references is followed. */\nconst MAX_REFERENCE_DEPTH = 16;\n\n/** A style object: its element's local name and the element. */\ninterface StyleObject {\n    readonly tag: string;\n    readonly e: unknown;\n}\n\n/** `{x:Null}`: a property explicitly set to nothing. */\nconst NULL = Symbol(\"x:Null\");\n\n/** A property value resolved through references. */\ntype Resolved = StyleObject | string | typeof NULL | null;\n\n/** A paint: a color in a dialect, `{x:Null}`, or nothing. */\ntype Paint = { readonly raw: string; readonly dialect: StyleDialect } | typeof NULL | null;\n\n/** A `{y:GraphMLReference key}` markup extension, whatever the prefix. */\nconst REFERENCE = /^\\{\\s*[\\w.-]*:?GraphMLReference\\s+([^\\s}]+)\\s*\\}$/;\n\n/** A `{x:Null}` markup extension. */\nconst NULL_MARKUP = /^\\{\\s*[\\w.-]*:?Null\\s*\\}$/;\n\n/** The yFiles key types the reader reads, by the last segment of their `attr.uri`. */\ntype KeyKind = \"NodeStyle\" | \"EdgeStyle\" | \"NodeLabels\" | \"EdgeLabels\" | \"NodeGeometry\" | \"EdgeGeometry\" | \"SharedData\";\nconst KINDS: ReadonlySet<string> = new Set([\n    \"NodeStyle\",\n    \"EdgeStyle\",\n    \"NodeLabels\",\n    \"EdgeLabels\",\n    \"NodeGeometry\",\n    \"EdgeGeometry\",\n]);\n\n/**\n * The kind of a yFiles 3 column, from the `attr.uri` the importer keeps as its origin type.\n * @param type - the origin type\n * @returns the kind, or null\n */\nfunction keyKind(type: string | null | undefined): KeyKind | null {\n    if (typeof type !== \"string\" || !type.includes(\"://\")) {\n        return null;\n    }\n    const last = type.slice(type.lastIndexOf(\"/\") + 1);\n    return KINDS.has(last) || last === \"SharedData\" ? (last as KeyKind) : null;\n}\n\n/**\n * The columns of a table by kind.\n * @param table - the table\n * @returns kind to column name\n */\nfunction columnsByKind(table: GraphSnapshot[\"nodes\"]): Map<KeyKind, string> {\n    const out = new Map<KeyKind, string>();\n    for (const col of table) {\n        const kind =\n            col.dtype === \"json\" && col.meta.origin?.namespace === \"yfiles\" ? keyKind(col.meta.origin.type) : null;\n        if (kind !== null && !out.has(kind)) {\n            out.set(kind, col.meta.name);\n        }\n    }\n    return out;\n}\n\n/** Resolves references against the graph's shared data, counting the ones it gives up on. */\nclass References {\n    private readonly shared = new Map<string, StyleObject>();\n\n    /** The references given up on: circular or deeper than the limit. */\n    cycles = 0;\n\n    /**\n     * Collects the shared objects of the graph's `SharedData` value.\n     * @param data - the `<data>` content of the SharedData key\n     */\n    constructor(data: unknown) {\n        for (const sd of treeChildren(data, \"SharedData\")) {\n            if (isTree(sd)) {\n                this.collect(sd);\n            }\n        }\n    }\n\n    /**\n     * Collects the shared objects of one SharedData element: the first of each key wins.\n     * @param sd - the element\n     */\n    private collect(sd: Record<string, unknown>): void {\n        for (const key of Object.keys(sd).filter((k) => !k.startsWith(\"@_\") && k !== \"#text\")) {\n            for (const e of treeChildren(sd, localOf(key))) {\n                const name = sharedKey(e);\n                if (name !== null && !this.shared.has(name)) {\n                    this.shared.set(name, { tag: localOf(key), e });\n                }\n            }\n        }\n    }\n\n    /**\n     * Whether a walk has gone too deep; counts it once when it has.\n     * @param depth - the walk's depth\n     * @returns true past the limit\n     */\n    tooDeep(depth: number): boolean {\n        if (depth > MAX_REFERENCE_DEPTH) {\n            this.cycles++;\n            return true;\n        }\n        return false;\n    }\n\n    /**\n     * A style object, following a `<y:GraphMLReference ResourceKey>` element to what it names.\n     * @param tag - the element's local name\n     * @param e - the element\n     * @returns the object, or null when the reference names nothing\n     */\n    object(tag: string, e: unknown): StyleObject | null {\n        if (tag === \"GraphMLReference\") {\n            return this.shared.get(treeAttr(e, \"ResourceKey\") ?? \"\") ?? null;\n        }\n        return { tag, e };\n    }\n\n    /**\n     * The first child element of a property element, as a style object.\n     * @param d - the property element (or a `<data>` content)\n     * @returns the object, or null\n     */\n    first(d: unknown): StyleObject | null {\n        if (!isTree(d)) {\n            return null;\n        }\n        for (const key of Object.keys(d)) {\n            if (!key.startsWith(\"@_\") && key !== \"#text\") {\n                return this.object(localOf(key), treeChildren(d, localOf(key))[0]);\n            }\n        }\n        return null;\n    }\n\n    /**\n     * A property value resolved through references: a style object, text, `{x:Null}` or nothing.\n     * @param v - an attribute's text or a property element\n     * @param depth - the walk's depth\n     * @returns the resolved value\n     */\n    deref(v: unknown, depth = 0): Resolved {\n        if (v === undefined || v === null || this.tooDeep(depth)) {\n            return null;\n        }\n        if (typeof v === \"object\") {\n            return this.first(v);\n        }\n        if (typeof v !== \"string\") {\n            return null;\n        }\n        const t = v.trim();\n        if (t.length > MAX_STYLE_VALUE_LENGTH) {\n            return t;\n        }\n        if (NULL_MARKUP.test(t)) {\n            return NULL;\n        }\n        const m = REFERENCE.exec(t);\n        if (m !== null) {\n            return this.shared.get(m[1]) ?? null;\n        }\n        return t;\n    }\n}\n\n/**\n * The `x:Key` of a shared object.\n * @param e - the element\n * @returns the key, or null\n */\nfunction sharedKey(e: unknown): string | null {\n    if (!isTree(e)) {\n        return null;\n    }\n    for (const key of Object.keys(e)) {\n        if (key.startsWith(\"@_\") && localOf(key.slice(2)) === \"Key\") {\n            const value = e[key];\n            return typeof value === \"string\" ? value : null;\n        }\n    }\n    return null;\n}\n\n/**\n * A property of a style object: its attribute, or its `<Tag.property>` child element.\n * @param st - the style object\n * @param name - the property name\n * @returns the attribute text, the property element, or undefined\n */\nfunction prop(st: StyleObject, name: string): unknown {\n    const attr = treeAttr(st.e, name);\n    if (attr !== undefined) {\n        return attr;\n    }\n    return treeChild(st.e, `${st.tag}.${name}`);\n}\n\n/**\n * A paint: a color constant or `#AARRGGBB` in the yFiles 3 dialect, a CSS color, the first stop of a gradient\n * (with a note), or `{x:Null}`.\n * @param refs - the references\n * @param v - the property value\n * @param gradient - called when the paint is a gradient\n * @param depth - the walk's depth\n * @returns the paint\n */\nfunction paintOf(refs: References, v: unknown, gradient: (() => void) | null, depth = 0): Paint {\n    if (refs.tooDeep(depth)) {\n        return null;\n    }\n    const x = refs.deref(v, depth);\n    if (x === null || x === NULL) {\n        return x;\n    }\n    if (typeof x === \"string\") {\n        return { raw: x, dialect: \"yfiles3\" };\n    }\n    const { tag } = x;\n    if (tag === \"SolidColorFill\") {\n        return paintOf(refs, prop(x, \"color\"), gradient, depth + 1);\n    }\n    if (tag === \"Color\") {\n        return paintOf(refs, treeAttr(x.e, \"value\"), gradient, depth + 1);\n    }\n    if (tag === \"CssFill\") {\n        const css = treeAttr(x.e, \"cssString\");\n        return css === undefined ? null : { raw: css, dialect: \"css\" };\n    }\n    if (tag.endsWith(\"Gradient\")) {\n        gradient?.();\n        const stop =\n            treeChildren(x.e, \"GradientStop\")[0] ??\n            treeChildren(treeChild(x.e, `${tag}.GradientStops`), \"GradientStop\")[0];\n        return stop === undefined ? null : paintOf(refs, treeAttr(stop, \"color\"), null, depth + 1);\n    }\n    if (tag === \"Stroke\") {\n        return paintOf(refs, prop(x, \"fill\"), gradient, depth + 1);\n    }\n    return null;\n}\n\n/** A stroke's color, width and line style. */\ninterface Stroke {\n    readonly color: Paint;\n    readonly width: unknown;\n    readonly line: string;\n}\n\n/** yFiles 3's dash style names. */\nconst DASHES: ReadonlyMap<string, string> = new Map([\n    [\"solid\", \"solid\"],\n    [\"dash\", \"dashed\"],\n    [\"dot\", \"dotted\"],\n    [\"dashdot\", \"dash-dot\"],\n    [\"dashdotdot\", \"dash-dot\"],\n]);\n\n/**\n * A stroke: a `Stroke` object, a color written as a stroke, or `{x:Null}`.\n * @param refs - the references\n * @param v - the property value\n * @returns the stroke, `{x:Null}`, or null\n */\nfunction strokeOf(refs: References, v: unknown): Stroke | typeof NULL | null {\n    const x = refs.deref(v);\n    if (x === null || x === NULL) {\n        return x;\n    }\n    if (typeof x === \"string\" || x.tag !== \"Stroke\") {\n        return { color: paintOf(refs, v, null), width: 1, line: \"solid\" };\n    }\n    let line = \"solid\";\n    const d = refs.deref(prop(x, \"dashStyle\"), 1);\n    if (typeof d === \"string\") {\n        const lower = d.slice(0, MAX_STYLE_VALUE_LENGTH).toLowerCase().replaceAll(\"_\", \"\");\n        line = DASHES.get(lower) ?? `other:${lower}`;\n    } else if (d !== null && d !== NULL) {\n        // a DashStyle object: two numbers dash or dot, four dash-dot\n        const dashes = (treeAttr(d.e, \"dashes\") ?? \"\")\n            .slice(0, MAX_STYLE_VALUE_LENGTH)\n            .trim()\n            .split(/[\\s,]+/)\n            .map(Number)\n            .filter(Number.isFinite);\n        if (dashes.length === 2) {\n            line = dashes[0] <= 1 ? \"dotted\" : \"dashed\";\n        } else if (dashes.length === 4) {\n            line = \"dash-dot\";\n        } else if (dashes.length > 0) {\n            line = `other:dashes ${dashes.slice(0, 8).join(\" \")}`;\n        }\n    }\n    const w = prop(x, \"thickness\");\n    return { color: paintOf(refs, prop(x, \"fill\"), null), width: typeof w === \"string\" ? w : 1, line };\n}\n\n/**\n * Writes a paint into a color property, its alpha into the property's opacity where it has one.\n * @param pt - the paint\n * @param property - the color property\n * @param opacity - its opacity property, or null\n * @param put - receives the values\n * @param at - the sites\n */\nfunction putPaint(pt: Paint, property: string, opacity: string | null, put: PutValue, at: SiteOf): void {\n    if (pt === null || pt === NULL) {\n        return;\n    }\n    const c = canonColor(pt.raw, pt.dialect, at(property));\n    if (c === null) {\n        return;\n    }\n    put(property, c.color);\n    const alpha = colorOpacity(c, null, at(property), opacity !== null);\n    if (opacity !== null) {\n        put(opacity, alpha);\n    }\n}\n\n/** yFiles' black, the documented default color of the 2.6 Bevel, ShinyPlate and Panel styles. */\nconst BLACK = \"#FF000000\";\n\n/** The demos' FlowchartNodeStyle defaults (yfiles-for-html-demos v2.6, FlowchartStyle.ts): fill rgb(183, 201, 227). */\nconst FLOWCHART_FILL = \"#FFB7C9E3\";\n\n/**\n * yFiles for HTML 2.6 ShapeNodeShape names the neutral shapes do not spell, as the shape yFiles documents them as:\n * SHEARED_RECTANGLE sheared to the right and SHEARED_RECTANGLE2 to the left, TRAPEZ smaller at the bottom and TRAPEZ2\n * at the top, TRIANGLE2 pointing to the bottom, FAT_ARROW an arrow pointing to the right and FAT_ARROW2 to the left\n * (ShapeNodeShape API docs). A mirrored or turned shape is the polygon of its corners (`x,y` fractions of the half\n * sizes, y up). STAR5_UP is a star; PILL, a stadium, is a rectangle with half-circle ends.\n */\nconst SHAPES_26: ReadonlyMap<string, YedOutline> = new Map<string, YedOutline>([\n    [\"sheared-rectangle\", { shape: \"parallelogram\" }],\n    [\"sheared-rectangle2\", { shape: \"polygon\", points: \"-0.5,-1 1,-1 0.5,1 -1,1\" }],\n    [\"trapez\", { shape: \"polygon\", points: \"-0.5,-1 0.5,-1 1,1 -1,1\" }],\n    [\"trapez2\", { shape: \"trapezoid\" }],\n    [\"star5-up\", { shape: \"star\" }],\n    [\"triangle2\", { shape: \"polygon\", points: \"-1,1 0,-1 1,1\" }],\n    [\"fat-arrow\", { shape: \"polygon\", points: \"-1,-1 0.6,-1 1,0 0.6,1 -1,1 -0.6,0\" }],\n    [\"fat-arrow2\", { shape: \"polygon\", points: \"-0.6,-1 1,-1 0.6,0 1,1 -0.6,1 -1,0\" }],\n    [\"pill\", { shape: \"round-rectangle\" }],\n]);\n\n/** ShapeNodeStyle's ROUND_RECTANGLE corner size (ShapeNodeShape API docs: \"The corner size is 10\"). */\nconst ROUND_RECTANGLE_CORNER = 10;\n\n/** A node's size from its NodeGeometry, where it has one. */\ninterface Size {\n    readonly width: number;\n    readonly height: number;\n}\n\n/**\n * A rounded box's corner: a radius of 0 is a plain box.\n * @param radius - the style's `radius` attribute\n * @param fallback - the style's documented default radius\n * @param put - receives the values\n * @param at - the sites\n */\nfunction putRounded(radius: string | undefined, fallback: number, put: PutValue, at: SiteOf): void {\n    const r = radius === undefined ? fallback : canonNumber(radius, at(\"cornerRadius\"));\n    if (r === 0) {\n        put(\"shape\", \"rectangle\");\n        return;\n    }\n    put(\"shape\", \"round-rectangle\");\n    put(\"cornerRadius\", r);\n}\n\n/**\n * Reads the yFiles for HTML 2.6 node styles yEd Live wrote before yFiles 3, and the demos' FlowchartNodeStyle:\n * BevelNodeStyle and PanelNodeStyle (a `color` fill, no outline), ShinyPlateNodeStyle (an outline only where `stroke`\n * is set) and FlowchartNodeStyle (its `type`'s outline, drawn as yEd's flowchart palette draws the same type).\n * @param refs - the references\n * @param style - the style\n * @param put - receives the values\n * @param at - the sites\n * @returns true when the style is one of these\n */\nfunction readStyle26(refs: References, style: StyleObject, put: PutValue, at: SiteOf): boolean {\n    const fill = (v: unknown): void => {\n        const gradient = (): void => {\n            noteAt(at(\"fill\"), STYLE_ISSUE.GRADIENT, style.tag);\n        };\n        putPaint(paintOf(refs, v, gradient), \"fill\", \"fillOpacity\", put, at);\n    };\n    switch (style.tag) {\n        case \"BevelNodeStyle\":\n            fill(prop(style, \"color\") ?? BLACK);\n            put(\"borderWidth\", 0);\n            putRounded(treeAttr(style.e, \"radius\"), 10, put, at);\n            return true;\n        case \"PanelNodeStyle\":\n            fill(prop(style, \"color\") ?? BLACK);\n            put(\"borderWidth\", 0);\n            put(\"shape\", \"rectangle\");\n            return true;\n        case \"ShinyPlateNodeStyle\": {\n            fill(prop(style, \"fill\") ?? BLACK);\n            const stroke = prop(style, \"stroke\");\n            if (stroke === undefined) {\n                put(\"borderWidth\", 0);\n            } else {\n                putStroke(strokeOf(refs, stroke), put, at);\n            }\n            putRounded(treeAttr(style.e, \"radius\"), 5, put, at);\n            return true;\n        }\n        case \"FlowchartNodeStyle\": {\n            fill(prop(style, \"fill\") ?? FLOWCHART_FILL);\n            const type = treeAttr(style.e, \"type\") ?? \"\";\n            // an annotation's box has no outline (its bracket is not drawn); a style without a type draws the same\n            // box, outlined\n            if (type === \"annotation\") {\n                put(\"borderWidth\", 0);\n            } else {\n                putStroke(strokeOf(refs, prop(style, \"stroke\") ?? BLACK), put, at);\n            }\n            const outline = type === \"\" || type === \"annotation\" ? null : configurationOutline(`flowchart.${type}`);\n            if (outline === null && type !== \"\" && type !== \"annotation\") {\n                noteAt(at(\"shape\"), STYLE_ISSUE.UNKNOWN_VALUE, type.slice(0, MAX_STYLE_VALUE_LENGTH));\n            }\n            put(\"shape\", outline?.shape ?? \"rectangle\");\n            if (outline?.points !== undefined) {\n                put(\"shapePoints\", outline.points);\n            }\n            return true;\n        }\n        default:\n            return false;\n    }\n}\n\n/**\n * Writes a stroke's color, width and line style, or no outline for `{x:Null}`.\n * @param stroke - the stroke\n * @param put - receives the values\n * @param at - the sites\n */\nfunction putStroke(stroke: Stroke | typeof NULL | null, put: PutValue, at: SiteOf): void {\n    if (stroke === NULL) {\n        put(\"borderWidth\", 0);\n    } else if (stroke !== null) {\n        putPaint(stroke.color, \"borderColor\", \"borderOpacity\", put, at);\n        put(\"borderWidth\", canonNumber(stroke.width, at(\"borderWidth\")));\n        put(\"borderStyle\", canonEnum(\"borderStyle\", stroke.line, \"yfiles3\", at(\"borderStyle\")));\n    }\n}\n\n/**\n * Reads a node style.\n * @param refs - the references\n * @param data - the `<data>` content of the NodeStyle key\n * @param put - receives the values\n * @param at - the sites\n * @param size - the node's size, for a PILL's half-circle ends\n */\nfunction readNodeStyle(refs: References, data: unknown, put: PutValue, at: SiteOf, size: Size | null): void {\n    const st = unwrapped(refs, refs.first(data));\n    if (st === null || typeof st !== \"object\") {\n        if (data !== null && data !== undefined && data !== \"\") {\n            noteAt(at(\"fill\"), STYLE_ISSUE.UNRESOLVED, \"NodeStyle\");\n        }\n        return;\n    }\n    const style = st;\n    if (readStyle26(refs, style, put, at)) {\n        return;\n    }\n    putPaint(\n        paintOf(refs, prop(style, \"fill\"), () => {\n            noteAt(at(\"fill\"), STYLE_ISSUE.GRADIENT, style.tag);\n        }),\n        \"fill\",\n        \"fillOpacity\",\n        put,\n        at,\n    );\n    putStroke(strokeOf(refs, prop(style, \"stroke\")), put, at);\n    put(\"shape\", nodeShapeOf(style, at));\n    const points = SHAPES_26.get(shapeKey(treeAttr(style.e, \"shape\")) ?? \"\")?.points;\n    if (points !== undefined) {\n        put(\"shapePoints\", points);\n    }\n    const cornerSize = style.tag === \"RectangleNodeStyle\" ? treeAttr(style.e, \"cornerSize\") : undefined;\n    if (cornerSize !== undefined) {\n        put(\"cornerRadius\", canonNumber(cornerSize, at(\"cornerRadius\")));\n    }\n    const shape = style.tag === \"ShapeNodeStyle\" ? shapeKey(treeAttr(style.e, \"shape\")) : null;\n    if (shape === \"round-rectangle\") {\n        put(\"cornerRadius\", ROUND_RECTANGLE_CORNER);\n    } else if (shape === \"pill\" && size !== null) {\n        put(\"cornerRadius\", Math.min(size.width, size.height) / 2);\n    }\n}\n\n/**\n * A ShapeNodeStyle `shape` as a lookup key: lowercase, underscores as hyphens.\n * @param shape - the attribute\n * @returns the key, or null\n */\nfunction shapeKey(shape: string | undefined): string | null {\n    return shape === undefined\n        ? null\n        : shape.slice(0, MAX_STYLE_VALUE_LENGTH).trim().toLowerCase().replaceAll(\"_\", \"-\");\n}\n\n/**\n * The style a collapsible group's decorators wrap; a decorator that wraps itself is a cycle.\n * @param refs - the references\n * @param first - the node's style\n * @returns the style that draws the node, or null for a cycle\n */\nfunction unwrapped(refs: References, first: Resolved): Resolved {\n    let st = first;\n    const seen = new Set<unknown>();\n    while (st !== null && typeof st === \"object\" && st.tag === \"CollapsibleNodeStyleDecorator\") {\n        if (seen.has(st.e) || refs.tooDeep(seen.size)) {\n            refs.cycles++;\n            return null;\n        }\n        seen.add(st.e);\n        st = refs.deref(prop(st, \"wrappedStyle\"));\n    }\n    return st;\n}\n\n/**\n * A node style's shape: its `shape`, else what its kind draws.\n * @param style - the style\n * @param at - the sites\n * @returns the shape, or null when it does not parse\n */\nfunction nodeShapeOf(style: StyleObject, at: SiteOf): string | null {\n    const shape = treeAttr(style.e, \"shape\");\n    if (shape !== undefined) {\n        return SHAPES_26.get(shapeKey(shape) ?? \"\")?.shape ?? canonEnum(\"shape\", shape, \"yfiles3\", at(\"shape\"));\n    }\n    if (style.tag === \"RectangleNodeStyle\") {\n        return treeAttr(style.e, \"cornerSize\") === undefined ? \"rectangle\" : \"round-rectangle\";\n    }\n    if (style.tag === \"ShapeNodeStyle\") {\n        return \"rectangle\";\n    }\n    noteAt(at(\"shape\"), STYLE_ISSUE.UNKNOWN_VALUE, style.tag);\n    return `other:${style.tag}`;\n}\n\n/**\n * Reads an edge style.\n * @param refs - the references\n * @param data - the `<data>` content of the EdgeStyle key\n * @param put - receives the values\n * @param at - the sites\n */\nfunction readEdgeStyle(refs: References, data: unknown, put: PutValue, at: SiteOf): void {\n    const st = refs.first(data);\n    if (st === null) {\n        return;\n    }\n    const stroke = strokeOf(refs, prop(st, \"stroke\"));\n    if (stroke === NULL) {\n        noteAt(at(\"color\"), STYLE_ISSUE.NO_STROKE, \"{x:Null}\");\n    } else if (stroke !== null) {\n        putPaint(stroke.color, \"color\", \"opacity\", put, at);\n        put(\"width\", canonNumber(stroke.width, at(\"width\")));\n        put(\"lineStyle\", canonEnum(\"lineStyle\", stroke.line, \"yfiles3\", at(\"lineStyle\")));\n    }\n    for (const end of [\"source\", \"target\"] as const) {\n        readEdgeArrow(refs, refs.deref(prop(st, `${end}Arrow`)), end, put, at);\n    }\n}\n\n/**\n * Reads one end's arrow of an edge style: its type, and for an arrow element its color, drawn hollow in its\n * stroke's color when its fill is `{x:Null}`.\n * @param refs - the references\n * @param a - the dereferenced `sourceArrow` or `targetArrow` value\n * @param end - which end\n * @param put - receives the values\n * @param at - the sites\n */\nfunction readEdgeArrow(\n    refs: References,\n    a: ReturnType<References[\"deref\"]>,\n    end: \"source\" | \"target\",\n    put: PutValue,\n    at: SiteOf,\n): void {\n    const property = `${end}Arrow`;\n    let type: string | null = null;\n    let hollow = false;\n    if (a !== null && a !== NULL && typeof a === \"object\") {\n        type = treeAttr(a.e, \"type\") ?? \"DEFAULT\";\n        const fill = paintOf(refs, prop(a, \"fill\"), null);\n        // a `{x:Null}` fill draws the arrow's outline alone, in its stroke's color\n        const open = fill === NULL ? strokeOf(refs, prop(a, \"stroke\")) : null;\n        hollow = open !== null && open !== NULL;\n        putPaint(open !== null && open !== NULL ? open.color : fill, `${end}ArrowColor`, null, put, at);\n    } else if (typeof a === \"string\") {\n        type = a;\n    }\n    if (type !== null) {\n        const arrow = canonEnum(\"arrow\", RENAMED_ARROWS.get(type.toUpperCase()) ?? type, \"yfiles3\", at(property));\n        put(property, hollow ? (HOLLOW_ARROWS.get(arrow ?? \"\") ?? arrow) : arrow);\n    }\n}\n\n/**\n * yFiles 3.0 renamed 2.6's DEFAULT arrow to STEALTH and CIRCLE to ELLIPSE\n * (https://docs.yfiles.com/yfiles-html/api/ArrowType/); each is read as its 2.6 name is. STEALTH is \"an arrow that is\n * notched on the side opposite its tip\": a vee.\n */\nconst RENAMED_ARROWS: ReadonlyMap<string, string> = new Map([\n    [\"DEFAULT\", \"vee\"],\n    [\"STEALTH\", \"vee\"],\n    [\"ELLIPSE\", \"circle\"],\n]);\n\n/** The filled arrows whose `{x:Null}` fill draws them as their open outline (a stealth's as the open triangle's). */\nconst HOLLOW_ARROWS: ReadonlyMap<string, string> = new Map([\n    [\"triangle\", \"triangle-open\"],\n    [\"vee\", \"triangle-open\"],\n    [\"diamond\", \"diamond-open\"],\n    [\"circle\", \"circle-open\"],\n]);\n\n/**\n * Reads an edge's route from its EdgeGeometry: the `y:Bend` locations, relative to its two nodes' centers (a\n * self-loop's to its node's size), and, for a PolylineEdgeStyle with a `smoothingLength` above 0, its rounded bends.\n * @param refs - the references\n * @param geometry - the `<data>` content of the EdgeGeometry key\n * @param style - the `<data>` content of the EdgeStyle key\n * @param ends - the source and target nodes' boxes (center x, y, width, height)\n * @param put - receives the values\n */\nfunction readEdgeGeometry(\n    refs: References,\n    geometry: unknown,\n    style: unknown,\n    ends: readonly [Float64Array, Float64Array, boolean],\n    put: PutValue,\n): void {\n    const points = treeChildren(treeChild(geometry, \"List\"), \"Bend\").map((b): BendPoint => {\n        const [x, y] = (treeAttr(b, \"Location\") ?? \"\").split(\",\").map(Number);\n        return [x, y];\n    });\n    const [s, t, loop] = ends;\n    const bends = loop\n        ? canonNodeOffsets([s[0], s[1]], [s[2], s[3]], points, true)\n        : canonBends([s[0], s[1]], [t[0], t[1]], points, true);\n    put(\"bends\", bends);\n    const st = refs.first(style);\n    const smoothing = st === null ? undefined : treeAttr(st.e, \"smoothingLength\");\n    if (bends !== null && st?.tag === \"PolylineEdgeStyle\" && Number(smoothing) > 0) {\n        put(\"curved\", true);\n    }\n}\n\n/** yFiles' label positions (2.6 compass names and yFiles 3 side names, lowercase without `_`) as neutral sides. */\nconst SIDES: ReadonlyMap<string, string> = new Map([\n    [\"north\", \"top\"],\n    [\"south\", \"bottom\"],\n    [\"east\", \"right\"],\n    [\"west\", \"left\"],\n    [\"northeast\", \"top-right\"],\n    [\"northwest\", \"top-left\"],\n    [\"southeast\", \"bottom-right\"],\n    [\"southwest\", \"bottom-left\"],\n    [\"top\", \"top\"],\n    [\"bottom\", \"bottom\"],\n    [\"right\", \"right\"],\n    [\"left\", \"left\"],\n    [\"topright\", \"top-right\"],\n    [\"topleft\", \"top-left\"],\n    [\"bottomright\", \"bottom-right\"],\n    [\"bottomleft\", \"bottom-left\"],\n]);\n\n/**\n * The node label models by their parameter's local name: whether the label lies outside the node (exterior,\n * sandwich) or inside it (interior, stretch).\n */\nconst NODE_LABEL_MODELS: ReadonlyMap<string, \"outside\" | \"inside\"> = new Map([\n    [\"ExteriorLabelModelParameter\", \"outside\"],\n    [\"ExteriorNodeLabelModelParameter\", \"outside\"],\n    [\"SandwichParameter\", \"outside\"],\n    [\"SandwichLabelModelParameter\", \"outside\"],\n    [\"InteriorLabelModelParameter\", \"inside\"],\n    [\"InteriorNodeLabelModelParameter\", \"inside\"],\n    [\"InteriorStretchLabelModelParameter\", \"inside\"],\n    [\"StretchNodeLabelModelParameter\", \"inside\"],\n]);\n\n/** A `{x:Static y:SomeLabelModel.Position}` markup extension: the model's local name and the member. */\nconst STATIC_PARAMETER = /^\\{\\s*[\\w.-]*:?Static\\s+(?:[\\w.-]+:)?(\\w+)\\.(\\w+)\\s*\\}$/;\n\n/**\n * A label's layout parameter, as a parameter element's local name and the element: the `Label.LayoutParameter`\n * child, a `LayoutParameter` attribute naming a shared one, or a model's constant (`{x:Static\n * y:InteriorStretchLabelModel.North}`), read as that model's parameter with that `Position`.\n * @param refs - the references\n * @param label - the `y:Label` element\n * @returns the parameter, or null\n */\nfunction layoutParameter(refs: References, label: unknown): StyleObject | null {\n    const attr = treeAttr(label, \"LayoutParameter\");\n    if (attr !== undefined) {\n        const m = STATIC_PARAMETER.exec(attr.slice(0, MAX_STYLE_VALUE_LENGTH).trim());\n        if (m !== null) {\n            return { tag: `${m[1]}Parameter`, e: { \"@_Position\": m[2] } };\n        }\n    }\n    const p = refs.deref(attr ?? treeChild(label, \"Label.LayoutParameter\"));\n    return p === null || p === NULL || typeof p !== \"object\" ? null : p;\n}\n\n/**\n * Where yFiles draws a node label, from its layout parameter's model and `Position`: outside the node for the\n * exterior and sandwich models, inside it (`inside-*`) for the interior and stretch models, and the center for a\n * centered position or any other model (the free and ratio-anchored models' offsets have no neutral property).\n * @param refs - the references\n * @param label - the `y:Label` element\n * @returns the position\n */\nfunction labelPositionOf(refs: References, label: unknown): string {\n    const parameter = layoutParameter(refs, label);\n    const model = parameter === null ? undefined : NODE_LABEL_MODELS.get(parameter.tag);\n    if (parameter === null || model === undefined) {\n        return \"center\";\n    }\n    const raw = treeAttr(parameter.e, \"Position\") ?? \"\";\n    const side = SIDES.get(raw.slice(0, MAX_STYLE_VALUE_LENGTH).toLowerCase().replaceAll(\"_\", \"\"));\n    if (side === undefined) {\n        return \"center\";\n    }\n    return model === \"inside\" ? `inside-${side}` : side;\n}\n\n/** yFiles' edge label sides (`SideOfEdge`, and the nine-position model's middle row), as neutral positions. */\nconst EDGE_SIDES: ReadonlyMap<string, string> = new Map([\n    [\"aboveedge\", \"top\"],\n    [\"belowedge\", \"bottom\"],\n    [\"onedge\", \"center\"],\n    [\"centerabove\", \"top\"],\n    [\"centerbelow\", \"bottom\"],\n    [\"centercentered\", \"center\"],\n]);\n\n/** The edge label models that place a label above, on or below the line, and the attribute that says which. */\nconst EDGE_SIDE_ATTRIBUTES: ReadonlyMap<string, string> = new Map([\n    [\"NinePositionsEdgeLabelModelParameter\", \"Position\"],\n    [\"EdgePathLabelModelParameter\", \"SideOfEdge\"],\n]);\n\n/**\n * Where yFiles draws an edge label at the middle of its edge, above, on or below the line: the path model's\n * `SideOfEdge` at a ratio of 0.5, and the nine-position model's center row. Other places (the ends, a\n * segment's middle, left or right of the edge's direction, a free offset) give none.\n * @param refs - the references\n * @param label - the `y:Label` element\n * @returns the position, or null\n */\nfunction edgeLabelPositionOf(refs: References, label: unknown): string | null {\n    const parameter = layoutParameter(refs, label);\n    if (parameter === null) {\n        return null;\n    }\n    const ratio = treeAttr(parameter.e, \"Ratio\");\n    if (ratio !== undefined && Number(ratio) !== 0.5) {\n        return null;\n    }\n    const attribute = EDGE_SIDE_ATTRIBUTES.get(parameter.tag);\n    const raw = attribute === undefined ? undefined : treeAttr(parameter.e, attribute);\n    return raw === undefined ? null : (EDGE_SIDES.get(raw.slice(0, MAX_STYLE_VALUE_LENGTH).toLowerCase()) ?? null);\n}\n\n/**\n * Reads an element's labels: the first one with text; further ones are noted for the element.\n * @param refs - the references\n * @param data - the `<data>` content of the NodeLabels or EdgeLabels key\n * @param put - receives the values\n * @param at - the sites\n */\nfunction readLabels(refs: References, data: unknown, put: PutValue, at: SiteOf): void {\n    let label: unknown = undefined;\n    let text = \"\";\n    let extra = 0;\n    for (const l of treeChildren(treeChild(data, \"List\"), \"Label\")) {\n        const raw = treeAttr(l, \"Text\") ?? treeText(treeChild(l, \"Label.Text\")) ?? \"\";\n        if (raw.trim().length === 0) {\n            continue;\n        }\n        if (label === undefined) {\n            label = l;\n            text = raw;\n        } else {\n            extra++;\n        }\n    }\n    if (label === undefined) {\n        return;\n    }\n    if (extra > 0) {\n        noteAt(at(\"label\"), STYLE_ISSUE.EXTRA_LABELS, `${String(extra + 1)} labels`);\n    }\n    put(\"label\", canonText(text, at(\"label\")));\n    put(\n        \"labelPosition\",\n        at(\"label\").target === \"node\" ? labelPositionOf(refs, label) : edgeLabelPositionOf(refs, label),\n    );\n    const ls = refs.deref(treeAttr(label, \"Style\") ?? treeChild(label, \"Label.Style\"));\n    if (ls === null || ls === NULL || typeof ls !== \"object\" || !ls.tag.endsWith(\"LabelStyle\")) {\n        return;\n    }\n    putPaint(paintOf(refs, prop(ls, \"textFill\"), null), \"labelColor\", null, put, at);\n    readLabelFont(refs.deref(prop(ls, \"font\")), put, at);\n}\n\n/**\n * Reads a label style's `Font`: its size, family and weight.\n * @param f - the dereferenced `font` property\n * @param put - receives the values\n * @param at - the sites\n */\nfunction readLabelFont(f: ReturnType<References[\"deref\"]>, put: PutValue, at: SiteOf): void {\n    if (f === null || f === NULL || typeof f !== \"object\" || f.tag !== \"Font\") {\n        return;\n    }\n    put(\"labelSize\", canonNumber(treeAttr(f.e, \"fontSize\"), at(\"labelSize\")));\n    const family = treeAttr(f.e, \"fontFamily\");\n    if (family !== undefined) {\n        put(\"labelFont\", canonText(family.replaceAll(/(^['\"])|(['\"]$)/g, \"\"), at(\"labelFont\")));\n    }\n    const weight = treeAttr(f.e, \"fontWeight\");\n    if (weight !== undefined) {\n        put(\"labelWeight\", canonEnum(\"weight\", weight, \"yfiles3\", at(\"labelWeight\")));\n    }\n}\n\n/** The style, labels and geometry key kinds of nodes and of edges. */\nconst YFILES3_KINDS: Readonly<Record<StyleTarget, readonly KeyKind[]>> = {\n    node: [\"NodeStyle\", \"NodeLabels\", \"NodeGeometry\"],\n    edge: [\"EdgeStyle\", \"EdgeLabels\", \"EdgeGeometry\"],\n};\n\n/** What reading one table's yFiles 3 styles shares. */\ninterface Yfiles3Context {\n    readonly snapshot: GraphSnapshot;\n    readonly notes: StyleNotes;\n    readonly budget: StyleWorkBudget;\n    readonly refs: References;\n    /** each node's center x and y, width and height from its NodeGeometry, for its edges' bends; NaN without one */\n    readonly boxes: Float64Array;\n}\n\n/**\n * Reads the yFiles 3 styles of every node or every edge.\n * @param ctx - the shared state\n * @param target - nodes or edges\n * @param kinds - the table's columns by key kind\n * @returns the values\n */\nfunction readYfiles3Target(\n    ctx: Yfiles3Context,\n    target: StyleTarget,\n    kinds: Map<KeyKind, string>,\n): ReturnType<typeof valueColumns>[\"values\"] {\n    const { snapshot, notes, budget, refs, boxes } = ctx;\n    const isNode = target === \"node\";\n    const table = isNode ? snapshot.nodes : snapshot.edges;\n    const n = isNode ? snapshot.nodeCount : snapshot.edgeCount;\n    const out = valueColumns(n);\n    const [style, labels, geometry] = YFILES3_KINDS[target].map((kind) => kinds.get(kind));\n    const cell = (name: string | undefined, i: number): unknown =>\n        name === undefined ? undefined : plainCell(table.value(name, i));\n    for (let i = 0; i < n; i++) {\n        budget.spend(target, 1);\n        const at: SiteOf = (property) => ({ notes, target, property, element: i, budget });\n        const put: PutValue = (property, value) => {\n            out.put(i, property, value);\n        };\n        let size: Size | null = null;\n        if (geometry !== undefined && !isNode) {\n            const box = (k: number): Float64Array => boxes.subarray(4 * k, 4 * k + 4);\n            const [s, t] = [snapshot.edgeSource(i), snapshot.edgeTarget(i)];\n            readEdgeGeometry(refs, cell(geometry, i), cell(style, i), [box(s), box(t), s === t], put);\n        } else if (geometry !== undefined) {\n            size = readNodeGeometry(cell(geometry, i), i, boxes, put, at);\n        }\n        if (style !== undefined && isNode) {\n            readNodeStyle(refs, cell(style, i), put, at, size);\n        } else if (style !== undefined) {\n            readEdgeStyle(refs, cell(style, i), put, at);\n        }\n        if (labels !== undefined) {\n            readLabels(refs, cell(labels, i), put, at);\n        }\n    }\n    return out.values;\n}\n\n/**\n * Reads a node's NodeGeometry: its width and height, and its box for its edges' bends.\n * @param geometry - the `<data>` content of the NodeGeometry key\n * @param i - the node's index\n * @param boxes - receives the node's center x and y, width and height\n * @param put - receives the values\n * @param at - the sites\n * @returns the node's size, or null when its width or height is not a number\n */\nfunction readNodeGeometry(geometry: unknown, i: number, boxes: Float64Array, put: PutValue, at: SiteOf): Size | null {\n    const rect = treeChild(geometry, \"RectD\");\n    const width = canonNumber(treeAttr(rect, \"Width\"), at(\"width\"));\n    const height = canonNumber(treeAttr(rect, \"Height\"), at(\"height\"));\n    put(\"width\", width);\n    put(\"height\", height);\n    if (width === null || height === null) {\n        return null;\n    }\n    const [x, y] = [Number(treeAttr(rect, \"X\")), Number(treeAttr(rect, \"Y\"))];\n    boxes.set([x + width / 2, y + height / 2, width, height], 4 * i);\n    return { width, height };\n}\n\n/**\n * The yFiles 3 styles of a graph.\n * @param snapshot - the graph\n * @param notes - where problems are noted\n * @param budget - the work budget\n * @returns the values, or null when the graph has none of yFiles 3's style keys\n */\nexport function readYfiles3Styles(snapshot: GraphSnapshot, notes: StyleNotes, budget: StyleWorkBudget): YedRead | null {\n    const nodeKinds = columnsByKind(snapshot.nodes);\n    const edgeKinds = columnsByKind(snapshot.edges);\n    const styled = [...nodeKinds.keys(), ...edgeKinds.keys()].some((k) => k !== \"SharedData\");\n    if (!styled) {\n        return null;\n    }\n    const graphKinds = columnsByKind(snapshot.graph);\n    const sharedName = graphKinds.get(\"SharedData\");\n    const refs = new References(sharedName === undefined ? null : plainCell(snapshot.graph.value(sharedName, 0)));\n    const boxes = new Float64Array(4 * snapshot.nodeCount).fill(Number.NaN);\n    const read = (target: StyleTarget, kinds: Map<KeyKind, string>): ReturnType<typeof valueColumns>[\"values\"] =>\n        readYfiles3Target({ snapshot, notes, budget, refs, boxes }, target, kinds);\n    const node = read(\"node\", nodeKinds);\n    const edge = read(\"edge\", edgeKinds);\n    if (refs.cycles > 0) {\n        notes.add(STYLE_ISSUE.REFERENCE_CYCLE, null, null, {\n            sample: `references deeper than ${String(MAX_REFERENCE_DEPTH)} or circular (${String(refs.cycles)})`,\n        });\n    }\n    return { node, edge };\n}\n","/**\n * GraphML styles: which program wrote the file, and its styles read the way that program draws them. yEd and\n * yFiles 3 keep their graphics in nested XML (styles-yed.ts, styles-yfiles3.ts); Gephi writes plain `r`, `g`, `b`\n * and `size` keys; Cytoscape's GraphML export writes no visual properties at all and is recognized by its `SUID`\n * and `shared name` keys. A GraphML file from any other writer has no styles: a key named like a style (`color`)\n * stays data, and no program's defaults are added.\n */\n\nimport type { GraphSnapshot } from \"@graphty/graph-format\";\n\nimport { canonColor } from \"../../styles/canon/color.js\";\nimport { canonNumber } from \"../../styles/canon/number.js\";\nimport { canonText } from \"../../styles/canon/text.js\";\nimport { STYLE_BLOCK_NAME } from \"../../styles/io/block.js\";\nimport { StyleNotes } from \"../../styles/notes.js\";\nimport { plainCell } from \"../../styles/plan/resolve.js\";\nimport type { ImporterStyles, StyleReadContext, StyleTarget, StyleValue } from \"../../styles/types.js\";\nimport { gephiRules } from \"../gexf/styles.js\";\nimport {\n    exactFromBlock,\n    readYedStyles,\n    type ValueColumns,\n    valueColumns,\n    type YedRead,\n    yfilesColumns,\n} from \"./styles-yed.js\";\nimport { readYfiles3Styles } from \"./styles-yfiles3.js\";\n\n/** Gephi's color and size keys. */\nconst GEPHI_COLUMNS: readonly string[] = [\"r\", \"g\", \"b\", \"size\"];\n\n/**\n * Whether a table has Gephi's `r`, `g` and `b` columns.\n * @param table - the node or edge table\n * @returns true when all three are there\n */\nfunction hasRgb(table: GraphSnapshot[\"nodes\"]): boolean {\n    return table.has(\"r\") && table.has(\"g\") && table.has(\"b\");\n}\n\n/**\n * Gephi's styles: `r`, `g`, `b` as the fill of a node and the color of an edge, `size` as a node's width and\n * height, and `label` as the label.\n * @param snapshot - the graph\n * @param notes - where problems are noted\n * @param context - the work budget\n * @returns the values\n */\nfunction readGephi(\n    snapshot: GraphSnapshot,\n    notes: StyleNotes,\n    context: StyleReadContext,\n): { node: ValueColumns; edge: ValueColumns } {\n    const read = (target: StyleTarget): ValueColumns => {\n        const table = target === \"node\" ? snapshot.nodes : snapshot.edges;\n        const n = target === \"node\" ? snapshot.nodeCount : snapshot.edgeCount;\n        const out = valueColumns(n);\n        const has = { rgb: hasRgb(table), size: target === \"node\" && table.has(\"size\"), label: table.has(\"label\") };\n        for (let i = 0; i < n; i++) {\n            context.budget.spend(target, 1);\n            const at = (property: string): Parameters<typeof canonNumber>[1] => ({\n                notes,\n                target,\n                property,\n                element: i,\n                budget: context.budget,\n            });\n            readGephiRow(\n                table,\n                target,\n                i,\n                has,\n                (property, value) => {\n                    out.put(i, property, value);\n                },\n                at,\n            );\n        }\n        return out.values;\n    };\n    return { node: read(\"node\"), edge: read(\"edge\") };\n}\n\n/**\n * Reads one Gephi element.\n * @param table - the node or edge table\n * @param target - nodes or edges\n * @param i - the element\n * @param has - which of Gephi's columns the table has\n * @param has.rgb - the `r`, `g` and `b` columns\n * @param has.size - a node `size` column\n * @param has.label - a `label` column\n * @param put - receives the values\n * @param at - the sites\n */\nfunction readGephiRow(\n    table: GraphSnapshot[\"nodes\"],\n    target: StyleTarget,\n    i: number,\n    has: { readonly rgb: boolean; readonly size: boolean; readonly label: boolean },\n    put: (property: string, value: StyleValue | null) => void,\n    at: (property: string) => Parameters<typeof canonNumber>[1],\n): void {\n    if (has.rgb) {\n        const [r, g, b] = [\"r\", \"g\", \"b\"].map((c) => plainCell(table.value(c, i)));\n        if (r !== null && g !== null && b !== null) {\n            const property = target === \"node\" ? \"fill\" : \"color\";\n            put(property, canonColor({ r, g, b }, \"gephi\", at(property))?.color ?? null);\n        }\n    }\n    if (has.size) {\n        const v = canonNumber(plainCell(table.value(\"size\", i)), at(\"width\"));\n        put(\"width\", v);\n        put(\"height\", v);\n    }\n    if (has.label) {\n        put(\"label\", canonText(plainCell(table.value(\"label\", i)), at(\"label\")));\n    }\n}\n\n/**\n * For a file graphty wrote: the yEd values that are only what the writer writes for the `graphty.styles` block's own\n * values read as the block's values (see exactFromBlock()). A block that does not parse or describes another graph\n * changes nothing; graph-io then ignores it with a note.\n * @param snapshot - the graph\n * @param yed - the values read from the yEd graphics, changed in place\n */\nfunction exactFromGraphtyBlock(snapshot: GraphSnapshot, yed: YedRead): void {\n    const text = snapshot.graph.has(STYLE_BLOCK_NAME) ? plainCell(snapshot.graph.value(STYLE_BLOCK_NAME, 0)) : null;\n    if (typeof text !== \"string\") {\n        return;\n    }\n    exactFromBlock(snapshot, text, yed);\n}\n\n/**\n * The styles of a GraphML file, read the way the program that wrote it draws them, with that program's defaults\n * beneath: yEd's and yFiles 3's nested graphics, Gephi's `r`, `g`, `b` and `size` keys, or, for Cytoscape's export,\n * Cytoscape's default style with each node labeled by its `name`. A file from any other writer has none.\n * @param snapshot - the graph the import built\n * @param context - the work budget\n * @returns the styles, or null when no writer with styles is recognized\n */\nexport function graphmlStyles(snapshot: GraphSnapshot, context: StyleReadContext): ImporterStyles | null {\n    const notes = new StyleNotes();\n    const readFrom = { node: yfilesColumns(snapshot.nodes), edge: yfilesColumns(snapshot.edges) };\n    const yfiles3 = readYfiles3Styles(snapshot, notes, context.budget);\n    if (yfiles3 !== null) {\n        return {\n            canonical: true,\n            dialect: \"yfiles3\",\n            tool: \"yfiles3\",\n            units: \"px\",\n            node: { values: yfiles3.node },\n            edge: { values: yfiles3.edge },\n            notes: notes.list(),\n            readFrom,\n        };\n    }\n    const yed = readYedStyles(snapshot, notes, context.budget);\n    if (yed !== null) {\n        exactFromGraphtyBlock(snapshot, yed);\n        return {\n            canonical: true,\n            dialect: \"yed\",\n            tool: \"yed\",\n            units: \"px\",\n            node: { values: yed.node },\n            edge: { values: yed.edge },\n            notes: notes.list(),\n            opacityInColor: true,\n            readFrom,\n        };\n    }\n    if (hasRgb(snapshot.nodes)) {\n        const gephi = readGephi(snapshot, notes, context);\n        // Gephi draws every edge in its end nodes' mixed color (EdgeColor MIXED), whatever its own\n        delete gephi.edge.color;\n        const rules = gephiRules(snapshot, { fill: gephi.node.fill, width: gephi.node.width }, {}, context.budget);\n        const used = (table: GraphSnapshot[\"nodes\"]): string[] => GEPHI_COLUMNS.filter((c) => table.has(c));\n        return {\n            canonical: true,\n            dialect: \"gephi\",\n            tool: \"gephi\",\n            units: \"relative\",\n            node: { values: gephi.node, ...rules.node },\n            edge: { values: gephi.edge, ...rules.edge },\n            notes: notes.list(),\n            readFrom: { node: used(snapshot.nodes), edge: used(snapshot.edges) },\n        };\n    }\n    if (snapshot.nodes.has(\"SUID\") && snapshot.nodes.has(\"shared name\")) {\n        // Cytoscape writes no visual properties into GraphML; its default style labels each node with its name\n        const label = valueColumns(snapshot.nodeCount);\n        if (snapshot.nodes.has(\"name\")) {\n            for (let i = 0; i < snapshot.nodeCount; i++) {\n                label.put(\n                    i,\n                    \"label\",\n                    canonText(plainCell(snapshot.nodes.value(\"name\", i)), {\n                        notes,\n                        target: \"node\",\n                        property: \"label\",\n                        element: i,\n                        budget: context.budget,\n                    }),\n                );\n            }\n        }\n        return {\n            canonical: true,\n            dialect: \"cytoscape\",\n            tool: \"cytoscape\",\n            units: \"px\",\n            node: { values: label.values },\n            edge: { values: {} },\n            notes: notes.list(),\n        };\n    }\n    return null;\n}\n","/**\n * The GraphML importer (design sections 8.4 and 5.1; research note 07 section 2.3): a single-pass\n * SAX-style reader over the streaming XML tokenizer that pushes scalars into the sink as elements\n * close. `<key>` declarations become typed columns up front (boolean / int / long / float / double\n * / string, with `<default>`, for the node, edge and graph domains; `for=\"all\"` declares in all\n * three with the same origin.id); `edgedefault` and per-edge `directed` go through the common\n * DirectionResolver; a nested `<graph>` inside a node becomes the `parent` column (containment,\n * never topology); `<port>` declarations and `<locator>` elements are reported and dropped while\n * `sourceport` / `targetport` edge attributes are kept as role columns; hyperedges follow the\n * `hyperedges` option (refuse, skip with a report entry, star, clique); yFiles `yfiles.type` keys\n * become `json` columns holding the nested XML as a tree (origin.namespace \"yfiles\"), reported as\n * a loss note because the structure, not the bytes, is preserved; a `y:ShapeNode` or\n * `y:PolyLineEdge` in such a tree is also read into typed `yfiles.*` columns (yfiles.ts).\n *\n * Ids are coerced with the common rule (`ids: \"canonical\"` by default, design section 4.1); the\n * edge attribute whose `attr.name` is `weightFrom` (\"weight\" by default) is THE weight and is\n * passed to `addEdge` rather than stored as a column, with its declaration kept in\n * `meta.weightOrigin`; a node key named `graphty:originalId` restores ids the exporter mangled.\n */\n\nimport {\n    type ColumnDecl,\n    type ColumnHandle,\n    GraphFormatError,\n    type GraphSink,\n    INVALID_INDEX,\n    MAX_COUNT,\n    type NodeId,\n} from \"@graphty/graph-format\";\n\nimport {\n    declareAttribute,\n    type DeclaredAttribute,\n    declareResolved,\n    losesPrecision,\n    parseDeclaredValue,\n    PRECISION_CODE,\n    takenIn,\n    uniqueColumnName,\n} from \"../../common/attributes.js\";\nimport { type DeclaredTypeSpec, overflowsToInfinity } from \"../../common/declared-types.js\";\nimport { DirectionResolver, type EdgeKind } from \"../../common/direction.js\";\nimport { IdCoercer } from \"../../common/ids.js\";\nimport { textChunks, throwIfAborted } from \"../../common/input.js\";\nimport { type ListSyntax } from \"../../common/lists.js\";\nimport {\n    type ImportFormatDefaults,\n    reportSinkOptions,\n    reportUnusedOptions,\n    type ResolvedImportOptions,\n    resolveImportOptions,\n} from \"../../common/options.js\";\nimport { agree, plural } from \"../../common/plural.js\";\nimport { ImportReportBuilder } from \"../../common/report.js\";\nimport { isWeightField, parseWeightText } from \"../../common/weights.js\";\nimport {\n    isWhitespace,\n    localName,\n    sniffXmlText,\n    tokenizeXml,\n    xmlDeclaredEncoding,\n    XmlEmptyInputError,\n    type XmlHandler,\n    XmlNestingError,\n    XmlSyntaxError,\n} from \"../../common/xml.js\";\nimport { type CommonImportOptions, type GraphImporter, type ImportInput, type ImportReport } from \"../../types.js\";\nimport {\n    EDGE_ID_COLUMN,\n    EXTENSIONS,\n    FORMAT,\n    GRAPHML_ISSUE,\n    GRAPHML_LOSS,\n    GRAPHML_NAMESPACE,\n    type GraphmlMeta,\n    HYPEREDGE_HUB_COLUMN,\n    LABEL_COLUMN,\n    META_KEY,\n    MIME_TYPES,\n    ORIGINAL_ID_ATTRIBUTE,\n    ORIGINAL_ID_COLUMN,\n    PARENT_COLUMN,\n    RESERVED_EDGE_NAMES,\n    RESERVED_NODE_NAMES,\n    SOURCE_PORT_COLUMN,\n    TARGET_PORT_COLUMN,\n    XSI_NAMESPACE,\n} from \"./constants.js\";\nimport { graphmlStyles } from \"./styles-plain.js\";\nimport { writeXmlTree, XmlTreeBuilder } from \"./tree.js\";\nimport { graphicsDecl, graphicsValues, yfilesPositions } from \"./yfiles.js\";\n\n/**\n * Whether an XML attribute is not data and passes silently: a namespace declaration, an `xml:` or\n * `xsi:` attribute, or a namespace URI where one is allowed.\n * @param kind - the element name\n * @param name - the attribute's name\n * @returns true when it is never reported\n */\nfunction isPassedAttribute(kind: string, name: string): boolean {\n    return name === \"xmlns\" || /^(xmlns|xml|xsi):/.test(name) || isAttributeUri(kind, name);\n}\n\n/**\n * The warning for an attribute the importer does not read.\n * @param kind - the element name\n * @param name - the attribute's name\n * @param hint - whether it is a `parse.*` hint\n * @returns the message\n */\nfunction unreadAttributeMessage(kind: string, name: string, hint: boolean): string {\n    if (hint) {\n        return `the <${kind}> parse hint ${name} is ignored`;\n    }\n    if (SCHEMA_ATTRIBUTES.has(name)) {\n        return `the <${kind}> attribute ${name} is not kept`;\n    }\n    return `the <${kind}> attribute ${name} is not a GraphML attribute; it is not kept`;\n}\n\n/** The XML attributes the importer reads on each element; any other is reported (once per element and name). */\nconst GRAPH_ATTRIBUTES: ReadonlySet<string> = new Set([\"id\", \"edgedefault\", \"parse.nodes\", \"parse.edges\"]);\nconst NODE_ATTRIBUTES: ReadonlySet<string> = new Set([\"id\"]);\nconst KEY_ATTRIBUTES: ReadonlySet<string> = new Set([\n    \"id\",\n    \"for\",\n    \"attr.name\",\n    \"attr.type\",\n    \"name\",\n    \"type\",\n    \"yfiles.type\",\n]);\nconst DATA_ATTRIBUTES: ReadonlySet<string> = new Set([\"key\"]);\nconst HYPEREDGE_ATTRIBUTES: ReadonlySet<string> = new Set([\"id\"]);\nconst ENDPOINT_ATTRIBUTES: ReadonlySet<string> = new Set([\"node\", \"type\"]);\nconst PORT_ATTRIBUTES: ReadonlySet<string> = new Set([\"name\"]);\nconst NO_ATTRIBUTES: ReadonlySet<string> = new Set();\n\n/**\n * Whether a `<key>` attribute is yFiles 3's `attr.uri` (in whatever prefix the file binds to yWorks' namespace).\n * @param kind - the element name\n * @param name - the attribute name as written\n * @returns true for `<prefix>:attr.uri` on a key\n */\nfunction isAttributeUri(kind: string, name: string): boolean {\n    return kind === \"key\" && name.endsWith(\":attr.uri\");\n}\n\n/**\n * The `<prefix>:attr.uri` of a key, or null.\n * @param attrs - the key's attributes\n * @returns the URI\n */\nfunction attributeUri(attrs: ReadonlyMap<string, string>): string | null {\n    for (const [name, value] of attrs) {\n        if (isAttributeUri(\"key\", name) && value.length > 0) {\n            return value;\n        }\n    }\n    return null;\n}\n\n/** Attributes the GraphML schema defines that the importer does not keep: reported as not kept, not as foreign. */\nconst SCHEMA_ATTRIBUTES: ReadonlySet<string> = new Set([\"id\", \"port\", \"parse.order\", \"parse.nodeids\", \"parse.edgeids\"]);\n\n/** Distinct unknown attribute names reported one by one per element kind; the rest are counted in one issue. */\nconst MAX_UNKNOWN_ATTRIBUTE_NAMES = 16;\nconst EDGE_ATTRIBUTES: ReadonlySet<string> = new Set([\n    \"id\",\n    \"source\",\n    \"target\",\n    \"directed\",\n    \"sourceport\",\n    \"targetport\",\n]);\n\n/**\n * The format-specific options of the GraphML importer.\n * @category Built-in formats\n */\nexport interface GraphmlImportOptions extends CommonImportOptions {\n    /**\n     * How yEd graphics (keys with a `yfiles.type`) are read. \"json\" keeps each one as a JSON\n     * attribute named after the key (for example, `d0`) that holds its XML as a tree, which the GraphML\n     * exporter writes back, and also reads the shapes it knows into plain columns beside it:\n     * `yfiles.position`, `yfiles.width`, `yfiles.height`, `yfiles.color`, `yfiles.borderColor`,\n     * `yfiles.borderWidth`, `yfiles.label` and `yfiles.shape` for nodes, and the line color, width\n     * and arrows for edges. The report's `lossy` list then holds W_GRAPHML_YFILES_JSON, because the\n     * XML comes back with the same structure but not byte for byte. \"skip\" leaves the graphics out,\n     * with a W_GRAPHML_YFILES_SKIPPED warning per key. The `yfiles.*` columns are deprecated and\n     * kept as they are, not fixed: read a file's styles with `styles: true` instead. In the next\n     * major version they leave the import result, together with the rule that a target arrow makes\n     * an edge directed and the label role of `yfiles.label`.\n     * @defaultValue \"json\"\n     */\n    yfiles?: \"json\" | \"skip\" | undefined;\n}\n\n/** The per-format defaults of design section 8.4: text-cell ids, undirected when edgedefault is missing, weight key. */\nconst FORMAT_DEFAULTS: ImportFormatDefaults = { ids: \"canonical\", defaultDirected: false, weightFrom: \"weight\" };\n\n/** Bytes inspected by sniff(). */\nconst SNIFF_BYTES = 4096;\n\nconst YFILES_MODES: ReadonlySet<string> = new Set([\"json\", \"skip\"]);\n\n/** Elements between two checks of the cancellation signal. */\nconst ABORT_CHECK_INTERVAL = 64;\n\n/** The common options the GraphML importer reads (the rest is reported by reportUnusedOptions). */\nconst USED_OPTIONS: ReadonlySet<keyof CommonImportOptions> = new Set<keyof CommonImportOptions>([\n    \"ids\",\n    \"addMissingNodes\",\n    \"duplicateEdges\",\n    \"selfLoops\",\n    \"onMixedDirection\",\n    \"defaultDirected\",\n    \"weightFrom\",\n    \"weightDtype\",\n    \"long\",\n    \"restoreMangledIds\",\n    \"hyperedges\",\n    \"errorLimit\",\n    \"signal\",\n    \"onProgress\",\n]);\n\n/** Where the reader is, by the innermost open element. */\nconst enum Ctx {\n    Graphml,\n    Desc,\n    Key,\n    Default,\n    Graph,\n    Node,\n    Edge,\n    Hyperedge,\n    Data,\n    Capture,\n    Skip,\n    /** A `<port>` (ports nest; their names are collected for the edge port check). */\n    Port,\n    /** Inside a `<graph>` held by an `<edge>`: dropped, its nodes and edges counted as skipped. */\n    Dropped,\n}\n\n/** The element domains a key can be declared for. */\ntype Domain = \"graph\" | \"node\" | \"edge\";\n\n/** A declared column of one domain. */\ninterface ColumnTarget {\n    /** The column name in its table. */\n    readonly name: string;\n    /** The handle (node / edge domains); INVALID_INDEX for the graph domain. */\n    readonly handle: ColumnHandle;\n    /** The declaration (graph domain, re-sent with every setGraphValue). */\n    readonly decl: ColumnDecl;\n    /** How text values are parsed; null for a json (yfiles) column. */\n    readonly spec: DeclaredTypeSpec | null;\n    /** The list syntax (unused by GraphML, which has no list type). */\n    readonly listSyntax: ListSyntax;\n}\n\n/** One `<key>` after `</key>`. */\ninterface KeyEntry {\n    readonly id: string;\n    readonly name: string;\n    readonly node: ColumnTarget | null;\n    readonly edge: ColumnTarget | null;\n    readonly graph: ColumnTarget | null;\n    /** The edge domain of this key is THE weight. */\n    readonly weight: boolean;\n    /** The node domain of this key restores mangled ids. */\n    readonly originalId: boolean;\n    /** Whether the key holds yFiles nested XML. */\n    readonly yfiles: boolean;\n    /** Whether data of this key is silently ignored (yfiles: \"skip\"; already reported). */\n    readonly skipped: boolean;\n    /** The domains the key was declared for, for the mismatch warning. */\n    readonly domains: readonly Domain[];\n}\n\n/** A `<key>` while its `<default>` and `<desc>` are being read. */\ninterface PendingKey {\n    readonly id: string | null;\n    readonly attrName: string | null;\n    readonly attrType: string | null;\n    readonly yfilesType: string | null;\n    readonly domains: readonly Domain[];\n    readonly line: number;\n    desc: string;\n    defaultText: string | null;\n    defaultTree: unknown;\n}\n\n/** A `<node>` while open (nodes nest through nested graphs, so these stack). */\ninterface NodeState {\n    /** The coerced id, or null when the element is unusable. */\n    id: NodeId | null;\n    /** The id attribute as written, for the mangled -> original map. */\n    idText: string | null;\n    /** The node index once added; INVALID_INDEX before. */\n    index: number;\n    /** The index of the containing node, or INVALID_INDEX at the top level. */\n    readonly parent: number;\n    /** Data values waiting for the node to be added: handle, value, handle, value... */\n    readonly pending: unknown[];\n    /** A `graphty:originalId` value, restored as the id. */\n    restoredId: string | null;\n    failed: boolean;\n    readonly line: number;\n    /** The keys of the `<data>` read so far, for the duplicate check; null before the first. */\n    keys: Set<string> | null;\n}\n\n/** The `<edge>` being read. */\ninterface EdgeState {\n    source: NodeId | null;\n    target: NodeId | null;\n    id: string | null;\n    kind: EdgeKind;\n    sourcePort: string | null;\n    targetPort: string | null;\n    weight: number | undefined;\n    readonly pending: unknown[];\n    failed: boolean;\n    line: number;\n    /** The keys of the `<data>` read so far, for the duplicate check; null before the first. */\n    keys: Set<string> | null;\n    /** The weight key whose value was read, or null. */\n    weightKey: string | null;\n    /** The endpoint ids as written, for the nested-graph-id check. */\n    readonly sourceText: string | null;\n    readonly targetText: string | null;\n}\n\n/** One `<endpoint>` of a hyperedge. */\ninterface Endpoint {\n    readonly node: NodeId;\n    readonly type: \"in\" | \"out\" | \"undir\";\n}\n\n/** The `<hyperedge>` being read. */\ninterface HyperedgeState {\n    id: string | null;\n    readonly endpoints: Endpoint[];\n    failed: boolean;\n    line: number;\n}\n\n/** The `<data>` or `<default>` being read. */\ninterface ContentState {\n    key: KeyEntry | null;\n    pendingKey: PendingKey | null;\n    domain: Domain;\n    text: string;\n    tree: XmlTreeBuilder | null;\n    line: number;\n}\n\n/** Where an issue was found. */\ninterface Where {\n    /** The line. */\n    readonly line: number;\n    /** The element, or null. */\n    readonly element: string | null;\n}\n\n/** One open `<graph>`. */\ninterface GraphState {\n    readonly directed: boolean;\n    readonly parent: number;\n    /** The `parse.nodes` / `parse.edges` hints of a top-level graph, checked at its end; null when absent. */\n    readonly hints: { readonly nodes: number | null; readonly edges: number | null } | null;\n    /** The `<node>` / `<edge>` elements read directly in this graph. */\n    nodes: number;\n    edges: number;\n    readonly line: number;\n}\n\n/**\n * A growable bit set over node indices, marking the indices declared by a `<node>` element so a\n * second declaration is reported and a node created by an edge reference is not.\n */\nclass IndexFlags {\n    private words = new Uint32Array(64);\n\n    /**\n     * Whether an index is marked.\n     * @param index - the node index\n     * @returns true when set\n     */\n    has(index: number): boolean {\n        const w = index >>> 5;\n        return w < this.words.length && ((this.words[w] >>> (index & 31)) & 1) === 1;\n    }\n\n    /**\n     * Mark an index.\n     * @param index - the node index\n     */\n    add(index: number): void {\n        const w = index >>> 5;\n        if (w >= this.words.length) {\n            let size = this.words.length * 2;\n            while (size <= w) {\n                size *= 2;\n            }\n            const grown = new Uint32Array(size);\n            grown.set(this.words);\n            this.words = grown;\n        }\n        this.words[w] |= 1 << (index & 31);\n    }\n}\n\n/**\n * The event handler that turns the tokenizer's events into sink calls.\n */\nclass GraphmlReader implements XmlHandler {\n    private readonly sink: GraphSink;\n\n    private readonly report: ImportReportBuilder;\n\n    private readonly options: ResolvedImportOptions;\n\n    private readonly yfilesMode: \"json\" | \"skip\";\n\n    private readonly coercer: IdCoercer;\n\n    private readonly direction: DirectionResolver;\n\n    private readonly ctx: Ctx[] = [];\n\n    /** Keys by id; one id may be declared once per domain (igraph writes `name` for graph and node). */\n    private readonly keys = new Map<string, KeyEntry[]>();\n\n    private readonly graphs: GraphState[] = [];\n\n    private readonly nodes: NodeState[] = [];\n\n    private readonly declared = new IndexFlags();\n\n    private readonly edgeIds = new Set<string>();\n    /** The keys `<data>` referenced before any `<key>` declared them (E_GRAPHML_UNKNOWN_KEY). */\n    private readonly unknownKeyIds = new Set<string>();\n    /** The ids of the edges waiting in {@link deferred}. */\n    private readonly deferredEdgeIds = new Set<string>();\n\n    private elementsSinceCheck = 0;\n\n    /** Mangled id text -> the original id restored from `graphty:originalId`, for edge endpoints. */\n    private readonly restored = new Map<string, NodeId>();\n\n    private readonly graphColumnNames = new Set<string>();\n\n    private pendingKey: PendingKey | null = null;\n\n    private edge: EdgeState | null = null;\n\n    private hyperedge: HyperedgeState | null = null;\n\n    private readonly content: ContentState = {\n        key: null,\n        pendingKey: null,\n        domain: \"node\",\n        text: \"\",\n        tree: null,\n        line: 0,\n    };\n\n    private descTarget: \"graph\" | \"key\" | null = null;\n\n    private descText = \"\";\n\n    private descLine = 0;\n\n    /** The keys of the graph-level `<data>` read so far, for the duplicate check. */\n    private readonly graphKeys: { keys: Set<string> | null } = { keys: null };\n\n    private description: string | null = null;\n\n    private graphSeen = false;\n\n    private graphId: string | null = null;\n\n    private edgedefault: \"directed\" | \"undirected\" | null = null;\n\n    private namespaces: Record<string, string> = {};\n\n    private weightOrigin: { id: string; title: string | null; type: string | null } | null = null;\n\n    private yfilesLossNoted = false;\n\n    /** The mapped yFiles graphics columns declared so far, by domain and field. */\n    private readonly graphicsColumns = new Map<string, ColumnHandle>();\n\n    private hyperedgeCount = 0;\n\n    private edgeIdHandle: ColumnHandle = INVALID_INDEX as ColumnHandle;\n\n    private sourcePortHandle: ColumnHandle = INVALID_INDEX as ColumnHandle;\n\n    private targetPortHandle: ColumnHandle = INVALID_INDEX as ColumnHandle;\n\n    private parentHandle: ColumnHandle = INVALID_INDEX as ColumnHandle;\n\n    private hubHandle: ColumnHandle = INVALID_INDEX as ColumnHandle;\n\n    /** The hub nodes of star-expanded hyperedges, so a later `<node>` of the same id is reported as a clash. */\n    private readonly hubs = new IndexFlags();\n\n    /** Edges and hyperedges whose endpoints were not declared yet under addMissingNodes: false, added at the end. */\n    private readonly deferred: (EdgeState | HyperedgeState)[] = [];\n\n    /** The ids of the `<graph>` elements read so far, for the endpoint-names-a-graph check. */\n    private readonly graphIds = new Set<string>();\n\n    /** How many top-level `<graph>` elements were opened. */\n    private topGraphs = 0;\n\n    /** The namespace of the `<graphml>` root (children in it are GraphML even when it is not GraphML's). */\n    private rootNs: string | null = GRAPHML_NAMESPACE;\n\n    /** Whether a graph-level `<desc>` was kept, so a second one is reported. */\n    private graphDescSeen = false;\n\n    /** Unknown attribute names reported per element kind, and how many more were not listed. */\n    private readonly unknownNames = new Map<string, Set<string>>();\n\n    private readonly unknownOverflow = new Map<string, number>();\n\n    /** The port names each node declares, and the ports edges reference, checked at the end. */\n    private readonly ports = new Map<NodeId, Set<string>>();\n\n    private readonly portRefs: [NodeId, string][] = [];\n\n    /**\n     * Create a reader for one import call.\n     * @param sink - the sink\n     * @param report - the report\n     * @param options - the resolved common options\n     * @param yfilesMode - the resolved yfiles option\n     */\n    constructor(\n        sink: GraphSink,\n        report: ImportReportBuilder,\n        options: ResolvedImportOptions,\n        yfilesMode: \"json\" | \"skip\",\n    ) {\n        this.sink = sink;\n        this.report = report;\n        this.options = options;\n        this.yfilesMode = yfilesMode;\n        this.coercer = new IdCoercer(options.ids);\n        this.direction = new DirectionResolver(sink, report, options.onMixedDirection);\n    }\n\n    // ------------------------------------------------------------------ tokenizer events\n\n    /**\n     * An element starts.\n     * @param name - the element name\n     * @param attrs - its attributes\n     * @param line - the line\n     * @param ns - the element's namespace (null: an undeclared prefix)\n     */\n    start(name: string, attrs: ReadonlyMap<string, string>, line: number, ns: string | null = \"\"): void {\n        const parent = this.ctx.at(-1) ?? null;\n        switch (parent) {\n            case Ctx.Capture:\n            case Ctx.Data:\n            case Ctx.Default:\n                this.captureStart(name, attrs);\n                return;\n            case Ctx.Skip:\n            case Ctx.Desc:\n                this.ctx.push(Ctx.Skip);\n                return;\n            case Ctx.Dropped:\n                this.dropStart(localName(name));\n                return;\n            default:\n                break;\n        }\n        const local = localName(name);\n        if (parent !== null && ns !== GRAPHML_NAMESPACE && ns !== \"\" && ns !== this.rootNs) {\n            // a vendor element whose local name happens to be node, edge or data is not GraphML\n            this.unknownElement(name, line);\n            return;\n        }\n        switch (parent) {\n            case null:\n                if (local !== \"graphml\") {\n                    this.report.fail(GRAPHML_ISSUE.NOT_GRAPHML, `the root element is <${name}>, not <graphml>`, {\n                        line,\n                    });\n                }\n                if (ns !== GRAPHML_NAMESPACE && ns !== \"\") {\n                    this.report.warning(\n                        \"validation-error\",\n                        GRAPHML_ISSUE.NAMESPACE,\n                        ns === null\n                            ? `the root <${name}> uses an undeclared prefix; read as GraphML`\n                            : `the root <${name}> is in the namespace ${JSON.stringify(ns)}, not ${GRAPHML_NAMESPACE}; read as GraphML`,\n                        { line, element: ns },\n                    );\n                }\n                this.rootNs = ns;\n                this.reportUnreadAttributes(\"graphml\", attrs, NO_ATTRIBUTES, line);\n                this.readRoot(attrs);\n                this.ctx.push(Ctx.Graphml);\n                return;\n            case Ctx.Graphml:\n                this.startInGraphml(name, local, attrs, line);\n                return;\n            case Ctx.Key:\n                this.startInKey(name, local, attrs, line);\n                return;\n            case Ctx.Graph:\n                this.startInGraph(name, local, attrs, line);\n                return;\n            case Ctx.Node:\n                this.startInNode(name, local, attrs, line);\n                return;\n            case Ctx.Edge:\n                this.startInEdge(name, local, attrs, line);\n                return;\n            case Ctx.Hyperedge:\n                this.startInHyperedge(name, local, attrs, line);\n                return;\n            case Ctx.Port:\n                this.startInPort(name, local, attrs, line);\n                return;\n            default:\n                this.unknownElement(name, line);\n        }\n    }\n\n    /**\n     * An element ends.\n     * @param name - the element name\n     * @param _line - the line (unused: issues of an element cite its start line)\n     */\n    end(name: string, _line: number): void {\n        const ctx = this.ctx.pop();\n        switch (ctx) {\n            case Ctx.Capture:\n                this.captureEnd();\n                return;\n            case Ctx.Skip:\n            case Ctx.Graphml:\n            case Ctx.Port:\n            case Ctx.Dropped:\n            case undefined:\n                return;\n            case Ctx.Desc:\n                this.finishDesc();\n                return;\n            case Ctx.Key:\n                this.finishKey();\n                return;\n            case Ctx.Default:\n                this.finishDefault();\n                return;\n            case Ctx.Data:\n                this.finishData();\n                return;\n            case Ctx.Node:\n                this.finishNode();\n                return;\n            case Ctx.Edge:\n                this.finishEdge();\n                return;\n            case Ctx.Hyperedge:\n                this.finishHyperedge();\n                return;\n            case Ctx.Graph:\n                this.finishGraph();\n                return;\n            default: {\n                const value: never = ctx;\n                throw new GraphFormatError(\"E_UNSUPPORTED\", `unknown reader state ${String(value)}`, { name });\n            }\n        }\n    }\n\n    /**\n     * Character data.\n     * @param text - the text\n     * @param line - the line\n     */\n    text(text: string, line: number): void {\n        const ctx = this.ctx.at(-1) ?? null;\n        switch (ctx) {\n            case Ctx.Capture:\n                this.content.tree?.text(text);\n                return;\n            case Ctx.Data:\n            case Ctx.Default:\n                if (this.content.tree === null) {\n                    this.content.text += text;\n                } else {\n                    this.content.tree.text(text);\n                }\n                return;\n            case Ctx.Desc:\n                this.descText += text;\n                return;\n            case Ctx.Skip:\n            case Ctx.Dropped:\n                return;\n            default:\n                if (!isWhitespace(text)) {\n                    this.report.warnOnce(\n                        \"validation-error\",\n                        GRAPHML_ISSUE.STRAY_TEXT,\n                        \"text where GraphML allows only elements was ignored\",\n                        { line },\n                    );\n                }\n        }\n    }\n\n    /**\n     * After the last event: the document must have held a graph; the metadata is written.\n     */\n    finish(): void {\n        if (!this.graphSeen) {\n            this.report.fail(GRAPHML_ISSUE.NO_GRAPH, \"the document has no <graph> element\");\n        }\n        // GraphML allows an edge before the nodes it joins: what waited for them is added now\n        for (const edge of this.deferred) {\n            if (\"endpoints\" in edge) {\n                this.expandHyperedge(edge);\n            } else {\n                this.addEdge(edge);\n            }\n        }\n        this.deferred.length = 0;\n        this.checkPorts();\n        for (const [kind, more] of this.unknownOverflow) {\n            this.report.warning(\n                \"unsupported\",\n                GRAPHML_ISSUE.UNKNOWN_XML_ATTRIBUTE,\n                `${more} more distinct attribute names on <${kind}> are not GraphML attributes and are not kept (not listed one by one)`,\n                { element: kind },\n            );\n        }\n        const meta: GraphmlMeta = { graphId: this.graphId, edgedefault: this.edgedefault, namespaces: this.namespaces };\n        this.sink.setMeta({\n            sourceFormat: FORMAT,\n            description: this.description ?? undefined,\n            weightOrigin:\n                this.weightOrigin === null\n                    ? undefined\n                    : {\n                          format: FORMAT,\n                          id: this.weightOrigin.id,\n                          title: this.weightOrigin.title,\n                          type: this.weightOrigin.type,\n                          namespace: null,\n                      },\n            extra: { [META_KEY]: meta },\n        });\n    }\n\n    // ------------------------------------------------------------------ structure\n\n    /**\n     * Record the root element's namespace declarations.\n     * @param attrs - the root attributes\n     */\n    private readRoot(attrs: ReadonlyMap<string, string>): void {\n        for (const [key, value] of attrs) {\n            if (key.startsWith(\"xmlns:\") && value !== GRAPHML_NAMESPACE && value !== XSI_NAMESPACE) {\n                this.namespaces[key.slice(6)] = value;\n            }\n        }\n    }\n\n    /**\n     * A child of `<graphml>`.\n     * @param name - the element name\n     * @param local - its local name\n     * @param attrs - its attributes\n     * @param line - the line\n     */\n    private startInGraphml(name: string, local: string, attrs: ReadonlyMap<string, string>, line: number): void {\n        switch (local) {\n            case \"desc\":\n                this.beginDesc(\"graph\", line);\n                return;\n            case \"key\":\n                this.beginKey(attrs, line);\n                return;\n            case \"graph\":\n                this.beginGraph(attrs, line, INVALID_INDEX);\n                return;\n            case \"data\":\n                this.beginData(attrs, line, \"graph\");\n                return;\n            default:\n                this.unknownElement(name, line);\n        }\n    }\n\n    /**\n     * A child of `<key>`.\n     * @param name - the element name\n     * @param local - its local name\n     * @param attrs - its attributes\n     * @param line - the line\n     */\n    private startInKey(name: string, local: string, attrs: ReadonlyMap<string, string>, line: number): void {\n        switch (local) {\n            case \"desc\":\n                this.beginDesc(\"key\", line);\n                return;\n            case \"default\":\n                this.reportUnreadAttributes(\"default\", attrs, NO_ATTRIBUTES, line);\n                if (\n                    this.pendingKey !== null &&\n                    (this.pendingKey.defaultText !== null || this.pendingKey.defaultTree !== undefined)\n                ) {\n                    this.report.warning(\n                        \"validation-error\",\n                        GRAPHML_ISSUE.DUPLICATE_ATTRIBUTE,\n                        `key \"${this.pendingKey.id ?? \"\"}\" has a second <default>; the later one is kept`,\n                        { line, element: this.pendingKey.id },\n                    );\n                }\n                this.content.key = null;\n                this.content.pendingKey = this.pendingKey;\n                this.content.text = \"\";\n                this.content.tree = null;\n                this.content.line = line;\n                this.ctx.push(Ctx.Default);\n                return;\n            default:\n                this.unknownElement(name, line);\n        }\n    }\n\n    /**\n     * A child of `<graph>`.\n     * @param name - the element name\n     * @param local - its local name\n     * @param attrs - its attributes\n     * @param line - the line\n     */\n    private startInGraph(name: string, local: string, attrs: ReadonlyMap<string, string>, line: number): void {\n        const first = this.graphs.length === 1 && this.topGraphs === 1;\n        switch (local) {\n            case \"desc\":\n                if (first) {\n                    this.beginDesc(\"graph\", line);\n                } else {\n                    this.report.warnOnce(\n                        \"unsupported\",\n                        GRAPHML_ISSUE.DESC_DROPPED,\n                        `the <desc> of a ${this.graphs.length === 1 ? \"second top-level\" : \"nested\"} <graph> is not kept`,\n                        { line },\n                        `${GRAPHML_ISSUE.DESC_DROPPED}:graph`,\n                    );\n                    this.ctx.push(Ctx.Skip);\n                }\n                return;\n            case \"data\":\n                if (first) {\n                    this.beginData(attrs, line, \"graph\");\n                } else {\n                    this.report.warnOnce(\n                        \"unsupported\",\n                        GRAPHML_ISSUE.NESTED_GRAPH_DATA,\n                        this.graphs.length === 1\n                            ? \"data of a second top-level <graph> cannot be kept; the graphs are merged and only the first one's attributes are kept\"\n                            : \"data of a nested <graph> cannot be kept; only the top-level graph has attributes\",\n                        { line },\n                    );\n                    this.ctx.push(Ctx.Skip);\n                }\n                return;\n            case \"node\":\n                this.beginNode(attrs, line);\n                return;\n            case \"edge\":\n                this.beginEdge(attrs, line);\n                return;\n            case \"hyperedge\":\n                this.beginHyperedge(attrs, line);\n                return;\n            case \"locator\":\n                this.report.warnOnce(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.LOCATOR_DROPPED,\n                    \"<locator> references are not followed\",\n                    { line },\n                );\n                this.ctx.push(Ctx.Skip);\n                return;\n            default:\n                this.unknownElement(name, line);\n        }\n    }\n\n    /**\n     * A child of `<node>`.\n     * @param name - the element name\n     * @param local - its local name\n     * @param attrs - its attributes\n     * @param line - the line\n     */\n    private startInNode(name: string, local: string, attrs: ReadonlyMap<string, string>, line: number): void {\n        switch (local) {\n            case \"desc\":\n                this.report.warnOnce(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.DESC_DROPPED,\n                    \"node and edge <desc> texts are not kept\",\n                    {\n                        line,\n                    },\n                );\n                this.ctx.push(Ctx.Skip);\n                return;\n            case \"data\":\n                this.beginData(attrs, line, \"node\");\n                return;\n            case \"port\":\n                this.report.warnOnce(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.PORT_DECLARATION,\n                    \"<port> declarations are not kept; sourceport / targetport edge attributes are\",\n                    { line },\n                );\n                this.beginPort(attrs, line);\n                return;\n            case \"graph\": {\n                const node = this.nodes[this.nodes.length - 1];\n                this.materializeNode(node);\n                if (node.index === INVALID_INDEX) {\n                    this.report.error(\n                        \"missing-value\",\n                        GRAPHML_ISSUE.UNKNOWN_PARENT,\n                        \"the nodes of this nested <graph> lose their parent: the node holding it was skipped; they are read as top-level nodes\",\n                        { line },\n                    );\n                }\n                this.beginGraph(attrs, line, node.index);\n                return;\n            }\n            case \"locator\":\n                this.report.warnOnce(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.LOCATOR_DROPPED,\n                    \"<locator> references are not followed\",\n                    { line },\n                );\n                this.ctx.push(Ctx.Skip);\n                return;\n            default:\n                this.unknownElement(name, line);\n        }\n    }\n\n    /**\n     * A child of `<edge>`.\n     * @param name - the element name\n     * @param local - its local name\n     * @param attrs - its attributes\n     * @param line - the line\n     */\n    private startInEdge(name: string, local: string, attrs: ReadonlyMap<string, string>, line: number): void {\n        switch (local) {\n            case \"desc\":\n                this.report.warnOnce(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.DESC_DROPPED,\n                    \"node and edge <desc> texts are not kept\",\n                    {\n                        line,\n                    },\n                );\n                this.ctx.push(Ctx.Skip);\n                return;\n            case \"data\":\n                this.beginData(attrs, line, \"edge\");\n                return;\n            case \"graph\":\n                this.report.warnOnce(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.EDGE_GRAPH_DROPPED,\n                    \"a <graph> inside an <edge> is not supported; it is dropped with the nodes and edges it holds (counted as skipped)\",\n                    { line, element: attrs.get(\"id\") ?? null },\n                );\n                this.ctx.push(Ctx.Dropped);\n                return;\n            default:\n                this.unknownElement(name, line);\n        }\n    }\n\n    /**\n     * An element inside a dropped `<graph>` (one held by an edge): counted as skipped.\n     * @param local - its local name\n     */\n    private dropStart(local: string): void {\n        if (local === \"node\") {\n            this.report.counts.skippedNodes++;\n        } else if (local === \"edge\" || local === \"hyperedge\") {\n            this.report.counts.skippedEdges++;\n        }\n        this.ctx.push(local === \"data\" || local === \"desc\" ? Ctx.Skip : Ctx.Dropped);\n    }\n\n    /**\n     * Open a `<port>`: its name is kept for the edge port check, its content is skipped.\n     * @param attrs - its attributes\n     * @param line - the line\n     */\n    private beginPort(attrs: ReadonlyMap<string, string>, line: number): void {\n        this.reportUnreadAttributes(\"port\", attrs, PORT_ATTRIBUTES, line);\n        const node = this.nodes[this.nodes.length - 1];\n        const name = attrs.get(\"name\");\n        if (node.id !== null && name !== undefined) {\n            const id = node.restoredId ?? node.id;\n            let names = this.ports.get(id);\n            if (names === undefined) {\n                names = new Set();\n                this.ports.set(id, names);\n            }\n            names.add(name);\n        }\n        this.ctx.push(Ctx.Port);\n    }\n\n    /**\n     * A child of `<port>`: a nested port declares a name too; data and desc are skipped.\n     * @param name - the element name\n     * @param local - its local name\n     * @param attrs - its attributes\n     * @param line - the line\n     */\n    private startInPort(name: string, local: string, attrs: ReadonlyMap<string, string>, line: number): void {\n        switch (local) {\n            case \"port\":\n                this.beginPort(attrs, line);\n                return;\n            case \"data\":\n            case \"desc\":\n                this.ctx.push(Ctx.Skip);\n                return;\n            default:\n                this.unknownElement(name, line);\n        }\n    }\n\n    /**\n     * Report the `sourceport` / `targetport` values that name a port their node never declares\n     * (once, with the count), now that every node has been read.\n     */\n    private checkPorts(): void {\n        let dangling = 0;\n        let first: string | null = null;\n        for (const [node, port] of this.portRefs) {\n            if (this.ports.get(node)?.has(port) !== true) {\n                dangling++;\n                first ??= `${String(node)}:${port}`;\n            }\n        }\n        if (dangling > 0) {\n            this.report.warning(\n                \"missing-value\",\n                GRAPHML_ISSUE.DANGLING_REFERENCE,\n                `${dangling} edge port reference${plural(dangling)} ${agree(dangling, \"names\", \"name\")} a port their node does not declare (first: ${first ?? \"\"}); the values are kept`,\n                { element: first },\n            );\n        }\n    }\n\n    /**\n     * A child of `<hyperedge>` (under the star / clique policies).\n     * @param name - the element name\n     * @param local - its local name\n     * @param attrs - its attributes\n     * @param line - the line\n     */\n    private startInHyperedge(name: string, local: string, attrs: ReadonlyMap<string, string>, line: number): void {\n        switch (local) {\n            case \"endpoint\":\n                this.reportUnreadAttributes(\"endpoint\", attrs, ENDPOINT_ATTRIBUTES, line);\n                this.readEndpoint(attrs, line);\n                this.ctx.push(Ctx.Skip);\n                return;\n            case \"data\":\n                this.report.warnOnce(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.HYPEREDGE_DATA_DROPPED,\n                    \"hyperedge data are not kept by the star / clique expansions\",\n                    { line },\n                );\n                this.ctx.push(Ctx.Skip);\n                return;\n            case \"desc\":\n                this.report.warnOnce(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.DESC_DROPPED,\n                    \"the <desc> of a hyperedge is not kept by the star / clique expansions\",\n                    { line },\n                    `${GRAPHML_ISSUE.DESC_DROPPED}:hyperedge`,\n                );\n                this.ctx.push(Ctx.Skip);\n                return;\n            default:\n                this.unknownElement(name, line);\n        }\n    }\n\n    /**\n     * Report an element the schema does not define at this place and skip its subtree.\n     * @param name - the element name\n     * @param line - the line\n     */\n    private unknownElement(name: string, line: number): void {\n        this.report.warnOnce(\"unsupported\", GRAPHML_ISSUE.UNKNOWN_ELEMENT, unknownElementMessage(name), {\n            line,\n            element: name,\n        });\n        this.ctx.push(Ctx.Skip);\n    }\n\n    /**\n     * Open a `<desc>`.\n     * @param target - what the text describes\n     * @param line - the line\n     */\n    private beginDesc(target: \"graph\" | \"key\", line: number): void {\n        this.descTarget = target;\n        this.descText = \"\";\n        this.descLine = line;\n        this.ctx.push(Ctx.Desc);\n    }\n\n    /** Close a `<desc>`. */\n    private finishDesc(): void {\n        const text = this.descText.trim();\n        if (this.descTarget === \"key\" && this.pendingKey !== null) {\n            this.pendingKey.desc = text;\n        } else if (this.descTarget === \"graph\" && text.length > 0) {\n            if (this.graphDescSeen) {\n                // a <graphml> and a <graph> description: the graph has one description field\n                this.report.warning(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.DESC_DROPPED,\n                    \"a second graph-level <desc> replaces the first; the earlier text is not kept\",\n                    { line: this.descLine },\n                );\n            }\n            this.graphDescSeen = true;\n            this.description = text;\n        }\n        this.descTarget = null;\n        this.descText = \"\";\n    }\n\n    // ------------------------------------------------------------------ graphs\n\n    /**\n     * Report, once per element kind and attribute name, an XML attribute the importer does not read:\n     * a GraphML `parse.*` hint as ignored, anything else as not kept. Namespace declarations and\n     * `xml:` / `xsi:` attributes are not data and pass silently. Beyond MAX_UNKNOWN_ATTRIBUTE_NAMES\n     * distinct names per element kind the rest are counted and reported once at the end, so a file\n     * with thousands of vendor attributes does not grow the report without bound.\n     * @param kind - the element name\n     * @param attrs - the element's attributes\n     * @param known - the attributes the importer reads on that element\n     * @param line - the line\n     */\n    private reportUnreadAttributes(\n        kind: string,\n        attrs: ReadonlyMap<string, string>,\n        known: ReadonlySet<string>,\n        line: number,\n    ): void {\n        for (const name of attrs.keys()) {\n            if (!known.has(name) && !isPassedAttribute(kind, name)) {\n                this.reportUnreadAttribute(kind, name, line);\n            }\n        }\n    }\n\n    /**\n     * Report one attribute reportUnreadAttributes() found, unless its name was reported for this\n     * element kind already or the kind is past MAX_UNKNOWN_ATTRIBUTE_NAMES names (then it is counted).\n     * @param kind - the element name\n     * @param name - the attribute's name\n     * @param line - the line\n     */\n    private reportUnreadAttribute(kind: string, name: string, line: number): void {\n        const hint = name.startsWith(\"parse.\");\n        let names = this.unknownNames.get(kind);\n        if (names === undefined) {\n            names = new Set();\n            this.unknownNames.set(kind, names);\n        }\n        if (names.has(name)) {\n            return;\n        }\n        if (names.size >= MAX_UNKNOWN_ATTRIBUTE_NAMES && !hint) {\n            this.unknownOverflow.set(kind, (this.unknownOverflow.get(kind) ?? 0) + 1);\n        }\n        names.add(name);\n        if (names.size > MAX_UNKNOWN_ATTRIBUTE_NAMES && !hint) {\n            return;\n        }\n        const code = hint ? GRAPHML_ISSUE.PARSE_HINT_IGNORED : GRAPHML_ISSUE.UNKNOWN_XML_ATTRIBUTE;\n        this.report.warning(\"unsupported\", code, unreadAttributeMessage(kind, name, hint), { line, element: name });\n    }\n\n    /**\n     * Open a `<graph>`: the top-level one sets the sink's direction (rule 1 of design section\n     * 8.4); a nested one records its container as the parent of its nodes.\n     * @param attrs - the graph attributes\n     * @param line - the line\n     * @param parent - the containing node's index, or INVALID_INDEX\n     */\n    private beginGraph(attrs: ReadonlyMap<string, string>, line: number, parent: number): void {\n        this.reportUnreadAttributes(\"graph\", attrs, GRAPH_ATTRIBUTES, line);\n        const top = this.graphs.length === 0;\n        if (top) {\n            this.topGraphs++;\n        }\n        const graphId = attrs.get(\"id\");\n        if (graphId !== undefined && graphId.length > 0) {\n            this.graphIds.add(graphId);\n        }\n        const edgedefault = attrs.get(\"edgedefault\");\n        let directed: boolean;\n        if (edgedefault === \"directed\" || edgedefault === \"undirected\") {\n            directed = edgedefault === \"directed\";\n        } else if (edgedefault === undefined) {\n            directed = top ? this.options.defaultDirected : this.graphs[this.graphs.length - 1].directed;\n            // once per kind: a file of thousands of nested graphs without edgedefault is one finding\n            const direction = directed ? \"directed\" : \"undirected\";\n            this.report.warnOnce(\n                \"validation-error\",\n                GRAPHML_ISSUE.EDGEDEFAULT_MISSING,\n                top\n                    ? `<graph> has no edgedefault; read as ${direction}`\n                    : `a nested <graph> has no edgedefault; it takes its container's (${direction})`,\n                { line },\n                `${GRAPHML_ISSUE.EDGEDEFAULT_MISSING}:${top ? \"top\" : \"nested\"}`,\n            );\n        } else {\n            directed = top ? this.options.defaultDirected : this.graphs[this.graphs.length - 1].directed;\n            this.report.error(\n                \"validation-error\",\n                GRAPHML_ISSUE.INVALID_EDGEDEFAULT,\n                `edgedefault \"${edgedefault}\" is neither directed nor undirected; read as ${directed ? \"directed\" : \"undirected\"}`,\n                { line },\n            );\n        }\n        let hints: GraphState[\"hints\"] = null;\n        if (top && this.graphSeen) {\n            this.report.warnOnce(\n                \"unsupported\",\n                GRAPHML_ISSUE.MULTIPLE_GRAPHS,\n                \"the document holds more than one top-level <graph>; their nodes and edges are merged into one graph\",\n                { line, element: attrs.get(\"id\") ?? null },\n            );\n            for (const name of [\"parse.nodes\", \"parse.edges\"]) {\n                if (attrs.has(name)) {\n                    this.report.warnOnce(\n                        \"unsupported\",\n                        GRAPHML_ISSUE.PARSE_HINT_IGNORED,\n                        `the ${name} hint of a second top-level <graph> is ignored`,\n                        { line, element: name },\n                        `${GRAPHML_ISSUE.PARSE_HINT_IGNORED}:second:${name}`,\n                    );\n                }\n            }\n        } else if (top) {\n            this.graphSeen = true;\n            this.graphId = attrs.get(\"id\") ?? null;\n            this.edgedefault = directed ? \"directed\" : \"undirected\";\n            this.direction.setHeader(directed, { line });\n            const nodes = this.hint(attrs.get(\"parse.nodes\"), \"parse.nodes\", line);\n            const edges = this.hint(attrs.get(\"parse.edges\"), \"parse.edges\", line);\n            hints = nodes === null && edges === null ? null : { nodes, edges };\n            if (nodes !== null || edges !== null) {\n                try {\n                    this.sink.reserve(nodes ?? undefined, edges ?? undefined);\n                } catch (err) {\n                    if (!(err instanceof GraphFormatError)) {\n                        throw err;\n                    }\n                    this.report.warning(\n                        \"validation-error\",\n                        GRAPHML_ISSUE.COUNT_HINT,\n                        `count hint refused: ${err.message}`,\n                        {\n                            line,\n                        },\n                    );\n                }\n            }\n        }\n        this.graphs.push({ directed, parent, hints, nodes: 0, edges: 0, line });\n        this.ctx.push(Ctx.Graph);\n    }\n\n    /** Close a `<graph>`: a top-level graph's count hints are checked against what it held. */\n    private finishGraph(): void {\n        const graph = this.graphs.pop();\n        if (graph?.hints === null || graph === undefined) {\n            return;\n        }\n        for (const [name, hint, found] of [\n            [\"parse.nodes\", graph.hints.nodes, graph.nodes],\n            [\"parse.edges\", graph.hints.edges, graph.edges],\n        ] as const) {\n            if (hint !== null && hint !== found) {\n                this.report.warning(\n                    \"validation-error\",\n                    GRAPHML_ISSUE.COUNT_MISMATCH,\n                    `<graph ${name}=\"${hint}\"> but the graph holds ${found} ${name === \"parse.nodes\" ? \"<node>\" : \"<edge>\"} elements`,\n                    { line: graph.line, element: name },\n                );\n            }\n        }\n    }\n\n    /**\n     * A `parse.nodes` / `parse.edges` hint the sink can reserve; anything else is reported and ignored.\n     * @param text - the attribute text, or undefined\n     * @param name - the attribute name\n     * @param line - the line\n     * @returns the count, or null\n     */\n    private hint(text: string | undefined, name: string, line: number): number | null {\n        if (text === undefined) {\n            return null;\n        }\n        const n = hint(text);\n        if (n === null || n > MAX_COUNT) {\n            this.report.warning(\n                \"validation-error\",\n                GRAPHML_ISSUE.COUNT_HINT,\n                `<graph ${name}=\"${text}\"> is not a count the sink can reserve; ignored`,\n                { line, element: name },\n            );\n            return null;\n        }\n        return n;\n    }\n\n    // ------------------------------------------------------------------ keys\n\n    /**\n     * Open a `<key>`; the column is declared at `</key>` once its default is known.\n     * @param attrs - the key attributes\n     * @param line - the line\n     */\n    private beginKey(attrs: ReadonlyMap<string, string>, line: number): void {\n        // attr.list (a list extension of some writers) and yEd's yfiles.foldertype are reported here\n        this.reportUnreadAttributes(\"key\", attrs, KEY_ATTRIBUTES, line);\n        const id = attrs.get(\"id\") ?? null;\n        if (id !== null && this.unknownKeyIds.delete(id)) {\n            this.report.warning(\n                \"missing-value\",\n                GRAPHML_ISSUE.KEY_DECLARED_LATE,\n                `key \"${id}\" is declared after data that uses it; those values were dropped (declare <key> before <graph>)`,\n                { line, element: id },\n            );\n        }\n        const forText = attrs.get(\"for\") ?? \"all\";\n        let domains: readonly Domain[];\n        switch (forText) {\n            case \"all\":\n                domains = [\"graph\", \"node\", \"edge\"];\n                break;\n            case \"graphml\":\n                // data on the <graphml> root (yEd's resources, yFiles 3's shared data) is read as graph data\n                domains = [\"graph\"];\n                break;\n            case \"graph\":\n            case \"node\":\n            case \"edge\":\n                domains = [forText];\n                break;\n            case \"hyperedge\":\n            case \"port\":\n            case \"endpoint\":\n                this.report.warning(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.KEY_DOMAIN_UNSUPPORTED,\n                    `key \"${id ?? \"\"}\" is declared for ${forText} elements, which are not kept`,\n                    { line, element: id },\n                );\n                domains = [];\n                break;\n            default:\n                this.report.error(\n                    \"validation-error\",\n                    GRAPHML_ISSUE.KEY_FOR_INVALID,\n                    `key \"${id ?? \"\"}\" has an unknown for=\"${forText}\"`,\n                    { line, element: id },\n                );\n                domains = [];\n        }\n        // `name` / `type` without the `attr.` prefix are written by some tools; the spec's spelling wins\n        const attrType = attrs.get(\"attr.type\") ?? attrs.get(\"type\") ?? null;\n        this.pendingKey = {\n            id,\n            attrName: attrs.get(\"attr.name\") ?? attrs.get(\"name\") ?? null,\n            attrType,\n            // yFiles 3 declares its untyped keys with `y:attr.uri` instead of `yfiles.type`: their data is nested XML\n            yfilesType: attrs.get(\"yfiles.type\") ?? (attrType === null ? attributeUri(attrs) : null),\n            domains,\n            line,\n            desc: \"\",\n            defaultText: null,\n            defaultTree: undefined,\n        };\n        this.ctx.push(Ctx.Key);\n    }\n\n    /** Close a `<key>`: declare its columns. */\n    private finishKey(): void {\n        const key = this.pendingKey;\n        this.pendingKey = null;\n        if (key === null) {\n            return;\n        }\n        const where = { line: key.line, element: key.id };\n        if (key.id === null || key.id.length === 0) {\n            this.report.error(\"validation-error\", GRAPHML_ISSUE.KEY_MISSING_ID, \"<key> without an id\", where);\n            return;\n        }\n        const declared = this.keys.get(key.id) ?? [];\n        if (declared.some((entry) => entry.domains.some((domain) => key.domains.includes(domain)))) {\n            this.report.error(\n                \"validation-error\",\n                GRAPHML_ISSUE.DUPLICATE_KEY,\n                `key \"${key.id}\" is declared twice for the same kind of element`,\n                where,\n            );\n            return;\n        }\n        const yfiles = key.yfilesType !== null;\n        const name = key.attrName !== null && key.attrName.length > 0 ? key.attrName : key.id;\n        const skipped = yfiles && this.yfilesMode === \"skip\";\n        if (skipped) {\n            this.report.warning(\n                \"unsupported\",\n                GRAPHML_ISSUE.YFILES_SKIPPED,\n                `yFiles key \"${key.id}\" (${key.yfilesType ?? \"\"}) skipped per the yfiles option`,\n                where,\n            );\n        }\n        let weight = false;\n        let originalId = false;\n        let node: ColumnTarget | null = null;\n        let edge: ColumnTarget | null = null;\n        let graph: ColumnTarget | null = null;\n        for (const domain of key.domains) {\n            if (skipped) {\n                continue;\n            }\n            if (domain === \"edge\" && !yfiles && isWeightField(name, this.options.weightFrom)) {\n                // networkx writes one weight key per value type (long and double): every key of\n                // that name is the weight; two of them on one edge are reported in finishData\n                weight = true;\n                this.weightOrigin ??= { id: key.id, title: key.attrName, type: key.attrType };\n                continue;\n            }\n            if (domain === \"node\" && !yfiles && name === ORIGINAL_ID_ATTRIBUTE) {\n                if (this.options.restoreMangledIds) {\n                    originalId = true;\n                    continue;\n                }\n                node = this.declareOriginalIdColumn(key);\n                continue;\n            }\n            try {\n                const target = yfiles ? this.declareYfiles(key, name, domain) : this.declareTyped(key, name, domain);\n                if (domain === \"node\") {\n                    node = target;\n                } else if (domain === \"edge\") {\n                    edge = target;\n                } else {\n                    graph = target;\n                }\n            } catch (err) {\n                this.report.recordError(err, where);\n            }\n        }\n        this.keys.set(key.id, [\n            ...declared,\n            {\n                id: key.id,\n                name,\n                node,\n                edge,\n                graph,\n                weight,\n                originalId,\n                yfiles,\n                skipped,\n                domains: key.domains,\n            },\n        ]);\n    }\n\n    /**\n     * Declare the column of a typed (or untyped, then string) key in one domain.\n     * @param key - the key\n     * @param name - the resolved attribute name\n     * @param domain - the domain\n     * @returns the column target\n     */\n    private declareTyped(key: PendingKey, name: string, domain: Domain): ColumnTarget {\n        const id = key.id ?? \"\";\n        const declared: DeclaredAttribute = declareAttribute({\n            format: FORMAT,\n            id,\n            title: key.attrName !== null && key.attrName.length > 0 ? key.attrName : null,\n            type: key.attrType,\n            defaultText: key.defaultTree === undefined ? key.defaultText : null,\n            listSyntax: \"comma\",\n            role: domain !== \"graph\" && name === LABEL_COLUMN ? \"label\" : null,\n            long: this.options.long,\n            taken: this.takenIn(domain),\n        });\n        for (const issue of declared.issues) {\n            this.report.warning(issue.category, issue.code, issue.message, { line: key.line, element: id });\n        }\n        if (key.defaultTree !== undefined) {\n            this.report.warning(\n                \"validation-error\",\n                GRAPHML_ISSUE.DATA_NESTED,\n                `the <default> of key \"${id}\" holds elements; a ${key.attrType ?? \"string\"} default must be text`,\n                { line: key.line, element: id },\n            );\n        }\n        const { decl } = declared;\n        if (key.desc.length > 0) {\n            decl.extra = { desc: key.desc };\n        }\n        return this.declareTarget(domain, decl, declared.spec, declared.listSyntax);\n    }\n\n    /**\n     * Declare the json column of a yFiles key in one domain.\n     * @param key - the key\n     * @param name - the resolved attribute name\n     * @param domain - the domain\n     * @returns the column target\n     */\n    private declareYfiles(key: PendingKey, name: string, domain: Domain): ColumnTarget {\n        const id = key.id ?? \"\";\n        const columnName = uniqueColumnName(name, id, this.takenIn(domain));\n        const decl: ColumnDecl = {\n            name: columnName,\n            dtype: \"json\",\n            nullable: true,\n            origin: {\n                format: FORMAT,\n                id,\n                title: key.attrName !== null && key.attrName !== columnName ? key.attrName : null,\n                type: key.yfilesType,\n                namespace: \"yfiles\",\n            },\n        };\n        if (key.defaultTree !== undefined) {\n            decl.default = key.defaultTree;\n        } else if (key.defaultText !== null) {\n            decl.default = key.defaultText;\n        }\n        if (key.desc.length > 0) {\n            decl.extra = { desc: key.desc };\n        }\n        return this.declareTarget(domain, decl, null, \"comma\");\n    }\n\n    /**\n     * Declare the `graphty.originalId` column that keeps the exporter's original ids when\n     * restoreMangledIds is off.\n     * @param key - the key\n     * @returns the column target\n     */\n    private declareOriginalIdColumn(key: PendingKey): ColumnTarget {\n        const decl: ColumnDecl = {\n            name: uniqueColumnName(ORIGINAL_ID_COLUMN, key.id, this.takenIn(\"node\")),\n            dtype: \"string\",\n            nullable: true,\n            role: \"originalId\",\n            origin: { format: FORMAT, id: key.id, title: key.attrName, type: key.attrType, namespace: null },\n        };\n        return this.declareTarget(\"node\", decl, null, \"comma\");\n    }\n\n    /**\n     * Push a declaration into the sink for one domain through the shared design section 5.6 rule:\n     * a role another column already holds is dropped (reported), a name the sink holds with\n     * another shape is renamed `<name>#<id>` (reported).\n     * @param domain - the domain\n     * @param decl - the declaration\n     * @param spec - the value spec, or null for json\n     * @param listSyntax - the list syntax\n     * @returns the target\n     */\n    private declareTarget(\n        domain: Domain,\n        decl: ColumnDecl,\n        spec: DeclaredTypeSpec | null,\n        listSyntax: ListSyntax,\n    ): ColumnTarget {\n        if (domain === \"graph\") {\n            this.sink.setGraphValue(decl.name, undefined, decl);\n            this.graphColumnNames.add(decl.name);\n            return { name: decl.name, handle: INVALID_INDEX as ColumnHandle, decl, spec, listSyntax };\n        }\n        const resolved = declareResolved(this.sink, domain, decl, this.report, { element: decl.name });\n        return { name: resolved.decl.name, handle: resolved.handle, decl: resolved.decl, spec, listSyntax };\n    }\n\n    /**\n     * The `taken` predicate of a domain: the reserved XML-derived names plus the sink's columns.\n     * @param domain - the domain\n     * @returns the predicate\n     */\n    private takenIn(domain: Domain): (name: string) => boolean {\n        if (domain === \"graph\") {\n            return (name: string): boolean => this.graphColumnNames.has(name);\n        }\n        const reserved = domain === \"node\" ? RESERVED_NODE_NAMES : RESERVED_EDGE_NAMES;\n        const inSink = takenIn(this.sink, domain);\n        return (name: string): boolean => reserved.has(name) || inSink(name);\n    }\n\n    // ------------------------------------------------------------------ data and defaults\n\n    /**\n     * Open a `<data>`.\n     * @param attrs - its attributes\n     * @param line - the line\n     * @param domain - the domain of the element holding it\n     */\n    private beginData(attrs: ReadonlyMap<string, string>, line: number, domain: Domain): void {\n        this.reportUnreadAttributes(\"data\", attrs, DATA_ATTRIBUTES, line);\n        const keyId = attrs.get(\"key\");\n        const { content } = this;\n        if (keyId !== undefined) {\n            this.checkDuplicateData(keyId, domain, line);\n        }\n        content.key = null;\n        content.pendingKey = null;\n        content.domain = domain;\n        content.text = \"\";\n        content.tree = null;\n        content.line = line;\n        if (keyId === undefined) {\n            this.report.error(\"validation-error\", GRAPHML_ISSUE.DATA_MISSING_KEY, \"<data> without a key attribute\", {\n                line,\n            });\n        } else {\n            const entries = this.keys.get(keyId);\n            const key = entries?.find((entry) => entry.domains.includes(domain)) ?? entries?.[0];\n            if (key === undefined) {\n                this.unknownKeyIds.add(keyId);\n                this.report.error(\n                    \"validation-error\",\n                    GRAPHML_ISSUE.UNKNOWN_KEY,\n                    `<data> references undeclared key \"${keyId}\"`,\n                    { line, element: keyId },\n                );\n            } else if (!key.skipped && !key.domains.includes(domain)) {\n                this.report.warnOnce(\n                    \"validation-error\",\n                    GRAPHML_ISSUE.KEY_DOMAIN,\n                    `key \"${keyId}\" is declared for ${key.domains.join(\" / \")} elements but used on a ${domain}; ignored`,\n                    { line, element: keyId },\n                );\n            } else {\n                content.key = key;\n            }\n        }\n        this.ctx.push(Ctx.Data);\n    }\n\n    /**\n     * Report a second `<data>` of one key on one element; the later value is kept (it overwrites).\n     * @param keyId - the key\n     * @param domain - the domain of the element holding it\n     * @param line - the line\n     */\n    private checkDuplicateData(keyId: string, domain: Domain, line: number): void {\n        let holder: { keys: Set<string> | null } | null = null;\n        if (domain === \"node\") {\n            holder = this.nodes.at(-1) ?? null;\n        } else if (domain === \"edge\") {\n            holder = this.edge;\n        } else {\n            holder = this.graphKeys;\n        }\n        if (holder === null) {\n            return;\n        }\n        holder.keys ??= new Set();\n        if (holder.keys.has(keyId)) {\n            this.report.warning(\n                \"validation-error\",\n                GRAPHML_ISSUE.DUPLICATE_ATTRIBUTE,\n                `a second <data key=\"${keyId}\"> on one ${domain}; the later value is kept`,\n                { line, element: keyId },\n            );\n        }\n        holder.keys.add(keyId);\n    }\n\n    /**\n     * A child element inside `<data>` / `<default>`: the content becomes a tree.\n     * @param name - the element name\n     * @param attrs - its attributes\n     */\n    private captureStart(name: string, attrs: ReadonlyMap<string, string>): void {\n        const { content } = this;\n        if (content.tree === null) {\n            content.tree = new XmlTreeBuilder();\n            if (content.text.length > 0) {\n                content.tree.text(content.text);\n                content.text = \"\";\n            }\n        }\n        content.tree.start(name, attrs);\n        this.ctx.push(Ctx.Capture);\n    }\n\n    /** A captured element ends. */\n    private captureEnd(): void {\n        this.content.tree?.end();\n    }\n\n    /** Close a `<default>`: keep its text or tree for the key. */\n    private finishDefault(): void {\n        const { content } = this;\n        const key = content.pendingKey;\n        if (key === null) {\n            return;\n        }\n        if (content.tree !== null) {\n            key.defaultTree = content.tree.finish();\n        } else {\n            key.defaultText = content.text;\n        }\n        content.tree = null;\n        content.text = \"\";\n        content.pendingKey = null;\n    }\n\n    /** Close a `<data>`: parse the value and route it to its element. */\n    private finishData(): void {\n        const { content } = this;\n        const { key } = content;\n        const value: unknown = content.tree === null ? content.text : content.tree.finish();\n        content.tree = null;\n        content.text = \"\";\n        content.key = null;\n        if (key === null || key.skipped) {\n            return;\n        }\n        const where = { line: content.line, element: key.id };\n        switch (content.domain) {\n            case \"node\": {\n                const node = this.nodes[this.nodes.length - 1];\n                if (key.originalId) {\n                    if (typeof value !== \"string\" || node.index !== INVALID_INDEX) {\n                        this.report.warning(\n                            \"validation-error\",\n                            GRAPHML_ISSUE.ORIGINAL_ID_IGNORED,\n                            typeof value === \"string\"\n                                ? `the ${ORIGINAL_ID_ATTRIBUTE} value comes after the node's nested <graph>, which added the node under its written id; it is not restored`\n                                : `the ${ORIGINAL_ID_ATTRIBUTE} value holds elements, not text; it is not restored`,\n                            where,\n                        );\n                        return;\n                    }\n                    node.restoredId = value;\n                    return;\n                }\n                if (key.yfiles) {\n                    for (const [handle, mapped] of this.graphics(\"node\", key, value, where)) {\n                        this.setNodeData(node, handle, mapped);\n                    }\n                }\n                if (key.node === null) {\n                    return;\n                }\n                const parsed = this.parseValue(key.node, value, where);\n                if (parsed !== undefined) {\n                    this.setNodeData(node, key.node.handle, parsed);\n                }\n                return;\n            }\n            case \"edge\": {\n                const { edge } = this;\n                if (edge === null) {\n                    return;\n                }\n                if (key.weight) {\n                    if (typeof value !== \"string\") {\n                        this.report.error(\n                            \"validation-error\",\n                            GRAPHML_ISSUE.DATA_NESTED,\n                            \"a weight value must be text\",\n                            where,\n                        );\n                        return;\n                    }\n                    if (edge.weightKey !== null && edge.weightKey !== key.id) {\n                        this.report.warning(\n                            \"validation-error\",\n                            GRAPHML_ISSUE.DUPLICATE_ATTRIBUTE,\n                            `the edge has values of two weight keys (\"${edge.weightKey}\" and \"${key.id}\"); the later one is kept`,\n                            where,\n                        );\n                    }\n                    edge.weightKey = key.id;\n                    try {\n                        edge.weight = parseWeightText(value, this.report);\n                        this.checkOverflow(value, edge.weight, key.name, where);\n                    } catch (err) {\n                        this.skipEdge(edge);\n                        this.report.recordError(err, where);\n                    }\n                    return;\n                }\n                if (key.yfiles) {\n                    for (const [handle, mapped] of this.graphics(\"edge\", key, value, where)) {\n                        edge.pending.push(handle, mapped);\n                    }\n                }\n                if (key.edge === null) {\n                    return;\n                }\n                const parsed = this.parseValue(key.edge, value, where);\n                if (parsed !== undefined) {\n                    edge.pending.push(key.edge.handle, parsed);\n                }\n                return;\n            }\n            case \"graph\": {\n                if (key.graph === null) {\n                    return;\n                }\n                const parsed = this.parseValue(key.graph, value, where);\n                if (parsed !== undefined) {\n                    try {\n                        this.sink.setGraphValue(key.graph.name, parsed, key.graph.decl);\n                    } catch (err) {\n                        this.report.recordError(err, where);\n                    }\n                }\n                return;\n            }\n            default: {\n                const { domain } = content;\n                throw new GraphFormatError(\"E_UNSUPPORTED\", `unknown data domain ${String(domain)}`, {});\n            }\n        }\n    }\n\n    /**\n     * Write a node value now, or keep it until the node is added.\n     * @param node - the node state\n     * @param handle - the column\n     * @param value - the value\n     */\n    private setNodeData(node: NodeState, handle: ColumnHandle, value: unknown): void {\n        if (node.index === INVALID_INDEX) {\n            node.pending.push(handle, value);\n        } else if (!node.failed) {\n            this.sink.setNodeValue(handle, node.index, value);\n        }\n    }\n\n    /**\n     * The typed values mapped from a yFiles graphics tree (yfiles.ts), each with its column,\n     * declared on first use.\n     * @param domain - node or edge\n     * @param key - the yFiles key\n     * @param tree - the `<data>` content\n     * @param where - the location for issues\n     * @returns column handle and value pairs\n     */\n    private graphics(domain: \"node\" | \"edge\", key: KeyEntry, tree: unknown, where: Where): [ColumnHandle, unknown][] {\n        const out: [ColumnHandle, unknown][] = [];\n        const unmapped: string[] = [];\n        const values = graphicsValues(domain, tree, unmapped);\n        for (const field of unmapped) {\n            this.report.warnOnce(\n                \"validation-error\",\n                GRAPHML_ISSUE.YFILES_VALUE,\n                `a yFiles ${domain} ${field} that is not a number is not mapped to its yfiles column (the graphics tree is kept)`,\n                where,\n                `${GRAPHML_ISSUE.YFILES_VALUE}:${domain}:${field}`,\n            );\n        }\n        for (const [field, value] of values) {\n            const id = `${domain}:${field}`;\n            let handle = this.graphicsColumns.get(id);\n            if (handle === undefined) {\n                try {\n                    ({ handle } = declareResolved(\n                        this.sink,\n                        domain,\n                        graphicsDecl(domain, field, key.id),\n                        this.report,\n                        where,\n                    ));\n                } catch (err) {\n                    this.report.recordError(err, where);\n                    continue;\n                }\n                this.graphicsColumns.set(id, handle);\n            }\n            out.push([handle, value]);\n        }\n        return out;\n    }\n\n    /**\n     * Parse the content of a `<data>` by its column's declaration.\n     * @param target - the column\n     * @param value - the text, or the tree of a nested subtree\n     * @param where - the location for issues\n     * @returns the value to write, or undefined when there is none (blank, or an error was recorded)\n     */\n    private parseValue(target: ColumnTarget, value: unknown, where: Where): unknown {\n        if (target.spec === null) {\n            if (!this.yfilesLossNoted) {\n                this.yfilesLossNoted = true;\n                this.report.loss(\n                    GRAPHML_LOSS.YFILES_JSON,\n                    \"yFiles nested XML is kept as a JSON tree: structure preserved, not byte-exact\",\n                    target.name,\n                );\n            }\n            return value;\n        }\n        if (typeof value !== \"string\" && target.spec.declared === \"\") {\n            // an untyped key states no type the elements contradict: keep them as their XML text\n            this.report.warnOnce(\n                \"validation-error\",\n                GRAPHML_ISSUE.DATA_STRUCTURED,\n                `<data> of the untyped attribute \"${target.name}\" holds elements; they are kept as XML text`,\n                { line: where.line, element: target.name },\n                `${GRAPHML_ISSUE.DATA_STRUCTURED}:${target.name}`,\n            );\n            const parts: string[] = [];\n            writeXmlTree(value, \"\", parts);\n            return parts.join(\"\").trim();\n        }\n        if (typeof value !== \"string\") {\n            this.report.error(\n                \"validation-error\",\n                GRAPHML_ISSUE.DATA_NESTED,\n                `<data> of the ${target.spec.declared} attribute \"${target.name}\" holds elements, not text`,\n                where,\n            );\n            return undefined;\n        }\n        const { spec } = target;\n        if (spec.kind !== \"string\" && isWhitespace(value)) {\n            return undefined;\n        }\n        try {\n            const parsed = parseDeclaredValue(value, spec, target.listSyntax);\n            if (spec.precision && losesPrecision(spec, value)) {\n                this.report.warnOnce(\n                    \"precision\",\n                    PRECISION_CODE,\n                    `long values of \"${target.name}\" beyond 2^53 are stored as the nearest double`,\n                    { line: where.line, element: target.name },\n                );\n            }\n            this.checkOverflow(value, parsed, target.name, where);\n            return parsed;\n        } catch (err) {\n            this.report.recordError(err, where);\n            return undefined;\n        }\n    }\n\n    /**\n     * Report (once per column) a finite number text too large for a double, stored as Infinity.\n     * @param text - the value text\n     * @param value - the parsed value\n     * @param column - the column name\n     * @param where - the location\n     */\n    private checkOverflow(text: string, value: unknown, column: string, where: Where): void {\n        if (typeof value === \"number\" && overflowsToInfinity(text)) {\n            this.report.warnOnce(\n                \"precision\",\n                PRECISION_CODE,\n                `values of \"${column}\" beyond the double range (${text.trim()}) are stored as Infinity`,\n                { line: where.line, element: column },\n                `${PRECISION_CODE}:overflow:${column}`,\n            );\n        }\n    }\n\n    // ------------------------------------------------------------------ nodes\n\n    /**\n     * Open a `<node>`; it is added to the sink when its data is complete (or a nested graph\n     * starts), so a `graphty:originalId` value can replace its id.\n     * @param attrs - the node attributes\n     * @param line - the line\n     */\n    private beginNode(attrs: ReadonlyMap<string, string>, line: number): void {\n        this.reportUnreadAttributes(\"node\", attrs, NODE_ATTRIBUTES, line);\n        const graph = this.graphs[this.graphs.length - 1];\n        graph.nodes++;\n        const state: NodeState = {\n            id: null,\n            idText: null,\n            index: INVALID_INDEX,\n            parent: graph.parent,\n            pending: [],\n            restoredId: null,\n            failed: false,\n            line,\n            keys: null,\n        };\n        const idText = attrs.get(\"id\");\n        if (idText === undefined || idText.length === 0) {\n            this.skipNode(state);\n            this.report.error(\"missing-value\", GRAPHML_ISSUE.MISSING_ID, \"<node> without an id\", { line });\n        } else {\n            try {\n                state.id = this.coercer.text(idText);\n                state.idText = idText;\n                this.reportMerge(idText, line);\n            } catch (err) {\n                this.skipNode(state);\n                this.report.recordError(err, { line, element: idText });\n            }\n        }\n        this.nodes.push(state);\n        this.ctx.push(Ctx.Node);\n    }\n\n    /**\n     * Add a node to the sink and flush its pending values.\n     * @param node - the node state\n     */\n    private materializeNode(node: NodeState): void {\n        if (node.index !== INVALID_INDEX || node.failed) {\n            return;\n        }\n        const id: NodeId | null = node.restoredId ?? node.id;\n        if (id === null) {\n            node.failed = true;\n            return;\n        }\n        if (node.restoredId !== null && node.idText !== null) {\n            this.restored.set(node.idText, node.restoredId);\n        }\n        try {\n            const existing = this.sink.indexOf(id);\n            const index = this.sink.addNode(id);\n            if (existing !== INVALID_INDEX && this.hubs.has(index)) {\n                this.report.warning(\n                    \"validation-error\",\n                    GRAPHML_ISSUE.HUB_ID_CLASH,\n                    `node \"${String(id)}\" has the id of the hub a star-expanded hyperedge created earlier; the node is merged into the hub`,\n                    { line: node.line, element: String(id) },\n                );\n            } else if (existing !== INVALID_INDEX && this.declared.has(index)) {\n                this.report.warning(\n                    \"validation-error\",\n                    GRAPHML_ISSUE.DUPLICATE_NODE,\n                    `node \"${String(id)}\" is declared twice; the declarations are merged`,\n                    { line: node.line, element: String(id) },\n                );\n            } else {\n                this.report.counts.nodes++;\n            }\n            this.declared.add(index);\n            node.index = index;\n            this.checkAbort();\n            if (node.parent !== INVALID_INDEX) {\n                this.sink.setNodeValue(this.parentColumn(), index, node.parent);\n            }\n            const { pending } = node;\n            for (let i = 0; i < pending.length; i += 2) {\n                this.sink.setNodeValue(pending[i] as ColumnHandle, index, pending[i + 1]);\n            }\n            pending.length = 0;\n        } catch (err) {\n            this.skipNode(node);\n            this.report.recordError(err, { line: node.line, element: String(id) });\n        }\n    }\n\n    /**\n     * Mark a node element skipped (once) before its error is recorded, so the report's counts\n     * include it even when that error is the one that exceeds the limit.\n     * @param node - the node state\n     */\n    private skipNode(node: NodeState): void {\n        if (!node.failed) {\n            node.failed = true;\n            this.report.counts.skippedNodes++;\n        }\n    }\n\n    /** Close a `<node>`. */\n    private finishNode(): void {\n        const node = this.nodes.pop();\n        if (node !== undefined) {\n            this.materializeNode(node);\n        }\n    }\n\n    /**\n     * The `parent` column, declared on first use.\n     * @returns the handle\n     */\n    private parentColumn(): ColumnHandle {\n        if (this.parentHandle === INVALID_INDEX) {\n            this.parentHandle = this.sink.declareNodeColumn({\n                name: PARENT_COLUMN,\n                dtype: \"u32\",\n                role: \"parent\",\n                refersTo: \"node\",\n                nullable: true,\n                origin: { format: FORMAT, id: null, title: null, type: \"graph\", namespace: null },\n            });\n        }\n        return this.parentHandle;\n    }\n\n    // ------------------------------------------------------------------ edges\n\n    /**\n     * Open an `<edge>`; it is pushed at `</edge>` once its weight and data are known.\n     * @param attrs - the edge attributes\n     * @param line - the line\n     */\n    private beginEdge(attrs: ReadonlyMap<string, string>, line: number): void {\n        this.reportUnreadAttributes(\"edge\", attrs, EDGE_ATTRIBUTES, line);\n        const graph = this.graphs[this.graphs.length - 1];\n        graph.edges++;\n        const idText = attrs.get(\"id\");\n        const sourceText = attrs.get(\"source\");\n        const targetText = attrs.get(\"target\");\n        const edge: EdgeState = {\n            source: null,\n            target: null,\n            // an exporter that writes id=\"\" for an edge without one: the same as no id\n            id: idText === undefined || idText.length === 0 ? null : idText,\n            kind: graph.directed ? \"directed\" : \"undirected\",\n            sourcePort: attrs.get(\"sourceport\") ?? null,\n            targetPort: attrs.get(\"targetport\") ?? null,\n            weight: undefined,\n            pending: [],\n            failed: false,\n            line,\n            keys: null,\n            weightKey: null,\n            sourceText: sourceText ?? null,\n            targetText: targetText ?? null,\n        };\n        const where = { line, element: edge.id };\n        if (sourceText === undefined || sourceText.length === 0) {\n            this.skipEdge(edge);\n            this.report.error(\"missing-value\", GRAPHML_ISSUE.MISSING_ENDPOINT, \"<edge> without a source\", where);\n        }\n        if (targetText === undefined || targetText.length === 0) {\n            this.skipEdge(edge);\n            this.report.error(\"missing-value\", GRAPHML_ISSUE.MISSING_ENDPOINT, \"<edge> without a target\", where);\n        }\n        if (!edge.failed && sourceText !== undefined && targetText !== undefined) {\n            try {\n                edge.source = this.endpointId(sourceText, line);\n                edge.target = this.endpointId(targetText, line);\n            } catch (err) {\n                this.skipEdge(edge);\n                this.report.recordError(err, where);\n            }\n        }\n        const directedText = attrs.get(\"directed\");\n        if (directedText !== undefined) {\n            // the schema types directed as xs:boolean: true, false, 1 or 0\n            if (directedText === \"true\" || directedText === \"1\") {\n                edge.kind = \"directed\";\n            } else if (directedText === \"false\" || directedText === \"0\") {\n                edge.kind = \"undirected\";\n            } else {\n                this.skipEdge(edge);\n                this.report.error(\n                    \"validation-error\",\n                    GRAPHML_ISSUE.INVALID_DIRECTED,\n                    `directed=\"${directedText}\" is neither true nor false (nor 1 or 0)`,\n                    where,\n                );\n            }\n        }\n        this.edge = edge;\n        this.ctx.push(Ctx.Edge);\n    }\n\n    /**\n     * Close an `<edge>`: push it through the direction resolver and write its values.\n     */\n    private finishEdge(): void {\n        const { edge } = this;\n        this.edge = null;\n        if (edge === null) {\n            return;\n        }\n        if (edge.failed || edge.source === null || edge.target === null) {\n            this.skipEdge(edge);\n            return;\n        }\n        if (\n            (!this.options.addMissingNodes &&\n                (this.sink.indexOf(edge.source) === INVALID_INDEX ||\n                    this.sink.indexOf(edge.target) === INVALID_INDEX)) ||\n            (edge.id !== null && this.deferredEdgeIds.has(edge.id))\n        ) {\n            // GraphML allows nodes and edges in any order: wait for the end of the document. An\n            // edge reusing a waiting edge's id waits behind it, so the first one keeps the id.\n            if (edge.id !== null) {\n                this.deferredEdgeIds.add(edge.id);\n            }\n            this.deferred.push(edge);\n            return;\n        }\n        this.addEdge(edge);\n    }\n\n    /**\n     * Push an edge through the direction resolver and write its values.\n     * @param edge - the edge, its endpoints known\n     */\n    private addEdge(edge: EdgeState): void {\n        if (edge.source === null || edge.target === null) {\n            return;\n        }\n        const element = edge.id ?? `${String(edge.source)} -> ${String(edge.target)}`;\n        const where = { line: edge.line, element };\n        try {\n            if (!this.options.addMissingNodes) {\n                this.requireNode(edge.source);\n                this.requireNode(edge.target);\n            }\n            this.checkGraphEndpoint(edge.source, edge.sourceText, where);\n            this.checkGraphEndpoint(edge.target, edge.targetText, where);\n            if (edge.id !== null && this.edgeIds.has(edge.id)) {\n                throw new GraphFormatError(\"E_DUPLICATE_EDGE_ID\", `edge id \"${edge.id}\" is used twice`, {\n                    id: edge.id,\n                });\n            }\n            const before = this.sink.edgeCount;\n            this.countEndpoints(edge.source, edge.target);\n            const e = this.direction.addEdge(edge.source, edge.target, edge.kind, edge.weight, where);\n            this.report.counts.edges += this.sink.edgeCount - before;\n            this.checkAbort();\n            if (edge.id !== null) {\n                this.edgeIds.add(edge.id);\n                this.sink.setEdgeValue(this.edgeIdColumn(), e, edge.id);\n            }\n            if (edge.sourcePort !== null) {\n                this.sink.setEdgeValue(this.portColumn(\"source\"), e, edge.sourcePort);\n                this.portRefs.push([edge.source, edge.sourcePort]);\n            }\n            if (edge.targetPort !== null) {\n                this.sink.setEdgeValue(this.portColumn(\"target\"), e, edge.targetPort);\n                this.portRefs.push([edge.target, edge.targetPort]);\n            }\n            const { pending } = edge;\n            for (let i = 0; i < pending.length; i += 2) {\n                this.sink.setEdgeValue(pending[i] as ColumnHandle, e, pending[i + 1]);\n            }\n        } catch (err) {\n            this.skipEdge(edge);\n            this.report.recordError(err, where);\n        }\n    }\n\n    /**\n     * Mark an edge (or hyperedge) element skipped once, before its error is recorded.\n     * @param edge - the edge state\n     */\n    private skipEdge(edge: EdgeState | HyperedgeState): void {\n        if (!edge.failed) {\n            edge.failed = true;\n            this.report.counts.skippedEdges++;\n        }\n    }\n\n    /**\n     * Report an endpoint that names a nested `<graph>` rather than a node (a node of that id is\n     * then created under addMissingNodes).\n     * @param id - the endpoint id\n     * @param text - the endpoint as written, or null\n     * @param where - the edge's location\n     */\n    private checkGraphEndpoint(id: NodeId, text: string | null, where: Where): void {\n        if (text !== null && this.graphIds.has(text) && this.sink.indexOf(id) === INVALID_INDEX) {\n            this.report.warning(\n                \"validation-error\",\n                GRAPHML_ISSUE.GRAPH_ENDPOINT,\n                `edge endpoint \"${text}\" names a <graph>, not a node; a node \"${text}\" is created`,\n                where,\n            );\n        }\n    }\n\n    /**\n     * E_UNKNOWN_NODE when an endpoint was never declared (addMissingNodes false enforced by the\n     * importer, whatever the sink allows).\n     * @param id - the endpoint id\n     */\n    private requireNode(id: NodeId): void {\n        if (this.sink.indexOf(id) === INVALID_INDEX) {\n            throw new GraphFormatError(\"E_UNKNOWN_NODE\", `edge endpoint \"${String(id)}\" is not a declared node`, {\n                id,\n            });\n        }\n    }\n\n    /**\n     * The edge `id` column (role id, unique), declared on first use.\n     * @returns the handle\n     */\n    private edgeIdColumn(): ColumnHandle {\n        if (this.edgeIdHandle === INVALID_INDEX) {\n            this.edgeIdHandle = this.sink.declareEdgeColumn({\n                name: EDGE_ID_COLUMN,\n                dtype: \"string\",\n                role: \"id\",\n                unique: true,\n                nullable: true,\n                origin: { format: FORMAT, id: null, title: null, type: \"id\", namespace: null },\n            });\n        }\n        return this.edgeIdHandle;\n    }\n\n    /**\n     * The sourceport / targetport column, declared on first use.\n     * @param side - which end\n     * @returns the handle\n     */\n    private portColumn(side: \"source\" | \"target\"): ColumnHandle {\n        if (side === \"source\") {\n            if (this.sourcePortHandle === INVALID_INDEX) {\n                this.sourcePortHandle = this.sink.declareEdgeColumn({\n                    name: SOURCE_PORT_COLUMN,\n                    dtype: \"string\",\n                    role: \"sourcePort\",\n                    nullable: true,\n                    origin: { format: FORMAT, id: null, title: null, type: \"sourceport\", namespace: null },\n                });\n            }\n            return this.sourcePortHandle;\n        }\n        if (this.targetPortHandle === INVALID_INDEX) {\n            this.targetPortHandle = this.sink.declareEdgeColumn({\n                name: TARGET_PORT_COLUMN,\n                dtype: \"string\",\n                role: \"targetPort\",\n                nullable: true,\n                origin: { format: FORMAT, id: null, title: null, type: \"targetport\", namespace: null },\n            });\n        }\n        return this.targetPortHandle;\n    }\n\n    // ------------------------------------------------------------------ hyperedges\n\n    /**\n     * Open a `<hyperedge>` per the hyperedges option.\n     * @param attrs - its attributes\n     * @param line - the line\n     */\n    private beginHyperedge(attrs: ReadonlyMap<string, string>, line: number): void {\n        this.reportUnreadAttributes(\"hyperedge\", attrs, HYPEREDGE_ATTRIBUTES, line);\n        const id = attrs.get(\"id\") ?? null;\n        const where = { line, element: id };\n        switch (this.options.hyperedges) {\n            case \"error\":\n                this.report.error(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.HYPEREDGE,\n                    'hyperedge refused (hyperedges: \"error\")',\n                    where,\n                );\n                throw this.report.abort(\"hyperedge refused\", { code: GRAPHML_ISSUE.HYPEREDGE });\n            case \"skip\":\n                this.report.warnOnce(\n                    \"unsupported\",\n                    GRAPHML_ISSUE.HYPEREDGE_SKIPPED,\n                    'hyperedges are skipped (hyperedges: \"skip\"); use \"star\" or \"clique\" to expand them',\n                    where,\n                );\n                this.report.counts.skippedEdges++;\n                this.ctx.push(Ctx.Skip);\n                return;\n            case \"star\":\n            case \"clique\":\n                this.hyperedge = { id, endpoints: [], failed: false, line };\n                this.ctx.push(Ctx.Hyperedge);\n                return;\n            default: {\n                const policy: never = this.options.hyperedges;\n                throw new GraphFormatError(\"E_UNSUPPORTED\", `unknown hyperedges policy ${String(policy)}`, {\n                    option: \"hyperedges\",\n                });\n            }\n        }\n    }\n\n    /**\n     * An `<endpoint>` of the open hyperedge.\n     * @param attrs - its attributes\n     * @param line - the line\n     */\n    private readEndpoint(attrs: ReadonlyMap<string, string>, line: number): void {\n        const { hyperedge } = this;\n        if (hyperedge === null) {\n            return;\n        }\n        const where = { line, element: hyperedge.id };\n        const nodeText = attrs.get(\"node\");\n        const typeText = attrs.get(\"type\") ?? \"undir\";\n        if (nodeText === undefined || nodeText.length === 0) {\n            this.skipEdge(hyperedge);\n            this.report.error(\"missing-value\", GRAPHML_ISSUE.HYPEREDGE_ENDPOINT, \"<endpoint> without a node\", where);\n            return;\n        }\n        if (typeText !== \"in\" && typeText !== \"out\" && typeText !== \"undir\") {\n            this.skipEdge(hyperedge);\n            this.report.error(\n                \"validation-error\",\n                GRAPHML_ISSUE.HYPEREDGE_ENDPOINT,\n                `endpoint type \"${typeText}\" is not in, out or undir`,\n                where,\n            );\n            return;\n        }\n        try {\n            const node = this.endpointId(nodeText, line);\n            hyperedge.endpoints.push({ node, type: typeText });\n        } catch (err) {\n            this.skipEdge(hyperedge);\n            this.report.recordError(err, where);\n        }\n    }\n\n    /** Close a `<hyperedge>`: expand it to a star or a clique. */\n    private finishHyperedge(): void {\n        const { hyperedge } = this;\n        this.hyperedge = null;\n        if (hyperedge === null) {\n            return;\n        }\n        if (hyperedge.failed) {\n            return;\n        }\n        if (hyperedge.endpoints.length === 0) {\n            this.skipEdge(hyperedge);\n            this.report.error(\n                \"missing-value\",\n                GRAPHML_ISSUE.HYPEREDGE_ENDPOINT,\n                \"<hyperedge> without endpoints yields no edge\",\n                { line: hyperedge.line, element: hyperedge.id },\n            );\n            return;\n        }\n        if (\n            !this.options.addMissingNodes &&\n            hyperedge.endpoints.some((endpoint) => this.sink.indexOf(endpoint.node) === INVALID_INDEX)\n        ) {\n            this.deferred.push(hyperedge);\n            return;\n        }\n        this.expandHyperedge(hyperedge);\n    }\n\n    /**\n     * Expand a hyperedge to a star or a clique; under addMissingNodes false every endpoint must be\n     * a declared node.\n     * @param hyperedge - the hyperedge, its endpoints read\n     */\n    private expandHyperedge(hyperedge: HyperedgeState): void {\n        const where = { line: hyperedge.line, element: hyperedge.id };\n        try {\n            for (const endpoint of hyperedge.endpoints) {\n                if (!this.options.addMissingNodes) {\n                    this.requireNode(endpoint.node);\n                }\n            }\n            for (const node of new Set(hyperedge.endpoints.map((endpoint) => endpoint.node))) {\n                this.countEndpoints(node, node);\n            }\n            if (this.options.hyperedges === \"star\") {\n                this.expandStar(hyperedge, where);\n            } else if (this.expandClique(hyperedge, where) === 0) {\n                this.skipEdge(hyperedge);\n                this.report.error(\n                    \"validation-error\",\n                    GRAPHML_ISSUE.HYPEREDGE_ENDPOINT,\n                    \"no two endpoints of this hyperedge can be joined (all in, all out, or only one); it yields no edge\",\n                    where,\n                );\n            }\n        } catch (err) {\n            this.skipEdge(hyperedge);\n            this.report.recordError(err, where);\n        }\n    }\n\n    /**\n     * Star expansion: a synthetic hub node (marked in the `graphty.hyperedge` column) joined to\n     * every endpoint; `in` endpoints point at the hub, `out` endpoints are pointed at by it,\n     * `undir` endpoints are undirected.\n     * @param hyperedge - the hyperedge\n     * @param where - the location for issues\n     */\n    private expandStar(hyperedge: HyperedgeState, where: Where): void {\n        this.hyperedgeCount++;\n        const baseId = hyperedge.id ?? `hyperedge${this.hyperedgeCount}`;\n        let hubId = baseId;\n        for (let n = 2; this.sink.indexOf(hubId) !== INVALID_INDEX; n++) {\n            hubId = `${baseId}#${n}`;\n        }\n        const hub = this.sink.addNode(hubId);\n        this.declared.add(hub);\n        this.hubs.add(hub);\n        this.report.counts.nodes++;\n        if (this.hubHandle === INVALID_INDEX) {\n            this.hubHandle = this.sink.declareNodeColumn({\n                name: HYPEREDGE_HUB_COLUMN,\n                dtype: \"bool\",\n                nullable: true,\n                origin: { format: FORMAT, id: null, title: null, type: \"hyperedge\", namespace: null },\n            });\n        }\n        this.sink.setNodeValue(this.hubHandle, hub, true);\n        for (const endpoint of hyperedge.endpoints) {\n            const before = this.sink.edgeCount;\n            switch (endpoint.type) {\n                case \"in\":\n                    this.direction.addEdge(endpoint.node, hubId, \"directed\", undefined, where);\n                    break;\n                case \"out\":\n                    this.direction.addEdge(hubId, endpoint.node, \"directed\", undefined, where);\n                    break;\n                case \"undir\":\n                    this.direction.addEdge(endpoint.node, hubId, \"undirected\", undefined, where);\n                    break;\n                default: {\n                    const { type } = endpoint;\n                    throw new GraphFormatError(\"E_UNSUPPORTED\", `unknown endpoint type ${String(type)}`, {});\n                }\n            }\n            this.report.counts.edges += this.sink.edgeCount - before;\n        }\n    }\n\n    /**\n     * Clique expansion: every `in` endpoint points at every `out` endpoint; `undir` endpoints are\n     * joined undirected to every other endpoint; two endpoints of the same direction are not joined.\n     * @param hyperedge - the hyperedge\n     * @param where - the location for issues\n     * @returns the number of edge elements added\n     */\n    private expandClique(hyperedge: HyperedgeState, where: Where): number {\n        const { endpoints } = hyperedge;\n        let added = 0;\n        for (let i = 0; i < endpoints.length; i++) {\n            for (let j = i + 1; j < endpoints.length; j++) {\n                const a = endpoints[i];\n                const b = endpoints[j];\n                const before = this.sink.edgeCount;\n                if (a.type === \"undir\" || b.type === \"undir\") {\n                    this.direction.addEdge(a.node, b.node, \"undirected\", undefined, where);\n                } else if (a.type === \"in\" && b.type === \"out\") {\n                    this.direction.addEdge(a.node, b.node, \"directed\", undefined, where);\n                } else if (a.type === \"out\" && b.type === \"in\") {\n                    this.direction.addEdge(b.node, a.node, \"directed\", undefined, where);\n                } else {\n                    continue;\n                }\n                added++;\n                this.report.counts.edges += this.sink.edgeCount - before;\n            }\n        }\n        return added;\n    }\n\n    // ------------------------------------------------------------------ options and ids\n\n    /**\n     * Count the endpoints of an edge the file never declared as nodes of the sink (created under\n     * addMissingNodes), so the report describes what the sink holds (design section 8.6).\n     * @param source - the source id\n     * @param target - the target id\n     */\n    private countEndpoints(source: NodeId, target: NodeId): void {\n        if (!this.options.addMissingNodes) {\n            return;\n        }\n        let created = 0;\n        if (this.sink.indexOf(source) === INVALID_INDEX) {\n            created++;\n        }\n        if (source !== target && this.sink.indexOf(target) === INVALID_INDEX) {\n            created++;\n        }\n        this.report.counts.nodes += created;\n    }\n\n    /** Check the cancellation signal every ABORT_CHECK_INTERVAL elements. */\n    private checkAbort(): void {\n        if (++this.elementsSinceCheck >= ABORT_CHECK_INTERVAL) {\n            this.elementsSinceCheck = 0;\n            throwIfAborted(this.options.signal);\n        }\n    }\n\n    /**\n     * The id an edge endpoint refers to: the original id when the text is a mangled id restored\n     * from `graphty:originalId` (the exporter writes endpoints with the mangled id), else the\n     * coerced text.\n     * @param text - the source / target / endpoint node text\n     * @param line - the line\n     * @returns the node id\n     */\n    private endpointId(text: string, line: number): NodeId {\n        const restored = this.restored.get(text);\n        if (restored !== undefined) {\n            return restored;\n        }\n        const id = this.coercer.text(text);\n        this.reportMerge(text, line);\n        return id;\n    }\n\n    /**\n     * Report a merge the coercer detected under ids: \"number\".\n     * @param text - the id text just coerced\n     * @param line - the line\n     */\n    private reportMerge(text: string, line: number): void {\n        const merge = this.coercer.lastMerge;\n        if (merge !== null) {\n            this.report.warning(\n                \"coercion\",\n                GRAPHML_ISSUE.ID_MERGED,\n                `id \"${merge.text}\" merged with \"${merge.previousText}\" as ${merge.id} under ids: \"number\"`,\n                { line, element: text },\n            );\n        }\n    }\n}\n\n/**\n * A `parse.nodes` / `parse.edges` hint as a count.\n * @param text - the attribute text\n * @returns the count, or null when absent or not a non-negative integer\n */\nfunction hint(text: string | undefined): number | null {\n    if (text === undefined || !/^\\d+$/.test(text)) {\n        return null;\n    }\n    const n = Number(text);\n    return Number.isSafeInteger(n) ? n : null;\n}\n\n/**\n * Resolve the format-specific options.\n * @param options - the caller's options\n * @returns the yfiles mode\n */\nfunction resolveYfiles(options: GraphmlImportOptions | undefined): \"json\" | \"skip\" {\n    const value = options?.yfiles;\n    if (value === undefined) {\n        return \"json\";\n    }\n    if (typeof value !== \"string\" || !YFILES_MODES.has(value)) {\n        throw new GraphFormatError(\"E_UNSUPPORTED\", `option yfiles: ${JSON.stringify(value)} is not \"json\" or \"skip\"`, {\n            option: \"yfiles\",\n            found: value,\n        });\n    }\n    return value;\n}\n\n/**\n * Confidence that a head of bytes is GraphML.\n * @param head - the first bytes\n * @returns 1 for a `<graphml` root in the GraphML namespace, 0.9 for a `<graphml` root, 0.05 for other XML, 0 otherwise\n *     or when the head does not start with markup\n */\nfunction sniffGraphml(head: Uint8Array): number {\n    const text = sniffXmlText(head.subarray(0, SNIFF_BYTES));\n    // Only a document that starts as markup: a JSON or CSV value may mention a `<graphml>` tag.\n    if (!/^\\uFEFF?\\s*</.test(text)) {\n        return 0;\n    }\n    // the root may carry a namespace prefix (<g:graphml xmlns:g=\"...\">)\n    const root = text.search(/<([\\w.-]+:)?graphml[\\s>/]/);\n    if (root >= 0) {\n        return text.includes(GRAPHML_NAMESPACE, root) ? 1 : 0.9;\n    }\n    return /^\\s*<(\\?xml|!--|!DOCTYPE)/.test(text) ? 0.05 : 0;\n}\n\n/**\n * Import GraphML into a sink.\n * @param input - the document\n * @param sink - the sink\n * @param options - format-specific and common options\n * @returns the report; ImportError when the document cannot be read or the error limit is exceeded\n */\nasync function importGraphml(\n    input: ImportInput,\n    sink: GraphSink,\n    options?: GraphmlImportOptions & CommonImportOptions,\n): Promise<ImportReport> {\n    const common = resolveImportOptions(options, FORMAT_DEFAULTS);\n    const yfilesMode = resolveYfiles(options);\n    const report = new ImportReportBuilder(FORMAT, common.errorLimit);\n    reportSinkOptions(sink, options, report, true);\n    reportUnusedOptions(options, report, USED_OPTIONS);\n    const reader = new GraphmlReader(sink, report, common, yfilesMode);\n    try {\n        await tokenizeXml(\n            textChunks(input, report, { ...common, declaredEncoding: xmlDeclaredEncoding, xml: true }),\n            reader,\n        );\n    } catch (err) {\n        if (err instanceof XmlEmptyInputError) {\n            report.fail(GRAPHML_ISSUE.EMPTY_INPUT, \"the input is empty (no markup at all)\", { line: err.line });\n        }\n        if (err instanceof XmlSyntaxError) {\n            report.fail(\n                err instanceof XmlNestingError ? GRAPHML_ISSUE.XML_NESTING : GRAPHML_ISSUE.XML_SYNTAX,\n                err.message,\n                { line: err.line },\n            );\n        }\n        throw err;\n    }\n    reader.finish();\n    throwIfAborted(common.signal);\n    return report.finish();\n}\n\n/**\n * The GraphML importer.\n * @category Built-in formats\n */\nexport const graphmlImporter: GraphImporter<GraphmlImportOptions> = Object.freeze({\n    format: FORMAT,\n    options: Object.freeze([\"yfiles\"]),\n    extensions: EXTENSIONS,\n    mimeTypes: MIME_TYPES,\n    sniff: sniffGraphml,\n    styles: graphmlStyles,\n    positions: yfilesPositions,\n    import: importGraphml,\n});\n\n/** The elements GraphML defines, for telling a misplaced one from a foreign one. */\nconst GRAPHML_ELEMENTS = new Set([\n    \"graphml\",\n    \"key\",\n    \"default\",\n    \"graph\",\n    \"node\",\n    \"edge\",\n    \"hyperedge\",\n    \"endpoint\",\n    \"port\",\n    \"data\",\n    \"desc\",\n    \"locator\",\n]);\n\n/**\n * The message of an element skipped where it stands.\n * @param name - the element name\n * @returns a message that says where a GraphML element belongs, or that a foreign one is not GraphML\n */\nfunction unknownElementMessage(name: string): string {\n    if (name === \"key\") {\n        return \"element <key> is only allowed as a child of <graphml>, before the first <graph>; it was skipped\";\n    }\n    return GRAPHML_ELEMENTS.has(name)\n        ? `element <${name}> is not allowed at this place in a GraphML file and was skipped`\n        : `element <${name}> is not GraphML and was skipped`;\n}\n"],"names":["text","child","yfilesColumns","attr","hint"],"mappings":";;;;;;;;;;;;;AAoBA,MAAM,mBAAmB;AAGzB,MAAM,WAAW;AAoBV,MAAM,eAAe;AAAA;AAAA,EAMxB,cAAc;AALd,SAAiB,SAAkB,CAAA;AAM/B,SAAK,OAAO,EAAE,MAAM,IAAI,MAAM,CAAA,GAAI,UAAU,OAAO,aAAa,OAAO,MAAM,GAAA;AAAA,EACjF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAI,OAAgB;AAChB,WAAO,KAAK,OAAO,SAAS;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,MAAc,OAA0C;AAC1D,UAAM,OAAsB,CAAA;AAC5B,QAAI,WAAW;AACf,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO;AAC9B,WAAK,mBAAmB,GAAG,IAAI;AAC/B,iBAAW;AAAA,IACf;AACA,SAAK,OAAO,KAAK,EAAE,MAAM,MAAM,UAAU,aAAa,OAAO,MAAM,GAAA,CAAI;AAAA,EAC3E;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,KAAKA,OAAoB;AACrB,UAAM,QAAQ,KAAK,OAAO,GAAG,EAAE,KAAK,KAAK;AACzC,UAAM,QAAQA;AAAA,EAClB;AAAA;AAAA,EAGA,MAAY;AACR,UAAM,QAAQ,KAAK,OAAO,IAAA;AAC1B,QAAI,UAAU,QAAW;AACrB,YAAM,IAAI,iBAAiB,iBAAiB,mDAAmD;AAAA,QAC3F,QAAQ;AAAA,MAAA,CACX;AAAA,IACL;AACA,UAAM,SAAS,KAAK,OAAO,GAAG,EAAE,KAAK,KAAK;AAC1C,gBAAY,QAAQ,MAAM,MAAM,QAAQ,KAAK,CAAC;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAkB;AACd,QAAI,KAAK,OAAO,SAAS,GAAG;AACxB,YAAM,IAAI,iBAAiB,iBAAiB,8CAA8C;AAAA,QACtF,QAAQ;AAAA,MAAA,CACX;AAAA,IACL;AACA,UAAM,EAAE,SAAS;AACjB,QAAI,CAAC,KAAK,aAAa;AACnB,aAAO,KAAK;AAAA,IAChB;AACA,QAAI,CAAC,aAAa,KAAK,IAAI,GAAG;AAC1B,WAAK,KAAK,QAAQ,IAAI,KAAK;AAAA,IAC/B;AACA,WAAO,KAAK;AAAA,EAChB;AACJ;AAQA,SAAS,QAAQ,OAAuB;AACpC,MAAI,CAAC,MAAM,YAAY,CAAC,MAAM,aAAa;AACvC,WAAO,MAAM;AAAA,EACjB;AACA,MAAI,CAAC,aAAa,MAAM,IAAI,GAAG;AAC3B,UAAM,KAAK,QAAQ,IAAI,MAAM;AAAA,EACjC;AACA,SAAO,MAAM;AACjB;AAQA,SAAS,YAAY,QAAe,MAAc,OAAsB;AACpE,SAAO,cAAc;AAErB,QAAM,WAAW,OAAO,OAAO,OAAO,MAAM,IAAI,IAAI,OAAO,KAAK,IAAI,IAAI;AACxE,MAAI,aAAa,QAAW;AACxB,WAAO,eAAe,OAAO,MAAM,MAAM,EAAE,OAAO,UAAU,MAAM,YAAY,MAAM,cAAc,KAAA,CAAM;AAAA,EAC5G,WAAW,MAAM,QAAQ,QAAQ,GAAG;AAChC,aAAS,KAAK,KAAK;AAAA,EACvB,OAAO;AACH,WAAO,KAAK,IAAI,IAAI,CAAC,UAAU,KAAK;AAAA,EACxC;AACJ;AAoBO,SAAS,YAAY,OAA+B;AACvD,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AACxG,WAAO;AAAA,EACX;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACtB,eAAW,QAAQ,OAAO;AACtB,UAAI,MAAM,QAAQ,IAAI,GAAG;AACrB,eAAO;AAAA,MACX;AACA,YAAM,UAAU,YAAY,IAAI;AAChC,UAAI,YAAY,MAAM;AAClB,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACA,MAAI,OAAO,UAAU,UAAU;AAC3B,WAAO,KAAK,OAAO,KAAK;AAAA,EAC5B;AACA,aAAW,CAAC,KAAKC,MAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AAC9C,QAAI,QAAQ,UAAU;AAClB,UAAIA,WAAU,QAAQ,OAAOA,WAAU,UAAU;AAC7C,eAAO;AAAA,MACX;AACA;AAAA,IACJ;AACA,QAAI,IAAI,WAAW,gBAAgB,GAAG;AAClC,YAAM,OAAO,IAAI,MAAM,iBAAiB,MAAM;AAC9C,UAAI,CAAC,UAAU,IAAI,GAAG;AAClB,eAAO,IAAI,IAAI;AAAA,MACnB;AACA,UAAIA,WAAU,QAAQ,OAAOA,WAAU,UAAU;AAC7C,eAAO,aAAa,IAAI;AAAA,MAC5B;AACA;AAAA,IACJ;AACA,QAAI,CAAC,UAAU,GAAG,GAAG;AACjB,aAAO,IAAI,GAAG;AAAA,IAClB;AACA,UAAM,UAAU,YAAYA,MAAK;AACjC,QAAI,YAAY,MAAM;AAClB,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AAWO,SAAS,aAAa,OAAgB,QAAgB,KAAqB;AAC9E,QAAM,UAAU,YAAY,KAAK;AACjC,MAAI,YAAY,MAAM;AAClB,UAAM,IAAI,iBAAiB,iBAAiB,4CAA4C,OAAO,IAAI;AAAA,MAC/F,QAAQ;AAAA,IAAA,CACX;AAAA,EACL;AACA,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG;AACrE,QAAI,KAAK,cAAc,WAAW,KAAK,CAAC,CAAC;AACzC;AAAA,EACJ;AACA,QAAM,SAAS;AACf,MAAID,QAAsB;AAC1B,aAAW,CAAC,KAAKC,MAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC/C,QAAI,QAAQ,UAAU;AAClB,MAAAD,QAAO,WAAWC,MAAK;AAAA,IAC3B,WAAW,CAAC,IAAI,WAAW,gBAAgB,GAAG;AAC1C,oBAAc,KAAKA,QAAO,QAAQ,GAAG;AAAA,IACzC;AAAA,EACJ;AACA,MAAID,UAAS,MAAM;AACf,QAAI,KAAK,cAAcA,KAAI,CAAC;AAAA,EAChC;AACJ;AAWA,SAAS,cAAc,MAAc,OAAgB,QAAuB,KAAqB;AAC7F,MAAI,MAAM,QAAQ,KAAK,GAAG;AACtB,eAAW,QAAQ,OAAO;AACtB,oBAAc,MAAM,MAAM,QAAQ,GAAG;AAAA,IACzC;AACA;AAAA,EACJ;AACA,QAAM,MAAM,WAAW,OAAO,KAAK;AAAA,EAAK,MAAM;AAC9C,MAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAC7C,UAAMA,QAAO,WAAW,KAAK;AAC7B,QAAI,KAAKA,MAAK,WAAW,IAAI,GAAG,GAAG,IAAI,IAAI,OAAO,GAAG,GAAG,IAAI,IAAI,IAAI,cAAcA,KAAI,CAAC,KAAK,IAAI,GAAG;AACnG;AAAA,EACJ;AACA,qBAAmB,MAAM,OAAwB,QAAQ,GAAG;AAChE;AASA,SAAS,mBAAmB,MAAc,QAAuB,QAAuB,KAAqB;AACzG,QAAM,MAAM,WAAW,OAAO,KAAK;AAAA,EAAK,MAAM;AAC9C,QAAM,EAAE,OAAO,MAAAA,OAAM,YAAA,IAAgB,aAAa,MAAM;AACxD,MAAI,CAAC,aAAa;AACd,QAAI;AAAA,MACAA,UAAS,QAAQA,MAAK,WAAW,IAC3B,GAAG,GAAG,IAAI,IAAI,GAAG,KAAK,OACtB,GAAG,GAAG,IAAI,IAAI,GAAG,KAAK,IAAI,cAAcA,KAAI,CAAC,KAAK,IAAI;AAAA,IAAA;AAEhE;AAAA,EACJ;AAEA,QAAM,QAAQ,WAAW,QAAQA,UAAS,OAAO,OAAO,GAAG,MAAM;AACjE,MAAI,KAAK,GAAG,GAAG,IAAI,IAAI,GAAG,KAAK,GAAG;AAClC,MAAIA,UAAS,MAAM;AACf,QAAI,KAAK,cAAcA,KAAI,CAAC;AAAA,EAChC;AACA,aAAW,CAAC,KAAKC,MAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC/C,QAAI,QAAQ,YAAY,CAAC,IAAI,WAAW,gBAAgB,GAAG;AACvD,oBAAc,KAAKA,QAAO,OAAO,GAAG;AAAA,IACxC;AAAA,EACJ;AACA,MAAI,KAAK,UAAU,OAAO,KAAK,IAAI,MAAM,GAAG,GAAG,KAAK,IAAI,GAAG;AAC/D;AAOA,SAAS,aAAa,QAAqF;AACvG,MAAI,QAAQ;AACZ,MAAID,QAAsB;AAC1B,MAAI,cAAc;AAClB,aAAW,CAAC,KAAKC,MAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC/C,QAAI,QAAQ,UAAU;AAClB,MAAAD,QAAO,WAAWC,MAAK;AAAA,IAC3B,WAAW,IAAI,WAAW,gBAAgB,GAAG;AACzC,eAAS,IAAI,IAAI,MAAM,iBAAiB,MAAM,CAAC,KAAK,mBAAmB,WAAWA,MAAK,CAAC,CAAC;AAAA,IAC7F,OAAO;AACH,oBAAc;AAAA,IAClB;AAAA,EACJ;AACA,SAAO,EAAE,OAAO,MAAAD,OAAM,YAAA;AAC1B;AAOA,SAAS,WAAW,OAAwB;AACxC,UAAQ,OAAO,OAAA;AAAA,IACX,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACD,aAAO,OAAO,KAAK;AAAA,IACvB;AACI,aAAO;AAAA,EAAA;AAEnB;AC/TA,MAAM,uBAAuB;AAK7B,MAAM,cAAkE;AAAA;AAAA,EAEpE,UAAU;AAAA,IACN,OAAO;AAAA,IACP,YAAY;AAAA,IACZ,MAAM;AAAA,IACN,SAAS;AAAA,IACT,OAAO;AAAA,MACH,OAAO;AAAA,MACP,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,OAAO,GAAG,oBAAoB;AAAA,MAC9B,QAAQ,GAAG,oBAAoB;AAAA,IAAA;AAAA,EACnC;AAAA,EAEJ,OAAO,EAAE,OAAO,MAAA;AAAA,EAChB,QAAQ,EAAE,OAAO,MAAA;AAAA,EACjB,OAAO,EAAE,OAAO,SAAA;AAAA,EAChB,aAAa,EAAE,OAAO,SAAA;AAAA,EACtB,aAAa,EAAE,OAAO,MAAA;AAAA,EACtB,OAAO,EAAE,OAAO,UAAU,MAAM,QAAA;AAAA,EAChC,OAAO,EAAE,OAAO,SAAA;AACpB;AAGA,MAAM,cAAkE;AAAA,EACpE,OAAO,EAAE,OAAO,SAAA;AAAA,EAChB,OAAO,EAAE,OAAO,MAAA;AAAA,EAChB,UAAU,EAAE,OAAO,OAAA;AAAA,EACnB,aAAa,EAAE,OAAO,SAAA;AAAA,EACtB,aAAa,EAAE,OAAO,SAAA;AAC1B;AAUO,SAAS,aAAa,QAAyB,OAAe,OAA2B;AAC5F,QAAM,SAAS,WAAW,SAAS,cAAc;AACjD,SAAO;AAAA,IACH,GAAG,OAAO,KAAK;AAAA,IACf,MAAM,uBAAuB;AAAA,IAC7B,UAAU;AAAA,IACV,QAAQ;AAAA,MACJ,QAAQ;AAAA,MACR,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,MAAM,WAAW,SAAS,cAAc;AAAA,MACxC,WAAW;AAAA,IAAA;AAAA,EACf;AAER;AAQO,SAAS,gBAAgB,UAAmD;AAC/E,SAAO,SAAS,MAAM,OAAO,UAAU,GAAG,KAAK,QAAQ,cAAc,WAAW,EAAE,MAAM,MAAA,IAAU;AACtG;AAWO,SAAS,iBAAiB,MAIrB;AACR,SAAO,KAAK,UAAU,UAAU,KAAK,QAAQ,cAAc,YAAY,KAAK,KAAK,WAAW,oBAAoB;AACpH;AAcO,SAAS,kBAAkB,QAAgB,OAAyB,QAAiC;AACxG,QAAM,QAAQ,OAAO,KAAK,KAAK,MAAM,qBAAqB,MAAM;AAChE,QAAM,QAAsB,CAAA;AAC5B,aAAW,KAAK,OAAO;AACnB,QAAI,EAAE,UAAU,UAAU,EAAE,KAAK,QAAQ,cAAc,UAAU;AAC7D,YAAM,KAAK,CAAC;AAAA,IAChB;AAAA,EACJ;AACA,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,UAAM,QAAQ,eAAe,OAAO,QAAQ,OAAO,CAAC;AACpD,UAAM,QAAQ,OAAO,MAAM,CAAC;AAC5B,UAAM,OAAO,OAAO,KAAK,aAAa,KAAK,UAAU,SAAY,MAAM,KAAK,KAA0B,IAAI;AAC1G,QAAI,CAAC,MAAM,IAAI,KAAK,UAAU,IAAI,CAAC,GAAG;AAClC;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;AAUA,SAAS,eAAe,OAAqB,QAAyB,OAAe,GAAwB;AACzG,QAAM,4BAAY,IAAA;AAClB,aAAW,QAAQ,OAAO;AACtB,UAAM,OAAO,eAAe,QAAQ,KAAK,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,MAAM,KAAK;AAC7E,QAAI,SAAS,QAAW;AACpB,YAAM,IAAI,KAAK,UAAU,KAAK,CAAC,CAAC,CAAC;AAAA,IACrC;AAAA,EACJ;AACA,MAAI,MAAM,SAAS,GAAG;AAClB,UAAM,IAAI,KAAK,UAAU,MAAS,CAAC;AAAA,EACvC;AACA,SAAO;AACX;AAaO,SAAS,eAAe,QAAyB,MAAe,WAAqB,CAAA,GAAyB;AACjH,QAAM,MAA2B,CAAA;AACjC,MAAI,WAAW,QAAQ;AACnB,UAAM,QAAQ,MAAM,MAAM,WAAW;AACrC,UAAM,OAAO,MAAM,MAAM,OAAO;AAChC,QAAI,SAAS,QAAW;AAEpB;AAAA,QACI;AAAA,UACI,OAAO,KAAK,MAAM,GAAG;AAAA,UACrB,OAAO,KAAK,MAAM,GAAG;AAAA,UACrB,WAAW,KAAK,MAAM,OAAO;AAAA,UAC7B,YAAY,KAAK,MAAM,QAAQ;AAAA,QAAA;AAAA,QAEnC;AAAA,QACA;AAAA,MAAA;AAAA,IAER,WAAW,UAAU,QAAW;AAC5B,qBAAe,MAAM,aAAa,IAAI,GAAG,UAAU,GAAG,KAAK,QAAQ;AAAA,IACvE,OAAO;AACH,sBAAgB,OAAO,KAAK,QAAQ;AAAA,IACxC;AAAA,EACJ,OAAO;AACH,UAAM,OAAO,MAAM,MAAM,cAAc;AACvC,QAAI,SAAS,QAAW;AACpB,yBAAmB,MAAM,KAAK,QAAQ;AAAA,IAC1C;AAAA,EACJ;AACA,SAAO;AACX;AAQA,SAAS,gBAAgB,OAAgB,KAA0B,UAA0B;AACzF,iBAAe,MAAM,OAAO,UAAU,GAAG,KAAK,QAAQ;AACtD,OAAK,KAAK,SAAS,MAAM,KAAK,MAAM,OAAO,MAAM,GAAG,OAAO,CAAC,CAAC;AAC7D,QAAM,SAAS,MAAM,OAAO,aAAa;AACzC,OAAK,KAAK,eAAe,MAAM,KAAK,QAAQ,OAAO,CAAC,CAAC;AACrD,OAAK,KAAK,eAAe,QAAQ,KAAK,QAAQ,OAAO,GAAG,eAAe,QAAQ,CAAC;AAChF,QAAM,QAAQ,MAAM,OAAO,WAAW;AAEtC,MAAI,OAAO,UAAU,WAAW,MAAM,SAAS,IAAI,UAAU,QAAW;AAEpE,QAAI,KAAK,CAAC,UAAU,OAAO,UAAU,WAAW,QAAS,KAAK,KAAK,KAAK,IAAK,KAAA,CAAM,CAAC;AAAA,EACxF;AACA,OAAK,KAAK,SAAS,SAAS,KAAK,MAAM,OAAO,OAAO,GAAG,MAAM,CAAC,CAAC;AACpE;AAQA,SAAS,eAAe,UAAmB,KAA0B,UAA0B;AAE3F,QAAM,IAAI,QAAQ,KAAK,UAAU,GAAG,GAAG,KAAK,QAAQ;AACpD,QAAM,IAAI,QAAQ,KAAK,UAAU,GAAG,GAAG,KAAK,QAAQ;AACpD,MAAI,MAAM,UAAa,MAAM,QAAW;AACpC,QAAI,KAAK,CAAC,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,EACpC;AACA,OAAK,KAAK,SAAS,QAAQ,KAAK,UAAU,OAAO,GAAG,SAAS,QAAQ,CAAC;AACtE,OAAK,KAAK,UAAU,QAAQ,KAAK,UAAU,QAAQ,GAAG,UAAU,QAAQ,CAAC;AAC7E;AAGA,MAAM,iBAAiB,CAAC,eAAe,aAAa,WAAW,gBAAgB,eAAe,WAAW;AAQzG,SAAS,aAAa,MAAwB;AAC1C,aAAW,SAAS,gBAAgB;AAChC,UAAM,OAAO,MAAM,MAAM,KAAK;AAC9B,QAAI,SAAS,QAAW;AACpB,aAAO;AAAA,IACX;AAAA,EACJ;AACA,QAAM,YAAY,MAAM,MAAM,MAAM,qBAAqB,GAAG,WAAW;AACvE,QAAM,SAAS,OAAO,SAAS,KAAK,WAAW,QAAQ,KAAK,KAAK,EAAE;AACnE,SAAO,SAAS,SAAS,EAAE,OAAO,MAAM,MAAM,IAAI,IAAI,MAAM;AAChE;AAOA,SAAS,SAAS,MAA0B;AACxC,MAAI,OAAO,SAAS,YAAY,SAAS,MAAM;AAC3C,WAAO,CAAA;AAAA,EACX;AACA,SAAO,OAAO,QAAQ,IAAY,EAC7B,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,WAAW,IAAI,KAAK,QAAQ,OAAO,EAC1D,QAAQ,CAAC,CAAA,EAAG,KAAK,MAAO,MAAM,QAAQ,KAAK,IAAK,QAAsB,CAAC,KAAK,CAAE;AACvF;AAQA,SAAS,mBAAmB,MAAe,KAA0B,UAA0B;AAC3F,QAAM,OAAO,MAAM,MAAM,WAAW;AACpC,OAAK,KAAK,SAAS,MAAM,KAAK,MAAM,OAAO,CAAC,CAAC;AAC7C,OAAK,KAAK,SAAS,QAAQ,KAAK,MAAM,OAAO,GAAG,SAAS,QAAQ,CAAC;AAClE,QAAM,SAAS,MAAM,MAAM,QAAQ;AACnC,MAAI,WAAW,UAAa,OAAO,WAAW,UAAU;AACpD,UAAM,SAAS,KAAK,QAAQ,QAAQ;AACpC,UAAM,SAAS,KAAK,QAAQ,QAAQ;AAEpC,QAAI,KAAK,CAAC,YAAY,WAAW,UAAa,WAAW,MAAM,CAAC;AAChE,SAAK,KAAK,eAAe,WAAW,SAAS,SAAY,SAAS,MAAM,CAAC;AACzE,SAAK,KAAK,eAAe,WAAW,SAAS,SAAY,SAAS,MAAM,CAAC;AAAA,EAC7E;AACJ;AAQA,SAAS,KAAK,KAA0B,OAAe,OAAsB;AACzE,MAAI,UAAU,QAAW;AACrB,QAAI,KAAK,CAAC,OAAO,KAAK,CAAC;AAAA,EAC3B;AACJ;AAQA,SAAS,MAAM,MAAe,OAAwB;AAClD,MAAI,OAAO,SAAS,YAAY,SAAS,MAAM;AAC3C,WAAO;AAAA,EACX;AACA,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAAY,GAAG;AACrD,QAAI,CAAC,IAAI,WAAW,IAAI,KAAK,QAAQ,WAAW,UAAU,GAAG,MAAM,OAAO;AACtE,aAAO,MAAM,QAAQ,KAAK,IAAI,MAAM,CAAC,IAAI;AAAA,IAC7C;AAAA,EACJ;AACA,SAAO;AACX;AAQA,SAAS,KAAK,MAAe,MAAkC;AAC3D,MAAI,OAAO,SAAS,YAAY,SAAS,MAAM;AAC3C,WAAO;AAAA,EACX;AACA,QAAM,QAAS,KAAc,KAAK,IAAI,EAAE;AACxC,SAAO,OAAO,UAAU,WAAW,QAAQ;AAC/C;AAOA,SAAS,KAAK,MAAmC;AAC7C,QAAM,QAAQ,OAAO,SAAS,YAAY,SAAS,OAAQ,KAAc,OAAO,IAAI;AACpF,SAAO,OAAO,UAAU,WAAW,QAAQ;AAC/C;AAOA,SAAS,SAAS,OAA+C;AAC7D,SAAO,UAAU,UAAa,MAAM,WAAW,IAAI,SAAY;AACnE;AAOA,SAAS,OAAO,OAA+C;AAC3D,MAAI,UAAU,UAAa,MAAM,WAAW,GAAG;AAC3C,WAAO;AAAA,EACX;AACA,QAAM,IAAI,OAAO,WAAW,KAAK;AACjC,SAAO,OAAO,MAAM,CAAC,IAAI,SAAY;AACzC;AASA,SAAS,QAAQ,OAA2B,OAAe,UAAwC;AAC/F,QAAM,IAAI,OAAO,KAAK;AACtB,MAAI,MAAM,UAAa,UAAU,UAAa,MAAM,SAAS,GAAG;AAC5D,aAAS,KAAK,KAAK;AAAA,EACvB;AACA,SAAO;AACX;AAOA,SAAS,MAAM,OAA+C;AAC1D,MAAI,UAAU,UAAa,MAAM,WAAW,GAAG;AAC3C,WAAO;AAAA,EACX;AACA,MAAI,oBAAoB,KAAK,KAAK,GAAG;AACjC,WAAO,MAAM,YAAA;AAAA,EACjB;AACA,MAAI,oBAAoB,KAAK,KAAK,GAAG;AACjC,UAAM,GAAG,GAAG,GAAG,CAAC,IAAI;AACpB,WAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,YAAA;AAAA,EACvC;AACA,SAAO;AACX;ACzUA,MAAM,eAAmC,aAAa;AAAA,EAClD,gBAAgB;AAAA,EAChB,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,SAAS;AAAA,EACT,WAAW;AAAA,EACX,QAAQ,CAAC,QAAQ,OAAO,OAAO,OAAO,QAAQ;AAAA,EAC9C,YAAY;AAAA,EACZ,OAAO;AAAA,EACP,MAAM;AAAA,EACN,UAAU;AAAA,EACV,SAAS;AAAA,EACT,WAAW;AAAA,EACX,UAAU;AAAA,EACV,iBAAiB;AAAA,EACjB,WAAW;AAAA,EACX,KAAK;AACT,CAAC;AAGD,MAAM,uCAA4C,IAAI;AAAA,EAClD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC;AACD,MAAM,oCAAyC,IAAI;AAAA,EAC/C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC;AAMD,MAAM,iCAAsC,IAAI,CAAC,SAAS,MAAM,cAAc,cAAc,QAAQ,CAAC;AAGrG,MAAM,uBAAsE;AAAA,EACxE,2BAAW,IAAA;AAAA,EACX,MAAM,oBAAI,IAAI,CAAC,QAAQ,CAAC;AAAA,EACxB,MAAM,oBAAI,IAAI,CAAC,MAAM,cAAc,YAAY,CAAC;AACpD;AAGA,MAAM,aAA+C,OAAO,OAAO;AAAA,EAC/D,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,YAAY;AAAA,EACZ,YAAY;AAAA,EACZ,QAAQ;AACZ,CAAC;AAGD,MAAM,sBAAsB;AAM5B,MAAM,cAAgD;AAAA,EAClD,SAAS;AAAA,EACT,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AACZ;AAEA,MAAM,UAAU;AAGhB,MAAM,uBAAyD;AAAA,EAC3D,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AACX;AAsFA,SAAS,qBAAqB,SAA0D;AACpF,QAAM,SAAS,SAAS,UAAU;AAClC,MAAI,OAAO,WAAW,WAAW;AAC7B,UAAM,IAAI,iBAAiB,iBAAiB,mCAAmC;AAAA,MAC3E,QAAQ;AAAA,MACR,OAAO,OAAO;AAAA,IAAA,CACjB;AAAA,EACL;AACA,QAAM,cAAc,SAAS,eAAe;AAC5C,MAAI,gBAAgB,QAAQ,gBAAgB,cAAc,gBAAgB,cAAc;AACpF,UAAM,IAAI;AAAA,MACN;AAAA,MACA,uBAAuB,KAAK,UAAU,WAAW,CAAC;AAAA,MAClD,EAAE,QAAQ,eAAe,OAAO,YAAA;AAAA,IAAY;AAAA,EAEpD;AACA,SAAO,EAAE,QAAQ,YAAA;AACrB;AAOA,SAAS,cAAc,UAA6C;AAChE,QAAM,QAAQ,SAAS,KAAK,MAAM,QAAQ;AAC1C,MAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAC7C,WAAO;AAAA,EACX;AACA,QAAM,SAAS;AACf,QAAM,UAAU,OAAO,OAAO,YAAY,WAAW,OAAO,UAAU;AACtE,QAAM,cACF,OAAO,gBAAgB,cAAc,OAAO,gBAAgB,eAAe,OAAO,cAAc;AACpG,QAAM,aAAqC,CAAA;AAC3C,MAAI,OAAO,OAAO,eAAe,YAAY,OAAO,eAAe,MAAM;AACrE,eAAW,CAAC,QAAQ,GAAG,KAAK,OAAO,QAAQ,OAAO,UAAqC,GAAG;AACtF,UAAI,OAAO,QAAQ,UAAU;AACzB,mBAAW,MAAM,IAAI;AAAA,MACzB;AAAA,IACJ;AAAA,EACJ;AACA,SAAO,EAAE,SAAS,aAAa,WAAA;AACnC;AAWA,SAAS,WACL,UACA,SACA,QACA,aAAa,OACT;AAIJ,QAAM,WAAW,IAAI;AAAA,IACjB,CAAC,GAAG,SAAS,OAAO,GAAG,SAAS,KAAK,EAAE,OAAO,CAAC,MAAM,iBAAiB,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,IAAI;AAAA,EAAA;AAEzG,QAAM,QAAQ,kBAAkB,UAAU,cAAc,SAAS;AAAA,IAC7D,OAAO;AAAA,IACP,WAAW;AAAA,EAAA,CACd,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,SAAS,EAAE,WAAW,QAAQ,CAAC,SAAS,IAAI,EAAE,MAAM,EAAE;AACvF,QAAM,OAAe,CAAC,MAAM,SAAS,SAAS,MAAM,QAAQ,SAAe;AACvE,UAAM,KAAK,OAAO,OAAO,EAAE,MAAM,SAAS,QAAQ,MAAA,CAAO,CAAC;AAAA,EAC9D;AACA,QAAM,KAAK,GAAG,oBAAoB,QAAQ,CAAC;AAC3C,QAAM,OAAO,cAAc,QAAQ;AACnC,QAAM,SAAS,IAAI,OAAA;AAEnB,QAAM,eAAe,UAAU,SAAS,OAAO,SAAS,OAAO,IAAI;AACnE,QAAM,cAAc,UAAU,SAAS,OAAO,QAAQ,OAAO,IAAI;AACjE,QAAM,cAAc,UAAU,SAAS,OAAO,QAAQ,OAAO,IAAI;AACjE,QAAM,OAAO,SAAS,CAAC,GAAG,cAAc,GAAG,aAAa,GAAG,WAAW,GAAG,MAAM;AAC/E,MAAI,YAAY;AAIZ,UAAM,WAAW,IAAI,IAAI,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AACtD,UAAM,QAAQ,CAAC,GAAe,OACzB,SAAS,IAAI,EAAE,KAAK,KAAK,MAAM,SAAS,IAAI,EAAE,KAAK,KAAK;AAC7D,gBAAY,KAAK,KAAK;AACtB,gBAAY,KAAK,KAAK;AAAA,EAC1B;AACA,oBAAkB,aAAa,qBAAqB,IAAI;AACxD,oBAAkB,aAAa,qBAAqB,IAAI;AACxD,QAAM,SAAS,WAAW,UAAU,aAAa,QAAQ,MAAM,IAAI;AAGnE,QAAM,gBAAgB,mBAAmB,QAAQ;AACjD,MAAI,gBAAgB,GAAG;AACnB;AAAA,MACI,aAAa;AAAA,MACb,GAAG,aAAa,WAAW,OAAO,aAAa,CAAC,IAAI,MAAM,eAAe,WAAW,QAAQ,CAAC;AAAA,MAC7F;AAAA,MACA;AAAA,IAAA;AAAA,EAER;AACA,QAAM,eAAe,SAAS,MAAM,OAAO,IAAI;AAC/C,MAAI,iBAAiB,MAAM;AACvB,gBAAY,UAAU,cAAc,SAAS,IAAI;AAAA,EACrD;AACA,QAAM,kBAAkB,4BAA4B,QAAQ;AAC5D,QAAM,qBAAqB,kBAAkB,KAAK,QAAQ,gBAAgB;AAC1E,QAAM,gBAAgB,qBAAqB,OAAO,KAAK,IAAI,IAAI;AAG/D,QAAM,UAAU,YAAY,UAAU,EAAE,YAAY,MAAM;AAC1D,MAAI,QAAQ,cAAc,GAAG;AACzB;AAAA,MACI,aAAa;AAAA,MACb,GAAG,QAAQ,WAAW,eAAe,OAAO,QAAQ,WAAW,CAAC,IAAI,MAAM,QAAQ,aAAa,MAAM,KAAK,CAAC;AAAA,MAC3G;AAAA,MACA,QAAQ;AAAA,IAAA;AAAA,EAEhB;AACA,QAAM,cAAc,gBAAgB,UAAU,SAAS,QAAQ,IAAI;AAGnE,QAAM,YAAY,cAAc,QAAQ;AACxC,MAAI,UAAU,WAAW;AACrB;AAAA,MACI,aAAa;AAAA,MACb;AAAA,MACA,UAAU,QAAQ,KAAK,QAAQ;AAAA,IAAA;AAAA,EAEvC;AACA,MAAI,UAAU,cAAc,GAAG;AAC3B;AAAA,MACI,aAAa;AAAA,MACb,GAAG,UAAU,WAAW,QAAQ,OAAO,UAAU,WAAW,CAAC,4CAA4C,MAAM,UAAU,aAAa,MAAM,KAAK,CAAC;AAAA,MAClJ,UAAU,QAAQ,KAAK,QAAQ;AAAA,MAC/B,UAAU;AAAA,IAAA;AAAA,EAElB;AAEA,SAAO;AAAA,IACH;AAAA,IACA,QAAQ,OAAO;AAAA,IACf;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,kBAAkB,SAAS,MAAM,OAAO,YAAY;AAAA,IACpD,kBAAkB,SAAS,MAAM,OAAO,YAAY;AAAA,IACpD;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAER;AAUA,SAAS,kBAAkB,OAA8B,UAA+B,MAAoB;AACxG,aAAW,QAAQ,OAAO;AACtB,UAAM,EAAE,QAAQ,UAAU,MAAA,IAAU;AACpC,QAAI,aAAa,QAAQ,CAAC,SAAS,IAAI,QAAQ,GAAG;AAC9C;AAAA,IACJ;AACA;AAAA,MACI,KAAK;AAAA,MACL,GAAG,KAAK,MAAM,YAAY,OAAO,KAAK,IAAI,mCAAmC,QAAQ,8BAA8B,QAAQ,IAAI,KAAK;AAAA,MACpI,OAAO,KAAK;AAAA,MACZ,OAAO,SAAS,OAAO;AAAA,IAAA;AAAA,EAE/B;AACJ;AAGA,MAAM,OAAO;AAAA,EAAb,cAAA;AACI,SAAiB,2BAAW,IAAA;AAC5B,SAAQ,UAAU;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOlB,KAAK,WAAkC;AACnC,QAAI,cAAc,QAAQ,UAAU,SAAS,KAAK,CAAC,KAAK,KAAK,IAAI,SAAS,GAAG;AACzE,WAAK,KAAK,IAAI,SAAS;AACvB,aAAO;AAAA,IACX;AACA,eAAS;AACL,YAAM,YAAY,IAAI,KAAK,OAAO;AAClC,WAAK;AACL,UAAI,CAAC,KAAK,KAAK,IAAI,SAAS,GAAG;AAC3B,aAAK,KAAK,IAAI,SAAS;AACvB,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,EACJ;AACJ;AASA,SAAS,SAAS,KAA4B,QAA2B;AACrE,QAAM,OAAkB,CAAA;AACxB,QAAM,+BAAe,IAAA;AACrB,aAAW,QAAQ,KAAK;AACpB,UAAM,EAAE,OAAA,IAAW,KAAK,OAAO;AAC/B,QAAI,WAAW,QAAQ,OAAO,WAAW,UAAU,OAAO,OAAO,MAAM;AACnE,YAAM,QAAQ,SAAS,IAAI,OAAO,EAAE,KAAK,CAAA;AACzC,YAAM,KAAK,IAAI;AACf,eAAS,IAAI,OAAO,IAAI,KAAK;AAAA,IACjC;AAAA,EACJ;AACA,QAAM,8BAAc,IAAA;AACpB,aAAW,QAAQ,KAAK;AACpB,QAAI,QAAQ,IAAI,IAAI,GAAG;AACnB;AAAA,IACJ;AACA,UAAM,EAAE,OAAA,IAAW,KAAK,OAAO;AAC/B,UAAM,QACF,WAAW,QAAQ,OAAO,WAAW,UAAU,OAAO,OAAO,OACtD,SAAS,IAAI,OAAO,EAAE,KAAK,CAAC,IAAI,IACjC,CAAC,IAAI;AACf,UAAM,SAAS,MAAM,SAAS,KAAK,MAAM,MAAM,CAAC,UAAU,UAAU,QAAQ,QAAQ,MAAM,KAAK,CAAC;AAChG,UAAM,UAAU,SAAS,QAAQ,CAAC,IAAI;AACtC,UAAM,KAAK,OAAO,KAAK,WAAW,QAAQ,OAAO,WAAW,SAAS,OAAO,KAAK,IAAI;AACrF,eAAW,UAAU,SAAS;AAC1B,aAAO,QAAQ;AACf,cAAQ,IAAI,MAAM;AAAA,IACtB;AACA,UAAM,UAAU,QAAQ,IAAI,CAAC,WAAW,OAAO,MAAM;AAErD,UAAM,aAAa,KAAK,OAAO,KAAK,QAAQ,SAAS,KAAK,OAAO,KAAK;AACtE,QAAI,EAAE,aAAa;AACnB,QAAI,KAAK,QAAQ;AACb,iBAAW,eAAe,KAAK,OAAO;AAAA,IAC1C;AACA,SAAK,KAAK;AAAA,MACN;AAAA,MACA,SAAS,QAAQ,SAAS,IAAI,CAAC,SAAS,QAAQ,MAAM,IAAI;AAAA,MAC1D;AAAA,MACA,UAAU,KAAK;AAAA,MACf,YAAY,KAAK;AAAA,MACjB,QAAQ,KAAK;AAAA,IAAA,CAChB;AAAA,EACL;AACA,SAAO;AACX;AAcA,SAAS,WACL,UACA,aACA,QACA,MACA,MACc;AACd,QAAM,UAAU,gBAAgB,QAAQ;AACxC,QAAM,SAAS,SAAS,KAAK;AAC7B,QAAM,cAAc,QAAQ,YAAY,WAAW,QAAQ,OAAO,WAAW;AAC7E,QAAM,WAAW,eAAe,OAAO,UAAU,OAAO,OAAO,QAAQ;AACvE,aAAW,QAAQ,aAAa;AAC5B,QAAI,KAAK,aAAa,UAAU;AAC5B;AAAA,QACI,KAAK;AAAA,QACL,gBAAgB,KAAK,OAAO,KAAK,IAAI,iCAAiC,QAAQ;AAAA,QAC9E,KAAK,OAAO,KAAK;AAAA,QACjB,KAAK,OAAO,SAAS,KAAK,OAAO;AAAA,MAAA;AAAA,IAEzC;AAAA,EACJ;AACA,MAAI,CAAC,QAAQ,UAAU;AACnB,WAAO;AAAA,EACX;AACA,MAAI,WAAW;AACf,MAAI,eAAe,OAAO,SAAS,MAAM;AACrC,UAAM,WAAW,OAAO,KAAK,KAAA,EAAO,YAAA;AACpC,QAAI,aAAa,WAAW,aAAa,YAAY,aAAa,UAAU,aAAa,OAAO;AAC5F,iBAAW;AAAA,IACf;AAAA,EACJ;AACA,OAAK,aAAa,SAAS,aAAa,WAAW,CAAC,gBAAgB,UAAU,OAAO,GAAG;AAEpF,eAAW;AAAA,EACf;AACA,QAAM,KAAK,OAAO,KAAK,cAAc,OAAO,KAAK,IAAI;AACrD,OAAK,KAAK,EAAE,IAAI,SAAS,CAAC,MAAM,GAAG,UAAU,UAAU,YAAY,MAAM,QAAQ,MAAM;AACvF,SAAO,EAAE,OAAO,IAAI,UAAU,QAAA;AAClC;AAUA,SAAS,YAAY,UAAyB,QAAgB,SAAgC,MAAoB;AAC9G,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,QAAQ;AACtD;AAAA,MACI,aAAa;AAAA,MACb,mBAAmB,OAAO,KAAK,IAAI,QAAQ,OAAO,KAAK;AAAA,MACvD,OAAO,KAAK;AAAA,MACZ,SAAS,YAAY,OAAO;AAAA,IAAA;AAAA,EAEpC;AACA,QAAM,MAAM,gBAAgB,MAAM;AAClC,MAAI,QAAQ,GAAG;AACX;AAAA,EACJ;AACA,MAAI,QAAQ,gBAAgB,UAAU;AAClC;AAAA,MACI,KAAK;AAAA,MACL,GAAG,GAAG,WAAW,OAAO,GAAG,CAAC,gCAAgC,MAAM,KAAK,MAAM,KAAK,CAAC;AAAA,MACnF,OAAO,KAAK;AAAA,MACZ;AAAA,IAAA;AAAA,EAER,OAAO;AACH;AAAA,MACI,KAAK;AAAA,MACL,GAAG,GAAG,WAAW,OAAO,GAAG,CAAC;AAAA,MAC5B,OAAO,KAAK;AAAA,MACZ;AAAA,IAAA;AAAA,EAER;AACJ;AAYA,SAAS,gBACL,UACA,SACA,QACA,MACyB;AACzB,MAAI,OAAO,gBAAgB,MAAM;AAC7B,WAAO,OAAO;AAAA,EAClB;AACA,MAAI,CAAC,SAAS,UAAU;AACpB,WAAO;AAAA,EACX;AACA,MAAI,gBAAgB;AACpB,MAAI,kBAAkB;AACtB,WAAS,IAAI,GAAG,IAAI,SAAS,WAAW,KAAK;AACzC,QAAI,QAAQ,OAAO,CAAC,GAAG;AACnB;AAAA,IACJ;AACA,QAAI,eAAe,SAAS,CAAC,GAAG;AAC5B;AAAA,IACJ,OAAO;AACH;AAAA,IACJ;AAAA,EACJ;AACA,MAAI,oBAAoB,GAAG;AACvB,WAAO;AAAA,EACX;AACA,QAAM,WAAW,SAAS,OAAO,OAAO,KAAK;AAC7C,MAAI,aAAa,MAAM;AACnB,WAAO;AAAA,EACX;AACA,SAAO,kBAAkB,gBAAgB,eAAe;AAC5D;AAQA,SAAS,QAAQ,GAAe,GAAwB;AACpD,SACI,EAAE,aAAa,EAAE,YACjB,EAAE,aAAa,EAAE,YACjB,EAAE,eAAe,EAAE,cACnB,EAAE,WAAW,EAAE,UACf,KAAK,UAAU,EAAE,OAAO,KAAK,WAAW,IAAI,MAAM,KAAK,UAAU,EAAE,OAAO,KAAK,WAAW,IAAI;AAEtG;AAaA,SAAS,UAAU,OAAyB,QAAgB,OAAmB,MAA4B;AACvG,QAAM,QAAsB,CAAA;AAC5B,QAAM,UAAU,CAAC,GAAG,KAAK;AACzB,QAAM,QAAQ,IAAI,IAAI,QAAQ,IAAI,CAAC,WAAW,OAAO,KAAK,IAAI,CAAC;AAC/D,aAAW,UAAU,SAAS;AAC1B,UAAM,EAAE,SAAS;AACjB,UAAM,EAAE,MAAM,KAAA,IAAS;AACvB,QAAI,iBAAiB,IAAI,GAAG;AACxB,YAAM,QAAQ,WAAW,UAAU,IAAI,kBAAkB,QAAQ,SAAS,MAAM;AAChF,UAAI,QAAQ,GAAG;AACX;AAAA,UACI,aAAa;AAAA,UACb,GAAG,KAAK,SAAS,OAAO,KAAK,CAAC,OAAO,MAAM,YAAY,IAAI;AAAA,UAC3D;AAAA,UACA;AAAA,QAAA;AAAA,MAER;AACA;AAAA,IACJ;AACA,QAAI,SAAS,WAAW;AACpB;AAAA,QACI,aAAa;AAAA,QACb,GAAG,MAAM,YAAY,IAAI;AAAA,QACzB;AAAA,QACA,OAAO,SAAS,OAAO;AAAA,MAAA;AAE3B;AAAA,IACJ;AACA,QACI,SAAS,SACR,iBAAiB,IAAI,IAAI,KAAK,cAAc,IAAI,IAAI,KAAK,qBAAqB,MAAM,EAAE,IAAI,IAAI,IACjG;AACE;AAAA,IACJ;AACA,QAAI,SAAS,QAAQ,SAAS,WAAW,WAAW,IAAI,IAAI,GAAG;AAE3D,yBAAmB,OAAO,IAAI;AAC9B;AAAA,QACI,KAAK;AAAA,QACL,GAAG,MAAM,YAAY,IAAI,MAAM,IAAI,qDAAqD,IAAI,eAAe,MAAM;AAAA,QACjH;AAAA,QACA,OAAO,SAAS,OAAO;AAAA,MAAA;AAAA,IAE/B;AACA,UAAM,SAAS,KAAK,UAAU,UAAU,KAAK,QAAQ,cAAc;AACnE,QAAI,KAAK,UAAU,UAAU,CAAC,QAAQ;AAClC;AAAA,QACI,KAAK;AAAA,QACL,GAAG,MAAM,YAAY,IAAI;AAAA,QACzB;AAAA,QACA,OAAO,SAAS,OAAO;AAAA,MAAA;AAAA,IAE/B;AACA,QAAI,QAAQ;AACR,YAAM,MAAM,cAAc,MAAM;AAChC,UAAI,MAAM,GAAG;AACT;AAAA,UACI,aAAa;AAAA,UACb,GAAG,GAAG,SAAS,OAAO,GAAG,CAAC,sBAAsB,IAAI,KAAK,MAAM,KAAK,MAAM,KAAK,CAAC;AAAA,UAChF;AAAA,UACA;AAAA,QAAA;AAAA,MAER;AAAA,IACJ;AACA,UAAM,EAAE,WAAW;AACnB,UAAM,cAAc,WAAW,QAAQ,OAAO,WAAW;AACzD,QAAI,WAA0B;AAC9B,QAAI,CAAC,QAAQ;AACT,iBAAW,eAAe,OAAO,UAAU,OAAO,OAAO,QAAQ;AACjE,UAAI,SAAS,WAAW,WAAW,WAAW,aAAa,cAAc;AACrE,mBAAW,UAAU,QAAQ,QAAQ,OAAO,OAAO,IAAI;AAAA,MAC3D,WAAW,SAAS,QAAQ,WAAW,WAAW,aAAa,cAAc;AACzE;AAAA,UACI,KAAK;AAAA,UACL,GAAG,MAAM,YAAY,IAAI,gCAAgC,YAAY;AAAA,UACrE;AAAA,UACA,OAAO,SAAS,OAAO;AAAA,QAAA;AAAA,MAE/B;AAAA,IACJ;AACA,UAAM,KAAK;AAAA,MACP;AAAA,MACA;AAAA,MACA,OAAO;AAAA,MACP,UAAU,SAAS,OAAO,YAAY,MAAM;AAAA,MAC5C;AAAA,MACA,YAAY,SAAU,QAAQ,QAAQ,qBAAqB,MAAM,IAAK;AAAA,MACtE;AAAA,IAAA,CACH;AAAA,EACL;AACA,SAAO;AACX;AAaA,SAAS,UACL,QACA,QACA,OACA,OACA,MACM;AACN,QAAM,EAAE,SAAS,OAAO;AACxB,MAAI,CAAC,MAAM,IAAI,YAAY,GAAG;AAC1B,WAAO;AAAA,EACX;AACA,qBAAmB,OAAO,IAAI;AAC9B;AAAA,IACI,KAAK;AAAA,IACL,GAAG,MAAM,YAAY,IAAI,4EAA4E,YAAY,0BAA0B,YAAY;AAAA,IACvJ;AAAA,IACA,OAAO,SAAS,OAAO;AAAA,EAAA;AAE3B,SAAO;AACX;AAQA,SAAS,mBAAmB,OAAmB,MAAoB;AAC/D,QAAM,KAAK,MAAM,UAAU,CAAC,MAAM,EAAE,SAAS,KAAK,uBAAuB,EAAE,WAAW,IAAI;AAC1F,MAAI,MAAM,GAAG;AACT,UAAM,OAAO,IAAI,CAAC;AAAA,EACtB;AACJ;AASA,SAAS,YAAY,QAAwB;AACzC,QAAM,EAAE,SAAS;AACjB,QAAM,EAAE,WAAW;AACnB,QAAM,WAAW,WAAW,QAAQ,OAAO,WAAW,UAAU,OAAO,SAAS,OAAO,OAAO,OAAO;AACrG,MAAI,KAAK,aAAa,GAAG;AACrB,WAAO;AAAA,EACX;AACA,UAAQ,KAAK,OAAA;AAAA,IACT,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO;AAAA,IACX,KAAK,OAAO;AACR,UAAI,aAAa,QAAQ,SAAS,KAAA,EAAO,kBAAkB,UAAU,eAAe,MAAM,GAAG;AACzF,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX;AAAA,IACA,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO,UAAU,MAAM,KAAK,UAAU,QAAQ;AAAA,IAClD,KAAK;AACD,UAAI,aAAa,QAAQ,SAAS,KAAA,EAAO,kBAAkB,UAAU,kBAAkB,MAAM,GAAG;AAE5F,eAAO;AAAA,MACX;AACA,UAAI,aAAa,QAAQ,YAAY,SAAS,OAAO,aAAa,MAAM,QAAW;AAE/E,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACD,aAAO;AAAA,IACX,SAAS;AACL,YAAM,EAAE,UAAU;AAClB,YAAM,IAAI,iBAAiB,iBAAiB,iBAAiB,OAAO,KAAK,CAAC,IAAI,EAAE,OAAO;AAAA,IAC3F;AAAA,EAAA;AAER;AAQA,SAAS,kBAAkB,QAAyB;AAChD,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,QAAI,OAAO,MAAM,CAAC,KAAK,CAAC,aAAa,KAAK,OAAO,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG;AAChE,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AAOA,SAAS,eAAe,QAAyB;AAC7C,MAAI,OAAO,UAAU,OAAO;AACxB,WAAO;AAAA,EACX;AACA,QAAM,EAAE,SAAS;AACjB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,QAAI,OAAO,MAAM,CAAC,KAAK,CAAC,OAAO,UAAU,KAAK,CAAC,CAAC,GAAG;AAC/C,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AAOA,SAAS,UAAU,QAAwB;AACvC,MAAI,OAAO,UAAU,OAAO;AACxB,WAAO;AAAA,EACX;AACA,MAAI,MAAM;AACV,QAAM,EAAE,SAAS;AACjB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,QAAI,OAAO,MAAM,CAAC,KAAK,KAAK,CAAC,IAAI,KAAK;AAClC,YAAM,KAAK,CAAC;AAAA,IAChB;AAAA,EACJ;AACA,SAAO;AACX;AAQA,SAAS,gBAAgB,UAAyB,SAAmC;AACjF,WAAS,IAAI,GAAG,IAAI,SAAS,WAAW,KAAK;AACzC,QAAI,QAAQ,WAAW,CAAC,KAAK,CAAC,OAAO,UAAU,QAAQ,MAAM,CAAC,CAAC,GAAG;AAC9D,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AAOA,SAAS,cAAc,QAAwB;AAC3C,MAAI,OAAO,UAAU,QAAQ;AACzB,WAAO;AAAA,EACX;AACA,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,QAAI,OAAO,MAAM,CAAC,KAAK,YAAY,OAAO,OAAO,CAAC,CAAC,MAAM,MAAM;AAC3D;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;AAQA,SAAS,mBAAmB,UAAiC;AACzD,QAAM,EAAE,QAAQ;AAChB,MAAI,IAAI,SAAS,cAAc,IAAI,SAAS,SAAS;AACjD,WAAO;AAAA,EACX;AACA,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,IAAI,MAAM,KAAK;AAC/B,UAAM,KAAK,IAAI,KAAK,CAAC;AACrB,QAAI,OAAO,OAAO,WAAW,UAAU,EAAE,KAAK,uBAAuB,EAAE,IAAI,CAAC,OAAO,cAAc,EAAE,GAAG;AAClG;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;AAOA,SAAS,4BAA4B,UAAiC;AAClE,QAAM,EAAE,QAAQ;AAChB,MAAI,IAAI,SAAS,cAAc,IAAI,SAAS,SAAS;AACjD,WAAO;AAAA,EACX;AACA,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,IAAI,MAAM,KAAK;AAC/B,QAAI,CAAC,UAAU,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG;AACjC;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;AAOA,SAAS,gBAAgB,QAAwB;AAC7C,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,QAAI,OAAO,MAAM,CAAC,KAAK,CAAC,UAAU,WAAW,QAAQ,CAAC,CAAC,GAAG;AACtD;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;AAQA,SAAS,WAAW,QAAgB,GAAmB;AACnD,QAAM,QAAQ,OAAO,MAAM,CAAC;AAC5B,MAAI,OAAO,UAAU,UAAU;AAC3B,WAAO;AAAA,EACX;AACA,MAAI,OAAO,UAAU,UAAU;AAC3B,WAAO,OAAO,UAAU,KAAK,IAAI,cAAc,KAAK,IAAI,UAAU,KAAK;AAAA,EAC3E;AACA,SAAO,OAAO,KAAK;AACvB;AAUA,SAAS,eAAe,SAAsB,GAAoB;AAC9D,SAAO,QAAQ,OAAO,CAAC,MAAM,iBAAiB,QAAQ,eAAe,CAAC;AAC1E;AAQA,SAAS,cAAc,UAAoC;AACvD,QAAM,SAAS,SAAS,MAAM,OAAO,QAAQ;AAC7C,QAAM,MAAM,YAAY,UAAU,EAAE,QAAQ,WAAW,QAAQ,OAAO,UAAU,QAAQ,SAAS,KAAA,CAAM;AACvG,QAAM,OAAO,IAAI,WAAA;AAEjB,QAAM,QAAQ,KAAK,MAAM,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC;AAC1D,SAAO;AAAA,IACH,QAAQ,IAAI;AAAA,IACZ;AAAA,IACA,YAAY,IAAI;AAAA,IAChB,WAAW,IAAI;AAAA,IACf,WAAW,KAAK;AAAA,IAChB,aAAa,IAAI;AAAA,EAAA;AAEzB;AAWA,SAAS,SAAS,QAAgB,KAAa,UAAiC;AAC5E,MAAI,OAAO,KAAK,aAAa,GAAG;AAC5B,UAAM,QAAQ,OAAO,MAAM,GAAG;AAC9B,WAAO,KAAK,UAAU,MAAM,KAAK,KAA0B,CAAC;AAAA,EAChE;AACA,UAAQ,OAAO,OAAA;AAAA,IACX,KAAK;AACD,aAAO,OAAO,MAAM,GAAG,MAAM,OAAO,SAAS;AAAA,IACjD,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACD,aAAO,OAAO,OAAO,KAAK,GAAG,CAAC;AAAA,IAClC,KAAK;AACD,aAAO,UAAU,OAAO,KAAK,GAAG,CAAC;AAAA,IACrC,KAAK,OAAO;AACR,YAAM,QAAQ,OAAO,KAAK,GAAG;AAC7B,cAAQ,aAAa,UAAU,aAAa,UAAU,OAAO,UAAU,KAAK,IACtE,cAAc,KAAK,IACnB,UAAU,KAAK;AAAA,IACzB;AAAA,IACA,KAAK;AACD,aAAO,OAAO,QAAQ,GAAG;AAAA,IAC7B,KAAK;AACD,aAAO,OAAO,WAAW,OAAO,MAAM,GAAG,CAAC;AAAA,IAC9C,KAAK;AACD,aAAO,KAAK,UAAU,MAAM,KAAK,OAAO,QAAQ,GAAG,CAAC,CAAC;AAAA,IACzD,KAAK;AACD,aAAO,KAAK,UAAU,OAAO,OAAO,GAAG,CAAC,KAAK;AAAA,IACjD,SAAS;AACL,YAAM,QAAe;AACrB,YAAM,IAAI,iBAAiB,iBAAiB,iBAAiB,OAAO,KAAK,CAAC,IAAI,EAAE;AAAA,IACpF;AAAA,EAAA;AAER;AAQA,SAAS,YAAY,QAAgB,UAAwC;AACzE,QAAM,QAAQ,OAAO,KAAK;AAC1B,MAAI,UAAU,QAAW;AACrB,WAAO;AAAA,EACX;AACA,UAAQ,OAAO,OAAA;AAAA,IACX,KAAK;AACD,aAAO,QAAQ,SAAS;AAAA,IAC5B,KAAK;AACD,UAAI,OAAO,UAAU,OAAO;AACxB,eAAO,UAAU,KAAK;AAAA,MAC1B;AACA,cAAQ,aAAa,UAAU,aAAa,UAAU,OAAO,UAAU,KAAK,IACtE,cAAc,KAAK,IACnB,UAAU,KAAK;AAAA,IACzB,KAAK;AACD,aAAO;AAAA,IACX;AACI,aAAO,KAAK,UAAU,KAAK,KAAK;AAAA,EAAA;AAE5C;AASA,SAAS,UAAU,MAAkB,KAAa,QAAgB,KAAqB;AACnF,QAAM,EAAE,WAAW;AACnB,MAAI,CAAC,OAAO,MAAM,GAAG,GAAG;AACpB;AAAA,EACJ;AACA,MAAI,KAAK,UAAU,OAAO,UAAU,QAAQ;AACxC,kBAAc,KAAK,OAAO,OAAO,OAAO,GAAG,GAAG,QAAQ,GAAG;AACzD;AAAA,EACJ;AACA,MAAI,KAAK;AAAA,EAAK,MAAM,cAAc,KAAK,KAAK,KAAK,cAAc,SAAS,QAAQ,KAAK,KAAK,QAAQ,CAAC,CAAC,SAAS;AACjH;AASA,SAAS,cAAc,OAAe,OAAgB,QAAgB,KAAqB;AACvF,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG;AACrE,UAAM,QAAkB,CAAA;AACxB,iBAAa,OAAO,QAAQ,KAAK;AACjC,QAAI,KAAK;AAAA,EAAK,MAAM,cAAc,KAAK,KAAK,MAAM,KAAK,EAAE,CAAC,SAAS;AACnE;AAAA,EACJ;AACA,MAAI,KAAK;AAAA,EAAK,MAAM,cAAc,KAAK,IAAI;AAC3C,eAAa,OAAO,GAAG,MAAM,MAAM,GAAG;AACtC,MAAI,KAAK;AAAA,EAAK,MAAM,SAAS;AACjC;AASA,SAAS,YAAY,KAAc,QAAgB,OAAe,OAAuB;AACrF,MAAI,IAAI,eAAe,MAAM;AACzB,UAAM,KAAK;AAAA,EAAK,KAAK,YAAY,cAAc,YAAY,QAAQ,IAAI,QAAQ,KAAK,EAAE,CAAC,YAAY;AACnG;AAAA,EACJ;AACA,QAAM,QAAQ,OAAO,KAAK;AAC1B,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK,GAAG;AACtE,UAAM,KAAK;AAAA,EAAK,KAAK,WAAW;AAChC,iBAAa,OAAO,GAAG,KAAK,MAAM,KAAK;AACvC,UAAM,KAAK;AAAA,EAAK,KAAK,YAAY;AAAA,EACrC,OAAO;AACH,UAAM,OAAiB,CAAA;AACvB,iBAAa,OAAO,OAAO,IAAI;AAC/B,UAAM,KAAK;AAAA,EAAK,KAAK,YAAY,KAAK,KAAK,EAAE,CAAC,YAAY;AAAA,EAC9D;AACJ;AAQA,SAAS,WAAW,KAAc,QAAwB;AACtD,QAAM,SAAS,IAAI,QAAQ,WAAW,IAAI,QAAQ,IAAI,QAAQ,CAAC;AAC/D,MAAIA,QAAO,GAAG,MAAM,YAAY,mBAAmB,IAAI,EAAE,CAAC,UAAU,MAAM;AAC1E,MAAI,IAAI,aAAa,MAAM;AACvB,IAAAA,SAAQ,eAAe,mBAAmB,IAAI,QAAQ,CAAC;AAAA,EAC3D;AACA,MAAI,IAAI,aAAa,MAAM;AACvB,IAAAA,SAAQ,eAAe,mBAAmB,IAAI,QAAQ,CAAC;AAAA,EAC3D;AACA,MAAI,IAAI,eAAe,MAAM;AAEzB,UAAM,MAAM,IAAI,WAAW,SAAS,KAAK;AACzC,IAAAA,SAAQ,IAAI,MAAM,eAAe,aAAa,KAAK,mBAAmB,IAAI,UAAU,CAAC;AAAA,EACzF;AACA,QAAM,EAAE,WAAW;AACnB,QAAM,OAAO,QAAQ,KAAK,MAAM;AAChC,QAAM,aAAa,QAAQ,KAAK,YAAY;AAC5C,MAAI,WAAW,QAAS,OAAO,SAAS,YAAY,CAAC,YAAa;AAC9D,WAAO,GAAGA,KAAI;AAAA;AAAA,EAClB;AACA,QAAM,QAAkB,CAAC,GAAGA,KAAI,GAAG;AACnC,QAAM,QAAQ,GAAG,MAAM;AACvB,MAAI,OAAO,SAAS,UAAU;AAC1B,UAAM,KAAK;AAAA,EAAK,KAAK,SAAS,cAAc,IAAI,CAAC,SAAS;AAAA,EAC9D;AACA,MAAI,YAAY;AACZ,gBAAY,KAAK,QAAQ,OAAO,KAAK;AAAA,EACzC;AACA,QAAM,KAAK;AAAA,EAAK,MAAM;AAAA,CAAU;AAChC,SAAO,MAAM,KAAK,EAAE;AACxB;AASA,SAAS,gBAAgB,QAAuB,MAA0B,WAAsC;AAC5G,QAAM,MAAyB,IAAI,MAAqB,SAAS,EAAE,KAAK,IAAI;AAC5E,MAAI,WAAW,MAAM;AACjB,WAAO;AAAA,EACX;AACA,QAAM,2BAAW,IAAA;AACjB,QAAM,MAAgB,CAAA;AACtB,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAChC,QAAI,CAAC,OAAO,MAAM,CAAC,GAAG;AAClB;AAAA,IACJ;AACA,UAAMA,QAAO,WAAW,QAAQ,CAAC;AACjC,QAAI,UAAUA,KAAI,GAAG;AACjB,UAAI,CAAC,IAAIA;AACT,WAAK,IAAIA,KAAI;AAAA,IACjB,OAAO;AACH,UAAI,KAAK,CAAC;AAAA,IACd;AAAA,EACJ;AACA,MAAI,IAAI,SAAS,KAAK,SAAS,SAAS;AACpC,UAAM,IAAI;AAAA,MACN;AAAA,MACA,GAAG,IAAI,MAAM,WAAW,OAAO,IAAI,MAAM,CAAC,IAAI,MAAM,IAAI,QAAQ,MAAM,KAAK,CAAC,gCAAgC,KAAK,UAAU,WAAW,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC;AAAA,MACxK,EAAE,QAAQ,WAAW,SAAS,WAAW,OAAO,IAAI,QAAQ,MAAM,IAAI,CAAC,EAAA;AAAA,IAAE;AAAA,EAEjF;AACA,aAAW,KAAK,KAAK;AACjB,UAAM,OAAO,cAAc,WAAW,QAAQ,CAAC,CAAC;AAChD,QAAI,YAAY;AAChB,aAAS,IAAI,GAAG,KAAK,IAAI,SAAS,GAAG,KAAK;AACtC,kBAAY,GAAG,IAAI,IAAI,CAAC;AAAA,IAC5B;AACA,SAAK,IAAI,SAAS;AAClB,QAAI,CAAC,IAAI;AAAA,EACb;AACA,SAAO;AACX;AASA,UAAU,aAAa,UAAyB,MAAgD;AAC5F,QAAM,MAAoB,YAAY,UAAU,WAAW,KAAK,QAAQ,WAAW;AACnF,QAAM,UAAU,gBAAgB,KAAK,cAAc,KAAK,QAAQ,aAAa,SAAS,SAAS;AAC/F,QAAM,KAAK,KAAK,SAAS,OAAO;AAChC,QAAM,KAAK,KAAK,SAAS,SAAS;AAClC,QAAM,KAAK,KAAK,SAAS,WAAW;AACpC,QAAM,OAAO,KAAK,SAAS,OAAO;AAElC,QAAM;AACN,QAAM,YAAY,IAAI;AAEtB,aAAW,OAAO,KAAK,MAAM;AACzB,UAAM,WAAW,KAAK,EAAE;AAAA,EAC5B;AACA,MAAI,KAAK,kBAAkB,MAAM;AAC7B,UAAM,GAAG,EAAE,YAAY,KAAK,aAAa,2BAA2B,qBAAqB;AAAA;AAAA,EAC7F;AAEA,QAAM,UAAU,KAAK,MAAM,WAAW;AACtC,QAAM,GAAG,EAAE,cAAc,mBAAmB,OAAO,CAAC,kBAAkB,KAAK,WAAW;AACtF,QAAM,EAAE,gBAAgB,SAAS;AACjC,MAAI,gBAAgB,MAAM;AACtB,UAAM;AAAA,EAAK,EAAE,SAAS,cAAc,WAAW,CAAC;AAAA,EACpD;AACA,QAAM,aAAuB,CAAA;AAC7B,aAAW,UAAU,KAAK,cAAc;AACpC,cAAU,QAAQ,GAAG,IAAI,UAAU;AAAA,EACvC;AACA,MAAI,WAAW,SAAS,GAAG;AACvB,UAAM,WAAW,KAAK,EAAE;AAAA,EAC5B;AAGA,QAAM,EAAE,cAAc;AACtB,QAAM,SAAS,UAAU,UAAU,SAAS;AAC5C,QAAM,OAAoB;AAAA,IACtB,WAAW,CAAA;AAAA,IACX,aAAa,CAAA;AAAA,IACb,SAAS,SAAS,IAAI,WAAW,SAAS,SAAS,IAAI;AAAA,EAAA;AAE3D,aAAW,YAAY,UAAU,OAAO;AACpC,WAAO,iBAAiB,UAAU,MAAM,KAAK,IAAI,MAAM,IAAI;AAAA,EAC/D;AAGA,QAAM,OAAO,SAAS,SAAA;AACtB,WAAS,IAAI,GAAG,IAAI,SAAS,WAAW,KAAK;AACzC,QAAI,CAAC,KAAK,QAAQ,OAAO,CAAC,GAAG;AACzB,YAAM,QAAQ,aAAa,UAAU,MAAM,GAAG,OAAO,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;AAC1G,YAAM,YAAY,MAAM,GAAG,QAAQ,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;AAAA,IAC1D;AAAA,EACJ;AAEA,QAAM;AAAA,EAAK,EAAE;AAAA;AAAA;AACjB;AAQA,SAAS,YAAY,MAAoB;AACrC,QAAM,aAAqC,EAAE,GAAG,KAAK,MAAM,WAAA;AAC3D,QAAME,iBACF,KAAK,YAAY,KAAK,CAAC,MAAM,EAAE,MAAM,KACrC,KAAK,YAAY,KAAK,CAAC,MAAM,EAAE,MAAM,KACrC,KAAK,aAAa,KAAK,CAAC,MAAM,EAAE,MAAM;AAC1C,MACI,KAAK,gBAAgB,QACpBA,kBACG,CAAC,OAAO,OAAO,UAAU,EAAE,SAAS,gBAAgB;AAAA,EAEpD,WAAW,MAAM,QACvB;AACE,eAAW,IAAI;AAAA,EACnB;AACA,MAAI,CAAC,OAAO,OAAO,UAAU,EAAE,SAAS,aAAa,GAAG;AACpD,eAAW,MAAM;AAAA,EACrB;AACA,MAAI,OAAO,mBAAmB,iBAAiB;AAC/C,aAAW,CAAC,QAAQ,GAAG,KAAK,OAAO,QAAQ,UAAU,GAAG;AACpD,YAAQ,UAAU,MAAM,KAAK,mBAAmB,GAAG,CAAC;AAAA,EACxD;AACA,QAAM,YAAY,OAAO,QAAQ,UAAU,EAAE,KAAK,CAAC,CAAA,EAAG,GAAG,MAAM,QAAQ,aAAa,IAAI,CAAC,KAAK;AAC9F,SAAO,GAAG,IAAI,IAAI,SAAS,oBAAoB,eAAe;AAAA;AAClE;AAWA,SAAS,aAAa,UAAyB,MAAY,GAAW,QAAgB,QAAwB;AAC1G,MAAIF,QAAO,YAAY,mBAAmB,MAAM,CAAC,aAAa,mBAAmB,MAAM,CAAC;AACxF,QAAM,WAAW,SAAS,YAAY,eAAe,KAAK,SAAS,CAAC;AACpE,MAAI,cAAc,KAAK,gBAAgB,aAAa;AAChD,IAAAA,SAAQ,cAAc,WAAW,SAAS,OAAO;AAAA,EACrD;AACA,QAAM,aAAa,SAAS,KAAK,kBAAkB,CAAC;AACpD,MAAI,eAAe,MAAM;AACrB,IAAAA,SAAQ,gBAAgB,mBAAmB,UAAU,CAAC;AAAA,EAC1D;AACA,QAAM,aAAa,SAAS,KAAK,kBAAkB,CAAC;AACpD,MAAI,eAAe,MAAM;AACrB,IAAAA,SAAQ,gBAAgB,mBAAmB,UAAU,CAAC;AAAA,EAC1D;AACA,SAAOA;AACX;AAWA,SAAS,YACL,MACA,GACA,IACA,OACA,SACM;AACN,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,QAAkB,CAAC;AAAA,EAAK,EAAE,OAAO;AACvC,MAAI,OAAO,MAAM;AACb,UAAM,KAAK,QAAQ,mBAAmB,EAAE,CAAC,GAAG;AAAA,EAChD;AACA,QAAM,KAAK,KAAK;AAChB,QAAM,OAAO,MAAM;AACnB,MAAI,KAAK,WAAW,MAAM;AACtB,UAAM,EAAE,OAAO,SAAA,IAAa,KAAK;AACjC,UAAM,SAAS,KAAK,OAAO,QAAQ,KAAK,GAAG,aAAa,SAAS,aAAa,MAAM;AACpF,QAAI,WAAW,MAAM;AACjB,YAAM,KAAK;AAAA,EAAK,EAAE,cAAc,KAAK,KAAK,cAAc,MAAM,CAAC,SAAS;AAAA,IAC5E;AAAA,EACJ;AACA,aAAW,UAAU,KAAK,aAAa;AACnC,cAAU,QAAQ,GAAG,IAAI,KAAK;AAAA,EAClC;AACA,MAAI,MAAM,WAAW,MAAM;AACvB,UAAM,KAAK,IAAI;AAAA,EACnB,OAAO;AACH,UAAM,OAAO,MAAM,GAAG,GAAG;AACzB,UAAM,KAAK;AAAA,EAAK,EAAE,SAAS;AAAA,EAC/B;AACA,SAAO,MAAM,KAAK,EAAE;AACxB;AAQA,SAAS,SAAS,QAAuB,GAA0B;AAC/D,MAAI,CAAC,QAAQ,MAAM,CAAC,GAAG;AACnB,WAAO;AAAA,EACX;AACA,QAAM,QAAQ,OAAO,MAAM,CAAC;AAC5B,SAAO,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK;AAC3D;AAwBA,UAAU,iBACN,MACA,MACA,KACA,QACA,MACA,MACkC;AAClC,QAAM,EAAE,WAAW,aAAa,QAAA,IAAY;AAC5C,QAAM,EAAE,cAAc;AACtB,QAAM,cAAc,CAAC,MAAuB,UAAU,WAAW,IAAI,CAAC,IAAI,UAAU,WAAW,CAAC;AAChG,QAAM,WAAW,CAAC,GAAW,UAA0B;AACnD,UAAM,MAAM,SAAS,KAAK,OAAO,QAAQ,CAAC;AAC1C,UAAM,QAAkB,CAAC;AAAA,EAAK,GAAG,aAAa,mBAAmB,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG;AACxF,UAAM,OAAO,MAAM;AACnB,QAAI,KAAK,kBAAkB,QAAQ,IAAI,UAAU,CAAC,GAAG;AACjD,YAAM;AAAA,QACF;AAAA,EAAK,GAAG,GAAG,IAAI,cAAc,KAAK,aAAa,KAAK,cAAc,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;AAAA,MAAA;AAAA,IAEpG;AACA,eAAW,UAAU,KAAK,aAAa;AACnC,gBAAU,QAAQ,GAAG,MAAM,MAAM,KAAK;AAAA,IAC1C;AACA,QAAI,YAAY,CAAC,GAAG;AAChB,YAAM,OAAO,MAAM,GAAG,GAAG;AACzB,YAAM,UAAU,GAAG,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC;AACtC,YAAM,KAAK;AAAA,EAAK,GAAG,GAAG,IAAI,cAAc,mBAAmB,OAAO,CAAC,kBAAkB,KAAK,WAAW,IAAI;AACzG,aAAO,MAAM,KAAK,EAAE;AAAA,IACxB;AACA,QAAI,MAAM,WAAW,MAAM;AACvB,YAAM,KAAK,IAAI;AAAA,IACnB,OAAO;AACH,YAAM,OAAO,MAAM,GAAG,GAAG;AACzB,YAAM,KAAK;AAAA,EAAK,GAAG,SAAS;AAAA,IAChC;AACA,WAAO,MAAM,KAAK,EAAE;AAAA,EACxB;AACA,QAAM,YAAY,CAAC,UAA0B;AACzC,UAAM,MAAM,SAAS,KAAK,OAAO,QAAQ,CAAC;AAC1C,WAAO;AAAA,EAAK,GAAG,GAAG,IAAI;AAAA,EAAa,GAAG;AAAA,EAC1C;AACA,MAAI,YAAY,MAAM;AAClB,YAAQ,IAAI,IAAI;AAAA,EACpB;AACA,QAAM,SAAS,MAAM,CAAC;AACtB,MAAI,CAAC,YAAY,IAAI,GAAG;AACpB;AAAA,EACJ;AACA,YAAU,KAAK,IAAI;AACnB,cAAY,KAAK,UAAU,WAAW,IAAI,CAAC;AAC3C,SAAO,UAAU,SAAS,GAAG;AACzB,UAAM,MAAM,UAAU,SAAS;AAC/B,UAAM,IAAI,UAAU,GAAG;AACvB,UAAM,SAAS,YAAY,GAAG;AAC9B,QAAI,UAAU,UAAU,WAAW,IAAI,CAAC,GAAG;AACvC,gBAAU,IAAA;AACV,kBAAY,IAAA;AACZ,YAAM,UAAU,GAAG;AACnB;AAAA,IACJ;AACA,gBAAY,GAAG,IAAI,SAAS;AAC5B,UAAM,IAAI,UAAU,UAAU,MAAM;AACpC,QAAI,YAAY,QAAQ,QAAQ,CAAC,MAAM,GAAG;AACtC;AAAA,IACJ;AACA,QAAI,YAAY,MAAM;AAClB,cAAQ,CAAC,IAAI;AAAA,IACjB;AACA,UAAM,SAAS,GAAG,MAAM,CAAC;AACzB,QAAI,YAAY,CAAC,GAAG;AAChB,gBAAU,KAAK,CAAC;AAChB,kBAAY,KAAK,UAAU,WAAW,CAAC,CAAC;AAAA,IAC5C;AAAA,EACJ;AACJ;AAMO,MAAM,kBAAuD,OAAO,OAAO;AAAA,EAC9E,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,CAAC,eAAe,QAAQ,CAAC;AAAA,EAChD,cAAc;AAAA,EACd,QAAQ,OAAO,OAAO,EAAE,cAAc,4BAA4B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOlE,MAAM,UAAyB,SAAoD;AAC/E,UAAM,EAAE,MAAM,OAAA,IAAW,QAAQ,UAAU,OAAO;AAClD,WAAO,OAAO,OAAO,CAAC,GAAG,KAAK,OAAO,GAAI,QAAQ,SAAS,CAAA,CAAG,CAAC;AAAA,EAClE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,UAAyB,SAA0D;AACtF,UAAM,EAAE,MAAM,QAAA,IAAY,QAAQ,UAAU,OAAO;AACnD,WAAO,aAAa,aAAa,SAAS,IAAI,CAAC;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,eAAe,UAAyB,SAAgD;AACpF,UAAM,EAAE,MAAM,QAAA,IAAY,QAAQ,UAAU,OAAO;AACnD,WAAO,SAAS,aAAa,SAAS,IAAI,CAAC;AAAA,EAC/C;AACJ,CAAC;AAQD,SAAS,QACL,UACA,SACsF;AACtF,QAAM,SAAS,oBAAoB,UAAU,SAAS,MAAM;AAC5D,QAAM,UAAU,QAAQ,YAAY;AACpC,QAAM,OAAO,WAAW,SAAS,qBAAqB,OAAO,GAAG,qBAAqB,OAAO,GAAG,WAAW,IAAI;AAC9G,MAAI,WAAW,MAAM;AACjB,WAAO,EAAE,MAAM,SAAS,OAAA;AAAA,EAC5B;AAEA,QAAM,WAAW,QAAQ,MAAM,OAAO,UAAU,GAAG,KAAK;AACxD,QAAM,QAAQ,KAAK,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,aAAa,EAAE,WAAW,QAAQ;AACzF,SAAO,EAAE,MAAM,EAAE,GAAG,MAAM,OAAO,aAAa,KAAA,GAAQ,SAAS,OAAA;AACnE;ACljDA,MAAM,sBAAsB;AAS5B,MAAM,8BAAc,QAAQ;AAS5B,MAAM,YAAY;AAGlB,MAAM,cAAc;AAIpB,MAAM,4BAAiC,IAAI;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC;AAOD,SAAS,QAAQ,MAAiD;AAC9D,MAAI,OAAO,SAAS,YAAY,CAAC,KAAK,SAAS,KAAK,GAAG;AACnD,WAAO;AAAA,EACX;AACA,QAAM,OAAO,KAAK,MAAM,KAAK,YAAY,GAAG,IAAI,CAAC;AACjD,SAAO,MAAM,IAAI,IAAI,KAAK,SAAS,eAAgB,OAAmB;AAC1E;AAOA,SAAS,cAAc,OAAqD;AACxE,QAAM,0BAAU,IAAA;AAChB,aAAW,OAAO,OAAO;AACrB,UAAM,OACF,IAAI,UAAU,UAAU,IAAI,KAAK,QAAQ,cAAc,WAAW,QAAQ,IAAI,KAAK,OAAO,IAAI,IAAI;AACtG,QAAI,SAAS,QAAQ,CAAC,IAAI,IAAI,IAAI,GAAG;AACjC,UAAI,IAAI,MAAM,IAAI,KAAK,IAAI;AAAA,IAC/B;AAAA,EACJ;AACA,SAAO;AACX;AAGA,MAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA,EAUb,YAAY,MAAe;AAT3B,SAAiB,6BAAa,IAAA;AAG9B,SAAA,SAAS;AAOL,eAAW,MAAM,aAAa,MAAM,YAAY,GAAG;AAC/C,UAAI,OAAO,EAAE,GAAG;AACZ,aAAK,QAAQ,EAAE;AAAA,MACnB;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,QAAQ,IAAmC;AAC/C,eAAW,OAAO,OAAO,KAAK,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,WAAW,IAAI,KAAK,MAAM,OAAO,GAAG;AACnF,iBAAW,KAAK,aAAa,IAAI,QAAQ,GAAG,CAAC,GAAG;AAC5C,cAAM,OAAO,UAAU,CAAC;AACxB,YAAI,SAAS,QAAQ,CAAC,KAAK,OAAO,IAAI,IAAI,GAAG;AACzC,eAAK,OAAO,IAAI,MAAM,EAAE,KAAK,QAAQ,GAAG,GAAG,GAAG;AAAA,QAClD;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,OAAwB;AAC5B,QAAI,QAAQ,qBAAqB;AAC7B,WAAK;AACL,aAAO;AAAA,IACX;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,KAAa,GAAgC;AAChD,QAAI,QAAQ,oBAAoB;AAC5B,aAAO,KAAK,OAAO,IAAI,SAAS,GAAG,aAAa,KAAK,EAAE,KAAK;AAAA,IAChE;AACA,WAAO,EAAE,KAAK,EAAA;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,GAAgC;AAClC,QAAI,CAAC,OAAO,CAAC,GAAG;AACZ,aAAO;AAAA,IACX;AACA,eAAW,OAAO,OAAO,KAAK,CAAC,GAAG;AAC9B,UAAI,CAAC,IAAI,WAAW,IAAI,KAAK,QAAQ,SAAS;AAC1C,eAAO,KAAK,OAAO,QAAQ,GAAG,GAAG,aAAa,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC,CAAC;AAAA,MACrE;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,GAAY,QAAQ,GAAa;AACnC,QAAI,MAAM,UAAa,MAAM,QAAQ,KAAK,QAAQ,KAAK,GAAG;AACtD,aAAO;AAAA,IACX;AACA,QAAI,OAAO,MAAM,UAAU;AACvB,aAAO,KAAK,MAAM,CAAC;AAAA,IACvB;AACA,QAAI,OAAO,MAAM,UAAU;AACvB,aAAO;AAAA,IACX;AACA,UAAM,IAAI,EAAE,KAAA;AACZ,QAAI,EAAE,SAAS,wBAAwB;AACnC,aAAO;AAAA,IACX;AACA,QAAI,YAAY,KAAK,CAAC,GAAG;AACrB,aAAO;AAAA,IACX;AACA,UAAM,IAAI,UAAU,KAAK,CAAC;AAC1B,QAAI,MAAM,MAAM;AACZ,aAAO,KAAK,OAAO,IAAI,EAAE,CAAC,CAAC,KAAK;AAAA,IACpC;AACA,WAAO;AAAA,EACX;AACJ;AAOA,SAAS,UAAU,GAA2B;AAC1C,MAAI,CAAC,OAAO,CAAC,GAAG;AACZ,WAAO;AAAA,EACX;AACA,aAAW,OAAO,OAAO,KAAK,CAAC,GAAG;AAC9B,QAAI,IAAI,WAAW,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,CAAC,MAAM,OAAO;AACzD,YAAM,QAAQ,EAAE,GAAG;AACnB,aAAO,OAAO,UAAU,WAAW,QAAQ;AAAA,IAC/C;AAAA,EACJ;AACA,SAAO;AACX;AAQA,SAAS,KAAK,IAAiB,MAAuB;AAClD,QAAMG,QAAO,SAAS,GAAG,GAAG,IAAI;AAChC,MAAIA,UAAS,QAAW;AACpB,WAAOA;AAAA,EACX;AACA,SAAO,UAAU,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,EAAE;AAC9C;AAWA,SAAS,QAAQ,MAAkB,GAAY,UAA+B,QAAQ,GAAU;AAC5F,MAAI,KAAK,QAAQ,KAAK,GAAG;AACrB,WAAO;AAAA,EACX;AACA,QAAM,IAAI,KAAK,MAAM,GAAG,KAAK;AAC7B,MAAI,MAAM,QAAQ,MAAM,MAAM;AAC1B,WAAO;AAAA,EACX;AACA,MAAI,OAAO,MAAM,UAAU;AACvB,WAAO,EAAE,KAAK,GAAG,SAAS,UAAA;AAAA,EAC9B;AACA,QAAM,EAAE,QAAQ;AAChB,MAAI,QAAQ,kBAAkB;AAC1B,WAAO,QAAQ,MAAM,KAAK,GAAG,OAAO,GAAG,UAAU,QAAQ,CAAC;AAAA,EAC9D;AACA,MAAI,QAAQ,SAAS;AACjB,WAAO,QAAQ,MAAM,SAAS,EAAE,GAAG,OAAO,GAAG,UAAU,QAAQ,CAAC;AAAA,EACpE;AACA,MAAI,QAAQ,WAAW;AACnB,UAAM,MAAM,SAAS,EAAE,GAAG,WAAW;AACrC,WAAO,QAAQ,SAAY,OAAO,EAAE,KAAK,KAAK,SAAS,MAAA;AAAA,EAC3D;AACA,MAAI,IAAI,SAAS,UAAU,GAAG;AAC1B,eAAA;AACA,UAAM,OACF,aAAa,EAAE,GAAG,cAAc,EAAE,CAAC,KACnC,aAAa,UAAU,EAAE,GAAG,GAAG,GAAG,gBAAgB,GAAG,cAAc,EAAE,CAAC;AAC1E,WAAO,SAAS,SAAY,OAAO,QAAQ,MAAM,SAAS,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC;AAAA,EAC7F;AACA,MAAI,QAAQ,UAAU;AAClB,WAAO,QAAQ,MAAM,KAAK,GAAG,MAAM,GAAG,UAAU,QAAQ,CAAC;AAAA,EAC7D;AACA,SAAO;AACX;AAUA,MAAM,6BAA0C,IAAI;AAAA,EAChD,CAAC,SAAS,OAAO;AAAA,EACjB,CAAC,QAAQ,QAAQ;AAAA,EACjB,CAAC,OAAO,QAAQ;AAAA,EAChB,CAAC,WAAW,UAAU;AAAA,EACtB,CAAC,cAAc,UAAU;AAC7B,CAAC;AAQD,SAAS,SAAS,MAAkB,GAAyC;AACzE,QAAM,IAAI,KAAK,MAAM,CAAC;AACtB,MAAI,MAAM,QAAQ,MAAM,MAAM;AAC1B,WAAO;AAAA,EACX;AACA,MAAI,OAAO,MAAM,YAAY,EAAE,QAAQ,UAAU;AAC7C,WAAO,EAAE,OAAO,QAAQ,MAAM,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,QAAA;AAAA,EAC5D;AACA,MAAI,OAAO;AACX,QAAM,IAAI,KAAK,MAAM,KAAK,GAAG,WAAW,GAAG,CAAC;AAC5C,MAAI,OAAO,MAAM,UAAU;AACvB,UAAM,QAAQ,EAAE,MAAM,GAAG,sBAAsB,EAAE,cAAc,WAAW,KAAK,EAAE;AACjF,WAAO,OAAO,IAAI,KAAK,KAAK,SAAS,KAAK;AAAA,EAC9C,WAAW,MAAM,QAAQ,MAAM,MAAM;AAEjC,UAAM,UAAU,SAAS,EAAE,GAAG,QAAQ,KAAK,IACtC,MAAM,GAAG,sBAAsB,EAC/B,KAAA,EACA,MAAM,QAAQ,EACd,IAAI,MAAM,EACV,OAAO,OAAO,QAAQ;AAC3B,QAAI,OAAO,WAAW,GAAG;AACrB,aAAO,OAAO,CAAC,KAAK,IAAI,WAAW;AAAA,IACvC,WAAW,OAAO,WAAW,GAAG;AAC5B,aAAO;AAAA,IACX,WAAW,OAAO,SAAS,GAAG;AAC1B,aAAO,gBAAgB,OAAO,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC;AAAA,IACvD;AAAA,EACJ;AACA,QAAM,IAAI,KAAK,GAAG,WAAW;AAC7B,SAAO,EAAE,OAAO,QAAQ,MAAM,KAAK,GAAG,MAAM,GAAG,IAAI,GAAG,OAAO,OAAO,MAAM,WAAW,IAAI,GAAG,KAAA;AAChG;AAUA,SAAS,SAAS,IAAW,UAAkB,SAAwB,KAAe,IAAkB;AACpG,MAAI,OAAO,QAAQ,OAAO,MAAM;AAC5B;AAAA,EACJ;AACA,QAAM,IAAI,WAAW,GAAG,KAAK,GAAG,SAAS,GAAG,QAAQ,CAAC;AACrD,MAAI,MAAM,MAAM;AACZ;AAAA,EACJ;AACA,MAAI,UAAU,EAAE,KAAK;AACrB,QAAM,QAAQ,aAAa,GAAG,MAAM,GAAG,QAAQ,GAAG,YAAY,IAAI;AAClE,MAAI,YAAY,MAAM;AAClB,QAAI,SAAS,KAAK;AAAA,EACtB;AACJ;AAGA,MAAM,QAAQ;AAGd,MAAM,iBAAiB;AASvB,MAAM,gCAAiD,IAAwB;AAAA,EAC3E,CAAC,qBAAqB,EAAE,OAAO,iBAAiB;AAAA,EAChD,CAAC,sBAAsB,EAAE,OAAO,WAAW,QAAQ,2BAA2B;AAAA,EAC9E,CAAC,UAAU,EAAE,OAAO,WAAW,QAAQ,2BAA2B;AAAA,EAClE,CAAC,WAAW,EAAE,OAAO,aAAa;AAAA,EAClC,CAAC,YAAY,EAAE,OAAO,QAAQ;AAAA,EAC9B,CAAC,aAAa,EAAE,OAAO,WAAW,QAAQ,iBAAiB;AAAA,EAC3D,CAAC,aAAa,EAAE,OAAO,WAAW,QAAQ,sCAAsC;AAAA,EAChF,CAAC,cAAc,EAAE,OAAO,WAAW,QAAQ,sCAAsC;AAAA,EACjF,CAAC,QAAQ,EAAE,OAAO,mBAAmB;AACzC,CAAC;AAGD,MAAM,yBAAyB;AAe/B,SAAS,WAAW,QAA4B,UAAkB,KAAe,IAAkB;AAC/F,QAAM,IAAI,WAAW,SAAY,WAAW,YAAY,QAAQ,GAAG,cAAc,CAAC;AAClF,MAAI,MAAM,GAAG;AACT,QAAI,SAAS,WAAW;AACxB;AAAA,EACJ;AACA,MAAI,SAAS,iBAAiB;AAC9B,MAAI,gBAAgB,CAAC;AACzB;AAYA,SAAS,YAAY,MAAkB,OAAoB,KAAe,IAAqB;AAC3F,QAAM,OAAO,CAAC,MAAqB;AAC/B,UAAM,WAAW,MAAY;AACzB,aAAO,GAAG,MAAM,GAAG,YAAY,UAAU,MAAM,GAAG;AAAA,IACtD;AACA,aAAS,QAAQ,MAAM,GAAG,QAAQ,GAAG,QAAQ,eAAe,KAAK,EAAE;AAAA,EACvE;AACA,UAAQ,MAAM,KAAA;AAAA,IACV,KAAK;AACD,WAAK,KAAK,OAAO,OAAO,KAAK,KAAK;AAClC,UAAI,eAAe,CAAC;AACpB,iBAAW,SAAS,MAAM,GAAG,QAAQ,GAAG,IAAI,KAAK,EAAE;AACnD,aAAO;AAAA,IACX,KAAK;AACD,WAAK,KAAK,OAAO,OAAO,KAAK,KAAK;AAClC,UAAI,eAAe,CAAC;AACpB,UAAI,SAAS,WAAW;AACxB,aAAO;AAAA,IACX,KAAK,uBAAuB;AACxB,WAAK,KAAK,OAAO,MAAM,KAAK,KAAK;AACjC,YAAM,SAAS,KAAK,OAAO,QAAQ;AACnC,UAAI,WAAW,QAAW;AACtB,YAAI,eAAe,CAAC;AAAA,MACxB,OAAO;AACH,kBAAU,SAAS,MAAM,MAAM,GAAG,KAAK,EAAE;AAAA,MAC7C;AACA,iBAAW,SAAS,MAAM,GAAG,QAAQ,GAAG,GAAG,KAAK,EAAE;AAClD,aAAO;AAAA,IACX;AAAA,IACA,KAAK,sBAAsB;AACvB,WAAK,KAAK,OAAO,MAAM,KAAK,cAAc;AAC1C,YAAM,OAAO,SAAS,MAAM,GAAG,MAAM,KAAK;AAG1C,UAAI,SAAS,cAAc;AACvB,YAAI,eAAe,CAAC;AAAA,MACxB,OAAO;AACH,kBAAU,SAAS,MAAM,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG,KAAK,EAAE;AAAA,MACrE;AACA,YAAM,UAAU,SAAS,MAAM,SAAS,eAAe,OAAO,qBAAqB,aAAa,IAAI,EAAE;AACtG,UAAI,YAAY,QAAQ,SAAS,MAAM,SAAS,cAAc;AAC1D,eAAO,GAAG,OAAO,GAAG,YAAY,eAAe,KAAK,MAAM,GAAG,sBAAsB,CAAC;AAAA,MACxF;AACA,UAAI,SAAS,SAAS,SAAS,WAAW;AAC1C,UAAI,SAAS,WAAW,QAAW;AAC/B,YAAI,eAAe,QAAQ,MAAM;AAAA,MACrC;AACA,aAAO;AAAA,IACX;AAAA,IACA;AACI,aAAO;AAAA,EAAA;AAEnB;AAQA,SAAS,UAAU,QAAqC,KAAe,IAAkB;AACrF,MAAI,WAAW,MAAM;AACjB,QAAI,eAAe,CAAC;AAAA,EACxB,WAAW,WAAW,MAAM;AACxB,aAAS,OAAO,OAAO,eAAe,iBAAiB,KAAK,EAAE;AAC9D,QAAI,eAAe,YAAY,OAAO,OAAO,GAAG,aAAa,CAAC,CAAC;AAC/D,QAAI,eAAe,UAAU,eAAe,OAAO,MAAM,WAAW,GAAG,aAAa,CAAC,CAAC;AAAA,EAC1F;AACJ;AAUA,SAAS,cAAc,MAAkB,MAAe,KAAe,IAAY,MAAyB;AACxG,QAAM,KAAK,UAAU,MAAM,KAAK,MAAM,IAAI,CAAC;AAC3C,MAAI,OAAO,QAAQ,OAAO,OAAO,UAAU;AACvC,QAAI,SAAS,QAAQ,SAAS,UAAa,SAAS,IAAI;AACpD,aAAO,GAAG,MAAM,GAAG,YAAY,YAAY,WAAW;AAAA,IAC1D;AACA;AAAA,EACJ;AACA,QAAM,QAAQ;AACd,MAAI,YAAY,MAAM,OAAO,KAAK,EAAE,GAAG;AACnC;AAAA,EACJ;AACA;AAAA,IACI,QAAQ,MAAM,KAAK,OAAO,MAAM,GAAG,MAAM;AACrC,aAAO,GAAG,MAAM,GAAG,YAAY,UAAU,MAAM,GAAG;AAAA,IACtD,CAAC;AAAA,IACD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAEJ,YAAU,SAAS,MAAM,KAAK,OAAO,QAAQ,CAAC,GAAG,KAAK,EAAE;AACxD,MAAI,SAAS,YAAY,OAAO,EAAE,CAAC;AACnC,QAAM,SAAS,UAAU,IAAI,SAAS,SAAS,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,GAAG;AAC1E,MAAI,WAAW,QAAW;AACtB,QAAI,eAAe,MAAM;AAAA,EAC7B;AACA,QAAM,aAAa,MAAM,QAAQ,uBAAuB,SAAS,MAAM,GAAG,YAAY,IAAI;AAC1F,MAAI,eAAe,QAAW;AAC1B,QAAI,gBAAgB,YAAY,YAAY,GAAG,cAAc,CAAC,CAAC;AAAA,EACnE;AACA,QAAM,QAAQ,MAAM,QAAQ,mBAAmB,SAAS,SAAS,MAAM,GAAG,OAAO,CAAC,IAAI;AACtF,MAAI,UAAU,mBAAmB;AAC7B,QAAI,gBAAgB,sBAAsB;AAAA,EAC9C,WAAW,UAAU,UAAU,SAAS,MAAM;AAC1C,QAAI,gBAAgB,KAAK,IAAI,KAAK,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,EAC7D;AACJ;AAOA,SAAS,SAAS,OAA0C;AACxD,SAAO,UAAU,SACX,OACA,MAAM,MAAM,GAAG,sBAAsB,EAAE,KAAA,EAAO,YAAA,EAAc,WAAW,KAAK,GAAG;AACzF;AAQA,SAAS,UAAU,MAAkB,OAA2B;AAC5D,MAAI,KAAK;AACT,QAAM,2BAAW,IAAA;AACjB,SAAO,OAAO,QAAQ,OAAO,OAAO,YAAY,GAAG,QAAQ,iCAAiC;AACxF,QAAI,KAAK,IAAI,GAAG,CAAC,KAAK,KAAK,QAAQ,KAAK,IAAI,GAAG;AAC3C,WAAK;AACL,aAAO;AAAA,IACX;AACA,SAAK,IAAI,GAAG,CAAC;AACb,SAAK,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC;AAAA,EAC5C;AACA,SAAO;AACX;AAQA,SAAS,YAAY,OAAoB,IAA2B;AAChE,QAAM,QAAQ,SAAS,MAAM,GAAG,OAAO;AACvC,MAAI,UAAU,QAAW;AACrB,WAAO,UAAU,IAAI,SAAS,KAAK,KAAK,EAAE,GAAG,SAAS,UAAU,SAAS,OAAO,WAAW,GAAG,OAAO,CAAC;AAAA,EAC1G;AACA,MAAI,MAAM,QAAQ,sBAAsB;AACpC,WAAO,SAAS,MAAM,GAAG,YAAY,MAAM,SAAY,cAAc;AAAA,EACzE;AACA,MAAI,MAAM,QAAQ,kBAAkB;AAChC,WAAO;AAAA,EACX;AACA,SAAO,GAAG,OAAO,GAAG,YAAY,eAAe,MAAM,GAAG;AACxD,SAAO,SAAS,MAAM,GAAG;AAC7B;AASA,SAAS,cAAc,MAAkB,MAAe,KAAe,IAAkB;AACrF,QAAM,KAAK,KAAK,MAAM,IAAI;AAC1B,MAAI,OAAO,MAAM;AACb;AAAA,EACJ;AACA,QAAM,SAAS,SAAS,MAAM,KAAK,IAAI,QAAQ,CAAC;AAChD,MAAI,WAAW,MAAM;AACjB,WAAO,GAAG,OAAO,GAAG,YAAY,WAAW,UAAU;AAAA,EACzD,WAAW,WAAW,MAAM;AACxB,aAAS,OAAO,OAAO,SAAS,WAAW,KAAK,EAAE;AAClD,QAAI,SAAS,YAAY,OAAO,OAAO,GAAG,OAAO,CAAC,CAAC;AACnD,QAAI,aAAa,UAAU,aAAa,OAAO,MAAM,WAAW,GAAG,WAAW,CAAC,CAAC;AAAA,EACpF;AACA,aAAW,OAAO,CAAC,UAAU,QAAQ,GAAY;AAC7C,kBAAc,MAAM,KAAK,MAAM,KAAK,IAAI,GAAG,GAAG,OAAO,CAAC,GAAG,KAAK,KAAK,EAAE;AAAA,EACzE;AACJ;AAWA,SAAS,cACL,MACA,GACA,KACA,KACA,IACI;AACJ,QAAM,WAAW,GAAG,GAAG;AACvB,MAAI,OAAsB;AAC1B,MAAI,SAAS;AACb,MAAI,MAAM,QAAQ,MAAM,QAAQ,OAAO,MAAM,UAAU;AACnD,WAAO,SAAS,EAAE,GAAG,MAAM,KAAK;AAChC,UAAM,OAAO,QAAQ,MAAM,KAAK,GAAG,MAAM,GAAG,IAAI;AAEhD,UAAM,OAAO,SAAS,OAAO,SAAS,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI;AACjE,aAAS,SAAS,QAAQ,SAAS;AACnC,aAAS,SAAS,QAAQ,SAAS,OAAO,KAAK,QAAQ,MAAM,GAAG,GAAG,cAAc,MAAM,KAAK,EAAE;AAAA,EAClG,WAAW,OAAO,MAAM,UAAU;AAC9B,WAAO;AAAA,EACX;AACA,MAAI,SAAS,MAAM;AACf,UAAM,QAAQ,UAAU,SAAS,eAAe,IAAI,KAAK,YAAA,CAAa,KAAK,MAAM,WAAW,GAAG,QAAQ,CAAC;AACxG,QAAI,UAAU,SAAU,cAAc,IAAI,SAAS,EAAE,KAAK,QAAS,KAAK;AAAA,EAC5E;AACJ;AAOA,MAAM,qCAAkD,IAAI;AAAA,EACxD,CAAC,WAAW,KAAK;AAAA,EACjB,CAAC,WAAW,KAAK;AAAA,EACjB,CAAC,WAAW,QAAQ;AACxB,CAAC;AAGD,MAAM,oCAAiD,IAAI;AAAA,EACvD,CAAC,YAAY,eAAe;AAAA,EAC5B,CAAC,OAAO,eAAe;AAAA,EACvB,CAAC,WAAW,cAAc;AAAA,EAC1B,CAAC,UAAU,aAAa;AAC5B,CAAC;AAWD,SAAS,iBACL,MACA,UACA,OACA,MACA,KACI;AACJ,QAAM,SAAS,aAAa,UAAU,UAAU,MAAM,GAAG,MAAM,EAAE,IAAI,CAAC,MAAiB;AACnF,UAAM,CAAC,GAAG,CAAC,KAAK,SAAS,GAAG,UAAU,KAAK,IAAI,MAAM,GAAG,EAAE,IAAI,MAAM;AACpE,WAAO,CAAC,GAAG,CAAC;AAAA,EAChB,CAAC;AACD,QAAM,CAAC,GAAG,GAAG,IAAI,IAAI;AACrB,QAAM,QAAQ,OACR,iBAAiB,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,QAAQ,IAAI,IACzD,WAAW,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,QAAQ,IAAI;AACzD,MAAI,SAAS,KAAK;AAClB,QAAM,KAAK,KAAK,MAAM,KAAK;AAC3B,QAAM,YAAY,OAAO,OAAO,SAAY,SAAS,GAAG,GAAG,iBAAiB;AAC5E,MAAI,UAAU,QAAQ,IAAI,QAAQ,uBAAuB,OAAO,SAAS,IAAI,GAAG;AAC5E,QAAI,UAAU,IAAI;AAAA,EACtB;AACJ;AAGA,MAAM,4BAAyC,IAAI;AAAA,EAC/C,CAAC,SAAS,KAAK;AAAA,EACf,CAAC,SAAS,QAAQ;AAAA,EAClB,CAAC,QAAQ,OAAO;AAAA,EAChB,CAAC,QAAQ,MAAM;AAAA,EACf,CAAC,aAAa,WAAW;AAAA,EACzB,CAAC,aAAa,UAAU;AAAA,EACxB,CAAC,aAAa,cAAc;AAAA,EAC5B,CAAC,aAAa,aAAa;AAAA,EAC3B,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,UAAU,QAAQ;AAAA,EACnB,CAAC,SAAS,OAAO;AAAA,EACjB,CAAC,QAAQ,MAAM;AAAA,EACf,CAAC,YAAY,WAAW;AAAA,EACxB,CAAC,WAAW,UAAU;AAAA,EACtB,CAAC,eAAe,cAAc;AAAA,EAC9B,CAAC,cAAc,aAAa;AAChC,CAAC;AAMD,MAAM,wCAAmE,IAAI;AAAA,EACzE,CAAC,+BAA+B,SAAS;AAAA,EACzC,CAAC,mCAAmC,SAAS;AAAA,EAC7C,CAAC,qBAAqB,SAAS;AAAA,EAC/B,CAAC,+BAA+B,SAAS;AAAA,EACzC,CAAC,+BAA+B,QAAQ;AAAA,EACxC,CAAC,mCAAmC,QAAQ;AAAA,EAC5C,CAAC,sCAAsC,QAAQ;AAAA,EAC/C,CAAC,kCAAkC,QAAQ;AAC/C,CAAC;AAGD,MAAM,mBAAmB;AAUzB,SAAS,gBAAgB,MAAkB,OAAoC;AAC3E,QAAMA,QAAO,SAAS,OAAO,iBAAiB;AAC9C,MAAIA,UAAS,QAAW;AACpB,UAAM,IAAI,iBAAiB,KAAKA,MAAK,MAAM,GAAG,sBAAsB,EAAE,MAAM;AAC5E,QAAI,MAAM,MAAM;AACZ,aAAO,EAAE,KAAK,GAAG,EAAE,CAAC,CAAC,aAAa,GAAG,EAAE,cAAc,EAAE,CAAC,IAAE;AAAA,IAC9D;AAAA,EACJ;AACA,QAAM,IAAI,KAAK,MAAMA,SAAQ,UAAU,OAAO,uBAAuB,CAAC;AACtE,SAAO,MAAM,QAAQ,MAAM,QAAQ,OAAO,MAAM,WAAW,OAAO;AACtE;AAUA,SAAS,gBAAgB,MAAkB,OAAwB;AAC/D,QAAM,YAAY,gBAAgB,MAAM,KAAK;AAC7C,QAAM,QAAQ,cAAc,OAAO,SAAY,kBAAkB,IAAI,UAAU,GAAG;AAClF,MAAI,cAAc,QAAQ,UAAU,QAAW;AAC3C,WAAO;AAAA,EACX;AACA,QAAM,MAAM,SAAS,UAAU,GAAG,UAAU,KAAK;AACjD,QAAM,OAAO,MAAM,IAAI,IAAI,MAAM,GAAG,sBAAsB,EAAE,YAAA,EAAc,WAAW,KAAK,EAAE,CAAC;AAC7F,MAAI,SAAS,QAAW;AACpB,WAAO;AAAA,EACX;AACA,SAAO,UAAU,WAAW,UAAU,IAAI,KAAK;AACnD;AAGA,MAAM,iCAA8C,IAAI;AAAA,EACpD,CAAC,aAAa,KAAK;AAAA,EACnB,CAAC,aAAa,QAAQ;AAAA,EACtB,CAAC,UAAU,QAAQ;AAAA,EACnB,CAAC,eAAe,KAAK;AAAA,EACrB,CAAC,eAAe,QAAQ;AAAA,EACxB,CAAC,kBAAkB,QAAQ;AAC/B,CAAC;AAGD,MAAM,2CAAwD,IAAI;AAAA,EAC9D,CAAC,wCAAwC,UAAU;AAAA,EACnD,CAAC,+BAA+B,YAAY;AAChD,CAAC;AAUD,SAAS,oBAAoB,MAAkB,OAA+B;AAC1E,QAAM,YAAY,gBAAgB,MAAM,KAAK;AAC7C,MAAI,cAAc,MAAM;AACpB,WAAO;AAAA,EACX;AACA,QAAM,QAAQ,SAAS,UAAU,GAAG,OAAO;AAC3C,MAAI,UAAU,UAAa,OAAO,KAAK,MAAM,KAAK;AAC9C,WAAO;AAAA,EACX;AACA,QAAM,YAAY,qBAAqB,IAAI,UAAU,GAAG;AACxD,QAAM,MAAM,cAAc,SAAY,SAAY,SAAS,UAAU,GAAG,SAAS;AACjF,SAAO,QAAQ,SAAY,OAAQ,WAAW,IAAI,IAAI,MAAM,GAAG,sBAAsB,EAAE,YAAA,CAAa,KAAK;AAC7G;AASA,SAAS,WAAW,MAAkB,MAAe,KAAe,IAAkB;AAClF,MAAI,QAAiB;AACrB,MAAIH,QAAO;AACX,MAAI,QAAQ;AACZ,aAAW,KAAK,aAAa,UAAU,MAAM,MAAM,GAAG,OAAO,GAAG;AAC5D,UAAM,MAAM,SAAS,GAAG,MAAM,KAAK,SAAS,UAAU,GAAG,YAAY,CAAC,KAAK;AAC3E,QAAI,IAAI,OAAO,WAAW,GAAG;AACzB;AAAA,IACJ;AACA,QAAI,UAAU,QAAW;AACrB,cAAQ;AACR,MAAAA,QAAO;AAAA,IACX,OAAO;AACH;AAAA,IACJ;AAAA,EACJ;AACA,MAAI,UAAU,QAAW;AACrB;AAAA,EACJ;AACA,MAAI,QAAQ,GAAG;AACX,WAAO,GAAG,OAAO,GAAG,YAAY,cAAc,GAAG,OAAO,QAAQ,CAAC,CAAC,SAAS;AAAA,EAC/E;AACA,MAAI,SAAS,UAAUA,OAAM,GAAG,OAAO,CAAC,CAAC;AACzC;AAAA,IACI;AAAA,IACA,GAAG,OAAO,EAAE,WAAW,SAAS,gBAAgB,MAAM,KAAK,IAAI,oBAAoB,MAAM,KAAK;AAAA,EAAA;AAElG,QAAM,KAAK,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,UAAU,OAAO,aAAa,CAAC;AACjF,MAAI,OAAO,QAAQ,OAAO,QAAQ,OAAO,OAAO,YAAY,CAAC,GAAG,IAAI,SAAS,YAAY,GAAG;AACxF;AAAA,EACJ;AACA,WAAS,QAAQ,MAAM,KAAK,IAAI,UAAU,GAAG,IAAI,GAAG,cAAc,MAAM,KAAK,EAAE;AAC/E,gBAAc,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,GAAG,KAAK,EAAE;AACvD;AAQA,SAAS,cAAc,GAAoC,KAAe,IAAkB;AACxF,MAAI,MAAM,QAAQ,MAAM,QAAQ,OAAO,MAAM,YAAY,EAAE,QAAQ,QAAQ;AACvE;AAAA,EACJ;AACA,MAAI,aAAa,YAAY,SAAS,EAAE,GAAG,UAAU,GAAG,GAAG,WAAW,CAAC,CAAC;AACxE,QAAM,SAAS,SAAS,EAAE,GAAG,YAAY;AACzC,MAAI,WAAW,QAAW;AACtB,QAAI,aAAa,UAAU,OAAO,WAAW,oBAAoB,EAAE,GAAG,GAAG,WAAW,CAAC,CAAC;AAAA,EAC1F;AACA,QAAM,SAAS,SAAS,EAAE,GAAG,YAAY;AACzC,MAAI,WAAW,QAAW;AACtB,QAAI,eAAe,UAAU,UAAU,QAAQ,WAAW,GAAG,aAAa,CAAC,CAAC;AAAA,EAChF;AACJ;AAGA,MAAM,gBAAmE;AAAA,EACrE,MAAM,CAAC,aAAa,cAAc,cAAc;AAAA,EAChD,MAAM,CAAC,aAAa,cAAc,cAAc;AACpD;AAmBA,SAAS,kBACL,KACA,QACA,OACyC;AACzC,QAAM,EAAE,UAAU,OAAO,QAAQ,MAAM,UAAU;AACjD,QAAM,SAAS,WAAW;AAC1B,QAAM,QAAQ,SAAS,SAAS,QAAQ,SAAS;AACjD,QAAM,IAAI,SAAS,SAAS,YAAY,SAAS;AACjD,QAAM,MAAM,aAAa,CAAC;AAC1B,QAAM,CAAC,OAAO,QAAQ,QAAQ,IAAI,cAAc,MAAM,EAAE,IAAI,CAAC,SAAS,MAAM,IAAI,IAAI,CAAC;AACrF,QAAM,OAAO,CAAC,MAA0B,MACpC,SAAS,SAAY,SAAY,UAAU,MAAM,MAAM,MAAM,CAAC,CAAC;AACnE,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,WAAO,MAAM,QAAQ,CAAC;AACtB,UAAM,KAAa,CAAC,cAAc,EAAE,OAAO,QAAQ,UAAU,SAAS,GAAG;AACzE,UAAM,MAAgB,CAAC,UAAU,UAAU;AACvC,UAAI,IAAI,GAAG,UAAU,KAAK;AAAA,IAC9B;AACA,QAAI,OAAoB;AACxB,QAAI,aAAa,UAAa,CAAC,QAAQ;AACnC,YAAM,MAAM,CAAC,MAA4B,MAAM,SAAS,IAAI,GAAG,IAAI,IAAI,CAAC;AACxE,YAAM,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,WAAW,CAAC,GAAG,SAAS,WAAW,CAAC,CAAC;AAC9D,uBAAiB,MAAM,KAAK,UAAU,CAAC,GAAG,KAAK,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,GAAG;AAAA,IAC5F,WAAW,aAAa,QAAW;AAC/B,aAAO,iBAAiB,KAAK,UAAU,CAAC,GAAG,GAAG,OAAO,KAAK,EAAE;AAAA,IAChE;AACA,QAAI,UAAU,UAAa,QAAQ;AAC/B,oBAAc,MAAM,KAAK,OAAO,CAAC,GAAG,KAAK,IAAI,IAAI;AAAA,IACrD,WAAW,UAAU,QAAW;AAC5B,oBAAc,MAAM,KAAK,OAAO,CAAC,GAAG,KAAK,EAAE;AAAA,IAC/C;AACA,QAAI,WAAW,QAAW;AACtB,iBAAW,MAAM,KAAK,QAAQ,CAAC,GAAG,KAAK,EAAE;AAAA,IAC7C;AAAA,EACJ;AACA,SAAO,IAAI;AACf;AAWA,SAAS,iBAAiB,UAAmB,GAAW,OAAqB,KAAe,IAAyB;AACjH,QAAM,OAAO,UAAU,UAAU,OAAO;AACxC,QAAM,QAAQ,YAAY,SAAS,MAAM,OAAO,GAAG,GAAG,OAAO,CAAC;AAC9D,QAAM,SAAS,YAAY,SAAS,MAAM,QAAQ,GAAG,GAAG,QAAQ,CAAC;AACjE,MAAI,SAAS,KAAK;AAClB,MAAI,UAAU,MAAM;AACpB,MAAI,UAAU,QAAQ,WAAW,MAAM;AACnC,WAAO;AAAA,EACX;AACA,QAAM,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,SAAS,MAAM,GAAG,CAAC,GAAG,OAAO,SAAS,MAAM,GAAG,CAAC,CAAC;AACxE,QAAM,IAAI,CAAC,IAAI,QAAQ,GAAG,IAAI,SAAS,GAAG,OAAO,MAAM,GAAG,IAAI,CAAC;AAC/D,SAAO,EAAE,OAAO,OAAA;AACpB;AASO,SAAS,kBAAkB,UAAyB,OAAmB,QAAyC;AACnH,QAAM,YAAY,cAAc,SAAS,KAAK;AAC9C,QAAM,YAAY,cAAc,SAAS,KAAK;AAC9C,QAAM,SAAS,CAAC,GAAG,UAAU,QAAQ,GAAG,UAAU,KAAA,CAAM,EAAE,KAAK,CAAC,MAAM,MAAM,YAAY;AACxF,MAAI,CAAC,QAAQ;AACT,WAAO;AAAA,EACX;AACA,QAAM,aAAa,cAAc,SAAS,KAAK;AAC/C,QAAM,aAAa,WAAW,IAAI,YAAY;AAC9C,QAAM,OAAO,IAAI,WAAW,eAAe,SAAY,OAAO,UAAU,SAAS,MAAM,MAAM,YAAY,CAAC,CAAC,CAAC;AAC5G,QAAM,QAAQ,IAAI,aAAa,IAAI,SAAS,SAAS,EAAE,KAAK,OAAO,GAAG;AACtE,QAAM,OAAO,CAAC,QAAqB,UAC/B,kBAAkB,EAAE,UAAU,OAAO,QAAQ,MAAM,MAAA,GAAS,QAAQ,KAAK;AAC7E,QAAM,OAAO,KAAK,QAAQ,SAAS;AACnC,QAAM,OAAO,KAAK,QAAQ,SAAS;AACnC,MAAI,KAAK,SAAS,GAAG;AACjB,UAAM,IAAI,YAAY,iBAAiB,MAAM,MAAM;AAAA,MAC/C,QAAQ,0BAA0B,OAAO,mBAAmB,CAAC,iBAAiB,OAAO,KAAK,MAAM,CAAC;AAAA,IAAA,CACpG;AAAA,EACL;AACA,SAAO,EAAE,MAAM,KAAA;AACnB;ACv8BA,MAAM,gBAAmC,CAAC,KAAK,KAAK,KAAK,MAAM;AAO/D,SAAS,OAAO,OAAwC;AACpD,SAAO,MAAM,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG;AAC5D;AAUA,SAAS,UACL,UACA,OACA,SAC0C;AAC1C,QAAM,OAAO,CAAC,WAAsC;AAChD,UAAM,QAAQ,WAAW,SAAS,SAAS,QAAQ,SAAS;AAC5D,UAAM,IAAI,WAAW,SAAS,SAAS,YAAY,SAAS;AAC5D,UAAM,MAAM,aAAa,CAAC;AAC1B,UAAM,MAAM,EAAE,KAAK,OAAO,KAAK,GAAG,MAAM,WAAW,UAAU,MAAM,IAAI,MAAM,GAAG,OAAO,MAAM,IAAI,OAAO,EAAA;AACxG,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,cAAQ,OAAO,MAAM,QAAQ,CAAC;AAC9B,YAAM,KAAK,CAAC,cAAyD;AAAA,QACjE;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS;AAAA,QACT,QAAQ,QAAQ;AAAA,MAAA;AAEpB;AAAA,QACI;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,CAAC,UAAU,UAAU;AACjB,cAAI,IAAI,GAAG,UAAU,KAAK;AAAA,QAC9B;AAAA,QACA;AAAA,MAAA;AAAA,IAER;AACA,WAAO,IAAI;AAAA,EACf;AACA,SAAO,EAAE,MAAM,KAAK,MAAM,GAAG,MAAM,KAAK,MAAM,EAAA;AAClD;AAcA,SAAS,aACL,OACA,QACA,GACA,KACA,KACA,IACI;AACJ,MAAI,IAAI,KAAK;AACT,UAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,GAAG,EAAE,IAAI,CAAC,MAAM,UAAU,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC;AACzE,QAAI,MAAM,QAAQ,MAAM,QAAQ,MAAM,MAAM;AACxC,YAAM,WAAW,WAAW,SAAS,SAAS;AAC9C,UAAI,UAAU,WAAW,EAAE,GAAG,GAAG,KAAK,SAAS,GAAG,QAAQ,CAAC,GAAG,SAAS,IAAI;AAAA,IAC/E;AAAA,EACJ;AACA,MAAI,IAAI,MAAM;AACV,UAAM,IAAI,YAAY,UAAU,MAAM,MAAM,QAAQ,CAAC,CAAC,GAAG,GAAG,OAAO,CAAC;AACpE,QAAI,SAAS,CAAC;AACd,QAAI,UAAU,CAAC;AAAA,EACnB;AACA,MAAI,IAAI,OAAO;AACX,QAAI,SAAS,UAAU,UAAU,MAAM,MAAM,SAAS,CAAC,CAAC,GAAG,GAAG,OAAO,CAAC,CAAC;AAAA,EAC3E;AACJ;AASA,SAAS,sBAAsB,UAAyB,KAAoB;AACxE,QAAMA,QAAO,SAAS,MAAM,IAAI,gBAAgB,IAAI,UAAU,SAAS,MAAM,MAAM,kBAAkB,CAAC,CAAC,IAAI;AAC3G,MAAI,OAAOA,UAAS,UAAU;AAC1B;AAAA,EACJ;AACA,iBAAe,UAAUA,OAAM,GAAG;AACtC;AAUO,SAAS,cAAc,UAAyB,SAAkD;AACrG,QAAM,QAAQ,IAAI,WAAA;AAClB,QAAM,WAAW,EAAE,MAAM,cAAc,SAAS,KAAK,GAAG,MAAM,cAAc,SAAS,KAAK,EAAA;AAC1F,QAAM,UAAU,kBAAkB,UAAU,OAAO,QAAQ,MAAM;AACjE,MAAI,YAAY,MAAM;AAClB,WAAO;AAAA,MACH,WAAW;AAAA,MACX,SAAS;AAAA,MACT,MAAM;AAAA,MACN,OAAO;AAAA,MACP,MAAM,EAAE,QAAQ,QAAQ,KAAA;AAAA,MACxB,MAAM,EAAE,QAAQ,QAAQ,KAAA;AAAA,MACxB,OAAO,MAAM,KAAA;AAAA,MACb;AAAA,IAAA;AAAA,EAER;AACA,QAAM,MAAM,cAAc,UAAU,OAAO,QAAQ,MAAM;AACzD,MAAI,QAAQ,MAAM;AACd,0BAAsB,UAAU,GAAG;AACnC,WAAO;AAAA,MACH,WAAW;AAAA,MACX,SAAS;AAAA,MACT,MAAM;AAAA,MACN,OAAO;AAAA,MACP,MAAM,EAAE,QAAQ,IAAI,KAAA;AAAA,MACpB,MAAM,EAAE,QAAQ,IAAI,KAAA;AAAA,MACpB,OAAO,MAAM,KAAA;AAAA,MACb,gBAAgB;AAAA,MAChB;AAAA,IAAA;AAAA,EAER;AACA,MAAI,OAAO,SAAS,KAAK,GAAG;AACxB,UAAM,QAAQ,UAAU,UAAU,OAAO,OAAO;AAEhD,WAAO,MAAM,KAAK;AAClB,UAAM,QAAQ,WAAW,UAAU,EAAE,MAAM,MAAM,KAAK,MAAM,OAAO,MAAM,KAAK,MAAA,GAAS,CAAA,GAAI,QAAQ,MAAM;AACzG,UAAM,OAAO,CAAC,UAA4C,cAAc,OAAO,CAAC,MAAM,MAAM,IAAI,CAAC,CAAC;AAClG,WAAO;AAAA,MACH,WAAW;AAAA,MACX,SAAS;AAAA,MACT,MAAM;AAAA,MACN,OAAO;AAAA,MACP,MAAM,EAAE,QAAQ,MAAM,MAAM,GAAG,MAAM,KAAA;AAAA,MACrC,MAAM,EAAE,QAAQ,MAAM,MAAM,GAAG,MAAM,KAAA;AAAA,MACrC,OAAO,MAAM,KAAA;AAAA,MACb,UAAU,EAAE,MAAM,KAAK,SAAS,KAAK,GAAG,MAAM,KAAK,SAAS,KAAK,EAAA;AAAA,IAAE;AAAA,EAE3E;AACA,MAAI,SAAS,MAAM,IAAI,MAAM,KAAK,SAAS,MAAM,IAAI,aAAa,GAAG;AAEjE,UAAM,QAAQ,aAAa,SAAS,SAAS;AAC7C,QAAI,SAAS,MAAM,IAAI,MAAM,GAAG;AAC5B,eAAS,IAAI,GAAG,IAAI,SAAS,WAAW,KAAK;AACzC,cAAM;AAAA,UACF;AAAA,UACA;AAAA,UACA,UAAU,UAAU,SAAS,MAAM,MAAM,QAAQ,CAAC,CAAC,GAAG;AAAA,YAClD;AAAA,YACA,QAAQ;AAAA,YACR,UAAU;AAAA,YACV,SAAS;AAAA,YACT,QAAQ,QAAQ;AAAA,UAAA,CACnB;AAAA,QAAA;AAAA,MAET;AAAA,IACJ;AACA,WAAO;AAAA,MACH,WAAW;AAAA,MACX,SAAS;AAAA,MACT,MAAM;AAAA,MACN,OAAO;AAAA,MACP,MAAM,EAAE,QAAQ,MAAM,OAAA;AAAA,MACtB,MAAM,EAAE,QAAQ,GAAC;AAAA,MACjB,OAAO,MAAM,KAAA;AAAA,IAAK;AAAA,EAE1B;AACA,SAAO;AACX;ACzHA,SAAS,kBAAkB,MAAc,MAAuB;AAC5D,SAAO,SAAS,WAAW,oBAAoB,KAAK,IAAI,KAAK,eAAe,MAAM,IAAI;AAC1F;AASA,SAAS,uBAAuB,MAAc,MAAcI,OAAuB;AAC/E,MAAIA,OAAM;AACN,WAAO,QAAQ,IAAI,gBAAgB,IAAI;AAAA,EAC3C;AACA,MAAI,kBAAkB,IAAI,IAAI,GAAG;AAC7B,WAAO,QAAQ,IAAI,eAAe,IAAI;AAAA,EAC1C;AACA,SAAO,QAAQ,IAAI,eAAe,IAAI;AAC1C;AAGA,MAAM,uCAA4C,IAAI,CAAC,MAAM,eAAe,eAAe,aAAa,CAAC;AACzG,MAAM,kBAAuC,oBAAI,IAAI,CAAC,IAAI,CAAC;AAC3D,MAAM,qCAA0C,IAAI;AAAA,EAChD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC;AACD,MAAM,kBAAuC,oBAAI,IAAI,CAAC,KAAK,CAAC;AAC5D,MAAM,uBAA4C,oBAAI,IAAI,CAAC,IAAI,CAAC;AAChE,MAAM,sBAA2C,oBAAI,IAAI,CAAC,QAAQ,MAAM,CAAC;AACzE,MAAM,kBAAuC,oBAAI,IAAI,CAAC,MAAM,CAAC;AAC7D,MAAM,oCAAyC,IAAA;AAQ/C,SAAS,eAAe,MAAc,MAAuB;AACzD,SAAO,SAAS,SAAS,KAAK,SAAS,WAAW;AACtD;AAOA,SAAS,aAAa,OAAmD;AACrE,aAAW,CAAC,MAAM,KAAK,KAAK,OAAO;AAC/B,QAAI,eAAe,OAAO,IAAI,KAAK,MAAM,SAAS,GAAG;AACjD,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AAGA,MAAM,wCAA6C,IAAI,CAAC,MAAM,QAAQ,eAAe,iBAAiB,eAAe,CAAC;AAGtH,MAAM,8BAA8B;AACpC,MAAM,sCAA2C,IAAI;AAAA,EACjD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC;AAyBD,MAAM,kBAAwC,EAAE,KAAK,aAAa,iBAAiB,OAAO,YAAY,SAAA;AAGtG,MAAM,cAAc;AAEpB,MAAM,eAAoC,oBAAI,IAAI,CAAC,QAAQ,MAAM,CAAC;AAGlE,MAAM,uBAAuB;AAG7B,MAAM,mCAA2D,IAA+B;AAAA,EAC5F;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC;AA+JD,MAAM,WAAW;AAAA,EAAjB,cAAA;AACI,SAAQ,QAAQ,IAAI,YAAY,EAAE;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOlC,IAAI,OAAwB;AACxB,UAAM,IAAI,UAAU;AACpB,WAAO,IAAI,KAAK,MAAM,WAAY,KAAK,MAAM,CAAC,OAAO,QAAQ,MAAO,OAAO;AAAA,EAC/E;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAI,OAAqB;AACrB,UAAM,IAAI,UAAU;AACpB,QAAI,KAAK,KAAK,MAAM,QAAQ;AACxB,UAAI,OAAO,KAAK,MAAM,SAAS;AAC/B,aAAO,QAAQ,GAAG;AACd,gBAAQ;AAAA,MACZ;AACA,YAAM,QAAQ,IAAI,YAAY,IAAI;AAClC,YAAM,IAAI,KAAK,KAAK;AACpB,WAAK,QAAQ;AAAA,IACjB;AACA,SAAK,MAAM,CAAC,KAAK,MAAM,QAAQ;AAAA,EACnC;AACJ;AAKA,MAAM,cAAoC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA6HtC,YACI,MACA,QACA,SACA,YACF;AArHF,SAAiB,MAAa,CAAA;AAG9B,SAAiB,2BAAW,IAAA;AAE5B,SAAiB,SAAuB,CAAA;AAExC,SAAiB,QAAqB,CAAA;AAEtC,SAAiB,WAAW,IAAI,WAAA;AAEhC,SAAiB,8BAAc,IAAA;AAE/B,SAAiB,oCAAoB,IAAA;AAErC,SAAiB,sCAAsB,IAAA;AAEvC,SAAQ,qBAAqB;AAG7B,SAAiB,+BAAe,IAAA;AAEhC,SAAiB,uCAAuB,IAAA;AAExC,SAAQ,aAAgC;AAExC,SAAQ,OAAyB;AAEjC,SAAQ,YAAmC;AAE3C,SAAiB,UAAwB;AAAA,MACrC,KAAK;AAAA,MACL,YAAY;AAAA,MACZ,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,IAAA;AAGV,SAAQ,aAAqC;AAE7C,SAAQ,WAAW;AAEnB,SAAQ,WAAW;AAGnB,SAAiB,YAA0C,EAAE,MAAM,KAAA;AAEnE,SAAQ,cAA6B;AAErC,SAAQ,YAAY;AAEpB,SAAQ,UAAyB;AAEjC,SAAQ,cAAgD;AAExD,SAAQ,aAAqC,CAAA;AAE7C,SAAQ,eAAiF;AAEzF,SAAQ,kBAAkB;AAG1B,SAAiB,sCAAsB,IAAA;AAEvC,SAAQ,iBAAiB;AAEzB,SAAQ,eAA6B;AAErC,SAAQ,mBAAiC;AAEzC,SAAQ,mBAAiC;AAEzC,SAAQ,eAA6B;AAErC,SAAQ,YAA0B;AAGlC,SAAiB,OAAO,IAAI,WAAA;AAG5B,SAAiB,WAA2C,CAAA;AAG5D,SAAiB,+BAAe,IAAA;AAGhC,SAAQ,YAAY;AAGpB,SAAQ,SAAwB;AAGhC,SAAQ,gBAAgB;AAGxB,SAAiB,mCAAmB,IAAA;AAEpC,SAAiB,sCAAsB,IAAA;AAGvC,SAAiB,4BAAY,IAAA;AAE7B,SAAiB,WAA+B,CAAA;AAe5C,SAAK,OAAO;AACZ,SAAK,SAAS;AACd,SAAK,UAAU;AACf,SAAK,aAAa;AAClB,SAAK,UAAU,IAAI,UAAU,QAAQ,GAAG;AACxC,SAAK,YAAY,IAAI,kBAAkB,MAAM,QAAQ,QAAQ,gBAAgB;AAAA,EACjF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,MAAc,OAAoC,MAAc,KAAoB,IAAU;AAChG,UAAM,SAAS,KAAK,IAAI,GAAG,EAAE,KAAK;AAClC,YAAQ,QAAA;AAAA,MACJ,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD,aAAK,aAAa,MAAM,KAAK;AAC7B;AAAA,MACJ,KAAK;AAAA,MACL,KAAK;AACD,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ,KAAK;AACD,aAAK,UAAU,UAAU,IAAI,CAAC;AAC9B;AAAA,IAEA;AAER,UAAM,QAAQ,UAAU,IAAI;AAC5B,QAAI,WAAW,QAAQ,OAAO,qBAAqB,OAAO,MAAM,OAAO,KAAK,QAAQ;AAEhF,WAAK,eAAe,MAAM,IAAI;AAC9B;AAAA,IACJ;AACA,YAAQ,QAAA;AAAA,MACJ,KAAK;AACD,YAAI,UAAU,WAAW;AACrB,eAAK,OAAO,KAAK,cAAc,aAAa,wBAAwB,IAAI,oBAAoB;AAAA,YACxF;AAAA,UAAA,CACH;AAAA,QACL;AACA,YAAI,OAAO,qBAAqB,OAAO,IAAI;AACvC,eAAK,OAAO;AAAA,YACR;AAAA,YACA,cAAc;AAAA,YACd,OAAO,OACD,aAAa,IAAI,iDACjB,aAAa,IAAI,yBAAyB,KAAK,UAAU,EAAE,CAAC,SAAS,iBAAiB;AAAA,YAC5F,EAAE,MAAM,SAAS,GAAA;AAAA,UAAG;AAAA,QAE5B;AACA,aAAK,SAAS;AACd,aAAK,uBAAuB,WAAW,OAAO,eAAe,IAAI;AACjE,aAAK,SAAS,KAAK;AACnB,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ,KAAK;AACD,aAAK,eAAe,MAAM,OAAO,OAAO,IAAI;AAC5C;AAAA,MACJ,KAAK;AACD,aAAK,WAAW,MAAM,OAAO,OAAO,IAAI;AACxC;AAAA,MACJ,KAAK;AACD,aAAK,aAAa,MAAM,OAAO,OAAO,IAAI;AAC1C;AAAA,MACJ,KAAK;AACD,aAAK,YAAY,MAAM,OAAO,OAAO,IAAI;AACzC;AAAA,MACJ,KAAK;AACD,aAAK,YAAY,MAAM,OAAO,OAAO,IAAI;AACzC;AAAA,MACJ,KAAK;AACD,aAAK,iBAAiB,MAAM,OAAO,OAAO,IAAI;AAC9C;AAAA,MACJ,KAAK;AACD,aAAK,YAAY,MAAM,OAAO,OAAO,IAAI;AACzC;AAAA,MACJ;AACI,aAAK,eAAe,MAAM,IAAI;AAAA,IAAA;AAAA,EAE1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,MAAc,OAAqB;AACnC,UAAM,MAAM,KAAK,IAAI,IAAA;AACrB,YAAQ,KAAA;AAAA,MACJ,KAAK;AACD,aAAK,WAAA;AACL;AAAA,MACJ,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD;AAAA,MACJ,KAAK;AACD,aAAK,WAAA;AACL;AAAA,MACJ,KAAK;AACD,aAAK,UAAA;AACL;AAAA,MACJ,KAAK;AACD,aAAK,cAAA;AACL;AAAA,MACJ,KAAK;AACD,aAAK,WAAA;AACL;AAAA,MACJ,KAAK;AACD,aAAK,WAAA;AACL;AAAA,MACJ,KAAK;AACD,aAAK,WAAA;AACL;AAAA,MACJ,KAAK;AACD,aAAK,gBAAA;AACL;AAAA,MACJ,KAAK;AACD,aAAK,YAAA;AACL;AAAA,MACJ,SAAS;AACL,cAAM,QAAe;AACrB,cAAM,IAAI,iBAAiB,iBAAiB,wBAAwB,OAAO,KAAK,CAAC,IAAI,EAAE,MAAM;AAAA,MACjG;AAAA,IAAA;AAAA,EAER;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAKJ,OAAc,MAAoB;AACnC,UAAM,MAAM,KAAK,IAAI,GAAG,EAAE,KAAK;AAC/B,YAAQ,KAAA;AAAA,MACJ,KAAK;AACD,aAAK,QAAQ,MAAM,KAAKA,KAAI;AAC5B;AAAA,MACJ,KAAK;AAAA,MACL,KAAK;AACD,YAAI,KAAK,QAAQ,SAAS,MAAM;AAC5B,eAAK,QAAQ,QAAQA;AAAA,QACzB,OAAO;AACH,eAAK,QAAQ,KAAK,KAAKA,KAAI;AAAA,QAC/B;AACA;AAAA,MACJ,KAAK;AACD,aAAK,YAAYA;AACjB;AAAA,MACJ,KAAK;AAAA,MACL,KAAK;AACD;AAAA,MACJ;AACI,YAAI,CAAC,aAAaA,KAAI,GAAG;AACrB,eAAK,OAAO;AAAA,YACR;AAAA,YACA,cAAc;AAAA,YACd;AAAA,YACA,EAAE,KAAA;AAAA,UAAK;AAAA,QAEf;AAAA,IAAA;AAAA,EAEZ;AAAA;AAAA;AAAA;AAAA,EAKA,SAAe;AACX,QAAI,CAAC,KAAK,WAAW;AACjB,WAAK,OAAO,KAAK,cAAc,UAAU,qCAAqC;AAAA,IAClF;AAEA,eAAW,QAAQ,KAAK,UAAU;AAC9B,UAAI,eAAe,MAAM;AACrB,aAAK,gBAAgB,IAAI;AAAA,MAC7B,OAAO;AACH,aAAK,QAAQ,IAAI;AAAA,MACrB;AAAA,IACJ;AACA,SAAK,SAAS,SAAS;AACvB,SAAK,WAAA;AACL,eAAW,CAAC,MAAM,IAAI,KAAK,KAAK,iBAAiB;AAC7C,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,GAAG,IAAI,sCAAsC,IAAI;AAAA,QACjD,EAAE,SAAS,KAAA;AAAA,MAAK;AAAA,IAExB;AACA,UAAM,OAAoB,EAAE,SAAS,KAAK,SAAS,aAAa,KAAK,aAAa,YAAY,KAAK,WAAA;AACnG,SAAK,KAAK,QAAQ;AAAA,MACd,cAAc;AAAA,MACd,aAAa,KAAK,eAAe;AAAA,MACjC,cACI,KAAK,iBAAiB,OAChB,SACA;AAAA,QACI,QAAQ;AAAA,QACR,IAAI,KAAK,aAAa;AAAA,QACtB,OAAO,KAAK,aAAa;AAAA,QACzB,MAAM,KAAK,aAAa;AAAA,QACxB,WAAW;AAAA,MAAA;AAAA,MAEzB,OAAO,EAAE,CAAC,QAAQ,GAAG,KAAA;AAAA,IAAK,CAC7B;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,SAAS,OAA0C;AACvD,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO;AAC9B,UAAI,IAAI,WAAW,QAAQ,KAAK,UAAU,qBAAqB,UAAU,eAAe;AACpF,aAAK,WAAW,IAAI,MAAM,CAAC,CAAC,IAAI;AAAA,MACpC;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,eAAe,MAAc,OAAe,OAAoC,MAAoB;AACxG,YAAQ,OAAA;AAAA,MACJ,KAAK;AACD,aAAK,UAAU,SAAS,IAAI;AAC5B;AAAA,MACJ,KAAK;AACD,aAAK,SAAS,OAAO,IAAI;AACzB;AAAA,MACJ,KAAK;AACD,aAAK,WAAW,OAAO,MAAM,aAAa;AAC1C;AAAA,MACJ,KAAK;AACD,aAAK,UAAU,OAAO,MAAM,OAAO;AACnC;AAAA,MACJ;AACI,aAAK,eAAe,MAAM,IAAI;AAAA,IAAA;AAAA,EAE1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,WAAW,MAAc,OAAe,OAAoC,MAAoB;AACpG,YAAQ,OAAA;AAAA,MACJ,KAAK;AACD,aAAK,UAAU,OAAO,IAAI;AAC1B;AAAA,MACJ,KAAK;AACD,aAAK,uBAAuB,WAAW,OAAO,eAAe,IAAI;AACjE,YACI,KAAK,eAAe,SACnB,KAAK,WAAW,gBAAgB,QAAQ,KAAK,WAAW,gBAAgB,SAC3E;AACE,eAAK,OAAO;AAAA,YACR;AAAA,YACA,cAAc;AAAA,YACd,QAAQ,KAAK,WAAW,MAAM,EAAE;AAAA,YAChC,EAAE,MAAM,SAAS,KAAK,WAAW,GAAA;AAAA,UAAG;AAAA,QAE5C;AACA,aAAK,QAAQ,MAAM;AACnB,aAAK,QAAQ,aAAa,KAAK;AAC/B,aAAK,QAAQ,OAAO;AACpB,aAAK,QAAQ,OAAO;AACpB,aAAK,QAAQ,OAAO;AACpB,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ;AACI,aAAK,eAAe,MAAM,IAAI;AAAA,IAAA;AAAA,EAE1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,aAAa,MAAc,OAAe,OAAoC,MAAoB;AACtG,UAAM,QAAQ,KAAK,OAAO,WAAW,KAAK,KAAK,cAAc;AAC7D,YAAQ,OAAA;AAAA,MACJ,KAAK;AACD,YAAI,OAAO;AACP,eAAK,UAAU,SAAS,IAAI;AAAA,QAChC,OAAO;AACH,eAAK,OAAO;AAAA,YACR;AAAA,YACA,cAAc;AAAA,YACd,mBAAmB,KAAK,OAAO,WAAW,IAAI,qBAAqB,QAAQ;AAAA,YAC3E,EAAE,KAAA;AAAA,YACF,GAAG,cAAc,YAAY;AAAA,UAAA;AAEjC,eAAK,IAAI;AAAA,YAAK;AAAA;AAAA,UAAA;AAAA,QAClB;AACA;AAAA,MACJ,KAAK;AACD,YAAI,OAAO;AACP,eAAK,UAAU,OAAO,MAAM,OAAO;AAAA,QACvC,OAAO;AACH,eAAK,OAAO;AAAA,YACR;AAAA,YACA,cAAc;AAAA,YACd,KAAK,OAAO,WAAW,IACjB,0HACA;AAAA,YACN,EAAE,KAAA;AAAA,UAAK;AAEX,eAAK,IAAI;AAAA,YAAK;AAAA;AAAA,UAAA;AAAA,QAClB;AACA;AAAA,MACJ,KAAK;AACD,aAAK,UAAU,OAAO,IAAI;AAC1B;AAAA,MACJ,KAAK;AACD,aAAK,UAAU,OAAO,IAAI;AAC1B;AAAA,MACJ,KAAK;AACD,aAAK,eAAe,OAAO,IAAI;AAC/B;AAAA,MACJ,KAAK;AACD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA,EAAE,KAAA;AAAA,QAAK;AAEX,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ;AACI,aAAK,eAAe,MAAM,IAAI;AAAA,IAAA;AAAA,EAE1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,YAAY,MAAc,OAAe,OAAoC,MAAoB;AACrG,YAAQ,OAAA;AAAA,MACJ,KAAK;AACD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA;AAAA,YACI;AAAA,UAAA;AAAA,QACJ;AAEJ,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ,KAAK;AACD,aAAK,UAAU,OAAO,MAAM,MAAM;AAClC;AAAA,MACJ,KAAK;AACD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA,EAAE,KAAA;AAAA,QAAK;AAEX,aAAK,UAAU,OAAO,IAAI;AAC1B;AAAA,MACJ,KAAK,SAAS;AACV,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,gBAAgB,IAAI;AACzB,YAAI,KAAK,UAAU,eAAe;AAC9B,eAAK,OAAO;AAAA,YACR;AAAA,YACA,cAAc;AAAA,YACd;AAAA,YACA,EAAE,KAAA;AAAA,UAAK;AAAA,QAEf;AACA,aAAK,WAAW,OAAO,MAAM,KAAK,KAAK;AACvC;AAAA,MACJ;AAAA,MACA,KAAK;AACD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA,EAAE,KAAA;AAAA,QAAK;AAEX,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ;AACI,aAAK,eAAe,MAAM,IAAI;AAAA,IAAA;AAAA,EAE1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,YAAY,MAAc,OAAe,OAAoC,MAAoB;AACrG,YAAQ,OAAA;AAAA,MACJ,KAAK;AACD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA;AAAA,YACI;AAAA,UAAA;AAAA,QACJ;AAEJ,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ,KAAK;AACD,aAAK,UAAU,OAAO,MAAM,MAAM;AAClC;AAAA,MACJ,KAAK;AACD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA,EAAE,MAAM,SAAS,MAAM,IAAI,IAAI,KAAK,KAAA;AAAA,QAAK;AAE7C,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ;AACI,aAAK,eAAe,MAAM,IAAI;AAAA,IAAA;AAAA,EAE1C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,UAAU,OAAqB;AACnC,QAAI,UAAU,QAAQ;AAClB,WAAK,OAAO,OAAO;AAAA,IACvB,WAAW,UAAU,UAAU,UAAU,aAAa;AAClD,WAAK,OAAO,OAAO;AAAA,IACvB;AACA,SAAK,IAAI;AAAA,MAAK,UAAU,UAAU,UAAU,SAAS,KAAW;AAAA;AAAA,IAAA;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,UAAU,OAAoC,MAAoB;AACtE,SAAK,uBAAuB,QAAQ,OAAO,iBAAiB,IAAI;AAChE,UAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,UAAM,OAAO,MAAM,IAAI,MAAM;AAC7B,QAAI,KAAK,OAAO,QAAQ,SAAS,QAAW;AACxC,YAAM,KAAK,KAAK,cAAc,KAAK;AACnC,UAAI,QAAQ,KAAK,MAAM,IAAI,EAAE;AAC7B,UAAI,UAAU,QAAW;AACrB,oCAAY,IAAA;AACZ,aAAK,MAAM,IAAI,IAAI,KAAK;AAAA,MAC5B;AACA,YAAM,IAAI,IAAI;AAAA,IAClB;AACA,SAAK,IAAI;AAAA,MAAK;AAAA;AAAA,IAAA;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,YAAY,MAAc,OAAe,OAAoC,MAAoB;AACrG,YAAQ,OAAA;AAAA,MACJ,KAAK;AACD,aAAK,UAAU,OAAO,IAAI;AAC1B;AAAA,MACJ,KAAK;AAAA,MACL,KAAK;AACD,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ;AACI,aAAK,eAAe,MAAM,IAAI;AAAA,IAAA;AAAA,EAE1C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,aAAmB;AACvB,QAAI,WAAW;AACf,QAAI,QAAuB;AAC3B,eAAW,CAAC,MAAM,IAAI,KAAK,KAAK,UAAU;AACtC,UAAI,KAAK,MAAM,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,MAAM;AAC1C;AACA,kBAAU,GAAG,OAAO,IAAI,CAAC,IAAI,IAAI;AAAA,MACrC;AAAA,IACJ;AACA,QAAI,WAAW,GAAG;AACd,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,GAAG,QAAQ,uBAAuB,OAAO,QAAQ,CAAC,IAAI,MAAM,UAAU,SAAS,MAAM,CAAC,+CAA+C,SAAS,EAAE;AAAA,QAChJ,EAAE,SAAS,MAAA;AAAA,MAAM;AAAA,IAEzB;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,iBAAiB,MAAc,OAAe,OAAoC,MAAoB;AAC1G,YAAQ,OAAA;AAAA,MACJ,KAAK;AACD,aAAK,uBAAuB,YAAY,OAAO,qBAAqB,IAAI;AACxE,aAAK,aAAa,OAAO,IAAI;AAC7B,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ,KAAK;AACD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA,EAAE,KAAA;AAAA,QAAK;AAEX,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ,KAAK;AACD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA,EAAE,KAAA;AAAA,UACF,GAAG,cAAc,YAAY;AAAA,QAAA;AAEjC,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ;AACI,aAAK,eAAe,MAAM,IAAI;AAAA,IAAA;AAAA,EAE1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,eAAe,MAAc,MAAoB;AACrD,SAAK,OAAO,SAAS,eAAe,cAAc,iBAAiB,sBAAsB,IAAI,GAAG;AAAA,MAC5F;AAAA,MACA,SAAS;AAAA,IAAA,CACZ;AACD,SAAK,IAAI;AAAA,MAAK;AAAA;AAAA,IAAA;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,UAAU,QAAyB,MAAoB;AAC3D,SAAK,aAAa;AAClB,SAAK,WAAW;AAChB,SAAK,WAAW;AAChB,SAAK,IAAI;AAAA,MAAK;AAAA;AAAA,IAAA;AAAA,EAClB;AAAA;AAAA,EAGQ,aAAmB;AACvB,UAAMA,QAAO,KAAK,SAAS,KAAA;AAC3B,QAAI,KAAK,eAAe,SAAS,KAAK,eAAe,MAAM;AACvD,WAAK,WAAW,OAAOA;AAAA,IAC3B,WAAW,KAAK,eAAe,WAAWA,MAAK,SAAS,GAAG;AACvD,UAAI,KAAK,eAAe;AAEpB,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA,EAAE,MAAM,KAAK,SAAA;AAAA,QAAS;AAAA,MAE9B;AACA,WAAK,gBAAgB;AACrB,WAAK,cAAcA;AAAA,IACvB;AACA,SAAK,aAAa;AAClB,SAAK,WAAW;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeQ,uBACJ,MACA,OACA,OACA,MACI;AACJ,eAAW,QAAQ,MAAM,QAAQ;AAC7B,UAAI,CAAC,MAAM,IAAI,IAAI,KAAK,CAAC,kBAAkB,MAAM,IAAI,GAAG;AACpD,aAAK,sBAAsB,MAAM,MAAM,IAAI;AAAA,MAC/C;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,sBAAsB,MAAc,MAAc,MAAoB;AAC1E,UAAMI,QAAO,KAAK,WAAW,QAAQ;AACrC,QAAI,QAAQ,KAAK,aAAa,IAAI,IAAI;AACtC,QAAI,UAAU,QAAW;AACrB,kCAAY,IAAA;AACZ,WAAK,aAAa,IAAI,MAAM,KAAK;AAAA,IACrC;AACA,QAAI,MAAM,IAAI,IAAI,GAAG;AACjB;AAAA,IACJ;AACA,QAAI,MAAM,QAAQ,+BAA+B,CAACA,OAAM;AACpD,WAAK,gBAAgB,IAAI,OAAO,KAAK,gBAAgB,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,IAC5E;AACA,UAAM,IAAI,IAAI;AACd,QAAI,MAAM,OAAO,+BAA+B,CAACA,OAAM;AACnD;AAAA,IACJ;AACA,UAAM,OAAOA,QAAO,cAAc,qBAAqB,cAAc;AACrE,SAAK,OAAO,QAAQ,eAAe,MAAM,uBAAuB,MAAM,MAAMA,KAAI,GAAG,EAAE,MAAM,SAAS,MAAM;AAAA,EAC9G;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,WAAW,OAAoC,MAAc,QAAsB;AACvF,SAAK,uBAAuB,SAAS,OAAO,kBAAkB,IAAI;AAClE,UAAM,MAAM,KAAK,OAAO,WAAW;AACnC,QAAI,KAAK;AACL,WAAK;AAAA,IACT;AACA,UAAM,UAAU,MAAM,IAAI,IAAI;AAC9B,QAAI,YAAY,UAAa,QAAQ,SAAS,GAAG;AAC7C,WAAK,SAAS,IAAI,OAAO;AAAA,IAC7B;AACA,UAAM,cAAc,MAAM,IAAI,aAAa;AAC3C,QAAI;AACJ,QAAI,gBAAgB,cAAc,gBAAgB,cAAc;AAC5D,iBAAW,gBAAgB;AAAA,IAC/B,WAAW,gBAAgB,QAAW;AAClC,iBAAW,MAAM,KAAK,QAAQ,kBAAkB,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC,EAAE;AAEpF,YAAM,YAAY,WAAW,aAAa;AAC1C,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,MACM,uCAAuC,SAAS,KAChD,kEAAkE,SAAS;AAAA,QACjF,EAAE,KAAA;AAAA,QACF,GAAG,cAAc,mBAAmB,IAAI,MAAM,QAAQ,QAAQ;AAAA,MAAA;AAAA,IAEtE,OAAO;AACH,iBAAW,MAAM,KAAK,QAAQ,kBAAkB,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC,EAAE;AACpF,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,gBAAgB,WAAW,iDAAiD,WAAW,aAAa,YAAY;AAAA,QAChH,EAAE,KAAA;AAAA,MAAK;AAAA,IAEf;AACA,QAAI,QAA6B;AACjC,QAAI,OAAO,KAAK,WAAW;AACvB,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd;AAAA,QACA,EAAE,MAAM,SAAS,MAAM,IAAI,IAAI,KAAK,KAAA;AAAA,MAAK;AAE7C,iBAAW,QAAQ,CAAC,eAAe,aAAa,GAAG;AAC/C,YAAI,MAAM,IAAI,IAAI,GAAG;AACjB,eAAK,OAAO;AAAA,YACR;AAAA,YACA,cAAc;AAAA,YACd,OAAO,IAAI;AAAA,YACX,EAAE,MAAM,SAAS,KAAA;AAAA,YACjB,GAAG,cAAc,kBAAkB,WAAW,IAAI;AAAA,UAAA;AAAA,QAE1D;AAAA,MACJ;AAAA,IACJ,WAAW,KAAK;AACZ,WAAK,YAAY;AACjB,WAAK,UAAU,MAAM,IAAI,IAAI,KAAK;AAClC,WAAK,cAAc,WAAW,aAAa;AAC3C,WAAK,UAAU,UAAU,UAAU,EAAE,MAAM;AAC3C,YAAM,QAAQ,KAAK,KAAK,MAAM,IAAI,aAAa,GAAG,eAAe,IAAI;AACrE,YAAM,QAAQ,KAAK,KAAK,MAAM,IAAI,aAAa,GAAG,eAAe,IAAI;AACrE,cAAQ,UAAU,QAAQ,UAAU,OAAO,OAAO,EAAE,OAAO,MAAA;AAC3D,UAAI,UAAU,QAAQ,UAAU,MAAM;AAClC,YAAI;AACA,eAAK,KAAK,QAAQ,SAAS,QAAW,SAAS,MAAS;AAAA,QAC5D,SAAS,KAAK;AACV,cAAI,EAAE,eAAe,mBAAmB;AACpC,kBAAM;AAAA,UACV;AACA,eAAK,OAAO;AAAA,YACR;AAAA,YACA,cAAc;AAAA,YACd,uBAAuB,IAAI,OAAO;AAAA,YAClC;AAAA,cACI;AAAA,YAAA;AAAA,UACJ;AAAA,QAER;AAAA,MACJ;AAAA,IACJ;AACA,SAAK,OAAO,KAAK,EAAE,UAAU,QAAQ,OAAO,OAAO,GAAG,OAAO,GAAG,KAAA,CAAM;AACtE,SAAK,IAAI;AAAA,MAAK;AAAA;AAAA,IAAA;AAAA,EAClB;AAAA;AAAA,EAGQ,cAAoB;AACxB,UAAM,QAAQ,KAAK,OAAO,IAAA;AAC1B,QAAI,OAAO,UAAU,QAAQ,UAAU,QAAW;AAC9C;AAAA,IACJ;AACA,eAAW,CAAC,MAAMA,OAAM,KAAK,KAAK;AAAA,MAC9B,CAAC,eAAe,MAAM,MAAM,OAAO,MAAM,KAAK;AAAA,MAC9C,CAAC,eAAe,MAAM,MAAM,OAAO,MAAM,KAAK;AAAA,IAAA,GACtC;AACR,UAAIA,UAAS,QAAQA,UAAS,OAAO;AACjC,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd,UAAU,IAAI,KAAKA,KAAI,0BAA0B,KAAK,IAAI,SAAS,gBAAgB,WAAW,QAAQ;AAAA,UACtG,EAAE,MAAM,MAAM,MAAM,SAAS,KAAA;AAAA,QAAK;AAAA,MAE1C;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,KAAKJ,OAA0B,MAAc,MAA6B;AAC9E,QAAIA,UAAS,QAAW;AACpB,aAAO;AAAA,IACX;AACA,UAAM,IAAI,KAAKA,KAAI;AACnB,QAAI,MAAM,QAAQ,IAAI,WAAW;AAC7B,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,UAAU,IAAI,KAAKA,KAAI;AAAA,QACvB,EAAE,MAAM,SAAS,KAAA;AAAA,MAAK;AAE1B,aAAO;AAAA,IACX;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,SAAS,OAAoC,MAAoB;AAErE,SAAK,uBAAuB,OAAO,OAAO,gBAAgB,IAAI;AAC9D,UAAM,KAAK,MAAM,IAAI,IAAI,KAAK;AAC9B,QAAI,OAAO,QAAQ,KAAK,cAAc,OAAO,EAAE,GAAG;AAC9C,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,QAAQ,EAAE;AAAA,QACV,EAAE,MAAM,SAAS,GAAA;AAAA,MAAG;AAAA,IAE5B;AACA,UAAM,UAAU,MAAM,IAAI,KAAK,KAAK;AACpC,QAAI;AACJ,YAAQ,SAAA;AAAA,MACJ,KAAK;AACD,kBAAU,CAAC,SAAS,QAAQ,MAAM;AAClC;AAAA,MACJ,KAAK;AAED,kBAAU,CAAC,OAAO;AAClB;AAAA,MACJ,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD,kBAAU,CAAC,OAAO;AAClB;AAAA,MACJ,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd,QAAQ,MAAM,EAAE,qBAAqB,OAAO;AAAA,UAC5C,EAAE,MAAM,SAAS,GAAA;AAAA,QAAG;AAExB,kBAAU,CAAA;AACV;AAAA,MACJ;AACI,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd,QAAQ,MAAM,EAAE,yBAAyB,OAAO;AAAA,UAChD,EAAE,MAAM,SAAS,GAAA;AAAA,QAAG;AAExB,kBAAU,CAAA;AAAA,IAAC;AAGnB,UAAM,WAAW,MAAM,IAAI,WAAW,KAAK,MAAM,IAAI,MAAM,KAAK;AAChE,SAAK,aAAa;AAAA,MACd;AAAA,MACA,UAAU,MAAM,IAAI,WAAW,KAAK,MAAM,IAAI,MAAM,KAAK;AAAA,MACzD;AAAA;AAAA,MAEA,YAAY,MAAM,IAAI,aAAa,MAAM,aAAa,OAAO,aAAa,KAAK,IAAI;AAAA,MACnF;AAAA,MACA;AAAA,MACA,MAAM;AAAA,MACN,aAAa;AAAA,MACb,aAAa;AAAA,IAAA;AAEjB,SAAK,IAAI;AAAA,MAAK;AAAA;AAAA,IAAA;AAAA,EAClB;AAAA;AAAA,EAGQ,YAAkB;AACtB,UAAM,MAAM,KAAK;AACjB,SAAK,aAAa;AAClB,QAAI,QAAQ,MAAM;AACd;AAAA,IACJ;AACA,UAAM,QAAQ,EAAE,MAAM,IAAI,MAAM,SAAS,IAAI,GAAA;AAC7C,QAAI,IAAI,OAAO,QAAQ,IAAI,GAAG,WAAW,GAAG;AACxC,WAAK,OAAO,MAAM,oBAAoB,cAAc,gBAAgB,uBAAuB,KAAK;AAChG;AAAA,IACJ;AACA,UAAM,WAAW,KAAK,KAAK,IAAI,IAAI,EAAE,KAAK,CAAA;AAC1C,QAAI,SAAS,KAAK,CAAC,UAAU,MAAM,QAAQ,KAAK,CAAC,WAAW,IAAI,QAAQ,SAAS,MAAM,CAAC,CAAC,GAAG;AACxF,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,QAAQ,IAAI,EAAE;AAAA,QACd;AAAA,MAAA;AAEJ;AAAA,IACJ;AACA,UAAM,SAAS,IAAI,eAAe;AAClC,UAAM,OAAO,IAAI,aAAa,QAAQ,IAAI,SAAS,SAAS,IAAI,IAAI,WAAW,IAAI;AACnF,UAAM,UAAU,UAAU,KAAK,eAAe;AAC9C,QAAI,SAAS;AACT,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,eAAe,IAAI,EAAE,MAAM,IAAI,cAAc,EAAE;AAAA,QAC/C;AAAA,MAAA;AAAA,IAER;AACA,QAAI,SAAS;AACb,QAAI,aAAa;AACjB,QAAI,OAA4B;AAChC,QAAI,OAA4B;AAChC,QAAI,QAA6B;AACjC,eAAW,UAAU,IAAI,SAAS;AAC9B,UAAI,SAAS;AACT;AAAA,MACJ;AACA,UAAI,WAAW,UAAU,CAAC,UAAU,cAAc,MAAM,KAAK,QAAQ,UAAU,GAAG;AAG9E,iBAAS;AACT,aAAK,iBAAiB,EAAE,IAAI,IAAI,IAAI,OAAO,IAAI,UAAU,MAAM,IAAI,SAAA;AACnE;AAAA,MACJ;AACA,UAAI,WAAW,UAAU,CAAC,UAAU,SAAS,uBAAuB;AAChE,YAAI,KAAK,QAAQ,mBAAmB;AAChC,uBAAa;AACb;AAAA,QACJ;AACA,eAAO,KAAK,wBAAwB,GAAG;AACvC;AAAA,MACJ;AACA,UAAI;AACA,cAAM,SAAS,SAAS,KAAK,cAAc,KAAK,MAAM,MAAM,IAAI,KAAK,aAAa,KAAK,MAAM,MAAM;AACnG,YAAI,WAAW,QAAQ;AACnB,iBAAO;AAAA,QACX,WAAW,WAAW,QAAQ;AAC1B,iBAAO;AAAA,QACX,OAAO;AACH,kBAAQ;AAAA,QACZ;AAAA,MACJ,SAAS,KAAK;AACV,aAAK,OAAO,YAAY,KAAK,KAAK;AAAA,MACtC;AAAA,IACJ;AACA,SAAK,KAAK,IAAI,IAAI,IAAI;AAAA,MAClB,GAAG;AAAA,MACH;AAAA,QACI,IAAI,IAAI;AAAA,QACR;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS,IAAI;AAAA,MAAA;AAAA,IACjB,CACH;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,aAAa,KAAiB,MAAc,QAA8B;AAC9E,UAAM,KAAK,IAAI,MAAM;AACrB,UAAM,WAA8B,iBAAiB;AAAA,MACjD,QAAQ;AAAA,MACR;AAAA,MACA,OAAO,IAAI,aAAa,QAAQ,IAAI,SAAS,SAAS,IAAI,IAAI,WAAW;AAAA,MACzE,MAAM,IAAI;AAAA,MACV,aAAa,IAAI,gBAAgB,SAAY,IAAI,cAAc;AAAA,MAC/D,YAAY;AAAA,MACZ,MAAM,WAAW,WAAW,SAAS,eAAe,UAAU;AAAA,MAC9D,MAAM,KAAK,QAAQ;AAAA,MACnB,OAAO,KAAK,QAAQ,MAAM;AAAA,IAAA,CAC7B;AACD,eAAW,SAAS,SAAS,QAAQ;AACjC,WAAK,OAAO,QAAQ,MAAM,UAAU,MAAM,MAAM,MAAM,SAAS,EAAE,MAAM,IAAI,MAAM,SAAS,IAAI;AAAA,IAClG;AACA,QAAI,IAAI,gBAAgB,QAAW;AAC/B,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,yBAAyB,EAAE,uBAAuB,IAAI,YAAY,QAAQ;AAAA,QAC1E,EAAE,MAAM,IAAI,MAAM,SAAS,GAAA;AAAA,MAAG;AAAA,IAEtC;AACA,UAAM,EAAE,SAAS;AACjB,QAAI,IAAI,KAAK,SAAS,GAAG;AACrB,WAAK,QAAQ,EAAE,MAAM,IAAI,KAAA;AAAA,IAC7B;AACA,WAAO,KAAK,cAAc,QAAQ,MAAM,SAAS,MAAM,SAAS,UAAU;AAAA,EAC9E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,cAAc,KAAiB,MAAc,QAA8B;AAC/E,UAAM,KAAK,IAAI,MAAM;AACrB,UAAM,aAAa,iBAAiB,MAAM,IAAI,KAAK,QAAQ,MAAM,CAAC;AAClE,UAAM,OAAmB;AAAA,MACrB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,UAAU;AAAA,MACV,QAAQ;AAAA,QACJ,QAAQ;AAAA,QACR;AAAA,QACA,OAAO,IAAI,aAAa,QAAQ,IAAI,aAAa,aAAa,IAAI,WAAW;AAAA,QAC7E,MAAM,IAAI;AAAA,QACV,WAAW;AAAA,MAAA;AAAA,IACf;AAEJ,QAAI,IAAI,gBAAgB,QAAW;AAC/B,WAAK,UAAU,IAAI;AAAA,IACvB,WAAW,IAAI,gBAAgB,MAAM;AACjC,WAAK,UAAU,IAAI;AAAA,IACvB;AACA,QAAI,IAAI,KAAK,SAAS,GAAG;AACrB,WAAK,QAAQ,EAAE,MAAM,IAAI,KAAA;AAAA,IAC7B;AACA,WAAO,KAAK,cAAc,QAAQ,MAAM,MAAM,OAAO;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,wBAAwB,KAA+B;AAC3D,UAAM,OAAmB;AAAA,MACrB,MAAM,iBAAiB,oBAAoB,IAAI,IAAI,KAAK,QAAQ,MAAM,CAAC;AAAA,MACvE,OAAO;AAAA,MACP,UAAU;AAAA,MACV,MAAM;AAAA,MACN,QAAQ,EAAE,QAAQ,QAAQ,IAAI,IAAI,IAAI,OAAO,IAAI,UAAU,MAAM,IAAI,UAAU,WAAW,KAAA;AAAA,IAAK;AAEnG,WAAO,KAAK,cAAc,QAAQ,MAAM,MAAM,OAAO;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,cACJ,QACA,MACA,MACA,YACY;AACZ,QAAI,WAAW,SAAS;AACpB,WAAK,KAAK,cAAc,KAAK,MAAM,QAAW,IAAI;AAClD,WAAK,iBAAiB,IAAI,KAAK,IAAI;AACnC,aAAO,EAAE,MAAM,KAAK,MAAM,QAAQ,eAA+B,MAAM,MAAM,WAAA;AAAA,IACjF;AACA,UAAM,WAAW,gBAAgB,KAAK,MAAM,QAAQ,MAAM,KAAK,QAAQ,EAAE,SAAS,KAAK,KAAA,CAAM;AAC7F,WAAO,EAAE,MAAM,SAAS,KAAK,MAAM,QAAQ,SAAS,QAAQ,MAAM,SAAS,MAAM,MAAM,WAAA;AAAA,EAC3F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,QAAQ,QAA2C;AACvD,QAAI,WAAW,SAAS;AACpB,aAAO,CAAC,SAA0B,KAAK,iBAAiB,IAAI,IAAI;AAAA,IACpE;AACA,UAAM,WAAW,WAAW,SAAS,sBAAsB;AAC3D,UAAM,SAAS,QAAQ,KAAK,MAAM,MAAM;AACxC,WAAO,CAAC,SAA0B,SAAS,IAAI,IAAI,KAAK,OAAO,IAAI;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,UAAU,OAAoC,MAAc,QAAsB;AACtF,SAAK,uBAAuB,QAAQ,OAAO,iBAAiB,IAAI;AAChE,UAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,UAAM,EAAE,YAAY;AACpB,QAAI,UAAU,QAAW;AACrB,WAAK,mBAAmB,OAAO,QAAQ,IAAI;AAAA,IAC/C;AACA,YAAQ,MAAM;AACd,YAAQ,aAAa;AACrB,YAAQ,SAAS;AACjB,YAAQ,OAAO;AACf,YAAQ,OAAO;AACf,YAAQ,OAAO;AACf,QAAI,UAAU,QAAW;AACrB,WAAK,OAAO,MAAM,oBAAoB,cAAc,kBAAkB,kCAAkC;AAAA,QACpG;AAAA,MAAA,CACH;AAAA,IACL,OAAO;AACH,YAAM,UAAU,KAAK,KAAK,IAAI,KAAK;AACnC,YAAM,MAAM,SAAS,KAAK,CAAC,UAAU,MAAM,QAAQ,SAAS,MAAM,CAAC,KAAK,UAAU,CAAC;AACnF,UAAI,QAAQ,QAAW;AACnB,aAAK,cAAc,IAAI,KAAK;AAC5B,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd,qCAAqC,KAAK;AAAA,UAC1C,EAAE,MAAM,SAAS,MAAA;AAAA,QAAM;AAAA,MAE/B,WAAW,CAAC,IAAI,WAAW,CAAC,IAAI,QAAQ,SAAS,MAAM,GAAG;AACtD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd,QAAQ,KAAK,qBAAqB,IAAI,QAAQ,KAAK,KAAK,CAAC,2BAA2B,MAAM;AAAA,UAC1F,EAAE,MAAM,SAAS,MAAA;AAAA,QAAM;AAAA,MAE/B,OAAO;AACH,gBAAQ,MAAM;AAAA,MAClB;AAAA,IACJ;AACA,SAAK,IAAI;AAAA,MAAK;AAAA;AAAA,IAAA;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,mBAAmB,OAAe,QAAgB,MAAoB;AAC1E,QAAI,SAA8C;AAClD,QAAI,WAAW,QAAQ;AACnB,eAAS,KAAK,MAAM,GAAG,EAAE,KAAK;AAAA,IAClC,WAAW,WAAW,QAAQ;AAC1B,eAAS,KAAK;AAAA,IAClB,OAAO;AACH,eAAS,KAAK;AAAA,IAClB;AACA,QAAI,WAAW,MAAM;AACjB;AAAA,IACJ;AACA,WAAO,6BAAa,IAAA;AACpB,QAAI,OAAO,KAAK,IAAI,KAAK,GAAG;AACxB,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,uBAAuB,KAAK,aAAa,MAAM;AAAA,QAC/C,EAAE,MAAM,SAAS,MAAA;AAAA,MAAM;AAAA,IAE/B;AACA,WAAO,KAAK,IAAI,KAAK;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,aAAa,MAAc,OAA0C;AACzE,UAAM,EAAE,YAAY;AACpB,QAAI,QAAQ,SAAS,MAAM;AACvB,cAAQ,OAAO,IAAI,eAAA;AACnB,UAAI,QAAQ,KAAK,SAAS,GAAG;AACzB,gBAAQ,KAAK,KAAK,QAAQ,IAAI;AAC9B,gBAAQ,OAAO;AAAA,MACnB;AAAA,IACJ;AACA,YAAQ,KAAK,MAAM,MAAM,KAAK;AAC9B,SAAK,IAAI;AAAA,MAAK;AAAA;AAAA,IAAA;AAAA,EAClB;AAAA;AAAA,EAGQ,aAAmB;AACvB,SAAK,QAAQ,MAAM,IAAA;AAAA,EACvB;AAAA;AAAA,EAGQ,gBAAsB;AAC1B,UAAM,EAAE,YAAY;AACpB,UAAM,MAAM,QAAQ;AACpB,QAAI,QAAQ,MAAM;AACd;AAAA,IACJ;AACA,QAAI,QAAQ,SAAS,MAAM;AACvB,UAAI,cAAc,QAAQ,KAAK,OAAA;AAAA,IACnC,OAAO;AACH,UAAI,cAAc,QAAQ;AAAA,IAC9B;AACA,YAAQ,OAAO;AACf,YAAQ,OAAO;AACf,YAAQ,aAAa;AAAA,EACzB;AAAA;AAAA,EAGQ,aAAmB;AACvB,UAAM,EAAE,YAAY;AACpB,UAAM,EAAE,QAAQ;AAChB,UAAM,QAAiB,QAAQ,SAAS,OAAO,QAAQ,OAAO,QAAQ,KAAK,OAAA;AAC3E,YAAQ,OAAO;AACf,YAAQ,OAAO;AACf,YAAQ,MAAM;AACd,QAAI,QAAQ,QAAQ,IAAI,SAAS;AAC7B;AAAA,IACJ;AACA,UAAM,QAAQ,EAAE,MAAM,QAAQ,MAAM,SAAS,IAAI,GAAA;AACjD,YAAQ,QAAQ,QAAA;AAAA,MACZ,KAAK,QAAQ;AACT,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,YAAI,IAAI,YAAY;AAChB,cAAI,OAAO,UAAU,YAAY,KAAK,UAAU,eAAe;AAC3D,iBAAK,OAAO;AAAA,cACR;AAAA,cACA,cAAc;AAAA,cACd,OAAO,UAAU,WACX,OAAO,qBAAqB,gHAC5B,OAAO,qBAAqB;AAAA,cAClC;AAAA,YAAA;AAEJ;AAAA,UACJ;AACA,eAAK,aAAa;AAClB;AAAA,QACJ;AACA,YAAI,IAAI,QAAQ;AACZ,qBAAW,CAAC,QAAQ,MAAM,KAAK,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,GAAG;AACrE,iBAAK,YAAY,MAAM,QAAQ,MAAM;AAAA,UACzC;AAAA,QACJ;AACA,YAAI,IAAI,SAAS,MAAM;AACnB;AAAA,QACJ;AACA,cAAM,SAAS,KAAK,WAAW,IAAI,MAAM,OAAO,KAAK;AACrD,YAAI,WAAW,QAAW;AACtB,eAAK,YAAY,MAAM,IAAI,KAAK,QAAQ,MAAM;AAAA,QAClD;AACA;AAAA,MACJ;AAAA,MACA,KAAK,QAAQ;AACT,cAAM,EAAE,SAAS;AACjB,YAAI,SAAS,MAAM;AACf;AAAA,QACJ;AACA,YAAI,IAAI,QAAQ;AACZ,cAAI,OAAO,UAAU,UAAU;AAC3B,iBAAK,OAAO;AAAA,cACR;AAAA,cACA,cAAc;AAAA,cACd;AAAA,cACA;AAAA,YAAA;AAEJ;AAAA,UACJ;AACA,cAAI,KAAK,cAAc,QAAQ,KAAK,cAAc,IAAI,IAAI;AACtD,iBAAK,OAAO;AAAA,cACR;AAAA,cACA,cAAc;AAAA,cACd,4CAA4C,KAAK,SAAS,UAAU,IAAI,EAAE;AAAA,cAC1E;AAAA,YAAA;AAAA,UAER;AACA,eAAK,YAAY,IAAI;AACrB,cAAI;AACA,iBAAK,SAAS,gBAAgB,OAAO,KAAK,MAAM;AAChD,iBAAK,cAAc,OAAO,KAAK,QAAQ,IAAI,MAAM,KAAK;AAAA,UAC1D,SAAS,KAAK;AACV,iBAAK,SAAS,IAAI;AAClB,iBAAK,OAAO,YAAY,KAAK,KAAK;AAAA,UACtC;AACA;AAAA,QACJ;AACA,YAAI,IAAI,QAAQ;AACZ,qBAAW,CAAC,QAAQ,MAAM,KAAK,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,GAAG;AACrE,iBAAK,QAAQ,KAAK,QAAQ,MAAM;AAAA,UACpC;AAAA,QACJ;AACA,YAAI,IAAI,SAAS,MAAM;AACnB;AAAA,QACJ;AACA,cAAM,SAAS,KAAK,WAAW,IAAI,MAAM,OAAO,KAAK;AACrD,YAAI,WAAW,QAAW;AACtB,eAAK,QAAQ,KAAK,IAAI,KAAK,QAAQ,MAAM;AAAA,QAC7C;AACA;AAAA,MACJ;AAAA,MACA,KAAK,SAAS;AACV,YAAI,IAAI,UAAU,MAAM;AACpB;AAAA,QACJ;AACA,cAAM,SAAS,KAAK,WAAW,IAAI,OAAO,OAAO,KAAK;AACtD,YAAI,WAAW,QAAW;AACtB,cAAI;AACA,iBAAK,KAAK,cAAc,IAAI,MAAM,MAAM,QAAQ,IAAI,MAAM,IAAI;AAAA,UAClE,SAAS,KAAK;AACV,iBAAK,OAAO,YAAY,KAAK,KAAK;AAAA,UACtC;AAAA,QACJ;AACA;AAAA,MACJ;AAAA,MACA,SAAS;AACL,cAAM,EAAE,WAAW;AACnB,cAAM,IAAI,iBAAiB,iBAAiB,uBAAuB,OAAO,MAAM,CAAC,IAAI,EAAE;AAAA,MAC3F;AAAA,IAAA;AAAA,EAER;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,YAAY,MAAiB,QAAsB,OAAsB;AAC7E,QAAI,KAAK,UAAU,eAAe;AAC9B,WAAK,QAAQ,KAAK,QAAQ,KAAK;AAAA,IACnC,WAAW,CAAC,KAAK,QAAQ;AACrB,WAAK,KAAK,aAAa,QAAQ,KAAK,OAAO,KAAK;AAAA,IACpD;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,SAAS,QAAyB,KAAe,MAAe,OAAyC;AAC7G,UAAM,MAAiC,CAAA;AACvC,UAAM,WAAqB,CAAA;AAC3B,UAAM,SAAS,eAAe,QAAQ,MAAM,QAAQ;AACpD,eAAW,SAAS,UAAU;AAC1B,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,YAAY,MAAM,IAAI,KAAK;AAAA,QAC3B;AAAA,QACA,GAAG,cAAc,YAAY,IAAI,MAAM,IAAI,KAAK;AAAA,MAAA;AAAA,IAExD;AACA,eAAW,CAAC,OAAO,KAAK,KAAK,QAAQ;AACjC,YAAM,KAAK,GAAG,MAAM,IAAI,KAAK;AAC7B,UAAI,SAAS,KAAK,gBAAgB,IAAI,EAAE;AACxC,UAAI,WAAW,QAAW;AACtB,YAAI;AACA,WAAC,EAAE,WAAW;AAAA,YACV,KAAK;AAAA,YACL;AAAA,YACA,aAAa,QAAQ,OAAO,IAAI,EAAE;AAAA,YAClC,KAAK;AAAA,YACL;AAAA,UAAA;AAAA,QAER,SAAS,KAAK;AACV,eAAK,OAAO,YAAY,KAAK,KAAK;AAClC;AAAA,QACJ;AACA,aAAK,gBAAgB,IAAI,IAAI,MAAM;AAAA,MACvC;AACA,UAAI,KAAK,CAAC,QAAQ,KAAK,CAAC;AAAA,IAC5B;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,WAAW,QAAsB,OAAgB,OAAuB;AAC5E,QAAI,OAAO,SAAS,MAAM;AACtB,UAAI,CAAC,KAAK,iBAAiB;AACvB,aAAK,kBAAkB;AACvB,aAAK,OAAO;AAAA,UACR,aAAa;AAAA,UACb;AAAA,UACA,OAAO;AAAA,QAAA;AAAA,MAEf;AACA,aAAO;AAAA,IACX;AACA,QAAI,OAAO,UAAU,YAAY,OAAO,KAAK,aAAa,IAAI;AAE1D,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,oCAAoC,OAAO,IAAI;AAAA,QAC/C,EAAE,MAAM,MAAM,MAAM,SAAS,OAAO,KAAA;AAAA,QACpC,GAAG,cAAc,eAAe,IAAI,OAAO,IAAI;AAAA,MAAA;AAEnD,YAAM,QAAkB,CAAA;AACxB,mBAAa,OAAO,IAAI,KAAK;AAC7B,aAAO,MAAM,KAAK,EAAE,EAAE,KAAA;AAAA,IAC1B;AACA,QAAI,OAAO,UAAU,UAAU;AAC3B,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,iBAAiB,OAAO,KAAK,QAAQ,eAAe,OAAO,IAAI;AAAA,QAC/D;AAAA,MAAA;AAEJ,aAAO;AAAA,IACX;AACA,UAAM,EAAE,SAAS;AACjB,QAAI,KAAK,SAAS,YAAY,aAAa,KAAK,GAAG;AAC/C,aAAO;AAAA,IACX;AACA,QAAI;AACA,YAAM,SAAS,mBAAmB,OAAO,MAAM,OAAO,UAAU;AAChE,UAAI,KAAK,aAAa,eAAe,MAAM,KAAK,GAAG;AAC/C,aAAK,OAAO;AAAA,UACR;AAAA,UACA;AAAA,UACA,mBAAmB,OAAO,IAAI;AAAA,UAC9B,EAAE,MAAM,MAAM,MAAM,SAAS,OAAO,KAAA;AAAA,QAAK;AAAA,MAEjD;AACA,WAAK,cAAc,OAAO,QAAQ,OAAO,MAAM,KAAK;AACpD,aAAO;AAAA,IACX,SAAS,KAAK;AACV,WAAK,OAAO,YAAY,KAAK,KAAK;AAClC,aAAO;AAAA,IACX;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,cAAcA,OAAc,OAAgB,QAAgB,OAAoB;AACpF,QAAI,OAAO,UAAU,YAAY,oBAAoBA,KAAI,GAAG;AACxD,WAAK,OAAO;AAAA,QACR;AAAA,QACA;AAAA,QACA,cAAc,MAAM,8BAA8BA,MAAK,MAAM;AAAA,QAC7D,EAAE,MAAM,MAAM,MAAM,SAAS,OAAA;AAAA,QAC7B,GAAG,cAAc,aAAa,MAAM;AAAA,MAAA;AAAA,IAE5C;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,UAAU,OAAoC,MAAoB;AACtE,SAAK,uBAAuB,QAAQ,OAAO,iBAAiB,IAAI;AAChE,UAAM,QAAQ,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAChD,UAAM;AACN,UAAM,QAAmB;AAAA,MACrB,IAAI;AAAA,MACJ,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,QAAQ,MAAM;AAAA,MACd,SAAS,CAAA;AAAA,MACT,YAAY;AAAA,MACZ,QAAQ;AAAA,MACR;AAAA,MACA,MAAM;AAAA,IAAA;AAEV,UAAM,SAAS,MAAM,IAAI,IAAI;AAC7B,QAAI,WAAW,UAAa,OAAO,WAAW,GAAG;AAC7C,WAAK,SAAS,KAAK;AACnB,WAAK,OAAO,MAAM,iBAAiB,cAAc,YAAY,wBAAwB,EAAE,MAAM;AAAA,IACjG,OAAO;AACH,UAAI;AACA,cAAM,KAAK,KAAK,QAAQ,KAAK,MAAM;AACnC,cAAM,SAAS;AACf,aAAK,YAAY,QAAQ,IAAI;AAAA,MACjC,SAAS,KAAK;AACV,aAAK,SAAS,KAAK;AACnB,aAAK,OAAO,YAAY,KAAK,EAAE,MAAM,SAAS,QAAQ;AAAA,MAC1D;AAAA,IACJ;AACA,SAAK,MAAM,KAAK,KAAK;AACrB,SAAK,IAAI;AAAA,MAAK;AAAA;AAAA,IAAA;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,gBAAgB,MAAuB;AAC3C,QAAI,KAAK,UAAU,iBAAiB,KAAK,QAAQ;AAC7C;AAAA,IACJ;AACA,UAAM,KAAoB,KAAK,cAAc,KAAK;AAClD,QAAI,OAAO,MAAM;AACb,WAAK,SAAS;AACd;AAAA,IACJ;AACA,QAAI,KAAK,eAAe,QAAQ,KAAK,WAAW,MAAM;AAClD,WAAK,SAAS,IAAI,KAAK,QAAQ,KAAK,UAAU;AAAA,IAClD;AACA,QAAI;AACA,YAAM,WAAW,KAAK,KAAK,QAAQ,EAAE;AACrC,YAAM,QAAQ,KAAK,KAAK,QAAQ,EAAE;AAClC,UAAI,aAAa,iBAAiB,KAAK,KAAK,IAAI,KAAK,GAAG;AACpD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd,SAAS,OAAO,EAAE,CAAC;AAAA,UACnB,EAAE,MAAM,KAAK,MAAM,SAAS,OAAO,EAAE,EAAA;AAAA,QAAE;AAAA,MAE/C,WAAW,aAAa,iBAAiB,KAAK,SAAS,IAAI,KAAK,GAAG;AAC/D,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd,SAAS,OAAO,EAAE,CAAC;AAAA,UACnB,EAAE,MAAM,KAAK,MAAM,SAAS,OAAO,EAAE,EAAA;AAAA,QAAE;AAAA,MAE/C,OAAO;AACH,aAAK,OAAO,OAAO;AAAA,MACvB;AACA,WAAK,SAAS,IAAI,KAAK;AACvB,WAAK,QAAQ;AACb,WAAK,WAAA;AACL,UAAI,KAAK,WAAW,eAAe;AAC/B,aAAK,KAAK,aAAa,KAAK,gBAAgB,OAAO,KAAK,MAAM;AAAA,MAClE;AACA,YAAM,EAAE,YAAY;AACpB,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;AACxC,aAAK,KAAK,aAAa,QAAQ,CAAC,GAAmB,OAAO,QAAQ,IAAI,CAAC,CAAC;AAAA,MAC5E;AACA,cAAQ,SAAS;AAAA,IACrB,SAAS,KAAK;AACV,WAAK,SAAS,IAAI;AAClB,WAAK,OAAO,YAAY,KAAK,EAAE,MAAM,KAAK,MAAM,SAAS,OAAO,EAAE,EAAA,CAAG;AAAA,IACzE;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,SAAS,MAAuB;AACpC,QAAI,CAAC,KAAK,QAAQ;AACd,WAAK,SAAS;AACd,WAAK,OAAO,OAAO;AAAA,IACvB;AAAA,EACJ;AAAA;AAAA,EAGQ,aAAmB;AACvB,UAAM,OAAO,KAAK,MAAM,IAAA;AACxB,QAAI,SAAS,QAAW;AACpB,WAAK,gBAAgB,IAAI;AAAA,IAC7B;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,eAA6B;AACjC,QAAI,KAAK,iBAAiB,eAAe;AACrC,WAAK,eAAe,KAAK,KAAK,kBAAkB;AAAA,QAC5C,MAAM;AAAA,QACN,OAAO;AAAA,QACP,MAAM;AAAA,QACN,UAAU;AAAA,QACV,UAAU;AAAA,QACV,QAAQ,EAAE,QAAQ,QAAQ,IAAI,MAAM,OAAO,MAAM,MAAM,SAAS,WAAW,KAAA;AAAA,MAAK,CACnF;AAAA,IACL;AACA,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,UAAU,OAAoC,MAAoB;AACtE,SAAK,uBAAuB,QAAQ,OAAO,iBAAiB,IAAI;AAChE,UAAM,QAAQ,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAChD,UAAM;AACN,UAAM,SAAS,MAAM,IAAI,IAAI;AAC7B,UAAM,aAAa,MAAM,IAAI,QAAQ;AACrC,UAAM,aAAa,MAAM,IAAI,QAAQ;AACrC,UAAM,OAAkB;AAAA,MACpB,QAAQ;AAAA,MACR,QAAQ;AAAA;AAAA,MAER,IAAI,WAAW,UAAa,OAAO,WAAW,IAAI,OAAO;AAAA,MACzD,MAAM,MAAM,WAAW,aAAa;AAAA,MACpC,YAAY,MAAM,IAAI,YAAY,KAAK;AAAA,MACvC,YAAY,MAAM,IAAI,YAAY,KAAK;AAAA,MACvC,QAAQ;AAAA,MACR,SAAS,CAAA;AAAA,MACT,QAAQ;AAAA,MACR;AAAA,MACA,MAAM;AAAA,MACN,WAAW;AAAA,MACX,YAAY,cAAc;AAAA,MAC1B,YAAY,cAAc;AAAA,IAAA;AAE9B,UAAM,QAAQ,EAAE,MAAM,SAAS,KAAK,GAAA;AACpC,QAAI,eAAe,UAAa,WAAW,WAAW,GAAG;AACrD,WAAK,SAAS,IAAI;AAClB,WAAK,OAAO,MAAM,iBAAiB,cAAc,kBAAkB,2BAA2B,KAAK;AAAA,IACvG;AACA,QAAI,eAAe,UAAa,WAAW,WAAW,GAAG;AACrD,WAAK,SAAS,IAAI;AAClB,WAAK,OAAO,MAAM,iBAAiB,cAAc,kBAAkB,2BAA2B,KAAK;AAAA,IACvG;AACA,QAAI,CAAC,KAAK,UAAU,eAAe,UAAa,eAAe,QAAW;AACtE,UAAI;AACA,aAAK,SAAS,KAAK,WAAW,YAAY,IAAI;AAC9C,aAAK,SAAS,KAAK,WAAW,YAAY,IAAI;AAAA,MAClD,SAAS,KAAK;AACV,aAAK,SAAS,IAAI;AAClB,aAAK,OAAO,YAAY,KAAK,KAAK;AAAA,MACtC;AAAA,IACJ;AACA,UAAM,eAAe,MAAM,IAAI,UAAU;AACzC,QAAI,iBAAiB,QAAW;AAE5B,UAAI,iBAAiB,UAAU,iBAAiB,KAAK;AACjD,aAAK,OAAO;AAAA,MAChB,WAAW,iBAAiB,WAAW,iBAAiB,KAAK;AACzD,aAAK,OAAO;AAAA,MAChB,OAAO;AACH,aAAK,SAAS,IAAI;AAClB,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd,aAAa,YAAY;AAAA,UACzB;AAAA,QAAA;AAAA,MAER;AAAA,IACJ;AACA,SAAK,OAAO;AACZ,SAAK,IAAI;AAAA,MAAK;AAAA;AAAA,IAAA;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAmB;AACvB,UAAM,EAAE,SAAS;AACjB,SAAK,OAAO;AACZ,QAAI,SAAS,MAAM;AACf;AAAA,IACJ;AACA,QAAI,KAAK,UAAU,KAAK,WAAW,QAAQ,KAAK,WAAW,MAAM;AAC7D,WAAK,SAAS,IAAI;AAClB;AAAA,IACJ;AACA,QACK,CAAC,KAAK,QAAQ,oBACV,KAAK,KAAK,QAAQ,KAAK,MAAM,MAAM,iBAChC,KAAK,KAAK,QAAQ,KAAK,MAAM,MAAM,kBAC1C,KAAK,OAAO,QAAQ,KAAK,gBAAgB,IAAI,KAAK,EAAE,GACvD;AAGE,UAAI,KAAK,OAAO,MAAM;AAClB,aAAK,gBAAgB,IAAI,KAAK,EAAE;AAAA,MACpC;AACA,WAAK,SAAS,KAAK,IAAI;AACvB;AAAA,IACJ;AACA,SAAK,QAAQ,IAAI;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,QAAQ,MAAuB;AACnC,QAAI,KAAK,WAAW,QAAQ,KAAK,WAAW,MAAM;AAC9C;AAAA,IACJ;AACA,UAAM,UAAU,KAAK,MAAM,GAAG,OAAO,KAAK,MAAM,CAAC,OAAO,OAAO,KAAK,MAAM,CAAC;AAC3E,UAAM,QAAQ,EAAE,MAAM,KAAK,MAAM,QAAA;AACjC,QAAI;AACA,UAAI,CAAC,KAAK,QAAQ,iBAAiB;AAC/B,aAAK,YAAY,KAAK,MAAM;AAC5B,aAAK,YAAY,KAAK,MAAM;AAAA,MAChC;AACA,WAAK,mBAAmB,KAAK,QAAQ,KAAK,YAAY,KAAK;AAC3D,WAAK,mBAAmB,KAAK,QAAQ,KAAK,YAAY,KAAK;AAC3D,UAAI,KAAK,OAAO,QAAQ,KAAK,QAAQ,IAAI,KAAK,EAAE,GAAG;AAC/C,cAAM,IAAI,iBAAiB,uBAAuB,YAAY,KAAK,EAAE,mBAAmB;AAAA,UACpF,IAAI,KAAK;AAAA,QAAA,CACZ;AAAA,MACL;AACA,YAAM,SAAS,KAAK,KAAK;AACzB,WAAK,eAAe,KAAK,QAAQ,KAAK,MAAM;AAC5C,YAAM,IAAI,KAAK,UAAU,QAAQ,KAAK,QAAQ,KAAK,QAAQ,KAAK,MAAM,KAAK,QAAQ,KAAK;AACxF,WAAK,OAAO,OAAO,SAAS,KAAK,KAAK,YAAY;AAClD,WAAK,WAAA;AACL,UAAI,KAAK,OAAO,MAAM;AAClB,aAAK,QAAQ,IAAI,KAAK,EAAE;AACxB,aAAK,KAAK,aAAa,KAAK,gBAAgB,GAAG,KAAK,EAAE;AAAA,MAC1D;AACA,UAAI,KAAK,eAAe,MAAM;AAC1B,aAAK,KAAK,aAAa,KAAK,WAAW,QAAQ,GAAG,GAAG,KAAK,UAAU;AACpE,aAAK,SAAS,KAAK,CAAC,KAAK,QAAQ,KAAK,UAAU,CAAC;AAAA,MACrD;AACA,UAAI,KAAK,eAAe,MAAM;AAC1B,aAAK,KAAK,aAAa,KAAK,WAAW,QAAQ,GAAG,GAAG,KAAK,UAAU;AACpE,aAAK,SAAS,KAAK,CAAC,KAAK,QAAQ,KAAK,UAAU,CAAC;AAAA,MACrD;AACA,YAAM,EAAE,YAAY;AACpB,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;AACxC,aAAK,KAAK,aAAa,QAAQ,CAAC,GAAmB,GAAG,QAAQ,IAAI,CAAC,CAAC;AAAA,MACxE;AAAA,IACJ,SAAS,KAAK;AACV,WAAK,SAAS,IAAI;AAClB,WAAK,OAAO,YAAY,KAAK,KAAK;AAAA,IACtC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,SAAS,MAAwC;AACrD,QAAI,CAAC,KAAK,QAAQ;AACd,WAAK,SAAS;AACd,WAAK,OAAO,OAAO;AAAA,IACvB;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,mBAAmB,IAAYA,OAAqB,OAAoB;AAC5E,QAAIA,UAAS,QAAQ,KAAK,SAAS,IAAIA,KAAI,KAAK,KAAK,KAAK,QAAQ,EAAE,MAAM,eAAe;AACrF,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,kBAAkBA,KAAI,0CAA0CA,KAAI;AAAA,QACpE;AAAA,MAAA;AAAA,IAER;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,YAAY,IAAkB;AAClC,QAAI,KAAK,KAAK,QAAQ,EAAE,MAAM,eAAe;AACzC,YAAM,IAAI,iBAAiB,kBAAkB,kBAAkB,OAAO,EAAE,CAAC,4BAA4B;AAAA,QACjG;AAAA,MAAA,CACH;AAAA,IACL;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,eAA6B;AACjC,QAAI,KAAK,iBAAiB,eAAe;AACrC,WAAK,eAAe,KAAK,KAAK,kBAAkB;AAAA,QAC5C,MAAM;AAAA,QACN,OAAO;AAAA,QACP,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,QAAQ,EAAE,QAAQ,QAAQ,IAAI,MAAM,OAAO,MAAM,MAAM,MAAM,WAAW,KAAA;AAAA,MAAK,CAChF;AAAA,IACL;AACA,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,WAAW,MAAyC;AACxD,QAAI,SAAS,UAAU;AACnB,UAAI,KAAK,qBAAqB,eAAe;AACzC,aAAK,mBAAmB,KAAK,KAAK,kBAAkB;AAAA,UAChD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,MAAM;AAAA,UACN,UAAU;AAAA,UACV,QAAQ,EAAE,QAAQ,QAAQ,IAAI,MAAM,OAAO,MAAM,MAAM,cAAc,WAAW,KAAA;AAAA,QAAK,CACxF;AAAA,MACL;AACA,aAAO,KAAK;AAAA,IAChB;AACA,QAAI,KAAK,qBAAqB,eAAe;AACzC,WAAK,mBAAmB,KAAK,KAAK,kBAAkB;AAAA,QAChD,MAAM;AAAA,QACN,OAAO;AAAA,QACP,MAAM;AAAA,QACN,UAAU;AAAA,QACV,QAAQ,EAAE,QAAQ,QAAQ,IAAI,MAAM,OAAO,MAAM,MAAM,cAAc,WAAW,KAAA;AAAA,MAAK,CACxF;AAAA,IACL;AACA,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,eAAe,OAAoC,MAAoB;AAC3E,SAAK,uBAAuB,aAAa,OAAO,sBAAsB,IAAI;AAC1E,UAAM,KAAK,MAAM,IAAI,IAAI,KAAK;AAC9B,UAAM,QAAQ,EAAE,MAAM,SAAS,GAAA;AAC/B,YAAQ,KAAK,QAAQ,YAAA;AAAA,MACjB,KAAK;AACD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA;AAAA,QAAA;AAEJ,cAAM,KAAK,OAAO,MAAM,qBAAqB,EAAE,MAAM,cAAc,WAAW;AAAA,MAClF,KAAK;AACD,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA;AAAA,QAAA;AAEJ,aAAK,OAAO,OAAO;AACnB,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ,KAAK;AAAA,MACL,KAAK;AACD,aAAK,YAAY,EAAE,IAAI,WAAW,CAAA,GAAI,QAAQ,OAAO,KAAA;AACrD,aAAK,IAAI;AAAA,UAAK;AAAA;AAAA,QAAA;AACd;AAAA,MACJ,SAAS;AACL,cAAM,SAAgB,KAAK,QAAQ;AACnC,cAAM,IAAI,iBAAiB,iBAAiB,6BAA6B,OAAO,MAAM,CAAC,IAAI;AAAA,UACvF,QAAQ;AAAA,QAAA,CACX;AAAA,MACL;AAAA,IAAA;AAAA,EAER;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,aAAa,OAAoC,MAAoB;AACzE,UAAM,EAAE,cAAc;AACtB,QAAI,cAAc,MAAM;AACpB;AAAA,IACJ;AACA,UAAM,QAAQ,EAAE,MAAM,SAAS,UAAU,GAAA;AACzC,UAAM,WAAW,MAAM,IAAI,MAAM;AACjC,UAAM,WAAW,MAAM,IAAI,MAAM,KAAK;AACtC,QAAI,aAAa,UAAa,SAAS,WAAW,GAAG;AACjD,WAAK,SAAS,SAAS;AACvB,WAAK,OAAO,MAAM,iBAAiB,cAAc,oBAAoB,6BAA6B,KAAK;AACvG;AAAA,IACJ;AACA,QAAI,aAAa,QAAQ,aAAa,SAAS,aAAa,SAAS;AACjE,WAAK,SAAS,SAAS;AACvB,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,kBAAkB,QAAQ;AAAA,QAC1B;AAAA,MAAA;AAEJ;AAAA,IACJ;AACA,QAAI;AACA,YAAM,OAAO,KAAK,WAAW,UAAU,IAAI;AAC3C,gBAAU,UAAU,KAAK,EAAE,MAAM,MAAM,UAAU;AAAA,IACrD,SAAS,KAAK;AACV,WAAK,SAAS,SAAS;AACvB,WAAK,OAAO,YAAY,KAAK,KAAK;AAAA,IACtC;AAAA,EACJ;AAAA;AAAA,EAGQ,kBAAwB;AAC5B,UAAM,EAAE,cAAc;AACtB,SAAK,YAAY;AACjB,QAAI,cAAc,MAAM;AACpB;AAAA,IACJ;AACA,QAAI,UAAU,QAAQ;AAClB;AAAA,IACJ;AACA,QAAI,UAAU,UAAU,WAAW,GAAG;AAClC,WAAK,SAAS,SAAS;AACvB,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd;AAAA,QACA,EAAE,MAAM,UAAU,MAAM,SAAS,UAAU,GAAA;AAAA,MAAG;AAElD;AAAA,IACJ;AACA,QACI,CAAC,KAAK,QAAQ,mBACd,UAAU,UAAU,KAAK,CAAC,aAAa,KAAK,KAAK,QAAQ,SAAS,IAAI,MAAM,aAAa,GAC3F;AACE,WAAK,SAAS,KAAK,SAAS;AAC5B;AAAA,IACJ;AACA,SAAK,gBAAgB,SAAS;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,gBAAgB,WAAiC;AACrD,UAAM,QAAQ,EAAE,MAAM,UAAU,MAAM,SAAS,UAAU,GAAA;AACzD,QAAI;AACA,iBAAW,YAAY,UAAU,WAAW;AACxC,YAAI,CAAC,KAAK,QAAQ,iBAAiB;AAC/B,eAAK,YAAY,SAAS,IAAI;AAAA,QAClC;AAAA,MACJ;AACA,iBAAW,QAAQ,IAAI,IAAI,UAAU,UAAU,IAAI,CAAC,aAAa,SAAS,IAAI,CAAC,GAAG;AAC9E,aAAK,eAAe,MAAM,IAAI;AAAA,MAClC;AACA,UAAI,KAAK,QAAQ,eAAe,QAAQ;AACpC,aAAK,WAAW,WAAW,KAAK;AAAA,MACpC,WAAW,KAAK,aAAa,WAAW,KAAK,MAAM,GAAG;AAClD,aAAK,SAAS,SAAS;AACvB,aAAK,OAAO;AAAA,UACR;AAAA,UACA,cAAc;AAAA,UACd;AAAA,UACA;AAAA,QAAA;AAAA,MAER;AAAA,IACJ,SAAS,KAAK;AACV,WAAK,SAAS,SAAS;AACvB,WAAK,OAAO,YAAY,KAAK,KAAK;AAAA,IACtC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,WAAW,WAA2B,OAAoB;AAC9D,SAAK;AACL,UAAM,SAAS,UAAU,MAAM,YAAY,KAAK,cAAc;AAC9D,QAAI,QAAQ;AACZ,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK,MAAM,eAAe,KAAK;AAC7D,cAAQ,GAAG,MAAM,IAAI,CAAC;AAAA,IAC1B;AACA,UAAM,MAAM,KAAK,KAAK,QAAQ,KAAK;AACnC,SAAK,SAAS,IAAI,GAAG;AACrB,SAAK,KAAK,IAAI,GAAG;AACjB,SAAK,OAAO,OAAO;AACnB,QAAI,KAAK,cAAc,eAAe;AAClC,WAAK,YAAY,KAAK,KAAK,kBAAkB;AAAA,QACzC,MAAM;AAAA,QACN,OAAO;AAAA,QACP,UAAU;AAAA,QACV,QAAQ,EAAE,QAAQ,QAAQ,IAAI,MAAM,OAAO,MAAM,MAAM,aAAa,WAAW,KAAA;AAAA,MAAK,CACvF;AAAA,IACL;AACA,SAAK,KAAK,aAAa,KAAK,WAAW,KAAK,IAAI;AAChD,eAAW,YAAY,UAAU,WAAW;AACxC,YAAM,SAAS,KAAK,KAAK;AACzB,cAAQ,SAAS,MAAA;AAAA,QACb,KAAK;AACD,eAAK,UAAU,QAAQ,SAAS,MAAM,OAAO,YAAY,QAAW,KAAK;AACzE;AAAA,QACJ,KAAK;AACD,eAAK,UAAU,QAAQ,OAAO,SAAS,MAAM,YAAY,QAAW,KAAK;AACzE;AAAA,QACJ,KAAK;AACD,eAAK,UAAU,QAAQ,SAAS,MAAM,OAAO,cAAc,QAAW,KAAK;AAC3E;AAAA,QACJ,SAAS;AACL,gBAAM,EAAE,SAAS;AACjB,gBAAM,IAAI,iBAAiB,iBAAiB,yBAAyB,OAAO,IAAI,CAAC,IAAI,EAAE;AAAA,QAC3F;AAAA,MAAA;AAEJ,WAAK,OAAO,OAAO,SAAS,KAAK,KAAK,YAAY;AAAA,IACtD;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,aAAa,WAA2B,OAAsB;AAClE,UAAM,EAAE,cAAc;AACtB,QAAI,QAAQ;AACZ,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACvC,eAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC3C,cAAM,IAAI,UAAU,CAAC;AACrB,cAAM,IAAI,UAAU,CAAC;AACrB,cAAM,SAAS,KAAK,KAAK;AACzB,YAAI,EAAE,SAAS,WAAW,EAAE,SAAS,SAAS;AAC1C,eAAK,UAAU,QAAQ,EAAE,MAAM,EAAE,MAAM,cAAc,QAAW,KAAK;AAAA,QACzE,WAAW,EAAE,SAAS,QAAQ,EAAE,SAAS,OAAO;AAC5C,eAAK,UAAU,QAAQ,EAAE,MAAM,EAAE,MAAM,YAAY,QAAW,KAAK;AAAA,QACvE,WAAW,EAAE,SAAS,SAAS,EAAE,SAAS,MAAM;AAC5C,eAAK,UAAU,QAAQ,EAAE,MAAM,EAAE,MAAM,YAAY,QAAW,KAAK;AAAA,QACvE,OAAO;AACH;AAAA,QACJ;AACA;AACA,aAAK,OAAO,OAAO,SAAS,KAAK,KAAK,YAAY;AAAA,MACtD;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,eAAe,QAAgB,QAAsB;AACzD,QAAI,CAAC,KAAK,QAAQ,iBAAiB;AAC/B;AAAA,IACJ;AACA,QAAI,UAAU;AACd,QAAI,KAAK,KAAK,QAAQ,MAAM,MAAM,eAAe;AAC7C;AAAA,IACJ;AACA,QAAI,WAAW,UAAU,KAAK,KAAK,QAAQ,MAAM,MAAM,eAAe;AAClE;AAAA,IACJ;AACA,SAAK,OAAO,OAAO,SAAS;AAAA,EAChC;AAAA;AAAA,EAGQ,aAAmB;AACvB,QAAI,EAAE,KAAK,sBAAsB,sBAAsB;AACnD,WAAK,qBAAqB;AAC1B,qBAAe,KAAK,QAAQ,MAAM;AAAA,IACtC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,WAAWA,OAAc,MAAsB;AACnD,UAAM,WAAW,KAAK,SAAS,IAAIA,KAAI;AACvC,QAAI,aAAa,QAAW;AACxB,aAAO;AAAA,IACX;AACA,UAAM,KAAK,KAAK,QAAQ,KAAKA,KAAI;AACjC,SAAK,YAAYA,OAAM,IAAI;AAC3B,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,YAAYA,OAAc,MAAoB;AAClD,UAAM,QAAQ,KAAK,QAAQ;AAC3B,QAAI,UAAU,MAAM;AAChB,WAAK,OAAO;AAAA,QACR;AAAA,QACA,cAAc;AAAA,QACd,OAAO,MAAM,IAAI,kBAAkB,MAAM,YAAY,QAAQ,MAAM,EAAE;AAAA,QACrE,EAAE,MAAM,SAASA,MAAA;AAAA,MAAK;AAAA,IAE9B;AAAA,EACJ;AACJ;AAOA,SAAS,KAAKA,OAAyC;AACnD,MAAIA,UAAS,UAAa,CAAC,QAAQ,KAAKA,KAAI,GAAG;AAC3C,WAAO;AAAA,EACX;AACA,QAAM,IAAI,OAAOA,KAAI;AACrB,SAAO,OAAO,cAAc,CAAC,IAAI,IAAI;AACzC;AAOA,SAAS,cAAc,SAA4D;AAC/E,QAAM,QAAQ,SAAS;AACvB,MAAI,UAAU,QAAW;AACrB,WAAO;AAAA,EACX;AACA,MAAI,OAAO,UAAU,YAAY,CAAC,aAAa,IAAI,KAAK,GAAG;AACvD,UAAM,IAAI,iBAAiB,iBAAiB,kBAAkB,KAAK,UAAU,KAAK,CAAC,4BAA4B;AAAA,MAC3G,QAAQ;AAAA,MACR,OAAO;AAAA,IAAA,CACV;AAAA,EACL;AACA,SAAO;AACX;AAQA,SAAS,aAAa,MAA0B;AAC5C,QAAMA,QAAO,aAAa,KAAK,SAAS,GAAG,WAAW,CAAC;AAEvD,MAAI,CAAC,eAAe,KAAKA,KAAI,GAAG;AAC5B,WAAO;AAAA,EACX;AAEA,QAAM,OAAOA,MAAK,OAAO,2BAA2B;AACpD,MAAI,QAAQ,GAAG;AACX,WAAOA,MAAK,SAAS,mBAAmB,IAAI,IAAI,IAAI;AAAA,EACxD;AACA,SAAO,4BAA4B,KAAKA,KAAI,IAAI,OAAO;AAC3D;AASA,eAAe,cACX,OACA,MACA,SACqB;AACrB,QAAM,SAAS,qBAAqB,SAAS,eAAe;AAC5D,QAAM,aAAa,cAAc,OAAO;AACxC,QAAM,SAAS,IAAI,oBAAoB,QAAQ,OAAO,UAAU;AAChE,oBAAkB,MAAM,SAAS,QAAQ,IAAI;AAC7C,sBAAoB,SAAS,QAAQ,YAAY;AACjD,QAAM,SAAS,IAAI,cAAc,MAAM,QAAQ,QAAQ,UAAU;AACjE,MAAI;AACA,UAAM;AAAA,MACF,WAAW,OAAO,QAAQ,EAAE,GAAG,QAAQ,kBAAkB,qBAAqB,KAAK,MAAM;AAAA,MACzF;AAAA,IAAA;AAAA,EAER,SAAS,KAAK;AACV,QAAI,eAAe,oBAAoB;AACnC,aAAO,KAAK,cAAc,aAAa,yCAAyC,EAAE,MAAM,IAAI,MAAM;AAAA,IACtG;AACA,QAAI,eAAe,gBAAgB;AAC/B,aAAO;AAAA,QACH,eAAe,kBAAkB,cAAc,cAAc,cAAc;AAAA,QAC3E,IAAI;AAAA,QACJ,EAAE,MAAM,IAAI,KAAA;AAAA,MAAK;AAAA,IAEzB;AACA,UAAM;AAAA,EACV;AACA,SAAO,OAAA;AACP,iBAAe,OAAO,MAAM;AAC5B,SAAO,OAAO,OAAA;AAClB;AAMO,MAAM,kBAAuD,OAAO,OAAO;AAAA,EAC9E,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,CAAC,QAAQ,CAAC;AAAA,EACjC,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,QAAQ;AACZ,CAAC;AAGD,MAAM,uCAAuB,IAAI;AAAA,EAC7B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC;AAOD,SAAS,sBAAsB,MAAsB;AACjD,MAAI,SAAS,OAAO;AAChB,WAAO;AAAA,EACX;AACA,SAAO,iBAAiB,IAAI,IAAI,IAC1B,YAAY,IAAI,qEAChB,YAAY,IAAI;AAC1B;"}