@lexical/list 0.1.16 → 0.1.17

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/LexicalList.d.ts

@@ -0,0 +1,50 @@
+/**
+ * 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 {ListNodeTagType} from './src/LexicalListNode';
+import {
+  ElementNode,
+  LexicalNode,
+  LexicalEditor,
+  ParagraphNode,
+  RangeSelection,
+  LexicalCommand,
+} from 'lexical';
+
+export function $createListItemNode(): ListItemNode;
+export function $createListNode(tag: ListNodeTagType, start?: number): ListNode;
+export function $getListDepth(listNode: ListNode): number;
+export function $handleListInsertParagraph(): boolean;
+export function $isListItemNode(node?: LexicalNode): boolean;
+export function $isListNode(node?: LexicalNode): boolean;
+export function indentList(): boolean;
+export function insertList(editor: LexicalEditor, listType: 'ul' | 'ol'): void;
+export declare class ListItemNode extends ElementNode {
+  append(...nodes: LexicalNode[]): ListItemNode;
+  replace<N extends LexicalNode>(replaceWithNode: N): N;
+  insertAfter(node: LexicalNode): LexicalNode;
+  insertNewAfter(): ListItemNode | ParagraphNode;
+  collapseAtStart(selection: RangeSelection): true;
+  getIndent(): number;
+  setIndent(indent: number): this;
+  insertBefore(nodeToInsert: LexicalNode): LexicalNode;
+  canInsertAfter(node: LexicalNode): boolean;
+  canReplaceWith(replacement: LexicalNode): boolean;
+  canMergeWith(node: LexicalNode): boolean;
+}
+export declare class ListNode extends ElementNode {
+  canBeEmpty(): false;
+  append(...nodesToAppend: LexicalNode[]): ListNode;
+  getTag(): ListNodeTagType;
+}
+export function outdentList(): boolean;
+export function removeList(editor: LexicalEditor): boolean;
+
+export var INSERT_UNORDERED_LIST_COMMAND: LexicalCommand<void>;
+export var INSERT_ORDERED_LIST_COMMAND: LexicalCommand<void>;
+export var REMOVE_LIST_COMMAND: LexicalCommand<void>;

package/LexicalList.dev.js

@@ -6,9 +6,9 @@
  */
 'use strict';
 
-var list = require('@lexical/list');
-var utils = require('@lexical/utils');
 var lexical = require('lexical');
