@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/lib/feature-libraries/flex-tree/lazyNode.js

@@ -0,0 +1,415 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {
+    if (kind === "m") throw new TypeError("Private method is not writable");
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
+    return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
+};
+var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
+    return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
+};
+var _LazyTreeNode_removeDeleteCallback, _LazyTreeNode_anchorNode, _LazyTreeNode_removeNextChangeCallback;
+import { assert, unreachableCase } from "@fluidframework/core-utils";
+import { mapCursorFields, anchorSlot, inCursorField, rootFieldKey, EmptyKey, forEachField, } from "../../core";
+import { brand, capitalize, disposeSymbol, fail, getOrCreate } from "../../util";
+import { TreeFieldSchema, schemaIsFieldNode, schemaIsLeaf, schemaIsMap, schemaIsObjectNode, Any, } from "../typed-schema";
+import { FieldKinds } from "../default-schema";
+import { boxedIterator, TreeStatus, onNextChange, FlexTreeEntityKind, flexTreeMarker, } from "./flexTreeTypes";
+import { LazyNodeKeyField, makeField } from "./lazyField";
+import { LazyEntity, cursorSymbol, forgetAnchorSymbol, isFreedSymbol, makePropertyEnumerableOwn, tryMoveCursorToAnchorSymbol, } from "./lazyEntity";
+import { unboxedField } from "./unboxed";
+import { treeStatusFromAnchorCache } from "./utilities";
+const lazyTreeSlot = anchorSlot();
+export function makeTree(context, cursor) {
+    const anchor = cursor.buildAnchor();
+    const anchorNode = context.forest.anchors.locate(anchor) ??
+        fail("cursor should point to a node that is not the root of the AnchorSet");
+    const cached = anchorNode.slots.get(lazyTreeSlot);
+    if (cached !== undefined) {
+        context.forest.anchors.forget(anchor);
+        assert(cached.context === context, 0x782 /* contexts must match */);
+        return cached;
+    }
+    const schema = context.schema.nodeSchema.get(cursor.type) ?? fail("missing schema");
+    const output = buildSubclass(context, schema, cursor, anchorNode, anchor);
+    anchorNode.slots.set(lazyTreeSlot, output);
+    anchorNode.on("afterDestroy", cleanupTree);
+    return output;
+}
+function cleanupTree(anchor) {
+    const cached = anchor.slots.get(lazyTreeSlot) ?? fail("tree should only be cleaned up once");
+    cached[disposeSymbol]();
+}
+function buildSubclass(context, schema, cursor, anchorNode, anchor) {
+    if (schemaIsMap(schema)) {
+        return new LazyMap(context, schema, cursor, anchorNode, anchor);
+    }
+    if (schemaIsLeaf(schema)) {
+        return new LazyLeaf(context, schema, cursor, anchorNode, anchor);
+    }
+    if (schemaIsFieldNode(schema)) {
+        return new LazyFieldNode(context, schema, cursor, anchorNode, anchor);
+    }
+    if (schemaIsObjectNode(schema)) {
+        return buildLazyObjectNode(context, schema, cursor, anchorNode, anchor);
+    }
+    // TODO: there should be a common fallback that works for cases without a specialized implementation.
+    fail("unrecognized node kind");
+}
+/**
+ * Lazy implementation of {@link FlexTreeNode}.
+ */
+export class LazyTreeNode extends LazyEntity {
+    get [(_LazyTreeNode_removeDeleteCallback = new WeakMap(), _LazyTreeNode_anchorNode = new WeakMap(), _LazyTreeNode_removeNextChangeCallback = new WeakMap(), flexTreeMarker)]() {
+        return FlexTreeEntityKind.Node;
+    }
+    constructor(context, schema, cursor, anchorNode, anchor) {
+        super(context, schema, cursor, anchor);
+        // Using JS private here prevents it from showing up as a enumerable own property, or conflicting with struct fields.
+        _LazyTreeNode_removeDeleteCallback.set(this, void 0);
+        _LazyTreeNode_anchorNode.set(this, void 0);
+        _LazyTreeNode_removeNextChangeCallback.set(this, void 0);
+        __classPrivateFieldSet(this, _LazyTreeNode_anchorNode, anchorNode, "f");
+        assert(cursor.mode === 0 /* CursorLocationType.Nodes */, 0x783 /* must be in nodes mode */);
+        anchorNode.slots.set(lazyTreeSlot, this);
+        __classPrivateFieldSet(this, _LazyTreeNode_removeDeleteCallback, anchorNode.on("afterDestroy", cleanupTree), "f");
+        assert(this.context.schema.nodeSchema.get(this.schema.name) !== undefined, 0x784 /* There is no explicit schema for this node type. Ensure that the type is correct and the schema for it was added to the TreeStoredSchema */);
+        // Setup JS Object API:
+        // makePrivatePropertyNotEnumerable(this, "removeDeleteCallback");
+        // makePrivatePropertyNotEnumerable(this, "anchorNode");
+        this.type = schema.name;
+    }
+    is(schema) {
+        assert(this.context.schema.nodeSchema.get(schema.name) === schema, 0x785 /* Narrowing must be done to a schema that exists in this context */);
+        return this.schema === schema;
+    }
+    [tryMoveCursorToAnchorSymbol](anchor, cursor) {
+        return this.context.forest.tryMoveCursorToNode(anchor, cursor);
+    }
+    [forgetAnchorSymbol](anchor) {
+        // This type unconditionally has an anchor, so `forgetAnchor` is always called and cleanup can be done here:
+        // After this point this node will not be usable,
+        // so remove it from the anchor incase a different context (or the same context later) uses this AnchorSet.
+        __classPrivateFieldGet(this, _LazyTreeNode_anchorNode, "f").slots.delete(lazyTreeSlot);
+        __classPrivateFieldGet(this, _LazyTreeNode_removeDeleteCallback, "f").call(this);
+        this.context.forest.anchors.forget(anchor);
+    }
+    get value() {
+        return this[cursorSymbol].value;
+    }
+    tryGetField(fieldKey) {
+        const schema = this.schema.getFieldSchema(fieldKey);
+        return inCursorField(this[cursorSymbol], fieldKey, (cursor) => {
+            if (cursor.getFieldLength() === 0) {
+                return undefined;
+            }
+            return makeField(this.context, schema, cursor);
+        });
+    }
+    [boxedIterator]() {
+        return mapCursorFields(this[cursorSymbol], (cursor) => makeField(this.context, this.schema.getFieldSchema(cursor.getFieldKey()), cursor)).values();
+    }
+    get parentField() {
+        const cursor = this[cursorSymbol];
+        const index = __classPrivateFieldGet(this, _LazyTreeNode_anchorNode, "f").parentIndex;
+        assert(cursor.fieldIndex === index, 0x786 /* mismatched indexes */);
+        const key = __classPrivateFieldGet(this, _LazyTreeNode_anchorNode, "f").parentField;
+        cursor.exitNode();
+        assert(key === cursor.getFieldKey(), 0x787 /* mismatched keys */);
+        let fieldSchema;
+        // Check if the current node is in a detached sequence.
+        if (__classPrivateFieldGet(this, _LazyTreeNode_anchorNode, "f").parent === undefined) {
+            // Parent field is a detached sequence, and thus needs special handling for its schema.
+            // eslint-disable-next-line unicorn/prefer-ternary
+            if (key === rootFieldKey) {
+                fieldSchema = this.context.schema.rootFieldSchema;
+            }
+            else {
+                // All fields (in the editable tree API) have a schema.
+                // Since currently there is no known schema for detached field other than the special default root:
+                // give all other detached fields a schema of sequence of any.
+                // That schema is the only one that is safe since its the only field schema that allows any possible field content.
+                //
+                // TODO:
+                // if any of the following are done this schema will need to be more specific:
+                // 1. Editing APIs start exposing user created detached sequences.
+                // 2. Remove (and its inverse) start working on subsequences or fields contents (like everything in a sequence or optional field) and not just single nodes.
+                // 3. Possibly other unknown cases.
+                // Additionally this approach makes it possible for a user to take an EditableTree node, get its parent, check its schema, down cast based on that, then edit that detached field (ex: removing the node in it).
+                // This MIGHT work properly with existing merge resolution logic (it must keep client in sync and be unable to violate schema), but this either needs robust testing or to be explicitly banned (error before s3ending the op).
+                // Issues like replacing a node in the a removed sequenced then undoing the remove could easily violate schema if not everything works exactly right!
+                fieldSchema = TreeFieldSchema.create(FieldKinds.sequence, [Any]);
+            }
+        }
+        else {
+            cursor.exitField();
+            const parentType = cursor.type;
+            cursor.enterField(key);
+            const nodeSchema = this.context.schema.nodeSchema.get(parentType) ??
+                fail("requested schema that does not exist");
+            fieldSchema = nodeSchema.getFieldSchema(key);
+        }
+        const proxifiedField = makeField(this.context, fieldSchema, cursor);
+        cursor.enterNode(index);
+        return { parent: proxifiedField, index };
+    }
+    treeStatus() {
+        if (this[isFreedSymbol]()) {
+            return TreeStatus.Deleted;
+        }
+        return treeStatusFromAnchorCache(this.context.forest.anchors, __classPrivateFieldGet(this, _LazyTreeNode_anchorNode, "f"));
+    }
+    on(eventName, listener) {
+        switch (eventName) {
+            case "changing": {
+                const unsubscribeFromChildrenChange = __classPrivateFieldGet(this, _LazyTreeNode_anchorNode, "f").on("childrenChanging", (anchorNode) => 
+                // Ugly casting workaround because I can't figure out how to make TS understand that in this case block
+                // the listener argument only needs to be an AnchorNode. Should go away if/when we make the listener signature
+                // for changing and subtreeChanging match the one for beforeChange and afterChange.
+                listener(anchorNode));
+                return unsubscribeFromChildrenChange;
+            }
+            case "subtreeChanging": {
+                const unsubscribeFromSubtreeChange = __classPrivateFieldGet(this, _LazyTreeNode_anchorNode, "f").on("subtreeChanging", (anchorNode) => 
+                // Ugly casting workaround because I can't figure out how to make TS understand that in this case block
+                // the listener argument only needs to be an AnchorNode. Should go away if/when we make the listener signature
+                // for changing and subtreeChanging match the one for beforeChange and afterChange.
+                listener(anchorNode));
+                return unsubscribeFromSubtreeChange;
+            }
+            case "beforeChange": {
+                const unsubscribeFromChildrenBeforeChange = __classPrivateFieldGet(this, _LazyTreeNode_anchorNode, "f").on("beforeChange", (anchorNode) => {
+                    const treeNode = anchorNode.slots.get(lazyTreeSlot);
+                    assert(treeNode !== undefined, 0x7d3 /* tree node not found in anchor node slots */);
+                    // Ugly casting workaround because I can't figure out how to make TS understand that in this case block
+                    // the listener argument only needs to be a TreeEvent. Should go away if/when we make the listener signature
+                    // for changing and subtreeChanging match the one for beforeChange and afterChange.
+                    listener({ target: treeNode });
+                });
+                return unsubscribeFromChildrenBeforeChange;
+            }
+            case "afterChange": {
+                const unsubscribeFromChildrenAfterChange = __classPrivateFieldGet(this, _LazyTreeNode_anchorNode, "f").on("afterChange", (anchorNode) => {
+                    const treeNode = anchorNode.slots.get(lazyTreeSlot);
+                    assert(treeNode !== undefined, 0x7d4 /* tree node not found in anchor node slots */);
+                    // Ugly casting workaround because I can't figure out how to make TS understand that in this case block
+                    // the listener argument only needs to be a TreeEvent. Should go away if/when we make the listener signature
+                    // for changing and subtreeChanging match the one for beforeChange and afterChange.
+                    listener({ target: treeNode });
+                });
+                return unsubscribeFromChildrenAfterChange;
+            }
+            default:
+                unreachableCase(eventName);
+        }
+    }
+    [onNextChange](fn) {
+        assert(__classPrivateFieldGet(this, _LazyTreeNode_removeNextChangeCallback, "f") === undefined, 0x806 /* Only one subscriber may listen to next tree node change at a time */);
+        __classPrivateFieldSet(this, _LazyTreeNode_removeNextChangeCallback, __classPrivateFieldGet(this, _LazyTreeNode_anchorNode, "f").on("childrenChanged", () => {
+            __classPrivateFieldGet(this, _LazyTreeNode_removeNextChangeCallback, "f")?.call(this);
+            __classPrivateFieldSet(this, _LazyTreeNode_removeNextChangeCallback, undefined, "f");
+            fn(this);
+        }), "f");
+        const removeNextChangeCallback = __classPrivateFieldGet(this, _LazyTreeNode_removeNextChangeCallback, "f");
+        return () => {
+            // Only reset our saved callback if it's the one we closed over in the first place.
+            // It will be different if this is being called after a subsequent registration.
+            if (__classPrivateFieldGet(this, _LazyTreeNode_removeNextChangeCallback, "f") === removeNextChangeCallback) {
+                __classPrivateFieldGet(this, _LazyTreeNode_removeNextChangeCallback, "f").call(this);
+                __classPrivateFieldSet(this, _LazyTreeNode_removeNextChangeCallback, undefined, "f");
+            }
+        };
+    }
+}
+export class LazyMap extends LazyTreeNode {
+    constructor(context, schema, cursor, anchorNode, anchor) {
+        super(context, schema, cursor, anchorNode, anchor);
+        // Setup JS Object API:
+        makePropertyEnumerableOwn(this, "asObject", LazyMap.prototype);
+    }
+    get size() {
+        let fieldCount = 0;
+        forEachField(this[cursorSymbol], () => (fieldCount += 1));
+        return fieldCount;
+    }
+    keys() {
+        return mapCursorFields(this[cursorSymbol], (cursor) => cursor.getFieldKey()).values();
+    }
+    values() {
+        return mapCursorFields(this[cursorSymbol], (cursor) => unboxedField(this.context, this.schema.info, cursor)).values();
+    }
+    entries() {
+        return mapCursorFields(this[cursorSymbol], (cursor) => {
+            const entry = [
+                cursor.getFieldKey(),
+                unboxedField(this.context, this.schema.info, cursor),
+            ];
+            return entry;
+        }).values();
+    }
+    forEach(callbackFn, thisArg) {
+        const fn = thisArg !== undefined ? callbackFn.bind(thisArg) : callbackFn;
+        for (const [key, value] of this.entries()) {
+            fn(value, key, this);
+        }
+    }
+    has(key) {
+        return this.tryGetField(brand(key)) !== undefined;
+    }
+    get(key) {
+        return inCursorField(this[cursorSymbol], brand(key), (cursor) => unboxedField(this.context, this.schema.info, cursor));
+    }
+    getBoxed(key) {
+        return inCursorField(this[cursorSymbol], brand(key), (cursor) => makeField(this.context, this.schema.info, cursor));
+    }
+    set(key, content) {
+        const field = this.getBoxed(key);
+        const fieldSchema = this.schema.info;
+        if (fieldSchema.kind === FieldKinds.optional) {
+            const optionalField = field;
+            optionalField.content = content;
+        }
+        else {
+            assert(fieldSchema.kind === FieldKinds.sequence, 0x807 /* Unexpected map field kind */);
+            // TODO: implement setting of sequence fields once we have defined clear merged semantics for doing so.
+            // For now, we will throw an error, since the public API does not currently expose a way to do this anyways.
+            throw new Error("Setting of sequence values in maps is not yet supported.");
+        }
+    }
+    delete(key) {
+        // Since all keys implicitly exist under a Map node, and we represent "no value" with `undefined`,
+        // "deleting" a key/value pair is the same as setting the value to `undefined`.
+        this.set(key, undefined);
+    }
+    [boxedIterator]() {
+        return super[boxedIterator]();
+    }
+    [Symbol.iterator]() {
+        return this.entries();
+    }
+    get asObject() {
+        const record = Object.create(null);
+        forEachField(this[cursorSymbol], (cursor) => {
+            Object.defineProperty(record, cursor.getFieldKey(), {
+                value: unboxedField(this.context, this.schema.info, cursor),
+                configurable: true,
+                enumerable: true,
+            });
+        });
+        return record;
+    }
+}
+export class LazyLeaf extends LazyTreeNode {
+    constructor(context, schema, cursor, anchorNode, anchor) {
+        super(context, schema, cursor, anchorNode, anchor);
+        // Setup JS Object API:
+        makePropertyEnumerableOwn(this, "value", LazyTreeNode.prototype);
+    }
+    get value() {
+        return super.value;
+    }
+}
+export class LazyFieldNode extends LazyTreeNode {
+    get content() {
+        return inCursorField(this[cursorSymbol], EmptyKey, (cursor) => unboxedField(this.context, this.schema.info, cursor));
+    }
+    get boxedContent() {
+        return inCursorField(this[cursorSymbol], EmptyKey, (cursor) => makeField(this.context, this.schema.info, cursor));
+    }
+}
+export class LazyObjectNode extends LazyTreeNode {
+    get localNodeKey() {
+        // TODO: Optimize this to be in the derived class so it can cache schema lookup.
+        // TODO: Optimize this to avoid allocating the field object.
+        const key = this.context.nodeKeyFieldKey;
+        const fieldSchema = this.schema.objectNodeFields.get(key);
+        if (fieldSchema === undefined) {
+            return undefined;
+        }
+        const field = this.tryGetField(key);
+        assert(field instanceof LazyNodeKeyField, 0x7b4 /* unexpected node key field */);
+        // TODO: ideally we would do something like this, but that adds dependencies we can't have here:
+        // assert(
+        // 	field.is(TreeFieldSchema.create(FieldKinds.nodeKey, [nodeKeyTreeSchema])),
+        // 	"invalid node key field",
+        // );
+        if (this.context.nodeKeyFieldKey === undefined) {
+            return undefined;
+        }
+        return field.localNodeKey;
+    }
+}
+export function buildLazyObjectNode(context, schema, cursor, anchorNode, anchor) {
+    const objectNodeClass = getOrCreate(cachedStructClasses, schema, () => buildStructClass(schema));
+    return new objectNodeClass(context, cursor, anchorNode, anchor);
+}
+const cachedStructClasses = new WeakMap();
+export function getBoxedField(objectNode, key, fieldSchema) {
+    return inCursorField(objectNode[cursorSymbol], key, (cursor) => {
+        return makeField(objectNode.context, fieldSchema, cursor);
+    });
+}
+function buildStructClass(schema) {
+    const propertyDescriptorMap = {};
+    const ownPropertyMap = {};
+    for (const [key, fieldSchema] of schema.objectNodeFields) {
+        let setter;
+        switch (fieldSchema.kind) {
+            case FieldKinds.optional: {
+                setter = function (newContent) {
+                    const field = getBoxedField(this, key, fieldSchema);
+                    field.content = newContent;
+                };
+                break;
+            }
+            case FieldKinds.required: {
+                setter = function (newContent) {
+                    const field = getBoxedField(this, key, fieldSchema);
+                    field.content = newContent;
+                };
+                break;
+            }
+            default:
+                setter = undefined;
+                break;
+        }
+        // Create getter and setter (when appropriate) for property
+        ownPropertyMap[key] = {
+            enumerable: true,
+            get() {
+                return inCursorField(this[cursorSymbol], key, (cursor) => unboxedField(this.context, fieldSchema, cursor));
+            },
+            set: setter,
+        };
+        // Create set method for property (when appropriate)
+        if (setter !== undefined) {
+            propertyDescriptorMap[`set${capitalize(key)}`] = {
+                enumerable: false,
+                get() {
+                    return setter;
+                },
+            };
+        }
+        propertyDescriptorMap[`boxed${capitalize(key)}`] = {
+            enumerable: false,
+            get() {
+                return getBoxedField(this, key, fieldSchema);
+            },
+        };
+    }
+    // This must implement `StructTyped<TSchema>`, but TypeScript can't constrain it to do so.
+    class CustomStruct extends LazyObjectNode {
+        constructor(context, cursor, anchorNode, anchor) {
+            super(context, schema, cursor, anchorNode, anchor);
+            Object.defineProperties(this, ownPropertyMap);
+        }
+    }
+    Object.defineProperties(CustomStruct.prototype, propertyDescriptorMap);
+    return CustomStruct;
+}
+//# sourceMappingURL=lazyNode.js.map

