@fluidframework/tree 2.116.0-416006 → 2.116.0

package/dist/feature-libraries/chunked-forest/chunkedForest.js

@@ -5,7 +5,7 @@
  */
 var _ChunkedForest_events;
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.buildChunkedForest = exports.ChunkedForest = void 0;
+exports.buildChunkedForest = exports.ChunkedForest = exports.ensureExclusiveBasicChunk = exports.locateNodeInChunks = void 0;
 const tslib_1 = require("tslib");
 const client_utils_1 = require("@fluid-internal/client-utils");
 const internal_1 = require("@fluidframework/core-utils/internal");
@@ -16,6 +16,86 @@ const chunkTree_js_1 = require("./chunkTree.js");
 function makeRoot() {
     return new basicChunk_js_1.BasicChunk(index_js_1.aboveRootPlaceholder, new Map());
 }
+/** Returns the number of top-level nodes represented by a field's chunks. */
+function getFieldLength(field) {
+    return field.reduce((length, chunk) => length + chunk.topLevelLength, 0);
+}
+/**
+ * Locates a top-level node within a field's chunk representation.
+ * @param chunks - The chunks representing the field.
+ * @param index - The node index within the field.
+ * @returns The containing chunk, its array index, and the node's offset within it.
+ */
+function locateNodeInChunks(chunks, index) {
+    (0, index_js_2.assertNonNegativeSafeInteger)(index);
+    // Remaining node offset while scanning chunks; afterward, the offset within the matched chunk.
+    let indexWithinChunk = index;
+    // Array index of the chunk currently being examined.
+    let indexOfChunk = 0;
+    while (true) {
+        const chunk = chunks[indexOfChunk] ?? (0, internal_1.oob)();
+        if (indexWithinChunk < chunk.topLevelLength) {
+            return { chunk, indexOfChunk, indexWithinChunk };
+        }
+        indexWithinChunk -= chunk.topLevelLength;
+        indexOfChunk++;
+        if (indexOfChunk === chunks.length) {
+            (0, internal_1.fail)(0xaf7 /* missing edited node */);
+        }
+    }
+}
+exports.locateNodeInChunks = locateNodeInChunks;
+/**
+ * Ensures the node at index `index` within the field represented by `chunks` is contained in a non-shared {@link BasicChunk}.
+ *
+ * @param chunks - The chunks representing the field which will be modified to ensure the node at
+ * `index` is in a non-shared {@link BasicChunk}.
+ * @param index - The node index within the field.
+ * @returns The exclusively owned {@link BasicChunk} containing the node at `index`. This chunk is part of and owned by `chunks`.
+ * @remarks
+ * This function may modify the `chunks` array to ensure the node at `index` is in a non-shared {@link BasicChunk}.
+ * This can include splitting chunks, and cloning.
+ */
+function ensureExclusiveBasicChunk(chunks, index, compressor) {
+    const { chunk, indexOfChunk, indexWithinChunk } = locateNodeInChunks(chunks, index);
+    // Normalize to a BasicChunk, splitting the chunk if needed.
+    let finalIndexOfChunk;
+    let basicChunk;
+    if (chunk instanceof basicChunk_js_1.BasicChunk) {
+        basicChunk = chunk;
+        finalIndexOfChunk = indexOfChunk;
+    }
+    else {
+        // TODO:Perf: support in place editing of other chunk formats when possible:
+        // 1. Support updating values in uniform chunks.
+        // 2. Support traversing sequence chunks.
+        //
+        // Maybe build path when visitor navigates then lazily sync to chunk tree when editing?
+        const newChunks = (0, index_js_1.mapCursorField)(chunk.cursor(), (cursor) => (0, chunkTree_js_1.basicChunkTree)(cursor, compressor));
+        // TODO: this could fail for really long chunks being split (due to argument count limits).
+        // Current implementations of chunks shouldn't ever be that long, but it could be an issue if they get bigger.
+        chunks.splice(indexOfChunk, 1, ...newChunks);
+        // We just overwrote the reference to the old chunk in the array, so drop the ref count for it.
+        chunk.referenceRemoved();
+        // Sanity check that the chunk indexing is as expected before updating it.
+        (0, internal_1.debugAssert)(() => newChunks[indexWithinChunk] === chunks[indexOfChunk + indexWithinChunk] ||
+            "bad chunk indexing");
+        basicChunk = newChunks[indexWithinChunk] ?? (0, internal_1.oob)();
+        finalIndexOfChunk = indexOfChunk + indexWithinChunk;
+    }
+    (0, internal_1.debugAssert)(() => chunks[finalIndexOfChunk] === basicChunk || "bad child index");
+    // Ensure the BasicChunk we have is exclusively owned, so we can edit it in place.
+    let exclusiveChunk;
+    if (basicChunk.isShared()) {
+        exclusiveChunk = chunks[finalIndexOfChunk] = basicChunk.clone();
+        basicChunk.referenceRemoved();
+    }
+    else {
+        exclusiveChunk = basicChunk;
+    }
+    return exclusiveChunk;
+}
+exports.ensureExclusiveBasicChunk = ensureExclusiveBasicChunk;
 /**
  * Implementation of IEditableForest based on copy on write chunks.
  *
@@ -28,25 +108,29 @@ class ChunkedForest {
      * @param chunker - Chunking policy. TODO: dispose of this when forest is disposed.
      * @param anchors - anchorSet used to track location in this forest across changes. Callers of applyDelta must ensure this is updated accordingly.
      */
