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

package/lib/test/feature-libraries/storedToViewSchema.spec.js

@@ -1,117 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { EmptyKey, LeafNodeStoredSchema, MapNodeStoredSchema, ObjectNodeStoredSchema, ValueSchema, storedEmptyFieldSchema, } from "../../core/index.js";
-import { Any, FieldKinds, LeafNodeSchema, FlexMapNodeSchema, FlexObjectNodeSchema, FlexFieldSchema, TreeNodeSchemaBase, } from "../../feature-libraries/index.js";
-import { fieldSchemaFromStoredSchema, treeSchemaFromStoredSchema,
-// Allow importing from this specific file which is being tested:
-/* eslint-disable-next-line import/no-internal-modules */
- } from "../../feature-libraries/storedToViewSchema.js";
-import { brand } from "../../util/index.js";
-describe("storedToViewSchema", () => {
-    describe("fieldSchemaFromStoredSchema", () => {
-        const schemaX = LeafNodeSchema.create({ name: "z" }, brand("x"), ValueSchema.Number);
-        const schemaY = LeafNodeSchema.create({ name: "z" }, brand("y"), ValueSchema.Number);
-        const schemaMap = new Map([
-            [schemaX.name, schemaX],
-            [schemaY.name, schemaY],
-        ]);
-        const roundTrip = [
-            ["any", FlexFieldSchema.create(FieldKinds.optional, [Any])],
-            ["forbidden", FlexFieldSchema.create(FieldKinds.forbidden, [Any])],
-            ["no types", FlexFieldSchema.create(FieldKinds.optional, [])],
-            ["one type", FlexFieldSchema.create(FieldKinds.optional, [schemaX])],
-            ["lazy", FlexFieldSchema.create(FieldKinds.optional, [() => schemaX])],
-            ["multiple types", FlexFieldSchema.create(FieldKinds.optional, [schemaX, schemaY])],
-        ];
-        for (const [name, field] of roundTrip) {
-            it(name, () => {
-                const converted = fieldSchemaFromStoredSchema(field, schemaMap);
-                assert(converted.equals(field));
-            });
-        }
-    });
-    describe("treeSchemaFromStoredSchema", () => {
-        it("empty", () => {
-            const empty = treeSchemaFromStoredSchema({
-                rootFieldSchema: storedEmptyFieldSchema,
-                nodeSchema: new Map(),
-            });
-            assert(empty.rootFieldSchema.equals(FlexFieldSchema.empty));
-            assert.deepEqual(empty.nodeSchema, new Map());
-        });
-        it("oneOfEach", () => {
-            const schemaLeaf = new LeafNodeStoredSchema(ValueSchema.Number);
-            const schemaObject = new ObjectNodeStoredSchema(new Map([
-                [
-                    brand("foo"),
-                    {
-                        kind: { identifier: FieldKinds.required.identifier },
-                        types: new Set([brand("leaf")]),
-                    },
-                ],
-            ]));
-            const schemaRecursive = new ObjectNodeStoredSchema(new Map([
-                [
-                    brand("foo"),
-                    {
-                        kind: { identifier: FieldKinds.optional.identifier },
-                        types: new Set([brand("Recursive")]),
-                    },
-                ],
-            ]));
-            // Current policy is to treat this case as an object.
-            const schemaEmptyKey = new ObjectNodeStoredSchema(new Map([
-                [
-                    EmptyKey,
-                    {
-                        kind: { identifier: FieldKinds.required.identifier },
-                        types: new Set([brand("leaf")]),
-                    },
-                ],
-            ]));
-            const schemaMap = new MapNodeStoredSchema({
-                kind: { identifier: FieldKinds.optional.identifier },
-                types: new Set([brand("leaf")]),
-            });
-            const stored = {
-                rootFieldSchema: {
-                    kind: { identifier: FieldKinds.optional.identifier },
-                    types: new Set([brand("map"), brand("object")]),
-                },
-                nodeSchema: new Map([
-                    [brand("map"), schemaMap],
-                    [brand("EmptyKey"), schemaEmptyKey],
-                    [brand("Recursive"), schemaRecursive],
-                    [brand("object"), schemaObject],
-                    [brand("leaf"), schemaLeaf],
-                ]),
-            };
-            const viewSchema = treeSchemaFromStoredSchema(stored);
-            assert.deepEqual(viewSchema.rootFieldSchema.types, stored.rootFieldSchema.types);
-            assert.deepEqual(viewSchema.nodeSchema.size, stored.nodeSchema.size);
-            for (const [key, nodeSchema] of viewSchema.nodeSchema) {
-                const storedNodeSchema = stored.nodeSchema.get(key) ?? assert.fail();
-                assert(nodeSchema instanceof TreeNodeSchemaBase);
-                assert.equal(nodeSchema.name, key);
-                if (storedNodeSchema instanceof MapNodeStoredSchema) {
-                    // Since its tested separately, assume fields are converted correctly.
-                    assert(nodeSchema instanceof FlexMapNodeSchema);
-                }
-                else {
-                    assert(!(nodeSchema instanceof FlexMapNodeSchema));
-                }
-                assert.equal(nodeSchema.leafValue, storedNodeSchema.leafValue);
-                if (nodeSchema instanceof FlexObjectNodeSchema) {
-                    assert(storedNodeSchema instanceof ObjectNodeStoredSchema);
-                    assert.equal(storedNodeSchema.objectNodeFields.size, nodeSchema.objectNodeFields.size);
-                    // Since it's tested separately, assume fields are converted correctly, and just compare keys to make sure all fields were converted.
-                    assert.deepEqual(new Set(storedNodeSchema.objectNodeFields.keys()), new Set(nodeSchema.objectNodeFields.keys()));
-                }
-            }
-        });
-    });
-});
-//# sourceMappingURL=storedToViewSchema.spec.js.map

