@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/dist/feature-libraries/chunked-forest/codec/nodeShape.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeShape.js","sourceRoot":"","sources":["../../../../src/feature-libraries/chunked-forest/codec/nodeShape.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,wCAKuB;AACvB,wCAA4C;AAC5C,iEAA8E;AAG9E,yDAM4B;AAE5B,MAAa,SAAU,SAAQ,4BAAwB;IAItD,YACiB,IAA0C,EAC1C,KAAwB,EACxB,MAAoC,EACpC,UAAoC;QAEpD,KAAK,EAAE,CAAC;QALQ,SAAI,GAAJ,IAAI,CAAsC;QAC1C,UAAK,GAAL,KAAK,CAAmB;QACxB,WAAM,GAAN,MAAM,CAA8B;QACpC,eAAU,GAAV,UAAU,CAA0B;QAGpD,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC;IAEM,UAAU,CAChB,MAA8B,EAC9B,KAAmB,EACnB,YAA6C;QAE7C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE;YAC5B,YAAY,CAAC,IAAI,CAAC,IAAI,sCAAe,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;SACpD;aAAM;YACN,IAAA,mBAAM,EAAC,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;SACrE;QAED,IAAA,8BAAW,EAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;QAEpD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YAChC,MAAM,CAAC,UAAU,CAAC,IAAA,YAAK,EAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACpC,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;YACrD,MAAM,CAAC,SAAS,EAAE,CAAC;SACnB;QAED,MAAM,WAAW,GAAoC,EAAE,CAAC;QAExD,IAAA,mBAAY,EAAC,MAAM,EAAE,GAAG,EAAE;YACzB,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACjC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;gBAChC,IAAA,mBAAM,EACL,IAAI,CAAC,UAAU,KAAK,SAAS,EAC7B,KAAK,CAAC,6DAA6D,CACnE,CAAC;gBACF,WAAW,CAAC,IAAI,CAAC,IAAI,sCAAe,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC3C,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;aACxD;QACF,CAAC,CAAC,CAAC;QAEH,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,EAAE;YAClC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC/B;IACF,CAAC;IAEM,WAAW,CACjB,WAAuC,EACvC,MAAoD;QAEpD,OAAO;YACN,CAAC,EAAE;gBACF,IAAI,EAAE,wBAAwB,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC;gBACtD,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,MAAM,CAAC;gBAC3D,WAAW,EAAE,wBAAwB,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC;aAC9D;SACD,CAAC;IACH,CAAC;IAEM,KAAK,CACX,WAA4B,EAC5B,MAAiD;QAEjD,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE;YAC5B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3B;QAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YAChC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SAC1B;QAED,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,EAAE;YAClC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;SAC9B;IACF,CAAC;IAED,IAAW,KAAK;QACf,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AAvFD,8BAuFC;AAED,SAAgB,iBAAiB,CAChC,MAAoC,EACpC,WAAuC,EACvC,MAAoD;IAEpD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC7B,GAAG,EAAE,gBAAgB,CAAC,KAAK,CAAC,GAAG,EAAE,WAAW,CAAC;QAC7C,KAAK,EAAE,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,IAAA,WAAI,EAAC,eAAe,CAAC;KAC1E,CAAC,CAAC,CAAC;AACL,CAAC;AATD,8CASC;AAED,SAAS,gBAAgB,CAAC,UAAkB,EAAE,WAAuC;IACpF,OAAO,WAAW,CAAC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC;AAC/D,CAAC;AAED,SAAS,wBAAwB,CAChC,UAA8B,EAC9B,WAAuC;IAEvC,OAAO,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;AACzF,CAAC;AAED,SAAS,wBAAwB,CAChC,KAA+B,EAC/B,MAAoD;IAEpD,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAC1E,CAAC;AAED,SAAS,UAAU,CAClB,KAA+B,EAC/B,MAAoD;IAEpD,OAAO,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAA,WAAI,EAAC,eAAe,CAAC,CAAC;AAChE,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\tITreeCursorSynchronous,\n\tTreeNodeSchemaIdentifier,\n\tforEachField,\n} from \"../../../core\";\nimport { brand, fail } from \"../../../util\";\nimport { BufferFormat, IdentifierToken, Shape } from \"./chunkEncodingGeneric\";\nimport { Counter, DeduplicationTable } from \"./chunkCodecUtilities\";\nimport { EncodedChunkShape, EncodedFieldShape, EncodedValueShape } from \"./format\";\nimport {\n\tNodeEncoder,\n\tKeyedFieldEncoder,\n\tFieldEncoder,\n\tEncoderCache,\n\tencodeValue,\n} from \"./compressedEncode\";\n\nexport class NodeShape extends Shape<EncodedChunkShape> implements NodeEncoder {\n\t// TODO: Ensure uniform chunks, encoding and identifier generation sort fields the same.\n\tprivate readonly explicitKeys: Set<FieldKey>;\n\n\tpublic constructor(\n\t\tpublic readonly type: undefined | TreeNodeSchemaIdentifier,\n\t\tpublic readonly value: EncodedValueShape,\n\t\tpublic readonly fields: readonly KeyedFieldEncoder[],\n\t\tpublic readonly extraLocal: undefined | FieldEncoder,\n\t) {\n\t\tsuper();\n\t\tthis.explicitKeys = new Set(this.fields.map((f) => f.key));\n\t}\n\n\tpublic encodeNode(\n\t\tcursor: ITreeCursorSynchronous,\n\t\tcache: EncoderCache,\n\t\toutputBuffer: BufferFormat<EncodedChunkShape>,\n\t): void {\n\t\tif (this.type === undefined) {\n\t\t\toutputBuffer.push(new IdentifierToken(cursor.type));\n\t\t} else {\n\t\t\tassert(cursor.type === this.type, 0x741 /* type must match shape */);\n\t\t}\n\n\t\tencodeValue(cursor.value, this.value, outputBuffer);\n\n\t\tfor (const field of this.fields) {\n\t\t\tcursor.enterField(brand(field.key));\n\t\t\tfield.shape.encodeField(cursor, cache, outputBuffer);\n\t\t\tcursor.exitField();\n\t\t}\n\n\t\tconst localBuffer: BufferFormat<EncodedChunkShape> = [];\n\n\t\tforEachField(cursor, () => {\n\t\t\tconst key = cursor.getFieldKey();\n\t\t\tif (!this.explicitKeys.has(key)) {\n\t\t\t\tassert(\n\t\t\t\t\tthis.extraLocal !== undefined,\n\t\t\t\t\t0x742 /* had extra local fields when shape does not support them */,\n\t\t\t\t);\n\t\t\t\tlocalBuffer.push(new IdentifierToken(key));\n\t\t\t\tthis.extraLocal.encodeField(cursor, cache, localBuffer);\n\t\t\t}\n\t\t});\n\n\t\tif (this.extraLocal !== undefined) {\n\t\t\toutputBuffer.push(localBuffer);\n\t\t}\n\t}\n\n\tpublic encodeShape(\n\t\tidentifiers: DeduplicationTable<string>,\n\t\tshapes: DeduplicationTable<Shape<EncodedChunkShape>>,\n\t): EncodedChunkShape {\n\t\treturn {\n\t\t\tc: {\n\t\t\t\ttype: encodeOptionalIdentifier(this.type, identifiers),\n\t\t\t\tvalue: this.value,\n\t\t\t\tfields: encodeFieldShapes(this.fields, identifiers, shapes),\n\t\t\t\textraFields: encodeOptionalFieldShape(this.extraLocal, shapes),\n\t\t\t},\n\t\t};\n\t}\n\n\tpublic count(\n\t\tidentifiers: Counter<string>,\n\t\tshapes: (shape: Shape<EncodedChunkShape>) => void,\n\t): void {\n\t\tif (this.type !== undefined) {\n\t\t\tidentifiers.add(this.type);\n\t\t}\n\n\t\tfor (const field of this.fields) {\n\t\t\tidentifiers.add(field.key);\n\t\t\tshapes(field.shape.shape);\n\t\t}\n\n\t\tif (this.extraLocal !== undefined) {\n\t\t\tshapes(this.extraLocal.shape);\n\t\t}\n\t}\n\n\tpublic get shape() {\n\t\treturn this;\n\t}\n}\n\nexport function encodeFieldShapes(\n\tfields: readonly KeyedFieldEncoder[],\n\tidentifiers: DeduplicationTable<string>,\n\tshapes: DeduplicationTable<Shape<EncodedChunkShape>>,\n): EncodedFieldShape[] {\n\treturn fields.map((field) => ({\n\t\tkey: encodeIdentifier(field.key, identifiers),\n\t\tshape: shapes.valueToIndex.get(field.shape.shape) ?? fail(\"missing shape\"),\n\t}));\n}\n\nfunction encodeIdentifier(identifier: string, identifiers: DeduplicationTable<string>) {\n\treturn identifiers.valueToIndex.get(identifier) ?? identifier;\n}\n\nfunction encodeOptionalIdentifier(\n\tidentifier: string | undefined,\n\tidentifiers: DeduplicationTable<string>,\n) {\n\treturn identifier === undefined ? undefined : encodeIdentifier(identifier, identifiers);\n}\n\nfunction encodeOptionalFieldShape(\n\tshape: FieldEncoder | undefined,\n\tshapes: DeduplicationTable<Shape<EncodedChunkShape>>,\n) {\n\treturn shape === undefined ? undefined : dedupShape(shape.shape, shapes);\n}\n\nfunction dedupShape(\n\tshape: Shape<EncodedChunkShape>,\n\tshapes: DeduplicationTable<Shape<EncodedChunkShape>>,\n) {\n\treturn shapes.valueToIndex.get(shape) ?? fail(\"missing shape\");\n}\n"]}

