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

package/lib/test/feature-libraries/modular-schema/comparison.spec.js

@@ -1,264 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { allowsFieldSuperset, allowsTreeSuperset, allowsTreeSchemaIdentifierSuperset, allowsValueSuperset,
-// Allow importing from this specific file which is being tested:
-/* eslint-disable-next-line import/no-internal-modules */
- } from "../../../feature-libraries/modular-schema/comparison.js";
-import { ValueSchema, storedEmptyFieldSchema, MapNodeStoredSchema, ObjectNodeStoredSchema, LeafNodeStoredSchema, TreeStoredSchemaRepository, } from "../../../core/index.js";
-import { brand } from "../../../util/index.js";
-import { defaultSchemaPolicy, FieldKinds } from "../../../feature-libraries/index.js";
-/**
- * Helper for building {@link TreeFieldStoredSchema}.
- * @internal
- */
-function fieldSchema(kind, types) {
-    return {
-        kind,
-        types: types === undefined ? undefined : new Set(types),
-    };
-}
-describe("Schema Comparison", () => {
-    /**
-     * TreeFieldStoredSchema permits anything.
-     * Note that children inside the field still have to be in schema.
-     */
-    const anyField = fieldSchema(FieldKinds.sequence);
-    /**
-     * TreeNodeStoredSchema that permits anything without a value.
-     * Note that children under the fields still have to be in schema.
-     */
-    const anyTreeWithoutValue = new MapNodeStoredSchema(anyField);
-    const numberLeaf = new LeafNodeStoredSchema(ValueSchema.Number);
-    /**
-     * TreeFieldStoredSchema which is impossible for any data to be in schema with.
-     */
-    const neverField = fieldSchema(FieldKinds.required, []);
-    /**
-     * TreeNodeStoredSchema which is impossible for any data to be in schema with.
-     */
-    const neverTree = new MapNodeStoredSchema(neverField);
-    const neverTree2 = new ObjectNodeStoredSchema(new Map([[brand("x"), neverField]]));
-    const emptyTree = {
-        name: brand("empty"),
-        schema: new ObjectNodeStoredSchema(new Map()),
-    };
-    const emptyLocalFieldTree = {
-        name: brand("emptyLocalFieldTree"),
-        schema: new ObjectNodeStoredSchema(new Map([[brand("x"), storedEmptyFieldSchema]])),
-    };
-    const optionalLocalFieldTree = {
-        name: brand("optionalLocalFieldTree"),
-        schema: new ObjectNodeStoredSchema(new Map([[brand("x"), fieldSchema(FieldKinds.optional, [emptyTree.name])]])),
-    };
-    const valueLocalFieldTree = {
-        name: brand("valueLocalFieldTree"),
-        schema: new ObjectNodeStoredSchema(new Map([[brand("x"), fieldSchema(FieldKinds.required, [emptyTree.name])]])),
-    };
-    const valueAnyField = fieldSchema(FieldKinds.required);
-    const valueEmptyTreeField = fieldSchema(FieldKinds.required, [emptyTree.name]);
-    const optionalAnyField = fieldSchema(FieldKinds.optional);
-    const optionalEmptyTreeField = fieldSchema(FieldKinds.optional, [emptyTree.name]);
-    function updateTreeSchema(repo, identifier, schema) {
-        repo.apply({
-            rootFieldSchema: repo.rootFieldSchema,
-            nodeSchema: new Map([...repo.nodeSchema, [identifier, schema]]),
-        });
-    }
-    it("allowsValueSuperset", () => {
-        assert.equal(getOrdering(ValueSchema.FluidHandle, undefined, allowsValueSuperset), Ordering.Incomparable);
-        assert.equal(getOrdering(ValueSchema.Boolean, undefined, allowsValueSuperset), Ordering.Incomparable);
-        assert.equal(getOrdering(ValueSchema.Number, undefined, allowsValueSuperset), Ordering.Incomparable);
-        assert.equal(getOrdering(ValueSchema.String, undefined, allowsValueSuperset), Ordering.Incomparable);
-        assert.equal(getOrdering(ValueSchema.Null, undefined, allowsValueSuperset), Ordering.Incomparable);
-        testPartialOrder(allowsValueSuperset, [
-            ValueSchema.Boolean,
-            ValueSchema.Number,
-            ValueSchema.String,
-            ValueSchema.FluidHandle,
-            ValueSchema.Null,
-        ]);
-    });
-    it("allowsTypesSuperset", () => {
-        testOrder(allowsTreeSchemaIdentifierSuperset, [
-            new Set(),
-            new Set([brand("1")]),
-            new Set([brand("1"), brand("2")]),
-            undefined,
-        ]);
-        const neverSet = new Set();
-        const neverSet2 = new Set();
-        testPartialOrder(allowsTreeSchemaIdentifierSuperset, [
-            neverSet,
-            neverSet2,
-            new Set([brand("1")]),
-            new Set([brand("2")]),
-            new Set([brand("1"), brand("2")]),
-            undefined,
-        ], [[neverSet, neverSet2]]);
-    });
-    it("allowsFieldSuperset", () => {
-        const repo = new TreeStoredSchemaRepository();
-        updateTreeSchema(repo, brand("never"), neverTree);
-        updateTreeSchema(repo, emptyTree.name, emptyTree.schema);
-        const neverField2 = fieldSchema(FieldKinds.required, [
-            brand("never"),
-        ]);
-        const compare = (a, b) => allowsFieldSuperset(defaultSchemaPolicy, repo, a, b);
-        testOrder(compare, [
-            neverField,
-            storedEmptyFieldSchema,
-            optionalEmptyTreeField,
-            optionalAnyField,
-            anyField,
-        ]);
-        testOrder(compare, [neverField, valueEmptyTreeField, valueAnyField, anyField]);
-        assert.equal(getOrdering(valueEmptyTreeField, storedEmptyFieldSchema, compare), Ordering.Incomparable);
-        testPartialOrder(compare, [
-            neverField,
-            neverField2,
-            storedEmptyFieldSchema,
-            anyField,
-            valueEmptyTreeField,
-            valueAnyField,
-            valueEmptyTreeField,
-            valueAnyField,
-        ], [[neverField, neverField2]]);
-    });
-    it("allowsTreeSuperset-no leaf values", () => {
-        const repo = new TreeStoredSchemaRepository();
-        updateTreeSchema(repo, emptyTree.name, emptyTree.schema);
-        const compare = (a, b) => allowsTreeSuperset(defaultSchemaPolicy, repo, a, b);
-        testOrder(compare, [
-            neverTree,
-            emptyTree.schema,
-            optionalLocalFieldTree.schema,
-            anyTreeWithoutValue,
-        ]);
-        testPartialOrder(compare, [
-            neverTree,
-            neverTree2,
-            undefined,
-            anyTreeWithoutValue,
-            emptyTree.schema,
-            emptyLocalFieldTree.schema,
-            optionalLocalFieldTree.schema,
-            valueLocalFieldTree.schema,
-        ], [
-            [neverTree, neverTree2, undefined],
-            [emptyTree.schema, emptyLocalFieldTree.schema],
-        ]);
-    });
-    it("allowsTreeSuperset-leaf values", () => {
-        const repo = new TreeStoredSchemaRepository();
-        updateTreeSchema(repo, emptyTree.name, emptyTree.schema);
-        const compare = (a, b) => allowsTreeSuperset(defaultSchemaPolicy, repo, a, b);
-        testOrder(compare, [neverTree, numberLeaf]);
-        testPartialOrder(compare, [neverTree, neverTree2, undefined, numberLeaf], [[neverTree, neverTree2, undefined]]);
-    });
-});
-var Ordering;
-(function (Ordering) {
-    Ordering[Ordering["Subset"] = 0] = "Subset";
-    Ordering[Ordering["Equal"] = 1] = "Equal";
-    Ordering[Ordering["Incomparable"] = 2] = "Incomparable";
-    Ordering[Ordering["Superset"] = 3] = "Superset";
-})(Ordering || (Ordering = {}));
-function getOrdering(original, superset, allowsSuperset) {
-    assert(allowsSuperset(original, original));
-    assert(allowsSuperset(superset, superset));
-    const a = allowsSuperset(original, superset);
-    const b = allowsSuperset(superset, original);
-    if (a && b) {
-        return Ordering.Equal;
-    }
-    if (a && !b) {
-        return Ordering.Superset;
-    }
-    if (!a && b) {
-        return Ordering.Subset;
-    }
-    return Ordering.Incomparable;
-}
-function testOrder(compare, inOrder) {
-    for (let index = 0; index < inOrder.length - 1; index++) {
-        const order = getOrdering(inOrder[index], inOrder[index + 1], compare);
-        if (order !== Ordering.Superset) {
-            assert.fail(`expected ${JSON.stringify(intoSimpleObject(inOrder[index + 1]))} to be a superset of ${JSON.stringify(intoSimpleObject(inOrder[index]))} but was ${Ordering[order]}`);
-        }
-    }
-}
-/**
- * Tests a comparison function, ensuring it produces a non-strict partial order over the provided values.
- * https://en.wikipedia.org/wiki/Partially_ordered_set#Non-strict_partial_order
- */
-function testPartialOrder(compare, values, expectedEqual = []) {
-    // To be a strict partial order, the function must be:
-    // Reflexivity: a ≤ a
-    // Antisymmetry: if a ≤ b and b ≤ a then a = b
-    // Transitivity: if a ≤ b  and  b ≤ c  then  a ≤ c
-    // This is brute forced in O(n^3) time below:
-    // Violations:
-    const reflexivity = [];
-    const antisymmetry = [];
-    const transitivity = [];
-    const expectedEqualMap = new Map();
-    for (const group of expectedEqual) {
-        const set = new Set(group);
-        for (const item of group) {
-            expectedEqualMap.set(item, set);
-        }
-    }
-    for (const a of values) {
-        if (!compare(a, a)) {
-            reflexivity.push(a);
-        }
-        for (const b of values) {
-            const expectEqual = a === b || (expectedEqualMap.get(a)?.has(b) ?? false);
-            if ((compare(a, b) && compare(b, a)) !== expectEqual) {
-                antisymmetry.push([expectEqual, a, b]);
-            }
-            for (const c of values) {
-                if (compare(a, b) && compare(b, c)) {
-                    if (!compare(a, c)) {
-                        transitivity.push([a, b, c]);
-                    }
-                }
-            }
-        }
-    }
-    assert.deepEqual(intoSimpleObject(reflexivity), [], "reflexivity");
-    assert.deepEqual(intoSimpleObject(antisymmetry), [], "antisymmetry");
-    assert.deepEqual(intoSimpleObject(transitivity), [], "transitivity");
-}
-/**
- * Flatten maps and arrays into simple objects for better printing.
- */
-function intoSimpleObject(obj) {
-    if (typeof obj !== "object" || obj === null) {
-        return obj;
-    }
-    if (obj instanceof Array) {
-        return Array.from(obj, intoSimpleObject);
-    }
-    if (obj instanceof Map) {
-        return Array.from(obj, ([key, value]) => [
-            key,
-            intoSimpleObject(value),
-        ]);
-    }
-    if (obj instanceof Set) {
-        return Array.from(obj);
-    }
-    const out = {};
-    // eslint-disable-next-line no-restricted-syntax
-    for (const key in obj) {
-        if (Object.prototype.hasOwnProperty.call(obj, key)) {
-            out[key] = intoSimpleObject(obj[key]);
-        }
-    }
-    return out;
-}
-//# sourceMappingURL=comparison.spec.js.map

