@lexical/offset 0.7.0 → 0.7.2

package/LexicalOffset.dev.js

@@ -300,7 +300,7 @@ function $createOffsetNode(state, key, parent, nodeMap, offsetMap, blockOffsetSi
   const start = state.offset;
 
   if (lexical.$isElementNode(node)) {
-    const childKeys = node.getChildrenKeys();
+    const childKeys = createChildrenArray(node, nodeMap);
     const blockIsEmpty = childKeys.length === 0;
     const child = blockIsEmpty ? null : $createOffsetChild(state, childKeys, null, nodeMap, offsetMap, blockOffsetSize); // If the prev node was not a block or the block is empty, we should
     // account for the user being able to selection the block (due to the \n).

package/LexicalOffset.prod.js

@@ -10,6 +10,6 @@ k)return null;let l=0,e=0,g="element",n="element";"text"===f.type?(l=a-f.start,g
 a.anchor,c=a.focus,d=this._offsetMap;let f=b.offset;var h=c.offset;let m=a=-1;if("text"===b.type)b=d.get(b.key),void 0!==b&&(a=b.start+f);else if(b=b.getNode().getDescendantByIndex(f),null!==b){let k=d.get(b.getKey());void 0!==k&&(a=b.getIndexWithinParent()!==f?k.end:k.start)}"text"===c.type?(h=d.get(c.key),void 0!==h&&(m=h.start+c.offset)):(c=c.getNode().getDescendantByIndex(h),null!==c&&(d=d.get(c.getKey()),void 0!==d&&(m=c.getIndexWithinParent()!==h?d.end:d.start)));return[a,m]}}
 function z(a,b,c,d,f){let h=c._offsetMap;d=d._offsetMap;let m=new Set,k=a;for(;null!==b;){var l=b.key,e=h.get(l),g=b.end-b.start;m.add(l);void 0===e?k+=g:(l=e.end-e.start,l!==g&&(k+=g-l));g=b.prev;if(null!==g)b=g;else{for(b=b.parent;null!==b;)e=b.prev,null!==e&&(g=e.key,l=h.get(g),e=e.end-e.start,m.add(g),void 0===l?k+=e:(g=l.end-l.start,g!==e&&(k+=e-g))),b=b.parent;break}}c=c._firstNode;if(null!==c){b=y(c,a,f);for(a=!1;null!==b;){if(!m.has(b.key)){a=!0;break}b=b.parent}if(!a)for(;null!==b;)a=b.key,
 m.has(a)||(f=d.get(a),a=b.end-b.start,void 0===f?k-=a:(f=f.end-f.start,a!==f&&(k+=f-a))),b=b.prev}return k}function y(a,b,c){for(;null!==a;){if(b<a.end+("element"!==a.type||0===c?1:0)){let d=a.child;if(null!==d){a=d;continue}return a}a=a.next;if(null===a)break}return null}
-function A(a,b,c,d,f,h){let m=null,k=null,l=b.length;for(let v=0;v<l;v++){{var e=a;var g=b[v];var n=c,r=d,w=f,u=h,q=r.get(g);if(void 0===q)throw Error("Minified Lexical error #3; visit https://lexical.dev/docs/error?code=3 for the full message or use the non-minified dev environment for full errors and additional helpful warnings.");let x=e.offset;if(p.$isElementNode(q)){let B=q.getChildrenKeys();r=(q=0===B.length)?null:A(e,B,null,r,w,u);if(!e.prevIsBlock||q)e.prevIsBlock=!0,e.offset+=u;n={child:r,
-end:x,key:g,next:null,parent:n,prev:null,start:x,type:"element"};null!==r&&(r.parent=n);n.end=e.offset;w.set(g,n);g=n}else e.prevIsBlock=!1,u=p.$isTextNode(q),e={child:null,end:e.offset+=u?q.__text.length:1,key:g,next:null,parent:n,prev:null,start:x,type:u?"text":"inline"},w.set(g,e),g=e}null===k?m=g:(g.prev=k,k.next=g);k=g}return m}
-function C(a,b){let c=[];for(a=a.__first;null!==a;){let d=null===b?p.$getNodeByKey(a):b.get(a);if(null===d||void 0===d)throw Error("createChildrenArray: node does not exist in nodeMap");c.push(a);a=d.__next}return c}exports.$createOffsetView=function(a,b=1,c){c=(c||a._pendingEditorState||a._editorState)._nodeMap;let d=c.get("root");a=new Map;c=A({offset:0,prevIsBlock:!1},C(d,c),null,c,a,b);return new t(a,c,b)};exports.OffsetView=t;exports.createChildrenArray=C
+function A(a,b,c,d,f,h){let m=null,k=null,l=b.length;for(let v=0;v<l;v++){{var e=a;var g=b[v];var n=c,q=d,w=f,u=h,r=q.get(g);if(void 0===r)throw Error("Minified Lexical error #3; visit https://lexical.dev/docs/error?code=3 for the full message or use the non-minified dev environment for full errors and additional helpful warnings.");let x=e.offset;if(p.$isElementNode(r)){let C=B(r,q);q=(r=0===C.length)?null:A(e,C,null,q,w,u);if(!e.prevIsBlock||r)e.prevIsBlock=!0,e.offset+=u;n={child:q,end:x,key:g,
+next:null,parent:n,prev:null,start:x,type:"element"};null!==q&&(q.parent=n);n.end=e.offset;w.set(g,n);g=n}else e.prevIsBlock=!1,u=p.$isTextNode(r),e={child:null,end:e.offset+=u?r.__text.length:1,key:g,next:null,parent:n,prev:null,start:x,type:u?"text":"inline"},w.set(g,e),g=e}null===k?m=g:(g.prev=k,k.next=g);k=g}return m}
+function B(a,b){let c=[];for(a=a.__first;null!==a;){let d=null===b?p.$getNodeByKey(a):b.get(a);if(null===d||void 0===d)throw Error("createChildrenArray: node does not exist in nodeMap");c.push(a);a=d.__next}return c}exports.$createOffsetView=function(a,b=1,c){c=(c||a._pendingEditorState||a._editorState)._nodeMap;let d=c.get("root");a=new Map;c=A({offset:0,prevIsBlock:!1},B(d,c),null,c,a,b);return new t(a,c,b)};exports.OffsetView=t;exports.createChildrenArray=B

package/package.json

@@ -8,10 +8,10 @@
     "offset"
   ],
   "license": "MIT",
-  "version": "0.7.0",
+  "version": "0.7.2",
   "main": "LexicalOffset.js",
   "peerDependencies": {
-    "lexical": "0.7.0"
+    "lexical": "0.7.2"
   },
   "repository": {
     "type": "git",