@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/dist/feature-libraries/flex-tree/lazyField.js

@@ -0,0 +1,341 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LazyForbiddenField = exports.LazyNodeKeyField = exports.LazyOptionalField = exports.LazyValueField = exports.LazySequence = exports.LazyField = exports.makeField = void 0;
+const core_utils_1 = require("@fluidframework/core-utils");
+const core_1 = require("../../core");
+// TODO: stop depending on contextuallyTyped
+const contextuallyTyped_1 = require("../contextuallyTyped");
+const default_schema_1 = require("../default-schema");
+const util_1 = require("../../util");
+const node_key_1 = require("../node-key");
+const mapTreeCursor_1 = require("../mapTreeCursor");
+const flexTreeTypes_1 = require("./flexTreeTypes");
+const lazyNode_1 = require("./lazyNode");
+const lazyEntity_1 = require("./lazyEntity");
+const unboxed_1 = require("./unboxed");
+const utilities_1 = require("./utilities");
+/**
+ * Indexing for {@link LazyField.at} and {@link LazyField.boxedAt} supports the
+ * usage of negative indices, which regular indexing using `[` and `]` does not.
+ *
+ * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at
+ * for additional context on the semantics.
+ *
+ * @returns A positive index that can be used in regular indexing. Returns
+ * undefined if that index would be out-of-bounds.
+ */
+function indexForAt(index, length) {
+    let finalIndex = Math.trunc(+index);
+    if (isNaN(finalIndex)) {
+        finalIndex = 0;
+    }
+    if (finalIndex < -length || finalIndex >= length) {
+        return undefined;
+    }
+    if (finalIndex < 0) {
+        finalIndex = finalIndex + length;
+    }
+    return finalIndex;
+}
+function makeField(context, schema, cursor) {
+    const fieldAnchor = cursor.buildFieldAnchor();
+    const field = new (kindToClass.get(schema.kind) ?? (0, util_1.fail)("missing field implementation"))(context, schema, cursor, fieldAnchor);
+    // Fields currently live as long as their parent does.
+    // For root fields, this means forever, but other cases can be cleaned up when their parent anchor is deleted.
+    if (fieldAnchor.parent !== undefined) {
+        const anchorNode = context.forest.anchors.locate(fieldAnchor.parent) ??
+            (0, util_1.fail)("parent anchor node should always exist since field is under a node");
+        anchorNode.on("afterDestroy", () => {
+            field[util_1.disposeSymbol]();
+        });
+    }
+    return field;
+}
+exports.makeField = makeField;
+/**
+ * A Proxy target, which together with a `fieldProxyHandler` implements a basic access to
+ * the nodes of {@link EditableField} by means of the cursors.
+ */
+class LazyField extends lazyEntity_1.LazyEntity {
+    get [flexTreeTypes_1.flexTreeMarker]() {
+        return flexTreeTypes_1.FlexTreeEntityKind.Field;
+    }
+    constructor(context, schema, cursor, fieldAnchor) {
+        super(context, schema, cursor, fieldAnchor);
+        (0, core_utils_1.assert)(cursor.mode === 1 /* CursorLocationType.Fields */, 0x77b /* must be in fields mode */);
+        this.key = cursor.getFieldKey();
+        (0, lazyEntity_1.makePropertyNotEnumerable)(this, "key");
+    }
+    is(schema) {
+        (0, core_utils_1.assert)(this.context.schema.policy.fieldKinds.get(schema.kind.identifier) === schema.kind, 0x77c /* Narrowing must be done to a kind that exists in this context */);
+        return this.schema.equals(schema);
+    }
+    isSameAs(other) {
+        (0, core_utils_1.assert)(other.context === this.context, 0x77d /* Content from different editable trees should not be used together */);
+        return this.key === other.key && this.parent === other.parent;
+    }
+    get parent() {
+        if (this[lazyEntity_1.anchorSymbol].parent === undefined) {
+            return undefined;
+        }
+        const cursor = this[lazyEntity_1.cursorSymbol];
+        cursor.exitField();
+        const output = (0, lazyNode_1.makeTree)(this.context, cursor);
+        cursor.enterField(this.key);
+        return output;
+    }
+    [lazyEntity_1.tryMoveCursorToAnchorSymbol](anchor, cursor) {
+        return this.context.forest.tryMoveCursorToField(anchor, cursor);
+    }
+    [lazyEntity_1.forgetAnchorSymbol](anchor) {
+        if (anchor.parent === undefined)
+            return;
+        this.context.forest.anchors.forget(anchor.parent);
+    }
+    get length() {
+        return this[lazyEntity_1.cursorSymbol].getFieldLength();
+    }
+    atIndex(index) {
+        return (0, core_1.inCursorNode)(this[lazyEntity_1.cursorSymbol], index, (cursor) => (0, unboxed_1.unboxedUnion)(this.context, this.schema, cursor));
+    }
+    boxedAt(index) {
+        const finalIndex = indexForAt(index, this.length);
+        if (finalIndex === undefined) {
+            return undefined;
+        }
+        return (0, core_1.inCursorNode)(this[lazyEntity_1.cursorSymbol], finalIndex, (cursor) => (0, lazyNode_1.makeTree)(this.context, cursor));
+    }
+    map(callbackfn) {
+        return Array.from(this, callbackfn);
+    }
+    mapBoxed(callbackfn) {
+        return Array.from(this[flexTreeTypes_1.boxedIterator](), callbackfn);
+    }
+    [flexTreeTypes_1.boxedIterator]() {
+        return (0, core_1.iterateCursorField)(this[lazyEntity_1.cursorSymbol], (cursor) => (0, lazyNode_1.makeTree)(this.context, cursor));
+    }
+    [Symbol.iterator]() {
+        return (0, core_1.iterateCursorField)(this[lazyEntity_1.cursorSymbol], (cursor) => (0, unboxed_1.unboxedUnion)(this.context, this.schema, cursor));
+    }
+    treeStatus() {
+        if (this[lazyEntity_1.isFreedSymbol]()) {
+            return flexTreeTypes_1.TreeStatus.Deleted;
+        }
+        const fieldAnchor = this[lazyEntity_1.anchorSymbol];
+        const parentAnchor = fieldAnchor.parent;
+        // If the parentAnchor is undefined it is a detached field.
+        if (parentAnchor === undefined) {
+            return (0, utilities_1.treeStatusFromDetachedField)((0, core_1.keyAsDetachedField)(fieldAnchor.fieldKey));
+        }
+        const parentAnchorNode = this.context.forest.anchors.locate(parentAnchor);
+        // As the "parentAnchor === undefined" case is handled above, parentAnchorNode should exist.
+        (0, core_utils_1.assert)(parentAnchorNode !== undefined, 0x77e /* parentAnchorNode must exist. */);
+        return (0, utilities_1.treeStatusFromAnchorCache)(this.context.forest.anchors, parentAnchorNode);
+    }
+    getFieldPath() {
+        return this[lazyEntity_1.cursorSymbol].getFieldPath();
+    }
+    /**
+     * Returns the path to this field to use for editing. Throws iff this path is not {@link TreeStatus#InDocument}.
+     * This path is not valid to hold onto across edits: this must be recalled for each edit.
+     */
+    getFieldPathForEditing() {
+        (0, core_utils_1.assert)(this.treeStatus() === flexTreeTypes_1.TreeStatus.InDocument, 0x77f /* Editing only allowed on fields with TreeStatus.InDocument status */);
+        return this.getFieldPath();
+    }
+}
+exports.LazyField = LazyField;
+class LazySequence extends LazyField {
+    constructor(context, schema, cursor, fieldAnchor) {
+        super(context, schema, cursor, fieldAnchor);
+        (0, lazyEntity_1.makePropertyEnumerableOwn)(this, "asArray", LazySequence.prototype);
+    }
+    at(index) {
+        const finalIndex = indexForAt(index, this.length);
+        if (finalIndex === undefined) {
+            return undefined;
+        }
+        return (0, core_1.inCursorNode)(this[lazyEntity_1.cursorSymbol], finalIndex, (cursor) => (0, unboxed_1.unboxedUnion)(this.context, this.schema, cursor));
+    }
+    get asArray() {
+        return this.map((x) => x);
+    }
+    sequenceEditor() {
+        const fieldPath = this.getFieldPathForEditing();
+        const fieldEditor = this.context.editor.sequenceField(fieldPath);
+        return fieldEditor;
+    }
+    insertAt(index, value) {
+        (0, util_1.assertValidIndex)(index, this, true);
+        const content = (0, core_1.isCursor)(value)
+            ? prepareFieldCursorForInsert(value)
+            : Array.from(value, (item) => (0, contextuallyTyped_1.cursorFromContextualData)(this.context, this.schema.allowedTypeSet, item));
+        const fieldEditor = this.sequenceEditor();
+        fieldEditor.insert(index, content);
+    }
+    insertAtStart(value) {
+        this.insertAt(0, value);
+    }
+    insertAtEnd(value) {
+        this.insertAt(this.length, value);
+    }
+    removeAt(index) {
+        const fieldEditor = this.sequenceEditor();
+        fieldEditor.delete(index, 1);
+    }
+    removeRange(start, end) {
+        const fieldEditor = this.sequenceEditor();
+        const { length } = this;
+        const removeStart = start ?? 0;
+        const removeEnd = Math.min(length, end ?? length);
+        (0, util_1.assertValidRangeIndices)(removeStart, removeEnd, this);
+        fieldEditor.delete(removeStart, removeEnd - removeStart);
+    }
+    moveToStart(sourceIndex, source) {
+        this._moveRangeToIndex(0, sourceIndex, sourceIndex + 1, source);
+    }
+    moveToEnd(sourceIndex, source) {
+        this._moveRangeToIndex(this.length, sourceIndex, sourceIndex + 1, source);
+    }
+    moveToIndex(index, sourceIndex, source) {
+        this._moveRangeToIndex(index, sourceIndex, sourceIndex + 1, source);
+    }
+    moveRangeToStart(sourceStart, sourceEnd, source) {
+        this._moveRangeToIndex(0, sourceStart, sourceEnd, source);
+    }
+    moveRangeToEnd(sourceStart, sourceEnd, source) {
+        this._moveRangeToIndex(this.length, sourceStart, sourceEnd, source);
+    }
+    moveRangeToIndex(index, sourceStart, sourceEnd, source) {
+        this._moveRangeToIndex(index, sourceStart, sourceEnd, source);
+    }
+    _moveRangeToIndex(index, sourceStart, sourceEnd, source) {
+        const sourceField = source !== undefined ? (this.isSameAs(source) ? this : source) : this;
+        // TODO: determine support for move across different sequence types
+        (0, core_utils_1.assert)(sourceField instanceof LazySequence, 0x7b1 /* Unsupported sequence implementation. */);
+        (0, util_1.assertValidRangeIndices)(sourceStart, sourceEnd, sourceField);
+        if (this.schema.types !== undefined && sourceField !== this) {
+            for (let i = sourceStart; i < sourceEnd; i++) {
+                const sourceNode = sourceField.boxedAt(sourceStart) ?? (0, util_1.fail)("impossible out of bounds index");
+                if (!this.schema.types.has(sourceNode.schema.name)) {
+                    throw new Error("Type in source sequence is not allowed in destination.");
+                }
+            }
+        }
+        const movedCount = sourceEnd - sourceStart;
+        (0, util_1.assertValidIndex)(index, this, true);
+        const sourceFieldPath = sourceField.getFieldPath();
+        const destinationFieldPath = this.getFieldPath();
+        this.context.editor.move(sourceFieldPath, sourceStart, movedCount, destinationFieldPath, index);
+    }
+}
+exports.LazySequence = LazySequence;
+class LazyValueField extends LazyField {
+    constructor(context, schema, cursor, fieldAnchor) {
+        super(context, schema, cursor, fieldAnchor);
+        (0, lazyEntity_1.makePropertyEnumerableOwn)(this, "content", LazyValueField.prototype);
+    }
+    valueFieldEditor() {
+        const fieldPath = this.getFieldPathForEditing();
+        const fieldEditor = this.context.editor.valueField(fieldPath);
+        return fieldEditor;
+    }
+    get content() {
+        return this.atIndex(0);
+    }
+    set content(newContent) {
+        const content = (0, core_1.isCursor)(newContent)
+            ? prepareNodeCursorForInsert(newContent)
+            : [(0, contextuallyTyped_1.cursorFromContextualData)(this.context, this.schema.allowedTypeSet, newContent)];
+        const fieldEditor = this.valueFieldEditor();
+        (0, core_utils_1.assert)(content.length === 1, 0x780 /* value field content should normalize to one item */);
+        fieldEditor.set(content[0]);
+    }
+    get boxedContent() {
+        return this.boxedAt(0) ?? (0, util_1.fail)("value node must have 1 item");
+    }
+}
+exports.LazyValueField = LazyValueField;
+class LazyOptionalField extends LazyField {
+    constructor(context, schema, cursor, fieldAnchor) {
+        super(context, schema, cursor, fieldAnchor);
+        (0, lazyEntity_1.makePropertyEnumerableOwn)(this, "content", LazyOptionalField.prototype);
+    }
+    optionalEditor() {
+        const fieldPath = this.getFieldPathForEditing();
+        const fieldEditor = this.context.editor.optionalField(fieldPath);
+        return fieldEditor;
+    }
+    get content() {
+        return this.length === 0 ? undefined : this.atIndex(0);
+    }
+    set content(newContent) {
+        const content = newContent === undefined
+            ? []
+            : (0, core_1.isCursor)(newContent)
+                ? prepareNodeCursorForInsert(newContent)
+                : [(0, contextuallyTyped_1.cursorFromContextualData)(this.context, this.schema.allowedTypeSet, newContent)];
+        const fieldEditor = this.optionalEditor();
+        (0, core_utils_1.assert)(content.length <= 1, 0x781 /* optional field content should normalize at most one item */);
+        fieldEditor.set(content.length === 0 ? undefined : content[0], this.length === 0);
+    }
+    get boxedContent() {
+        return this.length === 0 ? undefined : this.boxedAt(0);
+    }
+}
+exports.LazyOptionalField = LazyOptionalField;
+class LazyNodeKeyField extends LazyField {
+    constructor(context, schema, cursor, fieldAnchor) {
+        super(context, schema, cursor, fieldAnchor);
+        (0, lazyEntity_1.makePropertyEnumerableOwn)(this, "stableNodeKey", LazyNodeKeyField.prototype);
+    }
+    get localNodeKey() {
+        // TODO: Optimize this to be a fast path that gets a LocalNodeKey directly from the
+        // forest rather than getting the StableNodeKey and the compressing it.
+        return this.context.nodeKeys.localize(this.stableNodeKey);
+    }
+    get stableNodeKey() {
+        const cursor = this[lazyEntity_1.cursorSymbol];
+        cursor.enterNode(0);
+        (0, core_utils_1.assert)(cursor.type === node_key_1.nodeKeyTreeIdentifier, 0x7b2 /* invalid node key type */);
+        const stableKey = cursor.value;
+        (0, core_utils_1.assert)(typeof stableKey === "string", 0x7b3 /* invalid node key type */);
+        cursor.exitNode();
+        return (0, util_1.brand)(stableKey);
+    }
+}
+exports.LazyNodeKeyField = LazyNodeKeyField;
+class LazyForbiddenField extends LazyField {
+}
+exports.LazyForbiddenField = LazyForbiddenField;
+const builderList = [
+    [default_schema_1.FieldKinds.forbidden, LazyForbiddenField],
+    [default_schema_1.FieldKinds.nodeKey, LazyNodeKeyField],
+    [default_schema_1.FieldKinds.optional, LazyOptionalField],
+    [default_schema_1.FieldKinds.sequence, LazySequence],
+    [default_schema_1.FieldKinds.required, LazyValueField],
+];
+const kindToClass = new Map(builderList);
+/**
+ * Prepare a fields cursor (holding a sequence of nodes) for inserting.
+ */
+function prepareFieldCursorForInsert(cursor) {
+    // TODO: optionally validate content against schema.
+    // Convert from the desired API (single field cursor) to the currently required API (array of node cursors).
+    // This is inefficient, and particularly bad if the data was efficiently chunked using uniform chunks.
+    // TODO: update editing APIs to take in field cursors not arrays of node cursors, then remove this copying conversion.
+    return (0, core_1.mapCursorField)(cursor, () => (0, mapTreeCursor_1.cursorForMapTreeNode)((0, mapTreeCursor_1.mapTreeFromCursor)(cursor)));
+}
+/**
+ * Prepare a node cursor (holding a single node) for inserting.
+ */
+function prepareNodeCursorForInsert(cursor) {
+    // TODO: optionally validate content against schema.
+    (0, core_utils_1.assert)(cursor.mode === 0 /* CursorLocationType.Nodes */, 0x805 /* should be in nodes mode */);
+    return [cursor];
+}
+//# sourceMappingURL=lazyField.js.map

