@lexical/list 0.12.3 → 0.12.5

package/LexicalList.dev.js

@@ -175,7 +175,7 @@ function $getListItemValue(listItem) {
 function insertList(editor, listType) {
   editor.update(() => {
     const selection = lexical.$getSelection();
-    if (lexical.$isRangeSelection(selection) || lexical.DEPRECATED_$isGridSelection(selection)) {
+    if (lexical.$INTERNAL_isPointSelection(selection)) {
       const nodes = selection.getNodes();
       const anchor = selection.anchor;
       const anchorNode = anchor.getNode();
@@ -200,7 +200,7 @@ function insertList(editor, listType) {
         const handled = new Set();
         for (let i = 0; i < nodes.length; i++) {
           const node = nodes[i];
-          if (lexical.$isElementNode(node) && node.isEmpty() && !handled.has(node.getKey())) {
+          if (lexical.$isElementNode(node) && node.isEmpty() && !$isListItemNode(node) && !handled.has(node.getKey())) {
             createListOrMerge(node, listType);
             continue;
           }

package/LexicalList.js.flow

@@ -51,6 +51,8 @@ declare export class ListItemNode extends ElementNode {
   canInsertAfter(node: LexicalNode): boolean;
   canReplaceWith(replacement: LexicalNode): boolean;
   canMergeWith(node: LexicalNode): boolean;
+  getValue(): number;
+  setValue(value: number): void;
   getChecked(): boolean | void;
   setChecked(boolean): this;
   toggleChecked(): void;

package/LexicalList.prod.js

@@ -29,7 +29,7 @@ function Q(a){let b=[];for(let d=0;d<a.length;d++){var c=a[d];p(c)?(b.push(c),c=
 function q(a){return a instanceof L}let R=h.createCommand("INSERT_UNORDERED_LIST_COMMAND"),S=h.createCommand("INSERT_ORDERED_LIST_COMMAND"),T=h.createCommand("INSERT_CHECK_LIST_COMMAND"),U=h.createCommand("REMOVE_LIST_COMMAND");exports.$createListItemNode=y;exports.$createListNode=D;exports.$getListDepth=n;
 exports.$handleListInsertParagraph=function(){var a=h.$getSelection();if(!h.$isRangeSelection(a)||!a.isCollapsed())return!1;a=a.anchor.getNode();if(!p(a)||0!==a.getChildrenSize())return!1;var b=r(a),c=a.getParent();q(c)||m(40);let d=c.getParent(),e;if(h.$isRootOrShadowRoot(d))e=h.$createParagraphNode(),b.insertAfter(e);else if(p(d))e=y(),d.insertAfter(e);else return!1;e.select();b=a.getNextSiblings();if(0<b.length){let f=D(c.getListType());h.$isParagraphNode(e)?e.insertAfter(f):(c=y(),c.append(f),
 e.insertAfter(c));b.forEach(g=>{g.remove();f.append(g)})}v(a);return!0};exports.$isListItemNode=p;exports.$isListNode=q;exports.INSERT_CHECK_LIST_COMMAND=T;exports.INSERT_ORDERED_LIST_COMMAND=S;exports.INSERT_UNORDERED_LIST_COMMAND=R;exports.ListItemNode=H;exports.ListNode=L;exports.REMOVE_LIST_COMMAND=U;
-exports.insertList=function(a,b){a.update(()=>{var c=h.$getSelection();if(h.$isRangeSelection(c)||h.DEPRECATED_$isGridSelection(c)){var d=c.getNodes();c=c.anchor.getNode();var e=c.getParent();if(z(c,d))d=D(b),h.$isRootOrShadowRoot(e)?(c.replace(d),e=y(),h.$isElementNode(c)&&(e.setFormat(c.getFormatType()),e.setIndent(c.getIndent())),d.append(e)):p(c)&&(c=c.getParentOrThrow(),B(d,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()))C(f,
+exports.insertList=function(a,b){a.update(()=>{var c=h.$getSelection();if(h.$INTERNAL_isPointSelection(c)){var d=c.getNodes();c=c.anchor.getNode();var e=c.getParent();if(z(c,d))d=D(b),h.$isRootOrShadowRoot(e)?(c.replace(d),e=y(),h.$isElementNode(c)&&(e.setFormat(c.getFormatType()),e.setIndent(c.getIndent())),d.append(e)):p(c)&&(c=c.getParentOrThrow(),B(d,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()&&!p(f)&&!c.has(f.getKey()))C(f,
 b);else if(h.$isLeafNode(f))for(f=f.getParent();null!=f;){let l=f.getKey();if(q(f)){if(!c.has(l)){var g=D(b);B(g,f.getChildren());f.replace(g);E(g);c.add(l)}break}else{g=f.getParent();if(h.$isRootOrShadowRoot(g)&&!c.has(l)){c.add(l);C(f,b);break}f=g}}}}})};
 exports.removeList=function(a){a.update(()=>{let b=h.$getSelection();if(h.$isRangeSelection(b)){var c=new Set,d=b.getNodes(),e=b.anchor.getNode();if(z(e,d))c.add(r(e));else for(e=0;e<d.length;e++){var f=d[e];h.$isLeafNode(f)&&(f=k.$getNearestNodeOfType(f,H),null!=f&&c.add(r(f)))}for(let g of c){c=g;d=t(g);for(let l of d)d=h.$createParagraphNode(),B(d,l.getChildren()),c.insertAfter(d),c=d,l.__key===b.anchor.key&&b.anchor.set(d.getKey(),0,"element"),l.__key===b.focus.key&&b.focus.set(d.getKey(),0,"element"),
 l.remove();g.remove()}}})}

package/LexicalListItemNode.d.ts

@@ -5,7 +5,7 @@
  * LICENSE file in the root directory of this source tree.
  *
  */
-import type { DOMConversionMap, DOMExportOutput, EditorConfig, GridSelection, LexicalNode, NodeKey, NodeSelection, ParagraphNode, RangeSelection, SerializedElementNode, Spread } from 'lexical';
+import type { BaseSelection, DOMConversionMap, DOMExportOutput, EditorConfig, LexicalNode, NodeKey, ParagraphNode, RangeSelection, SerializedElementNode, Spread } from 'lexical';
 import { ElementNode, LexicalEditor } from 'lexical';
 export type SerializedListItemNode = Spread<{
     checked: boolean | undefined;
@@ -44,7 +44,7 @@ export declare class ListItemNode extends ElementNode {
     canInsertAfter(node: LexicalNode): boolean;
     canReplaceWith(replacement: LexicalNode): boolean;
     canMergeWith(node: LexicalNode): boolean;
-    extractWithChild(child: LexicalNode, selection: RangeSelection | NodeSelection | GridSelection): boolean;
+    extractWithChild(child: LexicalNode, selection: BaseSelection): boolean;
     isParentRequired(): true;
     createParentElementNode(): ElementNode;
 }

package/package.json

@@ -8,13 +8,13 @@
     "list"
   ],
   "license": "MIT",
-  "version": "0.12.3",
+  "version": "0.12.5",
   "main": "LexicalList.js",
   "peerDependencies": {
-    "lexical": "0.12.3"
+    "lexical": "0.12.5"
   },
   "dependencies": {
-    "@lexical/utils": "0.12.3"
+    "@lexical/utils": "0.12.5"
   },
   "repository": {
     "type": "git",