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

package/lib/test/Forest.perf.tests.js

@@ -1,135 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from 'assert';
-import { benchmark, BenchmarkType, isInPerformanceTestingMode } from '@fluid-tools/benchmark';
-import { v4 } from 'uuid';
-import { Forest } from '../Forest.js';
-import { RevisionView } from '../RevisionView.js';
-import { Side } from '../persisted-types/index.js';
-import { refreshTestTree } from './utilities/TestUtilities.js';
-describe('Forest Perf', () => {
-    const testTree = refreshTestTree();
-    // Larger sizes can slow down correctness test runs, or even time out, so only run smaller sizes as correctness tests.
-    const sizes = isInPerformanceTestingMode ? [100, 1000, 10000, 100000] : [100, 1000];
-    for (const count of sizes) {
-        // Pick a single representative size for the 'Measurement' suite to keep it small.
-        const type = count === 10000 ? BenchmarkType.Measurement : BenchmarkType.Perspective;
-        benchmark({
-            type,
-            title: `${count} random inserts in TreeView`,
-            benchmarkFn: () => {
-                buildRandomTree(testTree, count);
-            },
-        });
-        let built;
-        let rootId;
-        benchmark({
-            type,
-            title: `walk ${count} node TreeView`,
-            before: () => {
-                [built, rootId] = buildRandomTree(testTree, count);
-            },
-            benchmarkFn: () => {
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-                const nodes = walk(built, rootId);
-                assert(nodes === count);
-            },
-            after: () => {
-                built = undefined;
-                rootId = undefined;
-            },
-        });
-        let forest;
-        let nodes;
-        benchmark({
-            type,
-            title: `insert ${count} nodes into Forest`,
-            before: () => {
-                forest = Forest.create(true);
-                nodes = [];
-                for (let i = 0; i < count; i++) {
-                    nodes.push(makeTestForestNode(testTree));
-                }
-            },
-            benchmarkFn: () => {
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-                forest.add(nodes);
-            },
-            after: () => {
-                forest = undefined;
-            },
-        });
-        let otherForest;
-        for (const otherCount of sizes) {
-            benchmark({
-                type,
-                title: `invoke delta on Forest with ${count} nodes against Forest with ${otherCount} nodes`,
-                before: () => {
-                    forest = Forest.create(true);
-                    otherForest = Forest.create(true);
-                    nodes = [];
-                    for (let i = 0; i < count; i++) {
-                        nodes.push(makeTestForestNode(testTree));
-                    }
-                    forest = forest.add(nodes);
-                    const otherNodes = [];
-                    for (let i = 0; i < otherCount; i++) {
-                        otherNodes.push(makeTestForestNode(testTree));
-                    }
-                    otherForest = otherForest.add(otherNodes);
-                },
-                benchmarkFn: () => {
-                    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-                    forest.delta(otherForest);
-                },
-                after: () => {
-                    forest = undefined;
-                    otherForest = undefined;
-                },
-            });
-        }
-    }
-});
-function walk(s, id) {
-    let count = 1;
-    const n = s.getViewNode(id);
-    for (const [_label, v] of n.traits.entries()) {
-        for (const child of v) {
-            count += walk(s, child);
-        }
-    }
-    return count;
-}
-function buildRandomTree(testTree, size) {
-    function getId() {
-        return testTree.generateNodeId();
-    }
-    function getLabel() {
-        return v4();
-    }
-    const rootId = getId();
-    const root = { traits: {}, definition: v4(), identifier: rootId };
-    const ids = [rootId];
-    let f = RevisionView.fromTree(root).openForTransaction();
-    for (let i = 1; i < size; i++) {
-        const label = getLabel();
-        const def = v4();
-        const id = getId();
-        const newNode = {
-            identifier: id,
-            definition: def,
-            traits: new Map(),
-        };
-        f = f.addNodes([newNode]);
-        const parent = ids[Math.floor(Math.random() * ids.length)];
-        f = f.attachRange([id], { trait: { parent, label }, side: Side.Before });
-        ids.push(id);
-    }
-    return [f.close(), rootId];
-}
-function makeTestForestNode(testTree) {
-    return { ...testTree.buildLeaf(testTree.generateNodeId()), traits: new Map() };
-}
-//# sourceMappingURL=Forest.perf.tests.js.map

