@lexical/list 0.48.0 → 0.48.1-nightly.20260720.0

package/dist/LexicalList.dev.js

@@ -102,7 +102,7 @@ function $getAllListItems(node) {
  * @param node - The node to be checked.
  * @returns true if the node is a ListItemNode and has a ListNode child, false otherwise.
  */
-function isNestedListNode(node) {
+function $isNestedListNode(node) {
   return $isListItemNode(node) && $isListNode(node.getFirstChild());
 }
 
@@ -273,7 +273,7 @@ function $createListOrMerge(node, listType) {
 function mergeLists(list1, list2) {
   const listItem1 = list1.getLastChild();
   const listItem2 = list2.getFirstChild();
-  if (listItem1 && listItem2 && isNestedListNode(listItem1) && isNestedListNode(listItem2)) {
+  if (listItem1 && listItem2 && $isNestedListNode(listItem1) && $isNestedListNode(listItem2)) {
     mergeLists(listItem1.getFirstChild(), listItem2.getFirstChild());
     listItem2.remove();
   }
@@ -382,7 +382,7 @@ function mergeNextSiblingListIfSameType(list) {
 function $handleIndent(listItemNode) {
   // go through each node and decide where to move it.
   const removed = new Set();
-  if (isNestedListNode(listItemNode) || removed.has(listItemNode.getKey())) {
+  if ($isNestedListNode(listItemNode) || removed.has(listItemNode.getKey())) {
     return;
   }
   const parent = listItemNode.getParent();
@@ -390,7 +390,7 @@ function $handleIndent(listItemNode) {
   const previousSibling = listItemNode.getPreviousSibling();
   // if there are nested lists on either side, merge them all together.
 
-  if (isNestedListNode(nextSibling) && isNestedListNode(previousSibling)) {
+  if ($isNestedListNode(nextSibling) && $isNestedListNode(previousSibling)) {
     const innerList = previousSibling.getFirstChild();
     if ($isListNode(innerList)) {
       innerList.append(listItemNode);
@@ -402,7 +402,7 @@ function $handleIndent(listItemNode) {
         removed.add(nextSibling.getKey());
       }
     }
-  } else if (isNestedListNode(nextSibling)) {
+  } else if ($isNestedListNode(nextSibling)) {
     // if the ListItemNode is next to a nested ListNode, merge them
     const innerList = nextSibling.getFirstChild();
     if ($isListNode(innerList)) {
@@ -411,7 +411,7 @@ function $handleIndent(listItemNode) {
         firstChild.insertBefore(listItemNode);
       }
     }
-  } else if (isNestedListNode(previousSibling)) {
+  } else if ($isNestedListNode(previousSibling)) {
     const innerList = previousSibling.getFirstChild();
     if ($isListNode(innerList)) {
       innerList.append(listItemNode);
@@ -444,7 +444,7 @@ function $handleIndent(listItemNode) {
 function $handleOutdent(listItemNode) {
   // go through each node and decide where to move it.
 
-  if (isNestedListNode(listItemNode)) {
+  if ($isNestedListNode(listItemNode)) {
     return;
   }
   const parentList = listItemNode.getParent();
@@ -677,7 +677,7 @@ class ListItemNode extends lexical.ElementNode {
     if (direction) {
       element.dir = direction;
     }
-    if (isNestedListNode(this)) {
+    if ($isNestedListNode(this)) {
       return {
         after(containerElement) {
           if (lexical.isHTMLElement(containerElement)) {
@@ -798,7 +798,7 @@ class ListItemNode extends lexical.ElementNode {
     const prevSibling = this.getPreviousSibling();
     const nextSibling = this.getNextSibling();
     super.remove(preserveEmptyParent);
-    if (prevSibling && nextSibling && isNestedListNode(prevSibling) && isNestedListNode(nextSibling)) {
+    if (prevSibling && nextSibling && $isNestedListNode(prevSibling) && $isNestedListNode(nextSibling)) {
       mergeLists(prevSibling.getFirstChild(), nextSibling.getFirstChild());
       nextSibling.remove();
     }
@@ -815,7 +815,7 @@ class ListItemNode extends lexical.ElementNode {
     return newElement;
   }
   collapseAtStart(selection) {
-    if (isNestedListNode(this)) {
+    if ($isNestedListNode(this)) {
       return false;
     }
     const listNode = this.getParentOrThrow();

package/dist/LexicalList.dev.mjs

@@ -100,7 +100,7 @@ function $getAllListItems(node) {
  * @param node - The node to be checked.
  * @returns true if the node is a ListItemNode and has a ListNode child, false otherwise.
  */
-function isNestedListNode(node) {
+function $isNestedListNode(node) {
   return $isListItemNode(node) && $isListNode(node.getFirstChild());
 }
 
@@ -271,7 +271,7 @@ function $createListOrMerge(node, listType) {
 function mergeLists(list1, list2) {
   const listItem1 = list1.getLastChild();
   const listItem2 = list2.getFirstChild();
-  if (listItem1 && listItem2 && isNestedListNode(listItem1) && isNestedListNode(listItem2)) {
+  if (listItem1 && listItem2 && $isNestedListNode(listItem1) && $isNestedListNode(listItem2)) {
     mergeLists(listItem1.getFirstChild(), listItem2.getFirstChild());
     listItem2.remove();
   }
@@ -380,7 +380,7 @@ function mergeNextSiblingListIfSameType(list) {
 function $handleIndent(listItemNode) {
   // go through each node and decide where to move it.
   const removed = new Set();
-  if (isNestedListNode(listItemNode) || removed.has(listItemNode.getKey())) {
+  if ($isNestedListNode(listItemNode) || removed.has(listItemNode.getKey())) {
     return;
   }
   const parent = listItemNode.getParent();
@@ -388,7 +388,7 @@ function $handleIndent(listItemNode) {
   const previousSibling = listItemNode.getPreviousSibling();
   // if there are nested lists on either side, merge them all together.
 
-  if (isNestedListNode(nextSibling) && isNestedListNode(previousSibling)) {
+  if ($isNestedListNode(nextSibling) && $isNestedListNode(previousSibling)) {
     const innerList = previousSibling.getFirstChild();
     if ($isListNode(innerList)) {
       innerList.append(listItemNode);
@@ -400,7 +400,7 @@ function $handleIndent(listItemNode) {
         removed.add(nextSibling.getKey());
       }
     }
-  } else if (isNestedListNode(nextSibling)) {
+  } else if ($isNestedListNode(nextSibling)) {
     // if the ListItemNode is next to a nested ListNode, merge them
     const innerList = nextSibling.getFirstChild();
     if ($isListNode(innerList)) {
@@ -409,7 +409,7 @@ function $handleIndent(listItemNode) {
         firstChild.insertBefore(listItemNode);
       }
     }
-  } else if (isNestedListNode(previousSibling)) {
+  } else if ($isNestedListNode(previousSibling)) {
     const innerList = previousSibling.getFirstChild();
     if ($isListNode(innerList)) {
       innerList.append(listItemNode);
@@ -442,7 +442,7 @@ function $handleIndent(listItemNode) {
 function $handleOutdent(listItemNode) {
   // go through each node and decide where to move it.
 
-  if (isNestedListNode(listItemNode)) {
+  if ($isNestedListNode(listItemNode)) {
     return;
   }
   const parentList = listItemNode.getParent();
@@ -675,7 +675,7 @@ class ListItemNode extends ElementNode {
     if (direction) {
       element.dir = direction;
     }
-    if (isNestedListNode(this)) {
+    if ($isNestedListNode(this)) {
       return {
         after(containerElement) {
           if (isHTMLElement(containerElement)) {
@@ -796,7 +796,7 @@ class ListItemNode extends ElementNode {
     const prevSibling = this.getPreviousSibling();
     const nextSibling = this.getNextSibling();
     super.remove(preserveEmptyParent);
-    if (prevSibling && nextSibling && isNestedListNode(prevSibling) && isNestedListNode(nextSibling)) {
+    if (prevSibling && nextSibling && $isNestedListNode(prevSibling) && $isNestedListNode(nextSibling)) {
       mergeLists(prevSibling.getFirstChild(), nextSibling.getFirstChild());
       nextSibling.remove();
     }
@@ -813,7 +813,7 @@ class ListItemNode extends ElementNode {
     return newElement;
   }
   collapseAtStart(selection) {
-    if (isNestedListNode(this)) {
+    if ($isNestedListNode(this)) {
       return false;
     }
     const listNode = this.getParentOrThrow();

package/dist/utils.d.ts

@@ -38,7 +38,7 @@ declare const NestedListNodeBrand: unique symbol;
  * @param node - The node to be checked.
  * @returns true if the node is a ListItemNode and has a ListNode child, false otherwise.
  */
-export declare function isNestedListNode(node: LexicalNode | null | undefined): node is Spread<{
+export declare function $isNestedListNode(node: LexicalNode | null | undefined): node is Spread<{
     getFirstChild(): ListNode;
     [NestedListNodeBrand]: never;
 }, ListItemNode>;

package/package.json

@@ -8,15 +8,15 @@
     "list"
   ],
   "license": "MIT",
-  "version": "0.48.0",
+  "version": "0.48.1-nightly.20260720.0",
   "main": "./dist/LexicalList.js",
   "types": "./dist/typescript-too-old.d.ts",
   "dependencies": {
-    "@lexical/extension": "0.48.0",
-    "@lexical/html": "0.48.0",
-    "@lexical/internal": "0.48.0",
-    "lexical": "0.48.0",
-    "@lexical/utils": "0.48.0"
+    "@lexical/extension": "0.48.1-nightly.20260720.0",
+    "@lexical/internal": "0.48.1-nightly.20260720.0",
+    "@lexical/html": "0.48.1-nightly.20260720.0",
+    "@lexical/utils": "0.48.1-nightly.20260720.0",
+    "lexical": "0.48.1-nightly.20260720.0"
   },
   "repository": {
     "type": "git",

package/src/LexicalListItemNode.ts

@@ -47,7 +47,7 @@ import {
 
 import {$createListNode, $isListNode, type ListNode, type ListType} from './';
 import {$handleIndent, $handleOutdent, mergeLists} from './formatList';
-import {isNestedListNode} from './utils';
+import {$isNestedListNode} from './utils';
 
 export type SerializedListItemNode = Spread<
   {
@@ -218,7 +218,7 @@ export class ListItemNode extends ElementNode {
       element.dir = direction;
     }
 
-    if (isNestedListNode(this)) {
+    if ($isNestedListNode(this)) {
       return {
         after(containerElement) {
           if (isHTMLElement(containerElement)) {
@@ -371,8 +371,8 @@ export class ListItemNode extends ElementNode {
     if (
       prevSibling &&
       nextSibling &&
-      isNestedListNode(prevSibling) &&
-      isNestedListNode(nextSibling)
+      $isNestedListNode(prevSibling) &&
+      $isNestedListNode(nextSibling)
     ) {
       mergeLists(prevSibling.getFirstChild(), nextSibling.getFirstChild());
       nextSibling.remove();
@@ -398,7 +398,7 @@ export class ListItemNode extends ElementNode {
   }
 
   collapseAtStart(selection: RangeSelection): boolean {
-    if (isNestedListNode(this)) {
+    if ($isNestedListNode(this)) {
       return false;
     }
 

package/src/formatList.ts

@@ -40,8 +40,8 @@ import {
   $getAllListItems,
   $getNewListStart,
   $getTopListNode,
+  $isNestedListNode,
   $removeHighestEmptyListParent,
-  isNestedListNode,
 } from './utils';
 
 function $isSelectingEmptyListItem(
@@ -229,8 +229,8 @@ export function mergeLists(list1: ListNode, list2: ListNode): void {
   if (
     listItem1 &&
     listItem2 &&
-    isNestedListNode(listItem1) &&
-    isNestedListNode(listItem2)
+    $isNestedListNode(listItem1) &&
+    $isNestedListNode(listItem2)
   ) {
     mergeLists(listItem1.getFirstChild(), listItem2.getFirstChild());
     listItem2.remove();
@@ -364,7 +364,7 @@ export function $handleIndent(listItemNode: ListItemNode): void {
   // go through each node and decide where to move it.
   const removed = new Set<NodeKey>();
 
-  if (isNestedListNode(listItemNode) || removed.has(listItemNode.getKey())) {
+  if ($isNestedListNode(listItemNode) || removed.has(listItemNode.getKey())) {
     return;
   }
 
@@ -374,7 +374,7 @@ export function $handleIndent(listItemNode: ListItemNode): void {
   const previousSibling = listItemNode.getPreviousSibling();
   // if there are nested lists on either side, merge them all together.
 
-  if (isNestedListNode(nextSibling) && isNestedListNode(previousSibling)) {
+  if ($isNestedListNode(nextSibling) && $isNestedListNode(previousSibling)) {
     const innerList = previousSibling.getFirstChild();
 
     if ($isListNode(innerList)) {
@@ -388,7 +388,7 @@ export function $handleIndent(listItemNode: ListItemNode): void {
         removed.add(nextSibling.getKey());
       }
     }
-  } else if (isNestedListNode(nextSibling)) {
+  } else if ($isNestedListNode(nextSibling)) {
     // if the ListItemNode is next to a nested ListNode, merge them
     const innerList = nextSibling.getFirstChild();
 
@@ -399,7 +399,7 @@ export function $handleIndent(listItemNode: ListItemNode): void {
         firstChild.insertBefore(listItemNode);
       }
     }
-  } else if (isNestedListNode(previousSibling)) {
+  } else if ($isNestedListNode(previousSibling)) {
     const innerList = previousSibling.getFirstChild();
 
     if ($isListNode(innerList)) {
@@ -434,7 +434,7 @@ export function $handleIndent(listItemNode: ListItemNode): void {
 export function $handleOutdent(listItemNode: ListItemNode): void {
   // go through each node and decide where to move it.
 
-  if (isNestedListNode(listItemNode)) {
+  if ($isNestedListNode(listItemNode)) {
     return;
   }
   const parentList = listItemNode.getParent();

package/src/utils.ts

@@ -137,7 +137,7 @@ const NestedListNodeBrand: unique symbol = Symbol.for(
  * @param node - The node to be checked.
  * @returns true if the node is a ListItemNode and has a ListNode child, false otherwise.
  */
-export function isNestedListNode(
+export function $isNestedListNode(
   node: LexicalNode | null | undefined,
 ): node is Spread<
   {getFirstChild(): ListNode; [NestedListNodeBrand]: never},