@liveblocks/react-lexical 1.12.0-lexical3

package/dist/comments/thread-mark-node.js

@@ -0,0 +1,138 @@
+'use strict';
+
+var utils = require('@lexical/utils');
+var lexical = require('lexical');
+
+class ThreadMarkNode extends lexical.ElementNode {
+  constructor(ids, key) {
+    super(key);
+    this.__ids = ids || [];
+  }
+  static getType() {
+    return "lb-thread-mark";
+  }
+  static clone(node) {
+    return new ThreadMarkNode(Array.from(node.__ids), node.__key);
+  }
+  static importDOM() {
+    return null;
+  }
+  static importJSON(serializedNode) {
+    const node = $createThreadMarkNode(serializedNode.ids);
+    node.setFormat(serializedNode.format);
+    node.setIndent(serializedNode.indent);
+    node.setDirection(serializedNode.direction);
+    return node;
+  }
+  exportJSON() {
+    return {
+      ...super.exportJSON(),
+      ids: this.getIDs(),
+      type: "lb-thread-mark",
+      version: 1
+    };
+  }
+  createDOM() {
+    const element = document.createElement("span");
+    return element;
+  }
+  updateDOM(prevNode, element, config) {
+    const prevIDs = prevNode.__ids;
+    const nextIDs = this.__ids;
+    const prevIDsCount = prevIDs.length;
+    const nextIDsCount = nextIDs.length;
+    const overlapTheme = config.theme.markOverlap;
+    if (prevIDsCount !== nextIDsCount) {
+      if (prevIDsCount === 1) {
+        if (nextIDsCount === 2) {
+          utils.addClassNamesToElement(element, overlapTheme);
+        }
+      } else if (nextIDsCount === 1) {
+        utils.removeClassNamesFromElement(element, overlapTheme);
+      }
+    }
+    return false;
+  }
+  hasID(id) {
+    const ids = this.getIDs();
+    for (let i = 0; i < ids.length; i++) {
+      if (id === ids[i]) {
+        return true;
+      }
+    }
+    return false;
+  }
+  getIDs() {
+    const self = this.getLatest();
+    return $isThreadMarkNode(self) ? self.__ids : [];
+  }
+  addID(id) {
+    const self = this.getWritable();
+    if ($isThreadMarkNode(self)) {
+      const ids = self.__ids;
+      self.__ids = ids;
+      for (let i = 0; i < ids.length; i++) {
+        if (id === ids[i]) {
+          return;
+        }
+      }
+      ids.push(id);
+    }
+  }
+  deleteID(id) {
+    const self = this.getWritable();
+    if ($isThreadMarkNode(self)) {
+      const ids = self.__ids;
+      self.__ids = ids;
+      for (let i = 0; i < ids.length; i++) {
+        if (id === ids[i]) {
+          ids.splice(i, 1);
+          return;
+        }
+      }
+    }
+  }
+  insertNewAfter(_, restoreSelection = true) {
+    const markNode = $createThreadMarkNode(this.__ids);
+    this.insertAfter(markNode, restoreSelection);
+    return markNode;
+  }
+  canInsertTextBefore() {
+    return false;
+  }
+  canInsertTextAfter() {
+    return false;
+  }
+  canBeEmpty() {
+    return false;
+  }
+  isInline() {
+    return true;
+  }
+  extractWithChild(_, selection, destination) {
+    if (!lexical.$isRangeSelection(selection) || destination === "html") {
+      return false;
+    }
+    const anchor = selection.anchor;
+    const focus = selection.focus;
+    const anchorNode = anchor.getNode();
+    const focusNode = focus.getNode();
+    const isBackward = selection.isBackward();
+    const selectionLength = isBackward ? anchor.offset - focus.offset : focus.offset - anchor.offset;
+    return this.isParentOf(anchorNode) && this.isParentOf(focusNode) && this.getTextContent().length === selectionLength;
+  }
+  excludeFromCopy(destination) {
+    return destination !== "clone";
+  }
+}
+function $createThreadMarkNode(ids) {
+  return lexical.$applyNodeReplacement(new ThreadMarkNode(ids));
+}
+function $isThreadMarkNode(node) {
+  return node instanceof ThreadMarkNode;
+}
+
+exports.$createThreadMarkNode = $createThreadMarkNode;
+exports.$isThreadMarkNode = $isThreadMarkNode;
+exports.ThreadMarkNode = ThreadMarkNode;
+//# sourceMappingURL=thread-mark-node.js.map