package/lib/test/feature-libraries/storedToViewSchema.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"storedToViewSchema.spec.js","sourceRoot":"","sources":["../../../src/test/feature-libraries/storedToViewSchema.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EACN,QAAQ,EAER,oBAAoB,EACpB,mBAAmB,EACnB,sBAAsB,EAItB,WAAW,EACX,sBAAsB,GACtB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACN,GAAG,EACH,UAAU,EACV,cAAc,EACd,iBAAiB,EACjB,oBAAoB,EACpB,eAAe,EAEf,kBAAkB,GAClB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EACN,2BAA2B,EAC3B,0BAA0B;AAC1B,iEAAiE;AACjE,yDAAyD;EACzD,MAAM,+CAA+C,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IACnC,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;QAC5C,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CACpC,EAAE,IAAI,EAAE,GAAG,EAAE,EACb,KAAK,CAA2B,GAAG,CAAC,EACpC,WAAW,CAAC,MAAM,CAClB,CAAC;QACF,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CACpC,EAAE,IAAI,EAAE,GAAG,EAAE,EACb,KAAK,CAA2B,GAAG,CAAC,EACpC,WAAW,CAAC,MAAM,CAClB,CAAC;QACF,MAAM,SAAS,GAAG,IAAI,GAAG,CAA+C;YACvE,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC;YACvB,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC;SACvB,CAAC,CAAC;QACH,MAAM,SAAS,GAAG;YACjB,CAAC,KAAK,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3D,CAAC,WAAW,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAClE,CAAC,UAAU,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAC7D,CAAC,UAAU,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;YACpE,CAAC,MAAM,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;YACtE,CAAC,gBAAgB,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;SAC1E,CAAC;QACX,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE;YACtC,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;gBACb,MAAM,SAAS,GAAG,2BAA2B,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,4BAA4B,EAAE,GAAG,EAAE;QAC3C,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE;YAChB,MAAM,KAAK,GAAG,0BAA0B,CAAC;gBACxC,eAAe,EAAE,sBAAsB;gBACvC,UAAU,EAAE,IAAI,GAAG,EAAE;aACrB,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,WAAW,EAAE,GAAG,EAAE;YACpB,MAAM,UAAU,GAAG,IAAI,oBAAoB,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAEhE,MAAM,YAAY,GAAG,IAAI,sBAAsB,CAC9C,IAAI,GAAG,CAAkC;gBACxC;oBACC,KAAK,CAAW,KAAK,CAAC;oBACtB;wBACC,IAAI,EAAE,EAAE,UAAU,EAAE,UAAU,CAAC,QAAQ,CAAC,UAAU,EAAE;wBACpD,KAAK,EAAE,IAAI,GAAG,CAA2B,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;qBACzB;iBACjC;aAC6C,CAAC,CAChD,CAAC;YAEF,MAAM,eAAe,GAAG,IAAI,sBAAsB,CACjD,IAAI,GAAG,CAAkC;gBACxC;oBACC,KAAK,CAAW,KAAK,CAAC;oBACtB;wBACC,IAAI,EAAE,EAAE,UAAU,EAAE,UAAU,CAAC,QAAQ,CAAC,UAAU,EAAE;wBACpD,KAAK,EAAE,IAAI,GAAG,CAA2B,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;qBAC9B;iBACjC;aAC6C,CAAC,CAChD,CAAC;YAEF,qDAAqD;YACrD,MAAM,cAAc,GAAG,IAAI,sBAAsB,CAChD,IAAI,GAAG,CAAkC;gBACxC;oBACC,QAAQ;oBACR;wBACC,IAAI,EAAE,EAAE,UAAU,EAAE,UAAU,CAAC,QAAQ,CAAC,UAAU,EAAE;wBACpD,KAAK,EAAE,IAAI,GAAG,CAA2B,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;qBACzB;iBACjC;aAC6C,CAAC,CAChD,CAAC;YACF,MAAM,SAAS,GAAG,IAAI,mBAAmB,CAAC;gBACzC,IAAI,EAAE,EAAE,UAAU,EAAE,UAAU,CAAC,QAAQ,CAAC,UAAU,EAAE;gBACpD,KAAK,EAAE,IAAI,GAAG,CAA2B,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;aACzD,CAAC,CAAC;YACH,MAAM,MAAM,GAAG;gBACd,eAAe,EAAE;oBAChB,IAAI,EAAE,EAAE,UAAU,EAAE,UAAU,CAAC,QAAQ,CAAC,UAAU,EAAE;oBACpD,KAAK,EAAE,IAAI,GAAG,CAA2B,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;iBACzE;gBACD,UAAU,EAAE,IAAI,GAAG,CAAiD;oBACnE,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC;oBACzB,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,cAAc,CAAC;oBACnC,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,eAAe,CAAC;oBACrC,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;oBAC/B,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;iBAC3B,CAAC;aACF,CAAC;YACF,MAAM,UAAU,GAAG,0BAA0B,CAAC,MAAM,CAAC,CAAC;YACtD,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YACjF,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACrE,KAAK,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,UAAU,CAAC,UAAU,EAAE;gBACtD,MAAM,gBAAgB,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBACrE,MAAM,CAAC,UAAU,YAAY,kBAAkB,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACnC,IAAI,gBAAgB,YAAY,mBAAmB,EAAE;oBACpD,sEAAsE;oBACtE,MAAM,CAAC,UAAU,YAAY,iBAAiB,CAAC,CAAC;iBAChD;qBAAM;oBACN,MAAM,CAAC,CAAC,CAAC,UAAU,YAAY,iBAAiB,CAAC,CAAC,CAAC;iBACnD;gBAED,MAAM,CAAC,KAAK,CACV,UAAsC,CAAC,SAAS,EAChD,gBAAkD,CAAC,SAAS,CAC7D,CAAC;gBAEF,IAAI,UAAU,YAAY,oBAAoB,EAAE;oBAC/C,MAAM,CAAC,gBAAgB,YAAY,sBAAsB,CAAC,CAAC;oBAC3D,MAAM,CAAC,KAAK,CACX,gBAAgB,CAAC,gBAAgB,CAAC,IAAI,EACtC,UAAU,CAAC,gBAAgB,CAAC,IAAI,CAChC,CAAC;oBAEF,qIAAqI;oBACrI,MAAM,CAAC,SAAS,CACf,IAAI,GAAG,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC,EACjD,IAAI,GAAG,CAAC,UAAU,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC,CAC3C,CAAC;iBACF;aACD;QACF,CAAC,CAAC,CAAC;IACJ,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\tEmptyKey,\n\tFieldKey,\n\tLeafNodeStoredSchema,\n\tMapNodeStoredSchema,\n\tObjectNodeStoredSchema,\n\tTreeFieldStoredSchema,\n\tTreeNodeSchemaIdentifier,\n\tTreeNodeStoredSchema,\n\tValueSchema,\n\tstoredEmptyFieldSchema,\n} from \"../../core/index.js\";\nimport {\n\tAny,\n\tFieldKinds,\n\tLeafNodeSchema,\n\tFlexMapNodeSchema,\n\tFlexObjectNodeSchema,\n\tFlexFieldSchema,\n\tFlexTreeNodeSchema,\n\tTreeNodeSchemaBase,\n} from \"../../feature-libraries/index.js\";\nimport {\n\tfieldSchemaFromStoredSchema,\n\ttreeSchemaFromStoredSchema,\n\t// Allow importing from this specific file which is being tested:\n\t/* eslint-disable-next-line import/no-internal-modules */\n} from \"../../feature-libraries/storedToViewSchema.js\";\nimport { brand } from \"../../util/index.js\";\n\ndescribe(\"storedToViewSchema\", () => {\n\tdescribe(\"fieldSchemaFromStoredSchema\", () => {\n\t\tconst schemaX = LeafNodeSchema.create(\n\t\t\t{ name: \"z\" },\n\t\t\tbrand<TreeNodeSchemaIdentifier>(\"x\"),\n\t\t\tValueSchema.Number,\n\t\t);\n\t\tconst schemaY = LeafNodeSchema.create(\n\t\t\t{ name: \"z\" },\n\t\t\tbrand<TreeNodeSchemaIdentifier>(\"y\"),\n\t\t\tValueSchema.Number,\n\t\t);\n\t\tconst schemaMap = new Map<TreeNodeSchemaIdentifier, FlexTreeNodeSchema>([\n\t\t\t[schemaX.name, schemaX],\n\t\t\t[schemaY.name, schemaY],\n\t\t]);\n\t\tconst roundTrip = [\n\t\t\t[\"any\", FlexFieldSchema.create(FieldKinds.optional, [Any])],\n\t\t\t[\"forbidden\", FlexFieldSchema.create(FieldKinds.forbidden, [Any])],\n\t\t\t[\"no types\", FlexFieldSchema.create(FieldKinds.optional, [])],\n\t\t\t[\"one type\", FlexFieldSchema.create(FieldKinds.optional, [schemaX])],\n\t\t\t[\"lazy\", FlexFieldSchema.create(FieldKinds.optional, [() => schemaX])],\n\t\t\t[\"multiple types\", FlexFieldSchema.create(FieldKinds.optional, [schemaX, schemaY])],\n\t\t] as const;\n\t\tfor (const [name, field] of roundTrip) {\n\t\t\tit(name, () => {\n\t\t\t\tconst converted = fieldSchemaFromStoredSchema(field, schemaMap);\n\t\t\t\tassert(converted.equals(field));\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"treeSchemaFromStoredSchema\", () => {\n\t\tit(\"empty\", () => {\n\t\t\tconst empty = treeSchemaFromStoredSchema({\n\t\t\t\trootFieldSchema: storedEmptyFieldSchema,\n\t\t\t\tnodeSchema: new Map(),\n\t\t\t});\n\t\t\tassert(empty.rootFieldSchema.equals(FlexFieldSchema.empty));\n\t\t\tassert.deepEqual(empty.nodeSchema, new Map());\n\t\t});\n\n\t\tit(\"oneOfEach\", () => {\n\t\t\tconst schemaLeaf = new LeafNodeStoredSchema(ValueSchema.Number);\n\n\t\t\tconst schemaObject = new ObjectNodeStoredSchema(\n\t\t\t\tnew Map<FieldKey, TreeFieldStoredSchema>([\n\t\t\t\t\t[\n\t\t\t\t\t\tbrand<FieldKey>(\"foo\"),\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tkind: { identifier: FieldKinds.required.identifier },\n\t\t\t\t\t\t\ttypes: new Set<TreeNodeSchemaIdentifier>([brand(\"leaf\")]),\n\t\t\t\t\t\t} satisfies TreeFieldStoredSchema,\n\t\t\t\t\t],\n\t\t\t\t] satisfies [FieldKey, TreeFieldStoredSchema][]),\n\t\t\t);\n\n\t\t\tconst schemaRecursive = new ObjectNodeStoredSchema(\n\t\t\t\tnew Map<FieldKey, TreeFieldStoredSchema>([\n\t\t\t\t\t[\n\t\t\t\t\t\tbrand<FieldKey>(\"foo\"),\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tkind: { identifier: FieldKinds.optional.identifier },\n\t\t\t\t\t\t\ttypes: new Set<TreeNodeSchemaIdentifier>([brand(\"Recursive\")]),\n\t\t\t\t\t\t} satisfies TreeFieldStoredSchema,\n\t\t\t\t\t],\n\t\t\t\t] satisfies [FieldKey, TreeFieldStoredSchema][]),\n\t\t\t);\n\n\t\t\t// Current policy is to treat this case as an object.\n\t\t\tconst schemaEmptyKey = new ObjectNodeStoredSchema(\n\t\t\t\tnew Map<FieldKey, TreeFieldStoredSchema>([\n\t\t\t\t\t[\n\t\t\t\t\t\tEmptyKey,\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tkind: { identifier: FieldKinds.required.identifier },\n\t\t\t\t\t\t\ttypes: new Set<TreeNodeSchemaIdentifier>([brand(\"leaf\")]),\n\t\t\t\t\t\t} satisfies TreeFieldStoredSchema,\n\t\t\t\t\t],\n\t\t\t\t] satisfies [FieldKey, TreeFieldStoredSchema][]),\n\t\t\t);\n\t\t\tconst schemaMap = new MapNodeStoredSchema({\n\t\t\t\tkind: { identifier: FieldKinds.optional.identifier },\n\t\t\t\ttypes: new Set<TreeNodeSchemaIdentifier>([brand(\"leaf\")]),\n\t\t\t});\n\t\t\tconst stored = {\n\t\t\t\trootFieldSchema: {\n\t\t\t\t\tkind: { identifier: FieldKinds.optional.identifier },\n\t\t\t\t\ttypes: new Set<TreeNodeSchemaIdentifier>([brand(\"map\"), brand(\"object\")]),\n\t\t\t\t},\n\t\t\t\tnodeSchema: new Map<TreeNodeSchemaIdentifier, TreeNodeStoredSchema>([\n\t\t\t\t\t[brand(\"map\"), schemaMap],\n\t\t\t\t\t[brand(\"EmptyKey\"), schemaEmptyKey],\n\t\t\t\t\t[brand(\"Recursive\"), schemaRecursive],\n\t\t\t\t\t[brand(\"object\"), schemaObject],\n\t\t\t\t\t[brand(\"leaf\"), schemaLeaf],\n\t\t\t\t]),\n\t\t\t};\n\t\t\tconst viewSchema = treeSchemaFromStoredSchema(stored);\n\t\t\tassert.deepEqual(viewSchema.rootFieldSchema.types, stored.rootFieldSchema.types);\n\t\t\tassert.deepEqual(viewSchema.nodeSchema.size, stored.nodeSchema.size);\n\t\t\tfor (const [key, nodeSchema] of viewSchema.nodeSchema) {\n\t\t\t\tconst storedNodeSchema = stored.nodeSchema.get(key) ?? assert.fail();\n\t\t\t\tassert(nodeSchema instanceof TreeNodeSchemaBase);\n\t\t\t\tassert.equal(nodeSchema.name, key);\n\t\t\t\tif (storedNodeSchema instanceof MapNodeStoredSchema) {\n\t\t\t\t\t// Since its tested separately, assume fields are converted correctly.\n\t\t\t\t\tassert(nodeSchema instanceof FlexMapNodeSchema);\n\t\t\t\t} else {\n\t\t\t\t\tassert(!(nodeSchema instanceof FlexMapNodeSchema));\n\t\t\t\t}\n\n\t\t\t\tassert.equal(\n\t\t\t\t\t(nodeSchema as Partial<LeafNodeSchema>).leafValue,\n\t\t\t\t\t(storedNodeSchema as Partial<LeafNodeStoredSchema>).leafValue,\n\t\t\t\t);\n\n\t\t\t\tif (nodeSchema instanceof FlexObjectNodeSchema) {\n\t\t\t\t\tassert(storedNodeSchema instanceof ObjectNodeStoredSchema);\n\t\t\t\t\tassert.equal(\n\t\t\t\t\t\tstoredNodeSchema.objectNodeFields.size,\n\t\t\t\t\t\tnodeSchema.objectNodeFields.size,\n\t\t\t\t\t);\n\n\t\t\t\t\t// Since it's tested separately, assume fields are converted correctly, and just compare keys to make sure all fields were converted.\n\t\t\t\t\tassert.deepEqual(\n\t\t\t\t\t\tnew Set(storedNodeSchema.objectNodeFields.keys()),\n\t\t\t\t\t\tnew Set(nodeSchema.objectNodeFields.keys()),\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t});\n});\n"]}

