@lexical/text 0.3.3 → 0.3.6

package/LexicalText.dev.js

@@ -168,8 +168,9 @@ function $rootTextContent() {
   const root = lexical.$getRoot();
   return root.getTextContent();
 }
-function $canShowPlaceholder(isComposing) {
-  if (!$isRootTextContentEmpty(isComposing, false)) {
+function $canShowPlaceholder(isComposing, // TODO 0.4 make mandatory
+isReadOnly = false) {
+  if (isReadOnly || !$isRootTextContentEmpty(isComposing, false)) {
     return false;
   }
 
@@ -208,8 +209,9 @@ function $canShowPlaceholder(isComposing) {
 
   return true;
 }
-function $canShowPlaceholderCurry(isEditorComposing) {
-  return () => $canShowPlaceholder(isEditorComposing);
+function $canShowPlaceholderCurry(isEditorComposing, // TODO 0.4 make mandatory
+isReadOnly = false) {
+  return () => $canShowPlaceholder(isEditorComposing, isReadOnly);
 }
 function registerLexicalTextEntity(editor, getMatch, targetNode, createNode) {
   const isTargetNode = node => {

package/LexicalText.prod.js

@@ -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.
  */
-'use strict';var k=require("lexical");function r(b,f=!0){if(b)return!1;b=t();f&&(b=b.trim());return""===b}function t(){return k.$getRoot().getTextContent()}function u(b){if(!r(b,!1))return!1;b=k.$getRoot().getChildren();let f=b.length;if(1<f)return!1;for(let e=0;e<f;e++){var c=b[e];if(k.$isElementNode(c)){if("paragraph"!==c.__type||0!==c.__indent)return!1;c=c.getChildren();let p=c.length;for(let g=0;g<p;g++)if(!k.$isTextNode(c[e]))return!1}}return!0}exports.$canShowPlaceholder=u;
-exports.$canShowPlaceholderCurry=function(b){return()=>u(b)};exports.$findNodeWithOffsetFromJoinedText=function(b,f,c,e){e=e.getChildren();let p=e.length,g=0,a=!1;for(let l=0;l<p&&!(g>f);++l){let m=e[l],n=k.$isTextNode(m);var d=n?m.getTextContent().length:c;d=g+d;if((!1===a&&g===b||0===g&&g===b||g<b&&b<=d)&&k.$isTextNode(m))return{node:m,offset:b-g};g=d;a=n}return null};
+'use strict';var k=require("lexical");function r(b,f=!0){if(b)return!1;b=t();f&&(b=b.trim());return""===b}function t(){return k.$getRoot().getTextContent()}function u(b,f=!1){if(f||!r(b,!1))return!1;b=k.$getRoot().getChildren();f=b.length;if(1<f)return!1;for(let e=0;e<f;e++){var c=b[e];if(k.$isElementNode(c)){if("paragraph"!==c.__type||0!==c.__indent)return!1;c=c.getChildren();let p=c.length;for(let g=0;g<p;g++)if(!k.$isTextNode(c[e]))return!1}}return!0}exports.$canShowPlaceholder=u;
+exports.$canShowPlaceholderCurry=function(b,f=!1){return()=>u(b,f)};exports.$findNodeWithOffsetFromJoinedText=function(b,f,c,e){e=e.getChildren();let p=e.length,g=0,a=!1;for(let l=0;l<p&&!(g>f);++l){let m=e[l],n=k.$isTextNode(m);var d=n?m.getTextContent().length:c;d=g+d;if((!1===a&&g===b||0===g&&g===b||g<b&&b<=d)&&k.$isTextNode(m))return{node:m,offset:b-g};g=d;a=n}return null};
 exports.$findTextIntersectionFromCharacters=function(b,f){var c=b.getFirstChild();b=0;a:for(;null!==c;){if(k.$isElementNode(c)){var e=c.getFirstChild();if(null!==e){c=e;continue}}else if(k.$isTextNode(c)){e=c.getTextContentSize();if(b+e>f)return{node:c,offset:f-b};b+=e}e=c.getNextSibling();if(null!==e)c=e;else{for(c=c.getParent();null!==c;){e=c.getNextSibling();if(null!==e){c=e;continue a}c=c.getParent()}break}}return null};exports.$isRootTextContentEmpty=r;
 exports.$isRootTextContentEmptyCurry=function(b,f){return()=>r(b,f)};
 exports.$joinTextNodesInElementNode=function(b,f,c){let e="";b=b.getChildren();let p=b.length;for(let g=0;g<p;++g){let a=b[g];if(k.$isTextNode(a)){let d=a.getTextContent();if(a.is(c.node)){if(c.offset>d.length)throw Error("Minified Lexical error #2; see codes.json for the full message or use the non-minified dev environment for full errors and additional helpful warnings.");e+=a.getTextContent().substr(0,c.offset);break}else e+=d}else e+=f}return e};exports.$rootTextContent=t;

package/index.d.ts

@@ -0,0 +1,29 @@
+/**
+ * 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 type { ElementNode, Klass, LexicalEditor, RootNode } from 'lexical';
+import { TextNode } from 'lexical';
+export declare type TextNodeWithOffset = {
+    node: TextNode;
+    offset: number;
+};
+export declare function $findTextIntersectionFromCharacters(root: RootNode, targetCharacters: number): null | {
+    node: TextNode;
+    offset: number;
+};
+export declare function $joinTextNodesInElementNode(elementNode: ElementNode, separator: string, stopAt: TextNodeWithOffset): string;
+export declare function $findNodeWithOffsetFromJoinedText(offsetInJoinedText: number, joinedTextLength: number, separatorLength: number, elementNode: ElementNode): TextNodeWithOffset | null;
+export declare function $isRootTextContentEmpty(isEditorComposing: boolean, trim?: boolean): boolean;
+export declare function $isRootTextContentEmptyCurry(isEditorComposing: boolean, trim?: boolean): () => boolean;
+export declare function $rootTextContent(): string;
+export declare function $canShowPlaceholder(isComposing: boolean, isReadOnly?: boolean): boolean;
+export declare function $canShowPlaceholderCurry(isEditorComposing: boolean, isReadOnly?: boolean): () => boolean;
+export declare type EntityMatch = {
+    end: number;
+    start: number;
+};
+export declare function registerLexicalTextEntity<T extends TextNode>(editor: LexicalEditor, getMatch: (text: string) => null | EntityMatch, targetNode: Klass<T>, createNode: (textNode: TextNode) => T): Array<() => void>;

package/package.json

@@ -9,17 +9,14 @@
     "text"
   ],
   "license": "MIT",
-  "version": "0.3.3",
+  "version": "0.3.6",
   "main": "LexicalText.js",
   "peerDependencies": {
-    "lexical": "0.3.3"
+    "lexical": "0.3.6"
   },
   "repository": {
     "type": "git",
     "url": "https://github.com/facebook/lexical",
     "directory": "packages/lexical-text"
-  },
-  "devDependencies": {
-    "utility-types": "^3.10.0"
   }
 }

package/LexicalText.d.ts

@@ -1,56 +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 type {ElementNode, LexicalEditor, RootNode, TextNode} from 'lexical';
-import {Class} from 'utility-types';
-
-export type TextNodeWithOffset = {
-  node: TextNode;
-  offset: number;
-};
-export function $findTextIntersectionFromCharacters(
-  root: RootNode,
-  targetCharacters: number,
-): null | {
-  node: TextNode;
-  offset: number;
-};
-export function $joinTextNodesInElementNode(
-  elementNode: ElementNode,
-  separator: string,
-  stopAt: TextNodeWithOffset,
-): string;
-export function $findNodeWithOffsetFromJoinedText(
-  offsetInJoinedText: number,
-  joinedTextLength: number,
-  separatorLength: number,
-  elementNode: ElementNode,
-): TextNodeWithOffset | null | undefined;
-export function $isRootTextContentEmpty(
-  isEditorComposing: boolean,
-  trim?: boolean,
-): boolean;
-export function $isRootTextContentEmptyCurry(
-  isEditorComposing: boolean,
-  trim?: boolean,
-): () => boolean;
-export function $rootTextContent(): string;
-export function $canShowPlaceholder(isComposing: boolean): boolean;
-export function $canShowPlaceholderCurry(
-  isEditorComposing: boolean,
-): () => boolean;
-export type EntityMatch = {
-  end: number;
-  start: number;
-};
-export function registerLexicalTextEntity<N extends TextNode>(
-  editor: LexicalEditor,
-  getMatch: (text: string) => null | EntityMatch,
-  targetNode: Class<N>,
-  createNode: (textNode: TextNode) => N,
-): Array<() => void>;