package/dist/comments/thread-mark-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"thread-mark-node.js","sources":["../../src/comments/thread-mark-node.ts"],"sourcesContent":["/**\n * MIT License\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport {\n  addClassNamesToElement,\n  removeClassNamesFromElement,\n} from \"@lexical/utils\";\nimport type {\n  BaseSelection,\n  EditorConfig,\n  LexicalNode,\n  NodeKey,\n  RangeSelection,\n  SerializedElementNode,\n  Spread,\n} from \"lexical\";\nimport { $applyNodeReplacement, $isRangeSelection, ElementNode } from \"lexical\";\n\nexport type SerializedThreadMarkNode = Spread<\n  {\n    ids: Array<string>;\n  },\n  SerializedElementNode\n>;\n\nexport class ThreadMarkNode extends ElementNode {\n  /** @internal */\n  __ids: Array<string>; // The ids of the threads that this mark is associated with\n\n  static getType(): string {\n    return \"lb-thread-mark\";\n  }\n\n  static clone(node: ThreadMarkNode): ThreadMarkNode {\n    return new ThreadMarkNode(Array.from(node.__ids), node.__key);\n  }\n\n  static importDOM(): null {\n    return null;\n  }\n\n  static importJSON(serializedNode: SerializedThreadMarkNode): ThreadMarkNode {\n    const node = $createThreadMarkNode(serializedNode.ids);\n    node.setFormat(serializedNode.format);\n    node.setIndent(serializedNode.indent);\n    node.setDirection(serializedNode.direction);\n    return node;\n  }\n\n  exportJSON(): SerializedThreadMarkNode {\n    return {\n      ...super.exportJSON(),\n      ids: this.getIDs(),\n      type: \"lb-thread-mark\",\n      version: 1,\n    };\n  }\n\n  constructor(ids: Array<string>, key?: NodeKey) {\n    super(key);\n    this.__ids = ids || [];\n  }\n\n  createDOM(): HTMLElement {\n    const element = document.createElement(\"span\");\n    return element;\n  }\n\n  updateDOM(\n    prevNode: ThreadMarkNode,\n    element: HTMLElement,\n    config: EditorConfig\n  ): boolean {\n    const prevIDs = prevNode.__ids;\n    const nextIDs = this.__ids;\n    const prevIDsCount = prevIDs.length;\n    const nextIDsCount = nextIDs.length;\n    const overlapTheme = config.theme.markOverlap;\n\n    if (prevIDsCount !== nextIDsCount) {\n      if (prevIDsCount === 1) {\n        if (nextIDsCount === 2) {\n          addClassNamesToElement(element, overlapTheme);\n        }\n      } else if (nextIDsCount === 1) {\n        removeClassNamesFromElement(element, overlapTheme);\n      }\n    }\n    return false;\n  }\n\n  hasID(id: string): boolean {\n    const ids = this.getIDs();\n    for (let i = 0; i < ids.length; i++) {\n      if (id === ids[i]) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  getIDs(): Array<string> {\n    const self = this.getLatest();\n    return $isThreadMarkNode(self) ? self.__ids : [];\n  }\n\n  addID(id: string): void {\n    const self = this.getWritable();\n    if ($isThreadMarkNode(self)) {\n      const ids = self.__ids;\n      self.__ids = ids;\n      for (let i = 0; i < ids.length; i++) {\n        // If we already have it, don't add again\n        if (id === ids[i]) {\n          return;\n        }\n      }\n      ids.push(id);\n    }\n  }\n\n  deleteID(id: string): void {\n    const self = this.getWritable();\n    if ($isThreadMarkNode(self)) {\n      const ids = self.__ids;\n      self.__ids = ids;\n      for (let i = 0; i < ids.length; i++) {\n        if (id === ids[i]) {\n          ids.splice(i, 1);\n          return;\n        }\n      }\n    }\n  }\n\n  insertNewAfter(\n    _: RangeSelection,\n    restoreSelection = true\n  ): null | ElementNode {\n    const markNode = $createThreadMarkNode(this.__ids);\n    this.insertAfter(markNode, restoreSelection);\n    return markNode;\n  }\n\n  canInsertTextBefore(): false {\n    return false;\n  }\n\n  canInsertTextAfter(): false {\n    return false;\n  }\n\n  canBeEmpty(): false {\n    return false;\n  }\n\n  isInline(): true {\n    return true;\n  }\n\n  extractWithChild(\n    _: LexicalNode,\n    selection: BaseSelection,\n    destination: \"clone\" | \"html\"\n  ): boolean {\n    if (!$isRangeSelection(selection) || destination === \"html\") {\n      return false;\n    }\n    const anchor = selection.anchor;\n    const focus = selection.focus;\n    const anchorNode = anchor.getNode();\n    const focusNode = focus.getNode();\n    const isBackward = selection.isBackward();\n    const selectionLength = isBackward\n      ? anchor.offset - focus.offset\n      : focus.offset - anchor.offset;\n    return (\n      this.isParentOf(anchorNode) &&\n      this.isParentOf(focusNode) &&\n      this.getTextContent().length === selectionLength\n    );\n  }\n\n  excludeFromCopy(destination: \"clone\" | \"html\"): boolean {\n    return destination !== \"clone\";\n  }\n}\n\nexport function $createThreadMarkNode(ids: Array<string>): ThreadMarkNode {\n  return $applyNodeReplacement(new ThreadMarkNode(ids));\n}\n\nexport function $isThreadMarkNode(\n  node: LexicalNode | null\n): node is ThreadMarkNode {\n  return node instanceof ThreadMarkNode;\n}\n"],"names":["ElementNode","addClassNamesToElement","removeClassNamesFromElement","$isRangeSelection","$applyNodeReplacement"],"mappings":";;;;;AA6CO,MAAM,uBAAuBA,mBAAY,CAAA;AAAA,EAiC9C,WAAA,CAAY,KAAoB,GAAe,EAAA;AAC7C,IAAA,KAAA,CAAM,GAAG,CAAA,CAAA;AACT,IAAK,IAAA,CAAA,KAAA,GAAQ,OAAO,EAAC,CAAA;AAAA,GACvB;AAAA,EAhCA,OAAO,OAAkB,GAAA;AACvB,IAAO,OAAA,gBAAA,CAAA;AAAA,GACT;AAAA,EAEA,OAAO,MAAM,IAAsC,EAAA;AACjD,IAAO,OAAA,IAAI,eAAe,KAAM,CAAA,IAAA,CAAK,KAAK,KAAK,CAAA,EAAG,KAAK,KAAK,CAAA,CAAA;AAAA,GAC9D;AAAA,EAEA,OAAO,SAAkB,GAAA;AACvB,IAAO,OAAA,IAAA,CAAA;AAAA,GACT;AAAA,EAEA,OAAO,WAAW,cAA0D,EAAA;AAC1E,IAAM,MAAA,IAAA,GAAO,qBAAsB,CAAA,cAAA,CAAe,GAAG,CAAA,CAAA;AACrD,IAAK,IAAA,CAAA,SAAA,CAAU,eAAe,MAAM,CAAA,CAAA;AACpC,IAAK,IAAA,CAAA,SAAA,CAAU,eAAe,MAAM,CAAA,CAAA;AACpC,IAAK,IAAA,CAAA,YAAA,CAAa,eAAe,SAAS,CAAA,CAAA;AAC1C,IAAO,OAAA,IAAA,CAAA;AAAA,GACT;AAAA,EAEA,UAAuC,GAAA;AACrC,IAAO,OAAA;AAAA,MACL,GAAG,MAAM,UAAW,EAAA;AAAA,MACpB,GAAA,EAAK,KAAK,MAAO,EAAA;AAAA,MACjB,IAAM,EAAA,gBAAA;AAAA,MACN,OAAS,EAAA,CAAA;AAAA,KACX,CAAA;AAAA,GACF;AAAA,EAOA,SAAyB,GAAA;AACvB,IAAM,MAAA,OAAA,GAAU,QAAS,CAAA,aAAA,CAAc,MAAM,CAAA,CAAA;AAC7C,IAAO,OAAA,OAAA,CAAA;AAAA,GACT;AAAA,EAEA,SAAA,CACE,QACA,EAAA,OAAA,EACA,MACS,EAAA;AACT,IAAA,MAAM,UAAU,QAAS,CAAA,KAAA,CAAA;AACzB,IAAA,MAAM,UAAU,IAAK,CAAA,KAAA,CAAA;AACrB,IAAA,MAAM,eAAe,OAAQ,CAAA,MAAA,CAAA;AAC7B,IAAA,MAAM,eAAe,OAAQ,CAAA,MAAA,CAAA;AAC7B,IAAM,MAAA,YAAA,GAAe,OAAO,KAAM,CAAA,WAAA,CAAA;AAElC,IAAA,IAAI,iBAAiB,YAAc,EAAA;AACjC,MAAA,IAAI,iBAAiB,CAAG,EAAA;AACtB,QAAA,IAAI,iBAAiB,CAAG,EAAA;AACtB,UAAAC,4BAAA,CAAuB,SAAS,YAAY,CAAA,CAAA;AAAA,SAC9C;AAAA,OACF,MAAA,IAAW,iBAAiB,CAAG,EAAA;AAC7B,QAAAC,iCAAA,CAA4B,SAAS,YAAY,CAAA,CAAA;AAAA,OACnD;AAAA,KACF;AACA,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAAA,EAEA,MAAM,EAAqB,EAAA;AACzB,IAAM,MAAA,GAAA,GAAM,KAAK,MAAO,EAAA,CAAA;AACxB,IAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,GAAA,CAAI,QAAQ,CAAK,EAAA,EAAA;AACnC,MAAI,IAAA,EAAA,KAAO,IAAI,CAAI,CAAA,EAAA;AACjB,QAAO,OAAA,IAAA,CAAA;AAAA,OACT;AAAA,KACF;AACA,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAAA,EAEA,MAAwB,GAAA;AACtB,IAAM,MAAA,IAAA,GAAO,KAAK,SAAU,EAAA,CAAA;AAC5B,IAAA,OAAO,iBAAkB,CAAA,IAAI,CAAI,GAAA,IAAA,CAAK,QAAQ,EAAC,CAAA;AAAA,GACjD;AAAA,EAEA,MAAM,EAAkB,EAAA;AACtB,IAAM,MAAA,IAAA,GAAO,KAAK,WAAY,EAAA,CAAA;AAC9B,IAAI,IAAA,iBAAA,CAAkB,IAAI,CAAG,EAAA;AAC3B,MAAA,MAAM,MAAM,IAAK,CAAA,KAAA,CAAA;AACjB,MAAA,IAAA,CAAK,KAAQ,GAAA,GAAA,CAAA;AACb,MAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,GAAA,CAAI,QAAQ,CAAK,EAAA,EAAA;AAEnC,QAAI,IAAA,EAAA,KAAO,IAAI,CAAI,CAAA,EAAA;AACjB,UAAA,OAAA;AAAA,SACF;AAAA,OACF;AACA,MAAA,GAAA,CAAI,KAAK,EAAE,CAAA,CAAA;AAAA,KACb;AAAA,GACF;AAAA,EAEA,SAAS,EAAkB,EAAA;AACzB,IAAM,MAAA,IAAA,GAAO,KAAK,WAAY,EAAA,CAAA;AAC9B,IAAI,IAAA,iBAAA,CAAkB,IAAI,CAAG,EAAA;AAC3B,MAAA,MAAM,MAAM,IAAK,CAAA,KAAA,CAAA;AACjB,MAAA,IAAA,CAAK,KAAQ,GAAA,GAAA,CAAA;AACb,MAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,GAAA,CAAI,QAAQ,CAAK,EAAA,EAAA;AACnC,QAAI,IAAA,EAAA,KAAO,IAAI,CAAI,CAAA,EAAA;AACjB,UAAI,GAAA,CAAA,MAAA,CAAO,GAAG,CAAC,CAAA,CAAA;AACf,UAAA,OAAA;AAAA,SACF;AAAA,OACF;AAAA,KACF;AAAA,GACF;AAAA,EAEA,cAAA,CACE,CACA,EAAA,gBAAA,GAAmB,IACC,EAAA;AACpB,IAAM,MAAA,QAAA,GAAW,qBAAsB,CAAA,IAAA,CAAK,KAAK,CAAA,CAAA;AACjD,IAAK,IAAA,CAAA,WAAA,CAAY,UAAU,gBAAgB,CAAA,CAAA;AAC3C,IAAO,OAAA,QAAA,CAAA;AAAA,GACT;AAAA,EAEA,mBAA6B,GAAA;AAC3B,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAAA,EAEA,kBAA4B,GAAA;AAC1B,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAAA,EAEA,UAAoB,GAAA;AAClB,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAAA,EAEA,QAAiB,GAAA;AACf,IAAO,OAAA,IAAA,CAAA;AAAA,GACT;AAAA,EAEA,gBAAA,CACE,CACA,EAAA,SAAA,EACA,WACS,EAAA;AACT,IAAA,IAAI,CAACC,yBAAA,CAAkB,SAAS,CAAA,IAAK,gBAAgB,MAAQ,EAAA;AAC3D,MAAO,OAAA,KAAA,CAAA;AAAA,KACT;AACA,IAAA,MAAM,SAAS,SAAU,CAAA,MAAA,CAAA;AACzB,IAAA,MAAM,QAAQ,SAAU,CAAA,KAAA,CAAA;AACxB,IAAM,MAAA,UAAA,GAAa,OAAO,OAAQ,EAAA,CAAA;AAClC,IAAM,MAAA,SAAA,GAAY,MAAM,OAAQ,EAAA,CAAA;AAChC,IAAM,MAAA,UAAA,GAAa,UAAU,UAAW,EAAA,CAAA;AACxC,IAAM,MAAA,eAAA,GAAkB,aACpB,MAAO,CAAA,MAAA,GAAS,MAAM,MACtB,GAAA,KAAA,CAAM,SAAS,MAAO,CAAA,MAAA,CAAA;AAC1B,IACE,OAAA,IAAA,CAAK,UAAW,CAAA,UAAU,CAC1B,IAAA,IAAA,CAAK,UAAW,CAAA,SAAS,CACzB,IAAA,IAAA,CAAK,cAAe,EAAA,CAAE,MAAW,KAAA,eAAA,CAAA;AAAA,GAErC;AAAA,EAEA,gBAAgB,WAAwC,EAAA;AACtD,IAAA,OAAO,WAAgB,KAAA,OAAA,CAAA;AAAA,GACzB;AACF,CAAA;AAEO,SAAS,sBAAsB,GAAoC,EAAA;AACxE,EAAA,OAAOC,6BAAsB,CAAA,IAAI,cAAe,CAAA,GAAG,CAAC,CAAA,CAAA;AACtD,CAAA;AAEO,SAAS,kBACd,IACwB,EAAA;AACxB,EAAA,OAAO,IAAgB,YAAA,cAAA,CAAA;AACzB;;;;;;"}

