@fluidframework/merge-tree 2.3.0-288113 → 2.4.0-294316

package/dist/mergeTree.js

@@ -24,12 +24,8 @@ const properties_js_1 = require("./properties.js");
 const referencePositions_js_1 = require("./referencePositions.js");
 // eslint-disable-next-line import/no-deprecated
 const segmentPropertiesManager_js_1 = require("./segmentPropertiesManager.js");
-const sequencePlace_js_1 = require("./sequencePlace.js");
+const sortedSegmentSet_js_1 = require("./sortedSegmentSet.js");
 const zamboni_js_1 = require("./zamboni.js");
-function wasRemovedAfter(seg, seq) {
-    return (seg.removedSeq !== constants_js_1.UnassignedSequenceNumber &&
-        (seg.removedSeq === undefined || seg.removedSeq > seq));
-}
 function markSegmentMoved(seg, moveInfo) {
     seg.moveDst = moveInfo.moveDst;
     seg.movedClientIds = [...moveInfo.movedClientIds];
@@ -180,6 +176,67 @@ function getSlideToSegoff(segoff, slidingPreference = localReference_js_1.Slidin
 exports.getSlideToSegoff = getSlideToSegoff;
 const forwardPred = (ref) => ref.slidingPreference !== localReference_js_1.SlidingPreference.BACKWARD;
 const backwardPred = (ref) => ref.slidingPreference === localReference_js_1.SlidingPreference.BACKWARD;
+class Obliterates {
+    constructor(mergeTree) {
+        this.mergeTree = mergeTree;
+        /**
+         * Array containing the all move operations within the
+         * collab window.
+         *
+         * The moves are stored in sequence order which accelerates clean up in setMinSeq
+         *
+         * See https://github.com/microsoft/FluidFramework/blob/main/packages/dds/merge-tree/docs/Obliterate.md#remote-perspective
+         * for additional context
+         */
+        // eslint-disable-next-line import/no-deprecated
+        this.seqOrdered = new index_js_1.DoublyLinkedList();
+        /**
+         * This contains a sorted lists of all obliterate starts
+         * and is used to accelerate finding overlapping obliterates
+         * as well as determining if there are any obliterates at all.
+         */
+        this.startOrdered = new sortedSegmentSet_js_1.SortedSegmentSet();
+    }
+    setMinSeq(minSeq) {
+        // eslint-disable-next-line @typescript-eslint/no-non-null-asserted-optional-chain
+        while (!this.seqOrdered.empty && this.seqOrdered.first?.data.seq <= minSeq) {
+            const ob = this.seqOrdered.shift();
+            this.startOrdered.remove(ob.data.start);
+            this.mergeTree.removeLocalReferencePosition(ob.data.start);
+            this.mergeTree.removeLocalReferencePosition(ob.data.end);
+        }
+    }
+    // eslint-disable-next-line import/no-deprecated
+    addOrUpdate(obliterateInfo) {
+        const { seq, start } = obliterateInfo;
+        if (seq !== constants_js_1.UnassignedSequenceNumber) {
+            this.seqOrdered.push(obliterateInfo);
+        }
+        this.startOrdered.addOrUpdate(start);
+    }
+    empty() {
+        return this.startOrdered.size === 0;
+    }
+    // eslint-disable-next-line import/no-deprecated
+    findOverlapping(seg) {
+        // eslint-disable-next-line import/no-deprecated
+        const overlapping = [];
+        for (const start of this.startOrdered.items) {
+            if (start.getSegment().ordinal <= seg.ordinal) {
+                // eslint-disable-next-line import/no-deprecated
+                const ob = start.properties?.obliterate;
+                if (ob.end.getSegment().ordinal >= seg.ordinal) {
+                    overlapping.push(ob);
+                }
+            }
+            else {
+                // the start is past the seg, so exit
+                break;
+            }
+        }
+        return overlapping;
+    }
+}
 /**
  * @internal
  */
@@ -200,36 +257,7 @@ class MergeTree {
         // for now assume only markers have ids and so point directly at the Segment
         // if we need to have pointers to non-markers, we can change to point at local refs
         this.idToMarker = new Map();
-        /**
-         * Array containing the sequence number of all move operations within the
-         * collab window
-         *
-         * When a segment is inserted, we must traverse to the left and right of it
-         * to determine whether the segment was inserted into an obliterated range.
-         * By keeping track of all move seqs, we can significantly reduce the search
-         * space we must traverse.
-         *
-         * Sequence numbers in `moveSeqs` are sorted to accelerate bookkeeping.
-         *
-         * See https://github.com/microsoft/FluidFramework/blob/main/packages/dds/merge-tree/docs/Obliterate.md#remote-perspective
-         * for additional context
-         */
-        this.moveSeqs = [];
-        /**
-         * Similar to moveSeqs, but tracks local moves. These are not the move
-         * operations within the collab window, but rather local moves that have
-         * not been acked.
-         */
-        this.localMoveSeqs = new Set();
-        /**
-         * Groups of segments moved by local moves/obliterates
-         *
-         * When a local obliterate is acked, we must also ack segments that were
-         * concurrently obliterated on insert. We check this segment group to find
-         * such segments
-         */
-        // eslint-disable-next-line import/no-deprecated
-        this.locallyMovedSegments = new Map();
+        this.obliterates = new Obliterates(this);
         this.splitLeafSegment = (segment, pos) => {
             if (!(pos > 0 && segment)) {
                 return {};
@@ -345,7 +373,6 @@ class MergeTree {
                  childIndex++, nodeIndex++ // Advance to next child & node
                 ) {
                     // Insert the next node into the current block
-                    // TODO Non null asserting, why is this not null?
                     this.addNode(block, nodes[nodeIndex]);
                 }
                 // Calculate this block's info.  Previously this was inlined into the above loop as a micro-optimization,
@@ -354,8 +381,7 @@ class MergeTree {
                 this.blockUpdate(block);
             }
             return blocks.length === 1 // If there is only one block at this layer...
-                ? // Non null asserting here because of the length check above
-                    blocks[0] // ...then we're done.  Return the root.
+                ? blocks[0] // ...then we're done.  Return the root.
                 : buildMergeBlock(blocks); // ...otherwise recursively build the next layer above blocks.
         };
         if (segments.length > 0) {
@@ -403,7 +429,6 @@ class MergeTree {
         while (parent) {
             const children = parent.children;
             for (let childIndex = 0; childIndex < parent.childCount; childIndex++) {
-                // TODO Non null asserting, why is this not null?
                 const child = children[childIndex];
                 if ((!!prevParent && child === prevParent) || child === node) {
                     break;
@@ -618,8 +643,7 @@ class MergeTree {
         (0, internal_1.assert)(this.collabWindow.minSeq <= minSeq, 0x04f /* "minSeq of collab window > target minSeq!" */);
         if (minSeq > this.collabWindow.minSeq) {
             this.collabWindow.minSeq = minSeq;
-            const firstMoveSeqIdx = this.moveSeqs.findIndex((seq) => seq >= minSeq);
-            this.moveSeqs = firstMoveSeqIdx === -1 ? [] : this.moveSeqs.slice(firstMoveSeqIdx);
+            this.obliterates.setMinSeq(minSeq);
             if (MergeTree.options.zamboniSegments) {
                 (0, zamboni_js_1.zamboniSegments)(this);
             }
@@ -727,34 +751,8 @@ class MergeTree {
             const deltaSegments = [];
             const overlappingRemoves = [];
             pendingSegmentGroup.segments.map((pendingSegment) => {
-                const localMovedSeq = pendingSegment.localMovedSeq;
                 const overlappingRemove = !pendingSegment.ack(pendingSegmentGroup, opArgs);
-                if (opArgs.op.type === ops_js_1.MergeTreeDeltaType.OBLITERATE && localMovedSeq !== undefined) {
-                    const locallyMovedSegments = this.locallyMovedSegments.get(localMovedSeq);
-                    if (locallyMovedSegments) {
-                        // Disabling because a for of loop causes the type of segment to be ISegment, which does not have parent information stored
-                        // eslint-disable-next-line unicorn/no-array-for-each
-                        locallyMovedSegments.segments.forEach((segment) => {
-                            segment.localMovedSeq = undefined;
-                            if (!nodesToUpdate.includes(segment.parent)) {
-                                nodesToUpdate.push(segment.parent);
-                            }
-                            if (segment.movedSeq === constants_js_1.UnassignedSequenceNumber) {
-                                segment.movedSeq = seq;
-                            }
-                        });
-                        this.locallyMovedSegments.delete(localMovedSeq);
-                    }
-                }
                 overwrite = overlappingRemove || overwrite;
-                if (opArgs.op.type === ops_js_1.MergeTreeDeltaType.OBLITERATE) {
-                    if (seq !== this.moveSeqs[this.moveSeqs.length - 1]) {
-                        this.moveSeqs.push(seq);
-                    }
-                    if (localMovedSeq !== undefined) {
-                        this.localMoveSeqs.delete(localMovedSeq);
-                    }
-                }
                 overlappingRemoves.push(overlappingRemove);
                 if (MergeTree.options.zamboniSegments) {
                     this.addToLRUSet(pendingSegment, seq);
@@ -766,6 +764,9 @@ class MergeTree {
                     segment: pendingSegment,
                 });
             });
+            if (opArgs.op.type === ops_js_1.MergeTreeDeltaType.OBLITERATE) {
+                this.obliterates.addOrUpdate(pendingSegmentGroup.obliterateInfo);
+            }
             // Perform slides after all segments have been acked, so that
             // positions after slide are final
             if (opArgs.op.type === ops_js_1.MergeTreeDeltaType.REMOVE ||
@@ -971,90 +972,54 @@ class MergeTree {
                 this.updateRoot(splitNode);
                 saveIfLocal(newSegment);
                 insertPos += newSegment.cachedLength;
-                if (!this.options?.mergeTreeEnableObliterate) {
-                    continue;
-                }
-                let moveUpperBound = Number.POSITIVE_INFINITY;
-                const smallestSeqMoveOp = this.getSmallestSeqMoveOp();
-                if (smallestSeqMoveOp === undefined) {
+                if (!this.options?.mergeTreeEnableObliterate || this.obliterates.empty()) {
                     continue;
                 }
-                const leftAckedSegments = {};
-                const leftLocalSegments = {};
-                let _localMovedSeq;
-                let _movedSeq;
-                let movedClientIds;
-                const findLeftMovedSegment = (seg) => {
-                    const movedSeqs = seg.movedSeqs?.filter((movedSeq) => movedSeq >= refSeq) ?? [];
-                    const localMovedSeqs = seg.localMovedSeq ? [seg.localMovedSeq] : [];
-                    for (const movedSeq of movedSeqs) {
-                        leftAckedSegments[movedSeq] = seg;
-                    }
-                    for (const localMovedSeq of localMovedSeqs) {
-                        leftLocalSegments[localMovedSeq] = seg;
-                    }
-                    if ((seg.movedSeqs?.length ?? 0) > 0 || localMovedSeqs.length > 0) {
-                        return true;
-                    }
-                    if (!isRemoved(seg) || wasRemovedAfter(seg, moveUpperBound)) {
-                        moveUpperBound = Math.min(moveUpperBound, seg.seq ?? Number.POSITIVE_INFINITY);
-                    }
-                    // If we've reached a segment that existed before any of our in-collab-window move ops
-                    // happened, no need to continue.
-                    return moveUpperBound >= smallestSeqMoveOp;
-                };
-                const findRightMovedSegment = (seg) => {
-                    const movedSeqs = seg.movedSeqs?.filter((movedSeq) => movedSeq >= refSeq) ?? [];
-                    const localMovedSeqs = seg.localMovedSeq ? [seg.localMovedSeq] : [];
-                    for (const movedSeq of movedSeqs) {
-                        const left = leftAckedSegments[movedSeq];
-                        if (left) {
-                            _movedSeq = movedSeq;
-                            const clientIdIdx = left.movedSeqs?.indexOf(movedSeq) ?? -1;
-                            const movedClientId = left.movedClientIds?.[clientIdIdx];
-                            (0, internal_1.assert)(movedClientId !== undefined, 0x869 /* expected client id to exist */);
-                            movedClientIds = [movedClientId];
-                            return false;
+                // eslint-disable-next-line import/no-deprecated
+                let oldest;
+                let normalizedOldestSeq = 0;
+                // eslint-disable-next-line import/no-deprecated
+                let newest;
+                let normalizedNewestSeq = 0;
+                const movedClientIds = [];
+                const movedSeqs = [];
+                for (const ob of this.obliterates.findOverlapping(newSegment)) {
+                    // compute a normalized seq that takes into account local seqs
+                    // but is still comparable to remote seqs to keep the checks below easy
+                    // REMOTE SEQUENCE NUMBERS                                     LOCAL SEQUENCE NUMBERS
+                    // [0, 1, 2, 3, ..., 100, ..., 1000, ..., (MAX - MaxLocalSeq), L1, L2, L3, L4, ..., L100, ..., L1000, ...(MAX)]
+                    const normalizedObSeq = ob.seq === constants_js_1.UnassignedSequenceNumber
+                        ? Number.MAX_SAFE_INTEGER - this.collabWindow.localSeq + ob.localSeq
+                        : ob.seq;
+                    if (normalizedObSeq > refSeq) {
+                        if (oldest === undefined || normalizedOldestSeq > normalizedObSeq) {
+                            normalizedOldestSeq = normalizedObSeq;
+                            oldest = ob;
+                            movedClientIds.unshift(ob.clientId);
+                            movedSeqs.unshift(ob.seq);
                         }
-                    }
-                    for (const localMovedSeq of localMovedSeqs) {
-                        const left = leftLocalSegments[localMovedSeq];
-                        if (left) {
-                            _localMovedSeq = localMovedSeq;
-                            const clientIdIdx = left.movedSeqs?.indexOf(constants_js_1.UnassignedSequenceNumber) ?? -1;
-                            const movedClientId = left.movedClientIds?.[clientIdIdx];
-                            (0, internal_1.assert)(movedClientId !== undefined, 0x86a /* expected client id to exist */);
-                            movedClientIds = [movedClientId];
-                            return false;
+                        else {
+                            if (newest === undefined || normalizedNewestSeq < normalizedObSeq) {
+                                normalizedNewestSeq = normalizedObSeq;
+                                newest = ob;
+                            }
+                            movedClientIds.push(ob.clientId);
+                            movedSeqs.push(ob.seq);
                         }
                     }
-                    if ((seg.movedSeqs?.length ?? 0) || localMovedSeqs.length > 0) {
-                        return true;
-                    }
-                    if (!isRemoved(seg) || wasRemovedAfter(seg, moveUpperBound)) {
-                        moveUpperBound = Math.min(moveUpperBound, seg.seq ?? Number.POSITIVE_INFINITY);
-                    }
-                    // If we've reached a segment that existed before any of our in-collab-window move ops
-                    // happened, no need to continue.
-                    return moveUpperBound >= smallestSeqMoveOp;
-                };
-                (0, mergeTreeNodeWalk_js_1.backwardExcursion)(newSegment, findLeftMovedSegment);
-                moveUpperBound = Number.POSITIVE_INFINITY;
-                (0, mergeTreeNodeWalk_js_1.forwardExcursion)(newSegment, findRightMovedSegment);
-                if (_localMovedSeq !== undefined || _movedSeq !== undefined) {
-                    (0, internal_1.assert)(movedClientIds !== undefined, 0x86b /* movedClientIds should be set if local/moved seq is set */);
+                }
+                if (oldest && newest?.clientId !== clientId) {
                     const moveInfo = {
                         movedClientIds,
-                        movedSeq: _movedSeq ?? constants_js_1.UnassignedSequenceNumber,
-                        movedSeqs: _movedSeq === undefined ? [constants_js_1.UnassignedSequenceNumber] : [_movedSeq],
-                        localMovedSeq: _localMovedSeq,
-                        wasMovedOnInsert: (_movedSeq ?? -1) !== constants_js_1.UnassignedSequenceNumber,
+                        movedSeq: oldest.seq,
+                        movedSeqs,
+                        localMovedSeq: oldest.localSeq,
+                        wasMovedOnInsert: oldest.seq !== constants_js_1.UnassignedSequenceNumber,
                     };
                     markSegmentMoved(newSegment, moveInfo);
                     if (moveInfo.localMovedSeq !== undefined) {
-                        const movedSegmentGroup = this.locallyMovedSegments.get(moveInfo.localMovedSeq);
-                        (0, internal_1.assert)(movedSegmentGroup !== undefined, 0x86c /* expected segment group to exist */);
-                        this.addToPendingList(newSegment, movedSegmentGroup, localSeq);
+                        (0, internal_1.assert)(oldest.segmentGroup !== undefined, 0x86c /* expected segment group to exist */);
+                        this.addToPendingList(newSegment, oldest.segmentGroup);
                     }
                     if (newSegment.parent) {
                         this.blockUpdatePathLengths(newSegment.parent, seq, clientId);
@@ -1092,27 +1057,14 @@ class MergeTree {
             return true;
         }
     }
-    getSmallestSeqMoveOp() {
-        return this.moveSeqs[0] ?? (this.localMoveSeqs.size > 0 ? -1 : undefined);
-    }
     insertingWalk(block, pos, refSeq, clientId, seq, context, isLastChildBlock = true) {
-        let _pos;
-        if (pos === "start") {
-            _pos = 0;
-        }
-        else if (pos === "end") {
-            _pos = this.root.mergeTree?.getLength(refSeq, clientId) ?? 0;
-        }
-        else {
-            _pos = pos;
-        }
+        let _pos = pos;
         const children = block.children;
         let childIndex;
         let child;
         let newNode;
         let fromSplit;
         for (childIndex = 0; childIndex < block.childCount; childIndex++) {
-            // TODO Non null asserting, why is this not null?
             child = children[childIndex];
             // ensure we walk down the far edge of the tree, even if all sub-tree is eligible for zamboni
             const isLastNonLeafBlock = isLastChildBlock && !child.isLeaf() && childIndex === block.childCount - 1;
@@ -1177,9 +1129,7 @@ class MergeTree {
         }
         if (newNode) {
             for (let i = block.childCount; i > childIndex; i--) {
-                // TODO Non null asserting, why is this not null?
                 block.children[i] = block.children[i - 1];
-                // TODO Non null asserting, why is this not null?
                 block.children[i].index = i;
             }
             block.assignChild(newNode, childIndex, false);
@@ -1211,7 +1161,6 @@ class MergeTree {
         // Update ordinals to reflect lowered child count
         this.nodeUpdateOrdinals(node);
         for (let i = 0; i < halfCount; i++) {
-            // TODO Non null asserting, why is this not null?
             newNode.assignChild(node.children[halfCount + i], i, false);
             node.children[halfCount + i] = undefined;
         }
@@ -1221,7 +1170,6 @@ class MergeTree {
     }
     nodeUpdateOrdinals(block) {
         for (let i = 0; i < block.childCount; i++) {
-            // TODO Non null asserting, why is this not null?
             const child = block.children[i];
             block.setOrdinal(child, i);
             if (!child.isLeaf()) {
@@ -1285,33 +1233,34 @@ class MergeTree {
     }
     obliterateRange(start, end, refSeq, clientId, seq, overwrite = false, opArgs) {
         errorIfOptionNotTrue(this.options, "mergeTreeEnableObliterate");
-        const { startPos, startSide, endPos, endSide } = (0, sequencePlace_js_1.endpointPosAndSide)(start, end);
-        (0, internal_1.assert)(startPos !== undefined &&
-            endPos !== undefined &&
-            startSide !== undefined &&
-            endSide !== undefined &&
-            startPos !== "end" &&
-            endPos !== "start", 0x9e2 /* start and end cannot be undefined because they were not passed in as undefined */);
-        this.ensureIntervalBoundary(startPos, refSeq, clientId);
-        this.ensureIntervalBoundary(endPos, refSeq, clientId);
+        this.ensureIntervalBoundary(start, refSeq, clientId);
+        this.ensureIntervalBoundary(end, refSeq, clientId);
         let _overwrite = overwrite;
         const localOverlapWithRefs = [];
         const movedSegments = [];
         const localSeq = seq === constants_js_1.UnassignedSequenceNumber ? ++this.collabWindow.localSeq : undefined;
-        if (seq !== constants_js_1.UnassignedSequenceNumber && seq !== this.moveSeqs[this.moveSeqs.length - 1]) {
-            this.moveSeqs.push(seq);
-        }
-        else if (seq === constants_js_1.UnassignedSequenceNumber && localSeq !== undefined) {
-            this.localMoveSeqs.add(localSeq);
-        }
         // eslint-disable-next-line import/no-deprecated
-        let segmentGroup;
+        const obliterate = {
+            clientId,
+            end: (0, localReference_js_1.createDetachedLocalReferencePosition)(undefined),
+            refSeq,
+            seq,
+            start: (0, localReference_js_1.createDetachedLocalReferencePosition)(undefined),
+            localSeq,
+            segmentGroup: undefined,
+        };
+        const { segment: startSeg } = this.getContainingSegment(start, refSeq, clientId);
+        const { segment: endSeg } = this.getContainingSegment(end - 1, refSeq, clientId);
+        (0, internal_1.assert)(startSeg !== undefined && endSeg !== undefined, 0xa3f /* segments cannot be undefined */);
+        obliterate.start = this.createLocalReferencePosition(startSeg, 0, ops_js_1.ReferenceType.StayOnRemove, {
+            obliterate,
+        });
+        obliterate.end = this.createLocalReferencePosition(endSeg, endSeg.cachedLength - 1, ops_js_1.ReferenceType.StayOnRemove, {
+            obliterate,
+        });
         const markMoved = (segment, pos, _start, _end) => {
+            var _a;
             const existingMoveInfo = (0, mergeTreeNodes_js_1.toMoveInfo)(segment);
-            if (startSide)
-                segment.startSide = startSide;
-            if (endSide)
-                segment.endSide = endSide;
             if (clientId !== segment.clientId &&
                 segment.seq !== undefined &&
                 seq !== constants_js_1.UnassignedSequenceNumber &&
@@ -1351,7 +1300,8 @@ class MergeTree {
             if (this.collabWindow.collaborating) {
                 if (segment.movedSeq === constants_js_1.UnassignedSequenceNumber &&
                     clientId === this.collabWindow.clientId) {
-                    segmentGroup = this.addToPendingList(segment, segmentGroup, localSeq);
+                    obliterate.segmentGroup = this.addToPendingList(segment, obliterate.segmentGroup, localSeq);
+                    (_a = obliterate.segmentGroup).obliterateInfo ?? (_a.obliterateInfo = obliterate);
                 }
                 else {
                     if (MergeTree.options.zamboniSegments) {
@@ -1371,6 +1321,7 @@ class MergeTree {
             return true;
         };
         this.nodeMap(refSeq, clientId, markMoved, undefined, afterMarkMoved, start, end, undefined, seq === constants_js_1.UnassignedSequenceNumber ? undefined : seq);
+        this.obliterates.addOrUpdate(obliterate);
         this.slideAckedRemovedSegmentReferences(localOverlapWithRefs);
         // opArgs == undefined => test code
         if (movedSegments.length > 0) {
@@ -1379,9 +1330,6 @@ class MergeTree {
                 deltaSegments: movedSegments,
             });
         }
-        if (segmentGroup && localSeq !== undefined) {
-            this.locallyMovedSegments.set(localSeq, segmentGroup);
-        }
         // these events are newly removed
         // so we slide after eventing in case the consumer wants to make reference
         // changes at remove time, like add a ref to track undo redo.
@@ -1528,7 +1476,6 @@ class MergeTree {
                     this.markRangeRemoved(start, start + segment.cachedLength, constants_js_1.UniversalSequenceNumber, this.collabWindow.clientId, constants_js_1.UniversalSequenceNumber, false, { op: removeOp });
                 } /* op.type === MergeTreeDeltaType.ANNOTATE */
                 else {
-                    // TODO Non null asserting, why is this not null?
                     const props = pendingSegmentGroup.previousProps[i];
                     const annotateOp = (0, opBuilder_js_1.createAnnotateRangeOp)(start, start + segment.cachedLength, props);
                     this.annotateRange(start, start + segment.cachedLength, props, constants_js_1.UniversalSequenceNumber, this.collabWindow.clientId, constants_js_1.UniversalSequenceNumber, { op: annotateOp }, 
@@ -1575,7 +1522,7 @@ class MergeTree {
         if (_segment !== "start" &&
             _segment !== "end" &&
             isRemovedAndAckedOrMovedAndAcked(_segment) &&
-            !(0, referencePositions_js_1.refTypeIncludesFlag)(refType, ops_js_1.ReferenceType.SlideOnRemove | ops_js_1.ReferenceType.Transient) &&
+            !(0, referencePositions_js_1.refTypeIncludesFlag)(refType, ops_js_1.ReferenceType.SlideOnRemove | ops_js_1.ReferenceType.Transient | ops_js_1.ReferenceType.StayOnRemove) &&
             _segment.endpointType === undefined) {
             throw new internal_2.UsageError("Can only create SlideOnRemove or Transient local reference position on a removed or obliterated segment");
         }
@@ -1648,7 +1595,6 @@ class MergeTree {
             }
         }
         for (let i = 0; i < newOrder.length; i++) {
-            // TODO Non null asserting, why is this not null?
             const seg = newOrder[i];
             const { parent, index, ordinal } = currentOrder[i];
             parent?.assignChild(seg, index, false);
@@ -1735,7 +1681,6 @@ class MergeTree {
         const rightmostTiles = (0, properties_js_1.createMap)();
         const leftmostTiles = (0, properties_js_1.createMap)();
         for (let i = 0; i < block.childCount; i++) {
-            // TODO Non null asserting, why is this not null?
             const node = block.children[i];
             const nodeLength = nodeTotalLength(this, node);
             if (nodeLength !== undefined) {
@@ -1845,18 +1790,11 @@ class MergeTree {
      * ignored for the purposes of tracking when traversal should end.
      */
     nodeMap(refSeq, clientId, leaf, accum, post, start = 0, end, localSeq, visibilitySeq = refSeq) {
-        const maybeEndPos = end ?? this.nodeLength(this.root, refSeq, clientId, localSeq) ?? 0;
-        if (maybeEndPos === start) {
+        const endPos = end ?? this.nodeLength(this.root, refSeq, clientId, localSeq) ?? 0;
+        if (endPos === start) {
             return;
         }
         let pos = 0;
-        let { startPos, endPos } = (0, sequencePlace_js_1.endpointPosAndSide)(start, end);
-        startPos = startPos === "start" || startPos === undefined ? 0 : startPos;
-        endPos =
-            endPos === "end" || endPos === undefined
-                ? this.root.mergeTree?.getLength(refSeq, clientId) ?? 0
-                : endPos;
-        (0, internal_1.assert)(startPos !== "end" && endPos !== "start", 0x9e3 /* start cannot be 'end' and end cannot be 'start' */);
         (0, mergeTreeNodeWalk_js_1.depthFirstNodeWalk)(this.root, this.root.children[0], (node) => {
             if (endPos <= pos) {
                 return mergeTreeNodeWalk_js_1.NodeAction.Exit;
@@ -1873,19 +1811,19 @@ class MergeTree {
             }
             const nextPos = pos + lenAtRefSeq;
             // start is beyond the current node, so we can skip it
-            if (typeof startPos === "number" && startPos >= nextPos) {
+            if (start >= nextPos) {
                 pos = nextPos;
                 return mergeTreeNodeWalk_js_1.NodeAction.Skip;
             }
             if (node.isLeaf()) {
-                if (leaf(node, pos, refSeq, clientId, startPos - pos, endPos - pos, accum) === false) {
+                if (leaf(node, pos, refSeq, clientId, start - pos, endPos - pos, accum) === false) {
                     return mergeTreeNodeWalk_js_1.NodeAction.Exit;
                 }
                 pos = nextPos;
             }
         }, undefined, post === undefined
             ? undefined
-            : (block) => post(block, pos, refSeq, clientId, startPos - pos, endPos - pos, accum));
+            : (block) => post(block, pos, refSeq, clientId, start - pos, endPos - pos, accum));
     }
 }
 exports.MergeTree = MergeTree;