@fluidframework/tree 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0

package/dist/simple-tree/arrayNode.js

@@ -0,0 +1,438 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arraySchema = exports.IterableTreeArrayContent = exports.TreeArrayNode = void 0;
+const internal_1 = require("@fluidframework/core-utils/internal");
+const index_js_1 = require("../core/index.js");
+const index_js_2 = require("../feature-libraries/index.js");
+const proxies_js_1 = require("./proxies.js");
+const proxyBinding_js_1 = require("./proxyBinding.js");
+const schemaCaching_js_1 = require("./schemaCaching.js");
+const schemaTypes_js_1 = require("./schemaTypes.js");
+const toMapTree_js_1 = require("./toMapTree.js");
+const index_js_3 = require("../util/index.js");
+const toFlexSchema_js_1 = require("./toFlexSchema.js");
+const rawNode_js_1 = require("./rawNode.js");
+/**
+ * A {@link TreeNode} which implements 'readonly T[]' and the array mutation APIs.
+ * @public
+ */
+exports.TreeArrayNode = {
+    /**
+     * Wrap an iterable of items to inserted as consecutive items in a array.
+     * @remarks
+     * The object returned by this function can be inserted into a {@link (TreeArrayNode:interface)}.
+     * Its contents will be inserted consecutively in the corresponding location in the array.
+     * @example
+     * ```ts
+     * array.insertAtEnd(TreeArrayNode.spread(iterable))
+     * ```
+     */
+    spread: (content) => create(content),
+};
+/**
+ * Package internal construction API.
+ * Use {@link (TreeArrayNode:variable).spread} to create an instance of this type instead.
+ */
+let create;
+/**
+ * Used to insert iterable content into a {@link (TreeArrayNode:interface)}.
+ * Use {@link (TreeArrayNode:variable).spread} to create an instance of this type.
+ * @public
+ */
+class IterableTreeArrayContent {
+    constructor(content) {
+        this.content = content;
+    }
+    /**
+     * Iterates over content for nodes to insert.
+     */
+    [Symbol.iterator]() {
+        return this.content[Symbol.iterator]();
+    }
+}
+exports.IterableTreeArrayContent = IterableTreeArrayContent;
+(() => {
+    create = (content) => new IterableTreeArrayContent(content);
+})();
+/**
+ * Given a array node proxy, returns its underlying LazySequence field.
+ */
+function getSequenceField(arrayNode) {
+    return (0, proxyBinding_js_1.getFlexNode)(arrayNode).getBoxed(index_js_1.EmptyKey);
+}
+// Used by 'insert*()' APIs to converts new content (expressed as a proxy union) to contextually
+// typed data prior to forwarding to 'LazySequence.insert*()'.
+function contextualizeInsertedArrayContent(content, sequenceField) {
+    return (0, proxies_js_1.prepareContentForInsert)(content.flatMap((c) => c instanceof IterableTreeArrayContent ? Array.from(c) : [c]), sequenceField.context.forest);
+}
+// #region Create dispatch map for array nodes
+// TODO: Experiment with alternative dispatch methods to see if we can improve performance.
+/**
+ * PropertyDescriptorMap used to build the prototype for our array node dispatch object.
+ */
+const arrayNodePrototypeProperties = {
+    // We manually add [Symbol.iterator] to the dispatch map rather than use '[fn.name] = fn' as
+    // below when adding 'Array.prototype.*' properties to this map because 'Array.prototype[Symbol.iterator].name'
+    // returns "values" (i.e., Symbol.iterator is an alias for the '.values()' function.)
+    [Symbol.iterator]: {
+        value: Array.prototype[Symbol.iterator],
+    },
+    at: {
+        value(index) {
+            const field = getSequenceField(this);
+            const val = field.boxedAt(index);
+            if (val === undefined) {
+                return val;
+            }
+            return (0, proxies_js_1.getOrCreateNodeProxy)(val);
+        },
+    },
+    insertAt: {
+        value(index, ...value) {
+            const sequenceNode = (0, proxyBinding_js_1.getFlexNode)(this);
+            const sequenceField = getSequenceField(this);
+            const content = contextualizeInsertedArrayContent(value, sequenceField);
+            const simpleNodeSchema = (0, schemaCaching_js_1.getSimpleNodeSchema)(sequenceNode.schema);
+            (0, internal_1.assert)(simpleNodeSchema.kind === schemaTypes_js_1.NodeKind.Array, 0x912 /* Expected array schema */);
+            const simpleFieldSchema = (0, schemaCaching_js_1.getSimpleFieldSchema)(sequenceField.schema, simpleNodeSchema.info);
+            sequenceField.insertAt(index, (0, toMapTree_js_1.cursorFromFieldData)(content, simpleFieldSchema));
+        },
+    },
+    insertAtStart: {
+        value(...value) {
+            const sequenceNode = (0, proxyBinding_js_1.getFlexNode)(this);
+            const sequenceField = getSequenceField(this);
+            const content = contextualizeInsertedArrayContent(value, sequenceField);
+            const simpleNodeSchema = (0, schemaCaching_js_1.getSimpleNodeSchema)(sequenceNode.schema);
+            (0, internal_1.assert)(simpleNodeSchema.kind === schemaTypes_js_1.NodeKind.Array, 0x913 /* Expected array schema */);
+            const simpleFieldSchema = (0, schemaCaching_js_1.getSimpleFieldSchema)(sequenceField.schema, simpleNodeSchema.info);
+            sequenceField.insertAtStart((0, toMapTree_js_1.cursorFromFieldData)(content, simpleFieldSchema));
+        },
+    },
+    insertAtEnd: {
+        value(...value) {
+            const sequenceNode = (0, proxyBinding_js_1.getFlexNode)(this);
+            const sequenceField = getSequenceField(this);
+            const content = contextualizeInsertedArrayContent(value, sequenceField);
+            const simpleNodeSchema = (0, schemaCaching_js_1.getSimpleNodeSchema)(sequenceNode.schema);
+            (0, internal_1.assert)(simpleNodeSchema.kind === schemaTypes_js_1.NodeKind.Array, 0x914 /* Expected array schema */);
+            const simpleFieldSchema = (0, schemaCaching_js_1.getSimpleFieldSchema)(sequenceField.schema, simpleNodeSchema.info);
+            sequenceField.insertAtEnd((0, toMapTree_js_1.cursorFromFieldData)(content, simpleFieldSchema));
+        },
+    },
+    removeAt: {
+        value(index) {
+            getSequenceField(this).removeAt(index);
+        },
+    },
+    removeRange: {
+        value(start, end) {
+            getSequenceField(this).removeRange(start, end);
+        },
+    },
+    moveToStart: {
+        value(sourceIndex, source) {
+            if (source !== undefined) {
+                getSequenceField(this).moveToStart(sourceIndex, getSequenceField(source));
+            }
+            else {
+                getSequenceField(this).moveToStart(sourceIndex);
+            }
+        },
+    },
+    moveToEnd: {
+        value(sourceIndex, source) {
+            if (source !== undefined) {
+                getSequenceField(this).moveToEnd(sourceIndex, getSequenceField(source));
+            }
+            else {
+                getSequenceField(this).moveToEnd(sourceIndex);
+            }
+        },
+    },
+    moveToIndex: {
+        value(index, sourceIndex, source) {
+            if (source !== undefined) {
+                getSequenceField(this).moveToIndex(index, sourceIndex, getSequenceField(source));
+            }
+            else {
+                getSequenceField(this).moveToIndex(index, sourceIndex);
+            }
+        },
+    },
+    moveRangeToStart: {
+        value(sourceStart, sourceEnd, source) {
+            if (source !== undefined) {
+                getSequenceField(this).moveRangeToStart(sourceStart, sourceEnd, getSequenceField(source));
+            }
+            else {
+                getSequenceField(this).moveRangeToStart(sourceStart, sourceEnd);
+            }
+        },
+    },
+    moveRangeToEnd: {
+        value(sourceStart, sourceEnd, source) {
+            if (source !== undefined) {
+                getSequenceField(this).moveRangeToEnd(sourceStart, sourceEnd, getSequenceField(source));
+            }
+            else {
+                getSequenceField(this).moveRangeToEnd(sourceStart, sourceEnd);
+            }
+        },
+    },
+    moveRangeToIndex: {
+        value(index, sourceStart, sourceEnd, source) {
+            if (source !== undefined) {
+                getSequenceField(this).moveRangeToIndex(index, sourceStart, sourceEnd, getSequenceField(source));
+            }
+            else {
+                getSequenceField(this).moveRangeToIndex(index, sourceStart, sourceEnd);
+            }
+        },
+    },
+};
+/* eslint-disable @typescript-eslint/unbound-method */
+// For compatibility, we are initially implement 'readonly T[]' by applying the Array.prototype methods
+// to the array node proxy.  Over time, we should replace these with efficient implementations on LazySequence
+// to avoid re-entering the proxy as these methods access 'length' and the indexed properties.
+//
+// For brevity, the current implementation dynamically builds a property descriptor map from a list of
+// Array functions we want to re-expose via the proxy.
+// TODO: This assumes 'Function.name' matches the property name on 'Array.prototype', which may be
+// dubious across JS engines.
+[
+    Array.prototype.concat,
+    // Array.prototype.copyWithin,
+    Array.prototype.entries,
+    Array.prototype.every,
+    // Array.prototype.fill,
+    Array.prototype.filter,
+    Array.prototype.find,
+    Array.prototype.findIndex,
+    Array.prototype.flat,
+    Array.prototype.flatMap,
+    Array.prototype.forEach,
+    Array.prototype.includes,
+    Array.prototype.indexOf,
+    Array.prototype.join,
+    Array.prototype.keys,
+    Array.prototype.lastIndexOf,
+    // Array.prototype.length,
+    Array.prototype.map,
+    // Array.prototype.pop,
+    // Array.prototype.push,
+    Array.prototype.reduce,
+    Array.prototype.reduceRight,
+    // Array.prototype.reverse,
+    // Array.prototype.shift,
+    Array.prototype.slice,
+    Array.prototype.some,
+    // Array.prototype.sort,
+    // Array.prototype.splice,
+    Array.prototype.toLocaleString,
+    Array.prototype.toString,
+    // Array.prototype.unshift,
+    Array.prototype.values,
+].forEach((fn) => {
+    arrayNodePrototypeProperties[fn.name] = { value: fn };
+});
+/* eslint-enable @typescript-eslint/unbound-method */
+const arrayNodePrototype = Object.create(Object.prototype, arrayNodePrototypeProperties);
+// #endregion
+/**
+ * Helper to coerce property keys to integer indexes (or undefined if not an in-range integer).
+ */
+function asIndex(key, length) {
+    if (typeof key === "string") {
+        // TODO: It may be worth a '0' <= ch <= '9' check before calling 'Number' to quickly
+        // reject 'length' as an index, or even parsing integers ourselves.
+        const asNumber = Number(key);
+        // TODO: See 'matrix/range.ts' for fast integer coercing + range check.
+        if (Number.isInteger(asNumber)) {
+            return 0 <= asNumber && asNumber < length ? asNumber : undefined;
+        }
+    }
+}
+/**
+ * @param allowAdditionalProperties - If true, setting of unexpected properties will be forwarded to the target object.
+ * Otherwise setting of unexpected properties will error.
+ * @param customTargetObject - Target object of the proxy.
+ * If not provided `[]` is used for the target and a separate object created to dispatch array methods.
+ * If provided, the customTargetObject will be used as both the dispatch object and the proxy target, and therefor must provide an own `length` value property
+ * (which is not used but must exist for getOwnPropertyDescriptor invariants) and the array functionality from {@link arrayNodePrototype}.
+ */
+function createArrayNodeProxy(allowAdditionalProperties, customTargetObject) {
+    const targetObject = customTargetObject ?? [];
+    // Create a 'dispatch' object that this Proxy forwards to instead of the proxy target, because we need
+    // the proxy target to be a plain JS array (see comments below when we instantiate the Proxy).
+    // Own properties on the dispatch object are surfaced as own properties of the proxy.
+    // (e.g., 'length', which is defined below).
+    //
+    // Properties normally inherited from 'Array.prototype' are surfaced via the prototype chain.
+    const dispatch = customTargetObject ??
+        Object.create(arrayNodePrototype, {
+            // This dispatch object's set of keys is used to implement `has` (for the `in` operator) for the non-numeric cases, and therefor must include `length`.
+            length: {
+                get() {
+                    (0, index_js_3.fail)("Proxy should intercept length");
+                },
+                set() {
+                    (0, index_js_3.fail)("Proxy should intercept length");
+                },
+                enumerable: false,
+                configurable: false,
+            },
+        });
+    // To satisfy 'deepEquals' level scrutiny, the target of the proxy must be an array literal in order
+    // to pass 'Object.getPrototypeOf'.  It also satisfies 'Array.isArray' and 'Object.prototype.toString'
+    // requirements without use of Array[Symbol.species], which is potentially on a path ot deprecation.
+    const proxy = new Proxy(targetObject, {
+        get: (target, key) => {
+            const field = getSequenceField(proxy);
+            const maybeIndex = asIndex(key, field.length);
+            if (maybeIndex === undefined) {
+                if (key === "length") {
+                    return field.length;
+                }
+                // Pass the proxy as the receiver here, so that any methods on
+                // the prototype receive `proxy` as `this`.
+                return Reflect.get(dispatch, key, proxy);
+            }
+            const value = field.boxedAt(maybeIndex);
+            if (value === undefined) {
+                return undefined;
+            }
+            // TODO: Ideally, we would return leaves without first boxing them.  However, this is not
+            //       as simple as calling '.content' since this skips the node and returns the FieldNode's
+            //       inner field.
+            return (0, proxies_js_1.getOrCreateNodeProxy)(value);
+        },
+        set: (target, key, newValue, receiver) => {
+            if (key === "length") {
+                // To allow "length" to look like "length" on an array, getOwnPropertyDescriptor has to report it as a writable value.
+                // This means the proxy target must provide a length value, but since it can't use getters and setters, it can't be correct.
+                // Therefor length has to be handled in this proxy.
+                // Since its not actually mutable, return false so setting it will produce a type error.
+                return false;
+            }
+            // 'Symbol.isConcatSpreadable' may be set on an Array instance to modify the behavior of
+            // the concat method.  We allow this property to be added to the dispatch object.
+            if (key === Symbol.isConcatSpreadable) {
+                return Reflect.set(dispatch, key, newValue, proxy);
+            }
+            const field = getSequenceField(proxy);
+            const maybeIndex = asIndex(key, field.length);
+            if (maybeIndex !== undefined) {
+                // For MVP, we otherwise disallow setting properties (mutation is only available via the array node mutation APIs).
+                return false;
+            }
+            return allowAdditionalProperties ? Reflect.set(target, key, newValue) : false;
+        },
+        has: (target, key) => {
+            const field = getSequenceField(proxy);
+            const maybeIndex = asIndex(key, field.length);
+            return maybeIndex !== undefined || Reflect.has(dispatch, key);
+        },
+        ownKeys: (target) => {
+            const field = getSequenceField(proxy);
+            // TODO: Would a lazy iterator to produce the indexes work / be more efficient?
+            // TODO: Need to surface 'Symbol.isConcatSpreadable' as an own key.
+            const keys = Array.from({ length: field.length }, (_, index) => `${index}`);
+            if (allowAdditionalProperties) {
+                keys.push(...Reflect.ownKeys(target));
+            }
+            else {
+                keys.push("length");
+            }
+            return keys;
+        },
+        getOwnPropertyDescriptor: (target, key) => {
+            const field = getSequenceField(proxy);
+            const maybeIndex = asIndex(key, field.length);
+            if (maybeIndex !== undefined) {
+                const val = field.boxedAt(maybeIndex);
+                // To satisfy 'deepEquals' level scrutiny, the property descriptor for indexed properties must
+                // be a simple value property (as opposed to using getter) and declared writable/enumerable/configurable.
+                return {
+                    // TODO: Ideally, we would return leaves without first boxing them.  However, this is not
+                    //       as simple as calling '.at' since this skips the node and returns the FieldNode's
+                    //       inner field.
+                    value: val === undefined ? val : (0, proxies_js_1.getOrCreateNodeProxy)(val),
+                    writable: true,
+                    enumerable: true,
+                    configurable: true,
+                };
+            }
+            else if (key === "length") {
+                // To satisfy 'deepEquals' level scrutiny, the property descriptor for 'length' must be a simple
+                // value property (as opposed to using getter) and be declared writable / non-configurable.
+                return {
+                    value: field.length,
+                    writable: true,
+                    enumerable: false,
+                    configurable: false,
+                };
+            }
+            return Reflect.getOwnPropertyDescriptor(dispatch, key);
+        },
+    });
+    return proxy;
+}
+/**
+ * Define a {@link TreeNodeSchema} for a {@link (TreeArrayNode:interface)}.
+ *
+ * @param name - Unique identifier for this schema including the factory's scope.
+ */
+function arraySchema(base, customizable) {
+    // This class returns a proxy from its constructor to handle numeric indexing.
+    // Alternatively it could extend a normal class which gets tons of numeric properties added.
+    class schema extends base {
+        constructor(input) {
+            super(input);
+            const proxyTarget = customizable ? this : undefined;
+            if (customizable) {
+                // Since proxy reports this as a "non-configurable" property, it must exist on the underlying object used as the proxy target, not as an inherited property.
+                // This should not get used as the proxy should intercept all use.
+                Object.defineProperty(this, "length", {
+                    value: NaN,
+                    writable: true,
+                    enumerable: false,
+                    configurable: false,
+                });
+            }
+            const flexSchema = (0, toFlexSchema_js_1.getFlexSchema)(this.constructor);
+            (0, internal_1.assert)(flexSchema instanceof index_js_2.FlexFieldNodeSchema, 0x915 /* invalid flex schema */);
+            const flexNode = (0, index_js_2.isFlexTreeNode)(input)
+                ? input
+                : new RawFieldNode(flexSchema, copyContent(flexSchema.name, input));
+            const proxy = createArrayNodeProxy(customizable, proxyTarget);
+            (0, proxyBinding_js_1.setFlexNode)(proxy, flexNode);
+            return proxy;
+        }
+    }
+    // Setup array functionality
+    Object.defineProperties(schema.prototype, arrayNodePrototypeProperties);
+    return schema;
+}
+exports.arraySchema = arraySchema;
+/**
+ * The implementation of a field node created by {@link createRawNode}.
+ */
+class RawFieldNode extends rawNode_js_1.RawTreeNode {
+    get content() {
+        throw (0, rawNode_js_1.rawError)("Reading content of an array node");
+    }
+    get boxedContent() {
+        throw (0, rawNode_js_1.rawError)("Reading boxed content of an array node");
+    }
+}
+function copyContent(typeName, content) {
+    const copy = Array.from(content);
+    (0, proxies_js_1.markContentType)(typeName, copy);
+    return copy;
+}
+//# sourceMappingURL=arrayNode.js.map