package/dist/feature-libraries/chunked-forest/codec/schemaBasedEncoding.d.ts

@@ -0,0 +1,28 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { TreeFieldStoredSchema, StoredSchemaCollection, TreeNodeSchemaIdentifier } from "../../../core";
+import { FullSchemaPolicy } from "../../modular-schema";
+import { EncodedFieldBatch } from "./format";
+import { EncoderCache, FieldEncoder, FieldShaper, TreeShaper } from "./compressedEncode";
+import { NodeShape } from "./nodeShape";
+import { FieldBatch } from "./fieldBatch";
+/**
+ * Encode data from `fieldBatch` in into an `EncodedChunk`.
+ *
+ * Optimized for encoded size and encoding performance.
+ * TODO: This function should eventually also take in the root FieldSchema to more efficiently compress the nodes.
+ */
+export declare function schemaCompressedEncode(schema: StoredSchemaCollection, policy: FullSchemaPolicy, fieldBatch: FieldBatch): EncodedFieldBatch;
+export declare function buildCache(schema: StoredSchemaCollection, policy: FullSchemaPolicy): EncoderCache;
+/**
+ * Selects shapes to use to encode fields.
+ */
+export declare function fieldShaper(treeHandler: TreeShaper, field: TreeFieldStoredSchema, cache: EncoderCache): FieldEncoder;
+/**
+ * Selects shapes to use to encode trees.
+ */
+export declare function treeShaper(fullSchema: StoredSchemaCollection, policy: FullSchemaPolicy, fieldHandler: FieldShaper, schemaName: TreeNodeSchemaIdentifier): NodeShape;
+export declare function oneFromSet<T>(set: ReadonlySet<T> | undefined): T | undefined;
+//# sourceMappingURL=schemaBasedEncoding.d.ts.map

package/dist/feature-libraries/chunked-forest/codec/schemaBasedEncoding.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"schemaBasedEncoding.d.ts","sourceRoot":"","sources":["../../../../src/feature-libraries/chunked-forest/codec/schemaBasedEncoding.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACN,qBAAqB,EACrB,sBAAsB,EACtB,wBAAwB,EAKxB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAGxD,OAAO,EAAE,iBAAiB,EAAqB,MAAM,UAAU,CAAC;AAChE,OAAO,EACN,YAAY,EACZ,YAAY,EAEZ,WAAW,EACX,UAAU,EAIV,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACrC,MAAM,EAAE,sBAAsB,EAC9B,MAAM,EAAE,gBAAgB,EACxB,UAAU,EAAE,UAAU,GACpB,iBAAiB,CAEnB;AAED,wBAAgB,UAAU,CAAC,MAAM,EAAE,sBAAsB,EAAE,MAAM,EAAE,gBAAgB,GAAG,YAAY,CASjG;AAED;;GAEG;AACH,wBAAgB,WAAW,CAC1B,WAAW,EAAE,UAAU,EACvB,KAAK,EAAE,qBAAqB,EAC5B,KAAK,EAAE,YAAY,GACjB,YAAY,CAUd;AAED;;GAEG;AACH,wBAAgB,UAAU,CACzB,UAAU,EAAE,sBAAsB,EAClC,MAAM,EAAE,gBAAgB,EACxB,YAAY,EAAE,WAAW,EACzB,UAAU,EAAE,wBAAwB,GAClC,SAAS,CAmCX;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,CAU5E"}

package/dist/feature-libraries/chunked-forest/codec/schemaBasedEncoding.js