package/lib/feature-libraries/flex-tree/lazyNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lazyNode.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/lazyNode.ts"],"names":[],"mappings":"AAAA;;;GAGG;;;;;;;;;;;;;AAEH,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AACrE,OAAO,EAMN,eAAe,EAEf,UAAU,EAEV,aAAa,EACb,YAAY,EACZ,QAAQ,EAER,YAAY,GAEZ,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACjF,OAAO,EACN,eAAe,EAGf,iBAAiB,EACjB,YAAY,EACZ,WAAW,EACX,kBAAkB,EAIlB,GAAG,GAEH,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAI/C,OAAO,EAWN,aAAa,EACb,UAAU,EAKV,YAAY,EACZ,kBAAkB,EAClB,cAAc,GACd,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC1D,OAAO,EACN,UAAU,EACV,YAAY,EACZ,kBAAkB,EAClB,aAAa,EACb,yBAAyB,EACzB,2BAA2B,GAC3B,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,EAAE,yBAAyB,EAAE,MAAM,aAAa,CAAC;AAExD,MAAM,YAAY,GAAG,UAAU,EAAgB,CAAC;AAEhD,MAAM,UAAU,QAAQ,CAAC,OAAgB,EAAE,MAA+B;IACzE,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,UAAU,GACf,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;QACrC,IAAI,CAAC,qEAAqE,CAAC,CAAC;IAC7E,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAClD,IAAI,MAAM,KAAK,SAAS,EAAE;QACzB,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,OAAO,KAAK,OAAO,EAAE,KAAK,CAAC,yBAAyB,CAAC,CAAC;QACpE,OAAO,MAAM,CAAC;KACd;IACD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC;IACpF,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;IAC1E,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;IAC3C,UAAU,CAAC,EAAE,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;IAC3C,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAAC,MAAkB;IACtC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,qCAAqC,CAAC,CAAC;IAC7F,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;AACzB,CAAC;AAED,SAAS,aAAa,CACrB,OAAgB,EAChB,MAAsB,EACtB,MAA+B,EAC/B,UAAsB,EACtB,MAAc;IAEd,IAAI,WAAW,CAAC,MAAM,CAAC,EAAE;QACxB,OAAO,IAAI,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;KAChE;IACD,IAAI,YAAY,CAAC,MAAM,CAAC,EAAE;QACzB,OAAO,IAAI,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;KACjE;IACD,IAAI,iBAAiB,CAAC,MAAM,CAAC,EAAE;QAC9B,OAAO,IAAI,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;KACtE;IACD,IAAI,kBAAkB,CAAC,MAAM,CAAC,EAAE;QAC/B,OAAO,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;KACxE;IACD,qGAAqG;IACrG,IAAI,CAAC,wBAAwB,CAAC,CAAC;AAChC,CAAC;AAED;;GAEG;AACH,MAAM,OAAgB,YACrB,SAAQ,UAA2B;IAGnC,IAAW,wJAAC,cAAc,EAAC;QAC1B,OAAO,kBAAkB,CAAC,IAAI,CAAC;IAChC,CAAC;IAaD,YACC,OAAgB,EAChB,MAAe,EACf,MAA+B,EAC/B,UAAsB,EACtB,MAAc;QAEd,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAdxC,qHAAqH;QAC5G,qDAAkC;QAElC,2CAAwB;QAEjC,yDAAoD;QAUnD,uBAAA,IAAI,4BAAe,UAAU,MAAA,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,IAAI,qCAA6B,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;QAEpF,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACzC,uBAAA,IAAI,sCAAyB,UAAU,CAAC,EAAE,CAAC,cAAc,EAAE,WAAW,CAAC,MAAA,CAAC;QAExE,MAAM,CACL,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,SAAS,EAClE,KAAK,CAAC,6IAA6I,CACnJ,CAAC;QAEF,uBAAuB;QACvB,kEAAkE;QAClE,wDAAwD;QACxD,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,CAAC;IAEM,EAAE,CACR,MAAoB;QAEpB,MAAM,CACL,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,EAC1D,KAAK,CAAC,oEAAoE,CAC1E,CAAC;QACF,OAAO,IAAI,CAAC,MAAM,KAAM,MAAkB,CAAC;IAC5C,CAAC;IAEkB,CAAC,2BAA2B,CAAC,CAC/C,MAAc,EACd,MAA+B;QAE/B,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChE,CAAC;IAEkB,CAAC,kBAAkB,CAAC,CAAC,MAAc;QACrD,4GAA4G;QAC5G,iDAAiD;QACjD,2GAA2G;QAC3G,uBAAA,IAAI,gCAAY,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAC5C,uBAAA,IAAI,0CAAsB,MAA1B,IAAI,CAAwB,CAAC;QAC7B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5C,CAAC;IAED,IAAW,KAAK;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC;IACjC,CAAC;IAEM,WAAW,CAAC,QAAkB;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACpD,OAAO,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE;YAC7D,IAAI,MAAM,CAAC,cAAc,EAAE,KAAK,CAAC,EAAE;gBAClC,OAAO,SAAS,CAAC;aACjB;YACD,OAAO,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACJ,CAAC;IAEM,CAAC,aAAa,CAAC;QACrB,OAAO,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CACrD,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,EAAE,MAAM,CAAC,CACjF,CAAC,MAAM,EAAE,CAAC;IACZ,CAAC;IAED,IAAW,WAAW;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,uBAAA,IAAI,gCAAY,CAAC,WAAW,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,UAAU,KAAK,KAAK,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;QACpE,MAAM,GAAG,GAAG,uBAAA,IAAI,gCAAY,CAAC,WAAW,CAAC;QAEzC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAClB,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,WAAW,EAAE,EAAE,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAClE,IAAI,WAA4B,CAAC;QAEjC,uDAAuD;QACvD,IAAI,uBAAA,IAAI,gCAAY,CAAC,MAAM,KAAK,SAAS,EAAE;YAC1C,uFAAuF;YACvF,kDAAkD;YAClD,IAAI,GAAG,KAAK,YAAY,EAAE;gBACzB,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,eAAe,CAAC;aAClD;iBAAM;gBACN,uDAAuD;gBACvD,mGAAmG;gBACnG,8DAA8D;gBAC9D,mHAAmH;gBACnH,EAAE;gBACF,QAAQ;gBACR,8EAA8E;gBAC9E,kEAAkE;gBAClE,4JAA4J;gBAC5J,mCAAmC;gBACnC,gNAAgN;gBAChN,+NAA+N;gBAC/N,qJAAqJ;gBACrJ,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;aACjE;SACD;aAAM;YACN,MAAM,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC;YAC/B,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YACvB,MAAM,UAAU,GACf,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC;gBAC9C,IAAI,CAAC,sCAAsC,CAAC,CAAC;YAC9C,WAAW,GAAG,UAAU,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;SAC7C;QAED,MAAM,cAAc,GAAG,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;QACpE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAExB,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC;IAC1C,CAAC;IAEe,UAAU;QACzB,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE;YAC1B,OAAO,UAAU,CAAC,OAAO,CAAC;SAC1B;QACD,OAAO,yBAAyB,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,uBAAA,IAAI,gCAAY,CAAC,CAAC;IACjF,CAAC;IAEM,EAAE,CACR,SAAY,EACZ,QAA+B;QAE/B,QAAQ,SAAS,EAAE;YAClB,KAAK,UAAU,CAAC,CAAC;gBAChB,MAAM,6BAA6B,GAAG,uBAAA,IAAI,gCAAY,CAAC,EAAE,CACxD,kBAAkB,EAClB,CAAC,UAAsB,EAAE,EAAE;gBAC1B,uGAAuG;gBACvG,8GAA8G;gBAC9G,mFAAmF;gBACnF,QAAQ,CAAC,UAA+C,CAAC,CAC1D,CAAC;gBACF,OAAO,6BAA6B,CAAC;aACrC;YACD,KAAK,iBAAiB,CAAC,CAAC;gBACvB,MAAM,4BAA4B,GAAG,uBAAA,IAAI,gCAAY,CAAC,EAAE,CACvD,iBAAiB,EACjB,CAAC,UAAsB,EAAE,EAAE;gBAC1B,uGAAuG;gBACvG,8GAA8G;gBAC9G,mFAAmF;gBACnF,QAAQ,CAAC,UAA+C,CAAC,CAC1D,CAAC;gBACF,OAAO,4BAA4B,CAAC;aACpC;YACD,KAAK,cAAc,CAAC,CAAC;gBACpB,MAAM,mCAAmC,GAAG,uBAAA,IAAI,gCAAY,CAAC,EAAE,CAC9D,cAAc,EACd,CAAC,UAAsB,EAAE,EAAE;oBAC1B,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;oBACpD,MAAM,CACL,QAAQ,KAAK,SAAS,EACtB,KAAK,CAAC,8CAA8C,CACpD,CAAC;oBACF,uGAAuG;oBACvG,4GAA4G;oBAC5G,mFAAmF;oBACnF,QAAQ,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAuC,CAAC,CAAC;gBACrE,CAAC,CACD,CAAC;gBACF,OAAO,mCAAmC,CAAC;aAC3C;YACD,KAAK,aAAa,CAAC,CAAC;gBACnB,MAAM,kCAAkC,GAAG,uBAAA,IAAI,gCAAY,CAAC,EAAE,CAC7D,aAAa,EACb,CAAC,UAAsB,EAAE,EAAE;oBAC1B,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;oBACpD,MAAM,CACL,QAAQ,KAAK,SAAS,EACtB,KAAK,CAAC,8CAA8C,CACpD,CAAC;oBACF,uGAAuG;oBACvG,4GAA4G;oBAC5G,mFAAmF;oBACnF,QAAQ,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAuC,CAAC,CAAC;gBACrE,CAAC,CACD,CAAC;gBACF,OAAO,kCAAkC,CAAC;aAC1C;YACD;gBACC,eAAe,CAAC,SAAS,CAAC,CAAC;SAC5B;IACF,CAAC;IAEM,CAAC,YAAY,CAAC,CAAC,EAAgC;QACrD,MAAM,CACL,uBAAA,IAAI,8CAA0B,KAAK,SAAS,EAC5C,KAAK,CAAC,uEAAuE,CAC7E,CAAC;QACF,uBAAA,IAAI,0CAA6B,uBAAA,IAAI,gCAAY,CAAC,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC5E,uBAAA,IAAI,8CAA0B,EAAE,KAAhC,IAAI,CAA8B,CAAC;YACnC,uBAAA,IAAI,0CAA6B,SAAS,MAAA,CAAC;YAC3C,EAAE,CAAC,IAAI,CAAC,CAAC;QACV,CAAC,CAAC,MAAA,CAAC;QACH,MAAM,wBAAwB,GAAG,uBAAA,IAAI,8CAA0B,CAAC;QAChE,OAAO,GAAG,EAAE;YACX,mFAAmF;YACnF,gFAAgF;YAChF,IAAI,uBAAA,IAAI,8CAA0B,KAAK,wBAAwB,EAAE;gBAChE,uBAAA,IAAI,8CAA0B,MAA9B,IAAI,CAA4B,CAAC;gBACjC,uBAAA,IAAI,0CAA6B,SAAS,MAAA,CAAC;aAC3C;QACF,CAAC,CAAC;IACH,CAAC;CACD;AAED,MAAM,OAAO,OACZ,SAAQ,YAAqB;IAG7B,YACC,OAAgB,EAChB,MAAe,EACf,MAA+B,EAC/B,UAAsB,EACtB,MAAc;QAEd,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;QAEnD,uBAAuB;QACvB,yBAAyB,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;IAChE,CAAC;IAED,IAAW,IAAI;QACd,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1D,OAAO,UAAU,CAAC;IACnB,CAAC;IAEM,IAAI;QACV,OAAO,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;IACvF,CAAC;IAEM,MAAM;QACZ,OAAO,eAAe,CACrB,IAAI,CAAC,YAAY,CAAC,EAClB,CAAC,MAAM,EAAE,EAAE,CACV,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAGlD,CACF,CAAC,MAAM,EAAE,CAAC;IACZ,CAAC;IAEM,OAAO;QAGb,OAAO,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;YACrD,MAAM,KAAK,GAAgE;gBAC1E,MAAM,CAAC,WAAW,EAAE;gBACpB,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAGlD;aACD,CAAC;YACF,OAAO,KAAK,CAAC;QACd,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACb,CAAC;IAEM,OAAO,CACb,UAIS,EACT,OAAa;QAEb,MAAM,EAAE,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QACzE,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAC1C,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;SACrB;IACF,CAAC;IAEM,GAAG,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,SAAS,CAAC;IACnD,CAAC;IAEM,GAAG,CAAC,GAAW;QACrB,OAAO,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAC/D,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CACb,CAAC;IAC1C,CAAC;IAEM,QAAQ,CAAC,GAAW;QAC1B,OAAO,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAC/D,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CACV,CAAC;IAC1C,CAAC;IAEM,GAAG,CAAC,GAAW,EAAE,OAA0D;QACjF,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACjC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;QAErC,IAAI,WAAW,CAAC,IAAI,KAAK,UAAU,CAAC,QAAQ,EAAE;YAC7C,MAAM,aAAa,GAAG,KAA4C,CAAC;YACnE,aAAa,CAAC,OAAO,GAAG,OAAO,CAAC;SAChC;aAAM;YACN,MAAM,CAAC,WAAW,CAAC,IAAI,KAAK,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,+BAA+B,CAAC,CAAC;YAExF,uGAAuG;YACvG,4GAA4G;YAC5G,MAAM,IAAI,KAAK,CAAC,0DAA0D,CAAC,CAAC;SAC5E;IACF,CAAC;IAEM,MAAM,CAAC,GAAa;QAC1B,kGAAkG;QAClG,+EAA+E;QAC/E,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;IAC1B,CAAC;IAEe,CAAC,aAAa,CAAC;QAC9B,OAAO,KAAK,CAAC,aAAa,CAAC,EAA2D,CAAC;IACxF,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QAGvB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAED,IAAW,QAAQ;QAGlB,MAAM,MAAM,GAGR,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAExB,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;YAC3C,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,EAAE,EAAE;gBACnD,KAAK,EAAE,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;gBAC3D,YAAY,EAAE,IAAI;gBAClB,UAAU,EAAE,IAAI;aAChB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IACf,CAAC;CACD;AAED,MAAM,OAAO,QACZ,SAAQ,YAAqB;IAG7B,YACC,OAAgB,EAChB,MAAe,EACf,MAA+B,EAC/B,UAAsB,EACtB,MAAc;QAEd,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;QAEnD,uBAAuB;QACvB,yBAAyB,CAAC,IAAI,EAAE,OAAO,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC;IAClE,CAAC;IAED,IAAoB,KAAK;QACxB,OAAO,KAAK,CAAC,KAAmC,CAAC;IAClD,CAAC;CACD;AAED,MAAM,OAAO,aACZ,SAAQ,YAAqB;IAG7B,IAAW,OAAO;QACjB,OAAO,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAC7D,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CACb,CAAC;IAC1C,CAAC;IAED,IAAW,YAAY;QACtB,OAAO,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAC7D,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CACV,CAAC;IAC1C,CAAC;CACD;AAED,MAAM,OAAgB,cACrB,SAAQ,YAAqB;IAG7B,IAAW,YAAY;QACtB,gFAAgF;QAChF,4DAA4D;QAE5D,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC;QACzC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAE1D,IAAI,WAAW,KAAK,SAAS,EAAE;YAC9B,OAAO,SAAS,CAAC;SACjB;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,CAAC,KAAK,YAAY,gBAAgB,EAAE,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACjF,gGAAgG;QAChG,UAAU;QACV,8EAA8E;QAC9E,6BAA6B;QAC7B,KAAK;QAEL,IAAI,IAAI,CAAC,OAAO,CAAC,eAAe,KAAK,SAAS,EAAE;YAC/C,OAAO,SAAS,CAAC;SACjB;QAED,OAAO,KAAK,CAAC,YAAY,CAAC;IAC3B,CAAC;CACD;AAED,MAAM,UAAU,mBAAmB,CAClC,OAAgB,EAChB,MAAe,EACf,MAA+B,EAC/B,UAAsB,EACtB,MAAc;IAEd,MAAM,eAAe,GAAG,WAAW,CAAC,mBAAmB,EAAE,MAAM,EAAE,GAAG,EAAE,CACrE,gBAAgB,CAAC,MAAM,CAAC,CACxB,CAAC;IACF,OAAO,IAAI,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAC7B,CAAC;AACnC,CAAC;AAED,MAAM,mBAAmB,GAAG,IAAI,OAAO,EAQpC,CAAC;AAEJ,MAAM,UAAU,aAAa,CAC5B,UAAwB,EACxB,GAAa,EACb,WAA4B;IAE5B,OAAO,aAAa,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE;QAC9D,OAAO,SAAS,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CACxB,MAAe;IAOf,MAAM,qBAAqB,GAA0B,EAAE,CAAC;IACxD,MAAM,cAAc,GAA0B,EAAE,CAAC;IAEjD,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,gBAAgB,EAAE;QACzD,IAAI,MAA6E,CAAC;QAClF,QAAQ,WAAW,CAAC,IAAI,EAAE;YACzB,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC;gBACzB,MAAM,GAAG,UAER,UAAyD;oBAEzD,MAAM,KAAK,GAAG,aAAa,CAC1B,IAAI,EACJ,GAAG,EACH,WAAW,CAC4B,CAAC;oBACzC,KAAK,CAAC,OAAO,GAAG,UAAU,CAAC;gBAC5B,CAAC,CAAC;gBACF,MAAM;aACN;YACD,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC;gBACzB,MAAM,GAAG,UAER,UAA6C;oBAE7C,MAAM,KAAK,GAAG,aAAa,CAC1B,IAAI,EACJ,GAAG,EACH,WAAW,CAC4B,CAAC;oBACzC,KAAK,CAAC,OAAO,GAAG,UAAU,CAAC;gBAC5B,CAAC,CAAC;gBACF,MAAM;aACN;YACD;gBACC,MAAM,GAAG,SAAS,CAAC;gBACnB,MAAM;SACP;QAED,2DAA2D;QAC3D,cAAc,CAAC,GAAG,CAAC,GAAG;YACrB,UAAU,EAAE,IAAI;YAChB,GAAG;gBACF,OAAO,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,CACxD,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,CAC/C,CAAC;YACH,CAAC;YACD,GAAG,EAAE,MAAM;SACX,CAAC;QAEF,oDAAoD;QACpD,IAAI,MAAM,KAAK,SAAS,EAAE;YACzB,qBAAqB,CAAC,MAAM,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG;gBAChD,UAAU,EAAE,KAAK;gBACjB,GAAG;oBACF,OAAO,MAAM,CAAC;gBACf,CAAC;aACD,CAAC;SACF;QAED,qBAAqB,CAAC,QAAQ,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG;YAClD,UAAU,EAAE,KAAK;YACjB,GAAG;gBACF,OAAO,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;YAC9C,CAAC;SACD,CAAC;KACF;IAED,0FAA0F;IAC1F,MAAM,YAAa,SAAQ,cAAuB;QACjD,YACC,OAAgB,EAChB,MAA+B,EAC/B,UAAsB,EACtB,MAAc;YAEd,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;YACnD,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;QAC/C,CAAC;KACD;IAED,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAAC,SAAS,EAAE,qBAAqB,CAAC,CAAC;IAEvE,OAAO,YAAY,CAAC;AACrB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, unreachableCase } from \"@fluidframework/core-utils\";\nimport {\n\tValue,\n\tAnchor,\n\tFieldKey,\n\tTreeNavigationResult,\n\tITreeSubscriptionCursor,\n\tmapCursorFields,\n\tCursorLocationType,\n\tanchorSlot,\n\tAnchorNode,\n\tinCursorField,\n\trootFieldKey,\n\tEmptyKey,\n\tTreeNodeSchemaIdentifier,\n\tforEachField,\n\tTreeValue,\n} from \"../../core\";\nimport { brand, capitalize, disposeSymbol, fail, getOrCreate } from \"../../util\";\nimport {\n\tTreeFieldSchema,\n\tTreeNodeSchema,\n\tMapNodeSchema,\n\tschemaIsFieldNode,\n\tschemaIsLeaf,\n\tschemaIsMap,\n\tschemaIsObjectNode,\n\tFieldNodeSchema,\n\tLeafNodeSchema,\n\tObjectNodeSchema,\n\tAny,\n\tAllowedTypes,\n} from \"../typed-schema\";\nimport { FieldKinds } from \"../default-schema\";\nimport { LocalNodeKey } from \"../node-key\";\nimport { EditableTreeEvents, TreeEvent } from \"./treeEvents\";\nimport { Context } from \"./context\";\nimport {\n\tFlexTreeFieldNode,\n\tFlexTreeLeafNode,\n\tFlexTreeMapNode,\n\tFlexTreeObjectNode,\n\tFlexTreeObjectNodeTyped,\n\tFlexTreeTypedField,\n\tFlexTreeTypedNode,\n\tFlexTreeUnboxField,\n\tFlexTreeField,\n\tFlexTreeNode,\n\tboxedIterator,\n\tTreeStatus,\n\tFlexTreeRequiredField,\n\tFlexTreeOptionalField,\n\tFlexibleFieldContent,\n\tFlexibleNodeContent,\n\tonNextChange,\n\tFlexTreeEntityKind,\n\tflexTreeMarker,\n} from \"./flexTreeTypes\";\nimport { LazyNodeKeyField, makeField } from \"./lazyField\";\nimport {\n\tLazyEntity,\n\tcursorSymbol,\n\tforgetAnchorSymbol,\n\tisFreedSymbol,\n\tmakePropertyEnumerableOwn,\n\ttryMoveCursorToAnchorSymbol,\n} from \"./lazyEntity\";\nimport { unboxedField } from \"./unboxed\";\nimport { treeStatusFromAnchorCache } from \"./utilities\";\n\nconst lazyTreeSlot = anchorSlot<LazyTreeNode>();\n\nexport function makeTree(context: Context, cursor: ITreeSubscriptionCursor): LazyTreeNode {\n\tconst anchor = cursor.buildAnchor();\n\tconst anchorNode =\n\t\tcontext.forest.anchors.locate(anchor) ??\n\t\tfail(\"cursor should point to a node that is not the root of the AnchorSet\");\n\tconst cached = anchorNode.slots.get(lazyTreeSlot);\n\tif (cached !== undefined) {\n\t\tcontext.forest.anchors.forget(anchor);\n\t\tassert(cached.context === context, 0x782 /* contexts must match */);\n\t\treturn cached;\n\t}\n\tconst schema = context.schema.nodeSchema.get(cursor.type) ?? fail(\"missing schema\");\n\tconst output = buildSubclass(context, schema, cursor, anchorNode, anchor);\n\tanchorNode.slots.set(lazyTreeSlot, output);\n\tanchorNode.on(\"afterDestroy\", cleanupTree);\n\treturn output;\n}\n\nfunction cleanupTree(anchor: AnchorNode): void {\n\tconst cached = anchor.slots.get(lazyTreeSlot) ?? fail(\"tree should only be cleaned up once\");\n\tcached[disposeSymbol]();\n}\n\nfunction buildSubclass(\n\tcontext: Context,\n\tschema: TreeNodeSchema,\n\tcursor: ITreeSubscriptionCursor,\n\tanchorNode: AnchorNode,\n\tanchor: Anchor,\n): LazyTreeNode {\n\tif (schemaIsMap(schema)) {\n\t\treturn new LazyMap(context, schema, cursor, anchorNode, anchor);\n\t}\n\tif (schemaIsLeaf(schema)) {\n\t\treturn new LazyLeaf(context, schema, cursor, anchorNode, anchor);\n\t}\n\tif (schemaIsFieldNode(schema)) {\n\t\treturn new LazyFieldNode(context, schema, cursor, anchorNode, anchor);\n\t}\n\tif (schemaIsObjectNode(schema)) {\n\t\treturn buildLazyObjectNode(context, schema, cursor, anchorNode, anchor);\n\t}\n\t// TODO: there should be a common fallback that works for cases without a specialized implementation.\n\tfail(\"unrecognized node kind\");\n}\n\n/**\n * Lazy implementation of {@link FlexTreeNode}.\n */\nexport abstract class LazyTreeNode<TSchema extends TreeNodeSchema = TreeNodeSchema>\n\textends LazyEntity<TSchema, Anchor>\n\timplements FlexTreeNode\n{\n\tpublic get [flexTreeMarker](): FlexTreeEntityKind.Node {\n\t\treturn FlexTreeEntityKind.Node;\n\t}\n\t/**\n\t * Enumerable own property providing a more JS object friendly alternative to \"schema\".\n\t */\n\tpublic readonly type: TreeNodeSchemaIdentifier;\n\n\t// Using JS private here prevents it from showing up as a enumerable own property, or conflicting with struct fields.\n\treadonly #removeDeleteCallback: () => void;\n\n\treadonly #anchorNode: AnchorNode;\n\n\t#removeNextChangeCallback: (() => void) | undefined;\n\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: TSchema,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tanchorNode: AnchorNode,\n\t\tanchor: Anchor,\n\t) {\n\t\tsuper(context, schema, cursor, anchor);\n\t\tthis.#anchorNode = anchorNode;\n\t\tassert(cursor.mode === CursorLocationType.Nodes, 0x783 /* must be in nodes mode */);\n\n\t\tanchorNode.slots.set(lazyTreeSlot, this);\n\t\tthis.#removeDeleteCallback = anchorNode.on(\"afterDestroy\", cleanupTree);\n\n\t\tassert(\n\t\t\tthis.context.schema.nodeSchema.get(this.schema.name) !== undefined,\n\t\t\t0x784 /* There is no explicit schema for this node type. Ensure that the type is correct and the schema for it was added to the TreeStoredSchema */,\n\t\t);\n\n\t\t// Setup JS Object API:\n\t\t// makePrivatePropertyNotEnumerable(this, \"removeDeleteCallback\");\n\t\t// makePrivatePropertyNotEnumerable(this, \"anchorNode\");\n\t\tthis.type = schema.name;\n\t}\n\n\tpublic is<TSchemaInner extends TreeNodeSchema>(\n\t\tschema: TSchemaInner,\n\t): this is FlexTreeTypedNode<TSchemaInner> {\n\t\tassert(\n\t\t\tthis.context.schema.nodeSchema.get(schema.name) === schema,\n\t\t\t0x785 /* Narrowing must be done to a schema that exists in this context */,\n\t\t);\n\t\treturn this.schema === (schema as unknown);\n\t}\n\n\tprotected override [tryMoveCursorToAnchorSymbol](\n\t\tanchor: Anchor,\n\t\tcursor: ITreeSubscriptionCursor,\n\t): TreeNavigationResult {\n\t\treturn this.context.forest.tryMoveCursorToNode(anchor, cursor);\n\t}\n\n\tprotected override [forgetAnchorSymbol](anchor: Anchor): void {\n\t\t// This type unconditionally has an anchor, so `forgetAnchor` is always called and cleanup can be done here:\n\t\t// After this point this node will not be usable,\n\t\t// so remove it from the anchor incase a different context (or the same context later) uses this AnchorSet.\n\t\tthis.#anchorNode.slots.delete(lazyTreeSlot);\n\t\tthis.#removeDeleteCallback();\n\t\tthis.context.forest.anchors.forget(anchor);\n\t}\n\n\tpublic get value(): Value {\n\t\treturn this[cursorSymbol].value;\n\t}\n\n\tpublic tryGetField(fieldKey: FieldKey): FlexTreeField | undefined {\n\t\tconst schema = this.schema.getFieldSchema(fieldKey);\n\t\treturn inCursorField(this[cursorSymbol], fieldKey, (cursor) => {\n\t\t\tif (cursor.getFieldLength() === 0) {\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t\treturn makeField(this.context, schema, cursor);\n\t\t});\n\t}\n\n\tpublic [boxedIterator](): IterableIterator<FlexTreeField> {\n\t\treturn mapCursorFields(this[cursorSymbol], (cursor) =>\n\t\t\tmakeField(this.context, this.schema.getFieldSchema(cursor.getFieldKey()), cursor),\n\t\t).values();\n\t}\n\n\tpublic get parentField(): { readonly parent: FlexTreeField; readonly index: number } {\n\t\tconst cursor = this[cursorSymbol];\n\t\tconst index = this.#anchorNode.parentIndex;\n\t\tassert(cursor.fieldIndex === index, 0x786 /* mismatched indexes */);\n\t\tconst key = this.#anchorNode.parentField;\n\n\t\tcursor.exitNode();\n\t\tassert(key === cursor.getFieldKey(), 0x787 /* mismatched keys */);\n\t\tlet fieldSchema: TreeFieldSchema;\n\n\t\t// Check if the current node is in a detached sequence.\n\t\tif (this.#anchorNode.parent === undefined) {\n\t\t\t// Parent field is a detached sequence, and thus needs special handling for its schema.\n\t\t\t// eslint-disable-next-line unicorn/prefer-ternary\n\t\t\tif (key === rootFieldKey) {\n\t\t\t\tfieldSchema = this.context.schema.rootFieldSchema;\n\t\t\t} else {\n\t\t\t\t// All fields (in the editable tree API) have a schema.\n\t\t\t\t// Since currently there is no known schema for detached field other than the special default root:\n\t\t\t\t// give all other detached fields a schema of sequence of any.\n\t\t\t\t// That schema is the only one that is safe since its the only field schema that allows any possible field content.\n\t\t\t\t//\n\t\t\t\t// TODO:\n\t\t\t\t// if any of the following are done this schema will need to be more specific:\n\t\t\t\t// 1. Editing APIs start exposing user created detached sequences.\n\t\t\t\t// 2. Remove (and its inverse) start working on subsequences or fields contents (like everything in a sequence or optional field) and not just single nodes.\n\t\t\t\t// 3. Possibly other unknown cases.\n\t\t\t\t// Additionally this approach makes it possible for a user to take an EditableTree node, get its parent, check its schema, down cast based on that, then edit that detached field (ex: removing the node in it).\n\t\t\t\t// This MIGHT work properly with existing merge resolution logic (it must keep client in sync and be unable to violate schema), but this either needs robust testing or to be explicitly banned (error before s3ending the op).\n\t\t\t\t// Issues like replacing a node in the a removed sequenced then undoing the remove could easily violate schema if not everything works exactly right!\n\t\t\t\tfieldSchema = TreeFieldSchema.create(FieldKinds.sequence, [Any]);\n\t\t\t}\n\t\t} else {\n\t\t\tcursor.exitField();\n\t\t\tconst parentType = cursor.type;\n\t\t\tcursor.enterField(key);\n\t\t\tconst nodeSchema =\n\t\t\t\tthis.context.schema.nodeSchema.get(parentType) ??\n\t\t\t\tfail(\"requested schema that does not exist\");\n\t\t\tfieldSchema = nodeSchema.getFieldSchema(key);\n\t\t}\n\n\t\tconst proxifiedField = makeField(this.context, fieldSchema, cursor);\n\t\tcursor.enterNode(index);\n\n\t\treturn { parent: proxifiedField, index };\n\t}\n\n\tpublic override treeStatus(): TreeStatus {\n\t\tif (this[isFreedSymbol]()) {\n\t\t\treturn TreeStatus.Deleted;\n\t\t}\n\t\treturn treeStatusFromAnchorCache(this.context.forest.anchors, this.#anchorNode);\n\t}\n\n\tpublic on<K extends keyof EditableTreeEvents>(\n\t\teventName: K,\n\t\tlistener: EditableTreeEvents[K],\n\t): () => void {\n\t\tswitch (eventName) {\n\t\t\tcase \"changing\": {\n\t\t\t\tconst unsubscribeFromChildrenChange = this.#anchorNode.on(\n\t\t\t\t\t\"childrenChanging\",\n\t\t\t\t\t(anchorNode: AnchorNode) =>\n\t\t\t\t\t\t// Ugly casting workaround because I can't figure out how to make TS understand that in this case block\n\t\t\t\t\t\t// the listener argument only needs to be an AnchorNode. Should go away if/when we make the listener signature\n\t\t\t\t\t\t// for changing and subtreeChanging match the one for beforeChange and afterChange.\n\t\t\t\t\t\tlistener(anchorNode as unknown as AnchorNode & TreeEvent),\n\t\t\t\t);\n\t\t\t\treturn unsubscribeFromChildrenChange;\n\t\t\t}\n\t\t\tcase \"subtreeChanging\": {\n\t\t\t\tconst unsubscribeFromSubtreeChange = this.#anchorNode.on(\n\t\t\t\t\t\"subtreeChanging\",\n\t\t\t\t\t(anchorNode: AnchorNode) =>\n\t\t\t\t\t\t// Ugly casting workaround because I can't figure out how to make TS understand that in this case block\n\t\t\t\t\t\t// the listener argument only needs to be an AnchorNode. Should go away if/when we make the listener signature\n\t\t\t\t\t\t// for changing and subtreeChanging match the one for beforeChange and afterChange.\n\t\t\t\t\t\tlistener(anchorNode as unknown as AnchorNode & TreeEvent),\n\t\t\t\t);\n\t\t\t\treturn unsubscribeFromSubtreeChange;\n\t\t\t}\n\t\t\tcase \"beforeChange\": {\n\t\t\t\tconst unsubscribeFromChildrenBeforeChange = this.#anchorNode.on(\n\t\t\t\t\t\"beforeChange\",\n\t\t\t\t\t(anchorNode: AnchorNode) => {\n\t\t\t\t\t\tconst treeNode = anchorNode.slots.get(lazyTreeSlot);\n\t\t\t\t\t\tassert(\n\t\t\t\t\t\t\ttreeNode !== undefined,\n\t\t\t\t\t\t\t0x7d3 /* tree node not found in anchor node slots */,\n\t\t\t\t\t\t);\n\t\t\t\t\t\t// Ugly casting workaround because I can't figure out how to make TS understand that in this case block\n\t\t\t\t\t\t// the listener argument only needs to be a TreeEvent. Should go away if/when we make the listener signature\n\t\t\t\t\t\t// for changing and subtreeChanging match the one for beforeChange and afterChange.\n\t\t\t\t\t\tlistener({ target: treeNode } as unknown as AnchorNode & TreeEvent);\n\t\t\t\t\t},\n\t\t\t\t);\n\t\t\t\treturn unsubscribeFromChildrenBeforeChange;\n\t\t\t}\n\t\t\tcase \"afterChange\": {\n\t\t\t\tconst unsubscribeFromChildrenAfterChange = this.#anchorNode.on(\n\t\t\t\t\t\"afterChange\",\n\t\t\t\t\t(anchorNode: AnchorNode) => {\n\t\t\t\t\t\tconst treeNode = anchorNode.slots.get(lazyTreeSlot);\n\t\t\t\t\t\tassert(\n\t\t\t\t\t\t\ttreeNode !== undefined,\n\t\t\t\t\t\t\t0x7d4 /* tree node not found in anchor node slots */,\n\t\t\t\t\t\t);\n\t\t\t\t\t\t// Ugly casting workaround because I can't figure out how to make TS understand that in this case block\n\t\t\t\t\t\t// the listener argument only needs to be a TreeEvent. Should go away if/when we make the listener signature\n\t\t\t\t\t\t// for changing and subtreeChanging match the one for beforeChange and afterChange.\n\t\t\t\t\t\tlistener({ target: treeNode } as unknown as AnchorNode & TreeEvent);\n\t\t\t\t\t},\n\t\t\t\t);\n\t\t\t\treturn unsubscribeFromChildrenAfterChange;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\tunreachableCase(eventName);\n\t\t}\n\t}\n\n\tpublic [onNextChange](fn: (node: FlexTreeNode) => void): () => void {\n\t\tassert(\n\t\t\tthis.#removeNextChangeCallback === undefined,\n\t\t\t0x806 /* Only one subscriber may listen to next tree node change at a time */,\n\t\t);\n\t\tthis.#removeNextChangeCallback = this.#anchorNode.on(\"childrenChanged\", () => {\n\t\t\tthis.#removeNextChangeCallback?.();\n\t\t\tthis.#removeNextChangeCallback = undefined;\n\t\t\tfn(this);\n\t\t});\n\t\tconst removeNextChangeCallback = this.#removeNextChangeCallback;\n\t\treturn () => {\n\t\t\t// Only reset our saved callback if it's the one we closed over in the first place.\n\t\t\t// It will be different if this is being called after a subsequent registration.\n\t\t\tif (this.#removeNextChangeCallback === removeNextChangeCallback) {\n\t\t\t\tthis.#removeNextChangeCallback();\n\t\t\t\tthis.#removeNextChangeCallback = undefined;\n\t\t\t}\n\t\t};\n\t}\n}\n\nexport class LazyMap<TSchema extends MapNodeSchema>\n\textends LazyTreeNode<TSchema>\n\timplements FlexTreeMapNode<TSchema>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: TSchema,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tanchorNode: AnchorNode,\n\t\tanchor: Anchor,\n\t) {\n\t\tsuper(context, schema, cursor, anchorNode, anchor);\n\n\t\t// Setup JS Object API:\n\t\tmakePropertyEnumerableOwn(this, \"asObject\", LazyMap.prototype);\n\t}\n\n\tpublic get size(): number {\n\t\tlet fieldCount = 0;\n\t\tforEachField(this[cursorSymbol], () => (fieldCount += 1));\n\t\treturn fieldCount;\n\t}\n\n\tpublic keys(): IterableIterator<FieldKey> {\n\t\treturn mapCursorFields(this[cursorSymbol], (cursor) => cursor.getFieldKey()).values();\n\t}\n\n\tpublic values(): IterableIterator<FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">> {\n\t\treturn mapCursorFields(\n\t\t\tthis[cursorSymbol],\n\t\t\t(cursor) =>\n\t\t\t\tunboxedField(this.context, this.schema.info, cursor) as FlexTreeUnboxField<\n\t\t\t\t\tTSchema[\"info\"],\n\t\t\t\t\t\"notEmpty\"\n\t\t\t\t>,\n\t\t).values();\n\t}\n\n\tpublic entries(): IterableIterator<\n\t\t[FieldKey, FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">]\n\t> {\n\t\treturn mapCursorFields(this[cursorSymbol], (cursor) => {\n\t\t\tconst entry: [FieldKey, FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">] = [\n\t\t\t\tcursor.getFieldKey(),\n\t\t\t\tunboxedField(this.context, this.schema.info, cursor) as FlexTreeUnboxField<\n\t\t\t\t\tTSchema[\"info\"],\n\t\t\t\t\t\"notEmpty\"\n\t\t\t\t>,\n\t\t\t];\n\t\t\treturn entry;\n\t\t}).values();\n\t}\n\n\tpublic forEach(\n\t\tcallbackFn: (\n\t\t\tvalue: FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">,\n\t\t\tkey: FieldKey,\n\t\t\tmap: FlexTreeMapNode<TSchema>,\n\t\t) => void,\n\t\tthisArg?: any,\n\t): void {\n\t\tconst fn = thisArg !== undefined ? callbackFn.bind(thisArg) : callbackFn;\n\t\tfor (const [key, value] of this.entries()) {\n\t\t\tfn(value, key, this);\n\t\t}\n\t}\n\n\tpublic has(key: string): boolean {\n\t\treturn this.tryGetField(brand(key)) !== undefined;\n\t}\n\n\tpublic get(key: string): FlexTreeUnboxField<TSchema[\"info\"]> {\n\t\treturn inCursorField(this[cursorSymbol], brand(key), (cursor) =>\n\t\t\tunboxedField(this.context, this.schema.info, cursor),\n\t\t) as FlexTreeUnboxField<TSchema[\"info\"]>;\n\t}\n\n\tpublic getBoxed(key: string): FlexTreeTypedField<TSchema[\"info\"]> {\n\t\treturn inCursorField(this[cursorSymbol], brand(key), (cursor) =>\n\t\t\tmakeField(this.context, this.schema.info, cursor),\n\t\t) as FlexTreeTypedField<TSchema[\"info\"]>;\n\t}\n\n\tpublic set(key: string, content: FlexibleFieldContent<TSchema[\"info\"]> | undefined): void {\n\t\tconst field = this.getBoxed(key);\n\t\tconst fieldSchema = this.schema.info;\n\n\t\tif (fieldSchema.kind === FieldKinds.optional) {\n\t\t\tconst optionalField = field as FlexTreeOptionalField<AllowedTypes>;\n\t\t\toptionalField.content = content;\n\t\t} else {\n\t\t\tassert(fieldSchema.kind === FieldKinds.sequence, 0x807 /* Unexpected map field kind */);\n\n\t\t\t// TODO: implement setting of sequence fields once we have defined clear merged semantics for doing so.\n\t\t\t// For now, we will throw an error, since the public API does not currently expose a way to do this anyways.\n\t\t\tthrow new Error(\"Setting of sequence values in maps is not yet supported.\");\n\t\t}\n\t}\n\n\tpublic delete(key: FieldKey): void {\n\t\t// Since all keys implicitly exist under a Map node, and we represent \"no value\" with `undefined`,\n\t\t// \"deleting\" a key/value pair is the same as setting the value to `undefined`.\n\t\tthis.set(key, undefined);\n\t}\n\n\tpublic override [boxedIterator](): IterableIterator<FlexTreeTypedField<TSchema[\"info\"]>> {\n\t\treturn super[boxedIterator]() as IterableIterator<FlexTreeTypedField<TSchema[\"info\"]>>;\n\t}\n\n\tpublic [Symbol.iterator](): IterableIterator<\n\t\t[FieldKey, FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">]\n\t> {\n\t\treturn this.entries();\n\t}\n\n\tpublic get asObject(): {\n\t\treadonly [P in FieldKey]?: FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">;\n\t} {\n\t\tconst record: Record<\n\t\t\tFieldKey,\n\t\t\tFlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\"> | undefined\n\t\t> = Object.create(null);\n\n\t\tforEachField(this[cursorSymbol], (cursor) => {\n\t\t\tObject.defineProperty(record, cursor.getFieldKey(), {\n\t\t\t\tvalue: unboxedField(this.context, this.schema.info, cursor),\n\t\t\t\tconfigurable: true,\n\t\t\t\tenumerable: true,\n\t\t\t});\n\t\t});\n\t\treturn record;\n\t}\n}\n\nexport class LazyLeaf<TSchema extends LeafNodeSchema>\n\textends LazyTreeNode<TSchema>\n\timplements FlexTreeLeafNode<TSchema>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: TSchema,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tanchorNode: AnchorNode,\n\t\tanchor: Anchor,\n\t) {\n\t\tsuper(context, schema, cursor, anchorNode, anchor);\n\n\t\t// Setup JS Object API:\n\t\tmakePropertyEnumerableOwn(this, \"value\", LazyTreeNode.prototype);\n\t}\n\n\tpublic override get value(): TreeValue<TSchema[\"info\"]> {\n\t\treturn super.value as TreeValue<TSchema[\"info\"]>;\n\t}\n}\n\nexport class LazyFieldNode<TSchema extends FieldNodeSchema>\n\textends LazyTreeNode<TSchema>\n\timplements FlexTreeFieldNode<TSchema>\n{\n\tpublic get content(): FlexTreeUnboxField<TSchema[\"info\"]> {\n\t\treturn inCursorField(this[cursorSymbol], EmptyKey, (cursor) =>\n\t\t\tunboxedField(this.context, this.schema.info, cursor),\n\t\t) as FlexTreeUnboxField<TSchema[\"info\"]>;\n\t}\n\n\tpublic get boxedContent(): FlexTreeTypedField<TSchema[\"info\"]> {\n\t\treturn inCursorField(this[cursorSymbol], EmptyKey, (cursor) =>\n\t\t\tmakeField(this.context, this.schema.info, cursor),\n\t\t) as FlexTreeTypedField<TSchema[\"info\"]>;\n\t}\n}\n\nexport abstract class LazyObjectNode<TSchema extends ObjectNodeSchema>\n\textends LazyTreeNode<TSchema>\n\timplements FlexTreeObjectNode\n{\n\tpublic get localNodeKey(): LocalNodeKey | undefined {\n\t\t// TODO: Optimize this to be in the derived class so it can cache schema lookup.\n\t\t// TODO: Optimize this to avoid allocating the field object.\n\n\t\tconst key = this.context.nodeKeyFieldKey;\n\t\tconst fieldSchema = this.schema.objectNodeFields.get(key);\n\n\t\tif (fieldSchema === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst field = this.tryGetField(key);\n\t\tassert(field instanceof LazyNodeKeyField, 0x7b4 /* unexpected node key field */);\n\t\t// TODO: ideally we would do something like this, but that adds dependencies we can't have here:\n\t\t// assert(\n\t\t// \tfield.is(TreeFieldSchema.create(FieldKinds.nodeKey, [nodeKeyTreeSchema])),\n\t\t// \t\"invalid node key field\",\n\t\t// );\n\n\t\tif (this.context.nodeKeyFieldKey === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn field.localNodeKey;\n\t}\n}\n\nexport function buildLazyObjectNode<TSchema extends ObjectNodeSchema>(\n\tcontext: Context,\n\tschema: TSchema,\n\tcursor: ITreeSubscriptionCursor,\n\tanchorNode: AnchorNode,\n\tanchor: Anchor,\n): LazyObjectNode<TSchema> & FlexTreeObjectNodeTyped<TSchema> {\n\tconst objectNodeClass = getOrCreate(cachedStructClasses, schema, () =>\n\t\tbuildStructClass(schema),\n\t);\n\treturn new objectNodeClass(context, cursor, anchorNode, anchor) as LazyObjectNode<TSchema> &\n\t\tFlexTreeObjectNodeTyped<TSchema>;\n}\n\nconst cachedStructClasses = new WeakMap<\n\tObjectNodeSchema,\n\tnew (\n\t\tcontext: Context,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tanchorNode: AnchorNode,\n\t\tanchor: Anchor,\n\t) => LazyObjectNode<ObjectNodeSchema>\n>();\n\nexport function getBoxedField(\n\tobjectNode: LazyTreeNode,\n\tkey: FieldKey,\n\tfieldSchema: TreeFieldSchema,\n): FlexTreeField {\n\treturn inCursorField(objectNode[cursorSymbol], key, (cursor) => {\n\t\treturn makeField(objectNode.context, fieldSchema, cursor);\n\t});\n}\n\nfunction buildStructClass<TSchema extends ObjectNodeSchema>(\n\tschema: TSchema,\n): new (\n\tcontext: Context,\n\tcursor: ITreeSubscriptionCursor,\n\tanchorNode: AnchorNode,\n\tanchor: Anchor,\n) => LazyObjectNode<TSchema> {\n\tconst propertyDescriptorMap: PropertyDescriptorMap = {};\n\tconst ownPropertyMap: PropertyDescriptorMap = {};\n\n\tfor (const [key, fieldSchema] of schema.objectNodeFields) {\n\t\tlet setter: ((newContent: FlexibleNodeContent<AllowedTypes>) => void) | undefined;\n\t\tswitch (fieldSchema.kind) {\n\t\t\tcase FieldKinds.optional: {\n\t\t\t\tsetter = function (\n\t\t\t\t\tthis: CustomStruct,\n\t\t\t\t\tnewContent: FlexibleNodeContent<AllowedTypes> | undefined,\n\t\t\t\t): void {\n\t\t\t\t\tconst field = getBoxedField(\n\t\t\t\t\t\tthis,\n\t\t\t\t\t\tkey,\n\t\t\t\t\t\tfieldSchema,\n\t\t\t\t\t) as FlexTreeOptionalField<AllowedTypes>;\n\t\t\t\t\tfield.content = newContent;\n\t\t\t\t};\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase FieldKinds.required: {\n\t\t\t\tsetter = function (\n\t\t\t\t\tthis: CustomStruct,\n\t\t\t\t\tnewContent: FlexibleNodeContent<AllowedTypes>,\n\t\t\t\t): void {\n\t\t\t\t\tconst field = getBoxedField(\n\t\t\t\t\t\tthis,\n\t\t\t\t\t\tkey,\n\t\t\t\t\t\tfieldSchema,\n\t\t\t\t\t) as FlexTreeRequiredField<AllowedTypes>;\n\t\t\t\t\tfield.content = newContent;\n\t\t\t\t};\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\tsetter = undefined;\n\t\t\t\tbreak;\n\t\t}\n\n\t\t// Create getter and setter (when appropriate) for property\n\t\townPropertyMap[key] = {\n\t\t\tenumerable: true,\n\t\t\tget(this: CustomStruct): unknown {\n\t\t\t\treturn inCursorField(this[cursorSymbol], key, (cursor) =>\n\t\t\t\t\tunboxedField(this.context, fieldSchema, cursor),\n\t\t\t\t);\n\t\t\t},\n\t\t\tset: setter,\n\t\t};\n\n\t\t// Create set method for property (when appropriate)\n\t\tif (setter !== undefined) {\n\t\t\tpropertyDescriptorMap[`set${capitalize(key)}`] = {\n\t\t\t\tenumerable: false,\n\t\t\t\tget(this: CustomStruct) {\n\t\t\t\t\treturn setter;\n\t\t\t\t},\n\t\t\t};\n\t\t}\n\n\t\tpropertyDescriptorMap[`boxed${capitalize(key)}`] = {\n\t\t\tenumerable: false,\n\t\t\tget(this: CustomStruct) {\n\t\t\t\treturn getBoxedField(this, key, fieldSchema);\n\t\t\t},\n\t\t};\n\t}\n\n\t// This must implement `StructTyped<TSchema>`, but TypeScript can't constrain it to do so.\n\tclass CustomStruct extends LazyObjectNode<TSchema> {\n\t\tpublic constructor(\n\t\t\tcontext: Context,\n\t\t\tcursor: ITreeSubscriptionCursor,\n\t\t\tanchorNode: AnchorNode,\n\t\t\tanchor: Anchor,\n\t\t) {\n\t\t\tsuper(context, schema, cursor, anchorNode, anchor);\n\t\t\tObject.defineProperties(this, ownPropertyMap);\n\t\t}\n\t}\n\n\tObject.defineProperties(CustomStruct.prototype, propertyDescriptorMap);\n\n\treturn CustomStruct;\n}\n"]}

package/lib/feature-libraries/flex-tree/navigation.d.ts

@@ -0,0 +1,46 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export declare const Skip: unique symbol;
+export type Skip = typeof Skip;
+/**
+ * Visit iterable tree.
+ *
+ * @remarks
+ * Non-recursive depth first traversal.
+ */
+export declare function visitIterableTree<T>(root: T, iterator: (t: T) => Iterable<T>, visitor: (item: T) => Skip | void): void;
+/**
+ * Visit iterable tree.
+ * Allows state to be computed in parents and passed to children.
+ *
+ * @remarks
+ * Non-recursive depth first traversal.
+ */
+export declare function visitIterableTreeWithState<T extends Iterable<T>, StatePassedDown>(root: T, initial: StatePassedDown, visitor: (item: T, fromAbove: StatePassedDown) => Skip | StatePassedDown): void;
+/**
+ * Visit bipartite iterable tree.
+ *
+ * @remarks
+ * Non-recursive depth first traversal.
+ *
+ * Particularly useful for processing trees with their alternating node and field levels.
+ */
+export declare function visitBipartiteIterableTree<A extends Iterable<B>, B extends Iterable<A>>(root: A, visitorA: (item: A) => Skip | undefined, visitorB: (item: B) => Skip | undefined): void;
+/**
+ * Visit bipartite iterable tree.
+ * Allows state to be computed in parents and passed to children.
+ *
+ * @remarks
+ * Non-recursive depth first traversal.
+ *
+ * Particularly useful for processing trees with their alternating node and field levels.
+ *
+ * @privateRemarks
+ * Other traversal cases, like ones passing data up (via map or reduce patterns) could be supported by extending this or adding more utilities.
+ * Such utility functions really only provide an improvement of hand coding each cases if the non-recessiveness is required.
+ * Since supporting very deeps trees hasn't been a priority, such visitors are also not a priority, and are thus not included here for now.
+ */
+export declare function visitBipartiteIterableTreeWithState<A, B, StateA, StateB>(root: A, fromAbove: StateA, iterateA: (a: A) => Iterable<B>, iterateB: (b: B) => Iterable<A>, visitorA: (item: A, fromAbove: StateA) => Skip | StateB, visitorB: (item: B, fromAbove: StateB) => Skip | StateA): void;
+//# sourceMappingURL=navigation.d.ts.map

package/lib/feature-libraries/flex-tree/navigation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"navigation.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/navigation.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,eAAO,MAAM,IAAI,eAAiB,CAAC;AACnC,MAAM,MAAM,IAAI,GAAG,OAAO,IAAI,CAAC;AAE/B;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAClC,IAAI,EAAE,CAAC,EACP,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAC/B,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI,GAC/B,IAAI,CAUN;AAED;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CAAC,CAAC,SAAS,QAAQ,CAAC,CAAC,CAAC,EAAE,eAAe,EAChF,IAAI,EAAE,CAAC,EACP,OAAO,EAAE,eAAe,EACxB,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,eAAe,KAAK,IAAI,GAAG,eAAe,GACtE,IAAI,CAYN;AAED;;;;;;;GAOG;AACH,wBAAgB,0BAA0B,CAAC,CAAC,SAAS,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,QAAQ,CAAC,CAAC,CAAC,EACtF,IAAI,EAAE,CAAC,EACP,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,GAAG,SAAS,EACvC,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,GAAG,SAAS,QAevC;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,mCAAmC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EACvE,IAAI,EAAE,CAAC,EACP,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAC/B,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAC/B,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,GAAG,MAAM,EACvD,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,GAAG,MAAM,QAiBvD"}

package/lib/feature-libraries/flex-tree/navigation.js

@@ -0,0 +1,97 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export const Skip = Symbol("Skip");
+/**
+ * Visit iterable tree.
+ *
+ * @remarks
+ * Non-recursive depth first traversal.
+ */
+export function visitIterableTree(root, iterator, visitor) {
+    const queue = [[root]];
+    let next;
+    while ((next = queue.pop())) {
+        for (const child of next) {
+            if (visitor(child) !== Skip) {
+                queue.push(iterator(child));
+            }
+        }
+    }
+}
+/**
+ * Visit iterable tree.
+ * Allows state to be computed in parents and passed to children.
+ *
+ * @remarks
+ * Non-recursive depth first traversal.
+ */
+export function visitIterableTreeWithState(root, initial, visitor) {
+    const queue = [[initial, root]];
+    let next;
+    while ((next = queue.pop())) {
+        const [state, nestItem] = next;
+        for (const child of nestItem) {
+            const result = visitor(child, state);
+            if (result !== Skip) {
+                queue.push([result, child]);
+            }
+        }
+    }
+}
+/**
+ * Visit bipartite iterable tree.
+ *
+ * @remarks
+ * Non-recursive depth first traversal.
+ *
+ * Particularly useful for processing trees with their alternating node and field levels.
+ */
+export function visitBipartiteIterableTree(root, visitorA, visitorB) {
+    const queueA = [root];
+    let nextA;
+    while ((nextA = queueA.pop())) {
+        if (visitorA(nextA) !== Skip) {
+            for (const nextB of nextA) {
+                if (visitorB(nextB) !== Skip) {
+                    for (const child of nextB) {
+                        queueA.push(child);
+                    }
+                }
+            }
+        }
+    }
+}
+/**
+ * Visit bipartite iterable tree.
+ * Allows state to be computed in parents and passed to children.
+ *
+ * @remarks
+ * Non-recursive depth first traversal.
+ *
+ * Particularly useful for processing trees with their alternating node and field levels.
+ *
+ * @privateRemarks
+ * Other traversal cases, like ones passing data up (via map or reduce patterns) could be supported by extending this or adding more utilities.
+ * Such utility functions really only provide an improvement of hand coding each cases if the non-recessiveness is required.
+ * Since supporting very deeps trees hasn't been a priority, such visitors are also not a priority, and are thus not included here for now.
+ */
+export function visitBipartiteIterableTreeWithState(root, fromAbove, iterateA, iterateB, visitorA, visitorB) {
+    const queueA = [[root, fromAbove]];
+    let next;
+    while ((next = queueA.pop())) {
+        const result = visitorA(...next);
+        if (result !== Skip) {
+            for (const nextB of iterateA(next[0])) {
+                const resultB = visitorB(nextB, result);
+                if (resultB !== Skip) {
+                    for (const child of iterateB(nextB)) {
+                        queueA.push([child, resultB]);
+                    }
+                }
+            }
+        }
+    }
+}
+//# sourceMappingURL=navigation.js.map