package/dist/simple-tree/arrayNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrayNode.js","sourceRoot":"","sources":["../../src/simple-tree/arrayNode.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kEAA6D;AAC7D,+CAAiF;AACjF,4DASuC;AACvC,6CAMsB;AACtB,uDAA6D;AAC7D,yDAA+E;AAC/E,qDAS0B;AAC1B,iDAAqD;AAErD,+CAAwC;AACxC,uDAAkD;AAClD,6CAAqD;AA+KrD;;;GAGG;AACU,QAAA,aAAa,GAAG;IAC5B;;;;;;;;;OASG;IACH,MAAM,EAAE,CAAI,OAAoB,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC;CACpD,CAAC;AAEF;;;GAGG;AACH,IAAI,MAAgE,CAAC;AAErE;;;;GAIG;AACH,MAAa,wBAAwB;IAKpC,YAAqC,OAAoB;QAApB,YAAO,GAAP,OAAO,CAAa;IAAG,CAAC;IAE7D;;OAEG;IACI,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;CACD;AAbD,4DAaC;AAZA;IACC,MAAM,GAAG,CAAK,OAAqB,EAAE,EAAE,CAAC,IAAI,wBAAwB,CAAC,OAAO,CAAC,CAAC;AAC/E,CAAC,GAAA,CAAA;AAYF;;GAEG;AACH,SAAS,gBAAgB,CACxB,SAAwB;IAExB,OAAO,IAAA,6BAAW,EAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,mBAAQ,CAAkC,CAAC;AACnF,CAAC;AAED,gGAAgG;AAChG,8DAA8D;AAC9D,SAAS,iCAAiC,CACzC,OAAqF,EACrF,aAAsD;IAEtD,OAAO,IAAA,oCAAuB,EAC7B,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAuB,EAAE,CAC1C,CAAC,YAAY,wBAAwB,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC3D,EACD,aAAa,CAAC,OAAO,CAAC,MAAM,CAC5B,CAAC;AACH,CAAC;AAED,8CAA8C;AAE9C,2FAA2F;AAE3F;;GAEG;AACH,MAAM,4BAA4B,GAA0B;IAC3D,4FAA4F;IAC5F,+GAA+G;IAC/G,qFAAqF;IACrF,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE;QAClB,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC;KACvC;IACD,EAAE,EAAE;QACH,KAAK,CAAsB,KAAa;YACvC,MAAM,KAAK,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAEjC,IAAI,GAAG,KAAK,SAAS,EAAE;gBACtB,OAAO,GAAG,CAAC;aACX;YAED,OAAO,IAAA,iCAAoB,EAAC,GAAG,CAAC,CAAC;QAClC,CAAC;KACD;IACD,QAAQ,EAAE;QACT,KAAK,CAEJ,KAAa,EACb,GAAG,KAAmF;YAEtF,MAAM,YAAY,GAAG,IAAA,6BAAW,EAAC,IAAI,CAAC,CAAC;YACvC,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,OAAO,GAAG,iCAAiC,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;YAExE,MAAM,gBAAgB,GAAG,IAAA,sCAAmB,EAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAClE,IAAA,iBAAM,EAAC,gBAAgB,CAAC,IAAI,KAAK,yBAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAEpF,MAAM,iBAAiB,GAAG,IAAA,uCAAoB,EAC7C,aAAa,CAAC,MAAM,EACpB,gBAAgB,CAAC,IAA2B,CAC5C,CAAC;YAEF,aAAa,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAA,kCAAmB,EAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC;QAChF,CAAC;KACD;IACD,aAAa,EAAE;QACd,KAAK,CAEJ,GAAG,KAAmF;YAEtF,MAAM,YAAY,GAAG,IAAA,6BAAW,EAAC,IAAI,CAAC,CAAC;YACvC,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,OAAO,GAAG,iCAAiC,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;YAExE,MAAM,gBAAgB,GAAG,IAAA,sCAAmB,EAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAClE,IAAA,iBAAM,EAAC,gBAAgB,CAAC,IAAI,KAAK,yBAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAEpF,MAAM,iBAAiB,GAAG,IAAA,uCAAoB,EAC7C,aAAa,CAAC,MAAM,EACpB,gBAAgB,CAAC,IAA2B,CAC5C,CAAC;YAEF,aAAa,CAAC,aAAa,CAAC,IAAA,kCAAmB,EAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC;QAC9E,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAEJ,GAAG,KAAmF;YAEtF,MAAM,YAAY,GAAG,IAAA,6BAAW,EAAC,IAAI,CAAC,CAAC;YACvC,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,OAAO,GAAG,iCAAiC,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;YAExE,MAAM,gBAAgB,GAAG,IAAA,sCAAmB,EAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAClE,IAAA,iBAAM,EAAC,gBAAgB,CAAC,IAAI,KAAK,yBAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAEpF,MAAM,iBAAiB,GAAG,IAAA,uCAAoB,EAC7C,aAAa,CAAC,MAAM,EACpB,gBAAgB,CAAC,IAA2B,CAC5C,CAAC;YAEF,aAAa,CAAC,WAAW,CAAC,IAAA,kCAAmB,EAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC;QAC5E,CAAC;KACD;IACD,QAAQ,EAAE;QACT,KAAK,CAAsB,KAAa;YACvC,gBAAgB,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAAsB,KAAc,EAAE,GAAY;YACtD,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAAsB,WAAmB,EAAE,MAAsB;YACrE,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,WAAW,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;aAC1E;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;aAChD;QACF,CAAC;KACD;IACD,SAAS,EAAE;QACV,KAAK,CAAsB,WAAmB,EAAE,MAAsB;YACrE,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;aACxE;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;aAC9C;QACF,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAEJ,KAAa,EACb,WAAmB,EACnB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;aACjF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;aACvD;QACF,CAAC;KACD;IACD,gBAAgB,EAAE;QACjB,KAAK,CAEJ,WAAmB,EACnB,SAAiB,EACjB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CACtC,WAAW,EACX,SAAS,EACT,gBAAgB,CAAC,MAAM,CAAC,CACxB,CAAC;aACF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;aAChE;QACF,CAAC;KACD;IACD,cAAc,EAAE;QACf,KAAK,CAEJ,WAAmB,EACnB,SAAiB,EACjB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,cAAc,CACpC,WAAW,EACX,SAAS,EACT,gBAAgB,CAAC,MAAM,CAAC,CACxB,CAAC;aACF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,cAAc,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;aAC9D;QACF,CAAC;KACD;IACD,gBAAgB,EAAE;QACjB,KAAK,CAEJ,KAAa,EACb,WAAmB,EACnB,SAAiB,EACjB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CACtC,KAAK,EACL,WAAW,EACX,SAAS,EACT,gBAAgB,CAAC,MAAM,CAAC,CACxB,CAAC;aACF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;aACvE;QACF,CAAC;KACD;CACD,CAAC;AAEF,sDAAsD;AAEtD,uGAAuG;AACvG,8GAA8G;AAC9G,8FAA8F;AAC9F,EAAE;AACF,sGAAsG;AACtG,sDAAsD;AAEtD,kGAAkG;AAClG,6BAA6B;AAC7B;IACC,KAAK,CAAC,SAAS,CAAC,MAAM;IACtB,8BAA8B;IAC9B,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,KAAK;IACrB,wBAAwB;IACxB,KAAK,CAAC,SAAS,CAAC,MAAM;IACtB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,SAAS;IACzB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,QAAQ;IACxB,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,WAAW;IAC3B,0BAA0B;IAC1B,KAAK,CAAC,SAAS,CAAC,GAAG;IACnB,uBAAuB;IACvB,wBAAwB;IACxB,KAAK,CAAC,SAAS,CAAC,MAAM;IACtB,KAAK,CAAC,SAAS,CAAC,WAAW;IAC3B,2BAA2B;IAC3B,yBAAyB;IACzB,KAAK,CAAC,SAAS,CAAC,KAAK;IACrB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,wBAAwB;IACxB,0BAA0B;IAC1B,KAAK,CAAC,SAAS,CAAC,cAAc;IAC9B,KAAK,CAAC,SAAS,CAAC,QAAQ;IACxB,2BAA2B;IAC3B,KAAK,CAAC,SAAS,CAAC,MAAM;CACtB,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;IAChB,4BAA4B,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;AACvD,CAAC,CAAC,CAAC;AAEH,qDAAqD;AAErD,MAAM,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,4BAA4B,CAAC,CAAC;AAEzF,aAAa;AAEb;;GAEG;AACH,SAAS,OAAO,CAAC,GAAoB,EAAE,MAAc;IACpD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;QAC5B,oFAAoF;QACpF,mEAAmE;QACnE,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAE7B,uEAAuE;QACvE,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE;YAC/B,OAAO,CAAC,IAAI,QAAQ,IAAI,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;SACjE;KACD;AACF,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,oBAAoB,CAC5B,yBAAkC,EAClC,kBAA2B;IAE3B,MAAM,YAAY,GAAG,kBAAkB,IAAI,EAAE,CAAC;IAE9C,sGAAsG;IACtG,8FAA8F;IAC9F,qFAAqF;IACrF,4CAA4C;IAC5C,EAAE;IACF,6FAA6F;IAC7F,MAAM,QAAQ,GACb,kBAAkB;QAClB,MAAM,CAAC,MAAM,CAAC,kBAAkB,EAAE;YACjC,uJAAuJ;YACvJ,MAAM,EAAE;gBACP,GAAG;oBACF,IAAA,eAAI,EAAC,+BAA+B,CAAC,CAAC;gBACvC,CAAC;gBACD,GAAG;oBACF,IAAA,eAAI,EAAC,+BAA+B,CAAC,CAAC;gBACvC,CAAC;gBACD,UAAU,EAAE,KAAK;gBACjB,YAAY,EAAE,KAAK;aACnB;SACD,CAAC,CAAC;IAEJ,oGAAoG;IACpG,sGAAsG;IACtG,oGAAoG;IACpG,MAAM,KAAK,GAAkB,IAAI,KAAK,CAAgB,YAAmB,EAAE;QAC1E,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACpB,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAE9C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,IAAI,GAAG,KAAK,QAAQ,EAAE;oBACrB,OAAO,KAAK,CAAC,MAAM,CAAC;iBACpB;gBAED,8DAA8D;gBAC9D,2CAA2C;gBAC3C,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,KAAK,CAAY,CAAC;aACpD;YAED,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAExC,IAAI,KAAK,KAAK,SAAS,EAAE;gBACxB,OAAO,SAAS,CAAC;aACjB;YAED,yFAAyF;YACzF,8FAA8F;YAC9F,qBAAqB;YACrB,OAAO,IAAA,iCAAoB,EAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE;YACxC,IAAI,GAAG,KAAK,QAAQ,EAAE;gBACrB,sHAAsH;gBACtH,4HAA4H;gBAC5H,mDAAmD;gBACnD,wFAAwF;gBACxF,OAAO,KAAK,CAAC;aACb;YAED,wFAAwF;YACxF,iFAAiF;YACjF,IAAI,GAAG,KAAK,MAAM,CAAC,kBAAkB,EAAE;gBACtC,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;aACnD;YAED,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,mHAAmH;gBACnH,OAAO,KAAK,CAAC;aACb;YACD,OAAO,yBAAyB,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/E,CAAC;QACD,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACpB,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9C,OAAO,UAAU,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,EAAE,CAAC,MAAM,EAAE,EAAE;YACnB,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YAEtC,+EAA+E;YAC/E,mEAAmE;YACnE,MAAM,IAAI,GAAwB,KAAK,CAAC,IAAI,CAC3C,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,EACxB,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,EAAE,CACxB,CAAC;YAEF,IAAI,yBAAyB,EAAE;gBAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;aACtC;iBAAM;gBACN,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aACpB;YACD,OAAO,IAAI,CAAC;QACb,CAAC;QACD,wBAAwB,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACzC,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;gBACtC,8FAA8F;gBAC9F,yGAAyG;gBACzG,OAAO;oBACN,yFAAyF;oBACzF,yFAAyF;oBACzF,qBAAqB;oBACrB,KAAK,EAAE,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAA,iCAAoB,EAAC,GAAG,CAAC;oBAC1D,QAAQ,EAAE,IAAI;oBACd,UAAU,EAAE,IAAI;oBAChB,YAAY,EAAE,IAAI;iBAClB,CAAC;aACF;iBAAM,IAAI,GAAG,KAAK,QAAQ,EAAE;gBAC5B,gGAAgG;gBAChG,2FAA2F;gBAC3F,OAAO;oBACN,KAAK,EAAE,KAAK,CAAC,MAAM;oBACnB,QAAQ,EAAE,IAAI;oBACd,UAAU,EAAE,KAAK;oBACjB,YAAY,EAAE,KAAK;iBACnB,CAAC;aACF;YACD,OAAO,OAAO,CAAC,wBAAwB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACxD,CAAC;KACD,CAAC,CAAC;IACH,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAgB,WAAW,CAK1B,IAOC,EACD,YAAqB;IAErB,8EAA8E;IAC9E,4FAA4F;IAC5F,MAAM,MAAO,SAAQ,IAAI;QACxB,YAAmB,KAA8D;YAChF,KAAK,CAAC,KAAK,CAAC,CAAC;YAEb,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;YAEpD,IAAI,YAAY,EAAE;gBACjB,4JAA4J;gBAC5J,kEAAkE;gBAClE,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE;oBACrC,KAAK,EAAE,GAAG;oBACV,QAAQ,EAAE,IAAI;oBACd,UAAU,EAAE,KAAK;oBACjB,YAAY,EAAE,KAAK;iBACnB,CAAC,CAAC;aACH;YAED,MAAM,UAAU,GAAG,IAAA,+BAAa,EAAC,IAAI,CAAC,WAA6B,CAAC,CAAC;YACrE,IAAA,iBAAM,EAAC,UAAU,YAAY,8BAAmB,EAAE,KAAK,CAAC,yBAAyB,CAAC,CAAC;YACnF,MAAM,QAAQ,GAAiB,IAAA,yBAAc,EAAC,KAAK,CAAC;gBACnD,CAAC,CAAC,KAAK;gBACP,CAAC,CAAC,IAAI,YAAY,CAAC,UAAU,EAAE,WAAW,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAW,CAAC,CAAC;YAE/E,MAAM,KAAK,GAAa,oBAAoB,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;YACxE,IAAA,6BAAW,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC7B,OAAO,KAA0B,CAAC;QACnC,CAAC;KACD;IAED,4BAA4B;IAC5B,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,4BAA4B,CAAC,CAAC;IAExE,OAAO,MAON,CAAC;AACH,CAAC;AAzDD,kCAyDC;AAED;;GAEG;AACH,MAAM,YACL,SAAQ,wBAAuC;IAG/C,IAAW,OAAO;QACjB,MAAM,IAAA,qBAAQ,EAAC,kCAAkC,CAAC,CAAC;IACpD,CAAC;IAED,IAAW,YAAY;QACtB,MAAM,IAAA,qBAAQ,EAAC,wCAAwC,CAAC,CAAC;IAC1D,CAAC;CACD;AAED,SAAS,WAAW,CAAI,QAAkC,EAAE,OAAoB;IAC/E,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,IAAA,4BAAe,EAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAChC,OAAO,IAAI,CAAC;AACb,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/internal\";\nimport { EmptyKey, TreeNodeSchemaIdentifier, TreeValue } from \"../core/index.js\";\nimport {\n\tFlexAllowedTypes,\n\tFlexFieldNodeSchema,\n\tFlexTreeFieldNode,\n\tFlexTreeNode,\n\tFlexTreeSequenceField,\n\tFlexTreeTypedField,\n\tFlexTreeUnboxField,\n\tisFlexTreeNode,\n} from \"../feature-libraries/index.js\";\nimport {\n\tFactoryContent,\n\tInsertableContent,\n\tgetOrCreateNodeProxy,\n\tmarkContentType,\n\tprepareContentForInsert,\n} from \"./proxies.js\";\nimport { getFlexNode, setFlexNode } from \"./proxyBinding.js\";\nimport { getSimpleFieldSchema, getSimpleNodeSchema } from \"./schemaCaching.js\";\nimport {\n\tNodeKind,\n\ttype ImplicitAllowedTypes,\n\ttype InsertableTreeNodeFromImplicitAllowedTypes,\n\ttype TreeNodeFromImplicitAllowedTypes,\n\tImplicitFieldSchema,\n\tTreeNodeSchemaClass,\n\tWithType,\n\tTreeNodeSchema,\n} from \"./schemaTypes.js\";\nimport { cursorFromFieldData } from \"./toMapTree.js\";\nimport { TreeNode } from \"./types.js\";\nimport { fail } from \"../util/index.js\";\nimport { getFlexSchema } from \"./toFlexSchema.js\";\nimport { RawTreeNode, rawError } from \"./rawNode.js\";\n\n/**\n * A generic array type, used to defined types like {@link (TreeArrayNode:interface)}.\n *\n * @privateRemarks\n * Inlining this into TreeArrayNode causes recursive array use to stop compiling.\n *\n * @public\n */\nexport interface TreeArrayNodeBase<out T, in TNew, in TMoveFrom>\n\textends ReadonlyArray<T>,\n\t\tTreeNode {\n\t/**\n\t * Inserts new item(s) at a specified location.\n\t * @param index - The index at which to insert `value`.\n\t * @param value - The content to insert.\n\t * @throws Throws if `index` is not in the range [0, `array.length`).\n\t */\n\tinsertAt(index: number, ...value: (TNew | IterableTreeArrayContent<TNew>)[]): void;\n\n\t/**\n\t * Inserts new item(s) at the start of the array.\n\t * @param value - The content to insert.\n\t */\n\tinsertAtStart(...value: (TNew | IterableTreeArrayContent<TNew>)[]): void;\n\n\t/**\n\t * Inserts new item(s) at the end of the array.\n\t * @param value - The content to insert.\n\t */\n\tinsertAtEnd(...value: (TNew | IterableTreeArrayContent<TNew>)[]): void;\n\n\t/**\n\t * Removes the item at the specified location.\n\t * @param index - The index at which to remove the item.\n\t * @throws Throws if `index` is not in the range [0, `array.length`).\n\t */\n\tremoveAt(index: number): void;\n\n\t/**\n\t * Removes all items between the specified indices.\n\t * @param start - The starting index of the range to remove (inclusive). Defaults to the start of the array.\n\t * @param end - The ending index of the range to remove (exclusive).\n\t * @throws Throws if `start` is not in the range [0, `array.length`).\n\t * @throws Throws if `end` is less than `start`.\n\t * If `end` is not supplied or is greater than the length of the array, all items after `start` are removed.\n\t */\n\tremoveRange(start?: number, end?: number): void;\n\n\t/**\n\t * Moves the specified item to the start of the array.\n\t * @param sourceIndex - The index of the item to move.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `array.length`).\n\t */\n\tmoveToStart(sourceIndex: number): void;\n\n\t/**\n\t * Moves the specified item to the start of the array.\n\t * @param sourceIndex - The index of the item to move.\n\t * @param source - The source array to move the item out of.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `array.length`).\n\t */\n\tmoveToStart(sourceIndex: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified item to the end of the array.\n\t * @param sourceIndex - The index of the item to move.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `array.length`).\n\t */\n\tmoveToEnd(sourceIndex: number): void;\n\n\t/**\n\t * Moves the specified item to the end of the array.\n\t * @param sourceIndex - The index of the item to move.\n\t * @param source - The source array to move the item out of.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `array.length`).\n\t */\n\tmoveToEnd(sourceIndex: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified item to the desired location in the array.\n\t * @param index - The index to move the item to.\n\t * This is based on the state of the array before moving the source item.\n\t * @param sourceIndex - The index of the item to move.\n\t * @throws Throws if any of the input indices are not in the range [0, `array.length`).\n\t */\n\tmoveToIndex(index: number, sourceIndex: number): void;\n\n\t/**\n\t * Moves the specified item to the desired location in the array.\n\t * @param index - The index to move the item to.\n\t * @param sourceIndex - The index of the item to move.\n\t * @param source - The source array to move the item out of.\n\t * @throws Throws if any of the input indices are not in the range [0, `array.length`).\n\t */\n\tmoveToIndex(index: number, sourceIndex: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified items to the start of the array.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @throws Throws if either of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToStart(sourceStart: number, sourceEnd: number): void;\n\n\t/**\n\t * Moves the specified items to the start of the array.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @param source - The source array to move items out of.\n\t * @throws Throws if the types of any of the items being moved are not allowed in the destination array,\n\t * if either of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToStart(sourceStart: number, sourceEnd: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified items to the end of the array.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @throws Throws if either of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToEnd(sourceStart: number, sourceEnd: number): void;\n\n\t/**\n\t * Moves the specified items to the end of the array.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @param source - The source array to move items out of.\n\t * @throws Throws if the types of any of the items being moved are not allowed in the destination array,\n\t * if either of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToEnd(sourceStart: number, sourceEnd: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified items to the desired location within the array.\n\t * @param index - The index to move the items to.\n\t * This is based on the state of the array before moving the source items.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @throws Throws if any of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToIndex(index: number, sourceStart: number, sourceEnd: number): void;\n\n\t/**\n\t * Moves the specified items to the desired location within the array.\n\t * @param index - The index to move the items to.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @param source - The source array to move items out of.\n\t * @throws Throws if the types of any of the items being moved are not allowed in the destination array,\n\t * if any of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: TMoveFrom,\n\t): void;\n}\n\n/**\n * A {@link TreeNode} which implements 'readonly T[]' and the array mutation APIs.\n *\n * @typeParam TAllowedTypes - Schema for types which are allowed as members of this array.\n *\n * @public\n */\nexport interface TreeArrayNode<TAllowedTypes extends ImplicitAllowedTypes = ImplicitAllowedTypes>\n\textends TreeArrayNodeBase<\n\t\tTreeNodeFromImplicitAllowedTypes<TAllowedTypes>,\n\t\tInsertableTreeNodeFromImplicitAllowedTypes<TAllowedTypes>,\n\t\tTreeArrayNode\n\t> {}\n\n/**\n * A {@link TreeNode} which implements 'readonly T[]' and the array mutation APIs.\n * @public\n */\nexport const TreeArrayNode = {\n\t/**\n\t * Wrap an iterable of items to inserted as consecutive items in a array.\n\t * @remarks\n\t * The object returned by this function can be inserted into a {@link (TreeArrayNode:interface)}.\n\t * Its contents will be inserted consecutively in the corresponding location in the array.\n\t * @example\n\t * ```ts\n\t * array.insertAtEnd(TreeArrayNode.spread(iterable))\n\t * ```\n\t */\n\tspread: <T>(content: Iterable<T>) => create(content),\n};\n\n/**\n * Package internal construction API.\n * Use {@link (TreeArrayNode:variable).spread} to create an instance of this type instead.\n */\nlet create: <T>(content: Iterable<T>) => IterableTreeArrayContent<T>;\n\n/**\n * Used to insert iterable content into a {@link (TreeArrayNode:interface)}.\n * Use {@link (TreeArrayNode:variable).spread} to create an instance of this type.\n * @public\n */\nexport class IterableTreeArrayContent<T> implements Iterable<T> {\n\tstatic {\n\t\tcreate = <T2>(content: Iterable<T2>) => new IterableTreeArrayContent(content);\n\t}\n\n\tprivate constructor(private readonly content: Iterable<T>) {}\n\n\t/**\n\t * Iterates over content for nodes to insert.\n\t */\n\tpublic [Symbol.iterator](): Iterator<T> {\n\t\treturn this.content[Symbol.iterator]();\n\t}\n}\n\n/**\n * Given a array node proxy, returns its underlying LazySequence field.\n */\nfunction getSequenceField<TTypes extends FlexAllowedTypes>(\n\tarrayNode: TreeArrayNode,\n): FlexTreeSequenceField<TTypes> {\n\treturn getFlexNode(arrayNode).getBoxed(EmptyKey) as FlexTreeSequenceField<TTypes>;\n}\n\n// Used by 'insert*()' APIs to converts new content (expressed as a proxy union) to contextually\n// typed data prior to forwarding to 'LazySequence.insert*()'.\nfunction contextualizeInsertedArrayContent(\n\tcontent: readonly (InsertableContent | IterableTreeArrayContent<InsertableContent>)[],\n\tsequenceField: FlexTreeSequenceField<FlexAllowedTypes>,\n): FactoryContent {\n\treturn prepareContentForInsert(\n\t\tcontent.flatMap((c): InsertableContent[] =>\n\t\t\tc instanceof IterableTreeArrayContent ? Array.from(c) : [c],\n\t\t),\n\t\tsequenceField.context.forest,\n\t);\n}\n\n// #region Create dispatch map for array nodes\n\n// TODO: Experiment with alternative dispatch methods to see if we can improve performance.\n\n/**\n * PropertyDescriptorMap used to build the prototype for our array node dispatch object.\n */\nconst arrayNodePrototypeProperties: PropertyDescriptorMap = {\n\t// We manually add [Symbol.iterator] to the dispatch map rather than use '[fn.name] = fn' as\n\t// below when adding 'Array.prototype.*' properties to this map because 'Array.prototype[Symbol.iterator].name'\n\t// returns \"values\" (i.e., Symbol.iterator is an alias for the '.values()' function.)\n\t[Symbol.iterator]: {\n\t\tvalue: Array.prototype[Symbol.iterator],\n\t},\n\tat: {\n\t\tvalue(this: TreeArrayNode, index: number): TreeNode | TreeValue | undefined {\n\t\t\tconst field = getSequenceField(this);\n\t\t\tconst val = field.boxedAt(index);\n\n\t\t\tif (val === undefined) {\n\t\t\t\treturn val;\n\t\t\t}\n\n\t\t\treturn getOrCreateNodeProxy(val);\n\t\t},\n\t},\n\tinsertAt: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tindex: number,\n\t\t\t...value: readonly (InsertableContent | IterableTreeArrayContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceNode = getFlexNode(this);\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst content = contextualizeInsertedArrayContent(value, sequenceField);\n\n\t\t\tconst simpleNodeSchema = getSimpleNodeSchema(sequenceNode.schema);\n\t\t\tassert(simpleNodeSchema.kind === NodeKind.Array, 0x912 /* Expected array schema */);\n\n\t\t\tconst simpleFieldSchema = getSimpleFieldSchema(\n\t\t\t\tsequenceField.schema,\n\t\t\t\tsimpleNodeSchema.info as ImplicitFieldSchema,\n\t\t\t);\n\n\t\t\tsequenceField.insertAt(index, cursorFromFieldData(content, simpleFieldSchema));\n\t\t},\n\t},\n\tinsertAtStart: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\t...value: readonly (InsertableContent | IterableTreeArrayContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceNode = getFlexNode(this);\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst content = contextualizeInsertedArrayContent(value, sequenceField);\n\n\t\t\tconst simpleNodeSchema = getSimpleNodeSchema(sequenceNode.schema);\n\t\t\tassert(simpleNodeSchema.kind === NodeKind.Array, 0x913 /* Expected array schema */);\n\n\t\t\tconst simpleFieldSchema = getSimpleFieldSchema(\n\t\t\t\tsequenceField.schema,\n\t\t\t\tsimpleNodeSchema.info as ImplicitFieldSchema,\n\t\t\t);\n\n\t\t\tsequenceField.insertAtStart(cursorFromFieldData(content, simpleFieldSchema));\n\t\t},\n\t},\n\tinsertAtEnd: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\t...value: readonly (InsertableContent | IterableTreeArrayContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceNode = getFlexNode(this);\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst content = contextualizeInsertedArrayContent(value, sequenceField);\n\n\t\t\tconst simpleNodeSchema = getSimpleNodeSchema(sequenceNode.schema);\n\t\t\tassert(simpleNodeSchema.kind === NodeKind.Array, 0x914 /* Expected array schema */);\n\n\t\t\tconst simpleFieldSchema = getSimpleFieldSchema(\n\t\t\t\tsequenceField.schema,\n\t\t\t\tsimpleNodeSchema.info as ImplicitFieldSchema,\n\t\t\t);\n\n\t\t\tsequenceField.insertAtEnd(cursorFromFieldData(content, simpleFieldSchema));\n\t\t},\n\t},\n\tremoveAt: {\n\t\tvalue(this: TreeArrayNode, index: number): void {\n\t\t\tgetSequenceField(this).removeAt(index);\n\t\t},\n\t},\n\tremoveRange: {\n\t\tvalue(this: TreeArrayNode, start?: number, end?: number): void {\n\t\t\tgetSequenceField(this).removeRange(start, end);\n\t\t},\n\t},\n\tmoveToStart: {\n\t\tvalue(this: TreeArrayNode, sourceIndex: number, source?: TreeArrayNode): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveToStart(sourceIndex, getSequenceField(source));\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveToStart(sourceIndex);\n\t\t\t}\n\t\t},\n\t},\n\tmoveToEnd: {\n\t\tvalue(this: TreeArrayNode, sourceIndex: number, source?: TreeArrayNode): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveToEnd(sourceIndex, getSequenceField(source));\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveToEnd(sourceIndex);\n\t\t\t}\n\t\t},\n\t},\n\tmoveToIndex: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tindex: number,\n\t\t\tsourceIndex: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveToIndex(index, sourceIndex, getSequenceField(source));\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveToIndex(index, sourceIndex);\n\t\t\t}\n\t\t},\n\t},\n\tmoveRangeToStart: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveRangeToStart(\n\t\t\t\t\tsourceStart,\n\t\t\t\t\tsourceEnd,\n\t\t\t\t\tgetSequenceField(source),\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveRangeToStart(sourceStart, sourceEnd);\n\t\t\t}\n\t\t},\n\t},\n\tmoveRangeToEnd: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveRangeToEnd(\n\t\t\t\t\tsourceStart,\n\t\t\t\t\tsourceEnd,\n\t\t\t\t\tgetSequenceField(source),\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveRangeToEnd(sourceStart, sourceEnd);\n\t\t\t}\n\t\t},\n\t},\n\tmoveRangeToIndex: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tindex: number,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveRangeToIndex(\n\t\t\t\t\tindex,\n\t\t\t\t\tsourceStart,\n\t\t\t\t\tsourceEnd,\n\t\t\t\t\tgetSequenceField(source),\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveRangeToIndex(index, sourceStart, sourceEnd);\n\t\t\t}\n\t\t},\n\t},\n};\n\n/* eslint-disable @typescript-eslint/unbound-method */\n\n// For compatibility, we are initially implement 'readonly T[]' by applying the Array.prototype methods\n// to the array node proxy.  Over time, we should replace these with efficient implementations on LazySequence\n// to avoid re-entering the proxy as these methods access 'length' and the indexed properties.\n//\n// For brevity, the current implementation dynamically builds a property descriptor map from a list of\n// Array functions we want to re-expose via the proxy.\n\n// TODO: This assumes 'Function.name' matches the property name on 'Array.prototype', which may be\n// dubious across JS engines.\n[\n\tArray.prototype.concat,\n\t// Array.prototype.copyWithin,\n\tArray.prototype.entries,\n\tArray.prototype.every,\n\t// Array.prototype.fill,\n\tArray.prototype.filter,\n\tArray.prototype.find,\n\tArray.prototype.findIndex,\n\tArray.prototype.flat,\n\tArray.prototype.flatMap,\n\tArray.prototype.forEach,\n\tArray.prototype.includes,\n\tArray.prototype.indexOf,\n\tArray.prototype.join,\n\tArray.prototype.keys,\n\tArray.prototype.lastIndexOf,\n\t// Array.prototype.length,\n\tArray.prototype.map,\n\t// Array.prototype.pop,\n\t// Array.prototype.push,\n\tArray.prototype.reduce,\n\tArray.prototype.reduceRight,\n\t// Array.prototype.reverse,\n\t// Array.prototype.shift,\n\tArray.prototype.slice,\n\tArray.prototype.some,\n\t// Array.prototype.sort,\n\t// Array.prototype.splice,\n\tArray.prototype.toLocaleString,\n\tArray.prototype.toString,\n\t// Array.prototype.unshift,\n\tArray.prototype.values,\n].forEach((fn) => {\n\tarrayNodePrototypeProperties[fn.name] = { value: fn };\n});\n\n/* eslint-enable @typescript-eslint/unbound-method */\n\nconst arrayNodePrototype = Object.create(Object.prototype, arrayNodePrototypeProperties);\n\n// #endregion\n\n/**\n * Helper to coerce property keys to integer indexes (or undefined if not an in-range integer).\n */\nfunction asIndex(key: string | symbol, length: number) {\n\tif (typeof key === \"string\") {\n\t\t// TODO: It may be worth a '0' <= ch <= '9' check before calling 'Number' to quickly\n\t\t// reject 'length' as an index, or even parsing integers ourselves.\n\t\tconst asNumber = Number(key);\n\n\t\t// TODO: See 'matrix/range.ts' for fast integer coercing + range check.\n\t\tif (Number.isInteger(asNumber)) {\n\t\t\treturn 0 <= asNumber && asNumber < length ? asNumber : undefined;\n\t\t}\n\t}\n}\n\n/**\n * @param allowAdditionalProperties - If true, setting of unexpected properties will be forwarded to the target object.\n * Otherwise setting of unexpected properties will error.\n * @param customTargetObject - Target object of the proxy.\n * If not provided `[]` is used for the target and a separate object created to dispatch array methods.\n * If provided, the customTargetObject will be used as both the dispatch object and the proxy target, and therefor must provide an own `length` value property\n * (which is not used but must exist for getOwnPropertyDescriptor invariants) and the array functionality from {@link arrayNodePrototype}.\n */\nfunction createArrayNodeProxy(\n\tallowAdditionalProperties: boolean,\n\tcustomTargetObject?: object,\n): TreeArrayNode {\n\tconst targetObject = customTargetObject ?? [];\n\n\t// Create a 'dispatch' object that this Proxy forwards to instead of the proxy target, because we need\n\t// the proxy target to be a plain JS array (see comments below when we instantiate the Proxy).\n\t// Own properties on the dispatch object are surfaced as own properties of the proxy.\n\t// (e.g., 'length', which is defined below).\n\t//\n\t// Properties normally inherited from 'Array.prototype' are surfaced via the prototype chain.\n\tconst dispatch: object =\n\t\tcustomTargetObject ??\n\t\tObject.create(arrayNodePrototype, {\n\t\t\t// This dispatch object's set of keys is used to implement `has` (for the `in` operator) for the non-numeric cases, and therefor must include `length`.\n\t\t\tlength: {\n\t\t\t\tget(this: TreeArrayNode) {\n\t\t\t\t\tfail(\"Proxy should intercept length\");\n\t\t\t\t},\n\t\t\t\tset() {\n\t\t\t\t\tfail(\"Proxy should intercept length\");\n\t\t\t\t},\n\t\t\t\tenumerable: false,\n\t\t\t\tconfigurable: false,\n\t\t\t},\n\t\t});\n\n\t// To satisfy 'deepEquals' level scrutiny, the target of the proxy must be an array literal in order\n\t// to pass 'Object.getPrototypeOf'.  It also satisfies 'Array.isArray' and 'Object.prototype.toString'\n\t// requirements without use of Array[Symbol.species], which is potentially on a path ot deprecation.\n\tconst proxy: TreeArrayNode = new Proxy<TreeArrayNode>(targetObject as any, {\n\t\tget: (target, key) => {\n\t\t\tconst field = getSequenceField(proxy);\n\t\t\tconst maybeIndex = asIndex(key, field.length);\n\n\t\t\tif (maybeIndex === undefined) {\n\t\t\t\tif (key === \"length\") {\n\t\t\t\t\treturn field.length;\n\t\t\t\t}\n\n\t\t\t\t// Pass the proxy as the receiver here, so that any methods on\n\t\t\t\t// the prototype receive `proxy` as `this`.\n\t\t\t\treturn Reflect.get(dispatch, key, proxy) as unknown;\n\t\t\t}\n\n\t\t\tconst value = field.boxedAt(maybeIndex);\n\n\t\t\tif (value === undefined) {\n\t\t\t\treturn undefined;\n\t\t\t}\n\n\t\t\t// TODO: Ideally, we would return leaves without first boxing them.  However, this is not\n\t\t\t//       as simple as calling '.content' since this skips the node and returns the FieldNode's\n\t\t\t//       inner field.\n\t\t\treturn getOrCreateNodeProxy(value);\n\t\t},\n\t\tset: (target, key, newValue, receiver) => {\n\t\t\tif (key === \"length\") {\n\t\t\t\t// To allow \"length\" to look like \"length\" on an array, getOwnPropertyDescriptor has to report it as a writable value.\n\t\t\t\t// This means the proxy target must provide a length value, but since it can't use getters and setters, it can't be correct.\n\t\t\t\t// Therefor length has to be handled in this proxy.\n\t\t\t\t// Since its not actually mutable, return false so setting it will produce a type error.\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t// 'Symbol.isConcatSpreadable' may be set on an Array instance to modify the behavior of\n\t\t\t// the concat method.  We allow this property to be added to the dispatch object.\n\t\t\tif (key === Symbol.isConcatSpreadable) {\n\t\t\t\treturn Reflect.set(dispatch, key, newValue, proxy);\n\t\t\t}\n\n\t\t\tconst field = getSequenceField(proxy);\n\t\t\tconst maybeIndex = asIndex(key, field.length);\n\t\t\tif (maybeIndex !== undefined) {\n\t\t\t\t// For MVP, we otherwise disallow setting properties (mutation is only available via the array node mutation APIs).\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn allowAdditionalProperties ? Reflect.set(target, key, newValue) : false;\n\t\t},\n\t\thas: (target, key) => {\n\t\t\tconst field = getSequenceField(proxy);\n\t\t\tconst maybeIndex = asIndex(key, field.length);\n\t\t\treturn maybeIndex !== undefined || Reflect.has(dispatch, key);\n\t\t},\n\t\townKeys: (target) => {\n\t\t\tconst field = getSequenceField(proxy);\n\n\t\t\t// TODO: Would a lazy iterator to produce the indexes work / be more efficient?\n\t\t\t// TODO: Need to surface 'Symbol.isConcatSpreadable' as an own key.\n\t\t\tconst keys: (string | symbol)[] = Array.from(\n\t\t\t\t{ length: field.length },\n\t\t\t\t(_, index) => `${index}`,\n\t\t\t);\n\n\t\t\tif (allowAdditionalProperties) {\n\t\t\t\tkeys.push(...Reflect.ownKeys(target));\n\t\t\t} else {\n\t\t\t\tkeys.push(\"length\");\n\t\t\t}\n\t\t\treturn keys;\n\t\t},\n\t\tgetOwnPropertyDescriptor: (target, key) => {\n\t\t\tconst field = getSequenceField(proxy);\n\t\t\tconst maybeIndex = asIndex(key, field.length);\n\t\t\tif (maybeIndex !== undefined) {\n\t\t\t\tconst val = field.boxedAt(maybeIndex);\n\t\t\t\t// To satisfy 'deepEquals' level scrutiny, the property descriptor for indexed properties must\n\t\t\t\t// be a simple value property (as opposed to using getter) and declared writable/enumerable/configurable.\n\t\t\t\treturn {\n\t\t\t\t\t// TODO: Ideally, we would return leaves without first boxing them.  However, this is not\n\t\t\t\t\t//       as simple as calling '.at' since this skips the node and returns the FieldNode's\n\t\t\t\t\t//       inner field.\n\t\t\t\t\tvalue: val === undefined ? val : getOrCreateNodeProxy(val),\n\t\t\t\t\twritable: true, // For MVP, disallow setting indexed properties.\n\t\t\t\t\tenumerable: true,\n\t\t\t\t\tconfigurable: true,\n\t\t\t\t};\n\t\t\t} else if (key === \"length\") {\n\t\t\t\t// To satisfy 'deepEquals' level scrutiny, the property descriptor for 'length' must be a simple\n\t\t\t\t// value property (as opposed to using getter) and be declared writable / non-configurable.\n\t\t\t\treturn {\n\t\t\t\t\tvalue: field.length,\n\t\t\t\t\twritable: true,\n\t\t\t\t\tenumerable: false,\n\t\t\t\t\tconfigurable: false,\n\t\t\t\t};\n\t\t\t}\n\t\t\treturn Reflect.getOwnPropertyDescriptor(dispatch, key);\n\t\t},\n\t});\n\treturn proxy;\n}\n\n/**\n * Define a {@link TreeNodeSchema} for a {@link (TreeArrayNode:interface)}.\n *\n * @param name - Unique identifier for this schema including the factory's scope.\n */\nexport function arraySchema<\n\tTName extends string,\n\tconst T extends ImplicitAllowedTypes,\n\tconst ImplicitlyConstructable extends boolean,\n>(\n\tbase: TreeNodeSchemaClass<\n\t\tTName,\n\t\tNodeKind.Array,\n\t\tTreeNode & WithType<TName>,\n\t\tIterable<InsertableTreeNodeFromImplicitAllowedTypes<T>>,\n\t\tImplicitlyConstructable,\n\t\tT\n\t>,\n\tcustomizable: boolean,\n) {\n\t// This class returns a proxy from its constructor to handle numeric indexing.\n\t// Alternatively it could extend a normal class which gets tons of numeric properties added.\n\tclass schema extends base {\n\t\tpublic constructor(input: Iterable<InsertableTreeNodeFromImplicitAllowedTypes<T>>) {\n\t\t\tsuper(input);\n\n\t\t\tconst proxyTarget = customizable ? this : undefined;\n\n\t\t\tif (customizable) {\n\t\t\t\t// Since proxy reports this as a \"non-configurable\" property, it must exist on the underlying object used as the proxy target, not as an inherited property.\n\t\t\t\t// This should not get used as the proxy should intercept all use.\n\t\t\t\tObject.defineProperty(this, \"length\", {\n\t\t\t\t\tvalue: NaN,\n\t\t\t\t\twritable: true,\n\t\t\t\t\tenumerable: false,\n\t\t\t\t\tconfigurable: false,\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tconst flexSchema = getFlexSchema(this.constructor as TreeNodeSchema);\n\t\t\tassert(flexSchema instanceof FlexFieldNodeSchema, 0x915 /* invalid flex schema */);\n\t\t\tconst flexNode: FlexTreeNode = isFlexTreeNode(input)\n\t\t\t\t? input\n\t\t\t\t: new RawFieldNode(flexSchema, copyContent(flexSchema.name, input) as object);\n\n\t\t\tconst proxy: TreeNode = createArrayNodeProxy(customizable, proxyTarget);\n\t\t\tsetFlexNode(proxy, flexNode);\n\t\t\treturn proxy as unknown as schema;\n\t\t}\n\t}\n\n\t// Setup array functionality\n\tObject.defineProperties(schema.prototype, arrayNodePrototypeProperties);\n\n\treturn schema as TreeNodeSchemaClass<\n\t\tTName,\n\t\tNodeKind.Array,\n\t\tTreeArrayNode<T> & WithType<TName>,\n\t\tIterable<InsertableTreeNodeFromImplicitAllowedTypes<T>>,\n\t\tImplicitlyConstructable,\n\t\tT\n\t>;\n}\n\n/**\n * The implementation of a field node created by {@link createRawNode}.\n */\nclass RawFieldNode<TSchema extends FlexFieldNodeSchema>\n\textends RawTreeNode<TSchema, InsertableContent>\n\timplements FlexTreeFieldNode<TSchema>\n{\n\tpublic get content(): FlexTreeUnboxField<TSchema[\"info\"]> {\n\t\tthrow rawError(\"Reading content of an array node\");\n\t}\n\n\tpublic get boxedContent(): FlexTreeTypedField<TSchema[\"info\"]> {\n\t\tthrow rawError(\"Reading boxed content of an array node\");\n\t}\n}\n\nfunction copyContent<T>(typeName: TreeNodeSchemaIdentifier, content: Iterable<T>): T[] {\n\tconst copy = Array.from(content);\n\tmarkContentType(typeName, copy);\n\treturn copy;\n}\n"]}

