@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/lib/feature-libraries/forest-summary/forestSummarizer.js

@@ -0,0 +1,108 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { bufferToString } from "@fluid-internal/client-utils";
+import { createSingleBlobSummary } from "@fluidframework/shared-object-base";
+import { assert } from "@fluidframework/core-utils";
+import { applyDelta, forEachField, makeDetachedFieldIndex, mapCursorField, } from "../../core";
+import { idAllocatorFromMaxId } from "../../util";
+import { noopValidator } from "../../codec";
+// eslint-disable-next-line import/no-internal-modules
+import { chunkField, defaultChunkPolicy } from "../chunked-forest/chunkTree";
+import { makeForestSummarizerCodec } from "./codec";
+/**
+ * The storage key for the blob in the summary containing tree data
+ */
+const treeBlobKey = "ForestTree";
+/**
+ * Provides methods for summarizing and loading a forest.
+ */
+export class ForestSummarizer {
+    get codec() {
+        this.lazyCodec ?? (this.lazyCodec = makeForestSummarizerCodec(this.options, this.fieldBatchCodec)({
+            schema: { schema: this.schema, policy: this.policy },
+            encodeType: this.encodeType,
+        }));
+        return this.lazyCodec;
+    }
+    constructor(forest, schema, policy, encodeType, fieldBatchCodec, options = { jsonValidator: noopValidator }) {
+        this.forest = forest;
+        this.schema = schema;
+        this.policy = policy;
+        this.encodeType = encodeType;
+        this.fieldBatchCodec = fieldBatchCodec;
+        this.options = options;
+        this.key = "Forest";
+        this.schema.on("beforeSchemaChange", () => {
+            this.lazyCodec = undefined;
+        });
+    }
+    /**
+     * Synchronous monolithic summarization of tree content.
+     *
+     * TODO: when perf matters, this should be replaced with a chunked async version using a binary format.
+     *
+     * @returns a snapshot of the forest's tree as a string.
+     */
+    getTreeString(stringify) {
+        const rootCursor = this.forest.getCursorAboveDetachedFields();
+        const fieldMap = new Map();
+        // TODO: Encode all detached fields in one operation for better performance and compression
+        forEachField(rootCursor, (cursor) => {
+            const key = cursor.getFieldKey();
+            const innerCursor = this.forest.allocateCursor();
+            assert(this.forest.tryMoveCursorToField({ fieldKey: key, parent: undefined }, innerCursor) === 1 /* TreeNavigationResult.Ok */, "failed to navigate to field");
+            fieldMap.set(key, innerCursor);
+        });
+        const encoded = this.codec.encode(fieldMap);
+        fieldMap.forEach((value) => value.free());
+        return stringify(encoded);
+    }
+    getAttachSummary(stringify, fullTree, trackState, telemetryContext) {
+        return createSingleBlobSummary(treeBlobKey, this.getTreeString(stringify));
+    }
+    async summarize(stringify, fullTree, trackState, telemetryContext) {
+        return createSingleBlobSummary(treeBlobKey, this.getTreeString(stringify));
+    }
+    getGCData(fullGC) {
+        // TODO: Properly implement garbage collection. Right now, garbage collection is performed automatically
+        // by the code in SharedObject (from which SharedTreeCore extends). The `runtime.uploadBlob` API delegates
+        // to the `BlobManager`, which automatically populates the summary with ISummaryAttachment entries for each
+        // blob.
+        return {
+            gcNodes: {},
+        };
+    }
+    async load(services, parse) {
+        if (await services.contains(treeBlobKey)) {
+            const treeBuffer = await services.readBlob(treeBlobKey);
+            const treeBufferString = bufferToString(treeBuffer, "utf8");
+            // TODO: this code is parsing data without an optional validator, this should be defined in a typebox schema as part of the
+            // forest summary format.
+            const fields = this.codec.decode(parse(treeBufferString));
+            const allocator = idAllocatorFromMaxId();
+            const fieldChanges = [];
+            for (const [fieldKey, field] of fields) {
+                const chunked = chunkField(field, defaultChunkPolicy);
+                const nodeCursors = chunked.flatMap((chunk) => mapCursorField(chunk.cursor(), (cursor) => cursor.fork()));
+                const buildId = { minor: allocator.allocate(nodeCursors.length) };
+                fieldChanges.push([
+                    fieldKey,
+                    {
+                        build: [
+                            {
+                                id: buildId,
+                                trees: nodeCursors,
+                            },
+                        ],
+                        local: [{ count: nodeCursors.length, attach: buildId }],
+                    },
+                ]);
+            }
+            assert(this.forest.isEmpty, 0x797 /* forest must be empty */);
+            applyDelta({ fields: new Map(fieldChanges) }, this.forest, makeDetachedFieldIndex("init"));
+        }
+    }
+}
+//# sourceMappingURL=forestSummarizer.js.map

