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

package/lib/test/domains/schemaBuilder.spec.d.ts

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

package/lib/test/domains/schemaBuilder.spec.d.ts.map

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

package/lib/test/domains/schemaBuilder.spec.js

@@ -1,148 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { SchemaBuilder, leaf } from "../../domains/index.js";
-import { Any, FieldKinds, FlexFieldSchema, schemaIsFieldNode, schemaIsMap, } from "../../feature-libraries/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { structuralName } from "../../domains/schemaBuilder.js";
-describe("domains - SchemaBuilder", () => {
-    describe("list", () => {
-        describe("structural", () => {
-            it("Any", () => {
-                const builder = new SchemaBuilder({ scope: "scope" });
-                const listAny = builder.list(Any);
-                assert(schemaIsFieldNode(listAny));
-                assert.equal(listAny.name, "scope.List<Any>");
-                assert(listAny.info.equals(FlexFieldSchema.create(FieldKinds.sequence, [Any])));
-                assert.equal(builder.list(Any), listAny);
-            });
-            it("implicit", () => {
-                const builder = new SchemaBuilder({ scope: "scope2" });
-                const listImplicit = builder.list(builder.number);
-                assert(schemaIsFieldNode(listImplicit));
-                assert.equal(listImplicit.name, `scope2.List<["${builder.number.name}"]>`);
-                assert(listImplicit.info.equals(FlexFieldSchema.create(FieldKinds.sequence, [builder.number])));
-                assert.equal(builder.list(builder.number), listImplicit);
-            });
-            it("implicit normalizes", () => {
-                const builder = new SchemaBuilder({ scope: "scope" });
-                const listImplicit = builder.list(builder.number);
-                const listExplicit = builder.list([builder.number]);
-                assert.equal(listImplicit, listExplicit);
-            });
-            it("union", () => {
-                const builder = new SchemaBuilder({ scope: "scope" });
-                const listUnion = builder.list([builder.number, builder.boolean]);
-                assert(schemaIsFieldNode(listUnion));
-                assert.equal(listUnion.name, 
-                // Sorted alphabetically
-                `scope.List<["${builder.boolean.name}","${builder.number.name}"]>`);
-                assert(listUnion.info.equals(FlexFieldSchema.create(FieldKinds.sequence, [
-                    builder.number,
-                    builder.boolean,
-                ])));
-                assert.equal(builder.list([builder.number, builder.boolean]), listUnion);
-                assert.equal(builder.list([builder.boolean, builder.number]), listUnion);
-            });
-        });
-        describe("named list", () => {
-            it("implicit normalizes", () => {
-                const builder = new SchemaBuilder({ scope: "scope" });
-                const list = builder.list("Foo", builder.number);
-                assert(schemaIsFieldNode(list));
-                assert.equal(list.name, `scope.Foo`);
-                assert(list.info.equals(FlexFieldSchema.create(FieldKinds.sequence, [builder.number])));
-                // Not cached for structural use
-                assert(builder.list(builder.number) !== list);
-                // Creating again errors instead or reuses
-                assert.throws(() => builder.list("Foo", builder.number));
-            });
-        });
-    });
-    describe("map", () => {
-        describe("structural", () => {
-            it("implicit", () => {
-                const builder = new SchemaBuilder({ scope: "scope" });
-                const mapAny = builder.map(Any);
-                assert(schemaIsMap(mapAny));
-                // Correct name
-                assert.equal(mapAny.name, "scope.Map<Any>");
-                // Infers optional kind
-                assert(mapAny.mapFields.equals(FlexFieldSchema.create(FieldKinds.optional, [Any])));
-                // Cached and reused
-                assert.equal(builder.map(Any), mapAny);
-            });
-            describe("named map", () => {
-                it("implicit normalizes", () => {
-                    const builder = new SchemaBuilder({ scope: "scope" });
-                    const map = builder.map("Foo", builder.number);
-                    assert(schemaIsMap(map));
-                    assert.equal(map.name, `scope.Foo`);
-                    assert(map.mapFields.equals(FlexFieldSchema.create(FieldKinds.optional, [builder.number])));
-                });
-                it("explicit", () => {
-                    const builder = new SchemaBuilder({ scope: "scope" });
-                    const map = builder.map("Foo", FlexFieldSchema.create(FieldKinds.sequence, [leaf.string]));
-                    assert(schemaIsMap(map));
-                    assert.equal(map.name, `scope.Foo`);
-                    assert(map.mapFields.equals(FlexFieldSchema.create(FieldKinds.sequence, [leaf.string])));
-                });
-            });
-        });
-    });
-    it("structuralName", () => {
-        assert.equal(structuralName("X", Any), "X<Any>");
-        assert.equal(structuralName("Y", []), "Y<[]>");
-        // implicitly normalizes
-        assert.equal(structuralName("List", leaf.number), structuralName("List", [leaf.number]));
-        // Single item
-        assert.equal(structuralName("List", leaf.number), `List<["${leaf.number.name}"]>`);
-        // Sorted alphabetically
-        assert.equal(structuralName("X", [leaf.number, leaf.boolean]), `X<["${leaf.boolean.name}","${leaf.number.name}"]>`);
-        // escaped names
-        const builder = new SchemaBuilder({ scope: "scope" });
-        const doubleName = builder.object(`bar","scope.foo`, {});
-        assert.equal(structuralName("X", doubleName), `X<["scope.bar\\",\\"scope.foo"]>`);
-        // This escaping ensures named don't collide:
-        const foo = builder.object("foo", {});
-        const bar = builder.object("bar", {});
-        assert(structuralName("X", [bar, foo]) !== structuralName("X", doubleName));
-    });
-    it("object", () => {
-        const builder = new SchemaBuilder({ scope: "Test Domain" });
-        const testObject = builder.object("object", {
-            number: builder.number,
-        });
-        function typeTests(x) {
-            const y = x.number;
-        }
-    });
-    it("objectRecursive", () => {
-        const builder = new SchemaBuilder({ scope: "Test Recursive Domain" });
-        const recursiveObject = builder.objectRecursive("object", {
-            recursive: FlexFieldSchema.createUnsafe(FieldKinds.optional, [() => recursiveObject]),
-            number: SchemaBuilder.required(builder.number),
-        });
-        function typeTests2(x) {
-            const y = x.number;
-            const z = x.recursive?.recursive?.number;
-        }
-    });
-    it("fixRecursiveReference", () => {
-        const builder = new SchemaBuilder({ scope: "Test Recursive Domain" });
-        const recursiveReference = () => recursiveObject2;
-        builder.fixRecursiveReference(recursiveReference);
-        // Renaming this to recursiveObject causes IntelliSense to never work for this, instead of work after restarted until this code it touched.
-        const recursiveObject2 = builder.object("object2", {
-            recursive: builder.optional([recursiveReference]),
-            number: leaf.number,
-        });
-        function typeTests2(x) {
-            const y = x.number;
-            const z = x.recursive?.recursive?.number;
-        }
-    });
-});
-//# sourceMappingURL=schemaBuilder.spec.js.map