package/dist/simple-tree/index.d.ts

@@ -3,16 +3,18 @@
  * Licensed under the MIT License.
  */
 export { ITree, TreeView, TreeViewEvents, TreeConfiguration, SchemaIncompatible } from "./tree.js";
-export { TreeNodeSchema, NodeFromSchema, NodeKind, TreeNodeSchemaClass, TreeNodeSchemaNonClass, TreeNodeSchemaCore, ImplicitFieldSchema, TreeFieldFromImplicitField, ImplicitAllowedTypes, TreeNodeFromImplicitAllowedTypes, InsertableTreeNodeFromImplicitAllowedTypes, TreeMapNode, TreeLeafValue, type, WithType, AllowedTypes, ApplyKind, FieldKind, FieldSchema, InsertableObjectFromSchemaRecord, InsertableTreeFieldFromImplicitField, InsertableTypedNode, NodeBuilderData, ObjectFromSchemaRecord, } from "./schemaTypes.js";
+export { TreeNodeSchema, NodeFromSchema, NodeKind, TreeNodeSchemaClass, TreeNodeSchemaNonClass, TreeNodeSchemaCore, ImplicitFieldSchema, TreeFieldFromImplicitField, ImplicitAllowedTypes, TreeNodeFromImplicitAllowedTypes, InsertableTreeNodeFromImplicitAllowedTypes, TreeLeafValue, type, WithType, AllowedTypes, ApplyKind, FieldKind, FieldSchema, InsertableTreeFieldFromImplicitField, InsertableTypedNode, NodeBuilderData, type FieldProps, normalizeFieldSchema, } from "./schemaTypes.js";
 export { SchemaFactory, type ScopedSchemaName } from "./schemaFactory.js";