package/lib/test/feature-libraries/treeCursorUtils.spec.d.ts

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

package/lib/test/feature-libraries/treeCursorUtils.spec.d.ts.map

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

package/lib/test/feature-libraries/treeCursorUtils.spec.js

@@ -1,237 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { compareFieldUpPaths, compareUpPaths, } from "../../core/index.js";
-import { PrefixedPath, prefixFieldPath, prefixPath, stackTreeFieldCursor, stackTreeNodeCursor,
-// Allow importing from this specific file which is being tested:
-// eslint-disable-next-line import/no-internal-modules
- } from "../../feature-libraries/treeCursorUtils.js";
-import { brand } from "../../util/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { adapter } from "../../feature-libraries/treeTextCursor.js";
-import { leaf } from "../../domains/index.js";
-import { expectEqualFieldPaths, expectEqualPaths } from "../utils.js";
-describe("treeCursorUtils", () => {
-    const root = {
-        parent: undefined,
-        parentField: brand("x"),
-        parentIndex: 5,
-    };
-    const child = {
-        parent: root,
-        parentField: brand("z"),
-        parentIndex: 10,
-    };
-    describe("prefixPath", () => {
-        it("not wrapped cases", () => {
-            assert.equal(prefixPath(undefined, undefined), undefined);
-            assert.equal(prefixPath({}, undefined), undefined);
-            assert.equal(prefixPath(undefined, root), root);
-            assert.equal(prefixPath({}, root), root);
-            assert.equal(prefixPath({ indexOffset: 1, rootFieldOverride: brand("y") }, undefined), undefined);
-        });
-        it("wrapped root", () => {
-            assert(compareUpPaths(prefixPath({ indexOffset: 1 }, root), {
-                parent: undefined,
-                parentField: brand("x"),
-                parentIndex: 6,
-            }));
-            assert(compareUpPaths(prefixPath({ rootFieldOverride: brand("y") }, root), {
-                parent: undefined,
-                parentField: brand("y"),
-                parentIndex: 5,
-            }));
-            assert(compareUpPaths(prefixPath({ parent: root }, root), {
-                parent: root,
-                parentField: brand("x"),
-                parentIndex: 5,
-            }));
-            assert(compareUpPaths(prefixPath({ indexOffset: 2, rootFieldOverride: brand("y"), parent: child }, root), {
-                parent: child,
-                parentField: brand("y"),
-                parentIndex: 7,
-            }));
-        });
-        it("wrapped child", () => {
-            assert(compareUpPaths(prefixPath({ indexOffset: 1 }, child), {
-                parent: {
-                    parent: undefined,
-                    parentField: brand("x"),
-                    parentIndex: 6,
-                },
-                parentField: brand("z"),
-                parentIndex: 10,
-            }));
-            assert(compareUpPaths(prefixPath({ rootFieldOverride: brand("y") }, child), {
-                parent: {
-                    parent: undefined,
-                    parentField: brand("y"),
-                    parentIndex: 5,
-                },
-                parentField: brand("z"),
-                parentIndex: 10,
-            }));
-            assert(compareUpPaths(prefixPath({ parent: root }, child), {
-                parent: {
-                    parent: root,
-                    parentField: brand("x"),
-                    parentIndex: 5,
-                },
-                parentField: brand("z"),
-                parentIndex: 10,
-            }));
-            assert(compareUpPaths(prefixPath({ indexOffset: 2, rootFieldOverride: brand("y"), parent: child }, child), {
-                parent: {
-                    parent: child,
-                    parentField: brand("y"),
-                    parentIndex: 7,
-                },
-                parentField: brand("z"),
-                parentIndex: 10,
-            }));
-        });
-        it("double wrapped root", () => {
-            const prefixed = prefixPath({ indexOffset: 1 }, root);
-            const prefixedAgain = prefixPath({ indexOffset: 2 }, prefixed);
-            // Check result is correct
-            assert(compareUpPaths(prefixed, {
-                parent: undefined,
-                parentField: brand("x"),
-                parentIndex: 6,
-            }));
-            assert(compareUpPaths(prefixedAgain, {
-                parent: undefined,
-                parentField: brand("x"),
-                parentIndex: 8,
-            }));
-            assert(prefixed instanceof PrefixedPath);
-            assert(prefixedAgain instanceof PrefixedPath);
-            // Check optimization to avoid double wrapping worked
-            assert(!(prefixedAgain.path instanceof PrefixedPath));
-        });
-        it("double wrapped child", () => {
-            const prefixed = prefixPath({ indexOffset: 1, rootFieldOverride: brand("c") }, child);
-            const prefixedAgain = prefixPath({ indexOffset: 2 }, prefixed);
-            // Check result is correct
-            assert(compareUpPaths(prefixed, {
-                parent: {
-                    parent: undefined,
-                    parentField: brand("c"),
-                    parentIndex: 6,
-                },
-                parentField: brand("z"),
-                parentIndex: 10,
-            }));
-            assert(compareUpPaths(prefixedAgain, {
-                parent: {
-                    parent: undefined,
-                    parentField: brand("c"),
-                    parentIndex: 8,
-                },
-                parentField: brand("z"),
-                parentIndex: 10,
-            }));
-            assert(prefixed instanceof PrefixedPath);
-            assert(prefixedAgain instanceof PrefixedPath);
-            // Check optimization to avoid double wrapping worked
-            assert(!(prefixedAgain.path instanceof PrefixedPath));
-        });
-        it("double prefixed", () => {
-            const prefixed = prefixPath({ indexOffset: 1, rootFieldOverride: brand("b"), parent: root }, root);
-            const prefixedAgain = prefixPath({ indexOffset: 2, rootFieldOverride: brand("a"), parent: root }, prefixed);
-            // Check result is correct
-            assert(compareUpPaths(prefixed, {
-                parent: root,
-                parentField: brand("b"),
-                parentIndex: 6,
-            }));
-            assert(compareUpPaths(prefixedAgain, {
-                parent: {
-                    parent: root,
-                    parentField: brand("a"),
-                    parentIndex: 7,
-                },
-                parentField: brand("b"),
-                parentIndex: 6,
-            }));
-            assert(prefixed instanceof PrefixedPath);
-            assert(prefixedAgain instanceof PrefixedPath);
-            // Check optimization to avoid double wrapping worked
-            assert(!(prefixedAgain.path instanceof PrefixedPath));
-        });
-    });
-    it("prefixFieldPath", () => {
-        const rootFieldPath = {
-            parent: undefined,
-            field: brand("a"),
-        };
-        assert.equal(prefixFieldPath(undefined, rootFieldPath), rootFieldPath);
-        assert.equal(prefixFieldPath({}, rootFieldPath), rootFieldPath);
-        assert.equal(prefixFieldPath(undefined, rootFieldPath), rootFieldPath);
-        assert.equal(prefixFieldPath({ indexOffset: 0 }, rootFieldPath), rootFieldPath);
-        assert(compareFieldUpPaths(prefixFieldPath({ indexOffset: 1, rootFieldOverride: brand("b"), parent: root }, rootFieldPath), {
-            parent: root,
-            field: brand("b"),
-        }));
-        const childFieldPath = {
-            parent: root,
-            field: brand("a"),
-        };
-        assert(compareFieldUpPaths(prefixFieldPath({ indexOffset: 1, rootFieldOverride: brand("b") }, childFieldPath), {
-            parent: {
-                parent: undefined,
-                parentField: brand("b"),
-                parentIndex: 6,
-            },
-            field: brand("a"),
-        }));
-    });
-    // These tests could ust some custom test adapter implementation, but for simplicity use existing ones.
-    // Note that these existing cursors also run through the cursor test suite, which provides general coverage.
-    // These are just some rally targeted small units tests.
-    describe("stackTreeNodeCursor", () => {
-        it("construction and paths", () => {
-            const cursor = stackTreeNodeCursor(adapter, {
-                type: brand("foo"),
-                fields: { bar: [{ type: leaf.number.name, value: 5 }] },
-            });
-            assert.equal(cursor.mode, 0 /* CursorLocationType.Nodes */);
-            assert.equal(cursor.getPath(), undefined);
-            cursor.enterField(brand("bar"));
-            expectEqualFieldPaths(cursor.getFieldPath(), {
-                parent: undefined,
-                field: brand("bar"),
-            });
-        });
-    });
-    describe("stackTreeFieldCursor", () => {
-        it("construction and paths", () => {
-            const empty = stackTreeFieldCursor(adapter, { type: brand("dummy") }, brand("key"));
-            assert.equal(empty.mode, 1 /* CursorLocationType.Fields */);
-            const path1 = empty.getFieldPath();
-            // Confirm path is whats expected:
-            // dummy parent node shows up as "undefined", and detached sequence shows up as the key:
-            expectEqualFieldPaths(path1, { parent: undefined, field: brand("key") });
-            assert.equal(empty.firstNode(), false);
-            const twoItems = stackTreeFieldCursor(adapter, {
-                type: brand("dummy"),
-                fields: {
-                    key: [
-                        { type: leaf.number.name, value: 5 },
-                        { type: leaf.number.name, value: 6 },
-                    ],
-                },
-            }, brand("key"));
-            assert.equal(twoItems.getFieldLength(), 2);
-            twoItems.enterNode(0);
-            expectEqualPaths(twoItems.getPath(), {
-                parent: undefined,
-                parentField: brand("key"),
-                parentIndex: 0,
-            });
-        });
-    });
-});
-//# sourceMappingURL=treeCursorUtils.spec.js.map