package/lib/test/domains/schemaBuilder.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"schemaBuilder.spec.js","sourceRoot":"","sources":["../../../src/test/domains/schemaBuilder.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EACN,GAAG,EACH,UAAU,EACV,eAAe,EAGf,iBAAiB,EACjB,WAAW,GAEX,MAAM,kCAAkC,CAAC;AAE1C,sDAAsD;AACtD,OAAO,EAAE,cAAc,EAAE,MAAM,gCAAgC,CAAC;AAEhE,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;IACxC,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE;QACrB,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;YAC3B,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;gBACd,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;gBAEtD,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClC,MAAM,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC;gBACnC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;gBAC9C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAMhF,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;YAC1C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;gBACnB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;gBAEvD,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAClD,MAAM,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,iBAAiB,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC;gBAC3E,MAAM,CACL,YAAY,CAAC,IAAI,CAAC,MAAM,CACvB,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAC7D,CACD,CAAC;gBASF,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC,CAAC;YAC1D,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;gBAC9B,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;gBAEtD,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAClD,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;gBAEpD,MAAM,CAAC,KAAK,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;YAC1C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE;gBAChB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;gBAEtD,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;gBAClE,MAAM,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC;gBAErC,MAAM,CAAC,KAAK,CACX,SAAS,CAAC,IAAI;gBACd,wBAAwB;gBACxB,gBAAgB,OAAO,CAAC,OAAO,CAAC,IAAI,MAAM,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAClE,CAAC;gBACF,MAAM,CACL,SAAS,CAAC,IAAI,CAAC,MAAM,CACpB,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE;oBAC3C,OAAO,CAAC,MAAM;oBACd,OAAO,CAAC,OAAO;iBACf,CAAC,CACF,CACD,CAAC;gBAqBF,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBACzE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAC1E,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;YAC3B,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;gBAC9B,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;gBAEtD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;gBACjD,MAAM,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;gBACrC,MAAM,CACL,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAC/E,CAAC;gBASF,gCAAgC;gBAChC,MAAM,CAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAwB,KAAK,IAAI,CAAC,CAAC;gBACtE,0CAA0C;gBAC1C,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;YAC1D,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;QACpB,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;YAC3B,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;gBACnB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;gBACtD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC5B,eAAe;gBACf,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;gBAC5C,uBAAuB;gBACvB,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpF,oBAAoB;gBACpB,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;gBAC1B,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;oBAC9B,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;oBAEtD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;oBAC/C,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;oBACzB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;oBACpC,MAAM,CACL,GAAG,CAAC,SAAS,CAAC,MAAM,CACnB,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAC7D,CACD,CAAC;gBACH,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;oBACnB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;oBAEtD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CACtB,KAAK,EACL,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAC1D,CAAC;oBACF,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;oBACzB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;oBACpC,MAAM,CACL,GAAG,CAAC,SAAS,CAAC,MAAM,CACnB,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAC1D,CACD,CAAC;gBACH,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;QACzB,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;QACjD,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;QAC/C,wBAAwB;QACxB,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,cAAc,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzF,cAAc;QACd,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,UAAU,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC;QACnF,wBAAwB;QACxB,MAAM,CAAC,KAAK,CACX,cAAc,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,EAChD,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CACnD,CAAC;QACF,gBAAgB;QAChB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACtD,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;QACzD,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,kCAAkC,CAAC,CAAC;QAClF,6CAA6C;QAC7C,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,cAAc,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;QACjB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC;QAE5D,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE;YAC3C,MAAM,EAAE,OAAO,CAAC,MAAM;SACtB,CAAC,CAAC;QAIH,SAAS,SAAS,CAAC,CAAuC;YACzD,MAAM,CAAC,GAAW,CAAC,CAAC,MAAM,CAAC;QAC5B,CAAC;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC1B,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,uBAAuB,EAAE,CAAC,CAAC;QAEtE,MAAM,eAAe,GAAG,OAAO,CAAC,eAAe,CAAC,QAAQ,EAAE;YACzD,SAAS,EAAE,eAAe,CAAC,YAAY,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;YACrF,MAAM,EAAE,aAAa,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC;SAC9C,CAAC,CAAC;QAIH,SAAS,UAAU,CAAC,CAA4C;YAC/D,MAAM,CAAC,GAAW,CAAC,CAAC,MAAM,CAAC;YAC3B,MAAM,CAAC,GAAuB,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC;QAC9D,CAAC;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;QAChC,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,uBAAuB,EAAE,CAAC,CAAC;QAEtE,MAAM,kBAAkB,GAAG,GAAG,EAAE,CAAC,gBAAgB,CAAC;QAClD,OAAO,CAAC,qBAAqB,CAAC,kBAAkB,CAAC,CAAC;QAElD,2IAA2I;QAC3I,MAAM,gBAAgB,GAAG,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE;YAClD,SAAS,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,kBAAkB,CAAC,CAAC;YACjD,MAAM,EAAE,IAAI,CAAC,MAAM;SACnB,CAAC,CAAC;QAYH,SAAS,UAAU,CAAC,CAA6C;YAChE,MAAM,CAAC,GAAW,CAAC,CAAC,MAAM,CAAC;YAC3B,MAAM,CAAC,GAAuB,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC;QAC9D,CAAC;IACF,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { SchemaBuilder, leaf } from \"../../domains/index.js\";\nimport {\n\tAny,\n\tFieldKinds,\n\tFlexFieldSchema,\n\tFlexTreeSequenceField,\n\tFlexTreeNodeSchema,\n\tschemaIsFieldNode,\n\tschemaIsMap,\n\tFlexTreeTypedNode,\n} from \"../../feature-libraries/index.js\";\nimport { areSafelyAssignable, isAny, requireFalse, requireTrue } from \"../../util/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { structuralName } from \"../../domains/schemaBuilder.js\";\n\ndescribe(\"domains - SchemaBuilder\", () => {\n\tdescribe(\"list\", () => {\n\t\tdescribe(\"structural\", () => {\n\t\t\tit(\"Any\", () => {\n\t\t\t\tconst builder = new SchemaBuilder({ scope: \"scope\" });\n\n\t\t\t\tconst listAny = builder.list(Any);\n\t\t\t\tassert(schemaIsFieldNode(listAny));\n\t\t\t\tassert.equal(listAny.name, \"scope.List<Any>\");\n\t\t\t\tassert(listAny.info.equals(FlexFieldSchema.create(FieldKinds.sequence, [Any])));\n\t\t\t\ttype ListAny = FlexTreeTypedNode<typeof listAny>[\"content\"];\n\t\t\t\ttype _check = requireTrue<\n\t\t\t\t\tareSafelyAssignable<ListAny, FlexTreeSequenceField<readonly [Any]>>\n\t\t\t\t>;\n\n\t\t\t\tassert.equal(builder.list(Any), listAny);\n\t\t\t});\n\n\t\t\tit(\"implicit\", () => {\n\t\t\t\tconst builder = new SchemaBuilder({ scope: \"scope2\" });\n\n\t\t\t\tconst listImplicit = builder.list(builder.number);\n\t\t\t\tassert(schemaIsFieldNode(listImplicit));\n\t\t\t\tassert.equal(listImplicit.name, `scope2.List<[\"${builder.number.name}\"]>`);\n\t\t\t\tassert(\n\t\t\t\t\tlistImplicit.info.equals(\n\t\t\t\t\t\tFlexFieldSchema.create(FieldKinds.sequence, [builder.number]),\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\ttype ListImplicit = FlexTreeTypedNode<typeof listImplicit>[\"content\"];\n\t\t\t\ttype _check = requireTrue<\n\t\t\t\t\tareSafelyAssignable<\n\t\t\t\t\t\tListImplicit,\n\t\t\t\t\t\tFlexTreeSequenceField<readonly [typeof builder.number]>\n\t\t\t\t\t>\n\t\t\t\t>;\n\n\t\t\t\tassert.equal(builder.list(builder.number), listImplicit);\n\t\t\t});\n\n\t\t\tit(\"implicit normalizes\", () => {\n\t\t\t\tconst builder = new SchemaBuilder({ scope: \"scope\" });\n\n\t\t\t\tconst listImplicit = builder.list(builder.number);\n\t\t\t\tconst listExplicit = builder.list([builder.number]);\n\n\t\t\t\tassert.equal(listImplicit, listExplicit);\n\t\t\t});\n\n\t\t\tit(\"union\", () => {\n\t\t\t\tconst builder = new SchemaBuilder({ scope: \"scope\" });\n\n\t\t\t\tconst listUnion = builder.list([builder.number, builder.boolean]);\n\t\t\t\tassert(schemaIsFieldNode(listUnion));\n\n\t\t\t\tassert.equal(\n\t\t\t\t\tlistUnion.name,\n\t\t\t\t\t// Sorted alphabetically\n\t\t\t\t\t`scope.List<[\"${builder.boolean.name}\",\"${builder.number.name}\"]>`,\n\t\t\t\t);\n\t\t\t\tassert(\n\t\t\t\t\tlistUnion.info.equals(\n\t\t\t\t\t\tFlexFieldSchema.create(FieldKinds.sequence, [\n\t\t\t\t\t\t\tbuilder.number,\n\t\t\t\t\t\t\tbuilder.boolean,\n\t\t\t\t\t\t]),\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\ttype ListUnion = FlexTreeTypedNode<typeof listUnion>[\"content\"];\n\t\t\t\ttype _check = requireTrue<\n\t\t\t\t\tareSafelyAssignable<\n\t\t\t\t\t\tListUnion,\n\t\t\t\t\t\tFlexTreeSequenceField<\n\t\t\t\t\t\t\treadonly [typeof builder.number, typeof builder.boolean]\n\t\t\t\t\t\t>\n\t\t\t\t\t>\n\t\t\t\t>;\n\t\t\t\t// TODO: this should compile: ideally EditableTree's use of AllowedTypes would be compile time order independent like it is runtime order independent, but its currently not.\n\t\t\t\ttype _check2 = requireTrue<\n\t\t\t\t\t// @ts-expect-error Currently not order independent: ideally this would compile\n\t\t\t\t\tareSafelyAssignable<\n\t\t\t\t\t\tListUnion,\n\t\t\t\t\t\tFlexTreeSequenceField<\n\t\t\t\t\t\t\treadonly [typeof builder.boolean, typeof builder.number]\n\t\t\t\t\t\t>\n\t\t\t\t\t>\n\t\t\t\t>;\n\n\t\t\t\tassert.equal(builder.list([builder.number, builder.boolean]), listUnion);\n\t\t\t\tassert.equal(builder.list([builder.boolean, builder.number]), listUnion);\n\t\t\t});\n\t\t});\n\n\t\tdescribe(\"named list\", () => {\n\t\t\tit(\"implicit normalizes\", () => {\n\t\t\t\tconst builder = new SchemaBuilder({ scope: \"scope\" });\n\n\t\t\t\tconst list = builder.list(\"Foo\", builder.number);\n\t\t\t\tassert(schemaIsFieldNode(list));\n\t\t\t\tassert.equal(list.name, `scope.Foo`);\n\t\t\t\tassert(\n\t\t\t\t\tlist.info.equals(FlexFieldSchema.create(FieldKinds.sequence, [builder.number])),\n\t\t\t\t);\n\t\t\t\ttype List = FlexTreeTypedNode<typeof list>[\"content\"];\n\t\t\t\ttype _check = requireTrue<\n\t\t\t\t\tareSafelyAssignable<\n\t\t\t\t\t\tList,\n\t\t\t\t\t\tFlexTreeSequenceField<readonly [typeof builder.number]>\n\t\t\t\t\t>\n\t\t\t\t>;\n\n\t\t\t\t// Not cached for structural use\n\t\t\t\tassert((builder.list(builder.number) as FlexTreeNodeSchema) !== list);\n\t\t\t\t// Creating again errors instead or reuses\n\t\t\t\tassert.throws(() => builder.list(\"Foo\", builder.number));\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe(\"map\", () => {\n\t\tdescribe(\"structural\", () => {\n\t\t\tit(\"implicit\", () => {\n\t\t\t\tconst builder = new SchemaBuilder({ scope: \"scope\" });\n\t\t\t\tconst mapAny = builder.map(Any);\n\t\t\t\tassert(schemaIsMap(mapAny));\n\t\t\t\t// Correct name\n\t\t\t\tassert.equal(mapAny.name, \"scope.Map<Any>\");\n\t\t\t\t// Infers optional kind\n\t\t\t\tassert(mapAny.mapFields.equals(FlexFieldSchema.create(FieldKinds.optional, [Any])));\n\t\t\t\t// Cached and reused\n\t\t\t\tassert.equal(builder.map(Any), mapAny);\n\t\t\t});\n\n\t\t\tdescribe(\"named map\", () => {\n\t\t\t\tit(\"implicit normalizes\", () => {\n\t\t\t\t\tconst builder = new SchemaBuilder({ scope: \"scope\" });\n\n\t\t\t\t\tconst map = builder.map(\"Foo\", builder.number);\n\t\t\t\t\tassert(schemaIsMap(map));\n\t\t\t\t\tassert.equal(map.name, `scope.Foo`);\n\t\t\t\t\tassert(\n\t\t\t\t\t\tmap.mapFields.equals(\n\t\t\t\t\t\t\tFlexFieldSchema.create(FieldKinds.optional, [builder.number]),\n\t\t\t\t\t\t),\n\t\t\t\t\t);\n\t\t\t\t});\n\n\t\t\t\tit(\"explicit\", () => {\n\t\t\t\t\tconst builder = new SchemaBuilder({ scope: \"scope\" });\n\n\t\t\t\t\tconst map = builder.map(\n\t\t\t\t\t\t\"Foo\",\n\t\t\t\t\t\tFlexFieldSchema.create(FieldKinds.sequence, [leaf.string]),\n\t\t\t\t\t);\n\t\t\t\t\tassert(schemaIsMap(map));\n\t\t\t\t\tassert.equal(map.name, `scope.Foo`);\n\t\t\t\t\tassert(\n\t\t\t\t\t\tmap.mapFields.equals(\n\t\t\t\t\t\t\tFlexFieldSchema.create(FieldKinds.sequence, [leaf.string]),\n\t\t\t\t\t\t),\n\t\t\t\t\t);\n\t\t\t\t});\n\t\t\t});\n\t\t});\n\t});\n\n\tit(\"structuralName\", () => {\n\t\tassert.equal(structuralName(\"X\", Any), \"X<Any>\");\n\t\tassert.equal(structuralName(\"Y\", []), \"Y<[]>\");\n\t\t// implicitly normalizes\n\t\tassert.equal(structuralName(\"List\", leaf.number), structuralName(\"List\", [leaf.number]));\n\t\t// Single item\n\t\tassert.equal(structuralName(\"List\", leaf.number), `List<[\"${leaf.number.name}\"]>`);\n\t\t// Sorted alphabetically\n\t\tassert.equal(\n\t\t\tstructuralName(\"X\", [leaf.number, leaf.boolean]),\n\t\t\t`X<[\"${leaf.boolean.name}\",\"${leaf.number.name}\"]>`,\n\t\t);\n\t\t// escaped names\n\t\tconst builder = new SchemaBuilder({ scope: \"scope\" });\n\t\tconst doubleName = builder.object(`bar\",\"scope.foo`, {});\n\t\tassert.equal(structuralName(\"X\", doubleName), `X<[\"scope.bar\\\\\",\\\\\"scope.foo\"]>`);\n\t\t// This escaping ensures named don't collide:\n\t\tconst foo = builder.object(\"foo\", {});\n\t\tconst bar = builder.object(\"bar\", {});\n\t\tassert(structuralName(\"X\", [bar, foo]) !== structuralName(\"X\", doubleName));\n\t});\n\n\tit(\"object\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"Test Domain\" });\n\n\t\tconst testObject = builder.object(\"object\", {\n\t\t\tnumber: builder.number,\n\t\t});\n\n\t\ttype _0 = requireFalse<isAny<typeof testObject>>;\n\n\t\tfunction typeTests(x: FlexTreeTypedNode<typeof testObject>) {\n\t\t\tconst y: number = x.number;\n\t\t}\n\t});\n\n\tit(\"objectRecursive\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"Test Recursive Domain\" });\n\n\t\tconst recursiveObject = builder.objectRecursive(\"object\", {\n\t\t\trecursive: FlexFieldSchema.createUnsafe(FieldKinds.optional, [() => recursiveObject]),\n\t\t\tnumber: SchemaBuilder.required(builder.number),\n\t\t});\n\n\t\ttype _0 = requireFalse<isAny<typeof recursiveObject>>;\n\n\t\tfunction typeTests2(x: FlexTreeTypedNode<typeof recursiveObject>) {\n\t\t\tconst y: number = x.number;\n\t\t\tconst z: number | undefined = x.recursive?.recursive?.number;\n\t\t}\n\t});\n\n\tit(\"fixRecursiveReference\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"Test Recursive Domain\" });\n\n\t\tconst recursiveReference = () => recursiveObject2;\n\t\tbuilder.fixRecursiveReference(recursiveReference);\n\n\t\t// Renaming this to recursiveObject causes IntelliSense to never work for this, instead of work after restarted until this code it touched.\n\t\tconst recursiveObject2 = builder.object(\"object2\", {\n\t\t\trecursive: builder.optional([recursiveReference]),\n\t\t\tnumber: leaf.number,\n\t\t});\n\n\t\ttype _0 = requireFalse<isAny<typeof recursiveObject2>>;\n\t\ttype _1 = requireTrue<\n\t\t\tareSafelyAssignable<\n\t\t\t\ttypeof recursiveObject2,\n\t\t\t\tReturnType<\n\t\t\t\t\t(typeof recursiveObject2.objectNodeFieldsObject.recursive.allowedTypes)[0]\n\t\t\t\t>\n\t\t\t>\n\t\t>;\n\n\t\tfunction typeTests2(x: FlexTreeTypedNode<typeof recursiveObject2>) {\n\t\t\tconst y: number = x.number;\n\t\t\tconst z: number | undefined = x.recursive?.recursive?.number;\n\t\t}\n\t});\n});\n"]}

