@fluid-experimental/tree 2.0.0-rc.2.0.1 → 2.0.0-rc.3.0.0

package/lib/test/EditUtilities.tests.js

@@ -1,512 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { assert } from '@fluidframework/core-utils';
-import { MockFluidDataStoreRuntime } from '@fluidframework/test-runtime-utils';
-import { FluidSerializer } from '@fluidframework/shared-object-base';
-import { getChangeNodeFromView } from '../SerializationUtilities.js';
-import { noop } from '../Common.js';
-import { convertTreeNodes, deepCompareNodes, internalizeBuildNode, PlaceValidationResult, RangeValidationResultKind, validateStablePlace, validateStableRange, walkTree, } from '../EditUtilities.js';
-import { Side } from '../persisted-types/index.js';
-import { comparePayloads } from '../PayloadUtilities.js';
-import { refreshTestTree } from './utilities/TestUtilities.js';
-describe('EditUtilities', () => {
-    const testTree = refreshTestTree(undefined, undefined, /* expensiveValidation: */ true);
-    describe('validateStablePlace', () => {
-        it('accepts valid places', () => {
-            expect(validateStablePlace(testTree.view, {
-                referenceSibling: testTree.left.identifier,
-                side: Side.Before,
-            })).deep.equals({
-                result: PlaceValidationResult.Valid,
-                referenceSibling: testTree.left.identifier,
-                side: Side.Before,
-            });
-        });
-        it('detects malformed places', () => {
-            expect(validateStablePlace(testTree.view, {
-                referenceTrait: testTree.left.traitLocation,
-                referenceSibling: testTree.left.identifier,
-                side: Side.Before,
-            })).deep.equals({ result: PlaceValidationResult.Malformed });
-        });
-        it('detects missing siblings', () => {
-            expect(validateStablePlace(testTree.view, {
-                referenceSibling: testTree.generateNodeId(),
-                side: Side.Before,
-            })).deep.equals({ result: PlaceValidationResult.MissingSibling });
-        });
-        it('detects missing parents', () => {
-            expect(validateStablePlace(testTree.view, {
-                referenceTrait: {
-                    parent: testTree.generateNodeId(),
-                    label: testTree.left.traitLabel,
-                },
-                side: Side.Before,
-            })).deep.equals({ result: PlaceValidationResult.MissingParent });
-        });
-        it('detects root places', () => {
-            expect(validateStablePlace(testTree.view, {
-                referenceSibling: testTree.identifier,
-                side: Side.Before,
-            })).deep.equals({ result: PlaceValidationResult.SiblingIsRootOrDetached });
-        });
-    });
-    describe('validateStableRange', () => {
-        it('accepts valid ranges', () => {
-            const validatedRange = validateStableRange(testTree.view, {
-                start: { referenceSibling: testTree.left.identifier, side: Side.Before },
-                end: { referenceSibling: testTree.left.identifier, side: Side.After },
-            });
-            expect(validatedRange.result).to.equal(RangeValidationResultKind.Valid);
-            if (validatedRange.result === RangeValidationResultKind.Valid) {
-                expect(validatedRange.start.referenceSibling).to.equal(testTree.left.identifier);
-                expect(validatedRange.start.referenceTrait).to.be.undefined;
-                expect(validatedRange.start.side).to.equal(Side.Before);
-                expect(validatedRange.end.referenceSibling).to.equal(testTree.left.identifier);
-                expect(validatedRange.end.referenceTrait).to.be.undefined;
-                expect(validatedRange.end.side).to.equal(Side.After);
-            }
-            else {
-                expect.fail();
-            }
-        });
-        it('detects inverted ranges', () => {
-            expect(validateStableRange(testTree.view, {
-                start: { referenceSibling: testTree.left.identifier, side: Side.After },
-                end: { referenceSibling: testTree.left.identifier, side: Side.Before },
-            })).deep.equals({ result: RangeValidationResultKind.Inverted });
-        });
-        it('detects when place are in different traits', () => {
-            expect(validateStableRange(testTree.view, {
-                start: { referenceSibling: testTree.left.identifier, side: Side.Before },
-                end: { referenceSibling: testTree.right.identifier, side: Side.After },
-            })).deep.equals({ result: RangeValidationResultKind.PlacesInDifferentTraits });
-        });
-        it('detects malformed places', () => {
-            const start = {
-                referenceTrait: testTree.left.traitLocation,
-                referenceSibling: testTree.left.identifier,
-                side: Side.Before,
-            };
-            expect(validateStableRange(testTree.view, {
-                // trait and sibling should be mutually exclusive
-                start,
-                end: { referenceSibling: testTree.left.identifier, side: Side.After },
-            })).deep.equals({
-                result: {
-                    kind: RangeValidationResultKind.BadPlace,
-                    place: start,
-                    placeFailure: PlaceValidationResult.Malformed,
-                },
-            });
-        });
-        it('detects invalid places', () => {
-            const start = {
-                referenceSibling: testTree.generateNodeId(),
-                side: Side.Before,
-            };
-            expect(validateStableRange(testTree.view, {
-                start,
-                end: { referenceSibling: testTree.right.identifier, side: Side.After },
-            })).deep.equals({
-                result: {
-                    kind: RangeValidationResultKind.BadPlace,
-                    place: start,
-                    placeFailure: PlaceValidationResult.MissingSibling,
-                },
-            });
-        });
-    });
-    describe('Tree node conversion', () => {
-        it('can clone a tree', () => {
-            const clone = convertTreeNodes(getChangeNodeFromView(testTree.view), (node) => ({
-                ...node,
-            }));
-            expect(testTree).to.not.equal(clone);
-            expect(deepCompareNodes(testTree, clone)).to.be.true;
-        });
-        it('can clone a leaf', () => {
-            let converted = false;
-            expect(convertTreeNodes(42, (n) => {
-                converted = true;
-                return n;
-            }, isNumber)).to.equal(42);
-            expect(converted).to.be.false;
-        });
-        it('can clone a tree with a leaf', () => {
-            const leafTrait = 'main';
-            const leafId = testTree.generateNodeId();
-            const tree = {
-                ...testTree.buildLeaf(testTree.generateNodeId()),
-                payload: 'payload',
-                traits: { [leafTrait]: [testTree.buildLeaf(leafId)] },
-            };
-            const clone = convertTreeNodes(tree, (node) => ({ ...node }));
-            assert(typeof clone !== 'number', 0x660 /*  */);
-            expect(clone.definition).to.equal(tree.definition);
-            expect(clone.identifier).to.equal(tree.identifier);
-            expect(clone.payload).to.equal(tree.payload);
-            expect(clone.traits[leafTrait][0].identifier).to.equal(leafId);
-        });
-        it('correctly invokes the convert function', () => {
-            const node = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'payload' };
-            let converted = false;
-            convertTreeNodes(node, (n) => {
-                converted = true;
-                expect(node.definition).to.equal(node.definition);
-                expect(node.identifier).to.equal(node.identifier);
-                expect(node.payload).to.equal(node.payload);
-                return n;
-            }, isNumber);
-            expect(converted).to.be.true;
-        });
-        it('can convert a node', () => {
-            const node = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'payload' };
-            const id = testTree.generateNodeId();
-            const converted = convertTreeNodes(node, (_) => ({ definition: '_def', identifier: id, payload: 'payload2' }), isNumber);
-            expect(converted).to.deep.equal({ definition: '_def', identifier: id, payload: 'payload2', traits: {} });
-        });
-        it('creates empty trait objects for the root', () => {
-            const node = { ...testTree.buildLeaf(testTree.generateNodeId()) };
-            const converted = convertTreeNodes(node, (n) => internalizeBuildNode(n, testTree), isNumber);
-            assert(typeof converted !== 'number', 0x661 /* unexpected detached ID */);
-            expect(converted.traits).to.not.be.undefined;
-        });
-        it('creates empty trait objects for children', () => {
-            const node = { ...testTree.buildLeaf(), traits: { main: { ...testTree.buildLeaf() } } };
-            const converted = convertTreeNodes(node, (n) => internalizeBuildNode(n, testTree), isNumber);
-            assert(typeof converted !== 'number', 0x662 /* unexpected detached ID */);
-            expect(converted.traits).to.not.be.undefined;
-        });
-        it('can convert a tree with children', () => {
-            const childA = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'a' };
-            const childB = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'b' };
-            const node = { ...testTree.buildLeaf(testTree.generateNodeId()), traits: { main: [childA, childB] } };
-            const converted = convertTreeNodes(node, (node) => {
-                if (node.identifier === childB.identifier) {
-                    return { definition: node.definition, identifier: node.identifier, payload: 'c' };
-                }
-                return node;
-            });
-            expect(converted).to.deep.equal({
-                definition: node.definition,
-                identifier: node.identifier,
-                traits: {
-                    main: [
-                        { definition: childA.definition, identifier: childA.identifier, payload: 'a', traits: {} },
-                        { definition: childB.definition, identifier: childB.identifier, payload: 'c', traits: {} },
-                    ],
-                },
-            });
-        });
-        it('can convert a tree with a grandchild', () => {
-            const grandchild = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'g' };
-            const child = { ...testTree.buildLeaf(testTree.generateNodeId()), traits: { main: [grandchild] } };
-            const parent = { ...testTree.buildLeaf(testTree.generateNodeId()), traits: { main: [child] } };
-            const converted = convertTreeNodes(parent, (node) => {
-                if (node.identifier === grandchild.identifier) {
-                    return { definition: node.definition, identifier: node.identifier, payload: 'h' };
-                }
-                return node;
-            });
-            expect(converted).to.deep.equal({
-                definition: parent.definition,
-                identifier: parent.identifier,
-                traits: {
-                    main: [
-                        {
-                            definition: child.definition,
-                            identifier: child.identifier,
-                            traits: {
-                                main: [
-                                    {
-                                        definition: grandchild.definition,
-                                        identifier: grandchild.identifier,
-                                        payload: 'h',
-                                        traits: {},
-                                    },
-                                ],
-                            },
-                        },
-                    ],
-                },
-            });
-        });
-        it('walks trees in a consistent order', () => {
-            // Construct two trees that are the same but have their traits defined in different orders
-            const buildTreeA = {
-                definition: 'parent',
-                traits: {
-                    left: {
-                        definition: 'left child',
-                        traits: {
-                            left: {
-                                definition: 'left grandchild under left',
-                            },
-                            right: {
-                                definition: 'right grandchild under left',
-                            },
-                            main: [
-                                { definition: 'grandchild A under left main' },
-                                { definition: 'grandchild B under left main' },
-                                { definition: 'grandchild C under left main' },
-                            ],
-                        },
-                    },
-                    right: {
-                        definition: 'right child',
-                        traits: {
-                            left: {
-                                definition: 'left grandchild under right',
-                            },
-                            right: {
-                                definition: 'right grandchild under right',
-                            },
-                            main: [
-                                { definition: 'grandchild A under right main' },
-                                { definition: 'grandchild B under right main' },
-                                { definition: 'grandchild C under right main' },
-                            ],
-                        },
-                    },
-                    main: [
-                        { definition: 'child A under main' },
-                        { definition: 'child B under main' },
-                        { definition: 'child C under main' },
-                    ],
-                },
-            };
-            const buildTreeB = {
-                definition: 'parent',
-                traits: {
-                    right: {
-                        definition: 'right child',
-                        traits: {
-                            left: {
-                                definition: 'left grandchild under right',
-                            },
-                            main: [
-                                { definition: 'grandchild A under right main' },
-                                { definition: 'grandchild B under right main' },
-                                { definition: 'grandchild C under right main' },
-                            ],
-                            right: {
-                                definition: 'right grandchild under right',
-                            },
-                        },
-                    },
-                    main: [
-                        { definition: 'child A under main' },
-                        { definition: 'child B under main' },
-                        { definition: 'child C under main' },
-                    ],
-                    left: {
-                        definition: 'left child',
-                        traits: {
-                            main: [
-                                { definition: 'grandchild A under left main' },
-                                { definition: 'grandchild B under left main' },
-                                { definition: 'grandchild C under left main' },
-                            ],
-                            right: {
-                                definition: 'right grandchild under left',
-                            },
-                            left: {
-                                definition: 'left grandchild under left',
-                            },
-                        },
-                    },
-                },
-            };
-            // Record the order in which the tree walk visits each node in each tree
-            const definitionsA = [];
-            walkTree(buildTreeA, (n) => definitionsA.push(n.definition), (x) => typeof x === 'number');
-            const definitionsB = [];
-            walkTree(buildTreeB, (n) => definitionsB.push(n.definition), (x) => typeof x === 'number');
-            // The orders should be the same, even though the trees had their traits defined in different orders
-            expect(definitionsA).to.deep.equal(definitionsB);
-        });
-    });
-    describe('Build tree internalization', () => {
-        it('does not copy extraneous properties from input tree', () => {
-            const node = {
-                ...testTree.buildLeaf(testTree.generateNodeId()),
-                traits: { main: [testTree.buildLeaf(testTree.generateNodeId())] },
-            };
-            node.extra = 'This is extra data that should not be copied';
-            const converted = convertTreeNodes(node, (node) => internalizeBuildNode(node, testTree), isNumber);
-            expect(converted).to.deep.equal({
-                definition: node.definition,
-                identifier: node.identifier,
-                traits: node.traits,
-            });
-        });
-        it('does not copy extraneous properties from converter', () => {
-            const node = testTree.buildLeaf(testTree.generateNodeId());
-            expect(Object.prototype.hasOwnProperty.call(node, 'payload')).to.be.false;
-            const converted = convertTreeNodes(node, (node) => internalizeBuildNode(node, testTree), isNumber);
-            expect(Object.prototype.hasOwnProperty.call(converted, 'payload')).to.be.false;
-        });
-    });
-    function isNumber(node) {
-        return typeof node === 'number';
-    }
-    describe('comparePayloads', () => {
-        const serializer = new FluidSerializer(new MockFluidDataStoreRuntime().IFluidHandleContext, () => { });
-        const binder = { bind: noop };
-        let Equality;
-        (function (Equality) {
-            Equality[Equality["Equal"] = 0] = "Equal";
-            Equality[Equality["Unequal"] = 1] = "Unequal";
-            Equality[Equality["Unspecified"] = 2] = "Unspecified";
-        })(Equality || (Equality = {}));
-        function checkEquality(equal, equality) {
-            if (equality !== Equality.Unspecified) {
-                expect(equal).equals(equality === Equality.Equal);
-            }
-        }
-        function check(a, b, flags) {
-            // Check reflexive
-            expect(comparePayloads(a, a)).equal(true);
-            expect(comparePayloads(b, b)).equal(true);
-            checkEquality(comparePayloads(a, b), flags.initial);
-            // Check commutative
-            checkEquality(comparePayloads(b, a), flags.initial);
-            const [aString, aDeserialized] = checkSerialization(a, flags.roundtrip);
-            const [bString, bDeserialized] = checkSerialization(b, flags.roundtrip);
-            checkEquality(aString === bString, flags.serialized);
-            checkEquality(comparePayloads(aDeserialized, bDeserialized), flags.deserialized);
-            // Check commutative
-            checkEquality(comparePayloads(bDeserialized, aDeserialized), flags.deserialized);
-        }
-        function checkSerialization(a, roundtrip) {
-            const aString = serializer.stringify(a, binder);
-            const a2 = serializer.parse(aString);
-            const aString2 = serializer.stringify(a2, binder);
-            expect(aString2).equal(aString);
-            checkEquality(comparePayloads(a, a2), roundtrip);
-            // Check second round trip, should always be equal
-            const a3 = serializer.parse(aString2);
-            expect(comparePayloads(a3, a2)).true;
-            return [aString, a2];
-        }
-        const allEqual = {
-            initial: Equality.Equal,
-            serialized: Equality.Equal,
-            deserialized: Equality.Equal,
-            roundtrip: Equality.Equal,
-        };
-        // For when the inputs are logically equal, but may serialize differently due to field ordering.
-        const allEqualUnstable = {
-            initial: Equality.Equal,
-            serialized: Equality.Unspecified,
-            deserialized: Equality.Equal,
-            roundtrip: Equality.Equal,
-        };
-        const allUnequal = {
-            initial: Equality.Unequal,
-            serialized: Equality.Unequal,
-            deserialized: Equality.Unequal,
-            roundtrip: Equality.Equal,
-        };
-        it('compares numbers correctly', () => {
-            check(0, 0, allEqual);
-            check(1, 1, allEqual);
-            check(0, 1, allUnequal);
-            check(-1, 1, allUnequal);
-            check(5.2, 5.200000001, allUnequal);
-        });
-        it('compares strings', () => {
-            check('', '', allEqual);
-            check(' ', '', allUnequal);
-            check('1', '+1', allUnequal);
-            // This character makes sure multi-byte utf-8 and multi-word utf-16 at least somewhat work
-            // Cases like unicode normalization are not covered here here. Normalization or not will be considered ok.
-            check('𤭢', '𤭢', allEqual);
-            check('𤭢', '', allUnequal);
-            check('several characters', 'several characters', allEqual);
-            check('several characters', 'several_characters', allUnequal);
-        });
-        it('compares arrays', () => {
-            check([], [], allEqual);
-            check([1], [1], allEqual);
-            check([[1]], [[1]], allEqual);
-            check([[1]], [[2]], allUnequal);
-            check([], [1], allUnequal);
-            check([1, 2], [2, 1], allUnequal);
-        });
-        it('compares objects', () => {
-            check({ 1: 'x' }, { 1: 'x' }, allEqual);
-            check({ x: 'x' }, { y: 'x' }, allUnequal);
-            check({ x: 'x' }, { x: {} }, allUnequal);
-            check({ x: {} }, { x: {} }, allEqual);
-            check({ x: [1, 2, 3, 5] }, { x: [1, 2, 3, 4] }, allUnequal);
-            check({ 1: 'x' }, {}, allUnequal);
-            check({ x: 'x' }, { x: 'x', y: 'x' }, allUnequal);
-            check({ field: 'a' }, { field: 'b' }, allUnequal);
-            // Fluid Serialization arbitrarily orders fields.
-            // Thus any object with more than one field may have non-deterministic serialization.
-            // However objects have field order, and we need to check comparePayloads is not impacted by it.
-            check({ y: 'a', x: 'b' }, { x: 'b', y: 'a' }, allEqualUnstable);
-        });
-        it('compares mixed types', () => {
-            check({ 0: 1 }, [1], allUnequal);
-            // Rationale: 'undefined' is reserved for future use (see 'SetValue' interface)
-            check(null, 'null', allUnequal);
-            check(null, 'null', allUnequal);
-            check(1, '1', allUnequal);
-            check(null, 0, allUnequal);
-            check('', 0, allUnequal);
-        });
-        const sameAfter = {
-            initial: Equality.Unspecified,
-            serialized: Equality.Unspecified,
-            deserialized: Equality.Equal,
-            roundtrip: Equality.Unspecified,
-        };
-        const differentAfter = {
-            initial: Equality.Unequal,
-            serialized: Equality.Unequal,
-            deserialized: Equality.Unequal,
-            roundtrip: Equality.Unspecified,
-        };
-        it('lossy cases', () => {
-            // Undefined fields are omitted in json, and thus lost on the round trip.
-            check({ x: undefined }, { y: undefined }, sameAfter);
-            check({ x: undefined }, {}, sameAfter);
-            // NaN and Infinity become null
-            check(NaN, NaN, sameAfter);
-            check(NaN, 7, differentAfter);
-            check(Infinity, Infinity, sameAfter);
-            check(-Infinity, Infinity, sameAfter);
-            check(NaN, 'NaN', differentAfter);
-            // json loses -0 on round trip
-            check(-0, -0, sameAfter);
-        });
-        it('compares handles', () => {
-            // This is used instead of MockHandle so equal handles compare deeply equal.
-            function makeMockHandle(data) {
-                // `/` prefix is needed to prevent serializing from modifying handle.
-                const handleObject = { absolutePath: `/${data}`, IFluidHandle: undefined };
-                handleObject.IFluidHandle = handleObject;
-                return handleObject;
-            }
-            // Theoretically handles serialize as objects with 2 fields and thus serialization is allowed to be non-deterministic
-            // so use allEqualUnstable not allEqual.
-            check(makeMockHandle('x'), makeMockHandle('x'), allEqualUnstable);
-            check(makeMockHandle('x'), makeMockHandle('y'), allUnequal);
-            check({ x: makeMockHandle('x') }, makeMockHandle('x'), allUnequal);
-        });
-        // These are cases that are allowed by the type system and produce unexpected results due to Json serialization.
-        // Clear documentation and/or adjustments to equality, type checking or serialization would help with these cases.
-        it.skip('strange cases', () => {
-            // Top level undefined fails in JSON.parse.
-            // Rationale: 'undefined' is reserved for future use (see 'SetValue' interface.)
-            check(undefined, null, sameAfter);
-        });
-    });
-});
-//# sourceMappingURL=EditUtilities.tests.js.map

