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

package/lib/test/simple-tree/schemaFactoryRecursive.spec.js

@@ -1,282 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/* eslint-disable @typescript-eslint/no-non-null-assertion */
-import { strict as assert } from "node:assert";
-import { createIdCompressor } from "@fluidframework/id-compressor";
-import { MockFluidDataStoreRuntime } from "@fluidframework/test-runtime-utils";
-import { TreeConfiguration, } from "../../simple-tree/index.js";
-import { TreeFactory } from "../../treeFactory.js";
-import { SchemaFactoryRecursive,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../simple-tree/schemaFactoryRecursive.js";
-import { hydrate } from "./utils.js";
-// TODO:
-// Ensure the following have tests:
-// Recursive
-// Co-Recursive
-// Regular under recursive.
-// Recursive under regular.
-// All of the above for insertable and node APIs.
-// All of the above package exported schema with API extractor.
-// Ensure implicit construction and explicit construction work in all the above (or implicit fails to build in some cases (but only shallowly) and everything else works )
-// Recursion through ImplicitAllowedTypes (part of co-recursion)
-// Recursion through ImplicitFieldSchema (part of union and as part of co-recursion)
-const sf = new SchemaFactoryRecursive("recursive");
-describe("SchemaFactoryRecursive", () => {
-    describe("objectRecursive", () => {
-        it("End-to-end with recursive object", () => {
-            const factory = new TreeFactory({});
-            const schema = new SchemaFactoryRecursive("com.example");
-            /**
-             * Example Recursive type
-             */
-            class Box extends schema.objectRecursive("Box", {
-                /**
-                 * Doc comment on a schema based field. Intellisense should work when referencing the field.
-                 */
-                text: schema.string,
-                /**
-                 * Example optional field.
-                 * Works the same as before.
-                 */
-                child: schema.optionalRecursive([() => Box]),
-            }) {
-            }
-            const config = new TreeConfiguration(Box, () => new Box({ text: "hi", child: undefined }));
-            const tree = factory.create(new MockFluidDataStoreRuntime({ idCompressor: createIdCompressor() }), "tree");
-            const view = tree.schematize(config);
-            assert.equal(view.root?.text, "hi");
-            const stuff = view.root.child;
-            assert.equal(stuff, undefined);
-            view.root.child = new Box({
-                text: "hi2",
-                child: new Box({ text: "hi3", child: new Box({ text: "hi4", child: undefined }) }),
-            });
-            {
-            }
-            const stuff2 = view.root.child?.child?.child;
-            assert.equal(stuff2?.text, "hi4");
-        });
-        it("objects", () => {
-            class ObjectRecursive extends sf.objectRecursive("Object", {
-                x: sf.optionalRecursive([() => ObjectRecursive]),
-            }) {
-            }
-            const tree = hydrate(ObjectRecursive, new ObjectRecursive({ x: undefined }));
-            const data = Reflect.ownKeys(tree);
-            // TODO: are empty optional fields supposed to show up as keys in simple-tree? They currently are included, but maybe thats a bug?
-            // Currently optional fields must be provided explicitly when constructing nodes, but this is planned to change (with default field defaults), which will make it seem less like the should be included.
-            // Additionally all the lower level abstractions omit empty fields when iterating (especially map nodes which would be infinite if they didn't): if this layer is supposed to differ it should be explicit about it.
-            assert.deepEqual(data, ["x"]);
-            tree.x = new ObjectRecursive({ x: undefined });
-            tree.x = tree.x?.x?.x?.x ?? new ObjectRecursive({ x: undefined });
-            const tree2 = hydrate(ObjectRecursive, new ObjectRecursive({ x: new ObjectRecursive({ x: undefined }) }));
-        });
-        it("other under recursive object", () => {
-            class Other extends sf.object("Other", {
-                y: sf.number,
-            }) {
-            }
-            class ObjectRecursive extends sf.objectRecursive("Object", {
-                x: sf.optionalRecursive([() => ObjectRecursive]),
-                a: Other,
-                b: [Other],
-                c: [() => Other],
-                d: sf.optional(Other),
-                e: sf.optional([() => Other]),
-            }) {
-            }
-            const tree2 = hydrate(ObjectRecursive, new ObjectRecursive({
-                x: undefined,
-                a: new Other({ y: 5 }),
-                b: new Other({ y: 5 }),
-                c: new Other({ y: 5 }),
-                d: new Other({ y: 5 }),
-                e: new Other({ y: 5 }),
-            }));
-        });
-        it("object nested construction", () => {
-            class ObjectRecursive extends sf.objectRecursive("Object", {
-                x: sf.optionalRecursive([() => ObjectRecursive]),
-            }) {
-            }
-            {
-                const field = ObjectRecursive.info.x;
-            }
-            const tree = hydrate(ObjectRecursive, new ObjectRecursive({ x: undefined }));
-            tree.x = new ObjectRecursive({ x: undefined });
-            // tree.x = new ObjectRecursive({ x: { x: undefined } });
-            // tree.x = new ObjectRecursive({ x: { x: { x: { x: { x: undefined } } } } });
-            tree.x = new ObjectRecursive({ x: undefined });
-            tree.x = new ObjectRecursive({ x: new ObjectRecursive({ x: undefined }) });
-            tree.x = new ObjectRecursive({
-                x: new ObjectRecursive({ x: new ObjectRecursive({ x: undefined }) }),
-            });
-            tree.x = tree.x?.x?.x?.x ?? new ObjectRecursive({ x: undefined });
-        });
-        it("co-recursive objects with implicit field", () => {
-            class A extends sf.objectRecursive("A", {
-                a: sf.optionalRecursive([() => B]),
-            }) {
-            }
-            class B extends sf.object("B", {
-                // Implicit required field
-                b: A,
-            }) {
-            }
-            {
-                const tree = hydrate(B, { b: new A({ a: undefined }) });
-                assert.equal(tree.b.a, undefined);
-            }
-            {
-                const tree = hydrate(B, new B({ b: new A({ a: undefined }) }));
-                assert.equal(tree.b.a, undefined);
-            }
-            {
-                const tree = hydrate(A, new A({ a: undefined }));
-                assert.equal(tree.a, undefined);
-            }
-            {
-                const tree = hydrate(A, new A({ a: new B({ b: new A({ a: undefined }) }) }));
-                assert.equal(tree.a.b.a, undefined);
-            }
-            {
-                const tree = hydrate(A, new A({ a: { b: new A({ a: undefined }) } }));
-                assert.equal(tree.a.b.a, undefined);
-            }
-        });
-        it("co-recursive objects with explicit non-recursive field", () => {
-            class A extends sf.objectRecursive("A", {
-                a: sf.optionalRecursive([() => B]),
-            }) {
-            }
-            class B extends sf.object("B", {
-                b: sf.optional(A),
-            }) {
-            }
-            {
-                const tree = hydrate(B, { b: new A({ a: undefined }) });
-                assert.equal(tree.b.a, undefined);
-            }
-            {
-                const tree = hydrate(B, new B({ b: new A({ a: undefined }) }));
-                assert.equal(tree.b.a, undefined);
-            }
-            {
-                const tree = hydrate(A, new A({ a: undefined }));
-                assert.equal(tree.a, undefined);
-            }
-            {
-                const tree = hydrate(A, new A({ a: new B({ b: new A({ a: undefined }) }) }));
-                assert.equal(tree.a.b.a, undefined);
-            }
-            {
-                const tree = hydrate(A, new A({ a: { b: new A({ a: undefined }) } }));
-                assert.equal(tree.a.b.a, undefined);
-            }
-        });
-        it("recursive object with implicit recursive field", () => {
-            class A extends sf.objectRecursive("A", {
-                a: [() => B, sf.number],
-            }) {
-            }
-            class B extends sf.object("B", {
-                b: sf.optional(A),
-            }) {
-            }
-            {
-                const tree = hydrate(B, { b: new A({ a: 5 }) });
-                assert.equal(tree.b.a, 5);
-            }
-            {
-                const tree = hydrate(A, new A({ a: 5 }));
-                assert.equal(tree.a, 5);
-            }
-            {
-                const tree = hydrate(A, new A({ a: new B({ b: new A({ a: 6 }) }) }));
-                assert.equal(tree.a.b.a, 6);
-            }
-        });
-    });
-    describe("ValidateRecursiveSchema", () => {
-        it("Valid cases", () => {
-            {
-                class Test extends sf.arrayRecursive("Test", [() => Test]) {
-                }
-            }
-            {
-                class Test extends sf.objectRecursive("Test", {
-                    x: sf.optionalRecursive([() => Test]),
-                }) {
-                }
-            }
-            {
-                class Test extends sf.mapRecursive("Test", [() => Test]) {
-                }
-            }
-        });
-        it("Invalid cases", () => {
-            {
-                class Test extends sf.arrayRecursive("Test", () => Test) {
-                }
-            }
-            {
-                class Test extends sf.objectRecursive("Test", sf.optionalRecursive([() => Test])) {
-                }
-            }
-            {
-                class MapRecursive extends sf.mapRecursive("Test", sf.optionalRecursive([() => MapRecursive])) {
-                }
-            }
-        });
-    });
-    describe("arrayRecursive", () => {
-        it("simple", () => {
-            class ArrayRecursive extends sf.arrayRecursive("List", [() => ArrayRecursive]) {
-            }
-            // Explicit constructor call
-            {
-                const data = hydrate(ArrayRecursive, new ArrayRecursive([]));
-                assert.deepEqual([...data], []);
-            }
-            // Nested
-            {
-                const data = hydrate(ArrayRecursive, new ArrayRecursive([new ArrayRecursive([])]));
-                assert.equal(data.length, 1);
-                assert.deepEqual([...data[0]], []);
-                // @ts-expect-error ListRecursive should not be implicitly constructable (for now).
-                const _check = [];
-                data.insertAtEnd(new ArrayRecursive([]));
-                data[0].insertAtEnd(new ArrayRecursive([]));
-            }
-        });
-    });
-    describe("mapRecursive", () => {
-        it("simple", () => {
-            class MapRecursive extends sf.mapRecursive("Map", [() => MapRecursive]) {
-            }
-            const node = hydrate(MapRecursive, new MapRecursive([]));
-            const data = [...node];
-            assert.deepEqual(data, []);
-            // Nested
-            {
-                const _check = new MapRecursive([]);
-            }
-            node.set("x", new MapRecursive([]));
-            node.get("x")?.set("x", new MapRecursive(new Map()));
-        });
-    });
-    it("recursive under non-recursive", () => {
-        class ArrayRecursive extends sf.arrayRecursive("List", [() => ArrayRecursive]) {
-        }
-        class Root extends sf.object("Root", {
-            r: ArrayRecursive,
-        }) {
-        }
-        const r = hydrate(Root, { r: new ArrayRecursive([]) });
-        assert.deepEqual([...r.r], []);
-    });
-});
-//# sourceMappingURL=schemaFactoryRecursive.spec.js.map

package/lib/test/simple-tree/schemaFactoryRecursive.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"schemaFactoryRecursive.spec.js","sourceRoot":"","sources":["../../../src/test/simple-tree/schemaFactoryRecursive.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,6DAA6D;AAE7D,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAE,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AACnE,OAAO,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,EAKN,iBAAiB,GAGjB,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAWnD,OAAO,EACN,sBAAsB;AAEtB,sDAAsD;EACtD,MAAM,6CAA6C,CAAC;AACrD,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAErC,QAAQ;AACR,mCAAmC;AACnC,YAAY;AACZ,eAAe;AACf,2BAA2B;AAC3B,2BAA2B;AAC3B,iDAAiD;AACjD,+DAA+D;AAC/D,0KAA0K;AAC1K,gEAAgE;AAChE,oFAAoF;AAEpF,MAAM,EAAE,GAAG,IAAI,sBAAsB,CAAC,WAAW,CAAC,CAAC;AAEnD,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACvC,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAChC,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC3C,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAI,sBAAsB,CAAC,aAAa,CAAC,CAAC;YAEzD;;eAEG;YACH,MAAM,GAAI,SAAQ,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE;gBAC/C;;mBAEG;gBACH,IAAI,EAAE,MAAM,CAAC,MAAM;gBACnB;;;mBAGG;gBACH,KAAK,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;aAC5C,CAAC;aAAG;YAEL,MAAM,MAAM,GAAG,IAAI,iBAAiB,CACnC,GAAG,EACH,GAAG,EAAE,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAC/C,CAAC;YAEF,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAC1B,IAAI,yBAAyB,CAAC,EAAE,YAAY,EAAE,kBAAkB,EAAE,EAAE,CAAC,EACrE,MAAM,CACN,CAAC;YAEF,MAAM,IAAI,GAAkB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YACpD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAEpC,MAAM,KAAK,GAAoB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;YAE/C,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YAE/B,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC;gBACzB,IAAI,EAAE,KAAK;gBACX,KAAK,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;aAClF,CAAC,CAAC;YAEH;aAGC;YAED,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC;YAE7C,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAClB,MAAM,eAAgB,SAAQ,EAAE,CAAC,eAAe,CAAC,QAAQ,EAAE;gBAC1D,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;aAChD,CAAC;aAAG;YAgCL,MAAM,IAAI,GAAG,OAAO,CAAC,eAAe,EAAE,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;YAE7E,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnC,kIAAkI;YAClI,wMAAwM;YACxM,oNAAoN;YACpN,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAE9B,IAAI,CAAC,CAAC,GAAG,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;YAE/C,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;YAElE,MAAM,KAAK,GAAG,OAAO,CACpB,eAAe,EACf,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CACjE,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACvC,MAAM,KAAM,SAAQ,EAAE,CAAC,MAAM,CAAC,OAAO,EAAE;gBACtC,CAAC,EAAE,EAAE,CAAC,MAAM;aACZ,CAAC;aAAG;YACL,MAAM,eAAgB,SAAQ,EAAE,CAAC,eAAe,CAAC,QAAQ,EAAE;gBAC1D,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;gBAChD,CAAC,EAAE,KAAK;gBACR,CAAC,EAAE,CAAC,KAAK,CAAC;gBACV,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;gBAChB,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;gBACrB,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;aAC7B,CAAC;aAAG;YAEL,MAAM,KAAK,GAAG,OAAO,CACpB,eAAe,EACf,IAAI,eAAe,CAAC;gBACnB,CAAC,EAAE,SAAS;gBACZ,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;aACtB,CAAC,CACF,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,MAAM,eAAgB,SAAQ,EAAE,CAAC,eAAe,CAAC,QAAQ,EAAE;gBAC1D,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;aAChD,CAAC;aAAG;YAEL;gBACC,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;aASrC;YAED,MAAM,IAAI,GAAG,OAAO,CAAC,eAAe,EAAE,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;YAE7E,IAAI,CAAC,CAAC,GAAG,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;YAC/C,yDAAyD;YACzD,8EAA8E;YAE9E,IAAI,CAAC,CAAC,GAAG,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,CAAC,GAAG,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,IAAI,CAAC,CAAC,GAAG,IAAI,eAAe,CAAC;gBAC5B,CAAC,EAAE,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;aACpE,CAAC,CAAC;YAEH,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YACnD,MAAM,CAAE,SAAQ,EAAE,CAAC,eAAe,CAAC,GAAG,EAAE;gBACvC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;aAClC,CAAC;aAAG;YAEL,MAAM,CAAE,SAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE;gBAC9B,0BAA0B;gBAC1B,CAAC,EAAE,CAAC;aACJ,CAAC;aAAG;YAEL;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;gBACxD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aAClC;YAED;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/D,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aAClC;YAED;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aAChC;YAED;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7E,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aACrC;YAED;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBACtE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aACrC;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;YACjE,MAAM,CAAE,SAAQ,EAAE,CAAC,eAAe,CAAC,GAAG,EAAE;gBACvC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;aAClC,CAAC;aAAG;YAEL,MAAM,CAAE,SAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE;gBAC9B,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;aACjB,CAAC;aAAG;YAEL;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;gBACxD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aACnC;YAED;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/D,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aACnC;YAED;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aAChC;YAED;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7E,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAE,CAAC,CAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aACtC;YAED;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBACtE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAE,CAAC,CAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aACtC;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;YACzD,MAAM,CAAE,SAAQ,EAAE,CAAC,eAAe,CAAC,GAAG,EAAE;gBACvC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC;aACvB,CAAC;aAAG;YAEL,MAAM,CAAE,SAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE;gBAC9B,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;aACjB,CAAC;aAAG;YAEL;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBAChD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aAC3B;YAED;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aACxB;YAED;gBACC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBACrE,MAAM,CAAC,KAAK,CAAE,IAAI,CAAC,CAAO,CAAC,CAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aACpC;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;QACxC,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;YACtB;gBACC,MAAM,IAAK,SAAQ,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;iBAAG;aAE7D;YAED;gBACC,MAAM,IAAK,SAAQ,EAAE,CAAC,eAAe,CAAC,MAAM,EAAE;oBAC7C,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;iBACrC,CAAC;iBAAG;aAEL;YAED;gBACC,MAAM,IAAK,SAAQ,EAAE,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;iBAAG;aAE3D;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;YACxB;gBACC,MAAM,IAAK,SAAQ,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC;iBAAG;aAG3D;YAED;gBACC,MAAM,IAAK,SAAQ,EAAE,CAAC,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;iBAAG;aAGpF;YAED;gBACC,MAAM,YAAa,SAAQ,EAAE,CAAC,YAAY,CACzC,MAAM,EACN,EAAE,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,CAC1C;iBAAG;aAGJ;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC/B,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;YACjB,MAAM,cAAe,SAAQ,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;aAAG;YACjF,4BAA4B;YAC5B;gBACC,MAAM,IAAI,GAAmB,OAAO,CAAC,cAAc,EAAE,IAAI,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7E,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;aAChC;YACD,SAAS;YACT;gBACC,MAAM,IAAI,GAAmB,OAAO,CACnC,cAAc,EACd,IAAI,cAAc,CAAC,CAAC,IAAI,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,CAC5C,CAAC;gBACF,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBAC7B,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAGnC,mFAAmF;gBACnF,MAAM,MAAM,GAAM,EAAE,CAAC;gBAIrB,IAAI,CAAC,WAAW,CAAC,IAAI,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBAEzC,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;aAC5C;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC7B,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;YACjB,MAAM,YAAa,SAAQ,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;aAAG;YAC1E,MAAM,IAAI,GAAG,OAAO,CAAC,YAAY,EAAE,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC;YACzD,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;YACvB,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAE3B,SAAS;YACT;gBAEC,MAAM,MAAM,GAAM,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC;aAGvC;YAED,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC;YAEpC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,YAAY,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;QACtD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,MAAM,cAAe,SAAQ,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;SAAG;QACjF,MAAM,IAAK,SAAQ,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE;YACpC,CAAC,EAAE,cAAc;SACjB,CAAC;SAAG;QAEL,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,IAAI,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACvD,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAChC,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\n/* eslint-disable @typescript-eslint/no-non-null-assertion */\n\nimport { strict as assert } from \"node:assert\";\nimport { createIdCompressor } from \"@fluidframework/id-compressor\";\nimport { MockFluidDataStoreRuntime } from \"@fluidframework/test-runtime-utils\";\nimport {\n\tApplyKind,\n\tFieldSchema,\n\tInsertableTreeNodeFromImplicitAllowedTypes,\n\tNodeFromSchema,\n\tTreeConfiguration,\n\tTreeNodeFromImplicitAllowedTypes,\n\tTreeView,\n} from \"../../simple-tree/index.js\";\nimport { TreeFactory } from \"../../treeFactory.js\";\nimport { areSafelyAssignable, requireAssignableTo, requireTrue } from \"../../util/index.js\";\nimport { FlexListToUnion } from \"../../feature-libraries/index.js\";\nimport {\n\tFieldSchemaUnsafe,\n\tInsertableTreeFieldFromImplicitFieldUnsafe,\n\tInsertableTreeNodeFromImplicitAllowedTypesUnsafe,\n\tTreeFieldFromImplicitFieldUnsafe,\n\tTreeNodeFromImplicitAllowedTypesUnsafe,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../simple-tree/typesUnsafe.js\";\nimport {\n\tSchemaFactoryRecursive,\n\tValidateRecursiveSchema,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../simple-tree/schemaFactoryRecursive.js\";\nimport { hydrate } from \"./utils.js\";\n\n// TODO:\n// Ensure the following have tests:\n// Recursive\n// Co-Recursive\n// Regular under recursive.\n// Recursive under regular.\n// All of the above for insertable and node APIs.\n// All of the above package exported schema with API extractor.\n// Ensure implicit construction and explicit construction work in all the above (or implicit fails to build in some cases (but only shallowly) and everything else works )\n// Recursion through ImplicitAllowedTypes (part of co-recursion)\n// Recursion through ImplicitFieldSchema (part of union and as part of co-recursion)\n\nconst sf = new SchemaFactoryRecursive(\"recursive\");\n\ndescribe(\"SchemaFactoryRecursive\", () => {\n\tdescribe(\"objectRecursive\", () => {\n\t\tit(\"End-to-end with recursive object\", () => {\n\t\t\tconst factory = new TreeFactory({});\n\t\t\tconst schema = new SchemaFactoryRecursive(\"com.example\");\n\n\t\t\t/**\n\t\t\t * Example Recursive type\n\t\t\t */\n\t\t\tclass Box extends schema.objectRecursive(\"Box\", {\n\t\t\t\t/**\n\t\t\t\t * Doc comment on a schema based field. Intellisense should work when referencing the field.\n\t\t\t\t */\n\t\t\t\ttext: schema.string,\n\t\t\t\t/**\n\t\t\t\t * Example optional field.\n\t\t\t\t * Works the same as before.\n\t\t\t\t */\n\t\t\t\tchild: schema.optionalRecursive([() => Box]),\n\t\t\t}) {}\n\n\t\t\tconst config = new TreeConfiguration(\n\t\t\t\tBox,\n\t\t\t\t() => new Box({ text: \"hi\", child: undefined }),\n\t\t\t);\n\n\t\t\tconst tree = factory.create(\n\t\t\t\tnew MockFluidDataStoreRuntime({ idCompressor: createIdCompressor() }),\n\t\t\t\t\"tree\",\n\t\t\t);\n\n\t\t\tconst view: TreeView<Box> = tree.schematize(config);\n\t\t\tassert.equal(view.root?.text, \"hi\");\n\n\t\t\tconst stuff: undefined | Box = view.root.child;\n\n\t\t\tassert.equal(stuff, undefined);\n\n\t\t\tview.root.child = new Box({\n\t\t\t\ttext: \"hi2\",\n\t\t\t\tchild: new Box({ text: \"hi3\", child: new Box({ text: \"hi4\", child: undefined }) }),\n\t\t\t});\n\n\t\t\t{\n\t\t\t\ttype _check1 = requireAssignableTo<undefined, typeof view.root.child.child>;\n\t\t\t\ttype _check2 = requireAssignableTo<Box, typeof view.root.child.child>;\n\t\t\t}\n\n\t\t\tconst stuff2 = view.root.child?.child?.child;\n\n\t\t\tassert.equal(stuff2?.text, \"hi4\");\n\t\t});\n\n\t\tit(\"objects\", () => {\n\t\t\tclass ObjectRecursive extends sf.objectRecursive(\"Object\", {\n\t\t\t\tx: sf.optionalRecursive([() => ObjectRecursive]),\n\t\t\t}) {}\n\n\t\t\ttype XSchema = typeof ObjectRecursive.info.x;\n\t\t\ttype Field2 = XSchema extends FieldSchema<infer Kind, infer Types>\n\t\t\t\t? ApplyKind<TreeNodeFromImplicitAllowedTypes<Types>, Kind>\n\t\t\t\t: \"zzz\";\n\t\t\ttype XTypes = XSchema extends FieldSchemaUnsafe<infer Kind, infer Types> ? Types : \"Q\";\n\t\t\ttype Field3 = TreeNodeFromImplicitAllowedTypes<XTypes>;\n\t\t\ttype Field4 = FlexListToUnion<XTypes>;\n\t\t\ttype _check1 = requireTrue<areSafelyAssignable<Field3, ObjectRecursive>>;\n\t\t\ttype _check2 = requireTrue<areSafelyAssignable<Field4, typeof ObjectRecursive>>;\n\n\t\t\ttype Insertable = InsertableTreeNodeFromImplicitAllowedTypes<typeof ObjectRecursive>;\n\t\t\ttype _checkInsertable = requireTrue<areSafelyAssignable<Insertable, ObjectRecursive>>;\n\t\t\ttype Constructable = NodeFromSchema<typeof ObjectRecursive>;\n\t\t\ttype _checkConstructable = requireTrue<\n\t\t\t\tareSafelyAssignable<Constructable, ObjectRecursive>\n\t\t\t>;\n\t\t\ttype Child = ObjectRecursive[\"x\"];\n\t\t\ttype _checkChild = requireTrue<areSafelyAssignable<Child, ObjectRecursive | undefined>>;\n\t\t\ttype Constructor = ConstructorParameters<typeof ObjectRecursive>;\n\t\t\ttype _checkConstructor = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tConstructor,\n\t\t\t\t\t[\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treadonly x: undefined | ObjectRecursive;\n\t\t\t\t\t\t},\n\t\t\t\t\t]\n\t\t\t\t>\n\t\t\t>;\n\n\t\t\tconst tree = hydrate(ObjectRecursive, new ObjectRecursive({ x: undefined }));\n\n\t\t\tconst data = Reflect.ownKeys(tree);\n\t\t\t// TODO: are empty optional fields supposed to show up as keys in simple-tree? They currently are included, but maybe thats a bug?\n\t\t\t// Currently optional fields must be provided explicitly when constructing nodes, but this is planned to change (with default field defaults), which will make it seem less like the should be included.\n\t\t\t// Additionally all the lower level abstractions omit empty fields when iterating (especially map nodes which would be infinite if they didn't): if this layer is supposed to differ it should be explicit about it.\n\t\t\tassert.deepEqual(data, [\"x\"]);\n\n\t\t\ttree.x = new ObjectRecursive({ x: undefined });\n\n\t\t\ttree.x = tree.x?.x?.x?.x ?? new ObjectRecursive({ x: undefined });\n\n\t\t\tconst tree2 = hydrate(\n\t\t\t\tObjectRecursive,\n\t\t\t\tnew ObjectRecursive({ x: new ObjectRecursive({ x: undefined }) }),\n\t\t\t);\n\t\t});\n\n\t\tit(\"other under recursive object\", () => {\n\t\t\tclass Other extends sf.object(\"Other\", {\n\t\t\t\ty: sf.number,\n\t\t\t}) {}\n\t\t\tclass ObjectRecursive extends sf.objectRecursive(\"Object\", {\n\t\t\t\tx: sf.optionalRecursive([() => ObjectRecursive]),\n\t\t\t\ta: Other,\n\t\t\t\tb: [Other],\n\t\t\t\tc: [() => Other],\n\t\t\t\td: sf.optional(Other),\n\t\t\t\te: sf.optional([() => Other]),\n\t\t\t}) {}\n\n\t\t\tconst tree2 = hydrate(\n\t\t\t\tObjectRecursive,\n\t\t\t\tnew ObjectRecursive({\n\t\t\t\t\tx: undefined,\n\t\t\t\t\ta: new Other({ y: 5 }),\n\t\t\t\t\tb: new Other({ y: 5 }),\n\t\t\t\t\tc: new Other({ y: 5 }),\n\t\t\t\t\td: new Other({ y: 5 }),\n\t\t\t\t\te: new Other({ y: 5 }),\n\t\t\t\t}),\n\t\t\t);\n\t\t});\n\n\t\tit(\"object nested construction\", () => {\n\t\t\tclass ObjectRecursive extends sf.objectRecursive(\"Object\", {\n\t\t\t\tx: sf.optionalRecursive([() => ObjectRecursive]),\n\t\t\t}) {}\n\n\t\t\t{\n\t\t\t\tconst field = ObjectRecursive.info.x;\n\t\t\t\ttype Field = typeof field;\n\t\t\t\ttype IC = (typeof ObjectRecursive)[\"implicitlyConstructable\"];\n\t\t\t\ttype Xa = TreeFieldFromImplicitFieldUnsafe<Field>;\n\t\t\t\ttype Xb = InsertableTreeFieldFromImplicitFieldUnsafe<Field>;\n\n\t\t\t\ttype AllowedTypes = Field[\"allowedTypes\"];\n\t\t\t\ttype X2a = TreeNodeFromImplicitAllowedTypesUnsafe<AllowedTypes>;\n\t\t\t\ttype X2b = InsertableTreeNodeFromImplicitAllowedTypesUnsafe<AllowedTypes>;\n\t\t\t}\n\n\t\t\tconst tree = hydrate(ObjectRecursive, new ObjectRecursive({ x: undefined }));\n\n\t\t\ttree.x = new ObjectRecursive({ x: undefined });\n\t\t\t// tree.x = new ObjectRecursive({ x: { x: undefined } });\n\t\t\t// tree.x = new ObjectRecursive({ x: { x: { x: { x: { x: undefined } } } } });\n\n\t\t\ttree.x = new ObjectRecursive({ x: undefined });\n\t\t\ttree.x = new ObjectRecursive({ x: new ObjectRecursive({ x: undefined }) });\n\t\t\ttree.x = new ObjectRecursive({\n\t\t\t\tx: new ObjectRecursive({ x: new ObjectRecursive({ x: undefined }) }),\n\t\t\t});\n\n\t\t\ttree.x = tree.x?.x?.x?.x ?? new ObjectRecursive({ x: undefined });\n\t\t});\n\n\t\tit(\"co-recursive objects with implicit field\", () => {\n\t\t\tclass A extends sf.objectRecursive(\"A\", {\n\t\t\t\ta: sf.optionalRecursive([() => B]),\n\t\t\t}) {}\n\n\t\t\tclass B extends sf.object(\"B\", {\n\t\t\t\t// Implicit required field\n\t\t\t\tb: A,\n\t\t\t}) {}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(B, { b: new A({ a: undefined }) });\n\t\t\t\tassert.equal(tree.b.a, undefined);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(B, new B({ b: new A({ a: undefined }) }));\n\t\t\t\tassert.equal(tree.b.a, undefined);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(A, new A({ a: undefined }));\n\t\t\t\tassert.equal(tree.a, undefined);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(A, new A({ a: new B({ b: new A({ a: undefined }) }) }));\n\t\t\t\tassert.equal(tree.a!.b.a, undefined);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(A, new A({ a: { b: new A({ a: undefined }) } }));\n\t\t\t\tassert.equal(tree.a!.b.a, undefined);\n\t\t\t}\n\t\t});\n\n\t\tit(\"co-recursive objects with explicit non-recursive field\", () => {\n\t\t\tclass A extends sf.objectRecursive(\"A\", {\n\t\t\t\ta: sf.optionalRecursive([() => B]),\n\t\t\t}) {}\n\n\t\t\tclass B extends sf.object(\"B\", {\n\t\t\t\tb: sf.optional(A),\n\t\t\t}) {}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(B, { b: new A({ a: undefined }) });\n\t\t\t\tassert.equal(tree.b!.a, undefined);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(B, new B({ b: new A({ a: undefined }) }));\n\t\t\t\tassert.equal(tree.b!.a, undefined);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(A, new A({ a: undefined }));\n\t\t\t\tassert.equal(tree.a, undefined);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(A, new A({ a: new B({ b: new A({ a: undefined }) }) }));\n\t\t\t\tassert.equal(tree.a!.b!.a, undefined);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(A, new A({ a: { b: new A({ a: undefined }) } }));\n\t\t\t\tassert.equal(tree.a!.b!.a, undefined);\n\t\t\t}\n\t\t});\n\n\t\tit(\"recursive object with implicit recursive field\", () => {\n\t\t\tclass A extends sf.objectRecursive(\"A\", {\n\t\t\t\ta: [() => B, sf.number],\n\t\t\t}) {}\n\n\t\t\tclass B extends sf.object(\"B\", {\n\t\t\t\tb: sf.optional(A),\n\t\t\t}) {}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(B, { b: new A({ a: 5 }) });\n\t\t\t\tassert.equal(tree.b!.a, 5);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(A, new A({ a: 5 }));\n\t\t\t\tassert.equal(tree.a, 5);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tconst tree = hydrate(A, new A({ a: new B({ b: new A({ a: 6 }) }) }));\n\t\t\t\tassert.equal((tree.a as B).b!.a, 6);\n\t\t\t}\n\t\t});\n\t});\n\tdescribe(\"ValidateRecursiveSchema\", () => {\n\t\tit(\"Valid cases\", () => {\n\t\t\t{\n\t\t\t\tclass Test extends sf.arrayRecursive(\"Test\", [() => Test]) {}\n\t\t\t\ttype _check = ValidateRecursiveSchema<typeof Test>;\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tclass Test extends sf.objectRecursive(\"Test\", {\n\t\t\t\t\tx: sf.optionalRecursive([() => Test]),\n\t\t\t\t}) {}\n\t\t\t\ttype _check = ValidateRecursiveSchema<typeof Test>;\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tclass Test extends sf.mapRecursive(\"Test\", [() => Test]) {}\n\t\t\t\ttype _check = ValidateRecursiveSchema<typeof Test>;\n\t\t\t}\n\t\t});\n\n\t\tit(\"Invalid cases\", () => {\n\t\t\t{\n\t\t\t\tclass Test extends sf.arrayRecursive(\"Test\", () => Test) {}\n\t\t\t\t// @ts-expect-error Missing [] around allowed types.\n\t\t\t\ttype _check = ValidateRecursiveSchema<typeof Test>;\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tclass Test extends sf.objectRecursive(\"Test\", sf.optionalRecursive([() => Test])) {}\n\t\t\t\t// @ts-expect-error Objects take a record type with fields, not a field directly.\n\t\t\t\ttype _check = ValidateRecursiveSchema<typeof Test>;\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tclass MapRecursive extends sf.mapRecursive(\n\t\t\t\t\t\"Test\",\n\t\t\t\t\tsf.optionalRecursive([() => MapRecursive]),\n\t\t\t\t) {}\n\t\t\t\t// @ts-expect-error Maps accept allowed types, not field schema.\n\t\t\t\ttype _check = ValidateRecursiveSchema<typeof MapRecursive>;\n\t\t\t}\n\t\t});\n\t});\n\n\tdescribe(\"arrayRecursive\", () => {\n\t\tit(\"simple\", () => {\n\t\t\tclass ArrayRecursive extends sf.arrayRecursive(\"List\", [() => ArrayRecursive]) {}\n\t\t\t// Explicit constructor call\n\t\t\t{\n\t\t\t\tconst data: ArrayRecursive = hydrate(ArrayRecursive, new ArrayRecursive([]));\n\t\t\t\tassert.deepEqual([...data], []);\n\t\t\t}\n\t\t\t// Nested\n\t\t\t{\n\t\t\t\tconst data: ArrayRecursive = hydrate(\n\t\t\t\t\tArrayRecursive,\n\t\t\t\t\tnew ArrayRecursive([new ArrayRecursive([])]),\n\t\t\t\t);\n\t\t\t\tassert.equal(data.length, 1);\n\t\t\t\tassert.deepEqual([...data[0]], []);\n\n\t\t\t\ttype T = InsertableTreeNodeFromImplicitAllowedTypes<typeof ArrayRecursive>;\n\t\t\t\t// @ts-expect-error ListRecursive should not be implicitly constructable (for now).\n\t\t\t\tconst _check: T = [];\n\t\t\t\t// Only explicitly constructed recursive lists are currently allowed:\n\t\t\t\ttype _check = requireTrue<areSafelyAssignable<T, ArrayRecursive>>;\n\n\t\t\t\tdata.insertAtEnd(new ArrayRecursive([]));\n\n\t\t\t\tdata[0].insertAtEnd(new ArrayRecursive([]));\n\t\t\t}\n\t\t});\n\t});\n\n\tdescribe(\"mapRecursive\", () => {\n\t\tit(\"simple\", () => {\n\t\t\tclass MapRecursive extends sf.mapRecursive(\"Map\", [() => MapRecursive]) {}\n\t\t\tconst node = hydrate(MapRecursive, new MapRecursive([]));\n\t\t\tconst data = [...node];\n\t\t\tassert.deepEqual(data, []);\n\n\t\t\t// Nested\n\t\t\t{\n\t\t\t\ttype T = InsertableTreeNodeFromImplicitAllowedTypes<typeof MapRecursive>;\n\t\t\t\tconst _check: T = new MapRecursive([]);\n\t\t\t\t// Only explicitly constructed recursive maps are currently allowed:\n\t\t\t\ttype _check = requireTrue<areSafelyAssignable<T, MapRecursive>>;\n\t\t\t}\n\n\t\t\tnode.set(\"x\", new MapRecursive([]));\n\n\t\t\tnode.get(\"x\")?.set(\"x\", new MapRecursive(new Map()));\n\t\t});\n\t});\n\n\tit(\"recursive under non-recursive\", () => {\n\t\tclass ArrayRecursive extends sf.arrayRecursive(\"List\", [() => ArrayRecursive]) {}\n\t\tclass Root extends sf.object(\"Root\", {\n\t\t\tr: ArrayRecursive,\n\t\t}) {}\n\n\t\tconst r = hydrate(Root, { r: new ArrayRecursive([]) });\n\t\tassert.deepEqual([...r.r], []);\n\t});\n});\n"]}

