@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/dist/core/tree/detachedFieldIndex.d.ts

@@ -0,0 +1,64 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Brand, IdAllocator } from "../../util";
+import { FieldKey } from "../schema-stored";
+import { ICodecOptions } from "../../codec";
+import * as Delta from "./delta";
+import { Major } from "./detachedFieldIndexTypes";
+/**
+ * ID used to create a detached field key for a removed subtree.
+ *
+ * TODO: Move to Forest once forests can support multiple roots.
+ * @internal
+ */
+export type ForestRootId = Brand<number, "tree.ForestRootId">;
+/**
+ * The tree index records detached field IDs and associates them with a change atom ID.
+ */
+export declare class DetachedFieldIndex {
+    private readonly name;
+    private rootIdAllocator;
+    private detachedNodeToField;
+    private readonly codec;
+    private readonly options;
+    /**
+     * @param name - A name for the index, used as a prefix for the generated field keys.
+     * @param rootIdAllocator - An ID allocator used to generate unique field keys.
+     */
+    constructor(name: string, rootIdAllocator: IdAllocator<ForestRootId>, options?: ICodecOptions);
+    clone(): DetachedFieldIndex;
+    entries(): Generator<{
+        root: ForestRootId;
+    } & {
+        id: Delta.DetachedNodeId;
+    }>;
+    updateMajor(current: Major, updated: Major): void;
+    /**
+     * Returns a field key for the given ID.
+     * This does not save the field key on the index. To do so, call {@link createEntry}.
+     */
+    toFieldKey(id: ForestRootId): FieldKey;
+    /**
+     * Returns the FieldKey associated with the given id.
+     * Returns undefined if no such id is known to the index.
+     */
+    tryGetEntry(id: Delta.DetachedNodeId): ForestRootId | undefined;
+    /**
+     * Returns the FieldKey associated with the given id.
+     * Fails if no such id is known to the index.
+     */
+    getEntry(id: Delta.DetachedNodeId): ForestRootId;
+    deleteEntry(nodeId: Delta.DetachedNodeId): void;
+    /**
+     * Associates the DetachedNodeId with a field key and creates an entry for it in the index.
+     */
+    createEntry(nodeId?: Delta.DetachedNodeId, count?: number): ForestRootId;
+    encode(): string;
+    /**
+     * Loads the tree index from the given string, this overrides any existing data.
+     */
+    loadData(data: string): void;
+}
+//# sourceMappingURL=detachedFieldIndex.d.ts.map

package/dist/core/tree/detachedFieldIndex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detachedFieldIndex.d.ts","sourceRoot":"","sources":["../../../src/core/tree/detachedFieldIndex.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACN,KAAK,EACL,WAAW,EAQX,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,aAAa,EAA6B,MAAM,aAAa,CAAC;AACvE,OAAO,KAAK,KAAK,MAAM,SAAS,CAAC;AACjC,OAAO,EAA4B,KAAK,EAAS,MAAM,2BAA2B,CAAC;AAGnF;;;;;GAKG;AACH,MAAM,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC;AAE9D;;GAEG;AACH,qBAAa,kBAAkB;IAW7B,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,eAAe;IAVxB,OAAO,CAAC,mBAAmB,CAAoD;IAC/E,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA+C;IACrE,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAgB;IAExC;;;OAGG;gBAEe,IAAI,EAAE,MAAM,EACrB,eAAe,EAAE,WAAW,CAAC,YAAY,CAAC,EAClD,OAAO,CAAC,EAAE,aAAa;IAMjB,KAAK,IAAI,kBAAkB;IAU1B,OAAO,IAAI,SAAS,CAAC;QAAE,IAAI,EAAE,YAAY,CAAA;KAAE,GAAG;QAAE,EAAE,EAAE,KAAK,CAAC,cAAc,CAAA;KAAE,CAAC;IAc5E,WAAW,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK;IAmBjD;;;OAGG;IACI,UAAU,CAAC,EAAE,EAAE,YAAY,GAAG,QAAQ;IAI7C;;;OAGG;IACI,WAAW,CAAC,EAAE,EAAE,KAAK,CAAC,cAAc,GAAG,YAAY,GAAG,SAAS;IAItE;;;OAGG;IACI,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,cAAc,GAAG,YAAY;IAMhD,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,cAAc,GAAG,IAAI;IAKtD;;OAEG;IACI,WAAW,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,cAAc,EAAE,KAAK,GAAE,MAAU,GAAG,YAAY;IAkB3E,MAAM,IAAI,MAAM;IAOvB;;OAEG;IACI,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;CAWnC"}

package/dist/core/tree/detachedFieldIndex.js

@@ -0,0 +1,119 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DetachedFieldIndex = void 0;
+const core_utils_1 = require("@fluidframework/core-utils");
+const util_1 = require("../../util");
+const codec_1 = require("../../codec");
+const detachedFieldIndexCodec_1 = require("./detachedFieldIndexCodec");
+/**
+ * The tree index records detached field IDs and associates them with a change atom ID.
+ */
+class DetachedFieldIndex {
+    /**
+     * @param name - A name for the index, used as a prefix for the generated field keys.
+     * @param rootIdAllocator - An ID allocator used to generate unique field keys.
+     */
+    constructor(name, rootIdAllocator, options) {
+        this.name = name;
+        this.rootIdAllocator = rootIdAllocator;
+        // TODO: don't store the field key in the index, it can be derived from the root ID
+        this.detachedNodeToField = new Map();
+        this.options = options ?? { jsonValidator: codec_1.noopValidator };
+        this.codec = (0, detachedFieldIndexCodec_1.makeDetachedNodeToFieldCodec)(this.options);
+    }
+    clone() {
+        const clone = new DetachedFieldIndex(this.name, (0, util_1.idAllocatorFromMaxId)(this.rootIdAllocator.getNextId()), this.options);
+        (0, util_1.populateNestedMap)(this.detachedNodeToField, clone.detachedNodeToField);
+        return clone;
+    }
+    *entries() {
+        for (const [major, innerMap] of this.detachedNodeToField) {
+            if (major !== undefined) {
+                for (const [minor, entry] of innerMap) {
+                    yield { id: { major, minor }, root: entry };
+                }
+            }
+            else {
+                for (const [minor, entry] of innerMap) {
+                    yield { id: { minor }, root: entry };
+                }
+            }
+        }
+    }
+    updateMajor(current, updated) {
+        const innerCurrent = this.detachedNodeToField.get(current);
+        if (innerCurrent !== undefined) {
+            this.detachedNodeToField.delete(current);
+            const innerUpdated = this.detachedNodeToField.get(updated);
+            if (innerUpdated === undefined) {
+                this.detachedNodeToField.set(updated, innerCurrent);
+            }
+            else {
+                for (const [minor, entry] of innerCurrent) {
+                    (0, core_utils_1.assert)(innerUpdated.get(minor) === undefined, 0x7a9 /* Collision during index update */);
+                    innerUpdated.set(minor, entry);
+                }
+            }
+        }
+    }
+    /**
+     * Returns a field key for the given ID.
+     * This does not save the field key on the index. To do so, call {@link createEntry}.
+     */
+    toFieldKey(id) {
+        return (0, util_1.brand)(`${this.name}-${id}`);
+    }
+    /**
+     * Returns the FieldKey associated with the given id.
+     * Returns undefined if no such id is known to the index.
+     */
+    tryGetEntry(id) {
+        return (0, util_1.tryGetFromNestedMap)(this.detachedNodeToField, id.major, id.minor);
+    }
+    /**
+     * Returns the FieldKey associated with the given id.
+     * Fails if no such id is known to the index.
+     */
+    getEntry(id) {
+        const key = this.tryGetEntry(id);
+        (0, core_utils_1.assert)(key !== undefined, 0x7aa /* Unknown removed node ID */);
+        return key;
+    }
+    deleteEntry(nodeId) {
+        const found = (0, util_1.deleteFromNestedMap)(this.detachedNodeToField, nodeId.major, nodeId.minor);
+        (0, core_utils_1.assert)(found, 0x7ab /* Unable to delete unknown entry */);
+    }
+    /**
+     * Associates the DetachedNodeId with a field key and creates an entry for it in the index.
+     */
+    createEntry(nodeId, count = 1) {
+        const root = this.rootIdAllocator.allocate(count);
+        if (nodeId !== undefined) {
+            for (let i = 0; i < count; i++) {
+                (0, core_utils_1.assert)((0, util_1.tryGetFromNestedMap)(this.detachedNodeToField, nodeId.major, nodeId.minor + i) === undefined, 0x7ce /* Detached node ID already exists in index */);
+                (0, util_1.setInNestedMap)(this.detachedNodeToField, nodeId.major, nodeId.minor + i, root + i);
+            }
+        }
+        return root;
+    }
+    encode() {
+        return this.codec.encode({
+            data: this.detachedNodeToField,
+            maxId: this.rootIdAllocator.getNextId(),
+        });
+    }
+    /**
+     * Loads the tree index from the given string, this overrides any existing data.
+     */
+    loadData(data) {
+        const detachedFieldIndex = this.codec.decode(data);
+        this.rootIdAllocator = (0, util_1.idAllocatorFromMaxId)(detachedFieldIndex.maxId);
+        this.detachedNodeToField = detachedFieldIndex.data;
+    }
+}
+exports.DetachedFieldIndex = DetachedFieldIndex;
+//# sourceMappingURL=detachedFieldIndex.js.map