-export { getFlexNode } from "./flexNode.js";
-export { treeNodeApi, TreeNodeApi, TreeNodeEvents } from "./treeApi.js";
+export { getFlexNode } from "./proxyBinding.js";
+export { treeNodeApi, TreeNodeApi, TreeChangeEvents } from "./treeApi.js";
 export { toFlexConfig } from "./toFlexSchema.js";
-export { ObjectFromSchemaRecordUnsafe, TreeFieldFromImplicitFieldUnsafe, TreeNodeFromImplicitAllowedTypesUnsafe, FieldSchemaUnsafe, InsertableTreeNodeFromImplicitAllowedTypesUnsafe, TreeArrayNodeUnsafe, TreeMapNodeUnsafe, InsertableObjectFromSchemaRecordUnsafe, InsertableTreeFieldFromImplicitFieldUnsafe, InsertableTypedNodeUnsafe, NodeBuilderDataUnsafe, NodeFromSchemaUnsafe, } from "./typesUnsafe.js";
-export { SchemaFactoryRecursive, ValidateRecursiveSchema } from "./schemaFactoryRecursive.js";
-export { getProxyForField } from "./proxies.js";
+export { ObjectFromSchemaRecordUnsafe, TreeObjectNodeUnsafe, TreeFieldFromImplicitFieldUnsafe, TreeNodeFromImplicitAllowedTypesUnsafe, FieldSchemaUnsafe, InsertableTreeNodeFromImplicitAllowedTypesUnsafe, TreeArrayNodeUnsafe, TreeMapNodeUnsafe, InsertableObjectFromSchemaRecordUnsafe, InsertableTreeFieldFromImplicitFieldUnsafe, InsertableTypedNodeUnsafe, NodeBuilderDataUnsafe, NodeFromSchemaUnsafe, } from "./typesUnsafe.js";
+export { ValidateRecursiveSchema } from "./schemaFactoryRecursive.js";
+export { getProxyForField, InsertableContent } from "./proxies.js";
 export { adaptEnum, enumFromStrings, singletonSchema, typedObjectValues, } from "./schemaCreationUtilities.js";
 export { RecursiveObject as test_RecursiveObject, base as test_RecursiveObject_base, RecursiveObjectPojoMode as test_RecursiveObjectPojoMode, } from "./testRecursiveDomain.js";