package/dist/comments/thread-mark-node.mjs

@@ -0,0 +1,134 @@
+import { addClassNamesToElement, removeClassNamesFromElement } from '@lexical/utils';
+import { ElementNode, $isRangeSelection, $applyNodeReplacement } from 'lexical';
+
+class ThreadMarkNode extends ElementNode {
+  constructor(ids, key) {
+    super(key);
+    this.__ids = ids || [];
+  }
+  static getType() {
+    return "lb-thread-mark";
+  }
+  static clone(node) {
+    return new ThreadMarkNode(Array.from(node.__ids), node.__key);
+  }
+  static importDOM() {
+    return null;
+  }
+  static importJSON(serializedNode) {
+    const node = $createThreadMarkNode(serializedNode.ids);
+    node.setFormat(serializedNode.format);
+    node.setIndent(serializedNode.indent);
+    node.setDirection(serializedNode.direction);
+    return node;
+  }
+  exportJSON() {
+    return {
+      ...super.exportJSON(),
+      ids: this.getIDs(),
+      type: "lb-thread-mark",
+      version: 1
+    };
+  }
+  createDOM() {
+    const element = document.createElement("span");
+    return element;
+  }
+  updateDOM(prevNode, element, config) {
+    const prevIDs = prevNode.__ids;
+    const nextIDs = this.__ids;
+    const prevIDsCount = prevIDs.length;
+    const nextIDsCount = nextIDs.length;
+    const overlapTheme = config.theme.markOverlap;
+    if (prevIDsCount !== nextIDsCount) {
+      if (prevIDsCount === 1) {
+        if (nextIDsCount === 2) {
+          addClassNamesToElement(element, overlapTheme);
+        }
+      } else if (nextIDsCount === 1) {
+        removeClassNamesFromElement(element, overlapTheme);
+      }
+    }
+    return false;
+  }
+  hasID(id) {
+    const ids = this.getIDs();
+    for (let i = 0; i < ids.length; i++) {
+      if (id === ids[i]) {
+        return true;
+      }
+    }
+    return false;
+  }
+  getIDs() {
+    const self = this.getLatest();
+    return $isThreadMarkNode(self) ? self.__ids : [];
+  }
+  addID(id) {
+    const self = this.getWritable();
+    if ($isThreadMarkNode(self)) {
+      const ids = self.__ids;
+      self.__ids = ids;
+      for (let i = 0; i < ids.length; i++) {
+        if (id === ids[i]) {
+          return;
+        }
+      }
+      ids.push(id);
+    }
+  }
+  deleteID(id) {
+    const self = this.getWritable();
+    if ($isThreadMarkNode(self)) {
+      const ids = self.__ids;
+      self.__ids = ids;
+      for (let i = 0; i < ids.length; i++) {
+        if (id === ids[i]) {
+          ids.splice(i, 1);
+          return;
+        }
+      }
+    }
+  }
+  insertNewAfter(_, restoreSelection = true) {
+    const markNode = $createThreadMarkNode(this.__ids);
+    this.insertAfter(markNode, restoreSelection);
+    return markNode;
+  }
+  canInsertTextBefore() {
+    return false;
+  }
+  canInsertTextAfter() {
+    return false;
+  }
+  canBeEmpty() {
+    return false;
+  }
+  isInline() {
+    return true;
+  }
+  extractWithChild(_, selection, destination) {
+    if (!$isRangeSelection(selection) || destination === "html") {
+      return false;
+    }
+    const anchor = selection.anchor;
+    const focus = selection.focus;
+    const anchorNode = anchor.getNode();
+    const focusNode = focus.getNode();
+    const isBackward = selection.isBackward();
+    const selectionLength = isBackward ? anchor.offset - focus.offset : focus.offset - anchor.offset;
+    return this.isParentOf(anchorNode) && this.isParentOf(focusNode) && this.getTextContent().length === selectionLength;
+  }
+  excludeFromCopy(destination) {
+    return destination !== "clone";
+  }
+}
+function $createThreadMarkNode(ids) {
+  return $applyNodeReplacement(new ThreadMarkNode(ids));
+}
+function $isThreadMarkNode(node) {
+  return node instanceof ThreadMarkNode;
+}
+
+export { $createThreadMarkNode, $isThreadMarkNode, ThreadMarkNode };
+//# sourceMappingURL=thread-mark-node.mjs.map