package/lib/test/editMinter.d.ts

@@ -1,8 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { DefaultChangeFamily, DefaultChangeset, DefaultEditBuilder } from "../feature-libraries/index.js";
-export type Editor = (builder: DefaultEditBuilder) => void;
-export declare function makeEditMinter(family: DefaultChangeFamily, editor: Editor): () => DefaultChangeset;
-//# sourceMappingURL=editMinter.d.ts.map

package/lib/test/editMinter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"editMinter.d.ts","sourceRoot":"","sources":["../../src/test/editMinter.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACN,mBAAmB,EACnB,gBAAgB,EAChB,kBAAkB,EAClB,MAAM,+BAA+B,CAAC;AAEvC,MAAM,MAAM,MAAM,GAAG,CAAC,OAAO,EAAE,kBAAkB,KAAK,IAAI,CAAC;AAE3D,wBAAgB,cAAc,CAC7B,MAAM,EAAE,mBAAmB,EAC3B,MAAM,EAAE,MAAM,GACZ,MAAM,gBAAgB,CAcxB"}

package/lib/test/editMinter.js

@@ -1,21 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-export function makeEditMinter(family, editor) {
-    let builtChangeset;
-    const innerEditor = family.buildEditor((change) => {
-        assert(builtChangeset === undefined);
-        builtChangeset = change;
-    });
-    return () => {
-        assert(builtChangeset === undefined);
-        editor(innerEditor);
-        assert(builtChangeset !== undefined);
-        const changeset = builtChangeset;
-        builtChangeset = undefined;
-        return changeset;
-    };
-}
-//# sourceMappingURL=editMinter.js.map