package/dist/core/tree/detachedFieldIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detachedFieldIndex.js","sourceRoot":"","sources":["../../../src/core/tree/detachedFieldIndex.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,qCAUoB;AAEpB,uCAAuE;AAGvE,uEAAyE;AAUzE;;GAEG;AACH,MAAa,kBAAkB;IAM9B;;;OAGG;IACH,YACkB,IAAY,EACrB,eAA0C,EAClD,OAAuB;QAFN,SAAI,GAAJ,IAAI,CAAQ;QACrB,oBAAe,GAAf,eAAe,CAA2B;QAXnD,mFAAmF;QAC3E,wBAAmB,GAA0C,IAAI,GAAG,EAAE,CAAC;QAa9E,IAAI,CAAC,OAAO,GAAG,OAAO,IAAI,EAAE,aAAa,EAAE,qBAAa,EAAE,CAAC;QAC3D,IAAI,CAAC,KAAK,GAAG,IAAA,sDAA4B,EAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzD,CAAC;IAEM,KAAK;QACX,MAAM,KAAK,GAAG,IAAI,kBAAkB,CACnC,IAAI,CAAC,IAAI,EACT,IAAA,2BAAoB,EAAC,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,CAA8B,EACnF,IAAI,CAAC,OAAO,CACZ,CAAC;QACF,IAAA,wBAAiB,EAAC,IAAI,CAAC,mBAAmB,EAAE,KAAK,CAAC,mBAAmB,CAAC,CAAC;QACvE,OAAO,KAAK,CAAC;IACd,CAAC;IAEM,CAAC,OAAO;QACd,KAAK,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,mBAAmB,EAAE;YACzD,IAAI,KAAK,KAAK,SAAS,EAAE;gBACxB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE;oBACtC,MAAM,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;iBAC5C;aACD;iBAAM;gBACN,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE;oBACtC,MAAM,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;iBACrC;aACD;SACD;IACF,CAAC;IAEM,WAAW,CAAC,OAAc,EAAE,OAAc;QAChD,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC3D,IAAI,YAAY,KAAK,SAAS,EAAE;YAC/B,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACzC,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC3D,IAAI,YAAY,KAAK,SAAS,EAAE;gBAC/B,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;aACpD;iBAAM;gBACN,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,YAAY,EAAE;oBAC1C,IAAA,mBAAM,EACL,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,SAAS,EACrC,KAAK,CAAC,mCAAmC,CACzC,CAAC;oBACF,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;iBAC/B;aACD;SACD;IACF,CAAC;IAED;;;OAGG;IACI,UAAU,CAAC,EAAgB;QACjC,OAAO,IAAA,YAAK,EAAC,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,EAAwB;QAC1C,OAAO,IAAA,0BAAmB,EAAC,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;IAC1E,CAAC;IAED;;;OAGG;IACI,QAAQ,CAAC,EAAwB;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACjC,IAAA,mBAAM,EAAC,GAAG,KAAK,SAAS,EAAE,KAAK,CAAC,6BAA6B,CAAC,CAAC;QAC/D,OAAO,GAAG,CAAC;IACZ,CAAC;IAEM,WAAW,CAAC,MAA4B;QAC9C,MAAM,KAAK,GAAG,IAAA,0BAAmB,EAAC,IAAI,CAAC,mBAAmB,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QACxF,IAAA,mBAAM,EAAC,KAAK,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAC3D,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,MAA6B,EAAE,QAAgB,CAAC;QAClE,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClD,IAAI,MAAM,KAAK,SAAS,EAAE;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;gBAC/B,IAAA,mBAAM,EACL,IAAA,0BAAmB,EAClB,IAAI,CAAC,mBAAmB,EACxB,MAAM,CAAC,KAAK,EACZ,MAAM,CAAC,KAAK,GAAG,CAAC,CAChB,KAAK,SAAS,EACf,KAAK,CAAC,8CAA8C,CACpD,CAAC;gBACF,IAAA,qBAAc,EAAC,IAAI,CAAC,mBAAmB,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;aACnF;SACD;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,MAAM;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YACxB,IAAI,EAAE,IAAI,CAAC,mBAAmB;YAC9B,KAAK,EAAE,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE;SACvC,CAAC,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,QAAQ,CAAC,IAAY;QAC3B,MAAM,kBAAkB,GAGpB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAE5B,IAAI,CAAC,eAAe,GAAG,IAAA,2BAAoB,EAC1C,kBAAkB,CAAC,KAAK,CACK,CAAC;QAC/B,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC,IAAI,CAAC;IACpD,CAAC;CACD;AAvID,gDAuIC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport {\n\tBrand,\n\tIdAllocator,\n\tNestedMap,\n\tbrand,\n\tdeleteFromNestedMap,\n\tidAllocatorFromMaxId,\n\tpopulateNestedMap,\n\tsetInNestedMap,\n\ttryGetFromNestedMap,\n} from \"../../util\";\nimport { FieldKey } from \"../schema-stored\";\nimport { ICodecOptions, IJsonCodec, noopValidator } from \"../../codec\";\nimport * as Delta from \"./delta\";\nimport { DetachedFieldSummaryData, Major, Minor } from \"./detachedFieldIndexTypes\";\nimport { makeDetachedNodeToFieldCodec } from \"./detachedFieldIndexCodec\";\n\n/**\n * ID used to create a detached field key for a removed subtree.\n *\n * TODO: Move to Forest once forests can support multiple roots.\n * @internal\n */\nexport type ForestRootId = Brand<number, \"tree.ForestRootId\">;\n\n/**\n * The tree index records detached field IDs and associates them with a change atom ID.\n */\nexport class DetachedFieldIndex {\n\t// TODO: don't store the field key in the index, it can be derived from the root ID\n\tprivate detachedNodeToField: NestedMap<Major, Minor, ForestRootId> = new Map();\n\tprivate readonly codec: IJsonCodec<DetachedFieldSummaryData, string>;\n\tprivate readonly options: ICodecOptions;\n\n\t/**\n\t * @param name - A name for the index, used as a prefix for the generated field keys.\n\t * @param rootIdAllocator - An ID allocator used to generate unique field keys.\n\t */\n\tpublic constructor(\n\t\tprivate readonly name: string,\n\t\tprivate rootIdAllocator: IdAllocator<ForestRootId>,\n\t\toptions?: ICodecOptions,\n\t) {\n\t\tthis.options = options ?? { jsonValidator: noopValidator };\n\t\tthis.codec = makeDetachedNodeToFieldCodec(this.options);\n\t}\n\n\tpublic clone(): DetachedFieldIndex {\n\t\tconst clone = new DetachedFieldIndex(\n\t\t\tthis.name,\n\t\t\tidAllocatorFromMaxId(this.rootIdAllocator.getNextId()) as IdAllocator<ForestRootId>,\n\t\t\tthis.options,\n\t\t);\n\t\tpopulateNestedMap(this.detachedNodeToField, clone.detachedNodeToField);\n\t\treturn clone;\n\t}\n\n\tpublic *entries(): Generator<{ root: ForestRootId } & { id: Delta.DetachedNodeId }> {\n\t\tfor (const [major, innerMap] of this.detachedNodeToField) {\n\t\t\tif (major !== undefined) {\n\t\t\t\tfor (const [minor, entry] of innerMap) {\n\t\t\t\t\tyield { id: { major, minor }, root: entry };\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor (const [minor, entry] of innerMap) {\n\t\t\t\t\tyield { id: { minor }, root: entry };\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic updateMajor(current: Major, updated: Major) {\n\t\tconst innerCurrent = this.detachedNodeToField.get(current);\n\t\tif (innerCurrent !== undefined) {\n\t\t\tthis.detachedNodeToField.delete(current);\n\t\t\tconst innerUpdated = this.detachedNodeToField.get(updated);\n\t\t\tif (innerUpdated === undefined) {\n\t\t\t\tthis.detachedNodeToField.set(updated, innerCurrent);\n\t\t\t} else {\n\t\t\t\tfor (const [minor, entry] of innerCurrent) {\n\t\t\t\t\tassert(\n\t\t\t\t\t\tinnerUpdated.get(minor) === undefined,\n\t\t\t\t\t\t0x7a9 /* Collision during index update */,\n\t\t\t\t\t);\n\t\t\t\t\tinnerUpdated.set(minor, entry);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Returns a field key for the given ID.\n\t * This does not save the field key on the index. To do so, call {@link createEntry}.\n\t */\n\tpublic toFieldKey(id: ForestRootId): FieldKey {\n\t\treturn brand(`${this.name}-${id}`);\n\t}\n\n\t/**\n\t * Returns the FieldKey associated with the given id.\n\t * Returns undefined if no such id is known to the index.\n\t */\n\tpublic tryGetEntry(id: Delta.DetachedNodeId): ForestRootId | undefined {\n\t\treturn tryGetFromNestedMap(this.detachedNodeToField, id.major, id.minor);\n\t}\n\n\t/**\n\t * Returns the FieldKey associated with the given id.\n\t * Fails if no such id is known to the index.\n\t */\n\tpublic getEntry(id: Delta.DetachedNodeId): ForestRootId {\n\t\tconst key = this.tryGetEntry(id);\n\t\tassert(key !== undefined, 0x7aa /* Unknown removed node ID */);\n\t\treturn key;\n\t}\n\n\tpublic deleteEntry(nodeId: Delta.DetachedNodeId): void {\n\t\tconst found = deleteFromNestedMap(this.detachedNodeToField, nodeId.major, nodeId.minor);\n\t\tassert(found, 0x7ab /* Unable to delete unknown entry */);\n\t}\n\n\t/**\n\t * Associates the DetachedNodeId with a field key and creates an entry for it in the index.\n\t */\n\tpublic createEntry(nodeId?: Delta.DetachedNodeId, count: number = 1): ForestRootId {\n\t\tconst root = this.rootIdAllocator.allocate(count);\n\t\tif (nodeId !== undefined) {\n\t\t\tfor (let i = 0; i < count; i++) {\n\t\t\t\tassert(\n\t\t\t\t\ttryGetFromNestedMap(\n\t\t\t\t\t\tthis.detachedNodeToField,\n\t\t\t\t\t\tnodeId.major,\n\t\t\t\t\t\tnodeId.minor + i,\n\t\t\t\t\t) === undefined,\n\t\t\t\t\t0x7ce /* Detached node ID already exists in index */,\n\t\t\t\t);\n\t\t\t\tsetInNestedMap(this.detachedNodeToField, nodeId.major, nodeId.minor + i, root + i);\n\t\t\t}\n\t\t}\n\t\treturn root;\n\t}\n\n\tpublic encode(): string {\n\t\treturn this.codec.encode({\n\t\t\tdata: this.detachedNodeToField,\n\t\t\tmaxId: this.rootIdAllocator.getNextId(),\n\t\t});\n\t}\n\n\t/**\n\t * Loads the tree index from the given string, this overrides any existing data.\n\t */\n\tpublic loadData(data: string): void {\n\t\tconst detachedFieldIndex: {\n\t\t\tdata: NestedMap<Major, Minor, ForestRootId>;\n\t\t\tmaxId: number;\n\t\t} = this.codec.decode(data);\n\n\t\tthis.rootIdAllocator = idAllocatorFromMaxId(\n\t\t\tdetachedFieldIndex.maxId,\n\t\t) as IdAllocator<ForestRootId>;\n\t\tthis.detachedNodeToField = detachedFieldIndex.data;\n\t}\n}\n"]}

