@lexical/text 0.7.8 → 0.7.9

package/LexicalText.dev.js

@@ -12,64 +12,49 @@ 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) {
@@ -83,40 +68,31 @@ 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.$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) {
@@ -126,80 +102,67 @@ 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;
@@ -207,70 +170,56 @@ 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); // This may have already been converted in the previous block
+      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];

package/package.json

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