package/lib/test/feature-libraries/modular-schema/comparison.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"comparison.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/modular-schema/comparison.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EACN,mBAAmB,EACnB,kBAAkB,EAClB,kCAAkC,EAClC,mBAAmB;AACnB,iEAAiE;AACjE,yDAAyD;EACzD,MAAM,yDAAyD,CAAC;AACjE,OAAO,EAGN,WAAW,EAGX,sBAAsB,EAEtB,mBAAmB,EACnB,sBAAsB,EACtB,oBAAoB,EAEpB,0BAA0B,GAC1B,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AAEtF;;;GAGG;AACH,SAAS,WAAW,CACnB,IAAyC,EACzC,KAA0C;IAE1C,OAAO;QACN,IAAI;QACJ,KAAK,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC;KACvD,CAAC;AACH,CAAC;AAED,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IAClC;;;OAGG;IACH,MAAM,QAAQ,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAElD;;;OAGG;IACH,MAAM,mBAAmB,GAAyB,IAAI,mBAAmB,CAAC,QAAQ,CAAC,CAAC;IAEpF,MAAM,UAAU,GAAyB,IAAI,oBAAoB,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAEtF;;OAEG;IACH,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAExD;;OAEG;IACH,MAAM,SAAS,GAAyB,IAAI,mBAAmB,CAAC,UAAU,CAAC,CAAC;IAE5E,MAAM,UAAU,GAAyB,IAAI,sBAAsB,CAClE,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CACnC,CAAC;IAEF,MAAM,SAAS,GAAG;QACjB,IAAI,EAAE,KAAK,CAA2B,OAAO,CAAC;QAC9C,MAAM,EAAE,IAAI,sBAAsB,CAAC,IAAI,GAAG,EAAE,CAAC;KAC7C,CAAC;IAEF,MAAM,mBAAmB,GAAG;QAC3B,IAAI,EAAE,KAAK,CAA2B,qBAAqB,CAAC;QAC5D,MAAM,EAAE,IAAI,sBAAsB,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,sBAAsB,CAAC,CAAC,CAAC,CAAC;KACnF,CAAC;IAEF,MAAM,sBAAsB,GAAG;QAC9B,IAAI,EAAE,KAAK,CAA2B,wBAAwB,CAAC;QAC/D,MAAM,EAAE,IAAI,sBAAsB,CACjC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAC3E;KACD,CAAC;IACF,MAAM,mBAAmB,GAAG;QAC3B,IAAI,EAAE,KAAK,CAA2B,qBAAqB,CAAC;QAC5D,MAAM,EAAE,IAAI,sBAAsB,CACjC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAC3E;KACD,CAAC;IACF,MAAM,aAAa,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IACvD,MAAM,mBAAmB,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/E,MAAM,gBAAgB,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC1D,MAAM,sBAAsB,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IAElF,SAAS,gBAAgB,CACxB,IAA6B,EAC7B,UAAoC,EACpC,MAA4B;QAE5B,IAAI,CAAC,KAAK,CAAC;YACV,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,UAAU,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC;SAC/D,CAAC,CAAC;IACJ,CAAC;IAED,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC9B,MAAM,CAAC,KAAK,CACX,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,SAAS,EAAE,mBAAmB,CAAC,EACpE,QAAQ,CAAC,YAAY,CACrB,CAAC;QACF,MAAM,CAAC,KAAK,CACX,WAAW,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,mBAAmB,CAAC,EAChE,QAAQ,CAAC,YAAY,CACrB,CAAC;QACF,MAAM,CAAC,KAAK,CACX,WAAW,CAAC,WAAW,CAAC,MAAM,EAAE,SAAS,EAAE,mBAAmB,CAAC,EAC/D,QAAQ,CAAC,YAAY,CACrB,CAAC;QACF,MAAM,CAAC,KAAK,CACX,WAAW,CAAC,WAAW,CAAC,MAAM,EAAE,SAAS,EAAE,mBAAmB,CAAC,EAC/D,QAAQ,CAAC,YAAY,CACrB,CAAC;QACF,MAAM,CAAC,KAAK,CACX,WAAW,CAAC,WAAW,CAAC,IAAI,EAAE,SAAS,EAAE,mBAAmB,CAAC,EAC7D,QAAQ,CAAC,YAAY,CACrB,CAAC;QACF,gBAAgB,CAA0B,mBAAmB,EAAE;YAC9D,WAAW,CAAC,OAAO;YACnB,WAAW,CAAC,MAAM;YAClB,WAAW,CAAC,MAAM;YAClB,WAAW,CAAC,WAAW;YACvB,WAAW,CAAC,IAAI;SAChB,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC9B,SAAS,CAAC,kCAAkC,EAAE;YAC7C,IAAI,GAAG,EAAE;YACT,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACrB,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,SAAS;SACT,CAAC,CAAC;QACH,MAAM,QAAQ,GAAgB,IAAI,GAAG,EAAE,CAAC;QACxC,MAAM,SAAS,GAAgB,IAAI,GAAG,EAAE,CAAC;QACzC,gBAAgB,CACf,kCAAkC,EAClC;YACC,QAAQ;YACR,SAAS;YACT,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACrB,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACrB,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,SAAS;SACT,EACD,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CACvB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC9B,MAAM,IAAI,GAAG,IAAI,0BAA0B,EAAE,CAAC;QAC9C,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,CAAC;QAClD,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QACzD,MAAM,WAAW,GAA0B,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE;YAC3E,KAAK,CAAC,OAAO,CAAC;SACd,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,CAAC,CAAwB,EAAE,CAAwB,EAAW,EAAE,CAC/E,mBAAmB,CAAC,mBAAmB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,SAAS,CAAC,OAAO,EAAE;YAClB,UAAU;YACV,sBAAsB;YACtB,sBAAsB;YACtB,gBAAgB;YAChB,QAAQ;SACR,CAAC,CAAC;QACH,SAAS,CAAC,OAAO,EAAE,CAAC,UAAU,EAAE,mBAAmB,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC/E,MAAM,CAAC,KAAK,CACX,WAAW,CAAC,mBAAmB,EAAE,sBAAsB,EAAE,OAAO,CAAC,EACjE,QAAQ,CAAC,YAAY,CACrB,CAAC;QACF,gBAAgB,CACf,OAAO,EACP;YACC,UAAU;YACV,WAAW;YACX,sBAAsB;YACtB,QAAQ;YACR,mBAAmB;YACnB,aAAa;YACb,mBAAmB;YACnB,aAAa;SACb,EACD,CAAC,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,CAC3B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC5C,MAAM,IAAI,GAAG,IAAI,0BAA0B,EAAE,CAAC;QAC9C,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QACzD,MAAM,OAAO,GAAG,CACf,CAAmC,EACnC,CAAmC,EACzB,EAAE,CAAC,kBAAkB,CAAC,mBAAmB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,SAAS,CAAC,OAAO,EAAE;YAClB,SAAS;YACT,SAAS,CAAC,MAAM;YAChB,sBAAsB,CAAC,MAAM;YAC7B,mBAAmB;SACnB,CAAC,CAAC;QACH,gBAAgB,CACf,OAAO,EACP;YACC,SAAS;YACT,UAAU;YACV,SAAS;YACT,mBAAmB;YACnB,SAAS,CAAC,MAAM;YAChB,mBAAmB,CAAC,MAAM;YAC1B,sBAAsB,CAAC,MAAM;YAC7B,mBAAmB,CAAC,MAAM;SAC1B,EACD;YACC,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC;YAClC,CAAC,SAAS,CAAC,MAAM,EAAE,mBAAmB,CAAC,MAAM,CAAC;SAC9C,CACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACzC,MAAM,IAAI,GAAG,IAAI,0BAA0B,EAAE,CAAC;QAC9C,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QACzD,MAAM,OAAO,GAAG,CACf,CAAmC,EACnC,CAAmC,EACzB,EAAE,CAAC,kBAAkB,CAAC,mBAAmB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,SAAS,CAAC,OAAO,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC;QAC5C,gBAAgB,CACf,OAAO,EACP,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,CAAC,EAC9C,CAAC,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC,CACpC,CAAC;IACH,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,IAAK,QAKJ;AALD,WAAK,QAAQ;IACZ,2CAAM,CAAA;IACN,yCAAK,CAAA;IACL,uDAAY,CAAA;IACZ,+CAAQ,CAAA;AACT,CAAC,EALI,QAAQ,KAAR,QAAQ,QAKZ;AAED,SAAS,WAAW,CACnB,QAAW,EACX,QAAW,EACX,cAAuC;IAEvC,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC3C,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC3C,MAAM,CAAC,GAAG,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC7C,MAAM,CAAC,GAAG,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC7C,IAAI,CAAC,IAAI,CAAC,EAAE;QACX,OAAO,QAAQ,CAAC,KAAK,CAAC;KACtB;IACD,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE;QACZ,OAAO,QAAQ,CAAC,QAAQ,CAAC;KACzB;IACD,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE;QACZ,OAAO,QAAQ,CAAC,MAAM,CAAC;KACvB;IACD,OAAO,QAAQ,CAAC,YAAY,CAAC;AAC9B,CAAC;AAED,SAAS,SAAS,CAAI,OAAgC,EAAE,OAAY;IACnE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE;QACxD,MAAM,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACvE,IAAI,KAAK,KAAK,QAAQ,CAAC,QAAQ,EAAE;YAChC,MAAM,CAAC,IAAI,CACV,YAAY,IAAI,CAAC,SAAS,CACzB,gBAAgB,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CACpC,wBAAwB,IAAI,CAAC,SAAS,CACtC,gBAAgB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAChC,YAAY,QAAQ,CAAC,KAAK,CAAC,EAAE,CAC9B,CAAC;SACF;KACD;AACF,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CACxB,OAAgC,EAChC,MAAW,EACX,gBAAuB,EAAE;IAEzB,sDAAsD;IACtD,qBAAqB;IACrB,8CAA8C;IAC9C,kDAAkD;IAElD,6CAA6C;IAC7C,cAAc;IACd,MAAM,WAAW,GAAQ,EAAE,CAAC;IAC5B,MAAM,YAAY,GAAsB,EAAE,CAAC;IAC3C,MAAM,YAAY,GAAU,EAAE,CAAC;IAE/B,MAAM,gBAAgB,GAAmB,IAAI,GAAG,EAAE,CAAC;IACnD,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE;QAClC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACzB,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;SAChC;KACD;IAED,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE;QACvB,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACnB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACpB;QAED,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE;YACvB,MAAM,WAAW,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC;YAC1E,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,WAAW,EAAE;gBACrD,YAAY,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAoB,CAAC,CAAC;aAC1D;YAED,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE;gBACvB,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;oBACnC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;wBACnB,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;qBAC7B;iBACD;aACD;SACD;KACD;IACD,MAAM,CAAC,SAAS,CAAC,gBAAgB,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,aAAa,CAAC,CAAC;IACnE,MAAM,CAAC,SAAS,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,cAAc,CAAC,CAAC;IACrE,MAAM,CAAC,SAAS,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,cAAc,CAAC,CAAC;AACtE,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,GAAY;IACrC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,EAAE;QAC5C,OAAO,GAAG,CAAC;KACX;IACD,IAAI,GAAG,YAAY,KAAK,EAAE;QACzB,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,gBAAgB,CAAC,CAAC;KACzC;IACD,IAAI,GAAG,YAAY,GAAG,EAAE;QACvB,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAsB,EAAE,CAAC;YAC5D,GAAG;YACH,gBAAgB,CAAC,KAAK,CAAC;SACvB,CAAC,CAAC;KACH;IACD,IAAI,GAAG,YAAY,GAAG,EAAE;QACvB,OAAO,KAAK,CAAC,IAAI,CAAC,GAA0B,CAAC,CAAC;KAC9C;IACD,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,gDAAgD;IAChD,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE;QACtB,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;YACnD,GAAG,CAAC,GAAG,CAAC,GAAG,gBAAgB,CAAE,GAA+B,CAAC,GAAG,CAAC,CAAC,CAAC;SACnE;KACD;IACD,OAAO,GAAG,CAAC;AACZ,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\n\nimport {\n\tallowsFieldSuperset,\n\tallowsTreeSuperset,\n\tallowsTreeSchemaIdentifierSuperset,\n\tallowsValueSuperset,\n\t// Allow importing from this specific file which is being tested:\n\t/* eslint-disable-next-line import/no-internal-modules */\n} from \"../../../feature-libraries/modular-schema/comparison.js\";\nimport {\n\tTreeFieldStoredSchema,\n\tTreeNodeStoredSchema,\n\tValueSchema,\n\tTreeTypeSet,\n\tTreeNodeSchemaIdentifier,\n\tstoredEmptyFieldSchema,\n\tFieldKindIdentifier,\n\tMapNodeStoredSchema,\n\tObjectNodeStoredSchema,\n\tLeafNodeStoredSchema,\n\tMutableTreeStoredSchema,\n\tTreeStoredSchemaRepository,\n} from \"../../../core/index.js\";\nimport { brand } from \"../../../util/index.js\";\nimport { defaultSchemaPolicy, FieldKinds } from \"../../../feature-libraries/index.js\";\n\n/**\n * Helper for building {@link TreeFieldStoredSchema}.\n * @internal\n */\nfunction fieldSchema(\n\tkind: { identifier: FieldKindIdentifier },\n\ttypes?: Iterable<TreeNodeSchemaIdentifier>,\n): TreeFieldStoredSchema {\n\treturn {\n\t\tkind,\n\t\ttypes: types === undefined ? undefined : new Set(types),\n\t};\n}\n\ndescribe(\"Schema Comparison\", () => {\n\t/**\n\t * TreeFieldStoredSchema permits anything.\n\t * Note that children inside the field still have to be in schema.\n\t */\n\tconst anyField = fieldSchema(FieldKinds.sequence);\n\n\t/**\n\t * TreeNodeStoredSchema that permits anything without a value.\n\t * Note that children under the fields still have to be in schema.\n\t */\n\tconst anyTreeWithoutValue: TreeNodeStoredSchema = new MapNodeStoredSchema(anyField);\n\n\tconst numberLeaf: TreeNodeStoredSchema = new LeafNodeStoredSchema(ValueSchema.Number);\n\n\t/**\n\t * TreeFieldStoredSchema which is impossible for any data to be in schema with.\n\t */\n\tconst neverField = fieldSchema(FieldKinds.required, []);\n\n\t/**\n\t * TreeNodeStoredSchema which is impossible for any data to be in schema with.\n\t */\n\tconst neverTree: TreeNodeStoredSchema = new MapNodeStoredSchema(neverField);\n\n\tconst neverTree2: TreeNodeStoredSchema = new ObjectNodeStoredSchema(\n\t\tnew Map([[brand(\"x\"), neverField]]),\n\t);\n\n\tconst emptyTree = {\n\t\tname: brand<TreeNodeSchemaIdentifier>(\"empty\"),\n\t\tschema: new ObjectNodeStoredSchema(new Map()),\n\t};\n\n\tconst emptyLocalFieldTree = {\n\t\tname: brand<TreeNodeSchemaIdentifier>(\"emptyLocalFieldTree\"),\n\t\tschema: new ObjectNodeStoredSchema(new Map([[brand(\"x\"), storedEmptyFieldSchema]])),\n\t};\n\n\tconst optionalLocalFieldTree = {\n\t\tname: brand<TreeNodeSchemaIdentifier>(\"optionalLocalFieldTree\"),\n\t\tschema: new ObjectNodeStoredSchema(\n\t\t\tnew Map([[brand(\"x\"), fieldSchema(FieldKinds.optional, [emptyTree.name])]]),\n\t\t),\n\t};\n\tconst valueLocalFieldTree = {\n\t\tname: brand<TreeNodeSchemaIdentifier>(\"valueLocalFieldTree\"),\n\t\tschema: new ObjectNodeStoredSchema(\n\t\t\tnew Map([[brand(\"x\"), fieldSchema(FieldKinds.required, [emptyTree.name])]]),\n\t\t),\n\t};\n\tconst valueAnyField = fieldSchema(FieldKinds.required);\n\tconst valueEmptyTreeField = fieldSchema(FieldKinds.required, [emptyTree.name]);\n\tconst optionalAnyField = fieldSchema(FieldKinds.optional);\n\tconst optionalEmptyTreeField = fieldSchema(FieldKinds.optional, [emptyTree.name]);\n\n\tfunction updateTreeSchema(\n\t\trepo: MutableTreeStoredSchema,\n\t\tidentifier: TreeNodeSchemaIdentifier,\n\t\tschema: TreeNodeStoredSchema,\n\t) {\n\t\trepo.apply({\n\t\t\trootFieldSchema: repo.rootFieldSchema,\n\t\t\tnodeSchema: new Map([...repo.nodeSchema, [identifier, schema]]),\n\t\t});\n\t}\n\n\tit(\"allowsValueSuperset\", () => {\n\t\tassert.equal(\n\t\t\tgetOrdering(ValueSchema.FluidHandle, undefined, allowsValueSuperset),\n\t\t\tOrdering.Incomparable,\n\t\t);\n\t\tassert.equal(\n\t\t\tgetOrdering(ValueSchema.Boolean, undefined, allowsValueSuperset),\n\t\t\tOrdering.Incomparable,\n\t\t);\n\t\tassert.equal(\n\t\t\tgetOrdering(ValueSchema.Number, undefined, allowsValueSuperset),\n\t\t\tOrdering.Incomparable,\n\t\t);\n\t\tassert.equal(\n\t\t\tgetOrdering(ValueSchema.String, undefined, allowsValueSuperset),\n\t\t\tOrdering.Incomparable,\n\t\t);\n\t\tassert.equal(\n\t\t\tgetOrdering(ValueSchema.Null, undefined, allowsValueSuperset),\n\t\t\tOrdering.Incomparable,\n\t\t);\n\t\ttestPartialOrder<ValueSchema | undefined>(allowsValueSuperset, [\n\t\t\tValueSchema.Boolean,\n\t\t\tValueSchema.Number,\n\t\t\tValueSchema.String,\n\t\t\tValueSchema.FluidHandle,\n\t\t\tValueSchema.Null,\n\t\t]);\n\t});\n\n\tit(\"allowsTypesSuperset\", () => {\n\t\ttestOrder(allowsTreeSchemaIdentifierSuperset, [\n\t\t\tnew Set(),\n\t\t\tnew Set([brand(\"1\")]),\n\t\t\tnew Set([brand(\"1\"), brand(\"2\")]),\n\t\t\tundefined,\n\t\t]);\n\t\tconst neverSet: TreeTypeSet = new Set();\n\t\tconst neverSet2: TreeTypeSet = new Set();\n\t\ttestPartialOrder(\n\t\t\tallowsTreeSchemaIdentifierSuperset,\n\t\t\t[\n\t\t\t\tneverSet,\n\t\t\t\tneverSet2,\n\t\t\t\tnew Set([brand(\"1\")]),\n\t\t\t\tnew Set([brand(\"2\")]),\n\t\t\t\tnew Set([brand(\"1\"), brand(\"2\")]),\n\t\t\t\tundefined,\n\t\t\t],\n\t\t\t[[neverSet, neverSet2]],\n\t\t);\n\t});\n\n\tit(\"allowsFieldSuperset\", () => {\n\t\tconst repo = new TreeStoredSchemaRepository();\n\t\tupdateTreeSchema(repo, brand(\"never\"), neverTree);\n\t\tupdateTreeSchema(repo, emptyTree.name, emptyTree.schema);\n\t\tconst neverField2: TreeFieldStoredSchema = fieldSchema(FieldKinds.required, [\n\t\t\tbrand(\"never\"),\n\t\t]);\n\t\tconst compare = (a: TreeFieldStoredSchema, b: TreeFieldStoredSchema): boolean =>\n\t\t\tallowsFieldSuperset(defaultSchemaPolicy, repo, a, b);\n\t\ttestOrder(compare, [\n\t\t\tneverField,\n\t\t\tstoredEmptyFieldSchema,\n\t\t\toptionalEmptyTreeField,\n\t\t\toptionalAnyField,\n\t\t\tanyField,\n\t\t]);\n\t\ttestOrder(compare, [neverField, valueEmptyTreeField, valueAnyField, anyField]);\n\t\tassert.equal(\n\t\t\tgetOrdering(valueEmptyTreeField, storedEmptyFieldSchema, compare),\n\t\t\tOrdering.Incomparable,\n\t\t);\n\t\ttestPartialOrder(\n\t\t\tcompare,\n\t\t\t[\n\t\t\t\tneverField,\n\t\t\t\tneverField2,\n\t\t\t\tstoredEmptyFieldSchema,\n\t\t\t\tanyField,\n\t\t\t\tvalueEmptyTreeField,\n\t\t\t\tvalueAnyField,\n\t\t\t\tvalueEmptyTreeField,\n\t\t\t\tvalueAnyField,\n\t\t\t],\n\t\t\t[[neverField, neverField2]],\n\t\t);\n\t});\n\n\tit(\"allowsTreeSuperset-no leaf values\", () => {\n\t\tconst repo = new TreeStoredSchemaRepository();\n\t\tupdateTreeSchema(repo, emptyTree.name, emptyTree.schema);\n\t\tconst compare = (\n\t\t\ta: TreeNodeStoredSchema | undefined,\n\t\t\tb: TreeNodeStoredSchema | undefined,\n\t\t): boolean => allowsTreeSuperset(defaultSchemaPolicy, repo, a, b);\n\t\ttestOrder(compare, [\n\t\t\tneverTree,\n\t\t\temptyTree.schema,\n\t\t\toptionalLocalFieldTree.schema,\n\t\t\tanyTreeWithoutValue,\n\t\t]);\n\t\ttestPartialOrder(\n\t\t\tcompare,\n\t\t\t[\n\t\t\t\tneverTree,\n\t\t\t\tneverTree2,\n\t\t\t\tundefined,\n\t\t\t\tanyTreeWithoutValue,\n\t\t\t\temptyTree.schema,\n\t\t\t\temptyLocalFieldTree.schema,\n\t\t\t\toptionalLocalFieldTree.schema,\n\t\t\t\tvalueLocalFieldTree.schema,\n\t\t\t],\n\t\t\t[\n\t\t\t\t[neverTree, neverTree2, undefined],\n\t\t\t\t[emptyTree.schema, emptyLocalFieldTree.schema],\n\t\t\t],\n\t\t);\n\t});\n\n\tit(\"allowsTreeSuperset-leaf values\", () => {\n\t\tconst repo = new TreeStoredSchemaRepository();\n\t\tupdateTreeSchema(repo, emptyTree.name, emptyTree.schema);\n\t\tconst compare = (\n\t\t\ta: TreeNodeStoredSchema | undefined,\n\t\t\tb: TreeNodeStoredSchema | undefined,\n\t\t): boolean => allowsTreeSuperset(defaultSchemaPolicy, repo, a, b);\n\t\ttestOrder(compare, [neverTree, numberLeaf]);\n\t\ttestPartialOrder(\n\t\t\tcompare,\n\t\t\t[neverTree, neverTree2, undefined, numberLeaf],\n\t\t\t[[neverTree, neverTree2, undefined]],\n\t\t);\n\t});\n});\n\nenum Ordering {\n\tSubset,\n\tEqual,\n\tIncomparable,\n\tSuperset,\n}\n\nfunction getOrdering<T>(\n\toriginal: T,\n\tsuperset: T,\n\tallowsSuperset: (a: T, b: T) => boolean,\n): Ordering {\n\tassert(allowsSuperset(original, original));\n\tassert(allowsSuperset(superset, superset));\n\tconst a = allowsSuperset(original, superset);\n\tconst b = allowsSuperset(superset, original);\n\tif (a && b) {\n\t\treturn Ordering.Equal;\n\t}\n\tif (a && !b) {\n\t\treturn Ordering.Superset;\n\t}\n\tif (!a && b) {\n\t\treturn Ordering.Subset;\n\t}\n\treturn Ordering.Incomparable;\n}\n\nfunction testOrder<T>(compare: (a: T, b: T) => boolean, inOrder: T[]): void {\n\tfor (let index = 0; index < inOrder.length - 1; index++) {\n\t\tconst order = getOrdering(inOrder[index], inOrder[index + 1], compare);\n\t\tif (order !== Ordering.Superset) {\n\t\t\tassert.fail(\n\t\t\t\t`expected ${JSON.stringify(\n\t\t\t\t\tintoSimpleObject(inOrder[index + 1]),\n\t\t\t\t)} to be a superset of ${JSON.stringify(\n\t\t\t\t\tintoSimpleObject(inOrder[index]),\n\t\t\t\t)} but was ${Ordering[order]}`,\n\t\t\t);\n\t\t}\n\t}\n}\n\n/**\n * Tests a comparison function, ensuring it produces a non-strict partial order over the provided values.\n * https://en.wikipedia.org/wiki/Partially_ordered_set#Non-strict_partial_order\n */\nfunction testPartialOrder<T>(\n\tcompare: (a: T, b: T) => boolean,\n\tvalues: T[],\n\texpectedEqual: T[][] = [],\n): void {\n\t// To be a strict partial order, the function must be:\n\t// Reflexivity: a ≤ a\n\t// Antisymmetry: if a ≤ b and b ≤ a then a = b\n\t// Transitivity: if a ≤ b  and  b ≤ c  then  a ≤ c\n\n\t// This is brute forced in O(n^3) time below:\n\t// Violations:\n\tconst reflexivity: T[] = [];\n\tconst antisymmetry: [boolean, T, T][] = [];\n\tconst transitivity: T[][] = [];\n\n\tconst expectedEqualMap: Map<T, Set<T>> = new Map();\n\tfor (const group of expectedEqual) {\n\t\tconst set = new Set(group);\n\t\tfor (const item of group) {\n\t\t\texpectedEqualMap.set(item, set);\n\t\t}\n\t}\n\n\tfor (const a of values) {\n\t\tif (!compare(a, a)) {\n\t\t\treflexivity.push(a);\n\t\t}\n\n\t\tfor (const b of values) {\n\t\t\tconst expectEqual = a === b || (expectedEqualMap.get(a)?.has(b) ?? false);\n\t\t\tif ((compare(a, b) && compare(b, a)) !== expectEqual) {\n\t\t\t\tantisymmetry.push([expectEqual, a, b] as [boolean, T, T]);\n\t\t\t}\n\n\t\t\tfor (const c of values) {\n\t\t\t\tif (compare(a, b) && compare(b, c)) {\n\t\t\t\t\tif (!compare(a, c)) {\n\t\t\t\t\t\ttransitivity.push([a, b, c]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tassert.deepEqual(intoSimpleObject(reflexivity), [], \"reflexivity\");\n\tassert.deepEqual(intoSimpleObject(antisymmetry), [], \"antisymmetry\");\n\tassert.deepEqual(intoSimpleObject(transitivity), [], \"transitivity\");\n}\n\n/**\n * Flatten maps and arrays into simple objects for better printing.\n */\nfunction intoSimpleObject(obj: unknown): unknown {\n\tif (typeof obj !== \"object\" || obj === null) {\n\t\treturn obj;\n\t}\n\tif (obj instanceof Array) {\n\t\treturn Array.from(obj, intoSimpleObject);\n\t}\n\tif (obj instanceof Map) {\n\t\treturn Array.from(obj, ([key, value]): [unknown, unknown] => [\n\t\t\tkey,\n\t\t\tintoSimpleObject(value),\n\t\t]);\n\t}\n\tif (obj instanceof Set) {\n\t\treturn Array.from(obj as ReadonlySet<string>);\n\t}\n\tconst out: Record<string, unknown> = {};\n\t// eslint-disable-next-line no-restricted-syntax\n\tfor (const key in obj) {\n\t\tif (Object.prototype.hasOwnProperty.call(obj, key)) {\n\t\t\tout[key] = intoSimpleObject((obj as Record<string, unknown>)[key]);\n\t\t}\n\t}\n\treturn out;\n}\n"]}

