slate 0.57.2 → 0.57.3

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (10) hide show
  1. package/dist/create-editor.d.ts.map +1 -1
  2. package/dist/index.es.js +12 -1
  3. package/dist/index.es.js.map +1 -1
  4. package/dist/index.js +12 -1
  5. package/dist/index.js.map +1 -1
  6. package/dist/interfaces/editor.d.ts +1 -0
  7. package/dist/interfaces/editor.d.ts.map +1 -1
  8. package/dist/slate.js +10 -1
  9. package/dist/slate.min.js +1 -1
  10. package/package.json +2 -2
package/dist/index.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"index.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/defineProperty.js","../../../node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js","../../../node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js","../src/utils/weak-maps.ts","../src/utils/string.ts","../src/interfaces/editor.ts","../src/interfaces/element.ts","../src/interfaces/location.ts","../src/interfaces/node.ts","../src/interfaces/operation.ts","../src/interfaces/path.ts","../src/interfaces/path-ref.ts","../src/interfaces/point.ts","../src/interfaces/point-ref.ts","../src/interfaces/range.ts","../src/interfaces/range-ref.ts","../src/interfaces/text.ts","../src/transforms/general.ts","../src/transforms/node.ts","../src/transforms/selection.ts","../src/transforms/text.ts","../src/transforms/index.ts","../src/create-editor.ts"],"sourcesContent":["export default function _defineProperty(obj, key, value) {\n if (key in obj) {\n Object.defineProperty(obj, key, {\n value: value,\n enumerable: true,\n configurable: true,\n writable: true\n });\n } else {\n obj[key] = value;\n }\n\n return obj;\n}","export default function _objectWithoutPropertiesLoose(source, excluded) {\n if (source == null) return {};\n var target = {};\n var sourceKeys = Object.keys(source);\n var key, i;\n\n for (i = 0; i < sourceKeys.length; i++) {\n key = sourceKeys[i];\n if (excluded.indexOf(key) >= 0) continue;\n target[key] = source[key];\n }\n\n return target;\n}","import objectWithoutPropertiesLoose from \"./objectWithoutPropertiesLoose\";\nexport default function _objectWithoutProperties(source, excluded) {\n if (source == null) return {};\n var target = objectWithoutPropertiesLoose(source, excluded);\n var key, i;\n\n if (Object.getOwnPropertySymbols) {\n var sourceSymbolKeys = Object.getOwnPropertySymbols(source);\n\n for (i = 0; i < sourceSymbolKeys.length; i++) {\n key = sourceSymbolKeys[i];\n if (excluded.indexOf(key) >= 0) continue;\n if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;\n target[key] = source[key];\n }\n }\n\n return target;\n}","import { Editor, Path, PathRef, PointRef, RangeRef } from '..'\n\nexport const DIRTY_PATHS: WeakMap<Editor, Path[]> = new WeakMap()\nexport const FLUSHING: WeakMap<Editor, boolean> = new WeakMap()\nexport const NORMALIZING: WeakMap<Editor, boolean> = new WeakMap()\nexport const PATH_REFS: WeakMap<Editor, Set<PathRef>> = new WeakMap()\nexport const POINT_REFS: WeakMap<Editor, Set<PointRef>> = new WeakMap()\nexport const RANGE_REFS: WeakMap<Editor, Set<RangeRef>> = new WeakMap()\n","/**\n * Constants for string distance checking.\n */\n\nconst SPACE = /\\s/\nconst PUNCTUATION = /[\\u0021-\\u0023\\u0025-\\u002A\\u002C-\\u002F\\u003A\\u003B\\u003F\\u0040\\u005B-\\u005D\\u005F\\u007B\\u007D\\u00A1\\u00A7\\u00AB\\u00B6\\u00B7\\u00BB\\u00BF\\u037E\\u0387\\u055A-\\u055F\\u0589\\u058A\\u05BE\\u05C0\\u05C3\\u05C6\\u05F3\\u05F4\\u0609\\u060A\\u060C\\u060D\\u061B\\u061E\\u061F\\u066A-\\u066D\\u06D4\\u0700-\\u070D\\u07F7-\\u07F9\\u0830-\\u083E\\u085E\\u0964\\u0965\\u0970\\u0AF0\\u0DF4\\u0E4F\\u0E5A\\u0E5B\\u0F04-\\u0F12\\u0F14\\u0F3A-\\u0F3D\\u0F85\\u0FD0-\\u0FD4\\u0FD9\\u0FDA\\u104A-\\u104F\\u10FB\\u1360-\\u1368\\u1400\\u166D\\u166E\\u169B\\u169C\\u16EB-\\u16ED\\u1735\\u1736\\u17D4-\\u17D6\\u17D8-\\u17DA\\u1800-\\u180A\\u1944\\u1945\\u1A1E\\u1A1F\\u1AA0-\\u1AA6\\u1AA8-\\u1AAD\\u1B5A-\\u1B60\\u1BFC-\\u1BFF\\u1C3B-\\u1C3F\\u1C7E\\u1C7F\\u1CC0-\\u1CC7\\u1CD3\\u2010-\\u2027\\u2030-\\u2043\\u2045-\\u2051\\u2053-\\u205E\\u207D\\u207E\\u208D\\u208E\\u2329\\u232A\\u2768-\\u2775\\u27C5\\u27C6\\u27E6-\\u27EF\\u2983-\\u2998\\u29D8-\\u29DB\\u29FC\\u29FD\\u2CF9-\\u2CFC\\u2CFE\\u2CFF\\u2D70\\u2E00-\\u2E2E\\u2E30-\\u2E3B\\u3001-\\u3003\\u3008-\\u3011\\u3014-\\u301F\\u3030\\u303D\\u30A0\\u30FB\\uA4FE\\uA4FF\\uA60D-\\uA60F\\uA673\\uA67E\\uA6F2-\\uA6F7\\uA874-\\uA877\\uA8CE\\uA8CF\\uA8F8-\\uA8FA\\uA92E\\uA92F\\uA95F\\uA9C1-\\uA9CD\\uA9DE\\uA9DF\\uAA5C-\\uAA5F\\uAADE\\uAADF\\uAAF0\\uAAF1\\uABEB\\uFD3E\\uFD3F\\uFE10-\\uFE19\\uFE30-\\uFE52\\uFE54-\\uFE61\\uFE63\\uFE68\\uFE6A\\uFE6B\\uFF01-\\uFF03\\uFF05-\\uFF0A\\uFF0C-\\uFF0F\\uFF1A\\uFF1B\\uFF1F\\uFF20\\uFF3B-\\uFF3D\\uFF3F\\uFF5B\\uFF5D\\uFF5F-\\uFF65]/\nconst CHAMELEON = /['\\u2018\\u2019]/\nconst SURROGATE_START = 0xd800\nconst SURROGATE_END = 0xdfff\nconst ZERO_WIDTH_JOINER = 0x200d\n\n/**\n * Get the distance to the end of the first character in a string of text.\n */\n\nexport const getCharacterDistance = (text: string): number => {\n let offset = 0\n // prev types:\n // SURR: surrogate pair\n // MOD: modifier (technically also surrogate pair)\n // ZWJ: zero width joiner\n // VAR: variation selector\n // BMP: sequenceable character from basic multilingual plane\n let prev: 'SURR' | 'MOD' | 'ZWJ' | 'VAR' | 'BMP' | null = null\n let charCode = text.charCodeAt(0)\n\n while (charCode) {\n if (isSurrogate(charCode)) {\n const modifier = isModifier(charCode, text, offset)\n\n // Early returns are the heart of this function, where we decide if previous and current\n // codepoints should form a single character (in terms of how many of them should selection\n // jump over).\n if (prev === 'SURR' || prev === 'BMP') {\n break\n }\n\n offset += 2\n prev = modifier ? 'MOD' : 'SURR'\n charCode = text.charCodeAt(offset)\n // Absolutely fine to `continue` without any checks because if `charCode` is NaN (which\n // is the case when out of `text` range), next `while` loop won\"t execute and we\"re done.\n continue\n }\n\n if (charCode === ZERO_WIDTH_JOINER) {\n offset += 1\n prev = 'ZWJ'\n charCode = text.charCodeAt(offset)\n\n continue\n }\n\n if (isBMPEmoji(charCode)) {\n if (prev && prev !== 'ZWJ' && prev !== 'VAR') {\n break\n }\n offset += 1\n prev = 'BMP'\n charCode = text.charCodeAt(offset)\n\n continue\n }\n\n if (isVariationSelector(charCode)) {\n if (prev && prev !== 'ZWJ') {\n break\n }\n offset += 1\n prev = 'VAR'\n charCode = text.charCodeAt(offset)\n continue\n }\n\n // Modifier 'groups up' with what ever character is before that (even whitespace), need to\n // look ahead.\n if (prev === 'MOD') {\n offset += 1\n break\n }\n\n // If while loop ever gets here, we're done (e.g latin chars).\n break\n }\n\n return offset || 1\n}\n\n/**\n * Get the distance to the end of the first word in a string of text.\n */\n\nexport const getWordDistance = (text: string): number => {\n let length = 0\n let i = 0\n let started = false\n let char\n\n while ((char = text.charAt(i))) {\n const l = getCharacterDistance(char)\n char = text.slice(i, i + l)\n const rest = text.slice(i + l)\n\n if (isWordCharacter(char, rest)) {\n started = true\n length += l\n } else if (!started) {\n length += l\n } else {\n break\n }\n\n i += l\n }\n\n return length\n}\n\n/**\n * Check if a character is a word character. The `remaining` argument is used\n * because sometimes you must read subsequent characters to truly determine it.\n */\n\nconst isWordCharacter = (char: string, remaining: string): boolean => {\n if (SPACE.test(char)) {\n return false\n }\n\n // Chameleons count as word characters as long as they're in a word, so\n // recurse to see if the next one is a word character or not.\n if (CHAMELEON.test(char)) {\n let next = remaining.charAt(0)\n const length = getCharacterDistance(next)\n next = remaining.slice(0, length)\n const rest = remaining.slice(length)\n\n if (isWordCharacter(next, rest)) {\n return true\n }\n }\n\n if (PUNCTUATION.test(char)) {\n return false\n }\n\n return true\n}\n\n/**\n * Determines if `code` is a surrogate\n */\n\nconst isSurrogate = (code: number): boolean =>\n SURROGATE_START <= code && code <= SURROGATE_END\n\n/**\n * Does `code` form Modifier with next one.\n *\n * https://emojipedia.org/modifiers/\n */\n\nconst isModifier = (code: number, text: string, offset: number): boolean => {\n if (code === 0xd83c) {\n const next = text.charCodeAt(offset + 1)\n return next <= 0xdfff && next >= 0xdffb\n }\n return false\n}\n\n/**\n * Is `code` a Variation Selector.\n *\n * https://codepoints.net/variation_selectors\n */\n\nconst isVariationSelector = (code: number): boolean => {\n return code <= 0xfe0f && code >= 0xfe00\n}\n\n/**\n * Is `code` one of the BMP codes used in emoji sequences.\n *\n * https://emojipedia.org/emoji-zwj-sequences/\n */\n\nconst isBMPEmoji = (code: number): boolean => {\n // This requires tiny bit of maintanance, better ideas?\n // Fortunately it only happens if new Unicode Standard\n // is released. Fails gracefully if upkeep lags behind,\n // same way Slate previously behaved with all emojis.\n return (\n code === 0x2764 || // heart (❤)\n code === 0x2642 || // male (♂)\n code === 0x2640 || // female (♀)\n code === 0x2620 || // scull (☠)\n code === 0x2695 || // medical (⚕)\n code === 0x2708 || // plane (✈️)\n code === 0x25ef // large circle (◯)\n )\n}\n","import isPlainObject from 'is-plain-object'\nimport { createDraft, finishDraft, isDraft } from 'immer'\nimport { reverse as reverseText } from 'esrever'\n\nimport {\n Ancestor,\n Descendant,\n Element,\n Location,\n Node,\n NodeEntry,\n Operation,\n Path,\n PathRef,\n Point,\n PointRef,\n Range,\n RangeRef,\n Span,\n Text,\n} from '..'\nimport {\n DIRTY_PATHS,\n NORMALIZING,\n PATH_REFS,\n POINT_REFS,\n RANGE_REFS,\n} from '../utils/weak-maps'\nimport { getWordDistance, getCharacterDistance } from '../utils/string'\n\n/**\n * The `Editor` interface stores all the state of a Slate editor. It is extended\n * by plugins that wish to add their own helpers and implement new behaviors.\n */\n\nexport interface Editor {\n children: Node[]\n selection: Range | null\n operations: Operation[]\n marks: Record<string, any> | null\n [key: string]: any\n\n // Schema-specific node behaviors.\n isInline: (element: Element) => boolean\n isVoid: (element: Element) => boolean\n normalizeNode: (entry: NodeEntry) => void\n onChange: () => void\n\n // Overrideable core actions.\n addMark: (key: string, value: any) => void\n apply: (operation: Operation) => void\n deleteBackward: (unit: 'character' | 'word' | 'line' | 'block') => void\n deleteForward: (unit: 'character' | 'word' | 'line' | 'block') => void\n deleteFragment: () => void\n insertBreak: () => void\n insertFragment: (fragment: Node[]) => void\n insertNode: (node: Node) => void\n insertText: (text: string) => void\n removeMark: (key: string) => void\n}\n\nexport const Editor = {\n /**\n * Get the ancestor above a location in the document.\n */\n\n above<T extends Ancestor>(\n editor: Editor,\n options: {\n at?: Location\n match?: NodeMatch<T>\n mode?: 'highest' | 'lowest'\n voids?: boolean\n } = {}\n ): NodeEntry<T> | undefined {\n const {\n voids = false,\n mode = 'lowest',\n at = editor.selection,\n match,\n } = options\n\n if (!at) {\n return\n }\n\n const path = Editor.path(editor, at)\n const reverse = mode === 'lowest'\n\n for (const [n, p] of Editor.levels(editor, {\n at: path,\n voids,\n match,\n reverse,\n })) {\n if (!Text.isText(n) && !Path.equals(path, p)) {\n return [n, p]\n }\n }\n },\n\n /**\n * Add a custom property to the leaf text nodes in the current selection.\n *\n * If the selection is currently collapsed, the marks will be added to the\n * `editor.marks` property instead, and applied when text is inserted next.\n */\n\n addMark(editor: Editor, key: string, value: any): void {\n editor.addMark(key, value)\n },\n\n /**\n * Get the point after a location.\n */\n\n after(\n editor: Editor,\n at: Location,\n options: {\n distance?: number\n unit?: 'offset' | 'character' | 'word' | 'line' | 'block'\n } = {}\n ): Point | undefined {\n const anchor = Editor.point(editor, at, { edge: 'end' })\n const focus = Editor.end(editor, [])\n const range = { anchor, focus }\n const { distance = 1 } = options\n let d = 0\n let target\n\n for (const p of Editor.positions(editor, { ...options, at: range })) {\n if (d > distance) {\n break\n }\n\n if (d !== 0) {\n target = p\n }\n\n d++\n }\n\n return target\n },\n\n /**\n * Get the point before a location.\n */\n\n before(\n editor: Editor,\n at: Location,\n options: {\n distance?: number\n unit?: 'offset' | 'character' | 'word' | 'line' | 'block'\n } = {}\n ): Point | undefined {\n const anchor = Editor.start(editor, [])\n const focus = Editor.point(editor, at, { edge: 'start' })\n const range = { anchor, focus }\n const { distance = 1 } = options\n let d = 0\n let target\n\n for (const p of Editor.positions(editor, {\n ...options,\n at: range,\n reverse: true,\n })) {\n if (d > distance) {\n break\n }\n\n if (d !== 0) {\n target = p\n }\n\n d++\n }\n\n return target\n },\n\n /**\n * Delete content in the editor backward from the current selection.\n */\n\n deleteBackward(\n editor: Editor,\n options: {\n unit?: 'character' | 'word' | 'line' | 'block'\n } = {}\n ): void {\n const { unit = 'character' } = options\n editor.deleteBackward(unit)\n },\n\n /**\n * Delete content in the editor forward from the current selection.\n */\n\n deleteForward(\n editor: Editor,\n options: {\n unit?: 'character' | 'word' | 'line' | 'block'\n } = {}\n ): void {\n const { unit = 'character' } = options\n editor.deleteForward(unit)\n },\n\n /**\n * Delete the content in the current selection.\n */\n\n deleteFragment(editor: Editor): void {\n editor.deleteFragment()\n },\n\n /**\n * Get the start and end points of a location.\n */\n\n edges(editor: Editor, at: Location): [Point, Point] {\n return [Editor.start(editor, at), Editor.end(editor, at)]\n },\n\n /**\n * Get the end point of a location.\n */\n\n end(editor: Editor, at: Location): Point {\n return Editor.point(editor, at, { edge: 'end' })\n },\n\n /**\n * Get the first node at a location.\n */\n\n first(editor: Editor, at: Location): NodeEntry {\n const path = Editor.path(editor, at, { edge: 'start' })\n return Editor.node(editor, path)\n },\n\n /**\n * Get the fragment at a location.\n */\n\n fragment(editor: Editor, at: Location): Descendant[] {\n const range = Editor.range(editor, at)\n const fragment = Node.fragment(editor, range)\n return fragment\n },\n /**\n * Check if a node has block children.\n */\n\n hasBlocks(editor: Editor, element: Element): boolean {\n return element.children.some(n => Editor.isBlock(editor, n))\n },\n\n /**\n * Check if a node has inline and text children.\n */\n\n hasInlines(editor: Editor, element: Element): boolean {\n return element.children.some(\n n => Text.isText(n) || Editor.isInline(editor, n)\n )\n },\n\n /**\n * Check if a node has text children.\n */\n\n hasTexts(editor: Editor, element: Element): boolean {\n return element.children.every(n => Text.isText(n))\n },\n\n /**\n * Insert a block break at the current selection.\n *\n * If the selection is currently expanded, it will be deleted first.\n */\n\n insertBreak(editor: Editor): void {\n editor.insertBreak()\n },\n\n /**\n * Insert a fragment at the current selection.\n *\n * If the selection is currently expanded, it will be deleted first.\n */\n\n insertFragment(editor: Editor, fragment: Node[]): void {\n editor.insertFragment(fragment)\n },\n\n /**\n * Insert a node at the current selection.\n *\n * If the selection is currently expanded, it will be deleted first.\n */\n\n insertNode(editor: Editor, node: Node): void {\n editor.insertNode(node)\n },\n\n /**\n * Insert text at the current selection.\n *\n * If the selection is currently expanded, it will be deleted first.\n */\n\n insertText(editor: Editor, text: string): void {\n editor.insertText(text)\n },\n\n /**\n * Check if a value is a block `Element` object.\n */\n\n isBlock(editor: Editor, value: any): value is Element {\n return Element.isElement(value) && !editor.isInline(value)\n },\n\n /**\n * Check if a value is an `Editor` object.\n */\n\n isEditor(value: any): value is Editor {\n return (\n isPlainObject(value) &&\n typeof value.addMark === 'function' &&\n typeof value.apply === 'function' &&\n typeof value.deleteBackward === 'function' &&\n typeof value.deleteForward === 'function' &&\n typeof value.deleteFragment === 'function' &&\n typeof value.insertBreak === 'function' &&\n typeof value.insertFragment === 'function' &&\n typeof value.insertNode === 'function' &&\n typeof value.insertText === 'function' &&\n typeof value.isInline === 'function' &&\n typeof value.isVoid === 'function' &&\n typeof value.normalizeNode === 'function' &&\n typeof value.onChange === 'function' &&\n typeof value.removeMark === 'function' &&\n (value.marks === null || isPlainObject(value.marks)) &&\n (value.selection === null || Range.isRange(value.selection)) &&\n Node.isNodeList(value.children) &&\n Operation.isOperationList(value.operations)\n )\n },\n\n /**\n * Check if a point is the end point of a location.\n */\n\n isEnd(editor: Editor, point: Point, at: Location): boolean {\n const end = Editor.end(editor, at)\n return Point.equals(point, end)\n },\n\n /**\n * Check if a point is an edge of a location.\n */\n\n isEdge(editor: Editor, point: Point, at: Location): boolean {\n return Editor.isStart(editor, point, at) || Editor.isEnd(editor, point, at)\n },\n\n /**\n * Check if an element is empty, accounting for void nodes.\n */\n\n isEmpty(editor: Editor, element: Element): boolean {\n const { children } = element\n const [first] = children\n return (\n children.length === 0 ||\n (children.length === 1 &&\n Text.isText(first) &&\n first.text === '' &&\n !editor.isVoid(element))\n )\n },\n\n /**\n * Check if a value is an inline `Element` object.\n */\n\n isInline(editor: Editor, value: any): value is Element {\n return Element.isElement(value) && editor.isInline(value)\n },\n\n /**\n * Check if the editor is currently normalizing after each operation.\n */\n\n isNormalizing(editor: Editor): boolean {\n const isNormalizing = NORMALIZING.get(editor)\n return isNormalizing === undefined ? true : isNormalizing\n },\n\n /**\n * Check if a point is the start point of a location.\n */\n\n isStart(editor: Editor, point: Point, at: Location): boolean {\n // PERF: If the offset isn't `0` we know it's not the start.\n if (point.offset !== 0) {\n return false\n }\n\n const start = Editor.start(editor, at)\n return Point.equals(point, start)\n },\n\n /**\n * Check if a value is a void `Element` object.\n */\n\n isVoid(editor: Editor, value: any): value is Element {\n return Element.isElement(value) && editor.isVoid(value)\n },\n\n /**\n * Get the last node at a location.\n */\n\n last(editor: Editor, at: Location): NodeEntry {\n const path = Editor.path(editor, at, { edge: 'end' })\n return Editor.node(editor, path)\n },\n\n /**\n * Get the leaf text node at a location.\n */\n\n leaf(\n editor: Editor,\n at: Location,\n options: {\n depth?: number\n edge?: 'start' | 'end'\n } = {}\n ): NodeEntry<Text> {\n const path = Editor.path(editor, at, options)\n const node = Node.leaf(editor, path)\n return [node, path]\n },\n\n /**\n * Iterate through all of the levels at a location.\n */\n\n *levels<T extends Node>(\n editor: Editor,\n options: {\n at?: Location\n match?: NodeMatch<T>\n reverse?: boolean\n voids?: boolean\n } = {}\n ): Iterable<NodeEntry<T>> {\n const { at = editor.selection, reverse = false, voids = false } = options\n let { match } = options\n\n if (match == null) {\n match = () => true\n }\n\n if (!at) {\n return\n }\n\n const levels: NodeEntry<T>[] = []\n const path = Editor.path(editor, at)\n\n for (const [n, p] of Node.levels(editor, path)) {\n if (!match(n)) {\n continue\n }\n\n levels.push([n, p])\n\n if (!voids && Editor.isVoid(editor, n)) {\n break\n }\n }\n\n if (reverse) {\n levels.reverse()\n }\n\n yield* levels\n },\n\n /**\n * Get the marks that would be added to text at the current selection.\n */\n\n marks(editor: Editor): Record<string, any> | null {\n const { marks, selection } = editor\n\n if (!selection) {\n return null\n }\n\n if (marks) {\n return marks\n }\n\n if (Range.isExpanded(selection)) {\n const [match] = Editor.nodes(editor, { match: Text.isText })\n\n if (match) {\n const [node] = match as NodeEntry<Text>\n const { text, ...rest } = node\n return rest\n } else {\n return {}\n }\n }\n\n const { anchor } = selection\n const { path } = anchor\n let [node] = Editor.leaf(editor, path)\n\n if (anchor.offset === 0) {\n const prev = Editor.previous(editor, { at: path, match: Text.isText })\n const block = Editor.above(editor, {\n match: n => Editor.isBlock(editor, n),\n })\n\n if (prev && block) {\n const [prevNode, prevPath] = prev\n const [, blockPath] = block\n\n if (Path.isAncestor(blockPath, prevPath)) {\n node = prevNode as Text\n }\n }\n }\n\n const { text, ...rest } = node\n return rest\n },\n\n /**\n * Get the matching node in the branch of the document after a location.\n */\n\n next<T extends Node>(\n editor: Editor,\n options: {\n at?: Location\n match?: NodeMatch<T>\n mode?: 'all' | 'highest' | 'lowest'\n voids?: boolean\n } = {}\n ): NodeEntry<T> | undefined {\n const { mode = 'lowest', voids = false } = options\n let { match, at = editor.selection } = options\n\n if (!at) {\n return\n }\n\n const [, from] = Editor.last(editor, at)\n const [, to] = Editor.last(editor, [])\n const span: Span = [from, to]\n\n if (Path.isPath(at) && at.length === 0) {\n throw new Error(`Cannot get the next node from the root node!`)\n }\n\n if (match == null) {\n if (Path.isPath(at)) {\n const [parent] = Editor.parent(editor, at)\n match = n => parent.children.includes(n)\n } else {\n match = () => true\n }\n }\n\n const [, next] = Editor.nodes(editor, { at: span, match, mode, voids })\n return next\n },\n\n /**\n * Get the node at a location.\n */\n\n node(\n editor: Editor,\n at: Location,\n options: {\n depth?: number\n edge?: 'start' | 'end'\n } = {}\n ): NodeEntry {\n const path = Editor.path(editor, at, options)\n const node = Node.get(editor, path)\n return [node, path]\n },\n\n /**\n * Iterate through all of the nodes in the Editor.\n */\n\n *nodes<T extends Node>(\n editor: Editor,\n options: {\n at?: Location | Span\n match?: NodeMatch<T>\n mode?: 'all' | 'highest' | 'lowest'\n universal?: boolean\n reverse?: boolean\n voids?: boolean\n } = {}\n ): Iterable<NodeEntry<T>> {\n const {\n at = editor.selection,\n mode = 'all',\n universal = false,\n reverse = false,\n voids = false,\n } = options\n let { match } = options\n\n if (!match) {\n match = () => true\n }\n\n if (!at) {\n return\n }\n\n let from\n let to\n\n if (Span.isSpan(at)) {\n from = at[0]\n to = at[1]\n } else {\n const first = Editor.path(editor, at, { edge: 'start' })\n const last = Editor.path(editor, at, { edge: 'end' })\n from = reverse ? last : first\n to = reverse ? first : last\n }\n\n const iterable = Node.nodes(editor, {\n reverse,\n from,\n to,\n pass: ([n]) => (voids ? false : Editor.isVoid(editor, n)),\n })\n\n const matches: NodeEntry<T>[] = []\n let hit: NodeEntry<T> | undefined\n\n for (const [node, path] of iterable) {\n const isLower = hit && Path.compare(path, hit[1]) === 0\n\n // In highest mode any node lower than the last hit is not a match.\n if (mode === 'highest' && isLower) {\n continue\n }\n\n if (!match(node)) {\n // If we've arrived at a leaf text node that is not lower than the last\n // hit, then we've found a branch that doesn't include a match, which\n // means the match is not universal.\n if (universal && !isLower && Text.isText(node)) {\n return\n } else {\n continue\n }\n }\n\n // If there's a match and it's lower than the last, update the hit.\n if (mode === 'lowest' && isLower) {\n hit = [node, path]\n continue\n }\n\n // In lowest mode we emit the last hit, once it's guaranteed lowest.\n const emit: NodeEntry<T> | undefined =\n mode === 'lowest' ? hit : [node, path]\n\n if (emit) {\n if (universal) {\n matches.push(emit)\n } else {\n yield emit\n }\n }\n\n hit = [node, path]\n }\n\n // Since lowest is always emitting one behind, catch up at the end.\n if (mode === 'lowest' && hit) {\n if (universal) {\n matches.push(hit)\n } else {\n yield hit\n }\n }\n\n // Universal defers to ensure that the match occurs in every branch, so we\n // yield all of the matches after iterating.\n if (universal) {\n yield* matches\n }\n },\n /**\n * Normalize any dirty objects in the editor.\n */\n\n normalize(\n editor: Editor,\n options: {\n force?: boolean\n } = {}\n ) {\n const { force = false } = options\n const getDirtyPaths = (editor: Editor) => {\n return DIRTY_PATHS.get(editor) || []\n }\n\n if (!Editor.isNormalizing(editor)) {\n return\n }\n\n if (force) {\n const allPaths = Array.from(Node.nodes(editor), ([, p]) => p)\n DIRTY_PATHS.set(editor, allPaths)\n }\n\n if (getDirtyPaths(editor).length === 0) {\n return\n }\n\n Editor.withoutNormalizing(editor, () => {\n const max = getDirtyPaths(editor).length * 42 // HACK: better way?\n let m = 0\n\n while (getDirtyPaths(editor).length !== 0) {\n if (m > max) {\n throw new Error(`\n Could not completely normalize the editor after ${max} iterations! This is usually due to incorrect normalization logic that leaves a node in an invalid state.\n `)\n }\n\n const path = getDirtyPaths(editor).pop()!\n const entry = Editor.node(editor, path)\n editor.normalizeNode(entry)\n m++\n }\n })\n },\n\n /**\n * Get the parent node of a location.\n */\n\n parent(\n editor: Editor,\n at: Location,\n options: {\n depth?: number\n edge?: 'start' | 'end'\n } = {}\n ): NodeEntry<Ancestor> {\n const path = Editor.path(editor, at, options)\n const parentPath = Path.parent(path)\n const entry = Editor.node(editor, parentPath)\n return entry as NodeEntry<Ancestor>\n },\n\n /**\n * Get the path of a location.\n */\n\n path(\n editor: Editor,\n at: Location,\n options: {\n depth?: number\n edge?: 'start' | 'end'\n } = {}\n ): Path {\n const { depth, edge } = options\n\n if (Path.isPath(at)) {\n if (edge === 'start') {\n const [, firstPath] = Node.first(editor, at)\n at = firstPath\n } else if (edge === 'end') {\n const [, lastPath] = Node.last(editor, at)\n at = lastPath\n }\n }\n\n if (Range.isRange(at)) {\n if (edge === 'start') {\n at = Range.start(at)\n } else if (edge === 'end') {\n at = Range.end(at)\n } else {\n at = Path.common(at.anchor.path, at.focus.path)\n }\n }\n\n if (Point.isPoint(at)) {\n at = at.path\n }\n\n if (depth != null) {\n at = at.slice(0, depth)\n }\n\n return at\n },\n\n /**\n * Create a mutable ref for a `Path` object, which will stay in sync as new\n * operations are applied to the editor.\n */\n\n pathRef(\n editor: Editor,\n path: Path,\n options: {\n affinity?: 'backward' | 'forward' | null\n } = {}\n ): PathRef {\n const { affinity = 'forward' } = options\n const ref: PathRef = {\n current: path,\n affinity,\n unref() {\n const { current } = ref\n const pathRefs = Editor.pathRefs(editor)\n pathRefs.delete(ref)\n ref.current = null\n return current\n },\n }\n\n const refs = Editor.pathRefs(editor)\n refs.add(ref)\n return ref\n },\n\n /**\n * Get the set of currently tracked path refs of the editor.\n */\n\n pathRefs(editor: Editor): Set<PathRef> {\n let refs = PATH_REFS.get(editor)\n\n if (!refs) {\n refs = new Set()\n PATH_REFS.set(editor, refs)\n }\n\n return refs\n },\n\n /**\n * Get the start or end point of a location.\n */\n\n point(\n editor: Editor,\n at: Location,\n options: {\n edge?: 'start' | 'end'\n } = {}\n ): Point {\n const { edge = 'start' } = options\n\n if (Path.isPath(at)) {\n let path\n\n if (edge === 'end') {\n const [, lastPath] = Node.last(editor, at)\n path = lastPath\n } else {\n const [, firstPath] = Node.first(editor, at)\n path = firstPath\n }\n\n const node = Node.get(editor, path)\n\n if (!Text.isText(node)) {\n throw new Error(\n `Cannot get the ${edge} point in the node at path [${at}] because it has no ${edge} text node.`\n )\n }\n\n return { path, offset: edge === 'end' ? node.text.length : 0 }\n }\n\n if (Range.isRange(at)) {\n const [start, end] = Range.edges(at)\n return edge === 'start' ? start : end\n }\n\n return at\n },\n\n /**\n * Create a mutable ref for a `Point` object, which will stay in sync as new\n * operations are applied to the editor.\n */\n\n pointRef(\n editor: Editor,\n point: Point,\n options: {\n affinity?: 'backward' | 'forward' | null\n } = {}\n ): PointRef {\n const { affinity = 'forward' } = options\n const ref: PointRef = {\n current: point,\n affinity,\n unref() {\n const { current } = ref\n const pointRefs = Editor.pointRefs(editor)\n pointRefs.delete(ref)\n ref.current = null\n return current\n },\n }\n\n const refs = Editor.pointRefs(editor)\n refs.add(ref)\n return ref\n },\n\n /**\n * Get the set of currently tracked point refs of the editor.\n */\n\n pointRefs(editor: Editor): Set<PointRef> {\n let refs = POINT_REFS.get(editor)\n\n if (!refs) {\n refs = new Set()\n POINT_REFS.set(editor, refs)\n }\n\n return refs\n },\n\n /**\n * Iterate through all of the positions in the document where a `Point` can be\n * placed.\n *\n * By default it will move forward by individual offsets at a time, but you\n * can pass the `unit: 'character'` option to moved forward one character, word,\n * or line at at time.\n *\n * Note: void nodes are treated as a single point, and iteration will not\n * happen inside their content.\n */\n\n *positions(\n editor: Editor,\n options: {\n at?: Location\n unit?: 'offset' | 'character' | 'word' | 'line' | 'block'\n reverse?: boolean\n } = {}\n ): Iterable<Point> {\n const { at = editor.selection, unit = 'offset', reverse = false } = options\n\n if (!at) {\n return\n }\n\n const range = Editor.range(editor, at)\n const [start, end] = Range.edges(range)\n const first = reverse ? end : start\n let string = ''\n let available = 0\n let offset = 0\n let distance: number | null = null\n let isNewBlock = false\n\n const advance = () => {\n if (distance == null) {\n if (unit === 'character') {\n distance = getCharacterDistance(string)\n } else if (unit === 'word') {\n distance = getWordDistance(string)\n } else if (unit === 'line' || unit === 'block') {\n distance = string.length\n } else {\n distance = 1\n }\n\n string = string.slice(distance)\n }\n\n // Add or substract the offset.\n offset = reverse ? offset - distance : offset + distance\n // Subtract the distance traveled from the available text.\n available = available - distance!\n // If the available had room to spare, reset the distance so that it will\n // advance again next time. Otherwise, set it to the overflow amount.\n distance = available >= 0 ? null : 0 - available\n }\n\n for (const [node, path] of Editor.nodes(editor, { at, reverse })) {\n if (Element.isElement(node)) {\n // Void nodes are a special case, since we don't want to iterate over\n // their content. We instead always just yield their first point.\n if (editor.isVoid(node)) {\n yield Editor.start(editor, path)\n continue\n }\n\n if (editor.isInline(node)) {\n continue\n }\n\n if (Editor.hasInlines(editor, node)) {\n const e = Path.isAncestor(path, end.path)\n ? end\n : Editor.end(editor, path)\n const s = Path.isAncestor(path, start.path)\n ? start\n : Editor.start(editor, path)\n\n const text = Editor.string(editor, { anchor: s, focus: e })\n string = reverse ? reverseText(text) : text\n isNewBlock = true\n }\n }\n\n if (Text.isText(node)) {\n const isFirst = Path.equals(path, first.path)\n available = node.text.length\n offset = reverse ? available : 0\n\n if (isFirst) {\n available = reverse ? first.offset : available - first.offset\n offset = first.offset\n }\n\n if (isFirst || isNewBlock || unit === 'offset') {\n yield { path, offset }\n }\n\n while (true) {\n // If there's no more string, continue to the next block.\n if (string === '') {\n break\n } else {\n advance()\n }\n\n // If the available space hasn't overflow, we have another point to\n // yield in the current text node.\n if (available >= 0) {\n yield { path, offset }\n } else {\n break\n }\n }\n\n isNewBlock = false\n }\n }\n },\n\n /**\n * Get the matching node in the branch of the document before a location.\n */\n\n previous<T extends Node>(\n editor: Editor,\n options: {\n at?: Location\n match?: NodeMatch<T>\n mode?: 'all' | 'highest' | 'lowest'\n voids?: boolean\n } = {}\n ): NodeEntry<T> | undefined {\n const { mode = 'lowest', voids = false } = options\n let { match, at = editor.selection } = options\n\n if (!at) {\n return\n }\n\n const [, from] = Editor.first(editor, at)\n const [, to] = Editor.first(editor, [])\n const span: Span = [from, to]\n\n if (Path.isPath(at) && at.length === 0) {\n throw new Error(`Cannot get the previous node from the root node!`)\n }\n\n if (match == null) {\n if (Path.isPath(at)) {\n const [parent] = Editor.parent(editor, at)\n match = n => parent.children.includes(n)\n } else {\n match = () => true\n }\n }\n\n const [, previous] = Editor.nodes(editor, {\n reverse: true,\n at: span,\n match,\n mode,\n voids,\n })\n\n return previous\n },\n\n /**\n * Get a range of a location.\n */\n\n range(editor: Editor, at: Location, to?: Location): Range {\n if (Range.isRange(at) && !to) {\n return at\n }\n\n const start = Editor.start(editor, at)\n const end = Editor.end(editor, to || at)\n return { anchor: start, focus: end }\n },\n\n /**\n * Create a mutable ref for a `Range` object, which will stay in sync as new\n * operations are applied to the editor.\n */\n\n rangeRef(\n editor: Editor,\n range: Range,\n options: {\n affinity?: 'backward' | 'forward' | 'outward' | 'inward' | null\n } = {}\n ): RangeRef {\n const { affinity = 'forward' } = options\n const ref: RangeRef = {\n current: range,\n affinity,\n unref() {\n const { current } = ref\n const rangeRefs = Editor.rangeRefs(editor)\n rangeRefs.delete(ref)\n ref.current = null\n return current\n },\n }\n\n const refs = Editor.rangeRefs(editor)\n refs.add(ref)\n return ref\n },\n\n /**\n * Get the set of currently tracked range refs of the editor.\n */\n\n rangeRefs(editor: Editor): Set<RangeRef> {\n let refs = RANGE_REFS.get(editor)\n\n if (!refs) {\n refs = new Set()\n RANGE_REFS.set(editor, refs)\n }\n\n return refs\n },\n\n /**\n * Remove a custom property from all of the leaf text nodes in the current\n * selection.\n *\n * If the selection is currently collapsed, the removal will be stored on\n * `editor.marks` and applied to the text inserted next.\n */\n\n removeMark(editor: Editor, key: string): void {\n editor.removeMark(key)\n },\n\n /**\n * Get the start point of a location.\n */\n\n start(editor: Editor, at: Location): Point {\n return Editor.point(editor, at, { edge: 'start' })\n },\n\n /**\n * Get the text string content of a location.\n *\n * Note: the text of void nodes is presumed to be an empty string, regardless\n * of what their actual content is.\n */\n\n string(editor: Editor, at: Location): string {\n const range = Editor.range(editor, at)\n const [start, end] = Range.edges(range)\n let text = ''\n\n for (const [node, path] of Editor.nodes(editor, {\n at: range,\n match: Text.isText,\n })) {\n let t = node.text\n\n if (Path.equals(path, end.path)) {\n t = t.slice(0, end.offset)\n }\n\n if (Path.equals(path, start.path)) {\n t = t.slice(start.offset)\n }\n\n text += t\n }\n\n return text\n },\n\n /**\n * Transform the editor by an operation.\n */\n\n transform(editor: Editor, op: Operation) {\n editor.children = createDraft(editor.children)\n let selection = editor.selection && createDraft(editor.selection)\n\n switch (op.type) {\n case 'insert_node': {\n const { path, node } = op\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n parent.children.splice(index, 0, node)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'insert_text': {\n const { path, offset, text } = op\n const node = Node.leaf(editor, path)\n const before = node.text.slice(0, offset)\n const after = node.text.slice(offset)\n node.text = before + text + after\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'merge_node': {\n const { path } = op\n const node = Node.get(editor, path)\n const prevPath = Path.previous(path)\n const prev = Node.get(editor, prevPath)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n\n if (Text.isText(node) && Text.isText(prev)) {\n prev.text += node.text\n } else if (!Text.isText(node) && !Text.isText(prev)) {\n prev.children.push(...node.children)\n } else {\n throw new Error(\n `Cannot apply a \"merge_node\" operation at path [${path}] to nodes of different interaces: ${node} ${prev}`\n )\n }\n\n parent.children.splice(index, 1)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'move_node': {\n const { path, newPath } = op\n\n if (Path.isAncestor(path, newPath)) {\n throw new Error(\n `Cannot move a path [${path}] to new path [${newPath}] because the destination is inside itself.`\n )\n }\n\n const node = Node.get(editor, path)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n\n // This is tricky, but since the `path` and `newPath` both refer to\n // the same snapshot in time, there's a mismatch. After either\n // removing the original position, the second step's path can be out\n // of date. So instead of using the `op.newPath` directly, we\n // transform `op.path` to ascertain what the `newPath` would be after\n // the operation was applied.\n parent.children.splice(index, 1)\n const truePath = Path.transform(path, op)!\n const newParent = Node.get(editor, Path.parent(truePath))\n const newIndex = truePath[truePath.length - 1]\n\n newParent.children.splice(newIndex, 0, node)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'remove_node': {\n const { path } = op\n const index = path[path.length - 1]\n const parent = Node.parent(editor, path)\n parent.children.splice(index, 1)\n\n // Transform all of the points in the value, but if the point was in the\n // node that was removed we need to update the range or remove it.\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n const result = Point.transform(point, op)\n\n if (selection != null && result != null) {\n selection[key] = result\n } else {\n let prev: NodeEntry<Text> | undefined\n let next: NodeEntry<Text> | undefined\n\n for (const [n, p] of Node.texts(editor)) {\n if (Path.compare(p, path) === -1) {\n prev = [n, p]\n } else {\n next = [n, p]\n break\n }\n }\n\n if (prev) {\n point.path = prev[1]\n point.offset = prev[0].text.length\n } else if (next) {\n point.path = next[1]\n point.offset = 0\n } else {\n selection = null\n }\n }\n }\n }\n\n break\n }\n\n case 'remove_text': {\n const { path, offset, text } = op\n const node = Node.leaf(editor, path)\n const before = node.text.slice(0, offset)\n const after = node.text.slice(offset + text.length)\n node.text = before + after\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'set_node': {\n const { path, newProperties } = op\n\n if (path.length === 0) {\n throw new Error(`Cannot set properties on the root node!`)\n }\n\n const node = Node.get(editor, path)\n\n for (const key in newProperties) {\n if (key === 'children' || key === 'text') {\n throw new Error(`Cannot set the \"${key}\" property of nodes!`)\n }\n\n const value = newProperties[key]\n\n if (value == null) {\n delete node[key]\n } else {\n node[key] = value\n }\n }\n\n break\n }\n\n case 'set_selection': {\n const { newProperties } = op\n\n if (newProperties == null) {\n selection = newProperties\n } else if (selection == null) {\n if (!Range.isRange(newProperties)) {\n throw new Error(\n `Cannot apply an incomplete \"set_selection\" operation properties ${JSON.stringify(\n newProperties\n )} when there is no current selection.`\n )\n }\n\n selection = newProperties\n } else {\n Object.assign(selection, newProperties)\n }\n\n break\n }\n\n case 'split_node': {\n const { path, position, properties } = op\n\n if (path.length === 0) {\n throw new Error(\n `Cannot apply a \"split_node\" operation at path [${path}] because the root node cannot be split.`\n )\n }\n\n const node = Node.get(editor, path)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n let newNode: Descendant\n\n if (Text.isText(node)) {\n const before = node.text.slice(0, position)\n const after = node.text.slice(position)\n node.text = before\n newNode = {\n ...node,\n ...(properties as Partial<Text>),\n text: after,\n }\n } else {\n const before = node.children.slice(0, position)\n const after = node.children.slice(position)\n node.children = before\n\n newNode = {\n ...node,\n ...(properties as Partial<Element>),\n children: after,\n }\n }\n\n parent.children.splice(index + 1, 0, newNode)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n }\n\n editor.children = finishDraft(editor.children) as Node[]\n\n if (selection) {\n editor.selection = isDraft(selection)\n ? (finishDraft(selection) as Range)\n : selection\n } else {\n editor.selection = null\n }\n },\n\n /**\n * Convert a range into a non-hanging one.\n */\n\n unhangRange(\n editor: Editor,\n range: Range,\n options: {\n voids?: boolean\n } = {}\n ): Range {\n const { voids = false } = options\n let [start, end] = Range.edges(range)\n\n // PERF: exit early if we can guarantee that the range isn't hanging.\n if (start.offset !== 0 || end.offset !== 0 || Range.isCollapsed(range)) {\n return range\n }\n\n const endBlock = Editor.above(editor, {\n at: end,\n match: n => Editor.isBlock(editor, n),\n })\n const blockPath = endBlock ? endBlock[1] : []\n const first = Editor.start(editor, [])\n const before = { anchor: first, focus: end }\n let skip = true\n\n for (const [node, path] of Editor.nodes(editor, {\n at: before,\n match: Text.isText,\n reverse: true,\n voids,\n })) {\n if (skip) {\n skip = false\n continue\n }\n\n if (node.text !== '' || Path.isBefore(path, blockPath)) {\n end = { path, offset: node.text.length }\n break\n }\n }\n\n return { anchor: start, focus: end }\n },\n\n /**\n * Match a void node in the current branch of the editor.\n */\n\n void(\n editor: Editor,\n options: {\n at?: Location\n mode?: 'highest' | 'lowest'\n voids?: boolean\n } = {}\n ): NodeEntry<Element> | undefined {\n return Editor.above(editor, {\n ...options,\n match: n => Editor.isVoid(editor, n),\n })\n },\n\n /**\n * Call a function, deferring normalization until after it completes.\n */\n\n withoutNormalizing(editor: Editor, fn: () => void): void {\n const value = Editor.isNormalizing(editor)\n NORMALIZING.set(editor, false)\n fn()\n NORMALIZING.set(editor, value)\n Editor.normalize(editor)\n },\n}\n\n/**\n * A helper type for narrowing matched nodes with a predicate.\n */\n\ntype NodeMatch<T extends Node> =\n | ((node: Node) => node is T)\n | ((node: Node) => boolean)\n","import isPlainObject from 'is-plain-object'\nimport { Editor, Node, Path } from '..'\n\n/**\n * `Element` objects are a type of node in a Slate document that contain other\n * element nodes or text nodes. They can be either \"blocks\" or \"inlines\"\n * depending on the Slate editor's configuration.\n */\n\nexport interface Element {\n children: Node[]\n [key: string]: any\n}\n\nexport const Element = {\n /**\n * Check if a value implements the `Element` interface.\n */\n\n isElement(value: any): value is Element {\n return (\n isPlainObject(value) &&\n Node.isNodeList(value.children) &&\n !Editor.isEditor(value)\n )\n },\n\n /**\n * Check if a value is an array of `Element` objects.\n */\n\n isElementList(value: any): value is Element[] {\n return (\n Array.isArray(value) &&\n (value.length === 0 || Element.isElement(value[0]))\n )\n },\n\n /**\n * Check if an element matches set of properties.\n *\n * Note: this checks custom properties, and it does not ensure that any\n * children are equivalent.\n */\n\n matches(element: Element, props: Partial<Element>): boolean {\n for (const key in props) {\n if (key === 'children') {\n continue\n }\n\n if (element[key] !== props[key]) {\n return false\n }\n }\n\n return true\n },\n}\n\n/**\n * `ElementEntry` objects refer to an `Element` and the `Path` where it can be\n * found inside a root node.\n */\n\nexport type ElementEntry = [Element, Path]\n","import { Path, Point, Range } from '..'\n\n/**\n * The `Location` interface is a union of the ways to refer to a specific\n * location in a Slate document: paths, points or ranges.\n *\n * Methods will often accept a `Location` instead of requiring only a `Path`,\n * `Point` or `Range`. This eliminates the need for developers to manage\n * converting between the different interfaces in their own code base.\n */\n\nexport type Location = Path | Point | Range\n\nexport const Location = {\n /**\n * Check if a value implements the `Location` interface.\n */\n\n isLocation(value: any): value is Location {\n return Path.isPath(value) || Point.isPoint(value) || Range.isRange(value)\n },\n}\n\n/**\n * The `Span` interface is a low-level way to refer to locations in nodes\n * without using `Point` which requires leaf text nodes to be present.\n */\n\nexport type Span = [Path, Path]\n\nexport const Span = {\n /**\n * Check if a value implements the `Span` interface.\n */\n\n isSpan(value: any): value is Span {\n return (\n Array.isArray(value) && value.length === 2 && value.every(Path.isPath)\n )\n },\n}\n","import { produce } from 'immer'\nimport { Editor, Element, ElementEntry, Path, Range, Text } from '..'\n\n/**\n * The `Node` union type represents all of the different types of nodes that\n * occur in a Slate document tree.\n */\n\nexport type Node = Editor | Element | Text\n\nexport const Node = {\n /**\n * Get the node at a specific path, asserting that it's an ancestor node.\n */\n\n ancestor(root: Node, path: Path): Ancestor {\n const node = Node.get(root, path)\n\n if (Text.isText(node)) {\n throw new Error(\n `Cannot get the ancestor node at path [${path}] because it refers to a text node instead: ${node}`\n )\n }\n\n return node\n },\n\n /**\n * Return an iterable of all the ancestor nodes above a specific path.\n *\n * By default the order is bottom-up, from lowest to highest ancestor in\n * the tree, but you can pass the `reverse: true` option to go top-down.\n */\n\n *ancestors(\n root: Node,\n path: Path,\n options: {\n reverse?: boolean\n } = {}\n ): Iterable<NodeEntry<Ancestor>> {\n for (const p of Path.ancestors(path, options)) {\n const n = Node.ancestor(root, p)\n const entry: NodeEntry<Ancestor> = [n, p]\n yield entry\n }\n },\n\n /**\n * Get the child of a node at a specific index.\n */\n\n child(root: Node, index: number): Descendant {\n if (Text.isText(root)) {\n throw new Error(\n `Cannot get the child of a text node: ${JSON.stringify(root)}`\n )\n }\n\n const c = root.children[index] as Descendant\n\n if (c == null) {\n throw new Error(\n `Cannot get child at index \\`${index}\\` in node: ${JSON.stringify(\n root\n )}`\n )\n }\n\n return c\n },\n\n /**\n * Iterate over the children of a node at a specific path.\n */\n\n *children(\n root: Node,\n path: Path,\n options: {\n reverse?: boolean\n } = {}\n ): Iterable<NodeEntry<Descendant>> {\n const { reverse = false } = options\n const ancestor = Node.ancestor(root, path)\n const { children } = ancestor\n let index = reverse ? children.length - 1 : 0\n\n while (reverse ? index >= 0 : index < children.length) {\n const child = Node.child(ancestor, index)\n const childPath = path.concat(index)\n yield [child, childPath]\n index = reverse ? index - 1 : index + 1\n }\n },\n\n /**\n * Get an entry for the common ancesetor node of two paths.\n */\n\n common(root: Node, path: Path, another: Path): NodeEntry {\n const p = Path.common(path, another)\n const n = Node.get(root, p)\n return [n, p]\n },\n\n /**\n * Get the node at a specific path, asserting that it's a descendant node.\n */\n\n descendant(root: Node, path: Path): Descendant {\n const node = Node.get(root, path)\n\n if (Editor.isEditor(node)) {\n throw new Error(\n `Cannot get the descendant node at path [${path}] because it refers to the root editor node instead: ${node}`\n )\n }\n\n return node\n },\n\n /**\n * Return an iterable of all the descendant node entries inside a root node.\n */\n\n *descendants(\n root: Node,\n options: {\n from?: Path\n to?: Path\n reverse?: boolean\n pass?: (node: NodeEntry) => boolean\n } = {}\n ): Iterable<NodeEntry<Descendant>> {\n for (const [node, path] of Node.nodes(root, options)) {\n if (path.length !== 0) {\n // NOTE: we have to coerce here because checking the path's length does\n // guarantee that `node` is not a `Editor`, but TypeScript doesn't know.\n yield [node, path] as NodeEntry<Descendant>\n }\n }\n },\n\n /**\n * Return an iterable of all the element nodes inside a root node. Each iteration\n * will return an `ElementEntry` tuple consisting of `[Element, Path]`. If the\n * root node is an element it will be included in the iteration as well.\n */\n\n *elements(\n root: Node,\n options: {\n from?: Path\n to?: Path\n reverse?: boolean\n pass?: (node: NodeEntry) => boolean\n } = {}\n ): Iterable<ElementEntry> {\n for (const [node, path] of Node.nodes(root, options)) {\n if (Element.isElement(node)) {\n yield [node, path]\n }\n }\n },\n\n /**\n * Get the first node entry in a root node from a path.\n */\n\n first(root: Node, path: Path): NodeEntry {\n const p = path.slice()\n let n = Node.get(root, p)\n\n while (n) {\n if (Text.isText(n) || n.children.length === 0) {\n break\n } else {\n n = n.children[0]\n p.push(0)\n }\n }\n\n return [n, p]\n },\n\n /**\n * Get the sliced fragment represented by a range inside a root node.\n */\n\n fragment(root: Node, range: Range): Descendant[] {\n if (Text.isText(root)) {\n throw new Error(\n `Cannot get a fragment starting from a root text node: ${JSON.stringify(\n root\n )}`\n )\n }\n\n const newRoot = produce(root, r => {\n const [start, end] = Range.edges(range)\n const iterable = Node.nodes(r, {\n reverse: true,\n pass: ([, path]) => !Range.includes(range, path),\n })\n\n for (const [, path] of iterable) {\n if (!Range.includes(range, path)) {\n const parent = Node.parent(r, path)\n const index = path[path.length - 1]\n parent.children.splice(index, 1)\n }\n\n if (Path.equals(path, end.path)) {\n const leaf = Node.leaf(r, path)\n leaf.text = leaf.text.slice(0, end.offset)\n }\n\n if (Path.equals(path, start.path)) {\n const leaf = Node.leaf(r, path)\n leaf.text = leaf.text.slice(start.offset)\n }\n }\n\n delete r.selection\n })\n\n return newRoot.children\n },\n\n /**\n * Get the descendant node referred to by a specific path. If the path is an\n * empty array, it refers to the root node itself.\n */\n\n get(root: Node, path: Path): Node {\n let node = root\n\n for (let i = 0; i < path.length; i++) {\n const p = path[i]\n\n if (Text.isText(node) || !node.children[p]) {\n throw new Error(\n `Cannot find a descendant at path [${path}] in node: ${JSON.stringify(\n root\n )}`\n )\n }\n\n node = node.children[p]\n }\n\n return node\n },\n\n /**\n * Check if a descendant node exists at a specific path.\n */\n\n has(root: Node, path: Path): boolean {\n let node = root\n\n for (let i = 0; i < path.length; i++) {\n const p = path[i]\n\n if (Text.isText(node) || !node.children[p]) {\n return false\n }\n\n node = node.children[p]\n }\n\n return true\n },\n\n /**\n * Check if a value implements the `Node` interface.\n */\n\n isNode(value: any): value is Node {\n return (\n Text.isText(value) || Element.isElement(value) || Editor.isEditor(value)\n )\n },\n\n /**\n * Check if a value is a list of `Node` objects.\n */\n\n isNodeList(value: any): value is Node[] {\n return Array.isArray(value) && (value.length === 0 || Node.isNode(value[0]))\n },\n\n /**\n * Get the lash node entry in a root node from a path.\n */\n\n last(root: Node, path: Path): NodeEntry {\n const p = path.slice()\n let n = Node.get(root, p)\n\n while (n) {\n if (Text.isText(n) || n.children.length === 0) {\n break\n } else {\n const i = n.children.length - 1\n n = n.children[i]\n p.push(i)\n }\n }\n\n return [n, p]\n },\n\n /**\n * Get the node at a specific path, ensuring it's a leaf text node.\n */\n\n leaf(root: Node, path: Path): Text {\n const node = Node.get(root, path)\n\n if (!Text.isText(node)) {\n throw new Error(\n `Cannot get the leaf node at path [${path}] because it refers to a non-leaf node: ${node}`\n )\n }\n\n return node\n },\n\n /**\n * Return an iterable of the in a branch of the tree, from a specific path.\n *\n * By default the order is top-down, from lowest to highest node in the tree,\n * but you can pass the `reverse: true` option to go bottom-up.\n */\n\n *levels(\n root: Node,\n path: Path,\n options: {\n reverse?: boolean\n } = {}\n ): Iterable<NodeEntry> {\n for (const p of Path.levels(path, options)) {\n const n = Node.get(root, p)\n yield [n, p]\n }\n },\n\n /**\n * Check if a node matches a set of props.\n */\n\n matches(node: Node, props: Partial<Node>): boolean {\n return (\n (Element.isElement(node) && Element.matches(node, props)) ||\n (Text.isText(node) && Text.matches(node, props))\n )\n },\n\n /**\n * Return an iterable of all the node entries of a root node. Each entry is\n * returned as a `[Node, Path]` tuple, with the path referring to the node's\n * position inside the root node.\n */\n\n *nodes(\n root: Node,\n options: {\n from?: Path\n to?: Path\n reverse?: boolean\n pass?: (entry: NodeEntry) => boolean\n } = {}\n ): Iterable<NodeEntry> {\n const { pass, reverse = false } = options\n const { from = [], to } = options\n const visited = new Set()\n let p: Path = []\n let n = root\n\n while (true) {\n if (to && (reverse ? Path.isBefore(p, to) : Path.isAfter(p, to))) {\n break\n }\n\n if (!visited.has(n)) {\n yield [n, p]\n }\n\n // If we're allowed to go downward and we haven't decsended yet, do.\n if (\n !visited.has(n) &&\n !Text.isText(n) &&\n n.children.length !== 0 &&\n (pass == null || pass([n, p]) === false)\n ) {\n visited.add(n)\n let nextIndex = reverse ? n.children.length - 1 : 0\n\n if (Path.isAncestor(p, from)) {\n nextIndex = from[p.length]\n }\n\n p = p.concat(nextIndex)\n n = Node.get(root, p)\n continue\n }\n\n // If we're at the root and we can't go down, we're done.\n if (p.length === 0) {\n break\n }\n\n // If we're going forward...\n if (!reverse) {\n const newPath = Path.next(p)\n\n if (Node.has(root, newPath)) {\n p = newPath\n n = Node.get(root, p)\n continue\n }\n }\n\n // If we're going backward...\n if (reverse && p[p.length - 1] !== 0) {\n const newPath = Path.previous(p)\n p = newPath\n n = Node.get(root, p)\n continue\n }\n\n // Otherwise we're going upward...\n p = Path.parent(p)\n n = Node.get(root, p)\n visited.add(n)\n }\n },\n\n /**\n * Get the parent of a node at a specific path.\n */\n\n parent(root: Node, path: Path): Ancestor {\n const parentPath = Path.parent(path)\n const p = Node.get(root, parentPath)\n\n if (Text.isText(p)) {\n throw new Error(\n `Cannot get the parent of path [${path}] because it does not exist in the root.`\n )\n }\n\n return p\n },\n\n /**\n * Get the concatenated text string of a node's content.\n *\n * Note that this will not include spaces or line breaks between block nodes.\n * It is not a user-facing string, but a string for performing offset-related\n * computations for a node.\n */\n\n string(node: Node): string {\n if (Text.isText(node)) {\n return node.text\n } else {\n return node.children.map(Node.string).join('')\n }\n },\n\n /**\n * Return an iterable of all leaf text nodes in a root node.\n */\n\n *texts(\n root: Node,\n options: {\n from?: Path\n to?: Path\n reverse?: boolean\n pass?: (node: NodeEntry) => boolean\n } = {}\n ): Iterable<NodeEntry<Text>> {\n for (const [node, path] of Node.nodes(root, options)) {\n if (Text.isText(node)) {\n yield [node, path]\n }\n }\n },\n}\n\n/**\n * The `Descendant` union type represents nodes that are descendants in the\n * tree. It is returned as a convenience in certain cases to narrow a value\n * further than the more generic `Node` union.\n */\n\nexport type Descendant = Element | Text\n\n/**\n * The `Ancestor` union type represents nodes that are ancestors in the tree.\n * It is returned as a convenience in certain cases to narrow a value further\n * than the more generic `Node` union.\n */\n\nexport type Ancestor = Editor | Element\n\n/**\n * `NodeEntry` objects are returned when iterating over the nodes in a Slate\n * document tree. They consist of the node and its `Path` relative to the root\n * node in the document.\n */\n\nexport type NodeEntry<T extends Node = Node> = [T, Path]\n","import { Node, Path, Range } from '..'\nimport isPlainObject from 'is-plain-object'\n\nexport type InsertNodeOperation = {\n type: 'insert_node'\n path: Path\n node: Node\n [key: string]: any\n}\n\nexport type InsertTextOperation = {\n type: 'insert_text'\n path: Path\n offset: number\n text: string\n [key: string]: any\n}\n\nexport type MergeNodeOperation = {\n type: 'merge_node'\n path: Path\n position: number\n target: number | null\n properties: Partial<Node>\n [key: string]: any\n}\n\nexport type MoveNodeOperation = {\n type: 'move_node'\n path: Path\n newPath: Path\n [key: string]: any\n}\n\nexport type RemoveNodeOperation = {\n type: 'remove_node'\n path: Path\n node: Node\n [key: string]: any\n}\n\nexport type RemoveTextOperation = {\n type: 'remove_text'\n path: Path\n offset: number\n text: string\n [key: string]: any\n}\n\nexport type SetNodeOperation = {\n type: 'set_node'\n path: Path\n properties: Partial<Node>\n newProperties: Partial<Node>\n [key: string]: any\n}\n\nexport type SetSelectionOperation =\n | {\n type: 'set_selection'\n [key: string]: any\n properties: null\n newProperties: Range\n }\n | {\n type: 'set_selection'\n [key: string]: any\n properties: Partial<Range>\n newProperties: Partial<Range>\n }\n | {\n type: 'set_selection'\n [key: string]: any\n properties: Range\n newProperties: null\n }\n\nexport type SplitNodeOperation = {\n type: 'split_node'\n path: Path\n position: number\n target: number | null\n properties: Partial<Node>\n [key: string]: any\n}\n\nexport type NodeOperation =\n | InsertNodeOperation\n | MergeNodeOperation\n | MoveNodeOperation\n | RemoveNodeOperation\n | SetNodeOperation\n | SplitNodeOperation\n\nexport type SelectionOperation = SetSelectionOperation\n\nexport type TextOperation = InsertTextOperation | RemoveTextOperation\n\n/**\n * `Operation` objects define the low-level instructions that Slate editors use\n * to apply changes to their internal state. Representing all changes as\n * operations is what allows Slate editors to easily implement history,\n * collaboration, and other features.\n */\n\nexport type Operation = NodeOperation | SelectionOperation | TextOperation\n\nexport const Operation = {\n /**\n * Check of a value is a `NodeOperation` object.\n */\n\n isNodeOperation(value: any): value is NodeOperation {\n return Operation.isOperation(value) && value.type.endsWith('_node')\n },\n\n /**\n * Check of a value is an `Operation` object.\n */\n\n isOperation(value: any): value is Operation {\n if (!isPlainObject(value)) {\n return false\n }\n\n switch (value.type) {\n case 'insert_node':\n return Path.isPath(value.path) && Node.isNode(value.node)\n case 'insert_text':\n return (\n typeof value.offset === 'number' &&\n typeof value.text === 'string' &&\n Path.isPath(value.path)\n )\n case 'merge_node':\n return (\n typeof value.position === 'number' &&\n (typeof value.target === 'number' || value.target === null) &&\n Path.isPath(value.path) &&\n isPlainObject(value.properties)\n )\n case 'move_node':\n return Path.isPath(value.path) && Path.isPath(value.newPath)\n case 'remove_node':\n return Path.isPath(value.path) && Node.isNode(value.node)\n case 'remove_text':\n return (\n typeof value.offset === 'number' &&\n typeof value.text === 'string' &&\n Path.isPath(value.path)\n )\n case 'set_node':\n return (\n Path.isPath(value.path) &&\n isPlainObject(value.properties) &&\n isPlainObject(value.newProperties)\n )\n case 'set_selection':\n return (\n (value.properties === null && Range.isRange(value.newProperties)) ||\n (value.newProperties === null && Range.isRange(value.properties)) ||\n (isPlainObject(value.properties) &&\n isPlainObject(value.newProperties))\n )\n case 'split_node':\n return (\n Path.isPath(value.path) &&\n typeof value.position === 'number' &&\n (typeof value.target === 'number' || value.target === null) &&\n isPlainObject(value.properties)\n )\n default:\n return false\n }\n },\n\n /**\n * Check if a value is a list of `Operation` objects.\n */\n\n isOperationList(value: any): value is Operation[] {\n return (\n Array.isArray(value) &&\n (value.length === 0 || Operation.isOperation(value[0]))\n )\n },\n\n /**\n * Check of a value is a `SelectionOperation` object.\n */\n\n isSelectionOperation(value: any): value is SelectionOperation {\n return Operation.isOperation(value) && value.type.endsWith('_selection')\n },\n\n /**\n * Check of a value is a `TextOperation` object.\n */\n\n isTextOperation(value: any): value is TextOperation {\n return Operation.isOperation(value) && value.type.endsWith('_text')\n },\n\n /**\n * Invert an operation, returning a new operation that will exactly undo the\n * original when applied.\n */\n\n inverse(op: Operation): Operation {\n switch (op.type) {\n case 'insert_node': {\n return { ...op, type: 'remove_node' }\n }\n\n case 'insert_text': {\n return { ...op, type: 'remove_text' }\n }\n\n case 'merge_node': {\n return { ...op, type: 'split_node', path: Path.previous(op.path) }\n }\n\n case 'move_node': {\n const { newPath, path } = op\n\n // PERF: in this case the move operation is a no-op anyways.\n if (Path.equals(newPath, path)) {\n return op\n }\n\n // We need to get the original path here, but sometimes the `newPath`\n // is a younger sibling of (or ends before) the original, and this\n // accounts for it.\n const inversePath = Path.transform(path, op)!\n const inverseNewPath = Path.transform(Path.next(path), op)!\n return { ...op, path: inversePath, newPath: inverseNewPath }\n }\n\n case 'remove_node': {\n return { ...op, type: 'insert_node' }\n }\n\n case 'remove_text': {\n return { ...op, type: 'insert_text' }\n }\n\n case 'set_node': {\n const { properties, newProperties } = op\n return { ...op, properties: newProperties, newProperties: properties }\n }\n\n case 'set_selection': {\n const { properties, newProperties } = op\n\n if (properties == null) {\n return {\n ...op,\n properties: newProperties as Range,\n newProperties: null,\n }\n } else if (newProperties == null) {\n return {\n ...op,\n properties: null,\n newProperties: properties as Range,\n }\n } else {\n return { ...op, properties: newProperties, newProperties: properties }\n }\n }\n\n case 'split_node': {\n return { ...op, type: 'merge_node', path: Path.next(op.path) }\n }\n }\n },\n}\n","import { produce } from 'immer'\nimport { Operation } from '..'\n\n/**\n * `Path` arrays are a list of indexes that describe a node's exact position in\n * a Slate node tree. Although they are usually relative to the root `Editor`\n * object, they can be relative to any `Node` object.\n */\n\nexport type Path = number[]\n\nexport const Path = {\n /**\n * Get a list of ancestor paths for a given path.\n *\n * The paths are sorted from deepest to shallowest ancestor. However, if the\n * `reverse: true` option is passed, they are reversed.\n */\n\n ancestors(path: Path, options: { reverse?: boolean } = {}): Path[] {\n const { reverse = false } = options\n let paths = Path.levels(path, options)\n\n if (reverse) {\n paths = paths.slice(1)\n } else {\n paths = paths.slice(0, -1)\n }\n\n return paths\n },\n\n /**\n * Get the common ancestor path of two paths.\n */\n\n common(path: Path, another: Path): Path {\n const common: Path = []\n\n for (let i = 0; i < path.length && i < another.length; i++) {\n const av = path[i]\n const bv = another[i]\n\n if (av !== bv) {\n break\n }\n\n common.push(av)\n }\n\n return common\n },\n\n /**\n * Compare a path to another, returning an integer indicating whether the path\n * was before, at, or after the other.\n *\n * Note: Two paths of unequal length can still receive a `0` result if one is\n * directly above or below the other. If you want exact matching, use\n * [[Path.equals]] instead.\n */\n\n compare(path: Path, another: Path): -1 | 0 | 1 {\n const min = Math.min(path.length, another.length)\n\n for (let i = 0; i < min; i++) {\n if (path[i] < another[i]) return -1\n if (path[i] > another[i]) return 1\n }\n\n return 0\n },\n\n /**\n * Check if a path ends after one of the indexes in another.\n */\n\n endsAfter(path: Path, another: Path): boolean {\n const i = path.length - 1\n const as = path.slice(0, i)\n const bs = another.slice(0, i)\n const av = path[i]\n const bv = another[i]\n return Path.equals(as, bs) && av > bv\n },\n\n /**\n * Check if a path ends at one of the indexes in another.\n */\n\n endsAt(path: Path, another: Path): boolean {\n const i = path.length\n const as = path.slice(0, i)\n const bs = another.slice(0, i)\n return Path.equals(as, bs)\n },\n\n /**\n * Check if a path ends before one of the indexes in another.\n */\n\n endsBefore(path: Path, another: Path): boolean {\n const i = path.length - 1\n const as = path.slice(0, i)\n const bs = another.slice(0, i)\n const av = path[i]\n const bv = another[i]\n return Path.equals(as, bs) && av < bv\n },\n\n /**\n * Check if a path is exactly equal to another.\n */\n\n equals(path: Path, another: Path): boolean {\n return (\n path.length === another.length && path.every((n, i) => n === another[i])\n )\n },\n\n /**\n * Check if a path is after another.\n */\n\n isAfter(path: Path, another: Path): boolean {\n return Path.compare(path, another) === 1\n },\n\n /**\n * Check if a path is an ancestor of another.\n */\n\n isAncestor(path: Path, another: Path): boolean {\n return path.length < another.length && Path.compare(path, another) === 0\n },\n\n /**\n * Check if a path is before another.\n */\n\n isBefore(path: Path, another: Path): boolean {\n return Path.compare(path, another) === -1\n },\n\n /**\n * Check if a path is a child of another.\n */\n\n isChild(path: Path, another: Path): boolean {\n return (\n path.length === another.length + 1 && Path.compare(path, another) === 0\n )\n },\n\n /**\n * Check if a path is equal to or an ancestor of another.\n */\n\n isCommon(path: Path, another: Path): boolean {\n return path.length <= another.length && Path.compare(path, another) === 0\n },\n\n /**\n * Check if a path is a descendant of another.\n */\n\n isDescendant(path: Path, another: Path): boolean {\n return path.length > another.length && Path.compare(path, another) === 0\n },\n\n /**\n * Check if a path is the parent of another.\n */\n\n isParent(path: Path, another: Path): boolean {\n return (\n path.length + 1 === another.length && Path.compare(path, another) === 0\n )\n },\n\n /**\n * Check is a value implements the `Path` interface.\n */\n\n isPath(value: any): value is Path {\n return (\n Array.isArray(value) &&\n (value.length === 0 || typeof value[0] === 'number')\n )\n },\n\n /**\n * Check if a path is a sibling of another.\n */\n\n isSibling(path: Path, another: Path): boolean {\n if (path.length !== another.length) {\n return false\n }\n\n const as = path.slice(0, -1)\n const bs = another.slice(0, -1)\n const al = path[path.length - 1]\n const bl = another[another.length - 1]\n return al !== bl && Path.equals(as, bs)\n },\n\n /**\n * Get a list of paths at every level down to a path. Note: this is the same\n * as `Path.ancestors`, but including the path itself.\n *\n * The paths are sorted from shallowest to deepest. However, if the `reverse:\n * true` option is passed, they are reversed.\n */\n\n levels(\n path: Path,\n options: {\n reverse?: boolean\n } = {}\n ): Path[] {\n const { reverse = false } = options\n const list: Path[] = []\n\n for (let i = 0; i <= path.length; i++) {\n list.push(path.slice(0, i))\n }\n\n if (reverse) {\n list.reverse()\n }\n\n return list\n },\n\n /**\n * Given a path, get the path to the next sibling node.\n */\n\n next(path: Path): Path {\n if (path.length === 0) {\n throw new Error(\n `Cannot get the next path of a root path [${path}], because it has no next index.`\n )\n }\n\n const last = path[path.length - 1]\n return path.slice(0, -1).concat(last + 1)\n },\n\n /**\n * Given a path, return a new path referring to the parent node above it.\n */\n\n parent(path: Path): Path {\n if (path.length === 0) {\n throw new Error(`Cannot get the parent path of the root path [${path}].`)\n }\n\n return path.slice(0, -1)\n },\n\n /**\n * Given a path, get the path to the previous sibling node.\n */\n\n previous(path: Path): Path {\n if (path.length === 0) {\n throw new Error(\n `Cannot get the previous path of a root path [${path}], because it has no previous index.`\n )\n }\n\n const last = path[path.length - 1]\n\n if (last <= 0) {\n throw new Error(\n `Cannot get the previous path of a first child path [${path}] because it would result in a negative index.`\n )\n }\n\n return path.slice(0, -1).concat(last - 1)\n },\n\n /**\n * Get a path relative to an ancestor.\n */\n\n relative(path: Path, ancestor: Path): Path {\n if (!Path.isAncestor(ancestor, path) && !Path.equals(path, ancestor)) {\n throw new Error(\n `Cannot get the relative path of [${path}] inside ancestor [${ancestor}], because it is not above or equal to the path.`\n )\n }\n\n return path.slice(ancestor.length)\n },\n\n /**\n * Transform a path by an operation.\n */\n\n transform(\n path: Path,\n operation: Operation,\n options: { affinity?: 'forward' | 'backward' | null } = {}\n ): Path | null {\n return produce(path, p => {\n const { affinity = 'forward' } = options\n\n // PERF: Exit early if the operation is guaranteed not to have an effect.\n if (path.length === 0) {\n return\n }\n\n switch (operation.type) {\n case 'insert_node': {\n const { path: op } = operation\n\n if (\n Path.equals(op, p) ||\n Path.endsBefore(op, p) ||\n Path.isAncestor(op, p)\n ) {\n p[op.length - 1] += 1\n }\n\n break\n }\n\n case 'remove_node': {\n const { path: op } = operation\n\n if (Path.equals(op, p) || Path.isAncestor(op, p)) {\n return null\n } else if (Path.endsBefore(op, p)) {\n p[op.length - 1] -= 1\n }\n\n break\n }\n\n case 'merge_node': {\n const { path: op, position } = operation\n\n if (Path.equals(op, p) || Path.endsBefore(op, p)) {\n p[op.length - 1] -= 1\n } else if (Path.isAncestor(op, p)) {\n p[op.length - 1] -= 1\n p[op.length] += position\n }\n\n break\n }\n\n case 'split_node': {\n const { path: op, position } = operation\n\n if (Path.equals(op, p)) {\n if (affinity === 'forward') {\n p[p.length - 1] += 1\n } else if (affinity === 'backward') {\n // Nothing, because it still refers to the right path.\n } else {\n return null\n }\n } else if (Path.endsBefore(op, p)) {\n p[op.length - 1] += 1\n } else if (Path.isAncestor(op, p) && path[op.length] >= position) {\n p[op.length - 1] += 1\n p[op.length] -= position\n }\n\n break\n }\n\n case 'move_node': {\n const { path: op, newPath: onp } = operation\n\n // If the old and new path are the same, it's a no-op.\n if (Path.equals(op, onp)) {\n return\n }\n\n if (Path.isAncestor(op, p) || Path.equals(op, p)) {\n const copy = onp.slice()\n\n if (Path.endsBefore(op, onp) && op.length < onp.length) {\n const i = Math.min(onp.length, op.length) - 1\n copy[i] -= 1\n }\n\n return copy.concat(p.slice(op.length))\n } else if (\n Path.endsBefore(onp, p) ||\n Path.equals(onp, p) ||\n Path.isAncestor(onp, p)\n ) {\n if (Path.endsBefore(op, p)) {\n p[op.length - 1] -= 1\n }\n\n p[onp.length - 1] += 1\n } else if (Path.endsBefore(op, p)) {\n if (Path.equals(onp, p)) {\n p[onp.length - 1] += 1\n }\n\n p[op.length - 1] -= 1\n }\n\n break\n }\n }\n })\n },\n}\n","import { Operation, Path } from '..'\n\n/**\n * `PathRef` objects keep a specific path in a document synced over time as new\n * operations are applied to the editor. You can access their `current` property\n * at any time for the up-to-date path value.\n */\n\nexport interface PathRef {\n current: Path | null\n affinity: 'forward' | 'backward' | null\n unref(): Path | null\n}\n\nexport const PathRef = {\n /**\n * Transform the path ref's current value by an operation.\n */\n\n transform(ref: PathRef, op: Operation): void {\n const { current, affinity } = ref\n\n if (current == null) {\n return\n }\n\n const path = Path.transform(current, op, { affinity })\n ref.current = path\n\n if (path == null) {\n ref.unref()\n }\n },\n}\n","import isPlainObject from 'is-plain-object'\nimport { produce } from 'immer'\nimport { Operation, Path } from '..'\n\n/**\n * `Point` objects refer to a specific location in a text node in a Slate\n * document. Its path refers to the location of the node in the tree, and its\n * offset refers to the distance into the node's string of text. Points can\n * only refer to `Text` nodes.\n */\n\nexport interface Point {\n path: Path\n offset: number\n [key: string]: any\n}\n\nexport const Point = {\n /**\n * Compare a point to another, returning an integer indicating whether the\n * point was before, at, or after the other.\n */\n\n compare(point: Point, another: Point): -1 | 0 | 1 {\n const result = Path.compare(point.path, another.path)\n\n if (result === 0) {\n if (point.offset < another.offset) return -1\n if (point.offset > another.offset) return 1\n return 0\n }\n\n return result\n },\n\n /**\n * Check if a point is after another.\n */\n\n isAfter(point: Point, another: Point): boolean {\n return Point.compare(point, another) === 1\n },\n\n /**\n * Check if a point is before another.\n */\n\n isBefore(point: Point, another: Point): boolean {\n return Point.compare(point, another) === -1\n },\n\n /**\n * Check if a point is exactly equal to another.\n */\n\n equals(point: Point, another: Point): boolean {\n // PERF: ensure the offsets are equal first since they are cheaper to check.\n return (\n point.offset === another.offset && Path.equals(point.path, another.path)\n )\n },\n\n /**\n * Check if a value implements the `Point` interface.\n */\n\n isPoint(value: any): value is Point {\n return (\n isPlainObject(value) &&\n typeof value.offset === 'number' &&\n Path.isPath(value.path)\n )\n },\n\n /**\n * Transform a point by an operation.\n */\n\n transform(\n point: Point,\n op: Operation,\n options: { affinity?: 'forward' | 'backward' | null } = {}\n ): Point | null {\n return produce(point, p => {\n const { affinity = 'forward' } = options\n const { path, offset } = p\n\n switch (op.type) {\n case 'insert_node':\n case 'move_node': {\n p.path = Path.transform(path, op, options)!\n break\n }\n\n case 'insert_text': {\n if (Path.equals(op.path, path) && op.offset <= offset) {\n p.offset += op.text.length\n }\n\n break\n }\n\n case 'merge_node': {\n if (Path.equals(op.path, path)) {\n p.offset += op.position\n }\n\n p.path = Path.transform(path, op, options)!\n break\n }\n\n case 'remove_text': {\n if (Path.equals(op.path, path) && op.offset <= offset) {\n p.offset -= Math.min(offset - op.offset, op.text.length)\n }\n\n break\n }\n\n case 'remove_node': {\n if (Path.equals(op.path, path) || Path.isAncestor(op.path, path)) {\n return null\n }\n\n p.path = Path.transform(path, op, options)!\n break\n }\n\n case 'split_node': {\n if (Path.equals(op.path, path)) {\n if (op.position === offset && affinity == null) {\n return null\n } else if (\n op.position < offset ||\n (op.position === offset && affinity === 'forward')\n ) {\n p.offset -= op.position\n\n p.path = Path.transform(path, op, {\n ...options,\n affinity: 'forward',\n })!\n }\n } else {\n p.path = Path.transform(path, op, options)!\n }\n\n break\n }\n }\n })\n },\n}\n\n/**\n * `PointEntry` objects are returned when iterating over `Point` objects that\n * belong to a range.\n */\n\nexport type PointEntry = [Point, 'anchor' | 'focus']\n","import { Operation, Point } from '..'\n\n/**\n * `PointRef` objects keep a specific point in a document synced over time as new\n * operations are applied to the editor. You can access their `current` property\n * at any time for the up-to-date point value.\n */\n\nexport interface PointRef {\n current: Point | null\n affinity: 'forward' | 'backward' | null\n unref(): Point | null\n}\n\nexport const PointRef = {\n /**\n * Transform the point ref's current value by an operation.\n */\n\n transform(ref: PointRef, op: Operation): void {\n const { current, affinity } = ref\n\n if (current == null) {\n return\n }\n\n const point = Point.transform(current, op, { affinity })\n ref.current = point\n\n if (point == null) {\n ref.unref()\n }\n },\n}\n","import { produce } from 'immer'\nimport isPlainObject from 'is-plain-object'\nimport { Operation, Path, Point, PointEntry } from '..'\n\n/**\n * `Range` objects are a set of points that refer to a specific span of a Slate\n * document. They can define a span inside a single node or a can span across\n * multiple nodes.\n */\n\nexport interface Range {\n anchor: Point\n focus: Point\n [key: string]: any\n}\n\nexport const Range = {\n /**\n * Get the start and end points of a range, in the order in which they appear\n * in the document.\n */\n\n edges(\n range: Range,\n options: {\n reverse?: boolean\n } = {}\n ): [Point, Point] {\n const { reverse = false } = options\n const { anchor, focus } = range\n return Range.isBackward(range) === reverse\n ? [anchor, focus]\n : [focus, anchor]\n },\n\n /**\n * Get the end point of a range.\n */\n\n end(range: Range): Point {\n const [, end] = Range.edges(range)\n return end\n },\n\n /**\n * Check if a range is exactly equal to another.\n */\n\n equals(range: Range, another: Range): boolean {\n return (\n Point.equals(range.anchor, another.anchor) &&\n Point.equals(range.focus, another.focus)\n )\n },\n\n /**\n * Check if a range includes a path, a point or part of another range.\n */\n\n includes(range: Range, target: Path | Point | Range): boolean {\n if (Range.isRange(target)) {\n if (\n Range.includes(range, target.anchor) ||\n Range.includes(range, target.focus)\n ) {\n return true\n }\n\n const [rs, re] = Range.edges(range)\n const [ts, te] = Range.edges(target)\n return Point.isBefore(rs, ts) && Point.isAfter(re, te)\n }\n\n const [start, end] = Range.edges(range)\n let isAfterStart = false\n let isBeforeEnd = false\n\n if (Point.isPoint(target)) {\n isAfterStart = Point.compare(target, start) >= 0\n isBeforeEnd = Point.compare(target, end) <= 0\n } else {\n isAfterStart = Path.compare(target, start.path) >= 0\n isBeforeEnd = Path.compare(target, end.path) <= 0\n }\n\n return isAfterStart && isBeforeEnd\n },\n\n /**\n * Get the intersection of a range with another.\n */\n\n intersection(range: Range, another: Range): Range | null {\n const { anchor, focus, ...rest } = range\n const [s1, e1] = Range.edges(range)\n const [s2, e2] = Range.edges(another)\n const start = Point.isBefore(s1, s2) ? s2 : s1\n const end = Point.isBefore(e1, e2) ? e1 : e2\n\n if (Point.isBefore(end, start)) {\n return null\n } else {\n return { anchor: start, focus: end, ...rest }\n }\n },\n\n /**\n * Check if a range is backward, meaning that its anchor point appears in the\n * document _after_ its focus point.\n */\n\n isBackward(range: Range): boolean {\n const { anchor, focus } = range\n return Point.isAfter(anchor, focus)\n },\n\n /**\n * Check if a range is collapsed, meaning that both its anchor and focus\n * points refer to the exact same position in the document.\n */\n\n isCollapsed(range: Range): boolean {\n const { anchor, focus } = range\n return Point.equals(anchor, focus)\n },\n\n /**\n * Check if a range is expanded.\n *\n * This is the opposite of [[Range.isCollapsed]] and is provided for legibility.\n */\n\n isExpanded(range: Range): boolean {\n return !Range.isCollapsed(range)\n },\n\n /**\n * Check if a range is forward.\n *\n * This is the opposite of [[Range.isBackward]] and is provided for legibility.\n */\n\n isForward(range: Range): boolean {\n return !Range.isBackward(range)\n },\n\n /**\n * Check if a value implements the [[Range]] interface.\n */\n\n isRange(value: any): value is Range {\n return (\n isPlainObject(value) &&\n Point.isPoint(value.anchor) &&\n Point.isPoint(value.focus)\n )\n },\n\n /**\n * Iterate through all of the point entries in a range.\n */\n\n *points(range: Range): Iterable<PointEntry> {\n yield [range.anchor, 'anchor']\n yield [range.focus, 'focus']\n },\n\n /**\n * Get the start point of a range.\n */\n\n start(range: Range): Point {\n const [start] = Range.edges(range)\n return start\n },\n\n /**\n * Transform a range by an operation.\n */\n\n transform(\n range: Range,\n op: Operation,\n options: { affinity: 'forward' | 'backward' | 'outward' | 'inward' | null }\n ): Range | null {\n const { affinity = 'inward' } = options\n let affinityAnchor: 'forward' | 'backward' | null\n let affinityFocus: 'forward' | 'backward' | null\n\n if (affinity === 'inward') {\n if (Range.isForward(range)) {\n affinityAnchor = 'forward'\n affinityFocus = 'backward'\n } else {\n affinityAnchor = 'backward'\n affinityFocus = 'forward'\n }\n } else if (affinity === 'outward') {\n if (Range.isForward(range)) {\n affinityAnchor = 'backward'\n affinityFocus = 'forward'\n } else {\n affinityAnchor = 'forward'\n affinityFocus = 'backward'\n }\n } else {\n affinityAnchor = affinity\n affinityFocus = affinity\n }\n\n return produce(range, r => {\n const anchor = Point.transform(r.anchor, op, { affinity: affinityAnchor })\n const focus = Point.transform(r.focus, op, { affinity: affinityFocus })\n\n if (!anchor || !focus) {\n return null\n }\n\n r.anchor = anchor\n r.focus = focus\n })\n },\n}\n","import { Operation, Range } from '..'\n\n/**\n * `RangeRef` objects keep a specific range in a document synced over time as new\n * operations are applied to the editor. You can access their `current` property\n * at any time for the up-to-date range value.\n */\n\nexport interface RangeRef {\n current: Range | null\n affinity: 'forward' | 'backward' | 'outward' | 'inward' | null\n unref(): Range | null\n}\n\nexport const RangeRef = {\n /**\n * Transform the range ref's current value by an operation.\n */\n\n transform(ref: RangeRef, op: Operation): void {\n const { current, affinity } = ref\n\n if (current == null) {\n return\n }\n\n const path = Range.transform(current, op, { affinity })\n ref.current = path\n\n if (path == null) {\n ref.unref()\n }\n },\n}\n","import isPlainObject from 'is-plain-object'\nimport { Range } from '..'\n\n/**\n * `Text` objects represent the nodes that contain the actual text content of a\n * Slate document along with any formatting properties. They are always leaf\n * nodes in the document tree as they cannot contain any children.\n */\n\nexport interface Text {\n text: string\n [key: string]: any\n}\n\nexport const Text = {\n /**\n * Check if two text nodes are equal.\n */\n\n equals(\n text: Text,\n another: Text,\n options: { loose?: boolean } = {}\n ): boolean {\n const { loose = false } = options\n\n for (const key in text) {\n if (loose && key === 'text') {\n continue\n }\n\n if (text[key] !== another[key]) {\n return false\n }\n }\n\n for (const key in another) {\n if (loose && key === 'text') {\n continue\n }\n\n if (text[key] !== another[key]) {\n return false\n }\n }\n\n return true\n },\n\n /**\n * Check if a value implements the `Text` interface.\n */\n\n isText(value: any): value is Text {\n return isPlainObject(value) && typeof value.text === 'string'\n },\n\n /**\n * Check if a value is a list of `Text` objects.\n */\n\n isTextList(value: any): value is Text[] {\n return Array.isArray(value) && (value.length === 0 || Text.isText(value[0]))\n },\n\n /**\n * Check if an text matches set of properties.\n *\n * Note: this is for matching custom properties, and it does not ensure that\n * the `text` property are two nodes equal.\n */\n\n matches(text: Text, props: Partial<Text>): boolean {\n for (const key in props) {\n if (key === 'text') {\n continue\n }\n\n if (text[key] !== props[key]) {\n return false\n }\n }\n\n return true\n },\n\n /**\n * Get the leaves for a text node given decorations.\n */\n\n decorations(node: Text, decorations: Range[]): Text[] {\n let leaves: Text[] = [{ ...node }]\n\n for (const dec of decorations) {\n const { anchor, focus, ...rest } = dec\n const [start, end] = Range.edges(dec)\n const next = []\n let o = 0\n\n for (const leaf of leaves) {\n const { length } = leaf.text\n const offset = o\n o += length\n\n // If the range encompases the entire leaf, add the range.\n if (start.offset <= offset && end.offset >= offset + length) {\n Object.assign(leaf, rest)\n next.push(leaf)\n continue\n }\n\n // If the range starts after the leaf, or ends before it, continue.\n if (\n start.offset > offset + length ||\n end.offset < offset ||\n (end.offset === offset && offset !== 0)\n ) {\n next.push(leaf)\n continue\n }\n\n // Otherwise we need to split the leaf, at the start, end, or both,\n // and add the range to the middle intersecting section. Do the end\n // split first since we don't need to update the offset that way.\n let middle = leaf\n let before\n let after\n\n if (end.offset < offset + length) {\n const off = end.offset - offset\n after = { ...middle, text: middle.text.slice(off) }\n middle = { ...middle, text: middle.text.slice(0, off) }\n }\n\n if (start.offset > offset) {\n const off = start.offset - offset\n before = { ...middle, text: middle.text.slice(0, off) }\n middle = { ...middle, text: middle.text.slice(off) }\n }\n\n Object.assign(middle, rest)\n\n if (before) {\n next.push(before)\n }\n\n next.push(middle)\n\n if (after) {\n next.push(after)\n }\n }\n\n leaves = next\n }\n\n return leaves\n },\n}\n","import { createDraft, finishDraft, isDraft } from 'immer'\nimport {\n Node,\n Editor,\n Range,\n Point,\n Text,\n Element,\n Operation,\n Descendant,\n NodeEntry,\n Path,\n Transforms,\n} from '..'\n\nexport const GeneralTransforms = {\n /**\n * Transform the editor by an operation.\n */\n\n transform(editor: Editor, op: Operation) {\n editor.children = createDraft(editor.children)\n let selection = editor.selection && createDraft(editor.selection)\n\n switch (op.type) {\n case 'insert_node': {\n const { path, node } = op\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n parent.children.splice(index, 0, node)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'insert_text': {\n const { path, offset, text } = op\n const node = Node.leaf(editor, path)\n const before = node.text.slice(0, offset)\n const after = node.text.slice(offset)\n node.text = before + text + after\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'merge_node': {\n const { path } = op\n const node = Node.get(editor, path)\n const prevPath = Path.previous(path)\n const prev = Node.get(editor, prevPath)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n\n if (Text.isText(node) && Text.isText(prev)) {\n prev.text += node.text\n } else if (!Text.isText(node) && !Text.isText(prev)) {\n prev.children.push(...node.children)\n } else {\n throw new Error(\n `Cannot apply a \"merge_node\" operation at path [${path}] to nodes of different interaces: ${node} ${prev}`\n )\n }\n\n parent.children.splice(index, 1)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'move_node': {\n const { path, newPath } = op\n\n if (Path.isAncestor(path, newPath)) {\n throw new Error(\n `Cannot move a path [${path}] to new path [${newPath}] because the destination is inside itself.`\n )\n }\n\n const node = Node.get(editor, path)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n\n // This is tricky, but since the `path` and `newPath` both refer to\n // the same snapshot in time, there's a mismatch. After either\n // removing the original position, the second step's path can be out\n // of date. So instead of using the `op.newPath` directly, we\n // transform `op.path` to ascertain what the `newPath` would be after\n // the operation was applied.\n parent.children.splice(index, 1)\n const truePath = Path.transform(path, op)!\n const newParent = Node.get(editor, Path.parent(truePath))\n const newIndex = truePath[truePath.length - 1]\n\n newParent.children.splice(newIndex, 0, node)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'remove_node': {\n const { path } = op\n const index = path[path.length - 1]\n const parent = Node.parent(editor, path)\n parent.children.splice(index, 1)\n\n // Transform all of the points in the value, but if the point was in the\n // node that was removed we need to update the range or remove it.\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n const result = Point.transform(point, op)\n\n if (selection != null && result != null) {\n selection[key] = result\n } else {\n let prev: NodeEntry<Text> | undefined\n let next: NodeEntry<Text> | undefined\n\n for (const [n, p] of Node.texts(editor)) {\n if (Path.compare(p, path) === -1) {\n prev = [n, p]\n } else {\n next = [n, p]\n break\n }\n }\n\n if (prev) {\n point.path = prev[1]\n point.offset = prev[0].text.length\n } else if (next) {\n point.path = next[1]\n point.offset = 0\n } else {\n selection = null\n }\n }\n }\n }\n\n break\n }\n\n case 'remove_text': {\n const { path, offset, text } = op\n const node = Node.leaf(editor, path)\n const before = node.text.slice(0, offset)\n const after = node.text.slice(offset + text.length)\n node.text = before + after\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'set_node': {\n const { path, newProperties } = op\n\n if (path.length === 0) {\n throw new Error(`Cannot set properties on the root node!`)\n }\n\n const node = Node.get(editor, path)\n\n for (const key in newProperties) {\n if (key === 'children' || key === 'text') {\n throw new Error(`Cannot set the \"${key}\" property of nodes!`)\n }\n\n const value = newProperties[key]\n\n if (value == null) {\n delete node[key]\n } else {\n node[key] = value\n }\n }\n\n break\n }\n\n case 'set_selection': {\n const { newProperties } = op\n\n if (newProperties == null) {\n selection = newProperties\n } else if (selection == null) {\n if (!Range.isRange(newProperties)) {\n throw new Error(\n `Cannot apply an incomplete \"set_selection\" operation properties ${JSON.stringify(\n newProperties\n )} when there is no current selection.`\n )\n }\n\n selection = newProperties\n } else {\n Object.assign(selection, newProperties)\n }\n\n break\n }\n\n case 'split_node': {\n const { path, position, properties } = op\n\n if (path.length === 0) {\n throw new Error(\n `Cannot apply a \"split_node\" operation at path [${path}] because the root node cannot be split.`\n )\n }\n\n const node = Node.get(editor, path)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n let newNode: Descendant\n\n if (Text.isText(node)) {\n const before = node.text.slice(0, position)\n const after = node.text.slice(position)\n node.text = before\n newNode = {\n ...node,\n ...(properties as Partial<Text>),\n text: after,\n }\n } else {\n const before = node.children.slice(0, position)\n const after = node.children.slice(position)\n node.children = before\n\n newNode = {\n ...node,\n ...(properties as Partial<Element>),\n children: after,\n }\n }\n\n parent.children.splice(index + 1, 0, newNode)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n }\n\n editor.children = finishDraft(editor.children) as Node[]\n\n if (selection) {\n editor.selection = isDraft(selection)\n ? (finishDraft(selection) as Range)\n : selection\n } else {\n editor.selection = null\n }\n },\n}\n","import {\n Editor,\n Element,\n Location,\n Node,\n Path,\n Point,\n Range,\n Text,\n Transforms,\n} from '..'\n\nexport const NodeTransforms = {\n /**\n * Insert nodes at a specific location in the Editor.\n */\n\n insertNodes(\n editor: Editor,\n nodes: Node | Node[],\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'highest' | 'lowest'\n hanging?: boolean\n select?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { hanging = false, voids = false, mode = 'lowest' } = options\n let { at, match, select } = options\n\n if (Node.isNode(nodes)) {\n nodes = [nodes]\n }\n\n if (nodes.length === 0) {\n return\n }\n\n const [node] = nodes\n\n // By default, use the selection as the target location. But if there is\n // no selection, insert at the end of the document since that is such a\n // common use case when inserting from a non-selected state.\n if (!at) {\n if (editor.selection) {\n at = editor.selection\n } else if (editor.children.length > 0) {\n at = Editor.end(editor, [])\n } else {\n at = [0]\n }\n\n select = true\n }\n\n if (select == null) {\n select = false\n }\n\n if (Range.isRange(at)) {\n if (!hanging) {\n at = Editor.unhangRange(editor, at)\n }\n\n if (Range.isCollapsed(at)) {\n at = at.anchor\n } else {\n const [, end] = Range.edges(at)\n const pointRef = Editor.pointRef(editor, end)\n Transforms.delete(editor, { at })\n at = pointRef.unref()!\n }\n }\n\n if (Point.isPoint(at)) {\n if (match == null) {\n if (Text.isText(node)) {\n match = n => Text.isText(n)\n } else if (editor.isInline(node)) {\n match = n => Text.isText(n) || Editor.isInline(editor, n)\n } else {\n match = n => Editor.isBlock(editor, n)\n }\n }\n\n const [entry] = Editor.nodes(editor, {\n at: at.path,\n match,\n mode,\n voids,\n })\n\n if (entry) {\n const [, matchPath] = entry\n const pathRef = Editor.pathRef(editor, matchPath)\n const isAtEnd = Editor.isEnd(editor, at, matchPath)\n Transforms.splitNodes(editor, { at, match, mode, voids })\n const path = pathRef.unref()!\n at = isAtEnd ? Path.next(path) : path\n } else {\n return\n }\n }\n\n const parentPath = Path.parent(at)\n let index = at[at.length - 1]\n\n if (!voids && Editor.void(editor, { at: parentPath })) {\n return\n }\n\n for (const node of nodes) {\n const path = parentPath.concat(index)\n index++\n editor.apply({ type: 'insert_node', path, node })\n }\n\n if (select) {\n const point = Editor.end(editor, at)\n\n if (point) {\n Transforms.select(editor, point)\n }\n }\n })\n },\n\n /**\n * Lift nodes at a specific location upwards in the document tree, splitting\n * their parent in two if necessary.\n */\n\n liftNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { at = editor.selection, mode = 'lowest', voids = false } = options\n let { match } = options\n\n if (match == null) {\n match = Path.isPath(at)\n ? matchPath(editor, at)\n : n => Editor.isBlock(editor, n)\n }\n\n if (!at) {\n return\n }\n\n const matches = Editor.nodes(editor, { at, match, mode, voids })\n const pathRefs = Array.from(matches, ([, p]) => Editor.pathRef(editor, p))\n\n for (const pathRef of pathRefs) {\n const path = pathRef.unref()!\n\n if (path.length < 2) {\n throw new Error(\n `Cannot lift node at a path [${path}] because it has a depth of less than \\`2\\`.`\n )\n }\n\n const [parent, parentPath] = Editor.node(editor, Path.parent(path))\n const index = path[path.length - 1]\n const { length } = parent.children\n\n if (length === 1) {\n const toPath = Path.next(parentPath)\n Transforms.moveNodes(editor, { at: path, to: toPath, voids })\n Transforms.removeNodes(editor, { at: parentPath, voids })\n } else if (index === 0) {\n Transforms.moveNodes(editor, { at: path, to: parentPath, voids })\n } else if (index === length - 1) {\n const toPath = Path.next(parentPath)\n Transforms.moveNodes(editor, { at: path, to: toPath, voids })\n } else {\n const splitPath = Path.next(path)\n const toPath = Path.next(parentPath)\n Transforms.splitNodes(editor, { at: splitPath, voids })\n Transforms.moveNodes(editor, { at: path, to: toPath, voids })\n }\n }\n })\n },\n\n /**\n * Merge a node at a location with the previous node of the same depth,\n * removing any empty containing nodes after the merge if necessary.\n */\n\n mergeNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'highest' | 'lowest'\n hanging?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n let { match, at = editor.selection } = options\n const { hanging = false, voids = false, mode = 'lowest' } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n if (Path.isPath(at)) {\n const [parent] = Editor.parent(editor, at)\n match = n => parent.children.includes(n)\n } else {\n match = n => Editor.isBlock(editor, n)\n }\n }\n\n if (!hanging && Range.isRange(at)) {\n at = Editor.unhangRange(editor, at)\n }\n\n if (Range.isRange(at)) {\n if (Range.isCollapsed(at)) {\n at = at.anchor\n } else {\n const [, end] = Range.edges(at)\n const pointRef = Editor.pointRef(editor, end)\n Transforms.delete(editor, { at })\n at = pointRef.unref()!\n\n if (options.at == null) {\n Transforms.select(editor, at)\n }\n }\n }\n\n const [current] = Editor.nodes(editor, { at, match, voids, mode })\n const prev = Editor.previous(editor, { at, match, voids, mode })\n\n if (!current || !prev) {\n return\n }\n\n const [node, path] = current\n const [prevNode, prevPath] = prev\n\n if (path.length === 0 || prevPath.length === 0) {\n return\n }\n\n const newPath = Path.next(prevPath)\n const commonPath = Path.common(path, prevPath)\n const isPreviousSibling = Path.isSibling(path, prevPath)\n const levels = Array.from(Editor.levels(editor, { at: path }), ([n]) => n)\n .slice(commonPath.length)\n .slice(0, -1)\n\n // Determine if the merge will leave an ancestor of the path empty as a\n // result, in which case we'll want to remove it after merging.\n const emptyAncestor = Editor.above(editor, {\n at: path,\n mode: 'highest',\n match: n =>\n levels.includes(n) && Element.isElement(n) && n.children.length === 1,\n })\n\n const emptyRef = emptyAncestor && Editor.pathRef(editor, emptyAncestor[1])\n let properties\n let position\n\n // Ensure that the nodes are equivalent, and figure out what the position\n // and extra properties of the merge will be.\n if (Text.isText(node) && Text.isText(prevNode)) {\n const { text, ...rest } = node\n position = prevNode.text.length\n properties = rest as Partial<Text>\n } else if (Element.isElement(node) && Element.isElement(prevNode)) {\n const { children, ...rest } = node\n position = prevNode.children.length\n properties = rest as Partial<Element>\n } else {\n throw new Error(\n `Cannot merge the node at path [${path}] with the previous sibling because it is not the same kind: ${JSON.stringify(\n node\n )} ${JSON.stringify(prevNode)}`\n )\n }\n\n // If the node isn't already the next sibling of the previous node, move\n // it so that it is before merging.\n if (!isPreviousSibling) {\n Transforms.moveNodes(editor, { at: path, to: newPath, voids })\n }\n\n // If there was going to be an empty ancestor of the node that was merged,\n // we remove it from the tree.\n if (emptyRef) {\n Transforms.removeNodes(editor, { at: emptyRef.current!, voids })\n }\n\n // If the target node that we're merging with is empty, remove it instead\n // of merging the two. This is a common rich text editor behavior to\n // prevent losing formatting when deleting entire nodes when you have a\n // hanging selection.\n if (\n (Element.isElement(prevNode) && Editor.isEmpty(editor, prevNode)) ||\n (Text.isText(prevNode) && prevNode.text === '')\n ) {\n Transforms.removeNodes(editor, { at: prevPath, voids })\n } else {\n editor.apply({\n type: 'merge_node',\n path: newPath,\n position,\n target: null,\n properties,\n })\n }\n\n if (emptyRef) {\n emptyRef.unref()\n }\n })\n },\n\n /**\n * Move the nodes at a location to a new location.\n */\n\n moveNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n to: Path\n voids?: boolean\n }\n ) {\n Editor.withoutNormalizing(editor, () => {\n const {\n to,\n at = editor.selection,\n mode = 'lowest',\n voids = false,\n } = options\n let { match } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n match = Path.isPath(at)\n ? matchPath(editor, at)\n : n => Editor.isBlock(editor, n)\n }\n\n const toRef = Editor.pathRef(editor, to)\n const targets = Editor.nodes(editor, { at, match, mode, voids })\n const pathRefs = Array.from(targets, ([, p]) => Editor.pathRef(editor, p))\n\n for (const pathRef of pathRefs) {\n const path = pathRef.unref()!\n const newPath = toRef.current!\n\n if (path.length !== 0) {\n editor.apply({ type: 'move_node', path, newPath })\n }\n }\n\n toRef.unref()\n })\n },\n\n /**\n * Remove the nodes at a specific location in the document.\n */\n\n removeNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'highest' | 'lowest'\n hanging?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { hanging = false, voids = false, mode = 'lowest' } = options\n let { at = editor.selection, match } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n match = Path.isPath(at)\n ? matchPath(editor, at)\n : n => Editor.isBlock(editor, n)\n }\n\n if (!hanging && Range.isRange(at)) {\n at = Editor.unhangRange(editor, at)\n }\n\n const depths = Editor.nodes(editor, { at, match, mode, voids })\n const pathRefs = Array.from(depths, ([, p]) => Editor.pathRef(editor, p))\n\n for (const pathRef of pathRefs) {\n const path = pathRef.unref()!\n\n if (path) {\n const [node] = Editor.node(editor, path)\n editor.apply({ type: 'remove_node', path, node })\n }\n }\n })\n },\n\n /**\n * Set new properties on the nodes at a location.\n */\n\n setNodes(\n editor: Editor,\n props: Partial<Node>,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n hanging?: boolean\n split?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n let { match, at = editor.selection } = options\n const {\n hanging = false,\n mode = 'lowest',\n split = false,\n voids = false,\n } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n match = Path.isPath(at)\n ? matchPath(editor, at)\n : n => Editor.isBlock(editor, n)\n }\n\n if (!hanging && Range.isRange(at)) {\n at = Editor.unhangRange(editor, at)\n }\n\n if (split && Range.isRange(at)) {\n const rangeRef = Editor.rangeRef(editor, at, { affinity: 'inward' })\n const [start, end] = Range.edges(at)\n const splitMode = mode === 'lowest' ? 'lowest' : 'highest'\n Transforms.splitNodes(editor, {\n at: end,\n match,\n mode: splitMode,\n voids,\n })\n Transforms.splitNodes(editor, {\n at: start,\n match,\n mode: splitMode,\n voids,\n })\n at = rangeRef.unref()!\n\n if (options.at == null) {\n Transforms.select(editor, at)\n }\n }\n\n for (const [node, path] of Editor.nodes(editor, {\n at,\n match,\n mode,\n voids,\n })) {\n const properties: Partial<Node> = {}\n const newProperties: Partial<Node> = {}\n\n // You can't set properties on the editor node.\n if (path.length === 0) {\n continue\n }\n\n for (const k in props) {\n if (k === 'children' || k === 'text') {\n continue\n }\n\n if (props[k] !== node[k]) {\n properties[k] = node[k]\n newProperties[k] = props[k]\n }\n }\n\n if (Object.keys(newProperties).length !== 0) {\n editor.apply({\n type: 'set_node',\n path,\n properties,\n newProperties,\n })\n }\n }\n })\n },\n\n /**\n * Split the nodes at a specific location.\n */\n\n splitNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'highest' | 'lowest'\n always?: boolean\n height?: number\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { mode = 'lowest', voids = false } = options\n let { match, at = editor.selection, height = 0, always = false } = options\n\n if (match == null) {\n match = n => Editor.isBlock(editor, n)\n }\n\n if (Range.isRange(at)) {\n at = deleteRange(editor, at)\n }\n\n // If the target is a path, the default height-skipping and position\n // counters need to account for us potentially splitting at a non-leaf.\n if (Path.isPath(at)) {\n const path = at\n const point = Editor.point(editor, path)\n const [parent] = Editor.parent(editor, path)\n match = n => n === parent\n height = point.path.length - path.length + 1\n at = point\n always = true\n }\n\n if (!at) {\n return\n }\n\n const beforeRef = Editor.pointRef(editor, at, {\n affinity: 'backward',\n })\n const [highest] = Editor.nodes(editor, { at, match, mode, voids })\n\n if (!highest) {\n return\n }\n\n const voidMatch = Editor.void(editor, { at, mode: 'highest' })\n const nudge = 0\n\n if (!voids && voidMatch) {\n const [voidNode, voidPath] = voidMatch\n\n if (Element.isElement(voidNode) && editor.isInline(voidNode)) {\n let after = Editor.after(editor, voidPath)\n\n if (!after) {\n const text = { text: '' }\n const afterPath = Path.next(voidPath)\n Transforms.insertNodes(editor, text, { at: afterPath, voids })\n after = Editor.point(editor, afterPath)!\n }\n\n at = after\n always = true\n }\n\n const siblingHeight = at.path.length - voidPath.length\n height = siblingHeight + 1\n always = true\n }\n\n const afterRef = Editor.pointRef(editor, at)\n const depth = at.path.length - height\n const [, highestPath] = highest\n const lowestPath = at.path.slice(0, depth)\n let position = height === 0 ? at.offset : at.path[depth] + nudge\n let target: number | null = null\n\n for (const [node, path] of Editor.levels(editor, {\n at: lowestPath,\n reverse: true,\n voids,\n })) {\n let split = false\n\n if (\n path.length < highestPath.length ||\n path.length === 0 ||\n (!voids && Editor.isVoid(editor, node))\n ) {\n break\n }\n\n const point = beforeRef.current!\n const isEnd = Editor.isEnd(editor, point, path)\n\n if (always || !beforeRef || !Editor.isEdge(editor, point, path)) {\n split = true\n const { text, children, ...properties } = node\n editor.apply({\n type: 'split_node',\n path,\n position,\n target,\n properties,\n })\n }\n\n target = position\n position = path[path.length - 1] + (split || isEnd ? 1 : 0)\n }\n\n if (options.at == null) {\n const point = afterRef.current || Editor.end(editor, [])\n Transforms.select(editor, point)\n }\n\n beforeRef.unref()\n afterRef.unref()\n })\n },\n\n /**\n * Unset properties on the nodes at a location.\n */\n\n unsetNodes(\n editor: Editor,\n props: string | string[],\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n split?: boolean\n voids?: boolean\n } = {}\n ) {\n if (!Array.isArray(props)) {\n props = [props]\n }\n\n const obj = {}\n\n for (const key of props) {\n obj[key] = null\n }\n\n Transforms.setNodes(editor, obj, options)\n },\n\n /**\n * Unwrap the nodes at a location from a parent node, splitting the parent if\n * necessary to ensure that only the content in the range is unwrapped.\n */\n\n unwrapNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n split?: boolean\n voids?: boolean\n }\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { mode = 'lowest', split = false, voids = false } = options\n let { at = editor.selection, match } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n match = Path.isPath(at)\n ? matchPath(editor, at)\n : n => Editor.isBlock(editor, n)\n }\n\n if (Path.isPath(at)) {\n at = Editor.range(editor, at)\n }\n\n const rangeRef = Range.isRange(at) ? Editor.rangeRef(editor, at) : null\n const matches = Editor.nodes(editor, { at, match, mode, voids })\n const pathRefs = Array.from(matches, ([, p]) => Editor.pathRef(editor, p))\n\n for (const pathRef of pathRefs) {\n const path = pathRef.unref()!\n const [node] = Editor.node(editor, path)\n let range = Editor.range(editor, path)\n\n if (split && rangeRef) {\n range = Range.intersection(rangeRef.current!, range)!\n }\n\n Transforms.liftNodes(editor, {\n at: range,\n match: n => node.children.includes(n),\n voids,\n })\n }\n\n if (rangeRef) {\n rangeRef.unref()\n }\n })\n },\n\n /**\n * Wrap the nodes at a location in a new container node, splitting the edges\n * of the range first to ensure that only the content in the range is wrapped.\n */\n\n wrapNodes(\n editor: Editor,\n element: Element,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n split?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { mode = 'lowest', split = false, voids = false } = options\n let { match, at = editor.selection } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n if (Path.isPath(at)) {\n match = matchPath(editor, at)\n } else if (editor.isInline(element)) {\n match = n => Editor.isInline(editor, n) || Text.isText(n)\n } else {\n match = n => Editor.isBlock(editor, n)\n }\n }\n\n if (split && Range.isRange(at)) {\n const [start, end] = Range.edges(at)\n const rangeRef = Editor.rangeRef(editor, at, {\n affinity: 'inward',\n })\n Transforms.splitNodes(editor, { at: end, match, voids })\n Transforms.splitNodes(editor, { at: start, match, voids })\n at = rangeRef.unref()!\n\n if (options.at == null) {\n Transforms.select(editor, at)\n }\n }\n\n const roots = Array.from(\n Editor.nodes(editor, {\n at,\n match: editor.isInline(element)\n ? n => Editor.isBlock(editor, n)\n : n => Editor.isEditor(n),\n mode: 'highest',\n voids,\n })\n )\n\n for (const [, rootPath] of roots) {\n const a = Range.isRange(at)\n ? Range.intersection(at, Editor.range(editor, rootPath))\n : at\n\n if (!a) {\n continue\n }\n\n const matches = Array.from(\n Editor.nodes(editor, { at: a, match, mode, voids })\n )\n\n if (matches.length > 0) {\n const [first] = matches\n const last = matches[matches.length - 1]\n const [, firstPath] = first\n const [, lastPath] = last\n const commonPath = Path.equals(firstPath, lastPath)\n ? Path.parent(firstPath)\n : Path.common(firstPath, lastPath)\n\n const range = Editor.range(editor, firstPath, lastPath)\n const [commonNode] = Editor.node(editor, commonPath)\n const depth = commonPath.length + 1\n const wrapperPath = Path.next(lastPath.slice(0, depth))\n const wrapper = { ...element, children: [] }\n Transforms.insertNodes(editor, wrapper, { at: wrapperPath, voids })\n\n Transforms.moveNodes(editor, {\n at: range,\n match: n => commonNode.children.includes(n),\n to: wrapperPath.concat(0),\n voids,\n })\n }\n }\n })\n },\n}\n\n/**\n * Convert a range into a point by deleting it's content.\n */\n\nconst deleteRange = (editor: Editor, range: Range): Point | null => {\n if (Range.isCollapsed(range)) {\n return range.anchor\n } else {\n const [, end] = Range.edges(range)\n const pointRef = Editor.pointRef(editor, end)\n Transforms.delete(editor, { at: range })\n return pointRef.unref()\n }\n}\n\nconst matchPath = (editor: Editor, path: Path): ((node: Node) => boolean) => {\n const [node] = Editor.node(editor, path)\n return n => n === node\n}\n","import { Editor, Location, Point, Range, Transforms } from '..'\n\nexport const SelectionTransforms = {\n /**\n * Collapse the selection.\n */\n\n collapse(\n editor: Editor,\n options: {\n edge?: 'anchor' | 'focus' | 'start' | 'end'\n } = {}\n ) {\n const { edge = 'anchor' } = options\n const { selection } = editor\n\n if (!selection) {\n return\n } else if (edge === 'anchor') {\n Transforms.select(editor, selection.anchor)\n } else if (edge === 'focus') {\n Transforms.select(editor, selection.focus)\n } else if (edge === 'start') {\n const [start] = Range.edges(selection)\n Transforms.select(editor, start)\n } else if (edge === 'end') {\n const [, end] = Range.edges(selection)\n Transforms.select(editor, end)\n }\n },\n\n /**\n * Unset the selection.\n */\n\n deselect(editor: Editor) {\n const { selection } = editor\n\n if (selection) {\n editor.apply({\n type: 'set_selection',\n properties: selection,\n newProperties: null,\n })\n }\n },\n\n /**\n * Move the selection's point forward or backward.\n */\n\n move(\n editor: Editor,\n options: {\n distance?: number\n unit?: 'offset' | 'character' | 'word' | 'line'\n reverse?: boolean\n edge?: 'anchor' | 'focus' | 'start' | 'end'\n } = {}\n ) {\n const { selection } = editor\n const { distance = 1, unit = 'character', reverse = false } = options\n let { edge = null } = options\n\n if (!selection) {\n return\n }\n\n if (edge === 'start') {\n edge = Range.isBackward(selection) ? 'focus' : 'anchor'\n }\n\n if (edge === 'end') {\n edge = Range.isBackward(selection) ? 'anchor' : 'focus'\n }\n\n const { anchor, focus } = selection\n const opts = { distance, unit }\n const props: Partial<Range> = {}\n\n if (edge == null || edge === 'anchor') {\n const point = reverse\n ? Editor.before(editor, anchor, opts)\n : Editor.after(editor, anchor, opts)\n\n if (point) {\n props.anchor = point\n }\n }\n\n if (edge == null || edge === 'focus') {\n const point = reverse\n ? Editor.before(editor, focus, opts)\n : Editor.after(editor, focus, opts)\n\n if (point) {\n props.focus = point\n }\n }\n\n Transforms.setSelection(editor, props)\n },\n\n /**\n * Set the selection to a new value.\n */\n\n select(editor: Editor, target: Location) {\n const { selection } = editor\n target = Editor.range(editor, target)\n\n if (selection) {\n Transforms.setSelection(editor, target)\n return\n }\n\n if (!Range.isRange(target)) {\n throw new Error(\n `When setting the selection and the current selection is \\`null\\` you must provide at least an \\`anchor\\` and \\`focus\\`, but you passed: ${JSON.stringify(\n target\n )}`\n )\n }\n\n editor.apply({\n type: 'set_selection',\n properties: selection,\n newProperties: target,\n })\n },\n\n /**\n * Set new properties on one of the selection's points.\n */\n\n setPoint(\n editor: Editor,\n props: Partial<Point>,\n options: {\n edge?: 'anchor' | 'focus' | 'start' | 'end'\n }\n ) {\n const { selection } = editor\n let { edge = 'both' } = options\n\n if (!selection) {\n return\n }\n\n if (edge === 'start') {\n edge = Range.isBackward(selection) ? 'focus' : 'anchor'\n }\n\n if (edge === 'end') {\n edge = Range.isBackward(selection) ? 'anchor' : 'focus'\n }\n\n const { anchor, focus } = selection\n const point = edge === 'anchor' ? anchor : focus\n\n Transforms.setSelection(editor, {\n [edge === 'anchor' ? 'anchor' : 'focus']: { ...point, ...props },\n })\n },\n\n /**\n * Set new properties on the selection.\n */\n\n setSelection(editor: Editor, props: Partial<Range>) {\n const { selection } = editor\n const oldProps: Partial<Range> | null = {}\n const newProps: Partial<Range> = {}\n\n if (!selection) {\n return\n }\n\n for (const k in props) {\n if (\n (k === 'anchor' &&\n props.anchor != null &&\n !Point.equals(props.anchor, selection.anchor)) ||\n (k === 'focus' &&\n props.focus != null &&\n !Point.equals(props.focus, selection.focus)) ||\n (k !== 'anchor' && k !== 'focus' && props[k] !== selection[k])\n ) {\n oldProps[k] = selection[k]\n newProps[k] = props[k]\n }\n }\n\n if (Object.keys(oldProps).length > 0) {\n editor.apply({\n type: 'set_selection',\n properties: oldProps,\n newProperties: newProps,\n })\n }\n },\n}\n","import {\n Editor,\n Element,\n Location,\n Node,\n NodeEntry,\n Path,\n Text,\n Point,\n Range,\n Transforms,\n} from '..'\n\nexport const TextTransforms = {\n /**\n * Delete content in the editor.\n */\n\n delete(\n editor: Editor,\n options: {\n at?: Location\n distance?: number\n unit?: 'character' | 'word' | 'line' | 'block'\n reverse?: boolean\n hanging?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const {\n reverse = false,\n unit = 'character',\n distance = 1,\n voids = false,\n } = options\n let { at = editor.selection, hanging = false } = options\n\n if (!at) {\n return\n }\n\n if (Range.isRange(at) && Range.isCollapsed(at)) {\n at = at.anchor\n }\n\n if (Point.isPoint(at)) {\n const furthestVoid = Editor.void(editor, { at, mode: 'highest' })\n\n if (!voids && furthestVoid) {\n const [, voidPath] = furthestVoid\n at = voidPath\n } else {\n const opts = { unit, distance }\n const target = reverse\n ? Editor.before(editor, at, opts) || Editor.start(editor, [])\n : Editor.after(editor, at, opts) || Editor.end(editor, [])\n at = { anchor: at, focus: target }\n hanging = true\n }\n }\n\n if (Path.isPath(at)) {\n Transforms.removeNodes(editor, { at, voids })\n return\n }\n\n if (Range.isCollapsed(at)) {\n return\n }\n\n if (!hanging) {\n at = Editor.unhangRange(editor, at, { voids })\n }\n\n let [start, end] = Range.edges(at)\n const startBlock = Editor.above(editor, {\n match: n => Editor.isBlock(editor, n),\n at: start,\n voids,\n })\n const endBlock = Editor.above(editor, {\n match: n => Editor.isBlock(editor, n),\n at: end,\n voids,\n })\n const isAcrossBlocks =\n startBlock && endBlock && !Path.equals(startBlock[1], endBlock[1])\n const isSingleText = Path.equals(start.path, end.path)\n const startVoid = voids\n ? null\n : Editor.void(editor, { at: start, mode: 'highest' })\n const endVoid = voids\n ? null\n : Editor.void(editor, { at: end, mode: 'highest' })\n\n // If the start or end points are inside an inline void, nudge them out.\n if (startVoid) {\n const before = Editor.before(editor, start)\n\n if (\n before &&\n startBlock &&\n Path.isAncestor(startBlock[1], before.path)\n ) {\n start = before\n }\n }\n\n if (endVoid) {\n const after = Editor.after(editor, end)\n\n if (after && endBlock && Path.isAncestor(endBlock[1], after.path)) {\n end = after\n }\n }\n\n // Get the highest nodes that are completely inside the range, as well as\n // the start and end nodes.\n const matches: NodeEntry[] = []\n let lastPath: Path | undefined\n\n for (const entry of Editor.nodes(editor, { at, voids })) {\n const [node, path] = entry\n\n if (lastPath && Path.compare(path, lastPath) === 0) {\n continue\n }\n\n if (\n (!voids && Editor.isVoid(editor, node)) ||\n (!Path.isCommon(path, start.path) && !Path.isCommon(path, end.path))\n ) {\n matches.push(entry)\n lastPath = path\n }\n }\n\n const pathRefs = Array.from(matches, ([, p]) => Editor.pathRef(editor, p))\n const startRef = Editor.pointRef(editor, start)\n const endRef = Editor.pointRef(editor, end)\n\n if (!isSingleText && !startVoid) {\n const point = startRef.current!\n const [node] = Editor.leaf(editor, point)\n const { path } = point\n const { offset } = start\n const text = node.text.slice(offset)\n editor.apply({ type: 'remove_text', path, offset, text })\n }\n\n for (const pathRef of pathRefs) {\n const path = pathRef.unref()!\n Transforms.removeNodes(editor, { at: path, voids })\n }\n\n if (!endVoid) {\n const point = endRef.current!\n const [node] = Editor.leaf(editor, point)\n const { path } = point\n const offset = isSingleText ? start.offset : 0\n const text = node.text.slice(offset, end.offset)\n editor.apply({ type: 'remove_text', path, offset, text })\n }\n\n if (\n !isSingleText &&\n isAcrossBlocks &&\n endRef.current &&\n startRef.current\n ) {\n Transforms.mergeNodes(editor, {\n at: endRef.current,\n hanging: true,\n voids,\n })\n }\n\n const point = endRef.unref() || startRef.unref()\n\n if (options.at == null && point) {\n Transforms.select(editor, point)\n }\n })\n },\n\n /**\n * Insert a fragment at a specific location in the editor.\n */\n\n insertFragment(\n editor: Editor,\n fragment: Node[],\n options: {\n at?: Location\n hanging?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { hanging = false, voids = false } = options\n let { at = editor.selection } = options\n\n if (!fragment.length) {\n return\n }\n\n if (!at) {\n return\n } else if (Range.isRange(at)) {\n if (!hanging) {\n at = Editor.unhangRange(editor, at)\n }\n\n if (Range.isCollapsed(at)) {\n at = at.anchor\n } else {\n const [, end] = Range.edges(at)\n\n if (!voids && Editor.void(editor, { at: end })) {\n return\n }\n\n const pointRef = Editor.pointRef(editor, end)\n Transforms.delete(editor, { at })\n at = pointRef.unref()!\n }\n } else if (Path.isPath(at)) {\n at = Editor.start(editor, at)\n }\n\n if (!voids && Editor.void(editor, { at })) {\n return\n }\n\n // If the insert point is at the edge of an inline node, move it outside\n // instead since it will need to be split otherwise.\n const inlineElementMatch = Editor.above(editor, {\n at,\n match: n => Editor.isInline(editor, n),\n mode: 'highest',\n voids,\n })\n\n if (inlineElementMatch) {\n const [, inlinePath] = inlineElementMatch\n\n if (Editor.isEnd(editor, at, inlinePath)) {\n const after = Editor.after(editor, inlinePath)!\n at = after\n } else if (Editor.isStart(editor, at, inlinePath)) {\n const before = Editor.before(editor, inlinePath)!\n at = before\n }\n }\n\n const blockMatch = Editor.above(editor, {\n match: n => Editor.isBlock(editor, n),\n at,\n voids,\n })!\n const [, blockPath] = blockMatch\n const isBlockStart = Editor.isStart(editor, at, blockPath)\n const isBlockEnd = Editor.isEnd(editor, at, blockPath)\n const mergeStart = !isBlockStart || (isBlockStart && isBlockEnd)\n const mergeEnd = !isBlockEnd\n const [, firstPath] = Node.first({ children: fragment }, [])\n const [, lastPath] = Node.last({ children: fragment }, [])\n\n const matches: NodeEntry[] = []\n const matcher = ([n, p]: NodeEntry) => {\n if (\n mergeStart &&\n Path.isAncestor(p, firstPath) &&\n Element.isElement(n) &&\n !editor.isVoid(n) &&\n !editor.isInline(n)\n ) {\n return false\n }\n\n if (\n mergeEnd &&\n Path.isAncestor(p, lastPath) &&\n Element.isElement(n) &&\n !editor.isVoid(n) &&\n !editor.isInline(n)\n ) {\n return false\n }\n\n return true\n }\n\n for (const entry of Node.nodes(\n { children: fragment },\n { pass: matcher }\n )) {\n if (entry[1].length > 0 && matcher(entry)) {\n matches.push(entry)\n }\n }\n\n const starts = []\n const middles = []\n const ends = []\n let starting = true\n let hasBlocks = false\n\n for (const [node] of matches) {\n if (Element.isElement(node) && !editor.isInline(node)) {\n starting = false\n hasBlocks = true\n middles.push(node)\n } else if (starting) {\n starts.push(node)\n } else {\n ends.push(node)\n }\n }\n\n const [inlineMatch] = Editor.nodes(editor, {\n at,\n match: n => Text.isText(n) || Editor.isInline(editor, n),\n mode: 'highest',\n voids,\n })!\n\n const [, inlinePath] = inlineMatch\n const isInlineStart = Editor.isStart(editor, at, inlinePath)\n const isInlineEnd = Editor.isEnd(editor, at, inlinePath)\n\n const middleRef = Editor.pathRef(\n editor,\n isBlockEnd ? Path.next(blockPath) : blockPath\n )\n\n const endRef = Editor.pathRef(\n editor,\n isInlineEnd ? Path.next(inlinePath) : inlinePath\n )\n\n Transforms.splitNodes(editor, {\n at,\n match: n =>\n hasBlocks\n ? Editor.isBlock(editor, n)\n : Text.isText(n) || Editor.isInline(editor, n),\n mode: hasBlocks ? 'lowest' : 'highest',\n voids,\n })\n\n const startRef = Editor.pathRef(\n editor,\n !isInlineStart || (isInlineStart && isInlineEnd)\n ? Path.next(inlinePath)\n : inlinePath\n )\n\n Transforms.insertNodes(editor, starts, {\n at: startRef.current!,\n match: n => Text.isText(n) || Editor.isInline(editor, n),\n mode: 'highest',\n voids,\n })\n\n Transforms.insertNodes(editor, middles, {\n at: middleRef.current!,\n match: n => Editor.isBlock(editor, n),\n mode: 'lowest',\n voids,\n })\n\n Transforms.insertNodes(editor, ends, {\n at: endRef.current!,\n match: n => Text.isText(n) || Editor.isInline(editor, n),\n mode: 'highest',\n voids,\n })\n\n if (!options.at) {\n let path\n\n if (ends.length > 0) {\n path = Path.previous(endRef.current!)\n } else if (middles.length > 0) {\n path = Path.previous(middleRef.current!)\n } else {\n path = Path.previous(startRef.current!)\n }\n\n const end = Editor.end(editor, path)\n Transforms.select(editor, end)\n }\n\n startRef.unref()\n middleRef.unref()\n endRef.unref()\n })\n },\n\n /**\n * Insert a string of text in the Editor.\n */\n\n insertText(\n editor: Editor,\n text: string,\n options: {\n at?: Location\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { voids = false } = options\n let { at = editor.selection } = options\n\n if (!at) {\n return\n }\n\n if (Path.isPath(at)) {\n at = Editor.range(editor, at)\n }\n\n if (Range.isRange(at)) {\n if (Range.isCollapsed(at)) {\n at = at.anchor\n } else {\n const end = Range.end(at)\n\n if (!voids && Editor.void(editor, { at: end })) {\n return\n }\n\n const pointRef = Editor.pointRef(editor, end)\n Transforms.delete(editor, { at, voids })\n at = pointRef.unref()!\n Transforms.setSelection(editor, { anchor: at, focus: at })\n }\n }\n\n if (!voids && Editor.void(editor, { at })) {\n return\n }\n\n const { path, offset } = at\n editor.apply({ type: 'insert_text', path, offset, text })\n })\n },\n}\n","import { GeneralTransforms } from './general'\nimport { NodeTransforms } from './node'\nimport { SelectionTransforms } from './selection'\nimport { TextTransforms } from './text'\n\nexport const Transforms = {\n ...GeneralTransforms,\n ...NodeTransforms,\n ...SelectionTransforms,\n ...TextTransforms,\n}\n","import {\n Descendant,\n Editor,\n Element,\n Node,\n NodeEntry,\n Operation,\n Path,\n PathRef,\n PointRef,\n Range,\n RangeRef,\n Text,\n Transforms,\n} from './'\nimport { DIRTY_PATHS, FLUSHING } from './utils/weak-maps'\n\n/**\n * Create a new Slate `Editor` object.\n */\n\nexport const createEditor = (): Editor => {\n const editor: Editor = {\n children: [],\n operations: [],\n selection: null,\n marks: null,\n isInline: () => false,\n isVoid: () => false,\n onChange: () => {},\n\n apply: (op: Operation) => {\n for (const ref of Editor.pathRefs(editor)) {\n PathRef.transform(ref, op)\n }\n\n for (const ref of Editor.pointRefs(editor)) {\n PointRef.transform(ref, op)\n }\n\n for (const ref of Editor.rangeRefs(editor)) {\n RangeRef.transform(ref, op)\n }\n\n const set = new Set()\n const dirtyPaths: Path[] = []\n\n const add = (path: Path | null) => {\n if (path) {\n const key = path.join(',')\n\n if (!set.has(key)) {\n set.add(key)\n dirtyPaths.push(path)\n }\n }\n }\n\n const oldDirtyPaths = DIRTY_PATHS.get(editor) || []\n const newDirtyPaths = getDirtyPaths(op)\n\n for (const path of oldDirtyPaths) {\n const newPath = Path.transform(path, op)\n add(newPath)\n }\n\n for (const path of newDirtyPaths) {\n add(path)\n }\n\n DIRTY_PATHS.set(editor, dirtyPaths)\n Editor.transform(editor, op)\n editor.operations.push(op)\n Editor.normalize(editor)\n\n // Clear any formats applied to the cursor if the selection changes.\n if (op.type === 'set_selection') {\n editor.marks = null\n }\n\n if (!FLUSHING.get(editor)) {\n FLUSHING.set(editor, true)\n\n Promise.resolve().then(() => {\n FLUSHING.set(editor, false)\n editor.onChange()\n editor.operations = []\n })\n }\n },\n\n addMark: (key: string, value: any) => {\n const { selection } = editor\n\n if (selection) {\n if (Range.isExpanded(selection)) {\n Transforms.setNodes(\n editor,\n { [key]: value },\n { match: Text.isText, split: true }\n )\n } else {\n const marks = {\n ...(Editor.marks(editor) || {}),\n [key]: value,\n }\n\n editor.marks = marks\n editor.onChange()\n }\n }\n },\n\n deleteBackward: (unit: 'character' | 'word' | 'line' | 'block') => {\n const { selection } = editor\n\n if (selection && Range.isCollapsed(selection)) {\n Transforms.delete(editor, { unit, reverse: true })\n }\n },\n\n deleteForward: (unit: 'character' | 'word' | 'line' | 'block') => {\n const { selection } = editor\n\n if (selection && Range.isCollapsed(selection)) {\n Transforms.delete(editor, { unit })\n }\n },\n\n deleteFragment: () => {\n const { selection } = editor\n\n if (selection && Range.isExpanded(selection)) {\n Transforms.delete(editor)\n }\n },\n\n insertBreak: () => {\n Transforms.splitNodes(editor, { always: true })\n },\n\n insertFragment: (fragment: Node[]) => {\n Transforms.insertFragment(editor, fragment)\n },\n\n insertNode: (node: Node) => {\n Transforms.insertNodes(editor, node)\n },\n\n insertText: (text: string) => {\n const { selection, marks } = editor\n\n if (selection) {\n // If the cursor is at the end of an inline, move it outside of\n // the inline before inserting\n if (Range.isCollapsed(selection)) {\n const inline = Editor.above(editor, {\n match: n => Editor.isInline(editor, n),\n mode: 'highest',\n })\n\n if (inline) {\n const [, inlinePath] = inline\n\n if (Editor.isEnd(editor, selection.anchor, inlinePath)) {\n const point = Editor.after(editor, inlinePath)!\n Transforms.setSelection(editor, {\n anchor: point,\n focus: point,\n })\n }\n }\n }\n\n if (marks) {\n const node = { text, ...marks }\n Transforms.insertNodes(editor, node)\n } else {\n Transforms.insertText(editor, text)\n }\n\n editor.marks = null\n }\n },\n\n normalizeNode: (entry: NodeEntry) => {\n const [node, path] = entry\n\n // There are no core normalizations for text nodes.\n if (Text.isText(node)) {\n return\n }\n\n // Ensure that block and inline nodes have at least one text child.\n if (Element.isElement(node) && node.children.length === 0) {\n const child = { text: '' }\n Transforms.insertNodes(editor, child, {\n at: path.concat(0),\n voids: true,\n })\n return\n }\n\n // Determine whether the node should have block or inline children.\n const shouldHaveInlines = Editor.isEditor(node)\n ? false\n : Element.isElement(node) &&\n (editor.isInline(node) ||\n node.children.length === 0 ||\n Text.isText(node.children[0]) ||\n editor.isInline(node.children[0]))\n\n // Since we'll be applying operations while iterating, keep track of an\n // index that accounts for any added/removed nodes.\n let n = 0\n\n for (let i = 0; i < node.children.length; i++, n++) {\n const child = node.children[i] as Descendant\n const prev = node.children[i - 1] as Descendant\n const isLast = i === node.children.length - 1\n const isInlineOrText =\n Text.isText(child) ||\n (Element.isElement(child) && editor.isInline(child))\n\n // Only allow block nodes in the top-level children and parent blocks\n // that only contain block nodes. Similarly, only allow inline nodes in\n // other inline nodes, or parent blocks that only contain inlines and\n // text.\n if (isInlineOrText !== shouldHaveInlines) {\n Transforms.removeNodes(editor, { at: path.concat(n), voids: true })\n n--\n } else if (Element.isElement(child)) {\n // Ensure that inline nodes are surrounded by text nodes.\n if (editor.isInline(child)) {\n if (prev == null || !Text.isText(prev)) {\n const newChild = { text: '' }\n Transforms.insertNodes(editor, newChild, {\n at: path.concat(n),\n voids: true,\n })\n n++\n } else if (isLast) {\n const newChild = { text: '' }\n Transforms.insertNodes(editor, newChild, {\n at: path.concat(n + 1),\n voids: true,\n })\n n++\n }\n }\n } else {\n // Merge adjacent text nodes that are empty or match.\n if (prev != null && Text.isText(prev)) {\n if (Text.equals(child, prev, { loose: true })) {\n Transforms.mergeNodes(editor, { at: path.concat(n), voids: true })\n n--\n } else if (prev.text === '') {\n Transforms.removeNodes(editor, {\n at: path.concat(n - 1),\n voids: true,\n })\n n--\n } else if (isLast && child.text === '') {\n Transforms.removeNodes(editor, {\n at: path.concat(n),\n voids: true,\n })\n n--\n }\n }\n }\n }\n },\n\n removeMark: (key: string) => {\n const { selection } = editor\n\n if (selection) {\n if (Range.isExpanded(selection)) {\n Transforms.unsetNodes(editor, key, {\n match: Text.isText,\n split: true,\n })\n } else {\n const marks = { ...(Editor.marks(editor) || {}) }\n delete marks[key]\n editor.marks = marks\n editor.onChange()\n }\n }\n },\n }\n\n return editor\n}\n\n/**\n * Get the \"dirty\" paths generated from an operation.\n */\n\nconst getDirtyPaths = (op: Operation) => {\n switch (op.type) {\n case 'insert_text':\n case 'remove_text':\n case 'set_node': {\n const { path } = op\n return Path.levels(path)\n }\n\n case 'insert_node': {\n const { node, path } = op\n const levels = Path.levels(path)\n const descendants = Text.isText(node)\n ? []\n : Array.from(Node.nodes(node), ([, p]) => path.concat(p))\n\n return [...levels, ...descendants]\n }\n\n case 'merge_node': {\n const { path } = op\n const ancestors = Path.ancestors(path)\n const previousPath = Path.previous(path)\n return [...ancestors, previousPath]\n }\n\n case 'move_node': {\n const { path, newPath } = op\n\n if (Path.equals(path, newPath)) {\n return []\n }\n\n const oldAncestors: Path[] = []\n const newAncestors: Path[] = []\n\n for (const ancestor of Path.ancestors(path)) {\n const p = Path.transform(ancestor, op)\n oldAncestors.push(p!)\n }\n\n for (const ancestor of Path.ancestors(newPath)) {\n const p = Path.transform(ancestor, op)\n newAncestors.push(p!)\n }\n\n return [...oldAncestors, ...newAncestors]\n }\n\n case 'remove_node': {\n const { path } = op\n const ancestors = Path.ancestors(path)\n return [...ancestors]\n }\n\n case 'split_node': {\n const { path } = op\n const levels = Path.levels(path)\n const nextPath = Path.next(path)\n return [...levels, nextPath]\n }\n\n default: {\n return []\n }\n }\n}\n"],"names":["objectWithoutPropertiesLoose","DIRTY_PATHS","WeakMap","FLUSHING","NORMALIZING","PATH_REFS","POINT_REFS","RANGE_REFS","SPACE","PUNCTUATION","CHAMELEON","SURROGATE_START","SURROGATE_END","ZERO_WIDTH_JOINER","getCharacterDistance","text","offset","prev","charCode","charCodeAt","isSurrogate","modifier","isModifier","isBMPEmoji","isVariationSelector","getWordDistance","length","i","started","char","charAt","l","slice","rest","isWordCharacter","remaining","test","next","code","Editor","above","editor","options","voids","mode","at","selection","match","path","reverse","n","p","levels","Text","isText","Path","equals","addMark","key","value","after","anchor","point","edge","focus","end","range","distance","d","target","positions","before","start","deleteBackward","unit","deleteForward","deleteFragment","edges","first","node","fragment","Node","hasBlocks","element","children","some","isBlock","hasInlines","isInline","hasTexts","every","insertBreak","insertFragment","insertNode","insertText","Element","isElement","isEditor","isPlainObject","apply","isVoid","normalizeNode","onChange","removeMark","marks","Range","isRange","isNodeList","Operation","isOperationList","operations","isEnd","Point","isEdge","isStart","isEmpty","isNormalizing","get","undefined","last","leaf","push","isExpanded","nodes","previous","block","prevNode","prevPath","blockPath","isAncestor","from","to","span","isPath","Error","parent","includes","universal","Span","isSpan","iterable","pass","matches","hit","isLower","compare","emit","normalize","force","getDirtyPaths","allPaths","Array","set","withoutNormalizing","max","m","pop","entry","parentPath","depth","firstPath","lastPath","common","isPoint","pathRef","affinity","ref","current","unref","pathRefs","delete","refs","add","Set","pointRef","pointRefs","string","available","isNewBlock","advance","e","s","reverseText","isFirst","rangeRef","rangeRefs","t","transform","op","createDraft","type","index","splice","points","newPath","truePath","newParent","newIndex","result","texts","newProperties","JSON","stringify","Object","assign","position","properties","newNode","finishDraft","isDraft","unhangRange","isCollapsed","endBlock","skip","isBefore","void","fn","isElementList","isArray","props","Location","isLocation","ancestor","root","ancestors","child","c","childPath","concat","another","descendant","descendants","elements","newRoot","produce","r","has","isNode","visited","isAfter","nextIndex","map","join","isNodeOperation","isOperation","endsWith","isSelectionOperation","isTextOperation","inverse","inversePath","inverseNewPath","paths","av","bv","min","Math","endsAfter","as","bs","endsAt","endsBefore","isChild","isCommon","isDescendant","isParent","isSibling","al","bl","list","relative","operation","onp","copy","PathRef","PointRef","isBackward","rs","re","ts","te","isAfterStart","isBeforeEnd","intersection","s1","e1","s2","e2","isForward","affinityAnchor","affinityFocus","RangeRef","loose","isTextList","decorations","leaves","dec","o","middle","off","GeneralTransforms","NodeTransforms","insertNodes","hanging","select","Transforms","matchPath","isAtEnd","splitNodes","liftNodes","toPath","moveNodes","removeNodes","splitPath","mergeNodes","commonPath","isPreviousSibling","emptyAncestor","emptyRef","toRef","targets","depths","setNodes","split","splitMode","k","keys","height","always","deleteRange","beforeRef","highest","voidMatch","nudge","voidNode","voidPath","afterPath","siblingHeight","afterRef","highestPath","lowestPath","unsetNodes","obj","unwrapNodes","wrapNodes","roots","rootPath","a","commonNode","wrapperPath","wrapper","SelectionTransforms","collapse","deselect","move","opts","setSelection","setPoint","oldProps","newProps","TextTransforms","furthestVoid","startBlock","isAcrossBlocks","isSingleText","startVoid","endVoid","startRef","endRef","inlineElementMatch","inlinePath","blockMatch","isBlockStart","isBlockEnd","mergeStart","mergeEnd","matcher","starts","middles","ends","starting","inlineMatch","isInlineStart","isInlineEnd","middleRef","createEditor","dirtyPaths","oldDirtyPaths","newDirtyPaths","Promise","resolve","then","inline","shouldHaveInlines","isLast","isInlineOrText","newChild","previousPath","oldAncestors","newAncestors","nextPath"],"mappings":";;;;;;;;;;AAAe,SAAS,eAAe,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE;EACvD,IAAI,GAAG,IAAI,GAAG,EAAE;IACd,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,EAAE;MAC9B,KAAK,EAAE,KAAK;MACZ,UAAU,EAAE,IAAI;MAChB,YAAY,EAAE,IAAI;MAClB,QAAQ,EAAE,IAAI;KACf,CAAC,CAAC;GACJ,MAAM;IACL,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;GAClB;;EAED,OAAO,GAAG,CAAC;;;CACZ,DCbc,SAAS,6BAA6B,CAAC,MAAM,EAAE,QAAQ,EAAE;EACtE,IAAI,MAAM,IAAI,IAAI,EAAE,OAAO,EAAE,CAAC;EAC9B,IAAI,MAAM,GAAG,EAAE,CAAC;EAChB,IAAI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;EACrC,IAAI,GAAG,EAAE,CAAC,CAAC;;EAEX,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IACtC,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,SAAS;IACzC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;GAC3B;;EAED,OAAO,MAAM,CAAC;;;CACf,DCZc,SAAS,wBAAwB,CAAC,MAAM,EAAE,QAAQ,EAAE;EACjE,IAAI,MAAM,IAAI,IAAI,EAAE,OAAO,EAAE,CAAC;EAC9B,IAAI,MAAM,GAAGA,6BAA4B,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;EAC5D,IAAI,GAAG,EAAE,CAAC,CAAC;;EAEX,IAAI,MAAM,CAAC,qBAAqB,EAAE;IAChC,IAAI,gBAAgB,GAAG,MAAM,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;;IAE5D,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;MAC5C,GAAG,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;MAC1B,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,SAAS;MACzC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,SAAS;MACvE,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;KAC3B;GACF;;EAED,OAAO,MAAM,CAAC;;;CACf,DChBM,IAAMC,WAAW,GAA4B,IAAIC,OAAJ,EAA7C;AACP,AAAO,IAAMC,QAAQ,GAA6B,IAAID,OAAJ,EAA3C;AACP,AAAO,IAAME,WAAW,GAA6B,IAAIF,OAAJ,EAA9C;AACP,AAAO,IAAMG,SAAS,GAAkC,IAAIH,OAAJ,EAAjD;AACP,AAAO,IAAMI,UAAU,GAAmC,IAAIJ,OAAJ,EAAnD;AACP,AAAO,IAAMK,UAAU,GAAmC,IAAIL,OAAJ,EAAnD;;ACPP;;;AAIA,IAAMM,KAAK,GAAG,IAAd;AACA,IAAMC,WAAW,GAAG,oyCAApB;AACA,IAAMC,SAAS,GAAG,iBAAlB;AACA,IAAMC,eAAe,GAAG,MAAxB;AACA,IAAMC,aAAa,GAAG,MAAtB;AACA,IAAMC,iBAAiB,GAAG,MAA1B;;;;;AAMA,AAAO,IAAMC,oBAAoB,GAAIC,IAAD;MAC9BC,MAAM,GAAG,CAAb;;;;;;;MAOIC,IAAI,GAAkD,IAA1D;MACIC,QAAQ,GAAGH,IAAI,CAACI,UAAL,CAAgB,CAAhB,CAAf;;SAEOD,QAAP,EAAiB;QACXE,WAAW,CAACF,QAAD,CAAf,EAA2B;UACnBG,QAAQ,GAAGC,UAAU,CAACJ,QAAD,EAAWH,IAAX,EAAiBC,MAAjB,CAA3B,CADyB;;;;UAMrBC,IAAI,KAAK,MAAT,IAAmBA,IAAI,KAAK,KAAhC,EAAuC;;;;MAIvCD,MAAM,IAAI,CAAV;MACAC,IAAI,GAAGI,QAAQ,GAAG,KAAH,GAAW,MAA1B;MACAH,QAAQ,GAAGH,IAAI,CAACI,UAAL,CAAgBH,MAAhB,CAAX,CAZyB;;;;;;QAkBvBE,QAAQ,KAAKL,iBAAjB,EAAoC;MAClCG,MAAM,IAAI,CAAV;MACAC,IAAI,GAAG,KAAP;MACAC,QAAQ,GAAGH,IAAI,CAACI,UAAL,CAAgBH,MAAhB,CAAX;;;;QAKEO,UAAU,CAACL,QAAD,CAAd,EAA0B;UACpBD,IAAI,IAAIA,IAAI,KAAK,KAAjB,IAA0BA,IAAI,KAAK,KAAvC,EAA8C;;;;MAG9CD,MAAM,IAAI,CAAV;MACAC,IAAI,GAAG,KAAP;MACAC,QAAQ,GAAGH,IAAI,CAACI,UAAL,CAAgBH,MAAhB,CAAX;;;;QAKEQ,mBAAmB,CAACN,QAAD,CAAvB,EAAmC;UAC7BD,IAAI,IAAIA,IAAI,KAAK,KAArB,EAA4B;;;;MAG5BD,MAAM,IAAI,CAAV;MACAC,IAAI,GAAG,KAAP;MACAC,QAAQ,GAAGH,IAAI,CAACI,UAAL,CAAgBH,MAAhB,CAAX;;KA5Ca;;;;QAkDXC,IAAI,KAAK,KAAb,EAAoB;MAClBD,MAAM,IAAI,CAAV;;KAnDa;;;;;;SA2DVA,MAAM,IAAI,CAAjB;CAtEK;;;;;AA6EP,AAAO,IAAMS,eAAe,GAAIV,IAAD;MACzBW,MAAM,GAAG,CAAb;MACIC,CAAC,GAAG,CAAR;MACIC,OAAO,GAAG,KAAd;MACIC,IAAJ;;SAEQA,IAAI,GAAGd,IAAI,CAACe,MAAL,CAAYH,CAAZ,CAAf,EAAgC;QACxBI,CAAC,GAAGjB,oBAAoB,CAACe,IAAD,CAA9B;IACAA,IAAI,GAAGd,IAAI,CAACiB,KAAL,CAAWL,CAAX,EAAcA,CAAC,GAAGI,CAAlB,CAAP;QACME,IAAI,GAAGlB,IAAI,CAACiB,KAAL,CAAWL,CAAC,GAAGI,CAAf,CAAb;;QAEIG,eAAe,CAACL,IAAD,EAAOI,IAAP,CAAnB,EAAiC;MAC/BL,OAAO,GAAG,IAAV;MACAF,MAAM,IAAIK,CAAV;KAFF,MAGO,IAAI,CAACH,OAAL,EAAc;MACnBF,MAAM,IAAIK,CAAV;KADK,MAEA;;;;IAIPJ,CAAC,IAAII,CAAL;;;SAGKL,MAAP;CAvBK;;;;;;AA+BP,IAAMQ,eAAe,GAAG,CAACL,IAAD,EAAeM,SAAf;MAClB3B,KAAK,CAAC4B,IAAN,CAAWP,IAAX,CAAJ,EAAsB;WACb,KAAP;;;;;MAKEnB,SAAS,CAAC0B,IAAV,CAAeP,IAAf,CAAJ,EAA0B;QACpBQ,IAAI,GAAGF,SAAS,CAACL,MAAV,CAAiB,CAAjB,CAAX;QACMJ,MAAM,GAAGZ,oBAAoB,CAACuB,IAAD,CAAnC;IACAA,IAAI,GAAGF,SAAS,CAACH,KAAV,CAAgB,CAAhB,EAAmBN,MAAnB,CAAP;QACMO,IAAI,GAAGE,SAAS,CAACH,KAAV,CAAgBN,MAAhB,CAAb;;QAEIQ,eAAe,CAACG,IAAD,EAAOJ,IAAP,CAAnB,EAAiC;aACxB,IAAP;;;;MAIAxB,WAAW,CAAC2B,IAAZ,CAAiBP,IAAjB,CAAJ,EAA4B;WACnB,KAAP;;;SAGK,IAAP;CAtBF;;;;;;AA6BA,IAAMT,WAAW,GAAIkB,IAAD,IAClB3B,eAAe,IAAI2B,IAAnB,IAA2BA,IAAI,IAAI1B,aADrC;;;;;;;;AASA,IAAMU,UAAU,GAAG,CAACgB,IAAD,EAAevB,IAAf,EAA6BC,MAA7B;MACbsB,IAAI,KAAK,MAAb,EAAqB;QACbD,IAAI,GAAGtB,IAAI,CAACI,UAAL,CAAgBH,MAAM,GAAG,CAAzB,CAAb;WACOqB,IAAI,IAAI,MAAR,IAAkBA,IAAI,IAAI,MAAjC;;;SAEK,KAAP;CALF;;;;;;;;AAcA,IAAMb,mBAAmB,GAAIc,IAAD;SACnBA,IAAI,IAAI,MAAR,IAAkBA,IAAI,IAAI,MAAjC;CADF;;;;;;;;AAUA,IAAMf,UAAU,GAAIe,IAAD;;;;;SAMfA,IAAI,KAAK,MAAT;EACAA,IAAI,KAAK,MADT;EAEAA,IAAI,KAAK,MAFT;EAGAA,IAAI,KAAK,MAHT;EAIAA,IAAI,KAAK,MAJT;EAKAA,IAAI,KAAK,MALT;EAMAA,IAAI,KAAK,MAPX;;CALF;;;;;IC5HaC,MAAM,GAAG;;;;EAKpBC,KAAK,CACHC,MADG;QAEHC,8EAKI;QAEE;MACJC,KAAK,GAAG,KADJ;MAEJC,IAAI,GAAG,QAFH;MAGJC,EAAE,GAAGJ,MAAM,CAACK,SAHR;MAIJC;QACEL,OALJ;;QAOI,CAACG,EAAL,EAAS;;;;QAIHG,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,CAAb;QACMI,OAAO,GAAGL,IAAI,KAAK,QAAzB;;SAEK,IAAM,CAACM,CAAD,EAAIC,CAAJ,CAAX,IAAqBZ,MAAM,CAACa,MAAP,CAAcX,MAAd,EAAsB;MACzCI,EAAE,EAAEG,IADqC;MAEzCL,KAFyC;MAGzCI,KAHyC;MAIzCE;KAJmB,CAArB,EAKI;UACE,CAACI,IAAI,CAACC,MAAL,CAAYJ,CAAZ,CAAD,IAAmB,CAACK,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkBG,CAAlB,CAAxB,EAA8C;eACrC,CAACD,CAAD,EAAIC,CAAJ,CAAP;;;GAnCc;;;;;;;;EA+CpBM,OAAO,CAAChB,MAAD,EAAiBiB,GAAjB,EAA8BC,KAA9B;IACLlB,MAAM,CAACgB,OAAP,CAAeC,GAAf,EAAoBC,KAApB;GAhDkB;;;;;EAuDpBC,KAAK,CACHnB,MADG,EAEHI,EAFG;QAGHH,8EAGI;QAEEmB,MAAM,GAAGtB,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBI,EAArB,EAAyB;MAAEkB,IAAI,EAAE;KAAjC,CAAf;QACMC,KAAK,GAAGzB,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmB,EAAnB,CAAd;QACMyB,KAAK,GAAG;MAAEL,MAAF;MAAUG;KAAxB;QACM;MAAEG,QAAQ,GAAG;QAAMzB,OAAzB;QACI0B,CAAC,GAAG,CAAR;QACIC,MAAJ;;SAEK,IAAMlB,CAAX,IAAgBZ,MAAM,CAAC+B,SAAP,CAAiB7B,MAAjB,oBAA8BC,OAA9B;MAAuCG,EAAE,EAAEqB;OAA3D,EAAqE;UAC/DE,CAAC,GAAGD,QAAR,EAAkB;;;;UAIdC,CAAC,KAAK,CAAV,EAAa;QACXC,MAAM,GAAGlB,CAAT;;;MAGFiB,CAAC;;;WAGIC,MAAP;GAlFkB;;;;;EAyFpBE,MAAM,CACJ9B,MADI,EAEJI,EAFI;QAGJH,8EAGI;QAEEmB,MAAM,GAAGtB,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqB,EAArB,CAAf;QACMuB,KAAK,GAAGzB,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBI,EAArB,EAAyB;MAAEkB,IAAI,EAAE;KAAjC,CAAd;QACMG,KAAK,GAAG;MAAEL,MAAF;MAAUG;KAAxB;QACM;MAAEG,QAAQ,GAAG;QAAMzB,OAAzB;QACI0B,CAAC,GAAG,CAAR;QACIC,MAAJ;;SAEK,IAAMlB,CAAX,IAAgBZ,MAAM,CAAC+B,SAAP,CAAiB7B,MAAjB,oBACXC,OADW;MAEdG,EAAE,EAAEqB,KAFU;MAGdjB,OAAO,EAAE;OAHX,EAII;UACEmB,CAAC,GAAGD,QAAR,EAAkB;;;;UAIdC,CAAC,KAAK,CAAV,EAAa;QACXC,MAAM,GAAGlB,CAAT;;;MAGFiB,CAAC;;;WAGIC,MAAP;GAxHkB;;;;;EA+HpBI,cAAc,CACZhC,MADY;QAEZC,8EAEI;QAEE;MAAEgC,IAAI,GAAG;QAAgBhC,OAA/B;IACAD,MAAM,CAACgC,cAAP,CAAsBC,IAAtB;GAtIkB;;;;;EA6IpBC,aAAa,CACXlC,MADW;QAEXC,8EAEI;QAEE;MAAEgC,IAAI,GAAG;QAAgBhC,OAA/B;IACAD,MAAM,CAACkC,aAAP,CAAqBD,IAArB;GApJkB;;;;;EA2JpBE,cAAc,CAACnC,MAAD;IACZA,MAAM,CAACmC,cAAP;GA5JkB;;;;;EAmKpBC,KAAK,CAACpC,MAAD,EAAiBI,EAAjB;WACI,CAACN,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBI,EAArB,CAAD,EAA2BN,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmBI,EAAnB,CAA3B,CAAP;GApKkB;;;;;EA2KpBoB,GAAG,CAACxB,MAAD,EAAiBI,EAAjB;WACMN,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBI,EAArB,EAAyB;MAAEkB,IAAI,EAAE;KAAjC,CAAP;GA5KkB;;;;;EAmLpBe,KAAK,CAACrC,MAAD,EAAiBI,EAAjB;QACGG,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwB;MAAEkB,IAAI,EAAE;KAAhC,CAAb;WACOxB,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAP;GArLkB;;;;;EA4LpBgC,QAAQ,CAACvC,MAAD,EAAiBI,EAAjB;QACAqB,KAAK,GAAG3B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBI,EAArB,CAAd;QACMmC,QAAQ,GAAGC,IAAI,CAACD,QAAL,CAAcvC,MAAd,EAAsByB,KAAtB,CAAjB;WACOc,QAAP;GA/LkB;;;;;EAqMpBE,SAAS,CAACzC,MAAD,EAAiB0C,OAAjB;WACAA,OAAO,CAACC,QAAR,CAAiBC,IAAjB,CAAsBnC,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAA3B,CAAP;GAtMkB;;;;;EA6MpBqC,UAAU,CAAC9C,MAAD,EAAiB0C,OAAjB;WACDA,OAAO,CAACC,QAAR,CAAiBC,IAAjB,CACLnC,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CADlB,CAAP;GA9MkB;;;;;EAuNpBuC,QAAQ,CAAChD,MAAD,EAAiB0C,OAAjB;WACCA,OAAO,CAACC,QAAR,CAAiBM,KAAjB,CAAuBxC,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,CAA5B,CAAP;GAxNkB;;;;;;;EAiOpByC,WAAW,CAAClD,MAAD;IACTA,MAAM,CAACkD,WAAP;GAlOkB;;;;;;;EA2OpBC,cAAc,CAACnD,MAAD,EAAiBuC,QAAjB;IACZvC,MAAM,CAACmD,cAAP,CAAsBZ,QAAtB;GA5OkB;;;;;;;EAqPpBa,UAAU,CAACpD,MAAD,EAAiBsC,IAAjB;IACRtC,MAAM,CAACoD,UAAP,CAAkBd,IAAlB;GAtPkB;;;;;;;EA+PpBe,UAAU,CAACrD,MAAD,EAAiB1B,IAAjB;IACR0B,MAAM,CAACqD,UAAP,CAAkB/E,IAAlB;GAhQkB;;;;;EAuQpBuE,OAAO,CAAC7C,MAAD,EAAiBkB,KAAjB;WACEoC,OAAO,CAACC,SAAR,CAAkBrC,KAAlB,KAA4B,CAAClB,MAAM,CAAC+C,QAAP,CAAgB7B,KAAhB,CAApC;GAxQkB;;;;;EA+QpBsC,QAAQ,CAACtC,KAAD;WAEJuC,aAAa,CAACvC,KAAD,CAAb,IACA,OAAOA,KAAK,CAACF,OAAb,KAAyB,UADzB,IAEA,OAAOE,KAAK,CAACwC,KAAb,KAAuB,UAFvB,IAGA,OAAOxC,KAAK,CAACc,cAAb,KAAgC,UAHhC,IAIA,OAAOd,KAAK,CAACgB,aAAb,KAA+B,UAJ/B,IAKA,OAAOhB,KAAK,CAACiB,cAAb,KAAgC,UALhC,IAMA,OAAOjB,KAAK,CAACgC,WAAb,KAA6B,UAN7B,IAOA,OAAOhC,KAAK,CAACiC,cAAb,KAAgC,UAPhC,IAQA,OAAOjC,KAAK,CAACkC,UAAb,KAA4B,UAR5B,IASA,OAAOlC,KAAK,CAACmC,UAAb,KAA4B,UAT5B,IAUA,OAAOnC,KAAK,CAAC6B,QAAb,KAA0B,UAV1B,IAWA,OAAO7B,KAAK,CAACyC,MAAb,KAAwB,UAXxB,IAYA,OAAOzC,KAAK,CAAC0C,aAAb,KAA+B,UAZ/B,IAaA,OAAO1C,KAAK,CAAC2C,QAAb,KAA0B,UAb1B,IAcA,OAAO3C,KAAK,CAAC4C,UAAb,KAA4B,UAd5B,KAeC5C,KAAK,CAAC6C,KAAN,KAAgB,IAAhB,IAAwBN,aAAa,CAACvC,KAAK,CAAC6C,KAAP,CAftC,MAgBC7C,KAAK,CAACb,SAAN,KAAoB,IAApB,IAA4B2D,KAAK,CAACC,OAAN,CAAc/C,KAAK,CAACb,SAApB,CAhB7B,KAiBAmC,IAAI,CAAC0B,UAAL,CAAgBhD,KAAK,CAACyB,QAAtB,CAjBA,IAkBAwB,SAAS,CAACC,eAAV,CAA0BlD,KAAK,CAACmD,UAAhC,CAnBF;GAhRkB;;;;;EA2SpBC,KAAK,CAACtE,MAAD,EAAiBqB,KAAjB,EAA+BjB,EAA/B;QACGoB,GAAG,GAAG1B,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmBI,EAAnB,CAAZ;WACOmE,KAAK,CAACxD,MAAN,CAAaM,KAAb,EAAoBG,GAApB,CAAP;GA7SkB;;;;;EAoTpBgD,MAAM,CAACxE,MAAD,EAAiBqB,KAAjB,EAA+BjB,EAA/B;WACGN,MAAM,CAAC2E,OAAP,CAAezE,MAAf,EAAuBqB,KAAvB,EAA8BjB,EAA9B,KAAqCN,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBqB,KAArB,EAA4BjB,EAA5B,CAA5C;GArTkB;;;;;EA4TpBsE,OAAO,CAAC1E,MAAD,EAAiB0C,OAAjB;QACC;MAAEC;QAAaD,OAArB;QACM,CAACL,KAAD,IAAUM,QAAhB;WAEEA,QAAQ,CAAC1D,MAAT,KAAoB,CAApB,IACC0D,QAAQ,CAAC1D,MAAT,KAAoB,CAApB,IACC2B,IAAI,CAACC,MAAL,CAAYwB,KAAZ,CADD,IAECA,KAAK,CAAC/D,IAAN,KAAe,EAFhB,IAGC,CAAC0B,MAAM,CAAC2D,MAAP,CAAcjB,OAAd,CALL;GA/TkB;;;;;EA4UpBK,QAAQ,CAAC/C,MAAD,EAAiBkB,KAAjB;WACCoC,OAAO,CAACC,SAAR,CAAkBrC,KAAlB,KAA4BlB,MAAM,CAAC+C,QAAP,CAAgB7B,KAAhB,CAAnC;GA7UkB;;;;;EAoVpByD,aAAa,CAAC3E,MAAD;QACL2E,aAAa,GAAGhH,WAAW,CAACiH,GAAZ,CAAgB5E,MAAhB,CAAtB;WACO2E,aAAa,KAAKE,SAAlB,GAA8B,IAA9B,GAAqCF,aAA5C;GAtVkB;;;;;EA6VpBF,OAAO,CAACzE,MAAD,EAAiBqB,KAAjB,EAA+BjB,EAA/B;;QAEDiB,KAAK,CAAC9C,MAAN,KAAiB,CAArB,EAAwB;aACf,KAAP;;;QAGIwD,KAAK,GAAGjC,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBI,EAArB,CAAd;WACOmE,KAAK,CAACxD,MAAN,CAAaM,KAAb,EAAoBU,KAApB,CAAP;GApWkB;;;;;EA2WpB4B,MAAM,CAAC3D,MAAD,EAAiBkB,KAAjB;WACGoC,OAAO,CAACC,SAAR,CAAkBrC,KAAlB,KAA4BlB,MAAM,CAAC2D,MAAP,CAAczC,KAAd,CAAnC;GA5WkB;;;;;EAmXpB4D,IAAI,CAAC9E,MAAD,EAAiBI,EAAjB;QACIG,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwB;MAAEkB,IAAI,EAAE;KAAhC,CAAb;WACOxB,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAP;GArXkB;;;;;EA4XpBwE,IAAI,CACF/E,MADE,EAEFI,EAFE;QAGFH,8EAGI;QAEEM,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwBH,OAAxB,CAAb;QACMqC,IAAI,GAAGE,IAAI,CAACuC,IAAL,CAAU/E,MAAV,EAAkBO,IAAlB,CAAb;WACO,CAAC+B,IAAD,EAAO/B,IAAP,CAAP;GAtYkB;;;;;GA6YnBI,MAAD,CACEX,MADF;QAEEC,8EAKI;QAEE;MAAEG,EAAE,GAAGJ,MAAM,CAACK,SAAd;MAAyBG,OAAO,GAAG,KAAnC;MAA0CN,KAAK,GAAG;QAAUD,OAAlE;QACI;MAAEK;QAAUL,OAAhB;;QAEIK,KAAK,IAAI,IAAb,EAAmB;MACjBA,KAAK,GAAG,MAAM,IAAd;;;QAGE,CAACF,EAAL,EAAS;;;;QAIHO,MAAM,GAAmB,EAA/B;QACMJ,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,CAAb;;SAEK,IAAM,CAACK,CAAD,EAAIC,CAAJ,CAAX,IAAqB8B,IAAI,CAAC7B,MAAL,CAAYX,MAAZ,EAAoBO,IAApB,CAArB,EAAgD;UAC1C,CAACD,KAAK,CAACG,CAAD,CAAV,EAAe;;;;MAIfE,MAAM,CAACqE,IAAP,CAAY,CAACvE,CAAD,EAAIC,CAAJ,CAAZ;;UAEI,CAACR,KAAD,IAAUJ,MAAM,CAAC6D,MAAP,CAAc3D,MAAd,EAAsBS,CAAtB,CAAd,EAAwC;;;;;QAKtCD,OAAJ,EAAa;MACXG,MAAM,CAACH,OAAP;;;WAGKG,MAAP;GApbkB;;;;;EA2bpBoD,KAAK,CAAC/D,MAAD;QACG;MAAE+D,KAAF;MAAS1D;QAAcL,MAA7B;;QAEI,CAACK,SAAL,EAAgB;aACP,IAAP;;;QAGE0D,KAAJ,EAAW;aACFA,KAAP;;;QAGEC,KAAK,CAACiB,UAAN,CAAiB5E,SAAjB,CAAJ,EAAiC;UACzB,CAACC,KAAD,IAAUR,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEM,KAAK,EAAEM,IAAI,CAACC;OAAnC,CAAhB;;UAEIP,KAAJ,EAAW;YACH,CAACgC,KAAD,IAAShC,KAAf;;YACiBd,KAAjB,4BAA0B8C,KAA1B;;eACO9C,KAAP;OAHF,MAIO;eACE,EAAP;;;;QAIE;MAAE4B;QAAWf,SAAnB;QACM;MAAEE;QAASa,MAAjB;QACI,CAACkB,IAAD,IAASxC,MAAM,CAACiF,IAAP,CAAY/E,MAAZ,EAAoBO,IAApB,CAAb;;QAEIa,MAAM,CAAC7C,MAAP,KAAkB,CAAtB,EAAyB;UACjBC,IAAI,GAAGsB,MAAM,CAACqF,QAAP,CAAgBnF,MAAhB,EAAwB;QAAEI,EAAE,EAAEG,IAAN;QAAYD,KAAK,EAAEM,IAAI,CAACC;OAAhD,CAAb;UACMuE,KAAK,GAAGtF,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QACjCM,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB;OADA,CAAd;;UAIIjC,IAAI,IAAI4G,KAAZ,EAAmB;YACX,CAACC,QAAD,EAAWC,QAAX,IAAuB9G,IAA7B;YACM,GAAG+G,SAAH,IAAgBH,KAAtB;;YAEItE,IAAI,CAAC0E,UAAL,CAAgBD,SAAhB,EAA2BD,QAA3B,CAAJ,EAA0C;UACxChD,IAAI,GAAG+C,QAAP;;;;;QAKW7F,IAAjB,4BAA0B8C,IAA1B;;WACO9C,IAAP;GAvekB;;;;;EA8epBI,IAAI,CACFI,MADE;QAEFC,8EAKI;QAEE;MAAEE,IAAI,GAAG,QAAT;MAAmBD,KAAK,GAAG;QAAUD,OAA3C;QACI;MAAEK,KAAF;MAASF,EAAE,GAAGJ,MAAM,CAACK;QAAcJ,OAAvC;;QAEI,CAACG,EAAL,EAAS;;;;QAIH,GAAGqF,IAAH,IAAW3F,MAAM,CAACgF,IAAP,CAAY9E,MAAZ,EAAoBI,EAApB,CAAjB;QACM,GAAGsF,EAAH,IAAS5F,MAAM,CAACgF,IAAP,CAAY9E,MAAZ,EAAoB,EAApB,CAAf;QACM2F,IAAI,GAAS,CAACF,IAAD,EAAOC,EAAP,CAAnB;;QAEI5E,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,KAAmBA,EAAE,CAACnB,MAAH,KAAc,CAArC,EAAwC;YAChC,IAAI4G,KAAJ,gDAAN;;;QAGEvF,KAAK,IAAI,IAAb,EAAmB;UACbQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;YACb,CAAC0F,MAAD,IAAWhG,MAAM,CAACgG,MAAP,CAAc9F,MAAd,EAAsBI,EAAtB,CAAjB;;QACAE,KAAK,GAAGG,CAAC,IAAIqF,MAAM,CAACnD,QAAP,CAAgBoD,QAAhB,CAAyBtF,CAAzB,CAAb;OAFF,MAGO;QACLH,KAAK,GAAG,MAAM,IAAd;;;;QAIE,GAAGV,IAAH,IAAWE,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;MAAEI,EAAE,EAAEuF,IAAN;MAAYrF,KAAZ;MAAmBH,IAAnB;MAAyBD;KAA9C,CAAjB;WACON,IAAP;GAhhBkB;;;;;EAuhBpB0C,IAAI,CACFtC,MADE,EAEFI,EAFE;QAGFH,8EAGI;QAEEM,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwBH,OAAxB,CAAb;QACMqC,IAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,IAAjB,CAAb;WACO,CAAC+B,IAAD,EAAO/B,IAAP,CAAP;GAjiBkB;;;;;GAwiBnB2E,KAAD,CACElF,MADF;QAEEC,8EAOI;QAEE;MACJG,EAAE,GAAGJ,MAAM,CAACK,SADR;MAEJF,IAAI,GAAG,KAFH;MAGJ6F,SAAS,GAAG,KAHR;MAIJxF,OAAO,GAAG,KAJN;MAKJN,KAAK,GAAG;QACND,OANJ;QAOI;MAAEK;QAAUL,OAAhB;;QAEI,CAACK,KAAL,EAAY;MACVA,KAAK,GAAG,MAAM,IAAd;;;QAGE,CAACF,EAAL,EAAS;;;;QAILqF,IAAJ;QACIC,EAAJ;;QAEIO,IAAI,CAACC,MAAL,CAAY9F,EAAZ,CAAJ,EAAqB;MACnBqF,IAAI,GAAGrF,EAAE,CAAC,CAAD,CAAT;MACAsF,EAAE,GAAGtF,EAAE,CAAC,CAAD,CAAP;KAFF,MAGO;UACCiC,KAAK,GAAGvC,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwB;QAAEkB,IAAI,EAAE;OAAhC,CAAd;UACMwD,IAAI,GAAGhF,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwB;QAAEkB,IAAI,EAAE;OAAhC,CAAb;MACAmE,IAAI,GAAGjF,OAAO,GAAGsE,IAAH,GAAUzC,KAAxB;MACAqD,EAAE,GAAGlF,OAAO,GAAG6B,KAAH,GAAWyC,IAAvB;;;QAGIqB,QAAQ,GAAG3D,IAAI,CAAC0C,KAAL,CAAWlF,MAAX,EAAmB;MAClCQ,OADkC;MAElCiF,IAFkC;MAGlCC,EAHkC;MAIlCU,IAAI,EAAE;YAAC,CAAC3F,CAAD,CAAD;eAAUP,KAAK,GAAG,KAAH,GAAWJ,MAAM,CAAC6D,MAAP,CAAc3D,MAAd,EAAsBS,CAAtB,CAA1B;;KAJS,CAAjB;QAOM4F,OAAO,GAAmB,EAAhC;QACIC,GAAJ;;SAEK,IAAM,CAAChE,IAAD,EAAO/B,IAAP,CAAX,IAA2B4F,QAA3B,EAAqC;UAC7BI,OAAO,GAAGD,GAAG,IAAIxF,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmB+F,GAAG,CAAC,CAAD,CAAtB,MAA+B,CAAtD,CADmC;;UAI/BnG,IAAI,KAAK,SAAT,IAAsBoG,OAA1B,EAAmC;;;;UAI/B,CAACjG,KAAK,CAACgC,IAAD,CAAV,EAAkB;;;;YAIZ0D,SAAS,IAAI,CAACO,OAAd,IAAyB3F,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAA7B,EAAgD;;SAAhD,MAEO;;;OAd0B;;;UAoB/BnC,IAAI,KAAK,QAAT,IAAqBoG,OAAzB,EAAkC;QAChCD,GAAG,GAAG,CAAChE,IAAD,EAAO/B,IAAP,CAAN;;OArBiC;;;UA0B7BkG,IAAI,GACRtG,IAAI,KAAK,QAAT,GAAoBmG,GAApB,GAA0B,CAAChE,IAAD,EAAO/B,IAAP,CAD5B;;UAGIkG,IAAJ,EAAU;YACJT,SAAJ,EAAe;UACbK,OAAO,CAACrB,IAAR,CAAayB,IAAb;SADF,MAEO;gBACCA,IAAN;;;;MAIJH,GAAG,GAAG,CAAChE,IAAD,EAAO/B,IAAP,CAAN;;;;QAIEJ,IAAI,KAAK,QAAT,IAAqBmG,GAAzB,EAA8B;UACxBN,SAAJ,EAAe;QACbK,OAAO,CAACrB,IAAR,CAAasB,GAAb;OADF,MAEO;cACCA,GAAN;;;;;;QAMAN,SAAJ,EAAe;aACNK,OAAP;;GA/oBgB;;;;;EAspBpBK,SAAS,CACP1G,MADO;QAEPC,8EAEI;QAEE;MAAE0G,KAAK,GAAG;QAAU1G,OAA1B;;QACM2G,aAAa,GAAI5G,MAAD;aACbxC,WAAW,CAACoH,GAAZ,CAAgB5E,MAAhB,KAA2B,EAAlC;KADF;;QAII,CAACF,MAAM,CAAC6E,aAAP,CAAqB3E,MAArB,CAAL,EAAmC;;;;QAI/B2G,KAAJ,EAAW;UACHE,QAAQ,GAAGC,KAAK,CAACrB,IAAN,CAAWjD,IAAI,CAAC0C,KAAL,CAAWlF,MAAX,CAAX,EAA+B;YAAC,GAAGU,CAAH,CAAD;eAAWA,CAAX;OAA/B,CAAjB;MACAlD,WAAW,CAACuJ,GAAZ,CAAgB/G,MAAhB,EAAwB6G,QAAxB;;;QAGED,aAAa,CAAC5G,MAAD,CAAb,CAAsBf,MAAtB,KAAiC,CAArC,EAAwC;;;;IAIxCa,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1BiH,GAAG,GAAGL,aAAa,CAAC5G,MAAD,CAAb,CAAsBf,MAAtB,GAA+B,EAA3C;;UACIiI,CAAC,GAAG,CAAR;;aAEON,aAAa,CAAC5G,MAAD,CAAb,CAAsBf,MAAtB,KAAiC,CAAxC,EAA2C;YACrCiI,CAAC,GAAGD,GAAR,EAAa;gBACL,IAAIpB,KAAJ,yEAC8CoB,GAD9C,2HAAN;;;YAKI1G,IAAI,GAAGqG,aAAa,CAAC5G,MAAD,CAAb,CAAsBmH,GAAtB,EAAb;YACMC,KAAK,GAAGtH,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAd;QACAP,MAAM,CAAC4D,aAAP,CAAqBwD,KAArB;QACAF,CAAC;;KAdL;GA9qBkB;;;;;EAqsBpBpB,MAAM,CACJ9F,MADI,EAEJI,EAFI;QAGJH,8EAGI;QAEEM,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwBH,OAAxB,CAAb;QACMoH,UAAU,GAAGvG,IAAI,CAACgF,MAAL,CAAYvF,IAAZ,CAAnB;QACM6G,KAAK,GAAGtH,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBqH,UAApB,CAAd;WACOD,KAAP;GAhtBkB;;;;;EAutBpB7G,IAAI,CACFP,MADE,EAEFI,EAFE;QAGFH,8EAGI;QAEE;MAAEqH,KAAF;MAAShG;QAASrB,OAAxB;;QAEIa,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;UACfkB,IAAI,KAAK,OAAb,EAAsB;YACd,GAAGiG,SAAH,IAAgB/E,IAAI,CAACH,KAAL,CAAWrC,MAAX,EAAmBI,EAAnB,CAAtB;QACAA,EAAE,GAAGmH,SAAL;OAFF,MAGO,IAAIjG,IAAI,KAAK,KAAb,EAAoB;YACnB,GAAGkG,QAAH,IAAehF,IAAI,CAACsC,IAAL,CAAU9E,MAAV,EAAkBI,EAAlB,CAArB;QACAA,EAAE,GAAGoH,QAAL;;;;QAIAxD,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;UACjBkB,IAAI,KAAK,OAAb,EAAsB;QACpBlB,EAAE,GAAG4D,KAAK,CAACjC,KAAN,CAAY3B,EAAZ,CAAL;OADF,MAEO,IAAIkB,IAAI,KAAK,KAAb,EAAoB;QACzBlB,EAAE,GAAG4D,KAAK,CAACxC,GAAN,CAAUpB,EAAV,CAAL;OADK,MAEA;QACLA,EAAE,GAAGU,IAAI,CAAC2G,MAAL,CAAYrH,EAAE,CAACgB,MAAH,CAAUb,IAAtB,EAA4BH,EAAE,CAACmB,KAAH,CAAShB,IAArC,CAAL;;;;QAIAgE,KAAK,CAACmD,OAAN,CAActH,EAAd,CAAJ,EAAuB;MACrBA,EAAE,GAAGA,EAAE,CAACG,IAAR;;;QAGE+G,KAAK,IAAI,IAAb,EAAmB;MACjBlH,EAAE,GAAGA,EAAE,CAACb,KAAH,CAAS,CAAT,EAAY+H,KAAZ,CAAL;;;WAGKlH,EAAP;GA7vBkB;;;;;;EAqwBpBuH,OAAO,CACL3H,MADK,EAELO,IAFK;QAGLN,8EAEI;QAEE;MAAE2H,QAAQ,GAAG;QAAc3H,OAAjC;QACM4H,GAAG,GAAY;MACnBC,OAAO,EAAEvH,IADU;MAEnBqH,QAFmB;;MAGnBG,KAAK;YACG;UAAED;YAAYD,GAApB;YACMG,QAAQ,GAAGlI,MAAM,CAACkI,QAAP,CAAgBhI,MAAhB,CAAjB;QACAgI,QAAQ,CAACC,MAAT,CAAgBJ,GAAhB;QACAA,GAAG,CAACC,OAAJ,GAAc,IAAd;eACOA,OAAP;;;KARJ;QAYMI,IAAI,GAAGpI,MAAM,CAACkI,QAAP,CAAgBhI,MAAhB,CAAb;IACAkI,IAAI,CAACC,GAAL,CAASN,GAAT;WACOA,GAAP;GA3xBkB;;;;;EAkyBpBG,QAAQ,CAAChI,MAAD;QACFkI,IAAI,GAAGtK,SAAS,CAACgH,GAAV,CAAc5E,MAAd,CAAX;;QAEI,CAACkI,IAAL,EAAW;MACTA,IAAI,GAAG,IAAIE,GAAJ,EAAP;MACAxK,SAAS,CAACmJ,GAAV,CAAc/G,MAAd,EAAsBkI,IAAtB;;;WAGKA,IAAP;GA1yBkB;;;;;EAizBpB7G,KAAK,CACHrB,MADG,EAEHI,EAFG;QAGHH,8EAEI;QAEE;MAAEqB,IAAI,GAAG;QAAYrB,OAA3B;;QAEIa,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;UACfG,IAAJ;;UAEIe,IAAI,KAAK,KAAb,EAAoB;YACZ,GAAGkG,QAAH,IAAehF,IAAI,CAACsC,IAAL,CAAU9E,MAAV,EAAkBI,EAAlB,CAArB;QACAG,IAAI,GAAGiH,QAAP;OAFF,MAGO;YACC,GAAGD,SAAH,IAAgB/E,IAAI,CAACH,KAAL,CAAWrC,MAAX,EAAmBI,EAAnB,CAAtB;QACAG,IAAI,GAAGgH,SAAP;;;UAGIjF,IAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,IAAjB,CAAb;;UAEI,CAACK,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAL,EAAwB;cAChB,IAAIuD,KAAJ,0BACcvE,IADd,yCACiDlB,EADjD,iCAC0EkB,IAD1E,iBAAN;;;aAKK;QAAEf,IAAF;QAAQhC,MAAM,EAAE+C,IAAI,KAAK,KAAT,GAAiBgB,IAAI,CAAChE,IAAL,CAAUW,MAA3B,GAAoC;OAA3D;;;QAGE+E,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;UACf,CAAC2B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAArB;aACOkB,IAAI,KAAK,OAAT,GAAmBS,KAAnB,GAA2BP,GAAlC;;;WAGKpB,EAAP;GAr1BkB;;;;;;EA61BpBiI,QAAQ,CACNrI,MADM,EAENqB,KAFM;QAGNpB,8EAEI;QAEE;MAAE2H,QAAQ,GAAG;QAAc3H,OAAjC;QACM4H,GAAG,GAAa;MACpBC,OAAO,EAAEzG,KADW;MAEpBuG,QAFoB;;MAGpBG,KAAK;YACG;UAAED;YAAYD,GAApB;YACMS,SAAS,GAAGxI,MAAM,CAACwI,SAAP,CAAiBtI,MAAjB,CAAlB;QACAsI,SAAS,CAACL,MAAV,CAAiBJ,GAAjB;QACAA,GAAG,CAACC,OAAJ,GAAc,IAAd;eACOA,OAAP;;;KARJ;QAYMI,IAAI,GAAGpI,MAAM,CAACwI,SAAP,CAAiBtI,MAAjB,CAAb;IACAkI,IAAI,CAACC,GAAL,CAASN,GAAT;WACOA,GAAP;GAn3BkB;;;;;EA03BpBS,SAAS,CAACtI,MAAD;QACHkI,IAAI,GAAGrK,UAAU,CAAC+G,GAAX,CAAe5E,MAAf,CAAX;;QAEI,CAACkI,IAAL,EAAW;MACTA,IAAI,GAAG,IAAIE,GAAJ,EAAP;MACAvK,UAAU,CAACkJ,GAAX,CAAe/G,MAAf,EAAuBkI,IAAvB;;;WAGKA,IAAP;GAl4BkB;;;;;;;;;;;;;GAi5BnBrG,SAAD,CACE7B,MADF;QAEEC,8EAII;QAEE;MAAEG,EAAE,GAAGJ,MAAM,CAACK,SAAd;MAAyB4B,IAAI,GAAG,QAAhC;MAA0CzB,OAAO,GAAG;QAAUP,OAApE;;QAEI,CAACG,EAAL,EAAS;;;;QAIHqB,KAAK,GAAG3B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBI,EAArB,CAAd;QACM,CAAC2B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAArB;QACMY,KAAK,GAAG7B,OAAO,GAAGgB,GAAH,GAASO,KAA9B;QACIwG,MAAM,GAAG,EAAb;QACIC,SAAS,GAAG,CAAhB;QACIjK,MAAM,GAAG,CAAb;QACImD,QAAQ,GAAkB,IAA9B;QACI+G,UAAU,GAAG,KAAjB;;QAEMC,OAAO,GAAG;UACVhH,QAAQ,IAAI,IAAhB,EAAsB;YAChBO,IAAI,KAAK,WAAb,EAA0B;UACxBP,QAAQ,GAAGrD,oBAAoB,CAACkK,MAAD,CAA/B;SADF,MAEO,IAAItG,IAAI,KAAK,MAAb,EAAqB;UAC1BP,QAAQ,GAAG1C,eAAe,CAACuJ,MAAD,CAA1B;SADK,MAEA,IAAItG,IAAI,KAAK,MAAT,IAAmBA,IAAI,KAAK,OAAhC,EAAyC;UAC9CP,QAAQ,GAAG6G,MAAM,CAACtJ,MAAlB;SADK,MAEA;UACLyC,QAAQ,GAAG,CAAX;;;QAGF6G,MAAM,GAAGA,MAAM,CAAChJ,KAAP,CAAamC,QAAb,CAAT;;;;MAIFnD,MAAM,GAAGiC,OAAO,GAAGjC,MAAM,GAAGmD,QAAZ,GAAuBnD,MAAM,GAAGmD,QAAhD;;MAEA8G,SAAS,GAAGA,SAAS,GAAG9G,QAAxB;;;MAGAA,QAAQ,GAAG8G,SAAS,IAAI,CAAb,GAAiB,IAAjB,GAAwB,IAAIA,SAAvC;KArBF;;SAwBK,IAAM,CAAClG,IAAD,EAAO/B,IAAP,CAAX,IAA2BT,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;MAAEI,EAAF;MAAMI;KAA3B,CAA3B,EAAkE;UAC5D8C,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,CAAJ,EAA6B;;;YAGvBtC,MAAM,CAAC2D,MAAP,CAAcrB,IAAd,CAAJ,EAAyB;gBACjBxC,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBO,IAArB,CAAN;;;;YAIEP,MAAM,CAAC+C,QAAP,CAAgBT,IAAhB,CAAJ,EAA2B;;;;YAIvBxC,MAAM,CAACgD,UAAP,CAAkB9C,MAAlB,EAA0BsC,IAA1B,CAAJ,EAAqC;cAC7BqG,CAAC,GAAG7H,IAAI,CAAC0E,UAAL,CAAgBjF,IAAhB,EAAsBiB,GAAG,CAACjB,IAA1B,IACNiB,GADM,GAEN1B,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmBO,IAAnB,CAFJ;cAGMqI,CAAC,GAAG9H,IAAI,CAAC0E,UAAL,CAAgBjF,IAAhB,EAAsBwB,KAAK,CAACxB,IAA5B,IACNwB,KADM,GAENjC,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBO,IAArB,CAFJ;cAIMjC,IAAI,GAAGwB,MAAM,CAACyI,MAAP,CAAcvI,MAAd,EAAsB;YAAEoB,MAAM,EAAEwH,CAAV;YAAarH,KAAK,EAAEoH;WAA1C,CAAb;UACAJ,MAAM,GAAG/H,OAAO,GAAGqI,eAAW,CAACvK,IAAD,CAAd,GAAuBA,IAAvC;UACAmK,UAAU,GAAG,IAAb;;;;UAIA7H,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;YACfwG,OAAO,GAAGhI,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkB8B,KAAK,CAAC9B,IAAxB,CAAhB;QACAiI,SAAS,GAAGlG,IAAI,CAAChE,IAAL,CAAUW,MAAtB;QACAV,MAAM,GAAGiC,OAAO,GAAGgI,SAAH,GAAe,CAA/B;;YAEIM,OAAJ,EAAa;UACXN,SAAS,GAAGhI,OAAO,GAAG6B,KAAK,CAAC9D,MAAT,GAAkBiK,SAAS,GAAGnG,KAAK,CAAC9D,MAAvD;UACAA,MAAM,GAAG8D,KAAK,CAAC9D,MAAf;;;YAGEuK,OAAO,IAAIL,UAAX,IAAyBxG,IAAI,KAAK,QAAtC,EAAgD;gBACxC;YAAE1B,IAAF;YAAQhC;WAAd;;;eAGK,IAAP,EAAa;;cAEPgK,MAAM,KAAK,EAAf,EAAmB;;WAAnB,MAEO;YACLG,OAAO;WALE;;;;cAUPF,SAAS,IAAI,CAAjB,EAAoB;kBACZ;cAAEjI,IAAF;cAAQhC;aAAd;WADF,MAEO;;;;;QAKTkK,UAAU,GAAG,KAAb;;;GA1/Bc;;;;;EAmgCpBtD,QAAQ,CACNnF,MADM;QAENC,8EAKI;QAEE;MAAEE,IAAI,GAAG,QAAT;MAAmBD,KAAK,GAAG;QAAUD,OAA3C;QACI;MAAEK,KAAF;MAASF,EAAE,GAAGJ,MAAM,CAACK;QAAcJ,OAAvC;;QAEI,CAACG,EAAL,EAAS;;;;QAIH,GAAGqF,IAAH,IAAW3F,MAAM,CAACuC,KAAP,CAAarC,MAAb,EAAqBI,EAArB,CAAjB;QACM,GAAGsF,EAAH,IAAS5F,MAAM,CAACuC,KAAP,CAAarC,MAAb,EAAqB,EAArB,CAAf;QACM2F,IAAI,GAAS,CAACF,IAAD,EAAOC,EAAP,CAAnB;;QAEI5E,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,KAAmBA,EAAE,CAACnB,MAAH,KAAc,CAArC,EAAwC;YAChC,IAAI4G,KAAJ,oDAAN;;;QAGEvF,KAAK,IAAI,IAAb,EAAmB;UACbQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;YACb,CAAC0F,MAAD,IAAWhG,MAAM,CAACgG,MAAP,CAAc9F,MAAd,EAAsBI,EAAtB,CAAjB;;QACAE,KAAK,GAAGG,CAAC,IAAIqF,MAAM,CAACnD,QAAP,CAAgBoD,QAAhB,CAAyBtF,CAAzB,CAAb;OAFF,MAGO;QACLH,KAAK,GAAG,MAAM,IAAd;;;;QAIE,GAAG6E,QAAH,IAAerF,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;MACxCQ,OAAO,EAAE,IAD+B;MAExCJ,EAAE,EAAEuF,IAFoC;MAGxCrF,KAHwC;MAIxCH,IAJwC;MAKxCD;KALmB,CAArB;WAQOiF,QAAP;GA5iCkB;;;;;EAmjCpB1D,KAAK,CAACzB,MAAD,EAAiBI,EAAjB,EAA+BsF,EAA/B;QACC1B,KAAK,CAACC,OAAN,CAAc7D,EAAd,KAAqB,CAACsF,EAA1B,EAA8B;aACrBtF,EAAP;;;QAGI2B,KAAK,GAAGjC,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBI,EAArB,CAAd;QACMoB,GAAG,GAAG1B,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmB0F,EAAE,IAAItF,EAAzB,CAAZ;WACO;MAAEgB,MAAM,EAAEW,KAAV;MAAiBR,KAAK,EAAEC;KAA/B;GA1jCkB;;;;;;EAkkCpBuH,QAAQ,CACN/I,MADM,EAENyB,KAFM;QAGNxB,8EAEI;QAEE;MAAE2H,QAAQ,GAAG;QAAc3H,OAAjC;QACM4H,GAAG,GAAa;MACpBC,OAAO,EAAErG,KADW;MAEpBmG,QAFoB;;MAGpBG,KAAK;YACG;UAAED;YAAYD,GAApB;YACMmB,SAAS,GAAGlJ,MAAM,CAACkJ,SAAP,CAAiBhJ,MAAjB,CAAlB;QACAgJ,SAAS,CAACf,MAAV,CAAiBJ,GAAjB;QACAA,GAAG,CAACC,OAAJ,GAAc,IAAd;eACOA,OAAP;;;KARJ;QAYMI,IAAI,GAAGpI,MAAM,CAACkJ,SAAP,CAAiBhJ,MAAjB,CAAb;IACAkI,IAAI,CAACC,GAAL,CAASN,GAAT;WACOA,GAAP;GAxlCkB;;;;;EA+lCpBmB,SAAS,CAAChJ,MAAD;QACHkI,IAAI,GAAGpK,UAAU,CAAC8G,GAAX,CAAe5E,MAAf,CAAX;;QAEI,CAACkI,IAAL,EAAW;MACTA,IAAI,GAAG,IAAIE,GAAJ,EAAP;MACAtK,UAAU,CAACiJ,GAAX,CAAe/G,MAAf,EAAuBkI,IAAvB;;;WAGKA,IAAP;GAvmCkB;;;;;;;;;EAknCpBpE,UAAU,CAAC9D,MAAD,EAAiBiB,GAAjB;IACRjB,MAAM,CAAC8D,UAAP,CAAkB7C,GAAlB;GAnnCkB;;;;;EA0nCpBc,KAAK,CAAC/B,MAAD,EAAiBI,EAAjB;WACIN,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBI,EAArB,EAAyB;MAAEkB,IAAI,EAAE;KAAjC,CAAP;GA3nCkB;;;;;;;;EAqoCpBiH,MAAM,CAACvI,MAAD,EAAiBI,EAAjB;QACEqB,KAAK,GAAG3B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBI,EAArB,CAAd;QACM,CAAC2B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAArB;QACInD,IAAI,GAAG,EAAX;;SAEK,IAAM,CAACgE,IAAD,EAAO/B,IAAP,CAAX,IAA2BT,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;MAC9CI,EAAE,EAAEqB,KAD0C;MAE9CnB,KAAK,EAAEM,IAAI,CAACC;KAFa,CAA3B,EAGI;UACEoI,CAAC,GAAG3G,IAAI,CAAChE,IAAb;;UAEIwC,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkBiB,GAAG,CAACjB,IAAtB,CAAJ,EAAiC;QAC/B0I,CAAC,GAAGA,CAAC,CAAC1J,KAAF,CAAQ,CAAR,EAAWiC,GAAG,CAACjD,MAAf,CAAJ;;;UAGEuC,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkBwB,KAAK,CAACxB,IAAxB,CAAJ,EAAmC;QACjC0I,CAAC,GAAGA,CAAC,CAAC1J,KAAF,CAAQwC,KAAK,CAACxD,MAAd,CAAJ;;;MAGFD,IAAI,IAAI2K,CAAR;;;WAGK3K,IAAP;GA3pCkB;;;;;EAkqCpB4K,SAAS,CAAClJ,MAAD,EAAiBmJ,EAAjB;IACPnJ,MAAM,CAAC2C,QAAP,GAAkByG,iBAAW,CAACpJ,MAAM,CAAC2C,QAAR,CAA7B;QACItC,SAAS,GAAGL,MAAM,CAACK,SAAP,IAAoB+I,iBAAW,CAACpJ,MAAM,CAACK,SAAR,CAA/C;;YAEQ8I,EAAE,CAACE,IAAX;WACO,aAAL;;cACQ;YAAE9I,IAAF;YAAQ+B;cAAS6G,EAAvB;cACMrD,MAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,IAApB,CAAf;cACM+I,KAAK,GAAG/I,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;UACA6G,MAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,KAAvB,EAA8B,CAA9B,EAAiChH,IAAjC;;cAEIjC,SAAJ,EAAe;iBACR,IAAM,CAACgB,KAAD,EAAQJ,GAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,GAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,KAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,aAAL;;cACQ;YAAE5I,IAAI,EAAJA,KAAF;YAAQhC,MAAR;YAAgBD;cAAS6K,EAA/B;;cACM7G,MAAI,GAAGE,IAAI,CAACuC,IAAL,CAAU/E,MAAV,EAAkBO,KAAlB,CAAb;;cACMuB,MAAM,GAAGQ,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmBhB,MAAnB,CAAf;;cACM4C,KAAK,GAAGmB,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,MAAhB,CAAd;;UACA+D,MAAI,CAAChE,IAAL,GAAYwD,MAAM,GAAGxD,IAAT,GAAgB6C,KAA5B;;cAEId,SAAJ,EAAe;iBACR,IAAM,CAACgB,MAAD,EAAQJ,IAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,IAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,MAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,YAAL;;cACQ;YAAE5I,IAAI,EAAJA;cAAS4I,EAAjB;;cACM7G,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACM+E,QAAQ,GAAGxE,IAAI,CAACqE,QAAL,CAAc5E,MAAd,CAAjB;cACM/B,IAAI,GAAGgE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBsF,QAAjB,CAAb;;cACMQ,OAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,MAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;;cAEI2B,IAAI,CAACC,MAAL,CAAYyB,MAAZ,KAAqB1B,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAAzB,EAA4C;YAC1CA,IAAI,CAACF,IAAL,IAAagE,MAAI,CAAChE,IAAlB;WADF,MAEO,IAAI,CAACsC,IAAI,CAACC,MAAL,CAAYyB,MAAZ,CAAD,IAAsB,CAAC1B,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAA3B,EAA8C;YACnDA,IAAI,CAACmE,QAAL,CAAcqC,IAAd,CAAmB,GAAG1C,MAAI,CAACK,QAA3B;WADK,MAEA;kBACC,IAAIkD,KAAJ,4DAC8CtF,MAD9C,gDACwF+B,MADxF,cACgG9D,IADhG,EAAN;;;UAKFsH,OAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,MAAvB,EAA8B,CAA9B;;cAEIjJ,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,WAAL;;cACQ;YAAE5I,IAAI,EAAJA,MAAF;YAAQkJ;cAAYN,EAA1B;;cAEIrI,IAAI,CAAC0E,UAAL,CAAgBjF,MAAhB,EAAsBkJ,OAAtB,CAAJ,EAAoC;kBAC5B,IAAI5D,KAAJ,+BACmBtF,MADnB,4BACyCkJ,OADzC,iDAAN;;;cAKInH,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACMuF,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB,CAXgB;;;;;;;UAmBhB6G,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAvB,EAA8B,CAA9B;;cACMI,QAAQ,GAAG5I,IAAI,CAACoI,SAAL,CAAe3I,MAAf,EAAqB4I,EAArB,CAAjB;cACMQ,SAAS,GAAGnH,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBc,IAAI,CAACgF,MAAL,CAAY4D,QAAZ,CAAjB,CAAlB;cACME,QAAQ,GAAGF,QAAQ,CAACA,QAAQ,CAACzK,MAAT,GAAkB,CAAnB,CAAzB;UAEA0K,SAAS,CAAChH,QAAV,CAAmB4G,MAAnB,CAA0BK,QAA1B,EAAoC,CAApC,EAAuCtH,MAAvC;;cAEIjC,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,aAAL;;cACQ;YAAE5I,IAAI,EAAJA;cAAS4I,EAAjB;cACMG,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;;cACM6G,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;UACAuF,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAvB,EAA8B,CAA9B,EAJkB;;;;cAQdjJ,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;kBAC5CwJ,MAAM,GAAGtF,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAf;;kBAEI9I,SAAS,IAAI,IAAb,IAAqBwJ,MAAM,IAAI,IAAnC,EAAyC;gBACvCxJ,SAAS,CAACY,KAAD,CAAT,GAAiB4I,MAAjB;eADF,MAEO;oBACDrL,KAAiC,SAArC;;oBACIoB,IAAiC,SAArC;;qBAEK,IAAM,CAACa,CAAD,EAAIC,CAAJ,CAAX,IAAqB8B,IAAI,CAACsH,KAAL,CAAW9J,MAAX,CAArB,EAAyC;sBACnCc,IAAI,CAAC0F,OAAL,CAAa9F,CAAb,EAAgBH,MAAhB,MAA0B,CAAC,CAA/B,EAAkC;oBAChC/B,KAAI,GAAG,CAACiC,CAAD,EAAIC,CAAJ,CAAP;mBADF,MAEO;oBACLd,IAAI,GAAG,CAACa,CAAD,EAAIC,CAAJ,CAAP;;;;;oBAKAlC,KAAJ,EAAU;kBACR6C,OAAK,CAACd,IAAN,GAAa/B,KAAI,CAAC,CAAD,CAAjB;kBACA6C,OAAK,CAAC9C,MAAN,GAAeC,KAAI,CAAC,CAAD,CAAJ,CAAQF,IAAR,CAAaW,MAA5B;iBAFF,MAGO,IAAIW,IAAJ,EAAU;kBACfyB,OAAK,CAACd,IAAN,GAAaX,IAAI,CAAC,CAAD,CAAjB;kBACAyB,OAAK,CAAC9C,MAAN,GAAe,CAAf;iBAFK,MAGA;kBACL8B,SAAS,GAAG,IAAZ;;;;;;;;;WASL,aAAL;;cACQ;YAAEE,IAAI,EAAJA,MAAF;YAAQhC,MAAM,EAANA,OAAR;YAAgBD,IAAI,EAAJA;cAAS6K,EAA/B;;cACM7G,MAAI,GAAGE,IAAI,CAACuC,IAAL,CAAU/E,MAAV,EAAkBO,MAAlB,CAAb;;cACMuB,OAAM,GAAGQ,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmBhB,OAAnB,CAAf;;cACM4C,MAAK,GAAGmB,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,OAAM,GAAGD,MAAI,CAACW,MAA9B,CAAd;;UACAqD,MAAI,CAAChE,IAAL,GAAYwD,OAAM,GAAGX,MAArB;;cAEId,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,UAAL;;cACQ;YAAE5I,IAAI,EAAJA,MAAF;YAAQwJ;cAAkBZ,EAAhC;;cAEI5I,MAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;kBACf,IAAI4G,KAAJ,2CAAN;;;cAGIvD,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;eAEK,IAAMU,KAAX,IAAkB8I,aAAlB,EAAiC;gBAC3B9I,KAAG,KAAK,UAAR,IAAsBA,KAAG,KAAK,MAAlC,EAA0C;oBAClC,IAAI4E,KAAJ,4BAA6B5E,KAA7B,2BAAN;;;gBAGIC,KAAK,GAAG6I,aAAa,CAAC9I,KAAD,CAA3B;;gBAEIC,KAAK,IAAI,IAAb,EAAmB;qBACVoB,MAAI,CAACrB,KAAD,CAAX;aADF,MAEO;cACLqB,MAAI,CAACrB,KAAD,CAAJ,GAAYC,KAAZ;;;;;;;WAOD,eAAL;;cACQ;YAAE6I,aAAa,EAAbA;cAAkBZ,EAA1B;;cAEIY,cAAa,IAAI,IAArB,EAA2B;YACzB1J,SAAS,GAAG0J,cAAZ;WADF,MAEO,IAAI1J,SAAS,IAAI,IAAjB,EAAuB;gBACxB,CAAC2D,KAAK,CAACC,OAAN,CAAc8F,cAAd,CAAL,EAAmC;oBAC3B,IAAIlE,KAAJ,6EAC+DmE,IAAI,CAACC,SAAL,CACjEF,cADiE,CAD/D,0CAAN;;;YAOF1J,SAAS,GAAG0J,cAAZ;WATK,MAUA;YACLG,MAAM,CAACC,MAAP,CAAc9J,SAAd,EAAyB0J,cAAzB;;;;;;WAMC,YAAL;;cACQ;YAAExJ,IAAI,EAAJA,MAAF;YAAQ6J,QAAR;YAAkBC;cAAelB,EAAvC;;cAEI5I,MAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;kBACf,IAAI4G,KAAJ,4DAC8CtF,MAD9C,8CAAN;;;cAKI+B,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACMuF,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;cACIqL,OAAJ;;cAEI1J,IAAI,CAACC,MAAL,CAAYyB,MAAZ,CAAJ,EAAuB;gBACfR,QAAM,GAAGQ,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmB6K,QAAnB,CAAf;;gBACMjJ,OAAK,GAAGmB,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB6K,QAAhB,CAAd;;YACA9H,MAAI,CAAChE,IAAL,GAAYwD,QAAZ;YACAwI,OAAO,qBACFhI,MADE,MAED+H,UAFC;cAGL/L,IAAI,EAAE6C;cAHR;WAJF,MASO;gBACCW,QAAM,GAAGQ,MAAI,CAACK,QAAL,CAAcpD,KAAd,CAAoB,CAApB,EAAuB6K,QAAvB,CAAf;;gBACMjJ,OAAK,GAAGmB,MAAI,CAACK,QAAL,CAAcpD,KAAd,CAAoB6K,QAApB,CAAd;;YACA9H,MAAI,CAACK,QAAL,GAAgBb,QAAhB;YAEAwI,OAAO,qBACFhI,MADE,MAED+H,UAFC;cAGL1H,QAAQ,EAAExB;cAHZ;;;UAOF2E,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAK,GAAG,CAA/B,EAAkC,CAAlC,EAAqCgB,OAArC;;cAEIjK,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;;IAQRnJ,MAAM,CAAC2C,QAAP,GAAkB4H,iBAAW,CAACvK,MAAM,CAAC2C,QAAR,CAA7B;;QAEItC,SAAJ,EAAe;MACbL,MAAM,CAACK,SAAP,GAAmBmK,aAAO,CAACnK,SAAD,CAAP,GACdkK,iBAAW,CAAClK,SAAD,CADG,GAEfA,SAFJ;KADF,MAIO;MACLL,MAAM,CAACK,SAAP,GAAmB,IAAnB;;GAv6CgB;;;;;EA+6CpBoK,WAAW,CACTzK,MADS,EAETyB,KAFS;QAGTxB,8EAEI;QAEE;MAAEC,KAAK,GAAG;QAAUD,OAA1B;QACI,CAAC8B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAnB;;QAGIM,KAAK,CAACxD,MAAN,KAAiB,CAAjB,IAAsBiD,GAAG,CAACjD,MAAJ,KAAe,CAArC,IAA0CyF,KAAK,CAAC0G,WAAN,CAAkBjJ,KAAlB,CAA9C,EAAwE;aAC/DA,KAAP;;;QAGIkJ,QAAQ,GAAG7K,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;MACpCI,EAAE,EAAEoB,GADgC;MAEpClB,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB;KAFG,CAAjB;QAIM8E,SAAS,GAAGoF,QAAQ,GAAGA,QAAQ,CAAC,CAAD,CAAX,GAAiB,EAA3C;QACMtI,KAAK,GAAGvC,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqB,EAArB,CAAd;QACM8B,MAAM,GAAG;MAAEV,MAAM,EAAEiB,KAAV;MAAiBd,KAAK,EAAEC;KAAvC;QACIoJ,IAAI,GAAG,IAAX;;SAEK,IAAM,CAACtI,IAAD,EAAO/B,IAAP,CAAX,IAA2BT,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;MAC9CI,EAAE,EAAE0B,MAD0C;MAE9CxB,KAAK,EAAEM,IAAI,CAACC,MAFkC;MAG9CL,OAAO,EAAE,IAHqC;MAI9CN;KAJyB,CAA3B,EAKI;UACE0K,IAAJ,EAAU;QACRA,IAAI,GAAG,KAAP;;;;UAIEtI,IAAI,CAAChE,IAAL,KAAc,EAAd,IAAoBwC,IAAI,CAAC+J,QAAL,CAActK,IAAd,EAAoBgF,SAApB,CAAxB,EAAwD;QACtD/D,GAAG,GAAG;UAAEjB,IAAF;UAAQhC,MAAM,EAAE+D,IAAI,CAAChE,IAAL,CAAUW;SAAhC;;;;;WAKG;MAAEmC,MAAM,EAAEW,KAAV;MAAiBR,KAAK,EAAEC;KAA/B;GAx9CkB;;;;;EA+9CpBsJ,IAAI,CACF9K,MADE;QAEFC,8EAII;WAEGH,MAAM,CAACC,KAAP,CAAaC,MAAb,oBACFC,OADE;MAELK,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC6D,MAAP,CAAc3D,MAAd,EAAsBS,CAAtB;OAFd;GAv+CkB;;;;;EAi/CpBuG,kBAAkB,CAAChH,MAAD,EAAiB+K,EAAjB;QACV7J,KAAK,GAAGpB,MAAM,CAAC6E,aAAP,CAAqB3E,MAArB,CAAd;IACArC,WAAW,CAACoJ,GAAZ,CAAgB/G,MAAhB,EAAwB,KAAxB;IACA+K,EAAE;IACFpN,WAAW,CAACoJ,GAAZ,CAAgB/G,MAAhB,EAAwBkB,KAAxB;IACApB,MAAM,CAAC4G,SAAP,CAAiB1G,MAAjB;;;CAt/CG;;IC/CMsD,OAAO,GAAG;;;;EAKrBC,SAAS,CAACrC,KAAD;WAELuC,aAAa,CAACvC,KAAD,CAAb,IACAsB,IAAI,CAAC0B,UAAL,CAAgBhD,KAAK,CAACyB,QAAtB,CADA,IAEA,CAAC7C,MAAM,CAAC0D,QAAP,CAAgBtC,KAAhB,CAHH;GANmB;;;;;EAiBrB8J,aAAa,CAAC9J,KAAD;WAET4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,MACCA,KAAK,CAACjC,MAAN,KAAiB,CAAjB,IAAsBqE,OAAO,CAACC,SAAR,CAAkBrC,KAAK,CAAC,CAAD,CAAvB,CADvB,CADF;GAlBmB;;;;;;;;EA+BrBmF,OAAO,CAAC3D,OAAD,EAAmBwI,KAAnB;SACA,IAAMjK,GAAX,IAAkBiK,KAAlB,EAAyB;UACnBjK,GAAG,KAAK,UAAZ,EAAwB;;;;UAIpByB,OAAO,CAACzB,GAAD,CAAP,KAAiBiK,KAAK,CAACjK,GAAD,CAA1B,EAAiC;eACxB,KAAP;;;;WAIG,IAAP;;;CA1CG;;ICDMkK,QAAQ,GAAG;;;;EAKtBC,UAAU,CAAClK,KAAD;WACDJ,IAAI,CAAC8E,MAAL,CAAY1E,KAAZ,KAAsBqD,KAAK,CAACmD,OAAN,CAAcxG,KAAd,CAAtB,IAA8C8C,KAAK,CAACC,OAAN,CAAc/C,KAAd,CAArD;;;CANG;AAiBP,IAAa+E,IAAI,GAAG;;;;EAKlBC,MAAM,CAAChF,KAAD;WAEF4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,KAAwBA,KAAK,CAACjC,MAAN,KAAiB,CAAzC,IAA8CiC,KAAK,CAAC+B,KAAN,CAAYnC,IAAI,CAAC8E,MAAjB,CADhD;;;CANG;;ICpBMpD,IAAI,GAAG;;;;EAKlB6I,QAAQ,CAACC,IAAD,EAAa/K,IAAb;QACA+B,IAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe/K,IAAf,CAAb;;QAEIK,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;YACf,IAAIuD,KAAJ,iDACqCtF,IADrC,yDACwF+B,IADxF,EAAN;;;WAKKA,IAAP;GAdgB;;;;;;;;GAwBjBiJ,SAAD,CACED,IADF,EAEE/K,IAFF;QAGEN,8EAEI;;SAEC,IAAMS,CAAX,IAAgBI,IAAI,CAACyK,SAAL,CAAehL,IAAf,EAAqBN,OAArB,CAAhB,EAA+C;UACvCQ,CAAC,GAAG+B,IAAI,CAAC6I,QAAL,CAAcC,IAAd,EAAoB5K,CAApB,CAAV;UACM0G,KAAK,GAAwB,CAAC3G,CAAD,EAAIC,CAAJ,CAAnC;YACM0G,KAAN;;GAlCc;;;;;EA0ClBoE,KAAK,CAACF,IAAD,EAAahC,KAAb;QACC1I,IAAI,CAACC,MAAL,CAAYyK,IAAZ,CAAJ,EAAuB;YACf,IAAIzF,KAAJ,gDACoCmE,IAAI,CAACC,SAAL,CAAeqB,IAAf,CADpC,EAAN;;;QAKIG,CAAC,GAAGH,IAAI,CAAC3I,QAAL,CAAc2G,KAAd,CAAV;;QAEImC,CAAC,IAAI,IAAT,EAAe;YACP,IAAI5F,KAAJ,sCAC2ByD,KAD3B,wBAC+CU,IAAI,CAACC,SAAL,CACjDqB,IADiD,CAD/C,EAAN;;;WAOKG,CAAP;GA3DgB;;;;;GAkEjB9I,QAAD,CACE2I,IADF,EAEE/K,IAFF;QAGEN,8EAEI;QAEE;MAAEO,OAAO,GAAG;QAAUP,OAA5B;QACMoL,QAAQ,GAAG7I,IAAI,CAAC6I,QAAL,CAAcC,IAAd,EAAoB/K,IAApB,CAAjB;QACM;MAAEoC;QAAa0I,QAArB;QACI/B,KAAK,GAAG9I,OAAO,GAAGmC,QAAQ,CAAC1D,MAAT,GAAkB,CAArB,GAAyB,CAA5C;;WAEOuB,OAAO,GAAG8I,KAAK,IAAI,CAAZ,GAAgBA,KAAK,GAAG3G,QAAQ,CAAC1D,MAA/C,EAAuD;UAC/CuM,KAAK,GAAGhJ,IAAI,CAACgJ,KAAL,CAAWH,QAAX,EAAqB/B,KAArB,CAAd;UACMoC,SAAS,GAAGnL,IAAI,CAACoL,MAAL,CAAYrC,KAAZ,CAAlB;YACM,CAACkC,KAAD,EAAQE,SAAR,CAAN;MACApC,KAAK,GAAG9I,OAAO,GAAG8I,KAAK,GAAG,CAAX,GAAeA,KAAK,GAAG,CAAtC;;GAlFc;;;;;EA0FlB7B,MAAM,CAAC6D,IAAD,EAAa/K,IAAb,EAAyBqL,OAAzB;QACElL,CAAC,GAAGI,IAAI,CAAC2G,MAAL,CAAYlH,IAAZ,EAAkBqL,OAAlB,CAAV;QACMnL,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAV;WACO,CAACD,CAAD,EAAIC,CAAJ,CAAP;GA7FgB;;;;;EAoGlBmL,UAAU,CAACP,IAAD,EAAa/K,IAAb;QACF+B,IAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe/K,IAAf,CAAb;;QAEIT,MAAM,CAAC0D,QAAP,CAAgBlB,IAAhB,CAAJ,EAA2B;YACnB,IAAIuD,KAAJ,mDACuCtF,IADvC,kEACmG+B,IADnG,EAAN;;;WAKKA,IAAP;GA7GgB;;;;;GAoHjBwJ,WAAD,CACER,IADF;QAEErL,8EAKI;;SAEC,IAAM,CAACqC,IAAD,EAAO/B,IAAP,CAAX,IAA2BiC,IAAI,CAAC0C,KAAL,CAAWoG,IAAX,EAAiBrL,OAAjB,CAA3B,EAAsD;UAChDM,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;;;cAGf,CAACqD,IAAD,EAAO/B,IAAP,CAAN;;;GAjIY;;;;;;;GA4IjBwL,QAAD,CACET,IADF;QAEErL,8EAKI;;SAEC,IAAM,CAACqC,IAAD,EAAO/B,IAAP,CAAX,IAA2BiC,IAAI,CAAC0C,KAAL,CAAWoG,IAAX,EAAiBrL,OAAjB,CAA3B,EAAsD;UAChDqD,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,CAAJ,EAA6B;cACrB,CAACA,IAAD,EAAO/B,IAAP,CAAN;;;GAvJY;;;;;EAgKlB8B,KAAK,CAACiJ,IAAD,EAAa/K,IAAb;QACGG,CAAC,GAAGH,IAAI,CAAChB,KAAL,EAAV;QACIkB,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAR;;WAEOD,CAAP,EAAU;UACJG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBA,CAAC,CAACkC,QAAF,CAAW1D,MAAX,KAAsB,CAA5C,EAA+C;;OAA/C,MAEO;QACLwB,CAAC,GAAGA,CAAC,CAACkC,QAAF,CAAW,CAAX,CAAJ;QACAjC,CAAC,CAACsE,IAAF,CAAO,CAAP;;;;WAIG,CAACvE,CAAD,EAAIC,CAAJ,CAAP;GA7KgB;;;;;EAoLlB6B,QAAQ,CAAC+I,IAAD,EAAa7J,KAAb;QACFb,IAAI,CAACC,MAAL,CAAYyK,IAAZ,CAAJ,EAAuB;YACf,IAAIzF,KAAJ,iEACqDmE,IAAI,CAACC,SAAL,CACvDqB,IADuD,CADrD,EAAN;;;QAOIU,OAAO,GAAGC,aAAO,CAACX,IAAD,EAAOY,CAAC;UACvB,CAACnK,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAArB;UACM0E,QAAQ,GAAG3D,IAAI,CAAC0C,KAAL,CAAWgH,CAAX,EAAc;QAC7B1L,OAAO,EAAE,IADoB;QAE7B4F,IAAI,EAAE;cAAC,GAAG7F,IAAH,CAAD;iBAAc,CAACyD,KAAK,CAAC+B,QAAN,CAAetE,KAAf,EAAsBlB,IAAtB,CAAf;;OAFS,CAAjB;;WAKK,IAAM,GAAGA,IAAH,CAAX,IAAuB4F,QAAvB,EAAiC;YAC3B,CAACnC,KAAK,CAAC+B,QAAN,CAAetE,KAAf,EAAsBlB,IAAtB,CAAL,EAAkC;cAC1BuF,MAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAYoG,CAAZ,EAAe3L,IAAf,CAAf;cACM+I,KAAK,GAAG/I,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;UACA6G,MAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,KAAvB,EAA8B,CAA9B;;;YAGExI,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkBiB,GAAG,CAACjB,IAAtB,CAAJ,EAAiC;cACzBwE,IAAI,GAAGvC,IAAI,CAACuC,IAAL,CAAUmH,CAAV,EAAa3L,IAAb,CAAb;UACAwE,IAAI,CAACzG,IAAL,GAAYyG,IAAI,CAACzG,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmBiC,GAAG,CAACjD,MAAvB,CAAZ;;;YAGEuC,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkBwB,KAAK,CAACxB,IAAxB,CAAJ,EAAmC;cAC3BwE,KAAI,GAAGvC,IAAI,CAACuC,IAAL,CAAUmH,CAAV,EAAa3L,IAAb,CAAb;;UACAwE,KAAI,CAACzG,IAAL,GAAYyG,KAAI,CAACzG,IAAL,CAAUiB,KAAV,CAAgBwC,KAAK,CAACxD,MAAtB,CAAZ;;;;aAIG2N,CAAC,CAAC7L,SAAT;KAzBqB,CAAvB;WA4BO2L,OAAO,CAACrJ,QAAf;GAzNgB;;;;;;EAiOlBiC,GAAG,CAAC0G,IAAD,EAAa/K,IAAb;QACG+B,IAAI,GAAGgJ,IAAX;;SAEK,IAAIpM,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGqB,IAAI,CAACtB,MAAzB,EAAiCC,CAAC,EAAlC,EAAsC;UAC9BwB,CAAC,GAAGH,IAAI,CAACrB,CAAD,CAAd;;UAEI0B,IAAI,CAACC,MAAL,CAAYyB,IAAZ,KAAqB,CAACA,IAAI,CAACK,QAAL,CAAcjC,CAAd,CAA1B,EAA4C;cACpC,IAAImF,KAAJ,6CACiCtF,IADjC,wBACmDyJ,IAAI,CAACC,SAAL,CACrDqB,IADqD,CADnD,EAAN;;;MAOFhJ,IAAI,GAAGA,IAAI,CAACK,QAAL,CAAcjC,CAAd,CAAP;;;WAGK4B,IAAP;GAlPgB;;;;;EAyPlB6J,GAAG,CAACb,IAAD,EAAa/K,IAAb;QACG+B,IAAI,GAAGgJ,IAAX;;SAEK,IAAIpM,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGqB,IAAI,CAACtB,MAAzB,EAAiCC,CAAC,EAAlC,EAAsC;UAC9BwB,CAAC,GAAGH,IAAI,CAACrB,CAAD,CAAd;;UAEI0B,IAAI,CAACC,MAAL,CAAYyB,IAAZ,KAAqB,CAACA,IAAI,CAACK,QAAL,CAAcjC,CAAd,CAA1B,EAA4C;eACnC,KAAP;;;MAGF4B,IAAI,GAAGA,IAAI,CAACK,QAAL,CAAcjC,CAAd,CAAP;;;WAGK,IAAP;GAtQgB;;;;;EA6QlB0L,MAAM,CAAClL,KAAD;WAEFN,IAAI,CAACC,MAAL,CAAYK,KAAZ,KAAsBoC,OAAO,CAACC,SAAR,CAAkBrC,KAAlB,CAAtB,IAAkDpB,MAAM,CAAC0D,QAAP,CAAgBtC,KAAhB,CADpD;GA9QgB;;;;;EAuRlBgD,UAAU,CAAChD,KAAD;WACD4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,MAAyBA,KAAK,CAACjC,MAAN,KAAiB,CAAjB,IAAsBuD,IAAI,CAAC4J,MAAL,CAAYlL,KAAK,CAAC,CAAD,CAAjB,CAA/C,CAAP;GAxRgB;;;;;EA+RlB4D,IAAI,CAACwG,IAAD,EAAa/K,IAAb;QACIG,CAAC,GAAGH,IAAI,CAAChB,KAAL,EAAV;QACIkB,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAR;;WAEOD,CAAP,EAAU;UACJG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBA,CAAC,CAACkC,QAAF,CAAW1D,MAAX,KAAsB,CAA5C,EAA+C;;OAA/C,MAEO;YACCC,CAAC,GAAGuB,CAAC,CAACkC,QAAF,CAAW1D,MAAX,GAAoB,CAA9B;QACAwB,CAAC,GAAGA,CAAC,CAACkC,QAAF,CAAWzD,CAAX,CAAJ;QACAwB,CAAC,CAACsE,IAAF,CAAO9F,CAAP;;;;WAIG,CAACuB,CAAD,EAAIC,CAAJ,CAAP;GA7SgB;;;;;EAoTlBqE,IAAI,CAACuG,IAAD,EAAa/K,IAAb;QACI+B,IAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe/K,IAAf,CAAb;;QAEI,CAACK,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAL,EAAwB;YAChB,IAAIuD,KAAJ,6CACiCtF,IADjC,qDACgF+B,IADhF,EAAN;;;WAKKA,IAAP;GA7TgB;;;;;;;;GAuUjB3B,MAAD,CACE2K,IADF,EAEE/K,IAFF;QAGEN,8EAEI;;SAEC,IAAMS,CAAX,IAAgBI,IAAI,CAACH,MAAL,CAAYJ,IAAZ,EAAkBN,OAAlB,CAAhB,EAA4C;UACpCQ,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAV;YACM,CAACD,CAAD,EAAIC,CAAJ,CAAN;;GAhVc;;;;;EAwVlB2F,OAAO,CAAC/D,IAAD,EAAa4I,KAAb;WAEF5H,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,KAA2BgB,OAAO,CAAC+C,OAAR,CAAgB/D,IAAhB,EAAsB4I,KAAtB,CAA5B,IACCtK,IAAI,CAACC,MAAL,CAAYyB,IAAZ,KAAqB1B,IAAI,CAACyF,OAAL,CAAa/D,IAAb,EAAmB4I,KAAnB,CAFxB;GAzVgB;;;;;;;GAqWjBhG,KAAD,CACEoG,IADF;QAEErL,8EAKI;QAEE;MAAEmG,IAAF;MAAQ5F,OAAO,GAAG;QAAUP,OAAlC;QACM;MAAEwF,IAAI,GAAG,EAAT;MAAaC;QAAOzF,OAA1B;QACMoM,OAAO,GAAG,IAAIjE,GAAJ,EAAhB;QACI1H,CAAC,GAAS,EAAd;QACID,CAAC,GAAG6K,IAAR;;WAEO,IAAP,EAAa;UACP5F,EAAE,KAAKlF,OAAO,GAAGM,IAAI,CAAC+J,QAAL,CAAcnK,CAAd,EAAiBgF,EAAjB,CAAH,GAA0B5E,IAAI,CAACwL,OAAL,CAAa5L,CAAb,EAAgBgF,EAAhB,CAAtC,CAAN,EAAkE;;;;UAI9D,CAAC2G,OAAO,CAACF,GAAR,CAAY1L,CAAZ,CAAL,EAAqB;cACb,CAACA,CAAD,EAAIC,CAAJ,CAAN;OANS;;;UAWT,CAAC2L,OAAO,CAACF,GAAR,CAAY1L,CAAZ,CAAD,IACA,CAACG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,CADD,IAEAA,CAAC,CAACkC,QAAF,CAAW1D,MAAX,KAAsB,CAFtB,KAGCmH,IAAI,IAAI,IAAR,IAAgBA,IAAI,CAAC,CAAC3F,CAAD,EAAIC,CAAJ,CAAD,CAAJ,KAAiB,KAHlC,CADF,EAKE;QACA2L,OAAO,CAAClE,GAAR,CAAY1H,CAAZ;YACI8L,SAAS,GAAG/L,OAAO,GAAGC,CAAC,CAACkC,QAAF,CAAW1D,MAAX,GAAoB,CAAvB,GAA2B,CAAlD;;YAEI6B,IAAI,CAAC0E,UAAL,CAAgB9E,CAAhB,EAAmB+E,IAAnB,CAAJ,EAA8B;UAC5B8G,SAAS,GAAG9G,IAAI,CAAC/E,CAAC,CAACzB,MAAH,CAAhB;;;QAGFyB,CAAC,GAAGA,CAAC,CAACiL,MAAF,CAASY,SAAT,CAAJ;QACA9L,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAJ;;OAxBS;;;UA6BPA,CAAC,CAACzB,MAAF,KAAa,CAAjB,EAAoB;;OA7BT;;;UAkCP,CAACuB,OAAL,EAAc;YACNiJ,OAAO,GAAG3I,IAAI,CAAClB,IAAL,CAAUc,CAAV,CAAhB;;YAEI8B,IAAI,CAAC2J,GAAL,CAASb,IAAT,EAAe7B,OAAf,CAAJ,EAA6B;UAC3B/I,CAAC,GAAG+I,OAAJ;UACAhJ,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAJ;;;OAvCO;;;UA6CPF,OAAO,IAAIE,CAAC,CAACA,CAAC,CAACzB,MAAF,GAAW,CAAZ,CAAD,KAAoB,CAAnC,EAAsC;YAC9BwK,QAAO,GAAG3I,IAAI,CAACqE,QAAL,CAAczE,CAAd,CAAhB;;QACAA,CAAC,GAAG+I,QAAJ;QACAhJ,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAJ;;OAhDS;;;MAqDXA,CAAC,GAAGI,IAAI,CAACgF,MAAL,CAAYpF,CAAZ,CAAJ;MACAD,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAJ;MACA2L,OAAO,CAAClE,GAAR,CAAY1H,CAAZ;;GA3ac;;;;;EAmblBqF,MAAM,CAACwF,IAAD,EAAa/K,IAAb;QACE8G,UAAU,GAAGvG,IAAI,CAACgF,MAAL,CAAYvF,IAAZ,CAAnB;QACMG,CAAC,GAAG8B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAejE,UAAf,CAAV;;QAEIzG,IAAI,CAACC,MAAL,CAAYH,CAAZ,CAAJ,EAAoB;YACZ,IAAImF,KAAJ,0CAC8BtF,IAD9B,8CAAN;;;WAKKG,CAAP;GA7bgB;;;;;;;;;EAwclB6H,MAAM,CAACjG,IAAD;QACA1B,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;aACdA,IAAI,CAAChE,IAAZ;KADF,MAEO;aACEgE,IAAI,CAACK,QAAL,CAAc6J,GAAd,CAAkBhK,IAAI,CAAC+F,MAAvB,EAA+BkE,IAA/B,CAAoC,EAApC,CAAP;;GA5cc;;;;;GAodjB3C,KAAD,CACEwB,IADF;QAEErL,8EAKI;;SAEC,IAAM,CAACqC,IAAD,EAAO/B,IAAP,CAAX,IAA2BiC,IAAI,CAAC0C,KAAL,CAAWoG,IAAX,EAAiBrL,OAAjB,CAA3B,EAAsD;UAChDW,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;cACf,CAACA,IAAD,EAAO/B,IAAP,CAAN;;;;;CA/dD;;;;;ICiGM4D,SAAS,GAAG;;;;EAKvBuI,eAAe,CAACxL,KAAD;WACNiD,SAAS,CAACwI,WAAV,CAAsBzL,KAAtB,KAAgCA,KAAK,CAACmI,IAAN,CAAWuD,QAAX,CAAoB,OAApB,CAAvC;GANqB;;;;;EAavBD,WAAW,CAACzL,KAAD;QACL,CAACuC,aAAa,CAACvC,KAAD,CAAlB,EAA2B;aAClB,KAAP;;;YAGMA,KAAK,CAACmI,IAAd;WACO,aAAL;eACSvI,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,KAA2BiC,IAAI,CAAC4J,MAAL,CAAYlL,KAAK,CAACoB,IAAlB,CAAlC;;WACG,aAAL;eAEI,OAAOpB,KAAK,CAAC3C,MAAb,KAAwB,QAAxB,IACA,OAAO2C,KAAK,CAAC5C,IAAb,KAAsB,QADtB,IAEAwC,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,CAHF;;WAKG,YAAL;eAEI,OAAOW,KAAK,CAACkJ,QAAb,KAA0B,QAA1B,KACC,OAAOlJ,KAAK,CAACU,MAAb,KAAwB,QAAxB,IAAoCV,KAAK,CAACU,MAAN,KAAiB,IADtD,KAEAd,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,CAFA,IAGAkD,aAAa,CAACvC,KAAK,CAACmJ,UAAP,CAJf;;WAMG,WAAL;eACSvJ,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,KAA2BO,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACuI,OAAlB,CAAlC;;WACG,aAAL;eACS3I,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,KAA2BiC,IAAI,CAAC4J,MAAL,CAAYlL,KAAK,CAACoB,IAAlB,CAAlC;;WACG,aAAL;eAEI,OAAOpB,KAAK,CAAC3C,MAAb,KAAwB,QAAxB,IACA,OAAO2C,KAAK,CAAC5C,IAAb,KAAsB,QADtB,IAEAwC,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,CAHF;;WAKG,UAAL;eAEIO,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,KACAkD,aAAa,CAACvC,KAAK,CAACmJ,UAAP,CADb,IAEA5G,aAAa,CAACvC,KAAK,CAAC6I,aAAP,CAHf;;WAKG,eAAL;eAEK7I,KAAK,CAACmJ,UAAN,KAAqB,IAArB,IAA6BrG,KAAK,CAACC,OAAN,CAAc/C,KAAK,CAAC6I,aAApB,CAA9B,IACC7I,KAAK,CAAC6I,aAAN,KAAwB,IAAxB,IAAgC/F,KAAK,CAACC,OAAN,CAAc/C,KAAK,CAACmJ,UAApB,CADjC,IAEC5G,aAAa,CAACvC,KAAK,CAACmJ,UAAP,CAAb,IACC5G,aAAa,CAACvC,KAAK,CAAC6I,aAAP,CAJjB;;WAMG,YAAL;eAEIjJ,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,KACA,OAAOW,KAAK,CAACkJ,QAAb,KAA0B,QAD1B,KAEC,OAAOlJ,KAAK,CAACU,MAAb,KAAwB,QAAxB,IAAoCV,KAAK,CAACU,MAAN,KAAiB,IAFtD,KAGA6B,aAAa,CAACvC,KAAK,CAACmJ,UAAP,CAJf;;;eAOO,KAAP;;GAjEiB;;;;;EAyEvBjG,eAAe,CAAClD,KAAD;WAEX4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,MACCA,KAAK,CAACjC,MAAN,KAAiB,CAAjB,IAAsBkF,SAAS,CAACwI,WAAV,CAAsBzL,KAAK,CAAC,CAAD,CAA3B,CADvB,CADF;GA1EqB;;;;;EAoFvB2L,oBAAoB,CAAC3L,KAAD;WACXiD,SAAS,CAACwI,WAAV,CAAsBzL,KAAtB,KAAgCA,KAAK,CAACmI,IAAN,CAAWuD,QAAX,CAAoB,YAApB,CAAvC;GArFqB;;;;;EA4FvBE,eAAe,CAAC5L,KAAD;WACNiD,SAAS,CAACwI,WAAV,CAAsBzL,KAAtB,KAAgCA,KAAK,CAACmI,IAAN,CAAWuD,QAAX,CAAoB,OAApB,CAAvC;GA7FqB;;;;;;EAqGvBG,OAAO,CAAC5D,EAAD;YACGA,EAAE,CAACE,IAAX;WACO,aAAL;;qCACcF,EAAZ;YAAgBE,IAAI,EAAE;;;;WAGnB,aAAL;;qCACcF,EAAZ;YAAgBE,IAAI,EAAE;;;;WAGnB,YAAL;;qCACcF,EAAZ;YAAgBE,IAAI,EAAE,YAAtB;YAAoC9I,IAAI,EAAEO,IAAI,CAACqE,QAAL,CAAcgE,EAAE,CAAC5I,IAAjB;;;;WAGvC,WAAL;;cACQ;YAAEkJ,OAAF;YAAWlJ;cAAS4I,EAA1B,CADgB;;cAIZrI,IAAI,CAACC,MAAL,CAAY0I,OAAZ,EAAqBlJ,IAArB,CAAJ,EAAgC;mBACvB4I,EAAP;WALc;;;;;cAWV6D,WAAW,GAAGlM,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,CAApB;cACM8D,cAAc,GAAGnM,IAAI,CAACoI,SAAL,CAAepI,IAAI,CAAClB,IAAL,CAAUW,IAAV,CAAf,EAAgC4I,EAAhC,CAAvB;qCACYA,EAAZ;YAAgB5I,IAAI,EAAEyM,WAAtB;YAAmCvD,OAAO,EAAEwD;;;;WAGzC,aAAL;;qCACc9D,EAAZ;YAAgBE,IAAI,EAAE;;;;WAGnB,aAAL;;qCACcF,EAAZ;YAAgBE,IAAI,EAAE;;;;WAGnB,UAAL;;cACQ;YAAEgB,UAAF;YAAcN;cAAkBZ,EAAtC;qCACYA,EAAZ;YAAgBkB,UAAU,EAAEN,aAA5B;YAA2CA,aAAa,EAAEM;;;;WAGvD,eAAL;;cACQ;YAAEA,UAAU,EAAVA,WAAF;YAAcN,aAAa,EAAbA;cAAkBZ,EAAtC;;cAEIkB,WAAU,IAAI,IAAlB,EAAwB;uCAEjBlB,EADL;cAEEkB,UAAU,EAAEN,cAFd;cAGEA,aAAa,EAAE;;WAJnB,MAMO,IAAIA,cAAa,IAAI,IAArB,EAA2B;uCAE3BZ,EADL;cAEEkB,UAAU,EAAE,IAFd;cAGEN,aAAa,EAAEM;;WAJZ,MAMA;uCACOlB,EAAZ;cAAgBkB,UAAU,EAAEN,cAA5B;cAA2CA,aAAa,EAAEM;;;;;WAIzD,YAAL;;qCACclB,EAAZ;YAAgBE,IAAI,EAAE,YAAtB;YAAoC9I,IAAI,EAAEO,IAAI,CAAClB,IAAL,CAAUuJ,EAAE,CAAC5I,IAAb;;;;;;CArK3C;;IChGMO,IAAI,GAAG;;;;;;;EAQlByK,SAAS,CAAChL,IAAD;QAAaN,8EAAiC;QAC/C;MAAEO,OAAO,GAAG;QAAUP,OAA5B;QACIiN,KAAK,GAAGpM,IAAI,CAACH,MAAL,CAAYJ,IAAZ,EAAkBN,OAAlB,CAAZ;;QAEIO,OAAJ,EAAa;MACX0M,KAAK,GAAGA,KAAK,CAAC3N,KAAN,CAAY,CAAZ,CAAR;KADF,MAEO;MACL2N,KAAK,GAAGA,KAAK,CAAC3N,KAAN,CAAY,CAAZ,EAAe,CAAC,CAAhB,CAAR;;;WAGK2N,KAAP;GAlBgB;;;;;EAyBlBzF,MAAM,CAAClH,IAAD,EAAaqL,OAAb;QACEnE,MAAM,GAAS,EAArB;;SAEK,IAAIvI,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGqB,IAAI,CAACtB,MAAT,IAAmBC,CAAC,GAAG0M,OAAO,CAAC3M,MAA/C,EAAuDC,CAAC,EAAxD,EAA4D;UACpDiO,EAAE,GAAG5M,IAAI,CAACrB,CAAD,CAAf;UACMkO,EAAE,GAAGxB,OAAO,CAAC1M,CAAD,CAAlB;;UAEIiO,EAAE,KAAKC,EAAX,EAAe;;;;MAIf3F,MAAM,CAACzC,IAAP,CAAYmI,EAAZ;;;WAGK1F,MAAP;GAvCgB;;;;;;;;;;EAmDlBjB,OAAO,CAACjG,IAAD,EAAaqL,OAAb;QACCyB,GAAG,GAAGC,IAAI,CAACD,GAAL,CAAS9M,IAAI,CAACtB,MAAd,EAAsB2M,OAAO,CAAC3M,MAA9B,CAAZ;;SAEK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGmO,GAApB,EAAyBnO,CAAC,EAA1B,EAA8B;UACxBqB,IAAI,CAACrB,CAAD,CAAJ,GAAU0M,OAAO,CAAC1M,CAAD,CAArB,EAA0B,OAAO,CAAC,CAAR;UACtBqB,IAAI,CAACrB,CAAD,CAAJ,GAAU0M,OAAO,CAAC1M,CAAD,CAArB,EAA0B,OAAO,CAAP;;;WAGrB,CAAP;GA3DgB;;;;;EAkElBqO,SAAS,CAAChN,IAAD,EAAaqL,OAAb;QACD1M,CAAC,GAAGqB,IAAI,CAACtB,MAAL,GAAc,CAAxB;QACMuO,EAAE,GAAGjN,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAcL,CAAd,CAAX;QACMuO,EAAE,GAAG7B,OAAO,CAACrM,KAAR,CAAc,CAAd,EAAiBL,CAAjB,CAAX;QACMiO,EAAE,GAAG5M,IAAI,CAACrB,CAAD,CAAf;QACMkO,EAAE,GAAGxB,OAAO,CAAC1M,CAAD,CAAlB;WACO4B,IAAI,CAACC,MAAL,CAAYyM,EAAZ,EAAgBC,EAAhB,KAAuBN,EAAE,GAAGC,EAAnC;GAxEgB;;;;;EA+ElBM,MAAM,CAACnN,IAAD,EAAaqL,OAAb;QACE1M,CAAC,GAAGqB,IAAI,CAACtB,MAAf;QACMuO,EAAE,GAAGjN,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAcL,CAAd,CAAX;QACMuO,EAAE,GAAG7B,OAAO,CAACrM,KAAR,CAAc,CAAd,EAAiBL,CAAjB,CAAX;WACO4B,IAAI,CAACC,MAAL,CAAYyM,EAAZ,EAAgBC,EAAhB,CAAP;GAnFgB;;;;;EA0FlBE,UAAU,CAACpN,IAAD,EAAaqL,OAAb;QACF1M,CAAC,GAAGqB,IAAI,CAACtB,MAAL,GAAc,CAAxB;QACMuO,EAAE,GAAGjN,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAcL,CAAd,CAAX;QACMuO,EAAE,GAAG7B,OAAO,CAACrM,KAAR,CAAc,CAAd,EAAiBL,CAAjB,CAAX;QACMiO,EAAE,GAAG5M,IAAI,CAACrB,CAAD,CAAf;QACMkO,EAAE,GAAGxB,OAAO,CAAC1M,CAAD,CAAlB;WACO4B,IAAI,CAACC,MAAL,CAAYyM,EAAZ,EAAgBC,EAAhB,KAAuBN,EAAE,GAAGC,EAAnC;GAhGgB;;;;;EAuGlBrM,MAAM,CAACR,IAAD,EAAaqL,OAAb;WAEFrL,IAAI,CAACtB,MAAL,KAAgB2M,OAAO,CAAC3M,MAAxB,IAAkCsB,IAAI,CAAC0C,KAAL,CAAW,CAACxC,CAAD,EAAIvB,CAAJ,KAAUuB,CAAC,KAAKmL,OAAO,CAAC1M,CAAD,CAAlC,CADpC;GAxGgB;;;;;EAiHlBoN,OAAO,CAAC/L,IAAD,EAAaqL,OAAb;WACE9K,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CAAvC;GAlHgB;;;;;EAyHlBpG,UAAU,CAACjF,IAAD,EAAaqL,OAAb;WACDrL,IAAI,CAACtB,MAAL,GAAc2M,OAAO,CAAC3M,MAAtB,IAAgC6B,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CAAvE;GA1HgB;;;;;EAiIlBf,QAAQ,CAACtK,IAAD,EAAaqL,OAAb;WACC9K,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CAAC,CAAxC;GAlIgB;;;;;EAyIlBgC,OAAO,CAACrN,IAAD,EAAaqL,OAAb;WAEHrL,IAAI,CAACtB,MAAL,KAAgB2M,OAAO,CAAC3M,MAAR,GAAiB,CAAjC,IAAsC6B,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CADxE;GA1IgB;;;;;EAmJlBiC,QAAQ,CAACtN,IAAD,EAAaqL,OAAb;WACCrL,IAAI,CAACtB,MAAL,IAAe2M,OAAO,CAAC3M,MAAvB,IAAiC6B,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CAAxE;GApJgB;;;;;EA2JlBkC,YAAY,CAACvN,IAAD,EAAaqL,OAAb;WACHrL,IAAI,CAACtB,MAAL,GAAc2M,OAAO,CAAC3M,MAAtB,IAAgC6B,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CAAvE;GA5JgB;;;;;EAmKlBmC,QAAQ,CAACxN,IAAD,EAAaqL,OAAb;WAEJrL,IAAI,CAACtB,MAAL,GAAc,CAAd,KAAoB2M,OAAO,CAAC3M,MAA5B,IAAsC6B,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CADxE;GApKgB;;;;;EA6KlBhG,MAAM,CAAC1E,KAAD;WAEF4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,MACCA,KAAK,CAACjC,MAAN,KAAiB,CAAjB,IAAsB,OAAOiC,KAAK,CAAC,CAAD,CAAZ,KAAoB,QAD3C,CADF;GA9KgB;;;;;EAwLlB8M,SAAS,CAACzN,IAAD,EAAaqL,OAAb;QACHrL,IAAI,CAACtB,MAAL,KAAgB2M,OAAO,CAAC3M,MAA5B,EAAoC;aAC3B,KAAP;;;QAGIuO,EAAE,GAAGjN,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAc,CAAC,CAAf,CAAX;QACMkO,EAAE,GAAG7B,OAAO,CAACrM,KAAR,CAAc,CAAd,EAAiB,CAAC,CAAlB,CAAX;QACM0O,EAAE,GAAG1N,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAf;QACMiP,EAAE,GAAGtC,OAAO,CAACA,OAAO,CAAC3M,MAAR,GAAiB,CAAlB,CAAlB;WACOgP,EAAE,KAAKC,EAAP,IAAapN,IAAI,CAACC,MAAL,CAAYyM,EAAZ,EAAgBC,EAAhB,CAApB;GAjMgB;;;;;;;;;EA4MlB9M,MAAM,CACJJ,IADI;QAEJN,8EAEI;QAEE;MAAEO,OAAO,GAAG;QAAUP,OAA5B;QACMkO,IAAI,GAAW,EAArB;;SAEK,IAAIjP,CAAC,GAAG,CAAb,EAAgBA,CAAC,IAAIqB,IAAI,CAACtB,MAA1B,EAAkCC,CAAC,EAAnC,EAAuC;MACrCiP,IAAI,CAACnJ,IAAL,CAAUzE,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAcL,CAAd,CAAV;;;QAGEsB,OAAJ,EAAa;MACX2N,IAAI,CAAC3N,OAAL;;;WAGK2N,IAAP;GA7NgB;;;;;EAoOlBvO,IAAI,CAACW,IAAD;QACEA,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;YACf,IAAI4G,KAAJ,oDACwCtF,IADxC,sCAAN;;;QAKIuE,IAAI,GAAGvE,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAjB;WACOsB,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAc,CAAC,CAAf,EAAkBoM,MAAlB,CAAyB7G,IAAI,GAAG,CAAhC,CAAP;GA5OgB;;;;;EAmPlBgB,MAAM,CAACvF,IAAD;QACAA,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;YACf,IAAI4G,KAAJ,wDAA0DtF,IAA1D,QAAN;;;WAGKA,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAc,CAAC,CAAf,CAAP;GAxPgB;;;;;EA+PlB4F,QAAQ,CAAC5E,IAAD;QACFA,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;YACf,IAAI4G,KAAJ,wDAC4CtF,IAD5C,0CAAN;;;QAKIuE,IAAI,GAAGvE,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAjB;;QAEI6F,IAAI,IAAI,CAAZ,EAAe;YACP,IAAIe,KAAJ,+DACmDtF,IADnD,oDAAN;;;WAKKA,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAc,CAAC,CAAf,EAAkBoM,MAAlB,CAAyB7G,IAAI,GAAG,CAAhC,CAAP;GA9QgB;;;;;EAqRlBsJ,QAAQ,CAAC7N,IAAD,EAAa8K,QAAb;QACF,CAACvK,IAAI,CAAC0E,UAAL,CAAgB6F,QAAhB,EAA0B9K,IAA1B,CAAD,IAAoC,CAACO,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkB8K,QAAlB,CAAzC,EAAsE;YAC9D,IAAIxF,KAAJ,4CACgCtF,IADhC,gCAC0D8K,QAD1D,sDAAN;;;WAKK9K,IAAI,CAAChB,KAAL,CAAW8L,QAAQ,CAACpM,MAApB,CAAP;GA5RgB;;;;;EAmSlBiK,SAAS,CACP3I,IADO,EAEP8N,SAFO;QAGPpO,8EAAwD;WAEjDgM,aAAO,CAAC1L,IAAD,EAAOG,CAAC;UACd;QAAEkH,QAAQ,GAAG;UAAc3H,OAAjC;;UAGIM,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;;;;cAIfoP,SAAS,CAAChF,IAAlB;aACO,aAAL;;gBACQ;cAAE9I,IAAI,EAAE4I;gBAAOkF,SAArB;;gBAGEvN,IAAI,CAACC,MAAL,CAAYoI,EAAZ,EAAgBzI,CAAhB,KACAI,IAAI,CAAC6M,UAAL,CAAgBxE,EAAhB,EAAoBzI,CAApB,CADA,IAEAI,IAAI,CAAC0E,UAAL,CAAgB2D,EAAhB,EAAoBzI,CAApB,CAHF,EAIE;cACAA,CAAC,CAACyI,EAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;;;;;;aAMC,aAAL;;gBACQ;cAAEsB,IAAI,EAAE4I;gBAAOkF,SAArB;;gBAEIvN,IAAI,CAACC,MAAL,CAAYoI,GAAZ,EAAgBzI,CAAhB,KAAsBI,IAAI,CAAC0E,UAAL,CAAgB2D,GAAhB,EAAoBzI,CAApB,CAA1B,EAAkD;qBACzC,IAAP;aADF,MAEO,IAAII,IAAI,CAAC6M,UAAL,CAAgBxE,GAAhB,EAAoBzI,CAApB,CAAJ,EAA4B;cACjCA,CAAC,CAACyI,GAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;;;;;;aAMC,YAAL;;gBACQ;cAAEsB,IAAI,EAAE4I,IAAR;cAAYiB;gBAAaiE,SAA/B;;gBAEIvN,IAAI,CAACC,MAAL,CAAYoI,IAAZ,EAAgBzI,CAAhB,KAAsBI,IAAI,CAAC6M,UAAL,CAAgBxE,IAAhB,EAAoBzI,CAApB,CAA1B,EAAkD;cAChDA,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;aADF,MAEO,IAAI6B,IAAI,CAAC0E,UAAL,CAAgB2D,IAAhB,EAAoBzI,CAApB,CAAJ,EAA4B;cACjCA,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;cACAyB,CAAC,CAACyI,IAAE,CAAClK,MAAJ,CAAD,IAAgBmL,QAAhB;;;;;;aAMC,YAAL;;gBACQ;cAAE7J,IAAI,EAAE4I,IAAR;cAAYiB,QAAQ,EAARA;gBAAaiE,SAA/B;;gBAEIvN,IAAI,CAACC,MAAL,CAAYoI,IAAZ,EAAgBzI,CAAhB,CAAJ,EAAwB;kBAClBkH,QAAQ,KAAK,SAAjB,EAA4B;gBAC1BlH,CAAC,CAACA,CAAC,CAACzB,MAAF,GAAW,CAAZ,CAAD,IAAmB,CAAnB;eADF,MAEO,IAAI2I,QAAQ,KAAK,UAAjB,EAA6B,CAA7B,MAEA;uBACE,IAAP;;aANJ,MAQO,IAAI9G,IAAI,CAAC6M,UAAL,CAAgBxE,IAAhB,EAAoBzI,CAApB,CAAJ,EAA4B;cACjCA,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;aADK,MAEA,IAAI6B,IAAI,CAAC0E,UAAL,CAAgB2D,IAAhB,EAAoBzI,CAApB,KAA0BH,IAAI,CAAC4I,IAAE,CAAClK,MAAJ,CAAJ,IAAmBmL,SAAjD,EAA2D;cAChE1J,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;cACAyB,CAAC,CAACyI,IAAE,CAAClK,MAAJ,CAAD,IAAgBmL,SAAhB;;;;;;aAMC,WAAL;;gBACQ;cAAE7J,IAAI,EAAE4I,IAAR;cAAYM,OAAO,EAAE6E;gBAAQD,SAAnC,CADgB;;gBAIZvN,IAAI,CAACC,MAAL,CAAYoI,IAAZ,EAAgBmF,GAAhB,CAAJ,EAA0B;;;;gBAItBxN,IAAI,CAAC0E,UAAL,CAAgB2D,IAAhB,EAAoBzI,CAApB,KAA0BI,IAAI,CAACC,MAAL,CAAYoI,IAAZ,EAAgBzI,CAAhB,CAA9B,EAAkD;kBAC1C6N,IAAI,GAAGD,GAAG,CAAC/O,KAAJ,EAAb;;kBAEIuB,IAAI,CAAC6M,UAAL,CAAgBxE,IAAhB,EAAoBmF,GAApB,KAA4BnF,IAAE,CAAClK,MAAH,GAAYqP,GAAG,CAACrP,MAAhD,EAAwD;oBAChDC,CAAC,GAAGoO,IAAI,CAACD,GAAL,CAASiB,GAAG,CAACrP,MAAb,EAAqBkK,IAAE,CAAClK,MAAxB,IAAkC,CAA5C;gBACAsP,IAAI,CAACrP,CAAD,CAAJ,IAAW,CAAX;;;qBAGKqP,IAAI,CAAC5C,MAAL,CAAYjL,CAAC,CAACnB,KAAF,CAAQ4J,IAAE,CAAClK,MAAX,CAAZ,CAAP;aARF,MASO,IACL6B,IAAI,CAAC6M,UAAL,CAAgBW,GAAhB,EAAqB5N,CAArB,KACAI,IAAI,CAACC,MAAL,CAAYuN,GAAZ,EAAiB5N,CAAjB,CADA,IAEAI,IAAI,CAAC0E,UAAL,CAAgB8I,GAAhB,EAAqB5N,CAArB,CAHK,EAIL;kBACII,IAAI,CAAC6M,UAAL,CAAgBxE,IAAhB,EAAoBzI,CAApB,CAAJ,EAA4B;gBAC1BA,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;;;cAGFyB,CAAC,CAAC4N,GAAG,CAACrP,MAAJ,GAAa,CAAd,CAAD,IAAqB,CAArB;aATK,MAUA,IAAI6B,IAAI,CAAC6M,UAAL,CAAgBxE,IAAhB,EAAoBzI,CAApB,CAAJ,EAA4B;kBAC7BI,IAAI,CAACC,MAAL,CAAYuN,GAAZ,EAAiB5N,CAAjB,CAAJ,EAAyB;gBACvBA,CAAC,CAAC4N,GAAG,CAACrP,MAAJ,GAAa,CAAd,CAAD,IAAqB,CAArB;;;cAGFyB,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;;;;;;KArGM,CAAd;;;CAxSG;;ICGMuP,OAAO,GAAG;;;;EAKrBtF,SAAS,CAACrB,GAAD,EAAesB,EAAf;QACD;MAAErB,OAAF;MAAWF;QAAaC,GAA9B;;QAEIC,OAAO,IAAI,IAAf,EAAqB;;;;QAIfvH,IAAI,GAAGO,IAAI,CAACoI,SAAL,CAAepB,OAAf,EAAwBqB,EAAxB,EAA4B;MAAEvB;KAA9B,CAAb;IACAC,GAAG,CAACC,OAAJ,GAAcvH,IAAd;;QAEIA,IAAI,IAAI,IAAZ,EAAkB;MAChBsH,GAAG,CAACE,KAAJ;;;;CAhBC;;;;;ICGMxD,KAAK,GAAG;;;;;EAMnBiC,OAAO,CAACnF,KAAD,EAAeuK,OAAf;QACC/B,MAAM,GAAG/I,IAAI,CAAC0F,OAAL,CAAanF,KAAK,CAACd,IAAnB,EAAyBqL,OAAO,CAACrL,IAAjC,CAAf;;QAEIsJ,MAAM,KAAK,CAAf,EAAkB;UACZxI,KAAK,CAAC9C,MAAN,GAAeqN,OAAO,CAACrN,MAA3B,EAAmC,OAAO,CAAC,CAAR;UAC/B8C,KAAK,CAAC9C,MAAN,GAAeqN,OAAO,CAACrN,MAA3B,EAAmC,OAAO,CAAP;aAC5B,CAAP;;;WAGKsL,MAAP;GAfiB;;;;;EAsBnByC,OAAO,CAACjL,KAAD,EAAeuK,OAAf;WACErH,KAAK,CAACiC,OAAN,CAAcnF,KAAd,EAAqBuK,OAArB,MAAkC,CAAzC;GAvBiB;;;;;EA8BnBf,QAAQ,CAACxJ,KAAD,EAAeuK,OAAf;WACCrH,KAAK,CAACiC,OAAN,CAAcnF,KAAd,EAAqBuK,OAArB,MAAkC,CAAC,CAA1C;GA/BiB;;;;;EAsCnB7K,MAAM,CAACM,KAAD,EAAeuK,OAAf;;WAGFvK,KAAK,CAAC9C,MAAN,KAAiBqN,OAAO,CAACrN,MAAzB,IAAmCuC,IAAI,CAACC,MAAL,CAAYM,KAAK,CAACd,IAAlB,EAAwBqL,OAAO,CAACrL,IAAhC,CADrC;GAxCiB;;;;;EAiDnBmH,OAAO,CAACxG,KAAD;WAEHuC,aAAa,CAACvC,KAAD,CAAb,IACA,OAAOA,KAAK,CAAC3C,MAAb,KAAwB,QADxB,IAEAuC,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,CAHF;GAlDiB;;;;;EA6DnB2I,SAAS,CACP7H,KADO,EAEP8H,EAFO;QAGPlJ,8EAAwD;WAEjDgM,aAAO,CAAC5K,KAAD,EAAQX,CAAC;UACf;QAAEkH,QAAQ,GAAG;UAAc3H,OAAjC;UACM;QAAEM,IAAF;QAAQhC;UAAWmC,CAAzB;;cAEQyI,EAAE,CAACE,IAAX;aACO,aAAL;aACK,WAAL;;YACE3I,CAAC,CAACH,IAAF,GAASO,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,EAAyBlJ,OAAzB,CAAT;;;;aAIG,aAAL;;gBACMa,IAAI,CAACC,MAAL,CAAYoI,EAAE,CAAC5I,IAAf,EAAqBA,IAArB,KAA8B4I,EAAE,CAAC5K,MAAH,IAAaA,MAA/C,EAAuD;cACrDmC,CAAC,CAACnC,MAAF,IAAY4K,EAAE,CAAC7K,IAAH,CAAQW,MAApB;;;;;;aAMC,YAAL;;gBACM6B,IAAI,CAACC,MAAL,CAAYoI,EAAE,CAAC5I,IAAf,EAAqBA,IAArB,CAAJ,EAAgC;cAC9BG,CAAC,CAACnC,MAAF,IAAY4K,EAAE,CAACiB,QAAf;;;YAGF1J,CAAC,CAACH,IAAF,GAASO,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,EAAyBlJ,OAAzB,CAAT;;;;aAIG,aAAL;;gBACMa,IAAI,CAACC,MAAL,CAAYoI,EAAE,CAAC5I,IAAf,EAAqBA,IAArB,KAA8B4I,EAAE,CAAC5K,MAAH,IAAaA,MAA/C,EAAuD;cACrDmC,CAAC,CAACnC,MAAF,IAAY+O,IAAI,CAACD,GAAL,CAAS9O,MAAM,GAAG4K,EAAE,CAAC5K,MAArB,EAA6B4K,EAAE,CAAC7K,IAAH,CAAQW,MAArC,CAAZ;;;;;;aAMC,aAAL;;gBACM6B,IAAI,CAACC,MAAL,CAAYoI,EAAE,CAAC5I,IAAf,EAAqBA,IAArB,KAA8BO,IAAI,CAAC0E,UAAL,CAAgB2D,EAAE,CAAC5I,IAAnB,EAAyBA,IAAzB,CAAlC,EAAkE;qBACzD,IAAP;;;YAGFG,CAAC,CAACH,IAAF,GAASO,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,EAAyBlJ,OAAzB,CAAT;;;;aAIG,YAAL;;gBACMa,IAAI,CAACC,MAAL,CAAYoI,EAAE,CAAC5I,IAAf,EAAqBA,IAArB,CAAJ,EAAgC;kBAC1B4I,EAAE,CAACiB,QAAH,KAAgB7L,MAAhB,IAA0BqJ,QAAQ,IAAI,IAA1C,EAAgD;uBACvC,IAAP;eADF,MAEO,IACLuB,EAAE,CAACiB,QAAH,GAAc7L,MAAd,IACC4K,EAAE,CAACiB,QAAH,KAAgB7L,MAAhB,IAA0BqJ,QAAQ,KAAK,SAFnC,EAGL;gBACAlH,CAAC,CAACnC,MAAF,IAAY4K,EAAE,CAACiB,QAAf;gBAEA1J,CAAC,CAACH,IAAF,GAASO,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,sBACJlJ,OADI;kBAEP2H,QAAQ,EAAE;mBAFZ;;aATJ,MAcO;cACLlH,CAAC,CAACH,IAAF,GAASO,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,EAAyBlJ,OAAzB,CAAT;;;;;;KA7DM,CAAd;;;CAlEG;;ICHMwO,QAAQ,GAAG;;;;EAKtBvF,SAAS,CAACrB,GAAD,EAAgBsB,EAAhB;QACD;MAAErB,OAAF;MAAWF;QAAaC,GAA9B;;QAEIC,OAAO,IAAI,IAAf,EAAqB;;;;QAIfzG,KAAK,GAAGkD,KAAK,CAAC2E,SAAN,CAAgBpB,OAAhB,EAAyBqB,EAAzB,EAA6B;MAAEvB;KAA/B,CAAd;IACAC,GAAG,CAACC,OAAJ,GAAczG,KAAd;;QAEIA,KAAK,IAAI,IAAb,EAAmB;MACjBwG,GAAG,CAACE,KAAJ;;;;CAhBC;;;;;ICEM/D,KAAK,GAAG;;;;;EAMnB5B,KAAK,CACHX,KADG;QAEHxB,8EAEI;QAEE;MAAEO,OAAO,GAAG;QAAUP,OAA5B;QACM;MAAEmB,MAAF;MAAUG;QAAUE,KAA1B;WACOuC,KAAK,CAAC0K,UAAN,CAAiBjN,KAAjB,MAA4BjB,OAA5B,GACH,CAACY,MAAD,EAASG,KAAT,CADG,GAEH,CAACA,KAAD,EAAQH,MAAR,CAFJ;GAdiB;;;;;EAuBnBI,GAAG,CAACC,KAAD;QACK,GAAGD,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAhB;WACOD,GAAP;GAzBiB;;;;;EAgCnBT,MAAM,CAACU,KAAD,EAAemK,OAAf;WAEFrH,KAAK,CAACxD,MAAN,CAAaU,KAAK,CAACL,MAAnB,EAA2BwK,OAAO,CAACxK,MAAnC,KACAmD,KAAK,CAACxD,MAAN,CAAaU,KAAK,CAACF,KAAnB,EAA0BqK,OAAO,CAACrK,KAAlC,CAFF;GAjCiB;;;;;EA2CnBwE,QAAQ,CAACtE,KAAD,EAAeG,MAAf;QACFoC,KAAK,CAACC,OAAN,CAAcrC,MAAd,CAAJ,EAA2B;UAEvBoC,KAAK,CAAC+B,QAAN,CAAetE,KAAf,EAAsBG,MAAM,CAACR,MAA7B,KACA4C,KAAK,CAAC+B,QAAN,CAAetE,KAAf,EAAsBG,MAAM,CAACL,KAA7B,CAFF,EAGE;eACO,IAAP;;;UAGI,CAACoN,EAAD,EAAKC,EAAL,IAAW5K,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAjB;UACM,CAACoN,EAAD,EAAKC,EAAL,IAAW9K,KAAK,CAAC5B,KAAN,CAAYR,MAAZ,CAAjB;aACO2C,KAAK,CAACsG,QAAN,CAAe8D,EAAf,EAAmBE,EAAnB,KAA0BtK,KAAK,CAAC+H,OAAN,CAAcsC,EAAd,EAAkBE,EAAlB,CAAjC;;;QAGI,CAAC/M,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAArB;QACIsN,YAAY,GAAG,KAAnB;QACIC,WAAW,GAAG,KAAlB;;QAEIzK,KAAK,CAACmD,OAAN,CAAc9F,MAAd,CAAJ,EAA2B;MACzBmN,YAAY,GAAGxK,KAAK,CAACiC,OAAN,CAAc5E,MAAd,EAAsBG,KAAtB,KAAgC,CAA/C;MACAiN,WAAW,GAAGzK,KAAK,CAACiC,OAAN,CAAc5E,MAAd,EAAsBJ,GAAtB,KAA8B,CAA5C;KAFF,MAGO;MACLuN,YAAY,GAAGjO,IAAI,CAAC0F,OAAL,CAAa5E,MAAb,EAAqBG,KAAK,CAACxB,IAA3B,KAAoC,CAAnD;MACAyO,WAAW,GAAGlO,IAAI,CAAC0F,OAAL,CAAa5E,MAAb,EAAqBJ,GAAG,CAACjB,IAAzB,KAAkC,CAAhD;;;WAGKwO,YAAY,IAAIC,WAAvB;GArEiB;;;;;EA4EnBC,YAAY,CAACxN,KAAD,EAAemK,OAAf;QACgBpM,IAA1B,4BAAmCiC,KAAnC;;QACM,CAACyN,EAAD,EAAKC,EAAL,IAAWnL,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAjB;QACM,CAAC2N,EAAD,EAAKC,EAAL,IAAWrL,KAAK,CAAC5B,KAAN,CAAYwJ,OAAZ,CAAjB;QACM7J,KAAK,GAAGwC,KAAK,CAACsG,QAAN,CAAeqE,EAAf,EAAmBE,EAAnB,IAAyBA,EAAzB,GAA8BF,EAA5C;QACM1N,GAAG,GAAG+C,KAAK,CAACsG,QAAN,CAAesE,EAAf,EAAmBE,EAAnB,IAAyBF,EAAzB,GAA8BE,EAA1C;;QAEI9K,KAAK,CAACsG,QAAN,CAAerJ,GAAf,EAAoBO,KAApB,CAAJ,EAAgC;aACvB,IAAP;KADF,MAEO;;QACIX,MAAM,EAAEW,KAAjB;QAAwBR,KAAK,EAAEC;SAAQhC,IAAvC;;GAtFe;;;;;;EA+FnBkP,UAAU,CAACjN,KAAD;QACF;MAAEL,MAAF;MAAUG;QAAUE,KAA1B;WACO8C,KAAK,CAAC+H,OAAN,CAAclL,MAAd,EAAsBG,KAAtB,CAAP;GAjGiB;;;;;;EAyGnBmJ,WAAW,CAACjJ,KAAD;QACH;MAAEL,MAAF;MAAUG;QAAUE,KAA1B;WACO8C,KAAK,CAACxD,MAAN,CAAaK,MAAb,EAAqBG,KAArB,CAAP;GA3GiB;;;;;;;EAoHnB0D,UAAU,CAACxD,KAAD;WACD,CAACuC,KAAK,CAAC0G,WAAN,CAAkBjJ,KAAlB,CAAR;GArHiB;;;;;;;EA8HnB6N,SAAS,CAAC7N,KAAD;WACA,CAACuC,KAAK,CAAC0K,UAAN,CAAiBjN,KAAjB,CAAR;GA/HiB;;;;;EAsInBwC,OAAO,CAAC/C,KAAD;WAEHuC,aAAa,CAACvC,KAAD,CAAb,IACAqD,KAAK,CAACmD,OAAN,CAAcxG,KAAK,CAACE,MAApB,CADA,IAEAmD,KAAK,CAACmD,OAAN,CAAcxG,KAAK,CAACK,KAApB,CAHF;GAvIiB;;;;;GAkJlBiI,MAAD,CAAQ/H,KAAR;UACQ,CAACA,KAAK,CAACL,MAAP,EAAe,QAAf,CAAN;UACM,CAACK,KAAK,CAACF,KAAP,EAAc,OAAd,CAAN;GApJiB;;;;;EA2JnBQ,KAAK,CAACN,KAAD;QACG,CAACM,KAAD,IAAUiC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAhB;WACOM,KAAP;GA7JiB;;;;;EAoKnBmH,SAAS,CACPzH,KADO,EAEP0H,EAFO,EAGPlJ,OAHO;QAKD;MAAE2H,QAAQ,GAAG;QAAa3H,OAAhC;QACIsP,cAAJ;QACIC,aAAJ;;QAEI5H,QAAQ,KAAK,QAAjB,EAA2B;UACrB5D,KAAK,CAACsL,SAAN,CAAgB7N,KAAhB,CAAJ,EAA4B;QAC1B8N,cAAc,GAAG,SAAjB;QACAC,aAAa,GAAG,UAAhB;OAFF,MAGO;QACLD,cAAc,GAAG,UAAjB;QACAC,aAAa,GAAG,SAAhB;;KANJ,MAQO,IAAI5H,QAAQ,KAAK,SAAjB,EAA4B;UAC7B5D,KAAK,CAACsL,SAAN,CAAgB7N,KAAhB,CAAJ,EAA4B;QAC1B8N,cAAc,GAAG,UAAjB;QACAC,aAAa,GAAG,SAAhB;OAFF,MAGO;QACLD,cAAc,GAAG,SAAjB;QACAC,aAAa,GAAG,UAAhB;;KANG,MAQA;MACLD,cAAc,GAAG3H,QAAjB;MACA4H,aAAa,GAAG5H,QAAhB;;;WAGKqE,aAAO,CAACxK,KAAD,EAAQyK,CAAC;UACf9K,MAAM,GAAGmD,KAAK,CAAC2E,SAAN,CAAgBgD,CAAC,CAAC9K,MAAlB,EAA0B+H,EAA1B,EAA8B;QAAEvB,QAAQ,EAAE2H;OAA1C,CAAf;UACMhO,KAAK,GAAGgD,KAAK,CAAC2E,SAAN,CAAgBgD,CAAC,CAAC3K,KAAlB,EAAyB4H,EAAzB,EAA6B;QAAEvB,QAAQ,EAAE4H;OAAzC,CAAd;;UAEI,CAACpO,MAAD,IAAW,CAACG,KAAhB,EAAuB;eACd,IAAP;;;MAGF2K,CAAC,CAAC9K,MAAF,GAAWA,MAAX;MACA8K,CAAC,CAAC3K,KAAF,GAAUA,KAAV;KATY,CAAd;;;CAlMG;;ICFMkO,QAAQ,GAAG;;;;EAKtBvG,SAAS,CAACrB,GAAD,EAAgBsB,EAAhB;QACD;MAAErB,OAAF;MAAWF;QAAaC,GAA9B;;QAEIC,OAAO,IAAI,IAAf,EAAqB;;;;QAIfvH,IAAI,GAAGyD,KAAK,CAACkF,SAAN,CAAgBpB,OAAhB,EAAyBqB,EAAzB,EAA6B;MAAEvB;KAA/B,CAAb;IACAC,GAAG,CAACC,OAAJ,GAAcvH,IAAd;;QAEIA,IAAI,IAAI,IAAZ,EAAkB;MAChBsH,GAAG,CAACE,KAAJ;;;;CAhBC;;;;;ICAMnH,IAAI,GAAG;;;;EAKlBG,MAAM,CACJzC,IADI,EAEJsN,OAFI;QAGJ3L,8EAA+B;QAEzB;MAAEyP,KAAK,GAAG;QAAUzP,OAA1B;;SAEK,IAAMgB,GAAX,IAAkB3C,IAAlB,EAAwB;UAClBoR,KAAK,IAAIzO,GAAG,KAAK,MAArB,EAA6B;;;;UAIzB3C,IAAI,CAAC2C,GAAD,CAAJ,KAAc2K,OAAO,CAAC3K,GAAD,CAAzB,EAAgC;eACvB,KAAP;;;;SAIC,IAAMA,IAAX,IAAkB2K,OAAlB,EAA2B;UACrB8D,KAAK,IAAIzO,IAAG,KAAK,MAArB,EAA6B;;;;UAIzB3C,IAAI,CAAC2C,IAAD,CAAJ,KAAc2K,OAAO,CAAC3K,IAAD,CAAzB,EAAgC;eACvB,KAAP;;;;WAIG,IAAP;GAhCgB;;;;;EAuClBJ,MAAM,CAACK,KAAD;WACGuC,aAAa,CAACvC,KAAD,CAAb,IAAwB,OAAOA,KAAK,CAAC5C,IAAb,KAAsB,QAArD;GAxCgB;;;;;EA+ClBqR,UAAU,CAACzO,KAAD;WACD4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,MAAyBA,KAAK,CAACjC,MAAN,KAAiB,CAAjB,IAAsB2B,IAAI,CAACC,MAAL,CAAYK,KAAK,CAAC,CAAD,CAAjB,CAA/C,CAAP;GAhDgB;;;;;;;;EA0DlBmF,OAAO,CAAC/H,IAAD,EAAa4M,KAAb;SACA,IAAMjK,GAAX,IAAkBiK,KAAlB,EAAyB;UACnBjK,GAAG,KAAK,MAAZ,EAAoB;;;;UAIhB3C,IAAI,CAAC2C,GAAD,CAAJ,KAAciK,KAAK,CAACjK,GAAD,CAAvB,EAA8B;eACrB,KAAP;;;;WAIG,IAAP;GArEgB;;;;;EA4ElB2O,WAAW,CAACtN,IAAD,EAAasN,WAAb;QACLC,MAAM,GAAW,qBAAMvN,IAAN,EAArB;;SAEK,IAAMwN,GAAX,IAAkBF,WAAlB,EAA+B;UACHpQ,IAA1B,4BAAmCsQ,GAAnC;;UACM,CAAC/N,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAY0N,GAAZ,CAArB;UACMlQ,IAAI,GAAG,EAAb;UACImQ,CAAC,GAAG,CAAR;;WAEK,IAAMhL,IAAX,IAAmB8K,MAAnB,EAA2B;YACnB;UAAE5Q;YAAW8F,IAAI,CAACzG,IAAxB;YACMC,MAAM,GAAGwR,CAAf;QACAA,CAAC,IAAI9Q,MAAL,CAHyB;;YAMrB8C,KAAK,CAACxD,MAAN,IAAgBA,MAAhB,IAA0BiD,GAAG,CAACjD,MAAJ,IAAcA,MAAM,GAAGU,MAArD,EAA6D;UAC3DiL,MAAM,CAACC,MAAP,CAAcpF,IAAd,EAAoBvF,IAApB;UACAI,IAAI,CAACoF,IAAL,CAAUD,IAAV;;SARuB;;;YAcvBhD,KAAK,CAACxD,MAAN,GAAeA,MAAM,GAAGU,MAAxB,IACAuC,GAAG,CAACjD,MAAJ,GAAaA,MADb,IAECiD,GAAG,CAACjD,MAAJ,KAAeA,MAAf,IAAyBA,MAAM,KAAK,CAHvC,EAIE;UACAqB,IAAI,CAACoF,IAAL,CAAUD,IAAV;;SAlBuB;;;;;YAyBrBiL,MAAM,GAAGjL,IAAb;YACIjD,MAAM,SAAV;YACIX,KAAK,SAAT;;YAEIK,GAAG,CAACjD,MAAJ,GAAaA,MAAM,GAAGU,MAA1B,EAAkC;cAC1BgR,GAAG,GAAGzO,GAAG,CAACjD,MAAJ,GAAaA,MAAzB;UACA4C,KAAK,uBAAQ6O,MAAR;YAAgB1R,IAAI,EAAE0R,MAAM,CAAC1R,IAAP,CAAYiB,KAAZ,CAAkB0Q,GAAlB;YAA3B;UACAD,MAAM,uBAAQA,MAAR;YAAgB1R,IAAI,EAAE0R,MAAM,CAAC1R,IAAP,CAAYiB,KAAZ,CAAkB,CAAlB,EAAqB0Q,GAArB;YAA5B;;;YAGElO,KAAK,CAACxD,MAAN,GAAeA,MAAnB,EAA2B;cACnB0R,IAAG,GAAGlO,KAAK,CAACxD,MAAN,GAAeA,MAA3B;;UACAuD,MAAM,uBAAQkO,MAAR;YAAgB1R,IAAI,EAAE0R,MAAM,CAAC1R,IAAP,CAAYiB,KAAZ,CAAkB,CAAlB,EAAqB0Q,IAArB;YAA5B;UACAD,MAAM,uBAAQA,MAAR;YAAgB1R,IAAI,EAAE0R,MAAM,CAAC1R,IAAP,CAAYiB,KAAZ,CAAkB0Q,IAAlB;YAA5B;;;QAGF/F,MAAM,CAACC,MAAP,CAAc6F,MAAd,EAAsBxQ,IAAtB;;YAEIsC,MAAJ,EAAY;UACVlC,IAAI,CAACoF,IAAL,CAAUlD,MAAV;;;QAGFlC,IAAI,CAACoF,IAAL,CAAUgL,MAAV;;YAEI7O,KAAJ,EAAW;UACTvB,IAAI,CAACoF,IAAL,CAAU7D,KAAV;;;;MAIJ0O,MAAM,GAAGjQ,IAAT;;;WAGKiQ,MAAP;;;CA9IG;;;;;ACCA,IAAMK,iBAAiB,GAAG;;;;EAK/BhH,SAAS,CAAClJ,MAAD,EAAiBmJ,EAAjB;IACPnJ,MAAM,CAAC2C,QAAP,GAAkByG,iBAAW,CAACpJ,MAAM,CAAC2C,QAAR,CAA7B;QACItC,SAAS,GAAGL,MAAM,CAACK,SAAP,IAAoB+I,iBAAW,CAACpJ,MAAM,CAACK,SAAR,CAA/C;;YAEQ8I,EAAE,CAACE,IAAX;WACO,aAAL;;cACQ;YAAE9I,IAAF;YAAQ+B;cAAS6G,EAAvB;cACMrD,MAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,IAApB,CAAf;cACM+I,KAAK,GAAG/I,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;UACA6G,MAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,KAAvB,EAA8B,CAA9B,EAAiChH,IAAjC;;cAEIjC,SAAJ,EAAe;iBACR,IAAM,CAACgB,KAAD,EAAQJ,GAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,GAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,KAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,aAAL;;cACQ;YAAE5I,IAAI,EAAJA,KAAF;YAAQhC,MAAR;YAAgBD;cAAS6K,EAA/B;;cACM7G,KAAI,GAAGE,IAAI,CAACuC,IAAL,CAAU/E,MAAV,EAAkBO,KAAlB,CAAb;;cACMuB,MAAM,GAAGQ,KAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmBhB,MAAnB,CAAf;;cACM4C,KAAK,GAAGmB,KAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,MAAhB,CAAd;;UACA+D,KAAI,CAAChE,IAAL,GAAYwD,MAAM,GAAGxD,IAAT,GAAgB6C,KAA5B;;cAEId,SAAJ,EAAe;iBACR,IAAM,CAACgB,MAAD,EAAQJ,IAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,IAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,MAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,YAAL;;cACQ;YAAE5I,IAAI,EAAJA;cAAS4I,EAAjB;;cACM7G,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACM+E,QAAQ,GAAGxE,IAAI,CAACqE,QAAL,CAAc5E,MAAd,CAAjB;cACM/B,IAAI,GAAGgE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBsF,QAAjB,CAAb;;cACMQ,OAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,MAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;;cAEI2B,IAAI,CAACC,MAAL,CAAYyB,MAAZ,KAAqB1B,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAAzB,EAA4C;YAC1CA,IAAI,CAACF,IAAL,IAAagE,MAAI,CAAChE,IAAlB;WADF,MAEO,IAAI,CAACsC,IAAI,CAACC,MAAL,CAAYyB,MAAZ,CAAD,IAAsB,CAAC1B,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAA3B,EAA8C;YACnDA,IAAI,CAACmE,QAAL,CAAcqC,IAAd,CAAmB,GAAG1C,MAAI,CAACK,QAA3B;WADK,MAEA;kBACC,IAAIkD,KAAJ,4DAC8CtF,MAD9C,gDACwF+B,MADxF,cACgG9D,IADhG,EAAN;;;UAKFsH,OAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,MAAvB,EAA8B,CAA9B;;cAEIjJ,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,WAAL;;cACQ;YAAE5I,IAAI,EAAJA,MAAF;YAAQkJ;cAAYN,EAA1B;;cAEIrI,IAAI,CAAC0E,UAAL,CAAgBjF,MAAhB,EAAsBkJ,OAAtB,CAAJ,EAAoC;kBAC5B,IAAI5D,KAAJ,+BACmBtF,MADnB,4BACyCkJ,OADzC,iDAAN;;;cAKInH,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACMuF,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB,CAXgB;;;;;;;UAmBhB6G,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAvB,EAA8B,CAA9B;;cACMI,QAAQ,GAAG5I,IAAI,CAACoI,SAAL,CAAe3I,MAAf,EAAqB4I,EAArB,CAAjB;cACMQ,SAAS,GAAGnH,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBc,IAAI,CAACgF,MAAL,CAAY4D,QAAZ,CAAjB,CAAlB;cACME,QAAQ,GAAGF,QAAQ,CAACA,QAAQ,CAACzK,MAAT,GAAkB,CAAnB,CAAzB;UAEA0K,SAAS,CAAChH,QAAV,CAAmB4G,MAAnB,CAA0BK,QAA1B,EAAoC,CAApC,EAAuCtH,MAAvC;;cAEIjC,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,aAAL;;cACQ;YAAE5I,IAAI,EAAJA;cAAS4I,EAAjB;cACMG,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;;cACM6G,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;UACAuF,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAvB,EAA8B,CAA9B,EAJkB;;;;cAQdjJ,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;kBAC5CwJ,MAAM,GAAGtF,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAf;;kBAEI9I,SAAS,IAAI,IAAb,IAAqBwJ,MAAM,IAAI,IAAnC,EAAyC;gBACvCxJ,SAAS,CAACY,KAAD,CAAT,GAAiB4I,MAAjB;eADF,MAEO;oBACDrL,KAAiC,SAArC;;oBACIoB,IAAiC,SAArC;;qBAEK,IAAM,CAACa,CAAD,EAAIC,CAAJ,CAAX,IAAqB8B,IAAI,CAACsH,KAAL,CAAW9J,MAAX,CAArB,EAAyC;sBACnCc,IAAI,CAAC0F,OAAL,CAAa9F,CAAb,EAAgBH,MAAhB,MAA0B,CAAC,CAA/B,EAAkC;oBAChC/B,KAAI,GAAG,CAACiC,CAAD,EAAIC,CAAJ,CAAP;mBADF,MAEO;oBACLd,IAAI,GAAG,CAACa,CAAD,EAAIC,CAAJ,CAAP;;;;;oBAKAlC,KAAJ,EAAU;kBACR6C,OAAK,CAACd,IAAN,GAAa/B,KAAI,CAAC,CAAD,CAAjB;kBACA6C,OAAK,CAAC9C,MAAN,GAAeC,KAAI,CAAC,CAAD,CAAJ,CAAQF,IAAR,CAAaW,MAA5B;iBAFF,MAGO,IAAIW,IAAJ,EAAU;kBACfyB,OAAK,CAACd,IAAN,GAAaX,IAAI,CAAC,CAAD,CAAjB;kBACAyB,OAAK,CAAC9C,MAAN,GAAe,CAAf;iBAFK,MAGA;kBACL8B,SAAS,GAAG,IAAZ;;;;;;;;;WASL,aAAL;;cACQ;YAAEE,IAAI,EAAJA,MAAF;YAAQhC,MAAM,EAANA,OAAR;YAAgBD,IAAI,EAAJA;cAAS6K,EAA/B;;cACM7G,MAAI,GAAGE,IAAI,CAACuC,IAAL,CAAU/E,MAAV,EAAkBO,MAAlB,CAAb;;cACMuB,OAAM,GAAGQ,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmBhB,OAAnB,CAAf;;cACM4C,MAAK,GAAGmB,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,OAAM,GAAGD,KAAI,CAACW,MAA9B,CAAd;;UACAqD,MAAI,CAAChE,IAAL,GAAYwD,OAAM,GAAGX,MAArB;;cAEId,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,UAAL;;cACQ;YAAE5I,IAAI,EAAJA,MAAF;YAAQwJ;cAAkBZ,EAAhC;;cAEI5I,MAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;kBACf,IAAI4G,KAAJ,2CAAN;;;cAGIvD,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;eAEK,IAAMU,KAAX,IAAkB8I,aAAlB,EAAiC;gBAC3B9I,KAAG,KAAK,UAAR,IAAsBA,KAAG,KAAK,MAAlC,EAA0C;oBAClC,IAAI4E,KAAJ,4BAA6B5E,KAA7B,2BAAN;;;gBAGIC,KAAK,GAAG6I,aAAa,CAAC9I,KAAD,CAA3B;;gBAEIC,KAAK,IAAI,IAAb,EAAmB;qBACVoB,MAAI,CAACrB,KAAD,CAAX;aADF,MAEO;cACLqB,MAAI,CAACrB,KAAD,CAAJ,GAAYC,KAAZ;;;;;;;WAOD,eAAL;;cACQ;YAAE6I,aAAa,EAAbA;cAAkBZ,EAA1B;;cAEIY,cAAa,IAAI,IAArB,EAA2B;YACzB1J,SAAS,GAAG0J,cAAZ;WADF,MAEO,IAAI1J,SAAS,IAAI,IAAjB,EAAuB;gBACxB,CAAC2D,KAAK,CAACC,OAAN,CAAc8F,cAAd,CAAL,EAAmC;oBAC3B,IAAIlE,KAAJ,6EAC+DmE,IAAI,CAACC,SAAL,CACjEF,cADiE,CAD/D,0CAAN;;;YAOF1J,SAAS,GAAG0J,cAAZ;WATK,MAUA;YACLG,MAAM,CAACC,MAAP,CAAc9J,SAAd,EAAyB0J,cAAzB;;;;;;WAMC,YAAL;;cACQ;YAAExJ,IAAI,EAAJA,MAAF;YAAQ6J,QAAR;YAAkBC;cAAelB,EAAvC;;cAEI5I,MAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;kBACf,IAAI4G,KAAJ,4DAC8CtF,MAD9C,8CAAN;;;cAKI+B,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACMuF,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;cACIqL,OAAJ;;cAEI1J,IAAI,CAACC,MAAL,CAAYyB,MAAZ,CAAJ,EAAuB;gBACfR,QAAM,GAAGQ,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmB6K,QAAnB,CAAf;;gBACMjJ,OAAK,GAAGmB,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB6K,QAAhB,CAAd;;YACA9H,MAAI,CAAChE,IAAL,GAAYwD,QAAZ;YACAwI,OAAO,uBACFhI,MADE,MAED+H,UAFC;cAGL/L,IAAI,EAAE6C;cAHR;WAJF,MASO;gBACCW,QAAM,GAAGQ,MAAI,CAACK,QAAL,CAAcpD,KAAd,CAAoB,CAApB,EAAuB6K,QAAvB,CAAf;;gBACMjJ,OAAK,GAAGmB,MAAI,CAACK,QAAL,CAAcpD,KAAd,CAAoB6K,QAApB,CAAd;;YACA9H,MAAI,CAACK,QAAL,GAAgBb,QAAhB;YAEAwI,OAAO,uBACFhI,MADE,MAED+H,UAFC;cAGL1H,QAAQ,EAAExB;cAHZ;;;UAOF2E,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAK,GAAG,CAA/B,EAAkC,CAAlC,EAAqCgB,OAArC;;cAEIjK,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;;IAQRnJ,MAAM,CAAC2C,QAAP,GAAkB4H,iBAAW,CAACvK,MAAM,CAAC2C,QAAR,CAA7B;;QAEItC,SAAJ,EAAe;MACbL,MAAM,CAACK,SAAP,GAAmBmK,aAAO,CAACnK,SAAD,CAAP,GACdkK,iBAAW,CAAClK,SAAD,CADG,GAEfA,SAFJ;KADF,MAIO;MACLL,MAAM,CAACK,SAAP,GAAmB,IAAnB;;;;CA1QC;;;;;ACHA,IAAM8P,cAAc,GAAG;;;;EAK5BC,WAAW,CACTpQ,MADS,EAETkF,KAFS;QAGTjF,8EAOI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEqQ,OAAO,GAAG,KAAZ;QAAmBnQ,KAAK,GAAG,KAA3B;QAAkCC,IAAI,GAAG;UAAaF,OAA5D;UACI;QAAEG,EAAF;QAAME,KAAN;QAAagQ;UAAWrQ,OAA5B;;UAEIuC,IAAI,CAAC4J,MAAL,CAAYlH,KAAZ,CAAJ,EAAwB;QACtBA,KAAK,GAAG,CAACA,KAAD,CAAR;;;UAGEA,KAAK,CAACjG,MAAN,KAAiB,CAArB,EAAwB;;;;UAIlB,CAACqD,IAAD,IAAS4C,KAAf;;;;UAKI,CAAC9E,EAAL,EAAS;YACHJ,MAAM,CAACK,SAAX,EAAsB;UACpBD,EAAE,GAAGJ,MAAM,CAACK,SAAZ;SADF,MAEO,IAAIL,MAAM,CAAC2C,QAAP,CAAgB1D,MAAhB,GAAyB,CAA7B,EAAgC;UACrCmB,EAAE,GAAGN,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmB,EAAnB,CAAL;SADK,MAEA;UACLI,EAAE,GAAG,CAAC,CAAD,CAAL;;;QAGFkQ,MAAM,GAAG,IAAT;;;UAGEA,MAAM,IAAI,IAAd,EAAoB;QAClBA,MAAM,GAAG,KAAT;;;UAGEtM,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;YACjB,CAACiQ,OAAL,EAAc;UACZjQ,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,CAAL;;;YAGE4D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAJ,EAA2B;UACzBA,EAAE,GAAGA,EAAE,CAACgB,MAAR;SADF,MAEO;cACC,GAAGI,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAAhB;cACMiI,QAAQ,GAAGvI,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAjB;UACA+O,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;YAAEI;WAA5B;UACAA,EAAE,GAAGiI,QAAQ,CAACN,KAAT,EAAL;;;;UAIAxD,KAAK,CAACmD,OAAN,CAActH,EAAd,CAAJ,EAAuB;YACjBE,KAAK,IAAI,IAAb,EAAmB;cACbM,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;YACrBhC,KAAK,GAAGG,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,CAAb;WADF,MAEO,IAAIT,MAAM,CAAC+C,QAAP,CAAgBT,IAAhB,CAAJ,EAA2B;YAChChC,KAAK,GAAGG,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CAA/B;WADK,MAEA;YACLH,KAAK,GAAGG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAAb;;;;YAIE,CAAC2G,KAAD,IAAUtH,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;UACnCI,EAAE,EAAEA,EAAE,CAACG,IAD4B;UAEnCD,KAFmC;UAGnCH,IAHmC;UAInCD;SAJc,CAAhB;;YAOIkH,KAAJ,EAAW;cACH,GAAGoJ,UAAH,IAAgBpJ,KAAtB;cACMO,OAAO,GAAG7H,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBwQ,UAAvB,CAAhB;cACMC,OAAO,GAAG3Q,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBI,EAArB,EAAyBoQ,UAAzB,CAAhB;UACAD,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;YAAEI,EAAF;YAAME,KAAN;YAAaH,IAAb;YAAmBD;WAAjD;cACMK,IAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;UACA3H,EAAE,GAAGqQ,OAAO,GAAG3P,IAAI,CAAClB,IAAL,CAAUW,IAAV,CAAH,GAAqBA,IAAjC;SANF,MAOO;;;;;UAKH8G,UAAU,GAAGvG,IAAI,CAACgF,MAAL,CAAY1F,EAAZ,CAAnB;UACIkJ,KAAK,GAAGlJ,EAAE,CAACA,EAAE,CAACnB,MAAH,GAAY,CAAb,CAAd;;UAEI,CAACiB,KAAD,IAAUJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI,EAAE,EAAEiH;OAA1B,CAAd,EAAuD;;;;WAIlD,IAAM/E,KAAX,IAAmB4C,KAAnB,EAA0B;YAClB3E,KAAI,GAAG8G,UAAU,CAACsE,MAAX,CAAkBrC,KAAlB,CAAb;;QACAA,KAAK;QACLtJ,MAAM,CAAC0D,KAAP,CAAa;UAAE2F,IAAI,EAAE,aAAR;UAAuB9I,IAAI,EAAJA,KAAvB;UAA6B+B,IAAI,EAAJA;SAA1C;;;UAGEgO,MAAJ,EAAY;YACJjP,KAAK,GAAGvB,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmBI,EAAnB,CAAd;;YAEIiB,KAAJ,EAAW;UACTkP,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BqB,KAA1B;;;KA/FN;GAjB0B;;;;;;EA2H5BsP,SAAS,CACP3Q,MADO;QAEPC,8EAKI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEI,EAAE,GAAGJ,MAAM,CAACK,SAAd;QAAyBF,IAAI,GAAG,QAAhC;QAA0CD,KAAK,GAAG;UAAUD,OAAlE;UACI;QAAEK;UAAUL,OAAhB;;UAEIK,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,IACJoQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CADL,GAEJK,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAFT;;;UAKE,CAACL,EAAL,EAAS;;;;UAIHiG,OAAO,GAAGvG,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaH,IAAb;QAAmBD;OAAxC,CAAhB;UACM8H,QAAQ,GAAGlB,KAAK,CAACrB,IAAN,CAAWY,OAAX,EAAoB;YAAC,GAAG3F,CAAH,CAAD;eAAWZ,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBU,CAAvB,CAAX;OAApB,CAAjB;;WAEK,IAAMiH,OAAX,IAAsBK,QAAtB,EAAgC;YACxBzH,IAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;;YAEIxH,IAAI,CAACtB,MAAL,GAAc,CAAlB,EAAqB;gBACb,IAAI4G,KAAJ,uCAC2BtF,IAD3B,gDAAN;;;YAKI,CAACuF,MAAD,EAASuB,UAAT,IAAuBvH,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBc,IAAI,CAACgF,MAAL,CAAYvF,IAAZ,CAApB,CAA7B;YACM+I,KAAK,GAAG/I,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;YACM;UAAEA;YAAW6G,MAAM,CAACnD,QAA1B;;YAEI1D,MAAM,KAAK,CAAf,EAAkB;cACV2R,MAAM,GAAG9P,IAAI,CAAClB,IAAL,CAAUyH,UAAV,CAAf;UACAkJ,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;YAAEI,EAAE,EAAEG,IAAN;YAAYmF,EAAE,EAAEkL,MAAhB;YAAwB1Q;WAArD;UACAqQ,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;YAAEI,EAAE,EAAEiH,UAAN;YAAkBnH;WAAjD;SAHF,MAIO,IAAIoJ,KAAK,KAAK,CAAd,EAAiB;UACtBiH,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;YAAEI,EAAE,EAAEG,IAAN;YAAYmF,EAAE,EAAE2B,UAAhB;YAA4BnH;WAAzD;SADK,MAEA,IAAIoJ,KAAK,KAAKrK,MAAM,GAAG,CAAvB,EAA0B;cACzB2R,OAAM,GAAG9P,IAAI,CAAClB,IAAL,CAAUyH,UAAV,CAAf;;UACAkJ,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;YAAEI,EAAE,EAAEG,IAAN;YAAYmF,EAAE,EAAEkL,OAAhB;YAAwB1Q;WAArD;SAFK,MAGA;cACC6Q,SAAS,GAAGjQ,IAAI,CAAClB,IAAL,CAAUW,IAAV,CAAlB;;cACMqQ,QAAM,GAAG9P,IAAI,CAAClB,IAAL,CAAUyH,UAAV,CAAf;;UACAkJ,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;YAAEI,EAAE,EAAE2Q,SAAN;YAAiB7Q;WAA/C;UACAqQ,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;YAAEI,EAAE,EAAEG,IAAN;YAAYmF,EAAE,EAAEkL,QAAhB;YAAwB1Q;WAArD;;;KA3CN;GApI0B;;;;;;EA0L5B8Q,UAAU,CACRhR,MADQ;QAERC,8EAMI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC5B;QAAEM,KAAF;QAASF,EAAE,GAAGJ,MAAM,CAACK;UAAcJ,OAAvC;UACM;QAAEoQ,OAAO,GAAG,KAAZ;QAAmBnQ,KAAK,GAAG,KAA3B;QAAkCC,IAAI,GAAG;UAAaF,OAA5D;;UAEI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;YACbQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;cACb,CAAC0F,MAAD,IAAWhG,MAAM,CAACgG,MAAP,CAAc9F,MAAd,EAAsBI,EAAtB,CAAjB;;UACAE,KAAK,GAAGG,CAAC,IAAIqF,MAAM,CAACnD,QAAP,CAAgBoD,QAAhB,CAAyBtF,CAAzB,CAAb;SAFF,MAGO;UACLH,KAAK,GAAGG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAAb;;;;UAIA,CAAC4P,OAAD,IAAYrM,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAhB,EAAmC;QACjCA,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,CAAL;;;UAGE4D,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;YACjB4D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAJ,EAA2B;UACzBA,EAAE,GAAGA,EAAE,CAACgB,MAAR;SADF,MAEO;cACC,GAAGI,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAAhB;cACMiI,QAAQ,GAAGvI,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAjB;UACA+O,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;YAAEI;WAA5B;UACAA,EAAE,GAAGiI,QAAQ,CAACN,KAAT,EAAL;;cAEI9H,OAAO,CAACG,EAAR,IAAc,IAAlB,EAAwB;YACtBmQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BI,EAA1B;;;;;UAKA,CAAC0H,OAAD,IAAYhI,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaJ,KAAb;QAAoBC;OAAzC,CAAlB;UACM3B,IAAI,GAAGsB,MAAM,CAACqF,QAAP,CAAgBnF,MAAhB,EAAwB;QAAEI,EAAF;QAAME,KAAN;QAAaJ,KAAb;QAAoBC;OAA5C,CAAb;;UAEI,CAAC2H,OAAD,IAAY,CAACtJ,IAAjB,EAAuB;;;;UAIjB,CAAC8D,IAAD,EAAO/B,IAAP,IAAeuH,OAArB;UACM,CAACzC,QAAD,EAAWC,QAAX,IAAuB9G,IAA7B;;UAEI+B,IAAI,CAACtB,MAAL,KAAgB,CAAhB,IAAqBqG,QAAQ,CAACrG,MAAT,KAAoB,CAA7C,EAAgD;;;;UAI1CwK,OAAO,GAAG3I,IAAI,CAAClB,IAAL,CAAU0F,QAAV,CAAhB;UACM2L,UAAU,GAAGnQ,IAAI,CAAC2G,MAAL,CAAYlH,IAAZ,EAAkB+E,QAAlB,CAAnB;UACM4L,iBAAiB,GAAGpQ,IAAI,CAACkN,SAAL,CAAezN,IAAf,EAAqB+E,QAArB,CAA1B;UACM3E,MAAM,GAAGmG,KAAK,CAACrB,IAAN,CAAW3F,MAAM,CAACa,MAAP,CAAcX,MAAd,EAAsB;QAAEI,EAAE,EAAEG;OAA5B,CAAX,EAAgD;YAAC,CAACE,CAAD,CAAD;eAASA,CAAT;OAAhD,EACZlB,KADY,CACN0R,UAAU,CAAChS,MADL,EAEZM,KAFY,CAEN,CAFM,EAEH,CAAC,CAFE,CAAf;;;UAMM4R,aAAa,GAAGrR,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QACzCI,EAAE,EAAEG,IADqC;QAEzCJ,IAAI,EAAE,SAFmC;QAGzCG,KAAK,EAAEG,CAAC,IACNE,MAAM,CAACoF,QAAP,CAAgBtF,CAAhB,KAAsB6C,OAAO,CAACC,SAAR,CAAkB9C,CAAlB,CAAtB,IAA8CA,CAAC,CAACkC,QAAF,CAAW1D,MAAX,KAAsB;OAJlD,CAAtB;UAOMmS,QAAQ,GAAGD,aAAa,IAAIrR,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBmR,aAAa,CAAC,CAAD,CAApC,CAAlC;UACI9G,UAAJ;UACID,QAAJ;;;UAIIxJ,IAAI,CAACC,MAAL,CAAYyB,IAAZ,KAAqB1B,IAAI,CAACC,MAAL,CAAYwE,QAAZ,CAAzB,EAAgD;YAC7B7F,IAAjB,4BAA0B8C,IAA1B;;QACA8H,QAAQ,GAAG/E,QAAQ,CAAC/G,IAAT,CAAcW,MAAzB;QACAoL,UAAU,GAAG7K,IAAb;OAHF,MAIO,IAAI8D,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,KAA2BgB,OAAO,CAACC,SAAR,CAAkB8B,QAAlB,CAA/B,EAA4D;YAC5C7F,IAArB,4BAA8B8C,IAA9B;;QACA8H,QAAQ,GAAG/E,QAAQ,CAAC1C,QAAT,CAAkB1D,MAA7B;QACAoL,UAAU,GAAG7K,IAAb;OAHK,MAIA;cACC,IAAIqG,KAAJ,0CAC8BtF,IAD9B,0EACkGyJ,IAAI,CAACC,SAAL,CACpG3H,IADoG,CADlG,cAGC0H,IAAI,CAACC,SAAL,CAAe5E,QAAf,CAHD,EAAN;;;;;UASE,CAAC6L,iBAAL,EAAwB;QACtBX,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;UAAEI,EAAE,EAAEG,IAAN;UAAYmF,EAAE,EAAE+D,OAAhB;UAAyBvJ;SAAtD;;;;;UAKEkR,QAAJ,EAAc;QACZb,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;UAAEI,EAAE,EAAEgR,QAAQ,CAACtJ,OAAf;UAAyB5H;SAAxD;;;;;;;UAQCoD,OAAO,CAACC,SAAR,CAAkB8B,QAAlB,KAA+BvF,MAAM,CAAC4E,OAAP,CAAe1E,MAAf,EAAuBqF,QAAvB,CAAhC,IACCzE,IAAI,CAACC,MAAL,CAAYwE,QAAZ,KAAyBA,QAAQ,CAAC/G,IAAT,KAAkB,EAF9C,EAGE;QACAiS,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;UAAEI,EAAE,EAAEkF,QAAN;UAAgBpF;SAA/C;OAJF,MAKO;QACLF,MAAM,CAAC0D,KAAP,CAAa;UACX2F,IAAI,EAAE,YADK;UAEX9I,IAAI,EAAEkJ,OAFK;UAGXW,QAHW;UAIXxI,MAAM,EAAE,IAJG;UAKXyI;SALF;;;UASE+G,QAAJ,EAAc;QACZA,QAAQ,CAACrJ,KAAT;;KAxHJ;GApM0B;;;;;EAqU5B8I,SAAS,CACP7Q,MADO,EAEPC,OAFO;IAUPH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QACJ0F,EADI;QAEJtF,EAAE,GAAGJ,MAAM,CAACK,SAFR;QAGJF,IAAI,GAAG,QAHH;QAIJD,KAAK,GAAG;UACND,OALJ;UAMI;QAAEK;UAAUL,OAAhB;;UAEI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,IACJoQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CADL,GAEJK,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAFT;;;UAKI4Q,KAAK,GAAGvR,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuB0F,EAAvB,CAAd;UACM4L,OAAO,GAAGxR,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaH,IAAb;QAAmBD;OAAxC,CAAhB;UACM8H,QAAQ,GAAGlB,KAAK,CAACrB,IAAN,CAAW6L,OAAX,EAAoB;YAAC,GAAG5Q,CAAH,CAAD;eAAWZ,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBU,CAAvB,CAAX;OAApB,CAAjB;;WAEK,IAAMiH,OAAX,IAAsBK,QAAtB,EAAgC;YACxBzH,IAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;YACM0B,OAAO,GAAG4H,KAAK,CAACvJ,OAAtB;;YAEIvH,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;UACrBe,MAAM,CAAC0D,KAAP,CAAa;YAAE2F,IAAI,EAAE,WAAR;YAAqB9I,IAArB;YAA2BkJ;WAAxC;;;;MAIJ4H,KAAK,CAACtJ,KAAN;KAhCF;GA/U0B;;;;;EAuX5B+I,WAAW,CACT9Q,MADS;QAETC,8EAMI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEqQ,OAAO,GAAG,KAAZ;QAAmBnQ,KAAK,GAAG,KAA3B;QAAkCC,IAAI,GAAG;UAAaF,OAA5D;UACI;QAAEG,EAAE,GAAGJ,MAAM,CAACK,SAAd;QAAyBC;UAAUL,OAAvC;;UAEI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,IACJoQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CADL,GAEJK,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAFT;;;UAKE,CAAC4P,OAAD,IAAYrM,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAhB,EAAmC;QACjCA,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,CAAL;;;UAGImR,MAAM,GAAGzR,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaH,IAAb;QAAmBD;OAAxC,CAAf;UACM8H,QAAQ,GAAGlB,KAAK,CAACrB,IAAN,CAAW8L,MAAX,EAAmB;YAAC,GAAG7Q,CAAH,CAAD;eAAWZ,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBU,CAAvB,CAAX;OAAnB,CAAjB;;WAEK,IAAMiH,OAAX,IAAsBK,QAAtB,EAAgC;YACxBzH,IAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;;YAEIxH,IAAJ,EAAU;cACF,CAAC+B,IAAD,IAASxC,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAf;UACAP,MAAM,CAAC0D,KAAP,CAAa;YAAE2F,IAAI,EAAE,aAAR;YAAuB9I,IAAvB;YAA6B+B;WAA1C;;;KA1BN;GAjY0B;;;;;EAqa5BkP,QAAQ,CACNxR,MADM,EAENkL,KAFM;QAGNjL,8EAOI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC5B;QAAEM,KAAF;QAASF,EAAE,GAAGJ,MAAM,CAACK;UAAcJ,OAAvC;UACM;QACJoQ,OAAO,GAAG,KADN;QAEJlQ,IAAI,GAAG,QAFH;QAGJsR,KAAK,GAAG,KAHJ;QAIJvR,KAAK,GAAG;UACND,OALJ;;UAOI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,IACJoQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CADL,GAEJK,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAFT;;;UAKE,CAAC4P,OAAD,IAAYrM,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAhB,EAAmC;QACjCA,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,CAAL;;;UAGEqR,KAAK,IAAIzN,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAb,EAAgC;YACxB2I,QAAQ,GAAGjJ,MAAM,CAACiJ,QAAP,CAAgB/I,MAAhB,EAAwBI,EAAxB,EAA4B;UAAEwH,QAAQ,EAAE;SAAxC,CAAjB;YACM,CAAC7F,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAArB;YACMsR,SAAS,GAAGvR,IAAI,KAAK,QAAT,GAAoB,QAApB,GAA+B,SAAjD;QACAoQ,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;UAC5BI,EAAE,EAAEoB,GADwB;UAE5BlB,KAF4B;UAG5BH,IAAI,EAAEuR,SAHsB;UAI5BxR;SAJF;QAMAqQ,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;UAC5BI,EAAE,EAAE2B,KADwB;UAE5BzB,KAF4B;UAG5BH,IAAI,EAAEuR,SAHsB;UAI5BxR;SAJF;QAMAE,EAAE,GAAG2I,QAAQ,CAAChB,KAAT,EAAL;;YAEI9H,OAAO,CAACG,EAAR,IAAc,IAAlB,EAAwB;UACtBmQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BI,EAA1B;;;;WAIC,IAAM,CAACkC,IAAD,EAAO/B,IAAP,CAAX,IAA2BT,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAC9CI,EAD8C;QAE9CE,KAF8C;QAG9CH,IAH8C;QAI9CD;OAJyB,CAA3B,EAKI;YACImK,UAAU,GAAkB,EAAlC;YACMN,aAAa,GAAkB,EAArC,CAFE;;YAKExJ,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;;;;aAIlB,IAAM0S,CAAX,IAAgBzG,KAAhB,EAAuB;cACjByG,CAAC,KAAK,UAAN,IAAoBA,CAAC,KAAK,MAA9B,EAAsC;;;;cAIlCzG,KAAK,CAACyG,CAAD,CAAL,KAAarP,IAAI,CAACqP,CAAD,CAArB,EAA0B;YACxBtH,UAAU,CAACsH,CAAD,CAAV,GAAgBrP,IAAI,CAACqP,CAAD,CAApB;YACA5H,aAAa,CAAC4H,CAAD,CAAb,GAAmBzG,KAAK,CAACyG,CAAD,CAAxB;;;;YAIAzH,MAAM,CAAC0H,IAAP,CAAY7H,aAAZ,EAA2B9K,MAA3B,KAAsC,CAA1C,EAA6C;UAC3Ce,MAAM,CAAC0D,KAAP,CAAa;YACX2F,IAAI,EAAE,UADK;YAEX9I,IAFW;YAGX8J,UAHW;YAIXN;WAJF;;;KAxEN;GAjb0B;;;;;EAwgB5B2G,UAAU,CACR1Q,MADQ;QAERC,8EAOI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEG,IAAI,GAAG,QAAT;QAAmBD,KAAK,GAAG;UAAUD,OAA3C;UACI;QAAEK,KAAF;QAASF,EAAE,GAAGJ,MAAM,CAACK,SAArB;QAAgCwR,MAAM,GAAG,CAAzC;QAA4CC,MAAM,GAAG;UAAU7R,OAAnE;;UAEIK,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAAb;;;UAGEuD,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;QACrBA,EAAE,GAAG2R,WAAW,CAAC/R,MAAD,EAASI,EAAT,CAAhB;;;;;UAKEU,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;YACbG,IAAI,GAAGH,EAAb;YACMiB,KAAK,GAAGvB,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBO,IAArB,CAAd;YACM,CAACuF,MAAD,IAAWhG,MAAM,CAACgG,MAAP,CAAc9F,MAAd,EAAsBO,IAAtB,CAAjB;;QACAD,KAAK,GAAGG,CAAC,IAAIA,CAAC,KAAKqF,MAAnB;;QACA+L,MAAM,GAAGxQ,KAAK,CAACd,IAAN,CAAWtB,MAAX,GAAoBsB,IAAI,CAACtB,MAAzB,GAAkC,CAA3C;QACAmB,EAAE,GAAGiB,KAAL;QACAyQ,MAAM,GAAG,IAAT;;;UAGE,CAAC1R,EAAL,EAAS;;;;UAIH4R,SAAS,GAAGlS,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBI,EAAxB,EAA4B;QAC5CwH,QAAQ,EAAE;OADM,CAAlB;UAGM,CAACqK,OAAD,IAAYnS,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaH,IAAb;QAAmBD;OAAxC,CAAlB;;UAEI,CAAC+R,OAAL,EAAc;;;;UAIRC,SAAS,GAAGpS,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI,EAAF;QAAMD,IAAI,EAAE;OAAhC,CAAlB;UACMgS,KAAK,GAAG,CAAd;;UAEI,CAACjS,KAAD,IAAUgS,SAAd,EAAyB;YACjB,CAACE,QAAD,EAAWC,QAAX,IAAuBH,SAA7B;;YAEI5O,OAAO,CAACC,SAAR,CAAkB6O,QAAlB,KAA+BpS,MAAM,CAAC+C,QAAP,CAAgBqP,QAAhB,CAAnC,EAA8D;cACxDjR,KAAK,GAAGrB,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBqS,QAArB,CAAZ;;cAEI,CAAClR,KAAL,EAAY;gBACJ7C,IAAI,GAAG;cAAEA,IAAI,EAAE;aAArB;gBACMgU,SAAS,GAAGxR,IAAI,CAAClB,IAAL,CAAUyS,QAAV,CAAlB;YACA9B,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+B1B,IAA/B,EAAqC;cAAE8B,EAAE,EAAEkS,SAAN;cAAiBpS;aAAtD;YACAiB,KAAK,GAAGrB,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBsS,SAArB,CAAR;;;UAGFlS,EAAE,GAAGe,KAAL;UACA2Q,MAAM,GAAG,IAAT;;;YAGIS,aAAa,GAAGnS,EAAE,CAACG,IAAH,CAAQtB,MAAR,GAAiBoT,QAAQ,CAACpT,MAAhD;QACA4S,MAAM,GAAGU,aAAa,GAAG,CAAzB;QACAT,MAAM,GAAG,IAAT;;;UAGIU,QAAQ,GAAG1S,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBI,EAAxB,CAAjB;UACMkH,KAAK,GAAGlH,EAAE,CAACG,IAAH,CAAQtB,MAAR,GAAiB4S,MAA/B;UACM,GAAGY,WAAH,IAAkBR,OAAxB;UACMS,UAAU,GAAGtS,EAAE,CAACG,IAAH,CAAQhB,KAAR,CAAc,CAAd,EAAiB+H,KAAjB,CAAnB;UACI8C,QAAQ,GAAGyH,MAAM,KAAK,CAAX,GAAezR,EAAE,CAAC7B,MAAlB,GAA2B6B,EAAE,CAACG,IAAH,CAAQ+G,KAAR,IAAiB6K,KAA3D;UACIvQ,MAAM,GAAkB,IAA5B;;WAEK,IAAM,CAACU,IAAD,EAAO/B,MAAP,CAAX,IAA2BT,MAAM,CAACa,MAAP,CAAcX,MAAd,EAAsB;QAC/CI,EAAE,EAAEsS,UAD2C;QAE/ClS,OAAO,EAAE,IAFsC;QAG/CN;OAHyB,CAA3B,EAII;YACEuR,KAAK,GAAG,KAAZ;;YAGElR,MAAI,CAACtB,MAAL,GAAcwT,WAAW,CAACxT,MAA1B,IACAsB,MAAI,CAACtB,MAAL,KAAgB,CADhB,IAEC,CAACiB,KAAD,IAAUJ,MAAM,CAAC6D,MAAP,CAAc3D,MAAd,EAAsBsC,IAAtB,CAHb,EAIE;;;;YAIIjB,MAAK,GAAG2Q,SAAS,CAAClK,OAAxB;YACMxD,KAAK,GAAGxE,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBqB,MAArB,EAA4Bd,MAA5B,CAAd;;YAEIuR,MAAM,IAAI,CAACE,SAAX,IAAwB,CAAClS,MAAM,CAAC0E,MAAP,CAAcxE,MAAd,EAAsBqB,MAAtB,EAA6Bd,MAA7B,CAA7B,EAAiE;UAC/DkR,KAAK,GAAG,IAAR;;cAC2BpH,UAA3B,4BAA0C/H,IAA1C;;UACAtC,MAAM,CAAC0D,KAAP,CAAa;YACX2F,IAAI,EAAE,YADK;YAEX9I,IAAI,EAAJA,MAFW;YAGX6J,QAHW;YAIXxI,MAJW;YAKXyI;WALF;;;QASFzI,MAAM,GAAGwI,QAAT;QACAA,QAAQ,GAAG7J,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAJ,IAAyBwS,KAAK,IAAInN,KAAT,GAAiB,CAAjB,GAAqB,CAA9C,CAAX;;;UAGErE,OAAO,CAACG,EAAR,IAAc,IAAlB,EAAwB;YAChBiB,OAAK,GAAGmR,QAAQ,CAAC1K,OAAT,IAAoBhI,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmB,EAAnB,CAAlC;;QACAuQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BqB,OAA1B;;;MAGF2Q,SAAS,CAACjK,KAAV;MACAyK,QAAQ,CAACzK,KAAT;KA7GF;GAnhB0B;;;;;EAwoB5B4K,UAAU,CACR3S,MADQ,EAERkL,KAFQ;QAGRjL,8EAMI;;QAEA,CAAC6G,KAAK,CAACmE,OAAN,CAAcC,KAAd,CAAL,EAA2B;MACzBA,KAAK,GAAG,CAACA,KAAD,CAAR;;;QAGI0H,GAAG,GAAG,EAAZ;;SAEK,IAAM3R,GAAX,IAAkBiK,KAAlB,EAAyB;MACvB0H,GAAG,CAAC3R,GAAD,CAAH,GAAW,IAAX;;;IAGFsP,UAAU,CAACiB,QAAX,CAAoBxR,MAApB,EAA4B4S,GAA5B,EAAiC3S,OAAjC;GA7pB0B;;;;;;EAqqB5B4S,WAAW,CACT7S,MADS,EAETC,OAFS;IAUTH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEG,IAAI,GAAG,QAAT;QAAmBsR,KAAK,GAAG,KAA3B;QAAkCvR,KAAK,GAAG;UAAUD,OAA1D;UACI;QAAEG,EAAE,GAAGJ,MAAM,CAACK,SAAd;QAAyBC;UAAUL,OAAvC;;UAEI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,IACJoQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CADL,GAEJK,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAFT;;;UAKEK,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;QACnBA,EAAE,GAAGN,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBI,EAArB,CAAL;;;UAGI2I,QAAQ,GAAG/E,KAAK,CAACC,OAAN,CAAc7D,EAAd,IAAoBN,MAAM,CAACiJ,QAAP,CAAgB/I,MAAhB,EAAwBI,EAAxB,CAApB,GAAkD,IAAnE;UACMiG,OAAO,GAAGvG,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaH,IAAb;QAAmBD;OAAxC,CAAhB;UACM8H,QAAQ,GAAGlB,KAAK,CAACrB,IAAN,CAAWY,OAAX,EAAoB;YAAC,GAAG3F,CAAH,CAAD;eAAWZ,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBU,CAAvB,CAAX;OAApB,CAAjB;;iCAEWiH;YACHpH,IAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;YACM,CAACzF,IAAD,IAASxC,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAf;YACIkB,KAAK,GAAG3B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBO,IAArB,CAAZ;;YAEIkR,KAAK,IAAI1I,QAAb,EAAuB;UACrBtH,KAAK,GAAGuC,KAAK,CAACiL,YAAN,CAAmBlG,QAAQ,CAACjB,OAA5B,EAAsCrG,KAAtC,CAAR;;;QAGF8O,UAAU,CAACI,SAAX,CAAqB3Q,MAArB,EAA6B;UAC3BI,EAAE,EAAEqB,KADuB;UAE3BnB,KAAK,EAAEG,CAAC,IAAI6B,IAAI,CAACK,QAAL,CAAcoD,QAAd,CAAuBtF,CAAvB,CAFe;UAG3BP;SAHF;;;WATG,IAAMyH,OAAX,IAAsBK,QAAtB,EAAgC;cAArBL,OAAqB;;;UAgB5BoB,QAAJ,EAAc;QACZA,QAAQ,CAAChB,KAAT;;KAvCJ;GA/qB0B;;;;;;EAguB5B+K,SAAS,CACP9S,MADO,EAEP0C,OAFO;QAGPzC,8EAMI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEG,IAAI,GAAG,QAAT;QAAmBsR,KAAK,GAAG,KAA3B;QAAkCvR,KAAK,GAAG;UAAUD,OAA1D;UACI;QAAEK,KAAF;QAASF,EAAE,GAAGJ,MAAM,CAACK;UAAcJ,OAAvC;;UAEI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;YACbQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;UACnBE,KAAK,GAAGkQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CAAjB;SADF,MAEO,IAAIJ,MAAM,CAAC+C,QAAP,CAAgBL,OAAhB,CAAJ,EAA8B;UACnCpC,KAAK,GAAGG,CAAC,IAAIX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,KAA8BG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,CAA3C;SADK,MAEA;UACLH,KAAK,GAAGG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAAb;;;;UAIAgR,KAAK,IAAIzN,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAb,EAAgC;YACxB,CAAC2B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAArB;YACM2I,QAAQ,GAAGjJ,MAAM,CAACiJ,QAAP,CAAgB/I,MAAhB,EAAwBI,EAAxB,EAA4B;UAC3CwH,QAAQ,EAAE;SADK,CAAjB;QAGA2I,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;UAAEI,EAAE,EAAEoB,GAAN;UAAWlB,KAAX;UAAkBJ;SAAhD;QACAqQ,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;UAAEI,EAAE,EAAE2B,KAAN;UAAazB,KAAb;UAAoBJ;SAAlD;QACAE,EAAE,GAAG2I,QAAQ,CAAChB,KAAT,EAAL;;YAEI9H,OAAO,CAACG,EAAR,IAAc,IAAlB,EAAwB;UACtBmQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BI,EAA1B;;;;UAIE2S,KAAK,GAAGjM,KAAK,CAACrB,IAAN,CACZ3F,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QACnBI,EADmB;QAEnBE,KAAK,EAAEN,MAAM,CAAC+C,QAAP,CAAgBL,OAAhB,IACHjC,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CADF,GAEHA,CAAC,IAAIX,MAAM,CAAC0D,QAAP,CAAgB/C,CAAhB,CAJU;QAKnBN,IAAI,EAAE,SALa;QAMnBD;OANF,CADY,CAAd;;WAWK,IAAM,GAAG8S,QAAH,CAAX,IAA2BD,KAA3B,EAAkC;YAC1BE,CAAC,GAAGjP,KAAK,CAACC,OAAN,CAAc7D,EAAd,IACN4D,KAAK,CAACiL,YAAN,CAAmB7O,EAAnB,EAAuBN,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBgT,QAArB,CAAvB,CADM,GAEN5S,EAFJ;;YAII,CAAC6S,CAAL,EAAQ;;;;YAIF5M,OAAO,GAAGS,KAAK,CAACrB,IAAN,CACd3F,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;UAAEI,EAAE,EAAE6S,CAAN;UAAS3S,KAAT;UAAgBH,IAAhB;UAAsBD;SAA3C,CADc,CAAhB;;YAIImG,OAAO,CAACpH,MAAR,GAAiB,CAArB,EAAwB;;gBAChB,CAACoD,KAAD,IAAUgE,OAAhB;gBACMvB,IAAI,GAAGuB,OAAO,CAACA,OAAO,CAACpH,MAAR,GAAiB,CAAlB,CAApB;gBACM,GAAGsI,SAAH,IAAgBlF,KAAtB;gBACM,GAAGmF,QAAH,IAAe1C,IAArB;gBACMmM,UAAU,GAAGnQ,IAAI,CAACC,MAAL,CAAYwG,SAAZ,EAAuBC,QAAvB,IACf1G,IAAI,CAACgF,MAAL,CAAYyB,SAAZ,CADe,GAEfzG,IAAI,CAAC2G,MAAL,CAAYF,SAAZ,EAAuBC,QAAvB,CAFJ;gBAIM/F,KAAK,GAAG3B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBuH,SAArB,EAAgCC,QAAhC,CAAd;gBACM,CAAC0L,UAAD,IAAepT,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBiR,UAApB,CAArB;gBACM3J,KAAK,GAAG2J,UAAU,CAAChS,MAAX,GAAoB,CAAlC;gBACMkU,WAAW,GAAGrS,IAAI,CAAClB,IAAL,CAAU4H,QAAQ,CAACjI,KAAT,CAAe,CAAf,EAAkB+H,KAAlB,CAAV,CAApB;;gBACM8L,OAAO,uBAAQ1Q,OAAR;cAAiBC,QAAQ,EAAE;cAAxC;;YACA4N,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BoT,OAA/B,EAAwC;cAAEhT,EAAE,EAAE+S,WAAN;cAAmBjT;aAA3D;YAEAqQ,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;cAC3BI,EAAE,EAAEqB,KADuB;cAE3BnB,KAAK,EAAEG,CAAC,IAAIyS,UAAU,CAACvQ,QAAX,CAAoBoD,QAApB,CAA6BtF,CAA7B,CAFe;cAG3BiF,EAAE,EAAEyN,WAAW,CAACxH,MAAZ,CAAmB,CAAnB,CAHuB;cAI3BzL;aAJF;;;;KAxEN;;;CA3uBG;;;;;AAm0BP,IAAM6R,WAAW,GAAG,CAAC/R,MAAD,EAAiByB,KAAjB;MACduC,KAAK,CAAC0G,WAAN,CAAkBjJ,KAAlB,CAAJ,EAA8B;WACrBA,KAAK,CAACL,MAAb;GADF,MAEO;QACC,GAAGI,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAhB;QACM4G,QAAQ,GAAGvI,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAjB;IACA+O,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;MAAEI,EAAE,EAAEqB;KAAhC;WACO4G,QAAQ,CAACN,KAAT,EAAP;;CAPJ;;AAWA,IAAMyI,SAAS,GAAG,CAACxQ,MAAD,EAAiBO,IAAjB;MACV,CAAC+B,IAAD,IAASxC,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAf;SACOE,CAAC,IAAIA,CAAC,KAAK6B,IAAlB;CAFF;;;;;ACx1BO,IAAM+Q,mBAAmB,GAAG;;;;EAKjCC,QAAQ,CACNtT,MADM;QAENC,8EAEI;QAEE;MAAEqB,IAAI,GAAG;QAAarB,OAA5B;QACM;MAAEI;QAAcL,MAAtB;;QAEI,CAACK,SAAL,EAAgB;;KAAhB,MAEO,IAAIiB,IAAI,KAAK,QAAb,EAAuB;MAC5BiP,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BK,SAAS,CAACe,MAApC;KADK,MAEA,IAAIE,IAAI,KAAK,OAAb,EAAsB;MAC3BiP,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BK,SAAS,CAACkB,KAApC;KADK,MAEA,IAAID,IAAI,KAAK,OAAb,EAAsB;UACrB,CAACS,KAAD,IAAUiC,KAAK,CAAC5B,KAAN,CAAY/B,SAAZ,CAAhB;MACAkQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0B+B,KAA1B;KAFK,MAGA,IAAIT,IAAI,KAAK,KAAb,EAAoB;UACnB,GAAGE,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAY/B,SAAZ,CAAhB;MACAkQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BwB,GAA1B;;GAzB6B;;;;;EAiCjC+R,QAAQ,CAACvT,MAAD;QACA;MAAEK;QAAcL,MAAtB;;QAEIK,SAAJ,EAAe;MACbL,MAAM,CAAC0D,KAAP,CAAa;QACX2F,IAAI,EAAE,eADK;QAEXgB,UAAU,EAAEhK,SAFD;QAGX0J,aAAa,EAAE;OAHjB;;GArC6B;;;;;EAiDjCyJ,IAAI,CACFxT,MADE;QAEFC,8EAKI;QAEE;MAAEI;QAAcL,MAAtB;QACM;MAAE0B,QAAQ,GAAG,CAAb;MAAgBO,IAAI,GAAG,WAAvB;MAAoCzB,OAAO,GAAG;QAAUP,OAA9D;QACI;MAAEqB,IAAI,GAAG;QAASrB,OAAtB;;QAEI,CAACI,SAAL,EAAgB;;;;QAIZiB,IAAI,KAAK,OAAb,EAAsB;MACpBA,IAAI,GAAG0C,KAAK,CAAC0K,UAAN,CAAiBrO,SAAjB,IAA8B,OAA9B,GAAwC,QAA/C;;;QAGEiB,IAAI,KAAK,KAAb,EAAoB;MAClBA,IAAI,GAAG0C,KAAK,CAAC0K,UAAN,CAAiBrO,SAAjB,IAA8B,QAA9B,GAAyC,OAAhD;;;QAGI;MAAEe,MAAF;MAAUG;QAAUlB,SAA1B;QACMoT,IAAI,GAAG;MAAE/R,QAAF;MAAYO;KAAzB;QACMiJ,KAAK,GAAmB,EAA9B;;QAEI5J,IAAI,IAAI,IAAR,IAAgBA,IAAI,KAAK,QAA7B,EAAuC;UAC/BD,KAAK,GAAGb,OAAO,GACjBV,MAAM,CAACgC,MAAP,CAAc9B,MAAd,EAAsBoB,MAAtB,EAA8BqS,IAA9B,CADiB,GAEjB3T,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBoB,MAArB,EAA6BqS,IAA7B,CAFJ;;UAIIpS,KAAJ,EAAW;QACT6J,KAAK,CAAC9J,MAAN,GAAeC,KAAf;;;;QAIAC,IAAI,IAAI,IAAR,IAAgBA,IAAI,KAAK,OAA7B,EAAsC;UAC9BD,MAAK,GAAGb,OAAO,GACjBV,MAAM,CAACgC,MAAP,CAAc9B,MAAd,EAAsBuB,KAAtB,EAA6BkS,IAA7B,CADiB,GAEjB3T,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBuB,KAArB,EAA4BkS,IAA5B,CAFJ;;UAIIpS,MAAJ,EAAW;QACT6J,KAAK,CAAC3J,KAAN,GAAcF,MAAd;;;;IAIJkP,UAAU,CAACmD,YAAX,CAAwB1T,MAAxB,EAAgCkL,KAAhC;GAlG+B;;;;;EAyGjCoF,MAAM,CAACtQ,MAAD,EAAiB4B,MAAjB;QACE;MAAEvB;QAAcL,MAAtB;IACA4B,MAAM,GAAG9B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqB4B,MAArB,CAAT;;QAEIvB,SAAJ,EAAe;MACbkQ,UAAU,CAACmD,YAAX,CAAwB1T,MAAxB,EAAgC4B,MAAhC;;;;QAIE,CAACoC,KAAK,CAACC,OAAN,CAAcrC,MAAd,CAAL,EAA4B;YACpB,IAAIiE,KAAJ,6IACuImE,IAAI,CAACC,SAAL,CACzIrI,MADyI,CADvI,EAAN;;;IAOF5B,MAAM,CAAC0D,KAAP,CAAa;MACX2F,IAAI,EAAE,eADK;MAEXgB,UAAU,EAAEhK,SAFD;MAGX0J,aAAa,EAAEnI;KAHjB;GA1H+B;;;;;EAqIjC+R,QAAQ,CACN3T,MADM,EAENkL,KAFM,EAGNjL,OAHM;QAOA;MAAEI;QAAcL,MAAtB;QACI;MAAEsB,IAAI,GAAG;QAAWrB,OAAxB;;QAEI,CAACI,SAAL,EAAgB;;;;QAIZiB,IAAI,KAAK,OAAb,EAAsB;MACpBA,IAAI,GAAG0C,KAAK,CAAC0K,UAAN,CAAiBrO,SAAjB,IAA8B,OAA9B,GAAwC,QAA/C;;;QAGEiB,IAAI,KAAK,KAAb,EAAoB;MAClBA,IAAI,GAAG0C,KAAK,CAAC0K,UAAN,CAAiBrO,SAAjB,IAA8B,QAA9B,GAAyC,OAAhD;;;QAGI;MAAEe,MAAF;MAAUG;QAAUlB,SAA1B;QACMgB,KAAK,GAAGC,IAAI,KAAK,QAAT,GAAoBF,MAApB,GAA6BG,KAA3C;IAEAgP,UAAU,CAACmD,YAAX,CAAwB1T,MAAxB,EAAgC;OAC7BsB,IAAI,KAAK,QAAT,GAAoB,QAApB,GAA+B,OAAhC,uBAA+CD,KAA/C,MAAyD6J,KAAzD;KADF;GA9J+B;;;;;EAuKjCwI,YAAY,CAAC1T,MAAD,EAAiBkL,KAAjB;QACJ;MAAE7K;QAAcL,MAAtB;QACM4T,QAAQ,GAA0B,EAAxC;QACMC,QAAQ,GAAmB,EAAjC;;QAEI,CAACxT,SAAL,EAAgB;;;;SAIX,IAAMsR,CAAX,IAAgBzG,KAAhB,EAAuB;UAElByG,CAAC,KAAK,QAAN,IACCzG,KAAK,CAAC9J,MAAN,IAAgB,IADjB,IAEC,CAACmD,KAAK,CAACxD,MAAN,CAAamK,KAAK,CAAC9J,MAAnB,EAA2Bf,SAAS,CAACe,MAArC,CAFH,IAGCuQ,CAAC,KAAK,OAAN,IACCzG,KAAK,CAAC3J,KAAN,IAAe,IADhB,IAEC,CAACgD,KAAK,CAACxD,MAAN,CAAamK,KAAK,CAAC3J,KAAnB,EAA0BlB,SAAS,CAACkB,KAApC,CALH,IAMCoQ,CAAC,KAAK,QAAN,IAAkBA,CAAC,KAAK,OAAxB,IAAmCzG,KAAK,CAACyG,CAAD,CAAL,KAAatR,SAAS,CAACsR,CAAD,CAP5D,EAQE;QACAiC,QAAQ,CAACjC,CAAD,CAAR,GAActR,SAAS,CAACsR,CAAD,CAAvB;QACAkC,QAAQ,CAAClC,CAAD,CAAR,GAAczG,KAAK,CAACyG,CAAD,CAAnB;;;;QAIAzH,MAAM,CAAC0H,IAAP,CAAYgC,QAAZ,EAAsB3U,MAAtB,GAA+B,CAAnC,EAAsC;MACpCe,MAAM,CAAC0D,KAAP,CAAa;QACX2F,IAAI,EAAE,eADK;QAEXgB,UAAU,EAAEuJ,QAFD;QAGX7J,aAAa,EAAE8J;OAHjB;;;;CAhMC;;ACWA,IAAMC,cAAc,GAAG;;;;EAK5B7L,MAAM,CACJjI,MADI;QAEJC,8EAOI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QACJQ,OAAO,GAAG,KADN;QAEJyB,IAAI,GAAG,WAFH;QAGJP,QAAQ,GAAG,CAHP;QAIJxB,KAAK,GAAG;UACND,OALJ;UAMI;QAAEG,EAAE,GAAGJ,MAAM,CAACK,SAAd;QAAyBgQ,OAAO,GAAG;UAAUpQ,OAAjD;;UAEI,CAACG,EAAL,EAAS;;;;UAIL4D,KAAK,CAACC,OAAN,CAAc7D,EAAd,KAAqB4D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAzB,EAAgD;QAC9CA,EAAE,GAAGA,EAAE,CAACgB,MAAR;;;UAGEmD,KAAK,CAACmD,OAAN,CAActH,EAAd,CAAJ,EAAuB;YACf2T,YAAY,GAAGjU,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;UAAEI,EAAF;UAAMD,IAAI,EAAE;SAAhC,CAArB;;YAEI,CAACD,KAAD,IAAU6T,YAAd,EAA4B;cACpB,GAAG1B,QAAH,IAAe0B,YAArB;UACA3T,EAAE,GAAGiS,QAAL;SAFF,MAGO;cACCoB,IAAI,GAAG;YAAExR,IAAF;YAAQP;WAArB;cACME,MAAM,GAAGpB,OAAO,GAClBV,MAAM,CAACgC,MAAP,CAAc9B,MAAd,EAAsBI,EAAtB,EAA0BqT,IAA1B,KAAmC3T,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqB,EAArB,CADjB,GAElBF,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBI,EAArB,EAAyBqT,IAAzB,KAAkC3T,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmB,EAAnB,CAFtC;UAGAI,EAAE,GAAG;YAAEgB,MAAM,EAAEhB,EAAV;YAAcmB,KAAK,EAAEK;WAA1B;UACAyO,OAAO,GAAG,IAAV;;;;UAIAvP,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;QACnBmQ,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;UAAEI,EAAF;UAAMF;SAArC;;;;UAIE8D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAJ,EAA2B;;;;UAIvB,CAACiQ,OAAL,EAAc;QACZjQ,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,EAA+B;UAAEF;SAAjC,CAAL;;;UAGE,CAAC6B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAAnB;UACM4T,UAAU,GAAGlU,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QACtCM,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAD0B;QAEtCL,EAAE,EAAE2B,KAFkC;QAGtC7B;OAHiB,CAAnB;UAKMyK,QAAQ,GAAG7K,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QACpCM,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CADwB;QAEpCL,EAAE,EAAEoB,GAFgC;QAGpCtB;OAHe,CAAjB;UAKM+T,cAAc,GAClBD,UAAU,IAAIrJ,QAAd,IAA0B,CAAC7J,IAAI,CAACC,MAAL,CAAYiT,UAAU,CAAC,CAAD,CAAtB,EAA2BrJ,QAAQ,CAAC,CAAD,CAAnC,CAD7B;UAEMuJ,YAAY,GAAGpT,IAAI,CAACC,MAAL,CAAYgB,KAAK,CAACxB,IAAlB,EAAwBiB,GAAG,CAACjB,IAA5B,CAArB;UACM4T,SAAS,GAAGjU,KAAK,GACnB,IADmB,GAEnBJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI,EAAE,EAAE2B,KAAN;QAAa5B,IAAI,EAAE;OAAvC,CAFJ;UAGMiU,OAAO,GAAGlU,KAAK,GACjB,IADiB,GAEjBJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI,EAAE,EAAEoB,GAAN;QAAWrB,IAAI,EAAE;OAArC,CAFJ;;UAKIgU,SAAJ,EAAe;YACPrS,MAAM,GAAGhC,MAAM,CAACgC,MAAP,CAAc9B,MAAd,EAAsB+B,KAAtB,CAAf;;YAGED,MAAM,IACNkS,UADA,IAEAlT,IAAI,CAAC0E,UAAL,CAAgBwO,UAAU,CAAC,CAAD,CAA1B,EAA+BlS,MAAM,CAACvB,IAAtC,CAHF,EAIE;UACAwB,KAAK,GAAGD,MAAR;;;;UAIAsS,OAAJ,EAAa;YACLjT,KAAK,GAAGrB,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBwB,GAArB,CAAd;;YAEIL,KAAK,IAAIwJ,QAAT,IAAqB7J,IAAI,CAAC0E,UAAL,CAAgBmF,QAAQ,CAAC,CAAD,CAAxB,EAA6BxJ,KAAK,CAACZ,IAAnC,CAAzB,EAAmE;UACjEiB,GAAG,GAAGL,KAAN;;;;;;UAMEkF,OAAO,GAAgB,EAA7B;UACImB,QAAJ;;WAEK,IAAMJ,KAAX,IAAoBtH,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAMF;OAA3B,CAApB,EAAyD;YACjD,CAACoC,IAAD,EAAO/B,IAAP,IAAe6G,KAArB;;YAEII,QAAQ,IAAI1G,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBiH,QAAnB,MAAiC,CAAjD,EAAoD;;;;YAKjD,CAACtH,KAAD,IAAUJ,MAAM,CAAC6D,MAAP,CAAc3D,MAAd,EAAsBsC,IAAtB,CAAX,IACC,CAACxB,IAAI,CAAC+M,QAAL,CAActN,IAAd,EAAoBwB,KAAK,CAACxB,IAA1B,CAAD,IAAoC,CAACO,IAAI,CAAC+M,QAAL,CAActN,IAAd,EAAoBiB,GAAG,CAACjB,IAAxB,CAFxC,EAGE;UACA8F,OAAO,CAACrB,IAAR,CAAaoC,KAAb;UACAI,QAAQ,GAAGjH,IAAX;;;;UAIEyH,QAAQ,GAAGlB,KAAK,CAACrB,IAAN,CAAWY,OAAX,EAAoB;YAAC,GAAG3F,CAAH,CAAD;eAAWZ,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBU,CAAvB,CAAX;OAApB,CAAjB;UACM2T,QAAQ,GAAGvU,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwB+B,KAAxB,CAAjB;UACMuS,MAAM,GAAGxU,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAf;;UAEI,CAAC0S,YAAD,IAAiB,CAACC,SAAtB,EAAiC;YACzB9S,MAAK,GAAGgT,QAAQ,CAACvM,OAAvB;YACM,CAACxF,KAAD,IAASxC,MAAM,CAACiF,IAAP,CAAY/E,MAAZ,EAAoBqB,MAApB,CAAf;YACM;UAAEd,IAAI,EAAJA;YAASc,MAAjB;YACM;UAAE9C;YAAWwD,KAAnB;;YACMzD,IAAI,GAAGgE,KAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,MAAhB,CAAb;;QACAyB,MAAM,CAAC0D,KAAP,CAAa;UAAE2F,IAAI,EAAE,aAAR;UAAuB9I,IAAI,EAAJA,KAAvB;UAA6BhC,MAA7B;UAAqCD;SAAlD;;;WAGG,IAAMqJ,OAAX,IAAsBK,QAAtB,EAAgC;YACxBzH,MAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;;QACAwI,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;UAAEI,EAAE,EAAEG,MAAN;UAAYL;SAA3C;;;UAGE,CAACkU,OAAL,EAAc;YACN/S,OAAK,GAAGiT,MAAM,CAACxM,OAArB;YACM,CAACxF,MAAD,IAASxC,MAAM,CAACiF,IAAP,CAAY/E,MAAZ,EAAoBqB,OAApB,CAAf;YACM;UAAEd,IAAI,EAAJA;YAASc,OAAjB;;YACM9C,OAAM,GAAG2V,YAAY,GAAGnS,KAAK,CAACxD,MAAT,GAAkB,CAA7C;;YACMD,KAAI,GAAGgE,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,OAAhB,EAAwBiD,GAAG,CAACjD,MAA5B,CAAb;;QACAyB,MAAM,CAAC0D,KAAP,CAAa;UAAE2F,IAAI,EAAE,aAAR;UAAuB9I,IAAI,EAAJA,MAAvB;UAA6BhC,MAAM,EAANA,OAA7B;UAAqCD,IAAI,EAAJA;SAAlD;;;UAIA,CAAC4V,YAAD,IACAD,cADA,IAEAK,MAAM,CAACxM,OAFP,IAGAuM,QAAQ,CAACvM,OAJX,EAKE;QACAyI,UAAU,CAACS,UAAX,CAAsBhR,MAAtB,EAA8B;UAC5BI,EAAE,EAAEkU,MAAM,CAACxM,OADiB;UAE5BuI,OAAO,EAAE,IAFmB;UAG5BnQ;SAHF;;;UAOImB,KAAK,GAAGiT,MAAM,CAACvM,KAAP,MAAkBsM,QAAQ,CAACtM,KAAT,EAAhC;;UAEI9H,OAAO,CAACG,EAAR,IAAc,IAAd,IAAsBiB,KAA1B,EAAiC;QAC/BkP,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BqB,KAA1B;;KAxJJ;GAhB0B;;;;;EAiL5B8B,cAAc,CACZnD,MADY,EAEZuC,QAFY;QAGZtC,8EAII;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEqQ,OAAO,GAAG,KAAZ;QAAmBnQ,KAAK,GAAG;UAAUD,OAA3C;UACI;QAAEG,EAAE,GAAGJ,MAAM,CAACK;UAAcJ,OAAhC;;UAEI,CAACsC,QAAQ,CAACtD,MAAd,EAAsB;;;;UAIlB,CAACmB,EAAL,EAAS;;OAAT,MAEO,IAAI4D,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;YACxB,CAACiQ,OAAL,EAAc;UACZjQ,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,CAAL;;;YAGE4D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAJ,EAA2B;UACzBA,EAAE,GAAGA,EAAE,CAACgB,MAAR;SADF,MAEO;cACC,GAAGI,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAAhB;;cAEI,CAACF,KAAD,IAAUJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;YAAEI,EAAE,EAAEoB;WAA1B,CAAd,EAAgD;;;;cAI1C6G,QAAQ,GAAGvI,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAjB;UACA+O,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;YAAEI;WAA5B;UACAA,EAAE,GAAGiI,QAAQ,CAACN,KAAT,EAAL;;OAhBG,MAkBA,IAAIjH,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;QAC1BA,EAAE,GAAGN,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBI,EAArB,CAAL;;;UAGE,CAACF,KAAD,IAAUJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI;OAAtB,CAAd,EAA2C;;;;;;UAMrCmU,kBAAkB,GAAGzU,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QAC9CI,EAD8C;QAE9CE,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CAFkC;QAG9CN,IAAI,EAAE,SAHwC;QAI9CD;OAJyB,CAA3B;;UAOIqU,kBAAJ,EAAwB;YAChB,GAAGC,WAAH,IAAiBD,kBAAvB;;YAEIzU,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBI,EAArB,EAAyBoU,WAAzB,CAAJ,EAA0C;cAClCrT,KAAK,GAAGrB,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBwU,WAArB,CAAd;UACApU,EAAE,GAAGe,KAAL;SAFF,MAGO,IAAIrB,MAAM,CAAC2E,OAAP,CAAezE,MAAf,EAAuBI,EAAvB,EAA2BoU,WAA3B,CAAJ,EAA4C;cAC3C1S,MAAM,GAAGhC,MAAM,CAACgC,MAAP,CAAc9B,MAAd,EAAsBwU,WAAtB,CAAf;UACApU,EAAE,GAAG0B,MAAL;;;;UAIE2S,UAAU,GAAG3U,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QACtCM,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAD0B;QAEtCL,EAFsC;QAGtCF;OAHiB,CAAnB;UAKM,GAAGqF,SAAH,IAAgBkP,UAAtB;UACMC,YAAY,GAAG5U,MAAM,CAAC2E,OAAP,CAAezE,MAAf,EAAuBI,EAAvB,EAA2BmF,SAA3B,CAArB;UACMoP,UAAU,GAAG7U,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBI,EAArB,EAAyBmF,SAAzB,CAAnB;UACMqP,UAAU,GAAG,CAACF,YAAD,IAAkBA,YAAY,IAAIC,UAArD;UACME,QAAQ,GAAG,CAACF,UAAlB;UACM,GAAGpN,SAAH,IAAgB/E,IAAI,CAACH,KAAL,CAAW;QAAEM,QAAQ,EAAEJ;OAAvB,EAAmC,EAAnC,CAAtB;UACM,GAAGiF,QAAH,IAAehF,IAAI,CAACsC,IAAL,CAAU;QAAEnC,QAAQ,EAAEJ;OAAtB,EAAkC,EAAlC,CAArB;UAEM8D,OAAO,GAAgB,EAA7B;;UACMyO,OAAO,GAAG;YAAC,CAACrU,CAAD,EAAIC,CAAJ;;YAEbkU,UAAU,IACV9T,IAAI,CAAC0E,UAAL,CAAgB9E,CAAhB,EAAmB6G,SAAnB,CADA,IAEAjE,OAAO,CAACC,SAAR,CAAkB9C,CAAlB,CAFA,IAGA,CAACT,MAAM,CAAC2D,MAAP,CAAclD,CAAd,CAHD,IAIA,CAACT,MAAM,CAAC+C,QAAP,CAAgBtC,CAAhB,CALH,EAME;iBACO,KAAP;;;YAIAoU,QAAQ,IACR/T,IAAI,CAAC0E,UAAL,CAAgB9E,CAAhB,EAAmB8G,QAAnB,CADA,IAEAlE,OAAO,CAACC,SAAR,CAAkB9C,CAAlB,CAFA,IAGA,CAACT,MAAM,CAAC2D,MAAP,CAAclD,CAAd,CAHD,IAIA,CAACT,MAAM,CAAC+C,QAAP,CAAgBtC,CAAhB,CALH,EAME;iBACO,KAAP;;;eAGK,IAAP;OArBF;;WAwBK,IAAM2G,KAAX,IAAoB5E,IAAI,CAAC0C,KAAL,CAClB;QAAEvC,QAAQ,EAAEJ;OADM,EAElB;QAAE6D,IAAI,EAAE0O;OAFU,CAApB,EAGG;YACG1N,KAAK,CAAC,CAAD,CAAL,CAASnI,MAAT,GAAkB,CAAlB,IAAuB6V,OAAO,CAAC1N,KAAD,CAAlC,EAA2C;UACzCf,OAAO,CAACrB,IAAR,CAAaoC,KAAb;;;;UAIE2N,MAAM,GAAG,EAAf;UACMC,OAAO,GAAG,EAAhB;UACMC,IAAI,GAAG,EAAb;UACIC,QAAQ,GAAG,IAAf;UACIzS,SAAS,GAAG,KAAhB;;WAEK,IAAM,CAACH,IAAD,CAAX,IAAqB+D,OAArB,EAA8B;YACxB/C,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,KAA2B,CAACtC,MAAM,CAAC+C,QAAP,CAAgBT,IAAhB,CAAhC,EAAuD;UACrD4S,QAAQ,GAAG,KAAX;UACAzS,SAAS,GAAG,IAAZ;UACAuS,OAAO,CAAChQ,IAAR,CAAa1C,IAAb;SAHF,MAIO,IAAI4S,QAAJ,EAAc;UACnBH,MAAM,CAAC/P,IAAP,CAAY1C,IAAZ;SADK,MAEA;UACL2S,IAAI,CAACjQ,IAAL,CAAU1C,IAAV;;;;UAIE,CAAC6S,WAAD,IAAgBrV,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QACzCI,EADyC;QAEzCE,KAAK,EAAEG,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CAFW;QAGzCN,IAAI,EAAE,SAHmC;QAIzCD;OAJoB,CAAtB;UAOM,GAAGsU,UAAH,IAAiBW,WAAvB;UACMC,aAAa,GAAGtV,MAAM,CAAC2E,OAAP,CAAezE,MAAf,EAAuBI,EAAvB,EAA2BoU,UAA3B,CAAtB;UACMa,WAAW,GAAGvV,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBI,EAArB,EAAyBoU,UAAzB,CAApB;UAEMc,SAAS,GAAGxV,MAAM,CAAC6H,OAAP,CAChB3H,MADgB,EAEhB2U,UAAU,GAAG7T,IAAI,CAAClB,IAAL,CAAU2F,SAAV,CAAH,GAA0BA,SAFpB,CAAlB;UAKM+O,MAAM,GAAGxU,MAAM,CAAC6H,OAAP,CACb3H,MADa,EAEbqV,WAAW,GAAGvU,IAAI,CAAClB,IAAL,CAAU4U,UAAV,CAAH,GAA2BA,UAFzB,CAAf;MAKAjE,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;QAC5BI,EAD4B;QAE5BE,KAAK,EAAEG,CAAC,IACNgC,SAAS,GACL3C,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CADK,GAELG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CALI;QAM5BN,IAAI,EAAEsC,SAAS,GAAG,QAAH,GAAc,SAND;QAO5BvC;OAPF;UAUMmU,QAAQ,GAAGvU,MAAM,CAAC6H,OAAP,CACf3H,MADe,EAEf,CAACoV,aAAD,IAAmBA,aAAa,IAAIC,WAApC,GACIvU,IAAI,CAAClB,IAAL,CAAU4U,UAAV,CADJ,GAEIA,UAJW,CAAjB;MAOAjE,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+B+U,MAA/B,EAAuC;QACrC3U,EAAE,EAAEiU,QAAQ,CAACvM,OADwB;QAErCxH,KAAK,EAAEG,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CAFO;QAGrCN,IAAI,EAAE,SAH+B;QAIrCD;OAJF;MAOAqQ,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BgV,OAA/B,EAAwC;QACtC5U,EAAE,EAAEkV,SAAS,CAACxN,OADwB;QAEtCxH,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAF0B;QAGtCN,IAAI,EAAE,QAHgC;QAItCD;OAJF;MAOAqQ,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BiV,IAA/B,EAAqC;QACnC7U,EAAE,EAAEkU,MAAM,CAACxM,OADwB;QAEnCxH,KAAK,EAAEG,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CAFK;QAGnCN,IAAI,EAAE,SAH6B;QAInCD;OAJF;;UAOI,CAACD,OAAO,CAACG,EAAb,EAAiB;YACXG,IAAJ;;YAEI0U,IAAI,CAAChW,MAAL,GAAc,CAAlB,EAAqB;UACnBsB,IAAI,GAAGO,IAAI,CAACqE,QAAL,CAAcmP,MAAM,CAACxM,OAArB,CAAP;SADF,MAEO,IAAIkN,OAAO,CAAC/V,MAAR,GAAiB,CAArB,EAAwB;UAC7BsB,IAAI,GAAGO,IAAI,CAACqE,QAAL,CAAcmQ,SAAS,CAACxN,OAAxB,CAAP;SADK,MAEA;UACLvH,IAAI,GAAGO,IAAI,CAACqE,QAAL,CAAckP,QAAQ,CAACvM,OAAvB,CAAP;;;YAGItG,IAAG,GAAG1B,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmBO,IAAnB,CAAZ;;QACAgQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BwB,IAA1B;;;MAGF6S,QAAQ,CAACtM,KAAT;MACAuN,SAAS,CAACvN,KAAV;MACAuM,MAAM,CAACvM,KAAP;KAtMF;GA1L0B;;;;;EAwY5B1E,UAAU,CACRrD,MADQ,EAER1B,IAFQ;QAGR2B,8EAGI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEE,KAAK,GAAG;UAAUD,OAA1B;UACI;QAAEG,EAAE,GAAGJ,MAAM,CAACK;UAAcJ,OAAhC;;UAEI,CAACG,EAAL,EAAS;;;;UAILU,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;QACnBA,EAAE,GAAGN,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBI,EAArB,CAAL;;;UAGE4D,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;YACjB4D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAJ,EAA2B;UACzBA,EAAE,GAAGA,EAAE,CAACgB,MAAR;SADF,MAEO;cACCI,GAAG,GAAGwC,KAAK,CAACxC,GAAN,CAAUpB,EAAV,CAAZ;;cAEI,CAACF,KAAD,IAAUJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;YAAEI,EAAE,EAAEoB;WAA1B,CAAd,EAAgD;;;;cAI1C6G,QAAQ,GAAGvI,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAjB;UACA+O,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;YAAEI,EAAF;YAAMF;WAAhC;UACAE,EAAE,GAAGiI,QAAQ,CAACN,KAAT,EAAL;UACAwI,UAAU,CAACmD,YAAX,CAAwB1T,MAAxB,EAAgC;YAAEoB,MAAM,EAAEhB,EAAV;YAAcmB,KAAK,EAAEnB;WAArD;;;;UAIA,CAACF,KAAD,IAAUJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI;OAAtB,CAAd,EAA2C;;;;UAIrC;QAAEG,IAAF;QAAQhC;UAAW6B,EAAzB;MACAJ,MAAM,CAAC0D,KAAP,CAAa;QAAE2F,IAAI,EAAE,aAAR;QAAuB9I,IAAvB;QAA6BhC,MAA7B;QAAqCD;OAAlD;KAlCF;;;CAhZG;;;;;ICRMiS,UAAU,uBAClBL,iBADkB,MAElBC,cAFkB,MAGlBkD,mBAHkB,MAIlBS,cAJkB,CAAhB;;;;;ACYP;;;;AAIA,IAAayB,YAAY,GAAG;MACpBvV,MAAM,GAAW;IACrB2C,QAAQ,EAAE,EADW;IAErB0B,UAAU,EAAE,EAFS;IAGrBhE,SAAS,EAAE,IAHU;IAIrB0D,KAAK,EAAE,IAJc;IAKrBhB,QAAQ,EAAE,MAAM,KALK;IAMrBY,MAAM,EAAE,MAAM,KANO;IAOrBE,QAAQ,EAAE,QAPW;IASrBH,KAAK,EAAGyF,EAAD;WACA,IAAMtB,GAAX,IAAkB/H,MAAM,CAACkI,QAAP,CAAgBhI,MAAhB,CAAlB,EAA2C;QACzCwO,OAAO,CAACtF,SAAR,CAAkBrB,GAAlB,EAAuBsB,EAAvB;;;WAGG,IAAMtB,IAAX,IAAkB/H,MAAM,CAACwI,SAAP,CAAiBtI,MAAjB,CAAlB,EAA4C;QAC1CyO,QAAQ,CAACvF,SAAT,CAAmBrB,IAAnB,EAAwBsB,EAAxB;;;WAGG,IAAMtB,KAAX,IAAkB/H,MAAM,CAACkJ,SAAP,CAAiBhJ,MAAjB,CAAlB,EAA4C;QAC1CyP,QAAQ,CAACvG,SAAT,CAAmBrB,KAAnB,EAAwBsB,EAAxB;;;UAGIpC,GAAG,GAAG,IAAIqB,GAAJ,EAAZ;UACMoN,UAAU,GAAW,EAA3B;;UAEMrN,GAAG,GAAI5H,IAAD;YACNA,IAAJ,EAAU;cACFU,GAAG,GAAGV,IAAI,CAACkM,IAAL,CAAU,GAAV,CAAZ;;cAEI,CAAC1F,GAAG,CAACoF,GAAJ,CAAQlL,GAAR,CAAL,EAAmB;YACjB8F,GAAG,CAACoB,GAAJ,CAAQlH,GAAR;YACAuU,UAAU,CAACxQ,IAAX,CAAgBzE,IAAhB;;;OANN;;UAWMkV,aAAa,GAAGjY,WAAW,CAACoH,GAAZ,CAAgB5E,MAAhB,KAA2B,EAAjD;UACM0V,aAAa,GAAG9O,aAAa,CAACuC,EAAD,CAAnC;;WAEK,IAAM5I,IAAX,IAAmBkV,aAAnB,EAAkC;YAC1BhM,OAAO,GAAG3I,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,CAAhB;QACAhB,GAAG,CAACsB,OAAD,CAAH;;;WAGG,IAAMlJ,KAAX,IAAmBmV,aAAnB,EAAkC;QAChCvN,GAAG,CAAC5H,KAAD,CAAH;;;MAGF/C,WAAW,CAACuJ,GAAZ,CAAgB/G,MAAhB,EAAwBwV,UAAxB;MACA1V,MAAM,CAACoJ,SAAP,CAAiBlJ,MAAjB,EAAyBmJ,EAAzB;MACAnJ,MAAM,CAACqE,UAAP,CAAkBW,IAAlB,CAAuBmE,EAAvB;MACArJ,MAAM,CAAC4G,SAAP,CAAiB1G,MAAjB;;UAGImJ,EAAE,CAACE,IAAH,KAAY,eAAhB,EAAiC;QAC/BrJ,MAAM,CAAC+D,KAAP,GAAe,IAAf;;;UAGE,CAACrG,QAAQ,CAACkH,GAAT,CAAa5E,MAAb,CAAL,EAA2B;QACzBtC,QAAQ,CAACqJ,GAAT,CAAa/G,MAAb,EAAqB,IAArB;QAEA2V,OAAO,CAACC,OAAR,GAAkBC,IAAlB,CAAuB;UACrBnY,QAAQ,CAACqJ,GAAT,CAAa/G,MAAb,EAAqB,KAArB;UACAA,MAAM,CAAC6D,QAAP;UACA7D,MAAM,CAACqE,UAAP,GAAoB,EAApB;SAHF;;KA7DiB;IAqErBrD,OAAO,EAAE,CAACC,GAAD,EAAcC,KAAd;UACD;QAAEb;UAAcL,MAAtB;;UAEIK,SAAJ,EAAe;YACT2D,KAAK,CAACiB,UAAN,CAAiB5E,SAAjB,CAAJ,EAAiC;UAC/BkQ,UAAU,CAACiB,QAAX,CACExR,MADF,EAEE;aAAGiB,GAAD,GAAOC;WAFX,EAGE;YAAEZ,KAAK,EAAEM,IAAI,CAACC,MAAd;YAAsB4Q,KAAK,EAAE;WAH/B;SADF,MAMO;cACC1N,KAAK,uBACLjE,MAAM,CAACiE,KAAP,CAAa/D,MAAb,KAAwB,EADnB;aAERiB,GAAD,GAAOC;YAFT;;UAKAlB,MAAM,CAAC+D,KAAP,GAAeA,KAAf;UACA/D,MAAM,CAAC6D,QAAP;;;KAtFe;IA2FrB7B,cAAc,EAAGC,IAAD;UACR;QAAE5B;UAAcL,MAAtB;;UAEIK,SAAS,IAAI2D,KAAK,CAAC0G,WAAN,CAAkBrK,SAAlB,CAAjB,EAA+C;QAC7CkQ,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;UAAEiC,IAAF;UAAQzB,OAAO,EAAE;SAA3C;;KA/FiB;IAmGrB0B,aAAa,EAAGD,IAAD;UACP;QAAE5B;UAAcL,MAAtB;;UAEIK,SAAS,IAAI2D,KAAK,CAAC0G,WAAN,CAAkBrK,SAAlB,CAAjB,EAA+C;QAC7CkQ,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;UAAEiC;SAA5B;;KAvGiB;IA2GrBE,cAAc,EAAE;UACR;QAAE9B;UAAcL,MAAtB;;UAEIK,SAAS,IAAI2D,KAAK,CAACiB,UAAN,CAAiB5E,SAAjB,CAAjB,EAA8C;QAC5CkQ,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB;;KA/GiB;IAmHrBkD,WAAW,EAAE;MACXqN,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;QAAE8R,MAAM,EAAE;OAAxC;KApHmB;IAuHrB3O,cAAc,EAAGZ,QAAD;MACdgO,UAAU,CAACpN,cAAX,CAA0BnD,MAA1B,EAAkCuC,QAAlC;KAxHmB;IA2HrBa,UAAU,EAAGd,IAAD;MACViO,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BsC,IAA/B;KA5HmB;IA+HrBe,UAAU,EAAG/E,IAAD;UACJ;QAAE+B,SAAF;QAAa0D;UAAU/D,MAA7B;;UAEIK,SAAJ,EAAe;;;YAGT2D,KAAK,CAAC0G,WAAN,CAAkBrK,SAAlB,CAAJ,EAAkC;cAC1ByV,MAAM,GAAGhW,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;YAClCM,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CADsB;YAElCN,IAAI,EAAE;WAFO,CAAf;;cAKI2V,MAAJ,EAAY;gBACJ,GAAGtB,UAAH,IAAiBsB,MAAvB;;gBAEIhW,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBK,SAAS,CAACe,MAA/B,EAAuCoT,UAAvC,CAAJ,EAAwD;kBAChDnT,KAAK,GAAGvB,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBwU,UAArB,CAAd;cACAjE,UAAU,CAACmD,YAAX,CAAwB1T,MAAxB,EAAgC;gBAC9BoB,MAAM,EAAEC,KADsB;gBAE9BE,KAAK,EAAEF;eAFT;;;;;YAQF0C,KAAJ,EAAW;cACHzB,IAAI;YAAKhE;aAASyF,KAAd,CAAV;;UACAwM,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BsC,IAA/B;SAFF,MAGO;UACLiO,UAAU,CAAClN,UAAX,CAAsBrD,MAAtB,EAA8B1B,IAA9B;;;QAGF0B,MAAM,CAAC+D,KAAP,GAAe,IAAf;;KA/JiB;IAmKrBH,aAAa,EAAGwD,KAAD;UACP,CAAC9E,IAAD,EAAO/B,IAAP,IAAe6G,KAArB;;UAGIxG,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;;;;;UAKnBgB,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,KAA2BA,IAAI,CAACK,QAAL,CAAc1D,MAAd,KAAyB,CAAxD,EAA2D;YACnDuM,KAAK,GAAG;UAAElN,IAAI,EAAE;SAAtB;QACAiS,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BwL,KAA/B,EAAsC;UACpCpL,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAY,CAAZ,CADgC;UAEpCzL,KAAK,EAAE;SAFT;;;;;UAQI6V,iBAAiB,GAAGjW,MAAM,CAAC0D,QAAP,CAAgBlB,IAAhB,IACtB,KADsB,GAEtBgB,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,MACCtC,MAAM,CAAC+C,QAAP,CAAgBT,IAAhB,KACCA,IAAI,CAACK,QAAL,CAAc1D,MAAd,KAAyB,CAD1B,IAEC2B,IAAI,CAACC,MAAL,CAAYyB,IAAI,CAACK,QAAL,CAAc,CAAd,CAAZ,CAFD,IAGC3C,MAAM,CAAC+C,QAAP,CAAgBT,IAAI,CAACK,QAAL,CAAc,CAAd,CAAhB,CAJF,CAFJ;;;UAUIlC,CAAC,GAAG,CAAR;;WAEK,IAAIvB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGoD,IAAI,CAACK,QAAL,CAAc1D,MAAlC,EAA0CC,CAAC,IAAIuB,CAAC,EAAhD,EAAoD;YAC5C+K,MAAK,GAAGlJ,IAAI,CAACK,QAAL,CAAczD,CAAd,CAAd;YACMV,IAAI,GAAG8D,IAAI,CAACK,QAAL,CAAczD,CAAC,GAAG,CAAlB,CAAb;YACM8W,MAAM,GAAG9W,CAAC,KAAKoD,IAAI,CAACK,QAAL,CAAc1D,MAAd,GAAuB,CAA5C;YACMgX,cAAc,GAClBrV,IAAI,CAACC,MAAL,CAAY2K,MAAZ,KACClI,OAAO,CAACC,SAAR,CAAkBiI,MAAlB,KAA4BxL,MAAM,CAAC+C,QAAP,CAAgByI,MAAhB,CAF/B,CAJkD;;;;;YAY9CyK,cAAc,KAAKF,iBAAvB,EAA0C;UACxCxF,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;YAAEI,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAZ,CAAN;YAAsBP,KAAK,EAAE;WAA5D;UACAO,CAAC;SAFH,MAGO,IAAI6C,OAAO,CAACC,SAAR,CAAkBiI,MAAlB,CAAJ,EAA8B;;cAE/BxL,MAAM,CAAC+C,QAAP,CAAgByI,MAAhB,CAAJ,EAA4B;gBACtBhN,IAAI,IAAI,IAAR,IAAgB,CAACoC,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAArB,EAAwC;kBAChC0X,QAAQ,GAAG;gBAAE5X,IAAI,EAAE;eAAzB;cACAiS,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BkW,QAA/B,EAAyC;gBACvC9V,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAZ,CADmC;gBAEvCP,KAAK,EAAE;eAFT;cAIAO,CAAC;aANH,MAOO,IAAIuV,MAAJ,EAAY;kBACXE,SAAQ,GAAG;gBAAE5X,IAAI,EAAE;eAAzB;cACAiS,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BkW,SAA/B,EAAyC;gBACvC9V,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAC,GAAG,CAAhB,CADmC;gBAEvCP,KAAK,EAAE;eAFT;cAIAO,CAAC;;;SAhBA,MAmBA;;cAEDjC,IAAI,IAAI,IAAR,IAAgBoC,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAApB,EAAuC;gBACjCoC,IAAI,CAACG,MAAL,CAAYyK,MAAZ,EAAmBhN,IAAnB,EAAyB;cAAEkR,KAAK,EAAE;aAAlC,CAAJ,EAA+C;cAC7Ca,UAAU,CAACS,UAAX,CAAsBhR,MAAtB,EAA8B;gBAAEI,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAZ,CAAN;gBAAsBP,KAAK,EAAE;eAA3D;cACAO,CAAC;aAFH,MAGO,IAAIjC,IAAI,CAACF,IAAL,KAAc,EAAlB,EAAsB;cAC3BiS,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;gBAC7BI,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAC,GAAG,CAAhB,CADyB;gBAE7BP,KAAK,EAAE;eAFT;cAIAO,CAAC;aALI,MAMA,IAAIuV,MAAM,IAAIxK,MAAK,CAAClN,IAAN,KAAe,EAA7B,EAAiC;cACtCiS,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;gBAC7BI,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAZ,CADyB;gBAE7BP,KAAK,EAAE;eAFT;cAIAO,CAAC;;;;;KArPU;IA4PrBqD,UAAU,EAAG7C,GAAD;UACJ;QAAEZ;UAAcL,MAAtB;;UAEIK,SAAJ,EAAe;YACT2D,KAAK,CAACiB,UAAN,CAAiB5E,SAAjB,CAAJ,EAAiC;UAC/BkQ,UAAU,CAACoC,UAAX,CAAsB3S,MAAtB,EAA8BiB,GAA9B,EAAmC;YACjCX,KAAK,EAAEM,IAAI,CAACC,MADqB;YAEjC4Q,KAAK,EAAE;WAFT;SADF,MAKO;cACC1N,KAAK,uBAASjE,MAAM,CAACiE,KAAP,CAAa/D,MAAb,KAAwB,EAAjC,CAAX;;iBACO+D,KAAK,CAAC9C,GAAD,CAAZ;UACAjB,MAAM,CAAC+D,KAAP,GAAeA,KAAf;UACA/D,MAAM,CAAC6D,QAAP;;;;GAzQR;SA+QO7D,MAAP;CAhRK;;;;;AAuRP,IAAM4G,aAAa,GAAIuC,EAAD;UACZA,EAAE,CAACE,IAAX;SACO,aAAL;SACK,aAAL;SACK,UAAL;;YACQ;UAAE9I;YAAS4I,EAAjB;eACOrI,IAAI,CAACH,MAAL,CAAYJ,IAAZ,CAAP;;;SAGG,aAAL;;YACQ;UAAE+B,IAAF;UAAQ/B,IAAI,EAAJA;YAAS4I,EAAvB;YACMxI,MAAM,GAAGG,IAAI,CAACH,MAAL,CAAYJ,MAAZ,CAAf;YACMuL,WAAW,GAAGlL,IAAI,CAACC,MAAL,CAAYyB,IAAZ,IAChB,EADgB,GAEhBwE,KAAK,CAACrB,IAAN,CAAWjD,IAAI,CAAC0C,KAAL,CAAW5C,IAAX,CAAX,EAA6B;cAAC,GAAG5B,CAAH,CAAD;iBAAWH,MAAI,CAACoL,MAAL,CAAYjL,CAAZ,CAAX;SAA7B,CAFJ;eAIO,CAAC,GAAGC,MAAJ,EAAY,GAAGmL,WAAf,CAAP;;;SAGG,YAAL;;YACQ;UAAEvL,IAAI,EAAJA;YAAS4I,EAAjB;YACMoC,SAAS,GAAGzK,IAAI,CAACyK,SAAL,CAAehL,MAAf,CAAlB;YACM4V,YAAY,GAAGrV,IAAI,CAACqE,QAAL,CAAc5E,MAAd,CAArB;eACO,CAAC,GAAGgL,SAAJ,EAAe4K,YAAf,CAAP;;;SAGG,WAAL;;YACQ;UAAE5V,IAAI,EAAJA,MAAF;UAAQkJ;YAAYN,EAA1B;;YAEIrI,IAAI,CAACC,MAAL,CAAYR,MAAZ,EAAkBkJ,OAAlB,CAAJ,EAAgC;iBACvB,EAAP;;;YAGI2M,YAAY,GAAW,EAA7B;YACMC,YAAY,GAAW,EAA7B;;aAEK,IAAMhL,QAAX,IAAuBvK,IAAI,CAACyK,SAAL,CAAehL,MAAf,CAAvB,EAA6C;cACrCG,CAAC,GAAGI,IAAI,CAACoI,SAAL,CAAemC,QAAf,EAAyBlC,EAAzB,CAAV;UACAiN,YAAY,CAACpR,IAAb,CAAkBtE,CAAlB;;;aAGG,IAAM2K,SAAX,IAAuBvK,IAAI,CAACyK,SAAL,CAAe9B,OAAf,CAAvB,EAAgD;cACxC/I,EAAC,GAAGI,IAAI,CAACoI,SAAL,CAAemC,SAAf,EAAyBlC,EAAzB,CAAV;;UACAkN,YAAY,CAACrR,IAAb,CAAkBtE,EAAlB;;;eAGK,CAAC,GAAG0V,YAAJ,EAAkB,GAAGC,YAArB,CAAP;;;SAGG,aAAL;;YACQ;UAAE9V,IAAI,EAAJA;YAAS4I,EAAjB;;YACMoC,UAAS,GAAGzK,IAAI,CAACyK,SAAL,CAAehL,MAAf,CAAlB;;eACO,CAAC,GAAGgL,UAAJ,CAAP;;;SAGG,YAAL;;YACQ;UAAEhL,IAAI,EAAJA;YAAS4I,EAAjB;;YACMxI,OAAM,GAAGG,IAAI,CAACH,MAAL,CAAYJ,MAAZ,CAAf;;YACM+V,QAAQ,GAAGxV,IAAI,CAAClB,IAAL,CAAUW,MAAV,CAAjB;eACO,CAAC,GAAGI,OAAJ,EAAY2V,QAAZ,CAAP;;;;;eAIO,EAAP;;;CA/DN;;;;;;;;;;;;;;;;;;"}
1
+ {"version":3,"file":"index.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/defineProperty.js","../../../node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js","../../../node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js","../src/utils/weak-maps.ts","../src/utils/string.ts","../src/interfaces/editor.ts","../src/interfaces/element.ts","../src/interfaces/location.ts","../src/interfaces/node.ts","../src/interfaces/operation.ts","../src/interfaces/path.ts","../src/interfaces/path-ref.ts","../src/interfaces/point.ts","../src/interfaces/point-ref.ts","../src/interfaces/range.ts","../src/interfaces/range-ref.ts","../src/interfaces/text.ts","../src/transforms/general.ts","../src/transforms/node.ts","../src/transforms/selection.ts","../src/transforms/text.ts","../src/transforms/index.ts","../src/create-editor.ts"],"sourcesContent":["export default function _defineProperty(obj, key, value) {\n if (key in obj) {\n Object.defineProperty(obj, key, {\n value: value,\n enumerable: true,\n configurable: true,\n writable: true\n });\n } else {\n obj[key] = value;\n }\n\n return obj;\n}","export default function _objectWithoutPropertiesLoose(source, excluded) {\n if (source == null) return {};\n var target = {};\n var sourceKeys = Object.keys(source);\n var key, i;\n\n for (i = 0; i < sourceKeys.length; i++) {\n key = sourceKeys[i];\n if (excluded.indexOf(key) >= 0) continue;\n target[key] = source[key];\n }\n\n return target;\n}","import objectWithoutPropertiesLoose from \"./objectWithoutPropertiesLoose\";\nexport default function _objectWithoutProperties(source, excluded) {\n if (source == null) return {};\n var target = objectWithoutPropertiesLoose(source, excluded);\n var key, i;\n\n if (Object.getOwnPropertySymbols) {\n var sourceSymbolKeys = Object.getOwnPropertySymbols(source);\n\n for (i = 0; i < sourceSymbolKeys.length; i++) {\n key = sourceSymbolKeys[i];\n if (excluded.indexOf(key) >= 0) continue;\n if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;\n target[key] = source[key];\n }\n }\n\n return target;\n}","import { Editor, Path, PathRef, PointRef, RangeRef } from '..'\n\nexport const DIRTY_PATHS: WeakMap<Editor, Path[]> = new WeakMap()\nexport const FLUSHING: WeakMap<Editor, boolean> = new WeakMap()\nexport const NORMALIZING: WeakMap<Editor, boolean> = new WeakMap()\nexport const PATH_REFS: WeakMap<Editor, Set<PathRef>> = new WeakMap()\nexport const POINT_REFS: WeakMap<Editor, Set<PointRef>> = new WeakMap()\nexport const RANGE_REFS: WeakMap<Editor, Set<RangeRef>> = new WeakMap()\n","/**\n * Constants for string distance checking.\n */\n\nconst SPACE = /\\s/\nconst PUNCTUATION = /[\\u0021-\\u0023\\u0025-\\u002A\\u002C-\\u002F\\u003A\\u003B\\u003F\\u0040\\u005B-\\u005D\\u005F\\u007B\\u007D\\u00A1\\u00A7\\u00AB\\u00B6\\u00B7\\u00BB\\u00BF\\u037E\\u0387\\u055A-\\u055F\\u0589\\u058A\\u05BE\\u05C0\\u05C3\\u05C6\\u05F3\\u05F4\\u0609\\u060A\\u060C\\u060D\\u061B\\u061E\\u061F\\u066A-\\u066D\\u06D4\\u0700-\\u070D\\u07F7-\\u07F9\\u0830-\\u083E\\u085E\\u0964\\u0965\\u0970\\u0AF0\\u0DF4\\u0E4F\\u0E5A\\u0E5B\\u0F04-\\u0F12\\u0F14\\u0F3A-\\u0F3D\\u0F85\\u0FD0-\\u0FD4\\u0FD9\\u0FDA\\u104A-\\u104F\\u10FB\\u1360-\\u1368\\u1400\\u166D\\u166E\\u169B\\u169C\\u16EB-\\u16ED\\u1735\\u1736\\u17D4-\\u17D6\\u17D8-\\u17DA\\u1800-\\u180A\\u1944\\u1945\\u1A1E\\u1A1F\\u1AA0-\\u1AA6\\u1AA8-\\u1AAD\\u1B5A-\\u1B60\\u1BFC-\\u1BFF\\u1C3B-\\u1C3F\\u1C7E\\u1C7F\\u1CC0-\\u1CC7\\u1CD3\\u2010-\\u2027\\u2030-\\u2043\\u2045-\\u2051\\u2053-\\u205E\\u207D\\u207E\\u208D\\u208E\\u2329\\u232A\\u2768-\\u2775\\u27C5\\u27C6\\u27E6-\\u27EF\\u2983-\\u2998\\u29D8-\\u29DB\\u29FC\\u29FD\\u2CF9-\\u2CFC\\u2CFE\\u2CFF\\u2D70\\u2E00-\\u2E2E\\u2E30-\\u2E3B\\u3001-\\u3003\\u3008-\\u3011\\u3014-\\u301F\\u3030\\u303D\\u30A0\\u30FB\\uA4FE\\uA4FF\\uA60D-\\uA60F\\uA673\\uA67E\\uA6F2-\\uA6F7\\uA874-\\uA877\\uA8CE\\uA8CF\\uA8F8-\\uA8FA\\uA92E\\uA92F\\uA95F\\uA9C1-\\uA9CD\\uA9DE\\uA9DF\\uAA5C-\\uAA5F\\uAADE\\uAADF\\uAAF0\\uAAF1\\uABEB\\uFD3E\\uFD3F\\uFE10-\\uFE19\\uFE30-\\uFE52\\uFE54-\\uFE61\\uFE63\\uFE68\\uFE6A\\uFE6B\\uFF01-\\uFF03\\uFF05-\\uFF0A\\uFF0C-\\uFF0F\\uFF1A\\uFF1B\\uFF1F\\uFF20\\uFF3B-\\uFF3D\\uFF3F\\uFF5B\\uFF5D\\uFF5F-\\uFF65]/\nconst CHAMELEON = /['\\u2018\\u2019]/\nconst SURROGATE_START = 0xd800\nconst SURROGATE_END = 0xdfff\nconst ZERO_WIDTH_JOINER = 0x200d\n\n/**\n * Get the distance to the end of the first character in a string of text.\n */\n\nexport const getCharacterDistance = (text: string): number => {\n let offset = 0\n // prev types:\n // SURR: surrogate pair\n // MOD: modifier (technically also surrogate pair)\n // ZWJ: zero width joiner\n // VAR: variation selector\n // BMP: sequenceable character from basic multilingual plane\n let prev: 'SURR' | 'MOD' | 'ZWJ' | 'VAR' | 'BMP' | null = null\n let charCode = text.charCodeAt(0)\n\n while (charCode) {\n if (isSurrogate(charCode)) {\n const modifier = isModifier(charCode, text, offset)\n\n // Early returns are the heart of this function, where we decide if previous and current\n // codepoints should form a single character (in terms of how many of them should selection\n // jump over).\n if (prev === 'SURR' || prev === 'BMP') {\n break\n }\n\n offset += 2\n prev = modifier ? 'MOD' : 'SURR'\n charCode = text.charCodeAt(offset)\n // Absolutely fine to `continue` without any checks because if `charCode` is NaN (which\n // is the case when out of `text` range), next `while` loop won\"t execute and we\"re done.\n continue\n }\n\n if (charCode === ZERO_WIDTH_JOINER) {\n offset += 1\n prev = 'ZWJ'\n charCode = text.charCodeAt(offset)\n\n continue\n }\n\n if (isBMPEmoji(charCode)) {\n if (prev && prev !== 'ZWJ' && prev !== 'VAR') {\n break\n }\n offset += 1\n prev = 'BMP'\n charCode = text.charCodeAt(offset)\n\n continue\n }\n\n if (isVariationSelector(charCode)) {\n if (prev && prev !== 'ZWJ') {\n break\n }\n offset += 1\n prev = 'VAR'\n charCode = text.charCodeAt(offset)\n continue\n }\n\n // Modifier 'groups up' with what ever character is before that (even whitespace), need to\n // look ahead.\n if (prev === 'MOD') {\n offset += 1\n break\n }\n\n // If while loop ever gets here, we're done (e.g latin chars).\n break\n }\n\n return offset || 1\n}\n\n/**\n * Get the distance to the end of the first word in a string of text.\n */\n\nexport const getWordDistance = (text: string): number => {\n let length = 0\n let i = 0\n let started = false\n let char\n\n while ((char = text.charAt(i))) {\n const l = getCharacterDistance(char)\n char = text.slice(i, i + l)\n const rest = text.slice(i + l)\n\n if (isWordCharacter(char, rest)) {\n started = true\n length += l\n } else if (!started) {\n length += l\n } else {\n break\n }\n\n i += l\n }\n\n return length\n}\n\n/**\n * Check if a character is a word character. The `remaining` argument is used\n * because sometimes you must read subsequent characters to truly determine it.\n */\n\nconst isWordCharacter = (char: string, remaining: string): boolean => {\n if (SPACE.test(char)) {\n return false\n }\n\n // Chameleons count as word characters as long as they're in a word, so\n // recurse to see if the next one is a word character or not.\n if (CHAMELEON.test(char)) {\n let next = remaining.charAt(0)\n const length = getCharacterDistance(next)\n next = remaining.slice(0, length)\n const rest = remaining.slice(length)\n\n if (isWordCharacter(next, rest)) {\n return true\n }\n }\n\n if (PUNCTUATION.test(char)) {\n return false\n }\n\n return true\n}\n\n/**\n * Determines if `code` is a surrogate\n */\n\nconst isSurrogate = (code: number): boolean =>\n SURROGATE_START <= code && code <= SURROGATE_END\n\n/**\n * Does `code` form Modifier with next one.\n *\n * https://emojipedia.org/modifiers/\n */\n\nconst isModifier = (code: number, text: string, offset: number): boolean => {\n if (code === 0xd83c) {\n const next = text.charCodeAt(offset + 1)\n return next <= 0xdfff && next >= 0xdffb\n }\n return false\n}\n\n/**\n * Is `code` a Variation Selector.\n *\n * https://codepoints.net/variation_selectors\n */\n\nconst isVariationSelector = (code: number): boolean => {\n return code <= 0xfe0f && code >= 0xfe00\n}\n\n/**\n * Is `code` one of the BMP codes used in emoji sequences.\n *\n * https://emojipedia.org/emoji-zwj-sequences/\n */\n\nconst isBMPEmoji = (code: number): boolean => {\n // This requires tiny bit of maintanance, better ideas?\n // Fortunately it only happens if new Unicode Standard\n // is released. Fails gracefully if upkeep lags behind,\n // same way Slate previously behaved with all emojis.\n return (\n code === 0x2764 || // heart (❤)\n code === 0x2642 || // male (♂)\n code === 0x2640 || // female (♀)\n code === 0x2620 || // scull (☠)\n code === 0x2695 || // medical (⚕)\n code === 0x2708 || // plane (✈️)\n code === 0x25ef // large circle (◯)\n )\n}\n","import isPlainObject from 'is-plain-object'\nimport { createDraft, finishDraft, isDraft } from 'immer'\nimport { reverse as reverseText } from 'esrever'\n\nimport {\n Ancestor,\n Descendant,\n Element,\n Location,\n Node,\n NodeEntry,\n Operation,\n Path,\n PathRef,\n Point,\n PointRef,\n Range,\n RangeRef,\n Span,\n Text,\n} from '..'\nimport {\n DIRTY_PATHS,\n NORMALIZING,\n PATH_REFS,\n POINT_REFS,\n RANGE_REFS,\n} from '../utils/weak-maps'\nimport { getWordDistance, getCharacterDistance } from '../utils/string'\n\n/**\n * The `Editor` interface stores all the state of a Slate editor. It is extended\n * by plugins that wish to add their own helpers and implement new behaviors.\n */\n\nexport interface Editor {\n children: Node[]\n selection: Range | null\n operations: Operation[]\n marks: Record<string, any> | null\n [key: string]: any\n\n // Schema-specific node behaviors.\n isInline: (element: Element) => boolean\n isVoid: (element: Element) => boolean\n normalizeNode: (entry: NodeEntry) => void\n onChange: () => void\n\n // Overrideable core actions.\n addMark: (key: string, value: any) => void\n apply: (operation: Operation) => void\n deleteBackward: (unit: 'character' | 'word' | 'line' | 'block') => void\n deleteForward: (unit: 'character' | 'word' | 'line' | 'block') => void\n deleteFragment: () => void\n getFragment: () => Descendant[]\n insertBreak: () => void\n insertFragment: (fragment: Node[]) => void\n insertNode: (node: Node) => void\n insertText: (text: string) => void\n removeMark: (key: string) => void\n}\n\nexport const Editor = {\n /**\n * Get the ancestor above a location in the document.\n */\n\n above<T extends Ancestor>(\n editor: Editor,\n options: {\n at?: Location\n match?: NodeMatch<T>\n mode?: 'highest' | 'lowest'\n voids?: boolean\n } = {}\n ): NodeEntry<T> | undefined {\n const {\n voids = false,\n mode = 'lowest',\n at = editor.selection,\n match,\n } = options\n\n if (!at) {\n return\n }\n\n const path = Editor.path(editor, at)\n const reverse = mode === 'lowest'\n\n for (const [n, p] of Editor.levels(editor, {\n at: path,\n voids,\n match,\n reverse,\n })) {\n if (!Text.isText(n) && !Path.equals(path, p)) {\n return [n, p]\n }\n }\n },\n\n /**\n * Add a custom property to the leaf text nodes in the current selection.\n *\n * If the selection is currently collapsed, the marks will be added to the\n * `editor.marks` property instead, and applied when text is inserted next.\n */\n\n addMark(editor: Editor, key: string, value: any): void {\n editor.addMark(key, value)\n },\n\n /**\n * Get the point after a location.\n */\n\n after(\n editor: Editor,\n at: Location,\n options: {\n distance?: number\n unit?: 'offset' | 'character' | 'word' | 'line' | 'block'\n } = {}\n ): Point | undefined {\n const anchor = Editor.point(editor, at, { edge: 'end' })\n const focus = Editor.end(editor, [])\n const range = { anchor, focus }\n const { distance = 1 } = options\n let d = 0\n let target\n\n for (const p of Editor.positions(editor, { ...options, at: range })) {\n if (d > distance) {\n break\n }\n\n if (d !== 0) {\n target = p\n }\n\n d++\n }\n\n return target\n },\n\n /**\n * Get the point before a location.\n */\n\n before(\n editor: Editor,\n at: Location,\n options: {\n distance?: number\n unit?: 'offset' | 'character' | 'word' | 'line' | 'block'\n } = {}\n ): Point | undefined {\n const anchor = Editor.start(editor, [])\n const focus = Editor.point(editor, at, { edge: 'start' })\n const range = { anchor, focus }\n const { distance = 1 } = options\n let d = 0\n let target\n\n for (const p of Editor.positions(editor, {\n ...options,\n at: range,\n reverse: true,\n })) {\n if (d > distance) {\n break\n }\n\n if (d !== 0) {\n target = p\n }\n\n d++\n }\n\n return target\n },\n\n /**\n * Delete content in the editor backward from the current selection.\n */\n\n deleteBackward(\n editor: Editor,\n options: {\n unit?: 'character' | 'word' | 'line' | 'block'\n } = {}\n ): void {\n const { unit = 'character' } = options\n editor.deleteBackward(unit)\n },\n\n /**\n * Delete content in the editor forward from the current selection.\n */\n\n deleteForward(\n editor: Editor,\n options: {\n unit?: 'character' | 'word' | 'line' | 'block'\n } = {}\n ): void {\n const { unit = 'character' } = options\n editor.deleteForward(unit)\n },\n\n /**\n * Delete the content in the current selection.\n */\n\n deleteFragment(editor: Editor): void {\n editor.deleteFragment()\n },\n\n /**\n * Get the start and end points of a location.\n */\n\n edges(editor: Editor, at: Location): [Point, Point] {\n return [Editor.start(editor, at), Editor.end(editor, at)]\n },\n\n /**\n * Get the end point of a location.\n */\n\n end(editor: Editor, at: Location): Point {\n return Editor.point(editor, at, { edge: 'end' })\n },\n\n /**\n * Get the first node at a location.\n */\n\n first(editor: Editor, at: Location): NodeEntry {\n const path = Editor.path(editor, at, { edge: 'start' })\n return Editor.node(editor, path)\n },\n\n /**\n * Get the fragment at a location.\n */\n\n fragment(editor: Editor, at: Location): Descendant[] {\n const range = Editor.range(editor, at)\n const fragment = Node.fragment(editor, range)\n return fragment\n },\n /**\n * Check if a node has block children.\n */\n\n hasBlocks(editor: Editor, element: Element): boolean {\n return element.children.some(n => Editor.isBlock(editor, n))\n },\n\n /**\n * Check if a node has inline and text children.\n */\n\n hasInlines(editor: Editor, element: Element): boolean {\n return element.children.some(\n n => Text.isText(n) || Editor.isInline(editor, n)\n )\n },\n\n /**\n * Check if a node has text children.\n */\n\n hasTexts(editor: Editor, element: Element): boolean {\n return element.children.every(n => Text.isText(n))\n },\n\n /**\n * Insert a block break at the current selection.\n *\n * If the selection is currently expanded, it will be deleted first.\n */\n\n insertBreak(editor: Editor): void {\n editor.insertBreak()\n },\n\n /**\n * Insert a fragment at the current selection.\n *\n * If the selection is currently expanded, it will be deleted first.\n */\n\n insertFragment(editor: Editor, fragment: Node[]): void {\n editor.insertFragment(fragment)\n },\n\n /**\n * Insert a node at the current selection.\n *\n * If the selection is currently expanded, it will be deleted first.\n */\n\n insertNode(editor: Editor, node: Node): void {\n editor.insertNode(node)\n },\n\n /**\n * Insert text at the current selection.\n *\n * If the selection is currently expanded, it will be deleted first.\n */\n\n insertText(editor: Editor, text: string): void {\n editor.insertText(text)\n },\n\n /**\n * Check if a value is a block `Element` object.\n */\n\n isBlock(editor: Editor, value: any): value is Element {\n return Element.isElement(value) && !editor.isInline(value)\n },\n\n /**\n * Check if a value is an `Editor` object.\n */\n\n isEditor(value: any): value is Editor {\n return (\n isPlainObject(value) &&\n typeof value.addMark === 'function' &&\n typeof value.apply === 'function' &&\n typeof value.deleteBackward === 'function' &&\n typeof value.deleteForward === 'function' &&\n typeof value.deleteFragment === 'function' &&\n typeof value.insertBreak === 'function' &&\n typeof value.insertFragment === 'function' &&\n typeof value.insertNode === 'function' &&\n typeof value.insertText === 'function' &&\n typeof value.isInline === 'function' &&\n typeof value.isVoid === 'function' &&\n typeof value.normalizeNode === 'function' &&\n typeof value.onChange === 'function' &&\n typeof value.removeMark === 'function' &&\n (value.marks === null || isPlainObject(value.marks)) &&\n (value.selection === null || Range.isRange(value.selection)) &&\n Node.isNodeList(value.children) &&\n Operation.isOperationList(value.operations)\n )\n },\n\n /**\n * Check if a point is the end point of a location.\n */\n\n isEnd(editor: Editor, point: Point, at: Location): boolean {\n const end = Editor.end(editor, at)\n return Point.equals(point, end)\n },\n\n /**\n * Check if a point is an edge of a location.\n */\n\n isEdge(editor: Editor, point: Point, at: Location): boolean {\n return Editor.isStart(editor, point, at) || Editor.isEnd(editor, point, at)\n },\n\n /**\n * Check if an element is empty, accounting for void nodes.\n */\n\n isEmpty(editor: Editor, element: Element): boolean {\n const { children } = element\n const [first] = children\n return (\n children.length === 0 ||\n (children.length === 1 &&\n Text.isText(first) &&\n first.text === '' &&\n !editor.isVoid(element))\n )\n },\n\n /**\n * Check if a value is an inline `Element` object.\n */\n\n isInline(editor: Editor, value: any): value is Element {\n return Element.isElement(value) && editor.isInline(value)\n },\n\n /**\n * Check if the editor is currently normalizing after each operation.\n */\n\n isNormalizing(editor: Editor): boolean {\n const isNormalizing = NORMALIZING.get(editor)\n return isNormalizing === undefined ? true : isNormalizing\n },\n\n /**\n * Check if a point is the start point of a location.\n */\n\n isStart(editor: Editor, point: Point, at: Location): boolean {\n // PERF: If the offset isn't `0` we know it's not the start.\n if (point.offset !== 0) {\n return false\n }\n\n const start = Editor.start(editor, at)\n return Point.equals(point, start)\n },\n\n /**\n * Check if a value is a void `Element` object.\n */\n\n isVoid(editor: Editor, value: any): value is Element {\n return Element.isElement(value) && editor.isVoid(value)\n },\n\n /**\n * Get the last node at a location.\n */\n\n last(editor: Editor, at: Location): NodeEntry {\n const path = Editor.path(editor, at, { edge: 'end' })\n return Editor.node(editor, path)\n },\n\n /**\n * Get the leaf text node at a location.\n */\n\n leaf(\n editor: Editor,\n at: Location,\n options: {\n depth?: number\n edge?: 'start' | 'end'\n } = {}\n ): NodeEntry<Text> {\n const path = Editor.path(editor, at, options)\n const node = Node.leaf(editor, path)\n return [node, path]\n },\n\n /**\n * Iterate through all of the levels at a location.\n */\n\n *levels<T extends Node>(\n editor: Editor,\n options: {\n at?: Location\n match?: NodeMatch<T>\n reverse?: boolean\n voids?: boolean\n } = {}\n ): Iterable<NodeEntry<T>> {\n const { at = editor.selection, reverse = false, voids = false } = options\n let { match } = options\n\n if (match == null) {\n match = () => true\n }\n\n if (!at) {\n return\n }\n\n const levels: NodeEntry<T>[] = []\n const path = Editor.path(editor, at)\n\n for (const [n, p] of Node.levels(editor, path)) {\n if (!match(n)) {\n continue\n }\n\n levels.push([n, p])\n\n if (!voids && Editor.isVoid(editor, n)) {\n break\n }\n }\n\n if (reverse) {\n levels.reverse()\n }\n\n yield* levels\n },\n\n /**\n * Get the marks that would be added to text at the current selection.\n */\n\n marks(editor: Editor): Record<string, any> | null {\n const { marks, selection } = editor\n\n if (!selection) {\n return null\n }\n\n if (marks) {\n return marks\n }\n\n if (Range.isExpanded(selection)) {\n const [match] = Editor.nodes(editor, { match: Text.isText })\n\n if (match) {\n const [node] = match as NodeEntry<Text>\n const { text, ...rest } = node\n return rest\n } else {\n return {}\n }\n }\n\n const { anchor } = selection\n const { path } = anchor\n let [node] = Editor.leaf(editor, path)\n\n if (anchor.offset === 0) {\n const prev = Editor.previous(editor, { at: path, match: Text.isText })\n const block = Editor.above(editor, {\n match: n => Editor.isBlock(editor, n),\n })\n\n if (prev && block) {\n const [prevNode, prevPath] = prev\n const [, blockPath] = block\n\n if (Path.isAncestor(blockPath, prevPath)) {\n node = prevNode as Text\n }\n }\n }\n\n const { text, ...rest } = node\n return rest\n },\n\n /**\n * Get the matching node in the branch of the document after a location.\n */\n\n next<T extends Node>(\n editor: Editor,\n options: {\n at?: Location\n match?: NodeMatch<T>\n mode?: 'all' | 'highest' | 'lowest'\n voids?: boolean\n } = {}\n ): NodeEntry<T> | undefined {\n const { mode = 'lowest', voids = false } = options\n let { match, at = editor.selection } = options\n\n if (!at) {\n return\n }\n\n const [, from] = Editor.last(editor, at)\n const [, to] = Editor.last(editor, [])\n const span: Span = [from, to]\n\n if (Path.isPath(at) && at.length === 0) {\n throw new Error(`Cannot get the next node from the root node!`)\n }\n\n if (match == null) {\n if (Path.isPath(at)) {\n const [parent] = Editor.parent(editor, at)\n match = n => parent.children.includes(n)\n } else {\n match = () => true\n }\n }\n\n const [, next] = Editor.nodes(editor, { at: span, match, mode, voids })\n return next\n },\n\n /**\n * Get the node at a location.\n */\n\n node(\n editor: Editor,\n at: Location,\n options: {\n depth?: number\n edge?: 'start' | 'end'\n } = {}\n ): NodeEntry {\n const path = Editor.path(editor, at, options)\n const node = Node.get(editor, path)\n return [node, path]\n },\n\n /**\n * Iterate through all of the nodes in the Editor.\n */\n\n *nodes<T extends Node>(\n editor: Editor,\n options: {\n at?: Location | Span\n match?: NodeMatch<T>\n mode?: 'all' | 'highest' | 'lowest'\n universal?: boolean\n reverse?: boolean\n voids?: boolean\n } = {}\n ): Iterable<NodeEntry<T>> {\n const {\n at = editor.selection,\n mode = 'all',\n universal = false,\n reverse = false,\n voids = false,\n } = options\n let { match } = options\n\n if (!match) {\n match = () => true\n }\n\n if (!at) {\n return\n }\n\n let from\n let to\n\n if (Span.isSpan(at)) {\n from = at[0]\n to = at[1]\n } else {\n const first = Editor.path(editor, at, { edge: 'start' })\n const last = Editor.path(editor, at, { edge: 'end' })\n from = reverse ? last : first\n to = reverse ? first : last\n }\n\n const iterable = Node.nodes(editor, {\n reverse,\n from,\n to,\n pass: ([n]) => (voids ? false : Editor.isVoid(editor, n)),\n })\n\n const matches: NodeEntry<T>[] = []\n let hit: NodeEntry<T> | undefined\n\n for (const [node, path] of iterable) {\n const isLower = hit && Path.compare(path, hit[1]) === 0\n\n // In highest mode any node lower than the last hit is not a match.\n if (mode === 'highest' && isLower) {\n continue\n }\n\n if (!match(node)) {\n // If we've arrived at a leaf text node that is not lower than the last\n // hit, then we've found a branch that doesn't include a match, which\n // means the match is not universal.\n if (universal && !isLower && Text.isText(node)) {\n return\n } else {\n continue\n }\n }\n\n // If there's a match and it's lower than the last, update the hit.\n if (mode === 'lowest' && isLower) {\n hit = [node, path]\n continue\n }\n\n // In lowest mode we emit the last hit, once it's guaranteed lowest.\n const emit: NodeEntry<T> | undefined =\n mode === 'lowest' ? hit : [node, path]\n\n if (emit) {\n if (universal) {\n matches.push(emit)\n } else {\n yield emit\n }\n }\n\n hit = [node, path]\n }\n\n // Since lowest is always emitting one behind, catch up at the end.\n if (mode === 'lowest' && hit) {\n if (universal) {\n matches.push(hit)\n } else {\n yield hit\n }\n }\n\n // Universal defers to ensure that the match occurs in every branch, so we\n // yield all of the matches after iterating.\n if (universal) {\n yield* matches\n }\n },\n /**\n * Normalize any dirty objects in the editor.\n */\n\n normalize(\n editor: Editor,\n options: {\n force?: boolean\n } = {}\n ) {\n const { force = false } = options\n const getDirtyPaths = (editor: Editor) => {\n return DIRTY_PATHS.get(editor) || []\n }\n\n if (!Editor.isNormalizing(editor)) {\n return\n }\n\n if (force) {\n const allPaths = Array.from(Node.nodes(editor), ([, p]) => p)\n DIRTY_PATHS.set(editor, allPaths)\n }\n\n if (getDirtyPaths(editor).length === 0) {\n return\n }\n\n Editor.withoutNormalizing(editor, () => {\n const max = getDirtyPaths(editor).length * 42 // HACK: better way?\n let m = 0\n\n while (getDirtyPaths(editor).length !== 0) {\n if (m > max) {\n throw new Error(`\n Could not completely normalize the editor after ${max} iterations! This is usually due to incorrect normalization logic that leaves a node in an invalid state.\n `)\n }\n\n const path = getDirtyPaths(editor).pop()!\n const entry = Editor.node(editor, path)\n editor.normalizeNode(entry)\n m++\n }\n })\n },\n\n /**\n * Get the parent node of a location.\n */\n\n parent(\n editor: Editor,\n at: Location,\n options: {\n depth?: number\n edge?: 'start' | 'end'\n } = {}\n ): NodeEntry<Ancestor> {\n const path = Editor.path(editor, at, options)\n const parentPath = Path.parent(path)\n const entry = Editor.node(editor, parentPath)\n return entry as NodeEntry<Ancestor>\n },\n\n /**\n * Get the path of a location.\n */\n\n path(\n editor: Editor,\n at: Location,\n options: {\n depth?: number\n edge?: 'start' | 'end'\n } = {}\n ): Path {\n const { depth, edge } = options\n\n if (Path.isPath(at)) {\n if (edge === 'start') {\n const [, firstPath] = Node.first(editor, at)\n at = firstPath\n } else if (edge === 'end') {\n const [, lastPath] = Node.last(editor, at)\n at = lastPath\n }\n }\n\n if (Range.isRange(at)) {\n if (edge === 'start') {\n at = Range.start(at)\n } else if (edge === 'end') {\n at = Range.end(at)\n } else {\n at = Path.common(at.anchor.path, at.focus.path)\n }\n }\n\n if (Point.isPoint(at)) {\n at = at.path\n }\n\n if (depth != null) {\n at = at.slice(0, depth)\n }\n\n return at\n },\n\n /**\n * Create a mutable ref for a `Path` object, which will stay in sync as new\n * operations are applied to the editor.\n */\n\n pathRef(\n editor: Editor,\n path: Path,\n options: {\n affinity?: 'backward' | 'forward' | null\n } = {}\n ): PathRef {\n const { affinity = 'forward' } = options\n const ref: PathRef = {\n current: path,\n affinity,\n unref() {\n const { current } = ref\n const pathRefs = Editor.pathRefs(editor)\n pathRefs.delete(ref)\n ref.current = null\n return current\n },\n }\n\n const refs = Editor.pathRefs(editor)\n refs.add(ref)\n return ref\n },\n\n /**\n * Get the set of currently tracked path refs of the editor.\n */\n\n pathRefs(editor: Editor): Set<PathRef> {\n let refs = PATH_REFS.get(editor)\n\n if (!refs) {\n refs = new Set()\n PATH_REFS.set(editor, refs)\n }\n\n return refs\n },\n\n /**\n * Get the start or end point of a location.\n */\n\n point(\n editor: Editor,\n at: Location,\n options: {\n edge?: 'start' | 'end'\n } = {}\n ): Point {\n const { edge = 'start' } = options\n\n if (Path.isPath(at)) {\n let path\n\n if (edge === 'end') {\n const [, lastPath] = Node.last(editor, at)\n path = lastPath\n } else {\n const [, firstPath] = Node.first(editor, at)\n path = firstPath\n }\n\n const node = Node.get(editor, path)\n\n if (!Text.isText(node)) {\n throw new Error(\n `Cannot get the ${edge} point in the node at path [${at}] because it has no ${edge} text node.`\n )\n }\n\n return { path, offset: edge === 'end' ? node.text.length : 0 }\n }\n\n if (Range.isRange(at)) {\n const [start, end] = Range.edges(at)\n return edge === 'start' ? start : end\n }\n\n return at\n },\n\n /**\n * Create a mutable ref for a `Point` object, which will stay in sync as new\n * operations are applied to the editor.\n */\n\n pointRef(\n editor: Editor,\n point: Point,\n options: {\n affinity?: 'backward' | 'forward' | null\n } = {}\n ): PointRef {\n const { affinity = 'forward' } = options\n const ref: PointRef = {\n current: point,\n affinity,\n unref() {\n const { current } = ref\n const pointRefs = Editor.pointRefs(editor)\n pointRefs.delete(ref)\n ref.current = null\n return current\n },\n }\n\n const refs = Editor.pointRefs(editor)\n refs.add(ref)\n return ref\n },\n\n /**\n * Get the set of currently tracked point refs of the editor.\n */\n\n pointRefs(editor: Editor): Set<PointRef> {\n let refs = POINT_REFS.get(editor)\n\n if (!refs) {\n refs = new Set()\n POINT_REFS.set(editor, refs)\n }\n\n return refs\n },\n\n /**\n * Iterate through all of the positions in the document where a `Point` can be\n * placed.\n *\n * By default it will move forward by individual offsets at a time, but you\n * can pass the `unit: 'character'` option to moved forward one character, word,\n * or line at at time.\n *\n * Note: void nodes are treated as a single point, and iteration will not\n * happen inside their content.\n */\n\n *positions(\n editor: Editor,\n options: {\n at?: Location\n unit?: 'offset' | 'character' | 'word' | 'line' | 'block'\n reverse?: boolean\n } = {}\n ): Iterable<Point> {\n const { at = editor.selection, unit = 'offset', reverse = false } = options\n\n if (!at) {\n return\n }\n\n const range = Editor.range(editor, at)\n const [start, end] = Range.edges(range)\n const first = reverse ? end : start\n let string = ''\n let available = 0\n let offset = 0\n let distance: number | null = null\n let isNewBlock = false\n\n const advance = () => {\n if (distance == null) {\n if (unit === 'character') {\n distance = getCharacterDistance(string)\n } else if (unit === 'word') {\n distance = getWordDistance(string)\n } else if (unit === 'line' || unit === 'block') {\n distance = string.length\n } else {\n distance = 1\n }\n\n string = string.slice(distance)\n }\n\n // Add or substract the offset.\n offset = reverse ? offset - distance : offset + distance\n // Subtract the distance traveled from the available text.\n available = available - distance!\n // If the available had room to spare, reset the distance so that it will\n // advance again next time. Otherwise, set it to the overflow amount.\n distance = available >= 0 ? null : 0 - available\n }\n\n for (const [node, path] of Editor.nodes(editor, { at, reverse })) {\n if (Element.isElement(node)) {\n // Void nodes are a special case, since we don't want to iterate over\n // their content. We instead always just yield their first point.\n if (editor.isVoid(node)) {\n yield Editor.start(editor, path)\n continue\n }\n\n if (editor.isInline(node)) {\n continue\n }\n\n if (Editor.hasInlines(editor, node)) {\n const e = Path.isAncestor(path, end.path)\n ? end\n : Editor.end(editor, path)\n const s = Path.isAncestor(path, start.path)\n ? start\n : Editor.start(editor, path)\n\n const text = Editor.string(editor, { anchor: s, focus: e })\n string = reverse ? reverseText(text) : text\n isNewBlock = true\n }\n }\n\n if (Text.isText(node)) {\n const isFirst = Path.equals(path, first.path)\n available = node.text.length\n offset = reverse ? available : 0\n\n if (isFirst) {\n available = reverse ? first.offset : available - first.offset\n offset = first.offset\n }\n\n if (isFirst || isNewBlock || unit === 'offset') {\n yield { path, offset }\n }\n\n while (true) {\n // If there's no more string, continue to the next block.\n if (string === '') {\n break\n } else {\n advance()\n }\n\n // If the available space hasn't overflow, we have another point to\n // yield in the current text node.\n if (available >= 0) {\n yield { path, offset }\n } else {\n break\n }\n }\n\n isNewBlock = false\n }\n }\n },\n\n /**\n * Get the matching node in the branch of the document before a location.\n */\n\n previous<T extends Node>(\n editor: Editor,\n options: {\n at?: Location\n match?: NodeMatch<T>\n mode?: 'all' | 'highest' | 'lowest'\n voids?: boolean\n } = {}\n ): NodeEntry<T> | undefined {\n const { mode = 'lowest', voids = false } = options\n let { match, at = editor.selection } = options\n\n if (!at) {\n return\n }\n\n const [, from] = Editor.first(editor, at)\n const [, to] = Editor.first(editor, [])\n const span: Span = [from, to]\n\n if (Path.isPath(at) && at.length === 0) {\n throw new Error(`Cannot get the previous node from the root node!`)\n }\n\n if (match == null) {\n if (Path.isPath(at)) {\n const [parent] = Editor.parent(editor, at)\n match = n => parent.children.includes(n)\n } else {\n match = () => true\n }\n }\n\n const [, previous] = Editor.nodes(editor, {\n reverse: true,\n at: span,\n match,\n mode,\n voids,\n })\n\n return previous\n },\n\n /**\n * Get a range of a location.\n */\n\n range(editor: Editor, at: Location, to?: Location): Range {\n if (Range.isRange(at) && !to) {\n return at\n }\n\n const start = Editor.start(editor, at)\n const end = Editor.end(editor, to || at)\n return { anchor: start, focus: end }\n },\n\n /**\n * Create a mutable ref for a `Range` object, which will stay in sync as new\n * operations are applied to the editor.\n */\n\n rangeRef(\n editor: Editor,\n range: Range,\n options: {\n affinity?: 'backward' | 'forward' | 'outward' | 'inward' | null\n } = {}\n ): RangeRef {\n const { affinity = 'forward' } = options\n const ref: RangeRef = {\n current: range,\n affinity,\n unref() {\n const { current } = ref\n const rangeRefs = Editor.rangeRefs(editor)\n rangeRefs.delete(ref)\n ref.current = null\n return current\n },\n }\n\n const refs = Editor.rangeRefs(editor)\n refs.add(ref)\n return ref\n },\n\n /**\n * Get the set of currently tracked range refs of the editor.\n */\n\n rangeRefs(editor: Editor): Set<RangeRef> {\n let refs = RANGE_REFS.get(editor)\n\n if (!refs) {\n refs = new Set()\n RANGE_REFS.set(editor, refs)\n }\n\n return refs\n },\n\n /**\n * Remove a custom property from all of the leaf text nodes in the current\n * selection.\n *\n * If the selection is currently collapsed, the removal will be stored on\n * `editor.marks` and applied to the text inserted next.\n */\n\n removeMark(editor: Editor, key: string): void {\n editor.removeMark(key)\n },\n\n /**\n * Get the start point of a location.\n */\n\n start(editor: Editor, at: Location): Point {\n return Editor.point(editor, at, { edge: 'start' })\n },\n\n /**\n * Get the text string content of a location.\n *\n * Note: the text of void nodes is presumed to be an empty string, regardless\n * of what their actual content is.\n */\n\n string(editor: Editor, at: Location): string {\n const range = Editor.range(editor, at)\n const [start, end] = Range.edges(range)\n let text = ''\n\n for (const [node, path] of Editor.nodes(editor, {\n at: range,\n match: Text.isText,\n })) {\n let t = node.text\n\n if (Path.equals(path, end.path)) {\n t = t.slice(0, end.offset)\n }\n\n if (Path.equals(path, start.path)) {\n t = t.slice(start.offset)\n }\n\n text += t\n }\n\n return text\n },\n\n /**\n * Transform the editor by an operation.\n */\n\n transform(editor: Editor, op: Operation) {\n editor.children = createDraft(editor.children)\n let selection = editor.selection && createDraft(editor.selection)\n\n switch (op.type) {\n case 'insert_node': {\n const { path, node } = op\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n parent.children.splice(index, 0, node)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'insert_text': {\n const { path, offset, text } = op\n const node = Node.leaf(editor, path)\n const before = node.text.slice(0, offset)\n const after = node.text.slice(offset)\n node.text = before + text + after\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'merge_node': {\n const { path } = op\n const node = Node.get(editor, path)\n const prevPath = Path.previous(path)\n const prev = Node.get(editor, prevPath)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n\n if (Text.isText(node) && Text.isText(prev)) {\n prev.text += node.text\n } else if (!Text.isText(node) && !Text.isText(prev)) {\n prev.children.push(...node.children)\n } else {\n throw new Error(\n `Cannot apply a \"merge_node\" operation at path [${path}] to nodes of different interaces: ${node} ${prev}`\n )\n }\n\n parent.children.splice(index, 1)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'move_node': {\n const { path, newPath } = op\n\n if (Path.isAncestor(path, newPath)) {\n throw new Error(\n `Cannot move a path [${path}] to new path [${newPath}] because the destination is inside itself.`\n )\n }\n\n const node = Node.get(editor, path)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n\n // This is tricky, but since the `path` and `newPath` both refer to\n // the same snapshot in time, there's a mismatch. After either\n // removing the original position, the second step's path can be out\n // of date. So instead of using the `op.newPath` directly, we\n // transform `op.path` to ascertain what the `newPath` would be after\n // the operation was applied.\n parent.children.splice(index, 1)\n const truePath = Path.transform(path, op)!\n const newParent = Node.get(editor, Path.parent(truePath))\n const newIndex = truePath[truePath.length - 1]\n\n newParent.children.splice(newIndex, 0, node)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'remove_node': {\n const { path } = op\n const index = path[path.length - 1]\n const parent = Node.parent(editor, path)\n parent.children.splice(index, 1)\n\n // Transform all of the points in the value, but if the point was in the\n // node that was removed we need to update the range or remove it.\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n const result = Point.transform(point, op)\n\n if (selection != null && result != null) {\n selection[key] = result\n } else {\n let prev: NodeEntry<Text> | undefined\n let next: NodeEntry<Text> | undefined\n\n for (const [n, p] of Node.texts(editor)) {\n if (Path.compare(p, path) === -1) {\n prev = [n, p]\n } else {\n next = [n, p]\n break\n }\n }\n\n if (prev) {\n point.path = prev[1]\n point.offset = prev[0].text.length\n } else if (next) {\n point.path = next[1]\n point.offset = 0\n } else {\n selection = null\n }\n }\n }\n }\n\n break\n }\n\n case 'remove_text': {\n const { path, offset, text } = op\n const node = Node.leaf(editor, path)\n const before = node.text.slice(0, offset)\n const after = node.text.slice(offset + text.length)\n node.text = before + after\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'set_node': {\n const { path, newProperties } = op\n\n if (path.length === 0) {\n throw new Error(`Cannot set properties on the root node!`)\n }\n\n const node = Node.get(editor, path)\n\n for (const key in newProperties) {\n if (key === 'children' || key === 'text') {\n throw new Error(`Cannot set the \"${key}\" property of nodes!`)\n }\n\n const value = newProperties[key]\n\n if (value == null) {\n delete node[key]\n } else {\n node[key] = value\n }\n }\n\n break\n }\n\n case 'set_selection': {\n const { newProperties } = op\n\n if (newProperties == null) {\n selection = newProperties\n } else if (selection == null) {\n if (!Range.isRange(newProperties)) {\n throw new Error(\n `Cannot apply an incomplete \"set_selection\" operation properties ${JSON.stringify(\n newProperties\n )} when there is no current selection.`\n )\n }\n\n selection = newProperties\n } else {\n Object.assign(selection, newProperties)\n }\n\n break\n }\n\n case 'split_node': {\n const { path, position, properties } = op\n\n if (path.length === 0) {\n throw new Error(\n `Cannot apply a \"split_node\" operation at path [${path}] because the root node cannot be split.`\n )\n }\n\n const node = Node.get(editor, path)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n let newNode: Descendant\n\n if (Text.isText(node)) {\n const before = node.text.slice(0, position)\n const after = node.text.slice(position)\n node.text = before\n newNode = {\n ...node,\n ...(properties as Partial<Text>),\n text: after,\n }\n } else {\n const before = node.children.slice(0, position)\n const after = node.children.slice(position)\n node.children = before\n\n newNode = {\n ...node,\n ...(properties as Partial<Element>),\n children: after,\n }\n }\n\n parent.children.splice(index + 1, 0, newNode)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n }\n\n editor.children = finishDraft(editor.children) as Node[]\n\n if (selection) {\n editor.selection = isDraft(selection)\n ? (finishDraft(selection) as Range)\n : selection\n } else {\n editor.selection = null\n }\n },\n\n /**\n * Convert a range into a non-hanging one.\n */\n\n unhangRange(\n editor: Editor,\n range: Range,\n options: {\n voids?: boolean\n } = {}\n ): Range {\n const { voids = false } = options\n let [start, end] = Range.edges(range)\n\n // PERF: exit early if we can guarantee that the range isn't hanging.\n if (start.offset !== 0 || end.offset !== 0 || Range.isCollapsed(range)) {\n return range\n }\n\n const endBlock = Editor.above(editor, {\n at: end,\n match: n => Editor.isBlock(editor, n),\n })\n const blockPath = endBlock ? endBlock[1] : []\n const first = Editor.start(editor, [])\n const before = { anchor: first, focus: end }\n let skip = true\n\n for (const [node, path] of Editor.nodes(editor, {\n at: before,\n match: Text.isText,\n reverse: true,\n voids,\n })) {\n if (skip) {\n skip = false\n continue\n }\n\n if (node.text !== '' || Path.isBefore(path, blockPath)) {\n end = { path, offset: node.text.length }\n break\n }\n }\n\n return { anchor: start, focus: end }\n },\n\n /**\n * Match a void node in the current branch of the editor.\n */\n\n void(\n editor: Editor,\n options: {\n at?: Location\n mode?: 'highest' | 'lowest'\n voids?: boolean\n } = {}\n ): NodeEntry<Element> | undefined {\n return Editor.above(editor, {\n ...options,\n match: n => Editor.isVoid(editor, n),\n })\n },\n\n /**\n * Call a function, deferring normalization until after it completes.\n */\n\n withoutNormalizing(editor: Editor, fn: () => void): void {\n const value = Editor.isNormalizing(editor)\n NORMALIZING.set(editor, false)\n fn()\n NORMALIZING.set(editor, value)\n Editor.normalize(editor)\n },\n}\n\n/**\n * A helper type for narrowing matched nodes with a predicate.\n */\n\ntype NodeMatch<T extends Node> =\n | ((node: Node) => node is T)\n | ((node: Node) => boolean)\n","import isPlainObject from 'is-plain-object'\nimport { Editor, Node, Path } from '..'\n\n/**\n * `Element` objects are a type of node in a Slate document that contain other\n * element nodes or text nodes. They can be either \"blocks\" or \"inlines\"\n * depending on the Slate editor's configuration.\n */\n\nexport interface Element {\n children: Node[]\n [key: string]: any\n}\n\nexport const Element = {\n /**\n * Check if a value implements the `Element` interface.\n */\n\n isElement(value: any): value is Element {\n return (\n isPlainObject(value) &&\n Node.isNodeList(value.children) &&\n !Editor.isEditor(value)\n )\n },\n\n /**\n * Check if a value is an array of `Element` objects.\n */\n\n isElementList(value: any): value is Element[] {\n return (\n Array.isArray(value) &&\n (value.length === 0 || Element.isElement(value[0]))\n )\n },\n\n /**\n * Check if an element matches set of properties.\n *\n * Note: this checks custom properties, and it does not ensure that any\n * children are equivalent.\n */\n\n matches(element: Element, props: Partial<Element>): boolean {\n for (const key in props) {\n if (key === 'children') {\n continue\n }\n\n if (element[key] !== props[key]) {\n return false\n }\n }\n\n return true\n },\n}\n\n/**\n * `ElementEntry` objects refer to an `Element` and the `Path` where it can be\n * found inside a root node.\n */\n\nexport type ElementEntry = [Element, Path]\n","import { Path, Point, Range } from '..'\n\n/**\n * The `Location` interface is a union of the ways to refer to a specific\n * location in a Slate document: paths, points or ranges.\n *\n * Methods will often accept a `Location` instead of requiring only a `Path`,\n * `Point` or `Range`. This eliminates the need for developers to manage\n * converting between the different interfaces in their own code base.\n */\n\nexport type Location = Path | Point | Range\n\nexport const Location = {\n /**\n * Check if a value implements the `Location` interface.\n */\n\n isLocation(value: any): value is Location {\n return Path.isPath(value) || Point.isPoint(value) || Range.isRange(value)\n },\n}\n\n/**\n * The `Span` interface is a low-level way to refer to locations in nodes\n * without using `Point` which requires leaf text nodes to be present.\n */\n\nexport type Span = [Path, Path]\n\nexport const Span = {\n /**\n * Check if a value implements the `Span` interface.\n */\n\n isSpan(value: any): value is Span {\n return (\n Array.isArray(value) && value.length === 2 && value.every(Path.isPath)\n )\n },\n}\n","import { produce } from 'immer'\nimport { Editor, Element, ElementEntry, Path, Range, Text } from '..'\n\n/**\n * The `Node` union type represents all of the different types of nodes that\n * occur in a Slate document tree.\n */\n\nexport type Node = Editor | Element | Text\n\nexport const Node = {\n /**\n * Get the node at a specific path, asserting that it's an ancestor node.\n */\n\n ancestor(root: Node, path: Path): Ancestor {\n const node = Node.get(root, path)\n\n if (Text.isText(node)) {\n throw new Error(\n `Cannot get the ancestor node at path [${path}] because it refers to a text node instead: ${node}`\n )\n }\n\n return node\n },\n\n /**\n * Return an iterable of all the ancestor nodes above a specific path.\n *\n * By default the order is bottom-up, from lowest to highest ancestor in\n * the tree, but you can pass the `reverse: true` option to go top-down.\n */\n\n *ancestors(\n root: Node,\n path: Path,\n options: {\n reverse?: boolean\n } = {}\n ): Iterable<NodeEntry<Ancestor>> {\n for (const p of Path.ancestors(path, options)) {\n const n = Node.ancestor(root, p)\n const entry: NodeEntry<Ancestor> = [n, p]\n yield entry\n }\n },\n\n /**\n * Get the child of a node at a specific index.\n */\n\n child(root: Node, index: number): Descendant {\n if (Text.isText(root)) {\n throw new Error(\n `Cannot get the child of a text node: ${JSON.stringify(root)}`\n )\n }\n\n const c = root.children[index] as Descendant\n\n if (c == null) {\n throw new Error(\n `Cannot get child at index \\`${index}\\` in node: ${JSON.stringify(\n root\n )}`\n )\n }\n\n return c\n },\n\n /**\n * Iterate over the children of a node at a specific path.\n */\n\n *children(\n root: Node,\n path: Path,\n options: {\n reverse?: boolean\n } = {}\n ): Iterable<NodeEntry<Descendant>> {\n const { reverse = false } = options\n const ancestor = Node.ancestor(root, path)\n const { children } = ancestor\n let index = reverse ? children.length - 1 : 0\n\n while (reverse ? index >= 0 : index < children.length) {\n const child = Node.child(ancestor, index)\n const childPath = path.concat(index)\n yield [child, childPath]\n index = reverse ? index - 1 : index + 1\n }\n },\n\n /**\n * Get an entry for the common ancesetor node of two paths.\n */\n\n common(root: Node, path: Path, another: Path): NodeEntry {\n const p = Path.common(path, another)\n const n = Node.get(root, p)\n return [n, p]\n },\n\n /**\n * Get the node at a specific path, asserting that it's a descendant node.\n */\n\n descendant(root: Node, path: Path): Descendant {\n const node = Node.get(root, path)\n\n if (Editor.isEditor(node)) {\n throw new Error(\n `Cannot get the descendant node at path [${path}] because it refers to the root editor node instead: ${node}`\n )\n }\n\n return node\n },\n\n /**\n * Return an iterable of all the descendant node entries inside a root node.\n */\n\n *descendants(\n root: Node,\n options: {\n from?: Path\n to?: Path\n reverse?: boolean\n pass?: (node: NodeEntry) => boolean\n } = {}\n ): Iterable<NodeEntry<Descendant>> {\n for (const [node, path] of Node.nodes(root, options)) {\n if (path.length !== 0) {\n // NOTE: we have to coerce here because checking the path's length does\n // guarantee that `node` is not a `Editor`, but TypeScript doesn't know.\n yield [node, path] as NodeEntry<Descendant>\n }\n }\n },\n\n /**\n * Return an iterable of all the element nodes inside a root node. Each iteration\n * will return an `ElementEntry` tuple consisting of `[Element, Path]`. If the\n * root node is an element it will be included in the iteration as well.\n */\n\n *elements(\n root: Node,\n options: {\n from?: Path\n to?: Path\n reverse?: boolean\n pass?: (node: NodeEntry) => boolean\n } = {}\n ): Iterable<ElementEntry> {\n for (const [node, path] of Node.nodes(root, options)) {\n if (Element.isElement(node)) {\n yield [node, path]\n }\n }\n },\n\n /**\n * Get the first node entry in a root node from a path.\n */\n\n first(root: Node, path: Path): NodeEntry {\n const p = path.slice()\n let n = Node.get(root, p)\n\n while (n) {\n if (Text.isText(n) || n.children.length === 0) {\n break\n } else {\n n = n.children[0]\n p.push(0)\n }\n }\n\n return [n, p]\n },\n\n /**\n * Get the sliced fragment represented by a range inside a root node.\n */\n\n fragment(root: Node, range: Range): Descendant[] {\n if (Text.isText(root)) {\n throw new Error(\n `Cannot get a fragment starting from a root text node: ${JSON.stringify(\n root\n )}`\n )\n }\n\n const newRoot = produce(root, r => {\n const [start, end] = Range.edges(range)\n const iterable = Node.nodes(r, {\n reverse: true,\n pass: ([, path]) => !Range.includes(range, path),\n })\n\n for (const [, path] of iterable) {\n if (!Range.includes(range, path)) {\n const parent = Node.parent(r, path)\n const index = path[path.length - 1]\n parent.children.splice(index, 1)\n }\n\n if (Path.equals(path, end.path)) {\n const leaf = Node.leaf(r, path)\n leaf.text = leaf.text.slice(0, end.offset)\n }\n\n if (Path.equals(path, start.path)) {\n const leaf = Node.leaf(r, path)\n leaf.text = leaf.text.slice(start.offset)\n }\n }\n\n delete r.selection\n })\n\n return newRoot.children\n },\n\n /**\n * Get the descendant node referred to by a specific path. If the path is an\n * empty array, it refers to the root node itself.\n */\n\n get(root: Node, path: Path): Node {\n let node = root\n\n for (let i = 0; i < path.length; i++) {\n const p = path[i]\n\n if (Text.isText(node) || !node.children[p]) {\n throw new Error(\n `Cannot find a descendant at path [${path}] in node: ${JSON.stringify(\n root\n )}`\n )\n }\n\n node = node.children[p]\n }\n\n return node\n },\n\n /**\n * Check if a descendant node exists at a specific path.\n */\n\n has(root: Node, path: Path): boolean {\n let node = root\n\n for (let i = 0; i < path.length; i++) {\n const p = path[i]\n\n if (Text.isText(node) || !node.children[p]) {\n return false\n }\n\n node = node.children[p]\n }\n\n return true\n },\n\n /**\n * Check if a value implements the `Node` interface.\n */\n\n isNode(value: any): value is Node {\n return (\n Text.isText(value) || Element.isElement(value) || Editor.isEditor(value)\n )\n },\n\n /**\n * Check if a value is a list of `Node` objects.\n */\n\n isNodeList(value: any): value is Node[] {\n return Array.isArray(value) && (value.length === 0 || Node.isNode(value[0]))\n },\n\n /**\n * Get the lash node entry in a root node from a path.\n */\n\n last(root: Node, path: Path): NodeEntry {\n const p = path.slice()\n let n = Node.get(root, p)\n\n while (n) {\n if (Text.isText(n) || n.children.length === 0) {\n break\n } else {\n const i = n.children.length - 1\n n = n.children[i]\n p.push(i)\n }\n }\n\n return [n, p]\n },\n\n /**\n * Get the node at a specific path, ensuring it's a leaf text node.\n */\n\n leaf(root: Node, path: Path): Text {\n const node = Node.get(root, path)\n\n if (!Text.isText(node)) {\n throw new Error(\n `Cannot get the leaf node at path [${path}] because it refers to a non-leaf node: ${node}`\n )\n }\n\n return node\n },\n\n /**\n * Return an iterable of the in a branch of the tree, from a specific path.\n *\n * By default the order is top-down, from lowest to highest node in the tree,\n * but you can pass the `reverse: true` option to go bottom-up.\n */\n\n *levels(\n root: Node,\n path: Path,\n options: {\n reverse?: boolean\n } = {}\n ): Iterable<NodeEntry> {\n for (const p of Path.levels(path, options)) {\n const n = Node.get(root, p)\n yield [n, p]\n }\n },\n\n /**\n * Check if a node matches a set of props.\n */\n\n matches(node: Node, props: Partial<Node>): boolean {\n return (\n (Element.isElement(node) && Element.matches(node, props)) ||\n (Text.isText(node) && Text.matches(node, props))\n )\n },\n\n /**\n * Return an iterable of all the node entries of a root node. Each entry is\n * returned as a `[Node, Path]` tuple, with the path referring to the node's\n * position inside the root node.\n */\n\n *nodes(\n root: Node,\n options: {\n from?: Path\n to?: Path\n reverse?: boolean\n pass?: (entry: NodeEntry) => boolean\n } = {}\n ): Iterable<NodeEntry> {\n const { pass, reverse = false } = options\n const { from = [], to } = options\n const visited = new Set()\n let p: Path = []\n let n = root\n\n while (true) {\n if (to && (reverse ? Path.isBefore(p, to) : Path.isAfter(p, to))) {\n break\n }\n\n if (!visited.has(n)) {\n yield [n, p]\n }\n\n // If we're allowed to go downward and we haven't decsended yet, do.\n if (\n !visited.has(n) &&\n !Text.isText(n) &&\n n.children.length !== 0 &&\n (pass == null || pass([n, p]) === false)\n ) {\n visited.add(n)\n let nextIndex = reverse ? n.children.length - 1 : 0\n\n if (Path.isAncestor(p, from)) {\n nextIndex = from[p.length]\n }\n\n p = p.concat(nextIndex)\n n = Node.get(root, p)\n continue\n }\n\n // If we're at the root and we can't go down, we're done.\n if (p.length === 0) {\n break\n }\n\n // If we're going forward...\n if (!reverse) {\n const newPath = Path.next(p)\n\n if (Node.has(root, newPath)) {\n p = newPath\n n = Node.get(root, p)\n continue\n }\n }\n\n // If we're going backward...\n if (reverse && p[p.length - 1] !== 0) {\n const newPath = Path.previous(p)\n p = newPath\n n = Node.get(root, p)\n continue\n }\n\n // Otherwise we're going upward...\n p = Path.parent(p)\n n = Node.get(root, p)\n visited.add(n)\n }\n },\n\n /**\n * Get the parent of a node at a specific path.\n */\n\n parent(root: Node, path: Path): Ancestor {\n const parentPath = Path.parent(path)\n const p = Node.get(root, parentPath)\n\n if (Text.isText(p)) {\n throw new Error(\n `Cannot get the parent of path [${path}] because it does not exist in the root.`\n )\n }\n\n return p\n },\n\n /**\n * Get the concatenated text string of a node's content.\n *\n * Note that this will not include spaces or line breaks between block nodes.\n * It is not a user-facing string, but a string for performing offset-related\n * computations for a node.\n */\n\n string(node: Node): string {\n if (Text.isText(node)) {\n return node.text\n } else {\n return node.children.map(Node.string).join('')\n }\n },\n\n /**\n * Return an iterable of all leaf text nodes in a root node.\n */\n\n *texts(\n root: Node,\n options: {\n from?: Path\n to?: Path\n reverse?: boolean\n pass?: (node: NodeEntry) => boolean\n } = {}\n ): Iterable<NodeEntry<Text>> {\n for (const [node, path] of Node.nodes(root, options)) {\n if (Text.isText(node)) {\n yield [node, path]\n }\n }\n },\n}\n\n/**\n * The `Descendant` union type represents nodes that are descendants in the\n * tree. It is returned as a convenience in certain cases to narrow a value\n * further than the more generic `Node` union.\n */\n\nexport type Descendant = Element | Text\n\n/**\n * The `Ancestor` union type represents nodes that are ancestors in the tree.\n * It is returned as a convenience in certain cases to narrow a value further\n * than the more generic `Node` union.\n */\n\nexport type Ancestor = Editor | Element\n\n/**\n * `NodeEntry` objects are returned when iterating over the nodes in a Slate\n * document tree. They consist of the node and its `Path` relative to the root\n * node in the document.\n */\n\nexport type NodeEntry<T extends Node = Node> = [T, Path]\n","import { Node, Path, Range } from '..'\nimport isPlainObject from 'is-plain-object'\n\nexport type InsertNodeOperation = {\n type: 'insert_node'\n path: Path\n node: Node\n [key: string]: any\n}\n\nexport type InsertTextOperation = {\n type: 'insert_text'\n path: Path\n offset: number\n text: string\n [key: string]: any\n}\n\nexport type MergeNodeOperation = {\n type: 'merge_node'\n path: Path\n position: number\n target: number | null\n properties: Partial<Node>\n [key: string]: any\n}\n\nexport type MoveNodeOperation = {\n type: 'move_node'\n path: Path\n newPath: Path\n [key: string]: any\n}\n\nexport type RemoveNodeOperation = {\n type: 'remove_node'\n path: Path\n node: Node\n [key: string]: any\n}\n\nexport type RemoveTextOperation = {\n type: 'remove_text'\n path: Path\n offset: number\n text: string\n [key: string]: any\n}\n\nexport type SetNodeOperation = {\n type: 'set_node'\n path: Path\n properties: Partial<Node>\n newProperties: Partial<Node>\n [key: string]: any\n}\n\nexport type SetSelectionOperation =\n | {\n type: 'set_selection'\n [key: string]: any\n properties: null\n newProperties: Range\n }\n | {\n type: 'set_selection'\n [key: string]: any\n properties: Partial<Range>\n newProperties: Partial<Range>\n }\n | {\n type: 'set_selection'\n [key: string]: any\n properties: Range\n newProperties: null\n }\n\nexport type SplitNodeOperation = {\n type: 'split_node'\n path: Path\n position: number\n target: number | null\n properties: Partial<Node>\n [key: string]: any\n}\n\nexport type NodeOperation =\n | InsertNodeOperation\n | MergeNodeOperation\n | MoveNodeOperation\n | RemoveNodeOperation\n | SetNodeOperation\n | SplitNodeOperation\n\nexport type SelectionOperation = SetSelectionOperation\n\nexport type TextOperation = InsertTextOperation | RemoveTextOperation\n\n/**\n * `Operation` objects define the low-level instructions that Slate editors use\n * to apply changes to their internal state. Representing all changes as\n * operations is what allows Slate editors to easily implement history,\n * collaboration, and other features.\n */\n\nexport type Operation = NodeOperation | SelectionOperation | TextOperation\n\nexport const Operation = {\n /**\n * Check of a value is a `NodeOperation` object.\n */\n\n isNodeOperation(value: any): value is NodeOperation {\n return Operation.isOperation(value) && value.type.endsWith('_node')\n },\n\n /**\n * Check of a value is an `Operation` object.\n */\n\n isOperation(value: any): value is Operation {\n if (!isPlainObject(value)) {\n return false\n }\n\n switch (value.type) {\n case 'insert_node':\n return Path.isPath(value.path) && Node.isNode(value.node)\n case 'insert_text':\n return (\n typeof value.offset === 'number' &&\n typeof value.text === 'string' &&\n Path.isPath(value.path)\n )\n case 'merge_node':\n return (\n typeof value.position === 'number' &&\n (typeof value.target === 'number' || value.target === null) &&\n Path.isPath(value.path) &&\n isPlainObject(value.properties)\n )\n case 'move_node':\n return Path.isPath(value.path) && Path.isPath(value.newPath)\n case 'remove_node':\n return Path.isPath(value.path) && Node.isNode(value.node)\n case 'remove_text':\n return (\n typeof value.offset === 'number' &&\n typeof value.text === 'string' &&\n Path.isPath(value.path)\n )\n case 'set_node':\n return (\n Path.isPath(value.path) &&\n isPlainObject(value.properties) &&\n isPlainObject(value.newProperties)\n )\n case 'set_selection':\n return (\n (value.properties === null && Range.isRange(value.newProperties)) ||\n (value.newProperties === null && Range.isRange(value.properties)) ||\n (isPlainObject(value.properties) &&\n isPlainObject(value.newProperties))\n )\n case 'split_node':\n return (\n Path.isPath(value.path) &&\n typeof value.position === 'number' &&\n (typeof value.target === 'number' || value.target === null) &&\n isPlainObject(value.properties)\n )\n default:\n return false\n }\n },\n\n /**\n * Check if a value is a list of `Operation` objects.\n */\n\n isOperationList(value: any): value is Operation[] {\n return (\n Array.isArray(value) &&\n (value.length === 0 || Operation.isOperation(value[0]))\n )\n },\n\n /**\n * Check of a value is a `SelectionOperation` object.\n */\n\n isSelectionOperation(value: any): value is SelectionOperation {\n return Operation.isOperation(value) && value.type.endsWith('_selection')\n },\n\n /**\n * Check of a value is a `TextOperation` object.\n */\n\n isTextOperation(value: any): value is TextOperation {\n return Operation.isOperation(value) && value.type.endsWith('_text')\n },\n\n /**\n * Invert an operation, returning a new operation that will exactly undo the\n * original when applied.\n */\n\n inverse(op: Operation): Operation {\n switch (op.type) {\n case 'insert_node': {\n return { ...op, type: 'remove_node' }\n }\n\n case 'insert_text': {\n return { ...op, type: 'remove_text' }\n }\n\n case 'merge_node': {\n return { ...op, type: 'split_node', path: Path.previous(op.path) }\n }\n\n case 'move_node': {\n const { newPath, path } = op\n\n // PERF: in this case the move operation is a no-op anyways.\n if (Path.equals(newPath, path)) {\n return op\n }\n\n // We need to get the original path here, but sometimes the `newPath`\n // is a younger sibling of (or ends before) the original, and this\n // accounts for it.\n const inversePath = Path.transform(path, op)!\n const inverseNewPath = Path.transform(Path.next(path), op)!\n return { ...op, path: inversePath, newPath: inverseNewPath }\n }\n\n case 'remove_node': {\n return { ...op, type: 'insert_node' }\n }\n\n case 'remove_text': {\n return { ...op, type: 'insert_text' }\n }\n\n case 'set_node': {\n const { properties, newProperties } = op\n return { ...op, properties: newProperties, newProperties: properties }\n }\n\n case 'set_selection': {\n const { properties, newProperties } = op\n\n if (properties == null) {\n return {\n ...op,\n properties: newProperties as Range,\n newProperties: null,\n }\n } else if (newProperties == null) {\n return {\n ...op,\n properties: null,\n newProperties: properties as Range,\n }\n } else {\n return { ...op, properties: newProperties, newProperties: properties }\n }\n }\n\n case 'split_node': {\n return { ...op, type: 'merge_node', path: Path.next(op.path) }\n }\n }\n },\n}\n","import { produce } from 'immer'\nimport { Operation } from '..'\n\n/**\n * `Path` arrays are a list of indexes that describe a node's exact position in\n * a Slate node tree. Although they are usually relative to the root `Editor`\n * object, they can be relative to any `Node` object.\n */\n\nexport type Path = number[]\n\nexport const Path = {\n /**\n * Get a list of ancestor paths for a given path.\n *\n * The paths are sorted from deepest to shallowest ancestor. However, if the\n * `reverse: true` option is passed, they are reversed.\n */\n\n ancestors(path: Path, options: { reverse?: boolean } = {}): Path[] {\n const { reverse = false } = options\n let paths = Path.levels(path, options)\n\n if (reverse) {\n paths = paths.slice(1)\n } else {\n paths = paths.slice(0, -1)\n }\n\n return paths\n },\n\n /**\n * Get the common ancestor path of two paths.\n */\n\n common(path: Path, another: Path): Path {\n const common: Path = []\n\n for (let i = 0; i < path.length && i < another.length; i++) {\n const av = path[i]\n const bv = another[i]\n\n if (av !== bv) {\n break\n }\n\n common.push(av)\n }\n\n return common\n },\n\n /**\n * Compare a path to another, returning an integer indicating whether the path\n * was before, at, or after the other.\n *\n * Note: Two paths of unequal length can still receive a `0` result if one is\n * directly above or below the other. If you want exact matching, use\n * [[Path.equals]] instead.\n */\n\n compare(path: Path, another: Path): -1 | 0 | 1 {\n const min = Math.min(path.length, another.length)\n\n for (let i = 0; i < min; i++) {\n if (path[i] < another[i]) return -1\n if (path[i] > another[i]) return 1\n }\n\n return 0\n },\n\n /**\n * Check if a path ends after one of the indexes in another.\n */\n\n endsAfter(path: Path, another: Path): boolean {\n const i = path.length - 1\n const as = path.slice(0, i)\n const bs = another.slice(0, i)\n const av = path[i]\n const bv = another[i]\n return Path.equals(as, bs) && av > bv\n },\n\n /**\n * Check if a path ends at one of the indexes in another.\n */\n\n endsAt(path: Path, another: Path): boolean {\n const i = path.length\n const as = path.slice(0, i)\n const bs = another.slice(0, i)\n return Path.equals(as, bs)\n },\n\n /**\n * Check if a path ends before one of the indexes in another.\n */\n\n endsBefore(path: Path, another: Path): boolean {\n const i = path.length - 1\n const as = path.slice(0, i)\n const bs = another.slice(0, i)\n const av = path[i]\n const bv = another[i]\n return Path.equals(as, bs) && av < bv\n },\n\n /**\n * Check if a path is exactly equal to another.\n */\n\n equals(path: Path, another: Path): boolean {\n return (\n path.length === another.length && path.every((n, i) => n === another[i])\n )\n },\n\n /**\n * Check if a path is after another.\n */\n\n isAfter(path: Path, another: Path): boolean {\n return Path.compare(path, another) === 1\n },\n\n /**\n * Check if a path is an ancestor of another.\n */\n\n isAncestor(path: Path, another: Path): boolean {\n return path.length < another.length && Path.compare(path, another) === 0\n },\n\n /**\n * Check if a path is before another.\n */\n\n isBefore(path: Path, another: Path): boolean {\n return Path.compare(path, another) === -1\n },\n\n /**\n * Check if a path is a child of another.\n */\n\n isChild(path: Path, another: Path): boolean {\n return (\n path.length === another.length + 1 && Path.compare(path, another) === 0\n )\n },\n\n /**\n * Check if a path is equal to or an ancestor of another.\n */\n\n isCommon(path: Path, another: Path): boolean {\n return path.length <= another.length && Path.compare(path, another) === 0\n },\n\n /**\n * Check if a path is a descendant of another.\n */\n\n isDescendant(path: Path, another: Path): boolean {\n return path.length > another.length && Path.compare(path, another) === 0\n },\n\n /**\n * Check if a path is the parent of another.\n */\n\n isParent(path: Path, another: Path): boolean {\n return (\n path.length + 1 === another.length && Path.compare(path, another) === 0\n )\n },\n\n /**\n * Check is a value implements the `Path` interface.\n */\n\n isPath(value: any): value is Path {\n return (\n Array.isArray(value) &&\n (value.length === 0 || typeof value[0] === 'number')\n )\n },\n\n /**\n * Check if a path is a sibling of another.\n */\n\n isSibling(path: Path, another: Path): boolean {\n if (path.length !== another.length) {\n return false\n }\n\n const as = path.slice(0, -1)\n const bs = another.slice(0, -1)\n const al = path[path.length - 1]\n const bl = another[another.length - 1]\n return al !== bl && Path.equals(as, bs)\n },\n\n /**\n * Get a list of paths at every level down to a path. Note: this is the same\n * as `Path.ancestors`, but including the path itself.\n *\n * The paths are sorted from shallowest to deepest. However, if the `reverse:\n * true` option is passed, they are reversed.\n */\n\n levels(\n path: Path,\n options: {\n reverse?: boolean\n } = {}\n ): Path[] {\n const { reverse = false } = options\n const list: Path[] = []\n\n for (let i = 0; i <= path.length; i++) {\n list.push(path.slice(0, i))\n }\n\n if (reverse) {\n list.reverse()\n }\n\n return list\n },\n\n /**\n * Given a path, get the path to the next sibling node.\n */\n\n next(path: Path): Path {\n if (path.length === 0) {\n throw new Error(\n `Cannot get the next path of a root path [${path}], because it has no next index.`\n )\n }\n\n const last = path[path.length - 1]\n return path.slice(0, -1).concat(last + 1)\n },\n\n /**\n * Given a path, return a new path referring to the parent node above it.\n */\n\n parent(path: Path): Path {\n if (path.length === 0) {\n throw new Error(`Cannot get the parent path of the root path [${path}].`)\n }\n\n return path.slice(0, -1)\n },\n\n /**\n * Given a path, get the path to the previous sibling node.\n */\n\n previous(path: Path): Path {\n if (path.length === 0) {\n throw new Error(\n `Cannot get the previous path of a root path [${path}], because it has no previous index.`\n )\n }\n\n const last = path[path.length - 1]\n\n if (last <= 0) {\n throw new Error(\n `Cannot get the previous path of a first child path [${path}] because it would result in a negative index.`\n )\n }\n\n return path.slice(0, -1).concat(last - 1)\n },\n\n /**\n * Get a path relative to an ancestor.\n */\n\n relative(path: Path, ancestor: Path): Path {\n if (!Path.isAncestor(ancestor, path) && !Path.equals(path, ancestor)) {\n throw new Error(\n `Cannot get the relative path of [${path}] inside ancestor [${ancestor}], because it is not above or equal to the path.`\n )\n }\n\n return path.slice(ancestor.length)\n },\n\n /**\n * Transform a path by an operation.\n */\n\n transform(\n path: Path,\n operation: Operation,\n options: { affinity?: 'forward' | 'backward' | null } = {}\n ): Path | null {\n return produce(path, p => {\n const { affinity = 'forward' } = options\n\n // PERF: Exit early if the operation is guaranteed not to have an effect.\n if (path.length === 0) {\n return\n }\n\n switch (operation.type) {\n case 'insert_node': {\n const { path: op } = operation\n\n if (\n Path.equals(op, p) ||\n Path.endsBefore(op, p) ||\n Path.isAncestor(op, p)\n ) {\n p[op.length - 1] += 1\n }\n\n break\n }\n\n case 'remove_node': {\n const { path: op } = operation\n\n if (Path.equals(op, p) || Path.isAncestor(op, p)) {\n return null\n } else if (Path.endsBefore(op, p)) {\n p[op.length - 1] -= 1\n }\n\n break\n }\n\n case 'merge_node': {\n const { path: op, position } = operation\n\n if (Path.equals(op, p) || Path.endsBefore(op, p)) {\n p[op.length - 1] -= 1\n } else if (Path.isAncestor(op, p)) {\n p[op.length - 1] -= 1\n p[op.length] += position\n }\n\n break\n }\n\n case 'split_node': {\n const { path: op, position } = operation\n\n if (Path.equals(op, p)) {\n if (affinity === 'forward') {\n p[p.length - 1] += 1\n } else if (affinity === 'backward') {\n // Nothing, because it still refers to the right path.\n } else {\n return null\n }\n } else if (Path.endsBefore(op, p)) {\n p[op.length - 1] += 1\n } else if (Path.isAncestor(op, p) && path[op.length] >= position) {\n p[op.length - 1] += 1\n p[op.length] -= position\n }\n\n break\n }\n\n case 'move_node': {\n const { path: op, newPath: onp } = operation\n\n // If the old and new path are the same, it's a no-op.\n if (Path.equals(op, onp)) {\n return\n }\n\n if (Path.isAncestor(op, p) || Path.equals(op, p)) {\n const copy = onp.slice()\n\n if (Path.endsBefore(op, onp) && op.length < onp.length) {\n const i = Math.min(onp.length, op.length) - 1\n copy[i] -= 1\n }\n\n return copy.concat(p.slice(op.length))\n } else if (\n Path.endsBefore(onp, p) ||\n Path.equals(onp, p) ||\n Path.isAncestor(onp, p)\n ) {\n if (Path.endsBefore(op, p)) {\n p[op.length - 1] -= 1\n }\n\n p[onp.length - 1] += 1\n } else if (Path.endsBefore(op, p)) {\n if (Path.equals(onp, p)) {\n p[onp.length - 1] += 1\n }\n\n p[op.length - 1] -= 1\n }\n\n break\n }\n }\n })\n },\n}\n","import { Operation, Path } from '..'\n\n/**\n * `PathRef` objects keep a specific path in a document synced over time as new\n * operations are applied to the editor. You can access their `current` property\n * at any time for the up-to-date path value.\n */\n\nexport interface PathRef {\n current: Path | null\n affinity: 'forward' | 'backward' | null\n unref(): Path | null\n}\n\nexport const PathRef = {\n /**\n * Transform the path ref's current value by an operation.\n */\n\n transform(ref: PathRef, op: Operation): void {\n const { current, affinity } = ref\n\n if (current == null) {\n return\n }\n\n const path = Path.transform(current, op, { affinity })\n ref.current = path\n\n if (path == null) {\n ref.unref()\n }\n },\n}\n","import isPlainObject from 'is-plain-object'\nimport { produce } from 'immer'\nimport { Operation, Path } from '..'\n\n/**\n * `Point` objects refer to a specific location in a text node in a Slate\n * document. Its path refers to the location of the node in the tree, and its\n * offset refers to the distance into the node's string of text. Points can\n * only refer to `Text` nodes.\n */\n\nexport interface Point {\n path: Path\n offset: number\n [key: string]: any\n}\n\nexport const Point = {\n /**\n * Compare a point to another, returning an integer indicating whether the\n * point was before, at, or after the other.\n */\n\n compare(point: Point, another: Point): -1 | 0 | 1 {\n const result = Path.compare(point.path, another.path)\n\n if (result === 0) {\n if (point.offset < another.offset) return -1\n if (point.offset > another.offset) return 1\n return 0\n }\n\n return result\n },\n\n /**\n * Check if a point is after another.\n */\n\n isAfter(point: Point, another: Point): boolean {\n return Point.compare(point, another) === 1\n },\n\n /**\n * Check if a point is before another.\n */\n\n isBefore(point: Point, another: Point): boolean {\n return Point.compare(point, another) === -1\n },\n\n /**\n * Check if a point is exactly equal to another.\n */\n\n equals(point: Point, another: Point): boolean {\n // PERF: ensure the offsets are equal first since they are cheaper to check.\n return (\n point.offset === another.offset && Path.equals(point.path, another.path)\n )\n },\n\n /**\n * Check if a value implements the `Point` interface.\n */\n\n isPoint(value: any): value is Point {\n return (\n isPlainObject(value) &&\n typeof value.offset === 'number' &&\n Path.isPath(value.path)\n )\n },\n\n /**\n * Transform a point by an operation.\n */\n\n transform(\n point: Point,\n op: Operation,\n options: { affinity?: 'forward' | 'backward' | null } = {}\n ): Point | null {\n return produce(point, p => {\n const { affinity = 'forward' } = options\n const { path, offset } = p\n\n switch (op.type) {\n case 'insert_node':\n case 'move_node': {\n p.path = Path.transform(path, op, options)!\n break\n }\n\n case 'insert_text': {\n if (Path.equals(op.path, path) && op.offset <= offset) {\n p.offset += op.text.length\n }\n\n break\n }\n\n case 'merge_node': {\n if (Path.equals(op.path, path)) {\n p.offset += op.position\n }\n\n p.path = Path.transform(path, op, options)!\n break\n }\n\n case 'remove_text': {\n if (Path.equals(op.path, path) && op.offset <= offset) {\n p.offset -= Math.min(offset - op.offset, op.text.length)\n }\n\n break\n }\n\n case 'remove_node': {\n if (Path.equals(op.path, path) || Path.isAncestor(op.path, path)) {\n return null\n }\n\n p.path = Path.transform(path, op, options)!\n break\n }\n\n case 'split_node': {\n if (Path.equals(op.path, path)) {\n if (op.position === offset && affinity == null) {\n return null\n } else if (\n op.position < offset ||\n (op.position === offset && affinity === 'forward')\n ) {\n p.offset -= op.position\n\n p.path = Path.transform(path, op, {\n ...options,\n affinity: 'forward',\n })!\n }\n } else {\n p.path = Path.transform(path, op, options)!\n }\n\n break\n }\n }\n })\n },\n}\n\n/**\n * `PointEntry` objects are returned when iterating over `Point` objects that\n * belong to a range.\n */\n\nexport type PointEntry = [Point, 'anchor' | 'focus']\n","import { Operation, Point } from '..'\n\n/**\n * `PointRef` objects keep a specific point in a document synced over time as new\n * operations are applied to the editor. You can access their `current` property\n * at any time for the up-to-date point value.\n */\n\nexport interface PointRef {\n current: Point | null\n affinity: 'forward' | 'backward' | null\n unref(): Point | null\n}\n\nexport const PointRef = {\n /**\n * Transform the point ref's current value by an operation.\n */\n\n transform(ref: PointRef, op: Operation): void {\n const { current, affinity } = ref\n\n if (current == null) {\n return\n }\n\n const point = Point.transform(current, op, { affinity })\n ref.current = point\n\n if (point == null) {\n ref.unref()\n }\n },\n}\n","import { produce } from 'immer'\nimport isPlainObject from 'is-plain-object'\nimport { Operation, Path, Point, PointEntry } from '..'\n\n/**\n * `Range` objects are a set of points that refer to a specific span of a Slate\n * document. They can define a span inside a single node or a can span across\n * multiple nodes.\n */\n\nexport interface Range {\n anchor: Point\n focus: Point\n [key: string]: any\n}\n\nexport const Range = {\n /**\n * Get the start and end points of a range, in the order in which they appear\n * in the document.\n */\n\n edges(\n range: Range,\n options: {\n reverse?: boolean\n } = {}\n ): [Point, Point] {\n const { reverse = false } = options\n const { anchor, focus } = range\n return Range.isBackward(range) === reverse\n ? [anchor, focus]\n : [focus, anchor]\n },\n\n /**\n * Get the end point of a range.\n */\n\n end(range: Range): Point {\n const [, end] = Range.edges(range)\n return end\n },\n\n /**\n * Check if a range is exactly equal to another.\n */\n\n equals(range: Range, another: Range): boolean {\n return (\n Point.equals(range.anchor, another.anchor) &&\n Point.equals(range.focus, another.focus)\n )\n },\n\n /**\n * Check if a range includes a path, a point or part of another range.\n */\n\n includes(range: Range, target: Path | Point | Range): boolean {\n if (Range.isRange(target)) {\n if (\n Range.includes(range, target.anchor) ||\n Range.includes(range, target.focus)\n ) {\n return true\n }\n\n const [rs, re] = Range.edges(range)\n const [ts, te] = Range.edges(target)\n return Point.isBefore(rs, ts) && Point.isAfter(re, te)\n }\n\n const [start, end] = Range.edges(range)\n let isAfterStart = false\n let isBeforeEnd = false\n\n if (Point.isPoint(target)) {\n isAfterStart = Point.compare(target, start) >= 0\n isBeforeEnd = Point.compare(target, end) <= 0\n } else {\n isAfterStart = Path.compare(target, start.path) >= 0\n isBeforeEnd = Path.compare(target, end.path) <= 0\n }\n\n return isAfterStart && isBeforeEnd\n },\n\n /**\n * Get the intersection of a range with another.\n */\n\n intersection(range: Range, another: Range): Range | null {\n const { anchor, focus, ...rest } = range\n const [s1, e1] = Range.edges(range)\n const [s2, e2] = Range.edges(another)\n const start = Point.isBefore(s1, s2) ? s2 : s1\n const end = Point.isBefore(e1, e2) ? e1 : e2\n\n if (Point.isBefore(end, start)) {\n return null\n } else {\n return { anchor: start, focus: end, ...rest }\n }\n },\n\n /**\n * Check if a range is backward, meaning that its anchor point appears in the\n * document _after_ its focus point.\n */\n\n isBackward(range: Range): boolean {\n const { anchor, focus } = range\n return Point.isAfter(anchor, focus)\n },\n\n /**\n * Check if a range is collapsed, meaning that both its anchor and focus\n * points refer to the exact same position in the document.\n */\n\n isCollapsed(range: Range): boolean {\n const { anchor, focus } = range\n return Point.equals(anchor, focus)\n },\n\n /**\n * Check if a range is expanded.\n *\n * This is the opposite of [[Range.isCollapsed]] and is provided for legibility.\n */\n\n isExpanded(range: Range): boolean {\n return !Range.isCollapsed(range)\n },\n\n /**\n * Check if a range is forward.\n *\n * This is the opposite of [[Range.isBackward]] and is provided for legibility.\n */\n\n isForward(range: Range): boolean {\n return !Range.isBackward(range)\n },\n\n /**\n * Check if a value implements the [[Range]] interface.\n */\n\n isRange(value: any): value is Range {\n return (\n isPlainObject(value) &&\n Point.isPoint(value.anchor) &&\n Point.isPoint(value.focus)\n )\n },\n\n /**\n * Iterate through all of the point entries in a range.\n */\n\n *points(range: Range): Iterable<PointEntry> {\n yield [range.anchor, 'anchor']\n yield [range.focus, 'focus']\n },\n\n /**\n * Get the start point of a range.\n */\n\n start(range: Range): Point {\n const [start] = Range.edges(range)\n return start\n },\n\n /**\n * Transform a range by an operation.\n */\n\n transform(\n range: Range,\n op: Operation,\n options: { affinity: 'forward' | 'backward' | 'outward' | 'inward' | null }\n ): Range | null {\n const { affinity = 'inward' } = options\n let affinityAnchor: 'forward' | 'backward' | null\n let affinityFocus: 'forward' | 'backward' | null\n\n if (affinity === 'inward') {\n if (Range.isForward(range)) {\n affinityAnchor = 'forward'\n affinityFocus = 'backward'\n } else {\n affinityAnchor = 'backward'\n affinityFocus = 'forward'\n }\n } else if (affinity === 'outward') {\n if (Range.isForward(range)) {\n affinityAnchor = 'backward'\n affinityFocus = 'forward'\n } else {\n affinityAnchor = 'forward'\n affinityFocus = 'backward'\n }\n } else {\n affinityAnchor = affinity\n affinityFocus = affinity\n }\n\n return produce(range, r => {\n const anchor = Point.transform(r.anchor, op, { affinity: affinityAnchor })\n const focus = Point.transform(r.focus, op, { affinity: affinityFocus })\n\n if (!anchor || !focus) {\n return null\n }\n\n r.anchor = anchor\n r.focus = focus\n })\n },\n}\n","import { Operation, Range } from '..'\n\n/**\n * `RangeRef` objects keep a specific range in a document synced over time as new\n * operations are applied to the editor. You can access their `current` property\n * at any time for the up-to-date range value.\n */\n\nexport interface RangeRef {\n current: Range | null\n affinity: 'forward' | 'backward' | 'outward' | 'inward' | null\n unref(): Range | null\n}\n\nexport const RangeRef = {\n /**\n * Transform the range ref's current value by an operation.\n */\n\n transform(ref: RangeRef, op: Operation): void {\n const { current, affinity } = ref\n\n if (current == null) {\n return\n }\n\n const path = Range.transform(current, op, { affinity })\n ref.current = path\n\n if (path == null) {\n ref.unref()\n }\n },\n}\n","import isPlainObject from 'is-plain-object'\nimport { Range } from '..'\n\n/**\n * `Text` objects represent the nodes that contain the actual text content of a\n * Slate document along with any formatting properties. They are always leaf\n * nodes in the document tree as they cannot contain any children.\n */\n\nexport interface Text {\n text: string\n [key: string]: any\n}\n\nexport const Text = {\n /**\n * Check if two text nodes are equal.\n */\n\n equals(\n text: Text,\n another: Text,\n options: { loose?: boolean } = {}\n ): boolean {\n const { loose = false } = options\n\n for (const key in text) {\n if (loose && key === 'text') {\n continue\n }\n\n if (text[key] !== another[key]) {\n return false\n }\n }\n\n for (const key in another) {\n if (loose && key === 'text') {\n continue\n }\n\n if (text[key] !== another[key]) {\n return false\n }\n }\n\n return true\n },\n\n /**\n * Check if a value implements the `Text` interface.\n */\n\n isText(value: any): value is Text {\n return isPlainObject(value) && typeof value.text === 'string'\n },\n\n /**\n * Check if a value is a list of `Text` objects.\n */\n\n isTextList(value: any): value is Text[] {\n return Array.isArray(value) && (value.length === 0 || Text.isText(value[0]))\n },\n\n /**\n * Check if an text matches set of properties.\n *\n * Note: this is for matching custom properties, and it does not ensure that\n * the `text` property are two nodes equal.\n */\n\n matches(text: Text, props: Partial<Text>): boolean {\n for (const key in props) {\n if (key === 'text') {\n continue\n }\n\n if (text[key] !== props[key]) {\n return false\n }\n }\n\n return true\n },\n\n /**\n * Get the leaves for a text node given decorations.\n */\n\n decorations(node: Text, decorations: Range[]): Text[] {\n let leaves: Text[] = [{ ...node }]\n\n for (const dec of decorations) {\n const { anchor, focus, ...rest } = dec\n const [start, end] = Range.edges(dec)\n const next = []\n let o = 0\n\n for (const leaf of leaves) {\n const { length } = leaf.text\n const offset = o\n o += length\n\n // If the range encompases the entire leaf, add the range.\n if (start.offset <= offset && end.offset >= offset + length) {\n Object.assign(leaf, rest)\n next.push(leaf)\n continue\n }\n\n // If the range starts after the leaf, or ends before it, continue.\n if (\n start.offset > offset + length ||\n end.offset < offset ||\n (end.offset === offset && offset !== 0)\n ) {\n next.push(leaf)\n continue\n }\n\n // Otherwise we need to split the leaf, at the start, end, or both,\n // and add the range to the middle intersecting section. Do the end\n // split first since we don't need to update the offset that way.\n let middle = leaf\n let before\n let after\n\n if (end.offset < offset + length) {\n const off = end.offset - offset\n after = { ...middle, text: middle.text.slice(off) }\n middle = { ...middle, text: middle.text.slice(0, off) }\n }\n\n if (start.offset > offset) {\n const off = start.offset - offset\n before = { ...middle, text: middle.text.slice(0, off) }\n middle = { ...middle, text: middle.text.slice(off) }\n }\n\n Object.assign(middle, rest)\n\n if (before) {\n next.push(before)\n }\n\n next.push(middle)\n\n if (after) {\n next.push(after)\n }\n }\n\n leaves = next\n }\n\n return leaves\n },\n}\n","import { createDraft, finishDraft, isDraft } from 'immer'\nimport {\n Node,\n Editor,\n Range,\n Point,\n Text,\n Element,\n Operation,\n Descendant,\n NodeEntry,\n Path,\n Transforms,\n} from '..'\n\nexport const GeneralTransforms = {\n /**\n * Transform the editor by an operation.\n */\n\n transform(editor: Editor, op: Operation) {\n editor.children = createDraft(editor.children)\n let selection = editor.selection && createDraft(editor.selection)\n\n switch (op.type) {\n case 'insert_node': {\n const { path, node } = op\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n parent.children.splice(index, 0, node)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'insert_text': {\n const { path, offset, text } = op\n const node = Node.leaf(editor, path)\n const before = node.text.slice(0, offset)\n const after = node.text.slice(offset)\n node.text = before + text + after\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'merge_node': {\n const { path } = op\n const node = Node.get(editor, path)\n const prevPath = Path.previous(path)\n const prev = Node.get(editor, prevPath)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n\n if (Text.isText(node) && Text.isText(prev)) {\n prev.text += node.text\n } else if (!Text.isText(node) && !Text.isText(prev)) {\n prev.children.push(...node.children)\n } else {\n throw new Error(\n `Cannot apply a \"merge_node\" operation at path [${path}] to nodes of different interaces: ${node} ${prev}`\n )\n }\n\n parent.children.splice(index, 1)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'move_node': {\n const { path, newPath } = op\n\n if (Path.isAncestor(path, newPath)) {\n throw new Error(\n `Cannot move a path [${path}] to new path [${newPath}] because the destination is inside itself.`\n )\n }\n\n const node = Node.get(editor, path)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n\n // This is tricky, but since the `path` and `newPath` both refer to\n // the same snapshot in time, there's a mismatch. After either\n // removing the original position, the second step's path can be out\n // of date. So instead of using the `op.newPath` directly, we\n // transform `op.path` to ascertain what the `newPath` would be after\n // the operation was applied.\n parent.children.splice(index, 1)\n const truePath = Path.transform(path, op)!\n const newParent = Node.get(editor, Path.parent(truePath))\n const newIndex = truePath[truePath.length - 1]\n\n newParent.children.splice(newIndex, 0, node)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'remove_node': {\n const { path } = op\n const index = path[path.length - 1]\n const parent = Node.parent(editor, path)\n parent.children.splice(index, 1)\n\n // Transform all of the points in the value, but if the point was in the\n // node that was removed we need to update the range or remove it.\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n const result = Point.transform(point, op)\n\n if (selection != null && result != null) {\n selection[key] = result\n } else {\n let prev: NodeEntry<Text> | undefined\n let next: NodeEntry<Text> | undefined\n\n for (const [n, p] of Node.texts(editor)) {\n if (Path.compare(p, path) === -1) {\n prev = [n, p]\n } else {\n next = [n, p]\n break\n }\n }\n\n if (prev) {\n point.path = prev[1]\n point.offset = prev[0].text.length\n } else if (next) {\n point.path = next[1]\n point.offset = 0\n } else {\n selection = null\n }\n }\n }\n }\n\n break\n }\n\n case 'remove_text': {\n const { path, offset, text } = op\n const node = Node.leaf(editor, path)\n const before = node.text.slice(0, offset)\n const after = node.text.slice(offset + text.length)\n node.text = before + after\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n\n case 'set_node': {\n const { path, newProperties } = op\n\n if (path.length === 0) {\n throw new Error(`Cannot set properties on the root node!`)\n }\n\n const node = Node.get(editor, path)\n\n for (const key in newProperties) {\n if (key === 'children' || key === 'text') {\n throw new Error(`Cannot set the \"${key}\" property of nodes!`)\n }\n\n const value = newProperties[key]\n\n if (value == null) {\n delete node[key]\n } else {\n node[key] = value\n }\n }\n\n break\n }\n\n case 'set_selection': {\n const { newProperties } = op\n\n if (newProperties == null) {\n selection = newProperties\n } else if (selection == null) {\n if (!Range.isRange(newProperties)) {\n throw new Error(\n `Cannot apply an incomplete \"set_selection\" operation properties ${JSON.stringify(\n newProperties\n )} when there is no current selection.`\n )\n }\n\n selection = newProperties\n } else {\n Object.assign(selection, newProperties)\n }\n\n break\n }\n\n case 'split_node': {\n const { path, position, properties } = op\n\n if (path.length === 0) {\n throw new Error(\n `Cannot apply a \"split_node\" operation at path [${path}] because the root node cannot be split.`\n )\n }\n\n const node = Node.get(editor, path)\n const parent = Node.parent(editor, path)\n const index = path[path.length - 1]\n let newNode: Descendant\n\n if (Text.isText(node)) {\n const before = node.text.slice(0, position)\n const after = node.text.slice(position)\n node.text = before\n newNode = {\n ...node,\n ...(properties as Partial<Text>),\n text: after,\n }\n } else {\n const before = node.children.slice(0, position)\n const after = node.children.slice(position)\n node.children = before\n\n newNode = {\n ...node,\n ...(properties as Partial<Element>),\n children: after,\n }\n }\n\n parent.children.splice(index + 1, 0, newNode)\n\n if (selection) {\n for (const [point, key] of Range.points(selection)) {\n selection[key] = Point.transform(point, op)!\n }\n }\n\n break\n }\n }\n\n editor.children = finishDraft(editor.children) as Node[]\n\n if (selection) {\n editor.selection = isDraft(selection)\n ? (finishDraft(selection) as Range)\n : selection\n } else {\n editor.selection = null\n }\n },\n}\n","import {\n Editor,\n Element,\n Location,\n Node,\n Path,\n Point,\n Range,\n Text,\n Transforms,\n} from '..'\n\nexport const NodeTransforms = {\n /**\n * Insert nodes at a specific location in the Editor.\n */\n\n insertNodes(\n editor: Editor,\n nodes: Node | Node[],\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'highest' | 'lowest'\n hanging?: boolean\n select?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { hanging = false, voids = false, mode = 'lowest' } = options\n let { at, match, select } = options\n\n if (Node.isNode(nodes)) {\n nodes = [nodes]\n }\n\n if (nodes.length === 0) {\n return\n }\n\n const [node] = nodes\n\n // By default, use the selection as the target location. But if there is\n // no selection, insert at the end of the document since that is such a\n // common use case when inserting from a non-selected state.\n if (!at) {\n if (editor.selection) {\n at = editor.selection\n } else if (editor.children.length > 0) {\n at = Editor.end(editor, [])\n } else {\n at = [0]\n }\n\n select = true\n }\n\n if (select == null) {\n select = false\n }\n\n if (Range.isRange(at)) {\n if (!hanging) {\n at = Editor.unhangRange(editor, at)\n }\n\n if (Range.isCollapsed(at)) {\n at = at.anchor\n } else {\n const [, end] = Range.edges(at)\n const pointRef = Editor.pointRef(editor, end)\n Transforms.delete(editor, { at })\n at = pointRef.unref()!\n }\n }\n\n if (Point.isPoint(at)) {\n if (match == null) {\n if (Text.isText(node)) {\n match = n => Text.isText(n)\n } else if (editor.isInline(node)) {\n match = n => Text.isText(n) || Editor.isInline(editor, n)\n } else {\n match = n => Editor.isBlock(editor, n)\n }\n }\n\n const [entry] = Editor.nodes(editor, {\n at: at.path,\n match,\n mode,\n voids,\n })\n\n if (entry) {\n const [, matchPath] = entry\n const pathRef = Editor.pathRef(editor, matchPath)\n const isAtEnd = Editor.isEnd(editor, at, matchPath)\n Transforms.splitNodes(editor, { at, match, mode, voids })\n const path = pathRef.unref()!\n at = isAtEnd ? Path.next(path) : path\n } else {\n return\n }\n }\n\n const parentPath = Path.parent(at)\n let index = at[at.length - 1]\n\n if (!voids && Editor.void(editor, { at: parentPath })) {\n return\n }\n\n for (const node of nodes) {\n const path = parentPath.concat(index)\n index++\n editor.apply({ type: 'insert_node', path, node })\n }\n\n if (select) {\n const point = Editor.end(editor, at)\n\n if (point) {\n Transforms.select(editor, point)\n }\n }\n })\n },\n\n /**\n * Lift nodes at a specific location upwards in the document tree, splitting\n * their parent in two if necessary.\n */\n\n liftNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { at = editor.selection, mode = 'lowest', voids = false } = options\n let { match } = options\n\n if (match == null) {\n match = Path.isPath(at)\n ? matchPath(editor, at)\n : n => Editor.isBlock(editor, n)\n }\n\n if (!at) {\n return\n }\n\n const matches = Editor.nodes(editor, { at, match, mode, voids })\n const pathRefs = Array.from(matches, ([, p]) => Editor.pathRef(editor, p))\n\n for (const pathRef of pathRefs) {\n const path = pathRef.unref()!\n\n if (path.length < 2) {\n throw new Error(\n `Cannot lift node at a path [${path}] because it has a depth of less than \\`2\\`.`\n )\n }\n\n const [parent, parentPath] = Editor.node(editor, Path.parent(path))\n const index = path[path.length - 1]\n const { length } = parent.children\n\n if (length === 1) {\n const toPath = Path.next(parentPath)\n Transforms.moveNodes(editor, { at: path, to: toPath, voids })\n Transforms.removeNodes(editor, { at: parentPath, voids })\n } else if (index === 0) {\n Transforms.moveNodes(editor, { at: path, to: parentPath, voids })\n } else if (index === length - 1) {\n const toPath = Path.next(parentPath)\n Transforms.moveNodes(editor, { at: path, to: toPath, voids })\n } else {\n const splitPath = Path.next(path)\n const toPath = Path.next(parentPath)\n Transforms.splitNodes(editor, { at: splitPath, voids })\n Transforms.moveNodes(editor, { at: path, to: toPath, voids })\n }\n }\n })\n },\n\n /**\n * Merge a node at a location with the previous node of the same depth,\n * removing any empty containing nodes after the merge if necessary.\n */\n\n mergeNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'highest' | 'lowest'\n hanging?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n let { match, at = editor.selection } = options\n const { hanging = false, voids = false, mode = 'lowest' } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n if (Path.isPath(at)) {\n const [parent] = Editor.parent(editor, at)\n match = n => parent.children.includes(n)\n } else {\n match = n => Editor.isBlock(editor, n)\n }\n }\n\n if (!hanging && Range.isRange(at)) {\n at = Editor.unhangRange(editor, at)\n }\n\n if (Range.isRange(at)) {\n if (Range.isCollapsed(at)) {\n at = at.anchor\n } else {\n const [, end] = Range.edges(at)\n const pointRef = Editor.pointRef(editor, end)\n Transforms.delete(editor, { at })\n at = pointRef.unref()!\n\n if (options.at == null) {\n Transforms.select(editor, at)\n }\n }\n }\n\n const [current] = Editor.nodes(editor, { at, match, voids, mode })\n const prev = Editor.previous(editor, { at, match, voids, mode })\n\n if (!current || !prev) {\n return\n }\n\n const [node, path] = current\n const [prevNode, prevPath] = prev\n\n if (path.length === 0 || prevPath.length === 0) {\n return\n }\n\n const newPath = Path.next(prevPath)\n const commonPath = Path.common(path, prevPath)\n const isPreviousSibling = Path.isSibling(path, prevPath)\n const levels = Array.from(Editor.levels(editor, { at: path }), ([n]) => n)\n .slice(commonPath.length)\n .slice(0, -1)\n\n // Determine if the merge will leave an ancestor of the path empty as a\n // result, in which case we'll want to remove it after merging.\n const emptyAncestor = Editor.above(editor, {\n at: path,\n mode: 'highest',\n match: n =>\n levels.includes(n) && Element.isElement(n) && n.children.length === 1,\n })\n\n const emptyRef = emptyAncestor && Editor.pathRef(editor, emptyAncestor[1])\n let properties\n let position\n\n // Ensure that the nodes are equivalent, and figure out what the position\n // and extra properties of the merge will be.\n if (Text.isText(node) && Text.isText(prevNode)) {\n const { text, ...rest } = node\n position = prevNode.text.length\n properties = rest as Partial<Text>\n } else if (Element.isElement(node) && Element.isElement(prevNode)) {\n const { children, ...rest } = node\n position = prevNode.children.length\n properties = rest as Partial<Element>\n } else {\n throw new Error(\n `Cannot merge the node at path [${path}] with the previous sibling because it is not the same kind: ${JSON.stringify(\n node\n )} ${JSON.stringify(prevNode)}`\n )\n }\n\n // If the node isn't already the next sibling of the previous node, move\n // it so that it is before merging.\n if (!isPreviousSibling) {\n Transforms.moveNodes(editor, { at: path, to: newPath, voids })\n }\n\n // If there was going to be an empty ancestor of the node that was merged,\n // we remove it from the tree.\n if (emptyRef) {\n Transforms.removeNodes(editor, { at: emptyRef.current!, voids })\n }\n\n // If the target node that we're merging with is empty, remove it instead\n // of merging the two. This is a common rich text editor behavior to\n // prevent losing formatting when deleting entire nodes when you have a\n // hanging selection.\n if (\n (Element.isElement(prevNode) && Editor.isEmpty(editor, prevNode)) ||\n (Text.isText(prevNode) && prevNode.text === '')\n ) {\n Transforms.removeNodes(editor, { at: prevPath, voids })\n } else {\n editor.apply({\n type: 'merge_node',\n path: newPath,\n position,\n target: null,\n properties,\n })\n }\n\n if (emptyRef) {\n emptyRef.unref()\n }\n })\n },\n\n /**\n * Move the nodes at a location to a new location.\n */\n\n moveNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n to: Path\n voids?: boolean\n }\n ) {\n Editor.withoutNormalizing(editor, () => {\n const {\n to,\n at = editor.selection,\n mode = 'lowest',\n voids = false,\n } = options\n let { match } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n match = Path.isPath(at)\n ? matchPath(editor, at)\n : n => Editor.isBlock(editor, n)\n }\n\n const toRef = Editor.pathRef(editor, to)\n const targets = Editor.nodes(editor, { at, match, mode, voids })\n const pathRefs = Array.from(targets, ([, p]) => Editor.pathRef(editor, p))\n\n for (const pathRef of pathRefs) {\n const path = pathRef.unref()!\n const newPath = toRef.current!\n\n if (path.length !== 0) {\n editor.apply({ type: 'move_node', path, newPath })\n }\n }\n\n toRef.unref()\n })\n },\n\n /**\n * Remove the nodes at a specific location in the document.\n */\n\n removeNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'highest' | 'lowest'\n hanging?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { hanging = false, voids = false, mode = 'lowest' } = options\n let { at = editor.selection, match } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n match = Path.isPath(at)\n ? matchPath(editor, at)\n : n => Editor.isBlock(editor, n)\n }\n\n if (!hanging && Range.isRange(at)) {\n at = Editor.unhangRange(editor, at)\n }\n\n const depths = Editor.nodes(editor, { at, match, mode, voids })\n const pathRefs = Array.from(depths, ([, p]) => Editor.pathRef(editor, p))\n\n for (const pathRef of pathRefs) {\n const path = pathRef.unref()!\n\n if (path) {\n const [node] = Editor.node(editor, path)\n editor.apply({ type: 'remove_node', path, node })\n }\n }\n })\n },\n\n /**\n * Set new properties on the nodes at a location.\n */\n\n setNodes(\n editor: Editor,\n props: Partial<Node>,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n hanging?: boolean\n split?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n let { match, at = editor.selection } = options\n const {\n hanging = false,\n mode = 'lowest',\n split = false,\n voids = false,\n } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n match = Path.isPath(at)\n ? matchPath(editor, at)\n : n => Editor.isBlock(editor, n)\n }\n\n if (!hanging && Range.isRange(at)) {\n at = Editor.unhangRange(editor, at)\n }\n\n if (split && Range.isRange(at)) {\n const rangeRef = Editor.rangeRef(editor, at, { affinity: 'inward' })\n const [start, end] = Range.edges(at)\n const splitMode = mode === 'lowest' ? 'lowest' : 'highest'\n Transforms.splitNodes(editor, {\n at: end,\n match,\n mode: splitMode,\n voids,\n })\n Transforms.splitNodes(editor, {\n at: start,\n match,\n mode: splitMode,\n voids,\n })\n at = rangeRef.unref()!\n\n if (options.at == null) {\n Transforms.select(editor, at)\n }\n }\n\n for (const [node, path] of Editor.nodes(editor, {\n at,\n match,\n mode,\n voids,\n })) {\n const properties: Partial<Node> = {}\n const newProperties: Partial<Node> = {}\n\n // You can't set properties on the editor node.\n if (path.length === 0) {\n continue\n }\n\n for (const k in props) {\n if (k === 'children' || k === 'text') {\n continue\n }\n\n if (props[k] !== node[k]) {\n properties[k] = node[k]\n newProperties[k] = props[k]\n }\n }\n\n if (Object.keys(newProperties).length !== 0) {\n editor.apply({\n type: 'set_node',\n path,\n properties,\n newProperties,\n })\n }\n }\n })\n },\n\n /**\n * Split the nodes at a specific location.\n */\n\n splitNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'highest' | 'lowest'\n always?: boolean\n height?: number\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { mode = 'lowest', voids = false } = options\n let { match, at = editor.selection, height = 0, always = false } = options\n\n if (match == null) {\n match = n => Editor.isBlock(editor, n)\n }\n\n if (Range.isRange(at)) {\n at = deleteRange(editor, at)\n }\n\n // If the target is a path, the default height-skipping and position\n // counters need to account for us potentially splitting at a non-leaf.\n if (Path.isPath(at)) {\n const path = at\n const point = Editor.point(editor, path)\n const [parent] = Editor.parent(editor, path)\n match = n => n === parent\n height = point.path.length - path.length + 1\n at = point\n always = true\n }\n\n if (!at) {\n return\n }\n\n const beforeRef = Editor.pointRef(editor, at, {\n affinity: 'backward',\n })\n const [highest] = Editor.nodes(editor, { at, match, mode, voids })\n\n if (!highest) {\n return\n }\n\n const voidMatch = Editor.void(editor, { at, mode: 'highest' })\n const nudge = 0\n\n if (!voids && voidMatch) {\n const [voidNode, voidPath] = voidMatch\n\n if (Element.isElement(voidNode) && editor.isInline(voidNode)) {\n let after = Editor.after(editor, voidPath)\n\n if (!after) {\n const text = { text: '' }\n const afterPath = Path.next(voidPath)\n Transforms.insertNodes(editor, text, { at: afterPath, voids })\n after = Editor.point(editor, afterPath)!\n }\n\n at = after\n always = true\n }\n\n const siblingHeight = at.path.length - voidPath.length\n height = siblingHeight + 1\n always = true\n }\n\n const afterRef = Editor.pointRef(editor, at)\n const depth = at.path.length - height\n const [, highestPath] = highest\n const lowestPath = at.path.slice(0, depth)\n let position = height === 0 ? at.offset : at.path[depth] + nudge\n let target: number | null = null\n\n for (const [node, path] of Editor.levels(editor, {\n at: lowestPath,\n reverse: true,\n voids,\n })) {\n let split = false\n\n if (\n path.length < highestPath.length ||\n path.length === 0 ||\n (!voids && Editor.isVoid(editor, node))\n ) {\n break\n }\n\n const point = beforeRef.current!\n const isEnd = Editor.isEnd(editor, point, path)\n\n if (always || !beforeRef || !Editor.isEdge(editor, point, path)) {\n split = true\n const { text, children, ...properties } = node\n editor.apply({\n type: 'split_node',\n path,\n position,\n target,\n properties,\n })\n }\n\n target = position\n position = path[path.length - 1] + (split || isEnd ? 1 : 0)\n }\n\n if (options.at == null) {\n const point = afterRef.current || Editor.end(editor, [])\n Transforms.select(editor, point)\n }\n\n beforeRef.unref()\n afterRef.unref()\n })\n },\n\n /**\n * Unset properties on the nodes at a location.\n */\n\n unsetNodes(\n editor: Editor,\n props: string | string[],\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n split?: boolean\n voids?: boolean\n } = {}\n ) {\n if (!Array.isArray(props)) {\n props = [props]\n }\n\n const obj = {}\n\n for (const key of props) {\n obj[key] = null\n }\n\n Transforms.setNodes(editor, obj, options)\n },\n\n /**\n * Unwrap the nodes at a location from a parent node, splitting the parent if\n * necessary to ensure that only the content in the range is unwrapped.\n */\n\n unwrapNodes(\n editor: Editor,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n split?: boolean\n voids?: boolean\n }\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { mode = 'lowest', split = false, voids = false } = options\n let { at = editor.selection, match } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n match = Path.isPath(at)\n ? matchPath(editor, at)\n : n => Editor.isBlock(editor, n)\n }\n\n if (Path.isPath(at)) {\n at = Editor.range(editor, at)\n }\n\n const rangeRef = Range.isRange(at) ? Editor.rangeRef(editor, at) : null\n const matches = Editor.nodes(editor, { at, match, mode, voids })\n const pathRefs = Array.from(matches, ([, p]) => Editor.pathRef(editor, p))\n\n for (const pathRef of pathRefs) {\n const path = pathRef.unref()!\n const [node] = Editor.node(editor, path)\n let range = Editor.range(editor, path)\n\n if (split && rangeRef) {\n range = Range.intersection(rangeRef.current!, range)!\n }\n\n Transforms.liftNodes(editor, {\n at: range,\n match: n => node.children.includes(n),\n voids,\n })\n }\n\n if (rangeRef) {\n rangeRef.unref()\n }\n })\n },\n\n /**\n * Wrap the nodes at a location in a new container node, splitting the edges\n * of the range first to ensure that only the content in the range is wrapped.\n */\n\n wrapNodes(\n editor: Editor,\n element: Element,\n options: {\n at?: Location\n match?: (node: Node) => boolean\n mode?: 'all' | 'highest' | 'lowest'\n split?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { mode = 'lowest', split = false, voids = false } = options\n let { match, at = editor.selection } = options\n\n if (!at) {\n return\n }\n\n if (match == null) {\n if (Path.isPath(at)) {\n match = matchPath(editor, at)\n } else if (editor.isInline(element)) {\n match = n => Editor.isInline(editor, n) || Text.isText(n)\n } else {\n match = n => Editor.isBlock(editor, n)\n }\n }\n\n if (split && Range.isRange(at)) {\n const [start, end] = Range.edges(at)\n const rangeRef = Editor.rangeRef(editor, at, {\n affinity: 'inward',\n })\n Transforms.splitNodes(editor, { at: end, match, voids })\n Transforms.splitNodes(editor, { at: start, match, voids })\n at = rangeRef.unref()!\n\n if (options.at == null) {\n Transforms.select(editor, at)\n }\n }\n\n const roots = Array.from(\n Editor.nodes(editor, {\n at,\n match: editor.isInline(element)\n ? n => Editor.isBlock(editor, n)\n : n => Editor.isEditor(n),\n mode: 'lowest',\n voids,\n })\n )\n\n for (const [, rootPath] of roots) {\n const a = Range.isRange(at)\n ? Range.intersection(at, Editor.range(editor, rootPath))\n : at\n\n if (!a) {\n continue\n }\n\n const matches = Array.from(\n Editor.nodes(editor, { at: a, match, mode, voids })\n )\n\n if (matches.length > 0) {\n const [first] = matches\n const last = matches[matches.length - 1]\n const [, firstPath] = first\n const [, lastPath] = last\n const commonPath = Path.equals(firstPath, lastPath)\n ? Path.parent(firstPath)\n : Path.common(firstPath, lastPath)\n\n const range = Editor.range(editor, firstPath, lastPath)\n const [commonNode] = Editor.node(editor, commonPath)\n const depth = commonPath.length + 1\n const wrapperPath = Path.next(lastPath.slice(0, depth))\n const wrapper = { ...element, children: [] }\n Transforms.insertNodes(editor, wrapper, { at: wrapperPath, voids })\n\n Transforms.moveNodes(editor, {\n at: range,\n match: n => commonNode.children.includes(n),\n to: wrapperPath.concat(0),\n voids,\n })\n }\n }\n })\n },\n}\n\n/**\n * Convert a range into a point by deleting it's content.\n */\n\nconst deleteRange = (editor: Editor, range: Range): Point | null => {\n if (Range.isCollapsed(range)) {\n return range.anchor\n } else {\n const [, end] = Range.edges(range)\n const pointRef = Editor.pointRef(editor, end)\n Transforms.delete(editor, { at: range })\n return pointRef.unref()\n }\n}\n\nconst matchPath = (editor: Editor, path: Path): ((node: Node) => boolean) => {\n const [node] = Editor.node(editor, path)\n return n => n === node\n}\n","import { Editor, Location, Point, Range, Transforms } from '..'\n\nexport const SelectionTransforms = {\n /**\n * Collapse the selection.\n */\n\n collapse(\n editor: Editor,\n options: {\n edge?: 'anchor' | 'focus' | 'start' | 'end'\n } = {}\n ) {\n const { edge = 'anchor' } = options\n const { selection } = editor\n\n if (!selection) {\n return\n } else if (edge === 'anchor') {\n Transforms.select(editor, selection.anchor)\n } else if (edge === 'focus') {\n Transforms.select(editor, selection.focus)\n } else if (edge === 'start') {\n const [start] = Range.edges(selection)\n Transforms.select(editor, start)\n } else if (edge === 'end') {\n const [, end] = Range.edges(selection)\n Transforms.select(editor, end)\n }\n },\n\n /**\n * Unset the selection.\n */\n\n deselect(editor: Editor) {\n const { selection } = editor\n\n if (selection) {\n editor.apply({\n type: 'set_selection',\n properties: selection,\n newProperties: null,\n })\n }\n },\n\n /**\n * Move the selection's point forward or backward.\n */\n\n move(\n editor: Editor,\n options: {\n distance?: number\n unit?: 'offset' | 'character' | 'word' | 'line'\n reverse?: boolean\n edge?: 'anchor' | 'focus' | 'start' | 'end'\n } = {}\n ) {\n const { selection } = editor\n const { distance = 1, unit = 'character', reverse = false } = options\n let { edge = null } = options\n\n if (!selection) {\n return\n }\n\n if (edge === 'start') {\n edge = Range.isBackward(selection) ? 'focus' : 'anchor'\n }\n\n if (edge === 'end') {\n edge = Range.isBackward(selection) ? 'anchor' : 'focus'\n }\n\n const { anchor, focus } = selection\n const opts = { distance, unit }\n const props: Partial<Range> = {}\n\n if (edge == null || edge === 'anchor') {\n const point = reverse\n ? Editor.before(editor, anchor, opts)\n : Editor.after(editor, anchor, opts)\n\n if (point) {\n props.anchor = point\n }\n }\n\n if (edge == null || edge === 'focus') {\n const point = reverse\n ? Editor.before(editor, focus, opts)\n : Editor.after(editor, focus, opts)\n\n if (point) {\n props.focus = point\n }\n }\n\n Transforms.setSelection(editor, props)\n },\n\n /**\n * Set the selection to a new value.\n */\n\n select(editor: Editor, target: Location) {\n const { selection } = editor\n target = Editor.range(editor, target)\n\n if (selection) {\n Transforms.setSelection(editor, target)\n return\n }\n\n if (!Range.isRange(target)) {\n throw new Error(\n `When setting the selection and the current selection is \\`null\\` you must provide at least an \\`anchor\\` and \\`focus\\`, but you passed: ${JSON.stringify(\n target\n )}`\n )\n }\n\n editor.apply({\n type: 'set_selection',\n properties: selection,\n newProperties: target,\n })\n },\n\n /**\n * Set new properties on one of the selection's points.\n */\n\n setPoint(\n editor: Editor,\n props: Partial<Point>,\n options: {\n edge?: 'anchor' | 'focus' | 'start' | 'end'\n }\n ) {\n const { selection } = editor\n let { edge = 'both' } = options\n\n if (!selection) {\n return\n }\n\n if (edge === 'start') {\n edge = Range.isBackward(selection) ? 'focus' : 'anchor'\n }\n\n if (edge === 'end') {\n edge = Range.isBackward(selection) ? 'anchor' : 'focus'\n }\n\n const { anchor, focus } = selection\n const point = edge === 'anchor' ? anchor : focus\n\n Transforms.setSelection(editor, {\n [edge === 'anchor' ? 'anchor' : 'focus']: { ...point, ...props },\n })\n },\n\n /**\n * Set new properties on the selection.\n */\n\n setSelection(editor: Editor, props: Partial<Range>) {\n const { selection } = editor\n const oldProps: Partial<Range> | null = {}\n const newProps: Partial<Range> = {}\n\n if (!selection) {\n return\n }\n\n for (const k in props) {\n if (\n (k === 'anchor' &&\n props.anchor != null &&\n !Point.equals(props.anchor, selection.anchor)) ||\n (k === 'focus' &&\n props.focus != null &&\n !Point.equals(props.focus, selection.focus)) ||\n (k !== 'anchor' && k !== 'focus' && props[k] !== selection[k])\n ) {\n oldProps[k] = selection[k]\n newProps[k] = props[k]\n }\n }\n\n if (Object.keys(oldProps).length > 0) {\n editor.apply({\n type: 'set_selection',\n properties: oldProps,\n newProperties: newProps,\n })\n }\n },\n}\n","import {\n Editor,\n Element,\n Location,\n Node,\n NodeEntry,\n Path,\n Text,\n Point,\n Range,\n Transforms,\n} from '..'\n\nexport const TextTransforms = {\n /**\n * Delete content in the editor.\n */\n\n delete(\n editor: Editor,\n options: {\n at?: Location\n distance?: number\n unit?: 'character' | 'word' | 'line' | 'block'\n reverse?: boolean\n hanging?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const {\n reverse = false,\n unit = 'character',\n distance = 1,\n voids = false,\n } = options\n let { at = editor.selection, hanging = false } = options\n\n if (!at) {\n return\n }\n\n if (Range.isRange(at) && Range.isCollapsed(at)) {\n at = at.anchor\n }\n\n if (Point.isPoint(at)) {\n const furthestVoid = Editor.void(editor, { at, mode: 'highest' })\n\n if (!voids && furthestVoid) {\n const [, voidPath] = furthestVoid\n at = voidPath\n } else {\n const opts = { unit, distance }\n const target = reverse\n ? Editor.before(editor, at, opts) || Editor.start(editor, [])\n : Editor.after(editor, at, opts) || Editor.end(editor, [])\n at = { anchor: at, focus: target }\n hanging = true\n }\n }\n\n if (Path.isPath(at)) {\n Transforms.removeNodes(editor, { at, voids })\n return\n }\n\n if (Range.isCollapsed(at)) {\n return\n }\n\n if (!hanging) {\n at = Editor.unhangRange(editor, at, { voids })\n }\n\n let [start, end] = Range.edges(at)\n const startBlock = Editor.above(editor, {\n match: n => Editor.isBlock(editor, n),\n at: start,\n voids,\n })\n const endBlock = Editor.above(editor, {\n match: n => Editor.isBlock(editor, n),\n at: end,\n voids,\n })\n const isAcrossBlocks =\n startBlock && endBlock && !Path.equals(startBlock[1], endBlock[1])\n const isSingleText = Path.equals(start.path, end.path)\n const startVoid = voids\n ? null\n : Editor.void(editor, { at: start, mode: 'highest' })\n const endVoid = voids\n ? null\n : Editor.void(editor, { at: end, mode: 'highest' })\n\n // If the start or end points are inside an inline void, nudge them out.\n if (startVoid) {\n const before = Editor.before(editor, start)\n\n if (\n before &&\n startBlock &&\n Path.isAncestor(startBlock[1], before.path)\n ) {\n start = before\n }\n }\n\n if (endVoid) {\n const after = Editor.after(editor, end)\n\n if (after && endBlock && Path.isAncestor(endBlock[1], after.path)) {\n end = after\n }\n }\n\n // Get the highest nodes that are completely inside the range, as well as\n // the start and end nodes.\n const matches: NodeEntry[] = []\n let lastPath: Path | undefined\n\n for (const entry of Editor.nodes(editor, { at, voids })) {\n const [node, path] = entry\n\n if (lastPath && Path.compare(path, lastPath) === 0) {\n continue\n }\n\n if (\n (!voids && Editor.isVoid(editor, node)) ||\n (!Path.isCommon(path, start.path) && !Path.isCommon(path, end.path))\n ) {\n matches.push(entry)\n lastPath = path\n }\n }\n\n const pathRefs = Array.from(matches, ([, p]) => Editor.pathRef(editor, p))\n const startRef = Editor.pointRef(editor, start)\n const endRef = Editor.pointRef(editor, end)\n\n if (!isSingleText && !startVoid) {\n const point = startRef.current!\n const [node] = Editor.leaf(editor, point)\n const { path } = point\n const { offset } = start\n const text = node.text.slice(offset)\n editor.apply({ type: 'remove_text', path, offset, text })\n }\n\n for (const pathRef of pathRefs) {\n const path = pathRef.unref()!\n Transforms.removeNodes(editor, { at: path, voids })\n }\n\n if (!endVoid) {\n const point = endRef.current!\n const [node] = Editor.leaf(editor, point)\n const { path } = point\n const offset = isSingleText ? start.offset : 0\n const text = node.text.slice(offset, end.offset)\n editor.apply({ type: 'remove_text', path, offset, text })\n }\n\n if (\n !isSingleText &&\n isAcrossBlocks &&\n endRef.current &&\n startRef.current\n ) {\n Transforms.mergeNodes(editor, {\n at: endRef.current,\n hanging: true,\n voids,\n })\n }\n\n const point = endRef.unref() || startRef.unref()\n\n if (options.at == null && point) {\n Transforms.select(editor, point)\n }\n })\n },\n\n /**\n * Insert a fragment at a specific location in the editor.\n */\n\n insertFragment(\n editor: Editor,\n fragment: Node[],\n options: {\n at?: Location\n hanging?: boolean\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { hanging = false, voids = false } = options\n let { at = editor.selection } = options\n\n if (!fragment.length) {\n return\n }\n\n if (!at) {\n return\n } else if (Range.isRange(at)) {\n if (!hanging) {\n at = Editor.unhangRange(editor, at)\n }\n\n if (Range.isCollapsed(at)) {\n at = at.anchor\n } else {\n const [, end] = Range.edges(at)\n\n if (!voids && Editor.void(editor, { at: end })) {\n return\n }\n\n const pointRef = Editor.pointRef(editor, end)\n Transforms.delete(editor, { at })\n at = pointRef.unref()!\n }\n } else if (Path.isPath(at)) {\n at = Editor.start(editor, at)\n }\n\n if (!voids && Editor.void(editor, { at })) {\n return\n }\n\n // If the insert point is at the edge of an inline node, move it outside\n // instead since it will need to be split otherwise.\n const inlineElementMatch = Editor.above(editor, {\n at,\n match: n => Editor.isInline(editor, n),\n mode: 'highest',\n voids,\n })\n\n if (inlineElementMatch) {\n const [, inlinePath] = inlineElementMatch\n\n if (Editor.isEnd(editor, at, inlinePath)) {\n const after = Editor.after(editor, inlinePath)!\n at = after\n } else if (Editor.isStart(editor, at, inlinePath)) {\n const before = Editor.before(editor, inlinePath)!\n at = before\n }\n }\n\n const blockMatch = Editor.above(editor, {\n match: n => Editor.isBlock(editor, n),\n at,\n voids,\n })!\n const [, blockPath] = blockMatch\n const isBlockStart = Editor.isStart(editor, at, blockPath)\n const isBlockEnd = Editor.isEnd(editor, at, blockPath)\n const mergeStart = !isBlockStart || (isBlockStart && isBlockEnd)\n const mergeEnd = !isBlockEnd\n const [, firstPath] = Node.first({ children: fragment }, [])\n const [, lastPath] = Node.last({ children: fragment }, [])\n\n const matches: NodeEntry[] = []\n const matcher = ([n, p]: NodeEntry) => {\n if (\n mergeStart &&\n Path.isAncestor(p, firstPath) &&\n Element.isElement(n) &&\n !editor.isVoid(n) &&\n !editor.isInline(n)\n ) {\n return false\n }\n\n if (\n mergeEnd &&\n Path.isAncestor(p, lastPath) &&\n Element.isElement(n) &&\n !editor.isVoid(n) &&\n !editor.isInline(n)\n ) {\n return false\n }\n\n return true\n }\n\n for (const entry of Node.nodes(\n { children: fragment },\n { pass: matcher }\n )) {\n if (entry[1].length > 0 && matcher(entry)) {\n matches.push(entry)\n }\n }\n\n const starts = []\n const middles = []\n const ends = []\n let starting = true\n let hasBlocks = false\n\n for (const [node] of matches) {\n if (Element.isElement(node) && !editor.isInline(node)) {\n starting = false\n hasBlocks = true\n middles.push(node)\n } else if (starting) {\n starts.push(node)\n } else {\n ends.push(node)\n }\n }\n\n const [inlineMatch] = Editor.nodes(editor, {\n at,\n match: n => Text.isText(n) || Editor.isInline(editor, n),\n mode: 'highest',\n voids,\n })!\n\n const [, inlinePath] = inlineMatch\n const isInlineStart = Editor.isStart(editor, at, inlinePath)\n const isInlineEnd = Editor.isEnd(editor, at, inlinePath)\n\n const middleRef = Editor.pathRef(\n editor,\n isBlockEnd ? Path.next(blockPath) : blockPath\n )\n\n const endRef = Editor.pathRef(\n editor,\n isInlineEnd ? Path.next(inlinePath) : inlinePath\n )\n\n Transforms.splitNodes(editor, {\n at,\n match: n =>\n hasBlocks\n ? Editor.isBlock(editor, n)\n : Text.isText(n) || Editor.isInline(editor, n),\n mode: hasBlocks ? 'lowest' : 'highest',\n voids,\n })\n\n const startRef = Editor.pathRef(\n editor,\n !isInlineStart || (isInlineStart && isInlineEnd)\n ? Path.next(inlinePath)\n : inlinePath\n )\n\n Transforms.insertNodes(editor, starts, {\n at: startRef.current!,\n match: n => Text.isText(n) || Editor.isInline(editor, n),\n mode: 'highest',\n voids,\n })\n\n Transforms.insertNodes(editor, middles, {\n at: middleRef.current!,\n match: n => Editor.isBlock(editor, n),\n mode: 'lowest',\n voids,\n })\n\n Transforms.insertNodes(editor, ends, {\n at: endRef.current!,\n match: n => Text.isText(n) || Editor.isInline(editor, n),\n mode: 'highest',\n voids,\n })\n\n if (!options.at) {\n let path\n\n if (ends.length > 0) {\n path = Path.previous(endRef.current!)\n } else if (middles.length > 0) {\n path = Path.previous(middleRef.current!)\n } else {\n path = Path.previous(startRef.current!)\n }\n\n const end = Editor.end(editor, path)\n Transforms.select(editor, end)\n }\n\n startRef.unref()\n middleRef.unref()\n endRef.unref()\n })\n },\n\n /**\n * Insert a string of text in the Editor.\n */\n\n insertText(\n editor: Editor,\n text: string,\n options: {\n at?: Location\n voids?: boolean\n } = {}\n ) {\n Editor.withoutNormalizing(editor, () => {\n const { voids = false } = options\n let { at = editor.selection } = options\n\n if (!at) {\n return\n }\n\n if (Path.isPath(at)) {\n at = Editor.range(editor, at)\n }\n\n if (Range.isRange(at)) {\n if (Range.isCollapsed(at)) {\n at = at.anchor\n } else {\n const end = Range.end(at)\n\n if (!voids && Editor.void(editor, { at: end })) {\n return\n }\n\n const pointRef = Editor.pointRef(editor, end)\n Transforms.delete(editor, { at, voids })\n at = pointRef.unref()!\n Transforms.setSelection(editor, { anchor: at, focus: at })\n }\n }\n\n if (!voids && Editor.void(editor, { at })) {\n return\n }\n\n const { path, offset } = at\n editor.apply({ type: 'insert_text', path, offset, text })\n })\n },\n}\n","import { GeneralTransforms } from './general'\nimport { NodeTransforms } from './node'\nimport { SelectionTransforms } from './selection'\nimport { TextTransforms } from './text'\n\nexport const Transforms = {\n ...GeneralTransforms,\n ...NodeTransforms,\n ...SelectionTransforms,\n ...TextTransforms,\n}\n","import {\n Descendant,\n Editor,\n Element,\n Node,\n NodeEntry,\n Operation,\n Path,\n PathRef,\n PointRef,\n Range,\n RangeRef,\n Text,\n Transforms,\n} from './'\nimport { DIRTY_PATHS, FLUSHING } from './utils/weak-maps'\n\n/**\n * Create a new Slate `Editor` object.\n */\n\nexport const createEditor = (): Editor => {\n const editor: Editor = {\n children: [],\n operations: [],\n selection: null,\n marks: null,\n isInline: () => false,\n isVoid: () => false,\n onChange: () => {},\n\n apply: (op: Operation) => {\n for (const ref of Editor.pathRefs(editor)) {\n PathRef.transform(ref, op)\n }\n\n for (const ref of Editor.pointRefs(editor)) {\n PointRef.transform(ref, op)\n }\n\n for (const ref of Editor.rangeRefs(editor)) {\n RangeRef.transform(ref, op)\n }\n\n const set = new Set()\n const dirtyPaths: Path[] = []\n\n const add = (path: Path | null) => {\n if (path) {\n const key = path.join(',')\n\n if (!set.has(key)) {\n set.add(key)\n dirtyPaths.push(path)\n }\n }\n }\n\n const oldDirtyPaths = DIRTY_PATHS.get(editor) || []\n const newDirtyPaths = getDirtyPaths(op)\n\n for (const path of oldDirtyPaths) {\n const newPath = Path.transform(path, op)\n add(newPath)\n }\n\n for (const path of newDirtyPaths) {\n add(path)\n }\n\n DIRTY_PATHS.set(editor, dirtyPaths)\n Editor.transform(editor, op)\n editor.operations.push(op)\n Editor.normalize(editor)\n\n // Clear any formats applied to the cursor if the selection changes.\n if (op.type === 'set_selection') {\n editor.marks = null\n }\n\n if (!FLUSHING.get(editor)) {\n FLUSHING.set(editor, true)\n\n Promise.resolve().then(() => {\n FLUSHING.set(editor, false)\n editor.onChange()\n editor.operations = []\n })\n }\n },\n\n addMark: (key: string, value: any) => {\n const { selection } = editor\n\n if (selection) {\n if (Range.isExpanded(selection)) {\n Transforms.setNodes(\n editor,\n { [key]: value },\n { match: Text.isText, split: true }\n )\n } else {\n const marks = {\n ...(Editor.marks(editor) || {}),\n [key]: value,\n }\n\n editor.marks = marks\n editor.onChange()\n }\n }\n },\n\n deleteBackward: (unit: 'character' | 'word' | 'line' | 'block') => {\n const { selection } = editor\n\n if (selection && Range.isCollapsed(selection)) {\n Transforms.delete(editor, { unit, reverse: true })\n }\n },\n\n deleteForward: (unit: 'character' | 'word' | 'line' | 'block') => {\n const { selection } = editor\n\n if (selection && Range.isCollapsed(selection)) {\n Transforms.delete(editor, { unit })\n }\n },\n\n deleteFragment: () => {\n const { selection } = editor\n\n if (selection && Range.isExpanded(selection)) {\n Transforms.delete(editor)\n }\n },\n\n getFragment: () => {\n const { selection } = editor\n\n if (selection && Range.isExpanded(selection)) {\n return Node.fragment(editor, selection)\n }\n return []\n },\n\n insertBreak: () => {\n Transforms.splitNodes(editor, { always: true })\n },\n\n insertFragment: (fragment: Node[]) => {\n Transforms.insertFragment(editor, fragment)\n },\n\n insertNode: (node: Node) => {\n Transforms.insertNodes(editor, node)\n },\n\n insertText: (text: string) => {\n const { selection, marks } = editor\n\n if (selection) {\n // If the cursor is at the end of an inline, move it outside of\n // the inline before inserting\n if (Range.isCollapsed(selection)) {\n const inline = Editor.above(editor, {\n match: n => Editor.isInline(editor, n),\n mode: 'highest',\n })\n\n if (inline) {\n const [, inlinePath] = inline\n\n if (Editor.isEnd(editor, selection.anchor, inlinePath)) {\n const point = Editor.after(editor, inlinePath)!\n Transforms.setSelection(editor, {\n anchor: point,\n focus: point,\n })\n }\n }\n }\n\n if (marks) {\n const node = { text, ...marks }\n Transforms.insertNodes(editor, node)\n } else {\n Transforms.insertText(editor, text)\n }\n\n editor.marks = null\n }\n },\n\n normalizeNode: (entry: NodeEntry) => {\n const [node, path] = entry\n\n // There are no core normalizations for text nodes.\n if (Text.isText(node)) {\n return\n }\n\n // Ensure that block and inline nodes have at least one text child.\n if (Element.isElement(node) && node.children.length === 0) {\n const child = { text: '' }\n Transforms.insertNodes(editor, child, {\n at: path.concat(0),\n voids: true,\n })\n return\n }\n\n // Determine whether the node should have block or inline children.\n const shouldHaveInlines = Editor.isEditor(node)\n ? false\n : Element.isElement(node) &&\n (editor.isInline(node) ||\n node.children.length === 0 ||\n Text.isText(node.children[0]) ||\n editor.isInline(node.children[0]))\n\n // Since we'll be applying operations while iterating, keep track of an\n // index that accounts for any added/removed nodes.\n let n = 0\n\n for (let i = 0; i < node.children.length; i++, n++) {\n const child = node.children[i] as Descendant\n const prev = node.children[i - 1] as Descendant\n const isLast = i === node.children.length - 1\n const isInlineOrText =\n Text.isText(child) ||\n (Element.isElement(child) && editor.isInline(child))\n\n // Only allow block nodes in the top-level children and parent blocks\n // that only contain block nodes. Similarly, only allow inline nodes in\n // other inline nodes, or parent blocks that only contain inlines and\n // text.\n if (isInlineOrText !== shouldHaveInlines) {\n Transforms.removeNodes(editor, { at: path.concat(n), voids: true })\n n--\n } else if (Element.isElement(child)) {\n // Ensure that inline nodes are surrounded by text nodes.\n if (editor.isInline(child)) {\n if (prev == null || !Text.isText(prev)) {\n const newChild = { text: '' }\n Transforms.insertNodes(editor, newChild, {\n at: path.concat(n),\n voids: true,\n })\n n++\n } else if (isLast) {\n const newChild = { text: '' }\n Transforms.insertNodes(editor, newChild, {\n at: path.concat(n + 1),\n voids: true,\n })\n n++\n }\n }\n } else {\n // Merge adjacent text nodes that are empty or match.\n if (prev != null && Text.isText(prev)) {\n if (Text.equals(child, prev, { loose: true })) {\n Transforms.mergeNodes(editor, { at: path.concat(n), voids: true })\n n--\n } else if (prev.text === '') {\n Transforms.removeNodes(editor, {\n at: path.concat(n - 1),\n voids: true,\n })\n n--\n } else if (isLast && child.text === '') {\n Transforms.removeNodes(editor, {\n at: path.concat(n),\n voids: true,\n })\n n--\n }\n }\n }\n }\n },\n\n removeMark: (key: string) => {\n const { selection } = editor\n\n if (selection) {\n if (Range.isExpanded(selection)) {\n Transforms.unsetNodes(editor, key, {\n match: Text.isText,\n split: true,\n })\n } else {\n const marks = { ...(Editor.marks(editor) || {}) }\n delete marks[key]\n editor.marks = marks\n editor.onChange()\n }\n }\n },\n }\n\n return editor\n}\n\n/**\n * Get the \"dirty\" paths generated from an operation.\n */\n\nconst getDirtyPaths = (op: Operation) => {\n switch (op.type) {\n case 'insert_text':\n case 'remove_text':\n case 'set_node': {\n const { path } = op\n return Path.levels(path)\n }\n\n case 'insert_node': {\n const { node, path } = op\n const levels = Path.levels(path)\n const descendants = Text.isText(node)\n ? []\n : Array.from(Node.nodes(node), ([, p]) => path.concat(p))\n\n return [...levels, ...descendants]\n }\n\n case 'merge_node': {\n const { path } = op\n const ancestors = Path.ancestors(path)\n const previousPath = Path.previous(path)\n return [...ancestors, previousPath]\n }\n\n case 'move_node': {\n const { path, newPath } = op\n\n if (Path.equals(path, newPath)) {\n return []\n }\n\n const oldAncestors: Path[] = []\n const newAncestors: Path[] = []\n\n for (const ancestor of Path.ancestors(path)) {\n const p = Path.transform(ancestor, op)\n oldAncestors.push(p!)\n }\n\n for (const ancestor of Path.ancestors(newPath)) {\n const p = Path.transform(ancestor, op)\n newAncestors.push(p!)\n }\n\n return [...oldAncestors, ...newAncestors]\n }\n\n case 'remove_node': {\n const { path } = op\n const ancestors = Path.ancestors(path)\n return [...ancestors]\n }\n\n case 'split_node': {\n const { path } = op\n const levels = Path.levels(path)\n const nextPath = Path.next(path)\n return [...levels, nextPath]\n }\n\n default: {\n return []\n }\n }\n}\n"],"names":["objectWithoutPropertiesLoose","DIRTY_PATHS","WeakMap","FLUSHING","NORMALIZING","PATH_REFS","POINT_REFS","RANGE_REFS","SPACE","PUNCTUATION","CHAMELEON","SURROGATE_START","SURROGATE_END","ZERO_WIDTH_JOINER","getCharacterDistance","text","offset","prev","charCode","charCodeAt","isSurrogate","modifier","isModifier","isBMPEmoji","isVariationSelector","getWordDistance","length","i","started","char","charAt","l","slice","rest","isWordCharacter","remaining","test","next","code","Editor","above","editor","options","voids","mode","at","selection","match","path","reverse","n","p","levels","Text","isText","Path","equals","addMark","key","value","after","anchor","point","edge","focus","end","range","distance","d","target","positions","before","start","deleteBackward","unit","deleteForward","deleteFragment","edges","first","node","fragment","Node","hasBlocks","element","children","some","isBlock","hasInlines","isInline","hasTexts","every","insertBreak","insertFragment","insertNode","insertText","Element","isElement","isEditor","isPlainObject","apply","isVoid","normalizeNode","onChange","removeMark","marks","Range","isRange","isNodeList","Operation","isOperationList","operations","isEnd","Point","isEdge","isStart","isEmpty","isNormalizing","get","undefined","last","leaf","push","isExpanded","nodes","previous","block","prevNode","prevPath","blockPath","isAncestor","from","to","span","isPath","Error","parent","includes","universal","Span","isSpan","iterable","pass","matches","hit","isLower","compare","emit","normalize","force","getDirtyPaths","allPaths","Array","set","withoutNormalizing","max","m","pop","entry","parentPath","depth","firstPath","lastPath","common","isPoint","pathRef","affinity","ref","current","unref","pathRefs","delete","refs","add","Set","pointRef","pointRefs","string","available","isNewBlock","advance","e","s","reverseText","isFirst","rangeRef","rangeRefs","t","transform","op","createDraft","type","index","splice","points","newPath","truePath","newParent","newIndex","result","texts","newProperties","JSON","stringify","Object","assign","position","properties","newNode","finishDraft","isDraft","unhangRange","isCollapsed","endBlock","skip","isBefore","void","fn","isElementList","isArray","props","Location","isLocation","ancestor","root","ancestors","child","c","childPath","concat","another","descendant","descendants","elements","newRoot","produce","r","has","isNode","visited","isAfter","nextIndex","map","join","isNodeOperation","isOperation","endsWith","isSelectionOperation","isTextOperation","inverse","inversePath","inverseNewPath","paths","av","bv","min","Math","endsAfter","as","bs","endsAt","endsBefore","isChild","isCommon","isDescendant","isParent","isSibling","al","bl","list","relative","operation","onp","copy","PathRef","PointRef","isBackward","rs","re","ts","te","isAfterStart","isBeforeEnd","intersection","s1","e1","s2","e2","isForward","affinityAnchor","affinityFocus","RangeRef","loose","isTextList","decorations","leaves","dec","o","middle","off","GeneralTransforms","NodeTransforms","insertNodes","hanging","select","Transforms","matchPath","isAtEnd","splitNodes","liftNodes","toPath","moveNodes","removeNodes","splitPath","mergeNodes","commonPath","isPreviousSibling","emptyAncestor","emptyRef","toRef","targets","depths","setNodes","split","splitMode","k","keys","height","always","deleteRange","beforeRef","highest","voidMatch","nudge","voidNode","voidPath","afterPath","siblingHeight","afterRef","highestPath","lowestPath","unsetNodes","obj","unwrapNodes","wrapNodes","roots","rootPath","a","commonNode","wrapperPath","wrapper","SelectionTransforms","collapse","deselect","move","opts","setSelection","setPoint","oldProps","newProps","TextTransforms","furthestVoid","startBlock","isAcrossBlocks","isSingleText","startVoid","endVoid","startRef","endRef","inlineElementMatch","inlinePath","blockMatch","isBlockStart","isBlockEnd","mergeStart","mergeEnd","matcher","starts","middles","ends","starting","inlineMatch","isInlineStart","isInlineEnd","middleRef","createEditor","dirtyPaths","oldDirtyPaths","newDirtyPaths","Promise","resolve","then","getFragment","inline","shouldHaveInlines","isLast","isInlineOrText","newChild","previousPath","oldAncestors","newAncestors","nextPath"],"mappings":";;;;;;;;;;AAAe,SAAS,eAAe,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE;EACvD,IAAI,GAAG,IAAI,GAAG,EAAE;IACd,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,EAAE;MAC9B,KAAK,EAAE,KAAK;MACZ,UAAU,EAAE,IAAI;MAChB,YAAY,EAAE,IAAI;MAClB,QAAQ,EAAE,IAAI;KACf,CAAC,CAAC;GACJ,MAAM;IACL,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;GAClB;;EAED,OAAO,GAAG,CAAC;;;CACZ,DCbc,SAAS,6BAA6B,CAAC,MAAM,EAAE,QAAQ,EAAE;EACtE,IAAI,MAAM,IAAI,IAAI,EAAE,OAAO,EAAE,CAAC;EAC9B,IAAI,MAAM,GAAG,EAAE,CAAC;EAChB,IAAI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;EACrC,IAAI,GAAG,EAAE,CAAC,CAAC;;EAEX,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IACtC,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,SAAS;IACzC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;GAC3B;;EAED,OAAO,MAAM,CAAC;;;CACf,DCZc,SAAS,wBAAwB,CAAC,MAAM,EAAE,QAAQ,EAAE;EACjE,IAAI,MAAM,IAAI,IAAI,EAAE,OAAO,EAAE,CAAC;EAC9B,IAAI,MAAM,GAAGA,6BAA4B,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;EAC5D,IAAI,GAAG,EAAE,CAAC,CAAC;;EAEX,IAAI,MAAM,CAAC,qBAAqB,EAAE;IAChC,IAAI,gBAAgB,GAAG,MAAM,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;;IAE5D,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;MAC5C,GAAG,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;MAC1B,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,SAAS;MACzC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,SAAS;MACvE,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;KAC3B;GACF;;EAED,OAAO,MAAM,CAAC;;;CACf,DChBM,IAAMC,WAAW,GAA4B,IAAIC,OAAJ,EAA7C;AACP,AAAO,IAAMC,QAAQ,GAA6B,IAAID,OAAJ,EAA3C;AACP,AAAO,IAAME,WAAW,GAA6B,IAAIF,OAAJ,EAA9C;AACP,AAAO,IAAMG,SAAS,GAAkC,IAAIH,OAAJ,EAAjD;AACP,AAAO,IAAMI,UAAU,GAAmC,IAAIJ,OAAJ,EAAnD;AACP,AAAO,IAAMK,UAAU,GAAmC,IAAIL,OAAJ,EAAnD;;ACPP;;;AAIA,IAAMM,KAAK,GAAG,IAAd;AACA,IAAMC,WAAW,GAAG,oyCAApB;AACA,IAAMC,SAAS,GAAG,iBAAlB;AACA,IAAMC,eAAe,GAAG,MAAxB;AACA,IAAMC,aAAa,GAAG,MAAtB;AACA,IAAMC,iBAAiB,GAAG,MAA1B;;;;;AAMA,AAAO,IAAMC,oBAAoB,GAAIC,IAAD;MAC9BC,MAAM,GAAG,CAAb;;;;;;;MAOIC,IAAI,GAAkD,IAA1D;MACIC,QAAQ,GAAGH,IAAI,CAACI,UAAL,CAAgB,CAAhB,CAAf;;SAEOD,QAAP,EAAiB;QACXE,WAAW,CAACF,QAAD,CAAf,EAA2B;UACnBG,QAAQ,GAAGC,UAAU,CAACJ,QAAD,EAAWH,IAAX,EAAiBC,MAAjB,CAA3B,CADyB;;;;UAMrBC,IAAI,KAAK,MAAT,IAAmBA,IAAI,KAAK,KAAhC,EAAuC;;;;MAIvCD,MAAM,IAAI,CAAV;MACAC,IAAI,GAAGI,QAAQ,GAAG,KAAH,GAAW,MAA1B;MACAH,QAAQ,GAAGH,IAAI,CAACI,UAAL,CAAgBH,MAAhB,CAAX,CAZyB;;;;;;QAkBvBE,QAAQ,KAAKL,iBAAjB,EAAoC;MAClCG,MAAM,IAAI,CAAV;MACAC,IAAI,GAAG,KAAP;MACAC,QAAQ,GAAGH,IAAI,CAACI,UAAL,CAAgBH,MAAhB,CAAX;;;;QAKEO,UAAU,CAACL,QAAD,CAAd,EAA0B;UACpBD,IAAI,IAAIA,IAAI,KAAK,KAAjB,IAA0BA,IAAI,KAAK,KAAvC,EAA8C;;;;MAG9CD,MAAM,IAAI,CAAV;MACAC,IAAI,GAAG,KAAP;MACAC,QAAQ,GAAGH,IAAI,CAACI,UAAL,CAAgBH,MAAhB,CAAX;;;;QAKEQ,mBAAmB,CAACN,QAAD,CAAvB,EAAmC;UAC7BD,IAAI,IAAIA,IAAI,KAAK,KAArB,EAA4B;;;;MAG5BD,MAAM,IAAI,CAAV;MACAC,IAAI,GAAG,KAAP;MACAC,QAAQ,GAAGH,IAAI,CAACI,UAAL,CAAgBH,MAAhB,CAAX;;KA5Ca;;;;QAkDXC,IAAI,KAAK,KAAb,EAAoB;MAClBD,MAAM,IAAI,CAAV;;KAnDa;;;;;;SA2DVA,MAAM,IAAI,CAAjB;CAtEK;;;;;AA6EP,AAAO,IAAMS,eAAe,GAAIV,IAAD;MACzBW,MAAM,GAAG,CAAb;MACIC,CAAC,GAAG,CAAR;MACIC,OAAO,GAAG,KAAd;MACIC,IAAJ;;SAEQA,IAAI,GAAGd,IAAI,CAACe,MAAL,CAAYH,CAAZ,CAAf,EAAgC;QACxBI,CAAC,GAAGjB,oBAAoB,CAACe,IAAD,CAA9B;IACAA,IAAI,GAAGd,IAAI,CAACiB,KAAL,CAAWL,CAAX,EAAcA,CAAC,GAAGI,CAAlB,CAAP;QACME,IAAI,GAAGlB,IAAI,CAACiB,KAAL,CAAWL,CAAC,GAAGI,CAAf,CAAb;;QAEIG,eAAe,CAACL,IAAD,EAAOI,IAAP,CAAnB,EAAiC;MAC/BL,OAAO,GAAG,IAAV;MACAF,MAAM,IAAIK,CAAV;KAFF,MAGO,IAAI,CAACH,OAAL,EAAc;MACnBF,MAAM,IAAIK,CAAV;KADK,MAEA;;;;IAIPJ,CAAC,IAAII,CAAL;;;SAGKL,MAAP;CAvBK;;;;;;AA+BP,IAAMQ,eAAe,GAAG,CAACL,IAAD,EAAeM,SAAf;MAClB3B,KAAK,CAAC4B,IAAN,CAAWP,IAAX,CAAJ,EAAsB;WACb,KAAP;;;;;MAKEnB,SAAS,CAAC0B,IAAV,CAAeP,IAAf,CAAJ,EAA0B;QACpBQ,IAAI,GAAGF,SAAS,CAACL,MAAV,CAAiB,CAAjB,CAAX;QACMJ,MAAM,GAAGZ,oBAAoB,CAACuB,IAAD,CAAnC;IACAA,IAAI,GAAGF,SAAS,CAACH,KAAV,CAAgB,CAAhB,EAAmBN,MAAnB,CAAP;QACMO,IAAI,GAAGE,SAAS,CAACH,KAAV,CAAgBN,MAAhB,CAAb;;QAEIQ,eAAe,CAACG,IAAD,EAAOJ,IAAP,CAAnB,EAAiC;aACxB,IAAP;;;;MAIAxB,WAAW,CAAC2B,IAAZ,CAAiBP,IAAjB,CAAJ,EAA4B;WACnB,KAAP;;;SAGK,IAAP;CAtBF;;;;;;AA6BA,IAAMT,WAAW,GAAIkB,IAAD,IAClB3B,eAAe,IAAI2B,IAAnB,IAA2BA,IAAI,IAAI1B,aADrC;;;;;;;;AASA,IAAMU,UAAU,GAAG,CAACgB,IAAD,EAAevB,IAAf,EAA6BC,MAA7B;MACbsB,IAAI,KAAK,MAAb,EAAqB;QACbD,IAAI,GAAGtB,IAAI,CAACI,UAAL,CAAgBH,MAAM,GAAG,CAAzB,CAAb;WACOqB,IAAI,IAAI,MAAR,IAAkBA,IAAI,IAAI,MAAjC;;;SAEK,KAAP;CALF;;;;;;;;AAcA,IAAMb,mBAAmB,GAAIc,IAAD;SACnBA,IAAI,IAAI,MAAR,IAAkBA,IAAI,IAAI,MAAjC;CADF;;;;;;;;AAUA,IAAMf,UAAU,GAAIe,IAAD;;;;;SAMfA,IAAI,KAAK,MAAT;EACAA,IAAI,KAAK,MADT;EAEAA,IAAI,KAAK,MAFT;EAGAA,IAAI,KAAK,MAHT;EAIAA,IAAI,KAAK,MAJT;EAKAA,IAAI,KAAK,MALT;EAMAA,IAAI,KAAK,MAPX;;CALF;;;;;IC3HaC,MAAM,GAAG;;;;EAKpBC,KAAK,CACHC,MADG;QAEHC,8EAKI;QAEE;MACJC,KAAK,GAAG,KADJ;MAEJC,IAAI,GAAG,QAFH;MAGJC,EAAE,GAAGJ,MAAM,CAACK,SAHR;MAIJC;QACEL,OALJ;;QAOI,CAACG,EAAL,EAAS;;;;QAIHG,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,CAAb;QACMI,OAAO,GAAGL,IAAI,KAAK,QAAzB;;SAEK,IAAM,CAACM,CAAD,EAAIC,CAAJ,CAAX,IAAqBZ,MAAM,CAACa,MAAP,CAAcX,MAAd,EAAsB;MACzCI,EAAE,EAAEG,IADqC;MAEzCL,KAFyC;MAGzCI,KAHyC;MAIzCE;KAJmB,CAArB,EAKI;UACE,CAACI,IAAI,CAACC,MAAL,CAAYJ,CAAZ,CAAD,IAAmB,CAACK,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkBG,CAAlB,CAAxB,EAA8C;eACrC,CAACD,CAAD,EAAIC,CAAJ,CAAP;;;GAnCc;;;;;;;;EA+CpBM,OAAO,CAAChB,MAAD,EAAiBiB,GAAjB,EAA8BC,KAA9B;IACLlB,MAAM,CAACgB,OAAP,CAAeC,GAAf,EAAoBC,KAApB;GAhDkB;;;;;EAuDpBC,KAAK,CACHnB,MADG,EAEHI,EAFG;QAGHH,8EAGI;QAEEmB,MAAM,GAAGtB,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBI,EAArB,EAAyB;MAAEkB,IAAI,EAAE;KAAjC,CAAf;QACMC,KAAK,GAAGzB,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmB,EAAnB,CAAd;QACMyB,KAAK,GAAG;MAAEL,MAAF;MAAUG;KAAxB;QACM;MAAEG,QAAQ,GAAG;QAAMzB,OAAzB;QACI0B,CAAC,GAAG,CAAR;QACIC,MAAJ;;SAEK,IAAMlB,CAAX,IAAgBZ,MAAM,CAAC+B,SAAP,CAAiB7B,MAAjB,oBAA8BC,OAA9B;MAAuCG,EAAE,EAAEqB;OAA3D,EAAqE;UAC/DE,CAAC,GAAGD,QAAR,EAAkB;;;;UAIdC,CAAC,KAAK,CAAV,EAAa;QACXC,MAAM,GAAGlB,CAAT;;;MAGFiB,CAAC;;;WAGIC,MAAP;GAlFkB;;;;;EAyFpBE,MAAM,CACJ9B,MADI,EAEJI,EAFI;QAGJH,8EAGI;QAEEmB,MAAM,GAAGtB,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqB,EAArB,CAAf;QACMuB,KAAK,GAAGzB,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBI,EAArB,EAAyB;MAAEkB,IAAI,EAAE;KAAjC,CAAd;QACMG,KAAK,GAAG;MAAEL,MAAF;MAAUG;KAAxB;QACM;MAAEG,QAAQ,GAAG;QAAMzB,OAAzB;QACI0B,CAAC,GAAG,CAAR;QACIC,MAAJ;;SAEK,IAAMlB,CAAX,IAAgBZ,MAAM,CAAC+B,SAAP,CAAiB7B,MAAjB,oBACXC,OADW;MAEdG,EAAE,EAAEqB,KAFU;MAGdjB,OAAO,EAAE;OAHX,EAII;UACEmB,CAAC,GAAGD,QAAR,EAAkB;;;;UAIdC,CAAC,KAAK,CAAV,EAAa;QACXC,MAAM,GAAGlB,CAAT;;;MAGFiB,CAAC;;;WAGIC,MAAP;GAxHkB;;;;;EA+HpBI,cAAc,CACZhC,MADY;QAEZC,8EAEI;QAEE;MAAEgC,IAAI,GAAG;QAAgBhC,OAA/B;IACAD,MAAM,CAACgC,cAAP,CAAsBC,IAAtB;GAtIkB;;;;;EA6IpBC,aAAa,CACXlC,MADW;QAEXC,8EAEI;QAEE;MAAEgC,IAAI,GAAG;QAAgBhC,OAA/B;IACAD,MAAM,CAACkC,aAAP,CAAqBD,IAArB;GApJkB;;;;;EA2JpBE,cAAc,CAACnC,MAAD;IACZA,MAAM,CAACmC,cAAP;GA5JkB;;;;;EAmKpBC,KAAK,CAACpC,MAAD,EAAiBI,EAAjB;WACI,CAACN,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBI,EAArB,CAAD,EAA2BN,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmBI,EAAnB,CAA3B,CAAP;GApKkB;;;;;EA2KpBoB,GAAG,CAACxB,MAAD,EAAiBI,EAAjB;WACMN,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBI,EAArB,EAAyB;MAAEkB,IAAI,EAAE;KAAjC,CAAP;GA5KkB;;;;;EAmLpBe,KAAK,CAACrC,MAAD,EAAiBI,EAAjB;QACGG,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwB;MAAEkB,IAAI,EAAE;KAAhC,CAAb;WACOxB,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAP;GArLkB;;;;;EA4LpBgC,QAAQ,CAACvC,MAAD,EAAiBI,EAAjB;QACAqB,KAAK,GAAG3B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBI,EAArB,CAAd;QACMmC,QAAQ,GAAGC,IAAI,CAACD,QAAL,CAAcvC,MAAd,EAAsByB,KAAtB,CAAjB;WACOc,QAAP;GA/LkB;;;;;EAqMpBE,SAAS,CAACzC,MAAD,EAAiB0C,OAAjB;WACAA,OAAO,CAACC,QAAR,CAAiBC,IAAjB,CAAsBnC,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAA3B,CAAP;GAtMkB;;;;;EA6MpBqC,UAAU,CAAC9C,MAAD,EAAiB0C,OAAjB;WACDA,OAAO,CAACC,QAAR,CAAiBC,IAAjB,CACLnC,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CADlB,CAAP;GA9MkB;;;;;EAuNpBuC,QAAQ,CAAChD,MAAD,EAAiB0C,OAAjB;WACCA,OAAO,CAACC,QAAR,CAAiBM,KAAjB,CAAuBxC,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,CAA5B,CAAP;GAxNkB;;;;;;;EAiOpByC,WAAW,CAAClD,MAAD;IACTA,MAAM,CAACkD,WAAP;GAlOkB;;;;;;;EA2OpBC,cAAc,CAACnD,MAAD,EAAiBuC,QAAjB;IACZvC,MAAM,CAACmD,cAAP,CAAsBZ,QAAtB;GA5OkB;;;;;;;EAqPpBa,UAAU,CAACpD,MAAD,EAAiBsC,IAAjB;IACRtC,MAAM,CAACoD,UAAP,CAAkBd,IAAlB;GAtPkB;;;;;;;EA+PpBe,UAAU,CAACrD,MAAD,EAAiB1B,IAAjB;IACR0B,MAAM,CAACqD,UAAP,CAAkB/E,IAAlB;GAhQkB;;;;;EAuQpBuE,OAAO,CAAC7C,MAAD,EAAiBkB,KAAjB;WACEoC,OAAO,CAACC,SAAR,CAAkBrC,KAAlB,KAA4B,CAAClB,MAAM,CAAC+C,QAAP,CAAgB7B,KAAhB,CAApC;GAxQkB;;;;;EA+QpBsC,QAAQ,CAACtC,KAAD;WAEJuC,aAAa,CAACvC,KAAD,CAAb,IACA,OAAOA,KAAK,CAACF,OAAb,KAAyB,UADzB,IAEA,OAAOE,KAAK,CAACwC,KAAb,KAAuB,UAFvB,IAGA,OAAOxC,KAAK,CAACc,cAAb,KAAgC,UAHhC,IAIA,OAAOd,KAAK,CAACgB,aAAb,KAA+B,UAJ/B,IAKA,OAAOhB,KAAK,CAACiB,cAAb,KAAgC,UALhC,IAMA,OAAOjB,KAAK,CAACgC,WAAb,KAA6B,UAN7B,IAOA,OAAOhC,KAAK,CAACiC,cAAb,KAAgC,UAPhC,IAQA,OAAOjC,KAAK,CAACkC,UAAb,KAA4B,UAR5B,IASA,OAAOlC,KAAK,CAACmC,UAAb,KAA4B,UAT5B,IAUA,OAAOnC,KAAK,CAAC6B,QAAb,KAA0B,UAV1B,IAWA,OAAO7B,KAAK,CAACyC,MAAb,KAAwB,UAXxB,IAYA,OAAOzC,KAAK,CAAC0C,aAAb,KAA+B,UAZ/B,IAaA,OAAO1C,KAAK,CAAC2C,QAAb,KAA0B,UAb1B,IAcA,OAAO3C,KAAK,CAAC4C,UAAb,KAA4B,UAd5B,KAeC5C,KAAK,CAAC6C,KAAN,KAAgB,IAAhB,IAAwBN,aAAa,CAACvC,KAAK,CAAC6C,KAAP,CAftC,MAgBC7C,KAAK,CAACb,SAAN,KAAoB,IAApB,IAA4B2D,KAAK,CAACC,OAAN,CAAc/C,KAAK,CAACb,SAApB,CAhB7B,KAiBAmC,IAAI,CAAC0B,UAAL,CAAgBhD,KAAK,CAACyB,QAAtB,CAjBA,IAkBAwB,SAAS,CAACC,eAAV,CAA0BlD,KAAK,CAACmD,UAAhC,CAnBF;GAhRkB;;;;;EA2SpBC,KAAK,CAACtE,MAAD,EAAiBqB,KAAjB,EAA+BjB,EAA/B;QACGoB,GAAG,GAAG1B,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmBI,EAAnB,CAAZ;WACOmE,KAAK,CAACxD,MAAN,CAAaM,KAAb,EAAoBG,GAApB,CAAP;GA7SkB;;;;;EAoTpBgD,MAAM,CAACxE,MAAD,EAAiBqB,KAAjB,EAA+BjB,EAA/B;WACGN,MAAM,CAAC2E,OAAP,CAAezE,MAAf,EAAuBqB,KAAvB,EAA8BjB,EAA9B,KAAqCN,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBqB,KAArB,EAA4BjB,EAA5B,CAA5C;GArTkB;;;;;EA4TpBsE,OAAO,CAAC1E,MAAD,EAAiB0C,OAAjB;QACC;MAAEC;QAAaD,OAArB;QACM,CAACL,KAAD,IAAUM,QAAhB;WAEEA,QAAQ,CAAC1D,MAAT,KAAoB,CAApB,IACC0D,QAAQ,CAAC1D,MAAT,KAAoB,CAApB,IACC2B,IAAI,CAACC,MAAL,CAAYwB,KAAZ,CADD,IAECA,KAAK,CAAC/D,IAAN,KAAe,EAFhB,IAGC,CAAC0B,MAAM,CAAC2D,MAAP,CAAcjB,OAAd,CALL;GA/TkB;;;;;EA4UpBK,QAAQ,CAAC/C,MAAD,EAAiBkB,KAAjB;WACCoC,OAAO,CAACC,SAAR,CAAkBrC,KAAlB,KAA4BlB,MAAM,CAAC+C,QAAP,CAAgB7B,KAAhB,CAAnC;GA7UkB;;;;;EAoVpByD,aAAa,CAAC3E,MAAD;QACL2E,aAAa,GAAGhH,WAAW,CAACiH,GAAZ,CAAgB5E,MAAhB,CAAtB;WACO2E,aAAa,KAAKE,SAAlB,GAA8B,IAA9B,GAAqCF,aAA5C;GAtVkB;;;;;EA6VpBF,OAAO,CAACzE,MAAD,EAAiBqB,KAAjB,EAA+BjB,EAA/B;;QAEDiB,KAAK,CAAC9C,MAAN,KAAiB,CAArB,EAAwB;aACf,KAAP;;;QAGIwD,KAAK,GAAGjC,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBI,EAArB,CAAd;WACOmE,KAAK,CAACxD,MAAN,CAAaM,KAAb,EAAoBU,KAApB,CAAP;GApWkB;;;;;EA2WpB4B,MAAM,CAAC3D,MAAD,EAAiBkB,KAAjB;WACGoC,OAAO,CAACC,SAAR,CAAkBrC,KAAlB,KAA4BlB,MAAM,CAAC2D,MAAP,CAAczC,KAAd,CAAnC;GA5WkB;;;;;EAmXpB4D,IAAI,CAAC9E,MAAD,EAAiBI,EAAjB;QACIG,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwB;MAAEkB,IAAI,EAAE;KAAhC,CAAb;WACOxB,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAP;GArXkB;;;;;EA4XpBwE,IAAI,CACF/E,MADE,EAEFI,EAFE;QAGFH,8EAGI;QAEEM,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwBH,OAAxB,CAAb;QACMqC,IAAI,GAAGE,IAAI,CAACuC,IAAL,CAAU/E,MAAV,EAAkBO,IAAlB,CAAb;WACO,CAAC+B,IAAD,EAAO/B,IAAP,CAAP;GAtYkB;;;;;GA6YnBI,MAAD,CACEX,MADF;QAEEC,8EAKI;QAEE;MAAEG,EAAE,GAAGJ,MAAM,CAACK,SAAd;MAAyBG,OAAO,GAAG,KAAnC;MAA0CN,KAAK,GAAG;QAAUD,OAAlE;QACI;MAAEK;QAAUL,OAAhB;;QAEIK,KAAK,IAAI,IAAb,EAAmB;MACjBA,KAAK,GAAG,MAAM,IAAd;;;QAGE,CAACF,EAAL,EAAS;;;;QAIHO,MAAM,GAAmB,EAA/B;QACMJ,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,CAAb;;SAEK,IAAM,CAACK,CAAD,EAAIC,CAAJ,CAAX,IAAqB8B,IAAI,CAAC7B,MAAL,CAAYX,MAAZ,EAAoBO,IAApB,CAArB,EAAgD;UAC1C,CAACD,KAAK,CAACG,CAAD,CAAV,EAAe;;;;MAIfE,MAAM,CAACqE,IAAP,CAAY,CAACvE,CAAD,EAAIC,CAAJ,CAAZ;;UAEI,CAACR,KAAD,IAAUJ,MAAM,CAAC6D,MAAP,CAAc3D,MAAd,EAAsBS,CAAtB,CAAd,EAAwC;;;;;QAKtCD,OAAJ,EAAa;MACXG,MAAM,CAACH,OAAP;;;WAGKG,MAAP;GApbkB;;;;;EA2bpBoD,KAAK,CAAC/D,MAAD;QACG;MAAE+D,KAAF;MAAS1D;QAAcL,MAA7B;;QAEI,CAACK,SAAL,EAAgB;aACP,IAAP;;;QAGE0D,KAAJ,EAAW;aACFA,KAAP;;;QAGEC,KAAK,CAACiB,UAAN,CAAiB5E,SAAjB,CAAJ,EAAiC;UACzB,CAACC,KAAD,IAAUR,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEM,KAAK,EAAEM,IAAI,CAACC;OAAnC,CAAhB;;UAEIP,KAAJ,EAAW;YACH,CAACgC,KAAD,IAAShC,KAAf;;YACiBd,KAAjB,4BAA0B8C,KAA1B;;eACO9C,KAAP;OAHF,MAIO;eACE,EAAP;;;;QAIE;MAAE4B;QAAWf,SAAnB;QACM;MAAEE;QAASa,MAAjB;QACI,CAACkB,IAAD,IAASxC,MAAM,CAACiF,IAAP,CAAY/E,MAAZ,EAAoBO,IAApB,CAAb;;QAEIa,MAAM,CAAC7C,MAAP,KAAkB,CAAtB,EAAyB;UACjBC,IAAI,GAAGsB,MAAM,CAACqF,QAAP,CAAgBnF,MAAhB,EAAwB;QAAEI,EAAE,EAAEG,IAAN;QAAYD,KAAK,EAAEM,IAAI,CAACC;OAAhD,CAAb;UACMuE,KAAK,GAAGtF,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QACjCM,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB;OADA,CAAd;;UAIIjC,IAAI,IAAI4G,KAAZ,EAAmB;YACX,CAACC,QAAD,EAAWC,QAAX,IAAuB9G,IAA7B;YACM,GAAG+G,SAAH,IAAgBH,KAAtB;;YAEItE,IAAI,CAAC0E,UAAL,CAAgBD,SAAhB,EAA2BD,QAA3B,CAAJ,EAA0C;UACxChD,IAAI,GAAG+C,QAAP;;;;;QAKW7F,IAAjB,4BAA0B8C,IAA1B;;WACO9C,IAAP;GAvekB;;;;;EA8epBI,IAAI,CACFI,MADE;QAEFC,8EAKI;QAEE;MAAEE,IAAI,GAAG,QAAT;MAAmBD,KAAK,GAAG;QAAUD,OAA3C;QACI;MAAEK,KAAF;MAASF,EAAE,GAAGJ,MAAM,CAACK;QAAcJ,OAAvC;;QAEI,CAACG,EAAL,EAAS;;;;QAIH,GAAGqF,IAAH,IAAW3F,MAAM,CAACgF,IAAP,CAAY9E,MAAZ,EAAoBI,EAApB,CAAjB;QACM,GAAGsF,EAAH,IAAS5F,MAAM,CAACgF,IAAP,CAAY9E,MAAZ,EAAoB,EAApB,CAAf;QACM2F,IAAI,GAAS,CAACF,IAAD,EAAOC,EAAP,CAAnB;;QAEI5E,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,KAAmBA,EAAE,CAACnB,MAAH,KAAc,CAArC,EAAwC;YAChC,IAAI4G,KAAJ,gDAAN;;;QAGEvF,KAAK,IAAI,IAAb,EAAmB;UACbQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;YACb,CAAC0F,MAAD,IAAWhG,MAAM,CAACgG,MAAP,CAAc9F,MAAd,EAAsBI,EAAtB,CAAjB;;QACAE,KAAK,GAAGG,CAAC,IAAIqF,MAAM,CAACnD,QAAP,CAAgBoD,QAAhB,CAAyBtF,CAAzB,CAAb;OAFF,MAGO;QACLH,KAAK,GAAG,MAAM,IAAd;;;;QAIE,GAAGV,IAAH,IAAWE,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;MAAEI,EAAE,EAAEuF,IAAN;MAAYrF,KAAZ;MAAmBH,IAAnB;MAAyBD;KAA9C,CAAjB;WACON,IAAP;GAhhBkB;;;;;EAuhBpB0C,IAAI,CACFtC,MADE,EAEFI,EAFE;QAGFH,8EAGI;QAEEM,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwBH,OAAxB,CAAb;QACMqC,IAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,IAAjB,CAAb;WACO,CAAC+B,IAAD,EAAO/B,IAAP,CAAP;GAjiBkB;;;;;GAwiBnB2E,KAAD,CACElF,MADF;QAEEC,8EAOI;QAEE;MACJG,EAAE,GAAGJ,MAAM,CAACK,SADR;MAEJF,IAAI,GAAG,KAFH;MAGJ6F,SAAS,GAAG,KAHR;MAIJxF,OAAO,GAAG,KAJN;MAKJN,KAAK,GAAG;QACND,OANJ;QAOI;MAAEK;QAAUL,OAAhB;;QAEI,CAACK,KAAL,EAAY;MACVA,KAAK,GAAG,MAAM,IAAd;;;QAGE,CAACF,EAAL,EAAS;;;;QAILqF,IAAJ;QACIC,EAAJ;;QAEIO,IAAI,CAACC,MAAL,CAAY9F,EAAZ,CAAJ,EAAqB;MACnBqF,IAAI,GAAGrF,EAAE,CAAC,CAAD,CAAT;MACAsF,EAAE,GAAGtF,EAAE,CAAC,CAAD,CAAP;KAFF,MAGO;UACCiC,KAAK,GAAGvC,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwB;QAAEkB,IAAI,EAAE;OAAhC,CAAd;UACMwD,IAAI,GAAGhF,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwB;QAAEkB,IAAI,EAAE;OAAhC,CAAb;MACAmE,IAAI,GAAGjF,OAAO,GAAGsE,IAAH,GAAUzC,KAAxB;MACAqD,EAAE,GAAGlF,OAAO,GAAG6B,KAAH,GAAWyC,IAAvB;;;QAGIqB,QAAQ,GAAG3D,IAAI,CAAC0C,KAAL,CAAWlF,MAAX,EAAmB;MAClCQ,OADkC;MAElCiF,IAFkC;MAGlCC,EAHkC;MAIlCU,IAAI,EAAE;YAAC,CAAC3F,CAAD,CAAD;eAAUP,KAAK,GAAG,KAAH,GAAWJ,MAAM,CAAC6D,MAAP,CAAc3D,MAAd,EAAsBS,CAAtB,CAA1B;;KAJS,CAAjB;QAOM4F,OAAO,GAAmB,EAAhC;QACIC,GAAJ;;SAEK,IAAM,CAAChE,IAAD,EAAO/B,IAAP,CAAX,IAA2B4F,QAA3B,EAAqC;UAC7BI,OAAO,GAAGD,GAAG,IAAIxF,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmB+F,GAAG,CAAC,CAAD,CAAtB,MAA+B,CAAtD,CADmC;;UAI/BnG,IAAI,KAAK,SAAT,IAAsBoG,OAA1B,EAAmC;;;;UAI/B,CAACjG,KAAK,CAACgC,IAAD,CAAV,EAAkB;;;;YAIZ0D,SAAS,IAAI,CAACO,OAAd,IAAyB3F,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAA7B,EAAgD;;SAAhD,MAEO;;;OAd0B;;;UAoB/BnC,IAAI,KAAK,QAAT,IAAqBoG,OAAzB,EAAkC;QAChCD,GAAG,GAAG,CAAChE,IAAD,EAAO/B,IAAP,CAAN;;OArBiC;;;UA0B7BkG,IAAI,GACRtG,IAAI,KAAK,QAAT,GAAoBmG,GAApB,GAA0B,CAAChE,IAAD,EAAO/B,IAAP,CAD5B;;UAGIkG,IAAJ,EAAU;YACJT,SAAJ,EAAe;UACbK,OAAO,CAACrB,IAAR,CAAayB,IAAb;SADF,MAEO;gBACCA,IAAN;;;;MAIJH,GAAG,GAAG,CAAChE,IAAD,EAAO/B,IAAP,CAAN;;;;QAIEJ,IAAI,KAAK,QAAT,IAAqBmG,GAAzB,EAA8B;UACxBN,SAAJ,EAAe;QACbK,OAAO,CAACrB,IAAR,CAAasB,GAAb;OADF,MAEO;cACCA,GAAN;;;;;;QAMAN,SAAJ,EAAe;aACNK,OAAP;;GA/oBgB;;;;;EAspBpBK,SAAS,CACP1G,MADO;QAEPC,8EAEI;QAEE;MAAE0G,KAAK,GAAG;QAAU1G,OAA1B;;QACM2G,aAAa,GAAI5G,MAAD;aACbxC,WAAW,CAACoH,GAAZ,CAAgB5E,MAAhB,KAA2B,EAAlC;KADF;;QAII,CAACF,MAAM,CAAC6E,aAAP,CAAqB3E,MAArB,CAAL,EAAmC;;;;QAI/B2G,KAAJ,EAAW;UACHE,QAAQ,GAAGC,KAAK,CAACrB,IAAN,CAAWjD,IAAI,CAAC0C,KAAL,CAAWlF,MAAX,CAAX,EAA+B;YAAC,GAAGU,CAAH,CAAD;eAAWA,CAAX;OAA/B,CAAjB;MACAlD,WAAW,CAACuJ,GAAZ,CAAgB/G,MAAhB,EAAwB6G,QAAxB;;;QAGED,aAAa,CAAC5G,MAAD,CAAb,CAAsBf,MAAtB,KAAiC,CAArC,EAAwC;;;;IAIxCa,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1BiH,GAAG,GAAGL,aAAa,CAAC5G,MAAD,CAAb,CAAsBf,MAAtB,GAA+B,EAA3C;;UACIiI,CAAC,GAAG,CAAR;;aAEON,aAAa,CAAC5G,MAAD,CAAb,CAAsBf,MAAtB,KAAiC,CAAxC,EAA2C;YACrCiI,CAAC,GAAGD,GAAR,EAAa;gBACL,IAAIpB,KAAJ,yEAC8CoB,GAD9C,2HAAN;;;YAKI1G,IAAI,GAAGqG,aAAa,CAAC5G,MAAD,CAAb,CAAsBmH,GAAtB,EAAb;YACMC,KAAK,GAAGtH,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAd;QACAP,MAAM,CAAC4D,aAAP,CAAqBwD,KAArB;QACAF,CAAC;;KAdL;GA9qBkB;;;;;EAqsBpBpB,MAAM,CACJ9F,MADI,EAEJI,EAFI;QAGJH,8EAGI;QAEEM,IAAI,GAAGT,MAAM,CAACS,IAAP,CAAYP,MAAZ,EAAoBI,EAApB,EAAwBH,OAAxB,CAAb;QACMoH,UAAU,GAAGvG,IAAI,CAACgF,MAAL,CAAYvF,IAAZ,CAAnB;QACM6G,KAAK,GAAGtH,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBqH,UAApB,CAAd;WACOD,KAAP;GAhtBkB;;;;;EAutBpB7G,IAAI,CACFP,MADE,EAEFI,EAFE;QAGFH,8EAGI;QAEE;MAAEqH,KAAF;MAAShG;QAASrB,OAAxB;;QAEIa,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;UACfkB,IAAI,KAAK,OAAb,EAAsB;YACd,GAAGiG,SAAH,IAAgB/E,IAAI,CAACH,KAAL,CAAWrC,MAAX,EAAmBI,EAAnB,CAAtB;QACAA,EAAE,GAAGmH,SAAL;OAFF,MAGO,IAAIjG,IAAI,KAAK,KAAb,EAAoB;YACnB,GAAGkG,QAAH,IAAehF,IAAI,CAACsC,IAAL,CAAU9E,MAAV,EAAkBI,EAAlB,CAArB;QACAA,EAAE,GAAGoH,QAAL;;;;QAIAxD,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;UACjBkB,IAAI,KAAK,OAAb,EAAsB;QACpBlB,EAAE,GAAG4D,KAAK,CAACjC,KAAN,CAAY3B,EAAZ,CAAL;OADF,MAEO,IAAIkB,IAAI,KAAK,KAAb,EAAoB;QACzBlB,EAAE,GAAG4D,KAAK,CAACxC,GAAN,CAAUpB,EAAV,CAAL;OADK,MAEA;QACLA,EAAE,GAAGU,IAAI,CAAC2G,MAAL,CAAYrH,EAAE,CAACgB,MAAH,CAAUb,IAAtB,EAA4BH,EAAE,CAACmB,KAAH,CAAShB,IAArC,CAAL;;;;QAIAgE,KAAK,CAACmD,OAAN,CAActH,EAAd,CAAJ,EAAuB;MACrBA,EAAE,GAAGA,EAAE,CAACG,IAAR;;;QAGE+G,KAAK,IAAI,IAAb,EAAmB;MACjBlH,EAAE,GAAGA,EAAE,CAACb,KAAH,CAAS,CAAT,EAAY+H,KAAZ,CAAL;;;WAGKlH,EAAP;GA7vBkB;;;;;;EAqwBpBuH,OAAO,CACL3H,MADK,EAELO,IAFK;QAGLN,8EAEI;QAEE;MAAE2H,QAAQ,GAAG;QAAc3H,OAAjC;QACM4H,GAAG,GAAY;MACnBC,OAAO,EAAEvH,IADU;MAEnBqH,QAFmB;;MAGnBG,KAAK;YACG;UAAED;YAAYD,GAApB;YACMG,QAAQ,GAAGlI,MAAM,CAACkI,QAAP,CAAgBhI,MAAhB,CAAjB;QACAgI,QAAQ,CAACC,MAAT,CAAgBJ,GAAhB;QACAA,GAAG,CAACC,OAAJ,GAAc,IAAd;eACOA,OAAP;;;KARJ;QAYMI,IAAI,GAAGpI,MAAM,CAACkI,QAAP,CAAgBhI,MAAhB,CAAb;IACAkI,IAAI,CAACC,GAAL,CAASN,GAAT;WACOA,GAAP;GA3xBkB;;;;;EAkyBpBG,QAAQ,CAAChI,MAAD;QACFkI,IAAI,GAAGtK,SAAS,CAACgH,GAAV,CAAc5E,MAAd,CAAX;;QAEI,CAACkI,IAAL,EAAW;MACTA,IAAI,GAAG,IAAIE,GAAJ,EAAP;MACAxK,SAAS,CAACmJ,GAAV,CAAc/G,MAAd,EAAsBkI,IAAtB;;;WAGKA,IAAP;GA1yBkB;;;;;EAizBpB7G,KAAK,CACHrB,MADG,EAEHI,EAFG;QAGHH,8EAEI;QAEE;MAAEqB,IAAI,GAAG;QAAYrB,OAA3B;;QAEIa,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;UACfG,IAAJ;;UAEIe,IAAI,KAAK,KAAb,EAAoB;YACZ,GAAGkG,QAAH,IAAehF,IAAI,CAACsC,IAAL,CAAU9E,MAAV,EAAkBI,EAAlB,CAArB;QACAG,IAAI,GAAGiH,QAAP;OAFF,MAGO;YACC,GAAGD,SAAH,IAAgB/E,IAAI,CAACH,KAAL,CAAWrC,MAAX,EAAmBI,EAAnB,CAAtB;QACAG,IAAI,GAAGgH,SAAP;;;UAGIjF,IAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,IAAjB,CAAb;;UAEI,CAACK,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAL,EAAwB;cAChB,IAAIuD,KAAJ,0BACcvE,IADd,yCACiDlB,EADjD,iCAC0EkB,IAD1E,iBAAN;;;aAKK;QAAEf,IAAF;QAAQhC,MAAM,EAAE+C,IAAI,KAAK,KAAT,GAAiBgB,IAAI,CAAChE,IAAL,CAAUW,MAA3B,GAAoC;OAA3D;;;QAGE+E,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;UACf,CAAC2B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAArB;aACOkB,IAAI,KAAK,OAAT,GAAmBS,KAAnB,GAA2BP,GAAlC;;;WAGKpB,EAAP;GAr1BkB;;;;;;EA61BpBiI,QAAQ,CACNrI,MADM,EAENqB,KAFM;QAGNpB,8EAEI;QAEE;MAAE2H,QAAQ,GAAG;QAAc3H,OAAjC;QACM4H,GAAG,GAAa;MACpBC,OAAO,EAAEzG,KADW;MAEpBuG,QAFoB;;MAGpBG,KAAK;YACG;UAAED;YAAYD,GAApB;YACMS,SAAS,GAAGxI,MAAM,CAACwI,SAAP,CAAiBtI,MAAjB,CAAlB;QACAsI,SAAS,CAACL,MAAV,CAAiBJ,GAAjB;QACAA,GAAG,CAACC,OAAJ,GAAc,IAAd;eACOA,OAAP;;;KARJ;QAYMI,IAAI,GAAGpI,MAAM,CAACwI,SAAP,CAAiBtI,MAAjB,CAAb;IACAkI,IAAI,CAACC,GAAL,CAASN,GAAT;WACOA,GAAP;GAn3BkB;;;;;EA03BpBS,SAAS,CAACtI,MAAD;QACHkI,IAAI,GAAGrK,UAAU,CAAC+G,GAAX,CAAe5E,MAAf,CAAX;;QAEI,CAACkI,IAAL,EAAW;MACTA,IAAI,GAAG,IAAIE,GAAJ,EAAP;MACAvK,UAAU,CAACkJ,GAAX,CAAe/G,MAAf,EAAuBkI,IAAvB;;;WAGKA,IAAP;GAl4BkB;;;;;;;;;;;;;GAi5BnBrG,SAAD,CACE7B,MADF;QAEEC,8EAII;QAEE;MAAEG,EAAE,GAAGJ,MAAM,CAACK,SAAd;MAAyB4B,IAAI,GAAG,QAAhC;MAA0CzB,OAAO,GAAG;QAAUP,OAApE;;QAEI,CAACG,EAAL,EAAS;;;;QAIHqB,KAAK,GAAG3B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBI,EAArB,CAAd;QACM,CAAC2B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAArB;QACMY,KAAK,GAAG7B,OAAO,GAAGgB,GAAH,GAASO,KAA9B;QACIwG,MAAM,GAAG,EAAb;QACIC,SAAS,GAAG,CAAhB;QACIjK,MAAM,GAAG,CAAb;QACImD,QAAQ,GAAkB,IAA9B;QACI+G,UAAU,GAAG,KAAjB;;QAEMC,OAAO,GAAG;UACVhH,QAAQ,IAAI,IAAhB,EAAsB;YAChBO,IAAI,KAAK,WAAb,EAA0B;UACxBP,QAAQ,GAAGrD,oBAAoB,CAACkK,MAAD,CAA/B;SADF,MAEO,IAAItG,IAAI,KAAK,MAAb,EAAqB;UAC1BP,QAAQ,GAAG1C,eAAe,CAACuJ,MAAD,CAA1B;SADK,MAEA,IAAItG,IAAI,KAAK,MAAT,IAAmBA,IAAI,KAAK,OAAhC,EAAyC;UAC9CP,QAAQ,GAAG6G,MAAM,CAACtJ,MAAlB;SADK,MAEA;UACLyC,QAAQ,GAAG,CAAX;;;QAGF6G,MAAM,GAAGA,MAAM,CAAChJ,KAAP,CAAamC,QAAb,CAAT;;;;MAIFnD,MAAM,GAAGiC,OAAO,GAAGjC,MAAM,GAAGmD,QAAZ,GAAuBnD,MAAM,GAAGmD,QAAhD;;MAEA8G,SAAS,GAAGA,SAAS,GAAG9G,QAAxB;;;MAGAA,QAAQ,GAAG8G,SAAS,IAAI,CAAb,GAAiB,IAAjB,GAAwB,IAAIA,SAAvC;KArBF;;SAwBK,IAAM,CAAClG,IAAD,EAAO/B,IAAP,CAAX,IAA2BT,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;MAAEI,EAAF;MAAMI;KAA3B,CAA3B,EAAkE;UAC5D8C,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,CAAJ,EAA6B;;;YAGvBtC,MAAM,CAAC2D,MAAP,CAAcrB,IAAd,CAAJ,EAAyB;gBACjBxC,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBO,IAArB,CAAN;;;;YAIEP,MAAM,CAAC+C,QAAP,CAAgBT,IAAhB,CAAJ,EAA2B;;;;YAIvBxC,MAAM,CAACgD,UAAP,CAAkB9C,MAAlB,EAA0BsC,IAA1B,CAAJ,EAAqC;cAC7BqG,CAAC,GAAG7H,IAAI,CAAC0E,UAAL,CAAgBjF,IAAhB,EAAsBiB,GAAG,CAACjB,IAA1B,IACNiB,GADM,GAEN1B,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmBO,IAAnB,CAFJ;cAGMqI,CAAC,GAAG9H,IAAI,CAAC0E,UAAL,CAAgBjF,IAAhB,EAAsBwB,KAAK,CAACxB,IAA5B,IACNwB,KADM,GAENjC,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBO,IAArB,CAFJ;cAIMjC,IAAI,GAAGwB,MAAM,CAACyI,MAAP,CAAcvI,MAAd,EAAsB;YAAEoB,MAAM,EAAEwH,CAAV;YAAarH,KAAK,EAAEoH;WAA1C,CAAb;UACAJ,MAAM,GAAG/H,OAAO,GAAGqI,eAAW,CAACvK,IAAD,CAAd,GAAuBA,IAAvC;UACAmK,UAAU,GAAG,IAAb;;;;UAIA7H,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;YACfwG,OAAO,GAAGhI,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkB8B,KAAK,CAAC9B,IAAxB,CAAhB;QACAiI,SAAS,GAAGlG,IAAI,CAAChE,IAAL,CAAUW,MAAtB;QACAV,MAAM,GAAGiC,OAAO,GAAGgI,SAAH,GAAe,CAA/B;;YAEIM,OAAJ,EAAa;UACXN,SAAS,GAAGhI,OAAO,GAAG6B,KAAK,CAAC9D,MAAT,GAAkBiK,SAAS,GAAGnG,KAAK,CAAC9D,MAAvD;UACAA,MAAM,GAAG8D,KAAK,CAAC9D,MAAf;;;YAGEuK,OAAO,IAAIL,UAAX,IAAyBxG,IAAI,KAAK,QAAtC,EAAgD;gBACxC;YAAE1B,IAAF;YAAQhC;WAAd;;;eAGK,IAAP,EAAa;;cAEPgK,MAAM,KAAK,EAAf,EAAmB;;WAAnB,MAEO;YACLG,OAAO;WALE;;;;cAUPF,SAAS,IAAI,CAAjB,EAAoB;kBACZ;cAAEjI,IAAF;cAAQhC;aAAd;WADF,MAEO;;;;;QAKTkK,UAAU,GAAG,KAAb;;;GA1/Bc;;;;;EAmgCpBtD,QAAQ,CACNnF,MADM;QAENC,8EAKI;QAEE;MAAEE,IAAI,GAAG,QAAT;MAAmBD,KAAK,GAAG;QAAUD,OAA3C;QACI;MAAEK,KAAF;MAASF,EAAE,GAAGJ,MAAM,CAACK;QAAcJ,OAAvC;;QAEI,CAACG,EAAL,EAAS;;;;QAIH,GAAGqF,IAAH,IAAW3F,MAAM,CAACuC,KAAP,CAAarC,MAAb,EAAqBI,EAArB,CAAjB;QACM,GAAGsF,EAAH,IAAS5F,MAAM,CAACuC,KAAP,CAAarC,MAAb,EAAqB,EAArB,CAAf;QACM2F,IAAI,GAAS,CAACF,IAAD,EAAOC,EAAP,CAAnB;;QAEI5E,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,KAAmBA,EAAE,CAACnB,MAAH,KAAc,CAArC,EAAwC;YAChC,IAAI4G,KAAJ,oDAAN;;;QAGEvF,KAAK,IAAI,IAAb,EAAmB;UACbQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;YACb,CAAC0F,MAAD,IAAWhG,MAAM,CAACgG,MAAP,CAAc9F,MAAd,EAAsBI,EAAtB,CAAjB;;QACAE,KAAK,GAAGG,CAAC,IAAIqF,MAAM,CAACnD,QAAP,CAAgBoD,QAAhB,CAAyBtF,CAAzB,CAAb;OAFF,MAGO;QACLH,KAAK,GAAG,MAAM,IAAd;;;;QAIE,GAAG6E,QAAH,IAAerF,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;MACxCQ,OAAO,EAAE,IAD+B;MAExCJ,EAAE,EAAEuF,IAFoC;MAGxCrF,KAHwC;MAIxCH,IAJwC;MAKxCD;KALmB,CAArB;WAQOiF,QAAP;GA5iCkB;;;;;EAmjCpB1D,KAAK,CAACzB,MAAD,EAAiBI,EAAjB,EAA+BsF,EAA/B;QACC1B,KAAK,CAACC,OAAN,CAAc7D,EAAd,KAAqB,CAACsF,EAA1B,EAA8B;aACrBtF,EAAP;;;QAGI2B,KAAK,GAAGjC,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBI,EAArB,CAAd;QACMoB,GAAG,GAAG1B,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmB0F,EAAE,IAAItF,EAAzB,CAAZ;WACO;MAAEgB,MAAM,EAAEW,KAAV;MAAiBR,KAAK,EAAEC;KAA/B;GA1jCkB;;;;;;EAkkCpBuH,QAAQ,CACN/I,MADM,EAENyB,KAFM;QAGNxB,8EAEI;QAEE;MAAE2H,QAAQ,GAAG;QAAc3H,OAAjC;QACM4H,GAAG,GAAa;MACpBC,OAAO,EAAErG,KADW;MAEpBmG,QAFoB;;MAGpBG,KAAK;YACG;UAAED;YAAYD,GAApB;YACMmB,SAAS,GAAGlJ,MAAM,CAACkJ,SAAP,CAAiBhJ,MAAjB,CAAlB;QACAgJ,SAAS,CAACf,MAAV,CAAiBJ,GAAjB;QACAA,GAAG,CAACC,OAAJ,GAAc,IAAd;eACOA,OAAP;;;KARJ;QAYMI,IAAI,GAAGpI,MAAM,CAACkJ,SAAP,CAAiBhJ,MAAjB,CAAb;IACAkI,IAAI,CAACC,GAAL,CAASN,GAAT;WACOA,GAAP;GAxlCkB;;;;;EA+lCpBmB,SAAS,CAAChJ,MAAD;QACHkI,IAAI,GAAGpK,UAAU,CAAC8G,GAAX,CAAe5E,MAAf,CAAX;;QAEI,CAACkI,IAAL,EAAW;MACTA,IAAI,GAAG,IAAIE,GAAJ,EAAP;MACAtK,UAAU,CAACiJ,GAAX,CAAe/G,MAAf,EAAuBkI,IAAvB;;;WAGKA,IAAP;GAvmCkB;;;;;;;;;EAknCpBpE,UAAU,CAAC9D,MAAD,EAAiBiB,GAAjB;IACRjB,MAAM,CAAC8D,UAAP,CAAkB7C,GAAlB;GAnnCkB;;;;;EA0nCpBc,KAAK,CAAC/B,MAAD,EAAiBI,EAAjB;WACIN,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBI,EAArB,EAAyB;MAAEkB,IAAI,EAAE;KAAjC,CAAP;GA3nCkB;;;;;;;;EAqoCpBiH,MAAM,CAACvI,MAAD,EAAiBI,EAAjB;QACEqB,KAAK,GAAG3B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBI,EAArB,CAAd;QACM,CAAC2B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAArB;QACInD,IAAI,GAAG,EAAX;;SAEK,IAAM,CAACgE,IAAD,EAAO/B,IAAP,CAAX,IAA2BT,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;MAC9CI,EAAE,EAAEqB,KAD0C;MAE9CnB,KAAK,EAAEM,IAAI,CAACC;KAFa,CAA3B,EAGI;UACEoI,CAAC,GAAG3G,IAAI,CAAChE,IAAb;;UAEIwC,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkBiB,GAAG,CAACjB,IAAtB,CAAJ,EAAiC;QAC/B0I,CAAC,GAAGA,CAAC,CAAC1J,KAAF,CAAQ,CAAR,EAAWiC,GAAG,CAACjD,MAAf,CAAJ;;;UAGEuC,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkBwB,KAAK,CAACxB,IAAxB,CAAJ,EAAmC;QACjC0I,CAAC,GAAGA,CAAC,CAAC1J,KAAF,CAAQwC,KAAK,CAACxD,MAAd,CAAJ;;;MAGFD,IAAI,IAAI2K,CAAR;;;WAGK3K,IAAP;GA3pCkB;;;;;EAkqCpB4K,SAAS,CAAClJ,MAAD,EAAiBmJ,EAAjB;IACPnJ,MAAM,CAAC2C,QAAP,GAAkByG,iBAAW,CAACpJ,MAAM,CAAC2C,QAAR,CAA7B;QACItC,SAAS,GAAGL,MAAM,CAACK,SAAP,IAAoB+I,iBAAW,CAACpJ,MAAM,CAACK,SAAR,CAA/C;;YAEQ8I,EAAE,CAACE,IAAX;WACO,aAAL;;cACQ;YAAE9I,IAAF;YAAQ+B;cAAS6G,EAAvB;cACMrD,MAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,IAApB,CAAf;cACM+I,KAAK,GAAG/I,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;UACA6G,MAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,KAAvB,EAA8B,CAA9B,EAAiChH,IAAjC;;cAEIjC,SAAJ,EAAe;iBACR,IAAM,CAACgB,KAAD,EAAQJ,GAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,GAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,KAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,aAAL;;cACQ;YAAE5I,IAAI,EAAJA,KAAF;YAAQhC,MAAR;YAAgBD;cAAS6K,EAA/B;;cACM7G,MAAI,GAAGE,IAAI,CAACuC,IAAL,CAAU/E,MAAV,EAAkBO,KAAlB,CAAb;;cACMuB,MAAM,GAAGQ,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmBhB,MAAnB,CAAf;;cACM4C,KAAK,GAAGmB,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,MAAhB,CAAd;;UACA+D,MAAI,CAAChE,IAAL,GAAYwD,MAAM,GAAGxD,IAAT,GAAgB6C,KAA5B;;cAEId,SAAJ,EAAe;iBACR,IAAM,CAACgB,MAAD,EAAQJ,IAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,IAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,MAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,YAAL;;cACQ;YAAE5I,IAAI,EAAJA;cAAS4I,EAAjB;;cACM7G,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACM+E,QAAQ,GAAGxE,IAAI,CAACqE,QAAL,CAAc5E,MAAd,CAAjB;cACM/B,IAAI,GAAGgE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBsF,QAAjB,CAAb;;cACMQ,OAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,MAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;;cAEI2B,IAAI,CAACC,MAAL,CAAYyB,MAAZ,KAAqB1B,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAAzB,EAA4C;YAC1CA,IAAI,CAACF,IAAL,IAAagE,MAAI,CAAChE,IAAlB;WADF,MAEO,IAAI,CAACsC,IAAI,CAACC,MAAL,CAAYyB,MAAZ,CAAD,IAAsB,CAAC1B,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAA3B,EAA8C;YACnDA,IAAI,CAACmE,QAAL,CAAcqC,IAAd,CAAmB,GAAG1C,MAAI,CAACK,QAA3B;WADK,MAEA;kBACC,IAAIkD,KAAJ,4DAC8CtF,MAD9C,gDACwF+B,MADxF,cACgG9D,IADhG,EAAN;;;UAKFsH,OAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,MAAvB,EAA8B,CAA9B;;cAEIjJ,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,WAAL;;cACQ;YAAE5I,IAAI,EAAJA,MAAF;YAAQkJ;cAAYN,EAA1B;;cAEIrI,IAAI,CAAC0E,UAAL,CAAgBjF,MAAhB,EAAsBkJ,OAAtB,CAAJ,EAAoC;kBAC5B,IAAI5D,KAAJ,+BACmBtF,MADnB,4BACyCkJ,OADzC,iDAAN;;;cAKInH,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACMuF,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB,CAXgB;;;;;;;UAmBhB6G,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAvB,EAA8B,CAA9B;;cACMI,QAAQ,GAAG5I,IAAI,CAACoI,SAAL,CAAe3I,MAAf,EAAqB4I,EAArB,CAAjB;cACMQ,SAAS,GAAGnH,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBc,IAAI,CAACgF,MAAL,CAAY4D,QAAZ,CAAjB,CAAlB;cACME,QAAQ,GAAGF,QAAQ,CAACA,QAAQ,CAACzK,MAAT,GAAkB,CAAnB,CAAzB;UAEA0K,SAAS,CAAChH,QAAV,CAAmB4G,MAAnB,CAA0BK,QAA1B,EAAoC,CAApC,EAAuCtH,MAAvC;;cAEIjC,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,aAAL;;cACQ;YAAE5I,IAAI,EAAJA;cAAS4I,EAAjB;cACMG,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;;cACM6G,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;UACAuF,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAvB,EAA8B,CAA9B,EAJkB;;;;cAQdjJ,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;kBAC5CwJ,MAAM,GAAGtF,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAf;;kBAEI9I,SAAS,IAAI,IAAb,IAAqBwJ,MAAM,IAAI,IAAnC,EAAyC;gBACvCxJ,SAAS,CAACY,KAAD,CAAT,GAAiB4I,MAAjB;eADF,MAEO;oBACDrL,KAAiC,SAArC;;oBACIoB,IAAiC,SAArC;;qBAEK,IAAM,CAACa,CAAD,EAAIC,CAAJ,CAAX,IAAqB8B,IAAI,CAACsH,KAAL,CAAW9J,MAAX,CAArB,EAAyC;sBACnCc,IAAI,CAAC0F,OAAL,CAAa9F,CAAb,EAAgBH,MAAhB,MAA0B,CAAC,CAA/B,EAAkC;oBAChC/B,KAAI,GAAG,CAACiC,CAAD,EAAIC,CAAJ,CAAP;mBADF,MAEO;oBACLd,IAAI,GAAG,CAACa,CAAD,EAAIC,CAAJ,CAAP;;;;;oBAKAlC,KAAJ,EAAU;kBACR6C,OAAK,CAACd,IAAN,GAAa/B,KAAI,CAAC,CAAD,CAAjB;kBACA6C,OAAK,CAAC9C,MAAN,GAAeC,KAAI,CAAC,CAAD,CAAJ,CAAQF,IAAR,CAAaW,MAA5B;iBAFF,MAGO,IAAIW,IAAJ,EAAU;kBACfyB,OAAK,CAACd,IAAN,GAAaX,IAAI,CAAC,CAAD,CAAjB;kBACAyB,OAAK,CAAC9C,MAAN,GAAe,CAAf;iBAFK,MAGA;kBACL8B,SAAS,GAAG,IAAZ;;;;;;;;;WASL,aAAL;;cACQ;YAAEE,IAAI,EAAJA,MAAF;YAAQhC,MAAM,EAANA,OAAR;YAAgBD,IAAI,EAAJA;cAAS6K,EAA/B;;cACM7G,MAAI,GAAGE,IAAI,CAACuC,IAAL,CAAU/E,MAAV,EAAkBO,MAAlB,CAAb;;cACMuB,OAAM,GAAGQ,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmBhB,OAAnB,CAAf;;cACM4C,MAAK,GAAGmB,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,OAAM,GAAGD,MAAI,CAACW,MAA9B,CAAd;;UACAqD,MAAI,CAAChE,IAAL,GAAYwD,OAAM,GAAGX,MAArB;;cAEId,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,UAAL;;cACQ;YAAE5I,IAAI,EAAJA,MAAF;YAAQwJ;cAAkBZ,EAAhC;;cAEI5I,MAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;kBACf,IAAI4G,KAAJ,2CAAN;;;cAGIvD,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;eAEK,IAAMU,KAAX,IAAkB8I,aAAlB,EAAiC;gBAC3B9I,KAAG,KAAK,UAAR,IAAsBA,KAAG,KAAK,MAAlC,EAA0C;oBAClC,IAAI4E,KAAJ,4BAA6B5E,KAA7B,2BAAN;;;gBAGIC,KAAK,GAAG6I,aAAa,CAAC9I,KAAD,CAA3B;;gBAEIC,KAAK,IAAI,IAAb,EAAmB;qBACVoB,MAAI,CAACrB,KAAD,CAAX;aADF,MAEO;cACLqB,MAAI,CAACrB,KAAD,CAAJ,GAAYC,KAAZ;;;;;;;WAOD,eAAL;;cACQ;YAAE6I,aAAa,EAAbA;cAAkBZ,EAA1B;;cAEIY,cAAa,IAAI,IAArB,EAA2B;YACzB1J,SAAS,GAAG0J,cAAZ;WADF,MAEO,IAAI1J,SAAS,IAAI,IAAjB,EAAuB;gBACxB,CAAC2D,KAAK,CAACC,OAAN,CAAc8F,cAAd,CAAL,EAAmC;oBAC3B,IAAIlE,KAAJ,6EAC+DmE,IAAI,CAACC,SAAL,CACjEF,cADiE,CAD/D,0CAAN;;;YAOF1J,SAAS,GAAG0J,cAAZ;WATK,MAUA;YACLG,MAAM,CAACC,MAAP,CAAc9J,SAAd,EAAyB0J,cAAzB;;;;;;WAMC,YAAL;;cACQ;YAAExJ,IAAI,EAAJA,MAAF;YAAQ6J,QAAR;YAAkBC;cAAelB,EAAvC;;cAEI5I,MAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;kBACf,IAAI4G,KAAJ,4DAC8CtF,MAD9C,8CAAN;;;cAKI+B,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACMuF,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;cACIqL,OAAJ;;cAEI1J,IAAI,CAACC,MAAL,CAAYyB,MAAZ,CAAJ,EAAuB;gBACfR,QAAM,GAAGQ,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmB6K,QAAnB,CAAf;;gBACMjJ,OAAK,GAAGmB,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB6K,QAAhB,CAAd;;YACA9H,MAAI,CAAChE,IAAL,GAAYwD,QAAZ;YACAwI,OAAO,qBACFhI,MADE,MAED+H,UAFC;cAGL/L,IAAI,EAAE6C;cAHR;WAJF,MASO;gBACCW,QAAM,GAAGQ,MAAI,CAACK,QAAL,CAAcpD,KAAd,CAAoB,CAApB,EAAuB6K,QAAvB,CAAf;;gBACMjJ,OAAK,GAAGmB,MAAI,CAACK,QAAL,CAAcpD,KAAd,CAAoB6K,QAApB,CAAd;;YACA9H,MAAI,CAACK,QAAL,GAAgBb,QAAhB;YAEAwI,OAAO,qBACFhI,MADE,MAED+H,UAFC;cAGL1H,QAAQ,EAAExB;cAHZ;;;UAOF2E,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAK,GAAG,CAA/B,EAAkC,CAAlC,EAAqCgB,OAArC;;cAEIjK,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;;IAQRnJ,MAAM,CAAC2C,QAAP,GAAkB4H,iBAAW,CAACvK,MAAM,CAAC2C,QAAR,CAA7B;;QAEItC,SAAJ,EAAe;MACbL,MAAM,CAACK,SAAP,GAAmBmK,aAAO,CAACnK,SAAD,CAAP,GACdkK,iBAAW,CAAClK,SAAD,CADG,GAEfA,SAFJ;KADF,MAIO;MACLL,MAAM,CAACK,SAAP,GAAmB,IAAnB;;GAv6CgB;;;;;EA+6CpBoK,WAAW,CACTzK,MADS,EAETyB,KAFS;QAGTxB,8EAEI;QAEE;MAAEC,KAAK,GAAG;QAAUD,OAA1B;QACI,CAAC8B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAnB;;QAGIM,KAAK,CAACxD,MAAN,KAAiB,CAAjB,IAAsBiD,GAAG,CAACjD,MAAJ,KAAe,CAArC,IAA0CyF,KAAK,CAAC0G,WAAN,CAAkBjJ,KAAlB,CAA9C,EAAwE;aAC/DA,KAAP;;;QAGIkJ,QAAQ,GAAG7K,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;MACpCI,EAAE,EAAEoB,GADgC;MAEpClB,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB;KAFG,CAAjB;QAIM8E,SAAS,GAAGoF,QAAQ,GAAGA,QAAQ,CAAC,CAAD,CAAX,GAAiB,EAA3C;QACMtI,KAAK,GAAGvC,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqB,EAArB,CAAd;QACM8B,MAAM,GAAG;MAAEV,MAAM,EAAEiB,KAAV;MAAiBd,KAAK,EAAEC;KAAvC;QACIoJ,IAAI,GAAG,IAAX;;SAEK,IAAM,CAACtI,IAAD,EAAO/B,IAAP,CAAX,IAA2BT,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;MAC9CI,EAAE,EAAE0B,MAD0C;MAE9CxB,KAAK,EAAEM,IAAI,CAACC,MAFkC;MAG9CL,OAAO,EAAE,IAHqC;MAI9CN;KAJyB,CAA3B,EAKI;UACE0K,IAAJ,EAAU;QACRA,IAAI,GAAG,KAAP;;;;UAIEtI,IAAI,CAAChE,IAAL,KAAc,EAAd,IAAoBwC,IAAI,CAAC+J,QAAL,CAActK,IAAd,EAAoBgF,SAApB,CAAxB,EAAwD;QACtD/D,GAAG,GAAG;UAAEjB,IAAF;UAAQhC,MAAM,EAAE+D,IAAI,CAAChE,IAAL,CAAUW;SAAhC;;;;;WAKG;MAAEmC,MAAM,EAAEW,KAAV;MAAiBR,KAAK,EAAEC;KAA/B;GAx9CkB;;;;;EA+9CpBsJ,IAAI,CACF9K,MADE;QAEFC,8EAII;WAEGH,MAAM,CAACC,KAAP,CAAaC,MAAb,oBACFC,OADE;MAELK,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC6D,MAAP,CAAc3D,MAAd,EAAsBS,CAAtB;OAFd;GAv+CkB;;;;;EAi/CpBuG,kBAAkB,CAAChH,MAAD,EAAiB+K,EAAjB;QACV7J,KAAK,GAAGpB,MAAM,CAAC6E,aAAP,CAAqB3E,MAArB,CAAd;IACArC,WAAW,CAACoJ,GAAZ,CAAgB/G,MAAhB,EAAwB,KAAxB;IACA+K,EAAE;IACFpN,WAAW,CAACoJ,GAAZ,CAAgB/G,MAAhB,EAAwBkB,KAAxB;IACApB,MAAM,CAAC4G,SAAP,CAAiB1G,MAAjB;;;CAt/CG;;IChDMsD,OAAO,GAAG;;;;EAKrBC,SAAS,CAACrC,KAAD;WAELuC,aAAa,CAACvC,KAAD,CAAb,IACAsB,IAAI,CAAC0B,UAAL,CAAgBhD,KAAK,CAACyB,QAAtB,CADA,IAEA,CAAC7C,MAAM,CAAC0D,QAAP,CAAgBtC,KAAhB,CAHH;GANmB;;;;;EAiBrB8J,aAAa,CAAC9J,KAAD;WAET4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,MACCA,KAAK,CAACjC,MAAN,KAAiB,CAAjB,IAAsBqE,OAAO,CAACC,SAAR,CAAkBrC,KAAK,CAAC,CAAD,CAAvB,CADvB,CADF;GAlBmB;;;;;;;;EA+BrBmF,OAAO,CAAC3D,OAAD,EAAmBwI,KAAnB;SACA,IAAMjK,GAAX,IAAkBiK,KAAlB,EAAyB;UACnBjK,GAAG,KAAK,UAAZ,EAAwB;;;;UAIpByB,OAAO,CAACzB,GAAD,CAAP,KAAiBiK,KAAK,CAACjK,GAAD,CAA1B,EAAiC;eACxB,KAAP;;;;WAIG,IAAP;;;CA1CG;;ICDMkK,QAAQ,GAAG;;;;EAKtBC,UAAU,CAAClK,KAAD;WACDJ,IAAI,CAAC8E,MAAL,CAAY1E,KAAZ,KAAsBqD,KAAK,CAACmD,OAAN,CAAcxG,KAAd,CAAtB,IAA8C8C,KAAK,CAACC,OAAN,CAAc/C,KAAd,CAArD;;;CANG;AAiBP,IAAa+E,IAAI,GAAG;;;;EAKlBC,MAAM,CAAChF,KAAD;WAEF4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,KAAwBA,KAAK,CAACjC,MAAN,KAAiB,CAAzC,IAA8CiC,KAAK,CAAC+B,KAAN,CAAYnC,IAAI,CAAC8E,MAAjB,CADhD;;;CANG;;ICpBMpD,IAAI,GAAG;;;;EAKlB6I,QAAQ,CAACC,IAAD,EAAa/K,IAAb;QACA+B,IAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe/K,IAAf,CAAb;;QAEIK,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;YACf,IAAIuD,KAAJ,iDACqCtF,IADrC,yDACwF+B,IADxF,EAAN;;;WAKKA,IAAP;GAdgB;;;;;;;;GAwBjBiJ,SAAD,CACED,IADF,EAEE/K,IAFF;QAGEN,8EAEI;;SAEC,IAAMS,CAAX,IAAgBI,IAAI,CAACyK,SAAL,CAAehL,IAAf,EAAqBN,OAArB,CAAhB,EAA+C;UACvCQ,CAAC,GAAG+B,IAAI,CAAC6I,QAAL,CAAcC,IAAd,EAAoB5K,CAApB,CAAV;UACM0G,KAAK,GAAwB,CAAC3G,CAAD,EAAIC,CAAJ,CAAnC;YACM0G,KAAN;;GAlCc;;;;;EA0ClBoE,KAAK,CAACF,IAAD,EAAahC,KAAb;QACC1I,IAAI,CAACC,MAAL,CAAYyK,IAAZ,CAAJ,EAAuB;YACf,IAAIzF,KAAJ,gDACoCmE,IAAI,CAACC,SAAL,CAAeqB,IAAf,CADpC,EAAN;;;QAKIG,CAAC,GAAGH,IAAI,CAAC3I,QAAL,CAAc2G,KAAd,CAAV;;QAEImC,CAAC,IAAI,IAAT,EAAe;YACP,IAAI5F,KAAJ,sCAC2ByD,KAD3B,wBAC+CU,IAAI,CAACC,SAAL,CACjDqB,IADiD,CAD/C,EAAN;;;WAOKG,CAAP;GA3DgB;;;;;GAkEjB9I,QAAD,CACE2I,IADF,EAEE/K,IAFF;QAGEN,8EAEI;QAEE;MAAEO,OAAO,GAAG;QAAUP,OAA5B;QACMoL,QAAQ,GAAG7I,IAAI,CAAC6I,QAAL,CAAcC,IAAd,EAAoB/K,IAApB,CAAjB;QACM;MAAEoC;QAAa0I,QAArB;QACI/B,KAAK,GAAG9I,OAAO,GAAGmC,QAAQ,CAAC1D,MAAT,GAAkB,CAArB,GAAyB,CAA5C;;WAEOuB,OAAO,GAAG8I,KAAK,IAAI,CAAZ,GAAgBA,KAAK,GAAG3G,QAAQ,CAAC1D,MAA/C,EAAuD;UAC/CuM,KAAK,GAAGhJ,IAAI,CAACgJ,KAAL,CAAWH,QAAX,EAAqB/B,KAArB,CAAd;UACMoC,SAAS,GAAGnL,IAAI,CAACoL,MAAL,CAAYrC,KAAZ,CAAlB;YACM,CAACkC,KAAD,EAAQE,SAAR,CAAN;MACApC,KAAK,GAAG9I,OAAO,GAAG8I,KAAK,GAAG,CAAX,GAAeA,KAAK,GAAG,CAAtC;;GAlFc;;;;;EA0FlB7B,MAAM,CAAC6D,IAAD,EAAa/K,IAAb,EAAyBqL,OAAzB;QACElL,CAAC,GAAGI,IAAI,CAAC2G,MAAL,CAAYlH,IAAZ,EAAkBqL,OAAlB,CAAV;QACMnL,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAV;WACO,CAACD,CAAD,EAAIC,CAAJ,CAAP;GA7FgB;;;;;EAoGlBmL,UAAU,CAACP,IAAD,EAAa/K,IAAb;QACF+B,IAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe/K,IAAf,CAAb;;QAEIT,MAAM,CAAC0D,QAAP,CAAgBlB,IAAhB,CAAJ,EAA2B;YACnB,IAAIuD,KAAJ,mDACuCtF,IADvC,kEACmG+B,IADnG,EAAN;;;WAKKA,IAAP;GA7GgB;;;;;GAoHjBwJ,WAAD,CACER,IADF;QAEErL,8EAKI;;SAEC,IAAM,CAACqC,IAAD,EAAO/B,IAAP,CAAX,IAA2BiC,IAAI,CAAC0C,KAAL,CAAWoG,IAAX,EAAiBrL,OAAjB,CAA3B,EAAsD;UAChDM,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;;;cAGf,CAACqD,IAAD,EAAO/B,IAAP,CAAN;;;GAjIY;;;;;;;GA4IjBwL,QAAD,CACET,IADF;QAEErL,8EAKI;;SAEC,IAAM,CAACqC,IAAD,EAAO/B,IAAP,CAAX,IAA2BiC,IAAI,CAAC0C,KAAL,CAAWoG,IAAX,EAAiBrL,OAAjB,CAA3B,EAAsD;UAChDqD,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,CAAJ,EAA6B;cACrB,CAACA,IAAD,EAAO/B,IAAP,CAAN;;;GAvJY;;;;;EAgKlB8B,KAAK,CAACiJ,IAAD,EAAa/K,IAAb;QACGG,CAAC,GAAGH,IAAI,CAAChB,KAAL,EAAV;QACIkB,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAR;;WAEOD,CAAP,EAAU;UACJG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBA,CAAC,CAACkC,QAAF,CAAW1D,MAAX,KAAsB,CAA5C,EAA+C;;OAA/C,MAEO;QACLwB,CAAC,GAAGA,CAAC,CAACkC,QAAF,CAAW,CAAX,CAAJ;QACAjC,CAAC,CAACsE,IAAF,CAAO,CAAP;;;;WAIG,CAACvE,CAAD,EAAIC,CAAJ,CAAP;GA7KgB;;;;;EAoLlB6B,QAAQ,CAAC+I,IAAD,EAAa7J,KAAb;QACFb,IAAI,CAACC,MAAL,CAAYyK,IAAZ,CAAJ,EAAuB;YACf,IAAIzF,KAAJ,iEACqDmE,IAAI,CAACC,SAAL,CACvDqB,IADuD,CADrD,EAAN;;;QAOIU,OAAO,GAAGC,aAAO,CAACX,IAAD,EAAOY,CAAC;UACvB,CAACnK,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAArB;UACM0E,QAAQ,GAAG3D,IAAI,CAAC0C,KAAL,CAAWgH,CAAX,EAAc;QAC7B1L,OAAO,EAAE,IADoB;QAE7B4F,IAAI,EAAE;cAAC,GAAG7F,IAAH,CAAD;iBAAc,CAACyD,KAAK,CAAC+B,QAAN,CAAetE,KAAf,EAAsBlB,IAAtB,CAAf;;OAFS,CAAjB;;WAKK,IAAM,GAAGA,IAAH,CAAX,IAAuB4F,QAAvB,EAAiC;YAC3B,CAACnC,KAAK,CAAC+B,QAAN,CAAetE,KAAf,EAAsBlB,IAAtB,CAAL,EAAkC;cAC1BuF,MAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAYoG,CAAZ,EAAe3L,IAAf,CAAf;cACM+I,KAAK,GAAG/I,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;UACA6G,MAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,KAAvB,EAA8B,CAA9B;;;YAGExI,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkBiB,GAAG,CAACjB,IAAtB,CAAJ,EAAiC;cACzBwE,IAAI,GAAGvC,IAAI,CAACuC,IAAL,CAAUmH,CAAV,EAAa3L,IAAb,CAAb;UACAwE,IAAI,CAACzG,IAAL,GAAYyG,IAAI,CAACzG,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmBiC,GAAG,CAACjD,MAAvB,CAAZ;;;YAGEuC,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkBwB,KAAK,CAACxB,IAAxB,CAAJ,EAAmC;cAC3BwE,KAAI,GAAGvC,IAAI,CAACuC,IAAL,CAAUmH,CAAV,EAAa3L,IAAb,CAAb;;UACAwE,KAAI,CAACzG,IAAL,GAAYyG,KAAI,CAACzG,IAAL,CAAUiB,KAAV,CAAgBwC,KAAK,CAACxD,MAAtB,CAAZ;;;;aAIG2N,CAAC,CAAC7L,SAAT;KAzBqB,CAAvB;WA4BO2L,OAAO,CAACrJ,QAAf;GAzNgB;;;;;;EAiOlBiC,GAAG,CAAC0G,IAAD,EAAa/K,IAAb;QACG+B,IAAI,GAAGgJ,IAAX;;SAEK,IAAIpM,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGqB,IAAI,CAACtB,MAAzB,EAAiCC,CAAC,EAAlC,EAAsC;UAC9BwB,CAAC,GAAGH,IAAI,CAACrB,CAAD,CAAd;;UAEI0B,IAAI,CAACC,MAAL,CAAYyB,IAAZ,KAAqB,CAACA,IAAI,CAACK,QAAL,CAAcjC,CAAd,CAA1B,EAA4C;cACpC,IAAImF,KAAJ,6CACiCtF,IADjC,wBACmDyJ,IAAI,CAACC,SAAL,CACrDqB,IADqD,CADnD,EAAN;;;MAOFhJ,IAAI,GAAGA,IAAI,CAACK,QAAL,CAAcjC,CAAd,CAAP;;;WAGK4B,IAAP;GAlPgB;;;;;EAyPlB6J,GAAG,CAACb,IAAD,EAAa/K,IAAb;QACG+B,IAAI,GAAGgJ,IAAX;;SAEK,IAAIpM,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGqB,IAAI,CAACtB,MAAzB,EAAiCC,CAAC,EAAlC,EAAsC;UAC9BwB,CAAC,GAAGH,IAAI,CAACrB,CAAD,CAAd;;UAEI0B,IAAI,CAACC,MAAL,CAAYyB,IAAZ,KAAqB,CAACA,IAAI,CAACK,QAAL,CAAcjC,CAAd,CAA1B,EAA4C;eACnC,KAAP;;;MAGF4B,IAAI,GAAGA,IAAI,CAACK,QAAL,CAAcjC,CAAd,CAAP;;;WAGK,IAAP;GAtQgB;;;;;EA6QlB0L,MAAM,CAAClL,KAAD;WAEFN,IAAI,CAACC,MAAL,CAAYK,KAAZ,KAAsBoC,OAAO,CAACC,SAAR,CAAkBrC,KAAlB,CAAtB,IAAkDpB,MAAM,CAAC0D,QAAP,CAAgBtC,KAAhB,CADpD;GA9QgB;;;;;EAuRlBgD,UAAU,CAAChD,KAAD;WACD4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,MAAyBA,KAAK,CAACjC,MAAN,KAAiB,CAAjB,IAAsBuD,IAAI,CAAC4J,MAAL,CAAYlL,KAAK,CAAC,CAAD,CAAjB,CAA/C,CAAP;GAxRgB;;;;;EA+RlB4D,IAAI,CAACwG,IAAD,EAAa/K,IAAb;QACIG,CAAC,GAAGH,IAAI,CAAChB,KAAL,EAAV;QACIkB,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAR;;WAEOD,CAAP,EAAU;UACJG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBA,CAAC,CAACkC,QAAF,CAAW1D,MAAX,KAAsB,CAA5C,EAA+C;;OAA/C,MAEO;YACCC,CAAC,GAAGuB,CAAC,CAACkC,QAAF,CAAW1D,MAAX,GAAoB,CAA9B;QACAwB,CAAC,GAAGA,CAAC,CAACkC,QAAF,CAAWzD,CAAX,CAAJ;QACAwB,CAAC,CAACsE,IAAF,CAAO9F,CAAP;;;;WAIG,CAACuB,CAAD,EAAIC,CAAJ,CAAP;GA7SgB;;;;;EAoTlBqE,IAAI,CAACuG,IAAD,EAAa/K,IAAb;QACI+B,IAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe/K,IAAf,CAAb;;QAEI,CAACK,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAL,EAAwB;YAChB,IAAIuD,KAAJ,6CACiCtF,IADjC,qDACgF+B,IADhF,EAAN;;;WAKKA,IAAP;GA7TgB;;;;;;;;GAuUjB3B,MAAD,CACE2K,IADF,EAEE/K,IAFF;QAGEN,8EAEI;;SAEC,IAAMS,CAAX,IAAgBI,IAAI,CAACH,MAAL,CAAYJ,IAAZ,EAAkBN,OAAlB,CAAhB,EAA4C;UACpCQ,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAV;YACM,CAACD,CAAD,EAAIC,CAAJ,CAAN;;GAhVc;;;;;EAwVlB2F,OAAO,CAAC/D,IAAD,EAAa4I,KAAb;WAEF5H,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,KAA2BgB,OAAO,CAAC+C,OAAR,CAAgB/D,IAAhB,EAAsB4I,KAAtB,CAA5B,IACCtK,IAAI,CAACC,MAAL,CAAYyB,IAAZ,KAAqB1B,IAAI,CAACyF,OAAL,CAAa/D,IAAb,EAAmB4I,KAAnB,CAFxB;GAzVgB;;;;;;;GAqWjBhG,KAAD,CACEoG,IADF;QAEErL,8EAKI;QAEE;MAAEmG,IAAF;MAAQ5F,OAAO,GAAG;QAAUP,OAAlC;QACM;MAAEwF,IAAI,GAAG,EAAT;MAAaC;QAAOzF,OAA1B;QACMoM,OAAO,GAAG,IAAIjE,GAAJ,EAAhB;QACI1H,CAAC,GAAS,EAAd;QACID,CAAC,GAAG6K,IAAR;;WAEO,IAAP,EAAa;UACP5F,EAAE,KAAKlF,OAAO,GAAGM,IAAI,CAAC+J,QAAL,CAAcnK,CAAd,EAAiBgF,EAAjB,CAAH,GAA0B5E,IAAI,CAACwL,OAAL,CAAa5L,CAAb,EAAgBgF,EAAhB,CAAtC,CAAN,EAAkE;;;;UAI9D,CAAC2G,OAAO,CAACF,GAAR,CAAY1L,CAAZ,CAAL,EAAqB;cACb,CAACA,CAAD,EAAIC,CAAJ,CAAN;OANS;;;UAWT,CAAC2L,OAAO,CAACF,GAAR,CAAY1L,CAAZ,CAAD,IACA,CAACG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,CADD,IAEAA,CAAC,CAACkC,QAAF,CAAW1D,MAAX,KAAsB,CAFtB,KAGCmH,IAAI,IAAI,IAAR,IAAgBA,IAAI,CAAC,CAAC3F,CAAD,EAAIC,CAAJ,CAAD,CAAJ,KAAiB,KAHlC,CADF,EAKE;QACA2L,OAAO,CAAClE,GAAR,CAAY1H,CAAZ;YACI8L,SAAS,GAAG/L,OAAO,GAAGC,CAAC,CAACkC,QAAF,CAAW1D,MAAX,GAAoB,CAAvB,GAA2B,CAAlD;;YAEI6B,IAAI,CAAC0E,UAAL,CAAgB9E,CAAhB,EAAmB+E,IAAnB,CAAJ,EAA8B;UAC5B8G,SAAS,GAAG9G,IAAI,CAAC/E,CAAC,CAACzB,MAAH,CAAhB;;;QAGFyB,CAAC,GAAGA,CAAC,CAACiL,MAAF,CAASY,SAAT,CAAJ;QACA9L,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAJ;;OAxBS;;;UA6BPA,CAAC,CAACzB,MAAF,KAAa,CAAjB,EAAoB;;OA7BT;;;UAkCP,CAACuB,OAAL,EAAc;YACNiJ,OAAO,GAAG3I,IAAI,CAAClB,IAAL,CAAUc,CAAV,CAAhB;;YAEI8B,IAAI,CAAC2J,GAAL,CAASb,IAAT,EAAe7B,OAAf,CAAJ,EAA6B;UAC3B/I,CAAC,GAAG+I,OAAJ;UACAhJ,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAJ;;;OAvCO;;;UA6CPF,OAAO,IAAIE,CAAC,CAACA,CAAC,CAACzB,MAAF,GAAW,CAAZ,CAAD,KAAoB,CAAnC,EAAsC;YAC9BwK,QAAO,GAAG3I,IAAI,CAACqE,QAAL,CAAczE,CAAd,CAAhB;;QACAA,CAAC,GAAG+I,QAAJ;QACAhJ,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAJ;;OAhDS;;;MAqDXA,CAAC,GAAGI,IAAI,CAACgF,MAAL,CAAYpF,CAAZ,CAAJ;MACAD,CAAC,GAAG+B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAe5K,CAAf,CAAJ;MACA2L,OAAO,CAAClE,GAAR,CAAY1H,CAAZ;;GA3ac;;;;;EAmblBqF,MAAM,CAACwF,IAAD,EAAa/K,IAAb;QACE8G,UAAU,GAAGvG,IAAI,CAACgF,MAAL,CAAYvF,IAAZ,CAAnB;QACMG,CAAC,GAAG8B,IAAI,CAACoC,GAAL,CAAS0G,IAAT,EAAejE,UAAf,CAAV;;QAEIzG,IAAI,CAACC,MAAL,CAAYH,CAAZ,CAAJ,EAAoB;YACZ,IAAImF,KAAJ,0CAC8BtF,IAD9B,8CAAN;;;WAKKG,CAAP;GA7bgB;;;;;;;;;EAwclB6H,MAAM,CAACjG,IAAD;QACA1B,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;aACdA,IAAI,CAAChE,IAAZ;KADF,MAEO;aACEgE,IAAI,CAACK,QAAL,CAAc6J,GAAd,CAAkBhK,IAAI,CAAC+F,MAAvB,EAA+BkE,IAA/B,CAAoC,EAApC,CAAP;;GA5cc;;;;;GAodjB3C,KAAD,CACEwB,IADF;QAEErL,8EAKI;;SAEC,IAAM,CAACqC,IAAD,EAAO/B,IAAP,CAAX,IAA2BiC,IAAI,CAAC0C,KAAL,CAAWoG,IAAX,EAAiBrL,OAAjB,CAA3B,EAAsD;UAChDW,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;cACf,CAACA,IAAD,EAAO/B,IAAP,CAAN;;;;;CA/dD;;;;;ICiGM4D,SAAS,GAAG;;;;EAKvBuI,eAAe,CAACxL,KAAD;WACNiD,SAAS,CAACwI,WAAV,CAAsBzL,KAAtB,KAAgCA,KAAK,CAACmI,IAAN,CAAWuD,QAAX,CAAoB,OAApB,CAAvC;GANqB;;;;;EAavBD,WAAW,CAACzL,KAAD;QACL,CAACuC,aAAa,CAACvC,KAAD,CAAlB,EAA2B;aAClB,KAAP;;;YAGMA,KAAK,CAACmI,IAAd;WACO,aAAL;eACSvI,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,KAA2BiC,IAAI,CAAC4J,MAAL,CAAYlL,KAAK,CAACoB,IAAlB,CAAlC;;WACG,aAAL;eAEI,OAAOpB,KAAK,CAAC3C,MAAb,KAAwB,QAAxB,IACA,OAAO2C,KAAK,CAAC5C,IAAb,KAAsB,QADtB,IAEAwC,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,CAHF;;WAKG,YAAL;eAEI,OAAOW,KAAK,CAACkJ,QAAb,KAA0B,QAA1B,KACC,OAAOlJ,KAAK,CAACU,MAAb,KAAwB,QAAxB,IAAoCV,KAAK,CAACU,MAAN,KAAiB,IADtD,KAEAd,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,CAFA,IAGAkD,aAAa,CAACvC,KAAK,CAACmJ,UAAP,CAJf;;WAMG,WAAL;eACSvJ,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,KAA2BO,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACuI,OAAlB,CAAlC;;WACG,aAAL;eACS3I,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,KAA2BiC,IAAI,CAAC4J,MAAL,CAAYlL,KAAK,CAACoB,IAAlB,CAAlC;;WACG,aAAL;eAEI,OAAOpB,KAAK,CAAC3C,MAAb,KAAwB,QAAxB,IACA,OAAO2C,KAAK,CAAC5C,IAAb,KAAsB,QADtB,IAEAwC,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,CAHF;;WAKG,UAAL;eAEIO,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,KACAkD,aAAa,CAACvC,KAAK,CAACmJ,UAAP,CADb,IAEA5G,aAAa,CAACvC,KAAK,CAAC6I,aAAP,CAHf;;WAKG,eAAL;eAEK7I,KAAK,CAACmJ,UAAN,KAAqB,IAArB,IAA6BrG,KAAK,CAACC,OAAN,CAAc/C,KAAK,CAAC6I,aAApB,CAA9B,IACC7I,KAAK,CAAC6I,aAAN,KAAwB,IAAxB,IAAgC/F,KAAK,CAACC,OAAN,CAAc/C,KAAK,CAACmJ,UAApB,CADjC,IAEC5G,aAAa,CAACvC,KAAK,CAACmJ,UAAP,CAAb,IACC5G,aAAa,CAACvC,KAAK,CAAC6I,aAAP,CAJjB;;WAMG,YAAL;eAEIjJ,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,KACA,OAAOW,KAAK,CAACkJ,QAAb,KAA0B,QAD1B,KAEC,OAAOlJ,KAAK,CAACU,MAAb,KAAwB,QAAxB,IAAoCV,KAAK,CAACU,MAAN,KAAiB,IAFtD,KAGA6B,aAAa,CAACvC,KAAK,CAACmJ,UAAP,CAJf;;;eAOO,KAAP;;GAjEiB;;;;;EAyEvBjG,eAAe,CAAClD,KAAD;WAEX4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,MACCA,KAAK,CAACjC,MAAN,KAAiB,CAAjB,IAAsBkF,SAAS,CAACwI,WAAV,CAAsBzL,KAAK,CAAC,CAAD,CAA3B,CADvB,CADF;GA1EqB;;;;;EAoFvB2L,oBAAoB,CAAC3L,KAAD;WACXiD,SAAS,CAACwI,WAAV,CAAsBzL,KAAtB,KAAgCA,KAAK,CAACmI,IAAN,CAAWuD,QAAX,CAAoB,YAApB,CAAvC;GArFqB;;;;;EA4FvBE,eAAe,CAAC5L,KAAD;WACNiD,SAAS,CAACwI,WAAV,CAAsBzL,KAAtB,KAAgCA,KAAK,CAACmI,IAAN,CAAWuD,QAAX,CAAoB,OAApB,CAAvC;GA7FqB;;;;;;EAqGvBG,OAAO,CAAC5D,EAAD;YACGA,EAAE,CAACE,IAAX;WACO,aAAL;;qCACcF,EAAZ;YAAgBE,IAAI,EAAE;;;;WAGnB,aAAL;;qCACcF,EAAZ;YAAgBE,IAAI,EAAE;;;;WAGnB,YAAL;;qCACcF,EAAZ;YAAgBE,IAAI,EAAE,YAAtB;YAAoC9I,IAAI,EAAEO,IAAI,CAACqE,QAAL,CAAcgE,EAAE,CAAC5I,IAAjB;;;;WAGvC,WAAL;;cACQ;YAAEkJ,OAAF;YAAWlJ;cAAS4I,EAA1B,CADgB;;cAIZrI,IAAI,CAACC,MAAL,CAAY0I,OAAZ,EAAqBlJ,IAArB,CAAJ,EAAgC;mBACvB4I,EAAP;WALc;;;;;cAWV6D,WAAW,GAAGlM,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,CAApB;cACM8D,cAAc,GAAGnM,IAAI,CAACoI,SAAL,CAAepI,IAAI,CAAClB,IAAL,CAAUW,IAAV,CAAf,EAAgC4I,EAAhC,CAAvB;qCACYA,EAAZ;YAAgB5I,IAAI,EAAEyM,WAAtB;YAAmCvD,OAAO,EAAEwD;;;;WAGzC,aAAL;;qCACc9D,EAAZ;YAAgBE,IAAI,EAAE;;;;WAGnB,aAAL;;qCACcF,EAAZ;YAAgBE,IAAI,EAAE;;;;WAGnB,UAAL;;cACQ;YAAEgB,UAAF;YAAcN;cAAkBZ,EAAtC;qCACYA,EAAZ;YAAgBkB,UAAU,EAAEN,aAA5B;YAA2CA,aAAa,EAAEM;;;;WAGvD,eAAL;;cACQ;YAAEA,UAAU,EAAVA,WAAF;YAAcN,aAAa,EAAbA;cAAkBZ,EAAtC;;cAEIkB,WAAU,IAAI,IAAlB,EAAwB;uCAEjBlB,EADL;cAEEkB,UAAU,EAAEN,cAFd;cAGEA,aAAa,EAAE;;WAJnB,MAMO,IAAIA,cAAa,IAAI,IAArB,EAA2B;uCAE3BZ,EADL;cAEEkB,UAAU,EAAE,IAFd;cAGEN,aAAa,EAAEM;;WAJZ,MAMA;uCACOlB,EAAZ;cAAgBkB,UAAU,EAAEN,cAA5B;cAA2CA,aAAa,EAAEM;;;;;WAIzD,YAAL;;qCACclB,EAAZ;YAAgBE,IAAI,EAAE,YAAtB;YAAoC9I,IAAI,EAAEO,IAAI,CAAClB,IAAL,CAAUuJ,EAAE,CAAC5I,IAAb;;;;;;CArK3C;;IChGMO,IAAI,GAAG;;;;;;;EAQlByK,SAAS,CAAChL,IAAD;QAAaN,8EAAiC;QAC/C;MAAEO,OAAO,GAAG;QAAUP,OAA5B;QACIiN,KAAK,GAAGpM,IAAI,CAACH,MAAL,CAAYJ,IAAZ,EAAkBN,OAAlB,CAAZ;;QAEIO,OAAJ,EAAa;MACX0M,KAAK,GAAGA,KAAK,CAAC3N,KAAN,CAAY,CAAZ,CAAR;KADF,MAEO;MACL2N,KAAK,GAAGA,KAAK,CAAC3N,KAAN,CAAY,CAAZ,EAAe,CAAC,CAAhB,CAAR;;;WAGK2N,KAAP;GAlBgB;;;;;EAyBlBzF,MAAM,CAAClH,IAAD,EAAaqL,OAAb;QACEnE,MAAM,GAAS,EAArB;;SAEK,IAAIvI,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGqB,IAAI,CAACtB,MAAT,IAAmBC,CAAC,GAAG0M,OAAO,CAAC3M,MAA/C,EAAuDC,CAAC,EAAxD,EAA4D;UACpDiO,EAAE,GAAG5M,IAAI,CAACrB,CAAD,CAAf;UACMkO,EAAE,GAAGxB,OAAO,CAAC1M,CAAD,CAAlB;;UAEIiO,EAAE,KAAKC,EAAX,EAAe;;;;MAIf3F,MAAM,CAACzC,IAAP,CAAYmI,EAAZ;;;WAGK1F,MAAP;GAvCgB;;;;;;;;;;EAmDlBjB,OAAO,CAACjG,IAAD,EAAaqL,OAAb;QACCyB,GAAG,GAAGC,IAAI,CAACD,GAAL,CAAS9M,IAAI,CAACtB,MAAd,EAAsB2M,OAAO,CAAC3M,MAA9B,CAAZ;;SAEK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGmO,GAApB,EAAyBnO,CAAC,EAA1B,EAA8B;UACxBqB,IAAI,CAACrB,CAAD,CAAJ,GAAU0M,OAAO,CAAC1M,CAAD,CAArB,EAA0B,OAAO,CAAC,CAAR;UACtBqB,IAAI,CAACrB,CAAD,CAAJ,GAAU0M,OAAO,CAAC1M,CAAD,CAArB,EAA0B,OAAO,CAAP;;;WAGrB,CAAP;GA3DgB;;;;;EAkElBqO,SAAS,CAAChN,IAAD,EAAaqL,OAAb;QACD1M,CAAC,GAAGqB,IAAI,CAACtB,MAAL,GAAc,CAAxB;QACMuO,EAAE,GAAGjN,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAcL,CAAd,CAAX;QACMuO,EAAE,GAAG7B,OAAO,CAACrM,KAAR,CAAc,CAAd,EAAiBL,CAAjB,CAAX;QACMiO,EAAE,GAAG5M,IAAI,CAACrB,CAAD,CAAf;QACMkO,EAAE,GAAGxB,OAAO,CAAC1M,CAAD,CAAlB;WACO4B,IAAI,CAACC,MAAL,CAAYyM,EAAZ,EAAgBC,EAAhB,KAAuBN,EAAE,GAAGC,EAAnC;GAxEgB;;;;;EA+ElBM,MAAM,CAACnN,IAAD,EAAaqL,OAAb;QACE1M,CAAC,GAAGqB,IAAI,CAACtB,MAAf;QACMuO,EAAE,GAAGjN,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAcL,CAAd,CAAX;QACMuO,EAAE,GAAG7B,OAAO,CAACrM,KAAR,CAAc,CAAd,EAAiBL,CAAjB,CAAX;WACO4B,IAAI,CAACC,MAAL,CAAYyM,EAAZ,EAAgBC,EAAhB,CAAP;GAnFgB;;;;;EA0FlBE,UAAU,CAACpN,IAAD,EAAaqL,OAAb;QACF1M,CAAC,GAAGqB,IAAI,CAACtB,MAAL,GAAc,CAAxB;QACMuO,EAAE,GAAGjN,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAcL,CAAd,CAAX;QACMuO,EAAE,GAAG7B,OAAO,CAACrM,KAAR,CAAc,CAAd,EAAiBL,CAAjB,CAAX;QACMiO,EAAE,GAAG5M,IAAI,CAACrB,CAAD,CAAf;QACMkO,EAAE,GAAGxB,OAAO,CAAC1M,CAAD,CAAlB;WACO4B,IAAI,CAACC,MAAL,CAAYyM,EAAZ,EAAgBC,EAAhB,KAAuBN,EAAE,GAAGC,EAAnC;GAhGgB;;;;;EAuGlBrM,MAAM,CAACR,IAAD,EAAaqL,OAAb;WAEFrL,IAAI,CAACtB,MAAL,KAAgB2M,OAAO,CAAC3M,MAAxB,IAAkCsB,IAAI,CAAC0C,KAAL,CAAW,CAACxC,CAAD,EAAIvB,CAAJ,KAAUuB,CAAC,KAAKmL,OAAO,CAAC1M,CAAD,CAAlC,CADpC;GAxGgB;;;;;EAiHlBoN,OAAO,CAAC/L,IAAD,EAAaqL,OAAb;WACE9K,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CAAvC;GAlHgB;;;;;EAyHlBpG,UAAU,CAACjF,IAAD,EAAaqL,OAAb;WACDrL,IAAI,CAACtB,MAAL,GAAc2M,OAAO,CAAC3M,MAAtB,IAAgC6B,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CAAvE;GA1HgB;;;;;EAiIlBf,QAAQ,CAACtK,IAAD,EAAaqL,OAAb;WACC9K,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CAAC,CAAxC;GAlIgB;;;;;EAyIlBgC,OAAO,CAACrN,IAAD,EAAaqL,OAAb;WAEHrL,IAAI,CAACtB,MAAL,KAAgB2M,OAAO,CAAC3M,MAAR,GAAiB,CAAjC,IAAsC6B,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CADxE;GA1IgB;;;;;EAmJlBiC,QAAQ,CAACtN,IAAD,EAAaqL,OAAb;WACCrL,IAAI,CAACtB,MAAL,IAAe2M,OAAO,CAAC3M,MAAvB,IAAiC6B,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CAAxE;GApJgB;;;;;EA2JlBkC,YAAY,CAACvN,IAAD,EAAaqL,OAAb;WACHrL,IAAI,CAACtB,MAAL,GAAc2M,OAAO,CAAC3M,MAAtB,IAAgC6B,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CAAvE;GA5JgB;;;;;EAmKlBmC,QAAQ,CAACxN,IAAD,EAAaqL,OAAb;WAEJrL,IAAI,CAACtB,MAAL,GAAc,CAAd,KAAoB2M,OAAO,CAAC3M,MAA5B,IAAsC6B,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBqL,OAAnB,MAAgC,CADxE;GApKgB;;;;;EA6KlBhG,MAAM,CAAC1E,KAAD;WAEF4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,MACCA,KAAK,CAACjC,MAAN,KAAiB,CAAjB,IAAsB,OAAOiC,KAAK,CAAC,CAAD,CAAZ,KAAoB,QAD3C,CADF;GA9KgB;;;;;EAwLlB8M,SAAS,CAACzN,IAAD,EAAaqL,OAAb;QACHrL,IAAI,CAACtB,MAAL,KAAgB2M,OAAO,CAAC3M,MAA5B,EAAoC;aAC3B,KAAP;;;QAGIuO,EAAE,GAAGjN,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAc,CAAC,CAAf,CAAX;QACMkO,EAAE,GAAG7B,OAAO,CAACrM,KAAR,CAAc,CAAd,EAAiB,CAAC,CAAlB,CAAX;QACM0O,EAAE,GAAG1N,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAf;QACMiP,EAAE,GAAGtC,OAAO,CAACA,OAAO,CAAC3M,MAAR,GAAiB,CAAlB,CAAlB;WACOgP,EAAE,KAAKC,EAAP,IAAapN,IAAI,CAACC,MAAL,CAAYyM,EAAZ,EAAgBC,EAAhB,CAApB;GAjMgB;;;;;;;;;EA4MlB9M,MAAM,CACJJ,IADI;QAEJN,8EAEI;QAEE;MAAEO,OAAO,GAAG;QAAUP,OAA5B;QACMkO,IAAI,GAAW,EAArB;;SAEK,IAAIjP,CAAC,GAAG,CAAb,EAAgBA,CAAC,IAAIqB,IAAI,CAACtB,MAA1B,EAAkCC,CAAC,EAAnC,EAAuC;MACrCiP,IAAI,CAACnJ,IAAL,CAAUzE,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAcL,CAAd,CAAV;;;QAGEsB,OAAJ,EAAa;MACX2N,IAAI,CAAC3N,OAAL;;;WAGK2N,IAAP;GA7NgB;;;;;EAoOlBvO,IAAI,CAACW,IAAD;QACEA,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;YACf,IAAI4G,KAAJ,oDACwCtF,IADxC,sCAAN;;;QAKIuE,IAAI,GAAGvE,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAjB;WACOsB,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAc,CAAC,CAAf,EAAkBoM,MAAlB,CAAyB7G,IAAI,GAAG,CAAhC,CAAP;GA5OgB;;;;;EAmPlBgB,MAAM,CAACvF,IAAD;QACAA,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;YACf,IAAI4G,KAAJ,wDAA0DtF,IAA1D,QAAN;;;WAGKA,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAc,CAAC,CAAf,CAAP;GAxPgB;;;;;EA+PlB4F,QAAQ,CAAC5E,IAAD;QACFA,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;YACf,IAAI4G,KAAJ,wDAC4CtF,IAD5C,0CAAN;;;QAKIuE,IAAI,GAAGvE,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAjB;;QAEI6F,IAAI,IAAI,CAAZ,EAAe;YACP,IAAIe,KAAJ,+DACmDtF,IADnD,oDAAN;;;WAKKA,IAAI,CAAChB,KAAL,CAAW,CAAX,EAAc,CAAC,CAAf,EAAkBoM,MAAlB,CAAyB7G,IAAI,GAAG,CAAhC,CAAP;GA9QgB;;;;;EAqRlBsJ,QAAQ,CAAC7N,IAAD,EAAa8K,QAAb;QACF,CAACvK,IAAI,CAAC0E,UAAL,CAAgB6F,QAAhB,EAA0B9K,IAA1B,CAAD,IAAoC,CAACO,IAAI,CAACC,MAAL,CAAYR,IAAZ,EAAkB8K,QAAlB,CAAzC,EAAsE;YAC9D,IAAIxF,KAAJ,4CACgCtF,IADhC,gCAC0D8K,QAD1D,sDAAN;;;WAKK9K,IAAI,CAAChB,KAAL,CAAW8L,QAAQ,CAACpM,MAApB,CAAP;GA5RgB;;;;;EAmSlBiK,SAAS,CACP3I,IADO,EAEP8N,SAFO;QAGPpO,8EAAwD;WAEjDgM,aAAO,CAAC1L,IAAD,EAAOG,CAAC;UACd;QAAEkH,QAAQ,GAAG;UAAc3H,OAAjC;;UAGIM,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;;;;cAIfoP,SAAS,CAAChF,IAAlB;aACO,aAAL;;gBACQ;cAAE9I,IAAI,EAAE4I;gBAAOkF,SAArB;;gBAGEvN,IAAI,CAACC,MAAL,CAAYoI,EAAZ,EAAgBzI,CAAhB,KACAI,IAAI,CAAC6M,UAAL,CAAgBxE,EAAhB,EAAoBzI,CAApB,CADA,IAEAI,IAAI,CAAC0E,UAAL,CAAgB2D,EAAhB,EAAoBzI,CAApB,CAHF,EAIE;cACAA,CAAC,CAACyI,EAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;;;;;;aAMC,aAAL;;gBACQ;cAAEsB,IAAI,EAAE4I;gBAAOkF,SAArB;;gBAEIvN,IAAI,CAACC,MAAL,CAAYoI,GAAZ,EAAgBzI,CAAhB,KAAsBI,IAAI,CAAC0E,UAAL,CAAgB2D,GAAhB,EAAoBzI,CAApB,CAA1B,EAAkD;qBACzC,IAAP;aADF,MAEO,IAAII,IAAI,CAAC6M,UAAL,CAAgBxE,GAAhB,EAAoBzI,CAApB,CAAJ,EAA4B;cACjCA,CAAC,CAACyI,GAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;;;;;;aAMC,YAAL;;gBACQ;cAAEsB,IAAI,EAAE4I,IAAR;cAAYiB;gBAAaiE,SAA/B;;gBAEIvN,IAAI,CAACC,MAAL,CAAYoI,IAAZ,EAAgBzI,CAAhB,KAAsBI,IAAI,CAAC6M,UAAL,CAAgBxE,IAAhB,EAAoBzI,CAApB,CAA1B,EAAkD;cAChDA,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;aADF,MAEO,IAAI6B,IAAI,CAAC0E,UAAL,CAAgB2D,IAAhB,EAAoBzI,CAApB,CAAJ,EAA4B;cACjCA,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;cACAyB,CAAC,CAACyI,IAAE,CAAClK,MAAJ,CAAD,IAAgBmL,QAAhB;;;;;;aAMC,YAAL;;gBACQ;cAAE7J,IAAI,EAAE4I,IAAR;cAAYiB,QAAQ,EAARA;gBAAaiE,SAA/B;;gBAEIvN,IAAI,CAACC,MAAL,CAAYoI,IAAZ,EAAgBzI,CAAhB,CAAJ,EAAwB;kBAClBkH,QAAQ,KAAK,SAAjB,EAA4B;gBAC1BlH,CAAC,CAACA,CAAC,CAACzB,MAAF,GAAW,CAAZ,CAAD,IAAmB,CAAnB;eADF,MAEO,IAAI2I,QAAQ,KAAK,UAAjB,EAA6B,CAA7B,MAEA;uBACE,IAAP;;aANJ,MAQO,IAAI9G,IAAI,CAAC6M,UAAL,CAAgBxE,IAAhB,EAAoBzI,CAApB,CAAJ,EAA4B;cACjCA,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;aADK,MAEA,IAAI6B,IAAI,CAAC0E,UAAL,CAAgB2D,IAAhB,EAAoBzI,CAApB,KAA0BH,IAAI,CAAC4I,IAAE,CAAClK,MAAJ,CAAJ,IAAmBmL,SAAjD,EAA2D;cAChE1J,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;cACAyB,CAAC,CAACyI,IAAE,CAAClK,MAAJ,CAAD,IAAgBmL,SAAhB;;;;;;aAMC,WAAL;;gBACQ;cAAE7J,IAAI,EAAE4I,IAAR;cAAYM,OAAO,EAAE6E;gBAAQD,SAAnC,CADgB;;gBAIZvN,IAAI,CAACC,MAAL,CAAYoI,IAAZ,EAAgBmF,GAAhB,CAAJ,EAA0B;;;;gBAItBxN,IAAI,CAAC0E,UAAL,CAAgB2D,IAAhB,EAAoBzI,CAApB,KAA0BI,IAAI,CAACC,MAAL,CAAYoI,IAAZ,EAAgBzI,CAAhB,CAA9B,EAAkD;kBAC1C6N,IAAI,GAAGD,GAAG,CAAC/O,KAAJ,EAAb;;kBAEIuB,IAAI,CAAC6M,UAAL,CAAgBxE,IAAhB,EAAoBmF,GAApB,KAA4BnF,IAAE,CAAClK,MAAH,GAAYqP,GAAG,CAACrP,MAAhD,EAAwD;oBAChDC,CAAC,GAAGoO,IAAI,CAACD,GAAL,CAASiB,GAAG,CAACrP,MAAb,EAAqBkK,IAAE,CAAClK,MAAxB,IAAkC,CAA5C;gBACAsP,IAAI,CAACrP,CAAD,CAAJ,IAAW,CAAX;;;qBAGKqP,IAAI,CAAC5C,MAAL,CAAYjL,CAAC,CAACnB,KAAF,CAAQ4J,IAAE,CAAClK,MAAX,CAAZ,CAAP;aARF,MASO,IACL6B,IAAI,CAAC6M,UAAL,CAAgBW,GAAhB,EAAqB5N,CAArB,KACAI,IAAI,CAACC,MAAL,CAAYuN,GAAZ,EAAiB5N,CAAjB,CADA,IAEAI,IAAI,CAAC0E,UAAL,CAAgB8I,GAAhB,EAAqB5N,CAArB,CAHK,EAIL;kBACII,IAAI,CAAC6M,UAAL,CAAgBxE,IAAhB,EAAoBzI,CAApB,CAAJ,EAA4B;gBAC1BA,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;;;cAGFyB,CAAC,CAAC4N,GAAG,CAACrP,MAAJ,GAAa,CAAd,CAAD,IAAqB,CAArB;aATK,MAUA,IAAI6B,IAAI,CAAC6M,UAAL,CAAgBxE,IAAhB,EAAoBzI,CAApB,CAAJ,EAA4B;kBAC7BI,IAAI,CAACC,MAAL,CAAYuN,GAAZ,EAAiB5N,CAAjB,CAAJ,EAAyB;gBACvBA,CAAC,CAAC4N,GAAG,CAACrP,MAAJ,GAAa,CAAd,CAAD,IAAqB,CAArB;;;cAGFyB,CAAC,CAACyI,IAAE,CAAClK,MAAH,GAAY,CAAb,CAAD,IAAoB,CAApB;;;;;;KArGM,CAAd;;;CAxSG;;ICGMuP,OAAO,GAAG;;;;EAKrBtF,SAAS,CAACrB,GAAD,EAAesB,EAAf;QACD;MAAErB,OAAF;MAAWF;QAAaC,GAA9B;;QAEIC,OAAO,IAAI,IAAf,EAAqB;;;;QAIfvH,IAAI,GAAGO,IAAI,CAACoI,SAAL,CAAepB,OAAf,EAAwBqB,EAAxB,EAA4B;MAAEvB;KAA9B,CAAb;IACAC,GAAG,CAACC,OAAJ,GAAcvH,IAAd;;QAEIA,IAAI,IAAI,IAAZ,EAAkB;MAChBsH,GAAG,CAACE,KAAJ;;;;CAhBC;;;;;ICGMxD,KAAK,GAAG;;;;;EAMnBiC,OAAO,CAACnF,KAAD,EAAeuK,OAAf;QACC/B,MAAM,GAAG/I,IAAI,CAAC0F,OAAL,CAAanF,KAAK,CAACd,IAAnB,EAAyBqL,OAAO,CAACrL,IAAjC,CAAf;;QAEIsJ,MAAM,KAAK,CAAf,EAAkB;UACZxI,KAAK,CAAC9C,MAAN,GAAeqN,OAAO,CAACrN,MAA3B,EAAmC,OAAO,CAAC,CAAR;UAC/B8C,KAAK,CAAC9C,MAAN,GAAeqN,OAAO,CAACrN,MAA3B,EAAmC,OAAO,CAAP;aAC5B,CAAP;;;WAGKsL,MAAP;GAfiB;;;;;EAsBnByC,OAAO,CAACjL,KAAD,EAAeuK,OAAf;WACErH,KAAK,CAACiC,OAAN,CAAcnF,KAAd,EAAqBuK,OAArB,MAAkC,CAAzC;GAvBiB;;;;;EA8BnBf,QAAQ,CAACxJ,KAAD,EAAeuK,OAAf;WACCrH,KAAK,CAACiC,OAAN,CAAcnF,KAAd,EAAqBuK,OAArB,MAAkC,CAAC,CAA1C;GA/BiB;;;;;EAsCnB7K,MAAM,CAACM,KAAD,EAAeuK,OAAf;;WAGFvK,KAAK,CAAC9C,MAAN,KAAiBqN,OAAO,CAACrN,MAAzB,IAAmCuC,IAAI,CAACC,MAAL,CAAYM,KAAK,CAACd,IAAlB,EAAwBqL,OAAO,CAACrL,IAAhC,CADrC;GAxCiB;;;;;EAiDnBmH,OAAO,CAACxG,KAAD;WAEHuC,aAAa,CAACvC,KAAD,CAAb,IACA,OAAOA,KAAK,CAAC3C,MAAb,KAAwB,QADxB,IAEAuC,IAAI,CAAC8E,MAAL,CAAY1E,KAAK,CAACX,IAAlB,CAHF;GAlDiB;;;;;EA6DnB2I,SAAS,CACP7H,KADO,EAEP8H,EAFO;QAGPlJ,8EAAwD;WAEjDgM,aAAO,CAAC5K,KAAD,EAAQX,CAAC;UACf;QAAEkH,QAAQ,GAAG;UAAc3H,OAAjC;UACM;QAAEM,IAAF;QAAQhC;UAAWmC,CAAzB;;cAEQyI,EAAE,CAACE,IAAX;aACO,aAAL;aACK,WAAL;;YACE3I,CAAC,CAACH,IAAF,GAASO,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,EAAyBlJ,OAAzB,CAAT;;;;aAIG,aAAL;;gBACMa,IAAI,CAACC,MAAL,CAAYoI,EAAE,CAAC5I,IAAf,EAAqBA,IAArB,KAA8B4I,EAAE,CAAC5K,MAAH,IAAaA,MAA/C,EAAuD;cACrDmC,CAAC,CAACnC,MAAF,IAAY4K,EAAE,CAAC7K,IAAH,CAAQW,MAApB;;;;;;aAMC,YAAL;;gBACM6B,IAAI,CAACC,MAAL,CAAYoI,EAAE,CAAC5I,IAAf,EAAqBA,IAArB,CAAJ,EAAgC;cAC9BG,CAAC,CAACnC,MAAF,IAAY4K,EAAE,CAACiB,QAAf;;;YAGF1J,CAAC,CAACH,IAAF,GAASO,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,EAAyBlJ,OAAzB,CAAT;;;;aAIG,aAAL;;gBACMa,IAAI,CAACC,MAAL,CAAYoI,EAAE,CAAC5I,IAAf,EAAqBA,IAArB,KAA8B4I,EAAE,CAAC5K,MAAH,IAAaA,MAA/C,EAAuD;cACrDmC,CAAC,CAACnC,MAAF,IAAY+O,IAAI,CAACD,GAAL,CAAS9O,MAAM,GAAG4K,EAAE,CAAC5K,MAArB,EAA6B4K,EAAE,CAAC7K,IAAH,CAAQW,MAArC,CAAZ;;;;;;aAMC,aAAL;;gBACM6B,IAAI,CAACC,MAAL,CAAYoI,EAAE,CAAC5I,IAAf,EAAqBA,IAArB,KAA8BO,IAAI,CAAC0E,UAAL,CAAgB2D,EAAE,CAAC5I,IAAnB,EAAyBA,IAAzB,CAAlC,EAAkE;qBACzD,IAAP;;;YAGFG,CAAC,CAACH,IAAF,GAASO,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,EAAyBlJ,OAAzB,CAAT;;;;aAIG,YAAL;;gBACMa,IAAI,CAACC,MAAL,CAAYoI,EAAE,CAAC5I,IAAf,EAAqBA,IAArB,CAAJ,EAAgC;kBAC1B4I,EAAE,CAACiB,QAAH,KAAgB7L,MAAhB,IAA0BqJ,QAAQ,IAAI,IAA1C,EAAgD;uBACvC,IAAP;eADF,MAEO,IACLuB,EAAE,CAACiB,QAAH,GAAc7L,MAAd,IACC4K,EAAE,CAACiB,QAAH,KAAgB7L,MAAhB,IAA0BqJ,QAAQ,KAAK,SAFnC,EAGL;gBACAlH,CAAC,CAACnC,MAAF,IAAY4K,EAAE,CAACiB,QAAf;gBAEA1J,CAAC,CAACH,IAAF,GAASO,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,sBACJlJ,OADI;kBAEP2H,QAAQ,EAAE;mBAFZ;;aATJ,MAcO;cACLlH,CAAC,CAACH,IAAF,GAASO,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,EAAyBlJ,OAAzB,CAAT;;;;;;KA7DM,CAAd;;;CAlEG;;ICHMwO,QAAQ,GAAG;;;;EAKtBvF,SAAS,CAACrB,GAAD,EAAgBsB,EAAhB;QACD;MAAErB,OAAF;MAAWF;QAAaC,GAA9B;;QAEIC,OAAO,IAAI,IAAf,EAAqB;;;;QAIfzG,KAAK,GAAGkD,KAAK,CAAC2E,SAAN,CAAgBpB,OAAhB,EAAyBqB,EAAzB,EAA6B;MAAEvB;KAA/B,CAAd;IACAC,GAAG,CAACC,OAAJ,GAAczG,KAAd;;QAEIA,KAAK,IAAI,IAAb,EAAmB;MACjBwG,GAAG,CAACE,KAAJ;;;;CAhBC;;;;;ICEM/D,KAAK,GAAG;;;;;EAMnB5B,KAAK,CACHX,KADG;QAEHxB,8EAEI;QAEE;MAAEO,OAAO,GAAG;QAAUP,OAA5B;QACM;MAAEmB,MAAF;MAAUG;QAAUE,KAA1B;WACOuC,KAAK,CAAC0K,UAAN,CAAiBjN,KAAjB,MAA4BjB,OAA5B,GACH,CAACY,MAAD,EAASG,KAAT,CADG,GAEH,CAACA,KAAD,EAAQH,MAAR,CAFJ;GAdiB;;;;;EAuBnBI,GAAG,CAACC,KAAD;QACK,GAAGD,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAhB;WACOD,GAAP;GAzBiB;;;;;EAgCnBT,MAAM,CAACU,KAAD,EAAemK,OAAf;WAEFrH,KAAK,CAACxD,MAAN,CAAaU,KAAK,CAACL,MAAnB,EAA2BwK,OAAO,CAACxK,MAAnC,KACAmD,KAAK,CAACxD,MAAN,CAAaU,KAAK,CAACF,KAAnB,EAA0BqK,OAAO,CAACrK,KAAlC,CAFF;GAjCiB;;;;;EA2CnBwE,QAAQ,CAACtE,KAAD,EAAeG,MAAf;QACFoC,KAAK,CAACC,OAAN,CAAcrC,MAAd,CAAJ,EAA2B;UAEvBoC,KAAK,CAAC+B,QAAN,CAAetE,KAAf,EAAsBG,MAAM,CAACR,MAA7B,KACA4C,KAAK,CAAC+B,QAAN,CAAetE,KAAf,EAAsBG,MAAM,CAACL,KAA7B,CAFF,EAGE;eACO,IAAP;;;UAGI,CAACoN,EAAD,EAAKC,EAAL,IAAW5K,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAjB;UACM,CAACoN,EAAD,EAAKC,EAAL,IAAW9K,KAAK,CAAC5B,KAAN,CAAYR,MAAZ,CAAjB;aACO2C,KAAK,CAACsG,QAAN,CAAe8D,EAAf,EAAmBE,EAAnB,KAA0BtK,KAAK,CAAC+H,OAAN,CAAcsC,EAAd,EAAkBE,EAAlB,CAAjC;;;QAGI,CAAC/M,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAArB;QACIsN,YAAY,GAAG,KAAnB;QACIC,WAAW,GAAG,KAAlB;;QAEIzK,KAAK,CAACmD,OAAN,CAAc9F,MAAd,CAAJ,EAA2B;MACzBmN,YAAY,GAAGxK,KAAK,CAACiC,OAAN,CAAc5E,MAAd,EAAsBG,KAAtB,KAAgC,CAA/C;MACAiN,WAAW,GAAGzK,KAAK,CAACiC,OAAN,CAAc5E,MAAd,EAAsBJ,GAAtB,KAA8B,CAA5C;KAFF,MAGO;MACLuN,YAAY,GAAGjO,IAAI,CAAC0F,OAAL,CAAa5E,MAAb,EAAqBG,KAAK,CAACxB,IAA3B,KAAoC,CAAnD;MACAyO,WAAW,GAAGlO,IAAI,CAAC0F,OAAL,CAAa5E,MAAb,EAAqBJ,GAAG,CAACjB,IAAzB,KAAkC,CAAhD;;;WAGKwO,YAAY,IAAIC,WAAvB;GArEiB;;;;;EA4EnBC,YAAY,CAACxN,KAAD,EAAemK,OAAf;QACgBpM,IAA1B,4BAAmCiC,KAAnC;;QACM,CAACyN,EAAD,EAAKC,EAAL,IAAWnL,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAjB;QACM,CAAC2N,EAAD,EAAKC,EAAL,IAAWrL,KAAK,CAAC5B,KAAN,CAAYwJ,OAAZ,CAAjB;QACM7J,KAAK,GAAGwC,KAAK,CAACsG,QAAN,CAAeqE,EAAf,EAAmBE,EAAnB,IAAyBA,EAAzB,GAA8BF,EAA5C;QACM1N,GAAG,GAAG+C,KAAK,CAACsG,QAAN,CAAesE,EAAf,EAAmBE,EAAnB,IAAyBF,EAAzB,GAA8BE,EAA1C;;QAEI9K,KAAK,CAACsG,QAAN,CAAerJ,GAAf,EAAoBO,KAApB,CAAJ,EAAgC;aACvB,IAAP;KADF,MAEO;;QACIX,MAAM,EAAEW,KAAjB;QAAwBR,KAAK,EAAEC;SAAQhC,IAAvC;;GAtFe;;;;;;EA+FnBkP,UAAU,CAACjN,KAAD;QACF;MAAEL,MAAF;MAAUG;QAAUE,KAA1B;WACO8C,KAAK,CAAC+H,OAAN,CAAclL,MAAd,EAAsBG,KAAtB,CAAP;GAjGiB;;;;;;EAyGnBmJ,WAAW,CAACjJ,KAAD;QACH;MAAEL,MAAF;MAAUG;QAAUE,KAA1B;WACO8C,KAAK,CAACxD,MAAN,CAAaK,MAAb,EAAqBG,KAArB,CAAP;GA3GiB;;;;;;;EAoHnB0D,UAAU,CAACxD,KAAD;WACD,CAACuC,KAAK,CAAC0G,WAAN,CAAkBjJ,KAAlB,CAAR;GArHiB;;;;;;;EA8HnB6N,SAAS,CAAC7N,KAAD;WACA,CAACuC,KAAK,CAAC0K,UAAN,CAAiBjN,KAAjB,CAAR;GA/HiB;;;;;EAsInBwC,OAAO,CAAC/C,KAAD;WAEHuC,aAAa,CAACvC,KAAD,CAAb,IACAqD,KAAK,CAACmD,OAAN,CAAcxG,KAAK,CAACE,MAApB,CADA,IAEAmD,KAAK,CAACmD,OAAN,CAAcxG,KAAK,CAACK,KAApB,CAHF;GAvIiB;;;;;GAkJlBiI,MAAD,CAAQ/H,KAAR;UACQ,CAACA,KAAK,CAACL,MAAP,EAAe,QAAf,CAAN;UACM,CAACK,KAAK,CAACF,KAAP,EAAc,OAAd,CAAN;GApJiB;;;;;EA2JnBQ,KAAK,CAACN,KAAD;QACG,CAACM,KAAD,IAAUiC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAhB;WACOM,KAAP;GA7JiB;;;;;EAoKnBmH,SAAS,CACPzH,KADO,EAEP0H,EAFO,EAGPlJ,OAHO;QAKD;MAAE2H,QAAQ,GAAG;QAAa3H,OAAhC;QACIsP,cAAJ;QACIC,aAAJ;;QAEI5H,QAAQ,KAAK,QAAjB,EAA2B;UACrB5D,KAAK,CAACsL,SAAN,CAAgB7N,KAAhB,CAAJ,EAA4B;QAC1B8N,cAAc,GAAG,SAAjB;QACAC,aAAa,GAAG,UAAhB;OAFF,MAGO;QACLD,cAAc,GAAG,UAAjB;QACAC,aAAa,GAAG,SAAhB;;KANJ,MAQO,IAAI5H,QAAQ,KAAK,SAAjB,EAA4B;UAC7B5D,KAAK,CAACsL,SAAN,CAAgB7N,KAAhB,CAAJ,EAA4B;QAC1B8N,cAAc,GAAG,UAAjB;QACAC,aAAa,GAAG,SAAhB;OAFF,MAGO;QACLD,cAAc,GAAG,SAAjB;QACAC,aAAa,GAAG,UAAhB;;KANG,MAQA;MACLD,cAAc,GAAG3H,QAAjB;MACA4H,aAAa,GAAG5H,QAAhB;;;WAGKqE,aAAO,CAACxK,KAAD,EAAQyK,CAAC;UACf9K,MAAM,GAAGmD,KAAK,CAAC2E,SAAN,CAAgBgD,CAAC,CAAC9K,MAAlB,EAA0B+H,EAA1B,EAA8B;QAAEvB,QAAQ,EAAE2H;OAA1C,CAAf;UACMhO,KAAK,GAAGgD,KAAK,CAAC2E,SAAN,CAAgBgD,CAAC,CAAC3K,KAAlB,EAAyB4H,EAAzB,EAA6B;QAAEvB,QAAQ,EAAE4H;OAAzC,CAAd;;UAEI,CAACpO,MAAD,IAAW,CAACG,KAAhB,EAAuB;eACd,IAAP;;;MAGF2K,CAAC,CAAC9K,MAAF,GAAWA,MAAX;MACA8K,CAAC,CAAC3K,KAAF,GAAUA,KAAV;KATY,CAAd;;;CAlMG;;ICFMkO,QAAQ,GAAG;;;;EAKtBvG,SAAS,CAACrB,GAAD,EAAgBsB,EAAhB;QACD;MAAErB,OAAF;MAAWF;QAAaC,GAA9B;;QAEIC,OAAO,IAAI,IAAf,EAAqB;;;;QAIfvH,IAAI,GAAGyD,KAAK,CAACkF,SAAN,CAAgBpB,OAAhB,EAAyBqB,EAAzB,EAA6B;MAAEvB;KAA/B,CAAb;IACAC,GAAG,CAACC,OAAJ,GAAcvH,IAAd;;QAEIA,IAAI,IAAI,IAAZ,EAAkB;MAChBsH,GAAG,CAACE,KAAJ;;;;CAhBC;;;;;ICAMnH,IAAI,GAAG;;;;EAKlBG,MAAM,CACJzC,IADI,EAEJsN,OAFI;QAGJ3L,8EAA+B;QAEzB;MAAEyP,KAAK,GAAG;QAAUzP,OAA1B;;SAEK,IAAMgB,GAAX,IAAkB3C,IAAlB,EAAwB;UAClBoR,KAAK,IAAIzO,GAAG,KAAK,MAArB,EAA6B;;;;UAIzB3C,IAAI,CAAC2C,GAAD,CAAJ,KAAc2K,OAAO,CAAC3K,GAAD,CAAzB,EAAgC;eACvB,KAAP;;;;SAIC,IAAMA,IAAX,IAAkB2K,OAAlB,EAA2B;UACrB8D,KAAK,IAAIzO,IAAG,KAAK,MAArB,EAA6B;;;;UAIzB3C,IAAI,CAAC2C,IAAD,CAAJ,KAAc2K,OAAO,CAAC3K,IAAD,CAAzB,EAAgC;eACvB,KAAP;;;;WAIG,IAAP;GAhCgB;;;;;EAuClBJ,MAAM,CAACK,KAAD;WACGuC,aAAa,CAACvC,KAAD,CAAb,IAAwB,OAAOA,KAAK,CAAC5C,IAAb,KAAsB,QAArD;GAxCgB;;;;;EA+ClBqR,UAAU,CAACzO,KAAD;WACD4F,KAAK,CAACmE,OAAN,CAAc/J,KAAd,MAAyBA,KAAK,CAACjC,MAAN,KAAiB,CAAjB,IAAsB2B,IAAI,CAACC,MAAL,CAAYK,KAAK,CAAC,CAAD,CAAjB,CAA/C,CAAP;GAhDgB;;;;;;;;EA0DlBmF,OAAO,CAAC/H,IAAD,EAAa4M,KAAb;SACA,IAAMjK,GAAX,IAAkBiK,KAAlB,EAAyB;UACnBjK,GAAG,KAAK,MAAZ,EAAoB;;;;UAIhB3C,IAAI,CAAC2C,GAAD,CAAJ,KAAciK,KAAK,CAACjK,GAAD,CAAvB,EAA8B;eACrB,KAAP;;;;WAIG,IAAP;GArEgB;;;;;EA4ElB2O,WAAW,CAACtN,IAAD,EAAasN,WAAb;QACLC,MAAM,GAAW,qBAAMvN,IAAN,EAArB;;SAEK,IAAMwN,GAAX,IAAkBF,WAAlB,EAA+B;UACHpQ,IAA1B,4BAAmCsQ,GAAnC;;UACM,CAAC/N,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAY0N,GAAZ,CAArB;UACMlQ,IAAI,GAAG,EAAb;UACImQ,CAAC,GAAG,CAAR;;WAEK,IAAMhL,IAAX,IAAmB8K,MAAnB,EAA2B;YACnB;UAAE5Q;YAAW8F,IAAI,CAACzG,IAAxB;YACMC,MAAM,GAAGwR,CAAf;QACAA,CAAC,IAAI9Q,MAAL,CAHyB;;YAMrB8C,KAAK,CAACxD,MAAN,IAAgBA,MAAhB,IAA0BiD,GAAG,CAACjD,MAAJ,IAAcA,MAAM,GAAGU,MAArD,EAA6D;UAC3DiL,MAAM,CAACC,MAAP,CAAcpF,IAAd,EAAoBvF,IAApB;UACAI,IAAI,CAACoF,IAAL,CAAUD,IAAV;;SARuB;;;YAcvBhD,KAAK,CAACxD,MAAN,GAAeA,MAAM,GAAGU,MAAxB,IACAuC,GAAG,CAACjD,MAAJ,GAAaA,MADb,IAECiD,GAAG,CAACjD,MAAJ,KAAeA,MAAf,IAAyBA,MAAM,KAAK,CAHvC,EAIE;UACAqB,IAAI,CAACoF,IAAL,CAAUD,IAAV;;SAlBuB;;;;;YAyBrBiL,MAAM,GAAGjL,IAAb;YACIjD,MAAM,SAAV;YACIX,KAAK,SAAT;;YAEIK,GAAG,CAACjD,MAAJ,GAAaA,MAAM,GAAGU,MAA1B,EAAkC;cAC1BgR,GAAG,GAAGzO,GAAG,CAACjD,MAAJ,GAAaA,MAAzB;UACA4C,KAAK,uBAAQ6O,MAAR;YAAgB1R,IAAI,EAAE0R,MAAM,CAAC1R,IAAP,CAAYiB,KAAZ,CAAkB0Q,GAAlB;YAA3B;UACAD,MAAM,uBAAQA,MAAR;YAAgB1R,IAAI,EAAE0R,MAAM,CAAC1R,IAAP,CAAYiB,KAAZ,CAAkB,CAAlB,EAAqB0Q,GAArB;YAA5B;;;YAGElO,KAAK,CAACxD,MAAN,GAAeA,MAAnB,EAA2B;cACnB0R,IAAG,GAAGlO,KAAK,CAACxD,MAAN,GAAeA,MAA3B;;UACAuD,MAAM,uBAAQkO,MAAR;YAAgB1R,IAAI,EAAE0R,MAAM,CAAC1R,IAAP,CAAYiB,KAAZ,CAAkB,CAAlB,EAAqB0Q,IAArB;YAA5B;UACAD,MAAM,uBAAQA,MAAR;YAAgB1R,IAAI,EAAE0R,MAAM,CAAC1R,IAAP,CAAYiB,KAAZ,CAAkB0Q,IAAlB;YAA5B;;;QAGF/F,MAAM,CAACC,MAAP,CAAc6F,MAAd,EAAsBxQ,IAAtB;;YAEIsC,MAAJ,EAAY;UACVlC,IAAI,CAACoF,IAAL,CAAUlD,MAAV;;;QAGFlC,IAAI,CAACoF,IAAL,CAAUgL,MAAV;;YAEI7O,KAAJ,EAAW;UACTvB,IAAI,CAACoF,IAAL,CAAU7D,KAAV;;;;MAIJ0O,MAAM,GAAGjQ,IAAT;;;WAGKiQ,MAAP;;;CA9IG;;;;;ACCA,IAAMK,iBAAiB,GAAG;;;;EAK/BhH,SAAS,CAAClJ,MAAD,EAAiBmJ,EAAjB;IACPnJ,MAAM,CAAC2C,QAAP,GAAkByG,iBAAW,CAACpJ,MAAM,CAAC2C,QAAR,CAA7B;QACItC,SAAS,GAAGL,MAAM,CAACK,SAAP,IAAoB+I,iBAAW,CAACpJ,MAAM,CAACK,SAAR,CAA/C;;YAEQ8I,EAAE,CAACE,IAAX;WACO,aAAL;;cACQ;YAAE9I,IAAF;YAAQ+B;cAAS6G,EAAvB;cACMrD,MAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,IAApB,CAAf;cACM+I,KAAK,GAAG/I,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;UACA6G,MAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,KAAvB,EAA8B,CAA9B,EAAiChH,IAAjC;;cAEIjC,SAAJ,EAAe;iBACR,IAAM,CAACgB,KAAD,EAAQJ,GAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,GAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,KAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,aAAL;;cACQ;YAAE5I,IAAI,EAAJA,KAAF;YAAQhC,MAAR;YAAgBD;cAAS6K,EAA/B;;cACM7G,KAAI,GAAGE,IAAI,CAACuC,IAAL,CAAU/E,MAAV,EAAkBO,KAAlB,CAAb;;cACMuB,MAAM,GAAGQ,KAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmBhB,MAAnB,CAAf;;cACM4C,KAAK,GAAGmB,KAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,MAAhB,CAAd;;UACA+D,KAAI,CAAChE,IAAL,GAAYwD,MAAM,GAAGxD,IAAT,GAAgB6C,KAA5B;;cAEId,SAAJ,EAAe;iBACR,IAAM,CAACgB,MAAD,EAAQJ,IAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,IAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,MAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,YAAL;;cACQ;YAAE5I,IAAI,EAAJA;cAAS4I,EAAjB;;cACM7G,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACM+E,QAAQ,GAAGxE,IAAI,CAACqE,QAAL,CAAc5E,MAAd,CAAjB;cACM/B,IAAI,GAAGgE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBsF,QAAjB,CAAb;;cACMQ,OAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,MAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;;cAEI2B,IAAI,CAACC,MAAL,CAAYyB,MAAZ,KAAqB1B,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAAzB,EAA4C;YAC1CA,IAAI,CAACF,IAAL,IAAagE,MAAI,CAAChE,IAAlB;WADF,MAEO,IAAI,CAACsC,IAAI,CAACC,MAAL,CAAYyB,MAAZ,CAAD,IAAsB,CAAC1B,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAA3B,EAA8C;YACnDA,IAAI,CAACmE,QAAL,CAAcqC,IAAd,CAAmB,GAAG1C,MAAI,CAACK,QAA3B;WADK,MAEA;kBACC,IAAIkD,KAAJ,4DAC8CtF,MAD9C,gDACwF+B,MADxF,cACgG9D,IADhG,EAAN;;;UAKFsH,OAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,MAAvB,EAA8B,CAA9B;;cAEIjJ,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,WAAL;;cACQ;YAAE5I,IAAI,EAAJA,MAAF;YAAQkJ;cAAYN,EAA1B;;cAEIrI,IAAI,CAAC0E,UAAL,CAAgBjF,MAAhB,EAAsBkJ,OAAtB,CAAJ,EAAoC;kBAC5B,IAAI5D,KAAJ,+BACmBtF,MADnB,4BACyCkJ,OADzC,iDAAN;;;cAKInH,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACMuF,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB,CAXgB;;;;;;;UAmBhB6G,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAvB,EAA8B,CAA9B;;cACMI,QAAQ,GAAG5I,IAAI,CAACoI,SAAL,CAAe3I,MAAf,EAAqB4I,EAArB,CAAjB;cACMQ,SAAS,GAAGnH,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBc,IAAI,CAACgF,MAAL,CAAY4D,QAAZ,CAAjB,CAAlB;cACME,QAAQ,GAAGF,QAAQ,CAACA,QAAQ,CAACzK,MAAT,GAAkB,CAAnB,CAAzB;UAEA0K,SAAS,CAAChH,QAAV,CAAmB4G,MAAnB,CAA0BK,QAA1B,EAAoC,CAApC,EAAuCtH,MAAvC;;cAEIjC,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,aAAL;;cACQ;YAAE5I,IAAI,EAAJA;cAAS4I,EAAjB;cACMG,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;;cACM6G,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;UACAuF,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAvB,EAA8B,CAA9B,EAJkB;;;;cAQdjJ,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;kBAC5CwJ,MAAM,GAAGtF,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAf;;kBAEI9I,SAAS,IAAI,IAAb,IAAqBwJ,MAAM,IAAI,IAAnC,EAAyC;gBACvCxJ,SAAS,CAACY,KAAD,CAAT,GAAiB4I,MAAjB;eADF,MAEO;oBACDrL,KAAiC,SAArC;;oBACIoB,IAAiC,SAArC;;qBAEK,IAAM,CAACa,CAAD,EAAIC,CAAJ,CAAX,IAAqB8B,IAAI,CAACsH,KAAL,CAAW9J,MAAX,CAArB,EAAyC;sBACnCc,IAAI,CAAC0F,OAAL,CAAa9F,CAAb,EAAgBH,MAAhB,MAA0B,CAAC,CAA/B,EAAkC;oBAChC/B,KAAI,GAAG,CAACiC,CAAD,EAAIC,CAAJ,CAAP;mBADF,MAEO;oBACLd,IAAI,GAAG,CAACa,CAAD,EAAIC,CAAJ,CAAP;;;;;oBAKAlC,KAAJ,EAAU;kBACR6C,OAAK,CAACd,IAAN,GAAa/B,KAAI,CAAC,CAAD,CAAjB;kBACA6C,OAAK,CAAC9C,MAAN,GAAeC,KAAI,CAAC,CAAD,CAAJ,CAAQF,IAAR,CAAaW,MAA5B;iBAFF,MAGO,IAAIW,IAAJ,EAAU;kBACfyB,OAAK,CAACd,IAAN,GAAaX,IAAI,CAAC,CAAD,CAAjB;kBACAyB,OAAK,CAAC9C,MAAN,GAAe,CAAf;iBAFK,MAGA;kBACL8B,SAAS,GAAG,IAAZ;;;;;;;;;WASL,aAAL;;cACQ;YAAEE,IAAI,EAAJA,MAAF;YAAQhC,MAAM,EAANA,OAAR;YAAgBD,IAAI,EAAJA;cAAS6K,EAA/B;;cACM7G,MAAI,GAAGE,IAAI,CAACuC,IAAL,CAAU/E,MAAV,EAAkBO,MAAlB,CAAb;;cACMuB,OAAM,GAAGQ,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmBhB,OAAnB,CAAf;;cACM4C,MAAK,GAAGmB,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,OAAM,GAAGD,KAAI,CAACW,MAA9B,CAAd;;UACAqD,MAAI,CAAChE,IAAL,GAAYwD,OAAM,GAAGX,MAArB;;cAEId,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;WAOD,UAAL;;cACQ;YAAE5I,IAAI,EAAJA,MAAF;YAAQwJ;cAAkBZ,EAAhC;;cAEI5I,MAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;kBACf,IAAI4G,KAAJ,2CAAN;;;cAGIvD,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;eAEK,IAAMU,KAAX,IAAkB8I,aAAlB,EAAiC;gBAC3B9I,KAAG,KAAK,UAAR,IAAsBA,KAAG,KAAK,MAAlC,EAA0C;oBAClC,IAAI4E,KAAJ,4BAA6B5E,KAA7B,2BAAN;;;gBAGIC,KAAK,GAAG6I,aAAa,CAAC9I,KAAD,CAA3B;;gBAEIC,KAAK,IAAI,IAAb,EAAmB;qBACVoB,MAAI,CAACrB,KAAD,CAAX;aADF,MAEO;cACLqB,MAAI,CAACrB,KAAD,CAAJ,GAAYC,KAAZ;;;;;;;WAOD,eAAL;;cACQ;YAAE6I,aAAa,EAAbA;cAAkBZ,EAA1B;;cAEIY,cAAa,IAAI,IAArB,EAA2B;YACzB1J,SAAS,GAAG0J,cAAZ;WADF,MAEO,IAAI1J,SAAS,IAAI,IAAjB,EAAuB;gBACxB,CAAC2D,KAAK,CAACC,OAAN,CAAc8F,cAAd,CAAL,EAAmC;oBAC3B,IAAIlE,KAAJ,6EAC+DmE,IAAI,CAACC,SAAL,CACjEF,cADiE,CAD/D,0CAAN;;;YAOF1J,SAAS,GAAG0J,cAAZ;WATK,MAUA;YACLG,MAAM,CAACC,MAAP,CAAc9J,SAAd,EAAyB0J,cAAzB;;;;;;WAMC,YAAL;;cACQ;YAAExJ,IAAI,EAAJA,MAAF;YAAQ6J,QAAR;YAAkBC;cAAelB,EAAvC;;cAEI5I,MAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;kBACf,IAAI4G,KAAJ,4DAC8CtF,MAD9C,8CAAN;;;cAKI+B,MAAI,GAAGE,IAAI,CAACoC,GAAL,CAAS5E,MAAT,EAAiBO,MAAjB,CAAb;;cACMuF,QAAM,GAAGtD,IAAI,CAACsD,MAAL,CAAY9F,MAAZ,EAAoBO,MAApB,CAAf;;cACM+I,OAAK,GAAG/I,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;cACIqL,OAAJ;;cAEI1J,IAAI,CAACC,MAAL,CAAYyB,MAAZ,CAAJ,EAAuB;gBACfR,QAAM,GAAGQ,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB,CAAhB,EAAmB6K,QAAnB,CAAf;;gBACMjJ,OAAK,GAAGmB,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgB6K,QAAhB,CAAd;;YACA9H,MAAI,CAAChE,IAAL,GAAYwD,QAAZ;YACAwI,OAAO,uBACFhI,MADE,MAED+H,UAFC;cAGL/L,IAAI,EAAE6C;cAHR;WAJF,MASO;gBACCW,QAAM,GAAGQ,MAAI,CAACK,QAAL,CAAcpD,KAAd,CAAoB,CAApB,EAAuB6K,QAAvB,CAAf;;gBACMjJ,OAAK,GAAGmB,MAAI,CAACK,QAAL,CAAcpD,KAAd,CAAoB6K,QAApB,CAAd;;YACA9H,MAAI,CAACK,QAAL,GAAgBb,QAAhB;YAEAwI,OAAO,uBACFhI,MADE,MAED+H,UAFC;cAGL1H,QAAQ,EAAExB;cAHZ;;;UAOF2E,QAAM,CAACnD,QAAP,CAAgB4G,MAAhB,CAAuBD,OAAK,GAAG,CAA/B,EAAkC,CAAlC,EAAqCgB,OAArC;;cAEIjK,SAAJ,EAAe;iBACR,IAAM,CAACgB,OAAD,EAAQJ,KAAR,CAAX,IAA2B+C,KAAK,CAACwF,MAAN,CAAanJ,SAAb,CAA3B,EAAoD;cAClDA,SAAS,CAACY,KAAD,CAAT,GAAiBsD,KAAK,CAAC2E,SAAN,CAAgB7H,OAAhB,EAAuB8H,EAAvB,CAAjB;;;;;;;;IAQRnJ,MAAM,CAAC2C,QAAP,GAAkB4H,iBAAW,CAACvK,MAAM,CAAC2C,QAAR,CAA7B;;QAEItC,SAAJ,EAAe;MACbL,MAAM,CAACK,SAAP,GAAmBmK,aAAO,CAACnK,SAAD,CAAP,GACdkK,iBAAW,CAAClK,SAAD,CADG,GAEfA,SAFJ;KADF,MAIO;MACLL,MAAM,CAACK,SAAP,GAAmB,IAAnB;;;;CA1QC;;;;;ACHA,IAAM8P,cAAc,GAAG;;;;EAK5BC,WAAW,CACTpQ,MADS,EAETkF,KAFS;QAGTjF,8EAOI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEqQ,OAAO,GAAG,KAAZ;QAAmBnQ,KAAK,GAAG,KAA3B;QAAkCC,IAAI,GAAG;UAAaF,OAA5D;UACI;QAAEG,EAAF;QAAME,KAAN;QAAagQ;UAAWrQ,OAA5B;;UAEIuC,IAAI,CAAC4J,MAAL,CAAYlH,KAAZ,CAAJ,EAAwB;QACtBA,KAAK,GAAG,CAACA,KAAD,CAAR;;;UAGEA,KAAK,CAACjG,MAAN,KAAiB,CAArB,EAAwB;;;;UAIlB,CAACqD,IAAD,IAAS4C,KAAf;;;;UAKI,CAAC9E,EAAL,EAAS;YACHJ,MAAM,CAACK,SAAX,EAAsB;UACpBD,EAAE,GAAGJ,MAAM,CAACK,SAAZ;SADF,MAEO,IAAIL,MAAM,CAAC2C,QAAP,CAAgB1D,MAAhB,GAAyB,CAA7B,EAAgC;UACrCmB,EAAE,GAAGN,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmB,EAAnB,CAAL;SADK,MAEA;UACLI,EAAE,GAAG,CAAC,CAAD,CAAL;;;QAGFkQ,MAAM,GAAG,IAAT;;;UAGEA,MAAM,IAAI,IAAd,EAAoB;QAClBA,MAAM,GAAG,KAAT;;;UAGEtM,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;YACjB,CAACiQ,OAAL,EAAc;UACZjQ,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,CAAL;;;YAGE4D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAJ,EAA2B;UACzBA,EAAE,GAAGA,EAAE,CAACgB,MAAR;SADF,MAEO;cACC,GAAGI,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAAhB;cACMiI,QAAQ,GAAGvI,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAjB;UACA+O,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;YAAEI;WAA5B;UACAA,EAAE,GAAGiI,QAAQ,CAACN,KAAT,EAAL;;;;UAIAxD,KAAK,CAACmD,OAAN,CAActH,EAAd,CAAJ,EAAuB;YACjBE,KAAK,IAAI,IAAb,EAAmB;cACbM,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;YACrBhC,KAAK,GAAGG,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,CAAb;WADF,MAEO,IAAIT,MAAM,CAAC+C,QAAP,CAAgBT,IAAhB,CAAJ,EAA2B;YAChChC,KAAK,GAAGG,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CAA/B;WADK,MAEA;YACLH,KAAK,GAAGG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAAb;;;;YAIE,CAAC2G,KAAD,IAAUtH,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;UACnCI,EAAE,EAAEA,EAAE,CAACG,IAD4B;UAEnCD,KAFmC;UAGnCH,IAHmC;UAInCD;SAJc,CAAhB;;YAOIkH,KAAJ,EAAW;cACH,GAAGoJ,UAAH,IAAgBpJ,KAAtB;cACMO,OAAO,GAAG7H,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBwQ,UAAvB,CAAhB;cACMC,OAAO,GAAG3Q,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBI,EAArB,EAAyBoQ,UAAzB,CAAhB;UACAD,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;YAAEI,EAAF;YAAME,KAAN;YAAaH,IAAb;YAAmBD;WAAjD;cACMK,IAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;UACA3H,EAAE,GAAGqQ,OAAO,GAAG3P,IAAI,CAAClB,IAAL,CAAUW,IAAV,CAAH,GAAqBA,IAAjC;SANF,MAOO;;;;;UAKH8G,UAAU,GAAGvG,IAAI,CAACgF,MAAL,CAAY1F,EAAZ,CAAnB;UACIkJ,KAAK,GAAGlJ,EAAE,CAACA,EAAE,CAACnB,MAAH,GAAY,CAAb,CAAd;;UAEI,CAACiB,KAAD,IAAUJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI,EAAE,EAAEiH;OAA1B,CAAd,EAAuD;;;;WAIlD,IAAM/E,KAAX,IAAmB4C,KAAnB,EAA0B;YAClB3E,KAAI,GAAG8G,UAAU,CAACsE,MAAX,CAAkBrC,KAAlB,CAAb;;QACAA,KAAK;QACLtJ,MAAM,CAAC0D,KAAP,CAAa;UAAE2F,IAAI,EAAE,aAAR;UAAuB9I,IAAI,EAAJA,KAAvB;UAA6B+B,IAAI,EAAJA;SAA1C;;;UAGEgO,MAAJ,EAAY;YACJjP,KAAK,GAAGvB,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmBI,EAAnB,CAAd;;YAEIiB,KAAJ,EAAW;UACTkP,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BqB,KAA1B;;;KA/FN;GAjB0B;;;;;;EA2H5BsP,SAAS,CACP3Q,MADO;QAEPC,8EAKI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEI,EAAE,GAAGJ,MAAM,CAACK,SAAd;QAAyBF,IAAI,GAAG,QAAhC;QAA0CD,KAAK,GAAG;UAAUD,OAAlE;UACI;QAAEK;UAAUL,OAAhB;;UAEIK,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,IACJoQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CADL,GAEJK,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAFT;;;UAKE,CAACL,EAAL,EAAS;;;;UAIHiG,OAAO,GAAGvG,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaH,IAAb;QAAmBD;OAAxC,CAAhB;UACM8H,QAAQ,GAAGlB,KAAK,CAACrB,IAAN,CAAWY,OAAX,EAAoB;YAAC,GAAG3F,CAAH,CAAD;eAAWZ,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBU,CAAvB,CAAX;OAApB,CAAjB;;WAEK,IAAMiH,OAAX,IAAsBK,QAAtB,EAAgC;YACxBzH,IAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;;YAEIxH,IAAI,CAACtB,MAAL,GAAc,CAAlB,EAAqB;gBACb,IAAI4G,KAAJ,uCAC2BtF,IAD3B,gDAAN;;;YAKI,CAACuF,MAAD,EAASuB,UAAT,IAAuBvH,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBc,IAAI,CAACgF,MAAL,CAAYvF,IAAZ,CAApB,CAA7B;YACM+I,KAAK,GAAG/I,IAAI,CAACA,IAAI,CAACtB,MAAL,GAAc,CAAf,CAAlB;YACM;UAAEA;YAAW6G,MAAM,CAACnD,QAA1B;;YAEI1D,MAAM,KAAK,CAAf,EAAkB;cACV2R,MAAM,GAAG9P,IAAI,CAAClB,IAAL,CAAUyH,UAAV,CAAf;UACAkJ,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;YAAEI,EAAE,EAAEG,IAAN;YAAYmF,EAAE,EAAEkL,MAAhB;YAAwB1Q;WAArD;UACAqQ,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;YAAEI,EAAE,EAAEiH,UAAN;YAAkBnH;WAAjD;SAHF,MAIO,IAAIoJ,KAAK,KAAK,CAAd,EAAiB;UACtBiH,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;YAAEI,EAAE,EAAEG,IAAN;YAAYmF,EAAE,EAAE2B,UAAhB;YAA4BnH;WAAzD;SADK,MAEA,IAAIoJ,KAAK,KAAKrK,MAAM,GAAG,CAAvB,EAA0B;cACzB2R,OAAM,GAAG9P,IAAI,CAAClB,IAAL,CAAUyH,UAAV,CAAf;;UACAkJ,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;YAAEI,EAAE,EAAEG,IAAN;YAAYmF,EAAE,EAAEkL,OAAhB;YAAwB1Q;WAArD;SAFK,MAGA;cACC6Q,SAAS,GAAGjQ,IAAI,CAAClB,IAAL,CAAUW,IAAV,CAAlB;;cACMqQ,QAAM,GAAG9P,IAAI,CAAClB,IAAL,CAAUyH,UAAV,CAAf;;UACAkJ,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;YAAEI,EAAE,EAAE2Q,SAAN;YAAiB7Q;WAA/C;UACAqQ,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;YAAEI,EAAE,EAAEG,IAAN;YAAYmF,EAAE,EAAEkL,QAAhB;YAAwB1Q;WAArD;;;KA3CN;GApI0B;;;;;;EA0L5B8Q,UAAU,CACRhR,MADQ;QAERC,8EAMI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC5B;QAAEM,KAAF;QAASF,EAAE,GAAGJ,MAAM,CAACK;UAAcJ,OAAvC;UACM;QAAEoQ,OAAO,GAAG,KAAZ;QAAmBnQ,KAAK,GAAG,KAA3B;QAAkCC,IAAI,GAAG;UAAaF,OAA5D;;UAEI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;YACbQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;cACb,CAAC0F,MAAD,IAAWhG,MAAM,CAACgG,MAAP,CAAc9F,MAAd,EAAsBI,EAAtB,CAAjB;;UACAE,KAAK,GAAGG,CAAC,IAAIqF,MAAM,CAACnD,QAAP,CAAgBoD,QAAhB,CAAyBtF,CAAzB,CAAb;SAFF,MAGO;UACLH,KAAK,GAAGG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAAb;;;;UAIA,CAAC4P,OAAD,IAAYrM,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAhB,EAAmC;QACjCA,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,CAAL;;;UAGE4D,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;YACjB4D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAJ,EAA2B;UACzBA,EAAE,GAAGA,EAAE,CAACgB,MAAR;SADF,MAEO;cACC,GAAGI,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAAhB;cACMiI,QAAQ,GAAGvI,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAjB;UACA+O,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;YAAEI;WAA5B;UACAA,EAAE,GAAGiI,QAAQ,CAACN,KAAT,EAAL;;cAEI9H,OAAO,CAACG,EAAR,IAAc,IAAlB,EAAwB;YACtBmQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BI,EAA1B;;;;;UAKA,CAAC0H,OAAD,IAAYhI,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaJ,KAAb;QAAoBC;OAAzC,CAAlB;UACM3B,IAAI,GAAGsB,MAAM,CAACqF,QAAP,CAAgBnF,MAAhB,EAAwB;QAAEI,EAAF;QAAME,KAAN;QAAaJ,KAAb;QAAoBC;OAA5C,CAAb;;UAEI,CAAC2H,OAAD,IAAY,CAACtJ,IAAjB,EAAuB;;;;UAIjB,CAAC8D,IAAD,EAAO/B,IAAP,IAAeuH,OAArB;UACM,CAACzC,QAAD,EAAWC,QAAX,IAAuB9G,IAA7B;;UAEI+B,IAAI,CAACtB,MAAL,KAAgB,CAAhB,IAAqBqG,QAAQ,CAACrG,MAAT,KAAoB,CAA7C,EAAgD;;;;UAI1CwK,OAAO,GAAG3I,IAAI,CAAClB,IAAL,CAAU0F,QAAV,CAAhB;UACM2L,UAAU,GAAGnQ,IAAI,CAAC2G,MAAL,CAAYlH,IAAZ,EAAkB+E,QAAlB,CAAnB;UACM4L,iBAAiB,GAAGpQ,IAAI,CAACkN,SAAL,CAAezN,IAAf,EAAqB+E,QAArB,CAA1B;UACM3E,MAAM,GAAGmG,KAAK,CAACrB,IAAN,CAAW3F,MAAM,CAACa,MAAP,CAAcX,MAAd,EAAsB;QAAEI,EAAE,EAAEG;OAA5B,CAAX,EAAgD;YAAC,CAACE,CAAD,CAAD;eAASA,CAAT;OAAhD,EACZlB,KADY,CACN0R,UAAU,CAAChS,MADL,EAEZM,KAFY,CAEN,CAFM,EAEH,CAAC,CAFE,CAAf;;;UAMM4R,aAAa,GAAGrR,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QACzCI,EAAE,EAAEG,IADqC;QAEzCJ,IAAI,EAAE,SAFmC;QAGzCG,KAAK,EAAEG,CAAC,IACNE,MAAM,CAACoF,QAAP,CAAgBtF,CAAhB,KAAsB6C,OAAO,CAACC,SAAR,CAAkB9C,CAAlB,CAAtB,IAA8CA,CAAC,CAACkC,QAAF,CAAW1D,MAAX,KAAsB;OAJlD,CAAtB;UAOMmS,QAAQ,GAAGD,aAAa,IAAIrR,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBmR,aAAa,CAAC,CAAD,CAApC,CAAlC;UACI9G,UAAJ;UACID,QAAJ;;;UAIIxJ,IAAI,CAACC,MAAL,CAAYyB,IAAZ,KAAqB1B,IAAI,CAACC,MAAL,CAAYwE,QAAZ,CAAzB,EAAgD;YAC7B7F,IAAjB,4BAA0B8C,IAA1B;;QACA8H,QAAQ,GAAG/E,QAAQ,CAAC/G,IAAT,CAAcW,MAAzB;QACAoL,UAAU,GAAG7K,IAAb;OAHF,MAIO,IAAI8D,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,KAA2BgB,OAAO,CAACC,SAAR,CAAkB8B,QAAlB,CAA/B,EAA4D;YAC5C7F,IAArB,4BAA8B8C,IAA9B;;QACA8H,QAAQ,GAAG/E,QAAQ,CAAC1C,QAAT,CAAkB1D,MAA7B;QACAoL,UAAU,GAAG7K,IAAb;OAHK,MAIA;cACC,IAAIqG,KAAJ,0CAC8BtF,IAD9B,0EACkGyJ,IAAI,CAACC,SAAL,CACpG3H,IADoG,CADlG,cAGC0H,IAAI,CAACC,SAAL,CAAe5E,QAAf,CAHD,EAAN;;;;;UASE,CAAC6L,iBAAL,EAAwB;QACtBX,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;UAAEI,EAAE,EAAEG,IAAN;UAAYmF,EAAE,EAAE+D,OAAhB;UAAyBvJ;SAAtD;;;;;UAKEkR,QAAJ,EAAc;QACZb,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;UAAEI,EAAE,EAAEgR,QAAQ,CAACtJ,OAAf;UAAyB5H;SAAxD;;;;;;;UAQCoD,OAAO,CAACC,SAAR,CAAkB8B,QAAlB,KAA+BvF,MAAM,CAAC4E,OAAP,CAAe1E,MAAf,EAAuBqF,QAAvB,CAAhC,IACCzE,IAAI,CAACC,MAAL,CAAYwE,QAAZ,KAAyBA,QAAQ,CAAC/G,IAAT,KAAkB,EAF9C,EAGE;QACAiS,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;UAAEI,EAAE,EAAEkF,QAAN;UAAgBpF;SAA/C;OAJF,MAKO;QACLF,MAAM,CAAC0D,KAAP,CAAa;UACX2F,IAAI,EAAE,YADK;UAEX9I,IAAI,EAAEkJ,OAFK;UAGXW,QAHW;UAIXxI,MAAM,EAAE,IAJG;UAKXyI;SALF;;;UASE+G,QAAJ,EAAc;QACZA,QAAQ,CAACrJ,KAAT;;KAxHJ;GApM0B;;;;;EAqU5B8I,SAAS,CACP7Q,MADO,EAEPC,OAFO;IAUPH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QACJ0F,EADI;QAEJtF,EAAE,GAAGJ,MAAM,CAACK,SAFR;QAGJF,IAAI,GAAG,QAHH;QAIJD,KAAK,GAAG;UACND,OALJ;UAMI;QAAEK;UAAUL,OAAhB;;UAEI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,IACJoQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CADL,GAEJK,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAFT;;;UAKI4Q,KAAK,GAAGvR,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuB0F,EAAvB,CAAd;UACM4L,OAAO,GAAGxR,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaH,IAAb;QAAmBD;OAAxC,CAAhB;UACM8H,QAAQ,GAAGlB,KAAK,CAACrB,IAAN,CAAW6L,OAAX,EAAoB;YAAC,GAAG5Q,CAAH,CAAD;eAAWZ,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBU,CAAvB,CAAX;OAApB,CAAjB;;WAEK,IAAMiH,OAAX,IAAsBK,QAAtB,EAAgC;YACxBzH,IAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;YACM0B,OAAO,GAAG4H,KAAK,CAACvJ,OAAtB;;YAEIvH,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;UACrBe,MAAM,CAAC0D,KAAP,CAAa;YAAE2F,IAAI,EAAE,WAAR;YAAqB9I,IAArB;YAA2BkJ;WAAxC;;;;MAIJ4H,KAAK,CAACtJ,KAAN;KAhCF;GA/U0B;;;;;EAuX5B+I,WAAW,CACT9Q,MADS;QAETC,8EAMI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEqQ,OAAO,GAAG,KAAZ;QAAmBnQ,KAAK,GAAG,KAA3B;QAAkCC,IAAI,GAAG;UAAaF,OAA5D;UACI;QAAEG,EAAE,GAAGJ,MAAM,CAACK,SAAd;QAAyBC;UAAUL,OAAvC;;UAEI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,IACJoQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CADL,GAEJK,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAFT;;;UAKE,CAAC4P,OAAD,IAAYrM,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAhB,EAAmC;QACjCA,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,CAAL;;;UAGImR,MAAM,GAAGzR,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaH,IAAb;QAAmBD;OAAxC,CAAf;UACM8H,QAAQ,GAAGlB,KAAK,CAACrB,IAAN,CAAW8L,MAAX,EAAmB;YAAC,GAAG7Q,CAAH,CAAD;eAAWZ,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBU,CAAvB,CAAX;OAAnB,CAAjB;;WAEK,IAAMiH,OAAX,IAAsBK,QAAtB,EAAgC;YACxBzH,IAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;;YAEIxH,IAAJ,EAAU;cACF,CAAC+B,IAAD,IAASxC,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAf;UACAP,MAAM,CAAC0D,KAAP,CAAa;YAAE2F,IAAI,EAAE,aAAR;YAAuB9I,IAAvB;YAA6B+B;WAA1C;;;KA1BN;GAjY0B;;;;;EAqa5BkP,QAAQ,CACNxR,MADM,EAENkL,KAFM;QAGNjL,8EAOI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC5B;QAAEM,KAAF;QAASF,EAAE,GAAGJ,MAAM,CAACK;UAAcJ,OAAvC;UACM;QACJoQ,OAAO,GAAG,KADN;QAEJlQ,IAAI,GAAG,QAFH;QAGJsR,KAAK,GAAG,KAHJ;QAIJvR,KAAK,GAAG;UACND,OALJ;;UAOI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,IACJoQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CADL,GAEJK,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAFT;;;UAKE,CAAC4P,OAAD,IAAYrM,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAhB,EAAmC;QACjCA,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,CAAL;;;UAGEqR,KAAK,IAAIzN,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAb,EAAgC;YACxB2I,QAAQ,GAAGjJ,MAAM,CAACiJ,QAAP,CAAgB/I,MAAhB,EAAwBI,EAAxB,EAA4B;UAAEwH,QAAQ,EAAE;SAAxC,CAAjB;YACM,CAAC7F,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAArB;YACMsR,SAAS,GAAGvR,IAAI,KAAK,QAAT,GAAoB,QAApB,GAA+B,SAAjD;QACAoQ,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;UAC5BI,EAAE,EAAEoB,GADwB;UAE5BlB,KAF4B;UAG5BH,IAAI,EAAEuR,SAHsB;UAI5BxR;SAJF;QAMAqQ,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;UAC5BI,EAAE,EAAE2B,KADwB;UAE5BzB,KAF4B;UAG5BH,IAAI,EAAEuR,SAHsB;UAI5BxR;SAJF;QAMAE,EAAE,GAAG2I,QAAQ,CAAChB,KAAT,EAAL;;YAEI9H,OAAO,CAACG,EAAR,IAAc,IAAlB,EAAwB;UACtBmQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BI,EAA1B;;;;WAIC,IAAM,CAACkC,IAAD,EAAO/B,IAAP,CAAX,IAA2BT,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAC9CI,EAD8C;QAE9CE,KAF8C;QAG9CH,IAH8C;QAI9CD;OAJyB,CAA3B,EAKI;YACImK,UAAU,GAAkB,EAAlC;YACMN,aAAa,GAAkB,EAArC,CAFE;;YAKExJ,IAAI,CAACtB,MAAL,KAAgB,CAApB,EAAuB;;;;aAIlB,IAAM0S,CAAX,IAAgBzG,KAAhB,EAAuB;cACjByG,CAAC,KAAK,UAAN,IAAoBA,CAAC,KAAK,MAA9B,EAAsC;;;;cAIlCzG,KAAK,CAACyG,CAAD,CAAL,KAAarP,IAAI,CAACqP,CAAD,CAArB,EAA0B;YACxBtH,UAAU,CAACsH,CAAD,CAAV,GAAgBrP,IAAI,CAACqP,CAAD,CAApB;YACA5H,aAAa,CAAC4H,CAAD,CAAb,GAAmBzG,KAAK,CAACyG,CAAD,CAAxB;;;;YAIAzH,MAAM,CAAC0H,IAAP,CAAY7H,aAAZ,EAA2B9K,MAA3B,KAAsC,CAA1C,EAA6C;UAC3Ce,MAAM,CAAC0D,KAAP,CAAa;YACX2F,IAAI,EAAE,UADK;YAEX9I,IAFW;YAGX8J,UAHW;YAIXN;WAJF;;;KAxEN;GAjb0B;;;;;EAwgB5B2G,UAAU,CACR1Q,MADQ;QAERC,8EAOI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEG,IAAI,GAAG,QAAT;QAAmBD,KAAK,GAAG;UAAUD,OAA3C;UACI;QAAEK,KAAF;QAASF,EAAE,GAAGJ,MAAM,CAACK,SAArB;QAAgCwR,MAAM,GAAG,CAAzC;QAA4CC,MAAM,GAAG;UAAU7R,OAAnE;;UAEIK,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAAb;;;UAGEuD,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;QACrBA,EAAE,GAAG2R,WAAW,CAAC/R,MAAD,EAASI,EAAT,CAAhB;;;;;UAKEU,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;YACbG,IAAI,GAAGH,EAAb;YACMiB,KAAK,GAAGvB,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBO,IAArB,CAAd;YACM,CAACuF,MAAD,IAAWhG,MAAM,CAACgG,MAAP,CAAc9F,MAAd,EAAsBO,IAAtB,CAAjB;;QACAD,KAAK,GAAGG,CAAC,IAAIA,CAAC,KAAKqF,MAAnB;;QACA+L,MAAM,GAAGxQ,KAAK,CAACd,IAAN,CAAWtB,MAAX,GAAoBsB,IAAI,CAACtB,MAAzB,GAAkC,CAA3C;QACAmB,EAAE,GAAGiB,KAAL;QACAyQ,MAAM,GAAG,IAAT;;;UAGE,CAAC1R,EAAL,EAAS;;;;UAIH4R,SAAS,GAAGlS,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBI,EAAxB,EAA4B;QAC5CwH,QAAQ,EAAE;OADM,CAAlB;UAGM,CAACqK,OAAD,IAAYnS,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaH,IAAb;QAAmBD;OAAxC,CAAlB;;UAEI,CAAC+R,OAAL,EAAc;;;;UAIRC,SAAS,GAAGpS,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI,EAAF;QAAMD,IAAI,EAAE;OAAhC,CAAlB;UACMgS,KAAK,GAAG,CAAd;;UAEI,CAACjS,KAAD,IAAUgS,SAAd,EAAyB;YACjB,CAACE,QAAD,EAAWC,QAAX,IAAuBH,SAA7B;;YAEI5O,OAAO,CAACC,SAAR,CAAkB6O,QAAlB,KAA+BpS,MAAM,CAAC+C,QAAP,CAAgBqP,QAAhB,CAAnC,EAA8D;cACxDjR,KAAK,GAAGrB,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBqS,QAArB,CAAZ;;cAEI,CAAClR,KAAL,EAAY;gBACJ7C,IAAI,GAAG;cAAEA,IAAI,EAAE;aAArB;gBACMgU,SAAS,GAAGxR,IAAI,CAAClB,IAAL,CAAUyS,QAAV,CAAlB;YACA9B,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+B1B,IAA/B,EAAqC;cAAE8B,EAAE,EAAEkS,SAAN;cAAiBpS;aAAtD;YACAiB,KAAK,GAAGrB,MAAM,CAACuB,KAAP,CAAarB,MAAb,EAAqBsS,SAArB,CAAR;;;UAGFlS,EAAE,GAAGe,KAAL;UACA2Q,MAAM,GAAG,IAAT;;;YAGIS,aAAa,GAAGnS,EAAE,CAACG,IAAH,CAAQtB,MAAR,GAAiBoT,QAAQ,CAACpT,MAAhD;QACA4S,MAAM,GAAGU,aAAa,GAAG,CAAzB;QACAT,MAAM,GAAG,IAAT;;;UAGIU,QAAQ,GAAG1S,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBI,EAAxB,CAAjB;UACMkH,KAAK,GAAGlH,EAAE,CAACG,IAAH,CAAQtB,MAAR,GAAiB4S,MAA/B;UACM,GAAGY,WAAH,IAAkBR,OAAxB;UACMS,UAAU,GAAGtS,EAAE,CAACG,IAAH,CAAQhB,KAAR,CAAc,CAAd,EAAiB+H,KAAjB,CAAnB;UACI8C,QAAQ,GAAGyH,MAAM,KAAK,CAAX,GAAezR,EAAE,CAAC7B,MAAlB,GAA2B6B,EAAE,CAACG,IAAH,CAAQ+G,KAAR,IAAiB6K,KAA3D;UACIvQ,MAAM,GAAkB,IAA5B;;WAEK,IAAM,CAACU,IAAD,EAAO/B,MAAP,CAAX,IAA2BT,MAAM,CAACa,MAAP,CAAcX,MAAd,EAAsB;QAC/CI,EAAE,EAAEsS,UAD2C;QAE/ClS,OAAO,EAAE,IAFsC;QAG/CN;OAHyB,CAA3B,EAII;YACEuR,KAAK,GAAG,KAAZ;;YAGElR,MAAI,CAACtB,MAAL,GAAcwT,WAAW,CAACxT,MAA1B,IACAsB,MAAI,CAACtB,MAAL,KAAgB,CADhB,IAEC,CAACiB,KAAD,IAAUJ,MAAM,CAAC6D,MAAP,CAAc3D,MAAd,EAAsBsC,IAAtB,CAHb,EAIE;;;;YAIIjB,MAAK,GAAG2Q,SAAS,CAAClK,OAAxB;YACMxD,KAAK,GAAGxE,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBqB,MAArB,EAA4Bd,MAA5B,CAAd;;YAEIuR,MAAM,IAAI,CAACE,SAAX,IAAwB,CAAClS,MAAM,CAAC0E,MAAP,CAAcxE,MAAd,EAAsBqB,MAAtB,EAA6Bd,MAA7B,CAA7B,EAAiE;UAC/DkR,KAAK,GAAG,IAAR;;cAC2BpH,UAA3B,4BAA0C/H,IAA1C;;UACAtC,MAAM,CAAC0D,KAAP,CAAa;YACX2F,IAAI,EAAE,YADK;YAEX9I,IAAI,EAAJA,MAFW;YAGX6J,QAHW;YAIXxI,MAJW;YAKXyI;WALF;;;QASFzI,MAAM,GAAGwI,QAAT;QACAA,QAAQ,GAAG7J,MAAI,CAACA,MAAI,CAACtB,MAAL,GAAc,CAAf,CAAJ,IAAyBwS,KAAK,IAAInN,KAAT,GAAiB,CAAjB,GAAqB,CAA9C,CAAX;;;UAGErE,OAAO,CAACG,EAAR,IAAc,IAAlB,EAAwB;YAChBiB,OAAK,GAAGmR,QAAQ,CAAC1K,OAAT,IAAoBhI,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmB,EAAnB,CAAlC;;QACAuQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BqB,OAA1B;;;MAGF2Q,SAAS,CAACjK,KAAV;MACAyK,QAAQ,CAACzK,KAAT;KA7GF;GAnhB0B;;;;;EAwoB5B4K,UAAU,CACR3S,MADQ,EAERkL,KAFQ;QAGRjL,8EAMI;;QAEA,CAAC6G,KAAK,CAACmE,OAAN,CAAcC,KAAd,CAAL,EAA2B;MACzBA,KAAK,GAAG,CAACA,KAAD,CAAR;;;QAGI0H,GAAG,GAAG,EAAZ;;SAEK,IAAM3R,GAAX,IAAkBiK,KAAlB,EAAyB;MACvB0H,GAAG,CAAC3R,GAAD,CAAH,GAAW,IAAX;;;IAGFsP,UAAU,CAACiB,QAAX,CAAoBxR,MAApB,EAA4B4S,GAA5B,EAAiC3S,OAAjC;GA7pB0B;;;;;;EAqqB5B4S,WAAW,CACT7S,MADS,EAETC,OAFS;IAUTH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEG,IAAI,GAAG,QAAT;QAAmBsR,KAAK,GAAG,KAA3B;QAAkCvR,KAAK,GAAG;UAAUD,OAA1D;UACI;QAAEG,EAAE,GAAGJ,MAAM,CAACK,SAAd;QAAyBC;UAAUL,OAAvC;;UAEI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;QACjBA,KAAK,GAAGQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,IACJoQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CADL,GAEJK,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAFT;;;UAKEK,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;QACnBA,EAAE,GAAGN,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBI,EAArB,CAAL;;;UAGI2I,QAAQ,GAAG/E,KAAK,CAACC,OAAN,CAAc7D,EAAd,IAAoBN,MAAM,CAACiJ,QAAP,CAAgB/I,MAAhB,EAAwBI,EAAxB,CAApB,GAAkD,IAAnE;UACMiG,OAAO,GAAGvG,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAME,KAAN;QAAaH,IAAb;QAAmBD;OAAxC,CAAhB;UACM8H,QAAQ,GAAGlB,KAAK,CAACrB,IAAN,CAAWY,OAAX,EAAoB;YAAC,GAAG3F,CAAH,CAAD;eAAWZ,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBU,CAAvB,CAAX;OAApB,CAAjB;;iCAEWiH;YACHpH,IAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;YACM,CAACzF,IAAD,IAASxC,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAf;YACIkB,KAAK,GAAG3B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBO,IAArB,CAAZ;;YAEIkR,KAAK,IAAI1I,QAAb,EAAuB;UACrBtH,KAAK,GAAGuC,KAAK,CAACiL,YAAN,CAAmBlG,QAAQ,CAACjB,OAA5B,EAAsCrG,KAAtC,CAAR;;;QAGF8O,UAAU,CAACI,SAAX,CAAqB3Q,MAArB,EAA6B;UAC3BI,EAAE,EAAEqB,KADuB;UAE3BnB,KAAK,EAAEG,CAAC,IAAI6B,IAAI,CAACK,QAAL,CAAcoD,QAAd,CAAuBtF,CAAvB,CAFe;UAG3BP;SAHF;;;WATG,IAAMyH,OAAX,IAAsBK,QAAtB,EAAgC;cAArBL,OAAqB;;;UAgB5BoB,QAAJ,EAAc;QACZA,QAAQ,CAAChB,KAAT;;KAvCJ;GA/qB0B;;;;;;EAguB5B+K,SAAS,CACP9S,MADO,EAEP0C,OAFO;QAGPzC,8EAMI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEG,IAAI,GAAG,QAAT;QAAmBsR,KAAK,GAAG,KAA3B;QAAkCvR,KAAK,GAAG;UAAUD,OAA1D;UACI;QAAEK,KAAF;QAASF,EAAE,GAAGJ,MAAM,CAACK;UAAcJ,OAAvC;;UAEI,CAACG,EAAL,EAAS;;;;UAILE,KAAK,IAAI,IAAb,EAAmB;YACbQ,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;UACnBE,KAAK,GAAGkQ,SAAS,CAACxQ,MAAD,EAASI,EAAT,CAAjB;SADF,MAEO,IAAIJ,MAAM,CAAC+C,QAAP,CAAgBL,OAAhB,CAAJ,EAA8B;UACnCpC,KAAK,GAAGG,CAAC,IAAIX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,KAA8BG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,CAA3C;SADK,MAEA;UACLH,KAAK,GAAGG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAAb;;;;UAIAgR,KAAK,IAAIzN,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAb,EAAgC;YACxB,CAAC2B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAArB;YACM2I,QAAQ,GAAGjJ,MAAM,CAACiJ,QAAP,CAAgB/I,MAAhB,EAAwBI,EAAxB,EAA4B;UAC3CwH,QAAQ,EAAE;SADK,CAAjB;QAGA2I,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;UAAEI,EAAE,EAAEoB,GAAN;UAAWlB,KAAX;UAAkBJ;SAAhD;QACAqQ,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;UAAEI,EAAE,EAAE2B,KAAN;UAAazB,KAAb;UAAoBJ;SAAlD;QACAE,EAAE,GAAG2I,QAAQ,CAAChB,KAAT,EAAL;;YAEI9H,OAAO,CAACG,EAAR,IAAc,IAAlB,EAAwB;UACtBmQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BI,EAA1B;;;;UAIE2S,KAAK,GAAGjM,KAAK,CAACrB,IAAN,CACZ3F,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QACnBI,EADmB;QAEnBE,KAAK,EAAEN,MAAM,CAAC+C,QAAP,CAAgBL,OAAhB,IACHjC,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CADF,GAEHA,CAAC,IAAIX,MAAM,CAAC0D,QAAP,CAAgB/C,CAAhB,CAJU;QAKnBN,IAAI,EAAE,QALa;QAMnBD;OANF,CADY,CAAd;;WAWK,IAAM,GAAG8S,QAAH,CAAX,IAA2BD,KAA3B,EAAkC;YAC1BE,CAAC,GAAGjP,KAAK,CAACC,OAAN,CAAc7D,EAAd,IACN4D,KAAK,CAACiL,YAAN,CAAmB7O,EAAnB,EAAuBN,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBgT,QAArB,CAAvB,CADM,GAEN5S,EAFJ;;YAII,CAAC6S,CAAL,EAAQ;;;;YAIF5M,OAAO,GAAGS,KAAK,CAACrB,IAAN,CACd3F,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;UAAEI,EAAE,EAAE6S,CAAN;UAAS3S,KAAT;UAAgBH,IAAhB;UAAsBD;SAA3C,CADc,CAAhB;;YAIImG,OAAO,CAACpH,MAAR,GAAiB,CAArB,EAAwB;;gBAChB,CAACoD,KAAD,IAAUgE,OAAhB;gBACMvB,IAAI,GAAGuB,OAAO,CAACA,OAAO,CAACpH,MAAR,GAAiB,CAAlB,CAApB;gBACM,GAAGsI,SAAH,IAAgBlF,KAAtB;gBACM,GAAGmF,QAAH,IAAe1C,IAArB;gBACMmM,UAAU,GAAGnQ,IAAI,CAACC,MAAL,CAAYwG,SAAZ,EAAuBC,QAAvB,IACf1G,IAAI,CAACgF,MAAL,CAAYyB,SAAZ,CADe,GAEfzG,IAAI,CAAC2G,MAAL,CAAYF,SAAZ,EAAuBC,QAAvB,CAFJ;gBAIM/F,KAAK,GAAG3B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBuH,SAArB,EAAgCC,QAAhC,CAAd;gBACM,CAAC0L,UAAD,IAAepT,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBiR,UAApB,CAArB;gBACM3J,KAAK,GAAG2J,UAAU,CAAChS,MAAX,GAAoB,CAAlC;gBACMkU,WAAW,GAAGrS,IAAI,CAAClB,IAAL,CAAU4H,QAAQ,CAACjI,KAAT,CAAe,CAAf,EAAkB+H,KAAlB,CAAV,CAApB;;gBACM8L,OAAO,uBAAQ1Q,OAAR;cAAiBC,QAAQ,EAAE;cAAxC;;YACA4N,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BoT,OAA/B,EAAwC;cAAEhT,EAAE,EAAE+S,WAAN;cAAmBjT;aAA3D;YAEAqQ,UAAU,CAACM,SAAX,CAAqB7Q,MAArB,EAA6B;cAC3BI,EAAE,EAAEqB,KADuB;cAE3BnB,KAAK,EAAEG,CAAC,IAAIyS,UAAU,CAACvQ,QAAX,CAAoBoD,QAApB,CAA6BtF,CAA7B,CAFe;cAG3BiF,EAAE,EAAEyN,WAAW,CAACxH,MAAZ,CAAmB,CAAnB,CAHuB;cAI3BzL;aAJF;;;;KAxEN;;;CA3uBG;;;;;AAm0BP,IAAM6R,WAAW,GAAG,CAAC/R,MAAD,EAAiByB,KAAjB;MACduC,KAAK,CAAC0G,WAAN,CAAkBjJ,KAAlB,CAAJ,EAA8B;WACrBA,KAAK,CAACL,MAAb;GADF,MAEO;QACC,GAAGI,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAYX,KAAZ,CAAhB;QACM4G,QAAQ,GAAGvI,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAjB;IACA+O,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;MAAEI,EAAE,EAAEqB;KAAhC;WACO4G,QAAQ,CAACN,KAAT,EAAP;;CAPJ;;AAWA,IAAMyI,SAAS,GAAG,CAACxQ,MAAD,EAAiBO,IAAjB;MACV,CAAC+B,IAAD,IAASxC,MAAM,CAACwC,IAAP,CAAYtC,MAAZ,EAAoBO,IAApB,CAAf;SACOE,CAAC,IAAIA,CAAC,KAAK6B,IAAlB;CAFF;;;;;ACx1BO,IAAM+Q,mBAAmB,GAAG;;;;EAKjCC,QAAQ,CACNtT,MADM;QAENC,8EAEI;QAEE;MAAEqB,IAAI,GAAG;QAAarB,OAA5B;QACM;MAAEI;QAAcL,MAAtB;;QAEI,CAACK,SAAL,EAAgB;;KAAhB,MAEO,IAAIiB,IAAI,KAAK,QAAb,EAAuB;MAC5BiP,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BK,SAAS,CAACe,MAApC;KADK,MAEA,IAAIE,IAAI,KAAK,OAAb,EAAsB;MAC3BiP,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BK,SAAS,CAACkB,KAApC;KADK,MAEA,IAAID,IAAI,KAAK,OAAb,EAAsB;UACrB,CAACS,KAAD,IAAUiC,KAAK,CAAC5B,KAAN,CAAY/B,SAAZ,CAAhB;MACAkQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0B+B,KAA1B;KAFK,MAGA,IAAIT,IAAI,KAAK,KAAb,EAAoB;UACnB,GAAGE,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAY/B,SAAZ,CAAhB;MACAkQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BwB,GAA1B;;GAzB6B;;;;;EAiCjC+R,QAAQ,CAACvT,MAAD;QACA;MAAEK;QAAcL,MAAtB;;QAEIK,SAAJ,EAAe;MACbL,MAAM,CAAC0D,KAAP,CAAa;QACX2F,IAAI,EAAE,eADK;QAEXgB,UAAU,EAAEhK,SAFD;QAGX0J,aAAa,EAAE;OAHjB;;GArC6B;;;;;EAiDjCyJ,IAAI,CACFxT,MADE;QAEFC,8EAKI;QAEE;MAAEI;QAAcL,MAAtB;QACM;MAAE0B,QAAQ,GAAG,CAAb;MAAgBO,IAAI,GAAG,WAAvB;MAAoCzB,OAAO,GAAG;QAAUP,OAA9D;QACI;MAAEqB,IAAI,GAAG;QAASrB,OAAtB;;QAEI,CAACI,SAAL,EAAgB;;;;QAIZiB,IAAI,KAAK,OAAb,EAAsB;MACpBA,IAAI,GAAG0C,KAAK,CAAC0K,UAAN,CAAiBrO,SAAjB,IAA8B,OAA9B,GAAwC,QAA/C;;;QAGEiB,IAAI,KAAK,KAAb,EAAoB;MAClBA,IAAI,GAAG0C,KAAK,CAAC0K,UAAN,CAAiBrO,SAAjB,IAA8B,QAA9B,GAAyC,OAAhD;;;QAGI;MAAEe,MAAF;MAAUG;QAAUlB,SAA1B;QACMoT,IAAI,GAAG;MAAE/R,QAAF;MAAYO;KAAzB;QACMiJ,KAAK,GAAmB,EAA9B;;QAEI5J,IAAI,IAAI,IAAR,IAAgBA,IAAI,KAAK,QAA7B,EAAuC;UAC/BD,KAAK,GAAGb,OAAO,GACjBV,MAAM,CAACgC,MAAP,CAAc9B,MAAd,EAAsBoB,MAAtB,EAA8BqS,IAA9B,CADiB,GAEjB3T,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBoB,MAArB,EAA6BqS,IAA7B,CAFJ;;UAIIpS,KAAJ,EAAW;QACT6J,KAAK,CAAC9J,MAAN,GAAeC,KAAf;;;;QAIAC,IAAI,IAAI,IAAR,IAAgBA,IAAI,KAAK,OAA7B,EAAsC;UAC9BD,MAAK,GAAGb,OAAO,GACjBV,MAAM,CAACgC,MAAP,CAAc9B,MAAd,EAAsBuB,KAAtB,EAA6BkS,IAA7B,CADiB,GAEjB3T,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBuB,KAArB,EAA4BkS,IAA5B,CAFJ;;UAIIpS,MAAJ,EAAW;QACT6J,KAAK,CAAC3J,KAAN,GAAcF,MAAd;;;;IAIJkP,UAAU,CAACmD,YAAX,CAAwB1T,MAAxB,EAAgCkL,KAAhC;GAlG+B;;;;;EAyGjCoF,MAAM,CAACtQ,MAAD,EAAiB4B,MAAjB;QACE;MAAEvB;QAAcL,MAAtB;IACA4B,MAAM,GAAG9B,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqB4B,MAArB,CAAT;;QAEIvB,SAAJ,EAAe;MACbkQ,UAAU,CAACmD,YAAX,CAAwB1T,MAAxB,EAAgC4B,MAAhC;;;;QAIE,CAACoC,KAAK,CAACC,OAAN,CAAcrC,MAAd,CAAL,EAA4B;YACpB,IAAIiE,KAAJ,6IACuImE,IAAI,CAACC,SAAL,CACzIrI,MADyI,CADvI,EAAN;;;IAOF5B,MAAM,CAAC0D,KAAP,CAAa;MACX2F,IAAI,EAAE,eADK;MAEXgB,UAAU,EAAEhK,SAFD;MAGX0J,aAAa,EAAEnI;KAHjB;GA1H+B;;;;;EAqIjC+R,QAAQ,CACN3T,MADM,EAENkL,KAFM,EAGNjL,OAHM;QAOA;MAAEI;QAAcL,MAAtB;QACI;MAAEsB,IAAI,GAAG;QAAWrB,OAAxB;;QAEI,CAACI,SAAL,EAAgB;;;;QAIZiB,IAAI,KAAK,OAAb,EAAsB;MACpBA,IAAI,GAAG0C,KAAK,CAAC0K,UAAN,CAAiBrO,SAAjB,IAA8B,OAA9B,GAAwC,QAA/C;;;QAGEiB,IAAI,KAAK,KAAb,EAAoB;MAClBA,IAAI,GAAG0C,KAAK,CAAC0K,UAAN,CAAiBrO,SAAjB,IAA8B,QAA9B,GAAyC,OAAhD;;;QAGI;MAAEe,MAAF;MAAUG;QAAUlB,SAA1B;QACMgB,KAAK,GAAGC,IAAI,KAAK,QAAT,GAAoBF,MAApB,GAA6BG,KAA3C;IAEAgP,UAAU,CAACmD,YAAX,CAAwB1T,MAAxB,EAAgC;OAC7BsB,IAAI,KAAK,QAAT,GAAoB,QAApB,GAA+B,OAAhC,uBAA+CD,KAA/C,MAAyD6J,KAAzD;KADF;GA9J+B;;;;;EAuKjCwI,YAAY,CAAC1T,MAAD,EAAiBkL,KAAjB;QACJ;MAAE7K;QAAcL,MAAtB;QACM4T,QAAQ,GAA0B,EAAxC;QACMC,QAAQ,GAAmB,EAAjC;;QAEI,CAACxT,SAAL,EAAgB;;;;SAIX,IAAMsR,CAAX,IAAgBzG,KAAhB,EAAuB;UAElByG,CAAC,KAAK,QAAN,IACCzG,KAAK,CAAC9J,MAAN,IAAgB,IADjB,IAEC,CAACmD,KAAK,CAACxD,MAAN,CAAamK,KAAK,CAAC9J,MAAnB,EAA2Bf,SAAS,CAACe,MAArC,CAFH,IAGCuQ,CAAC,KAAK,OAAN,IACCzG,KAAK,CAAC3J,KAAN,IAAe,IADhB,IAEC,CAACgD,KAAK,CAACxD,MAAN,CAAamK,KAAK,CAAC3J,KAAnB,EAA0BlB,SAAS,CAACkB,KAApC,CALH,IAMCoQ,CAAC,KAAK,QAAN,IAAkBA,CAAC,KAAK,OAAxB,IAAmCzG,KAAK,CAACyG,CAAD,CAAL,KAAatR,SAAS,CAACsR,CAAD,CAP5D,EAQE;QACAiC,QAAQ,CAACjC,CAAD,CAAR,GAActR,SAAS,CAACsR,CAAD,CAAvB;QACAkC,QAAQ,CAAClC,CAAD,CAAR,GAAczG,KAAK,CAACyG,CAAD,CAAnB;;;;QAIAzH,MAAM,CAAC0H,IAAP,CAAYgC,QAAZ,EAAsB3U,MAAtB,GAA+B,CAAnC,EAAsC;MACpCe,MAAM,CAAC0D,KAAP,CAAa;QACX2F,IAAI,EAAE,eADK;QAEXgB,UAAU,EAAEuJ,QAFD;QAGX7J,aAAa,EAAE8J;OAHjB;;;;CAhMC;;ACWA,IAAMC,cAAc,GAAG;;;;EAK5B7L,MAAM,CACJjI,MADI;QAEJC,8EAOI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QACJQ,OAAO,GAAG,KADN;QAEJyB,IAAI,GAAG,WAFH;QAGJP,QAAQ,GAAG,CAHP;QAIJxB,KAAK,GAAG;UACND,OALJ;UAMI;QAAEG,EAAE,GAAGJ,MAAM,CAACK,SAAd;QAAyBgQ,OAAO,GAAG;UAAUpQ,OAAjD;;UAEI,CAACG,EAAL,EAAS;;;;UAIL4D,KAAK,CAACC,OAAN,CAAc7D,EAAd,KAAqB4D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAzB,EAAgD;QAC9CA,EAAE,GAAGA,EAAE,CAACgB,MAAR;;;UAGEmD,KAAK,CAACmD,OAAN,CAActH,EAAd,CAAJ,EAAuB;YACf2T,YAAY,GAAGjU,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;UAAEI,EAAF;UAAMD,IAAI,EAAE;SAAhC,CAArB;;YAEI,CAACD,KAAD,IAAU6T,YAAd,EAA4B;cACpB,GAAG1B,QAAH,IAAe0B,YAArB;UACA3T,EAAE,GAAGiS,QAAL;SAFF,MAGO;cACCoB,IAAI,GAAG;YAAExR,IAAF;YAAQP;WAArB;cACME,MAAM,GAAGpB,OAAO,GAClBV,MAAM,CAACgC,MAAP,CAAc9B,MAAd,EAAsBI,EAAtB,EAA0BqT,IAA1B,KAAmC3T,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqB,EAArB,CADjB,GAElBF,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBI,EAArB,EAAyBqT,IAAzB,KAAkC3T,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmB,EAAnB,CAFtC;UAGAI,EAAE,GAAG;YAAEgB,MAAM,EAAEhB,EAAV;YAAcmB,KAAK,EAAEK;WAA1B;UACAyO,OAAO,GAAG,IAAV;;;;UAIAvP,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;QACnBmQ,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;UAAEI,EAAF;UAAMF;SAArC;;;;UAIE8D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAJ,EAA2B;;;;UAIvB,CAACiQ,OAAL,EAAc;QACZjQ,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,EAA+B;UAAEF;SAAjC,CAAL;;;UAGE,CAAC6B,KAAD,EAAQP,GAAR,IAAewC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAAnB;UACM4T,UAAU,GAAGlU,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QACtCM,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAD0B;QAEtCL,EAAE,EAAE2B,KAFkC;QAGtC7B;OAHiB,CAAnB;UAKMyK,QAAQ,GAAG7K,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QACpCM,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CADwB;QAEpCL,EAAE,EAAEoB,GAFgC;QAGpCtB;OAHe,CAAjB;UAKM+T,cAAc,GAClBD,UAAU,IAAIrJ,QAAd,IAA0B,CAAC7J,IAAI,CAACC,MAAL,CAAYiT,UAAU,CAAC,CAAD,CAAtB,EAA2BrJ,QAAQ,CAAC,CAAD,CAAnC,CAD7B;UAEMuJ,YAAY,GAAGpT,IAAI,CAACC,MAAL,CAAYgB,KAAK,CAACxB,IAAlB,EAAwBiB,GAAG,CAACjB,IAA5B,CAArB;UACM4T,SAAS,GAAGjU,KAAK,GACnB,IADmB,GAEnBJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI,EAAE,EAAE2B,KAAN;QAAa5B,IAAI,EAAE;OAAvC,CAFJ;UAGMiU,OAAO,GAAGlU,KAAK,GACjB,IADiB,GAEjBJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI,EAAE,EAAEoB,GAAN;QAAWrB,IAAI,EAAE;OAArC,CAFJ;;UAKIgU,SAAJ,EAAe;YACPrS,MAAM,GAAGhC,MAAM,CAACgC,MAAP,CAAc9B,MAAd,EAAsB+B,KAAtB,CAAf;;YAGED,MAAM,IACNkS,UADA,IAEAlT,IAAI,CAAC0E,UAAL,CAAgBwO,UAAU,CAAC,CAAD,CAA1B,EAA+BlS,MAAM,CAACvB,IAAtC,CAHF,EAIE;UACAwB,KAAK,GAAGD,MAAR;;;;UAIAsS,OAAJ,EAAa;YACLjT,KAAK,GAAGrB,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBwB,GAArB,CAAd;;YAEIL,KAAK,IAAIwJ,QAAT,IAAqB7J,IAAI,CAAC0E,UAAL,CAAgBmF,QAAQ,CAAC,CAAD,CAAxB,EAA6BxJ,KAAK,CAACZ,IAAnC,CAAzB,EAAmE;UACjEiB,GAAG,GAAGL,KAAN;;;;;;UAMEkF,OAAO,GAAgB,EAA7B;UACImB,QAAJ;;WAEK,IAAMJ,KAAX,IAAoBtH,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QAAEI,EAAF;QAAMF;OAA3B,CAApB,EAAyD;YACjD,CAACoC,IAAD,EAAO/B,IAAP,IAAe6G,KAArB;;YAEII,QAAQ,IAAI1G,IAAI,CAAC0F,OAAL,CAAajG,IAAb,EAAmBiH,QAAnB,MAAiC,CAAjD,EAAoD;;;;YAKjD,CAACtH,KAAD,IAAUJ,MAAM,CAAC6D,MAAP,CAAc3D,MAAd,EAAsBsC,IAAtB,CAAX,IACC,CAACxB,IAAI,CAAC+M,QAAL,CAActN,IAAd,EAAoBwB,KAAK,CAACxB,IAA1B,CAAD,IAAoC,CAACO,IAAI,CAAC+M,QAAL,CAActN,IAAd,EAAoBiB,GAAG,CAACjB,IAAxB,CAFxC,EAGE;UACA8F,OAAO,CAACrB,IAAR,CAAaoC,KAAb;UACAI,QAAQ,GAAGjH,IAAX;;;;UAIEyH,QAAQ,GAAGlB,KAAK,CAACrB,IAAN,CAAWY,OAAX,EAAoB;YAAC,GAAG3F,CAAH,CAAD;eAAWZ,MAAM,CAAC6H,OAAP,CAAe3H,MAAf,EAAuBU,CAAvB,CAAX;OAApB,CAAjB;UACM2T,QAAQ,GAAGvU,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwB+B,KAAxB,CAAjB;UACMuS,MAAM,GAAGxU,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAf;;UAEI,CAAC0S,YAAD,IAAiB,CAACC,SAAtB,EAAiC;YACzB9S,MAAK,GAAGgT,QAAQ,CAACvM,OAAvB;YACM,CAACxF,KAAD,IAASxC,MAAM,CAACiF,IAAP,CAAY/E,MAAZ,EAAoBqB,MAApB,CAAf;YACM;UAAEd,IAAI,EAAJA;YAASc,MAAjB;YACM;UAAE9C;YAAWwD,KAAnB;;YACMzD,IAAI,GAAGgE,KAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,MAAhB,CAAb;;QACAyB,MAAM,CAAC0D,KAAP,CAAa;UAAE2F,IAAI,EAAE,aAAR;UAAuB9I,IAAI,EAAJA,KAAvB;UAA6BhC,MAA7B;UAAqCD;SAAlD;;;WAGG,IAAMqJ,OAAX,IAAsBK,QAAtB,EAAgC;YACxBzH,MAAI,GAAGoH,OAAO,CAACI,KAAR,EAAb;;QACAwI,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;UAAEI,EAAE,EAAEG,MAAN;UAAYL;SAA3C;;;UAGE,CAACkU,OAAL,EAAc;YACN/S,OAAK,GAAGiT,MAAM,CAACxM,OAArB;YACM,CAACxF,MAAD,IAASxC,MAAM,CAACiF,IAAP,CAAY/E,MAAZ,EAAoBqB,OAApB,CAAf;YACM;UAAEd,IAAI,EAAJA;YAASc,OAAjB;;YACM9C,OAAM,GAAG2V,YAAY,GAAGnS,KAAK,CAACxD,MAAT,GAAkB,CAA7C;;YACMD,KAAI,GAAGgE,MAAI,CAAChE,IAAL,CAAUiB,KAAV,CAAgBhB,OAAhB,EAAwBiD,GAAG,CAACjD,MAA5B,CAAb;;QACAyB,MAAM,CAAC0D,KAAP,CAAa;UAAE2F,IAAI,EAAE,aAAR;UAAuB9I,IAAI,EAAJA,MAAvB;UAA6BhC,MAAM,EAANA,OAA7B;UAAqCD,IAAI,EAAJA;SAAlD;;;UAIA,CAAC4V,YAAD,IACAD,cADA,IAEAK,MAAM,CAACxM,OAFP,IAGAuM,QAAQ,CAACvM,OAJX,EAKE;QACAyI,UAAU,CAACS,UAAX,CAAsBhR,MAAtB,EAA8B;UAC5BI,EAAE,EAAEkU,MAAM,CAACxM,OADiB;UAE5BuI,OAAO,EAAE,IAFmB;UAG5BnQ;SAHF;;;UAOImB,KAAK,GAAGiT,MAAM,CAACvM,KAAP,MAAkBsM,QAAQ,CAACtM,KAAT,EAAhC;;UAEI9H,OAAO,CAACG,EAAR,IAAc,IAAd,IAAsBiB,KAA1B,EAAiC;QAC/BkP,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BqB,KAA1B;;KAxJJ;GAhB0B;;;;;EAiL5B8B,cAAc,CACZnD,MADY,EAEZuC,QAFY;QAGZtC,8EAII;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEqQ,OAAO,GAAG,KAAZ;QAAmBnQ,KAAK,GAAG;UAAUD,OAA3C;UACI;QAAEG,EAAE,GAAGJ,MAAM,CAACK;UAAcJ,OAAhC;;UAEI,CAACsC,QAAQ,CAACtD,MAAd,EAAsB;;;;UAIlB,CAACmB,EAAL,EAAS;;OAAT,MAEO,IAAI4D,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;YACxB,CAACiQ,OAAL,EAAc;UACZjQ,EAAE,GAAGN,MAAM,CAAC2K,WAAP,CAAmBzK,MAAnB,EAA2BI,EAA3B,CAAL;;;YAGE4D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAJ,EAA2B;UACzBA,EAAE,GAAGA,EAAE,CAACgB,MAAR;SADF,MAEO;cACC,GAAGI,GAAH,IAAUwC,KAAK,CAAC5B,KAAN,CAAYhC,EAAZ,CAAhB;;cAEI,CAACF,KAAD,IAAUJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;YAAEI,EAAE,EAAEoB;WAA1B,CAAd,EAAgD;;;;cAI1C6G,QAAQ,GAAGvI,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAjB;UACA+O,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;YAAEI;WAA5B;UACAA,EAAE,GAAGiI,QAAQ,CAACN,KAAT,EAAL;;OAhBG,MAkBA,IAAIjH,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;QAC1BA,EAAE,GAAGN,MAAM,CAACiC,KAAP,CAAa/B,MAAb,EAAqBI,EAArB,CAAL;;;UAGE,CAACF,KAAD,IAAUJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI;OAAtB,CAAd,EAA2C;;;;;;UAMrCmU,kBAAkB,GAAGzU,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QAC9CI,EAD8C;QAE9CE,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CAFkC;QAG9CN,IAAI,EAAE,SAHwC;QAI9CD;OAJyB,CAA3B;;UAOIqU,kBAAJ,EAAwB;YAChB,GAAGC,WAAH,IAAiBD,kBAAvB;;YAEIzU,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBI,EAArB,EAAyBoU,WAAzB,CAAJ,EAA0C;cAClCrT,KAAK,GAAGrB,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBwU,WAArB,CAAd;UACApU,EAAE,GAAGe,KAAL;SAFF,MAGO,IAAIrB,MAAM,CAAC2E,OAAP,CAAezE,MAAf,EAAuBI,EAAvB,EAA2BoU,WAA3B,CAAJ,EAA4C;cAC3C1S,MAAM,GAAGhC,MAAM,CAACgC,MAAP,CAAc9B,MAAd,EAAsBwU,WAAtB,CAAf;UACApU,EAAE,GAAG0B,MAAL;;;;UAIE2S,UAAU,GAAG3U,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;QACtCM,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAD0B;QAEtCL,EAFsC;QAGtCF;OAHiB,CAAnB;UAKM,GAAGqF,SAAH,IAAgBkP,UAAtB;UACMC,YAAY,GAAG5U,MAAM,CAAC2E,OAAP,CAAezE,MAAf,EAAuBI,EAAvB,EAA2BmF,SAA3B,CAArB;UACMoP,UAAU,GAAG7U,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBI,EAArB,EAAyBmF,SAAzB,CAAnB;UACMqP,UAAU,GAAG,CAACF,YAAD,IAAkBA,YAAY,IAAIC,UAArD;UACME,QAAQ,GAAG,CAACF,UAAlB;UACM,GAAGpN,SAAH,IAAgB/E,IAAI,CAACH,KAAL,CAAW;QAAEM,QAAQ,EAAEJ;OAAvB,EAAmC,EAAnC,CAAtB;UACM,GAAGiF,QAAH,IAAehF,IAAI,CAACsC,IAAL,CAAU;QAAEnC,QAAQ,EAAEJ;OAAtB,EAAkC,EAAlC,CAArB;UAEM8D,OAAO,GAAgB,EAA7B;;UACMyO,OAAO,GAAG;YAAC,CAACrU,CAAD,EAAIC,CAAJ;;YAEbkU,UAAU,IACV9T,IAAI,CAAC0E,UAAL,CAAgB9E,CAAhB,EAAmB6G,SAAnB,CADA,IAEAjE,OAAO,CAACC,SAAR,CAAkB9C,CAAlB,CAFA,IAGA,CAACT,MAAM,CAAC2D,MAAP,CAAclD,CAAd,CAHD,IAIA,CAACT,MAAM,CAAC+C,QAAP,CAAgBtC,CAAhB,CALH,EAME;iBACO,KAAP;;;YAIAoU,QAAQ,IACR/T,IAAI,CAAC0E,UAAL,CAAgB9E,CAAhB,EAAmB8G,QAAnB,CADA,IAEAlE,OAAO,CAACC,SAAR,CAAkB9C,CAAlB,CAFA,IAGA,CAACT,MAAM,CAAC2D,MAAP,CAAclD,CAAd,CAHD,IAIA,CAACT,MAAM,CAAC+C,QAAP,CAAgBtC,CAAhB,CALH,EAME;iBACO,KAAP;;;eAGK,IAAP;OArBF;;WAwBK,IAAM2G,KAAX,IAAoB5E,IAAI,CAAC0C,KAAL,CAClB;QAAEvC,QAAQ,EAAEJ;OADM,EAElB;QAAE6D,IAAI,EAAE0O;OAFU,CAApB,EAGG;YACG1N,KAAK,CAAC,CAAD,CAAL,CAASnI,MAAT,GAAkB,CAAlB,IAAuB6V,OAAO,CAAC1N,KAAD,CAAlC,EAA2C;UACzCf,OAAO,CAACrB,IAAR,CAAaoC,KAAb;;;;UAIE2N,MAAM,GAAG,EAAf;UACMC,OAAO,GAAG,EAAhB;UACMC,IAAI,GAAG,EAAb;UACIC,QAAQ,GAAG,IAAf;UACIzS,SAAS,GAAG,KAAhB;;WAEK,IAAM,CAACH,IAAD,CAAX,IAAqB+D,OAArB,EAA8B;YACxB/C,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,KAA2B,CAACtC,MAAM,CAAC+C,QAAP,CAAgBT,IAAhB,CAAhC,EAAuD;UACrD4S,QAAQ,GAAG,KAAX;UACAzS,SAAS,GAAG,IAAZ;UACAuS,OAAO,CAAChQ,IAAR,CAAa1C,IAAb;SAHF,MAIO,IAAI4S,QAAJ,EAAc;UACnBH,MAAM,CAAC/P,IAAP,CAAY1C,IAAZ;SADK,MAEA;UACL2S,IAAI,CAACjQ,IAAL,CAAU1C,IAAV;;;;UAIE,CAAC6S,WAAD,IAAgBrV,MAAM,CAACoF,KAAP,CAAalF,MAAb,EAAqB;QACzCI,EADyC;QAEzCE,KAAK,EAAEG,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CAFW;QAGzCN,IAAI,EAAE,SAHmC;QAIzCD;OAJoB,CAAtB;UAOM,GAAGsU,UAAH,IAAiBW,WAAvB;UACMC,aAAa,GAAGtV,MAAM,CAAC2E,OAAP,CAAezE,MAAf,EAAuBI,EAAvB,EAA2BoU,UAA3B,CAAtB;UACMa,WAAW,GAAGvV,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBI,EAArB,EAAyBoU,UAAzB,CAApB;UAEMc,SAAS,GAAGxV,MAAM,CAAC6H,OAAP,CAChB3H,MADgB,EAEhB2U,UAAU,GAAG7T,IAAI,CAAClB,IAAL,CAAU2F,SAAV,CAAH,GAA0BA,SAFpB,CAAlB;UAKM+O,MAAM,GAAGxU,MAAM,CAAC6H,OAAP,CACb3H,MADa,EAEbqV,WAAW,GAAGvU,IAAI,CAAClB,IAAL,CAAU4U,UAAV,CAAH,GAA2BA,UAFzB,CAAf;MAKAjE,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;QAC5BI,EAD4B;QAE5BE,KAAK,EAAEG,CAAC,IACNgC,SAAS,GACL3C,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CADK,GAELG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CALI;QAM5BN,IAAI,EAAEsC,SAAS,GAAG,QAAH,GAAc,SAND;QAO5BvC;OAPF;UAUMmU,QAAQ,GAAGvU,MAAM,CAAC6H,OAAP,CACf3H,MADe,EAEf,CAACoV,aAAD,IAAmBA,aAAa,IAAIC,WAApC,GACIvU,IAAI,CAAClB,IAAL,CAAU4U,UAAV,CADJ,GAEIA,UAJW,CAAjB;MAOAjE,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+B+U,MAA/B,EAAuC;QACrC3U,EAAE,EAAEiU,QAAQ,CAACvM,OADwB;QAErCxH,KAAK,EAAEG,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CAFO;QAGrCN,IAAI,EAAE,SAH+B;QAIrCD;OAJF;MAOAqQ,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BgV,OAA/B,EAAwC;QACtC5U,EAAE,EAAEkV,SAAS,CAACxN,OADwB;QAEtCxH,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAAC+C,OAAP,CAAe7C,MAAf,EAAuBS,CAAvB,CAF0B;QAGtCN,IAAI,EAAE,QAHgC;QAItCD;OAJF;MAOAqQ,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BiV,IAA/B,EAAqC;QACnC7U,EAAE,EAAEkU,MAAM,CAACxM,OADwB;QAEnCxH,KAAK,EAAEG,CAAC,IAAIG,IAAI,CAACC,MAAL,CAAYJ,CAAZ,KAAkBX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CAFK;QAGnCN,IAAI,EAAE,SAH6B;QAInCD;OAJF;;UAOI,CAACD,OAAO,CAACG,EAAb,EAAiB;YACXG,IAAJ;;YAEI0U,IAAI,CAAChW,MAAL,GAAc,CAAlB,EAAqB;UACnBsB,IAAI,GAAGO,IAAI,CAACqE,QAAL,CAAcmP,MAAM,CAACxM,OAArB,CAAP;SADF,MAEO,IAAIkN,OAAO,CAAC/V,MAAR,GAAiB,CAArB,EAAwB;UAC7BsB,IAAI,GAAGO,IAAI,CAACqE,QAAL,CAAcmQ,SAAS,CAACxN,OAAxB,CAAP;SADK,MAEA;UACLvH,IAAI,GAAGO,IAAI,CAACqE,QAAL,CAAckP,QAAQ,CAACvM,OAAvB,CAAP;;;YAGItG,IAAG,GAAG1B,MAAM,CAAC0B,GAAP,CAAWxB,MAAX,EAAmBO,IAAnB,CAAZ;;QACAgQ,UAAU,CAACD,MAAX,CAAkBtQ,MAAlB,EAA0BwB,IAA1B;;;MAGF6S,QAAQ,CAACtM,KAAT;MACAuN,SAAS,CAACvN,KAAV;MACAuM,MAAM,CAACvM,KAAP;KAtMF;GA1L0B;;;;;EAwY5B1E,UAAU,CACRrD,MADQ,EAER1B,IAFQ;QAGR2B,8EAGI;IAEJH,MAAM,CAACkH,kBAAP,CAA0BhH,MAA1B,EAAkC;UAC1B;QAAEE,KAAK,GAAG;UAAUD,OAA1B;UACI;QAAEG,EAAE,GAAGJ,MAAM,CAACK;UAAcJ,OAAhC;;UAEI,CAACG,EAAL,EAAS;;;;UAILU,IAAI,CAAC8E,MAAL,CAAYxF,EAAZ,CAAJ,EAAqB;QACnBA,EAAE,GAAGN,MAAM,CAAC2B,KAAP,CAAazB,MAAb,EAAqBI,EAArB,CAAL;;;UAGE4D,KAAK,CAACC,OAAN,CAAc7D,EAAd,CAAJ,EAAuB;YACjB4D,KAAK,CAAC0G,WAAN,CAAkBtK,EAAlB,CAAJ,EAA2B;UACzBA,EAAE,GAAGA,EAAE,CAACgB,MAAR;SADF,MAEO;cACCI,GAAG,GAAGwC,KAAK,CAACxC,GAAN,CAAUpB,EAAV,CAAZ;;cAEI,CAACF,KAAD,IAAUJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;YAAEI,EAAE,EAAEoB;WAA1B,CAAd,EAAgD;;;;cAI1C6G,QAAQ,GAAGvI,MAAM,CAACuI,QAAP,CAAgBrI,MAAhB,EAAwBwB,GAAxB,CAAjB;UACA+O,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;YAAEI,EAAF;YAAMF;WAAhC;UACAE,EAAE,GAAGiI,QAAQ,CAACN,KAAT,EAAL;UACAwI,UAAU,CAACmD,YAAX,CAAwB1T,MAAxB,EAAgC;YAAEoB,MAAM,EAAEhB,EAAV;YAAcmB,KAAK,EAAEnB;WAArD;;;;UAIA,CAACF,KAAD,IAAUJ,MAAM,CAACgL,IAAP,CAAY9K,MAAZ,EAAoB;QAAEI;OAAtB,CAAd,EAA2C;;;;UAIrC;QAAEG,IAAF;QAAQhC;UAAW6B,EAAzB;MACAJ,MAAM,CAAC0D,KAAP,CAAa;QAAE2F,IAAI,EAAE,aAAR;QAAuB9I,IAAvB;QAA6BhC,MAA7B;QAAqCD;OAAlD;KAlCF;;;CAhZG;;;;;ICRMiS,UAAU,uBAClBL,iBADkB,MAElBC,cAFkB,MAGlBkD,mBAHkB,MAIlBS,cAJkB,CAAhB;;;;;ACYP;;;;AAIA,IAAayB,YAAY,GAAG;MACpBvV,MAAM,GAAW;IACrB2C,QAAQ,EAAE,EADW;IAErB0B,UAAU,EAAE,EAFS;IAGrBhE,SAAS,EAAE,IAHU;IAIrB0D,KAAK,EAAE,IAJc;IAKrBhB,QAAQ,EAAE,MAAM,KALK;IAMrBY,MAAM,EAAE,MAAM,KANO;IAOrBE,QAAQ,EAAE,QAPW;IASrBH,KAAK,EAAGyF,EAAD;WACA,IAAMtB,GAAX,IAAkB/H,MAAM,CAACkI,QAAP,CAAgBhI,MAAhB,CAAlB,EAA2C;QACzCwO,OAAO,CAACtF,SAAR,CAAkBrB,GAAlB,EAAuBsB,EAAvB;;;WAGG,IAAMtB,IAAX,IAAkB/H,MAAM,CAACwI,SAAP,CAAiBtI,MAAjB,CAAlB,EAA4C;QAC1CyO,QAAQ,CAACvF,SAAT,CAAmBrB,IAAnB,EAAwBsB,EAAxB;;;WAGG,IAAMtB,KAAX,IAAkB/H,MAAM,CAACkJ,SAAP,CAAiBhJ,MAAjB,CAAlB,EAA4C;QAC1CyP,QAAQ,CAACvG,SAAT,CAAmBrB,KAAnB,EAAwBsB,EAAxB;;;UAGIpC,GAAG,GAAG,IAAIqB,GAAJ,EAAZ;UACMoN,UAAU,GAAW,EAA3B;;UAEMrN,GAAG,GAAI5H,IAAD;YACNA,IAAJ,EAAU;cACFU,GAAG,GAAGV,IAAI,CAACkM,IAAL,CAAU,GAAV,CAAZ;;cAEI,CAAC1F,GAAG,CAACoF,GAAJ,CAAQlL,GAAR,CAAL,EAAmB;YACjB8F,GAAG,CAACoB,GAAJ,CAAQlH,GAAR;YACAuU,UAAU,CAACxQ,IAAX,CAAgBzE,IAAhB;;;OANN;;UAWMkV,aAAa,GAAGjY,WAAW,CAACoH,GAAZ,CAAgB5E,MAAhB,KAA2B,EAAjD;UACM0V,aAAa,GAAG9O,aAAa,CAACuC,EAAD,CAAnC;;WAEK,IAAM5I,IAAX,IAAmBkV,aAAnB,EAAkC;YAC1BhM,OAAO,GAAG3I,IAAI,CAACoI,SAAL,CAAe3I,IAAf,EAAqB4I,EAArB,CAAhB;QACAhB,GAAG,CAACsB,OAAD,CAAH;;;WAGG,IAAMlJ,KAAX,IAAmBmV,aAAnB,EAAkC;QAChCvN,GAAG,CAAC5H,KAAD,CAAH;;;MAGF/C,WAAW,CAACuJ,GAAZ,CAAgB/G,MAAhB,EAAwBwV,UAAxB;MACA1V,MAAM,CAACoJ,SAAP,CAAiBlJ,MAAjB,EAAyBmJ,EAAzB;MACAnJ,MAAM,CAACqE,UAAP,CAAkBW,IAAlB,CAAuBmE,EAAvB;MACArJ,MAAM,CAAC4G,SAAP,CAAiB1G,MAAjB;;UAGImJ,EAAE,CAACE,IAAH,KAAY,eAAhB,EAAiC;QAC/BrJ,MAAM,CAAC+D,KAAP,GAAe,IAAf;;;UAGE,CAACrG,QAAQ,CAACkH,GAAT,CAAa5E,MAAb,CAAL,EAA2B;QACzBtC,QAAQ,CAACqJ,GAAT,CAAa/G,MAAb,EAAqB,IAArB;QAEA2V,OAAO,CAACC,OAAR,GAAkBC,IAAlB,CAAuB;UACrBnY,QAAQ,CAACqJ,GAAT,CAAa/G,MAAb,EAAqB,KAArB;UACAA,MAAM,CAAC6D,QAAP;UACA7D,MAAM,CAACqE,UAAP,GAAoB,EAApB;SAHF;;KA7DiB;IAqErBrD,OAAO,EAAE,CAACC,GAAD,EAAcC,KAAd;UACD;QAAEb;UAAcL,MAAtB;;UAEIK,SAAJ,EAAe;YACT2D,KAAK,CAACiB,UAAN,CAAiB5E,SAAjB,CAAJ,EAAiC;UAC/BkQ,UAAU,CAACiB,QAAX,CACExR,MADF,EAEE;aAAGiB,GAAD,GAAOC;WAFX,EAGE;YAAEZ,KAAK,EAAEM,IAAI,CAACC,MAAd;YAAsB4Q,KAAK,EAAE;WAH/B;SADF,MAMO;cACC1N,KAAK,uBACLjE,MAAM,CAACiE,KAAP,CAAa/D,MAAb,KAAwB,EADnB;aAERiB,GAAD,GAAOC;YAFT;;UAKAlB,MAAM,CAAC+D,KAAP,GAAeA,KAAf;UACA/D,MAAM,CAAC6D,QAAP;;;KAtFe;IA2FrB7B,cAAc,EAAGC,IAAD;UACR;QAAE5B;UAAcL,MAAtB;;UAEIK,SAAS,IAAI2D,KAAK,CAAC0G,WAAN,CAAkBrK,SAAlB,CAAjB,EAA+C;QAC7CkQ,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;UAAEiC,IAAF;UAAQzB,OAAO,EAAE;SAA3C;;KA/FiB;IAmGrB0B,aAAa,EAAGD,IAAD;UACP;QAAE5B;UAAcL,MAAtB;;UAEIK,SAAS,IAAI2D,KAAK,CAAC0G,WAAN,CAAkBrK,SAAlB,CAAjB,EAA+C;QAC7CkQ,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB,EAA0B;UAAEiC;SAA5B;;KAvGiB;IA2GrBE,cAAc,EAAE;UACR;QAAE9B;UAAcL,MAAtB;;UAEIK,SAAS,IAAI2D,KAAK,CAACiB,UAAN,CAAiB5E,SAAjB,CAAjB,EAA8C;QAC5CkQ,UAAU,CAACtI,MAAX,CAAkBjI,MAAlB;;KA/GiB;IAmHrB8V,WAAW,EAAE;UACL;QAAEzV;UAAcL,MAAtB;;UAEIK,SAAS,IAAI2D,KAAK,CAACiB,UAAN,CAAiB5E,SAAjB,CAAjB,EAA8C;eACrCmC,IAAI,CAACD,QAAL,CAAcvC,MAAd,EAAsBK,SAAtB,CAAP;;;aAEK,EAAP;KAzHmB;IA4HrB6C,WAAW,EAAE;MACXqN,UAAU,CAACG,UAAX,CAAsB1Q,MAAtB,EAA8B;QAAE8R,MAAM,EAAE;OAAxC;KA7HmB;IAgIrB3O,cAAc,EAAGZ,QAAD;MACdgO,UAAU,CAACpN,cAAX,CAA0BnD,MAA1B,EAAkCuC,QAAlC;KAjImB;IAoIrBa,UAAU,EAAGd,IAAD;MACViO,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BsC,IAA/B;KArImB;IAwIrBe,UAAU,EAAG/E,IAAD;UACJ;QAAE+B,SAAF;QAAa0D;UAAU/D,MAA7B;;UAEIK,SAAJ,EAAe;;;YAGT2D,KAAK,CAAC0G,WAAN,CAAkBrK,SAAlB,CAAJ,EAAkC;cAC1B0V,MAAM,GAAGjW,MAAM,CAACC,KAAP,CAAaC,MAAb,EAAqB;YAClCM,KAAK,EAAEG,CAAC,IAAIX,MAAM,CAACiD,QAAP,CAAgB/C,MAAhB,EAAwBS,CAAxB,CADsB;YAElCN,IAAI,EAAE;WAFO,CAAf;;cAKI4V,MAAJ,EAAY;gBACJ,GAAGvB,UAAH,IAAiBuB,MAAvB;;gBAEIjW,MAAM,CAACwE,KAAP,CAAatE,MAAb,EAAqBK,SAAS,CAACe,MAA/B,EAAuCoT,UAAvC,CAAJ,EAAwD;kBAChDnT,KAAK,GAAGvB,MAAM,CAACqB,KAAP,CAAanB,MAAb,EAAqBwU,UAArB,CAAd;cACAjE,UAAU,CAACmD,YAAX,CAAwB1T,MAAxB,EAAgC;gBAC9BoB,MAAM,EAAEC,KADsB;gBAE9BE,KAAK,EAAEF;eAFT;;;;;YAQF0C,KAAJ,EAAW;cACHzB,IAAI;YAAKhE;aAASyF,KAAd,CAAV;;UACAwM,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BsC,IAA/B;SAFF,MAGO;UACLiO,UAAU,CAAClN,UAAX,CAAsBrD,MAAtB,EAA8B1B,IAA9B;;;QAGF0B,MAAM,CAAC+D,KAAP,GAAe,IAAf;;KAxKiB;IA4KrBH,aAAa,EAAGwD,KAAD;UACP,CAAC9E,IAAD,EAAO/B,IAAP,IAAe6G,KAArB;;UAGIxG,IAAI,CAACC,MAAL,CAAYyB,IAAZ,CAAJ,EAAuB;;;;;UAKnBgB,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,KAA2BA,IAAI,CAACK,QAAL,CAAc1D,MAAd,KAAyB,CAAxD,EAA2D;YACnDuM,KAAK,GAAG;UAAElN,IAAI,EAAE;SAAtB;QACAiS,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BwL,KAA/B,EAAsC;UACpCpL,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAY,CAAZ,CADgC;UAEpCzL,KAAK,EAAE;SAFT;;;;;UAQI8V,iBAAiB,GAAGlW,MAAM,CAAC0D,QAAP,CAAgBlB,IAAhB,IACtB,KADsB,GAEtBgB,OAAO,CAACC,SAAR,CAAkBjB,IAAlB,MACCtC,MAAM,CAAC+C,QAAP,CAAgBT,IAAhB,KACCA,IAAI,CAACK,QAAL,CAAc1D,MAAd,KAAyB,CAD1B,IAEC2B,IAAI,CAACC,MAAL,CAAYyB,IAAI,CAACK,QAAL,CAAc,CAAd,CAAZ,CAFD,IAGC3C,MAAM,CAAC+C,QAAP,CAAgBT,IAAI,CAACK,QAAL,CAAc,CAAd,CAAhB,CAJF,CAFJ;;;UAUIlC,CAAC,GAAG,CAAR;;WAEK,IAAIvB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGoD,IAAI,CAACK,QAAL,CAAc1D,MAAlC,EAA0CC,CAAC,IAAIuB,CAAC,EAAhD,EAAoD;YAC5C+K,MAAK,GAAGlJ,IAAI,CAACK,QAAL,CAAczD,CAAd,CAAd;YACMV,IAAI,GAAG8D,IAAI,CAACK,QAAL,CAAczD,CAAC,GAAG,CAAlB,CAAb;YACM+W,MAAM,GAAG/W,CAAC,KAAKoD,IAAI,CAACK,QAAL,CAAc1D,MAAd,GAAuB,CAA5C;YACMiX,cAAc,GAClBtV,IAAI,CAACC,MAAL,CAAY2K,MAAZ,KACClI,OAAO,CAACC,SAAR,CAAkBiI,MAAlB,KAA4BxL,MAAM,CAAC+C,QAAP,CAAgByI,MAAhB,CAF/B,CAJkD;;;;;YAY9C0K,cAAc,KAAKF,iBAAvB,EAA0C;UACxCzF,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;YAAEI,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAZ,CAAN;YAAsBP,KAAK,EAAE;WAA5D;UACAO,CAAC;SAFH,MAGO,IAAI6C,OAAO,CAACC,SAAR,CAAkBiI,MAAlB,CAAJ,EAA8B;;cAE/BxL,MAAM,CAAC+C,QAAP,CAAgByI,MAAhB,CAAJ,EAA4B;gBACtBhN,IAAI,IAAI,IAAR,IAAgB,CAACoC,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAArB,EAAwC;kBAChC2X,QAAQ,GAAG;gBAAE7X,IAAI,EAAE;eAAzB;cACAiS,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BmW,QAA/B,EAAyC;gBACvC/V,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAZ,CADmC;gBAEvCP,KAAK,EAAE;eAFT;cAIAO,CAAC;aANH,MAOO,IAAIwV,MAAJ,EAAY;kBACXE,SAAQ,GAAG;gBAAE7X,IAAI,EAAE;eAAzB;cACAiS,UAAU,CAACH,WAAX,CAAuBpQ,MAAvB,EAA+BmW,SAA/B,EAAyC;gBACvC/V,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAC,GAAG,CAAhB,CADmC;gBAEvCP,KAAK,EAAE;eAFT;cAIAO,CAAC;;;SAhBA,MAmBA;;cAEDjC,IAAI,IAAI,IAAR,IAAgBoC,IAAI,CAACC,MAAL,CAAYrC,IAAZ,CAApB,EAAuC;gBACjCoC,IAAI,CAACG,MAAL,CAAYyK,MAAZ,EAAmBhN,IAAnB,EAAyB;cAAEkR,KAAK,EAAE;aAAlC,CAAJ,EAA+C;cAC7Ca,UAAU,CAACS,UAAX,CAAsBhR,MAAtB,EAA8B;gBAAEI,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAZ,CAAN;gBAAsBP,KAAK,EAAE;eAA3D;cACAO,CAAC;aAFH,MAGO,IAAIjC,IAAI,CAACF,IAAL,KAAc,EAAlB,EAAsB;cAC3BiS,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;gBAC7BI,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAC,GAAG,CAAhB,CADyB;gBAE7BP,KAAK,EAAE;eAFT;cAIAO,CAAC;aALI,MAMA,IAAIwV,MAAM,IAAIzK,MAAK,CAAClN,IAAN,KAAe,EAA7B,EAAiC;cACtCiS,UAAU,CAACO,WAAX,CAAuB9Q,MAAvB,EAA+B;gBAC7BI,EAAE,EAAEG,IAAI,CAACoL,MAAL,CAAYlL,CAAZ,CADyB;gBAE7BP,KAAK,EAAE;eAFT;cAIAO,CAAC;;;;;KA9PU;IAqQrBqD,UAAU,EAAG7C,GAAD;UACJ;QAAEZ;UAAcL,MAAtB;;UAEIK,SAAJ,EAAe;YACT2D,KAAK,CAACiB,UAAN,CAAiB5E,SAAjB,CAAJ,EAAiC;UAC/BkQ,UAAU,CAACoC,UAAX,CAAsB3S,MAAtB,EAA8BiB,GAA9B,EAAmC;YACjCX,KAAK,EAAEM,IAAI,CAACC,MADqB;YAEjC4Q,KAAK,EAAE;WAFT;SADF,MAKO;cACC1N,KAAK,uBAASjE,MAAM,CAACiE,KAAP,CAAa/D,MAAb,KAAwB,EAAjC,CAAX;;iBACO+D,KAAK,CAAC9C,GAAD,CAAZ;UACAjB,MAAM,CAAC+D,KAAP,GAAeA,KAAf;UACA/D,MAAM,CAAC6D,QAAP;;;;GAlRR;SAwRO7D,MAAP;CAzRK;;;;;AAgSP,IAAM4G,aAAa,GAAIuC,EAAD;UACZA,EAAE,CAACE,IAAX;SACO,aAAL;SACK,aAAL;SACK,UAAL;;YACQ;UAAE9I;YAAS4I,EAAjB;eACOrI,IAAI,CAACH,MAAL,CAAYJ,IAAZ,CAAP;;;SAGG,aAAL;;YACQ;UAAE+B,IAAF;UAAQ/B,IAAI,EAAJA;YAAS4I,EAAvB;YACMxI,MAAM,GAAGG,IAAI,CAACH,MAAL,CAAYJ,MAAZ,CAAf;YACMuL,WAAW,GAAGlL,IAAI,CAACC,MAAL,CAAYyB,IAAZ,IAChB,EADgB,GAEhBwE,KAAK,CAACrB,IAAN,CAAWjD,IAAI,CAAC0C,KAAL,CAAW5C,IAAX,CAAX,EAA6B;cAAC,GAAG5B,CAAH,CAAD;iBAAWH,MAAI,CAACoL,MAAL,CAAYjL,CAAZ,CAAX;SAA7B,CAFJ;eAIO,CAAC,GAAGC,MAAJ,EAAY,GAAGmL,WAAf,CAAP;;;SAGG,YAAL;;YACQ;UAAEvL,IAAI,EAAJA;YAAS4I,EAAjB;YACMoC,SAAS,GAAGzK,IAAI,CAACyK,SAAL,CAAehL,MAAf,CAAlB;YACM6V,YAAY,GAAGtV,IAAI,CAACqE,QAAL,CAAc5E,MAAd,CAArB;eACO,CAAC,GAAGgL,SAAJ,EAAe6K,YAAf,CAAP;;;SAGG,WAAL;;YACQ;UAAE7V,IAAI,EAAJA,MAAF;UAAQkJ;YAAYN,EAA1B;;YAEIrI,IAAI,CAACC,MAAL,CAAYR,MAAZ,EAAkBkJ,OAAlB,CAAJ,EAAgC;iBACvB,EAAP;;;YAGI4M,YAAY,GAAW,EAA7B;YACMC,YAAY,GAAW,EAA7B;;aAEK,IAAMjL,QAAX,IAAuBvK,IAAI,CAACyK,SAAL,CAAehL,MAAf,CAAvB,EAA6C;cACrCG,CAAC,GAAGI,IAAI,CAACoI,SAAL,CAAemC,QAAf,EAAyBlC,EAAzB,CAAV;UACAkN,YAAY,CAACrR,IAAb,CAAkBtE,CAAlB;;;aAGG,IAAM2K,SAAX,IAAuBvK,IAAI,CAACyK,SAAL,CAAe9B,OAAf,CAAvB,EAAgD;cACxC/I,EAAC,GAAGI,IAAI,CAACoI,SAAL,CAAemC,SAAf,EAAyBlC,EAAzB,CAAV;;UACAmN,YAAY,CAACtR,IAAb,CAAkBtE,EAAlB;;;eAGK,CAAC,GAAG2V,YAAJ,EAAkB,GAAGC,YAArB,CAAP;;;SAGG,aAAL;;YACQ;UAAE/V,IAAI,EAAJA;YAAS4I,EAAjB;;YACMoC,UAAS,GAAGzK,IAAI,CAACyK,SAAL,CAAehL,MAAf,CAAlB;;eACO,CAAC,GAAGgL,UAAJ,CAAP;;;SAGG,YAAL;;YACQ;UAAEhL,IAAI,EAAJA;YAAS4I,EAAjB;;YACMxI,OAAM,GAAGG,IAAI,CAACH,MAAL,CAAYJ,MAAZ,CAAf;;YACMgW,QAAQ,GAAGzV,IAAI,CAAClB,IAAL,CAAUW,MAAV,CAAjB;eACO,CAAC,GAAGI,OAAJ,EAAY4V,QAAZ,CAAP;;;;;eAIO,EAAP;;;CA/DN;;;;;;;;;;;;;;;;;;"}