@mx-space/cli 0.1.1 → 0.2.1

package/dist/{LexicalUtils.dev-DiUpsXE8.mjs → LexicalUtils.dev-DRRDyAlS.mjs}

@@ -1,5 +1,5 @@
-import { A as $getCollapsedCaretRange, B as $getSiblingCaret, C as $getCaretInDirection, D as $getChildCaret, Gn as isHTMLElement, K as $isChildCaret, Kn as isInlineDomNode, L as $getPreviousSelection, M as $getEditorDOMRenderConfig, Pn as getDOMTextNode, Qn as removeClassNamesFromElement, R as $getRoot, S as $getAdjacentSiblingOrParentSiblingCaret, St as $splitNode, T as $getCaretRangeInDirection, Tn as addClassNamesToElement, V as $getState, Wn as isHTMLAnchorElement, Xn as mergeRegister, Y as $isElementNode, Yn as makeStepwiseIterator, a as $cloneWithProperties, b as $getAdjacentChildCaret, bt as $setState, dt as $normalizeCaret, f as $createParagraphNode, ht as $rewindSiblingCaret, i as $caretRangeFromSelection, j as $getEditor, k as $getChildCaretOrSelf, lt as $isTextPointCaret, mt as $removeTextFromCaretRange, ot as $isSiblingCaret, r as $caretFromPoint, rt as $isRangeSelection, vt as $setSelection, w as $getCaretRange, xt as $splitAtPointCaretNext, y as $findMatchingParent, yt as $setSelectionFromCaretRange, z as $getSelection, zn as isBlockDomNode } from "./Lexical.node-gYNDt_p9.mjs";
-import { o as createRectsFromDOMRange } from "./LexicalSelection.node-Di7GwBCZ.mjs";
+import { A as $getCollapsedCaretRange, B as $getSiblingCaret, C as $getCaretInDirection, D as $getChildCaret, Gn as isHTMLElement, K as $isChildCaret, Kn as isInlineDomNode, L as $getPreviousSelection, M as $getEditorDOMRenderConfig, Pn as getDOMTextNode, Qn as removeClassNamesFromElement, R as $getRoot, S as $getAdjacentSiblingOrParentSiblingCaret, St as $splitNode, T as $getCaretRangeInDirection, Tn as addClassNamesToElement, V as $getState, Wn as isHTMLAnchorElement, Xn as mergeRegister, Y as $isElementNode, Yn as makeStepwiseIterator, a as $cloneWithProperties, b as $getAdjacentChildCaret, bt as $setState, dt as $normalizeCaret, f as $createParagraphNode, ht as $rewindSiblingCaret, i as $caretRangeFromSelection, j as $getEditor, k as $getChildCaretOrSelf, lt as $isTextPointCaret, mt as $removeTextFromCaretRange, ot as $isSiblingCaret, r as $caretFromPoint, rt as $isRangeSelection, vt as $setSelection, w as $getCaretRange, xt as $splitAtPointCaretNext, y as $findMatchingParent, yt as $setSelectionFromCaretRange, z as $getSelection, zn as isBlockDomNode } from "./Lexical.node-BR9e7Cyk.mjs";
+import { o as createRectsFromDOMRange } from "./LexicalSelection.node-CQ8iTYsz.mjs";
 //#region ../../node_modules/.pnpm/@lexical+utils@0.44.0/node_modules/@lexical/utils/LexicalUtils.dev.mjs
 /**
 * Copyright (c) Meta Platforms, Inc. and affiliates.
@@ -847,4 +847,4 @@ function makeStateWrapper(stateConfig) {
 //#endregion
 export { $descendantsMatching, $dfs, $dfsIterator, $filter, $findMatchingParent, $firstToLastIterator, $getAdjacentCaret, $getAdjacentSiblingOrParentSiblingCaret, $getDepth, $getNearestBlockElementAncestorOrThrow, $getNearestNodeOfType, $getNextRightPreorderNode, $getNextSiblingOrParentSibling, $handleIndentAndOutdent, $insertFirst, $insertNodeIntoLeaf, $insertNodeToNearestRoot, $insertNodeToNearestRootAtCaret, $isEditorIsNestedEditor, $lastToFirstIterator, $restoreEditorState, $reverseDfs, $reverseDfsIterator, $splitNode, $unwrapAndFilterDescendants, $unwrapNode, $wrapNodeInElement, CAN_USE_BEFORE_INPUT, CAN_USE_DOM, IS_ANDROID, IS_ANDROID_CHROME, IS_APPLE, IS_APPLE_WEBKIT, IS_CHROME, IS_FIREFOX, IS_IOS, IS_SAFARI, addClassNamesToElement, calculateZoomLevel, isBlockDomNode, isHTMLAnchorElement, isHTMLElement, isInlineDomNode, isMimeType, makeStateWrapper, markSelection, mediaFileReader, mergeRegister, objectKlassEquals, mlcPositionNodeOnRange as positionNodeOnRange, registerNestedElementResolver, removeClassNamesFromElement, selectionAlwaysOnDisplay };
 
-//# sourceMappingURL=LexicalUtils.dev-DiUpsXE8.mjs.map
+//# sourceMappingURL=LexicalUtils.dev-DRRDyAlS.mjs.map

package/dist/{LexicalUtils.dev-DiUpsXE8.mjs.map → LexicalUtils.dev-DRRDyAlS.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"LexicalUtils.dev-DiUpsXE8.mjs","names":[],"sources":["../../../node_modules/.pnpm/@lexical+utils@0.44.0/node_modules/@lexical/utils/LexicalUtils.dev.mjs"],"sourcesContent":["/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nimport { isHTMLElement, mergeRegister, $getSelection, $isRangeSelection, $isElementNode, getDOMTextNode, $getEditor, $getEditorDOMRenderConfig, $getChildCaret, $findMatchingParent, $getChildCaretOrSelf, $getSiblingCaret, $getAdjacentSiblingOrParentSiblingCaret, $caretRangeFromSelection, $getCaretRangeInDirection, $removeTextFromCaretRange, $isTextPointCaret, $splitAtPointCaretNext, $setSelectionFromCaretRange, $getCaretRange, $getPreviousSelection, $caretFromPoint, $getRoot, $createParagraphNode, $getAdjacentChildCaret, $isChildCaret, $normalizeCaret, $getCollapsedCaretRange, $getCaretInDirection, $isSiblingCaret, $rewindSiblingCaret, $cloneWithProperties, $setSelection, makeStepwiseIterator, $getState, $setState } from 'lexical';\nexport { $findMatchingParent, $getAdjacentSiblingOrParentSiblingCaret, $splitNode, addClassNamesToElement, isBlockDomNode, isHTMLAnchorElement, isHTMLElement, isInlineDomNode, mergeRegister, removeClassNamesFromElement } from 'lexical';\nimport { createRectsFromDOMRange } from '@lexical/selection';\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n// Do not require this module directly! Use normal `invariant` calls.\n\nfunction formatDevErrorMessage(message) {\n  throw new Error(message);\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nconst CAN_USE_DOM$1 = typeof window !== 'undefined' && typeof window.document !== 'undefined' && typeof window.document.createElement !== 'undefined';\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nconst documentMode = CAN_USE_DOM$1 && 'documentMode' in document ? document.documentMode : null;\nconst IS_APPLE$1 = CAN_USE_DOM$1 && /Mac|iPod|iPhone|iPad/.test(navigator.platform);\nconst IS_FIREFOX$1 = CAN_USE_DOM$1 && /^(?!.*Seamonkey)(?=.*Firefox).*/i.test(navigator.userAgent);\nconst CAN_USE_BEFORE_INPUT$1 = CAN_USE_DOM$1 && 'InputEvent' in window && !documentMode ? 'getTargetRanges' in new window.InputEvent('input') : false;\nconst IS_IOS$1 = CAN_USE_DOM$1 && /iPad|iPhone|iPod/.test(navigator.userAgent) && !window.MSStream;\nconst IS_ANDROID$1 = CAN_USE_DOM$1 && /Android/.test(navigator.userAgent);\n\n// Exclude Android — Android WebView's UA contains \"Version/X.X ... Safari/537.36\"\n// which falsely matches the Safari regex, activating wrong composition code paths.\nconst IS_SAFARI$1 = CAN_USE_DOM$1 && /Version\\/[\\d.]+.*Safari/.test(navigator.userAgent) && !IS_ANDROID$1;\n\n// Keep these in case we need to use them in the future.\n// export const IS_WINDOWS: boolean = CAN_USE_DOM && /Win/.test(navigator.platform);\nconst IS_CHROME$1 = CAN_USE_DOM$1 && /^(?=.*Chrome).*/i.test(navigator.userAgent);\n// export const canUseTextInputEvent: boolean = CAN_USE_DOM && 'TextEvent' in window && !documentMode;\n\nconst IS_ANDROID_CHROME$1 = CAN_USE_DOM$1 && IS_ANDROID$1 && IS_CHROME$1;\nconst IS_APPLE_WEBKIT$1 = CAN_USE_DOM$1 && /AppleWebKit\\/[\\d.]+/.test(navigator.userAgent) && IS_APPLE$1 && !IS_CHROME$1;\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction px(value) {\n  return `${value}px`;\n}\n\nconst mutationObserverConfig = {\n  attributes: true,\n  characterData: true,\n  childList: true,\n  subtree: true\n};\nfunction prependDOMNode(parent, node) {\n  parent.insertBefore(node, parent.firstChild);\n}\n\n/**\n * Place one or multiple newly created Nodes at the passed Range's position.\n * Multiple nodes will only be created when the Range spans multiple lines (aka\n * client rects).\n *\n * This function can come particularly useful to highlight particular parts of\n * the text without interfering with the EditorState, that will often replicate\n * the state across collab and clipboard.\n *\n * This function accounts for DOM updates which can modify the passed Range.\n * Hence, the function return to remove the listener.\n */\nfunction mlcPositionNodeOnRange(editor, range, onReposition) {\n  let rootDOMNode = null;\n  let parentDOMNode = null;\n  let observer = null;\n  let lastNodes = [];\n  const wrapperNode = document.createElement('div');\n  wrapperNode.style.position = 'relative';\n  function position() {\n    if (!(rootDOMNode !== null)) {\n      formatDevErrorMessage(`Unexpected null rootDOMNode`);\n    }\n    if (!(parentDOMNode !== null)) {\n      formatDevErrorMessage(`Unexpected null parentDOMNode`);\n    }\n    const {\n      left: parentLeft,\n      top: parentTop\n    } = parentDOMNode.getBoundingClientRect();\n    const rects = createRectsFromDOMRange(editor, range);\n    if (!wrapperNode.isConnected) {\n      prependDOMNode(parentDOMNode, wrapperNode);\n    }\n    let hasRepositioned = false;\n    for (let i = 0; i < rects.length; i++) {\n      const rect = rects[i];\n      // Try to reuse the previously created Node when possible, no need to\n      // remove/create on the most common case reposition case\n      const rectNode = lastNodes[i] || document.createElement('div');\n      const rectNodeStyle = rectNode.style;\n      if (rectNodeStyle.position !== 'absolute') {\n        rectNodeStyle.position = 'absolute';\n        hasRepositioned = true;\n      }\n      const left = px(rect.left - parentLeft);\n      if (rectNodeStyle.left !== left) {\n        rectNodeStyle.left = left;\n        hasRepositioned = true;\n      }\n      const top = px(rect.top - parentTop);\n      if (rectNodeStyle.top !== top) {\n        rectNode.style.top = top;\n        hasRepositioned = true;\n      }\n      const width = px(rect.width);\n      if (rectNodeStyle.width !== width) {\n        rectNode.style.width = width;\n        hasRepositioned = true;\n      }\n      const height = px(rect.height);\n      if (rectNodeStyle.height !== height) {\n        rectNode.style.height = height;\n        hasRepositioned = true;\n      }\n      if (rectNode.parentNode !== wrapperNode) {\n        wrapperNode.append(rectNode);\n        hasRepositioned = true;\n      }\n      lastNodes[i] = rectNode;\n    }\n    while (lastNodes.length > rects.length) {\n      lastNodes.pop();\n    }\n    if (hasRepositioned) {\n      onReposition(lastNodes);\n    }\n  }\n  function stop() {\n    parentDOMNode = null;\n    rootDOMNode = null;\n    if (observer !== null) {\n      observer.disconnect();\n    }\n    observer = null;\n    wrapperNode.remove();\n    for (const node of lastNodes) {\n      node.remove();\n    }\n    lastNodes = [];\n  }\n  function restart() {\n    const currentRootDOMNode = editor.getRootElement();\n    if (currentRootDOMNode === null) {\n      return stop();\n    }\n    const currentParentDOMNode = currentRootDOMNode.parentElement;\n    if (!isHTMLElement(currentParentDOMNode)) {\n      return stop();\n    }\n    stop();\n    rootDOMNode = currentRootDOMNode;\n    parentDOMNode = currentParentDOMNode;\n    observer = new MutationObserver(mutations => {\n      const nextRootDOMNode = editor.getRootElement();\n      const nextParentDOMNode = nextRootDOMNode && nextRootDOMNode.parentElement;\n      if (nextRootDOMNode !== rootDOMNode || nextParentDOMNode !== parentDOMNode) {\n        return restart();\n      }\n      for (const mutation of mutations) {\n        if (!wrapperNode.contains(mutation.target)) {\n          // TODO throttle\n          return position();\n        }\n      }\n    });\n    observer.observe(currentParentDOMNode, mutationObserverConfig);\n    position();\n  }\n  const removeRootListener = editor.registerRootListener(restart);\n  return () => {\n    removeRootListener();\n    stop();\n  };\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction $getOrderedSelectionPoints(selection) {\n  const points = selection.getStartEndPoints();\n  return selection.isBackward() ? [points[1], points[0]] : points;\n}\nfunction $rangeTargetFromPoint(point, node, dom) {\n  if (point.type === 'text' || !$isElementNode(node)) {\n    const textDOM = getDOMTextNode(dom) || dom;\n    return [textDOM, point.offset];\n  } else {\n    const editor = $getEditor();\n    const slot = $getEditorDOMRenderConfig(editor).$getDOMSlot(node, dom, editor);\n    return [slot.element, slot.getFirstChildOffset() + point.offset];\n  }\n}\nfunction $rangeFromPoints(editor, start, startNode, startDOM, end, endNode, endDOM) {\n  const editorDocument = editor._window ? editor._window.document : document;\n  const range = editorDocument.createRange();\n  range.setStart(...$rangeTargetFromPoint(start, startNode, startDOM));\n  range.setEnd(...$rangeTargetFromPoint(end, endNode, endDOM));\n  return range;\n}\nfunction defaultOnReposition(domNodes) {\n  for (const domNode of domNodes) {\n    const domNodeStyle = domNode.style;\n    if (domNodeStyle.background !== 'Highlight') {\n      domNodeStyle.background = 'Highlight';\n    }\n    if (domNodeStyle.color !== 'HighlightText') {\n      domNodeStyle.color = 'HighlightText';\n    }\n    if (domNodeStyle.marginTop !== px(-1.5)) {\n      domNodeStyle.marginTop = px(-1.5);\n    }\n    if (domNodeStyle.paddingTop !== px(4)) {\n      domNodeStyle.paddingTop = px(4);\n    }\n    if (domNodeStyle.paddingBottom !== px(0)) {\n      domNodeStyle.paddingBottom = px(0);\n    }\n  }\n}\n\n/**\n * Place one or multiple newly created Nodes at the current selection. Multiple\n * nodes will only be created when the selection spans multiple lines (aka\n * client rects).\n *\n * This function can come useful when you want to show the selection but the\n * editor has been focused away.\n */\nfunction markSelection(editor, onReposition = defaultOnReposition) {\n  let previousAnchorNode = null;\n  let previousAnchorNodeDOM = null;\n  let previousAnchorOffset = null;\n  let previousFocusNode = null;\n  let previousFocusNodeDOM = null;\n  let previousFocusOffset = null;\n  let removeRangeListener = () => {};\n  function compute(editorState) {\n    editorState.read(() => {\n      const selection = $getSelection();\n      if (!$isRangeSelection(selection)) {\n        // TODO\n        previousAnchorNode = null;\n        previousAnchorOffset = null;\n        previousFocusNode = null;\n        previousFocusOffset = null;\n        removeRangeListener();\n        removeRangeListener = () => {};\n        return;\n      }\n      const [start, end] = $getOrderedSelectionPoints(selection);\n      const currentStartNode = start.getNode();\n      const currentStartNodeKey = currentStartNode.getKey();\n      const currentStartOffset = start.offset;\n      const currentEndNode = end.getNode();\n      const currentEndNodeKey = currentEndNode.getKey();\n      const currentEndOffset = end.offset;\n      const currentStartNodeDOM = editor.getElementByKey(currentStartNodeKey);\n      const currentEndNodeDOM = editor.getElementByKey(currentEndNodeKey);\n      const differentStartDOM = previousAnchorNode === null || currentStartNodeDOM !== previousAnchorNodeDOM || currentStartOffset !== previousAnchorOffset || currentStartNodeKey !== previousAnchorNode.getKey();\n      const differentEndDOM = previousFocusNode === null || currentEndNodeDOM !== previousFocusNodeDOM || currentEndOffset !== previousFocusOffset || currentEndNodeKey !== previousFocusNode.getKey();\n      if ((differentStartDOM || differentEndDOM) && currentStartNodeDOM !== null && currentEndNodeDOM !== null) {\n        const range = $rangeFromPoints(editor, start, currentStartNode, currentStartNodeDOM, end, currentEndNode, currentEndNodeDOM);\n        removeRangeListener();\n        removeRangeListener = mlcPositionNodeOnRange(editor, range, onReposition);\n      }\n      previousAnchorNode = currentStartNode;\n      previousAnchorNodeDOM = currentStartNodeDOM;\n      previousAnchorOffset = currentStartOffset;\n      previousFocusNode = currentEndNode;\n      previousFocusNodeDOM = currentEndNodeDOM;\n      previousFocusOffset = currentEndOffset;\n    });\n  }\n  compute(editor.getEditorState());\n  return mergeRegister(editor.registerUpdateListener(({\n    editorState\n  }) => compute(editorState)), () => {\n    removeRangeListener();\n  });\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction selectionAlwaysOnDisplay(editor, onReposition) {\n  let removeSelectionMark = null;\n  const onSelectionChange = () => {\n    const domSelection = getSelection();\n    const domAnchorNode = domSelection && domSelection.anchorNode;\n    const editorRootElement = editor.getRootElement();\n    const isSelectionInsideEditor = domAnchorNode !== null && editorRootElement !== null && editorRootElement.contains(domAnchorNode);\n    if (isSelectionInsideEditor) {\n      if (removeSelectionMark !== null) {\n        removeSelectionMark();\n        removeSelectionMark = null;\n      }\n    } else {\n      if (removeSelectionMark === null) {\n        removeSelectionMark = markSelection(editor, onReposition);\n      }\n    }\n  };\n  return editor.registerRootListener(rootElement => {\n    if (rootElement) {\n      const document = rootElement.ownerDocument;\n      document.addEventListener('selectionchange', onSelectionChange);\n      onSelectionChange();\n      return () => {\n        if (removeSelectionMark !== null) {\n          removeSelectionMark();\n        }\n        document.removeEventListener('selectionchange', onSelectionChange);\n      };\n    }\n  });\n}\n\n// Hotfix to export these with inlined types #5918\nconst CAN_USE_BEFORE_INPUT = CAN_USE_BEFORE_INPUT$1;\nconst CAN_USE_DOM = CAN_USE_DOM$1;\nconst IS_ANDROID = IS_ANDROID$1;\nconst IS_ANDROID_CHROME = IS_ANDROID_CHROME$1;\nconst IS_APPLE = IS_APPLE$1;\nconst IS_APPLE_WEBKIT = IS_APPLE_WEBKIT$1;\nconst IS_CHROME = IS_CHROME$1;\nconst IS_FIREFOX = IS_FIREFOX$1;\nconst IS_IOS = IS_IOS$1;\nconst IS_SAFARI = IS_SAFARI$1;\n\n/**\n * Returns true if the file type matches the types passed within the acceptableMimeTypes array, false otherwise.\n * The types passed must be strings and are CASE-SENSITIVE.\n * eg. if file is of type 'text' and acceptableMimeTypes = ['TEXT', 'IMAGE'] the function will return false.\n * @param file - The file you want to type check.\n * @param acceptableMimeTypes - An array of strings of types which the file is checked against.\n * @returns true if the file is an acceptable mime type, false otherwise.\n */\nfunction isMimeType(file, acceptableMimeTypes) {\n  for (const acceptableType of acceptableMimeTypes) {\n    if (file.type.startsWith(acceptableType)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Lexical File Reader with:\n *  1. MIME type support\n *  2. batched results (HistoryPlugin compatibility)\n *  3. Order aware (respects the order when multiple Files are passed)\n *\n * const filesResult = await mediaFileReader(files, ['image/']);\n * filesResult.forEach(file => editor.dispatchCommand('INSERT_IMAGE', \\\\{\n *   src: file.result,\n * \\\\}));\n */\nfunction mediaFileReader(files, acceptableMimeTypes) {\n  const filesIterator = files[Symbol.iterator]();\n  return new Promise((resolve, reject) => {\n    const processed = [];\n    const handleNextFile = () => {\n      const {\n        done,\n        value: file\n      } = filesIterator.next();\n      if (done) {\n        return resolve(processed);\n      }\n      const fileReader = new FileReader();\n      fileReader.addEventListener('error', reject);\n      fileReader.addEventListener('load', () => {\n        const result = fileReader.result;\n        if (typeof result === 'string') {\n          processed.push({\n            file,\n            result\n          });\n        }\n        handleNextFile();\n      });\n      if (isMimeType(file, acceptableMimeTypes)) {\n        fileReader.readAsDataURL(file);\n      } else {\n        handleNextFile();\n      }\n    };\n    handleNextFile();\n  });\n}\n/**\n * \"Depth-First Search\" starts at the root/top node of a tree and goes as far as it can down a branch end\n * before backtracking and finding a new path. Consider solving a maze by hugging either wall, moving down a\n * branch until you hit a dead-end (leaf) and backtracking to find the nearest branching path and repeat.\n * It will then return all the nodes found in the search in an array of objects.\n * Preorder traversal is used, meaning that nodes are listed in the order of when they are FIRST encountered.\n * @param startNode - The node to start the search (inclusive), if omitted, it will start at the root node.\n * @param endNode - The node to end the search (inclusive), if omitted, it will find all descendants of the startingNode. If endNode\n * is an ElementNode, it will stop before visiting any of its children.\n * @returns An array of objects of all the nodes found by the search, including their depth into the tree.\n * \\\\{depth: number, node: LexicalNode\\\\} It will always return at least 1 node (the start node).\n */\nfunction $dfs(startNode, endNode) {\n  return Array.from($dfsIterator(startNode, endNode));\n}\n\n/**\n * Get the adjacent caret in the same direction\n *\n * @param caret A caret or null\n * @returns `caret.getAdjacentCaret()` or `null`\n */\nfunction $getAdjacentCaret(caret) {\n  return caret ? caret.getAdjacentCaret() : null;\n}\n\n/**\n * $dfs iterator (right to left). Tree traversal is done on the fly as new values are requested with O(1) memory.\n * @param startNode - The node to start the search, if omitted, it will start at the root node.\n * @param endNode - The node to end the search, if omitted, it will find all descendants of the startingNode.\n * @returns An iterator, each yielded value is a DFSNode. It will always return at least 1 node (the start node).\n */\nfunction $reverseDfs(startNode, endNode) {\n  return Array.from($reverseDfsIterator(startNode, endNode));\n}\n\n/**\n * $dfs iterator (left to right). Tree traversal is done on the fly as new values are requested with O(1) memory.\n * Preorder traversal is used, meaning that nodes are iterated over in the order of when they are FIRST encountered.\n * @param startNode - The node to start the search (inclusive), if omitted, it will start at the root node.\n * @param endNode - The node to end the search (inclusive), if omitted, it will find all descendants of the startingNode.\n * If endNode is an ElementNode, the iterator will end as soon as it reaches the endNode (no children will be visited).\n * @returns An iterator, each yielded value is a DFSNode. It will always return at least 1 node (the start node).\n */\nfunction $dfsIterator(startNode, endNode) {\n  return $dfsCaretIterator('next', startNode, endNode);\n}\nfunction $getEndCaret(startNode, direction) {\n  const rval = $getAdjacentSiblingOrParentSiblingCaret($getSiblingCaret(startNode, direction));\n  return rval && rval[0];\n}\nfunction $dfsCaretIterator(direction, startNode, endNode) {\n  const root = $getRoot();\n  const start = startNode || root;\n  const startCaret = $isElementNode(start) ? $getChildCaret(start, direction) : $getSiblingCaret(start, direction);\n  const startDepth = $getDepth(start);\n  const endCaret = endNode ? $getAdjacentChildCaret($getChildCaretOrSelf($getSiblingCaret(endNode, direction))) || $getEndCaret(endNode, direction) : $getEndCaret(start, direction);\n  let depth = startDepth;\n  return makeStepwiseIterator({\n    hasNext: state => state !== null,\n    initial: startCaret,\n    map: state => ({\n      depth,\n      node: state.origin\n    }),\n    step: state => {\n      if (state.isSameNodeCaret(endCaret)) {\n        return null;\n      }\n      if ($isChildCaret(state)) {\n        depth++;\n      }\n      const rval = $getAdjacentSiblingOrParentSiblingCaret(state);\n      if (!rval || rval[0].isSameNodeCaret(endCaret)) {\n        return null;\n      }\n      depth += rval[1];\n      return rval[0];\n    }\n  });\n}\n\n/**\n * Returns the Node sibling when this exists, otherwise the closest parent sibling. For example\n * R -> P -> T1, T2\n *   -> P2\n * returns T2 for node T1, P2 for node T2, and null for node P2.\n * @param node LexicalNode.\n * @returns An array (tuple) containing the found Lexical node and the depth difference, or null, if this node doesn't exist.\n */\nfunction $getNextSiblingOrParentSibling(node) {\n  const rval = $getAdjacentSiblingOrParentSiblingCaret($getSiblingCaret(node, 'next'));\n  return rval && [rval[0].origin, rval[1]];\n}\nfunction $getDepth(node) {\n  let depth = -1;\n  for (let innerNode = node; innerNode !== null; innerNode = innerNode.getParent()) {\n    depth++;\n  }\n  return depth;\n}\n\n/**\n * Performs a right-to-left preorder tree traversal.\n * From the starting node it goes to the rightmost child, than backtracks to parent and finds new rightmost path.\n * It will return the next node in traversal sequence after the startingNode.\n * The traversal is similar to $dfs functions above, but the nodes are visited right-to-left, not left-to-right.\n * @param startingNode - The node to start the search.\n * @returns The next node in pre-order right to left traversal sequence or `null`, if the node does not exist\n */\nfunction $getNextRightPreorderNode(startingNode) {\n  const startCaret = $getChildCaretOrSelf($getSiblingCaret(startingNode, 'previous'));\n  const next = $getAdjacentSiblingOrParentSiblingCaret(startCaret, 'root');\n  return next && next[0].origin;\n}\n\n/**\n * $dfs iterator (right to left). Tree traversal is done on the fly as new values are requested with O(1) memory.\n * @param startNode - The node to start the search, if omitted, it will start at the root node.\n * @param endNode - The node to end the search, if omitted, it will find all descendants of the startingNode.\n * @returns An iterator, each yielded value is a DFSNode. It will always return at least 1 node (the start node).\n */\nfunction $reverseDfsIterator(startNode, endNode) {\n  return $dfsCaretIterator('previous', startNode, endNode);\n}\n\n/**\n * Takes a node and traverses up its ancestors (toward the root node)\n * in order to find a specific type of node.\n * @param node - the node to begin searching.\n * @param klass - an instance of the type of node to look for.\n * @returns the node of type klass that was passed, or null if none exist.\n */\nfunction $getNearestNodeOfType(node, klass) {\n  let parent = node;\n  while (parent != null) {\n    if (parent instanceof klass) {\n      return parent;\n    }\n    parent = parent.getParent();\n  }\n  return null;\n}\n\n/**\n * Returns the element node of the nearest ancestor, otherwise throws an error.\n * @param startNode - The starting node of the search\n * @returns The ancestor node found\n */\nfunction $getNearestBlockElementAncestorOrThrow(startNode) {\n  const blockNode = $findMatchingParent(startNode, node => $isElementNode(node) && !node.isInline());\n  if (!$isElementNode(blockNode)) {\n    {\n      formatDevErrorMessage(`Expected node ${startNode.__key} to have closest block element node.`);\n    }\n  }\n  return blockNode;\n}\n/**\n * Attempts to resolve nested element nodes of the same type into a single node of that type.\n * It is generally used for marks/commenting\n * @param editor - The lexical editor\n * @param targetNode - The target for the nested element to be extracted from.\n * @param cloneNode - See {@link $createMarkNode}\n * @param handleOverlap - Handles any overlap between the node to extract and the targetNode\n * @returns The lexical editor\n */\nfunction registerNestedElementResolver(editor, targetNode, cloneNode, handleOverlap) {\n  const $isTargetNode = node => {\n    return node instanceof targetNode;\n  };\n  const $findMatch = node => {\n    // First validate we don't have any children that are of the target,\n    // as we need to handle them first.\n    const children = node.getChildren();\n    for (let i = 0; i < children.length; i++) {\n      const child = children[i];\n      if ($isTargetNode(child)) {\n        return null;\n      }\n    }\n    let parentNode = node;\n    let childNode = node;\n    while (parentNode !== null) {\n      childNode = parentNode;\n      parentNode = parentNode.getParent();\n      if ($isTargetNode(parentNode)) {\n        return {\n          child: childNode,\n          parent: parentNode\n        };\n      }\n    }\n    return null;\n  };\n  const $elementNodeTransform = node => {\n    const match = $findMatch(node);\n    if (match !== null) {\n      const {\n        child,\n        parent\n      } = match;\n\n      // Simple path, we can move child out and siblings into a new parent.\n\n      if (child.is(node)) {\n        handleOverlap(parent, node);\n        const nextSiblings = child.getNextSiblings();\n        const nextSiblingsLength = nextSiblings.length;\n        parent.insertAfter(child);\n        if (nextSiblingsLength !== 0) {\n          const newParent = cloneNode(parent);\n          child.insertAfter(newParent);\n          for (let i = 0; i < nextSiblingsLength; i++) {\n            newParent.append(nextSiblings[i]);\n          }\n        }\n        if (!parent.canBeEmpty() && parent.getChildrenSize() === 0) {\n          parent.remove();\n        }\n      }\n    }\n  };\n  return editor.registerNodeTransform(targetNode, $elementNodeTransform);\n}\n\n/**\n * Clones the editor and marks it as dirty to be reconciled. If there was a selection,\n * it would be set back to its previous state, or null otherwise.\n * @param editor - The lexical editor\n * @param editorState - The editor's state\n */\nfunction $restoreEditorState(editor, editorState) {\n  const FULL_RECONCILE = 2;\n  const nodeMap = new Map();\n  const activeEditorState = editor._pendingEditorState;\n  for (const [key, node] of editorState._nodeMap) {\n    nodeMap.set(key, $cloneWithProperties(node));\n  }\n  if (activeEditorState) {\n    activeEditorState._nodeMap = nodeMap;\n  }\n  editor._dirtyType = FULL_RECONCILE;\n  const selection = editorState._selection;\n  $setSelection(selection === null ? null : selection.clone());\n}\n\n/**\n * If the selected insertion area is the root/shadow root node (see {@link lexical!$isRootOrShadowRoot}),\n * the node will be appended there, otherwise, it will be inserted before the insertion area.\n * If there is no selection where the node is to be inserted, it will be appended after any current nodes\n * within the tree, as a child of the root node. A paragraph will then be added after the inserted node and selected.\n * @param node - The node to be inserted\n * @returns The node after its insertion\n */\nfunction $insertNodeToNearestRoot(node) {\n  const selection = $getSelection() || $getPreviousSelection();\n  let initialCaret;\n  if ($isRangeSelection(selection)) {\n    initialCaret = $caretFromPoint(selection.focus, 'next');\n  } else {\n    if (selection != null) {\n      const nodes = selection.getNodes();\n      const lastNode = nodes[nodes.length - 1];\n      if (lastNode) {\n        initialCaret = $getSiblingCaret(lastNode, 'next');\n      }\n    }\n    initialCaret = initialCaret || $getChildCaret($getRoot(), 'previous').getFlipped().insert($createParagraphNode());\n  }\n  const insertCaret = $insertNodeToNearestRootAtCaret(node, initialCaret);\n  const adjacent = $getAdjacentChildCaret(insertCaret);\n  const selectionCaret = $isChildCaret(adjacent) ? $normalizeCaret(adjacent) : insertCaret;\n  $setSelectionFromCaretRange($getCollapsedCaretRange(selectionCaret));\n  return node.getLatest();\n}\n\n/**\n * If the insertion caret is the root/shadow root node (see {@link lexical!$isRootOrShadowRoot}),\n * the node will be inserted there, otherwise the parent nodes will be split according to the\n * given options.\n * @param node - The node to be inserted\n * @param caret - The location to insert or split from\n * @returns The node after its insertion\n */\nfunction $insertNodeToNearestRootAtCaret(node, caret, options) {\n  let insertCaret = $getCaretInDirection(caret, 'next');\n  // Normalize boundary cases for TextPointCaret\n  if ($isTextPointCaret(insertCaret)) {\n    if (insertCaret.offset === 0) {\n      insertCaret = $getSiblingCaret(insertCaret.origin, 'previous').getFlipped();\n    } else if (insertCaret.offset === insertCaret.origin.getTextContentSize()) {\n      insertCaret = $getSiblingCaret(insertCaret.origin, 'next');\n    }\n  }\n  // Make sure we have a distinct node as the origin\n  if (insertCaret.origin.is(node)) {\n    if (!$isSiblingCaret(insertCaret)) {\n      formatDevErrorMessage(`$insertNodeToNearestRootAtCaret node ${node.getKey()} of type ${node.getType()} can not be inserted into itself`);\n    }\n    insertCaret = $rewindSiblingCaret(insertCaret);\n  }\n  // Handle split boundary conditions where node is being inserted adjacent to itself\n  if (node.is(insertCaret.getNodeAtCaret()) || node.is(insertCaret.getFlipped().getNodeAtCaret())) {\n    node.remove(true);\n  }\n  for (let nextCaret = insertCaret; nextCaret; nextCaret = $splitAtPointCaretNext(nextCaret, options)) {\n    insertCaret = nextCaret;\n  }\n  if (!!$isTextPointCaret(insertCaret)) {\n    formatDevErrorMessage(`$insertNodeToNearestRootAtCaret: An unattached TextNode can not be split`);\n  }\n  insertCaret.insert(node.isInline() ? $createParagraphNode().append(node) : node);\n  return $getCaretInDirection($getSiblingCaret(node.getLatest(), 'next'), caret.direction);\n}\n\n/**\n * Inserts a node into leaf — the deepest accessible node at the carriage position\n * @param node - The node to be inserted\n */\nfunction $insertNodeIntoLeaf(node) {\n  const selection = $getSelection();\n  if (!$isRangeSelection(selection)) {\n    if (selection) {\n      selection.insertNodes([node]);\n    }\n    return;\n  }\n  const caretRange = $caretRangeFromSelection(selection);\n  let insertCaret = $getCaretRangeInDirection($removeTextFromCaretRange(caretRange), 'next').anchor;\n  if ($isTextPointCaret(insertCaret)) {\n    const nextAnchor = $splitAtPointCaretNext(insertCaret);\n    if (!nextAnchor) {\n      return;\n    }\n    insertCaret = nextAnchor;\n  }\n  const focus = insertCaret.getFlipped();\n  focus.insert(node);\n  $setSelectionFromCaretRange($getCaretRange(focus, focus));\n}\n\n/**\n * Wraps the node into another node created from a createElementNode function, eg. $createParagraphNode\n * @param node - Node to be wrapped.\n * @param createElementNode - Creates a new lexical element to wrap the to-be-wrapped node and returns it.\n * @returns A new lexical element with the previous node appended within (as a child, including its children).\n */\nfunction $wrapNodeInElement(node, createElementNode) {\n  const elementNode = createElementNode();\n  node.replace(elementNode);\n  elementNode.append(node);\n  return elementNode;\n}\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n\n/**\n * @param object = The instance of the type\n * @param objectClass = The class of the type\n * @returns Whether the object is has the same Klass of the objectClass, ignoring the difference across window (e.g. different iframes)\n */\nfunction objectKlassEquals(object, objectClass) {\n  return object !== null ? Object.getPrototypeOf(object).constructor.name === objectClass.name : false;\n}\n\n/**\n * @deprecated Use Array filter or flatMap\n *\n * Filter the nodes\n * @param nodes Array of nodes that needs to be filtered\n * @param filterFn A filter function that returns node if the current node satisfies the condition otherwise null\n * @returns Array of filtered nodes\n */\n\nfunction $filter(nodes, filterFn) {\n  const result = [];\n  for (let i = 0; i < nodes.length; i++) {\n    const node = filterFn(nodes[i]);\n    if (node !== null) {\n      result.push(node);\n    }\n  }\n  return result;\n}\n\n/**\n * Applies the provided callback to each indentable block element in the Selection\n *\n * @param indentOrOutdent callback for performing the indent or outdent action\n * on a given block element.\n * @returns true if at least one block was handled, false otherwise.\n */\nfunction $handleIndentAndOutdent(indentOrOutdent) {\n  const selection = $getSelection();\n  if (!$isRangeSelection(selection)) {\n    return false;\n  }\n  const alreadyHandled = new Set();\n  const nodes = selection.getNodes();\n  for (let i = 0; i < nodes.length; i++) {\n    const node = nodes[i];\n    const key = node.getKey();\n    if (alreadyHandled.has(key)) {\n      continue;\n    }\n    const parentBlock = $findMatchingParent(node, parentNode => $isElementNode(parentNode) && !parentNode.isInline());\n    if (parentBlock === null) {\n      continue;\n    }\n    const parentKey = parentBlock.getKey();\n    if (parentBlock.canIndent() && !alreadyHandled.has(parentKey)) {\n      alreadyHandled.add(parentKey);\n      indentOrOutdent(parentBlock);\n    }\n  }\n  return alreadyHandled.size > 0;\n}\n\n/**\n * Appends the node before the first child of the parent node\n * @param parent A parent node\n * @param node Node that needs to be appended\n */\nfunction $insertFirst(parent, node) {\n  $getChildCaret(parent, 'next').insert(node);\n}\nlet NEEDS_MANUAL_ZOOM = IS_FIREFOX || !CAN_USE_DOM ? false : undefined;\nfunction needsManualZoom() {\n  if (NEEDS_MANUAL_ZOOM === undefined) {\n    // If the browser implements standardized CSS zoom, then the client rect\n    // will be wider after zoom is applied\n    // https://chromestatus.com/feature/5198254868529152\n    // https://github.com/facebook/lexical/issues/6863\n    const div = document.createElement('div');\n    div.style.position = 'absolute';\n    div.style.opacity = '0';\n    div.style.width = '100px';\n    div.style.left = '-1000px';\n    document.body.appendChild(div);\n    const noZoom = div.getBoundingClientRect();\n    div.style.setProperty('zoom', '2');\n    NEEDS_MANUAL_ZOOM = div.getBoundingClientRect().width === noZoom.width;\n    document.body.removeChild(div);\n  }\n  return NEEDS_MANUAL_ZOOM;\n}\n\n/**\n * Calculates the zoom level of an element as a result of using\n * css zoom property. For browsers that implement standardized CSS\n * zoom (Firefox, Chrome >= 128), this will always return 1.\n * @param element\n * @param useManualZoom - If true, always use zoom level will be calculated manually, otherwise it will be calculated on as needed basis.\n */\nfunction calculateZoomLevel(element, useManualZoom = false) {\n  let zoom = 1;\n  if (needsManualZoom() || useManualZoom) {\n    while (element) {\n      zoom *= Number(window.getComputedStyle(element).getPropertyValue('zoom'));\n      element = element.parentElement;\n    }\n  }\n  return zoom;\n}\n\n/**\n * Checks if the editor is a nested editor created by LexicalNestedComposer\n */\nfunction $isEditorIsNestedEditor(editor) {\n  return editor._parentEditor !== null;\n}\n\n/**\n * A depth first last-to-first traversal of root that stops at each node that matches\n * $predicate and ensures that its parent is root. This is typically used to discard\n * invalid or unsupported wrapping nodes. For example, a TableNode must only have\n * TableRowNode as children, but an importer might add invalid nodes based on\n * caption, tbody, thead, etc. and this will unwrap and discard those.\n *\n * @param root The root to start the traversal\n * @param $predicate Should return true for nodes that are permitted to be children of root\n * @returns true if this unwrapped or removed any nodes\n */\nfunction $unwrapAndFilterDescendants(root, $predicate) {\n  return $unwrapAndFilterDescendantsImpl(root, $predicate, null);\n}\nfunction $unwrapAndFilterDescendantsImpl(root, $predicate, $onSuccess) {\n  let didMutate = false;\n  for (const node of $lastToFirstIterator(root)) {\n    if ($predicate(node)) {\n      if ($onSuccess !== null) {\n        $onSuccess(node);\n      }\n      continue;\n    }\n    didMutate = true;\n    if ($isElementNode(node)) {\n      $unwrapAndFilterDescendantsImpl(node, $predicate, $onSuccess || (child => node.insertAfter(child)));\n    }\n    node.remove();\n  }\n  return didMutate;\n}\n\n/**\n * A depth first traversal of the children array that stops at and collects\n * each node that `$predicate` matches. This is typically used to discard\n * invalid or unsupported wrapping nodes on a children array in the `after`\n * of an {@link lexical!DOMConversionOutput}. For example, a TableNode must only have\n * TableRowNode as children, but an importer might add invalid nodes based on\n * caption, tbody, thead, etc. and this will unwrap and discard those.\n *\n * This function is read-only and performs no mutation operations, which makes\n * it suitable for import and export purposes but likely not for any in-place\n * mutation. You should use {@link $unwrapAndFilterDescendants} for in-place\n * mutations such as node transforms.\n *\n * @param children The children to traverse\n * @param $predicate Should return true for nodes that are permitted to be children of root\n * @returns The children or their descendants that match $predicate\n */\n\nfunction $descendantsMatching(children, $predicate) {\n  const result = [];\n  const stack = Array.from(children).reverse();\n  for (let child = stack.pop(); child !== undefined; child = stack.pop()) {\n    if ($predicate(child)) {\n      result.push(child);\n    } else if ($isElementNode(child)) {\n      for (const grandchild of $lastToFirstIterator(child)) {\n        stack.push(grandchild);\n      }\n    }\n  }\n  return result;\n}\n\n/**\n * Return an iterator that yields each child of node from first to last, taking\n * care to preserve the next sibling before yielding the value in case the caller\n * removes the yielded node.\n *\n * @param node The node whose children to iterate\n * @returns An iterator of the node's children\n */\nfunction $firstToLastIterator(node) {\n  return $childIterator($getChildCaret(node, 'next'));\n}\n\n/**\n * Return an iterator that yields each child of node from last to first, taking\n * care to preserve the previous sibling before yielding the value in case the caller\n * removes the yielded node.\n *\n * @param node The node whose children to iterate\n * @returns An iterator of the node's children\n */\nfunction $lastToFirstIterator(node) {\n  return $childIterator($getChildCaret(node, 'previous'));\n}\nfunction $childIterator(startCaret) {\n  const seen = new Set() ;\n  return makeStepwiseIterator({\n    hasNext: $isSiblingCaret,\n    initial: startCaret.getAdjacentCaret(),\n    map: caret => {\n      const origin = caret.origin.getLatest();\n      if (seen !== null) {\n        const key = origin.getKey();\n        if (!!seen.has(key)) {\n          formatDevErrorMessage(`$childIterator: Cycle detected, node with key ${String(key)} has already been traversed`);\n        }\n        seen.add(key);\n      }\n      return origin;\n    },\n    step: caret => caret.getAdjacentCaret()\n  });\n}\n\n/**\n * Replace this node with its children\n *\n * @param node The ElementNode to unwrap and remove\n */\nfunction $unwrapNode(node) {\n  $rewindSiblingCaret($getSiblingCaret(node, 'next')).splice(1, node.getChildren());\n}\n\n/**\n * A wrapper that creates bound functions and methods for the\n * StateConfig to save some boilerplate when defining methods\n * or exporting only the accessors from your modules rather\n * than exposing the StateConfig directly.\n */\n\n/**\n * EXPERIMENTAL\n *\n * A convenience interface for working with {@link $getState} and\n * {@link $setState}.\n *\n * @param stateConfig The stateConfig to wrap with convenience functionality\n * @returns a StateWrapper\n */\nfunction makeStateWrapper(stateConfig) {\n  const $get = node => $getState(node, stateConfig);\n  const $set = (node, valueOrUpdater) => $setState(node, stateConfig, valueOrUpdater);\n  return {\n    $get,\n    $set,\n    accessors: [$get, $set],\n    makeGetterMethod: () => function $getter() {\n      return $get(this);\n    },\n    makeSetterMethod: () => function $setter(valueOrUpdater) {\n      return $set(this, valueOrUpdater);\n    },\n    stateConfig\n  };\n}\n\nexport { $descendantsMatching, $dfs, $dfsIterator, $filter, $firstToLastIterator, $getAdjacentCaret, $getDepth, $getNearestBlockElementAncestorOrThrow, $getNearestNodeOfType, $getNextRightPreorderNode, $getNextSiblingOrParentSibling, $handleIndentAndOutdent, $insertFirst, $insertNodeIntoLeaf, $insertNodeToNearestRoot, $insertNodeToNearestRootAtCaret, $isEditorIsNestedEditor, $lastToFirstIterator, $restoreEditorState, $reverseDfs, $reverseDfsIterator, $unwrapAndFilterDescendants, $unwrapNode, $wrapNodeInElement, CAN_USE_BEFORE_INPUT, CAN_USE_DOM, IS_ANDROID, IS_ANDROID_CHROME, IS_APPLE, IS_APPLE_WEBKIT, IS_CHROME, IS_FIREFOX, IS_IOS, IS_SAFARI, calculateZoomLevel, isMimeType, makeStateWrapper, markSelection, mediaFileReader, objectKlassEquals, mlcPositionNodeOnRange as positionNodeOnRange, registerNestedElementResolver, selectionAlwaysOnDisplay };\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;AAsBA,SAAS,sBAAsB,SAAS;CACtC,MAAM,IAAI,MAAM,OAAO;AACzB;;;;;;;;AAUA,MAAM,gBAAgB,OAAO,WAAW,eAAe,OAAO,OAAO,aAAa,eAAe,OAAO,OAAO,SAAS,kBAAkB;;;;;;;;AAU1I,MAAM,eAAe,iBAAiB,kBAAkB,WAAW,SAAS,eAAe;AAC3F,MAAM,aAAa,iBAAiB,uBAAuB,KAAK,UAAU,QAAQ;AAClF,MAAM,eAAe,iBAAiB,mCAAmC,KAAK,UAAU,SAAS;AACjG,MAAM,yBAAyB,iBAAiB,gBAAgB,UAAU,CAAC,eAAe,qBAAqB,IAAI,OAAO,WAAW,OAAO,IAAI;AAChJ,MAAM,WAAW,iBAAiB,mBAAmB,KAAK,UAAU,SAAS,KAAK,CAAC,OAAO;AAC1F,MAAM,eAAe,iBAAiB,UAAU,KAAK,UAAU,SAAS;AAIxE,MAAM,cAAc,iBAAiB,0BAA0B,KAAK,UAAU,SAAS,KAAK,CAAC;AAI7F,MAAM,cAAc,iBAAiB,mBAAmB,KAAK,UAAU,SAAS;AAGhF,MAAM,sBAAsB,iBAAiB,gBAAgB;AAC7D,MAAM,oBAAoB,iBAAiB,sBAAsB,KAAK,UAAU,SAAS,KAAK,cAAc,CAAC;;;;;;;;AAU7G,SAAS,GAAG,OAAO;CACjB,OAAO,GAAG,MAAM;AAClB;AAEA,MAAM,yBAAyB;CAC7B,YAAY;CACZ,eAAe;CACf,WAAW;CACX,SAAS;AACX;AACA,SAAS,eAAe,QAAQ,MAAM;CACpC,OAAO,aAAa,MAAM,OAAO,UAAU;AAC7C;;;;;;;;;;;;;AAcA,SAAS,uBAAuB,QAAQ,OAAO,cAAc;CAC3D,IAAI,cAAc;CAClB,IAAI,gBAAgB;CACpB,IAAI,WAAW;CACf,IAAI,YAAY,CAAC;CACjB,MAAM,cAAc,SAAS,cAAc,KAAK;CAChD,YAAY,MAAM,WAAW;CAC7B,SAAS,WAAW;EAClB,IAAI,EAAE,gBAAgB,OACpB,sBAAsB,6BAA6B;EAErD,IAAI,EAAE,kBAAkB,OACtB,sBAAsB,+BAA+B;EAEvD,MAAM,EACJ,MAAM,YACN,KAAK,cACH,cAAc,sBAAsB;EACxC,MAAM,QAAQ,wBAAwB,QAAQ,KAAK;EACnD,IAAI,CAAC,YAAY,aACf,eAAe,eAAe,WAAW;EAE3C,IAAI,kBAAkB;EACtB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,OAAO,MAAM;GAGnB,MAAM,WAAW,UAAU,MAAM,SAAS,cAAc,KAAK;GAC7D,MAAM,gBAAgB,SAAS;GAC/B,IAAI,cAAc,aAAa,YAAY;IACzC,cAAc,WAAW;IACzB,kBAAkB;GACpB;GACA,MAAM,OAAO,GAAG,KAAK,OAAO,UAAU;GACtC,IAAI,cAAc,SAAS,MAAM;IAC/B,cAAc,OAAO;IACrB,kBAAkB;GACpB;GACA,MAAM,MAAM,GAAG,KAAK,MAAM,SAAS;GACnC,IAAI,cAAc,QAAQ,KAAK;IAC7B,SAAS,MAAM,MAAM;IACrB,kBAAkB;GACpB;GACA,MAAM,QAAQ,GAAG,KAAK,KAAK;GAC3B,IAAI,cAAc,UAAU,OAAO;IACjC,SAAS,MAAM,QAAQ;IACvB,kBAAkB;GACpB;GACA,MAAM,SAAS,GAAG,KAAK,MAAM;GAC7B,IAAI,cAAc,WAAW,QAAQ;IACnC,SAAS,MAAM,SAAS;IACxB,kBAAkB;GACpB;GACA,IAAI,SAAS,eAAe,aAAa;IACvC,YAAY,OAAO,QAAQ;IAC3B,kBAAkB;GACpB;GACA,UAAU,KAAK;EACjB;EACA,OAAO,UAAU,SAAS,MAAM,QAC9B,UAAU,IAAI;EAEhB,IAAI,iBACF,aAAa,SAAS;CAE1B;CACA,SAAS,OAAO;EACd,gBAAgB;EAChB,cAAc;EACd,IAAI,aAAa,MACf,SAAS,WAAW;EAEtB,WAAW;EACX,YAAY,OAAO;EACnB,KAAK,MAAM,QAAQ,WACjB,KAAK,OAAO;EAEd,YAAY,CAAC;CACf;CACA,SAAS,UAAU;EACjB,MAAM,qBAAqB,OAAO,eAAe;EACjD,IAAI,uBAAuB,MACzB,OAAO,KAAK;EAEd,MAAM,uBAAuB,mBAAmB;EAChD,IAAI,CAAC,cAAc,oBAAoB,GACrC,OAAO,KAAK;EAEd,KAAK;EACL,cAAc;EACd,gBAAgB;EAChB,WAAW,IAAI,kBAAiB,cAAa;GAC3C,MAAM,kBAAkB,OAAO,eAAe;GAC9C,MAAM,oBAAoB,mBAAmB,gBAAgB;GAC7D,IAAI,oBAAoB,eAAe,sBAAsB,eAC3D,OAAO,QAAQ;GAEjB,KAAK,MAAM,YAAY,WACrB,IAAI,CAAC,YAAY,SAAS,SAAS,MAAM,GAEvC,OAAO,SAAS;EAGtB,CAAC;EACD,SAAS,QAAQ,sBAAsB,sBAAsB;EAC7D,SAAS;CACX;CACA,MAAM,qBAAqB,OAAO,qBAAqB,OAAO;CAC9D,aAAa;EACX,mBAAmB;EACnB,KAAK;CACP;AACF;;;;;;;;AAUA,SAAS,2BAA2B,WAAW;CAC7C,MAAM,SAAS,UAAU,kBAAkB;CAC3C,OAAO,UAAU,WAAW,IAAI,CAAC,OAAO,IAAI,OAAO,EAAE,IAAI;AAC3D;AACA,SAAS,sBAAsB,OAAO,MAAM,KAAK;CAC/C,IAAI,MAAM,SAAS,UAAU,CAAC,eAAe,IAAI,GAE/C,OAAO,CADS,eAAe,GAAG,KAAK,KACtB,MAAM,MAAM;MACxB;EACL,MAAM,SAAS,WAAW;EAC1B,MAAM,OAAO,0BAA0B,MAAM,EAAE,YAAY,MAAM,KAAK,MAAM;EAC5E,OAAO,CAAC,KAAK,SAAS,KAAK,oBAAoB,IAAI,MAAM,MAAM;CACjE;AACF;AACA,SAAS,iBAAiB,QAAQ,OAAO,WAAW,UAAU,KAAK,SAAS,QAAQ;CAElF,MAAM,SADiB,OAAO,UAAU,OAAO,QAAQ,WAAW,UACrC,YAAY;CACzC,MAAM,SAAS,GAAG,sBAAsB,OAAO,WAAW,QAAQ,CAAC;CACnE,MAAM,OAAO,GAAG,sBAAsB,KAAK,SAAS,MAAM,CAAC;CAC3D,OAAO;AACT;AACA,SAAS,oBAAoB,UAAU;CACrC,KAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,eAAe,QAAQ;EAC7B,IAAI,aAAa,eAAe,aAC9B,aAAa,aAAa;EAE5B,IAAI,aAAa,UAAU,iBACzB,aAAa,QAAQ;EAEvB,IAAI,aAAa,cAAc,GAAG,IAAI,GACpC,aAAa,YAAY,GAAG,IAAI;EAElC,IAAI,aAAa,eAAe,GAAG,CAAC,GAClC,aAAa,aAAa,GAAG,CAAC;EAEhC,IAAI,aAAa,kBAAkB,GAAG,CAAC,GACrC,aAAa,gBAAgB,GAAG,CAAC;CAErC;AACF;;;;;;;;;AAUA,SAAS,cAAc,QAAQ,eAAe,qBAAqB;CACjE,IAAI,qBAAqB;CACzB,IAAI,wBAAwB;CAC5B,IAAI,uBAAuB;CAC3B,IAAI,oBAAoB;CACxB,IAAI,uBAAuB;CAC3B,IAAI,sBAAsB;CAC1B,IAAI,4BAA4B,CAAC;CACjC,SAAS,QAAQ,aAAa;EAC5B,YAAY,WAAW;GACrB,MAAM,YAAY,cAAc;GAChC,IAAI,CAAC,kBAAkB,SAAS,GAAG;IAEjC,qBAAqB;IACrB,uBAAuB;IACvB,oBAAoB;IACpB,sBAAsB;IACtB,oBAAoB;IACpB,4BAA4B,CAAC;IAC7B;GACF;GACA,MAAM,CAAC,OAAO,OAAO,2BAA2B,SAAS;GACzD,MAAM,mBAAmB,MAAM,QAAQ;GACvC,MAAM,sBAAsB,iBAAiB,OAAO;GACpD,MAAM,qBAAqB,MAAM;GACjC,MAAM,iBAAiB,IAAI,QAAQ;GACnC,MAAM,oBAAoB,eAAe,OAAO;GAChD,MAAM,mBAAmB,IAAI;GAC7B,MAAM,sBAAsB,OAAO,gBAAgB,mBAAmB;GACtE,MAAM,oBAAoB,OAAO,gBAAgB,iBAAiB;GAClE,MAAM,oBAAoB,uBAAuB,QAAQ,wBAAwB,yBAAyB,uBAAuB,wBAAwB,wBAAwB,mBAAmB,OAAO;GAC3M,MAAM,kBAAkB,sBAAsB,QAAQ,sBAAsB,wBAAwB,qBAAqB,uBAAuB,sBAAsB,kBAAkB,OAAO;GAC/L,KAAK,qBAAqB,oBAAoB,wBAAwB,QAAQ,sBAAsB,MAAM;IACxG,MAAM,QAAQ,iBAAiB,QAAQ,OAAO,kBAAkB,qBAAqB,KAAK,gBAAgB,iBAAiB;IAC3H,oBAAoB;IACpB,sBAAsB,uBAAuB,QAAQ,OAAO,YAAY;GAC1E;GACA,qBAAqB;GACrB,wBAAwB;GACxB,uBAAuB;GACvB,oBAAoB;GACpB,uBAAuB;GACvB,sBAAsB;EACxB,CAAC;CACH;CACA,QAAQ,OAAO,eAAe,CAAC;CAC/B,OAAO,cAAc,OAAO,wBAAwB,EAClD,kBACI,QAAQ,WAAW,CAAC,SAAS;EACjC,oBAAoB;CACtB,CAAC;AACH;;;;;;;;AAUA,SAAS,yBAAyB,QAAQ,cAAc;CACtD,IAAI,sBAAsB;CAC1B,MAAM,0BAA0B;EAC9B,MAAM,eAAe,aAAa;EAClC,MAAM,gBAAgB,gBAAgB,aAAa;EACnD,MAAM,oBAAoB,OAAO,eAAe;EAEhD,IADgC,kBAAkB,QAAQ,sBAAsB,QAAQ,kBAAkB,SAAS,aAAa;OAE1H,wBAAwB,MAAM;IAChC,oBAAoB;IACpB,sBAAsB;GACxB;SAEA,IAAI,wBAAwB,MAC1B,sBAAsB,cAAc,QAAQ,YAAY;CAG9D;CACA,OAAO,OAAO,sBAAqB,gBAAe;EAChD,IAAI,aAAa;GACf,MAAM,WAAW,YAAY;GAC7B,SAAS,iBAAiB,mBAAmB,iBAAiB;GAC9D,kBAAkB;GAClB,aAAa;IACX,IAAI,wBAAwB,MAC1B,oBAAoB;IAEtB,SAAS,oBAAoB,mBAAmB,iBAAiB;GACnE;EACF;CACF,CAAC;AACH;AAGA,MAAM,uBAAuB;AAC7B,MAAM,cAAc;AACpB,MAAM,aAAa;AACnB,MAAM,oBAAoB;AAC1B,MAAM,WAAW;AACjB,MAAM,kBAAkB;AACxB,MAAM,YAAY;AAClB,MAAM,aAAa;AACnB,MAAM,SAAS;AACf,MAAM,YAAY;;;;;;;;;AAUlB,SAAS,WAAW,MAAM,qBAAqB;CAC7C,KAAK,MAAM,kBAAkB,qBAC3B,IAAI,KAAK,KAAK,WAAW,cAAc,GACrC,OAAO;CAGX,OAAO;AACT;;;;;;;;;;;;AAaA,SAAS,gBAAgB,OAAO,qBAAqB;CACnD,MAAM,gBAAgB,MAAM,OAAO,UAAU;CAC7C,OAAO,IAAI,SAAS,SAAS,WAAW;EACtC,MAAM,YAAY,CAAC;EACnB,MAAM,uBAAuB;GAC3B,MAAM,EACJ,MACA,OAAO,SACL,cAAc,KAAK;GACvB,IAAI,MACF,OAAO,QAAQ,SAAS;GAE1B,MAAM,aAAa,IAAI,WAAW;GAClC,WAAW,iBAAiB,SAAS,MAAM;GAC3C,WAAW,iBAAiB,cAAc;IACxC,MAAM,SAAS,WAAW;IAC1B,IAAI,OAAO,WAAW,UACpB,UAAU,KAAK;KACb;KACA;IACF,CAAC;IAEH,eAAe;GACjB,CAAC;GACD,IAAI,WAAW,MAAM,mBAAmB,GACtC,WAAW,cAAc,IAAI;QAE7B,eAAe;EAEnB;EACA,eAAe;CACjB,CAAC;AACH;;;;;;;;;;;;;AAaA,SAAS,KAAK,WAAW,SAAS;CAChC,OAAO,MAAM,KAAK,aAAa,WAAW,OAAO,CAAC;AACpD;;;;;;;AAQA,SAAS,kBAAkB,OAAO;CAChC,OAAO,QAAQ,MAAM,iBAAiB,IAAI;AAC5C;;;;;;;AAQA,SAAS,YAAY,WAAW,SAAS;CACvC,OAAO,MAAM,KAAK,oBAAoB,WAAW,OAAO,CAAC;AAC3D;;;;;;;;;AAUA,SAAS,aAAa,WAAW,SAAS;CACxC,OAAO,kBAAkB,QAAQ,WAAW,OAAO;AACrD;AACA,SAAS,aAAa,WAAW,WAAW;CAC1C,MAAM,OAAO,wCAAwC,iBAAiB,WAAW,SAAS,CAAC;CAC3F,OAAO,QAAQ,KAAK;AACtB;AACA,SAAS,kBAAkB,WAAW,WAAW,SAAS;CACxD,MAAM,OAAO,SAAS;CACtB,MAAM,QAAQ,aAAa;CAC3B,MAAM,aAAa,eAAe,KAAK,IAAI,eAAe,OAAO,SAAS,IAAI,iBAAiB,OAAO,SAAS;CAC/G,MAAM,aAAa,UAAU,KAAK;CAClC,MAAM,WAAW,UAAU,uBAAuB,qBAAqB,iBAAiB,SAAS,SAAS,CAAC,CAAC,KAAK,aAAa,SAAS,SAAS,IAAI,aAAa,OAAO,SAAS;CACjL,IAAI,QAAQ;CACZ,OAAO,qBAAqB;EAC1B,UAAS,UAAS,UAAU;EAC5B,SAAS;EACT,MAAK,WAAU;GACb;GACA,MAAM,MAAM;EACd;EACA,OAAM,UAAS;GACb,IAAI,MAAM,gBAAgB,QAAQ,GAChC,OAAO;GAET,IAAI,cAAc,KAAK,GACrB;GAEF,MAAM,OAAO,wCAAwC,KAAK;GAC1D,IAAI,CAAC,QAAQ,KAAK,GAAG,gBAAgB,QAAQ,GAC3C,OAAO;GAET,SAAS,KAAK;GACd,OAAO,KAAK;EACd;CACF,CAAC;AACH;;;;;;;;;AAUA,SAAS,+BAA+B,MAAM;CAC5C,MAAM,OAAO,wCAAwC,iBAAiB,MAAM,MAAM,CAAC;CACnF,OAAO,QAAQ,CAAC,KAAK,GAAG,QAAQ,KAAK,EAAE;AACzC;AACA,SAAS,UAAU,MAAM;CACvB,IAAI,QAAQ;CACZ,KAAK,IAAI,YAAY,MAAM,cAAc,MAAM,YAAY,UAAU,UAAU,GAC7E;CAEF,OAAO;AACT;;;;;;;;;AAUA,SAAS,0BAA0B,cAAc;CAE/C,MAAM,OAAO,wCADM,qBAAqB,iBAAiB,cAAc,UAAU,CACnB,GAAG,MAAM;CACvE,OAAO,QAAQ,KAAK,GAAG;AACzB;;;;;;;AAQA,SAAS,oBAAoB,WAAW,SAAS;CAC/C,OAAO,kBAAkB,YAAY,WAAW,OAAO;AACzD;;;;;;;;AASA,SAAS,sBAAsB,MAAM,OAAO;CAC1C,IAAI,SAAS;CACb,OAAO,UAAU,MAAM;EACrB,IAAI,kBAAkB,OACpB,OAAO;EAET,SAAS,OAAO,UAAU;CAC5B;CACA,OAAO;AACT;;;;;;AAOA,SAAS,uCAAuC,WAAW;CACzD,MAAM,YAAY,oBAAoB,YAAW,SAAQ,eAAe,IAAI,KAAK,CAAC,KAAK,SAAS,CAAC;CACjG,IAAI,CAAC,eAAe,SAAS,GAEzB,sBAAsB,iBAAiB,UAAU,MAAM,qCAAqC;CAGhG,OAAO;AACT;;;;;;;;;;AAUA,SAAS,8BAA8B,QAAQ,YAAY,WAAW,eAAe;CACnF,MAAM,iBAAgB,SAAQ;EAC5B,OAAO,gBAAgB;CACzB;CACA,MAAM,cAAa,SAAQ;EAGzB,MAAM,WAAW,KAAK,YAAY;EAClC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;GACxC,MAAM,QAAQ,SAAS;GACvB,IAAI,cAAc,KAAK,GACrB,OAAO;EAEX;EACA,IAAI,aAAa;EACjB,IAAI,YAAY;EAChB,OAAO,eAAe,MAAM;GAC1B,YAAY;GACZ,aAAa,WAAW,UAAU;GAClC,IAAI,cAAc,UAAU,GAC1B,OAAO;IACL,OAAO;IACP,QAAQ;GACV;EAEJ;EACA,OAAO;CACT;CACA,MAAM,yBAAwB,SAAQ;EACpC,MAAM,QAAQ,WAAW,IAAI;EAC7B,IAAI,UAAU,MAAM;GAClB,MAAM,EACJ,OACA,WACE;GAIJ,IAAI,MAAM,GAAG,IAAI,GAAG;IAClB,cAAc,QAAQ,IAAI;IAC1B,MAAM,eAAe,MAAM,gBAAgB;IAC3C,MAAM,qBAAqB,aAAa;IACxC,OAAO,YAAY,KAAK;IACxB,IAAI,uBAAuB,GAAG;KAC5B,MAAM,YAAY,UAAU,MAAM;KAClC,MAAM,YAAY,SAAS;KAC3B,KAAK,IAAI,IAAI,GAAG,IAAI,oBAAoB,KACtC,UAAU,OAAO,aAAa,EAAE;IAEpC;IACA,IAAI,CAAC,OAAO,WAAW,KAAK,OAAO,gBAAgB,MAAM,GACvD,OAAO,OAAO;GAElB;EACF;CACF;CACA,OAAO,OAAO,sBAAsB,YAAY,qBAAqB;AACvE;;;;;;;AAQA,SAAS,oBAAoB,QAAQ,aAAa;CAChD,MAAM,iBAAiB;CACvB,MAAM,0BAAU,IAAI,IAAI;CACxB,MAAM,oBAAoB,OAAO;CACjC,KAAK,MAAM,CAAC,KAAK,SAAS,YAAY,UACpC,QAAQ,IAAI,KAAK,qBAAqB,IAAI,CAAC;CAE7C,IAAI,mBACF,kBAAkB,WAAW;CAE/B,OAAO,aAAa;CACpB,MAAM,YAAY,YAAY;CAC9B,cAAc,cAAc,OAAO,OAAO,UAAU,MAAM,CAAC;AAC7D;;;;;;;;;AAUA,SAAS,yBAAyB,MAAM;CACtC,MAAM,YAAY,cAAc,KAAK,sBAAsB;CAC3D,IAAI;CACJ,IAAI,kBAAkB,SAAS,GAC7B,eAAe,gBAAgB,UAAU,OAAO,MAAM;MACjD;EACL,IAAI,aAAa,MAAM;GACrB,MAAM,QAAQ,UAAU,SAAS;GACjC,MAAM,WAAW,MAAM,MAAM,SAAS;GACtC,IAAI,UACF,eAAe,iBAAiB,UAAU,MAAM;EAEpD;EACA,eAAe,gBAAgB,eAAe,SAAS,GAAG,UAAU,EAAE,WAAW,EAAE,OAAO,qBAAqB,CAAC;CAClH;CACA,MAAM,cAAc,gCAAgC,MAAM,YAAY;CACtE,MAAM,WAAW,uBAAuB,WAAW;CAEnD,4BAA4B,wBADL,cAAc,QAAQ,IAAI,gBAAgB,QAAQ,IAAI,WACX,CAAC;CACnE,OAAO,KAAK,UAAU;AACxB;;;;;;;;;AAUA,SAAS,gCAAgC,MAAM,OAAO,SAAS;CAC7D,IAAI,cAAc,qBAAqB,OAAO,MAAM;CAEpD,IAAI,kBAAkB,WAAW;MAC3B,YAAY,WAAW,GACzB,cAAc,iBAAiB,YAAY,QAAQ,UAAU,EAAE,WAAW;OACrE,IAAI,YAAY,WAAW,YAAY,OAAO,mBAAmB,GACtE,cAAc,iBAAiB,YAAY,QAAQ,MAAM;CAAA;CAI7D,IAAI,YAAY,OAAO,GAAG,IAAI,GAAG;EAC/B,IAAI,CAAC,gBAAgB,WAAW,GAC9B,sBAAsB,wCAAwC,KAAK,OAAO,EAAE,WAAW,KAAK,QAAQ,EAAE,iCAAiC;EAEzI,cAAc,oBAAoB,WAAW;CAC/C;CAEA,IAAI,KAAK,GAAG,YAAY,eAAe,CAAC,KAAK,KAAK,GAAG,YAAY,WAAW,EAAE,eAAe,CAAC,GAC5F,KAAK,OAAO,IAAI;CAElB,KAAK,IAAI,YAAY,aAAa,WAAW,YAAY,uBAAuB,WAAW,OAAO,GAChG,cAAc;CAEhB,IAAI,CAAC,CAAC,kBAAkB,WAAW,GACjC,sBAAsB,0EAA0E;CAElG,YAAY,OAAO,KAAK,SAAS,IAAI,qBAAqB,EAAE,OAAO,IAAI,IAAI,IAAI;CAC/E,OAAO,qBAAqB,iBAAiB,KAAK,UAAU,GAAG,MAAM,GAAG,MAAM,SAAS;AACzF;;;;;AAMA,SAAS,oBAAoB,MAAM;CACjC,MAAM,YAAY,cAAc;CAChC,IAAI,CAAC,kBAAkB,SAAS,GAAG;EACjC,IAAI,WACF,UAAU,YAAY,CAAC,IAAI,CAAC;EAE9B;CACF;CAEA,IAAI,cAAc,0BAA0B,0BADzB,yBAAyB,SACmC,CAAC,GAAG,MAAM,EAAE;CAC3F,IAAI,kBAAkB,WAAW,GAAG;EAClC,MAAM,aAAa,uBAAuB,WAAW;EACrD,IAAI,CAAC,YACH;EAEF,cAAc;CAChB;CACA,MAAM,QAAQ,YAAY,WAAW;CACrC,MAAM,OAAO,IAAI;CACjB,4BAA4B,eAAe,OAAO,KAAK,CAAC;AAC1D;;;;;;;AAQA,SAAS,mBAAmB,MAAM,mBAAmB;CACnD,MAAM,cAAc,kBAAkB;CACtC,KAAK,QAAQ,WAAW;CACxB,YAAY,OAAO,IAAI;CACvB,OAAO;AACT;;;;;;AASA,SAAS,kBAAkB,QAAQ,aAAa;CAC9C,OAAO,WAAW,OAAO,OAAO,eAAe,MAAM,EAAE,YAAY,SAAS,YAAY,OAAO;AACjG;;;;;;;;;AAWA,SAAS,QAAQ,OAAO,UAAU;CAChC,MAAM,SAAS,CAAC;CAChB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,OAAO,SAAS,MAAM,EAAE;EAC9B,IAAI,SAAS,MACX,OAAO,KAAK,IAAI;CAEpB;CACA,OAAO;AACT;;;;;;;;AASA,SAAS,wBAAwB,iBAAiB;CAChD,MAAM,YAAY,cAAc;CAChC,IAAI,CAAC,kBAAkB,SAAS,GAC9B,OAAO;CAET,MAAM,iCAAiB,IAAI,IAAI;CAC/B,MAAM,QAAQ,UAAU,SAAS;CACjC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,OAAO,MAAM;EACnB,MAAM,MAAM,KAAK,OAAO;EACxB,IAAI,eAAe,IAAI,GAAG,GACxB;EAEF,MAAM,cAAc,oBAAoB,OAAM,eAAc,eAAe,UAAU,KAAK,CAAC,WAAW,SAAS,CAAC;EAChH,IAAI,gBAAgB,MAClB;EAEF,MAAM,YAAY,YAAY,OAAO;EACrC,IAAI,YAAY,UAAU,KAAK,CAAC,eAAe,IAAI,SAAS,GAAG;GAC7D,eAAe,IAAI,SAAS;GAC5B,gBAAgB,WAAW;EAC7B;CACF;CACA,OAAO,eAAe,OAAO;AAC/B;;;;;;AAOA,SAAS,aAAa,QAAQ,MAAM;CAClC,eAAe,QAAQ,MAAM,EAAE,OAAO,IAAI;AAC5C;AACA,IAAI,oBAAoB,cAAc,CAAC,cAAc,QAAQ,KAAA;AAC7D,SAAS,kBAAkB;CACzB,IAAI,sBAAsB,KAAA,GAAW;EAKnC,MAAM,MAAM,SAAS,cAAc,KAAK;EACxC,IAAI,MAAM,WAAW;EACrB,IAAI,MAAM,UAAU;EACpB,IAAI,MAAM,QAAQ;EAClB,IAAI,MAAM,OAAO;EACjB,SAAS,KAAK,YAAY,GAAG;EAC7B,MAAM,SAAS,IAAI,sBAAsB;EACzC,IAAI,MAAM,YAAY,QAAQ,GAAG;EACjC,oBAAoB,IAAI,sBAAsB,EAAE,UAAU,OAAO;EACjE,SAAS,KAAK,YAAY,GAAG;CAC/B;CACA,OAAO;AACT;;;;;;;;AASA,SAAS,mBAAmB,SAAS,gBAAgB,OAAO;CAC1D,IAAI,OAAO;CACX,IAAI,gBAAgB,KAAK,eACvB,OAAO,SAAS;EACd,QAAQ,OAAO,OAAO,iBAAiB,OAAO,EAAE,iBAAiB,MAAM,CAAC;EACxE,UAAU,QAAQ;CACpB;CAEF,OAAO;AACT;;;;AAKA,SAAS,wBAAwB,QAAQ;CACvC,OAAO,OAAO,kBAAkB;AAClC;;;;;;;;;;;;AAaA,SAAS,4BAA4B,MAAM,YAAY;CACrD,OAAO,gCAAgC,MAAM,YAAY,IAAI;AAC/D;AACA,SAAS,gCAAgC,MAAM,YAAY,YAAY;CACrE,IAAI,YAAY;CAChB,KAAK,MAAM,QAAQ,qBAAqB,IAAI,GAAG;EAC7C,IAAI,WAAW,IAAI,GAAG;GACpB,IAAI,eAAe,MACjB,WAAW,IAAI;GAEjB;EACF;EACA,YAAY;EACZ,IAAI,eAAe,IAAI,GACrB,gCAAgC,MAAM,YAAY,gBAAe,UAAS,KAAK,YAAY,KAAK,EAAE;EAEpG,KAAK,OAAO;CACd;CACA,OAAO;AACT;;;;;;;;;;;;;;;;;;AAoBA,SAAS,qBAAqB,UAAU,YAAY;CAClD,MAAM,SAAS,CAAC;CAChB,MAAM,QAAQ,MAAM,KAAK,QAAQ,EAAE,QAAQ;CAC3C,KAAK,IAAI,QAAQ,MAAM,IAAI,GAAG,UAAU,KAAA,GAAW,QAAQ,MAAM,IAAI,GACnE,IAAI,WAAW,KAAK,GAClB,OAAO,KAAK,KAAK;MACZ,IAAI,eAAe,KAAK,GAC7B,KAAK,MAAM,cAAc,qBAAqB,KAAK,GACjD,MAAM,KAAK,UAAU;CAI3B,OAAO;AACT;;;;;;;;;AAUA,SAAS,qBAAqB,MAAM;CAClC,OAAO,eAAe,eAAe,MAAM,MAAM,CAAC;AACpD;;;;;;;;;AAUA,SAAS,qBAAqB,MAAM;CAClC,OAAO,eAAe,eAAe,MAAM,UAAU,CAAC;AACxD;AACA,SAAS,eAAe,YAAY;CAClC,MAAM,uBAAO,IAAI,IAAI;CACrB,OAAO,qBAAqB;EAC1B,SAAS;EACT,SAAS,WAAW,iBAAiB;EACrC,MAAK,UAAS;GACZ,MAAM,SAAS,MAAM,OAAO,UAAU;GACtC,IAAI,SAAS,MAAM;IACjB,MAAM,MAAM,OAAO,OAAO;IAC1B,IAAI,CAAC,CAAC,KAAK,IAAI,GAAG,GAChB,sBAAsB,iDAAiD,OAAO,GAAG,EAAE,4BAA4B;IAEjH,KAAK,IAAI,GAAG;GACd;GACA,OAAO;EACT;EACA,OAAM,UAAS,MAAM,iBAAiB;CACxC,CAAC;AACH;;;;;;AAOA,SAAS,YAAY,MAAM;CACzB,oBAAoB,iBAAiB,MAAM,MAAM,CAAC,EAAE,OAAO,GAAG,KAAK,YAAY,CAAC;AAClF;;;;;;;;;;;;;;;;AAkBA,SAAS,iBAAiB,aAAa;CACrC,MAAM,QAAO,SAAQ,UAAU,MAAM,WAAW;CAChD,MAAM,QAAQ,MAAM,mBAAmB,UAAU,MAAM,aAAa,cAAc;CAClF,OAAO;EACL;EACA;EACA,WAAW,CAAC,MAAM,IAAI;EACtB,wBAAwB,SAAS,UAAU;GACzC,OAAO,KAAK,IAAI;EAClB;EACA,wBAAwB,SAAS,QAAQ,gBAAgB;GACvD,OAAO,KAAK,MAAM,cAAc;EAClC;EACA;CACF;AACF"}
+{"version":3,"file":"LexicalUtils.dev-DRRDyAlS.mjs","names":[],"sources":["../../../node_modules/.pnpm/@lexical+utils@0.44.0/node_modules/@lexical/utils/LexicalUtils.dev.mjs"],"sourcesContent":["/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nimport { isHTMLElement, mergeRegister, $getSelection, $isRangeSelection, $isElementNode, getDOMTextNode, $getEditor, $getEditorDOMRenderConfig, $getChildCaret, $findMatchingParent, $getChildCaretOrSelf, $getSiblingCaret, $getAdjacentSiblingOrParentSiblingCaret, $caretRangeFromSelection, $getCaretRangeInDirection, $removeTextFromCaretRange, $isTextPointCaret, $splitAtPointCaretNext, $setSelectionFromCaretRange, $getCaretRange, $getPreviousSelection, $caretFromPoint, $getRoot, $createParagraphNode, $getAdjacentChildCaret, $isChildCaret, $normalizeCaret, $getCollapsedCaretRange, $getCaretInDirection, $isSiblingCaret, $rewindSiblingCaret, $cloneWithProperties, $setSelection, makeStepwiseIterator, $getState, $setState } from 'lexical';\nexport { $findMatchingParent, $getAdjacentSiblingOrParentSiblingCaret, $splitNode, addClassNamesToElement, isBlockDomNode, isHTMLAnchorElement, isHTMLElement, isInlineDomNode, mergeRegister, removeClassNamesFromElement } from 'lexical';\nimport { createRectsFromDOMRange } from '@lexical/selection';\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n// Do not require this module directly! Use normal `invariant` calls.\n\nfunction formatDevErrorMessage(message) {\n  throw new Error(message);\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nconst CAN_USE_DOM$1 = typeof window !== 'undefined' && typeof window.document !== 'undefined' && typeof window.document.createElement !== 'undefined';\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nconst documentMode = CAN_USE_DOM$1 && 'documentMode' in document ? document.documentMode : null;\nconst IS_APPLE$1 = CAN_USE_DOM$1 && /Mac|iPod|iPhone|iPad/.test(navigator.platform);\nconst IS_FIREFOX$1 = CAN_USE_DOM$1 && /^(?!.*Seamonkey)(?=.*Firefox).*/i.test(navigator.userAgent);\nconst CAN_USE_BEFORE_INPUT$1 = CAN_USE_DOM$1 && 'InputEvent' in window && !documentMode ? 'getTargetRanges' in new window.InputEvent('input') : false;\nconst IS_IOS$1 = CAN_USE_DOM$1 && /iPad|iPhone|iPod/.test(navigator.userAgent) && !window.MSStream;\nconst IS_ANDROID$1 = CAN_USE_DOM$1 && /Android/.test(navigator.userAgent);\n\n// Exclude Android — Android WebView's UA contains \"Version/X.X ... Safari/537.36\"\n// which falsely matches the Safari regex, activating wrong composition code paths.\nconst IS_SAFARI$1 = CAN_USE_DOM$1 && /Version\\/[\\d.]+.*Safari/.test(navigator.userAgent) && !IS_ANDROID$1;\n\n// Keep these in case we need to use them in the future.\n// export const IS_WINDOWS: boolean = CAN_USE_DOM && /Win/.test(navigator.platform);\nconst IS_CHROME$1 = CAN_USE_DOM$1 && /^(?=.*Chrome).*/i.test(navigator.userAgent);\n// export const canUseTextInputEvent: boolean = CAN_USE_DOM && 'TextEvent' in window && !documentMode;\n\nconst IS_ANDROID_CHROME$1 = CAN_USE_DOM$1 && IS_ANDROID$1 && IS_CHROME$1;\nconst IS_APPLE_WEBKIT$1 = CAN_USE_DOM$1 && /AppleWebKit\\/[\\d.]+/.test(navigator.userAgent) && IS_APPLE$1 && !IS_CHROME$1;\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction px(value) {\n  return `${value}px`;\n}\n\nconst mutationObserverConfig = {\n  attributes: true,\n  characterData: true,\n  childList: true,\n  subtree: true\n};\nfunction prependDOMNode(parent, node) {\n  parent.insertBefore(node, parent.firstChild);\n}\n\n/**\n * Place one or multiple newly created Nodes at the passed Range's position.\n * Multiple nodes will only be created when the Range spans multiple lines (aka\n * client rects).\n *\n * This function can come particularly useful to highlight particular parts of\n * the text without interfering with the EditorState, that will often replicate\n * the state across collab and clipboard.\n *\n * This function accounts for DOM updates which can modify the passed Range.\n * Hence, the function return to remove the listener.\n */\nfunction mlcPositionNodeOnRange(editor, range, onReposition) {\n  let rootDOMNode = null;\n  let parentDOMNode = null;\n  let observer = null;\n  let lastNodes = [];\n  const wrapperNode = document.createElement('div');\n  wrapperNode.style.position = 'relative';\n  function position() {\n    if (!(rootDOMNode !== null)) {\n      formatDevErrorMessage(`Unexpected null rootDOMNode`);\n    }\n    if (!(parentDOMNode !== null)) {\n      formatDevErrorMessage(`Unexpected null parentDOMNode`);\n    }\n    const {\n      left: parentLeft,\n      top: parentTop\n    } = parentDOMNode.getBoundingClientRect();\n    const rects = createRectsFromDOMRange(editor, range);\n    if (!wrapperNode.isConnected) {\n      prependDOMNode(parentDOMNode, wrapperNode);\n    }\n    let hasRepositioned = false;\n    for (let i = 0; i < rects.length; i++) {\n      const rect = rects[i];\n      // Try to reuse the previously created Node when possible, no need to\n      // remove/create on the most common case reposition case\n      const rectNode = lastNodes[i] || document.createElement('div');\n      const rectNodeStyle = rectNode.style;\n      if (rectNodeStyle.position !== 'absolute') {\n        rectNodeStyle.position = 'absolute';\n        hasRepositioned = true;\n      }\n      const left = px(rect.left - parentLeft);\n      if (rectNodeStyle.left !== left) {\n        rectNodeStyle.left = left;\n        hasRepositioned = true;\n      }\n      const top = px(rect.top - parentTop);\n      if (rectNodeStyle.top !== top) {\n        rectNode.style.top = top;\n        hasRepositioned = true;\n      }\n      const width = px(rect.width);\n      if (rectNodeStyle.width !== width) {\n        rectNode.style.width = width;\n        hasRepositioned = true;\n      }\n      const height = px(rect.height);\n      if (rectNodeStyle.height !== height) {\n        rectNode.style.height = height;\n        hasRepositioned = true;\n      }\n      if (rectNode.parentNode !== wrapperNode) {\n        wrapperNode.append(rectNode);\n        hasRepositioned = true;\n      }\n      lastNodes[i] = rectNode;\n    }\n    while (lastNodes.length > rects.length) {\n      lastNodes.pop();\n    }\n    if (hasRepositioned) {\n      onReposition(lastNodes);\n    }\n  }\n  function stop() {\n    parentDOMNode = null;\n    rootDOMNode = null;\n    if (observer !== null) {\n      observer.disconnect();\n    }\n    observer = null;\n    wrapperNode.remove();\n    for (const node of lastNodes) {\n      node.remove();\n    }\n    lastNodes = [];\n  }\n  function restart() {\n    const currentRootDOMNode = editor.getRootElement();\n    if (currentRootDOMNode === null) {\n      return stop();\n    }\n    const currentParentDOMNode = currentRootDOMNode.parentElement;\n    if (!isHTMLElement(currentParentDOMNode)) {\n      return stop();\n    }\n    stop();\n    rootDOMNode = currentRootDOMNode;\n    parentDOMNode = currentParentDOMNode;\n    observer = new MutationObserver(mutations => {\n      const nextRootDOMNode = editor.getRootElement();\n      const nextParentDOMNode = nextRootDOMNode && nextRootDOMNode.parentElement;\n      if (nextRootDOMNode !== rootDOMNode || nextParentDOMNode !== parentDOMNode) {\n        return restart();\n      }\n      for (const mutation of mutations) {\n        if (!wrapperNode.contains(mutation.target)) {\n          // TODO throttle\n          return position();\n        }\n      }\n    });\n    observer.observe(currentParentDOMNode, mutationObserverConfig);\n    position();\n  }\n  const removeRootListener = editor.registerRootListener(restart);\n  return () => {\n    removeRootListener();\n    stop();\n  };\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction $getOrderedSelectionPoints(selection) {\n  const points = selection.getStartEndPoints();\n  return selection.isBackward() ? [points[1], points[0]] : points;\n}\nfunction $rangeTargetFromPoint(point, node, dom) {\n  if (point.type === 'text' || !$isElementNode(node)) {\n    const textDOM = getDOMTextNode(dom) || dom;\n    return [textDOM, point.offset];\n  } else {\n    const editor = $getEditor();\n    const slot = $getEditorDOMRenderConfig(editor).$getDOMSlot(node, dom, editor);\n    return [slot.element, slot.getFirstChildOffset() + point.offset];\n  }\n}\nfunction $rangeFromPoints(editor, start, startNode, startDOM, end, endNode, endDOM) {\n  const editorDocument = editor._window ? editor._window.document : document;\n  const range = editorDocument.createRange();\n  range.setStart(...$rangeTargetFromPoint(start, startNode, startDOM));\n  range.setEnd(...$rangeTargetFromPoint(end, endNode, endDOM));\n  return range;\n}\nfunction defaultOnReposition(domNodes) {\n  for (const domNode of domNodes) {\n    const domNodeStyle = domNode.style;\n    if (domNodeStyle.background !== 'Highlight') {\n      domNodeStyle.background = 'Highlight';\n    }\n    if (domNodeStyle.color !== 'HighlightText') {\n      domNodeStyle.color = 'HighlightText';\n    }\n    if (domNodeStyle.marginTop !== px(-1.5)) {\n      domNodeStyle.marginTop = px(-1.5);\n    }\n    if (domNodeStyle.paddingTop !== px(4)) {\n      domNodeStyle.paddingTop = px(4);\n    }\n    if (domNodeStyle.paddingBottom !== px(0)) {\n      domNodeStyle.paddingBottom = px(0);\n    }\n  }\n}\n\n/**\n * Place one or multiple newly created Nodes at the current selection. Multiple\n * nodes will only be created when the selection spans multiple lines (aka\n * client rects).\n *\n * This function can come useful when you want to show the selection but the\n * editor has been focused away.\n */\nfunction markSelection(editor, onReposition = defaultOnReposition) {\n  let previousAnchorNode = null;\n  let previousAnchorNodeDOM = null;\n  let previousAnchorOffset = null;\n  let previousFocusNode = null;\n  let previousFocusNodeDOM = null;\n  let previousFocusOffset = null;\n  let removeRangeListener = () => {};\n  function compute(editorState) {\n    editorState.read(() => {\n      const selection = $getSelection();\n      if (!$isRangeSelection(selection)) {\n        // TODO\n        previousAnchorNode = null;\n        previousAnchorOffset = null;\n        previousFocusNode = null;\n        previousFocusOffset = null;\n        removeRangeListener();\n        removeRangeListener = () => {};\n        return;\n      }\n      const [start, end] = $getOrderedSelectionPoints(selection);\n      const currentStartNode = start.getNode();\n      const currentStartNodeKey = currentStartNode.getKey();\n      const currentStartOffset = start.offset;\n      const currentEndNode = end.getNode();\n      const currentEndNodeKey = currentEndNode.getKey();\n      const currentEndOffset = end.offset;\n      const currentStartNodeDOM = editor.getElementByKey(currentStartNodeKey);\n      const currentEndNodeDOM = editor.getElementByKey(currentEndNodeKey);\n      const differentStartDOM = previousAnchorNode === null || currentStartNodeDOM !== previousAnchorNodeDOM || currentStartOffset !== previousAnchorOffset || currentStartNodeKey !== previousAnchorNode.getKey();\n      const differentEndDOM = previousFocusNode === null || currentEndNodeDOM !== previousFocusNodeDOM || currentEndOffset !== previousFocusOffset || currentEndNodeKey !== previousFocusNode.getKey();\n      if ((differentStartDOM || differentEndDOM) && currentStartNodeDOM !== null && currentEndNodeDOM !== null) {\n        const range = $rangeFromPoints(editor, start, currentStartNode, currentStartNodeDOM, end, currentEndNode, currentEndNodeDOM);\n        removeRangeListener();\n        removeRangeListener = mlcPositionNodeOnRange(editor, range, onReposition);\n      }\n      previousAnchorNode = currentStartNode;\n      previousAnchorNodeDOM = currentStartNodeDOM;\n      previousAnchorOffset = currentStartOffset;\n      previousFocusNode = currentEndNode;\n      previousFocusNodeDOM = currentEndNodeDOM;\n      previousFocusOffset = currentEndOffset;\n    });\n  }\n  compute(editor.getEditorState());\n  return mergeRegister(editor.registerUpdateListener(({\n    editorState\n  }) => compute(editorState)), () => {\n    removeRangeListener();\n  });\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction selectionAlwaysOnDisplay(editor, onReposition) {\n  let removeSelectionMark = null;\n  const onSelectionChange = () => {\n    const domSelection = getSelection();\n    const domAnchorNode = domSelection && domSelection.anchorNode;\n    const editorRootElement = editor.getRootElement();\n    const isSelectionInsideEditor = domAnchorNode !== null && editorRootElement !== null && editorRootElement.contains(domAnchorNode);\n    if (isSelectionInsideEditor) {\n      if (removeSelectionMark !== null) {\n        removeSelectionMark();\n        removeSelectionMark = null;\n      }\n    } else {\n      if (removeSelectionMark === null) {\n        removeSelectionMark = markSelection(editor, onReposition);\n      }\n    }\n  };\n  return editor.registerRootListener(rootElement => {\n    if (rootElement) {\n      const document = rootElement.ownerDocument;\n      document.addEventListener('selectionchange', onSelectionChange);\n      onSelectionChange();\n      return () => {\n        if (removeSelectionMark !== null) {\n          removeSelectionMark();\n        }\n        document.removeEventListener('selectionchange', onSelectionChange);\n      };\n    }\n  });\n}\n\n// Hotfix to export these with inlined types #5918\nconst CAN_USE_BEFORE_INPUT = CAN_USE_BEFORE_INPUT$1;\nconst CAN_USE_DOM = CAN_USE_DOM$1;\nconst IS_ANDROID = IS_ANDROID$1;\nconst IS_ANDROID_CHROME = IS_ANDROID_CHROME$1;\nconst IS_APPLE = IS_APPLE$1;\nconst IS_APPLE_WEBKIT = IS_APPLE_WEBKIT$1;\nconst IS_CHROME = IS_CHROME$1;\nconst IS_FIREFOX = IS_FIREFOX$1;\nconst IS_IOS = IS_IOS$1;\nconst IS_SAFARI = IS_SAFARI$1;\n\n/**\n * Returns true if the file type matches the types passed within the acceptableMimeTypes array, false otherwise.\n * The types passed must be strings and are CASE-SENSITIVE.\n * eg. if file is of type 'text' and acceptableMimeTypes = ['TEXT', 'IMAGE'] the function will return false.\n * @param file - The file you want to type check.\n * @param acceptableMimeTypes - An array of strings of types which the file is checked against.\n * @returns true if the file is an acceptable mime type, false otherwise.\n */\nfunction isMimeType(file, acceptableMimeTypes) {\n  for (const acceptableType of acceptableMimeTypes) {\n    if (file.type.startsWith(acceptableType)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Lexical File Reader with:\n *  1. MIME type support\n *  2. batched results (HistoryPlugin compatibility)\n *  3. Order aware (respects the order when multiple Files are passed)\n *\n * const filesResult = await mediaFileReader(files, ['image/']);\n * filesResult.forEach(file => editor.dispatchCommand('INSERT_IMAGE', \\\\{\n *   src: file.result,\n * \\\\}));\n */\nfunction mediaFileReader(files, acceptableMimeTypes) {\n  const filesIterator = files[Symbol.iterator]();\n  return new Promise((resolve, reject) => {\n    const processed = [];\n    const handleNextFile = () => {\n      const {\n        done,\n        value: file\n      } = filesIterator.next();\n      if (done) {\n        return resolve(processed);\n      }\n      const fileReader = new FileReader();\n      fileReader.addEventListener('error', reject);\n      fileReader.addEventListener('load', () => {\n        const result = fileReader.result;\n        if (typeof result === 'string') {\n          processed.push({\n            file,\n            result\n          });\n        }\n        handleNextFile();\n      });\n      if (isMimeType(file, acceptableMimeTypes)) {\n        fileReader.readAsDataURL(file);\n      } else {\n        handleNextFile();\n      }\n    };\n    handleNextFile();\n  });\n}\n/**\n * \"Depth-First Search\" starts at the root/top node of a tree and goes as far as it can down a branch end\n * before backtracking and finding a new path. Consider solving a maze by hugging either wall, moving down a\n * branch until you hit a dead-end (leaf) and backtracking to find the nearest branching path and repeat.\n * It will then return all the nodes found in the search in an array of objects.\n * Preorder traversal is used, meaning that nodes are listed in the order of when they are FIRST encountered.\n * @param startNode - The node to start the search (inclusive), if omitted, it will start at the root node.\n * @param endNode - The node to end the search (inclusive), if omitted, it will find all descendants of the startingNode. If endNode\n * is an ElementNode, it will stop before visiting any of its children.\n * @returns An array of objects of all the nodes found by the search, including their depth into the tree.\n * \\\\{depth: number, node: LexicalNode\\\\} It will always return at least 1 node (the start node).\n */\nfunction $dfs(startNode, endNode) {\n  return Array.from($dfsIterator(startNode, endNode));\n}\n\n/**\n * Get the adjacent caret in the same direction\n *\n * @param caret A caret or null\n * @returns `caret.getAdjacentCaret()` or `null`\n */\nfunction $getAdjacentCaret(caret) {\n  return caret ? caret.getAdjacentCaret() : null;\n}\n\n/**\n * $dfs iterator (right to left). Tree traversal is done on the fly as new values are requested with O(1) memory.\n * @param startNode - The node to start the search, if omitted, it will start at the root node.\n * @param endNode - The node to end the search, if omitted, it will find all descendants of the startingNode.\n * @returns An iterator, each yielded value is a DFSNode. It will always return at least 1 node (the start node).\n */\nfunction $reverseDfs(startNode, endNode) {\n  return Array.from($reverseDfsIterator(startNode, endNode));\n}\n\n/**\n * $dfs iterator (left to right). Tree traversal is done on the fly as new values are requested with O(1) memory.\n * Preorder traversal is used, meaning that nodes are iterated over in the order of when they are FIRST encountered.\n * @param startNode - The node to start the search (inclusive), if omitted, it will start at the root node.\n * @param endNode - The node to end the search (inclusive), if omitted, it will find all descendants of the startingNode.\n * If endNode is an ElementNode, the iterator will end as soon as it reaches the endNode (no children will be visited).\n * @returns An iterator, each yielded value is a DFSNode. It will always return at least 1 node (the start node).\n */\nfunction $dfsIterator(startNode, endNode) {\n  return $dfsCaretIterator('next', startNode, endNode);\n}\nfunction $getEndCaret(startNode, direction) {\n  const rval = $getAdjacentSiblingOrParentSiblingCaret($getSiblingCaret(startNode, direction));\n  return rval && rval[0];\n}\nfunction $dfsCaretIterator(direction, startNode, endNode) {\n  const root = $getRoot();\n  const start = startNode || root;\n  const startCaret = $isElementNode(start) ? $getChildCaret(start, direction) : $getSiblingCaret(start, direction);\n  const startDepth = $getDepth(start);\n  const endCaret = endNode ? $getAdjacentChildCaret($getChildCaretOrSelf($getSiblingCaret(endNode, direction))) || $getEndCaret(endNode, direction) : $getEndCaret(start, direction);\n  let depth = startDepth;\n  return makeStepwiseIterator({\n    hasNext: state => state !== null,\n    initial: startCaret,\n    map: state => ({\n      depth,\n      node: state.origin\n    }),\n    step: state => {\n      if (state.isSameNodeCaret(endCaret)) {\n        return null;\n      }\n      if ($isChildCaret(state)) {\n        depth++;\n      }\n      const rval = $getAdjacentSiblingOrParentSiblingCaret(state);\n      if (!rval || rval[0].isSameNodeCaret(endCaret)) {\n        return null;\n      }\n      depth += rval[1];\n      return rval[0];\n    }\n  });\n}\n\n/**\n * Returns the Node sibling when this exists, otherwise the closest parent sibling. For example\n * R -> P -> T1, T2\n *   -> P2\n * returns T2 for node T1, P2 for node T2, and null for node P2.\n * @param node LexicalNode.\n * @returns An array (tuple) containing the found Lexical node and the depth difference, or null, if this node doesn't exist.\n */\nfunction $getNextSiblingOrParentSibling(node) {\n  const rval = $getAdjacentSiblingOrParentSiblingCaret($getSiblingCaret(node, 'next'));\n  return rval && [rval[0].origin, rval[1]];\n}\nfunction $getDepth(node) {\n  let depth = -1;\n  for (let innerNode = node; innerNode !== null; innerNode = innerNode.getParent()) {\n    depth++;\n  }\n  return depth;\n}\n\n/**\n * Performs a right-to-left preorder tree traversal.\n * From the starting node it goes to the rightmost child, than backtracks to parent and finds new rightmost path.\n * It will return the next node in traversal sequence after the startingNode.\n * The traversal is similar to $dfs functions above, but the nodes are visited right-to-left, not left-to-right.\n * @param startingNode - The node to start the search.\n * @returns The next node in pre-order right to left traversal sequence or `null`, if the node does not exist\n */\nfunction $getNextRightPreorderNode(startingNode) {\n  const startCaret = $getChildCaretOrSelf($getSiblingCaret(startingNode, 'previous'));\n  const next = $getAdjacentSiblingOrParentSiblingCaret(startCaret, 'root');\n  return next && next[0].origin;\n}\n\n/**\n * $dfs iterator (right to left). Tree traversal is done on the fly as new values are requested with O(1) memory.\n * @param startNode - The node to start the search, if omitted, it will start at the root node.\n * @param endNode - The node to end the search, if omitted, it will find all descendants of the startingNode.\n * @returns An iterator, each yielded value is a DFSNode. It will always return at least 1 node (the start node).\n */\nfunction $reverseDfsIterator(startNode, endNode) {\n  return $dfsCaretIterator('previous', startNode, endNode);\n}\n\n/**\n * Takes a node and traverses up its ancestors (toward the root node)\n * in order to find a specific type of node.\n * @param node - the node to begin searching.\n * @param klass - an instance of the type of node to look for.\n * @returns the node of type klass that was passed, or null if none exist.\n */\nfunction $getNearestNodeOfType(node, klass) {\n  let parent = node;\n  while (parent != null) {\n    if (parent instanceof klass) {\n      return parent;\n    }\n    parent = parent.getParent();\n  }\n  return null;\n}\n\n/**\n * Returns the element node of the nearest ancestor, otherwise throws an error.\n * @param startNode - The starting node of the search\n * @returns The ancestor node found\n */\nfunction $getNearestBlockElementAncestorOrThrow(startNode) {\n  const blockNode = $findMatchingParent(startNode, node => $isElementNode(node) && !node.isInline());\n  if (!$isElementNode(blockNode)) {\n    {\n      formatDevErrorMessage(`Expected node ${startNode.__key} to have closest block element node.`);\n    }\n  }\n  return blockNode;\n}\n/**\n * Attempts to resolve nested element nodes of the same type into a single node of that type.\n * It is generally used for marks/commenting\n * @param editor - The lexical editor\n * @param targetNode - The target for the nested element to be extracted from.\n * @param cloneNode - See {@link $createMarkNode}\n * @param handleOverlap - Handles any overlap between the node to extract and the targetNode\n * @returns The lexical editor\n */\nfunction registerNestedElementResolver(editor, targetNode, cloneNode, handleOverlap) {\n  const $isTargetNode = node => {\n    return node instanceof targetNode;\n  };\n  const $findMatch = node => {\n    // First validate we don't have any children that are of the target,\n    // as we need to handle them first.\n    const children = node.getChildren();\n    for (let i = 0; i < children.length; i++) {\n      const child = children[i];\n      if ($isTargetNode(child)) {\n        return null;\n      }\n    }\n    let parentNode = node;\n    let childNode = node;\n    while (parentNode !== null) {\n      childNode = parentNode;\n      parentNode = parentNode.getParent();\n      if ($isTargetNode(parentNode)) {\n        return {\n          child: childNode,\n          parent: parentNode\n        };\n      }\n    }\n    return null;\n  };\n  const $elementNodeTransform = node => {\n    const match = $findMatch(node);\n    if (match !== null) {\n      const {\n        child,\n        parent\n      } = match;\n\n      // Simple path, we can move child out and siblings into a new parent.\n\n      if (child.is(node)) {\n        handleOverlap(parent, node);\n        const nextSiblings = child.getNextSiblings();\n        const nextSiblingsLength = nextSiblings.length;\n        parent.insertAfter(child);\n        if (nextSiblingsLength !== 0) {\n          const newParent = cloneNode(parent);\n          child.insertAfter(newParent);\n          for (let i = 0; i < nextSiblingsLength; i++) {\n            newParent.append(nextSiblings[i]);\n          }\n        }\n        if (!parent.canBeEmpty() && parent.getChildrenSize() === 0) {\n          parent.remove();\n        }\n      }\n    }\n  };\n  return editor.registerNodeTransform(targetNode, $elementNodeTransform);\n}\n\n/**\n * Clones the editor and marks it as dirty to be reconciled. If there was a selection,\n * it would be set back to its previous state, or null otherwise.\n * @param editor - The lexical editor\n * @param editorState - The editor's state\n */\nfunction $restoreEditorState(editor, editorState) {\n  const FULL_RECONCILE = 2;\n  const nodeMap = new Map();\n  const activeEditorState = editor._pendingEditorState;\n  for (const [key, node] of editorState._nodeMap) {\n    nodeMap.set(key, $cloneWithProperties(node));\n  }\n  if (activeEditorState) {\n    activeEditorState._nodeMap = nodeMap;\n  }\n  editor._dirtyType = FULL_RECONCILE;\n  const selection = editorState._selection;\n  $setSelection(selection === null ? null : selection.clone());\n}\n\n/**\n * If the selected insertion area is the root/shadow root node (see {@link lexical!$isRootOrShadowRoot}),\n * the node will be appended there, otherwise, it will be inserted before the insertion area.\n * If there is no selection where the node is to be inserted, it will be appended after any current nodes\n * within the tree, as a child of the root node. A paragraph will then be added after the inserted node and selected.\n * @param node - The node to be inserted\n * @returns The node after its insertion\n */\nfunction $insertNodeToNearestRoot(node) {\n  const selection = $getSelection() || $getPreviousSelection();\n  let initialCaret;\n  if ($isRangeSelection(selection)) {\n    initialCaret = $caretFromPoint(selection.focus, 'next');\n  } else {\n    if (selection != null) {\n      const nodes = selection.getNodes();\n      const lastNode = nodes[nodes.length - 1];\n      if (lastNode) {\n        initialCaret = $getSiblingCaret(lastNode, 'next');\n      }\n    }\n    initialCaret = initialCaret || $getChildCaret($getRoot(), 'previous').getFlipped().insert($createParagraphNode());\n  }\n  const insertCaret = $insertNodeToNearestRootAtCaret(node, initialCaret);\n  const adjacent = $getAdjacentChildCaret(insertCaret);\n  const selectionCaret = $isChildCaret(adjacent) ? $normalizeCaret(adjacent) : insertCaret;\n  $setSelectionFromCaretRange($getCollapsedCaretRange(selectionCaret));\n  return node.getLatest();\n}\n\n/**\n * If the insertion caret is the root/shadow root node (see {@link lexical!$isRootOrShadowRoot}),\n * the node will be inserted there, otherwise the parent nodes will be split according to the\n * given options.\n * @param node - The node to be inserted\n * @param caret - The location to insert or split from\n * @returns The node after its insertion\n */\nfunction $insertNodeToNearestRootAtCaret(node, caret, options) {\n  let insertCaret = $getCaretInDirection(caret, 'next');\n  // Normalize boundary cases for TextPointCaret\n  if ($isTextPointCaret(insertCaret)) {\n    if (insertCaret.offset === 0) {\n      insertCaret = $getSiblingCaret(insertCaret.origin, 'previous').getFlipped();\n    } else if (insertCaret.offset === insertCaret.origin.getTextContentSize()) {\n      insertCaret = $getSiblingCaret(insertCaret.origin, 'next');\n    }\n  }\n  // Make sure we have a distinct node as the origin\n  if (insertCaret.origin.is(node)) {\n    if (!$isSiblingCaret(insertCaret)) {\n      formatDevErrorMessage(`$insertNodeToNearestRootAtCaret node ${node.getKey()} of type ${node.getType()} can not be inserted into itself`);\n    }\n    insertCaret = $rewindSiblingCaret(insertCaret);\n  }\n  // Handle split boundary conditions where node is being inserted adjacent to itself\n  if (node.is(insertCaret.getNodeAtCaret()) || node.is(insertCaret.getFlipped().getNodeAtCaret())) {\n    node.remove(true);\n  }\n  for (let nextCaret = insertCaret; nextCaret; nextCaret = $splitAtPointCaretNext(nextCaret, options)) {\n    insertCaret = nextCaret;\n  }\n  if (!!$isTextPointCaret(insertCaret)) {\n    formatDevErrorMessage(`$insertNodeToNearestRootAtCaret: An unattached TextNode can not be split`);\n  }\n  insertCaret.insert(node.isInline() ? $createParagraphNode().append(node) : node);\n  return $getCaretInDirection($getSiblingCaret(node.getLatest(), 'next'), caret.direction);\n}\n\n/**\n * Inserts a node into leaf — the deepest accessible node at the carriage position\n * @param node - The node to be inserted\n */\nfunction $insertNodeIntoLeaf(node) {\n  const selection = $getSelection();\n  if (!$isRangeSelection(selection)) {\n    if (selection) {\n      selection.insertNodes([node]);\n    }\n    return;\n  }\n  const caretRange = $caretRangeFromSelection(selection);\n  let insertCaret = $getCaretRangeInDirection($removeTextFromCaretRange(caretRange), 'next').anchor;\n  if ($isTextPointCaret(insertCaret)) {\n    const nextAnchor = $splitAtPointCaretNext(insertCaret);\n    if (!nextAnchor) {\n      return;\n    }\n    insertCaret = nextAnchor;\n  }\n  const focus = insertCaret.getFlipped();\n  focus.insert(node);\n  $setSelectionFromCaretRange($getCaretRange(focus, focus));\n}\n\n/**\n * Wraps the node into another node created from a createElementNode function, eg. $createParagraphNode\n * @param node - Node to be wrapped.\n * @param createElementNode - Creates a new lexical element to wrap the to-be-wrapped node and returns it.\n * @returns A new lexical element with the previous node appended within (as a child, including its children).\n */\nfunction $wrapNodeInElement(node, createElementNode) {\n  const elementNode = createElementNode();\n  node.replace(elementNode);\n  elementNode.append(node);\n  return elementNode;\n}\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n\n/**\n * @param object = The instance of the type\n * @param objectClass = The class of the type\n * @returns Whether the object is has the same Klass of the objectClass, ignoring the difference across window (e.g. different iframes)\n */\nfunction objectKlassEquals(object, objectClass) {\n  return object !== null ? Object.getPrototypeOf(object).constructor.name === objectClass.name : false;\n}\n\n/**\n * @deprecated Use Array filter or flatMap\n *\n * Filter the nodes\n * @param nodes Array of nodes that needs to be filtered\n * @param filterFn A filter function that returns node if the current node satisfies the condition otherwise null\n * @returns Array of filtered nodes\n */\n\nfunction $filter(nodes, filterFn) {\n  const result = [];\n  for (let i = 0; i < nodes.length; i++) {\n    const node = filterFn(nodes[i]);\n    if (node !== null) {\n      result.push(node);\n    }\n  }\n  return result;\n}\n\n/**\n * Applies the provided callback to each indentable block element in the Selection\n *\n * @param indentOrOutdent callback for performing the indent or outdent action\n * on a given block element.\n * @returns true if at least one block was handled, false otherwise.\n */\nfunction $handleIndentAndOutdent(indentOrOutdent) {\n  const selection = $getSelection();\n  if (!$isRangeSelection(selection)) {\n    return false;\n  }\n  const alreadyHandled = new Set();\n  const nodes = selection.getNodes();\n  for (let i = 0; i < nodes.length; i++) {\n    const node = nodes[i];\n    const key = node.getKey();\n    if (alreadyHandled.has(key)) {\n      continue;\n    }\n    const parentBlock = $findMatchingParent(node, parentNode => $isElementNode(parentNode) && !parentNode.isInline());\n    if (parentBlock === null) {\n      continue;\n    }\n    const parentKey = parentBlock.getKey();\n    if (parentBlock.canIndent() && !alreadyHandled.has(parentKey)) {\n      alreadyHandled.add(parentKey);\n      indentOrOutdent(parentBlock);\n    }\n  }\n  return alreadyHandled.size > 0;\n}\n\n/**\n * Appends the node before the first child of the parent node\n * @param parent A parent node\n * @param node Node that needs to be appended\n */\nfunction $insertFirst(parent, node) {\n  $getChildCaret(parent, 'next').insert(node);\n}\nlet NEEDS_MANUAL_ZOOM = IS_FIREFOX || !CAN_USE_DOM ? false : undefined;\nfunction needsManualZoom() {\n  if (NEEDS_MANUAL_ZOOM === undefined) {\n    // If the browser implements standardized CSS zoom, then the client rect\n    // will be wider after zoom is applied\n    // https://chromestatus.com/feature/5198254868529152\n    // https://github.com/facebook/lexical/issues/6863\n    const div = document.createElement('div');\n    div.style.position = 'absolute';\n    div.style.opacity = '0';\n    div.style.width = '100px';\n    div.style.left = '-1000px';\n    document.body.appendChild(div);\n    const noZoom = div.getBoundingClientRect();\n    div.style.setProperty('zoom', '2');\n    NEEDS_MANUAL_ZOOM = div.getBoundingClientRect().width === noZoom.width;\n    document.body.removeChild(div);\n  }\n  return NEEDS_MANUAL_ZOOM;\n}\n\n/**\n * Calculates the zoom level of an element as a result of using\n * css zoom property. For browsers that implement standardized CSS\n * zoom (Firefox, Chrome >= 128), this will always return 1.\n * @param element\n * @param useManualZoom - If true, always use zoom level will be calculated manually, otherwise it will be calculated on as needed basis.\n */\nfunction calculateZoomLevel(element, useManualZoom = false) {\n  let zoom = 1;\n  if (needsManualZoom() || useManualZoom) {\n    while (element) {\n      zoom *= Number(window.getComputedStyle(element).getPropertyValue('zoom'));\n      element = element.parentElement;\n    }\n  }\n  return zoom;\n}\n\n/**\n * Checks if the editor is a nested editor created by LexicalNestedComposer\n */\nfunction $isEditorIsNestedEditor(editor) {\n  return editor._parentEditor !== null;\n}\n\n/**\n * A depth first last-to-first traversal of root that stops at each node that matches\n * $predicate and ensures that its parent is root. This is typically used to discard\n * invalid or unsupported wrapping nodes. For example, a TableNode must only have\n * TableRowNode as children, but an importer might add invalid nodes based on\n * caption, tbody, thead, etc. and this will unwrap and discard those.\n *\n * @param root The root to start the traversal\n * @param $predicate Should return true for nodes that are permitted to be children of root\n * @returns true if this unwrapped or removed any nodes\n */\nfunction $unwrapAndFilterDescendants(root, $predicate) {\n  return $unwrapAndFilterDescendantsImpl(root, $predicate, null);\n}\nfunction $unwrapAndFilterDescendantsImpl(root, $predicate, $onSuccess) {\n  let didMutate = false;\n  for (const node of $lastToFirstIterator(root)) {\n    if ($predicate(node)) {\n      if ($onSuccess !== null) {\n        $onSuccess(node);\n      }\n      continue;\n    }\n    didMutate = true;\n    if ($isElementNode(node)) {\n      $unwrapAndFilterDescendantsImpl(node, $predicate, $onSuccess || (child => node.insertAfter(child)));\n    }\n    node.remove();\n  }\n  return didMutate;\n}\n\n/**\n * A depth first traversal of the children array that stops at and collects\n * each node that `$predicate` matches. This is typically used to discard\n * invalid or unsupported wrapping nodes on a children array in the `after`\n * of an {@link lexical!DOMConversionOutput}. For example, a TableNode must only have\n * TableRowNode as children, but an importer might add invalid nodes based on\n * caption, tbody, thead, etc. and this will unwrap and discard those.\n *\n * This function is read-only and performs no mutation operations, which makes\n * it suitable for import and export purposes but likely not for any in-place\n * mutation. You should use {@link $unwrapAndFilterDescendants} for in-place\n * mutations such as node transforms.\n *\n * @param children The children to traverse\n * @param $predicate Should return true for nodes that are permitted to be children of root\n * @returns The children or their descendants that match $predicate\n */\n\nfunction $descendantsMatching(children, $predicate) {\n  const result = [];\n  const stack = Array.from(children).reverse();\n  for (let child = stack.pop(); child !== undefined; child = stack.pop()) {\n    if ($predicate(child)) {\n      result.push(child);\n    } else if ($isElementNode(child)) {\n      for (const grandchild of $lastToFirstIterator(child)) {\n        stack.push(grandchild);\n      }\n    }\n  }\n  return result;\n}\n\n/**\n * Return an iterator that yields each child of node from first to last, taking\n * care to preserve the next sibling before yielding the value in case the caller\n * removes the yielded node.\n *\n * @param node The node whose children to iterate\n * @returns An iterator of the node's children\n */\nfunction $firstToLastIterator(node) {\n  return $childIterator($getChildCaret(node, 'next'));\n}\n\n/**\n * Return an iterator that yields each child of node from last to first, taking\n * care to preserve the previous sibling before yielding the value in case the caller\n * removes the yielded node.\n *\n * @param node The node whose children to iterate\n * @returns An iterator of the node's children\n */\nfunction $lastToFirstIterator(node) {\n  return $childIterator($getChildCaret(node, 'previous'));\n}\nfunction $childIterator(startCaret) {\n  const seen = new Set() ;\n  return makeStepwiseIterator({\n    hasNext: $isSiblingCaret,\n    initial: startCaret.getAdjacentCaret(),\n    map: caret => {\n      const origin = caret.origin.getLatest();\n      if (seen !== null) {\n        const key = origin.getKey();\n        if (!!seen.has(key)) {\n          formatDevErrorMessage(`$childIterator: Cycle detected, node with key ${String(key)} has already been traversed`);\n        }\n        seen.add(key);\n      }\n      return origin;\n    },\n    step: caret => caret.getAdjacentCaret()\n  });\n}\n\n/**\n * Replace this node with its children\n *\n * @param node The ElementNode to unwrap and remove\n */\nfunction $unwrapNode(node) {\n  $rewindSiblingCaret($getSiblingCaret(node, 'next')).splice(1, node.getChildren());\n}\n\n/**\n * A wrapper that creates bound functions and methods for the\n * StateConfig to save some boilerplate when defining methods\n * or exporting only the accessors from your modules rather\n * than exposing the StateConfig directly.\n */\n\n/**\n * EXPERIMENTAL\n *\n * A convenience interface for working with {@link $getState} and\n * {@link $setState}.\n *\n * @param stateConfig The stateConfig to wrap with convenience functionality\n * @returns a StateWrapper\n */\nfunction makeStateWrapper(stateConfig) {\n  const $get = node => $getState(node, stateConfig);\n  const $set = (node, valueOrUpdater) => $setState(node, stateConfig, valueOrUpdater);\n  return {\n    $get,\n    $set,\n    accessors: [$get, $set],\n    makeGetterMethod: () => function $getter() {\n      return $get(this);\n    },\n    makeSetterMethod: () => function $setter(valueOrUpdater) {\n      return $set(this, valueOrUpdater);\n    },\n    stateConfig\n  };\n}\n\nexport { $descendantsMatching, $dfs, $dfsIterator, $filter, $firstToLastIterator, $getAdjacentCaret, $getDepth, $getNearestBlockElementAncestorOrThrow, $getNearestNodeOfType, $getNextRightPreorderNode, $getNextSiblingOrParentSibling, $handleIndentAndOutdent, $insertFirst, $insertNodeIntoLeaf, $insertNodeToNearestRoot, $insertNodeToNearestRootAtCaret, $isEditorIsNestedEditor, $lastToFirstIterator, $restoreEditorState, $reverseDfs, $reverseDfsIterator, $unwrapAndFilterDescendants, $unwrapNode, $wrapNodeInElement, CAN_USE_BEFORE_INPUT, CAN_USE_DOM, IS_ANDROID, IS_ANDROID_CHROME, IS_APPLE, IS_APPLE_WEBKIT, IS_CHROME, IS_FIREFOX, IS_IOS, IS_SAFARI, calculateZoomLevel, isMimeType, makeStateWrapper, markSelection, mediaFileReader, objectKlassEquals, mlcPositionNodeOnRange as positionNodeOnRange, registerNestedElementResolver, selectionAlwaysOnDisplay };\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;AAsBA,SAAS,sBAAsB,SAAS;CACtC,MAAM,IAAI,MAAM,OAAO;AACzB;;;;;;;;AAUA,MAAM,gBAAgB,OAAO,WAAW,eAAe,OAAO,OAAO,aAAa,eAAe,OAAO,OAAO,SAAS,kBAAkB;;;;;;;;AAU1I,MAAM,eAAe,iBAAiB,kBAAkB,WAAW,SAAS,eAAe;AAC3F,MAAM,aAAa,iBAAiB,uBAAuB,KAAK,UAAU,QAAQ;AAClF,MAAM,eAAe,iBAAiB,mCAAmC,KAAK,UAAU,SAAS;AACjG,MAAM,yBAAyB,iBAAiB,gBAAgB,UAAU,CAAC,eAAe,qBAAqB,IAAI,OAAO,WAAW,OAAO,IAAI;AAChJ,MAAM,WAAW,iBAAiB,mBAAmB,KAAK,UAAU,SAAS,KAAK,CAAC,OAAO;AAC1F,MAAM,eAAe,iBAAiB,UAAU,KAAK,UAAU,SAAS;AAIxE,MAAM,cAAc,iBAAiB,0BAA0B,KAAK,UAAU,SAAS,KAAK,CAAC;AAI7F,MAAM,cAAc,iBAAiB,mBAAmB,KAAK,UAAU,SAAS;AAGhF,MAAM,sBAAsB,iBAAiB,gBAAgB;AAC7D,MAAM,oBAAoB,iBAAiB,sBAAsB,KAAK,UAAU,SAAS,KAAK,cAAc,CAAC;;;;;;;;AAU7G,SAAS,GAAG,OAAO;CACjB,OAAO,GAAG,MAAM;AAClB;AAEA,MAAM,yBAAyB;CAC7B,YAAY;CACZ,eAAe;CACf,WAAW;CACX,SAAS;AACX;AACA,SAAS,eAAe,QAAQ,MAAM;CACpC,OAAO,aAAa,MAAM,OAAO,UAAU;AAC7C;;;;;;;;;;;;;AAcA,SAAS,uBAAuB,QAAQ,OAAO,cAAc;CAC3D,IAAI,cAAc;CAClB,IAAI,gBAAgB;CACpB,IAAI,WAAW;CACf,IAAI,YAAY,CAAC;CACjB,MAAM,cAAc,SAAS,cAAc,KAAK;CAChD,YAAY,MAAM,WAAW;CAC7B,SAAS,WAAW;EAClB,IAAI,EAAE,gBAAgB,OACpB,sBAAsB,6BAA6B;EAErD,IAAI,EAAE,kBAAkB,OACtB,sBAAsB,+BAA+B;EAEvD,MAAM,EACJ,MAAM,YACN,KAAK,cACH,cAAc,sBAAsB;EACxC,MAAM,QAAQ,wBAAwB,QAAQ,KAAK;EACnD,IAAI,CAAC,YAAY,aACf,eAAe,eAAe,WAAW;EAE3C,IAAI,kBAAkB;EACtB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,OAAO,MAAM;GAGnB,MAAM,WAAW,UAAU,MAAM,SAAS,cAAc,KAAK;GAC7D,MAAM,gBAAgB,SAAS;GAC/B,IAAI,cAAc,aAAa,YAAY;IACzC,cAAc,WAAW;IACzB,kBAAkB;GACpB;GACA,MAAM,OAAO,GAAG,KAAK,OAAO,UAAU;GACtC,IAAI,cAAc,SAAS,MAAM;IAC/B,cAAc,OAAO;IACrB,kBAAkB;GACpB;GACA,MAAM,MAAM,GAAG,KAAK,MAAM,SAAS;GACnC,IAAI,cAAc,QAAQ,KAAK;IAC7B,SAAS,MAAM,MAAM;IACrB,kBAAkB;GACpB;GACA,MAAM,QAAQ,GAAG,KAAK,KAAK;GAC3B,IAAI,cAAc,UAAU,OAAO;IACjC,SAAS,MAAM,QAAQ;IACvB,kBAAkB;GACpB;GACA,MAAM,SAAS,GAAG,KAAK,MAAM;GAC7B,IAAI,cAAc,WAAW,QAAQ;IACnC,SAAS,MAAM,SAAS;IACxB,kBAAkB;GACpB;GACA,IAAI,SAAS,eAAe,aAAa;IACvC,YAAY,OAAO,QAAQ;IAC3B,kBAAkB;GACpB;GACA,UAAU,KAAK;EACjB;EACA,OAAO,UAAU,SAAS,MAAM,QAC9B,UAAU,IAAI;EAEhB,IAAI,iBACF,aAAa,SAAS;CAE1B;CACA,SAAS,OAAO;EACd,gBAAgB;EAChB,cAAc;EACd,IAAI,aAAa,MACf,SAAS,WAAW;EAEtB,WAAW;EACX,YAAY,OAAO;EACnB,KAAK,MAAM,QAAQ,WACjB,KAAK,OAAO;EAEd,YAAY,CAAC;CACf;CACA,SAAS,UAAU;EACjB,MAAM,qBAAqB,OAAO,eAAe;EACjD,IAAI,uBAAuB,MACzB,OAAO,KAAK;EAEd,MAAM,uBAAuB,mBAAmB;EAChD,IAAI,CAAC,cAAc,oBAAoB,GACrC,OAAO,KAAK;EAEd,KAAK;EACL,cAAc;EACd,gBAAgB;EAChB,WAAW,IAAI,kBAAiB,cAAa;GAC3C,MAAM,kBAAkB,OAAO,eAAe;GAC9C,MAAM,oBAAoB,mBAAmB,gBAAgB;GAC7D,IAAI,oBAAoB,eAAe,sBAAsB,eAC3D,OAAO,QAAQ;GAEjB,KAAK,MAAM,YAAY,WACrB,IAAI,CAAC,YAAY,SAAS,SAAS,MAAM,GAEvC,OAAO,SAAS;EAGtB,CAAC;EACD,SAAS,QAAQ,sBAAsB,sBAAsB;EAC7D,SAAS;CACX;CACA,MAAM,qBAAqB,OAAO,qBAAqB,OAAO;CAC9D,aAAa;EACX,mBAAmB;EACnB,KAAK;CACP;AACF;;;;;;;;AAUA,SAAS,2BAA2B,WAAW;CAC7C,MAAM,SAAS,UAAU,kBAAkB;CAC3C,OAAO,UAAU,WAAW,IAAI,CAAC,OAAO,IAAI,OAAO,EAAE,IAAI;AAC3D;AACA,SAAS,sBAAsB,OAAO,MAAM,KAAK;CAC/C,IAAI,MAAM,SAAS,UAAU,CAAC,eAAe,IAAI,GAE/C,OAAO,CADS,eAAe,GAAG,KAAK,KACtB,MAAM,MAAM;MACxB;EACL,MAAM,SAAS,WAAW;EAC1B,MAAM,OAAO,0BAA0B,MAAM,EAAE,YAAY,MAAM,KAAK,MAAM;EAC5E,OAAO,CAAC,KAAK,SAAS,KAAK,oBAAoB,IAAI,MAAM,MAAM;CACjE;AACF;AACA,SAAS,iBAAiB,QAAQ,OAAO,WAAW,UAAU,KAAK,SAAS,QAAQ;CAElF,MAAM,SADiB,OAAO,UAAU,OAAO,QAAQ,WAAW,UACrC,YAAY;CACzC,MAAM,SAAS,GAAG,sBAAsB,OAAO,WAAW,QAAQ,CAAC;CACnE,MAAM,OAAO,GAAG,sBAAsB,KAAK,SAAS,MAAM,CAAC;CAC3D,OAAO;AACT;AACA,SAAS,oBAAoB,UAAU;CACrC,KAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,eAAe,QAAQ;EAC7B,IAAI,aAAa,eAAe,aAC9B,aAAa,aAAa;EAE5B,IAAI,aAAa,UAAU,iBACzB,aAAa,QAAQ;EAEvB,IAAI,aAAa,cAAc,GAAG,IAAI,GACpC,aAAa,YAAY,GAAG,IAAI;EAElC,IAAI,aAAa,eAAe,GAAG,CAAC,GAClC,aAAa,aAAa,GAAG,CAAC;EAEhC,IAAI,aAAa,kBAAkB,GAAG,CAAC,GACrC,aAAa,gBAAgB,GAAG,CAAC;CAErC;AACF;;;;;;;;;AAUA,SAAS,cAAc,QAAQ,eAAe,qBAAqB;CACjE,IAAI,qBAAqB;CACzB,IAAI,wBAAwB;CAC5B,IAAI,uBAAuB;CAC3B,IAAI,oBAAoB;CACxB,IAAI,uBAAuB;CAC3B,IAAI,sBAAsB;CAC1B,IAAI,4BAA4B,CAAC;CACjC,SAAS,QAAQ,aAAa;EAC5B,YAAY,WAAW;GACrB,MAAM,YAAY,cAAc;GAChC,IAAI,CAAC,kBAAkB,SAAS,GAAG;IAEjC,qBAAqB;IACrB,uBAAuB;IACvB,oBAAoB;IACpB,sBAAsB;IACtB,oBAAoB;IACpB,4BAA4B,CAAC;IAC7B;GACF;GACA,MAAM,CAAC,OAAO,OAAO,2BAA2B,SAAS;GACzD,MAAM,mBAAmB,MAAM,QAAQ;GACvC,MAAM,sBAAsB,iBAAiB,OAAO;GACpD,MAAM,qBAAqB,MAAM;GACjC,MAAM,iBAAiB,IAAI,QAAQ;GACnC,MAAM,oBAAoB,eAAe,OAAO;GAChD,MAAM,mBAAmB,IAAI;GAC7B,MAAM,sBAAsB,OAAO,gBAAgB,mBAAmB;GACtE,MAAM,oBAAoB,OAAO,gBAAgB,iBAAiB;GAClE,MAAM,oBAAoB,uBAAuB,QAAQ,wBAAwB,yBAAyB,uBAAuB,wBAAwB,wBAAwB,mBAAmB,OAAO;GAC3M,MAAM,kBAAkB,sBAAsB,QAAQ,sBAAsB,wBAAwB,qBAAqB,uBAAuB,sBAAsB,kBAAkB,OAAO;GAC/L,KAAK,qBAAqB,oBAAoB,wBAAwB,QAAQ,sBAAsB,MAAM;IACxG,MAAM,QAAQ,iBAAiB,QAAQ,OAAO,kBAAkB,qBAAqB,KAAK,gBAAgB,iBAAiB;IAC3H,oBAAoB;IACpB,sBAAsB,uBAAuB,QAAQ,OAAO,YAAY;GAC1E;GACA,qBAAqB;GACrB,wBAAwB;GACxB,uBAAuB;GACvB,oBAAoB;GACpB,uBAAuB;GACvB,sBAAsB;EACxB,CAAC;CACH;CACA,QAAQ,OAAO,eAAe,CAAC;CAC/B,OAAO,cAAc,OAAO,wBAAwB,EAClD,kBACI,QAAQ,WAAW,CAAC,SAAS;EACjC,oBAAoB;CACtB,CAAC;AACH;;;;;;;;AAUA,SAAS,yBAAyB,QAAQ,cAAc;CACtD,IAAI,sBAAsB;CAC1B,MAAM,0BAA0B;EAC9B,MAAM,eAAe,aAAa;EAClC,MAAM,gBAAgB,gBAAgB,aAAa;EACnD,MAAM,oBAAoB,OAAO,eAAe;EAEhD,IADgC,kBAAkB,QAAQ,sBAAsB,QAAQ,kBAAkB,SAAS,aAAa;OAE1H,wBAAwB,MAAM;IAChC,oBAAoB;IACpB,sBAAsB;GACxB;SAEA,IAAI,wBAAwB,MAC1B,sBAAsB,cAAc,QAAQ,YAAY;CAG9D;CACA,OAAO,OAAO,sBAAqB,gBAAe;EAChD,IAAI,aAAa;GACf,MAAM,WAAW,YAAY;GAC7B,SAAS,iBAAiB,mBAAmB,iBAAiB;GAC9D,kBAAkB;GAClB,aAAa;IACX,IAAI,wBAAwB,MAC1B,oBAAoB;IAEtB,SAAS,oBAAoB,mBAAmB,iBAAiB;GACnE;EACF;CACF,CAAC;AACH;AAGA,MAAM,uBAAuB;AAC7B,MAAM,cAAc;AACpB,MAAM,aAAa;AACnB,MAAM,oBAAoB;AAC1B,MAAM,WAAW;AACjB,MAAM,kBAAkB;AACxB,MAAM,YAAY;AAClB,MAAM,aAAa;AACnB,MAAM,SAAS;AACf,MAAM,YAAY;;;;;;;;;AAUlB,SAAS,WAAW,MAAM,qBAAqB;CAC7C,KAAK,MAAM,kBAAkB,qBAC3B,IAAI,KAAK,KAAK,WAAW,cAAc,GACrC,OAAO;CAGX,OAAO;AACT;;;;;;;;;;;;AAaA,SAAS,gBAAgB,OAAO,qBAAqB;CACnD,MAAM,gBAAgB,MAAM,OAAO,UAAU;CAC7C,OAAO,IAAI,SAAS,SAAS,WAAW;EACtC,MAAM,YAAY,CAAC;EACnB,MAAM,uBAAuB;GAC3B,MAAM,EACJ,MACA,OAAO,SACL,cAAc,KAAK;GACvB,IAAI,MACF,OAAO,QAAQ,SAAS;GAE1B,MAAM,aAAa,IAAI,WAAW;GAClC,WAAW,iBAAiB,SAAS,MAAM;GAC3C,WAAW,iBAAiB,cAAc;IACxC,MAAM,SAAS,WAAW;IAC1B,IAAI,OAAO,WAAW,UACpB,UAAU,KAAK;KACb;KACA;IACF,CAAC;IAEH,eAAe;GACjB,CAAC;GACD,IAAI,WAAW,MAAM,mBAAmB,GACtC,WAAW,cAAc,IAAI;QAE7B,eAAe;EAEnB;EACA,eAAe;CACjB,CAAC;AACH;;;;;;;;;;;;;AAaA,SAAS,KAAK,WAAW,SAAS;CAChC,OAAO,MAAM,KAAK,aAAa,WAAW,OAAO,CAAC;AACpD;;;;;;;AAQA,SAAS,kBAAkB,OAAO;CAChC,OAAO,QAAQ,MAAM,iBAAiB,IAAI;AAC5C;;;;;;;AAQA,SAAS,YAAY,WAAW,SAAS;CACvC,OAAO,MAAM,KAAK,oBAAoB,WAAW,OAAO,CAAC;AAC3D;;;;;;;;;AAUA,SAAS,aAAa,WAAW,SAAS;CACxC,OAAO,kBAAkB,QAAQ,WAAW,OAAO;AACrD;AACA,SAAS,aAAa,WAAW,WAAW;CAC1C,MAAM,OAAO,wCAAwC,iBAAiB,WAAW,SAAS,CAAC;CAC3F,OAAO,QAAQ,KAAK;AACtB;AACA,SAAS,kBAAkB,WAAW,WAAW,SAAS;CACxD,MAAM,OAAO,SAAS;CACtB,MAAM,QAAQ,aAAa;CAC3B,MAAM,aAAa,eAAe,KAAK,IAAI,eAAe,OAAO,SAAS,IAAI,iBAAiB,OAAO,SAAS;CAC/G,MAAM,aAAa,UAAU,KAAK;CAClC,MAAM,WAAW,UAAU,uBAAuB,qBAAqB,iBAAiB,SAAS,SAAS,CAAC,CAAC,KAAK,aAAa,SAAS,SAAS,IAAI,aAAa,OAAO,SAAS;CACjL,IAAI,QAAQ;CACZ,OAAO,qBAAqB;EAC1B,UAAS,UAAS,UAAU;EAC5B,SAAS;EACT,MAAK,WAAU;GACb;GACA,MAAM,MAAM;EACd;EACA,OAAM,UAAS;GACb,IAAI,MAAM,gBAAgB,QAAQ,GAChC,OAAO;GAET,IAAI,cAAc,KAAK,GACrB;GAEF,MAAM,OAAO,wCAAwC,KAAK;GAC1D,IAAI,CAAC,QAAQ,KAAK,GAAG,gBAAgB,QAAQ,GAC3C,OAAO;GAET,SAAS,KAAK;GACd,OAAO,KAAK;EACd;CACF,CAAC;AACH;;;;;;;;;AAUA,SAAS,+BAA+B,MAAM;CAC5C,MAAM,OAAO,wCAAwC,iBAAiB,MAAM,MAAM,CAAC;CACnF,OAAO,QAAQ,CAAC,KAAK,GAAG,QAAQ,KAAK,EAAE;AACzC;AACA,SAAS,UAAU,MAAM;CACvB,IAAI,QAAQ;CACZ,KAAK,IAAI,YAAY,MAAM,cAAc,MAAM,YAAY,UAAU,UAAU,GAC7E;CAEF,OAAO;AACT;;;;;;;;;AAUA,SAAS,0BAA0B,cAAc;CAE/C,MAAM,OAAO,wCADM,qBAAqB,iBAAiB,cAAc,UAAU,CACnB,GAAG,MAAM;CACvE,OAAO,QAAQ,KAAK,GAAG;AACzB;;;;;;;AAQA,SAAS,oBAAoB,WAAW,SAAS;CAC/C,OAAO,kBAAkB,YAAY,WAAW,OAAO;AACzD;;;;;;;;AASA,SAAS,sBAAsB,MAAM,OAAO;CAC1C,IAAI,SAAS;CACb,OAAO,UAAU,MAAM;EACrB,IAAI,kBAAkB,OACpB,OAAO;EAET,SAAS,OAAO,UAAU;CAC5B;CACA,OAAO;AACT;;;;;;AAOA,SAAS,uCAAuC,WAAW;CACzD,MAAM,YAAY,oBAAoB,YAAW,SAAQ,eAAe,IAAI,KAAK,CAAC,KAAK,SAAS,CAAC;CACjG,IAAI,CAAC,eAAe,SAAS,GAEzB,sBAAsB,iBAAiB,UAAU,MAAM,qCAAqC;CAGhG,OAAO;AACT;;;;;;;;;;AAUA,SAAS,8BAA8B,QAAQ,YAAY,WAAW,eAAe;CACnF,MAAM,iBAAgB,SAAQ;EAC5B,OAAO,gBAAgB;CACzB;CACA,MAAM,cAAa,SAAQ;EAGzB,MAAM,WAAW,KAAK,YAAY;EAClC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;GACxC,MAAM,QAAQ,SAAS;GACvB,IAAI,cAAc,KAAK,GACrB,OAAO;EAEX;EACA,IAAI,aAAa;EACjB,IAAI,YAAY;EAChB,OAAO,eAAe,MAAM;GAC1B,YAAY;GACZ,aAAa,WAAW,UAAU;GAClC,IAAI,cAAc,UAAU,GAC1B,OAAO;IACL,OAAO;IACP,QAAQ;GACV;EAEJ;EACA,OAAO;CACT;CACA,MAAM,yBAAwB,SAAQ;EACpC,MAAM,QAAQ,WAAW,IAAI;EAC7B,IAAI,UAAU,MAAM;GAClB,MAAM,EACJ,OACA,WACE;GAIJ,IAAI,MAAM,GAAG,IAAI,GAAG;IAClB,cAAc,QAAQ,IAAI;IAC1B,MAAM,eAAe,MAAM,gBAAgB;IAC3C,MAAM,qBAAqB,aAAa;IACxC,OAAO,YAAY,KAAK;IACxB,IAAI,uBAAuB,GAAG;KAC5B,MAAM,YAAY,UAAU,MAAM;KAClC,MAAM,YAAY,SAAS;KAC3B,KAAK,IAAI,IAAI,GAAG,IAAI,oBAAoB,KACtC,UAAU,OAAO,aAAa,EAAE;IAEpC;IACA,IAAI,CAAC,OAAO,WAAW,KAAK,OAAO,gBAAgB,MAAM,GACvD,OAAO,OAAO;GAElB;EACF;CACF;CACA,OAAO,OAAO,sBAAsB,YAAY,qBAAqB;AACvE;;;;;;;AAQA,SAAS,oBAAoB,QAAQ,aAAa;CAChD,MAAM,iBAAiB;CACvB,MAAM,0BAAU,IAAI,IAAI;CACxB,MAAM,oBAAoB,OAAO;CACjC,KAAK,MAAM,CAAC,KAAK,SAAS,YAAY,UACpC,QAAQ,IAAI,KAAK,qBAAqB,IAAI,CAAC;CAE7C,IAAI,mBACF,kBAAkB,WAAW;CAE/B,OAAO,aAAa;CACpB,MAAM,YAAY,YAAY;CAC9B,cAAc,cAAc,OAAO,OAAO,UAAU,MAAM,CAAC;AAC7D;;;;;;;;;AAUA,SAAS,yBAAyB,MAAM;CACtC,MAAM,YAAY,cAAc,KAAK,sBAAsB;CAC3D,IAAI;CACJ,IAAI,kBAAkB,SAAS,GAC7B,eAAe,gBAAgB,UAAU,OAAO,MAAM;MACjD;EACL,IAAI,aAAa,MAAM;GACrB,MAAM,QAAQ,UAAU,SAAS;GACjC,MAAM,WAAW,MAAM,MAAM,SAAS;GACtC,IAAI,UACF,eAAe,iBAAiB,UAAU,MAAM;EAEpD;EACA,eAAe,gBAAgB,eAAe,SAAS,GAAG,UAAU,EAAE,WAAW,EAAE,OAAO,qBAAqB,CAAC;CAClH;CACA,MAAM,cAAc,gCAAgC,MAAM,YAAY;CACtE,MAAM,WAAW,uBAAuB,WAAW;CAEnD,4BAA4B,wBADL,cAAc,QAAQ,IAAI,gBAAgB,QAAQ,IAAI,WACX,CAAC;CACnE,OAAO,KAAK,UAAU;AACxB;;;;;;;;;AAUA,SAAS,gCAAgC,MAAM,OAAO,SAAS;CAC7D,IAAI,cAAc,qBAAqB,OAAO,MAAM;CAEpD,IAAI,kBAAkB,WAAW;MAC3B,YAAY,WAAW,GACzB,cAAc,iBAAiB,YAAY,QAAQ,UAAU,EAAE,WAAW;OACrE,IAAI,YAAY,WAAW,YAAY,OAAO,mBAAmB,GACtE,cAAc,iBAAiB,YAAY,QAAQ,MAAM;CAAA;CAI7D,IAAI,YAAY,OAAO,GAAG,IAAI,GAAG;EAC/B,IAAI,CAAC,gBAAgB,WAAW,GAC9B,sBAAsB,wCAAwC,KAAK,OAAO,EAAE,WAAW,KAAK,QAAQ,EAAE,iCAAiC;EAEzI,cAAc,oBAAoB,WAAW;CAC/C;CAEA,IAAI,KAAK,GAAG,YAAY,eAAe,CAAC,KAAK,KAAK,GAAG,YAAY,WAAW,EAAE,eAAe,CAAC,GAC5F,KAAK,OAAO,IAAI;CAElB,KAAK,IAAI,YAAY,aAAa,WAAW,YAAY,uBAAuB,WAAW,OAAO,GAChG,cAAc;CAEhB,IAAI,CAAC,CAAC,kBAAkB,WAAW,GACjC,sBAAsB,0EAA0E;CAElG,YAAY,OAAO,KAAK,SAAS,IAAI,qBAAqB,EAAE,OAAO,IAAI,IAAI,IAAI;CAC/E,OAAO,qBAAqB,iBAAiB,KAAK,UAAU,GAAG,MAAM,GAAG,MAAM,SAAS;AACzF;;;;;AAMA,SAAS,oBAAoB,MAAM;CACjC,MAAM,YAAY,cAAc;CAChC,IAAI,CAAC,kBAAkB,SAAS,GAAG;EACjC,IAAI,WACF,UAAU,YAAY,CAAC,IAAI,CAAC;EAE9B;CACF;CAEA,IAAI,cAAc,0BAA0B,0BADzB,yBAAyB,SACmC,CAAC,GAAG,MAAM,EAAE;CAC3F,IAAI,kBAAkB,WAAW,GAAG;EAClC,MAAM,aAAa,uBAAuB,WAAW;EACrD,IAAI,CAAC,YACH;EAEF,cAAc;CAChB;CACA,MAAM,QAAQ,YAAY,WAAW;CACrC,MAAM,OAAO,IAAI;CACjB,4BAA4B,eAAe,OAAO,KAAK,CAAC;AAC1D;;;;;;;AAQA,SAAS,mBAAmB,MAAM,mBAAmB;CACnD,MAAM,cAAc,kBAAkB;CACtC,KAAK,QAAQ,WAAW;CACxB,YAAY,OAAO,IAAI;CACvB,OAAO;AACT;;;;;;AASA,SAAS,kBAAkB,QAAQ,aAAa;CAC9C,OAAO,WAAW,OAAO,OAAO,eAAe,MAAM,EAAE,YAAY,SAAS,YAAY,OAAO;AACjG;;;;;;;;;AAWA,SAAS,QAAQ,OAAO,UAAU;CAChC,MAAM,SAAS,CAAC;CAChB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,OAAO,SAAS,MAAM,EAAE;EAC9B,IAAI,SAAS,MACX,OAAO,KAAK,IAAI;CAEpB;CACA,OAAO;AACT;;;;;;;;AASA,SAAS,wBAAwB,iBAAiB;CAChD,MAAM,YAAY,cAAc;CAChC,IAAI,CAAC,kBAAkB,SAAS,GAC9B,OAAO;CAET,MAAM,iCAAiB,IAAI,IAAI;CAC/B,MAAM,QAAQ,UAAU,SAAS;CACjC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,OAAO,MAAM;EACnB,MAAM,MAAM,KAAK,OAAO;EACxB,IAAI,eAAe,IAAI,GAAG,GACxB;EAEF,MAAM,cAAc,oBAAoB,OAAM,eAAc,eAAe,UAAU,KAAK,CAAC,WAAW,SAAS,CAAC;EAChH,IAAI,gBAAgB,MAClB;EAEF,MAAM,YAAY,YAAY,OAAO;EACrC,IAAI,YAAY,UAAU,KAAK,CAAC,eAAe,IAAI,SAAS,GAAG;GAC7D,eAAe,IAAI,SAAS;GAC5B,gBAAgB,WAAW;EAC7B;CACF;CACA,OAAO,eAAe,OAAO;AAC/B;;;;;;AAOA,SAAS,aAAa,QAAQ,MAAM;CAClC,eAAe,QAAQ,MAAM,EAAE,OAAO,IAAI;AAC5C;AACA,IAAI,oBAAoB,cAAc,CAAC,cAAc,QAAQ,KAAA;AAC7D,SAAS,kBAAkB;CACzB,IAAI,sBAAsB,KAAA,GAAW;EAKnC,MAAM,MAAM,SAAS,cAAc,KAAK;EACxC,IAAI,MAAM,WAAW;EACrB,IAAI,MAAM,UAAU;EACpB,IAAI,MAAM,QAAQ;EAClB,IAAI,MAAM,OAAO;EACjB,SAAS,KAAK,YAAY,GAAG;EAC7B,MAAM,SAAS,IAAI,sBAAsB;EACzC,IAAI,MAAM,YAAY,QAAQ,GAAG;EACjC,oBAAoB,IAAI,sBAAsB,EAAE,UAAU,OAAO;EACjE,SAAS,KAAK,YAAY,GAAG;CAC/B;CACA,OAAO;AACT;;;;;;;;AASA,SAAS,mBAAmB,SAAS,gBAAgB,OAAO;CAC1D,IAAI,OAAO;CACX,IAAI,gBAAgB,KAAK,eACvB,OAAO,SAAS;EACd,QAAQ,OAAO,OAAO,iBAAiB,OAAO,EAAE,iBAAiB,MAAM,CAAC;EACxE,UAAU,QAAQ;CACpB;CAEF,OAAO;AACT;;;;AAKA,SAAS,wBAAwB,QAAQ;CACvC,OAAO,OAAO,kBAAkB;AAClC;;;;;;;;;;;;AAaA,SAAS,4BAA4B,MAAM,YAAY;CACrD,OAAO,gCAAgC,MAAM,YAAY,IAAI;AAC/D;AACA,SAAS,gCAAgC,MAAM,YAAY,YAAY;CACrE,IAAI,YAAY;CAChB,KAAK,MAAM,QAAQ,qBAAqB,IAAI,GAAG;EAC7C,IAAI,WAAW,IAAI,GAAG;GACpB,IAAI,eAAe,MACjB,WAAW,IAAI;GAEjB;EACF;EACA,YAAY;EACZ,IAAI,eAAe,IAAI,GACrB,gCAAgC,MAAM,YAAY,gBAAe,UAAS,KAAK,YAAY,KAAK,EAAE;EAEpG,KAAK,OAAO;CACd;CACA,OAAO;AACT;;;;;;;;;;;;;;;;;;AAoBA,SAAS,qBAAqB,UAAU,YAAY;CAClD,MAAM,SAAS,CAAC;CAChB,MAAM,QAAQ,MAAM,KAAK,QAAQ,EAAE,QAAQ;CAC3C,KAAK,IAAI,QAAQ,MAAM,IAAI,GAAG,UAAU,KAAA,GAAW,QAAQ,MAAM,IAAI,GACnE,IAAI,WAAW,KAAK,GAClB,OAAO,KAAK,KAAK;MACZ,IAAI,eAAe,KAAK,GAC7B,KAAK,MAAM,cAAc,qBAAqB,KAAK,GACjD,MAAM,KAAK,UAAU;CAI3B,OAAO;AACT;;;;;;;;;AAUA,SAAS,qBAAqB,MAAM;CAClC,OAAO,eAAe,eAAe,MAAM,MAAM,CAAC;AACpD;;;;;;;;;AAUA,SAAS,qBAAqB,MAAM;CAClC,OAAO,eAAe,eAAe,MAAM,UAAU,CAAC;AACxD;AACA,SAAS,eAAe,YAAY;CAClC,MAAM,uBAAO,IAAI,IAAI;CACrB,OAAO,qBAAqB;EAC1B,SAAS;EACT,SAAS,WAAW,iBAAiB;EACrC,MAAK,UAAS;GACZ,MAAM,SAAS,MAAM,OAAO,UAAU;GACtC,IAAI,SAAS,MAAM;IACjB,MAAM,MAAM,OAAO,OAAO;IAC1B,IAAI,CAAC,CAAC,KAAK,IAAI,GAAG,GAChB,sBAAsB,iDAAiD,OAAO,GAAG,EAAE,4BAA4B;IAEjH,KAAK,IAAI,GAAG;GACd;GACA,OAAO;EACT;EACA,OAAM,UAAS,MAAM,iBAAiB;CACxC,CAAC;AACH;;;;;;AAOA,SAAS,YAAY,MAAM;CACzB,oBAAoB,iBAAiB,MAAM,MAAM,CAAC,EAAE,OAAO,GAAG,KAAK,YAAY,CAAC;AAClF;;;;;;;;;;;;;;;;AAkBA,SAAS,iBAAiB,aAAa;CACrC,MAAM,QAAO,SAAQ,UAAU,MAAM,WAAW;CAChD,MAAM,QAAQ,MAAM,mBAAmB,UAAU,MAAM,aAAa,cAAc;CAClF,OAAO;EACL;EACA;EACA,WAAW,CAAC,MAAM,IAAI;EACtB,wBAAwB,SAAS,UAAU;GACzC,OAAO,KAAK,IAAI;EAClB;EACA,wBAAwB,SAAS,QAAQ,gBAAgB;GACvD,OAAO,KAAK,MAAM,cAAc;EAClC;EACA;CACF;AACF"}

package/dist/{LexicalUtils.node-CmK462d1.mjs → LexicalUtils.node-Dz-HANi6.mjs}

@@ -6,7 +6,7 @@
 * LICENSE file in the root directory of this source tree.
 *
 */
-const mod = await (process.env.NODE_ENV !== "production" ? import("./LexicalUtils.dev-DiUpsXE8.mjs") : import("./LexicalUtils.prod-bWwV4GAF.mjs"));
+const mod = await (process.env.NODE_ENV !== "production" ? import("./LexicalUtils.dev-DRRDyAlS.mjs") : import("./LexicalUtils.prod-CmeHwh8W.mjs"));
 const $descendantsMatching = mod.$descendantsMatching;
 const $dfs = mod.$dfs;
 mod.$dfsIterator;
@@ -63,4 +63,4 @@ const selectionAlwaysOnDisplay = mod.selectionAlwaysOnDisplay;
 //#endregion
 export { removeClassNamesFromElement as _, $getNearestNodeOfType as a, $insertNodeToNearestRoot as c, addClassNamesToElement as d, calculateZoomLevel as f, objectKlassEquals as g, mergeRegister as h, $getNearestBlockElementAncestorOrThrow as i, $insertNodeToNearestRootAtCaret as l, isHTMLElement as m, $dfs as n, $handleIndentAndOutdent as o, isHTMLAnchorElement as p, $findMatchingParent as r, $insertFirst as s, $descendantsMatching as t, $unwrapAndFilterDescendants as u, selectionAlwaysOnDisplay as v };
 
-//# sourceMappingURL=LexicalUtils.node-CmK462d1.mjs.map
+//# sourceMappingURL=LexicalUtils.node-Dz-HANi6.mjs.map

package/dist/{LexicalUtils.node-CmK462d1.mjs.map → LexicalUtils.node-Dz-HANi6.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"LexicalUtils.node-CmK462d1.mjs","names":[],"sources":["../../../node_modules/.pnpm/@lexical+utils@0.44.0/node_modules/@lexical/utils/LexicalUtils.node.mjs"],"sourcesContent":["/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nconst mod = await (process.env.NODE_ENV !== 'production' ? import('./LexicalUtils.dev.mjs') : import('./LexicalUtils.prod.mjs'));\nexport const $descendantsMatching = mod.$descendantsMatching;\nexport const $dfs = mod.$dfs;\nexport const $dfsIterator = mod.$dfsIterator;\nexport const $filter = mod.$filter;\nexport const $findMatchingParent = mod.$findMatchingParent;\nexport const $firstToLastIterator = mod.$firstToLastIterator;\nexport const $getAdjacentCaret = mod.$getAdjacentCaret;\nexport const $getAdjacentSiblingOrParentSiblingCaret = mod.$getAdjacentSiblingOrParentSiblingCaret;\nexport const $getDepth = mod.$getDepth;\nexport const $getNearestBlockElementAncestorOrThrow = mod.$getNearestBlockElementAncestorOrThrow;\nexport const $getNearestNodeOfType = mod.$getNearestNodeOfType;\nexport const $getNextRightPreorderNode = mod.$getNextRightPreorderNode;\nexport const $getNextSiblingOrParentSibling = mod.$getNextSiblingOrParentSibling;\nexport const $handleIndentAndOutdent = mod.$handleIndentAndOutdent;\nexport const $insertFirst = mod.$insertFirst;\nexport const $insertNodeIntoLeaf = mod.$insertNodeIntoLeaf;\nexport const $insertNodeToNearestRoot = mod.$insertNodeToNearestRoot;\nexport const $insertNodeToNearestRootAtCaret = mod.$insertNodeToNearestRootAtCaret;\nexport const $isEditorIsNestedEditor = mod.$isEditorIsNestedEditor;\nexport const $lastToFirstIterator = mod.$lastToFirstIterator;\nexport const $restoreEditorState = mod.$restoreEditorState;\nexport const $reverseDfs = mod.$reverseDfs;\nexport const $reverseDfsIterator = mod.$reverseDfsIterator;\nexport const $splitNode = mod.$splitNode;\nexport const $unwrapAndFilterDescendants = mod.$unwrapAndFilterDescendants;\nexport const $unwrapNode = mod.$unwrapNode;\nexport const $wrapNodeInElement = mod.$wrapNodeInElement;\nexport const CAN_USE_BEFORE_INPUT = mod.CAN_USE_BEFORE_INPUT;\nexport const CAN_USE_DOM = mod.CAN_USE_DOM;\nexport const IS_ANDROID = mod.IS_ANDROID;\nexport const IS_ANDROID_CHROME = mod.IS_ANDROID_CHROME;\nexport const IS_APPLE = mod.IS_APPLE;\nexport const IS_APPLE_WEBKIT = mod.IS_APPLE_WEBKIT;\nexport const IS_CHROME = mod.IS_CHROME;\nexport const IS_FIREFOX = mod.IS_FIREFOX;\nexport const IS_IOS = mod.IS_IOS;\nexport const IS_SAFARI = mod.IS_SAFARI;\nexport const addClassNamesToElement = mod.addClassNamesToElement;\nexport const calculateZoomLevel = mod.calculateZoomLevel;\nexport const isBlockDomNode = mod.isBlockDomNode;\nexport const isHTMLAnchorElement = mod.isHTMLAnchorElement;\nexport const isHTMLElement = mod.isHTMLElement;\nexport const isInlineDomNode = mod.isInlineDomNode;\nexport const isMimeType = mod.isMimeType;\nexport const makeStateWrapper = mod.makeStateWrapper;\nexport const markSelection = mod.markSelection;\nexport const mediaFileReader = mod.mediaFileReader;\nexport const mergeRegister = mod.mergeRegister;\nexport const objectKlassEquals = mod.objectKlassEquals;\nexport const positionNodeOnRange = mod.positionNodeOnRange;\nexport const registerNestedElementResolver = mod.registerNestedElementResolver;\nexport const removeClassNamesFromElement = mod.removeClassNamesFromElement;\nexport const selectionAlwaysOnDisplay = mod.selectionAlwaysOnDisplay;"],"x_google_ignoreList":[0],"mappings":";;;;;;;;AAQA,MAAM,MAAM,OAAO,QAAQ,IAAI,aAAa,eAAe,OAAO,qCAA4B,OAAO;AACrG,MAAa,uBAAuB,IAAI;AACxC,MAAa,OAAO,IAAI;AACI,IAAI;AACT,IAAI;AAC3B,MAAa,sBAAsB,IAAI;AACH,IAAI;AACP,IAAI;AACkB,IAAI;AAClC,IAAI;AAC7B,MAAa,yCAAyC,IAAI;AAC1D,MAAa,wBAAwB,IAAI;AACA,IAAI;AACC,IAAI;AAClD,MAAa,0BAA0B,IAAI;AAC3C,MAAa,eAAe,IAAI;AACG,IAAI;AACvC,MAAa,2BAA2B,IAAI;AAC5C,MAAa,kCAAkC,IAAI;AACZ,IAAI;AACP,IAAI;AACL,IAAI;AACZ,IAAI;AACI,IAAI;AACb,IAAI;AAC9B,MAAa,8BAA8B,IAAI;AACpB,IAAI;AACG,IAAI;AACF,IAAI;AACb,IAAI;AACL,IAAI;AACG,IAAI;AACb,IAAI;AACG,IAAI;AACV,IAAI;AACH,IAAI;AACR,IAAI;AACD,IAAI;AAC7B,MAAa,yBAAyB,IAAI;AAC1C,MAAa,qBAAqB,IAAI;AACR,IAAI;AAClC,MAAa,sBAAsB,IAAI;AACvC,MAAa,gBAAgB,IAAI;AACF,IAAI;AACT,IAAI;AACE,IAAI;AACP,IAAI;AACF,IAAI;AACnC,MAAa,gBAAgB,IAAI;AACjC,MAAa,oBAAoB,IAAI;AACF,IAAI;AACM,IAAI;AACjD,MAAa,8BAA8B,IAAI;AAC/C,MAAa,2BAA2B,IAAI"}
+{"version":3,"file":"LexicalUtils.node-Dz-HANi6.mjs","names":[],"sources":["../../../node_modules/.pnpm/@lexical+utils@0.44.0/node_modules/@lexical/utils/LexicalUtils.node.mjs"],"sourcesContent":["/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nconst mod = await (process.env.NODE_ENV !== 'production' ? import('./LexicalUtils.dev.mjs') : import('./LexicalUtils.prod.mjs'));\nexport const $descendantsMatching = mod.$descendantsMatching;\nexport const $dfs = mod.$dfs;\nexport const $dfsIterator = mod.$dfsIterator;\nexport const $filter = mod.$filter;\nexport const $findMatchingParent = mod.$findMatchingParent;\nexport const $firstToLastIterator = mod.$firstToLastIterator;\nexport const $getAdjacentCaret = mod.$getAdjacentCaret;\nexport const $getAdjacentSiblingOrParentSiblingCaret = mod.$getAdjacentSiblingOrParentSiblingCaret;\nexport const $getDepth = mod.$getDepth;\nexport const $getNearestBlockElementAncestorOrThrow = mod.$getNearestBlockElementAncestorOrThrow;\nexport const $getNearestNodeOfType = mod.$getNearestNodeOfType;\nexport const $getNextRightPreorderNode = mod.$getNextRightPreorderNode;\nexport const $getNextSiblingOrParentSibling = mod.$getNextSiblingOrParentSibling;\nexport const $handleIndentAndOutdent = mod.$handleIndentAndOutdent;\nexport const $insertFirst = mod.$insertFirst;\nexport const $insertNodeIntoLeaf = mod.$insertNodeIntoLeaf;\nexport const $insertNodeToNearestRoot = mod.$insertNodeToNearestRoot;\nexport const $insertNodeToNearestRootAtCaret = mod.$insertNodeToNearestRootAtCaret;\nexport const $isEditorIsNestedEditor = mod.$isEditorIsNestedEditor;\nexport const $lastToFirstIterator = mod.$lastToFirstIterator;\nexport const $restoreEditorState = mod.$restoreEditorState;\nexport const $reverseDfs = mod.$reverseDfs;\nexport const $reverseDfsIterator = mod.$reverseDfsIterator;\nexport const $splitNode = mod.$splitNode;\nexport const $unwrapAndFilterDescendants = mod.$unwrapAndFilterDescendants;\nexport const $unwrapNode = mod.$unwrapNode;\nexport const $wrapNodeInElement = mod.$wrapNodeInElement;\nexport const CAN_USE_BEFORE_INPUT = mod.CAN_USE_BEFORE_INPUT;\nexport const CAN_USE_DOM = mod.CAN_USE_DOM;\nexport const IS_ANDROID = mod.IS_ANDROID;\nexport const IS_ANDROID_CHROME = mod.IS_ANDROID_CHROME;\nexport const IS_APPLE = mod.IS_APPLE;\nexport const IS_APPLE_WEBKIT = mod.IS_APPLE_WEBKIT;\nexport const IS_CHROME = mod.IS_CHROME;\nexport const IS_FIREFOX = mod.IS_FIREFOX;\nexport const IS_IOS = mod.IS_IOS;\nexport const IS_SAFARI = mod.IS_SAFARI;\nexport const addClassNamesToElement = mod.addClassNamesToElement;\nexport const calculateZoomLevel = mod.calculateZoomLevel;\nexport const isBlockDomNode = mod.isBlockDomNode;\nexport const isHTMLAnchorElement = mod.isHTMLAnchorElement;\nexport const isHTMLElement = mod.isHTMLElement;\nexport const isInlineDomNode = mod.isInlineDomNode;\nexport const isMimeType = mod.isMimeType;\nexport const makeStateWrapper = mod.makeStateWrapper;\nexport const markSelection = mod.markSelection;\nexport const mediaFileReader = mod.mediaFileReader;\nexport const mergeRegister = mod.mergeRegister;\nexport const objectKlassEquals = mod.objectKlassEquals;\nexport const positionNodeOnRange = mod.positionNodeOnRange;\nexport const registerNestedElementResolver = mod.registerNestedElementResolver;\nexport const removeClassNamesFromElement = mod.removeClassNamesFromElement;\nexport const selectionAlwaysOnDisplay = mod.selectionAlwaysOnDisplay;"],"x_google_ignoreList":[0],"mappings":";;;;;;;;AAQA,MAAM,MAAM,OAAO,QAAQ,IAAI,aAAa,eAAe,OAAO,qCAA4B,OAAO;AACrG,MAAa,uBAAuB,IAAI;AACxC,MAAa,OAAO,IAAI;AACI,IAAI;AACT,IAAI;AAC3B,MAAa,sBAAsB,IAAI;AACH,IAAI;AACP,IAAI;AACkB,IAAI;AAClC,IAAI;AAC7B,MAAa,yCAAyC,IAAI;AAC1D,MAAa,wBAAwB,IAAI;AACA,IAAI;AACC,IAAI;AAClD,MAAa,0BAA0B,IAAI;AAC3C,MAAa,eAAe,IAAI;AACG,IAAI;AACvC,MAAa,2BAA2B,IAAI;AAC5C,MAAa,kCAAkC,IAAI;AACZ,IAAI;AACP,IAAI;AACL,IAAI;AACZ,IAAI;AACI,IAAI;AACb,IAAI;AAC9B,MAAa,8BAA8B,IAAI;AACpB,IAAI;AACG,IAAI;AACF,IAAI;AACb,IAAI;AACL,IAAI;AACG,IAAI;AACb,IAAI;AACG,IAAI;AACV,IAAI;AACH,IAAI;AACR,IAAI;AACD,IAAI;AAC7B,MAAa,yBAAyB,IAAI;AAC1C,MAAa,qBAAqB,IAAI;AACR,IAAI;AAClC,MAAa,sBAAsB,IAAI;AACvC,MAAa,gBAAgB,IAAI;AACF,IAAI;AACT,IAAI;AACE,IAAI;AACP,IAAI;AACF,IAAI;AACnC,MAAa,gBAAgB,IAAI;AACjC,MAAa,oBAAoB,IAAI;AACF,IAAI;AACM,IAAI;AACjD,MAAa,8BAA8B,IAAI;AAC/C,MAAa,2BAA2B,IAAI"}

package/dist/{LexicalUtils.prod-bWwV4GAF.mjs → LexicalUtils.prod-CmeHwh8W.mjs}

@@ -1,5 +1,5 @@
-import { A as $getCollapsedCaretRange, B as $getSiblingCaret, C as $getCaretInDirection, D as $getChildCaret, Gn as isHTMLElement, K as $isChildCaret, Kn as isInlineDomNode, L as $getPreviousSelection, M as $getEditorDOMRenderConfig, Pn as getDOMTextNode, Qn as removeClassNamesFromElement, R as $getRoot, S as $getAdjacentSiblingOrParentSiblingCaret, St as $splitNode, T as $getCaretRangeInDirection, Tn as addClassNamesToElement, V as $getState, Wn as isHTMLAnchorElement, Xn as mergeRegister, Y as $isElementNode, Yn as makeStepwiseIterator, a as $cloneWithProperties, b as $getAdjacentChildCaret, bt as $setState, dt as $normalizeCaret, f as $createParagraphNode, ht as $rewindSiblingCaret, i as $caretRangeFromSelection, j as $getEditor, k as $getChildCaretOrSelf, lt as $isTextPointCaret, mt as $removeTextFromCaretRange, ot as $isSiblingCaret, r as $caretFromPoint, rt as $isRangeSelection, vt as $setSelection, w as $getCaretRange, xt as $splitAtPointCaretNext, y as $findMatchingParent, yt as $setSelectionFromCaretRange, z as $getSelection, zn as isBlockDomNode } from "./Lexical.node-gYNDt_p9.mjs";
-import { o as createRectsFromDOMRange } from "./LexicalSelection.node-Di7GwBCZ.mjs";
+import { A as $getCollapsedCaretRange, B as $getSiblingCaret, C as $getCaretInDirection, D as $getChildCaret, Gn as isHTMLElement, K as $isChildCaret, Kn as isInlineDomNode, L as $getPreviousSelection, M as $getEditorDOMRenderConfig, Pn as getDOMTextNode, Qn as removeClassNamesFromElement, R as $getRoot, S as $getAdjacentSiblingOrParentSiblingCaret, St as $splitNode, T as $getCaretRangeInDirection, Tn as addClassNamesToElement, V as $getState, Wn as isHTMLAnchorElement, Xn as mergeRegister, Y as $isElementNode, Yn as makeStepwiseIterator, a as $cloneWithProperties, b as $getAdjacentChildCaret, bt as $setState, dt as $normalizeCaret, f as $createParagraphNode, ht as $rewindSiblingCaret, i as $caretRangeFromSelection, j as $getEditor, k as $getChildCaretOrSelf, lt as $isTextPointCaret, mt as $removeTextFromCaretRange, ot as $isSiblingCaret, r as $caretFromPoint, rt as $isRangeSelection, vt as $setSelection, w as $getCaretRange, xt as $splitAtPointCaretNext, y as $findMatchingParent, yt as $setSelectionFromCaretRange, z as $getSelection, zn as isBlockDomNode } from "./Lexical.node-BR9e7Cyk.mjs";
+import { o as createRectsFromDOMRange } from "./LexicalSelection.node-CQ8iTYsz.mjs";
 //#region ../../node_modules/.pnpm/@lexical+utils@0.44.0/node_modules/@lexical/utils/LexicalUtils.prod.mjs
 /**
 * Copyright (c) Meta Platforms, Inc. and affiliates.
@@ -374,4 +374,4 @@ function Wt(t) {
 //#endregion
 export { Ht as $descendantsMatching, pt as $dfs, vt as $dfsIterator, Kt as $filter, $findMatchingParent, jt as $firstToLastIterator, mt as $getAdjacentCaret, $getAdjacentSiblingOrParentSiblingCaret, Et as $getDepth, Nt as $getNearestBlockElementAncestorOrThrow, At as $getNearestNodeOfType, Ct as $getNextRightPreorderNode, xt as $getNextSiblingOrParentSibling, _t as $handleIndentAndOutdent, $t as $insertFirst, Mt as $insertNodeIntoLeaf, Pt as $insertNodeToNearestRoot, Rt as $insertNodeToNearestRootAtCaret, It as $isEditorIsNestedEditor, zt as $lastToFirstIterator, Lt as $restoreEditorState, ht as $reverseDfs, St as $reverseDfsIterator, $splitNode, Ot as $unwrapAndFilterDescendants, Vt as $unwrapNode, Tt as $wrapNodeInElement, nt as CAN_USE_BEFORE_INPUT, ot as CAN_USE_DOM, rt as IS_ANDROID, it as IS_ANDROID_CHROME, lt as IS_APPLE, st as IS_APPLE_WEBKIT, ut as IS_CHROME, ct as IS_FIREFOX, at as IS_IOS, ft as IS_SAFARI, addClassNamesToElement, Ft as calculateZoomLevel, isBlockDomNode, isHTMLAnchorElement, isHTMLElement, isInlineDomNode, dt as isMimeType, Wt as makeStateWrapper, tt as markSelection, gt as mediaFileReader, mergeRegister, Bt as objectKlassEquals, X as positionNodeOnRange, bt as registerNestedElementResolver, removeClassNamesFromElement, et as selectionAlwaysOnDisplay };
 
-//# sourceMappingURL=LexicalUtils.prod-bWwV4GAF.mjs.map
+//# sourceMappingURL=LexicalUtils.prod-CmeHwh8W.mjs.map

package/dist/{LexicalUtils.prod-bWwV4GAF.mjs.map → LexicalUtils.prod-CmeHwh8W.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"LexicalUtils.prod-bWwV4GAF.mjs","names":["k","t","r","l","s","i","n","o","e","d","f","C","u","A","a","K","c","T","x","E","S","y","L","N","b","P","R","M","v","h","p","m","g","w","_","$"],"sources":["../../../node_modules/.pnpm/@lexical+utils@0.44.0/node_modules/@lexical/utils/LexicalUtils.prod.mjs"],"sourcesContent":["/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nimport{isHTMLElement as t,mergeRegister as e,$getSelection as n,$isRangeSelection as o,$isElementNode as r,getDOMTextNode as i,$getEditor as l,$getEditorDOMRenderConfig as s,$getChildCaret as u,$findMatchingParent as c,$getChildCaretOrSelf as a,$getSiblingCaret as f,$getAdjacentSiblingOrParentSiblingCaret as d,$caretRangeFromSelection as g,$getCaretRangeInDirection as p,$removeTextFromCaretRange as m,$isTextPointCaret as h,$splitAtPointCaretNext as v,$setSelectionFromCaretRange as y,$getCaretRange as w,$getPreviousSelection as x,$caretFromPoint as E,$getRoot as C,$createParagraphNode as S,$getAdjacentChildCaret as A,$isChildCaret as N,$normalizeCaret as b,$getCollapsedCaretRange as L,$getCaretInDirection as P,$isSiblingCaret as R,$rewindSiblingCaret as M,$cloneWithProperties as T,$setSelection as B,makeStepwiseIterator as K,$getState as _,$setState as $}from\"lexical\";export{$findMatchingParent,$getAdjacentSiblingOrParentSiblingCaret,$splitNode,addClassNamesToElement,isBlockDomNode,isHTMLAnchorElement,isHTMLElement,isInlineDomNode,mergeRegister,removeClassNamesFromElement}from\"lexical\";import{createRectsFromDOMRange as k}from\"@lexical/selection\";function F(t,...e){const n=new URL(\"https://lexical.dev/docs/error\"),o=new URLSearchParams;o.append(\"code\",t);for(const t of e)o.append(\"v\",t);throw n.search=o.toString(),Error(`Minified Lexical error #${t}; visit ${n.toString()} for the full message or use the non-minified dev environment for full errors and additional helpful warnings.`)}const I=\"undefined\"!=typeof window&&void 0!==window.document&&void 0!==window.document.createElement,O=I&&\"documentMode\"in document?document.documentMode:null,D=I&&/Mac|iPod|iPhone|iPad/.test(navigator.platform),H=I&&/^(?!.*Seamonkey)(?=.*Firefox).*/i.test(navigator.userAgent),j=!(!I||!(\"InputEvent\"in window)||O)&&\"getTargetRanges\"in new window.InputEvent(\"input\"),z=I&&/iPad|iPhone|iPod/.test(navigator.userAgent)&&!window.MSStream,U=I&&/Android/.test(navigator.userAgent),V=I&&/Version\\/[\\d.]+.*Safari/.test(navigator.userAgent)&&!U,W=I&&/^(?=.*Chrome).*/i.test(navigator.userAgent),G=I&&U&&W,q=I&&/AppleWebKit\\/[\\d.]+/.test(navigator.userAgent)&&D&&!W;function J(t){return`${t}px`}const Q={attributes:!0,characterData:!0,childList:!0,subtree:!0};function X(e,n,o){let r=null,i=null,l=null,s=[];const u=document.createElement(\"div\");function c(){null===r&&F(182),null===i&&F(183);const{left:t,top:l}=i.getBoundingClientRect(),c=k(e,n);var a,f;u.isConnected||(f=u,(a=i).insertBefore(f,a.firstChild));let d=!1;for(let e=0;e<c.length;e++){const n=c[e],o=s[e]||document.createElement(\"div\"),r=o.style;\"absolute\"!==r.position&&(r.position=\"absolute\",d=!0);const i=J(n.left-t);r.left!==i&&(r.left=i,d=!0);const a=J(n.top-l);r.top!==a&&(o.style.top=a,d=!0);const f=J(n.width);r.width!==f&&(o.style.width=f,d=!0);const g=J(n.height);r.height!==g&&(o.style.height=g,d=!0),o.parentNode!==u&&(u.append(o),d=!0),s[e]=o}for(;s.length>c.length;)s.pop();d&&o(s)}function a(){i=null,r=null,null!==l&&l.disconnect(),l=null,u.remove();for(const t of s)t.remove();s=[]}u.style.position=\"relative\";const f=e.registerRootListener(function n(){const o=e.getRootElement();if(null===o)return a();const s=o.parentElement;if(!t(s))return a();a(),r=o,i=s,l=new MutationObserver(t=>{const o=e.getRootElement(),l=o&&o.parentElement;if(o!==r||l!==i)return n();for(const e of t)if(!u.contains(e.target))return c()}),l.observe(s,Q),c()});return()=>{f(),a()}}function Y(t,e,n){if(\"text\"!==t.type&&r(e)){const o=l(),r=s(o).$getDOMSlot(e,n,o);return[r.element,r.getFirstChildOffset()+t.offset]}return[i(n)||n,t.offset]}function Z(t){for(const e of t){const t=e.style;\"Highlight\"!==t.background&&(t.background=\"Highlight\"),\"HighlightText\"!==t.color&&(t.color=\"HighlightText\"),t.marginTop!==J(-1.5)&&(t.marginTop=J(-1.5)),t.paddingTop!==J(4)&&(t.paddingTop=J(4)),t.paddingBottom!==J(0)&&(t.paddingBottom=J(0))}}function tt(t,r=Z){let i=null,l=null,s=null,u=null,c=null,a=null,f=()=>{};function d(e){e.read(()=>{const e=n();if(!o(e))return i=null,s=null,u=null,a=null,f(),void(f=()=>{});const[d,g]=function(t){const e=t.getStartEndPoints();return t.isBackward()?[e[1],e[0]]:e}(e),p=d.getNode(),m=p.getKey(),h=d.offset,v=g.getNode(),y=v.getKey(),w=g.offset,x=t.getElementByKey(m),E=t.getElementByKey(y),C=null===i||x!==l||h!==s||m!==i.getKey(),S=null===u||E!==c||w!==a||y!==u.getKey();if((C||S)&&null!==x&&null!==E){const e=function(t,e,n,o,r,i,l){const s=(t._window?t._window.document:document).createRange();return s.setStart(...Y(e,n,o)),s.setEnd(...Y(r,i,l)),s}(t,d,p,x,g,v,E);f(),f=X(t,e,r)}i=p,l=x,s=h,u=v,c=E,a=w})}return d(t.getEditorState()),e(t.registerUpdateListener(({editorState:t})=>d(t)),()=>{f()})}function et(t,e){let n=null;const o=()=>{const o=getSelection(),r=o&&o.anchorNode,i=t.getRootElement();null!==r&&null!==i&&i.contains(r)?null!==n&&(n(),n=null):null===n&&(n=tt(t,e))};return t.registerRootListener(t=>{if(t){const e=t.ownerDocument;return e.addEventListener(\"selectionchange\",o),o(),()=>{null!==n&&n(),e.removeEventListener(\"selectionchange\",o)}}})}const nt=j,ot=I,rt=U,it=G,lt=D,st=q,ut=W,ct=H,at=z,ft=V;function dt(t,e){for(const n of e)if(t.type.startsWith(n))return!0;return!1}function gt(t,e){const n=t[Symbol.iterator]();return new Promise((t,o)=>{const r=[],i=()=>{const{done:l,value:s}=n.next();if(l)return t(r);const u=new FileReader;u.addEventListener(\"error\",o),u.addEventListener(\"load\",()=>{const t=u.result;\"string\"==typeof t&&r.push({file:s,result:t}),i()}),dt(s,e)?u.readAsDataURL(s):i()};i()})}function pt(t,e){return Array.from(vt(t,e))}function mt(t){return t?t.getAdjacentCaret():null}function ht(t,e){return Array.from(St(t,e))}function vt(t,e){return wt(\"next\",t,e)}function yt(t,e){const n=d(f(t,e));return n&&n[0]}function wt(t,e,n){const o=C(),i=e||o,l=r(i)?u(i,t):f(i,t),s=Et(i),c=n?A(a(f(n,t)))||yt(n,t):yt(i,t);let g=s;return K({hasNext:t=>null!==t,initial:l,map:t=>({depth:g,node:t.origin}),step:t=>{if(t.isSameNodeCaret(c))return null;N(t)&&g++;const e=d(t);return!e||e[0].isSameNodeCaret(c)?null:(g+=e[1],e[0])}})}function xt(t){const e=d(f(t,\"next\"));return e&&[e[0].origin,e[1]]}function Et(t){let e=-1;for(let n=t;null!==n;n=n.getParent())e++;return e}function Ct(t){const e=a(f(t,\"previous\")),n=d(e,\"root\");return n&&n[0].origin}function St(t,e){return wt(\"previous\",t,e)}function At(t,e){let n=t;for(;null!=n;){if(n instanceof e)return n;n=n.getParent()}return null}function Nt(t){const e=c(t,t=>r(t)&&!t.isInline());return r(e)||F(4,t.__key),e}function bt(t,e,n,o){const r=t=>t instanceof e;return t.registerNodeTransform(e,t=>{const e=(t=>{const e=t.getChildren();for(let t=0;t<e.length;t++){const n=e[t];if(r(n))return null}let n=t,o=t;for(;null!==n;)if(o=n,n=n.getParent(),r(n))return{child:o,parent:n};return null})(t);if(null!==e){const{child:r,parent:i}=e;if(r.is(t)){o(i,t);const e=r.getNextSiblings(),l=e.length;if(i.insertAfter(r),0!==l){const t=n(i);r.insertAfter(t);for(let n=0;n<l;n++)t.append(e[n])}i.canBeEmpty()||0!==i.getChildrenSize()||i.remove()}}})}function Lt(t,e){const n=new Map,o=t._pendingEditorState;for(const[t,o]of e._nodeMap)n.set(t,T(o));o&&(o._nodeMap=n),t._dirtyType=2;const r=e._selection;B(null===r?null:r.clone())}function Pt(t){const e=n()||x();let r;if(o(e))r=E(e.focus,\"next\");else{if(null!=e){const t=e.getNodes(),n=t[t.length-1];n&&(r=f(n,\"next\"))}r=r||u(C(),\"previous\").getFlipped().insert(S())}const i=Rt(t,r),l=A(i),s=N(l)?b(l):i;return y(L(s)),t.getLatest()}function Rt(t,e,n){let o=P(e,\"next\");h(o)&&(0===o.offset?o=f(o.origin,\"previous\").getFlipped():o.offset===o.origin.getTextContentSize()&&(o=f(o.origin,\"next\"))),o.origin.is(t)&&(R(o)||F(342,t.getKey(),t.getType()),o=M(o)),(t.is(o.getNodeAtCaret())||t.is(o.getFlipped().getNodeAtCaret()))&&t.remove(!0);for(let t=o;t;t=v(t,n))o=t;return h(o)&&F(283),o.insert(t.isInline()?S().append(t):t),P(f(t.getLatest(),\"next\"),e.direction)}function Mt(t){const e=n();if(!o(e))return void(e&&e.insertNodes([t]));const r=g(e);let i=p(m(r),\"next\").anchor;if(h(i)){const t=v(i);if(!t)return;i=t}const l=i.getFlipped();l.insert(t),y(w(l,l))}function Tt(t,e){const n=e();return t.replace(n),n.append(t),n}function Bt(t,e){return null!==t&&Object.getPrototypeOf(t).constructor.name===e.name}function Kt(t,e){const n=[];for(let o=0;o<t.length;o++){const r=e(t[o]);null!==r&&n.push(r)}return n}function _t(t){const e=n();if(!o(e))return!1;const i=new Set,l=e.getNodes();for(let e=0;e<l.length;e++){const n=l[e],o=n.getKey();if(i.has(o))continue;const s=c(n,t=>r(t)&&!t.isInline());if(null===s)continue;const u=s.getKey();s.canIndent()&&!i.has(u)&&(i.add(u),t(s))}return i.size>0}function $t(t,e){u(t,\"next\").insert(e)}let kt=!(ct||!ot)&&void 0;function Ft(t,e=!1){let n=1;if(function(){if(void 0===kt){const t=document.createElement(\"div\");t.style.position=\"absolute\",t.style.opacity=\"0\",t.style.width=\"100px\",t.style.left=\"-1000px\",document.body.appendChild(t);const e=t.getBoundingClientRect();t.style.setProperty(\"zoom\",\"2\"),kt=t.getBoundingClientRect().width===e.width,document.body.removeChild(t)}return kt}()||e)for(;t;)n*=Number(window.getComputedStyle(t).getPropertyValue(\"zoom\")),t=t.parentElement;return n}function It(t){return null!==t._parentEditor}function Ot(t,e){return Dt(t,e,null)}function Dt(t,e,n){let o=!1;for(const i of zt(t))e(i)?null!==n&&n(i):(o=!0,r(i)&&Dt(i,e,n||(t=>i.insertAfter(t))),i.remove());return o}function Ht(t,e){const n=[],o=Array.from(t).reverse();for(let t=o.pop();void 0!==t;t=o.pop())if(e(t))n.push(t);else if(r(t))for(const e of zt(t))o.push(e);return n}function jt(t){return Ut(u(t,\"next\"))}function zt(t){return Ut(u(t,\"previous\"))}function Ut(t){return K({hasNext:R,initial:t.getAdjacentCaret(),map:t=>t.origin.getLatest(),step:t=>t.getAdjacentCaret()})}function Vt(t){M(f(t,\"next\")).splice(1,t.getChildren())}function Wt(t){const e=e=>_(e,t),n=(e,n)=>$(e,t,n);return{$get:e,$set:n,accessors:[e,n],makeGetterMethod:()=>function(){return e(this)},makeSetterMethod:()=>function(t){return n(this,t)},stateConfig:t}}export{Ht as $descendantsMatching,pt as $dfs,vt as $dfsIterator,Kt as $filter,jt as $firstToLastIterator,mt as $getAdjacentCaret,Et as $getDepth,Nt as $getNearestBlockElementAncestorOrThrow,At as $getNearestNodeOfType,Ct as $getNextRightPreorderNode,xt as $getNextSiblingOrParentSibling,_t as $handleIndentAndOutdent,$t as $insertFirst,Mt as $insertNodeIntoLeaf,Pt as $insertNodeToNearestRoot,Rt as $insertNodeToNearestRootAtCaret,It as $isEditorIsNestedEditor,zt as $lastToFirstIterator,Lt as $restoreEditorState,ht as $reverseDfs,St as $reverseDfsIterator,Ot as $unwrapAndFilterDescendants,Vt as $unwrapNode,Tt as $wrapNodeInElement,nt as CAN_USE_BEFORE_INPUT,ot as CAN_USE_DOM,rt as IS_ANDROID,it as IS_ANDROID_CHROME,lt as IS_APPLE,st as IS_APPLE_WEBKIT,ut as IS_CHROME,ct as IS_FIREFOX,at as IS_IOS,ft as IS_SAFARI,Ft as calculateZoomLevel,dt as isMimeType,Wt as makeStateWrapper,tt as markSelection,gt as mediaFileReader,Bt as objectKlassEquals,X as positionNodeOnRange,bt as registerNestedElementResolver,et as selectionAlwaysOnDisplay};\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;AAQ2oC,SAAS,EAAE,GAAE,GAAG,GAAE;CAAC,MAAM,IAAE,IAAI,IAAI,gCAAgC,GAAE,IAAE,IAAI,gBAAc;CAAE,EAAE,OAAO,QAAO,CAAC;CAAE,KAAI,MAAM,KAAK,GAAE,EAAE,OAAO,KAAI,CAAC;CAAE,MAAM,EAAE,SAAO,EAAE,SAAS,GAAE,MAAM,2BAA2B,EAAE,UAAU,EAAE,SAAS,EAAE,+GAA+G;AAAC;AAAC,MAAM,IAAE,eAAa,OAAO,UAAQ,KAAK,MAAI,OAAO,YAAU,KAAK,MAAI,OAAO,SAAS,eAAc,IAAE,KAAG,kBAAiB,WAAS,SAAS,eAAa,MAAK,IAAE,KAAG,uBAAuB,KAAK,UAAU,QAAQ,GAAE,IAAE,KAAG,mCAAmC,KAAK,UAAU,SAAS,GAAE,IAAE,EAAE,CAAC,KAAG,EAAE,gBAAe,WAAS,MAAI,qBAAoB,IAAI,OAAO,WAAW,OAAO,GAAE,IAAE,KAAG,mBAAmB,KAAK,UAAU,SAAS,KAAG,CAAC,OAAO,UAAS,IAAE,KAAG,UAAU,KAAK,UAAU,SAAS,GAAE,IAAE,KAAG,0BAA0B,KAAK,UAAU,SAAS,KAAG,CAAC,GAAE,IAAE,KAAG,mBAAmB,KAAK,UAAU,SAAS,GAAE,IAAE,KAAG,KAAG,GAAE,IAAE,KAAG,sBAAsB,KAAK,UAAU,SAAS,KAAG,KAAG,CAAC;AAAE,SAAS,EAAE,GAAE;CAAC,OAAM,GAAG,EAAE;AAAG;AAAC,MAAM,IAAE;CAAC,YAAW,CAAC;CAAE,eAAc,CAAC;CAAE,WAAU,CAAC;CAAE,SAAQ,CAAC;AAAC;AAAE,SAAS,EAAE,GAAE,GAAE,GAAE;CAAC,IAAI,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,IAAE,CAAC;CAAE,MAAM,IAAE,SAAS,cAAc,KAAK;CAAE,SAAS,IAAG;EAAC,SAAO,KAAG,EAAE,GAAG,GAAE,SAAO,KAAG,EAAE,GAAG;EAAE,MAAK,EAAC,MAAK,GAAE,KAAI,MAAG,EAAE,sBAAsB,GAAE,IAAEA,wBAAE,GAAE,CAAC;EAAE,IAAI,GAAE;EAAE,EAAE,gBAAc,IAAE,IAAG,IAAE,GAAG,aAAa,GAAE,EAAE,UAAU;EAAG,IAAI,IAAE,CAAC;EAAE,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,QAAO,KAAI;GAAC,MAAM,IAAE,EAAE,IAAG,IAAE,EAAE,MAAI,SAAS,cAAc,KAAK,GAAE,IAAE,EAAE;GAAM,eAAa,EAAE,aAAW,EAAE,WAAS,YAAW,IAAE,CAAC;GAAG,MAAM,IAAE,EAAE,EAAE,OAAK,CAAC;GAAE,EAAE,SAAO,MAAI,EAAE,OAAK,GAAE,IAAE,CAAC;GAAG,MAAM,IAAE,EAAE,EAAE,MAAI,CAAC;GAAE,EAAE,QAAM,MAAI,EAAE,MAAM,MAAI,GAAE,IAAE,CAAC;GAAG,MAAM,IAAE,EAAE,EAAE,KAAK;GAAE,EAAE,UAAQ,MAAI,EAAE,MAAM,QAAM,GAAE,IAAE,CAAC;GAAG,MAAM,IAAE,EAAE,EAAE,MAAM;GAAE,EAAE,WAAS,MAAI,EAAE,MAAM,SAAO,GAAE,IAAE,CAAC,IAAG,EAAE,eAAa,MAAI,EAAE,OAAO,CAAC,GAAE,IAAE,CAAC,IAAG,EAAE,KAAG;EAAC;EAAC,OAAK,EAAE,SAAO,EAAE,SAAQ,EAAE,IAAI;EAAE,KAAG,EAAE,CAAC;CAAC;CAAC,SAAS,IAAG;EAAC,IAAE,MAAK,IAAE,MAAK,SAAO,KAAG,EAAE,WAAW,GAAE,IAAE,MAAK,EAAE,OAAO;EAAE,KAAI,MAAM,KAAK,GAAE,EAAE,OAAO;EAAE,IAAE,CAAC;CAAC;CAAC,EAAE,MAAM,WAAS;CAAW,MAAM,IAAE,EAAE,qBAAqB,SAAS,IAAG;EAAC,MAAM,IAAE,EAAE,eAAe;EAAE,IAAG,SAAO,GAAE,OAAO,EAAE;EAAE,MAAM,IAAE,EAAE;EAAc,IAAG,CAACC,cAAE,CAAC,GAAE,OAAO,EAAE;EAAE,EAAE,GAAE,IAAE,GAAE,IAAE,GAAE,IAAE,IAAI,kBAAiB,MAAG;GAAC,MAAM,IAAE,EAAE,eAAe,GAAE,IAAE,KAAG,EAAE;GAAc,IAAG,MAAI,KAAG,MAAI,GAAE,OAAO,EAAE;GAAE,KAAI,MAAM,KAAK,GAAE,IAAG,CAAC,EAAE,SAAS,EAAE,MAAM,GAAE,OAAO,EAAE;EAAC,CAAC,GAAE,EAAE,QAAQ,GAAE,CAAC,GAAE,EAAE;CAAC,CAAC;CAAE,aAAU;EAAC,EAAE,GAAE,EAAE;CAAC;AAAC;AAAC,SAAS,EAAE,GAAE,GAAE,GAAE;CAAC,IAAG,WAAS,EAAE,QAAMC,eAAE,CAAC,GAAE;EAAC,MAAM,IAAEC,WAAE,GAAE,IAAEC,0BAAE,CAAC,EAAE,YAAY,GAAE,GAAE,CAAC;EAAE,OAAM,CAAC,EAAE,SAAQ,EAAE,oBAAoB,IAAE,EAAE,MAAM;CAAC;CAAC,OAAM,CAACC,eAAE,CAAC,KAAG,GAAE,EAAE,MAAM;AAAC;AAAC,SAAS,EAAE,GAAE;CAAC,KAAI,MAAM,KAAK,GAAE;EAAC,MAAM,IAAE,EAAE;EAAM,gBAAc,EAAE,eAAa,EAAE,aAAW,cAAa,oBAAkB,EAAE,UAAQ,EAAE,QAAM,kBAAiB,EAAE,cAAY,EAAE,IAAI,MAAI,EAAE,YAAU,EAAE,IAAI,IAAG,EAAE,eAAa,EAAE,CAAC,MAAI,EAAE,aAAW,EAAE,CAAC,IAAG,EAAE,kBAAgB,EAAE,CAAC,MAAI,EAAE,gBAAc,EAAE,CAAC;CAAE;AAAC;AAAC,SAAS,GAAG,GAAE,IAAE,GAAE;CAAC,IAAI,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,UAAM,CAAC;CAAE,SAAS,EAAE,GAAE;EAAC,EAAE,WAAS;GAAC,MAAM,IAAEC,cAAE;GAAE,IAAG,CAACC,kBAAE,CAAC,GAAE,OAAO,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,EAAE,GAAE,MAAK,UAAM,CAAC;GAAG,MAAK,CAAC,GAAE,KAAG,SAAS,GAAE;IAAC,MAAM,IAAE,EAAE,kBAAkB;IAAE,OAAO,EAAE,WAAW,IAAE,CAAC,EAAE,IAAG,EAAE,EAAE,IAAE;GAAC,EAAE,CAAC,GAAE,IAAE,EAAE,QAAQ,GAAE,IAAE,EAAE,OAAO,GAAE,IAAE,EAAE,QAAO,IAAE,EAAE,QAAQ,GAAE,IAAE,EAAE,OAAO,GAAE,IAAE,EAAE,QAAO,IAAE,EAAE,gBAAgB,CAAC,GAAE,IAAE,EAAE,gBAAgB,CAAC,GAAE,IAAE,SAAO,KAAG,MAAI,KAAG,MAAI,KAAG,MAAI,EAAE,OAAO,GAAE,IAAE,SAAO,KAAG,MAAI,KAAG,MAAI,KAAG,MAAI,EAAE,OAAO;GAAE,KAAI,KAAG,MAAI,SAAO,KAAG,SAAO,GAAE;IAAC,MAAM,IAAE,SAAS,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE;KAAC,MAAM,KAAG,EAAE,UAAQ,EAAE,QAAQ,WAAS,UAAU,YAAY;KAAE,OAAO,EAAE,SAAS,GAAG,EAAE,GAAE,GAAE,CAAC,CAAC,GAAE,EAAE,OAAO,GAAG,EAAE,GAAE,GAAE,CAAC,CAAC,GAAE;IAAC,EAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC;IAAE,EAAE,GAAE,IAAE,EAAE,GAAE,GAAE,CAAC;GAAC;GAAC,IAAE,GAAE,IAAE,GAAE,IAAE,GAAE,IAAE,GAAE,IAAE,GAAE,IAAE;EAAC,CAAC;CAAC;CAAC,OAAO,EAAE,EAAE,eAAe,CAAC,GAAEC,cAAE,EAAE,wBAAwB,EAAC,aAAY,QAAK,EAAE,CAAC,CAAC,SAAM;EAAC,EAAE;CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,IAAI,IAAE;CAAK,MAAM,UAAM;EAAC,MAAM,IAAE,aAAa,GAAE,IAAE,KAAG,EAAE,YAAW,IAAE,EAAE,eAAe;EAAE,SAAO,KAAG,SAAO,KAAG,EAAE,SAAS,CAAC,IAAE,SAAO,MAAI,EAAE,GAAE,IAAE,QAAM,SAAO,MAAI,IAAE,GAAG,GAAE,CAAC;CAAE;CAAE,OAAO,EAAE,sBAAqB,MAAG;EAAC,IAAG,GAAE;GAAC,MAAM,IAAE,EAAE;GAAc,OAAO,EAAE,iBAAiB,mBAAkB,CAAC,GAAE,EAAE,SAAM;IAAC,SAAO,KAAG,EAAE,GAAE,EAAE,oBAAoB,mBAAkB,CAAC;GAAC;EAAC;CAAC,CAAC;AAAC;AAAC,MAAM,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG;AAAE,SAAS,GAAG,GAAE,GAAE;CAAC,KAAI,MAAM,KAAK,GAAE,IAAG,EAAE,KAAK,WAAW,CAAC,GAAE,OAAM,CAAC;CAAE,OAAM,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,IAAE,EAAE,OAAO,UAAU;CAAE,OAAO,IAAI,SAAS,GAAE,MAAI;EAAC,MAAM,IAAE,CAAC,GAAE,UAAM;GAAC,MAAK,EAAC,MAAK,GAAE,OAAM,MAAG,EAAE,KAAK;GAAE,IAAG,GAAE,OAAO,EAAE,CAAC;GAAE,MAAM,IAAE,IAAI,WAAS;GAAE,EAAE,iBAAiB,SAAQ,CAAC,GAAE,EAAE,iBAAiB,cAAW;IAAC,MAAM,IAAE,EAAE;IAAO,YAAU,OAAO,KAAG,EAAE,KAAK;KAAC,MAAK;KAAE,QAAO;IAAC,CAAC,GAAE,EAAE;GAAC,CAAC,GAAE,GAAG,GAAE,CAAC,IAAE,EAAE,cAAc,CAAC,IAAE,EAAE;EAAC;EAAE,EAAE;CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,MAAM,KAAK,GAAG,GAAE,CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,OAAO,IAAE,EAAE,iBAAiB,IAAE;AAAI;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,MAAM,KAAK,GAAG,GAAE,CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,GAAG,QAAO,GAAE,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,IAAEC,wCAAEC,iBAAE,GAAE,CAAC,CAAC;CAAE,OAAO,KAAG,EAAE;AAAE;AAAC,SAAS,GAAG,GAAE,GAAE,GAAE;CAAC,MAAM,IAAEC,SAAE,GAAE,IAAE,KAAG,GAAE,IAAET,eAAE,CAAC,IAAEU,eAAE,GAAE,CAAC,IAAEF,iBAAE,GAAE,CAAC,GAAE,IAAE,GAAG,CAAC,GAAE,IAAE,IAAEG,uBAAEC,qBAAEJ,iBAAE,GAAE,CAAC,CAAC,CAAC,KAAG,GAAG,GAAE,CAAC,IAAE,GAAG,GAAE,CAAC;CAAE,IAAI,IAAE;CAAE,OAAOK,qBAAE;EAAC,UAAQ,MAAG,SAAO;EAAE,SAAQ;EAAE,MAAI,OAAI;GAAC,OAAM;GAAE,MAAK,EAAE;EAAM;EAAG,OAAK,MAAG;GAAC,IAAG,EAAE,gBAAgB,CAAC,GAAE,OAAO;GAAK,cAAE,CAAC,KAAG;GAAI,MAAM,IAAEN,wCAAE,CAAC;GAAE,OAAM,CAAC,KAAG,EAAE,GAAG,gBAAgB,CAAC,IAAE,QAAM,KAAG,EAAE,IAAG,EAAE;EAAG;CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,IAAEA,wCAAEC,iBAAE,GAAE,MAAM,CAAC;CAAE,OAAO,KAAG,CAAC,EAAE,GAAG,QAAO,EAAE,EAAE;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,IAAI,IAAE;CAAG,KAAI,IAAI,IAAE,GAAE,SAAO,GAAE,IAAE,EAAE,UAAU,GAAE;CAAI,OAAO;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAA2B,IAAED,wCAArBK,qBAAEJ,iBAAE,GAAE,UAAU,CAAO,GAAE,MAAM;CAAE,OAAO,KAAG,EAAE,GAAG;AAAM;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,GAAG,YAAW,GAAE,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,IAAI,IAAE;CAAE,OAAK,QAAM,IAAG;EAAC,IAAG,aAAa,GAAE,OAAO;EAAE,IAAE,EAAE,UAAU;CAAC;CAAC,OAAO;AAAI;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,IAAEM,oBAAE,IAAE,MAAGd,eAAE,CAAC,KAAG,CAAC,EAAE,SAAS,CAAC;CAAE,OAAOA,eAAE,CAAC,KAAG,EAAE,GAAE,EAAE,KAAK,GAAE;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE,GAAE,GAAE;CAAC,MAAM,KAAE,MAAG,aAAa;CAAE,OAAO,EAAE,sBAAsB,IAAE,MAAG;EAAC,MAAM,MAAG,MAAG;GAAC,MAAM,IAAE,EAAE,YAAY;GAAE,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,QAAO,KAAI;IAAC,MAAM,IAAE,EAAE;IAAG,IAAG,EAAE,CAAC,GAAE,OAAO;GAAI;GAAC,IAAI,IAAE,GAAE,IAAE;GAAE,OAAK,SAAO,IAAG,IAAG,IAAE,GAAE,IAAE,EAAE,UAAU,GAAE,EAAE,CAAC,GAAE,OAAM;IAAC,OAAM;IAAE,QAAO;GAAC;GAAE,OAAO;EAAI,GAAG,CAAC;EAAE,IAAG,SAAO,GAAE;GAAC,MAAK,EAAC,OAAM,GAAE,QAAO,MAAG;GAAE,IAAG,EAAE,GAAG,CAAC,GAAE;IAAC,EAAE,GAAE,CAAC;IAAE,MAAM,IAAE,EAAE,gBAAgB,GAAE,IAAE,EAAE;IAAO,IAAG,EAAE,YAAY,CAAC,GAAE,MAAI,GAAE;KAAC,MAAM,IAAE,EAAE,CAAC;KAAE,EAAE,YAAY,CAAC;KAAE,KAAI,IAAI,IAAE,GAAE,IAAE,GAAE,KAAI,EAAE,OAAO,EAAE,EAAE;IAAC;IAAC,EAAE,WAAW,KAAG,MAAI,EAAE,gBAAgB,KAAG,EAAE,OAAO;GAAC;EAAC;CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,oBAAE,IAAI,IAAE,GAAE,IAAE,EAAE;CAAoB,KAAI,MAAK,CAAC,GAAE,MAAK,EAAE,UAAS,EAAE,IAAI,GAAEe,qBAAE,CAAC,CAAC;CAAE,MAAI,EAAE,WAAS,IAAG,EAAE,aAAW;CAAE,MAAM,IAAE,EAAE;CAAW,cAAE,SAAO,IAAE,OAAK,EAAE,MAAM,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,IAAEX,cAAE,KAAGY,sBAAE;CAAE,IAAI;CAAE,IAAGX,kBAAE,CAAC,GAAE,IAAEY,gBAAE,EAAE,OAAM,MAAM;MAAM;EAAC,IAAG,QAAM,GAAE;GAAC,MAAM,IAAE,EAAE,SAAS,GAAE,IAAE,EAAE,EAAE,SAAO;GAAG,MAAI,IAAET,iBAAE,GAAE,MAAM;EAAE;EAAC,IAAE,KAAGE,eAAED,SAAE,GAAE,UAAU,EAAE,WAAW,EAAE,OAAOS,qBAAE,CAAC;CAAC;CAAC,MAAM,IAAE,GAAG,GAAE,CAAC,GAAE,IAAEP,uBAAE,CAAC;CAAgB,OAAOQ,4BAAEC,wBAArBC,cAAE,CAAC,IAAEC,gBAAE,CAAC,IAAE,CAAc,CAAC,GAAE,EAAE,UAAU;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE,GAAE;CAAC,IAAI,IAAEC,qBAAE,GAAE,MAAM;CAAE,kBAAE,CAAC,MAAI,MAAI,EAAE,SAAO,IAAEf,iBAAE,EAAE,QAAO,UAAU,EAAE,WAAW,IAAE,EAAE,WAAS,EAAE,OAAO,mBAAmB,MAAI,IAAEA,iBAAE,EAAE,QAAO,MAAM,KAAI,EAAE,OAAO,GAAG,CAAC,MAAIgB,gBAAE,CAAC,KAAG,EAAE,KAAI,EAAE,OAAO,GAAE,EAAE,QAAQ,CAAC,GAAE,IAAEC,oBAAE,CAAC,KAAI,EAAE,GAAG,EAAE,eAAe,CAAC,KAAG,EAAE,GAAG,EAAE,WAAW,EAAE,eAAe,CAAC,MAAI,EAAE,OAAO,CAAC,CAAC;CAAE,KAAI,IAAI,IAAE,GAAE,GAAE,IAAEC,uBAAE,GAAE,CAAC,GAAE,IAAE;CAAE,OAAOC,kBAAE,CAAC,KAAG,EAAE,GAAG,GAAE,EAAE,OAAO,EAAE,SAAS,IAAET,qBAAE,EAAE,OAAO,CAAC,IAAE,CAAC,GAAEK,qBAAEf,iBAAE,EAAE,UAAU,GAAE,MAAM,GAAE,EAAE,SAAS;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,IAAEJ,cAAE;CAAE,IAAG,CAACC,kBAAE,CAAC,GAAE,OAAO,MAAK,KAAG,EAAE,YAAY,CAAC,CAAC,CAAC;CAAgB,IAAI,IAAEuB,0BAAEC,0BAAbC,yBAAE,CAAa,CAAC,GAAE,MAAM,EAAE;CAAO,IAAGH,kBAAE,CAAC,GAAE;EAAC,MAAM,IAAED,uBAAE,CAAC;EAAE,IAAG,CAAC,GAAE;EAAO,IAAE;CAAC;CAAC,MAAM,IAAE,EAAE,WAAW;CAAE,EAAE,OAAO,CAAC,GAAEP,4BAAEY,eAAE,GAAE,CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,IAAE,EAAE;CAAE,OAAO,EAAE,QAAQ,CAAC,GAAE,EAAE,OAAO,CAAC,GAAE;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,SAAO,KAAG,OAAO,eAAe,CAAC,EAAE,YAAY,SAAO,EAAE;AAAI;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,IAAE,CAAC;CAAE,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,QAAO,KAAI;EAAC,MAAM,IAAE,EAAE,EAAE,EAAE;EAAE,SAAO,KAAG,EAAE,KAAK,CAAC;CAAC;CAAC,OAAO;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,IAAE3B,cAAE;CAAE,IAAG,CAACC,kBAAE,CAAC,GAAE,OAAM,CAAC;CAAE,MAAM,oBAAE,IAAI,IAAE,GAAE,IAAE,EAAE,SAAS;CAAE,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,QAAO,KAAI;EAAC,MAAM,IAAE,EAAE,IAAG,IAAE,EAAE,OAAO;EAAE,IAAG,EAAE,IAAI,CAAC,GAAE;EAAS,MAAM,IAAES,oBAAE,IAAE,MAAGd,eAAE,CAAC,KAAG,CAAC,EAAE,SAAS,CAAC;EAAE,IAAG,SAAO,GAAE;EAAS,MAAM,IAAE,EAAE,OAAO;EAAE,EAAE,UAAU,KAAG,CAAC,EAAE,IAAI,CAAC,MAAI,EAAE,IAAI,CAAC,GAAE,EAAE,CAAC;CAAE;CAAC,OAAO,EAAE,OAAK;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,eAAE,GAAE,MAAM,EAAE,OAAO,CAAC;AAAC;AAAC,IAAI,KAAG,EAAE,MAAI,CAAC,OAAK,KAAK;AAAE,SAAS,GAAG,GAAE,IAAE,CAAC,GAAE;CAAC,IAAI,IAAE;CAAE,IAAG,WAAU;EAAC,IAAG,KAAK,MAAI,IAAG;GAAC,MAAM,IAAE,SAAS,cAAc,KAAK;GAAE,EAAE,MAAM,WAAS,YAAW,EAAE,MAAM,UAAQ,KAAI,EAAE,MAAM,QAAM,SAAQ,EAAE,MAAM,OAAK,WAAU,SAAS,KAAK,YAAY,CAAC;GAAE,MAAM,IAAE,EAAE,sBAAsB;GAAE,EAAE,MAAM,YAAY,QAAO,GAAG,GAAE,KAAG,EAAE,sBAAsB,EAAE,UAAQ,EAAE,OAAM,SAAS,KAAK,YAAY,CAAC;EAAC;EAAC,OAAO;CAAE,EAAE,KAAG,GAAE,OAAK,IAAG,KAAG,OAAO,OAAO,iBAAiB,CAAC,EAAE,iBAAiB,MAAM,CAAC,GAAE,IAAE,EAAE;CAAc,OAAO;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,OAAO,SAAO,EAAE;AAAa;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,GAAG,GAAE,GAAE,IAAI;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE,GAAE;CAAC,IAAI,IAAE,CAAC;CAAE,KAAI,MAAM,KAAK,GAAG,CAAC,GAAE,EAAE,CAAC,IAAE,SAAO,KAAG,EAAE,CAAC,KAAG,IAAE,CAAC,GAAEA,eAAE,CAAC,KAAG,GAAG,GAAE,GAAE,OAAI,MAAG,EAAE,YAAY,CAAC,EAAE,GAAE,EAAE,OAAO;CAAG,OAAO;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,IAAE,CAAC,GAAE,IAAE,MAAM,KAAK,CAAC,EAAE,QAAQ;CAAE,KAAI,IAAI,IAAE,EAAE,IAAI,GAAE,KAAK,MAAI,GAAE,IAAE,EAAE,IAAI,GAAE,IAAG,EAAE,CAAC,GAAE,EAAE,KAAK,CAAC;MAAO,IAAGA,eAAE,CAAC,GAAE,KAAI,MAAM,KAAK,GAAG,CAAC,GAAE,EAAE,KAAK,CAAC;CAAE,OAAO;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,OAAO,GAAGU,eAAE,GAAE,MAAM,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,OAAO,GAAGA,eAAE,GAAE,UAAU,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,OAAOG,qBAAE;EAAC,SAAQW;EAAE,SAAQ,EAAE,iBAAiB;EAAE,MAAI,MAAG,EAAE,OAAO,UAAU;EAAE,OAAK,MAAG,EAAE,iBAAiB;CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,oBAAEhB,iBAAE,GAAE,MAAM,CAAC,EAAE,OAAO,GAAE,EAAE,YAAY,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,KAAE,MAAGwB,UAAE,GAAE,CAAC,GAAE,KAAG,GAAE,MAAIC,UAAE,GAAE,GAAE,CAAC;CAAE,OAAM;EAAC,MAAK;EAAE,MAAK;EAAE,WAAU,CAAC,GAAE,CAAC;EAAE,wBAAqB,WAAU;GAAC,OAAO,EAAE,IAAI;EAAC;EAAE,wBAAqB,SAAS,GAAE;GAAC,OAAO,EAAE,MAAK,CAAC;EAAC;EAAE,aAAY;CAAC;AAAC"}
+{"version":3,"file":"LexicalUtils.prod-CmeHwh8W.mjs","names":["k","t","r","l","s","i","n","o","e","d","f","C","u","A","a","K","c","T","x","E","S","y","L","N","b","P","R","M","v","h","p","m","g","w","_","$"],"sources":["../../../node_modules/.pnpm/@lexical+utils@0.44.0/node_modules/@lexical/utils/LexicalUtils.prod.mjs"],"sourcesContent":["/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nimport{isHTMLElement as t,mergeRegister as e,$getSelection as n,$isRangeSelection as o,$isElementNode as r,getDOMTextNode as i,$getEditor as l,$getEditorDOMRenderConfig as s,$getChildCaret as u,$findMatchingParent as c,$getChildCaretOrSelf as a,$getSiblingCaret as f,$getAdjacentSiblingOrParentSiblingCaret as d,$caretRangeFromSelection as g,$getCaretRangeInDirection as p,$removeTextFromCaretRange as m,$isTextPointCaret as h,$splitAtPointCaretNext as v,$setSelectionFromCaretRange as y,$getCaretRange as w,$getPreviousSelection as x,$caretFromPoint as E,$getRoot as C,$createParagraphNode as S,$getAdjacentChildCaret as A,$isChildCaret as N,$normalizeCaret as b,$getCollapsedCaretRange as L,$getCaretInDirection as P,$isSiblingCaret as R,$rewindSiblingCaret as M,$cloneWithProperties as T,$setSelection as B,makeStepwiseIterator as K,$getState as _,$setState as $}from\"lexical\";export{$findMatchingParent,$getAdjacentSiblingOrParentSiblingCaret,$splitNode,addClassNamesToElement,isBlockDomNode,isHTMLAnchorElement,isHTMLElement,isInlineDomNode,mergeRegister,removeClassNamesFromElement}from\"lexical\";import{createRectsFromDOMRange as k}from\"@lexical/selection\";function F(t,...e){const n=new URL(\"https://lexical.dev/docs/error\"),o=new URLSearchParams;o.append(\"code\",t);for(const t of e)o.append(\"v\",t);throw n.search=o.toString(),Error(`Minified Lexical error #${t}; visit ${n.toString()} for the full message or use the non-minified dev environment for full errors and additional helpful warnings.`)}const I=\"undefined\"!=typeof window&&void 0!==window.document&&void 0!==window.document.createElement,O=I&&\"documentMode\"in document?document.documentMode:null,D=I&&/Mac|iPod|iPhone|iPad/.test(navigator.platform),H=I&&/^(?!.*Seamonkey)(?=.*Firefox).*/i.test(navigator.userAgent),j=!(!I||!(\"InputEvent\"in window)||O)&&\"getTargetRanges\"in new window.InputEvent(\"input\"),z=I&&/iPad|iPhone|iPod/.test(navigator.userAgent)&&!window.MSStream,U=I&&/Android/.test(navigator.userAgent),V=I&&/Version\\/[\\d.]+.*Safari/.test(navigator.userAgent)&&!U,W=I&&/^(?=.*Chrome).*/i.test(navigator.userAgent),G=I&&U&&W,q=I&&/AppleWebKit\\/[\\d.]+/.test(navigator.userAgent)&&D&&!W;function J(t){return`${t}px`}const Q={attributes:!0,characterData:!0,childList:!0,subtree:!0};function X(e,n,o){let r=null,i=null,l=null,s=[];const u=document.createElement(\"div\");function c(){null===r&&F(182),null===i&&F(183);const{left:t,top:l}=i.getBoundingClientRect(),c=k(e,n);var a,f;u.isConnected||(f=u,(a=i).insertBefore(f,a.firstChild));let d=!1;for(let e=0;e<c.length;e++){const n=c[e],o=s[e]||document.createElement(\"div\"),r=o.style;\"absolute\"!==r.position&&(r.position=\"absolute\",d=!0);const i=J(n.left-t);r.left!==i&&(r.left=i,d=!0);const a=J(n.top-l);r.top!==a&&(o.style.top=a,d=!0);const f=J(n.width);r.width!==f&&(o.style.width=f,d=!0);const g=J(n.height);r.height!==g&&(o.style.height=g,d=!0),o.parentNode!==u&&(u.append(o),d=!0),s[e]=o}for(;s.length>c.length;)s.pop();d&&o(s)}function a(){i=null,r=null,null!==l&&l.disconnect(),l=null,u.remove();for(const t of s)t.remove();s=[]}u.style.position=\"relative\";const f=e.registerRootListener(function n(){const o=e.getRootElement();if(null===o)return a();const s=o.parentElement;if(!t(s))return a();a(),r=o,i=s,l=new MutationObserver(t=>{const o=e.getRootElement(),l=o&&o.parentElement;if(o!==r||l!==i)return n();for(const e of t)if(!u.contains(e.target))return c()}),l.observe(s,Q),c()});return()=>{f(),a()}}function Y(t,e,n){if(\"text\"!==t.type&&r(e)){const o=l(),r=s(o).$getDOMSlot(e,n,o);return[r.element,r.getFirstChildOffset()+t.offset]}return[i(n)||n,t.offset]}function Z(t){for(const e of t){const t=e.style;\"Highlight\"!==t.background&&(t.background=\"Highlight\"),\"HighlightText\"!==t.color&&(t.color=\"HighlightText\"),t.marginTop!==J(-1.5)&&(t.marginTop=J(-1.5)),t.paddingTop!==J(4)&&(t.paddingTop=J(4)),t.paddingBottom!==J(0)&&(t.paddingBottom=J(0))}}function tt(t,r=Z){let i=null,l=null,s=null,u=null,c=null,a=null,f=()=>{};function d(e){e.read(()=>{const e=n();if(!o(e))return i=null,s=null,u=null,a=null,f(),void(f=()=>{});const[d,g]=function(t){const e=t.getStartEndPoints();return t.isBackward()?[e[1],e[0]]:e}(e),p=d.getNode(),m=p.getKey(),h=d.offset,v=g.getNode(),y=v.getKey(),w=g.offset,x=t.getElementByKey(m),E=t.getElementByKey(y),C=null===i||x!==l||h!==s||m!==i.getKey(),S=null===u||E!==c||w!==a||y!==u.getKey();if((C||S)&&null!==x&&null!==E){const e=function(t,e,n,o,r,i,l){const s=(t._window?t._window.document:document).createRange();return s.setStart(...Y(e,n,o)),s.setEnd(...Y(r,i,l)),s}(t,d,p,x,g,v,E);f(),f=X(t,e,r)}i=p,l=x,s=h,u=v,c=E,a=w})}return d(t.getEditorState()),e(t.registerUpdateListener(({editorState:t})=>d(t)),()=>{f()})}function et(t,e){let n=null;const o=()=>{const o=getSelection(),r=o&&o.anchorNode,i=t.getRootElement();null!==r&&null!==i&&i.contains(r)?null!==n&&(n(),n=null):null===n&&(n=tt(t,e))};return t.registerRootListener(t=>{if(t){const e=t.ownerDocument;return e.addEventListener(\"selectionchange\",o),o(),()=>{null!==n&&n(),e.removeEventListener(\"selectionchange\",o)}}})}const nt=j,ot=I,rt=U,it=G,lt=D,st=q,ut=W,ct=H,at=z,ft=V;function dt(t,e){for(const n of e)if(t.type.startsWith(n))return!0;return!1}function gt(t,e){const n=t[Symbol.iterator]();return new Promise((t,o)=>{const r=[],i=()=>{const{done:l,value:s}=n.next();if(l)return t(r);const u=new FileReader;u.addEventListener(\"error\",o),u.addEventListener(\"load\",()=>{const t=u.result;\"string\"==typeof t&&r.push({file:s,result:t}),i()}),dt(s,e)?u.readAsDataURL(s):i()};i()})}function pt(t,e){return Array.from(vt(t,e))}function mt(t){return t?t.getAdjacentCaret():null}function ht(t,e){return Array.from(St(t,e))}function vt(t,e){return wt(\"next\",t,e)}function yt(t,e){const n=d(f(t,e));return n&&n[0]}function wt(t,e,n){const o=C(),i=e||o,l=r(i)?u(i,t):f(i,t),s=Et(i),c=n?A(a(f(n,t)))||yt(n,t):yt(i,t);let g=s;return K({hasNext:t=>null!==t,initial:l,map:t=>({depth:g,node:t.origin}),step:t=>{if(t.isSameNodeCaret(c))return null;N(t)&&g++;const e=d(t);return!e||e[0].isSameNodeCaret(c)?null:(g+=e[1],e[0])}})}function xt(t){const e=d(f(t,\"next\"));return e&&[e[0].origin,e[1]]}function Et(t){let e=-1;for(let n=t;null!==n;n=n.getParent())e++;return e}function Ct(t){const e=a(f(t,\"previous\")),n=d(e,\"root\");return n&&n[0].origin}function St(t,e){return wt(\"previous\",t,e)}function At(t,e){let n=t;for(;null!=n;){if(n instanceof e)return n;n=n.getParent()}return null}function Nt(t){const e=c(t,t=>r(t)&&!t.isInline());return r(e)||F(4,t.__key),e}function bt(t,e,n,o){const r=t=>t instanceof e;return t.registerNodeTransform(e,t=>{const e=(t=>{const e=t.getChildren();for(let t=0;t<e.length;t++){const n=e[t];if(r(n))return null}let n=t,o=t;for(;null!==n;)if(o=n,n=n.getParent(),r(n))return{child:o,parent:n};return null})(t);if(null!==e){const{child:r,parent:i}=e;if(r.is(t)){o(i,t);const e=r.getNextSiblings(),l=e.length;if(i.insertAfter(r),0!==l){const t=n(i);r.insertAfter(t);for(let n=0;n<l;n++)t.append(e[n])}i.canBeEmpty()||0!==i.getChildrenSize()||i.remove()}}})}function Lt(t,e){const n=new Map,o=t._pendingEditorState;for(const[t,o]of e._nodeMap)n.set(t,T(o));o&&(o._nodeMap=n),t._dirtyType=2;const r=e._selection;B(null===r?null:r.clone())}function Pt(t){const e=n()||x();let r;if(o(e))r=E(e.focus,\"next\");else{if(null!=e){const t=e.getNodes(),n=t[t.length-1];n&&(r=f(n,\"next\"))}r=r||u(C(),\"previous\").getFlipped().insert(S())}const i=Rt(t,r),l=A(i),s=N(l)?b(l):i;return y(L(s)),t.getLatest()}function Rt(t,e,n){let o=P(e,\"next\");h(o)&&(0===o.offset?o=f(o.origin,\"previous\").getFlipped():o.offset===o.origin.getTextContentSize()&&(o=f(o.origin,\"next\"))),o.origin.is(t)&&(R(o)||F(342,t.getKey(),t.getType()),o=M(o)),(t.is(o.getNodeAtCaret())||t.is(o.getFlipped().getNodeAtCaret()))&&t.remove(!0);for(let t=o;t;t=v(t,n))o=t;return h(o)&&F(283),o.insert(t.isInline()?S().append(t):t),P(f(t.getLatest(),\"next\"),e.direction)}function Mt(t){const e=n();if(!o(e))return void(e&&e.insertNodes([t]));const r=g(e);let i=p(m(r),\"next\").anchor;if(h(i)){const t=v(i);if(!t)return;i=t}const l=i.getFlipped();l.insert(t),y(w(l,l))}function Tt(t,e){const n=e();return t.replace(n),n.append(t),n}function Bt(t,e){return null!==t&&Object.getPrototypeOf(t).constructor.name===e.name}function Kt(t,e){const n=[];for(let o=0;o<t.length;o++){const r=e(t[o]);null!==r&&n.push(r)}return n}function _t(t){const e=n();if(!o(e))return!1;const i=new Set,l=e.getNodes();for(let e=0;e<l.length;e++){const n=l[e],o=n.getKey();if(i.has(o))continue;const s=c(n,t=>r(t)&&!t.isInline());if(null===s)continue;const u=s.getKey();s.canIndent()&&!i.has(u)&&(i.add(u),t(s))}return i.size>0}function $t(t,e){u(t,\"next\").insert(e)}let kt=!(ct||!ot)&&void 0;function Ft(t,e=!1){let n=1;if(function(){if(void 0===kt){const t=document.createElement(\"div\");t.style.position=\"absolute\",t.style.opacity=\"0\",t.style.width=\"100px\",t.style.left=\"-1000px\",document.body.appendChild(t);const e=t.getBoundingClientRect();t.style.setProperty(\"zoom\",\"2\"),kt=t.getBoundingClientRect().width===e.width,document.body.removeChild(t)}return kt}()||e)for(;t;)n*=Number(window.getComputedStyle(t).getPropertyValue(\"zoom\")),t=t.parentElement;return n}function It(t){return null!==t._parentEditor}function Ot(t,e){return Dt(t,e,null)}function Dt(t,e,n){let o=!1;for(const i of zt(t))e(i)?null!==n&&n(i):(o=!0,r(i)&&Dt(i,e,n||(t=>i.insertAfter(t))),i.remove());return o}function Ht(t,e){const n=[],o=Array.from(t).reverse();for(let t=o.pop();void 0!==t;t=o.pop())if(e(t))n.push(t);else if(r(t))for(const e of zt(t))o.push(e);return n}function jt(t){return Ut(u(t,\"next\"))}function zt(t){return Ut(u(t,\"previous\"))}function Ut(t){return K({hasNext:R,initial:t.getAdjacentCaret(),map:t=>t.origin.getLatest(),step:t=>t.getAdjacentCaret()})}function Vt(t){M(f(t,\"next\")).splice(1,t.getChildren())}function Wt(t){const e=e=>_(e,t),n=(e,n)=>$(e,t,n);return{$get:e,$set:n,accessors:[e,n],makeGetterMethod:()=>function(){return e(this)},makeSetterMethod:()=>function(t){return n(this,t)},stateConfig:t}}export{Ht as $descendantsMatching,pt as $dfs,vt as $dfsIterator,Kt as $filter,jt as $firstToLastIterator,mt as $getAdjacentCaret,Et as $getDepth,Nt as $getNearestBlockElementAncestorOrThrow,At as $getNearestNodeOfType,Ct as $getNextRightPreorderNode,xt as $getNextSiblingOrParentSibling,_t as $handleIndentAndOutdent,$t as $insertFirst,Mt as $insertNodeIntoLeaf,Pt as $insertNodeToNearestRoot,Rt as $insertNodeToNearestRootAtCaret,It as $isEditorIsNestedEditor,zt as $lastToFirstIterator,Lt as $restoreEditorState,ht as $reverseDfs,St as $reverseDfsIterator,Ot as $unwrapAndFilterDescendants,Vt as $unwrapNode,Tt as $wrapNodeInElement,nt as CAN_USE_BEFORE_INPUT,ot as CAN_USE_DOM,rt as IS_ANDROID,it as IS_ANDROID_CHROME,lt as IS_APPLE,st as IS_APPLE_WEBKIT,ut as IS_CHROME,ct as IS_FIREFOX,at as IS_IOS,ft as IS_SAFARI,Ft as calculateZoomLevel,dt as isMimeType,Wt as makeStateWrapper,tt as markSelection,gt as mediaFileReader,Bt as objectKlassEquals,X as positionNodeOnRange,bt as registerNestedElementResolver,et as selectionAlwaysOnDisplay};\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;AAQ2oC,SAAS,EAAE,GAAE,GAAG,GAAE;CAAC,MAAM,IAAE,IAAI,IAAI,gCAAgC,GAAE,IAAE,IAAI,gBAAc;CAAE,EAAE,OAAO,QAAO,CAAC;CAAE,KAAI,MAAM,KAAK,GAAE,EAAE,OAAO,KAAI,CAAC;CAAE,MAAM,EAAE,SAAO,EAAE,SAAS,GAAE,MAAM,2BAA2B,EAAE,UAAU,EAAE,SAAS,EAAE,+GAA+G;AAAC;AAAC,MAAM,IAAE,eAAa,OAAO,UAAQ,KAAK,MAAI,OAAO,YAAU,KAAK,MAAI,OAAO,SAAS,eAAc,IAAE,KAAG,kBAAiB,WAAS,SAAS,eAAa,MAAK,IAAE,KAAG,uBAAuB,KAAK,UAAU,QAAQ,GAAE,IAAE,KAAG,mCAAmC,KAAK,UAAU,SAAS,GAAE,IAAE,EAAE,CAAC,KAAG,EAAE,gBAAe,WAAS,MAAI,qBAAoB,IAAI,OAAO,WAAW,OAAO,GAAE,IAAE,KAAG,mBAAmB,KAAK,UAAU,SAAS,KAAG,CAAC,OAAO,UAAS,IAAE,KAAG,UAAU,KAAK,UAAU,SAAS,GAAE,IAAE,KAAG,0BAA0B,KAAK,UAAU,SAAS,KAAG,CAAC,GAAE,IAAE,KAAG,mBAAmB,KAAK,UAAU,SAAS,GAAE,IAAE,KAAG,KAAG,GAAE,IAAE,KAAG,sBAAsB,KAAK,UAAU,SAAS,KAAG,KAAG,CAAC;AAAE,SAAS,EAAE,GAAE;CAAC,OAAM,GAAG,EAAE;AAAG;AAAC,MAAM,IAAE;CAAC,YAAW,CAAC;CAAE,eAAc,CAAC;CAAE,WAAU,CAAC;CAAE,SAAQ,CAAC;AAAC;AAAE,SAAS,EAAE,GAAE,GAAE,GAAE;CAAC,IAAI,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,IAAE,CAAC;CAAE,MAAM,IAAE,SAAS,cAAc,KAAK;CAAE,SAAS,IAAG;EAAC,SAAO,KAAG,EAAE,GAAG,GAAE,SAAO,KAAG,EAAE,GAAG;EAAE,MAAK,EAAC,MAAK,GAAE,KAAI,MAAG,EAAE,sBAAsB,GAAE,IAAEA,wBAAE,GAAE,CAAC;EAAE,IAAI,GAAE;EAAE,EAAE,gBAAc,IAAE,IAAG,IAAE,GAAG,aAAa,GAAE,EAAE,UAAU;EAAG,IAAI,IAAE,CAAC;EAAE,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,QAAO,KAAI;GAAC,MAAM,IAAE,EAAE,IAAG,IAAE,EAAE,MAAI,SAAS,cAAc,KAAK,GAAE,IAAE,EAAE;GAAM,eAAa,EAAE,aAAW,EAAE,WAAS,YAAW,IAAE,CAAC;GAAG,MAAM,IAAE,EAAE,EAAE,OAAK,CAAC;GAAE,EAAE,SAAO,MAAI,EAAE,OAAK,GAAE,IAAE,CAAC;GAAG,MAAM,IAAE,EAAE,EAAE,MAAI,CAAC;GAAE,EAAE,QAAM,MAAI,EAAE,MAAM,MAAI,GAAE,IAAE,CAAC;GAAG,MAAM,IAAE,EAAE,EAAE,KAAK;GAAE,EAAE,UAAQ,MAAI,EAAE,MAAM,QAAM,GAAE,IAAE,CAAC;GAAG,MAAM,IAAE,EAAE,EAAE,MAAM;GAAE,EAAE,WAAS,MAAI,EAAE,MAAM,SAAO,GAAE,IAAE,CAAC,IAAG,EAAE,eAAa,MAAI,EAAE,OAAO,CAAC,GAAE,IAAE,CAAC,IAAG,EAAE,KAAG;EAAC;EAAC,OAAK,EAAE,SAAO,EAAE,SAAQ,EAAE,IAAI;EAAE,KAAG,EAAE,CAAC;CAAC;CAAC,SAAS,IAAG;EAAC,IAAE,MAAK,IAAE,MAAK,SAAO,KAAG,EAAE,WAAW,GAAE,IAAE,MAAK,EAAE,OAAO;EAAE,KAAI,MAAM,KAAK,GAAE,EAAE,OAAO;EAAE,IAAE,CAAC;CAAC;CAAC,EAAE,MAAM,WAAS;CAAW,MAAM,IAAE,EAAE,qBAAqB,SAAS,IAAG;EAAC,MAAM,IAAE,EAAE,eAAe;EAAE,IAAG,SAAO,GAAE,OAAO,EAAE;EAAE,MAAM,IAAE,EAAE;EAAc,IAAG,CAACC,cAAE,CAAC,GAAE,OAAO,EAAE;EAAE,EAAE,GAAE,IAAE,GAAE,IAAE,GAAE,IAAE,IAAI,kBAAiB,MAAG;GAAC,MAAM,IAAE,EAAE,eAAe,GAAE,IAAE,KAAG,EAAE;GAAc,IAAG,MAAI,KAAG,MAAI,GAAE,OAAO,EAAE;GAAE,KAAI,MAAM,KAAK,GAAE,IAAG,CAAC,EAAE,SAAS,EAAE,MAAM,GAAE,OAAO,EAAE;EAAC,CAAC,GAAE,EAAE,QAAQ,GAAE,CAAC,GAAE,EAAE;CAAC,CAAC;CAAE,aAAU;EAAC,EAAE,GAAE,EAAE;CAAC;AAAC;AAAC,SAAS,EAAE,GAAE,GAAE,GAAE;CAAC,IAAG,WAAS,EAAE,QAAMC,eAAE,CAAC,GAAE;EAAC,MAAM,IAAEC,WAAE,GAAE,IAAEC,0BAAE,CAAC,EAAE,YAAY,GAAE,GAAE,CAAC;EAAE,OAAM,CAAC,EAAE,SAAQ,EAAE,oBAAoB,IAAE,EAAE,MAAM;CAAC;CAAC,OAAM,CAACC,eAAE,CAAC,KAAG,GAAE,EAAE,MAAM;AAAC;AAAC,SAAS,EAAE,GAAE;CAAC,KAAI,MAAM,KAAK,GAAE;EAAC,MAAM,IAAE,EAAE;EAAM,gBAAc,EAAE,eAAa,EAAE,aAAW,cAAa,oBAAkB,EAAE,UAAQ,EAAE,QAAM,kBAAiB,EAAE,cAAY,EAAE,IAAI,MAAI,EAAE,YAAU,EAAE,IAAI,IAAG,EAAE,eAAa,EAAE,CAAC,MAAI,EAAE,aAAW,EAAE,CAAC,IAAG,EAAE,kBAAgB,EAAE,CAAC,MAAI,EAAE,gBAAc,EAAE,CAAC;CAAE;AAAC;AAAC,SAAS,GAAG,GAAE,IAAE,GAAE;CAAC,IAAI,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,UAAM,CAAC;CAAE,SAAS,EAAE,GAAE;EAAC,EAAE,WAAS;GAAC,MAAM,IAAEC,cAAE;GAAE,IAAG,CAACC,kBAAE,CAAC,GAAE,OAAO,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,IAAE,MAAK,EAAE,GAAE,MAAK,UAAM,CAAC;GAAG,MAAK,CAAC,GAAE,KAAG,SAAS,GAAE;IAAC,MAAM,IAAE,EAAE,kBAAkB;IAAE,OAAO,EAAE,WAAW,IAAE,CAAC,EAAE,IAAG,EAAE,EAAE,IAAE;GAAC,EAAE,CAAC,GAAE,IAAE,EAAE,QAAQ,GAAE,IAAE,EAAE,OAAO,GAAE,IAAE,EAAE,QAAO,IAAE,EAAE,QAAQ,GAAE,IAAE,EAAE,OAAO,GAAE,IAAE,EAAE,QAAO,IAAE,EAAE,gBAAgB,CAAC,GAAE,IAAE,EAAE,gBAAgB,CAAC,GAAE,IAAE,SAAO,KAAG,MAAI,KAAG,MAAI,KAAG,MAAI,EAAE,OAAO,GAAE,IAAE,SAAO,KAAG,MAAI,KAAG,MAAI,KAAG,MAAI,EAAE,OAAO;GAAE,KAAI,KAAG,MAAI,SAAO,KAAG,SAAO,GAAE;IAAC,MAAM,IAAE,SAAS,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE;KAAC,MAAM,KAAG,EAAE,UAAQ,EAAE,QAAQ,WAAS,UAAU,YAAY;KAAE,OAAO,EAAE,SAAS,GAAG,EAAE,GAAE,GAAE,CAAC,CAAC,GAAE,EAAE,OAAO,GAAG,EAAE,GAAE,GAAE,CAAC,CAAC,GAAE;IAAC,EAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC;IAAE,EAAE,GAAE,IAAE,EAAE,GAAE,GAAE,CAAC;GAAC;GAAC,IAAE,GAAE,IAAE,GAAE,IAAE,GAAE,IAAE,GAAE,IAAE,GAAE,IAAE;EAAC,CAAC;CAAC;CAAC,OAAO,EAAE,EAAE,eAAe,CAAC,GAAEC,cAAE,EAAE,wBAAwB,EAAC,aAAY,QAAK,EAAE,CAAC,CAAC,SAAM;EAAC,EAAE;CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,IAAI,IAAE;CAAK,MAAM,UAAM;EAAC,MAAM,IAAE,aAAa,GAAE,IAAE,KAAG,EAAE,YAAW,IAAE,EAAE,eAAe;EAAE,SAAO,KAAG,SAAO,KAAG,EAAE,SAAS,CAAC,IAAE,SAAO,MAAI,EAAE,GAAE,IAAE,QAAM,SAAO,MAAI,IAAE,GAAG,GAAE,CAAC;CAAE;CAAE,OAAO,EAAE,sBAAqB,MAAG;EAAC,IAAG,GAAE;GAAC,MAAM,IAAE,EAAE;GAAc,OAAO,EAAE,iBAAiB,mBAAkB,CAAC,GAAE,EAAE,SAAM;IAAC,SAAO,KAAG,EAAE,GAAE,EAAE,oBAAoB,mBAAkB,CAAC;GAAC;EAAC;CAAC,CAAC;AAAC;AAAC,MAAM,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG;AAAE,SAAS,GAAG,GAAE,GAAE;CAAC,KAAI,MAAM,KAAK,GAAE,IAAG,EAAE,KAAK,WAAW,CAAC,GAAE,OAAM,CAAC;CAAE,OAAM,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,IAAE,EAAE,OAAO,UAAU;CAAE,OAAO,IAAI,SAAS,GAAE,MAAI;EAAC,MAAM,IAAE,CAAC,GAAE,UAAM;GAAC,MAAK,EAAC,MAAK,GAAE,OAAM,MAAG,EAAE,KAAK;GAAE,IAAG,GAAE,OAAO,EAAE,CAAC;GAAE,MAAM,IAAE,IAAI,WAAS;GAAE,EAAE,iBAAiB,SAAQ,CAAC,GAAE,EAAE,iBAAiB,cAAW;IAAC,MAAM,IAAE,EAAE;IAAO,YAAU,OAAO,KAAG,EAAE,KAAK;KAAC,MAAK;KAAE,QAAO;IAAC,CAAC,GAAE,EAAE;GAAC,CAAC,GAAE,GAAG,GAAE,CAAC,IAAE,EAAE,cAAc,CAAC,IAAE,EAAE;EAAC;EAAE,EAAE;CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,MAAM,KAAK,GAAG,GAAE,CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,OAAO,IAAE,EAAE,iBAAiB,IAAE;AAAI;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,MAAM,KAAK,GAAG,GAAE,CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,GAAG,QAAO,GAAE,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,IAAEC,wCAAEC,iBAAE,GAAE,CAAC,CAAC;CAAE,OAAO,KAAG,EAAE;AAAE;AAAC,SAAS,GAAG,GAAE,GAAE,GAAE;CAAC,MAAM,IAAEC,SAAE,GAAE,IAAE,KAAG,GAAE,IAAET,eAAE,CAAC,IAAEU,eAAE,GAAE,CAAC,IAAEF,iBAAE,GAAE,CAAC,GAAE,IAAE,GAAG,CAAC,GAAE,IAAE,IAAEG,uBAAEC,qBAAEJ,iBAAE,GAAE,CAAC,CAAC,CAAC,KAAG,GAAG,GAAE,CAAC,IAAE,GAAG,GAAE,CAAC;CAAE,IAAI,IAAE;CAAE,OAAOK,qBAAE;EAAC,UAAQ,MAAG,SAAO;EAAE,SAAQ;EAAE,MAAI,OAAI;GAAC,OAAM;GAAE,MAAK,EAAE;EAAM;EAAG,OAAK,MAAG;GAAC,IAAG,EAAE,gBAAgB,CAAC,GAAE,OAAO;GAAK,cAAE,CAAC,KAAG;GAAI,MAAM,IAAEN,wCAAE,CAAC;GAAE,OAAM,CAAC,KAAG,EAAE,GAAG,gBAAgB,CAAC,IAAE,QAAM,KAAG,EAAE,IAAG,EAAE;EAAG;CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,IAAEA,wCAAEC,iBAAE,GAAE,MAAM,CAAC;CAAE,OAAO,KAAG,CAAC,EAAE,GAAG,QAAO,EAAE,EAAE;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,IAAI,IAAE;CAAG,KAAI,IAAI,IAAE,GAAE,SAAO,GAAE,IAAE,EAAE,UAAU,GAAE;CAAI,OAAO;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAA2B,IAAED,wCAArBK,qBAAEJ,iBAAE,GAAE,UAAU,CAAO,GAAE,MAAM;CAAE,OAAO,KAAG,EAAE,GAAG;AAAM;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,GAAG,YAAW,GAAE,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,IAAI,IAAE;CAAE,OAAK,QAAM,IAAG;EAAC,IAAG,aAAa,GAAE,OAAO;EAAE,IAAE,EAAE,UAAU;CAAC;CAAC,OAAO;AAAI;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,IAAEM,oBAAE,IAAE,MAAGd,eAAE,CAAC,KAAG,CAAC,EAAE,SAAS,CAAC;CAAE,OAAOA,eAAE,CAAC,KAAG,EAAE,GAAE,EAAE,KAAK,GAAE;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE,GAAE,GAAE;CAAC,MAAM,KAAE,MAAG,aAAa;CAAE,OAAO,EAAE,sBAAsB,IAAE,MAAG;EAAC,MAAM,MAAG,MAAG;GAAC,MAAM,IAAE,EAAE,YAAY;GAAE,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,QAAO,KAAI;IAAC,MAAM,IAAE,EAAE;IAAG,IAAG,EAAE,CAAC,GAAE,OAAO;GAAI;GAAC,IAAI,IAAE,GAAE,IAAE;GAAE,OAAK,SAAO,IAAG,IAAG,IAAE,GAAE,IAAE,EAAE,UAAU,GAAE,EAAE,CAAC,GAAE,OAAM;IAAC,OAAM;IAAE,QAAO;GAAC;GAAE,OAAO;EAAI,GAAG,CAAC;EAAE,IAAG,SAAO,GAAE;GAAC,MAAK,EAAC,OAAM,GAAE,QAAO,MAAG;GAAE,IAAG,EAAE,GAAG,CAAC,GAAE;IAAC,EAAE,GAAE,CAAC;IAAE,MAAM,IAAE,EAAE,gBAAgB,GAAE,IAAE,EAAE;IAAO,IAAG,EAAE,YAAY,CAAC,GAAE,MAAI,GAAE;KAAC,MAAM,IAAE,EAAE,CAAC;KAAE,EAAE,YAAY,CAAC;KAAE,KAAI,IAAI,IAAE,GAAE,IAAE,GAAE,KAAI,EAAE,OAAO,EAAE,EAAE;IAAC;IAAC,EAAE,WAAW,KAAG,MAAI,EAAE,gBAAgB,KAAG,EAAE,OAAO;GAAC;EAAC;CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,oBAAE,IAAI,IAAE,GAAE,IAAE,EAAE;CAAoB,KAAI,MAAK,CAAC,GAAE,MAAK,EAAE,UAAS,EAAE,IAAI,GAAEe,qBAAE,CAAC,CAAC;CAAE,MAAI,EAAE,WAAS,IAAG,EAAE,aAAW;CAAE,MAAM,IAAE,EAAE;CAAW,cAAE,SAAO,IAAE,OAAK,EAAE,MAAM,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,IAAEX,cAAE,KAAGY,sBAAE;CAAE,IAAI;CAAE,IAAGX,kBAAE,CAAC,GAAE,IAAEY,gBAAE,EAAE,OAAM,MAAM;MAAM;EAAC,IAAG,QAAM,GAAE;GAAC,MAAM,IAAE,EAAE,SAAS,GAAE,IAAE,EAAE,EAAE,SAAO;GAAG,MAAI,IAAET,iBAAE,GAAE,MAAM;EAAE;EAAC,IAAE,KAAGE,eAAED,SAAE,GAAE,UAAU,EAAE,WAAW,EAAE,OAAOS,qBAAE,CAAC;CAAC;CAAC,MAAM,IAAE,GAAG,GAAE,CAAC,GAAE,IAAEP,uBAAE,CAAC;CAAgB,OAAOQ,4BAAEC,wBAArBC,cAAE,CAAC,IAAEC,gBAAE,CAAC,IAAE,CAAc,CAAC,GAAE,EAAE,UAAU;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE,GAAE;CAAC,IAAI,IAAEC,qBAAE,GAAE,MAAM;CAAE,kBAAE,CAAC,MAAI,MAAI,EAAE,SAAO,IAAEf,iBAAE,EAAE,QAAO,UAAU,EAAE,WAAW,IAAE,EAAE,WAAS,EAAE,OAAO,mBAAmB,MAAI,IAAEA,iBAAE,EAAE,QAAO,MAAM,KAAI,EAAE,OAAO,GAAG,CAAC,MAAIgB,gBAAE,CAAC,KAAG,EAAE,KAAI,EAAE,OAAO,GAAE,EAAE,QAAQ,CAAC,GAAE,IAAEC,oBAAE,CAAC,KAAI,EAAE,GAAG,EAAE,eAAe,CAAC,KAAG,EAAE,GAAG,EAAE,WAAW,EAAE,eAAe,CAAC,MAAI,EAAE,OAAO,CAAC,CAAC;CAAE,KAAI,IAAI,IAAE,GAAE,GAAE,IAAEC,uBAAE,GAAE,CAAC,GAAE,IAAE;CAAE,OAAOC,kBAAE,CAAC,KAAG,EAAE,GAAG,GAAE,EAAE,OAAO,EAAE,SAAS,IAAET,qBAAE,EAAE,OAAO,CAAC,IAAE,CAAC,GAAEK,qBAAEf,iBAAE,EAAE,UAAU,GAAE,MAAM,GAAE,EAAE,SAAS;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,IAAEJ,cAAE;CAAE,IAAG,CAACC,kBAAE,CAAC,GAAE,OAAO,MAAK,KAAG,EAAE,YAAY,CAAC,CAAC,CAAC;CAAgB,IAAI,IAAEuB,0BAAEC,0BAAbC,yBAAE,CAAa,CAAC,GAAE,MAAM,EAAE;CAAO,IAAGH,kBAAE,CAAC,GAAE;EAAC,MAAM,IAAED,uBAAE,CAAC;EAAE,IAAG,CAAC,GAAE;EAAO,IAAE;CAAC;CAAC,MAAM,IAAE,EAAE,WAAW;CAAE,EAAE,OAAO,CAAC,GAAEP,4BAAEY,eAAE,GAAE,CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,IAAE,EAAE;CAAE,OAAO,EAAE,QAAQ,CAAC,GAAE,EAAE,OAAO,CAAC,GAAE;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,SAAO,KAAG,OAAO,eAAe,CAAC,EAAE,YAAY,SAAO,EAAE;AAAI;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,IAAE,CAAC;CAAE,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,QAAO,KAAI;EAAC,MAAM,IAAE,EAAE,EAAE,EAAE;EAAE,SAAO,KAAG,EAAE,KAAK,CAAC;CAAC;CAAC,OAAO;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,IAAE3B,cAAE;CAAE,IAAG,CAACC,kBAAE,CAAC,GAAE,OAAM,CAAC;CAAE,MAAM,oBAAE,IAAI,IAAE,GAAE,IAAE,EAAE,SAAS;CAAE,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,QAAO,KAAI;EAAC,MAAM,IAAE,EAAE,IAAG,IAAE,EAAE,OAAO;EAAE,IAAG,EAAE,IAAI,CAAC,GAAE;EAAS,MAAM,IAAES,oBAAE,IAAE,MAAGd,eAAE,CAAC,KAAG,CAAC,EAAE,SAAS,CAAC;EAAE,IAAG,SAAO,GAAE;EAAS,MAAM,IAAE,EAAE,OAAO;EAAE,EAAE,UAAU,KAAG,CAAC,EAAE,IAAI,CAAC,MAAI,EAAE,IAAI,CAAC,GAAE,EAAE,CAAC;CAAE;CAAC,OAAO,EAAE,OAAK;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,eAAE,GAAE,MAAM,EAAE,OAAO,CAAC;AAAC;AAAC,IAAI,KAAG,EAAE,MAAI,CAAC,OAAK,KAAK;AAAE,SAAS,GAAG,GAAE,IAAE,CAAC,GAAE;CAAC,IAAI,IAAE;CAAE,IAAG,WAAU;EAAC,IAAG,KAAK,MAAI,IAAG;GAAC,MAAM,IAAE,SAAS,cAAc,KAAK;GAAE,EAAE,MAAM,WAAS,YAAW,EAAE,MAAM,UAAQ,KAAI,EAAE,MAAM,QAAM,SAAQ,EAAE,MAAM,OAAK,WAAU,SAAS,KAAK,YAAY,CAAC;GAAE,MAAM,IAAE,EAAE,sBAAsB;GAAE,EAAE,MAAM,YAAY,QAAO,GAAG,GAAE,KAAG,EAAE,sBAAsB,EAAE,UAAQ,EAAE,OAAM,SAAS,KAAK,YAAY,CAAC;EAAC;EAAC,OAAO;CAAE,EAAE,KAAG,GAAE,OAAK,IAAG,KAAG,OAAO,OAAO,iBAAiB,CAAC,EAAE,iBAAiB,MAAM,CAAC,GAAE,IAAE,EAAE;CAAc,OAAO;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,OAAO,SAAO,EAAE;AAAa;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,OAAO,GAAG,GAAE,GAAE,IAAI;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE,GAAE;CAAC,IAAI,IAAE,CAAC;CAAE,KAAI,MAAM,KAAK,GAAG,CAAC,GAAE,EAAE,CAAC,IAAE,SAAO,KAAG,EAAE,CAAC,KAAG,IAAE,CAAC,GAAEA,eAAE,CAAC,KAAG,GAAG,GAAE,GAAE,OAAI,MAAG,EAAE,YAAY,CAAC,EAAE,GAAE,EAAE,OAAO;CAAG,OAAO;AAAC;AAAC,SAAS,GAAG,GAAE,GAAE;CAAC,MAAM,IAAE,CAAC,GAAE,IAAE,MAAM,KAAK,CAAC,EAAE,QAAQ;CAAE,KAAI,IAAI,IAAE,EAAE,IAAI,GAAE,KAAK,MAAI,GAAE,IAAE,EAAE,IAAI,GAAE,IAAG,EAAE,CAAC,GAAE,EAAE,KAAK,CAAC;MAAO,IAAGA,eAAE,CAAC,GAAE,KAAI,MAAM,KAAK,GAAG,CAAC,GAAE,EAAE,KAAK,CAAC;CAAE,OAAO;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,OAAO,GAAGU,eAAE,GAAE,MAAM,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,OAAO,GAAGA,eAAE,GAAE,UAAU,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,OAAOG,qBAAE;EAAC,SAAQW;EAAE,SAAQ,EAAE,iBAAiB;EAAE,MAAI,MAAG,EAAE,OAAO,UAAU;EAAE,OAAK,MAAG,EAAE,iBAAiB;CAAC,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,oBAAEhB,iBAAE,GAAE,MAAM,CAAC,EAAE,OAAO,GAAE,EAAE,YAAY,CAAC;AAAC;AAAC,SAAS,GAAG,GAAE;CAAC,MAAM,KAAE,MAAGwB,UAAE,GAAE,CAAC,GAAE,KAAG,GAAE,MAAIC,UAAE,GAAE,GAAE,CAAC;CAAE,OAAM;EAAC,MAAK;EAAE,MAAK;EAAE,WAAU,CAAC,GAAE,CAAC;EAAE,wBAAqB,WAAU;GAAC,OAAO,EAAE,IAAI;EAAC;EAAE,wBAAqB,SAAS,GAAE;GAAC,OAAO,EAAE,MAAK,CAAC;EAAC;EAAE,aAAY;CAAC;AAAC"}

package/dist/{auth-OeKZZ_2x.mjs → auth-CAKmTDpF.mjs}

@@ -1,5 +1,5 @@
-import { s as MxsError } from "./output-BM7aBFwt.mjs";
-import { s as readCredentials, u as writeCredentials } from "./config-store-WL7dNMS6.mjs";
+import { c as MxsErrorCode, s as MxsError } from "./output-vzequvhd.mjs";
+import { f as writeCredentials, l as readCredentials } from "./config-store-B8_9iStL.mjs";
 //#region src/core/auth.ts
 const SUPPORTED_API_VERSIONS = [2];
 function defaultHttp() {
@@ -32,7 +32,7 @@ async function probeAuthEndpoint(apiUrl, http = defaultHttp()) {
 		}
 	}
 	throw new MxsError({
-		code: "auth.probe",
+		code: MxsErrorCode.AuthProbe,
 		message: "cannot detect auth endpoint",
 		hint: "verify the URL points at a running mx-core server"
 	});
@@ -54,7 +54,7 @@ async function requestDeviceCode(authBase, clientId, scope = "openid profile ema
 			body = await res.text();
 		}
 		throw new MxsError({
-			code: "auth.denied",
+			code: MxsErrorCode.AuthDenied,
 			message: `device code request failed (${res.status})`,
 			details: body
 		});
@@ -67,7 +67,7 @@ async function pollDeviceToken(authBase, clientId, deviceCode, opts) {
 	let intervalMs = Math.max(1, opts.intervalSec) * 1e3;
 	while (Date.now() < deadline) {
 		if (opts.signal?.aborted) throw new MxsError({
-			code: "auth.denied",
+			code: MxsErrorCode.AuthDenied,
 			message: "aborted by user"
 		});
 		await sleep(intervalMs, opts.signal);
@@ -98,22 +98,22 @@ async function pollDeviceToken(authBase, clientId, deviceCode, opts) {
 			continue;
 		}
 		if (err === "access_denied") throw new MxsError({
-			code: "auth.denied",
+			code: MxsErrorCode.AuthDenied,
 			message: "user denied the authorization request"
 		});
 		if (err === "expired_token") throw new MxsError({
-			code: "auth.expired",
+			code: MxsErrorCode.AuthExpired,
 			message: "device code expired before authorization completed",
 			hint: "run `mxs auth login` again"
 		});
 		throw new MxsError({
-			code: "auth.denied",
+			code: MxsErrorCode.AuthDenied,
 			message: `device token request failed (${res.status})`,
 			details: body
 		});
 	}
 	throw new MxsError({
-		code: "auth.expired",
+		code: MxsErrorCode.AuthExpired,
 		message: "device authorization timed out",
 		hint: "run `mxs auth login` again"
 	});
@@ -191,7 +191,7 @@ function normalizeExpiresAt(value) {
 async function loadCredentialsOrThrow() {
 	const cred = await readCredentials();
 	if (!cred) throw new MxsError({
-		code: "auth.missing",
+		code: MxsErrorCode.AuthMissing,
 		message: "not authenticated",
 		hint: "run `mxs auth login`"
 	});
@@ -208,4 +208,4 @@ async function ensureFreshToken(authBase, clientId, http = defaultHttp()) {
 //#endregion
 export { loadCredentialsOrThrow as a, refreshAccessToken as c, isExpiringSoon as i, requestDeviceCode as l, defaultHttp as n, pollDeviceToken as o, ensureFreshToken as r, probeAuthEndpoint as s, SUPPORTED_API_VERSIONS as t, toCredentials as u };
 
-//# sourceMappingURL=auth-OeKZZ_2x.mjs.map
+//# sourceMappingURL=auth-CAKmTDpF.mjs.map

package/dist/auth-CAKmTDpF.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"auth-CAKmTDpF.mjs","names":[],"sources":["../src/core/auth.ts"],"sourcesContent":["import {\n  type CredentialsShape,\n  readCredentials,\n  writeCredentials,\n} from './config-store'\nimport { MxsError, MxsErrorCode } from './errors'\n\nexport const SUPPORTED_API_VERSIONS = [2] as const\n\nexport interface DeviceCodeResponse {\n  device_code: string\n  user_code: string\n  verification_uri: string\n  verification_uri_complete?: string\n  expires_in: number\n  interval: number\n}\n\nexport interface DeviceTokenResponse {\n  access_token: string\n  token_type: string\n  expires_in: number\n  refresh_token?: string\n  scope?: string\n  user?: {\n    id?: string\n    email?: string\n    name?: string\n  }\n}\n\nexport interface ProbeResult {\n  apiUrl: string\n  apiBase: string\n  authBase: string\n  apiVersion: number\n}\n\nexport interface AuthHttp {\n  fetch: typeof fetch\n}\n\nexport function defaultHttp(): AuthHttp {\n  return { fetch: globalThis.fetch.bind(globalThis) }\n}\n\nexport async function probeAuthEndpoint(\n  apiUrl: string,\n  http: AuthHttp = defaultHttp(),\n): Promise<ProbeResult> {\n  const candidates: { prefix: string; version: number | null }[] = [\n    ...SUPPORTED_API_VERSIONS.map((v) => ({\n      prefix: `/api/v${v}/auth`,\n      version: v,\n    })),\n    { prefix: '/auth', version: null },\n  ]\n  for (const cand of candidates) {\n    const probeUrl = `${apiUrl}${cand.prefix}/ok`\n    let res: Response\n    try {\n      res = await http.fetch(probeUrl, { method: 'GET' })\n    } catch {\n      continue\n    }\n    if (res.ok) {\n      const apiVersion = cand.version ?? SUPPORTED_API_VERSIONS[0]\n      const apiBase =\n        cand.prefix === '/auth' ? apiUrl : `${apiUrl}/api/v${apiVersion}`\n      const authBase = `${apiUrl}${cand.prefix}`\n      return { apiUrl, apiBase, authBase, apiVersion }\n    }\n  }\n  throw new MxsError({\n    code: MxsErrorCode.AuthProbe,\n    message: 'cannot detect auth endpoint',\n    hint: 'verify the URL points at a running mx-core server',\n  })\n}\n\nexport async function requestDeviceCode(\n  authBase: string,\n  clientId: string,\n  scope = 'openid profile email',\n  http: AuthHttp = defaultHttp(),\n): Promise<DeviceCodeResponse> {\n  const res = await http.fetch(`${authBase}/device/code`, {\n    method: 'POST',\n    headers: { 'content-type': 'application/json' },\n    body: JSON.stringify({ client_id: clientId, scope }),\n  })\n  if (!res.ok) {\n    let body: unknown\n    try {\n      body = await res.json()\n    } catch {\n      body = await res.text()\n    }\n    throw new MxsError({\n      code: MxsErrorCode.AuthDenied,\n      message: `device code request failed (${res.status})`,\n      details: body,\n    })\n  }\n  return (await res.json()) as DeviceCodeResponse\n}\n\nexport interface PollOptions {\n  intervalSec: number\n  expiresInSec: number\n  signal?: AbortSignal\n  onTick?: (state: 'pending' | 'slow_down') => void\n  http?: AuthHttp\n}\n\nexport async function pollDeviceToken(\n  authBase: string,\n  clientId: string,\n  deviceCode: string,\n  opts: PollOptions,\n): Promise<DeviceTokenResponse> {\n  const http = opts.http ?? defaultHttp()\n  const deadline = Date.now() + opts.expiresInSec * 1000\n  let intervalMs = Math.max(1, opts.intervalSec) * 1000\n  while (Date.now() < deadline) {\n    if (opts.signal?.aborted) {\n      throw new MxsError({\n        code: MxsErrorCode.AuthDenied,\n        message: 'aborted by user',\n      })\n    }\n    await sleep(intervalMs, opts.signal)\n    const res = await http.fetch(`${authBase}/device/token`, {\n      method: 'POST',\n      headers: { 'content-type': 'application/json' },\n      body: JSON.stringify({\n        grant_type: 'urn:ietf:params:oauth:grant-type:device_code',\n        device_code: deviceCode,\n        client_id: clientId,\n      }),\n    })\n    let body: any\n    try {\n      body = await res.json()\n    } catch {\n      body = null\n    }\n    if (res.ok && body?.access_token) {\n      return body as DeviceTokenResponse\n    }\n    const err = body?.error as string | undefined\n    if (err === 'authorization_pending') {\n      opts.onTick?.('pending')\n      continue\n    }\n    if (err === 'slow_down') {\n      intervalMs += 5000\n      opts.onTick?.('slow_down')\n      continue\n    }\n    if (err === 'access_denied') {\n      throw new MxsError({\n        code: MxsErrorCode.AuthDenied,\n        message: 'user denied the authorization request',\n      })\n    }\n    if (err === 'expired_token') {\n      throw new MxsError({\n        code: MxsErrorCode.AuthExpired,\n        message: 'device code expired before authorization completed',\n        hint: 'run `mxs auth login` again',\n      })\n    }\n    throw new MxsError({\n      code: MxsErrorCode.AuthDenied,\n      message: `device token request failed (${res.status})`,\n      details: body,\n    })\n  }\n  throw new MxsError({\n    code: MxsErrorCode.AuthExpired,\n    message: 'device authorization timed out',\n    hint: 'run `mxs auth login` again',\n  })\n}\n\nfunction sleep(ms: number, signal?: AbortSignal): Promise<void> {\n  return new Promise((resolve, reject) => {\n    if (signal?.aborted) return reject(new Error('aborted'))\n    const timer = setTimeout(() => {\n      if (signal) signal.removeEventListener('abort', onAbort)\n      resolve()\n    }, ms)\n    const onAbort = () => {\n      clearTimeout(timer)\n      reject(new Error('aborted'))\n    }\n    signal?.addEventListener('abort', onAbort, { once: true })\n  })\n}\n\nexport function toCredentials(resp: DeviceTokenResponse): CredentialsShape {\n  return {\n    access_token: resp.access_token,\n    refresh_token: resp.refresh_token,\n    expires_at: Date.now() + resp.expires_in * 1000,\n    user: resp.user,\n  }\n}\n\nexport function isExpiringSoon(\n  cred: CredentialsShape,\n  bufferMs = 60_000,\n): boolean {\n  return cred.expires_at < Date.now() + bufferMs\n}\n\nexport async function refreshAccessToken(\n  authBase: string,\n  clientId: string,\n  cred: CredentialsShape,\n  http: AuthHttp = defaultHttp(),\n): Promise<CredentialsShape | null> {\n  if (!cred.refresh_token) {\n    return refreshSessionToken(authBase, cred, http)\n  }\n  const res = await http.fetch(`${authBase}/token`, {\n    method: 'POST',\n    headers: { 'content-type': 'application/json' },\n    body: JSON.stringify({\n      grant_type: 'refresh_token',\n      refresh_token: cred.refresh_token,\n      client_id: clientId,\n    }),\n  })\n  if (!res.ok) return null\n  const body = (await res.json()) as DeviceTokenResponse\n  if (!body?.access_token) return null\n  return {\n    access_token: body.access_token,\n    refresh_token: body.refresh_token ?? cred.refresh_token,\n    expires_at: Date.now() + body.expires_in * 1000,\n    user: body.user ?? cred.user,\n  }\n}\n\nasync function refreshSessionToken(\n  authBase: string,\n  cred: CredentialsShape,\n  http: AuthHttp,\n): Promise<CredentialsShape | null> {\n  const res = await http.fetch(`${authBase}/get-session`, {\n    method: 'GET',\n    headers: {\n      accept: 'application/json',\n      authorization: `Bearer ${cred.access_token}`,\n    },\n  })\n  if (!res.ok) return null\n  const body = (await res.json().catch(() => null)) as {\n    session?: { expiresAt?: string | Date | number }\n    user?: CredentialsShape['user']\n  } | null\n  const expiresAt = normalizeExpiresAt(body?.session?.expiresAt)\n  if (!expiresAt || expiresAt <= cred.expires_at) return null\n  return {\n    access_token: res.headers.get('set-auth-token') ?? cred.access_token,\n    refresh_token: cred.refresh_token,\n    expires_at: expiresAt,\n    user: body?.user ?? cred.user,\n  }\n}\n\nfunction normalizeExpiresAt(value: string | Date | number | undefined) {\n  if (value === undefined) return null\n  const time =\n    value instanceof Date\n      ? value.getTime()\n      : typeof value === 'number'\n        ? value\n        : new Date(value).getTime()\n  return Number.isFinite(time) ? time : null\n}\n\nexport async function loadCredentialsOrThrow(): Promise<CredentialsShape> {\n  const cred = await readCredentials()\n  if (!cred) {\n    throw new MxsError({\n      code: MxsErrorCode.AuthMissing,\n      message: 'not authenticated',\n      hint: 'run `mxs auth login`',\n    })\n  }\n  return cred\n}\n\nexport async function ensureFreshToken(\n  authBase: string,\n  clientId: string,\n  http: AuthHttp = defaultHttp(),\n): Promise<CredentialsShape> {\n  const cred = await loadCredentialsOrThrow()\n  if (!isExpiringSoon(cred)) return cred\n  const refreshed = await refreshAccessToken(authBase, clientId, cred, http)\n  if (!refreshed) return cred\n  await writeCredentials(refreshed)\n  return refreshed\n}\n"],"mappings":";;;AAOA,MAAa,yBAAyB,CAAC,CAAC;AAmCxC,SAAgB,cAAwB;CACtC,OAAO,EAAE,OAAO,WAAW,MAAM,KAAK,UAAU,EAAE;AACpD;AAEA,eAAsB,kBACpB,QACA,OAAiB,YAAY,GACP;CACtB,MAAM,aAA2D,CAC/D,GAAG,uBAAuB,KAAK,OAAO;EACpC,QAAQ,SAAS,EAAE;EACnB,SAAS;CACX,EAAE,GACF;EAAE,QAAQ;EAAS,SAAS;CAAK,CACnC;CACA,KAAK,MAAM,QAAQ,YAAY;EAC7B,MAAM,WAAW,GAAG,SAAS,KAAK,OAAO;EACzC,IAAI;EACJ,IAAI;GACF,MAAM,MAAM,KAAK,MAAM,UAAU,EAAE,QAAQ,MAAM,CAAC;EACpD,QAAQ;GACN;EACF;EACA,IAAI,IAAI,IAAI;GACV,MAAM,aAAa,KAAK,WAAW,uBAAuB;GAI1D,OAAO;IAAE;IAAQ,SAFf,KAAK,WAAW,UAAU,SAAS,GAAG,OAAO,QAAQ;IAE7B,UAAA,GADN,SAAS,KAAK;IACE;GAAW;EACjD;CACF;CACA,MAAM,IAAI,SAAS;EACjB,MAAM,aAAa;EACnB,SAAS;EACT,MAAM;CACR,CAAC;AACH;AAEA,eAAsB,kBACpB,UACA,UACA,QAAQ,wBACR,OAAiB,YAAY,GACA;CAC7B,MAAM,MAAM,MAAM,KAAK,MAAM,GAAG,SAAS,eAAe;EACtD,QAAQ;EACR,SAAS,EAAE,gBAAgB,mBAAmB;EAC9C,MAAM,KAAK,UAAU;GAAE,WAAW;GAAU;EAAM,CAAC;CACrD,CAAC;CACD,IAAI,CAAC,IAAI,IAAI;EACX,IAAI;EACJ,IAAI;GACF,OAAO,MAAM,IAAI,KAAK;EACxB,QAAQ;GACN,OAAO,MAAM,IAAI,KAAK;EACxB;EACA,MAAM,IAAI,SAAS;GACjB,MAAM,aAAa;GACnB,SAAS,+BAA+B,IAAI,OAAO;GACnD,SAAS;EACX,CAAC;CACH;CACA,OAAQ,MAAM,IAAI,KAAK;AACzB;AAUA,eAAsB,gBACpB,UACA,UACA,YACA,MAC8B;CAC9B,MAAM,OAAO,KAAK,QAAQ,YAAY;CACtC,MAAM,WAAW,KAAK,IAAI,IAAI,KAAK,eAAe;CAClD,IAAI,aAAa,KAAK,IAAI,GAAG,KAAK,WAAW,IAAI;CACjD,OAAO,KAAK,IAAI,IAAI,UAAU;EAC5B,IAAI,KAAK,QAAQ,SACf,MAAM,IAAI,SAAS;GACjB,MAAM,aAAa;GACnB,SAAS;EACX,CAAC;EAEH,MAAM,MAAM,YAAY,KAAK,MAAM;EACnC,MAAM,MAAM,MAAM,KAAK,MAAM,GAAG,SAAS,gBAAgB;GACvD,QAAQ;GACR,SAAS,EAAE,gBAAgB,mBAAmB;GAC9C,MAAM,KAAK,UAAU;IACnB,YAAY;IACZ,aAAa;IACb,WAAW;GACb,CAAC;EACH,CAAC;EACD,IAAI;EACJ,IAAI;GACF,OAAO,MAAM,IAAI,KAAK;EACxB,QAAQ;GACN,OAAO;EACT;EACA,IAAI,IAAI,MAAM,MAAM,cAClB,OAAO;EAET,MAAM,MAAM,MAAM;EAClB,IAAI,QAAQ,yBAAyB;GACnC,KAAK,SAAS,SAAS;GACvB;EACF;EACA,IAAI,QAAQ,aAAa;GACvB,cAAc;GACd,KAAK,SAAS,WAAW;GACzB;EACF;EACA,IAAI,QAAQ,iBACV,MAAM,IAAI,SAAS;GACjB,MAAM,aAAa;GACnB,SAAS;EACX,CAAC;EAEH,IAAI,QAAQ,iBACV,MAAM,IAAI,SAAS;GACjB,MAAM,aAAa;GACnB,SAAS;GACT,MAAM;EACR,CAAC;EAEH,MAAM,IAAI,SAAS;GACjB,MAAM,aAAa;GACnB,SAAS,gCAAgC,IAAI,OAAO;GACpD,SAAS;EACX,CAAC;CACH;CACA,MAAM,IAAI,SAAS;EACjB,MAAM,aAAa;EACnB,SAAS;EACT,MAAM;CACR,CAAC;AACH;AAEA,SAAS,MAAM,IAAY,QAAqC;CAC9D,OAAO,IAAI,SAAS,SAAS,WAAW;EACtC,IAAI,QAAQ,SAAS,OAAO,uBAAO,IAAI,MAAM,SAAS,CAAC;EACvD,MAAM,QAAQ,iBAAiB;GAC7B,IAAI,QAAQ,OAAO,oBAAoB,SAAS,OAAO;GACvD,QAAQ;EACV,GAAG,EAAE;EACL,MAAM,gBAAgB;GACpB,aAAa,KAAK;GAClB,uBAAO,IAAI,MAAM,SAAS,CAAC;EAC7B;EACA,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;CAC3D,CAAC;AACH;AAEA,SAAgB,cAAc,MAA6C;CACzE,OAAO;EACL,cAAc,KAAK;EACnB,eAAe,KAAK;EACpB,YAAY,KAAK,IAAI,IAAI,KAAK,aAAa;EAC3C,MAAM,KAAK;CACb;AACF;AAEA,SAAgB,eACd,MACA,WAAW,KACF;CACT,OAAO,KAAK,aAAa,KAAK,IAAI,IAAI;AACxC;AAEA,eAAsB,mBACpB,UACA,UACA,MACA,OAAiB,YAAY,GACK;CAClC,IAAI,CAAC,KAAK,eACR,OAAO,oBAAoB,UAAU,MAAM,IAAI;CAEjD,MAAM,MAAM,MAAM,KAAK,MAAM,GAAG,SAAS,SAAS;EAChD,QAAQ;EACR,SAAS,EAAE,gBAAgB,mBAAmB;EAC9C,MAAM,KAAK,UAAU;GACnB,YAAY;GACZ,eAAe,KAAK;GACpB,WAAW;EACb,CAAC;CACH,CAAC;CACD,IAAI,CAAC,IAAI,IAAI,OAAO;CACpB,MAAM,OAAQ,MAAM,IAAI,KAAK;CAC7B,IAAI,CAAC,MAAM,cAAc,OAAO;CAChC,OAAO;EACL,cAAc,KAAK;EACnB,eAAe,KAAK,iBAAiB,KAAK;EAC1C,YAAY,KAAK,IAAI,IAAI,KAAK,aAAa;EAC3C,MAAM,KAAK,QAAQ,KAAK;CAC1B;AACF;AAEA,eAAe,oBACb,UACA,MACA,MACkC;CAClC,MAAM,MAAM,MAAM,KAAK,MAAM,GAAG,SAAS,eAAe;EACtD,QAAQ;EACR,SAAS;GACP,QAAQ;GACR,eAAe,UAAU,KAAK;EAChC;CACF,CAAC;CACD,IAAI,CAAC,IAAI,IAAI,OAAO;CACpB,MAAM,OAAQ,MAAM,IAAI,KAAK,EAAE,YAAY,IAAI;CAI/C,MAAM,YAAY,mBAAmB,MAAM,SAAS,SAAS;CAC7D,IAAI,CAAC,aAAa,aAAa,KAAK,YAAY,OAAO;CACvD,OAAO;EACL,cAAc,IAAI,QAAQ,IAAI,gBAAgB,KAAK,KAAK;EACxD,eAAe,KAAK;EACpB,YAAY;EACZ,MAAM,MAAM,QAAQ,KAAK;CAC3B;AACF;AAEA,SAAS,mBAAmB,OAA2C;CACrE,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,MAAM,OACJ,iBAAiB,OACb,MAAM,QAAQ,IACd,OAAO,UAAU,WACf,QACA,IAAI,KAAK,KAAK,EAAE,QAAQ;CAChC,OAAO,OAAO,SAAS,IAAI,IAAI,OAAO;AACxC;AAEA,eAAsB,yBAAoD;CACxE,MAAM,OAAO,MAAM,gBAAgB;CACnC,IAAI,CAAC,MACH,MAAM,IAAI,SAAS;EACjB,MAAM,aAAa;EACnB,SAAS;EACT,MAAM;CACR,CAAC;CAEH,OAAO;AACT;AAEA,eAAsB,iBACpB,UACA,UACA,OAAiB,YAAY,GACF;CAC3B,MAAM,OAAO,MAAM,uBAAuB;CAC1C,IAAI,CAAC,eAAe,IAAI,GAAG,OAAO;CAClC,MAAM,YAAY,MAAM,mBAAmB,UAAU,UAAU,MAAM,IAAI;CACzE,IAAI,CAAC,WAAW,OAAO;CACvB,MAAM,iBAAiB,SAAS;CAChC,OAAO;AACT"}

package/dist/bin/mxs.d.mts

@@ -1,4 +1,4 @@
-import { t as OutputOptions } from "../output-CTnO1lYt.mjs";
+import { t as OutputOptions } from "../output-D2dDlyV2.mjs";
 
 //#region ../../node_modules/.pnpm/commander@14.0.3/node_modules/commander/typings/index.d.ts
 // Type definitions for commander
@@ -920,6 +920,7 @@ interface GlobalOptions {
   quiet?: boolean;
   verbose?: boolean;
   dryRun?: boolean;
+  profile?: string;
 }
 declare function readGlobalOptions(cmd: Command): OutputOptions;
 declare function readGlobalFlags(cmd: Command): GlobalOptions;