@lexical/offset 0.13.1 → 0.14.1

package/LexicalOffset.dev.esm.js

@@ -0,0 +1,311 @@
+/**
+ * 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 { $getNodeByKey, $isTextNode, $createRangeSelection, $isElementNode } from 'lexical';
+
+/** @module @lexical/offset */
+class OffsetView {
+  constructor(offsetMap, firstNode, blockOffsetSize = 1) {
+    this._offsetMap = offsetMap;
+    this._firstNode = firstNode;
+    this._blockOffsetSize = blockOffsetSize;
+  }
+  createSelectionFromOffsets(originalStart, originalEnd, diffOffsetView) {
+    const firstNode = this._firstNode;
+    if (firstNode === null) {
+      return null;
+    }
+    let start = originalStart;
+    let end = originalEnd;
+    let startOffsetNode = $searchForNodeWithOffset(firstNode, start, this._blockOffsetSize);
+    let endOffsetNode = $searchForNodeWithOffset(firstNode, end, this._blockOffsetSize);
+    if (diffOffsetView !== undefined) {
+      start = $getAdjustedOffsetFromDiff(start, startOffsetNode, diffOffsetView, this, this._blockOffsetSize);
+      startOffsetNode = $searchForNodeWithOffset(firstNode, start, this._blockOffsetSize);
+      end = $getAdjustedOffsetFromDiff(end, endOffsetNode, diffOffsetView, this, this._blockOffsetSize);
+      endOffsetNode = $searchForNodeWithOffset(firstNode, end, this._blockOffsetSize);
+    }
+    if (startOffsetNode === null || endOffsetNode === null) {
+      return null;
+    }
+    let startKey = startOffsetNode.key;
+    let endKey = endOffsetNode.key;
+    const startNode = $getNodeByKey(startKey);
+    const endNode = $getNodeByKey(endKey);
+    if (startNode === null || endNode === null) {
+      return null;
+    }
+    let startOffset = 0;
+    let endOffset = 0;
+    let startType = 'element';
+    let endType = 'element';
+    if (startOffsetNode.type === 'text') {
+      startOffset = start - startOffsetNode.start;
+      startType = 'text';
+      // If we are at the edge of a text node and we
+      // don't have a collapsed selection, then let's
+      // try and correct the offset node.
+      const sibling = startNode.getNextSibling();
+      if (start !== end && startOffset === startNode.getTextContentSize() && $isTextNode(sibling)) {
+        startOffset = 0;
+        startKey = sibling.__key;
+      }
+    } else if (startOffsetNode.type === 'inline') {
+      startKey = startNode.getParentOrThrow().getKey();
+      startOffset = end > startOffsetNode.start ? startOffsetNode.end : startOffsetNode.start;
+    }
+    if (endOffsetNode.type === 'text') {
+      endOffset = end - endOffsetNode.start;
+      endType = 'text';
+    } else if (endOffsetNode.type === 'inline') {
+      endKey = endNode.getParentOrThrow().getKey();
+      endOffset = end > endOffsetNode.start ? endOffsetNode.end : endOffsetNode.start;
+    }
+    const selection = $createRangeSelection();
+    if (selection === null) {
+      return null;
+    }
+    selection.anchor.set(startKey, startOffset, startType);
+    selection.focus.set(endKey, endOffset, endType);
+    return selection;
+  }
+  getOffsetsFromSelection(selection) {
+    const anchor = selection.anchor;
+    const focus = selection.focus;
+    const offsetMap = this._offsetMap;
+    const anchorOffset = anchor.offset;
+    const focusOffset = focus.offset;
+    let start = -1;
+    let end = -1;
+    if (anchor.type === 'text') {
+      const offsetNode = offsetMap.get(anchor.key);
+      if (offsetNode !== undefined) {
+        start = offsetNode.start + anchorOffset;
+      }
+    } else {
+      const node = anchor.getNode().getDescendantByIndex(anchorOffset);
+      if (node !== null) {
+        const offsetNode = offsetMap.get(node.getKey());
+        if (offsetNode !== undefined) {
+          const isAtEnd = node.getIndexWithinParent() !== anchorOffset;
+          start = isAtEnd ? offsetNode.end : offsetNode.start;
+        }
+      }
+    }
+    if (focus.type === 'text') {
+      const offsetNode = offsetMap.get(focus.key);
+      if (offsetNode !== undefined) {
+        end = offsetNode.start + focus.offset;
+      }
+    } else {
+      const node = focus.getNode().getDescendantByIndex(focusOffset);
+      if (node !== null) {
+        const offsetNode = offsetMap.get(node.getKey());
+        if (offsetNode !== undefined) {
+          const isAtEnd = node.getIndexWithinParent() !== focusOffset;
+          end = isAtEnd ? offsetNode.end : offsetNode.start;
+        }
+      }
+    }
+    return [start, end];
+  }
+}
+function $getAdjustedOffsetFromDiff(offset, offsetNode, prevOffsetView, offsetView, blockOffsetSize) {
+  const prevOffsetMap = prevOffsetView._offsetMap;
+  const offsetMap = offsetView._offsetMap;
+  const visited = new Set();
+  let adjustedOffset = offset;
+  let currentNode = offsetNode;
+  while (currentNode !== null) {
+    const key = currentNode.key;
+    const prevNode = prevOffsetMap.get(key);
+    const diff = currentNode.end - currentNode.start;
+    visited.add(key);
+    if (prevNode === undefined) {
+      adjustedOffset += diff;
+    } else {
+      const prevDiff = prevNode.end - prevNode.start;
+      if (prevDiff !== diff) {
+        adjustedOffset += diff - prevDiff;
+      }
+    }
+    const sibling = currentNode.prev;
+    if (sibling !== null) {
+      currentNode = sibling;
+      continue;
+    }
+    let parent = currentNode.parent;
+    while (parent !== null) {
+      let parentSibling = parent.prev;
+      if (parentSibling !== null) {
+        const parentSiblingKey = parentSibling.key;
+        const prevParentSibling = prevOffsetMap.get(parentSiblingKey);
+        const parentDiff = parentSibling.end - parentSibling.start;
+        visited.add(parentSiblingKey);
+        if (prevParentSibling === undefined) {
+          adjustedOffset += parentDiff;
+        } else {
+          const prevParentDiff = prevParentSibling.end - prevParentSibling.start;
+          if (prevParentDiff !== parentDiff) {
+            adjustedOffset += parentDiff - prevParentDiff;
+          }
+        }
+        parentSibling = parentSibling.prev;
+      }
+      parent = parent.parent;
+    }
+    break;
+  }
+
+  // Now traverse through the old offsets nodes and find any nodes we missed
+  // above, because they were not in the latest offset node view (they have been
+  // deleted).
+  const prevFirstNode = prevOffsetView._firstNode;
+  if (prevFirstNode !== null) {
+    currentNode = $searchForNodeWithOffset(prevFirstNode, offset, blockOffsetSize);
+    let alreadyVisitedParentOfCurrentNode = false;
+    while (currentNode !== null) {
+      if (!visited.has(currentNode.key)) {
+        alreadyVisitedParentOfCurrentNode = true;
+        break;
+      }
+      currentNode = currentNode.parent;
+    }
+    if (!alreadyVisitedParentOfCurrentNode) {
+      while (currentNode !== null) {
+        const key = currentNode.key;
+        if (!visited.has(key)) {
+          const node = offsetMap.get(key);
+          const prevDiff = currentNode.end - currentNode.start;
+          if (node === undefined) {
+            adjustedOffset -= prevDiff;
+          } else {
+            const diff = node.end - node.start;
+            if (prevDiff !== diff) {
+              adjustedOffset += diff - prevDiff;
+            }
+          }
+        }
+        currentNode = currentNode.prev;
+      }
+    }
+  }
+  return adjustedOffset;
+}
+function $searchForNodeWithOffset(firstNode, offset, blockOffsetSize) {
+  let currentNode = firstNode;
+  while (currentNode !== null) {
+    const end = currentNode.end + (currentNode.type !== 'element' || blockOffsetSize === 0 ? 1 : 0);
+    if (offset < end) {
+      const child = currentNode.child;
+      if (child !== null) {
+        currentNode = child;
+        continue;
+      }
+      return currentNode;
+    }
+    const sibling = currentNode.next;
+    if (sibling === null) {
+      break;
+    }
+    currentNode = sibling;
+  }
+  return null;
+}
+function $createInternalOffsetNode(child, type, start, end, key, parent) {
+  return {
+    child,
+    end,
+    key,
+    next: null,
+    parent,
+    prev: null,
+    start,
+    type
+  };
+}
+function $createOffsetNode(state, key, parent, nodeMap, offsetMap, blockOffsetSize) {
+  const node = nodeMap.get(key);
+  if (node === undefined) {
+    {
+      throw Error(`createOffsetModel: could not find node by key`);
+    }
+  }
+  const start = state.offset;
+  if ($isElementNode(node)) {
+    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).
+    if (!state.prevIsBlock || blockIsEmpty) {
+      state.prevIsBlock = true;
+      state.offset += blockOffsetSize;
+    }
+    const offsetNode = $createInternalOffsetNode(child, 'element', start, start, key, parent);
+    if (child !== null) {
+      child.parent = offsetNode;
+    }
+    const end = state.offset;
+    offsetNode.end = end;
+    offsetMap.set(key, offsetNode);
+    return offsetNode;
+  }
+  state.prevIsBlock = false;
+  const isText = $isTextNode(node);
+  const length = isText ? node.__text.length : 1;
+  const end = state.offset += length;
+  const offsetNode = $createInternalOffsetNode(null, isText ? 'text' : 'inline', start, end, key, parent);
+  offsetMap.set(key, offsetNode);
+  return offsetNode;
+}
+function $createOffsetChild(state, children, parent, nodeMap, offsetMap, blockOffsetSize) {
+  let firstNode = null;
+  let currentNode = null;
+  const childrenLength = children.length;
+  for (let i = 0; i < childrenLength; i++) {
+    const childKey = children[i];
+    const offsetNode = $createOffsetNode(state, childKey, parent, nodeMap, offsetMap, blockOffsetSize);
+    if (currentNode === null) {
+      firstNode = offsetNode;
+    } else {
+      offsetNode.prev = currentNode;
+      currentNode.next = offsetNode;
+    }
+    currentNode = offsetNode;
+  }
+  return firstNode;
+}
+function createChildrenArray(element, nodeMap) {
+  const children = [];
+  let nodeKey = element.__first;
+  while (nodeKey !== null) {
+    const node = nodeMap === null ? $getNodeByKey(nodeKey) : nodeMap.get(nodeKey);
+    if (node === null || node === undefined) {
+      {
+        throw Error(`createChildrenArray: node does not exist in nodeMap`);
+      }
+    }
+    children.push(nodeKey);
+    nodeKey = node.__next;
+  }
+  return children;
+}
+function $createOffsetView(editor, blockOffsetSize = 1, editorState) {
+  const targetEditorState = editorState || editor._pendingEditorState || editor._editorState;
+  const nodeMap = targetEditorState._nodeMap;
+  const root = nodeMap.get('root');
+  const offsetMap = new Map();
+  const state = {
+    offset: 0,
+    prevIsBlock: false
+  };
+  const node = $createOffsetChild(state, createChildrenArray(root, nodeMap), null, nodeMap, offsetMap, blockOffsetSize);
+  return new OffsetView(offsetMap, node, blockOffsetSize);
+}
+
+export { $createOffsetView, OffsetView, createChildrenArray };