package/dist/core/tree/detachedFieldIndexCodec.d.ts

@@ -0,0 +1,8 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { ICodecOptions, IJsonCodec } from "../../codec";
+import { DetachedFieldSummaryData } from "./detachedFieldIndexTypes";
+export declare function makeDetachedNodeToFieldCodec({ jsonValidator: validator, }: ICodecOptions): IJsonCodec<DetachedFieldSummaryData, string>;
+//# sourceMappingURL=detachedFieldIndexCodec.d.ts.map

package/dist/core/tree/detachedFieldIndexCodec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detachedFieldIndexCodec.d.ts","sourceRoot":"","sources":["../../../src/core/tree/detachedFieldIndexCodec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAIxD,OAAO,EAAE,wBAAwB,EAAgB,MAAM,2BAA2B,CAAC;AAEnF,wBAAgB,4BAA4B,CAAC,EAC5C,aAAa,EAAE,SAAS,GACxB,EAAE,aAAa,GAAG,UAAU,CAAC,wBAAwB,EAAE,MAAM,CAAC,CA4C9D"}

package/dist/core/tree/detachedFieldIndexCodec.js

@@ -0,0 +1,53 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.makeDetachedNodeToFieldCodec = void 0;
+const core_utils_1 = require("@fluidframework/core-utils");
+const util_1 = require("../../util");
+const detachedFieldIndexFormat_1 = require("./detachedFieldIndexFormat");
+function makeDetachedNodeToFieldCodec({ jsonValidator: validator, }) {
+    const versionedValidator = validator.compile(detachedFieldIndexFormat_1.Versioned);
+    const formatValidator = validator.compile(detachedFieldIndexFormat_1.Format);
+    return {
+        encode: (data) => {
+            const detachedNodeToFieldData = [];
+            (0, util_1.forEachInNestedMap)(data.data, (root, key1, key2) => {
+                detachedNodeToFieldData.push([key1, key2, root]);
+            });
+            const encoded = {
+                version: detachedFieldIndexFormat_1.version,
+                data: detachedNodeToFieldData,
+                maxId: data.maxId,
+            };
+            (0, core_utils_1.assert)(versionedValidator.check(encoded), 0x7ff /* Encoded detachedNodeToField data should be versioned */);
+            (0, core_utils_1.assert)(formatValidator.check(encoded), 0x800 /* Encoded schema should validate */);
+            return JSON.stringify(encoded);
+        },
+        decode: (data) => {
+            const parsed = JSON.parse(data);
+            if (!versionedValidator.check(parsed)) {
+                (0, util_1.fail)("invalid serialized data: did not have a version");
+            }
+            // When more versions exist, we can switch on the version here.
+            if (parsed.version !== detachedFieldIndexFormat_1.version) {
+                (0, util_1.fail)("Unexpected version for serialized data");
+            }
+            if (!formatValidator.check(parsed)) {
+                (0, util_1.fail)("Serialized data failed validation");
+            }
+            const map = new Map();
+            for (const [major, minor, root] of parsed.data) {
+                (0, util_1.setInNestedMap)(map, major, minor, root);
+            }
+            return {
+                data: map,
+                maxId: parsed.maxId,
+            };
+        },
+    };
+}
+exports.makeDetachedNodeToFieldCodec = makeDetachedNodeToFieldCodec;
+//# sourceMappingURL=detachedFieldIndexCodec.js.map

