@ekz/lexical-text 0.40.0

package/EkzLexicalText.dev.js

@@ -0,0 +1,345 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+'use strict';
+
+var lexical = require('@ekz/lexical');
+
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+/**
+ * Returns the root's text content.
+ * @returns The root's text content.
+ */
+function $rootTextContent() {
+  const root = lexical.$getRoot();
+  return root.getTextContent();
+}
+
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+/**
+ * Determines if the root has any text content and can trim any whitespace if it does.
+ * @param isEditorComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @param trim - Should the root text have its whitespaced trimmed? Defaults to true.
+ * @returns true if text content is empty, false if there is text or isEditorComposing is true.
+ */
+function $isRootTextContentEmpty(isEditorComposing, trim = true) {
+  if (isEditorComposing) {
+    return false;
+  }
+  let text = $rootTextContent();
+  if (trim) {
+    text = text.trim();
+  }
+  return text === '';
+}
+
+/**
+ * Returns a function that executes {@link $isRootTextContentEmpty}
+ * @param isEditorComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @param trim - Should the root text have its whitespaced trimmed? Defaults to true.
+ * @returns A function that executes $isRootTextContentEmpty based on arguments.
+ */
+function $isRootTextContentEmptyCurry(isEditorComposing, trim) {
+  return () => $isRootTextContentEmpty(isEditorComposing, trim);
+}
+
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+/**
+ * Determines if the input should show the placeholder. If anything is in
+ * in the root the placeholder should not be shown.
+ * @param isComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @returns true if the input should show the placeholder, false otherwise.
+ */
+function $canShowPlaceholder(isComposing) {
+  if (!$isRootTextContentEmpty(isComposing, false)) {
+    return false;
+  }
+  const root = lexical.$getRoot();
+  const children = root.getChildren();
+  const childrenLength = children.length;
+  if (childrenLength > 1) {
+    return false;
+  }
+  for (let i = 0; i < childrenLength; i++) {
+    const topBlock = children[i];
+    if (lexical.$isDecoratorNode(topBlock)) {
+      return false;
+    }
+    if (lexical.$isElementNode(topBlock)) {
+      if (!lexical.$isParagraphNode(topBlock)) {
+        return false;
+      }
+      if (topBlock.__indent !== 0) {
+        return false;
+      }
+      const topBlockChildren = topBlock.getChildren();
+      const topBlockChildrenLength = topBlockChildren.length;
+      for (let s = 0; s < topBlockChildrenLength; s++) {
+        const child = topBlockChildren[i];
+        if (!lexical.$isTextNode(child)) {
+          return false;
+        }
+      }
+    }
+  }
+  return true;
+}
+
+/**
+ * Returns a function that executes {@link $canShowPlaceholder}
+ * @param isEditorComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @returns A function that executes $canShowPlaceholder with arguments.
+ */
+function $canShowPlaceholderCurry(isEditorComposing) {
+  return () => $canShowPlaceholder(isEditorComposing);
+}
+
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+/**
+ * Finds a TextNode with a size larger than targetCharacters and returns
+ * the node along with the remaining length of the text.
+ * @param root - The RootNode.
+ * @param targetCharacters - The number of characters whose TextNode must be larger than.
+ * @returns The TextNode and the intersections offset, or null if no TextNode is found.
+ */
+function $findTextIntersectionFromCharacters(root, targetCharacters) {
+  let node = root.getFirstChild();
+  let currentCharacters = 0;
+  mainLoop: while (node !== null) {
+    if (lexical.$isElementNode(node)) {
+      const child = node.getFirstChild();
+      if (child !== null) {
+        node = child;
+        continue;
+      }
+    } else if (lexical.$isTextNode(node)) {
+      const characters = node.getTextContentSize();
+      if (currentCharacters + characters > targetCharacters) {
+        return {
+          node,
+          offset: targetCharacters - currentCharacters
+        };
+      }
+      currentCharacters += characters;
+    }
+    const sibling = node.getNextSibling();
+    if (sibling !== null) {
+      node = sibling;
+      continue;
+    }
+    let parent = node.getParent();
+    while (parent !== null) {
+      const parentSibling = parent.getNextSibling();
+      if (parentSibling !== null) {
+        node = parentSibling;
+        continue mainLoop;
+      }
+      parent = parent.getParent();
+    }
+    break;
+  }
+  return null;
+}
+
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+// Do not require this module directly! Use normal `invariant` calls.
+
+function formatDevErrorMessage(message) {
+  throw new Error(message);
+}
+
+/**
+ * Returns a tuple that can be rested (...) into mergeRegister to clean up
+ * node transforms listeners that transforms text into another node, eg. a HashtagNode.
+ * @example
+ * ```ts
+ *   useEffect(() => {
+    return mergeRegister(
+      ...registerLexicalTextEntity(editor, getMatch, targetNode, createNode),
+    );
+  }, [createNode, editor, getMatch, targetNode]);
+ * ```
+ * Where targetNode is the type of node containing the text you want to transform (like a text input),
+ * then getMatch uses a regex to find a matching text and creates the proper node to include the matching text.
+ * @param editor - The lexical editor.
+ * @param getMatch - Finds a matching string that satisfies a regex expression.
+ * @param targetNode - The node type that contains text to match with. eg. HashtagNode
+ * @param createNode - A function that creates a new node to contain the matched text. eg createHashtagNode
+ * @returns An array containing the plain text and reverse node transform listeners.
+ */
+function registerLexicalTextEntity(editor, getMatch, targetNode, createNode) {
+  const isTargetNode = node => {
+    return node instanceof targetNode;
+  };
+  const $replaceWithSimpleText = node => {
+    const textNode = lexical.$createTextNode(node.getTextContent());
+    textNode.setFormat(node.getFormat());
+    node.replace(textNode);
+  };
+  const getMode = node => {
+    return node.getLatest().__mode;
+  };
+  const $textNodeTransform = node => {
+    if (!node.isSimpleText()) {
+      return;
+    }
+    let prevSibling = node.getPreviousSibling();
+    let text = node.getTextContent();
+    let currentNode = node;
+    let match;
+    if (lexical.$isTextNode(prevSibling)) {
+      const previousText = prevSibling.getTextContent();
+      const combinedText = previousText + text;
+      const prevMatch = getMatch(combinedText);
+      if (isTargetNode(prevSibling)) {
+        if (prevMatch === null || getMode(prevSibling) !== 0) {
+          $replaceWithSimpleText(prevSibling);
+          return;
+        } else {
+          const diff = prevMatch.end - previousText.length;
+          if (diff > 0) {
+            const concatText = text.slice(0, diff);
+            const newTextContent = previousText + concatText;
+            prevSibling.select();
+            prevSibling.setTextContent(newTextContent);
+            if (diff === text.length) {
+              node.remove();
+            } else {
+              const remainingText = text.slice(diff);
+              node.setTextContent(remainingText);
+            }
+            return;
+          }
+        }
+      } else if (prevMatch === null || prevMatch.start < previousText.length) {
+        return;
+      }
+    }
+    let prevMatchLengthToSkip = 0;
+    // eslint-disable-next-line no-constant-condition
+    while (true) {
+      match = getMatch(text);
+      let nextText = match === null ? '' : text.slice(match.end);
+      text = nextText;
+      if (nextText === '') {
+        const nextSibling = currentNode.getNextSibling();
+        if (lexical.$isTextNode(nextSibling)) {
+          nextText = currentNode.getTextContent() + nextSibling.getTextContent();
+          const nextMatch = getMatch(nextText);
+          if (nextMatch === null) {
+            if (isTargetNode(nextSibling)) {
+              $replaceWithSimpleText(nextSibling);
+            } else {
+              nextSibling.markDirty();
+            }
+            return;
+          } else if (nextMatch.start !== 0) {
+            return;
+          }
+        }
+      }
+      if (match === null) {
+        return;
+      }
+      if (match.start === 0 && lexical.$isTextNode(prevSibling) && prevSibling.isTextEntity()) {
+        prevMatchLengthToSkip += match.end;
+        continue;
+      }
+      let nodeToReplace;
+      if (match.start === 0) {
+        [nodeToReplace, currentNode] = currentNode.splitText(match.end);
+      } else {
+        [, nodeToReplace, currentNode] = currentNode.splitText(match.start + prevMatchLengthToSkip, match.end + prevMatchLengthToSkip);
+      }
+      if (!(nodeToReplace !== undefined)) {
+        formatDevErrorMessage(`${'nodeToReplace'} should not be undefined. You may want to check splitOffsets passed to the splitText.`);
+      }
+      const replacementNode = createNode(nodeToReplace);
+      replacementNode.setFormat(nodeToReplace.getFormat());
+      nodeToReplace.replace(replacementNode);
+      if (currentNode == null) {
+        return;
+      }
+      prevMatchLengthToSkip = 0;
+      prevSibling = replacementNode;
+    }
+  };
+  const $reverseNodeTransform = node => {
+    const text = node.getTextContent();
+    const match = getMatch(text);
+    if (match === null || match.start !== 0) {
+      $replaceWithSimpleText(node);
+      return;
+    }
+    if (text.length > match.end) {
+      // This will split out the rest of the text as simple text
+      node.splitText(match.end);
+      return;
+    }
+    const prevSibling = node.getPreviousSibling();
+    if (lexical.$isTextNode(prevSibling) && prevSibling.isTextEntity()) {
+      $replaceWithSimpleText(prevSibling);
+      $replaceWithSimpleText(node);
+    }
+    const nextSibling = node.getNextSibling();
+    if (lexical.$isTextNode(nextSibling) && nextSibling.isTextEntity()) {
+      $replaceWithSimpleText(nextSibling);
+
+      // This may have already been converted in the previous block
+      if (isTargetNode(node)) {
+        $replaceWithSimpleText(node);
+      }
+    }
+  };
+  const removePlainTextTransform = editor.registerNodeTransform(lexical.TextNode, $textNodeTransform);
+  const removeReverseNodeTransform = editor.registerNodeTransform(targetNode, $reverseNodeTransform);
+  return [removePlainTextTransform, removeReverseNodeTransform];
+}
+
+exports.$canShowPlaceholder = $canShowPlaceholder;
+exports.$canShowPlaceholderCurry = $canShowPlaceholderCurry;
+exports.$findTextIntersectionFromCharacters = $findTextIntersectionFromCharacters;
+exports.$isRootTextContentEmpty = $isRootTextContentEmpty;
+exports.$isRootTextContentEmptyCurry = $isRootTextContentEmptyCurry;
+exports.$rootTextContent = $rootTextContent;
+exports.registerLexicalTextEntity = registerLexicalTextEntity;

