@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/dist/feature-libraries/object-forest/objectForest.js

@@ -0,0 +1,382 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildForest = exports.ObjectForest = void 0;
+const core_utils_1 = require("@fluidframework/core-utils");
+const core_1 = require("../../core");
+const util_1 = require("../../util");
+const treeCursorUtils_1 = require("../treeCursorUtils");
+const mapTreeCursor_1 = require("../mapTreeCursor");
+const events_1 = require("../../events");
+function makeRoot() {
+    return {
+        type: core_1.aboveRootPlaceholder,
+        fields: new Map(),
+    };
+}
+/**
+ * Reference implementation of IEditableForest.
+ *
+ * This implementation focuses on correctness and simplicity, not performance.
+ * It does not use compressed chunks: instead nodes are implemented using objects.
+ */
+class ObjectForest {
+    constructor(anchors = new core_1.AnchorSet()) {
+        this.anchors = anchors;
+        this.roots = makeRoot();
+        // All cursors that are in the "Current" state. Must be empty when editing.
+        this.currentCursors = new Set();
+        this.events = (0, events_1.createEmitter)();
+        this.nextRange = 0;
+    }
+    get isEmpty() {
+        return this.roots.fields.size === 0;
+    }
+    on(eventName, listener) {
+        return this.events.on(eventName, listener);
+    }
+    clone(_, anchors) {
+        const forest = new ObjectForest(anchors);
+        // Deep copy the trees.
+        for (const [key, value] of this.roots.fields) {
+            // TODO: this references the existing TreeValues instead of copying them:
+            // they are assumed to be copy on write. See TODO on NodeData.
+            forest.roots.fields.set(key, value.map((v) => (0, mapTreeCursor_1.mapTreeFromCursor)((0, mapTreeCursor_1.cursorForMapTreeNode)(v))));
+        }
+        return forest;
+    }
+    forgetAnchor(anchor) {
+        this.anchors.forget(anchor);
+    }
+    acquireVisitor() {
+        (0, core_utils_1.assert)(this.activeVisitor === undefined, 0x76c /* Must release existing visitor before acquiring another */);
+        this.events.emit("beforeChange");
+        (0, core_utils_1.assert)(this.currentCursors.size === 0, 0x374 /* No cursors can be current when modifying forest */);
+        // Note: This code uses cursors, however it also modifies the tree.
+        // In general this is not safe, but this code happens to only modify the tree below the current cursor location,
+        // which happens to work.
+        // This pattern could be generalized/formalized with a concept of an exclusive cursor,
+        // which can edit, but is the only cursor allowed at the time.
+        const cursor = this.allocateCursor();
+        cursor.setToAboveDetachedSequences();
+        const visitor = {
+            forest: this,
+            cursor,
+            free() {
+                this.cursor.free();
+                (0, core_utils_1.assert)(this.forest.activeVisitor !== undefined, 0x76d /* Multiple free calls for same visitor */);
+                this.forest.activeVisitor = undefined;
+                this.forest.events.emit("afterChange");
+            },
+            destroy(detachedField, count) {
+                this.forest.delete(detachedField);
+            },
+            create(content, destination) {
+                this.forest.add(content, destination);
+            },
+            attach(source, count, destination) {
+                this.attachEdit(source, count, destination);
+            },
+            detach(source, destination) {
+                this.detachEdit(source, destination);
+            },
+            /**
+             * Attaches the nodes from the given source field into the current field.
+             * Does not invalidate dependents.
+             * @param source - The the range to be attached.
+             * @param count - The number of nodes being attached.
+             * Expected to match the number of nodes in the source detached field.
+             * @param destination - The index in the current field at which to attach the content.
+             */
+            attachEdit(source, count, destination) {
+                (0, util_1.assertNonNegativeSafeInteger)(count);
+                if (count === 0) {
+                    return;
+                }
+                const [parent, key] = cursor.getParent();
+                (0, core_utils_1.assert)(parent !== this.forest.roots || key !== source, 0x7b6 /* Attach source field must be different from current field */);
+                const currentField = (0, core_1.getMapTreeField)(parent, key, true);
+                (0, util_1.assertValidIndex)(destination, currentField, true);
+                const sourceField = (0, core_1.getMapTreeField)(this.forest.roots, source, false);
+                (0, core_utils_1.assert)(sourceField !== undefined, 0x7b7 /* Attach source field must exist */);
+                (0, core_utils_1.assert)(sourceField.length === count, 0x7b8 /* Attach must consume all nodes in source field */);
+                // TODO: this will fail for very large insertions due to argument limits.
+                currentField.splice(destination, 0, ...sourceField);
+                this.forest.delete(source);
+            },
+            /**
+             * Detaches the range from the current field and transfers it to the given destination if any.
+             * Does not invalidate dependents.
+             * @param source - The bounds of the range to be detached from the current field.
+             * @param destination - If specified, the destination to transfer the detached range to.
+             * If not specified, the detached range is destroyed.
+             */
+            detachEdit(source, destination) {
+                const [parent, key] = cursor.getParent();
+                (0, core_utils_1.assert)(destination === undefined ||
+                    parent !== this.forest.roots ||
+                    key !== destination, 0x7b9 /* Detach destination field must be different from current field */);
+                const currentField = (0, core_1.getMapTreeField)(parent, key, true);
+                (0, util_1.assertValidRange)(source, currentField);
+                const content = currentField.splice(source.start, source.end - source.start);
+                if (destination !== undefined) {
+                    this.forest.addFieldAsDetached(content, destination);
+                }
+                // This check is performed after the transfer to ensure that the field is not removed in scenarios
+                // where the source and destination are the same.
+                if (currentField.length === 0) {
+                    parent.fields.delete(key);
+                }
+            },
+            replace(newContentSource, range, oldContentDestination) {
+                (0, core_utils_1.assert)(newContentSource !== oldContentDestination, 0x7ba /* Replace detached source field and detached destination field must be different */);
+                this.detachEdit(range, oldContentDestination);
+                this.attachEdit(newContentSource, range.end - range.start, range.start);
+            },
+            enterNode(index) {
+                this.cursor.enterNode(index);
+            },
+            exitNode(index) {
+                this.cursor.exitNode();
+            },
+            enterField(key) {
+                this.cursor.enterField(key);
+            },
+            exitField(key) {
+                this.cursor.exitField();
+            },
+        };
+        this.activeVisitor = visitor;
+        return visitor;
+    }
+    newDetachedField() {
+        const range = (0, util_1.brand)(String(this.nextRange));
+        this.nextRange += 1;
+        return range;
+    }
+    add(nodes, key) {
+        const field = Array.from(nodes, mapTreeCursor_1.mapTreeFromCursor);
+        this.addFieldAsDetached(field, key);
+    }
+    addFieldAsDetached(field, key) {
+        (0, core_utils_1.assert)(!this.roots.fields.has(key), 0x370 /* new range must not already exist */);
+        if (field.length > 0) {
+            this.roots.fields.set(key, field);
+        }
+    }
+    delete(field) {
+        this.roots.fields.delete(field);
+    }
+    allocateCursor() {
+        return new Cursor(this);
+    }
+    tryMoveCursorToNode(destination, cursorToMove) {
+        const path = this.anchors.locate(destination);
+        if (path === undefined) {
+            return -1 /* TreeNavigationResult.NotFound */;
+        }
+        this.moveCursorToPath(path, cursorToMove);
+        return 1 /* TreeNavigationResult.Ok */;
+    }
+    tryMoveCursorToField(destination, cursorToMove) {
+        if (destination.parent === undefined) {
+            this.moveCursorToPath(undefined, cursorToMove);
+        }
+        else {
+            const result = this.tryMoveCursorToNode(destination.parent, cursorToMove);
+            if (result !== 1 /* TreeNavigationResult.Ok */) {
+                return result;
+            }
+        }
+        cursorToMove.enterField(destination.fieldKey);
+        return 1 /* TreeNavigationResult.Ok */;
+    }
+    moveCursorToPath(destination, cursorToMove) {
+        (0, core_utils_1.assert)(cursorToMove instanceof Cursor, 0x337 /* ObjectForest must only be given its own Cursor type */);
+        (0, core_utils_1.assert)(cursorToMove.forest === this, 0x338 /* ObjectForest must only be given its own Cursor */);
+        const indexStack = [];
+        const keyStack = [];
+        let path = destination;
+        while (path !== undefined) {
+            indexStack.push(path.parentIndex);
+            keyStack.push(path.parentField);
+            path = path.parent;
+        }
+        cursorToMove.setToAboveDetachedSequences();
+        while (keyStack.length > 0) {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            cursorToMove.enterField(keyStack.pop());
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            cursorToMove.enterNode(indexStack.pop());
+        }
+        return;
+    }
+    getCursorAboveDetachedFields() {
+        return (0, mapTreeCursor_1.cursorForMapTreeNode)(this.roots);
+    }
+}
+exports.ObjectForest = ObjectForest;
+/**
+ * Cursor implementation for ObjectForest.
+ */
+class Cursor extends treeCursorUtils_1.SynchronousCursor {
+    /**
+     * @param forest - forest this cursor navigates
+     * @param innerCursor - underlying cursor implementation this wraps. `undefined` when state is not `Current`
+     */
+    constructor(forest, innerCursor) {
+        super();
+        this.forest = forest;
+        this.innerCursor = innerCursor;
+        if (innerCursor === undefined) {
+            this.state = core_1.ITreeSubscriptionCursorState.Cleared;
+        }
+        else {
+            this.state = core_1.ITreeSubscriptionCursorState.Current;
+            this.forest.currentCursors.add(this);
+        }
+    }
+    buildFieldAnchor() {
+        const path = this.getFieldPath();
+        const anchor = path.parent === undefined ? undefined : this.forest.anchors.track(path.parent);
+        return { parent: anchor, fieldKey: path.field };
+    }
+    getFieldPath(prefix) {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x45f /* Cursor must be current to be used */);
+        return this.innerCursor.getFieldPath(prefix);
+    }
+    get mode() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x42e /* Cursor must be current to be used */);
+        return this.innerCursor.mode;
+    }
+    nextField() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x42f /* Cursor must be current to be used */);
+        return this.innerCursor.nextField();
+    }
+    exitField() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x430 /* Cursor must be current to be used */);
+        return this.innerCursor.exitField();
+    }
+    skipPendingFields() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x431 /* Cursor must be current to be used */);
+        return this.innerCursor.skipPendingFields();
+    }
+    getFieldKey() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x432 /* Cursor must be current to be used */);
+        return this.innerCursor.getFieldKey();
+    }
+    getFieldLength() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x433 /* Cursor must be current to be used */);
+        return this.innerCursor.getFieldLength();
+    }
+    firstNode() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x434 /* Cursor must be current to be used */);
+        return this.innerCursor.firstNode();
+    }
+    enterNode(childIndex) {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x435 /* Cursor must be current to be used */);
+        return this.innerCursor.enterNode(childIndex);
+    }
+    getPath(prefix) {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x436 /* Cursor must be current to be used */);
+        return this.innerCursor.getPath(prefix) ?? (0, util_1.fail)("no path when at root");
+    }
+    get fieldIndex() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x437 /* Cursor must be current to be used */);
+        return this.innerCursor.fieldIndex;
+    }
+    get chunkStart() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x438 /* Cursor must be current to be used */);
+        return this.innerCursor.chunkStart;
+    }
+    get chunkLength() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x439 /* Cursor must be current to be used */);
+        return this.innerCursor.chunkLength;
+    }
+    seekNodes(offset) {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43a /* Cursor must be current to be used */);
+        return this.innerCursor.seekNodes(offset);
+    }
+    nextNode() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43b /* Cursor must be current to be used */);
+        return this.innerCursor.nextNode();
+    }
+    exitNode() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43c /* Cursor must be current to be used */);
+        return this.innerCursor.exitNode();
+    }
+    firstField() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43d /* Cursor must be current to be used */);
+        return this.innerCursor.firstField();
+    }
+    enterField(key) {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43e /* Cursor must be current to be used */);
+        return this.innerCursor.enterField(key);
+    }
+    get type() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43f /* Cursor must be current to be used */);
+        return this.innerCursor.type;
+    }
+    get value() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x440 /* Cursor must be current to be used */);
+        return this.innerCursor.value;
+    }
+    // TODO: tests for clear when not at root.
+    clear() {
+        (0, core_utils_1.assert)(this.state !== core_1.ITreeSubscriptionCursorState.Freed, 0x33b /* Cursor must not be freed */);
+        this.state = core_1.ITreeSubscriptionCursorState.Cleared;
+        this.innerCursor = undefined;
+        this.forest.currentCursors.delete(this);
+    }
+    /**
+     * Move this cursor to the special dummy node above the detached sequences.
+     * Can be used when cleared (but not freed).
+     */
+    setToAboveDetachedSequences() {
+        (0, core_utils_1.assert)(this.state !== core_1.ITreeSubscriptionCursorState.Freed, 0x33c /* Cursor must not be freed */);
+        this.clear();
+        this.state = core_1.ITreeSubscriptionCursorState.Current;
+        this.innerCursor = (0, mapTreeCursor_1.cursorForMapTreeNode)(this.forest.roots);
+        this.forest.currentCursors.add(this);
+    }
+    getNode() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x33e /* Cursor must be current to be used */);
+        return this.innerCursor.getNode();
+    }
+    getParent() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x441 /* Cursor must be current to be used */);
+        // This could be optimized to skip moving it accessing internals of cursor.
+        const key = this.innerCursor.getFieldKey();
+        this.innerCursor.exitField();
+        const node = this.innerCursor.getNode();
+        this.innerCursor.enterField(key);
+        return [node, key];
+    }
+    fork() {
+        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x460 /* Cursor must be current to be used */);
+        return new Cursor(this.forest, this.innerCursor.fork());
+    }
+    free() {
+        (0, core_utils_1.assert)(this.state !== core_1.ITreeSubscriptionCursorState.Freed, 0x33f /* Cursor must not be double freed */);
+        this.forest.currentCursors.delete(this);
+        this.state = core_1.ITreeSubscriptionCursorState.Freed;
+    }
+    buildAnchor() {
+        (0, core_utils_1.assert)(this.state === core_1.ITreeSubscriptionCursorState.Current, 0x37a /* Cursor must be current to be used */);
+        return this.forest.anchors.track(this.getPath());
+    }
+}
+// This function is the folder level export for objectForest, and hides all the implementation types.
+// When other forest implementations are created (ex: optimized ones),
+// this function should likely be moved and updated to (at least conditionally) use them.
+/**
+ * @returns an implementation of {@link IEditableForest} with no data or schema.
+ */
+function buildForest(anchors) {
+    return new ObjectForest(anchors);
+}
+exports.buildForest = buildForest;
+//# sourceMappingURL=objectForest.js.map