package/lib/test/feature-libraries/modular-schema/genericFieldKind.spec.d.ts

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

package/lib/test/feature-libraries/modular-schema/genericFieldKind.spec.d.ts.map

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

package/lib/test/feature-libraries/modular-schema/genericFieldKind.spec.js

@@ -1,345 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { genericFieldKind, MemoizedIdRangeAllocator, } from "../../../feature-libraries/index.js";
-import { makeAnonChange, } from "../../../core/index.js";
-import { fakeIdAllocator, brand, idAllocatorFromMaxId, } from "../../../util/index.js";
-import { defaultRevisionMetadataFromChanges, makeEncodingTestSuite, testRevisionTagCodec, } from "../../utils.js";
-import { valueField, valueHandler } from "./basicRebasers.js";
-import { testSnapshots } from "./genericFieldSnapshots.test.js";
-const valueFieldKey = brand("Value");
-const fieldA = brand("a");
-const valueChange0To1 = { old: 0, new: 1 };
-const valueChange1To0 = { old: 1, new: 0 };
-const valueChange1To2 = { old: 1, new: 2 };
-const valueChange2To1 = { old: 2, new: 1 };
-const valueChange0To2 = { old: 0, new: 2 };
-function nodeChangeFromValueChange(valueChange) {
-    return {
-        fieldChanges: new Map([
-            [
-                fieldA,
-                {
-                    fieldKind: valueField.identifier,
-                    change: brand(valueChange),
-                },
-            ],
-        ]),
-    };
-}
-function valueChangeFromNodeChange(nodeChange) {
-    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-    return nodeChange.fieldChanges.get(fieldA).change;
-}
-const nodeChange0To1 = nodeChangeFromValueChange(valueChange0To1);
-const nodeChange1To0 = nodeChangeFromValueChange(valueChange1To0);
-const nodeChange1To2 = nodeChangeFromValueChange(valueChange1To2);
-const nodeChange2To1 = nodeChangeFromValueChange(valueChange2To1);
-const nodeChange0To2 = nodeChangeFromValueChange(valueChange0To2);
-const unexpectedDelegate = () => assert.fail("Unexpected call");
-const revisionMetadata = {
-    getBaseRevisions: () => assert.fail("Unexpected revision info query"),
-    getIndex: () => assert.fail("Unexpected revision index query"),
-    tryGetInfo: () => assert.fail("Unexpected revision info query"),
-    hasRollback: () => assert.fail("Unexpected revision info query"),
-};
-const childComposer = (nodeChange1, nodeChange2) => {
-    if (nodeChange1 === undefined) {
-        assert(nodeChange2 !== undefined, "Should not compose two undefined changesets");
-        return nodeChange2;
-    }
-    else if (nodeChange2 === undefined) {
-        return nodeChange1;
-    }
-    const valueChange = valueHandler.rebaser.compose(makeAnonChange(valueChangeFromNodeChange(nodeChange1 ?? {})), makeAnonChange(valueChangeFromNodeChange(nodeChange2 ?? {})), unexpectedDelegate, fakeIdAllocator, crossFieldManager, revisionMetadata);
-    return nodeChangeFromValueChange(valueChange);
-};
-const childRebaser = (nodeChangeA, nodeChangeB) => {
-    if (nodeChangeA === undefined) {
-        return undefined;
-    }
-    if (nodeChangeB === undefined) {
-        return nodeChangeA;
-    }
-    const valueChangeA = valueChangeFromNodeChange(nodeChangeA);
-    const valueChangeB = valueChangeFromNodeChange(nodeChangeB);
-    const rebased = valueHandler.rebaser.rebase(valueChangeA, makeAnonChange(valueChangeB), unexpectedDelegate, fakeIdAllocator, crossFieldManager, revisionMetadata);
-    return nodeChangeFromValueChange(rebased);
-};
-const childToDelta = (nodeChange) => {
-    const valueChange = valueChangeFromNodeChange(nodeChange);
-    assert(typeof valueChange !== "number");
-    return deltaForValueChange(valueChange);
-};
-function deltaForValueChange(valueChange) {
-    return new Map([[valueFieldKey, valueHandler.intoDelta(makeAnonChange(valueChange))]]);
-}
-const crossFieldManager = {
-    get: unexpectedDelegate,
-    set: unexpectedDelegate,
-};
-describe("GenericField", () => {
-    testSnapshots();
-    describe("compose", () => {
-        it("Highest index on earlier change", () => {
-            const changeA = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange0To1,
-                },
-                {
-                    index: 2,
-                    nodeChange: nodeChange0To1,
-                },
-            ];
-            const changeB = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange1To2,
-                },
-                {
-                    index: 1,
-                    nodeChange: nodeChange1To2,
-                },
-            ];
-            const expected = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange0To2,
-                },
-                {
-                    index: 1,
-                    nodeChange: nodeChange1To2,
-                },
-                {
-                    index: 2,
-                    nodeChange: nodeChange0To1,
-                },
-            ];
-            const actual = genericFieldKind.changeHandler.rebaser.compose(makeAnonChange(changeA), makeAnonChange(changeB), childComposer, fakeIdAllocator, crossFieldManager, revisionMetadata);
-            assert.deepEqual(actual, expected);
-        });
-        it("Highest index on later change", () => {
-            const changeA = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange0To1,
-                },
-                {
-                    index: 1,
-                    nodeChange: nodeChange0To1,
-                },
-            ];
-            const changeB = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange1To2,
-                },
-                {
-                    index: 2,
-                    nodeChange: nodeChange1To2,
-                },
-            ];
-            const expected = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange0To2,
-                },
-                {
-                    index: 1,
-                    nodeChange: nodeChange0To1,
-                },
-                {
-                    index: 2,
-                    nodeChange: nodeChange1To2,
-                },
-            ];
-            const actual = genericFieldKind.changeHandler.rebaser.compose(makeAnonChange(changeA), makeAnonChange(changeB), childComposer, fakeIdAllocator, crossFieldManager, revisionMetadata);
-            assert.deepEqual(actual, expected);
-        });
-    });
-    describe("rebase", () => {
-        it("Highest index on earlier change", () => {
-            const changeA = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange0To2,
-                },
-                {
-                    index: 2,
-                    nodeChange: nodeChange1To2,
-                },
-            ];
-            const changeB = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange0To1,
-                },
-                {
-                    index: 1,
-                    nodeChange: nodeChange0To1,
-                },
-            ];
-            const expected = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange1To2,
-                },
-                {
-                    index: 2,
-                    nodeChange: nodeChange1To2,
-                },
-            ];
-            const actual = genericFieldKind.changeHandler.rebaser.rebase(changeA, makeAnonChange(changeB), childRebaser, fakeIdAllocator, crossFieldManager, revisionMetadata);
-            assert.deepEqual(actual, expected);
-        });
-        it("Highest index on later change", () => {
-            const changeA = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange0To2,
-                },
-                {
-                    index: 1,
-                    nodeChange: nodeChange1To2,
-                },
-            ];
-            const changeB = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange0To1,
-                },
-                {
-                    index: 2,
-                    nodeChange: nodeChange0To1,
-                },
-            ];
-            const expected = [
-                {
-                    index: 0,
-                    nodeChange: nodeChange1To2,
-                },
-                {
-                    index: 1,
-                    nodeChange: nodeChange1To2,
-                },
-            ];
-            const actual = genericFieldKind.changeHandler.rebaser.rebase(changeA, makeAnonChange(changeB), childRebaser, fakeIdAllocator, crossFieldManager, revisionMetadata);
-            assert.deepEqual(actual, expected);
-        });
-    });
-    it("invert", () => {
-        const forward = [
-            {
-                index: 0,
-                nodeChange: nodeChange0To1,
-            },
-            {
-                index: 1,
-                nodeChange: nodeChange1To2,
-            },
-        ];
-        const expected = [
-            {
-                index: 0,
-                nodeChange: nodeChange1To0,
-            },
-            {
-                index: 1,
-                nodeChange: nodeChange2To1,
-            },
-        ];
-        const taggedChange = makeAnonChange(forward);
-        const actual = genericFieldKind.changeHandler.rebaser.invert(taggedChange, (nodeChange) => {
-            if (nodeChange === nodeChange0To1) {
-                return nodeChange1To0;
-            }
-            if (nodeChange === nodeChange1To2) {
-                return nodeChange2To1;
-            }
-            assert.fail("Unexpected child change");
-        }, true, idAllocatorFromMaxId(), crossFieldManager, defaultRevisionMetadataFromChanges([taggedChange]));
-        assert.deepEqual(actual, expected);
-    });
-    it("intoDelta", () => {
-        const input = [
-            {
-                index: 0,
-                nodeChange: nodeChange0To1,
-            },
-            {
-                index: 2,
-                nodeChange: nodeChange1To2,
-            },
-        ];
-        const expected = {
-            local: [
-                { count: 1, fields: deltaForValueChange(valueChange0To1) },
-                { count: 1 },
-                { count: 1, fields: deltaForValueChange(valueChange1To2) },
-            ],
-        };
-        const actual = genericFieldKind.changeHandler.intoDelta(makeAnonChange(input), childToDelta, MemoizedIdRangeAllocator.fromNextId());
-        assert.deepEqual(actual, expected);
-    });
-    describe("Encoding", () => {
-        const encodingTestData = {
-            successes: [
-                [
-                    "Misc",
-                    [
-                        {
-                            index: 0,
-                            nodeChange: nodeChange0To1,
-                        },
-                        {
-                            index: 2,
-                            nodeChange: nodeChange1To2,
-                        },
-                    ],
-                    { originatorId: "session1" },
-                ],
-            ],
-        };
-        const leafCodec = valueHandler.codecsFactory().resolve(0).json;
-        const childCodec = {
-            encode: (nodeChange, context) => {
-                const valueChange = valueChangeFromNodeChange(nodeChange);
-                return leafCodec.encode(valueChange, context);
-            },
-            decode: (nodeChange, originatorId) => {
-                const valueChange = leafCodec.decode(nodeChange, originatorId);
-                return nodeChangeFromValueChange(valueChange);
-            },
-        };
-        makeEncodingTestSuite(genericFieldKind.changeHandler.codecsFactory(childCodec, testRevisionTagCodec), encodingTestData);
-    });
-    it("build child change", () => {
-        const change0 = genericFieldKind.changeHandler.editor.buildChildChange(0, nodeChange0To1);
-        const change1 = genericFieldKind.changeHandler.editor.buildChildChange(1, nodeChange0To1);
-        const change2 = genericFieldKind.changeHandler.editor.buildChildChange(2, nodeChange0To1);
-        assert.deepEqual(change0, [{ index: 0, nodeChange: nodeChange0To1 }]);
-        assert.deepEqual(change1, [{ index: 1, nodeChange: nodeChange0To1 }]);
-        assert.deepEqual(change2, [{ index: 2, nodeChange: nodeChange0To1 }]);
-    });
-    it("relevantRemovedRoots", () => {
-        const actual = genericFieldKind.changeHandler.relevantRemovedRoots(makeAnonChange([
-            {
-                index: 0,
-                nodeChange: nodeChange0To1,
-            },
-            {
-                index: 2,
-                nodeChange: nodeChange1To2,
-            },
-        ]), (child) => child === nodeChange0To1
-            ? [{ minor: 42 }]
-            : child === nodeChange1To2
-                ? [{ minor: 43 }]
-                : assert.fail("Unexpected child"));
-        assert.deepEqual(Array.from(actual), [{ minor: 42 }, { minor: 43 }]);
-    });
-});
-//# sourceMappingURL=genericFieldKind.spec.js.map