package/dist/feature-libraries/flex-tree/lazyField.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lazyField.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/lazyField.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AAEpD,qCAaoB;AAEpB,4CAA4C;AAC5C,4DAAgE;AAChE,sDAK2B;AAC3B,qCAAmG;AAEnG,0CAAiF;AACjF,oDAA2E;AAE3E,mDAgByB;AACzB,yCAAsC;AACtC,6CASsB;AACtB,uCAAyC;AACzC,2CAAqF;AAErF;;;;;;;;;GASG;AACH,SAAS,UAAU,CAAC,KAAa,EAAE,MAAc;IAChD,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,KAAK,CAAC,UAAU,CAAC,EAAE;QACtB,UAAU,GAAG,CAAC,CAAC;KACf;IACD,IAAI,UAAU,GAAG,CAAC,MAAM,IAAI,UAAU,IAAI,MAAM,EAAE;QACjD,OAAO,SAAS,CAAC;KACjB;IACD,IAAI,UAAU,GAAG,CAAC,EAAE;QACnB,UAAU,GAAG,UAAU,GAAG,MAAM,CAAC;KACjC;IACD,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,SAAgB,SAAS,CACxB,OAAgB,EAChB,MAAuB,EACvB,MAA+B;IAE/B,MAAM,WAAW,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;IAE9C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,IAAA,WAAI,EAAC,8BAA8B,CAAC,CAAC,CACvF,OAAO,EACP,MAAM,EACN,MAAM,EACN,WAAW,CACX,CAAC;IAEF,sDAAsD;IACtD,8GAA8G;IAC9G,IAAI,WAAW,CAAC,MAAM,KAAK,SAAS,EAAE;QACrC,MAAM,UAAU,GACf,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;YACjD,IAAA,WAAI,EAAC,oEAAoE,CAAC,CAAC;QAC5E,UAAU,CAAC,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YAClC,KAAK,CAAC,oBAAa,CAAC,EAAE,CAAC;QACxB,CAAC,CAAC,CAAC;KACH;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAzBD,8BAyBC;AAED;;;GAGG;AACH,MAAsB,SACrB,SAAQ,uBAAuD;IAG/D,IAAW,CAAC,8BAAc,CAAC;QAC1B,OAAO,kCAAkB,CAAC,KAAK,CAAC;IACjC,CAAC;IAGD,YACC,OAAgB,EAChB,MAAsC,EACtC,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QAC5C,IAAA,mBAAM,EAAC,MAAM,CAAC,IAAI,sCAA8B,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACtF,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;QAEhC,IAAA,sCAAyB,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACxC,CAAC;IAEM,EAAE,CACR,MAAe;QAEf,IAAA,mBAAM,EACL,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,MAAM,CAAC,IAAI,EACjF,KAAK,CAAC,kEAAkE,CACxE,CAAC;QAEF,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAEM,QAAQ,CAAC,KAAoB;QACnC,IAAA,mBAAM,EACL,KAAK,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO,EAC9B,KAAK,CAAC,uEAAuE,CAC7E,CAAC;QACF,OAAO,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC;IAC/D,CAAC;IAED,IAAW,MAAM;QAChB,IAAI,IAAI,CAAC,yBAAY,CAAC,CAAC,MAAM,KAAK,SAAS,EAAE;YAC5C,OAAO,SAAS,CAAC;SACjB;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAY,CAAC,CAAC;QAClC,MAAM,CAAC,SAAS,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,IAAA,mBAAQ,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC9C,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,OAAO,MAAM,CAAC;IACf,CAAC;IAEkB,CAAC,wCAA2B,CAAC,CAC/C,MAAmB,EACnB,MAA+B;QAE/B,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjE,CAAC;IAEkB,CAAC,+BAAkB,CAAC,CAAC,MAAmB;QAC1D,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS;YAAE,OAAO;QACxC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACnD,CAAC;IAED,IAAW,MAAM;QAChB,OAAO,IAAI,CAAC,yBAAY,CAAC,CAAC,cAAc,EAAE,CAAC;IAC5C,CAAC;IAEM,OAAO,CAAC,KAAa;QAC3B,OAAO,IAAA,mBAAY,EAAC,IAAI,CAAC,yBAAY,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,EAAE,CACzD,IAAA,sBAAY,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAC/C,CAAC;IACH,CAAC;IAEM,OAAO,CAAC,KAAa;QAC3B,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAElD,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,OAAO,SAAS,CAAC;SACjB;QAED,OAAO,IAAA,mBAAY,EAAC,IAAI,CAAC,yBAAY,CAAC,EAAE,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE,CAC9D,IAAA,mBAAQ,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CACe,CAAC;IAChD,CAAC;IAEM,GAAG,CAAI,UAAuE;QACpF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACrC,CAAC;IAEM,QAAQ,CACd,UAAuE;QAEvE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,6BAAa,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IACtD,CAAC;IAEM,CAAC,6BAAa,CAAC;QACrB,OAAO,IAAA,yBAAkB,EACxB,IAAI,CAAC,yBAAY,CAAC,EAClB,CAAC,MAAM,EAAE,EAAE,CAAC,IAAA,mBAAQ,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAA8C,CACvF,CAAC;IACH,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAA,yBAAkB,EAAC,IAAI,CAAC,yBAAY,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CACxD,IAAA,sBAAY,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAC/C,CAAC;IACH,CAAC;IAEM,UAAU;QAChB,IAAI,IAAI,CAAC,0BAAa,CAAC,EAAE,EAAE;YAC1B,OAAO,0BAAU,CAAC,OAAO,CAAC;SAC1B;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,yBAAY,CAAC,CAAC;QACvC,MAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC;QACxC,2DAA2D;QAC3D,IAAI,YAAY,KAAK,SAAS,EAAE;YAC/B,OAAO,IAAA,uCAA2B,EAAC,IAAA,yBAAkB,EAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC;SAC7E;QACD,MAAM,gBAAgB,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE1E,4FAA4F;QAC5F,IAAA,mBAAM,EAAC,gBAAgB,KAAK,SAAS,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACjF,OAAO,IAAA,qCAAyB,EAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;IACjF,CAAC;IAEM,YAAY;QAClB,OAAO,IAAI,CAAC,yBAAY,CAAC,CAAC,YAAY,EAAE,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACI,sBAAsB;QAC5B,IAAA,mBAAM,EACL,IAAI,CAAC,UAAU,EAAE,KAAK,0BAAU,CAAC,UAAU,EAC3C,KAAK,CAAC,sEAAsE,CAC5E,CAAC;QACF,OAAO,IAAI,CAAC,YAAY,EAAE,CAAC;IAC5B,CAAC;CACD;AA9ID,8BA8IC;AAED,MAAa,YACZ,SAAQ,SAA6C;IAGrD,YACC,OAAgB,EAChB,MAA2D,EAC3D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QAE5C,IAAA,sCAAyB,EAAC,IAAI,EAAE,SAAS,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC;IACpE,CAAC;IAEM,EAAE,CAAC,KAAa;QACtB,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAElD,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,OAAO,SAAS,CAAC;SACjB;QAED,OAAO,IAAA,mBAAY,EAAC,IAAI,CAAC,yBAAY,CAAC,EAAE,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE,CAC9D,IAAA,sBAAY,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAC/C,CAAC;IACH,CAAC;IACD,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IAEO,cAAc;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACjE,OAAO,WAAW,CAAC;IACpB,CAAC;IAEM,QAAQ,CAAC,KAAa,EAAE,KAAsC;QACpE,IAAA,uBAAgB,EAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,MAAM,OAAO,GAA6B,IAAA,eAAQ,EAAC,KAAK,CAAC;YACxD,CAAC,CAAC,2BAA2B,CAAC,KAAK,CAAC;YACpC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAC3B,IAAA,4CAAwB,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,CACvE,CAAC;QACL,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACpC,CAAC;IAEM,aAAa,CAAC,KAAsC;QAC1D,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACzB,CAAC;IAEM,WAAW,CAAC,KAAsC;QACxD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;IAEM,QAAQ,CAAC,KAAa;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IAEM,WAAW,CAAC,KAAc,EAAE,GAAY;QAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QACxB,MAAM,WAAW,GAAG,KAAK,IAAI,CAAC,CAAC;QAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,CAAC;QAClD,IAAA,8BAAuB,EAAC,WAAW,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QACtD,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,GAAG,WAAW,CAAC,CAAC;IAC1D,CAAC;IAIM,WAAW,CAAC,WAAmB,EAAE,MAA4C;QACnF,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,WAAW,EAAE,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACjE,CAAC;IAGM,SAAS,CAAC,WAAmB,EAAE,MAA4C;QACjF,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3E,CAAC;IAOM,WAAW,CACjB,KAAa,EACb,WAAmB,EACnB,MAA4C;QAE5C,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,WAAW,EAAE,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACrE,CAAC;IAQM,gBAAgB,CACtB,WAAmB,EACnB,SAAiB,EACjB,MAA4C;QAE5C,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IAC3D,CAAC;IAQM,cAAc,CACpB,WAAmB,EACnB,SAAiB,EACjB,MAA4C;QAE5C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IACrE,CAAC;IASM,gBAAgB,CACtB,KAAa,EACb,WAAmB,EACnB,SAAiB,EACjB,MAA4C;QAE5C,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IAC/D,CAAC;IAEO,iBAAiB,CACxB,KAAa,EACb,WAAmB,EACnB,SAAiB,EACjB,MAA4C;QAE5C,MAAM,WAAW,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAE1F,mEAAmE;QACnE,IAAA,mBAAM,EACL,WAAW,YAAY,YAAY,EACnC,KAAK,CAAC,0CAA0C,CAChD,CAAC;QACF,IAAA,8BAAuB,EAAC,WAAW,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;QAC7D,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,WAAW,KAAK,IAAI,EAAE;YAC5D,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;gBAC7C,MAAM,UAAU,GACf,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,IAAA,WAAI,EAAC,gCAAgC,CAAC,CAAC;gBAC5E,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;oBACnD,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;iBAC1E;aACD;SACD;QACD,MAAM,UAAU,GAAG,SAAS,GAAG,WAAW,CAAC;QAC3C,IAAA,uBAAgB,EAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,MAAM,eAAe,GAAG,WAAW,CAAC,YAAY,EAAE,CAAC;QACnD,MAAM,oBAAoB,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACjD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CACvB,eAAe,EACf,WAAW,EACX,UAAU,EACV,oBAAoB,EACpB,KAAK,CACL,CAAC;IACH,CAAC;CACD;AA5KD,oCA4KC;AAED,MAAa,cACZ,SAAQ,SAA6C;IAGrD,YACC,OAAgB,EAChB,MAA2D,EAC3D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QAE5C,IAAA,sCAAyB,EAAC,IAAI,EAAE,SAAS,EAAE,cAAc,CAAC,SAAS,CAAC,CAAC;IACtE,CAAC;IAEO,gBAAgB;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC9D,OAAO,WAAW,CAAC;IACpB,CAAC;IAED,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,IAAW,OAAO,CAAC,UAAuC;QACzD,MAAM,OAAO,GAA6B,IAAA,eAAQ,EAAC,UAAU,CAAC;YAC7D,CAAC,CAAC,0BAA0B,CAAC,UAAU,CAAC;YACxC,CAAC,CAAC,CAAC,IAAA,4CAAwB,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC,CAAC;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC5C,IAAA,mBAAM,EAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,sDAAsD,CAAC,CAAC;QAC3F,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,IAAW,YAAY;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,IAAA,WAAI,EAAC,6BAA6B,CAAC,CAAC;IAC/D,CAAC;CACD;AArCD,wCAqCC;AAED,MAAa,iBACZ,SAAQ,SAA6C;IAGrD,YACC,OAAgB,EAChB,MAA2D,EAC3D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QAE5C,IAAA,sCAAyB,EAAC,IAAI,EAAE,SAAS,EAAE,iBAAiB,CAAC,SAAS,CAAC,CAAC;IACzE,CAAC;IAEO,cAAc;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACjE,OAAO,WAAW,CAAC;IACpB,CAAC;IAED,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,IAAW,OAAO,CAAC,UAAmD;QACrE,MAAM,OAAO,GACZ,UAAU,KAAK,SAAS;YACvB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,IAAA,eAAQ,EAAC,UAAU,CAAC;gBACtB,CAAC,CAAC,0BAA0B,CAAC,UAAU,CAAC;gBACxC,CAAC,CAAC,CAAC,IAAA,4CAAwB,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC,CAAC;QACrF,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,IAAA,mBAAM,EACL,OAAO,CAAC,MAAM,IAAI,CAAC,EACnB,KAAK,CAAC,8DAA8D,CACpE,CAAC;QACF,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;IACnF,CAAC;IAED,IAAW,YAAY;QACtB,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;CACD;AA3CD,8CA2CC;AAED,MAAa,gBACZ,SAAQ,SAA4C;IAGpD,YACC,OAAgB,EAChB,MAA0D,EAC1D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QAE5C,IAAA,sCAAyB,EAAC,IAAI,EAAE,eAAe,EAAE,gBAAgB,CAAC,SAAS,CAAC,CAAC;IAC9E,CAAC;IAED,IAAW,YAAY;QACtB,mFAAmF;QACnF,uEAAuE;QACvE,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC3D,CAAC;IAED,IAAW,aAAa;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAY,CAAC,CAAC;QAClC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpB,IAAA,mBAAM,EAAC,MAAM,CAAC,IAAI,KAAK,gCAAqB,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;QACjF,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC;QAC/B,IAAA,mBAAM,EAAC,OAAO,SAAS,KAAK,QAAQ,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;QACzE,MAAM,CAAC,QAAQ,EAAE,CAAC;QAClB,OAAO,IAAA,YAAK,EAAC,SAAqB,CAAC,CAAC;IACrC,CAAC;CACD;AA9BD,4CA8BC;AAED,MAAa,kBAAgD,SAAQ,SAGpE;CAAG;AAHJ,gDAGI;AASJ,MAAM,WAAW,GAA2B;IAC3C,CAAC,2BAAU,CAAC,SAAS,EAAE,kBAAkB,CAAC;IAC1C,CAAC,2BAAU,CAAC,OAAO,EAAE,gBAAgB,CAAC;IACtC,CAAC,2BAAU,CAAC,QAAQ,EAAE,iBAAiB,CAAC;IACxC,CAAC,2BAAU,CAAC,QAAQ,EAAE,YAAY,CAAC;IACnC,CAAC,2BAAU,CAAC,QAAQ,EAAE,cAAc,CAAC;CACrC,CAAC;AAEF,MAAM,WAAW,GAAoC,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;AAE1E;;GAEG;AACH,SAAS,2BAA2B,CAAC,MAA8B;IAClE,oDAAoD;IAEpD,4GAA4G;IAC5G,sGAAsG;IACtG,sHAAsH;IACtH,OAAO,IAAA,qBAAc,EAAC,MAAM,EAAE,GAAG,EAAE,CAAC,IAAA,oCAAoB,EAAC,IAAA,iCAAiB,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACtF,CAAC;AAED;;GAEG;AACH,SAAS,0BAA0B,CAAC,MAA8B;IACjE,oDAAoD;IAEpD,IAAA,mBAAM,EAAC,MAAM,CAAC,IAAI,qCAA6B,EAAE,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACtF,OAAO,CAAC,MAAM,CAAC,CAAC;AACjB,CAAC","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 { StableId } from \"@fluidframework/runtime-definitions\";\nimport {\n\tFieldKey,\n\tTreeNavigationResult,\n\tITreeSubscriptionCursor,\n\tCursorLocationType,\n\tFieldAnchor,\n\tinCursorNode,\n\tFieldUpPath,\n\tkeyAsDetachedField,\n\titerateCursorField,\n\tisCursor,\n\tITreeCursorSynchronous,\n\tmapCursorField,\n} from \"../../core\";\nimport { FieldKind } from \"../modular-schema\";\n// TODO: stop depending on contextuallyTyped\nimport { cursorFromContextualData } from \"../contextuallyTyped\";\nimport {\n\tFieldKinds,\n\tOptionalFieldEditBuilder,\n\tSequenceFieldEditBuilder,\n\tValueFieldEditBuilder,\n} from \"../default-schema\";\nimport { assertValidIndex, assertValidRangeIndices, brand, disposeSymbol, fail } from \"../../util\";\nimport { AllowedTypes, TreeFieldSchema } from \"../typed-schema\";\nimport { LocalNodeKey, StableNodeKey, nodeKeyTreeIdentifier } from \"../node-key\";\nimport { mapTreeFromCursor, cursorForMapTreeNode } from \"../mapTreeCursor\";\nimport { Context } from \"./context\";\nimport {\n\tFlexibleNodeContent,\n\tFlexTreeOptionalField,\n\tFlexTreeSequenceField,\n\tFlexTreeTypedField,\n\tFlexTreeTypedNodeUnion,\n\tFlexTreeUnboxNodeUnion,\n\tFlexTreeField,\n\tFlexTreeNode,\n\tFlexTreeRequiredField,\n\tboxedIterator,\n\tTreeStatus,\n\tFlexTreeNodeKeyField,\n\tFlexibleNodeSubSequence,\n\tFlexTreeEntityKind,\n\tflexTreeMarker,\n} from \"./flexTreeTypes\";\nimport { makeTree } from \"./lazyNode\";\nimport {\n\tLazyEntity,\n\tanchorSymbol,\n\tcursorSymbol,\n\tforgetAnchorSymbol,\n\tisFreedSymbol,\n\tmakePropertyEnumerableOwn,\n\tmakePropertyNotEnumerable,\n\ttryMoveCursorToAnchorSymbol,\n} from \"./lazyEntity\";\nimport { unboxedUnion } from \"./unboxed\";\nimport { treeStatusFromAnchorCache, treeStatusFromDetachedField } from \"./utilities\";\n\n/**\n * Indexing for {@link LazyField.at} and {@link LazyField.boxedAt} supports the\n * usage of negative indices, which regular indexing using `[` and `]` does not.\n *\n * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at\n * for additional context on the semantics.\n *\n * @returns A positive index that can be used in regular indexing. Returns\n * undefined if that index would be out-of-bounds.\n */\nfunction indexForAt(index: number, length: number): number | undefined {\n\tlet finalIndex = Math.trunc(+index);\n\tif (isNaN(finalIndex)) {\n\t\tfinalIndex = 0;\n\t}\n\tif (finalIndex < -length || finalIndex >= length) {\n\t\treturn undefined;\n\t}\n\tif (finalIndex < 0) {\n\t\tfinalIndex = finalIndex + length;\n\t}\n\treturn finalIndex;\n}\n\nexport function makeField(\n\tcontext: Context,\n\tschema: TreeFieldSchema,\n\tcursor: ITreeSubscriptionCursor,\n): FlexTreeField {\n\tconst fieldAnchor = cursor.buildFieldAnchor();\n\n\tconst field = new (kindToClass.get(schema.kind) ?? fail(\"missing field implementation\"))(\n\t\tcontext,\n\t\tschema,\n\t\tcursor,\n\t\tfieldAnchor,\n\t);\n\n\t// Fields currently live as long as their parent does.\n\t// For root fields, this means forever, but other cases can be cleaned up when their parent anchor is deleted.\n\tif (fieldAnchor.parent !== undefined) {\n\t\tconst anchorNode =\n\t\t\tcontext.forest.anchors.locate(fieldAnchor.parent) ??\n\t\t\tfail(\"parent anchor node should always exist since field is under a node\");\n\t\tanchorNode.on(\"afterDestroy\", () => {\n\t\t\tfield[disposeSymbol]();\n\t\t});\n\t}\n\treturn field;\n}\n\n/**\n * A Proxy target, which together with a `fieldProxyHandler` implements a basic access to\n * the nodes of {@link EditableField} by means of the cursors.\n */\nexport abstract class LazyField<TKind extends FieldKind, TTypes extends AllowedTypes>\n\textends LazyEntity<TreeFieldSchema<TKind, TTypes>, FieldAnchor>\n\timplements FlexTreeField\n{\n\tpublic get [flexTreeMarker](): FlexTreeEntityKind.Field {\n\t\treturn FlexTreeEntityKind.Field;\n\t}\n\tpublic readonly key: FieldKey;\n\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: TreeFieldSchema<TKind, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t\tassert(cursor.mode === CursorLocationType.Fields, 0x77b /* must be in fields mode */);\n\t\tthis.key = cursor.getFieldKey();\n\n\t\tmakePropertyNotEnumerable(this, \"key\");\n\t}\n\n\tpublic is<TSchema extends TreeFieldSchema>(\n\t\tschema: TSchema,\n\t): this is FlexTreeTypedField<TSchema> {\n\t\tassert(\n\t\t\tthis.context.schema.policy.fieldKinds.get(schema.kind.identifier) === schema.kind,\n\t\t\t0x77c /* Narrowing must be done to a kind that exists in this context */,\n\t\t);\n\n\t\treturn this.schema.equals(schema);\n\t}\n\n\tpublic isSameAs(other: FlexTreeField): boolean {\n\t\tassert(\n\t\t\tother.context === this.context,\n\t\t\t0x77d /* Content from different editable trees should not be used together */,\n\t\t);\n\t\treturn this.key === other.key && this.parent === other.parent;\n\t}\n\n\tpublic get parent(): FlexTreeNode | undefined {\n\t\tif (this[anchorSymbol].parent === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst cursor = this[cursorSymbol];\n\t\tcursor.exitField();\n\t\tconst output = makeTree(this.context, cursor);\n\t\tcursor.enterField(this.key);\n\t\treturn output;\n\t}\n\n\tprotected override [tryMoveCursorToAnchorSymbol](\n\t\tanchor: FieldAnchor,\n\t\tcursor: ITreeSubscriptionCursor,\n\t): TreeNavigationResult {\n\t\treturn this.context.forest.tryMoveCursorToField(anchor, cursor);\n\t}\n\n\tprotected override [forgetAnchorSymbol](anchor: FieldAnchor): void {\n\t\tif (anchor.parent === undefined) return;\n\t\tthis.context.forest.anchors.forget(anchor.parent);\n\t}\n\n\tpublic get length(): number {\n\t\treturn this[cursorSymbol].getFieldLength();\n\t}\n\n\tpublic atIndex(index: number): FlexTreeUnboxNodeUnion<TTypes> {\n\t\treturn inCursorNode(this[cursorSymbol], index, (cursor) =>\n\t\t\tunboxedUnion(this.context, this.schema, cursor),\n\t\t);\n\t}\n\n\tpublic boxedAt(index: number): FlexTreeTypedNodeUnion<TTypes> | undefined {\n\t\tconst finalIndex = indexForAt(index, this.length);\n\n\t\tif (finalIndex === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn inCursorNode(this[cursorSymbol], finalIndex, (cursor) =>\n\t\t\tmakeTree(this.context, cursor),\n\t\t) as unknown as FlexTreeTypedNodeUnion<TTypes>;\n\t}\n\n\tpublic map<U>(callbackfn: (value: FlexTreeUnboxNodeUnion<TTypes>, index: number) => U): U[] {\n\t\treturn Array.from(this, callbackfn);\n\t}\n\n\tpublic mapBoxed<U>(\n\t\tcallbackfn: (value: FlexTreeTypedNodeUnion<TTypes>, index: number) => U,\n\t): U[] {\n\t\treturn Array.from(this[boxedIterator](), callbackfn);\n\t}\n\n\tpublic [boxedIterator](): IterableIterator<FlexTreeTypedNodeUnion<TTypes>> {\n\t\treturn iterateCursorField(\n\t\t\tthis[cursorSymbol],\n\t\t\t(cursor) => makeTree(this.context, cursor) as unknown as FlexTreeTypedNodeUnion<TTypes>,\n\t\t);\n\t}\n\n\tpublic [Symbol.iterator](): IterableIterator<FlexTreeUnboxNodeUnion<TTypes>> {\n\t\treturn iterateCursorField(this[cursorSymbol], (cursor) =>\n\t\t\tunboxedUnion(this.context, this.schema, cursor),\n\t\t);\n\t}\n\n\tpublic treeStatus(): TreeStatus {\n\t\tif (this[isFreedSymbol]()) {\n\t\t\treturn TreeStatus.Deleted;\n\t\t}\n\t\tconst fieldAnchor = this[anchorSymbol];\n\t\tconst parentAnchor = fieldAnchor.parent;\n\t\t// If the parentAnchor is undefined it is a detached field.\n\t\tif (parentAnchor === undefined) {\n\t\t\treturn treeStatusFromDetachedField(keyAsDetachedField(fieldAnchor.fieldKey));\n\t\t}\n\t\tconst parentAnchorNode = this.context.forest.anchors.locate(parentAnchor);\n\n\t\t// As the \"parentAnchor === undefined\" case is handled above, parentAnchorNode should exist.\n\t\tassert(parentAnchorNode !== undefined, 0x77e /* parentAnchorNode must exist. */);\n\t\treturn treeStatusFromAnchorCache(this.context.forest.anchors, parentAnchorNode);\n\t}\n\n\tpublic getFieldPath(): FieldUpPath {\n\t\treturn this[cursorSymbol].getFieldPath();\n\t}\n\n\t/**\n\t * Returns the path to this field to use for editing. Throws iff this path is not {@link TreeStatus#InDocument}.\n\t * This path is not valid to hold onto across edits: this must be recalled for each edit.\n\t */\n\tpublic getFieldPathForEditing(): FieldUpPath {\n\t\tassert(\n\t\t\tthis.treeStatus() === TreeStatus.InDocument,\n\t\t\t0x77f /* Editing only allowed on fields with TreeStatus.InDocument status */,\n\t\t);\n\t\treturn this.getFieldPath();\n\t}\n}\n\nexport class LazySequence<TTypes extends AllowedTypes>\n\textends LazyField<typeof FieldKinds.sequence, TTypes>\n\timplements FlexTreeSequenceField<TTypes>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: TreeFieldSchema<typeof FieldKinds.sequence, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\n\t\tmakePropertyEnumerableOwn(this, \"asArray\", LazySequence.prototype);\n\t}\n\n\tpublic at(index: number): FlexTreeUnboxNodeUnion<TTypes> | undefined {\n\t\tconst finalIndex = indexForAt(index, this.length);\n\n\t\tif (finalIndex === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn inCursorNode(this[cursorSymbol], finalIndex, (cursor) =>\n\t\t\tunboxedUnion(this.context, this.schema, cursor),\n\t\t);\n\t}\n\tpublic get asArray(): readonly FlexTreeUnboxNodeUnion<TTypes>[] {\n\t\treturn this.map((x) => x);\n\t}\n\n\tprivate sequenceEditor(): SequenceFieldEditBuilder {\n\t\tconst fieldPath = this.getFieldPathForEditing();\n\t\tconst fieldEditor = this.context.editor.sequenceField(fieldPath);\n\t\treturn fieldEditor;\n\t}\n\n\tpublic insertAt(index: number, value: FlexibleNodeSubSequence<TTypes>): void {\n\t\tassertValidIndex(index, this, true);\n\t\tconst content: ITreeCursorSynchronous[] = isCursor(value)\n\t\t\t? prepareFieldCursorForInsert(value)\n\t\t\t: Array.from(value, (item) =>\n\t\t\t\t\tcursorFromContextualData(this.context, this.schema.allowedTypeSet, item),\n\t\t\t  );\n\t\tconst fieldEditor = this.sequenceEditor();\n\t\tfieldEditor.insert(index, content);\n\t}\n\n\tpublic insertAtStart(value: FlexibleNodeSubSequence<TTypes>): void {\n\t\tthis.insertAt(0, value);\n\t}\n\n\tpublic insertAtEnd(value: FlexibleNodeSubSequence<TTypes>): void {\n\t\tthis.insertAt(this.length, value);\n\t}\n\n\tpublic removeAt(index: number): void {\n\t\tconst fieldEditor = this.sequenceEditor();\n\t\tfieldEditor.delete(index, 1);\n\t}\n\n\tpublic removeRange(start?: number, end?: number): void {\n\t\tconst fieldEditor = this.sequenceEditor();\n\t\tconst { length } = this;\n\t\tconst removeStart = start ?? 0;\n\t\tconst removeEnd = Math.min(length, end ?? length);\n\t\tassertValidRangeIndices(removeStart, removeEnd, this);\n\t\tfieldEditor.delete(removeStart, removeEnd - removeStart);\n\t}\n\n\tpublic moveToStart(sourceIndex: number): void;\n\tpublic moveToStart(sourceIndex: number, source: FlexTreeSequenceField<AllowedTypes>): void;\n\tpublic moveToStart(sourceIndex: number, source?: FlexTreeSequenceField<AllowedTypes>): void {\n\t\tthis._moveRangeToIndex(0, sourceIndex, sourceIndex + 1, source);\n\t}\n\tpublic moveToEnd(sourceIndex: number): void;\n\tpublic moveToEnd(sourceIndex: number, source: FlexTreeSequenceField<AllowedTypes>): void;\n\tpublic moveToEnd(sourceIndex: number, source?: FlexTreeSequenceField<AllowedTypes>): void {\n\t\tthis._moveRangeToIndex(this.length, sourceIndex, sourceIndex + 1, source);\n\t}\n\tpublic moveToIndex(index: number, sourceIndex: number): void;\n\tpublic moveToIndex(\n\t\tindex: number,\n\t\tsourceIndex: number,\n\t\tsource: FlexTreeSequenceField<AllowedTypes>,\n\t): void;\n\tpublic moveToIndex(\n\t\tindex: number,\n\t\tsourceIndex: number,\n\t\tsource?: FlexTreeSequenceField<AllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(index, sourceIndex, sourceIndex + 1, source);\n\t}\n\n\tpublic moveRangeToStart(sourceStart: number, sourceEnd: number): void;\n\tpublic moveRangeToStart(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: FlexTreeSequenceField<AllowedTypes>,\n\t): void;\n\tpublic moveRangeToStart(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<AllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(0, sourceStart, sourceEnd, source);\n\t}\n\n\tpublic moveRangeToEnd(sourceStart: number, sourceEnd: number): void;\n\tpublic moveRangeToEnd(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: FlexTreeSequenceField<AllowedTypes>,\n\t): void;\n\tpublic moveRangeToEnd(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<AllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(this.length, sourceStart, sourceEnd, source);\n\t}\n\n\tpublic moveRangeToIndex(index: number, sourceStart: number, sourceEnd: number): void;\n\tpublic moveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: FlexTreeSequenceField<AllowedTypes>,\n\t): void;\n\tpublic moveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<AllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(index, sourceStart, sourceEnd, source);\n\t}\n\n\tprivate _moveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<AllowedTypes>,\n\t): void {\n\t\tconst sourceField = source !== undefined ? (this.isSameAs(source) ? this : source) : this;\n\n\t\t// TODO: determine support for move across different sequence types\n\t\tassert(\n\t\t\tsourceField instanceof LazySequence,\n\t\t\t0x7b1 /* Unsupported sequence implementation. */,\n\t\t);\n\t\tassertValidRangeIndices(sourceStart, sourceEnd, sourceField);\n\t\tif (this.schema.types !== undefined && sourceField !== this) {\n\t\t\tfor (let i = sourceStart; i < sourceEnd; i++) {\n\t\t\t\tconst sourceNode =\n\t\t\t\t\tsourceField.boxedAt(sourceStart) ?? fail(\"impossible out of bounds index\");\n\t\t\t\tif (!this.schema.types.has(sourceNode.schema.name)) {\n\t\t\t\t\tthrow new Error(\"Type in source sequence is not allowed in destination.\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst movedCount = sourceEnd - sourceStart;\n\t\tassertValidIndex(index, this, true);\n\t\tconst sourceFieldPath = sourceField.getFieldPath();\n\t\tconst destinationFieldPath = this.getFieldPath();\n\t\tthis.context.editor.move(\n\t\t\tsourceFieldPath,\n\t\t\tsourceStart,\n\t\t\tmovedCount,\n\t\t\tdestinationFieldPath,\n\t\t\tindex,\n\t\t);\n\t}\n}\n\nexport class LazyValueField<TTypes extends AllowedTypes>\n\textends LazyField<typeof FieldKinds.required, TTypes>\n\timplements FlexTreeRequiredField<TTypes>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: TreeFieldSchema<typeof FieldKinds.required, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\n\t\tmakePropertyEnumerableOwn(this, \"content\", LazyValueField.prototype);\n\t}\n\n\tprivate valueFieldEditor(): ValueFieldEditBuilder {\n\t\tconst fieldPath = this.getFieldPathForEditing();\n\t\tconst fieldEditor = this.context.editor.valueField(fieldPath);\n\t\treturn fieldEditor;\n\t}\n\n\tpublic get content(): FlexTreeUnboxNodeUnion<TTypes> {\n\t\treturn this.atIndex(0);\n\t}\n\n\tpublic set content(newContent: FlexibleNodeContent<TTypes>) {\n\t\tconst content: ITreeCursorSynchronous[] = isCursor(newContent)\n\t\t\t? prepareNodeCursorForInsert(newContent)\n\t\t\t: [cursorFromContextualData(this.context, this.schema.allowedTypeSet, newContent)];\n\t\tconst fieldEditor = this.valueFieldEditor();\n\t\tassert(content.length === 1, 0x780 /* value field content should normalize to one item */);\n\t\tfieldEditor.set(content[0]);\n\t}\n\n\tpublic get boxedContent(): FlexTreeTypedNodeUnion<TTypes> {\n\t\treturn this.boxedAt(0) ?? fail(\"value node must have 1 item\");\n\t}\n}\n\nexport class LazyOptionalField<TTypes extends AllowedTypes>\n\textends LazyField<typeof FieldKinds.optional, TTypes>\n\timplements FlexTreeOptionalField<TTypes>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: TreeFieldSchema<typeof FieldKinds.optional, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\n\t\tmakePropertyEnumerableOwn(this, \"content\", LazyOptionalField.prototype);\n\t}\n\n\tprivate optionalEditor(): OptionalFieldEditBuilder {\n\t\tconst fieldPath = this.getFieldPathForEditing();\n\t\tconst fieldEditor = this.context.editor.optionalField(fieldPath);\n\t\treturn fieldEditor;\n\t}\n\n\tpublic get content(): FlexTreeUnboxNodeUnion<TTypes> | undefined {\n\t\treturn this.length === 0 ? undefined : this.atIndex(0);\n\t}\n\n\tpublic set content(newContent: FlexibleNodeContent<TTypes> | undefined) {\n\t\tconst content: ITreeCursorSynchronous[] =\n\t\t\tnewContent === undefined\n\t\t\t\t? []\n\t\t\t\t: isCursor(newContent)\n\t\t\t\t? prepareNodeCursorForInsert(newContent)\n\t\t\t\t: [cursorFromContextualData(this.context, this.schema.allowedTypeSet, newContent)];\n\t\tconst fieldEditor = this.optionalEditor();\n\t\tassert(\n\t\t\tcontent.length <= 1,\n\t\t\t0x781 /* optional field content should normalize at most one item */,\n\t\t);\n\t\tfieldEditor.set(content.length === 0 ? undefined : content[0], this.length === 0);\n\t}\n\n\tpublic get boxedContent(): FlexTreeTypedNodeUnion<TTypes> | undefined {\n\t\treturn this.length === 0 ? undefined : this.boxedAt(0);\n\t}\n}\n\nexport class LazyNodeKeyField<TTypes extends AllowedTypes>\n\textends LazyField<typeof FieldKinds.nodeKey, TTypes>\n\timplements FlexTreeNodeKeyField\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: TreeFieldSchema<typeof FieldKinds.nodeKey, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\n\t\tmakePropertyEnumerableOwn(this, \"stableNodeKey\", LazyNodeKeyField.prototype);\n\t}\n\n\tpublic get localNodeKey(): LocalNodeKey {\n\t\t// TODO: Optimize this to be a fast path that gets a LocalNodeKey directly from the\n\t\t// forest rather than getting the StableNodeKey and the compressing it.\n\t\treturn this.context.nodeKeys.localize(this.stableNodeKey);\n\t}\n\n\tpublic get stableNodeKey(): StableNodeKey {\n\t\tconst cursor = this[cursorSymbol];\n\t\tcursor.enterNode(0);\n\t\tassert(cursor.type === nodeKeyTreeIdentifier, 0x7b2 /* invalid node key type */);\n\t\tconst stableKey = cursor.value;\n\t\tassert(typeof stableKey === \"string\", 0x7b3 /* invalid node key type */);\n\t\tcursor.exitNode();\n\t\treturn brand(stableKey as StableId);\n\t}\n}\n\nexport class LazyForbiddenField<TTypes extends AllowedTypes> extends LazyField<\n\ttypeof FieldKinds.forbidden,\n\tTTypes\n> {}\n\ntype Builder = new <TTypes extends AllowedTypes>(\n\tcontext: Context,\n\tschema: TreeFieldSchema<any, TTypes>,\n\tcursor: ITreeSubscriptionCursor,\n\tfieldAnchor: FieldAnchor,\n) => LazyField<any, TTypes>;\n\nconst builderList: [FieldKind, Builder][] = [\n\t[FieldKinds.forbidden, LazyForbiddenField],\n\t[FieldKinds.nodeKey, LazyNodeKeyField],\n\t[FieldKinds.optional, LazyOptionalField],\n\t[FieldKinds.sequence, LazySequence],\n\t[FieldKinds.required, LazyValueField],\n];\n\nconst kindToClass: ReadonlyMap<FieldKind, Builder> = new Map(builderList);\n\n/**\n * Prepare a fields cursor (holding a sequence of nodes) for inserting.\n */\nfunction prepareFieldCursorForInsert(cursor: ITreeCursorSynchronous): ITreeCursorSynchronous[] {\n\t// TODO: optionally validate content against schema.\n\n\t// Convert from the desired API (single field cursor) to the currently required API (array of node cursors).\n\t// This is inefficient, and particularly bad if the data was efficiently chunked using uniform chunks.\n\t// TODO: update editing APIs to take in field cursors not arrays of node cursors, then remove this copying conversion.\n\treturn mapCursorField(cursor, () => cursorForMapTreeNode(mapTreeFromCursor(cursor)));\n}\n\n/**\n * Prepare a node cursor (holding a single node) for inserting.\n */\nfunction prepareNodeCursorForInsert(cursor: ITreeCursorSynchronous): ITreeCursorSynchronous[] {\n\t// TODO: optionally validate content against schema.\n\n\tassert(cursor.mode === CursorLocationType.Nodes, 0x805 /* should be in nodes mode */);\n\treturn [cursor];\n}\n"]}