@@ -0,0 +1,99 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.oneFromSet = exports.treeShaper = exports.fieldShaper = exports.buildCache = exports.schemaCompressedEncode = void 0;
+const core_utils_1 = require("@fluidframework/core-utils");
+const core_1 = require("../../../core");
+const util_1 = require("../../../util");
+const multiplicity_1 = require("../../multiplicity");
+const compressedEncode_1 = require("./compressedEncode");
+const nodeShape_1 = require("./nodeShape");
+/**
+ * Encode data from `fieldBatch` in into an `EncodedChunk`.
+ *
+ * Optimized for encoded size and encoding performance.
+ * TODO: This function should eventually also take in the root FieldSchema to more efficiently compress the nodes.
+ */
+function schemaCompressedEncode(schema, policy, fieldBatch) {
+    return (0, compressedEncode_1.compressedEncode)(fieldBatch, buildCache(schema, policy));
+}
+exports.schemaCompressedEncode = schemaCompressedEncode;
+function buildCache(schema, policy) {
+    const cache = new compressedEncode_1.EncoderCache((fieldHandler, schemaName) => treeShaper(schema, policy, fieldHandler, schemaName), (treeHandler, field) => fieldShaper(treeHandler, field, cache), policy.fieldKinds);
+    return cache;
+}
+exports.buildCache = buildCache;
+/**
+ * Selects shapes to use to encode fields.
+ */
+function fieldShaper(treeHandler, field, cache) {
+    const kind = cache.fieldShapes.get(field.kind.identifier) ?? (0, util_1.fail)("missing FieldKind");
+    const type = oneFromSet(field.types);
+    const nodeEncoder = type !== undefined ? treeHandler.shapeFromTree(type) : compressedEncode_1.anyNodeEncoder;
+    // eslint-disable-next-line unicorn/prefer-ternary
+    if (kind.multiplicity === multiplicity_1.Multiplicity.Single) {
+        return (0, compressedEncode_1.asFieldEncoder)(nodeEncoder);
+    }
+    else {
+        return cache.nestedArray(nodeEncoder);
+    }
+}
+exports.fieldShaper = fieldShaper;
+/**
+ * Selects shapes to use to encode trees.
+ */
+function treeShaper(fullSchema, policy, fieldHandler, schemaName) {
+    const schema = fullSchema.nodeSchema.get(schemaName) ?? (0, util_1.fail)("missing schema");
+    if (schema instanceof core_1.ObjectNodeStoredSchema) {
+        // TODO:Performance:
+        // consider moving some optional and sequence fields to extra fields if they are commonly empty
+        // to reduce encoded size.
+        const objectNodeFields = [];
+        for (const [key, field] of schema.objectNodeFields ?? []) {
+            objectNodeFields.push({ key, shape: fieldHandler.shapeFromField(field) });
+        }
+        const shape = new nodeShape_1.NodeShape(schemaName, false, objectNodeFields, undefined);
+        return shape;
+    }
+    if (schema instanceof core_1.LeafNodeStoredSchema) {
+        const shape = new nodeShape_1.NodeShape(schemaName, valueShapeFromSchema(schema.leafValue), [], undefined);
+        return shape;
+    }
+    if (schema instanceof core_1.MapNodeStoredSchema) {
+        const shape = new nodeShape_1.NodeShape(schemaName, false, [], fieldHandler.shapeFromField(schema.mapFields));
+        return shape;
+    }
+    (0, util_1.fail)("unsupported node kind");
+}
+exports.treeShaper = treeShaper;
+function oneFromSet(set) {
+    if (set === undefined) {
+        return undefined;
+    }
+    if (set.size !== 1) {
+        return undefined;
+    }
+    for (const item of set) {
+        return item;
+    }
+}
+exports.oneFromSet = oneFromSet;
+function valueShapeFromSchema(schema) {
+    switch (schema) {
+        case undefined:
+            return false;
+        case core_1.ValueSchema.Number:
+        case core_1.ValueSchema.String:
+        case core_1.ValueSchema.Boolean:
+        case core_1.ValueSchema.FluidHandle:
+            return true;
+        case core_1.ValueSchema.Null:
+            return [null];
+        default:
+            (0, core_utils_1.unreachableCase)(schema);
+    }
+}
+//# sourceMappingURL=schemaBasedEncoding.js.map