package/dist/comments/thread-mark-node.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"thread-mark-node.mjs","sources":["../../src/comments/thread-mark-node.ts"],"sourcesContent":["/**\n * MIT License\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport {\n  addClassNamesToElement,\n  removeClassNamesFromElement,\n} from \"@lexical/utils\";\nimport type {\n  BaseSelection,\n  EditorConfig,\n  LexicalNode,\n  NodeKey,\n  RangeSelection,\n  SerializedElementNode,\n  Spread,\n} from \"lexical\";\nimport { $applyNodeReplacement, $isRangeSelection, ElementNode } from \"lexical\";\n\nexport type SerializedThreadMarkNode = Spread<\n  {\n    ids: Array<string>;\n  },\n  SerializedElementNode\n>;\n\nexport class ThreadMarkNode extends ElementNode {\n  /** @internal */\n  __ids: Array<string>; // The ids of the threads that this mark is associated with\n\n  static getType(): string {\n    return \"lb-thread-mark\";\n  }\n\n  static clone(node: ThreadMarkNode): ThreadMarkNode {\n    return new ThreadMarkNode(Array.from(node.__ids), node.__key);\n  }\n\n  static importDOM(): null {\n    return null;\n  }\n\n  static importJSON(serializedNode: SerializedThreadMarkNode): ThreadMarkNode {\n    const node = $createThreadMarkNode(serializedNode.ids);\n    node.setFormat(serializedNode.format);\n    node.setIndent(serializedNode.indent);\n    node.setDirection(serializedNode.direction);\n    return node;\n  }\n\n  exportJSON(): SerializedThreadMarkNode {\n    return {\n      ...super.exportJSON(),\n      ids: this.getIDs(),\n      type: \"lb-thread-mark\",\n      version: 1,\n    };\n  }\n\n  constructor(ids: Array<string>, key?: NodeKey) {\n    super(key);\n    this.__ids = ids || [];\n  }\n\n  createDOM(): HTMLElement {\n    const element = document.createElement(\"span\");\n    return element;\n  }\n\n  updateDOM(\n    prevNode: ThreadMarkNode,\n    element: HTMLElement,\n    config: EditorConfig\n  ): boolean {\n    const prevIDs = prevNode.__ids;\n    const nextIDs = this.__ids;\n    const prevIDsCount = prevIDs.length;\n    const nextIDsCount = nextIDs.length;\n    const overlapTheme = config.theme.markOverlap;\n\n    if (prevIDsCount !== nextIDsCount) {\n      if (prevIDsCount === 1) {\n        if (nextIDsCount === 2) {\n          addClassNamesToElement(element, overlapTheme);\n        }\n      } else if (nextIDsCount === 1) {\n        removeClassNamesFromElement(element, overlapTheme);\n      }\n    }\n    return false;\n  }\n\n  hasID(id: string): boolean {\n    const ids = this.getIDs();\n    for (let i = 0; i < ids.length; i++) {\n      if (id === ids[i]) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  getIDs(): Array<string> {\n    const self = this.getLatest();\n    return $isThreadMarkNode(self) ? self.__ids : [];\n  }\n\n  addID(id: string): void {\n    const self = this.getWritable();\n    if ($isThreadMarkNode(self)) {\n      const ids = self.__ids;\n      self.__ids = ids;\n      for (let i = 0; i < ids.length; i++) {\n        // If we already have it, don't add again\n        if (id === ids[i]) {\n          return;\n        }\n      }\n      ids.push(id);\n    }\n  }\n\n  deleteID(id: string): void {\n    const self = this.getWritable();\n    if ($isThreadMarkNode(self)) {\n      const ids = self.__ids;\n      self.__ids = ids;\n      for (let i = 0; i < ids.length; i++) {\n        if (id === ids[i]) {\n          ids.splice(i, 1);\n          return;\n        }\n      }\n    }\n  }\n\n  insertNewAfter(\n    _: RangeSelection,\n    restoreSelection = true\n  ): null | ElementNode {\n    const markNode = $createThreadMarkNode(this.__ids);\n    this.insertAfter(markNode, restoreSelection);\n    return markNode;\n  }\n\n  canInsertTextBefore(): false {\n    return false;\n  }\n\n  canInsertTextAfter(): false {\n    return false;\n  }\n\n  canBeEmpty(): false {\n    return false;\n  }\n\n  isInline(): true {\n    return true;\n  }\n\n  extractWithChild(\n    _: LexicalNode,\n    selection: BaseSelection,\n    destination: \"clone\" | \"html\"\n  ): boolean {\n    if (!$isRangeSelection(selection) || destination === \"html\") {\n      return false;\n    }\n    const anchor = selection.anchor;\n    const focus = selection.focus;\n    const anchorNode = anchor.getNode();\n    const focusNode = focus.getNode();\n    const isBackward = selection.isBackward();\n    const selectionLength = isBackward\n      ? anchor.offset - focus.offset\n      : focus.offset - anchor.offset;\n    return (\n      this.isParentOf(anchorNode) &&\n      this.isParentOf(focusNode) &&\n      this.getTextContent().length === selectionLength\n    );\n  }\n\n  excludeFromCopy(destination: \"clone\" | \"html\"): boolean {\n    return destination !== \"clone\";\n  }\n}\n\nexport function $createThreadMarkNode(ids: Array<string>): ThreadMarkNode {\n  return $applyNodeReplacement(new ThreadMarkNode(ids));\n}\n\nexport function $isThreadMarkNode(\n  node: LexicalNode | null\n): node is ThreadMarkNode {\n  return node instanceof ThreadMarkNode;\n}\n"],"names":[],"mappings":";;;AA6CO,MAAM,uBAAuB,WAAY,CAAA;AAAA,EAiC9C,WAAA,CAAY,KAAoB,GAAe,EAAA;AAC7C,IAAA,KAAA,CAAM,GAAG,CAAA,CAAA;AACT,IAAK,IAAA,CAAA,KAAA,GAAQ,OAAO,EAAC,CAAA;AAAA,GACvB;AAAA,EAhCA,OAAO,OAAkB,GAAA;AACvB,IAAO,OAAA,gBAAA,CAAA;AAAA,GACT;AAAA,EAEA,OAAO,MAAM,IAAsC,EAAA;AACjD,IAAO,OAAA,IAAI,eAAe,KAAM,CAAA,IAAA,CAAK,KAAK,KAAK,CAAA,EAAG,KAAK,KAAK,CAAA,CAAA;AAAA,GAC9D;AAAA,EAEA,OAAO,SAAkB,GAAA;AACvB,IAAO,OAAA,IAAA,CAAA;AAAA,GACT;AAAA,EAEA,OAAO,WAAW,cAA0D,EAAA;AAC1E,IAAM,MAAA,IAAA,GAAO,qBAAsB,CAAA,cAAA,CAAe,GAAG,CAAA,CAAA;AACrD,IAAK,IAAA,CAAA,SAAA,CAAU,eAAe,MAAM,CAAA,CAAA;AACpC,IAAK,IAAA,CAAA,SAAA,CAAU,eAAe,MAAM,CAAA,CAAA;AACpC,IAAK,IAAA,CAAA,YAAA,CAAa,eAAe,SAAS,CAAA,CAAA;AAC1C,IAAO,OAAA,IAAA,CAAA;AAAA,GACT;AAAA,EAEA,UAAuC,GAAA;AACrC,IAAO,OAAA;AAAA,MACL,GAAG,MAAM,UAAW,EAAA;AAAA,MACpB,GAAA,EAAK,KAAK,MAAO,EAAA;AAAA,MACjB,IAAM,EAAA,gBAAA;AAAA,MACN,OAAS,EAAA,CAAA;AAAA,KACX,CAAA;AAAA,GACF;AAAA,EAOA,SAAyB,GAAA;AACvB,IAAM,MAAA,OAAA,GAAU,QAAS,CAAA,aAAA,CAAc,MAAM,CAAA,CAAA;AAC7C,IAAO,OAAA,OAAA,CAAA;AAAA,GACT;AAAA,EAEA,SAAA,CACE,QACA,EAAA,OAAA,EACA,MACS,EAAA;AACT,IAAA,MAAM,UAAU,QAAS,CAAA,KAAA,CAAA;AACzB,IAAA,MAAM,UAAU,IAAK,CAAA,KAAA,CAAA;AACrB,IAAA,MAAM,eAAe,OAAQ,CAAA,MAAA,CAAA;AAC7B,IAAA,MAAM,eAAe,OAAQ,CAAA,MAAA,CAAA;AAC7B,IAAM,MAAA,YAAA,GAAe,OAAO,KAAM,CAAA,WAAA,CAAA;AAElC,IAAA,IAAI,iBAAiB,YAAc,EAAA;AACjC,MAAA,IAAI,iBAAiB,CAAG,EAAA;AACtB,QAAA,IAAI,iBAAiB,CAAG,EAAA;AACtB,UAAA,sBAAA,CAAuB,SAAS,YAAY,CAAA,CAAA;AAAA,SAC9C;AAAA,OACF,MAAA,IAAW,iBAAiB,CAAG,EAAA;AAC7B,QAAA,2BAAA,CAA4B,SAAS,YAAY,CAAA,CAAA;AAAA,OACnD;AAAA,KACF;AACA,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAAA,EAEA,MAAM,EAAqB,EAAA;AACzB,IAAM,MAAA,GAAA,GAAM,KAAK,MAAO,EAAA,CAAA;AACxB,IAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,GAAA,CAAI,QAAQ,CAAK,EAAA,EAAA;AACnC,MAAI,IAAA,EAAA,KAAO,IAAI,CAAI,CAAA,EAAA;AACjB,QAAO,OAAA,IAAA,CAAA;AAAA,OACT;AAAA,KACF;AACA,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAAA,EAEA,MAAwB,GAAA;AACtB,IAAM,MAAA,IAAA,GAAO,KAAK,SAAU,EAAA,CAAA;AAC5B,IAAA,OAAO,iBAAkB,CAAA,IAAI,CAAI,GAAA,IAAA,CAAK,QAAQ,EAAC,CAAA;AAAA,GACjD;AAAA,EAEA,MAAM,EAAkB,EAAA;AACtB,IAAM,MAAA,IAAA,GAAO,KAAK,WAAY,EAAA,CAAA;AAC9B,IAAI,IAAA,iBAAA,CAAkB,IAAI,CAAG,EAAA;AAC3B,MAAA,MAAM,MAAM,IAAK,CAAA,KAAA,CAAA;AACjB,MAAA,IAAA,CAAK,KAAQ,GAAA,GAAA,CAAA;AACb,MAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,GAAA,CAAI,QAAQ,CAAK,EAAA,EAAA;AAEnC,QAAI,IAAA,EAAA,KAAO,IAAI,CAAI,CAAA,EAAA;AACjB,UAAA,OAAA;AAAA,SACF;AAAA,OACF;AACA,MAAA,GAAA,CAAI,KAAK,EAAE,CAAA,CAAA;AAAA,KACb;AAAA,GACF;AAAA,EAEA,SAAS,EAAkB,EAAA;AACzB,IAAM,MAAA,IAAA,GAAO,KAAK,WAAY,EAAA,CAAA;AAC9B,IAAI,IAAA,iBAAA,CAAkB,IAAI,CAAG,EAAA;AAC3B,MAAA,MAAM,MAAM,IAAK,CAAA,KAAA,CAAA;AACjB,MAAA,IAAA,CAAK,KAAQ,GAAA,GAAA,CAAA;AACb,MAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,GAAA,CAAI,QAAQ,CAAK,EAAA,EAAA;AACnC,QAAI,IAAA,EAAA,KAAO,IAAI,CAAI,CAAA,EAAA;AACjB,UAAI,GAAA,CAAA,MAAA,CAAO,GAAG,CAAC,CAAA,CAAA;AACf,UAAA,OAAA;AAAA,SACF;AAAA,OACF;AAAA,KACF;AAAA,GACF;AAAA,EAEA,cAAA,CACE,CACA,EAAA,gBAAA,GAAmB,IACC,EAAA;AACpB,IAAM,MAAA,QAAA,GAAW,qBAAsB,CAAA,IAAA,CAAK,KAAK,CAAA,CAAA;AACjD,IAAK,IAAA,CAAA,WAAA,CAAY,UAAU,gBAAgB,CAAA,CAAA;AAC3C,IAAO,OAAA,QAAA,CAAA;AAAA,GACT;AAAA,EAEA,mBAA6B,GAAA;AAC3B,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAAA,EAEA,kBAA4B,GAAA;AAC1B,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAAA,EAEA,UAAoB,GAAA;AAClB,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAAA,EAEA,QAAiB,GAAA;AACf,IAAO,OAAA,IAAA,CAAA;AAAA,GACT;AAAA,EAEA,gBAAA,CACE,CACA,EAAA,SAAA,EACA,WACS,EAAA;AACT,IAAA,IAAI,CAAC,iBAAA,CAAkB,SAAS,CAAA,IAAK,gBAAgB,MAAQ,EAAA;AAC3D,MAAO,OAAA,KAAA,CAAA;AAAA,KACT;AACA,IAAA,MAAM,SAAS,SAAU,CAAA,MAAA,CAAA;AACzB,IAAA,MAAM,QAAQ,SAAU,CAAA,KAAA,CAAA;AACxB,IAAM,MAAA,UAAA,GAAa,OAAO,OAAQ,EAAA,CAAA;AAClC,IAAM,MAAA,SAAA,GAAY,MAAM,OAAQ,EAAA,CAAA;AAChC,IAAM,MAAA,UAAA,GAAa,UAAU,UAAW,EAAA,CAAA;AACxC,IAAM,MAAA,eAAA,GAAkB,aACpB,MAAO,CAAA,MAAA,GAAS,MAAM,MACtB,GAAA,KAAA,CAAM,SAAS,MAAO,CAAA,MAAA,CAAA;AAC1B,IACE,OAAA,IAAA,CAAK,UAAW,CAAA,UAAU,CAC1B,IAAA,IAAA,CAAK,UAAW,CAAA,SAAS,CACzB,IAAA,IAAA,CAAK,cAAe,EAAA,CAAE,MAAW,KAAA,eAAA,CAAA;AAAA,GAErC;AAAA,EAEA,gBAAgB,WAAwC,EAAA;AACtD,IAAA,OAAO,WAAgB,KAAA,OAAA,CAAA;AAAA,GACzB;AACF,CAAA;AAEO,SAAS,sBAAsB,GAAoC,EAAA;AACxE,EAAA,OAAO,qBAAsB,CAAA,IAAI,cAAe,CAAA,GAAG,CAAC,CAAA,CAAA;AACtD,CAAA;AAEO,SAAS,kBACd,IACwB,EAAA;AACxB,EAAA,OAAO,IAAgB,YAAA,cAAA,CAAA;AACzB;;;;"}