package/lib/feature-libraries/forest-summary/forestSummarizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"forestSummarizer.js","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/forestSummarizer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAO9D,OAAO,EAAE,uBAAuB,EAAE,MAAM,oCAAoC,CAAC;AAC7E,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AACpD,OAAO,EACN,UAAU,EAGV,YAAY,EAIZ,sBAAsB,EACtB,cAAc,GAGd,MAAM,YAAY,CAAC;AAMpB,OAAO,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAClD,OAAO,EAAiB,aAAa,EAAE,MAAM,aAAa,CAAC;AAI3D,sDAAsD;AACtD,OAAO,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAE7E,OAAO,EAAe,yBAAyB,EAAE,MAAM,SAAS,CAAC;AACjE;;GAEG;AACH,MAAM,WAAW,GAAG,YAAY,CAAC;AAEjC;;GAEG;AACH,MAAM,OAAO,gBAAgB;IAI5B,IAAY,KAAK;QAChB,IAAI,CAAC,SAAS,KAAd,IAAI,CAAC,SAAS,GAAK,yBAAyB,CAC3C,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,eAAe,CACpB,CAAC;YACD,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE;YACpD,UAAU,EAAE,IAAI,CAAC,UAAU;SAC3B,CAAC,EAAC;QACH,OAAO,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;IAED,YACkB,MAAuB,EACvB,MAAoC,EACpC,MAAwB,EACxB,UAAmC,EACnC,eAAgC,EAChC,UAAyB,EAAE,aAAa,EAAE,aAAa,EAAE;QALzD,WAAM,GAAN,MAAM,CAAiB;QACvB,WAAM,GAAN,MAAM,CAA8B;QACpC,WAAM,GAAN,MAAM,CAAkB;QACxB,eAAU,GAAV,UAAU,CAAyB;QACnC,oBAAe,GAAf,eAAe,CAAiB;QAChC,YAAO,GAAP,OAAO,CAAkD;QApB3D,QAAG,GAAG,QAAQ,CAAC;QAsB9B,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YACzC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC5B,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACK,aAAa,CAAC,SAAoC;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,4BAA4B,EAAE,CAAC;QAC9D,MAAM,QAAQ,GAAoE,IAAI,GAAG,EAAE,CAAC;QAC5F,2FAA2F;QAC3F,YAAY,CAAC,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE;YACnC,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACjC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;YACjD,MAAM,CACL,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAC/B,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,EACpC,WAAW,CACX,oCAA4B,EAC7B,6BAA6B,CAC7B,CAAC;YACF,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,WAA+D,CAAC,CAAC;QACpF,CAAC,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAE5C,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC1C,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAEM,gBAAgB,CACtB,SAAoC,EACpC,QAAkB,EAClB,UAAoB,EACpB,gBAAoC;QAEpC,OAAO,uBAAuB,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5E,CAAC;IAEM,KAAK,CAAC,SAAS,CACrB,SAAoC,EACpC,QAAkB,EAClB,UAAoB,EACpB,gBAAoC;QAEpC,OAAO,uBAAuB,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5E,CAAC;IAEM,SAAS,CAAC,MAAgB;QAChC,wGAAwG;QACxG,0GAA0G;QAC1G,2GAA2G;QAC3G,QAAQ;QACR,OAAO;YACN,OAAO,EAAE,EAAE;SACX,CAAC;IACH,CAAC;IAEM,KAAK,CAAC,IAAI,CAChB,QAAgC,EAChC,KAA2B;QAE3B,IAAI,MAAM,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE;YACzC,MAAM,UAAU,GAAG,MAAM,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YACxD,MAAM,gBAAgB,GAAG,cAAc,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YAC5D,2HAA2H;YAC3H,yBAAyB;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAW,CAAC,CAAC;YACpE,MAAM,SAAS,GAAG,oBAAoB,EAAE,CAAC;YACzC,MAAM,YAAY,GAAoC,EAAE,CAAC;YACzD,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE;gBACvC,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;gBACtD,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAC7C,cAAc,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CACzD,CAAC;gBACF,MAAM,OAAO,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;gBAElE,YAAY,CAAC,IAAI,CAAC;oBACjB,QAAQ;oBACR;wBACC,KAAK,EAAE;4BACN;gCACC,EAAE,EAAE,OAAO;gCACX,KAAK,EAAE,WAAW;6BAClB;yBACD;wBACD,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;qBACvD;iBACD,CAAC,CAAC;aACH;YAED,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;YAC9D,UAAU,CACT,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,YAAY,CAAC,EAAE,EACjC,IAAI,CAAC,MAAM,EACX,sBAAsB,CAAC,MAAM,CAAC,CAC9B,CAAC;SACF;IACF,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { bufferToString } from \"@fluid-internal/client-utils\";\nimport { IChannelStorageService } from \"@fluidframework/datastore-definitions\";\nimport {\n\tITelemetryContext,\n\tISummaryTreeWithStats,\n\tIGarbageCollectionData,\n} from \"@fluidframework/runtime-definitions\";\nimport { createSingleBlobSummary } from \"@fluidframework/shared-object-base\";\nimport { assert } from \"@fluidframework/core-utils\";\nimport {\n\tapplyDelta,\n\tDeltaFieldChanges,\n\tFieldKey,\n\tforEachField,\n\tIEditableForest,\n\tITreeCursorSynchronous,\n\tITreeSubscriptionCursor,\n\tmakeDetachedFieldIndex,\n\tmapCursorField,\n\tTreeNavigationResult,\n\tTreeStoredSchemaSubscription,\n} from \"../../core\";\nimport {\n\tSummarizable,\n\tSummaryElementParser,\n\tSummaryElementStringifier,\n} from \"../../shared-tree-core\";\nimport { idAllocatorFromMaxId } from \"../../util\";\nimport { ICodecOptions, noopValidator } from \"../../codec\";\nimport { FieldBatchCodec } from \"../chunked-forest\";\nimport { FullSchemaPolicy } from \"../modular-schema\";\nimport { TreeCompressionStrategy } from \"../treeCompressionUtils\";\n// eslint-disable-next-line import/no-internal-modules\nimport { chunkField, defaultChunkPolicy } from \"../chunked-forest/chunkTree\";\nimport { Format } from \"./format\";\nimport { ForestCodec, makeForestSummarizerCodec } from \"./codec\";\n/**\n * The storage key for the blob in the summary containing tree data\n */\nconst treeBlobKey = \"ForestTree\";\n\n/**\n * Provides methods for summarizing and loading a forest.\n */\nexport class ForestSummarizer implements Summarizable {\n\tpublic readonly key = \"Forest\";\n\n\tprivate lazyCodec?: ReturnType<ForestCodec>;\n\tprivate get codec(): ReturnType<ForestCodec> {\n\t\tthis.lazyCodec ??= makeForestSummarizerCodec(\n\t\t\tthis.options,\n\t\t\tthis.fieldBatchCodec,\n\t\t)({\n\t\t\tschema: { schema: this.schema, policy: this.policy },\n\t\t\tencodeType: this.encodeType,\n\t\t});\n\t\treturn this.lazyCodec;\n\t}\n\n\tpublic constructor(\n\t\tprivate readonly forest: IEditableForest,\n\t\tprivate readonly schema: TreeStoredSchemaSubscription,\n\t\tprivate readonly policy: FullSchemaPolicy,\n\t\tprivate readonly encodeType: TreeCompressionStrategy,\n\t\tprivate readonly fieldBatchCodec: FieldBatchCodec,\n\t\tprivate readonly options: ICodecOptions = { jsonValidator: noopValidator },\n\t) {\n\t\tthis.schema.on(\"beforeSchemaChange\", () => {\n\t\t\tthis.lazyCodec = undefined;\n\t\t});\n\t}\n\n\t/**\n\t * Synchronous monolithic summarization of tree content.\n\t *\n\t * TODO: when perf matters, this should be replaced with a chunked async version using a binary format.\n\t *\n\t * @returns a snapshot of the forest's tree as a string.\n\t */\n\tprivate getTreeString(stringify: SummaryElementStringifier): string {\n\t\tconst rootCursor = this.forest.getCursorAboveDetachedFields();\n\t\tconst fieldMap: Map<FieldKey, ITreeCursorSynchronous & ITreeSubscriptionCursor> = new Map();\n\t\t// TODO: Encode all detached fields in one operation for better performance and compression\n\t\tforEachField(rootCursor, (cursor) => {\n\t\t\tconst key = cursor.getFieldKey();\n\t\t\tconst innerCursor = this.forest.allocateCursor();\n\t\t\tassert(\n\t\t\t\tthis.forest.tryMoveCursorToField(\n\t\t\t\t\t{ fieldKey: key, parent: undefined },\n\t\t\t\t\tinnerCursor,\n\t\t\t\t) === TreeNavigationResult.Ok,\n\t\t\t\t\"failed to navigate to field\",\n\t\t\t);\n\t\t\tfieldMap.set(key, innerCursor as ITreeCursorSynchronous & ITreeSubscriptionCursor);\n\t\t});\n\t\tconst encoded = this.codec.encode(fieldMap);\n\n\t\tfieldMap.forEach((value) => value.free());\n\t\treturn stringify(encoded);\n\t}\n\n\tpublic getAttachSummary(\n\t\tstringify: SummaryElementStringifier,\n\t\tfullTree?: boolean,\n\t\ttrackState?: boolean,\n\t\ttelemetryContext?: ITelemetryContext,\n\t): ISummaryTreeWithStats {\n\t\treturn createSingleBlobSummary(treeBlobKey, this.getTreeString(stringify));\n\t}\n\n\tpublic async summarize(\n\t\tstringify: SummaryElementStringifier,\n\t\tfullTree?: boolean,\n\t\ttrackState?: boolean,\n\t\ttelemetryContext?: ITelemetryContext,\n\t): Promise<ISummaryTreeWithStats> {\n\t\treturn createSingleBlobSummary(treeBlobKey, this.getTreeString(stringify));\n\t}\n\n\tpublic getGCData(fullGC?: boolean): IGarbageCollectionData {\n\t\t// TODO: Properly implement garbage collection. Right now, garbage collection is performed automatically\n\t\t// by the code in SharedObject (from which SharedTreeCore extends). The `runtime.uploadBlob` API delegates\n\t\t// to the `BlobManager`, which automatically populates the summary with ISummaryAttachment entries for each\n\t\t// blob.\n\t\treturn {\n\t\t\tgcNodes: {},\n\t\t};\n\t}\n\n\tpublic async load(\n\t\tservices: IChannelStorageService,\n\t\tparse: SummaryElementParser,\n\t): Promise<void> {\n\t\tif (await services.contains(treeBlobKey)) {\n\t\t\tconst treeBuffer = await services.readBlob(treeBlobKey);\n\t\t\tconst treeBufferString = bufferToString(treeBuffer, \"utf8\");\n\t\t\t// TODO: this code is parsing data without an optional validator, this should be defined in a typebox schema as part of the\n\t\t\t// forest summary format.\n\t\t\tconst fields = this.codec.decode(parse(treeBufferString) as Format);\n\t\t\tconst allocator = idAllocatorFromMaxId();\n\t\t\tconst fieldChanges: [FieldKey, DeltaFieldChanges][] = [];\n\t\t\tfor (const [fieldKey, field] of fields) {\n\t\t\t\tconst chunked = chunkField(field, defaultChunkPolicy);\n\t\t\t\tconst nodeCursors = chunked.flatMap((chunk) =>\n\t\t\t\t\tmapCursorField(chunk.cursor(), (cursor) => cursor.fork()),\n\t\t\t\t);\n\t\t\t\tconst buildId = { minor: allocator.allocate(nodeCursors.length) };\n\n\t\t\t\tfieldChanges.push([\n\t\t\t\t\tfieldKey,\n\t\t\t\t\t{\n\t\t\t\t\t\tbuild: [\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tid: buildId,\n\t\t\t\t\t\t\t\ttrees: nodeCursors,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t\tlocal: [{ count: nodeCursors.length, attach: buildId }],\n\t\t\t\t\t},\n\t\t\t\t]);\n\t\t\t}\n\n\t\t\tassert(this.forest.isEmpty, 0x797 /* forest must be empty */);\n\t\t\tapplyDelta(\n\t\t\t\t{ fields: new Map(fieldChanges) },\n\t\t\t\tthis.forest,\n\t\t\t\tmakeDetachedFieldIndex(\"init\"),\n\t\t\t);\n\t\t}\n\t}\n}\n"]}

package/lib/feature-libraries/forest-summary/format.d.ts

@@ -0,0 +1,16 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Static } from "@sinclair/typebox";
+import { schemaFormat } from "../../core";
+export declare const version = 1;
+export declare const Format: import("@sinclair/typebox").TObject<{
+    version: import("@sinclair/typebox").TLiteral<1>;
+    keys: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TUnsafe<schemaFormat.FieldKey>>;
+    fields: import("@sinclair/typebox").TObject<{
+        version: import("@sinclair/typebox").TNumber;
+    }>;
+}>;
+export type Format = Static<typeof Format>;
+//# sourceMappingURL=format.d.ts.map

package/lib/feature-libraries/forest-summary/format.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/format.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAQ,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAG1C,eAAO,MAAM,OAAO,IAAM,CAAC;AAE3B,eAAO,MAAM,MAAM;;;;;;EAOlB,CAAC;AAEF,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,MAAM,CAAC,CAAC"}

package/lib/feature-libraries/forest-summary/format.js

@@ -0,0 +1,14 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Type } from "@sinclair/typebox";
+import { schemaFormat } from "../../core";
+import { Versioned } from "../versioned";
+export const version = 1.0;
+export const Format = Type.Object({
+    version: Type.Literal(version),
+    keys: Type.Array(schemaFormat.FieldKeySchema),
+    fields: Versioned,
+}, { additionalProperties: false });
+//# sourceMappingURL=format.js.map

package/lib/feature-libraries/forest-summary/format.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.js","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/format.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAU,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAEzC,MAAM,CAAC,MAAM,OAAO,GAAG,GAAG,CAAC;AAE3B,MAAM,CAAC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAChC;IACC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;IAC9B,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,cAAc,CAAC;IAC7C,MAAM,EAAE,SAAS;CACjB,EACD,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAC/B,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 { schemaFormat } from \"../../core\";\nimport { Versioned } from \"../versioned\";\n\nexport const version = 1.0;\n\nexport const Format = Type.Object(\n\t{\n\t\tversion: Type.Literal(version),\n\t\tkeys: Type.Array(schemaFormat.FieldKeySchema),\n\t\tfields: Versioned,\n\t},\n\t{ additionalProperties: false },\n);\n\nexport type Format = Static<typeof Format>;\n"]}

