{"version":3,"file":"prosemirror-remark.cjs","sources":["../src/syntax-extensions/BlockquoteExtension.ts","../src/syntax-extensions/BoldExtension.ts","../src/syntax-extensions/BreakExtension.ts","../src/syntax-extensions/TextExtension.ts","../src/syntax-extensions/CodeBlockExtension.ts","../src/syntax-extensions/DefinitionExtension.ts","../src/syntax-extensions/ParagraphExtension.ts","../src/syntax-extensions/HeadingExtension.ts","../src/syntax-extensions/HorizontalRuleExtension.ts","../src/syntax-extensions/ImageExtension.ts","../src/syntax-extensions/ImageReferenceExtension.ts","../src/syntax-extensions/InlineCodeExtension.ts","../src/syntax-extensions/ItalicExtension.ts","../src/syntax-extensions/LinkExtension.ts","../src/syntax-extensions/LinkReferenceExtension.ts","../src/syntax-extensions/ListItemExtension.ts","../src/syntax-extensions/OrderedListExtension.ts","../src/syntax-extensions/RootExtension.ts","../src/syntax-extensions/UnorderedListExtension.ts","../src/MarkdownExtension.ts","../node_modules/ccount/index.js","../node_modules/devlop/lib/default.js","../node_modules/micromark-util-character/index.js","../node_modules/mdast-util-find-and-replace/node_modules/escape-string-regexp/index.js","../node_modules/unist-util-is/lib/index.js","../node_modules/unist-util-visit-parents/lib/color.js","../node_modules/unist-util-visit-parents/lib/index.js","../node_modules/mdast-util-find-and-replace/lib/index.js","../node_modules/mdast-util-gfm-autolink-literal/lib/index.js","../node_modules/micromark-extension-gfm-autolink-literal/lib/syntax.js","../src/utils/buildUnifiedExtension.ts","../src/syntax-extensions/ExtendedAutolinkExtension.ts","../node_modules/mdast-util-gfm-strikethrough/lib/index.js","../node_modules/micromark-util-chunked/index.js","../node_modules/micromark-util-classify-character/index.js","../node_modules/micromark-util-resolve-all/index.js","../node_modules/micromark-extension-gfm-strikethrough/lib/syntax.js","../src/syntax-extensions/StrikethroughExtension.ts","../node_modules/mdast-util-to-markdown/lib/handle/blockquote.js","../node_modules/mdast-util-to-markdown/lib/util/pattern-in-scope.js","../node_modules/mdast-util-to-markdown/lib/handle/break.js","../node_modules/longest-streak/index.js","../node_modules/mdast-util-to-markdown/lib/util/format-code-as-indented.js","../node_modules/mdast-util-to-markdown/lib/util/check-fence.js","../node_modules/mdast-util-to-markdown/lib/handle/code.js","../node_modules/mdast-util-to-markdown/lib/util/check-quote.js","../node_modules/mdast-util-to-markdown/lib/handle/definition.js","../node_modules/mdast-util-to-markdown/lib/util/check-emphasis.js","../node_modules/mdast-util-to-markdown/lib/util/encode-character-reference.js","../node_modules/mdast-util-to-markdown/lib/util/encode-info.js","../node_modules/mdast-util-to-markdown/lib/handle/emphasis.js","../node_modules/unist-util-visit/lib/index.js","../node_modules/mdast-util-to-string/lib/index.js","../node_modules/mdast-util-to-markdown/lib/util/format-heading-as-setext.js","../node_modules/mdast-util-to-markdown/lib/handle/heading.js","../node_modules/mdast-util-to-markdown/lib/handle/html.js","../node_modules/mdast-util-to-markdown/lib/handle/image.js","../node_modules/mdast-util-to-markdown/lib/handle/image-reference.js","../node_modules/mdast-util-to-markdown/lib/handle/inline-code.js","../node_modules/mdast-util-to-markdown/lib/util/format-link-as-autolink.js","../node_modules/mdast-util-to-markdown/lib/handle/link.js","../node_modules/mdast-util-to-markdown/lib/handle/link-reference.js","../node_modules/mdast-util-to-markdown/lib/util/check-bullet.js","../node_modules/mdast-util-to-markdown/lib/util/check-bullet-other.js","../node_modules/mdast-util-to-markdown/lib/util/check-bullet-ordered.js","../node_modules/mdast-util-to-markdown/lib/util/check-rule.js","../node_modules/mdast-util-to-markdown/lib/handle/list.js","../node_modules/mdast-util-to-markdown/lib/util/check-list-item-indent.js","../node_modules/mdast-util-to-markdown/lib/handle/list-item.js","../node_modules/mdast-util-to-markdown/lib/handle/paragraph.js","../node_modules/mdast-util-phrasing/lib/index.js","../node_modules/mdast-util-to-markdown/lib/handle/root.js","../node_modules/mdast-util-to-markdown/lib/util/check-strong.js","../node_modules/mdast-util-to-markdown/lib/handle/strong.js","../node_modules/mdast-util-to-markdown/lib/handle/text.js","../node_modules/mdast-util-to-markdown/lib/util/check-rule-repetition.js","../node_modules/mdast-util-to-markdown/lib/handle/thematic-break.js","../node_modules/mdast-util-to-markdown/lib/handle/index.js","../node_modules/mdast-util-gfm-task-list-item/lib/index.js","../node_modules/micromark-factory-space/index.js","../node_modules/micromark-extension-gfm-task-list-item/lib/syntax.js","../src/syntax-extensions/TaskListItemExtension.ts","../src/GFMExtension.ts"],"sourcesContent":["import type { BlockContent, Blockquote, DefinitionContent } from \"mdast\";\nimport type {\n DOMOutputSpec,\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Command } from \"prosemirror-state\";\n\nimport { wrapIn } from \"prosemirror-commands\";\nimport { type InputRule, wrappingInputRule } from \"prosemirror-inputrules\";\nimport { createProseMirrorNode, NodeExtension } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport class BlockquoteExtension extends NodeExtension
{\n public override proseMirrorInputRules(\n proseMirrorSchema: Schema,\n ): Array {\n return [\n wrappingInputRule(\n /^\\s{0,3}>\\s$/u,\n proseMirrorSchema.nodes[this.proseMirrorNodeName()],\n ),\n ];\n }\n\n public override proseMirrorKeymap(\n proseMirrorSchema: Schema,\n ): Record {\n return {\n \"Mod->\": wrapIn(proseMirrorSchema.nodes[this.proseMirrorNodeName()]),\n };\n }\n\n public override proseMirrorNodeName(): string {\n return \"blockquote\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n content: \"block+\",\n group: \"block\",\n parseDOM: [{ tag: \"blockquote\" }],\n toDOM(): DOMOutputSpec {\n return [\"blockquote\", 0];\n },\n };\n }\n\n public override proseMirrorNodeToUnistNodes(\n _node: ProseMirrorNode,\n convertedChildren: Array,\n ): Array
{\n return [\n {\n children: convertedChildren,\n type: this.unistNodeName(),\n },\n ];\n }\n\n public override unistNodeName(): \"blockquote\" {\n return \"blockquote\";\n }\n\n public override unistNodeToProseMirrorNodes(\n _node: Blockquote,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n convertedChildren,\n );\n }\n}\n","import type { Emphasis, Strong, Text } from \"mdast\";\nimport type { InputRule } from \"prosemirror-inputrules\";\nimport type {\n DOMOutputSpec,\n MarkSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Command } from \"prosemirror-state\";\n\nimport { toggleMark } from \"prosemirror-commands\";\nimport { MarkExtension, MarkInputRule } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport class BoldExtension extends MarkExtension {\n public override processConvertedUnistNode(\n convertedNode: Emphasis | Text,\n ): Strong {\n return { children: [convertedNode], type: this.unistNodeName() };\n }\n\n public override proseMirrorInputRules(\n proseMirrorSchema: Schema,\n ): Array {\n return [\n new MarkInputRule(\n /\\*\\*([^\\s](?:.*[^\\s])?)\\*\\*([\\s\\S])$/u,\n proseMirrorSchema.marks[this.proseMirrorMarkName()],\n ),\n new MarkInputRule(\n /__([^\\s](?:.*[^\\s])?)__([\\s\\S])$/u,\n proseMirrorSchema.marks[this.proseMirrorMarkName()],\n ),\n ];\n }\n\n public override proseMirrorKeymap(\n proseMirrorSchema: Schema,\n ): Record {\n const markType = proseMirrorSchema.marks[this.proseMirrorMarkName()];\n return {\n \"Mod-b\": toggleMark(markType),\n \"Mod-B\": toggleMark(markType),\n };\n }\n\n public override proseMirrorMarkName(): string {\n return \"strong\";\n }\n\n public override proseMirrorMarkSpec(): MarkSpec {\n return {\n parseDOM: [\n { tag: \"b\" },\n { tag: \"strong\" },\n {\n getAttrs: (value) => /^(bold(er)?|[5-9]\\d{2,})$/u.test(value) && null,\n style: \"font-weight\",\n },\n ],\n toDOM(): DOMOutputSpec {\n return [\"strong\", 0];\n },\n };\n }\n\n public override unistNodeName(): \"strong\" {\n return \"strong\";\n }\n\n public override unistNodeToProseMirrorNodes(\n _node: Strong,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return convertedChildren.map((child) =>\n child.mark(\n child.marks.concat([\n proseMirrorSchema.marks[this.proseMirrorMarkName()].create(),\n ]),\n ),\n );\n }\n}\n","import type { Break } from \"mdast\";\nimport type {\n DOMOutputSpec,\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Command } from \"prosemirror-state\";\n\nimport { chainCommands, exitCode } from \"prosemirror-commands\";\nimport { createProseMirrorNode, NodeExtension } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport class BreakExtension extends NodeExtension {\n public override proseMirrorKeymap(\n proseMirrorSchema: Schema,\n ): Record {\n const command = chainCommands(exitCode, (state, dispatch) => {\n if (dispatch) {\n dispatch(\n state.tr\n .replaceSelectionWith(\n proseMirrorSchema.nodes[this.proseMirrorNodeName()].create(),\n )\n .scrollIntoView(),\n );\n }\n return true;\n });\n\n const isMac =\n typeof navigator !== \"undefined\"\n ? /Mac|iP(hone|[oa]d)/u.test(navigator.platform) // eslint-disable-line @typescript-eslint/no-deprecated -- In the tested systems, it will be defined\n : false;\n\n return {\n \"Mod-Enter\": command,\n \"Shift-Enter\": command,\n ...(isMac && { \"Ctrl-Enter\": command }),\n };\n }\n\n public override proseMirrorNodeName(): string {\n return \"hard_break\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n group: \"inline\",\n inline: true,\n parseDOM: [{ tag: \"br\" }],\n selectable: false,\n toDOM(): DOMOutputSpec {\n return [\"br\"];\n },\n };\n }\n\n public override proseMirrorNodeToUnistNodes(): Array {\n return [{ type: this.unistNodeName() }];\n }\n\n public override unistNodeName(): \"break\" {\n return \"break\";\n }\n\n public override unistNodeToProseMirrorNodes(\n _node: Break,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n convertedChildren,\n );\n }\n}\n","import type { Text } from \"mdast\";\nimport type {\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\n\nimport { NodeExtension } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport class TextExtension extends NodeExtension {\n public override proseMirrorNodeName(): string {\n return \"text\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n group: \"inline\",\n };\n }\n\n public override proseMirrorNodeToUnistNodes(\n node: ProseMirrorNode,\n ): Array {\n return [{ type: this.unistNodeName(), value: node.text ?? \"\" }];\n }\n\n public override unistNodeName(): \"text\" {\n return \"text\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: Text,\n proseMirrorSchema: Schema,\n ): Array {\n return [proseMirrorSchema.text(node.value)];\n }\n}\n","import type { Code, Text } from \"mdast\";\nimport type {\n DOMOutputSpec,\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\n\nimport { setBlockType } from \"prosemirror-commands\";\nimport { type InputRule, textblockTypeInputRule } from \"prosemirror-inputrules\";\nimport {\n type Command,\n type EditorState,\n Selection,\n type Transaction,\n} from \"prosemirror-state\";\nimport {\n createProseMirrorNode,\n type Extension,\n NodeExtension,\n} from \"prosemirror-unified\";\n\nimport { TextExtension } from \"./TextExtension\";\n\n/**\n * @public\n */\nexport class CodeBlockExtension extends NodeExtension {\n private static liftOutOfCodeBlock() {\n return (\n state: EditorState,\n dispatch?: (tr: Transaction) => void,\n ): boolean => {\n const { $from, $to } = state.selection;\n if (\n // Mustn't be a complex selection\n !$from.sameParent($to) ||\n // Must be in a code block\n $from.parent.type.name !== \"code_block\" ||\n // Must be at the end of the code block\n $from.parentOffset !== $from.parent.content.size ||\n // There must already be a preceding empty line\n !$from.parent.textBetween(0, $from.parentOffset).endsWith(\"\\n\\n\")\n ) {\n return false;\n }\n if (dispatch) {\n const tr = state.tr;\n dispatch(\n tr\n // Delete the preceding empty line\n .deleteRange($from.pos - 2, $from.pos)\n // Insert empty paragraph\n .insert(\n $from.pos - 1,\n tr.doc.type.schema.nodes[\"paragraph\"].create(),\n )\n // Put the cursor into the empty paragraph\n .setSelection(Selection.near(tr.doc.resolve($from.pos), 1))\n .scrollIntoView(),\n );\n }\n return true;\n };\n }\n\n public override dependencies(): Array {\n return [new TextExtension()];\n }\n\n public override proseMirrorInputRules(\n proseMirrorSchema: Schema,\n ): Array {\n return [\n textblockTypeInputRule(\n /^\\s{0,3}```$/u,\n proseMirrorSchema.nodes[this.proseMirrorNodeName()],\n ),\n textblockTypeInputRule(\n /^\\s{4}$/u,\n proseMirrorSchema.nodes[this.proseMirrorNodeName()],\n ),\n ];\n }\n\n public override proseMirrorKeymap(\n proseMirrorSchema: Schema,\n ): Record {\n return {\n Enter: CodeBlockExtension.liftOutOfCodeBlock(),\n \"Shift-Mod-\\\\\": setBlockType(\n proseMirrorSchema.nodes[this.proseMirrorNodeName()],\n ),\n };\n }\n\n public override proseMirrorNodeName(): string {\n return \"code_block\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n code: true,\n content: \"text*\",\n defining: true,\n group: \"block\",\n marks: \"\",\n parseDOM: [{ preserveWhitespace: \"full\", tag: \"pre\" }],\n toDOM(): DOMOutputSpec {\n return [\"pre\", [\"code\", 0]];\n },\n };\n }\n\n public override proseMirrorNodeToUnistNodes(\n _node: ProseMirrorNode,\n convertedChildren: Array,\n ): Array {\n return [\n {\n type: this.unistNodeName(),\n value: convertedChildren.map((child) => child.value).join(\"\"),\n },\n ];\n }\n\n public override unistNodeName(): \"code\" {\n return \"code\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: Code,\n proseMirrorSchema: Schema,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n [proseMirrorSchema.text(node.value)],\n );\n }\n}\n","import type { Definition } from \"mdast\";\nimport type { Node as ProseMirrorNode, Schema } from \"prosemirror-model\";\n\nimport { NodeExtension } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport interface DefinitionExtensionContext {\n definitions: Record<\n string,\n { title: string | null | undefined; url: string }\n >;\n}\n\n/**\n * @public\n */\nexport class DefinitionExtension extends NodeExtension {\n public override proseMirrorNodeName(): null {\n return null;\n }\n\n public override proseMirrorNodeSpec(): null {\n return null;\n }\n\n public override proseMirrorNodeToUnistNodes(): Array {\n return [];\n }\n\n public override unistNodeName(): \"definition\" {\n return \"definition\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: Definition,\n _proseMirrorSchema: Schema,\n _convertedChildren: Array,\n context: Partial<{\n DefinitionExtension: DefinitionExtensionContext;\n }>,\n ): Array {\n context.DefinitionExtension ??= { definitions: {} };\n context.DefinitionExtension.definitions[node.identifier] = {\n title: node.title,\n url: node.url,\n };\n return [];\n }\n}\n","import type { Paragraph, PhrasingContent } from \"mdast\";\nimport type {\n DOMOutputSpec,\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\n\nimport { createProseMirrorNode, NodeExtension } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport class ParagraphExtension extends NodeExtension {\n public override proseMirrorNodeName(): string {\n return \"paragraph\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n content: \"inline*\",\n group: \"block\",\n parseDOM: [{ tag: \"p\" }],\n toDOM(): DOMOutputSpec {\n return [\"p\", 0];\n },\n };\n }\n\n public override proseMirrorNodeToUnistNodes(\n _node: ProseMirrorNode,\n convertedChildren: Array,\n ): Array {\n return [{ children: convertedChildren, type: this.unistNodeName() }];\n }\n\n public override unistNodeName(): \"paragraph\" {\n return \"paragraph\";\n }\n\n public override unistNodeToProseMirrorNodes(\n _node: Paragraph,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n convertedChildren,\n );\n }\n}\n","import type { Heading, PhrasingContent } from \"mdast\";\nimport type {\n DOMOutputSpec,\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Command, EditorState } from \"prosemirror-state\";\nimport type { EditorView } from \"prosemirror-view\";\n\nimport { setBlockType } from \"prosemirror-commands\";\nimport { type InputRule, textblockTypeInputRule } from \"prosemirror-inputrules\";\nimport {\n createProseMirrorNode,\n type Extension,\n NodeExtension,\n} from \"prosemirror-unified\";\n\nimport { ParagraphExtension } from \"./ParagraphExtension\";\nimport { TextExtension } from \"./TextExtension\";\n\n/**\n * @public\n */\nexport class HeadingExtension extends NodeExtension {\n private static headingLevelCommandBuilder(\n proseMirrorSchema: Schema,\n levelUpdate: -1 | 1,\n onlyAtStart: boolean,\n ): Command {\n return (state, dispatch, view) => {\n if (onlyAtStart && !HeadingExtension.isAtStart(state, view)) {\n return false;\n }\n\n const { $anchor } = state.selection;\n const headingNode = $anchor.parent;\n if (headingNode.type.name !== \"heading\") {\n return false;\n }\n\n const newHeadingLevel =\n (headingNode.attrs[\"level\"] as number) + levelUpdate;\n\n if (newHeadingLevel < 0 || newHeadingLevel > 6) {\n return false;\n }\n if (dispatch === undefined) {\n return true;\n }\n\n const headingPosition = $anchor.before($anchor.depth);\n\n if (newHeadingLevel > 0) {\n dispatch(\n state.tr.setNodeMarkup(headingPosition, undefined, {\n level: newHeadingLevel,\n }),\n );\n } else {\n dispatch(\n state.tr.setNodeMarkup(\n headingPosition,\n proseMirrorSchema.nodes[\"paragraph\"],\n ),\n );\n }\n return true;\n };\n }\n\n private static isAtStart(\n state: EditorState,\n view: EditorView | undefined,\n ): boolean {\n if (!state.selection.empty) {\n return false;\n }\n if (view !== undefined) {\n return view.endOfTextblock(\"backward\", state);\n }\n return state.selection.$anchor.parentOffset > 0;\n }\n\n public override dependencies(): Array {\n return [new ParagraphExtension(), new TextExtension()];\n }\n\n public override proseMirrorInputRules(\n proseMirrorSchema: Schema,\n ): Array {\n return [\n textblockTypeInputRule(\n /^\\s{0,3}(#{1,6})\\s$/u,\n proseMirrorSchema.nodes[this.proseMirrorNodeName()],\n (match) => ({ level: match[1].length }),\n ),\n ];\n }\n\n public override proseMirrorKeymap(\n proseMirrorSchema: Schema,\n ): Record {\n const keymap: Record = {\n \"#\": HeadingExtension.headingLevelCommandBuilder(\n proseMirrorSchema,\n 1,\n true,\n ),\n Backspace: HeadingExtension.headingLevelCommandBuilder(\n proseMirrorSchema,\n -1,\n true,\n ),\n \"Shift-Tab\": HeadingExtension.headingLevelCommandBuilder(\n proseMirrorSchema,\n -1,\n false,\n ),\n Tab: HeadingExtension.headingLevelCommandBuilder(\n proseMirrorSchema,\n 1,\n false,\n ),\n };\n\n for (let i = 1; i <= 6; i++) {\n keymap[`Shift-Mod-${i.toString()}`] = setBlockType(\n proseMirrorSchema.nodes[this.proseMirrorNodeName()],\n { level: i },\n );\n }\n return keymap;\n }\n\n public override proseMirrorNodeName(): string {\n return \"heading\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n attrs: { level: { default: 1 } },\n content: \"text*\",\n defining: true,\n group: \"block\",\n parseDOM: [\n { attrs: { level: 1 }, tag: \"h1\" },\n { attrs: { level: 2 }, tag: \"h2\" },\n { attrs: { level: 3 }, tag: \"h3\" },\n { attrs: { level: 4 }, tag: \"h4\" },\n { attrs: { level: 5 }, tag: \"h5\" },\n { attrs: { level: 6 }, tag: \"h6\" },\n ],\n toDOM(node: ProseMirrorNode): DOMOutputSpec {\n return [`h${(node.attrs[\"level\"] as number).toString()}`, 0];\n },\n };\n }\n\n public override proseMirrorNodeToUnistNodes(\n node: ProseMirrorNode,\n convertedChildren: Array,\n ): Array {\n return [\n {\n children: convertedChildren,\n depth: node.attrs[\"level\"] as 1 | 2 | 3 | 4 | 5 | 6,\n type: this.unistNodeName(),\n },\n ];\n }\n\n public override unistNodeName(): \"heading\" {\n return \"heading\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: Heading,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n convertedChildren,\n {\n level: node.depth,\n },\n );\n }\n}\n","import type { ThematicBreak } from \"mdast\";\nimport type {\n DOMOutputSpec,\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Command } from \"prosemirror-state\";\n\nimport { InputRule } from \"prosemirror-inputrules\";\nimport { createProseMirrorNode, NodeExtension } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport class HorizontalRuleExtension extends NodeExtension {\n public override proseMirrorInputRules(\n proseMirrorSchema: Schema,\n ): Array {\n return [\n new InputRule(/^\\s{0,3}(?:\\*\\*\\*|---|___)\\n$/u, (state, _, start, end) =>\n state.tr.replaceWith(\n start,\n end,\n createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n [],\n ),\n ),\n ),\n ];\n }\n\n public override proseMirrorKeymap(\n proseMirrorSchema: Schema,\n ): Record {\n return {\n \"Mod-_\": (state, dispatch): true => {\n if (dispatch) {\n dispatch(\n state.tr\n .replaceSelectionWith(\n proseMirrorSchema.nodes[this.proseMirrorNodeName()].create(),\n )\n .scrollIntoView(),\n );\n }\n return true;\n },\n };\n }\n\n public override proseMirrorNodeName(): string {\n return \"horizontal_rule\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n group: \"block\",\n parseDOM: [{ tag: \"hr\" }],\n toDOM(): DOMOutputSpec {\n return [\"div\", [\"hr\"]];\n },\n };\n }\n\n public override proseMirrorNodeToUnistNodes(): Array {\n return [\n {\n type: this.unistNodeName(),\n },\n ];\n }\n\n public override unistNodeName(): \"thematicBreak\" {\n return \"thematicBreak\";\n }\n\n public override unistNodeToProseMirrorNodes(\n _node: ThematicBreak,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n convertedChildren,\n );\n }\n}\n","import type { Image } from \"mdast\";\nimport type {\n DOMOutputSpec,\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\n\nimport {\n createProseMirrorNode,\n type Extension,\n NodeExtension,\n} from \"prosemirror-unified\";\n\nimport { ParagraphExtension } from \"./ParagraphExtension\";\n\n/**\n * @public\n */\nexport class ImageExtension extends NodeExtension {\n public override dependencies(): Array {\n return [new ParagraphExtension()];\n }\n\n public override proseMirrorNodeName(): string {\n return \"image\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n attrs: {\n alt: { default: null },\n src: {},\n title: { default: null },\n },\n draggable: true,\n group: \"inline\",\n inline: true,\n parseDOM: [\n {\n getAttrs(dom: Node | string): {\n alt: string | null;\n src: string | null;\n title: string | null;\n } {\n return {\n alt: (dom as HTMLElement).getAttribute(\"alt\"),\n src: (dom as HTMLElement).getAttribute(\"src\"),\n title: (dom as HTMLElement).getAttribute(\"title\"),\n };\n },\n tag: \"img[src]\",\n },\n ],\n toDOM(node: ProseMirrorNode): DOMOutputSpec {\n return [\"img\", node.attrs];\n },\n };\n }\n\n public override proseMirrorNodeToUnistNodes(\n node: ProseMirrorNode,\n ): Array {\n return [\n {\n type: this.unistNodeName(),\n url: node.attrs[\"src\"] as string,\n ...(node.attrs[\"alt\"] !== null && { alt: node.attrs[\"alt\"] as string }),\n ...(node.attrs[\"title\"] !== null && {\n title: node.attrs[\"title\"] as string,\n }),\n },\n ];\n }\n\n public override unistNodeName(): \"image\" {\n return \"image\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: Image,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n convertedChildren,\n {\n alt: node.alt,\n src: node.url,\n title: node.title,\n },\n );\n }\n}\n","import type { ImageReference } from \"mdast\";\nimport type { Node as ProseMirrorNode, Schema } from \"prosemirror-model\";\n\nimport { type Extension, NodeExtension } from \"prosemirror-unified\";\n\nimport {\n DefinitionExtension,\n type DefinitionExtensionContext,\n} from \"./DefinitionExtension\";\nimport { ImageExtension } from \"./ImageExtension\";\n\n/**\n * @public\n */\nexport interface ImageReferenceExtensionContext {\n proseMirrorNodes: Record;\n}\n\n/**\n * @public\n */\nexport class ImageReferenceExtension extends NodeExtension {\n public override dependencies(): Array {\n return [new DefinitionExtension(), new ImageExtension()];\n }\n\n public override postUnistToProseMirrorHook(\n context: Partial<{\n DefinitionExtension: DefinitionExtensionContext;\n ImageReferenceExtension: ImageReferenceExtensionContext;\n }>,\n ): void {\n if (\n context.ImageReferenceExtension === undefined ||\n context.DefinitionExtension === undefined\n ) {\n return;\n }\n for (const id in context.ImageReferenceExtension.proseMirrorNodes) {\n if (!(id in context.DefinitionExtension.definitions)) {\n continue;\n }\n const definition = context.DefinitionExtension.definitions[id];\n const attrs = context.ImageReferenceExtension.proseMirrorNodes[id]\n .attrs as Record<\n string,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Attrs can be any\n any\n >;\n attrs[\"src\"] = definition.url;\n if (definition.title !== undefined) {\n attrs[\"title\"] = definition.title;\n }\n }\n }\n\n public override proseMirrorNodeName(): null {\n return null;\n }\n\n public override proseMirrorNodeSpec(): null {\n return null;\n }\n\n public override proseMirrorNodeToUnistNodes(): Array {\n return [];\n }\n\n public override unistNodeName(): \"imageReference\" {\n return \"imageReference\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: ImageReference,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n context: Partial<{\n ImageReferenceExtension: ImageReferenceExtensionContext;\n }>,\n ): Array {\n const proseMirrorNode = proseMirrorSchema.nodes[\"image\"].createAndFill(\n { alt: node.alt, src: \"\", title: node.label },\n convertedChildren,\n );\n if (proseMirrorNode === null) {\n return [];\n }\n context.ImageReferenceExtension ??= { proseMirrorNodes: {} };\n context.ImageReferenceExtension.proseMirrorNodes[node.identifier] =\n proseMirrorNode;\n return [proseMirrorNode];\n }\n}\n","import type { InlineCode, Text } from \"mdast\";\nimport type { InputRule } from \"prosemirror-inputrules\";\nimport type {\n DOMOutputSpec,\n MarkSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Command } from \"prosemirror-state\";\n\nimport { toggleMark } from \"prosemirror-commands\";\nimport { MarkExtension, MarkInputRule } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport class InlineCodeExtension extends MarkExtension {\n public override processConvertedUnistNode(convertedNode: Text): InlineCode {\n return { type: this.unistNodeName(), value: convertedNode.value };\n }\n\n public override proseMirrorInputRules(\n proseMirrorSchema: Schema,\n ): Array {\n return [\n new MarkInputRule(\n /`([^\\s](?:.*[^\\s])?)`([\\s\\S])$/u,\n proseMirrorSchema.marks[this.proseMirrorMarkName()],\n ),\n ];\n }\n\n public override proseMirrorKeymap(\n proseMirrorSchema: Schema,\n ): Record {\n const markType = proseMirrorSchema.marks[this.proseMirrorMarkName()];\n return {\n \"Ctrl-`\": toggleMark(markType),\n };\n }\n\n public override proseMirrorMarkName(): string {\n return \"code\";\n }\n\n public override proseMirrorMarkSpec(): MarkSpec {\n return {\n inclusive: false,\n parseDOM: [{ tag: \"code\" }],\n toDOM(): DOMOutputSpec {\n return [\"code\", 0];\n },\n };\n }\n\n public override unistNodeName(): \"inlineCode\" {\n return \"inlineCode\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: InlineCode,\n proseMirrorSchema: Schema,\n ): Array {\n return [\n proseMirrorSchema\n .text(node.value)\n .mark([proseMirrorSchema.marks[this.proseMirrorMarkName()].create()]),\n ];\n }\n}\n","import type { Emphasis, Strong, Text } from \"mdast\";\nimport type { InputRule } from \"prosemirror-inputrules\";\nimport type {\n DOMOutputSpec,\n MarkSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Command } from \"prosemirror-state\";\n\nimport { toggleMark } from \"prosemirror-commands\";\nimport { MarkExtension, MarkInputRule } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport class ItalicExtension extends MarkExtension {\n public override processConvertedUnistNode(\n convertedNode: Strong | Text,\n ): Emphasis {\n return { children: [convertedNode], type: this.unistNodeName() };\n }\n\n public override proseMirrorInputRules(\n proseMirrorSchema: Schema,\n ): Array {\n return [\n new MarkInputRule(\n /(?,\n ): Record {\n const markType = proseMirrorSchema.marks[this.proseMirrorMarkName()];\n return {\n \"Mod-i\": toggleMark(markType),\n \"Mod-I\": toggleMark(markType),\n };\n }\n\n public override proseMirrorMarkName(): string {\n return \"em\";\n }\n\n public override proseMirrorMarkSpec(): MarkSpec {\n return {\n parseDOM: [\n { tag: \"i\" },\n { tag: \"em\" },\n {\n getAttrs: (value) => value === \"italic\" && null,\n style: \"font-style\",\n },\n ],\n toDOM(): DOMOutputSpec {\n return [\"em\", 0];\n },\n };\n }\n\n public override unistNodeName(): \"emphasis\" {\n return \"emphasis\";\n }\n\n public override unistNodeToProseMirrorNodes(\n _node: Emphasis,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return convertedChildren.map((child) =>\n child.mark(\n child.marks.concat([\n proseMirrorSchema.marks[this.proseMirrorMarkName()].create(),\n ]),\n ),\n );\n }\n}\n","import type { Link, Text } from \"mdast\";\nimport type {\n DOMOutputSpec,\n Mark,\n MarkSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\n\nimport { MarkExtension } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport class LinkExtension extends MarkExtension {\n public override processConvertedUnistNode(\n convertedNode: Text,\n originalMark: Mark,\n ): Link {\n return {\n type: this.unistNodeName(),\n url: originalMark.attrs[\"href\"] as string,\n ...(originalMark.attrs[\"title\"] !== null && {\n title: originalMark.attrs[\"title\"] as string,\n }),\n children: [convertedNode],\n };\n }\n\n public override proseMirrorMarkName(): string {\n return \"link\";\n }\n\n public override proseMirrorMarkSpec(): MarkSpec {\n return {\n attrs: { href: {}, title: { default: null } },\n inclusive: false,\n parseDOM: [\n {\n getAttrs(dom: Node | string): {\n href: string | null;\n title: string | null;\n } {\n return {\n href: (dom as HTMLElement).getAttribute(\"href\"),\n title: (dom as HTMLElement).getAttribute(\"title\"),\n };\n },\n tag: \"a[href]\",\n },\n ],\n toDOM(node: Mark): DOMOutputSpec {\n return [\"a\", node.attrs, 0];\n },\n };\n }\n\n public override unistNodeName(): \"link\" {\n return \"link\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: Link,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return convertedChildren.map((child) =>\n child.mark(\n child.marks.concat([\n proseMirrorSchema.marks[this.proseMirrorMarkName()].create({\n href: node.url,\n title: node.title,\n }),\n ]),\n ),\n );\n }\n}\n","import type { LinkReference } from \"mdast\";\nimport type { Mark, Node as ProseMirrorNode, Schema } from \"prosemirror-model\";\n\nimport { type Extension, MarkExtension } from \"prosemirror-unified\";\n\nimport {\n DefinitionExtension,\n type DefinitionExtensionContext,\n} from \"./DefinitionExtension\";\nimport { LinkExtension } from \"./LinkExtension\";\n\n/**\n * @public\n */\nexport interface LinkReferenceExtensionContext {\n marks: Record;\n}\n\n/**\n * @public\n */\nexport class LinkReferenceExtension extends MarkExtension {\n public override dependencies(): Array {\n return [new DefinitionExtension(), new LinkExtension()];\n }\n\n public override postUnistToProseMirrorHook(\n context: Partial<{\n DefinitionExtension: DefinitionExtensionContext;\n LinkReferenceExtension: LinkReferenceExtensionContext;\n }>,\n ): void {\n if (\n context.LinkReferenceExtension === undefined ||\n context.DefinitionExtension === undefined\n ) {\n return;\n }\n for (const id in context.LinkReferenceExtension.marks) {\n if (!(id in context.DefinitionExtension.definitions)) {\n continue;\n }\n const definition = context.DefinitionExtension.definitions[id];\n const attrs = context.LinkReferenceExtension.marks[id].attrs as Record<\n string,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any -- Attrs can be any\n any\n >;\n attrs[\"href\"] = definition.url;\n if (definition.title !== undefined) {\n attrs[\"title\"] = definition.title;\n }\n }\n }\n\n public override processConvertedUnistNode(\n convertedNode: LinkReference,\n ): LinkReference {\n return convertedNode;\n }\n\n public override proseMirrorMarkName(): null {\n return null;\n }\n\n public override proseMirrorMarkSpec(): null {\n return null;\n }\n\n public override unistNodeName(): \"linkReference\" {\n return \"linkReference\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: LinkReference,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n context: Partial<{\n LinkReferenceExtension: LinkReferenceExtensionContext;\n }>,\n ): Array {\n const mark = proseMirrorSchema.marks[\"link\"].create({\n href: null,\n title: null,\n });\n context.LinkReferenceExtension ??= { marks: {} };\n context.LinkReferenceExtension.marks[node.identifier] = mark;\n return convertedChildren.map((child) =>\n child.mark(child.marks.concat([mark])),\n );\n }\n}\n","import type { BlockContent, DefinitionContent, ListItem } from \"mdast\";\nimport type {\n DOMOutputSpec,\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Command } from \"prosemirror-state\";\nimport type { Node as UnistNode } from \"unist\";\n\nimport {\n liftListItem,\n sinkListItem,\n splitListItem,\n} from \"prosemirror-schema-list\";\nimport { createProseMirrorNode, NodeExtension } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport class ListItemExtension extends NodeExtension {\n public override proseMirrorKeymap(\n proseMirrorSchema: Schema,\n ): Record {\n const nodeType = proseMirrorSchema.nodes[this.proseMirrorNodeName()];\n return {\n Enter: splitListItem(nodeType),\n \"Shift-Tab\": liftListItem(nodeType),\n Tab: sinkListItem(nodeType),\n };\n }\n\n public override proseMirrorNodeName(): string {\n return \"regular_list_item\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n content: \"paragraph block*\",\n defining: true,\n group: \"list_item\",\n parseDOM: [{ tag: \"li\" }],\n toDOM(): DOMOutputSpec {\n return [\"li\", 0];\n },\n };\n }\n\n public override proseMirrorNodeToUnistNodes(\n _node: ProseMirrorNode,\n convertedChildren: Array,\n ): Array {\n return [\n {\n children: convertedChildren,\n type: this.unistNodeName(),\n },\n ];\n }\n\n public override unistNodeName(): \"listItem\" {\n return \"listItem\";\n }\n\n public override unistNodeToProseMirrorNodes(\n _node: ListItem,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n convertedChildren,\n );\n }\n\n public override unistToProseMirrorTest(node: UnistNode): boolean {\n return (\n node.type === this.unistNodeName() &&\n (!(\"checked\" in node) || typeof node.checked !== \"boolean\")\n );\n }\n}\n","import type { List, ListContent } from \"mdast\";\nimport type {\n DOMOutputSpec,\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Command } from \"prosemirror-state\";\nimport type { Node as UnistNode } from \"unist\";\n\nimport { type InputRule, wrappingInputRule } from \"prosemirror-inputrules\";\nimport { wrapInList } from \"prosemirror-schema-list\";\nimport {\n createProseMirrorNode,\n type Extension,\n NodeExtension,\n} from \"prosemirror-unified\";\n\nimport { ListItemExtension } from \"./ListItemExtension\";\n\n/**\n * @public\n */\nexport class OrderedListExtension extends NodeExtension {\n public override dependencies(): Array {\n return [new ListItemExtension()];\n }\n\n public override proseMirrorInputRules(\n proseMirrorSchema: Schema,\n ): Array {\n return [\n wrappingInputRule(\n /^\\s{0,3}(\\d+)\\.\\s$/u,\n proseMirrorSchema.nodes[this.proseMirrorNodeName()],\n (match) => ({ start: +match[1] }),\n (match, node) =>\n node.childCount + (node.attrs[\"start\"] as number) === +match[1],\n ),\n ];\n }\n\n public override proseMirrorKeymap(\n proseMirrorSchema: Schema,\n ): Record {\n return {\n \"Shift-Mod-9\": wrapInList(\n proseMirrorSchema.nodes[this.proseMirrorNodeName()],\n ),\n };\n }\n\n public override proseMirrorNodeName(): string {\n return \"ordered_list\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n attrs: { spread: { default: false }, start: { default: 1 } },\n content: \"list_item+\",\n group: \"block\",\n parseDOM: [\n {\n getAttrs(dom: Node | string): { spread: boolean; start: number } {\n const start = (dom as HTMLElement).getAttribute(\"start\");\n return {\n spread:\n (dom as HTMLElement).getAttribute(\"data-spread\") === \"true\",\n start: start !== null ? parseInt(start, 10) : 1,\n };\n },\n tag: \"ol\",\n },\n ],\n toDOM(node: ProseMirrorNode): DOMOutputSpec {\n return [\n \"ol\",\n {\n \"data-spread\": node.attrs[\"spread\"] as boolean,\n start: node.attrs[\"start\"] as number,\n },\n 0,\n ];\n },\n };\n }\n\n public override proseMirrorNodeToUnistNodes(\n node: ProseMirrorNode,\n convertedChildren: Array,\n ): Array {\n const spread = node.attrs[\"spread\"] as boolean;\n return [\n {\n children: convertedChildren.map((child) => {\n child.spread = spread;\n return child;\n }),\n ordered: true,\n spread,\n start: node.attrs[\"start\"] as number,\n type: this.unistNodeName(),\n },\n ];\n }\n\n public override unistNodeName(): \"list\" {\n return \"list\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: List,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n convertedChildren,\n {\n spread: node.spread,\n start: node.start ?? 1,\n },\n );\n }\n\n public override unistToProseMirrorTest(node: UnistNode): boolean {\n return (\n node.type === this.unistNodeName() && (node as List).ordered === true\n );\n }\n}\n","import type { Root, RootContent } from \"mdast\";\nimport type {\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\n\nimport { createProseMirrorNode, NodeExtension } from \"prosemirror-unified\";\n\n/**\n * @public\n */\nexport class RootExtension extends NodeExtension {\n public override proseMirrorNodeName(): string {\n return \"doc\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return { content: \"block+\" };\n }\n\n public override proseMirrorNodeToUnistNodes(\n _node: ProseMirrorNode,\n convertedChildren: Array,\n ): Array {\n return [{ children: convertedChildren, type: this.unistNodeName() }];\n }\n\n public override unistNodeName(): \"root\" {\n return \"root\";\n }\n\n public override unistNodeToProseMirrorNodes(\n _node: Root,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n convertedChildren,\n );\n }\n}\n","import type { List, ListContent } from \"mdast\";\nimport type {\n DOMOutputSpec,\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Command } from \"prosemirror-state\";\nimport type { Node as UnistNode } from \"unist\";\n\nimport { type InputRule, wrappingInputRule } from \"prosemirror-inputrules\";\nimport { wrapInList } from \"prosemirror-schema-list\";\nimport {\n createProseMirrorNode,\n type Extension,\n NodeExtension,\n} from \"prosemirror-unified\";\n\nimport { ListItemExtension } from \"./ListItemExtension\";\n\n/**\n * @public\n */\nexport class UnorderedListExtension extends NodeExtension {\n public override dependencies(): Array {\n return [new ListItemExtension()];\n }\n\n public override proseMirrorInputRules(\n proseMirrorSchema: Schema,\n ): Array {\n return [\n wrappingInputRule(\n /^\\s{0,3}([-+*])\\s$/u,\n proseMirrorSchema.nodes[this.proseMirrorNodeName()],\n ),\n ];\n }\n\n public override proseMirrorKeymap(\n proseMirrorSchema: Schema,\n ): Record {\n return {\n \"Shift-Mod-8\": wrapInList(\n proseMirrorSchema.nodes[this.proseMirrorNodeName()],\n ),\n };\n }\n\n public override proseMirrorNodeName(): string {\n return \"bullet_list\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n attrs: { spread: { default: false } },\n content: \"list_item+\",\n group: \"block\",\n parseDOM: [\n {\n getAttrs(dom: Node | string): { spread: boolean } {\n return {\n spread:\n (dom as HTMLElement).getAttribute(\"data-spread\") === \"true\",\n };\n },\n tag: \"ul\",\n },\n ],\n toDOM(node: ProseMirrorNode): DOMOutputSpec {\n return [\"ul\", { \"data-spread\": node.attrs[\"spread\"] as boolean }, 0];\n },\n };\n }\n\n public override proseMirrorNodeToUnistNodes(\n node: ProseMirrorNode,\n convertedChildren: Array,\n ): Array {\n const spread = node.attrs[\"spread\"] as boolean;\n return [\n {\n children: convertedChildren.map((child) => {\n child.spread = spread;\n return child;\n }),\n ordered: false,\n spread,\n type: this.unistNodeName(),\n },\n ];\n }\n\n public override unistNodeName(): \"list\" {\n return \"list\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: List,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n convertedChildren,\n {\n spread: node.spread,\n },\n );\n }\n\n public override unistToProseMirrorTest(node: UnistNode): boolean {\n return (\n node.type === this.unistNodeName() && (node as List).ordered !== true\n );\n }\n}\n","import type { Processor } from \"unified\";\nimport type { Node as UnistNode } from \"unist\";\n\nimport { Extension } from \"prosemirror-unified\";\nimport remarkParse from \"remark-parse\";\nimport remarkStringify from \"remark-stringify\";\n\nimport { BlockquoteExtension } from \"./syntax-extensions/BlockquoteExtension\";\nimport { BoldExtension } from \"./syntax-extensions/BoldExtension\";\nimport { BreakExtension } from \"./syntax-extensions/BreakExtension\";\nimport { CodeBlockExtension } from \"./syntax-extensions/CodeBlockExtension\";\nimport { DefinitionExtension } from \"./syntax-extensions/DefinitionExtension\";\nimport { HeadingExtension } from \"./syntax-extensions/HeadingExtension\";\nimport { HorizontalRuleExtension } from \"./syntax-extensions/HorizontalRuleExtension\";\nimport { ImageExtension } from \"./syntax-extensions/ImageExtension\";\nimport { ImageReferenceExtension } from \"./syntax-extensions/ImageReferenceExtension\";\nimport { InlineCodeExtension } from \"./syntax-extensions/InlineCodeExtension\";\nimport { ItalicExtension } from \"./syntax-extensions/ItalicExtension\";\nimport { LinkExtension } from \"./syntax-extensions/LinkExtension\";\nimport { LinkReferenceExtension } from \"./syntax-extensions/LinkReferenceExtension\";\nimport { ListItemExtension } from \"./syntax-extensions/ListItemExtension\";\nimport { OrderedListExtension } from \"./syntax-extensions/OrderedListExtension\";\nimport { ParagraphExtension } from \"./syntax-extensions/ParagraphExtension\";\nimport { RootExtension } from \"./syntax-extensions/RootExtension\";\nimport { TextExtension } from \"./syntax-extensions/TextExtension\";\nimport { UnorderedListExtension } from \"./syntax-extensions/UnorderedListExtension\";\n\n/**\n * @public\n */\nexport class MarkdownExtension extends Extension {\n public override dependencies(): Array {\n return [\n // ParagraphExtension needs to be first so that it is the default block.\n new ParagraphExtension(),\n new BlockquoteExtension(),\n new BoldExtension(),\n new BreakExtension(),\n new CodeBlockExtension(),\n new DefinitionExtension(),\n new HeadingExtension(),\n new HorizontalRuleExtension(),\n new ImageExtension(),\n new ImageReferenceExtension(),\n new InlineCodeExtension(),\n new ItalicExtension(),\n new LinkExtension(),\n new LinkReferenceExtension(),\n new ListItemExtension(),\n new OrderedListExtension(),\n new RootExtension(),\n new TextExtension(),\n new UnorderedListExtension(),\n ];\n }\n\n public override unifiedInitializationHook(\n processor: Processor,\n ): Processor {\n return processor.use(remarkParse).use(remarkStringify, {\n fences: true,\n listItemIndent: \"one\",\n resourceLink: true,\n rule: \"-\",\n }) as unknown as Processor<\n UnistNode,\n UnistNode,\n UnistNode,\n UnistNode,\n string\n >;\n }\n}\n","/**\n * Count how often a character (or substring) is used in a string.\n *\n * @param {string} value\n * Value to search in.\n * @param {string} character\n * Character (or substring) to look for.\n * @return {number}\n * Number of times `character` occurred in `value`.\n */\nexport function ccount(value, character) {\n const source = String(value)\n\n if (typeof character !== 'string') {\n throw new TypeError('Expected character')\n }\n\n let count = 0\n let index = source.indexOf(character)\n\n while (index !== -1) {\n count++\n index = source.indexOf(character, index + character.length)\n }\n\n return count\n}\n","export function deprecate(fn) {\n return fn\n}\n\nexport function equal() {}\n\nexport function ok() {}\n\nexport function unreachable() {}\n","/**\n * @import {Code} from 'micromark-util-types'\n */\n\n/**\n * Check whether the character code represents an ASCII alpha (`a` through `z`,\n * case insensitive).\n *\n * An **ASCII alpha** is an ASCII upper alpha or ASCII lower alpha.\n *\n * An **ASCII upper alpha** is a character in the inclusive range U+0041 (`A`)\n * to U+005A (`Z`).\n *\n * An **ASCII lower alpha** is a character in the inclusive range U+0061 (`a`)\n * to U+007A (`z`).\n *\n * @param code\n * Code.\n * @returns {boolean}\n * Whether it matches.\n */\nexport const asciiAlpha = regexCheck(/[A-Za-z]/);\n\n/**\n * Check whether the character code represents an ASCII alphanumeric (`a`\n * through `z`, case insensitive, or `0` through `9`).\n *\n * An **ASCII alphanumeric** is an ASCII digit (see `asciiDigit`) or ASCII alpha\n * (see `asciiAlpha`).\n *\n * @param code\n * Code.\n * @returns {boolean}\n * Whether it matches.\n */\nexport const asciiAlphanumeric = regexCheck(/[\\dA-Za-z]/);\n\n/**\n * Check whether the character code represents an ASCII atext.\n *\n * atext is an ASCII alphanumeric (see `asciiAlphanumeric`), or a character in\n * the inclusive ranges U+0023 NUMBER SIGN (`#`) to U+0027 APOSTROPHE (`'`),\n * U+002A ASTERISK (`*`), U+002B PLUS SIGN (`+`), U+002D DASH (`-`), U+002F\n * SLASH (`/`), U+003D EQUALS TO (`=`), U+003F QUESTION MARK (`?`), U+005E\n * CARET (`^`) to U+0060 GRAVE ACCENT (`` ` ``), or U+007B LEFT CURLY BRACE\n * (`{`) to U+007E TILDE (`~`).\n *\n * See:\n * **\\[RFC5322]**:\n * [Internet Message Format](https://tools.ietf.org/html/rfc5322).\n * P. Resnick.\n * IETF.\n *\n * @param code\n * Code.\n * @returns {boolean}\n * Whether it matches.\n */\nexport const asciiAtext = regexCheck(/[#-'*+\\--9=?A-Z^-~]/);\n\n/**\n * Check whether a character code is an ASCII control character.\n *\n * An **ASCII control** is a character in the inclusive range U+0000 NULL (NUL)\n * to U+001F (US), or U+007F (DEL).\n *\n * @param {Code} code\n * Code.\n * @returns {boolean}\n * Whether it matches.\n */\nexport function asciiControl(code) {\n return (\n // Special whitespace codes (which have negative values), C0 and Control\n // character DEL\n code !== null && (code < 32 || code === 127)\n );\n}\n\n/**\n * Check whether the character code represents an ASCII digit (`0` through `9`).\n *\n * An **ASCII digit** is a character in the inclusive range U+0030 (`0`) to\n * U+0039 (`9`).\n *\n * @param code\n * Code.\n * @returns {boolean}\n * Whether it matches.\n */\nexport const asciiDigit = regexCheck(/\\d/);\n\n/**\n * Check whether the character code represents an ASCII hex digit (`a` through\n * `f`, case insensitive, or `0` through `9`).\n *\n * An **ASCII hex digit** is an ASCII digit (see `asciiDigit`), ASCII upper hex\n * digit, or an ASCII lower hex digit.\n *\n * An **ASCII upper hex digit** is a character in the inclusive range U+0041\n * (`A`) to U+0046 (`F`).\n *\n * An **ASCII lower hex digit** is a character in the inclusive range U+0061\n * (`a`) to U+0066 (`f`).\n *\n * @param code\n * Code.\n * @returns {boolean}\n * Whether it matches.\n */\nexport const asciiHexDigit = regexCheck(/[\\dA-Fa-f]/);\n\n/**\n * Check whether the character code represents ASCII punctuation.\n *\n * An **ASCII punctuation** is a character in the inclusive ranges U+0021\n * EXCLAMATION MARK (`!`) to U+002F SLASH (`/`), U+003A COLON (`:`) to U+0040 AT\n * SIGN (`@`), U+005B LEFT SQUARE BRACKET (`[`) to U+0060 GRAVE ACCENT\n * (`` ` ``), or U+007B LEFT CURLY BRACE (`{`) to U+007E TILDE (`~`).\n *\n * @param code\n * Code.\n * @returns {boolean}\n * Whether it matches.\n */\nexport const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/);\n\n/**\n * Check whether a character code is a markdown line ending.\n *\n * A **markdown line ending** is the virtual characters M-0003 CARRIAGE RETURN\n * LINE FEED (CRLF), M-0004 LINE FEED (LF) and M-0005 CARRIAGE RETURN (CR).\n *\n * In micromark, the actual character U+000A LINE FEED (LF) and U+000D CARRIAGE\n * RETURN (CR) are replaced by these virtual characters depending on whether\n * they occurred together.\n *\n * @param {Code} code\n * Code.\n * @returns {boolean}\n * Whether it matches.\n */\nexport function markdownLineEnding(code) {\n return code !== null && code < -2;\n}\n\n/**\n * Check whether a character code is a markdown line ending (see\n * `markdownLineEnding`) or markdown space (see `markdownSpace`).\n *\n * @param {Code} code\n * Code.\n * @returns {boolean}\n * Whether it matches.\n */\nexport function markdownLineEndingOrSpace(code) {\n return code !== null && (code < 0 || code === 32);\n}\n\n/**\n * Check whether a character code is a markdown space.\n *\n * A **markdown space** is the concrete character U+0020 SPACE (SP) and the\n * virtual characters M-0001 VIRTUAL SPACE (VS) and M-0002 HORIZONTAL TAB (HT).\n *\n * In micromark, the actual character U+0009 CHARACTER TABULATION (HT) is\n * replaced by one M-0002 HORIZONTAL TAB (HT) and between 0 and 3 M-0001 VIRTUAL\n * SPACE (VS) characters, depending on the column at which the tab occurred.\n *\n * @param {Code} code\n * Code.\n * @returns {boolean}\n * Whether it matches.\n */\nexport function markdownSpace(code) {\n return code === -2 || code === -1 || code === 32;\n}\n\n// Size note: removing ASCII from the regex and using `asciiPunctuation` here\n// In fact adds to the bundle size.\n/**\n * Check whether the character code represents Unicode punctuation.\n *\n * A **Unicode punctuation** is a character in the Unicode `Pc` (Punctuation,\n * Connector), `Pd` (Punctuation, Dash), `Pe` (Punctuation, Close), `Pf`\n * (Punctuation, Final quote), `Pi` (Punctuation, Initial quote), `Po`\n * (Punctuation, Other), or `Ps` (Punctuation, Open) categories, or an ASCII\n * punctuation (see `asciiPunctuation`).\n *\n * See:\n * **\\[UNICODE]**:\n * [The Unicode Standard](https://www.unicode.org/versions/).\n * Unicode Consortium.\n *\n * @param code\n * Code.\n * @returns\n * Whether it matches.\n */\nexport const unicodePunctuation = regexCheck(/\\p{P}|\\p{S}/u);\n\n/**\n * Check whether the character code represents Unicode whitespace.\n *\n * Note that this does handle micromark specific markdown whitespace characters.\n * See `markdownLineEndingOrSpace` to check that.\n *\n * A **Unicode whitespace** is a character in the Unicode `Zs` (Separator,\n * Space) category, or U+0009 CHARACTER TABULATION (HT), U+000A LINE FEED (LF),\n * U+000C (FF), or U+000D CARRIAGE RETURN (CR) (**\\[UNICODE]**).\n *\n * See:\n * **\\[UNICODE]**:\n * [The Unicode Standard](https://www.unicode.org/versions/).\n * Unicode Consortium.\n *\n * @param code\n * Code.\n * @returns\n * Whether it matches.\n */\nexport const unicodeWhitespace = regexCheck(/\\s/);\n\n/**\n * Create a code check from a regex.\n *\n * @param {RegExp} regex\n * Expression.\n * @returns {(code: Code) => boolean}\n * Check.\n */\nfunction regexCheck(regex) {\n return check;\n\n /**\n * Check whether a code matches the bound regex.\n *\n * @param {Code} code\n * Character code.\n * @returns {boolean}\n * Whether the character code matches the bound regex.\n */\n function check(code) {\n return code !== null && code > -1 && regex.test(String.fromCharCode(code));\n }\n}","export default function escapeStringRegexp(string) {\n\tif (typeof string !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\t// Escape characters with special meaning either inside or outside character sets.\n\t// Use a simple backslash escape when it’s always valid, and a `\\xnn` escape when the simpler form would be disallowed by Unicode patterns’ stricter grammar.\n\treturn string\n\t\t.replace(/[|\\\\{}()[\\]^$+*?.]/g, '\\\\$&')\n\t\t.replace(/-/g, '\\\\x2d');\n}\n","/**\n * @import {Node, Parent} from 'unist'\n */\n\n/**\n * @template Fn\n * @template Fallback\n * @typedef {Fn extends (value: any) => value is infer Thing ? Thing : Fallback} Predicate\n */\n\n/**\n * @callback Check\n * Check that an arbitrary value is a node.\n * @param {unknown} this\n * The given context.\n * @param {unknown} [node]\n * Anything (typically a node).\n * @param {number | null | undefined} [index]\n * The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n * The node’s parent.\n * @returns {boolean}\n * Whether this is a node and passes a test.\n *\n * @typedef {Record | Node} Props\n * Object to check for equivalence.\n *\n * Note: `Node` is included as it is common but is not indexable.\n *\n * @typedef {Array | ReadonlyArray | Props | TestFunction | string | null | undefined} Test\n * Check for an arbitrary node.\n *\n * @callback TestFunction\n * Check if a node passes a test.\n * @param {unknown} this\n * The given context.\n * @param {Node} node\n * A node.\n * @param {number | undefined} [index]\n * The node’s position in its parent.\n * @param {Parent | undefined} [parent]\n * The node’s parent.\n * @returns {boolean | undefined | void}\n * Whether this node passes the test.\n *\n * Note: `void` is included until TS sees no return as `undefined`.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param {unknown} node\n * Thing to check, typically `Node`.\n * @param {Test} test\n * A check for a specific node.\n * @param {number | null | undefined} index\n * The node’s position in its parent.\n * @param {Parent | null | undefined} parent\n * The node’s parent.\n * @param {unknown} context\n * Context object (`this`) to pass to `test` functions.\n * @returns {boolean}\n * Whether `node` is a node and passes a test.\n */\nexport const is =\n // Note: overloads in JSDoc can’t yet use different `@template`s.\n /**\n * @type {(\n * (>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n * (>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n * ((node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n * ((node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n * ((node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate) &\n * ((node?: null | undefined) => false) &\n * ((node: unknown, test?: null | undefined, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n * ((node: unknown, test?: Test, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => boolean)\n * )}\n */\n (\n /**\n * @param {unknown} [node]\n * @param {Test} [test]\n * @param {number | null | undefined} [index]\n * @param {Parent | null | undefined} [parent]\n * @param {unknown} [context]\n * @returns {boolean}\n */\n // eslint-disable-next-line max-params\n function (node, test, index, parent, context) {\n const check = convert(test)\n\n if (\n index !== undefined &&\n index !== null &&\n (typeof index !== 'number' ||\n index < 0 ||\n index === Number.POSITIVE_INFINITY)\n ) {\n throw new Error('Expected positive finite index')\n }\n\n if (\n parent !== undefined &&\n parent !== null &&\n (!is(parent) || !parent.children)\n ) {\n throw new Error('Expected parent node')\n }\n\n if (\n (parent === undefined || parent === null) !==\n (index === undefined || index === null)\n ) {\n throw new Error('Expected both parent and index')\n }\n\n return looksLikeANode(node)\n ? check.call(context, node, index, parent)\n : false\n }\n )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param {Test} test\n * * when nullish, checks if `node` is a `Node`.\n * * when `string`, works like passing `(node) => node.type === test`.\n * * when `function` checks if function passed the node is true.\n * * when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n * * when `array`, checks if any one of the subtests pass.\n * @returns {Check}\n * An assertion.\n */\nexport const convert =\n // Note: overloads in JSDoc can’t yet use different `@template`s.\n /**\n * @type {(\n * ((test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n * ((test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n * ((test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate) &\n * ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n * ((test?: Test) => Check)\n * )}\n */\n (\n /**\n * @param {Test} [test]\n * @returns {Check}\n */\n function (test) {\n if (test === null || test === undefined) {\n return ok\n }\n\n if (typeof test === 'function') {\n return castFactory(test)\n }\n\n if (typeof test === 'object') {\n return Array.isArray(test)\n ? anyFactory(test)\n : // Cast because `ReadonlyArray` goes into the above but `isArray`\n // narrows to `Array`.\n propertiesFactory(/** @type {Props} */ (test))\n }\n\n if (typeof test === 'string') {\n return typeFactory(test)\n }\n\n throw new Error('Expected function, string, or object as test')\n }\n )\n\n/**\n * @param {Array} tests\n * @returns {Check}\n */\nfunction anyFactory(tests) {\n /** @type {Array} */\n const checks = []\n let index = -1\n\n while (++index < tests.length) {\n checks[index] = convert(tests[index])\n }\n\n return castFactory(any)\n\n /**\n * @this {unknown}\n * @type {TestFunction}\n */\n function any(...parameters) {\n let index = -1\n\n while (++index < checks.length) {\n if (checks[index].apply(this, parameters)) return true\n }\n\n return false\n }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {Check}\n */\nfunction propertiesFactory(check) {\n const checkAsRecord = /** @type {Record} */ (check)\n\n return castFactory(all)\n\n /**\n * @param {Node} node\n * @returns {boolean}\n */\n function all(node) {\n const nodeAsRecord = /** @type {Record} */ (\n /** @type {unknown} */ (node)\n )\n\n /** @type {string} */\n let key\n\n for (key in check) {\n if (nodeAsRecord[key] !== checkAsRecord[key]) return false\n }\n\n return true\n }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {Check}\n */\nfunction typeFactory(check) {\n return castFactory(type)\n\n /**\n * @param {Node} node\n */\n function type(node) {\n return node && node.type === check\n }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunction} testFunction\n * @returns {Check}\n */\nfunction castFactory(testFunction) {\n return check\n\n /**\n * @this {unknown}\n * @type {Check}\n */\n function check(value, index, parent) {\n return Boolean(\n looksLikeANode(value) &&\n testFunction.call(\n this,\n value,\n typeof index === 'number' ? index : undefined,\n parent || undefined\n )\n )\n }\n}\n\nfunction ok() {\n return true\n}\n\n/**\n * @param {unknown} value\n * @returns {value is Node}\n */\nfunction looksLikeANode(value) {\n return value !== null && typeof value === 'object' && 'type' in value\n}\n","/**\n * @param {string} d\n * @returns {string}\n */\nexport function color(d) {\n return d\n}\n","/**\n * @import {Node as UnistNode, Parent as UnistParent} from 'unist'\n */\n\n/**\n * @typedef {Exclude | undefined} Test\n * Test from `unist-util-is`.\n *\n * Note: we have remove and add `undefined`, because otherwise when generating\n * automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n * which doesn’t work when publishing on npm.\n */\n\n/**\n * @typedef {(\n * Fn extends (value: any) => value is infer Thing\n * ? Thing\n * : Fallback\n * )} Predicate\n * Get the value of a type guard `Fn`.\n * @template Fn\n * Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n * Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n * Check extends null | undefined // No test.\n * ? Value\n * : Value extends {type: Check} // String (type) test.\n * ? Value\n * : Value extends Check // Partial test.\n * ? Value\n * : Check extends Function // Function test.\n * ? Predicate extends Value\n * ? Predicate\n * : never\n * : never // Some other test?\n * )} MatchesOne\n * Check whether a node matches a primitive check in the type system.\n * @template Value\n * Value; typically unist `Node`.\n * @template Check\n * Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n * Check extends ReadonlyArray\n * ? MatchesOne\n * : Check extends Array\n * ? MatchesOne\n * : MatchesOne\n * )} Matches\n * Check whether a node matches a check in the type system.\n * @template Value\n * Value; typically unist `Node`.\n * @template Check\n * Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n * Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n * Increment a number in the type system.\n * @template {Uint} [I=0]\n * Index.\n */\n\n/**\n * @typedef {(\n * Node extends UnistParent\n * ? Node extends {children: Array}\n * ? Child extends Children ? Node : never\n * : never\n * : never\n * )} InternalParent\n * Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n * All node types in a tree.\n * @template {UnistNode} Child\n * Node to search for.\n */\n\n/**\n * @typedef {InternalParent, Child>} Parent\n * Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n * All node types in a tree.\n * @template {UnistNode} Child\n * Node to search for.\n */\n\n/**\n * @typedef {(\n * Depth extends Max\n * ? never\n * :\n * | InternalParent\n * | InternalAncestor, Max, Increment>\n * )} InternalAncestor\n * Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n * All node types in a tree.\n * @template {UnistNode} Child\n * Node to search for.\n * @template {Uint} [Max=10]\n * Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n * Current depth.\n */\n\n/**\n * @typedef {InternalAncestor, Child>} Ancestor\n * Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Tree\n * All node types in a tree.\n * @template {UnistNode} Child\n * Node to search for.\n */\n\n/**\n * @typedef {(\n * Tree extends UnistParent\n * ? Depth extends Max\n * ? Tree\n * : Tree | InclusiveDescendant>\n * : Tree\n * )} InclusiveDescendant\n * Collect all (inclusive) descendants of `Tree`.\n *\n * > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n * > recurse without actually running into an infinite loop, which the\n * > previous version did.\n * >\n * > Practically, a max of `2` is typically enough assuming a `Root` is\n * > passed, but it doesn’t improve performance.\n * > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n * > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n * Tree type.\n * @template {Uint} [Max=10]\n * Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n * Current depth.\n */\n\n/**\n * @typedef {'skip' | boolean} Action\n * Union of the action types.\n *\n * @typedef {number} Index\n * Move to the sibling at `index` next (after node itself is completely\n * traversed).\n *\n * Useful if mutating the tree, such as removing the node the visitor is\n * currently on, or any of its previous siblings.\n * Results less than 0 or greater than or equal to `children.length` stop\n * traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n * List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n * Any value that can be returned from a visitor.\n */\n\n/**\n * @callback Visitor\n * Handle a node (matching `test`, if given).\n *\n * Visitors are free to transform `node`.\n * They can also transform the parent of node (the last of `ancestors`).\n *\n * Replacing `node` itself, if `SKIP` is not returned, still causes its\n * descendants to be walked (which is a bug).\n *\n * When adding or removing previous siblings of `node` (or next siblings, in\n * case of reverse), the `Visitor` should return a new `Index` to specify the\n * sibling to traverse after `node` is traversed.\n * Adding or removing next siblings of `node` (or previous siblings, in case\n * of reverse) is handled as expected without needing to return a new `Index`.\n *\n * Removing the children property of an ancestor still results in them being\n * traversed.\n * @param {Visited} node\n * Found node.\n * @param {Array} ancestors\n * Ancestors of `node`.\n * @returns {VisitorResult}\n * What to do next.\n *\n * An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n * An `Action` is treated as a tuple of `[Action]`.\n *\n * Passing a tuple back only makes sense if the `Action` is `SKIP`.\n * When the `Action` is `EXIT`, that action can be returned.\n * When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n * Visited node type.\n * @template {UnistParent} [VisitedParents=UnistParent]\n * Ancestor type.\n */\n\n/**\n * @typedef {Visitor, Check>, Ancestor, Check>>>} BuildVisitor\n * Build a typed `Visitor` function from a tree and a test.\n *\n * It will infer which values are passed as `node` and which as `parents`.\n * @template {UnistNode} [Tree=UnistNode]\n * Tree type.\n * @template {Test} [Check=Test]\n * Test type.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from 'unist-util-visit-parents/do-not-use-color'\n\n/** @type {Readonly} */\nconst empty = []\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n * Tree to traverse.\n * @param {Visitor | Test} test\n * `unist-util-is`-compatible test\n * @param {Visitor | boolean | null | undefined} [visitor]\n * Handle each node.\n * @param {boolean | null | undefined} [reverse]\n * Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n * Nothing.\n *\n * @template {UnistNode} Tree\n * Node type.\n * @template {Test} Check\n * `unist-util-is`-compatible test.\n */\nexport function visitParents(tree, test, visitor, reverse) {\n /** @type {Test} */\n let check\n\n if (typeof test === 'function' && typeof visitor !== 'function') {\n reverse = visitor\n // @ts-expect-error no visitor given, so `visitor` is test.\n visitor = test\n } else {\n // @ts-expect-error visitor given, so `test` isn’t a visitor.\n check = test\n }\n\n const is = convert(check)\n const step = reverse ? -1 : 1\n\n factory(tree, undefined, [])()\n\n /**\n * @param {UnistNode} node\n * @param {number | undefined} index\n * @param {Array} parents\n */\n function factory(node, index, parents) {\n const value = /** @type {Record} */ (\n node && typeof node === 'object' ? node : {}\n )\n\n if (typeof value.type === 'string') {\n const name =\n // `hast`\n typeof value.tagName === 'string'\n ? value.tagName\n : // `xast`\n typeof value.name === 'string'\n ? value.name\n : undefined\n\n Object.defineProperty(visit, 'name', {\n value:\n 'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n })\n }\n\n return visit\n\n function visit() {\n /** @type {Readonly} */\n let result = empty\n /** @type {Readonly} */\n let subresult\n /** @type {number} */\n let offset\n /** @type {Array} */\n let grandparents\n\n if (!test || is(node, index, parents[parents.length - 1] || undefined)) {\n // @ts-expect-error: `visitor` is now a visitor.\n result = toResult(visitor(node, parents))\n\n if (result[0] === EXIT) {\n return result\n }\n }\n\n if ('children' in node && node.children) {\n const nodeAsParent = /** @type {UnistParent} */ (node)\n\n if (nodeAsParent.children && result[0] !== SKIP) {\n offset = (reverse ? nodeAsParent.children.length : -1) + step\n grandparents = parents.concat(nodeAsParent)\n\n while (offset > -1 && offset < nodeAsParent.children.length) {\n const child = nodeAsParent.children[offset]\n\n subresult = factory(child, offset, grandparents)()\n\n if (subresult[0] === EXIT) {\n return subresult\n }\n\n offset =\n typeof subresult[1] === 'number' ? subresult[1] : offset + step\n }\n }\n }\n\n return result\n }\n }\n}\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n * Valid return values from visitors.\n * @returns {Readonly}\n * Clean result.\n */\nfunction toResult(value) {\n if (Array.isArray(value)) {\n return value\n }\n\n if (typeof value === 'number') {\n return [CONTINUE, value]\n }\n\n return value === null || value === undefined ? empty : [value]\n}\n","/**\n * @import {Nodes, Parents, PhrasingContent, Root, Text} from 'mdast'\n * @import {BuildVisitor, Test, VisitorResult} from 'unist-util-visit-parents'\n */\n\n/**\n * @typedef RegExpMatchObject\n * Info on the match.\n * @property {number} index\n * The index of the search at which the result was found.\n * @property {string} input\n * A copy of the search string in the text node.\n * @property {[...Array, Text]} stack\n * All ancestors of the text node, where the last node is the text itself.\n *\n * @typedef {RegExp | string} Find\n * Pattern to find.\n *\n * Strings are escaped and then turned into global expressions.\n *\n * @typedef {Array} FindAndReplaceList\n * Several find and replaces, in array form.\n *\n * @typedef {[Find, Replace?]} FindAndReplaceTuple\n * Find and replace in tuple form.\n *\n * @typedef {ReplaceFunction | string | null | undefined} Replace\n * Thing to replace with.\n *\n * @callback ReplaceFunction\n * Callback called when a search matches.\n * @param {...any} parameters\n * The parameters are the result of corresponding search expression:\n *\n * * `value` (`string`) — whole match\n * * `...capture` (`Array`) — matches from regex capture groups\n * * `match` (`RegExpMatchObject`) — info on the match\n * @returns {Array | PhrasingContent | string | false | null | undefined}\n * Thing to replace with.\n *\n * * when `null`, `undefined`, `''`, remove the match\n * * …or when `false`, do not replace at all\n * * …or when `string`, replace with a text node of that value\n * * …or when `Node` or `Array`, replace with those nodes\n *\n * @typedef {[RegExp, ReplaceFunction]} Pair\n * Normalized find and replace.\n *\n * @typedef {Array} Pairs\n * All find and replaced.\n *\n * @typedef Options\n * Configuration.\n * @property {Test | null | undefined} [ignore]\n * Test for which nodes to ignore (optional).\n */\n\nimport escape from 'escape-string-regexp'\nimport {visitParents} from 'unist-util-visit-parents'\nimport {convert} from 'unist-util-is'\n\n/**\n * Find patterns in a tree and replace them.\n *\n * The algorithm searches the tree in *preorder* for complete values in `Text`\n * nodes.\n * Partial matches are not supported.\n *\n * @param {Nodes} tree\n * Tree to change.\n * @param {FindAndReplaceList | FindAndReplaceTuple} list\n * Patterns to find.\n * @param {Options | null | undefined} [options]\n * Configuration (when `find` is not `Find`).\n * @returns {undefined}\n * Nothing.\n */\nexport function findAndReplace(tree, list, options) {\n const settings = options || {}\n const ignored = convert(settings.ignore || [])\n const pairs = toPairs(list)\n let pairIndex = -1\n\n while (++pairIndex < pairs.length) {\n visitParents(tree, 'text', visitor)\n }\n\n /** @type {BuildVisitor} */\n function visitor(node, parents) {\n let index = -1\n /** @type {Parents | undefined} */\n let grandparent\n\n while (++index < parents.length) {\n const parent = parents[index]\n /** @type {Array | undefined} */\n const siblings = grandparent ? grandparent.children : undefined\n\n if (\n ignored(\n parent,\n siblings ? siblings.indexOf(parent) : undefined,\n grandparent\n )\n ) {\n return\n }\n\n grandparent = parent\n }\n\n if (grandparent) {\n return handler(node, parents)\n }\n }\n\n /**\n * Handle a text node which is not in an ignored parent.\n *\n * @param {Text} node\n * Text node.\n * @param {Array} parents\n * Parents.\n * @returns {VisitorResult}\n * Result.\n */\n function handler(node, parents) {\n const parent = parents[parents.length - 1]\n const find = pairs[pairIndex][0]\n const replace = pairs[pairIndex][1]\n let start = 0\n /** @type {Array} */\n const siblings = parent.children\n const index = siblings.indexOf(node)\n let change = false\n /** @type {Array} */\n let nodes = []\n\n find.lastIndex = 0\n\n let match = find.exec(node.value)\n\n while (match) {\n const position = match.index\n /** @type {RegExpMatchObject} */\n const matchObject = {\n index: match.index,\n input: match.input,\n stack: [...parents, node]\n }\n let value = replace(...match, matchObject)\n\n if (typeof value === 'string') {\n value = value.length > 0 ? {type: 'text', value} : undefined\n }\n\n // It wasn’t a match after all.\n if (value === false) {\n // False acts as if there was no match.\n // So we need to reset `lastIndex`, which currently being at the end of\n // the current match, to the beginning.\n find.lastIndex = position + 1\n } else {\n if (start !== position) {\n nodes.push({\n type: 'text',\n value: node.value.slice(start, position)\n })\n }\n\n if (Array.isArray(value)) {\n nodes.push(...value)\n } else if (value) {\n nodes.push(value)\n }\n\n start = position + match[0].length\n change = true\n }\n\n if (!find.global) {\n break\n }\n\n match = find.exec(node.value)\n }\n\n if (change) {\n if (start < node.value.length) {\n nodes.push({type: 'text', value: node.value.slice(start)})\n }\n\n parent.children.splice(index, 1, ...nodes)\n } else {\n nodes = [node]\n }\n\n return index + nodes.length\n }\n}\n\n/**\n * Turn a tuple or a list of tuples into pairs.\n *\n * @param {FindAndReplaceList | FindAndReplaceTuple} tupleOrList\n * Schema.\n * @returns {Pairs}\n * Clean pairs.\n */\nfunction toPairs(tupleOrList) {\n /** @type {Pairs} */\n const result = []\n\n if (!Array.isArray(tupleOrList)) {\n throw new TypeError('Expected find and replace tuple or list of tuples')\n }\n\n /** @type {FindAndReplaceList} */\n // @ts-expect-error: correct.\n const list =\n !tupleOrList[0] || Array.isArray(tupleOrList[0])\n ? tupleOrList\n : [tupleOrList]\n\n let index = -1\n\n while (++index < list.length) {\n const tuple = list[index]\n result.push([toExpression(tuple[0]), toFunction(tuple[1])])\n }\n\n return result\n}\n\n/**\n * Turn a find into an expression.\n *\n * @param {Find} find\n * Find.\n * @returns {RegExp}\n * Expression.\n */\nfunction toExpression(find) {\n return typeof find === 'string' ? new RegExp(escape(find), 'g') : find\n}\n\n/**\n * Turn a replace into a function.\n *\n * @param {Replace} replace\n * Replace.\n * @returns {ReplaceFunction}\n * Function.\n */\nfunction toFunction(replace) {\n return typeof replace === 'function'\n ? replace\n : function () {\n return replace\n }\n}\n","/**\n * @import {RegExpMatchObject, ReplaceFunction} from 'mdast-util-find-and-replace'\n * @import {CompileContext, Extension as FromMarkdownExtension, Handle as FromMarkdownHandle, Transform as FromMarkdownTransform} from 'mdast-util-from-markdown'\n * @import {ConstructName, Options as ToMarkdownExtension} from 'mdast-util-to-markdown'\n * @import {Link, PhrasingContent} from 'mdast'\n */\n\nimport {ccount} from 'ccount'\nimport {ok as assert} from 'devlop'\nimport {unicodePunctuation, unicodeWhitespace} from 'micromark-util-character'\nimport {findAndReplace} from 'mdast-util-find-and-replace'\n\n/** @type {ConstructName} */\nconst inConstruct = 'phrasing'\n/** @type {Array} */\nconst notInConstruct = ['autolink', 'link', 'image', 'label']\n\n/**\n * Create an extension for `mdast-util-from-markdown` to enable GFM autolink\n * literals in markdown.\n *\n * @returns {FromMarkdownExtension}\n * Extension for `mdast-util-to-markdown` to enable GFM autolink literals.\n */\nexport function gfmAutolinkLiteralFromMarkdown() {\n return {\n transforms: [transformGfmAutolinkLiterals],\n enter: {\n literalAutolink: enterLiteralAutolink,\n literalAutolinkEmail: enterLiteralAutolinkValue,\n literalAutolinkHttp: enterLiteralAutolinkValue,\n literalAutolinkWww: enterLiteralAutolinkValue\n },\n exit: {\n literalAutolink: exitLiteralAutolink,\n literalAutolinkEmail: exitLiteralAutolinkEmail,\n literalAutolinkHttp: exitLiteralAutolinkHttp,\n literalAutolinkWww: exitLiteralAutolinkWww\n }\n }\n}\n\n/**\n * Create an extension for `mdast-util-to-markdown` to enable GFM autolink\n * literals in markdown.\n *\n * @returns {ToMarkdownExtension}\n * Extension for `mdast-util-to-markdown` to enable GFM autolink literals.\n */\nexport function gfmAutolinkLiteralToMarkdown() {\n return {\n unsafe: [\n {\n character: '@',\n before: '[+\\\\-.\\\\w]',\n after: '[\\\\-.\\\\w]',\n inConstruct,\n notInConstruct\n },\n {\n character: '.',\n before: '[Ww]',\n after: '[\\\\-.\\\\w]',\n inConstruct,\n notInConstruct\n },\n {\n character: ':',\n before: '[ps]',\n after: '\\\\/',\n inConstruct,\n notInConstruct\n }\n ]\n }\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction enterLiteralAutolink(token) {\n this.enter({type: 'link', title: null, url: '', children: []}, token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction enterLiteralAutolinkValue(token) {\n this.config.enter.autolinkProtocol.call(this, token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitLiteralAutolinkHttp(token) {\n this.config.exit.autolinkProtocol.call(this, token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitLiteralAutolinkWww(token) {\n this.config.exit.data.call(this, token)\n const node = this.stack[this.stack.length - 1]\n assert(node.type === 'link')\n node.url = 'http://' + this.sliceSerialize(token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitLiteralAutolinkEmail(token) {\n this.config.exit.autolinkEmail.call(this, token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitLiteralAutolink(token) {\n this.exit(token)\n}\n\n/** @type {FromMarkdownTransform} */\nfunction transformGfmAutolinkLiterals(tree) {\n findAndReplace(\n tree,\n [\n [/(https?:\\/\\/|www(?=\\.))([-.\\w]+)([^ \\t\\r\\n]*)/gi, findUrl],\n [/(?<=^|\\s|\\p{P}|\\p{S})([-.\\w+]+)@([-\\w]+(?:\\.[-\\w]+)+)/gu, findEmail]\n ],\n {ignore: ['link', 'linkReference']}\n )\n}\n\n/**\n * @type {ReplaceFunction}\n * @param {string} _\n * @param {string} protocol\n * @param {string} domain\n * @param {string} path\n * @param {RegExpMatchObject} match\n * @returns {Array | Link | false}\n */\n// eslint-disable-next-line max-params\nfunction findUrl(_, protocol, domain, path, match) {\n let prefix = ''\n\n // Not an expected previous character.\n if (!previous(match)) {\n return false\n }\n\n // Treat `www` as part of the domain.\n if (/^w/i.test(protocol)) {\n domain = protocol + domain\n protocol = ''\n prefix = 'http://'\n }\n\n if (!isCorrectDomain(domain)) {\n return false\n }\n\n const parts = splitUrl(domain + path)\n\n if (!parts[0]) return false\n\n /** @type {Link} */\n const result = {\n type: 'link',\n title: null,\n url: prefix + protocol + parts[0],\n children: [{type: 'text', value: protocol + parts[0]}]\n }\n\n if (parts[1]) {\n return [result, {type: 'text', value: parts[1]}]\n }\n\n return result\n}\n\n/**\n * @type {ReplaceFunction}\n * @param {string} _\n * @param {string} atext\n * @param {string} label\n * @param {RegExpMatchObject} match\n * @returns {Link | false}\n */\nfunction findEmail(_, atext, label, match) {\n if (\n // Not an expected previous character.\n !previous(match, true) ||\n // Label ends in not allowed character.\n /[-\\d_]$/.test(label)\n ) {\n return false\n }\n\n return {\n type: 'link',\n title: null,\n url: 'mailto:' + atext + '@' + label,\n children: [{type: 'text', value: atext + '@' + label}]\n }\n}\n\n/**\n * @param {string} domain\n * @returns {boolean}\n */\nfunction isCorrectDomain(domain) {\n const parts = domain.split('.')\n\n if (\n parts.length < 2 ||\n (parts[parts.length - 1] &&\n (/_/.test(parts[parts.length - 1]) ||\n !/[a-zA-Z\\d]/.test(parts[parts.length - 1]))) ||\n (parts[parts.length - 2] &&\n (/_/.test(parts[parts.length - 2]) ||\n !/[a-zA-Z\\d]/.test(parts[parts.length - 2])))\n ) {\n return false\n }\n\n return true\n}\n\n/**\n * @param {string} url\n * @returns {[string, string | undefined]}\n */\nfunction splitUrl(url) {\n const trailExec = /[!\"&'),.:;<>?\\]}]+$/.exec(url)\n\n if (!trailExec) {\n return [url, undefined]\n }\n\n url = url.slice(0, trailExec.index)\n\n let trail = trailExec[0]\n let closingParenIndex = trail.indexOf(')')\n const openingParens = ccount(url, '(')\n let closingParens = ccount(url, ')')\n\n while (closingParenIndex !== -1 && openingParens > closingParens) {\n url += trail.slice(0, closingParenIndex + 1)\n trail = trail.slice(closingParenIndex + 1)\n closingParenIndex = trail.indexOf(')')\n closingParens++\n }\n\n return [url, trail]\n}\n\n/**\n * @param {RegExpMatchObject} match\n * @param {boolean | null | undefined} [email=false]\n * @returns {boolean}\n */\nfunction previous(match, email) {\n const code = match.input.charCodeAt(match.index - 1)\n\n return (\n (match.index === 0 ||\n unicodeWhitespace(code) ||\n unicodePunctuation(code)) &&\n // If it’s an email, the previous character should not be a slash.\n (!email || code !== 47)\n )\n}\n","/**\n * @import {Code, ConstructRecord, Event, Extension, Previous, State, TokenizeContext, Tokenizer} from 'micromark-util-types'\n */\n\nimport { asciiAlpha, asciiAlphanumeric, asciiControl, markdownLineEndingOrSpace, unicodePunctuation, unicodeWhitespace } from 'micromark-util-character';\nconst wwwPrefix = {\n tokenize: tokenizeWwwPrefix,\n partial: true\n};\nconst domain = {\n tokenize: tokenizeDomain,\n partial: true\n};\nconst path = {\n tokenize: tokenizePath,\n partial: true\n};\nconst trail = {\n tokenize: tokenizeTrail,\n partial: true\n};\nconst emailDomainDotTrail = {\n tokenize: tokenizeEmailDomainDotTrail,\n partial: true\n};\nconst wwwAutolink = {\n name: 'wwwAutolink',\n tokenize: tokenizeWwwAutolink,\n previous: previousWww\n};\nconst protocolAutolink = {\n name: 'protocolAutolink',\n tokenize: tokenizeProtocolAutolink,\n previous: previousProtocol\n};\nconst emailAutolink = {\n name: 'emailAutolink',\n tokenize: tokenizeEmailAutolink,\n previous: previousEmail\n};\n\n/** @type {ConstructRecord} */\nconst text = {};\n\n/**\n * Create an extension for `micromark` to support GitHub autolink literal\n * syntax.\n *\n * @returns {Extension}\n * Extension for `micromark` that can be passed in `extensions` to enable GFM\n * autolink literal syntax.\n */\nexport function gfmAutolinkLiteral() {\n return {\n text\n };\n}\n\n/** @type {Code} */\nlet code = 48;\n\n// Add alphanumerics.\nwhile (code < 123) {\n text[code] = emailAutolink;\n code++;\n if (code === 58) code = 65;else if (code === 91) code = 97;\n}\ntext[43] = emailAutolink;\ntext[45] = emailAutolink;\ntext[46] = emailAutolink;\ntext[95] = emailAutolink;\ntext[72] = [emailAutolink, protocolAutolink];\ntext[104] = [emailAutolink, protocolAutolink];\ntext[87] = [emailAutolink, wwwAutolink];\ntext[119] = [emailAutolink, wwwAutolink];\n\n// To do: perform email autolink literals on events, afterwards.\n// That’s where `markdown-rs` and `cmark-gfm` perform it.\n// It should look for `@`, then for atext backwards, and then for a label\n// forwards.\n// To do: `mailto:`, `xmpp:` protocol as prefix.\n\n/**\n * Email autolink literal.\n *\n * ```markdown\n * > | a contact@example.org b\n * ^^^^^^^^^^^^^^^^^^^\n * ```\n *\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeEmailAutolink(effects, ok, nok) {\n const self = this;\n /** @type {boolean | undefined} */\n let dot;\n /** @type {boolean} */\n let data;\n return start;\n\n /**\n * Start of email autolink literal.\n *\n * ```markdown\n * > | a contact@example.org b\n * ^\n * ```\n *\n * @type {State}\n */\n function start(code) {\n if (!gfmAtext(code) || !previousEmail.call(self, self.previous) || previousUnbalanced(self.events)) {\n return nok(code);\n }\n effects.enter('literalAutolink');\n effects.enter('literalAutolinkEmail');\n return atext(code);\n }\n\n /**\n * In email atext.\n *\n * ```markdown\n * > | a contact@example.org b\n * ^\n * ```\n *\n * @type {State}\n */\n function atext(code) {\n if (gfmAtext(code)) {\n effects.consume(code);\n return atext;\n }\n if (code === 64) {\n effects.consume(code);\n return emailDomain;\n }\n return nok(code);\n }\n\n /**\n * In email domain.\n *\n * The reference code is a bit overly complex as it handles the `@`, of which\n * there may be just one.\n * Source: \n *\n * ```markdown\n * > | a contact@example.org b\n * ^\n * ```\n *\n * @type {State}\n */\n function emailDomain(code) {\n // Dot followed by alphanumerical (not `-` or `_`).\n if (code === 46) {\n return effects.check(emailDomainDotTrail, emailDomainAfter, emailDomainDot)(code);\n }\n\n // Alphanumerical, `-`, and `_`.\n if (code === 45 || code === 95 || asciiAlphanumeric(code)) {\n data = true;\n effects.consume(code);\n return emailDomain;\n }\n\n // To do: `/` if xmpp.\n\n // Note: normally we’d truncate trailing punctuation from the link.\n // However, email autolink literals cannot contain any of those markers,\n // except for `.`, but that can only occur if it isn’t trailing.\n // So we can ignore truncating!\n return emailDomainAfter(code);\n }\n\n /**\n * In email domain, on dot that is not a trail.\n *\n * ```markdown\n * > | a contact@example.org b\n * ^\n * ```\n *\n * @type {State}\n */\n function emailDomainDot(code) {\n effects.consume(code);\n dot = true;\n return emailDomain;\n }\n\n /**\n * After email domain.\n *\n * ```markdown\n * > | a contact@example.org b\n * ^\n * ```\n *\n * @type {State}\n */\n function emailDomainAfter(code) {\n // Domain must not be empty, must include a dot, and must end in alphabetical.\n // Source: .\n if (data && dot && asciiAlpha(self.previous)) {\n effects.exit('literalAutolinkEmail');\n effects.exit('literalAutolink');\n return ok(code);\n }\n return nok(code);\n }\n}\n\n/**\n * `www` autolink literal.\n *\n * ```markdown\n * > | a www.example.org b\n * ^^^^^^^^^^^^^^^\n * ```\n *\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeWwwAutolink(effects, ok, nok) {\n const self = this;\n return wwwStart;\n\n /**\n * Start of www autolink literal.\n *\n * ```markdown\n * > | www.example.com/a?b#c\n * ^\n * ```\n *\n * @type {State}\n */\n function wwwStart(code) {\n if (code !== 87 && code !== 119 || !previousWww.call(self, self.previous) || previousUnbalanced(self.events)) {\n return nok(code);\n }\n effects.enter('literalAutolink');\n effects.enter('literalAutolinkWww');\n // Note: we *check*, so we can discard the `www.` we parsed.\n // If it worked, we consider it as a part of the domain.\n return effects.check(wwwPrefix, effects.attempt(domain, effects.attempt(path, wwwAfter), nok), nok)(code);\n }\n\n /**\n * After a www autolink literal.\n *\n * ```markdown\n * > | www.example.com/a?b#c\n * ^\n * ```\n *\n * @type {State}\n */\n function wwwAfter(code) {\n effects.exit('literalAutolinkWww');\n effects.exit('literalAutolink');\n return ok(code);\n }\n}\n\n/**\n * Protocol autolink literal.\n *\n * ```markdown\n * > | a https://example.org b\n * ^^^^^^^^^^^^^^^^^^^\n * ```\n *\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeProtocolAutolink(effects, ok, nok) {\n const self = this;\n let buffer = '';\n let seen = false;\n return protocolStart;\n\n /**\n * Start of protocol autolink literal.\n *\n * ```markdown\n * > | https://example.com/a?b#c\n * ^\n * ```\n *\n * @type {State}\n */\n function protocolStart(code) {\n if ((code === 72 || code === 104) && previousProtocol.call(self, self.previous) && !previousUnbalanced(self.events)) {\n effects.enter('literalAutolink');\n effects.enter('literalAutolinkHttp');\n buffer += String.fromCodePoint(code);\n effects.consume(code);\n return protocolPrefixInside;\n }\n return nok(code);\n }\n\n /**\n * In protocol.\n *\n * ```markdown\n * > | https://example.com/a?b#c\n * ^^^^^\n * ```\n *\n * @type {State}\n */\n function protocolPrefixInside(code) {\n // `5` is size of `https`\n if (asciiAlpha(code) && buffer.length < 5) {\n // @ts-expect-error: definitely number.\n buffer += String.fromCodePoint(code);\n effects.consume(code);\n return protocolPrefixInside;\n }\n if (code === 58) {\n const protocol = buffer.toLowerCase();\n if (protocol === 'http' || protocol === 'https') {\n effects.consume(code);\n return protocolSlashesInside;\n }\n }\n return nok(code);\n }\n\n /**\n * In slashes.\n *\n * ```markdown\n * > | https://example.com/a?b#c\n * ^^\n * ```\n *\n * @type {State}\n */\n function protocolSlashesInside(code) {\n if (code === 47) {\n effects.consume(code);\n if (seen) {\n return afterProtocol;\n }\n seen = true;\n return protocolSlashesInside;\n }\n return nok(code);\n }\n\n /**\n * After protocol, before domain.\n *\n * ```markdown\n * > | https://example.com/a?b#c\n * ^\n * ```\n *\n * @type {State}\n */\n function afterProtocol(code) {\n // To do: this is different from `markdown-rs`:\n // https://github.com/wooorm/markdown-rs/blob/b3a921c761309ae00a51fe348d8a43adbc54b518/src/construct/gfm_autolink_literal.rs#L172-L182\n return code === null || asciiControl(code) || markdownLineEndingOrSpace(code) || unicodeWhitespace(code) || unicodePunctuation(code) ? nok(code) : effects.attempt(domain, effects.attempt(path, protocolAfter), nok)(code);\n }\n\n /**\n * After a protocol autolink literal.\n *\n * ```markdown\n * > | https://example.com/a?b#c\n * ^\n * ```\n *\n * @type {State}\n */\n function protocolAfter(code) {\n effects.exit('literalAutolinkHttp');\n effects.exit('literalAutolink');\n return ok(code);\n }\n}\n\n/**\n * `www` prefix.\n *\n * ```markdown\n * > | a www.example.org b\n * ^^^^\n * ```\n *\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeWwwPrefix(effects, ok, nok) {\n let size = 0;\n return wwwPrefixInside;\n\n /**\n * In www prefix.\n *\n * ```markdown\n * > | www.example.com\n * ^^^^\n * ```\n *\n * @type {State}\n */\n function wwwPrefixInside(code) {\n if ((code === 87 || code === 119) && size < 3) {\n size++;\n effects.consume(code);\n return wwwPrefixInside;\n }\n if (code === 46 && size === 3) {\n effects.consume(code);\n return wwwPrefixAfter;\n }\n return nok(code);\n }\n\n /**\n * After www prefix.\n *\n * ```markdown\n * > | www.example.com\n * ^\n * ```\n *\n * @type {State}\n */\n function wwwPrefixAfter(code) {\n // If there is *anything*, we can link.\n return code === null ? nok(code) : ok(code);\n }\n}\n\n/**\n * Domain.\n *\n * ```markdown\n * > | a https://example.org b\n * ^^^^^^^^^^^\n * ```\n *\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeDomain(effects, ok, nok) {\n /** @type {boolean | undefined} */\n let underscoreInLastSegment;\n /** @type {boolean | undefined} */\n let underscoreInLastLastSegment;\n /** @type {boolean | undefined} */\n let seen;\n return domainInside;\n\n /**\n * In domain.\n *\n * ```markdown\n * > | https://example.com/a\n * ^^^^^^^^^^^\n * ```\n *\n * @type {State}\n */\n function domainInside(code) {\n // Check whether this marker, which is a trailing punctuation\n // marker, optionally followed by more trailing markers, and then\n // followed by an end.\n if (code === 46 || code === 95) {\n return effects.check(trail, domainAfter, domainAtPunctuation)(code);\n }\n\n // GH documents that only alphanumerics (other than `-`, `.`, and `_`) can\n // occur, which sounds like ASCII only, but they also support `www.點看.com`,\n // so that’s Unicode.\n // Instead of some new production for Unicode alphanumerics, markdown\n // already has that for Unicode punctuation and whitespace, so use those.\n // Source: .\n if (code === null || markdownLineEndingOrSpace(code) || unicodeWhitespace(code) || code !== 45 && unicodePunctuation(code)) {\n return domainAfter(code);\n }\n seen = true;\n effects.consume(code);\n return domainInside;\n }\n\n /**\n * In domain, at potential trailing punctuation, that was not trailing.\n *\n * ```markdown\n * > | https://example.com\n * ^\n * ```\n *\n * @type {State}\n */\n function domainAtPunctuation(code) {\n // There is an underscore in the last segment of the domain\n if (code === 95) {\n underscoreInLastSegment = true;\n }\n // Otherwise, it’s a `.`: save the last segment underscore in the\n // penultimate segment slot.\n else {\n underscoreInLastLastSegment = underscoreInLastSegment;\n underscoreInLastSegment = undefined;\n }\n effects.consume(code);\n return domainInside;\n }\n\n /**\n * After domain.\n *\n * ```markdown\n * > | https://example.com/a\n * ^\n * ```\n *\n * @type {State} */\n function domainAfter(code) {\n // Note: that’s GH says a dot is needed, but it’s not true:\n // \n if (underscoreInLastLastSegment || underscoreInLastSegment || !seen) {\n return nok(code);\n }\n return ok(code);\n }\n}\n\n/**\n * Path.\n *\n * ```markdown\n * > | a https://example.org/stuff b\n * ^^^^^^\n * ```\n *\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizePath(effects, ok) {\n let sizeOpen = 0;\n let sizeClose = 0;\n return pathInside;\n\n /**\n * In path.\n *\n * ```markdown\n * > | https://example.com/a\n * ^^\n * ```\n *\n * @type {State}\n */\n function pathInside(code) {\n if (code === 40) {\n sizeOpen++;\n effects.consume(code);\n return pathInside;\n }\n\n // To do: `markdown-rs` also needs this.\n // If this is a paren, and there are less closings than openings,\n // we don’t check for a trail.\n if (code === 41 && sizeClose < sizeOpen) {\n return pathAtPunctuation(code);\n }\n\n // Check whether this trailing punctuation marker is optionally\n // followed by more trailing markers, and then followed\n // by an end.\n if (code === 33 || code === 34 || code === 38 || code === 39 || code === 41 || code === 42 || code === 44 || code === 46 || code === 58 || code === 59 || code === 60 || code === 63 || code === 93 || code === 95 || code === 126) {\n return effects.check(trail, ok, pathAtPunctuation)(code);\n }\n if (code === null || markdownLineEndingOrSpace(code) || unicodeWhitespace(code)) {\n return ok(code);\n }\n effects.consume(code);\n return pathInside;\n }\n\n /**\n * In path, at potential trailing punctuation, that was not trailing.\n *\n * ```markdown\n * > | https://example.com/a\"b\n * ^\n * ```\n *\n * @type {State}\n */\n function pathAtPunctuation(code) {\n // Count closing parens.\n if (code === 41) {\n sizeClose++;\n }\n effects.consume(code);\n return pathInside;\n }\n}\n\n/**\n * Trail.\n *\n * This calls `ok` if this *is* the trail, followed by an end, which means\n * the entire trail is not part of the link.\n * It calls `nok` if this *is* part of the link.\n *\n * ```markdown\n * > | https://example.com\").\n * ^^^\n * ```\n *\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeTrail(effects, ok, nok) {\n return trail;\n\n /**\n * In trail of domain or path.\n *\n * ```markdown\n * > | https://example.com\").\n * ^\n * ```\n *\n * @type {State}\n */\n function trail(code) {\n // Regular trailing punctuation.\n if (code === 33 || code === 34 || code === 39 || code === 41 || code === 42 || code === 44 || code === 46 || code === 58 || code === 59 || code === 63 || code === 95 || code === 126) {\n effects.consume(code);\n return trail;\n }\n\n // `&` followed by one or more alphabeticals and then a `;`, is\n // as a whole considered as trailing punctuation.\n // In all other cases, it is considered as continuation of the URL.\n if (code === 38) {\n effects.consume(code);\n return trailCharacterReferenceStart;\n }\n\n // Needed because we allow literals after `[`, as we fix:\n // .\n // Check that it is not followed by `(` or `[`.\n if (code === 93) {\n effects.consume(code);\n return trailBracketAfter;\n }\n if (\n // `<` is an end.\n code === 60 ||\n // So is whitespace.\n code === null || markdownLineEndingOrSpace(code) || unicodeWhitespace(code)) {\n return ok(code);\n }\n return nok(code);\n }\n\n /**\n * In trail, after `]`.\n *\n * > 👉 **Note**: this deviates from `cmark-gfm` to fix a bug.\n * > See end of for more.\n *\n * ```markdown\n * > | https://example.com](\n * ^\n * ```\n *\n * @type {State}\n */\n function trailBracketAfter(code) {\n // Whitespace or something that could start a resource or reference is the end.\n // Switch back to trail otherwise.\n if (code === null || code === 40 || code === 91 || markdownLineEndingOrSpace(code) || unicodeWhitespace(code)) {\n return ok(code);\n }\n return trail(code);\n }\n\n /**\n * In character-reference like trail, after `&`.\n *\n * ```markdown\n * > | https://example.com&).\n * ^\n * ```\n *\n * @type {State}\n */\n function trailCharacterReferenceStart(code) {\n // When non-alpha, it’s not a trail.\n return asciiAlpha(code) ? trailCharacterReferenceInside(code) : nok(code);\n }\n\n /**\n * In character-reference like trail.\n *\n * ```markdown\n * > | https://example.com&).\n * ^\n * ```\n *\n * @type {State}\n */\n function trailCharacterReferenceInside(code) {\n // Switch back to trail if this is well-formed.\n if (code === 59) {\n effects.consume(code);\n return trail;\n }\n if (asciiAlpha(code)) {\n effects.consume(code);\n return trailCharacterReferenceInside;\n }\n\n // It’s not a trail.\n return nok(code);\n }\n}\n\n/**\n * Dot in email domain trail.\n *\n * This calls `ok` if this *is* the trail, followed by an end, which means\n * the trail is not part of the link.\n * It calls `nok` if this *is* part of the link.\n *\n * ```markdown\n * > | contact@example.org.\n * ^\n * ```\n *\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeEmailDomainDotTrail(effects, ok, nok) {\n return start;\n\n /**\n * Dot.\n *\n * ```markdown\n * > | contact@example.org.\n * ^ ^\n * ```\n *\n * @type {State}\n */\n function start(code) {\n // Must be dot.\n effects.consume(code);\n return after;\n }\n\n /**\n * After dot.\n *\n * ```markdown\n * > | contact@example.org.\n * ^ ^\n * ```\n *\n * @type {State}\n */\n function after(code) {\n // Not a trail if alphanumeric.\n return asciiAlphanumeric(code) ? nok(code) : ok(code);\n }\n}\n\n/**\n * See:\n * .\n *\n * @type {Previous}\n */\nfunction previousWww(code) {\n return code === null || code === 40 || code === 42 || code === 95 || code === 91 || code === 93 || code === 126 || markdownLineEndingOrSpace(code);\n}\n\n/**\n * See:\n * .\n *\n * @type {Previous}\n */\nfunction previousProtocol(code) {\n return !asciiAlpha(code);\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Previous}\n */\nfunction previousEmail(code) {\n // Do not allow a slash “inside” atext.\n // The reference code is a bit weird, but that’s what it results in.\n // Source: .\n // Other than slash, every preceding character is allowed.\n return !(code === 47 || gfmAtext(code));\n}\n\n/**\n * @param {Code} code\n * @returns {boolean}\n */\nfunction gfmAtext(code) {\n return code === 43 || code === 45 || code === 46 || code === 95 || asciiAlphanumeric(code);\n}\n\n/**\n * @param {Array} events\n * @returns {boolean}\n */\nfunction previousUnbalanced(events) {\n let index = events.length;\n let result = false;\n while (index--) {\n const token = events[index][1];\n if ((token.type === 'labelLink' || token.type === 'labelImage') && !token._balanced) {\n result = true;\n break;\n }\n\n // If we’ve seen this token, and it was marked as not having any unbalanced\n // bracket before it, we can exit.\n if (token._gfmAutolinkLiteralWalkedInto) {\n result = false;\n break;\n }\n }\n if (events.length > 0 && !result) {\n // Mark the last token as “walked into” w/o finding\n // anything.\n events[events.length - 1][1]._gfmAutolinkLiteralWalkedInto = true;\n }\n return result;\n}","import type { Extension as FromMarkdownExtension } from \"mdast-util-from-markdown\";\nimport type { Options as ToMarkdownExtension } from \"mdast-util-to-markdown\";\nimport type { Extension as MicromarkExtension } from \"micromark-util-types\";\nimport type { Processor } from \"unified\";\n\nexport function buildUnifiedExtension(\n micromarkExtensions: Array,\n fromMarkdownExtensions: Array,\n toMarkdownExtensions: Array,\n): () => void {\n return function (this: Processor) {\n const data = this.data();\n\n data.micromarkExtensions ??= [];\n data.fromMarkdownExtensions ??= [];\n data.toMarkdownExtensions ??= [];\n\n data.micromarkExtensions.push(...micromarkExtensions);\n data.fromMarkdownExtensions.push(...fromMarkdownExtensions);\n data.toMarkdownExtensions.push(...toMarkdownExtensions);\n };\n}\n","import type { Processor } from \"unified\";\nimport type { Node as UnistNode } from \"unist\";\n\nimport {\n gfmAutolinkLiteralFromMarkdown,\n gfmAutolinkLiteralToMarkdown,\n} from \"mdast-util-gfm-autolink-literal\";\nimport { gfmAutolinkLiteral } from \"micromark-extension-gfm-autolink-literal\";\nimport { Extension } from \"prosemirror-unified\";\n\nimport { buildUnifiedExtension } from \"../utils/buildUnifiedExtension\";\n\n/**\n * @public\n */\nexport class ExtendedAutolinkExtension extends Extension {\n public override unifiedInitializationHook(\n processor: Processor,\n ): Processor {\n return processor.use(\n buildUnifiedExtension(\n [gfmAutolinkLiteral()],\n [gfmAutolinkLiteralFromMarkdown()],\n [gfmAutolinkLiteralToMarkdown()],\n ),\n );\n }\n}\n","/**\n * @typedef {import('mdast').Delete} Delete\n *\n * @typedef {import('mdast-util-from-markdown').CompileContext} CompileContext\n * @typedef {import('mdast-util-from-markdown').Extension} FromMarkdownExtension\n * @typedef {import('mdast-util-from-markdown').Handle} FromMarkdownHandle\n *\n * @typedef {import('mdast-util-to-markdown').ConstructName} ConstructName\n * @typedef {import('mdast-util-to-markdown').Handle} ToMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownExtension\n */\n\n/**\n * List of constructs that occur in phrasing (paragraphs, headings), but cannot\n * contain strikethrough.\n * So they sort of cancel each other out.\n * Note: could use a better name.\n *\n * Note: keep in sync with: \n *\n * @type {Array}\n */\nconst constructsWithoutStrikethrough = [\n 'autolink',\n 'destinationLiteral',\n 'destinationRaw',\n 'reference',\n 'titleQuote',\n 'titleApostrophe'\n]\n\nhandleDelete.peek = peekDelete\n\n/**\n * Create an extension for `mdast-util-from-markdown` to enable GFM\n * strikethrough in markdown.\n *\n * @returns {FromMarkdownExtension}\n * Extension for `mdast-util-from-markdown` to enable GFM strikethrough.\n */\nexport function gfmStrikethroughFromMarkdown() {\n return {\n canContainEols: ['delete'],\n enter: {strikethrough: enterStrikethrough},\n exit: {strikethrough: exitStrikethrough}\n }\n}\n\n/**\n * Create an extension for `mdast-util-to-markdown` to enable GFM\n * strikethrough in markdown.\n *\n * @returns {ToMarkdownExtension}\n * Extension for `mdast-util-to-markdown` to enable GFM strikethrough.\n */\nexport function gfmStrikethroughToMarkdown() {\n return {\n unsafe: [\n {\n character: '~',\n inConstruct: 'phrasing',\n notInConstruct: constructsWithoutStrikethrough\n }\n ],\n handlers: {delete: handleDelete}\n }\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction enterStrikethrough(token) {\n this.enter({type: 'delete', children: []}, token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitStrikethrough(token) {\n this.exit(token)\n}\n\n/**\n * @type {ToMarkdownHandle}\n * @param {Delete} node\n */\nfunction handleDelete(node, _, state, info) {\n const tracker = state.createTracker(info)\n const exit = state.enter('strikethrough')\n let value = tracker.move('~~')\n value += state.containerPhrasing(node, {\n ...tracker.current(),\n before: value,\n after: '~'\n })\n value += tracker.move('~~')\n exit()\n return value\n}\n\n/** @type {ToMarkdownHandle} */\nfunction peekDelete() {\n return '~'\n}\n","/**\n * Like `Array#splice`, but smarter for giant arrays.\n *\n * `Array#splice` takes all items to be inserted as individual argument which\n * causes a stack overflow in V8 when trying to insert 100k items for instance.\n *\n * Otherwise, this does not return the removed items, and takes `items` as an\n * array instead of rest parameters.\n *\n * @template {unknown} T\n * Item type.\n * @param {Array} list\n * List to operate on.\n * @param {number} start\n * Index to remove/insert at (can be negative).\n * @param {number} remove\n * Number of items to remove.\n * @param {Array} items\n * Items to inject into `list`.\n * @returns {undefined}\n * Nothing.\n */\nexport function splice(list, start, remove, items) {\n const end = list.length;\n let chunkStart = 0;\n /** @type {Array} */\n let parameters;\n\n // Make start between zero and `end` (included).\n if (start < 0) {\n start = -start > end ? 0 : end + start;\n } else {\n start = start > end ? end : start;\n }\n remove = remove > 0 ? remove : 0;\n\n // No need to chunk the items if there’s only a couple (10k) items.\n if (items.length < 10000) {\n parameters = Array.from(items);\n parameters.unshift(start, remove);\n // @ts-expect-error Hush, it’s fine.\n list.splice(...parameters);\n } else {\n // Delete `remove` items starting from `start`\n if (remove) list.splice(start, remove);\n\n // Insert the items in chunks to not cause stack overflows.\n while (chunkStart < items.length) {\n parameters = items.slice(chunkStart, chunkStart + 10000);\n parameters.unshift(start, 0);\n // @ts-expect-error Hush, it’s fine.\n list.splice(...parameters);\n chunkStart += 10000;\n start += 10000;\n }\n }\n}\n\n/**\n * Append `items` (an array) at the end of `list` (another array).\n * When `list` was empty, returns `items` instead.\n *\n * This prevents a potentially expensive operation when `list` is empty,\n * and adds items in batches to prevent V8 from hanging.\n *\n * @template {unknown} T\n * Item type.\n * @param {Array} list\n * List to operate on.\n * @param {Array} items\n * Items to add to `list`.\n * @returns {Array}\n * Either `list` or `items`.\n */\nexport function push(list, items) {\n if (list.length > 0) {\n splice(list, list.length, 0, items);\n return list;\n }\n return items;\n}","/**\n * @import {Code} from 'micromark-util-types'\n */\n\nimport { markdownLineEndingOrSpace, unicodePunctuation, unicodeWhitespace } from 'micromark-util-character';\n/**\n * Classify whether a code represents whitespace, punctuation, or something\n * else.\n *\n * Used for attention (emphasis, strong), whose sequences can open or close\n * based on the class of surrounding characters.\n *\n * > 👉 **Note**: eof (`null`) is seen as whitespace.\n *\n * @param {Code} code\n * Code.\n * @returns {typeof constants.characterGroupWhitespace | typeof constants.characterGroupPunctuation | undefined}\n * Group.\n */\nexport function classifyCharacter(code) {\n if (code === null || markdownLineEndingOrSpace(code) || unicodeWhitespace(code)) {\n return 1;\n }\n if (unicodePunctuation(code)) {\n return 2;\n }\n}","/**\n * @import {Event, Resolver, TokenizeContext} from 'micromark-util-types'\n */\n\n/**\n * Call all `resolveAll`s.\n *\n * @param {ReadonlyArray<{resolveAll?: Resolver | undefined}>} constructs\n * List of constructs, optionally with `resolveAll`s.\n * @param {Array} events\n * List of events.\n * @param {TokenizeContext} context\n * Context used by `tokenize`.\n * @returns {Array}\n * Changed events.\n */\nexport function resolveAll(constructs, events, context) {\n /** @type {Array} */\n const called = []\n let index = -1\n\n while (++index < constructs.length) {\n const resolve = constructs[index].resolveAll\n\n if (resolve && !called.includes(resolve)) {\n events = resolve(events, context)\n called.push(resolve)\n }\n }\n\n return events\n}\n","/**\n * @import {Options} from 'micromark-extension-gfm-strikethrough'\n * @import {Event, Extension, Resolver, State, Token, TokenizeContext, Tokenizer} from 'micromark-util-types'\n */\n\nimport { splice } from 'micromark-util-chunked';\nimport { classifyCharacter } from 'micromark-util-classify-character';\nimport { resolveAll } from 'micromark-util-resolve-all';\n/**\n * Create an extension for `micromark` to enable GFM strikethrough syntax.\n *\n * @param {Options | null | undefined} [options={}]\n * Configuration.\n * @returns {Extension}\n * Extension for `micromark` that can be passed in `extensions`, to\n * enable GFM strikethrough syntax.\n */\nexport function gfmStrikethrough(options) {\n const options_ = options || {};\n let single = options_.singleTilde;\n const tokenizer = {\n name: 'strikethrough',\n tokenize: tokenizeStrikethrough,\n resolveAll: resolveAllStrikethrough\n };\n if (single === null || single === undefined) {\n single = true;\n }\n return {\n text: {\n [126]: tokenizer\n },\n insideSpan: {\n null: [tokenizer]\n },\n attentionMarkers: {\n null: [126]\n }\n };\n\n /**\n * Take events and resolve strikethrough.\n *\n * @type {Resolver}\n */\n function resolveAllStrikethrough(events, context) {\n let index = -1;\n\n // Walk through all events.\n while (++index < events.length) {\n // Find a token that can close.\n if (events[index][0] === 'enter' && events[index][1].type === 'strikethroughSequenceTemporary' && events[index][1]._close) {\n let open = index;\n\n // Now walk back to find an opener.\n while (open--) {\n // Find a token that can open the closer.\n if (events[open][0] === 'exit' && events[open][1].type === 'strikethroughSequenceTemporary' && events[open][1]._open &&\n // If the sizes are the same:\n events[index][1].end.offset - events[index][1].start.offset === events[open][1].end.offset - events[open][1].start.offset) {\n events[index][1].type = 'strikethroughSequence';\n events[open][1].type = 'strikethroughSequence';\n\n /** @type {Token} */\n const strikethrough = {\n type: 'strikethrough',\n start: Object.assign({}, events[open][1].start),\n end: Object.assign({}, events[index][1].end)\n };\n\n /** @type {Token} */\n const text = {\n type: 'strikethroughText',\n start: Object.assign({}, events[open][1].end),\n end: Object.assign({}, events[index][1].start)\n };\n\n // Opening.\n /** @type {Array} */\n const nextEvents = [['enter', strikethrough, context], ['enter', events[open][1], context], ['exit', events[open][1], context], ['enter', text, context]];\n const insideSpan = context.parser.constructs.insideSpan.null;\n if (insideSpan) {\n // Between.\n splice(nextEvents, nextEvents.length, 0, resolveAll(insideSpan, events.slice(open + 1, index), context));\n }\n\n // Closing.\n splice(nextEvents, nextEvents.length, 0, [['exit', text, context], ['enter', events[index][1], context], ['exit', events[index][1], context], ['exit', strikethrough, context]]);\n splice(events, open - 1, index - open + 3, nextEvents);\n index = open + nextEvents.length - 2;\n break;\n }\n }\n }\n }\n index = -1;\n while (++index < events.length) {\n if (events[index][1].type === 'strikethroughSequenceTemporary') {\n events[index][1].type = \"data\";\n }\n }\n return events;\n }\n\n /**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\n function tokenizeStrikethrough(effects, ok, nok) {\n const previous = this.previous;\n const events = this.events;\n let size = 0;\n return start;\n\n /** @type {State} */\n function start(code) {\n if (previous === 126 && events[events.length - 1][1].type !== \"characterEscape\") {\n return nok(code);\n }\n effects.enter('strikethroughSequenceTemporary');\n return more(code);\n }\n\n /** @type {State} */\n function more(code) {\n const before = classifyCharacter(previous);\n if (code === 126) {\n // If this is the third marker, exit.\n if (size > 1) return nok(code);\n effects.consume(code);\n size++;\n return more;\n }\n if (size < 2 && !single) return nok(code);\n const token = effects.exit('strikethroughSequenceTemporary');\n const after = classifyCharacter(code);\n token._open = !after || after === 2 && Boolean(before);\n token._close = !before || before === 2 && Boolean(after);\n return ok(code);\n }\n }\n}","import type { Delete, Emphasis, Text } from \"mdast\";\nimport type { InputRule } from \"prosemirror-inputrules\";\nimport type {\n DOMOutputSpec,\n MarkSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Processor } from \"unified\";\nimport type { Node as UnistNode } from \"unist\";\n\nimport {\n gfmStrikethroughFromMarkdown,\n gfmStrikethroughToMarkdown,\n} from \"mdast-util-gfm-strikethrough\";\nimport { gfmStrikethrough } from \"micromark-extension-gfm-strikethrough\";\nimport { MarkExtension, MarkInputRule } from \"prosemirror-unified\";\n\nimport { buildUnifiedExtension } from \"../utils/buildUnifiedExtension\";\n\n/**\n * @public\n */\nexport class StrikethroughExtension extends MarkExtension {\n public override processConvertedUnistNode(\n convertedNode: Emphasis | Text,\n ): Delete {\n return { children: [convertedNode], type: this.unistNodeName() };\n }\n\n public override proseMirrorInputRules(\n proseMirrorSchema: Schema,\n ): Array {\n return [\n new MarkInputRule(\n /~([^\\s](?:.*[^\\s~])?)~([^~])$/u,\n proseMirrorSchema.marks[this.proseMirrorMarkName()],\n ),\n new MarkInputRule(\n /~~([^\\s](?:.*[^\\s])?)~~([\\s\\S])$/u,\n proseMirrorSchema.marks[this.proseMirrorMarkName()],\n ),\n ];\n }\n\n public override proseMirrorMarkName(): string {\n return \"strikethrough\";\n }\n\n public override proseMirrorMarkSpec(): MarkSpec {\n return {\n parseDOM: [\n { tag: \"s\" },\n { tag: \"del\" },\n {\n getAttrs: (value) =>\n /(^|[\\s])line-through([\\s]|$)/u.test(value) && null,\n style: \"text-decoration\",\n },\n ],\n toDOM(): DOMOutputSpec {\n return [\"s\", 0];\n },\n };\n }\n\n public override unifiedInitializationHook(\n processor: Processor,\n ): Processor {\n return processor.use(\n buildUnifiedExtension(\n [gfmStrikethrough()],\n [gfmStrikethroughFromMarkdown()],\n [gfmStrikethroughToMarkdown()],\n ),\n );\n }\n\n public override unistNodeName(): \"delete\" {\n return \"delete\";\n }\n\n public override unistNodeToProseMirrorNodes(\n _node: Delete,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return convertedChildren.map((child) =>\n child.mark(\n child.marks.concat([\n proseMirrorSchema.marks[this.proseMirrorMarkName()].create(),\n ]),\n ),\n );\n }\n}\n","/**\n * @import {Blockquote, Parents} from 'mdast'\n * @import {Info, Map, State} from 'mdast-util-to-markdown'\n */\n\n/**\n * @param {Blockquote} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function blockquote(node, _, state, info) {\n const exit = state.enter('blockquote')\n const tracker = state.createTracker(info)\n tracker.move('> ')\n tracker.shift(2)\n const value = state.indentLines(\n state.containerFlow(node, tracker.current()),\n map\n )\n exit()\n return value\n}\n\n/** @type {Map} */\nfunction map(line, _, blank) {\n return '>' + (blank ? '' : ' ') + line\n}\n","/**\n * @import {ConstructName, Unsafe} from 'mdast-util-to-markdown'\n */\n\n/**\n * @param {Array} stack\n * @param {Unsafe} pattern\n * @returns {boolean}\n */\nexport function patternInScope(stack, pattern) {\n return (\n listInScope(stack, pattern.inConstruct, true) &&\n !listInScope(stack, pattern.notInConstruct, false)\n )\n}\n\n/**\n * @param {Array} stack\n * @param {Unsafe['inConstruct']} list\n * @param {boolean} none\n * @returns {boolean}\n */\nfunction listInScope(stack, list, none) {\n if (typeof list === 'string') {\n list = [list]\n }\n\n if (!list || list.length === 0) {\n return none\n }\n\n let index = -1\n\n while (++index < list.length) {\n if (stack.includes(list[index])) {\n return true\n }\n }\n\n return false\n}\n","/**\n * @import {Break, Parents} from 'mdast'\n * @import {Info, State} from 'mdast-util-to-markdown'\n */\n\nimport {patternInScope} from '../util/pattern-in-scope.js'\n\n/**\n * @param {Break} _\n * @param {Parents | undefined} _1\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function hardBreak(_, _1, state, info) {\n let index = -1\n\n while (++index < state.unsafe.length) {\n // If we can’t put eols in this construct (setext headings, tables), use a\n // space instead.\n if (\n state.unsafe[index].character === '\\n' &&\n patternInScope(state.stack, state.unsafe[index])\n ) {\n return /[ \\t]/.test(info.before) ? '' : ' '\n }\n }\n\n return '\\\\\\n'\n}\n","/**\n * Get the count of the longest repeating streak of `substring` in `value`.\n *\n * @param {string} value\n * Content to search in.\n * @param {string} substring\n * Substring to look for, typically one character.\n * @returns {number}\n * Count of most frequent adjacent `substring`s in `value`.\n */\nexport function longestStreak(value, substring) {\n const source = String(value)\n let index = source.indexOf(substring)\n let expected = index\n let count = 0\n let max = 0\n\n if (typeof substring !== 'string') {\n throw new TypeError('Expected substring')\n }\n\n while (index !== -1) {\n if (index === expected) {\n if (++count > max) {\n max = count\n }\n } else {\n count = 1\n }\n\n expected = index + substring.length\n index = source.indexOf(substring, expected)\n }\n\n return max\n}\n","/**\n * @import {State} from 'mdast-util-to-markdown'\n * @import {Code} from 'mdast'\n */\n\n/**\n * @param {Code} node\n * @param {State} state\n * @returns {boolean}\n */\nexport function formatCodeAsIndented(node, state) {\n return Boolean(\n state.options.fences === false &&\n node.value &&\n // If there’s no info…\n !node.lang &&\n // And there’s a non-whitespace character…\n /[^ \\r\\n]/.test(node.value) &&\n // And the value doesn’t start or end in a blank…\n !/^[\\t ]*(?:[\\r\\n]|$)|(?:^|[\\r\\n])[\\t ]*$/.test(node.value)\n )\n}\n","/**\n * @import {Options, State} from 'mdast-util-to-markdown'\n */\n\n/**\n * @param {State} state\n * @returns {Exclude}\n */\nexport function checkFence(state) {\n const marker = state.options.fence || '`'\n\n if (marker !== '`' && marker !== '~') {\n throw new Error(\n 'Cannot serialize code with `' +\n marker +\n '` for `options.fence`, expected `` ` `` or `~`'\n )\n }\n\n return marker\n}\n","/**\n * @import {Info, Map, State} from 'mdast-util-to-markdown'\n * @import {Code, Parents} from 'mdast'\n */\n\nimport {longestStreak} from 'longest-streak'\nimport {formatCodeAsIndented} from '../util/format-code-as-indented.js'\nimport {checkFence} from '../util/check-fence.js'\n\n/**\n * @param {Code} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function code(node, _, state, info) {\n const marker = checkFence(state)\n const raw = node.value || ''\n const suffix = marker === '`' ? 'GraveAccent' : 'Tilde'\n\n if (formatCodeAsIndented(node, state)) {\n const exit = state.enter('codeIndented')\n const value = state.indentLines(raw, map)\n exit()\n return value\n }\n\n const tracker = state.createTracker(info)\n const sequence = marker.repeat(Math.max(longestStreak(raw, marker) + 1, 3))\n const exit = state.enter('codeFenced')\n let value = tracker.move(sequence)\n\n if (node.lang) {\n const subexit = state.enter(`codeFencedLang${suffix}`)\n value += tracker.move(\n state.safe(node.lang, {\n before: value,\n after: ' ',\n encode: ['`'],\n ...tracker.current()\n })\n )\n subexit()\n }\n\n if (node.lang && node.meta) {\n const subexit = state.enter(`codeFencedMeta${suffix}`)\n value += tracker.move(' ')\n value += tracker.move(\n state.safe(node.meta, {\n before: value,\n after: '\\n',\n encode: ['`'],\n ...tracker.current()\n })\n )\n subexit()\n }\n\n value += tracker.move('\\n')\n\n if (raw) {\n value += tracker.move(raw + '\\n')\n }\n\n value += tracker.move(sequence)\n exit()\n return value\n}\n\n/** @type {Map} */\nfunction map(line, _, blank) {\n return (blank ? '' : ' ') + line\n}\n","/**\n * @import {Options, State} from 'mdast-util-to-markdown'\n */\n\n/**\n * @param {State} state\n * @returns {Exclude}\n */\nexport function checkQuote(state) {\n const marker = state.options.quote || '\"'\n\n if (marker !== '\"' && marker !== \"'\") {\n throw new Error(\n 'Cannot serialize title with `' +\n marker +\n '` for `options.quote`, expected `\"`, or `\\'`'\n )\n }\n\n return marker\n}\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {Definition, Parents} from 'mdast'\n */\n\nimport {checkQuote} from '../util/check-quote.js'\n\n/**\n * @param {Definition} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function definition(node, _, state, info) {\n const quote = checkQuote(state)\n const suffix = quote === '\"' ? 'Quote' : 'Apostrophe'\n const exit = state.enter('definition')\n let subexit = state.enter('label')\n const tracker = state.createTracker(info)\n let value = tracker.move('[')\n value += tracker.move(\n state.safe(state.associationId(node), {\n before: value,\n after: ']',\n ...tracker.current()\n })\n )\n value += tracker.move(']: ')\n\n subexit()\n\n if (\n // If there’s no url, or…\n !node.url ||\n // If there are control characters or whitespace.\n /[\\0- \\u007F]/.test(node.url)\n ) {\n subexit = state.enter('destinationLiteral')\n value += tracker.move('<')\n value += tracker.move(\n state.safe(node.url, {before: value, after: '>', ...tracker.current()})\n )\n value += tracker.move('>')\n } else {\n // No whitespace, raw is prettier.\n subexit = state.enter('destinationRaw')\n value += tracker.move(\n state.safe(node.url, {\n before: value,\n after: node.title ? ' ' : '\\n',\n ...tracker.current()\n })\n )\n }\n\n subexit()\n\n if (node.title) {\n subexit = state.enter(`title${suffix}`)\n value += tracker.move(' ' + quote)\n value += tracker.move(\n state.safe(node.title, {\n before: value,\n after: quote,\n ...tracker.current()\n })\n )\n value += tracker.move(quote)\n subexit()\n }\n\n exit()\n\n return value\n}\n","/**\n * @import {Options, State} from 'mdast-util-to-markdown'\n */\n\n/**\n * @param {State} state\n * @returns {Exclude}\n */\nexport function checkEmphasis(state) {\n const marker = state.options.emphasis || '*'\n\n if (marker !== '*' && marker !== '_') {\n throw new Error(\n 'Cannot serialize emphasis with `' +\n marker +\n '` for `options.emphasis`, expected `*`, or `_`'\n )\n }\n\n return marker\n}\n","/**\n * Encode a code point as a character reference.\n *\n * @param {number} code\n * Code point to encode.\n * @returns {string}\n * Encoded character reference.\n */\nexport function encodeCharacterReference(code) {\n return '&#x' + code.toString(16).toUpperCase() + ';'\n}\n","/**\n * @import {EncodeSides} from '../types.js'\n */\n\nimport {classifyCharacter} from 'micromark-util-classify-character'\n\n/**\n * Check whether to encode (as a character reference) the characters\n * surrounding an attention run.\n *\n * Which characters are around an attention run influence whether it works or\n * not.\n *\n * See for more info.\n * See this markdown in a particular renderer to see what works:\n *\n * ```markdown\n * | | A (letter inside) | B (punctuation inside) | C (whitespace inside) | D (nothing inside) |\n * | ----------------------- | ----------------- | ---------------------- | --------------------- | ------------------ |\n * | 1 (letter outside) | x*y*z | x*.*z | x* *z | x**z |\n * | 2 (punctuation outside) | .*y*. | .*.*. | .* *. | .**. |\n * | 3 (whitespace outside) | x *y* z | x *.* z | x * * z | x ** z |\n * | 4 (nothing outside) | *x* | *.* | * * | ** |\n * ```\n *\n * @param {number} outside\n * Code point on the outer side of the run.\n * @param {number} inside\n * Code point on the inner side of the run.\n * @param {'*' | '_'} marker\n * Marker of the run.\n * Underscores are handled more strictly (they form less often) than\n * asterisks.\n * @returns {EncodeSides}\n * Whether to encode characters.\n */\n// Important: punctuation must never be encoded.\n// Punctuation is solely used by markdown constructs.\n// And by encoding itself.\n// Encoding them will break constructs or double encode things.\nexport function encodeInfo(outside, inside, marker) {\n const outsideKind = classifyCharacter(outside)\n const insideKind = classifyCharacter(inside)\n\n // Letter outside:\n if (outsideKind === undefined) {\n return insideKind === undefined\n ? // Letter inside:\n // we have to encode *both* letters for `_` as it is looser.\n // it already forms for `*` (and GFMs `~`).\n marker === '_'\n ? {inside: true, outside: true}\n : {inside: false, outside: false}\n : insideKind === 1\n ? // Whitespace inside: encode both (letter, whitespace).\n {inside: true, outside: true}\n : // Punctuation inside: encode outer (letter)\n {inside: false, outside: true}\n }\n\n // Whitespace outside:\n if (outsideKind === 1) {\n return insideKind === undefined\n ? // Letter inside: already forms.\n {inside: false, outside: false}\n : insideKind === 1\n ? // Whitespace inside: encode both (whitespace).\n {inside: true, outside: true}\n : // Punctuation inside: already forms.\n {inside: false, outside: false}\n }\n\n // Punctuation outside:\n return insideKind === undefined\n ? // Letter inside: already forms.\n {inside: false, outside: false}\n : insideKind === 1\n ? // Whitespace inside: encode inner (whitespace).\n {inside: true, outside: false}\n : // Punctuation inside: already forms.\n {inside: false, outside: false}\n}\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {Emphasis, Parents} from 'mdast'\n */\n\nimport {checkEmphasis} from '../util/check-emphasis.js'\nimport {encodeCharacterReference} from '../util/encode-character-reference.js'\nimport {encodeInfo} from '../util/encode-info.js'\n\nemphasis.peek = emphasisPeek\n\n/**\n * @param {Emphasis} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function emphasis(node, _, state, info) {\n const marker = checkEmphasis(state)\n const exit = state.enter('emphasis')\n const tracker = state.createTracker(info)\n const before = tracker.move(marker)\n\n let between = tracker.move(\n state.containerPhrasing(node, {\n after: marker,\n before,\n ...tracker.current()\n })\n )\n const betweenHead = between.charCodeAt(0)\n const open = encodeInfo(\n info.before.charCodeAt(info.before.length - 1),\n betweenHead,\n marker\n )\n\n if (open.inside) {\n between = encodeCharacterReference(betweenHead) + between.slice(1)\n }\n\n const betweenTail = between.charCodeAt(between.length - 1)\n const close = encodeInfo(info.after.charCodeAt(0), betweenTail, marker)\n\n if (close.inside) {\n between = between.slice(0, -1) + encodeCharacterReference(betweenTail)\n }\n\n const after = tracker.move(marker)\n\n exit()\n\n state.attentionEncodeSurroundingInfo = {\n after: close.outside,\n before: open.outside\n }\n return before + between + after\n}\n\n/**\n * @param {Emphasis} _\n * @param {Parents | undefined} _1\n * @param {State} state\n * @returns {string}\n */\nfunction emphasisPeek(_, _1, state) {\n return state.options.emphasis || '*'\n}\n","/**\n * @typedef {import('unist').Node} UnistNode\n * @typedef {import('unist').Parent} UnistParent\n * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult\n */\n\n/**\n * @typedef {Exclude | undefined} Test\n * Test from `unist-util-is`.\n *\n * Note: we have remove and add `undefined`, because otherwise when generating\n * automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n * which doesn’t work when publishing on npm.\n */\n\n// To do: use types from `unist-util-visit-parents` when it’s released.\n\n/**\n * @typedef {(\n * Fn extends (value: any) => value is infer Thing\n * ? Thing\n * : Fallback\n * )} Predicate\n * Get the value of a type guard `Fn`.\n * @template Fn\n * Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n * Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n * Check extends null | undefined // No test.\n * ? Value\n * : Value extends {type: Check} // String (type) test.\n * ? Value\n * : Value extends Check // Partial test.\n * ? Value\n * : Check extends Function // Function test.\n * ? Predicate extends Value\n * ? Predicate\n * : never\n * : never // Some other test?\n * )} MatchesOne\n * Check whether a node matches a primitive check in the type system.\n * @template Value\n * Value; typically unist `Node`.\n * @template Check\n * Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n * Check extends Array\n * ? MatchesOne\n * : MatchesOne\n * )} Matches\n * Check whether a node matches a check in the type system.\n * @template Value\n * Value; typically unist `Node`.\n * @template Check\n * Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n * Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n * Increment a number in the type system.\n * @template {Uint} [I=0]\n * Index.\n */\n\n/**\n * @typedef {(\n * Node extends UnistParent\n * ? Node extends {children: Array}\n * ? Child extends Children ? Node : never\n * : never\n * : never\n * )} InternalParent\n * Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n * All node types in a tree.\n * @template {UnistNode} Child\n * Node to search for.\n */\n\n/**\n * @typedef {InternalParent, Child>} Parent\n * Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n * All node types in a tree.\n * @template {UnistNode} Child\n * Node to search for.\n */\n\n/**\n * @typedef {(\n * Depth extends Max\n * ? never\n * :\n * | InternalParent\n * | InternalAncestor, Max, Increment>\n * )} InternalAncestor\n * Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n * All node types in a tree.\n * @template {UnistNode} Child\n * Node to search for.\n * @template {Uint} [Max=10]\n * Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n * Current depth.\n */\n\n/**\n * @typedef {(\n * Tree extends UnistParent\n * ? Depth extends Max\n * ? Tree\n * : Tree | InclusiveDescendant>\n * : Tree\n * )} InclusiveDescendant\n * Collect all (inclusive) descendants of `Tree`.\n *\n * > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n * > recurse without actually running into an infinite loop, which the\n * > previous version did.\n * >\n * > Practically, a max of `2` is typically enough assuming a `Root` is\n * > passed, but it doesn’t improve performance.\n * > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n * > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n * Tree type.\n * @template {Uint} [Max=10]\n * Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n * Current depth.\n */\n\n/**\n * @callback Visitor\n * Handle a node (matching `test`, if given).\n *\n * Visitors are free to transform `node`.\n * They can also transform `parent`.\n *\n * Replacing `node` itself, if `SKIP` is not returned, still causes its\n * descendants to be walked (which is a bug).\n *\n * When adding or removing previous siblings of `node` (or next siblings, in\n * case of reverse), the `Visitor` should return a new `Index` to specify the\n * sibling to traverse after `node` is traversed.\n * Adding or removing next siblings of `node` (or previous siblings, in case\n * of reverse) is handled as expected without needing to return a new `Index`.\n *\n * Removing the children property of `parent` still results in them being\n * traversed.\n * @param {Visited} node\n * Found node.\n * @param {Visited extends UnistNode ? number | undefined : never} index\n * Index of `node` in `parent`.\n * @param {Ancestor extends UnistParent ? Ancestor | undefined : never} parent\n * Parent of `node`.\n * @returns {VisitorResult}\n * What to do next.\n *\n * An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n * An `Action` is treated as a tuple of `[Action]`.\n *\n * Passing a tuple back only makes sense if the `Action` is `SKIP`.\n * When the `Action` is `EXIT`, that action can be returned.\n * When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n * Visited node type.\n * @template {UnistParent} [Ancestor=UnistParent]\n * Ancestor type.\n */\n\n/**\n * @typedef {Visitor>} BuildVisitorFromMatch\n * Build a typed `Visitor` function from a node and all possible parents.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Visited\n * Node type.\n * @template {UnistParent} Ancestor\n * Parent type.\n */\n\n/**\n * @typedef {(\n * BuildVisitorFromMatch<\n * Matches,\n * Extract\n * >\n * )} BuildVisitorFromDescendants\n * Build a typed `Visitor` function from a list of descendants and a test.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Descendant\n * Node type.\n * @template {Test} Check\n * Test type.\n */\n\n/**\n * @typedef {(\n * BuildVisitorFromDescendants<\n * InclusiveDescendant,\n * Check\n * >\n * )} BuildVisitor\n * Build a typed `Visitor` function from a tree and a test.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} [Tree=UnistNode]\n * Node type.\n * @template {Test} [Check=Test]\n * Test type.\n */\n\nimport {visitParents} from 'unist-util-visit-parents'\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n\n/**\n * Visit nodes.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n * Tree to traverse.\n * @param {Visitor | Test} testOrVisitor\n * `unist-util-is`-compatible test (optional, omit to pass a visitor).\n * @param {Visitor | boolean | null | undefined} [visitorOrReverse]\n * Handle each node (when test is omitted, pass `reverse`).\n * @param {boolean | null | undefined} [maybeReverse=false]\n * Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n * Nothing.\n *\n * @template {UnistNode} Tree\n * Node type.\n * @template {Test} Check\n * `unist-util-is`-compatible test.\n */\nexport function visit(tree, testOrVisitor, visitorOrReverse, maybeReverse) {\n /** @type {boolean | null | undefined} */\n let reverse\n /** @type {Test} */\n let test\n /** @type {Visitor} */\n let visitor\n\n if (\n typeof testOrVisitor === 'function' &&\n typeof visitorOrReverse !== 'function'\n ) {\n test = undefined\n visitor = testOrVisitor\n reverse = visitorOrReverse\n } else {\n // @ts-expect-error: assume the overload with test was given.\n test = testOrVisitor\n // @ts-expect-error: assume the overload with test was given.\n visitor = visitorOrReverse\n reverse = maybeReverse\n }\n\n visitParents(tree, test, overload, reverse)\n\n /**\n * @param {UnistNode} node\n * @param {Array} parents\n */\n function overload(node, parents) {\n const parent = parents[parents.length - 1]\n const index = parent ? parent.children.indexOf(node) : undefined\n return visitor(node, index, parent)\n }\n}\n","/**\n * @typedef {import('mdast').Nodes} Nodes\n *\n * @typedef Options\n * Configuration (optional).\n * @property {boolean | null | undefined} [includeImageAlt=true]\n * Whether to use `alt` for `image`s (default: `true`).\n * @property {boolean | null | undefined} [includeHtml=true]\n * Whether to use `value` of HTML (default: `true`).\n */\n\n/** @type {Options} */\nconst emptyOptions = {}\n\n/**\n * Get the text content of a node or list of nodes.\n *\n * Prefers the node’s plain-text fields, otherwise serializes its children,\n * and if the given value is an array, serialize the nodes in it.\n *\n * @param {unknown} [value]\n * Thing to serialize, typically `Node`.\n * @param {Options | null | undefined} [options]\n * Configuration (optional).\n * @returns {string}\n * Serialized `value`.\n */\nexport function toString(value, options) {\n const settings = options || emptyOptions\n const includeImageAlt =\n typeof settings.includeImageAlt === 'boolean'\n ? settings.includeImageAlt\n : true\n const includeHtml =\n typeof settings.includeHtml === 'boolean' ? settings.includeHtml : true\n\n return one(value, includeImageAlt, includeHtml)\n}\n\n/**\n * One node or several nodes.\n *\n * @param {unknown} value\n * Thing to serialize.\n * @param {boolean} includeImageAlt\n * Include image `alt`s.\n * @param {boolean} includeHtml\n * Include HTML.\n * @returns {string}\n * Serialized node.\n */\nfunction one(value, includeImageAlt, includeHtml) {\n if (node(value)) {\n if ('value' in value) {\n return value.type === 'html' && !includeHtml ? '' : value.value\n }\n\n if (includeImageAlt && 'alt' in value && value.alt) {\n return value.alt\n }\n\n if ('children' in value) {\n return all(value.children, includeImageAlt, includeHtml)\n }\n }\n\n if (Array.isArray(value)) {\n return all(value, includeImageAlt, includeHtml)\n }\n\n return ''\n}\n\n/**\n * Serialize a list of nodes.\n *\n * @param {Array} values\n * Thing to serialize.\n * @param {boolean} includeImageAlt\n * Include image `alt`s.\n * @param {boolean} includeHtml\n * Include HTML.\n * @returns {string}\n * Serialized nodes.\n */\nfunction all(values, includeImageAlt, includeHtml) {\n /** @type {Array} */\n const result = []\n let index = -1\n\n while (++index < values.length) {\n result[index] = one(values[index], includeImageAlt, includeHtml)\n }\n\n return result.join('')\n}\n\n/**\n * Check if `value` looks like a node.\n *\n * @param {unknown} value\n * Thing.\n * @returns {value is Nodes}\n * Whether `value` is a node.\n */\nfunction node(value) {\n return Boolean(value && typeof value === 'object')\n}\n","/**\n * @import {State} from 'mdast-util-to-markdown'\n * @import {Heading} from 'mdast'\n */\n\nimport {EXIT, visit} from 'unist-util-visit'\nimport {toString} from 'mdast-util-to-string'\n\n/**\n * @param {Heading} node\n * @param {State} state\n * @returns {boolean}\n */\nexport function formatHeadingAsSetext(node, state) {\n let literalWithBreak = false\n\n // Look for literals with a line break.\n // Note that this also\n visit(node, function (node) {\n if (\n ('value' in node && /\\r?\\n|\\r/.test(node.value)) ||\n node.type === 'break'\n ) {\n literalWithBreak = true\n return EXIT\n }\n })\n\n return Boolean(\n (!node.depth || node.depth < 3) &&\n toString(node) &&\n (state.options.setext || literalWithBreak)\n )\n}\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {Heading, Parents} from 'mdast'\n */\n\nimport {encodeCharacterReference} from '../util/encode-character-reference.js'\nimport {formatHeadingAsSetext} from '../util/format-heading-as-setext.js'\n\n/**\n * @param {Heading} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function heading(node, _, state, info) {\n const rank = Math.max(Math.min(6, node.depth || 1), 1)\n const tracker = state.createTracker(info)\n\n if (formatHeadingAsSetext(node, state)) {\n const exit = state.enter('headingSetext')\n const subexit = state.enter('phrasing')\n const value = state.containerPhrasing(node, {\n ...tracker.current(),\n before: '\\n',\n after: '\\n'\n })\n subexit()\n exit()\n\n return (\n value +\n '\\n' +\n (rank === 1 ? '=' : '-').repeat(\n // The whole size…\n value.length -\n // Minus the position of the character after the last EOL (or\n // 0 if there is none)…\n (Math.max(value.lastIndexOf('\\r'), value.lastIndexOf('\\n')) + 1)\n )\n )\n }\n\n const sequence = '#'.repeat(rank)\n const exit = state.enter('headingAtx')\n const subexit = state.enter('phrasing')\n\n // Note: for proper tracking, we should reset the output positions when there\n // is no content returned, because then the space is not output.\n // Practically, in that case, there is no content, so it doesn’t matter that\n // we’ve tracked one too many characters.\n tracker.move(sequence + ' ')\n\n let value = state.containerPhrasing(node, {\n before: '# ',\n after: '\\n',\n ...tracker.current()\n })\n\n if (/^[\\t ]/.test(value)) {\n // To do: what effect has the character reference on tracking?\n value = encodeCharacterReference(value.charCodeAt(0)) + value.slice(1)\n }\n\n value = value ? sequence + ' ' + value : sequence\n\n if (state.options.closeAtx) {\n value += ' ' + sequence\n }\n\n subexit()\n exit()\n\n return value\n}\n","/**\n * @import {Html} from 'mdast'\n */\n\nhtml.peek = htmlPeek\n\n/**\n * @param {Html} node\n * @returns {string}\n */\nexport function html(node) {\n return node.value || ''\n}\n\n/**\n * @returns {string}\n */\nfunction htmlPeek() {\n return '<'\n}\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {Image, Parents} from 'mdast'\n */\n\nimport {checkQuote} from '../util/check-quote.js'\n\nimage.peek = imagePeek\n\n/**\n * @param {Image} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function image(node, _, state, info) {\n const quote = checkQuote(state)\n const suffix = quote === '\"' ? 'Quote' : 'Apostrophe'\n const exit = state.enter('image')\n let subexit = state.enter('label')\n const tracker = state.createTracker(info)\n let value = tracker.move('![')\n value += tracker.move(\n state.safe(node.alt, {before: value, after: ']', ...tracker.current()})\n )\n value += tracker.move('](')\n\n subexit()\n\n if (\n // If there’s no url but there is a title…\n (!node.url && node.title) ||\n // If there are control characters or whitespace.\n /[\\0- \\u007F]/.test(node.url)\n ) {\n subexit = state.enter('destinationLiteral')\n value += tracker.move('<')\n value += tracker.move(\n state.safe(node.url, {before: value, after: '>', ...tracker.current()})\n )\n value += tracker.move('>')\n } else {\n // No whitespace, raw is prettier.\n subexit = state.enter('destinationRaw')\n value += tracker.move(\n state.safe(node.url, {\n before: value,\n after: node.title ? ' ' : ')',\n ...tracker.current()\n })\n )\n }\n\n subexit()\n\n if (node.title) {\n subexit = state.enter(`title${suffix}`)\n value += tracker.move(' ' + quote)\n value += tracker.move(\n state.safe(node.title, {\n before: value,\n after: quote,\n ...tracker.current()\n })\n )\n value += tracker.move(quote)\n subexit()\n }\n\n value += tracker.move(')')\n exit()\n\n return value\n}\n\n/**\n * @returns {string}\n */\nfunction imagePeek() {\n return '!'\n}\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {ImageReference, Parents} from 'mdast'\n */\n\nimageReference.peek = imageReferencePeek\n\n/**\n * @param {ImageReference} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function imageReference(node, _, state, info) {\n const type = node.referenceType\n const exit = state.enter('imageReference')\n let subexit = state.enter('label')\n const tracker = state.createTracker(info)\n let value = tracker.move('![')\n const alt = state.safe(node.alt, {\n before: value,\n after: ']',\n ...tracker.current()\n })\n value += tracker.move(alt + '][')\n\n subexit()\n // Hide the fact that we’re in phrasing, because escapes don’t work.\n const stack = state.stack\n state.stack = []\n subexit = state.enter('reference')\n // Note: for proper tracking, we should reset the output positions when we end\n // up making a `shortcut` reference, because then there is no brace output.\n // Practically, in that case, there is no content, so it doesn’t matter that\n // we’ve tracked one too many characters.\n const reference = state.safe(state.associationId(node), {\n before: value,\n after: ']',\n ...tracker.current()\n })\n subexit()\n state.stack = stack\n exit()\n\n if (type === 'full' || !alt || alt !== reference) {\n value += tracker.move(reference + ']')\n } else if (type === 'shortcut') {\n // Remove the unwanted `[`.\n value = value.slice(0, -1)\n } else {\n value += tracker.move(']')\n }\n\n return value\n}\n\n/**\n * @returns {string}\n */\nfunction imageReferencePeek() {\n return '!'\n}\n","/**\n * @import {State} from 'mdast-util-to-markdown'\n * @import {InlineCode, Parents} from 'mdast'\n */\n\ninlineCode.peek = inlineCodePeek\n\n/**\n * @param {InlineCode} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @returns {string}\n */\nexport function inlineCode(node, _, state) {\n let value = node.value || ''\n let sequence = '`'\n let index = -1\n\n // If there is a single grave accent on its own in the code, use a fence of\n // two.\n // If there are two in a row, use one.\n while (new RegExp('(^|[^`])' + sequence + '([^`]|$)').test(value)) {\n sequence += '`'\n }\n\n // If this is not just spaces or eols (tabs don’t count), and either the\n // first or last character are a space, eol, or tick, then pad with spaces.\n if (\n /[^ \\r\\n]/.test(value) &&\n ((/^[ \\r\\n]/.test(value) && /[ \\r\\n]$/.test(value)) || /^`|`$/.test(value))\n ) {\n value = ' ' + value + ' '\n }\n\n // We have a potential problem: certain characters after eols could result in\n // blocks being seen.\n // For example, if someone injected the string `'\\n# b'`, then that would\n // result in an ATX heading.\n // We can’t escape characters in `inlineCode`, but because eols are\n // transformed to spaces when going from markdown to HTML anyway, we can swap\n // them out.\n while (++index < state.unsafe.length) {\n const pattern = state.unsafe[index]\n const expression = state.compilePattern(pattern)\n /** @type {RegExpExecArray | null} */\n let match\n\n // Only look for `atBreak`s.\n // Btw: note that `atBreak` patterns will always start the regex at LF or\n // CR.\n if (!pattern.atBreak) continue\n\n while ((match = expression.exec(value))) {\n let position = match.index\n\n // Support CRLF (patterns only look for one of the characters).\n if (\n value.charCodeAt(position) === 10 /* `\\n` */ &&\n value.charCodeAt(position - 1) === 13 /* `\\r` */\n ) {\n position--\n }\n\n value = value.slice(0, position) + ' ' + value.slice(match.index + 1)\n }\n }\n\n return sequence + value + sequence\n}\n\n/**\n * @returns {string}\n */\nfunction inlineCodePeek() {\n return '`'\n}\n","/**\n * @import {State} from 'mdast-util-to-markdown'\n * @import {Link} from 'mdast'\n */\n\nimport {toString} from 'mdast-util-to-string'\n\n/**\n * @param {Link} node\n * @param {State} state\n * @returns {boolean}\n */\nexport function formatLinkAsAutolink(node, state) {\n const raw = toString(node)\n\n return Boolean(\n !state.options.resourceLink &&\n // If there’s a url…\n node.url &&\n // And there’s a no title…\n !node.title &&\n // And the content of `node` is a single text node…\n node.children &&\n node.children.length === 1 &&\n node.children[0].type === 'text' &&\n // And if the url is the same as the content…\n (raw === node.url || 'mailto:' + raw === node.url) &&\n // And that starts w/ a protocol…\n /^[a-z][a-z+.-]+:/i.test(node.url) &&\n // And that doesn’t contain ASCII control codes (character escapes and\n // references don’t work), space, or angle brackets…\n !/[\\0- <>\\u007F]/.test(node.url)\n )\n}\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {Link, Parents} from 'mdast'\n * @import {Exit} from '../types.js'\n */\n\nimport {checkQuote} from '../util/check-quote.js'\nimport {formatLinkAsAutolink} from '../util/format-link-as-autolink.js'\n\nlink.peek = linkPeek\n\n/**\n * @param {Link} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function link(node, _, state, info) {\n const quote = checkQuote(state)\n const suffix = quote === '\"' ? 'Quote' : 'Apostrophe'\n const tracker = state.createTracker(info)\n /** @type {Exit} */\n let exit\n /** @type {Exit} */\n let subexit\n\n if (formatLinkAsAutolink(node, state)) {\n // Hide the fact that we’re in phrasing, because escapes don’t work.\n const stack = state.stack\n state.stack = []\n exit = state.enter('autolink')\n let value = tracker.move('<')\n value += tracker.move(\n state.containerPhrasing(node, {\n before: value,\n after: '>',\n ...tracker.current()\n })\n )\n value += tracker.move('>')\n exit()\n state.stack = stack\n return value\n }\n\n exit = state.enter('link')\n subexit = state.enter('label')\n let value = tracker.move('[')\n value += tracker.move(\n state.containerPhrasing(node, {\n before: value,\n after: '](',\n ...tracker.current()\n })\n )\n value += tracker.move('](')\n subexit()\n\n if (\n // If there’s no url but there is a title…\n (!node.url && node.title) ||\n // If there are control characters or whitespace.\n /[\\0- \\u007F]/.test(node.url)\n ) {\n subexit = state.enter('destinationLiteral')\n value += tracker.move('<')\n value += tracker.move(\n state.safe(node.url, {before: value, after: '>', ...tracker.current()})\n )\n value += tracker.move('>')\n } else {\n // No whitespace, raw is prettier.\n subexit = state.enter('destinationRaw')\n value += tracker.move(\n state.safe(node.url, {\n before: value,\n after: node.title ? ' ' : ')',\n ...tracker.current()\n })\n )\n }\n\n subexit()\n\n if (node.title) {\n subexit = state.enter(`title${suffix}`)\n value += tracker.move(' ' + quote)\n value += tracker.move(\n state.safe(node.title, {\n before: value,\n after: quote,\n ...tracker.current()\n })\n )\n value += tracker.move(quote)\n subexit()\n }\n\n value += tracker.move(')')\n\n exit()\n return value\n}\n\n/**\n * @param {Link} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @returns {string}\n */\nfunction linkPeek(node, _, state) {\n return formatLinkAsAutolink(node, state) ? '<' : '['\n}\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {LinkReference, Parents} from 'mdast'\n */\n\nlinkReference.peek = linkReferencePeek\n\n/**\n * @param {LinkReference} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function linkReference(node, _, state, info) {\n const type = node.referenceType\n const exit = state.enter('linkReference')\n let subexit = state.enter('label')\n const tracker = state.createTracker(info)\n let value = tracker.move('[')\n const text = state.containerPhrasing(node, {\n before: value,\n after: ']',\n ...tracker.current()\n })\n value += tracker.move(text + '][')\n\n subexit()\n // Hide the fact that we’re in phrasing, because escapes don’t work.\n const stack = state.stack\n state.stack = []\n subexit = state.enter('reference')\n // Note: for proper tracking, we should reset the output positions when we end\n // up making a `shortcut` reference, because then there is no brace output.\n // Practically, in that case, there is no content, so it doesn’t matter that\n // we’ve tracked one too many characters.\n const reference = state.safe(state.associationId(node), {\n before: value,\n after: ']',\n ...tracker.current()\n })\n subexit()\n state.stack = stack\n exit()\n\n if (type === 'full' || !text || text !== reference) {\n value += tracker.move(reference + ']')\n } else if (type === 'shortcut') {\n // Remove the unwanted `[`.\n value = value.slice(0, -1)\n } else {\n value += tracker.move(']')\n }\n\n return value\n}\n\n/**\n * @returns {string}\n */\nfunction linkReferencePeek() {\n return '['\n}\n","/**\n * @import {Options, State} from 'mdast-util-to-markdown'\n */\n\n/**\n * @param {State} state\n * @returns {Exclude}\n */\nexport function checkBullet(state) {\n const marker = state.options.bullet || '*'\n\n if (marker !== '*' && marker !== '+' && marker !== '-') {\n throw new Error(\n 'Cannot serialize items with `' +\n marker +\n '` for `options.bullet`, expected `*`, `+`, or `-`'\n )\n }\n\n return marker\n}\n","/**\n * @import {Options, State} from 'mdast-util-to-markdown'\n */\n\nimport {checkBullet} from './check-bullet.js'\n\n/**\n * @param {State} state\n * @returns {Exclude}\n */\nexport function checkBulletOther(state) {\n const bullet = checkBullet(state)\n const bulletOther = state.options.bulletOther\n\n if (!bulletOther) {\n return bullet === '*' ? '-' : '*'\n }\n\n if (bulletOther !== '*' && bulletOther !== '+' && bulletOther !== '-') {\n throw new Error(\n 'Cannot serialize items with `' +\n bulletOther +\n '` for `options.bulletOther`, expected `*`, `+`, or `-`'\n )\n }\n\n if (bulletOther === bullet) {\n throw new Error(\n 'Expected `bullet` (`' +\n bullet +\n '`) and `bulletOther` (`' +\n bulletOther +\n '`) to be different'\n )\n }\n\n return bulletOther\n}\n","/**\n * @import {Options, State} from 'mdast-util-to-markdown'\n */\n\n/**\n * @param {State} state\n * @returns {Exclude}\n */\nexport function checkBulletOrdered(state) {\n const marker = state.options.bulletOrdered || '.'\n\n if (marker !== '.' && marker !== ')') {\n throw new Error(\n 'Cannot serialize items with `' +\n marker +\n '` for `options.bulletOrdered`, expected `.` or `)`'\n )\n }\n\n return marker\n}\n","/**\n * @import {Options, State} from 'mdast-util-to-markdown'\n */\n\n/**\n * @param {State} state\n * @returns {Exclude}\n */\nexport function checkRule(state) {\n const marker = state.options.rule || '*'\n\n if (marker !== '*' && marker !== '-' && marker !== '_') {\n throw new Error(\n 'Cannot serialize rules with `' +\n marker +\n '` for `options.rule`, expected `*`, `-`, or `_`'\n )\n }\n\n return marker\n}\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {List, Parents} from 'mdast'\n */\n\nimport {checkBullet} from '../util/check-bullet.js'\nimport {checkBulletOther} from '../util/check-bullet-other.js'\nimport {checkBulletOrdered} from '../util/check-bullet-ordered.js'\nimport {checkRule} from '../util/check-rule.js'\n\n/**\n * @param {List} node\n * @param {Parents | undefined} parent\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function list(node, parent, state, info) {\n const exit = state.enter('list')\n const bulletCurrent = state.bulletCurrent\n /** @type {string} */\n let bullet = node.ordered ? checkBulletOrdered(state) : checkBullet(state)\n /** @type {string} */\n const bulletOther = node.ordered\n ? bullet === '.'\n ? ')'\n : '.'\n : checkBulletOther(state)\n let useDifferentMarker =\n parent && state.bulletLastUsed ? bullet === state.bulletLastUsed : false\n\n if (!node.ordered) {\n const firstListItem = node.children ? node.children[0] : undefined\n\n // If there’s an empty first list item directly in two list items,\n // we have to use a different bullet:\n //\n // ```markdown\n // * - *\n // ```\n //\n // …because otherwise it would become one big thematic break.\n if (\n // Bullet could be used as a thematic break marker:\n (bullet === '*' || bullet === '-') &&\n // Empty first list item:\n firstListItem &&\n (!firstListItem.children || !firstListItem.children[0]) &&\n // Directly in two other list items:\n state.stack[state.stack.length - 1] === 'list' &&\n state.stack[state.stack.length - 2] === 'listItem' &&\n state.stack[state.stack.length - 3] === 'list' &&\n state.stack[state.stack.length - 4] === 'listItem' &&\n // That are each the first child.\n state.indexStack[state.indexStack.length - 1] === 0 &&\n state.indexStack[state.indexStack.length - 2] === 0 &&\n state.indexStack[state.indexStack.length - 3] === 0\n ) {\n useDifferentMarker = true\n }\n\n // If there’s a thematic break at the start of the first list item,\n // we have to use a different bullet:\n //\n // ```markdown\n // * ---\n // ```\n //\n // …because otherwise it would become one big thematic break.\n if (checkRule(state) === bullet && firstListItem) {\n let index = -1\n\n while (++index < node.children.length) {\n const item = node.children[index]\n\n if (\n item &&\n item.type === 'listItem' &&\n item.children &&\n item.children[0] &&\n item.children[0].type === 'thematicBreak'\n ) {\n useDifferentMarker = true\n break\n }\n }\n }\n }\n\n if (useDifferentMarker) {\n bullet = bulletOther\n }\n\n state.bulletCurrent = bullet\n const value = state.containerFlow(node, info)\n state.bulletLastUsed = bullet\n state.bulletCurrent = bulletCurrent\n exit()\n return value\n}\n","/**\n * @import {Options, State} from 'mdast-util-to-markdown'\n */\n\n/**\n * @param {State} state\n * @returns {Exclude}\n */\nexport function checkListItemIndent(state) {\n const style = state.options.listItemIndent || 'one'\n\n if (style !== 'tab' && style !== 'one' && style !== 'mixed') {\n throw new Error(\n 'Cannot serialize items with `' +\n style +\n '` for `options.listItemIndent`, expected `tab`, `one`, or `mixed`'\n )\n }\n\n return style\n}\n","/**\n * @import {Info, Map, State} from 'mdast-util-to-markdown'\n * @import {ListItem, Parents} from 'mdast'\n */\n\nimport {checkBullet} from '../util/check-bullet.js'\nimport {checkListItemIndent} from '../util/check-list-item-indent.js'\n\n/**\n * @param {ListItem} node\n * @param {Parents | undefined} parent\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function listItem(node, parent, state, info) {\n const listItemIndent = checkListItemIndent(state)\n let bullet = state.bulletCurrent || checkBullet(state)\n\n // Add the marker value for ordered lists.\n if (parent && parent.type === 'list' && parent.ordered) {\n bullet =\n (typeof parent.start === 'number' && parent.start > -1\n ? parent.start\n : 1) +\n (state.options.incrementListMarker === false\n ? 0\n : parent.children.indexOf(node)) +\n bullet\n }\n\n let size = bullet.length + 1\n\n if (\n listItemIndent === 'tab' ||\n (listItemIndent === 'mixed' &&\n ((parent && parent.type === 'list' && parent.spread) || node.spread))\n ) {\n size = Math.ceil(size / 4) * 4\n }\n\n const tracker = state.createTracker(info)\n tracker.move(bullet + ' '.repeat(size - bullet.length))\n tracker.shift(size)\n const exit = state.enter('listItem')\n const value = state.indentLines(\n state.containerFlow(node, tracker.current()),\n map\n )\n exit()\n\n return value\n\n /** @type {Map} */\n function map(line, index, blank) {\n if (index) {\n return (blank ? '' : ' '.repeat(size)) + line\n }\n\n return (blank ? bullet : bullet + ' '.repeat(size - bullet.length)) + line\n }\n}\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {Paragraph, Parents} from 'mdast'\n */\n\n/**\n * @param {Paragraph} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function paragraph(node, _, state, info) {\n const exit = state.enter('paragraph')\n const subexit = state.enter('phrasing')\n const value = state.containerPhrasing(node, info)\n subexit()\n exit()\n return value\n}\n","/**\n * @typedef {import('mdast').Html} Html\n * @typedef {import('mdast').PhrasingContent} PhrasingContent\n */\n\nimport {convert} from 'unist-util-is'\n\n/**\n * Check if the given value is *phrasing content*.\n *\n * > 👉 **Note**: Excludes `html`, which can be both phrasing or flow.\n *\n * @param node\n * Thing to check, typically `Node`.\n * @returns\n * Whether `value` is phrasing content.\n */\n\nexport const phrasing =\n /** @type {(node?: unknown) => node is Exclude} */\n (\n convert([\n 'break',\n 'delete',\n 'emphasis',\n // To do: next major: removed since footnotes were added to GFM.\n 'footnote',\n 'footnoteReference',\n 'image',\n 'imageReference',\n 'inlineCode',\n // Enabled by `mdast-util-math`:\n 'inlineMath',\n 'link',\n 'linkReference',\n // Enabled by `mdast-util-mdx`:\n 'mdxJsxTextElement',\n // Enabled by `mdast-util-mdx`:\n 'mdxTextExpression',\n 'strong',\n 'text',\n // Enabled by `mdast-util-directive`:\n 'textDirective'\n ])\n )\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {Parents, Root} from 'mdast'\n */\n\nimport {phrasing} from 'mdast-util-phrasing'\n\n/**\n * @param {Root} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function root(node, _, state, info) {\n // Note: `html` nodes are ambiguous.\n const hasPhrasing = node.children.some(function (d) {\n return phrasing(d)\n })\n\n const container = hasPhrasing ? state.containerPhrasing : state.containerFlow\n return container.call(state, node, info)\n}\n","/**\n * @import {Options, State} from 'mdast-util-to-markdown'\n */\n\n/**\n * @param {State} state\n * @returns {Exclude}\n */\nexport function checkStrong(state) {\n const marker = state.options.strong || '*'\n\n if (marker !== '*' && marker !== '_') {\n throw new Error(\n 'Cannot serialize strong with `' +\n marker +\n '` for `options.strong`, expected `*`, or `_`'\n )\n }\n\n return marker\n}\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {Parents, Strong} from 'mdast'\n */\n\nimport {checkStrong} from '../util/check-strong.js'\nimport {encodeCharacterReference} from '../util/encode-character-reference.js'\nimport {encodeInfo} from '../util/encode-info.js'\n\nstrong.peek = strongPeek\n\n/**\n * @param {Strong} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function strong(node, _, state, info) {\n const marker = checkStrong(state)\n const exit = state.enter('strong')\n const tracker = state.createTracker(info)\n const before = tracker.move(marker + marker)\n\n let between = tracker.move(\n state.containerPhrasing(node, {\n after: marker,\n before,\n ...tracker.current()\n })\n )\n const betweenHead = between.charCodeAt(0)\n const open = encodeInfo(\n info.before.charCodeAt(info.before.length - 1),\n betweenHead,\n marker\n )\n\n if (open.inside) {\n between = encodeCharacterReference(betweenHead) + between.slice(1)\n }\n\n const betweenTail = between.charCodeAt(between.length - 1)\n const close = encodeInfo(info.after.charCodeAt(0), betweenTail, marker)\n\n if (close.inside) {\n between = between.slice(0, -1) + encodeCharacterReference(betweenTail)\n }\n\n const after = tracker.move(marker + marker)\n\n exit()\n\n state.attentionEncodeSurroundingInfo = {\n after: close.outside,\n before: open.outside\n }\n return before + between + after\n}\n\n/**\n * @param {Strong} _\n * @param {Parents | undefined} _1\n * @param {State} state\n * @returns {string}\n */\nfunction strongPeek(_, _1, state) {\n return state.options.strong || '*'\n}\n","/**\n * @import {Info, State} from 'mdast-util-to-markdown'\n * @import {Parents, Text} from 'mdast'\n */\n\n/**\n * @param {Text} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function text(node, _, state, info) {\n return state.safe(node.value, info)\n}\n","/**\n * @import {Options, State} from 'mdast-util-to-markdown'\n */\n\n/**\n * @param {State} state\n * @returns {Exclude}\n */\nexport function checkRuleRepetition(state) {\n const repetition = state.options.ruleRepetition || 3\n\n if (repetition < 3) {\n throw new Error(\n 'Cannot serialize rules with repetition `' +\n repetition +\n '` for `options.ruleRepetition`, expected `3` or more'\n )\n }\n\n return repetition\n}\n","/**\n * @import {State} from 'mdast-util-to-markdown'\n * @import {Parents, ThematicBreak} from 'mdast'\n */\n\nimport {checkRuleRepetition} from '../util/check-rule-repetition.js'\nimport {checkRule} from '../util/check-rule.js'\n\n/**\n * @param {ThematicBreak} _\n * @param {Parents | undefined} _1\n * @param {State} state\n * @returns {string}\n */\nexport function thematicBreak(_, _1, state) {\n const value = (\n checkRule(state) + (state.options.ruleSpaces ? ' ' : '')\n ).repeat(checkRuleRepetition(state))\n\n return state.options.ruleSpaces ? value.slice(0, -1) : value\n}\n","import {blockquote} from './blockquote.js'\nimport {hardBreak} from './break.js'\nimport {code} from './code.js'\nimport {definition} from './definition.js'\nimport {emphasis} from './emphasis.js'\nimport {heading} from './heading.js'\nimport {html} from './html.js'\nimport {image} from './image.js'\nimport {imageReference} from './image-reference.js'\nimport {inlineCode} from './inline-code.js'\nimport {link} from './link.js'\nimport {linkReference} from './link-reference.js'\nimport {list} from './list.js'\nimport {listItem} from './list-item.js'\nimport {paragraph} from './paragraph.js'\nimport {root} from './root.js'\nimport {strong} from './strong.js'\nimport {text} from './text.js'\nimport {thematicBreak} from './thematic-break.js'\n\n/**\n * Default (CommonMark) handlers.\n */\nexport const handle = {\n blockquote,\n break: hardBreak,\n code,\n definition,\n emphasis,\n hardBreak,\n heading,\n html,\n image,\n imageReference,\n inlineCode,\n link,\n linkReference,\n list,\n listItem,\n paragraph,\n root,\n strong,\n text,\n thematicBreak\n}\n","/**\n * @typedef {import('mdast').ListItem} ListItem\n * @typedef {import('mdast').Paragraph} Paragraph\n * @typedef {import('mdast-util-from-markdown').CompileContext} CompileContext\n * @typedef {import('mdast-util-from-markdown').Extension} FromMarkdownExtension\n * @typedef {import('mdast-util-from-markdown').Handle} FromMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownExtension\n * @typedef {import('mdast-util-to-markdown').Handle} ToMarkdownHandle\n */\n\nimport {ok as assert} from 'devlop'\nimport {defaultHandlers} from 'mdast-util-to-markdown'\n\n/**\n * Create an extension for `mdast-util-from-markdown` to enable GFM task\n * list items in markdown.\n *\n * @returns {FromMarkdownExtension}\n * Extension for `mdast-util-from-markdown` to enable GFM task list items.\n */\nexport function gfmTaskListItemFromMarkdown() {\n return {\n exit: {\n taskListCheckValueChecked: exitCheck,\n taskListCheckValueUnchecked: exitCheck,\n paragraph: exitParagraphWithTaskListItem\n }\n }\n}\n\n/**\n * Create an extension for `mdast-util-to-markdown` to enable GFM task list\n * items in markdown.\n *\n * @returns {ToMarkdownExtension}\n * Extension for `mdast-util-to-markdown` to enable GFM task list items.\n */\nexport function gfmTaskListItemToMarkdown() {\n return {\n unsafe: [{atBreak: true, character: '-', after: '[:|-]'}],\n handlers: {listItem: listItemWithTaskListItem}\n }\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitCheck(token) {\n // We’re always in a paragraph, in a list item.\n const node = this.stack[this.stack.length - 2]\n assert(node.type === 'listItem')\n node.checked = token.type === 'taskListCheckValueChecked'\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitParagraphWithTaskListItem(token) {\n const parent = this.stack[this.stack.length - 2]\n\n if (\n parent &&\n parent.type === 'listItem' &&\n typeof parent.checked === 'boolean'\n ) {\n const node = this.stack[this.stack.length - 1]\n assert(node.type === 'paragraph')\n const head = node.children[0]\n\n if (head && head.type === 'text') {\n const siblings = parent.children\n let index = -1\n /** @type {Paragraph | undefined} */\n let firstParaghraph\n\n while (++index < siblings.length) {\n const sibling = siblings[index]\n if (sibling.type === 'paragraph') {\n firstParaghraph = sibling\n break\n }\n }\n\n if (firstParaghraph === node) {\n // Must start with a space or a tab.\n head.value = head.value.slice(1)\n\n if (head.value.length === 0) {\n node.children.shift()\n } else if (\n node.position &&\n head.position &&\n typeof head.position.start.offset === 'number'\n ) {\n head.position.start.column++\n head.position.start.offset++\n node.position.start = Object.assign({}, head.position.start)\n }\n }\n }\n }\n\n this.exit(token)\n}\n\n/**\n * @type {ToMarkdownHandle}\n * @param {ListItem} node\n */\nfunction listItemWithTaskListItem(node, parent, state, info) {\n const head = node.children[0]\n const checkable =\n typeof node.checked === 'boolean' && head && head.type === 'paragraph'\n const checkbox = '[' + (node.checked ? 'x' : ' ') + '] '\n const tracker = state.createTracker(info)\n\n if (checkable) {\n tracker.move(checkbox)\n }\n\n let value = defaultHandlers.listItem(node, parent, state, {\n ...info,\n ...tracker.current()\n })\n\n if (checkable) {\n value = value.replace(/^(?:[*+-]|\\d+\\.)([\\r\\n]| {1,3})/, check)\n }\n\n return value\n\n /**\n * @param {string} $0\n * @returns {string}\n */\n function check($0) {\n return $0 + checkbox\n }\n}\n","/**\n * @import {Effects, State, TokenType} from 'micromark-util-types'\n */\n\nimport { markdownSpace } from 'micromark-util-character';\n\n// To do: implement `spaceOrTab`, `spaceOrTabMinMax`, `spaceOrTabWithOptions`.\n\n/**\n * Parse spaces and tabs.\n *\n * There is no `nok` parameter:\n *\n * * spaces in markdown are often optional, in which case this factory can be\n * used and `ok` will be switched to whether spaces were found or not\n * * one line ending or space can be detected with `markdownSpace(code)` right\n * before using `factorySpace`\n *\n * ###### Examples\n *\n * Where `␉` represents a tab (plus how much it expands) and `␠` represents a\n * single space.\n *\n * ```markdown\n * ␉\n * ␠␠␠␠\n * ␉␠\n * ```\n *\n * @param {Effects} effects\n * Context.\n * @param {State} ok\n * State switched to when successful.\n * @param {TokenType} type\n * Type (`' \\t'`).\n * @param {number | undefined} [max=Infinity]\n * Max (exclusive).\n * @returns {State}\n * Start state.\n */\nexport function factorySpace(effects, ok, type, max) {\n const limit = max ? max - 1 : Number.POSITIVE_INFINITY;\n let size = 0;\n return start;\n\n /** @type {State} */\n function start(code) {\n if (markdownSpace(code)) {\n effects.enter(type);\n return prefix(code);\n }\n return ok(code);\n }\n\n /** @type {State} */\n function prefix(code) {\n if (markdownSpace(code) && size++ < limit) {\n effects.consume(code);\n return prefix;\n }\n effects.exit(type);\n return ok(code);\n }\n}","/**\n * @import {Extension, State, TokenizeContext, Tokenizer} from 'micromark-util-types'\n */\n\nimport { factorySpace } from 'micromark-factory-space';\nimport { markdownLineEnding, markdownLineEndingOrSpace, markdownSpace } from 'micromark-util-character';\nconst tasklistCheck = {\n name: 'tasklistCheck',\n tokenize: tokenizeTasklistCheck\n};\n\n/**\n * Create an HTML extension for `micromark` to support GFM task list items\n * syntax.\n *\n * @returns {Extension}\n * Extension for `micromark` that can be passed in `htmlExtensions` to\n * support GFM task list items when serializing to HTML.\n */\nexport function gfmTaskListItem() {\n return {\n text: {\n [91]: tasklistCheck\n }\n };\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeTasklistCheck(effects, ok, nok) {\n const self = this;\n return open;\n\n /**\n * At start of task list item check.\n *\n * ```markdown\n * > | * [x] y.\n * ^\n * ```\n *\n * @type {State}\n */\n function open(code) {\n if (\n // Exit if there’s stuff before.\n self.previous !== null ||\n // Exit if not in the first content that is the first child of a list\n // item.\n !self._gfmTasklistFirstContentOfListItem) {\n return nok(code);\n }\n effects.enter('taskListCheck');\n effects.enter('taskListCheckMarker');\n effects.consume(code);\n effects.exit('taskListCheckMarker');\n return inside;\n }\n\n /**\n * In task list item check.\n *\n * ```markdown\n * > | * [x] y.\n * ^\n * ```\n *\n * @type {State}\n */\n function inside(code) {\n // Currently we match how GH works in files.\n // To match how GH works in comments, use `markdownSpace` (`[\\t ]`) instead\n // of `markdownLineEndingOrSpace` (`[\\t\\n\\r ]`).\n if (markdownLineEndingOrSpace(code)) {\n effects.enter('taskListCheckValueUnchecked');\n effects.consume(code);\n effects.exit('taskListCheckValueUnchecked');\n return close;\n }\n if (code === 88 || code === 120) {\n effects.enter('taskListCheckValueChecked');\n effects.consume(code);\n effects.exit('taskListCheckValueChecked');\n return close;\n }\n return nok(code);\n }\n\n /**\n * At close of task list item check.\n *\n * ```markdown\n * > | * [x] y.\n * ^\n * ```\n *\n * @type {State}\n */\n function close(code) {\n if (code === 93) {\n effects.enter('taskListCheckMarker');\n effects.consume(code);\n effects.exit('taskListCheckMarker');\n effects.exit('taskListCheck');\n return after;\n }\n return nok(code);\n }\n\n /**\n * @type {State}\n */\n function after(code) {\n // EOL in paragraph means there must be something else after it.\n if (markdownLineEnding(code)) {\n return ok(code);\n }\n\n // Space or tab?\n // Check what comes after.\n if (markdownSpace(code)) {\n return effects.check({\n tokenize: spaceThenNonSpace\n }, ok, nok)(code);\n }\n\n // EOF, or non-whitespace, both wrong.\n return nok(code);\n }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction spaceThenNonSpace(effects, ok, nok) {\n return factorySpace(effects, after, \"whitespace\");\n\n /**\n * After whitespace, after task list item check.\n *\n * ```markdown\n * > | * [x] y.\n * ^\n * ```\n *\n * @type {State}\n */\n function after(code) {\n // EOF means there was nothing, so bad.\n // EOL means there’s content after it, so good.\n // Impossible to have more spaces.\n // Anything else is good.\n return code === null ? nok(code) : ok(code);\n }\n}","import type { BlockContent, DefinitionContent, ListItem } from \"mdast\";\nimport type {\n DOMOutputSpec,\n NodeSpec,\n Node as ProseMirrorNode,\n Schema,\n} from \"prosemirror-model\";\nimport type { Command, EditorState } from \"prosemirror-state\";\nimport type {\n EditorView,\n NodeView,\n NodeViewConstructor,\n} from \"prosemirror-view\";\nimport type { Processor } from \"unified\";\nimport type { Node as UnistNode } from \"unist\";\n\nimport {\n gfmTaskListItemFromMarkdown,\n gfmTaskListItemToMarkdown,\n} from \"mdast-util-gfm-task-list-item\";\nimport { gfmTaskListItem } from \"micromark-extension-gfm-task-list-item\";\nimport { InputRule } from \"prosemirror-inputrules\";\nimport { createProseMirrorNode, NodeExtension } from \"prosemirror-unified\";\n\nimport { buildUnifiedExtension } from \"../utils/buildUnifiedExtension\";\n\nclass TaskListItemView implements NodeView {\n public readonly contentDOM: HTMLElement;\n public readonly dom: HTMLElement;\n\n public constructor(\n node: ProseMirrorNode,\n view: EditorView,\n getPos: () => number | undefined,\n ) {\n const checkbox = document.createElement(\"input\");\n checkbox.setAttribute(\"type\", \"checkbox\");\n checkbox.setAttribute(\"style\", \"cursor: pointer;\");\n if (node.attrs[\"checked\"] === true) {\n checkbox.setAttribute(\"checked\", \"checked\");\n }\n checkbox.addEventListener(\"click\", (e) => {\n const pos = getPos();\n if (pos === undefined) {\n return;\n }\n e.preventDefault();\n view.dispatch(\n view.state.tr.setNodeAttribute(\n pos,\n \"checked\",\n !(node.attrs[\"checked\"] as boolean),\n ),\n );\n });\n\n const checkboxContainer = document.createElement(\"span\");\n checkboxContainer.setAttribute(\"contenteditable\", \"false\");\n checkboxContainer.setAttribute(\"style\", \"position: absolute; left: 5px;\");\n checkboxContainer.appendChild(checkbox);\n\n this.contentDOM = document.createElement(\"span\");\n this.contentDOM.setAttribute(\"style\", \"position: relative; left: 30px;\");\n\n this.dom = document.createElement(\"li\");\n this.dom.setAttribute(\n \"style\",\n \"list-style-type: none; margin-left: -30px;\",\n );\n this.dom.appendChild(checkboxContainer);\n this.dom.appendChild(this.contentDOM);\n }\n\n // eslint-disable-next-line @typescript-eslint/class-methods-use-this -- Inherited from the NodeView interface\n public stopEvent(): boolean {\n return true;\n }\n}\n\n/**\n * @public\n */\nexport class TaskListItemExtension extends NodeExtension {\n private static isAtStart(\n state: EditorState,\n view: EditorView | undefined,\n ): boolean {\n if (!state.selection.empty) {\n return false;\n }\n if (view !== undefined) {\n return view.endOfTextblock(\"backward\", state);\n }\n return state.selection.$anchor.parentOffset > 0;\n }\n\n public override proseMirrorInputRules(\n proseMirrorSchema: Schema,\n ): Array {\n return [\n new InputRule(/^\\[([x\\s]?)\\][\\s\\S]$/u, (state, match, start) => {\n const wrappingNode = state.doc.resolve(start).node(-1);\n if (wrappingNode.type.name !== \"regular_list_item\") {\n return null;\n }\n return state.tr.replaceRangeWith(\n start - 2,\n start + wrappingNode.nodeSize,\n proseMirrorSchema.nodes[this.proseMirrorNodeName()].create(\n { checked: match[1] === \"x\" },\n wrappingNode.content.cut(3 + match[1].length),\n ),\n );\n }),\n ];\n }\n\n public override proseMirrorKeymap(\n proseMirrorSchema: Schema,\n ): Record {\n return {\n Backspace: (state, dispatch, view): boolean => {\n if (!TaskListItemExtension.isAtStart(state, view)) {\n return false;\n }\n const taskListItemNode = state.selection.$anchor.node(-1);\n if (taskListItemNode.type.name !== \"task_list_item\") {\n return false;\n }\n if (dispatch === undefined) {\n return true;\n }\n dispatch(\n state.tr.replaceRangeWith(\n state.selection.$from.before() - 2,\n state.selection.$from.before() + taskListItemNode.nodeSize,\n proseMirrorSchema.nodes[\"regular_list_item\"].create(\n {},\n taskListItemNode.content,\n ),\n ),\n );\n return true;\n },\n };\n }\n\n public override proseMirrorNodeName(): string {\n return \"task_list_item\";\n }\n\n public override proseMirrorNodeSpec(): NodeSpec {\n return {\n attrs: { checked: { default: false } },\n content: \"paragraph block*\",\n defining: true,\n group: \"list_item\",\n parseDOM: [\n {\n getAttrs(dom: Node | string): false | { checked: boolean } {\n const checkbox = (dom as HTMLElement).firstChild;\n if (!(checkbox instanceof HTMLInputElement)) {\n return false;\n }\n return { checked: checkbox.checked };\n },\n tag: \"li\",\n },\n ],\n toDOM(node: ProseMirrorNode): DOMOutputSpec {\n return [\n \"li\",\n { style: \"list-style-type: none;, margin-left: -30px;\" },\n [\n \"span\",\n {\n contenteditable: \"false\",\n style: \"position: absolute; left: 5px;\",\n },\n [\n \"input\",\n {\n checked: (node.attrs[\"checked\"] as boolean)\n ? \"checked\"\n : undefined,\n disabled: \"disabled\",\n type: \"checkbox\",\n },\n ],\n ],\n [\"span\", { style: \"position: relative; left: 30px\" }, 0],\n ];\n },\n };\n }\n\n public override proseMirrorNodeToUnistNodes(\n node: ProseMirrorNode,\n convertedChildren: Array,\n ): Array {\n return [\n {\n checked: node.attrs[\"checked\"] as boolean,\n children: convertedChildren,\n type: this.unistNodeName(),\n },\n ];\n }\n\n public override proseMirrorNodeView(): NodeViewConstructor | null {\n return (node, view, getPos) => new TaskListItemView(node, view, getPos);\n }\n\n public override unifiedInitializationHook(\n processor: Processor,\n ): Processor {\n return processor.use(\n buildUnifiedExtension(\n [gfmTaskListItem()],\n [gfmTaskListItemFromMarkdown()],\n [gfmTaskListItemToMarkdown()],\n ),\n );\n }\n\n public override unistNodeName(): \"listItem\" {\n return \"listItem\";\n }\n\n public override unistNodeToProseMirrorNodes(\n node: ListItem,\n proseMirrorSchema: Schema,\n convertedChildren: Array,\n ): Array {\n return createProseMirrorNode(\n this.proseMirrorNodeName(),\n proseMirrorSchema,\n convertedChildren,\n { checked: node.checked },\n );\n }\n\n public override unistToProseMirrorTest(node: UnistNode): boolean {\n return (\n node.type === this.unistNodeName() &&\n \"checked\" in node &&\n typeof node.checked === \"boolean\"\n );\n }\n}\n","import { Extension } from \"prosemirror-unified\";\n\nimport { MarkdownExtension } from \"./MarkdownExtension\";\nimport { ExtendedAutolinkExtension } from \"./syntax-extensions/ExtendedAutolinkExtension\";\nimport { StrikethroughExtension } from \"./syntax-extensions/StrikethroughExtension\";\nimport { TaskListItemExtension } from \"./syntax-extensions/TaskListItemExtension\";\n\n/**\n * @public\n */\nexport class GFMExtension extends Extension {\n public override dependencies(): Array {\n return [\n new MarkdownExtension(),\n new ExtendedAutolinkExtension(),\n new StrikethroughExtension(),\n new TaskListItemExtension(),\n ];\n }\n}\n"],"names":["NodeExtension","wrappingInputRule","wrapIn","createProseMirrorNode","MarkExtension","MarkInputRule","toggleMark","chainCommands","exitCode","node","Selection","textblockTypeInputRule","setBlockType","InputRule","definition","splitListItem","liftListItem","sinkListItem","wrapInList","Extension","ok","code","index","all","visit","list","escape","assert","domain","path","trail","text","previous","map","exit","value","subexit","defaultHandlers"],"mappings":";;;;;;;;;AAgBO,MAAM,4BAA4BA,mBAAAA,cAA0B;AAAA,EACjD,sBACd,mBACkB;AAClB,WAAO;AAAA,MACLC,sBAAAA;AAAAA,QACE;AAAA,QACA,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,IACpD;AAAA,EAEJ;AAAA,EAEgB,kBACd,mBACyB;AACzB,WAAO;AAAA,MACL,SAASC,oBAAAA,OAAO,kBAAkB,MAAM,KAAK,oBAAA,CAAqB,CAAC;AAAA,IAAA;AAAA,EAEvE;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,MACP,UAAU,CAAC,EAAE,KAAK,cAAc;AAAA,MAChC,QAAuB;AACrB,eAAO,CAAC,cAAc,CAAC;AAAA,MACzB;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,4BACd,OACA,mBACmB;AACnB,WAAO;AAAA,MACL;AAAA,QACE,UAAU;AAAA,QACV,MAAM,KAAK,cAAA;AAAA,MAAc;AAAA,IAC3B;AAAA,EAEJ;AAAA,EAEgB,gBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,4BACd,OACA,mBACA,mBACwB;AACxB,WAAOC,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AACF;AC9DO,MAAM,sBAAsBC,mBAAAA,cAAsB;AAAA,EACvC,0BACd,eACQ;AACR,WAAO,EAAE,UAAU,CAAC,aAAa,GAAG,MAAM,KAAK,gBAAc;AAAA,EAC/D;AAAA,EAEgB,sBACd,mBACkB;AAClB,WAAO;AAAA,MACL,IAAIC,mBAAAA;AAAAA,QACF;AAAA,QACA,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,MAEpD,IAAIA,mBAAAA;AAAAA,QACF;AAAA,QACA,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,IACpD;AAAA,EAEJ;AAAA,EAEgB,kBACd,mBACyB;AACzB,UAAM,WAAW,kBAAkB,MAAM,KAAK,qBAAqB;AACnE,WAAO;AAAA,MACL,SAASC,oBAAAA,WAAW,QAAQ;AAAA,MAC5B,SAASA,oBAAAA,WAAW,QAAQ;AAAA,IAAA;AAAA,EAEhC;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,UAAU;AAAA,QACR,EAAE,KAAK,IAAA;AAAA,QACP,EAAE,KAAK,SAAA;AAAA,QACP;AAAA,UACE,UAAU,CAAC,UAAU,6BAA6B,KAAK,KAAK,KAAK;AAAA,UACjE,OAAO;AAAA,QAAA;AAAA,MACT;AAAA,MAEF,QAAuB;AACrB,eAAO,CAAC,UAAU,CAAC;AAAA,MACrB;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,gBAA0B;AACxC,WAAO;AAAA,EACT;AAAA,EAEgB,4BACd,OACA,mBACA,mBACwB;AACxB,WAAO,kBAAkB;AAAA,MAAI,CAAC,UAC5B,MAAM;AAAA,QACJ,MAAM,MAAM,OAAO;AAAA,UACjB,kBAAkB,MAAM,KAAK,oBAAA,CAAqB,EAAE,OAAA;AAAA,QAAO,CAC5D;AAAA,MAAA;AAAA,IACH;AAAA,EAEJ;AACF;ACtEO,MAAM,uBAAuBN,mBAAAA,cAAqB;AAAA,EACvC,kBACd,mBACyB;AACzB,UAAM,UAAUO,oBAAAA,cAAcC,oBAAAA,UAAU,CAAC,OAAO,aAAa;AAC3D,UAAI,UAAU;AACZ;AAAA,UACE,MAAM,GACH;AAAA,YACC,kBAAkB,MAAM,KAAK,oBAAA,CAAqB,EAAE,OAAA;AAAA,UAAO,EAE5D,eAAA;AAAA,QAAe;AAAA,MAEtB;AACA,aAAO;AAAA,IACT,CAAC;AAED,UAAM,QACJ,OAAO,cAAc,cACjB,sBAAsB,KAAK,UAAU,QAAQ,IAC7C;AAEN,WAAO;AAAA,MACL,aAAa;AAAA,MACb,eAAe;AAAA,MACf,GAAI,SAAS,EAAE,cAAc,QAAA;AAAA,IAAQ;AAAA,EAEzC;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,UAAU,CAAC,EAAE,KAAK,MAAM;AAAA,MACxB,YAAY;AAAA,MACZ,QAAuB;AACrB,eAAO,CAAC,IAAI;AAAA,MACd;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,8BAA4C;AAC1D,WAAO,CAAC,EAAE,MAAM,KAAK,cAAA,GAAiB;AAAA,EACxC;AAAA,EAEgB,gBAAyB;AACvC,WAAO;AAAA,EACT;AAAA,EAEgB,4BACd,OACA,mBACA,mBACwB;AACxB,WAAOL,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AACF;ACnEO,MAAM,sBAAsBH,mBAAAA,cAAoB;AAAA,EACrC,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,OAAO;AAAA,IAAA;AAAA,EAEX;AAAA,EAEgB,4BACdS,OACa;AACb,WAAO,CAAC,EAAE,MAAM,KAAK,cAAA,GAAiB,OAAOA,MAAK,QAAQ,IAAI;AAAA,EAChE;AAAA,EAEgB,gBAAwB;AACtC,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdA,OACA,mBACwB;AACxB,WAAO,CAAC,kBAAkB,KAAKA,MAAK,KAAK,CAAC;AAAA,EAC5C;AACF;ACZO,MAAM,2BAA2BT,mBAAAA,cAAoB;AAAA,EAC1D,OAAe,qBAAqB;AAClC,WAAO,CACL,OACA,aACY;AACZ,YAAM,EAAE,OAAO,IAAA,IAAQ,MAAM;AAC7B;AAAA;AAAA,QAEE,CAAC,MAAM,WAAW,GAAG;AAAA,QAErB,MAAM,OAAO,KAAK,SAAS;AAAA,QAE3B,MAAM,iBAAiB,MAAM,OAAO,QAAQ;AAAA,QAE5C,CAAC,MAAM,OAAO,YAAY,GAAG,MAAM,YAAY,EAAE,SAAS,MAAM;AAAA,QAChE;AACA,eAAO;AAAA,MACT;AACA,UAAI,UAAU;AACZ,cAAM,KAAK,MAAM;AACjB;AAAA,UACE,GAEG,YAAY,MAAM,MAAM,GAAG,MAAM,GAAG,EAEpC;AAAA,YACC,MAAM,MAAM;AAAA,YACZ,GAAG,IAAI,KAAK,OAAO,MAAM,WAAW,EAAE,OAAA;AAAA,UAAO,EAG9C,aAAaU,iBAAAA,UAAU,KAAK,GAAG,IAAI,QAAQ,MAAM,GAAG,GAAG,CAAC,CAAC,EACzD,eAAA;AAAA,QAAe;AAAA,MAEtB;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEgB,eAAiC;AAC/C,WAAO,CAAC,IAAI,eAAe;AAAA,EAC7B;AAAA,EAEgB,sBACd,mBACkB;AAClB,WAAO;AAAA,MACLC,sBAAAA;AAAAA,QACE;AAAA,QACA,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,MAEpDA,sBAAAA;AAAAA,QACE;AAAA,QACA,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,IACpD;AAAA,EAEJ;AAAA,EAEgB,kBACd,mBACyB;AACzB,WAAO;AAAA,MACL,OAAO,mBAAmB,mBAAA;AAAA,MAC1B,gBAAgBC,oBAAAA;AAAAA,QACd,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,IACpD;AAAA,EAEJ;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAS;AAAA,MACT,UAAU;AAAA,MACV,OAAO;AAAA,MACP,OAAO;AAAA,MACP,UAAU,CAAC,EAAE,oBAAoB,QAAQ,KAAK,OAAO;AAAA,MACrD,QAAuB;AACrB,eAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;AAAA,MAC5B;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,4BACd,OACA,mBACa;AACb,WAAO;AAAA,MACL;AAAA,QACE,MAAM,KAAK,cAAA;AAAA,QACX,OAAO,kBAAkB,IAAI,CAAC,UAAU,MAAM,KAAK,EAAE,KAAK,EAAE;AAAA,MAAA;AAAA,IAC9D;AAAA,EAEJ;AAAA,EAEgB,gBAAwB;AACtC,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdH,OACA,mBACwB;AACxB,WAAON,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA,CAAC,kBAAkB,KAAKM,MAAK,KAAK,CAAC;AAAA,IAAA;AAAA,EAEvC;AACF;AC1HO,MAAM,4BAA4BT,mBAAAA,cAA0B;AAAA,EACjD,sBAA4B;AAC1C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAA4B;AAC1C,WAAO;AAAA,EACT;AAAA,EAEgB,8BAAiD;AAC/D,WAAO,CAAA;AAAA,EACT;AAAA,EAEgB,gBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdS,OACA,oBACA,oBACA,SAGwB;AACxB,YAAQ,wBAAwB,EAAE,aAAa,GAAC;AAChD,YAAQ,oBAAoB,YAAYA,MAAK,UAAU,IAAI;AAAA,MACzD,OAAOA,MAAK;AAAA,MACZ,KAAKA,MAAK;AAAA,IAAA;AAEZ,WAAO,CAAA;AAAA,EACT;AACF;ACrCO,MAAM,2BAA2BT,mBAAAA,cAAyB;AAAA,EAC/C,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,MACP,UAAU,CAAC,EAAE,KAAK,KAAK;AAAA,MACvB,QAAuB;AACrB,eAAO,CAAC,KAAK,CAAC;AAAA,MAChB;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,4BACd,OACA,mBACkB;AAClB,WAAO,CAAC,EAAE,UAAU,mBAAmB,MAAM,KAAK,cAAA,GAAiB;AAAA,EACrE;AAAA,EAEgB,gBAA6B;AAC3C,WAAO;AAAA,EACT;AAAA,EAEgB,4BACd,OACA,mBACA,mBACwB;AACxB,WAAOG,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AACF;AC3BO,MAAM,yBAAyBH,mBAAAA,cAAuB;AAAA,EAC3D,OAAe,2BACb,mBACA,aACA,aACS;AACT,WAAO,CAAC,OAAO,UAAU,SAAS;AAChC,UAAI,eAAe,CAAC,iBAAiB,UAAU,OAAO,IAAI,GAAG;AAC3D,eAAO;AAAA,MACT;AAEA,YAAM,EAAE,YAAY,MAAM;AAC1B,YAAM,cAAc,QAAQ;AAC5B,UAAI,YAAY,KAAK,SAAS,WAAW;AACvC,eAAO;AAAA,MACT;AAEA,YAAM,kBACH,YAAY,MAAM,OAAO,IAAe;AAE3C,UAAI,kBAAkB,KAAK,kBAAkB,GAAG;AAC9C,eAAO;AAAA,MACT;AACA,UAAI,aAAa,QAAW;AAC1B,eAAO;AAAA,MACT;AAEA,YAAM,kBAAkB,QAAQ,OAAO,QAAQ,KAAK;AAEpD,UAAI,kBAAkB,GAAG;AACvB;AAAA,UACE,MAAM,GAAG,cAAc,iBAAiB,QAAW;AAAA,YACjD,OAAO;AAAA,UAAA,CACR;AAAA,QAAA;AAAA,MAEL,OAAO;AACL;AAAA,UACE,MAAM,GAAG;AAAA,YACP;AAAA,YACA,kBAAkB,MAAM,WAAW;AAAA,UAAA;AAAA,QACrC;AAAA,MAEJ;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,OAAe,UACb,OACA,MACS;AACT,QAAI,CAAC,MAAM,UAAU,OAAO;AAC1B,aAAO;AAAA,IACT;AACA,QAAI,SAAS,QAAW;AACtB,aAAO,KAAK,eAAe,YAAY,KAAK;AAAA,IAC9C;AACA,WAAO,MAAM,UAAU,QAAQ,eAAe;AAAA,EAChD;AAAA,EAEgB,eAAiC;AAC/C,WAAO,CAAC,IAAI,sBAAsB,IAAI,eAAe;AAAA,EACvD;AAAA,EAEgB,sBACd,mBACkB;AAClB,WAAO;AAAA,MACLW,sBAAAA;AAAAA,QACE;AAAA,QACA,kBAAkB,MAAM,KAAK,qBAAqB;AAAA,QAClD,CAAC,WAAW,EAAE,OAAO,MAAM,CAAC,EAAE,OAAA;AAAA,MAAO;AAAA,IACvC;AAAA,EAEJ;AAAA,EAEgB,kBACd,mBACyB;AACzB,UAAM,SAAkC;AAAA,MACtC,KAAK,iBAAiB;AAAA,QACpB;AAAA,QACA;AAAA,QACA;AAAA,MAAA;AAAA,MAEF,WAAW,iBAAiB;AAAA,QAC1B;AAAA,QACA;AAAA,QACA;AAAA,MAAA;AAAA,MAEF,aAAa,iBAAiB;AAAA,QAC5B;AAAA,QACA;AAAA,QACA;AAAA,MAAA;AAAA,MAEF,KAAK,iBAAiB;AAAA,QACpB;AAAA,QACA;AAAA,QACA;AAAA,MAAA;AAAA,IACF;AAGF,aAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,aAAO,aAAa,EAAE,SAAA,CAAU,EAAE,IAAIC,oBAAAA;AAAAA,QACpC,kBAAkB,MAAM,KAAK,qBAAqB;AAAA,QAClD,EAAE,OAAO,EAAA;AAAA,MAAE;AAAA,IAEf;AACA,WAAO;AAAA,EACT;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,OAAO,EAAE,OAAO,EAAE,SAAS,IAAE;AAAA,MAC7B,SAAS;AAAA,MACT,UAAU;AAAA,MACV,OAAO;AAAA,MACP,UAAU;AAAA,QACR,EAAE,OAAO,EAAE,OAAO,EAAA,GAAK,KAAK,KAAA;AAAA,QAC5B,EAAE,OAAO,EAAE,OAAO,EAAA,GAAK,KAAK,KAAA;AAAA,QAC5B,EAAE,OAAO,EAAE,OAAO,EAAA,GAAK,KAAK,KAAA;AAAA,QAC5B,EAAE,OAAO,EAAE,OAAO,EAAA,GAAK,KAAK,KAAA;AAAA,QAC5B,EAAE,OAAO,EAAE,OAAO,EAAA,GAAK,KAAK,KAAA;AAAA,QAC5B,EAAE,OAAO,EAAE,OAAO,EAAA,GAAK,KAAK,KAAA;AAAA,MAAK;AAAA,MAEnC,MAAMH,OAAsC;AAC1C,eAAO,CAAC,IAAKA,MAAK,MAAM,OAAO,EAAa,SAAA,CAAU,IAAI,CAAC;AAAA,MAC7D;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,4BACdA,OACA,mBACgB;AAChB,WAAO;AAAA,MACL;AAAA,QACE,UAAU;AAAA,QACV,OAAOA,MAAK,MAAM,OAAO;AAAA,QACzB,MAAM,KAAK,cAAA;AAAA,MAAc;AAAA,IAC3B;AAAA,EAEJ;AAAA,EAEgB,gBAA2B;AACzC,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdA,OACA,mBACA,mBACwB;AACxB,WAAON,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,QACE,OAAOM,MAAK;AAAA,MAAA;AAAA,IACd;AAAA,EAEJ;AACF;AC/KO,MAAM,gCAAgCT,mBAAAA,cAA6B;AAAA,EACxD,sBACd,mBACkB;AAClB,WAAO;AAAA,MACL,IAAIa,sBAAAA;AAAAA,QAAU;AAAA,QAAkC,CAAC,OAAO,GAAG,OAAO,QAChE,MAAM,GAAG;AAAA,UACP;AAAA,UACA;AAAA,UACAV,mBAAAA;AAAAA,YACE,KAAK,oBAAA;AAAA,YACL;AAAA,YACA,CAAA;AAAA,UAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EAEJ;AAAA,EAEgB,kBACd,mBACyB;AACzB,WAAO;AAAA,MACL,SAAS,CAAC,OAAO,aAAmB;AAClC,YAAI,UAAU;AACZ;AAAA,YACE,MAAM,GACH;AAAA,cACC,kBAAkB,MAAM,KAAK,oBAAA,CAAqB,EAAE,OAAA;AAAA,YAAO,EAE5D,eAAA;AAAA,UAAe;AAAA,QAEtB;AACA,eAAO;AAAA,MACT;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,OAAO;AAAA,MACP,UAAU,CAAC,EAAE,KAAK,MAAM;AAAA,MACxB,QAAuB;AACrB,eAAO,CAAC,OAAO,CAAC,IAAI,CAAC;AAAA,MACvB;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,8BAAoD;AAClE,WAAO;AAAA,MACL;AAAA,QACE,MAAM,KAAK,cAAA;AAAA,MAAc;AAAA,IAC3B;AAAA,EAEJ;AAAA,EAEgB,gBAAiC;AAC/C,WAAO;AAAA,EACT;AAAA,EAEgB,4BACd,OACA,mBACA,mBACwB;AACxB,WAAOA,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AACF;ACvEO,MAAM,uBAAuBH,mBAAAA,cAAqB;AAAA,EACvC,eAAiC;AAC/C,WAAO,CAAC,IAAI,oBAAoB;AAAA,EAClC;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,OAAO;AAAA,QACL,KAAK,EAAE,SAAS,KAAA;AAAA,QAChB,KAAK,CAAA;AAAA,QACL,OAAO,EAAE,SAAS,KAAA;AAAA,MAAK;AAAA,MAEzB,WAAW;AAAA,MACX,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,UAAU;AAAA,QACR;AAAA,UACE,SAAS,KAIP;AACA,mBAAO;AAAA,cACL,KAAM,IAAoB,aAAa,KAAK;AAAA,cAC5C,KAAM,IAAoB,aAAa,KAAK;AAAA,cAC5C,OAAQ,IAAoB,aAAa,OAAO;AAAA,YAAA;AAAA,UAEpD;AAAA,UACA,KAAK;AAAA,QAAA;AAAA,MACP;AAAA,MAEF,MAAMS,OAAsC;AAC1C,eAAO,CAAC,OAAOA,MAAK,KAAK;AAAA,MAC3B;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,4BACdA,OACc;AACd,WAAO;AAAA,MACL;AAAA,QACE,MAAM,KAAK,cAAA;AAAA,QACX,KAAKA,MAAK,MAAM,KAAK;AAAA,QACrB,GAAIA,MAAK,MAAM,KAAK,MAAM,QAAQ,EAAE,KAAKA,MAAK,MAAM,KAAK,EAAA;AAAA,QACzD,GAAIA,MAAK,MAAM,OAAO,MAAM,QAAQ;AAAA,UAClC,OAAOA,MAAK,MAAM,OAAO;AAAA,QAAA;AAAA,MAC3B;AAAA,IACF;AAAA,EAEJ;AAAA,EAEgB,gBAAyB;AACvC,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdA,OACA,mBACA,mBACwB;AACxB,WAAON,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,QACE,KAAKM,MAAK;AAAA,QACV,KAAKA,MAAK;AAAA,QACV,OAAOA,MAAK;AAAA,MAAA;AAAA,IACd;AAAA,EAEJ;AACF;AC1EO,MAAM,gCAAgCT,mBAAAA,cAA8B;AAAA,EACzD,eAAiC;AAC/C,WAAO,CAAC,IAAI,uBAAuB,IAAI,gBAAgB;AAAA,EACzD;AAAA,EAEgB,2BACd,SAIM;AACN,QACE,QAAQ,4BAA4B,UACpC,QAAQ,wBAAwB,QAChC;AACA;AAAA,IACF;AACA,eAAW,MAAM,QAAQ,wBAAwB,kBAAkB;AACjE,UAAI,EAAE,MAAM,QAAQ,oBAAoB,cAAc;AACpD;AAAA,MACF;AACA,YAAMc,cAAa,QAAQ,oBAAoB,YAAY,EAAE;AAC7D,YAAM,QAAQ,QAAQ,wBAAwB,iBAAiB,EAAE,EAC9D;AAKH,YAAM,KAAK,IAAIA,YAAW;AAC1B,UAAIA,YAAW,UAAU,QAAW;AAClC,cAAM,OAAO,IAAIA,YAAW;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AAAA,EAEgB,sBAA4B;AAC1C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAA4B;AAC1C,WAAO;AAAA,EACT;AAAA,EAEgB,8BAAqD;AACnE,WAAO,CAAA;AAAA,EACT;AAAA,EAEgB,gBAAkC;AAChD,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdL,OACA,mBACA,mBACA,SAGwB;AACxB,UAAM,kBAAkB,kBAAkB,MAAM,OAAO,EAAE;AAAA,MACvD,EAAE,KAAKA,MAAK,KAAK,KAAK,IAAI,OAAOA,MAAK,MAAA;AAAA,MACtC;AAAA,IAAA;AAEF,QAAI,oBAAoB,MAAM;AAC5B,aAAO,CAAA;AAAA,IACT;AACA,YAAQ,4BAA4B,EAAE,kBAAkB,GAAC;AACzD,YAAQ,wBAAwB,iBAAiBA,MAAK,UAAU,IAC9D;AACF,WAAO,CAAC,eAAe;AAAA,EACzB;AACF;AC5EO,MAAM,4BAA4BL,mBAAAA,cAA0B;AAAA,EACjD,0BAA0B,eAAiC;AACzE,WAAO,EAAE,MAAM,KAAK,iBAAiB,OAAO,cAAc,MAAA;AAAA,EAC5D;AAAA,EAEgB,sBACd,mBACkB;AAClB,WAAO;AAAA,MACL,IAAIC,mBAAAA;AAAAA,QACF;AAAA,QACA,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,IACpD;AAAA,EAEJ;AAAA,EAEgB,kBACd,mBACyB;AACzB,UAAM,WAAW,kBAAkB,MAAM,KAAK,qBAAqB;AACnE,WAAO;AAAA,MACL,UAAUC,oBAAAA,WAAW,QAAQ;AAAA,IAAA;AAAA,EAEjC;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,WAAW;AAAA,MACX,UAAU,CAAC,EAAE,KAAK,QAAQ;AAAA,MAC1B,QAAuB;AACrB,eAAO,CAAC,QAAQ,CAAC;AAAA,MACnB;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,gBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdG,OACA,mBACwB;AACxB,WAAO;AAAA,MACL,kBACG,KAAKA,MAAK,KAAK,EACf,KAAK,CAAC,kBAAkB,MAAM,KAAK,qBAAqB,EAAE,OAAA,CAAQ,CAAC;AAAA,IAAA;AAAA,EAE1E;AACF;ACrDO,MAAM,wBAAwBL,mBAAAA,cAAwB;AAAA,EAC3C,0BACd,eACU;AACV,WAAO,EAAE,UAAU,CAAC,aAAa,GAAG,MAAM,KAAK,gBAAc;AAAA,EAC/D;AAAA,EAEgB,sBACd,mBACkB;AAClB,WAAO;AAAA,MACL,IAAIC,mBAAAA;AAAAA,QACF,WAAA,+CAAA,GAAA;AAAA,QACA,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,MAEpD,IAAIA,mBAAAA;AAAAA,QACF,WAAA,yCAAA,GAAA;AAAA,QACA,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,IACpD;AAAA,EAEJ;AAAA,EAEgB,kBACd,mBACyB;AACzB,UAAM,WAAW,kBAAkB,MAAM,KAAK,qBAAqB;AACnE,WAAO;AAAA,MACL,SAASC,oBAAAA,WAAW,QAAQ;AAAA,MAC5B,SAASA,oBAAAA,WAAW,QAAQ;AAAA,IAAA;AAAA,EAEhC;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,UAAU;AAAA,QACR,EAAE,KAAK,IAAA;AAAA,QACP,EAAE,KAAK,KAAA;AAAA,QACP;AAAA,UACE,UAAU,CAAC,UAAU,UAAU,YAAY;AAAA,UAC3C,OAAO;AAAA,QAAA;AAAA,MACT;AAAA,MAEF,QAAuB;AACrB,eAAO,CAAC,MAAM,CAAC;AAAA,MACjB;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,gBAA4B;AAC1C,WAAO;AAAA,EACT;AAAA,EAEgB,4BACd,OACA,mBACA,mBACwB;AACxB,WAAO,kBAAkB;AAAA,MAAI,CAAC,UAC5B,MAAM;AAAA,QACJ,MAAM,MAAM,OAAO;AAAA,UACjB,kBAAkB,MAAM,KAAK,oBAAA,CAAqB,EAAE,OAAA;AAAA,QAAO,CAC5D;AAAA,MAAA;AAAA,IACH;AAAA,EAEJ;AACF;ACvEO,MAAM,sBAAsBF,mBAAAA,cAAoB;AAAA,EACrC,0BACd,eACA,cACM;AACN,WAAO;AAAA,MACL,MAAM,KAAK,cAAA;AAAA,MACX,KAAK,aAAa,MAAM,MAAM;AAAA,MAC9B,GAAI,aAAa,MAAM,OAAO,MAAM,QAAQ;AAAA,QAC1C,OAAO,aAAa,MAAM,OAAO;AAAA,MAAA;AAAA,MAEnC,UAAU,CAAC,aAAa;AAAA,IAAA;AAAA,EAE5B;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,OAAO,EAAE,MAAM,CAAA,GAAI,OAAO,EAAE,SAAS,OAAK;AAAA,MAC1C,WAAW;AAAA,MACX,UAAU;AAAA,QACR;AAAA,UACE,SAAS,KAGP;AACA,mBAAO;AAAA,cACL,MAAO,IAAoB,aAAa,MAAM;AAAA,cAC9C,OAAQ,IAAoB,aAAa,OAAO;AAAA,YAAA;AAAA,UAEpD;AAAA,UACA,KAAK;AAAA,QAAA;AAAA,MACP;AAAA,MAEF,MAAMK,OAA2B;AAC/B,eAAO,CAAC,KAAKA,MAAK,OAAO,CAAC;AAAA,MAC5B;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,gBAAwB;AACtC,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdA,OACA,mBACA,mBACwB;AACxB,WAAO,kBAAkB;AAAA,MAAI,CAAC,UAC5B,MAAM;AAAA,QACJ,MAAM,MAAM,OAAO;AAAA,UACjB,kBAAkB,MAAM,KAAK,oBAAA,CAAqB,EAAE,OAAO;AAAA,YACzD,MAAMA,MAAK;AAAA,YACX,OAAOA,MAAK;AAAA,UAAA,CACb;AAAA,QAAA,CACF;AAAA,MAAA;AAAA,IACH;AAAA,EAEJ;AACF;ACxDO,MAAM,+BAA+BL,mBAAAA,cAA6B;AAAA,EACvD,eAAiC;AAC/C,WAAO,CAAC,IAAI,uBAAuB,IAAI,eAAe;AAAA,EACxD;AAAA,EAEgB,2BACd,SAIM;AACN,QACE,QAAQ,2BAA2B,UACnC,QAAQ,wBAAwB,QAChC;AACA;AAAA,IACF;AACA,eAAW,MAAM,QAAQ,uBAAuB,OAAO;AACrD,UAAI,EAAE,MAAM,QAAQ,oBAAoB,cAAc;AACpD;AAAA,MACF;AACA,YAAMU,cAAa,QAAQ,oBAAoB,YAAY,EAAE;AAC7D,YAAM,QAAQ,QAAQ,uBAAuB,MAAM,EAAE,EAAE;AAKvD,YAAM,MAAM,IAAIA,YAAW;AAC3B,UAAIA,YAAW,UAAU,QAAW;AAClC,cAAM,OAAO,IAAIA,YAAW;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AAAA,EAEgB,0BACd,eACe;AACf,WAAO;AAAA,EACT;AAAA,EAEgB,sBAA4B;AAC1C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAA4B;AAC1C,WAAO;AAAA,EACT;AAAA,EAEgB,gBAAiC;AAC/C,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdL,OACA,mBACA,mBACA,SAGwB;AACxB,UAAM,OAAO,kBAAkB,MAAM,MAAM,EAAE,OAAO;AAAA,MAClD,MAAM;AAAA,MACN,OAAO;AAAA,IAAA,CACR;AACD,YAAQ,2BAA2B,EAAE,OAAO,GAAC;AAC7C,YAAQ,uBAAuB,MAAMA,MAAK,UAAU,IAAI;AACxD,WAAO,kBAAkB;AAAA,MAAI,CAAC,UAC5B,MAAM,KAAK,MAAM,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;AAAA,IAAA;AAAA,EAEzC;AACF;ACvEO,MAAM,0BAA0BT,mBAAAA,cAAwB;AAAA,EAC7C,kBACd,mBACyB;AACzB,UAAM,WAAW,kBAAkB,MAAM,KAAK,qBAAqB;AACnE,WAAO;AAAA,MACL,OAAOe,sBAAAA,cAAc,QAAQ;AAAA,MAC7B,aAAaC,sBAAAA,aAAa,QAAQ;AAAA,MAClC,KAAKC,sBAAAA,aAAa,QAAQ;AAAA,IAAA;AAAA,EAE9B;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,SAAS;AAAA,MACT,UAAU;AAAA,MACV,OAAO;AAAA,MACP,UAAU,CAAC,EAAE,KAAK,MAAM;AAAA,MACxB,QAAuB;AACrB,eAAO,CAAC,MAAM,CAAC;AAAA,MACjB;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,4BACd,OACA,mBACiB;AACjB,WAAO;AAAA,MACL;AAAA,QACE,UAAU;AAAA,QACV,MAAM,KAAK,cAAA;AAAA,MAAc;AAAA,IAC3B;AAAA,EAEJ;AAAA,EAEgB,gBAA4B;AAC1C,WAAO;AAAA,EACT;AAAA,EAEgB,4BACd,OACA,mBACA,mBACwB;AACxB,WAAOd,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,uBAAuBM,OAA0B;AAC/D,WACEA,MAAK,SAAS,KAAK,cAAA,MAClB,EAAE,aAAaA,UAAS,OAAOA,MAAK,YAAY;AAAA,EAErD;AACF;AC3DO,MAAM,6BAA6BT,mBAAAA,cAAoB;AAAA,EAC5C,eAAiC;AAC/C,WAAO,CAAC,IAAI,mBAAmB;AAAA,EACjC;AAAA,EAEgB,sBACd,mBACkB;AAClB,WAAO;AAAA,MACLC,sBAAAA;AAAAA,QACE;AAAA,QACA,kBAAkB,MAAM,KAAK,qBAAqB;AAAA,QAClD,CAAC,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,EAAA;AAAA,QAC7B,CAAC,OAAOQ,UACNA,MAAK,aAAcA,MAAK,MAAM,OAAO,MAAiB,CAAC,MAAM,CAAC;AAAA,MAAA;AAAA,IAClE;AAAA,EAEJ;AAAA,EAEgB,kBACd,mBACyB;AACzB,WAAO;AAAA,MACL,eAAeS,sBAAAA;AAAAA,QACb,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,IACpD;AAAA,EAEJ;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,OAAO,EAAE,QAAQ,EAAE,SAAS,MAAA,GAAS,OAAO,EAAE,SAAS,IAAE;AAAA,MACzD,SAAS;AAAA,MACT,OAAO;AAAA,MACP,UAAU;AAAA,QACR;AAAA,UACE,SAAS,KAAwD;AAC/D,kBAAM,QAAS,IAAoB,aAAa,OAAO;AACvD,mBAAO;AAAA,cACL,QACG,IAAoB,aAAa,aAAa,MAAM;AAAA,cACvD,OAAO,UAAU,OAAO,SAAS,OAAO,EAAE,IAAI;AAAA,YAAA;AAAA,UAElD;AAAA,UACA,KAAK;AAAA,QAAA;AAAA,MACP;AAAA,MAEF,MAAMT,OAAsC;AAC1C,eAAO;AAAA,UACL;AAAA,UACA;AAAA,YACE,eAAeA,MAAK,MAAM,QAAQ;AAAA,YAClC,OAAOA,MAAK,MAAM,OAAO;AAAA,UAAA;AAAA,UAE3B;AAAA,QAAA;AAAA,MAEJ;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,4BACdA,OACA,mBACa;AACb,UAAM,SAASA,MAAK,MAAM,QAAQ;AAClC,WAAO;AAAA,MACL;AAAA,QACE,UAAU,kBAAkB,IAAI,CAAC,UAAU;AACzC,gBAAM,SAAS;AACf,iBAAO;AAAA,QACT,CAAC;AAAA,QACD,SAAS;AAAA,QACT;AAAA,QACA,OAAOA,MAAK,MAAM,OAAO;AAAA,QACzB,MAAM,KAAK,cAAA;AAAA,MAAc;AAAA,IAC3B;AAAA,EAEJ;AAAA,EAEgB,gBAAwB;AACtC,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdA,OACA,mBACA,mBACwB;AACxB,WAAON,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,QACE,QAAQM,MAAK;AAAA,QACb,OAAOA,MAAK,SAAS;AAAA,MAAA;AAAA,IACvB;AAAA,EAEJ;AAAA,EAEgB,uBAAuBA,OAA0B;AAC/D,WACEA,MAAK,SAAS,KAAK,cAAA,KAAoBA,MAAc,YAAY;AAAA,EAErE;AACF;ACvHO,MAAM,sBAAsBT,mBAAAA,cAAoB;AAAA,EACrC,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO,EAAE,SAAS,SAAA;AAAA,EACpB;AAAA,EAEgB,4BACd,OACA,mBACa;AACb,WAAO,CAAC,EAAE,UAAU,mBAAmB,MAAM,KAAK,cAAA,GAAiB;AAAA,EACrE;AAAA,EAEgB,gBAAwB;AACtC,WAAO;AAAA,EACT;AAAA,EAEgB,4BACd,OACA,mBACA,mBACwB;AACxB,WAAOG,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AACF;ACpBO,MAAM,+BAA+BH,mBAAAA,cAAoB;AAAA,EAC9C,eAAiC;AAC/C,WAAO,CAAC,IAAI,mBAAmB;AAAA,EACjC;AAAA,EAEgB,sBACd,mBACkB;AAClB,WAAO;AAAA,MACLC,sBAAAA;AAAAA,QACE;AAAA,QACA,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,IACpD;AAAA,EAEJ;AAAA,EAEgB,kBACd,mBACyB;AACzB,WAAO;AAAA,MACL,eAAeiB,sBAAAA;AAAAA,QACb,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,IACpD;AAAA,EAEJ;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,OAAO,EAAE,QAAQ,EAAE,SAAS,QAAM;AAAA,MAClC,SAAS;AAAA,MACT,OAAO;AAAA,MACP,UAAU;AAAA,QACR;AAAA,UACE,SAAS,KAAyC;AAChD,mBAAO;AAAA,cACL,QACG,IAAoB,aAAa,aAAa,MAAM;AAAA,YAAA;AAAA,UAE3D;AAAA,UACA,KAAK;AAAA,QAAA;AAAA,MACP;AAAA,MAEF,MAAMT,OAAsC;AAC1C,eAAO,CAAC,MAAM,EAAE,eAAeA,MAAK,MAAM,QAAQ,EAAA,GAAgB,CAAC;AAAA,MACrE;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,4BACdA,OACA,mBACa;AACb,UAAM,SAASA,MAAK,MAAM,QAAQ;AAClC,WAAO;AAAA,MACL;AAAA,QACE,UAAU,kBAAkB,IAAI,CAAC,UAAU;AACzC,gBAAM,SAAS;AACf,iBAAO;AAAA,QACT,CAAC;AAAA,QACD,SAAS;AAAA,QACT;AAAA,QACA,MAAM,KAAK,cAAA;AAAA,MAAc;AAAA,IAC3B;AAAA,EAEJ;AAAA,EAEgB,gBAAwB;AACtC,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdA,OACA,mBACA,mBACwB;AACxB,WAAON,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,QACE,QAAQM,MAAK;AAAA,MAAA;AAAA,IACf;AAAA,EAEJ;AAAA,EAEgB,uBAAuBA,OAA0B;AAC/D,WACEA,MAAK,SAAS,KAAK,cAAA,KAAoBA,MAAc,YAAY;AAAA,EAErE;AACF;ACvFO,MAAM,0BAA0BU,mBAAAA,UAAU;AAAA,EAC/B,eAAiC;AAC/C,WAAO;AAAA;AAAA,MAEL,IAAI,mBAAA;AAAA,MACJ,IAAI,oBAAA;AAAA,MACJ,IAAI,cAAA;AAAA,MACJ,IAAI,eAAA;AAAA,MACJ,IAAI,mBAAA;AAAA,MACJ,IAAI,oBAAA;AAAA,MACJ,IAAI,iBAAA;AAAA,MACJ,IAAI,wBAAA;AAAA,MACJ,IAAI,eAAA;AAAA,MACJ,IAAI,wBAAA;AAAA,MACJ,IAAI,oBAAA;AAAA,MACJ,IAAI,gBAAA;AAAA,MACJ,IAAI,cAAA;AAAA,MACJ,IAAI,uBAAA;AAAA,MACJ,IAAI,kBAAA;AAAA,MACJ,IAAI,qBAAA;AAAA,MACJ,IAAI,cAAA;AAAA,MACJ,IAAI,cAAA;AAAA,MACJ,IAAI,uBAAA;AAAA,IAAuB;AAAA,EAE/B;AAAA,EAEgB,0BACd,WAC+D;AAC/D,WAAO,UAAU,IAAI,WAAW,EAAE,IAAI,iBAAiB;AAAA,MACrD,QAAQ;AAAA,MACR,gBAAgB;AAAA,MAChB,cAAc;AAAA,MACd,MAAM;AAAA,IAAA,CACP;AAAA,EAOH;AACF;AC9DO,SAAS,OAAO,OAAO,WAAW;AACvC,QAAM,SAAS,OAAO,KAAK;AAE3B,MAAI,OAAO,cAAc,UAAU;AACjC,UAAM,IAAI,UAAU,oBAAoB;AAAA,EAC1C;AAEA,MAAI,QAAQ;AACZ,MAAI,QAAQ,OAAO,QAAQ,SAAS;AAEpC,SAAO,UAAU,IAAI;AACnB;AACA,YAAQ,OAAO,QAAQ,WAAW,QAAQ,UAAU,MAAM;AAAA,EAC5D;AAEA,SAAO;AACT;ACpBO,SAASC,OAAK;AAAC;ACef,MAAM,aAAa,WAAW,UAAU;AAcxC,MAAM,oBAAoB,WAAW,YAAY;AAoCjD,SAAS,aAAaC,OAAM;AACjC;AAAA;AAAA;AAAA,IAGEA,UAAS,SAASA,QAAO,MAAMA,UAAS;AAAA;AAE5C;AAiEO,SAAS,mBAAmBA,OAAM;AACvC,SAAOA,UAAS,QAAQA,QAAO;AACjC;AAWO,SAAS,0BAA0BA,OAAM;AAC9C,SAAOA,UAAS,SAASA,QAAO,KAAKA,UAAS;AAChD;AAiBO,SAAS,cAAcA,OAAM;AAClC,SAAOA,UAAS,MAAMA,UAAS,MAAMA,UAAS;AAChD;AAuBO,MAAM,qBAAqB,WAAW,+BAAc;AAsBpD,MAAM,oBAAoB,WAAW,IAAI;AAUhD,SAAS,WAAW,OAAO;AACzB,SAAO;AAUP,WAAS,MAAMA,OAAM;AACnB,WAAOA,UAAS,QAAQA,QAAO,MAAM,MAAM,KAAK,OAAO,aAAaA,KAAI,CAAC;AAAA,EAC3E;AACF;ACrPe,SAAS,mBAAmB,QAAQ;AAClD,MAAI,OAAO,WAAW,UAAU;AAC/B,UAAM,IAAI,UAAU,mBAAmB;AAAA,EACxC;AAIA,SAAO,OACL,QAAQ,uBAAuB,MAAM,EACrC,QAAQ,MAAM,OAAO;AACxB;ACkIO,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAgBT,SAAU,MAAM;AACd,QAAI,SAAS,QAAQ,SAAS,QAAW;AACvC,aAAO;AAAA,IACT;AAEA,QAAI,OAAO,SAAS,YAAY;AAC9B,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,QAAI,OAAO,SAAS,UAAU;AAC5B,aAAO,MAAM,QAAQ,IAAI,IACrB,WAAW,IAAI;AAAA;AAAA;AAAA,QAGf;AAAA;AAAA,UAAwC;AAAA,QAAI;AAAA;AAAA,IAClD;AAEA,QAAI,OAAO,SAAS,UAAU;AAC5B,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AAAA;AAOJ,SAAS,WAAW,OAAO;AAEzB,QAAM,SAAS,CAAA;AACf,MAAI,QAAQ;AAEZ,SAAO,EAAE,QAAQ,MAAM,QAAQ;AAC7B,WAAO,KAAK,IAAI,QAAQ,MAAM,KAAK,CAAC;AAAA,EACtC;AAEA,SAAO,YAAY,GAAG;AAMtB,WAAS,OAAO,YAAY;AAC1B,QAAIC,SAAQ;AAEZ,WAAO,EAAEA,SAAQ,OAAO,QAAQ;AAC9B,UAAI,OAAOA,MAAK,EAAE,MAAM,MAAM,UAAU,EAAG,QAAO;AAAA,IACpD;AAEA,WAAO;AAAA,EACT;AACF;AAQA,SAAS,kBAAkB,OAAO;AAChC,QAAM;AAAA;AAAA,IAAwD;AAAA;AAE9D,SAAO,YAAYC,IAAG;AAMtB,WAASA,KAAId,OAAM;AACjB,UAAM;AAAA;AAAA;AAAA,MACoBA;AAAA;AAI1B,QAAI;AAEJ,SAAK,OAAO,OAAO;AACjB,UAAI,aAAa,GAAG,MAAM,cAAc,GAAG,EAAG,QAAO;AAAA,IACvD;AAEA,WAAO;AAAA,EACT;AACF;AAQA,SAAS,YAAY,OAAO;AAC1B,SAAO,YAAY,IAAI;AAKvB,WAAS,KAAKA,OAAM;AAClB,WAAOA,SAAQA,MAAK,SAAS;AAAA,EAC/B;AACF;AAQA,SAAS,YAAY,cAAc;AACjC,SAAO;AAMP,WAAS,MAAM,OAAO,OAAO,QAAQ;AACnC,WAAO;AAAA,MACL,eAAe,KAAK,KAClB,aAAa;AAAA,QACX;AAAA,QACA;AAAA,QACA,OAAO,UAAU,WAAW,QAAQ;AAAA,QACpC,UAAU;AAAA,MACpB;AAAA,IACA;AAAA,EACE;AACF;AAEA,SAAS,KAAK;AACZ,SAAO;AACT;AAMA,SAAS,eAAe,OAAO;AAC7B,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,UAAU;AAClE;ACnSO,SAAS,MAAM,GAAG;AACvB,SAAO;AACT;AC0NA,MAAM,QAAQ,CAAA;AAKP,MAAM,WAAW;AAKjB,MAAM,OAAO;AAKb,MAAM,OAAO;AAiDb,SAAS,aAAa,MAAM,MAAM,SAAS,SAAS;AAEzD,MAAI;AAEJ,MAAI,OAAO,SAAS,cAAc,OAAO,YAAY,YAAY;AAC/D,cAAU;AAEV,cAAU;AAAA,EACZ,OAAO;AAEL,YAAQ;AAAA,EACV;AAEA,QAAM,KAAK,QAAQ,KAAK;AACxB,QAAM,OAAO,UAAU,KAAK;AAE5B,UAAQ,MAAM,QAAW,EAAE,EAAC;AAO5B,WAAS,QAAQA,OAAM,OAAO,SAAS;AACrC,UAAM;AAAA;AAAA,MACJA,SAAQ,OAAOA,UAAS,WAAWA,QAAO,CAAA;AAAA;AAG5C,QAAI,OAAO,MAAM,SAAS,UAAU;AAClC,YAAM;AAAA;AAAA,QAEJ,OAAO,MAAM,YAAY,WACrB,MAAM;AAAA;AAAA,UAEN,OAAO,MAAM,SAAS,WACpB,MAAM,OACN;AAAA;AAAA;AAER,aAAO,eAAee,QAAO,QAAQ;AAAA,QACnC,OACE,WAAW,MAAMf,MAAK,QAAQ,OAAO,MAAM,OAAO,MAAM,GAAG,IAAI;AAAA,MACzE,CAAO;AAAA,IACH;AAEA,WAAOe;AAEP,aAASA,SAAQ;AAEf,UAAI,SAAS;AAEb,UAAI;AAEJ,UAAI;AAEJ,UAAI;AAEJ,UAAI,CAAC,QAAQ,GAAGf,OAAM,OAAO,QAAQ,QAAQ,SAAS,CAAC,KAAK,MAAS,GAAG;AAEtE,iBAAS,SAAS,QAAQA,OAAM,OAAO,CAAC;AAExC,YAAI,OAAO,CAAC,MAAM,MAAM;AACtB,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,cAAcA,SAAQA,MAAK,UAAU;AACvC,cAAM;AAAA;AAAA,UAA2CA;AAAA;AAEjD,YAAI,aAAa,YAAY,OAAO,CAAC,MAAM,MAAM;AAC/C,oBAAU,UAAU,aAAa,SAAS,SAAS,MAAM;AACzD,yBAAe,QAAQ,OAAO,YAAY;AAE1C,iBAAO,SAAS,MAAM,SAAS,aAAa,SAAS,QAAQ;AAC3D,kBAAM,QAAQ,aAAa,SAAS,MAAM;AAE1C,wBAAY,QAAQ,OAAO,QAAQ,YAAY,EAAC;AAEhD,gBAAI,UAAU,CAAC,MAAM,MAAM;AACzB,qBAAO;AAAA,YACT;AAEA,qBACE,OAAO,UAAU,CAAC,MAAM,WAAW,UAAU,CAAC,IAAI,SAAS;AAAA,UAC/D;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAUA,SAAS,SAAS,OAAO;AACvB,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,CAAC,UAAU,KAAK;AAAA,EACzB;AAEA,SAAO,UAAU,QAAQ,UAAU,SAAY,QAAQ,CAAC,KAAK;AAC/D;ACjUO,SAAS,eAAe,MAAMgB,OAAM,SAAS;AAClD,QAAM,WAAW,WAAW,CAAA;AAC5B,QAAM,UAAU,QAAQ,SAAS,UAAU,CAAA,CAAE;AAC7C,QAAM,QAAQ,QAAQA,KAAI;AAC1B,MAAI,YAAY;AAEhB,SAAO,EAAE,YAAY,MAAM,QAAQ;AACjC,iBAAa,MAAM,QAAQ,OAAO;AAAA,EACpC;AAGA,WAAS,QAAQhB,OAAM,SAAS;AAC9B,QAAI,QAAQ;AAEZ,QAAI;AAEJ,WAAO,EAAE,QAAQ,QAAQ,QAAQ;AAC/B,YAAM,SAAS,QAAQ,KAAK;AAE5B,YAAM,WAAW,cAAc,YAAY,WAAW;AAEtD,UACE;AAAA,QACE;AAAA,QACA,WAAW,SAAS,QAAQ,MAAM,IAAI;AAAA,QACtC;AAAA,MACV,GACQ;AACA;AAAA,MACF;AAEA,oBAAc;AAAA,IAChB;AAEA,QAAI,aAAa;AACf,aAAO,QAAQA,OAAM,OAAO;AAAA,IAC9B;AAAA,EACF;AAYA,WAAS,QAAQA,OAAM,SAAS;AAC9B,UAAM,SAAS,QAAQ,QAAQ,SAAS,CAAC;AACzC,UAAM,OAAO,MAAM,SAAS,EAAE,CAAC;AAC/B,UAAM,UAAU,MAAM,SAAS,EAAE,CAAC;AAClC,QAAI,QAAQ;AAEZ,UAAM,WAAW,OAAO;AACxB,UAAM,QAAQ,SAAS,QAAQA,KAAI;AACnC,QAAI,SAAS;AAEb,QAAI,QAAQ,CAAA;AAEZ,SAAK,YAAY;AAEjB,QAAI,QAAQ,KAAK,KAAKA,MAAK,KAAK;AAEhC,WAAO,OAAO;AACZ,YAAM,WAAW,MAAM;AAEvB,YAAM,cAAc;AAAA,QAClB,OAAO,MAAM;AAAA,QACb,OAAO,MAAM;AAAA,QACb,OAAO,CAAC,GAAG,SAASA,KAAI;AAAA,MAChC;AACM,UAAI,QAAQ,QAAQ,GAAG,OAAO,WAAW;AAEzC,UAAI,OAAO,UAAU,UAAU;AAC7B,gBAAQ,MAAM,SAAS,IAAI,EAAC,MAAM,QAAQ,MAAK,IAAI;AAAA,MACrD;AAGA,UAAI,UAAU,OAAO;AAInB,aAAK,YAAY,WAAW;AAAA,MAC9B,OAAO;AACL,YAAI,UAAU,UAAU;AACtB,gBAAM,KAAK;AAAA,YACT,MAAM;AAAA,YACN,OAAOA,MAAK,MAAM,MAAM,OAAO,QAAQ;AAAA,UACnD,CAAW;AAAA,QACH;AAEA,YAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,gBAAM,KAAK,GAAG,KAAK;AAAA,QACrB,WAAW,OAAO;AAChB,gBAAM,KAAK,KAAK;AAAA,QAClB;AAEA,gBAAQ,WAAW,MAAM,CAAC,EAAE;AAC5B,iBAAS;AAAA,MACX;AAEA,UAAI,CAAC,KAAK,QAAQ;AAChB;AAAA,MACF;AAEA,cAAQ,KAAK,KAAKA,MAAK,KAAK;AAAA,IAC9B;AAEA,QAAI,QAAQ;AACV,UAAI,QAAQA,MAAK,MAAM,QAAQ;AAC7B,cAAM,KAAK,EAAC,MAAM,QAAQ,OAAOA,MAAK,MAAM,MAAM,KAAK,EAAC,CAAC;AAAA,MAC3D;AAEA,aAAO,SAAS,OAAO,OAAO,GAAG,GAAG,KAAK;AAAA,IAC3C,OAAO;AACL,cAAQ,CAACA,KAAI;AAAA,IACf;AAEA,WAAO,QAAQ,MAAM;AAAA,EACvB;AACF;AAUA,SAAS,QAAQ,aAAa;AAE5B,QAAM,SAAS,CAAA;AAEf,MAAI,CAAC,MAAM,QAAQ,WAAW,GAAG;AAC/B,UAAM,IAAI,UAAU,mDAAmD;AAAA,EACzE;AAIA,QAAMgB,QACJ,CAAC,YAAY,CAAC,KAAK,MAAM,QAAQ,YAAY,CAAC,CAAC,IAC3C,cACA,CAAC,WAAW;AAElB,MAAI,QAAQ;AAEZ,SAAO,EAAE,QAAQA,MAAK,QAAQ;AAC5B,UAAM,QAAQA,MAAK,KAAK;AACxB,WAAO,KAAK,CAAC,aAAa,MAAM,CAAC,CAAC,GAAG,WAAW,MAAM,CAAC,CAAC,CAAC,CAAC;AAAA,EAC5D;AAEA,SAAO;AACT;AAUA,SAAS,aAAa,MAAM;AAC1B,SAAO,OAAO,SAAS,WAAW,IAAI,OAAOC,mBAAO,IAAI,GAAG,GAAG,IAAI;AACpE;AAUA,SAAS,WAAW,SAAS;AAC3B,SAAO,OAAO,YAAY,aACtB,UACA,WAAY;AACV,WAAO;AAAA,EACT;AACN;ACvPA,MAAM,cAAc;AAEpB,MAAM,iBAAiB,CAAC,YAAY,QAAQ,SAAS,OAAO;AASrD,SAAS,iCAAiC;AAC/C,SAAO;AAAA,IACL,YAAY,CAAC,4BAA4B;AAAA,IACzC,OAAO;AAAA,MACL,iBAAiB;AAAA,MACjB,sBAAsB;AAAA,MACtB,qBAAqB;AAAA,MACrB,oBAAoB;AAAA,IAC1B;AAAA,IACI,MAAM;AAAA,MACJ,iBAAiB;AAAA,MACjB,sBAAsB;AAAA,MACtB,qBAAqB;AAAA,MACrB,oBAAoB;AAAA,IAC1B;AAAA,EACA;AACA;AASO,SAAS,+BAA+B;AAC7C,SAAO;AAAA,IACL,QAAQ;AAAA,MACN;AAAA,QACE,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,OAAO;AAAA,QACP;AAAA,QACA;AAAA,MACR;AAAA,MACM;AAAA,QACE,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,OAAO;AAAA,QACP;AAAA,QACA;AAAA,MACR;AAAA,MACM;AAAA,QACE,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,OAAO;AAAA,QACP;AAAA,QACA;AAAA,MACR;AAAA,IACA;AAAA,EACA;AACA;AAMA,SAAS,qBAAqB,OAAO;AACnC,OAAK,MAAM,EAAC,MAAM,QAAQ,OAAO,MAAM,KAAK,IAAI,UAAU,CAAA,EAAE,GAAG,KAAK;AACtE;AAMA,SAAS,0BAA0B,OAAO;AACxC,OAAK,OAAO,MAAM,iBAAiB,KAAK,MAAM,KAAK;AACrD;AAMA,SAAS,wBAAwB,OAAO;AACtC,OAAK,OAAO,KAAK,iBAAiB,KAAK,MAAM,KAAK;AACpD;AAMA,SAAS,uBAAuB,OAAO;AACrC,OAAK,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK;AACtC,QAAMjB,QAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7CkB,OAAOlB,MAAK,SAAS,MAAM;AAC3B,EAAAA,MAAK,MAAM,YAAY,KAAK,eAAe,KAAK;AAClD;AAMA,SAAS,yBAAyB,OAAO;AACvC,OAAK,OAAO,KAAK,cAAc,KAAK,MAAM,KAAK;AACjD;AAMA,SAAS,oBAAoB,OAAO;AAClC,OAAK,KAAK,KAAK;AACjB;AAGA,SAAS,6BAA6B,MAAM;AAC1C;AAAA,IACE;AAAA,IACA;AAAA,MACE,CAAC,mDAAmD,OAAO;AAAA,MAC3D,CAAC,WAAA,gEAAA,IAAyD,GAAE,SAAS;AAAA,IAC3E;AAAA,IACI,EAAC,QAAQ,CAAC,QAAQ,eAAe,EAAC;AAAA,EACtC;AACA;AAYA,SAAS,QAAQ,GAAG,UAAUmB,SAAQC,OAAM,OAAO;AACjD,MAAI,SAAS;AAGb,MAAI,CAAC,SAAS,KAAK,GAAG;AACpB,WAAO;AAAA,EACT;AAGA,MAAI,MAAM,KAAK,QAAQ,GAAG;AACxB,IAAAD,UAAS,WAAWA;AACpB,eAAW;AACX,aAAS;AAAA,EACX;AAEA,MAAI,CAAC,gBAAgBA,OAAM,GAAG;AAC5B,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,SAASA,UAASC,KAAI;AAEpC,MAAI,CAAC,MAAM,CAAC,EAAG,QAAO;AAGtB,QAAM,SAAS;AAAA,IACb,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK,SAAS,WAAW,MAAM,CAAC;AAAA,IAChC,UAAU,CAAC,EAAC,MAAM,QAAQ,OAAO,WAAW,MAAM,CAAC,EAAC,CAAC;AAAA,EACzD;AAEE,MAAI,MAAM,CAAC,GAAG;AACZ,WAAO,CAAC,QAAQ,EAAC,MAAM,QAAQ,OAAO,MAAM,CAAC,EAAC,CAAC;AAAA,EACjD;AAEA,SAAO;AACT;AAUA,SAAS,UAAU,GAAG,OAAO,OAAO,OAAO;AACzC;AAAA;AAAA,IAEE,CAAC,SAAS,OAAO,IAAI;AAAA,IAErB,UAAU,KAAK,KAAK;AAAA,IACpB;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK,YAAY,QAAQ,MAAM;AAAA,IAC/B,UAAU,CAAC,EAAC,MAAM,QAAQ,OAAO,QAAQ,MAAM,MAAK,CAAC;AAAA,EACzD;AACA;AAMA,SAAS,gBAAgBD,SAAQ;AAC/B,QAAM,QAAQA,QAAO,MAAM,GAAG;AAE9B,MACE,MAAM,SAAS,KACd,MAAM,MAAM,SAAS,CAAC,MACpB,IAAI,KAAK,MAAM,MAAM,SAAS,CAAC,CAAC,KAC/B,CAAC,aAAa,KAAK,MAAM,MAAM,SAAS,CAAC,CAAC,MAC7C,MAAM,MAAM,SAAS,CAAC,MACpB,IAAI,KAAK,MAAM,MAAM,SAAS,CAAC,CAAC,KAC/B,CAAC,aAAa,KAAK,MAAM,MAAM,SAAS,CAAC,CAAC,IAC9C;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAMA,SAAS,SAAS,KAAK;AACrB,QAAM,YAAY,sBAAsB,KAAK,GAAG;AAEhD,MAAI,CAAC,WAAW;AACd,WAAO,CAAC,KAAK,MAAS;AAAA,EACxB;AAEA,QAAM,IAAI,MAAM,GAAG,UAAU,KAAK;AAElC,MAAIE,SAAQ,UAAU,CAAC;AACvB,MAAI,oBAAoBA,OAAM,QAAQ,GAAG;AACzC,QAAM,gBAAgB,OAAO,KAAK,GAAG;AACrC,MAAI,gBAAgB,OAAO,KAAK,GAAG;AAEnC,SAAO,sBAAsB,MAAM,gBAAgB,eAAe;AAChE,WAAOA,OAAM,MAAM,GAAG,oBAAoB,CAAC;AAC3C,IAAAA,SAAQA,OAAM,MAAM,oBAAoB,CAAC;AACzC,wBAAoBA,OAAM,QAAQ,GAAG;AACrC;AAAA,EACF;AAEA,SAAO,CAAC,KAAKA,MAAK;AACpB;AAOA,SAAS,SAAS,OAAO,OAAO;AAC9B,QAAMT,QAAO,MAAM,MAAM,WAAW,MAAM,QAAQ,CAAC;AAEnD,UACG,MAAM,UAAU,KACf,kBAAkBA,KAAI,KACtB,mBAAmBA,KAAI;AAAA,GAExB,CAAC,SAASA,UAAS;AAExB;AClRA,MAAM,YAAY;AAAA,EAChB,UAAU;AAAA,EACV,SAAS;AACX;AACA,MAAM,SAAS;AAAA,EACb,UAAU;AAAA,EACV,SAAS;AACX;AACA,MAAM,OAAO;AAAA,EACX,UAAU;AAAA,EACV,SAAS;AACX;AACA,MAAM,QAAQ;AAAA,EACZ,UAAU;AAAA,EACV,SAAS;AACX;AACA,MAAM,sBAAsB;AAAA,EAC1B,UAAU;AAAA,EACV,SAAS;AACX;AACA,MAAM,cAAc;AAAA,EAClB,MAAM;AAAA,EACN,UAAU;AAAA,EACV,UAAU;AACZ;AACA,MAAM,mBAAmB;AAAA,EACvB,MAAM;AAAA,EACN,UAAU;AAAA,EACV,UAAU;AACZ;AACA,MAAM,gBAAgB;AAAA,EACpB,MAAM;AAAA,EACN,UAAU;AAAA,EACV,UAAU;AACZ;AAGA,MAAMU,SAAO,CAAA;AAUN,SAAS,qBAAqB;AACnC,SAAO;AAAA,IACT,MAAIA;AAAAA,EACJ;AACA;AAGA,IAAIV,SAAO;AAGX,OAAOA,SAAO,KAAK;AACjBU,SAAKV,MAAI,IAAI;AACbA;AACA,MAAIA,WAAS,GAAIA,UAAO;AAAA,WAAYA,WAAS,GAAIA,UAAO;AAC1D;AACAU,OAAK,EAAE,IAAI;AACXA,OAAK,EAAE,IAAI;AACXA,OAAK,EAAE,IAAI;AACXA,OAAK,EAAE,IAAI;AACXA,OAAK,EAAE,IAAI,CAAC,eAAe,gBAAgB;AAC3CA,OAAK,GAAG,IAAI,CAAC,eAAe,gBAAgB;AAC5CA,OAAK,EAAE,IAAI,CAAC,eAAe,WAAW;AACtCA,OAAK,GAAG,IAAI,CAAC,eAAe,WAAW;AAmBvC,SAAS,sBAAsB,SAASX,KAAI,KAAK;AAC/C,QAAM,OAAO;AAEb,MAAI;AAEJ,MAAI;AACJ,SAAO;AAYP,WAAS,MAAMC,OAAM;AACnB,QAAI,CAAC,SAASA,KAAI,KAAK,CAAC,cAAc,KAAK,MAAM,KAAK,QAAQ,KAAK,mBAAmB,KAAK,MAAM,GAAG;AAClG,aAAO,IAAIA,KAAI;AAAA,IACjB;AACA,YAAQ,MAAM,iBAAiB;AAC/B,YAAQ,MAAM,sBAAsB;AACpC,WAAO,MAAMA,KAAI;AAAA,EACnB;AAYA,WAAS,MAAMA,OAAM;AACnB,QAAI,SAASA,KAAI,GAAG;AAClB,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AACA,QAAIA,UAAS,IAAI;AACf,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AACA,WAAO,IAAIA,KAAI;AAAA,EACjB;AAgBA,WAAS,YAAYA,OAAM;AAEzB,QAAIA,UAAS,IAAI;AACf,aAAO,QAAQ,MAAM,qBAAqB,kBAAkB,cAAc,EAAEA,KAAI;AAAA,IAClF;AAGA,QAAIA,UAAS,MAAMA,UAAS,MAAM,kBAAkBA,KAAI,GAAG;AACzD,aAAO;AACP,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AAQA,WAAO,iBAAiBA,KAAI;AAAA,EAC9B;AAYA,WAAS,eAAeA,OAAM;AAC5B,YAAQ,QAAQA,KAAI;AACpB,UAAM;AACN,WAAO;AAAA,EACT;AAYA,WAAS,iBAAiBA,OAAM;AAG9B,QAAI,QAAQ,OAAO,WAAW,KAAK,QAAQ,GAAG;AAC5C,cAAQ,KAAK,sBAAsB;AACnC,cAAQ,KAAK,iBAAiB;AAC9B,aAAOD,IAAGC,KAAI;AAAA,IAChB;AACA,WAAO,IAAIA,KAAI;AAAA,EACjB;AACF;AAaA,SAAS,oBAAoB,SAASD,KAAI,KAAK;AAC7C,QAAM,OAAO;AACb,SAAO;AAYP,WAAS,SAASC,OAAM;AACtB,QAAIA,UAAS,MAAMA,UAAS,OAAO,CAAC,YAAY,KAAK,MAAM,KAAK,QAAQ,KAAK,mBAAmB,KAAK,MAAM,GAAG;AAC5G,aAAO,IAAIA,KAAI;AAAA,IACjB;AACA,YAAQ,MAAM,iBAAiB;AAC/B,YAAQ,MAAM,oBAAoB;AAGlC,WAAO,QAAQ,MAAM,WAAW,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAAG,GAAG,GAAG,EAAEA,KAAI;AAAA,EAC1G;AAYA,WAAS,SAASA,OAAM;AACtB,YAAQ,KAAK,oBAAoB;AACjC,YAAQ,KAAK,iBAAiB;AAC9B,WAAOD,IAAGC,KAAI;AAAA,EAChB;AACF;AAaA,SAAS,yBAAyB,SAASD,KAAI,KAAK;AAClD,QAAM,OAAO;AACb,MAAI,SAAS;AACb,MAAI,OAAO;AACX,SAAO;AAYP,WAAS,cAAcC,OAAM;AAC3B,SAAKA,UAAS,MAAMA,UAAS,QAAQ,iBAAiB,KAAK,MAAM,KAAK,QAAQ,KAAK,CAAC,mBAAmB,KAAK,MAAM,GAAG;AACnH,cAAQ,MAAM,iBAAiB;AAC/B,cAAQ,MAAM,qBAAqB;AACnC,gBAAU,OAAO,cAAcA,KAAI;AACnC,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AACA,WAAO,IAAIA,KAAI;AAAA,EACjB;AAYA,WAAS,qBAAqBA,OAAM;AAElC,QAAI,WAAWA,KAAI,KAAK,OAAO,SAAS,GAAG;AAEzC,gBAAU,OAAO,cAAcA,KAAI;AACnC,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AACA,QAAIA,UAAS,IAAI;AACf,YAAM,WAAW,OAAO,YAAW;AACnC,UAAI,aAAa,UAAU,aAAa,SAAS;AAC/C,gBAAQ,QAAQA,KAAI;AACpB,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO,IAAIA,KAAI;AAAA,EACjB;AAYA,WAAS,sBAAsBA,OAAM;AACnC,QAAIA,UAAS,IAAI;AACf,cAAQ,QAAQA,KAAI;AACpB,UAAI,MAAM;AACR,eAAO;AAAA,MACT;AACA,aAAO;AACP,aAAO;AAAA,IACT;AACA,WAAO,IAAIA,KAAI;AAAA,EACjB;AAYA,WAAS,cAAcA,OAAM;AAG3B,WAAOA,UAAS,QAAQ,aAAaA,KAAI,KAAK,0BAA0BA,KAAI,KAAK,kBAAkBA,KAAI,KAAK,mBAAmBA,KAAI,IAAI,IAAIA,KAAI,IAAI,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,MAAM,aAAa,GAAG,GAAG,EAAEA,KAAI;AAAA,EAC5N;AAYA,WAAS,cAAcA,OAAM;AAC3B,YAAQ,KAAK,qBAAqB;AAClC,YAAQ,KAAK,iBAAiB;AAC9B,WAAOD,IAAGC,KAAI;AAAA,EAChB;AACF;AAaA,SAAS,kBAAkB,SAASD,KAAI,KAAK;AAC3C,MAAI,OAAO;AACX,SAAO;AAYP,WAAS,gBAAgBC,OAAM;AAC7B,SAAKA,UAAS,MAAMA,UAAS,QAAQ,OAAO,GAAG;AAC7C;AACA,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AACA,QAAIA,UAAS,MAAM,SAAS,GAAG;AAC7B,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AACA,WAAO,IAAIA,KAAI;AAAA,EACjB;AAYA,WAAS,eAAeA,OAAM;AAE5B,WAAOA,UAAS,OAAO,IAAIA,KAAI,IAAID,IAAGC,KAAI;AAAA,EAC5C;AACF;AAaA,SAAS,eAAe,SAASD,KAAI,KAAK;AAExC,MAAI;AAEJ,MAAI;AAEJ,MAAI;AACJ,SAAO;AAYP,WAAS,aAAaC,OAAM;AAI1B,QAAIA,UAAS,MAAMA,UAAS,IAAI;AAC9B,aAAO,QAAQ,MAAM,OAAO,aAAa,mBAAmB,EAAEA,KAAI;AAAA,IACpE;AAQA,QAAIA,UAAS,QAAQ,0BAA0BA,KAAI,KAAK,kBAAkBA,KAAI,KAAKA,UAAS,MAAM,mBAAmBA,KAAI,GAAG;AAC1H,aAAO,YAAYA,KAAI;AAAA,IACzB;AACA,WAAO;AACP,YAAQ,QAAQA,KAAI;AACpB,WAAO;AAAA,EACT;AAYA,WAAS,oBAAoBA,OAAM;AAEjC,QAAIA,UAAS,IAAI;AACf,gCAA0B;AAAA,IAC5B,OAGK;AACH,oCAA8B;AAC9B,gCAA0B;AAAA,IAC5B;AACA,YAAQ,QAAQA,KAAI;AACpB,WAAO;AAAA,EACT;AAWA,WAAS,YAAYA,OAAM;AAGzB,QAAI,+BAA+B,2BAA2B,CAAC,MAAM;AACnE,aAAO,IAAIA,KAAI;AAAA,IACjB;AACA,WAAOD,IAAGC,KAAI;AAAA,EAChB;AACF;AAaA,SAAS,aAAa,SAASD,KAAI;AACjC,MAAI,WAAW;AACf,MAAI,YAAY;AAChB,SAAO;AAYP,WAAS,WAAWC,OAAM;AACxB,QAAIA,UAAS,IAAI;AACf;AACA,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AAKA,QAAIA,UAAS,MAAM,YAAY,UAAU;AACvC,aAAO,kBAAkBA,KAAI;AAAA,IAC/B;AAKA,QAAIA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,KAAK;AAClO,aAAO,QAAQ,MAAM,OAAOD,KAAI,iBAAiB,EAAEC,KAAI;AAAA,IACzD;AACA,QAAIA,UAAS,QAAQ,0BAA0BA,KAAI,KAAK,kBAAkBA,KAAI,GAAG;AAC/E,aAAOD,IAAGC,KAAI;AAAA,IAChB;AACA,YAAQ,QAAQA,KAAI;AACpB,WAAO;AAAA,EACT;AAYA,WAAS,kBAAkBA,OAAM;AAE/B,QAAIA,UAAS,IAAI;AACf;AAAA,IACF;AACA,YAAQ,QAAQA,KAAI;AACpB,WAAO;AAAA,EACT;AACF;AAiBA,SAAS,cAAc,SAASD,KAAI,KAAK;AACvC,SAAOU;AAYP,WAASA,OAAMT,OAAM;AAEnB,QAAIA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,KAAK;AACrL,cAAQ,QAAQA,KAAI;AACpB,aAAOS;AAAA,IACT;AAKA,QAAIT,UAAS,IAAI;AACf,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AAKA,QAAIA,UAAS,IAAI;AACf,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AACA;AAAA;AAAA,MAEAA,UAAS;AAAA,MAETA,UAAS,QAAQ,0BAA0BA,KAAI,KAAK,kBAAkBA,KAAI;AAAA,MAAG;AAC3E,aAAOD,IAAGC,KAAI;AAAA,IAChB;AACA,WAAO,IAAIA,KAAI;AAAA,EACjB;AAeA,WAAS,kBAAkBA,OAAM;AAG/B,QAAIA,UAAS,QAAQA,UAAS,MAAMA,UAAS,MAAM,0BAA0BA,KAAI,KAAK,kBAAkBA,KAAI,GAAG;AAC7G,aAAOD,IAAGC,KAAI;AAAA,IAChB;AACA,WAAOS,OAAMT,KAAI;AAAA,EACnB;AAYA,WAAS,6BAA6BA,OAAM;AAE1C,WAAO,WAAWA,KAAI,IAAI,8BAA8BA,KAAI,IAAI,IAAIA,KAAI;AAAA,EAC1E;AAYA,WAAS,8BAA8BA,OAAM;AAE3C,QAAIA,UAAS,IAAI;AACf,cAAQ,QAAQA,KAAI;AACpB,aAAOS;AAAA,IACT;AACA,QAAI,WAAWT,KAAI,GAAG;AACpB,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AAGA,WAAO,IAAIA,KAAI;AAAA,EACjB;AACF;AAiBA,SAAS,4BAA4B,SAASD,KAAI,KAAK;AACrD,SAAO;AAYP,WAAS,MAAMC,OAAM;AAEnB,YAAQ,QAAQA,KAAI;AACpB,WAAO;AAAA,EACT;AAYA,WAAS,MAAMA,OAAM;AAEnB,WAAO,kBAAkBA,KAAI,IAAI,IAAIA,KAAI,IAAID,IAAGC,KAAI;AAAA,EACtD;AACF;AAQA,SAAS,YAAYA,OAAM;AACzB,SAAOA,UAAS,QAAQA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,OAAO,0BAA0BA,KAAI;AACnJ;AAQA,SAAS,iBAAiBA,OAAM;AAC9B,SAAO,CAAC,WAAWA,KAAI;AACzB;AAMA,SAAS,cAAcA,OAAM;AAK3B,SAAO,EAAEA,UAAS,MAAM,SAASA,KAAI;AACvC;AAMA,SAAS,SAASA,OAAM;AACtB,SAAOA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAMA,UAAS,MAAM,kBAAkBA,KAAI;AAC3F;AAMA,SAAS,mBAAmB,QAAQ;AAClC,MAAI,QAAQ,OAAO;AACnB,MAAI,SAAS;AACb,SAAO,SAAS;AACd,UAAM,QAAQ,OAAO,KAAK,EAAE,CAAC;AAC7B,SAAK,MAAM,SAAS,eAAe,MAAM,SAAS,iBAAiB,CAAC,MAAM,WAAW;AACnF,eAAS;AACT;AAAA,IACF;AAIA,QAAI,MAAM,+BAA+B;AACvC,eAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,MAAI,OAAO,SAAS,KAAK,CAAC,QAAQ;AAGhC,WAAO,OAAO,SAAS,CAAC,EAAE,CAAC,EAAE,gCAAgC;AAAA,EAC/D;AACA,SAAO;AACT;ACh1BO,SAAS,sBACd,qBACA,wBACA,sBACY;AACZ,SAAO,WAA2B;AAChC,UAAM,OAAO,KAAK,KAAA;AAElB,SAAK,wBAAwB,CAAA;AAC7B,SAAK,2BAA2B,CAAA;AAChC,SAAK,yBAAyB,CAAA;AAE9B,SAAK,oBAAoB,KAAK,GAAG,mBAAmB;AACpD,SAAK,uBAAuB,KAAK,GAAG,sBAAsB;AAC1D,SAAK,qBAAqB,KAAK,GAAG,oBAAoB;AAAA,EACxD;AACF;ACNO,MAAM,kCAAkCF,mBAAAA,UAAU;AAAA,EACvC,0BACd,WAC+D;AAC/D,WAAO,UAAU;AAAA,MACf;AAAA,QACE,CAAC,oBAAoB;AAAA,QACrB,CAAC,gCAAgC;AAAA,QACjC,CAAC,8BAA8B;AAAA,MAAA;AAAA,IACjC;AAAA,EAEJ;AACF;ACLA,MAAM,iCAAiC;AAAA,EACrC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,aAAa,OAAO;AASb,SAAS,+BAA+B;AAC7C,SAAO;AAAA,IACL,gBAAgB,CAAC,QAAQ;AAAA,IACzB,OAAO,EAAC,eAAe,mBAAkB;AAAA,IACzC,MAAM,EAAC,eAAe,kBAAiB;AAAA,EAC3C;AACA;AASO,SAAS,6BAA6B;AAC3C,SAAO;AAAA,IACL,QAAQ;AAAA,MACN;AAAA,QACE,WAAW;AAAA,QACX,aAAa;AAAA,QACb,gBAAgB;AAAA,MACxB;AAAA,IACA;AAAA,IACI,UAAU,EAAC,QAAQ,aAAY;AAAA,EACnC;AACA;AAMA,SAAS,mBAAmB,OAAO;AACjC,OAAK,MAAM,EAAC,MAAM,UAAU,UAAU,CAAA,EAAE,GAAG,KAAK;AAClD;AAMA,SAAS,kBAAkB,OAAO;AAChC,OAAK,KAAK,KAAK;AACjB;AAMA,SAAS,aAAaV,OAAM,GAAG,OAAO,MAAM;AAC1C,QAAM,UAAU,MAAM,cAAc,IAAI;AACxC,QAAM,OAAO,MAAM,MAAM,eAAe;AACxC,MAAI,QAAQ,QAAQ,KAAK,IAAI;AAC7B,WAAS,MAAM,kBAAkBA,OAAM;AAAA,IACrC,GAAG,QAAQ,QAAO;AAAA,IAClB,QAAQ;AAAA,IACR,OAAO;AAAA,EACX,CAAG;AACD,WAAS,QAAQ,KAAK,IAAI;AAC1B,OAAI;AACJ,SAAO;AACT;AAGA,SAAS,aAAa;AACpB,SAAO;AACT;ACnFO,SAAS,OAAOgB,OAAM,OAAO,QAAQ,OAAO;AACjD,QAAM,MAAMA,MAAK;AACjB,MAAI,aAAa;AAEjB,MAAI;AAGJ,MAAI,QAAQ,GAAG;AACb,YAAQ,CAAC,QAAQ,MAAM,IAAI,MAAM;AAAA,EACnC,OAAO;AACL,YAAQ,QAAQ,MAAM,MAAM;AAAA,EAC9B;AACA,WAAS,SAAS,IAAI,SAAS;AAG/B,MAAI,MAAM,SAAS,KAAO;AACxB,iBAAa,MAAM,KAAK,KAAK;AAC7B,eAAW,QAAQ,OAAO,MAAM;AAEhC,IAAAA,MAAK,OAAO,GAAG,UAAU;AAAA,EAC3B,OAAO;AAEL,QAAI,OAAQ,CAAAA,MAAK,OAAO,OAAO,MAAM;AAGrC,WAAO,aAAa,MAAM,QAAQ;AAChC,mBAAa,MAAM,MAAM,YAAY,aAAa,GAAK;AACvD,iBAAW,QAAQ,OAAO,CAAC;AAE3B,MAAAA,MAAK,OAAO,GAAG,UAAU;AACzB,oBAAc;AACd,eAAS;AAAA,IACX;AAAA,EACF;AACF;ACrCO,SAAS,kBAAkBJ,OAAM;AACtC,MAAIA,UAAS,QAAQ,0BAA0BA,KAAI,KAAK,kBAAkBA,KAAI,GAAG;AAC/E,WAAO;AAAA,EACT;AACA,MAAI,mBAAmBA,KAAI,GAAG;AAC5B,WAAO;AAAA,EACT;AACF;ACVO,SAAS,WAAW,YAAY,QAAQ,SAAS;AAEtD,QAAM,SAAS,CAAA;AACf,MAAI,QAAQ;AAEZ,SAAO,EAAE,QAAQ,WAAW,QAAQ;AAClC,UAAM,UAAU,WAAW,KAAK,EAAE;AAElC,QAAI,WAAW,CAAC,OAAO,SAAS,OAAO,GAAG;AACxC,eAAS,QAAQ,QAAQ,OAAO;AAChC,aAAO,KAAK,OAAO;AAAA,IACrB;AAAA,EACF;AAEA,SAAO;AACT;ACdO,SAAS,iBAAiB,SAAS;AACxC,QAAM,WAAsB,CAAA;AAC5B,MAAI,SAAS,SAAS;AACtB,QAAM,YAAY;AAAA,IAChB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,YAAY;AAAA,EAChB;AACE,MAAI,WAAW,QAAQ,WAAW,QAAW;AAC3C,aAAS;AAAA,EACX;AACA,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAAC,GAAG,GAAG;AAAA,IACb;AAAA,IACI,YAAY;AAAA,MACV,MAAM,CAAC,SAAS;AAAA,IACtB;AAAA,IACI,kBAAkB;AAAA,MAChB,MAAM,CAAC,GAAG;AAAA,IAChB;AAAA,EACA;AAOE,WAAS,wBAAwB,QAAQ,SAAS;AAChD,QAAI,QAAQ;AAGZ,WAAO,EAAE,QAAQ,OAAO,QAAQ;AAE9B,UAAI,OAAO,KAAK,EAAE,CAAC,MAAM,WAAW,OAAO,KAAK,EAAE,CAAC,EAAE,SAAS,oCAAoC,OAAO,KAAK,EAAE,CAAC,EAAE,QAAQ;AACzH,YAAI,OAAO;AAGX,eAAO,QAAQ;AAEb,cAAI,OAAO,IAAI,EAAE,CAAC,MAAM,UAAU,OAAO,IAAI,EAAE,CAAC,EAAE,SAAS,oCAAoC,OAAO,IAAI,EAAE,CAAC,EAAE;AAAA,UAE/G,OAAO,KAAK,EAAE,CAAC,EAAE,IAAI,SAAS,OAAO,KAAK,EAAE,CAAC,EAAE,MAAM,WAAW,OAAO,IAAI,EAAE,CAAC,EAAE,IAAI,SAAS,OAAO,IAAI,EAAE,CAAC,EAAE,MAAM,QAAQ;AACzH,mBAAO,KAAK,EAAE,CAAC,EAAE,OAAO;AACxB,mBAAO,IAAI,EAAE,CAAC,EAAE,OAAO;AAGvB,kBAAM,gBAAgB;AAAA,cACpB,MAAM;AAAA,cACN,OAAO,OAAO,OAAO,CAAA,GAAI,OAAO,IAAI,EAAE,CAAC,EAAE,KAAK;AAAA,cAC9C,KAAK,OAAO,OAAO,CAAA,GAAI,OAAO,KAAK,EAAE,CAAC,EAAE,GAAG;AAAA,YACzD;AAGY,kBAAMU,QAAO;AAAA,cACX,MAAM;AAAA,cACN,OAAO,OAAO,OAAO,CAAA,GAAI,OAAO,IAAI,EAAE,CAAC,EAAE,GAAG;AAAA,cAC5C,KAAK,OAAO,OAAO,CAAA,GAAI,OAAO,KAAK,EAAE,CAAC,EAAE,KAAK;AAAA,YAC3D;AAIY,kBAAM,aAAa,CAAC,CAAC,SAAS,eAAe,OAAO,GAAG,CAAC,SAAS,OAAO,IAAI,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,QAAQ,OAAO,IAAI,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,SAASA,OAAM,OAAO,CAAC;AACxJ,kBAAM,aAAa,QAAQ,OAAO,WAAW,WAAW;AACxD,gBAAI,YAAY;AAEd,qBAAO,YAAY,WAAW,QAAQ,GAAG,WAAW,YAAY,OAAO,MAAM,OAAO,GAAG,KAAK,GAAG,OAAO,CAAC;AAAA,YACzG;AAGA,mBAAO,YAAY,WAAW,QAAQ,GAAG,CAAC,CAAC,QAAQA,OAAM,OAAO,GAAG,CAAC,SAAS,OAAO,KAAK,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,QAAQ,OAAO,KAAK,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,QAAQ,eAAe,OAAO,CAAC,CAAC;AAC/K,mBAAO,QAAQ,OAAO,GAAG,QAAQ,OAAO,GAAG,UAAU;AACrD,oBAAQ,OAAO,WAAW,SAAS;AACnC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,YAAQ;AACR,WAAO,EAAE,QAAQ,OAAO,QAAQ;AAC9B,UAAI,OAAO,KAAK,EAAE,CAAC,EAAE,SAAS,kCAAkC;AAC9D,eAAO,KAAK,EAAE,CAAC,EAAE,OAAO;AAAA,MAC1B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAMA,WAAS,sBAAsB,SAASX,KAAI,KAAK;AAC/C,UAAMY,YAAW,KAAK;AACtB,UAAM,SAAS,KAAK;AACpB,QAAI,OAAO;AACX,WAAO;AAGP,aAAS,MAAMX,OAAM;AACnB,UAAIW,cAAa,OAAO,OAAO,OAAO,SAAS,CAAC,EAAE,CAAC,EAAE,SAAS,mBAAmB;AAC/E,eAAO,IAAIX,KAAI;AAAA,MACjB;AACA,cAAQ,MAAM,gCAAgC;AAC9C,aAAO,KAAKA,KAAI;AAAA,IAClB;AAGA,aAAS,KAAKA,OAAM;AAClB,YAAM,SAAS,kBAAkBW,SAAQ;AACzC,UAAIX,UAAS,KAAK;AAEhB,YAAI,OAAO,EAAG,QAAO,IAAIA,KAAI;AAC7B,gBAAQ,QAAQA,KAAI;AACpB;AACA,eAAO;AAAA,MACT;AACA,UAAI,OAAO,KAAK,CAAC,OAAQ,QAAO,IAAIA,KAAI;AACxC,YAAM,QAAQ,QAAQ,KAAK,gCAAgC;AAC3D,YAAM,QAAQ,kBAAkBA,KAAI;AACpC,YAAM,QAAQ,CAAC,SAAS,UAAU,KAAK,QAAQ,MAAM;AACrD,YAAM,SAAS,CAAC,UAAU,WAAW,KAAK,QAAQ,KAAK;AACvD,aAAOD,IAAGC,KAAI;AAAA,IAChB;AAAA,EACF;AACF;ACtHO,MAAM,+BAA+BjB,mBAAAA,cAAsB;AAAA,EAChD,0BACd,eACQ;AACR,WAAO,EAAE,UAAU,CAAC,aAAa,GAAG,MAAM,KAAK,gBAAc;AAAA,EAC/D;AAAA,EAEgB,sBACd,mBACkB;AAClB,WAAO;AAAA,MACL,IAAIC,mBAAAA;AAAAA,QACF;AAAA,QACA,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,MAEpD,IAAIA,mBAAAA;AAAAA,QACF;AAAA,QACA,kBAAkB,MAAM,KAAK,oBAAA,CAAqB;AAAA,MAAA;AAAA,IACpD;AAAA,EAEJ;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,UAAU;AAAA,QACR,EAAE,KAAK,IAAA;AAAA,QACP,EAAE,KAAK,MAAA;AAAA,QACP;AAAA,UACE,UAAU,CAAC,UACT,gCAAgC,KAAK,KAAK,KAAK;AAAA,UACjD,OAAO;AAAA,QAAA;AAAA,MACT;AAAA,MAEF,QAAuB;AACrB,eAAO,CAAC,KAAK,CAAC;AAAA,MAChB;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,0BACd,WAC+D;AAC/D,WAAO,UAAU;AAAA,MACf;AAAA,QACE,CAAC,kBAAkB;AAAA,QACnB,CAAC,8BAA8B;AAAA,QAC/B,CAAC,4BAA4B;AAAA,MAAA;AAAA,IAC/B;AAAA,EAEJ;AAAA,EAEgB,gBAA0B;AACxC,WAAO;AAAA,EACT;AAAA,EAEgB,4BACd,OACA,mBACA,mBACwB;AACxB,WAAO,kBAAkB;AAAA,MAAI,CAAC,UAC5B,MAAM;AAAA,QACJ,MAAM,MAAM,OAAO;AAAA,UACjB,kBAAkB,MAAM,KAAK,oBAAA,CAAqB,EAAE,OAAA;AAAA,QAAO,CAC5D;AAAA,MAAA;AAAA,IACH;AAAA,EAEJ;AACF;ACnFO,SAAS,WAAWI,OAAM,GAAG,OAAO,MAAM;AAC/C,QAAM,OAAO,MAAM,MAAM,YAAY;AACrC,QAAM,UAAU,MAAM,cAAc,IAAI;AACxC,UAAQ,KAAK,IAAI;AACjB,UAAQ,MAAM,CAAC;AACf,QAAM,QAAQ,MAAM;AAAA,IAClB,MAAM,cAAcA,OAAM,QAAQ,QAAO,CAAE;AAAA,IAC3CwB;AAAAA,EACJ;AACE,OAAI;AACJ,SAAO;AACT;AAGA,SAASA,MAAI,MAAM,GAAG,OAAO;AAC3B,SAAO,OAAO,QAAQ,KAAK,OAAO;AACpC;ACnBO,SAAS,eAAe,OAAO,SAAS;AAC7C,SACE,YAAY,OAAO,QAAQ,aAAa,IAAI,KAC5C,CAAC,YAAY,OAAO,QAAQ,gBAAgB,KAAK;AAErD;AAQA,SAAS,YAAY,OAAOR,OAAM,MAAM;AACtC,MAAI,OAAOA,UAAS,UAAU;AAC5B,IAAAA,QAAO,CAACA,KAAI;AAAA,EACd;AAEA,MAAI,CAACA,SAAQA,MAAK,WAAW,GAAG;AAC9B,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ;AAEZ,SAAO,EAAE,QAAQA,MAAK,QAAQ;AAC5B,QAAI,MAAM,SAASA,MAAK,KAAK,CAAC,GAAG;AAC/B,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AC1BO,SAAS,UAAU,GAAG,IAAI,OAAO,MAAM;AAC5C,MAAI,QAAQ;AAEZ,SAAO,EAAE,QAAQ,MAAM,OAAO,QAAQ;AAGpC,QACE,MAAM,OAAO,KAAK,EAAE,cAAc,QAClC,eAAe,MAAM,OAAO,MAAM,OAAO,KAAK,CAAC,GAC/C;AACA,aAAO,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK;AAAA,IAC1C;AAAA,EACF;AAEA,SAAO;AACT;ACnBO,SAAS,cAAc,OAAO,WAAW;AAC9C,QAAM,SAAS,OAAO,KAAK;AAC3B,MAAI,QAAQ,OAAO,QAAQ,SAAS;AACpC,MAAI,WAAW;AACf,MAAI,QAAQ;AACZ,MAAI,MAAM;AAEV,MAAI,OAAO,cAAc,UAAU;AACjC,UAAM,IAAI,UAAU,oBAAoB;AAAA,EAC1C;AAEA,SAAO,UAAU,IAAI;AACnB,QAAI,UAAU,UAAU;AACtB,UAAI,EAAE,QAAQ,KAAK;AACjB,cAAM;AAAA,MACR;AAAA,IACF,OAAO;AACL,cAAQ;AAAA,IACV;AAEA,eAAW,QAAQ,UAAU;AAC7B,YAAQ,OAAO,QAAQ,WAAW,QAAQ;AAAA,EAC5C;AAEA,SAAO;AACT;ACzBO,SAAS,qBAAqBhB,OAAM,OAAO;AAChD,SAAO;AAAA,IACL,MAAM,QAAQ,WAAW,SACvBA,MAAK;AAAA,IAEL,CAACA,MAAK;AAAA,IAEN,WAAW,KAAKA,MAAK,KAAK;AAAA,IAE1B,CAAC,0CAA0C,KAAKA,MAAK,KAAK;AAAA,EAChE;AACA;ACbO,SAAS,WAAW,OAAO;AAChC,QAAM,SAAS,MAAM,QAAQ,SAAS;AAEtC,MAAI,WAAW,OAAO,WAAW,KAAK;AACpC,UAAM,IAAI;AAAA,MACR,iCACE,SACA;AAAA,IACR;AAAA,EACE;AAEA,SAAO;AACT;ACJO,SAAS,KAAKA,OAAM,GAAG,OAAO,MAAM;AACzC,QAAM,SAAS,WAAW,KAAK;AAC/B,QAAM,MAAMA,MAAK,SAAS;AAC1B,QAAM,SAAS,WAAW,MAAM,gBAAgB;AAEhD,MAAI,qBAAqBA,OAAM,KAAK,GAAG;AACrC,UAAMyB,QAAO,MAAM,MAAM,cAAc;AACvC,UAAMC,SAAQ,MAAM,YAAY,KAAK,GAAG;AACxC,IAAAD,MAAI;AACJ,WAAOC;AAAA,EACT;AAEA,QAAM,UAAU,MAAM,cAAc,IAAI;AACxC,QAAM,WAAW,OAAO,OAAO,KAAK,IAAI,cAAc,KAAK,MAAM,IAAI,GAAG,CAAC,CAAC;AAC1E,QAAM,OAAO,MAAM,MAAM,YAAY;AACrC,MAAI,QAAQ,QAAQ,KAAK,QAAQ;AAEjC,MAAI1B,MAAK,MAAM;AACb,UAAM,UAAU,MAAM,MAAM,iBAAiB,MAAM,EAAE;AACrD,aAAS,QAAQ;AAAA,MACf,MAAM,KAAKA,MAAK,MAAM;AAAA,QACpB,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,QAAQ,CAAC,GAAG;AAAA,QACZ,GAAG,QAAQ,QAAO;AAAA,MAC1B,CAAO;AAAA,IACP;AACI,YAAO;AAAA,EACT;AAEA,MAAIA,MAAK,QAAQA,MAAK,MAAM;AAC1B,UAAM,UAAU,MAAM,MAAM,iBAAiB,MAAM,EAAE;AACrD,aAAS,QAAQ,KAAK,GAAG;AACzB,aAAS,QAAQ;AAAA,MACf,MAAM,KAAKA,MAAK,MAAM;AAAA,QACpB,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,QAAQ,CAAC,GAAG;AAAA,QACZ,GAAG,QAAQ,QAAO;AAAA,MAC1B,CAAO;AAAA,IACP;AACI,YAAO;AAAA,EACT;AAEA,WAAS,QAAQ,KAAK,IAAI;AAE1B,MAAI,KAAK;AACP,aAAS,QAAQ,KAAK,MAAM,IAAI;AAAA,EAClC;AAEA,WAAS,QAAQ,KAAK,QAAQ;AAC9B,OAAI;AACJ,SAAO;AACT;AAGA,SAAS,IAAI,MAAM,GAAG,OAAO;AAC3B,UAAQ,QAAQ,KAAK,UAAU;AACjC;AClEO,SAAS,WAAW,OAAO;AAChC,QAAM,SAAS,MAAM,QAAQ,SAAS;AAEtC,MAAI,WAAW,OAAO,WAAW,KAAK;AACpC,UAAM,IAAI;AAAA,MACR,kCACE,SACA;AAAA,IACR;AAAA,EACE;AAEA,SAAO;AACT;ACNO,SAAS,WAAWA,OAAM,GAAG,OAAO,MAAM;AAC/C,QAAM,QAAQ,WAAW,KAAK;AAC9B,QAAM,SAAS,UAAU,MAAM,UAAU;AACzC,QAAM,OAAO,MAAM,MAAM,YAAY;AACrC,MAAI,UAAU,MAAM,MAAM,OAAO;AACjC,QAAM,UAAU,MAAM,cAAc,IAAI;AACxC,MAAI,QAAQ,QAAQ,KAAK,GAAG;AAC5B,WAAS,QAAQ;AAAA,IACf,MAAM,KAAK,MAAM,cAAcA,KAAI,GAAG;AAAA,MACpC,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,GAAG,QAAQ,QAAO;AAAA,IACxB,CAAK;AAAA,EACL;AACE,WAAS,QAAQ,KAAK,KAAK;AAE3B,UAAO;AAEP;AAAA;AAAA,IAEE,CAACA,MAAK;AAAA,IAEN,eAAe,KAAKA,MAAK,GAAG;AAAA,IAC5B;AACA,cAAU,MAAM,MAAM,oBAAoB;AAC1C,aAAS,QAAQ,KAAK,GAAG;AACzB,aAAS,QAAQ;AAAA,MACf,MAAM,KAAKA,MAAK,KAAK,EAAC,QAAQ,OAAO,OAAO,KAAK,GAAG,QAAQ,QAAO,EAAE,CAAC;AAAA,IAC5E;AACI,aAAS,QAAQ,KAAK,GAAG;AAAA,EAC3B,OAAO;AAEL,cAAU,MAAM,MAAM,gBAAgB;AACtC,aAAS,QAAQ;AAAA,MACf,MAAM,KAAKA,MAAK,KAAK;AAAA,QACnB,QAAQ;AAAA,QACR,OAAOA,MAAK,QAAQ,MAAM;AAAA,QAC1B,GAAG,QAAQ,QAAO;AAAA,MAC1B,CAAO;AAAA,IACP;AAAA,EACE;AAEA,UAAO;AAEP,MAAIA,MAAK,OAAO;AACd,cAAU,MAAM,MAAM,QAAQ,MAAM,EAAE;AACtC,aAAS,QAAQ,KAAK,MAAM,KAAK;AACjC,aAAS,QAAQ;AAAA,MACf,MAAM,KAAKA,MAAK,OAAO;AAAA,QACrB,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,GAAG,QAAQ,QAAO;AAAA,MAC1B,CAAO;AAAA,IACP;AACI,aAAS,QAAQ,KAAK,KAAK;AAC3B,YAAO;AAAA,EACT;AAEA,OAAI;AAEJ,SAAO;AACT;ACnEO,SAAS,cAAc,OAAO;AACnC,QAAM,SAAS,MAAM,QAAQ,YAAY;AAEzC,MAAI,WAAW,OAAO,WAAW,KAAK;AACpC,UAAM,IAAI;AAAA,MACR,qCACE,SACA;AAAA,IACR;AAAA,EACE;AAEA,SAAO;AACT;ACZO,SAAS,yBAAyBY,OAAM;AAC7C,SAAO,QAAQA,MAAK,SAAS,EAAE,EAAE,YAAW,IAAK;AACnD;AC8BO,SAAS,WAAW,SAAS,QAAQ,QAAQ;AAClD,QAAM,cAAc,kBAAkB,OAAO;AAC7C,QAAM,aAAa,kBAAkB,MAAM;AAG3C,MAAI,gBAAgB,QAAW;AAC7B,WAAO,eAAe;AAAA;AAAA;AAAA;AAAA,MAIlB,WAAW,MACT,EAAC,QAAQ,MAAM,SAAS,KAAI,IAC5B,EAAC,QAAQ,OAAO,SAAS,MAAK;AAAA,QAChC,eAAe;AAAA;AAAA,MAEb,EAAC,QAAQ,MAAM,SAAS,KAAI;AAAA;AAAA;AAAA,MAE5B,EAAC,QAAQ,OAAO,SAAS,KAAI;AAAA;AAAA,EACrC;AAGA,MAAI,gBAAgB,GAAG;AACrB,WAAO,eAAe;AAAA;AAAA,MAElB,EAAC,QAAQ,OAAO,SAAS,MAAK;AAAA,QAC9B,eAAe;AAAA;AAAA,MAEb,EAAC,QAAQ,MAAM,SAAS,KAAI;AAAA;AAAA;AAAA,MAE5B,EAAC,QAAQ,OAAO,SAAS,MAAK;AAAA;AAAA,EACtC;AAGA,SAAO,eAAe;AAAA;AAAA,IAElB,EAAC,QAAQ,OAAO,SAAS,MAAK;AAAA,MAC9B,eAAe;AAAA;AAAA,IAEb,EAAC,QAAQ,MAAM,SAAS,MAAK;AAAA;AAAA;AAAA,IAE7B,EAAC,QAAQ,OAAO,SAAS,MAAK;AAAA;AACtC;ACxEA,SAAS,OAAO;AAST,SAAS,SAASZ,OAAM,GAAG,OAAO,MAAM;AAC7C,QAAM,SAAS,cAAc,KAAK;AAClC,QAAM,OAAO,MAAM,MAAM,UAAU;AACnC,QAAM,UAAU,MAAM,cAAc,IAAI;AACxC,QAAM,SAAS,QAAQ,KAAK,MAAM;AAElC,MAAI,UAAU,QAAQ;AAAA,IACpB,MAAM,kBAAkBA,OAAM;AAAA,MAC5B,OAAO;AAAA,MACP;AAAA,MACA,GAAG,QAAQ,QAAO;AAAA,IACxB,CAAK;AAAA,EACL;AACE,QAAM,cAAc,QAAQ,WAAW,CAAC;AACxC,QAAM,OAAO;AAAA,IACX,KAAK,OAAO,WAAW,KAAK,OAAO,SAAS,CAAC;AAAA,IAC7C;AAAA,IACA;AAAA,EACJ;AAEE,MAAI,KAAK,QAAQ;AACf,cAAU,yBAAyB,WAAW,IAAI,QAAQ,MAAM,CAAC;AAAA,EACnE;AAEA,QAAM,cAAc,QAAQ,WAAW,QAAQ,SAAS,CAAC;AACzD,QAAM,QAAQ,WAAW,KAAK,MAAM,WAAW,CAAC,GAAG,aAAa,MAAM;AAEtE,MAAI,MAAM,QAAQ;AAChB,cAAU,QAAQ,MAAM,GAAG,EAAE,IAAI,yBAAyB,WAAW;AAAA,EACvE;AAEA,QAAM,QAAQ,QAAQ,KAAK,MAAM;AAEjC,OAAI;AAEJ,QAAM,iCAAiC;AAAA,IACrC,OAAO,MAAM;AAAA,IACb,QAAQ,KAAK;AAAA,EACjB;AACE,SAAO,SAAS,UAAU;AAC5B;AAQA,SAAS,aAAa,GAAG,IAAI,OAAO;AAClC,SAAO,MAAM,QAAQ,YAAY;AACnC;ACkNO,SAAS,MAAM,MAAM,eAAe,kBAAkB,cAAc;AAEzE,MAAI;AAEJ,MAAI;AAEJ,MAAI;AAEJ,MACE,OAAO,kBAAkB,cACzB,OAAO,qBAAqB,YAC5B;AACA,WAAO;AACP,cAAU;AACV,cAAU;AAAA,EACZ,OAAO;AAEL,WAAO;AAEP,cAAU;AACV,cAAU;AAAA,EACZ;AAEA,eAAa,MAAM,MAAM,UAAU,OAAO;AAM1C,WAAS,SAASA,OAAM,SAAS;AAC/B,UAAM,SAAS,QAAQ,QAAQ,SAAS,CAAC;AACzC,UAAM,QAAQ,SAAS,OAAO,SAAS,QAAQA,KAAI,IAAI;AACvD,WAAO,QAAQA,OAAM,OAAO,MAAM;AAAA,EACpC;AACF;AC5SA,MAAM,eAAe,CAAA;AAed,SAAS,SAAS,OAAO,SAAS;AACvC,QAAM,WAAsB;AAC5B,QAAM,kBACJ,OAAO,SAAS,oBAAoB,YAChC,SAAS,kBACT;AACN,QAAM,cACJ,OAAO,SAAS,gBAAgB,YAAY,SAAS,cAAc;AAErE,SAAO,IAAI,OAAO,iBAAiB,WAAW;AAChD;AAcA,SAAS,IAAI,OAAO,iBAAiB,aAAa;AAChD,MAAI,KAAK,KAAK,GAAG;AACf,QAAI,WAAW,OAAO;AACpB,aAAO,MAAM,SAAS,UAAU,CAAC,cAAc,KAAK,MAAM;AAAA,IAC5D;AAEA,QAAI,mBAAmB,SAAS,SAAS,MAAM,KAAK;AAClD,aAAO,MAAM;AAAA,IACf;AAEA,QAAI,cAAc,OAAO;AACvB,aAAO,IAAI,MAAM,UAAU,iBAAiB,WAAW;AAAA,IACzD;AAAA,EACF;AAEA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO,IAAI,OAAO,iBAAiB,WAAW;AAAA,EAChD;AAEA,SAAO;AACT;AAcA,SAAS,IAAI,QAAQ,iBAAiB,aAAa;AAEjD,QAAM,SAAS,CAAA;AACf,MAAI,QAAQ;AAEZ,SAAO,EAAE,QAAQ,OAAO,QAAQ;AAC9B,WAAO,KAAK,IAAI,IAAI,OAAO,KAAK,GAAG,iBAAiB,WAAW;AAAA,EACjE;AAEA,SAAO,OAAO,KAAK,EAAE;AACvB;AAUA,SAAS,KAAK,OAAO;AACnB,SAAO,QAAQ,SAAS,OAAO,UAAU,QAAQ;AACnD;AC9FO,SAAS,sBAAsBA,OAAM,OAAO;AACjD,MAAI,mBAAmB;AAIvB,QAAMA,OAAM,SAAUA,OAAM;AAC1B,QACG,WAAWA,SAAQ,WAAW,KAAKA,MAAK,KAAK,KAC9CA,MAAK,SAAS,SACd;AACA,yBAAmB;AACnB,aAAO;AAAA,IACT;AAAA,EACF,CAAC;AAED,SAAO;AAAA,KACJ,CAACA,MAAK,SAASA,MAAK,QAAQ,MAC3B,SAASA,KAAI,MACZ,MAAM,QAAQ,UAAU;AAAA,EAC/B;AACA;AClBO,SAAS,QAAQA,OAAM,GAAG,OAAO,MAAM;AAC5C,QAAM,OAAO,KAAK,IAAI,KAAK,IAAI,GAAGA,MAAK,SAAS,CAAC,GAAG,CAAC;AACrD,QAAM,UAAU,MAAM,cAAc,IAAI;AAExC,MAAI,sBAAsBA,OAAM,KAAK,GAAG;AACtC,UAAMyB,QAAO,MAAM,MAAM,eAAe;AACxC,UAAME,WAAU,MAAM,MAAM,UAAU;AACtC,UAAMD,SAAQ,MAAM,kBAAkB1B,OAAM;AAAA,MAC1C,GAAG,QAAQ,QAAO;AAAA,MAClB,QAAQ;AAAA,MACR,OAAO;AAAA,IACb,CAAK;AACD,IAAA2B,SAAO;AACP,IAAAF,MAAI;AAEJ,WACEC,SACA,QACC,SAAS,IAAI,MAAM,KAAK;AAAA;AAAA,MAEvBA,OAAM;AAAA;AAAA,OAGH,KAAK,IAAIA,OAAM,YAAY,IAAI,GAAGA,OAAM,YAAY,IAAI,CAAC,IAAI;AAAA,IACxE;AAAA,EAEE;AAEA,QAAM,WAAW,IAAI,OAAO,IAAI;AAChC,QAAM,OAAO,MAAM,MAAM,YAAY;AACrC,QAAM,UAAU,MAAM,MAAM,UAAU;AAMtC,UAAQ,KAAK,WAAW,GAAG;AAE3B,MAAI,QAAQ,MAAM,kBAAkB1B,OAAM;AAAA,IACxC,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,GAAG,QAAQ,QAAO;AAAA,EACtB,CAAG;AAED,MAAI,SAAS,KAAK,KAAK,GAAG;AAExB,YAAQ,yBAAyB,MAAM,WAAW,CAAC,CAAC,IAAI,MAAM,MAAM,CAAC;AAAA,EACvE;AAEA,UAAQ,QAAQ,WAAW,MAAM,QAAQ;AAEzC,MAAI,MAAM,QAAQ,UAAU;AAC1B,aAAS,MAAM;AAAA,EACjB;AAEA,UAAO;AACP,OAAI;AAEJ,SAAO;AACT;ACtEA,KAAK,OAAO;AAML,SAAS,KAAKA,OAAM;AACzB,SAAOA,MAAK,SAAS;AACvB;AAKA,SAAS,WAAW;AAClB,SAAO;AACT;ACZA,MAAM,OAAO;AASN,SAAS,MAAMA,OAAM,GAAG,OAAO,MAAM;AAC1C,QAAM,QAAQ,WAAW,KAAK;AAC9B,QAAM,SAAS,UAAU,MAAM,UAAU;AACzC,QAAM,OAAO,MAAM,MAAM,OAAO;AAChC,MAAI,UAAU,MAAM,MAAM,OAAO;AACjC,QAAM,UAAU,MAAM,cAAc,IAAI;AACxC,MAAI,QAAQ,QAAQ,KAAK,IAAI;AAC7B,WAAS,QAAQ;AAAA,IACf,MAAM,KAAKA,MAAK,KAAK,EAAC,QAAQ,OAAO,OAAO,KAAK,GAAG,QAAQ,QAAO,EAAE,CAAC;AAAA,EAC1E;AACE,WAAS,QAAQ,KAAK,IAAI;AAE1B,UAAO;AAEP;AAAA;AAAA,IAEG,CAACA,MAAK,OAAOA,MAAK;AAAA,IAEnB,eAAe,KAAKA,MAAK,GAAG;AAAA,IAC5B;AACA,cAAU,MAAM,MAAM,oBAAoB;AAC1C,aAAS,QAAQ,KAAK,GAAG;AACzB,aAAS,QAAQ;AAAA,MACf,MAAM,KAAKA,MAAK,KAAK,EAAC,QAAQ,OAAO,OAAO,KAAK,GAAG,QAAQ,QAAO,EAAE,CAAC;AAAA,IAC5E;AACI,aAAS,QAAQ,KAAK,GAAG;AAAA,EAC3B,OAAO;AAEL,cAAU,MAAM,MAAM,gBAAgB;AACtC,aAAS,QAAQ;AAAA,MACf,MAAM,KAAKA,MAAK,KAAK;AAAA,QACnB,QAAQ;AAAA,QACR,OAAOA,MAAK,QAAQ,MAAM;AAAA,QAC1B,GAAG,QAAQ,QAAO;AAAA,MAC1B,CAAO;AAAA,IACP;AAAA,EACE;AAEA,UAAO;AAEP,MAAIA,MAAK,OAAO;AACd,cAAU,MAAM,MAAM,QAAQ,MAAM,EAAE;AACtC,aAAS,QAAQ,KAAK,MAAM,KAAK;AACjC,aAAS,QAAQ;AAAA,MACf,MAAM,KAAKA,MAAK,OAAO;AAAA,QACrB,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,GAAG,QAAQ,QAAO;AAAA,MAC1B,CAAO;AAAA,IACP;AACI,aAAS,QAAQ,KAAK,KAAK;AAC3B,YAAO;AAAA,EACT;AAEA,WAAS,QAAQ,KAAK,GAAG;AACzB,OAAI;AAEJ,SAAO;AACT;AAKA,SAAS,YAAY;AACnB,SAAO;AACT;AC5EA,eAAe,OAAO;AASf,SAAS,eAAeA,OAAM,GAAG,OAAO,MAAM;AACnD,QAAM,OAAOA,MAAK;AAClB,QAAM,OAAO,MAAM,MAAM,gBAAgB;AACzC,MAAI,UAAU,MAAM,MAAM,OAAO;AACjC,QAAM,UAAU,MAAM,cAAc,IAAI;AACxC,MAAI,QAAQ,QAAQ,KAAK,IAAI;AAC7B,QAAM,MAAM,MAAM,KAAKA,MAAK,KAAK;AAAA,IAC/B,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,GAAG,QAAQ,QAAO;AAAA,EACtB,CAAG;AACD,WAAS,QAAQ,KAAK,MAAM,IAAI;AAEhC,UAAO;AAEP,QAAM,QAAQ,MAAM;AACpB,QAAM,QAAQ,CAAA;AACd,YAAU,MAAM,MAAM,WAAW;AAKjC,QAAM,YAAY,MAAM,KAAK,MAAM,cAAcA,KAAI,GAAG;AAAA,IACtD,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,GAAG,QAAQ,QAAO;AAAA,EACtB,CAAG;AACD,UAAO;AACP,QAAM,QAAQ;AACd,OAAI;AAEJ,MAAI,SAAS,UAAU,CAAC,OAAO,QAAQ,WAAW;AAChD,aAAS,QAAQ,KAAK,YAAY,GAAG;AAAA,EACvC,WAAW,SAAS,YAAY;AAE9B,YAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,EAC3B,OAAO;AACL,aAAS,QAAQ,KAAK,GAAG;AAAA,EAC3B;AAEA,SAAO;AACT;AAKA,SAAS,qBAAqB;AAC5B,SAAO;AACT;ACzDA,WAAW,OAAO;AAQX,SAAS,WAAWA,OAAM,GAAG,OAAO;AACzC,MAAI,QAAQA,MAAK,SAAS;AAC1B,MAAI,WAAW;AACf,MAAI,QAAQ;AAKZ,SAAO,IAAI,OAAO,aAAa,WAAW,UAAU,EAAE,KAAK,KAAK,GAAG;AACjE,gBAAY;AAAA,EACd;AAIA,MACE,WAAW,KAAK,KAAK,MACnB,WAAW,KAAK,KAAK,KAAK,WAAW,KAAK,KAAK,KAAM,QAAQ,KAAK,KAAK,IACzE;AACA,YAAQ,MAAM,QAAQ;AAAA,EACxB;AASA,SAAO,EAAE,QAAQ,MAAM,OAAO,QAAQ;AACpC,UAAM,UAAU,MAAM,OAAO,KAAK;AAClC,UAAM,aAAa,MAAM,eAAe,OAAO;AAE/C,QAAI;AAKJ,QAAI,CAAC,QAAQ,QAAS;AAEtB,WAAQ,QAAQ,WAAW,KAAK,KAAK,GAAI;AACvC,UAAI,WAAW,MAAM;AAGrB,UACE,MAAM,WAAW,QAAQ,MAAM,MAC/B,MAAM,WAAW,WAAW,CAAC,MAAM,IACnC;AACA;AAAA,MACF;AAEA,cAAQ,MAAM,MAAM,GAAG,QAAQ,IAAI,MAAM,MAAM,MAAM,MAAM,QAAQ,CAAC;AAAA,IACtE;AAAA,EACF;AAEA,SAAO,WAAW,QAAQ;AAC5B;AAKA,SAAS,iBAAiB;AACxB,SAAO;AACT;AC/DO,SAAS,qBAAqBA,OAAM,OAAO;AAChD,QAAM,MAAM,SAASA,KAAI;AAEzB,SAAO;AAAA,IACL,CAAC,MAAM,QAAQ;AAAA,IAEbA,MAAK;AAAA,IAEL,CAACA,MAAK;AAAA,IAENA,MAAK,YACLA,MAAK,SAAS,WAAW,KACzBA,MAAK,SAAS,CAAC,EAAE,SAAS;AAAA,KAEzB,QAAQA,MAAK,OAAO,YAAY,QAAQA,MAAK;AAAA,IAE9C,oBAAoB,KAAKA,MAAK,GAAG;AAAA;AAAA,IAGjC,CAAC,iBAAiB,KAAKA,MAAK,GAAG;AAAA,EACrC;AACA;ACxBA,KAAK,OAAO;AASL,SAAS,KAAKA,OAAM,GAAG,OAAO,MAAM;AACzC,QAAM,QAAQ,WAAW,KAAK;AAC9B,QAAM,SAAS,UAAU,MAAM,UAAU;AACzC,QAAM,UAAU,MAAM,cAAc,IAAI;AAExC,MAAI;AAEJ,MAAI;AAEJ,MAAI,qBAAqBA,OAAM,KAAK,GAAG;AAErC,UAAM,QAAQ,MAAM;AACpB,UAAM,QAAQ,CAAA;AACd,WAAO,MAAM,MAAM,UAAU;AAC7B,QAAI0B,SAAQ,QAAQ,KAAK,GAAG;AAC5B,IAAAA,UAAS,QAAQ;AAAA,MACf,MAAM,kBAAkB1B,OAAM;AAAA,QAC5B,QAAQ0B;AAAA,QACR,OAAO;AAAA,QACP,GAAG,QAAQ,QAAO;AAAA,MAC1B,CAAO;AAAA,IACP;AACI,IAAAA,UAAS,QAAQ,KAAK,GAAG;AACzB,SAAI;AACJ,UAAM,QAAQ;AACd,WAAOA;AAAA,EACT;AAEA,SAAO,MAAM,MAAM,MAAM;AACzB,YAAU,MAAM,MAAM,OAAO;AAC7B,MAAI,QAAQ,QAAQ,KAAK,GAAG;AAC5B,WAAS,QAAQ;AAAA,IACf,MAAM,kBAAkB1B,OAAM;AAAA,MAC5B,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,GAAG,QAAQ,QAAO;AAAA,IACxB,CAAK;AAAA,EACL;AACE,WAAS,QAAQ,KAAK,IAAI;AAC1B,UAAO;AAEP;AAAA;AAAA,IAEG,CAACA,MAAK,OAAOA,MAAK;AAAA,IAEnB,eAAe,KAAKA,MAAK,GAAG;AAAA,IAC5B;AACA,cAAU,MAAM,MAAM,oBAAoB;AAC1C,aAAS,QAAQ,KAAK,GAAG;AACzB,aAAS,QAAQ;AAAA,MACf,MAAM,KAAKA,MAAK,KAAK,EAAC,QAAQ,OAAO,OAAO,KAAK,GAAG,QAAQ,QAAO,EAAE,CAAC;AAAA,IAC5E;AACI,aAAS,QAAQ,KAAK,GAAG;AAAA,EAC3B,OAAO;AAEL,cAAU,MAAM,MAAM,gBAAgB;AACtC,aAAS,QAAQ;AAAA,MACf,MAAM,KAAKA,MAAK,KAAK;AAAA,QACnB,QAAQ;AAAA,QACR,OAAOA,MAAK,QAAQ,MAAM;AAAA,QAC1B,GAAG,QAAQ,QAAO;AAAA,MAC1B,CAAO;AAAA,IACP;AAAA,EACE;AAEA,UAAO;AAEP,MAAIA,MAAK,OAAO;AACd,cAAU,MAAM,MAAM,QAAQ,MAAM,EAAE;AACtC,aAAS,QAAQ,KAAK,MAAM,KAAK;AACjC,aAAS,QAAQ;AAAA,MACf,MAAM,KAAKA,MAAK,OAAO;AAAA,QACrB,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,GAAG,QAAQ,QAAO;AAAA,MAC1B,CAAO;AAAA,IACP;AACI,aAAS,QAAQ,KAAK,KAAK;AAC3B,YAAO;AAAA,EACT;AAEA,WAAS,QAAQ,KAAK,GAAG;AAEzB,OAAI;AACJ,SAAO;AACT;AAQA,SAAS,SAASA,OAAM,GAAG,OAAO;AAChC,SAAO,qBAAqBA,OAAM,KAAK,IAAI,MAAM;AACnD;AC5GA,cAAc,OAAO;AASd,SAAS,cAAcA,OAAM,GAAG,OAAO,MAAM;AAClD,QAAM,OAAOA,MAAK;AAClB,QAAM,OAAO,MAAM,MAAM,eAAe;AACxC,MAAI,UAAU,MAAM,MAAM,OAAO;AACjC,QAAM,UAAU,MAAM,cAAc,IAAI;AACxC,MAAI,QAAQ,QAAQ,KAAK,GAAG;AAC5B,QAAMsB,QAAO,MAAM,kBAAkBtB,OAAM;AAAA,IACzC,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,GAAG,QAAQ,QAAO;AAAA,EACtB,CAAG;AACD,WAAS,QAAQ,KAAKsB,QAAO,IAAI;AAEjC,UAAO;AAEP,QAAM,QAAQ,MAAM;AACpB,QAAM,QAAQ,CAAA;AACd,YAAU,MAAM,MAAM,WAAW;AAKjC,QAAM,YAAY,MAAM,KAAK,MAAM,cAActB,KAAI,GAAG;AAAA,IACtD,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,GAAG,QAAQ,QAAO;AAAA,EACtB,CAAG;AACD,UAAO;AACP,QAAM,QAAQ;AACd,OAAI;AAEJ,MAAI,SAAS,UAAU,CAACsB,SAAQA,UAAS,WAAW;AAClD,aAAS,QAAQ,KAAK,YAAY,GAAG;AAAA,EACvC,WAAW,SAAS,YAAY;AAE9B,YAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,EAC3B,OAAO;AACL,aAAS,QAAQ,KAAK,GAAG;AAAA,EAC3B;AAEA,SAAO;AACT;AAKA,SAAS,oBAAoB;AAC3B,SAAO;AACT;ACtDO,SAAS,YAAY,OAAO;AACjC,QAAM,SAAS,MAAM,QAAQ,UAAU;AAEvC,MAAI,WAAW,OAAO,WAAW,OAAO,WAAW,KAAK;AACtD,UAAM,IAAI;AAAA,MACR,kCACE,SACA;AAAA,IACR;AAAA,EACE;AAEA,SAAO;AACT;ACVO,SAAS,iBAAiB,OAAO;AACtC,QAAM,SAAS,YAAY,KAAK;AAChC,QAAM,cAAc,MAAM,QAAQ;AAElC,MAAI,CAAC,aAAa;AAChB,WAAO,WAAW,MAAM,MAAM;AAAA,EAChC;AAEA,MAAI,gBAAgB,OAAO,gBAAgB,OAAO,gBAAgB,KAAK;AACrE,UAAM,IAAI;AAAA,MACR,kCACE,cACA;AAAA,IACR;AAAA,EACE;AAEA,MAAI,gBAAgB,QAAQ;AAC1B,UAAM,IAAI;AAAA,MACR,yBACE,SACA,4BACA,cACA;AAAA,IACR;AAAA,EACE;AAEA,SAAO;AACT;AC7BO,SAAS,mBAAmB,OAAO;AACxC,QAAM,SAAS,MAAM,QAAQ,iBAAiB;AAE9C,MAAI,WAAW,OAAO,WAAW,KAAK;AACpC,UAAM,IAAI;AAAA,MACR,kCACE,SACA;AAAA,IACR;AAAA,EACE;AAEA,SAAO;AACT;ACZO,SAAS,UAAU,OAAO;AAC/B,QAAM,SAAS,MAAM,QAAQ,QAAQ;AAErC,MAAI,WAAW,OAAO,WAAW,OAAO,WAAW,KAAK;AACtD,UAAM,IAAI;AAAA,MACR,kCACE,SACA;AAAA,IACR;AAAA,EACE;AAEA,SAAO;AACT;ACHO,SAAS,KAAKtB,OAAM,QAAQ,OAAO,MAAM;AAC9C,QAAM,OAAO,MAAM,MAAM,MAAM;AAC/B,QAAM,gBAAgB,MAAM;AAE5B,MAAI,SAASA,MAAK,UAAU,mBAAmB,KAAK,IAAI,YAAY,KAAK;AAEzE,QAAM,cAAcA,MAAK,UACrB,WAAW,MACT,MACA,MACF,iBAAiB,KAAK;AAC1B,MAAI,qBACF,UAAU,MAAM,iBAAiB,WAAW,MAAM,iBAAiB;AAErE,MAAI,CAACA,MAAK,SAAS;AACjB,UAAM,gBAAgBA,MAAK,WAAWA,MAAK,SAAS,CAAC,IAAI;AAUzD;AAAA;AAAA,OAEG,WAAW,OAAO,WAAW;AAAA,MAE9B,kBACC,CAAC,cAAc,YAAY,CAAC,cAAc,SAAS,CAAC;AAAA,MAErD,MAAM,MAAM,MAAM,MAAM,SAAS,CAAC,MAAM,UACxC,MAAM,MAAM,MAAM,MAAM,SAAS,CAAC,MAAM,cACxC,MAAM,MAAM,MAAM,MAAM,SAAS,CAAC,MAAM,UACxC,MAAM,MAAM,MAAM,MAAM,SAAS,CAAC,MAAM;AAAA,MAExC,MAAM,WAAW,MAAM,WAAW,SAAS,CAAC,MAAM,KAClD,MAAM,WAAW,MAAM,WAAW,SAAS,CAAC,MAAM,KAClD,MAAM,WAAW,MAAM,WAAW,SAAS,CAAC,MAAM;AAAA,MAClD;AACA,2BAAqB;AAAA,IACvB;AAUA,QAAI,UAAU,KAAK,MAAM,UAAU,eAAe;AAChD,UAAI,QAAQ;AAEZ,aAAO,EAAE,QAAQA,MAAK,SAAS,QAAQ;AACrC,cAAM,OAAOA,MAAK,SAAS,KAAK;AAEhC,YACE,QACA,KAAK,SAAS,cACd,KAAK,YACL,KAAK,SAAS,CAAC,KACf,KAAK,SAAS,CAAC,EAAE,SAAS,iBAC1B;AACA,+BAAqB;AACrB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,oBAAoB;AACtB,aAAS;AAAA,EACX;AAEA,QAAM,gBAAgB;AACtB,QAAM,QAAQ,MAAM,cAAcA,OAAM,IAAI;AAC5C,QAAM,iBAAiB;AACvB,QAAM,gBAAgB;AACtB,OAAI;AACJ,SAAO;AACT;AC3FO,SAAS,oBAAoB,OAAO;AACzC,QAAM,QAAQ,MAAM,QAAQ,kBAAkB;AAE9C,MAAI,UAAU,SAAS,UAAU,SAAS,UAAU,SAAS;AAC3D,UAAM,IAAI;AAAA,MACR,kCACE,QACA;AAAA,IACR;AAAA,EACE;AAEA,SAAO;AACT;ACLO,SAAS,SAASA,OAAM,QAAQ,OAAO,MAAM;AAClD,QAAM,iBAAiB,oBAAoB,KAAK;AAChD,MAAI,SAAS,MAAM,iBAAiB,YAAY,KAAK;AAGrD,MAAI,UAAU,OAAO,SAAS,UAAU,OAAO,SAAS;AACtD,cACG,OAAO,OAAO,UAAU,YAAY,OAAO,QAAQ,KAChD,OAAO,QACP,MACH,MAAM,QAAQ,wBAAwB,QACnC,IACA,OAAO,SAAS,QAAQA,KAAI,KAChC;AAAA,EACJ;AAEA,MAAI,OAAO,OAAO,SAAS;AAE3B,MACE,mBAAmB,SAClB,mBAAmB,YAChB,UAAU,OAAO,SAAS,UAAU,OAAO,UAAWA,MAAK,SAC/D;AACA,WAAO,KAAK,KAAK,OAAO,CAAC,IAAI;AAAA,EAC/B;AAEA,QAAM,UAAU,MAAM,cAAc,IAAI;AACxC,UAAQ,KAAK,SAAS,IAAI,OAAO,OAAO,OAAO,MAAM,CAAC;AACtD,UAAQ,MAAM,IAAI;AAClB,QAAM,OAAO,MAAM,MAAM,UAAU;AACnC,QAAM,QAAQ,MAAM;AAAA,IAClB,MAAM,cAAcA,OAAM,QAAQ,QAAO,CAAE;AAAA,IAC3CwB;AAAA,EACJ;AACE,OAAI;AAEJ,SAAO;AAGP,WAASA,KAAI,MAAM,OAAO,OAAO;AAC/B,QAAI,OAAO;AACT,cAAQ,QAAQ,KAAK,IAAI,OAAO,IAAI,KAAK;AAAA,IAC3C;AAEA,YAAQ,QAAQ,SAAS,SAAS,IAAI,OAAO,OAAO,OAAO,MAAM,KAAK;AAAA,EACxE;AACF;ACjDO,SAAS,UAAUxB,OAAM,GAAG,OAAO,MAAM;AAC9C,QAAM,OAAO,MAAM,MAAM,WAAW;AACpC,QAAM,UAAU,MAAM,MAAM,UAAU;AACtC,QAAM,QAAQ,MAAM,kBAAkBA,OAAM,IAAI;AAChD,UAAO;AACP,OAAI;AACJ,SAAO;AACT;ACDO,MAAM;AAAA;AAAA,EAGT,QAAQ;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IAEA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IAEA;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IAEA;AAAA;AAAA,IAEA;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IAEA;AAAA,EACN,CAAK;AAAA;AC7BE,SAAS,KAAKA,OAAM,GAAG,OAAO,MAAM;AAEzC,QAAM,cAAcA,MAAK,SAAS,KAAK,SAAU,GAAG;AAClD,WAAO,SAAS,CAAC;AAAA,EACnB,CAAC;AAED,QAAM,YAAY,cAAc,MAAM,oBAAoB,MAAM;AAChE,SAAO,UAAU,KAAK,OAAOA,OAAM,IAAI;AACzC;ACdO,SAAS,YAAY,OAAO;AACjC,QAAM,SAAS,MAAM,QAAQ,UAAU;AAEvC,MAAI,WAAW,OAAO,WAAW,KAAK;AACpC,UAAM,IAAI;AAAA,MACR,mCACE,SACA;AAAA,IACR;AAAA,EACE;AAEA,SAAO;AACT;ACXA,OAAO,OAAO;AASP,SAAS,OAAOA,OAAM,GAAG,OAAO,MAAM;AAC3C,QAAM,SAAS,YAAY,KAAK;AAChC,QAAM,OAAO,MAAM,MAAM,QAAQ;AACjC,QAAM,UAAU,MAAM,cAAc,IAAI;AACxC,QAAM,SAAS,QAAQ,KAAK,SAAS,MAAM;AAE3C,MAAI,UAAU,QAAQ;AAAA,IACpB,MAAM,kBAAkBA,OAAM;AAAA,MAC5B,OAAO;AAAA,MACP;AAAA,MACA,GAAG,QAAQ,QAAO;AAAA,IACxB,CAAK;AAAA,EACL;AACE,QAAM,cAAc,QAAQ,WAAW,CAAC;AACxC,QAAM,OAAO;AAAA,IACX,KAAK,OAAO,WAAW,KAAK,OAAO,SAAS,CAAC;AAAA,IAC7C;AAAA,IACA;AAAA,EACJ;AAEE,MAAI,KAAK,QAAQ;AACf,cAAU,yBAAyB,WAAW,IAAI,QAAQ,MAAM,CAAC;AAAA,EACnE;AAEA,QAAM,cAAc,QAAQ,WAAW,QAAQ,SAAS,CAAC;AACzD,QAAM,QAAQ,WAAW,KAAK,MAAM,WAAW,CAAC,GAAG,aAAa,MAAM;AAEtE,MAAI,MAAM,QAAQ;AAChB,cAAU,QAAQ,MAAM,GAAG,EAAE,IAAI,yBAAyB,WAAW;AAAA,EACvE;AAEA,QAAM,QAAQ,QAAQ,KAAK,SAAS,MAAM;AAE1C,OAAI;AAEJ,QAAM,iCAAiC;AAAA,IACrC,OAAO,MAAM;AAAA,IACb,QAAQ,KAAK;AAAA,EACjB;AACE,SAAO,SAAS,UAAU;AAC5B;AAQA,SAAS,WAAW,GAAG,IAAI,OAAO;AAChC,SAAO,MAAM,QAAQ,UAAU;AACjC;ACxDO,SAAS,KAAKA,OAAM,GAAG,OAAO,MAAM;AACzC,SAAO,MAAM,KAAKA,MAAK,OAAO,IAAI;AACpC;ACNO,SAAS,oBAAoB,OAAO;AACzC,QAAM,aAAa,MAAM,QAAQ,kBAAkB;AAEnD,MAAI,aAAa,GAAG;AAClB,UAAM,IAAI;AAAA,MACR,6CACE,aACA;AAAA,IACR;AAAA,EACE;AAEA,SAAO;AACT;ACNO,SAAS,cAAc,GAAG,IAAI,OAAO;AAC1C,QAAM,SACJ,UAAU,KAAK,KAAK,MAAM,QAAQ,aAAa,MAAM,KACrD,OAAO,oBAAoB,KAAK,CAAC;AAEnC,SAAO,MAAM,QAAQ,aAAa,MAAM,MAAM,GAAG,EAAE,IAAI;AACzD;ACGO,MAAM,SAAS;AAAA,EACpB;AAAA,EACA,OAAO;AAAA,EACP;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;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;ACxBO,SAAS,8BAA8B;AAC5C,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,2BAA2B;AAAA,MAC3B,6BAA6B;AAAA,MAC7B,WAAW;AAAA,IACjB;AAAA,EACA;AACA;AASO,SAAS,4BAA4B;AAC1C,SAAO;AAAA,IACL,QAAQ,CAAC,EAAC,SAAS,MAAM,WAAW,KAAK,OAAO,QAAO,CAAC;AAAA,IACxD,UAAU,EAAC,UAAU,yBAAwB;AAAA,EACjD;AACA;AAMA,SAAS,UAAU,OAAO;AAExB,QAAMA,QAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7CkB,OAAOlB,MAAK,SAAS,UAAU;AAC/B,EAAAA,MAAK,UAAU,MAAM,SAAS;AAChC;AAMA,SAAS,8BAA8B,OAAO;AAC5C,QAAM,SAAS,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAE/C,MACE,UACA,OAAO,SAAS,cAChB,OAAO,OAAO,YAAY,WAC1B;AACA,UAAMA,QAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7CkB,SAAOlB,MAAK,SAAS,WAAW;AAChC,UAAM,OAAOA,MAAK,SAAS,CAAC;AAE5B,QAAI,QAAQ,KAAK,SAAS,QAAQ;AAChC,YAAM,WAAW,OAAO;AACxB,UAAI,QAAQ;AAEZ,UAAI;AAEJ,aAAO,EAAE,QAAQ,SAAS,QAAQ;AAChC,cAAM,UAAU,SAAS,KAAK;AAC9B,YAAI,QAAQ,SAAS,aAAa;AAChC,4BAAkB;AAClB;AAAA,QACF;AAAA,MACF;AAEA,UAAI,oBAAoBA,OAAM;AAE5B,aAAK,QAAQ,KAAK,MAAM,MAAM,CAAC;AAE/B,YAAI,KAAK,MAAM,WAAW,GAAG;AAC3B,UAAAA,MAAK,SAAS,MAAK;AAAA,QACrB,WACEA,MAAK,YACL,KAAK,YACL,OAAO,KAAK,SAAS,MAAM,WAAW,UACtC;AACA,eAAK,SAAS,MAAM;AACpB,eAAK,SAAS,MAAM;AACpB,UAAAA,MAAK,SAAS,QAAQ,OAAO,OAAO,IAAI,KAAK,SAAS,KAAK;AAAA,QAC7D;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,OAAK,KAAK,KAAK;AACjB;AAMA,SAAS,yBAAyBA,OAAM,QAAQ,OAAO,MAAM;AAC3D,QAAM,OAAOA,MAAK,SAAS,CAAC;AAC5B,QAAM,YACJ,OAAOA,MAAK,YAAY,aAAa,QAAQ,KAAK,SAAS;AAC7D,QAAM,WAAW,OAAOA,MAAK,UAAU,MAAM,OAAO;AACpD,QAAM,UAAU,MAAM,cAAc,IAAI;AAExC,MAAI,WAAW;AACb,YAAQ,KAAK,QAAQ;AAAA,EACvB;AAEA,MAAI,QAAQ4B,OAAgB,SAAS5B,OAAM,QAAQ,OAAO;AAAA,IACxD,GAAG;AAAA,IACH,GAAG,QAAQ,QAAO;AAAA,EACtB,CAAG;AAED,MAAI,WAAW;AACb,YAAQ,MAAM,QAAQ,mCAAmC,KAAK;AAAA,EAChE;AAEA,SAAO;AAMP,WAAS,MAAM,IAAI;AACjB,WAAO,KAAK;AAAA,EACd;AACF;ACpGO,SAAS,aAAa,SAASW,KAAI,MAAM,KAAK;AACnD,QAAM,QAAwB,OAAO;AACrC,MAAI,OAAO;AACX,SAAO;AAGP,WAAS,MAAMC,OAAM;AACnB,QAAI,cAAcA,KAAI,GAAG;AACvB,cAAQ,MAAM,IAAI;AAClB,aAAO,OAAOA,KAAI;AAAA,IACpB;AACA,WAAOD,IAAGC,KAAI;AAAA,EAChB;AAGA,WAAS,OAAOA,OAAM;AACpB,QAAI,cAAcA,KAAI,KAAK,SAAS,OAAO;AACzC,cAAQ,QAAQA,KAAI;AACpB,aAAO;AAAA,IACT;AACA,YAAQ,KAAK,IAAI;AACjB,WAAOD,IAAGC,KAAI;AAAA,EAChB;AACF;ACzDA,MAAM,gBAAgB;AAAA,EACpB,MAAM;AAAA,EACN,UAAU;AACZ;AAUO,SAAS,kBAAkB;AAChC,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAAC,EAAE,GAAG;AAAA,IACZ;AAAA,EACA;AACA;AAMA,SAAS,sBAAsB,SAASD,KAAI,KAAK;AAC/C,QAAM,OAAO;AACb,SAAO;AAYP,WAAS,KAAKC,OAAM;AAClB;AAAA;AAAA,MAEA,KAAK,aAAa;AAAA;AAAA,MAGlB,CAAC,KAAK;AAAA,MAAoC;AACxC,aAAO,IAAIA,KAAI;AAAA,IACjB;AACA,YAAQ,MAAM,eAAe;AAC7B,YAAQ,MAAM,qBAAqB;AACnC,YAAQ,QAAQA,KAAI;AACpB,YAAQ,KAAK,qBAAqB;AAClC,WAAO;AAAA,EACT;AAYA,WAAS,OAAOA,OAAM;AAIpB,QAAI,0BAA0BA,KAAI,GAAG;AACnC,cAAQ,MAAM,6BAA6B;AAC3C,cAAQ,QAAQA,KAAI;AACpB,cAAQ,KAAK,6BAA6B;AAC1C,aAAO;AAAA,IACT;AACA,QAAIA,UAAS,MAAMA,UAAS,KAAK;AAC/B,cAAQ,MAAM,2BAA2B;AACzC,cAAQ,QAAQA,KAAI;AACpB,cAAQ,KAAK,2BAA2B;AACxC,aAAO;AAAA,IACT;AACA,WAAO,IAAIA,KAAI;AAAA,EACjB;AAYA,WAAS,MAAMA,OAAM;AACnB,QAAIA,UAAS,IAAI;AACf,cAAQ,MAAM,qBAAqB;AACnC,cAAQ,QAAQA,KAAI;AACpB,cAAQ,KAAK,qBAAqB;AAClC,cAAQ,KAAK,eAAe;AAC5B,aAAO;AAAA,IACT;AACA,WAAO,IAAIA,KAAI;AAAA,EACjB;AAKA,WAAS,MAAMA,OAAM;AAEnB,QAAI,mBAAmBA,KAAI,GAAG;AAC5B,aAAOD,IAAGC,KAAI;AAAA,IAChB;AAIA,QAAI,cAAcA,KAAI,GAAG;AACvB,aAAO,QAAQ,MAAM;AAAA,QACnB,UAAU;AAAA,MAClB,GAASD,KAAI,GAAG,EAAEC,KAAI;AAAA,IAClB;AAGA,WAAO,IAAIA,KAAI;AAAA,EACjB;AACF;AAMA,SAAS,kBAAkB,SAASD,KAAI,KAAK;AAC3C,SAAO,aAAa,SAAS,OAAO,YAAY;AAYhD,WAAS,MAAMC,OAAM;AAKnB,WAAOA,UAAS,OAAO,IAAIA,KAAI,IAAID,IAAGC,KAAI;AAAA,EAC5C;AACF;ACnIA,MAAM,iBAAqC;AAAA,EAIlC,YACLZ,OACA,MACA,QACA;AACA,UAAM,WAAW,SAAS,cAAc,OAAO;AAC/C,aAAS,aAAa,QAAQ,UAAU;AACxC,aAAS,aAAa,SAAS,kBAAkB;AACjD,QAAIA,MAAK,MAAM,SAAS,MAAM,MAAM;AAClC,eAAS,aAAa,WAAW,SAAS;AAAA,IAC5C;AACA,aAAS,iBAAiB,SAAS,CAAC,MAAM;AACxC,YAAM,MAAM,OAAA;AACZ,UAAI,QAAQ,QAAW;AACrB;AAAA,MACF;AACA,QAAE,eAAA;AACF,WAAK;AAAA,QACH,KAAK,MAAM,GAAG;AAAA,UACZ;AAAA,UACA;AAAA,UACA,CAAEA,MAAK,MAAM,SAAS;AAAA,QAAA;AAAA,MACxB;AAAA,IAEJ,CAAC;AAED,UAAM,oBAAoB,SAAS,cAAc,MAAM;AACvD,sBAAkB,aAAa,mBAAmB,OAAO;AACzD,sBAAkB,aAAa,SAAS,gCAAgC;AACxE,sBAAkB,YAAY,QAAQ;AAEtC,SAAK,aAAa,SAAS,cAAc,MAAM;AAC/C,SAAK,WAAW,aAAa,SAAS,iCAAiC;AAEvE,SAAK,MAAM,SAAS,cAAc,IAAI;AACtC,SAAK,IAAI;AAAA,MACP;AAAA,MACA;AAAA,IAAA;AAEF,SAAK,IAAI,YAAY,iBAAiB;AACtC,SAAK,IAAI,YAAY,KAAK,UAAU;AAAA,EACtC;AAAA;AAAA,EAGO,YAAqB;AAC1B,WAAO;AAAA,EACT;AACF;AAKO,MAAM,8BAA8BT,mBAAAA,cAAwB;AAAA,EACjE,OAAe,UACb,OACA,MACS;AACT,QAAI,CAAC,MAAM,UAAU,OAAO;AAC1B,aAAO;AAAA,IACT;AACA,QAAI,SAAS,QAAW;AACtB,aAAO,KAAK,eAAe,YAAY,KAAK;AAAA,IAC9C;AACA,WAAO,MAAM,UAAU,QAAQ,eAAe;AAAA,EAChD;AAAA,EAEgB,sBACd,mBACkB;AAClB,WAAO;AAAA,MACL,IAAIa,sBAAAA,UAAU,yBAAyB,CAAC,OAAO,OAAO,UAAU;AAC9D,cAAM,eAAe,MAAM,IAAI,QAAQ,KAAK,EAAE,KAAK,EAAE;AACrD,YAAI,aAAa,KAAK,SAAS,qBAAqB;AAClD,iBAAO;AAAA,QACT;AACA,eAAO,MAAM,GAAG;AAAA,UACd,QAAQ;AAAA,UACR,QAAQ,aAAa;AAAA,UACrB,kBAAkB,MAAM,KAAK,oBAAA,CAAqB,EAAE;AAAA,YAClD,EAAE,SAAS,MAAM,CAAC,MAAM,IAAA;AAAA,YACxB,aAAa,QAAQ,IAAI,IAAI,MAAM,CAAC,EAAE,MAAM;AAAA,UAAA;AAAA,QAC9C;AAAA,MAEJ,CAAC;AAAA,IAAA;AAAA,EAEL;AAAA,EAEgB,kBACd,mBACyB;AACzB,WAAO;AAAA,MACL,WAAW,CAAC,OAAO,UAAU,SAAkB;AAC7C,YAAI,CAAC,sBAAsB,UAAU,OAAO,IAAI,GAAG;AACjD,iBAAO;AAAA,QACT;AACA,cAAM,mBAAmB,MAAM,UAAU,QAAQ,KAAK,EAAE;AACxD,YAAI,iBAAiB,KAAK,SAAS,kBAAkB;AACnD,iBAAO;AAAA,QACT;AACA,YAAI,aAAa,QAAW;AAC1B,iBAAO;AAAA,QACT;AACA;AAAA,UACE,MAAM,GAAG;AAAA,YACP,MAAM,UAAU,MAAM,OAAA,IAAW;AAAA,YACjC,MAAM,UAAU,MAAM,OAAA,IAAW,iBAAiB;AAAA,YAClD,kBAAkB,MAAM,mBAAmB,EAAE;AAAA,cAC3C,CAAA;AAAA,cACA,iBAAiB;AAAA,YAAA;AAAA,UACnB;AAAA,QACF;AAEF,eAAO;AAAA,MACT;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,sBAA8B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEgB,sBAAgC;AAC9C,WAAO;AAAA,MACL,OAAO,EAAE,SAAS,EAAE,SAAS,QAAM;AAAA,MACnC,SAAS;AAAA,MACT,UAAU;AAAA,MACV,OAAO;AAAA,MACP,UAAU;AAAA,QACR;AAAA,UACE,SAAS,KAAkD;AACzD,kBAAM,WAAY,IAAoB;AACtC,gBAAI,EAAE,oBAAoB,mBAAmB;AAC3C,qBAAO;AAAA,YACT;AACA,mBAAO,EAAE,SAAS,SAAS,QAAA;AAAA,UAC7B;AAAA,UACA,KAAK;AAAA,QAAA;AAAA,MACP;AAAA,MAEF,MAAMJ,OAAsC;AAC1C,eAAO;AAAA,UACL;AAAA,UACA,EAAE,OAAO,8CAAA;AAAA,UACT;AAAA,YACE;AAAA,YACA;AAAA,cACE,iBAAiB;AAAA,cACjB,OAAO;AAAA,YAAA;AAAA,YAET;AAAA,cACE;AAAA,cACA;AAAA,gBACE,SAAUA,MAAK,MAAM,SAAS,IAC1B,YACA;AAAA,gBACJ,UAAU;AAAA,gBACV,MAAM;AAAA,cAAA;AAAA,YACR;AAAA,UACF;AAAA,UAEF,CAAC,QAAQ,EAAE,OAAO,iCAAA,GAAoC,CAAC;AAAA,QAAA;AAAA,MAE3D;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEgB,4BACdA,OACA,mBACiB;AACjB,WAAO;AAAA,MACL;AAAA,QACE,SAASA,MAAK,MAAM,SAAS;AAAA,QAC7B,UAAU;AAAA,QACV,MAAM,KAAK,cAAA;AAAA,MAAc;AAAA,IAC3B;AAAA,EAEJ;AAAA,EAEgB,sBAAkD;AAChE,WAAO,CAACA,OAAM,MAAM,WAAW,IAAI,iBAAiBA,OAAM,MAAM,MAAM;AAAA,EACxE;AAAA,EAEgB,0BACd,WAC+D;AAC/D,WAAO,UAAU;AAAA,MACf;AAAA,QACE,CAAC,iBAAiB;AAAA,QAClB,CAAC,6BAA6B;AAAA,QAC9B,CAAC,2BAA2B;AAAA,MAAA;AAAA,IAC9B;AAAA,EAEJ;AAAA,EAEgB,gBAA4B;AAC1C,WAAO;AAAA,EACT;AAAA,EAEgB,4BACdA,OACA,mBACA,mBACwB;AACxB,WAAON,mBAAAA;AAAAA,MACL,KAAK,oBAAA;AAAA,MACL;AAAA,MACA;AAAA,MACA,EAAE,SAASM,MAAK,QAAA;AAAA,IAAQ;AAAA,EAE5B;AAAA,EAEgB,uBAAuBA,OAA0B;AAC/D,WACEA,MAAK,SAAS,KAAK,cAAA,KACnB,aAAaA,SACb,OAAOA,MAAK,YAAY;AAAA,EAE5B;AACF;AC/OO,MAAM,qBAAqBU,mBAAAA,UAAU;AAAA,EAC1B,eAAiC;AAC/C,WAAO;AAAA,MACL,IAAI,kBAAA;AAAA,MACJ,IAAI,0BAAA;AAAA,MACJ,IAAI,uBAAA;AAAA,MACJ,IAAI,sBAAA;AAAA,IAAsB;AAAA,EAE9B;AACF;;;;;;;;;;;;;;;;;;;;;;;;;","x_google_ignoreList":[20,21,22,23,24,25,26,27,28,29,32,33,34,35,36,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80]}