package/dist/core/tree/detachedFieldIndexCodec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detachedFieldIndexCodec.js","sourceRoot":"","sources":["../../../src/core/tree/detachedFieldIndexCodec.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AAEpD,qCAAsE;AAEtE,yEAAwE;AAGxE,SAAgB,4BAA4B,CAAC,EAC5C,aAAa,EAAE,SAAS,GACT;IACf,MAAM,kBAAkB,GAAG,SAAS,CAAC,OAAO,CAAC,oCAAS,CAAC,CAAC;IACxD,MAAM,eAAe,GAAG,SAAS,CAAC,OAAO,CAAC,iCAAM,CAAC,CAAC;IAClD,OAAO;QACN,MAAM,EAAE,CAAC,IAA8B,EAAU,EAAE;YAClD,MAAM,uBAAuB,GAAmC,EAAE,CAAC;YACnE,IAAA,yBAAkB,EAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;gBAClD,uBAAuB,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAClD,CAAC,CAAC,CAAC;YACH,MAAM,OAAO,GAAG;gBACf,OAAO,EAAP,kCAAO;gBACP,IAAI,EAAE,uBAAuB;gBAC7B,KAAK,EAAE,IAAI,CAAC,KAAK;aACjB,CAAC;YACF,IAAA,mBAAM,EACL,kBAAkB,CAAC,KAAK,CAAC,OAAO,CAAC,EACjC,KAAK,CAAC,0DAA0D,CAChE,CAAC;YACF,IAAA,mBAAM,EAAC,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;YACnF,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;QACD,MAAM,EAAE,CAAC,IAAY,EAA4B,EAAE;YAClD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAEhC,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE;gBACtC,IAAA,WAAI,EAAC,iDAAiD,CAAC,CAAC;aACxD;YACD,+DAA+D;YAC/D,IAAI,MAAM,CAAC,OAAO,KAAK,kCAAO,EAAE;gBAC/B,IAAA,WAAI,EAAC,wCAAwC,CAAC,CAAC;aAC/C;YACD,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE;gBACnC,IAAA,WAAI,EAAC,mCAAmC,CAAC,CAAC;aAC1C;YACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;YACtB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE;gBAC/C,IAAA,qBAAc,EAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;aACxC;YACD,OAAO;gBACN,IAAI,EAAE,GAAG;gBACT,KAAK,EAAE,MAAM,CAAC,KAAK;aACnB,CAAC;QACH,CAAC;KACD,CAAC;AACH,CAAC;AA9CD,oEA8CC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport { ICodecOptions, IJsonCodec } from \"../../codec\";\nimport { fail, forEachInNestedMap, setInNestedMap } from \"../../util\";\nimport { ForestRootId } from \"./detachedFieldIndex\";\nimport { Format, Versioned, version } from \"./detachedFieldIndexFormat\";\nimport { DetachedFieldSummaryData, Major, Minor } from \"./detachedFieldIndexTypes\";\n\nexport function makeDetachedNodeToFieldCodec({\n\tjsonValidator: validator,\n}: ICodecOptions): IJsonCodec<DetachedFieldSummaryData, string> {\n\tconst versionedValidator = validator.compile(Versioned);\n\tconst formatValidator = validator.compile(Format);\n\treturn {\n\t\tencode: (data: DetachedFieldSummaryData): string => {\n\t\t\tconst detachedNodeToFieldData: [Major, Minor, ForestRootId][] = [];\n\t\t\tforEachInNestedMap(data.data, (root, key1, key2) => {\n\t\t\t\tdetachedNodeToFieldData.push([key1, key2, root]);\n\t\t\t});\n\t\t\tconst encoded = {\n\t\t\t\tversion,\n\t\t\t\tdata: detachedNodeToFieldData,\n\t\t\t\tmaxId: data.maxId,\n\t\t\t};\n\t\t\tassert(\n\t\t\t\tversionedValidator.check(encoded),\n\t\t\t\t0x7ff /* Encoded detachedNodeToField data should be versioned */,\n\t\t\t);\n\t\t\tassert(formatValidator.check(encoded), 0x800 /* Encoded schema should validate */);\n\t\t\treturn JSON.stringify(encoded);\n\t\t},\n\t\tdecode: (data: string): DetachedFieldSummaryData => {\n\t\t\tconst parsed = JSON.parse(data);\n\n\t\t\tif (!versionedValidator.check(parsed)) {\n\t\t\t\tfail(\"invalid serialized data: did not have a version\");\n\t\t\t}\n\t\t\t// When more versions exist, we can switch on the version here.\n\t\t\tif (parsed.version !== version) {\n\t\t\t\tfail(\"Unexpected version for serialized data\");\n\t\t\t}\n\t\t\tif (!formatValidator.check(parsed)) {\n\t\t\t\tfail(\"Serialized data failed validation\");\n\t\t\t}\n\t\t\tconst map = new Map();\n\t\t\tfor (const [major, minor, root] of parsed.data) {\n\t\t\t\tsetInNestedMap(map, major, minor, root);\n\t\t\t}\n\t\t\treturn {\n\t\t\t\tdata: map,\n\t\t\t\tmaxId: parsed.maxId,\n\t\t\t};\n\t\t},\n\t};\n}\n"]}

package/dist/core/tree/detachedFieldIndexFormat.d.ts

@@ -0,0 +1,18 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Static } from "@sinclair/typebox";
+import { ForestRootId } from "./detachedFieldIndex";
+export declare const version = 1;
+export declare const Format: import("@sinclair/typebox").TObject<{
+    version: import("@sinclair/typebox").TLiteral<1>;
+    data: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TString, import("@sinclair/typebox").TNumber, import("@sinclair/typebox").TUndefined]>, import("@sinclair/typebox").TNumber, import("@sinclair/typebox").TUnsafe<ForestRootId>]>>;
+    maxId: import("@sinclair/typebox").TUnsafe<ForestRootId>;
+}>;
+export type Format = Static<typeof Format>;
+export declare const Versioned: import("@sinclair/typebox").TObject<{
+    version: import("@sinclair/typebox").TNumber;
+}>;
+export type Versioned = Static<typeof Versioned>;
+//# sourceMappingURL=detachedFieldIndexFormat.d.ts.map