package/lib/test/Forest.perf.tests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Forest.perf.tests.js","sourceRoot":"","sources":["../../src/test/Forest.perf.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,0BAA0B,EAAE,MAAM,wBAAwB,CAAC;AAC9F,OAAO,EAAE,EAAE,EAAE,MAAM,MAAM,CAAC;AAG1B,OAAO,EAAE,MAAM,EAAc,MAAM,cAAc,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAc,IAAI,EAAE,MAAM,6BAA6B,CAAC;AAG/D,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAE/D,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IACnC,sHAAsH;IACtH,MAAM,KAAK,GAAG,0BAA0B,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,IAAK,EAAE,KAAM,EAAE,MAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,IAAK,CAAC,CAAC;IAExF,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE;QAC1B,kFAAkF;QAClF,MAAM,IAAI,GAAG,KAAK,KAAK,KAAM,CAAC,CAAC,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,CAAC,aAAa,CAAC,WAAW,CAAC;QAEtF,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,GAAG,KAAK,6BAA6B;YAC5C,WAAW,EAAE,GAAG,EAAE;gBACjB,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAClC,CAAC;SACD,CAAC,CAAC;QAEH,IAAI,KAA+B,CAAC;QACpC,IAAI,MAA0B,CAAC;QAC/B,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,QAAQ,KAAK,gBAAgB;YACpC,MAAM,EAAE,GAAG,EAAE;gBACZ,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YACpD,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,oEAAoE;gBACpE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAM,EAAE,MAAO,CAAC,CAAC;gBACpC,MAAM,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;YACzB,CAAC;YACD,KAAK,EAAE,GAAG,EAAE;gBACX,KAAK,GAAG,SAAS,CAAC;gBAClB,MAAM,GAAG,SAAS,CAAC;YACpB,CAAC;SACD,CAAC,CAAC;QAEH,IAAI,MAA0B,CAAC;QAC/B,IAAI,KAAmB,CAAC;QACxB,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,UAAU,KAAK,oBAAoB;YAC1C,MAAM,EAAE,GAAG,EAAE;gBACZ,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC7B,KAAK,GAAG,EAAE,CAAC;gBACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;oBAC/B,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC;iBACzC;YACF,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,oEAAoE;gBACpE,MAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;YACD,KAAK,EAAE,GAAG,EAAE;gBACX,MAAM,GAAG,SAAS,CAAC;YACpB,CAAC;SACD,CAAC,CAAC;QAEH,IAAI,WAA+B,CAAC;QACpC,KAAK,MAAM,UAAU,IAAI,KAAK,EAAE;YAC/B,SAAS,CAAC;gBACT,IAAI;gBACJ,KAAK,EAAE,+BAA+B,KAAK,8BAA8B,UAAU,QAAQ;gBAC3F,MAAM,EAAE,GAAG,EAAE;oBACZ,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC7B,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAClC,KAAK,GAAG,EAAE,CAAC;oBACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;wBAC/B,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC;qBACzC;oBACD,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAE3B,MAAM,UAAU,GAAiB,EAAE,CAAC;oBACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;wBACpC,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC;qBAC9C;oBACD,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC3C,CAAC;gBACD,WAAW,EAAE,GAAG,EAAE;oBACjB,oEAAoE;oBACpE,MAAO,CAAC,KAAK,CAAC,WAAY,CAAC,CAAC;gBAC7B,CAAC;gBACD,KAAK,EAAE,GAAG,EAAE;oBACX,MAAM,GAAG,SAAS,CAAC;oBACnB,WAAW,GAAG,SAAS,CAAC;gBACzB,CAAC;aACD,CAAC,CAAC;SACH;KACD;AACF,CAAC,CAAC,CAAC;AAEH,SAAS,IAAI,CAAC,CAAe,EAAE,EAAU;IACxC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;IAC5B,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE;QAC7C,KAAK,MAAM,KAAK,IAAI,CAAC,EAAE;YACtB,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;SACxB;KACD;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,eAAe,CAAC,QAAkB,EAAE,IAAY;IACxD,SAAS,KAAK;QACb,OAAO,QAAQ,CAAC,cAAc,EAAE,CAAC;IAClC,CAAC;IAED,SAAS,QAAQ;QAChB,OAAO,EAAE,EAAgB,CAAC;IAC3B,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,EAAE,CAAC;IACvB,MAAM,IAAI,GAAe,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAgB,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;IAC5F,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,IAAI,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,kBAAkB,EAAE,CAAC;IAEzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,KAAK,GAAG,QAAQ,EAAE,CAAC;QACzB,MAAM,GAAG,GAAe,EAAE,EAAgB,CAAC;QAC3C,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;QAEnB,MAAM,OAAO,GAAiB;YAC7B,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,GAAG;YACf,MAAM,EAAE,IAAI,GAAG,EAAiC;SAChD,CAAC;QAEF,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3D,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KACb;IACD,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,MAAM,CAAC,CAAC;AAC5B,CAAC;AAED,SAAS,kBAAkB,CAAC,QAAkB;IAC7C,OAAO,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;AAChF,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from 'assert';\nimport { benchmark, BenchmarkType, isInPerformanceTestingMode } from '@fluid-tools/benchmark';\nimport { v4 } from 'uuid';\n\nimport { Definition, NodeId, TraitLabel } from '../Identifiers.js';\nimport { Forest, ForestNode } from '../Forest.js';\nimport { RevisionView } from '../RevisionView.js';\nimport { ChangeNode, Side } from '../persisted-types/index.js';\nimport { TreeViewNode } from '../TreeView.js';\nimport { TestTree } from './utilities/TestNode.js';\nimport { refreshTestTree } from './utilities/TestUtilities.js';\n\ndescribe('Forest Perf', () => {\n\tconst testTree = refreshTestTree();\n\t// Larger sizes can slow down correctness test runs, or even time out, so only run smaller sizes as correctness tests.\n\tconst sizes = isInPerformanceTestingMode ? [100, 1_000, 10_000, 100_000] : [100, 1_000];\n\n\tfor (const count of sizes) {\n\t\t// Pick a single representative size for the 'Measurement' suite to keep it small.\n\t\tconst type = count === 10_000 ? BenchmarkType.Measurement : BenchmarkType.Perspective;\n\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `${count} random inserts in TreeView`,\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tbuildRandomTree(testTree, count);\n\t\t\t},\n\t\t});\n\n\t\tlet built: RevisionView | undefined;\n\t\tlet rootId: NodeId | undefined;\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `walk ${count} node TreeView`,\n\t\t\tbefore: () => {\n\t\t\t\t[built, rootId] = buildRandomTree(testTree, count);\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\t\tconst nodes = walk(built!, rootId!);\n\t\t\t\tassert(nodes === count);\n\t\t\t},\n\t\t\tafter: () => {\n\t\t\t\tbuilt = undefined;\n\t\t\t\trootId = undefined;\n\t\t\t},\n\t\t});\n\n\t\tlet forest: Forest | undefined;\n\t\tlet nodes: ForestNode[];\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `insert ${count} nodes into Forest`,\n\t\t\tbefore: () => {\n\t\t\t\tforest = Forest.create(true);\n\t\t\t\tnodes = [];\n\t\t\t\tfor (let i = 0; i < count; i++) {\n\t\t\t\t\tnodes.push(makeTestForestNode(testTree));\n\t\t\t\t}\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\t\tforest!.add(nodes);\n\t\t\t},\n\t\t\tafter: () => {\n\t\t\t\tforest = undefined;\n\t\t\t},\n\t\t});\n\n\t\tlet otherForest: Forest | undefined;\n\t\tfor (const otherCount of sizes) {\n\t\t\tbenchmark({\n\t\t\t\ttype,\n\t\t\t\ttitle: `invoke delta on Forest with ${count} nodes against Forest with ${otherCount} nodes`,\n\t\t\t\tbefore: () => {\n\t\t\t\t\tforest = Forest.create(true);\n\t\t\t\t\totherForest = Forest.create(true);\n\t\t\t\t\tnodes = [];\n\t\t\t\t\tfor (let i = 0; i < count; i++) {\n\t\t\t\t\t\tnodes.push(makeTestForestNode(testTree));\n\t\t\t\t\t}\n\t\t\t\t\tforest = forest.add(nodes);\n\n\t\t\t\t\tconst otherNodes: ForestNode[] = [];\n\t\t\t\t\tfor (let i = 0; i < otherCount; i++) {\n\t\t\t\t\t\totherNodes.push(makeTestForestNode(testTree));\n\t\t\t\t\t}\n\t\t\t\t\totherForest = otherForest.add(otherNodes);\n\t\t\t\t},\n\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\t\t\tforest!.delta(otherForest!);\n\t\t\t\t},\n\t\t\t\tafter: () => {\n\t\t\t\t\tforest = undefined;\n\t\t\t\t\totherForest = undefined;\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t}\n});\n\nfunction walk(s: RevisionView, id: NodeId): number {\n\tlet count = 1;\n\tconst n = s.getViewNode(id);\n\tfor (const [_label, v] of n.traits.entries()) {\n\t\tfor (const child of v) {\n\t\t\tcount += walk(s, child);\n\t\t}\n\t}\n\treturn count;\n}\n\nfunction buildRandomTree(testTree: TestTree, size: number): [RevisionView, NodeId] {\n\tfunction getId(): NodeId {\n\t\treturn testTree.generateNodeId();\n\t}\n\n\tfunction getLabel(): TraitLabel {\n\t\treturn v4() as TraitLabel;\n\t}\n\n\tconst rootId = getId();\n\tconst root: ChangeNode = { traits: {}, definition: v4() as Definition, identifier: rootId };\n\tconst ids = [rootId];\n\tlet f = RevisionView.fromTree(root).openForTransaction();\n\n\tfor (let i = 1; i < size; i++) {\n\t\tconst label = getLabel();\n\t\tconst def: Definition = v4() as Definition;\n\t\tconst id = getId();\n\n\t\tconst newNode: TreeViewNode = {\n\t\t\tidentifier: id,\n\t\t\tdefinition: def,\n\t\t\ttraits: new Map<TraitLabel, readonly NodeId[]>(),\n\t\t};\n\n\t\tf = f.addNodes([newNode]);\n\t\tconst parent = ids[Math.floor(Math.random() * ids.length)];\n\t\tf = f.attachRange([id], { trait: { parent, label }, side: Side.Before });\n\t\tids.push(id);\n\t}\n\treturn [f.close(), rootId];\n}\n\nfunction makeTestForestNode(testTree: TestTree): ForestNode {\n\treturn { ...testTree.buildLeaf(testTree.generateNodeId()), traits: new Map() };\n}\n"]}

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

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

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

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

package/lib/test/Forest.tests.js

@@ -1,213 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from 'assert';
-import { expect } from 'chai';
-import { validateAssertionError } from '@fluidframework/test-runtime-utils';
-import { compareForestNodes, Forest } from '../Forest.js';
-import { refreshTestTree } from './utilities/TestUtilities.js';
-const mainTraitLabel = 'main';
-function makeForestNodeWithChildren(testTree, id, ...children) {
-    return {
-        ...testTree.buildLeaf(id),
-        traits: new Map(children.length > 0 ? [[mainTraitLabel, [...children]]] : []),
-    };
-}
-describe('Forest', () => {
-    let parentId;
-    let childId;
-    let secondChildId;
-    let thirdChildId;
-    let childNode;
-    let parentNode;
-    let emptyForest;
-    let oneNodeForest;
-    let parentForest;
-    let grandparentForest;
-    let threeLeafForest;
-    const testTree = refreshTestTree(undefined, (t) => {
-        parentId = t.generateNodeId();
-        childId = t.generateNodeId();
-        secondChildId = t.generateNodeId();
-        thirdChildId = t.generateNodeId();
-        childNode = makeForestNodeWithChildren(t, childId);
-        parentNode = makeForestNodeWithChildren(t, parentId);
-        emptyForest = Forest.create(true);
-        oneNodeForest = emptyForest.add([parentNode]);
-        parentForest = oneNodeForest.add([childNode]).attachRangeOfChildren(parentId, mainTraitLabel, 0, [childId]);
-        grandparentForest = parentForest
-            .add([makeForestNodeWithChildren(t, secondChildId)])
-            .attachRangeOfChildren(childId, mainTraitLabel, 0, [secondChildId]);
-        threeLeafForest = parentForest
-            .add([makeForestNodeWithChildren(t, secondChildId), makeForestNodeWithChildren(t, thirdChildId)])
-            .attachRangeOfChildren(parentId, mainTraitLabel, 1, [secondChildId, thirdChildId]);
-    });
-    it('test forests are consistent', () => {
-        emptyForest.assertConsistent();
-        parentForest.assertConsistent();
-        expect(emptyForest.size).equals(0);
-        expect(parentForest.size).equals(2);
-    });
-    it('fails on multiparenting', () => {
-        assert.throws(() => oneNodeForest.add([makeForestNodeWithChildren(testTree, parentId, childId, childId)]));
-    });
-    it('cannot add a node with a duplicate ID', () => {
-        assert.throws(() => oneNodeForest.add([makeForestNodeWithChildren(testTree, parentId)]));
-    });
-    it('can get nodes in the forest', () => {
-        expect(compareForestNodes(parentForest.get(childId), childNode));
-        expect(compareForestNodes(parentForest.get(parentId), parentNode));
-    });
-    it('can get parents in the forest', () => {
-        expect(parentForest.tryGetParent(parentId)).to.be.undefined;
-        expect(parentForest.tryGetParent(childId)?.parentId).to.equal(parentId);
-    });
-    it('can add nodes', () => {
-        let forestA = emptyForest;
-        const children = [];
-        const numToAdd = 10;
-        for (let i = 0; i < numToAdd; i++) {
-            const node = makeForestNodeWithChildren(testTree, testTree.generateNodeId());
-            children.push(node);
-            forestA = forestA.add([node]);
-        }
-        const forestB = emptyForest.add(children);
-        forestA.assertConsistent();
-        forestB.assertConsistent();
-        expect(forestA.size).to.equal(10);
-        expect(forestA.equals(forestB)).to.be.true;
-    });
-    // Test that Forest.add() adds descendants and ancestors correctly regardless of the order in which they are supplied
-    it('can add nodes in any order', () => {
-        const childId = testTree.generateNodeId();
-        const parentId = testTree.generateNodeId();
-        const child = makeForestNodeWithChildren(testTree, childId);
-        const parent = makeForestNodeWithChildren(testTree, parentId, childId);
-        const grandparent = makeForestNodeWithChildren(testTree, testTree.generateNodeId(), parentId);
-        const forestA = emptyForest.add([child, parent, grandparent]);
-        const forestB = emptyForest.add([grandparent, parent, child]);
-        forestA.assertConsistent();
-        forestB.assertConsistent();
-        expect(forestA.size).to.equal(3);
-        expect(forestA.equals(forestB)).to.be.true;
-    });
-    it('can replace payloads', () => {
-        expectSuccessfulReplace(oneNodeForest, parentId, 0); // Set a payload when there was none
-        expectSuccessfulReplace(oneNodeForest, parentId, 1); // Change a payload
-    });
-    it('can correctly attach a range to an empty trait on a root', () => {
-        const moreChildrenForest = oneNodeForest.add([
-            makeForestNodeWithChildren(testTree, childId),
-            makeForestNodeWithChildren(testTree, secondChildId),
-        ]);
-        expectSuccessfulAttach(moreChildrenForest, parentId, mainTraitLabel, 0, [childId, secondChildId]);
-    });
-    it('can correctly attach ranges to a populated trait on a root', () => {
-        const twoLeafForest = parentForest.add([
-            makeForestNodeWithChildren(testTree, secondChildId),
-            makeForestNodeWithChildren(testTree, thirdChildId),
-        ]);
-        expectSuccessfulAttach(twoLeafForest, parentId, mainTraitLabel, 1, [secondChildId]);
-        expectSuccessfulAttach(twoLeafForest, parentId, mainTraitLabel, 1, [thirdChildId]);
-    });
-    it('can correctly attach ranges under a leaf', () => {
-        const threeNodeForest = parentForest.add([makeForestNodeWithChildren(testTree, secondChildId)]);
-        expectSuccessfulAttach(threeNodeForest, childId, mainTraitLabel, 0, [secondChildId]);
-    });
-    it('only accepts valid indices for attaches', () => {
-        const twoNodeForest = oneNodeForest.add([makeForestNodeWithChildren(testTree, childId)]);
-        assert.throws(() => twoNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, -1, [childId]), (e) => validateAssertionError(e, 'invalid attach index'));
-        assert.throws(() => twoNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, 1, [childId]), (e) => validateAssertionError(e, 'invalid attach index'));
-    });
-    it('does not add trait when attaching empty range to empty trait', () => {
-        const forestWithAttach = oneNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, 0, []);
-        const newParent = forestWithAttach.get(parentId);
-        expect(newParent.traits.get(mainTraitLabel)).equals(undefined);
-    });
-    it('can correctly detach a range on a root node', () => {
-        expectSuccessfulDetach(threeLeafForest, parentId, mainTraitLabel, 1, 2);
-    });
-    it('can correctly detach a range on a leaf node', () => {
-        expectSuccessfulDetach(grandparentForest, childId, mainTraitLabel, 0, 1);
-    });
-    it('can correctly detach an entire trait', () => {
-        expectSuccessfulDetach(threeLeafForest, parentId, mainTraitLabel, 0, 2);
-    });
-    it('only accepts valid indices for detaches', () => {
-        assert.throws(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, -1, -1), (e) => validateAssertionError(e, 'invalid detach index range'));
-        assert.throws(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, -1, 0), (e) => validateAssertionError(e, 'invalid detach index range'));
-        assert.throws(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 1, 0), (e) => validateAssertionError(e, 'invalid detach index range'));
-        assert.throws(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 0, 2), (e) => validateAssertionError(e, 'invalid detach index range'));
-        assert.throws(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 1, 2), (e) => validateAssertionError(e, 'invalid detach index range'));
-    });
-    it('cannot delete parented nodes', () => {
-        assert.throws(() => parentForest.delete([childId], false), (e) => validateAssertionError(e, 'deleted nodes must be unparented'));
-    });
-    it('can delete a root', () => {
-        const deleteRoot = parentForest.delete([parentId], false);
-        deleteRoot.assertConsistent();
-        expect(deleteRoot.size).to.equal(1);
-        expect(deleteRoot.tryGet(childId)).to.not.be.undefined;
-    });
-    it('can delete a subtree', () => {
-        const deleteLeaf = parentForest.delete([parentId], true);
-        deleteLeaf.assertConsistent();
-        expect(deleteLeaf.size).to.equal(0);
-    });
-    it('calculates deltas correctly', () => {
-        const add = emptyForest.delta(oneNodeForest);
-        const remove = oneNodeForest.delta(emptyForest);
-        const same = parentForest.delta(parentForest);
-        const modified = parentForest.setValue(childId, -1);
-        const modify = parentForest.delta(modified);
-        expect(remove).deep.equals({ changed: [], added: [], removed: [parentId] });
-        expect(add).deep.equals({ changed: [], added: [parentId], removed: [] });
-        expect(same).deep.equals({ changed: [], added: [], removed: [] });
-        expect(modify).deep.equals({ changed: [childId], added: [], removed: [] });
-    });
-    it('calculates equality correctly', () => {
-        const modified = parentForest.setValue(parentId, -1);
-        expect(oneNodeForest.equals(emptyForest)).false;
-        expect(emptyForest.equals(oneNodeForest)).false;
-        expect(parentForest.equals(parentForest)).true;
-        expect(parentForest.equals(modified)).false;
-    });
-    function expectSuccessfulAttach(forest, parentId, label, index, childIds) {
-        const parent = forest.get(parentId);
-        const expectedTrait = [...(parent.traits.get(label) ?? [])];
-        expectedTrait.splice(index, 0, ...childIds);
-        const forestWithAttach = forest.attachRangeOfChildren(parentId, label, index, childIds);
-        const newParent = forestWithAttach.get(parentId);
-        expect(newParent.traits.get(label)).deep.equals(expectedTrait);
-        for (const childId of childIds) {
-            const parentData = forestWithAttach.tryGetParent(childId);
-            expect(parentData?.traitParent).to.equal(label);
-            expect(parentData?.parentId).to.equal(parentId);
-        }
-    }
-    function expectSuccessfulDetach(forest, parentId, label, startIndex, endIndex) {
-        const parent = forest.get(parentId);
-        const expectedTrait = [...(parent.traits.get(label) ?? [])];
-        const spliced = expectedTrait.splice(startIndex, endIndex - startIndex);
-        const { forest: forestWithDetach, detached } = forest.detachRangeOfChildren(parentId, label, startIndex, endIndex);
-        const newParent = forestWithDetach.get(parentId);
-        const trait = newParent.traits.get(label);
-        if (expectedTrait.length === 0) {
-            expect(trait).to.be.undefined;
-        }
-        else {
-            expect(trait).deep.equals(expectedTrait);
-        }
-        expect(detached).deep.equals(spliced);
-        for (const detachedId of detached) {
-            expect(forestWithDetach.tryGetParent(detachedId)).to.be.undefined;
-        }
-    }
-    function expectSuccessfulReplace(forest, nodeId, payload) {
-        const forestWithReplace = forest.setValue(nodeId, payload);
-        const newNode = forestWithReplace.get(nodeId);
-        expect(newNode.payload).equals(payload);
-    }
-});
-//# sourceMappingURL=Forest.tests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Forest.tests.js","sourceRoot":"","sources":["../../src/test/Forest.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAC5E,OAAO,EAAE,kBAAkB,EAAE,MAAM,EAAc,MAAM,cAAc,CAAC;AAItE,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAE/D,MAAM,cAAc,GAAG,MAAoB,CAAC;AAE5C,SAAS,0BAA0B,CAAC,QAAkB,EAAE,EAAU,EAAE,GAAG,QAAkB;IACxF,OAAO;QACN,GAAG,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QACzB,MAAM,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;KAC7E,CAAC;AACH,CAAC;AAED,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;IACvB,IAAI,QAAgB,CAAC;IACrB,IAAI,OAAe,CAAC;IACpB,IAAI,aAAqB,CAAC;IAC1B,IAAI,YAAoB,CAAC;IAEzB,IAAI,SAAqB,CAAC;IAC1B,IAAI,UAAsB,CAAC;IAC3B,IAAI,WAAmB,CAAC;IACxB,IAAI,aAAqB,CAAC;IAC1B,IAAI,YAAoB,CAAC;IACzB,IAAI,iBAAyB,CAAC;IAC9B,IAAI,eAAuB,CAAC;IAE5B,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE;QACjD,QAAQ,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC;QAC9B,OAAO,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC;QAC7B,aAAa,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC;QACnC,YAAY,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC;QAElC,SAAS,GAAG,0BAA0B,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACnD,UAAU,GAAG,0BAA0B,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAa,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QAC9C,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5G,iBAAiB,GAAG,YAAY;aAC9B,GAAG,CAAC,CAAC,0BAA0B,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;aACnD,qBAAqB,CAAC,OAAO,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC;QAErE,eAAe,GAAG,YAAY;aAC5B,GAAG,CAAC,CAAC,0BAA0B,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,0BAA0B,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;aAChG,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;IACrF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,WAAW,CAAC,gBAAgB,EAAE,CAAC;QAC/B,YAAY,CAAC,gBAAgB,EAAE,CAAC;QAChC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5G,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QACjE,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QAC5D,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACxB,IAAI,OAAO,GAAG,WAAW,CAAC;QAC1B,MAAM,QAAQ,GAAiB,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YAClC,MAAM,IAAI,GAAG,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAC7E,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;SAC9B;QACD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC1C,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC3B,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC3B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,qHAAqH;IACrH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,OAAO,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,0BAA0B,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAG,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACvE,MAAM,WAAW,GAAG,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,CAAC,cAAc,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC9F,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;QAC9D,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC3B,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC3B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC/B,uBAAuB,CAAC,aAAa,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,oCAAoC;QACzF,uBAAuB,CAAC,aAAa,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACnE,MAAM,kBAAkB,GAAG,aAAa,CAAC,GAAG,CAAC;YAC5C,0BAA0B,CAAC,QAAQ,EAAE,OAAO,CAAC;YAC7C,0BAA0B,CAAC,QAAQ,EAAE,aAAa,CAAC;SACnD,CAAC,CAAC;QAEH,sBAAsB,CAAC,kBAAkB,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC;IACnG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACrE,MAAM,aAAa,GAAG,YAAY,CAAC,GAAG,CAAC;YACtC,0BAA0B,CAAC,QAAQ,EAAE,aAAa,CAAC;YACnD,0BAA0B,CAAC,QAAQ,EAAE,YAAY,CAAC;SAClD,CAAC,CAAC;QAEH,sBAAsB,CAAC,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC;QACpF,sBAAsB,CAAC,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;IACpF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAChG,sBAAsB,CAAC,eAAe,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC;IACtF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QACzF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,aAAa,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,EAClF,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAC/D,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,aAAa,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,EACjF,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAC/D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACvE,MAAM,gBAAgB,GAAG,aAAa,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9F,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,sBAAsB,CAAC,eAAe,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,sBAAsB,CAAC,iBAAiB,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC/C,sBAAsB,CAAC,eAAe,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAC1E,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,4BAA4B,CAAC,CACrE,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EACzE,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,4BAA4B,CAAC,CACrE,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,EACxE,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,4BAA4B,CAAC,CACrE,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,EACxE,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,4BAA4B,CAAC,CACrE,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,EACxE,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,4BAA4B,CAAC,CACrE,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,EAC3C,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,kCAAkC,CAAC,CAC3E,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC5B,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;QAC1D,UAAU,CAAC,gBAAgB,EAAE,CAAC;QAC9B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC/B,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;QACzD,UAAU,CAAC,gBAAgB,EAAE,CAAC;QAC9B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAE5C,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC5E,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACzE,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;QAErD,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC;QAChD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC;QAChD,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/C,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,SAAS,sBAAsB,CAC9B,MAAc,EACd,QAAgB,EAChB,KAAiB,EACjB,KAAa,EACb,QAAkB;QAElB,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,aAAa,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5D,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;QAC5C,MAAM,gBAAgB,GAAG,MAAM,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACxF,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QAC/D,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAC/B,MAAM,UAAU,GAAG,gBAAgB,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAC1D,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAChD,MAAM,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;SAChD;IACF,CAAC;IAED,SAAS,sBAAsB,CAC9B,MAAc,EACd,QAAgB,EAChB,KAAiB,EACjB,UAAkB,EAClB,QAAgB;QAEhB,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,aAAa,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,UAAU,EAAE,QAAQ,GAAG,UAAU,CAAC,CAAC;QACxE,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC,qBAAqB,CAC1E,QAAQ,EACR,KAAK,EACL,UAAU,EACV,QAAQ,CACR,CAAC;QAEF,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE;YAC/B,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;SAC9B;aAAM;YACN,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;SACzC;QAED,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACtC,KAAK,MAAM,UAAU,IAAI,QAAQ,EAAE;YAClC,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;SAClE;IACF,CAAC;IAED,SAAS,uBAAuB,CAAC,MAAc,EAAE,MAAc,EAAE,OAAuB;QACvF,MAAM,iBAAiB,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC3D,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9C,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC;AACF,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from 'assert';\nimport { expect } from 'chai';\nimport { validateAssertionError } from '@fluidframework/test-runtime-utils';\nimport { compareForestNodes, Forest, ForestNode } from '../Forest.js';\nimport { NodeId, TraitLabel } from '../Identifiers.js';\nimport { Payload } from '../persisted-types/index.js';\nimport { TestTree } from './utilities/TestNode.js';\nimport { refreshTestTree } from './utilities/TestUtilities.js';\n\nconst mainTraitLabel = 'main' as TraitLabel;\n\nfunction makeForestNodeWithChildren(testTree: TestTree, id: NodeId, ...children: NodeId[]): ForestNode {\n\treturn {\n\t\t...testTree.buildLeaf(id),\n\t\ttraits: new Map(children.length > 0 ? [[mainTraitLabel, [...children]]] : []),\n\t};\n}\n\ndescribe('Forest', () => {\n\tlet parentId: NodeId;\n\tlet childId: NodeId;\n\tlet secondChildId: NodeId;\n\tlet thirdChildId: NodeId;\n\n\tlet childNode: ForestNode;\n\tlet parentNode: ForestNode;\n\tlet emptyForest: Forest;\n\tlet oneNodeForest: Forest;\n\tlet parentForest: Forest;\n\tlet grandparentForest: Forest;\n\tlet threeLeafForest: Forest;\n\n\tconst testTree = refreshTestTree(undefined, (t) => {\n\t\tparentId = t.generateNodeId();\n\t\tchildId = t.generateNodeId();\n\t\tsecondChildId = t.generateNodeId();\n\t\tthirdChildId = t.generateNodeId();\n\n\t\tchildNode = makeForestNodeWithChildren(t, childId);\n\t\tparentNode = makeForestNodeWithChildren(t, parentId);\n\t\temptyForest = Forest.create(true);\n\t\toneNodeForest = emptyForest.add([parentNode]);\n\t\tparentForest = oneNodeForest.add([childNode]).attachRangeOfChildren(parentId, mainTraitLabel, 0, [childId]);\n\t\tgrandparentForest = parentForest\n\t\t\t.add([makeForestNodeWithChildren(t, secondChildId)])\n\t\t\t.attachRangeOfChildren(childId, mainTraitLabel, 0, [secondChildId]);\n\n\t\tthreeLeafForest = parentForest\n\t\t\t.add([makeForestNodeWithChildren(t, secondChildId), makeForestNodeWithChildren(t, thirdChildId)])\n\t\t\t.attachRangeOfChildren(parentId, mainTraitLabel, 1, [secondChildId, thirdChildId]);\n\t});\n\n\tit('test forests are consistent', () => {\n\t\temptyForest.assertConsistent();\n\t\tparentForest.assertConsistent();\n\t\texpect(emptyForest.size).equals(0);\n\t\texpect(parentForest.size).equals(2);\n\t});\n\n\tit('fails on multiparenting', () => {\n\t\tassert.throws(() => oneNodeForest.add([makeForestNodeWithChildren(testTree, parentId, childId, childId)]));\n\t});\n\n\tit('cannot add a node with a duplicate ID', () => {\n\t\tassert.throws(() => oneNodeForest.add([makeForestNodeWithChildren(testTree, parentId)]));\n\t});\n\n\tit('can get nodes in the forest', () => {\n\t\texpect(compareForestNodes(parentForest.get(childId), childNode));\n\t\texpect(compareForestNodes(parentForest.get(parentId), parentNode));\n\t});\n\n\tit('can get parents in the forest', () => {\n\t\texpect(parentForest.tryGetParent(parentId)).to.be.undefined;\n\t\texpect(parentForest.tryGetParent(childId)?.parentId).to.equal(parentId);\n\t});\n\n\tit('can add nodes', () => {\n\t\tlet forestA = emptyForest;\n\t\tconst children: ForestNode[] = [];\n\t\tconst numToAdd = 10;\n\t\tfor (let i = 0; i < numToAdd; i++) {\n\t\t\tconst node = makeForestNodeWithChildren(testTree, testTree.generateNodeId());\n\t\t\tchildren.push(node);\n\t\t\tforestA = forestA.add([node]);\n\t\t}\n\t\tconst forestB = emptyForest.add(children);\n\t\tforestA.assertConsistent();\n\t\tforestB.assertConsistent();\n\t\texpect(forestA.size).to.equal(10);\n\t\texpect(forestA.equals(forestB)).to.be.true;\n\t});\n\n\t// Test that Forest.add() adds descendants and ancestors correctly regardless of the order in which they are supplied\n\tit('can add nodes in any order', () => {\n\t\tconst childId = testTree.generateNodeId();\n\t\tconst parentId = testTree.generateNodeId();\n\t\tconst child = makeForestNodeWithChildren(testTree, childId);\n\t\tconst parent = makeForestNodeWithChildren(testTree, parentId, childId);\n\t\tconst grandparent = makeForestNodeWithChildren(testTree, testTree.generateNodeId(), parentId);\n\t\tconst forestA = emptyForest.add([child, parent, grandparent]);\n\t\tconst forestB = emptyForest.add([grandparent, parent, child]);\n\t\tforestA.assertConsistent();\n\t\tforestB.assertConsistent();\n\t\texpect(forestA.size).to.equal(3);\n\t\texpect(forestA.equals(forestB)).to.be.true;\n\t});\n\n\tit('can replace payloads', () => {\n\t\texpectSuccessfulReplace(oneNodeForest, parentId, 0); // Set a payload when there was none\n\t\texpectSuccessfulReplace(oneNodeForest, parentId, 1); // Change a payload\n\t});\n\n\tit('can correctly attach a range to an empty trait on a root', () => {\n\t\tconst moreChildrenForest = oneNodeForest.add([\n\t\t\tmakeForestNodeWithChildren(testTree, childId),\n\t\t\tmakeForestNodeWithChildren(testTree, secondChildId),\n\t\t]);\n\n\t\texpectSuccessfulAttach(moreChildrenForest, parentId, mainTraitLabel, 0, [childId, secondChildId]);\n\t});\n\n\tit('can correctly attach ranges to a populated trait on a root', () => {\n\t\tconst twoLeafForest = parentForest.add([\n\t\t\tmakeForestNodeWithChildren(testTree, secondChildId),\n\t\t\tmakeForestNodeWithChildren(testTree, thirdChildId),\n\t\t]);\n\n\t\texpectSuccessfulAttach(twoLeafForest, parentId, mainTraitLabel, 1, [secondChildId]);\n\t\texpectSuccessfulAttach(twoLeafForest, parentId, mainTraitLabel, 1, [thirdChildId]);\n\t});\n\n\tit('can correctly attach ranges under a leaf', () => {\n\t\tconst threeNodeForest = parentForest.add([makeForestNodeWithChildren(testTree, secondChildId)]);\n\t\texpectSuccessfulAttach(threeNodeForest, childId, mainTraitLabel, 0, [secondChildId]);\n\t});\n\n\tit('only accepts valid indices for attaches', () => {\n\t\tconst twoNodeForest = oneNodeForest.add([makeForestNodeWithChildren(testTree, childId)]);\n\t\tassert.throws(\n\t\t\t() => twoNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, -1, [childId]),\n\t\t\t(e: Error) => validateAssertionError(e, 'invalid attach index')\n\t\t);\n\t\tassert.throws(\n\t\t\t() => twoNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, 1, [childId]),\n\t\t\t(e: Error) => validateAssertionError(e, 'invalid attach index')\n\t\t);\n\t});\n\n\tit('does not add trait when attaching empty range to empty trait', () => {\n\t\tconst forestWithAttach = oneNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, 0, []);\n\t\tconst newParent = forestWithAttach.get(parentId);\n\t\texpect(newParent.traits.get(mainTraitLabel)).equals(undefined);\n\t});\n\n\tit('can correctly detach a range on a root node', () => {\n\t\texpectSuccessfulDetach(threeLeafForest, parentId, mainTraitLabel, 1, 2);\n\t});\n\n\tit('can correctly detach a range on a leaf node', () => {\n\t\texpectSuccessfulDetach(grandparentForest, childId, mainTraitLabel, 0, 1);\n\t});\n\n\tit('can correctly detach an entire trait', () => {\n\t\texpectSuccessfulDetach(threeLeafForest, parentId, mainTraitLabel, 0, 2);\n\t});\n\n\tit('only accepts valid indices for detaches', () => {\n\t\tassert.throws(\n\t\t\t() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, -1, -1),\n\t\t\t(e: Error) => validateAssertionError(e, 'invalid detach index range')\n\t\t);\n\t\tassert.throws(\n\t\t\t() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, -1, 0),\n\t\t\t(e: Error) => validateAssertionError(e, 'invalid detach index range')\n\t\t);\n\t\tassert.throws(\n\t\t\t() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 1, 0),\n\t\t\t(e: Error) => validateAssertionError(e, 'invalid detach index range')\n\t\t);\n\t\tassert.throws(\n\t\t\t() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 0, 2),\n\t\t\t(e: Error) => validateAssertionError(e, 'invalid detach index range')\n\t\t);\n\t\tassert.throws(\n\t\t\t() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 1, 2),\n\t\t\t(e: Error) => validateAssertionError(e, 'invalid detach index range')\n\t\t);\n\t});\n\n\tit('cannot delete parented nodes', () => {\n\t\tassert.throws(\n\t\t\t() => parentForest.delete([childId], false),\n\t\t\t(e: Error) => validateAssertionError(e, 'deleted nodes must be unparented')\n\t\t);\n\t});\n\n\tit('can delete a root', () => {\n\t\tconst deleteRoot = parentForest.delete([parentId], false);\n\t\tdeleteRoot.assertConsistent();\n\t\texpect(deleteRoot.size).to.equal(1);\n\t\texpect(deleteRoot.tryGet(childId)).to.not.be.undefined;\n\t});\n\n\tit('can delete a subtree', () => {\n\t\tconst deleteLeaf = parentForest.delete([parentId], true);\n\t\tdeleteLeaf.assertConsistent();\n\t\texpect(deleteLeaf.size).to.equal(0);\n\t});\n\n\tit('calculates deltas correctly', () => {\n\t\tconst add = emptyForest.delta(oneNodeForest);\n\t\tconst remove = oneNodeForest.delta(emptyForest);\n\t\tconst same = parentForest.delta(parentForest);\n\t\tconst modified = parentForest.setValue(childId, -1);\n\t\tconst modify = parentForest.delta(modified);\n\n\t\texpect(remove).deep.equals({ changed: [], added: [], removed: [parentId] });\n\t\texpect(add).deep.equals({ changed: [], added: [parentId], removed: [] });\n\t\texpect(same).deep.equals({ changed: [], added: [], removed: [] });\n\t\texpect(modify).deep.equals({ changed: [childId], added: [], removed: [] });\n\t});\n\n\tit('calculates equality correctly', () => {\n\t\tconst modified = parentForest.setValue(parentId, -1);\n\n\t\texpect(oneNodeForest.equals(emptyForest)).false;\n\t\texpect(emptyForest.equals(oneNodeForest)).false;\n\t\texpect(parentForest.equals(parentForest)).true;\n\t\texpect(parentForest.equals(modified)).false;\n\t});\n\n\tfunction expectSuccessfulAttach(\n\t\tforest: Forest,\n\t\tparentId: NodeId,\n\t\tlabel: TraitLabel,\n\t\tindex: number,\n\t\tchildIds: NodeId[]\n\t): void {\n\t\tconst parent = forest.get(parentId);\n\t\tconst expectedTrait = [...(parent.traits.get(label) ?? [])];\n\t\texpectedTrait.splice(index, 0, ...childIds);\n\t\tconst forestWithAttach = forest.attachRangeOfChildren(parentId, label, index, childIds);\n\t\tconst newParent = forestWithAttach.get(parentId);\n\t\texpect(newParent.traits.get(label)).deep.equals(expectedTrait);\n\t\tfor (const childId of childIds) {\n\t\t\tconst parentData = forestWithAttach.tryGetParent(childId);\n\t\t\texpect(parentData?.traitParent).to.equal(label);\n\t\t\texpect(parentData?.parentId).to.equal(parentId);\n\t\t}\n\t}\n\n\tfunction expectSuccessfulDetach(\n\t\tforest: Forest,\n\t\tparentId: NodeId,\n\t\tlabel: TraitLabel,\n\t\tstartIndex: number,\n\t\tendIndex: number\n\t): void {\n\t\tconst parent = forest.get(parentId);\n\t\tconst expectedTrait = [...(parent.traits.get(label) ?? [])];\n\t\tconst spliced = expectedTrait.splice(startIndex, endIndex - startIndex);\n\t\tconst { forest: forestWithDetach, detached } = forest.detachRangeOfChildren(\n\t\t\tparentId,\n\t\t\tlabel,\n\t\t\tstartIndex,\n\t\t\tendIndex\n\t\t);\n\n\t\tconst newParent = forestWithDetach.get(parentId);\n\t\tconst trait = newParent.traits.get(label);\n\t\tif (expectedTrait.length === 0) {\n\t\t\texpect(trait).to.be.undefined;\n\t\t} else {\n\t\t\texpect(trait).deep.equals(expectedTrait);\n\t\t}\n\n\t\texpect(detached).deep.equals(spliced);\n\t\tfor (const detachedId of detached) {\n\t\t\texpect(forestWithDetach.tryGetParent(detachedId)).to.be.undefined;\n\t\t}\n\t}\n\n\tfunction expectSuccessfulReplace(forest: Forest, nodeId: NodeId, payload: Payload | null): void {\n\t\tconst forestWithReplace = forest.setValue(nodeId, payload);\n\t\tconst newNode = forestWithReplace.get(nodeId);\n\t\texpect(newNode.payload).equals(payload);\n\t}\n});\n"]}