package/lib/test/EditUtilities.tests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"EditUtilities.tests.js","sourceRoot":"","sources":["../../src/test/EditUtilities.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AAEpD,OAAO,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,EAAE,eAAe,EAAE,MAAM,oCAAoC,CAAC;AAErE,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AACrE,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AACpC,OAAO,EACN,gBAAgB,EAChB,gBAAgB,EAChB,oBAAoB,EACpB,qBAAqB,EACrB,yBAAyB,EACzB,mBAAmB,EACnB,mBAAmB,EACnB,QAAQ,GACR,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAA0C,IAAI,EAAY,MAAM,6BAA6B,CAAC;AAErG,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAE/D,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC9B,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,SAAS,EAAE,0BAA0B,CAAC,IAAI,CAAC,CAAC;IAExF,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACpC,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC;gBACb,MAAM,EAAE,qBAAqB,CAAC,KAAK;gBACnC,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,cAAc,EAAE,QAAQ,CAAC,IAAI,CAAC,aAAa;gBAC3C,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,qBAAqB,CAAC,SAAS,EAAE,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,gBAAgB,EAAE,QAAQ,CAAC,cAAc,EAAE;gBAC3C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,qBAAqB,CAAC,cAAc,EAAE,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,cAAc,EAAE;oBACf,MAAM,EAAE,QAAQ,CAAC,cAAc,EAAE;oBACjC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;iBAC/B;gBACD,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,qBAAqB,CAAC,aAAa,EAAE,CAAC,CAAC;QAChE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,gBAAgB,EAAE,QAAQ,CAAC,UAAU;gBACrC,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,qBAAqB,CAAC,uBAAuB,EAAE,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACpC,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,cAAc,GAAG,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBACzD,KAAK,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;gBACxE,GAAG,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;aACrE,CAAC,CAAC;YACH,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,CAAC;YACxE,IAAI,cAAc,CAAC,MAAM,KAAK,yBAAyB,CAAC,KAAK,EAAE;gBAC9D,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACjF,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAC5D,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACxD,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC/E,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAC1D,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACrD;iBAAM;gBACN,MAAM,CAAC,IAAI,EAAE,CAAC;aACd;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,KAAK,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;gBACvE,GAAG,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;aACtE,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,yBAAyB,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACrD,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,KAAK,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;gBACxE,GAAG,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;aACtE,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,yBAAyB,CAAC,uBAAuB,EAAE,CAAC,CAAC;QAC9E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,KAAK,GAAG;gBACb,cAAc,EAAE,QAAQ,CAAC,IAAI,CAAC,aAAa;gBAC3C,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC;YACF,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,iDAAiD;gBACjD,KAAK;gBACL,GAAG,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;aACrE,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC;gBACb,MAAM,EAAE;oBACP,IAAI,EAAE,yBAAyB,CAAC,QAAQ;oBACxC,KAAK,EAAE,KAAK;oBACZ,YAAY,EAAE,qBAAqB,CAAC,SAAS;iBAC7C;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG;gBACb,gBAAgB,EAAE,QAAQ,CAAC,cAAc,EAAE;gBAC3C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC;YACF,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,KAAK;gBACL,GAAG,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;aACtE,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC;gBACb,MAAM,EAAE;oBACP,IAAI,EAAE,yBAAyB,CAAC,QAAQ;oBACxC,KAAK,EAAE,KAAK;oBACZ,YAAY,EAAE,qBAAqB,CAAC,cAAc;iBAClD;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;QACrC,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,MAAM,KAAK,GAAG,gBAAgB,CAAyB,qBAAqB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBACvG,GAAG,IAAI;aACP,CAAC,CAAC,CAAC;YACJ,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACtD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,MAAM,CACL,gBAAgB,CACf,EAAE,EACF,CAAC,CAAC,EAAE,EAAE;gBACL,SAAS,GAAG,IAAI,CAAC;gBACjB,OAAO,CAAC,CAAC;YACV,CAAC,EACD,QAAQ,CACR,CACD,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACf,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACvC,MAAM,SAAS,GAAG,MAAM,CAAC;YACzB,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG;gBACZ,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC;gBAChD,OAAO,EAAE,SAAS;gBAClB,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE;aACrD,CAAC;YACF,MAAM,KAAK,GAAG,gBAAgB,CAAyB,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC;YACtF,MAAM,CAAC,OAAO,KAAK,KAAK,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAChD,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACnD,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACnD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAChE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YACjD,MAAM,IAAI,GAAG,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;YACtF,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,gBAAgB,CACf,IAAI,EACJ,CAAC,CAAC,EAAE,EAAE;gBACL,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAClD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAClD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC5C,OAAO,CAAC,CAAC;YACV,CAAC,EACD,QAAQ,CACR,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,IAAI,GAAG,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;YACtF,MAAM,EAAE,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACrC,MAAM,SAAS,GAAG,gBAAgB,CACjC,IAAI,EACJ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,MAAoB,EAAE,UAAU,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,EAClF,QAAQ,CACR,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1G,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YACnD,MAAM,IAAI,GAAkB,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,CAAC;YACjF,MAAM,SAAS,GAAG,gBAAgB,CACjC,IAAI,EACJ,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,QAAQ,CAAC,EACxC,QAAQ,CACR,CAAC;YACF,MAAM,CAAC,OAAO,SAAS,KAAK,QAAQ,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;YAC1E,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YACnD,MAAM,IAAI,GAAc,EAAE,GAAG,QAAQ,CAAC,SAAS,EAAE,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,EAAE,GAAG,QAAQ,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC;YACnG,MAAM,SAAS,GAAG,gBAAgB,CACjC,IAAI,EACJ,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,QAAQ,CAAC,EACxC,QAAQ,CACR,CAAC;YACF,MAAM,CAAC,OAAO,SAAS,KAAK,QAAQ,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;YAC1E,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC3C,MAAM,MAAM,GAAG,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;YAClF,MAAM,MAAM,GAAG,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;YAClF,MAAM,IAAI,GAAG,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC;YACtG,MAAM,SAAS,GAAG,gBAAgB,CAAyB,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;gBACzE,IAAI,IAAI,CAAC,UAAU,KAAK,MAAM,CAAC,UAAU,EAAE;oBAC1C,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;iBAClF;gBACD,OAAO,IAAI,CAAC;YACb,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,MAAM,EAAE;oBACP,IAAI,EAAE;wBACL,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE;wBAC1F,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE;qBAC1F;iBACD;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC/C,MAAM,UAAU,GAAG,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;YACtF,MAAM,KAAK,GAAG,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;YACnG,MAAM,MAAM,GAAG,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;YAC/F,MAAM,SAAS,GAAG,gBAAgB,CAAyB,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;gBAC3E,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,CAAC,UAAU,EAAE;oBAC9C,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;iBAClF;gBACD,OAAO,IAAI,CAAC;YACb,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC/B,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,MAAM,EAAE;oBACP,IAAI,EAAE;wBACL;4BACC,UAAU,EAAE,KAAK,CAAC,UAAU;4BAC5B,UAAU,EAAE,KAAK,CAAC,UAAU;4BAC5B,MAAM,EAAE;gCACP,IAAI,EAAE;oCACL;wCACC,UAAU,EAAE,UAAU,CAAC,UAAU;wCACjC,UAAU,EAAE,UAAU,CAAC,UAAU;wCACjC,OAAO,EAAE,GAAG;wCACZ,MAAM,EAAE,EAAE;qCACV;iCACD;6BACD;yBACD;qBACD;iBACD;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC5C,0FAA0F;YAC1F,MAAM,UAAU,GAAkB;gBACjC,UAAU,EAAE,QAAQ;gBACpB,MAAM,EAAE;oBACP,IAAI,EAAE;wBACL,UAAU,EAAE,YAAY;wBACxB,MAAM,EAAE;4BACP,IAAI,EAAE;gCACL,UAAU,EAAE,4BAA4B;6BACxC;4BACD,KAAK,EAAE;gCACN,UAAU,EAAE,6BAA6B;6BACzC;4BACD,IAAI,EAAE;gCACL,EAAE,UAAU,EAAE,8BAA8B,EAAE;gCAC9C,EAAE,UAAU,EAAE,8BAA8B,EAAE;gCAC9C,EAAE,UAAU,EAAE,8BAA8B,EAAE;6BAC9C;yBACD;qBACD;oBACD,KAAK,EAAE;wBACN,UAAU,EAAE,aAAa;wBACzB,MAAM,EAAE;4BACP,IAAI,EAAE;gCACL,UAAU,EAAE,6BAA6B;6BACzC;4BACD,KAAK,EAAE;gCACN,UAAU,EAAE,8BAA8B;6BAC1C;4BACD,IAAI,EAAE;gCACL,EAAE,UAAU,EAAE,+BAA+B,EAAE;gCAC/C,EAAE,UAAU,EAAE,+BAA+B,EAAE;gCAC/C,EAAE,UAAU,EAAE,+BAA+B,EAAE;6BAC/C;yBACD;qBACD;oBACD,IAAI,EAAE;wBACL,EAAE,UAAU,EAAE,oBAAoB,EAAE;wBACpC,EAAE,UAAU,EAAE,oBAAoB,EAAE;wBACpC,EAAE,UAAU,EAAE,oBAAoB,EAAE;qBACpC;iBACD;aACD,CAAC;YAEF,MAAM,UAAU,GAAkB;gBACjC,UAAU,EAAE,QAAQ;gBACpB,MAAM,EAAE;oBACP,KAAK,EAAE;wBACN,UAAU,EAAE,aAAa;wBACzB,MAAM,EAAE;4BACP,IAAI,EAAE;gCACL,UAAU,EAAE,6BAA6B;6BACzC;4BACD,IAAI,EAAE;gCACL,EAAE,UAAU,EAAE,+BAA+B,EAAE;gCAC/C,EAAE,UAAU,EAAE,+BAA+B,EAAE;gCAC/C,EAAE,UAAU,EAAE,+BAA+B,EAAE;6BAC/C;4BACD,KAAK,EAAE;gCACN,UAAU,EAAE,8BAA8B;6BAC1C;yBACD;qBACD;oBACD,IAAI,EAAE;wBACL,EAAE,UAAU,EAAE,oBAAoB,EAAE;wBACpC,EAAE,UAAU,EAAE,oBAAoB,EAAE;wBACpC,EAAE,UAAU,EAAE,oBAAoB,EAAE;qBACpC;oBACD,IAAI,EAAE;wBACL,UAAU,EAAE,YAAY;wBACxB,MAAM,EAAE;4BACP,IAAI,EAAE;gCACL,EAAE,UAAU,EAAE,8BAA8B,EAAE;gCAC9C,EAAE,UAAU,EAAE,8BAA8B,EAAE;gCAC9C,EAAE,UAAU,EAAE,8BAA8B,EAAE;6BAC9C;4BACD,KAAK,EAAE;gCACN,UAAU,EAAE,6BAA6B;6BACzC;4BACD,IAAI,EAAE;gCACL,UAAU,EAAE,4BAA4B;6BACxC;yBACD;qBACD;iBACD;aACD,CAAC;YAEF,wEAAwE;YACxE,MAAM,YAAY,GAAa,EAAE,CAAC;YAClC,QAAQ,CACP,UAAU,EACV,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,EACtC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CACzC,CAAC;YAEF,MAAM,YAAY,GAAa,EAAE,CAAC;YAClC,QAAQ,CACP,UAAU,EACV,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,EACtC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CACzC,CAAC;YAEF,oGAAoG;YACpG,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,4BAA4B,EAAE,GAAG,EAAE;QAC3C,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC9D,MAAM,IAAI,GAAkB;gBAC3B,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC;gBAChD,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,EAAE;aACjE,CAAC;YACD,IAAqC,CAAC,KAAK,GAAG,8CAA8C,CAAC;YAC9F,MAAM,SAAS,GAAG,gBAAgB,CACjC,IAAI,EACJ,CAAC,IAAI,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,EAAE,QAAQ,CAAC,EAC9C,QAAQ,CACR,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,MAAM,EAAE,IAAI,CAAC,MAAM;aACnB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC7D,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YAC1E,MAAM,SAAS,GAAG,gBAAgB,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;YACnG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QAChF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,SAAS,QAAQ,CAAC,IAAsB;QACvC,OAAO,OAAO,IAAI,KAAK,QAAQ,CAAC;IACjC,CAAC;IAED,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAChC,MAAM,UAAU,GAAoB,IAAI,eAAe,CACtD,IAAI,yBAAyB,EAAE,CAAC,mBAAmB,EACnD,GAAG,EAAE,GAAE,CAAC,CACR,CAAC;QACF,MAAM,MAAM,GAAiB,EAAE,IAAI,EAAE,IAAI,EAA6B,CAAC;QAEvE,IAAK,QAIJ;QAJD,WAAK,QAAQ;YACZ,yCAAK,CAAA;YACL,6CAAO,CAAA;YACP,qDAAW,CAAA;QACZ,CAAC,EAJI,QAAQ,KAAR,QAAQ,QAIZ;QAED,SAAS,aAAa,CAAC,KAAc,EAAE,QAAkB;YACxD,IAAI,QAAQ,KAAK,QAAQ,CAAC,WAAW,EAAE;gBACtC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,KAAK,QAAQ,CAAC,KAAK,CAAC,CAAC;aAClD;QACF,CAAC;QAED,SAAS,KAAK,CACb,CAAU,EACV,CAAU,EACV,KAA+F;YAE/F,kBAAkB;YAClB,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAE1C,aAAa,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YACpD,oBAAoB;YACpB,aAAa,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YAEpD,MAAM,CAAC,OAAO,EAAE,aAAa,CAAC,GAAG,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YACxE,MAAM,CAAC,OAAO,EAAE,aAAa,CAAC,GAAG,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YAExE,aAAa,CAAC,OAAO,KAAK,OAAO,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;YACrD,aAAa,CAAC,eAAe,CAAC,aAAa,EAAE,aAAa,CAAC,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;YACjF,oBAAoB;YACpB,aAAa,CAAC,eAAe,CAAC,aAAa,EAAE,aAAa,CAAC,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;QAClF,CAAC;QAED,SAAS,kBAAkB,CAAC,CAAU,EAAE,SAAmB;YAC1D,MAAM,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAChD,MAAM,EAAE,GAAY,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC9C,MAAM,QAAQ,GAAG,UAAU,CAAC,SAAS,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAClD,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAChC,aAAa,CAAC,eAAe,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;YAEjD,kDAAkD;YAClD,MAAM,EAAE,GAAY,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC/C,MAAM,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAErC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,QAAQ,GAAG;YAChB,OAAO,EAAE,QAAQ,CAAC,KAAK;YACvB,UAAU,EAAE,QAAQ,CAAC,KAAK;YAC1B,YAAY,EAAE,QAAQ,CAAC,KAAK;YAC5B,SAAS,EAAE,QAAQ,CAAC,KAAK;SACzB,CAAC;QAEF,gGAAgG;QAChG,MAAM,gBAAgB,GAAG;YACxB,OAAO,EAAE,QAAQ,CAAC,KAAK;YACvB,UAAU,EAAE,QAAQ,CAAC,WAAW;YAChC,YAAY,EAAE,QAAQ,CAAC,KAAK;YAC5B,SAAS,EAAE,QAAQ,CAAC,KAAK;SACzB,CAAC;QAEF,MAAM,UAAU,GAAG;YAClB,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,UAAU,EAAE,QAAQ,CAAC,OAAO;YAC5B,YAAY,EAAE,QAAQ,CAAC,OAAO;YAC9B,SAAS,EAAE,QAAQ,CAAC,KAAK;SACzB,CAAC;QAEF,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YACtB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YACtB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YACxB,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YACzB,KAAK,CAAC,GAAG,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxB,KAAK,CAAC,GAAG,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YAC3B,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;YAC7B,0FAA0F;YAC1F,0GAA0G;YAC1G,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC5B,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YAC5B,KAAK,CAAC,oBAAoB,EAAE,oBAAoB,EAAE,QAAQ,CAAC,CAAC;YAC5D,KAAK,CAAC,oBAAoB,EAAE,oBAAoB,EAAE,UAAU,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC1B,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxB,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC1B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC9B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAChC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAC3B,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxC,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC;YAC1C,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YACzC,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACtC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;YAC5D,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YAClC,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC;YAClD,KAAK,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC;YAElD,iDAAiD;YACjD,qFAAqF;YACrF,gGAAgG;YAChG,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,gBAAgB,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YACjC,+EAA+E;YAC/E,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;YAChC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;YAChC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;YAC1B,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YAC3B,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,MAAM,SAAS,GAAG;YACjB,OAAO,EAAE,QAAQ,CAAC,WAAW;YAC7B,UAAU,EAAE,QAAQ,CAAC,WAAW;YAChC,YAAY,EAAE,QAAQ,CAAC,KAAK;YAC5B,SAAS,EAAE,QAAQ,CAAC,WAAW;SAC/B,CAAC;QACF,MAAM,cAAc,GAAG;YACtB,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,UAAU,EAAE,QAAQ,CAAC,OAAO;YAC5B,YAAY,EAAE,QAAQ,CAAC,OAAO;YAC9B,SAAS,EAAE,QAAQ,CAAC,WAAW;SAC/B,CAAC;QAEF,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;YACtB,yEAAyE;YACzE,KAAK,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,CAAC,CAAC;YACrD,KAAK,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;YAEvC,+BAA+B;YAC/B,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;YAC3B,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;YAC9B,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YACrC,KAAK,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YACtC,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;YAElC,8BAA8B;YAC9B,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,4EAA4E;YAC5E,SAAS,cAAc,CAAC,IAAY;gBACnC,qEAAqE;gBACrE,MAAM,YAAY,GAAG,EAAE,YAAY,EAAE,IAAI,IAAI,EAAE,EAAE,YAAY,EAAE,SAAoB,EAAE,CAAC;gBACtF,YAAY,CAAC,YAAY,GAAG,YAAY,CAAC;gBACzC,OAAO,YAA4B,CAAC;YACrC,CAAC;YACD,qHAAqH;YACrH,wCAAwC;YACxC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC;YAClE,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;YAC5D,KAAK,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC;QAEH,gHAAgH;QAChH,kHAAkH;QAClH,EAAE,CAAC,IAAI,CAAC,eAAe,EAAE,GAAG,EAAE;YAC7B,2CAA2C;YAC3C,gFAAgF;YAChF,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { assert } from '@fluidframework/core-utils';\nimport { IFluidHandle } from '@fluidframework/core-interfaces';\nimport { MockFluidDataStoreRuntime } from '@fluidframework/test-runtime-utils';\nimport { FluidSerializer } from '@fluidframework/shared-object-base';\nimport { Definition, NodeId } from '../Identifiers.js';\nimport { getChangeNodeFromView } from '../SerializationUtilities.js';\nimport { noop } from '../Common.js';\nimport {\n\tconvertTreeNodes,\n\tdeepCompareNodes,\n\tinternalizeBuildNode,\n\tPlaceValidationResult,\n\tRangeValidationResultKind,\n\tvalidateStablePlace,\n\tvalidateStableRange,\n\twalkTree,\n} from '../EditUtilities.js';\nimport { BuildNodeInternal, ChangeNode, Payload, Side, TreeNode } from '../persisted-types/index.js';\nimport { BuildNode, BuildTreeNode } from '../ChangeTypes.js';\nimport { comparePayloads } from '../PayloadUtilities.js';\nimport { refreshTestTree } from './utilities/TestUtilities.js';\n\ndescribe('EditUtilities', () => {\n\tconst testTree = refreshTestTree(undefined, undefined, /* expensiveValidation: */ true);\n\n\tdescribe('validateStablePlace', () => {\n\t\tit('accepts valid places', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStablePlace(testTree.view, {\n\t\t\t\t\treferenceSibling: testTree.left.identifier,\n\t\t\t\t\tside: Side.Before,\n\t\t\t\t})\n\t\t\t).deep.equals({\n\t\t\t\tresult: PlaceValidationResult.Valid,\n\t\t\t\treferenceSibling: testTree.left.identifier,\n\t\t\t\tside: Side.Before,\n\t\t\t});\n\t\t});\n\n\t\tit('detects malformed places', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStablePlace(testTree.view, {\n\t\t\t\t\treferenceTrait: testTree.left.traitLocation,\n\t\t\t\t\treferenceSibling: testTree.left.identifier,\n\t\t\t\t\tside: Side.Before,\n\t\t\t\t})\n\t\t\t).deep.equals({ result: PlaceValidationResult.Malformed });\n\t\t});\n\n\t\tit('detects missing siblings', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStablePlace(testTree.view, {\n\t\t\t\t\treferenceSibling: testTree.generateNodeId(),\n\t\t\t\t\tside: Side.Before,\n\t\t\t\t})\n\t\t\t).deep.equals({ result: PlaceValidationResult.MissingSibling });\n\t\t});\n\n\t\tit('detects missing parents', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStablePlace(testTree.view, {\n\t\t\t\t\treferenceTrait: {\n\t\t\t\t\t\tparent: testTree.generateNodeId(),\n\t\t\t\t\t\tlabel: testTree.left.traitLabel,\n\t\t\t\t\t},\n\t\t\t\t\tside: Side.Before,\n\t\t\t\t})\n\t\t\t).deep.equals({ result: PlaceValidationResult.MissingParent });\n\t\t});\n\n\t\tit('detects root places', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStablePlace(testTree.view, {\n\t\t\t\t\treferenceSibling: testTree.identifier,\n\t\t\t\t\tside: Side.Before,\n\t\t\t\t})\n\t\t\t).deep.equals({ result: PlaceValidationResult.SiblingIsRootOrDetached });\n\t\t});\n\t});\n\n\tdescribe('validateStableRange', () => {\n\t\tit('accepts valid ranges', () => {\n\t\t\tconst validatedRange = validateStableRange(testTree.view, {\n\t\t\t\tstart: { referenceSibling: testTree.left.identifier, side: Side.Before },\n\t\t\t\tend: { referenceSibling: testTree.left.identifier, side: Side.After },\n\t\t\t});\n\t\t\texpect(validatedRange.result).to.equal(RangeValidationResultKind.Valid);\n\t\t\tif (validatedRange.result === RangeValidationResultKind.Valid) {\n\t\t\t\texpect(validatedRange.start.referenceSibling).to.equal(testTree.left.identifier);\n\t\t\t\texpect(validatedRange.start.referenceTrait).to.be.undefined;\n\t\t\t\texpect(validatedRange.start.side).to.equal(Side.Before);\n\t\t\t\texpect(validatedRange.end.referenceSibling).to.equal(testTree.left.identifier);\n\t\t\t\texpect(validatedRange.end.referenceTrait).to.be.undefined;\n\t\t\t\texpect(validatedRange.end.side).to.equal(Side.After);\n\t\t\t} else {\n\t\t\t\texpect.fail();\n\t\t\t}\n\t\t});\n\n\t\tit('detects inverted ranges', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStableRange(testTree.view, {\n\t\t\t\t\tstart: { referenceSibling: testTree.left.identifier, side: Side.After },\n\t\t\t\t\tend: { referenceSibling: testTree.left.identifier, side: Side.Before },\n\t\t\t\t})\n\t\t\t).deep.equals({ result: RangeValidationResultKind.Inverted });\n\t\t});\n\n\t\tit('detects when place are in different traits', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStableRange(testTree.view, {\n\t\t\t\t\tstart: { referenceSibling: testTree.left.identifier, side: Side.Before },\n\t\t\t\t\tend: { referenceSibling: testTree.right.identifier, side: Side.After },\n\t\t\t\t})\n\t\t\t).deep.equals({ result: RangeValidationResultKind.PlacesInDifferentTraits });\n\t\t});\n\n\t\tit('detects malformed places', () => {\n\t\t\tconst start = {\n\t\t\t\treferenceTrait: testTree.left.traitLocation,\n\t\t\t\treferenceSibling: testTree.left.identifier,\n\t\t\t\tside: Side.Before,\n\t\t\t};\n\t\t\texpect(\n\t\t\t\tvalidateStableRange(testTree.view, {\n\t\t\t\t\t// trait and sibling should be mutually exclusive\n\t\t\t\t\tstart,\n\t\t\t\t\tend: { referenceSibling: testTree.left.identifier, side: Side.After },\n\t\t\t\t})\n\t\t\t).deep.equals({\n\t\t\t\tresult: {\n\t\t\t\t\tkind: RangeValidationResultKind.BadPlace,\n\t\t\t\t\tplace: start,\n\t\t\t\t\tplaceFailure: PlaceValidationResult.Malformed,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\n\t\tit('detects invalid places', () => {\n\t\t\tconst start = {\n\t\t\t\treferenceSibling: testTree.generateNodeId(),\n\t\t\t\tside: Side.Before,\n\t\t\t};\n\t\t\texpect(\n\t\t\t\tvalidateStableRange(testTree.view, {\n\t\t\t\t\tstart,\n\t\t\t\t\tend: { referenceSibling: testTree.right.identifier, side: Side.After },\n\t\t\t\t})\n\t\t\t).deep.equals({\n\t\t\t\tresult: {\n\t\t\t\t\tkind: RangeValidationResultKind.BadPlace,\n\t\t\t\t\tplace: start,\n\t\t\t\t\tplaceFailure: PlaceValidationResult.MissingSibling,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe('Tree node conversion', () => {\n\t\tit('can clone a tree', () => {\n\t\t\tconst clone = convertTreeNodes<ChangeNode, ChangeNode>(getChangeNodeFromView(testTree.view), (node) => ({\n\t\t\t\t...node,\n\t\t\t}));\n\t\t\texpect(testTree).to.not.equal(clone);\n\t\t\texpect(deepCompareNodes(testTree, clone)).to.be.true;\n\t\t});\n\n\t\tit('can clone a leaf', () => {\n\t\t\tlet converted = false;\n\t\t\texpect(\n\t\t\t\tconvertTreeNodes(\n\t\t\t\t\t42,\n\t\t\t\t\t(n) => {\n\t\t\t\t\t\tconverted = true;\n\t\t\t\t\t\treturn n;\n\t\t\t\t\t},\n\t\t\t\t\tisNumber\n\t\t\t\t)\n\t\t\t).to.equal(42);\n\t\t\texpect(converted).to.be.false;\n\t\t});\n\n\t\tit('can clone a tree with a leaf', () => {\n\t\t\tconst leafTrait = 'main';\n\t\t\tconst leafId = testTree.generateNodeId();\n\t\t\tconst tree = {\n\t\t\t\t...testTree.buildLeaf(testTree.generateNodeId()),\n\t\t\t\tpayload: 'payload',\n\t\t\t\ttraits: { [leafTrait]: [testTree.buildLeaf(leafId)] },\n\t\t\t};\n\t\t\tconst clone = convertTreeNodes<ChangeNode, ChangeNode>(tree, (node) => ({ ...node }));\n\t\t\tassert(typeof clone !== 'number', 0x660 /*  */);\n\t\t\texpect(clone.definition).to.equal(tree.definition);\n\t\t\texpect(clone.identifier).to.equal(tree.identifier);\n\t\t\texpect(clone.payload).to.equal(tree.payload);\n\t\t\texpect(clone.traits[leafTrait][0].identifier).to.equal(leafId);\n\t\t});\n\n\t\tit('correctly invokes the convert function', () => {\n\t\t\tconst node = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'payload' };\n\t\t\tlet converted = false;\n\t\t\tconvertTreeNodes(\n\t\t\t\tnode,\n\t\t\t\t(n) => {\n\t\t\t\t\tconverted = true;\n\t\t\t\t\texpect(node.definition).to.equal(node.definition);\n\t\t\t\t\texpect(node.identifier).to.equal(node.identifier);\n\t\t\t\t\texpect(node.payload).to.equal(node.payload);\n\t\t\t\t\treturn n;\n\t\t\t\t},\n\t\t\t\tisNumber\n\t\t\t);\n\t\t\texpect(converted).to.be.true;\n\t\t});\n\n\t\tit('can convert a node', () => {\n\t\t\tconst node = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'payload' };\n\t\t\tconst id = testTree.generateNodeId();\n\t\t\tconst converted = convertTreeNodes(\n\t\t\t\tnode,\n\t\t\t\t(_) => ({ definition: '_def' as Definition, identifier: id, payload: 'payload2' }),\n\t\t\t\tisNumber\n\t\t\t);\n\t\t\texpect(converted).to.deep.equal({ definition: '_def', identifier: id, payload: 'payload2', traits: {} });\n\t\t});\n\n\t\tit('creates empty trait objects for the root', () => {\n\t\t\tconst node: BuildTreeNode = { ...testTree.buildLeaf(testTree.generateNodeId()) };\n\t\t\tconst converted = convertTreeNodes<BuildTreeNode, TreeNode<BuildNodeInternal, NodeId>, number>(\n\t\t\t\tnode,\n\t\t\t\t(n) => internalizeBuildNode(n, testTree),\n\t\t\t\tisNumber\n\t\t\t);\n\t\t\tassert(typeof converted !== 'number', 0x661 /* unexpected detached ID */);\n\t\t\texpect(converted.traits).to.not.be.undefined;\n\t\t});\n\n\t\tit('creates empty trait objects for children', () => {\n\t\t\tconst node: BuildNode = { ...testTree.buildLeaf(), traits: { main: { ...testTree.buildLeaf() } } };\n\t\t\tconst converted = convertTreeNodes<BuildTreeNode, TreeNode<BuildNodeInternal, NodeId>, number>(\n\t\t\t\tnode,\n\t\t\t\t(n) => internalizeBuildNode(n, testTree),\n\t\t\t\tisNumber\n\t\t\t);\n\t\t\tassert(typeof converted !== 'number', 0x662 /* unexpected detached ID */);\n\t\t\texpect(converted.traits).to.not.be.undefined;\n\t\t});\n\n\t\tit('can convert a tree with children', () => {\n\t\t\tconst childA = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'a' };\n\t\t\tconst childB = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'b' };\n\t\t\tconst node = { ...testTree.buildLeaf(testTree.generateNodeId()), traits: { main: [childA, childB] } };\n\t\t\tconst converted = convertTreeNodes<ChangeNode, ChangeNode>(node, (node) => {\n\t\t\t\tif (node.identifier === childB.identifier) {\n\t\t\t\t\treturn { definition: node.definition, identifier: node.identifier, payload: 'c' };\n\t\t\t\t}\n\t\t\t\treturn node;\n\t\t\t});\n\t\t\texpect(converted).to.deep.equal({\n\t\t\t\tdefinition: node.definition,\n\t\t\t\tidentifier: node.identifier,\n\t\t\t\ttraits: {\n\t\t\t\t\tmain: [\n\t\t\t\t\t\t{ definition: childA.definition, identifier: childA.identifier, payload: 'a', traits: {} },\n\t\t\t\t\t\t{ definition: childB.definition, identifier: childB.identifier, payload: 'c', traits: {} },\n\t\t\t\t\t],\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\n\t\tit('can convert a tree with a grandchild', () => {\n\t\t\tconst grandchild = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'g' };\n\t\t\tconst child = { ...testTree.buildLeaf(testTree.generateNodeId()), traits: { main: [grandchild] } };\n\t\t\tconst parent = { ...testTree.buildLeaf(testTree.generateNodeId()), traits: { main: [child] } };\n\t\t\tconst converted = convertTreeNodes<ChangeNode, ChangeNode>(parent, (node) => {\n\t\t\t\tif (node.identifier === grandchild.identifier) {\n\t\t\t\t\treturn { definition: node.definition, identifier: node.identifier, payload: 'h' };\n\t\t\t\t}\n\t\t\t\treturn node;\n\t\t\t});\n\t\t\texpect(converted).to.deep.equal({\n\t\t\t\tdefinition: parent.definition,\n\t\t\t\tidentifier: parent.identifier,\n\t\t\t\ttraits: {\n\t\t\t\t\tmain: [\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tdefinition: child.definition,\n\t\t\t\t\t\t\tidentifier: child.identifier,\n\t\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\t\tmain: [\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tdefinition: grandchild.definition,\n\t\t\t\t\t\t\t\t\t\tidentifier: grandchild.identifier,\n\t\t\t\t\t\t\t\t\t\tpayload: 'h',\n\t\t\t\t\t\t\t\t\t\ttraits: {},\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t},\n\t\t\t\t\t],\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\n\t\tit('walks trees in a consistent order', () => {\n\t\t\t// Construct two trees that are the same but have their traits defined in different orders\n\t\t\tconst buildTreeA: BuildTreeNode = {\n\t\t\t\tdefinition: 'parent',\n\t\t\t\ttraits: {\n\t\t\t\t\tleft: {\n\t\t\t\t\t\tdefinition: 'left child',\n\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\tleft: {\n\t\t\t\t\t\t\t\tdefinition: 'left grandchild under left',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tright: {\n\t\t\t\t\t\t\t\tdefinition: 'right grandchild under left',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tmain: [\n\t\t\t\t\t\t\t\t{ definition: 'grandchild A under left main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild B under left main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild C under left main' },\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t\tright: {\n\t\t\t\t\t\tdefinition: 'right child',\n\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\tleft: {\n\t\t\t\t\t\t\t\tdefinition: 'left grandchild under right',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tright: {\n\t\t\t\t\t\t\t\tdefinition: 'right grandchild under right',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tmain: [\n\t\t\t\t\t\t\t\t{ definition: 'grandchild A under right main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild B under right main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild C under right main' },\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t\tmain: [\n\t\t\t\t\t\t{ definition: 'child A under main' },\n\t\t\t\t\t\t{ definition: 'child B under main' },\n\t\t\t\t\t\t{ definition: 'child C under main' },\n\t\t\t\t\t],\n\t\t\t\t},\n\t\t\t};\n\n\t\t\tconst buildTreeB: BuildTreeNode = {\n\t\t\t\tdefinition: 'parent',\n\t\t\t\ttraits: {\n\t\t\t\t\tright: {\n\t\t\t\t\t\tdefinition: 'right child',\n\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\tleft: {\n\t\t\t\t\t\t\t\tdefinition: 'left grandchild under right',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tmain: [\n\t\t\t\t\t\t\t\t{ definition: 'grandchild A under right main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild B under right main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild C under right main' },\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\tright: {\n\t\t\t\t\t\t\t\tdefinition: 'right grandchild under right',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t\tmain: [\n\t\t\t\t\t\t{ definition: 'child A under main' },\n\t\t\t\t\t\t{ definition: 'child B under main' },\n\t\t\t\t\t\t{ definition: 'child C under main' },\n\t\t\t\t\t],\n\t\t\t\t\tleft: {\n\t\t\t\t\t\tdefinition: 'left child',\n\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\tmain: [\n\t\t\t\t\t\t\t\t{ definition: 'grandchild A under left main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild B under left main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild C under left main' },\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\tright: {\n\t\t\t\t\t\t\t\tdefinition: 'right grandchild under left',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tleft: {\n\t\t\t\t\t\t\t\tdefinition: 'left grandchild under left',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t};\n\n\t\t\t// Record the order in which the tree walk visits each node in each tree\n\t\t\tconst definitionsA: string[] = [];\n\t\t\twalkTree<BuildTreeNode, number>(\n\t\t\t\tbuildTreeA,\n\t\t\t\t(n) => definitionsA.push(n.definition),\n\t\t\t\t(x): x is number => typeof x === 'number'\n\t\t\t);\n\n\t\t\tconst definitionsB: string[] = [];\n\t\t\twalkTree<BuildTreeNode, number>(\n\t\t\t\tbuildTreeB,\n\t\t\t\t(n) => definitionsB.push(n.definition),\n\t\t\t\t(x): x is number => typeof x === 'number'\n\t\t\t);\n\n\t\t\t// The orders should be the same, even though the trees had their traits defined in different orders\n\t\t\texpect(definitionsA).to.deep.equal(definitionsB);\n\t\t});\n\t});\n\n\tdescribe('Build tree internalization', () => {\n\t\tit('does not copy extraneous properties from input tree', () => {\n\t\t\tconst node: BuildTreeNode = {\n\t\t\t\t...testTree.buildLeaf(testTree.generateNodeId()),\n\t\t\t\ttraits: { main: [testTree.buildLeaf(testTree.generateNodeId())] },\n\t\t\t};\n\t\t\t(node as unknown as { extra: string }).extra = 'This is extra data that should not be copied';\n\t\t\tconst converted = convertTreeNodes<BuildTreeNode, TreeNode<BuildNodeInternal, NodeId>, number>(\n\t\t\t\tnode,\n\t\t\t\t(node) => internalizeBuildNode(node, testTree),\n\t\t\t\tisNumber\n\t\t\t);\n\t\t\texpect(converted).to.deep.equal({\n\t\t\t\tdefinition: node.definition,\n\t\t\t\tidentifier: node.identifier,\n\t\t\t\ttraits: node.traits,\n\t\t\t});\n\t\t});\n\n\t\tit('does not copy extraneous properties from converter', () => {\n\t\t\tconst node = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\texpect(Object.prototype.hasOwnProperty.call(node, 'payload')).to.be.false;\n\t\t\tconst converted = convertTreeNodes(node, (node) => internalizeBuildNode(node, testTree), isNumber);\n\t\t\texpect(Object.prototype.hasOwnProperty.call(converted, 'payload')).to.be.false;\n\t\t});\n\t});\n\n\tfunction isNumber(node: number | unknown): node is number {\n\t\treturn typeof node === 'number';\n\t}\n\n\tdescribe('comparePayloads', () => {\n\t\tconst serializer: FluidSerializer = new FluidSerializer(\n\t\t\tnew MockFluidDataStoreRuntime().IFluidHandleContext,\n\t\t\t() => {}\n\t\t);\n\t\tconst binder: IFluidHandle = { bind: noop } as unknown as IFluidHandle;\n\n\t\tenum Equality {\n\t\t\tEqual,\n\t\t\tUnequal,\n\t\t\tUnspecified,\n\t\t}\n\n\t\tfunction checkEquality(equal: boolean, equality: Equality): void {\n\t\t\tif (equality !== Equality.Unspecified) {\n\t\t\t\texpect(equal).equals(equality === Equality.Equal);\n\t\t\t}\n\t\t}\n\n\t\tfunction check(\n\t\t\ta: Payload,\n\t\t\tb: Payload,\n\t\t\tflags: { initial: Equality; serialized: Equality; deserialized: Equality; roundtrip: Equality }\n\t\t): void {\n\t\t\t// Check reflexive\n\t\t\texpect(comparePayloads(a, a)).equal(true);\n\t\t\texpect(comparePayloads(b, b)).equal(true);\n\n\t\t\tcheckEquality(comparePayloads(a, b), flags.initial);\n\t\t\t// Check commutative\n\t\t\tcheckEquality(comparePayloads(b, a), flags.initial);\n\n\t\t\tconst [aString, aDeserialized] = checkSerialization(a, flags.roundtrip);\n\t\t\tconst [bString, bDeserialized] = checkSerialization(b, flags.roundtrip);\n\n\t\t\tcheckEquality(aString === bString, flags.serialized);\n\t\t\tcheckEquality(comparePayloads(aDeserialized, bDeserialized), flags.deserialized);\n\t\t\t// Check commutative\n\t\t\tcheckEquality(comparePayloads(bDeserialized, aDeserialized), flags.deserialized);\n\t\t}\n\n\t\tfunction checkSerialization(a: Payload, roundtrip: Equality): [string, Payload] {\n\t\t\tconst aString = serializer.stringify(a, binder);\n\t\t\tconst a2: Payload = serializer.parse(aString);\n\t\t\tconst aString2 = serializer.stringify(a2, binder);\n\t\t\texpect(aString2).equal(aString);\n\t\t\tcheckEquality(comparePayloads(a, a2), roundtrip);\n\n\t\t\t// Check second round trip, should always be equal\n\t\t\tconst a3: Payload = serializer.parse(aString2);\n\t\t\texpect(comparePayloads(a3, a2)).true;\n\n\t\t\treturn [aString, a2];\n\t\t}\n\n\t\tconst allEqual = {\n\t\t\tinitial: Equality.Equal,\n\t\t\tserialized: Equality.Equal,\n\t\t\tdeserialized: Equality.Equal,\n\t\t\troundtrip: Equality.Equal,\n\t\t};\n\n\t\t// For when the inputs are logically equal, but may serialize differently due to field ordering.\n\t\tconst allEqualUnstable = {\n\t\t\tinitial: Equality.Equal,\n\t\t\tserialized: Equality.Unspecified,\n\t\t\tdeserialized: Equality.Equal,\n\t\t\troundtrip: Equality.Equal,\n\t\t};\n\n\t\tconst allUnequal = {\n\t\t\tinitial: Equality.Unequal,\n\t\t\tserialized: Equality.Unequal,\n\t\t\tdeserialized: Equality.Unequal,\n\t\t\troundtrip: Equality.Equal,\n\t\t};\n\n\t\tit('compares numbers correctly', () => {\n\t\t\tcheck(0, 0, allEqual);\n\t\t\tcheck(1, 1, allEqual);\n\t\t\tcheck(0, 1, allUnequal);\n\t\t\tcheck(-1, 1, allUnequal);\n\t\t\tcheck(5.2, 5.200000001, allUnequal);\n\t\t});\n\n\t\tit('compares strings', () => {\n\t\t\tcheck('', '', allEqual);\n\t\t\tcheck(' ', '', allUnequal);\n\t\t\tcheck('1', '+1', allUnequal);\n\t\t\t// This character makes sure multi-byte utf-8 and multi-word utf-16 at least somewhat work\n\t\t\t// Cases like unicode normalization are not covered here here. Normalization or not will be considered ok.\n\t\t\tcheck('𤭢', '𤭢', allEqual);\n\t\t\tcheck('𤭢', '', allUnequal);\n\t\t\tcheck('several characters', 'several characters', allEqual);\n\t\t\tcheck('several characters', 'several_characters', allUnequal);\n\t\t});\n\n\t\tit('compares arrays', () => {\n\t\t\tcheck([], [], allEqual);\n\t\t\tcheck([1], [1], allEqual);\n\t\t\tcheck([[1]], [[1]], allEqual);\n\t\t\tcheck([[1]], [[2]], allUnequal);\n\t\t\tcheck([], [1], allUnequal);\n\t\t\tcheck([1, 2], [2, 1], allUnequal);\n\t\t});\n\n\t\tit('compares objects', () => {\n\t\t\tcheck({ 1: 'x' }, { 1: 'x' }, allEqual);\n\t\t\tcheck({ x: 'x' }, { y: 'x' }, allUnequal);\n\t\t\tcheck({ x: 'x' }, { x: {} }, allUnequal);\n\t\t\tcheck({ x: {} }, { x: {} }, allEqual);\n\t\t\tcheck({ x: [1, 2, 3, 5] }, { x: [1, 2, 3, 4] }, allUnequal);\n\t\t\tcheck({ 1: 'x' }, {}, allUnequal);\n\t\t\tcheck({ x: 'x' }, { x: 'x', y: 'x' }, allUnequal);\n\t\t\tcheck({ field: 'a' }, { field: 'b' }, allUnequal);\n\n\t\t\t// Fluid Serialization arbitrarily orders fields.\n\t\t\t// Thus any object with more than one field may have non-deterministic serialization.\n\t\t\t// However objects have field order, and we need to check comparePayloads is not impacted by it.\n\t\t\tcheck({ y: 'a', x: 'b' }, { x: 'b', y: 'a' }, allEqualUnstable);\n\t\t});\n\n\t\tit('compares mixed types', () => {\n\t\t\tcheck({ 0: 1 }, [1], allUnequal);\n\t\t\t// Rationale: 'undefined' is reserved for future use (see 'SetValue' interface)\n\t\t\tcheck(null, 'null', allUnequal);\n\t\t\tcheck(null, 'null', allUnequal);\n\t\t\tcheck(1, '1', allUnequal);\n\t\t\tcheck(null, 0, allUnequal);\n\t\t\tcheck('', 0, allUnequal);\n\t\t});\n\n\t\tconst sameAfter = {\n\t\t\tinitial: Equality.Unspecified,\n\t\t\tserialized: Equality.Unspecified,\n\t\t\tdeserialized: Equality.Equal,\n\t\t\troundtrip: Equality.Unspecified,\n\t\t};\n\t\tconst differentAfter = {\n\t\t\tinitial: Equality.Unequal,\n\t\t\tserialized: Equality.Unequal,\n\t\t\tdeserialized: Equality.Unequal,\n\t\t\troundtrip: Equality.Unspecified,\n\t\t};\n\n\t\tit('lossy cases', () => {\n\t\t\t// Undefined fields are omitted in json, and thus lost on the round trip.\n\t\t\tcheck({ x: undefined }, { y: undefined }, sameAfter);\n\t\t\tcheck({ x: undefined }, {}, sameAfter);\n\n\t\t\t// NaN and Infinity become null\n\t\t\tcheck(NaN, NaN, sameAfter);\n\t\t\tcheck(NaN, 7, differentAfter);\n\t\t\tcheck(Infinity, Infinity, sameAfter);\n\t\t\tcheck(-Infinity, Infinity, sameAfter);\n\t\t\tcheck(NaN, 'NaN', differentAfter);\n\n\t\t\t// json loses -0 on round trip\n\t\t\tcheck(-0, -0, sameAfter);\n\t\t});\n\n\t\tit('compares handles', () => {\n\t\t\t// This is used instead of MockHandle so equal handles compare deeply equal.\n\t\t\tfunction makeMockHandle(data: string): IFluidHandle {\n\t\t\t\t// `/` prefix is needed to prevent serializing from modifying handle.\n\t\t\t\tconst handleObject = { absolutePath: `/${data}`, IFluidHandle: undefined as unknown };\n\t\t\t\thandleObject.IFluidHandle = handleObject;\n\t\t\t\treturn handleObject as IFluidHandle;\n\t\t\t}\n\t\t\t// Theoretically handles serialize as objects with 2 fields and thus serialization is allowed to be non-deterministic\n\t\t\t// so use allEqualUnstable not allEqual.\n\t\t\tcheck(makeMockHandle('x'), makeMockHandle('x'), allEqualUnstable);\n\t\t\tcheck(makeMockHandle('x'), makeMockHandle('y'), allUnequal);\n\t\t\tcheck({ x: makeMockHandle('x') }, makeMockHandle('x'), allUnequal);\n\t\t});\n\n\t\t// These are cases that are allowed by the type system and produce unexpected results due to Json serialization.\n\t\t// Clear documentation and/or adjustments to equality, type checking or serialization would help with these cases.\n\t\tit.skip('strange cases', () => {\n\t\t\t// Top level undefined fails in JSON.parse.\n\t\t\t// Rationale: 'undefined' is reserved for future use (see 'SetValue' interface.)\n\t\t\tcheck(undefined, null, sameAfter);\n\t\t});\n\t});\n});\n"]}

package/lib/test/Forest.perf.tests.d.ts

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

package/lib/test/Forest.perf.tests.d.ts.map

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