@lexical/text 0.2.8 → 0.3.1

package/LexicalText.d.ts

@@ -5,8 +5,10 @@
  * 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;
@@ -37,7 +39,7 @@ export function $isRootTextContentEmptyCurry(
   isEditorComposing: boolean,
   trim?: boolean,
 ): () => boolean;
-export function $rootTextContentCurry(): string;
+export function $rootTextContent(): string;
 export function $canShowPlaceholder(isComposing: boolean): boolean;
 export function $canShowPlaceholderCurry(
   isEditorComposing: boolean,

package/LexicalText.dev.js

@@ -14,7 +14,6 @@ var lexical = require('lexical');
  * 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();
@@ -154,7 +153,7 @@ function $isRootTextContentEmpty(isEditorComposing, trim = true) {
     return false;
   }
 
-  let text = $rootTextContentCurry();
+  let text = $rootTextContent();
 
   if (trim) {
     text = text.trim();
@@ -165,7 +164,7 @@ function $isRootTextContentEmpty(isEditorComposing, trim = true) {
 function $isRootTextContentEmptyCurry(isEditorComposing, trim) {
   return () => $isRootTextContentEmpty(isEditorComposing, trim);
 }
-function $rootTextContentCurry() {
+function $rootTextContent() {
   const root = lexical.$getRoot();
   return root.getTextContent();
 }
@@ -268,7 +267,8 @@ function registerLexicalTextEntity(editor, getMatch, targetNode, createNode) {
       } else if (prevMatch === null || prevMatch.start < previousText.length) {
         return;
       }
-    }
+    } // eslint-disable-next-line no-constant-condition
+
 
     while (true) {
       match = getMatch(text);
@@ -372,5 +372,5 @@ exports.$findTextIntersectionFromCharacters = $findTextIntersectionFromCharacter
 exports.$isRootTextContentEmpty = $isRootTextContentEmpty;
 exports.$isRootTextContentEmptyCurry = $isRootTextContentEmptyCurry;
 exports.$joinTextNodesInElementNode = $joinTextNodesInElementNode;
-exports.$rootTextContentCurry = $rootTextContentCurry;
+exports.$rootTextContent = $rootTextContent;
 exports.registerLexicalTextEntity = registerLexicalTextEntity;

package/LexicalText.js.flow

@@ -37,7 +37,7 @@ declare export function $isRootTextContentEmptyCurry(
   isEditorComposing: boolean,
   trim?: boolean,
 ): () => boolean;
-declare export function $rootTextContentCurry(): string;
+declare export function $rootTextContent(): string;
 declare export function $canShowPlaceholder(isComposing: boolean): boolean;
 declare export function $canShowPlaceholderCurry(
   isEditorComposing: boolean,

package/LexicalText.prod.js

@@ -4,11 +4,11 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  */
-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();const 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();const 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();const p=e.length;let g=0,a=!1;for(let l=0;l<p&&!(g>f);++l){const 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){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};
 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();const p=b.length;for(let g=0;g<p;++g){const a=b[g];if(k.$isTextNode(a)){const d=a.getTextContent();if(a.is(c.node)){if(c.offset>d.length)throw Error("Minified Lexical error #4; 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.$rootTextContentCurry=t;
-exports.registerLexicalTextEntity=function(b,f,c,e){const p=a=>{const d=k.$createTextNode(a.getTextContent());d.setFormat(a.getFormat());a.replace(d)},g=b.registerNodeTransform(k.TextNode,a=>{if(a.isSimpleText()){var d=a.getPreviousSibling(),l=a.getTextContent(),m=a;if(k.$isTextNode(d)){var n=d.getTextContent(),h=f(n+l);if(d instanceof c){if(null===h||0!==d.getLatest().__mode){p(d);return}h=h.end-n.length;if(0<h){m=l.slice(0,h);m=n+m;d.select();d.setTextContent(m);h===l.length?a.remove():(d=l.slice(h),
+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;
+exports.registerLexicalTextEntity=function(b,f,c,e){let p=a=>{const d=k.$createTextNode(a.getTextContent());d.setFormat(a.getFormat());a.replace(d)},g=b.registerNodeTransform(k.TextNode,a=>{if(a.isSimpleText()){var d=a.getPreviousSibling(),l=a.getTextContent(),m=a;if(k.$isTextNode(d)){var n=d.getTextContent(),h=f(n+l);if(d instanceof c){if(null===h||0!==d.getLatest().__mode){p(d);return}h=h.end-n.length;if(0<h){m=l.slice(0,h);m=n+m;d.select();d.setTextContent(m);h===l.length?a.remove():(d=l.slice(h),
 a.setTextContent(d));return}}else if(null===h||h.start<n.length)return}for(;;){a=f(l);l=h=null===a?"":l.slice(a.end);if(""===h){if(n=m.getNextSibling(),k.$isTextNode(n))if(h=m.getTextContent()+n.getTextContent(),h=f(h),null===h){n instanceof c?p(n):n.markDirty();break}else if(0!==h.start)break}else if(n=f(h),null!==n&&0===n.start)break;if(null===a)break;if(0===a.start&&k.$isTextNode(d)&&d.isTextEntity())continue;let q;0===a.start?[q,m]=m.splitText(a.end):[,q,m]=m.splitText(a.start,a.end);a=e(q);q.replace(a);
-if(null==m)break}}});b=b.registerNodeTransform(c,a=>{var d=a.getTextContent();const l=f(d);null===l||0!==l.start?p(a):d.length>l.end?a.splitText(l.end):(d=a.getPreviousSibling(),k.$isTextNode(d)&&d.isTextEntity()&&(p(d),p(a)),d=a.getNextSibling(),k.$isTextNode(d)&&d.isTextEntity()&&(p(d),a instanceof c&&p(a)))});return[g,b]};
+if(null==m)break}}});b=b.registerNodeTransform(c,a=>{var d=a.getTextContent();const l=f(d);null===l||0!==l.start?p(a):d.length>l.end?a.splitText(l.end):(d=a.getPreviousSibling(),k.$isTextNode(d)&&d.isTextEntity()&&(p(d),p(a)),d=a.getNextSibling(),k.$isTextNode(d)&&d.isTextEntity()&&(p(d),a instanceof c&&p(a)))});return[g,b]}

package/package.json

@@ -9,10 +9,10 @@
     "text"
   ],
   "license": "MIT",
-  "version": "0.2.8",
+  "version": "0.3.1",
   "main": "LexicalText.js",
   "peerDependencies": {
-    "lexical": "0.2.8"
+    "lexical": "0.3.1"
   },
   "repository": {
     "type": "git",