package/EkzLexicalText.dev.mjs

@@ -0,0 +1,337 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+import { $getRoot, $isDecoratorNode, $isElementNode, $isParagraphNode, $isTextNode, TextNode, $createTextNode } from '@ekz/lexical';
+
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+/**
+ * Returns the root's text content.
+ * @returns The root's text content.
+ */
+function $rootTextContent() {
+  const root = $getRoot();
+  return root.getTextContent();
+}
+
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+/**
+ * Determines if the root has any text content and can trim any whitespace if it does.
+ * @param isEditorComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @param trim - Should the root text have its whitespaced trimmed? Defaults to true.
+ * @returns true if text content is empty, false if there is text or isEditorComposing is true.
+ */
+function $isRootTextContentEmpty(isEditorComposing, trim = true) {
+  if (isEditorComposing) {
+    return false;
+  }
+  let text = $rootTextContent();
+  if (trim) {
+    text = text.trim();
+  }
+  return text === '';
+}
+
+/**
+ * Returns a function that executes {@link $isRootTextContentEmpty}
+ * @param isEditorComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @param trim - Should the root text have its whitespaced trimmed? Defaults to true.
+ * @returns A function that executes $isRootTextContentEmpty based on arguments.
+ */
+function $isRootTextContentEmptyCurry(isEditorComposing, trim) {
+  return () => $isRootTextContentEmpty(isEditorComposing, trim);
+}
+
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+/**
+ * Determines if the input should show the placeholder. If anything is in
+ * in the root the placeholder should not be shown.
+ * @param isComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @returns true if the input should show the placeholder, false otherwise.
+ */
+function $canShowPlaceholder(isComposing) {
+  if (!$isRootTextContentEmpty(isComposing, false)) {
+    return false;
+  }
+  const root = $getRoot();
+  const children = root.getChildren();
+  const childrenLength = children.length;
+  if (childrenLength > 1) {
+    return false;
+  }
+  for (let i = 0; i < childrenLength; i++) {
+    const topBlock = children[i];
+    if ($isDecoratorNode(topBlock)) {
+      return false;
+    }
+    if ($isElementNode(topBlock)) {
+      if (!$isParagraphNode(topBlock)) {
+        return false;
+      }
+      if (topBlock.__indent !== 0) {
+        return false;
+      }
+      const topBlockChildren = topBlock.getChildren();
+      const topBlockChildrenLength = topBlockChildren.length;
+      for (let s = 0; s < topBlockChildrenLength; s++) {
+        const child = topBlockChildren[i];
+        if (!$isTextNode(child)) {
+          return false;
+        }
+      }
+    }
+  }
+  return true;
+}
+
+/**
+ * Returns a function that executes {@link $canShowPlaceholder}
+ * @param isEditorComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @returns A function that executes $canShowPlaceholder with arguments.
+ */
+function $canShowPlaceholderCurry(isEditorComposing) {
+  return () => $canShowPlaceholder(isEditorComposing);
+}
+
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+/**
+ * Finds a TextNode with a size larger than targetCharacters and returns
+ * the node along with the remaining length of the text.
+ * @param root - The RootNode.
+ * @param targetCharacters - The number of characters whose TextNode must be larger than.
+ * @returns The TextNode and the intersections offset, or null if no TextNode is found.
+ */
+function $findTextIntersectionFromCharacters(root, targetCharacters) {
+  let node = root.getFirstChild();
+  let currentCharacters = 0;
+  mainLoop: while (node !== null) {
+    if ($isElementNode(node)) {
+      const child = node.getFirstChild();
+      if (child !== null) {
+        node = child;
+        continue;
+      }
+    } else if ($isTextNode(node)) {
+      const characters = node.getTextContentSize();
+      if (currentCharacters + characters > targetCharacters) {
+        return {
+          node,
+          offset: targetCharacters - currentCharacters
+        };
+      }
+      currentCharacters += characters;
+    }
+    const sibling = node.getNextSibling();
+    if (sibling !== null) {
+      node = sibling;
+      continue;
+    }
+    let parent = node.getParent();
+    while (parent !== null) {
+      const parentSibling = parent.getNextSibling();
+      if (parentSibling !== null) {
+        node = parentSibling;
+        continue mainLoop;
+      }
+      parent = parent.getParent();
+    }
+    break;
+  }
+  return null;
+}
+
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+// Do not require this module directly! Use normal `invariant` calls.
+
+function formatDevErrorMessage(message) {
+  throw new Error(message);
+}
+
+/**
+ * Returns a tuple that can be rested (...) into mergeRegister to clean up
+ * node transforms listeners that transforms text into another node, eg. a HashtagNode.
+ * @example
+ * ```ts
+ *   useEffect(() => {
+    return mergeRegister(
+      ...registerLexicalTextEntity(editor, getMatch, targetNode, createNode),
+    );
+  }, [createNode, editor, getMatch, targetNode]);
+ * ```
+ * Where targetNode is the type of node containing the text you want to transform (like a text input),
+ * then getMatch uses a regex to find a matching text and creates the proper node to include the matching text.
+ * @param editor - The lexical editor.
+ * @param getMatch - Finds a matching string that satisfies a regex expression.
+ * @param targetNode - The node type that contains text to match with. eg. HashtagNode
+ * @param createNode - A function that creates a new node to contain the matched text. eg createHashtagNode
+ * @returns An array containing the plain text and reverse node transform listeners.
+ */
+function registerLexicalTextEntity(editor, getMatch, targetNode, createNode) {
+  const isTargetNode = node => {
+    return node instanceof targetNode;
+  };
+  const $replaceWithSimpleText = node => {
+    const textNode = $createTextNode(node.getTextContent());
+    textNode.setFormat(node.getFormat());
+    node.replace(textNode);
+  };
+  const getMode = node => {
+    return node.getLatest().__mode;
+  };
+  const $textNodeTransform = node => {
+    if (!node.isSimpleText()) {
+      return;
+    }
+    let prevSibling = node.getPreviousSibling();
+    let text = node.getTextContent();
+    let currentNode = node;
+    let match;
+    if ($isTextNode(prevSibling)) {
+      const previousText = prevSibling.getTextContent();
+      const combinedText = previousText + text;
+      const prevMatch = getMatch(combinedText);
+      if (isTargetNode(prevSibling)) {
+        if (prevMatch === null || getMode(prevSibling) !== 0) {
+          $replaceWithSimpleText(prevSibling);
+          return;
+        } else {
+          const diff = prevMatch.end - previousText.length;
+          if (diff > 0) {
+            const concatText = text.slice(0, diff);
+            const newTextContent = previousText + concatText;
+            prevSibling.select();
+            prevSibling.setTextContent(newTextContent);
+            if (diff === text.length) {
+              node.remove();
+            } else {
+              const remainingText = text.slice(diff);
+              node.setTextContent(remainingText);
+            }
+            return;
+          }
+        }
+      } else if (prevMatch === null || prevMatch.start < previousText.length) {
+        return;
+      }
+    }
+    let prevMatchLengthToSkip = 0;
+    // eslint-disable-next-line no-constant-condition
+    while (true) {
+      match = getMatch(text);
+      let nextText = match === null ? '' : text.slice(match.end);
+      text = nextText;
+      if (nextText === '') {
+        const nextSibling = currentNode.getNextSibling();
+        if ($isTextNode(nextSibling)) {
+          nextText = currentNode.getTextContent() + nextSibling.getTextContent();
+          const nextMatch = getMatch(nextText);
+          if (nextMatch === null) {
+            if (isTargetNode(nextSibling)) {
+              $replaceWithSimpleText(nextSibling);
+            } else {
+              nextSibling.markDirty();
+            }
+            return;
+          } else if (nextMatch.start !== 0) {
+            return;
+          }
+        }
+      }
+      if (match === null) {
+        return;
+      }
+      if (match.start === 0 && $isTextNode(prevSibling) && prevSibling.isTextEntity()) {
+        prevMatchLengthToSkip += match.end;
+        continue;
+      }
+      let nodeToReplace;
+      if (match.start === 0) {
+        [nodeToReplace, currentNode] = currentNode.splitText(match.end);
+      } else {
+        [, nodeToReplace, currentNode] = currentNode.splitText(match.start + prevMatchLengthToSkip, match.end + prevMatchLengthToSkip);
+      }
+      if (!(nodeToReplace !== undefined)) {
+        formatDevErrorMessage(`${'nodeToReplace'} should not be undefined. You may want to check splitOffsets passed to the splitText.`);
+      }
+      const replacementNode = createNode(nodeToReplace);
+      replacementNode.setFormat(nodeToReplace.getFormat());
+      nodeToReplace.replace(replacementNode);
+      if (currentNode == null) {
+        return;
+      }
+      prevMatchLengthToSkip = 0;
+      prevSibling = replacementNode;
+    }
+  };
+  const $reverseNodeTransform = node => {
+    const text = node.getTextContent();
+    const match = getMatch(text);
+    if (match === null || match.start !== 0) {
+      $replaceWithSimpleText(node);
+      return;
+    }
+    if (text.length > match.end) {
+      // This will split out the rest of the text as simple text
+      node.splitText(match.end);
+      return;
+    }
+    const prevSibling = node.getPreviousSibling();
+    if ($isTextNode(prevSibling) && prevSibling.isTextEntity()) {
+      $replaceWithSimpleText(prevSibling);
+      $replaceWithSimpleText(node);
+    }
+    const nextSibling = node.getNextSibling();
+    if ($isTextNode(nextSibling) && nextSibling.isTextEntity()) {
+      $replaceWithSimpleText(nextSibling);
+
+      // This may have already been converted in the previous block
+      if (isTargetNode(node)) {
+        $replaceWithSimpleText(node);
+      }
+    }
+  };
+  const removePlainTextTransform = editor.registerNodeTransform(TextNode, $textNodeTransform);
+  const removeReverseNodeTransform = editor.registerNodeTransform(targetNode, $reverseNodeTransform);
+  return [removePlainTextTransform, removeReverseNodeTransform];
+}
+
+export { $canShowPlaceholder, $canShowPlaceholderCurry, $findTextIntersectionFromCharacters, $isRootTextContentEmpty, $isRootTextContentEmptyCurry, $rootTextContent, registerLexicalTextEntity };

