@atlaskit/editor-common 122.5.0 → 122.6.1

package/dist/es2019/collab/agent-edit-changed-ranges.js

@@ -0,0 +1,255 @@
+import isEqual from 'lodash/isEqual';
+// localId is identity metadata: regenerating it alone should not create activity.
+const sameAttrs = (left, right) => {
+  const keys = Object.keys(left).filter(key => key !== 'localId');
+  return keys.length === Object.keys(right).filter(key => key !== 'localId').length && keys.every(key => isEqual(left[key], right[key]));
+};
+
+// Compare the node's own type, attributes and marks, without comparing its children.
+const sameMarkup = (left, right) => left.type === right.type && sameAttrs(left.attrs, right.attrs) && left.marks.length === right.marks.length && left.marks.every((mark, index) => mark.type === right.marks[index].type && sameAttrs(mark.attrs, right.marks[index].attrs));
+const sameNode = (left, right) => {
+  if (left === right) {
+    return true;
+  }
+  if (!sameMarkup(left, right) || left.text !== right.text || left.childCount !== right.childCount) {
+    return false;
+  }
+  for (let index = 0; index < left.childCount; index++) {
+    if (!sameNode(left.child(index), right.child(index))) {
+      return false;
+    }
+  }
+  return true;
+};
+
+// Positions include document structure, not just character offsets. A non-leaf node
+// uses one position for each opening/closing boundary, plus the size of its content.
+// Example: paragraph('Hi') at pos 0 has nodeSize 4, outer range [0, 4),
+// and text content [1, 3). All ranges here use an exclusive end position.
+
+// Keep the reason internally so a panel attribute change can survive child edits.
+// Only ordinary { from, to } ranges are returned to the chrome consumer.
+
+const collectChanges = (before, after, map, ranges) => {
+  const {
+    node,
+    pos
+  } = after;
+  if (before && sameNode(before.node, node)) {
+    return;
+  }
+  // Text edits belong to their textblock. A node's own markup change instead
+  // owns its full content, so we stop here rather than adding child ranges too.
+  const markupChanged = !!before && node.isBlock && !sameMarkup(before.node, node);
+  if (node.isTextblock || markupChanged) {
+    if (node.content.size > 0) {
+      ranges.push({
+        from: pos,
+        to: pos + node.nodeSize,
+        markupChanged
+      });
+    }
+    return;
+  }
+  const byPosition = new Map();
+  const byId = new Map();
+  const oldChildren = [];
+  before === null || before === void 0 ? void 0 : before.node.forEach((child, offset) => {
+    // forEach offsets start inside the parent. Skip its opening boundary (+1)
+    // to convert this child offset into an absolute document position.
+    const previous = {
+      node: child,
+      pos: before.pos + 1 + offset
+    };
+    oldChildren.push(previous);
+    // This 1 is a mapping bias, not an added offset: follow the right side
+    // of an insertion at the child's start, keeping the original child after it.
+    const mapped = map.mapResult(previous.pos, 1);
+    if (!mapped.deleted) {
+      byPosition.set(mapped.pos, previous);
+    }
+    const id = child.attrs.localId;
+    if (typeof id === 'string' && id) {
+      // Duplicate IDs cannot identify a unique old child.
+      byId.set(id, byId.has(id) ? null : previous);
+    }
+  });
+  const nextChildren = [];
+  node.forEach((child, offset) => nextChildren.push({
+    node: child,
+    pos: pos + 1 + offset
+  }));
+  // Narrow edits usually preserve mapped positions. Whole-container replacements
+  // may erase those positions, so stable child IDs provide a second way to match.
+  const preferred = nextChildren.map(next => {
+    var _ref, _byPosition$get;
+    return (_ref = (_byPosition$get = byPosition.get(next.pos)) !== null && _byPosition$get !== void 0 ? _byPosition$get : byId.get(next.node.attrs.localId)) !== null && _ref !== void 0 ? _ref : undefined;
+  });
+  const claims = new Map();
+  for (const match of preferred) {
+    if (match) {
+      var _claims$get;
+      claims.set(match, ((_claims$get = claims.get(match)) !== null && _claims$get !== void 0 ? _claims$get : 0) + 1);
+    }
+  }
+  nextChildren.forEach((next, index) => {
+    const match = preferred[index];
+    // Same-index fallback supports replacements that regenerate IDs but keep
+    // the child structure. Different child counts make that correspondence unsafe.
+    const aligned = oldChildren.length === node.childCount ? oldChildren[index] : undefined;
+    // Reserve every position/ID match before fallback, including later siblings.
+    // Reusing one old sibling can otherwise disguise an equal-text insertion.
+    const previous = match && claims.get(match) === 1 ? match : aligned && !claims.has(aligned) ? aligned : undefined;
+    collectChanges(previous, next, map, ranges);
+  });
+};
+const findPreservedNode = (doc, previous, markupChanged, indexes) => {
+  const id = previous.attrs.localId;
+  if (typeof id !== 'string' || !id) {
+    return;
+  }
+  let byId = indexes.get(doc);
+  if (!byId) {
+    // Build only when mapping loses a candidate, then reuse for every range
+    // visiting this immutable snapshot. Ordinary mapped edits need no scan.
+    const nodeIndex = new Map();
+    doc.descendants((node, pos) => {
+      const localId = node.attrs.localId;
+      if (typeof localId === 'string' && localId) {
+        // Keep duplicates ambiguous, including IDs outside the changed subtree.
+        nodeIndex.set(localId, nodeIndex.has(localId) ? null : {
+          node,
+          pos
+        });
+      }
+    });
+    indexes.set(doc, nodeIndex);
+    byId = nodeIndex;
+  }
+  const match = byId.get(id);
+  // Attribute/mark activity belongs to the node even when its children are edited.
+  // Content-only activity still requires the entire candidate to survive unchanged.
+  const isPreserved = markupChanged ? sameMarkup : sameNode;
+  return match && isPreserved(previous, match.node) ? match : undefined;
+};
+const mapToFinalBlocks = (tr, index, range, indexes) => {
+  var _tr$docs;
+  let {
+    from,
+    to
+  } = range;
+  // Track inner content separately from outer node bounds: +1 skips the opening
+  // boundary and -1 excludes the closing boundary (see paragraph example above).
+  let contentFrom = from + 1;
+  let contentTo = to - 1;
+  // docs[i] is the document BEFORE step i, so docs[i + 1] is its result.
+  // The last step has no next snapshot; tr.doc is its result instead.
+  let node = ((_tr$docs = tr.docs[index + 1]) !== null && _tr$docs !== void 0 ? _tr$docs : tr.doc).nodeAt(from);
+  if (!node) {
+    return [];
+  }
+  // Later non-AI steps also shift/delete existing activity, even though they
+  // cannot create new activity themselves. Process every intermediate document.
+  for (let next = index + 1; next < tr.steps.length; next++) {
+    var _tr$docs2;
+    const map = tr.mapping.maps[next];
+    const after = (_tr$docs2 = tr.docs[next + 1]) !== null && _tr$docs2 !== void 0 ? _tr$docs2 : tr.doc;
+    // Mapping biases +1 (right) and -1 (left) keep boundary insertions outside
+    // the tracked content. These arguments do not add/subtract document positions.
+    const start = map.mapResult(contentFrom, 1);
+    const end = map.mapResult(contentTo, -1);
+    if (start.deleted && end.deleted || end.pos <= start.pos) {
+      // A cumulative replacement can preserve the candidate content or owned markup.
+      // Check every intermediate doc so deletion then reinsertion never resurrects it.
+      const preserved = findPreservedNode(after, node, range.markupChanged, indexes);
+      if (!preserved) {
+        return [];
+      }
+      from = preserved.pos;
+      to = from + preserved.node.nodeSize;
+      contentFrom = from + 1;
+      contentTo = to - 1;
+      node = preserved.node;
+    } else {
+      // Apply the same inward biases to the outer node bounds.
+      from = map.map(from, 1);
+      to = map.map(to, -1);
+      contentFrom = start.pos;
+      contentTo = end.pos;
+      const current = after.nodeAt(from);
+      if (current && current.nodeSize === to - from) {
+        node = current;
+      }
+    }
+  }
+  if (from < 0 || to > tr.doc.content.size || contentTo <= contentFrom) {
+    return [];
+  }
+  const finalNode = tr.doc.nodeAt(from);
+  if (finalNode !== null && finalNode !== void 0 && finalNode.isBlock && finalNode.nodeSize === to - from) {
+    return [{
+      from,
+      to
+    }];
+  }
+  // Joins/splits can leave mapped boundaries inside the final textblock.
+  const blocks = [];
+  tr.doc.nodesBetween(contentFrom, contentTo, (child, pos) => {
+    if (child.isTextblock) {
+      blocks.push({
+        from: pos,
+        to: pos + child.nodeSize
+      });
+      return false;
+    }
+  });
+  return blocks;
+};
+
+/**
+ * Returns whole content-block ranges for selected applied steps, in tr.doc coordinates.
+ * Callers select actual AI writes (excluding restores, acknowledgments and preparation)
+ * and own experiment/lifecycle decisions. This helper does not dispatch or render.
+ *
+ * Comparing each step's snapshots also handles attribute/mark steps with empty maps.
+ * Shared unchanged subtrees are skipped by reference. Only localId changes are ignored;
+ * meaningful attributes and marks retain the affected node's full content scope.
+ */
+export function getAgentEditChangedRanges(tr, includedStepIndexes) {
+  // Positions belong to each intermediate document, not just tr.doc. Keep the
+  // lazy indexes local to this call so deletion/reinsertion checks stay intact
+  // and no cache is retained between transactions or streaming chunks.
+  const indexes = new WeakMap();
+  const ranges = [];
+  for (const index of new Set(includedStepIndexes)) {
+    var _tr$docs3;
+    if (!Number.isInteger(index) || index < 0 || index >= tr.steps.length) {
+      continue;
+    }
+    const changed = [];
+    // The root document has no opening boundary. Using -1 makes the recursive
+    // parent.pos + 1 + offset formula place its first child at position 0.
+    collectChanges({
+      node: tr.docs[index],
+      pos: -1
+    }, {
+      node: (_tr$docs3 = tr.docs[index + 1]) !== null && _tr$docs3 !== void 0 ? _tr$docs3 : tr.doc,
+      pos: -1
+    }, tr.steps[index].getMap(), changed);
+    for (const range of changed) {
+      ranges.push(...mapToFinalBlocks(tr, index, range, indexes));
+    }
+  }
+
+  // Return only the surviving final-document ranges, never intermediate step states.
+  // Sort outer ranges before their children, then discard duplicates/contained ranges.
+  // Separate ranges stay separate; this must not highlight the untouched gaps.
+  const unique = [];
+  for (const range of ranges.sort((left, right) => left.from - right.from || right.to - left.to)) {
+    const previous = unique[unique.length - 1];
+    if (!previous || range.to > previous.to) {
+      unique.push(range);
+    }
+  }
+  return unique;
+}

