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

package/lib/test/feature-libraries/chunked-forest/codec/schemaBasedEncoding.spec.js

@@ -1,176 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert, fail } from "assert";
-import { defaultSchemaPolicy, cursorForJsonableTreeField, intoStoredSchema, TreeCompressionStrategy, isFluidHandle, FlexFieldSchema, } from "../../../../feature-libraries/index.js";
-import { buildCache, fieldShaper, oneFromSet, treeShaper,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../../feature-libraries/chunked-forest/codec/schemaBasedEncoding.js";
-import { makeFieldBatchCodec,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../../feature-libraries/chunked-forest/codec/codecs.js";
-import { AnyShape, EncoderCache, anyFieldEncoder,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../../feature-libraries/chunked-forest/codec/compressedEncode.js";
-import { brand } from "../../../../util/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { NodeShape } from "../../../../feature-libraries/chunked-forest/codec/nodeShape.js";
-// eslint-disable-next-line import/no-internal-modules
-import { IdentifierToken } from "../../../../feature-libraries/chunked-forest/codec/chunkEncodingGeneric.js";
-import { jsonableTreesFromFieldCursor } from "../fieldCursorTestUtilities.js";
-import { hasOptionalField, minimal, numericMap, recursiveType, storedLibrary, testTrees, } from "../../../testTrees.js";
-import { leaf } from "../../../../domains/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { FieldKinds, fieldKinds } from "../../../../feature-libraries/default-schema/index.js";
-import { ajvValidator } from "../../../codec/index.js";
-import { takeSnapshot, useSnapshotDirectory } from "../../../snapshots/index.js";
-import { checkFieldEncode, checkNodeEncode } from "./checkEncode.js";
-const anyNodeShape = new NodeShape(undefined, undefined, [], anyFieldEncoder);
-const onlyTypeShape = new NodeShape(undefined, false, [], undefined);
-const numericShape = new NodeShape(leaf.number.name, true, [], undefined);
-describe("schemaBasedEncoding", () => {
-    it("oneFromSet", () => {
-        assert.equal(oneFromSet(undefined), undefined);
-        assert.equal(oneFromSet(new Set([5])), 5);
-        assert.equal(oneFromSet(new Set([1, 2])), undefined);
-    });
-    describe("fieldShaper", () => {
-        it("monomorphic-value", () => {
-            const cache = new EncoderCache(() => fail(), () => fail(), fieldKinds);
-            const log = [];
-            const shape = fieldShaper({
-                shapeFromTree(schemaName) {
-                    log.push(schemaName);
-                    return onlyTypeShape;
-                },
-            }, FlexFieldSchema.create(FieldKinds.required, [minimal]), cache);
-            // This is expected since this case should be optimized to just encode the inner shape.
-            assert.equal(shape.shape, onlyTypeShape);
-            const buffer = checkFieldEncode(shape, cache, [
-                {
-                    type: minimal.name,
-                },
-            ]);
-            assert.deepEqual(buffer, [new IdentifierToken("test.minimal")]);
-        });
-        it("polymorphic-value", () => {
-            const cache = new EncoderCache(() => anyNodeShape, () => fail(), fieldKinds);
-            const log = [];
-            const shape = fieldShaper({
-                shapeFromTree(schemaName) {
-                    log.push(schemaName);
-                    return onlyTypeShape;
-                },
-            }, FlexFieldSchema.create(FieldKinds.required, [minimal, leaf.number]), cache);
-            // There are multiple choices about how this case should be optimized, but the current implementation does this:
-            assert.equal(shape.shape, AnyShape.instance);
-            checkFieldEncode(shape, cache, [{ type: minimal.name }]);
-            checkFieldEncode(shape, cache, [{ type: brand("numeric"), value: 1 }]);
-        });
-        it("sequence", () => {
-            const cache = new EncoderCache(() => fail(), () => fail(), fieldKinds);
-            const log = [];
-            const shape = fieldShaper({
-                shapeFromTree(schemaName) {
-                    log.push(schemaName);
-                    return onlyTypeShape;
-                },
-            }, FlexFieldSchema.create(FieldKinds.sequence, [minimal]), cache);
-            // There are multiple choices about how this case should be optimized, but the current implementation does this:
-            assert.equal(shape.shape, cache.nestedArray(onlyTypeShape));
-            assert.deepEqual(checkFieldEncode(shape, cache, []), [0]);
-            assert.deepEqual(checkFieldEncode(shape, cache, [{ type: minimal.name }]), [
-                [new IdentifierToken("test.minimal")],
-            ]);
-            assert.deepEqual(checkFieldEncode(shape, cache, [{ type: minimal.name }, { type: minimal.name }]), [[new IdentifierToken("test.minimal"), new IdentifierToken("test.minimal")]]);
-        });
-    });
-    describe("treeShaper", () => {
-        it("minimal", () => {
-            const cache = new EncoderCache(() => fail(), () => fail(), fieldKinds);
-            const shape = treeShaper(storedLibrary, defaultSchemaPolicy, { shapeFromField: () => fail() }, minimal.name);
-            const buffer = checkNodeEncode(shape, cache, { type: minimal.name });
-            assert.deepEqual(buffer, []);
-        });
-        it("hasOptionalField", () => {
-            const cache = new EncoderCache(() => fail(), () => fail(), fieldKinds);
-            const log = [];
-            const shape = treeShaper(storedLibrary, defaultSchemaPolicy, {
-                shapeFromField(field) {
-                    log.push(field);
-                    return cache.nestedArray(numericShape);
-                },
-            }, hasOptionalField.name);
-            assert.deepEqual(shape, new NodeShape(hasOptionalField.name, false, [{ key: brand("field"), shape: cache.nestedArray(numericShape) }], undefined));
-            const bufferEmpty = checkNodeEncode(shape, cache, { type: hasOptionalField.name });
-            assert.deepEqual(bufferEmpty, [0]);
-            const bufferFull = checkNodeEncode(shape, cache, {
-                type: hasOptionalField.name,
-                fields: { field: [{ type: leaf.number.name, value: 5 }] },
-            });
-            assert.deepEqual(bufferFull, [[5]]);
-        });
-        it("hasExtraField", () => {
-            const cache = new EncoderCache(() => fail(), () => fail(), fieldKinds);
-            const log = [];
-            const shape = treeShaper(storedLibrary, defaultSchemaPolicy, {
-                shapeFromField(field) {
-                    log.push(field);
-                    return cache.nestedArray(numericShape);
-                },
-            }, numericMap.name);
-            assert.deepEqual(shape, new NodeShape(numericMap.name, false, [], cache.nestedArray(numericShape)));
-            const bufferEmpty = checkNodeEncode(shape, cache, { type: numericMap.name });
-            assert.deepEqual(bufferEmpty, [[]]);
-            const bufferFull = checkNodeEncode(shape, cache, {
-                type: numericMap.name,
-                fields: { extra: [{ type: leaf.number.name, value: 5 }] },
-            });
-            assert.deepEqual(bufferFull, [[new IdentifierToken("extra"), [5]]]);
-        });
-    });
-    it("recursiveType", () => {
-        const cache = buildCache(storedLibrary, defaultSchemaPolicy);
-        const shape = cache.shapeFromTree(recursiveType.name);
-        const bufferEmpty = checkNodeEncode(shape, cache, { type: recursiveType.name });
-        assert.deepEqual(bufferEmpty, [0]);
-        const bufferFull = checkNodeEncode(shape, cache, {
-            type: recursiveType.name,
-            fields: { field: [{ type: recursiveType.name }] },
-        });
-        assert.deepEqual(bufferFull, [[0]]);
-    });
-    describe("test trees", () => {
-        useSnapshotDirectory("chunked-forest-schema-compressed");
-        // TODO: test non size 1 batches
-        for (const { name, treeFactory, schemaData } of testTrees) {
-            it(name, () => {
-                const storedSchema = intoStoredSchema(schemaData);
-                const tree = treeFactory();
-                // Check with checkFieldEncode
-                const cache = buildCache(storedSchema, defaultSchemaPolicy);
-                checkFieldEncode(anyFieldEncoder, cache, tree);
-                const context = {
-                    encodeType: TreeCompressionStrategy.Compressed,
-                    schema: { schema: storedSchema, policy: defaultSchemaPolicy },
-                };
-                const codec = makeFieldBatchCodec({ jsonValidator: ajvValidator });
-                // End to end test
-                const encoded = codec.encode([cursorForJsonableTreeField(tree)], context);
-                const result = codec.decode(encoded, context);
-                const resultTree = result.map(jsonableTreesFromFieldCursor);
-                assert.deepEqual(resultTree, [tree]);
-                // This snapshot makes it clear when the format changes.
-                // This can include compression/heuristic changes which are non breaking,
-                // but does not handle ensuring different old versions stull load (for example encoded with different heuristics).
-                // TODO: add a new test suite with a library of encoded test data which we can parse to cover that.
-                const dataStr = JSON.stringify(encoded, 
-                // The mock handle doesn't stringify deterministically, so replace it:
-                (key, value) => isFluidHandle(value) ? "Handle Placeholder" : value, 2);
-                takeSnapshot(dataStr, `.json`);
-            });
-        }
-    });
-});
-//# sourceMappingURL=schemaBasedEncoding.spec.js.map

package/lib/test/feature-libraries/chunked-forest/codec/schemaBasedEncoding.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"schemaBasedEncoding.spec.js","sourceRoot":"","sources":["../../../../../src/test/feature-libraries/chunked-forest/codec/schemaBasedEncoding.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAEhD,OAAO,EACN,mBAAmB,EACnB,0BAA0B,EAC1B,gBAAgB,EAChB,uBAAuB,EACvB,aAAa,EACb,eAAe,GACf,MAAM,wCAAwC,CAAC;AAEhD,OAAO,EACN,UAAU,EACV,WAAW,EACX,UAAU,EACV,UAAU;AACV,sDAAsD;EACtD,MAAM,2EAA2E,CAAC;AACnF,OAAO,EAEN,mBAAmB;AACnB,sDAAsD;EACtD,MAAM,8DAA8D,CAAC;AACtE,OAAO,EACN,QAAQ,EACR,YAAY,EAGZ,eAAe;AACf,sDAAsD;EACtD,MAAM,wEAAwE,CAAC;AAChF,OAAO,EAA0B,KAAK,EAAE,MAAM,2BAA2B,CAAC;AAC1E,sDAAsD;AACtD,OAAO,EAAE,SAAS,EAAE,MAAM,iEAAiE,CAAC;AAC5F,sDAAsD;AACtD,OAAO,EAAE,eAAe,EAAE,MAAM,4EAA4E,CAAC;AAC7G,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EACN,gBAAgB,EAChB,OAAO,EACP,UAAU,EACV,aAAa,EACb,aAAa,EACb,SAAS,GACT,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,IAAI,EAAE,MAAM,8BAA8B,CAAC;AACpD,sDAAsD;AACtD,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,uDAAuD,CAAC;AAC/F,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,MAAM,6BAA6B,CAAC;AACjF,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAErE,MAAM,YAAY,GAAG,IAAI,SAAS,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC;AAC9E,MAAM,aAAa,GAAG,IAAI,SAAS,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;AACrE,MAAM,YAAY,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;AAE1E,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACpC,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;QACrB,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC,CAAC;QAC/C,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,MAAM,KAAK,GAAG,IAAI,YAAY,CAC7B,GAAG,EAAE,CAAC,IAAI,EAAE,EACZ,GAAG,EAAE,CAAC,IAAI,EAAE,EACZ,UAAU,CACV,CAAC;YACF,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,WAAW,CACxB;gBACC,aAAa,CAAC,UAAoC;oBACjD,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACrB,OAAO,aAAa,CAAC;gBACtB,CAAC;aACD,EACD,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,EACtD,KAAK,CACL,CAAC;YACF,uFAAuF;YACvF,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE;gBAC7C;oBACC,IAAI,EAAE,OAAO,CAAC,IAAI;iBAClB;aACD,CAAC,CAAC;YACH,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,IAAI,eAAe,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,MAAM,KAAK,GAAG,IAAI,YAAY,CAC7B,GAAG,EAAE,CAAC,YAAY,EAClB,GAAG,EAAE,CAAC,IAAI,EAAE,EACZ,UAAU,CACV,CAAC;YACF,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,WAAW,CACxB;gBACC,aAAa,CAAC,UAAoC;oBACjD,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACrB,OAAO,aAAa,CAAC;gBACtB,CAAC;aACD,EACD,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,EACnE,KAAK,CACL,CAAC;YACF,gHAAgH;YAChH,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC7C,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACzD,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACxE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;YACnB,MAAM,KAAK,GAAG,IAAI,YAAY,CAC7B,GAAG,EAAE,CAAC,IAAI,EAAE,EACZ,GAAG,EAAE,CAAC,IAAI,EAAE,EACZ,UAAU,CACV,CAAC;YACF,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,WAAW,CACxB;gBACC,aAAa,CAAC,UAAoC;oBACjD,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACrB,OAAO,aAAa,CAAC;gBACtB,CAAC;aACD,EACD,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,EACtD,KAAK,CACL,CAAC;YACF,gHAAgH;YAChH,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,SAAS,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,CAAC,SAAS,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE;gBAC1E,CAAC,IAAI,eAAe,CAAC,cAAc,CAAC,CAAC;aACrC,CAAC,CAAC;YACH,MAAM,CAAC,SAAS,CACf,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAChF,CAAC,CAAC,IAAI,eAAe,CAAC,cAAc,CAAC,EAAE,IAAI,eAAe,CAAC,cAAc,CAAC,CAAC,CAAC,CAC5E,CAAC;QACH,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC3B,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAClB,MAAM,KAAK,GAAG,IAAI,YAAY,CAC7B,GAAG,EAAE,CAAC,IAAI,EAAE,EACZ,GAAG,EAAE,CAAC,IAAI,EAAE,EACZ,UAAU,CACV,CAAC;YACF,MAAM,KAAK,GAAG,UAAU,CACvB,aAAa,EACb,mBAAmB,EACnB,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,EAChC,OAAO,CAAC,IAAI,CACZ,CAAC;YACF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;YACrE,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,MAAM,KAAK,GAAG,IAAI,YAAY,CAC7B,GAAG,EAAE,CAAC,IAAI,EAAE,EACZ,GAAG,EAAE,CAAC,IAAI,EAAE,EACZ,UAAU,CACV,CAAC;YACF,MAAM,GAAG,GAA4B,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,UAAU,CACvB,aAAa,EACb,mBAAmB,EACnB;gBACC,cAAc,CAAC,KAA4B;oBAC1C,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAChB,OAAO,KAAK,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;gBACxC,CAAC;aACD,EACD,gBAAgB,CAAC,IAAI,CACrB,CAAC;YACF,MAAM,CAAC,SAAS,CACf,KAAK,EACL,IAAI,SAAS,CACZ,gBAAgB,CAAC,IAAI,EACrB,KAAK,EACL,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC,EACjE,SAAS,CACT,CACD,CAAC;YACF,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,gBAAgB,CAAC,IAAI,EAAE,CAAC,CAAC;YACnF,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE;gBAChD,IAAI,EAAE,gBAAgB,CAAC,IAAI;gBAC3B,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE;aACzD,CAAC,CAAC;YACH,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;YACxB,MAAM,KAAK,GAAG,IAAI,YAAY,CAC7B,GAAG,EAAE,CAAC,IAAI,EAAE,EACZ,GAAG,EAAE,CAAC,IAAI,EAAE,EACZ,UAAU,CACV,CAAC;YACF,MAAM,GAAG,GAA4B,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,UAAU,CACvB,aAAa,EACb,mBAAmB,EACnB;gBACC,cAAc,CAAC,KAA4B;oBAC1C,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAChB,OAAO,KAAK,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;gBACxC,CAAC;aACD,EACD,UAAU,CAAC,IAAI,CACf,CAAC;YACF,MAAM,CAAC,SAAS,CACf,KAAK,EACL,IAAI,SAAS,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAC1E,CAAC;YACF,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7E,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpC,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE;gBAChD,IAAI,EAAE,UAAU,CAAC,IAAI;gBACrB,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE;aACzD,CAAC,CAAC;YACH,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,CAAC,IAAI,eAAe,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACxB,MAAM,KAAK,GAAG,UAAU,CAAC,aAAa,EAAE,mBAAmB,CAAC,CAAC;QAC7D,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;QAChF,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE;YAChD,IAAI,EAAE,aAAa,CAAC,IAAI;YACxB,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,CAAC,IAAI,EAAE,CAAC,EAAE;SACjD,CAAC,CAAC;QACH,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC3B,oBAAoB,CAAC,kCAAkC,CAAC,CAAC;QACzD,gCAAgC;QAChC,KAAK,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,IAAI,SAAS,EAAE;YAC1D,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;gBACb,MAAM,YAAY,GAAG,gBAAgB,CAAC,UAAU,CAAC,CAAC;gBAClD,MAAM,IAAI,GAAG,WAAW,EAAE,CAAC;gBAC3B,8BAA8B;gBAC9B,MAAM,KAAK,GAAG,UAAU,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;gBAC5D,gBAAgB,CAAC,eAAe,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBAE/C,MAAM,OAAO,GAA8B;oBAC1C,UAAU,EAAE,uBAAuB,CAAC,UAAU;oBAC9C,MAAM,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,mBAAmB,EAAE;iBAC7D,CAAC;gBACF,MAAM,KAAK,GAAG,mBAAmB,CAAC,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC;gBACnE,kBAAkB;gBAClB,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,0BAA0B,CAAC,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;gBAC1E,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBAC9C,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC;gBAC5D,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;gBAErC,wDAAwD;gBACxD,yEAAyE;gBACzE,kHAAkH;gBAClH,mGAAmG;gBAEnG,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAC7B,OAAO;gBACP,sEAAsE;gBACtE,CAAC,GAAG,EAAE,KAA6B,EAAE,EAAE,CACtC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,KAAK,EACpD,CAAC,CACD,CAAC;gBACF,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAChC,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert, fail } from \"assert\";\nimport { TreeFieldStoredSchema, TreeNodeSchemaIdentifier } from \"../../../../core/index.js\";\nimport {\n\tdefaultSchemaPolicy,\n\tcursorForJsonableTreeField,\n\tintoStoredSchema,\n\tTreeCompressionStrategy,\n\tisFluidHandle,\n\tFlexFieldSchema,\n} from \"../../../../feature-libraries/index.js\";\n\nimport {\n\tbuildCache,\n\tfieldShaper,\n\toneFromSet,\n\ttreeShaper,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../../feature-libraries/chunked-forest/codec/schemaBasedEncoding.js\";\nimport {\n\tFieldBatchEncodingContext,\n\tmakeFieldBatchCodec,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../../feature-libraries/chunked-forest/codec/codecs.js\";\nimport {\n\tAnyShape,\n\tEncoderCache,\n\tFieldEncoder,\n\tNodeEncoder,\n\tanyFieldEncoder,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../../feature-libraries/chunked-forest/codec/compressedEncode.js\";\nimport { JsonCompatibleReadOnly, brand } from \"../../../../util/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { NodeShape } from \"../../../../feature-libraries/chunked-forest/codec/nodeShape.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { IdentifierToken } from \"../../../../feature-libraries/chunked-forest/codec/chunkEncodingGeneric.js\";\nimport { jsonableTreesFromFieldCursor } from \"../fieldCursorTestUtilities.js\";\nimport {\n\thasOptionalField,\n\tminimal,\n\tnumericMap,\n\trecursiveType,\n\tstoredLibrary,\n\ttestTrees,\n} from \"../../../testTrees.js\";\nimport { leaf } from \"../../../../domains/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { FieldKinds, fieldKinds } from \"../../../../feature-libraries/default-schema/index.js\";\nimport { ajvValidator } from \"../../../codec/index.js\";\nimport { takeSnapshot, useSnapshotDirectory } from \"../../../snapshots/index.js\";\nimport { checkFieldEncode, checkNodeEncode } from \"./checkEncode.js\";\n\nconst anyNodeShape = new NodeShape(undefined, undefined, [], anyFieldEncoder);\nconst onlyTypeShape = new NodeShape(undefined, false, [], undefined);\nconst numericShape = new NodeShape(leaf.number.name, true, [], undefined);\n\ndescribe(\"schemaBasedEncoding\", () => {\n\tit(\"oneFromSet\", () => {\n\t\tassert.equal(oneFromSet(undefined), undefined);\n\t\tassert.equal(oneFromSet(new Set([5])), 5);\n\t\tassert.equal(oneFromSet(new Set([1, 2])), undefined);\n\t});\n\n\tdescribe(\"fieldShaper\", () => {\n\t\tit(\"monomorphic-value\", () => {\n\t\t\tconst cache = new EncoderCache(\n\t\t\t\t() => fail(),\n\t\t\t\t() => fail(),\n\t\t\t\tfieldKinds,\n\t\t\t);\n\t\t\tconst log: string[] = [];\n\t\t\tconst shape = fieldShaper(\n\t\t\t\t{\n\t\t\t\t\tshapeFromTree(schemaName: TreeNodeSchemaIdentifier): NodeEncoder {\n\t\t\t\t\t\tlog.push(schemaName);\n\t\t\t\t\t\treturn onlyTypeShape;\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t\tFlexFieldSchema.create(FieldKinds.required, [minimal]),\n\t\t\t\tcache,\n\t\t\t);\n\t\t\t// This is expected since this case should be optimized to just encode the inner shape.\n\t\t\tassert.equal(shape.shape, onlyTypeShape);\n\t\t\tconst buffer = checkFieldEncode(shape, cache, [\n\t\t\t\t{\n\t\t\t\t\ttype: minimal.name,\n\t\t\t\t},\n\t\t\t]);\n\t\t\tassert.deepEqual(buffer, [new IdentifierToken(\"test.minimal\")]);\n\t\t});\n\n\t\tit(\"polymorphic-value\", () => {\n\t\t\tconst cache = new EncoderCache(\n\t\t\t\t() => anyNodeShape,\n\t\t\t\t() => fail(),\n\t\t\t\tfieldKinds,\n\t\t\t);\n\t\t\tconst log: string[] = [];\n\t\t\tconst shape = fieldShaper(\n\t\t\t\t{\n\t\t\t\t\tshapeFromTree(schemaName: TreeNodeSchemaIdentifier): NodeEncoder {\n\t\t\t\t\t\tlog.push(schemaName);\n\t\t\t\t\t\treturn onlyTypeShape;\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t\tFlexFieldSchema.create(FieldKinds.required, [minimal, leaf.number]),\n\t\t\t\tcache,\n\t\t\t);\n\t\t\t// There are multiple choices about how this case should be optimized, but the current implementation does this:\n\t\t\tassert.equal(shape.shape, AnyShape.instance);\n\t\t\tcheckFieldEncode(shape, cache, [{ type: minimal.name }]);\n\t\t\tcheckFieldEncode(shape, cache, [{ type: brand(\"numeric\"), value: 1 }]);\n\t\t});\n\n\t\tit(\"sequence\", () => {\n\t\t\tconst cache = new EncoderCache(\n\t\t\t\t() => fail(),\n\t\t\t\t() => fail(),\n\t\t\t\tfieldKinds,\n\t\t\t);\n\t\t\tconst log: string[] = [];\n\t\t\tconst shape = fieldShaper(\n\t\t\t\t{\n\t\t\t\t\tshapeFromTree(schemaName: TreeNodeSchemaIdentifier): NodeEncoder {\n\t\t\t\t\t\tlog.push(schemaName);\n\t\t\t\t\t\treturn onlyTypeShape;\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t\tFlexFieldSchema.create(FieldKinds.sequence, [minimal]),\n\t\t\t\tcache,\n\t\t\t);\n\t\t\t// There are multiple choices about how this case should be optimized, but the current implementation does this:\n\t\t\tassert.equal(shape.shape, cache.nestedArray(onlyTypeShape));\n\t\t\tassert.deepEqual(checkFieldEncode(shape, cache, []), [0]);\n\t\t\tassert.deepEqual(checkFieldEncode(shape, cache, [{ type: minimal.name }]), [\n\t\t\t\t[new IdentifierToken(\"test.minimal\")],\n\t\t\t]);\n\t\t\tassert.deepEqual(\n\t\t\t\tcheckFieldEncode(shape, cache, [{ type: minimal.name }, { type: minimal.name }]),\n\t\t\t\t[[new IdentifierToken(\"test.minimal\"), new IdentifierToken(\"test.minimal\")]],\n\t\t\t);\n\t\t});\n\t});\n\n\tdescribe(\"treeShaper\", () => {\n\t\tit(\"minimal\", () => {\n\t\t\tconst cache = new EncoderCache(\n\t\t\t\t() => fail(),\n\t\t\t\t() => fail(),\n\t\t\t\tfieldKinds,\n\t\t\t);\n\t\t\tconst shape = treeShaper(\n\t\t\t\tstoredLibrary,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\t{ shapeFromField: () => fail() },\n\t\t\t\tminimal.name,\n\t\t\t);\n\t\t\tconst buffer = checkNodeEncode(shape, cache, { type: minimal.name });\n\t\t\tassert.deepEqual(buffer, []);\n\t\t});\n\n\t\tit(\"hasOptionalField\", () => {\n\t\t\tconst cache = new EncoderCache(\n\t\t\t\t() => fail(),\n\t\t\t\t() => fail(),\n\t\t\t\tfieldKinds,\n\t\t\t);\n\t\t\tconst log: TreeFieldStoredSchema[] = [];\n\t\t\tconst shape = treeShaper(\n\t\t\t\tstoredLibrary,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\t{\n\t\t\t\t\tshapeFromField(field: TreeFieldStoredSchema): FieldEncoder {\n\t\t\t\t\t\tlog.push(field);\n\t\t\t\t\t\treturn cache.nestedArray(numericShape);\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t\thasOptionalField.name,\n\t\t\t);\n\t\t\tassert.deepEqual(\n\t\t\t\tshape,\n\t\t\t\tnew NodeShape(\n\t\t\t\t\thasOptionalField.name,\n\t\t\t\t\tfalse,\n\t\t\t\t\t[{ key: brand(\"field\"), shape: cache.nestedArray(numericShape) }],\n\t\t\t\t\tundefined,\n\t\t\t\t),\n\t\t\t);\n\t\t\tconst bufferEmpty = checkNodeEncode(shape, cache, { type: hasOptionalField.name });\n\t\t\tassert.deepEqual(bufferEmpty, [0]);\n\t\t\tconst bufferFull = checkNodeEncode(shape, cache, {\n\t\t\t\ttype: hasOptionalField.name,\n\t\t\t\tfields: { field: [{ type: leaf.number.name, value: 5 }] },\n\t\t\t});\n\t\t\tassert.deepEqual(bufferFull, [[5]]);\n\t\t});\n\n\t\tit(\"hasExtraField\", () => {\n\t\t\tconst cache = new EncoderCache(\n\t\t\t\t() => fail(),\n\t\t\t\t() => fail(),\n\t\t\t\tfieldKinds,\n\t\t\t);\n\t\t\tconst log: TreeFieldStoredSchema[] = [];\n\t\t\tconst shape = treeShaper(\n\t\t\t\tstoredLibrary,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\t{\n\t\t\t\t\tshapeFromField(field: TreeFieldStoredSchema): FieldEncoder {\n\t\t\t\t\t\tlog.push(field);\n\t\t\t\t\t\treturn cache.nestedArray(numericShape);\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t\tnumericMap.name,\n\t\t\t);\n\t\t\tassert.deepEqual(\n\t\t\t\tshape,\n\t\t\t\tnew NodeShape(numericMap.name, false, [], cache.nestedArray(numericShape)),\n\t\t\t);\n\t\t\tconst bufferEmpty = checkNodeEncode(shape, cache, { type: numericMap.name });\n\t\t\tassert.deepEqual(bufferEmpty, [[]]);\n\t\t\tconst bufferFull = checkNodeEncode(shape, cache, {\n\t\t\t\ttype: numericMap.name,\n\t\t\t\tfields: { extra: [{ type: leaf.number.name, value: 5 }] },\n\t\t\t});\n\t\t\tassert.deepEqual(bufferFull, [[new IdentifierToken(\"extra\"), [5]]]);\n\t\t});\n\t});\n\n\tit(\"recursiveType\", () => {\n\t\tconst cache = buildCache(storedLibrary, defaultSchemaPolicy);\n\t\tconst shape = cache.shapeFromTree(recursiveType.name);\n\t\tconst bufferEmpty = checkNodeEncode(shape, cache, { type: recursiveType.name });\n\t\tassert.deepEqual(bufferEmpty, [0]);\n\t\tconst bufferFull = checkNodeEncode(shape, cache, {\n\t\t\ttype: recursiveType.name,\n\t\t\tfields: { field: [{ type: recursiveType.name }] },\n\t\t});\n\t\tassert.deepEqual(bufferFull, [[0]]);\n\t});\n\n\tdescribe(\"test trees\", () => {\n\t\tuseSnapshotDirectory(\"chunked-forest-schema-compressed\");\n\t\t// TODO: test non size 1 batches\n\t\tfor (const { name, treeFactory, schemaData } of testTrees) {\n\t\t\tit(name, () => {\n\t\t\t\tconst storedSchema = intoStoredSchema(schemaData);\n\t\t\t\tconst tree = treeFactory();\n\t\t\t\t// Check with checkFieldEncode\n\t\t\t\tconst cache = buildCache(storedSchema, defaultSchemaPolicy);\n\t\t\t\tcheckFieldEncode(anyFieldEncoder, cache, tree);\n\n\t\t\t\tconst context: FieldBatchEncodingContext = {\n\t\t\t\t\tencodeType: TreeCompressionStrategy.Compressed,\n\t\t\t\t\tschema: { schema: storedSchema, policy: defaultSchemaPolicy },\n\t\t\t\t};\n\t\t\t\tconst codec = makeFieldBatchCodec({ jsonValidator: ajvValidator });\n\t\t\t\t// End to end test\n\t\t\t\tconst encoded = codec.encode([cursorForJsonableTreeField(tree)], context);\n\t\t\t\tconst result = codec.decode(encoded, context);\n\t\t\t\tconst resultTree = result.map(jsonableTreesFromFieldCursor);\n\t\t\t\tassert.deepEqual(resultTree, [tree]);\n\n\t\t\t\t// This snapshot makes it clear when the format changes.\n\t\t\t\t// This can include compression/heuristic changes which are non breaking,\n\t\t\t\t// but does not handle ensuring different old versions stull load (for example encoded with different heuristics).\n\t\t\t\t// TODO: add a new test suite with a library of encoded test data which we can parse to cover that.\n\n\t\t\t\tconst dataStr = JSON.stringify(\n\t\t\t\t\tencoded,\n\t\t\t\t\t// The mock handle doesn't stringify deterministically, so replace it:\n\t\t\t\t\t(key, value: JsonCompatibleReadOnly) =>\n\t\t\t\t\t\tisFluidHandle(value) ? \"Handle Placeholder\" : value,\n\t\t\t\t\t2,\n\t\t\t\t);\n\t\t\t\ttakeSnapshot(dataStr, `.json`);\n\t\t\t});\n\t\t}\n\t});\n});\n"]}

package/lib/test/feature-libraries/chunked-forest/codec/uncompressedEncode.spec.d.ts

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

package/lib/test/feature-libraries/chunked-forest/codec/uncompressedEncode.spec.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"uncompressedEncode.spec.d.ts","sourceRoot":"","sources":["../../../../../src/test/feature-libraries/chunked-forest/codec/uncompressedEncode.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/feature-libraries/chunked-forest/codec/uncompressedEncode.spec.js

@@ -1,29 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { makeFieldBatchCodec,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../../feature-libraries/chunked-forest/codec/codecs.js";
-import { testTrees } from "../../../cursorTestSuite.js";
-import { jsonableTreesFromFieldCursor } from "../fieldCursorTestUtilities.js";
-import { TreeCompressionStrategy, cursorForJsonableTreeField, } from "../../../../feature-libraries/index.js";
-import { ajvValidator } from "../../../codec/index.js";
-describe("uncompressedEncode", () => {
-    // TODO: test non size 1 batches
-    describe("test trees", () => {
-        for (const [name, jsonable] of testTrees) {
-            it(name, () => {
-                const input = cursorForJsonableTreeField([jsonable]);
-                const context = { encodeType: TreeCompressionStrategy.Uncompressed };
-                const codec = makeFieldBatchCodec({ jsonValidator: ajvValidator });
-                const result = codec.encode([input], context);
-                const decoded = codec.decode(result, context);
-                const decodedJson = decoded.map(jsonableTreesFromFieldCursor);
-                assert.deepEqual([[jsonable]], decodedJson);
-            });
-        }
-    });
-});
-//# sourceMappingURL=uncompressedEncode.spec.js.map

package/lib/test/feature-libraries/chunked-forest/codec/uncompressedEncode.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"uncompressedEncode.spec.js","sourceRoot":"","sources":["../../../../../src/test/feature-libraries/chunked-forest/codec/uncompressedEncode.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EACN,mBAAmB;AACnB,sDAAsD;EACtD,MAAM,8DAA8D,CAAC;AACtE,OAAO,EAAE,SAAS,EAAE,MAAM,6BAA6B,CAAC;AACxD,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EACN,uBAAuB,EACvB,0BAA0B,GAC1B,MAAM,wCAAwC,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAEvD,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IACnC,gCAAgC;IAChC,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,SAAS,EAAE;YACzC,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;gBACb,MAAM,KAAK,GAAG,0BAA0B,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACrD,MAAM,OAAO,GAAG,EAAE,UAAU,EAAE,uBAAuB,CAAC,YAAY,EAAE,CAAC;gBACrE,MAAM,KAAK,GAAG,mBAAmB,CAAC,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC;gBACnE,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;gBAC9C,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;gBAC9C,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC;gBAC9D,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;YAC7C,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport {\n\tmakeFieldBatchCodec,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../../feature-libraries/chunked-forest/codec/codecs.js\";\nimport { testTrees } from \"../../../cursorTestSuite.js\";\nimport { jsonableTreesFromFieldCursor } from \"../fieldCursorTestUtilities.js\";\nimport {\n\tTreeCompressionStrategy,\n\tcursorForJsonableTreeField,\n} from \"../../../../feature-libraries/index.js\";\nimport { ajvValidator } from \"../../../codec/index.js\";\n\ndescribe(\"uncompressedEncode\", () => {\n\t// TODO: test non size 1 batches\n\tdescribe(\"test trees\", () => {\n\t\tfor (const [name, jsonable] of testTrees) {\n\t\t\tit(name, () => {\n\t\t\t\tconst input = cursorForJsonableTreeField([jsonable]);\n\t\t\t\tconst context = { encodeType: TreeCompressionStrategy.Uncompressed };\n\t\t\t\tconst codec = makeFieldBatchCodec({ jsonValidator: ajvValidator });\n\t\t\t\tconst result = codec.encode([input], context);\n\t\t\t\tconst decoded = codec.decode(result, context);\n\t\t\t\tconst decodedJson = decoded.map(jsonableTreesFromFieldCursor);\n\t\t\t\tassert.deepEqual([[jsonable]], decodedJson);\n\t\t\t});\n\t\t}\n\t});\n});\n"]}

package/lib/test/feature-libraries/chunked-forest/fieldCursorTestUtilities.d.ts

@@ -1,12 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { FieldUpPath, ITreeCursorSynchronous, JsonableTree } from "../../../core/index.js";
-import { TreeChunk } from "../../../feature-libraries/index.js";
-export declare function jsonableTreesFromFieldCursor(cursor: ITreeCursorSynchronous): JsonableTree[];
-export declare function numberSequenceField(length: number): JsonableTree[];
-export declare function assertChunkCursorEquals(chunk: TreeChunk, expected: JsonableTree[]): void;
-export declare function assertChunkCursorBatchEquals(chunk: TreeChunk[], expected: JsonableTree[][]): void;
-export declare function validateChunkCursor(chunk: TreeChunk, expected: JsonableTree[], expectedPath?: FieldUpPath): void;
-//# sourceMappingURL=fieldCursorTestUtilities.d.ts.map

package/lib/test/feature-libraries/chunked-forest/fieldCursorTestUtilities.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"fieldCursorTestUtilities.d.ts","sourceRoot":"","sources":["../../../../src/test/feature-libraries/chunked-forest/fieldCursorTestUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACN,WAAW,EACX,sBAAsB,EACtB,YAAY,EAGZ,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EAA0B,SAAS,EAAE,MAAM,qCAAqC,CAAC;AAGxF,wBAAgB,4BAA4B,CAAC,MAAM,EAAE,sBAAsB,GAAG,YAAY,EAAE,CAE3F;AAED,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,EAAE,CAMlE;AAED,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,GAAG,IAAI,CAIxF;AAED,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,QAAQ,EAAE,YAAY,EAAE,EAAE,GAAG,IAAI,CAKjG;AAED,wBAAgB,mBAAmB,CAClC,KAAK,EAAE,SAAS,EAChB,QAAQ,EAAE,YAAY,EAAE,EACxB,YAAY,GAAE,WAGb,GACC,IAAI,CAGN"}

package/lib/test/feature-libraries/chunked-forest/fieldCursorTestUtilities.js

@@ -1,38 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { mapCursorField, rootFieldKey, } from "../../../core/index.js";
-import { leaf } from "../../../domains/index.js";
-import { jsonableTreeFromCursor } from "../../../feature-libraries/index.js";
-import { checkFieldTraversal } from "../../cursorTestSuite.js";
-export function jsonableTreesFromFieldCursor(cursor) {
-    return mapCursorField(cursor, jsonableTreeFromCursor);
-}
-export function numberSequenceField(length) {
-    const field = [];
-    for (let index = 0; index < length; index++) {
-        field.push({ type: leaf.number.name, value: index });
-    }
-    return field;
-}
-export function assertChunkCursorEquals(chunk, expected) {
-    const result = jsonableTreesFromFieldCursor(chunk.cursor());
-    assert.deepEqual(result, expected);
-    assert.equal(chunk.topLevelLength, expected.length);
-}
-export function assertChunkCursorBatchEquals(chunk, expected) {
-    assert.equal(chunk.length, expected.length);
-    for (let index = 0; index < chunk.length; index++) {
-        assertChunkCursorEquals(chunk[index], expected[index]);
-    }
-}
-export function validateChunkCursor(chunk, expected, expectedPath = {
-    field: rootFieldKey,
-    parent: undefined,
-}) {
-    checkFieldTraversal(chunk.cursor(), expectedPath);
-    assertChunkCursorEquals(chunk, expected);
-}
-//# sourceMappingURL=fieldCursorTestUtilities.js.map

package/lib/test/feature-libraries/chunked-forest/fieldCursorTestUtilities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fieldCursorTestUtilities.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/chunked-forest/fieldCursorTestUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAIN,cAAc,EACd,YAAY,GACZ,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,IAAI,EAAE,MAAM,2BAA2B,CAAC;AACjD,OAAO,EAAE,sBAAsB,EAAa,MAAM,qCAAqC,CAAC;AACxF,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAE/D,MAAM,UAAU,4BAA4B,CAAC,MAA8B;IAC1E,OAAO,cAAc,CAAC,MAAM,EAAE,sBAAsB,CAAC,CAAC;AACvD,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,MAAc;IACjD,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE;QAC5C,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;KACrD;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,KAAgB,EAAE,QAAwB;IACjF,MAAM,MAAM,GAAG,4BAA4B,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACnC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;AACrD,CAAC;AAED,MAAM,UAAU,4BAA4B,CAAC,KAAkB,EAAE,QAA0B;IAC1F,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC5C,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;QAClD,uBAAuB,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;KACvD;AACF,CAAC;AAED,MAAM,UAAU,mBAAmB,CAClC,KAAgB,EAChB,QAAwB,EACxB,eAA4B;IAC3B,KAAK,EAAE,YAAY;IACnB,MAAM,EAAE,SAAS;CACjB;IAED,mBAAmB,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,YAAY,CAAC,CAAC;IAClD,uBAAuB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;AAC1C,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport {\n\tFieldUpPath,\n\tITreeCursorSynchronous,\n\tJsonableTree,\n\tmapCursorField,\n\trootFieldKey,\n} from \"../../../core/index.js\";\nimport { leaf } from \"../../../domains/index.js\";\nimport { jsonableTreeFromCursor, TreeChunk } from \"../../../feature-libraries/index.js\";\nimport { checkFieldTraversal } from \"../../cursorTestSuite.js\";\n\nexport function jsonableTreesFromFieldCursor(cursor: ITreeCursorSynchronous): JsonableTree[] {\n\treturn mapCursorField(cursor, jsonableTreeFromCursor);\n}\n\nexport function numberSequenceField(length: number): JsonableTree[] {\n\tconst field: JsonableTree[] = [];\n\tfor (let index = 0; index < length; index++) {\n\t\tfield.push({ type: leaf.number.name, value: index });\n\t}\n\treturn field;\n}\n\nexport function assertChunkCursorEquals(chunk: TreeChunk, expected: JsonableTree[]): void {\n\tconst result = jsonableTreesFromFieldCursor(chunk.cursor());\n\tassert.deepEqual(result, expected);\n\tassert.equal(chunk.topLevelLength, expected.length);\n}\n\nexport function assertChunkCursorBatchEquals(chunk: TreeChunk[], expected: JsonableTree[][]): void {\n\tassert.equal(chunk.length, expected.length);\n\tfor (let index = 0; index < chunk.length; index++) {\n\t\tassertChunkCursorEquals(chunk[index], expected[index]);\n\t}\n}\n\nexport function validateChunkCursor(\n\tchunk: TreeChunk,\n\texpected: JsonableTree[],\n\texpectedPath: FieldUpPath = {\n\t\tfield: rootFieldKey,\n\t\tparent: undefined,\n\t},\n): void {\n\tcheckFieldTraversal(chunk.cursor(), expectedPath);\n\tassertChunkCursorEquals(chunk, expected);\n}\n"]}

package/lib/test/feature-libraries/chunked-forest/uniformChunk.spec.d.ts

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

package/lib/test/feature-libraries/chunked-forest/uniformChunk.spec.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"uniformChunk.spec.d.ts","sourceRoot":"","sources":["../../../../src/test/feature-libraries/chunked-forest/uniformChunk.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/feature-libraries/chunked-forest/uniformChunk.spec.js

@@ -1,138 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { benchmark, BenchmarkType } from "@fluid-tools/benchmark";
-import { uniformChunk, TreeShape,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/chunked-forest/uniformChunk.js";
-import { mapSchema, testSpecializedFieldCursor } from "../../cursorTestSuite.js";
-import { cursorToJsonObject, singleJsonCursor } from "../../../domains/index.js";
-import { EmptyKey } from "../../../core/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { sum } from "../../domains/json/benchmarks.js";
-import { jsonableTreeFromCursor, mapTreeFromCursor, cursorForMapTreeNode, cursorForJsonableTreeNode, } from "../../../feature-libraries/index.js";
-import { emptyShape, polygonTree, testData, xField, yField } from "./uniformChunkTestData.js";
-// Validate a few aspects of shapes that are easier to verify here than via checking the cursor.
-function validateShape(shape) {
-    shape.positions.forEach((info, positionIndex) => {
-        if (info === undefined) {
-            return;
-        }
-        assert.equal(info.parent, info.indexOfParentPosition === undefined
-            ? undefined
-            : shape.positions[info.indexOfParentPosition]);
-        for (const [k, v] of info.shape.fields) {
-            for (let index = 0; index < v.topLevelLength; index++) {
-                // TODO: if we keep all the duplicated position info, inline positionIndex into field offsets to save the addition.
-                const offset = v.offset + index * v.shape.positions.length;
-                const element = shape.positions[offset + positionIndex];
-                assert(element !== undefined);
-                assert.equal(element.parentIndex, index);
-                assert.equal(element.parentField, k);
-                assert.equal(element.parent, info);
-            }
-        }
-    });
-}
-describe("uniformChunk", () => {
-    describe("shapes", () => {
-        for (const tree of testData) {
-            it(`validate shape for ${tree.name}`, () => {
-                validateShape(tree.dataFactory().shape);
-            });
-        }
-    });
-    testSpecializedFieldCursor({
-        cursorName: "uniformChunk",
-        builders: {
-            withKeys: (keys) => {
-                const schema = mapSchema.name;
-                const withKeysShape = new TreeShape(schema, false, keys.map((key) => [key, emptyShape, 1]));
-                return uniformChunk(withKeysShape.withTopLevelLength(1), []);
-            },
-        },
-        cursorFactory: (data) => data.cursor(),
-        testData,
-    });
-    const cursorSources = [
-        {
-            name: "uniformChunk",
-            factory: (data) => {
-                const cursor = data.cursor();
-                cursor.enterNode(0);
-                return cursor;
-            },
-        },
-        {
-            name: "jsonable",
-            factory: (data) => {
-                const cursor = data.cursor();
-                cursor.enterNode(0);
-                return cursorForJsonableTreeNode(jsonableTreeFromCursor(cursor));
-            },
-        },
-        {
-            name: "mapTree",
-            factory: (data) => {
-                const cursor = data.cursor();
-                cursor.enterNode(0);
-                return cursorForMapTreeNode(mapTreeFromCursor(cursor));
-            },
-        },
-        {
-            name: "json",
-            factory: (data) => {
-                const cursor = data.cursor();
-                cursor.enterNode(0);
-                return singleJsonCursor(cursorToJsonObject(cursor));
-            },
-        },
-    ];
-    for (const { name: cursorName, factory } of cursorSources) {
-        describe(`${cursorName} bench`, () => {
-            let cursor;
-            for (const { name, dataFactory: data } of testData) {
-                benchmark({
-                    type: BenchmarkType.Measurement,
-                    title: `Sum: '${name}'`,
-                    before: () => {
-                        cursor = factory(data());
-                    },
-                    benchmarkFn: () => {
-                        sum(cursor);
-                    },
-                });
-            }
-            benchmark({
-                type: BenchmarkType.Measurement,
-                title: "Polygon access",
-                before: () => {
-                    cursor = polygonTree.dataFactory().cursor();
-                    cursor.enterNode(0);
-                },
-                benchmarkFn: () => {
-                    let x = 0;
-                    let y = 0;
-                    cursor.enterField(EmptyKey);
-                    for (let inNodes = cursor.firstNode(); inNodes; inNodes = cursor.nextNode()) {
-                        cursor.enterField(xField);
-                        cursor.enterNode(0);
-                        x += cursor.value;
-                        cursor.exitNode();
-                        cursor.exitField();
-                        cursor.enterField(yField);
-                        cursor.enterNode(0);
-                        y += cursor.value;
-                        cursor.exitNode();
-                        cursor.exitField();
-                    }
-                    cursor.exitField();
-                    const _result = x + y;
-                },
-            });
-        });
-    }
-});
-//# sourceMappingURL=uniformChunk.spec.js.map

package/lib/test/feature-libraries/chunked-forest/uniformChunk.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"uniformChunk.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/chunked-forest/uniformChunk.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EACN,YAAY,EACZ,SAAS;AAET,sDAAsD;EACtD,MAAM,2DAA2D,CAAC;AACnE,OAAO,EAAE,SAAS,EAAE,0BAA0B,EAAE,MAAM,0BAA0B,CAAC;AACjF,OAAO,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AACjF,OAAO,EAAE,QAAQ,EAAoD,MAAM,wBAAwB,CAAC;AACpG,sDAAsD;AACtD,OAAO,EAAE,GAAG,EAAE,MAAM,kCAAkC,CAAC;AACvD,OAAO,EACN,sBAAsB,EACtB,iBAAiB,EACjB,oBAAoB,EACpB,yBAAyB,GAEzB,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAE9F,gGAAgG;AAChG,SAAS,aAAa,CAAC,KAAiB;IACvC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,aAAa,EAAE,EAAE;QAC/C,IAAI,IAAI,KAAK,SAAS,EAAE;YACvB,OAAO;SACP;QACD,MAAM,CAAC,KAAK,CACX,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,qBAAqB,KAAK,SAAS;YACvC,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAC9C,CAAC;QACF,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YACvC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,cAAc,EAAE,KAAK,EAAE,EAAE;gBACtD,mHAAmH;gBACnH,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC;gBAC3D,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,aAAa,CAAC,CAAC;gBACxD,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;gBACzC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;aACnC;SACD;IACF,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC7B,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC5B,EAAE,CAAC,sBAAsB,IAAI,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE;gBAC1C,aAAa,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,0BAA0B,CAAoC;QAC7D,UAAU,EAAE,cAAc;QAC1B,QAAQ,EAAE;YACT,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;gBAClB,MAAM,MAAM,GAA6B,SAAS,CAAC,IAAI,CAAC;gBACxD,MAAM,aAAa,GAAG,IAAI,SAAS,CAClC,MAAM,EACN,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,UAAU,EAAE,CAAC,CAAU,CAAC,CAChD,CAAC;gBACF,OAAO,YAAY,CAAC,aAAa,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC9D,CAAC;SACD;QACD,aAAa,EAAE,CAAC,IAAe,EAA0B,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE;QACzE,QAAQ;KACR,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG;QACrB;YACC,IAAI,EAAE,cAAc;YACpB,OAAO,EAAE,CAAC,IAAe,EAAE,EAAE;gBAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACpB,OAAO,MAAM,CAAC;YACf,CAAC;SACD;QACD;YACC,IAAI,EAAE,UAAU;YAChB,OAAO,EAAE,CAAC,IAAe,EAAE,EAAE;gBAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACpB,OAAO,yBAAyB,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC,CAAC;YAClE,CAAC;SACD;QACD;YACC,IAAI,EAAE,SAAS;YACf,OAAO,EAAE,CAAC,IAAe,EAAE,EAAE;gBAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACpB,OAAO,oBAAoB,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;YACxD,CAAC;SACD;QACD;YACC,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,CAAC,IAAe,EAAE,EAAE;gBAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACpB,OAAO,gBAAgB,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC;YACrD,CAAC;SACD;KACD,CAAC;IAEF,KAAK,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,IAAI,aAAa,EAAE;QAC1D,QAAQ,CAAC,GAAG,UAAU,QAAQ,EAAE,GAAG,EAAE;YACpC,IAAI,MAA8B,CAAC;YACnC,KAAK,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,IAAI,QAAQ,EAAE;gBACnD,SAAS,CAAC;oBACT,IAAI,EAAE,aAAa,CAAC,WAAW;oBAC/B,KAAK,EAAE,SAAS,IAAI,GAAG;oBACvB,MAAM,EAAE,GAAG,EAAE;wBACZ,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;oBAC1B,CAAC;oBACD,WAAW,EAAE,GAAG,EAAE;wBACjB,GAAG,CAAC,MAAM,CAAC,CAAC;oBACb,CAAC;iBACD,CAAC,CAAC;aACH;YAED,SAAS,CAAC;gBACT,IAAI,EAAE,aAAa,CAAC,WAAW;gBAC/B,KAAK,EAAE,gBAAgB;gBACvB,MAAM,EAAE,GAAG,EAAE;oBACZ,MAAM,GAAG,WAAW,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE,CAAC;oBAC5C,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACrB,CAAC;gBACD,WAAW,EAAE,GAAG,EAAE;oBACjB,IAAI,CAAC,GAAG,CAAC,CAAC;oBACV,IAAI,CAAC,GAAG,CAAC,CAAC;oBACV,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;oBAC5B,KAAK,IAAI,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE;wBAC5E,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;wBAC1B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBACpB,CAAC,IAAI,MAAM,CAAC,KAAe,CAAC;wBAC5B,MAAM,CAAC,QAAQ,EAAE,CAAC;wBAClB,MAAM,CAAC,SAAS,EAAE,CAAC;wBACnB,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;wBAC1B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBACpB,CAAC,IAAI,MAAM,CAAC,KAAe,CAAC;wBAC5B,MAAM,CAAC,QAAQ,EAAE,CAAC;wBAClB,MAAM,CAAC,SAAS,EAAE,CAAC;qBACnB;oBACD,MAAM,CAAC,SAAS,EAAE,CAAC;oBACnB,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;gBACvB,CAAC;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;KACH;AACF,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { benchmark, BenchmarkType } from \"@fluid-tools/benchmark\";\nimport {\n\tuniformChunk,\n\tTreeShape,\n\tChunkShape,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/chunked-forest/uniformChunk.js\";\nimport { mapSchema, testSpecializedFieldCursor } from \"../../cursorTestSuite.js\";\nimport { cursorToJsonObject, singleJsonCursor } from \"../../../domains/index.js\";\nimport { EmptyKey, ITreeCursorSynchronous, TreeNodeSchemaIdentifier } from \"../../../core/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { sum } from \"../../domains/json/benchmarks.js\";\nimport {\n\tjsonableTreeFromCursor,\n\tmapTreeFromCursor,\n\tcursorForMapTreeNode,\n\tcursorForJsonableTreeNode,\n\tTreeChunk,\n} from \"../../../feature-libraries/index.js\";\nimport { emptyShape, polygonTree, testData, xField, yField } from \"./uniformChunkTestData.js\";\n\n// Validate a few aspects of shapes that are easier to verify here than via checking the cursor.\nfunction validateShape(shape: ChunkShape): void {\n\tshape.positions.forEach((info, positionIndex) => {\n\t\tif (info === undefined) {\n\t\t\treturn;\n\t\t}\n\t\tassert.equal(\n\t\t\tinfo.parent,\n\t\t\tinfo.indexOfParentPosition === undefined\n\t\t\t\t? undefined\n\t\t\t\t: shape.positions[info.indexOfParentPosition],\n\t\t);\n\t\tfor (const [k, v] of info.shape.fields) {\n\t\t\tfor (let index = 0; index < v.topLevelLength; index++) {\n\t\t\t\t// TODO: if we keep all the duplicated position info, inline positionIndex into field offsets to save the addition.\n\t\t\t\tconst offset = v.offset + index * v.shape.positions.length;\n\t\t\t\tconst element = shape.positions[offset + positionIndex];\n\t\t\t\tassert(element !== undefined);\n\t\t\t\tassert.equal(element.parentIndex, index);\n\t\t\t\tassert.equal(element.parentField, k);\n\t\t\t\tassert.equal(element.parent, info);\n\t\t\t}\n\t\t}\n\t});\n}\n\ndescribe(\"uniformChunk\", () => {\n\tdescribe(\"shapes\", () => {\n\t\tfor (const tree of testData) {\n\t\t\tit(`validate shape for ${tree.name}`, () => {\n\t\t\t\tvalidateShape(tree.dataFactory().shape);\n\t\t\t});\n\t\t}\n\t});\n\n\ttestSpecializedFieldCursor<TreeChunk, ITreeCursorSynchronous>({\n\t\tcursorName: \"uniformChunk\",\n\t\tbuilders: {\n\t\t\twithKeys: (keys) => {\n\t\t\t\tconst schema: TreeNodeSchemaIdentifier = mapSchema.name;\n\t\t\t\tconst withKeysShape = new TreeShape(\n\t\t\t\t\tschema,\n\t\t\t\t\tfalse,\n\t\t\t\t\tkeys.map((key) => [key, emptyShape, 1] as const),\n\t\t\t\t);\n\t\t\t\treturn uniformChunk(withKeysShape.withTopLevelLength(1), []);\n\t\t\t},\n\t\t},\n\t\tcursorFactory: (data: TreeChunk): ITreeCursorSynchronous => data.cursor(),\n\t\ttestData,\n\t});\n\n\tconst cursorSources = [\n\t\t{\n\t\t\tname: \"uniformChunk\",\n\t\t\tfactory: (data: TreeChunk) => {\n\t\t\t\tconst cursor = data.cursor();\n\t\t\t\tcursor.enterNode(0);\n\t\t\t\treturn cursor;\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"jsonable\",\n\t\t\tfactory: (data: TreeChunk) => {\n\t\t\t\tconst cursor = data.cursor();\n\t\t\t\tcursor.enterNode(0);\n\t\t\t\treturn cursorForJsonableTreeNode(jsonableTreeFromCursor(cursor));\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"mapTree\",\n\t\t\tfactory: (data: TreeChunk) => {\n\t\t\t\tconst cursor = data.cursor();\n\t\t\t\tcursor.enterNode(0);\n\t\t\t\treturn cursorForMapTreeNode(mapTreeFromCursor(cursor));\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"json\",\n\t\t\tfactory: (data: TreeChunk) => {\n\t\t\t\tconst cursor = data.cursor();\n\t\t\t\tcursor.enterNode(0);\n\t\t\t\treturn singleJsonCursor(cursorToJsonObject(cursor));\n\t\t\t},\n\t\t},\n\t];\n\n\tfor (const { name: cursorName, factory } of cursorSources) {\n\t\tdescribe(`${cursorName} bench`, () => {\n\t\t\tlet cursor: ITreeCursorSynchronous;\n\t\t\tfor (const { name, dataFactory: data } of testData) {\n\t\t\t\tbenchmark({\n\t\t\t\t\ttype: BenchmarkType.Measurement,\n\t\t\t\t\ttitle: `Sum: '${name}'`,\n\t\t\t\t\tbefore: () => {\n\t\t\t\t\t\tcursor = factory(data());\n\t\t\t\t\t},\n\t\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\t\tsum(cursor);\n\t\t\t\t\t},\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tbenchmark({\n\t\t\t\ttype: BenchmarkType.Measurement,\n\t\t\t\ttitle: \"Polygon access\",\n\t\t\t\tbefore: () => {\n\t\t\t\t\tcursor = polygonTree.dataFactory().cursor();\n\t\t\t\t\tcursor.enterNode(0);\n\t\t\t\t},\n\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\tlet x = 0;\n\t\t\t\t\tlet y = 0;\n\t\t\t\t\tcursor.enterField(EmptyKey);\n\t\t\t\t\tfor (let inNodes = cursor.firstNode(); inNodes; inNodes = cursor.nextNode()) {\n\t\t\t\t\t\tcursor.enterField(xField);\n\t\t\t\t\t\tcursor.enterNode(0);\n\t\t\t\t\t\tx += cursor.value as number;\n\t\t\t\t\t\tcursor.exitNode();\n\t\t\t\t\t\tcursor.exitField();\n\t\t\t\t\t\tcursor.enterField(yField);\n\t\t\t\t\t\tcursor.enterNode(0);\n\t\t\t\t\t\ty += cursor.value as number;\n\t\t\t\t\t\tcursor.exitNode();\n\t\t\t\t\t\tcursor.exitField();\n\t\t\t\t\t}\n\t\t\t\t\tcursor.exitField();\n\t\t\t\t\tconst _result = x + y;\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t}\n});\n"]}

package/lib/test/feature-libraries/chunked-forest/uniformChunkTestData.d.ts

@@ -1,34 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { TreeShape, UniformChunk } from "../../../feature-libraries/chunked-forest/uniformChunk.js";
-import { TestField } from "../../cursorTestSuite.js";
-import { FieldKey } from "../../../core/index.js";
-export declare const emptyShape: TreeShape;
-export declare const xField: FieldKey;
-export declare const yField: FieldKey;
-export declare const polygonTree: {
-    readonly name: "polygon";
-    readonly dataFactory: () => UniformChunk;
-    readonly reference: {
-        readonly type: import("../../../core/index.js").TreeNodeSchemaIdentifier<"com.fluidframework.json.array">;
-        readonly fields: {
-            readonly [x: string]: {
-                type: import("../../../core/index.js").TreeNodeSchemaIdentifier<"com.fluidframework.json.object">;
-                fields: {
-                    x: {
-                        type: import("../../../core/index.js").TreeNodeSchemaIdentifier<"com.fluidframework.leaf.number">;
-                        value: number;
-                    }[];
-                    y: {
-                        type: import("../../../core/index.js").TreeNodeSchemaIdentifier<"com.fluidframework.leaf.number">;
-                        value: number;
-                    }[];
-                };
-            }[];
-        };
-    };
-};
-export declare const testData: readonly TestField<UniformChunk>[];
-//# sourceMappingURL=uniformChunkTestData.d.ts.map

package/lib/test/feature-libraries/chunked-forest/uniformChunkTestData.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"uniformChunkTestData.d.ts","sourceRoot":"","sources":["../../../../src/test/feature-libraries/chunked-forest/uniformChunkTestData.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,SAAS,EACT,YAAY,EAEZ,MAAM,2DAA2D,CAAC;AACnE,OAAO,EAAE,SAAS,EAAe,MAAM,0BAA0B,CAAC;AAGlE,OAAO,EAAY,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAI5D,eAAO,MAAM,UAAU,WAA6C,CAAC;AAErE,eAAO,MAAM,MAAM,EAAE,QAAqB,CAAC;AAC3C,eAAO,MAAM,MAAM,EAAE,QAAqB,CAAC;AAc3C,eAAO,MAAM,WAAW;;;;;;;;;;;;;;;;;;;;;CAmBd,CAAC;AAsEX,eAAO,MAAM,QAAQ,EAAE,SAAS,SAAS,CAAC,YAAY,CAAC,EAStD,CAAC"}