package/EkzLexicalText.js

@@ -0,0 +1,11 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+'use strict'
+const EkzLexicalText = process.env.NODE_ENV !== 'production' ? require('./EkzLexicalText.dev.js') : require('./EkzLexicalText.prod.js');
+module.exports = EkzLexicalText;

package/EkzLexicalText.mjs

@@ -0,0 +1,18 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+import * as modDev from './EkzLexicalText.dev.mjs';
+import * as modProd from './EkzLexicalText.prod.mjs';
+const mod = process.env.NODE_ENV !== 'production' ? modDev : modProd;
+export const $canShowPlaceholder = mod.$canShowPlaceholder;
+export const $canShowPlaceholderCurry = mod.$canShowPlaceholderCurry;
+export const $findTextIntersectionFromCharacters = mod.$findTextIntersectionFromCharacters;
+export const $isRootTextContentEmpty = mod.$isRootTextContentEmpty;
+export const $isRootTextContentEmptyCurry = mod.$isRootTextContentEmptyCurry;
+export const $rootTextContent = mod.$rootTextContent;
+export const registerLexicalTextEntity = mod.registerLexicalTextEntity;

package/EkzLexicalText.node.mjs

@@ -0,0 +1,16 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+const mod = await (process.env.NODE_ENV !== 'production' ? import('./EkzLexicalText.dev.mjs') : import('./EkzLexicalText.prod.mjs'));
+export const $canShowPlaceholder = mod.$canShowPlaceholder;
+export const $canShowPlaceholderCurry = mod.$canShowPlaceholderCurry;
+export const $findTextIntersectionFromCharacters = mod.$findTextIntersectionFromCharacters;
+export const $isRootTextContentEmpty = mod.$isRootTextContentEmpty;
+export const $isRootTextContentEmptyCurry = mod.$isRootTextContentEmptyCurry;
+export const $rootTextContent = mod.$rootTextContent;
+export const registerLexicalTextEntity = mod.registerLexicalTextEntity;

