@lexical/utils 0.8.0 → 0.9.0

package/LexicalUtils.dev.js

@@ -31,9 +31,9 @@ function isMimeType(file, acceptableMimeTypes) {
       return true;
     }
   }
+
   return false;
 }
-
 /**
  * Lexical File Reader with:
  *  1. MIME type support
@@ -45,36 +45,44 @@ function isMimeType(file, acceptableMimeTypes) {
  *   src: file.result,
  * }));
  */
+
 function mediaFileReader(files, acceptableMimeTypes) {
   const filesIterator = files[Symbol.iterator]();
   return new Promise((resolve, reject) => {
     const processed = [];
+
     const handleNextFile = () => {
       const {
         done,
         value: file
       } = filesIterator.next();
+
       if (done) {
         return resolve(processed);
       }
+
       const fileReader = new FileReader();
       fileReader.addEventListener('error', reject);
       fileReader.addEventListener('load', () => {
         const result = fileReader.result;
+
         if (typeof result === 'string') {
           processed.push({
             file,
             result
           });
         }
+
         handleNextFile();
       });
+
       if (isMimeType(file, acceptableMimeTypes)) {
         fileReader.readAsDataURL(file);
       } else {
         handleNextFile();
       }
     };
+
     handleNextFile();
   });
 }