package/lib/test/editMinter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"editMinter.js","sourceRoot":"","sources":["../../src/test/editMinter.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAS1C,MAAM,UAAU,cAAc,CAC7B,MAA2B,EAC3B,MAAc;IAEd,IAAI,cAA4C,CAAC;IACjD,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,EAAE,EAAE;QACjD,MAAM,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC;QACrC,cAAc,GAAG,MAAM,CAAC;IACzB,CAAC,CAAC,CAAC;IACH,OAAO,GAAqB,EAAE;QAC7B,MAAM,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC;QACrC,MAAM,CAAC,WAAW,CAAC,CAAC;QACpB,MAAM,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC;QACrC,MAAM,SAAS,GAAG,cAAc,CAAC;QACjC,cAAc,GAAG,SAAS,CAAC;QAC3B,OAAO,SAAS,CAAC;IAClB,CAAC,CAAC;AACH,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\tDefaultChangeFamily,\n\tDefaultChangeset,\n\tDefaultEditBuilder,\n} from \"../feature-libraries/index.js\";\n\nexport type Editor = (builder: DefaultEditBuilder) => void;\n\nexport function makeEditMinter(\n\tfamily: DefaultChangeFamily,\n\teditor: Editor,\n): () => DefaultChangeset {\n\tlet builtChangeset: DefaultChangeset | undefined;\n\tconst innerEditor = family.buildEditor((change) => {\n\t\tassert(builtChangeset === undefined);\n\t\tbuiltChangeset = change;\n\t});\n\treturn (): DefaultChangeset => {\n\t\tassert(builtChangeset === undefined);\n\t\teditor(innerEditor);\n\t\tassert(builtChangeset !== undefined);\n\t\tconst changeset = builtChangeset;\n\t\tbuiltChangeset = undefined;\n\t\treturn changeset;\n\t};\n}\n"]}

package/lib/test/events/eventEmitter.spec.d.ts

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

package/lib/test/events/eventEmitter.spec.d.ts.map

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

package/lib/test/events/eventEmitter.spec.js

@@ -1,159 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { validateAssertionError } from "@fluidframework/test-runtime-utils";
-import { createEmitter, EventEmitter } from "../../events/index.js";
-describe("EventEmitter", () => {
-    it("emits events", () => {
-        const emitter = createEmitter();
-        const log = [];
-        emitter.on("open", () => log.push("opened"));
-        emitter.emit("open");
-        assert.deepEqual(log, ["opened"]);
-    });
-    it("emits events and collects their results", () => {
-        const emitter = createEmitter();
-        const listener1 = (arg) => arg.toUpperCase();
-        const listener2 = (arg) => arg.toLowerCase();
-        emitter.on("compute", listener1);
-        emitter.on("compute", listener2);
-        const results = emitter.emitAndCollect("compute", "hello");
-        assert.deepEqual(results, ["HELLO", "hello"]);
-    });
-    it("emits events and collects an empty result array when no listeners registered", () => {
-        const emitter = createEmitter();
-        const results = emitter.emitAndCollect("compute", "hello");
-        assert.deepEqual(results, []);
-    });
-    it("passes arguments to events", () => {
-        const emitter = createEmitter();
-        let error = false;
-        emitter.on("close", (e) => {
-            error = e;
-        });
-        emitter.emit("close", true);
-        assert.strictEqual(error, true);
-    });
-    it("emits multiple events", () => {
-        const emitter = createEmitter();
-        let opened = false;
-        let closed = false;
-        emitter.on("open", () => {
-            opened = true;
-        });
-        emitter.on("close", () => {
-            closed = true;
-        });
-        emitter.emit("open");
-        assert(opened);
-        assert(!closed);
-        emitter.emit("close", false);
-        assert(opened);
-        assert(closed);
-    });
-    it("deregisters events", () => {
-        const emitter = createEmitter();
-        let error = false;
-        const deregister = emitter.on("close", (e) => {
-            error = e;
-        });
-        deregister();
-        emitter.emit("close", true);
-        assert.strictEqual(error, false);
-    });
-    it("deregisters multiple events", () => {
-        const emitter = createEmitter();
-        let opened = false;
-        let closed = false;
-        const deregisterOpen = emitter.on("open", () => {
-            opened = true;
-        });
-        const deregisterClosed = emitter.on("close", () => {
-            closed = true;
-        });
-        deregisterOpen();
-        deregisterClosed();
-        emitter.emit("open");
-        assert(!opened);
-        assert(!closed);
-        emitter.emit("close", false);
-        assert(!opened);
-        assert(!closed);
-    });
-    // TODO: this behavior is questionable due to how it relates to unregister events.
-    // If events registered twice stop firing when unregistered once, that seems odd.
-    // Also if two place (that don't know about each-other) add some callback for the same event,
-    // it seems off that the behavior, and how they have to handle un-registration depends on if the functions they provided
-    // happen to compare equal (ex: two calls to a logger or fail could hit this).
-    it("ignores duplicate events", () => {
-        const emitter = createEmitter();
-        let count = 0;
-        const listener = () => (count += 1);
-        emitter.on("open", listener);
-        emitter.on("open", listener);
-        emitter.emit("open");
-        // Count should be 1, not 2, even though `listener` was registered twice
-        assert.strictEqual(count, 1);
-    });
-    it("fails on duplicate deregistrations", () => {
-        const emitter = createEmitter();
-        const deregister = emitter.on("open", () => { });
-        const deregisterB = emitter.on("open", () => { });
-        deregister();
-        assert.throws(() => deregister(), (e) => validateAssertionError(e, "Listener does not exist. Event deregistration functions may only be invoked once."));
-        deregisterB();
-        assert.throws(() => deregister(), (e) => validateAssertionError(e, "Event has no listeners. Event deregistration functions may only be invoked once."));
-    });
-    it("skips events adding during event", () => {
-        const emitter = createEmitter();
-        const log = [];
-        const unsubscribe = emitter.on("open", () => {
-            log.push("A");
-            emitter.on("open", () => {
-                log.push("B");
-            });
-        });
-        emitter.emit("open");
-        unsubscribe();
-        assert.deepEqual(log, ["A"]);
-        emitter.emit("open");
-        assert.deepEqual(log, ["A", "B"]);
-    });
-    it("reentrant events", () => {
-        const emitter = createEmitter();
-        const log = [];
-        const unsubscribe = emitter.on("open", () => {
-            log.push("A1");
-            emitter.on("open", () => {
-                log.push("B");
-            });
-            unsubscribe();
-            emitter.emit("open");
-            log.push("A2");
-        });
-        emitter.emit("open");
-        assert.deepEqual(log, ["A1", "B", "A2"]);
-    });
-});
-// The below classes correspond to the examples given in the doc comment of `EventEmitter` to ensure that they compile
-class MyInheritanceClass extends EventEmitter {
-    load() {
-        this.emit("loaded");
-        const results = this.emitAndCollect("computed");
-    }
-}
-class MyCompositionClass {
-    constructor() {
-        this.events = createEmitter();
-    }
-    load() {
-        this.events.emit("loaded");
-        const results = this.events.emitAndCollect("computed");
-    }
-    on(eventName, listener) {
-        return this.events.on(eventName, listener);
-    }
-}
-//# sourceMappingURL=eventEmitter.spec.js.map