package/lib/test/feature-libraries/treeCursorUtils.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"treeCursorUtils.spec.js","sourceRoot":"","sources":["../../../src/test/feature-libraries/treeCursorUtils.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EACN,mBAAmB,EACnB,cAAc,GAMd,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EACN,YAAY,EACZ,eAAe,EACf,UAAU,EACV,oBAAoB,EACpB,mBAAmB;AACnB,iEAAiE;AACjE,sDAAsD;EACtD,MAAM,4CAA4C,CAAC;AACpD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,sDAAsD;AACtD,OAAO,EAAE,OAAO,EAAE,MAAM,2CAA2C,CAAC;AACpE,OAAO,EAAE,IAAI,EAAE,MAAM,wBAAwB,CAAC;AAC9C,OAAO,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAEtE,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAChC,MAAM,IAAI,GAAW;QACpB,MAAM,EAAE,SAAS;QACjB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;QACvB,WAAW,EAAE,CAAC;KACd,CAAC;IACF,MAAM,KAAK,GAAW;QACrB,MAAM,EAAE,IAAI;QACZ,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;QACvB,WAAW,EAAE,EAAE;KACf,CAAC;IACF,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC3B,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,EAAE,SAAS,CAAC,EAAE,SAAS,CAAC,CAAC;YAC1D,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,SAAS,CAAC,CAAC;YACnD,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YAChD,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YACzC,MAAM,CAAC,KAAK,CACX,UAAU,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,EACxE,SAAS,CACT,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YACvB,MAAM,CACL,cAAc,CAAC,UAAU,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE;gBACpD,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,CAAC;aACd,CAAC,CACF,CAAC;YACF,MAAM,CACL,cAAc,CAAC,UAAU,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE;gBACnE,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,CAAC;aACd,CAAC,CACF,CAAC;YACF,MAAM,CACL,cAAc,CAAC,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE;gBAClD,MAAM,EAAE,IAAI;gBACZ,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,CAAC;aACd,CAAC,CACF,CAAC;YACF,MAAM,CACL,cAAc,CACb,UAAU,CACT,EAAE,WAAW,EAAE,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAChE,IAAI,CACJ,EACD;gBACC,MAAM,EAAE,KAAK;gBACb,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,CAAC;aACd,CACD,CACD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;YACxB,MAAM,CACL,cAAc,CAAC,UAAU,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE;gBACrD,MAAM,EAAE;oBACP,MAAM,EAAE,SAAS;oBACjB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;oBACvB,WAAW,EAAE,CAAC;iBACd;gBACD,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,EAAE;aACf,CAAC,CACF,CAAC;YACF,MAAM,CACL,cAAc,CAAC,UAAU,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE;gBACpE,MAAM,EAAE;oBACP,MAAM,EAAE,SAAS;oBACjB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;oBACvB,WAAW,EAAE,CAAC;iBACd;gBACD,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,EAAE;aACf,CAAC,CACF,CAAC;YACF,MAAM,CACL,cAAc,CAAC,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,KAAK,CAAC,EAAE;gBACnD,MAAM,EAAE;oBACP,MAAM,EAAE,IAAI;oBACZ,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;oBACvB,WAAW,EAAE,CAAC;iBACd;gBACD,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,EAAE;aACf,CAAC,CACF,CAAC;YACF,MAAM,CACL,cAAc,CACb,UAAU,CACT,EAAE,WAAW,EAAE,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAChE,KAAK,CACL,EACD;gBACC,MAAM,EAAE;oBACP,MAAM,EAAE,KAAK;oBACb,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;oBACvB,WAAW,EAAE,CAAC;iBACd;gBACD,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,EAAE;aACf,CACD,CACD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,QAAQ,GAAG,UAAU,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACtD,MAAM,aAAa,GAAG,UAAU,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YAE/D,0BAA0B;YAC1B,MAAM,CACL,cAAc,CAAC,QAAQ,EAAE;gBACxB,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,CAAC;aACd,CAAC,CACF,CAAC;YACF,MAAM,CACL,cAAc,CAAC,aAAa,EAAE;gBAC7B,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,CAAC;aACd,CAAC,CACF,CAAC;YAEF,MAAM,CAAC,QAAQ,YAAY,YAAY,CAAC,CAAC;YACzC,MAAM,CAAC,aAAa,YAAY,YAAY,CAAC,CAAC;YAC9C,qDAAqD;YACrD,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,YAAY,YAAY,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,QAAQ,GAAG,UAAU,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACtF,MAAM,aAAa,GAAG,UAAU,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YAE/D,0BAA0B;YAC1B,MAAM,CACL,cAAc,CAAC,QAAQ,EAAE;gBACxB,MAAM,EAAE;oBACP,MAAM,EAAE,SAAS;oBACjB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;oBACvB,WAAW,EAAE,CAAC;iBACd;gBACD,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,EAAE;aACf,CAAC,CACF,CAAC;YACF,MAAM,CACL,cAAc,CAAC,aAAa,EAAE;gBAC7B,MAAM,EAAE;oBACP,MAAM,EAAE,SAAS;oBACjB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;oBACvB,WAAW,EAAE,CAAC;iBACd;gBACD,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,EAAE;aACf,CAAC,CACF,CAAC;YAEF,MAAM,CAAC,QAAQ,YAAY,YAAY,CAAC,CAAC;YACzC,MAAM,CAAC,aAAa,YAAY,YAAY,CAAC,CAAC;YAC9C,qDAAqD;YACrD,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,YAAY,YAAY,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC1B,MAAM,QAAQ,GAAG,UAAU,CAC1B,EAAE,WAAW,EAAE,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAC/D,IAAI,CACJ,CAAC;YACF,MAAM,aAAa,GAAG,UAAU,CAC/B,EAAE,WAAW,EAAE,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAC/D,QAAQ,CACR,CAAC;YAEF,0BAA0B;YAC1B,MAAM,CACL,cAAc,CAAC,QAAQ,EAAE;gBACxB,MAAM,EAAE,IAAI;gBACZ,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,CAAC;aACd,CAAC,CACF,CAAC;YACF,MAAM,CACL,cAAc,CAAC,aAAa,EAAE;gBAC7B,MAAM,EAAE;oBACP,MAAM,EAAE,IAAI;oBACZ,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;oBACvB,WAAW,EAAE,CAAC;iBACd;gBACD,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,CAAC;aACd,CAAC,CACF,CAAC;YAEF,MAAM,CAAC,QAAQ,YAAY,YAAY,CAAC,CAAC;YACzC,MAAM,CAAC,aAAa,YAAY,YAAY,CAAC,CAAC;YAC9C,qDAAqD;YACrD,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,YAAY,YAAY,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC1B,MAAM,aAAa,GAAgB;YAClC,MAAM,EAAE,SAAS;YACjB,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;SACjB,CAAC;QACF,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,SAAS,EAAE,aAAa,CAAC,EAAE,aAAa,CAAC,CAAC;QACvE,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,EAAE,EAAE,aAAa,CAAC,EAAE,aAAa,CAAC,CAAC;QAChE,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,SAAS,EAAE,aAAa,CAAC,EAAE,aAAa,CAAC,CAAC;QACvE,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,aAAa,CAAC,EAAE,aAAa,CAAC,CAAC;QAChF,MAAM,CACL,mBAAmB,CAClB,eAAe,CACd,EAAE,WAAW,EAAE,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAC/D,aAAa,CACb,EACD;YACC,MAAM,EAAE,IAAI;YACZ,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;SACjB,CACD,CACD,CAAC;QAEF,MAAM,cAAc,GAAgB;YACnC,MAAM,EAAE,IAAI;YACZ,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;SACjB,CAAC;QAEF,MAAM,CACL,mBAAmB,CAClB,eAAe,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc,CAAC,EAClF;YACC,MAAM,EAAE;gBACP,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;gBACvB,WAAW,EAAE,CAAC;aACd;YACD,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;SACjB,CACD,CACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,uGAAuG;IACvG,4GAA4G;IAC5G,wDAAwD;IACxD,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACpC,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;YACjC,MAAM,MAAM,GAAG,mBAAmB,CAAC,OAAO,EAAE;gBAC3C,IAAI,EAAE,KAAK,CAA2B,KAAK,CAAC;gBAC5C,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE;aACvD,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,mCAA2B,CAAC;YACpD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,SAAS,CAAC,CAAC;YAC1C,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YAChC,qBAAqB,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE;gBAC5C,MAAM,EAAE,SAAS;gBACjB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;aACnB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;QACrC,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,oBAAoB,CACjC,OAAO,EACP,EAAE,IAAI,EAAE,KAAK,CAA2B,OAAO,CAAC,EAAE,EAClD,KAAK,CAAC,KAAK,CAAC,CACZ,CAAC;YACF,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,oCAA4B,CAAC;YACpD,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;YACnC,kCAAkC;YAClC,wFAAwF;YACxF,qBAAqB,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACzE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC,CAAC;YAEvC,MAAM,QAAQ,GAAG,oBAAoB,CACpC,OAAO,EACP;gBACC,IAAI,EAAE,KAAK,CAA2B,OAAO,CAAC;gBAC9C,MAAM,EAAE;oBACP,GAAG,EAAE;wBACJ,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE;wBACpC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE;qBACpC;iBACD;aACD,EACD,KAAK,CAAgB,KAAK,CAAC,CAC3B,CAAC;YACF,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3C,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACtB,gBAAgB,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE;gBACpC,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC;gBACzB,WAAW,EAAE,CAAC;aACd,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,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\tcompareFieldUpPaths,\n\tcompareUpPaths,\n\tCursorLocationType,\n\tDetachedField,\n\tFieldUpPath,\n\tTreeNodeSchemaIdentifier,\n\tUpPath,\n} from \"../../core/index.js\";\n\nimport {\n\tPrefixedPath,\n\tprefixFieldPath,\n\tprefixPath,\n\tstackTreeFieldCursor,\n\tstackTreeNodeCursor,\n\t// Allow importing from this specific file which is being tested:\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../feature-libraries/treeCursorUtils.js\";\nimport { brand } from \"../../util/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { adapter } from \"../../feature-libraries/treeTextCursor.js\";\nimport { leaf } from \"../../domains/index.js\";\nimport { expectEqualFieldPaths, expectEqualPaths } from \"../utils.js\";\n\ndescribe(\"treeCursorUtils\", () => {\n\tconst root: UpPath = {\n\t\tparent: undefined,\n\t\tparentField: brand(\"x\"),\n\t\tparentIndex: 5,\n\t};\n\tconst child: UpPath = {\n\t\tparent: root,\n\t\tparentField: brand(\"z\"),\n\t\tparentIndex: 10,\n\t};\n\tdescribe(\"prefixPath\", () => {\n\t\tit(\"not wrapped cases\", () => {\n\t\t\tassert.equal(prefixPath(undefined, undefined), undefined);\n\t\t\tassert.equal(prefixPath({}, undefined), undefined);\n\t\t\tassert.equal(prefixPath(undefined, root), root);\n\t\t\tassert.equal(prefixPath({}, root), root);\n\t\t\tassert.equal(\n\t\t\t\tprefixPath({ indexOffset: 1, rootFieldOverride: brand(\"y\") }, undefined),\n\t\t\t\tundefined,\n\t\t\t);\n\t\t});\n\n\t\tit(\"wrapped root\", () => {\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixPath({ indexOffset: 1 }, root), {\n\t\t\t\t\tparent: undefined,\n\t\t\t\t\tparentField: brand(\"x\"),\n\t\t\t\t\tparentIndex: 6,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixPath({ rootFieldOverride: brand(\"y\") }, root), {\n\t\t\t\t\tparent: undefined,\n\t\t\t\t\tparentField: brand(\"y\"),\n\t\t\t\t\tparentIndex: 5,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixPath({ parent: root }, root), {\n\t\t\t\t\tparent: root,\n\t\t\t\t\tparentField: brand(\"x\"),\n\t\t\t\t\tparentIndex: 5,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(\n\t\t\t\t\tprefixPath(\n\t\t\t\t\t\t{ indexOffset: 2, rootFieldOverride: brand(\"y\"), parent: child },\n\t\t\t\t\t\troot,\n\t\t\t\t\t),\n\t\t\t\t\t{\n\t\t\t\t\t\tparent: child,\n\t\t\t\t\t\tparentField: brand(\"y\"),\n\t\t\t\t\t\tparentIndex: 7,\n\t\t\t\t\t},\n\t\t\t\t),\n\t\t\t);\n\t\t});\n\n\t\tit(\"wrapped child\", () => {\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixPath({ indexOffset: 1 }, child), {\n\t\t\t\t\tparent: {\n\t\t\t\t\t\tparent: undefined,\n\t\t\t\t\t\tparentField: brand(\"x\"),\n\t\t\t\t\t\tparentIndex: 6,\n\t\t\t\t\t},\n\t\t\t\t\tparentField: brand(\"z\"),\n\t\t\t\t\tparentIndex: 10,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixPath({ rootFieldOverride: brand(\"y\") }, child), {\n\t\t\t\t\tparent: {\n\t\t\t\t\t\tparent: undefined,\n\t\t\t\t\t\tparentField: brand(\"y\"),\n\t\t\t\t\t\tparentIndex: 5,\n\t\t\t\t\t},\n\t\t\t\t\tparentField: brand(\"z\"),\n\t\t\t\t\tparentIndex: 10,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixPath({ parent: root }, child), {\n\t\t\t\t\tparent: {\n\t\t\t\t\t\tparent: root,\n\t\t\t\t\t\tparentField: brand(\"x\"),\n\t\t\t\t\t\tparentIndex: 5,\n\t\t\t\t\t},\n\t\t\t\t\tparentField: brand(\"z\"),\n\t\t\t\t\tparentIndex: 10,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(\n\t\t\t\t\tprefixPath(\n\t\t\t\t\t\t{ indexOffset: 2, rootFieldOverride: brand(\"y\"), parent: child },\n\t\t\t\t\t\tchild,\n\t\t\t\t\t),\n\t\t\t\t\t{\n\t\t\t\t\t\tparent: {\n\t\t\t\t\t\t\tparent: child,\n\t\t\t\t\t\t\tparentField: brand(\"y\"),\n\t\t\t\t\t\t\tparentIndex: 7,\n\t\t\t\t\t\t},\n\t\t\t\t\t\tparentField: brand(\"z\"),\n\t\t\t\t\t\tparentIndex: 10,\n\t\t\t\t\t},\n\t\t\t\t),\n\t\t\t);\n\t\t});\n\n\t\tit(\"double wrapped root\", () => {\n\t\t\tconst prefixed = prefixPath({ indexOffset: 1 }, root);\n\t\t\tconst prefixedAgain = prefixPath({ indexOffset: 2 }, prefixed);\n\n\t\t\t// Check result is correct\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixed, {\n\t\t\t\t\tparent: undefined,\n\t\t\t\t\tparentField: brand(\"x\"),\n\t\t\t\t\tparentIndex: 6,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixedAgain, {\n\t\t\t\t\tparent: undefined,\n\t\t\t\t\tparentField: brand(\"x\"),\n\t\t\t\t\tparentIndex: 8,\n\t\t\t\t}),\n\t\t\t);\n\n\t\t\tassert(prefixed instanceof PrefixedPath);\n\t\t\tassert(prefixedAgain instanceof PrefixedPath);\n\t\t\t// Check optimization to avoid double wrapping worked\n\t\t\tassert(!(prefixedAgain.path instanceof PrefixedPath));\n\t\t});\n\n\t\tit(\"double wrapped child\", () => {\n\t\t\tconst prefixed = prefixPath({ indexOffset: 1, rootFieldOverride: brand(\"c\") }, child);\n\t\t\tconst prefixedAgain = prefixPath({ indexOffset: 2 }, prefixed);\n\n\t\t\t// Check result is correct\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixed, {\n\t\t\t\t\tparent: {\n\t\t\t\t\t\tparent: undefined,\n\t\t\t\t\t\tparentField: brand(\"c\"),\n\t\t\t\t\t\tparentIndex: 6,\n\t\t\t\t\t},\n\t\t\t\t\tparentField: brand(\"z\"),\n\t\t\t\t\tparentIndex: 10,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixedAgain, {\n\t\t\t\t\tparent: {\n\t\t\t\t\t\tparent: undefined,\n\t\t\t\t\t\tparentField: brand(\"c\"),\n\t\t\t\t\t\tparentIndex: 8,\n\t\t\t\t\t},\n\t\t\t\t\tparentField: brand(\"z\"),\n\t\t\t\t\tparentIndex: 10,\n\t\t\t\t}),\n\t\t\t);\n\n\t\t\tassert(prefixed instanceof PrefixedPath);\n\t\t\tassert(prefixedAgain instanceof PrefixedPath);\n\t\t\t// Check optimization to avoid double wrapping worked\n\t\t\tassert(!(prefixedAgain.path instanceof PrefixedPath));\n\t\t});\n\n\t\tit(\"double prefixed\", () => {\n\t\t\tconst prefixed = prefixPath(\n\t\t\t\t{ indexOffset: 1, rootFieldOverride: brand(\"b\"), parent: root },\n\t\t\t\troot,\n\t\t\t);\n\t\t\tconst prefixedAgain = prefixPath(\n\t\t\t\t{ indexOffset: 2, rootFieldOverride: brand(\"a\"), parent: root },\n\t\t\t\tprefixed,\n\t\t\t);\n\n\t\t\t// Check result is correct\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixed, {\n\t\t\t\t\tparent: root,\n\t\t\t\t\tparentField: brand(\"b\"),\n\t\t\t\t\tparentIndex: 6,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tcompareUpPaths(prefixedAgain, {\n\t\t\t\t\tparent: {\n\t\t\t\t\t\tparent: root,\n\t\t\t\t\t\tparentField: brand(\"a\"),\n\t\t\t\t\t\tparentIndex: 7,\n\t\t\t\t\t},\n\t\t\t\t\tparentField: brand(\"b\"),\n\t\t\t\t\tparentIndex: 6,\n\t\t\t\t}),\n\t\t\t);\n\n\t\t\tassert(prefixed instanceof PrefixedPath);\n\t\t\tassert(prefixedAgain instanceof PrefixedPath);\n\t\t\t// Check optimization to avoid double wrapping worked\n\t\t\tassert(!(prefixedAgain.path instanceof PrefixedPath));\n\t\t});\n\t});\n\n\tit(\"prefixFieldPath\", () => {\n\t\tconst rootFieldPath: FieldUpPath = {\n\t\t\tparent: undefined,\n\t\t\tfield: brand(\"a\"),\n\t\t};\n\t\tassert.equal(prefixFieldPath(undefined, rootFieldPath), rootFieldPath);\n\t\tassert.equal(prefixFieldPath({}, rootFieldPath), rootFieldPath);\n\t\tassert.equal(prefixFieldPath(undefined, rootFieldPath), rootFieldPath);\n\t\tassert.equal(prefixFieldPath({ indexOffset: 0 }, rootFieldPath), rootFieldPath);\n\t\tassert(\n\t\t\tcompareFieldUpPaths(\n\t\t\t\tprefixFieldPath(\n\t\t\t\t\t{ indexOffset: 1, rootFieldOverride: brand(\"b\"), parent: root },\n\t\t\t\t\trootFieldPath,\n\t\t\t\t),\n\t\t\t\t{\n\t\t\t\t\tparent: root,\n\t\t\t\t\tfield: brand(\"b\"),\n\t\t\t\t},\n\t\t\t),\n\t\t);\n\n\t\tconst childFieldPath: FieldUpPath = {\n\t\t\tparent: root,\n\t\t\tfield: brand(\"a\"),\n\t\t};\n\n\t\tassert(\n\t\t\tcompareFieldUpPaths(\n\t\t\t\tprefixFieldPath({ indexOffset: 1, rootFieldOverride: brand(\"b\") }, childFieldPath),\n\t\t\t\t{\n\t\t\t\t\tparent: {\n\t\t\t\t\t\tparent: undefined,\n\t\t\t\t\t\tparentField: brand(\"b\"),\n\t\t\t\t\t\tparentIndex: 6,\n\t\t\t\t\t},\n\t\t\t\t\tfield: brand(\"a\"),\n\t\t\t\t},\n\t\t\t),\n\t\t);\n\t});\n\n\t// These tests could ust some custom test adapter implementation, but for simplicity use existing ones.\n\t// Note that these existing cursors also run through the cursor test suite, which provides general coverage.\n\t// These are just some rally targeted small units tests.\n\tdescribe(\"stackTreeNodeCursor\", () => {\n\t\tit(\"construction and paths\", () => {\n\t\t\tconst cursor = stackTreeNodeCursor(adapter, {\n\t\t\t\ttype: brand<TreeNodeSchemaIdentifier>(\"foo\"),\n\t\t\t\tfields: { bar: [{ type: leaf.number.name, value: 5 }] },\n\t\t\t});\n\t\t\tassert.equal(cursor.mode, CursorLocationType.Nodes);\n\t\t\tassert.equal(cursor.getPath(), undefined);\n\t\t\tcursor.enterField(brand(\"bar\"));\n\t\t\texpectEqualFieldPaths(cursor.getFieldPath(), {\n\t\t\t\tparent: undefined,\n\t\t\t\tfield: brand(\"bar\"),\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe(\"stackTreeFieldCursor\", () => {\n\t\tit(\"construction and paths\", () => {\n\t\t\tconst empty = stackTreeFieldCursor(\n\t\t\t\tadapter,\n\t\t\t\t{ type: brand<TreeNodeSchemaIdentifier>(\"dummy\") },\n\t\t\t\tbrand(\"key\"),\n\t\t\t);\n\t\t\tassert.equal(empty.mode, CursorLocationType.Fields);\n\t\t\tconst path1 = empty.getFieldPath();\n\t\t\t// Confirm path is whats expected:\n\t\t\t// dummy parent node shows up as \"undefined\", and detached sequence shows up as the key:\n\t\t\texpectEqualFieldPaths(path1, { parent: undefined, field: brand(\"key\") });\n\t\t\tassert.equal(empty.firstNode(), false);\n\n\t\t\tconst twoItems = stackTreeFieldCursor(\n\t\t\t\tadapter,\n\t\t\t\t{\n\t\t\t\t\ttype: brand<TreeNodeSchemaIdentifier>(\"dummy\"),\n\t\t\t\t\tfields: {\n\t\t\t\t\t\tkey: [\n\t\t\t\t\t\t\t{ type: leaf.number.name, value: 5 },\n\t\t\t\t\t\t\t{ type: leaf.number.name, value: 6 },\n\t\t\t\t\t\t],\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t\tbrand<DetachedField>(\"key\"),\n\t\t\t);\n\t\t\tassert.equal(twoItems.getFieldLength(), 2);\n\t\t\ttwoItems.enterNode(0);\n\t\t\texpectEqualPaths(twoItems.getPath(), {\n\t\t\t\tparent: undefined,\n\t\t\t\tparentField: brand(\"key\"),\n\t\t\t\tparentIndex: 0,\n\t\t\t});\n\t\t});\n\t});\n});\n"]}