package/lib/feature-libraries/forest-summary/index.d.ts

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { ForestSummarizer } from "./forestSummarizer";
+//# sourceMappingURL=index.d.ts.map

package/lib/feature-libraries/forest-summary/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC"}

package/lib/feature-libraries/forest-summary/index.js

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { ForestSummarizer } from "./forestSummarizer";
+//# sourceMappingURL=index.js.map

package/lib/feature-libraries/forest-summary/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport { ForestSummarizer } from \"./forestSummarizer\";\n"]}

package/lib/feature-libraries/incrementalSummarizationUtils.d.ts

@@ -0,0 +1,20 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * Manages the collaboration window for incremental summarization.
+ */
+export interface CollabWindow {
+    /**
+     * Function which returns the most recent sequenceNumber on a message processed by `SharedTree`.
+     * Updated before processing an op, such that reading `currentSeq` while processing an op
+     * gives the sequenceNumber of the op currently being processed.
+     * `undefined` if no message has been processed, e.g. for a detached document or document loaded
+     * from summary without any subsequent ops.
+     * @remarks - Most rebasing is built atop a revision system decoupled from message sequence number.
+     * However, this is sometimes necessary to interop with Fluid runtime APIs, e.g. for incremental summarization.
+     */
+    getCurrentSeq: () => number | undefined;
+}
+//# sourceMappingURL=incrementalSummarizationUtils.d.ts.map

package/lib/feature-libraries/incrementalSummarizationUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"incrementalSummarizationUtils.d.ts","sourceRoot":"","sources":["../../src/feature-libraries/incrementalSummarizationUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AACH,MAAM,WAAW,YAAY;IAC5B;;;;;;;;OAQG;IACH,aAAa,EAAE,MAAM,MAAM,GAAG,SAAS,CAAC;CACxC"}

package/lib/feature-libraries/incrementalSummarizationUtils.js

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export {};
+//# sourceMappingURL=incrementalSummarizationUtils.js.map

package/lib/feature-libraries/incrementalSummarizationUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"incrementalSummarizationUtils.js","sourceRoot":"","sources":["../../src/feature-libraries/incrementalSummarizationUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * Manages the collaboration window for incremental summarization.\n */\nexport interface CollabWindow {\n\t/**\n\t * Function which returns the most recent sequenceNumber on a message processed by `SharedTree`.\n\t * Updated before processing an op, such that reading `currentSeq` while processing an op\n\t * gives the sequenceNumber of the op currently being processed.\n\t * `undefined` if no message has been processed, e.g. for a detached document or document loaded\n\t * from summary without any subsequent ops.\n\t * @remarks - Most rebasing is built atop a revision system decoupled from message sequence number.\n\t * However, this is sometimes necessary to interop with Fluid runtime APIs, e.g. for incremental summarization.\n\t */\n\tgetCurrentSeq: () => number | undefined;\n}\n"]}

package/lib/feature-libraries/index.d.ts

@@ -0,0 +1,35 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { createDataBinderBuffering, createDataBinderDirect, createDataBinderInvalidating, createBinderOptions, createFlushableBinderOptions, DataBinder, BinderOptions, Flushable, FlushableBinderOptions, FlushableDataBinder, MatchPolicy, SubtreePolicy, BindSyntaxTree, indexSymbol, BindPolicy, BindTree, BindTreeDefault, DownPath, BindPath, PathStep, BindingType, BindingContextType, BindingContext, VisitorBindingContext, DeleteBindingContext, InsertBindingContext, BatchBindingContext, InvalidationBindingContext, OperationBinderEvents, InvalidationBinderEvents, CompareFunction, BinderEventsCompare, AnchorsCompare, toDownPath, comparePipeline, compileSyntaxTree, } from "./editableTreeBinder";
+export { typeNameSymbol, valueSymbol, isTreeValue, ContextuallyTypedNodeDataObject, ContextuallyTypedNodeData, MarkedArrayLike, isContextuallyTypedNodeDataObject, getFieldKind, ArrayLikeMut, cursorFromContextualData, cursorsFromContextualData, ContextuallyTypedFieldData, cursorForTypedData, cursorForTypedTreeData, cursorsForTypedFieldData, normalizeNewFieldContent, NewFieldContent, getPossibleTypes, getAllowedTypes, } from "./contextuallyTyped";
+export { allowsValue, assertAllowedValue, isFluidHandle } from "./valueUtilities";
+export { FieldGenerator, TreeDataContext } from "./fieldGenerator";
+export { ForestSummarizer } from "./forest-summary";
+export { cursorForMapTreeField, cursorForMapTreeNode, mapTreeFromCursor } from "./mapTreeCursor";
+export { MemoizedIdRangeAllocator, IdRange } from "./memoizedIdRangeAllocator";
+export { buildForest } from "./object-forest";
+export { SchemaSummarizer, encodeTreeSchema, makeSchemaCodec } from "./schema-index/";
+export { stackTreeNodeCursor, CursorAdapter, prefixPath, prefixFieldPath, CursorWithNode, stackTreeFieldCursor, } from "./treeCursorUtils";
+export { cursorForJsonableTreeNode, cursorForJsonableTreeField, jsonableTreeFromCursor, jsonableTreeFromFieldCursor, jsonableTreeFromForest, } from "./treeTextCursor";
+import * as SequenceField from "./sequence-field";
+export { SequenceField };
+export { isNeverField, ModularEditBuilder, FieldEditDescription as EditDescription, FieldChangeHandler, FieldChangeRebaser, FieldEditor, NodeChangeset, FieldChangeMap, FieldChange, FieldChangeset, ToDelta, ModularChangeset, NodeChangeComposer, NodeChangeInverter, NodeChangeRebaser, CrossFieldManager, CrossFieldTarget, FieldKind, FullSchemaPolicy, allowsRepoSuperset, GenericChangeset, genericFieldKind, HasFieldChanges, NodeExistsConstraint, NodeExistenceState, FieldKindWithEditor, ModularChangeFamily, makeV0Codec, RelevantRemovedRootsFromChild, EncodedModularChangeset, } from "./modular-schema";
+export { Multiplicity } from "./multiplicity";
+export { TreeNodeSchema, AllowedTypes, TreeFieldSchema, FlexTreeSchema, Any, SchemaLibraryData, LazyTreeNodeSchema, InternalTypedSchemaTypes, ViewSchema, SchemaLintConfiguration, FieldNodeSchema, LeafNodeSchema, MapNodeSchema, ObjectNodeSchema, schemaIsFieldNode, schemaIsLeaf, schemaIsMap, schemaIsObjectNode, bannedFieldNames, fieldApiPrefixes, validateObjectNodeFieldName, Unenforced, AllowedTypeSet, markEager, MapFieldSchema, SchemaCollection, TreeNodeSchemaBase, FlexListToUnion, LazyItem, isLazy, NormalizeObjectNodeFields, NormalizeField as NormalizeFieldSchema, Fields, intoStoredSchema, intoStoredSchemaCollection, } from "./typed-schema";
+export { SchemaBuilderBase, SchemaLibrary, ImplicitFieldSchema, NormalizeField, ImplicitAllowedTypes, NormalizeAllowedTypes, SchemaBuilderOptions, normalizeAllowedTypes, normalizeField, } from "./schemaBuilderBase";
+export { SchemaBuilderInternal } from "./schemaBuilder";
+export { mapRootChanges, mapFieldChanges, mapFieldsChanges, mapMark, mapMarkList, } from "./deltaUtils";
+export { TreeChunk, chunkTree, buildChunkedForest, defaultChunkPolicy, makeTreeChunker, makeFieldBatchCodec, } from "./chunked-forest";
+export { compareLocalNodeKeys, LocalNodeKey, createNodeKeyManager, createMockNodeKeyManager, StableNodeKey, NodeKeyIndex, NodeKeyManager, nodeKeyFieldKey, nodeKeyTreeIdentifier, } from "./node-key";
+export { FieldKinds, Required, Optional, Sequence, NodeKeyFieldKind, Forbidden, DefaultChangeset, DefaultChangeFamily, DefaultEditBuilder, IDefaultEditBuilder, ValueFieldEditBuilder, OptionalFieldEditBuilder, SequenceFieldEditBuilder, defaultSchemaPolicy, fieldKinds, intoDelta, relevantRemovedRoots, } from "./default-schema";
+export { AssignableFieldKinds, FlexTreeFieldNode, FlexibleFieldContent, FlexibleNodeContent, FlexTreeLeafNode, FlexTreeMapNode, FlexTreeOptionalField, FlexTreeRequiredField, FlexTreeSequenceField, Skip, FlexTreeObjectNode, FlexTreeObjectNodeTyped, FlexTreeContext, FlexTreeTypedField, FlexTreeTypedNode, FlexTreeTypedNodeUnion, FlexTreeEntity, FlexTreeField, FlexTreeNode, getTreeContext, boxedIterator, CheckTypesOverlap, TreeStatus, Context, TreeEvent, EditableTreeEvents, FlexTreeUnknownUnboxed, onNextChange, isFlexTreeNode, FlexTreeTypedFieldInner, FlexTreeUnboxFieldInner, FlexTreeObjectNodeFields, FlexTreeUnboxField, FlexTreeUnboxNode, FlexTreeUnboxNodeUnion, FlexTreeNodeKeyField, IsArrayOfOne, FlexibleNodeSubSequence, flexTreeMarker, FlexTreeEntityKind, NodeKeys, } from "./flex-tree";
+export { treeSchemaFromStoredSchema } from "./storedToViewSchema";
+export { TreeCompressionStrategy } from "./treeCompressionUtils";
+export { valueSchemaAllows } from "./valueUtilities";
+export { InsertableFlexNode, InsertableFlexField, AllowedTypesToFlexInsertableTree, ApplyMultiplicity, CollectOptions, TypedFields, UnbrandedName, EmptyObject, } from "./schema-aware";
+export { DetachedFieldIndexSummarizer } from "./detachedFieldIndexSummarizer";
+export { SchemaChange, makeSchemaChangeCodec, EncodedSchemaChange } from "./schema-edits";
+export { makeMitigatedChangeFamily } from "./mitigatedChangeFamily";
+//# sourceMappingURL=index.d.ts.map