package/dist/comments/unwrap-thread-mark-node.js

@@ -0,0 +1,19 @@
+'use strict';
+
+function $unwrapThreadMarkNode(node) {
+  const children = node.getChildren();
+  let target = null;
+  for (let i = 0; i < children.length; i++) {
+    const child = children[i];
+    if (target === null) {
+      node.insertBefore(child);
+    } else {
+      target.insertAfter(child);
+    }
+    target = child;
+  }
+  node.remove();
+}
+
+module.exports = $unwrapThreadMarkNode;
+//# sourceMappingURL=unwrap-thread-mark-node.js.map

package/dist/comments/unwrap-thread-mark-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unwrap-thread-mark-node.js","sources":["../../src/comments/unwrap-thread-mark-node.ts"],"sourcesContent":["import type { ThreadMarkNode } from \"./thread-mark-node\";\n\nexport default function $unwrapThreadMarkNode(node: ThreadMarkNode): void {\n  const children = node.getChildren();\n  let target = null;\n  for (let i = 0; i < children.length; i++) {\n    const child = children[i];\n    if (target === null) {\n      node.insertBefore(child);\n    } else {\n      target.insertAfter(child);\n    }\n    target = child;\n  }\n  node.remove();\n}\n"],"names":[],"mappings":";;AAEA,SAAwB,sBAAsB,IAA4B,EAAA;AACxE,EAAM,MAAA,QAAA,GAAW,KAAK,WAAY,EAAA,CAAA;AAClC,EAAA,IAAI,MAAS,GAAA,IAAA,CAAA;AACb,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,QAAA,CAAS,QAAQ,CAAK,EAAA,EAAA;AACxC,IAAA,MAAM,QAAQ,QAAS,CAAA,CAAA,CAAA,CAAA;AACvB,IAAA,IAAI,WAAW,IAAM,EAAA;AACnB,MAAA,IAAA,CAAK,aAAa,KAAK,CAAA,CAAA;AAAA,KAClB,MAAA;AACL,MAAA,MAAA,CAAO,YAAY,KAAK,CAAA,CAAA;AAAA,KAC1B;AACA,IAAS,MAAA,GAAA,KAAA,CAAA;AAAA,GACX;AACA,EAAA,IAAA,CAAK,MAAO,EAAA,CAAA;AACd;;;;"}

package/dist/comments/unwrap-thread-mark-node.mjs

@@ -0,0 +1,17 @@
+function $unwrapThreadMarkNode(node) {
+  const children = node.getChildren();
+  let target = null;
+  for (let i = 0; i < children.length; i++) {
+    const child = children[i];
+    if (target === null) {
+      node.insertBefore(child);
+    } else {
+      target.insertAfter(child);
+    }
+    target = child;
+  }
+  node.remove();
+}
+
+export { $unwrapThreadMarkNode as default };
+//# sourceMappingURL=unwrap-thread-mark-node.mjs.map

package/dist/comments/unwrap-thread-mark-node.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"unwrap-thread-mark-node.mjs","sources":["../../src/comments/unwrap-thread-mark-node.ts"],"sourcesContent":["import type { ThreadMarkNode } from \"./thread-mark-node\";\n\nexport default function $unwrapThreadMarkNode(node: ThreadMarkNode): void {\n  const children = node.getChildren();\n  let target = null;\n  for (let i = 0; i < children.length; i++) {\n    const child = children[i];\n    if (target === null) {\n      node.insertBefore(child);\n    } else {\n      target.insertAfter(child);\n    }\n    target = child;\n  }\n  node.remove();\n}\n"],"names":[],"mappings":"AAEA,SAAwB,sBAAsB,IAA4B,EAAA;AACxE,EAAM,MAAA,QAAA,GAAW,KAAK,WAAY,EAAA,CAAA;AAClC,EAAA,IAAI,MAAS,GAAA,IAAA,CAAA;AACb,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,QAAA,CAAS,QAAQ,CAAK,EAAA,EAAA;AACxC,IAAA,MAAM,QAAQ,QAAS,CAAA,CAAA,CAAA,CAAA;AACvB,IAAA,IAAI,WAAW,IAAM,EAAA;AACnB,MAAA,IAAA,CAAK,aAAa,KAAK,CAAA,CAAA;AAAA,KAClB,MAAA;AACL,MAAA,MAAA,CAAO,YAAY,KAAK,CAAA,CAAA;AAAA,KAC1B;AACA,IAAS,MAAA,GAAA,KAAA,CAAA;AAAA,GACX;AACA,EAAA,IAAA,CAAK,MAAO,EAAA,CAAA;AACd;;;;"}

package/dist/comments/wrap-selection-in-thread-mark-node.js