package/dist/feature-libraries/chunked-forest/codec/schemaBasedEncoding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schemaBasedEncoding.js","sourceRoot":"","sources":["../../../../src/feature-libraries/chunked-forest/codec/schemaBasedEncoding.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAA6D;AAC7D,wCAQuB;AAEvB,wCAAqC;AACrC,qDAAkD;AAElD,yDAS4B;AAC5B,2CAAwC;AAGxC;;;;;GAKG;AACH,SAAgB,sBAAsB,CACrC,MAA8B,EAC9B,MAAwB,EACxB,UAAsB;IAEtB,OAAO,IAAA,mCAAgB,EAAC,UAAU,EAAE,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AACjE,CAAC;AAND,wDAMC;AAED,SAAgB,UAAU,CAAC,MAA8B,EAAE,MAAwB;IAClF,MAAM,KAAK,GAAiB,IAAI,+BAAY,CAC3C,CAAC,YAAyB,EAAE,UAAoC,EAAE,EAAE,CACnE,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,CAAC,EACrD,CAAC,WAAuB,EAAE,KAA4B,EAAE,EAAE,CACzD,WAAW,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,EACvC,MAAM,CAAC,UAAU,CACjB,CAAC;IACF,OAAO,KAAK,CAAC;AACd,CAAC;AATD,gCASC;AAED;;GAEG;AACH,SAAgB,WAAW,CAC1B,WAAuB,EACvB,KAA4B,EAC5B,KAAmB;IAEnB,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAA,WAAI,EAAC,mBAAmB,CAAC,CAAC;IACvF,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,WAAW,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,iCAAc,CAAC;IAC1F,kDAAkD;IAClD,IAAI,IAAI,CAAC,YAAY,KAAK,2BAAY,CAAC,MAAM,EAAE;QAC9C,OAAO,IAAA,iCAAc,EAAC,WAAW,CAAC,CAAC;KACnC;SAAM;QACN,OAAO,KAAK,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;KACtC;AACF,CAAC;AAdD,kCAcC;AAED;;GAEG;AACH,SAAgB,UAAU,CACzB,UAAkC,EAClC,MAAwB,EACxB,YAAyB,EACzB,UAAoC;IAEpC,MAAM,MAAM,GAAG,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAA,WAAI,EAAC,gBAAgB,CAAC,CAAC;IAE/E,IAAI,MAAM,YAAY,6BAAsB,EAAE;QAC7C,oBAAoB;QACpB,+FAA+F;QAC/F,0BAA0B;QAE1B,MAAM,gBAAgB,GAAwB,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,gBAAgB,IAAI,EAAE,EAAE;YACzD,gBAAgB,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,YAAY,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;SAC1E;QAED,MAAM,KAAK,GAAG,IAAI,qBAAS,CAAC,UAAU,EAAE,KAAK,EAAE,gBAAgB,EAAE,SAAS,CAAC,CAAC;QAC5E,OAAO,KAAK,CAAC;KACb;IACD,IAAI,MAAM,YAAY,2BAAoB,EAAE;QAC3C,MAAM,KAAK,GAAG,IAAI,qBAAS,CAC1B,UAAU,EACV,oBAAoB,CAAC,MAAM,CAAC,SAAS,CAAC,EACtC,EAAE,EACF,SAAS,CACT,CAAC;QACF,OAAO,KAAK,CAAC;KACb;IACD,IAAI,MAAM,YAAY,0BAAmB,EAAE;QAC1C,MAAM,KAAK,GAAG,IAAI,qBAAS,CAC1B,UAAU,EACV,KAAK,EACL,EAAE,EACF,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,CAC7C,CAAC;QACF,OAAO,KAAK,CAAC;KACb;IACD,IAAA,WAAI,EAAC,uBAAuB,CAAC,CAAC;AAC/B,CAAC;AAxCD,gCAwCC;AAED,SAAgB,UAAU,CAAI,GAA+B;IAC5D,IAAI,GAAG,KAAK,SAAS,EAAE;QACtB,OAAO,SAAS,CAAC;KACjB;IACD,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE;QACnB,OAAO,SAAS,CAAC;KACjB;IACD,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE;QACvB,OAAO,IAAI,CAAC;KACZ;AACF,CAAC;AAVD,gCAUC;AAED,SAAS,oBAAoB,CAAC,MAA+B;IAC5D,QAAQ,MAAM,EAAE;QACf,KAAK,SAAS;YACb,OAAO,KAAK,CAAC;QACd,KAAK,kBAAW,CAAC,MAAM,CAAC;QACxB,KAAK,kBAAW,CAAC,MAAM,CAAC;QACxB,KAAK,kBAAW,CAAC,OAAO,CAAC;QACzB,KAAK,kBAAW,CAAC,WAAW;YAC3B,OAAO,IAAI,CAAC;QACb,KAAK,kBAAW,CAAC,IAAI;YACpB,OAAO,CAAC,IAAI,CAAC,CAAC;QACf;YACC,IAAA,4BAAe,EAAC,MAAM,CAAC,CAAC;KACzB;AACF,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { unreachableCase } from \"@fluidframework/core-utils\";\nimport {\n\tTreeFieldStoredSchema,\n\tStoredSchemaCollection,\n\tTreeNodeSchemaIdentifier,\n\tValueSchema,\n\tObjectNodeStoredSchema,\n\tLeafNodeStoredSchema,\n\tMapNodeStoredSchema,\n} from \"../../../core\";\nimport { FullSchemaPolicy } from \"../../modular-schema\";\nimport { fail } from \"../../../util\";\nimport { Multiplicity } from \"../../multiplicity\";\nimport { EncodedFieldBatch, EncodedValueShape } from \"./format\";\nimport {\n\tEncoderCache,\n\tFieldEncoder,\n\tKeyedFieldEncoder,\n\tFieldShaper,\n\tTreeShaper,\n\tanyNodeEncoder,\n\tasFieldEncoder,\n\tcompressedEncode,\n} from \"./compressedEncode\";\nimport { NodeShape } from \"./nodeShape\";\nimport { FieldBatch } from \"./fieldBatch\";\n\n/**\n * Encode data from `fieldBatch` in into an `EncodedChunk`.\n *\n * Optimized for encoded size and encoding performance.\n * TODO: This function should eventually also take in the root FieldSchema to more efficiently compress the nodes.\n */\nexport function schemaCompressedEncode(\n\tschema: StoredSchemaCollection,\n\tpolicy: FullSchemaPolicy,\n\tfieldBatch: FieldBatch,\n): EncodedFieldBatch {\n\treturn compressedEncode(fieldBatch, buildCache(schema, policy));\n}\n\nexport function buildCache(schema: StoredSchemaCollection, policy: FullSchemaPolicy): EncoderCache {\n\tconst cache: EncoderCache = new EncoderCache(\n\t\t(fieldHandler: FieldShaper, schemaName: TreeNodeSchemaIdentifier) =>\n\t\t\ttreeShaper(schema, policy, fieldHandler, schemaName),\n\t\t(treeHandler: TreeShaper, field: TreeFieldStoredSchema) =>\n\t\t\tfieldShaper(treeHandler, field, cache),\n\t\tpolicy.fieldKinds,\n\t);\n\treturn cache;\n}\n\n/**\n * Selects shapes to use to encode fields.\n */\nexport function fieldShaper(\n\ttreeHandler: TreeShaper,\n\tfield: TreeFieldStoredSchema,\n\tcache: EncoderCache,\n): FieldEncoder {\n\tconst kind = cache.fieldShapes.get(field.kind.identifier) ?? fail(\"missing FieldKind\");\n\tconst type = oneFromSet(field.types);\n\tconst nodeEncoder = type !== undefined ? treeHandler.shapeFromTree(type) : anyNodeEncoder;\n\t// eslint-disable-next-line unicorn/prefer-ternary\n\tif (kind.multiplicity === Multiplicity.Single) {\n\t\treturn asFieldEncoder(nodeEncoder);\n\t} else {\n\t\treturn cache.nestedArray(nodeEncoder);\n\t}\n}\n\n/**\n * Selects shapes to use to encode trees.\n */\nexport function treeShaper(\n\tfullSchema: StoredSchemaCollection,\n\tpolicy: FullSchemaPolicy,\n\tfieldHandler: FieldShaper,\n\tschemaName: TreeNodeSchemaIdentifier,\n): NodeShape {\n\tconst schema = fullSchema.nodeSchema.get(schemaName) ?? fail(\"missing schema\");\n\n\tif (schema instanceof ObjectNodeStoredSchema) {\n\t\t// TODO:Performance:\n\t\t// consider moving some optional and sequence fields to extra fields if they are commonly empty\n\t\t// to reduce encoded size.\n\n\t\tconst objectNodeFields: KeyedFieldEncoder[] = [];\n\t\tfor (const [key, field] of schema.objectNodeFields ?? []) {\n\t\t\tobjectNodeFields.push({ key, shape: fieldHandler.shapeFromField(field) });\n\t\t}\n\n\t\tconst shape = new NodeShape(schemaName, false, objectNodeFields, undefined);\n\t\treturn shape;\n\t}\n\tif (schema instanceof LeafNodeStoredSchema) {\n\t\tconst shape = new NodeShape(\n\t\t\tschemaName,\n\t\t\tvalueShapeFromSchema(schema.leafValue),\n\t\t\t[],\n\t\t\tundefined,\n\t\t);\n\t\treturn shape;\n\t}\n\tif (schema instanceof MapNodeStoredSchema) {\n\t\tconst shape = new NodeShape(\n\t\t\tschemaName,\n\t\t\tfalse,\n\t\t\t[],\n\t\t\tfieldHandler.shapeFromField(schema.mapFields),\n\t\t);\n\t\treturn shape;\n\t}\n\tfail(\"unsupported node kind\");\n}\n\nexport function oneFromSet<T>(set: ReadonlySet<T> | undefined): T | undefined {\n\tif (set === undefined) {\n\t\treturn undefined;\n\t}\n\tif (set.size !== 1) {\n\t\treturn undefined;\n\t}\n\tfor (const item of set) {\n\t\treturn item;\n\t}\n}\n\nfunction valueShapeFromSchema(schema: ValueSchema | undefined): undefined | EncodedValueShape {\n\tswitch (schema) {\n\t\tcase undefined:\n\t\t\treturn false;\n\t\tcase ValueSchema.Number:\n\t\tcase ValueSchema.String:\n\t\tcase ValueSchema.Boolean:\n\t\tcase ValueSchema.FluidHandle:\n\t\t\treturn true;\n\t\tcase ValueSchema.Null:\n\t\t\treturn [null];\n\t\tdefault:\n\t\t\tunreachableCase(schema);\n\t}\n}\n"]}

package/dist/feature-libraries/chunked-forest/codec/uncompressedEncode.d.ts

@@ -0,0 +1,16 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { FieldBatch } from "./fieldBatch";
+import { EncodedFieldBatch } from "./format";
+/**
+ * Encode data from `cursor` in the simplest way supported by `EncodedChunk`.
+ *
+ * No polymorphism, identifier deduplication or schema based compression.
+ * Just uses two hard coded shapes and inline identifiers.
+ *
+ * This is intended as a simple reference implementation with minimal code and dependencies.
+ */
+export declare function uncompressedEncode(batch: FieldBatch): EncodedFieldBatch;
+//# sourceMappingURL=uncompressedEncode.d.ts.map

package/dist/feature-libraries/chunked-forest/codec/uncompressedEncode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"uncompressedEncode.d.ts","sourceRoot":"","sources":["../../../../src/feature-libraries/chunked-forest/codec/uncompressedEncode.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAiD,iBAAiB,EAAE,MAAM,UAAU,CAAC;AAG5F;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,UAAU,GAAG,iBAAiB,CAUvE"}

package/dist/feature-libraries/chunked-forest/codec/uncompressedEncode.js