package/lib/test/events/eventEmitter.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"eventEmitter.spec.js","sourceRoot":"","sources":["../../../src/test/events/eventEmitter.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,YAAY,EAAiB,MAAM,uBAAuB,CAAC;AAQnF,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC7B,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;QACvB,MAAM,OAAO,GAAG,aAAa,EAAc,CAAC;QAC5C,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC7C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,OAAO,GAAG,aAAa,EAAc,CAAC;QAC5C,MAAM,SAAS,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC;QACrD,MAAM,SAAS,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC;QACrD,OAAO,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACjC,OAAO,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC3D,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8EAA8E,EAAE,GAAG,EAAE;QACvF,MAAM,OAAO,GAAG,aAAa,EAAc,CAAC;QAC5C,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC3D,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,OAAO,GAAG,aAAa,EAAc,CAAC;QAC5C,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAU,EAAE,EAAE;YAClC,KAAK,GAAG,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC5B,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;QAChC,MAAM,OAAO,GAAG,aAAa,EAAc,CAAC;QAC5C,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE;YACvB,MAAM,GAAG,IAAI,CAAC;QACf,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE;YACxB,MAAM,GAAG,IAAI,CAAC;QACf,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,CAAC,MAAM,CAAC,CAAC;QACf,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;QAChB,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7B,MAAM,CAAC,MAAM,CAAC,CAAC;QACf,MAAM,CAAC,MAAM,CAAC,CAAC;IAChB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC7B,MAAM,OAAO,GAAG,aAAa,EAAc,CAAC;QAC5C,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,MAAM,UAAU,GAAG,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAU,EAAE,EAAE;YACrD,KAAK,GAAG,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QACH,UAAU,EAAE,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC5B,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,MAAM,OAAO,GAAG,aAAa,EAAc,CAAC;QAC5C,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,MAAM,cAAc,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE;YAC9C,MAAM,GAAG,IAAI,CAAC;QACf,CAAC,CAAC,CAAC;QACH,MAAM,gBAAgB,GAAG,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE;YACjD,MAAM,GAAG,IAAI,CAAC;QACf,CAAC,CAAC,CAAC;QACH,cAAc,EAAE,CAAC;QACjB,gBAAgB,EAAE,CAAC;QACnB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;QAChB,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;QAChB,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7B,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;QAChB,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;IACjB,CAAC,CAAC,CAAC;IAEH,kFAAkF;IAClF,iFAAiF;IACjF,6FAA6F;IAC7F,wHAAwH;IACxH,8EAA8E;IAC9E,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACnC,MAAM,OAAO,GAAG,aAAa,EAAc,CAAC;QAC5C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,QAAQ,GAAG,GAAG,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;QACpC,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC7B,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,wEAAwE;QACxE,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,OAAO,GAAG,aAAa,EAAc,CAAC;QAC5C,MAAM,UAAU,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAChD,MAAM,WAAW,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QACjD,UAAU,EAAE,CAAC;QACb,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,UAAU,EAAE,EAClB,CAAC,CAAQ,EAAE,EAAE,CACZ,sBAAsB,CACrB,CAAC,EACD,mFAAmF,CACnF,CACF,CAAC;QACF,WAAW,EAAE,CAAC;QACd,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,UAAU,EAAE,EAClB,CAAC,CAAQ,EAAE,EAAE,CACZ,sBAAsB,CACrB,CAAC,EACD,kFAAkF,CAClF,CACF,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC3C,MAAM,OAAO,GAAG,aAAa,EAAc,CAAC;QAC5C,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,MAAM,WAAW,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE;YAC3C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACd,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE;gBACvB,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,WAAW,EAAE,CAAC;QACd,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC3B,MAAM,OAAO,GAAG,aAAa,EAAc,CAAC;QAC5C,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,MAAM,WAAW,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE;YAC3C,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACf,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE;gBACvB,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,CAAC,CAAC,CAAC;YACH,WAAW,EAAE,CAAC;YACd,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAOH,sHAAsH;AAEtH,MAAM,kBAAmB,SAAQ,YAAsB;IAC9C,IAAI;QACX,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpB,MAAM,OAAO,GAAa,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;IAC3D,CAAC;CACD;AAED,MAAM,kBAAkB;IAAxB;QACkB,WAAM,GAAG,aAAa,EAAY,CAAC;IAUrD,CAAC;IARQ,IAAI;QACX,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3B,MAAM,OAAO,GAAa,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;IAClE,CAAC;IAEM,EAAE,CAA2B,SAAY,EAAE,QAAqB;QACtE,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC5C,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 { validateAssertionError } from \"@fluidframework/test-runtime-utils\";\nimport { createEmitter, EventEmitter, ISubscribable } from \"../../events/index.js\";\n\ninterface TestEvents {\n\topen: () => void;\n\tclose: (error: boolean) => void;\n\tcompute: (input: string) => string;\n}\n\ndescribe(\"EventEmitter\", () => {\n\tit(\"emits events\", () => {\n\t\tconst emitter = createEmitter<TestEvents>();\n\t\tconst log: string[] = [];\n\t\temitter.on(\"open\", () => log.push(\"opened\"));\n\t\temitter.emit(\"open\");\n\t\tassert.deepEqual(log, [\"opened\"]);\n\t});\n\n\tit(\"emits events and collects their results\", () => {\n\t\tconst emitter = createEmitter<TestEvents>();\n\t\tconst listener1 = (arg: string) => arg.toUpperCase();\n\t\tconst listener2 = (arg: string) => arg.toLowerCase();\n\t\temitter.on(\"compute\", listener1);\n\t\temitter.on(\"compute\", listener2);\n\t\tconst results = emitter.emitAndCollect(\"compute\", \"hello\");\n\t\tassert.deepEqual(results, [\"HELLO\", \"hello\"]);\n\t});\n\n\tit(\"emits events and collects an empty result array when no listeners registered\", () => {\n\t\tconst emitter = createEmitter<TestEvents>();\n\t\tconst results = emitter.emitAndCollect(\"compute\", \"hello\");\n\t\tassert.deepEqual(results, []);\n\t});\n\n\tit(\"passes arguments to events\", () => {\n\t\tconst emitter = createEmitter<TestEvents>();\n\t\tlet error = false;\n\t\temitter.on(\"close\", (e: boolean) => {\n\t\t\terror = e;\n\t\t});\n\t\temitter.emit(\"close\", true);\n\t\tassert.strictEqual(error, true);\n\t});\n\n\tit(\"emits multiple events\", () => {\n\t\tconst emitter = createEmitter<TestEvents>();\n\t\tlet opened = false;\n\t\tlet closed = false;\n\t\temitter.on(\"open\", () => {\n\t\t\topened = true;\n\t\t});\n\t\temitter.on(\"close\", () => {\n\t\t\tclosed = true;\n\t\t});\n\t\temitter.emit(\"open\");\n\t\tassert(opened);\n\t\tassert(!closed);\n\t\temitter.emit(\"close\", false);\n\t\tassert(opened);\n\t\tassert(closed);\n\t});\n\n\tit(\"deregisters events\", () => {\n\t\tconst emitter = createEmitter<TestEvents>();\n\t\tlet error = false;\n\t\tconst deregister = emitter.on(\"close\", (e: boolean) => {\n\t\t\terror = e;\n\t\t});\n\t\tderegister();\n\t\temitter.emit(\"close\", true);\n\t\tassert.strictEqual(error, false);\n\t});\n\n\tit(\"deregisters multiple events\", () => {\n\t\tconst emitter = createEmitter<TestEvents>();\n\t\tlet opened = false;\n\t\tlet closed = false;\n\t\tconst deregisterOpen = emitter.on(\"open\", () => {\n\t\t\topened = true;\n\t\t});\n\t\tconst deregisterClosed = emitter.on(\"close\", () => {\n\t\t\tclosed = true;\n\t\t});\n\t\tderegisterOpen();\n\t\tderegisterClosed();\n\t\temitter.emit(\"open\");\n\t\tassert(!opened);\n\t\tassert(!closed);\n\t\temitter.emit(\"close\", false);\n\t\tassert(!opened);\n\t\tassert(!closed);\n\t});\n\n\t// TODO: this behavior is questionable due to how it relates to unregister events.\n\t// If events registered twice stop firing when unregistered once, that seems odd.\n\t// Also if two place (that don't know about each-other) add some callback for the same event,\n\t// it seems off that the behavior, and how they have to handle un-registration depends on if the functions they provided\n\t// happen to compare equal (ex: two calls to a logger or fail could hit this).\n\tit(\"ignores duplicate events\", () => {\n\t\tconst emitter = createEmitter<TestEvents>();\n\t\tlet count = 0;\n\t\tconst listener = () => (count += 1);\n\t\temitter.on(\"open\", listener);\n\t\temitter.on(\"open\", listener);\n\t\temitter.emit(\"open\");\n\t\t// Count should be 1, not 2, even though `listener` was registered twice\n\t\tassert.strictEqual(count, 1);\n\t});\n\n\tit(\"fails on duplicate deregistrations\", () => {\n\t\tconst emitter = createEmitter<TestEvents>();\n\t\tconst deregister = emitter.on(\"open\", () => {});\n\t\tconst deregisterB = emitter.on(\"open\", () => {});\n\t\tderegister();\n\t\tassert.throws(\n\t\t\t() => deregister(),\n\t\t\t(e: Error) =>\n\t\t\t\tvalidateAssertionError(\n\t\t\t\t\te,\n\t\t\t\t\t\"Listener does not exist. Event deregistration functions may only be invoked once.\",\n\t\t\t\t),\n\t\t);\n\t\tderegisterB();\n\t\tassert.throws(\n\t\t\t() => deregister(),\n\t\t\t(e: Error) =>\n\t\t\t\tvalidateAssertionError(\n\t\t\t\t\te,\n\t\t\t\t\t\"Event has no listeners. Event deregistration functions may only be invoked once.\",\n\t\t\t\t),\n\t\t);\n\t});\n\n\tit(\"skips events adding during event\", () => {\n\t\tconst emitter = createEmitter<TestEvents>();\n\t\tconst log: string[] = [];\n\t\tconst unsubscribe = emitter.on(\"open\", () => {\n\t\t\tlog.push(\"A\");\n\t\t\temitter.on(\"open\", () => {\n\t\t\t\tlog.push(\"B\");\n\t\t\t});\n\t\t});\n\t\temitter.emit(\"open\");\n\t\tunsubscribe();\n\t\tassert.deepEqual(log, [\"A\"]);\n\t\temitter.emit(\"open\");\n\t\tassert.deepEqual(log, [\"A\", \"B\"]);\n\t});\n\n\tit(\"reentrant events\", () => {\n\t\tconst emitter = createEmitter<TestEvents>();\n\t\tconst log: string[] = [];\n\t\tconst unsubscribe = emitter.on(\"open\", () => {\n\t\t\tlog.push(\"A1\");\n\t\t\temitter.on(\"open\", () => {\n\t\t\t\tlog.push(\"B\");\n\t\t\t});\n\t\t\tunsubscribe();\n\t\t\temitter.emit(\"open\");\n\t\t\tlog.push(\"A2\");\n\t\t});\n\t\temitter.emit(\"open\");\n\t\tassert.deepEqual(log, [\"A1\", \"B\", \"A2\"]);\n\t});\n});\n\ninterface MyEvents {\n\tloaded: () => void;\n\tcomputed: () => number;\n}\n\n// The below classes correspond to the examples given in the doc comment of `EventEmitter` to ensure that they compile\n\nclass MyInheritanceClass extends EventEmitter<MyEvents> {\n\tprivate load() {\n\t\tthis.emit(\"loaded\");\n\t\tconst results: number[] = this.emitAndCollect(\"computed\");\n\t}\n}\n\nclass MyCompositionClass implements ISubscribable<MyEvents> {\n\tprivate readonly events = createEmitter<MyEvents>();\n\n\tprivate load() {\n\t\tthis.events.emit(\"loaded\");\n\t\tconst results: number[] = this.events.emitAndCollect(\"computed\");\n\t}\n\n\tpublic on<K extends keyof MyEvents>(eventName: K, listener: MyEvents[K]): () => void {\n\t\treturn this.events.on(eventName, listener);\n\t}\n}\n"]}