package/dist/feature-libraries/flex-tree/lazyNode.d.ts

@@ -0,0 +1,75 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Value, Anchor, FieldKey, TreeNavigationResult, ITreeSubscriptionCursor, AnchorNode, TreeNodeSchemaIdentifier, TreeValue } from "../../core";
+import { TreeFieldSchema, TreeNodeSchema, MapNodeSchema, FieldNodeSchema, LeafNodeSchema, ObjectNodeSchema } from "../typed-schema";
+import { LocalNodeKey } from "../node-key";
+import { EditableTreeEvents } from "./treeEvents";
+import { Context } from "./context";
+import { FlexTreeFieldNode, FlexTreeLeafNode, FlexTreeMapNode, FlexTreeObjectNode, FlexTreeObjectNodeTyped, FlexTreeTypedField, FlexTreeTypedNode, FlexTreeUnboxField, FlexTreeField, FlexTreeNode, boxedIterator, TreeStatus, FlexibleFieldContent, onNextChange, FlexTreeEntityKind, flexTreeMarker } from "./flexTreeTypes";
+import { LazyEntity, forgetAnchorSymbol, tryMoveCursorToAnchorSymbol } from "./lazyEntity";
+export declare function makeTree(context: Context, cursor: ITreeSubscriptionCursor): LazyTreeNode;
+/**
+ * Lazy implementation of {@link FlexTreeNode}.
+ */
+export declare abstract class LazyTreeNode<TSchema extends TreeNodeSchema = TreeNodeSchema> extends LazyEntity<TSchema, Anchor> implements FlexTreeNode {
+    #private;
+    get [flexTreeMarker](): FlexTreeEntityKind.Node;
+    /**
+     * Enumerable own property providing a more JS object friendly alternative to "schema".
+     */
+    readonly type: TreeNodeSchemaIdentifier;
+    constructor(context: Context, schema: TSchema, cursor: ITreeSubscriptionCursor, anchorNode: AnchorNode, anchor: Anchor);
+    is<TSchemaInner extends TreeNodeSchema>(schema: TSchemaInner): this is FlexTreeTypedNode<TSchemaInner>;
+    protected [tryMoveCursorToAnchorSymbol](anchor: Anchor, cursor: ITreeSubscriptionCursor): TreeNavigationResult;
+    protected [forgetAnchorSymbol](anchor: Anchor): void;
+    get value(): Value;
+    tryGetField(fieldKey: FieldKey): FlexTreeField | undefined;
+    [boxedIterator](): IterableIterator<FlexTreeField>;
+    get parentField(): {
+        readonly parent: FlexTreeField;
+        readonly index: number;
+    };
+    treeStatus(): TreeStatus;
+    on<K extends keyof EditableTreeEvents>(eventName: K, listener: EditableTreeEvents[K]): () => void;
+    [onNextChange](fn: (node: FlexTreeNode) => void): () => void;
+}
+export declare class LazyMap<TSchema extends MapNodeSchema> extends LazyTreeNode<TSchema> implements FlexTreeMapNode<TSchema> {
+    constructor(context: Context, schema: TSchema, cursor: ITreeSubscriptionCursor, anchorNode: AnchorNode, anchor: Anchor);
+    get size(): number;
+    keys(): IterableIterator<FieldKey>;
+    values(): IterableIterator<FlexTreeUnboxField<TSchema["info"], "notEmpty">>;
+    entries(): IterableIterator<[
+        FieldKey,
+        FlexTreeUnboxField<TSchema["info"], "notEmpty">
+    ]>;
+    forEach(callbackFn: (value: FlexTreeUnboxField<TSchema["info"], "notEmpty">, key: FieldKey, map: FlexTreeMapNode<TSchema>) => void, thisArg?: any): void;
+    has(key: string): boolean;
+    get(key: string): FlexTreeUnboxField<TSchema["info"]>;
+    getBoxed(key: string): FlexTreeTypedField<TSchema["info"]>;
+    set(key: string, content: FlexibleFieldContent<TSchema["info"]> | undefined): void;
+    delete(key: FieldKey): void;
+    [boxedIterator](): IterableIterator<FlexTreeTypedField<TSchema["info"]>>;
+    [Symbol.iterator](): IterableIterator<[
+        FieldKey,
+        FlexTreeUnboxField<TSchema["info"], "notEmpty">
+    ]>;
+    get asObject(): {
+        readonly [P in FieldKey]?: FlexTreeUnboxField<TSchema["info"], "notEmpty">;
+    };
+}
+export declare class LazyLeaf<TSchema extends LeafNodeSchema> extends LazyTreeNode<TSchema> implements FlexTreeLeafNode<TSchema> {
+    constructor(context: Context, schema: TSchema, cursor: ITreeSubscriptionCursor, anchorNode: AnchorNode, anchor: Anchor);
+    get value(): TreeValue<TSchema["info"]>;
+}
+export declare class LazyFieldNode<TSchema extends FieldNodeSchema> extends LazyTreeNode<TSchema> implements FlexTreeFieldNode<TSchema> {
+    get content(): FlexTreeUnboxField<TSchema["info"]>;
+    get boxedContent(): FlexTreeTypedField<TSchema["info"]>;
+}
+export declare abstract class LazyObjectNode<TSchema extends ObjectNodeSchema> extends LazyTreeNode<TSchema> implements FlexTreeObjectNode {
+    get localNodeKey(): LocalNodeKey | undefined;
+}
+export declare function buildLazyObjectNode<TSchema extends ObjectNodeSchema>(context: Context, schema: TSchema, cursor: ITreeSubscriptionCursor, anchorNode: AnchorNode, anchor: Anchor): LazyObjectNode<TSchema> & FlexTreeObjectNodeTyped<TSchema>;
+export declare function getBoxedField(objectNode: LazyTreeNode, key: FieldKey, fieldSchema: TreeFieldSchema): FlexTreeField;
+//# sourceMappingURL=lazyNode.d.ts.map