@@ -0,0 +1,63 @@
+'use strict';
+
+var lexical = require('lexical');
+var threadMarkNode = require('./thread-mark-node.js');
+
+function $wrapSelectionInThreadMarkNode(selection, isBackward, id, createNode) {
+  const nodes = selection.getNodes();
+  const anchorOffset = selection.anchor.offset;
+  const focusOffset = selection.focus.offset;
+  const nodesLength = nodes.length;
+  const startOffset = isBackward ? focusOffset : anchorOffset;
+  const endOffset = isBackward ? anchorOffset : focusOffset;
+  let currentNodeParent;
+  let lastCreatedMarkNode;
+  for (let i = 0; i < nodesLength; i++) {
+    const node = nodes[i];
+    if (lexical.$isElementNode(lastCreatedMarkNode) && lastCreatedMarkNode.isParentOf(node)) {
+      continue;
+    }
+    const isFirstNode = i === 0;
+    const isLastNode = i === nodesLength - 1;
+    let targetNode = null;
+    if (lexical.$isTextNode(node)) {
+      const textContentSize = node.getTextContentSize();
+      const startTextOffset = isFirstNode ? startOffset : 0;
+      const endTextOffset = isLastNode ? endOffset : textContentSize;
+      if (startTextOffset === 0 && endTextOffset === 0) {
+        continue;
+      }
+      const splitNodes = node.splitText(startTextOffset, endTextOffset);
+      targetNode = splitNodes.length > 1 && (splitNodes.length === 3 || isFirstNode && !isLastNode || endTextOffset === textContentSize) ? splitNodes[1] : splitNodes[0];
+    } else if (threadMarkNode.$isThreadMarkNode(node)) {
+      continue;
+    } else if (lexical.$isElementNode(node) && node.isInline()) {
+      targetNode = node;
+    }
+    if (targetNode !== null) {
+      if (targetNode && targetNode.is(currentNodeParent)) {
+        continue;
+      }
+      const parentNode = targetNode.getParent();
+      if (parentNode === null || !parentNode.is(currentNodeParent)) {
+        lastCreatedMarkNode = void 0;
+      }
+      currentNodeParent = parentNode;
+      if (lastCreatedMarkNode === void 0) {
+        const createMarkNode = createNode || threadMarkNode.$createThreadMarkNode;
+        lastCreatedMarkNode = createMarkNode([id]);
+        targetNode.insertBefore(lastCreatedMarkNode);
+      }
+      lastCreatedMarkNode.append(targetNode);
+    } else {
+      currentNodeParent = void 0;
+      lastCreatedMarkNode = void 0;
+    }
+  }
+  if (lexical.$isElementNode(lastCreatedMarkNode)) {
+    isBackward ? lastCreatedMarkNode.selectStart() : lastCreatedMarkNode.selectEnd();
+  }
+}
+
+module.exports = $wrapSelectionInThreadMarkNode;
+//# sourceMappingURL=wrap-selection-in-thread-mark-node.js.map

package/dist/comments/wrap-selection-in-thread-mark-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"wrap-selection-in-thread-mark-node.js","sources":["../../src/comments/wrap-selection-in-thread-mark-node.ts"],"sourcesContent":["/**\n * MIT License\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport type { LexicalNode, RangeSelection } from \"lexical\";\nimport { $isElementNode, $isTextNode } from \"lexical\";\n\nimport type { ThreadMarkNode } from \"./thread-mark-node\";\nimport { $createThreadMarkNode, $isThreadMarkNode } from \"./thread-mark-node\";\n\nexport default function $wrapSelectionInThreadMarkNode(\n  selection: RangeSelection,\n  isBackward: boolean,\n  id: string,\n  createNode?: (ids: Array<string>) => ThreadMarkNode\n): void {\n  const nodes = selection.getNodes();\n  const anchorOffset = selection.anchor.offset;\n  const focusOffset = selection.focus.offset;\n  const nodesLength = nodes.length;\n  const startOffset = isBackward ? focusOffset : anchorOffset;\n  const endOffset = isBackward ? anchorOffset : focusOffset;\n  let currentNodeParent;\n  let lastCreatedMarkNode;\n\n  // We only want wrap adjacent text nodes, line break nodes\n  // and inline element nodes. For decorator nodes and block\n  // element nodes, we step out of their boundary and start\n  // again after, if there are more nodes.\n  for (let i = 0; i < nodesLength; i++) {\n    const node = nodes[i];\n    if (\n      $isElementNode(lastCreatedMarkNode) &&\n      lastCreatedMarkNode.isParentOf(node)\n    ) {\n      // If the current node is a child of the last created mark node, there is nothing to do here\n      continue;\n    }\n    const isFirstNode = i === 0;\n    const isLastNode = i === nodesLength - 1;\n    let targetNode: LexicalNode | null = null;\n\n    if ($isTextNode(node)) {\n      // Case 1: The node is a text node and we can split it\n      const textContentSize = node.getTextContentSize();\n      const startTextOffset = isFirstNode ? startOffset : 0;\n      const endTextOffset = isLastNode ? endOffset : textContentSize;\n      if (startTextOffset === 0 && endTextOffset === 0) {\n        continue;\n      }\n      const splitNodes = node.splitText(startTextOffset, endTextOffset);\n      targetNode =\n        splitNodes.length > 1 &&\n        (splitNodes.length === 3 ||\n          (isFirstNode && !isLastNode) ||\n          endTextOffset === textContentSize)\n          ? splitNodes[1]\n          : splitNodes[0];\n    } else if ($isThreadMarkNode(node)) {\n      // Case 2: the node is a mark node and we can ignore it as a target,\n      // moving on to its children. Note that when we make a mark inside\n      // another mark, it may utlimately be unnested by a call to\n      // `registerNestedElementResolver<MarkNode>` somewhere else in the\n      // codebase.\n\n      continue;\n    } else if ($isElementNode(node) && node.isInline()) {\n      // Case 3: inline element nodes can be added in their entirety to the new\n      // mark\n      targetNode = node;\n    }\n\n    if (targetNode !== null) {\n      // Now that we have a target node for wrapping with a mark, we can run\n      // through special cases.\n      if (targetNode && targetNode.is(currentNodeParent)) {\n        // The current node is a child of the target node to be wrapped, there\n        // is nothing to do here.\n        continue;\n      }\n      const parentNode = targetNode.getParent();\n      if (parentNode === null || !parentNode.is(currentNodeParent)) {\n        // If the parent node is not the current node's parent node, we can\n        // clear the last created mark node.\n        lastCreatedMarkNode = undefined;\n      }\n\n      currentNodeParent = parentNode;\n\n      if (lastCreatedMarkNode === undefined) {\n        // If we don't have a created mark node, we can make one\n        const createMarkNode = createNode || $createThreadMarkNode;\n        lastCreatedMarkNode = createMarkNode([id]);\n        targetNode.insertBefore(lastCreatedMarkNode);\n      }\n\n      // Add the target node to be wrapped in the latest created mark node\n      lastCreatedMarkNode.append(targetNode);\n    } else {\n      // If we don't have a target node to wrap we can clear our state and\n      // continue on with the next node\n      currentNodeParent = undefined;\n      lastCreatedMarkNode = undefined;\n    }\n  }\n  // Make selection collapsed at the end\n  if ($isElementNode(lastCreatedMarkNode)) {\n    // eslint-disable-next-line no-unused-expressions\n    isBackward\n      ? lastCreatedMarkNode.selectStart()\n      : lastCreatedMarkNode.selectEnd();\n  }\n}\n"],"names":["$isElementNode","$isTextNode","$isThreadMarkNode","$createThreadMarkNode"],"mappings":";;;;;AA6BA,SAAwB,8BACtB,CAAA,SAAA,EACA,UACA,EAAA,EAAA,EACA,UACM,EAAA;AACN,EAAM,MAAA,KAAA,GAAQ,UAAU,QAAS,EAAA,CAAA;AACjC,EAAM,MAAA,YAAA,GAAe,UAAU,MAAO,CAAA,MAAA,CAAA;AACtC,EAAM,MAAA,WAAA,GAAc,UAAU,KAAM,CAAA,MAAA,CAAA;AACpC,EAAA,MAAM,cAAc,KAAM,CAAA,MAAA,CAAA;AAC1B,EAAM,MAAA,WAAA,GAAc,aAAa,WAAc,GAAA,YAAA,CAAA;AAC/C,EAAM,MAAA,SAAA,GAAY,aAAa,YAAe,GAAA,WAAA,CAAA;AAC9C,EAAI,IAAA,iBAAA,CAAA;AACJ,EAAI,IAAA,mBAAA,CAAA;AAMJ,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,WAAA,EAAa,CAAK,EAAA,EAAA;AACpC,IAAA,MAAM,OAAO,KAAM,CAAA,CAAA,CAAA,CAAA;AACnB,IAAA,IACEA,uBAAe,mBAAmB,CAAA,IAClC,mBAAoB,CAAA,UAAA,CAAW,IAAI,CACnC,EAAA;AAEA,MAAA,SAAA;AAAA,KACF;AACA,IAAA,MAAM,cAAc,CAAM,KAAA,CAAA,CAAA;AAC1B,IAAM,MAAA,UAAA,GAAa,MAAM,WAAc,GAAA,CAAA,CAAA;AACvC,IAAA,IAAI,UAAiC,GAAA,IAAA,CAAA;AAErC,IAAI,IAAAC,mBAAA,CAAY,IAAI,CAAG,EAAA;AAErB,MAAM,MAAA,eAAA,GAAkB,KAAK,kBAAmB,EAAA,CAAA;AAChD,MAAM,MAAA,eAAA,GAAkB,cAAc,WAAc,GAAA,CAAA,CAAA;AACpD,MAAM,MAAA,aAAA,GAAgB,aAAa,SAAY,GAAA,eAAA,CAAA;AAC/C,MAAI,IAAA,eAAA,KAAoB,CAAK,IAAA,aAAA,KAAkB,CAAG,EAAA;AAChD,QAAA,SAAA;AAAA,OACF;AACA,MAAA,MAAM,UAAa,GAAA,IAAA,CAAK,SAAU,CAAA,eAAA,EAAiB,aAAa,CAAA,CAAA;AAChE,MAAA,UAAA,GACE,UAAW,CAAA,MAAA,GAAS,CACnB,KAAA,UAAA,CAAW,MAAW,KAAA,CAAA,IACpB,WAAe,IAAA,CAAC,UACjB,IAAA,aAAA,KAAkB,eAChB,CAAA,GAAA,UAAA,CAAW,KACX,UAAW,CAAA,CAAA,CAAA,CAAA;AAAA,KACnB,MAAA,IAAWC,gCAAkB,CAAA,IAAI,CAAG,EAAA;AAOlC,MAAA,SAAA;AAAA,eACSF,sBAAe,CAAA,IAAI,CAAK,IAAA,IAAA,CAAK,UAAY,EAAA;AAGlD,MAAa,UAAA,GAAA,IAAA,CAAA;AAAA,KACf;AAEA,IAAA,IAAI,eAAe,IAAM,EAAA;AAGvB,MAAA,IAAI,UAAc,IAAA,UAAA,CAAW,EAAG,CAAA,iBAAiB,CAAG,EAAA;AAGlD,QAAA,SAAA;AAAA,OACF;AACA,MAAM,MAAA,UAAA,GAAa,WAAW,SAAU,EAAA,CAAA;AACxC,MAAA,IAAI,eAAe,IAAQ,IAAA,CAAC,UAAW,CAAA,EAAA,CAAG,iBAAiB,CAAG,EAAA;AAG5D,QAAsB,mBAAA,GAAA,KAAA,CAAA,CAAA;AAAA,OACxB;AAEA,MAAoB,iBAAA,GAAA,UAAA,CAAA;AAEpB,MAAA,IAAI,wBAAwB,KAAW,CAAA,EAAA;AAErC,QAAA,MAAM,iBAAiB,UAAc,IAAAG,oCAAA,CAAA;AACrC,QAAsB,mBAAA,GAAA,cAAA,CAAe,CAAC,EAAE,CAAC,CAAA,CAAA;AACzC,QAAA,UAAA,CAAW,aAAa,mBAAmB,CAAA,CAAA;AAAA,OAC7C;AAGA,MAAA,mBAAA,CAAoB,OAAO,UAAU,CAAA,CAAA;AAAA,KAChC,MAAA;AAGL,MAAoB,iBAAA,GAAA,KAAA,CAAA,CAAA;AACpB,MAAsB,mBAAA,GAAA,KAAA,CAAA,CAAA;AAAA,KACxB;AAAA,GACF;AAEA,EAAI,IAAAH,sBAAA,CAAe,mBAAmB,CAAG,EAAA;AAEvC,IAAA,UAAA,GACI,mBAAoB,CAAA,WAAA,EACpB,GAAA,mBAAA,CAAoB,SAAU,EAAA,CAAA;AAAA,GACpC;AACF;;;;"}