package/EkzLexicalText.prod.js

@@ -0,0 +1,9 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+"use strict";var t=require("@ekz/lexical");function e(){return t.$getRoot().getTextContent()}function n(t,n=!0){if(t)return!1;let r=e();return n&&(r=r.trim()),""===r}function r(e){if(!n(e,!1))return!1;const r=t.$getRoot().getChildren(),o=r.length;if(o>1)return!1;for(let e=0;e<o;e++){const n=r[e];if(t.$isDecoratorNode(n))return!1;if(t.$isElementNode(n)){if(!t.$isParagraphNode(n))return!1;if(0!==n.__indent)return!1;const r=n.getChildren(),o=r.length;for(let n=0;n<o;n++){const n=r[e];if(!t.$isTextNode(n))return!1}}}return!0}function o(t,...e){const n=new URL("https://lexical.dev/docs/error"),r=new URLSearchParams;r.append("code",t);for(const t of e)r.append("v",t);throw n.search=r.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.`)}exports.$canShowPlaceholder=r,exports.$canShowPlaceholderCurry=function(t){return()=>r(t)},exports.$findTextIntersectionFromCharacters=function(e,n){let r=e.getFirstChild(),o=0;t:for(;null!==r;){if(t.$isElementNode(r)){const t=r.getFirstChild();if(null!==t){r=t;continue}}else if(t.$isTextNode(r)){const t=r.getTextContentSize();if(o+t>n)return{node:r,offset:n-o};o+=t}const e=r.getNextSibling();if(null!==e){r=e;continue}let i=r.getParent();for(;null!==i;){const t=i.getNextSibling();if(null!==t){r=t;continue t}i=i.getParent()}break}return null},exports.$isRootTextContentEmpty=n,exports.$isRootTextContentEmptyCurry=function(t,e){return()=>n(t,e)},exports.$rootTextContent=e,exports.registerLexicalTextEntity=function(e,n,r,i){const s=t=>t instanceof r,l=e=>{const n=t.$createTextNode(e.getTextContent());n.setFormat(e.getFormat()),e.replace(n)};return[e.registerNodeTransform(t.TextNode,e=>{if(!e.isSimpleText())return;let r,u=e.getPreviousSibling(),c=e.getTextContent(),f=e;if(t.$isTextNode(u)){const t=u.getTextContent(),r=n(t+c);if(s(u)){if(null===r||0!==(t=>t.getLatest().__mode)(u))return void l(u);{const n=r.end-t.length;if(n>0){const r=t+c.slice(0,n);if(u.select(),u.setTextContent(r),n===c.length)e.remove();else{const t=c.slice(n);e.setTextContent(t)}return}}}else if(null===r||r.start<t.length)return}let d=0;for(;;){r=n(c);let e,a=null===r?"":c.slice(r.end);if(c=a,""===a){const e=f.getNextSibling();if(t.$isTextNode(e)){a=f.getTextContent()+e.getTextContent();const t=n(a);if(null===t)return void(s(e)?l(e):e.markDirty());if(0!==t.start)return}}if(null===r)return;if(0===r.start&&t.$isTextNode(u)&&u.isTextEntity()){d+=r.end;continue}0===r.start?[e,f]=f.splitText(r.end):[,e,f]=f.splitText(r.start+d,r.end+d),void 0===e&&o(165,"nodeToReplace");const x=i(e);if(x.setFormat(e.getFormat()),e.replace(x),null==f)return;d=0,u=x}}),e.registerNodeTransform(r,e=>{const r=e.getTextContent(),o=n(r);if(null===o||0!==o.start)return void l(e);if(r.length>o.end)return void e.splitText(o.end);const i=e.getPreviousSibling();t.$isTextNode(i)&&i.isTextEntity()&&(l(i),l(e));const u=e.getNextSibling();t.$isTextNode(u)&&u.isTextEntity()&&(l(u),s(e)&&l(e))})]};

package/EkzLexicalText.prod.mjs

@@ -0,0 +1,9 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+import{$getRoot as t,$isDecoratorNode as e,$isElementNode as n,$isParagraphNode as r,$isTextNode as i,TextNode as o,$createTextNode as l}from"@ekz/lexical";function s(){return t().getTextContent()}function f(t,e=!0){if(t)return!1;let n=s();return e&&(n=n.trim()),""===n}function u(t,e){return()=>f(t,e)}function c(o){if(!f(o,!1))return!1;const l=t().getChildren(),s=l.length;if(s>1)return!1;for(let t=0;t<s;t++){const o=l[t];if(e(o))return!1;if(n(o)){if(!r(o))return!1;if(0!==o.__indent)return!1;const e=o.getChildren(),n=e.length;for(let r=0;r<n;r++){const n=e[t];if(!i(n))return!1}}}return!0}function g(t){return()=>c(t)}function a(t,e){let r=t.getFirstChild(),o=0;t:for(;null!==r;){if(n(r)){const t=r.getFirstChild();if(null!==t){r=t;continue}}else if(i(r)){const t=r.getTextContentSize();if(o+t>e)return{node:r,offset:e-o};o+=t}const t=r.getNextSibling();if(null!==t){r=t;continue}let l=r.getParent();for(;null!==l;){const t=l.getNextSibling();if(null!==t){r=t;continue t}l=l.getParent()}break}return null}function d(t,...e){const n=new URL("https://lexical.dev/docs/error"),r=new URLSearchParams;r.append("code",t);for(const t of e)r.append("v",t);throw n.search=r.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.`)}function x(t,e,n,r){const s=t=>t instanceof n,f=t=>{const e=l(t.getTextContent());e.setFormat(t.getFormat()),t.replace(e)};return[t.registerNodeTransform(o,t=>{if(!t.isSimpleText())return;let n,o=t.getPreviousSibling(),l=t.getTextContent(),u=t;if(i(o)){const n=o.getTextContent(),r=e(n+l);if(s(o)){if(null===r||0!==(t=>t.getLatest().__mode)(o))return void f(o);{const e=r.end-n.length;if(e>0){const r=n+l.slice(0,e);if(o.select(),o.setTextContent(r),e===l.length)t.remove();else{const n=l.slice(e);t.setTextContent(n)}return}}}else if(null===r||r.start<n.length)return}let c=0;for(;;){n=e(l);let t,g=null===n?"":l.slice(n.end);if(l=g,""===g){const t=u.getNextSibling();if(i(t)){g=u.getTextContent()+t.getTextContent();const n=e(g);if(null===n)return void(s(t)?f(t):t.markDirty());if(0!==n.start)return}}if(null===n)return;if(0===n.start&&i(o)&&o.isTextEntity()){c+=n.end;continue}0===n.start?[t,u]=u.splitText(n.end):[,t,u]=u.splitText(n.start+c,n.end+c),void 0===t&&d(165,"nodeToReplace");const a=r(t);if(a.setFormat(t.getFormat()),t.replace(a),null==u)return;c=0,o=a}}),t.registerNodeTransform(n,t=>{const n=t.getTextContent(),r=e(n);if(null===r||0!==r.start)return void f(t);if(n.length>r.end)return void t.splitText(r.end);const o=t.getPreviousSibling();i(o)&&o.isTextEntity()&&(f(o),f(t));const l=t.getNextSibling();i(l)&&l.isTextEntity()&&(f(l),s(t)&&f(t))})]}export{c as $canShowPlaceholder,g as $canShowPlaceholderCurry,a as $findTextIntersectionFromCharacters,f as $isRootTextContentEmpty,u as $isRootTextContentEmptyCurry,s as $rootTextContent,x as registerLexicalTextEntity};

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Meta Platforms, Inc. and affiliates.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/LexicalText.js.flow