@@ -0,0 +1,61 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.uncompressedEncode = void 0;
+const core_1 = require("../../../core");
+const format_1 = require("./format");
+/**
+ * Encode data from `cursor` in the simplest way supported by `EncodedChunk`.
+ *
+ * No polymorphism, identifier deduplication or schema based compression.
+ * Just uses two hard coded shapes and inline identifiers.
+ *
+ * This is intended as a simple reference implementation with minimal code and dependencies.
+ */
+function uncompressedEncode(batch) {
+    const rootFields = batch.map(encodeSequence);
+    return {
+        version: format_1.version,
+        identifiers: [],
+        // A single shape used to encode all fields.
+        shapes: [{ c: anyTreeShape }, { a: anyArray }],
+        // Wrap up each field as an indicator to use the above shape, and its encoded data.
+        data: rootFields.map((data) => [arrayIndex, data]),
+    };
+}
+exports.uncompressedEncode = uncompressedEncode;
+const treeIndex = 0;
+const arrayIndex = 1;
+const anyTreeShape = {
+    extraFields: arrayIndex,
+    fields: [],
+};
+const anyArray = treeIndex;
+/**
+ * Encode a field using the hard coded shape above.
+ * @remarks
+ * Since this shape contains no information about the actual schema, all schema/shape information is inline in the data:
+ * that is why this encoding is called "uncompressed".
+ */
+function encodeSequence(cursor) {
+    const data = [];
+    (0, core_1.forEachNode)(cursor, () => {
+        data.push(cursor.type);
+        const value = cursor.value;
+        data.push(value !== undefined);
+        if (value !== undefined) {
+            data.push(value);
+        }
+        const local = [];
+        (0, core_1.forEachField)(cursor, () => {
+            const key = cursor.getFieldKey();
+            local.push(key, encodeSequence(cursor));
+        });
+        data.push(local);
+    });
+    return data;
+}
+//# sourceMappingURL=uncompressedEncode.js.map

package/dist/feature-libraries/chunked-forest/codec/uncompressedEncode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"uncompressedEncode.js","sourceRoot":"","sources":["../../../../src/feature-libraries/chunked-forest/codec/uncompressedEncode.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,wCAAkF;AAGlF,qCAA4F;AAG5F;;;;;;;GAOG;AACH,SAAgB,kBAAkB,CAAC,KAAiB;IACnD,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IAC7C,OAAO;QACN,OAAO,EAAP,gBAAO;QACP,WAAW,EAAE,EAAE;QACf,4CAA4C;QAC5C,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC;QAC9C,mFAAmF;QACnF,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;KAClD,CAAC;AACH,CAAC;AAVD,gDAUC;AAED,MAAM,SAAS,GAAe,CAAC,CAAC;AAChC,MAAM,UAAU,GAAe,CAAC,CAAC;AAEjC,MAAM,YAAY,GAAqB;IACtC,WAAW,EAAE,UAAU;IACvB,MAAM,EAAE,EAAE;CACV,CAAC;AAEF,MAAM,QAAQ,GAAuB,SAAS,CAAC;AAE/C;;;;;GAKG;AACH,SAAS,cAAc,CAAC,MAA8B;IACrD,MAAM,IAAI,GAAgC,EAAE,CAAC;IAC7C,IAAA,kBAAW,EAAC,MAAM,EAAE,GAAG,EAAE;QACxB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;QAC/B,IAAI,KAAK,KAAK,SAAS,EAAE;YACxB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACjB;QACD,MAAM,KAAK,GAAgC,EAAE,CAAC;QAC9C,IAAA,mBAAY,EAAC,MAAM,EAAE,GAAG,EAAE;YACzB,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,CAAC,CAAC,CAAC;IACH,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 { ITreeCursorSynchronous, forEachField, forEachNode } from \"../../../core\";\nimport { FluidSerializableReadOnly } from \"../../valueUtilities\";\nimport { FieldBatch } from \"./fieldBatch\";\nimport { version, EncodedTreeShape, EncodedNestedArray, EncodedFieldBatch } from \"./format\";\nimport { ShapeIndex } from \"./formatGeneric\";\n\n/**\n * Encode data from `cursor` in the simplest way supported by `EncodedChunk`.\n *\n * No polymorphism, identifier deduplication or schema based compression.\n * Just uses two hard coded shapes and inline identifiers.\n *\n * This is intended as a simple reference implementation with minimal code and dependencies.\n */\nexport function uncompressedEncode(batch: FieldBatch): EncodedFieldBatch {\n\tconst rootFields = batch.map(encodeSequence);\n\treturn {\n\t\tversion,\n\t\tidentifiers: [],\n\t\t// A single shape used to encode all fields.\n\t\tshapes: [{ c: anyTreeShape }, { a: anyArray }],\n\t\t// Wrap up each field as an indicator to use the above shape, and its encoded data.\n\t\tdata: rootFields.map((data) => [arrayIndex, data]),\n\t};\n}\n\nconst treeIndex: ShapeIndex = 0;\nconst arrayIndex: ShapeIndex = 1;\n\nconst anyTreeShape: EncodedTreeShape = {\n\textraFields: arrayIndex,\n\tfields: [],\n};\n\nconst anyArray: EncodedNestedArray = treeIndex;\n\n/**\n * Encode a field using the hard coded shape above.\n * @remarks\n * Since this shape contains no information about the actual schema, all schema/shape information is inline in the data:\n * that is why this encoding is called \"uncompressed\".\n */\nfunction encodeSequence(cursor: ITreeCursorSynchronous): FluidSerializableReadOnly[] {\n\tconst data: FluidSerializableReadOnly[] = [];\n\tforEachNode(cursor, () => {\n\t\tdata.push(cursor.type);\n\t\tconst value = cursor.value;\n\t\tdata.push(value !== undefined);\n\t\tif (value !== undefined) {\n\t\t\tdata.push(value);\n\t\t}\n\t\tconst local: FluidSerializableReadOnly[] = [];\n\t\tforEachField(cursor, () => {\n\t\t\tconst key = cursor.getFieldKey();\n\t\t\tlocal.push(key, encodeSequence(cursor));\n\t\t});\n\t\tdata.push(local);\n\t});\n\treturn data;\n}\n"]}

package/dist/feature-libraries/chunked-forest/emptyChunk.d.ts

@@ -0,0 +1,19 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { ChunkedCursor, TreeChunk } from "./chunk";
+/**
+ * Chunk that is empty.
+ *
+ * Since all emptiness is the same, this is a singleton.
+ *
+ * Useful for when a chunk or cursor is needed for an empty field or detached sequence.
+ */
+export declare const emptyChunk: TreeChunk;
+/**
+ * Cursor over an empty field.
+ * Contains no nodes and is stateless.
+ */
+export declare const emptyCursor: ChunkedCursor;
+//# sourceMappingURL=emptyChunk.d.ts.map

package/dist/feature-libraries/chunked-forest/emptyChunk.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"emptyChunk.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/chunked-forest/emptyChunk.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAYH,OAAO,EAAE,aAAa,EAA0B,SAAS,EAAE,MAAM,SAAS,CAAC;AAE3E;;;;;;GAMG;AACH,eAAO,MAAM,UAAU,EAAE,SAUxB,CAAC;AAOF;;;GAGG;AACH,eAAO,MAAM,WAAW,EAAE,aAoEzB,CAAC"}