package/lib/test/simple-tree/schemaTypes.spec.d.ts

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

package/lib/test/simple-tree/schemaTypes.spec.d.ts.map

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

package/lib/test/simple-tree/schemaTypes.spec.js

@@ -1,89 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { SchemaFactory } from "../../simple-tree/index.js";
-import { TreeFactory } from "../../treeFactory.js";
-const schema = new SchemaFactory("com.example");
-const factory = new TreeFactory({});
-describe("schemaTypes", () => {
-    it("TreeNode", () => {
-        // @ts-expect-error TreeNode should not allow non-node objects.
-        const n = {};
-    });
-    describe("insertable", () => {
-        it("Lists", () => {
-            const List = schema.array(schema.number);
-            const NestedList = schema.array(List);
-            const list = [5];
-            const nestedList = [[5]];
-            // Not nested
-            {
-            }
-            // Not nested
-            {
-            }
-            // Nested
-            {
-            }
-            // Regression test for InsertableTypedNode not distributing over unions correctly.
-            {
-                const x = [];
-            }
-        });
-        it("Objects", () => {
-            const A = schema.object("A", {});
-            const B = schema.object("B", { a: A });
-            const a = new A({});
-            const b = new B({ a });
-            const b2 = new B({ a: {} });
-            // @ts-expect-error empty nodes should not allow non objects.
-            const a2 = 0;
-            // @ts-expect-error empty nodes should not allow non objects.
-            const a3 = 0;
-            // @ts-expect-error empty nodes should not allow non-node.
-            const a4 = {};
-            // Insertable nodes allow non-node objects.
-            const a5 = {};
-        });
-        it("Customized Objects", () => {
-            class A extends schema.object("A", {}) {
-                constructor() {
-                    super(...arguments);
-                    this.extra = 0;
-                }
-            }
-            class B extends schema.object("B", { a: A }) {
-                constructor() {
-                    super(...arguments);
-                    this.extra = "";
-                }
-            }
-            const a = new A({});
-            const b = new B({ a });
-            const b2 = new B({ a: {} });
-        });
-        it("Mixed Regression test", () => {
-            class Note extends schema.object("Note", {}) {
-                constructor() {
-                    super(...arguments);
-                    this.isSelected = false;
-                }
-            }
-            class NodeMap extends schema.map("NoteMap", Note) {
-            }
-            class NodeList extends schema.array("NoteList", Note) {
-            }
-            class Canvas extends schema.object("Canvas", { stuff: [NodeMap, NodeList] }) {
-            }
-            const y = new NodeList([{}]);
-            // There was a bug where unions with maps lost implicit contractibility, causing this to not compile:
-            const x = new Canvas({
-                stuff: [{}],
-            });
-        });
-    });
-    it("TreeLeafValue", () => {
-    });
-});
-//# sourceMappingURL=schemaTypes.spec.js.map