@@ -0,0 +1,43 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * @flow strict
+ */
+import type {ElementNode, LexicalEditor, RootNode, TextNode} from '@ekz/lexical';
+export type TextNodeWithOffset = {
+  node: TextNode,
+  offset: number,
+};
+declare export function $findTextIntersectionFromCharacters(
+  root: RootNode,
+  targetCharacters: number,
+): null | {
+  node: TextNode,
+  offset: number,
+};
+declare export function $isRootTextContentEmpty(
+  isEditorComposing: boolean,
+  trim?: boolean,
+): boolean;
+declare export function $isRootTextContentEmptyCurry(
+  isEditorComposing: boolean,
+  trim?: boolean,
+): () => boolean;
+declare export function $rootTextContent(): string;
+declare export function $canShowPlaceholder(isComposing: boolean): boolean;
+declare export function $canShowPlaceholderCurry(
+  isEditorComposing: boolean,
+): () => boolean;
+export type EntityMatch = {
+  end: number,
+  start: number,
+};
+declare export function registerLexicalTextEntity<N: TextNode>(
+  editor: LexicalEditor,
+  getMatch: (text: string) => null | EntityMatch,
+  targetNode: Class<N>,
+  createNode: (textNode: TextNode) => N,
+): Array<() => void>;

package/README.md