package/dist/feature-libraries/chunked-forest/emptyChunk.js

@@ -0,0 +1,107 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.emptyCursor = exports.emptyChunk = void 0;
+const core_1 = require("../../core");
+const util_1 = require("../../util");
+const treeCursorUtils_1 = require("../treeCursorUtils");
+const chunk_1 = require("./chunk");
+/**
+ * Chunk that is empty.
+ *
+ * Since all emptiness is the same, this is a singleton.
+ *
+ * Useful for when a chunk or cursor is needed for an empty field or detached sequence.
+ */
+exports.emptyChunk = {
+    topLevelLength: 0,
+    cursor() {
+        return exports.emptyCursor;
+    },
+    referenceAdded() { },
+    referenceRemoved() { },
+    isShared() {
+        return false; // Immutable, so sharing does not matter.
+    },
+};
+const emptyPath = {
+    parent: undefined,
+    field: chunk_1.dummyRoot,
+};
+/**
+ * Cursor over an empty field.
+ * Contains no nodes and is stateless.
+ */
+exports.emptyCursor = {
+    [core_1.CursorMarker]: true,
+    pending: false,
+    mode: 1 /* CursorLocationType.Fields */,
+    [chunk_1.cursorChunk]: exports.emptyChunk,
+    nextField() {
+        (0, util_1.fail)("cannot navigate above root");
+    },
+    exitField() {
+        (0, util_1.fail)("cannot navigate above root");
+    },
+    skipPendingFields() {
+        return true;
+    },
+    getFieldKey() {
+        return emptyPath.field;
+    },
+    getFieldLength() {
+        return 0;
+    },
+    firstNode() {
+        return false;
+    },
+    enterNode(childIndex) {
+        (0, util_1.fail)("empty cursor has no nodes");
+    },
+    getFieldPath(prefix) {
+        return (0, treeCursorUtils_1.prefixFieldPath)(prefix, emptyPath);
+    },
+    getPath() {
+        (0, util_1.fail)("empty cursor has no nodes");
+    },
+    get fieldIndex() {
+        return (0, util_1.fail)("empty cursor has no nodes");
+    },
+    get chunkStart() {
+        return (0, util_1.fail)("empty cursor has no nodes");
+    },
+    get chunkLength() {
+        return (0, util_1.fail)("empty cursor has no nodes");
+    },
+    seekNodes(offset) {
+        (0, util_1.fail)("empty cursor has no nodes");
+    },
+    nextNode() {
+        (0, util_1.fail)("empty cursor has no nodes");
+    },
+    exitNode() {
+        (0, util_1.fail)("empty cursor has no nodes");
+    },
+    firstField() {
+        (0, util_1.fail)("empty cursor has no nodes");
+    },
+    enterField(key) {
+        (0, util_1.fail)("empty cursor has no nodes");
+    },
+    get type() {
+        return (0, util_1.fail)("empty cursor has no nodes");
+    },
+    get value() {
+        return (0, util_1.fail)("empty cursor has no nodes");
+    },
+    atChunkRoot() {
+        return true;
+    },
+    fork() {
+        return exports.emptyCursor;
+    },
+};
+//# sourceMappingURL=emptyChunk.js.map

package/dist/feature-libraries/chunked-forest/emptyChunk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"emptyChunk.js","sourceRoot":"","sources":["../../../src/feature-libraries/chunked-forest/emptyChunk.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,qCAOoB;AACpB,qCAAkC;AAClC,wDAAqD;AACrD,mCAA2E;AAE3E;;;;;;GAMG;AACU,QAAA,UAAU,GAAc;IACpC,cAAc,EAAE,CAAC;IACjB,MAAM;QACL,OAAO,mBAAW,CAAC;IACpB,CAAC;IACD,cAAc,KAAU,CAAC;IACzB,gBAAgB,KAAU,CAAC;IAC3B,QAAQ;QACP,OAAO,KAAK,CAAC,CAAC,yCAAyC;IACxD,CAAC;CACD,CAAC;AAEF,MAAM,SAAS,GAAgB;IAC9B,MAAM,EAAE,SAAS;IACjB,KAAK,EAAE,iBAAS;CAChB,CAAC;AAEF;;;GAGG;AACU,QAAA,WAAW,GAAkB;IACzC,CAAC,mBAAY,CAAC,EAAE,IAAI;IACpB,OAAO,EAAE,KAAK;IACd,IAAI,mCAA2B;IAC/B,CAAC,mBAAW,CAAC,EAAE,kBAAU;IACzB,SAAS;QACR,IAAA,WAAI,EAAC,4BAA4B,CAAC,CAAC;IACpC,CAAC;IACD,SAAS;QACR,IAAA,WAAI,EAAC,4BAA4B,CAAC,CAAC;IACpC,CAAC;IACD,iBAAiB;QAChB,OAAO,IAAI,CAAC;IACb,CAAC;IACD,WAAW;QACV,OAAO,SAAS,CAAC,KAAK,CAAC;IACxB,CAAC;IACD,cAAc;QACb,OAAO,CAAC,CAAC;IACV,CAAC;IACD,SAAS;QACR,OAAO,KAAK,CAAC;IACd,CAAC;IACD,SAAS,CAAC,UAAkB;QAC3B,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IACnC,CAAC;IACD,YAAY,CAAC,MAAuB;QACnC,OAAO,IAAA,iCAAe,EAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO;QACN,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IACnC,CAAC;IACD,IAAI,UAAU;QACb,OAAO,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IAC1C,CAAC;IACD,IAAI,UAAU;QACb,OAAO,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IAC1C,CAAC;IACD,IAAI,WAAW;QACd,OAAO,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IAC1C,CAAC;IACD,SAAS,CAAC,MAAc;QACvB,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IACnC,CAAC;IACD,QAAQ;QACP,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IACnC,CAAC;IACD,QAAQ;QACP,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IACnC,CAAC;IACD,UAAU;QACT,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IACnC,CAAC;IACD,UAAU,CAAC,GAAa;QACvB,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IACnC,CAAC;IACD,IAAI,IAAI;QACP,OAAO,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IAC1C,CAAC;IACD,IAAI,KAAK;QACR,OAAO,IAAA,WAAI,EAAC,2BAA2B,CAAC,CAAC;IAC1C,CAAC;IACD,WAAW;QACV,OAAO,IAAI,CAAC;IACb,CAAC;IACD,IAAI;QACH,OAAO,mBAAW,CAAC;IACpB,CAAC;CACD,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tFieldKey,\n\tCursorLocationType,\n\tFieldUpPath,\n\tUpPath,\n\tPathRootPrefix,\n\tCursorMarker,\n} from \"../../core\";\nimport { fail } from \"../../util\";\nimport { prefixFieldPath } from \"../treeCursorUtils\";\nimport { ChunkedCursor, cursorChunk, dummyRoot, TreeChunk } from \"./chunk\";\n\n/**\n * Chunk that is empty.\n *\n * Since all emptiness is the same, this is a singleton.\n *\n * Useful for when a chunk or cursor is needed for an empty field or detached sequence.\n */\nexport const emptyChunk: TreeChunk = {\n\ttopLevelLength: 0,\n\tcursor(): ChunkedCursor {\n\t\treturn emptyCursor;\n\t},\n\treferenceAdded(): void {},\n\treferenceRemoved(): void {},\n\tisShared(): boolean {\n\t\treturn false; // Immutable, so sharing does not matter.\n\t},\n};\n\nconst emptyPath: FieldUpPath = {\n\tparent: undefined,\n\tfield: dummyRoot,\n};\n\n/**\n * Cursor over an empty field.\n * Contains no nodes and is stateless.\n */\nexport const emptyCursor: ChunkedCursor = {\n\t[CursorMarker]: true,\n\tpending: false,\n\tmode: CursorLocationType.Fields,\n\t[cursorChunk]: emptyChunk,\n\tnextField(): boolean {\n\t\tfail(\"cannot navigate above root\");\n\t},\n\texitField(): void {\n\t\tfail(\"cannot navigate above root\");\n\t},\n\tskipPendingFields(): boolean {\n\t\treturn true;\n\t},\n\tgetFieldKey(): FieldKey {\n\t\treturn emptyPath.field;\n\t},\n\tgetFieldLength(): number {\n\t\treturn 0;\n\t},\n\tfirstNode(): boolean {\n\t\treturn false;\n\t},\n\tenterNode(childIndex: number): void {\n\t\tfail(\"empty cursor has no nodes\");\n\t},\n\tgetFieldPath(prefix?: PathRootPrefix): FieldUpPath {\n\t\treturn prefixFieldPath(prefix, emptyPath);\n\t},\n\tgetPath(): UpPath | undefined {\n\t\tfail(\"empty cursor has no nodes\");\n\t},\n\tget fieldIndex(): never {\n\t\treturn fail(\"empty cursor has no nodes\");\n\t},\n\tget chunkStart(): never {\n\t\treturn fail(\"empty cursor has no nodes\");\n\t},\n\tget chunkLength(): never {\n\t\treturn fail(\"empty cursor has no nodes\");\n\t},\n\tseekNodes(offset: number): boolean {\n\t\tfail(\"empty cursor has no nodes\");\n\t},\n\tnextNode(): boolean {\n\t\tfail(\"empty cursor has no nodes\");\n\t},\n\texitNode(): void {\n\t\tfail(\"empty cursor has no nodes\");\n\t},\n\tfirstField(): boolean {\n\t\tfail(\"empty cursor has no nodes\");\n\t},\n\tenterField(key: FieldKey): void {\n\t\tfail(\"empty cursor has no nodes\");\n\t},\n\tget type(): never {\n\t\treturn fail(\"empty cursor has no nodes\");\n\t},\n\tget value(): never {\n\t\treturn fail(\"empty cursor has no nodes\");\n\t},\n\tatChunkRoot(): boolean {\n\t\treturn true;\n\t},\n\tfork(): ChunkedCursor {\n\t\treturn emptyCursor;\n\t},\n};\n"]}

