@lexical/utils 0.1.19 → 0.1.20

package/LexicalUtils.d.ts

@@ -5,7 +5,7 @@
  * LICENSE file in the root directory of this source tree.
  *
  */
-import type {LexicalNode} from 'lexical';
+import type {LexicalNode, ElementNode} from 'lexical';
 export type DFSNode = $ReadOnly<{
   depth: number;
   node: LexicalNode;
@@ -37,3 +37,6 @@ declare function $findMatchingParent(
 ): LexicalNode | null;
 type Func = () => void;
 declare function mergeRegister(...func: Array<Func>): () => void;
+declare function $getNearestBlockElementAncestorOrThrow(
+  startNode: LexicalNode,
+): ElementNode;

package/LexicalUtils.dev.js

@@ -95,6 +95,17 @@ function $getNearestNodeOfType(node, klass) {
 
   return parent;
 }
+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;
 
@@ -116,6 +127,7 @@ function mergeRegister(...func) {
 
 exports.$dfs = $dfs;
 exports.$findMatchingParent = $findMatchingParent;
+exports.$getNearestBlockElementAncestorOrThrow = $getNearestBlockElementAncestorOrThrow;
 exports.$getNearestNodeOfType = $getNearestNodeOfType;
 exports.addClassNamesToElement = addClassNamesToElement;
 exports.mergeRegister = mergeRegister;

package/LexicalUtils.js.flow

@@ -6,7 +6,7 @@
  *
  * @flow strict
  */
-import type {LexicalNode} from 'lexical';
+import type {LexicalNode, ElementNode} from 'lexical';
 export type DFSNode = $ReadOnly<{
   depth: number,
   node: LexicalNode,
@@ -38,3 +38,6 @@ declare export function $findMatchingParent(
 ): LexicalNode | null;
 type Func = () => void;
 declare export function mergeRegister(...func: Array<Func>): () => void;
+declare export function $getNearestBlockElementAncestorOrThrow(
+  startNode: LexicalNode,
+): ElementNode;

package/LexicalUtils.prod.js

@@ -4,5 +4,7 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  */
-var f=require("lexical");exports.$dfs=function(a,b){const c=[];a=(a||f.$getRoot()).getLatest();b=b||(f.$isElementNode(a)?a.getLastDescendant():a);for(var d=a,e=0;null!==(d=d.getParent());)e++;for(d=e;null!==a&&!a.is(b);)if(c.push({depth:d,node:a}),f.$isElementNode(a)&&0<a.getChildrenSize())a=a.getFirstChild(),d++;else for(e=null;null===e&&null!==a;)e=a.getNextSibling(),null===e?(a=a.getParent(),d--):a=e;null!==a&&a.is(b)&&c.push({depth:d,node:a});return c};
-exports.$findMatchingParent=function(a,b){for(;a!==f.$getRoot()&&null!=a;){if(b(a))return a;a=a.getParent()}return null};exports.$getNearestNodeOfType=function(a,b){for(;null!=a&&!(a instanceof b);)a=a.getParent();return a};exports.addClassNamesToElement=function(a,...b){b.forEach(c=>{null!=c&&"string"===typeof c&&a.classList.add(...c.split(" "))})};exports.mergeRegister=function(...a){return()=>{a.forEach(b=>b())}};exports.removeClassNamesFromElement=function(a,...b){b.forEach(c=>{a.classList.remove(...c.split(" "))})};
+var f=require("lexical");function g(a,b){for(;a!==f.$getRoot()&&null!=a;){if(b(a))return a;a=a.getParent()}return null}
+exports.$dfs=function(a,b){const c=[];a=(a||f.$getRoot()).getLatest();b=b||(f.$isElementNode(a)?a.getLastDescendant():a);for(var d=a,e=0;null!==(d=d.getParent());)e++;for(d=e;null!==a&&!a.is(b);)if(c.push({depth:d,node:a}),f.$isElementNode(a)&&0<a.getChildrenSize())a=a.getFirstChild(),d++;else for(e=null;null===e&&null!==a;)e=a.getNextSibling(),null===e?(a=a.getParent(),d--):a=e;null!==a&&a.is(b)&&c.push({depth:d,node:a});return c};exports.$findMatchingParent=g;
+exports.$getNearestBlockElementAncestorOrThrow=function(a){const b=g(a,c=>f.$isElementNode(c)&&!c.isInline());if(!f.$isElementNode(b))throw Error(`Expected node ${a.__key} to have closest block element node.`);return b};exports.$getNearestNodeOfType=function(a,b){for(;null!=a&&!(a instanceof b);)a=a.getParent();return a};exports.addClassNamesToElement=function(a,...b){b.forEach(c=>{null!=c&&"string"===typeof c&&a.classList.add(...c.split(" "))})};
+exports.mergeRegister=function(...a){return()=>{a.forEach(b=>b())}};exports.removeClassNamesFromElement=function(a,...b){b.forEach(c=>{a.classList.remove(...c.split(" "))})};

package/package.json

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