@lexical/text 0.14.2 → 0.14.3

package/LexicalText.dev.js

@@ -8,53 +8,31 @@
 
 var lexical = require('lexical');
 
-/** @module @lexical/text */
 /**
- * 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.
+ * 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.
+ *
  */
-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;
+
+/**
+ * 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?
@@ -83,13 +61,12 @@ function $isRootTextContentEmptyCurry(isEditorComposing, trim) {
 }
 
 /**
- * Returns the root's text content.
- * @returns The root's text content.
+ * 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.
+ *
  */
-function $rootTextContent() {
-  const root = lexical.$getRoot();
-  return root.getTextContent();
-}
 
 /**
  * Determines if the input should show the placeholder. If anything is in
@@ -140,6 +117,68 @@ function $canShowPlaceholder(isComposing) {
 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.
+ *
+ */
 /**
  * Returns a tuple that can be rested (...) into mergeRegister to clean up
  * node transforms listeners that transforms text into another node, eg. a HashtagNode.

package/{LexicalText.dev.esm.js → LexicalText.dev.mjs}

@@ -4,55 +4,33 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  */
-import { $isElementNode, $isTextNode, $getRoot, $isDecoratorNode, $isParagraphNode, TextNode, $createTextNode } from 'lexical';
+import { $getRoot, $isDecoratorNode, $isElementNode, $isParagraphNode, $isTextNode, TextNode, $createTextNode } from 'lexical';
 
-/** @module @lexical/text */
 /**
- * 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.
+ * 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.
+ *
  */
-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;
+
+/**
+ * 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?
@@ -81,13 +59,12 @@ function $isRootTextContentEmptyCurry(isEditorComposing, trim) {
 }
 
 /**
- * Returns the root's text content.
- * @returns The root's text content.
+ * 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.
+ *
  */