package/dist/core/tree/detachedFieldIndexFormat.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detachedFieldIndexFormat.d.ts","sourceRoot":"","sources":["../../../src/core/tree/detachedFieldIndexFormat.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAQ,MAAM,mBAAmB,CAAC;AAEjD,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAEpD,eAAO,MAAM,OAAO,IAAM,CAAC;AAW3B,eAAO,MAAM,MAAM;;;;EAOlB,CAAC;AAEF,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,MAAM,CAAC,CAAC;AAE3C,eAAO,MAAM,SAAS;;EAEpB,CAAC;AACH,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,SAAS,CAAC,CAAC"}

package/dist/core/tree/detachedFieldIndexFormat.js

@@ -0,0 +1,25 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Versioned = exports.Format = exports.version = void 0;
+const typebox_1 = require("@sinclair/typebox");
+const util_1 = require("../../util");
+exports.version = 1.0;
+// Define the Major and Minor types:
+const MajorSchema = typebox_1.Type.Union([typebox_1.Type.String(), typebox_1.Type.Number(), typebox_1.Type.Undefined()]);
+const MinorSchema = typebox_1.Type.Number();
+const ForestRootIdSchema = (0, util_1.brandedNumberType)();
+// Define the tuple:
+const TupleSchema = typebox_1.Type.Tuple([MajorSchema, MinorSchema, ForestRootIdSchema]);
+exports.Format = typebox_1.Type.Object({
+    version: typebox_1.Type.Literal(exports.version),
+    data: typebox_1.Type.Array(TupleSchema),
+    maxId: ForestRootIdSchema,
+}, { additionalProperties: false });
+exports.Versioned = typebox_1.Type.Object({
+    version: typebox_1.Type.Number(),
+});
+//# sourceMappingURL=detachedFieldIndexFormat.js.map

package/dist/core/tree/detachedFieldIndexFormat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detachedFieldIndexFormat.js","sourceRoot":"","sources":["../../../src/core/tree/detachedFieldIndexFormat.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+CAAiD;AACjD,qCAA+C;AAGlC,QAAA,OAAO,GAAG,GAAG,CAAC;AAE3B,oCAAoC;AACpC,MAAM,WAAW,GAAG,cAAI,CAAC,KAAK,CAAC,CAAC,cAAI,CAAC,MAAM,EAAE,EAAE,cAAI,CAAC,MAAM,EAAE,EAAE,cAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;AACjF,MAAM,WAAW,GAAG,cAAI,CAAC,MAAM,EAAE,CAAC;AAElC,MAAM,kBAAkB,GAAG,IAAA,wBAAiB,GAAgB,CAAC;AAE7D,oBAAoB;AACpB,MAAM,WAAW,GAAG,cAAI,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,WAAW,EAAE,kBAAkB,CAAC,CAAC,CAAC;AAElE,QAAA,MAAM,GAAG,cAAI,CAAC,MAAM,CAChC;IACC,OAAO,EAAE,cAAI,CAAC,OAAO,CAAC,eAAO,CAAC;IAC9B,IAAI,EAAE,cAAI,CAAC,KAAK,CAAC,WAAW,CAAC;IAC7B,KAAK,EAAE,kBAAkB;CACzB,EACD,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAC/B,CAAC;AAIW,QAAA,SAAS,GAAG,cAAI,CAAC,MAAM,CAAC;IACpC,OAAO,EAAE,cAAI,CAAC,MAAM,EAAE;CACtB,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { Static, Type } from \"@sinclair/typebox\";\nimport { brandedNumberType } from \"../../util\";\nimport { ForestRootId } from \"./detachedFieldIndex\";\n\nexport const version = 1.0;\n\n// Define the Major and Minor types:\nconst MajorSchema = Type.Union([Type.String(), Type.Number(), Type.Undefined()]);\nconst MinorSchema = Type.Number();\n\nconst ForestRootIdSchema = brandedNumberType<ForestRootId>();\n\n// Define the tuple:\nconst TupleSchema = Type.Tuple([MajorSchema, MinorSchema, ForestRootIdSchema]);\n\nexport const Format = Type.Object(\n\t{\n\t\tversion: Type.Literal(version),\n\t\tdata: Type.Array(TupleSchema),\n\t\tmaxId: ForestRootIdSchema,\n\t},\n\t{ additionalProperties: false },\n);\n\nexport type Format = Static<typeof Format>;\n\nexport const Versioned = Type.Object({\n\tversion: Type.Number(),\n});\nexport type Versioned = Static<typeof Versioned>;\n"]}

package/dist/core/tree/detachedFieldIndexTypes.d.ts

@@ -0,0 +1,13 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { NestedMap } from "../../util";
+import { ForestRootId } from "./detachedFieldIndex";
+export type Major = string | number | undefined;
+export type Minor = number;
+export interface DetachedFieldSummaryData {
+    data: NestedMap<Major, Minor, ForestRootId>;
+    maxId: ForestRootId;
+}
+//# sourceMappingURL=detachedFieldIndexTypes.d.ts.map

package/dist/core/tree/detachedFieldIndexTypes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detachedFieldIndexTypes.d.ts","sourceRoot":"","sources":["../../../src/core/tree/detachedFieldIndexTypes.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AACvC,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAEpD,MAAM,MAAM,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;AAChD,MAAM,MAAM,KAAK,GAAG,MAAM,CAAC;AAE3B,MAAM,WAAW,wBAAwB;IACxC,IAAI,EAAE,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;IAC5C,KAAK,EAAE,YAAY,CAAC;CACpB"}

package/dist/core/tree/detachedFieldIndexTypes.js

@@ -0,0 +1,7 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=detachedFieldIndexTypes.js.map

package/dist/core/tree/detachedFieldIndexTypes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detachedFieldIndexTypes.js","sourceRoot":"","sources":["../../../src/core/tree/detachedFieldIndexTypes.ts"],"names":[],"mappings":";AAAA;;;GAGG","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { NestedMap } from \"../../util\";\nimport { ForestRootId } from \"./detachedFieldIndex\";\n\nexport type Major = string | number | undefined;\nexport type Minor = number;\n\nexport interface DetachedFieldSummaryData {\n\tdata: NestedMap<Major, Minor, ForestRootId>;\n\tmaxId: ForestRootId;\n}\n"]}

package/dist/core/tree/index.d.ts