-export { TreeNode, Unhydrated, TreeArrayNodeBase } from "./types.js";
-export { TreeArrayNode, IterableTreeArrayContent } from "./treeArrayNode.js";
+export { TreeNode, Unhydrated } from "./types.js";
+export { TreeArrayNode, IterableTreeArrayContent, TreeArrayNodeBase } from "./arrayNode.js";
+export { InsertableObjectFromSchemaRecord, ObjectFromSchemaRecord, TreeObjectNode, setField, } from "./objectNode.js";
+export { TreeMapNode } from "./mapNode.js";
 //# sourceMappingURL=index.d.ts.map

package/dist/simple-tree/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/simple-tree/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AACnG,OAAO,EACN,cAAc,EACd,cAAc,EACd,QAAQ,EACR,mBAAmB,EACnB,sBAAsB,EACtB,kBAAkB,EAClB,mBAAmB,EACnB,0BAA0B,EAC1B,oBAAoB,EACpB,gCAAgC,EAChC,0CAA0C,EAC1C,WAAW,EACX,aAAa,EACb,IAAI,EACJ,QAAQ,EACR,YAAY,EACZ,SAAS,EACT,SAAS,EACT,WAAW,EACX,gCAAgC,EAChC,oCAAoC,EACpC,mBAAmB,EACnB,eAAe,EACf,sBAAsB,GACtB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,aAAa,EAAE,KAAK,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC1E,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AACxE,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EACN,4BAA4B,EAC5B,gCAAgC,EAChC,sCAAsC,EACtC,iBAAiB,EACjB,gDAAgD,EAChD,mBAAmB,EACnB,iBAAiB,EACjB,sCAAsC,EACtC,0CAA0C,EAC1C,yBAAyB,EACzB,qBAAqB,EACrB,oBAAoB,GACpB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,sBAAsB,EAAE,uBAAuB,EAAE,MAAM,6BAA6B,CAAC;AAC9F,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAEhD,OAAO,EACN,SAAS,EACT,eAAe,EACf,eAAe,EACf,iBAAiB,GACjB,MAAM,8BAA8B,CAAC;AAItC,OAAO,EACN,eAAe,IAAI,oBAAoB,EACvC,IAAI,IAAI,yBAAyB,EACjC,uBAAuB,IAAI,4BAA4B,GACvD,MAAM,0BAA0B,CAAC;AAElC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AACrE,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,oBAAoB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/simple-tree/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AACnG,OAAO,EACN,cAAc,EACd,cAAc,EACd,QAAQ,EACR,mBAAmB,EACnB,sBAAsB,EACtB,kBAAkB,EAClB,mBAAmB,EACnB,0BAA0B,EAC1B,oBAAoB,EACpB,gCAAgC,EAChC,0CAA0C,EAC1C,aAAa,EACb,IAAI,EACJ,QAAQ,EACR,YAAY,EACZ,SAAS,EACT,SAAS,EACT,WAAW,EACX,oCAAoC,EACpC,mBAAmB,EACnB,eAAe,EACf,KAAK,UAAU,EACf,oBAAoB,GACpB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,aAAa,EAAE,KAAK,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC1E,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EACN,4BAA4B,EAC5B,oBAAoB,EACpB,gCAAgC,EAChC,sCAAsC,EACtC,iBAAiB,EACjB,gDAAgD,EAChD,mBAAmB,EACnB,iBAAiB,EACjB,sCAAsC,EACtC,0CAA0C,EAC1C,yBAAyB,EACzB,qBAAqB,EACrB,oBAAoB,GACpB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,uBAAuB,EAAE,MAAM,6BAA6B,CAAC;AACtE,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAEnE,OAAO,EACN,SAAS,EACT,eAAe,EACf,eAAe,EACf,iBAAiB,GACjB,MAAM,8BAA8B,CAAC;AAItC,OAAO,EACN,eAAe,IAAI,oBAAoB,EACvC,IAAI,IAAI,yBAAyB,EACjC,uBAAuB,IAAI,4BAA4B,GACvD,MAAM,0BAA0B,CAAC;AAElC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAC5F,OAAO,EACN,gCAAgC,EAChC,sBAAsB,EACtB,cAAc,EACd,QAAQ,GACR,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC"}