package/lib/test/simple-tree/schemaTypes.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"schemaTypes.spec.js","sourceRoot":"","sources":["../../../src/test/simple-tree/schemaTypes.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAY,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAYrE,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAGnD,MAAM,MAAM,GAAG,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC;AAEhD,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;AAEpC,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;QACnB,+DAA+D;QAC/D,MAAM,CAAC,GAAa,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC3B,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE;YAChB,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACzC,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAEtC,MAAM,IAAI,GAAa,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,UAAU,GAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAErC,aAAa;YACb;aAeC;YAED,aAAa;YACb;aAcC;YAED,SAAS;YACT;aAcC;YAED,kFAAkF;YAClF;gBAEC,MAAM,CAAC,GAAM,EAAE,CAAC;aAChB;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAClB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAEvC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACvB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAE5B,6DAA6D;YAC7D,MAAM,EAAE,GAA6B,CAAC,CAAC;YACvC,6DAA6D;YAC7D,MAAM,EAAE,GAAkC,CAAC,CAAC;YAE5C,0DAA0D;YAC1D,MAAM,EAAE,GAA6B,EAAE,CAAC;YAExC,2CAA2C;YAC3C,MAAM,EAAE,GAAkC,EAAE,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,CAAE,SAAQ,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC;gBAAtC;;oBACQ,UAAK,GAAW,CAAC,CAAC;gBAC1B,CAAC;aAAA;YACD,MAAM,CAAE,SAAQ,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBAA5C;;oBACQ,UAAK,GAAW,EAAE,CAAC;gBAC3B,CAAC;aAAA;YAED,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACvB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;YAChC,MAAM,IAAK,SAAQ,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;gBAA5C;;oBACQ,eAAU,GAAY,KAAK,CAAC;gBACpC,CAAC;aAAA;YAED,MAAM,OAAQ,SAAQ,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC;aAAG;YACpD,MAAM,QAAS,SAAQ,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC;aAAG;YAExD,MAAM,MAAO,SAAQ,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;aAAG;YAE/E,MAAM,CAAC,GAAG,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAE7B,qGAAqG;YACrG,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC;gBACpB,KAAK,EAAE,CAAC,EAAE,CAAC;aACX,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;IAEzB,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 { TreeNode, SchemaFactory } from \"../../simple-tree/index.js\";\nimport {\n\tInsertableTreeFieldFromImplicitField,\n\tInsertableTypedNode,\n\tNodeBuilderData,\n\tNodeFromSchema,\n\tTreeFieldFromImplicitField,\n\tTreeLeafValue,\n\tTreeNodeFromImplicitAllowedTypes,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../simple-tree/schemaTypes.js\";\nimport { TreeValue } from \"../../core/index.js\";\nimport { TreeFactory } from \"../../treeFactory.js\";\nimport { areSafelyAssignable, requireAssignableTo, requireTrue } from \"../../util/index.js\";\n\nconst schema = new SchemaFactory(\"com.example\");\n\nconst factory = new TreeFactory({});\n\ndescribe(\"schemaTypes\", () => {\n\tit(\"TreeNode\", () => {\n\t\t// @ts-expect-error TreeNode should not allow non-node objects.\n\t\tconst n: TreeNode = {};\n\t});\n\n\tdescribe(\"insertable\", () => {\n\t\tit(\"Lists\", () => {\n\t\t\tconst List = schema.array(schema.number);\n\t\t\tconst NestedList = schema.array(List);\n\n\t\t\tconst list: number[] = [5];\n\t\t\tconst nestedList: number[][] = [[5]];\n\n\t\t\t// Not nested\n\t\t\t{\n\t\t\t\ttype I1 = InsertableTreeFieldFromImplicitField<typeof schema.number>;\n\t\t\t\ttype I2 = InsertableTypedNode<typeof schema.number>;\n\t\t\t\ttype I3 = NodeBuilderData<typeof schema.number>;\n\n\t\t\t\ttype N1 = NodeFromSchema<typeof schema.number>;\n\t\t\t\ttype N2 = TreeNodeFromImplicitAllowedTypes<typeof schema.number>;\n\t\t\t\ttype N3 = TreeFieldFromImplicitField<typeof schema.number>;\n\n\t\t\t\ttype _check1 = requireTrue<areSafelyAssignable<I1, number>>;\n\t\t\t\ttype _check2 = requireTrue<areSafelyAssignable<I2, number>>;\n\t\t\t\ttype _check3 = requireTrue<areSafelyAssignable<I3, number>>;\n\t\t\t\ttype _check4 = requireTrue<areSafelyAssignable<N1, number>>;\n\t\t\t\ttype _check5 = requireTrue<areSafelyAssignable<N2, number>>;\n\t\t\t\ttype _check6 = requireTrue<areSafelyAssignable<N3, number>>;\n\t\t\t}\n\n\t\t\t// Not nested\n\t\t\t{\n\t\t\t\ttype I1 = InsertableTreeFieldFromImplicitField<typeof List>;\n\t\t\t\ttype I2 = InsertableTypedNode<typeof List>;\n\t\t\t\ttype I3 = NodeBuilderData<typeof List>;\n\n\t\t\t\ttype N1 = NodeFromSchema<typeof List>;\n\t\t\t\ttype N2 = TreeNodeFromImplicitAllowedTypes<typeof List>;\n\t\t\t\ttype N3 = TreeFieldFromImplicitField<typeof List>;\n\n\t\t\t\ttype _check1 = requireTrue<areSafelyAssignable<I1, I2>>;\n\t\t\t\ttype _check2 = requireTrue<areSafelyAssignable<I2, N1 | Iterable<number>>>;\n\t\t\t\ttype _check3 = requireTrue<areSafelyAssignable<I3, Iterable<number>>>;\n\t\t\t\ttype _check4 = requireTrue<areSafelyAssignable<N1, N2>>;\n\t\t\t\ttype _check5 = requireTrue<areSafelyAssignable<N2, N3>>;\n\t\t\t}\n\n\t\t\t// Nested\n\t\t\t{\n\t\t\t\ttype I1 = InsertableTreeFieldFromImplicitField<typeof NestedList>;\n\t\t\t\ttype I2 = InsertableTypedNode<typeof NestedList>;\n\t\t\t\ttype I3 = NodeBuilderData<typeof NestedList>;\n\n\t\t\t\ttype N1 = NodeFromSchema<typeof NestedList>;\n\t\t\t\ttype N2 = TreeNodeFromImplicitAllowedTypes<typeof NestedList>;\n\t\t\t\ttype N3 = TreeFieldFromImplicitField<typeof NestedList>;\n\n\t\t\t\ttype _check1 = requireTrue<areSafelyAssignable<I1, I2>>;\n\t\t\t\ttype _check2 = requireTrue<areSafelyAssignable<I2, N1 | I3>>;\n\t\t\t\ttype _check3 = requireAssignableTo<Iterable<Iterable<number>>, I3>;\n\t\t\t\ttype _check4 = requireTrue<areSafelyAssignable<N1, N2>>;\n\t\t\t\ttype _check5 = requireTrue<areSafelyAssignable<N2, N3>>;\n\t\t\t}\n\n\t\t\t// Regression test for InsertableTypedNode not distributing over unions correctly.\n\t\t\t{\n\t\t\t\ttype X = InsertableTypedNode<typeof List | typeof schema.number>;\n\t\t\t\tconst x: X = [];\n\t\t\t}\n\t\t});\n\n\t\tit(\"Objects\", () => {\n\t\t\tconst A = schema.object(\"A\", {});\n\t\t\tconst B = schema.object(\"B\", { a: A });\n\n\t\t\tconst a = new A({});\n\t\t\tconst b = new B({ a });\n\t\t\tconst b2 = new B({ a: {} });\n\n\t\t\t// @ts-expect-error empty nodes should not allow non objects.\n\t\t\tconst a2: NodeFromSchema<typeof A> = 0;\n\t\t\t// @ts-expect-error empty nodes should not allow non objects.\n\t\t\tconst a3: InsertableTypedNode<typeof A> = 0;\n\n\t\t\t// @ts-expect-error empty nodes should not allow non-node.\n\t\t\tconst a4: NodeFromSchema<typeof A> = {};\n\n\t\t\t// Insertable nodes allow non-node objects.\n\t\t\tconst a5: InsertableTypedNode<typeof A> = {};\n\t\t});\n\n\t\tit(\"Customized Objects\", () => {\n\t\t\tclass A extends schema.object(\"A\", {}) {\n\t\t\t\tpublic extra: number = 0;\n\t\t\t}\n\t\t\tclass B extends schema.object(\"B\", { a: A }) {\n\t\t\t\tpublic extra: string = \"\";\n\t\t\t}\n\n\t\t\tconst a = new A({});\n\t\t\tconst b = new B({ a });\n\t\t\tconst b2 = new B({ a: {} });\n\t\t});\n\n\t\tit(\"Mixed Regression test\", () => {\n\t\t\tclass Note extends schema.object(\"Note\", {}) {\n\t\t\t\tpublic isSelected: boolean = false;\n\t\t\t}\n\n\t\t\tclass NodeMap extends schema.map(\"NoteMap\", Note) {}\n\t\t\tclass NodeList extends schema.array(\"NoteList\", Note) {}\n\n\t\t\tclass Canvas extends schema.object(\"Canvas\", { stuff: [NodeMap, NodeList] }) {}\n\n\t\t\tconst y = new NodeList([{}]);\n\n\t\t\t// There was a bug where unions with maps lost implicit contractibility, causing this to not compile:\n\t\t\tconst x = new Canvas({\n\t\t\t\tstuff: [{}],\n\t\t\t});\n\t\t});\n\t});\n\n\tit(\"TreeLeafValue\", () => {\n\t\ttype _check = requireTrue<areSafelyAssignable<TreeLeafValue, TreeValue>>;\n\t});\n});\n"]}