@@ -0,0 +1,19 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { Anchor, AnchorLocator, AnchorSet, AnchorSlot, AnchorNode, anchorSlot, AnchorEvents, AnchorSetRootEvents, } from "./anchorSet";
+export { ITreeCursor, CursorLocationType, castCursorToSynchronous, mapCursorField, mapCursorFields, forEachNode, forEachNodeInSubtree, forEachField, iterateCursorField, ITreeCursorSynchronous, PathRootPrefix, inCursorField, inCursorNode, CursorMarker, isCursor, } from "./cursor";
+export { ProtoNodes, Root as DeltaRoot, ProtoNode as DeltaProtoNode, Mark as DeltaMark, DetachedNodeId as DeltaDetachedNodeId, FieldMap as DeltaFieldMap, DetachedNodeChanges as DeltaDetachedNodeChanges, DetachedNodeBuild as DeltaDetachedNodeBuild, DetachedNodeDestruction as DeltaDetachedNodeDestruction, DetachedNodeRename as DeltaDetachedNodeRename, FieldChanges as DeltaFieldChanges, } from "./delta";
+export { getMapTreeField, MapTree } from "./mapTree";
+export { clonePath, topDownPath, getDepth, UpPath, FieldUpPath, Range, RangeUpPath, PlaceUpPath, PlaceIndex, NodeIndex, DetachedPlaceUpPath, DetachedRangeUpPath, compareUpPaths, compareFieldUpPaths, getDetachedFieldContainingPath, UpPathDefault, } from "./pathTree";
+export { FieldMapObject, GenericFieldsNode, genericTreeDeleteIfEmpty, genericTreeKeys, GenericTreeNode, getGenericTreeField, JsonableTree, setGenericTreeField, } from "./treeTextFormat";
+export { EncodedJsonableTree } from "./persistedTreeTextFormat";
+export { EmptyKey, TreeType, ChildLocation, DetachedField, ChildCollection, RootField, Value, TreeValue, detachedFieldAsKey, keyAsDetachedField, rootFieldKey, NodeData, rootField, aboveRootPlaceholder, } from "./types";
+export { DeltaVisitor, visitDelta } from "./visitDelta";
+export { AnnouncedVisitor, announceDelta, applyDelta, combineVisitors, makeDetachedFieldIndex, } from "./visitorUtils";
+export { PathVisitor } from "./visitPath";
+export { SparseNode, getDescendant } from "./sparseTree";
+export { deltaForRootInitialization, deltaForSet, emptyFieldChanges, isEmptyFieldChanges, makeDetachedNodeId, offsetDetachId, emptyDelta, } from "./deltaUtil";
+export { DetachedFieldIndex, ForestRootId } from "./detachedFieldIndex";
+//# sourceMappingURL=index.d.ts.map

package/dist/core/tree/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/tree/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,MAAM,EACN,aAAa,EACb,SAAS,EACT,UAAU,EACV,UAAU,EACV,UAAU,EACV,YAAY,EACZ,mBAAmB,GACnB,MAAM,aAAa,CAAC;AACrB,OAAO,EACN,WAAW,EACX,kBAAkB,EAClB,uBAAuB,EACvB,cAAc,EACd,eAAe,EACf,WAAW,EACX,oBAAoB,EACpB,YAAY,EACZ,kBAAkB,EAClB,sBAAsB,EACtB,cAAc,EACd,aAAa,EACb,YAAY,EACZ,YAAY,EACZ,QAAQ,GACR,MAAM,UAAU,CAAC;AAClB,OAAO,EACN,UAAU,EACV,IAAI,IAAI,SAAS,EACjB,SAAS,IAAI,cAAc,EAC3B,IAAI,IAAI,SAAS,EACjB,cAAc,IAAI,mBAAmB,EACrC,QAAQ,IAAI,aAAa,EACzB,mBAAmB,IAAI,wBAAwB,EAC/C,iBAAiB,IAAI,sBAAsB,EAC3C,uBAAuB,IAAI,4BAA4B,EACvD,kBAAkB,IAAI,uBAAuB,EAC7C,YAAY,IAAI,iBAAiB,GACjC,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACrD,OAAO,EACN,SAAS,EACT,WAAW,EACX,QAAQ,EACR,MAAM,EACN,WAAW,EACX,KAAK,EACL,WAAW,EACX,WAAW,EACX,UAAU,EACV,SAAS,EACT,mBAAmB,EACnB,mBAAmB,EACnB,cAAc,EACd,mBAAmB,EACnB,8BAA8B,EAC9B,aAAa,GACb,MAAM,YAAY,CAAC;AACpB,OAAO,EACN,cAAc,EACd,iBAAiB,EACjB,wBAAwB,EACxB,eAAe,EACf,eAAe,EACf,mBAAmB,EACnB,YAAY,EACZ,mBAAmB,GACnB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EACN,QAAQ,EACR,QAAQ,EACR,aAAa,EACb,aAAa,EACb,eAAe,EACf,SAAS,EACT,KAAK,EACL,SAAS,EACT,kBAAkB,EAClB,kBAAkB,EAClB,YAAY,EACZ,QAAQ,EACR,SAAS,EACT,oBAAoB,GACpB,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EACN,gBAAgB,EAChB,aAAa,EACb,UAAU,EACV,eAAe,EACf,sBAAsB,GACtB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE1C,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAEzD,OAAO,EACN,0BAA0B,EAC1B,WAAW,EACX,iBAAiB,EACjB,mBAAmB,EACnB,kBAAkB,EAClB,cAAc,EACd,UAAU,GACV,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC"}

package/dist/core/tree/index.js