package/dist/feature-libraries/flex-tree/lazyNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lazyNode.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/lazyNode.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACN,KAAK,EACL,MAAM,EACN,QAAQ,EACR,oBAAoB,EACpB,uBAAuB,EAIvB,UAAU,EAIV,wBAAwB,EAExB,SAAS,EACT,MAAM,YAAY,CAAC;AAEpB,OAAO,EACN,eAAe,EACf,cAAc,EACd,aAAa,EAKb,eAAe,EACf,cAAc,EACd,gBAAgB,EAGhB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,kBAAkB,EAAa,MAAM,cAAc,CAAC;AAC7D,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EACN,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EACf,kBAAkB,EAClB,uBAAuB,EACvB,kBAAkB,EAClB,iBAAiB,EACjB,kBAAkB,EAClB,aAAa,EACb,YAAY,EACZ,aAAa,EACb,UAAU,EAGV,oBAAoB,EAEpB,YAAY,EACZ,kBAAkB,EAClB,cAAc,EACd,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACN,UAAU,EAEV,kBAAkB,EAGlB,2BAA2B,EAC3B,MAAM,cAAc,CAAC;AAMtB,wBAAgB,QAAQ,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,uBAAuB,GAAG,YAAY,CAgBxF;AA8BD;;GAEG;AACH,8BAAsB,YAAY,CAAC,OAAO,SAAS,cAAc,GAAG,cAAc,CACjF,SAAQ,UAAU,CAAC,OAAO,EAAE,MAAM,CAClC,YAAW,YAAY;;IAEvB,IAAW,CAAC,cAAc,CAAC,IAAI,kBAAkB,CAAC,IAAI,CAErD;IACD;;OAEG;IACH,SAAgB,IAAI,EAAE,wBAAwB,CAAC;gBAU9C,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,uBAAuB,EAC/B,UAAU,EAAE,UAAU,EACtB,MAAM,EAAE,MAAM;IAoBR,EAAE,CAAC,YAAY,SAAS,cAAc,EAC5C,MAAM,EAAE,YAAY,GAClB,IAAI,IAAI,iBAAiB,CAAC,YAAY,CAAC;cAQvB,CAAC,2BAA2B,CAAC,CAC/C,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,uBAAuB,GAC7B,oBAAoB;cAIJ,CAAC,kBAAkB,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAS7D,IAAW,KAAK,IAAI,KAAK,CAExB;IAEM,WAAW,CAAC,QAAQ,EAAE,QAAQ,GAAG,aAAa,GAAG,SAAS;IAU1D,CAAC,aAAa,CAAC,IAAI,gBAAgB,CAAC,aAAa,CAAC;IAMzD,IAAW,WAAW,IAAI;QAAE,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CA8CnF;IAEe,UAAU,IAAI,UAAU;IAOjC,EAAE,CAAC,CAAC,SAAS,MAAM,kBAAkB,EAC3C,SAAS,EAAE,CAAC,EACZ,QAAQ,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAC7B,MAAM,IAAI;IA+DN,CAAC,YAAY,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,IAAI,GAAG,MAAM,IAAI;CAoBnE;AAED,qBAAa,OAAO,CAAC,OAAO,SAAS,aAAa,CACjD,SAAQ,YAAY,CAAC,OAAO,CAC5B,YAAW,eAAe,CAAC,OAAO,CAAC;gBAGlC,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,uBAAuB,EAC/B,UAAU,EAAE,UAAU,EACtB,MAAM,EAAE,MAAM;IAQf,IAAW,IAAI,IAAI,MAAM,CAIxB;IAEM,IAAI,IAAI,gBAAgB,CAAC,QAAQ,CAAC;IAIlC,MAAM,IAAI,gBAAgB,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC;IAW3E,OAAO,IAAI,gBAAgB,CACjC;QAAC,QAAQ;QAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;KAAC,CAC3D;IAaM,OAAO,CACb,UAAU,EAAE,CACX,KAAK,EAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,EACtD,GAAG,EAAE,QAAQ,EACb,GAAG,EAAE,eAAe,CAAC,OAAO,CAAC,KACzB,IAAI,EACT,OAAO,CAAC,EAAE,GAAG,GACX,IAAI;IAOA,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAMrD,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAM1D,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,oBAAoB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI;IAgBlF,MAAM,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI;IAMlB,CAAC,aAAa,CAAC,IAAI,gBAAgB,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAIjF,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAC3C;QAAC,QAAQ;QAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;KAAC,CAC3D;IAID,IAAW,QAAQ,IAAI;QACtB,QAAQ,EAAE,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;KAC1E,CAcA;CACD;AAED,qBAAa,QAAQ,CAAC,OAAO,SAAS,cAAc,CACnD,SAAQ,YAAY,CAAC,OAAO,CAC5B,YAAW,gBAAgB,CAAC,OAAO,CAAC;gBAGnC,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,uBAAuB,EAC/B,UAAU,EAAE,UAAU,EACtB,MAAM,EAAE,MAAM;IAQf,IAAoB,KAAK,IAAI,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAEtD;CACD;AAED,qBAAa,aAAa,CAAC,OAAO,SAAS,eAAe,CACzD,SAAQ,YAAY,CAAC,OAAO,CAC5B,YAAW,iBAAiB,CAAC,OAAO,CAAC;IAErC,IAAW,OAAO,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAIxD;IAED,IAAW,YAAY,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAI7D;CACD;AAED,8BAAsB,cAAc,CAAC,OAAO,SAAS,gBAAgB,CACpE,SAAQ,YAAY,CAAC,OAAO,CAC5B,YAAW,kBAAkB;IAE7B,IAAW,YAAY,IAAI,YAAY,GAAG,SAAS,CAwBlD;CACD;AAED,wBAAgB,mBAAmB,CAAC,OAAO,SAAS,gBAAgB,EACnE,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,uBAAuB,EAC/B,UAAU,EAAE,UAAU,EACtB,MAAM,EAAE,MAAM,GACZ,cAAc,CAAC,OAAO,CAAC,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAM5D;AAYD,wBAAgB,aAAa,CAC5B,UAAU,EAAE,YAAY,EACxB,GAAG,EAAE,QAAQ,EACb,WAAW,EAAE,eAAe,GAC1B,aAAa,CAIf"}