package/lib/feature-libraries/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/feature-libraries/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,yBAAyB,EACzB,sBAAsB,EACtB,4BAA4B,EAC5B,mBAAmB,EACnB,4BAA4B,EAC5B,UAAU,EACV,aAAa,EACb,SAAS,EACT,sBAAsB,EACtB,mBAAmB,EACnB,WAAW,EACX,aAAa,EACb,cAAc,EACd,WAAW,EACX,UAAU,EACV,QAAQ,EACR,eAAe,EACf,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,WAAW,EACX,kBAAkB,EAClB,cAAc,EACd,qBAAqB,EACrB,oBAAoB,EACpB,oBAAoB,EACpB,mBAAmB,EACnB,0BAA0B,EAC1B,qBAAqB,EACrB,wBAAwB,EACxB,eAAe,EACf,mBAAmB,EACnB,cAAc,EACd,UAAU,EACV,eAAe,EACf,iBAAiB,GACjB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACN,cAAc,EACd,WAAW,EACX,WAAW,EACX,+BAA+B,EAC/B,yBAAyB,EACzB,eAAe,EACf,iCAAiC,EACjC,YAAY,EACZ,YAAY,EACZ,wBAAwB,EACxB,yBAAyB,EACzB,0BAA0B,EAC1B,kBAAkB,EAClB,sBAAsB,EACtB,wBAAwB,EACxB,wBAAwB,EACxB,eAAe,EACf,gBAAgB,EAChB,eAAe,GACf,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EAAE,WAAW,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAElF,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAEnE,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACjG,OAAO,EAAE,wBAAwB,EAAE,OAAO,EAAE,MAAM,4BAA4B,CAAC;AAC/E,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AACtF,OAAO,EACN,mBAAmB,EACnB,aAAa,EACb,UAAU,EACV,eAAe,EACf,cAAc,EACd,oBAAoB,GACpB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACN,yBAAyB,EACzB,0BAA0B,EAC1B,sBAAsB,EACtB,2BAA2B,EAC3B,sBAAsB,GACtB,MAAM,kBAAkB,CAAC;AAG1B,OAAO,KAAK,aAAa,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,CAAC;AAEzB,OAAO,EACN,YAAY,EACZ,kBAAkB,EAClB,oBAAoB,IAAI,eAAe,EACvC,kBAAkB,EAClB,kBAAkB,EAClB,WAAW,EACX,aAAa,EACb,cAAc,EACd,WAAW,EACX,cAAc,EACd,OAAO,EACP,gBAAgB,EAChB,kBAAkB,EAClB,kBAAkB,EAClB,iBAAiB,EACjB,iBAAiB,EACjB,gBAAgB,EAChB,SAAS,EACT,gBAAgB,EAChB,kBAAkB,EAClB,gBAAgB,EAChB,gBAAgB,EAChB,eAAe,EACf,oBAAoB,EACpB,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,WAAW,EACX,6BAA6B,EAC7B,uBAAuB,GACvB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,OAAO,EACN,cAAc,EACd,YAAY,EACZ,eAAe,EACf,cAAc,EACd,GAAG,EACH,iBAAiB,EACjB,kBAAkB,EAClB,wBAAwB,EACxB,UAAU,EACV,uBAAuB,EACvB,eAAe,EACf,cAAc,EACd,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,YAAY,EACZ,WAAW,EACX,kBAAkB,EAClB,gBAAgB,EAChB,gBAAgB,EAChB,2BAA2B,EAC3B,UAAU,EACV,cAAc,EACd,SAAS,EACT,cAAc,EACd,gBAAgB,EAChB,kBAAkB,EAClB,eAAe,EACf,QAAQ,EACR,MAAM,EACN,yBAAyB,EACzB,cAAc,IAAI,oBAAoB,EACtC,MAAM,EACN,gBAAgB,EAChB,0BAA0B,GAC1B,MAAM,gBAAgB,CAAC;AAExB,OAAO,EACN,iBAAiB,EACjB,aAAa,EACb,mBAAmB,EACnB,cAAc,EACd,oBAAoB,EACpB,qBAAqB,EACrB,oBAAoB,EACpB,qBAAqB,EACrB,cAAc,GACd,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AAExD,OAAO,EACN,cAAc,EACd,eAAe,EACf,gBAAgB,EAChB,OAAO,EACP,WAAW,GACX,MAAM,cAAc,CAAC;AAEtB,OAAO,EACN,SAAS,EACT,SAAS,EACT,kBAAkB,EAClB,kBAAkB,EAClB,eAAe,EACf,mBAAmB,GACnB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EACN,oBAAoB,EACpB,YAAY,EACZ,oBAAoB,EACpB,wBAAwB,EACxB,aAAa,EACb,YAAY,EACZ,cAAc,EACd,eAAe,EACf,qBAAqB,GACrB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACN,UAAU,EACV,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,gBAAgB,EAChB,SAAS,EACT,gBAAgB,EAChB,mBAAmB,EACnB,kBAAkB,EAClB,mBAAmB,EACnB,qBAAqB,EACrB,wBAAwB,EACxB,wBAAwB,EACxB,mBAAmB,EACnB,UAAU,EACV,SAAS,EACT,oBAAoB,GACpB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EACN,oBAAoB,EACpB,iBAAiB,EACjB,oBAAoB,EACpB,mBAAmB,EACnB,gBAAgB,EAChB,eAAe,EACf,qBAAqB,EACrB,qBAAqB,EACrB,qBAAqB,EACrB,IAAI,EACJ,kBAAkB,EAClB,uBAAuB,EACvB,eAAe,EACf,kBAAkB,EAClB,iBAAiB,EACjB,sBAAsB,EACtB,cAAc,EACd,aAAa,EACb,YAAY,EACZ,cAAc,EACd,aAAa,EACb,iBAAiB,EACjB,UAAU,EACV,OAAO,EACP,SAAS,EACT,kBAAkB,EAClB,sBAAsB,EACtB,YAAY,EACZ,cAAc,EAGd,uBAAuB,EACvB,uBAAuB,EACvB,wBAAwB,EACxB,kBAAkB,EAClB,iBAAiB,EACjB,sBAAsB,EACtB,oBAAoB,EACpB,YAAY,EACZ,uBAAuB,EACvB,cAAc,EACd,kBAAkB,EAClB,QAAQ,GACR,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,0BAA0B,EAAE,MAAM,sBAAsB,CAAC;AAElE,OAAO,EAAE,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AAEjE,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAErD,OAAO,EACN,kBAAkB,EAClB,mBAAmB,EACnB,gCAAgC,EAChC,iBAAiB,EAGjB,cAAc,EACd,WAAW,EACX,aAAa,EACb,WAAW,GACX,MAAM,gBAAgB,CAAC;AAExB,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAE9E,OAAO,EAAE,YAAY,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAE1F,OAAO,EAAE,yBAAyB,EAAE,MAAM,yBAAyB,CAAC"}

package/lib/feature-libraries/index.js

@@ -0,0 +1,34 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { createDataBinderBuffering, createDataBinderDirect, createDataBinderInvalidating, createBinderOptions, createFlushableBinderOptions, indexSymbol, BindingType, toDownPath, comparePipeline, compileSyntaxTree, } from "./editableTreeBinder";
+export { typeNameSymbol, valueSymbol, isTreeValue, isContextuallyTypedNodeDataObject, getFieldKind, cursorFromContextualData, cursorsFromContextualData, cursorForTypedData, cursorForTypedTreeData, cursorsForTypedFieldData, normalizeNewFieldContent, getPossibleTypes, getAllowedTypes, } from "./contextuallyTyped";
+export { allowsValue, assertAllowedValue, isFluidHandle } from "./valueUtilities";
+export { ForestSummarizer } from "./forest-summary";
+export { cursorForMapTreeField, cursorForMapTreeNode, mapTreeFromCursor } from "./mapTreeCursor";
+export { MemoizedIdRangeAllocator } from "./memoizedIdRangeAllocator";
+export { buildForest } from "./object-forest";
+export { SchemaSummarizer, encodeTreeSchema, makeSchemaCodec } from "./schema-index/";
+export { stackTreeNodeCursor, prefixPath, prefixFieldPath, stackTreeFieldCursor, } from "./treeCursorUtils";
+export { cursorForJsonableTreeNode, cursorForJsonableTreeField, jsonableTreeFromCursor, jsonableTreeFromFieldCursor, jsonableTreeFromForest, } from "./treeTextCursor";
+// Split this up into separate import and export for compatibility with API-Extractor.
+import * as SequenceField from "./sequence-field";
+export { SequenceField };
+export { isNeverField, ModularEditBuilder, CrossFieldTarget, FieldKind, allowsRepoSuperset, genericFieldKind, NodeExistenceState, FieldKindWithEditor, ModularChangeFamily, makeV0Codec, EncodedModularChangeset, } from "./modular-schema";
+export { Multiplicity } from "./multiplicity";
+export { TreeFieldSchema, Any, InternalTypedSchemaTypes, ViewSchema, FieldNodeSchema, LeafNodeSchema, MapNodeSchema, ObjectNodeSchema, schemaIsFieldNode, schemaIsLeaf, schemaIsMap, schemaIsObjectNode, bannedFieldNames, fieldApiPrefixes, validateObjectNodeFieldName, markEager, TreeNodeSchemaBase, isLazy, intoStoredSchema, intoStoredSchemaCollection, } from "./typed-schema";
+export { SchemaBuilderBase, normalizeAllowedTypes, normalizeField, } from "./schemaBuilderBase";
+export { SchemaBuilderInternal } from "./schemaBuilder";
+export { mapRootChanges, mapFieldChanges, mapFieldsChanges, mapMark, mapMarkList, } from "./deltaUtils";
+export { chunkTree, buildChunkedForest, defaultChunkPolicy, makeTreeChunker, makeFieldBatchCodec, } from "./chunked-forest";
+export { compareLocalNodeKeys, createNodeKeyManager, createMockNodeKeyManager, NodeKeyIndex, nodeKeyFieldKey, nodeKeyTreeIdentifier, } from "./node-key";
+export { FieldKinds, DefaultChangeFamily, DefaultEditBuilder, defaultSchemaPolicy, fieldKinds, intoDelta, relevantRemovedRoots, } from "./default-schema";
+export { Skip, getTreeContext, boxedIterator, TreeStatus, Context, onNextChange, isFlexTreeNode, flexTreeMarker, FlexTreeEntityKind, } from "./flex-tree";
+export { treeSchemaFromStoredSchema } from "./storedToViewSchema";
+export { TreeCompressionStrategy } from "./treeCompressionUtils";
+export { valueSchemaAllows } from "./valueUtilities";
+export { DetachedFieldIndexSummarizer } from "./detachedFieldIndexSummarizer";
+export { makeSchemaChangeCodec, EncodedSchemaChange } from "./schema-edits";
+export { makeMitigatedChangeFamily } from "./mitigatedChangeFamily";
+//# sourceMappingURL=index.js.map