package/lib/test/exhaustiveRebaserUtils.d.ts

@@ -1,78 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { RevisionMetadataSource, RevisionTag, TaggedChange } from "../core/index.js";
-import { RebaseRevisionMetadata } from "../feature-libraries/modular-schema/index.js";
-/**
- * Given a state tree, constructs the sequence of edits which led to that state.
- */
-export declare function getSequentialEdits<TContent, TChangeset>(initialState: FieldStateTree<TContent, TChangeset>): NamedChangeset<TChangeset>[];
-export declare function getSequentialStates<TContent, TChangeset>(state: FieldStateTree<TContent, TChangeset>): FieldStateTree<TContent, TChangeset>[];
-/**
- * Simplification of a FieldChangeRebaser which assumes the test author has already chosen particular:
- * - child field types (commonly TestChange)
- * - id allocation strategy
- * - revision metadata source
- */
-export interface BoundFieldChangeRebaser<TChangeset> {
-    invert(change: TaggedChange<TChangeset>, isRollback: boolean): TChangeset;
-    rebase(change: TChangeset, base: TaggedChange<TChangeset>, metadata?: RebaseRevisionMetadata): TChangeset;
-    /**
-     * Rebase the provided change over the composition of a set of base changes.
-     *
-     * @remarks - A revision metadata source is provided to this function currently in order to retain
-     * metadata from original edits in the case of repeated composition (i.e. what happens when sandwich
-     * rebasing). This is a bit inconsistent with the spirit of the rest of this interface, and depending
-     * on further refactoring would be nice to remove.
-     */
-    rebaseComposed(metadata: RebaseRevisionMetadata, change: TChangeset, ...baseChanges: TaggedChange<TChangeset>[]): TChangeset;
-    compose(change1: TaggedChange<TChangeset>, change2: TaggedChange<TChangeset>, metadata?: RevisionMetadataSource): TChangeset;
-    createEmpty(): TChangeset;
-    assertEqual?(change1: TaggedChange<TChangeset> | undefined, change2: TaggedChange<TChangeset> | undefined): void;
-}
-export interface NamedChangeset<TChangeset> {
-    changeset: TaggedChange<TChangeset>;
-    /**
-     * Intention for the changeset.
-     */
-    intention: number;
-    /**
-     * Friendly string describing the change.
-     * This is typically used to name test cases.
-     */
-    description: string;
-}
-/**
- * Utility type for modeling valid series of edits to a field. Each node in the tree stores the contents
- * of the field as well as information about the change applied to the parent state to get to this state.
- * Because the tree is structured as an up-tree (stores parent pointers), the series of actions taken from
- * some initial state to get to the state at a given node can be recovered by walking up the tree.
- *
- * This concept is similar to trees constructed in [state space search](https://en.wikipedia.org/wiki/State_space_search)
- * or the tree implicit to the [minimax algorithm](https://en.wikipedia.org/wiki/Minimax).
- *
- * It's a useful data structure for testing rebasing because it allows more automatic test case generation, e.g.
- * by exhaustively validating axioms against particular nodes in the tree up to a certain depth, or randomly selecting
- * only certain nodes in the case of combinatorial explosion.
- *
- * This file largely contains helpers for selecting nodes of certain types in this tree.
- * In order to use them with a particular field, that field must have an implementation of {@link ChildStateGenerator}.
- */
-export interface FieldStateTree<TContent, TChangeset> {
-    content: TContent;
-    mostRecentEdit?: NamedChangeset<TChangeset>;
-    parent?: FieldStateTree<TContent, TChangeset>;
-}
-/**
- * Given a particular state in a {@link FieldStateTree}, generates possible child states, i.e. states
- * which can be reached by applying a single valid change.
- */
-export type ChildStateGenerator<TContent, TChangeset> = (state: FieldStateTree<TContent, TChangeset>, tagFromIntention: (intention: number) => RevisionTag, mintIntention: () => number) => Iterable<FieldStateTree<TContent, TChangeset>>;
-export declare function makeIntentionMinter(): () => number;
-/**
- * Generates all possible sequences of edits of a fixed length.
- * Revision tags will be prefixed with the provided `tagPrefix`.
- */
-export declare function generatePossibleSequenceOfEdits<TContent, TChangeset>(initialState: FieldStateTree<TContent, TChangeset>, generateChildStates: ChildStateGenerator<TContent, TChangeset>, numberOfEdits: number, tagPrefix: string, intentionMinter?: () => number): Iterable<NamedChangeset<TChangeset>[]>;
-//# sourceMappingURL=exhaustiveRebaserUtils.d.ts.map