package/dist/simple-tree/index.js

@@ -4,7 +4,7 @@
  * Licensed under the MIT License.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.IterableTreeArrayContent = exports.TreeArrayNode = exports.TreeNode = exports.test_RecursiveObjectPojoMode = exports.test_RecursiveObject_base = exports.test_RecursiveObject = exports.typedObjectValues = exports.singletonSchema = exports.enumFromStrings = exports.adaptEnum = exports.getProxyForField = exports.SchemaFactoryRecursive = exports.toFlexConfig = exports.treeNodeApi = exports.getFlexNode = exports.SchemaFactory = exports.FieldSchema = exports.FieldKind = exports.type = exports.NodeKind = exports.TreeConfiguration = void 0;
+exports.setField = exports.IterableTreeArrayContent = exports.TreeArrayNode = exports.TreeNode = exports.test_RecursiveObjectPojoMode = exports.test_RecursiveObject_base = exports.test_RecursiveObject = exports.typedObjectValues = exports.singletonSchema = exports.enumFromStrings = exports.adaptEnum = exports.getProxyForField = exports.toFlexConfig = exports.treeNodeApi = exports.getFlexNode = exports.SchemaFactory = exports.normalizeFieldSchema = exports.FieldSchema = exports.FieldKind = exports.type = exports.NodeKind = exports.TreeConfiguration = void 0;
 var tree_js_1 = require("./tree.js");
 Object.defineProperty(exports, "TreeConfiguration", { enumerable: true, get: function () { return tree_js_1.TreeConfiguration; } });
 var schemaTypes_js_1 = require("./schemaTypes.js");
