Get node performance list normalization (#1707)

* improve performance of list normalizations

* add changeset

* fix return type

* better error handling

* better error handling, take 3

.changeset/curvy-clocks-knock.md

@@ -0,0 +1,5 @@
+---
+'@udecode/plate-core': patch
+---
+
+improve performance of list normalizations

packages/core/src/slate/node/getNode.ts

@@ -1,18 +1,31 @@
-import { Node, Path } from 'slate';
+import { Path } from 'slate';
+import { isText } from '../text';
 import { NodeOf, TNode } from './TNode';
 
 /**
  * Get the descendant node referred to by a specific path.
  * If the path is an empty array, it refers to the root node itself.
  * If the node is not found, return null.
+ * Based on Slate get and has, performance optimization without overhead of
+ * stringify on throwing
  */
 export const getNode = <N extends NodeOf<R>, R extends TNode = TNode>(
   root: R,
   path: Path
 ) => {
   try {
-    return Node.get(root, path) as N;
-  } catch (err) {
+    for (let i = 0; i < path.length; i++) {
+      const p = path[i];
+
+      if (isText(root) || !root.children[p]) {
+        return null;
+      }
+
+      root = root.children[p] as R;
+    }
+
+    return root as N;
+  } catch (e) {
     return null;
   }
 };