package/dist/feature-libraries/object-forest/objectForest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"objectForest.js","sourceRoot":"","sources":["../../../src/feature-libraries/object-forest/objectForest.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,qCA2BoB;AACpB,qCAMoB;AACpB,wDAAuE;AACvE,oDAA2E;AAC3E,yCAA6C;AAE7C,SAAS,QAAQ;IAChB,OAAO;QACN,IAAI,EAAE,2BAAoB;QAC1B,MAAM,EAAE,IAAI,GAAG,EAAE;KACjB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAa,YAAY;IAUxB,YAAmC,UAAqB,IAAI,gBAAS,EAAE;QAApC,YAAO,GAAP,OAAO,CAA6B;QAPvD,UAAK,GAAY,QAAQ,EAAE,CAAC;QAE5C,2EAA2E;QAC3D,mBAAc,GAAgB,IAAI,GAAG,EAAE,CAAC;QAEvC,WAAM,GAAG,IAAA,sBAAa,GAAgB,CAAC;QAgKhD,cAAS,GAAG,CAAC,CAAC;IA9JoD,CAAC;IAE3E,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC;IACrC,CAAC;IAEM,EAAE,CAA+B,SAAY,EAAE,QAAyB;QAC9E,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAEM,KAAK,CAAC,CAA+B,EAAE,OAAkB;QAC/D,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;QACzC,uBAAuB;QACvB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YAC7C,yEAAyE;YACzE,8DAA8D;YAC9D,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CACtB,GAAG,EACH,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,iCAAiB,EAAC,IAAA,oCAAoB,EAAC,CAAC,CAAC,CAAC,CAAC,CAC5D,CAAC;SACF;QACD,OAAO,MAAM,CAAC;IACf,CAAC;IAEM,YAAY,CAAC,MAAc;QACjC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAEM,cAAc;QACpB,IAAA,mBAAM,EACL,IAAI,CAAC,aAAa,KAAK,SAAS,EAChC,KAAK,CAAC,4DAA4D,CAClE,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAEjC,IAAA,mBAAM,EACL,IAAI,CAAC,cAAc,CAAC,IAAI,KAAK,CAAC,EAC9B,KAAK,CAAC,qDAAqD,CAC3D,CAAC;QAEF,mEAAmE;QACnE,gHAAgH;QAChH,yBAAyB;QACzB,sFAAsF;QACtF,8DAA8D;QAE9D,MAAM,MAAM,GAAW,IAAI,CAAC,cAAc,EAAE,CAAC;QAC7C,MAAM,CAAC,2BAA2B,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG;YACf,MAAM,EAAE,IAAI;YACZ,MAAM;YACN,IAAI;gBACH,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBACnB,IAAA,mBAAM,EACL,IAAI,CAAC,MAAM,CAAC,aAAa,KAAK,SAAS,EACvC,KAAK,CAAC,0CAA0C,CAChD,CAAC;gBACF,IAAI,CAAC,MAAM,CAAC,aAAa,GAAG,SAAS,CAAC;gBACtC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACxC,CAAC;YACD,OAAO,CAAC,aAAuB,EAAE,KAAa;gBAC7C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;YACnC,CAAC;YACD,MAAM,CAAC,OAAmB,EAAE,WAAqB;gBAChD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;YACvC,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;gBAC1C,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YACtC,CAAC;YACD;;;;;;;eAOG;YACH,UAAU,CAAC,MAAgB,EAAE,KAAa,EAAE,WAAuB;gBAClE,IAAA,mCAA4B,EAAC,KAAK,CAAC,CAAC;gBACpC,IAAI,KAAK,KAAK,CAAC,EAAE;oBAChB,OAAO;iBACP;gBACD,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;gBACzC,IAAA,mBAAM,EACL,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,GAAG,KAAK,MAAM,EAC9C,KAAK,CAAC,8DAA8D,CACpE,CAAC;gBACF,MAAM,YAAY,GAAG,IAAA,sBAAe,EAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;gBACxD,IAAA,uBAAgB,EAAC,WAAW,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;gBAClD,MAAM,WAAW,GAAG,IAAA,sBAAe,EAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;gBACtE,IAAA,mBAAM,EAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;gBAC9E,IAAA,mBAAM,EACL,WAAW,CAAC,MAAM,KAAK,KAAK,EAC5B,KAAK,CAAC,mDAAmD,CACzD,CAAC;gBACF,yEAAyE;gBACzE,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,EAAE,GAAG,WAAW,CAAC,CAAC;gBACpD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;YACD;;;;;;eAMG;YACH,UAAU,CAAC,MAAa,EAAE,WAAiC;gBAC1D,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;gBACzC,IAAA,mBAAM,EACL,WAAW,KAAK,SAAS;oBACxB,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,KAAK;oBAC5B,GAAG,KAAK,WAAW,EACpB,KAAK,CAAC,mEAAmE,CACzE,CAAC;gBACF,MAAM,YAAY,GAAG,IAAA,sBAAe,EAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;gBACxD,IAAA,uBAAgB,EAAC,MAAM,EAAE,YAAY,CAAC,CAAC;gBACvC,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC7E,IAAI,WAAW,KAAK,SAAS,EAAE;oBAC9B,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;iBACrD;gBACD,kGAAkG;gBAClG,iDAAiD;gBACjD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE;oBAC9B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;iBAC1B;YACF,CAAC;YACD,OAAO,CACN,gBAA0B,EAC1B,KAAY,EACZ,qBAA+B;gBAE/B,IAAA,mBAAM,EACL,gBAAgB,KAAK,qBAAqB,EAC1C,KAAK,CAAC,oFAAoF,CAC1F,CAAC;gBACF,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;gBAC9C,IAAI,CAAC,UAAU,CAAC,gBAAgB,EAAE,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YACzE,CAAC;YACD,SAAS,CAAC,KAAa;gBACtB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAC9B,CAAC;YACD,QAAQ,CAAC,KAAa;gBACrB,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YACxB,CAAC;YACD,UAAU,CAAC,GAAa;gBACvB,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YAC7B,CAAC;YACD,SAAS,CAAC,GAAa;gBACtB,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YACzB,CAAC;SACD,CAAC;QACF,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;QAC7B,OAAO,OAAO,CAAC;IAChB,CAAC;IAGM,gBAAgB;QACtB,MAAM,KAAK,GAAkB,IAAA,YAAK,EAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;QAC3D,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;QACpB,OAAO,KAAK,CAAC;IACd,CAAC;IAEO,GAAG,CAAC,KAA4B,EAAE,GAAa;QACtD,MAAM,KAAK,GAAgB,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,iCAAiB,CAAC,CAAC;QAChE,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACrC,CAAC;IAEO,kBAAkB,CAAC,KAAkB,EAAE,GAAa;QAC3D,IAAA,mBAAM,EAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAClF,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACrB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;SAClC;IACF,CAAC;IAEO,MAAM,CAAC,KAAe;QAC7B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAEM,cAAc;QACpB,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;IACzB,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;YACvB,8CAAqC;SACrC;QACD,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QAC1C,uCAA+B;IAChC,CAAC;IAEM,oBAAoB,CAC1B,WAAwB,EACxB,YAAqC;QAErC,IAAI,WAAW,CAAC,MAAM,KAAK,SAAS,EAAE;YACrC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;SAC/C;aAAM;YACN,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAC1E,IAAI,MAAM,oCAA4B,EAAE;gBACvC,OAAO,MAAM,CAAC;aACd;SACD;QACD,YAAY,CAAC,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC9C,uCAA+B;IAChC,CAAC;IAEM,gBAAgB,CACtB,WAA+B,EAC/B,YAAqC;QAErC,IAAA,mBAAM,EACL,YAAY,YAAY,MAAM,EAC9B,KAAK,CAAC,yDAAyD,CAC/D,CAAC;QACF,IAAA,mBAAM,EACL,YAAY,CAAC,MAAM,KAAK,IAAI,EAC5B,KAAK,CAAC,oDAAoD,CAC1D,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;YAC1B,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;SACnB;QACD,YAAY,CAAC,2BAA2B,EAAE,CAAC;QAC3C,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;YAC3B,oEAAoE;YACpE,YAAY,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,EAAG,CAAC,CAAC;YACzC,oEAAoE;YACpE,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,EAAG,CAAC,CAAC;SAC1C;QAED,OAAO;IACR,CAAC;IAEM,4BAA4B;QAClC,OAAO,IAAA,oCAAoB,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;CACD;AAnQD,oCAmQC;AAID;;GAEG;AACH,MAAM,MAAO,SAAQ,mCAAiB;IAGrC;;;OAGG;IACH,YACiB,MAAoB,EAC5B,WAAqC;QAE7C,KAAK,EAAE,CAAC;QAHQ,WAAM,GAAN,MAAM,CAAc;QAC5B,gBAAW,GAAX,WAAW,CAA0B;QAG7C,IAAI,WAAW,KAAK,SAAS,EAAE;YAC9B,IAAI,CAAC,KAAK,GAAG,mCAA4B,CAAC,OAAO,CAAC;SAClD;aAAM;YACN,IAAI,CAAC,KAAK,GAAG,mCAA4B,CAAC,OAAO,CAAC;YAClD,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;SACrC;IACF,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;IACM,YAAY,CAAC,MAAuB;QAC1C,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IACD,IAAW,IAAI;QACd,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;IAC9B,CAAC;IAEM,SAAS;QACf,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC;IACrC,CAAC;IACM,SAAS;QACf,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC;IACrC,CAAC;IACe,iBAAiB;QAChC,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,iBAAiB,EAAE,CAAC;IAC7C,CAAC;IACM,WAAW;QACjB,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC;IACvC,CAAC;IACM,cAAc;QACpB,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,CAAC;IAC1C,CAAC;IACM,SAAS;QACf,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC;IACrC,CAAC;IACM,SAAS,CAAC,UAAkB;QAClC,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IAC/C,CAAC;IACM,OAAO,CAAC,MAAuB;QACrC,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,IAAA,WAAI,EAAC,sBAAsB,CAAC,CAAC;IACzE,CAAC;IACD,IAAW,UAAU;QACpB,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;IACpC,CAAC;IACD,IAAW,UAAU;QACpB,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;IACpC,CAAC;IACD,IAAW,WAAW;QACrB,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;IACrC,CAAC;IACM,SAAS,CAAC,MAAc;QAC9B,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;IACM,QAAQ;QACd,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;IACpC,CAAC;IACM,QAAQ;QACd,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;IACpC,CAAC;IACM,UAAU;QAChB,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC;IACtC,CAAC;IACM,UAAU,CAAC,GAAa;QAC9B,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;IACzC,CAAC;IACD,IAAW,IAAI;QACd,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;IAC9B,CAAC;IACD,IAAW,KAAK;QACf,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC;IAC/B,CAAC;IAED,0CAA0C;IACnC,KAAK;QACX,IAAA,mBAAM,EACL,IAAI,CAAC,KAAK,KAAK,mCAA4B,CAAC,KAAK,EACjD,KAAK,CAAC,8BAA8B,CACpC,CAAC;QACF,IAAI,CAAC,KAAK,GAAG,mCAA4B,CAAC,OAAO,CAAC;QAClD,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IAED;;;OAGG;IACI,2BAA2B;QACjC,IAAA,mBAAM,EACL,IAAI,CAAC,KAAK,KAAK,mCAA4B,CAAC,KAAK,EACjD,KAAK,CAAC,8BAA8B,CACpC,CAAC;QACF,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,KAAK,GAAG,mCAA4B,CAAC,OAAO,CAAC;QAClD,IAAI,CAAC,WAAW,GAAG,IAAA,oCAAoB,EAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC3D,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;IAEM,OAAO;QACb,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;IACnC,CAAC;IAEM,SAAS;QACf,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,2EAA2E;QAC3E,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC;QAC3C,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;QACxC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACjC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;IAEM,IAAI;QACV,IAAA,mBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACtF,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;IACzD,CAAC;IAEM,IAAI;QACV,IAAA,mBAAM,EACL,IAAI,CAAC,KAAK,KAAK,mCAA4B,CAAC,KAAK,EACjD,KAAK,CAAC,qCAAqC,CAC3C,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,GAAG,mCAA4B,CAAC,KAAK,CAAC;IACjD,CAAC;IAEM,WAAW;QACjB,IAAA,mBAAM,EACL,IAAI,CAAC,KAAK,KAAK,mCAA4B,CAAC,OAAO,EACnD,KAAK,CAAC,uCAAuC,CAC7C,CAAC;QACF,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAClD,CAAC;CACD;AAED,qGAAqG;AACrG,sEAAsE;AACtE,yFAAyF;AACzF;;GAEG;AACH,SAAgB,WAAW,CAAC,OAAmB;IAC9C,OAAO,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;AAClC,CAAC;AAFD,kCAEC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport {\n\tITreeSubscriptionCursor,\n\tIEditableForest,\n\tITreeSubscriptionCursorState,\n\tTreeNavigationResult,\n\tTreeStoredSchemaSubscription,\n\tFieldKey,\n\tDetachedField,\n\tAnchorSet,\n\tUpPath,\n\tAnchor,\n\tITreeCursor,\n\tCursorLocationType,\n\tTreeNodeSchemaIdentifier,\n\tMapTree,\n\tgetMapTreeField,\n\tFieldAnchor,\n\tFieldUpPath,\n\tForestEvents,\n\tPathRootPrefix,\n\tDeltaVisitor,\n\tRange,\n\tPlaceIndex,\n\tValue,\n\tITreeCursorSynchronous,\n\taboveRootPlaceholder,\n\tProtoNodes,\n} from \"../../core\";\nimport {\n\tbrand,\n\tfail,\n\tassertValidIndex,\n\tassertValidRange,\n\tassertNonNegativeSafeInteger,\n} from \"../../util\";\nimport { CursorWithNode, SynchronousCursor } from \"../treeCursorUtils\";\nimport { mapTreeFromCursor, cursorForMapTreeNode } from \"../mapTreeCursor\";\nimport { createEmitter } from \"../../events\";\n\nfunction makeRoot(): MapTree {\n\treturn {\n\t\ttype: aboveRootPlaceholder,\n\t\tfields: new Map(),\n\t};\n}\n\n/**\n * Reference implementation of IEditableForest.\n *\n * This implementation focuses on correctness and simplicity, not performance.\n * It does not use compressed chunks: instead nodes are implemented using objects.\n */\nexport class ObjectForest implements IEditableForest {\n\tprivate activeVisitor?: DeltaVisitor;\n\n\tpublic readonly roots: MapTree = makeRoot();\n\n\t// All cursors that are in the \"Current\" state. Must be empty when editing.\n\tpublic readonly currentCursors: Set<Cursor> = new Set();\n\n\tprivate readonly events = createEmitter<ForestEvents>();\n\n\tpublic constructor(public readonly anchors: AnchorSet = new AnchorSet()) {}\n\n\tpublic get isEmpty(): boolean {\n\t\treturn this.roots.fields.size === 0;\n\t}\n\n\tpublic on<K extends keyof ForestEvents>(eventName: K, listener: ForestEvents[K]): () => void {\n\t\treturn this.events.on(eventName, listener);\n\t}\n\n\tpublic clone(_: TreeStoredSchemaSubscription, anchors: AnchorSet): ObjectForest {\n\t\tconst forest = new ObjectForest(anchors);\n\t\t// Deep copy the trees.\n\t\tfor (const [key, value] of this.roots.fields) {\n\t\t\t// TODO: this references the existing TreeValues instead of copying them:\n\t\t\t// they are assumed to be copy on write. See TODO on NodeData.\n\t\t\tforest.roots.fields.set(\n\t\t\t\tkey,\n\t\t\t\tvalue.map((v) => mapTreeFromCursor(cursorForMapTreeNode(v))),\n\t\t\t);\n\t\t}\n\t\treturn forest;\n\t}\n\n\tpublic forgetAnchor(anchor: Anchor): void {\n\t\tthis.anchors.forget(anchor);\n\t}\n\n\tpublic acquireVisitor(): DeltaVisitor {\n\t\tassert(\n\t\t\tthis.activeVisitor === undefined,\n\t\t\t0x76c /* Must release existing visitor before acquiring another */,\n\t\t);\n\t\tthis.events.emit(\"beforeChange\");\n\n\t\tassert(\n\t\t\tthis.currentCursors.size === 0,\n\t\t\t0x374 /* No cursors can be current when modifying forest */,\n\t\t);\n\n\t\t// Note: This code uses cursors, however it also modifies the tree.\n\t\t// In general this is not safe, but this code happens to only modify the tree below the current cursor location,\n\t\t// which happens to work.\n\t\t// This pattern could be generalized/formalized with a concept of an exclusive cursor,\n\t\t// which can edit, but is the only cursor allowed at the time.\n\n\t\tconst cursor: Cursor = this.allocateCursor();\n\t\tcursor.setToAboveDetachedSequences();\n\t\tconst visitor = {\n\t\t\tforest: this,\n\t\t\tcursor,\n\t\t\tfree() {\n\t\t\t\tthis.cursor.free();\n\t\t\t\tassert(\n\t\t\t\t\tthis.forest.activeVisitor !== undefined,\n\t\t\t\t\t0x76d /* Multiple free calls for same visitor */,\n\t\t\t\t);\n\t\t\t\tthis.forest.activeVisitor = undefined;\n\t\t\t\tthis.forest.events.emit(\"afterChange\");\n\t\t\t},\n\t\t\tdestroy(detachedField: FieldKey, count: number): void {\n\t\t\t\tthis.forest.delete(detachedField);\n\t\t\t},\n\t\t\tcreate(content: ProtoNodes, destination: FieldKey): void {\n\t\t\t\tthis.forest.add(content, 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): void {\n\t\t\t\tthis.detachEdit(source, destination);\n\t\t\t},\n\t\t\t/**\n\t\t\t * Attaches the nodes from the given source field into the current field.\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 count - The number of nodes being attached.\n\t\t\t * Expected to match the number of nodes in the source detached field.\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\tassertNonNegativeSafeInteger(count);\n\t\t\t\tif (count === 0) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tconst [parent, key] = cursor.getParent();\n\t\t\t\tassert(\n\t\t\t\t\tparent !== this.forest.roots || key !== source,\n\t\t\t\t\t0x7b6 /* Attach source field must be different from current field */,\n\t\t\t\t);\n\t\t\t\tconst currentField = getMapTreeField(parent, key, true);\n\t\t\t\tassertValidIndex(destination, currentField, true);\n\t\t\t\tconst sourceField = getMapTreeField(this.forest.roots, source, false);\n\t\t\t\tassert(sourceField !== undefined, 0x7b7 /* Attach source field must exist */);\n\t\t\t\tassert(\n\t\t\t\t\tsourceField.length === count,\n\t\t\t\t\t0x7b8 /* Attach must consume all nodes in source field */,\n\t\t\t\t);\n\t\t\t\t// TODO: this will fail for very large insertions due to argument limits.\n\t\t\t\tcurrentField.splice(destination, 0, ...sourceField);\n\t\t\t\tthis.forest.delete(source);\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\tconst [parent, key] = cursor.getParent();\n\t\t\t\tassert(\n\t\t\t\t\tdestination === undefined ||\n\t\t\t\t\t\tparent !== this.forest.roots ||\n\t\t\t\t\t\tkey !== destination,\n\t\t\t\t\t0x7b9 /* Detach destination field must be different from current field */,\n\t\t\t\t);\n\t\t\t\tconst currentField = getMapTreeField(parent, key, true);\n\t\t\t\tassertValidRange(source, currentField);\n\t\t\t\tconst content = currentField.splice(source.start, source.end - source.start);\n\t\t\t\tif (destination !== undefined) {\n\t\t\t\t\tthis.forest.addFieldAsDetached(content, destination);\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 (currentField.length === 0) {\n\t\t\t\t\tparent.fields.delete(key);\n\t\t\t\t}\n\t\t\t},\n\t\t\treplace(\n\t\t\t\tnewContentSource: FieldKey,\n\t\t\t\trange: Range,\n\t\t\t\toldContentDestination: FieldKey,\n\t\t\t): void {\n\t\t\t\tassert(\n\t\t\t\t\tnewContentSource !== oldContentDestination,\n\t\t\t\t\t0x7ba /* Replace detached source field and detached destination field must be different */,\n\t\t\t\t);\n\t\t\t\tthis.detachEdit(range, oldContentDestination);\n\t\t\t\tthis.attachEdit(newContentSource, range.end - range.start, range.start);\n\t\t\t},\n\t\t\tenterNode(index: number): void {\n\t\t\t\tthis.cursor.enterNode(index);\n\t\t\t},\n\t\t\texitNode(index: number): void {\n\t\t\t\tthis.cursor.exitNode();\n\t\t\t},\n\t\t\tenterField(key: FieldKey): void {\n\t\t\t\tthis.cursor.enterField(key);\n\t\t\t},\n\t\t\texitField(key: FieldKey): void {\n\t\t\t\tthis.cursor.exitField();\n\t\t\t},\n\t\t};\n\t\tthis.activeVisitor = visitor;\n\t\treturn visitor;\n\t}\n\n\tprivate nextRange = 0;\n\tpublic newDetachedField(): DetachedField {\n\t\tconst range: DetachedField = brand(String(this.nextRange));\n\t\tthis.nextRange += 1;\n\t\treturn range;\n\t}\n\n\tprivate add(nodes: Iterable<ITreeCursor>, key: FieldKey): void {\n\t\tconst field: ObjectField = Array.from(nodes, mapTreeFromCursor);\n\t\tthis.addFieldAsDetached(field, key);\n\t}\n\n\tprivate addFieldAsDetached(field: ObjectField, key: FieldKey): void {\n\t\tassert(!this.roots.fields.has(key), 0x370 /* new range must not already exist */);\n\t\tif (field.length > 0) {\n\t\t\tthis.roots.fields.set(key, field);\n\t\t}\n\t}\n\n\tprivate delete(field: FieldKey): void {\n\t\tthis.roots.fields.delete(field);\n\t}\n\n\tpublic allocateCursor(): Cursor {\n\t\treturn new Cursor(this);\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\tif (destination.parent === undefined) {\n\t\t\tthis.moveCursorToPath(undefined, cursorToMove);\n\t\t} else {\n\t\t\tconst result = this.tryMoveCursorToNode(destination.parent, cursorToMove);\n\t\t\tif (result !== TreeNavigationResult.Ok) {\n\t\t\t\treturn result;\n\t\t\t}\n\t\t}\n\t\tcursorToMove.enterField(destination.fieldKey);\n\t\treturn TreeNavigationResult.Ok;\n\t}\n\n\tpublic moveCursorToPath(\n\t\tdestination: UpPath | undefined,\n\t\tcursorToMove: ITreeSubscriptionCursor,\n\t): void {\n\t\tassert(\n\t\t\tcursorToMove instanceof Cursor,\n\t\t\t0x337 /* ObjectForest must only be given its own Cursor type */,\n\t\t);\n\t\tassert(\n\t\t\tcursorToMove.forest === this,\n\t\t\t0x338 /* ObjectForest 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.setToAboveDetachedSequences();\n\t\twhile (keyStack.length > 0) {\n\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\tcursorToMove.enterField(keyStack.pop()!);\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\n\t\treturn;\n\t}\n\n\tpublic getCursorAboveDetachedFields(): ITreeCursorSynchronous {\n\t\treturn cursorForMapTreeNode(this.roots);\n\t}\n}\n\ntype ObjectField = MapTree[];\n\n/**\n * Cursor implementation for ObjectForest.\n */\nclass Cursor extends SynchronousCursor implements ITreeSubscriptionCursor {\n\tpublic state: ITreeSubscriptionCursorState;\n\n\t/**\n\t * @param forest - forest this cursor navigates\n\t * @param innerCursor - underlying cursor implementation this wraps. `undefined` when state is not `Current`\n\t */\n\tpublic constructor(\n\t\tpublic readonly forest: ObjectForest,\n\t\tprivate innerCursor?: CursorWithNode<MapTree>,\n\t) {\n\t\tsuper();\n\t\tif (innerCursor === undefined) {\n\t\t\tthis.state = ITreeSubscriptionCursorState.Cleared;\n\t\t} else {\n\t\t\tthis.state = ITreeSubscriptionCursorState.Current;\n\t\t\tthis.forest.currentCursors.add(this);\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\tpublic getFieldPath(prefix?: PathRootPrefix): FieldUpPath {\n\t\tassert(this.innerCursor !== undefined, 0x45f /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.getFieldPath(prefix);\n\t}\n\tpublic get mode(): CursorLocationType {\n\t\tassert(this.innerCursor !== undefined, 0x42e /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.mode;\n\t}\n\n\tpublic nextField(): boolean {\n\t\tassert(this.innerCursor !== undefined, 0x42f /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.nextField();\n\t}\n\tpublic exitField(): void {\n\t\tassert(this.innerCursor !== undefined, 0x430 /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.exitField();\n\t}\n\tpublic override skipPendingFields(): boolean {\n\t\tassert(this.innerCursor !== undefined, 0x431 /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.skipPendingFields();\n\t}\n\tpublic getFieldKey(): FieldKey {\n\t\tassert(this.innerCursor !== undefined, 0x432 /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.getFieldKey();\n\t}\n\tpublic getFieldLength(): number {\n\t\tassert(this.innerCursor !== undefined, 0x433 /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.getFieldLength();\n\t}\n\tpublic firstNode(): boolean {\n\t\tassert(this.innerCursor !== undefined, 0x434 /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.firstNode();\n\t}\n\tpublic enterNode(childIndex: number): void {\n\t\tassert(this.innerCursor !== undefined, 0x435 /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.enterNode(childIndex);\n\t}\n\tpublic getPath(prefix?: PathRootPrefix): UpPath {\n\t\tassert(this.innerCursor !== undefined, 0x436 /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.getPath(prefix) ?? fail(\"no path when at root\");\n\t}\n\tpublic get fieldIndex(): number {\n\t\tassert(this.innerCursor !== undefined, 0x437 /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.fieldIndex;\n\t}\n\tpublic get chunkStart(): number {\n\t\tassert(this.innerCursor !== undefined, 0x438 /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.chunkStart;\n\t}\n\tpublic get chunkLength(): number {\n\t\tassert(this.innerCursor !== undefined, 0x439 /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.chunkLength;\n\t}\n\tpublic seekNodes(offset: number): boolean {\n\t\tassert(this.innerCursor !== undefined, 0x43a /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.seekNodes(offset);\n\t}\n\tpublic nextNode(): boolean {\n\t\tassert(this.innerCursor !== undefined, 0x43b /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.nextNode();\n\t}\n\tpublic exitNode(): void {\n\t\tassert(this.innerCursor !== undefined, 0x43c /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.exitNode();\n\t}\n\tpublic firstField(): boolean {\n\t\tassert(this.innerCursor !== undefined, 0x43d /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.firstField();\n\t}\n\tpublic enterField(key: FieldKey): void {\n\t\tassert(this.innerCursor !== undefined, 0x43e /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.enterField(key);\n\t}\n\tpublic get type(): TreeNodeSchemaIdentifier {\n\t\tassert(this.innerCursor !== undefined, 0x43f /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.type;\n\t}\n\tpublic get value(): Value {\n\t\tassert(this.innerCursor !== undefined, 0x440 /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.value;\n\t}\n\n\t// TODO: tests for clear when not at root.\n\tpublic clear(): void {\n\t\tassert(\n\t\t\tthis.state !== ITreeSubscriptionCursorState.Freed,\n\t\t\t0x33b /* Cursor must not be freed */,\n\t\t);\n\t\tthis.state = ITreeSubscriptionCursorState.Cleared;\n\t\tthis.innerCursor = undefined;\n\t\tthis.forest.currentCursors.delete(this);\n\t}\n\n\t/**\n\t * Move this cursor to the special dummy node above the detached sequences.\n\t * Can be used when cleared (but not freed).\n\t */\n\tpublic setToAboveDetachedSequences(): void {\n\t\tassert(\n\t\t\tthis.state !== ITreeSubscriptionCursorState.Freed,\n\t\t\t0x33c /* Cursor must not be freed */,\n\t\t);\n\t\tthis.clear();\n\t\tthis.state = ITreeSubscriptionCursorState.Current;\n\t\tthis.innerCursor = cursorForMapTreeNode(this.forest.roots);\n\t\tthis.forest.currentCursors.add(this);\n\t}\n\n\tpublic getNode(): MapTree {\n\t\tassert(this.innerCursor !== undefined, 0x33e /* Cursor must be current to be used */);\n\t\treturn this.innerCursor.getNode();\n\t}\n\n\tpublic getParent(): [MapTree, FieldKey] {\n\t\tassert(this.innerCursor !== undefined, 0x441 /* Cursor must be current to be used */);\n\t\t// This could be optimized to skip moving it accessing internals of cursor.\n\t\tconst key = this.innerCursor.getFieldKey();\n\t\tthis.innerCursor.exitField();\n\t\tconst node = this.innerCursor.getNode();\n\t\tthis.innerCursor.enterField(key);\n\t\treturn [node, key];\n\t}\n\n\tpublic fork(): ITreeSubscriptionCursor {\n\t\tassert(this.innerCursor !== undefined, 0x460 /* Cursor must be current to be used */);\n\t\treturn new Cursor(this.forest, this.innerCursor.fork());\n\t}\n\n\tpublic free(): void {\n\t\tassert(\n\t\t\tthis.state !== ITreeSubscriptionCursorState.Freed,\n\t\t\t0x33f /* Cursor must not be double freed */,\n\t\t);\n\t\tthis.forest.currentCursors.delete(this);\n\t\tthis.state = ITreeSubscriptionCursorState.Freed;\n\t}\n\n\tpublic buildAnchor(): Anchor {\n\t\tassert(\n\t\t\tthis.state === ITreeSubscriptionCursorState.Current,\n\t\t\t0x37a /* Cursor must be current to be used */,\n\t\t);\n\t\treturn this.forest.anchors.track(this.getPath());\n\t}\n}\n\n// This function is the folder level export for objectForest, and hides all the implementation types.\n// When other forest implementations are created (ex: optimized ones),\n// this function should likely be moved and updated to (at least conditionally) use them.\n/**\n * @returns an implementation of {@link IEditableForest} with no data or schema.\n */\nexport function buildForest(anchors?: AnchorSet): ObjectForest {\n\treturn new ObjectForest(anchors);\n}\n"]}