-function $rootTextContent() {
-  const root = $getRoot();
-  return root.getTextContent();
-}
 
 /**
  * Determines if the input should show the placeholder. If anything is in
@@ -138,6 +115,68 @@ function $canShowPlaceholder(isComposing) {
 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.
+ *
+ */
 /**
  * Returns a tuple that can be rested (...) into mergeRegister to clean up
  * node transforms listeners that transforms text into another node, eg. a HashtagNode.

package/{LexicalText.esm.js → LexicalText.mjs}

@@ -4,8 +4,8 @@
  * 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 './LexicalText.dev.esm.js';
-import * as modProd from './LexicalText.prod.esm.js';
+import * as modDev from './LexicalText.dev.mjs';
+import * as modProd from './LexicalText.prod.mjs';
 const mod = process.env.NODE_ENV === 'development' ? modDev : modProd;
 export const $canShowPlaceholder = mod.$canShowPlaceholder;
 export const $canShowPlaceholderCurry = mod.$canShowPlaceholderCurry;

package/LexicalText.node.mjs

@@ -0,0 +1,14 @@
+/**
+ * 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 === 'development' ? import('./LexicalText.dev.mjs') : import('./LexicalText.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/LexicalText.prod.js

@@ -4,9 +4,9 @@
  * 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 g=require("lexical");function r(c,h=!0){if(c)return!1;c=t();h&&(c=c.trim());return""===c}function t(){return g.$getRoot().getTextContent()}function u(c){if(!r(c,!1))return!1;c=g.$getRoot().getChildren();let h=c.length;if(1<h)return!1;for(let e=0;e<h;e++){var b=c[e];if(g.$isDecoratorNode(b))return!1;if(g.$isElementNode(b)){if(!g.$isParagraphNode(b)||0!==b.__indent)return!1;b=b.getChildren();let n=b.length;for(let q=0;q<n;q++)if(!g.$isTextNode(b[e]))return!1}}return!0}
+'use strict';var g=require("lexical");function r(){return g.$getRoot().getTextContent()}function t(c,h=!0){if(c)return!1;c=r();h&&(c=c.trim());return""===c}function u(c){if(!t(c,!1))return!1;c=g.$getRoot().getChildren();let h=c.length;if(1<h)return!1;for(let e=0;e<h;e++){var b=c[e];if(g.$isDecoratorNode(b))return!1;if(g.$isElementNode(b)){if(!g.$isParagraphNode(b)||0!==b.__indent)return!1;b=b.getChildren();let n=b.length;for(let q=0;q<n;q++)if(!g.$isTextNode(b[e]))return!1}}return!0}
 exports.$canShowPlaceholder=u;exports.$canShowPlaceholderCurry=function(c){return()=>u(c)};exports.$findTextIntersectionFromCharacters=function(c,h){var b=c.getFirstChild();c=0;a:for(;null!==b;){if(g.$isElementNode(b)){var e=b.getFirstChild();if(null!==e){b=e;continue}}else if(g.$isTextNode(b)){e=b.getTextContentSize();if(c+e>h)return{node:b,offset:h-c};c+=e}e=b.getNextSibling();if(null!==e)b=e;else{for(b=b.getParent();null!==b;){e=b.getNextSibling();if(null!==e){b=e;continue a}b=b.getParent()}break}}return null};
-exports.$isRootTextContentEmpty=r;exports.$isRootTextContentEmptyCurry=function(c,h){return()=>r(c,h)};exports.$rootTextContent=t;
+exports.$isRootTextContentEmpty=t;exports.$isRootTextContentEmptyCurry=function(c,h){return()=>t(c,h)};exports.$rootTextContent=r;
 exports.registerLexicalTextEntity=function(c,h,b,e){let n=a=>{const d=g.$createTextNode(a.getTextContent());d.setFormat(a.getFormat());a.replace(d)},q=c.registerNodeTransform(g.TextNode,a=>{if(a.isSimpleText()){var d=a.getPreviousSibling(),l=a.getTextContent(),m=a;if(g.$isTextNode(d)){var k=d.getTextContent(),f=h(k+l);if(d instanceof b){if(null===f||0!==d.getLatest().__mode){n(d);return}f=f.end-k.length;if(0<f){m=l.slice(0,f);m=k+m;d.select();d.setTextContent(m);f===l.length?a.remove():(d=l.slice(f),
 a.setTextContent(d));return}}else if(null===f||f.start<k.length)return}for(;;){a=h(l);l=f=null===a?"":l.slice(a.end);if(""===f){if(k=m.getNextSibling(),g.$isTextNode(k))if(f=m.getTextContent()+k.getTextContent(),f=h(f),null===f){k instanceof b?n(k):k.markDirty();break}else if(0!==f.start)break}else if(k=h(f),null!==k&&0===k.start)break;if(null===a)break;if(0===a.start&&g.$isTextNode(d)&&d.isTextEntity())continue;let p;0===a.start?[p,m]=m.splitText(a.end):[,p,m]=m.splitText(a.start,a.end);a=e(p);a.setFormat(p.getFormat());
 p.replace(a);if(null==m)break}}});c=c.registerNodeTransform(b,a=>{var d=a.getTextContent();const l=h(d);null===l||0!==l.start?n(a):d.length>l.end?a.splitText(l.end):(d=a.getPreviousSibling(),g.$isTextNode(d)&&d.isTextEntity()&&(n(d),n(a)),d=a.getNextSibling(),g.$isTextNode(d)&&d.isTextEntity()&&(n(d),a instanceof b&&n(a)))});return[q,c]}

package/LexicalText.prod.mjs

@@ -0,0 +1,7 @@
+/**
+ * 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"lexical";function s(){return t().getTextContent()}function u(t,e=!0){if(t)return!1;let n=s();return e&&(n=n.trim()),""===n}function f(t,e){return()=>u(t,e)}function c(o){if(!u(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 x(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 a(t,e,n,r){const s=t=>t instanceof n,u=t=>{const e=l(t.getTextContent());e.setFormat(t.getFormat()),t.replace(e)};return[t.registerNodeTransform(o,(t=>{if(!t.isSimpleText())return;const n=t.getPreviousSibling();let o,l=t.getTextContent(),f=t;if(i(n)){const r=n.getTextContent(),i=e(r+l);if(s(n)){if(null===i||0!==(t=>t.getLatest().__mode)(n))return void u(n);{const e=i.end-r.length;if(e>0){const i=r+l.slice(0,e);if(n.select(),n.setTextContent(i),e===l.length)t.remove();else{const n=l.slice(e);t.setTextContent(n)}return}}}else if(null===i||i.start<r.length)return}for(;;){o=e(l);let t,c=null===o?"":l.slice(o.end);if(l=c,""===c){const t=f.getNextSibling();if(i(t)){c=f.getTextContent()+t.getTextContent();const n=e(c);if(null===n)return void(s(t)?u(t):t.markDirty());if(0!==n.start)return}}else{const t=e(c);if(null!==t&&0===t.start)return}if(null===o)return;if(0===o.start&&i(n)&&n.isTextEntity())continue;0===o.start?[t,f]=f.splitText(o.end):[,t,f]=f.splitText(o.start,o.end);const g=r(t);if(g.setFormat(t.getFormat()),t.replace(g),null==f)return}})),t.registerNodeTransform(n,(t=>{const n=t.getTextContent(),r=e(n);if(null===r||0!==r.start)return void u(t);if(n.length>r.end)return void t.splitText(r.end);const o=t.getPreviousSibling();i(o)&&o.isTextEntity()&&(u(o),u(t));const l=t.getNextSibling();i(l)&&l.isTextEntity()&&(u(l),s(t)&&u(t))}))]}export{c as $canShowPlaceholder,g as $canShowPlaceholderCurry,x as $findTextIntersectionFromCharacters,u as $isRootTextContentEmpty,f as $isRootTextContentEmptyCurry,s as $rootTextContent,a as registerLexicalTextEntity};

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 '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

@@ -6,76 +6,14 @@
  * LICENSE file in the root directory of this source tree.
  *
  */