package/lib/test/exhaustiveRebaserUtils.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"exhaustiveRebaserUtils.d.ts","sourceRoot":"","sources":["../../src/test/exhaustiveRebaserUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,sBAAsB,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAErF,OAAO,EAAE,sBAAsB,EAAE,MAAM,8CAA8C,CAAC;AAEtF;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,UAAU,EACtD,YAAY,EAAE,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,GAChD,cAAc,CAAC,UAAU,CAAC,EAAE,CAQ9B;AAED,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,UAAU,EACvD,KAAK,EAAE,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,GACzC,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,EAAE,CAWxC;AAED;;;;;GAKG;AACH,MAAM,WAAW,uBAAuB,CAAC,UAAU;IAClD,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,OAAO,GAAG,UAAU,CAAC;IAC1E,MAAM,CACL,MAAM,EAAE,UAAU,EAClB,IAAI,EAAE,YAAY,CAAC,UAAU,CAAC,EAC9B,QAAQ,CAAC,EAAE,sBAAsB,GAC/B,UAAU,CAAC;IACd;;;;;;;OAOG;IACH,cAAc,CACb,QAAQ,EAAE,sBAAsB,EAChC,MAAM,EAAE,UAAU,EAClB,GAAG,WAAW,EAAE,YAAY,CAAC,UAAU,CAAC,EAAE,GACxC,UAAU,CAAC;IACd,OAAO,CACN,OAAO,EAAE,YAAY,CAAC,UAAU,CAAC,EACjC,OAAO,EAAE,YAAY,CAAC,UAAU,CAAC,EACjC,QAAQ,CAAC,EAAE,sBAAsB,GAC/B,UAAU,CAAC;IACd,WAAW,IAAI,UAAU,CAAC;IAC1B,WAAW,CAAC,CACX,OAAO,EAAE,YAAY,CAAC,UAAU,CAAC,GAAG,SAAS,EAC7C,OAAO,EAAE,YAAY,CAAC,UAAU,CAAC,GAAG,SAAS,GAC3C,IAAI,CAAC;CACR;AAED,MAAM,WAAW,cAAc,CAAC,UAAU;IACzC,SAAS,EAAE,YAAY,CAAC,UAAU,CAAC,CAAC;IAEpC;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;;OAGG;IACH,WAAW,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,cAAc,CAAC,QAAQ,EAAE,UAAU;IACnD,OAAO,EAAE,QAAQ,CAAC;IAClB,cAAc,CAAC,EAAE,cAAc,CAAC,UAAU,CAAC,CAAC;IAC5C,MAAM,CAAC,EAAE,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;CAC9C;AAED;;;GAGG;AACH,MAAM,MAAM,mBAAmB,CAAC,QAAQ,EAAE,UAAU,IAAI,CACvD,KAAK,EAAE,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,EAC3C,gBAAgB,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,WAAW,EACpD,aAAa,EAAE,MAAM,MAAM,KACvB,QAAQ,CAAC,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC;AA2BpD,wBAAgB,mBAAmB,IAAI,MAAM,MAAM,CAGlD;AAED;;;GAGG;AACH,wBAAiB,+BAA+B,CAAC,QAAQ,EAAE,UAAU,EACpE,YAAY,EAAE,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,EAClD,mBAAmB,EAAE,mBAAmB,CAAC,QAAQ,EAAE,UAAU,CAAC,EAC9D,aAAa,EAAE,MAAM,EACrB,SAAS,EAAE,MAAM,EACjB,eAAe,CAAC,EAAE,MAAM,MAAM,GAC5B,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE,CAAC,CAsBxC"}

package/lib/test/exhaustiveRebaserUtils.js

@@ -1,53 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/**
- * Given a state tree, constructs the sequence of edits which led to that state.
- */
-export function getSequentialEdits(initialState) {
-    const edits = [];
-    for (const state of getSequentialStates(initialState)) {
-        if (state.mostRecentEdit !== undefined) {
-            edits.push(state.mostRecentEdit);
-        }
-    }
-    return edits;
-}
-export function getSequentialStates(state) {
-    const states = [];
-    for (let current = state; current !== undefined; current = current.parent) {
-        states.push(current);
-    }
-    states.reverse();
-    return states;
-}
-function* depthFirstWalk(initialState, generateChildStates, depth, tagFromIntention, mintIntention) {
-    yield initialState;
-    if (depth > 0) {
-        for (const childState of generateChildStates(initialState, tagFromIntention, mintIntention)) {
-            yield* depthFirstWalk(childState, generateChildStates, depth - 1, tagFromIntention, mintIntention);
-        }
-    }
-}
-export function makeIntentionMinter() {
-    let intent = 0;
-    return () => intent++;
-}
-/**
- * Generates all possible sequences of edits of a fixed length.
- * Revision tags will be prefixed with the provided `tagPrefix`.
- */
-export function* generatePossibleSequenceOfEdits(initialState, generateChildStates, numberOfEdits, tagPrefix, intentionMinter) {
-    for (const state of depthFirstWalk(initialState, generateChildStates, numberOfEdits, (intention) => `${tagPrefix}${intention}`, intentionMinter ?? makeIntentionMinter())) {
-        const edits = [];
-        for (let current = state; current?.mostRecentEdit !== undefined; current = current.parent) {
-            edits.push(current.mostRecentEdit);
-        }
-        if (edits.length === numberOfEdits) {
-            edits.reverse();
-            yield edits;
-        }
-    }
-}
-//# sourceMappingURL=exhaustiveRebaserUtils.js.map