@@ -84,19 +92,23 @@ function $dfs(startingNode, endingNode) {
   const end = endingNode || (lexical.$isElementNode(start) ? start.getLastDescendant() : start);
   let node = start;
   let depth = $getDepth(node);
+
   while (node !== null && !node.is(end)) {
     nodes.push({
       depth,
       node
     });
+
     if (lexical.$isElementNode(node) && node.getChildrenSize() > 0) {
       node = node.getFirstChild();
       depth++;
     } else {
       // Find immediate sibling or nearest parent sibling
       let sibling = null;
+
       while (sibling === null && node !== null) {
         sibling = node.getNextSibling();
+
         if (sibling === null) {
           node = node.getParent();
           depth--;
@@ -106,49 +118,63 @@ function $dfs(startingNode, endingNode) {
       }
     }
   }
+
   if (node !== null && node.is(end)) {
     nodes.push({
       depth,
       node
     });
   }
+
   return nodes;
 }
+
 function $getDepth(node) {
   let innerNode = node;
   let depth = 0;
+
   while ((innerNode = innerNode.getParent()) !== null) {
     depth++;
   }
+
   return depth;
 }
+
 function $getNearestNodeOfType(node, klass) {
   let parent = node;
+
   while (parent != null) {
     if (parent instanceof klass) {
       return parent;
     }
+
     parent = parent.getParent();
   }
+
   return null;
 }
 function $getNearestBlockElementAncestorOrThrow(startNode) {
   const blockNode = $findMatchingParent(startNode, node => lexical.$isElementNode(node) && !node.isInline());
+
   if (!lexical.$isElementNode(blockNode)) {
     {
       throw Error(`Expected node ${startNode.__key} to have closest block element node.`);
     }
   }
+
   return blockNode;
 }
 function $findMatchingParent(startingNode, findFn) {
   let curr = startingNode;
+
   while (curr !== lexical.$getRoot() && curr != null) {
     if (findFn(curr)) {
       return curr;
     }
+
     curr = curr.getParent();
   }
+
   return null;
 }
 function mergeRegister(...func) {
@@ -160,21 +186,27 @@ function registerNestedElementResolver(editor, targetNode, cloneNode, handleOver
   const $isTargetNode = node => {
     return node instanceof targetNode;
   };
+
   const $findMatch = node => {
     // First validate we don't have any children that are of the target,
     // as we need to handle them first.
     const children = node.getChildren();
+
     for (let i = 0; i < children.length; i++) {
       const child = children[i];
+
       if ($isTargetNode(child)) {
         return null;
       }
     }
+
     let parentNode = node;
     let childNode = node;
+
     while (parentNode !== null) {
       childNode = parentNode;
       parentNode = parentNode.getParent();
+
       if ($isTargetNode(parentNode)) {
         return {
           child: childNode,
@@ -182,78 +214,94 @@ function registerNestedElementResolver(editor, targetNode, cloneNode, handleOver
         };
       }
     }
+
     return null;
   };
+
   const elementNodeTransform = node => {
     const match = $findMatch(node);
+
     if (match !== null) {
       const {
         child,
         parent
-      } = match;
-
-      // Simple path, we can move child out and siblings into a new parent.
+      } = match; // Simple path, we can move child out and siblings into a new parent.
 
       if (child.is(node)) {
         handleOverlap(parent, node);
         const nextSiblings = child.getNextSiblings();
         const nextSiblingsLength = nextSiblings.length;
         parent.insertAfter(child);
+
         if (nextSiblingsLength !== 0) {
           const newParent = cloneNode(parent);
           child.insertAfter(newParent);
+
           for (let i = 0; i < nextSiblingsLength; i++) {
             newParent.append(nextSiblings[i]);
           }
         }
+
         if (!parent.canBeEmpty() && parent.getChildrenSize() === 0) {
           parent.remove();
         }
       }
     }
   };
+
   return editor.registerNodeTransform(targetNode, elementNodeTransform);
 }
 function $restoreEditorState(editor, editorState) {
   const FULL_RECONCILE = 2;
   const nodeMap = new Map();
   const activeEditorState = editor._pendingEditorState;
+
   for (const [key, node] of editorState._nodeMap) {
     const clone = selection.$cloneWithProperties(node);
+
     if (lexical.$isTextNode(clone)) {
       clone.__text = node.__text;
     }
+
     nodeMap.set(key, clone);
   }
+
   if (activeEditorState) {
     activeEditorState._nodeMap = nodeMap;
   }
+
   editor._dirtyType = FULL_RECONCILE;
   const selection$1 = editorState._selection;
   lexical.$setSelection(selection$1 === null ? null : selection$1.clone());
 }
 function $insertNodeToNearestRoot(node) {
   const selection = lexical.$getSelection();
+
   if (lexical.$isRangeSelection(selection)) {
     const {
       focus
     } = selection;
     const focusNode = focus.getNode();
     const focusOffset = focus.offset;
+
     if (lexical.$isRootOrShadowRoot(focusNode)) {
       const focusChild = focusNode.getChildAtIndex(focusOffset);
+
       if (focusChild == null) {
         focusNode.append(node);
       } else {
         focusChild.insertBefore(node);
       }
+
       node.selectNext();
     } else {
       let splitNode;
       let splitOffset;
+
       if (lexical.$isTextNode(focusNode)) {
         splitNode = focusNode.getParentOrThrow();
         splitOffset = focusNode.getIndexWithinParent();
+
         if (focusOffset > 0) {
           splitOffset += 1;
           focusNode.splitText(focusOffset);
@@ -262,6 +310,7 @@ function $insertNodeToNearestRoot(node) {
         splitNode = focusNode;
         splitOffset = focusOffset;
       }
+
       const [, rightTree] = lexical.$splitNode(splitNode, splitOffset);
       rightTree.insertBefore(node);
       rightTree.selectStart();
@@ -274,10 +323,12 @@ function $insertNodeToNearestRoot(node) {
       const root = lexical.$getRoot();
       root.append(node);
     }
+
     const paragraphNode = lexical.$createParagraphNode();
     node.insertAfter(paragraphNode);
     paragraphNode.select();
   }
+
   return node.getLatest();
 }
 function $wrapNodeInElement(node, createElementNode) {
@@ -286,6 +337,13 @@ function $wrapNodeInElement(node, createElementNode) {
   elementNode.append(node);
   return elementNode;
 }
+function isHTMLAnchorElement(x) {
+  return isHTMLElement(x) && x.tagName === 'A';
+}
+function isHTMLElement(x) {
+  // @ts-ignore-next-line - strict check on nodeType here should filter out non-Element EventTarget implementors
+  return x.nodeType === 1;
+}
 
 exports.$splitNode = lexical.$splitNode;
 exports.$dfs = $dfs;
@@ -296,6 +354,8 @@ exports.$insertNodeToNearestRoot = $insertNodeToNearestRoot;
 exports.$restoreEditorState = $restoreEditorState;
 exports.$wrapNodeInElement = $wrapNodeInElement;
 exports.addClassNamesToElement = addClassNamesToElement;
+exports.isHTMLAnchorElement = isHTMLAnchorElement;
+exports.isHTMLElement = isHTMLElement;
 exports.isMimeType = isMimeType;
 exports.mediaFileReader = mediaFileReader;
 exports.mergeRegister = mergeRegister;

package/LexicalUtils.prod.js

@@ -4,12 +4,12 @@
  * 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/selection"),n=require("lexical");function p(a,b){for(let c of b)if(a.type.startsWith(c))return!0;return!1}function r(a,b){for(;a!==n.$getRoot()&&null!=a;){if(b(a))return a;a=a.getParent()}return null}exports.$splitNode=n.$splitNode;
-exports.$dfs=function(a,b){let c=[];a=(a||n.$getRoot()).getLatest();b=b||(n.$isElementNode(a)?a.getLastDescendant():a);for(var f=a,d=0;null!==(f=f.getParent());)d++;for(f=d;null!==a&&!a.is(b);)if(c.push({depth:f,node:a}),n.$isElementNode(a)&&0<a.getChildrenSize())a=a.getFirstChild(),f++;else for(d=null;null===d&&null!==a;)d=a.getNextSibling(),null===d?(a=a.getParent(),f--):a=d;null!==a&&a.is(b)&&c.push({depth:f,node:a});return c};exports.$findMatchingParent=r;
-exports.$getNearestBlockElementAncestorOrThrow=function(a){a=r(a,b=>n.$isElementNode(b)&&!b.isInline());if(!n.$isElementNode(a))throw Error("Minified Lexical error #4; visit https://lexical.dev/docs/error?code=4 for the full message or use the non-minified dev environment for full errors and additional helpful warnings.");return a};exports.$getNearestNodeOfType=function(a,b){for(;null!=a;){if(a instanceof b)return a;a=a.getParent()}return null};
+'use strict';var g=require("@lexical/selection"),n=require("lexical");function p(a,b){for(let c of b)if(a.type.startsWith(c))return!0;return!1}function q(a,b){for(;a!==n.$getRoot()&&null!=a;){if(b(a))return a;a=a.getParent()}return null}function t(a){return 1===a.nodeType}exports.$splitNode=n.$splitNode;
+exports.$dfs=function(a,b){let c=[];a=(a||n.$getRoot()).getLatest();b=b||(n.$isElementNode(a)?a.getLastDescendant():a);for(var f=a,d=0;null!==(f=f.getParent());)d++;for(f=d;null!==a&&!a.is(b);)if(c.push({depth:f,node:a}),n.$isElementNode(a)&&0<a.getChildrenSize())a=a.getFirstChild(),f++;else for(d=null;null===d&&null!==a;)d=a.getNextSibling(),null===d?(a=a.getParent(),f--):a=d;null!==a&&a.is(b)&&c.push({depth:f,node:a});return c};exports.$findMatchingParent=q;
+exports.$getNearestBlockElementAncestorOrThrow=function(a){a=q(a,b=>n.$isElementNode(b)&&!b.isInline());if(!n.$isElementNode(a))throw Error("Minified Lexical error #4; visit https://lexical.dev/docs/error?code=4 for the full message or use the non-minified dev environment for full errors and additional helpful warnings.");return a};exports.$getNearestNodeOfType=function(a,b){for(;null!=a;){if(a instanceof b)return a;a=a.getParent()}return null};
 exports.$insertNodeToNearestRoot=function(a){var b=n.$getSelection();if(n.$isRangeSelection(b)){var {focus:c}=b;b=c.getNode();c=c.offset;if(n.$isRootOrShadowRoot(b))c=b.getChildAtIndex(c),null==c?b.append(a):c.insertBefore(a),a.selectNext();else{let f,d;n.$isTextNode(b)?(f=b.getParentOrThrow(),d=b.getIndexWithinParent(),0<c&&(d+=1,b.splitText(c))):(f=b,d=c);[,b]=n.$splitNode(f,d);b.insertBefore(a);b.selectStart()}}else n.$isNodeSelection(b)||n.DEPRECATED_$isGridSelection(b)?(b=b.getNodes(),b[b.length-
 1].getTopLevelElementOrThrow().insertAfter(a)):n.$getRoot().append(a),b=n.$createParagraphNode(),a.insertAfter(b),b.select();return a.getLatest()};exports.$restoreEditorState=function(a,b){let c=new Map,f=a._pendingEditorState;for(let [d,e]of b._nodeMap){let h=g.$cloneWithProperties(e);n.$isTextNode(h)&&(h.__text=e.__text);c.set(d,h)}f&&(f._nodeMap=c);a._dirtyType=2;a=b._selection;n.$setSelection(null===a?null:a.clone())};exports.$wrapNodeInElement=function(a,b){b=b();a.replace(b);b.append(a);return b};
-exports.addClassNamesToElement=function(a,...b){b.forEach(c=>{"string"===typeof c&&(c=c.split(" ").filter(f=>""!==f),a.classList.add(...c))})};exports.isMimeType=p;
-exports.mediaFileReader=function(a,b){let c=a[Symbol.iterator]();return new Promise((f,d)=>{let e=[],h=()=>{const {done:m,value:k}=c.next();if(m)return f(e);const l=new FileReader;l.addEventListener("error",d);l.addEventListener("load",()=>{const q=l.result;"string"===typeof q&&e.push({file:k,result:q});h()});p(k,b)?l.readAsDataURL(k):h()};h()})};exports.mergeRegister=function(...a){return()=>{a.forEach(b=>b())}};
+exports.addClassNamesToElement=function(a,...b){b.forEach(c=>{"string"===typeof c&&(c=c.split(" ").filter(f=>""!==f),a.classList.add(...c))})};exports.isHTMLAnchorElement=function(a){return t(a)&&"A"===a.tagName};exports.isHTMLElement=t;exports.isMimeType=p;
+exports.mediaFileReader=function(a,b){let c=a[Symbol.iterator]();return new Promise((f,d)=>{let e=[],h=()=>{const {done:m,value:k}=c.next();if(m)return f(e);const l=new FileReader;l.addEventListener("error",d);l.addEventListener("load",()=>{const r=l.result;"string"===typeof r&&e.push({file:k,result:r});h()});p(k,b)?l.readAsDataURL(k):h()};h()})};exports.mergeRegister=function(...a){return()=>{a.forEach(b=>b())}};
 exports.registerNestedElementResolver=function(a,b,c,f){return a.registerNodeTransform(b,d=>{a:{var e=d.getChildren();for(var h=0;h<e.length;h++)if(e[h]instanceof b){e=null;break a}for(e=d;null!==e;)if(h=e,e=e.getParent(),e instanceof b){e={child:h,parent:e};break a}e=null}if(null!==e){const {child:m,parent:k}=e;if(m.is(d)){f(k,d);d=m.getNextSiblings();e=d.length;k.insertAfter(m);if(0!==e){h=c(k);m.insertAfter(h);for(let l=0;l<e;l++)h.append(d[l])}k.canBeEmpty()||0!==k.getChildrenSize()||k.remove()}}})};
 exports.removeClassNamesFromElement=function(a,...b){b.forEach(c=>{"string"===typeof c&&a.classList.remove(...c.split(" "))})}

package/index.d.ts

@@ -42,3 +42,5 @@ export declare function registerNestedElementResolver<N extends ElementNode>(edi
 export declare function $restoreEditorState(editor: LexicalEditor, editorState: EditorState): void;
 export declare function $insertNodeToNearestRoot<T extends LexicalNode>(node: T): T;
 export declare function $wrapNodeInElement(node: LexicalNode, createElementNode: () => ElementNode): ElementNode;
+export declare function isHTMLAnchorElement(x: Node): x is HTMLAnchorElement;
+export declare function isHTMLElement(x: Node | EventTarget): x is HTMLElement;

package/package.json

@@ -8,15 +8,15 @@
     "utils"
   ],
   "license": "MIT",
-  "version": "0.8.0",
+  "version": "0.9.0",
   "main": "LexicalUtils.js",
   "peerDependencies": {
-    "lexical": "0.8.0"
+    "lexical": "0.9.0"
   },
   "dependencies": {
-    "@lexical/list": "0.8.0",
-    "@lexical/table": "0.8.0",
-    "@lexical/selection": "0.8.0"
+    "@lexical/list": "0.9.0",
+    "@lexical/table": "0.9.0",
+    "@lexical/selection": "0.9.0"
   },
   "repository": {
     "type": "git",