package/lib/test/feature-libraries/treeTextCursor.spec.d.ts

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

package/lib/test/feature-libraries/treeTextCursor.spec.d.ts.map

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

package/lib/test/feature-libraries/treeTextCursor.spec.js

@@ -1,8 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { jsonableTreeFromCursor, cursorForJsonableTreeNode, } from "../../feature-libraries/index.js";
-import { testGeneralPurposeTreeCursor } from "../cursorTestSuite.js";
-testGeneralPurposeTreeCursor("textTreeFormat", cursorForJsonableTreeNode, jsonableTreeFromCursor);
-//# sourceMappingURL=treeTextCursor.spec.js.map

package/lib/test/feature-libraries/treeTextCursor.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"treeTextCursor.spec.js","sourceRoot":"","sources":["../../../src/test/feature-libraries/treeTextCursor.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,sBAAsB,EACtB,yBAAyB,GACzB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,4BAA4B,EAAE,MAAM,uBAAuB,CAAC;AAErE,4BAA4B,CAAC,gBAAgB,EAAE,yBAAyB,EAAE,sBAAsB,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tjsonableTreeFromCursor,\n\tcursorForJsonableTreeNode,\n} from \"../../feature-libraries/index.js\";\nimport { testGeneralPurposeTreeCursor } from \"../cursorTestSuite.js\";\n\ntestGeneralPurposeTreeCursor(\"textTreeFormat\", cursorForJsonableTreeNode, jsonableTreeFromCursor);\n"]}