+var utils = require('@lexical/utils');
+var list = require('@lexical/list');
 
 /**
  * Copyright (c) Meta Platforms, Inc. and affiliates.
@@ -23,10 +23,10 @@ function $getListDepth(listNode) {
   let parent = listNode.getParent();
 
   while (parent != null) {
-    if (list.$isListItemNode(parent)) {
+    if ($isListItemNode(parent)) {
       const parentList = parent.getParent();
 
-      if (list.$isListNode(parentList)) {
+      if ($isListNode(parentList)) {
         depth++;
         parent = parentList.getParent();
         continue;
@@ -43,37 +43,37 @@ function $getListDepth(listNode) {
   return depth;
 }
 function $getTopListNode(listItem) {
-  let list$1 = listItem.getParent();
+  let list = listItem.getParent();
 
-  if (!list.$isListNode(list$1)) {
+  if (!$isListNode(list)) {
     {
       throw Error(`A ListItemNode must have a ListNode for a parent.`);
     }
   }
 
-  let parent = list$1;
+  let parent = list;
 
   while (parent !== null) {
     parent = parent.getParent();
 
-    if (list.$isListNode(parent)) {
-      list$1 = parent;
+    if ($isListNode(parent)) {
+      list = parent;
     }
   }
 
-  return list$1;
+  return list;
 }
 
 function $getAllListItems(node) {
   let listItemNodes = []; //$FlowFixMe - the result of this will always be an array of ListItemNodes.
 
-  const listChildren = node.getChildren().filter(list.$isListItemNode);
+  const listChildren = node.getChildren().filter($isListItemNode);
 
   for (let i = 0; i < listChildren.length; i++) {
     const listItemNode = listChildren[i];
     const firstChild = listItemNode.getFirstChild();
 
-    if (list.$isListNode(firstChild)) {
+    if ($isListNode(firstChild)) {
       listItemNodes = listItemNodes.concat($getAllListItems(firstChild));
     } else {
       listItemNodes.push(listItemNode);
@@ -83,13 +83,13 @@ function $getAllListItems(node) {
   return listItemNodes;
 }
 function isNestedListNode(node) {
-  return list.$isListItemNode(node) && list.$isListNode(node.getFirstChild());
+  return $isListItemNode(node) && $isListNode(node.getFirstChild());
 }
 function findNearestListItemNode(node) {
   let currentNode = node;
 
   while (currentNode !== null) {
-    if (list.$isListItemNode(currentNode)) {
+    if ($isListItemNode(currentNode)) {
       return currentNode;
     }
 
@@ -104,7 +104,7 @@ function getUniqueListItemNodes(nodeList) {
   for (let i = 0; i < nodeList.length; i++) {
     const node = nodeList[i];
 
-    if (list.$isListItemNode(node)) {
+    if ($isListItemNode(node)) {
       keys.add(node);
     }
   }
@@ -123,7 +123,7 @@ function $removeHighestEmptyListParent(sublist) {
   while (emptyListPtr.getNextSibling() == null && emptyListPtr.getPreviousSibling() == null) {
     const parent = emptyListPtr.getParent();
 
-    if (parent == null || !(list.$isListItemNode(emptyListPtr) || list.$isListNode(emptyListPtr))) {
+    if (parent == null || !($isListItemNode(emptyListPtr) || $isListNode(emptyListPtr))) {
       break;
     }
 
@@ -152,16 +152,16 @@ function insertList(editor, listType) {
       const anchorNodeParent = anchorNode.getParent(); // This is a special case for when there's nothing selected
 
       if (nodes.length === 0) {
-        const list$1 = list.$createListNode(listType);
+        const list = $createListNode(listType);
 
         if (lexical.$isRootNode(anchorNodeParent)) {
-          anchorNode.replace(list$1);
-          const listItem = list.$createListItemNode();
-          list$1.append(listItem);
-        } else if (list.$isListItemNode(anchorNode)) {
+          anchorNode.replace(list);
+          const listItem = $createListItemNode();
+          list.append(listItem);
+        } else if ($isListItemNode(anchorNode)) {
           const parent = anchorNode.getParentOrThrow();
-          list$1.append(...parent.getChildren());
-          parent.replace(list$1);
+          list.append(...parent.getChildren());
+          parent.replace(list);
         }
 
         return;
@@ -182,9 +182,9 @@ function insertList(editor, listType) {
             while (parent != null) {
               const parentKey = parent.getKey();
 
-              if (list.$isListNode(parent)) {
+              if ($isListNode(parent)) {
                 if (!handled.has(parentKey)) {
-                  const newListNode = list.$createListNode(listType);
+                  const newListNode = $createListNode(listType);
                   newListNode.append(...parent.getChildren());
                   parent.replace(newListNode);
                   handled.add(parentKey);
@@ -211,34 +211,34 @@ function insertList(editor, listType) {
 }
 
 function createListOrMerge(node, listType) {
-  if (list.$isListNode(node)) {
+  if ($isListNode(node)) {
     return node;
   }
 
   const previousSibling = node.getPreviousSibling();
   const nextSibling = node.getNextSibling();
-  const listItem = list.$createListItemNode();
+  const listItem = $createListItemNode();
 
-  if (list.$isListNode(previousSibling) && listType === previousSibling.getTag()) {
+  if ($isListNode(previousSibling) && listType === previousSibling.getTag()) {
     listItem.append(node);
     previousSibling.append(listItem); // if the same type of list is on both sides, merge them.
 
-    if (list.$isListNode(nextSibling) && listType === nextSibling.getTag()) {
+    if ($isListNode(nextSibling) && listType === nextSibling.getTag()) {
       previousSibling.append(...nextSibling.getChildren());
       nextSibling.remove();
     }
 
     return previousSibling;
-  } else if (list.$isListNode(nextSibling) && listType === nextSibling.getTag()) {
+  } else if ($isListNode(nextSibling) && listType === nextSibling.getTag()) {
     listItem.append(node);
     nextSibling.getFirstChildOrThrow().insertBefore(listItem);
     return nextSibling;
   } else {
-    const list$1 = list.$createListNode(listType);
-    list$1.append(listItem);
-    node.replace(list$1);
+    const list = $createListNode(listType);
+    list.append(listItem);
+    node.replace(list);
     listItem.append(node);
-    return list$1;
+    return list;
   }
 }
 
@@ -251,14 +251,14 @@ function removeList(editor) {
       const nodes = selection.getNodes();
       const anchorNode = selection.anchor.getNode();
 
-      if (nodes.length === 0 && list.$isListItemNode(anchorNode)) {
+      if (nodes.length === 0 && $isListItemNode(anchorNode)) {
         listNodes.add($getTopListNode(anchorNode));
       } else {
         for (let i = 0; i < nodes.length; i++) {
           const node = nodes[i];
 
           if (lexical.$isLeafNode(node)) {
-            const listItemNode = utils.$getNearestNodeOfType(node, list.ListItemNode);
+            const listItemNode = utils.$getNearestNodeOfType(node, ListItemNode);
 
             if (listItemNode != null) {
               listNodes.add($getTopListNode(listItemNode));
@@ -298,11 +298,11 @@ function $handleIndent(listItemNodes) {
     if (isNestedListNode(nextSibling) && isNestedListNode(previousSibling)) {
       const innerList = previousSibling.getFirstChild();
 
-      if (list.$isListNode(innerList)) {
+      if ($isListNode(innerList)) {
         innerList.append(listItemNode);
         const nextInnerList = nextSibling.getFirstChild();
 
-        if (list.$isListNode(nextInnerList)) {
+        if ($isListNode(nextInnerList)) {
           const children = nextInnerList.getChildren();
           innerList.append(...children);
           nextInnerList.remove();
@@ -314,7 +314,7 @@ function $handleIndent(listItemNodes) {
       // if the ListItemNode is next to a nested ListNode, merge them
       const innerList = nextSibling.getFirstChild();
 
-      if (list.$isListNode(innerList)) {
+      if ($isListNode(innerList)) {
         const firstChild = innerList.getFirstChild();
 
         if (firstChild !== null) {
@@ -326,15 +326,15 @@ function $handleIndent(listItemNodes) {
     } else if (isNestedListNode(previousSibling)) {
       const innerList = previousSibling.getFirstChild();
 
-      if (list.$isListNode(innerList)) {
+      if ($isListNode(innerList)) {
         innerList.append(listItemNode);
         innerList.getChildren().forEach(child => child.markDirty());
       }
     } else {
       // otherwise, we need to create a new nested ListNode
-      if (list.$isListNode(parent)) {
-        const newListItem = list.$createListItemNode();
-        const newList = list.$createListNode(parent.getTag());
+      if ($isListNode(parent)) {
+        const newListItem = $createListItemNode();
+        const newList = $createListNode(parent.getTag());
         newListItem.append(newList);
         newList.append(listItemNode);
 
@@ -348,7 +348,7 @@ function $handleIndent(listItemNodes) {
       }
     }
 
-    if (list.$isListNode(parent)) {
+    if ($isListNode(parent)) {
       parent.getChildren().forEach(child => child.markDirty());
     }
   });
@@ -364,7 +364,7 @@ function $handleOutdent(listItemNodes) {
     const grandparentListItem = parentList ? parentList.getParent() : undefined;
     const greatGrandparentList = grandparentListItem ? grandparentListItem.getParent() : undefined; // If it doesn't have these ancestors, it's not indented.
 
-    if (list.$isListNode(greatGrandparentList) && list.$isListItemNode(grandparentListItem) && list.$isListNode(parentList)) {
+    if ($isListNode(greatGrandparentList) && $isListItemNode(grandparentListItem) && $isListNode(parentList)) {
       // if it's the first child in it's parent list, insert it into the
       // great grandparent list before the grandparent
       const firstChild = parentList ? parentList.getFirstChild() : undefined;
@@ -387,12 +387,12 @@ function $handleOutdent(listItemNodes) {
       } else {
         // otherwise, we need to split the siblings into two new nested lists
         const tag = parentList.getTag();
-        const previousSiblingsListItem = list.$createListItemNode();
-        const previousSiblingsList = list.$createListNode(tag);
+        const previousSiblingsListItem = $createListItemNode();
+        const previousSiblingsList = $createListNode(tag);
         previousSiblingsListItem.append(previousSiblingsList);
         listItemNode.getPreviousSiblings().forEach(sibling => previousSiblingsList.append(sibling));
-        const nextSiblingsListItem = list.$createListItemNode();
-        const nextSiblingsList = list.$createListNode(tag);
+        const nextSiblingsListItem = $createListItemNode();
+        const nextSiblingsList = $createListNode(tag);
         nextSiblingsListItem.append(nextSiblingsList);
         nextSiblingsList.append(...listItemNode.getNextSiblings()); // put the sibling nested lists on either side of the grandparent list item in the great grandparent.
 
@@ -463,14 +463,14 @@ function $handleListInsertParagraph() {
 
   const anchor = selection.anchor.getNode();
 
-  if (!list.$isListItemNode(anchor) || anchor.getTextContent() !== '') {
+  if (!$isListItemNode(anchor) || anchor.getTextContent() !== '') {
     return false;
   }
 
   const topListNode = $getTopListNode(anchor);
   const parent = anchor.getParent();
 
-  if (!list.$isListNode(parent)) {
+  if (!$isListNode(parent)) {
     throw Error(`A ListItemNode must have a ListNode for a parent.`);
   }
 
@@ -480,8 +480,8 @@ function $handleListInsertParagraph() {
   if (lexical.$isRootNode(grandparent)) {
     replacementNode = lexical.$createParagraphNode();
     topListNode.insertAfter(replacementNode);
-  } else if (list.$isListItemNode(grandparent)) {
-    replacementNode = list.$createListItemNode();
+  } else if ($isListItemNode(grandparent)) {
+    replacementNode = $createListItemNode();
     grandparent.insertAfter(replacementNode);
   } else {
     return false;
@@ -491,12 +491,12 @@ function $handleListInsertParagraph() {
   const nextSiblings = anchor.getNextSiblings();
 
   if (nextSiblings.length > 0) {
-    const newList = list.$createListNode(parent.getTag());
+    const newList = $createListNode(parent.getTag());
 
     if (lexical.$isParagraphNode(replacementNode)) {
       replacementNode.insertAfter(newList);
     } else {
-      const newListItem = list.$createListItemNode();
+      const newListItem = $createListItemNode();
       newListItem.append(newList);
       replacementNode.insertAfter(newListItem);
     }
@@ -579,35 +579,35 @@ class ListItemNode extends lexical.ElementNode {
       return super.replace(replaceWithNode);
     }
 
-    const list$1 = this.getParentOrThrow();
+    const list = this.getParentOrThrow();
 
-    if (list.$isListNode(list$1)) {
-      const childrenKeys = list$1.__children;
+    if ($isListNode(list)) {
+      const childrenKeys = list.__children;
       const childrenLength = childrenKeys.length;
       const index = childrenKeys.indexOf(this.__key);
 
       if (index === 0) {
-        list$1.insertBefore(replaceWithNode);
+        list.insertBefore(replaceWithNode);
       } else if (index === childrenLength - 1) {
-        list$1.insertAfter(replaceWithNode);
+        list.insertAfter(replaceWithNode);
       } else {
         // Split the list
-        const newList = list.$createListNode(list$1.__tag);
-        const children = list$1.getChildren();
+        const newList = $createListNode(list.getTag());
+        const children = list.getChildren();
 
         for (let i = index + 1; i < childrenLength; i++) {
           const child = children[i];
           newList.append(child);
         }
 
-        list$1.insertAfter(replaceWithNode);
+        list.insertAfter(replaceWithNode);
         replaceWithNode.insertAfter(newList);
       }
 
       this.remove();
 
       if (childrenLength === 1) {
-        list$1.remove();
+        list.remove();
       }
     }
 
@@ -625,14 +625,14 @@ class ListItemNode extends lexical.ElementNode {
 
     const listNode = this.getParentOrThrow();
 
-    if (!list.$isListNode(listNode)) {
+    if (!$isListNode(listNode)) {
       {
         throw Error(`insertAfter: list node is not parent of list item node`);
       }
     } // Attempt to merge tables if the list is of the same type.
 
 
-    if (list.$isListNode(node) && node.getTag() === listNode.getTag()) {
+    if ($isListNode(node) && node.getTag() === listNode.getTag()) {
       let child = node;
       const children = node.getChildren();
 
@@ -649,7 +649,7 @@ class ListItemNode extends lexical.ElementNode {
     listNode.insertAfter(node);
 
     if (siblings.length !== 0) {
-      const newListNode = list.$createListNode(listNode.getTag());
+      const newListNode = $createListNode(listNode.getTag());
       siblings.forEach(sibling => newListNode.append(sibling));
       node.insertAfter(newListNode);
     }
@@ -756,16 +756,16 @@ class ListItemNode extends lexical.ElementNode {
 }
 
 function getListItemValue(listItem) {
-  const list$1 = listItem.getParent();
+  const list = listItem.getParent();
   let value = 1;
 
-  if (list$1 != null) {
-    if (!list.$isListNode(list$1)) {
+  if (list != null) {
+    if (!$isListNode(list)) {
       {
         throw Error(`getListItemValue: list node is not parent of list item node`);
       }
     } else {
-      value = list$1.__start;
+      value = list.getStart();
     }
   }
 
@@ -774,7 +774,7 @@ function getListItemValue(listItem) {
   for (let i = 0; i < siblings.length; i++) {
     const sibling = siblings[i];
 
-    if ($isListItemNode(sibling) && !list.$isListNode(sibling.getFirstChild())) {
+    if ($isListItemNode(sibling) && !$isListNode(sibling.getFirstChild())) {
       value++;
     }
   }
@@ -801,7 +801,7 @@ function $setListItemThemeClassNames(dom, editorThemeClasses, node) {
   if (nestedListItemClassName !== undefined) {
     const nestedListItemClasses = nestedListItemClassName.split(' ');
 
-    if (node.getChildren().some(child => list.$isListNode(child))) {
+    if (node.getChildren().some(child => $isListNode(child))) {
       classesToAdd.push(...nestedListItemClasses);
     } else {
       classesToRemove.push(...nestedListItemClasses);
@@ -855,6 +855,10 @@ class ListNode extends lexical.ElementNode {
 
   getTag() {
     return this.__tag;
+  }
+
+  getStart() {
+    return this.__start;
   } // View
 
 
@@ -994,14 +998,29 @@ function $isListNode(node) {
   return node instanceof ListNode;
 }
 
+/**
+ * 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.
+ *
+ * 
+ */
+const INSERT_UNORDERED_LIST_COMMAND = lexical.createCommand();
+const INSERT_ORDERED_LIST_COMMAND = lexical.createCommand();
+const REMOVE_LIST_COMMAND = lexical.createCommand();
+
 exports.$createListItemNode = $createListItemNode;
 exports.$createListNode = $createListNode;
 exports.$getListDepth = $getListDepth;
 exports.$handleListInsertParagraph = $handleListInsertParagraph;
 exports.$isListItemNode = $isListItemNode;
 exports.$isListNode = $isListNode;