package/lib/test/GenericTransaction.tests.d.ts

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

package/lib/test/GenericTransaction.tests.d.ts.map

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

package/lib/test/GenericTransaction.tests.js

@@ -1,31 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { EditStatus } from '../persisted-types/index.js';
-import { refreshTestTree } from './utilities/TestUtilities.js';
-import { MockTransaction } from './utilities/MockTransaction.js';
-describe('GenericTransaction', () => {
-    const testTree = refreshTestTree();
-    it('does not read the reconciliation path when change resolution does not require it', () => {
-        const trappedPath = new Proxy([], {
-            get: (target, prop) => {
-                expect('the path was read').equals('the path should not be read');
-                return target[prop];
-            },
-        });
-        const transaction = MockTransaction.factory(testTree.view);
-        transaction.applyChanges([{}, {}], trappedPath);
-        expect(transaction.status).equals(EditStatus.Applied);
-    });
-    it('reflects failure status when validateOnClose is not successful', () => {
-        const transaction = MockTransaction.factory(testTree.view, {
-            statusOnClose: EditStatus.Invalid,
-        });
-        const result = transaction.close();
-        expect(result.status).equals(EditStatus.Invalid);
-        expect(transaction.status).equals(EditStatus.Invalid);
-    });
-});
-//# sourceMappingURL=GenericTransaction.tests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"GenericTransaction.tests.js","sourceRoot":"","sources":["../../src/test/GenericTransaction.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAE9B,OAAO,EAAkB,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzE,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,EAAE,eAAe,EAAE,MAAM,gCAAgC,CAAC;AAEjE,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IACnC,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IACnC,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;QAC3F,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,EAA0B,EAAE;YACzD,GAAG,EAAE,CAAC,MAAM,EAAE,IAAI,EAAW,EAAE;gBAC9B,MAAM,CAAC,mBAAmB,CAAC,CAAC,MAAM,CAAC,6BAA6B,CAAC,CAAC;gBAClE,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;SACD,CAAC,CAAC;QACH,MAAM,WAAW,GAAG,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC3D,WAAW,CAAC,YAAY,CAAC,CAAC,EAAE,EAAE,EAAE,CAAgC,EAAE,WAAW,CAAC,CAAC;QAC/E,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACzE,MAAM,WAAW,GAAG,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE;YAC1D,aAAa,EAAE,UAAU,CAAC,OAAO;SACjC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACjD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IACvD,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 { ReconciliationEdit } from '../ReconciliationPath.js';\nimport { ChangeInternal, EditStatus } from '../persisted-types/index.js';\nimport { refreshTestTree } from './utilities/TestUtilities.js';\nimport { MockTransaction } from './utilities/MockTransaction.js';\n\ndescribe('GenericTransaction', () => {\n\tconst testTree = refreshTestTree();\n\tit('does not read the reconciliation path when change resolution does not require it', () => {\n\t\tconst trappedPath = new Proxy([] as ReconciliationEdit[], {\n\t\t\tget: (target, prop): unknown => {\n\t\t\t\texpect('the path was read').equals('the path should not be read');\n\t\t\t\treturn target[prop];\n\t\t\t},\n\t\t});\n\t\tconst transaction = MockTransaction.factory(testTree.view);\n\t\ttransaction.applyChanges([{}, {}] as unknown as ChangeInternal[], trappedPath);\n\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t});\n\n\tit('reflects failure status when validateOnClose is not successful', () => {\n\t\tconst transaction = MockTransaction.factory(testTree.view, {\n\t\t\tstatusOnClose: EditStatus.Invalid,\n\t\t});\n\t\tconst result = transaction.close();\n\t\texpect(result.status).equals(EditStatus.Invalid);\n\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t});\n});\n"]}

package/lib/test/HistoryEditFactory.tests.d.ts

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

package/lib/test/HistoryEditFactory.tests.d.ts.map

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