package/lib/test/feature-libraries/typedSchema/example.spec.d.ts

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

package/lib/test/feature-libraries/typedSchema/example.spec.d.ts.map

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

package/lib/test/feature-libraries/typedSchema/example.spec.js

@@ -1,20 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { leaf, SchemaBuilder } from "../../../domains/index.js";
-import { FieldKinds, FlexFieldSchema } from "../../../feature-libraries/index.js";
-const builder = new SchemaBuilder({ scope: "example" });
-// Declare object
-const ballSchema = builder.object("Ball", {
-    x: leaf.number,
-    y: leaf.number,
-});
-// Declare an recursive aggregate type via object fields.
-const diagramSchema = builder.objectRecursive("Diagram", {
-    children: FlexFieldSchema.createUnsafe(FieldKinds.sequence, [() => diagramSchema, ballSchema]),
-});
-const rootField = builder.optional(diagramSchema);
-// Collect the schema together.
-const schemaData = builder.intoSchema(rootField);
-//# sourceMappingURL=example.spec.js.map

package/lib/test/feature-libraries/typedSchema/example.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"example.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/typedSchema/example.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,qCAAqC,CAAC;AAElF,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;AAExD,iBAAiB;AACjB,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE;IACzC,CAAC,EAAE,IAAI,CAAC,MAAM;IACd,CAAC,EAAE,IAAI,CAAC,MAAM;CACd,CAAC,CAAC;AAEH,yDAAyD;AACzD,MAAM,aAAa,GAAG,OAAO,CAAC,eAAe,CAAC,SAAS,EAAE;IACxD,QAAQ,EAAE,eAAe,CAAC,YAAY,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;CAC9F,CAAC,CAAC;AAEH,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;AAElD,+BAA+B;AAC/B,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { leaf, SchemaBuilder } from \"../../../domains/index.js\";\nimport { FieldKinds, FlexFieldSchema } from \"../../../feature-libraries/index.js\";\n\nconst builder = new SchemaBuilder({ scope: \"example\" });\n\n// Declare object\nconst ballSchema = builder.object(\"Ball\", {\n\tx: leaf.number,\n\ty: leaf.number,\n});\n\n// Declare an recursive aggregate type via object fields.\nconst diagramSchema = builder.objectRecursive(\"Diagram\", {\n\tchildren: FlexFieldSchema.createUnsafe(FieldKinds.sequence, [() => diagramSchema, ballSchema]),\n});\n\nconst rootField = builder.optional(diagramSchema);\n\n// Collect the schema together.\nconst schemaData = builder.intoSchema(rootField);\n"]}