package/dist/es2019/monitoring/error.js

@@ -13,7 +13,7 @@ const NETWORK_FAILURE_REGEX = /^network failure/i;
 const RESIZE_OBSERVER_LOOP_REGEX = /ResizeObserver loop completed with undelivered notifications/;
 const SENTRY_DSN = 'https://0b10c8e02fb44d8796c047b102c9bee8@o55978.ingest.sentry.io/4505129224110080';
 const packageName = 'editor-common'; // Sentry doesn't accept '/' in its releases https://docs.sentry.io/platforms/javascript/configuration/releases/
-const packageVersion = "122.4.0";
+const packageVersion = "122.6.0";
 const sanitiseSentryEvents = (data, _hint) => {
   // Remove URL as it has UGC
   // Ignored via go/ees007

package/dist/es2019/preset/core-plugin/index.js

@@ -1,6 +1,5 @@
 import { Node } from '@atlaskit/editor-prosemirror/model';
 import { fg } from '@atlaskit/platform-feature-flags/fg';
-import { expValEquals } from '@atlaskit/tmp-editor-statsig/exp-val-equals';
 import { getNodeIdProvider } from '../../node-anchor/node-anchor-provider';
 import { processRawFragmentValue } from '../../utils/processRawFragmentValue';
 import { processRawValue, processRawValueWithoutValidation } from '../../utils/processRawValue';
@@ -24,17 +23,14 @@ export const corePlugin = ({
       const pluginState = state && appearancePluginKey.getState(state);
       return {
         schema: state === null || state === void 0 ? void 0 : state.schema,
-        appearance: expValEquals('platform_editor_appearance_shared_state', 'isEnabled', true) ? pluginState === null || pluginState === void 0 ? void 0 : pluginState.appearance : undefined
+        appearance: pluginState === null || pluginState === void 0 ? void 0 : pluginState.appearance
       };
     },
     pmPlugins() {
-      if (expValEquals('platform_editor_appearance_shared_state', 'isEnabled', true)) {
-        return [{
-          name: 'appearancePlugin',
-          plugin: () => createAppearancePlugin(config === null || config === void 0 ? void 0 : config.appearance)
-        }];
-      }
-      return [];
+      return [{
+        name: 'appearancePlugin',
+        plugin: () => createAppearancePlugin(config === null || config === void 0 ? void 0 : config.appearance)
+      }];
     },
     actions: {
       execute: command => {
@@ -111,9 +107,6 @@ export const corePlugin = ({
       },
       updateAppearance: newAppearance => {
         var _appearancePluginKey$;
-        if (!expValEquals('platform_editor_appearance_shared_state', 'isEnabled', true)) {
-          return false;
-        }
         const editorView = config === null || config === void 0 ? void 0 : config.getEditorView();
         if (!editorView) {
           return false;

package/dist/es2019/transforms/getFormattedNode.js

@@ -1,5 +1,4 @@
 import { findParentNodeOfType, findSelectedNodeOfType } from '@atlaskit/editor-prosemirror/utils';
-import { expValEquals } from '@atlaskit/tmp-editor-statsig/exp-val-equals';
 export const getFormattedNode = tr => {
   const {
     selection
@@ -7,10 +6,7 @@ export const getFormattedNode = tr => {
   const {
     nodes
   } = tr.doc.type.schema;
-
-  // gating behind platform_editor_small_font_size to support task lists with font size applied,
-  // but keep this solution general
-  const isBlockTaskItemEnabled = !!nodes.blockTaskItem && expValEquals('platform_editor_small_font_size', 'isEnabled', true);
+  const isBlockTaskItemEnabled = !!nodes.blockTaskItem;
 
   // Find the node to format from the current selection
   let nodeToFormat;

package/dist/es2019/transforms/list-transforms.js

@@ -1,5 +1,4 @@
 import { Fragment } from '@atlaskit/editor-prosemirror/model';
-import { expValEquals } from '@atlaskit/tmp-editor-statsig/exp-val-equals';
 import { convertBlockToInlineContent } from './convertBlockToInlineContent';
 import { createBlockTaskItem } from './createBlockTaskItem';
 import { isBulletOrOrderedList } from './isBulletOrOrderedList';
@@ -34,10 +33,7 @@ export const transformListRecursively = (props, onhandleUnsupportedContent) => {
     paragraph,
     blockTaskItem
   } = schema.nodes;
-
-  // gating behind platform_editor_small_font_size to support task lists with font size applied,
-  // but keep this solution general
-  const isBlockTaskEnabled = !!blockTaskItem && expValEquals('platform_editor_small_font_size', 'isEnabled', true);
+  const isBlockTaskEnabled = !!blockTaskItem;
 
   /**
    * Extracts paragraph children from a blockTaskItem, preserving their marks.
@@ -204,9 +200,7 @@ export const transformToTaskList = (tr, range, targetNodeType, targetAttrs, node
       paragraph,
       blockTaskItem
     } = nodes;
-    // gating behind platform_editor_small_font_size to support task lists with font size applied,
-    // but keep this solution general
-    const isBlockTaskItemEnabled = !!blockTaskItem && expValEquals('platform_editor_small_font_size', 'isEnabled', true);
+    const isBlockTaskItemEnabled = !!blockTaskItem;
     const listItems = [];
 
     // Process each block in the range

package/dist/es2019/transforms/transformTaskListToBlockNodes.js

@@ -1,6 +1,5 @@
 import { Fragment, Slice } from '@atlaskit/editor-prosemirror/model';
 import { findChildrenByType } from '@atlaskit/editor-prosemirror/utils';
-import { expValEquals } from '@atlaskit/tmp-editor-statsig/exp-val-equals';
 export const transformTaskListToBlockNodes = context => {
   const {
     tr,
@@ -16,10 +15,7 @@ export const transformTaskListToBlockNodes = context => {
   const {
     blockTaskItem
   } = schema.nodes;
-
-  // gating behind platform_editor_small_font_size to support task lists with font size applied,
-  // but keep this solution general
-  const isBlockTaskItemEnabled = !!blockTaskItem && expValEquals('platform_editor_small_font_size', 'isEnabled', true);
+  const isBlockTaskItemEnabled = !!blockTaskItem;
   if (isBlockTaskItemEnabled) {
     const blockTaskItemsResult = findChildrenByType(sourceNode, blockTaskItem);
     if (blockTaskItemsResult.length > 0 && targetNodeType === schema.nodes.paragraph) {

package/dist/es2019/ui/DropList/index.js

@@ -14,7 +14,7 @@ import withAnalyticsEvents from '@atlaskit/analytics-next/withAnalyticsEvents';
 import { fg } from '@atlaskit/platform-feature-flags/fg';
 import Layer from '../Layer';
 const packageName = "@atlaskit/editor-common";
-const packageVersion = "122.4.0";
+const packageVersion = "122.6.0";
 const halfFocusRing = 1;
 const dropOffset = '0, 8';
 const fadeIn = keyframes({

package/dist/esm/collab/agent-edit-changed-ranges.js

@@ -0,0 +1,297 @@
+import _toConsumableArray from "@babel/runtime/helpers/toConsumableArray";
+function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t.return || t.return(); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+import isEqual from 'lodash/isEqual';
+// localId is identity metadata: regenerating it alone should not create activity.
+var sameAttrs = function sameAttrs(left, right) {
+  var keys = Object.keys(left).filter(function (key) {
+    return key !== 'localId';
+  });
+  return keys.length === Object.keys(right).filter(function (key) {
+    return key !== 'localId';
+  }).length && keys.every(function (key) {
+    return isEqual(left[key], right[key]);
+  });
+};
+
+// Compare the node's own type, attributes and marks, without comparing its children.
+var sameMarkup = function sameMarkup(left, right) {
+  return left.type === right.type && sameAttrs(left.attrs, right.attrs) && left.marks.length === right.marks.length && left.marks.every(function (mark, index) {
+    return mark.type === right.marks[index].type && sameAttrs(mark.attrs, right.marks[index].attrs);
+  });
+};
+var _sameNode = function sameNode(left, right) {
+  if (left === right) {
+    return true;
+  }
+  if (!sameMarkup(left, right) || left.text !== right.text || left.childCount !== right.childCount) {
+    return false;
+  }
+  for (var index = 0; index < left.childCount; index++) {
+    if (!_sameNode(left.child(index), right.child(index))) {
+      return false;
+    }
+  }
+  return true;
+};
+
+// Positions include document structure, not just character offsets. A non-leaf node
+// uses one position for each opening/closing boundary, plus the size of its content.
+// Example: paragraph('Hi') at pos 0 has nodeSize 4, outer range [0, 4),
+// and text content [1, 3). All ranges here use an exclusive end position.
+
+// Keep the reason internally so a panel attribute change can survive child edits.
+// Only ordinary { from, to } ranges are returned to the chrome consumer.
+
+var _collectChanges = function collectChanges(before, after, map, ranges) {
+  var node = after.node,
+    pos = after.pos;
+  if (before && _sameNode(before.node, node)) {
+    return;
+  }
+  // Text edits belong to their textblock. A node's own markup change instead
+  // owns its full content, so we stop here rather than adding child ranges too.
+  var markupChanged = !!before && node.isBlock && !sameMarkup(before.node, node);
+  if (node.isTextblock || markupChanged) {
+    if (node.content.size > 0) {
+      ranges.push({
+        from: pos,
+        to: pos + node.nodeSize,
+        markupChanged: markupChanged
+      });
+    }
+    return;
+  }
+  var byPosition = new Map();
+  var byId = new Map();
+  var oldChildren = [];
+  before === null || before === void 0 || before.node.forEach(function (child, offset) {
+    // forEach offsets start inside the parent. Skip its opening boundary (+1)
+    // to convert this child offset into an absolute document position.
+    var previous = {
+      node: child,
+      pos: before.pos + 1 + offset
+    };
+    oldChildren.push(previous);
+    // This 1 is a mapping bias, not an added offset: follow the right side
+    // of an insertion at the child's start, keeping the original child after it.
+    var mapped = map.mapResult(previous.pos, 1);
+    if (!mapped.deleted) {
+      byPosition.set(mapped.pos, previous);
+    }
+    var id = child.attrs.localId;
+    if (typeof id === 'string' && id) {
+      // Duplicate IDs cannot identify a unique old child.
+      byId.set(id, byId.has(id) ? null : previous);
+    }
+  });
+  var nextChildren = [];
+  node.forEach(function (child, offset) {
+    return nextChildren.push({
+      node: child,
+      pos: pos + 1 + offset
+    });
+  });
+  // Narrow edits usually preserve mapped positions. Whole-container replacements
+  // may erase those positions, so stable child IDs provide a second way to match.
+  var preferred = nextChildren.map(function (next) {
+    var _ref, _byPosition$get;
+    return (_ref = (_byPosition$get = byPosition.get(next.pos)) !== null && _byPosition$get !== void 0 ? _byPosition$get : byId.get(next.node.attrs.localId)) !== null && _ref !== void 0 ? _ref : undefined;
+  });
+  var claims = new Map();
+  var _iterator = _createForOfIteratorHelper(preferred),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var match = _step.value;
+      if (match) {
+        var _claims$get;
+        claims.set(match, ((_claims$get = claims.get(match)) !== null && _claims$get !== void 0 ? _claims$get : 0) + 1);
+      }
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  nextChildren.forEach(function (next, index) {
+    var match = preferred[index];
+    // Same-index fallback supports replacements that regenerate IDs but keep
+    // the child structure. Different child counts make that correspondence unsafe.
+    var aligned = oldChildren.length === node.childCount ? oldChildren[index] : undefined;
+    // Reserve every position/ID match before fallback, including later siblings.
+    // Reusing one old sibling can otherwise disguise an equal-text insertion.
+    var previous = match && claims.get(match) === 1 ? match : aligned && !claims.has(aligned) ? aligned : undefined;
+    _collectChanges(previous, next, map, ranges);
+  });
+};
+var findPreservedNode = function findPreservedNode(doc, previous, markupChanged, indexes) {
+  var id = previous.attrs.localId;
+  if (typeof id !== 'string' || !id) {
+    return;
+  }
+  var byId = indexes.get(doc);
+  if (!byId) {
+    // Build only when mapping loses a candidate, then reuse for every range
+    // visiting this immutable snapshot. Ordinary mapped edits need no scan.
+    var nodeIndex = new Map();
+    doc.descendants(function (node, pos) {
+      var localId = node.attrs.localId;
+      if (typeof localId === 'string' && localId) {
+        // Keep duplicates ambiguous, including IDs outside the changed subtree.
+        nodeIndex.set(localId, nodeIndex.has(localId) ? null : {
+          node: node,
+          pos: pos
+        });
+      }
+    });
+    indexes.set(doc, nodeIndex);
+    byId = nodeIndex;
+  }
+  var match = byId.get(id);
+  // Attribute/mark activity belongs to the node even when its children are edited.
+  // Content-only activity still requires the entire candidate to survive unchanged.
+  var isPreserved = markupChanged ? sameMarkup : _sameNode;
+  return match && isPreserved(previous, match.node) ? match : undefined;
+};
+var mapToFinalBlocks = function mapToFinalBlocks(tr, index, range, indexes) {
+  var _tr$docs;
+  var from = range.from,
+    to = range.to;
+  // Track inner content separately from outer node bounds: +1 skips the opening
+  // boundary and -1 excludes the closing boundary (see paragraph example above).
+  var contentFrom = from + 1;
+  var contentTo = to - 1;
+  // docs[i] is the document BEFORE step i, so docs[i + 1] is its result.
+  // The last step has no next snapshot; tr.doc is its result instead.
+  var node = ((_tr$docs = tr.docs[index + 1]) !== null && _tr$docs !== void 0 ? _tr$docs : tr.doc).nodeAt(from);
+  if (!node) {
+    return [];
+  }
+  // Later non-AI steps also shift/delete existing activity, even though they
+  // cannot create new activity themselves. Process every intermediate document.
+  for (var next = index + 1; next < tr.steps.length; next++) {
+    var _tr$docs2;
+    var map = tr.mapping.maps[next];
+    var after = (_tr$docs2 = tr.docs[next + 1]) !== null && _tr$docs2 !== void 0 ? _tr$docs2 : tr.doc;
+    // Mapping biases +1 (right) and -1 (left) keep boundary insertions outside
+    // the tracked content. These arguments do not add/subtract document positions.
+    var start = map.mapResult(contentFrom, 1);
+    var end = map.mapResult(contentTo, -1);
+    if (start.deleted && end.deleted || end.pos <= start.pos) {
+      // A cumulative replacement can preserve the candidate content or owned markup.
+      // Check every intermediate doc so deletion then reinsertion never resurrects it.
+      var preserved = findPreservedNode(after, node, range.markupChanged, indexes);
+      if (!preserved) {
+        return [];
+      }
+      from = preserved.pos;
+      to = from + preserved.node.nodeSize;
+      contentFrom = from + 1;
+      contentTo = to - 1;
+      node = preserved.node;
+    } else {
+      // Apply the same inward biases to the outer node bounds.
+      from = map.map(from, 1);
+      to = map.map(to, -1);
+      contentFrom = start.pos;
+      contentTo = end.pos;
+      var current = after.nodeAt(from);
+      if (current && current.nodeSize === to - from) {
+        node = current;
+      }
+    }
+  }
+  if (from < 0 || to > tr.doc.content.size || contentTo <= contentFrom) {
+    return [];
+  }
+  var finalNode = tr.doc.nodeAt(from);
+  if (finalNode !== null && finalNode !== void 0 && finalNode.isBlock && finalNode.nodeSize === to - from) {
+    return [{
+      from: from,
+      to: to
+    }];
+  }
+  // Joins/splits can leave mapped boundaries inside the final textblock.
+  var blocks = [];
+  tr.doc.nodesBetween(contentFrom, contentTo, function (child, pos) {
+    if (child.isTextblock) {
+      blocks.push({
+        from: pos,
+        to: pos + child.nodeSize
+      });
+      return false;
+    }
+  });
+  return blocks;
+};
+
+/**
+ * Returns whole content-block ranges for selected applied steps, in tr.doc coordinates.
+ * Callers select actual AI writes (excluding restores, acknowledgments and preparation)
+ * and own experiment/lifecycle decisions. This helper does not dispatch or render.
+ *
+ * Comparing each step's snapshots also handles attribute/mark steps with empty maps.
+ * Shared unchanged subtrees are skipped by reference. Only localId changes are ignored;
+ * meaningful attributes and marks retain the affected node's full content scope.
+ */
+export function getAgentEditChangedRanges(tr, includedStepIndexes) {
+  // Positions belong to each intermediate document, not just tr.doc. Keep the
+  // lazy indexes local to this call so deletion/reinsertion checks stay intact
+  // and no cache is retained between transactions or streaming chunks.
+  var indexes = new WeakMap();
+  var ranges = [];
+  var _iterator2 = _createForOfIteratorHelper(new Set(includedStepIndexes)),
+    _step2;
+  try {
+    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+      var _tr$docs3;
+      var index = _step2.value;
+      if (!Number.isInteger(index) || index < 0 || index >= tr.steps.length) {
+        continue;
+      }
+      var changed = [];
+      // The root document has no opening boundary. Using -1 makes the recursive
+      // parent.pos + 1 + offset formula place its first child at position 0.
+      _collectChanges({
+        node: tr.docs[index],
+        pos: -1
+      }, {
+        node: (_tr$docs3 = tr.docs[index + 1]) !== null && _tr$docs3 !== void 0 ? _tr$docs3 : tr.doc,
+        pos: -1
+      }, tr.steps[index].getMap(), changed);
+      for (var _i = 0, _changed = changed; _i < _changed.length; _i++) {
+        var range = _changed[_i];
+        ranges.push.apply(ranges, _toConsumableArray(mapToFinalBlocks(tr, index, range, indexes)));
+      }
+    }
+
+    // Return only the surviving final-document ranges, never intermediate step states.
+    // Sort outer ranges before their children, then discard duplicates/contained ranges.
+    // Separate ranges stay separate; this must not highlight the untouched gaps.
+  } catch (err) {
+    _iterator2.e(err);
+  } finally {
+    _iterator2.f();
+  }
+  var unique = [];
+  var _iterator3 = _createForOfIteratorHelper(ranges.sort(function (left, right) {
+      return left.from - right.from || right.to - left.to;
+    })),
+    _step3;
+  try {
+    for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
+      var _range = _step3.value;
+      var previous = unique[unique.length - 1];
+      if (!previous || _range.to > previous.to) {
+        unique.push(_range);
+      }
+    }
+  } catch (err) {
+    _iterator3.e(err);
+  } finally {
+    _iterator3.f();
+  }
+  return unique;
+}