@@ -0,0 +1,5 @@
+# `@lexical/text`
+
+[![See API Documentation](https://lexical.dev/img/see-api-documentation.svg)](https://lexical.dev/docs/api/modules/lexical_text)
+
+This package contains utilities and helpers for handling Lexical text.

package/canShowPlaceholder.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Determines if the input should show the placeholder. If anything is in
+ * in the root the placeholder should not be shown.
+ * @param isComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @returns true if the input should show the placeholder, false otherwise.
+ */
+export declare function $canShowPlaceholder(isComposing: boolean): boolean;
+/**
+ * Returns a function that executes {@link $canShowPlaceholder}
+ * @param isEditorComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @returns A function that executes $canShowPlaceholder with arguments.
+ */
+export declare function $canShowPlaceholderCurry(isEditorComposing: boolean): () => boolean;

package/findTextIntersectionFromCharacters.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+import { RootNode, TextNode } from '@ekz/lexical';
+/**
+ * Finds a TextNode with a size larger than targetCharacters and returns
+ * the node along with the remaining length of the text.
+ * @param root - The RootNode.
+ * @param targetCharacters - The number of characters whose TextNode must be larger than.
+ * @returns The TextNode and the intersections offset, or null if no TextNode is found.
+ */
+export declare function $findTextIntersectionFromCharacters(root: RootNode, targetCharacters: number): null | {
+    node: TextNode;
+    offset: number;
+};

package/index.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+import { TextNode } from '@ekz/lexical';
+export type TextNodeWithOffset = {
+    node: TextNode;
+    offset: number;
+};
+export { $canShowPlaceholder, $canShowPlaceholderCurry, } from './canShowPlaceholder';
+export { $findTextIntersectionFromCharacters } from './findTextIntersectionFromCharacters';
+export { $isRootTextContentEmpty, $isRootTextContentEmptyCurry, } from './isRootTextContentEmpty';
+export type { EntityMatch } from './registerLexicalTextEntity';
+export { registerLexicalTextEntity } from './registerLexicalTextEntity';
+export { $rootTextContent } from './rootTextContent';

package/isRootTextContentEmpty.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Determines if the root has any text content and can trim any whitespace if it does.
+ * @param isEditorComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @param trim - Should the root text have its whitespaced trimmed? Defaults to true.
+ * @returns true if text content is empty, false if there is text or isEditorComposing is true.
+ */
+export declare function $isRootTextContentEmpty(isEditorComposing: boolean, trim?: boolean): boolean;
+/**
+ * Returns a function that executes {@link $isRootTextContentEmpty}
+ * @param isEditorComposing - Is the editor in composition mode due to an active Input Method Editor?
+ * @param trim - Should the root text have its whitespaced trimmed? Defaults to true.
+ * @returns A function that executes $isRootTextContentEmpty based on arguments.
+ */
+export declare function $isRootTextContentEmptyCurry(isEditorComposing: boolean, trim?: boolean): () => boolean;

package/package.json

@@ -0,0 +1,42 @@
+{
+  "name": "@ekz/lexical-text",
+  "description": "This package contains utilities and helpers for handling Lexical text.",
+  "keywords": [
+    "lexical",
+    "editor",
+    "rich-text",
+    "list",
+    "text"
+  ],
+  "license": "MIT",
+  "version": "0.40.0",
+  "main": "LexicalText.js",
+  "types": "index.d.ts",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/facebook/lexical.git",
+    "directory": "packages/lexical-text"
+  },
+  "module": "LexicalText.mjs",
+  "sideEffects": false,
+  "exports": {
+    ".": {
+      "import": {
+        "types": "./index.d.ts",
+        "development": "./LexicalText.dev.mjs",
+        "production": "./LexicalText.prod.mjs",
+        "node": "./LexicalText.node.mjs",
+        "default": "./LexicalText.mjs"
+      },
+      "require": {
+        "types": "./index.d.ts",
+        "development": "./LexicalText.dev.js",
+        "production": "./LexicalText.prod.js",
+        "default": "./LexicalText.js"
+      }
+    }
+  },
+  "dependencies": {
+    "@ekz/lexical": "0.40.0"
+  }
+}

package/registerLexicalTextEntity.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+import { Klass, LexicalEditor, TextNode } from '@ekz/lexical';
+export type EntityMatch = {
+    end: number;
+    start: number;
+};
+/**
+ * Returns a tuple that can be rested (...) into mergeRegister to clean up
+ * node transforms listeners that transforms text into another node, eg. a HashtagNode.
+ * @example
+ * ```ts
+ *   useEffect(() => {
+    return mergeRegister(
+      ...registerLexicalTextEntity(editor, getMatch, targetNode, createNode),
+    );
+  }, [createNode, editor, getMatch, targetNode]);
+ * ```
+ * Where targetNode is the type of node containing the text you want to transform (like a text input),
+ * then getMatch uses a regex to find a matching text and creates the proper node to include the matching text.
+ * @param editor - The lexical editor.
+ * @param getMatch - Finds a matching string that satisfies a regex expression.
+ * @param targetNode - The node type that contains text to match with. eg. HashtagNode
+ * @param createNode - A function that creates a new node to contain the matched text. eg createHashtagNode
+ * @returns An array containing the plain text and reverse node transform listeners.
+ */
+export declare function registerLexicalTextEntity<T extends TextNode>(editor: LexicalEditor, getMatch: (text: string) => null | EntityMatch, targetNode: Klass<T>, createNode: (textNode: TextNode) => T): Array<() => void>;

package/rootTextContent.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Returns the root's text content.
+ * @returns The root's text content.
+ */
+export declare function $rootTextContent(): string;