package/dist/comments/wrap-selection-in-thread-mark-node.mjs

@@ -0,0 +1,61 @@
+import { $isElementNode, $isTextNode } from 'lexical';
+import { $isThreadMarkNode, $createThreadMarkNode } from './thread-mark-node.mjs';
+
+function $wrapSelectionInThreadMarkNode(selection, isBackward, id, createNode) {
+  const nodes = selection.getNodes();
+  const anchorOffset = selection.anchor.offset;
+  const focusOffset = selection.focus.offset;
+  const nodesLength = nodes.length;
+  const startOffset = isBackward ? focusOffset : anchorOffset;
+  const endOffset = isBackward ? anchorOffset : focusOffset;
+  let currentNodeParent;
+  let lastCreatedMarkNode;
+  for (let i = 0; i < nodesLength; i++) {
+    const node = nodes[i];
+    if ($isElementNode(lastCreatedMarkNode) && lastCreatedMarkNode.isParentOf(node)) {
+      continue;
+    }
+    const isFirstNode = i === 0;
+    const isLastNode = i === nodesLength - 1;
+    let targetNode = null;
+    if ($isTextNode(node)) {
+      const textContentSize = node.getTextContentSize();
+      const startTextOffset = isFirstNode ? startOffset : 0;
+      const endTextOffset = isLastNode ? endOffset : textContentSize;
+      if (startTextOffset === 0 && endTextOffset === 0) {
+        continue;
+      }
+      const splitNodes = node.splitText(startTextOffset, endTextOffset);
+      targetNode = splitNodes.length > 1 && (splitNodes.length === 3 || isFirstNode && !isLastNode || endTextOffset === textContentSize) ? splitNodes[1] : splitNodes[0];
+    } else if ($isThreadMarkNode(node)) {
+      continue;
+    } else if ($isElementNode(node) && node.isInline()) {
+      targetNode = node;
+    }
+    if (targetNode !== null) {
+      if (targetNode && targetNode.is(currentNodeParent)) {
+        continue;
+      }
+      const parentNode = targetNode.getParent();
+      if (parentNode === null || !parentNode.is(currentNodeParent)) {
+        lastCreatedMarkNode = void 0;
+      }
+      currentNodeParent = parentNode;
+      if (lastCreatedMarkNode === void 0) {
+        const createMarkNode = createNode || $createThreadMarkNode;
+        lastCreatedMarkNode = createMarkNode([id]);
+        targetNode.insertBefore(lastCreatedMarkNode);
+      }
+      lastCreatedMarkNode.append(targetNode);
+    } else {
+      currentNodeParent = void 0;
+      lastCreatedMarkNode = void 0;
+    }
+  }
+  if ($isElementNode(lastCreatedMarkNode)) {
+    isBackward ? lastCreatedMarkNode.selectStart() : lastCreatedMarkNode.selectEnd();
+  }
+}
+
+export { $wrapSelectionInThreadMarkNode as default };
+//# sourceMappingURL=wrap-selection-in-thread-mark-node.mjs.map