package/lib/test/simple-tree/toFlexSchema.spec.d.ts

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

package/lib/test/simple-tree/toFlexSchema.spec.d.ts.map

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

package/lib/test/simple-tree/toFlexSchema.spec.js

@@ -1,30 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "node:assert";
-// eslint-disable-next-line import/no-internal-modules
-import { toFlexSchema } from "../../simple-tree/toFlexSchema.js";
-import { SchemaFactory } from "../../simple-tree/index.js";
-describe("toFlexSchema", () => {
-    it("minimal", () => {
-        const schema = new SchemaFactory("com.example");
-        class A extends schema.object("A", {}) {
-        }
-        toFlexSchema(A);
-    });
-    it("name collision", () => {
-        const schema = new SchemaFactory("com.example");
-        class A extends schema.object("A", {}) {
-        }
-        class B extends schema.object("A", {}) {
-        }
-        assert.throws(() => toFlexSchema([A, B]), /identifier "com.example.A"/);
-    });
-    it("builtins are the same", () => {
-        const schema = new SchemaFactory("com.example");
-        const schema2 = new SchemaFactory("com.example");
-        assert.equal(schema.number, schema2.number);
-    });
-});
-//# sourceMappingURL=toFlexSchema.spec.js.map

package/lib/test/simple-tree/toFlexSchema.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"toFlexSchema.spec.js","sourceRoot":"","sources":["../../../src/test/simple-tree/toFlexSchema.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,aAAa,CAAC;AAE/C,sDAAsD;AACtD,OAAO,EAAE,YAAY,EAAE,MAAM,mCAAmC,CAAC;AACjE,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAE3D,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC7B,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;QAClB,MAAM,MAAM,GAAG,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC;QAChD,MAAM,CAAE,SAAQ,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC;SAAG;QACzC,YAAY,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;QACzB,MAAM,MAAM,GAAG,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC;QAChD,MAAM,CAAE,SAAQ,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC;SAAG;QACzC,MAAM,CAAE,SAAQ,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC;SAAG;QAEzC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,4BAA4B,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;QAChC,MAAM,MAAM,GAAG,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC;QACjD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7C,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 \"node:assert\";\n\n// eslint-disable-next-line import/no-internal-modules\nimport { toFlexSchema } from \"../../simple-tree/toFlexSchema.js\";\nimport { SchemaFactory } from \"../../simple-tree/index.js\";\n\ndescribe(\"toFlexSchema\", () => {\n\tit(\"minimal\", () => {\n\t\tconst schema = new SchemaFactory(\"com.example\");\n\t\tclass A extends schema.object(\"A\", {}) {}\n\t\ttoFlexSchema(A);\n\t});\n\tit(\"name collision\", () => {\n\t\tconst schema = new SchemaFactory(\"com.example\");\n\t\tclass A extends schema.object(\"A\", {}) {}\n\t\tclass B extends schema.object(\"A\", {}) {}\n\n\t\tassert.throws(() => toFlexSchema([A, B]), /identifier \"com.example.A\"/);\n\t});\n\tit(\"builtins are the same\", () => {\n\t\tconst schema = new SchemaFactory(\"com.example\");\n\t\tconst schema2 = new SchemaFactory(\"com.example\");\n\t\tassert.equal(schema.number, schema2.number);\n\t});\n});\n"]}

package/lib/test/simple-tree/toMapTree.spec.d.ts

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

package/lib/test/simple-tree/toMapTree.spec.d.ts.map

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