package/lib/feature-libraries/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/feature-libraries/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,yBAAyB,EACzB,sBAAsB,EACtB,4BAA4B,EAC5B,mBAAmB,EACnB,4BAA4B,EAS5B,WAAW,EAOX,WAAW,EAaX,UAAU,EACV,eAAe,EACf,iBAAiB,GACjB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACN,cAAc,EACd,WAAW,EACX,WAAW,EAIX,iCAAiC,EACjC,YAAY,EAEZ,wBAAwB,EACxB,yBAAyB,EAEzB,kBAAkB,EAClB,sBAAsB,EACtB,wBAAwB,EACxB,wBAAwB,EAExB,gBAAgB,EAChB,eAAe,GACf,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EAAE,WAAW,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAIlF,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACjG,OAAO,EAAE,wBAAwB,EAAW,MAAM,4BAA4B,CAAC;AAC/E,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AACtF,OAAO,EACN,mBAAmB,EAEnB,UAAU,EACV,eAAe,EAEf,oBAAoB,GACpB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACN,yBAAyB,EACzB,0BAA0B,EAC1B,sBAAsB,EACtB,2BAA2B,EAC3B,sBAAsB,GACtB,MAAM,kBAAkB,CAAC;AAE1B,sFAAsF;AACtF,OAAO,KAAK,aAAa,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,CAAC;AAEzB,OAAO,EACN,YAAY,EACZ,kBAAkB,EAelB,gBAAgB,EAChB,SAAS,EAET,kBAAkB,EAElB,gBAAgB,EAGhB,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,WAAW,EAEX,uBAAuB,GACvB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,OAAO,EAGN,eAAe,EAEf,GAAG,EAGH,wBAAwB,EACxB,UAAU,EAEV,eAAe,EACf,cAAc,EACd,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,YAAY,EACZ,WAAW,EACX,kBAAkB,EAClB,gBAAgB,EAChB,gBAAgB,EAChB,2BAA2B,EAG3B,SAAS,EAGT,kBAAkB,EAGlB,MAAM,EAIN,gBAAgB,EAChB,0BAA0B,GAC1B,MAAM,gBAAgB,CAAC;AAExB,OAAO,EACN,iBAAiB,EAOjB,qBAAqB,EACrB,cAAc,GACd,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AAExD,OAAO,EACN,cAAc,EACd,eAAe,EACf,gBAAgB,EAChB,OAAO,EACP,WAAW,GACX,MAAM,cAAc,CAAC;AAEtB,OAAO,EAEN,SAAS,EACT,kBAAkB,EAClB,kBAAkB,EAClB,eAAe,EACf,mBAAmB,GACnB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EACN,oBAAoB,EAEpB,oBAAoB,EACpB,wBAAwB,EAExB,YAAY,EAEZ,eAAe,EACf,qBAAqB,GACrB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACN,UAAU,EAOV,mBAAmB,EACnB,kBAAkB,EAKlB,mBAAmB,EACnB,UAAU,EACV,SAAS,EACT,oBAAoB,GACpB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAUN,IAAI,EAUJ,cAAc,EACd,aAAa,EAEb,UAAU,EACV,OAAO,EAIP,YAAY,EACZ,cAAc,EAYd,cAAc,EACd,kBAAkB,GAElB,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,0BAA0B,EAAE,MAAM,sBAAsB,CAAC;AAElE,OAAO,EAAE,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AAEjE,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAerD,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAE9E,OAAO,EAAgB,qBAAqB,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAE1F,OAAO,EAAE,yBAAyB,EAAE,MAAM,yBAAyB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\tcreateDataBinderBuffering,\n\tcreateDataBinderDirect,\n\tcreateDataBinderInvalidating,\n\tcreateBinderOptions,\n\tcreateFlushableBinderOptions,\n\tDataBinder,\n\tBinderOptions,\n\tFlushable,\n\tFlushableBinderOptions,\n\tFlushableDataBinder,\n\tMatchPolicy,\n\tSubtreePolicy,\n\tBindSyntaxTree,\n\tindexSymbol,\n\tBindPolicy,\n\tBindTree,\n\tBindTreeDefault,\n\tDownPath,\n\tBindPath,\n\tPathStep,\n\tBindingType,\n\tBindingContextType,\n\tBindingContext,\n\tVisitorBindingContext,\n\tDeleteBindingContext,\n\tInsertBindingContext,\n\tBatchBindingContext,\n\tInvalidationBindingContext,\n\tOperationBinderEvents,\n\tInvalidationBinderEvents,\n\tCompareFunction,\n\tBinderEventsCompare,\n\tAnchorsCompare,\n\ttoDownPath,\n\tcomparePipeline,\n\tcompileSyntaxTree,\n} from \"./editableTreeBinder\";\nexport {\n\ttypeNameSymbol,\n\tvalueSymbol,\n\tisTreeValue,\n\tContextuallyTypedNodeDataObject,\n\tContextuallyTypedNodeData,\n\tMarkedArrayLike,\n\tisContextuallyTypedNodeDataObject,\n\tgetFieldKind,\n\tArrayLikeMut,\n\tcursorFromContextualData,\n\tcursorsFromContextualData,\n\tContextuallyTypedFieldData,\n\tcursorForTypedData,\n\tcursorForTypedTreeData,\n\tcursorsForTypedFieldData,\n\tnormalizeNewFieldContent,\n\tNewFieldContent,\n\tgetPossibleTypes,\n\tgetAllowedTypes,\n} from \"./contextuallyTyped\";\n\nexport { allowsValue, assertAllowedValue, isFluidHandle } from \"./valueUtilities\";\n\nexport { FieldGenerator, TreeDataContext } from \"./fieldGenerator\";\n\nexport { ForestSummarizer } from \"./forest-summary\";\nexport { cursorForMapTreeField, cursorForMapTreeNode, mapTreeFromCursor } from \"./mapTreeCursor\";\nexport { MemoizedIdRangeAllocator, IdRange } from \"./memoizedIdRangeAllocator\";\nexport { buildForest } from \"./object-forest\";\nexport { SchemaSummarizer, encodeTreeSchema, makeSchemaCodec } from \"./schema-index/\";\nexport {\n\tstackTreeNodeCursor,\n\tCursorAdapter,\n\tprefixPath,\n\tprefixFieldPath,\n\tCursorWithNode,\n\tstackTreeFieldCursor,\n} from \"./treeCursorUtils\";\nexport {\n\tcursorForJsonableTreeNode,\n\tcursorForJsonableTreeField,\n\tjsonableTreeFromCursor,\n\tjsonableTreeFromFieldCursor,\n\tjsonableTreeFromForest,\n} from \"./treeTextCursor\";\n\n// Split this up into separate import and export for compatibility with API-Extractor.\nimport * as SequenceField from \"./sequence-field\";\nexport { SequenceField };\n\nexport {\n\tisNeverField,\n\tModularEditBuilder,\n\tFieldEditDescription as EditDescription,\n\tFieldChangeHandler,\n\tFieldChangeRebaser,\n\tFieldEditor,\n\tNodeChangeset,\n\tFieldChangeMap,\n\tFieldChange,\n\tFieldChangeset,\n\tToDelta,\n\tModularChangeset,\n\tNodeChangeComposer,\n\tNodeChangeInverter,\n\tNodeChangeRebaser,\n\tCrossFieldManager,\n\tCrossFieldTarget,\n\tFieldKind,\n\tFullSchemaPolicy,\n\tallowsRepoSuperset,\n\tGenericChangeset,\n\tgenericFieldKind,\n\tHasFieldChanges,\n\tNodeExistsConstraint,\n\tNodeExistenceState,\n\tFieldKindWithEditor,\n\tModularChangeFamily,\n\tmakeV0Codec,\n\tRelevantRemovedRootsFromChild,\n\tEncodedModularChangeset,\n} from \"./modular-schema\";\n\nexport { Multiplicity } from \"./multiplicity\";\n\nexport {\n\tTreeNodeSchema,\n\tAllowedTypes,\n\tTreeFieldSchema,\n\tFlexTreeSchema,\n\tAny,\n\tSchemaLibraryData,\n\tLazyTreeNodeSchema,\n\tInternalTypedSchemaTypes,\n\tViewSchema,\n\tSchemaLintConfiguration,\n\tFieldNodeSchema,\n\tLeafNodeSchema,\n\tMapNodeSchema,\n\tObjectNodeSchema,\n\tschemaIsFieldNode,\n\tschemaIsLeaf,\n\tschemaIsMap,\n\tschemaIsObjectNode,\n\tbannedFieldNames,\n\tfieldApiPrefixes,\n\tvalidateObjectNodeFieldName,\n\tUnenforced,\n\tAllowedTypeSet,\n\tmarkEager,\n\tMapFieldSchema,\n\tSchemaCollection,\n\tTreeNodeSchemaBase,\n\tFlexListToUnion,\n\tLazyItem,\n\tisLazy,\n\tNormalizeObjectNodeFields,\n\tNormalizeField as NormalizeFieldSchema,\n\tFields,\n\tintoStoredSchema,\n\tintoStoredSchemaCollection,\n} from \"./typed-schema\";\n\nexport {\n\tSchemaBuilderBase,\n\tSchemaLibrary,\n\tImplicitFieldSchema,\n\tNormalizeField,\n\tImplicitAllowedTypes,\n\tNormalizeAllowedTypes,\n\tSchemaBuilderOptions,\n\tnormalizeAllowedTypes,\n\tnormalizeField,\n} from \"./schemaBuilderBase\";\nexport { SchemaBuilderInternal } from \"./schemaBuilder\";\n\nexport {\n\tmapRootChanges,\n\tmapFieldChanges,\n\tmapFieldsChanges,\n\tmapMark,\n\tmapMarkList,\n} from \"./deltaUtils\";\n\nexport {\n\tTreeChunk,\n\tchunkTree,\n\tbuildChunkedForest,\n\tdefaultChunkPolicy,\n\tmakeTreeChunker,\n\tmakeFieldBatchCodec,\n} from \"./chunked-forest\";\n\nexport {\n\tcompareLocalNodeKeys,\n\tLocalNodeKey,\n\tcreateNodeKeyManager,\n\tcreateMockNodeKeyManager,\n\tStableNodeKey,\n\tNodeKeyIndex,\n\tNodeKeyManager,\n\tnodeKeyFieldKey,\n\tnodeKeyTreeIdentifier,\n} from \"./node-key\";\n\nexport {\n\tFieldKinds,\n\tRequired,\n\tOptional,\n\tSequence,\n\tNodeKeyFieldKind,\n\tForbidden,\n\tDefaultChangeset,\n\tDefaultChangeFamily,\n\tDefaultEditBuilder,\n\tIDefaultEditBuilder,\n\tValueFieldEditBuilder,\n\tOptionalFieldEditBuilder,\n\tSequenceFieldEditBuilder,\n\tdefaultSchemaPolicy,\n\tfieldKinds,\n\tintoDelta,\n\trelevantRemovedRoots,\n} from \"./default-schema\";\n\nexport {\n\tAssignableFieldKinds,\n\tFlexTreeFieldNode,\n\tFlexibleFieldContent,\n\tFlexibleNodeContent,\n\tFlexTreeLeafNode,\n\tFlexTreeMapNode,\n\tFlexTreeOptionalField,\n\tFlexTreeRequiredField,\n\tFlexTreeSequenceField,\n\tSkip,\n\tFlexTreeObjectNode,\n\tFlexTreeObjectNodeTyped,\n\tFlexTreeContext,\n\tFlexTreeTypedField,\n\tFlexTreeTypedNode,\n\tFlexTreeTypedNodeUnion,\n\tFlexTreeEntity,\n\tFlexTreeField,\n\tFlexTreeNode,\n\tgetTreeContext,\n\tboxedIterator,\n\tCheckTypesOverlap,\n\tTreeStatus,\n\tContext,\n\tTreeEvent,\n\tEditableTreeEvents,\n\tFlexTreeUnknownUnboxed,\n\tonNextChange,\n\tisFlexTreeNode,\n\n\t// Internal\n\tFlexTreeTypedFieldInner,\n\tFlexTreeUnboxFieldInner,\n\tFlexTreeObjectNodeFields,\n\tFlexTreeUnboxField,\n\tFlexTreeUnboxNode,\n\tFlexTreeUnboxNodeUnion,\n\tFlexTreeNodeKeyField,\n\tIsArrayOfOne,\n\tFlexibleNodeSubSequence,\n\tflexTreeMarker,\n\tFlexTreeEntityKind,\n\tNodeKeys,\n} from \"./flex-tree\";\n\nexport { treeSchemaFromStoredSchema } from \"./storedToViewSchema\";\n\nexport { TreeCompressionStrategy } from \"./treeCompressionUtils\";\n\nexport { valueSchemaAllows } from \"./valueUtilities\";\n\nexport {\n\tInsertableFlexNode,\n\tInsertableFlexField,\n\tAllowedTypesToFlexInsertableTree,\n\tApplyMultiplicity,\n\n\t// Internal\n\tCollectOptions,\n\tTypedFields,\n\tUnbrandedName,\n\tEmptyObject,\n} from \"./schema-aware\";\n\nexport { DetachedFieldIndexSummarizer } from \"./detachedFieldIndexSummarizer\";\n\nexport { SchemaChange, makeSchemaChangeCodec, EncodedSchemaChange } from \"./schema-edits\";\n\nexport { makeMitigatedChangeFamily } from \"./mitigatedChangeFamily\";\n"]}