package/dist/feature-libraries/optional-field/index.d.ts

@@ -0,0 +1,8 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { noChangeCodecFamily, makeOptionalFieldCodecFamily } from "./optionalFieldCodecs";
+export { OptionalChangeset, RegisterId } from "./optionalFieldChangeTypes";
+export { optionalChangeHandler, optionalFieldEditor, optionalChangeRebaser, optionalFieldIntoDelta, } from "./optionalField";
+//# sourceMappingURL=index.d.ts.map

package/dist/feature-libraries/optional-field/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/optional-field/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,mBAAmB,EAAE,4BAA4B,EAAE,MAAM,uBAAuB,CAAC;AAC1F,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAC3E,OAAO,EACN,qBAAqB,EACrB,mBAAmB,EACnB,qBAAqB,EACrB,sBAAsB,GACtB,MAAM,iBAAiB,CAAC"}

package/dist/feature-libraries/optional-field/index.js

@@ -0,0 +1,16 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.optionalFieldIntoDelta = exports.optionalChangeRebaser = exports.optionalFieldEditor = exports.optionalChangeHandler = exports.makeOptionalFieldCodecFamily = exports.noChangeCodecFamily = void 0;
+var optionalFieldCodecs_1 = require("./optionalFieldCodecs");
+Object.defineProperty(exports, "noChangeCodecFamily", { enumerable: true, get: function () { return optionalFieldCodecs_1.noChangeCodecFamily; } });
+Object.defineProperty(exports, "makeOptionalFieldCodecFamily", { enumerable: true, get: function () { return optionalFieldCodecs_1.makeOptionalFieldCodecFamily; } });
+var optionalField_1 = require("./optionalField");
+Object.defineProperty(exports, "optionalChangeHandler", { enumerable: true, get: function () { return optionalField_1.optionalChangeHandler; } });
+Object.defineProperty(exports, "optionalFieldEditor", { enumerable: true, get: function () { return optionalField_1.optionalFieldEditor; } });
+Object.defineProperty(exports, "optionalChangeRebaser", { enumerable: true, get: function () { return optionalField_1.optionalChangeRebaser; } });
+Object.defineProperty(exports, "optionalFieldIntoDelta", { enumerable: true, get: function () { return optionalField_1.optionalFieldIntoDelta; } });
+//# sourceMappingURL=index.js.map