package/lib/test/feature-libraries/typedSchema/flexList.spec.d.ts

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

package/lib/test/feature-libraries/typedSchema/flexList.spec.d.ts.map

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

package/lib/test/feature-libraries/typedSchema/flexList.spec.js

@@ -1,52 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { normalizeFlexListLazy, normalizeFlexListEager, markEager, isLazy,
-// Allow importing from this specific file which is being tested:
-/* eslint-disable-next-line import/no-internal-modules */
- } from "../../../feature-libraries/typed-schema/flexList.js";
-// Test ArrayHasFixedLength
-{
-}
-// Test FlexListToNonLazyArray
-{
-}
-// Test FlexListToLazyArray
-{
-}
-// Test FlexListToNonLazyArray
-{
-}
-// Test FlexListToUnion
-{
-}
-describe("FlexList", () => {
-    it("correctly normalizes lists to be lazy", () => {
-        const list = [2, () => 1];
-        const normalized = normalizeFlexListLazy(list);
-        assert(normalized.length === 2);
-        const data = normalized.map((f) => f());
-        assert.deepEqual(data, [2, 1]);
-    });
-    it("correctly normalizes lists to be eager", () => {
-        const list = [2, () => 1];
-        const normalized = normalizeFlexListEager(list);
-        assert.deepEqual(normalized, [2, 1]);
-    });
-    it("can mark functions as eager", () => {
-        const fn = () => 42;
-        assert.equal(isLazy(fn), true);
-        markEager(fn);
-        assert.equal(isLazy(fn), false);
-    });
-    it("correctly normalizes functions marked as eager", () => {
-        const eagerGenerator = markEager(() => 42);
-        const lazyGenerator = () => () => 42;
-        const list = [eagerGenerator, lazyGenerator];
-        normalizeFlexListEager(list).forEach((g) => assert.equal(g(), 42));
-        normalizeFlexListLazy(list).forEach((g) => assert.equal(g()(), 42));
-    });
-});
-//# sourceMappingURL=flexList.spec.js.map

