@lexical/text 0.8.1 → 0.9.1

package/LexicalText.dev.js

@@ -12,49 +12,64 @@ var lexical = require('lexical');
 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;
 }
 function $isRootTextContentEmpty(isEditorComposing, trim = true) {
   if (isEditorComposing) {
     return false;
   }
+
   let text = $rootTextContent();
+
   if (trim) {
     text = text.trim();
   }
+
   return text === '';
 }
 function $isRootTextContentEmptyCurry(isEditorComposing, trim) {
@@ -68,31 +83,44 @@ 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;
 }
 function $canShowPlaceholderCurry(isEditorComposing) {
@@ -102,67 +130,80 @@ 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;
     }
+
     const 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;
       }
-    }
+    } // eslint-disable-next-line no-constant-condition
+
 
-    // 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;
@@ -170,56 +211,70 @@ function registerLexicalTextEntity(editor, getMatch, targetNode, createNode) {
         }
       } else {
         const nextMatch = getMatch(nextText);
+
         if (nextMatch !== null && nextMatch.start === 0) {
           return;
         }
       }
+
       if (match === null) {
         return;
       }
+
       if (match.start === 0 && lexical.$isTextNode(prevSibling) && prevSibling.isTextEntity()) {
         continue;
       }
+
       let nodeToReplace;
+
       if (match.start === 0) {
         [nodeToReplace, currentNode] = currentNode.splitText(match.end);
       } else {
         [, nodeToReplace, currentNode] = currentNode.splitText(match.start, match.end);
       }
+
       const replacementNode = createNode(nodeToReplace);
       nodeToReplace.replace(replacementNode);
+
       if (currentNode == null) {
         return;
       }
     }
   };
+
   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);
+      replaceWithSimpleText(nextSibling); // This may have already been converted in the previous block
 
-      // 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];

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

package/package.json

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