package/dist/feature-libraries/optional-field/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/feature-libraries/optional-field/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,6DAA0F;AAAjF,0HAAA,mBAAmB,OAAA;AAAE,mIAAA,4BAA4B,OAAA;AAE1D,iDAKyB;AAJxB,sHAAA,qBAAqB,OAAA;AACrB,oHAAA,mBAAmB,OAAA;AACnB,sHAAA,qBAAqB,OAAA;AACrB,uHAAA,sBAAsB,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport { noChangeCodecFamily, makeOptionalFieldCodecFamily } from \"./optionalFieldCodecs\";\nexport { OptionalChangeset, RegisterId } from \"./optionalFieldChangeTypes\";\nexport {\n\toptionalChangeHandler,\n\toptionalFieldEditor,\n\toptionalChangeRebaser,\n\toptionalFieldIntoDelta,\n} from \"./optionalField\";\n"]}

package/dist/feature-libraries/optional-field/optionalField.d.ts

@@ -0,0 +1,31 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { TaggedChange, ChangesetLocalId, DeltaFieldChanges } from "../../core";
+import { ToDelta, FieldChangeRebaser, FieldEditor, FieldChangeHandler } from "../modular-schema";
+import { OptionalChangeset } from "./optionalFieldChangeTypes";
+export declare const optionalChangeRebaser: FieldChangeRebaser<OptionalChangeset>;
+export interface OptionalFieldEditor extends FieldEditor<OptionalChangeset> {
+    /**
+     * Creates a change which replaces the field with `newContent`
+     * @param newContent - the new content for the field
+     * @param wasEmpty - whether the field is empty when creating this change
+     * @param changeId - the ID associated with the replacement of the current content.
+     * @param buildId - the ID associated with the creation of the `newContent`.
+     */
+    set(wasEmpty: boolean, ids: {
+        fill: ChangesetLocalId;
+        detach: ChangesetLocalId;
+    }): OptionalChangeset;
+    /**
+     * Creates a change which clears the field's contents (if any).
+     * @param wasEmpty - whether the field is empty when creating this change
+     * @param changeId - the ID associated with the detach.
+     */
+    clear(wasEmpty: boolean, id: ChangesetLocalId): OptionalChangeset;
+}
+export declare const optionalFieldEditor: OptionalFieldEditor;
+export declare function optionalFieldIntoDelta({ change, revision }: TaggedChange<OptionalChangeset>, deltaFromChild: ToDelta): DeltaFieldChanges;
+export declare const optionalChangeHandler: FieldChangeHandler<OptionalChangeset, OptionalFieldEditor>;
+//# sourceMappingURL=optionalField.d.ts.map