package/dist/feature-libraries/chunked-forest/index.d.ts

@@ -0,0 +1,10 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { uniformChunk, ChunkShape } from "./uniformChunk";
+export { TreeChunk, dummyRoot } from "./chunk";
+export { chunkTree, defaultChunkPolicy, makeTreeChunker, IChunker, chunkFieldSingle, chunkField, } from "./chunkTree";
+export { buildChunkedForest } from "./chunkedForest";
+export { EncodedFieldBatch, FieldBatch, FieldBatchCodec, makeFieldBatchCodec, FieldBatchEncoder, } from "./codec";
+//# sourceMappingURL=index.d.ts.map

package/dist/feature-libraries/chunked-forest/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/chunked-forest/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC1D,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAC/C,OAAO,EACN,SAAS,EACT,kBAAkB,EAClB,eAAe,EACf,QAAQ,EACR,gBAAgB,EAChB,UAAU,GACV,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AACrD,OAAO,EACN,iBAAiB,EACjB,UAAU,EACV,eAAe,EACf,mBAAmB,EACnB,iBAAiB,GACjB,MAAM,SAAS,CAAC"}

package/dist/feature-libraries/chunked-forest/index.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.FieldBatchEncoder = exports.makeFieldBatchCodec = exports.EncodedFieldBatch = exports.buildChunkedForest = exports.chunkField = exports.chunkFieldSingle = exports.makeTreeChunker = exports.defaultChunkPolicy = exports.chunkTree = exports.dummyRoot = exports.ChunkShape = exports.uniformChunk = void 0;
+var uniformChunk_1 = require("./uniformChunk");
+Object.defineProperty(exports, "uniformChunk", { enumerable: true, get: function () { return uniformChunk_1.uniformChunk; } });
+Object.defineProperty(exports, "ChunkShape", { enumerable: true, get: function () { return uniformChunk_1.ChunkShape; } });
+var chunk_1 = require("./chunk");
+Object.defineProperty(exports, "dummyRoot", { enumerable: true, get: function () { return chunk_1.dummyRoot; } });
+var chunkTree_1 = require("./chunkTree");
+Object.defineProperty(exports, "chunkTree", { enumerable: true, get: function () { return chunkTree_1.chunkTree; } });
+Object.defineProperty(exports, "defaultChunkPolicy", { enumerable: true, get: function () { return chunkTree_1.defaultChunkPolicy; } });
+Object.defineProperty(exports, "makeTreeChunker", { enumerable: true, get: function () { return chunkTree_1.makeTreeChunker; } });
+Object.defineProperty(exports, "chunkFieldSingle", { enumerable: true, get: function () { return chunkTree_1.chunkFieldSingle; } });
+Object.defineProperty(exports, "chunkField", { enumerable: true, get: function () { return chunkTree_1.chunkField; } });
+var chunkedForest_1 = require("./chunkedForest");
+Object.defineProperty(exports, "buildChunkedForest", { enumerable: true, get: function () { return chunkedForest_1.buildChunkedForest; } });
+var codec_1 = require("./codec");
+Object.defineProperty(exports, "EncodedFieldBatch", { enumerable: true, get: function () { return codec_1.EncodedFieldBatch; } });
+Object.defineProperty(exports, "makeFieldBatchCodec", { enumerable: true, get: function () { return codec_1.makeFieldBatchCodec; } });
+Object.defineProperty(exports, "FieldBatchEncoder", { enumerable: true, get: function () { return codec_1.FieldBatchEncoder; } });
+//# sourceMappingURL=index.js.map

package/dist/feature-libraries/chunked-forest/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/feature-libraries/chunked-forest/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+CAA0D;AAAjD,4GAAA,YAAY,OAAA;AAAE,0GAAA,UAAU,OAAA;AACjC,iCAA+C;AAA3B,kGAAA,SAAS,OAAA;AAC7B,yCAOqB;AANpB,sGAAA,SAAS,OAAA;AACT,+GAAA,kBAAkB,OAAA;AAClB,4GAAA,eAAe,OAAA;AAEf,6GAAA,gBAAgB,OAAA;AAChB,uGAAA,UAAU,OAAA;AAEX,iDAAqD;AAA5C,mHAAA,kBAAkB,OAAA;AAC3B,iCAMiB;AALhB,0GAAA,iBAAiB,OAAA;AAGjB,4GAAA,mBAAmB,OAAA;AACnB,0GAAA,iBAAiB,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport { uniformChunk, ChunkShape } from \"./uniformChunk\";\nexport { TreeChunk, dummyRoot } from \"./chunk\";\nexport {\n\tchunkTree,\n\tdefaultChunkPolicy,\n\tmakeTreeChunker,\n\tIChunker,\n\tchunkFieldSingle,\n\tchunkField,\n} from \"./chunkTree\";\nexport { buildChunkedForest } from \"./chunkedForest\";\nexport {\n\tEncodedFieldBatch,\n\tFieldBatch,\n\tFieldBatchCodec,\n\tmakeFieldBatchCodec,\n\tFieldBatchEncoder,\n} from \"./codec\";\n"]}

