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

package/lib/test/testTrees.js

@@ -1,175 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { MockHandle } from "@fluidframework/test-runtime-utils";
-import { Any, FieldKinds, FlexFieldSchema, Multiplicity, cursorsForTypedFieldData, defaultSchemaPolicy, jsonableTreeFromFieldCursor, cursorForJsonableTreeNode, typeNameSymbol, valueSymbol, intoStoredSchemaCollection, SchemaBuilderBase, } from "../feature-libraries/index.js";
-import { leaf } from "../domains/index.js";
-function testTree(name, schemaData, rootNode, data) {
-    const fieldSchema = FlexFieldSchema.create(FieldKinds.required, [rootNode]);
-    return testField(name, schemaData, fieldSchema, data);
-}
-function testField(name, schemaLibrary, rootField, data) {
-    const schema = new SchemaBuilderBase(FieldKinds.required, {
-        scope: name,
-        lint: { rejectForbidden: false, rejectEmpty: false },
-        libraries: [schemaLibrary],
-    }).intoSchema(rootField);
-    return {
-        name,
-        schemaData: schema,
-        treeFactory: () => {
-            const cursor = cursorsForTypedFieldData({ schema }, schema.rootFieldSchema, data);
-            return jsonableTreeFromFieldCursor(cursor);
-        },
-        policy: defaultSchemaPolicy,
-    };
-}
-function cursorsToFieldContent(cursors, schema) {
-    if (schema.kind.multiplicity === Multiplicity.Sequence) {
-        return cursors;
-    }
-    if (cursors.length === 1) {
-        return cursors[0];
-    }
-    assert(cursors.length === 0);
-    return undefined;
-}
-export function treeContentFromTestTree(test) {
-    return {
-        schema: test.schemaData,
-        initialTree: cursorsToFieldContent(test.treeFactory().map(cursorForJsonableTreeNode), test.schemaData.rootFieldSchema),
-    };
-}
-const builder = new SchemaBuilderBase(FieldKinds.required, {
-    scope: "test",
-    libraries: [leaf.library],
-});
-export const minimal = builder.object("minimal", {});
-export const hasMinimalValueField = builder.object("hasMinimalValueField", {
-    field: minimal,
-});
-export const hasNumericValueField = builder.object("hasNumericValueField", {
-    field: leaf.number,
-});
-export const hasPolymorphicValueField = builder.object("hasPolymorphicValueField", {
-    field: [leaf.number, minimal],
-});
-export const hasAnyValueField = builder.object("hasAnyValueField", {
-    field: Any,
-});
-export const hasOptionalField = builder.object("hasOptionalField", {
-    field: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),
-});
-export const allTheFields = builder.object("allTheFields", {
-    optional: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),
-    valueField: leaf.number,
-    sequence: FlexFieldSchema.create(FieldKinds.sequence, [leaf.number]),
-});
-export const anyFields = builder.object("anyFields", {
-    optional: FlexFieldSchema.create(FieldKinds.optional, [Any]),
-    valueField: Any,
-    sequence: FlexFieldSchema.create(FieldKinds.sequence, [Any]),
-});
-export const escapedFieldProperties = builder.object("escapedFieldProperties", {
-    value: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),
-    set: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),
-    setValue: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),
-    field: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),
-});
-export const numericMap = builder.map("numericMap", FlexFieldSchema.create(FieldKinds.optional, [leaf.number]));
-export const anyMap = builder.map("anyMap", FlexFieldSchema.create(FieldKinds.sequence, [Any]));
-export const recursiveType = builder.objectRecursive("recursiveType", {
-    field: FlexFieldSchema.createUnsafe(FieldKinds.optional, [() => recursiveType]),
-});
-export const library = builder.intoLibrary();
-export const storedLibrary = intoStoredSchemaCollection(library);
-export const testTrees = [
-    testField("empty", library, FlexFieldSchema.create(FieldKinds.optional, []), undefined),
-    testTree("null", library, leaf.null, null),
-    testTree("minimal", library, minimal, {}),
-    testTree("numeric", library, leaf.number, 5),
-    testTree("handle", library, leaf.handle, new MockHandle(5)),
-    testField("numericSequence", library, FlexFieldSchema.create(FieldKinds.sequence, [leaf.number]), [1, 2, 3]),
-    testTree("true boolean", library, leaf.boolean, true),
-    testTree("false boolean", library, leaf.boolean, false),
-    testTree("hasMinimalValueField", library, hasMinimalValueField, {
-        field: {},
-    }),
-    testTree("hasNumericValueField", library, hasNumericValueField, {
-        field: 5,
-    }),
-    testTree("hasPolymorphicValueField", library, hasPolymorphicValueField, {
-        field: 5,
-    }),
-    testTree("hasAnyValueField", library, hasAnyValueField, {
-        field: {
-            [typeNameSymbol]: leaf.number.name,
-            [valueSymbol]: 5,
-        },
-    }),
-    testTree("hasAnyValueFieldRecursive", library, hasAnyValueField, {
-        field: {
-            [typeNameSymbol]: hasAnyValueField.name,
-            field: {
-                [typeNameSymbol]: leaf.number.name,
-                [valueSymbol]: 5,
-            },
-        },
-    }),
-    testTree("hasOptionalField-empty", library, hasOptionalField, { field: undefined }),
-    testTree("allTheFields-minimal", library, allTheFields, {
-        valueField: 5,
-        optional: undefined,
-        sequence: [],
-    }),
-    testTree("allTheFields-full", library, allTheFields, {
-        valueField: 5,
-        optional: 5,
-        sequence: [5],
-    }),
-    testTree("anyFields-minimal", library, anyFields, {
-        valueField: { [typeNameSymbol]: leaf.number.name, [valueSymbol]: 5 },
-        optional: undefined,
-        sequence: [],
-    }),
-    testTree("anyFields-full", library, anyFields, {
-        valueField: { [typeNameSymbol]: leaf.number.name, [valueSymbol]: 5 },
-        optional: { [typeNameSymbol]: leaf.number.name, [valueSymbol]: 5 },
-        sequence: [
-            { [typeNameSymbol]: leaf.number.name, [valueSymbol]: 5 },
-            { [typeNameSymbol]: minimal.name },
-        ],
-    }),
-    testTree("escapedFields", library, escapedFieldProperties, {
-        value: 5,
-        set: 6,
-        setValue: 7,
-        field: 8,
-    }),
-    testTree("numericMap-empty", library, numericMap, {}),
-    testTree("anyMap-empty", library, anyMap, {}),
-    testTree("numericMap-full", library, numericMap, {
-        a: 5,
-        b: 6,
-        // TODO: SchemaAware API for map nodes, and remove this cast
-    }),
-    testTree("anyMap-full", library, anyMap, {
-        a: [
-            { [typeNameSymbol]: leaf.number.name, [valueSymbol]: 1 },
-            { [typeNameSymbol]: leaf.number.name, [valueSymbol]: 2 },
-        ],
-        b: [{ [typeNameSymbol]: leaf.number.name, [valueSymbol]: 3 }],
-        // TODO: SchemaAware API for map nodes, and remove this cast
-    }),
-    testTree("recursiveType-empty", library, recursiveType, { field: undefined }),
-    testTree("recursiveType-recursive", library, recursiveType, { field: { field: undefined } }),
-    testTree("recursiveType-deeper", library, recursiveType, {
-        field: { field: { field: { field: undefined } } },
-    }),
-];
-// TODO: integrate data sources for wide and deep trees from ops size testing and large data generators for cursor performance testing.
-// TODO: whiteboard like data with near term and eventual schema approaches
-// TODO: randomized schema generator
-//# sourceMappingURL=testTrees.js.map