@@ -0,0 +1,67 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DetachedFieldIndex = exports.emptyDelta = exports.offsetDetachId = exports.makeDetachedNodeId = exports.isEmptyFieldChanges = exports.emptyFieldChanges = exports.deltaForSet = exports.deltaForRootInitialization = exports.getDescendant = exports.SparseNode = exports.makeDetachedFieldIndex = exports.combineVisitors = exports.applyDelta = exports.announceDelta = exports.visitDelta = exports.aboveRootPlaceholder = exports.rootField = exports.rootFieldKey = exports.keyAsDetachedField = exports.detachedFieldAsKey = exports.EmptyKey = exports.EncodedJsonableTree = exports.setGenericTreeField = exports.getGenericTreeField = exports.genericTreeKeys = exports.genericTreeDeleteIfEmpty = exports.getDetachedFieldContainingPath = exports.compareFieldUpPaths = exports.compareUpPaths = exports.getDepth = exports.topDownPath = exports.clonePath = exports.getMapTreeField = exports.isCursor = exports.CursorMarker = exports.inCursorNode = exports.inCursorField = exports.iterateCursorField = exports.forEachField = exports.forEachNodeInSubtree = exports.forEachNode = exports.mapCursorFields = exports.mapCursorField = exports.castCursorToSynchronous = exports.CursorLocationType = exports.anchorSlot = exports.AnchorSet = void 0;
+var anchorSet_1 = require("./anchorSet");
+Object.defineProperty(exports, "AnchorSet", { enumerable: true, get: function () { return anchorSet_1.AnchorSet; } });
+Object.defineProperty(exports, "anchorSlot", { enumerable: true, get: function () { return anchorSet_1.anchorSlot; } });
+var cursor_1 = require("./cursor");
+Object.defineProperty(exports, "CursorLocationType", { enumerable: true, get: function () { return cursor_1.CursorLocationType; } });
+Object.defineProperty(exports, "castCursorToSynchronous", { enumerable: true, get: function () { return cursor_1.castCursorToSynchronous; } });
+Object.defineProperty(exports, "mapCursorField", { enumerable: true, get: function () { return cursor_1.mapCursorField; } });
+Object.defineProperty(exports, "mapCursorFields", { enumerable: true, get: function () { return cursor_1.mapCursorFields; } });
+Object.defineProperty(exports, "forEachNode", { enumerable: true, get: function () { return cursor_1.forEachNode; } });
+Object.defineProperty(exports, "forEachNodeInSubtree", { enumerable: true, get: function () { return cursor_1.forEachNodeInSubtree; } });
+Object.defineProperty(exports, "forEachField", { enumerable: true, get: function () { return cursor_1.forEachField; } });
+Object.defineProperty(exports, "iterateCursorField", { enumerable: true, get: function () { return cursor_1.iterateCursorField; } });
+Object.defineProperty(exports, "inCursorField", { enumerable: true, get: function () { return cursor_1.inCursorField; } });
+Object.defineProperty(exports, "inCursorNode", { enumerable: true, get: function () { return cursor_1.inCursorNode; } });
+Object.defineProperty(exports, "CursorMarker", { enumerable: true, get: function () { return cursor_1.CursorMarker; } });
+Object.defineProperty(exports, "isCursor", { enumerable: true, get: function () { return cursor_1.isCursor; } });
+var mapTree_1 = require("./mapTree");
+Object.defineProperty(exports, "getMapTreeField", { enumerable: true, get: function () { return mapTree_1.getMapTreeField; } });
+var pathTree_1 = require("./pathTree");
+Object.defineProperty(exports, "clonePath", { enumerable: true, get: function () { return pathTree_1.clonePath; } });
+Object.defineProperty(exports, "topDownPath", { enumerable: true, get: function () { return pathTree_1.topDownPath; } });
+Object.defineProperty(exports, "getDepth", { enumerable: true, get: function () { return pathTree_1.getDepth; } });
+Object.defineProperty(exports, "compareUpPaths", { enumerable: true, get: function () { return pathTree_1.compareUpPaths; } });
+Object.defineProperty(exports, "compareFieldUpPaths", { enumerable: true, get: function () { return pathTree_1.compareFieldUpPaths; } });
+Object.defineProperty(exports, "getDetachedFieldContainingPath", { enumerable: true, get: function () { return pathTree_1.getDetachedFieldContainingPath; } });
+var treeTextFormat_1 = require("./treeTextFormat");
+Object.defineProperty(exports, "genericTreeDeleteIfEmpty", { enumerable: true, get: function () { return treeTextFormat_1.genericTreeDeleteIfEmpty; } });
+Object.defineProperty(exports, "genericTreeKeys", { enumerable: true, get: function () { return treeTextFormat_1.genericTreeKeys; } });
+Object.defineProperty(exports, "getGenericTreeField", { enumerable: true, get: function () { return treeTextFormat_1.getGenericTreeField; } });
+Object.defineProperty(exports, "setGenericTreeField", { enumerable: true, get: function () { return treeTextFormat_1.setGenericTreeField; } });
+var persistedTreeTextFormat_1 = require("./persistedTreeTextFormat");
+Object.defineProperty(exports, "EncodedJsonableTree", { enumerable: true, get: function () { return persistedTreeTextFormat_1.EncodedJsonableTree; } });
+var types_1 = require("./types");
+Object.defineProperty(exports, "EmptyKey", { enumerable: true, get: function () { return types_1.EmptyKey; } });
+Object.defineProperty(exports, "detachedFieldAsKey", { enumerable: true, get: function () { return types_1.detachedFieldAsKey; } });
+Object.defineProperty(exports, "keyAsDetachedField", { enumerable: true, get: function () { return types_1.keyAsDetachedField; } });
+Object.defineProperty(exports, "rootFieldKey", { enumerable: true, get: function () { return types_1.rootFieldKey; } });
+Object.defineProperty(exports, "rootField", { enumerable: true, get: function () { return types_1.rootField; } });
+Object.defineProperty(exports, "aboveRootPlaceholder", { enumerable: true, get: function () { return types_1.aboveRootPlaceholder; } });
+var visitDelta_1 = require("./visitDelta");
+Object.defineProperty(exports, "visitDelta", { enumerable: true, get: function () { return visitDelta_1.visitDelta; } });
+var visitorUtils_1 = require("./visitorUtils");
+Object.defineProperty(exports, "announceDelta", { enumerable: true, get: function () { return visitorUtils_1.announceDelta; } });
+Object.defineProperty(exports, "applyDelta", { enumerable: true, get: function () { return visitorUtils_1.applyDelta; } });
+Object.defineProperty(exports, "combineVisitors", { enumerable: true, get: function () { return visitorUtils_1.combineVisitors; } });
+Object.defineProperty(exports, "makeDetachedFieldIndex", { enumerable: true, get: function () { return visitorUtils_1.makeDetachedFieldIndex; } });
+var sparseTree_1 = require("./sparseTree");
+Object.defineProperty(exports, "SparseNode", { enumerable: true, get: function () { return sparseTree_1.SparseNode; } });
+Object.defineProperty(exports, "getDescendant", { enumerable: true, get: function () { return sparseTree_1.getDescendant; } });
+var deltaUtil_1 = require("./deltaUtil");
+Object.defineProperty(exports, "deltaForRootInitialization", { enumerable: true, get: function () { return deltaUtil_1.deltaForRootInitialization; } });
+Object.defineProperty(exports, "deltaForSet", { enumerable: true, get: function () { return deltaUtil_1.deltaForSet; } });
+Object.defineProperty(exports, "emptyFieldChanges", { enumerable: true, get: function () { return deltaUtil_1.emptyFieldChanges; } });
+Object.defineProperty(exports, "isEmptyFieldChanges", { enumerable: true, get: function () { return deltaUtil_1.isEmptyFieldChanges; } });
+Object.defineProperty(exports, "makeDetachedNodeId", { enumerable: true, get: function () { return deltaUtil_1.makeDetachedNodeId; } });
+Object.defineProperty(exports, "offsetDetachId", { enumerable: true, get: function () { return deltaUtil_1.offsetDetachId; } });
+Object.defineProperty(exports, "emptyDelta", { enumerable: true, get: function () { return deltaUtil_1.emptyDelta; } });
+var detachedFieldIndex_1 = require("./detachedFieldIndex");
+Object.defineProperty(exports, "DetachedFieldIndex", { enumerable: true, get: function () { return detachedFieldIndex_1.DetachedFieldIndex; } });
+//# sourceMappingURL=index.js.map

