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

package/lib/test/feature-libraries/flex-tree/editableTreeTypes.spec.js

@@ -1,225 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { unreachableCase } from "@fluidframework/core-utils";
-import { jsonArray, jsonObject, jsonSchema, leaf, SchemaBuilder, } from "../../../domains/index.js";
-import { EmptyKey } from "../../../core/index.js";
-import { FieldKinds, Any, FlexFieldSchema, } from "../../../feature-libraries/index.js";
-describe("editableTreeTypes", () => {
-    /**
-     * Example showing narrowing and exhaustive matches.
-     */
-    function exhaustiveMatchSimple(root) {
-        const schema = SchemaBuilder.required([() => leaf.number, leaf.string]);
-        assert(root.is(schema));
-        const tree = root.boxedContent;
-        if (tree.is(leaf.number)) {
-            const n = tree.value;
-        }
-        else if (tree.is(leaf.string)) {
-            const s = tree.value;
-        }
-        else {
-            // Proves at compile time exhaustive match checking works, and tree is typed `never`.
-            unreachableCase(tree);
-        }
-    }
-    /**
-     * Example showing the node kinds used in the json domain (everything except structs),
-     * including narrowing and exhaustive matches.
-     */
-    function jsonExample(root) {
-        // Rather than using jsonSequenceRootSchema.rootFieldSchema, recreate an equivalent schema.
-        // Doing this avoids a compile error (but not an intellisense error) on unreachableCase below.
-        // This has not be fully root caused, but it likely due to to schema d.ts files for recursive types containing `any` due to:
-        // https://github.com/microsoft/TypeScript/issues/55832
-        const jsonPrimitives = [...leaf.primitives, leaf.null];
-        const jsonRoot2 = [() => jsonObject, () => jsonArray, ...jsonPrimitives];
-        const schema = SchemaBuilder.sequence(jsonRoot2);
-        assert(root.is(schema));
-        for (const tree of root.boxedIterator()) {
-            if (tree.is(leaf.boolean)) {
-                const b = tree.value;
-            }
-            else if (tree.is(leaf.number)) {
-                const n = tree.value;
-            }
-            else if (tree.is(leaf.string)) {
-                const s = tree.value;
-            }
-            else if (tree.is(jsonArray)) {
-                const a = tree.content;
-                jsonExample(a);
-            }
-            else if (tree.is(jsonObject)) {
-                const x = tree.get(EmptyKey);
-            }
-            else if (tree.is(leaf.null)) {
-                const x = tree.value;
-            }
-            else {
-                // Proves at compile time exhaustive match checking works, and tree is typed `never`.
-                unreachableCase(tree);
-            }
-        }
-    }
-    const builder = new SchemaBuilder({ scope: "test", libraries: [jsonSchema] });
-    const emptyStruct = builder.object("empty", {});
-    const basicStruct = builder.object("basicObject", { foo: builder.optional(Any) });
-    const basicFieldNode = builder.fieldNode("field", builder.optional(Any));
-    // TODO: once schema kinds are separated, test struct with EmptyKey.
-    const mixedStruct = builder.object("mixedStruct", {
-        /**
-         * Test doc comment.
-         */
-        leaf: leaf.number,
-        polymorphic: [leaf.number, leaf.string],
-        optionalLeaf: builder.optional(leaf.number),
-        optionalObject: SchemaBuilder.optional(jsonObject),
-        sequence: SchemaBuilder.sequence(leaf.number),
-    });
-    const recursiveStruct = builder.objectRecursive("recursiveStruct", {
-        /**
-         * Test Recursive Field.
-         */
-        foo: FlexFieldSchema.createUnsafe(FieldKinds.optional, [() => recursiveStruct]),
-        /**
-         * Data field.
-         */
-        x: SchemaBuilder.required(leaf.number),
-    });
-    /**
-     * All combinations of boxed and unboxed access.
-     */
-    function boxingExample(mixed) {
-        const leafNode = mixed.leaf;
-        const leafBoxed = mixed.boxedLeaf.boxedContent;
-        // Current policy is to box polymorphic values so they can be checked for type with `is`.
-        // Note that this still unboxes the value field.
-        const polymorphic = mixed.polymorphic;
-        // Fully boxed, including the value field.
-        const boxedPolymorphic = mixed.boxedPolymorphic;
-        const optionalLeaf = mixed.optionalLeaf;
-        const boxedOptionalLeaf = mixed.boxedOptionalLeaf.boxedContent;
-        const sequence = mixed.sequence;
-        const child = sequence.at(0);
-        const childBoxed = sequence.boxedAt(0);
-    }
-    function recursiveStructExample(struct) {
-        const child = struct.foo;
-        const data = struct.x + (struct.foo?.foo?.foo?.x ?? 0);
-        assert(child);
-        child.foo?.foo?.foo?.foo?.setX(5);
-        child.foo?.boxedFoo.content?.foo?.foo?.setFoo({ x: 5, foo: { x: 5, foo: undefined } });
-        struct.boxedFoo.content = undefined;
-        // Shorthand for the above.
-        struct.setFoo(undefined);
-        struct.foo = undefined;
-    }
-    function iteratorsExample(mixed) {
-        const unboxedListIteration = [...mixed.sequence];
-        const boxedListIteration = [
-            ...mixed.sequence.boxedIterator(),
-        ];
-        const optionalNumberField = SchemaBuilder.optional(leaf.number);
-        const mapSchema = undefined;
-        const mapNode = undefined;
-        const unboxedMapIteration = [...mapNode];
-        const boxedMapIteration = [
-            ...mapNode.boxedIterator(),
-        ];
-    }
-    {
-    }
-    {
-    }
-    {
-        // TODO: Fix
-        // type _4 = requireFalse<isAssignableTo<typeof jsonArray, ObjectNodeSchema>>
-    }
-    {
-    }
-    {
-    }
-    function nominalTyping() {
-        const builder2 = new SchemaBuilder({ scope: "test" });
-        const emptyStruct1 = builder2.object("empty1", {});
-        const emptyStruct2 = builder2.object("empty2", {});
-        // Schema for types which only different in name are distinguished
-        {
-        }
-        // Schema for TypedNode which only different in name are distinguished
-        {
-        }
-    }
-    {
-    }
-    // Basic unit test for TreeNode.is type narrowing.
-    function nodeIs(node) {
-        if (node.is(basicStruct)) {
-        }
-        if (node.is(basicFieldNode)) {
-        }
-    }
-    // TypedNodeUnion
-    {
-        // Any
-        {
-        }
-        // Direct
-        {
-        }
-        // Lazy
-        {
-        }
-        // Union
-        {
-        }
-        // Recursive
-        {
-        }
-        // Recursive Lazy
-        {
-        }
-        // Type-Erased
-        {
-        }
-    }
-    // UnboxNodeUnion
-    {
-        // Any
-        {
-        }
-        // Direct
-        {
-        }
-        // Lazy
-        {
-        }
-        // Union
-        {
-        }
-        // Unboxed FieldNode
-        {
-        }
-        // Recursive
-        {
-        }
-        // Recursive Lazy
-        {
-        }
-        // Type-Erased
-        {
-        }
-        // Generic
-        // eslint-disable-next-line no-inner-declarations
-        function genericTest(t) {
-        }
-    }
-    // IsArrayOfOne
-    {
-    }
-});
-//# sourceMappingURL=editableTreeTypes.spec.js.map

