@fluidframework/merge-tree 1.2.1 → 2.0.0-internal.1.0.0

package/lib/localReference.js

@@ -7,7 +7,7 @@ import { UsageError } from "@fluidframework/container-utils";
 import { ListMakeHead, ListRemoveEntry } from "./collections";
 import { ReferenceType } from "./ops";
 import { addProperties } from "./properties";
-import { minReferencePosition, maxReferencePosition, compareReferencePositions, refHasTileLabels, refHasRangeLabels, refGetRangeLabels, refGetTileLabels, refHasRangeLabel, refHasTileLabel, refTypeIncludesFlag, } from "./referencePositions";
+import { refHasTileLabels, refHasRangeLabels, refTypeIncludesFlag, } from "./referencePositions";
 /**
  * @internal
  */
@@ -27,83 +27,25 @@ export function _validateReferenceType(refType) {
     }
 }
 /**
- * @deprecated - Use LocalReferencePosition
+ * @privateRemarks This should not be exported outside merge tree.
+ * @internal
  */
-export class LocalReference {
-    /**
-     * @deprecated - use createReferencePosition
-     */
-    constructor(client, initSegment, 
-    /**
-     * @deprecated - use getOffset
-     */
-    offset = 0, refType = ReferenceType.Simple, properties) {
-        this.client = client;
-        this.offset = offset;
+class LocalReference {
+    constructor(refType = ReferenceType.Simple, properties) {
         this.refType = refType;
+        this.offset = 0;
         _validateReferenceType(refType);
-        this.segment = initSegment;
         this.properties = properties;
     }
-    /**
-     * @deprecated - use minReferencePosition
-     */
-    min(b) {
-        return minReferencePosition(this, b);
-    }
-    /**
-     * @deprecated - use maxReferencePosition
-     */
-    max(b) {
-        return maxReferencePosition(this, b);
-    }
-    /**
-     * @deprecated - use compareReferencePositions
-     */
-    compare(b) {
-        return compareReferencePositions(this, b);
-    }
-    /**
-     * @deprecated - use getLocalReferencePosition
-     */
-    toPosition() {
-        return this.getClient().localReferencePositionToPosition(this);
-    }
-    /**
-     * @deprecated - use refHasTileLabels
-     */
-    hasTileLabels() {
-        return refHasTileLabels(this);
-    }
-    /**
-     * @deprecated - use refHasRangeLabels
-     */
-    hasRangeLabels() {
-        return refHasRangeLabels(this);
-    }
-    /**
-     * @deprecated - use refHasTileLabel
-     */
-    hasTileLabel(label) {
-        return refHasTileLabel(this, label);
-    }
-    /**
-     * @deprecated - use refHasRangeLabel
-     */
-    hasRangeLabel(label) {
-        return refHasRangeLabel(this, label);
-    }
-    /**
-     * @deprecated - use refGetTileLabels
-     */
-    getTileLabels() {
-        return refGetTileLabels(this);
-    }
-    /**
-     * @deprecated - use refGetRangeLabels
-     */
-    getRangeLabels() {
-        return refGetRangeLabels(this);
+    link(segment, offset, listNode) {
+        var _a, _b;
+        if (listNode !== this.listNode
+            && this.listNode !== undefined) {
+            (_b = (_a = this.segment) === null || _a === void 0 ? void 0 : _a.localRefs) === null || _b === void 0 ? void 0 : _b.removeLocalRef(this);
+        }
+        this.segment = segment;
+        this.offset = offset;
+        this.listNode = listNode;
     }
     isLeaf() {
         return false;
@@ -111,44 +53,40 @@ export class LocalReference {
     addProperties(newProps, op) {
         this.properties = addProperties(this.properties, newProps, op);
     }
-    /**
-     * @deprecated - no longer supported
-     */
-    getClient() {
-        return this.client;
-    }
     getSegment() {
         return this.segment;
     }
     getOffset() {
         return this.offset;
     }
+    getListNode() {
+        return this.listNode;
+    }
     getProperties() {
         return this.properties;
     }
 }
-/**
- * @deprecated - use DetachedReferencePosition
- */
-LocalReference.DetachedPosition = -1;
-function assertLocalReferences(lref) {
+export function createDetachedLocalReferencePosition(refType) {
+    return new LocalReference(refType, undefined);
+}
+export function assertLocalReferences(lref) {
     assert(lref instanceof LocalReference, 0x2e0 /* "lref not a Local Reference" */);
 }
 /**
- * Represents a collection of {@link ReferencePosition}s associated with one segment in a merge-tree.
+ * Represents a collection of {@link LocalReferencePosition}s associated with one segment in a merge-tree.
  */
 export class LocalReferenceCollection {
     /**
      *
-     * @internal - this method should only be called by mergeTree
+     * @internal
      */
     constructor(
     /** Segment this `LocalReferenceCollection` is associated to. */
     segment, initialRefsByfOffset = new Array(segment.cachedLength)) {
         this.segment = segment;
         /**
-         *
-         * @internal - this method should only be called by mergeTree
+         * @remarks This method should only be called by mergeTree.
+         * @internal
          */
         this.hierRefCount = 0;
         this.refCount = 0;
@@ -172,8 +110,8 @@ export class LocalReferenceCollection {
         }
     }
     /**
-     *
-     * @internal - this method should only be called by mergeTree
+     * @remarks This method should only be called by mergeTree.
+     * @internal
      */
     [Symbol.iterator]() {
         const subiterators = [];
@@ -210,8 +148,8 @@ export class LocalReferenceCollection {
         return iterator;
     }
     /**
-     *
-     * @internal - this method should only be called by mergeTree
+     * @remarks This method should only be called by mergeTree.
+     * @internal
      */
     clear() {
         this.refCount = 0;
@@ -219,9 +157,7 @@ export class LocalReferenceCollection {
         const detachSegments = (refs) => {
             if (refs) {
                 for (const r of refs) {
-                    if (r.segment === this.segment) {
-                        r.segment = undefined;
-                    }
+                    this.removeLocalRef(r);
                 }
             }
         };
@@ -230,94 +166,77 @@ export class LocalReferenceCollection {
             if (refsAtOffset) {
                 detachSegments(refsAtOffset.before);
                 detachSegments(refsAtOffset.at);
-                detachSegments(refsAtOffset.before);
+                detachSegments(refsAtOffset.after);
                 this.refsByOffset[i] = undefined;
             }
         }
     }
     /**
-     *
-     * @internal - this method should only be called by mergeTree
+     * @remarks This method should only be called by mergeTree.
+     * @internal
      */
     get empty() {
         return this.refCount === 0;
     }
     /**
-     *
-     * @internal - this method should only be called by mergeTree
+     * @remarks This method should only be called by mergeTree.
+     * @internal
      */
-    createLocalRef(offset, refType, properties, client) {
-        const ref = new LocalReference(client, this.segment, offset, refType, properties);
+    createLocalRef(offset, refType, properties) {
+        const ref = new LocalReference(refType, properties);
+        ref.link(this.segment, offset, undefined);
         if (!refTypeIncludesFlag(ref, ReferenceType.Transient)) {
-            this.addLocalRef(ref);
+            this.addLocalRef(ref, offset);
         }
         return ref;
     }
     /**
-     *
-     * @internal - this method should only be called by mergeTree
+     * @remarks This method should only be called by mergeTree.
+     * @internal
      */
-    addLocalRef(lref) {
+    addLocalRef(lref, offset) {
         var _a, _b;
         assert(!refTypeIncludesFlag(lref, ReferenceType.Transient), 0x2df /* "transient references cannot be bound to segments" */);
         assertLocalReferences(lref);
-        const refsAtOffset = this.refsByOffset[lref.offset] =
-            (_a = this.refsByOffset[lref.offset]) !== null && _a !== void 0 ? _a : { at: ListMakeHead() };
+        assert(offset < this.segment.cachedLength, 0x348 /* offset cannot be beyond segment length */);
+        const refsAtOffset = this.refsByOffset[offset] =
+            (_a = this.refsByOffset[offset]) !== null && _a !== void 0 ? _a : { at: ListMakeHead() };
         const atRefs = refsAtOffset.at =
             (_b = refsAtOffset.at) !== null && _b !== void 0 ? _b : ListMakeHead();
-        atRefs.enqueue(lref);
+        lref.link(this.segment, offset, atRefs.enqueue(lref));
         if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {
             this.hierRefCount++;
         }
         this.refCount++;
     }
     /**
-     *
-     * @internal - this method should only be called by mergeTree
+     * @remarks This method should only be called by mergeTree.
+     * @internal
      */
     removeLocalRef(lref) {
-        assertLocalReferences(lref);
-        const tryRemoveRef = (refs) => {
-            if (refs) {
-                let node = refs;
-                do {
-                    node = node.next;
-                    if (node.data === lref) {
-                        ListRemoveEntry(node);
-                        if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {
-                            this.hierRefCount--;
-                        }
-                        this.refCount--;
-                        return lref;
-                    }
-                } while (!node.isHead);
-            }
-        };
-        const refAtOffset = this.refsByOffset[lref.offset];
-        if (refAtOffset !== undefined) {
-            let ref = tryRemoveRef(refAtOffset.before);
-            if (ref) {
-                return ref;
-            }
-            ref = tryRemoveRef(refAtOffset.at);
-            if (ref) {
-                return ref;
-            }
-            ref = tryRemoveRef(refAtOffset.after);
-            if (ref) {
-                return ref;
+        if (this.has(lref)) {
+            assertLocalReferences(lref);
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            ListRemoveEntry(lref.getListNode());
+            lref.link(lref.getSegment(), lref.getOffset(), undefined);
+            if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {
+                this.hierRefCount--;
             }
+            this.refCount--;
+            return lref;
         }
     }
     /**
-     * @internal - this method should only be called by mergeTree
      *
      * Called by 'append()' implementations to append local refs from the given 'other' segment to the
      * end of 'this' segment.
      *
      * Note: This method should be invoked after the caller has ensured that segments can be merged,
-     *       but before 'this' segment's cachedLength has changed, or the adjustment to the local refs
-     *       will be incorrect.
+     * but before 'this' segment's cachedLength has changed, or the adjustment to the local refs
+     * will be incorrect.
+     *
+     * @remarks This method should only be called by mergeTree.
+     * @internal
      */
     append(other) {
         if (!other || other.empty) {
@@ -327,14 +246,52 @@ export class LocalReferenceCollection {
         this.refCount += other.refCount;
         other.hierRefCount = 0;
         for (const lref of other) {
-            lref.segment = this.segment;
-            lref.offset += this.refsByOffset.length;
+            assertLocalReferences(lref);
+            lref.link(this.segment, lref.getOffset() + this.refsByOffset.length, lref.getListNode());
         }
         this.refsByOffset.push(...other.refsByOffset);
     }
     /**
-     * @internal - this method should only be called by mergeTree
+     * Returns true of the local reference is in the collection, otherwise false.
      *
+     * @remarks This method should only be called by mergeTree.
+     * @internal
+     */
+    has(lref) {
+        if (!(lref instanceof LocalReference)
+            || refTypeIncludesFlag(lref, ReferenceType.Transient)) {
+            return false;
+        }
+        const seg = lref.getSegment();
+        if (seg !== this.segment) {
+            return false;
+        }
+        // we should be able to optimize finding the
+        // list head
+        const listNode = lref.getListNode();
+        if (listNode === undefined) {
+            return false;
+        }
+        let prev = listNode;
+        let next = listNode;
+        while ((prev === null || prev === void 0 ? void 0 : prev.isHead) !== true && (next === null || next === void 0 ? void 0 : next.isHead) !== true) {
+            prev = prev === null || prev === void 0 ? void 0 : prev.prev;
+            next = next === null || next === void 0 ? void 0 : next.next;
+        }
+        const headNode = (prev === null || prev === void 0 ? void 0 : prev.isHead) === true ? prev : next;
+        if ((headNode === null || headNode === void 0 ? void 0 : headNode.isHead) !== true || headNode.empty()) {
+            return false;
+        }
+        const offset = lref.getOffset();
+        const refsAtOffset = this.refsByOffset[offset];
+        if ((refsAtOffset === null || refsAtOffset === void 0 ? void 0 : refsAtOffset.before) === headNode
+            || (refsAtOffset === null || refsAtOffset === void 0 ? void 0 : refsAtOffset.at) === headNode
+            || (refsAtOffset === null || refsAtOffset === void 0 ? void 0 : refsAtOffset.after) === headNode) {
+            return true;
+        }
+        return false;
+    }
+    /**
      * Splits this `LocalReferenceCollection` into the intervals [0, offset) and [offset, originalLength).
      * Local references in the former half of this split will remain associated with the segment used on construction.
      * Local references in the latter half of this split will be transferred to `splitSeg`,
@@ -342,14 +299,17 @@ export class LocalReferenceCollection {
      * @param offset - Offset into the original segment at which the collection should be split
      * @param splitSeg - Split segment which originally corresponded to the indices [offset, originalLength)
      * before splitting.
+     *
+     * @remarks This method should only be called by mergeTree.
+     * @internal
      */
     split(offset, splitSeg) {
         if (!this.empty) {
             const localRefs = new LocalReferenceCollection(splitSeg, this.refsByOffset.splice(offset, this.refsByOffset.length - offset));
             splitSeg.localRefs = localRefs;
             for (const lref of localRefs) {
-                lref.segment = splitSeg;
-                lref.offset -= offset;
+                assertLocalReferences(lref);
+                lref.link(splitSeg, lref.getOffset() - offset, lref.getListNode());
                 if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {
                     this.hierRefCount--;
                     localRefs.hierRefCount++;
@@ -364,57 +324,59 @@ export class LocalReferenceCollection {
         }
     }
     addBeforeTombstones(...refs) {
-        var _a, _b, _c, _d, _e;
+        var _a, _b, _c, _d, _e, _f, _g, _h, _j;
+        var _k;
         const beforeRefs = (_b = (_a = this.refsByOffset[0]) === null || _a === void 0 ? void 0 : _a.before) !== null && _b !== void 0 ? _b : ListMakeHead();
+        if (((_c = this.refsByOffset[0]) === null || _c === void 0 ? void 0 : _c.before) === undefined) {
+            const refsAtOffset = (_d = (_k = this.refsByOffset)[0]) !== null && _d !== void 0 ? _d : (_k[0] = { before: beforeRefs });
+            (_e = refsAtOffset.before) !== null && _e !== void 0 ? _e : (refsAtOffset.before = beforeRefs);
+        }
         for (const iterable of refs) {
             for (const lref of iterable) {
                 assertLocalReferences(lref);
                 if (refTypeIncludesFlag(lref, ReferenceType.SlideOnRemove)) {
-                    beforeRefs.push(lref);
-                    lref.segment = this.segment;
-                    lref.offset = 0;
+                    (_g = (_f = lref.callbacks) === null || _f === void 0 ? void 0 : _f.beforeSlide) === null || _g === void 0 ? void 0 : _g.call(_f);
+                    beforeRefs.unshift(lref);
+                    lref.link(this.segment, 0, beforeRefs.next);
                     if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {
                         this.hierRefCount++;
                     }
                     this.refCount++;
+                    (_j = (_h = lref.callbacks) === null || _h === void 0 ? void 0 : _h.afterSlide) === null || _j === void 0 ? void 0 : _j.call(_h);
                 }
                 else {
-                    lref.segment = undefined;
+                    lref.link(undefined, 0, undefined);
                 }
             }
         }
-        if (!beforeRefs.empty() && ((_c = this.refsByOffset[0]) === null || _c === void 0 ? void 0 : _c.before) === undefined) {
-            const refsAtOffset = this.refsByOffset[0] =
-                (_d = this.refsByOffset[0]) !== null && _d !== void 0 ? _d : { before: beforeRefs };
-            refsAtOffset.before = (_e = refsAtOffset.before) !== null && _e !== void 0 ? _e : beforeRefs;
-        }
     }
     addAfterTombstones(...refs) {
-        var _a, _b, _c, _d, _e;
-        const lastOffset = this.refsByOffset.length - 1;
+        var _a, _b, _c, _d, _e, _f, _g, _h, _j;
+        var _k;
+        const lastOffset = this.segment.cachedLength - 1;
         const afterRefs = (_b = (_a = this.refsByOffset[lastOffset]) === null || _a === void 0 ? void 0 : _a.after) !== null && _b !== void 0 ? _b : ListMakeHead();
+        if (((_c = this.refsByOffset[lastOffset]) === null || _c === void 0 ? void 0 : _c.after) === undefined) {
+            const refsAtOffset = (_d = (_k = this.refsByOffset)[lastOffset]) !== null && _d !== void 0 ? _d : (_k[lastOffset] = { after: afterRefs });
+            (_e = refsAtOffset.after) !== null && _e !== void 0 ? _e : (refsAtOffset.after = afterRefs);
+        }
         for (const iterable of refs) {
             for (const lref of iterable) {
                 assertLocalReferences(lref);
                 if (refTypeIncludesFlag(lref, ReferenceType.SlideOnRemove)) {
-                    afterRefs.push(lref);
-                    lref.segment = this.segment;
-                    lref.offset = this.segment.cachedLength - 1;
+                    (_g = (_f = lref.callbacks) === null || _f === void 0 ? void 0 : _f.beforeSlide) === null || _g === void 0 ? void 0 : _g.call(_f);
+                    afterRefs.enqueue(lref);
+                    lref.link(this.segment, lastOffset, afterRefs.prev);
                     if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {
                         this.hierRefCount++;
                     }
                     this.refCount++;
+                    (_j = (_h = lref.callbacks) === null || _h === void 0 ? void 0 : _h.afterSlide) === null || _j === void 0 ? void 0 : _j.call(_h);
                 }
                 else {
-                    lref.segment = undefined;
+                    lref.link(undefined, 0, undefined);
                 }
             }
         }
-        if (!afterRefs.empty() && ((_c = this.refsByOffset[lastOffset]) === null || _c === void 0 ? void 0 : _c.after) === undefined) {
-            const refsAtOffset = this.refsByOffset[lastOffset] =
-                (_d = this.refsByOffset[lastOffset]) !== null && _d !== void 0 ? _d : { after: afterRefs };
-            refsAtOffset.after = (_e = refsAtOffset.after) !== null && _e !== void 0 ? _e : afterRefs;
-        }
     }
 }
 //# sourceMappingURL=localReference.js.map

package/lib/localReference.js.map

@@ -1 +1 @@
-{"version":3,"file":"localReference.js","sourceRoot":"","sources":["../src/localReference.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAE7D,OAAO,EAAQ,YAAY,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAIpE,OAAO,EAAgB,aAAa,EAAE,MAAM,OAAO,CAAC;AACpD,OAAO,EAAE,aAAa,EAAe,MAAM,cAAc,CAAC;AAC1D,OAAO,EACH,oBAAoB,EACpB,oBAAoB,EACpB,yBAAyB,EACzB,gBAAgB,EAChB,iBAAiB,EAEjB,iBAAiB,EACjB,gBAAgB,EAChB,gBAAgB,EAChB,eAAe,EACf,mBAAmB,GACtB,MAAM,sBAAsB,CAAC;AAE9B;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAAsB;IACzD,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,mBAAmB,CAAC,OAAO,EAAE,aAAa,CAAC,SAAS,CAAC,EAAE;QACvD,EAAE,cAAc,CAAC;KACpB;IACD,IAAI,mBAAmB,CAAC,OAAO,EAAE,aAAa,CAAC,aAAa,CAAC,EAAE;QAC3D,EAAE,cAAc,CAAC;KACpB;IACD,IAAI,mBAAmB,CAAC,OAAO,EAAE,aAAa,CAAC,YAAY,CAAC,EAAE;QAC1D,EAAE,cAAc,CAAC;KACpB;IACD,IAAI,cAAc,GAAG,CAAC,EAAE;QACpB,MAAM,IAAI,UAAU,CAChB,+EAA+E,CAAC,CAAC;KACxF;AACL,CAAC;AAMD;;GAEG;AACH,MAAM,OAAO,cAAc;IAkBvB;;OAEG;IACH,YACqB,MAAc,EAC/B,WAAqB;IACrB;;OAEG;IACI,SAAiB,CAAC,EAClB,UAAU,aAAa,CAAC,MAAM,EACrC,UAAwB;QAPP,WAAM,GAAN,MAAM,CAAQ;QAKxB,WAAM,GAAN,MAAM,CAAY;QAClB,YAAO,GAAP,OAAO,CAAuB;QAGrC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,CAAC,OAAO,GAAG,WAAW,CAAC;QAC3B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IACjC,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,CAAiB;QACxB,OAAO,oBAAoB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;IACD;;OAEG;IACI,GAAG,CAAC,CAAiB;QACxB,OAAO,oBAAoB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;IACD;;OAEG;IACI,OAAO,CAAC,CAAiB;QAC5B,OAAO,yBAAyB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACI,UAAU;QACb,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC,gCAAgC,CAAC,IAAI,CAAC,CAAC;IACnE,CAAC;IAED;;OAEG;IACI,aAAa;QAChB,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD;;OAEG;IACI,cAAc;QACjB,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IACD;;OAEG;IACI,YAAY,CAAC,KAAa;QAC7B,OAAO,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACxC,CAAC;IACD;;OAEG;IACI,aAAa,CAAC,KAAa;QAC9B,OAAO,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IACD;;OAEG;IACI,aAAa;QAChB,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD;;OAEG;IACI,cAAc;QACjB,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAEM,MAAM;QACT,OAAO,KAAK,CAAC;IACjB,CAAC;IAEM,aAAa,CAAC,QAAqB,EAAE,EAAiB;QACzD,IAAI,CAAC,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC;IACnE,CAAC;IAED;;OAEG;IACI,SAAS;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC;IACvB,CAAC;IAEM,UAAU;QACb,OAAO,IAAI,CAAC,OAAO,CAAC;IACxB,CAAC;IAEM,SAAS;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC;IACvB,CAAC;IAEM,aAAa;QAChB,OAAO,IAAI,CAAC,UAAU,CAAC;IAC3B,CAAC;;AA3HD;;GAEG;AACoB,+BAAgB,GAAW,CAAC,CAAC,CAAC;AAiIzD,SAAS,qBAAqB,CAAC,IAAwC;IACnE,MAAM,CAAC,IAAI,YAAY,cAAc,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;AACrF,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,wBAAwB;IAwBjC;;;OAGG;IACH;IACI,gEAAgE;IAC/C,OAAiB,EAClC,uBAAuB,IAAI,KAAK,CAA4B,OAAO,CAAC,YAAY,CAAC;QADhE,YAAO,GAAP,OAAO,CAAU;QAdtC;;;WAGG;QACI,iBAAY,GAAW,CAAC,CAAC;QAExB,aAAQ,GAAW,CAAC,CAAC;QAUzB,yEAAyE;QACzE,uEAAuE;QACvE,6BAA6B;QAC7B,IAAI,CAAC,YAAY,GAAG,oBAAoB,CAAC;IAC7C,CAAC;IAnCM,MAAM,CAAC,MAAM,CAAC,IAAc,EAAE,IAAc;QAC/C,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE;YACzC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;gBACjB,IAAI,CAAC,SAAS,GAAG,IAAI,wBAAwB,CAAC,IAAI,CAAC,CAAC;aACvD;YACD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,MAAM,KAAK,IAAI,CAAC,YAAY,EAC3D,KAAK,CAAC,4CAA4C,CAAC,CAAC;YACxD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;SACzC;aAAM,IAAI,IAAI,CAAC,SAAS,EAAE;YACvB,oEAAoE;YACpE,oFAAoF;YACpF,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC;SAC3D;IACL,CAAC;IAwBD;;;OAGG;IACI,CAAC,MAAM,CAAC,QAAQ,CAAC;QACpB,MAAM,YAAY,GAAuC,EAAE,CAAC;QAC5D,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE;YAClC,IAAI,IAAI,EAAE;gBACN,IAAI,IAAI,CAAC,MAAM,EAAE;oBACb,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;iBACrD;gBACD,IAAI,IAAI,CAAC,EAAE,EAAE;oBACT,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;iBACjD;gBACD,IAAI,IAAI,CAAC,KAAK,EAAE;oBACZ,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;iBACpD;aACJ;SACJ;QAED,MAAM,QAAQ,GAAG;YACb,IAAI;gBACA,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;oBAC5B,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;oBACpC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;wBACpB,YAAY,CAAC,KAAK,EAAE,CAAC;qBACxB;yBAAM;wBACH,OAAO,IAAI,CAAC;qBACf;iBACJ;gBAED,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YAC5C,CAAC;YACD,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACb,OAAO,IAAI,CAAC;YAChB,CAAC;SACJ,CAAC;QACF,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED;;;OAGG;IACI,KAAK;QACR,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,MAAM,cAAc,GAAG,CAAC,IAAsC,EAAE,EAAE;YAC9D,IAAI,IAAI,EAAE;gBACN,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;oBAClB,IAAI,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO,EAAE;wBAC5B,CAAC,CAAC,OAAO,GAAG,SAAS,CAAC;qBACzB;iBACJ;aACJ;QACL,CAAC,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/C,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,YAAY,EAAE;gBACd,cAAc,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;gBACpC,cAAc,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;gBAChC,cAAc,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;gBACpC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;aACpC;SACJ;IACL,CAAC;IAED;;;OAGG;IACH,IAAW,KAAK;QACZ,OAAO,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACI,cAAc,CACjB,MAA0B,EAC1B,OAAsB,EACtB,UAAmC,EACnC,MAAc;QACd,MAAM,GAAG,GAAG,IAAI,cAAc,CAC1B,MAAM,EACN,IAAI,CAAC,OAAO,EACZ,MAAM,EACN,OAAO,EACP,UAAU,CACb,CAAC;QACF,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,aAAa,CAAC,SAAS,CAAC,EAAE;YACpD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;SACzB;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,IAAwC;;QACvD,MAAM,CACF,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,SAAS,CAAC,EACnD,KAAK,CAAC,wDAAwD,CAAC,CAAC;QACpE,qBAAqB,CAAC,IAAI,CAAC,CAAC;QAC5B,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC;YAC/C,MAAA,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,mCAC3B,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE;YAC1B,MAAA,YAAY,CAAC,EAAE,mCACZ,YAAY,EAAE,CAAC;QAEtB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAErB,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;YACnD,IAAI,CAAC,YAAY,EAAE,CAAC;SACvB;QACD,IAAI,CAAC,QAAQ,EAAE,CAAC;IACpB,CAAC;IAED;;;OAGG;IACI,cAAc,CAAC,IAAwC;QAC1D,qBAAqB,CAAC,IAAI,CAAC,CAAC;QAC5B,MAAM,YAAY,GAAG,CAAC,IAAsC,EAAE,EAAE;YAC5D,IAAI,IAAI,EAAE;gBACN,IAAI,IAAI,GAAG,IAAI,CAAC;gBAChB,GAAG;oBACC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBACjB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;wBACpB,eAAe,CAAC,IAAI,CAAC,CAAC;wBACtB,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;4BACnD,IAAI,CAAC,YAAY,EAAE,CAAC;yBACvB;wBACD,IAAI,CAAC,QAAQ,EAAE,CAAC;wBAChB,OAAO,IAAI,CAAC;qBACf;iBACJ,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE;aAC1B;QACL,CAAC,CAAC;QACF,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,WAAW,KAAK,SAAS,EAAE;YAC3B,IAAI,GAAG,GAAG,YAAY,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAC3C,IAAI,GAAG,EAAE;gBACL,OAAO,GAAG,CAAC;aACd;YAED,GAAG,GAAG,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YACnC,IAAI,GAAG,EAAE;gBACL,OAAO,GAAG,CAAC;aACd;YAED,GAAG,GAAG,YAAY,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YACtC,IAAI,GAAG,EAAE;gBACL,OAAO,GAAG,CAAC;aACd;SACJ;IACL,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,KAA+B;QACzC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE;YACvB,OAAO;SACV;QACD,IAAI,CAAC,YAAY,IAAI,KAAK,CAAC,YAAY,CAAC;QACxC,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC;QAChC,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC;QACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACtB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;YAC5B,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;SAC3C;QAED,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC;IAClD,CAAC;IAED;;;;;;;;;;OAUG;IACI,KAAK,CAAC,MAAc,EAAE,QAAkB;QAC3C,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACb,MAAM,SAAS,GACX,IAAI,wBAAwB,CACxB,QAAQ,EACR,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;YAE7E,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE;gBAC1B,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;gBACxB,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC;gBACtB,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;oBACnD,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpB,SAAS,CAAC,YAAY,EAAE,CAAC;iBAC5B;gBACD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChB,SAAS,CAAC,QAAQ,EAAE,CAAC;aACxB;SACJ;aAAM;YACH,mDAAmD;YACnD,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,MAAM,CAAC;SACrC;IACL,CAAC;IAEM,mBAAmB,CAAC,GAAG,IAAoD;;QAC9E,MAAM,UAAU,GAAG,MAAA,MAAA,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,0CAAE,MAAM,mCAAI,YAAY,EAAE,CAAC;QAElE,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE;YACzB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;gBACzB,qBAAqB,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,aAAa,CAAC,EAAE;oBACxD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACtB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;oBAC5B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;oBAChB,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;wBACnD,IAAI,CAAC,YAAY,EAAE,CAAC;qBACvB;oBACD,IAAI,CAAC,QAAQ,EAAE,CAAC;iBACnB;qBAAM;oBACH,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;iBAC5B;aACJ;SACJ;QACD,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAA,MAAA,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,0CAAE,MAAM,MAAK,SAAS,EAAE;YACnE,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;gBACrC,MAAA,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,mCACjB,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;YAC9B,YAAY,CAAC,MAAM,GAAG,MAAA,YAAY,CAAC,MAAM,mCAAI,UAAU,CAAC;SAC3D;IACL,CAAC;IAEM,kBAAkB,CAAC,GAAG,IAAoD;;QAC7E,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;QAChD,MAAM,SAAS,GACX,MAAA,MAAA,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,0CAAE,KAAK,mCAAI,YAAY,EAAE,CAAC;QAE3D,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE;YACzB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;gBACzB,qBAAqB,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,aAAa,CAAC,EAAE;oBACxD,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACrB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;oBAC5B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,GAAG,CAAC,CAAC;oBAC5C,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;wBACnD,IAAI,CAAC,YAAY,EAAE,CAAC;qBACvB;oBACD,IAAI,CAAC,QAAQ,EAAE,CAAC;iBACnB;qBAAM;oBACH,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;iBAC5B;aACJ;SACJ;QACD,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAA,MAAA,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,0CAAE,KAAK,MAAK,SAAS,EAAE;YAC1E,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC;gBAC9C,MAAA,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,mCAC1B,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;YAC5B,YAAY,CAAC,KAAK,GAAG,MAAA,YAAY,CAAC,KAAK,mCAAI,SAAS,CAAC;SACxD;IACL,CAAC;CACJ","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { UsageError } from \"@fluidframework/container-utils\";\nimport { Client } from \"./client\";\nimport { List, ListMakeHead, ListRemoveEntry } from \"./collections\";\nimport {\n    ISegment,\n} from \"./mergeTree\";\nimport { ICombiningOp, ReferenceType } from \"./ops\";\nimport { addProperties, PropertySet } from \"./properties\";\nimport {\n    minReferencePosition,\n    maxReferencePosition,\n    compareReferencePositions,\n    refHasTileLabels,\n    refHasRangeLabels,\n    ReferencePosition,\n    refGetRangeLabels,\n    refGetTileLabels,\n    refHasRangeLabel,\n    refHasTileLabel,\n    refTypeIncludesFlag,\n} from \"./referencePositions\";\n\n/**\n * @internal\n */\nexport function _validateReferenceType(refType: ReferenceType) {\n    let exclusiveCount = 0;\n    if (refTypeIncludesFlag(refType, ReferenceType.Transient)) {\n        ++exclusiveCount;\n    }\n    if (refTypeIncludesFlag(refType, ReferenceType.SlideOnRemove)) {\n        ++exclusiveCount;\n    }\n    if (refTypeIncludesFlag(refType, ReferenceType.StayOnRemove)) {\n        ++exclusiveCount;\n    }\n    if (exclusiveCount > 1) {\n        throw new UsageError(\n            \"Reference types can only be one of Transient, SlideOnRemove, and StayOnRemove\");\n    }\n}\n\nexport interface LocalReferencePosition extends ReferencePosition {\n    callbacks?: Partial<Record<\"beforeSlide\" | \"afterSlide\", () => void>>;\n}\n\n/**\n * @deprecated - Use LocalReferencePosition\n */\nexport class LocalReference implements LocalReferencePosition {\n    /**\n     * @deprecated - use DetachedReferencePosition\n     */\n    public static readonly DetachedPosition: number = -1;\n\n    public properties: PropertySet | undefined;\n    /**\n     * @deprecated - use properties to store pair\n     */\n    public pairedRef?: LocalReference;\n    /**\n     * @deprecated - use getSegment\n     */\n    public segment: ISegment | undefined;\n\n    public callbacks?: Partial<Record<\"beforeSlide\" | \"afterSlide\", () => void>> | undefined;\n\n    /**\n     * @deprecated - use createReferencePosition\n     */\n    constructor(\n        private readonly client: Client,\n        initSegment: ISegment,\n        /**\n         * @deprecated - use getOffset\n         */\n        public offset: number = 0,\n        public refType = ReferenceType.Simple,\n        properties?: PropertySet,\n    ) {\n        _validateReferenceType(refType);\n        this.segment = initSegment;\n        this.properties = properties;\n    }\n\n    /**\n     * @deprecated - use minReferencePosition\n     */\n    public min(b: LocalReference) {\n        return minReferencePosition(this, b);\n    }\n    /**\n     * @deprecated - use maxReferencePosition\n     */\n    public max(b: LocalReference) {\n        return maxReferencePosition(this, b);\n    }\n    /**\n     * @deprecated - use compareReferencePositions\n     */\n    public compare(b: LocalReference) {\n        return compareReferencePositions(this, b);\n    }\n\n    /**\n     * @deprecated - use getLocalReferencePosition\n     */\n    public toPosition() {\n        return this.getClient().localReferencePositionToPosition(this);\n    }\n\n    /**\n     * @deprecated - use refHasTileLabels\n     */\n    public hasTileLabels(): boolean {\n        return refHasTileLabels(this);\n    }\n    /**\n     * @deprecated - use refHasRangeLabels\n     */\n    public hasRangeLabels(): boolean {\n        return refHasRangeLabels(this);\n    }\n    /**\n     * @deprecated - use refHasTileLabel\n     */\n    public hasTileLabel(label: string): boolean {\n        return refHasTileLabel(this, label);\n    }\n    /**\n     * @deprecated - use refHasRangeLabel\n     */\n    public hasRangeLabel(label: string): boolean {\n        return refHasRangeLabel(this, label);\n    }\n    /**\n     * @deprecated - use refGetTileLabels\n     */\n    public getTileLabels(): string[] | undefined {\n        return refGetTileLabels(this);\n    }\n    /**\n     * @deprecated - use refGetRangeLabels\n     */\n    public getRangeLabels(): string[] | undefined {\n        return refGetRangeLabels(this);\n    }\n\n    public isLeaf() {\n        return false;\n    }\n\n    public addProperties(newProps: PropertySet, op?: ICombiningOp) {\n        this.properties = addProperties(this.properties, newProps, op);\n    }\n\n    /**\n     * @deprecated - no longer supported\n     */\n    public getClient() {\n        return this.client;\n    }\n\n    public getSegment() {\n        return this.segment;\n    }\n\n    public getOffset() {\n        return this.offset;\n    }\n\n    public getProperties() {\n        return this.properties;\n    }\n}\n\ninterface IRefsAtOffset {\n    before?: List<LocalReference>;\n    at?: List<LocalReference>;\n    after?: List<LocalReference>;\n}\n\nfunction assertLocalReferences(lref: ReferencePosition | LocalReference): asserts lref is LocalReference {\n    assert(lref instanceof LocalReference, 0x2e0 /* \"lref not a Local Reference\" */);\n}\n\n/**\n * Represents a collection of {@link ReferencePosition}s associated with one segment in a merge-tree.\n */\nexport class LocalReferenceCollection {\n    public static append(seg1: ISegment, seg2: ISegment) {\n        if (seg2.localRefs && !seg2.localRefs.empty) {\n            if (!seg1.localRefs) {\n                seg1.localRefs = new LocalReferenceCollection(seg1);\n            }\n            assert(seg1.localRefs.refsByOffset.length === seg1.cachedLength,\n                0x2be /* \"LocalReferences array contains a gap\" */);\n            seg1.localRefs.append(seg2.localRefs);\n        } else if (seg1.localRefs) {\n            // Since creating the LocalReferenceCollection, we may have appended\n            // segments that had no local references. Account for them now by padding the array.\n            seg1.localRefs.refsByOffset.length += seg2.cachedLength;\n        }\n    }\n\n    /**\n     *\n     * @internal - this method should only be called by mergeTree\n     */\n    public hierRefCount: number = 0;\n    private readonly refsByOffset: (IRefsAtOffset | undefined)[];\n    private refCount: number = 0;\n\n    /**\n     *\n     * @internal - this method should only be called by mergeTree\n     */\n    constructor(\n        /** Segment this `LocalReferenceCollection` is associated to. */\n        private readonly segment: ISegment,\n        initialRefsByfOffset = new Array<IRefsAtOffset | undefined>(segment.cachedLength)) {\n        // Since javascript arrays are sparse the above won't populate any of the\n        // indices, but it will ensure the length property of the array matches\n        // the length of the segment.\n        this.refsByOffset = initialRefsByfOffset;\n    }\n\n    /**\n     *\n     * @internal - this method should only be called by mergeTree\n     */\n    public [Symbol.iterator]() {\n        const subiterators: IterableIterator<LocalReference>[] = [];\n        for (const refs of this.refsByOffset) {\n            if (refs) {\n                if (refs.before) {\n                    subiterators.push(refs.before[Symbol.iterator]());\n                }\n                if (refs.at) {\n                    subiterators.push(refs.at[Symbol.iterator]());\n                }\n                if (refs.after) {\n                    subiterators.push(refs.after[Symbol.iterator]());\n                }\n            }\n        }\n\n        const iterator = {\n            next(): IteratorResult<LocalReference> {\n                while (subiterators.length > 0) {\n                    const next = subiterators[0].next();\n                    if (next.done === true) {\n                        subiterators.shift();\n                    } else {\n                        return next;\n                    }\n                }\n\n                return { value: undefined, done: true };\n            },\n            [Symbol.iterator]() {\n                return this;\n            },\n        };\n        return iterator;\n    }\n\n    /**\n     *\n     * @internal - this method should only be called by mergeTree\n     */\n    public clear() {\n        this.refCount = 0;\n        this.hierRefCount = 0;\n        const detachSegments = (refs: List<LocalReference> | undefined) => {\n            if (refs) {\n                for (const r of refs) {\n                    if (r.segment === this.segment) {\n                        r.segment = undefined;\n                    }\n                }\n            }\n        };\n        for (let i = 0; i < this.refsByOffset.length; i++) {\n            const refsAtOffset = this.refsByOffset[i];\n            if (refsAtOffset) {\n                detachSegments(refsAtOffset.before);\n                detachSegments(refsAtOffset.at);\n                detachSegments(refsAtOffset.before);\n                this.refsByOffset[i] = undefined;\n            }\n        }\n    }\n\n    /**\n     *\n     * @internal - this method should only be called by mergeTree\n     */\n    public get empty() {\n        return this.refCount === 0;\n    }\n\n    /**\n     *\n     * @internal - this method should only be called by mergeTree\n     */\n    public createLocalRef(\n        offset: number | undefined,\n        refType: ReferenceType,\n        properties: PropertySet | undefined,\n        client: Client): ReferencePosition {\n        const ref = new LocalReference(\n            client,\n            this.segment,\n            offset,\n            refType,\n            properties,\n        );\n        if (!refTypeIncludesFlag(ref, ReferenceType.Transient)) {\n            this.addLocalRef(ref);\n        }\n        return ref;\n    }\n\n    /**\n     *\n     * @internal - this method should only be called by mergeTree\n     */\n    public addLocalRef(lref: LocalReference | ReferencePosition) {\n        assert(\n            !refTypeIncludesFlag(lref, ReferenceType.Transient),\n            0x2df /* \"transient references cannot be bound to segments\" */);\n        assertLocalReferences(lref);\n        const refsAtOffset = this.refsByOffset[lref.offset] =\n            this.refsByOffset[lref.offset]\n            ?? { at: ListMakeHead() };\n        const atRefs = refsAtOffset.at =\n            refsAtOffset.at\n            ?? ListMakeHead();\n\n        atRefs.enqueue(lref);\n\n        if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {\n            this.hierRefCount++;\n        }\n        this.refCount++;\n    }\n\n    /**\n     *\n     * @internal - this method should only be called by mergeTree\n     */\n    public removeLocalRef(lref: LocalReference | ReferencePosition) {\n        assertLocalReferences(lref);\n        const tryRemoveRef = (refs: List<LocalReference> | undefined) => {\n            if (refs) {\n                let node = refs;\n                do {\n                    node = node.next;\n                    if (node.data === lref) {\n                        ListRemoveEntry(node);\n                        if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {\n                            this.hierRefCount--;\n                        }\n                        this.refCount--;\n                        return lref;\n                    }\n                } while (!node.isHead);\n            }\n        };\n        const refAtOffset = this.refsByOffset[lref.offset];\n        if (refAtOffset !== undefined) {\n            let ref = tryRemoveRef(refAtOffset.before);\n            if (ref) {\n                return ref;\n            }\n\n            ref = tryRemoveRef(refAtOffset.at);\n            if (ref) {\n                return ref;\n            }\n\n            ref = tryRemoveRef(refAtOffset.after);\n            if (ref) {\n                return ref;\n            }\n        }\n    }\n\n    /**\n     * @internal - this method should only be called by mergeTree\n     *\n     * Called by 'append()' implementations to append local refs from the given 'other' segment to the\n     * end of 'this' segment.\n     *\n     * Note: This method should be invoked after the caller has ensured that segments can be merged,\n     *       but before 'this' segment's cachedLength has changed, or the adjustment to the local refs\n     *       will be incorrect.\n     */\n    public append(other: LocalReferenceCollection) {\n        if (!other || other.empty) {\n            return;\n        }\n        this.hierRefCount += other.hierRefCount;\n        this.refCount += other.refCount;\n        other.hierRefCount = 0;\n        for (const lref of other) {\n            lref.segment = this.segment;\n            lref.offset += this.refsByOffset.length;\n        }\n\n        this.refsByOffset.push(...other.refsByOffset);\n    }\n\n    /**\n     * @internal - this method should only be called by mergeTree\n     *\n     * Splits this `LocalReferenceCollection` into the intervals [0, offset) and [offset, originalLength).\n     * Local references in the former half of this split will remain associated with the segment used on construction.\n     * Local references in the latter half of this split will be transferred to `splitSeg`,\n     * and its `localRefs` field will be set.\n     * @param offset - Offset into the original segment at which the collection should be split\n     * @param splitSeg - Split segment which originally corresponded to the indices [offset, originalLength)\n     * before splitting.\n     */\n    public split(offset: number, splitSeg: ISegment) {\n        if (!this.empty) {\n            const localRefs =\n                new LocalReferenceCollection(\n                    splitSeg,\n                    this.refsByOffset.splice(offset, this.refsByOffset.length - offset));\n\n            splitSeg.localRefs = localRefs;\n            for (const lref of localRefs) {\n                lref.segment = splitSeg;\n                lref.offset -= offset;\n                if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {\n                    this.hierRefCount--;\n                    localRefs.hierRefCount++;\n                }\n                this.refCount--;\n                localRefs.refCount++;\n            }\n        } else {\n            // shrink the offset array when empty and splitting\n            this.refsByOffset.length = offset;\n        }\n    }\n\n    public addBeforeTombstones(...refs: Iterable<LocalReference | ReferencePosition>[]) {\n        const beforeRefs = this.refsByOffset[0]?.before ?? ListMakeHead();\n\n        for (const iterable of refs) {\n            for (const lref of iterable) {\n                assertLocalReferences(lref);\n                if (refTypeIncludesFlag(lref, ReferenceType.SlideOnRemove)) {\n                    beforeRefs.push(lref);\n                    lref.segment = this.segment;\n                    lref.offset = 0;\n                    if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {\n                        this.hierRefCount++;\n                    }\n                    this.refCount++;\n                } else {\n                    lref.segment = undefined;\n                }\n            }\n        }\n        if (!beforeRefs.empty() && this.refsByOffset[0]?.before === undefined) {\n            const refsAtOffset = this.refsByOffset[0] =\n                this.refsByOffset[0]\n                ?? { before: beforeRefs };\n            refsAtOffset.before = refsAtOffset.before ?? beforeRefs;\n        }\n    }\n\n    public addAfterTombstones(...refs: Iterable<LocalReference | ReferencePosition>[]) {\n        const lastOffset = this.refsByOffset.length - 1;\n        const afterRefs =\n            this.refsByOffset[lastOffset]?.after ?? ListMakeHead();\n\n        for (const iterable of refs) {\n            for (const lref of iterable) {\n                assertLocalReferences(lref);\n                if (refTypeIncludesFlag(lref, ReferenceType.SlideOnRemove)) {\n                    afterRefs.push(lref);\n                    lref.segment = this.segment;\n                    lref.offset = this.segment.cachedLength - 1;\n                    if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {\n                        this.hierRefCount++;\n                    }\n                    this.refCount++;\n                } else {\n                    lref.segment = undefined;\n                }\n            }\n        }\n        if (!afterRefs.empty() && this.refsByOffset[lastOffset]?.after === undefined) {\n            const refsAtOffset = this.refsByOffset[lastOffset] =\n                this.refsByOffset[lastOffset]\n                ?? { after: afterRefs };\n            refsAtOffset.after = refsAtOffset.after ?? afterRefs;\n        }\n    }\n}\n"]}
+{"version":3,"file":"localReference.js","sourceRoot":"","sources":["../src/localReference.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAC7D,OAAO,EAAQ,YAAY,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAIpE,OAAO,EAAgB,aAAa,EAAE,MAAM,OAAO,CAAC;AACpD,OAAO,EAAE,aAAa,EAAe,MAAM,cAAc,CAAC;AAC1D,OAAO,EACH,gBAAgB,EAChB,iBAAiB,EAEjB,mBAAmB,GACtB,MAAM,sBAAsB,CAAC;AAE9B;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAAsB;IACzD,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,mBAAmB,CAAC,OAAO,EAAE,aAAa,CAAC,SAAS,CAAC,EAAE;QACvD,EAAE,cAAc,CAAC;KACpB;IACD,IAAI,mBAAmB,CAAC,OAAO,EAAE,aAAa,CAAC,aAAa,CAAC,EAAE;QAC3D,EAAE,cAAc,CAAC;KACpB;IACD,IAAI,mBAAmB,CAAC,OAAO,EAAE,aAAa,CAAC,YAAY,CAAC,EAAE;QAC1D,EAAE,cAAc,CAAC;KACpB;IACD,IAAI,cAAc,GAAG,CAAC,EAAE;QACpB,MAAM,IAAI,UAAU,CAChB,+EAA+E,CAAC,CAAC;KACxF;AACL,CAAC;AAMD;;;GAGG;AACH,MAAM,cAAc;IAShB,YACW,UAAU,aAAa,CAAC,MAAM,EACrC,UAAwB;QADjB,YAAO,GAAP,OAAO,CAAuB;QANjC,WAAM,GAAW,CAAC,CAAC;QASvB,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IACjC,CAAC;IAEM,IAAI,CAAC,OAA6B,EAAE,MAAc,EAAE,QAA0C;;QACjG,IAAI,QAAQ,KAAK,IAAI,CAAC,QAAQ;eACvB,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YAChC,MAAA,MAAA,IAAI,CAAC,OAAO,0CAAE,SAAS,0CAAE,cAAc,CAAC,IAAI,CAAC,CAAC;SACjD;QACD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC7B,CAAC;IAEM,MAAM;QACT,OAAO,KAAK,CAAC;IACjB,CAAC;IAEM,aAAa,CAAC,QAAqB,EAAE,EAAiB;QACzD,IAAI,CAAC,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC;IACnE,CAAC;IAEM,UAAU;QACb,OAAO,IAAI,CAAC,OAAO,CAAC;IACxB,CAAC;IAEM,SAAS;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC;IACvB,CAAC;IAEM,WAAW;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;IAEM,aAAa;QAChB,OAAO,IAAI,CAAC,UAAU,CAAC;IAC3B,CAAC;CACJ;AAED,MAAM,UAAU,oCAAoC,CAAC,OAAuB;IACxE,OAAO,IAAI,cAAc,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;AAClD,CAAC;AAQD,MAAM,UAAU,qBAAqB,CACjC,IAAS;IAET,MAAM,CAAC,IAAI,YAAY,cAAc,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;AACrF,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,wBAAwB;IAwBjC;;;OAGG;IACH;IACI,gEAAgE;IAC/C,OAAiB,EAClC,uBAAuB,IAAI,KAAK,CAA4B,OAAO,CAAC,YAAY,CAAC;QADhE,YAAO,GAAP,OAAO,CAAU;QAdtC;;;WAGG;QACI,iBAAY,GAAW,CAAC,CAAC;QAExB,aAAQ,GAAW,CAAC,CAAC;QAUzB,yEAAyE;QACzE,uEAAuE;QACvE,6BAA6B;QAC7B,IAAI,CAAC,YAAY,GAAG,oBAAoB,CAAC;IAC7C,CAAC;IAnCM,MAAM,CAAC,MAAM,CAAC,IAAc,EAAE,IAAc;QAC/C,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE;YACzC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;gBACjB,IAAI,CAAC,SAAS,GAAG,IAAI,wBAAwB,CAAC,IAAI,CAAC,CAAC;aACvD;YACD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,MAAM,KAAK,IAAI,CAAC,YAAY,EAC3D,KAAK,CAAC,4CAA4C,CAAC,CAAC;YACxD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;SACzC;aAAM,IAAI,IAAI,CAAC,SAAS,EAAE;YACvB,oEAAoE;YACpE,oFAAoF;YACpF,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC;SAC3D;IACL,CAAC;IAwBD;;;OAGG;IACI,CAAC,MAAM,CAAC,QAAQ,CAAC;QACpB,MAAM,YAAY,GAA+C,EAAE,CAAC;QACpE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE;YAClC,IAAI,IAAI,EAAE;gBACN,IAAI,IAAI,CAAC,MAAM,EAAE;oBACb,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;iBACrD;gBACD,IAAI,IAAI,CAAC,EAAE,EAAE;oBACT,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;iBACjD;gBACD,IAAI,IAAI,CAAC,KAAK,EAAE;oBACZ,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;iBACpD;aACJ;SACJ;QAED,MAAM,QAAQ,GAAG;YACb,IAAI;gBACA,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;oBAC5B,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;oBACpC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;wBACpB,YAAY,CAAC,KAAK,EAAE,CAAC;qBACxB;yBAAM;wBACH,OAAO,IAAI,CAAC;qBACf;iBACJ;gBAED,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YAC5C,CAAC;YACD,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACb,OAAO,IAAI,CAAC;YAChB,CAAC;SACJ,CAAC;QACF,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED;;;OAGG;IACI,KAAK;QACR,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,MAAM,cAAc,GAAG,CAAC,IAAsC,EAAE,EAAE;YAC9D,IAAI,IAAI,EAAE;gBACN,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;oBAClB,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;iBAC1B;aACJ;QACL,CAAC,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/C,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,YAAY,EAAE;gBACd,cAAc,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;gBACpC,cAAc,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;gBAChC,cAAc,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBACnC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;aACpC;SACJ;IACL,CAAC;IAED;;;OAGG;IACH,IAAW,KAAK;QACZ,OAAO,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACI,cAAc,CACjB,MAAc,EACd,OAAsB,EACtB,UAAmC;QACnC,MAAM,GAAG,GAAG,IAAI,cAAc,CAC1B,OAAO,EACP,UAAU,CACb,CAAC;QACF,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,aAAa,CAAC,SAAS,CAAC,EAAE;YACpD,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;SACjC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,IAA4B,EAAE,MAAc;;QAC3D,MAAM,CACF,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,SAAS,CAAC,EACnD,KAAK,CAAC,wDAAwD,CAAC,CAAC;QACpE,qBAAqB,CAAC,IAAI,CAAC,CAAC;QAC5B,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;QAC/F,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;YAC1C,MAAA,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,mCACtB,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE;YAC1B,MAAA,YAAY,CAAC,EAAE,mCACZ,YAAY,EAAE,CAAC;QAEtB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QAEtD,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;YACnD,IAAI,CAAC,YAAY,EAAE,CAAC;SACvB;QACD,IAAI,CAAC,QAAQ,EAAE,CAAC;IACpB,CAAC;IAED;;;OAGG;IACI,cAAc,CAAC,IAA4B;QAC9C,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YAChB,qBAAqB,CAAC,IAAI,CAAC,CAAC;YAC5B,oEAAoE;YACpE,eAAe,CAAC,IAAI,CAAC,WAAW,EAAG,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI,CACL,IAAI,CAAC,UAAU,EAAE,EACjB,IAAI,CAAC,SAAS,EAAE,EAChB,SAAS,CAAC,CAAC;YACf,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;gBACnD,IAAI,CAAC,YAAY,EAAE,CAAC;aACvB;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,OAAO,IAAI,CAAC;SACf;IACL,CAAC;IAED;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,KAA+B;QACzC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE;YACvB,OAAO;SACV;QACD,IAAI,CAAC,YAAY,IAAI,KAAK,CAAC,YAAY,CAAC;QACxC,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC;QAChC,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC;QACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACtB,qBAAqB,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,CACL,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,SAAS,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAC3C,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;SAC3B;QAED,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC;IAClD,CAAC;IACD;;;;;OAKG;IACI,GAAG,CAAC,IAAuB;QAC9B,IAAI,CAAC,CAAC,IAAI,YAAY,cAAc,CAAC;eAC9B,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,SAAS,CAAC,EAAE;YACvD,OAAO,KAAK,CAAC;SAChB;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC9B,IAAI,GAAG,KAAK,IAAI,CAAC,OAAO,EAAE;YACtB,OAAO,KAAK,CAAC;SAChB;QACD,4CAA4C;QAC5C,YAAY;QACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACpC,IAAI,QAAQ,KAAK,SAAS,EAAE;YACxB,OAAO,KAAK,CAAC;SAChB;QACD,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,OAAO,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,MAAM,MAAK,IAAI,IAAI,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,MAAM,MAAK,IAAI,EAAE;YACnD,IAAI,GAAG,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,IAAI,CAAC;YAClB,IAAI,GAAG,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,IAAI,CAAC;SACrB;QAED,MAAM,QAAQ,GAAG,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,MAAM,MAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACrD,IAAI,CAAA,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,MAAK,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,EAAE;YAC/C,OAAO,KAAK,CAAC;SAChB;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,CAAA,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,MAAM,MAAK,QAAQ;eAC9B,CAAA,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,EAAE,MAAK,QAAQ;eAC7B,CAAA,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,KAAK,MAAK,QAAQ,EAAE;YACjC,OAAO,IAAI,CAAC;SACf;QACL,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;;;;;;OAWG;IACI,KAAK,CAAC,MAAc,EAAE,QAAkB;QAC3C,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACb,MAAM,SAAS,GACX,IAAI,wBAAwB,CACxB,QAAQ,EACR,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;YAE7E,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE;gBAC1B,qBAAqB,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,CAAC,IAAI,CACL,QAAQ,EACR,IAAI,CAAC,SAAS,EAAE,GAAG,MAAM,EACzB,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;gBACxB,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;oBACnD,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpB,SAAS,CAAC,YAAY,EAAE,CAAC;iBAC5B;gBACD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChB,SAAS,CAAC,QAAQ,EAAE,CAAC;aACxB;SACJ;aAAM;YACH,mDAAmD;YACnD,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,MAAM,CAAC;SACrC;IACL,CAAC;IAEM,mBAAmB,CAAC,GAAG,IAAwC;;;QAClE,MAAM,UAAU,GAAG,MAAA,MAAA,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,0CAAE,MAAM,mCAAI,YAAY,EAAE,CAAC;QAElE,IAAI,CAAA,MAAA,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,0CAAE,MAAM,MAAK,SAAS,EAAE;YAC5C,MAAM,YAAY,eAAG,IAAI,CAAC,YAAY,EAAC,CAAC,wCAAD,CAAC,IAAM,EAAE,MAAM,EAAE,UAAU,EAAE,CAAA,CAAC;YACrE,MAAA,YAAY,CAAC,MAAM,oCAAnB,YAAY,CAAC,MAAM,GAAK,UAAU,EAAC;SACtC;QAED,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE;YACzB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;gBACzB,qBAAqB,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,aAAa,CAAC,EAAE;oBACxD,MAAA,MAAA,IAAI,CAAC,SAAS,0CAAE,WAAW,kDAAI,CAAC;oBAChC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;oBAC5C,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;wBACnD,IAAI,CAAC,YAAY,EAAE,CAAC;qBACvB;oBACD,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAChB,MAAA,MAAA,IAAI,CAAC,SAAS,0CAAE,UAAU,kDAAI,CAAC;iBAClC;qBAAM;oBACH,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;iBACtC;aACJ;SACJ;IACL,CAAC;IAEM,kBAAkB,CAAC,GAAG,IAAwC;;;QACjE,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,GAAG,CAAC,CAAC;QACjD,MAAM,SAAS,GAAG,MAAA,MAAA,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,0CAAE,KAAK,mCAAI,YAAY,EAAE,CAAC;QAEzE,IAAI,CAAA,MAAA,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,0CAAE,KAAK,MAAK,SAAS,EAAE;YACpD,MAAM,YAAY,eAAG,IAAI,CAAC,YAAY,EAAC,UAAU,wCAAV,UAAU,IAAM,EAAE,KAAK,EAAE,SAAS,EAAE,CAAA,CAAC;YAC5E,MAAA,YAAY,CAAC,KAAK,oCAAlB,YAAY,CAAC,KAAK,GAAK,SAAS,EAAC;SACpC;QAED,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE;YACzB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;gBACzB,qBAAqB,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,aAAa,CAAC,EAAE;oBACxD,MAAA,MAAA,IAAI,CAAC,SAAS,0CAAE,WAAW,kDAAI,CAAC;oBAChC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBACxB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;oBACpD,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;wBACnD,IAAI,CAAC,YAAY,EAAE,CAAC;qBACvB;oBACD,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAChB,MAAA,MAAA,IAAI,CAAC,SAAS,0CAAE,UAAU,kDAAI,CAAC;iBAClC;qBAAM;oBACH,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;iBACtC;aACJ;SACJ;IACL,CAAC;CACJ","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { UsageError } from \"@fluidframework/container-utils\";\nimport { List, ListMakeHead, ListRemoveEntry } from \"./collections\";\nimport {\n    ISegment,\n} from \"./mergeTreeNodes\";\nimport { ICombiningOp, ReferenceType } from \"./ops\";\nimport { addProperties, PropertySet } from \"./properties\";\nimport {\n    refHasTileLabels,\n    refHasRangeLabels,\n    ReferencePosition,\n    refTypeIncludesFlag,\n} from \"./referencePositions\";\n\n/**\n * @internal\n */\nexport function _validateReferenceType(refType: ReferenceType) {\n    let exclusiveCount = 0;\n    if (refTypeIncludesFlag(refType, ReferenceType.Transient)) {\n        ++exclusiveCount;\n    }\n    if (refTypeIncludesFlag(refType, ReferenceType.SlideOnRemove)) {\n        ++exclusiveCount;\n    }\n    if (refTypeIncludesFlag(refType, ReferenceType.StayOnRemove)) {\n        ++exclusiveCount;\n    }\n    if (exclusiveCount > 1) {\n        throw new UsageError(\n            \"Reference types can only be one of Transient, SlideOnRemove, and StayOnRemove\");\n    }\n}\n\nexport interface LocalReferencePosition extends ReferencePosition {\n    callbacks?: Partial<Record<\"beforeSlide\" | \"afterSlide\", () => void>>;\n}\n\n/**\n * @privateRemarks This should not be exported outside merge tree.\n * @internal\n */\nclass LocalReference implements LocalReferencePosition {\n    public properties: PropertySet | undefined;\n\n    private segment: ISegment | undefined;\n    private offset: number = 0;\n    private listNode: List<LocalReference> | undefined;\n\n    public callbacks?: Partial<Record<\"beforeSlide\" | \"afterSlide\", () => void>> | undefined;\n\n    constructor(\n        public refType = ReferenceType.Simple,\n        properties?: PropertySet,\n    ) {\n        _validateReferenceType(refType);\n        this.properties = properties;\n    }\n\n    public link(segment: ISegment | undefined, offset: number, listNode: List<LocalReference> | undefined) {\n        if (listNode !== this.listNode\n            && this.listNode !== undefined) {\n            this.segment?.localRefs?.removeLocalRef(this);\n        }\n        this.segment = segment;\n        this.offset = offset;\n        this.listNode = listNode;\n    }\n\n    public isLeaf() {\n        return false;\n    }\n\n    public addProperties(newProps: PropertySet, op?: ICombiningOp) {\n        this.properties = addProperties(this.properties, newProps, op);\n    }\n\n    public getSegment() {\n        return this.segment;\n    }\n\n    public getOffset() {\n        return this.offset;\n    }\n\n    public getListNode() {\n        return this.listNode;\n    }\n\n    public getProperties() {\n        return this.properties;\n    }\n}\n\nexport function createDetachedLocalReferencePosition(refType?: ReferenceType): LocalReferencePosition {\n    return new LocalReference(refType, undefined);\n}\n\ninterface IRefsAtOffset {\n    before?: List<LocalReference>;\n    at?: List<LocalReference>;\n    after?: List<LocalReference>;\n}\n\nexport function assertLocalReferences(\n    lref: any,\n): asserts lref is LocalReference {\n    assert(lref instanceof LocalReference, 0x2e0 /* \"lref not a Local Reference\" */);\n}\n\n/**\n * Represents a collection of {@link LocalReferencePosition}s associated with one segment in a merge-tree.\n */\nexport class LocalReferenceCollection {\n    public static append(seg1: ISegment, seg2: ISegment) {\n        if (seg2.localRefs && !seg2.localRefs.empty) {\n            if (!seg1.localRefs) {\n                seg1.localRefs = new LocalReferenceCollection(seg1);\n            }\n            assert(seg1.localRefs.refsByOffset.length === seg1.cachedLength,\n                0x2be /* \"LocalReferences array contains a gap\" */);\n            seg1.localRefs.append(seg2.localRefs);\n        } else if (seg1.localRefs) {\n            // Since creating the LocalReferenceCollection, we may have appended\n            // segments that had no local references. Account for them now by padding the array.\n            seg1.localRefs.refsByOffset.length += seg2.cachedLength;\n        }\n    }\n\n    /**\n     * @remarks This method should only be called by mergeTree.\n     * @internal\n     */\n    public hierRefCount: number = 0;\n    private readonly refsByOffset: (IRefsAtOffset | undefined)[];\n    private refCount: number = 0;\n\n    /**\n     *\n     * @internal\n     */\n    constructor(\n        /** Segment this `LocalReferenceCollection` is associated to. */\n        private readonly segment: ISegment,\n        initialRefsByfOffset = new Array<IRefsAtOffset | undefined>(segment.cachedLength)) {\n        // Since javascript arrays are sparse the above won't populate any of the\n        // indices, but it will ensure the length property of the array matches\n        // the length of the segment.\n        this.refsByOffset = initialRefsByfOffset;\n    }\n\n    /**\n     * @remarks This method should only be called by mergeTree.\n     * @internal\n     */\n    public [Symbol.iterator]() {\n        const subiterators: IterableIterator<LocalReferencePosition>[] = [];\n        for (const refs of this.refsByOffset) {\n            if (refs) {\n                if (refs.before) {\n                    subiterators.push(refs.before[Symbol.iterator]());\n                }\n                if (refs.at) {\n                    subiterators.push(refs.at[Symbol.iterator]());\n                }\n                if (refs.after) {\n                    subiterators.push(refs.after[Symbol.iterator]());\n                }\n            }\n        }\n\n        const iterator = {\n            next(): IteratorResult<LocalReferencePosition> {\n                while (subiterators.length > 0) {\n                    const next = subiterators[0].next();\n                    if (next.done === true) {\n                        subiterators.shift();\n                    } else {\n                        return next;\n                    }\n                }\n\n                return { value: undefined, done: true };\n            },\n            [Symbol.iterator]() {\n                return this;\n            },\n        };\n        return iterator;\n    }\n\n    /**\n     * @remarks This method should only be called by mergeTree.\n     * @internal\n     */\n    public clear() {\n        this.refCount = 0;\n        this.hierRefCount = 0;\n        const detachSegments = (refs: List<LocalReference> | undefined) => {\n            if (refs) {\n                for (const r of refs) {\n                    this.removeLocalRef(r);\n                }\n            }\n        };\n        for (let i = 0; i < this.refsByOffset.length; i++) {\n            const refsAtOffset = this.refsByOffset[i];\n            if (refsAtOffset) {\n                detachSegments(refsAtOffset.before);\n                detachSegments(refsAtOffset.at);\n                detachSegments(refsAtOffset.after);\n                this.refsByOffset[i] = undefined;\n            }\n        }\n    }\n\n    /**\n     * @remarks This method should only be called by mergeTree.\n     * @internal\n     */\n    public get empty() {\n        return this.refCount === 0;\n    }\n\n    /**\n     * @remarks This method should only be called by mergeTree.\n     * @internal\n     */\n    public createLocalRef(\n        offset: number,\n        refType: ReferenceType,\n        properties: PropertySet | undefined): LocalReferencePosition {\n        const ref = new LocalReference(\n            refType,\n            properties,\n        );\n        ref.link(this.segment, offset, undefined);\n        if (!refTypeIncludesFlag(ref, ReferenceType.Transient)) {\n            this.addLocalRef(ref, offset);\n        }\n        return ref;\n    }\n\n    /**\n     * @remarks This method should only be called by mergeTree.\n     * @internal\n     */\n    public addLocalRef(lref: LocalReferencePosition, offset: number) {\n        assert(\n            !refTypeIncludesFlag(lref, ReferenceType.Transient),\n            0x2df /* \"transient references cannot be bound to segments\" */);\n        assertLocalReferences(lref);\n        assert(offset < this.segment.cachedLength, 0x348 /* offset cannot be beyond segment length */);\n        const refsAtOffset = this.refsByOffset[offset] =\n            this.refsByOffset[offset]\n            ?? { at: ListMakeHead() };\n        const atRefs = refsAtOffset.at =\n            refsAtOffset.at\n            ?? ListMakeHead();\n\n        lref.link(this.segment, offset, atRefs.enqueue(lref));\n\n        if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {\n            this.hierRefCount++;\n        }\n        this.refCount++;\n    }\n\n    /**\n     * @remarks This method should only be called by mergeTree.\n     * @internal\n     */\n    public removeLocalRef(lref: LocalReferencePosition): LocalReferencePosition | undefined {\n        if (this.has(lref)) {\n            assertLocalReferences(lref);\n            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n            ListRemoveEntry(lref.getListNode()!);\n            lref.link(\n                lref.getSegment(),\n                lref.getOffset(),\n                undefined);\n            if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {\n                this.hierRefCount--;\n            }\n            this.refCount--;\n            return lref;\n        }\n    }\n\n    /**\n     *\n     * Called by 'append()' implementations to append local refs from the given 'other' segment to the\n     * end of 'this' segment.\n     *\n     * Note: This method should be invoked after the caller has ensured that segments can be merged,\n     * but before 'this' segment's cachedLength has changed, or the adjustment to the local refs\n     * will be incorrect.\n     *\n     * @remarks This method should only be called by mergeTree.\n     * @internal\n     */\n    public append(other: LocalReferenceCollection) {\n        if (!other || other.empty) {\n            return;\n        }\n        this.hierRefCount += other.hierRefCount;\n        this.refCount += other.refCount;\n        other.hierRefCount = 0;\n        for (const lref of other) {\n            assertLocalReferences(lref);\n            lref.link(\n                this.segment,\n                lref.getOffset() + this.refsByOffset.length,\n                lref.getListNode());\n        }\n\n        this.refsByOffset.push(...other.refsByOffset);\n    }\n    /**\n     * Returns true of the local reference is in the collection, otherwise false.\n     *\n     * @remarks This method should only be called by mergeTree.\n     * @internal\n     */\n    public has(lref: ReferencePosition): boolean {\n        if (!(lref instanceof LocalReference)\n            || refTypeIncludesFlag(lref, ReferenceType.Transient)) {\n            return false;\n        }\n        const seg = lref.getSegment();\n        if (seg !== this.segment) {\n            return false;\n        }\n        // we should be able to optimize finding the\n        // list head\n        const listNode = lref.getListNode();\n        if (listNode === undefined) {\n            return false;\n        }\n        let prev = listNode;\n        let next = listNode;\n        while (prev?.isHead !== true && next?.isHead !== true) {\n            prev = prev?.prev;\n            next = next?.next;\n        }\n\n        const headNode = prev?.isHead === true ? prev : next;\n        if (headNode?.isHead !== true || headNode.empty()) {\n            return false;\n        }\n        const offset = lref.getOffset();\n        const refsAtOffset = this.refsByOffset[offset];\n        if (refsAtOffset?.before === headNode\n            || refsAtOffset?.at === headNode\n            || refsAtOffset?.after === headNode) {\n                return true;\n            }\n        return false;\n    }\n\n    /**\n     * Splits this `LocalReferenceCollection` into the intervals [0, offset) and [offset, originalLength).\n     * Local references in the former half of this split will remain associated with the segment used on construction.\n     * Local references in the latter half of this split will be transferred to `splitSeg`,\n     * and its `localRefs` field will be set.\n     * @param offset - Offset into the original segment at which the collection should be split\n     * @param splitSeg - Split segment which originally corresponded to the indices [offset, originalLength)\n     * before splitting.\n     *\n     * @remarks This method should only be called by mergeTree.\n     * @internal\n     */\n    public split(offset: number, splitSeg: ISegment) {\n        if (!this.empty) {\n            const localRefs =\n                new LocalReferenceCollection(\n                    splitSeg,\n                    this.refsByOffset.splice(offset, this.refsByOffset.length - offset));\n\n            splitSeg.localRefs = localRefs;\n            for (const lref of localRefs) {\n                assertLocalReferences(lref);\n                lref.link(\n                    splitSeg,\n                    lref.getOffset() - offset,\n                    lref.getListNode());\n                if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {\n                    this.hierRefCount--;\n                    localRefs.hierRefCount++;\n                }\n                this.refCount--;\n                localRefs.refCount++;\n            }\n        } else {\n            // shrink the offset array when empty and splitting\n            this.refsByOffset.length = offset;\n        }\n    }\n\n    public addBeforeTombstones(...refs: Iterable<LocalReferencePosition>[]) {\n        const beforeRefs = this.refsByOffset[0]?.before ?? ListMakeHead();\n\n        if (this.refsByOffset[0]?.before === undefined) {\n            const refsAtOffset = this.refsByOffset[0] ??= { before: beforeRefs };\n            refsAtOffset.before ??= beforeRefs;\n        }\n\n        for (const iterable of refs) {\n            for (const lref of iterable) {\n                assertLocalReferences(lref);\n                if (refTypeIncludesFlag(lref, ReferenceType.SlideOnRemove)) {\n                    lref.callbacks?.beforeSlide?.();\n                    beforeRefs.unshift(lref);\n                    lref.link(this.segment, 0, beforeRefs.next);\n                    if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {\n                        this.hierRefCount++;\n                    }\n                    this.refCount++;\n                    lref.callbacks?.afterSlide?.();\n                } else {\n                    lref.link(undefined, 0, undefined);\n                }\n            }\n        }\n    }\n\n    public addAfterTombstones(...refs: Iterable<LocalReferencePosition>[]) {\n        const lastOffset = this.segment.cachedLength - 1;\n        const afterRefs = this.refsByOffset[lastOffset]?.after ?? ListMakeHead();\n\n        if (this.refsByOffset[lastOffset]?.after === undefined) {\n            const refsAtOffset = this.refsByOffset[lastOffset] ??= { after: afterRefs };\n            refsAtOffset.after ??= afterRefs;\n        }\n\n        for (const iterable of refs) {\n            for (const lref of iterable) {\n                assertLocalReferences(lref);\n                if (refTypeIncludesFlag(lref, ReferenceType.SlideOnRemove)) {\n                    lref.callbacks?.beforeSlide?.();\n                    afterRefs.enqueue(lref);\n                    lref.link(this.segment, lastOffset, afterRefs.prev);\n                    if (refHasRangeLabels(lref) || refHasTileLabels(lref)) {\n                        this.hierRefCount++;\n                    }\n                    this.refCount++;\n                    lref.callbacks?.afterSlide?.();\n                } else {\n                    lref.link(undefined, 0, undefined);\n                }\n            }\n        }\n    }\n}\n"]}