package/dist/feature-libraries/chunked-forest/sequenceChunk.d.ts

@@ -0,0 +1,26 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { ReferenceCountedBase } from "../../util";
+import { ChunkedCursor, TreeChunk } from "./chunk";
+/**
+ * General purpose multi-node sequence chunk.
+ */
+export declare class SequenceChunk extends ReferenceCountedBase implements TreeChunk {
+    readonly subChunks: TreeChunk[];
+    get topLevelLength(): number;
+    /**
+     * Create a tree chunk with ref count 1.
+     *
+     * @param fields - provides exclusive deep ownership of this map to this object (which might mutate it in the future).
+     * The caller must have already accounted for this reference to the children in this map (via `referenceAdded`),
+     * and any edits to this must update child reference counts.
+     * @param value - the value on this node, if any.
+     */
+    constructor(subChunks: TreeChunk[]);
+    clone(): SequenceChunk;
+    cursor(): ChunkedCursor;
+    protected dispose(): void;
+}
+//# sourceMappingURL=sequenceChunk.d.ts.map

package/dist/feature-libraries/chunked-forest/sequenceChunk.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceChunk.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/chunked-forest/sequenceChunk.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAElD,OAAO,EAAE,aAAa,EAAa,SAAS,EAAE,MAAM,SAAS,CAAC;AAE9D;;GAEG;AACH,qBAAa,aAAc,SAAQ,oBAAqB,YAAW,SAAS;aAiBxC,SAAS,EAAE,SAAS,EAAE;IAhBzD,IAAW,cAAc,IAAI,MAAM,CAMlC;IAED;;;;;;;OAOG;gBACgC,SAAS,EAAE,SAAS,EAAE;IAIlD,KAAK,IAAI,aAAa;IAQtB,MAAM,IAAI,aAAa;IAe9B,SAAS,CAAC,OAAO,IAAI,IAAI;CAKzB"}

package/dist/feature-libraries/chunked-forest/sequenceChunk.js

@@ -0,0 +1,51 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SequenceChunk = void 0;
+const util_1 = require("../../util");
+const basicChunk_1 = require("./basicChunk");
+const chunk_1 = require("./chunk");
+/**
+ * General purpose multi-node sequence chunk.
+ */
+class SequenceChunk extends util_1.ReferenceCountedBase {
+    get topLevelLength() {
+        let total = 0;
+        for (const child of this.subChunks) {
+            total += child.topLevelLength;
+        }
+        return total;
+    }
+    /**
+     * Create a tree chunk with ref count 1.
+     *
+     * @param fields - provides exclusive deep ownership of this map to this object (which might mutate it in the future).
+     * The caller must have already accounted for this reference to the children in this map (via `referenceAdded`),
+     * and any edits to this must update child reference counts.
+     * @param value - the value on this node, if any.
+     */
+    constructor(subChunks) {
+        super();
+        this.subChunks = subChunks;
+    }
+    clone() {
+        const subChunks = this.subChunks.map((child) => {
+            child.referenceAdded();
+            return child;
+        });
+        return new SequenceChunk(subChunks);
+    }
+    cursor() {
+        return new basicChunk_1.BasicChunkCursor(this.subChunks, [], [], [], [], [chunk_1.dummyRoot], 0, 0, 0, undefined);
+    }
+    dispose() {
+        for (const child of this.subChunks) {
+            child.referenceRemoved();
+        }
+    }
+}
+exports.SequenceChunk = SequenceChunk;
+//# sourceMappingURL=sequenceChunk.js.map

package/dist/feature-libraries/chunked-forest/sequenceChunk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceChunk.js","sourceRoot":"","sources":["../../../src/feature-libraries/chunked-forest/sequenceChunk.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,qCAAkD;AAClD,6CAAgD;AAChD,mCAA8D;AAE9D;;GAEG;AACH,MAAa,aAAc,SAAQ,2BAAoB;IACtD,IAAW,cAAc;QACxB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE;YACnC,KAAK,IAAI,KAAK,CAAC,cAAc,CAAC;SAC9B;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;;;;;OAOG;IACH,YAAmC,SAAsB;QACxD,KAAK,EAAE,CAAC;QAD0B,cAAS,GAAT,SAAS,CAAa;IAEzD,CAAC;IAEM,KAAK;QACX,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YAC9C,KAAK,CAAC,cAAc,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC;QACd,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,aAAa,CAAC,SAAS,CAAC,CAAC;IACrC,CAAC;IAEM,MAAM;QACZ,OAAO,IAAI,6BAAgB,CAC1B,IAAI,CAAC,SAAS,EACd,EAAE,EACF,EAAE,EACF,EAAE,EACF,EAAE,EACF,CAAC,iBAAS,CAAC,EACX,CAAC,EACD,CAAC,EACD,CAAC,EACD,SAAS,CACT,CAAC;IACH,CAAC;IAES,OAAO;QAChB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE;YACnC,KAAK,CAAC,gBAAgB,EAAE,CAAC;SACzB;IACF,CAAC;CACD;AAjDD,sCAiDC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ReferenceCountedBase } from \"../../util\";\nimport { BasicChunkCursor } from \"./basicChunk\";\nimport { ChunkedCursor, dummyRoot, TreeChunk } from \"./chunk\";\n\n/**\n * General purpose multi-node sequence chunk.\n */\nexport class SequenceChunk extends ReferenceCountedBase implements TreeChunk {\n\tpublic get topLevelLength(): number {\n\t\tlet total = 0;\n\t\tfor (const child of this.subChunks) {\n\t\t\ttotal += child.topLevelLength;\n\t\t}\n\t\treturn total;\n\t}\n\n\t/**\n\t * Create a tree chunk with ref count 1.\n\t *\n\t * @param fields - provides exclusive deep ownership of this map to this object (which might mutate it in the future).\n\t * The caller must have already accounted for this reference to the children in this map (via `referenceAdded`),\n\t * and any edits to this must update child reference counts.\n\t * @param value - the value on this node, if any.\n\t */\n\tpublic constructor(public readonly subChunks: TreeChunk[]) {\n\t\tsuper();\n\t}\n\n\tpublic clone(): SequenceChunk {\n\t\tconst subChunks = this.subChunks.map((child) => {\n\t\t\tchild.referenceAdded();\n\t\t\treturn child;\n\t\t});\n\t\treturn new SequenceChunk(subChunks);\n\t}\n\n\tpublic cursor(): ChunkedCursor {\n\t\treturn new BasicChunkCursor(\n\t\t\tthis.subChunks,\n\t\t\t[],\n\t\t\t[],\n\t\t\t[],\n\t\t\t[],\n\t\t\t[dummyRoot],\n\t\t\t0,\n\t\t\t0,\n\t\t\t0,\n\t\t\tundefined,\n\t\t);\n\t}\n\n\tprotected dispose(): void {\n\t\tfor (const child of this.subChunks) {\n\t\t\tchild.referenceRemoved();\n\t\t}\n\t}\n}\n"]}