package/lib/test/exhaustiveRebaserUtils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"exhaustiveRebaserUtils.js","sourceRoot":"","sources":["../../src/test/exhaustiveRebaserUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH;;GAEG;AACH,MAAM,UAAU,kBAAkB,CACjC,YAAkD;IAElD,MAAM,KAAK,GAAiC,EAAE,CAAC;IAC/C,KAAK,MAAM,KAAK,IAAI,mBAAmB,CAAC,YAAY,CAAC,EAAE;QACtD,IAAI,KAAK,CAAC,cAAc,KAAK,SAAS,EAAE;YACvC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;KACD;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,MAAM,UAAU,mBAAmB,CAClC,KAA2C;IAE3C,MAAM,MAAM,GAA2C,EAAE,CAAC;IAC1D,KACC,IAAI,OAAO,GAAqD,KAAK,EACrE,OAAO,KAAK,SAAS,EACrB,OAAO,GAAG,OAAO,CAAC,MAAM,EACvB;QACD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACrB;IACD,MAAM,CAAC,OAAO,EAAE,CAAC;IACjB,OAAO,MAAM,CAAC;AACf,CAAC;AAuFD,QAAQ,CAAC,CAAC,cAAc,CACvB,YAAkD,EAClD,mBAA8D,EAC9D,KAAa,EACb,gBAAoD,EACpD,aAA2B;IAE3B,MAAM,YAAY,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,EAAE;QACd,KAAK,MAAM,UAAU,IAAI,mBAAmB,CAC3C,YAAY,EACZ,gBAAgB,EAChB,aAAa,CACb,EAAE;YACF,KAAK,CAAC,CAAC,cAAc,CACpB,UAAU,EACV,mBAAmB,EACnB,KAAK,GAAG,CAAC,EACT,gBAAgB,EAChB,aAAa,CACb,CAAC;SACF;KACD;AACF,CAAC;AAED,MAAM,UAAU,mBAAmB;IAClC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,OAAO,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC;AACvB,CAAC;AAED;;;GAGG;AACH,MAAM,SAAS,CAAC,CAAC,+BAA+B,CAC/C,YAAkD,EAClD,mBAA8D,EAC9D,aAAqB,EACrB,SAAiB,EACjB,eAA8B;IAE9B,KAAK,MAAM,KAAK,IAAI,cAAc,CACjC,YAAY,EACZ,mBAAmB,EACnB,aAAa,EACb,CAAC,SAAiB,EAAE,EAAE,CAAC,GAAG,SAAS,GAAG,SAAS,EAA4B,EAC3E,eAAe,IAAI,mBAAmB,EAAE,CACxC,EAAE;QACF,MAAM,KAAK,GAAiC,EAAE,CAAC;QAC/C,KACC,IAAI,OAAO,GAAqD,KAAK,EACrE,OAAO,EAAE,cAAc,KAAK,SAAS,EACrC,OAAO,GAAG,OAAO,CAAC,MAAM,EACvB;YACD,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;SACnC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,aAAa,EAAE;YACnC,KAAK,CAAC,OAAO,EAAE,CAAC;YAChB,MAAM,KAAK,CAAC;SACZ;KACD;AACF,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { RevisionMetadataSource, RevisionTag, TaggedChange } from \"../core/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { RebaseRevisionMetadata } from \"../feature-libraries/modular-schema/index.js\";\n\n/**\n * Given a state tree, constructs the sequence of edits which led to that state.\n */\nexport function getSequentialEdits<TContent, TChangeset>(\n\tinitialState: FieldStateTree<TContent, TChangeset>,\n): NamedChangeset<TChangeset>[] {\n\tconst edits: NamedChangeset<TChangeset>[] = [];\n\tfor (const state of getSequentialStates(initialState)) {\n\t\tif (state.mostRecentEdit !== undefined) {\n\t\t\tedits.push(state.mostRecentEdit);\n\t\t}\n\t}\n\treturn edits;\n}\n\nexport function getSequentialStates<TContent, TChangeset>(\n\tstate: FieldStateTree<TContent, TChangeset>,\n): FieldStateTree<TContent, TChangeset>[] {\n\tconst states: FieldStateTree<TContent, TChangeset>[] = [];\n\tfor (\n\t\tlet current: FieldStateTree<TContent, TChangeset> | undefined = state;\n\t\tcurrent !== undefined;\n\t\tcurrent = current.parent\n\t) {\n\t\tstates.push(current);\n\t}\n\tstates.reverse();\n\treturn states;\n}\n\n/**\n * Simplification of a FieldChangeRebaser which assumes the test author has already chosen particular:\n * - child field types (commonly TestChange)\n * - id allocation strategy\n * - revision metadata source\n */\nexport interface BoundFieldChangeRebaser<TChangeset> {\n\tinvert(change: TaggedChange<TChangeset>, isRollback: boolean): TChangeset;\n\trebase(\n\t\tchange: TChangeset,\n\t\tbase: TaggedChange<TChangeset>,\n\t\tmetadata?: RebaseRevisionMetadata,\n\t): TChangeset;\n\t/**\n\t * Rebase the provided change over the composition of a set of base changes.\n\t *\n\t * @remarks - A revision metadata source is provided to this function currently in order to retain\n\t * metadata from original edits in the case of repeated composition (i.e. what happens when sandwich\n\t * rebasing). This is a bit inconsistent with the spirit of the rest of this interface, and depending\n\t * on further refactoring would be nice to remove.\n\t */\n\trebaseComposed(\n\t\tmetadata: RebaseRevisionMetadata,\n\t\tchange: TChangeset,\n\t\t...baseChanges: TaggedChange<TChangeset>[]\n\t): TChangeset;\n\tcompose(\n\t\tchange1: TaggedChange<TChangeset>,\n\t\tchange2: TaggedChange<TChangeset>,\n\t\tmetadata?: RevisionMetadataSource,\n\t): TChangeset;\n\tcreateEmpty(): TChangeset;\n\tassertEqual?(\n\t\tchange1: TaggedChange<TChangeset> | undefined,\n\t\tchange2: TaggedChange<TChangeset> | undefined,\n\t): void;\n}\n\nexport interface NamedChangeset<TChangeset> {\n\tchangeset: TaggedChange<TChangeset>;\n\n\t/**\n\t * Intention for the changeset.\n\t */\n\tintention: number;\n\n\t/**\n\t * Friendly string describing the change.\n\t * This is typically used to name test cases.\n\t */\n\tdescription: string;\n}\n\n/**\n * Utility type for modeling valid series of edits to a field. Each node in the tree stores the contents\n * of the field as well as information about the change applied to the parent state to get to this state.\n * Because the tree is structured as an up-tree (stores parent pointers), the series of actions taken from\n * some initial state to get to the state at a given node can be recovered by walking up the tree.\n *\n * This concept is similar to trees constructed in [state space search](https://en.wikipedia.org/wiki/State_space_search)\n * or the tree implicit to the [minimax algorithm](https://en.wikipedia.org/wiki/Minimax).\n *\n * It's a useful data structure for testing rebasing because it allows more automatic test case generation, e.g.\n * by exhaustively validating axioms against particular nodes in the tree up to a certain depth, or randomly selecting\n * only certain nodes in the case of combinatorial explosion.\n *\n * This file largely contains helpers for selecting nodes of certain types in this tree.\n * In order to use them with a particular field, that field must have an implementation of {@link ChildStateGenerator}.\n */\nexport interface FieldStateTree<TContent, TChangeset> {\n\tcontent: TContent;\n\tmostRecentEdit?: NamedChangeset<TChangeset>;\n\tparent?: FieldStateTree<TContent, TChangeset>;\n}\n\n/**\n * Given a particular state in a {@link FieldStateTree}, generates possible child states, i.e. states\n * which can be reached by applying a single valid change.\n */\nexport type ChildStateGenerator<TContent, TChangeset> = (\n\tstate: FieldStateTree<TContent, TChangeset>,\n\ttagFromIntention: (intention: number) => RevisionTag,\n\tmintIntention: () => number,\n) => Iterable<FieldStateTree<TContent, TChangeset>>;\n\nfunction* depthFirstWalk<TContent, TChangeset>(\n\tinitialState: FieldStateTree<TContent, TChangeset>,\n\tgenerateChildStates: ChildStateGenerator<TContent, TChangeset>,\n\tdepth: number,\n\ttagFromIntention: (intention: number) => RevisionTag,\n\tmintIntention: () => number,\n): Iterable<FieldStateTree<TContent, TChangeset>> {\n\tyield initialState;\n\tif (depth > 0) {\n\t\tfor (const childState of generateChildStates(\n\t\t\tinitialState,\n\t\t\ttagFromIntention,\n\t\t\tmintIntention,\n\t\t)) {\n\t\t\tyield* depthFirstWalk(\n\t\t\t\tchildState,\n\t\t\t\tgenerateChildStates,\n\t\t\t\tdepth - 1,\n\t\t\t\ttagFromIntention,\n\t\t\t\tmintIntention,\n\t\t\t);\n\t\t}\n\t}\n}\n\nexport function makeIntentionMinter(): () => number {\n\tlet intent = 0;\n\treturn () => intent++;\n}\n\n/**\n * Generates all possible sequences of edits of a fixed length.\n * Revision tags will be prefixed with the provided `tagPrefix`.\n */\nexport function* generatePossibleSequenceOfEdits<TContent, TChangeset>(\n\tinitialState: FieldStateTree<TContent, TChangeset>,\n\tgenerateChildStates: ChildStateGenerator<TContent, TChangeset>,\n\tnumberOfEdits: number,\n\ttagPrefix: string,\n\tintentionMinter?: () => number,\n): Iterable<NamedChangeset<TChangeset>[]> {\n\tfor (const state of depthFirstWalk(\n\t\tinitialState,\n\t\tgenerateChildStates,\n\t\tnumberOfEdits,\n\t\t(intention: number) => `${tagPrefix}${intention}` as unknown as RevisionTag,\n\t\tintentionMinter ?? makeIntentionMinter(),\n\t)) {\n\t\tconst edits: NamedChangeset<TChangeset>[] = [];\n\t\tfor (\n\t\t\tlet current: FieldStateTree<TContent, TChangeset> | undefined = state;\n\t\t\tcurrent?.mostRecentEdit !== undefined;\n\t\t\tcurrent = current.parent\n\t\t) {\n\t\t\tedits.push(current.mostRecentEdit);\n\t\t}\n\n\t\tif (edits.length === numberOfEdits) {\n\t\t\tedits.reverse();\n\t\t\tyield edits;\n\t\t}\n\t}\n}\n"]}

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

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

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

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