package/dist/feature-libraries/optional-field/optionalField.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"optionalField.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/optional-field/optionalField.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACN,YAAY,EAEZ,gBAAgB,EAIhB,iBAAiB,EAKjB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACN,OAAO,EACP,kBAAkB,EAKlB,WAAW,EAIX,kBAAkB,EAGlB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EAAc,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAuH3E,eAAO,MAAM,qBAAqB,EAAE,kBAAkB,CAAC,iBAAiB,CAySvE,CAAC;AAEF,MAAM,WAAW,mBAAoB,SAAQ,WAAW,CAAC,iBAAiB,CAAC;IAC1E;;;;;;OAMG;IACH,GAAG,CACF,QAAQ,EAAE,OAAO,EACjB,GAAG,EAAE;QACJ,IAAI,EAAE,gBAAgB,CAAC;QACvB,MAAM,EAAE,gBAAgB,CAAC;KACzB,GACC,iBAAiB,CAAC;IAErB;;;;OAIG;IACH,KAAK,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,gBAAgB,GAAG,iBAAiB,CAAC;CAClE;AAED,eAAO,MAAM,mBAAmB,EAAE,mBAoCjC,CAAC;AAEF,wBAAgB,sBAAsB,CACrC,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,YAAY,CAAC,iBAAiB,CAAC,EACrD,cAAc,EAAE,OAAO,GACrB,iBAAiB,CAuDnB;AAED,eAAO,MAAM,qBAAqB,EAAE,kBAAkB,CAAC,iBAAiB,EAAE,mBAAmB,CAU5F,CAAC"}