package/dist/core/tree/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/tree/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,yCASqB;AANpB,sGAAA,SAAS,OAAA;AAGT,uGAAA,UAAU,OAAA;AAIX,mCAgBkB;AAdjB,4GAAA,kBAAkB,OAAA;AAClB,iHAAA,uBAAuB,OAAA;AACvB,wGAAA,cAAc,OAAA;AACd,yGAAA,eAAe,OAAA;AACf,qGAAA,WAAW,OAAA;AACX,8GAAA,oBAAoB,OAAA;AACpB,sGAAA,YAAY,OAAA;AACZ,4GAAA,kBAAkB,OAAA;AAGlB,uGAAA,aAAa,OAAA;AACb,sGAAA,YAAY,OAAA;AACZ,sGAAA,YAAY,OAAA;AACZ,kGAAA,QAAQ,OAAA;AAeT,qCAAqD;AAA5C,0GAAA,eAAe,OAAA;AACxB,uCAiBoB;AAhBnB,qGAAA,SAAS,OAAA;AACT,uGAAA,WAAW,OAAA;AACX,oGAAA,QAAQ,OAAA;AAUR,0GAAA,cAAc,OAAA;AACd,+GAAA,mBAAmB,OAAA;AACnB,0HAAA,8BAA8B,OAAA;AAG/B,mDAS0B;AANzB,0HAAA,wBAAwB,OAAA;AACxB,iHAAA,eAAe,OAAA;AAEf,qHAAA,mBAAmB,OAAA;AAEnB,qHAAA,mBAAmB,OAAA;AAEpB,qEAAgE;AAAvD,8HAAA,mBAAmB,OAAA;AAC5B,iCAeiB;AAdhB,iGAAA,QAAQ,OAAA;AAQR,2GAAA,kBAAkB,OAAA;AAClB,2GAAA,kBAAkB,OAAA;AAClB,qGAAA,YAAY,OAAA;AAEZ,kGAAA,SAAS,OAAA;AACT,6GAAA,oBAAoB,OAAA;AAErB,2CAAwD;AAAjC,wGAAA,UAAU,OAAA;AACjC,+CAMwB;AAJvB,6GAAA,aAAa,OAAA;AACb,0GAAA,UAAU,OAAA;AACV,+GAAA,eAAe,OAAA;AACf,sHAAA,sBAAsB,OAAA;AAIvB,2CAAyD;AAAhD,wGAAA,UAAU,OAAA;AAAE,2GAAA,aAAa,OAAA;AAElC,yCAQqB;AAPpB,uHAAA,0BAA0B,OAAA;AAC1B,wGAAA,WAAW,OAAA;AACX,8GAAA,iBAAiB,OAAA;AACjB,gHAAA,mBAAmB,OAAA;AACnB,+GAAA,kBAAkB,OAAA;AAClB,2GAAA,cAAc,OAAA;AACd,uGAAA,UAAU,OAAA;AAGX,2DAAwE;AAA/D,wHAAA,kBAAkB,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\tAnchor,\n\tAnchorLocator,\n\tAnchorSet,\n\tAnchorSlot,\n\tAnchorNode,\n\tanchorSlot,\n\tAnchorEvents,\n\tAnchorSetRootEvents,\n} from \"./anchorSet\";\nexport {\n\tITreeCursor,\n\tCursorLocationType,\n\tcastCursorToSynchronous,\n\tmapCursorField,\n\tmapCursorFields,\n\tforEachNode,\n\tforEachNodeInSubtree,\n\tforEachField,\n\titerateCursorField,\n\tITreeCursorSynchronous,\n\tPathRootPrefix,\n\tinCursorField,\n\tinCursorNode,\n\tCursorMarker,\n\tisCursor,\n} from \"./cursor\";\nexport {\n\tProtoNodes,\n\tRoot as DeltaRoot,\n\tProtoNode as DeltaProtoNode,\n\tMark as DeltaMark,\n\tDetachedNodeId as DeltaDetachedNodeId,\n\tFieldMap as DeltaFieldMap,\n\tDetachedNodeChanges as DeltaDetachedNodeChanges,\n\tDetachedNodeBuild as DeltaDetachedNodeBuild,\n\tDetachedNodeDestruction as DeltaDetachedNodeDestruction,\n\tDetachedNodeRename as DeltaDetachedNodeRename,\n\tFieldChanges as DeltaFieldChanges,\n} from \"./delta\";\nexport { getMapTreeField, MapTree } from \"./mapTree\";\nexport {\n\tclonePath,\n\ttopDownPath,\n\tgetDepth,\n\tUpPath,\n\tFieldUpPath,\n\tRange,\n\tRangeUpPath,\n\tPlaceUpPath,\n\tPlaceIndex,\n\tNodeIndex,\n\tDetachedPlaceUpPath,\n\tDetachedRangeUpPath,\n\tcompareUpPaths,\n\tcompareFieldUpPaths,\n\tgetDetachedFieldContainingPath,\n\tUpPathDefault,\n} from \"./pathTree\";\nexport {\n\tFieldMapObject,\n\tGenericFieldsNode,\n\tgenericTreeDeleteIfEmpty,\n\tgenericTreeKeys,\n\tGenericTreeNode,\n\tgetGenericTreeField,\n\tJsonableTree,\n\tsetGenericTreeField,\n} from \"./treeTextFormat\";\nexport { EncodedJsonableTree } from \"./persistedTreeTextFormat\";\nexport {\n\tEmptyKey,\n\tTreeType,\n\tChildLocation,\n\tDetachedField,\n\tChildCollection,\n\tRootField,\n\tValue,\n\tTreeValue,\n\tdetachedFieldAsKey,\n\tkeyAsDetachedField,\n\trootFieldKey,\n\tNodeData,\n\trootField,\n\taboveRootPlaceholder,\n} from \"./types\";\nexport { DeltaVisitor, visitDelta } from \"./visitDelta\";\nexport {\n\tAnnouncedVisitor,\n\tannounceDelta,\n\tapplyDelta,\n\tcombineVisitors,\n\tmakeDetachedFieldIndex,\n} from \"./visitorUtils\";\nexport { PathVisitor } from \"./visitPath\";\n\nexport { SparseNode, getDescendant } from \"./sparseTree\";\n\nexport {\n\tdeltaForRootInitialization,\n\tdeltaForSet,\n\temptyFieldChanges,\n\tisEmptyFieldChanges,\n\tmakeDetachedNodeId,\n\toffsetDetachId,\n\temptyDelta,\n} from \"./deltaUtil\";\n\nexport { DetachedFieldIndex, ForestRootId } from \"./detachedFieldIndex\";\n"]}

package/dist/core/tree/mapTree.d.ts

@@ -0,0 +1,22 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { FieldKey } from "../schema-stored";
+import { NodeData } from "./types";
+/**
+ * This modules provides a simple in memory tree format.
+ */
+/**
+ * Simple in memory tree representation based on Maps.
+ * MapTrees should not store empty fields.
+ * @internal
+ */
+export interface MapTree extends NodeData {
+    fields: Map<FieldKey, MapTree[]>;
+}
+/**
+ * Get a field from `node`, optionally modifying the tree to create it if missing.
+ */
+export declare function getMapTreeField(node: MapTree, key: FieldKey, createIfMissing: boolean): MapTree[];
+//# sourceMappingURL=mapTree.d.ts.map

package/dist/core/tree/mapTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mapTree.d.ts","sourceRoot":"","sources":["../../../src/core/tree/mapTree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEnC;;GAEG;AAEH;;;;GAIG;AACH,MAAM,WAAW,OAAQ,SAAQ,QAAQ;IACxC,MAAM,EAAE,GAAG,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;CACjC;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,eAAe,EAAE,OAAO,GAAG,OAAO,EAAE,CAYjG"}

package/dist/core/tree/mapTree.js

@@ -0,0 +1,25 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getMapTreeField = void 0;
+/**
+ * Get a field from `node`, optionally modifying the tree to create it if missing.
+ */
+function getMapTreeField(node, key, createIfMissing) {
+    const field = node.fields.get(key);
+    if (field !== undefined) {
+        return field;
+    }
+    // Handle missing field:
+    if (createIfMissing === false) {
+        return [];
+    }
+    const newField = [];
+    node.fields.set(key, newField);
+    return newField;
+}
+exports.getMapTreeField = getMapTreeField;
+//# sourceMappingURL=mapTree.js.map

package/dist/core/tree/mapTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mapTree.js","sourceRoot":"","sources":["../../../src/core/tree/mapTree.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAkBH;;GAEG;AACH,SAAgB,eAAe,CAAC,IAAa,EAAE,GAAa,EAAE,eAAwB;IACrF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,KAAK,KAAK,SAAS,EAAE;QACxB,OAAO,KAAK,CAAC;KACb;IACD,wBAAwB;IACxB,IAAI,eAAe,KAAK,KAAK,EAAE;QAC9B,OAAO,EAAE,CAAC;KACV;IACD,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC/B,OAAO,QAAQ,CAAC;AACjB,CAAC;AAZD,0CAYC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { FieldKey } from \"../schema-stored\";\nimport { NodeData } from \"./types\";\n\n/**\n * This modules provides a simple in memory tree format.\n */\n\n/**\n * Simple in memory tree representation based on Maps.\n * MapTrees should not store empty fields.\n * @internal\n */\nexport interface MapTree extends NodeData {\n\tfields: Map<FieldKey, MapTree[]>;\n}\n\n/**\n * Get a field from `node`, optionally modifying the tree to create it if missing.\n */\nexport function getMapTreeField(node: MapTree, key: FieldKey, createIfMissing: boolean): MapTree[] {\n\tconst field = node.fields.get(key);\n\tif (field !== undefined) {\n\t\treturn field;\n\t}\n\t// Handle missing field:\n\tif (createIfMissing === false) {\n\t\treturn [];\n\t}\n\tconst newField: MapTree[] = [];\n\tnode.fields.set(key, newField);\n\treturn newField;\n}\n"]}