@@ -12,16 +12,15 @@ Object.defineProperty(exports, "NodeKind", { enumerable: true, get: function ()
 Object.defineProperty(exports, "type", { enumerable: true, get: function () { return schemaTypes_js_1.type; } });
 Object.defineProperty(exports, "FieldKind", { enumerable: true, get: function () { return schemaTypes_js_1.FieldKind; } });
 Object.defineProperty(exports, "FieldSchema", { enumerable: true, get: function () { return schemaTypes_js_1.FieldSchema; } });
+Object.defineProperty(exports, "normalizeFieldSchema", { enumerable: true, get: function () { return schemaTypes_js_1.normalizeFieldSchema; } });
 var schemaFactory_js_1 = require("./schemaFactory.js");
 Object.defineProperty(exports, "SchemaFactory", { enumerable: true, get: function () { return schemaFactory_js_1.SchemaFactory; } });
-var flexNode_js_1 = require("./flexNode.js");
-Object.defineProperty(exports, "getFlexNode", { enumerable: true, get: function () { return flexNode_js_1.getFlexNode; } });
+var proxyBinding_js_1 = require("./proxyBinding.js");
+Object.defineProperty(exports, "getFlexNode", { enumerable: true, get: function () { return proxyBinding_js_1.getFlexNode; } });
 var treeApi_js_1 = require("./treeApi.js");
 Object.defineProperty(exports, "treeNodeApi", { enumerable: true, get: function () { return treeApi_js_1.treeNodeApi; } });
 var toFlexSchema_js_1 = require("./toFlexSchema.js");
 Object.defineProperty(exports, "toFlexConfig", { enumerable: true, get: function () { return toFlexSchema_js_1.toFlexConfig; } });
-var schemaFactoryRecursive_js_1 = require("./schemaFactoryRecursive.js");
-Object.defineProperty(exports, "SchemaFactoryRecursive", { enumerable: true, get: function () { return schemaFactoryRecursive_js_1.SchemaFactoryRecursive; } });
 var proxies_js_1 = require("./proxies.js");
 Object.defineProperty(exports, "getProxyForField", { enumerable: true, get: function () { return proxies_js_1.getProxyForField; } });
 var schemaCreationUtilities_js_1 = require("./schemaCreationUtilities.js");
@@ -37,7 +36,9 @@ Object.defineProperty(exports, "test_RecursiveObject_base", { enumerable: true,
 Object.defineProperty(exports, "test_RecursiveObjectPojoMode", { enumerable: true, get: function () { return testRecursiveDomain_js_1.RecursiveObjectPojoMode; } });
 var types_js_1 = require("./types.js");
 Object.defineProperty(exports, "TreeNode", { enumerable: true, get: function () { return types_js_1.TreeNode; } });
-var treeArrayNode_js_1 = require("./treeArrayNode.js");
-Object.defineProperty(exports, "TreeArrayNode", { enumerable: true, get: function () { return treeArrayNode_js_1.TreeArrayNode; } });
-Object.defineProperty(exports, "IterableTreeArrayContent", { enumerable: true, get: function () { return treeArrayNode_js_1.IterableTreeArrayContent; } });
+var arrayNode_js_1 = require("./arrayNode.js");
+Object.defineProperty(exports, "TreeArrayNode", { enumerable: true, get: function () { return arrayNode_js_1.TreeArrayNode; } });
+Object.defineProperty(exports, "IterableTreeArrayContent", { enumerable: true, get: function () { return arrayNode_js_1.IterableTreeArrayContent; } });
+var objectNode_js_1 = require("./objectNode.js");
+Object.defineProperty(exports, "setField", { enumerable: true, get: function () { return objectNode_js_1.setField; } });
 //# sourceMappingURL=index.js.map

package/dist/simple-tree/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/simple-tree/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,qCAAmG;AAAzD,4GAAA,iBAAiB,OAAA;AAC3D,mDAyB0B;AAtBzB,0GAAA,QAAQ,OAAA;AAWR,sGAAA,IAAI,OAAA;AAIJ,2GAAA,SAAS,OAAA;AACT,6GAAA,WAAW,OAAA;AAOZ,uDAA0E;AAAjE,iHAAA,aAAa,OAAA;AACtB,6CAA4C;AAAnC,0GAAA,WAAW,OAAA;AACpB,2CAAwE;AAA/D,yGAAA,WAAW,OAAA;AACpB,qDAAiD;AAAxC,+GAAA,YAAY,OAAA;AAerB,yEAA8F;AAArF,mIAAA,sBAAsB,OAAA;AAC/B,2CAAgD;AAAvC,8GAAA,gBAAgB,OAAA;AAEzB,2EAKsC;AAJrC,uHAAA,SAAS,OAAA;AACT,6HAAA,eAAe,OAAA;AACf,6HAAA,eAAe,OAAA;AACf,+HAAA,iBAAiB,OAAA;AAGlB,6FAA6F;AAC7F,4IAA4I;AAC5I,mEAIkC;AAHjC,8HAAA,eAAe,OAAwB;AACvC,mIAAA,IAAI,OAA6B;AACjC,sIAAA,uBAAuB,OAAgC;AAGxD,uCAAqE;AAA5D,oGAAA,QAAQ,OAAA;AACjB,uDAA6E;AAApE,iHAAA,aAAa,OAAA;AAAE,4HAAA,wBAAwB,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport { ITree, TreeView, TreeViewEvents, TreeConfiguration, SchemaIncompatible } from \"./tree.js\";\nexport {\n\tTreeNodeSchema,\n\tNodeFromSchema,\n\tNodeKind,\n\tTreeNodeSchemaClass,\n\tTreeNodeSchemaNonClass,\n\tTreeNodeSchemaCore,\n\tImplicitFieldSchema,\n\tTreeFieldFromImplicitField,\n\tImplicitAllowedTypes,\n\tTreeNodeFromImplicitAllowedTypes,\n\tInsertableTreeNodeFromImplicitAllowedTypes,\n\tTreeMapNode,\n\tTreeLeafValue,\n\ttype,\n\tWithType,\n\tAllowedTypes,\n\tApplyKind,\n\tFieldKind,\n\tFieldSchema,\n\tInsertableObjectFromSchemaRecord,\n\tInsertableTreeFieldFromImplicitField,\n\tInsertableTypedNode,\n\tNodeBuilderData,\n\tObjectFromSchemaRecord,\n} from \"./schemaTypes.js\";\nexport { SchemaFactory, type ScopedSchemaName } from \"./schemaFactory.js\";\nexport { getFlexNode } from \"./flexNode.js\";\nexport { treeNodeApi, TreeNodeApi, TreeNodeEvents } from \"./treeApi.js\";\nexport { toFlexConfig } from \"./toFlexSchema.js\";\nexport {\n\tObjectFromSchemaRecordUnsafe,\n\tTreeFieldFromImplicitFieldUnsafe,\n\tTreeNodeFromImplicitAllowedTypesUnsafe,\n\tFieldSchemaUnsafe,\n\tInsertableTreeNodeFromImplicitAllowedTypesUnsafe,\n\tTreeArrayNodeUnsafe,\n\tTreeMapNodeUnsafe,\n\tInsertableObjectFromSchemaRecordUnsafe,\n\tInsertableTreeFieldFromImplicitFieldUnsafe,\n\tInsertableTypedNodeUnsafe,\n\tNodeBuilderDataUnsafe,\n\tNodeFromSchemaUnsafe,\n} from \"./typesUnsafe.js\";\nexport { SchemaFactoryRecursive, ValidateRecursiveSchema } from \"./schemaFactoryRecursive.js\";\nexport { getProxyForField } from \"./proxies.js\";\n\nexport {\n\tadaptEnum,\n\tenumFromStrings,\n\tsingletonSchema,\n\ttypedObjectValues,\n} from \"./schemaCreationUtilities.js\";\n\n// Exporting the schema (RecursiveObject) to test that recursive types are working correctly.\n// These are `@internal` so they can't be included in the `InternalClassTreeTypes` due to https://github.com/microsoft/rushstack/issues/3639\nexport {\n\tRecursiveObject as test_RecursiveObject,\n\tbase as test_RecursiveObject_base,\n\tRecursiveObjectPojoMode as test_RecursiveObjectPojoMode,\n} from \"./testRecursiveDomain.js\";\n\nexport { TreeNode, Unhydrated, TreeArrayNodeBase } from \"./types.js\";\nexport { TreeArrayNode, IterableTreeArrayContent } from \"./treeArrayNode.js\";\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/simple-tree/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,qCAAmG;AAAzD,4GAAA,iBAAiB,OAAA;AAC3D,mDAwB0B;AArBzB,0GAAA,QAAQ,OAAA;AAUR,sGAAA,IAAI,OAAA;AAIJ,2GAAA,SAAS,OAAA;AACT,6GAAA,WAAW,OAAA;AAKX,sHAAA,oBAAoB,OAAA;AAErB,uDAA0E;AAAjE,iHAAA,aAAa,OAAA;AACtB,qDAAgD;AAAvC,8GAAA,WAAW,OAAA;AACpB,2CAA0E;AAAjE,yGAAA,WAAW,OAAA;AACpB,qDAAiD;AAAxC,+GAAA,YAAY,OAAA;AAiBrB,2CAAmE;AAA1D,8GAAA,gBAAgB,OAAA;AAEzB,2EAKsC;AAJrC,uHAAA,SAAS,OAAA;AACT,6HAAA,eAAe,OAAA;AACf,6HAAA,eAAe,OAAA;AACf,+HAAA,iBAAiB,OAAA;AAGlB,6FAA6F;AAC7F,4IAA4I;AAC5I,mEAIkC;AAHjC,8HAAA,eAAe,OAAwB;AACvC,mIAAA,IAAI,OAA6B;AACjC,sIAAA,uBAAuB,OAAgC;AAGxD,uCAAkD;AAAzC,oGAAA,QAAQ,OAAA;AACjB,+CAA4F;AAAnF,6GAAA,aAAa,OAAA;AAAE,wHAAA,wBAAwB,OAAA;AAChD,iDAKyB;AADxB,yGAAA,QAAQ,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport { ITree, TreeView, TreeViewEvents, TreeConfiguration, SchemaIncompatible } from \"./tree.js\";\nexport {\n\tTreeNodeSchema,\n\tNodeFromSchema,\n\tNodeKind,\n\tTreeNodeSchemaClass,\n\tTreeNodeSchemaNonClass,\n\tTreeNodeSchemaCore,\n\tImplicitFieldSchema,\n\tTreeFieldFromImplicitField,\n\tImplicitAllowedTypes,\n\tTreeNodeFromImplicitAllowedTypes,\n\tInsertableTreeNodeFromImplicitAllowedTypes,\n\tTreeLeafValue,\n\ttype,\n\tWithType,\n\tAllowedTypes,\n\tApplyKind,\n\tFieldKind,\n\tFieldSchema,\n\tInsertableTreeFieldFromImplicitField,\n\tInsertableTypedNode,\n\tNodeBuilderData,\n\ttype FieldProps,\n\tnormalizeFieldSchema,\n} from \"./schemaTypes.js\";\nexport { SchemaFactory, type ScopedSchemaName } from \"./schemaFactory.js\";\nexport { getFlexNode } from \"./proxyBinding.js\";\nexport { treeNodeApi, TreeNodeApi, TreeChangeEvents } from \"./treeApi.js\";\nexport { toFlexConfig } from \"./toFlexSchema.js\";\nexport {\n\tObjectFromSchemaRecordUnsafe,\n\tTreeObjectNodeUnsafe,\n\tTreeFieldFromImplicitFieldUnsafe,\n\tTreeNodeFromImplicitAllowedTypesUnsafe,\n\tFieldSchemaUnsafe,\n\tInsertableTreeNodeFromImplicitAllowedTypesUnsafe,\n\tTreeArrayNodeUnsafe,\n\tTreeMapNodeUnsafe,\n\tInsertableObjectFromSchemaRecordUnsafe,\n\tInsertableTreeFieldFromImplicitFieldUnsafe,\n\tInsertableTypedNodeUnsafe,\n\tNodeBuilderDataUnsafe,\n\tNodeFromSchemaUnsafe,\n} from \"./typesUnsafe.js\";\nexport { ValidateRecursiveSchema } from \"./schemaFactoryRecursive.js\";\nexport { getProxyForField, InsertableContent } from \"./proxies.js\";\n\nexport {\n\tadaptEnum,\n\tenumFromStrings,\n\tsingletonSchema,\n\ttypedObjectValues,\n} from \"./schemaCreationUtilities.js\";\n\n// Exporting the schema (RecursiveObject) to test that recursive types are working correctly.\n// These are `@internal` so they can't be included in the `InternalClassTreeTypes` due to https://github.com/microsoft/rushstack/issues/3639\nexport {\n\tRecursiveObject as test_RecursiveObject,\n\tbase as test_RecursiveObject_base,\n\tRecursiveObjectPojoMode as test_RecursiveObjectPojoMode,\n} from \"./testRecursiveDomain.js\";\n\nexport { TreeNode, Unhydrated } from \"./types.js\";\nexport { TreeArrayNode, IterableTreeArrayContent, TreeArrayNodeBase } from \"./arrayNode.js\";\nexport {\n\tInsertableObjectFromSchemaRecord,\n\tObjectFromSchemaRecord,\n\tTreeObjectNode,\n\tsetField,\n} from \"./objectNode.js\";\nexport { TreeMapNode } from \"./mapNode.js\";\n"]}