package/dist/comments/wrap-selection-in-thread-mark-node.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"wrap-selection-in-thread-mark-node.mjs","sources":["../../src/comments/wrap-selection-in-thread-mark-node.ts"],"sourcesContent":["/**\n * MIT License\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport type { LexicalNode, RangeSelection } from \"lexical\";\nimport { $isElementNode, $isTextNode } from \"lexical\";\n\nimport type { ThreadMarkNode } from \"./thread-mark-node\";\nimport { $createThreadMarkNode, $isThreadMarkNode } from \"./thread-mark-node\";\n\nexport default function $wrapSelectionInThreadMarkNode(\n  selection: RangeSelection,\n  isBackward: boolean,\n  id: string,\n  createNode?: (ids: Array<string>) => ThreadMarkNode\n): void {\n  const nodes = selection.getNodes();\n  const anchorOffset = selection.anchor.offset;\n  const focusOffset = selection.focus.offset;\n  const nodesLength = nodes.length;\n  const startOffset = isBackward ? focusOffset : anchorOffset;\n  const endOffset = isBackward ? anchorOffset : focusOffset;\n  let currentNodeParent;\n  let lastCreatedMarkNode;\n\n  // We only want wrap adjacent text nodes, line break nodes\n  // and inline element nodes. For decorator nodes and block\n  // element nodes, we step out of their boundary and start\n  // again after, if there are more nodes.\n  for (let i = 0; i < nodesLength; i++) {\n    const node = nodes[i];\n    if (\n      $isElementNode(lastCreatedMarkNode) &&\n      lastCreatedMarkNode.isParentOf(node)\n    ) {\n      // If the current node is a child of the last created mark node, there is nothing to do here\n      continue;\n    }\n    const isFirstNode = i === 0;\n    const isLastNode = i === nodesLength - 1;\n    let targetNode: LexicalNode | null = null;\n\n    if ($isTextNode(node)) {\n      // Case 1: The node is a text node and we can split it\n      const textContentSize = node.getTextContentSize();\n      const startTextOffset = isFirstNode ? startOffset : 0;\n      const endTextOffset = isLastNode ? endOffset : textContentSize;\n      if (startTextOffset === 0 && endTextOffset === 0) {\n        continue;\n      }\n      const splitNodes = node.splitText(startTextOffset, endTextOffset);\n      targetNode =\n        splitNodes.length > 1 &&\n        (splitNodes.length === 3 ||\n          (isFirstNode && !isLastNode) ||\n          endTextOffset === textContentSize)\n          ? splitNodes[1]\n          : splitNodes[0];\n    } else if ($isThreadMarkNode(node)) {\n      // Case 2: the node is a mark node and we can ignore it as a target,\n      // moving on to its children. Note that when we make a mark inside\n      // another mark, it may utlimately be unnested by a call to\n      // `registerNestedElementResolver<MarkNode>` somewhere else in the\n      // codebase.\n\n      continue;\n    } else if ($isElementNode(node) && node.isInline()) {\n      // Case 3: inline element nodes can be added in their entirety to the new\n      // mark\n      targetNode = node;\n    }\n\n    if (targetNode !== null) {\n      // Now that we have a target node for wrapping with a mark, we can run\n      // through special cases.\n      if (targetNode && targetNode.is(currentNodeParent)) {\n        // The current node is a child of the target node to be wrapped, there\n        // is nothing to do here.\n        continue;\n      }\n      const parentNode = targetNode.getParent();\n      if (parentNode === null || !parentNode.is(currentNodeParent)) {\n        // If the parent node is not the current node's parent node, we can\n        // clear the last created mark node.\n        lastCreatedMarkNode = undefined;\n      }\n\n      currentNodeParent = parentNode;\n\n      if (lastCreatedMarkNode === undefined) {\n        // If we don't have a created mark node, we can make one\n        const createMarkNode = createNode || $createThreadMarkNode;\n        lastCreatedMarkNode = createMarkNode([id]);\n        targetNode.insertBefore(lastCreatedMarkNode);\n      }\n\n      // Add the target node to be wrapped in the latest created mark node\n      lastCreatedMarkNode.append(targetNode);\n    } else {\n      // If we don't have a target node to wrap we can clear our state and\n      // continue on with the next node\n      currentNodeParent = undefined;\n      lastCreatedMarkNode = undefined;\n    }\n  }\n  // Make selection collapsed at the end\n  if ($isElementNode(lastCreatedMarkNode)) {\n    // eslint-disable-next-line no-unused-expressions\n    isBackward\n      ? lastCreatedMarkNode.selectStart()\n      : lastCreatedMarkNode.selectEnd();\n  }\n}\n"],"names":[],"mappings":";;;AA6BA,SAAwB,8BACtB,CAAA,SAAA,EACA,UACA,EAAA,EAAA,EACA,UACM,EAAA;AACN,EAAM,MAAA,KAAA,GAAQ,UAAU,QAAS,EAAA,CAAA;AACjC,EAAM,MAAA,YAAA,GAAe,UAAU,MAAO,CAAA,MAAA,CAAA;AACtC,EAAM,MAAA,WAAA,GAAc,UAAU,KAAM,CAAA,MAAA,CAAA;AACpC,EAAA,MAAM,cAAc,KAAM,CAAA,MAAA,CAAA;AAC1B,EAAM,MAAA,WAAA,GAAc,aAAa,WAAc,GAAA,YAAA,CAAA;AAC/C,EAAM,MAAA,SAAA,GAAY,aAAa,YAAe,GAAA,WAAA,CAAA;AAC9C,EAAI,IAAA,iBAAA,CAAA;AACJ,EAAI,IAAA,mBAAA,CAAA;AAMJ,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,WAAA,EAAa,CAAK,EAAA,EAAA;AACpC,IAAA,MAAM,OAAO,KAAM,CAAA,CAAA,CAAA,CAAA;AACnB,IAAA,IACE,eAAe,mBAAmB,CAAA,IAClC,mBAAoB,CAAA,UAAA,CAAW,IAAI,CACnC,EAAA;AAEA,MAAA,SAAA;AAAA,KACF;AACA,IAAA,MAAM,cAAc,CAAM,KAAA,CAAA,CAAA;AAC1B,IAAM,MAAA,UAAA,GAAa,MAAM,WAAc,GAAA,CAAA,CAAA;AACvC,IAAA,IAAI,UAAiC,GAAA,IAAA,CAAA;AAErC,IAAI,IAAA,WAAA,CAAY,IAAI,CAAG,EAAA;AAErB,MAAM,MAAA,eAAA,GAAkB,KAAK,kBAAmB,EAAA,CAAA;AAChD,MAAM,MAAA,eAAA,GAAkB,cAAc,WAAc,GAAA,CAAA,CAAA;AACpD,MAAM,MAAA,aAAA,GAAgB,aAAa,SAAY,GAAA,eAAA,CAAA;AAC/C,MAAI,IAAA,eAAA,KAAoB,CAAK,IAAA,aAAA,KAAkB,CAAG,EAAA;AAChD,QAAA,SAAA;AAAA,OACF;AACA,MAAA,MAAM,UAAa,GAAA,IAAA,CAAK,SAAU,CAAA,eAAA,EAAiB,aAAa,CAAA,CAAA;AAChE,MAAA,UAAA,GACE,UAAW,CAAA,MAAA,GAAS,CACnB,KAAA,UAAA,CAAW,MAAW,KAAA,CAAA,IACpB,WAAe,IAAA,CAAC,UACjB,IAAA,aAAA,KAAkB,eAChB,CAAA,GAAA,UAAA,CAAW,KACX,UAAW,CAAA,CAAA,CAAA,CAAA;AAAA,KACnB,MAAA,IAAW,iBAAkB,CAAA,IAAI,CAAG,EAAA;AAOlC,MAAA,SAAA;AAAA,eACS,cAAe,CAAA,IAAI,CAAK,IAAA,IAAA,CAAK,UAAY,EAAA;AAGlD,MAAa,UAAA,GAAA,IAAA,CAAA;AAAA,KACf;AAEA,IAAA,IAAI,eAAe,IAAM,EAAA;AAGvB,MAAA,IAAI,UAAc,IAAA,UAAA,CAAW,EAAG,CAAA,iBAAiB,CAAG,EAAA;AAGlD,QAAA,SAAA;AAAA,OACF;AACA,MAAM,MAAA,UAAA,GAAa,WAAW,SAAU,EAAA,CAAA;AACxC,MAAA,IAAI,eAAe,IAAQ,IAAA,CAAC,UAAW,CAAA,EAAA,CAAG,iBAAiB,CAAG,EAAA;AAG5D,QAAsB,mBAAA,GAAA,KAAA,CAAA,CAAA;AAAA,OACxB;AAEA,MAAoB,iBAAA,GAAA,UAAA,CAAA;AAEpB,MAAA,IAAI,wBAAwB,KAAW,CAAA,EAAA;AAErC,QAAA,MAAM,iBAAiB,UAAc,IAAA,qBAAA,CAAA;AACrC,QAAsB,mBAAA,GAAA,cAAA,CAAe,CAAC,EAAE,CAAC,CAAA,CAAA;AACzC,QAAA,UAAA,CAAW,aAAa,mBAAmB,CAAA,CAAA;AAAA,OAC7C;AAGA,MAAA,mBAAA,CAAoB,OAAO,UAAU,CAAA,CAAA;AAAA,KAChC,MAAA;AAGL,MAAoB,iBAAA,GAAA,KAAA,CAAA,CAAA;AACpB,MAAsB,mBAAA,GAAA,KAAA,CAAA,CAAA;AAAA,KACxB;AAAA,GACF;AAEA,EAAI,IAAA,cAAA,CAAe,mBAAmB,CAAG,EAAA;AAEvC,IAAA,UAAA,GACI,mBAAoB,CAAA,WAAA,EACpB,GAAA,mBAAA,CAAoB,SAAU,EAAA,CAAA;AAAA,GACpC;AACF;;;;"}