@lexical/utils 0.1.15 → 0.1.18

package/LICENSE

@@ -1,6 +1,6 @@
 MIT License
 
-Copyright (c) 2020 Dominic Gannaway
+Copyright (c) Meta Platforms, Inc. and affiliates.
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

package/LexicalUtils.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+import type {LexicalNode} from 'lexical';
+export type DFSNode = $ReadOnly<{
+  depth: number;
+  node: LexicalNode;
+}>;
+declare function addClassNamesToElement(
+  element: HTMLElement,
+  ...classNames: Array<typeof undefined | boolean | null | string>
+): void;
+declare function removeClassNamesFromElement(
+  element: HTMLElement,
+  ...classNames: Array<string>
+): void;
+declare function $dfs(
+  startingNode?: LexicalNode,
+  endingNode?: LexicalNode,
+): Array<DFSNode>;
+declare function $getDepth(node: LexicalNode): number;
+declare function $getNearestNodeOfType<T extends LexicalNode>(
+  node: LexicalNode,
+  klass: Class<T>,
+): T | null;
+export type DOMNodeToLexicalConversion = (element: Node) => LexicalNode;
+export type DOMNodeToLexicalConversionMap = {
+  [string]: DOMNodeToLexicalConversion;
+};
+declare function $findMatchingParent(
+  startingNode: LexicalNode,
+  findFn: (LexicalNode) => boolean,
+): LexicalNode | null;
+type Func = () => void;
+declare function mergeRegister(...func: Array<Func>): () => void;

package/LexicalUtils.dev.js

@@ -108,23 +108,15 @@ function $findMatchingParent(startingNode, findFn) {
 
   return null;
 }
-function $areSiblingsNullOrSpace(node) {
-  return $isPreviousSiblingNullOrSpace(node) && $isNextSiblingNullOrSpace(node);
-}
-function $isPreviousSiblingNullOrSpace(node) {
-  const previousSibling = node.getPreviousSibling();
-  return previousSibling === null || lexical.$isLineBreakNode(previousSibling) || lexical.$isTextNode(previousSibling) && previousSibling.isSimpleText() && previousSibling.getTextContent().endsWith(' ');
-}
-function $isNextSiblingNullOrSpace(node) {
-  const nextSibling = node.getNextSibling();
-  return nextSibling === null || lexical.$isLineBreakNode(nextSibling) || lexical.$isTextNode(nextSibling) && nextSibling.isSimpleText() && nextSibling.getTextContent().startsWith(' ');
+function mergeRegister(...func) {
+  return () => {
+    func.forEach(f => f());
+  };
 }
 
-exports.$areSiblingsNullOrSpace = $areSiblingsNullOrSpace;
 exports.$dfs = $dfs;
 exports.$findMatchingParent = $findMatchingParent;
 exports.$getNearestNodeOfType = $getNearestNodeOfType;
-exports.$isNextSiblingNullOrSpace = $isNextSiblingNullOrSpace;
-exports.$isPreviousSiblingNullOrSpace = $isPreviousSiblingNullOrSpace;
 exports.addClassNamesToElement = addClassNamesToElement;
+exports.mergeRegister = mergeRegister;
 exports.removeClassNamesFromElement = removeClassNamesFromElement;

package/LexicalUtils.js.flow

@@ -0,0 +1,40 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * @flow strict
+ */
+import type {LexicalNode} from 'lexical';
+export type DFSNode = $ReadOnly<{
+  depth: number,
+  node: LexicalNode,
+}>;
+declare export function addClassNamesToElement(
+  element: HTMLElement,
+  ...classNames: Array<typeof undefined | boolean | null | string>
+): void;
+declare export function removeClassNamesFromElement(
+  element: HTMLElement,
+  ...classNames: Array<string>
+): void;
+declare export function $dfs(
+  startingNode?: LexicalNode,
+  endingNode?: LexicalNode,
+): Array<DFSNode>;
+declare function $getDepth(node: LexicalNode): number;
+declare export function $getNearestNodeOfType<T: LexicalNode>(
+  node: LexicalNode,
+  klass: Class<T>,
+): T | null;
+export type DOMNodeToLexicalConversion = (element: Node) => LexicalNode;
+export type DOMNodeToLexicalConversionMap = {
+  [string]: DOMNodeToLexicalConversion,
+};
+declare export function $findMatchingParent(
+  startingNode: LexicalNode,
+  findFn: (LexicalNode) => boolean,
+): LexicalNode | null;
+type Func = () => void;
+declare export function mergeRegister(...func: Array<Func>): () => void;

package/LexicalUtils.prod.js

@@ -4,6 +4,5 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  */
-var d=require("lexical");function g(a){a=a.getPreviousSibling();return null===a||d.$isLineBreakNode(a)||d.$isTextNode(a)&&a.isSimpleText()&&a.getTextContent().endsWith(" ")}function h(a){a=a.getNextSibling();return null===a||d.$isLineBreakNode(a)||d.$isTextNode(a)&&a.isSimpleText()&&a.getTextContent().startsWith(" ")}exports.$areSiblingsNullOrSpace=function(a){return g(a)&&h(a)};
-exports.$dfs=function(a,b){const c=[];a=(a||d.$getRoot()).getLatest();b=b||(d.$isElementNode(a)?a.getLastDescendant():a);for(var e=a,f=0;null!==(e=e.getParent());)f++;for(e=f;null!==a&&!a.is(b);)if(c.push({depth:e,node:a}),d.$isElementNode(a)&&0<a.getChildrenSize())a=a.getFirstChild(),e++;else for(f=null;null===f&&null!==a;)f=a.getNextSibling(),null===f?(a=a.getParent(),e--):a=f;null!==a&&a.is(b)&&c.push({depth:e,node:a});return c};
-exports.$findMatchingParent=function(a,b){for(;a!==d.$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.$isNextSiblingNullOrSpace=h;exports.$isPreviousSiblingNullOrSpace=g;exports.addClassNamesToElement=function(a,...b){b.forEach(c=>{null!=c&&"string"===typeof c&&a.classList.add(...c.split(" "))})};exports.removeClassNamesFromElement=function(a,...b){b.forEach(c=>{a.classList.remove(...c.split(" "))})};
+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(" "))})};

package/package.json

@@ -1,9 +1,5 @@
 {
   "name": "@lexical/utils",
-  "author": {
-    "name": "Dominic Gannaway",
-    "email": "dg@domgan.com"
-  },
   "description": "This package contains misc utilities for Lexical.",
   "keywords": [
     "lexical",
@@ -12,14 +8,14 @@
     "utils"
   ],
   "license": "MIT",
-  "version": "0.1.15",
+  "version": "0.1.18",
   "main": "LexicalUtils.js",
   "peerDependencies": {
-    "lexical": "0.1.15"
+    "lexical": "0.1.18"
   },
   "dependencies": {
-    "@lexical/list": "0.1.15",
-    "@lexical/table": "0.1.15"
+    "@lexical/list": "0.1.18",
+    "@lexical/table": "0.1.18"
   },
   "repository": {
     "type": "git",