package/lib/test/feature-libraries/flex-tree/editableTreeTypes.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"editableTreeTypes.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/flex-tree/editableTreeTypes.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EACN,SAAS,EACT,UAAU,EAEV,UAAU,EACV,IAAI,EACJ,aAAa,GACb,MAAM,2BAA2B,CAAC;AAwBnC,OAAO,EAAE,QAAQ,EAAY,MAAM,wBAAwB,CAAC;AAC5D,OAAO,EACN,UAAU,EACV,GAAG,EAMH,eAAe,GAGf,MAAM,qCAAqC,CAAC;AAI7C,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IAClC;;OAEG;IACH,SAAS,qBAAqB,CAAC,IAAmB;QACjD,MAAM,MAAM,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACxE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC;QAC/B,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YACzB,MAAM,CAAC,GAAW,IAAI,CAAC,KAAK,CAAC;SAC7B;aAAM,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YAChC,MAAM,CAAC,GAAW,IAAI,CAAC,KAAK,CAAC;SAC7B;aAAM;YACN,qFAAqF;YACrF,eAAe,CAAC,IAAI,CAAC,CAAC;SACtB;IACF,CAAC;IAED;;;OAGG;IACH,SAAS,WAAW,CAAC,IAAmB;QACvC,2FAA2F;QAC3F,8FAA8F;QAC9F,4HAA4H;QAC5H,uDAAuD;QACvD,MAAM,cAAc,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,CAAU,CAAC;QAChE,MAAM,SAAS,GAAG,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,SAAS,EAAE,GAAG,cAAc,CAAU,CAAC;QAClF,MAAM,MAAM,GAAG,aAAa,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAEjD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE;YACxC,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;gBAC1B,MAAM,CAAC,GAAY,IAAI,CAAC,KAAK,CAAC;aAC9B;iBAAM,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;gBAChC,MAAM,CAAC,GAAW,IAAI,CAAC,KAAK,CAAC;aAC7B;iBAAM,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;gBAChC,MAAM,CAAC,GAAW,IAAI,CAAC,KAAK,CAAC;aAC7B;iBAAM,IAAI,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE;gBAC9B,MAAM,CAAC,GAA2C,IAAI,CAAC,OAAO,CAAC;gBAC/D,WAAW,CAAC,CAAC,CAAC,CAAC;aACf;iBAAM,IAAI,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE;gBAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;aAC7B;iBAAM,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBAC9B,MAAM,CAAC,GAAS,IAAI,CAAC,KAAK,CAAC;aAC3B;iBAAM;gBACN,qFAAqF;gBACrF,eAAe,CAAC,IAAI,CAAC,CAAC;aACtB;SACD;IACF,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IAC9E,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAChD,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,EAAE,GAAG,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAClF,MAAM,cAAc,GAAG,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IACzE,oEAAoE;IAEpE,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE;QACjD;;WAEG;QACH,IAAI,EAAE,IAAI,CAAC,MAAM;QACjB,WAAW,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;QACvC,YAAY,EAAE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3C,cAAc,EAAE,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC;QAClD,QAAQ,EAAE,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC;KAC7C,CAAC,CAAC;IAGH,MAAM,eAAe,GAAG,OAAO,CAAC,eAAe,CAAC,iBAAiB,EAAE;QAClE;;WAEG;QACH,GAAG,EAAE,eAAe,CAAC,YAAY,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;QAC/E;;WAEG;QACH,CAAC,EAAE,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC;KACtC,CAAC,CAAC;IAGH;;OAEG;IACH,SAAS,aAAa,CAAC,KAAY;QAClC,MAAM,QAAQ,GAAW,KAAK,CAAC,IAAI,CAAC;QACpC,MAAM,SAAS,GAA0C,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC;QAEtF,yFAAyF;QACzF,gDAAgD;QAChD,MAAM,WAAW,GAE0B,KAAK,CAAC,WAAW,CAAC;QAE7D,0CAA0C;QAC1C,MAAM,gBAAgB,GAElB,KAAK,CAAC,gBAAgB,CAAC;QAE3B,MAAM,YAAY,GAAuB,KAAK,CAAC,YAAY,CAAC;QAC5D,MAAM,iBAAiB,GACtB,KAAK,CAAC,iBAAiB,CAAC,YAAY,CAAC;QACtC,MAAM,QAAQ,GAAyD,KAAK,CAAC,QAAQ,CAAC;QAEtF,MAAM,KAAK,GAAuB,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,UAAU,GAAsD,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3F,CAAC;IAED,SAAS,sBAAsB,CAAC,MAAiB;QAChD,MAAM,KAAK,GAA0B,MAAM,CAAC,GAAG,CAAC;QAChD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,KAAK,CAAC,CAAC;QAEd,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;QAEvF,MAAM,CAAC,QAAQ,CAAC,OAAO,GAAG,SAAS,CAAC;QAEpC,2BAA2B;QAC3B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,GAAG,SAAS,CAAC;IACxB,CAAC;IAED,SAAS,gBAAgB,CAAC,KAAY;QACrC,MAAM,oBAAoB,GAAa,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC3D,MAAM,kBAAkB,GAA4C;YACnE,GAAG,KAAK,CAAC,QAAQ,CAAC,aAAa,EAAE;SACjC,CAAC;QAEF,MAAM,mBAAmB,GAAG,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChE,MAAM,SAAS,GAAG,SAGjB,CAAC;QACF,MAAM,OAAO,GAAG,SAAyD,CAAC;QAC1E,MAAM,mBAAmB,GAAyB,CAAC,GAAG,OAAO,CAAC,CAAC;QAC/D,MAAM,iBAAiB,GAAqD;YAC3E,GAAG,OAAO,CAAC,aAAa,EAAE;SAC1B,CAAC;IACH,CAAC;IAED;KAOC;IAED;KAKC;IAED;QAIC,YAAY;QACZ,6EAA6E;KAC7E;IAED;KAKC;IAED;KAKC;IAED,SAAS,aAAa;QACrB,MAAM,QAAQ,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACtD,MAAM,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACnD,MAAM,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAEnD,kEAAkE;QAClE;SAGC;QAID,sEAAsE;QACtE;SAMC;IACF,CAAC;IAKD;KAGC;IAED,kDAAkD;IAClD,SAAS,MAAM,CAAC,IAAkB;QACjC,IAAI,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,EAAE;SAEzB;QACD,IAAI,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,EAAE;SAE5B;IACF,CAAC;IAED,iBAAiB;IACjB;QACC,MAAM;QACN;SAEC;QAED,SAAS;QACT;SAGC;QACD,OAAO;QACP;SAIC;QACD,QAAQ;QACR;SAOC;QACD,YAAY;QACZ;SAIC;QACD,iBAAiB;QACjB;SAOC;QACD,cAAc;QACd;SA2BC;KACD;IAED,iBAAiB;IACjB;QACC,MAAM;QACN;SAEC;QAED,SAAS;QACT;SAGC;QACD,OAAO;QACP;SAIC;QACD,QAAQ;QACR;SAOC;QACD,oBAAoB;QACpB;SAMC;QACD,YAAY;QACZ;SAIC;QACD,iBAAiB;QACjB;SAOC;QACD,cAAc;QACd;SAgCC;QAED,UAAU;QACV,iDAAiD;QACjD,SAAS,WAAW,CAA6B,CAAI;QAIrD,CAAC;KACD;IAED,eAAe;IACf;KAKC;AACF,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { unreachableCase } from \"@fluidframework/core-utils\";\nimport {\n\tjsonArray,\n\tjsonObject,\n\tjsonRoot,\n\tjsonSchema,\n\tleaf,\n\tSchemaBuilder,\n} from \"../../../domains/index.js\";\n\nimport {\n\tFlexTreeSequenceField,\n\tFlexTreeTypedNode,\n\tFlexTreeField,\n\tFlexTreeRequiredField,\n\tFlexTreeNode,\n\tFlexTreeTypedNodeUnion,\n\tFlexTreeUnboxNodeUnion,\n\tFlexTreeMapNode,\n\tFlexTreeTypedField,\n\tFlexTreeObjectNode,\n\tIsArrayOfOne,\n\tFlexTreeUnknownUnboxed,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/flex-tree/flexTreeTypes.js\";\nimport {\n\tareSafelyAssignable,\n\tisAssignableTo,\n\trequireAssignableTo,\n\trequireFalse,\n\trequireTrue,\n} from \"../../../util/index.js\";\nimport { EmptyKey, FieldKey } from \"../../../core/index.js\";\nimport {\n\tFieldKinds,\n\tAny,\n\tFlexFieldNodeSchema,\n\tLeafNodeSchema,\n\tFlexMapNodeSchema,\n\tFlexObjectNodeSchema,\n\tFlexTreeNodeSchema,\n\tFlexFieldSchema,\n\tFlexAllowedTypes,\n\tArrayToUnion,\n} from \"../../../feature-libraries/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { ConstantFlexListToNonLazyArray } from \"../../../feature-libraries/typed-schema/flexList.js\";\n\ndescribe(\"editableTreeTypes\", () => {\n\t/**\n\t * Example showing narrowing and exhaustive matches.\n\t */\n\tfunction exhaustiveMatchSimple(root: FlexTreeField): void {\n\t\tconst schema = SchemaBuilder.required([() => leaf.number, leaf.string]);\n\t\tassert(root.is(schema));\n\t\tconst tree = root.boxedContent;\n\t\tif (tree.is(leaf.number)) {\n\t\t\tconst n: number = tree.value;\n\t\t} else if (tree.is(leaf.string)) {\n\t\t\tconst s: string = tree.value;\n\t\t} else {\n\t\t\t// Proves at compile time exhaustive match checking works, and tree is typed `never`.\n\t\t\tunreachableCase(tree);\n\t\t}\n\t}\n\n\t/**\n\t * Example showing the node kinds used in the json domain (everything except structs),\n\t * including narrowing and exhaustive matches.\n\t */\n\tfunction jsonExample(root: FlexTreeField): void {\n\t\t// Rather than using jsonSequenceRootSchema.rootFieldSchema, recreate an equivalent schema.\n\t\t// Doing this avoids a compile error (but not an intellisense error) on unreachableCase below.\n\t\t// This has not be fully root caused, but it likely due to to schema d.ts files for recursive types containing `any` due to:\n\t\t// https://github.com/microsoft/TypeScript/issues/55832\n\t\tconst jsonPrimitives = [...leaf.primitives, leaf.null] as const;\n\t\tconst jsonRoot2 = [() => jsonObject, () => jsonArray, ...jsonPrimitives] as const;\n\t\tconst schema = SchemaBuilder.sequence(jsonRoot2);\n\n\t\tassert(root.is(schema));\n\t\tfor (const tree of root.boxedIterator()) {\n\t\t\tif (tree.is(leaf.boolean)) {\n\t\t\t\tconst b: boolean = tree.value;\n\t\t\t} else if (tree.is(leaf.number)) {\n\t\t\t\tconst n: number = tree.value;\n\t\t\t} else if (tree.is(leaf.string)) {\n\t\t\t\tconst s: string = tree.value;\n\t\t\t} else if (tree.is(jsonArray)) {\n\t\t\t\tconst a: FlexTreeSequenceField<typeof jsonRoot> = tree.content;\n\t\t\t\tjsonExample(a);\n\t\t\t} else if (tree.is(jsonObject)) {\n\t\t\t\tconst x = tree.get(EmptyKey);\n\t\t\t} else if (tree.is(leaf.null)) {\n\t\t\t\tconst x: null = tree.value;\n\t\t\t} else {\n\t\t\t\t// Proves at compile time exhaustive match checking works, and tree is typed `never`.\n\t\t\t\tunreachableCase(tree);\n\t\t\t}\n\t\t}\n\t}\n\n\tconst builder = new SchemaBuilder({ scope: \"test\", libraries: [jsonSchema] });\n\tconst emptyStruct = builder.object(\"empty\", {});\n\tconst basicStruct = builder.object(\"basicObject\", { foo: builder.optional(Any) });\n\tconst basicFieldNode = builder.fieldNode(\"field\", builder.optional(Any));\n\t// TODO: once schema kinds are separated, test struct with EmptyKey.\n\n\tconst mixedStruct = builder.object(\"mixedStruct\", {\n\t\t/**\n\t\t * Test doc comment.\n\t\t */\n\t\tleaf: leaf.number,\n\t\tpolymorphic: [leaf.number, leaf.string],\n\t\toptionalLeaf: builder.optional(leaf.number),\n\t\toptionalObject: SchemaBuilder.optional(jsonObject),\n\t\tsequence: SchemaBuilder.sequence(leaf.number),\n\t});\n\ttype Mixed = FlexTreeTypedNode<typeof mixedStruct>;\n\n\tconst recursiveStruct = builder.objectRecursive(\"recursiveStruct\", {\n\t\t/**\n\t\t * Test Recursive Field.\n\t\t */\n\t\tfoo: FlexFieldSchema.createUnsafe(FieldKinds.optional, [() => recursiveStruct]),\n\t\t/**\n\t\t * Data field.\n\t\t */\n\t\tx: SchemaBuilder.required(leaf.number),\n\t});\n\ttype Recursive = FlexTreeTypedNode<typeof recursiveStruct>;\n\n\t/**\n\t * All combinations of boxed and unboxed access.\n\t */\n\tfunction boxingExample(mixed: Mixed): void {\n\t\tconst leafNode: number = mixed.leaf;\n\t\tconst leafBoxed: FlexTreeTypedNode<typeof leaf.number> = mixed.boxedLeaf.boxedContent;\n\n\t\t// Current policy is to box polymorphic values so they can be checked for type with `is`.\n\t\t// Note that this still unboxes the value field.\n\t\tconst polymorphic:\n\t\t\t| FlexTreeTypedNode<typeof leaf.number>\n\t\t\t| FlexTreeTypedNode<typeof leaf.string> = mixed.polymorphic;\n\n\t\t// Fully boxed, including the value field.\n\t\tconst boxedPolymorphic: FlexTreeRequiredField<\n\t\t\treadonly [typeof leaf.number, typeof leaf.string]\n\t\t> = mixed.boxedPolymorphic;\n\n\t\tconst optionalLeaf: number | undefined = mixed.optionalLeaf;\n\t\tconst boxedOptionalLeaf: FlexTreeTypedNode<typeof leaf.number> | undefined =\n\t\t\tmixed.boxedOptionalLeaf.boxedContent;\n\t\tconst sequence: FlexTreeSequenceField<readonly [typeof leaf.number]> = mixed.sequence;\n\n\t\tconst child: number | undefined = sequence.at(0);\n\t\tconst childBoxed: FlexTreeTypedNode<typeof leaf.number> | undefined = sequence.boxedAt(0);\n\t}\n\n\tfunction recursiveStructExample(struct: Recursive): void {\n\t\tconst child: Recursive | undefined = struct.foo;\n\t\tconst data = struct.x + (struct.foo?.foo?.foo?.x ?? 0);\n\t\tassert(child);\n\n\t\tchild.foo?.foo?.foo?.foo?.setX(5);\n\t\tchild.foo?.boxedFoo.content?.foo?.foo?.setFoo({ x: 5, foo: { x: 5, foo: undefined } });\n\n\t\tstruct.boxedFoo.content = undefined;\n\n\t\t// Shorthand for the above.\n\t\tstruct.setFoo(undefined);\n\t\tstruct.foo = undefined;\n\t}\n\n\tfunction iteratorsExample(mixed: Mixed): void {\n\t\tconst unboxedListIteration: number[] = [...mixed.sequence];\n\t\tconst boxedListIteration: FlexTreeTypedNode<typeof leaf.number>[] = [\n\t\t\t...mixed.sequence.boxedIterator(),\n\t\t];\n\n\t\tconst optionalNumberField = SchemaBuilder.optional(leaf.number);\n\t\tconst mapSchema = undefined as unknown as FlexMapNodeSchema<\n\t\t\t\"MapIteration\",\n\t\t\ttypeof optionalNumberField\n\t\t>;\n\t\tconst mapNode = undefined as unknown as FlexTreeMapNode<typeof mapSchema>;\n\t\tconst unboxedMapIteration: [FieldKey, number][] = [...mapNode];\n\t\tconst boxedMapIteration: FlexTreeTypedField<typeof optionalNumberField>[] = [\n\t\t\t...mapNode.boxedIterator(),\n\t\t];\n\t}\n\n\t{\n\t\ttype _1 = requireAssignableTo<typeof leaf.boolean, LeafNodeSchema>;\n\t\ttype _2a = requireAssignableTo<typeof basicFieldNode, FlexFieldNodeSchema>;\n\t\ttype _2 = requireAssignableTo<typeof jsonArray, FlexFieldNodeSchema>;\n\t\ttype _3 = requireAssignableTo<typeof jsonObject, FlexMapNodeSchema>;\n\t\ttype _4 = requireAssignableTo<typeof emptyStruct, FlexObjectNodeSchema>;\n\t\ttype _5 = requireAssignableTo<typeof basicStruct, FlexObjectNodeSchema>;\n\t}\n\n\t{\n\t\ttype _1 = requireTrue<isAssignableTo<typeof leaf.boolean, LeafNodeSchema>>;\n\t\ttype _2 = requireFalse<isAssignableTo<typeof leaf.boolean, FlexFieldNodeSchema>>;\n\t\ttype _3 = requireFalse<isAssignableTo<typeof leaf.boolean, FlexMapNodeSchema>>;\n\t\ttype _4 = requireFalse<isAssignableTo<typeof leaf.boolean, FlexObjectNodeSchema>>;\n\t}\n\n\t{\n\t\ttype _1 = requireFalse<isAssignableTo<typeof jsonArray, LeafNodeSchema>>;\n\t\ttype _2 = requireTrue<isAssignableTo<typeof jsonArray, FlexFieldNodeSchema>>;\n\t\ttype _3 = requireFalse<isAssignableTo<typeof jsonArray, FlexMapNodeSchema>>;\n\t\t// TODO: Fix\n\t\t// type _4 = requireFalse<isAssignableTo<typeof jsonArray, ObjectNodeSchema>>\n\t}\n\n\t{\n\t\ttype _1 = requireFalse<isAssignableTo<typeof jsonObject, LeafNodeSchema>>;\n\t\ttype _2 = requireFalse<isAssignableTo<typeof jsonObject, FlexFieldNodeSchema>>;\n\t\ttype _3 = requireTrue<isAssignableTo<typeof jsonObject, FlexMapNodeSchema>>;\n\t\ttype _4 = requireFalse<isAssignableTo<typeof jsonObject, FlexObjectNodeSchema>>;\n\t}\n\n\t{\n\t\ttype _1 = requireFalse<isAssignableTo<typeof basicStruct, LeafNodeSchema>>;\n\t\ttype _2 = requireFalse<isAssignableTo<typeof basicStruct, FlexFieldNodeSchema>>;\n\t\ttype _3 = requireFalse<isAssignableTo<typeof basicStruct, FlexMapNodeSchema>>;\n\t\ttype _4 = requireTrue<isAssignableTo<typeof basicStruct, FlexObjectNodeSchema>>;\n\t}\n\n\tfunction nominalTyping(): void {\n\t\tconst builder2 = new SchemaBuilder({ scope: \"test\" });\n\t\tconst emptyStruct1 = builder2.object(\"empty1\", {});\n\t\tconst emptyStruct2 = builder2.object(\"empty2\", {});\n\n\t\t// Schema for types which only different in name are distinguished\n\t\t{\n\t\t\ttype _1 = requireFalse<isAssignableTo<typeof emptyStruct1, typeof emptyStruct2>>;\n\t\t\ttype _2 = requireFalse<isAssignableTo<typeof emptyStruct2, typeof emptyStruct1>>;\n\t\t}\n\t\ttype Empty1 = FlexTreeTypedNode<typeof emptyStruct1>;\n\t\ttype Empty2 = FlexTreeTypedNode<typeof emptyStruct2>;\n\n\t\t// Schema for TypedNode which only different in name are distinguished\n\t\t{\n\t\t\t// TODO: Fix this. Might be fixed when moving to class based schema builder. Otherwise add strongly typed named to nodes.\n\t\t\t// @ts-expect-error TODO: fix this and remove expected error.\n\t\t\ttype _1 = requireFalse<isAssignableTo<Empty1, Empty2>>;\n\t\t\t// @ts-expect-error TODO: fix this and remove expected error.\n\t\t\ttype _2 = requireFalse<isAssignableTo<Empty2, Empty1>>;\n\t\t}\n\t}\n\n\t// Two different simple node types to compare and test with.\n\ttype BasicStruct = FlexTreeTypedNode<typeof basicStruct>;\n\ttype BasicFieldNode = FlexTreeTypedNode<typeof basicFieldNode>;\n\t{\n\t\ttype _1 = requireFalse<isAssignableTo<BasicStruct, BasicFieldNode>>;\n\t\ttype _2 = requireFalse<isAssignableTo<BasicFieldNode, BasicStruct>>;\n\t}\n\n\t// Basic unit test for TreeNode.is type narrowing.\n\tfunction nodeIs(node: FlexTreeNode): void {\n\t\tif (node.is(basicStruct)) {\n\t\t\ttype _1 = requireAssignableTo<typeof node, BasicStruct>;\n\t\t}\n\t\tif (node.is(basicFieldNode)) {\n\t\t\ttype _1 = requireAssignableTo<typeof node, BasicFieldNode>;\n\t\t}\n\t}\n\n\t// TypedNodeUnion\n\t{\n\t\t// Any\n\t\t{\n\t\t\ttype _1 = requireTrue<areSafelyAssignable<FlexTreeTypedNodeUnion<[Any]>, FlexTreeNode>>;\n\t\t}\n\n\t\t// Direct\n\t\t{\n\t\t\ttype UnionBasic1 = FlexTreeTypedNodeUnion<[typeof basicStruct]>;\n\t\t\ttype _1 = requireTrue<areSafelyAssignable<UnionBasic1, BasicStruct>>;\n\t\t}\n\t\t// Lazy\n\t\t{\n\t\t\ttype _1 = requireTrue<\n\t\t\t\tareSafelyAssignable<FlexTreeTypedNodeUnion<[() => typeof basicStruct]>, BasicStruct>\n\t\t\t>;\n\t\t}\n\t\t// Union\n\t\t{\n\t\t\ttype _1 = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tFlexTreeTypedNodeUnion<[typeof basicStruct, typeof basicFieldNode]>,\n\t\t\t\t\tBasicStruct | BasicFieldNode\n\t\t\t\t>\n\t\t\t>;\n\t\t}\n\t\t// Recursive\n\t\t{\n\t\t\ttype _1 = requireTrue<\n\t\t\t\tareSafelyAssignable<FlexTreeTypedNodeUnion<[typeof recursiveStruct]>, Recursive>\n\t\t\t>;\n\t\t}\n\t\t// Recursive Lazy\n\t\t{\n\t\t\ttype _1 = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tFlexTreeTypedNodeUnion<[() => typeof recursiveStruct]>,\n\t\t\t\t\tRecursive\n\t\t\t\t>\n\t\t\t>;\n\t\t}\n\t\t// Type-Erased\n\t\t{\n\t\t\ttype _1 = requireTrue<\n\t\t\t\tareSafelyAssignable<FlexTreeTypedNodeUnion<[FlexTreeNodeSchema]>, FlexTreeNode>\n\t\t\t>;\n\t\t\ttype _2 = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tFlexTreeTypedNodeUnion<[FlexObjectNodeSchema]>,\n\t\t\t\t\tFlexTreeObjectNode\n\t\t\t\t>\n\t\t\t>;\n\t\t\ttype _3 = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tFlexTreeTypedNodeUnion<[FlexTreeNodeSchema, FlexTreeNodeSchema]>,\n\t\t\t\t\tFlexTreeNode\n\t\t\t\t>\n\t\t\t>;\n\t\t\ttype _4 = requireTrue<areSafelyAssignable<FlexTreeTypedNodeUnion<[Any]>, FlexTreeNode>>;\n\t\t\ttype y = ConstantFlexListToNonLazyArray<FlexTreeNodeSchema[]>;\n\n\t\t\ttype _5 = requireTrue<\n\t\t\t\tareSafelyAssignable<FlexTreeTypedNodeUnion<FlexTreeNodeSchema[]>, FlexTreeNode>\n\t\t\t>;\n\t\t\ttype _6 = requireTrue<\n\t\t\t\tareSafelyAssignable<FlexTreeTypedNodeUnion<FlexAllowedTypes>, FlexTreeNode>\n\t\t\t>;\n\n\t\t\ttype z = ArrayToUnion<[FlexTreeNode]>;\n\t\t}\n\t}\n\n\t// UnboxNodeUnion\n\t{\n\t\t// Any\n\t\t{\n\t\t\ttype _1 = requireTrue<areSafelyAssignable<FlexTreeUnboxNodeUnion<[Any]>, FlexTreeNode>>;\n\t\t}\n\n\t\t// Direct\n\t\t{\n\t\t\ttype UnionBasic1 = FlexTreeUnboxNodeUnion<[typeof basicStruct]>;\n\t\t\ttype _1 = requireTrue<areSafelyAssignable<UnionBasic1, BasicStruct>>;\n\t\t}\n\t\t// Lazy\n\t\t{\n\t\t\ttype _1 = requireTrue<\n\t\t\t\tareSafelyAssignable<FlexTreeUnboxNodeUnion<[() => typeof basicStruct]>, BasicStruct>\n\t\t\t>;\n\t\t}\n\t\t// Union\n\t\t{\n\t\t\ttype _1 = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tFlexTreeUnboxNodeUnion<[typeof basicStruct, typeof basicFieldNode]>,\n\t\t\t\t\tBasicStruct | BasicFieldNode\n\t\t\t\t>\n\t\t\t>;\n\t\t}\n\t\t// Unboxed FieldNode\n\t\t{\n\t\t\ttype UnboxedFieldNode = FlexTreeUnboxNodeUnion<[typeof basicFieldNode]>;\n\t\t\ttype _1 = requireTrue<\n\t\t\t\tareSafelyAssignable<FlexTreeTypedNode<typeof basicFieldNode>, UnboxedFieldNode>\n\t\t\t>;\n\t\t\ttype _2 = requireAssignableTo<UnboxedFieldNode, FlexTreeNode>;\n\t\t}\n\t\t// Recursive\n\t\t{\n\t\t\ttype _1 = requireTrue<\n\t\t\t\tareSafelyAssignable<FlexTreeUnboxNodeUnion<[typeof recursiveStruct]>, Recursive>\n\t\t\t>;\n\t\t}\n\t\t// Recursive Lazy\n\t\t{\n\t\t\ttype _1 = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tFlexTreeUnboxNodeUnion<[() => typeof recursiveStruct]>,\n\t\t\t\t\tRecursive\n\t\t\t\t>\n\t\t\t>;\n\t\t}\n\t\t// Type-Erased\n\t\t{\n\t\t\ttype _1 = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tFlexTreeUnboxNodeUnion<[FlexTreeNodeSchema]>,\n\t\t\t\t\tFlexTreeUnknownUnboxed\n\t\t\t\t>\n\t\t\t>;\n\t\t\ttype _2 = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tFlexTreeUnboxNodeUnion<[FlexObjectNodeSchema]>,\n\t\t\t\t\tFlexTreeObjectNode\n\t\t\t\t>\n\t\t\t>;\n\t\t\ttype _3 = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tFlexTreeUnboxNodeUnion<[FlexTreeNodeSchema, FlexTreeNodeSchema]>,\n\t\t\t\t\tFlexTreeNode\n\t\t\t\t>\n\t\t\t>;\n\t\t\ttype _4 = requireTrue<areSafelyAssignable<FlexTreeUnboxNodeUnion<[Any]>, FlexTreeNode>>;\n\t\t\ttype _5 = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tFlexTreeUnboxNodeUnion<FlexTreeNodeSchema[]>,\n\t\t\t\t\tFlexTreeUnknownUnboxed\n\t\t\t\t>\n\t\t\t>;\n\t\t\ttype _6 = requireTrue<\n\t\t\t\tareSafelyAssignable<\n\t\t\t\t\tFlexTreeUnboxNodeUnion<FlexAllowedTypes>,\n\t\t\t\t\tFlexTreeUnknownUnboxed\n\t\t\t\t>\n\t\t\t>;\n\t\t}\n\n\t\t// Generic\n\t\t// eslint-disable-next-line no-inner-declarations\n\t\tfunction genericTest<T extends FlexAllowedTypes>(t: T) {\n\t\t\ttype Unboxed = FlexTreeUnboxNodeUnion<T>;\n\t\t\t// @ts-expect-error union can unbox to undefined or a sequence\n\t\t\ttype _1 = requireAssignableTo<Unboxed, FlexTreeNode>;\n\t\t}\n\t}\n\n\t// IsArrayOfOne\n\t{\n\t\ttype _1 = requireFalse<IsArrayOfOne<[FlexTreeNodeSchema, FlexTreeNodeSchema]>>;\n\t\ttype _2 = requireFalse<IsArrayOfOne<[]>>;\n\t\ttype _3 = requireTrue<areSafelyAssignable<IsArrayOfOne<FlexAllowedTypes>, boolean>>;\n\t\ttype _4 = requireTrue<IsArrayOfOne<[Any]>>;\n\t}\n});\n"]}

package/lib/test/feature-libraries/flex-tree/events.spec.d.ts

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

package/lib/test/feature-libraries/flex-tree/events.spec.d.ts.map

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