+exports.INSERT_ORDERED_LIST_COMMAND = INSERT_ORDERED_LIST_COMMAND;
+exports.INSERT_UNORDERED_LIST_COMMAND = INSERT_UNORDERED_LIST_COMMAND;
 exports.ListItemNode = ListItemNode;
 exports.ListNode = ListNode;
+exports.REMOVE_LIST_COMMAND = REMOVE_LIST_COMMAND;
 exports.indentList = indentList;
 exports.insertList = insertList;
 exports.outdentList = outdentList;

package/LexicalList.js.flow

@@ -0,0 +1,64 @@
+/**
+ * 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,
+  LexicalEditor,
+  ParagraphNode,
+  RangeSelection,
+  LexicalCommand,
+} from 'lexical';
+import {ElementNode} from 'lexical';
+
+type ListNodeTagType = 'ul' | 'ol';
+declare export function $createListItemNode(): ListItemNode;
+declare export function $createListNode(
+  tag: ListNodeTagType,
+  start?: number,
+): ListNode;
+declare export function $getListDepth(listNode: ListNode): number;
+declare export function $handleListInsertParagraph(): boolean;
+declare export function $isListItemNode(
+  node: ?LexicalNode,
+): boolean %checks(node instanceof ListItemNode);
+declare export function $isListNode(
+  node: ?LexicalNode,
+): boolean %checks(node instanceof ListNode);
+declare export function indentList(): boolean;
+declare export function insertList(
+  editor: LexicalEditor,
+  listType: 'ul' | 'ol',
+): void;
+declare export class ListItemNode extends ElementNode {
+  append(...nodes: LexicalNode[]): ListItemNode;
+  replace<N: LexicalNode>(replaceWithNode: N): N;
+  insertAfter(node: LexicalNode): LexicalNode;
+  insertNewAfter(): ListItemNode | ParagraphNode;
+  collapseAtStart(selection: RangeSelection): true;
+  getIndent(): number;
+  setIndent(indent: number): this;
+  insertBefore(nodeToInsert: LexicalNode): LexicalNode;
+  canInsertAfter(node: LexicalNode): boolean;
+  canReplaceWith(replacement: LexicalNode): boolean;
+  canMergeWith(node: LexicalNode): boolean;
+}
+declare export class ListNode extends ElementNode {
+  __tag: ListNodeTagType;
+  __start: number;
+  canBeEmpty(): false;
+  append(...nodesToAppend: LexicalNode[]): ListNode;
+  getTag(): ListNodeTagType;
+  getStart(): number;
+}
+declare export function outdentList(): boolean;
+declare export function removeList(editor: LexicalEditor): boolean;
+
+declare export var INSERT_UNORDERED_LIST_COMMAND: LexicalCommand<void>;
+declare export var INSERT_ORDERED_LIST_COMMAND: LexicalCommand<void>;
+declare export var REMOVE_LIST_COMMAND: LexicalCommand<void>;

package/LexicalList.prod.js

@@ -4,27 +4,25 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  */
-var g=require("@lexical/list"),k=require("@lexical/utils"),n=require("lexical");function p(b){throw Error(`Minified Lexical error #${b}; see codes.json for the full message or `+"use the non-minified dev environment for full errors and additional helpful warnings.");}function q(b){let a=1;for(b=b.getParent();null!=b;){if(g.$isListItemNode(b)){b=b.getParent();if(g.$isListNode(b)){a++;b=b.getParent();continue}p(2)}break}return a}
-function r(b){b=b.getParent();g.$isListNode(b)||p(2);let a=b;for(;null!==a;)a=a.getParent(),g.$isListNode(a)&&(b=a);return b}function u(b){let a=[];b=b.getChildren().filter(g.$isListItemNode);for(let c=0;c<b.length;c++){const d=b[c],e=d.getFirstChild();g.$isListNode(e)?a=a.concat(u(e)):a.push(d)}return a}function v(b){return g.$isListItemNode(b)&&g.$isListNode(b.getFirstChild())}
-function w(b){for(;null==b.getNextSibling()&&null==b.getPreviousSibling();){const a=b.getParent();if(null==a||!g.$isListItemNode(b)&&!g.$isListNode(b))break;b=a}b.remove()}
-function x(b,a){if(g.$isListNode(b))return b;const c=b.getPreviousSibling(),d=b.getNextSibling(),e=g.$createListItemNode();if(g.$isListNode(c)&&a===c.getTag())return e.append(b),c.append(e),g.$isListNode(d)&&a===d.getTag()&&(c.append(...d.getChildren()),d.remove()),c;if(g.$isListNode(d)&&a===d.getTag())return e.append(b),d.getFirstChildOrThrow().insertBefore(e),d;a=g.$createListNode(a);a.append(e);b.replace(a);e.append(b);return a}
-function z(b){b.forEach(a=>{if(!v(a)){var c=a.getParent(),d=a.getNextSibling(),e=a.getPreviousSibling();if(v(d)&&v(e))e=e.getFirstChild(),g.$isListNode(e)&&(e.append(a),a=d.getFirstChild(),g.$isListNode(a)&&(d=a.getChildren(),e.append(...d),a.remove()),e.getChildren().forEach(f=>f.markDirty()));else if(v(d))d=d.getFirstChild(),g.$isListNode(d)&&(e=d.getFirstChild(),null!==e&&e.insertBefore(a),d.getChildren().forEach(f=>f.markDirty()));else if(v(e))d=e.getFirstChild(),g.$isListNode(d)&&(d.append(a),
-d.getChildren().forEach(f=>f.markDirty()));else if(g.$isListNode(c)){const f=g.$createListItemNode(),h=g.$createListNode(c.getTag());f.append(h);h.append(a);e?e.insertAfter(f):d?d.insertBefore(f):c.append(f)}g.$isListNode(c)&&c.getChildren().forEach(f=>f.markDirty())}})}
-function A(b){b.forEach(a=>{if(!v(a)){var c=a.getParent(),d=c?c.getParent():void 0,e=d?d.getParent():void 0;if(g.$isListNode(e)&&g.$isListItemNode(d)&&g.$isListNode(c)){var f=c?c.getFirstChild():void 0,h=c?c.getLastChild():void 0;if(a.is(f))d.insertBefore(a),c.isEmpty()&&d.remove();else if(a.is(h))d.insertAfter(a),c.isEmpty()&&d.remove();else{var l=c.getTag();f=g.$createListItemNode();const m=g.$createListNode(l);f.append(m);a.getPreviousSiblings().forEach(t=>m.append(t));h=g.$createListItemNode();
-l=g.$createListNode(l);h.append(l);l.append(...a.getNextSiblings());d.insertBefore(f);d.insertAfter(h);d.replace(a)}c.getChildren().forEach(m=>m.markDirty());e.getChildren().forEach(m=>m.markDirty())}}})}
-function B(b){var a=n.$getSelection();if(!n.$isRangeSelection(a))return!1;var c=a.getNodes(),d=[];0===c.length&&c.push(a.anchor.getNode());if(1===c.length){a:{for(c=c[0];null!==c;){if(g.$isListItemNode(c))break a;c=c.getParent()}c=null}null!==c&&(d=[c])}else{d=new Set;for(a=0;a<c.length;a++){const e=c[a];g.$isListItemNode(e)&&d.add(e)}d=Array.from(d)}return 0<d.length?("indent"===b?z(d):A(d),!0):!1}
-class C extends n.ElementNode{static getType(){return"listitem"}static clone(b){return new C(b.__key)}constructor(b){super(b)}createDOM(b){const a=document.createElement("li");a.value=D(this);E(a,b.theme,this);return a}updateDOM(b,a,c){a.value=D(this);E(a,c.theme,this);return!1}static convertDOM(){return{li:()=>({conversion:F,priority:0})}}append(...b){for(let a=0;a<b.length;a++){const c=b[a];if(n.$isElementNode(c)&&this.canMergeWith(c)){const d=c.getChildren();this.append(...d);c.remove()}else super.append(c)}return this}replace(b){if(G(b))return super.replace(b);
-const a=this.getParentOrThrow();if(g.$isListNode(a)){var c=a.__children;const e=c.length;var d=c.indexOf(this.__key);if(0===d)a.insertBefore(b);else if(d===e-1)a.insertAfter(b);else{c=g.$createListNode(a.__tag);const f=a.getChildren();for(d+=1;d<e;d++)c.append(f[d]);a.insertAfter(b);b.insertAfter(c)}this.remove();1===e&&a.remove()}return b}insertAfter(b){var a=this.getNextSiblings();if(G(b))return a.forEach(d=>d.markDirty()),super.insertAfter(b);var c=this.getParentOrThrow();g.$isListNode(c)||p(1);
-if(g.$isListNode(b)&&b.getTag()===c.getTag()){a=b;b=b.getChildren();for(c=b.length-1;0<=c;c--)a=b[c],this.insertAfter(a);return a}c.insertAfter(b);if(0!==a.length){const d=g.$createListNode(c.getTag());a.forEach(e=>d.append(e));b.insertAfter(d)}return b}insertNewAfter(){const b=H();this.insertAfter(b);return b}collapseAtStart(b){const a=n.$createParagraphNode();this.getChildren().forEach(f=>a.append(f));var c=this.getParentOrThrow(),d=c.getParentOrThrow();const e=G(d);1===c.getChildrenSize()?e?(c.remove(),
-d.select()):(c.replace(a),c=b.anchor,b=b.focus,d=a.getKey(),"element"===c.type&&c.getNode().is(this)&&c.set(d,c.offset,"element"),"element"===b.type&&b.getNode().is(this)&&b.set(d,b.offset,"element")):(c.insertBefore(a),this.remove());return!0}getIndent(){let b=this.getParentOrThrow().getParentOrThrow(),a=0;for(;G(b);)b=b.getParentOrThrow().getParentOrThrow(),a++;return a}setIndent(b){let a=this.getIndent();for(;a!==b;)a<b?(z([this]),a++):(A([this]),a--);return this}insertBefore(b){const a=this.getNextSiblings();
-G(b)&&a.forEach(c=>c.markDirty());return super.insertBefore(b)}canInsertAfter(b){return G(b)}canReplaceWith(b){return G(b)}canMergeWith(b){return n.$isParagraphNode(b)||G(b)}}function D(b){var a=b.getParent();let c=1;null!=a&&(g.$isListNode(a)?c=a.__start:p(47));b=b.getPreviousSiblings();for(a=0;a<b.length;a++){const d=b[a];G(d)&&!g.$isListNode(d.getFirstChild())&&c++}return c}
-function E(b,a,c){const d=[],e=[],f=(a=a.list)?a.listitem:void 0;if(a&&a.nested)var h=a.nested.listitem;void 0!==f&&(a=f.split(" "),d.push(...a));void 0!==h&&(h=h.split(" "),c.getChildren().some(l=>g.$isListNode(l))?d.push(...h):e.push(...h));0<d.length&&k.addClassNamesToElement(b,...d);0<e.length&&k.removeClassNamesFromElement(b,...e)}function F(){return{node:H()}}function H(){return new C}function G(b){return b instanceof C}
-class I extends n.ElementNode{static getType(){return"list"}static clone(b){return new I(b.__tag,b.__start,b.__key)}constructor(b,a,c){super(c);this.__tag=b;this.__start=a}getTag(){return this.__tag}createDOM(b){const a=document.createElement(this.__tag);1!==this.__start&&a.setAttribute("start",String(this.__start));J(a,b.theme,this);return a}updateDOM(b,a,c){if(b.__tag!==this.__tag)return!0;J(a,c.theme,this);return!1}static convertDOM(){return{ol:()=>({conversion:K,priority:0}),ul:()=>({conversion:K,
-priority:0})}}canBeEmpty(){return!1}append(...b){for(let c=0;c<b.length;c++){var a=b[c];if(g.$isListItemNode(a))super.append(a);else{const d=g.$createListItemNode();L(a)?d.append(a):(a=n.$createTextNode(a.getTextContent()),d.append(a));super.append(d)}}return this}}
-function J(b,a,c){const d=[],e=[];var f=a.list;if(void 0!==f){const l=f[c.__tag+"Depth"]||[];a=q(c)-1;const m=a%l.length;var h=l[m];const t=f[c.__tag];let y;f=f.nested;void 0!==f&&f.list&&(y=f.list);void 0!==t&&d.push(t);if(void 0!==h)for(h=h.split(" "),d.push(...h),h=0;h<l.length;h++)h!==m&&e.push(c.__tag+h);void 0!==y&&(c=y.split(" "),1<a?d.push(...c):e.push(...c))}0<d.length&&k.addClassNamesToElement(b,...d);0<e.length&&k.removeClassNamesFromElement(b,...e)}
-function K(b){b=b.nodeName.toLowerCase();let a=null;if("ol"===b||"ul"===b)a=M(b);return{node:a}}function M(b,a=1){return new I(b,a)}function L(b){return b instanceof I}exports.$createListItemNode=H;exports.$createListNode=M;exports.$getListDepth=q;
-exports.$handleListInsertParagraph=function(){var b=n.$getSelection();if(!n.$isRangeSelection(b)||!b.isCollapsed())return!1;b=b.anchor.getNode();if(!g.$isListItemNode(b)||""!==b.getTextContent())return!1;var a=r(b),c=b.getParent();g.$isListNode(c)||p(2);const d=c.getParent();let e;if(n.$isRootNode(d))e=n.$createParagraphNode(),a.insertAfter(e);else if(g.$isListItemNode(d))e=g.$createListItemNode(),d.insertAfter(e);else return!1;e.select();a=b.getNextSiblings();if(0<a.length){const f=g.$createListNode(c.getTag());
-n.$isParagraphNode(e)?e.insertAfter(f):(c=g.$createListItemNode(),c.append(f),e.insertAfter(c));a.forEach(h=>{h.remove();f.append(h)})}w(b);return!0};exports.$isListItemNode=G;exports.$isListNode=L;exports.ListItemNode=C;exports.ListNode=I;exports.indentList=function(){return B("indent")};
-exports.insertList=function(b,a){b.update(()=>{var c=n.$getSelection();if(n.$isRangeSelection(c)){var d=c.getNodes();c=c.anchor.getNode();var e=c.getParent();if(0===d.length)d=g.$createListNode(a),n.$isRootNode(e)?(c.replace(d),c=g.$createListItemNode(),d.append(c)):g.$isListItemNode(c)&&(c=c.getParentOrThrow(),d.append(...c.getChildren()),c.replace(d));else for(c=new Set,e=0;e<d.length;e++){var f=d[e];if(n.$isElementNode(f)&&f.isEmpty()&&!c.has(f.getKey()))x(f,a);else if(n.$isLeafNode(f))for(f=f.getParent();null!=
-f;){const l=f.getKey();if(g.$isListNode(f)){if(!c.has(l)){var h=g.$createListNode(a);h.append(...f.getChildren());f.replace(h);c.add(l)}break}else{h=f.getParent();if(n.$isRootNode(h)&&!c.has(l)){c.add(l);x(f,a);break}f=h}}}}})};exports.outdentList=function(){return B("outdent")};
-exports.removeList=function(b){b.update(()=>{var a=n.$getSelection();if(n.$isRangeSelection(a)){const d=new Set,e=a.getNodes();a=a.anchor.getNode();if(0===e.length&&g.$isListItemNode(a))d.add(r(a));else for(a=0;a<e.length;a++){var c=e[a];n.$isLeafNode(c)&&(c=k.$getNearestNodeOfType(c,g.ListItemNode),null!=c&&d.add(r(c)))}d.forEach(f=>{let h=f;u(f).forEach(l=>{if(null!=l){const m=n.$createParagraphNode();m.append(...l.getChildren());h.insertAfter(m);h=m;l.remove()}});f.remove()})}})};
+var h=require("lexical"),k=require("@lexical/utils"),l=require("@lexical/list");function p(b){throw Error(`Minified Lexical error #${b}; see codes.json for the full message or `+"use the non-minified dev environment for full errors and additional helpful warnings.");}function q(b){let a=1;for(b=b.getParent();null!=b;){if(r(b)){b=b.getParent();if(t(b)){a++;b=b.getParent();continue}p(2)}break}return a}
+function u(b){b=b.getParent();t(b)||p(2);let a=b;for(;null!==a;)a=a.getParent(),t(a)&&(b=a);return b}function v(b){let a=[];b=b.getChildren().filter(r);for(let c=0;c<b.length;c++){const d=b[c],e=d.getFirstChild();t(e)?a=a.concat(v(e)):a.push(d)}return a}function x(b){return r(b)&&t(b.getFirstChild())}function y(b){for(;null==b.getNextSibling()&&null==b.getPreviousSibling();){const a=b.getParent();if(null==a||!r(b)&&!t(b))break;b=a}b.remove()}
+function A(b,a){if(t(b))return b;const c=b.getPreviousSibling(),d=b.getNextSibling(),e=B();if(t(c)&&a===c.getTag())return e.append(b),c.append(e),t(d)&&a===d.getTag()&&(c.append(...d.getChildren()),d.remove()),c;if(t(d)&&a===d.getTag())return e.append(b),d.getFirstChildOrThrow().insertBefore(e),d;a=C(a);a.append(e);b.replace(a);e.append(b);return a}
+function D(b){b.forEach(a=>{if(!x(a)){var c=a.getParent(),d=a.getNextSibling(),e=a.getPreviousSibling();if(x(d)&&x(e))e=e.getFirstChild(),t(e)&&(e.append(a),a=d.getFirstChild(),t(a)&&(d=a.getChildren(),e.append(...d),a.remove()),e.getChildren().forEach(f=>f.markDirty()));else if(x(d))d=d.getFirstChild(),t(d)&&(e=d.getFirstChild(),null!==e&&e.insertBefore(a),d.getChildren().forEach(f=>f.markDirty()));else if(x(e))d=e.getFirstChild(),t(d)&&(d.append(a),d.getChildren().forEach(f=>f.markDirty()));else if(t(c)){const f=
+B(),g=C(c.getTag());f.append(g);g.append(a);e?e.insertAfter(f):d?d.insertBefore(f):c.append(f)}t(c)&&c.getChildren().forEach(f=>f.markDirty())}})}
+function E(b){b.forEach(a=>{if(!x(a)){var c=a.getParent(),d=c?c.getParent():void 0,e=d?d.getParent():void 0;if(t(e)&&r(d)&&t(c)){var f=c?c.getFirstChild():void 0,g=c?c.getLastChild():void 0;if(a.is(f))d.insertBefore(a),c.isEmpty()&&d.remove();else if(a.is(g))d.insertAfter(a),c.isEmpty()&&d.remove();else{var m=c.getTag();f=B();const n=C(m);f.append(n);a.getPreviousSiblings().forEach(w=>n.append(w));g=B();m=C(m);g.append(m);m.append(...a.getNextSiblings());d.insertBefore(f);d.insertAfter(g);d.replace(a)}c.getChildren().forEach(n=>
+n.markDirty());e.getChildren().forEach(n=>n.markDirty())}}})}function F(b){var a=h.$getSelection();if(!h.$isRangeSelection(a))return!1;var c=a.getNodes(),d=[];0===c.length&&c.push(a.anchor.getNode());if(1===c.length){a:{for(c=c[0];null!==c;){if(r(c))break a;c=c.getParent()}c=null}null!==c&&(d=[c])}else{d=new Set;for(a=0;a<c.length;a++){const e=c[a];r(e)&&d.add(e)}d=Array.from(d)}return 0<d.length?("indent"===b?D(d):E(d),!0):!1}
+class G extends h.ElementNode{static getType(){return"listitem"}static clone(b){return new G(b.__key)}constructor(b){super(b)}createDOM(b){const a=document.createElement("li");a.value=H(this);I(a,b.theme,this);return a}updateDOM(b,a,c){a.value=H(this);I(a,c.theme,this);return!1}static convertDOM(){return{li:()=>({conversion:J,priority:0})}}append(...b){for(let a=0;a<b.length;a++){const c=b[a];if(h.$isElementNode(c)&&this.canMergeWith(c)){const d=c.getChildren();this.append(...d);c.remove()}else super.append(c)}return this}replace(b){if(r(b))return super.replace(b);
+const a=this.getParentOrThrow();if(t(a)){var c=a.__children;const e=c.length;var d=c.indexOf(this.__key);if(0===d)a.insertBefore(b);else if(d===e-1)a.insertAfter(b);else{c=C(a.getTag());const f=a.getChildren();for(d+=1;d<e;d++)c.append(f[d]);a.insertAfter(b);b.insertAfter(c)}this.remove();1===e&&a.remove()}return b}insertAfter(b){var a=this.getNextSiblings();if(r(b))return a.forEach(d=>d.markDirty()),super.insertAfter(b);var c=this.getParentOrThrow();t(c)||p(1);if(t(b)&&b.getTag()===c.getTag()){a=
+b;b=b.getChildren();for(c=b.length-1;0<=c;c--)a=b[c],this.insertAfter(a);return a}c.insertAfter(b);if(0!==a.length){const d=C(c.getTag());a.forEach(e=>d.append(e));b.insertAfter(d)}return b}insertNewAfter(){const b=B();this.insertAfter(b);return b}collapseAtStart(b){const a=h.$createParagraphNode();this.getChildren().forEach(f=>a.append(f));var c=this.getParentOrThrow(),d=c.getParentOrThrow();const e=r(d);1===c.getChildrenSize()?e?(c.remove(),d.select()):(c.replace(a),c=b.anchor,b=b.focus,d=a.getKey(),
+"element"===c.type&&c.getNode().is(this)&&c.set(d,c.offset,"element"),"element"===b.type&&b.getNode().is(this)&&b.set(d,b.offset,"element")):(c.insertBefore(a),this.remove());return!0}getIndent(){let b=this.getParentOrThrow().getParentOrThrow(),a=0;for(;r(b);)b=b.getParentOrThrow().getParentOrThrow(),a++;return a}setIndent(b){let a=this.getIndent();for(;a!==b;)a<b?(D([this]),a++):(E([this]),a--);return this}insertBefore(b){const a=this.getNextSiblings();r(b)&&a.forEach(c=>c.markDirty());return super.insertBefore(b)}canInsertAfter(b){return r(b)}canReplaceWith(b){return r(b)}canMergeWith(b){return h.$isParagraphNode(b)||
+r(b)}}function H(b){var a=b.getParent();let c=1;null!=a&&(t(a)?c=a.getStart():p(47));b=b.getPreviousSiblings();for(a=0;a<b.length;a++){const d=b[a];r(d)&&!t(d.getFirstChild())&&c++}return c}
+function I(b,a,c){const d=[],e=[],f=(a=a.list)?a.listitem:void 0;if(a&&a.nested)var g=a.nested.listitem;void 0!==f&&(a=f.split(" "),d.push(...a));void 0!==g&&(g=g.split(" "),c.getChildren().some(m=>t(m))?d.push(...g):e.push(...g));0<d.length&&k.addClassNamesToElement(b,...d);0<e.length&&k.removeClassNamesFromElement(b,...e)}function J(){return{node:B()}}function B(){return new G}function r(b){return b instanceof G}
+class K extends h.ElementNode{static getType(){return"list"}static clone(b){return new K(b.__tag,b.__start,b.__key)}constructor(b,a,c){super(c);this.__tag=b;this.__start=a}getTag(){return this.__tag}getStart(){return this.__start}createDOM(b){const a=document.createElement(this.__tag);1!==this.__start&&a.setAttribute("start",String(this.__start));L(a,b.theme,this);return a}updateDOM(b,a,c){if(b.__tag!==this.__tag)return!0;L(a,c.theme,this);return!1}static convertDOM(){return{ol:()=>({conversion:M,
+priority:0}),ul:()=>({conversion:M,priority:0})}}canBeEmpty(){return!1}append(...b){for(let c=0;c<b.length;c++){var a=b[c];if(l.$isListItemNode(a))super.append(a);else{const d=l.$createListItemNode();t(a)?d.append(a):(a=h.$createTextNode(a.getTextContent()),d.append(a));super.append(d)}}return this}}
+function L(b,a,c){const d=[],e=[];var f=a.list;if(void 0!==f){const m=f[c.__tag+"Depth"]||[];a=q(c)-1;const n=a%m.length;var g=m[n];const w=f[c.__tag];let z;f=f.nested;void 0!==f&&f.list&&(z=f.list);void 0!==w&&d.push(w);if(void 0!==g)for(g=g.split(" "),d.push(...g),g=0;g<m.length;g++)g!==n&&e.push(c.__tag+g);void 0!==z&&(c=z.split(" "),1<a?d.push(...c):e.push(...c))}0<d.length&&k.addClassNamesToElement(b,...d);0<e.length&&k.removeClassNamesFromElement(b,...e)}
+function M(b){b=b.nodeName.toLowerCase();let a=null;if("ol"===b||"ul"===b)a=C(b);return{node:a}}function C(b,a=1){return new K(b,a)}function t(b){return b instanceof K}const N=h.createCommand(),O=h.createCommand(),P=h.createCommand();exports.$createListItemNode=B;exports.$createListNode=C;exports.$getListDepth=q;
+exports.$handleListInsertParagraph=function(){var b=h.$getSelection();if(!h.$isRangeSelection(b)||!b.isCollapsed())return!1;b=b.anchor.getNode();if(!r(b)||""!==b.getTextContent())return!1;var a=u(b),c=b.getParent();t(c)||p(2);const d=c.getParent();let e;if(h.$isRootNode(d))e=h.$createParagraphNode(),a.insertAfter(e);else if(r(d))e=B(),d.insertAfter(e);else return!1;e.select();a=b.getNextSiblings();if(0<a.length){const f=C(c.getTag());h.$isParagraphNode(e)?e.insertAfter(f):(c=B(),c.append(f),e.insertAfter(c));
+a.forEach(g=>{g.remove();f.append(g)})}y(b);return!0};exports.$isListItemNode=r;exports.$isListNode=t;exports.INSERT_ORDERED_LIST_COMMAND=O;exports.INSERT_UNORDERED_LIST_COMMAND=N;exports.ListItemNode=G;exports.ListNode=K;exports.REMOVE_LIST_COMMAND=P;exports.indentList=function(){return F("indent")};
+exports.insertList=function(b,a){b.update(()=>{var c=h.$getSelection();if(h.$isRangeSelection(c)){var d=c.getNodes();c=c.anchor.getNode();var e=c.getParent();if(0===d.length)d=C(a),h.$isRootNode(e)?(c.replace(d),c=B(),d.append(c)):r(c)&&(c=c.getParentOrThrow(),d.append(...c.getChildren()),c.replace(d));else for(c=new Set,e=0;e<d.length;e++){var f=d[e];if(h.$isElementNode(f)&&f.isEmpty()&&!c.has(f.getKey()))A(f,a);else if(h.$isLeafNode(f))for(f=f.getParent();null!=f;){const m=f.getKey();if(t(f)){if(!c.has(m)){var g=
+C(a);g.append(...f.getChildren());f.replace(g);c.add(m)}break}else{g=f.getParent();if(h.$isRootNode(g)&&!c.has(m)){c.add(m);A(f,a);break}f=g}}}}})};exports.outdentList=function(){return F("outdent")};
+exports.removeList=function(b){b.update(()=>{var a=h.$getSelection();if(h.$isRangeSelection(a)){const d=new Set,e=a.getNodes();a=a.anchor.getNode();if(0===e.length&&r(a))d.add(u(a));else for(a=0;a<e.length;a++){var c=e[a];h.$isLeafNode(c)&&(c=k.$getNearestNodeOfType(c,G),null!=c&&d.add(u(c)))}d.forEach(f=>{let g=f;v(f).forEach(m=>{if(null!=m){const n=h.$createParagraphNode();n.append(...m.getChildren());g.insertAfter(n);g=n;m.remove()}});f.remove()})}})};

package/package.json

@@ -1,9 +1,5 @@
 {
   "name": "@lexical/list",
-  "author": {
-    "name": "Dominic Gannaway",
-    "email": "dg@domgan.com"
-  },
   "description": "This package provides the list feature for Lexical.",
   "keywords": [
     "lexical",
@@ -12,13 +8,13 @@
     "list"
   ],
   "license": "MIT",
-  "version": "0.1.16",
+  "version": "0.1.17",
   "main": "LexicalList.js",
   "peerDependencies": {
-    "lexical": "0.1.16"
+    "lexical": "0.1.17"
   },
   "dependencies": {
-    "@lexical/utils": "0.1.16"
+    "@lexical/utils": "0.1.17"
   },
   "repository": {
     "type": "git",