package/lib/test/testTrees.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"testTrees.js","sourceRoot":"","sources":["../../src/test/testTrees.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EAAE,UAAU,EAAE,MAAM,oCAAoC,CAAC;AAEhE,OAAO,EACN,GAAG,EACH,UAAU,EACV,eAAe,EAEf,YAAY,EAIZ,wBAAwB,EACxB,mBAAmB,EACnB,2BAA2B,EAC3B,yBAAyB,EACzB,cAAc,EACd,WAAW,EAGX,0BAA0B,EAC1B,iBAAiB,GACjB,MAAM,+BAA+B,CAAC;AAEvC,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAS3C,SAAS,QAAQ,CAChB,IAAY,EACZ,UAAyB,EACzB,QAAW,EACX,IAA2C;IAE3C,MAAM,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC5E,OAAO,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;AACvD,CAAC;AAED,SAAS,SAAS,CACjB,IAAY,EACZ,aAA4B,EAC5B,SAAY,EACZ,IAA4B;IAE5B,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,UAAU,CAAC,QAAQ,EAAE;QACzD,KAAK,EAAE,IAAI;QACX,IAAI,EAAE,EAAE,eAAe,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE;QACpD,SAAS,EAAE,CAAC,aAAa,CAAC;KAC1B,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;IACzB,OAAO;QACN,IAAI;QACJ,UAAU,EAAE,MAAM;QAClB,WAAW,EAAE,GAAG,EAAE;YACjB,MAAM,MAAM,GAAG,wBAAwB,CAAC,EAAE,MAAM,EAAE,EAAE,MAAM,CAAC,eAAe,EAAE,IAAI,CAAC,CAAC;YAClF,OAAO,2BAA2B,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;QACD,MAAM,EAAE,mBAAmB;KAC3B,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAC7B,OAA0C,EAC1C,MAAuB;IAEvB,IAAI,MAAM,CAAC,IAAI,CAAC,YAAY,KAAK,YAAY,CAAC,QAAQ,EAAE;QACvD,OAAO,OAAO,CAAC;KACf;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;QACzB,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;KAClB;IACD,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;IAC7B,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,IAAc;IACrD,OAAO;QACN,MAAM,EAAE,IAAI,CAAC,UAAU;QACvB,WAAW,EAAE,qBAAqB,CACjC,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,yBAAyB,CAAC,EACjD,IAAI,CAAC,UAAU,CAAC,eAAe,CAC/B;KACD,CAAC;AACH,CAAC;AAED,MAAM,OAAO,GAAG,IAAI,iBAAiB,CAAC,UAAU,CAAC,QAAQ,EAAE;IAC1D,KAAK,EAAE,MAAM;IACb,SAAS,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC;CACzB,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;AACrD,MAAM,CAAC,MAAM,oBAAoB,GAAG,OAAO,CAAC,MAAM,CAAC,sBAAsB,EAAE;IAC1E,KAAK,EAAE,OAAO;CACd,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,OAAO,CAAC,MAAM,CAAC,sBAAsB,EAAE;IAC1E,KAAK,EAAE,IAAI,CAAC,MAAM;CAClB,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,OAAO,CAAC,MAAM,CAAC,0BAA0B,EAAE;IAClF,KAAK,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC;CAC7B,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,OAAO,CAAC,MAAM,CAAC,kBAAkB,EAAE;IAClE,KAAK,EAAE,GAAG;CACV,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,OAAO,CAAC,MAAM,CAAC,kBAAkB,EAAE;IAClE,KAAK,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACjE,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE;IAC1D,QAAQ,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpE,UAAU,EAAE,IAAI,CAAC,MAAM;IACvB,QAAQ,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACpE,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE;IACpD,QAAQ,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;IAC5D,UAAU,EAAE,GAAG;IACf,QAAQ,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC5D,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,OAAO,CAAC,MAAM,CAAC,wBAAwB,EAAE;IAC9E,KAAK,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjE,GAAG,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/D,QAAQ,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpE,KAAK,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACjE,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CACpC,YAAY,EACZ,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAC1D,CAAC;AAIF,MAAM,CAAC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAEhG,MAAM,CAAC,MAAM,aAAa,GAAG,OAAO,CAAC,eAAe,CAAC,eAAe,EAAE;IACrE,KAAK,EAAE,eAAe,CAAC,YAAY,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;CAC/E,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,OAAO,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;AAC7C,MAAM,CAAC,MAAM,aAAa,GAAG,0BAA0B,CAAC,OAAO,CAAC,CAAC;AAEjE,MAAM,CAAC,MAAM,SAAS,GAAwB;IAC7C,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC;IACvF,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;IAC1C,QAAQ,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC;IACzC,QAAQ,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,QAAQ,CAAC,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC3D,SAAS,CACR,iBAAiB,EACjB,OAAO,EACP,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAC1D,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CACT;IACD,QAAQ,CAAC,cAAc,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC;IACrD,QAAQ,CAAC,eAAe,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC;IACvD,QAAQ,CAAC,sBAAsB,EAAE,OAAO,EAAE,oBAAoB,EAAE;QAC/D,KAAK,EAAE,EAAE;KACT,CAAC;IACF,QAAQ,CAAC,sBAAsB,EAAE,OAAO,EAAE,oBAAoB,EAAE;QAC/D,KAAK,EAAE,CAAC;KACR,CAAC;IACF,QAAQ,CAAC,0BAA0B,EAAE,OAAO,EAAE,wBAAwB,EAAE;QACvE,KAAK,EAAE,CAAC;KACR,CAAC;IACF,QAAQ,CAAC,kBAAkB,EAAE,OAAO,EAAE,gBAAgB,EAAE;QACvD,KAAK,EAAE;YACN,CAAC,cAAc,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;YAClC,CAAC,WAAW,CAAC,EAAE,CAAC;SAChB;KACD,CAAC;IACF,QAAQ,CAAC,2BAA2B,EAAE,OAAO,EAAE,gBAAgB,EAAE;QAChE,KAAK,EAAE;YACN,CAAC,cAAc,CAAC,EAAE,gBAAgB,CAAC,IAAI;YACvC,KAAK,EAAE;gBACN,CAAC,cAAc,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;gBAClC,CAAC,WAAW,CAAC,EAAE,CAAC;aAChB;SACD;KACD,CAAC;IACF,QAAQ,CAAC,wBAAwB,EAAE,OAAO,EAAE,gBAAgB,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IACnF,QAAQ,CAAC,sBAAsB,EAAE,OAAO,EAAE,YAAY,EAAE;QACvD,UAAU,EAAE,CAAC;QACb,QAAQ,EAAE,SAAS;QACnB,QAAQ,EAAE,EAAE;KACZ,CAAC;IACF,QAAQ,CAAC,mBAAmB,EAAE,OAAO,EAAE,YAAY,EAAE;QACpD,UAAU,EAAE,CAAC;QACb,QAAQ,EAAE,CAAC;QACX,QAAQ,EAAE,CAAC,CAAC,CAAC;KACb,CAAC;IACF,QAAQ,CAAC,mBAAmB,EAAE,OAAO,EAAE,SAAS,EAAE;QACjD,UAAU,EAAE,EAAE,CAAC,cAAc,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE;QACpE,QAAQ,EAAE,SAAS;QACnB,QAAQ,EAAE,EAAE;KACZ,CAAC;IACF,QAAQ,CAAC,gBAAgB,EAAE,OAAO,EAAE,SAAS,EAAE;QAC9C,UAAU,EAAE,EAAE,CAAC,cAAc,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE;QACpE,QAAQ,EAAE,EAAE,CAAC,cAAc,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE;QAClE,QAAQ,EAAE;YACT,EAAE,CAAC,cAAc,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE;YACxD,EAAE,CAAC,cAAc,CAAC,EAAE,OAAO,CAAC,IAAI,EAAE;SAClC;KACD,CAAC;IACF,QAAQ,CAAC,eAAe,EAAE,OAAO,EAAE,sBAAsB,EAAE;QAC1D,KAAK,EAAE,CAAC;QACR,GAAG,EAAE,CAAC;QACN,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,CAAC;KACR,CAAC;IAEF,QAAQ,CAAC,kBAAkB,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,CAAC;IACrD,QAAQ,CAAC,cAAc,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;IAE7C,QAAQ,CAAC,iBAAiB,EAAE,OAAO,EAAE,UAAU,EAAE;QAChD,CAAC,EAAE,CAAC;QACJ,CAAC,EAAE,CAAC;QACJ,4DAA4D;KACrD,CAAC;IAET,QAAQ,CAAC,aAAa,EAAE,OAAO,EAAE,MAAM,EAAE;QACxC,CAAC,EAAE;YACF,EAAE,CAAC,cAAc,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE;YACxD,EAAE,CAAC,cAAc,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE;SACxD;QACD,CAAC,EAAE,CAAC,EAAE,CAAC,cAAc,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC;QAC7D,4DAA4D;KACrD,CAAC;IAET,QAAQ,CAAC,qBAAqB,EAAE,OAAO,EAAE,aAAa,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IAC7E,QAAQ,CAAC,yBAAyB,EAAE,OAAO,EAAE,aAAa,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,CAAC;IAC5F,QAAQ,CAAC,sBAAsB,EAAE,OAAO,EAAE,aAAa,EAAE;QACxD,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE;KACjD,CAAC;CACF,CAAC;AAEF,uIAAuI;AACvI,2EAA2E;AAC3E,oCAAoC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\n\nimport { MockHandle } from \"@fluidframework/test-runtime-utils\";\nimport { ITreeCursorSynchronous, JsonableTree } from \"../core/index.js\";\nimport {\n\tAny,\n\tFieldKinds,\n\tFlexFieldSchema,\n\tFullSchemaPolicy,\n\tMultiplicity,\n\tSchemaLibrary,\n\tFlexTreeNodeSchema,\n\tFlexTreeSchema,\n\tcursorsForTypedFieldData,\n\tdefaultSchemaPolicy,\n\tjsonableTreeFromFieldCursor,\n\tcursorForJsonableTreeNode,\n\ttypeNameSymbol,\n\tvalueSymbol,\n\tAllowedTypesToFlexInsertableTree,\n\tInsertableFlexField,\n\tintoStoredSchemaCollection,\n\tSchemaBuilderBase,\n} from \"../feature-libraries/index.js\";\nimport { TreeContent } from \"../shared-tree/index.js\";\nimport { leaf } from \"../domains/index.js\";\n\ninterface TestTree {\n\treadonly name: string;\n\treadonly schemaData: FlexTreeSchema;\n\treadonly policy: FullSchemaPolicy;\n\treadonly treeFactory: () => JsonableTree[];\n}\n\nfunction testTree<T extends FlexTreeNodeSchema>(\n\tname: string,\n\tschemaData: SchemaLibrary,\n\trootNode: T,\n\tdata: AllowedTypesToFlexInsertableTree<[T]>,\n): TestTree {\n\tconst fieldSchema = FlexFieldSchema.create(FieldKinds.required, [rootNode]);\n\treturn testField(name, schemaData, fieldSchema, data);\n}\n\nfunction testField<T extends FlexFieldSchema>(\n\tname: string,\n\tschemaLibrary: SchemaLibrary,\n\trootField: T,\n\tdata: InsertableFlexField<T>,\n): TestTree {\n\tconst schema = new SchemaBuilderBase(FieldKinds.required, {\n\t\tscope: name,\n\t\tlint: { rejectForbidden: false, rejectEmpty: false },\n\t\tlibraries: [schemaLibrary],\n\t}).intoSchema(rootField);\n\treturn {\n\t\tname,\n\t\tschemaData: schema,\n\t\ttreeFactory: () => {\n\t\t\tconst cursor = cursorsForTypedFieldData({ schema }, schema.rootFieldSchema, data);\n\t\t\treturn jsonableTreeFromFieldCursor(cursor);\n\t\t},\n\t\tpolicy: defaultSchemaPolicy,\n\t};\n}\n\nfunction cursorsToFieldContent(\n\tcursors: readonly ITreeCursorSynchronous[],\n\tschema: FlexFieldSchema,\n): readonly ITreeCursorSynchronous[] | ITreeCursorSynchronous | undefined {\n\tif (schema.kind.multiplicity === Multiplicity.Sequence) {\n\t\treturn cursors;\n\t}\n\tif (cursors.length === 1) {\n\t\treturn cursors[0];\n\t}\n\tassert(cursors.length === 0);\n\treturn undefined;\n}\n\nexport function treeContentFromTestTree(test: TestTree): TreeContent {\n\treturn {\n\t\tschema: test.schemaData,\n\t\tinitialTree: cursorsToFieldContent(\n\t\t\ttest.treeFactory().map(cursorForJsonableTreeNode),\n\t\t\ttest.schemaData.rootFieldSchema,\n\t\t),\n\t};\n}\n\nconst builder = new SchemaBuilderBase(FieldKinds.required, {\n\tscope: \"test\",\n\tlibraries: [leaf.library],\n});\nexport const minimal = builder.object(\"minimal\", {});\nexport const hasMinimalValueField = builder.object(\"hasMinimalValueField\", {\n\tfield: minimal,\n});\nexport const hasNumericValueField = builder.object(\"hasNumericValueField\", {\n\tfield: leaf.number,\n});\nexport const hasPolymorphicValueField = builder.object(\"hasPolymorphicValueField\", {\n\tfield: [leaf.number, minimal],\n});\nexport const hasAnyValueField = builder.object(\"hasAnyValueField\", {\n\tfield: Any,\n});\nexport const hasOptionalField = builder.object(\"hasOptionalField\", {\n\tfield: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),\n});\nexport const allTheFields = builder.object(\"allTheFields\", {\n\toptional: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),\n\tvalueField: leaf.number,\n\tsequence: FlexFieldSchema.create(FieldKinds.sequence, [leaf.number]),\n});\nexport const anyFields = builder.object(\"anyFields\", {\n\toptional: FlexFieldSchema.create(FieldKinds.optional, [Any]),\n\tvalueField: Any,\n\tsequence: FlexFieldSchema.create(FieldKinds.sequence, [Any]),\n});\nexport const escapedFieldProperties = builder.object(\"escapedFieldProperties\", {\n\tvalue: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),\n\tset: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),\n\tsetValue: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),\n\tfield: FlexFieldSchema.create(FieldKinds.optional, [leaf.number]),\n});\n\nexport const numericMap = builder.map(\n\t\"numericMap\",\n\tFlexFieldSchema.create(FieldKinds.optional, [leaf.number]),\n);\n\ntype NumericMapData = AllowedTypesToFlexInsertableTree<[typeof numericMap]>;\n\nexport const anyMap = builder.map(\"anyMap\", FlexFieldSchema.create(FieldKinds.sequence, [Any]));\n\nexport const recursiveType = builder.objectRecursive(\"recursiveType\", {\n\tfield: FlexFieldSchema.createUnsafe(FieldKinds.optional, [() => recursiveType]),\n});\n\nexport const library = builder.intoLibrary();\nexport const storedLibrary = intoStoredSchemaCollection(library);\n\nexport const testTrees: readonly TestTree[] = [\n\ttestField(\"empty\", library, FlexFieldSchema.create(FieldKinds.optional, []), undefined),\n\ttestTree(\"null\", library, leaf.null, null),\n\ttestTree(\"minimal\", library, minimal, {}),\n\ttestTree(\"numeric\", library, leaf.number, 5),\n\ttestTree(\"handle\", library, leaf.handle, new MockHandle(5)),\n\ttestField(\n\t\t\"numericSequence\",\n\t\tlibrary,\n\t\tFlexFieldSchema.create(FieldKinds.sequence, [leaf.number]),\n\t\t[1, 2, 3],\n\t),\n\ttestTree(\"true boolean\", library, leaf.boolean, true),\n\ttestTree(\"false boolean\", library, leaf.boolean, false),\n\ttestTree(\"hasMinimalValueField\", library, hasMinimalValueField, {\n\t\tfield: {},\n\t}),\n\ttestTree(\"hasNumericValueField\", library, hasNumericValueField, {\n\t\tfield: 5,\n\t}),\n\ttestTree(\"hasPolymorphicValueField\", library, hasPolymorphicValueField, {\n\t\tfield: 5,\n\t}),\n\ttestTree(\"hasAnyValueField\", library, hasAnyValueField, {\n\t\tfield: {\n\t\t\t[typeNameSymbol]: leaf.number.name,\n\t\t\t[valueSymbol]: 5,\n\t\t},\n\t}),\n\ttestTree(\"hasAnyValueFieldRecursive\", library, hasAnyValueField, {\n\t\tfield: {\n\t\t\t[typeNameSymbol]: hasAnyValueField.name,\n\t\t\tfield: {\n\t\t\t\t[typeNameSymbol]: leaf.number.name,\n\t\t\t\t[valueSymbol]: 5,\n\t\t\t},\n\t\t},\n\t}),\n\ttestTree(\"hasOptionalField-empty\", library, hasOptionalField, { field: undefined }),\n\ttestTree(\"allTheFields-minimal\", library, allTheFields, {\n\t\tvalueField: 5,\n\t\toptional: undefined,\n\t\tsequence: [],\n\t}),\n\ttestTree(\"allTheFields-full\", library, allTheFields, {\n\t\tvalueField: 5,\n\t\toptional: 5,\n\t\tsequence: [5],\n\t}),\n\ttestTree(\"anyFields-minimal\", library, anyFields, {\n\t\tvalueField: { [typeNameSymbol]: leaf.number.name, [valueSymbol]: 5 },\n\t\toptional: undefined,\n\t\tsequence: [],\n\t}),\n\ttestTree(\"anyFields-full\", library, anyFields, {\n\t\tvalueField: { [typeNameSymbol]: leaf.number.name, [valueSymbol]: 5 },\n\t\toptional: { [typeNameSymbol]: leaf.number.name, [valueSymbol]: 5 },\n\t\tsequence: [\n\t\t\t{ [typeNameSymbol]: leaf.number.name, [valueSymbol]: 5 },\n\t\t\t{ [typeNameSymbol]: minimal.name },\n\t\t],\n\t}),\n\ttestTree(\"escapedFields\", library, escapedFieldProperties, {\n\t\tvalue: 5,\n\t\tset: 6,\n\t\tsetValue: 7,\n\t\tfield: 8,\n\t}),\n\n\ttestTree(\"numericMap-empty\", library, numericMap, {}),\n\ttestTree(\"anyMap-empty\", library, anyMap, {}),\n\n\ttestTree(\"numericMap-full\", library, numericMap, {\n\t\ta: 5,\n\t\tb: 6,\n\t\t// TODO: SchemaAware API for map nodes, and remove this cast\n\t} as any),\n\n\ttestTree(\"anyMap-full\", library, anyMap, {\n\t\ta: [\n\t\t\t{ [typeNameSymbol]: leaf.number.name, [valueSymbol]: 1 },\n\t\t\t{ [typeNameSymbol]: leaf.number.name, [valueSymbol]: 2 },\n\t\t],\n\t\tb: [{ [typeNameSymbol]: leaf.number.name, [valueSymbol]: 3 }],\n\t\t// TODO: SchemaAware API for map nodes, and remove this cast\n\t} as any),\n\n\ttestTree(\"recursiveType-empty\", library, recursiveType, { field: undefined }),\n\ttestTree(\"recursiveType-recursive\", library, recursiveType, { field: { field: undefined } }),\n\ttestTree(\"recursiveType-deeper\", library, recursiveType, {\n\t\tfield: { field: { field: { field: undefined } } },\n\t}),\n];\n\n// TODO: integrate data sources for wide and deep trees from ops size testing and large data generators for cursor performance testing.\n// TODO: whiteboard like data with near term and eventual schema approaches\n// TODO: randomized schema generator\n"]}

package/lib/test/tree/anchorSet.spec.d.ts

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

package/lib/test/tree/anchorSet.spec.d.ts.map

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