package/lib/feature-libraries/mapTreeCursor.d.ts

@@ -0,0 +1,19 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { MapTree, ITreeCursor, DetachedField } from "../core";
+import { CursorWithNode } from "./treeCursorUtils";
+/**
+ * @returns An {@link ITreeCursorSynchronous} in nodes mode for a single {@link MapTree}.
+ */
+export declare function cursorForMapTreeNode(root: MapTree): CursorWithNode<MapTree>;
+/**
+ * @returns an {@link ITreeCursorSynchronous} in fields mode for a MapTree field.
+ */
+export declare function cursorForMapTreeField(root: MapTree[], detachedField?: DetachedField): CursorWithNode<MapTree>;
+/**
+ * Extract a MapTree from the contents of the given ITreeCursor's current node.
+ */
+export declare function mapTreeFromCursor(cursor: ITreeCursor): MapTree;
+//# sourceMappingURL=mapTreeCursor.d.ts.map

package/lib/feature-libraries/mapTreeCursor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mapTreeCursor.d.ts","sourceRoot":"","sources":["../../src/feature-libraries/mapTreeCursor.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAEN,OAAO,EACP,WAAW,EAGX,aAAa,EAIb,MAAM,SAAS,CAAC;AACjB,OAAO,EAEN,cAAc,EAGd,MAAM,mBAAmB,CAAC;AAE3B;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,CAE3E;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACpC,IAAI,EAAE,OAAO,EAAE,EACf,aAAa,GAAE,aAAyB,GACtC,cAAc,CAAC,OAAO,CAAC,CAUzB;AASD;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,WAAW,GAAG,OAAO,CAe9D"}

package/lib/feature-libraries/mapTreeCursor.js

@@ -0,0 +1,47 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { assert } from "@fluidframework/core-utils";
+import { mapCursorField, detachedFieldAsKey, rootField, aboveRootPlaceholder, } from "../core";
+import { stackTreeFieldCursor, stackTreeNodeCursor, } from "./treeCursorUtils";
+/**
+ * @returns An {@link ITreeCursorSynchronous} in nodes mode for a single {@link MapTree}.
+ */
+export function cursorForMapTreeNode(root) {
+    return stackTreeNodeCursor(adapter, root);
+}
+/**
+ * @returns an {@link ITreeCursorSynchronous} in fields mode for a MapTree field.
+ */
+export function cursorForMapTreeField(root, detachedField = rootField) {
+    const key = detachedFieldAsKey(detachedField);
+    return stackTreeFieldCursor(adapter, {
+        type: aboveRootPlaceholder,
+        fields: new Map([[key, root]]),
+    }, detachedField);
+}
+const adapter = {
+    value: (node) => node.value,
+    type: (node) => node.type,
+    keysFromNode: (node) => [...node.fields.keys()],
+    getFieldFromNode: (node, key) => node.fields.get(key) ?? [],
+};
+/**
+ * Extract a MapTree from the contents of the given ITreeCursor's current node.
+ */
+export function mapTreeFromCursor(cursor) {
+    assert(cursor.mode === 0 /* CursorLocationType.Nodes */, 0x3b7 /* must start at node */);
+    const fields = new Map();
+    for (let inField = cursor.firstField(); inField; inField = cursor.nextField()) {
+        const field = mapCursorField(cursor, mapTreeFromCursor);
+        fields.set(cursor.getFieldKey(), field);
+    }
+    const node = {
+        type: cursor.type,
+        value: cursor.value,
+        fields,
+    };
+    return node;
+}
+//# sourceMappingURL=mapTreeCursor.js.map

