@lexical/utils 0.3.7 → 0.3.10

package/LexicalUtils.dev.js

@@ -94,7 +94,7 @@ function $getNearestNodeOfType(node, klass) {
     parent = parent.getParent();
   }
 
-  return parent;
+  return null;
 }
 function $getNearestBlockElementAncestorOrThrow(startNode) {
   const blockNode = $findMatchingParent(startNode, node => lexical.$isElementNode(node) && !node.isInline());
@@ -322,11 +322,31 @@ function $restoreEditorState(editor, editorState) {
   const selection = editorState._selection;
   lexical.$setSelection(selection === null ? null : selection.clone());
 }
+function $insertBlockNode(node) {
+  const selection = lexical.$getSelection();
+
+  if (lexical.$isRangeSelection(selection)) {
+    const focusNode = selection.focus.getNode();
+    focusNode.getTopLevelElementOrThrow().insertAfter(node);
+  } else if (lexical.$isNodeSelection(selection) || lexical.$isGridSelection(selection)) {
+    const nodes = selection.getNodes();
+    nodes[nodes.length - 1].getTopLevelElementOrThrow().insertAfter(node);
+  } else {
+    const root = lexical.$getRoot();
+    root.append(node);
+  }
+
+  const paragraphNode = lexical.$createParagraphNode();
+  node.insertAfter(paragraphNode);
+  paragraphNode.select();
+  return node.getLatest();
+}
 
 exports.$dfs = $dfs;
 exports.$findMatchingParent = $findMatchingParent;
 exports.$getNearestBlockElementAncestorOrThrow = $getNearestBlockElementAncestorOrThrow;
 exports.$getNearestNodeOfType = $getNearestNodeOfType;
+exports.$insertBlockNode = $insertBlockNode;
 exports.$restoreEditorState = $restoreEditorState;
 exports.addClassNamesToElement = addClassNamesToElement;
 exports.mergeRegister = mergeRegister;

package/LexicalUtils.js.flow

@@ -63,3 +63,5 @@ declare export function $restoreEditorState(
   editor: LexicalEditor,
   editorState: EditorState,
 ): void;
+
+declare export function $insertBlockNode<T: LexicalNode>(node: T): T;

package/LexicalUtils.prod.js

@@ -9,7 +9,8 @@ function q(a,b,e,f,d){var c=e._nodes.get(a.__type);void 0===c&&n(5);for(var h in
 c.__indent=a.__indent;c.__format=a.__format;c.__dir=a.__dir}else l.$isTextNode(c)&&(c.__format=a.__format,c.__style=a.__style,c.__mode=a.__mode,c.__detail=a.__detail);return c}
 function t(a,b){let e=b._editorState.constructor,f=new Map,d=new e(f),c=new Map(a._nodeMap),h=c.get("root");a=b._updating;try{b._updating=!1,b.update(()=>{let k=b._dirtyElements,g=b._dirtyLeaves,m=b._dirtyType;b._dirtyElements=new Map;b._dirtyLeaves=new Set;b._dirtyType=0;try{q(h,c,b,null,d)}finally{b._dirtyElements=k,b._dirtyLeaves=g,b._dirtyType=m}})}finally{b._updating=a}d._readOnly=!0;return d}function r(a,b){b="string"===typeof b?JSON.parse(b):b;return t(b,a)}
 exports.$dfs=function(a,b){let e=[];a=(a||l.$getRoot()).getLatest();b=b||(l.$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(e.push({depth:f,node:a}),l.$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)&&e.push({depth:f,node:a});return e};exports.$findMatchingParent=p;
-exports.$getNearestBlockElementAncestorOrThrow=function(a){a=p(a,b=>l.$isElementNode(b)&&!b.isInline());l.$isElementNode(a)||n(4);return a};exports.$getNearestNodeOfType=function(a,b){for(;null!=a&&!(a instanceof b);)a=a.getParent();return a};exports.$restoreEditorState=function(a,b){let e=new Map(b._nodeMap),f=a._pendingEditorState;f&&(f._nodeMap=e);a._dirtyType=2;a=b._selection;l.$setSelection(null===a?null:a.clone())};
-exports.addClassNamesToElement=function(a,...b){b.forEach(e=>{"string"===typeof e&&a.classList.add(...e.split(" "))})};exports.mergeRegister=function(...a){return()=>{a.forEach(b=>b())}};
+exports.$getNearestBlockElementAncestorOrThrow=function(a){a=p(a,b=>l.$isElementNode(b)&&!b.isInline());l.$isElementNode(a)||n(4);return a};exports.$getNearestNodeOfType=function(a,b){for(;null!=a;){if(a instanceof b)return a;a=a.getParent()}return null};
+exports.$insertBlockNode=function(a){var b=l.$getSelection();l.$isRangeSelection(b)?b.focus.getNode().getTopLevelElementOrThrow().insertAfter(a):l.$isNodeSelection(b)||l.$isGridSelection(b)?(b=b.getNodes(),b[b.length-1].getTopLevelElementOrThrow().insertAfter(a)):l.$getRoot().append(a);b=l.$createParagraphNode();a.insertAfter(b);b.select();return a.getLatest()};
+exports.$restoreEditorState=function(a,b){let e=new Map(b._nodeMap),f=a._pendingEditorState;f&&(f._nodeMap=e);a._dirtyType=2;a=b._selection;l.$setSelection(null===a?null:a.clone())};exports.addClassNamesToElement=function(a,...b){b.forEach(e=>{"string"===typeof e&&a.classList.add(...e.split(" "))})};exports.mergeRegister=function(...a){return()=>{a.forEach(b=>b())}};
 exports.registerNestedElementResolver=function(a,b,e,f){return a.registerNodeTransform(b,d=>{a:{var c=d.getChildren();for(var h=0;h<c.length;h++)if(c[h]instanceof b){c=null;break a}for(c=d;null!==c;)if(h=c,c=c.getParent(),c instanceof b){c={child:h,parent:c};break a}c=null}if(null!==c){const {child:k,parent:g}=c;if(k.is(d)){f(g,d);d=k.getNextSiblings();c=d.length;g.insertAfter(k);if(0!==c){h=e(g);k.insertAfter(h);for(let m=0;m<c;m++)h.append(d[m])}g.canBeEmpty()||0!==g.getChildrenSize()||g.remove()}}})};
 exports.removeClassNamesFromElement=function(a,...b){b.forEach(e=>{"string"===typeof e&&a.classList.remove(...e.split(" "))})};exports.unstable_convertLegacyJSONEditorState=r

package/index.d.ts

@@ -5,7 +5,7 @@
  * LICENSE file in the root directory of this source tree.
  *
  */
-import type { EditorState, ElementNode, Klass, LexicalEditor, LexicalNode } from 'lexical';
+import { EditorState, ElementNode, Klass, LexicalEditor, LexicalNode } from 'lexical';
 export declare type DFSNode = Readonly<{
     depth: number;
     node: LexicalNode;
@@ -13,7 +13,7 @@ export declare type DFSNode = Readonly<{
 export declare function addClassNamesToElement(element: HTMLElement, ...classNames: Array<typeof undefined | boolean | null | string>): void;
 export declare function removeClassNamesFromElement(element: HTMLElement, ...classNames: Array<typeof undefined | boolean | null | string>): void;
 export declare function $dfs(startingNode?: LexicalNode, endingNode?: LexicalNode): Array<DFSNode>;
-export declare function $getNearestNodeOfType<T extends ElementNode>(node: LexicalNode, klass: Klass<T>): LexicalNode | null;
+export declare function $getNearestNodeOfType<T extends ElementNode>(node: LexicalNode, klass: Klass<T>): T | null;
 export declare function $getNearestBlockElementAncestorOrThrow(startNode: LexicalNode): ElementNode;
 export declare type DOMNodeToLexicalConversion = (element: Node) => LexicalNode;
 export declare type DOMNodeToLexicalConversionMap = Record<string, DOMNodeToLexicalConversion>;
@@ -23,4 +23,5 @@ export declare function mergeRegister(...func: Array<Func>): () => void;
 export declare function registerNestedElementResolver<N extends ElementNode>(editor: LexicalEditor, targetNode: Klass<N>, cloneNode: (from: N) => N, handleOverlap: (from: N, to: N) => void): () => void;
 export declare function unstable_convertLegacyJSONEditorState(editor: LexicalEditor, maybeStringifiedEditorState: string): EditorState;
 export declare function $restoreEditorState(editor: LexicalEditor, editorState: EditorState): void;
+export declare function $insertBlockNode<T extends LexicalNode>(node: T): T;
 export {};

package/package.json

@@ -8,14 +8,14 @@
     "utils"
   ],
   "license": "MIT",
-  "version": "0.3.7",
+  "version": "0.3.10",
   "main": "LexicalUtils.js",
   "peerDependencies": {
-    "lexical": "0.3.7"
+    "lexical": "0.3.10"
   },
   "dependencies": {
-    "@lexical/list": "0.3.7",
-    "@lexical/table": "0.3.7"
+    "@lexical/list": "0.3.10",
+    "@lexical/table": "0.3.10"
   },
   "repository": {
     "type": "git",