@fluidframework/merge-tree 2.1.0-276985 → 2.1.0

package/lib/mergeTree.js

@@ -19,7 +19,6 @@ import { createAnnotateRangeOp, createInsertSegmentOp, createRemoveRangeOp, } fr
 import { MergeTreeDeltaType, ReferenceType, } from "./ops.js";
 import { PartialSequenceLengths } from "./partialLengths.js";
 import { PerspectiveImpl, isSegmentPresent } from "./perspective.js";
-// eslint-disable-next-line import/no-deprecated
 import { createMap, extend, extendIfUndefined } from "./properties.js";
 import { DetachedReferencePosition, refGetTileLabels, refHasTileLabel, refTypeIncludesFlag, } from "./referencePositions.js";
 import { PropertiesRollback } from "./segmentPropertiesManager.js";
@@ -30,7 +29,7 @@ function wasRemovedAfter(seg, seq) {
 }
 function markSegmentMoved(seg, moveInfo) {
     seg.moveDst = moveInfo.moveDst;
-    seg.movedClientIds = moveInfo.movedClientIds.slice();
+    seg.movedClientIds = [...moveInfo.movedClientIds];
     seg.movedSeqs = [moveInfo.movedSeq];
     seg.movedSeq = moveInfo.movedSeq;
     seg.localMovedSeq = moveInfo.localMovedSeq;
@@ -76,17 +75,18 @@ export function findRootMergeBlock(segmentOrNode) {
     while (maybeRoot?.parent !== undefined) {
         maybeRoot = maybeRoot.parent;
     }
-    return maybeRoot?.mergeTree !== undefined ? maybeRoot : undefined;
+    return maybeRoot?.mergeTree === undefined ? undefined : maybeRoot;
 }
 /**
+ * Find the segment to which a reference will slide if it needs to slide, or undefined if there
+ * is no valid segment (i.e. the tree is empty).
+ *
  * @param segment - The segment to slide from.
  * @param cache - Optional cache mapping segments to their sliding destinations.
  * Excursions will be avoided for segments in the cache, and the cache will be populated with
  * entries for all segments visited during excursion.
  * This can reduce the number of times the tree needs to be scanned if a range containing many
  * SlideOnRemove references is removed.
- * @returns The segment a SlideOnRemove reference should slide to, or undefined if there is no
- * valid segment (i.e. the tree is empty).
  * @internal
  */
 function getSlideToSegment(segment, slidingPreference = SlidingPreference.FORWARD, cache, useNewSlidingBehavior = false) {
@@ -167,6 +167,8 @@ export function getSlideToSegoff(segoff, slidingPreference = SlidingPreference.F
         offset,
     };
 }
+const forwardPred = (ref) => ref.slidingPreference !== SlidingPreference.BACKWARD;
+const backwardPred = (ref) => ref.slidingPreference === SlidingPreference.BACKWARD;
 /**
  * @internal
  */
@@ -274,7 +276,18 @@ export class MergeTree {
         assert(refSeq !== undefined, 0x398 /* localSeq provided for local length without refSeq */);
         assert(segment.seq !== undefined, 0x399 /* segment with no seq in mergeTree */);
         const { seq, removedSeq, localRemovedSeq, movedSeq, localMovedSeq } = segment;
-        if (seq !== UnassignedSequenceNumber) {
+        if (seq === UnassignedSequenceNumber) {
+            assert(segment.localSeq !== undefined, 0x39a /* unacked segment with undefined localSeq */);
+            // inserted locally, still un-acked
+            if (segment.localSeq > localSeq ||
+                (localRemovedSeq !== undefined && localRemovedSeq <= localSeq) ||
+                (localMovedSeq !== undefined && localMovedSeq <= localSeq)) {
+                return 0;
+            }
+            const { cachedLength } = segment;
+            return cachedLength;
+        }
+        else {
             // inserted remotely
             if (seq > refSeq ||
                 (removedSeq !== undefined &&
@@ -289,16 +302,6 @@ export class MergeTree {
             }
             return segment.cachedLength;
         }
-        else {
-            assert(segment.localSeq !== undefined, 0x39a /* unacked segment with undefined localSeq */);
-            // inserted locally, still un-acked
-            if (segment.localSeq > localSeq ||
-                (localRemovedSeq !== undefined && localRemovedSeq <= localSeq) ||
-                (localMovedSeq !== undefined && localMovedSeq <= localSeq)) {
-                return 0;
-            }
-            return segment.cachedLength;
-        }
     }
     unlinkMarker(marker) {
         const id = marker.getId();
@@ -318,7 +321,7 @@ export class MergeTree {
         // Starting with the leaf segments, recursively builds the B-Tree layer by layer from the bottom up.
         const buildMergeBlock = (nodes) => {
             const blockCount = Math.ceil(nodes.length / maxChildren); // Compute # blocks require for this level of B-Tree
-            const blocks = new Array(blockCount); // Pre-alloc array to collect nodes
+            const blocks = Array.from({ length: blockCount }); // Pre-alloc array to collect nodes
             // For each block in this level of the B-Tree...
             for (let nodeIndex = 0, blockIndex = 0; // Start with the first block and first node
              blockIndex < blockCount; // If we have more blocks, we also have more nodes to insert
@@ -331,6 +334,7 @@ export 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,
@@ -339,7 +343,8 @@ export class MergeTree {
                 this.blockUpdate(block);
             }
             return blocks.length === 1 // If there is only one block at this layer...
-                ? blocks[0] // ...then we're done.  Return the root.
+                ? // Non null asserting here because of the length check above
+                    blocks[0] // ...then we're done.  Return the root.
                 : buildMergeBlock(blocks); // ...otherwise recursively build the next layer above blocks.
         };
         if (segments.length > 0) {
@@ -387,6 +392,7 @@ export 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;
@@ -437,11 +443,9 @@ export class MergeTree {
         let currentForwardMaybeEndpoint;
         let currentForwardSlideDestination;
         let currentForwardSlideIsForward;
-        const forwardPred = (ref) => ref.slidingPreference !== SlidingPreference.BACKWARD;
         let currentBackwardMaybeEndpoint;
         let currentBackwardSlideDestination;
         let currentBackwardSlideIsForward;
-        const backwardPred = (ref) => ref.slidingPreference === SlidingPreference.BACKWARD;
         const slideGroup = (currentSlideDestination, currentSlideIsForward, currentSlideGroup, pred, maybeEndpoint) => {
             if (currentSlideIsForward === undefined) {
                 return;
@@ -458,16 +462,7 @@ export class MergeTree {
                     localRefs.addAfterTombstones(...endpointRefsToAdd);
                 }
             }
-            if (currentSlideDestination !== undefined) {
-                const localRefs = LocalReferenceCollection.setOrGet(currentSlideDestination);
-                if (currentSlideIsForward) {
-                    localRefs.addBeforeTombstones(...nonEndpointRefsToAdd);
-                }
-                else {
-                    localRefs.addAfterTombstones(...nonEndpointRefsToAdd);
-                }
-            }
-            else {
+            if (currentSlideDestination === undefined) {
                 for (const collection of currentSlideGroup) {
                     for (const ref of collection) {
                         if (pred(ref) && !refTypeIncludesFlag(ref, ReferenceType.StayOnRemove)) {
@@ -478,6 +473,15 @@ export class MergeTree {
                     }
                 }
             }
+            else {
+                const localRefs = LocalReferenceCollection.setOrGet(currentSlideDestination);
+                if (currentSlideIsForward) {
+                    localRefs.addBeforeTombstones(...nonEndpointRefsToAdd);
+                }
+                else {
+                    localRefs.addAfterTombstones(...nonEndpointRefsToAdd);
+                }
+            }
         };
         const trySlideSegment = (segment, currentSlideDestination, currentSlideIsForward, currentSlideGroup, pred, slidingPreference, currentMaybeEndpoint, reassign) => {
             // avoid sliding logic if this segment doesn't have any references
@@ -564,12 +568,7 @@ export class MergeTree {
         }
         else {
             // Sequence number within window
-            if (!node.isLeaf()) {
-                const partialLen = node.partialLengths.getPartialLength(refSeq, clientId);
-                PartialSequenceLengths.options.verifyExpected?.(this, node, refSeq, clientId);
-                return partialLen;
-            }
-            else {
+            if (node.isLeaf()) {
                 const segment = node;
                 const removalInfo = toRemovalInfo(segment);
                 const moveInfo = toMoveInfo(segment);
@@ -595,6 +594,11 @@ export class MergeTree {
                     ? segment.cachedLength
                     : 0;
             }
+            else {
+                const partialLen = node.partialLengths.getPartialLength(refSeq, clientId);
+                PartialSequenceLengths.options.verifyExpected?.(this, node, refSeq, clientId);
+                return partialLen;
+            }
         }
     }
     setMinSeq(minSeq) {
@@ -618,7 +622,6 @@ export class MergeTree {
      * Defaults to including all edits which have been applied.
      * @param clientId - The ID of the client from whose perspective to resolve this reference. Defaults to the current client.
      * @param localSeq - The local sequence number to consider. Defaults to including all local edits.
-     * @returns the count of elements before the given reference position in the given perspective.
      */
     referencePositionToLocalPosition(refPos, refSeq = Number.MAX_SAFE_INTEGER, clientId = this.collabWindow.clientId, localSeq = this.collabWindow.localSeq) {
         const seg = refPos.getSegment();
@@ -686,7 +689,7 @@ export class MergeTree {
                     foundMarker = marker;
                 }
             }
-            return foundMarker !== undefined ? NodeAction.Exit : NodeAction.Skip;
+            return foundMarker === undefined ? NodeAction.Skip : NodeAction.Exit;
         }, undefined, undefined, forwards);
         return foundMarker;
     }
@@ -718,6 +721,8 @@ export class MergeTree {
                 if (opArgs.op.type === 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)) {
@@ -818,15 +823,15 @@ export class MergeTree {
         }
         if (marker) {
             pos = this.getPosition(marker, refseq, clientId);
-            if (!relativePos.before) {
-                pos += marker.cachedLength;
+            if (relativePos.before) {
                 if (relativePos.offset !== undefined) {
-                    pos += relativePos.offset;
+                    pos -= relativePos.offset;
                 }
             }
             else {
+                pos += marker.cachedLength;
                 if (relativePos.offset !== undefined) {
-                    pos -= relativePos.offset;
+                    pos += relativePos.offset;
                 }
             }
         }
@@ -885,6 +890,8 @@ export class MergeTree {
         }
     }
     blockInsert(pos, refSeq, clientId, seq, localSeq, newSegments) {
+        // Keeping this function within the scope of blockInsert for readability.
+        // eslint-disable-next-line unicorn/consistent-function-scoping
         const continueFrom = (node) => {
             let siblingExists = false;
             forwardExcursion(node, () => {
@@ -943,7 +950,7 @@ export class MergeTree {
                 });
                 if (newSegment.parent === undefined) {
                     // Indicates an attempt to insert past the end of the merge-tree's content.
-                    const errorConstructor = localSeq !== undefined ? UsageError : DataProcessingError;
+                    const errorConstructor = localSeq === undefined ? DataProcessingError : UsageError;
                     throw new errorConstructor("MergeTree insert failed", {
                         currentSeq: this.collabWindow.currentSeq,
                         minSeq: this.collabWindow.minSeq,
@@ -1085,6 +1092,7 @@ export class MergeTree {
         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;
@@ -1097,7 +1105,23 @@ export class MergeTree {
             assert(len >= 0, 0x4bc /* Length should not be negative */);
             if (_pos < len || (_pos === len && this.breakTie(_pos, child, seq))) {
                 // Found entry containing pos
-                if (!child.isLeaf()) {
+                if (child.isLeaf()) {
+                    const segment = child;
+                    const segmentChanges = context.leaf(segment, _pos, context);
+                    if (segmentChanges.replaceCurrent) {
+                        block.assignChild(segmentChanges.replaceCurrent, childIndex, false);
+                        segmentChanges.replaceCurrent.ordinal = child.ordinal;
+                    }
+                    if (segmentChanges.next) {
+                        newNode = segmentChanges.next;
+                        childIndex++; // Insert after
+                    }
+                    else {
+                        // No change
+                        return undefined;
+                    }
+                }
+                else {
                     const childBlock = child;
                     // Internal node
                     const splitNode = this.insertingWalk(childBlock, _pos, refSeq, clientId, seq, context, isLastNonLeafBlock);
@@ -1115,43 +1139,27 @@ export class MergeTree {
                         childIndex++; // Insert after
                     }
                 }
-                else {
-                    const segment = child;
-                    const segmentChanges = context.leaf(segment, _pos, context);
-                    if (segmentChanges.replaceCurrent) {
-                        block.assignChild(segmentChanges.replaceCurrent, childIndex, false);
-                        segmentChanges.replaceCurrent.ordinal = child.ordinal;
-                    }
-                    if (segmentChanges.next) {
-                        newNode = segmentChanges.next;
-                        childIndex++; // Insert after
-                    }
-                    else {
-                        // No change
-                        return undefined;
-                    }
-                }
                 break;
             }
             else {
                 _pos -= len;
             }
         }
-        if (!newNode) {
-            if (_pos === 0) {
-                if (context.continuePredicate?.(block)) {
-                    return MergeTree.theUnfinishedNode;
-                }
-                else {
-                    const segmentChanges = context.leaf(undefined, _pos, context);
-                    newNode = segmentChanges.next;
-                    // Assert segmentChanges.replaceCurrent === undefined
-                }
+        if (!newNode && _pos === 0) {
+            if (context.continuePredicate?.(block)) {
+                return MergeTree.theUnfinishedNode;
+            }
+            else {
+                const segmentChanges = context.leaf(undefined, _pos, context);
+                newNode = segmentChanges.next;
+                // Assert segmentChanges.replaceCurrent === undefined
             }
         }
         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);
@@ -1183,6 +1191,7 @@ export 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;
         }
@@ -1192,6 +1201,7 @@ export 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()) {
@@ -1245,10 +1255,10 @@ export class MergeTree {
                 deltaSegments,
             });
         }
-        if (this.collabWindow.collaborating && seq !== UnassignedSequenceNumber) {
-            if (MergeTree.options.zamboniSegments) {
-                zamboniSegments(this);
-            }
+        if (this.collabWindow.collaborating &&
+            seq !== UnassignedSequenceNumber &&
+            MergeTree.options.zamboniSegments) {
+            zamboniSegments(this);
         }
     }
     obliterateRange(start, end, refSeq, clientId, seq, overwrite = false, opArgs) {
@@ -1277,7 +1287,16 @@ export class MergeTree {
                 (refSeq < segment.seq || segment.seq === UnassignedSequenceNumber)) {
                 segment.wasMovedOnInsert = true;
             }
-            if (existingMoveInfo !== undefined) {
+            if (existingMoveInfo === undefined) {
+                segment.movedClientIds = [clientId];
+                segment.movedSeq = seq;
+                segment.localMovedSeq = localSeq;
+                segment.movedSeqs = [seq];
+                if (!toRemovalInfo(segment)) {
+                    movedSegments.push({ segment });
+                }
+            }
+            else {
                 _overwrite = true;
                 if (existingMoveInfo.movedSeq === UnassignedSequenceNumber) {
                     // we moved this locally, but someone else moved it first
@@ -1297,15 +1316,6 @@ export class MergeTree {
                     existingMoveInfo.movedSeqs.push(seq);
                 }
             }
-            else {
-                segment.movedClientIds = [clientId];
-                segment.movedSeq = seq;
-                segment.localMovedSeq = localSeq;
-                segment.movedSeqs = [seq];
-                if (!toRemovalInfo(segment)) {
-                    movedSegments.push({ segment });
-                }
-            }
             // Save segment so can assign moved sequence number when acked by server
             if (this.collabWindow.collaborating) {
                 if (segment.movedSeq === UnassignedSequenceNumber &&
@@ -1329,7 +1339,7 @@ export class MergeTree {
             }
             return true;
         };
-        this.nodeMap(refSeq, clientId, markMoved, undefined, afterMarkMoved, start, end, undefined, seq !== UnassignedSequenceNumber ? seq : undefined);
+        this.nodeMap(refSeq, clientId, markMoved, undefined, afterMarkMoved, start, end, undefined, seq === UnassignedSequenceNumber ? undefined : seq);
         this.slideAckedRemovedSegmentReferences(localOverlapWithRefs);
         // opArgs == undefined => test code
         if (movedSegments.length > 0) {
@@ -1347,10 +1357,10 @@ export class MergeTree {
         if (!this.collabWindow.collaborating || clientId !== this.collabWindow.clientId) {
             this.slideAckedRemovedSegmentReferences(movedSegments.map(({ segment }) => segment));
         }
-        if (this.collabWindow.collaborating && seq !== UnassignedSequenceNumber) {
-            if (MergeTree.options.zamboniSegments) {
-                zamboniSegments(this);
-            }
+        if (this.collabWindow.collaborating &&
+            seq !== UnassignedSequenceNumber &&
+            MergeTree.options.zamboniSegments) {
+            zamboniSegments(this);
         }
     }
     markRangeRemoved(start, end, refSeq, clientId, seq, overwrite = false, opArgs) {
@@ -1364,7 +1374,15 @@ export class MergeTree {
         const localSeq = seq === UnassignedSequenceNumber ? ++this.collabWindow.localSeq : undefined;
         const markRemoved = (segment, pos, _start, _end) => {
             const existingRemovalInfo = toRemovalInfo(segment);
-            if (existingRemovalInfo !== undefined) {
+            if (existingRemovalInfo === undefined) {
+                segment.removedClientIds = [clientId];
+                segment.removedSeq = seq;
+                segment.localRemovedSeq = localSeq;
+                if (!toMoveInfo(segment)) {
+                    removedSegments.push({ segment });
+                }
+            }
+            else {
                 _overwrite = true;
                 if (existingRemovalInfo.removedSeq === UnassignedSequenceNumber) {
                     // we removed this locally, but someone else removed it first
@@ -1382,14 +1400,6 @@ export class MergeTree {
                     existingRemovalInfo.removedClientIds.push(clientId);
                 }
             }
-            else {
-                segment.removedClientIds = [clientId];
-                segment.removedSeq = seq;
-                segment.localRemovedSeq = localSeq;
-                if (!toMoveInfo(segment)) {
-                    removedSegments.push({ segment });
-                }
-            }
             // Save segment so we can assign removed sequence number when acked by server
             if (this.collabWindow.collaborating) {
                 if (segment.removedSeq === UnassignedSequenceNumber &&
@@ -1430,10 +1440,10 @@ export class MergeTree {
         if (!this.collabWindow.collaborating || clientId !== this.collabWindow.clientId) {
             this.slideAckedRemovedSegmentReferences(removedSegments.map(({ segment }) => segment));
         }
-        if (this.collabWindow.collaborating && seq !== UnassignedSequenceNumber) {
-            if (MergeTree.options.zamboniSegments) {
-                zamboniSegments(this);
-            }
+        if (this.collabWindow.collaborating &&
+            seq !== UnassignedSequenceNumber &&
+            MergeTree.options.zamboniSegments) {
+            zamboniSegments(this);
         }
     }
     /**
@@ -1446,6 +1456,8 @@ export class MergeTree {
             if (pendingSegmentGroup === undefined || pendingSegmentGroup !== localOpMetadata) {
                 throw new Error("Rollback op doesn't match last edit");
             }
+            // 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
             pendingSegmentGroup.segments.forEach((segment) => {
                 const segmentSegmentGroup = segment.segmentGroups?.pop?.();
                 assert(segmentSegmentGroup === pendingSegmentGroup, 0x3ee /* Unexpected segmentGroup in segment */);
@@ -1485,6 +1497,7 @@ export class MergeTree {
                     this.markRangeRemoved(start, start + segment.cachedLength, UniversalSequenceNumber, this.collabWindow.clientId, 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 = createAnnotateRangeOp(start, start + segment.cachedLength, props);
                     this.annotateRange(start, start + segment.cachedLength, props, UniversalSequenceNumber, this.collabWindow.clientId, UniversalSequenceNumber, { op: annotateOp }, PropertiesRollback.Rollback);
@@ -1589,18 +1602,20 @@ export class MergeTree {
                 }
             }
         }
-        const newOrder = Array.from(affectedSegments.map(({ data }) => data));
-        newOrder.forEach((seg) => seg.localRefs?.walkReferences((lref) => lref.callbacks?.beforeSlide?.(lref)));
+        const newOrder = Array.from(affectedSegments, ({ data }) => data);
+        for (const seg of newOrder)
+            seg.localRefs?.walkReferences((lref) => lref.callbacks?.beforeSlide?.(lref));
         const perSegmentTrackingGroups = new Map();
         for (const segment of newOrder) {
             const { trackingCollection } = segment;
-            const trackingGroups = Array.from(trackingCollection.trackingGroups);
+            const trackingGroups = [...trackingCollection.trackingGroups];
             perSegmentTrackingGroups.set(segment, trackingGroups);
             for (const group of trackingCollection.trackingGroups) {
                 trackingCollection.unlink(group);
             }
         }
         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);
@@ -1620,13 +1635,16 @@ export class MergeTree {
             }
             return depths.get(block);
         };
-        newOrder.forEach(computeDepth);
-        for (const [node] of Array.from(depths.entries()).sort((a, b) => b[1] - a[1])) {
+        for (const element of newOrder) {
+            computeDepth(element);
+        }
+        for (const [node] of [...depths.entries()].sort((a, b) => b[1] - a[1])) {
             if (!node.isLeaf()) {
                 this.nodeUpdateLengthNewStructure(node);
             }
         }
-        newOrder.forEach((seg) => seg.localRefs?.walkReferences((lref) => lref.callbacks?.afterSlide?.(lref)));
+        for (const seg of newOrder)
+            seg.localRefs?.walkReferences((lref) => lref.callbacks?.afterSlide?.(lref));
     }
     /**
      * Normalizes the segments nearby `segmentGroup` to be ordered as they would if the op submitting `segmentGroup`
@@ -1681,11 +1699,10 @@ export class MergeTree {
     }
     blockUpdate(block) {
         let len;
-        // eslint-disable-next-line import/no-deprecated
         const rightmostTiles = createMap();
-        // eslint-disable-next-line import/no-deprecated
         const leftmostTiles = 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) {
@@ -1716,9 +1733,7 @@ export class MergeTree {
                 }
             }
             else {
-                // eslint-disable-next-line import/no-deprecated
                 extend(rightmostTiles, node.rightmostTiles);
-                // eslint-disable-next-line import/no-deprecated
                 extendIfUndefined(leftmostTiles, node.leftmostTiles);
             }
         }