package/lib/feature-libraries/mapTreeCursor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mapTreeCursor.js","sourceRoot":"","sources":["../../src/feature-libraries/mapTreeCursor.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AACpD,OAAO,EAKN,cAAc,EAEd,kBAAkB,EAClB,SAAS,EACT,oBAAoB,GACpB,MAAM,SAAS,CAAC;AACjB,OAAO,EAGN,oBAAoB,EACpB,mBAAmB,GACnB,MAAM,mBAAmB,CAAC;AAE3B;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAa;IACjD,OAAO,mBAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACpC,IAAe,EACf,gBAA+B,SAAS;IAExC,MAAM,GAAG,GAAG,kBAAkB,CAAC,aAAa,CAAC,CAAC;IAC9C,OAAO,oBAAoB,CAC1B,OAAO,EACP;QACC,IAAI,EAAE,oBAAoB;QAC1B,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;KAC9B,EACD,aAAa,CACb,CAAC;AACH,CAAC;AAED,MAAM,OAAO,GAA2B;IACvC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK;IAC3B,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI;IACzB,YAAY,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IAC/C,gBAAgB,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;CAC3D,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAmB;IACpD,MAAM,CAAC,MAAM,CAAC,IAAI,qCAA6B,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;IACjF,MAAM,MAAM,GAA6B,IAAI,GAAG,EAAE,CAAC;IACnD,KAAK,IAAI,OAAO,GAAG,MAAM,CAAC,UAAU,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE;QAC9E,MAAM,KAAK,GAAc,cAAc,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;QACnE,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,EAAE,KAAK,CAAC,CAAC;KACxC;IAED,MAAM,IAAI,GAAY;QACrB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,MAAM;KACN,CAAC;IAEF,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\";\nimport {\n\tFieldKey,\n\tMapTree,\n\tITreeCursor,\n\tCursorLocationType,\n\tmapCursorField,\n\tDetachedField,\n\tdetachedFieldAsKey,\n\trootField,\n\taboveRootPlaceholder,\n} from \"../core\";\nimport {\n\tCursorAdapter,\n\tCursorWithNode,\n\tstackTreeFieldCursor,\n\tstackTreeNodeCursor,\n} from \"./treeCursorUtils\";\n\n/**\n * @returns An {@link ITreeCursorSynchronous} in nodes mode for a single {@link MapTree}.\n */\nexport function cursorForMapTreeNode(root: MapTree): CursorWithNode<MapTree> {\n\treturn stackTreeNodeCursor(adapter, root);\n}\n\n/**\n * @returns an {@link ITreeCursorSynchronous} in fields mode for a MapTree field.\n */\nexport function cursorForMapTreeField(\n\troot: MapTree[],\n\tdetachedField: DetachedField = rootField,\n): CursorWithNode<MapTree> {\n\tconst key = detachedFieldAsKey(detachedField);\n\treturn stackTreeFieldCursor(\n\t\tadapter,\n\t\t{\n\t\t\ttype: aboveRootPlaceholder,\n\t\t\tfields: new Map([[key, root]]),\n\t\t},\n\t\tdetachedField,\n\t);\n}\n\nconst adapter: CursorAdapter<MapTree> = {\n\tvalue: (node) => node.value,\n\ttype: (node) => node.type,\n\tkeysFromNode: (node) => [...node.fields.keys()], // TODO: don't convert this to array here.\n\tgetFieldFromNode: (node, key) => node.fields.get(key) ?? [],\n};\n\n/**\n * Extract a MapTree from the contents of the given ITreeCursor's current node.\n */\nexport function mapTreeFromCursor(cursor: ITreeCursor): MapTree {\n\tassert(cursor.mode === CursorLocationType.Nodes, 0x3b7 /* must start at node */);\n\tconst fields: Map<FieldKey, MapTree[]> = new Map();\n\tfor (let inField = cursor.firstField(); inField; inField = cursor.nextField()) {\n\t\tconst field: MapTree[] = mapCursorField(cursor, mapTreeFromCursor);\n\t\tfields.set(cursor.getFieldKey(), field);\n\t}\n\n\tconst node: MapTree = {\n\t\ttype: cursor.type,\n\t\tvalue: cursor.value,\n\t\tfields,\n\t};\n\n\treturn node;\n}\n"]}

package/lib/feature-libraries/memoizedIdRangeAllocator.d.ts

@@ -0,0 +1,42 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { ChangesetLocalId, RevisionTag } from "../core";
+/**
+ * A unique ID allocator that returns the output ID for the same input ID.
+ *
+ * @internal
+ */
+export interface MemoizedIdRangeAllocator {
+    /**
+     * A unique ID allocator that returns the output ID for the same input ID.
+     *
+     * "The same" here includes cases where a prior call allocated a range of IDs that partially or fully overlap with the
+     * current call.
+     * @param revision - The revision associated with the range of IDs to allocate.
+     * @param startId - The first ID to allocate.
+     * @param count - The number of IDs to allocate. Interpreted as 1 if undefined.
+     */
+    allocate(revision: RevisionTag | undefined, startId: ChangesetLocalId, count?: number): IdRange[];
+    /**
+     * Allocates a new range of IDs.
+     *
+     * @param count - The number of IDs to allocate. Interpreted as 1 if undefined.
+     */
+    mint(count?: number): ChangesetLocalId;
+}
+/**
+ * @internal
+ */
+export interface IdRange {
+    readonly first: ChangesetLocalId;
+    readonly count: number;
+}
+/**
+ * @internal
+ */
+export declare const MemoizedIdRangeAllocator: {
+    fromNextId(nextId?: number): MemoizedIdRangeAllocator;
+};
+//# sourceMappingURL=memoizedIdRangeAllocator.d.ts.map

package/lib/feature-libraries/memoizedIdRangeAllocator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoizedIdRangeAllocator.d.ts","sourceRoot":"","sources":["../../src/feature-libraries/memoizedIdRangeAllocator.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAUxD;;;;GAIG;AACH,MAAM,WAAW,wBAAwB;IACxC;;;;;;;;OAQG;IACH,QAAQ,CACP,QAAQ,EAAE,WAAW,GAAG,SAAS,EACjC,OAAO,EAAE,gBAAgB,EACzB,KAAK,CAAC,EAAE,MAAM,GACZ,OAAO,EAAE,CAAC;IACb;;;;OAIG;IACH,IAAI,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,gBAAgB,CAAC;CACvC;AAED;;GAEG;AACH,MAAM,WAAW,OAAO;IACvB,QAAQ,CAAC,KAAK,EAAE,gBAAgB,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,eAAO,MAAM,wBAAwB;wBACjB,MAAM,GAAO,wBAAwB;CAgExD,CAAC"}

package/lib/feature-libraries/memoizedIdRangeAllocator.js

@@ -0,0 +1,72 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { getOrAddEmptyToMap, getFirstEntryFromRangeMap, setInRangeMap, brand, } from "../util";
+/**
+ * @internal
+ */
+export const MemoizedIdRangeAllocator = {
+    fromNextId(nextId = 0) {
+        const rangeMap = new Map();
+        let _nextId = nextId;
+        return {
+            allocate(key, startId, length) {
+                let count = length ?? 1;
+                const out = [];
+                const ranges = getOrAddEmptyToMap(rangeMap, key);
+                let currId = startId;
+                while (count > 0) {
+                    const firstRange = getFirstEntryFromRangeMap(ranges, currId, count);
+                    if (firstRange === undefined) {
+                        const newId = _nextId;
+                        _nextId += count;
+                        setInRangeMap(ranges, currId, count, newId);
+                        out.push({ first: brand(newId), count });
+                        count = 0;
+                    }
+                    else {
+                        const idRange = {
+                            first: brand(firstRange.value),
+                            count: firstRange.length,
+                        };
+                        if (currId < firstRange.start) {
+                            const countToAdd = firstRange.start - currId;
+                            setInRangeMap(ranges, currId, countToAdd, _nextId);
+                            out.push({ first: brand(_nextId), count: countToAdd });
+                            _nextId += countToAdd;
+                            currId += countToAdd;
+                            count -= countToAdd;
+                        }
+                        else if (firstRange.start < currId) {
+                            const countToTrim = currId - firstRange.start;
+                            idRange.first = brand(idRange.first + countToTrim);
+                            idRange.count -= countToTrim;
+                        }
+                        if (idRange.count > count) {
+                            idRange.count = count;
+                        }
+                        else if (idRange.count < count &&
+                            firstRange.value + firstRange.length === _nextId) {
+                            // The existing range can be extended
+                            _nextId += count - idRange.count;
+                            firstRange.length = count;
+                            idRange.count = count;
+                        }
+                        out.push(idRange);
+                        count -= idRange.count;
+                        currId += idRange.count;
+                    }
+                }
+                return out;
+            },
+            mint(length) {
+                const count = length ?? 1;
+                const out = _nextId;
+                _nextId += count;
+                return brand(out);
+            },
+        };
+    },
+};
+//# sourceMappingURL=memoizedIdRangeAllocator.js.map