-    constructor(roots, schema, chunker, anchors = new index_js_1.AnchorSet(), idCompressor) {
+    constructor(roots, schema, chunker, anchors = new index_js_1.AnchorSet(), idCompressor, breaker = new index_js_2.Breakable("ChunkedForest")) {
         this.roots = roots;
         this.schema = schema;
         this.chunker = chunker;
         this.anchors = anchors;
         this.idCompressor = idCompressor;
+        this.breaker = breaker;
         this.deltaVisitors = new Set();
         _ChunkedForest_events.set(this, (0, client_utils_1.createEmitter)());
         this.events = tslib_1.__classPrivateFieldGet(this, _ChunkedForest_events, "f");
         this.nextDetachedFieldIdentifier = 0;
     }
     get isEmpty() {
+        this.breaker.use();
         return this.roots.fields.size === 0;
     }
-    clone(schema, _breaker) {
+    clone(schema, breaker) {
+        this.breaker.use();
         this.roots.referenceAdded();
-        return new ChunkedForest(this.roots, schema, this.chunker.clone(schema));
+        return new ChunkedForest(this.roots, schema, this.chunker.clone(schema), undefined, this.idCompressor, breaker ?? this.breaker);
     }
     chunkField(cursor) {
+        this.breaker.use();
         return (0, chunkTree_js_1.chunkField)(cursor, { idCompressor: this.idCompressor, policy: this.chunker });
     }
     forgetAnchor(anchor) {
@@ -59,15 +143,29 @@ class ChunkedForest {
         this.deltaVisitors.delete(visitor);
     }
     acquireVisitor() {
+        this.breaker.use();
         (0, internal_1.assert)(this.activeVisitor === undefined, 0x76a /* Must release existing visitor before acquiring another */);
         if (this.roots.isShared()) {
             this.roots = this.roots.clone();
         }
+        // The `CombinableVisitor` which can apply deltas to this forest.
+        // Annoyingly declaring the type here or in a satisfies clause causes this code not to build,
+        // so the type is inferred.
+        //
+        // This visitor works by shallow copying (where needed) the forest as it's walked down
+        // to ensure the location being traversed (and thus possibly edited) is an exclusively owned BasicChunk.
+        // Future optimizations may improve this, but currently that is a requirement for the editing code to work.
         const forestVisitor = {
             forest: this,
-            // Current location in the tree, as a non-shared BasicChunk (TODO: support in-place modification of other chunk formats when possible).
-            // Start above root detached sequences.
+            /**
+             * Current location in the tree, as a non-shared BasicChunk (TODO: support in-place modification of other chunk formats when possible).
+             * Starts above root detached sequences.
+             */
             mutableChunkStack: [],
+            /**
+             * When at a node level, this is set to the basic chunk for the current node.
+             * When at a field level, undefined, see mutableChunkStack for the field.
+             */
             mutableChunk: this.roots,
             getParent() {
                 (0, internal_1.assert)((0, index_js_2.hasSome)(this.mutableChunkStack), 0x532 /* invalid access to root's parent */);
@@ -81,10 +179,17 @@ class ChunkedForest {
             },
             destroy(detachedField, count) {
                 tslib_1.__classPrivateFieldGet(this.forest, _ChunkedForest_events, "f").emit("beforeChange");
+                const field = this.forest.roots.fields.get(detachedField);
+                (0, internal_1.assert)(field !== undefined, 0xd1d /* Destroyed field must exist */);
+                (0, internal_1.assert)(getFieldLength(field) === count, 0xd1e /* Destroy count must match field length */);
                 this.forest.roots.fields.delete(detachedField);
+                for (const chunk of field) {
+                    chunk.referenceRemoved();
+                }
             },
             create(content, destination) {
                 tslib_1.__classPrivateFieldGet(this.forest, _ChunkedForest_events, "f").emit("beforeChange");
+                (0, internal_1.assert)(!this.forest.roots.fields.has(destination), 0xd1f /* Create destination must be a new empty field */);
                 const chunks = content.map((c) => (0, chunkTree_js_1.chunkTree)(c, {
                     policy: this.forest.chunker,
                     idCompressor: this.forest.idCompressor,
@@ -106,17 +211,18 @@ class ChunkedForest {
              */
             attachEdit(source, count, destination) {
                 tslib_1.__classPrivateFieldGet(this.forest, _ChunkedForest_events, "f").emit("beforeChange");
-                const sourceField = this.forest.roots.fields.get(source) ?? [];
-                this.forest.roots.fields.delete(source);
-                if (sourceField.length === 0) {
-                    return; // Prevent creating 0 sized fields when inserting empty into empty.
-                }
                 const parent = this.getParent();
+                (0, internal_1.assert)(parent.mutableChunk !== this.forest.roots || parent.key !== source, 0xd20 /* Attach source field must be different from current field */);
+                const sourceField = this.forest.roots.fields.get(source);
+                (0, internal_1.assert)(sourceField !== undefined, 0xd21 /* Attach source field must exist */);
+                (0, internal_1.assert)(getFieldLength(sourceField) === count, 0xd22 /* Attach must consume all nodes in source field */);
                 const destinationField = (0, index_js_2.getOrAddEmptyToMap)(parent.mutableChunk.fields, parent.key);
+                (0, internal_1.assert)(destination <= getFieldLength(destinationField), 0xd23 /* Attach destination must not exceed field length */);
                 const destinationChunkIndex = (0, chunkTree_js_1.splitFieldAtIndex)(destinationField, destination, {
                     policy: this.forest.chunker,
                     idCompressor: this.forest.idCompressor,
                 });
+                this.forest.roots.fields.delete(source);
                 // TODO: this will fail for very large moves due to argument limits.
                 destinationField.splice(destinationChunkIndex, 0, ...sourceField);
             },
@@ -136,7 +242,12 @@ class ChunkedForest {
                 tslib_1.__classPrivateFieldGet(this.forest, _ChunkedForest_events, "f").emit("beforeChange");
                 const parent = this.getParent();
                 const sourceField = parent.mutableChunk.fields.get(parent.key) ?? [];
-                (0, internal_1.assert)(source.start <= source.end, 0xcf8 /* detach range start must not exceed end */);
+                (0, internal_1.assert)(source.start <= source.end, 0xd24 /* Detach range start must not exceed end */);
+                (0, internal_1.assert)(source.end <= getFieldLength(sourceField), 0xd25 /* Detach range must not exceed field length */);
+                if (destination !== undefined) {
+                    (0, internal_1.assert)(parent.mutableChunk !== this.forest.roots || parent.key !== destination, 0xd26 /* Detach destination field must be different from current field */);
+                    (0, internal_1.assert)(!this.forest.roots.fields.has(destination), 0xd27 /* Detach destination must be a new empty field */);
+                }
                 const policy = {
                     policy: this.forest.chunker,
                     idCompressor: this.forest.idCompressor,
@@ -154,7 +265,6 @@ class ChunkedForest {
                     }
                 }
                 else {
-                    (0, internal_1.assert)(!this.forest.roots.fields.has(destination), 0x7af /* Destination must be a new empty detached field */);
                     if (newField.length > 0) {
                         this.forest.roots.fields.set(destination, newField);
                     }
@@ -165,46 +275,20 @@ class ChunkedForest {
                     parent.mutableChunk.fields.delete(parent.key);
                 }
             },
+            /**
+             * Ensure the selected node (by `index`) is an exclusively owned basic node,
+             * and store it under `this.mutableChunk`.
+             */
             enterNode(index) {
                 (0, internal_1.assert)(this.mutableChunk === undefined, 0x535 /* should be in field */);
+                // Get the mutable parent, which we might have to modify to ensure the desired child is an exclusively owned (and thus mutable) BasicChunk.
                 const parent = this.getParent();
+                // Lookup the current location of the node to be entered
                 const chunks = parent.mutableChunk.fields.get(parent.key) ?? (0, internal_1.fail)(0xaf6 /* missing edited field */);
-                let indexWithinChunk = index;
-                let indexOfChunk = 0;
-                let chunk = chunks[indexOfChunk] ?? (0, internal_1.oob)();
-                while (indexWithinChunk >= chunk.topLevelLength) {
-                    indexWithinChunk -= chunk.topLevelLength;
-                    indexOfChunk++;
-                    if (indexOfChunk === chunks.length) {
-                        (0, internal_1.fail)(0xaf7 /* missing edited node */);
-                    }
-                    chunk = chunks[indexOfChunk] ?? (0, internal_1.oob)();
-                }
-                let found = chunks[indexOfChunk] ?? (0, internal_1.oob)();
-                if (!(found instanceof basicChunk_js_1.BasicChunk)) {
-                    // TODO:Perf: support in place editing of other chunk formats when possible:
-                    // 1. Support updating values in uniform chunks.
-                    // 2. Support traversing sequence chunks.
-                    //
-                    // Maybe build path when visitor navigates then lazily sync to chunk tree when editing?
-                    const newChunks = (0, index_js_1.mapCursorField)(found.cursor(), (cursor) => (0, chunkTree_js_1.basicChunkTree)(cursor, {
-                        policy: this.forest.chunker,
-                        idCompressor: this.forest.idCompressor,
-                    }));
-                    // TODO: this could fail for really long chunks being split (due to argument count limits).
-                    // Current implementations of chunks shouldn't ever be that long, but it could be an issue if they get bigger.
-                    chunks.splice(indexOfChunk, 1, ...newChunks);
-                    found.referenceRemoved();
-                    found = newChunks[indexWithinChunk] ?? (0, internal_1.oob)();
-                }
-                (0, internal_1.assert)(found instanceof basicChunk_js_1.BasicChunk, 0x536 /* chunk should have been normalized */);
-                if (found.isShared()) {
-                    this.mutableChunk = chunks[indexOfChunk] = found.clone();
-                    found.referenceRemoved();
-                }
-                else {
-                    this.mutableChunk = found;
-                }
+                this.mutableChunk = ensureExclusiveBasicChunk(chunks, index, {
+                    policy: this.forest.chunker,
+                    idCompressor: this.forest.idCompressor,
+                });
             },
             exitNode(index) {
                 (0, internal_1.assert)(this.mutableChunk !== undefined, 0x537 /* should be in node */);
@@ -225,9 +309,12 @@ class ChunkedForest {
         for (const getVisitor of this.deltaVisitors) {
             announcedVisitors.push(getVisitor());
         }
-        const combinedVisitor = (0, index_js_1.combineVisitors)([forestVisitor, ...announcedVisitors]);
-        this.activeVisitor = combinedVisitor;
-        return combinedVisitor;
+        const visitor = (0, index_js_1.combineVisitors)([
+            (0, index_js_1.makeBreakingVisitor)(forestVisitor, this.breaker),
+            ...announcedVisitors,
+        ]);
+        this.activeVisitor = visitor;
+        return visitor;
     }
     newDetachedField() {
         const field = (0, index_js_2.brand)(String(this.nextDetachedFieldIdentifier));
@@ -236,9 +323,11 @@ class ChunkedForest {
         return field;
     }
     allocateCursor() {
+        this.breaker.use();
         return new Cursor(this, index_js_1.ITreeSubscriptionCursorState.Cleared, [], [], [], [], [], [], 0, 0, 0, undefined);
     }
     tryMoveCursorToNode(destination, cursorToMove) {
+        this.breaker.use();
         const path = this.anchors.locate(destination);
         if (path === undefined) {
             return -1 /* TreeNavigationResult.NotFound */;
@@ -247,6 +336,7 @@ class ChunkedForest {
         return 1 /* TreeNavigationResult.Ok */;
     }
     tryMoveCursorToField(destination, cursorToMove) {
+        this.breaker.use();
         (0, internal_1.assert)(cursorToMove instanceof Cursor, 0x53b /* ChunkedForest must only be given its own Cursor type */);
         if (destination.parent === undefined) {
             cursorToMove.setToDetachedSequence(destination.fieldKey);
@@ -260,6 +350,7 @@ class ChunkedForest {
         return 1 /* TreeNavigationResult.Ok */;
     }
     moveCursorToPath(destination, cursorToMove) {
+        this.breaker.use();
         (0, internal_1.assert)(cursorToMove instanceof Cursor, 0x53c /* ChunkedForest must only be given its own Cursor type */);
         (0, internal_1.assert)(cursorToMove.forest === this, 0x53d /* ChunkedForest must only be given its own Cursor */);
         const indexStack = [];
@@ -286,6 +377,7 @@ class ChunkedForest {
         }
     }
     getCursorAboveDetachedFields() {
+        this.breaker.use();
         const rootCursor = this.roots.cursor();
         rootCursor.enterNode(0);
         return rootCursor;
@@ -335,8 +427,8 @@ class Cursor extends basicChunk_js_1.BasicChunkCursor {
 /**
  * Creates an implementation of {@link IEditableForest} with no data or schema.
  */
-function buildChunkedForest(chunker, anchors, idCompressor) {
-    return new ChunkedForest(makeRoot(), chunker.schema, chunker, anchors, idCompressor);
+function buildChunkedForest(chunker, anchors, idCompressor, breaker) {
+    return new ChunkedForest(makeRoot(), chunker.schema, chunker, anchors, idCompressor, breaker);
 }
 exports.buildChunkedForest = buildChunkedForest;
 //# sourceMappingURL=chunkedForest.js.map

package/dist/feature-libraries/chunked-forest/chunkedForest.js.map

@@ -1 +1 @@
-{"version":3,"file":"chunkedForest.js","sourceRoot":"","sources":["../../../src/feature-libraries/chunked-forest/chunkedForest.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;AAEH,+DAA6D;AAE7D,kEAAwE;AAGxE,kDA0B6B;AAC7B,kDAM6B;AAE7B,mDAAmF;AACnF,iDAOwB;AAExB,SAAS,QAAQ;IAChB,OAAO,IAAI,0BAAU,CAAC,+BAAoB,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;AACxD,CAAC;AAOD;;;;GAIG;AACH,MAAa,aAAa;IAOzB;;;;;OAKG;IACH,YACQ,KAAiB,EACR,MAAoC,EACpC,OAAiB,EACjB,UAAqB,IAAI,oBAAS,EAAE,EACpC,YAA4B;QAJrC,UAAK,GAAL,KAAK,CAAY;QACR,WAAM,GAAN,MAAM,CAA8B;QACpC,YAAO,GAAP,OAAO,CAAU;QACjB,YAAO,GAAP,OAAO,CAA6B;QACpC,iBAAY,GAAZ,YAAY,CAAgB;QAf5B,kBAAa,GAAgC,IAAI,GAAG,EAAE,CAAC;QAC/D,gCAAU,IAAA,4BAAa,GAAgB,EAAC;QACjC,WAAM,GAA6B,+BAAA,IAAI,6BAAQ,CAAC;QAyOxD,gCAA2B,GAAG,CAAC,CAAC;IA3NrC,CAAC;IAEJ,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC;IACrC,CAAC;IAEM,KAAK,CAAC,MAAoC,EAAE,QAAoB;QACtE,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;QAC5B,OAAO,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1E,CAAC;IAEM,UAAU,CAAC,MAA8B;QAC/C,OAAO,IAAA,yBAAU,EAAC,MAAM,EAAE,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IACtF,CAAC;IAEM,YAAY,CAAC,MAAc;QACjC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAEM,wBAAwB,CAAC,OAA+B;QAC9D,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAEM,0BAA0B,CAAC,OAA+B;QAChE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAEM,cAAc;QACpB,IAAA,iBAAM,EACL,IAAI,CAAC,aAAa,KAAK,SAAS,EAChC,KAAK,CAAC,4DAA4D,CAClE,CAAC;QAEF,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACjC,CAAC;QAED,MAAM,aAAa,GAAG;YACrB,MAAM,EAAE,IAAI;YACZ,uIAAuI;YACvI,uCAAuC;YACvC,iBAAiB,EAAE,EAAiB;YACpC,YAAY,EAAE,IAAI,CAAC,KAA+B;YAClD,SAAS;gBACR,IAAA,iBAAM,EAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;gBACrF,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;YACxC,CAAC;YACD,IAAI;gBACH,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;gBAC9B,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;gBAClC,IAAA,iBAAM,EACL,IAAI,CAAC,MAAM,CAAC,aAAa,KAAK,SAAS,EACvC,KAAK,CAAC,0CAA0C,CAChD,CAAC;gBACF,IAAI,CAAC,MAAM,CAAC,aAAa,GAAG,SAAS,CAAC;YACvC,CAAC;YACD,OAAO,CAAC,aAAuB,EAAE,KAAa;gBAC7C,+BAAA,IAAI,CAAC,MAAM,6BAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACzC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;YAChD,CAAC;YACD,MAAM,CAAC,OAA0C,EAAE,WAAqB;gBACvE,+BAAA,IAAI,CAAC,MAAM,6BAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACzC,MAAM,MAAM,GAAgB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAC7C,IAAA,wBAAS,EAAC,CAAC,EAAE;oBACZ,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;oBAC3B,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;iBACtC,CAAC,CACF,CAAC;gBACF,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;gBAClD,+BAAA,IAAI,CAAC,MAAM,6BAAQ,CAAC,IAAI,CAAC,uBAAuB,EAAE,WAAW,CAAC,CAAC;YAChE,CAAC;YACD,MAAM,CAAC,MAAgB,EAAE,KAAa,EAAE,WAAuB;gBAC9D,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;YAC7C,CAAC;YACD,MAAM,CAAC,MAAa,EAAE,WAAqB,EAAE,EAAuB;gBACnE,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YACtC,CAAC;YACD;;;;;eAKG;YACH,UAAU,CAAC,MAAgB,EAAE,KAAa,EAAE,WAAuB;gBAClE,+BAAA,IAAI,CAAC,MAAM,6BAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACzC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC/D,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACxC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC9B,OAAO,CAAC,mEAAmE;gBAC5E,CAAC;gBAED,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAChC,MAAM,gBAAgB,GAAG,IAAA,6BAAkB,EAAC,MAAM,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;gBACpF,MAAM,qBAAqB,GAAG,IAAA,gCAAiB,EAAC,gBAAgB,EAAE,WAAW,EAAE;oBAC9E,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;oBAC3B,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;iBACtC,CAAC,CAAC;gBACH,oEAAoE;gBACpE,gBAAgB,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC,EAAE,GAAG,WAAW,CAAC,CAAC;YACnE,CAAC;YACD;;;;;;eAMG;YACH,UAAU,CAAC,MAAa,EAAE,WAAiC;gBAC1D,kIAAkI;gBAClI,iCAAiC;gBACjC,gGAAgG;gBAChG,wFAAwF;gBACxF,qGAAqG;gBAErG,+BAAA,IAAI,CAAC,MAAM,6BAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACzC,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAChC,MAAM,WAAW,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBACrE,IAAA,iBAAM,EAAC,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;gBAEvF,MAAM,MAAM,GAAoB;oBAC/B,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;oBAC3B,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;iBACtC,CAAC;gBACF,8FAA8F;gBAC9F,uFAAuF;gBACvF,wDAAwD;gBACxD,iLAAiL;gBACjL,MAAM,eAAe,GAAG,IAAA,gCAAiB,EAAC,WAAW,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC7E,MAAM,aAAa,GAAG,IAAA,gCAAiB,EAAC,WAAW,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;gBACzE,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,eAAe,EAAE,aAAa,GAAG,eAAe,CAAC,CAAC;gBAEtF,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;oBAC/B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;wBAC9B,KAAK,CAAC,gBAAgB,EAAE,CAAC;oBAC1B,CAAC;gBACF,CAAC;qBAAM,CAAC;oBACP,IAAA,iBAAM,EACL,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,EAC1C,KAAK,CAAC,oDAAoD,CAC1D,CAAC;oBACF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACzB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;oBACrD,CAAC;gBACF,CAAC;gBACD,kGAAkG;gBAClG,iDAAiD;gBACjD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC9B,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAC/C,CAAC;YACF,CAAC;YACD,SAAS,CAAC,KAAa;gBACtB,IAAA,iBAAM,EAAC,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;gBACxE,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAChC,MAAM,MAAM,GACX,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAA,eAAI,EAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;gBACtF,IAAI,gBAAgB,GAAG,KAAK,CAAC;gBAC7B,IAAI,YAAY,GAAG,CAAC,CAAC;gBACrB,IAAI,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,IAAA,cAAG,GAAE,CAAC;gBAC1C,OAAO,gBAAgB,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;oBACjD,gBAAgB,IAAI,KAAK,CAAC,cAAc,CAAC;oBACzC,YAAY,EAAE,CAAC;oBACf,IAAI,YAAY,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;wBACpC,IAAA,eAAI,EAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC;oBACvC,CAAC;oBACD,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,IAAA,cAAG,GAAE,CAAC;gBACvC,CAAC;gBACD,IAAI,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,IAAA,cAAG,GAAE,CAAC;gBAC1C,IAAI,CAAC,CAAC,KAAK,YAAY,0BAAU,CAAC,EAAE,CAAC;oBACpC,4EAA4E;oBAC5E,gDAAgD;oBAChD,yCAAyC;oBACzC,EAAE;oBACF,uFAAuF;oBACvF,MAAM,SAAS,GAAG,IAAA,yBAAc,EAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAC3D,IAAA,6BAAc,EAAC,MAAM,EAAE;wBACtB,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;wBAC3B,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;qBACtC,CAAC,CACF,CAAC;oBACF,2FAA2F;oBAC3F,8GAA8G;oBAC9G,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC;oBAC7C,KAAK,CAAC,gBAAgB,EAAE,CAAC;oBAEzB,KAAK,GAAG,SAAS,CAAC,gBAAgB,CAAC,IAAI,IAAA,cAAG,GAAE,CAAC;gBAC9C,CAAC;gBACD,IAAA,iBAAM,EAAC,KAAK,YAAY,0BAAU,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;gBACnF,IAAI,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC;oBACtB,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;oBACzD,KAAK,CAAC,gBAAgB,EAAE,CAAC;gBAC1B,CAAC;qBAAM,CAAC;oBACP,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;gBAC3B,CAAC;YACF,CAAC;YACD,QAAQ,CAAC,KAAa;gBACrB,IAAA,iBAAM,EAAC,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,KAAK,CAAC,uBAAuB,CAAC,CAAC;gBACvE,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;YAC/B,CAAC;YACD,UAAU,CAAC,GAAa;gBACvB,IAAA,iBAAM,EAAC,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,KAAK,CAAC,uBAAuB,CAAC,CAAC;gBACvE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;gBACtE,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;YAC/B,CAAC;YACD,SAAS,CAAC,GAAa;gBACtB,MAAM,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,IAAI,IAAA,eAAI,EAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC;gBACpF,IAAA,iBAAM,EAAC,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;gBACxE,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,YAAY,CAAC;YACtC,CAAC;SACD,CAAC;QAEF,MAAM,iBAAiB,GAAuB,EAAE,CAAC;QACjD,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YAC7C,iBAAiB,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,eAAe,GAAG,IAAA,0BAAe,EAAC,CAAC,aAAa,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC;QAC/E,IAAI,CAAC,aAAa,GAAG,eAAe,CAAC;QACrC,OAAO,eAAe,CAAC;IACxB,CAAC;IAGM,gBAAgB;QACtB,MAAM,KAAK,GAAkB,IAAA,gBAAK,EAAC,MAAM,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC,CAAC;QAC7E,IAAA,iBAAM,EACL,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAA,6BAAkB,EAAC,KAAK,CAAC,CAAC,EACjD,KAAK,CAAC,sCAAsC,CAC5C,CAAC;QACF,IAAI,CAAC,2BAA2B,IAAI,CAAC,CAAC;QACtC,OAAO,KAAK,CAAC;IACd,CAAC;IAEM,cAAc;QACpB,OAAO,IAAI,MAAM,CAChB,IAAI,EACJ,uCAA4B,CAAC,OAAO,EACpC,EAAE,EACF,EAAE,EACF,EAAE,EACF,EAAE,EACF,EAAE,EACF,EAAE,EACF,CAAC,EACD,CAAC,EACD,CAAC,EACD,SAAS,CACT,CAAC;IACH,CAAC;IAEM,mBAAmB,CACzB,WAAmB,EACnB,YAAqC;QAErC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAC9C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxB,8CAAqC;QACtC,CAAC;QACD,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QAC1C,uCAA+B;IAChC,CAAC;IAEM,oBAAoB,CAC1B,WAAwB,EACxB,YAAqC;QAErC,IAAA,iBAAM,EACL,YAAY,YAAY,MAAM,EAC9B,KAAK,CAAC,0DAA0D,CAChE,CAAC;QACF,IAAI,WAAW,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACtC,YAAY,CAAC,qBAAqB,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YACzD,uCAA+B;QAChC,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QAC1E,IAAI,MAAM,oCAA4B,EAAE,CAAC;YACxC,OAAO,MAAM,CAAC;QACf,CAAC;QAED,YAAY,CAAC,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC9C,uCAA+B;IAChC,CAAC;IAEM,gBAAgB,CAAC,WAAmB,EAAE,YAAqC;QACjF,IAAA,iBAAM,EACL,YAAY,YAAY,MAAM,EAC9B,KAAK,CAAC,0DAA0D,CAChE,CAAC;QACF,IAAA,iBAAM,EACL,YAAY,CAAC,MAAM,KAAK,IAAI,EAC5B,KAAK,CAAC,qDAAqD,CAC3D,CAAC;QAEF,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAe,EAAE,CAAC;QAEhC,IAAI,IAAI,GAAuB,WAAW,CAAC;QAC3C,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;YAC3B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAClC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAChC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACpB,CAAC;QACD,YAAY,CAAC,KAAK,EAAE,CAAC;QACrB,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,oEAAoE;YACpE,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAG,CAAC;YAC5B,IAAI,YAAY,CAAC,KAAK,KAAK,uCAA4B,CAAC,OAAO,EAAE,CAAC;gBACjE,YAAY,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;gBACxC,YAAY,CAAC,KAAK,GAAG,uCAA4B,CAAC,OAAO,CAAC;YAC3D,CAAC;iBAAM,CAAC;gBACP,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YAC9B,CAAC;YAED,oEAAoE;YACpE,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,EAAG,CAAC,CAAC;QAC3C,CAAC;IACF,CAAC;IAEM,4BAA4B;QAClC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACvC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,OAAO,UAAU,CAAC;IACnB,CAAC;CACD;AAnVD,sCAmVC;;AAED,MAAM,MAAO,SAAQ,gCAAgB;IACpC,YACiB,MAAqB,EAC9B,KAAmC,EAC1C,IAA0B,EAC1B,YAA6B,EAC7B,UAAoB,EACpB,iBAA2B,EAC3B,qBAA+B,EAC/B,QAAuB,EACvB,KAAa,EACb,YAAoB,EACpB,gBAAwB,EACxB,YAAuC;QAEvC,KAAK,CACJ,IAAI,EACJ,YAAY,EACZ,UAAU,EACV,iBAAiB,EACjB,qBAAqB,EACrB,QAAQ,EACR,KAAK,EACL,YAAY,EACZ,gBAAgB,EAChB,YAAY,CACZ,CAAC;QAxBc,WAAM,GAAN,MAAM,CAAe;QAC9B,UAAK,GAAL,KAAK,CAA8B;IAwB3C,CAAC;IAEM,qBAAqB,CAAC,GAAa;QACzC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAiB,CAAC;QACtE,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;QAClC,IAAI,CAAC,qBAAqB,CAAC,MAAM,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;IAC/B,CAAC;IAEe,IAAI;QACnB,mFAAmF;QACnF,0FAA0F;QAC1F,OAAO,IAAI,MAAM,CAChB,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,IAAI,EACT,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,EACtB,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,EACpB,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAC3B,CAAC,GAAG,IAAI,CAAC,qBAAqB,CAAC,EAC/B,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,YAAY,EACjB,IAAI,CAAC,gBAAgB,EACrB,IAAI,CAAC,YAAY,EAAE,IAAI,EAAE,CACzB,CAAC;IACH,CAAC;IAEM,gBAAgB;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACjC,MAAM,MAAM,GACX,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChF,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;IACjD,CAAC;IAEM,IAAI;QACV,IAAI,CAAC,KAAK,GAAG,uCAA4B,CAAC,KAAK,CAAC;IACjD,CAAC;IAEM,WAAW;QACjB,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAClD,CAAC;IAEM,KAAK;QACX,IAAI,CAAC,KAAK,GAAG,uCAA4B,CAAC,OAAO,CAAC;QAClD,IAAI,CAAC,qBAAqB,CAAC,uBAAY,CAAC,CAAC;IAC1C,CAAC;CACD;AAED;;GAEG;AACH,SAAgB,kBAAkB,CACjC,OAAiB,EACjB,OAAmB,EACnB,YAA4B;IAE5B,OAAO,IAAI,aAAa,CAAC,QAAQ,EAAE,EAAE,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC;AACtF,CAAC;AAND,gDAMC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { createEmitter } from \"@fluid-internal/client-utils\";\nimport type { Listenable } from \"@fluidframework/core-interfaces\";\nimport { assert, oob, fail } from \"@fluidframework/core-utils/internal\";\nimport type { IIdCompressor } from \"@fluidframework/id-compressor\";\n\nimport {\n\ttype Anchor,\n\tAnchorSet,\n\ttype AnnouncedVisitor,\n\ttype DeltaVisitor,\n\ttype DetachedField,\n\ttype FieldAnchor,\n\ttype FieldKey,\n\ttype ForestEvents,\n\ttype IEditableForest,\n\ttype ITreeCursorSynchronous,\n\ttype ITreeSubscriptionCursor,\n\tITreeSubscriptionCursorState,\n\ttype PlaceIndex,\n\ttype Range,\n\tTreeNavigationResult,\n\ttype TreeStoredSchemaSubscription,\n\ttype UpPath,\n\taboveRootPlaceholder,\n\tcombineVisitors,\n\tdetachedFieldAsKey,\n\tmapCursorField,\n\trootFieldKey,\n\ttype ChunkedCursor,\n\ttype TreeChunk,\n\ttype DeltaDetachedNodeId,\n} from \"../../core/index.js\";\nimport {\n\tbrand,\n\tgetLast,\n\tgetOrAddEmptyToMap,\n\thasSome,\n\ttype Breakable,\n} from \"../../util/index.js\";\n\nimport { BasicChunk, BasicChunkCursor, type SiblingsOrKey } from \"./basicChunk.js\";\nimport {\n\ttype ChunkCompressor,\n\ttype IChunker,\n\tbasicChunkTree,\n\tchunkField,\n\tchunkTree,\n\tsplitFieldAtIndex,\n} from \"./chunkTree.js\";\n\nfunction makeRoot(): BasicChunk {\n\treturn new BasicChunk(aboveRootPlaceholder, new Map());\n}\n\ninterface StackNode {\n\tmutableChunk: BasicChunk;\n\tkey: FieldKey;\n}\n\n/**\n * Implementation of IEditableForest based on copy on write chunks.\n *\n * This implementation focuses on performance.\n */\nexport class ChunkedForest implements IEditableForest {\n\tprivate activeVisitor?: DeltaVisitor;\n\n\tprivate readonly deltaVisitors: Set<() => AnnouncedVisitor> = new Set();\n\treadonly #events = createEmitter<ForestEvents>();\n\tpublic readonly events: Listenable<ForestEvents> = this.#events;\n\n\t/**\n\t * @param roots - dummy node above the root under which detached fields are stored. All content of the forest is reachable from this.\n\t * @param schema - schema which all content in this forest is assumed to comply with.\n\t * @param chunker - Chunking policy. TODO: dispose of this when forest is disposed.\n\t * @param anchors - anchorSet used to track location in this forest across changes. Callers of applyDelta must ensure this is updated accordingly.\n\t */\n\tpublic constructor(\n\t\tpublic roots: BasicChunk,\n\t\tpublic readonly schema: TreeStoredSchemaSubscription,\n\t\tpublic readonly chunker: IChunker,\n\t\tpublic readonly anchors: AnchorSet = new AnchorSet(),\n\t\tpublic readonly idCompressor?: IIdCompressor,\n\t) {}\n\n\tpublic get isEmpty(): boolean {\n\t\treturn this.roots.fields.size === 0;\n\t}\n\n\tpublic clone(schema: TreeStoredSchemaSubscription, _breaker?: Breakable): ChunkedForest {\n\t\tthis.roots.referenceAdded();\n\t\treturn new ChunkedForest(this.roots, schema, this.chunker.clone(schema));\n\t}\n\n\tpublic chunkField(cursor: ITreeCursorSynchronous): TreeChunk[] {\n\t\treturn chunkField(cursor, { idCompressor: this.idCompressor, policy: this.chunker });\n\t}\n\n\tpublic forgetAnchor(anchor: Anchor): void {\n\t\tthis.anchors.forget(anchor);\n\t}\n\n\tpublic registerAnnouncedVisitor(visitor: () => AnnouncedVisitor): void {\n\t\tthis.deltaVisitors.add(visitor);\n\t}\n\n\tpublic deregisterAnnouncedVisitor(visitor: () => AnnouncedVisitor): void {\n\t\tthis.deltaVisitors.delete(visitor);\n\t}\n\n\tpublic acquireVisitor(): DeltaVisitor {\n\t\tassert(\n\t\t\tthis.activeVisitor === undefined,\n\t\t\t0x76a /* Must release existing visitor before acquiring another */,\n\t\t);\n\n\t\tif (this.roots.isShared()) {\n\t\t\tthis.roots = this.roots.clone();\n\t\t}\n\n\t\tconst forestVisitor = {\n\t\t\tforest: this,\n\t\t\t// Current location in the tree, as a non-shared BasicChunk (TODO: support in-place modification of other chunk formats when possible).\n\t\t\t// Start above root detached sequences.\n\t\t\tmutableChunkStack: [] as StackNode[],\n\t\t\tmutableChunk: this.roots as BasicChunk | undefined,\n\t\t\tgetParent(): StackNode {\n\t\t\t\tassert(hasSome(this.mutableChunkStack), 0x532 /* invalid access to root's parent */);\n\t\t\t\treturn getLast(this.mutableChunkStack);\n\t\t\t},\n\t\t\tfree(): void {\n\t\t\t\tthis.mutableChunk = undefined;\n\t\t\t\tthis.mutableChunkStack.length = 0;\n\t\t\t\tassert(\n\t\t\t\t\tthis.forest.activeVisitor !== undefined,\n\t\t\t\t\t0x76b /* Multiple free calls for same visitor */,\n\t\t\t\t);\n\t\t\t\tthis.forest.activeVisitor = undefined;\n\t\t\t},\n\t\t\tdestroy(detachedField: FieldKey, count: number): void {\n\t\t\t\tthis.forest.#events.emit(\"beforeChange\");\n\t\t\t\tthis.forest.roots.fields.delete(detachedField);\n\t\t\t},\n\t\t\tcreate(content: readonly ITreeCursorSynchronous[], destination: FieldKey): void {\n\t\t\t\tthis.forest.#events.emit(\"beforeChange\");\n\t\t\t\tconst chunks: TreeChunk[] = content.map((c) =>\n\t\t\t\t\tchunkTree(c, {\n\t\t\t\t\t\tpolicy: this.forest.chunker,\n\t\t\t\t\t\tidCompressor: this.forest.idCompressor,\n\t\t\t\t\t}),\n\t\t\t\t);\n\t\t\t\tthis.forest.roots.fields.set(destination, chunks);\n\t\t\t\tthis.forest.#events.emit(\"afterRootFieldCreated\", destination);\n\t\t\t},\n\t\t\tattach(source: FieldKey, count: number, destination: PlaceIndex): void {\n\t\t\t\tthis.attachEdit(source, count, destination);\n\t\t\t},\n\t\t\tdetach(source: Range, destination: FieldKey, id: DeltaDetachedNodeId): void {\n\t\t\t\tthis.detachEdit(source, destination);\n\t\t\t},\n\t\t\t/**\n\t\t\t * Attaches the range into the current field by transferring it from the given source path.\n\t\t\t * Does not invalidate dependents.\n\t\t\t * @param source - The the range to be attached.\n\t\t\t * @param destination - The index in the current field at which to attach the content.\n\t\t\t */\n\t\t\tattachEdit(source: FieldKey, count: number, destination: PlaceIndex): void {\n\t\t\t\tthis.forest.#events.emit(\"beforeChange\");\n\t\t\t\tconst sourceField = this.forest.roots.fields.get(source) ?? [];\n\t\t\t\tthis.forest.roots.fields.delete(source);\n\t\t\t\tif (sourceField.length === 0) {\n\t\t\t\t\treturn; // Prevent creating 0 sized fields when inserting empty into empty.\n\t\t\t\t}\n\n\t\t\t\tconst parent = this.getParent();\n\t\t\t\tconst destinationField = getOrAddEmptyToMap(parent.mutableChunk.fields, parent.key);\n\t\t\t\tconst destinationChunkIndex = splitFieldAtIndex(destinationField, destination, {\n\t\t\t\t\tpolicy: this.forest.chunker,\n\t\t\t\t\tidCompressor: this.forest.idCompressor,\n\t\t\t\t});\n\t\t\t\t// TODO: this will fail for very large moves due to argument limits.\n\t\t\t\tdestinationField.splice(destinationChunkIndex, 0, ...sourceField);\n\t\t\t},\n\t\t\t/**\n\t\t\t * Detaches the range from the current field and transfers it to the given destination if any.\n\t\t\t * Does not invalidate dependents.\n\t\t\t * @param source - The bounds of the range to be detached from the current field.\n\t\t\t * @param destination - If specified, the destination to transfer the detached range to.\n\t\t\t * If not specified, the detached range is destroyed.\n\t\t\t */\n\t\t\tdetachEdit(source: Range, destination: FieldKey | undefined): void {\n\t\t\t\t// TODO: optimize this to perform in-place replace in uniform chunks when attach edits bring the chunk back to its original shape.\n\t\t\t\t// This should result in 3 cases:\n\t\t\t\t// 1. In-place update of uniform chunk. No allocations, no ref count changes, no new TreeChunks.\n\t\t\t\t// 2. Uniform chunk is shared: copy it (and parent path as needed), and update the copy.\n\t\t\t\t// 3. Fallback to detach then attach (Which will copy parents and convert to basic chunks as needed).\n\n\t\t\t\tthis.forest.#events.emit(\"beforeChange\");\n\t\t\t\tconst parent = this.getParent();\n\t\t\t\tconst sourceField = parent.mutableChunk.fields.get(parent.key) ?? [];\n\t\t\t\tassert(source.start <= source.end, 0xcf8 /* detach range start must not exceed end */);\n\n\t\t\t\tconst policy: ChunkCompressor = {\n\t\t\t\t\tpolicy: this.forest.chunker,\n\t\t\t\t\tidCompressor: this.forest.idCompressor,\n\t\t\t\t};\n\t\t\t\t// Split start first: splitting end later only expands chunks at positions >= startChunkIndex,\n\t\t\t\t// which leaves startChunkIndex valid. The reverse order would shift endChunkIndex when\n\t\t\t\t// source.start and source.end land in different chunks.\n\t\t\t\t// Performance: It's practical to have a variant of splitFieldAtIndex which can split at multiple locations in a single pass if the performance of this becomes worth optimizing.\n\t\t\t\tconst startChunkIndex = splitFieldAtIndex(sourceField, source.start, policy);\n\t\t\t\tconst endChunkIndex = splitFieldAtIndex(sourceField, source.end, policy);\n\t\t\t\tconst newField = sourceField.splice(startChunkIndex, endChunkIndex - startChunkIndex);\n\n\t\t\t\tif (destination === undefined) {\n\t\t\t\t\tfor (const child of newField) {\n\t\t\t\t\t\tchild.referenceRemoved();\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tassert(\n\t\t\t\t\t\t!this.forest.roots.fields.has(destination),\n\t\t\t\t\t\t0x7af /* Destination must be a new empty detached field */,\n\t\t\t\t\t);\n\t\t\t\t\tif (newField.length > 0) {\n\t\t\t\t\t\tthis.forest.roots.fields.set(destination, newField);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// This check is performed after the transfer to ensure that the field is not removed in scenarios\n\t\t\t\t// where the source and destination are the same.\n\t\t\t\tif (sourceField.length === 0) {\n\t\t\t\t\tparent.mutableChunk.fields.delete(parent.key);\n\t\t\t\t}\n\t\t\t},\n\t\t\tenterNode(index: number): void {\n\t\t\t\tassert(this.mutableChunk === undefined, 0x535 /* should be in field */);\n\t\t\t\tconst parent = this.getParent();\n\t\t\t\tconst chunks =\n\t\t\t\t\tparent.mutableChunk.fields.get(parent.key) ?? fail(0xaf6 /* missing edited field */);\n\t\t\t\tlet indexWithinChunk = index;\n\t\t\t\tlet indexOfChunk = 0;\n\t\t\t\tlet chunk = chunks[indexOfChunk] ?? oob();\n\t\t\t\twhile (indexWithinChunk >= chunk.topLevelLength) {\n\t\t\t\t\tindexWithinChunk -= chunk.topLevelLength;\n\t\t\t\t\tindexOfChunk++;\n\t\t\t\t\tif (indexOfChunk === chunks.length) {\n\t\t\t\t\t\tfail(0xaf7 /* missing edited node */);\n\t\t\t\t\t}\n\t\t\t\t\tchunk = chunks[indexOfChunk] ?? oob();\n\t\t\t\t}\n\t\t\t\tlet found = chunks[indexOfChunk] ?? oob();\n\t\t\t\tif (!(found instanceof BasicChunk)) {\n\t\t\t\t\t// TODO:Perf: support in place editing of other chunk formats when possible:\n\t\t\t\t\t// 1. Support updating values in uniform chunks.\n\t\t\t\t\t// 2. Support traversing sequence chunks.\n\t\t\t\t\t//\n\t\t\t\t\t// Maybe build path when visitor navigates then lazily sync to chunk tree when editing?\n\t\t\t\t\tconst newChunks = mapCursorField(found.cursor(), (cursor) =>\n\t\t\t\t\t\tbasicChunkTree(cursor, {\n\t\t\t\t\t\t\tpolicy: this.forest.chunker,\n\t\t\t\t\t\t\tidCompressor: this.forest.idCompressor,\n\t\t\t\t\t\t}),\n\t\t\t\t\t);\n\t\t\t\t\t// TODO: this could fail for really long chunks being split (due to argument count limits).\n\t\t\t\t\t// Current implementations of chunks shouldn't ever be that long, but it could be an issue if they get bigger.\n\t\t\t\t\tchunks.splice(indexOfChunk, 1, ...newChunks);\n\t\t\t\t\tfound.referenceRemoved();\n\n\t\t\t\t\tfound = newChunks[indexWithinChunk] ?? oob();\n\t\t\t\t}\n\t\t\t\tassert(found instanceof BasicChunk, 0x536 /* chunk should have been normalized */);\n\t\t\t\tif (found.isShared()) {\n\t\t\t\t\tthis.mutableChunk = chunks[indexOfChunk] = found.clone();\n\t\t\t\t\tfound.referenceRemoved();\n\t\t\t\t} else {\n\t\t\t\t\tthis.mutableChunk = found;\n\t\t\t\t}\n\t\t\t},\n\t\t\texitNode(index: number): void {\n\t\t\t\tassert(this.mutableChunk !== undefined, 0x537 /* should be in node */);\n\t\t\t\tthis.mutableChunk = undefined;\n\t\t\t},\n\t\t\tenterField(key: FieldKey): void {\n\t\t\t\tassert(this.mutableChunk !== undefined, 0x538 /* should be in node */);\n\t\t\t\tthis.mutableChunkStack.push({ key, mutableChunk: this.mutableChunk });\n\t\t\t\tthis.mutableChunk = undefined;\n\t\t\t},\n\t\t\texitField(key: FieldKey): void {\n\t\t\t\tconst top = this.mutableChunkStack.pop() ?? fail(0xaf8 /* should not be at root */);\n\t\t\t\tassert(this.mutableChunk === undefined, 0x539 /* should be in field */);\n\t\t\t\tthis.mutableChunk = top.mutableChunk;\n\t\t\t},\n\t\t};\n\n\t\tconst announcedVisitors: AnnouncedVisitor[] = [];\n\t\tfor (const getVisitor of this.deltaVisitors) {\n\t\t\tannouncedVisitors.push(getVisitor());\n\t\t}\n\t\tconst combinedVisitor = combineVisitors([forestVisitor, ...announcedVisitors]);\n\t\tthis.activeVisitor = combinedVisitor;\n\t\treturn combinedVisitor;\n\t}\n\n\tprivate nextDetachedFieldIdentifier = 0;\n\tpublic newDetachedField(): DetachedField {\n\t\tconst field: DetachedField = brand(String(this.nextDetachedFieldIdentifier));\n\t\tassert(\n\t\t\t!this.roots.fields.has(detachedFieldAsKey(field)),\n\t\t\t0x53a /* new field must not already exist */,\n\t\t);\n\t\tthis.nextDetachedFieldIdentifier += 1;\n\t\treturn field;\n\t}\n\n\tpublic allocateCursor(): Cursor {\n\t\treturn new Cursor(\n\t\t\tthis,\n\t\t\tITreeSubscriptionCursorState.Cleared,\n\t\t\t[],\n\t\t\t[],\n\t\t\t[],\n\t\t\t[],\n\t\t\t[],\n\t\t\t[],\n\t\t\t0,\n\t\t\t0,\n\t\t\t0,\n\t\t\tundefined,\n\t\t);\n\t}\n\n\tpublic tryMoveCursorToNode(\n\t\tdestination: Anchor,\n\t\tcursorToMove: ITreeSubscriptionCursor,\n\t): TreeNavigationResult {\n\t\tconst path = this.anchors.locate(destination);\n\t\tif (path === undefined) {\n\t\t\treturn TreeNavigationResult.NotFound;\n\t\t}\n\t\tthis.moveCursorToPath(path, cursorToMove);\n\t\treturn TreeNavigationResult.Ok;\n\t}\n\n\tpublic tryMoveCursorToField(\n\t\tdestination: FieldAnchor,\n\t\tcursorToMove: ITreeSubscriptionCursor,\n\t): TreeNavigationResult {\n\t\tassert(\n\t\t\tcursorToMove instanceof Cursor,\n\t\t\t0x53b /* ChunkedForest must only be given its own Cursor type */,\n\t\t);\n\t\tif (destination.parent === undefined) {\n\t\t\tcursorToMove.setToDetachedSequence(destination.fieldKey);\n\t\t\treturn TreeNavigationResult.Ok;\n\t\t}\n\t\tconst result = this.tryMoveCursorToNode(destination.parent, cursorToMove);\n\t\tif (result !== TreeNavigationResult.Ok) {\n\t\t\treturn result;\n\t\t}\n\n\t\tcursorToMove.enterField(destination.fieldKey);\n\t\treturn TreeNavigationResult.Ok;\n\t}\n\n\tpublic moveCursorToPath(destination: UpPath, cursorToMove: ITreeSubscriptionCursor): void {\n\t\tassert(\n\t\t\tcursorToMove instanceof Cursor,\n\t\t\t0x53c /* ChunkedForest must only be given its own Cursor type */,\n\t\t);\n\t\tassert(\n\t\t\tcursorToMove.forest === this,\n\t\t\t0x53d /* ChunkedForest must only be given its own Cursor */,\n\t\t);\n\n\t\tconst indexStack: number[] = [];\n\t\tconst keyStack: FieldKey[] = [];\n\n\t\tlet path: UpPath | undefined = destination;\n\t\twhile (path !== undefined) {\n\t\t\tindexStack.push(path.parentIndex);\n\t\t\tkeyStack.push(path.parentField);\n\t\t\tpath = path.parent;\n\t\t}\n\t\tcursorToMove.clear();\n\t\twhile (keyStack.length > 0) {\n\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\tconst key = keyStack.pop()!;\n\t\t\tif (cursorToMove.state === ITreeSubscriptionCursorState.Cleared) {\n\t\t\t\tcursorToMove.setToDetachedSequence(key);\n\t\t\t\tcursorToMove.state = ITreeSubscriptionCursorState.Current;\n\t\t\t} else {\n\t\t\t\tcursorToMove.enterField(key);\n\t\t\t}\n\n\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\tcursorToMove.enterNode(indexStack.pop()!);\n\t\t}\n\t}\n\n\tpublic getCursorAboveDetachedFields(): ITreeCursorSynchronous {\n\t\tconst rootCursor = this.roots.cursor();\n\t\trootCursor.enterNode(0);\n\t\treturn rootCursor;\n\t}\n}\n\nclass Cursor extends BasicChunkCursor implements ITreeSubscriptionCursor {\n\tpublic constructor(\n\t\tpublic readonly forest: ChunkedForest,\n\t\tpublic state: ITreeSubscriptionCursorState,\n\t\troot: readonly TreeChunk[],\n\t\tsiblingStack: SiblingsOrKey[],\n\t\tindexStack: number[],\n\t\tindexOfChunkStack: number[],\n\t\tindexWithinChunkStack: number[],\n\t\tsiblings: SiblingsOrKey,\n\t\tindex: number,\n\t\tindexOfChunk: number,\n\t\tindexWithinChunk: number,\n\t\tnestedCursor: ChunkedCursor | undefined,\n\t) {\n\t\tsuper(\n\t\t\troot,\n\t\t\tsiblingStack,\n\t\t\tindexStack,\n\t\t\tindexOfChunkStack,\n\t\t\tindexWithinChunkStack,\n\t\t\tsiblings,\n\t\t\tindex,\n\t\t\tindexOfChunk,\n\t\t\tindexWithinChunk,\n\t\t\tnestedCursor,\n\t\t);\n\t}\n\n\tpublic setToDetachedSequence(key: FieldKey): void {\n\t\tthis.root = (this.forest.roots.fields.get(key) ?? []) as BasicChunk[];\n\t\tthis.siblingStack.length = 0;\n\t\tthis.indexStack.length = 0;\n\t\tthis.indexOfChunkStack.length = 0;\n\t\tthis.indexWithinChunkStack.length = 0;\n\t\tthis.siblings = [key];\n\t\tthis.index = 0;\n\t\tthis.indexOfChunk = 0;\n\t\tthis.indexWithinChunk = 0;\n\t\tthis.nestedCursor = undefined;\n\t}\n\n\tpublic override fork(): Cursor {\n\t\t// Siblings arrays are not modified during navigation and do not need be be copied.\n\t\t// This allows this copy to be shallow, and `this.siblings` below to not be copied as all.\n\t\treturn new Cursor(\n\t\t\tthis.forest,\n\t\t\tthis.state,\n\t\t\tthis.root,\n\t\t\t[...this.siblingStack],\n\t\t\t[...this.indexStack],\n\t\t\t[...this.indexOfChunkStack],\n\t\t\t[...this.indexWithinChunkStack],\n\t\t\tthis.siblings,\n\t\t\tthis.index,\n\t\t\tthis.indexOfChunk,\n\t\t\tthis.indexWithinChunk,\n\t\t\tthis.nestedCursor?.fork(),\n\t\t);\n\t}\n\n\tpublic buildFieldAnchor(): FieldAnchor {\n\t\tconst path = this.getFieldPath();\n\t\tconst anchor =\n\t\t\tpath.parent === undefined ? undefined : this.forest.anchors.track(path.parent);\n\t\treturn { parent: anchor, fieldKey: path.field };\n\t}\n\n\tpublic free(): void {\n\t\tthis.state = ITreeSubscriptionCursorState.Freed;\n\t}\n\n\tpublic buildAnchor(): Anchor {\n\t\treturn this.forest.anchors.track(this.getPath());\n\t}\n\n\tpublic clear(): void {\n\t\tthis.state = ITreeSubscriptionCursorState.Cleared;\n\t\tthis.setToDetachedSequence(rootFieldKey);\n\t}\n}\n\n/**\n * Creates an implementation of {@link IEditableForest} with no data or schema.\n */\nexport function buildChunkedForest(\n\tchunker: IChunker,\n\tanchors?: AnchorSet,\n\tidCompressor?: IIdCompressor,\n): ChunkedForest {\n\treturn new ChunkedForest(makeRoot(), chunker.schema, chunker, anchors, idCompressor);\n}\n"]}
+{"version":3,"file":"chunkedForest.js","sourceRoot":"","sources":["../../../src/feature-libraries/chunked-forest/chunkedForest.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;AAEH,+DAA6D;AAE7D,kEAAqF;AAGrF,kDA2B6B;AAC7B,kDAQ6B;AAE7B,mDAAmF;AACnF,iDAOwB;AAExB,SAAS,QAAQ;IAChB,OAAO,IAAI,0BAAU,CAAC,+BAAoB,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;AACxD,CAAC;AAED,6EAA6E;AAC7E,SAAS,cAAc,CAAC,KAA2B;IAClD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;AAC1E,CAAC;AAED;;;;;GAKG;AACH,SAAgB,kBAAkB,CACjC,MAA4B,EAC5B,KAAa;IAEb,IAAA,uCAA4B,EAAC,KAAK,CAAC,CAAC;IACpC,+FAA+F;IAC/F,IAAI,gBAAgB,GAAG,KAAK,CAAC;IAC7B,qDAAqD;IACrD,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,OAAO,IAAI,EAAE,CAAC;QACb,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,IAAA,cAAG,GAAE,CAAC;QAC5C,IAAI,gBAAgB,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;YAC7C,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,gBAAgB,EAAE,CAAC;QAClD,CAAC;QACD,gBAAgB,IAAI,KAAK,CAAC,cAAc,CAAC;QACzC,YAAY,EAAE,CAAC;QACf,IAAI,YAAY,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;YACpC,IAAA,eAAI,EAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC;QACvC,CAAC;IACF,CAAC;AACF,CAAC;AApBD,gDAoBC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,yBAAyB,CACxC,MAAmB,EACnB,KAAa,EACb,UAA2B;IAE3B,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,gBAAgB,EAAE,GAAG,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAEpF,4DAA4D;IAC5D,IAAI,iBAAyB,CAAC;IAC9B,IAAI,UAAsB,CAAC;IAC3B,IAAI,KAAK,YAAY,0BAAU,EAAE,CAAC;QACjC,UAAU,GAAG,KAAK,CAAC;QACnB,iBAAiB,GAAG,YAAY,CAAC;IAClC,CAAC;SAAM,CAAC;QACP,4EAA4E;QAC5E,gDAAgD;QAChD,yCAAyC;QACzC,EAAE;QACF,uFAAuF;QACvF,MAAM,SAAS,GAAG,IAAA,yBAAc,EAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAC3D,IAAA,6BAAc,EAAC,MAAM,EAAE,UAAU,CAAC,CAClC,CAAC;QACF,2FAA2F;QAC3F,8GAA8G;QAC9G,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC;QAC7C,+FAA+F;QAC/F,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAEzB,0EAA0E;QAC1E,IAAA,sBAAW,EACV,GAAG,EAAE,CACJ,SAAS,CAAC,gBAAgB,CAAC,KAAK,MAAM,CAAC,YAAY,GAAG,gBAAgB,CAAC;YACvE,oBAAoB,CACrB,CAAC;QACF,UAAU,GAAG,SAAS,CAAC,gBAAgB,CAAC,IAAI,IAAA,cAAG,GAAE,CAAC;QAClD,iBAAiB,GAAG,YAAY,GAAG,gBAAgB,CAAC;IACrD,CAAC;IAED,IAAA,sBAAW,EAAC,GAAG,EAAE,CAAC,MAAM,CAAC,iBAAiB,CAAC,KAAK,UAAU,IAAI,iBAAiB,CAAC,CAAC;IAEjF,kFAAkF;IAClF,IAAI,cAA0B,CAAC;IAC/B,IAAI,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC;QAC3B,cAAc,GAAG,MAAM,CAAC,iBAAiB,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;QAChE,UAAU,CAAC,gBAAgB,EAAE,CAAC;IAC/B,CAAC;SAAM,CAAC;QACP,cAAc,GAAG,UAAU,CAAC;IAC7B,CAAC;IACD,OAAO,cAAc,CAAC;AACvB,CAAC;AAjDD,8DAiDC;AAgBD;;;;GAIG;AACH,MAAa,aAAa;IAOzB;;;;;OAKG;IACH,YACQ,KAAiB,EACR,MAAoC,EACpC,OAAiB,EACjB,UAAqB,IAAI,oBAAS,EAAE,EACpC,YAA4B,EAC5B,UAAqB,IAAI,oBAAS,CAAC,eAAe,CAAC;QAL5D,UAAK,GAAL,KAAK,CAAY;QACR,WAAM,GAAN,MAAM,CAA8B;QACpC,YAAO,GAAP,OAAO,CAAU;QACjB,YAAO,GAAP,OAAO,CAA6B;QACpC,iBAAY,GAAZ,YAAY,CAAgB;QAC5B,YAAO,GAAP,OAAO,CAA4C;QAhBnD,kBAAa,GAAgC,IAAI,GAAG,EAAE,CAAC;QAC/D,gCAAU,IAAA,4BAAa,GAAgB,EAAC;QACjC,WAAM,GAA6B,+BAAA,IAAI,6BAAQ,CAAC;QA4QxD,gCAA2B,GAAG,CAAC,CAAC;IA7PrC,CAAC;IAEJ,IAAW,OAAO;QACjB,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC;IACrC,CAAC;IAEM,KAAK,CAAC,MAAoC,EAAE,OAAmB;QACrE,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;QAC5B,OAAO,IAAI,aAAa,CACvB,IAAI,CAAC,KAAK,EACV,MAAM,EACN,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,EAC1B,SAAS,EACT,IAAI,CAAC,YAAY,EACjB,OAAO,IAAI,IAAI,CAAC,OAAO,CACvB,CAAC;IACH,CAAC;IAEM,UAAU,CAAC,MAA8B;QAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACnB,OAAO,IAAA,yBAAU,EAAC,MAAM,EAAE,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IACtF,CAAC;IAEM,YAAY,CAAC,MAAc;QACjC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAEM,wBAAwB,CAAC,OAA+B;QAC9D,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAEM,0BAA0B,CAAC,OAA+B;QAChE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAEM,cAAc;QACpB,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACnB,IAAA,iBAAM,EACL,IAAI,CAAC,aAAa,KAAK,SAAS,EAChC,KAAK,CAAC,4DAA4D,CAClE,CAAC;QAEF,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACjC,CAAC;QAED,iEAAiE;QACjE,6FAA6F;QAC7F,2BAA2B;QAC3B,EAAE;QACF,sFAAsF;QACtF,wGAAwG;QACxG,2GAA2G;QAC3G,MAAM,aAAa,GAAG;YACrB,MAAM,EAAE,IAAI;YACZ;;;eAGG;YACH,iBAAiB,EAAE,EAAiB;YACpC;;;eAGG;YACH,YAAY,EAAE,IAAI,CAAC,KAA+B;YAClD,SAAS;gBACR,IAAA,iBAAM,EAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;gBACrF,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;YACxC,CAAC;YACD,IAAI;gBACH,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;gBAC9B,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;gBAClC,IAAA,iBAAM,EACL,IAAI,CAAC,MAAM,CAAC,aAAa,KAAK,SAAS,EACvC,KAAK,CAAC,0CAA0C,CAChD,CAAC;gBACF,IAAI,CAAC,MAAM,CAAC,aAAa,GAAG,SAAS,CAAC;YACvC,CAAC;YACD,OAAO,CAAC,aAAuB,EAAE,KAAa;gBAC7C,+BAAA,IAAI,CAAC,MAAM,6BAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACzC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBAC1D,IAAA,iBAAM,EAAC,KAAK,KAAK,SAAS,EAAE,KAAK,CAAC,gCAAgC,CAAC,CAAC;gBACpE,IAAA,iBAAM,EACL,cAAc,CAAC,KAAK,CAAC,KAAK,KAAK,EAC/B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;gBAC/C,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;oBAC3B,KAAK,CAAC,gBAAgB,EAAE,CAAC;gBAC1B,CAAC;YACF,CAAC;YACD,MAAM,CAAC,OAA0C,EAAE,WAAqB;gBACvE,+BAAA,IAAI,CAAC,MAAM,6BAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACzC,IAAA,iBAAM,EACL,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,EAC1C,KAAK,CAAC,kDAAkD,CACxD,CAAC;gBACF,MAAM,MAAM,GAAgB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAC7C,IAAA,wBAAS,EAAC,CAAC,EAAE;oBACZ,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;oBAC3B,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;iBACtC,CAAC,CACF,CAAC;gBACF,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;gBAClD,+BAAA,IAAI,CAAC,MAAM,6BAAQ,CAAC,IAAI,CAAC,uBAAuB,EAAE,WAAW,CAAC,CAAC;YAChE,CAAC;YACD,MAAM,CAAC,MAAgB,EAAE,KAAa,EAAE,WAAuB;gBAC9D,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;YAC7C,CAAC;YACD,MAAM,CAAC,MAAa,EAAE,WAAqB,EAAE,EAAuB;gBACnE,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YACtC,CAAC;YACD;;;;;eAKG;YACH,UAAU,CAAC,MAAgB,EAAE,KAAa,EAAE,WAAuB;gBAClE,+BAAA,IAAI,CAAC,MAAM,6BAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACzC,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAChC,IAAA,iBAAM,EACL,MAAM,CAAC,YAAY,KAAK,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,GAAG,KAAK,MAAM,EAClE,KAAK,CAAC,8DAA8D,CACpE,CAAC;gBACF,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACzD,IAAA,iBAAM,EAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;gBAC9E,IAAA,iBAAM,EACL,cAAc,CAAC,WAAW,CAAC,KAAK,KAAK,EACrC,KAAK,CAAC,mDAAmD,CACzD,CAAC;gBACF,MAAM,gBAAgB,GAAG,IAAA,6BAAkB,EAAC,MAAM,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;gBACpF,IAAA,iBAAM,EACL,WAAW,IAAI,cAAc,CAAC,gBAAgB,CAAC,EAC/C,KAAK,CAAC,qDAAqD,CAC3D,CAAC;gBACF,MAAM,qBAAqB,GAAG,IAAA,gCAAiB,EAAC,gBAAgB,EAAE,WAAW,EAAE;oBAC9E,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;oBAC3B,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;iBACtC,CAAC,CAAC;gBACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACxC,oEAAoE;gBACpE,gBAAgB,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC,EAAE,GAAG,WAAW,CAAC,CAAC;YACnE,CAAC;YACD;;;;;;eAMG;YACH,UAAU,CAAC,MAAa,EAAE,WAAiC;gBAC1D,kIAAkI;gBAClI,iCAAiC;gBACjC,gGAAgG;gBAChG,wFAAwF;gBACxF,qGAAqG;gBAErG,+BAAA,IAAI,CAAC,MAAM,6BAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACzC,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAChC,MAAM,WAAW,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBACrE,IAAA,iBAAM,EAAC,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;gBACvF,IAAA,iBAAM,EACL,MAAM,CAAC,GAAG,IAAI,cAAc,CAAC,WAAW,CAAC,EACzC,KAAK,CAAC,+CAA+C,CACrD,CAAC;gBACF,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;oBAC/B,IAAA,iBAAM,EACL,MAAM,CAAC,YAAY,KAAK,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,GAAG,KAAK,WAAW,EACvE,KAAK,CAAC,mEAAmE,CACzE,CAAC;oBACF,IAAA,iBAAM,EACL,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,EAC1C,KAAK,CAAC,kDAAkD,CACxD,CAAC;gBACH,CAAC;gBAED,MAAM,MAAM,GAAoB;oBAC/B,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;oBAC3B,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;iBACtC,CAAC;gBACF,8FAA8F;gBAC9F,uFAAuF;gBACvF,wDAAwD;gBACxD,iLAAiL;gBACjL,MAAM,eAAe,GAAG,IAAA,gCAAiB,EAAC,WAAW,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC7E,MAAM,aAAa,GAAG,IAAA,gCAAiB,EAAC,WAAW,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;gBACzE,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,eAAe,EAAE,aAAa,GAAG,eAAe,CAAC,CAAC;gBAEtF,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;oBAC/B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;wBAC9B,KAAK,CAAC,gBAAgB,EAAE,CAAC;oBAC1B,CAAC;gBACF,CAAC;qBAAM,CAAC;oBACP,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACzB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;oBACrD,CAAC;gBACF,CAAC;gBACD,kGAAkG;gBAClG,iDAAiD;gBACjD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC9B,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAC/C,CAAC;YACF,CAAC;YACD;;;eAGG;YACH,SAAS,CAAC,KAAa;gBACtB,IAAA,iBAAM,EAAC,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;gBAExE,2IAA2I;gBAC3I,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAEhC,wDAAwD;gBACxD,MAAM,MAAM,GACX,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAA,eAAI,EAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;gBAEtF,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,MAAM,EAAE,KAAK,EAAE;oBAC5D,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;oBAC3B,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;iBACtC,CAAC,CAAC;YACJ,CAAC;YACD,QAAQ,CAAC,KAAa;gBACrB,IAAA,iBAAM,EAAC,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,KAAK,CAAC,uBAAuB,CAAC,CAAC;gBACvE,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;YAC/B,CAAC;YACD,UAAU,CAAC,GAAa;gBACvB,IAAA,iBAAM,EAAC,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,KAAK,CAAC,uBAAuB,CAAC,CAAC;gBACvE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;gBACtE,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;YAC/B,CAAC;YACD,SAAS,CAAC,GAAa;gBACtB,MAAM,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,IAAI,IAAA,eAAI,EAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC;gBACpF,IAAA,iBAAM,EAAC,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;gBACxE,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,YAAY,CAAC;YACtC,CAAC;SACD,CAAC;QAEF,MAAM,iBAAiB,GAAuB,EAAE,CAAC;QACjD,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YAC7C,iBAAiB,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,OAAO,GAAG,IAAA,0BAAe,EAAC;YAC/B,IAAA,8BAAmB,EAAC,aAAa,EAAE,IAAI,CAAC,OAAO,CAAC;YAChD,GAAG,iBAAiB;SACpB,CAAC,CAAC;QACH,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;QAC7B,OAAO,OAAO,CAAC;IAChB,CAAC;IAGM,gBAAgB;QACtB,MAAM,KAAK,GAAkB,IAAA,gBAAK,EAAC,MAAM,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC,CAAC;QAC7E,IAAA,iBAAM,EACL,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAA,6BAAkB,EAAC,KAAK,CAAC,CAAC,EACjD,KAAK,CAAC,sCAAsC,CAC5C,CAAC;QACF,IAAI,CAAC,2BAA2B,IAAI,CAAC,CAAC;QACtC,OAAO,KAAK,CAAC;IACd,CAAC;IAEM,cAAc;QACpB,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACnB,OAAO,IAAI,MAAM,CAChB,IAAI,EACJ,uCAA4B,CAAC,OAAO,EACpC,EAAE,EACF,EAAE,EACF,EAAE,EACF,EAAE,EACF,EAAE,EACF,EAAE,EACF,CAAC,EACD,CAAC,EACD,CAAC,EACD,SAAS,CACT,CAAC;IACH,CAAC;IAEM,mBAAmB,CACzB,WAAmB,EACnB,YAAqC;QAErC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAC9C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxB,8CAAqC;QACtC,CAAC;QACD,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QAC1C,uCAA+B;IAChC,CAAC;IAEM,oBAAoB,CAC1B,WAAwB,EACxB,YAAqC;QAErC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACnB,IAAA,iBAAM,EACL,YAAY,YAAY,MAAM,EAC9B,KAAK,CAAC,0DAA0D,CAChE,CAAC;QACF,IAAI,WAAW,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACtC,YAAY,CAAC,qBAAqB,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YACzD,uCAA+B;QAChC,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QAC1E,IAAI,MAAM,oCAA4B,EAAE,CAAC;YACxC,OAAO,MAAM,CAAC;QACf,CAAC;QAED,YAAY,CAAC,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC9C,uCAA+B;IAChC,CAAC;IAEM,gBAAgB,CAAC,WAAmB,EAAE,YAAqC;QACjF,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACnB,IAAA,iBAAM,EACL,YAAY,YAAY,MAAM,EAC9B,KAAK,CAAC,0DAA0D,CAChE,CAAC;QACF,IAAA,iBAAM,EACL,YAAY,CAAC,MAAM,KAAK,IAAI,EAC5B,KAAK,CAAC,qDAAqD,CAC3D,CAAC;QAEF,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAe,EAAE,CAAC;QAEhC,IAAI,IAAI,GAAuB,WAAW,CAAC;QAC3C,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;YAC3B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAClC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAChC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACpB,CAAC;QACD,YAAY,CAAC,KAAK,EAAE,CAAC;QACrB,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,oEAAoE;YACpE,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAG,CAAC;YAC5B,IAAI,YAAY,CAAC,KAAK,KAAK,uCAA4B,CAAC,OAAO,EAAE,CAAC;gBACjE,YAAY,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;gBACxC,YAAY,CAAC,KAAK,GAAG,uCAA4B,CAAC,OAAO,CAAC;YAC3D,CAAC;iBAAM,CAAC;gBACP,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YAC9B,CAAC;YAED,oEAAoE;YACpE,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,EAAG,CAAC,CAAC;QAC3C,CAAC;IACF,CAAC;IAEM,4BAA4B;QAClC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACnB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACvC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,OAAO,UAAU,CAAC;IACnB,CAAC;CACD;AA3XD,sCA2XC;;AAED,MAAM,MAAO,SAAQ,gCAAgB;IACpC,YACiB,MAAqB,EAC9B,KAAmC,EAC1C,IAA0B,EAC1B,YAA6B,EAC7B,UAAoB,EACpB,iBAA2B,EAC3B,qBAA+B,EAC/B,QAAuB,EACvB,KAAa,EACb,YAAoB,EACpB,gBAAwB,EACxB,YAAuC;QAEvC,KAAK,CACJ,IAAI,EACJ,YAAY,EACZ,UAAU,EACV,iBAAiB,EACjB,qBAAqB,EACrB,QAAQ,EACR,KAAK,EACL,YAAY,EACZ,gBAAgB,EAChB,YAAY,CACZ,CAAC;QAxBc,WAAM,GAAN,MAAM,CAAe;QAC9B,UAAK,GAAL,KAAK,CAA8B;IAwB3C,CAAC;IAEM,qBAAqB,CAAC,GAAa;QACzC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAiB,CAAC;QACtE,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;QAClC,IAAI,CAAC,qBAAqB,CAAC,MAAM,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;IAC/B,CAAC;IAEe,IAAI;QACnB,mFAAmF;QACnF,0FAA0F;QAC1F,OAAO,IAAI,MAAM,CAChB,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,IAAI,EACT,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,EACtB,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,EACpB,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAC3B,CAAC,GAAG,IAAI,CAAC,qBAAqB,CAAC,EAC/B,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,YAAY,EACjB,IAAI,CAAC,gBAAgB,EACrB,IAAI,CAAC,YAAY,EAAE,IAAI,EAAE,CACzB,CAAC;IACH,CAAC;IAEM,gBAAgB;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACjC,MAAM,MAAM,GACX,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChF,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;IACjD,CAAC;IAEM,IAAI;QACV,IAAI,CAAC,KAAK,GAAG,uCAA4B,CAAC,KAAK,CAAC;IACjD,CAAC;IAEM,WAAW;QACjB,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAClD,CAAC;IAEM,KAAK;QACX,IAAI,CAAC,KAAK,GAAG,uCAA4B,CAAC,OAAO,CAAC;QAClD,IAAI,CAAC,qBAAqB,CAAC,uBAAY,CAAC,CAAC;IAC1C,CAAC;CACD;AAED;;GAEG;AACH,SAAgB,kBAAkB,CACjC,OAAiB,EACjB,OAAmB,EACnB,YAA4B,EAC5B,OAAmB;IAEnB,OAAO,IAAI,aAAa,CACvB,QAAQ,EAAE,EACV,OAAO,CAAC,MAAM,EACd,OAAO,EACP,OAAO,EACP,YAAY,EACZ,OAAO,CACP,CAAC;AACH,CAAC;AAdD,gDAcC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { createEmitter } from \"@fluid-internal/client-utils\";\nimport type { Listenable } from \"@fluidframework/core-interfaces\";\nimport { assert, oob, fail, debugAssert } from \"@fluidframework/core-utils/internal\";\nimport type { IIdCompressor } from \"@fluidframework/id-compressor\";\n\nimport {\n\ttype Anchor,\n\tAnchorSet,\n\ttype AnnouncedVisitor,\n\ttype DeltaVisitor,\n\ttype DetachedField,\n\ttype FieldAnchor,\n\ttype FieldKey,\n\ttype ForestEvents,\n\ttype IEditableForest,\n\ttype ITreeCursorSynchronous,\n\ttype ITreeSubscriptionCursor,\n\tITreeSubscriptionCursorState,\n\ttype PlaceIndex,\n\ttype Range,\n\tTreeNavigationResult,\n\ttype TreeStoredSchemaSubscription,\n\ttype UpPath,\n\taboveRootPlaceholder,\n\tcombineVisitors,\n\tdetachedFieldAsKey,\n\tmakeBreakingVisitor,\n\tmapCursorField,\n\trootFieldKey,\n\ttype ChunkedCursor,\n\ttype TreeChunk,\n\ttype DeltaDetachedNodeId,\n} from \"../../core/index.js\";\nimport {\n\tassertNonNegativeSafeInteger,\n\tbrand,\n\tgetLast,\n\tgetOrAddEmptyToMap,\n\thasSome,\n\tBreakable,\n\ttype WithBreakable,\n} from \"../../util/index.js\";\n\nimport { BasicChunk, BasicChunkCursor, type SiblingsOrKey } from \"./basicChunk.js\";\nimport {\n\ttype ChunkCompressor,\n\ttype IChunker,\n\tbasicChunkTree,\n\tchunkField,\n\tchunkTree,\n\tsplitFieldAtIndex,\n} from \"./chunkTree.js\";\n\nfunction makeRoot(): BasicChunk {\n\treturn new BasicChunk(aboveRootPlaceholder, new Map());\n}\n\n/** Returns the number of top-level nodes represented by a field's chunks. */\nfunction getFieldLength(field: readonly TreeChunk[]): number {\n\treturn field.reduce((length, chunk) => length + chunk.topLevelLength, 0);\n}\n\n/**\n * Locates a top-level node within a field's chunk representation.\n * @param chunks - The chunks representing the field.\n * @param index - The node index within the field.\n * @returns The containing chunk, its array index, and the node's offset within it.\n */\nexport function locateNodeInChunks(\n\tchunks: readonly TreeChunk[],\n\tindex: number,\n): { chunk: TreeChunk; indexOfChunk: number; indexWithinChunk: number } {\n\tassertNonNegativeSafeInteger(index);\n\t// Remaining node offset while scanning chunks; afterward, the offset within the matched chunk.\n\tlet indexWithinChunk = index;\n\t// Array index of the chunk currently being examined.\n\tlet indexOfChunk = 0;\n\twhile (true) {\n\t\tconst chunk = chunks[indexOfChunk] ?? oob();\n\t\tif (indexWithinChunk < chunk.topLevelLength) {\n\t\t\treturn { chunk, indexOfChunk, indexWithinChunk };\n\t\t}\n\t\tindexWithinChunk -= chunk.topLevelLength;\n\t\tindexOfChunk++;\n\t\tif (indexOfChunk === chunks.length) {\n\t\t\tfail(0xaf7 /* missing edited node */);\n\t\t}\n\t}\n}\n\n/**\n * Ensures the node at index `index` within the field represented by `chunks` is contained in a non-shared {@link BasicChunk}.\n *\n * @param chunks - The chunks representing the field which will be modified to ensure the node at\n * `index` is in a non-shared {@link BasicChunk}.\n * @param index - The node index within the field.\n * @returns The exclusively owned {@link BasicChunk} containing the node at `index`. This chunk is part of and owned by `chunks`.\n * @remarks\n * This function may modify the `chunks` array to ensure the node at `index` is in a non-shared {@link BasicChunk}.\n * This can include splitting chunks, and cloning.\n */\nexport function ensureExclusiveBasicChunk(\n\tchunks: TreeChunk[],\n\tindex: number,\n\tcompressor: ChunkCompressor,\n): BasicChunk {\n\tconst { chunk, indexOfChunk, indexWithinChunk } = locateNodeInChunks(chunks, index);\n\n\t// Normalize to a BasicChunk, splitting the chunk if needed.\n\tlet finalIndexOfChunk: number;\n\tlet basicChunk: BasicChunk;\n\tif (chunk instanceof BasicChunk) {\n\t\tbasicChunk = chunk;\n\t\tfinalIndexOfChunk = indexOfChunk;\n\t} else {\n\t\t// TODO:Perf: support in place editing of other chunk formats when possible:\n\t\t// 1. Support updating values in uniform chunks.\n\t\t// 2. Support traversing sequence chunks.\n\t\t//\n\t\t// Maybe build path when visitor navigates then lazily sync to chunk tree when editing?\n\t\tconst newChunks = mapCursorField(chunk.cursor(), (cursor) =>\n\t\t\tbasicChunkTree(cursor, compressor),\n\t\t);\n\t\t// TODO: this could fail for really long chunks being split (due to argument count limits).\n\t\t// Current implementations of chunks shouldn't ever be that long, but it could be an issue if they get bigger.\n\t\tchunks.splice(indexOfChunk, 1, ...newChunks);\n\t\t// We just overwrote the reference to the old chunk in the array, so drop the ref count for it.\n\t\tchunk.referenceRemoved();\n\n\t\t// Sanity check that the chunk indexing is as expected before updating it.\n\t\tdebugAssert(\n\t\t\t() =>\n\t\t\t\tnewChunks[indexWithinChunk] === chunks[indexOfChunk + indexWithinChunk] ||\n\t\t\t\t\"bad chunk indexing\",\n\t\t);\n\t\tbasicChunk = newChunks[indexWithinChunk] ?? oob();\n\t\tfinalIndexOfChunk = indexOfChunk + indexWithinChunk;\n\t}\n\n\tdebugAssert(() => chunks[finalIndexOfChunk] === basicChunk || \"bad child index\");\n\n\t// Ensure the BasicChunk we have is exclusively owned, so we can edit it in place.\n\tlet exclusiveChunk: BasicChunk;\n\tif (basicChunk.isShared()) {\n\t\texclusiveChunk = chunks[finalIndexOfChunk] = basicChunk.clone();\n\t\tbasicChunk.referenceRemoved();\n\t} else {\n\t\texclusiveChunk = basicChunk;\n\t}\n\treturn exclusiveChunk;\n}\n\n/**\n * Layer in the stack of basic chunks from traversing down the tree.\n */\ninterface StackNode {\n\t/**\n\t * The parent node.\n\t */\n\tmutableChunk: BasicChunk;\n\t/**\n\t * A key under {@link mutableChunk} into which this stack traverses.\n\t */\n\tkey: FieldKey;\n}\n\n/**\n * Implementation of IEditableForest based on copy on write chunks.\n *\n * This implementation focuses on performance.\n */\nexport class ChunkedForest implements IEditableForest, WithBreakable {\n\tprivate activeVisitor?: DeltaVisitor;\n\n\tprivate readonly deltaVisitors: Set<() => AnnouncedVisitor> = new Set();\n\treadonly #events = createEmitter<ForestEvents>();\n\tpublic readonly events: Listenable<ForestEvents> = this.#events;\n\n\t/**\n\t * @param roots - dummy node above the root under which detached fields are stored. All content of the forest is reachable from this.\n\t * @param schema - schema which all content in this forest is assumed to comply with.\n\t * @param chunker - Chunking policy. TODO: dispose of this when forest is disposed.\n\t * @param anchors - anchorSet used to track location in this forest across changes. Callers of applyDelta must ensure this is updated accordingly.\n\t */\n\tpublic constructor(\n\t\tpublic roots: BasicChunk,\n\t\tpublic readonly schema: TreeStoredSchemaSubscription,\n\t\tpublic readonly chunker: IChunker,\n\t\tpublic readonly anchors: AnchorSet = new AnchorSet(),\n\t\tpublic readonly idCompressor?: IIdCompressor,\n\t\tpublic readonly breaker: Breakable = new Breakable(\"ChunkedForest\"),\n\t) {}\n\n\tpublic get isEmpty(): boolean {\n\t\tthis.breaker.use();\n\t\treturn this.roots.fields.size === 0;\n\t}\n\n\tpublic clone(schema: TreeStoredSchemaSubscription, breaker?: Breakable): ChunkedForest {\n\t\tthis.breaker.use();\n\t\tthis.roots.referenceAdded();\n\t\treturn new ChunkedForest(\n\t\t\tthis.roots,\n\t\t\tschema,\n\t\t\tthis.chunker.clone(schema),\n\t\t\tundefined,\n\t\t\tthis.idCompressor,\n\t\t\tbreaker ?? this.breaker,\n\t\t);\n\t}\n\n\tpublic chunkField(cursor: ITreeCursorSynchronous): TreeChunk[] {\n\t\tthis.breaker.use();\n\t\treturn chunkField(cursor, { idCompressor: this.idCompressor, policy: this.chunker });\n\t}\n\n\tpublic forgetAnchor(anchor: Anchor): void {\n\t\tthis.anchors.forget(anchor);\n\t}\n\n\tpublic registerAnnouncedVisitor(visitor: () => AnnouncedVisitor): void {\n\t\tthis.deltaVisitors.add(visitor);\n\t}\n\n\tpublic deregisterAnnouncedVisitor(visitor: () => AnnouncedVisitor): void {\n\t\tthis.deltaVisitors.delete(visitor);\n\t}\n\n\tpublic acquireVisitor(): DeltaVisitor {\n\t\tthis.breaker.use();\n\t\tassert(\n\t\t\tthis.activeVisitor === undefined,\n\t\t\t0x76a /* Must release existing visitor before acquiring another */,\n\t\t);\n\n\t\tif (this.roots.isShared()) {\n\t\t\tthis.roots = this.roots.clone();\n\t\t}\n\n\t\t// The `CombinableVisitor` which can apply deltas to this forest.\n\t\t// Annoyingly declaring the type here or in a satisfies clause causes this code not to build,\n\t\t// so the type is inferred.\n\t\t//\n\t\t// This visitor works by shallow copying (where needed) the forest as it's walked down\n\t\t// to ensure the location being traversed (and thus possibly edited) is an exclusively owned BasicChunk.\n\t\t// Future optimizations may improve this, but currently that is a requirement for the editing code to work.\n\t\tconst forestVisitor = {\n\t\t\tforest: this,\n\t\t\t/**\n\t\t\t * Current location in the tree, as a non-shared BasicChunk (TODO: support in-place modification of other chunk formats when possible).\n\t\t\t * Starts above root detached sequences.\n\t\t\t */\n\t\t\tmutableChunkStack: [] as StackNode[],\n\t\t\t/**\n\t\t\t * When at a node level, this is set to the basic chunk for the current node.\n\t\t\t * When at a field level, undefined, see mutableChunkStack for the field.\n\t\t\t */\n\t\t\tmutableChunk: this.roots as BasicChunk | undefined,\n\t\t\tgetParent(): StackNode {\n\t\t\t\tassert(hasSome(this.mutableChunkStack), 0x532 /* invalid access to root's parent */);\n\t\t\t\treturn getLast(this.mutableChunkStack);\n\t\t\t},\n\t\t\tfree(): void {\n\t\t\t\tthis.mutableChunk = undefined;\n\t\t\t\tthis.mutableChunkStack.length = 0;\n\t\t\t\tassert(\n\t\t\t\t\tthis.forest.activeVisitor !== undefined,\n\t\t\t\t\t0x76b /* Multiple free calls for same visitor */,\n\t\t\t\t);\n\t\t\t\tthis.forest.activeVisitor = undefined;\n\t\t\t},\n\t\t\tdestroy(detachedField: FieldKey, count: number): void {\n\t\t\t\tthis.forest.#events.emit(\"beforeChange\");\n\t\t\t\tconst field = this.forest.roots.fields.get(detachedField);\n\t\t\t\tassert(field !== undefined, 0xd1d /* Destroyed field must exist */);\n\t\t\t\tassert(\n\t\t\t\t\tgetFieldLength(field) === count,\n\t\t\t\t\t0xd1e /* Destroy count must match field length */,\n\t\t\t\t);\n\t\t\t\tthis.forest.roots.fields.delete(detachedField);\n\t\t\t\tfor (const chunk of field) {\n\t\t\t\t\tchunk.referenceRemoved();\n\t\t\t\t}\n\t\t\t},\n\t\t\tcreate(content: readonly ITreeCursorSynchronous[], destination: FieldKey): void {\n\t\t\t\tthis.forest.#events.emit(\"beforeChange\");\n\t\t\t\tassert(\n\t\t\t\t\t!this.forest.roots.fields.has(destination),\n\t\t\t\t\t0xd1f /* Create destination must be a new empty field */,\n\t\t\t\t);\n\t\t\t\tconst chunks: TreeChunk[] = content.map((c) =>\n\t\t\t\t\tchunkTree(c, {\n\t\t\t\t\t\tpolicy: this.forest.chunker,\n\t\t\t\t\t\tidCompressor: this.forest.idCompressor,\n\t\t\t\t\t}),\n\t\t\t\t);\n\t\t\t\tthis.forest.roots.fields.set(destination, chunks);\n\t\t\t\tthis.forest.#events.emit(\"afterRootFieldCreated\", destination);\n\t\t\t},\n\t\t\tattach(source: FieldKey, count: number, destination: PlaceIndex): void {\n\t\t\t\tthis.attachEdit(source, count, destination);\n\t\t\t},\n\t\t\tdetach(source: Range, destination: FieldKey, id: DeltaDetachedNodeId): void {\n\t\t\t\tthis.detachEdit(source, destination);\n\t\t\t},\n\t\t\t/**\n\t\t\t * Attaches the range into the current field by transferring it from the given source path.\n\t\t\t * Does not invalidate dependents.\n\t\t\t * @param source - The the range to be attached.\n\t\t\t * @param destination - The index in the current field at which to attach the content.\n\t\t\t */\n\t\t\tattachEdit(source: FieldKey, count: number, destination: PlaceIndex): void {\n\t\t\t\tthis.forest.#events.emit(\"beforeChange\");\n\t\t\t\tconst parent = this.getParent();\n\t\t\t\tassert(\n\t\t\t\t\tparent.mutableChunk !== this.forest.roots || parent.key !== source,\n\t\t\t\t\t0xd20 /* Attach source field must be different from current field */,\n\t\t\t\t);\n\t\t\t\tconst sourceField = this.forest.roots.fields.get(source);\n\t\t\t\tassert(sourceField !== undefined, 0xd21 /* Attach source field must exist */);\n\t\t\t\tassert(\n\t\t\t\t\tgetFieldLength(sourceField) === count,\n\t\t\t\t\t0xd22 /* Attach must consume all nodes in source field */,\n\t\t\t\t);\n\t\t\t\tconst destinationField = getOrAddEmptyToMap(parent.mutableChunk.fields, parent.key);\n\t\t\t\tassert(\n\t\t\t\t\tdestination <= getFieldLength(destinationField),\n\t\t\t\t\t0xd23 /* Attach destination must not exceed field length */,\n\t\t\t\t);\n\t\t\t\tconst destinationChunkIndex = splitFieldAtIndex(destinationField, destination, {\n\t\t\t\t\tpolicy: this.forest.chunker,\n\t\t\t\t\tidCompressor: this.forest.idCompressor,\n\t\t\t\t});\n\t\t\t\tthis.forest.roots.fields.delete(source);\n\t\t\t\t// TODO: this will fail for very large moves due to argument limits.\n\t\t\t\tdestinationField.splice(destinationChunkIndex, 0, ...sourceField);\n\t\t\t},\n\t\t\t/**\n\t\t\t * Detaches the range from the current field and transfers it to the given destination if any.\n\t\t\t * Does not invalidate dependents.\n\t\t\t * @param source - The bounds of the range to be detached from the current field.\n\t\t\t * @param destination - If specified, the destination to transfer the detached range to.\n\t\t\t * If not specified, the detached range is destroyed.\n\t\t\t */\n\t\t\tdetachEdit(source: Range, destination: FieldKey | undefined): void {\n\t\t\t\t// TODO: optimize this to perform in-place replace in uniform chunks when attach edits bring the chunk back to its original shape.\n\t\t\t\t// This should result in 3 cases:\n\t\t\t\t// 1. In-place update of uniform chunk. No allocations, no ref count changes, no new TreeChunks.\n\t\t\t\t// 2. Uniform chunk is shared: copy it (and parent path as needed), and update the copy.\n\t\t\t\t// 3. Fallback to detach then attach (Which will copy parents and convert to basic chunks as needed).\n\n\t\t\t\tthis.forest.#events.emit(\"beforeChange\");\n\t\t\t\tconst parent = this.getParent();\n\t\t\t\tconst sourceField = parent.mutableChunk.fields.get(parent.key) ?? [];\n\t\t\t\tassert(source.start <= source.end, 0xd24 /* Detach range start must not exceed end */);\n\t\t\t\tassert(\n\t\t\t\t\tsource.end <= getFieldLength(sourceField),\n\t\t\t\t\t0xd25 /* Detach range must not exceed field length */,\n\t\t\t\t);\n\t\t\t\tif (destination !== undefined) {\n\t\t\t\t\tassert(\n\t\t\t\t\t\tparent.mutableChunk !== this.forest.roots || parent.key !== destination,\n\t\t\t\t\t\t0xd26 /* Detach destination field must be different from current field */,\n\t\t\t\t\t);\n\t\t\t\t\tassert(\n\t\t\t\t\t\t!this.forest.roots.fields.has(destination),\n\t\t\t\t\t\t0xd27 /* Detach destination must be a new empty field */,\n\t\t\t\t\t);\n\t\t\t\t}\n\n\t\t\t\tconst policy: ChunkCompressor = {\n\t\t\t\t\tpolicy: this.forest.chunker,\n\t\t\t\t\tidCompressor: this.forest.idCompressor,\n\t\t\t\t};\n\t\t\t\t// Split start first: splitting end later only expands chunks at positions >= startChunkIndex,\n\t\t\t\t// which leaves startChunkIndex valid. The reverse order would shift endChunkIndex when\n\t\t\t\t// source.start and source.end land in different chunks.\n\t\t\t\t// Performance: It's practical to have a variant of splitFieldAtIndex which can split at multiple locations in a single pass if the performance of this becomes worth optimizing.\n\t\t\t\tconst startChunkIndex = splitFieldAtIndex(sourceField, source.start, policy);\n\t\t\t\tconst endChunkIndex = splitFieldAtIndex(sourceField, source.end, policy);\n\t\t\t\tconst newField = sourceField.splice(startChunkIndex, endChunkIndex - startChunkIndex);\n\n\t\t\t\tif (destination === undefined) {\n\t\t\t\t\tfor (const child of newField) {\n\t\t\t\t\t\tchild.referenceRemoved();\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (newField.length > 0) {\n\t\t\t\t\t\tthis.forest.roots.fields.set(destination, newField);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// This check is performed after the transfer to ensure that the field is not removed in scenarios\n\t\t\t\t// where the source and destination are the same.\n\t\t\t\tif (sourceField.length === 0) {\n\t\t\t\t\tparent.mutableChunk.fields.delete(parent.key);\n\t\t\t\t}\n\t\t\t},\n\t\t\t/**\n\t\t\t * Ensure the selected node (by `index`) is an exclusively owned basic node,\n\t\t\t * and store it under `this.mutableChunk`.\n\t\t\t */\n\t\t\tenterNode(index: number): void {\n\t\t\t\tassert(this.mutableChunk === undefined, 0x535 /* should be in field */);\n\n\t\t\t\t// Get the mutable parent, which we might have to modify to ensure the desired child is an exclusively owned (and thus mutable) BasicChunk.\n\t\t\t\tconst parent = this.getParent();\n\n\t\t\t\t// Lookup the current location of the node to be entered\n\t\t\t\tconst chunks =\n\t\t\t\t\tparent.mutableChunk.fields.get(parent.key) ?? fail(0xaf6 /* missing edited field */);\n\n\t\t\t\tthis.mutableChunk = ensureExclusiveBasicChunk(chunks, index, {\n\t\t\t\t\tpolicy: this.forest.chunker,\n\t\t\t\t\tidCompressor: this.forest.idCompressor,\n\t\t\t\t});\n\t\t\t},\n\t\t\texitNode(index: number): void {\n\t\t\t\tassert(this.mutableChunk !== undefined, 0x537 /* should be in node */);\n\t\t\t\tthis.mutableChunk = undefined;\n\t\t\t},\n\t\t\tenterField(key: FieldKey): void {\n\t\t\t\tassert(this.mutableChunk !== undefined, 0x538 /* should be in node */);\n\t\t\t\tthis.mutableChunkStack.push({ key, mutableChunk: this.mutableChunk });\n\t\t\t\tthis.mutableChunk = undefined;\n\t\t\t},\n\t\t\texitField(key: FieldKey): void {\n\t\t\t\tconst top = this.mutableChunkStack.pop() ?? fail(0xaf8 /* should not be at root */);\n\t\t\t\tassert(this.mutableChunk === undefined, 0x539 /* should be in field */);\n\t\t\t\tthis.mutableChunk = top.mutableChunk;\n\t\t\t},\n\t\t};\n\n\t\tconst announcedVisitors: AnnouncedVisitor[] = [];\n\t\tfor (const getVisitor of this.deltaVisitors) {\n\t\t\tannouncedVisitors.push(getVisitor());\n\t\t}\n\t\tconst visitor = combineVisitors([\n\t\t\tmakeBreakingVisitor(forestVisitor, this.breaker),\n\t\t\t...announcedVisitors,\n\t\t]);\n\t\tthis.activeVisitor = visitor;\n\t\treturn visitor;\n\t}\n\n\tprivate nextDetachedFieldIdentifier = 0;\n\tpublic newDetachedField(): DetachedField {\n\t\tconst field: DetachedField = brand(String(this.nextDetachedFieldIdentifier));\n\t\tassert(\n\t\t\t!this.roots.fields.has(detachedFieldAsKey(field)),\n\t\t\t0x53a /* new field must not already exist */,\n\t\t);\n\t\tthis.nextDetachedFieldIdentifier += 1;\n\t\treturn field;\n\t}\n\n\tpublic allocateCursor(): Cursor {\n\t\tthis.breaker.use();\n\t\treturn new Cursor(\n\t\t\tthis,\n\t\t\tITreeSubscriptionCursorState.Cleared,\n\t\t\t[],\n\t\t\t[],\n\t\t\t[],\n\t\t\t[],\n\t\t\t[],\n\t\t\t[],\n\t\t\t0,\n\t\t\t0,\n\t\t\t0,\n\t\t\tundefined,\n\t\t);\n\t}\n\n\tpublic tryMoveCursorToNode(\n\t\tdestination: Anchor,\n\t\tcursorToMove: ITreeSubscriptionCursor,\n\t): TreeNavigationResult {\n\t\tthis.breaker.use();\n\t\tconst path = this.anchors.locate(destination);\n\t\tif (path === undefined) {\n\t\t\treturn TreeNavigationResult.NotFound;\n\t\t}\n\t\tthis.moveCursorToPath(path, cursorToMove);\n\t\treturn TreeNavigationResult.Ok;\n\t}\n\n\tpublic tryMoveCursorToField(\n\t\tdestination: FieldAnchor,\n\t\tcursorToMove: ITreeSubscriptionCursor,\n\t): TreeNavigationResult {\n\t\tthis.breaker.use();\n\t\tassert(\n\t\t\tcursorToMove instanceof Cursor,\n\t\t\t0x53b /* ChunkedForest must only be given its own Cursor type */,\n\t\t);\n\t\tif (destination.parent === undefined) {\n\t\t\tcursorToMove.setToDetachedSequence(destination.fieldKey);\n\t\t\treturn TreeNavigationResult.Ok;\n\t\t}\n\t\tconst result = this.tryMoveCursorToNode(destination.parent, cursorToMove);\n\t\tif (result !== TreeNavigationResult.Ok) {\n\t\t\treturn result;\n\t\t}\n\n\t\tcursorToMove.enterField(destination.fieldKey);\n\t\treturn TreeNavigationResult.Ok;\n\t}\n\n\tpublic moveCursorToPath(destination: UpPath, cursorToMove: ITreeSubscriptionCursor): void {\n\t\tthis.breaker.use();\n\t\tassert(\n\t\t\tcursorToMove instanceof Cursor,\n\t\t\t0x53c /* ChunkedForest must only be given its own Cursor type */,\n\t\t);\n\t\tassert(\n\t\t\tcursorToMove.forest === this,\n\t\t\t0x53d /* ChunkedForest must only be given its own Cursor */,\n\t\t);\n\n\t\tconst indexStack: number[] = [];\n\t\tconst keyStack: FieldKey[] = [];\n\n\t\tlet path: UpPath | undefined = destination;\n\t\twhile (path !== undefined) {\n\t\t\tindexStack.push(path.parentIndex);\n\t\t\tkeyStack.push(path.parentField);\n\t\t\tpath = path.parent;\n\t\t}\n\t\tcursorToMove.clear();\n\t\twhile (keyStack.length > 0) {\n\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\tconst key = keyStack.pop()!;\n\t\t\tif (cursorToMove.state === ITreeSubscriptionCursorState.Cleared) {\n\t\t\t\tcursorToMove.setToDetachedSequence(key);\n\t\t\t\tcursorToMove.state = ITreeSubscriptionCursorState.Current;\n\t\t\t} else {\n\t\t\t\tcursorToMove.enterField(key);\n\t\t\t}\n\n\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\tcursorToMove.enterNode(indexStack.pop()!);\n\t\t}\n\t}\n\n\tpublic getCursorAboveDetachedFields(): ITreeCursorSynchronous {\n\t\tthis.breaker.use();\n\t\tconst rootCursor = this.roots.cursor();\n\t\trootCursor.enterNode(0);\n\t\treturn rootCursor;\n\t}\n}\n\nclass Cursor extends BasicChunkCursor implements ITreeSubscriptionCursor {\n\tpublic constructor(\n\t\tpublic readonly forest: ChunkedForest,\n\t\tpublic state: ITreeSubscriptionCursorState,\n\t\troot: readonly TreeChunk[],\n\t\tsiblingStack: SiblingsOrKey[],\n\t\tindexStack: number[],\n\t\tindexOfChunkStack: number[],\n\t\tindexWithinChunkStack: number[],\n\t\tsiblings: SiblingsOrKey,\n\t\tindex: number,\n\t\tindexOfChunk: number,\n\t\tindexWithinChunk: number,\n\t\tnestedCursor: ChunkedCursor | undefined,\n\t) {\n\t\tsuper(\n\t\t\troot,\n\t\t\tsiblingStack,\n\t\t\tindexStack,\n\t\t\tindexOfChunkStack,\n\t\t\tindexWithinChunkStack,\n\t\t\tsiblings,\n\t\t\tindex,\n\t\t\tindexOfChunk,\n\t\t\tindexWithinChunk,\n\t\t\tnestedCursor,\n\t\t);\n\t}\n\n\tpublic setToDetachedSequence(key: FieldKey): void {\n\t\tthis.root = (this.forest.roots.fields.get(key) ?? []) as BasicChunk[];\n\t\tthis.siblingStack.length = 0;\n\t\tthis.indexStack.length = 0;\n\t\tthis.indexOfChunkStack.length = 0;\n\t\tthis.indexWithinChunkStack.length = 0;\n\t\tthis.siblings = [key];\n\t\tthis.index = 0;\n\t\tthis.indexOfChunk = 0;\n\t\tthis.indexWithinChunk = 0;\n\t\tthis.nestedCursor = undefined;\n\t}\n\n\tpublic override fork(): Cursor {\n\t\t// Siblings arrays are not modified during navigation and do not need be be copied.\n\t\t// This allows this copy to be shallow, and `this.siblings` below to not be copied as all.\n\t\treturn new Cursor(\n\t\t\tthis.forest,\n\t\t\tthis.state,\n\t\t\tthis.root,\n\t\t\t[...this.siblingStack],\n\t\t\t[...this.indexStack],\n\t\t\t[...this.indexOfChunkStack],\n\t\t\t[...this.indexWithinChunkStack],\n\t\t\tthis.siblings,\n\t\t\tthis.index,\n\t\t\tthis.indexOfChunk,\n\t\t\tthis.indexWithinChunk,\n\t\t\tthis.nestedCursor?.fork(),\n\t\t);\n\t}\n\n\tpublic buildFieldAnchor(): FieldAnchor {\n\t\tconst path = this.getFieldPath();\n\t\tconst anchor =\n\t\t\tpath.parent === undefined ? undefined : this.forest.anchors.track(path.parent);\n\t\treturn { parent: anchor, fieldKey: path.field };\n\t}\n\n\tpublic free(): void {\n\t\tthis.state = ITreeSubscriptionCursorState.Freed;\n\t}\n\n\tpublic buildAnchor(): Anchor {\n\t\treturn this.forest.anchors.track(this.getPath());\n\t}\n\n\tpublic clear(): void {\n\t\tthis.state = ITreeSubscriptionCursorState.Cleared;\n\t\tthis.setToDetachedSequence(rootFieldKey);\n\t}\n}\n\n/**\n * Creates an implementation of {@link IEditableForest} with no data or schema.\n */\nexport function buildChunkedForest(\n\tchunker: IChunker,\n\tanchors?: AnchorSet,\n\tidCompressor?: IIdCompressor,\n\tbreaker?: Breakable,\n): ChunkedForest {\n\treturn new ChunkedForest(\n\t\tmakeRoot(),\n\t\tchunker.schema,\n\t\tchunker,\n\t\tanchors,\n\t\tidCompressor,\n\t\tbreaker,\n\t);\n}\n"]}

package/dist/feature-libraries/comparison-forest/comparisonForest.d.ts

@@ -4,7 +4,7 @@
  */
 import type { Listenable } from "@fluidframework/core-interfaces";
 import { type Anchor, type AnchorSet, type AnnouncedVisitor, type DeltaVisitor, type FieldAnchor, type ForestEvents, type IEditableForest, type ITreeCursorSynchronous, type ITreeSubscriptionCursor, type TreeChunk, type TreeNavigationResult, type TreeStoredSchemaSubscription, type UpPath } from "../../core/index.js";
-import type { Breakable } from "../../util/index.js";
+import { type Breakable } from "../../util/index.js";
 /**
  * An {@link IEditableForest} which wraps two other forests: a `main` forest and a `reference` forest.
  *
@@ -36,6 +36,7 @@ export declare class ComparisonForest implements IEditableForest {
     get events(): Listenable<ForestEvents>;
     get anchors(): AnchorSet;
     get isEmpty(): boolean;
+    get breaker(): Breakable;
     clone(schema: TreeStoredSchemaSubscription, breaker?: Breakable): ComparisonForest;
     chunkField(cursor: ITreeCursorSynchronous): TreeChunk[];
     allocateCursor(source?: string): ITreeSubscriptionCursor;

package/dist/feature-libraries/comparison-forest/comparisonForest.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"comparisonForest.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/comparison-forest/comparisonForest.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAElE,OAAO,EACN,KAAK,MAAM,EACX,KAAK,SAAS,EACd,KAAK,gBAAgB,EACrB,KAAK,YAAY,EACjB,KAAK,WAAW,EAChB,KAAK,YAAY,EACjB,KAAK,eAAe,EACpB,KAAK,sBAAsB,EAC3B,KAAK,uBAAuB,EAC5B,KAAK,SAAS,EACd,KAAK,oBAAoB,EACzB,KAAK,4BAA4B,EACjC,KAAK,MAAM,EAGX,MAAM,qBAAqB,CAAC;AAC7B,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAIrD;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,gBAAiB,YAAW,eAAe;aAQtC,IAAI,EAAE,eAAe;aACrB,SAAS,EAAE,eAAe;IAR3C;;;;;OAKG;gBAEc,IAAI,EAAE,eAAe,EACrB,SAAS,EAAE,eAAe;IAK3C,OAAO,CAAC,WAAW;IAInB,IAAW,MAAM,IAAI,UAAU,CAAC,YAAY,CAAC,CAE5C;IAED,IAAW,OAAO,IAAI,SAAS,CAE9B;IAED,IAAW,OAAO,IAAI,OAAO,CAE5B;IAEM,KAAK,CAAC,MAAM,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,SAAS,GAAG,gBAAgB;IAQlF,UAAU,CAAC,MAAM,EAAE,sBAAsB,GAAG,SAAS,EAAE;IAIvD,cAAc,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,uBAAuB;IAMxD,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAIlC,mBAAmB,CACzB,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,uBAAuB,GACnC,oBAAoB;IAIhB,oBAAoB,CAC1B,WAAW,EAAE,WAAW,EACxB,YAAY,EAAE,uBAAuB,GACnC,oBAAoB;IAIhB,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,uBAAuB,GAAG,IAAI;IAIlF,4BAA4B,IAAI,sBAAsB;IAItD,wBAAwB,CAAC,OAAO,EAAE,MAAM,gBAAgB,GAAG,IAAI;IAI/D,0BAA0B,CAAC,OAAO,EAAE,MAAM,gBAAgB,GAAG,IAAI;IAIjE,cAAc,IAAI,YAAY;CAYrC"}
+{"version":3,"file":"comparisonForest.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/comparison-forest/comparisonForest.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAElE,OAAO,EACN,KAAK,MAAM,EACX,KAAK,SAAS,EACd,KAAK,gBAAgB,EACrB,KAAK,YAAY,EACjB,KAAK,WAAW,EAChB,KAAK,YAAY,EACjB,KAAK,eAAe,EACpB,KAAK,sBAAsB,EAC3B,KAAK,uBAAuB,EAC5B,KAAK,SAAS,EACd,KAAK,oBAAoB,EACzB,KAAK,4BAA4B,EACjC,KAAK,MAAM,EAGX,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAkB,KAAK,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAIrE;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,gBAAiB,YAAW,eAAe;aAQtC,IAAI,EAAE,eAAe;aACrB,SAAS,EAAE,eAAe;IAR3C;;;;;OAKG;gBAEc,IAAI,EAAE,eAAe,EACrB,SAAS,EAAE,eAAe;IAM3C,OAAO,CAAC,WAAW;IAInB,IAAW,MAAM,IAAI,UAAU,CAAC,YAAY,CAAC,CAE5C;IAED,IAAW,OAAO,IAAI,SAAS,CAE9B;IAED,IAAW,OAAO,IAAI,OAAO,CAE5B;IAED,IAAW,OAAO,IAAI,SAAS,CAE9B;IAEM,KAAK,CAAC,MAAM,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,SAAS,GAAG,gBAAgB;IAQlF,UAAU,CAAC,MAAM,EAAE,sBAAsB,GAAG,SAAS,EAAE;IAIvD,cAAc,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,uBAAuB;IAMxD,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAIlC,mBAAmB,CACzB,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,uBAAuB,GACnC,oBAAoB;IAIhB,oBAAoB,CAC1B,WAAW,EAAE,WAAW,EACxB,YAAY,EAAE,uBAAuB,GACnC,oBAAoB;IAIhB,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,uBAAuB,GAAG,IAAI;IAIlF,4BAA4B,IAAI,sBAAsB;IAItD,wBAAwB,CAAC,OAAO,EAAE,MAAM,gBAAgB,GAAG,IAAI;IAI/D,0BAA0B,CAAC,OAAO,EAAE,MAAM,gBAAgB,GAAG,IAAI;IAIjE,cAAc,IAAI,YAAY;CAYrC"}