-import type { Klass, LexicalEditor, RootNode } from 'lexical';
 import { TextNode } from 'lexical';
 export type TextNodeWithOffset = {
     node: TextNode;
     offset: number;
 };
-/**
- * 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;
-};
-/**
- * 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;
-/**
- * Returns the root's text content.
- * @returns The root's text content.
- */
-export declare function $rootTextContent(): string;
-/**
- * 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;
-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>;
+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

@@ -9,16 +9,30 @@
     "text"
   ],
   "license": "MIT",
-  "version": "0.14.2",
+  "version": "0.14.3",
   "main": "LexicalText.js",
-  "peerDependencies": {
-    "lexical": "0.14.2"
-  },
+  "types": "index.d.ts",
   "repository": {
     "type": "git",
     "url": "https://github.com/facebook/lexical",
     "directory": "packages/lexical-text"
   },
-  "module": "LexicalText.esm.js",
-  "sideEffects": false
+  "module": "LexicalText.mjs",
+  "sideEffects": false,
+  "exports": {
+    ".": {
+      "import": {
+        "types": "./index.d.ts",
+        "node": "./LexicalText.node.mjs",
+        "default": "./LexicalText.mjs"
+      },
+      "require": {
+        "types": "./index.d.ts",
+        "default": "./LexicalText.js"
+      }
+    }
+  },
+  "dependencies": {
+    "lexical": "0.14.3"
+  }
 }

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 '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;

package/LexicalText.prod.esm.js

@@ -1,7 +0,0 @@
-/**
- * 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{$isElementNode as t,$isTextNode as e,$getRoot as n,$isDecoratorNode as r,$isParagraphNode as i,TextNode as o,$createTextNode as l}from"lexical";function s(n,r){let i=n.getFirstChild(),o=0;t:for(;null!==i;){if(t(i)){const t=i.getFirstChild();if(null!==t){i=t;continue}}else if(e(i)){const t=i.getTextContentSize();if(o+t>r)return{node:i,offset:r-o};o+=t}const n=i.getNextSibling();if(null!==n){i=n;continue}let l=i.getParent();for(;null!==l;){const t=l.getNextSibling();if(null!==t){i=t;continue t}l=l.getParent()}break}return null}function u(t,e=!0){if(t)return!1;let n=c();return e&&(n=n.trim()),""===n}function f(t,e){return()=>u(t,e)}function c(){return n().getTextContent()}function g(o){if(!u(o,!1))return!1;const l=n().getChildren(),s=l.length;if(s>1)return!1;for(let n=0;n<s;n++){const o=l[n];if(r(o))return!1;if(t(o)){if(!i(o))return!1;if(0!==o.__indent)return!1;const t=o.getChildren(),r=t.length;for(let i=0;i<r;i++){const r=t[n];if(!e(r))return!1}}}return!0}function x(t){return()=>g(t)}function a(t,n,r,i){const s=t=>t instanceof r,u=t=>{const e=l(t.getTextContent());e.setFormat(t.getFormat()),t.replace(e)};return[t.registerNodeTransform(o,(t=>{if(!t.isSimpleText())return;const r=t.getPreviousSibling();let o,l=t.getTextContent(),f=t;if(e(r)){const e=r.getTextContent(),i=n(e+l);if(s(r)){if(null===i||0!==(t=>t.getLatest().__mode)(r))return void u(r);{const n=i.end-e.length;if(n>0){const i=e+l.slice(0,n);if(r.select(),r.setTextContent(i),n===l.length)t.remove();else{const e=l.slice(n);t.setTextContent(e)}return}}}else if(null===i||i.start<e.length)return}for(;;){o=n(l);let t,c=null===o?"":l.slice(o.end);if(l=c,""===c){const t=f.getNextSibling();if(e(t)){c=f.getTextContent()+t.getTextContent();const e=n(c);if(null===e)return void(s(t)?u(t):t.markDirty());if(0!==e.start)return}}else{const t=n(c);if(null!==t&&0===t.start)return}if(null===o)return;if(0===o.start&&e(r)&&r.isTextEntity())continue;0===o.start?[t,f]=f.splitText(o.end):[,t,f]=f.splitText(o.start,o.end);const g=i(t);if(g.setFormat(t.getFormat()),t.replace(g),null==f)return}})),t.registerNodeTransform(r,(t=>{const r=t.getTextContent(),i=n(r);if(null===i||0!==i.start)return void u(t);if(r.length>i.end)return void t.splitText(i.end);const o=t.getPreviousSibling();e(o)&&o.isTextEntity()&&(u(o),u(t));const l=t.getNextSibling();e(l)&&l.isTextEntity()&&(u(l),s(t)&&u(t))}))]}export{g as $canShowPlaceholder,x as $canShowPlaceholderCurry,s as $findTextIntersectionFromCharacters,u as $isRootTextContentEmpty,f as $isRootTextContentEmptyCurry,c as $rootTextContent,a as registerLexicalTextEntity};