package/lib/feature-libraries/memoizedIdRangeAllocator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoizedIdRangeAllocator.js","sourceRoot":"","sources":["../../src/feature-libraries/memoizedIdRangeAllocator.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAEN,kBAAkB,EAClB,yBAAyB,EACzB,aAAa,EAEb,KAAK,GACL,MAAM,SAAS,CAAC;AAsCjB;;GAEG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG;IACvC,UAAU,CAAC,SAAiB,CAAC;QAC5B,MAAM,QAAQ,GAAmD,IAAI,GAAG,EAAE,CAAC;QAC3E,IAAI,OAAO,GAAG,MAAM,CAAC;QACrB,OAAO;YACN,QAAQ,CACP,GAAgC,EAChC,OAAe,EACf,MAAe;gBAEf,IAAI,KAAK,GAAG,MAAM,IAAI,CAAC,CAAC;gBACxB,MAAM,GAAG,GAAc,EAAE,CAAC;gBAC1B,MAAM,MAAM,GAAG,kBAAkB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;gBACjD,IAAI,MAAM,GAAG,OAAO,CAAC;gBACrB,OAAO,KAAK,GAAG,CAAC,EAAE;oBACjB,MAAM,UAAU,GAAG,yBAAyB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;oBACpE,IAAI,UAAU,KAAK,SAAS,EAAE;wBAC7B,MAAM,KAAK,GAAG,OAAO,CAAC;wBACtB,OAAO,IAAI,KAAK,CAAC;wBACjB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;wBAC5C,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;wBACzC,KAAK,GAAG,CAAC,CAAC;qBACV;yBAAM;wBACN,MAAM,OAAO,GAAqB;4BACjC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC;4BAC9B,KAAK,EAAE,UAAU,CAAC,MAAM;yBACxB,CAAC;wBACF,IAAI,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE;4BAC9B,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,GAAG,MAAM,CAAC;4BAC7C,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;4BACnD,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;4BACvD,OAAO,IAAI,UAAU,CAAC;4BACtB,MAAM,IAAI,UAAU,CAAC;4BACrB,KAAK,IAAI,UAAU,CAAC;yBACpB;6BAAM,IAAI,UAAU,CAAC,KAAK,GAAG,MAAM,EAAE;4BACrC,MAAM,WAAW,GAAG,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC;4BAC9C,OAAO,CAAC,KAAK,GAAG,KAAK,CAAE,OAAO,CAAC,KAAgB,GAAG,WAAW,CAAC,CAAC;4BAC/D,OAAO,CAAC,KAAK,IAAI,WAAW,CAAC;yBAC7B;wBACD,IAAI,OAAO,CAAC,KAAK,GAAG,KAAK,EAAE;4BAC1B,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC;yBACtB;6BAAM,IACN,OAAO,CAAC,KAAK,GAAG,KAAK;4BACrB,UAAU,CAAC,KAAK,GAAG,UAAU,CAAC,MAAM,KAAK,OAAO,EAC/C;4BACD,qCAAqC;4BACrC,OAAO,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;4BACjC,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC;4BAC1B,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC;yBACtB;wBACD,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;wBAClB,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC;wBACvB,MAAM,IAAI,OAAO,CAAC,KAAK,CAAC;qBACxB;iBACD;gBACD,OAAO,GAAG,CAAC;YACZ,CAAC;YACD,IAAI,CAAC,MAAe;gBACnB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,CAAC;gBAC1B,MAAM,GAAG,GAAG,OAAO,CAAC;gBACpB,OAAO,IAAI,KAAK,CAAC;gBACjB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;SACD,CAAC;IACH,CAAC;CACD,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ChangesetLocalId, RevisionTag } from \"../core\";\nimport {\n\tRangeMap,\n\tgetOrAddEmptyToMap,\n\tgetFirstEntryFromRangeMap,\n\tsetInRangeMap,\n\tMutable,\n\tbrand,\n} from \"../util\";\n\n/**\n * A unique ID allocator that returns the output ID for the same input ID.\n *\n * @internal\n */\nexport interface MemoizedIdRangeAllocator {\n\t/**\n\t * A unique ID allocator that returns the output ID for the same input ID.\n\t *\n\t * \"The same\" here includes cases where a prior call allocated a range of IDs that partially or fully overlap with the\n\t * current call.\n\t * @param revision - The revision associated with the range of IDs to allocate.\n\t * @param startId - The first ID to allocate.\n\t * @param count - The number of IDs to allocate. Interpreted as 1 if undefined.\n\t */\n\tallocate(\n\t\trevision: RevisionTag | undefined,\n\t\tstartId: ChangesetLocalId,\n\t\tcount?: number,\n\t): IdRange[];\n\t/**\n\t * Allocates a new range of IDs.\n\t *\n\t * @param count - The number of IDs to allocate. Interpreted as 1 if undefined.\n\t */\n\tmint(count?: number): ChangesetLocalId;\n}\n\n/**\n * @internal\n */\nexport interface IdRange {\n\treadonly first: ChangesetLocalId;\n\treadonly count: number;\n}\n\n/**\n * @internal\n */\nexport const MemoizedIdRangeAllocator = {\n\tfromNextId(nextId: number = 0): MemoizedIdRangeAllocator {\n\t\tconst rangeMap: Map<RevisionTag | undefined, RangeMap<number>> = new Map();\n\t\tlet _nextId = nextId;\n\t\treturn {\n\t\t\tallocate(\n\t\t\t\tkey: string | number | undefined,\n\t\t\t\tstartId: number,\n\t\t\t\tlength?: number,\n\t\t\t): IdRange[] {\n\t\t\t\tlet count = length ?? 1;\n\t\t\t\tconst out: IdRange[] = [];\n\t\t\t\tconst ranges = getOrAddEmptyToMap(rangeMap, key);\n\t\t\t\tlet currId = startId;\n\t\t\t\twhile (count > 0) {\n\t\t\t\t\tconst firstRange = getFirstEntryFromRangeMap(ranges, currId, count);\n\t\t\t\t\tif (firstRange === undefined) {\n\t\t\t\t\t\tconst newId = _nextId;\n\t\t\t\t\t\t_nextId += count;\n\t\t\t\t\t\tsetInRangeMap(ranges, currId, count, newId);\n\t\t\t\t\t\tout.push({ first: brand(newId), count });\n\t\t\t\t\t\tcount = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tconst idRange: Mutable<IdRange> = {\n\t\t\t\t\t\t\tfirst: brand(firstRange.value),\n\t\t\t\t\t\t\tcount: firstRange.length,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tif (currId < firstRange.start) {\n\t\t\t\t\t\t\tconst countToAdd = firstRange.start - currId;\n\t\t\t\t\t\t\tsetInRangeMap(ranges, currId, countToAdd, _nextId);\n\t\t\t\t\t\t\tout.push({ first: brand(_nextId), count: countToAdd });\n\t\t\t\t\t\t\t_nextId += countToAdd;\n\t\t\t\t\t\t\tcurrId += countToAdd;\n\t\t\t\t\t\t\tcount -= countToAdd;\n\t\t\t\t\t\t} else if (firstRange.start < currId) {\n\t\t\t\t\t\t\tconst countToTrim = currId - firstRange.start;\n\t\t\t\t\t\t\tidRange.first = brand((idRange.first as number) + countToTrim);\n\t\t\t\t\t\t\tidRange.count -= countToTrim;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (idRange.count > count) {\n\t\t\t\t\t\t\tidRange.count = count;\n\t\t\t\t\t\t} else if (\n\t\t\t\t\t\t\tidRange.count < count &&\n\t\t\t\t\t\t\tfirstRange.value + firstRange.length === _nextId\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t// The existing range can be extended\n\t\t\t\t\t\t\t_nextId += count - idRange.count;\n\t\t\t\t\t\t\tfirstRange.length = count;\n\t\t\t\t\t\t\tidRange.count = count;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tout.push(idRange);\n\t\t\t\t\t\tcount -= idRange.count;\n\t\t\t\t\t\tcurrId += idRange.count;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t},\n\t\t\tmint(length?: number): ChangesetLocalId {\n\t\t\t\tconst count = length ?? 1;\n\t\t\t\tconst out = _nextId;\n\t\t\t\t_nextId += count;\n\t\t\t\treturn brand(out);\n\t\t\t},\n\t\t};\n\t},\n};\n"]}

package/lib/feature-libraries/mitigatedChangeFamily.d.ts

@@ -0,0 +1,22 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { ChangeFamily, ChangeFamilyEditor, ChangeRebaser } from "../core";
+/**
+ * Makes a given `ChangeFamily` safer to use by wrapping some of its functions in try-catch blocks.
+ *
+ * Mitigated functions:
+ * - {@link ChangeFamily.intoDelta} (an empty Delta is returned instead)
+ * - {@link ChangeRebaser.rebase} (the given `fallbackChange` is returned instead)
+ * - {@link ChangeRebaser.invert} (the given `fallbackChange` is returned instead)
+ * - {@link ChangeRebaser.compose} (the given `fallbackChange` is returned instead)
+ *
+ * @param unmitigatedChangeFamily - The change family to mitigate.
+ * @param fallbackChange - A changeset to use as a fallback when one of the mitigated functions throws.
+ * @param onError - A callback invoked for each error thrown.
+ * @returns a mitigated change family.
+ */
+export declare function makeMitigatedChangeFamily<TEditor extends ChangeFamilyEditor, TChange>(unmitigatedChangeFamily: ChangeFamily<TEditor, TChange>, fallbackChange: TChange, onError: (error: unknown) => void): ChangeFamily<TEditor, TChange>;
+export declare function makeMitigatedRebaser<TChange>(unmitigatedRebaser: ChangeRebaser<TChange>, fallbackChange: TChange, onError: (error: unknown) => void): ChangeRebaser<TChange>;
+//# sourceMappingURL=mitigatedChangeFamily.d.ts.map

package/lib/feature-libraries/mitigatedChangeFamily.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mitigatedChangeFamily.d.ts","sourceRoot":"","sources":["../../src/feature-libraries/mitigatedChangeFamily.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,YAAY,EACZ,kBAAkB,EAClB,aAAa,EAGb,MAAM,SAAS,CAAC;AAEjB;;;;;;;;;;;;;GAaG;AACH,wBAAgB,yBAAyB,CAAC,OAAO,SAAS,kBAAkB,EAAE,OAAO,EACpF,uBAAuB,EAAE,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,EACvD,cAAc,EAAE,OAAO,EACvB,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,GAC/B,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAQhC;AAED,wBAAgB,oBAAoB,CAAC,OAAO,EAC3C,kBAAkB,EAAE,aAAa,CAAC,OAAO,CAAC,EAC1C,cAAc,EAAE,OAAO,EACvB,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,GAC/B,aAAa,CAAC,OAAO,CAAC,CAyBxB"}