package/lib/test/feature-libraries/typedSchema/flexList.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"flexList.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/typedSchema/flexList.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EAGN,qBAAqB,EAGrB,sBAAsB,EACtB,SAAS,EAET,MAAM;AAEN,iEAAiE;AACjE,yDAAyD;EACzD,MAAM,qDAAqD,CAAC;AAQ7D,2BAA2B;AAC3B;CAaC;AAED,8BAA8B;AAC9B;CAqBC;AAED,2BAA2B;AAC3B;CAeC;AAED,8BAA8B;AAC9B;CASC;AAED,uBAAuB;AACvB;CASC;AAED,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;IACzB,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,IAAI,GAAG,CAAC,CAAC,EAAE,GAAM,EAAE,CAAC,CAAC,CAAU,CAAC;QACtC,MAAM,UAAU,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAC;QAC/C,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QACjD,MAAM,IAAI,GAAG,CAAC,CAAC,EAAE,GAAM,EAAE,CAAC,CAAC,CAAU,CAAC;QACtC,MAAM,UAAU,GAAoB,sBAAsB,CAAC,IAAI,CAAC,CAAC;QACjE,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC;QACpB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC/B,SAAS,CAAC,EAAE,CAAC,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACzD,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3C,MAAM,aAAa,GAAG,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;QACrC,MAAM,IAAI,GAA2B,CAAC,cAAc,EAAE,aAAa,CAAC,CAAC;QACrE,sBAAsB,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACnE,qBAAqB,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACrE,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\";\n\nimport {\n\tFlexListToNonLazyArray,\n\tFlexListToLazyArray,\n\tnormalizeFlexListLazy,\n\tLazyItem,\n\tArrayHasFixedLength,\n\tnormalizeFlexListEager,\n\tmarkEager,\n\tFlexList,\n\tisLazy,\n\tFlexListToUnion,\n\t// Allow importing from this specific file which is being tested:\n\t/* eslint-disable-next-line import/no-internal-modules */\n} from \"../../../feature-libraries/typed-schema/flexList.js\";\nimport {\n\tareSafelyAssignable,\n\trequireAssignableTo,\n\trequireFalse,\n\trequireTrue,\n} from \"../../../util/index.js\";\n\n// Test ArrayHasFixedLength\n{\n\ttype _check1 = requireTrue<ArrayHasFixedLength<[]>>;\n\ttype _check2 = requireTrue<ArrayHasFixedLength<readonly []>>;\n\ttype _check3 = requireTrue<ArrayHasFixedLength<[0]>>;\n\ttype _check4 = requireTrue<ArrayHasFixedLength<[1, 2, 3]>>;\n\n\ttype _check5 = requireFalse<ArrayHasFixedLength<number[]>>;\n\ttype _check6 = requireFalse<ArrayHasFixedLength<readonly number[]>>;\n\ttype _check7 = requireFalse<ArrayHasFixedLength<string[]>>;\n\n\t// Cases like this are not super clear how they should be handled, but currently are as indicated below:\n\ttype _check8 = requireTrue<ArrayHasFixedLength<[0] | []>>;\n\ttype _check9 = requireFalse<ArrayHasFixedLength<[0] | string[]>>;\n}\n\n// Test FlexListToNonLazyArray\n{\n\ttype a = FlexListToNonLazyArray<[]>;\n\ttype checkA = requireAssignableTo<a, []>;\n\n\ttype b = FlexListToNonLazyArray<[1]>;\n\ttype checkB = requireAssignableTo<b, [1]>;\n\n\ttype c = FlexListToNonLazyArray<[() => 1]>;\n\ttype checkC = requireAssignableTo<c, [1]>;\n\n\ttype d = FlexListToNonLazyArray<[2, () => 1]>;\n\ttype checkD = requireAssignableTo<d, [2, 1]>;\n\n\ttype e = FlexListToNonLazyArray<readonly [2]>;\n\ttype checkE = requireAssignableTo<e, [2]>;\n\n\ttype f = FlexListToNonLazyArray<readonly [2, () => 1]>;\n\ttype checkF = requireAssignableTo<f, [2, 1]>;\n\n\ttype g = FlexListToNonLazyArray<LazyItem<number>[]>;\n\ttype checkG = requireAssignableTo<readonly number[], g>;\n}\n\n// Test FlexListToLazyArray\n{\n\ttype a = FlexListToLazyArray<[]>;\n\ttype checkA = requireAssignableTo<a, []>;\n\n\ttype b = FlexListToLazyArray<[1]>;\n\ttype checkB = requireAssignableTo<b, [() => 1]>;\n\n\ttype c = FlexListToLazyArray<[() => 1]>;\n\ttype checkC = requireAssignableTo<c, [() => 1]>;\n\n\ttype d = FlexListToLazyArray<[2, () => 1]>;\n\ttype checkD = requireAssignableTo<d, [() => 2, () => 1]>;\n\n\ttype e = FlexListToLazyArray<readonly [2]>;\n\ttype checkE = requireAssignableTo<e, [() => 2]>;\n}\n\n// Test FlexListToNonLazyArray\n{\n\ttype a = FlexListToNonLazyArray<number[]>;\n\ttype checkA = requireTrue<areSafelyAssignable<a, readonly number[]>>;\n\n\ttype b = FlexListToNonLazyArray<[]>;\n\ttype checkB = requireTrue<areSafelyAssignable<b, []>>;\n\n\ttype c = FlexListToNonLazyArray<[() => 5, 6, () => 7]>;\n\ttype checkC = requireTrue<areSafelyAssignable<c, [5, 6, 7]>>;\n}\n\n// Test FlexListToUnion\n{\n\ttype a = FlexListToUnion<number[]>;\n\ttype checkA = requireTrue<areSafelyAssignable<a, number>>;\n\n\ttype b = FlexListToUnion<[]>;\n\ttype checkB = requireTrue<areSafelyAssignable<b, never>>;\n\n\ttype c = FlexListToUnion<[() => 5, 6, () => 7]>;\n\ttype checkC = requireTrue<areSafelyAssignable<c, 5 | 6 | 7>>;\n}\n\ndescribe(\"FlexList\", () => {\n\tit(\"correctly normalizes lists to be lazy\", () => {\n\t\tconst list = [2, (): 1 => 1] as const;\n\t\tconst normalized = normalizeFlexListLazy(list);\n\t\tassert(normalized.length === 2);\n\t\tconst data = normalized.map((f) => f());\n\t\tassert.deepEqual(data, [2, 1]);\n\t});\n\n\tit(\"correctly normalizes lists to be eager\", () => {\n\t\tconst list = [2, (): 1 => 1] as const;\n\t\tconst normalized: readonly [2, 1] = normalizeFlexListEager(list);\n\t\tassert.deepEqual(normalized, [2, 1]);\n\t});\n\n\tit(\"can mark functions as eager\", () => {\n\t\tconst fn = () => 42;\n\t\tassert.equal(isLazy(fn), true);\n\t\tmarkEager(fn);\n\t\tassert.equal(isLazy(fn), false);\n\t});\n\n\tit(\"correctly normalizes functions marked as eager\", () => {\n\t\tconst eagerGenerator = markEager(() => 42);\n\t\tconst lazyGenerator = () => () => 42;\n\t\tconst list: FlexList<() => number> = [eagerGenerator, lazyGenerator];\n\t\tnormalizeFlexListEager(list).forEach((g) => assert.equal(g(), 42));\n\t\tnormalizeFlexListLazy(list).forEach((g) => assert.equal(g()(), 42));\n\t});\n});\n"]}

package/lib/test/feature-libraries/typedSchema/typeUtils.spec.d.ts

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

package/lib/test/feature-libraries/typedSchema/typeUtils.spec.d.ts.map

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

package/lib/test/feature-libraries/typedSchema/typeUtils.spec.js

@@ -1,10 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-// These tests currently just cover the type checking, so its all compile time.
-// Test ArrayToUnion
-{
-}
-export {};
-//# sourceMappingURL=typeUtils.spec.js.map

package/lib/test/feature-libraries/typedSchema/typeUtils.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"typeUtils.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/typedSchema/typeUtils.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AASH,+EAA+E;AAE/E,oBAAoB;AACpB;CAQC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tArrayToUnion,\n\t// Allow importing from this specific file which is being tested:\n\t/* eslint-disable-next-line import/no-internal-modules */\n} from \"../../../feature-libraries/typed-schema/typeUtils.js\";\nimport { areSafelyAssignable, isAssignableTo, requireTrue } from \"../../../util/index.js\";\n\n// These tests currently just cover the type checking, so its all compile time.\n\n// Test ArrayToUnion\n{\n\ttype Empty = ArrayToUnion<[]>;\n\ttype checkEmpty_ = requireTrue<isAssignableTo<Empty, never>>;\n\ttype check1_ = requireTrue<areSafelyAssignable<ArrayToUnion<[1]>, 1>>;\n\ttype Case2 = ArrayToUnion<[1, 2]>;\n\ttype check2_ = requireTrue<areSafelyAssignable<Case2, 1 | 2>>;\n\ttype Case3 = ArrayToUnion<number[]>;\n\ttype check3_ = requireTrue<areSafelyAssignable<Case3, number>>;\n}\n"]}

package/lib/test/feature-libraries/typedSchema/typedTreeSchema.spec.d.ts

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

package/lib/test/feature-libraries/typedSchema/typedTreeSchema.spec.d.ts.map

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