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

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

@@ -1,161 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { mapSchema, testGeneralPurposeTreeCursor, testSpecializedFieldCursor, } from "../../cursorTestSuite.js";
-import { EmptyKey, } from "../../../core/index.js";
-import { jsonableTreeFromCursor, cursorForJsonableTreeNode, chunkTree, } from "../../../feature-libraries/index.js";
-import { brand, ReferenceCountedBase } from "../../../util/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { uniformChunk } from "../../../feature-libraries/chunked-forest/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { BasicChunk } from "../../../feature-libraries/chunked-forest/basicChunk.js";
-import { basicChunkTree, basicOnlyChunkPolicy, chunkField,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/chunked-forest/chunkTree.js";
-// eslint-disable-next-line import/no-internal-modules
-import { SequenceChunk } from "../../../feature-libraries/chunked-forest/sequenceChunk.js";
-import { leaf } from "../../../domains/index.js";
-import { emptyShape, testData } from "./uniformChunkTestData.js";
-import { numberSequenceField, validateChunkCursor } from "./fieldCursorTestUtilities.js";
-describe("basic chunk", () => {
-    it("calling chunkTree on existing chunk adds a reference", () => {
-        const data = { type: brand("Foo"), value: "test" };
-        const inputCursor = cursorForJsonableTreeNode(data);
-        const chunk = chunkTree(inputCursor, basicOnlyChunkPolicy);
-        assert(!chunk.isShared(), "newly created chunk should not have more than one reference");
-        const chunkCursor = chunk.cursor();
-        chunkCursor.firstNode();
-        const newChunk = chunkTree(chunkCursor, basicOnlyChunkPolicy);
-        assert(newChunk.isShared() && chunk.isShared(), "chunk created off of existing chunk should be shared");
-    });
-    it("calling chunkField on existing chunk adds a reference", () => {
-        const data = { type: brand("Foo"), value: "test" };
-        const inputCursor = cursorForJsonableTreeNode(data);
-        const chunk = chunkTree(inputCursor, basicOnlyChunkPolicy);
-        assert(!chunk.isShared(), "newly created chunk should not have more than one reference");
-        const chunkCursor = chunk.cursor();
-        const newChunk = chunkField(chunkCursor, basicOnlyChunkPolicy);
-        assert(newChunk[0].isShared() && chunk.isShared(), "chunk created off of existing chunk should be shared");
-    });
-    testGeneralPurposeTreeCursor("basic chunk", (data) => {
-        const inputCursor = cursorForJsonableTreeNode(data);
-        const chunk = basicChunkTree(inputCursor, basicOnlyChunkPolicy);
-        const cursor = chunk.cursor();
-        cursor.enterNode(0);
-        return cursor;
-    }, jsonableTreeFromCursor, true);
-    const schema = mapSchema.name;
-    const hybridData = [];
-    for (const data of testData) {
-        hybridData.push({
-            name: data.name,
-            dataFactory: () => new BasicChunk(schema, new Map([[EmptyKey, [data.dataFactory()]]])),
-            reference: [{ type: schema, fields: { [EmptyKey]: data.reference } }],
-            path: data.path,
-        });
-    }
-    testSpecializedFieldCursor({
-        cursorName: "basic chunk + uniform chunk",
-        builders: {
-            withKeys: (keys) => {
-                const withKeysShape = new BasicChunk(schema, new Map(keys.map((key) => [
-                    key,
-                    [uniformChunk(emptyShape.withTopLevelLength(1), [])],
-                ])));
-                return withKeysShape;
-            },
-        },
-        cursorFactory: (data) => data.cursor(),
-        testData: hybridData,
-    });
-    it("atRoot, not nested", () => {
-        const chunk = new BasicChunk(brand("Foo"), new Map([[EmptyKey, [numericBasicChunk()]]]));
-        const cursor = chunk.cursor();
-        assert(cursor.atChunkRoot());
-        cursor.enterNode(0);
-        assert(cursor.atChunkRoot());
-        cursor.enterField(EmptyKey);
-        assert(!cursor.atChunkRoot());
-        cursor.enterNode(0);
-        assert(!cursor.atChunkRoot());
-    });
-    it("atRoot, nested", () => {
-        const child0 = numericBasicChunk();
-        const child1 = new WrapperChunk(numericBasicChunk());
-        const chunk = new SequenceChunk([child0, child1]);
-        // Create a BasicChuncukCursor nested in a BasicChunkCursor.
-        const cursor = chunk.cursor();
-        assert(cursor.atChunkRoot());
-        cursor.enterNode(1);
-        assert(cursor.atChunkRoot());
-        cursor.enterField(EmptyKey);
-        assert(!cursor.atChunkRoot());
-    });
-    describe("SequenceChunk", () => {
-        it("root", () => {
-            validateChunkCursor(new SequenceChunk([numericBasicChunk(0)]), numberSequenceField(1));
-            validateChunkCursor(new SequenceChunk([numericBasicChunk(0), numericBasicChunk(1)]), numberSequenceField(2));
-            validateChunkCursor(new SequenceChunk([
-                numericBasicChunk(0),
-                numericBasicChunk(1),
-                numericBasicChunk(2),
-            ]), numberSequenceField(3));
-        });
-        it("nested", () => {
-            validateChunkCursor(new SequenceChunk([new SequenceChunk([numericBasicChunk(0)])]), numberSequenceField(1));
-            validateChunkCursor(new SequenceChunk([
-                numericBasicChunk(0),
-                new SequenceChunk([numericBasicChunk(1)]),
-            ]), numberSequenceField(2));
-            validateChunkCursor(new SequenceChunk([
-                new SequenceChunk([numericBasicChunk(0)]),
-                new SequenceChunk([numericBasicChunk(1)]),
-            ]), numberSequenceField(2));
-            validateChunkCursor(new SequenceChunk([
-                numericBasicChunk(0),
-                new SequenceChunk([
-                    new SequenceChunk([numericBasicChunk(1), numericBasicChunk(2)]),
-                ]),
-            ]), numberSequenceField(3));
-        });
-        it("nested at offset", () => {
-            validateChunkCursor(new SequenceChunk([
-                numericBasicChunk(0),
-                new SequenceChunk([numericBasicChunk(1)]),
-            ]), numberSequenceField(2));
-        });
-        it("double nested at offset", () => {
-            validateChunkCursor(new SequenceChunk([
-                numericBasicChunk(0),
-                new SequenceChunk([new SequenceChunk([numericBasicChunk(1)])]),
-            ]), numberSequenceField(2));
-        });
-    });
-});
-function numericBasicChunk(value = 0) {
-    return new BasicChunk(leaf.number.name, new Map(), value);
-}
-/**
- * Wrap chunk preventing testing its type with instanceof.
- * This allows making a TreeChunk which will not hit ant type specific special cases.
- * Wrapped chunk owns a ref to the inner one and has ref count 1.
- */
-class WrapperChunk extends ReferenceCountedBase {
-    constructor(chunk) {
-        super();
-        this.chunk = chunk;
-        chunk.referenceAdded();
-    }
-    dispose() {
-        this.chunk.referenceRemoved();
-    }
-    get topLevelLength() {
-        return this.chunk.topLevelLength;
-    }
-    cursor() {
-        return this.chunk.cursor();
-    }
-}
-//# sourceMappingURL=basicChunk.spec.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"basicChunk.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/chunked-forest/basicChunk.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAEN,SAAS,EACT,4BAA4B,EAC5B,0BAA0B,GAC1B,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACN,QAAQ,GAKR,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACN,sBAAsB,EACtB,yBAAyB,EACzB,SAAS,GAET,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EAAE,KAAK,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AACrE,sDAAsD;AACtD,OAAO,EAAE,YAAY,EAAE,MAAM,oDAAoD,CAAC;AAClF,sDAAsD;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,yDAAyD,CAAC;AAErF,OAAO,EACN,cAAc,EACd,oBAAoB,EACpB,UAAU;AACV,sDAAsD;EACtD,MAAM,wDAAwD,CAAC;AAChE,sDAAsD;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,4DAA4D,CAAC;AAC3F,OAAO,EAAE,IAAI,EAAE,MAAM,2BAA2B,CAAC;AAKjD,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AACjE,OAAO,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AAEzF,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC/D,MAAM,IAAI,GAAiB,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACjE,MAAM,WAAW,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,SAAS,CAAC,WAAW,EAAE,oBAAoB,CAAC,CAAC;QAC3D,MAAM,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,6DAA6D,CAAC,CAAC;QAEzF,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACnC,WAAW,CAAC,SAAS,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,oBAAoB,CAAC,CAAC;QAC9D,MAAM,CACL,QAAQ,CAAC,QAAQ,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,EACvC,sDAAsD,CACtD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAChE,MAAM,IAAI,GAAiB,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACjE,MAAM,WAAW,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,SAAS,CAAC,WAAW,EAAE,oBAAoB,CAAC,CAAC;QAC3D,MAAM,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,6DAA6D,CAAC,CAAC;QAEzF,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,EAAE,oBAAoB,CAAC,CAAC;QAC/D,MAAM,CACL,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,EAC1C,sDAAsD,CACtD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,4BAA4B,CAC3B,aAAa,EACb,CAAC,IAAI,EAAe,EAAE;QACrB,MAAM,WAAW,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,cAAc,CAAC,WAAW,EAAE,oBAAoB,CAAC,CAAC;QAChE,MAAM,MAAM,GAAgB,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3C,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpB,OAAO,MAAM,CAAC;IACf,CAAC,EACD,sBAAsB,EACtB,IAAI,CACJ,CAAC;IAEF,MAAM,MAAM,GAA6B,SAAS,CAAC,IAAI,CAAC;IAExD,MAAM,UAAU,GAA4B,EAAE,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;QAC5B,UAAU,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,WAAW,EAAE,GAAG,EAAE,CAAC,IAAI,UAAU,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtF,SAAS,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;YACrE,IAAI,EAAE,IAAI,CAAC,IAAI;SACf,CAAC,CAAC;KACH;IAED,0BAA0B,CAAoC;QAC7D,UAAU,EAAE,6BAA6B;QACzC,QAAQ,EAAE;YACT,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;gBAClB,MAAM,aAAa,GAAG,IAAI,UAAU,CACnC,MAAM,EACN,IAAI,GAAG,CACN,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC;oBACjB,GAAG;oBACH,CAAC,YAAY,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;iBACpD,CAAC,CACF,CACD,CAAC;gBACF,OAAO,aAAa,CAAC;YACtB,CAAC;SACD;QACD,aAAa,EAAE,CAAC,IAAe,EAA0B,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE;QACzE,QAAQ,EAAE,UAAU;KACpB,CAAC,CAAC;IAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC7B,MAAM,KAAK,GAAe,IAAI,UAAU,CACvC,KAAK,CAAC,KAAK,CAAC,EACZ,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC,CAAC,CAC5C,CAAC;QACF,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QAC7B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QAC7B,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC5B,MAAM,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;QACzB,MAAM,MAAM,GAAG,iBAAiB,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,iBAAiB,EAAE,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,IAAI,aAAa,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QAClD,4DAA4D;QAC5D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QAC7B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QAC7B,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC5B,MAAM,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC9B,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE;YACf,mBAAmB,CAAC,IAAI,aAAa,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;YACvF,mBAAmB,CAClB,IAAI,aAAa,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,EAC/D,mBAAmB,CAAC,CAAC,CAAC,CACtB,CAAC;YACF,mBAAmB,CAClB,IAAI,aAAa,CAAC;gBACjB,iBAAiB,CAAC,CAAC,CAAC;gBACpB,iBAAiB,CAAC,CAAC,CAAC;gBACpB,iBAAiB,CAAC,CAAC,CAAC;aACpB,CAAC,EACF,mBAAmB,CAAC,CAAC,CAAC,CACtB,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;YACjB,mBAAmB,CAClB,IAAI,aAAa,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAC9D,mBAAmB,CAAC,CAAC,CAAC,CACtB,CAAC;YACF,mBAAmB,CAClB,IAAI,aAAa,CAAC;gBACjB,iBAAiB,CAAC,CAAC,CAAC;gBACpB,IAAI,aAAa,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;aACzC,CAAC,EACF,mBAAmB,CAAC,CAAC,CAAC,CACtB,CAAC;YACF,mBAAmB,CAClB,IAAI,aAAa,CAAC;gBACjB,IAAI,aAAa,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,IAAI,aAAa,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;aACzC,CAAC,EACF,mBAAmB,CAAC,CAAC,CAAC,CACtB,CAAC;YACF,mBAAmB,CAClB,IAAI,aAAa,CAAC;gBACjB,iBAAiB,CAAC,CAAC,CAAC;gBACpB,IAAI,aAAa,CAAC;oBACjB,IAAI,aAAa,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC/D,CAAC;aACF,CAAC,EACF,mBAAmB,CAAC,CAAC,CAAC,CACtB,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,mBAAmB,CAClB,IAAI,aAAa,CAAC;gBACjB,iBAAiB,CAAC,CAAC,CAAC;gBACpB,IAAI,aAAa,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;aACzC,CAAC,EACF,mBAAmB,CAAC,CAAC,CAAC,CACtB,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,mBAAmB,CAClB,IAAI,aAAa,CAAC;gBACjB,iBAAiB,CAAC,CAAC,CAAC;gBACpB,IAAI,aAAa,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC9D,CAAC,EACF,mBAAmB,CAAC,CAAC,CAAC,CACtB,CAAC;QACH,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,SAAS,iBAAiB,CAAC,QAAgB,CAAC;IAC3C,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC;AAC3D,CAAC;AAED;;;;GAIG;AACH,MAAM,YAAa,SAAQ,oBAAoB;IAC9C,YAAmC,KAAgB;QAClD,KAAK,EAAE,CAAC;QAD0B,UAAK,GAAL,KAAK,CAAW;QAElD,KAAK,CAAC,cAAc,EAAE,CAAC;IACxB,CAAC;IAES,OAAO;QAChB,IAAI,CAAC,KAAK,CAAC,gBAAgB,EAAE,CAAC;IAC/B,CAAC;IAED,IAAW,cAAc;QACxB,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC;IAClC,CAAC;IAEM,MAAM;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;CACD","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\tTestField,\n\tmapSchema,\n\ttestGeneralPurposeTreeCursor,\n\ttestSpecializedFieldCursor,\n} from \"../../cursorTestSuite.js\";\nimport {\n\tEmptyKey,\n\tITreeCursor,\n\tITreeCursorSynchronous,\n\tJsonableTree,\n\tTreeNodeSchemaIdentifier,\n} from \"../../../core/index.js\";\nimport {\n\tjsonableTreeFromCursor,\n\tcursorForJsonableTreeNode,\n\tchunkTree,\n\tTreeChunk,\n} from \"../../../feature-libraries/index.js\";\nimport { brand, ReferenceCountedBase } from \"../../../util/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { uniformChunk } from \"../../../feature-libraries/chunked-forest/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { BasicChunk } from \"../../../feature-libraries/chunked-forest/basicChunk.js\";\n\nimport {\n\tbasicChunkTree,\n\tbasicOnlyChunkPolicy,\n\tchunkField,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/chunked-forest/chunkTree.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { SequenceChunk } from \"../../../feature-libraries/chunked-forest/sequenceChunk.js\";\nimport { leaf } from \"../../../domains/index.js\";\nimport {\n\tChunkedCursor,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/chunked-forest/chunk.js\";\nimport { emptyShape, testData } from \"./uniformChunkTestData.js\";\nimport { numberSequenceField, validateChunkCursor } from \"./fieldCursorTestUtilities.js\";\n\ndescribe(\"basic chunk\", () => {\n\tit(\"calling chunkTree on existing chunk adds a reference\", () => {\n\t\tconst data: JsonableTree = { type: brand(\"Foo\"), value: \"test\" };\n\t\tconst inputCursor = cursorForJsonableTreeNode(data);\n\t\tconst chunk = chunkTree(inputCursor, basicOnlyChunkPolicy);\n\t\tassert(!chunk.isShared(), \"newly created chunk should not have more than one reference\");\n\n\t\tconst chunkCursor = chunk.cursor();\n\t\tchunkCursor.firstNode();\n\t\tconst newChunk = chunkTree(chunkCursor, basicOnlyChunkPolicy);\n\t\tassert(\n\t\t\tnewChunk.isShared() && chunk.isShared(),\n\t\t\t\"chunk created off of existing chunk should be shared\",\n\t\t);\n\t});\n\n\tit(\"calling chunkField on existing chunk adds a reference\", () => {\n\t\tconst data: JsonableTree = { type: brand(\"Foo\"), value: \"test\" };\n\t\tconst inputCursor = cursorForJsonableTreeNode(data);\n\t\tconst chunk = chunkTree(inputCursor, basicOnlyChunkPolicy);\n\t\tassert(!chunk.isShared(), \"newly created chunk should not have more than one reference\");\n\n\t\tconst chunkCursor = chunk.cursor();\n\t\tconst newChunk = chunkField(chunkCursor, basicOnlyChunkPolicy);\n\t\tassert(\n\t\t\tnewChunk[0].isShared() && chunk.isShared(),\n\t\t\t\"chunk created off of existing chunk should be shared\",\n\t\t);\n\t});\n\n\ttestGeneralPurposeTreeCursor(\n\t\t\"basic chunk\",\n\t\t(data): ITreeCursor => {\n\t\t\tconst inputCursor = cursorForJsonableTreeNode(data);\n\t\t\tconst chunk = basicChunkTree(inputCursor, basicOnlyChunkPolicy);\n\t\t\tconst cursor: ITreeCursor = chunk.cursor();\n\t\t\tcursor.enterNode(0);\n\t\t\treturn cursor;\n\t\t},\n\t\tjsonableTreeFromCursor,\n\t\ttrue,\n\t);\n\n\tconst schema: TreeNodeSchemaIdentifier = mapSchema.name;\n\n\tconst hybridData: TestField<BasicChunk>[] = [];\n\tfor (const data of testData) {\n\t\thybridData.push({\n\t\t\tname: data.name,\n\t\t\tdataFactory: () => new BasicChunk(schema, new Map([[EmptyKey, [data.dataFactory()]]])),\n\t\t\treference: [{ type: schema, fields: { [EmptyKey]: data.reference } }],\n\t\t\tpath: data.path,\n\t\t});\n\t}\n\n\ttestSpecializedFieldCursor<TreeChunk, ITreeCursorSynchronous>({\n\t\tcursorName: \"basic chunk + uniform chunk\",\n\t\tbuilders: {\n\t\t\twithKeys: (keys) => {\n\t\t\t\tconst withKeysShape = new BasicChunk(\n\t\t\t\t\tschema,\n\t\t\t\t\tnew Map(\n\t\t\t\t\t\tkeys.map((key) => [\n\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\t[uniformChunk(emptyShape.withTopLevelLength(1), [])],\n\t\t\t\t\t\t]),\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\treturn withKeysShape;\n\t\t\t},\n\t\t},\n\t\tcursorFactory: (data: TreeChunk): ITreeCursorSynchronous => data.cursor(),\n\t\ttestData: hybridData,\n\t});\n\n\tit(\"atRoot, not nested\", () => {\n\t\tconst chunk: BasicChunk = new BasicChunk(\n\t\t\tbrand(\"Foo\"),\n\t\t\tnew Map([[EmptyKey, [numericBasicChunk()]]]),\n\t\t);\n\t\tconst cursor = chunk.cursor();\n\t\tassert(cursor.atChunkRoot());\n\t\tcursor.enterNode(0);\n\t\tassert(cursor.atChunkRoot());\n\t\tcursor.enterField(EmptyKey);\n\t\tassert(!cursor.atChunkRoot());\n\t\tcursor.enterNode(0);\n\t\tassert(!cursor.atChunkRoot());\n\t});\n\n\tit(\"atRoot, nested\", () => {\n\t\tconst child0 = numericBasicChunk();\n\t\tconst child1 = new WrapperChunk(numericBasicChunk());\n\t\tconst chunk = new SequenceChunk([child0, child1]);\n\t\t// Create a BasicChuncukCursor nested in a BasicChunkCursor.\n\t\tconst cursor = chunk.cursor();\n\t\tassert(cursor.atChunkRoot());\n\t\tcursor.enterNode(1);\n\t\tassert(cursor.atChunkRoot());\n\t\tcursor.enterField(EmptyKey);\n\t\tassert(!cursor.atChunkRoot());\n\t});\n\n\tdescribe(\"SequenceChunk\", () => {\n\t\tit(\"root\", () => {\n\t\t\tvalidateChunkCursor(new SequenceChunk([numericBasicChunk(0)]), numberSequenceField(1));\n\t\t\tvalidateChunkCursor(\n\t\t\t\tnew SequenceChunk([numericBasicChunk(0), numericBasicChunk(1)]),\n\t\t\t\tnumberSequenceField(2),\n\t\t\t);\n\t\t\tvalidateChunkCursor(\n\t\t\t\tnew SequenceChunk([\n\t\t\t\t\tnumericBasicChunk(0),\n\t\t\t\t\tnumericBasicChunk(1),\n\t\t\t\t\tnumericBasicChunk(2),\n\t\t\t\t]),\n\t\t\t\tnumberSequenceField(3),\n\t\t\t);\n\t\t});\n\n\t\tit(\"nested\", () => {\n\t\t\tvalidateChunkCursor(\n\t\t\t\tnew SequenceChunk([new SequenceChunk([numericBasicChunk(0)])]),\n\t\t\t\tnumberSequenceField(1),\n\t\t\t);\n\t\t\tvalidateChunkCursor(\n\t\t\t\tnew SequenceChunk([\n\t\t\t\t\tnumericBasicChunk(0),\n\t\t\t\t\tnew SequenceChunk([numericBasicChunk(1)]),\n\t\t\t\t]),\n\t\t\t\tnumberSequenceField(2),\n\t\t\t);\n\t\t\tvalidateChunkCursor(\n\t\t\t\tnew SequenceChunk([\n\t\t\t\t\tnew SequenceChunk([numericBasicChunk(0)]),\n\t\t\t\t\tnew SequenceChunk([numericBasicChunk(1)]),\n\t\t\t\t]),\n\t\t\t\tnumberSequenceField(2),\n\t\t\t);\n\t\t\tvalidateChunkCursor(\n\t\t\t\tnew SequenceChunk([\n\t\t\t\t\tnumericBasicChunk(0),\n\t\t\t\t\tnew SequenceChunk([\n\t\t\t\t\t\tnew SequenceChunk([numericBasicChunk(1), numericBasicChunk(2)]),\n\t\t\t\t\t]),\n\t\t\t\t]),\n\t\t\t\tnumberSequenceField(3),\n\t\t\t);\n\t\t});\n\n\t\tit(\"nested at offset\", () => {\n\t\t\tvalidateChunkCursor(\n\t\t\t\tnew SequenceChunk([\n\t\t\t\t\tnumericBasicChunk(0),\n\t\t\t\t\tnew SequenceChunk([numericBasicChunk(1)]),\n\t\t\t\t]),\n\t\t\t\tnumberSequenceField(2),\n\t\t\t);\n\t\t});\n\n\t\tit(\"double nested at offset\", () => {\n\t\t\tvalidateChunkCursor(\n\t\t\t\tnew SequenceChunk([\n\t\t\t\t\tnumericBasicChunk(0),\n\t\t\t\t\tnew SequenceChunk([new SequenceChunk([numericBasicChunk(1)])]),\n\t\t\t\t]),\n\t\t\t\tnumberSequenceField(2),\n\t\t\t);\n\t\t});\n\t});\n});\n\nfunction numericBasicChunk(value: number = 0): BasicChunk {\n\treturn new BasicChunk(leaf.number.name, new Map(), value);\n}\n\n/**\n * Wrap chunk preventing testing its type with instanceof.\n * This allows making a TreeChunk which will not hit ant type specific special cases.\n * Wrapped chunk owns a ref to the inner one and has ref count 1.\n */\nclass WrapperChunk extends ReferenceCountedBase implements TreeChunk {\n\tpublic constructor(public readonly chunk: TreeChunk) {\n\t\tsuper();\n\t\tchunk.referenceAdded();\n\t}\n\n\tprotected dispose(): void {\n\t\tthis.chunk.referenceRemoved();\n\t}\n\n\tpublic get topLevelLength(): number {\n\t\treturn this.chunk.topLevelLength;\n\t}\n\n\tpublic cursor(): ChunkedCursor {\n\t\treturn this.chunk.cursor();\n\t}\n}\n"]}

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

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=chunkEncodingEndToEnd.d.ts.map

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

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

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

@@ -1,102 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { createIdCompressor } from "@fluidframework/id-compressor";
-import { RevisionTagCodec, TreeStoredSchemaRepository, } from "../../../core/index.js";
-import { leaf } from "../../../domains/index.js";
-import { typeboxValidator } from "../../../external-utilities/index.js";
-import { DefaultChangeFamily, DefaultEditBuilder, ForestSummarizer, TreeCompressionStrategy, buildChunkedForest, createMockNodeKeyManager, defaultSchemaPolicy, getTreeContext, intoStoredSchema, makeFieldBatchCodec, nodeKeyFieldKey, } from "../../../feature-libraries/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { TreeShape, UniformChunk } from "../../../feature-libraries/chunked-forest/uniformChunk.js";
-import { ForestType } from "../../../shared-tree/index.js";
-import { flexTreeViewWithContent, numberSequenceRootSchema } from "../../utils.js";
-import { brand } from "../../../util/index.js";
-import { Chunker, defaultChunkPolicy, tryShapeFromSchema,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/chunked-forest/chunkTree.js";
-// eslint-disable-next-line import/no-internal-modules
-import { decode } from "../../../feature-libraries/chunked-forest/codec/chunkDecoding.js";
-const options = {
-    jsonValidator: typeboxValidator,
-    forest: ForestType.Optimized,
-    summaryEncodeType: TreeCompressionStrategy.Compressed,
-};
-const context = {
-    encodeType: options.summaryEncodeType,
-    schema: { schema: intoStoredSchema(numberSequenceRootSchema), policy: defaultSchemaPolicy },
-};
-const fieldBatchCodec = makeFieldBatchCodec({ jsonValidator: typeboxValidator });
-const sessionId = "beefbeef-beef-4000-8000-000000000001";
-const idCompressor = createIdCompressor(sessionId);
-const revisionTagCodec = new RevisionTagCodec(idCompressor);
-describe("End to end chunked encoding", () => {
-    it(`insert ops shares reference with the original chunk.`, () => {
-        const treeSchema = new TreeStoredSchemaRepository(intoStoredSchema(numberSequenceRootSchema));
-        const chunker = new Chunker(treeSchema, defaultSchemaPolicy, Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY, defaultChunkPolicy.uniformChunkNodeCount, tryShapeFromSchema);
-        const forest = buildChunkedForest(chunker);
-        const numberShape = new TreeShape(leaf.number.name, true, []);
-        const chunk = new UniformChunk(numberShape.withTopLevelLength(4), [1, 2, 3, 4]);
-        assert(!chunk.isShared());
-        const changeLog = [];
-        // This function is declared in the test to have access to push changes to the changelog declared outside of this function.
-        function createFlexTree(editableForest, schema) {
-            const changeReceiver = (change) => {
-                changeLog.push(change);
-            };
-            const dummyEditor = new DefaultEditBuilder(new DefaultChangeFamily(revisionTagCodec, fieldBatchCodec, {
-                jsonValidator: typeboxValidator,
-            }), changeReceiver);
-            return getTreeContext(schema, editableForest, dummyEditor, createMockNodeKeyManager(), brand(nodeKeyFieldKey));
-        }
-        const flexTree = createFlexTree(forest, numberSequenceRootSchema);
-        const root = flexTree.root;
-        assert(root.is(numberSequenceRootSchema.rootFieldSchema));
-        root.insertAt(0, chunk.cursor());
-        // Check that inserted change contains chunk which is reference equal to the original chunk.
-        const insertedChange = changeLog[0];
-        assert(insertedChange.builds !== undefined);
-        const insertedChunk = insertedChange.builds.get(undefined)?.get(0);
-        assert.equal(insertedChunk, chunk);
-        assert(chunk.isShared());
-    });
-    it.skip(`summary values are correct, and shares reference with the original chunk when inserting content.`, () => {
-        const numberShape = new TreeShape(leaf.number.name, true, []);
-        const chunk = new UniformChunk(numberShape.withTopLevelLength(4), [1, 2, 3, 4]);
-        assert(!chunk.isShared());
-        const flexTree = flexTreeViewWithContent({
-            schema: numberSequenceRootSchema,
-            initialTree: [],
-        });
-        flexTree.flexTree.insertAt(0, chunk.cursor());
-        const forestSummarizer = new ForestSummarizer(flexTree.context.forest, revisionTagCodec, fieldBatchCodec, context, options);
-        // This function is declared in the test to have access to the original uniform chunk for comparison.
-        function stringifier(content) {
-            const insertedChunk = decode(content.fields);
-            assert.equal(insertedChunk, chunk);
-            assert(chunk.isShared());
-            return JSON.stringify(content);
-        }
-        forestSummarizer.getAttachSummary(stringifier);
-    });
-    it.skip(`summary values are correct, and shares reference with the original chunk when initializing with content.`, () => {
-        const numberShape = new TreeShape(leaf.number.name, true, []);
-        const chunk = new UniformChunk(numberShape.withTopLevelLength(4), [1, 2, 3, 4]);
-        assert(!chunk.isShared());
-        const flexTree = flexTreeViewWithContent({
-            schema: numberSequenceRootSchema,
-            initialTree: chunk.cursor(),
-        });
-        const forestSummarizer = new ForestSummarizer(flexTree.context.forest, revisionTagCodec, fieldBatchCodec, context, options);
-        // This function is declared in the test to have access to the original uniform chunk for comparison.
-        function stringifier(content) {
-            const insertedChunk = decode(content.fields);
-            assert.equal(insertedChunk, chunk);
-            assert(chunk.isShared());
-            return JSON.stringify(content);
-        }
-        forestSummarizer.getAttachSummary(stringifier);
-    });
-});
-//# sourceMappingURL=chunkEncodingEndToEnd.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"chunkEncodingEndToEnd.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/chunked-forest/chunkEncodingEndToEnd.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAa,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AAC9E,OAAO,EAGN,gBAAgB,EAChB,0BAA0B,GAC1B,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,IAAI,EAAE,MAAM,2BAA2B,CAAC;AACjD,OAAO,EAAE,gBAAgB,EAAE,MAAM,sCAAsC,CAAC;AACxE,OAAO,EAEN,mBAAmB,EACnB,kBAAkB,EAElB,gBAAgB,EAEhB,uBAAuB,EACvB,kBAAkB,EAClB,wBAAwB,EACxB,mBAAmB,EACnB,cAAc,EACd,gBAAgB,EAChB,mBAAmB,EACnB,eAAe,GACf,MAAM,qCAAqC,CAAC;AAC7C,sDAAsD;AACtD,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,2DAA2D,CAAC;AACpG,OAAO,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAC3D,OAAO,EAAE,uBAAuB,EAAE,wBAAwB,EAAE,MAAM,gBAAgB,CAAC;AACnF,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EACN,OAAO,EACP,kBAAkB,EAClB,kBAAkB;AAClB,sDAAsD;EACtD,MAAM,wDAAwD,CAAC;AAChE,sDAAsD;AACtD,OAAO,EAAE,MAAM,EAAE,MAAM,kEAAkE,CAAC;AAE1F,MAAM,OAAO,GAAG;IACf,aAAa,EAAE,gBAAgB;IAC/B,MAAM,EAAE,UAAU,CAAC,SAAS;IAC5B,iBAAiB,EAAE,uBAAuB,CAAC,UAAU;CACrD,CAAC;AAEF,MAAM,OAAO,GAAG;IACf,UAAU,EAAE,OAAO,CAAC,iBAAiB;IACrC,MAAM,EAAE,EAAE,MAAM,EAAE,gBAAgB,CAAC,wBAAwB,CAAC,EAAE,MAAM,EAAE,mBAAmB,EAAE;CAC3F,CAAC;AAEF,MAAM,eAAe,GAAG,mBAAmB,CAAC,EAAE,aAAa,EAAE,gBAAgB,EAAE,CAAC,CAAC;AACjF,MAAM,SAAS,GAAG,sCAAmD,CAAC;AACtE,MAAM,YAAY,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;AACnD,MAAM,gBAAgB,GAAG,IAAI,gBAAgB,CAAC,YAAY,CAAC,CAAC;AAE5D,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;IAC5C,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC/D,MAAM,UAAU,GAAG,IAAI,0BAA0B,CAChD,gBAAgB,CAAC,wBAAwB,CAAC,CAC1C,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,OAAO,CAC1B,UAAU,EACV,mBAAmB,EACnB,MAAM,CAAC,iBAAiB,EACxB,MAAM,CAAC,iBAAiB,EACxB,kBAAkB,CAAC,qBAAqB,EACxC,kBAAkB,CAClB,CAAC;QAEF,MAAM,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAC3C,MAAM,WAAW,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QAC9D,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChF,MAAM,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC1B,MAAM,SAAS,GAAuB,EAAE,CAAC;QAEzC,2HAA2H;QAC3H,SAAS,cAAc,CAAC,cAA+B,EAAE,MAAsB;YAC9E,MAAM,cAAc,GAAG,CAAC,MAAwB,EAAE,EAAE;gBACnD,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC,CAAC;YACF,MAAM,WAAW,GAAG,IAAI,kBAAkB,CACzC,IAAI,mBAAmB,CAAC,gBAAgB,EAAE,eAAe,EAAE;gBAC1D,aAAa,EAAE,gBAAgB;aAC/B,CAAC,EACF,cAAc,CACd,CAAC;YACF,OAAO,cAAc,CACpB,MAAM,EACN,cAAc,EACd,WAAW,EACX,wBAAwB,EAAE,EAC1B,KAAK,CAAC,eAAe,CAAC,CACtB,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,EAAE,wBAAwB,CAAC,CAAC;QAClE,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC3B,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,wBAAwB,CAAC,eAAe,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAEjC,4FAA4F;QAC5F,MAAM,cAAc,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,cAAc,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;QAC5C,MAAM,aAAa,GAAG,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAqB,CAAC,CAAC;QACvF,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,IAAI,CAAC,kGAAkG,EAAE,GAAG,EAAE;QAChH,MAAM,WAAW,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QAC9D,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChF,MAAM,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC1B,MAAM,QAAQ,GAAG,uBAAuB,CAAC;YACxC,MAAM,EAAE,wBAAwB;YAChC,WAAW,EAAE,EAAE;SACf,CAAC,CAAC;QAEH,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAE9C,MAAM,gBAAgB,GAAG,IAAI,gBAAgB,CAC5C,QAAQ,CAAC,OAAO,CAAC,MAAyB,EAC1C,gBAAgB,EAChB,eAAe,EACf,OAAO,EACP,OAAO,CACP,CAAC;QAEF,qGAAqG;QACrG,SAAS,WAAW,CAAC,OAAgB;YACpC,MAAM,aAAa,GAAG,MAAM,CAAE,OAAe,CAAC,MAAM,CAAC,CAAC;YACtD,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;YACnC,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;QACD,gBAAgB,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,IAAI,CAAC,0GAA0G,EAAE,GAAG,EAAE;QACxH,MAAM,WAAW,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QAC9D,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChF,MAAM,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;QAE1B,MAAM,QAAQ,GAAG,uBAAuB,CAAC;YACxC,MAAM,EAAE,wBAAwB;YAChC,WAAW,EAAE,KAAK,CAAC,MAAM,EAAE;SAC3B,CAAC,CAAC;QAEH,MAAM,gBAAgB,GAAG,IAAI,gBAAgB,CAC5C,QAAQ,CAAC,OAAO,CAAC,MAAyB,EAC1C,gBAAgB,EAChB,eAAe,EACf,OAAO,EACP,OAAO,CACP,CAAC;QAEF,qGAAqG;QACrG,SAAS,WAAW,CAAC,OAAgB;YACpC,MAAM,aAAa,GAAG,MAAM,CAAE,OAAe,CAAC,MAAM,CAAC,CAAC;YACtD,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;YACnC,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;QACD,gBAAgB,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAChD,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 */\nimport { strict as assert } from \"assert\";\nimport { SessionId, createIdCompressor } from \"@fluidframework/id-compressor\";\nimport {\n\tChangesetLocalId,\n\tIEditableForest,\n\tRevisionTagCodec,\n\tTreeStoredSchemaRepository,\n} from \"../../../core/index.js\";\nimport { leaf } from \"../../../domains/index.js\";\nimport { typeboxValidator } from \"../../../external-utilities/index.js\";\nimport {\n\tContext,\n\tDefaultChangeFamily,\n\tDefaultEditBuilder,\n\tFlexTreeSchema,\n\tForestSummarizer,\n\tModularChangeset,\n\tTreeCompressionStrategy,\n\tbuildChunkedForest,\n\tcreateMockNodeKeyManager,\n\tdefaultSchemaPolicy,\n\tgetTreeContext,\n\tintoStoredSchema,\n\tmakeFieldBatchCodec,\n\tnodeKeyFieldKey,\n} from \"../../../feature-libraries/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { TreeShape, UniformChunk } from \"../../../feature-libraries/chunked-forest/uniformChunk.js\";\nimport { ForestType } from \"../../../shared-tree/index.js\";\nimport { flexTreeViewWithContent, numberSequenceRootSchema } from \"../../utils.js\";\nimport { brand } from \"../../../util/index.js\";\nimport {\n\tChunker,\n\tdefaultChunkPolicy,\n\ttryShapeFromSchema,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/chunked-forest/chunkTree.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { decode } from \"../../../feature-libraries/chunked-forest/codec/chunkDecoding.js\";\n\nconst options = {\n\tjsonValidator: typeboxValidator,\n\tforest: ForestType.Optimized,\n\tsummaryEncodeType: TreeCompressionStrategy.Compressed,\n};\n\nconst context = {\n\tencodeType: options.summaryEncodeType,\n\tschema: { schema: intoStoredSchema(numberSequenceRootSchema), policy: defaultSchemaPolicy },\n};\n\nconst fieldBatchCodec = makeFieldBatchCodec({ jsonValidator: typeboxValidator });\nconst sessionId = \"beefbeef-beef-4000-8000-000000000001\" as SessionId;\nconst idCompressor = createIdCompressor(sessionId);\nconst revisionTagCodec = new RevisionTagCodec(idCompressor);\n\ndescribe(\"End to end chunked encoding\", () => {\n\tit(`insert ops shares reference with the original chunk.`, () => {\n\t\tconst treeSchema = new TreeStoredSchemaRepository(\n\t\t\tintoStoredSchema(numberSequenceRootSchema),\n\t\t);\n\t\tconst chunker = new Chunker(\n\t\t\ttreeSchema,\n\t\t\tdefaultSchemaPolicy,\n\t\t\tNumber.POSITIVE_INFINITY,\n\t\t\tNumber.POSITIVE_INFINITY,\n\t\t\tdefaultChunkPolicy.uniformChunkNodeCount,\n\t\t\ttryShapeFromSchema,\n\t\t);\n\n\t\tconst forest = buildChunkedForest(chunker);\n\t\tconst numberShape = new TreeShape(leaf.number.name, true, []);\n\t\tconst chunk = new UniformChunk(numberShape.withTopLevelLength(4), [1, 2, 3, 4]);\n\t\tassert(!chunk.isShared());\n\t\tconst changeLog: ModularChangeset[] = [];\n\n\t\t// This function is declared in the test to have access to push changes to the changelog declared outside of this function.\n\t\tfunction createFlexTree(editableForest: IEditableForest, schema: FlexTreeSchema): Context {\n\t\t\tconst changeReceiver = (change: ModularChangeset) => {\n\t\t\t\tchangeLog.push(change);\n\t\t\t};\n\t\t\tconst dummyEditor = new DefaultEditBuilder(\n\t\t\t\tnew DefaultChangeFamily(revisionTagCodec, fieldBatchCodec, {\n\t\t\t\t\tjsonValidator: typeboxValidator,\n\t\t\t\t}),\n\t\t\t\tchangeReceiver,\n\t\t\t);\n\t\t\treturn getTreeContext(\n\t\t\t\tschema,\n\t\t\t\teditableForest,\n\t\t\t\tdummyEditor,\n\t\t\t\tcreateMockNodeKeyManager(),\n\t\t\t\tbrand(nodeKeyFieldKey),\n\t\t\t);\n\t\t}\n\n\t\tconst flexTree = createFlexTree(forest, numberSequenceRootSchema);\n\t\tconst root = flexTree.root;\n\t\tassert(root.is(numberSequenceRootSchema.rootFieldSchema));\n\t\troot.insertAt(0, chunk.cursor());\n\n\t\t// Check that inserted change contains chunk which is reference equal to the original chunk.\n\t\tconst insertedChange = changeLog[0];\n\t\tassert(insertedChange.builds !== undefined);\n\t\tconst insertedChunk = insertedChange.builds.get(undefined)?.get(0 as ChangesetLocalId);\n\t\tassert.equal(insertedChunk, chunk);\n\t\tassert(chunk.isShared());\n\t});\n\n\tit.skip(`summary values are correct, and shares reference with the original chunk when inserting content.`, () => {\n\t\tconst numberShape = new TreeShape(leaf.number.name, true, []);\n\t\tconst chunk = new UniformChunk(numberShape.withTopLevelLength(4), [1, 2, 3, 4]);\n\t\tassert(!chunk.isShared());\n\t\tconst flexTree = flexTreeViewWithContent({\n\t\t\tschema: numberSequenceRootSchema,\n\t\t\tinitialTree: [],\n\t\t});\n\n\t\tflexTree.flexTree.insertAt(0, chunk.cursor());\n\n\t\tconst forestSummarizer = new ForestSummarizer(\n\t\t\tflexTree.context.forest as IEditableForest,\n\t\t\trevisionTagCodec,\n\t\t\tfieldBatchCodec,\n\t\t\tcontext,\n\t\t\toptions,\n\t\t);\n\n\t\t// This function is declared in the test to have access to the original uniform chunk for comparison.\n\t\tfunction stringifier(content: unknown) {\n\t\t\tconst insertedChunk = decode((content as any).fields);\n\t\t\tassert.equal(insertedChunk, chunk);\n\t\t\tassert(chunk.isShared());\n\t\t\treturn JSON.stringify(content);\n\t\t}\n\t\tforestSummarizer.getAttachSummary(stringifier);\n\t});\n\n\tit.skip(`summary values are correct, and shares reference with the original chunk when initializing with content.`, () => {\n\t\tconst numberShape = new TreeShape(leaf.number.name, true, []);\n\t\tconst chunk = new UniformChunk(numberShape.withTopLevelLength(4), [1, 2, 3, 4]);\n\t\tassert(!chunk.isShared());\n\n\t\tconst flexTree = flexTreeViewWithContent({\n\t\t\tschema: numberSequenceRootSchema,\n\t\t\tinitialTree: chunk.cursor(),\n\t\t});\n\n\t\tconst forestSummarizer = new ForestSummarizer(\n\t\t\tflexTree.context.forest as IEditableForest,\n\t\t\trevisionTagCodec,\n\t\t\tfieldBatchCodec,\n\t\t\tcontext,\n\t\t\toptions,\n\t\t);\n\n\t\t// This function is declared in the test to have access to the original uniform chunk for comparison.\n\t\tfunction stringifier(content: unknown) {\n\t\t\tconst insertedChunk = decode((content as any).fields);\n\t\t\tassert.equal(insertedChunk, chunk);\n\t\t\tassert(chunk.isShared());\n\t\t\treturn JSON.stringify(content);\n\t\t}\n\t\tforestSummarizer.getAttachSummary(stringifier);\n\t});\n});\n"]}

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

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

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

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

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

@@ -1,259 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { EmptyKey, mapCursorField } from "../../../core/index.js";
-import { jsonObject, leaf, SchemaBuilder } from "../../../domains/index.js";
-import { defaultSchemaPolicy, jsonableTreeFromCursor, cursorForJsonableTreeNode, cursorForJsonableTreeField, intoStoredSchemaCollection, } from "../../../feature-libraries/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { BasicChunk } from "../../../feature-libraries/chunked-forest/basicChunk.js";
-// eslint-disable-next-line import/no-internal-modules
-import { tryGetChunk } from "../../../feature-libraries/chunked-forest/chunk.js";
-import { basicOnlyChunkPolicy, chunkRange, defaultChunkPolicy, insertValues, polymorphic, tryShapeFromFieldSchema, tryShapeFromSchema, uniformChunkFromCursor,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/chunked-forest/chunkTree.js";
-// eslint-disable-next-line import/no-internal-modules
-import { SequenceChunk } from "../../../feature-libraries/chunked-forest/sequenceChunk.js";
-// eslint-disable-next-line import/no-internal-modules
-import { TreeShape } from "../../../feature-libraries/chunked-forest/uniformChunk.js";
-import { brand } from "../../../util/index.js";
-import { assertChunkCursorEquals, jsonableTreesFromFieldCursor, numberSequenceField, } from "./fieldCursorTestUtilities.js";
-import { polygonTree, testData } from "./uniformChunkTestData.js";
-const builder = new SchemaBuilder({ scope: "chunkTree" });
-const empty = builder.object("empty", {});
-const valueField = SchemaBuilder.required(leaf.number);
-const structValue = builder.object("structValue", { x: valueField });
-const optionalField = builder.optional(leaf.number);
-const structOptional = builder.object("structOptional", { x: optionalField });
-const schemaView = builder.intoLibrary();
-const schema = intoStoredSchemaCollection(schemaView);
-function expectEqual(a, b) {
-    assert.deepEqual(a, b);
-    if (a instanceof TreeShape) {
-        assert(b instanceof TreeShape);
-        assert(a.equals(b));
-        assert(b.equals(a));
-    }
-}
-describe("chunkTree", () => {
-    // Ensure handling of various shapes works properly
-    describe("insertValues", () => {
-        for (const tree of testData) {
-            it(`values from ${tree.name}`, () => {
-                const values = [];
-                const chunk = tree.dataFactory();
-                const shape = chunk.shape.treeShape;
-                for (let index = 0; index < chunk.topLevelLength; index++) {
-                    const src = cursorForJsonableTreeNode(tree.reference[index]);
-                    insertValues(src, shape, values);
-                }
-                assert.deepEqual(values, chunk.values);
-            });
-        }
-    });
-    describe("uniformChunkFromCursor", () => {
-        it("maxTopLevelLength and skipLastNavigation are respected", () => {
-            const uniformPolygon = polygonTree.dataFactory();
-            const polygonReference = cursorForJsonableTreeNode(polygonTree.reference);
-            const [key, pointShape, pointCount] = uniformPolygon.shape.treeShape.fieldsArray[0];
-            polygonReference.enterField(key);
-            polygonReference.firstNode();
-            const chunk1 = uniformChunkFromCursor(polygonReference, pointShape, 1, true);
-            assert.equal(polygonReference.fieldIndex, 0);
-            const chunk2 = uniformChunkFromCursor(polygonReference, pointShape, 1, false);
-            assert.equal(polygonReference.fieldIndex, 1);
-            const chunk3 = uniformChunkFromCursor(polygonReference, pointShape, 2, true);
-            assert.equal(polygonReference.fieldIndex, 2);
-            const chunk4 = uniformChunkFromCursor(polygonReference, pointShape, 2, false);
-            assert.equal(polygonReference.fieldIndex, 4);
-            // Check produced chunks are correct.
-            const pointsArray = polygonTree.reference.fields[EmptyKey];
-            const fromChunk1 = mapCursorField(chunk1.cursor(), jsonableTreeFromCursor);
-            assert.deepEqual(fromChunk1, pointsArray.slice(0, 1));
-            const fromChunk2 = mapCursorField(chunk2.cursor(), jsonableTreeFromCursor);
-            assert.deepEqual(fromChunk2, pointsArray.slice(0, 1));
-            const fromChunk3 = mapCursorField(chunk3.cursor(), jsonableTreeFromCursor);
-            assert.deepEqual(fromChunk3, pointsArray.slice(1, 3));
-            const fromChunk4 = mapCursorField(chunk4.cursor(), jsonableTreeFromCursor);
-            assert.deepEqual(fromChunk4, pointsArray.slice(2, 4));
-        });
-        it("stops if type changes", () => {
-            const cursor = cursorForJsonableTreeField([
-                { type: leaf.null.name },
-                { type: leaf.null.name },
-                { type: jsonObject.name },
-            ]);
-            cursor.firstNode();
-            const nullShape = new TreeShape(leaf.null.name, false, []);
-            {
-                const chunk = uniformChunkFromCursor(cursor, nullShape, 3, false);
-                assert.equal(chunk.topLevelLength, 2);
-                assert.equal(cursor.fieldIndex, 2);
-                cursor.seekNodes(-cursor.fieldIndex);
-            }
-            // Check when stopping early, skipLastNavigation does not apply
-            {
-                const chunk = uniformChunkFromCursor(cursor, nullShape, 3, true);
-                assert.equal(chunk.topLevelLength, 2);
-                assert.equal(cursor.fieldIndex, 2);
-            }
-        });
-    });
-    describe("chunkRange", () => {
-        it("single basic chunk", () => {
-            const cursor = cursorForJsonableTreeNode({ type: leaf.null.name });
-            const chunks = chunkRange(cursor, basicOnlyChunkPolicy, 1, true);
-            assert.equal(chunks.length, 1);
-            assert.equal(chunks[0].topLevelLength, 1);
-            assert.equal(cursor.fieldIndex, 0);
-            assert(chunks[0] instanceof BasicChunk);
-            assert.deepEqual(jsonableTreesFromFieldCursor(chunks[0].cursor()), [
-                {
-                    type: leaf.null.name,
-                },
-            ]);
-        });
-        it("full field basic chunk without skipLastNavigation", () => {
-            const cursor = cursorForJsonableTreeField([{ type: leaf.null.name }]);
-            cursor.firstNode();
-            const chunks = chunkRange(cursor, basicOnlyChunkPolicy, 1, false);
-            assert.equal(chunks.length, 1);
-            assert.equal(chunks[0].topLevelLength, 1);
-            // Should have existed the nodes and now be at fields level.
-            assert.equal(cursor.mode, 1 /* CursorLocationType.Fields */);
-        });
-        it("basic chunks for part of field", () => {
-            const cursor = cursorForJsonableTreeField([
-                { type: leaf.null.name },
-                { type: leaf.null.name },
-                { type: leaf.null.name },
-            ]);
-            cursor.firstNode();
-            const chunks = chunkRange(cursor, basicOnlyChunkPolicy, 2, false);
-            assert.equal(chunks.length, 2);
-            assert.equal(cursor.fieldIndex, 2);
-            assert.deepEqual(jsonableTreesFromFieldCursor(new SequenceChunk(chunks).cursor()), [
-                { type: leaf.null.name },
-                { type: leaf.null.name },
-            ]);
-        });
-        it("creates sequence chunks", () => {
-            const policy = {
-                sequenceChunkSplitThreshold: 2,
-                sequenceChunkInlineThreshold: Number.POSITIVE_INFINITY,
-                uniformChunkNodeCount: 0,
-                shapeFromSchema: () => polymorphic,
-            };
-            const cursor = cursorForJsonableTreeField(numberSequenceField(4));
-            cursor.firstNode();
-            const chunks = chunkRange(cursor, policy, 3, false);
-            assert.equal(chunks.length, 2);
-            assert(chunks[0] instanceof SequenceChunk);
-            assert.equal(chunks[0].subChunks.length, 2);
-            assert(chunks[0].subChunks[0] instanceof BasicChunk);
-            assert(chunks[0].subChunks[1] instanceof BasicChunk);
-            assert(chunks[1] instanceof SequenceChunk);
-            assert.equal(chunks[1].subChunks.length, 1);
-            assert(chunks[1].subChunks[0] instanceof BasicChunk);
-            assert.equal(cursor.fieldIndex, 3);
-            assertChunkCursorEquals(new SequenceChunk(chunks), numberSequenceField(3));
-        });
-        describe("makes sequence trees", () => {
-            // [sequenceChunkSplitThreshold, field length, expected depth]
-            const testCases = [
-                [2, 1, 0],
-                [2, 2, 0],
-                [2, 3, 1],
-                [2, 4, 1],
-                [2, 5, 2],
-                [2, 8, 2],
-                [2, 9, 3],
-                [3, 3, 0],
-                [4, 4, 0],
-                [4, 5, 1],
-                [4, 16, 1],
-                [4, 17, 2],
-                [4, 64, 2],
-                [4, 65, 3],
-                [4, 120, 3],
-                [4, 127, 3],
-                [4, 150, 3],
-                [4, 255, 3],
-                [4, 256, 3],
-                [4, 257, 4],
-            ];
-            for (const [threshold, fieldLength, expectedDepth] of testCases) {
-                it(`threshold ${threshold} with fieldLength ${fieldLength} (depth ${expectedDepth})`, () => {
-                    const policy = {
-                        sequenceChunkSplitThreshold: threshold,
-                        sequenceChunkInlineThreshold: Number.POSITIVE_INFINITY,
-                        uniformChunkNodeCount: 0,
-                        shapeFromSchema: () => polymorphic,
-                    };
-                    const field = numberSequenceField(fieldLength);
-                    const cursor = cursorForJsonableTreeField(field);
-                    cursor.firstNode();
-                    const chunks = chunkRange(cursor, policy, fieldLength, true);
-                    assert.equal(cursor.fieldIndex, fieldLength - 1);
-                    function checkChunks(innerChunks, expectedDepthRemaining) {
-                        assert(innerChunks.length <= threshold);
-                        for (const chunk of innerChunks) {
-                            if (expectedDepthRemaining === 0) {
-                                assert(chunk instanceof BasicChunk);
-                            }
-                            else {
-                                assert(chunk instanceof SequenceChunk);
-                                checkChunks(chunk.subChunks, expectedDepthRemaining - 1);
-                                assert(chunk.subChunks.length >= Math.floor(threshold / 2));
-                            }
-                        }
-                    }
-                    checkChunks(chunks, expectedDepth);
-                    assert.deepEqual(jsonableTreesFromFieldCursor(new SequenceChunk(chunks).cursor()), field);
-                });
-            }
-        });
-        it("reuses chunks", () => {
-            const chunk = new BasicChunk(brand("Foo"), new Map());
-            const cursor = chunk.cursor();
-            cursor.firstNode();
-            assert.equal(tryGetChunk(cursor), chunk);
-            assert(!chunk.isShared());
-            const chunks = chunkRange(cursor, defaultChunkPolicy, 1, false);
-            assert(chunk.isShared());
-            assert.equal(chunks[0], chunk);
-        });
-    });
-    describe("tryShapeFromSchema", () => {
-        it("leaf", () => {
-            const info = tryShapeFromSchema(schema, defaultSchemaPolicy, leaf.number.name, new Map());
-            expectEqual(info, new TreeShape(leaf.number.name, true, []));
-        });
-        it("empty", () => {
-            const info = tryShapeFromSchema(schema, defaultSchemaPolicy, empty.name, new Map());
-            expectEqual(info, new TreeShape(empty.name, false, []));
-        });
-        it("structValue", () => {
-            const info = tryShapeFromSchema(schema, defaultSchemaPolicy, structValue.name, new Map());
-            expectEqual(info, new TreeShape(structValue.name, false, [
-                [brand("x"), new TreeShape(leaf.number.name, true, []), 1],
-            ]));
-        });
-        it("structOptional", () => {
-            const info = tryShapeFromSchema(schema, defaultSchemaPolicy, structOptional.name, new Map());
-            expectEqual(info, polymorphic);
-        });
-    });
-    describe("tryShapeFromFieldSchema", () => {
-        it("valueField", () => {
-            const info = tryShapeFromFieldSchema(schema, defaultSchemaPolicy, valueField, brand("key"), new Map());
-            assert.deepEqual(info, ["key", new TreeShape(leaf.number.name, true, []), 1]);
-        });
-        it("optionalField", () => {
-            const info = tryShapeFromFieldSchema(schema, defaultSchemaPolicy, optionalField, brand("key"), new Map());
-            assert.equal(info, undefined);
-        });
-    });
-});
-//# sourceMappingURL=chunkTree.spec.js.map