package/LexicalOffset.esm.js

@@ -0,0 +1,12 @@
+/**
+ * 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 * as modDev from './LexicalOffset.dev.esm.js';
+import * as modProd from './LexicalOffset.prod.esm.js';
+const mod = process.env.NODE_ENV === 'development' ? modDev : modProd;
+export const $createOffsetView = mod.$createOffsetView;
+export const OffsetView = mod.OffsetView;
+export const createChildrenArray = mod.createChildrenArray;

package/LexicalOffset.js

@@ -5,5 +5,5 @@
  * LICENSE file in the root directory of this source tree.
  */
 'use strict'
-const LexicalOffset = process.env.NODE_ENV === 'development' ? require('./LexicalOffset.dev.js') : require('./LexicalOffset.prod.js')
+const LexicalOffset = process.env.NODE_ENV === 'development' ? require('./LexicalOffset.dev.js') : require('./LexicalOffset.prod.js');
 module.exports = LexicalOffset;

package/LexicalOffset.prod.esm.js

@@ -0,0 +1,7 @@
+/**
+ * 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{$getNodeByKey as t,$isTextNode as e,$createRangeSelection as n,$isElementNode as l}from"lexical";var s=function(t){const e=new URLSearchParams;e.append("code",t);for(let t=1;t<arguments.length;t++)e.append("v",arguments[t]);throw Error(`Minified Lexical error #${t}; visit https://lexical.dev/docs/error?${e} for the full message or use the non-minified dev environment for full errors and additional helpful warnings.`)};class o{constructor(t,e,n=1){this._offsetMap=t,this._firstNode=e,this._blockOffsetSize=n}createSelectionFromOffsets(l,s,o){const f=this._firstNode;if(null===f)return null;let c=l,u=s,a=i(f,c,this._blockOffsetSize),d=i(f,u,this._blockOffsetSize);if(void 0!==o&&(c=r(c,a,o,this,this._blockOffsetSize),a=i(f,c,this._blockOffsetSize),u=r(u,d,o,this,this._blockOffsetSize),d=i(f,u,this._blockOffsetSize)),null===a||null===d)return null;let p=a.key,h=d.key;const g=t(p),v=t(h);if(null===g||null===v)return null;let _=0,k=0,y="element",x="element";if("text"===a.type){_=c-a.start,y="text";const t=g.getNextSibling();c!==u&&_===g.getTextContentSize()&&e(t)&&(_=0,p=t.__key)}else"inline"===a.type&&(p=g.getParentOrThrow().getKey(),_=u>a.start?a.end:a.start);"text"===d.type?(k=u-d.start,x="text"):"inline"===d.type&&(h=v.getParentOrThrow().getKey(),k=u>d.start?d.end:d.start);const S=n();return null===S?null:(S.anchor.set(p,_,y),S.focus.set(h,k,x),S)}getOffsetsFromSelection(t){const e=t.anchor,n=t.focus,l=this._offsetMap,s=e.offset,o=n.offset;let r=-1,i=-1;if("text"===e.type){const t=l.get(e.key);void 0!==t&&(r=t.start+s)}else{const t=e.getNode().getDescendantByIndex(s);if(null!==t){const e=l.get(t.getKey());if(void 0!==e){r=t.getIndexWithinParent()!==s?e.end:e.start}}}if("text"===n.type){const t=l.get(n.key);void 0!==t&&(i=t.start+n.offset)}else{const t=n.getNode().getDescendantByIndex(o);if(null!==t){const e=l.get(t.getKey());if(void 0!==e){i=t.getIndexWithinParent()!==o?e.end:e.start}}}return[r,i]}}function r(t,e,n,l,s){const o=n._offsetMap,r=l._offsetMap,f=new Set;let c=t,u=e;for(;null!==u;){const t=u.key,e=o.get(t),n=u.end-u.start;if(f.add(t),void 0===e)c+=n;else{const t=e.end-e.start;t!==n&&(c+=n-t)}const l=u.prev;if(null!==l){u=l;continue}let s=u.parent;for(;null!==s;){let t=s.prev;if(null!==t){const e=t.key,n=o.get(e),l=t.end-t.start;if(f.add(e),void 0===n)c+=l;else{const t=n.end-n.start;t!==l&&(c+=l-t)}t=t.prev}s=s.parent}break}const a=n._firstNode;if(null!==a){u=i(a,t,s);let e=!1;for(;null!==u;){if(!f.has(u.key)){e=!0;break}u=u.parent}if(!e)for(;null!==u;){const t=u.key;if(!f.has(t)){const e=r.get(t),n=u.end-u.start;if(void 0===e)c-=n;else{const t=e.end-e.start;n!==t&&(c+=t-n)}}u=u.prev}}return c}function i(t,e,n){let l=t;for(;null!==l;){if(e<l.end+("element"!==l.type||0===n?1:0)){const t=l.child;if(null!==t){l=t;continue}return l}const t=l.next;if(null===t)break;l=t}return null}function f(t,e,n,l,s,o){return{child:t,end:l,key:s,next:null,parent:o,prev:null,start:n,type:e}}function c(t,n,o,r,i,c){const d=r.get(n);void 0===d&&s(3);const p=t.offset;if(l(d)){const e=a(d,r),l=0===e.length,s=l?null:u(t,e,null,r,i,c);t.prevIsBlock&&!l||(t.prevIsBlock=!0,t.offset+=c);const h=f(s,"element",p,p,n,o);null!==s&&(s.parent=h);const g=t.offset;return h.end=g,i.set(n,h),h}t.prevIsBlock=!1;const h=e(d),g=h?d.__text.length:1,v=f(null,h?"text":"inline",p,t.offset+=g,n,o);return i.set(n,v),v}function u(t,e,n,l,s,o){let r=null,i=null;const f=e.length;for(let u=0;u<f;u++){const f=c(t,e[u],n,l,s,o);null===i?r=f:(f.prev=i,i.next=f),i=f}return r}function a(e,n){const l=[];let o=e.__first;for(;null!==o;){const e=null===n?t(o):n.get(o);null==e&&s(101),l.push(o),o=e.__next}return l}function d(t,e=1,n){const l=(n||t._pendingEditorState||t._editorState)._nodeMap,s=l.get("root"),r=new Map,i=u({offset:0,prevIsBlock:!1},a(s,l),null,l,r,e);return new o(r,i,e)}export{d as $createOffsetView,o as OffsetView,a as createChildrenArray};

package/README.md

@@ -1,3 +1,5 @@
 # `@lexical/offset`
 
+[![See API Documentation](https://lexical.dev/img/see-api-documentation.svg)](https://lexical.dev/docs/api/modules/lexical_offset)
+
 This package contains selection offset helpers for Lexical.

package/package.json

@@ -8,14 +8,16 @@
     "offset"
   ],
   "license": "MIT",
-  "version": "0.13.1",
+  "version": "0.14.1",
   "main": "LexicalOffset.js",
   "peerDependencies": {
-    "lexical": "0.13.1"
+    "lexical": "0.14.1"
   },
   "repository": {
     "type": "git",
     "url": "https://github.com/facebook/lexical",
     "directory": "packages/lexical-offset"
-  }
+  },
+  "module": "LexicalOffset.esm.js",
+  "sideEffects": false
 }